HomeSort by relevance Sort by last modified time
    Searched defs:perfect (Results 1 - 4 of 4) sorted by null

  /external/chromium_org/chrome/browser/ui/app_list/search/
history_data.cc 116 const bool perfect = assoc_it->first == query; local
119 perfect ? PERFECT_PRIMARY : PREFIX_PRIMARY;
122 perfect ? PERFECT_SECONDARY : PREFIX_SECONDARY;
  /external/chromium_org/third_party/libjpeg_turbo/
transupp.h 130 boolean perfect; /* if TRUE, fail if partial MCUs are requested */ member in struct:__anon17398
  /external/chromium_org/third_party/yasm/source/patched-yasm/tools/genperf/
perfect.c 4 perfect.c: code to generate code for a hash for perfect hashing.
8 Source is http://burtleburtle.net/bob/c/perfect.c
10 This generates a minimal perfect hash function. That means, given a
14 The perfect hash function first uses a normal hash function on the key
16 keys, then it computes a^scramble[tab[b]] to get the final perfect hash.
22 perfect hash functions for large databases", Fox, Heath, Chen, and Daoud,
34 array that we fill in in such a way as to make the hash perfect.
43 find a perfect matching in this graph. If we succeed, we have
44 determined a perfect hash for the whole set of keys
536 static int perfect( function
    [all...]
perfect.h 3 perfect.h: code to generate code for a hash for perfect hashing.
7 Source is http://burtleburtle.net/bob/c/perfect.h
15 #ifndef PERFECT
16 #define PERFECT
22 #define RETRY_PERFECT 1 /* number of times to try to make a perfect hash */
31 * and assign it the value of the perfect hash using the function inputs.
52 /* user directives: perfect hash? minimal perfect hash? input is an int? */
69 NORMAL_HP, /* just find a perfect hash *
71 } perfect; member in struct:hashform
    [all...]

Completed in 64 milliseconds