Home | History | Annotate | Download | only in JavaScriptCore

Lines Matching full:hash

939 hash tables with floating
949 (WTF::FloatHash::hash): Use a union when punning between a float / double
1638 Dereference identifiers when deleting a hash table (fixes leaks with private JSGlobalData
3857 unnecessary hash table lookup since the object wrappers themselves don't
7912 * kjs/ustring.h: Made RefPtr<UString::Rep> use the same default hash as UString::Rep* (it
9374 - save a hash lookup wne writing to global properties
9379 before hash lookup.
16890 Qt/Windows build fix. The externally declared hash tables are actually
17016 - make sure RefPtr's default hash doesn't ref/deref when computing the hash
17017 - remove remnants of the hash table storage type optimization
17019 * wtf/HashFunctions.h: Used "using" to get the hash and equal functions
17058 Fix crash inside PtrHash::hash when loading a page.
17060 * wtf/HashFunctions.h: Explicitly use the superclass implementation of hash to avoid infinite recursion.
17070 implementation between hash tables with integers, pointers, RefPtr, and String objects
17120 * kjs/SymbolTable.h: Changed IdentifierRepHash to inherit from the default hash for
17121 a RefPtr so we don't have to define so much. Added an overload of the hash function for
17151 * wtf/HashFunctions.h: Overload the hash and equal functions for RefPtr's default
17152 hash to take raw pointers. This works with the changes to RefPtrHashMap to avoid
17157 (WTF::HashMap::get): Removed code that checks for an empty hash table before calling
17197 (WTF::HashMap::get): Removed code that checks for an empty hash table before calling
17325 - simplify use of HashTraits to prepare for some upcoming hash table changes
17953 Add default hash for pairs of hashable types.
17956 (WTF::PairHash::hash):
18938 hash table to take advantage of the identifier objects
18943 * kjs/create_hash_table: Compute size of hash table large enough so that there
18944 are no collisions, but don't generate the hash table.
20583 Geoff's theory is that the slowdown was due to copying hash tables when
24462 (PackedCache::Hash):
24532 in hash map. Can't avoid the branch because we can't look for 0 in the hash.
28125 (KJS::RegExpObjectImp::input): Added. No reason to go through hash tables
28250 but still does only one hash table lookup.
28544 double hash. Besides the SunSpider win, I used the dump statistics
29373 (KJS::IdentifierRepHash::hash): Special hash function for identifier reps.
29398 to the empty or deleted value, and used this to optimize the comparisons done in hash lookup.
29411 - Made simple translators avoid passing a hash code around
29471 hash value. Also changed O(n) strlen to O(1) check for empty string.
29511 (KJS::Identifier::addSlowCase): Ensure that empty Identifiers have a hash computed,
29602 hash value. Also, return immediately instead of branching to the end
29613 UString's hash value. Used when the caller knows that the hash value
30353 - separate out the code to create a hash table the first time from the code
30389 change static hash tables to use powers of two for speed
30398 (KJS::Lookup::findEntry): Get the hash directly, since we know identifiers already have computed
30399 their hash -- saves a branch.