HomeSort by relevance Sort by last modified time
    Searched refs:BucketKey (Results 1 - 2 of 2) sorted by null

  /external/opencv3/modules/flann/include/opencv2/flann/
lsh_index.h 243 void fill_xor_mask(lsh::BucketKey key, int lowest_index, unsigned int level,
244 std::vector<lsh::BucketKey>& xor_masks)
250 lsh::BucketKey new_key = key | (1 << index);
274 std::vector<lsh::BucketKey>::const_iterator xor_mask = xor_masks_.begin();
275 std::vector<lsh::BucketKey>::const_iterator xor_mask_end = xor_masks_.end();
312 std::vector<lsh::BucketKey>::const_iterator xor_mask = xor_masks_.begin();
313 std::vector<lsh::BucketKey>::const_iterator xor_mask_end = xor_masks_.end();
345 std::vector<lsh::BucketKey>::const_iterator xor_mask = xor_masks_.begin();
346 std::vector<lsh::BucketKey>::const_iterator xor_mask_end = xor_masks_.end();
349 const lsh::Bucket* bucket = table->getBucketFromKey((lsh::BucketKey)sub_key)
    [all...]
lsh_table.h 72 typedef unsigned int BucketKey;
136 typedef std::unordered_map<BucketKey, Bucket> BucketsSpace;
138 typedef std::map<BucketKey, Bucket> BucketsSpace;
171 BucketKey key = (lsh::BucketKey)getKey(feature);
210 inline const Bucket* getBucketFromKey(BucketKey key) const
268 const size_t key_size_upper_bound = std::min(sizeof(BucketKey) * CHAR_BIT + 1, sizeof(size_t) * CHAR_BIT);
299 if (((std::max(buckets_space_.size(), buckets_speed_.size()) * CHAR_BIT * 3 * sizeof(BucketKey)) / 10

Completed in 53 milliseconds