Strange Redis SET command behaviour -

-

i'm writing simple program testing redis:

#include <hiredis.h> #include <cstdio>  int main() {     rediscontext * c = redisconnect("127.0.0.1", 6379);      redisreply * reply;      reply = rediscommand(c, "flushall");     freereplyobject(reply);      for(long int = 0; <= 1000000; i++)     {            char query[64];         sprintf(query, "set %ld \"string%ld\"", i, i);           reply = rediscommand(c, query);         freereplyobject(reply);          if( !(i % 100000) )         {                reply = rediscommand(c, "dbsize");             int res = reply->integer;             freereplyobject(reply);              printf("%s\n", query);             printf("dbsize: %d\n", res);         }        }         redisfree(c); }

it should put 1000000 keys db, output following:

set 0 "string0" dbsize: 1 set 100000 "string100000" dbsize: 100001 set 200000 "string200000" dbsize: 200001 set 300000 "string300000" dbsize: 300001 set 400000 "string400000" dbsize: 400001 set 500000 "string500000" dbsize: 500001 set 600000 "string600000" dbsize: 600001 set 700000 "string700000" dbsize: 700001 set 800000 "string800000" dbsize: 779479 set 900000 "string900000" dbsize: 779479 set 1000000 "string1000000" dbsize: 779479

so in 1 moment (usually after 600000 key) redis stops adding records. can reason of such behaviour?

you not check errors in code, difficult diagnose issue. suppose analyse output before freeing reply object.

the probable reason redis instance has been configured maxmemory limit, , have reached limit. may want check configuration file, or use following command:

config maxmemory

a 0 value means there no limit. otherwise, limit epxressed in number of bytes.


Comments

Post a Comment

Popular posts from this blog

c# - SVN Error : "svnadmin: E205000: Too many arguments" -

-
i trying reposotries using c# code process svncommand = null; var psi = new processstartinfo("svnadmin"); psi.redirectstandardoutput = true; psi.redirectstandarderror = true; psi.useshellexecute = false; psi.arguments= @"dump c:\repositories\myrepo > c:\temp\myrepodumpfile.dump"; using (svncommand = process.start(psi)) { var myoutput = svncommand.standardoutput; var myerror = svncommand.standarderror; debug.write("output :" + environment.newline + environment.newline + myoutput.readtoend() + environment.newline + "error :" + environment.newline + environment.newline + myerror.readtoend()); svncommand.close(); } when use dump command commandline svnadmin dump c:\repositories\myrepo > c:\temp\myrepodumpfile.dump it works fine when try ...
Read more

c++ - Using OpenSSL in a multi-threaded application -

-
i have been writing soap client application in c++ on ubuntu using openssl https transport , pthreads threading. have number of threads - 1 central data acquisition thread periodically gets worker threads make soap requests via shared mutex protected queues. reading documentation openssl found is openssl thread-safe? in openssl faq describes mechanisms required ensure thread safety when using openssl. implemented , works fine. the reason question conceptual difficulty really. thinking implementing same functionality application has already, instead of using threads, create 2 seperate applications : 1 worker thread (of multiple copies running) , main data acquisition thread. use tcp sockets communicate between 2 rather mutex protected queues. may bad idea not important - confusing me would have implement same functions required ensure openssl thread safety in second approach or not? my guess not have , treated independent (indeed surely must many applications use openssl) re...
Read more

All overlapping substrings matching a java regex -

-
is there api method returns (possibly overlapping) substrings match regular expression? for example, have text string: string t = 04/31 412-555-1235; , , have pattern: pattern p = new pattern("\\d\\d+"); matches strings of 2 or more characters. the matches are: 04, 31, 412, 555, 1235. how overlapping matches? i want code return: 04, 31, 41, 412, 12, 55, 555, 55, 12, 123, 1235, 23, 235, 35. theoretically should possible -- there obvious o(n^2) algorithm enumerates , checks substrings against pattern. edit rather enumerating substrings, safer use region(int start, int end) method in matcher . checking pattern against separate, extracted substring might change result of match (e.g. if there non-capturing group or word boundary check @ start/end of pattern). edit 2 actually, it's unclear whether region() expect zero-width matches. specification vague, , experiments yield disappointing results. for example: string line = "xx90xx"; strin...
Read more