Home
last modified time | relevance | path

Searched refs:step (Results 1 – 16 of 16) sorted by relevance

/redis-3.2.3/deps/geohash-int/
H A Dgeohash.c122 double longitude, double latitude, uint8_t step, in geohashEncode() argument
125 if (hash == NULL || step > 32 || step == 0 || in geohashEncode()
134 hash->step = step; in geohashEncode()
147 lat_offset *= (1 << step); in geohashEncode()
148 long_offset *= (1 << step); in geohashEncode()
161 return geohashEncodeType(longitude, latitude, step, hash); in geohashEncodeWGS84()
172 uint8_t step = hash.step; in geohashDecode() local
231 uint64_t zz = 0x5555555555555555ULL >> (64 - hash->step * 2); in geohash_move_x()
240 x &= (0xaaaaaaaaaaaaaaaaULL >> (64 - hash->step * 2)); in geohash_move_x()
251 uint64_t zz = 0xaaaaaaaaaaaaaaaaULL >> (64 - hash->step * 2); in geohash_move_y()
[all …]
H A Dgeohash_helper.c62 int step = 1; in geohashEstimateStepsByRadius() local
65 step++; in geohashEstimateStepsByRadius()
67 step -= 2; /* Make sure range is included in most of the base cases. */ in geohashEstimateStepsByRadius()
73 step--; in geohashEstimateStepsByRadius()
74 if (lat > 80 || lat < -80) step--; in geohashEstimateStepsByRadius()
78 if (step < 1) step = 1; in geohashEstimateStepsByRadius()
79 if (step > 26) step = 26; in geohashEstimateStepsByRadius()
80 return step; in geohashEstimateStepsByRadius()
85 return a->step != b->step ? a->step - b->step : a->bits - b->bits; in geohashBitsComparator()
205 bits <<= (52 - hash.step * 2); in geohashAlign52Bits()
H A Dgeohash.h43 #define HASHISZERO(r) (!(r).bits && !(r).step)
68 uint8_t step; member
99 double longitude, double latitude, uint8_t step,
102 uint8_t step, GeoHashBits *hash);
103 int geohashEncodeWGS84(double longitude, double latitude, uint8_t step,
H A Dgeohash_helper.h38 #define GZERO(s) s.bits = s.step = 0;
39 #define GISZERO(s) (!s.bits && !s.step)
40 #define GISNOTZERO(s) (s.bits || s.step)
/redis-3.2.3/utils/hyperloglog/
H A Dhll-gnuplot-graph.rb21 def run_experiment(r,seed,max,step) argument
25 step = 1000 if step > 1000
28 step.times {
42 def filter_samples(numsets,max,step,filter) argument
46 dataset[i] = run_experiment(r,i,max,step)
/redis-3.2.3/src/
H A Dsparkline.c119 int step; in sparklineRenderRange() local
122 step = (int) (relval*steps)/relmax; in sparklineRenderRange()
123 if (step < 0) step = 0; in sparklineRenderRange()
124 if (step >= steps) step = steps-1; in sparklineRenderRange()
128 int charidx = step-((rows-row-1)*charset_len); in sparklineRenderRange()
H A Dmemtest.c139 unsigned long step = 4096/sizeof(unsigned long); in memtest_fill_random() local
141 unsigned long iwords = words/step; /* words per iteration */ in memtest_fill_random()
147 for (off = 0; off < step; off++) { in memtest_fill_random()
153 l1 += step; in memtest_fill_random()
154 l2 += step; in memtest_fill_random()
166 unsigned long step = 4096/sizeof(unsigned long); in memtest_fill_value() local
168 unsigned long iwords = words/step; /* words per iteration */ in memtest_fill_value()
172 for (off = 0; off < step; off++) { in memtest_fill_value()
186 l1 += step; in memtest_fill_value()
187 l2 += step; in memtest_fill_value()
H A Dscripting.c69 int step; /* Stop at next line ragardless of breakpoints. */ member
213 if (ldb.active && ldb.step) { in luaPushError()
440 if (ldb.active && ldb.step) { in luaRedisGenericCommand()
579 if (ldb.active && ldb.step) in luaRedisGenericCommand()
1519 ldb.step = 1; in ldbEnable()
2181 ldb.step = 0; /* Disable logging. */ in ldbRedis()
2239 ldb.step = 0; in ldbRepl()
2285 ldb.step = 1; in ldbRepl()
2361 ldb.step = 1; in luaLdbLineHook()
2367 if (ldb.step || bp) { in luaLdbLineHook()
[all …]
H A Dsds.c1233 int step = 10, j, i; in sdsTest() local
1244 x = sdsMakeRoomFor(x,step); in sdsTest()
1249 test_cond("sdsMakeRoomFor() free", sdsavail(x) >= step); in sdsTest()
1253 for (j = 0; j < step; j++) { in sdsTest()
1256 sdsIncrLen(x,step); in sdsTest()
H A Dgeo.c86 GeoHashBits hash = { .bits = (uint64_t)bits, .step = GEO_STEP_MAX }; in decodeGeohash()
354 neighbors[i].step == neighbors[last_processed].step) in membersOfAllNeighbors()
/redis-3.2.3/deps/lua/src/
H A Dlstring.c78 size_t step = (l>>5)+1; /* if string is too long, don't hash all its chars */ in luaS_newlstr() local
80 for (l1=l; l1>=step; l1-=step) /* compute hash */ in luaS_newlstr()
H A Dlvm.c655 lua_Number step = nvalue(ra+2); in luaV_execute() local
656 lua_Number idx = luai_numadd(nvalue(ra), step); /* increment index */ in luaV_execute()
658 if (luai_numlt(0, step) ? luai_numle(idx, limit) in luaV_execute()
/redis-3.2.3/
H A DCONTRIBUTING25 …ction and so forth. Read feedbacks about the community. But in this first step **please don't writ…
27 2. If in step 1 you get an acknowledge from the project leaders, use the
H A D00-RELEASENOTES526 don't be a typo, a step of 26 should be valid with 52 bits per
529 if (step > 26) step = 25;
531 So a step of 26 was actually already used, except when one of 27 was
/redis-3.2.3/deps/hiredis/
H A Dsds.c1233 int step = 10, j, i; in sdsTest() local
1244 x = sdsMakeRoomFor(x,step); in sdsTest()
1249 test_cond("sdsMakeRoomFor() free", sdsavail(x) >= step); in sdsTest()
1253 for (j = 0; j < step; j++) { in sdsTest()
1256 sdsIncrLen(x,step); in sdsTest()
/redis-3.2.3/deps/lua/
H A DINSTALL29 If you want to build and install Lua in one step, do "make xxx install",