Java Doc for Sort.java in  » Web-Framework » rife-1.6.1 » com » uwyn » rife » tools » Java Source Code / Java DocumentationJava Source Code and Java Documentation

Java Source Code / Java Documentation
1. 6.0 JDK Core
2. 6.0 JDK Modules
3. 6.0 JDK Modules com.sun
4. 6.0 JDK Modules com.sun.java
5. 6.0 JDK Modules sun
6. 6.0 JDK Platform
7. Ajax
8. Apache Harmony Java SE
9. Aspect oriented
10. Authentication Authorization
11. Blogger System
12. Build
13. Byte Code
14. Cache
15. Chart
16. Chat
17. Code Analyzer
18. Collaboration
19. Content Management System
20. Database Client
21. Database DBMS
22. Database JDBC Connection Pool
23. Database ORM
24. Development
25. EJB Server geronimo
26. EJB Server GlassFish
27. EJB Server JBoss 4.2.1
28. EJB Server resin 3.1.5
29. ERP CRM Financial
30. ESB
31. Forum
32. GIS
33. Graphic Library
34. Groupware
35. HTML Parser
36. IDE
37. IDE Eclipse
38. IDE Netbeans
39. Installer
40. Internationalization Localization
41. Inversion of Control
42. Issue Tracking
43. J2EE
44. JBoss
45. JMS
46. JMX
47. Library
48. Mail Clients
49. Net
50. Parser
51. PDF
52. Portal
53. Profiler
54. Project Management
55. Report
56. RSS RDF
57. Rule Engine
58. Science
59. Scripting
60. Search Engine
61. Security
62. Sevlet Container
63. Source Control
64. Swing Library
65. Template Engine
66. Test Coverage
67. Testing
68. UML
69. Web Crawler
70. Web Framework
71. Web Mail
72. Web Server
73. Web Services
74. Web Services apache cxf 2.0.1
75. Web Services AXIS2
76. Wiki Engine
77. Workflow Engines
78. XML
79. XML UI
Java
Java Tutorial
Java Open Source
Jar File Download
Java Articles
Java Products
Java by API
Photoshop Tutorials
Maya Tutorials
Flash Tutorials
3ds-Max Tutorials
Illustrator Tutorials
GIMP Tutorials
C# / C Sharp
C# / CSharp Tutorial
C# / CSharp Open Source
ASP.Net
ASP.NET Tutorial
JavaScript DHTML
JavaScript Tutorial
JavaScript Reference
HTML / CSS
HTML CSS Reference
C / ANSI-C
C Tutorial
C++
C++ Tutorial
Ruby
PHP
Python
Python Tutorial
Python Open Source
SQL Server / T-SQL
SQL Server / T-SQL Tutorial
Oracle PL / SQL
Oracle PL/SQL Tutorial
PostgreSQL
SQL / MySQL
MySQL Tutorial
VB.Net
VB.Net Tutorial
Flash / Flex / ActionScript
VBA / Excel / Access / Word
XML
XML Tutorial
Microsoft Office PowerPoint 2007 Tutorial
Microsoft Office Excel 2007 Tutorial
Microsoft Office Word 2007 Tutorial
Java Source Code / Java Documentation » Web Framework » rife 1.6.1 » com.uwyn.rife.tools 
Source Cross Reference  Class Diagram Java Document (Java Doc) 


java.lang.Object
   com.uwyn.rife.tools.Sort

All known Subclasses:   com.uwyn.rife.tools.SortListComparables,
Sort
abstract public class Sort (Code)
Generic class that implements the quicksort algorithm. Extending classes have to implement the abstract methods so that the sorting algorithm can perform the appropriate modifications to the extending class's datastructure.
author:
   Geert Bevin (gbevin[remove] at uwyn dot com)
version:
   $Revision: 3634 $
since:
   1.0




Method Summary
abstract protected  intcompare(Object element1, Object element2)
     Compares the entries, determining which one comes before the other.
Parameters:
  element1 - An Object instance containing the firstentry.
Parameters:
  element2 - An Object instance containing the secondentry.
abstract protected  ObjectelementAt(Object dataToSort, int position)
     Retrieves an entry from a certain position within the specified datastructure.
Parameters:
  dataToSort - An Object instance that points to thedatastructure from where the entry has to be retrieved.
Parameters:
  position - An integer with the position of the entry that has to beretrieved.
final protected  voidquickSort(Object dataToSort, int lo0, int hi0, boolean ascending)
     This method contains the actual sorting algorithm.
final public  voidsort(Object dataToSort, int lastElementPosition, boolean ascending)
     Starts the sorting of the provided datastructure.
Parameters:
  dataToSort - An Object instance that points to thedatastructure that has to be sorted.
abstract protected  voidswap(Object dataToSort, int position1, int position2)
     Swaps the position of two entries in the provided datastructure.



Method Detail
compare
abstract protected int compare(Object element1, Object element2)(Code)
Compares the entries, determining which one comes before the other.
Parameters:
  element1 - An Object instance containing the firstentry.
Parameters:
  element2 - An Object instance containing the secondentry. 0 if the two entries are equals; or

an integer <0 if the first entry comes before the secondone; or

an integer >0 if the first entry comes after the secondone
since:
   1.0




elementAt
abstract protected Object elementAt(Object dataToSort, int position)(Code)
Retrieves an entry from a certain position within the specified datastructure.
Parameters:
  dataToSort - An Object instance that points to thedatastructure from where the entry has to be retrieved.
Parameters:
  position - An integer with the position of the entry that has to beretrieved. An Object instace containing the entry at thespecified position.
since:
   1.0



quickSort
final protected void quickSort(Object dataToSort, int lo0, int hi0, boolean ascending)(Code)
This method contains the actual sorting algorithm.
Parameters:
  dataToSort - An Object instance that points to thedatastructure that has to be sorted.
Parameters:
  lo0 - An integer indicating the bottom boundary of the range thatwill be sorted.
Parameters:
  hi0 - An integer indicating the upper boundary of the range thatwill be sorted.
Parameters:
  ascending - true of the data has to be sorted in an ascendingfashion and false otherwise
since:
   1.0



sort
final public void sort(Object dataToSort, int lastElementPosition, boolean ascending)(Code)
Starts the sorting of the provided datastructure.
Parameters:
  dataToSort - An Object instance that points to thedatastructure that has to be sorted. The extending class should know howto manipulate this particular datastructure.
Parameters:
  lastElementPosition - An integer that specifies the position of thelast element in the provided datastructure.
Parameters:
  ascending - true of the data has to be sorted in an ascendingfashion and false otherwise
since:
   1.0



swap
abstract protected void swap(Object dataToSort, int position1, int position2)(Code)
Swaps the position of two entries in the provided datastructure. This is an abstract method that needs to be implemented by every extending class.
Parameters:
  dataToSort - An Object instance that points to thedatastructure in which the entries have to be swapped.
Parameters:
  position1 - An integer with the position of the first entry.
Parameters:
  position2 - An integer with the position of the second entry.
since:
   1.0



Methods inherited from java.lang.Object
native protected Object clone() throws CloneNotSupportedException(Code)(Java Doc)
public boolean equals(Object obj)(Code)(Java Doc)
protected void finalize() throws Throwable(Code)(Java Doc)
final native public Class getClass()(Code)(Java Doc)
native public int hashCode()(Code)(Java Doc)
final native public void notify()(Code)(Java Doc)
final native public void notifyAll()(Code)(Java Doc)
public String toString()(Code)(Java Doc)
final native public void wait(long timeout) throws InterruptedException(Code)(Java Doc)
final public void wait(long timeout, int nanos) throws InterruptedException(Code)(Java Doc)
final public void wait() throws InterruptedException(Code)(Java Doc)

www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.