Java Doc for HashCodeUtil.java in  » Database-ORM » MMBase » org » mmbase » util » 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 » Database ORM » MMBase » org.mmbase.util 
Source Cross Reference  Class Diagram Java Document (Java Doc) 


java.lang.Object
   org.mmbase.util.HashCodeUtil

HashCodeUtil
final public class HashCodeUtil (Code)
http://www.macchiato.com/columns/Durable6.html Hash Collections (HashSet, HashMap, Hashtable, etc) are typically implemented with an array of buckets. Each bucket is itself an array or linked list of pairs. To decide which keys go into which buckets, the array index for the bucket is produced by taking the hash value, modulo the size of the collection. That is, bucketIndex = abs(hashValue % tableSize); Within each bucket, the search for the object is sequential, and uses equals. In the ideal case, the table size is a prime number, the hash values would be evenly distributed, and each bucket would contain just one value. Lookup in that case is incredibly fast: just one call to hashCode and one call to equals. If the hash values (modulo the table size) are constant, you have the worst case; all the objects will be in one bucket, and accessing the objects will require a sequential search through every single item in the hash table, calling equals for every single item. Lookup in that case will be incredibly slooow! Requirements: synchronization with Equality If x.equals(y), then x.hashCode() == y.hashCode() That is, if two objects are equal, then their hash values are equal. Not that the reverse is not true; two objects may have the same hash value but not be equal! Basic design goals: Even Distribution An ideal implementation would return integer values that are evenly distributed over the range from zero to Integer.MAX_VALUE. That is, if I picked a million random objects, their hash values would be pretty randomly distributed over this range. In the best case, any unequal objects would have different hash values. Fast An ideal implementation would compute the hash value very quickly. After all, this method is going to be called every time an object is put into a hash-based collection, and every time you query whether an object is in a hash-based collection. Simple Since you should implement this for every object that could go into hash-based collections, you want your code to be simple to write and easy to maintain.
since:
   MMBase-1.8




Method Summary
final public static  inthashCode(int source, boolean x)
    
final public static  inthashCode(int source, int x)
    
final public static  inthashCode(int source, long x)
    
final public static  inthashCode(int source, float x)
    
final public static  inthashCode(int source, double x)
    
final public static  inthashCode(int source, Object x)
    
final public static  inthashCode(int source, boolean[] x)
    
final public static  inthashCode(int source, int[] x)
    
final public static  inthashCode(int source, long[] x)
    
final public static  inthashCode(int source, float[] x)
    
final public static  inthashCode(int source, double[] x)
    
final public static  inthashCode(int source, Object[] x)
    
final public static  inthashCodeGentle(int source, Object[] x)
    
final public static  inthashCodeGentle2(int source, Object[] x)
    



Method Detail
hashCode
final public static int hashCode(int source, boolean x)(Code)



hashCode
final public static int hashCode(int source, int x)(Code)



hashCode
final public static int hashCode(int source, long x)(Code)



hashCode
final public static int hashCode(int source, float x)(Code)



hashCode
final public static int hashCode(int source, double x)(Code)



hashCode
final public static int hashCode(int source, Object x)(Code)



hashCode
final public static int hashCode(int source, boolean[] x)(Code)



hashCode
final public static int hashCode(int source, int[] x)(Code)



hashCode
final public static int hashCode(int source, long[] x)(Code)



hashCode
final public static int hashCode(int source, float[] x)(Code)



hashCode
final public static int hashCode(int source, double[] x)(Code)



hashCode
final public static int hashCode(int source, Object[] x)(Code)



hashCodeGentle
final public static int hashCodeGentle(int source, Object[] x)(Code)



hashCodeGentle2
final public static int hashCodeGentle2(int source, Object[] x)(Code)



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.