コード例 #1
0
ファイル: RTST.c プロジェクト: atbrox/ctst
static VALUE rtst_set(VALUE self, VALUE key, VALUE value) {
  ctst_ctst *ctst;

  Data_Get_Struct(
    self,
    ctst_ctst,
    ctst
  );

  VALUE result = (VALUE)ctst_set(ctst, RSTRING_PTR(key), 0, RSTRING_LEN(key), (ctst_data)value);

  if(result==0) {
    return Qnil;
  }
  else {
    return result;
  }
}
コード例 #2
0
ファイル: main.c プロジェクト: jakobjanot/ctst
int main(int argc, char** argv) {
  ctst_ctst* ctst = ctst_alloc();
  ctst_data data;

  data = ctst_set(ctst,"The answer to your question is",0,30,42);
  printf("%*s %d (was %d)\n",30,"The answer to your question is",ctst_get(ctst,"The answer to your question is",0,30),data);
  
  data = ctst_set(ctst,"Hello, world!",0,13,57);
  printf("%*s %d (was %d)\n",13,"Hello, world!",ctst_get(ctst,"Hello, world!",0,13),data);

  data = ctst_set(ctst,"Hello, world!",0,13,62);
  printf("%*s %d (was %d)\n",13,"Hello, world!",ctst_get(ctst,"Hello, world!",0,13),data);

  data = ctst_set(ctst,"The answer to your question is",0,30,11);
  printf("%*s %d (was %d)\n",30,"The answer to your question is",ctst_get(ctst,"The answer to your question is",0,30),data);

  data = ctst_set(ctst,"There is something rotten in the kingdom of Denmark",0,51,1122);

  printf("DUMP OF THE TREE\n");
  ctst_visit_all(ctst, &printer_visitor, 0);
  printf("END DUMP OF THE TREE\n");

  printf("DUMP OF THE TREE, only H*\n");
  ctst_visit_all_from_key(ctst, &printer_visitor, 0, "**Hello", 2, 1);
  printf("END DUMP OF THE TREE\n");

  printf("DUMP OF THE TREE, only The*\n");
  ctst_visit_all_from_key(ctst, &printer_visitor, 0, "The", 0, 3);
  printf("END DUMP OF THE TREE\n");

  printf("DUMP OF THE TREE, only There*\n");
  ctst_visit_all_from_key(ctst, &printer_visitor, 0, "--There", 2, 5);
  printf("END DUMP OF THE TREE\n");

  printf("Number of entries: %d\nTotal length of keys: %d\nTotal node count: %d\nMemory usage: %d\nRatio: %f\n",
    ctst_get_size(ctst),
    ctst_get_total_key_length(ctst),
    ctst_get_node_count(ctst),
    ctst_get_memory_usage(ctst),
    ctst_get_ratio(ctst)
  );

  printf("Removing a key\n");
  data = ctst_remove(ctst,"Hello, world!",0,13);
  printf("%*s %d (was %d)\n",13,"Hello, world!",ctst_get(ctst,"Hello, world!",0,13),data);

  printf("Number of entries: %d\nTotal length of keys: %d\nTotal node count: %d\nMemory usage: %d\nRatio: %f\n",
    ctst_get_size(ctst),
    ctst_get_total_key_length(ctst),
    ctst_get_node_count(ctst),
    ctst_get_memory_usage(ctst),
    ctst_get_ratio(ctst)
  );

  printf("DUMP OF THE TREE\n");
  ctst_visit_all(ctst, &printer_visitor, 0);
  printf("END DUMP OF THE TREE\n");

  printf("LOAD TEST\n");
  
  load_test(ctst);

  printf("DUMP OF THE TREE\n");
  ctst_visit_all(ctst, &printer_visitor, 0);
  printf("END DUMP OF THE TREE\n");
  
  printf("Number of entries: %d\nTotal length of keys: %d\nTotal node count: %d\nMemory usage: %d\nRatio: %f\n",
    ctst_get_size(ctst),
    ctst_get_total_key_length(ctst),
    ctst_get_node_count(ctst),
    ctst_get_memory_usage(ctst),
    ctst_get_ratio(ctst)
  );

  ctst_free(ctst);  
  
  return 0;
}
コード例 #3
0
ファイル: main.c プロジェクト: jakobjanot/ctst
void load_test(ctst_ctst* ctst) {
  int i=0,l=0,c=10000;
  double f;
  char dest[1024];

  printf("Load test pass 0...");
  for(i=0;i<c;i++) {
    l = sprintf(dest,"%d",i%317);
    assert(ctst_get(ctst,dest,0,l)==0);
  }
  printf("OK\n");

  printf("Load test pass 1...");
  for(i=0;i<c;i++) {
    l = sprintf(dest,"%d",i%317);
    ctst_set(ctst,dest,0,l,i%317);
    assert(ctst_get(ctst,dest,0,l)==i%317);
  }
  printf(" OK\n");

  printf("Load test pass 2...");
  for(i=0;i<c;i++) {
    l = sprintf(dest,"%d",i%317);
    assert(ctst_get(ctst,dest,0,l)==i%317);
  }
  printf("OK\n");

  printf("Load test pass 3...");
  srand(1);
  for(i=0;i<c;i++) {
    f = 10000.0/(rand()%10000+1);
    l = sprintf(dest,"%f",f);
    ctst_set(ctst,dest,0,l,i+1);
    assert(ctst_get(ctst,dest,0,l)==i+1);
  }
  printf("OK\n");

  printf("Load test pass 4...");
  srand(1);
  for(i=0;i<c;i++) {
    f = 10000.0/(rand()%10000+1);
    l = sprintf(dest,"%f",f);
    assert(ctst_get(ctst,dest,0,l)!=0);
  }
  printf("OK\n");

  printf("Load test pass 5...");
  for(i=0;i<c;i++) {
    l = sprintf(dest,"%d",i);
    ctst_set(ctst,dest,0,l,i);
    assert(ctst_get(ctst,dest,0,l)==i);
  }
  printf("OK\n");

  printf("Load test pass 6...");
  srand(1);
  for(i=0;i<c;i++) {
    f = 10000.0/(rand()%10000+1);
    l = sprintf(dest,"%f",f);
    if(i%2==0) {
      l = ctst_remove(ctst,dest,0,l);
      assert(ctst_get(ctst,dest,0,l)==0);
    }
  }
  printf("OK\n");

  printf("Load test pass 7...");
  srand(1);
  for(i=0;i<c;i++) {
    f = 10000.0/(rand()%10000+1);
    l = sprintf(dest,"%f",f);
    if(i%2==0) {
      assert(ctst_get(ctst,dest,0,l)==0);
    }
  }
  printf("OK\n");
}