HomeSort by relevance Sort by last modified time
    Searched full:uhash_nextelement (Results 1 - 16 of 16) sorted by null

  /external/icu4c/common/
uhash.h 50 * and uhash_nextElement() consistent with one another.
52 * To see everything in a hashtable, use uhash_nextElement() to
60 * should the UHashElement returned by uhash_nextElement be modified
521 uhash_nextElement(const UHashtable *hash,
525 * Remove an element, returned by uhash_nextElement(), from the table.
528 * @param e The element, returned by uhash_nextElement(), to remove.
530 * as this was returned by uhash_nextElement() it will not be empty or
rbbistbl.cpp 236 e = uhash_nextElement(fHashTable, &pos);
251 e = uhash_nextElement(fHashTable, &pos);
hash.h 186 return uhash_nextElement(hash, &pos);
uhash.c 579 while ((e = (UHashElement*) uhash_nextElement(hash, &pos)) != NULL) {
762 while ((e = uhash_nextElement(hash, &pos)) != NULL) {
779 uhash_nextElement(const UHashtable *hash, int32_t *pos) {
916 const UHashElement* elem1 = uhash_nextElement(hash1, &pos);
    [all...]
usprep.cpp 152 while ((e = uhash_nextElement(SHARED_DATA_HASHTABLE, &pos)) != NULL)
ucnv_bld.c     [all...]
uresbund.c 187 while ((e = uhash_nextElement(cache, &pos)) != NULL)
232 while ((e = uhash_nextElement(cache, &pos)) != NULL) {
    [all...]
  /external/icu4c/i18n/
colldata.cpp 606 while ((element = uhash_nextElement(cache, &pos)) != NULL) {
ucol_elm.cpp 800 while((e = uhash_nextElement(t->prefixLookup, &i)) != NULL) {
    [all...]
  /external/icu4c/tools/gensprep/
store.c 262 while( (element = uhash_nextElement(hashTable, &pos))!=NULL){
  /external/icu4c/common/unicode/
urename.h     [all...]
  /external/webkit/Source/JavaScriptCore/icu/unicode/
urename.h     [all...]
  /external/webkit/Source/JavaScriptGlue/icu/unicode/
urename.h     [all...]
  /external/webkit/Source/WebCore/icu/unicode/
urename.h     [all...]
  /external/webkit/Source/WebKit/mac/icu/unicode/
urename.h     [all...]
  /external/icu4c/tools/genrb/
reslist.c     [all...]

Completed in 232 milliseconds