Home
last modified time | relevance | path

Searched refs:buckets (Results 1 – 3 of 3) sorted by relevance

/base/startup/init_lite/services/utils/
Dinit_hashmap.c25 HashNode *buckets[0]; member
91 HashNode *tmp = GetHashNodeByNode(tab, tab->buckets[hashCode], node); in HashMapAdd()
96 node->next = tab->buckets[hashCode]; in HashMapAdd()
97 tab->buckets[hashCode] = node; in HashMapAdd()
111 HashNode *node = tab->buckets[hashCode]; in HashMapRemove()
117 if (node == tab->buckets[hashCode]) { in HashMapRemove()
118 tab->buckets[hashCode] = node->next; in HashMapRemove()
138 return GetHashNodeByKey(tab, tab->buckets[hashCode], key, tab->keyCompare); in HashMapGet()
161 HashListFree(tab, tab->buckets[i]); in HashMapDestory()
175 return GetHashNodeByKey(tab, tab->buckets[hashCode], key, keyCompare); in HashMapFind()
/base/update/updater/services/diffpatch/diff/
Dblocks_diff.cpp409 std::vector<DataType> buckets; in Init() local
410 InitBuckets(oldInfo, buckets, suffixArrayTemp); in Init()
565 std::vector<DataType> &buckets, std::vector<DataType> &suffixArrayTemp) in InitBuckets() argument
569 buckets.resize(BUCKET_SIZE, 0); in InitBuckets()
572 buckets[oldInfo.buffer[i]]++; in InitBuckets()
574 for (size_t i = 1; i < buckets.size(); i++) { in InitBuckets()
575 buckets[i] += buckets[i - 1]; in InitBuckets()
577 for (size_t i = buckets.size() - 1; i > 0; i--) { in InitBuckets()
578 buckets[i] = buckets[i - 1]; in InitBuckets()
580 buckets[0] = 0; in InitBuckets()
[all …]
Dblocks_diff.h39 std::vector<DataType> &buckets, std::vector<DataType> &suffixArrayTemp);