/**
* Creates 100 records and 9 indexes.
*
* Records are structured as:
* {a: String, b: Integer, c: Integer, d: Integer, e: Integer}
*
* The key is "a-b-c-d-e"
*
* The values are:
* a = "abc"
* b = 100
* c = <current index>
* d = c % 10
* e = b + (c + 1) * (d + 1) / 2
*/
bool query_foreach_create()
{
as_error err;
as_error_reset(&err);
int n_recs = 100;
as_status status;
as_index_task task;
// create index on "a"
status = aerospike_index_create(as, &err, &task, NULL, NAMESPACE, SET, "a", "idx_test_a", AS_INDEX_STRING);
index_process_return_code(status, &err, &task);
// create index on "b"
status = aerospike_index_create(as, &err, &task, NULL, NAMESPACE, SET, "b", "idx_test_b", AS_INDEX_NUMERIC);
index_process_return_code(status, &err, &task);
// create index on "c"
status = aerospike_index_create(as, &err, &task, NULL, NAMESPACE, SET, "c", "idx_test_c", AS_INDEX_NUMERIC);
index_process_return_code(status, &err, &task);
// create index on "d"
status = aerospike_index_create(as, &err, &task, NULL, NAMESPACE, SET, "d", "idx_test_d", AS_INDEX_NUMERIC);
index_process_return_code(status, &err, &task);
// create complex index on "x"
status = aerospike_index_create_complex(as, &err, &task, NULL, NAMESPACE, SET, "x", "idx_test_x", AS_INDEX_TYPE_LIST, AS_INDEX_STRING);
index_process_return_code(status, &err, &task);
// create complex index on "y"
status = aerospike_index_create_complex(as, &err, &task, NULL, NAMESPACE, SET, "y", "idx_test_y", AS_INDEX_TYPE_MAPKEYS, AS_INDEX_STRING);
index_process_return_code(status, &err, &task);
// create complex index on "y"
status = aerospike_index_create_complex(as, &err, &task, NULL, NAMESPACE, SET, "y", "idx_test_y1", AS_INDEX_TYPE_MAPVALUES, AS_INDEX_STRING);
index_process_return_code(status, &err, &task);
// create complex index on "z"
status = aerospike_index_create_complex(as, &err, &task, NULL, NAMESPACE, SET, "z", "idx_test_z", AS_INDEX_TYPE_LIST, AS_INDEX_NUMERIC);
index_process_return_code(status, &err, &task);
char* buffer = alloca(n_recs * 1024 + 1);
uint32_t the_ttl = AS_RECORD_NO_EXPIRE_TTL;
// insert records
for ( int i = 0; i < n_recs; i++ ) {
if (i == 10) {
// We change the TTL from never to 100 days
the_ttl = 100 * 24 * 60 * 60;
}
else if (i == 42) {
// NOTE - We pause on the 42nd iteration for a few
// milliseconds and note the time. We can then use the
// as_predexp_rec_last_update_after predicate below to find
// the later records.
as_sleep(5);
g_epochns = cf_clock_getabsolute() * 1000 * 1000;
as_sleep(5);
// Also on the 42nd iteration we change the TTL to
// 10 days for the remaining records.
the_ttl = 10 * 24 * 60 * 60;
}
char * a = "abc";
int b = n_recs;
int c = i;
int d = i % 10;
int e = b + (c + 1) * (d + 1) / 2;
int g = i; // Only set on odd records.
char f[64];
snprintf(f, sizeof(f), "0x%04x", i);
char keystr[64] = { '\0' };
snprintf(keystr, 64, "%s-%d-%d-%d-%d", a, b, c, d, e);
// Make list
as_arraylist list;
as_arraylist_init(&list, 3, 0);
if ( (i%3) == 0) {
as_arraylist_append_str(&list, "x");
as_arraylist_append_str(&list, "x1");
as_arraylist_append_str(&list, "x2");
} else {
as_arraylist_append_str(&list, "not_x1");
as_arraylist_append_str(&list, "not_x2");
as_arraylist_append_str(&list, "not_x3");
}
// Make map
as_hashmap map;
as_hashmap_init(&map, 1);
if ( (i%7) == 0) {
as_stringmap_set_str((as_map *) &map, "ykey", "yvalue");
} else {
as_stringmap_set_str((as_map *) &map, "ykey_not", "yvalue_not");
}
// Make list of integers
as_arraylist list2;
as_arraylist_init(&list2, 5, 0);
as_arraylist_append_int64(&list2, i);
as_arraylist_append_int64(&list2, i+1);
as_arraylist_append_int64(&list2, i+2);
as_arraylist_append_int64(&list2, i+3);
as_arraylist_append_int64(&list2, i+4);
// Make a string of variable size
for (int jj = 0; jj < i * 1024; ++jj) {
buffer[jj] = 'X';
}
buffer[i * 1024] = '\0';
// We only create the g bin for odd records.
bool create_g_bin = i % 2 == 1;
as_record r;
as_record_init(&r, 10 + (create_g_bin ? 1 : 0));
as_record_set_str(&r, "a", a);
as_record_set_int64(&r, "b", b);
as_record_set_int64(&r, "c", c);
as_record_set_int64(&r, "d", d);
as_record_set_int64(&r, "e", e);
as_record_set_str(&r, "f", f);
if (create_g_bin) {
as_record_set_int64(&r, "g", g);
}
as_record_set_list(&r, "x", (as_list *) &list);
as_record_set_map(&r, "y", (as_map *) &map);
as_record_set_list(&r, "z", (as_list *) &list2);
as_record_set_str(&r, "bigstr", buffer);
r.ttl = the_ttl;
as_key key;
as_key_init(&key, NAMESPACE, SET, keystr);
aerospike_key_put(as, &err, NULL, &key, &r);
as_record_destroy(&r);
if (err.code != AEROSPIKE_OK) {
error("aerospike_key_put() failed %d %s", err.code, err.message);
return false;
}
as_record *r1 = NULL;
aerospike_key_exists(as, &err, NULL, &key, &r1);
as_key_destroy(&key);
if (err.code != AEROSPIKE_OK) {
error("aerospike_key_exists() failed %d %s", err.code, err.message);
return false;
}
if (! r1) {
error("key not found %s", keystr);
return false;
}
as_record_destroy(r1);
}
return true;
}
static int _as_arraylist_list_append_str(as_list * l, const char * v)
{
return as_arraylist_append_str((as_arraylist *) l, v);
}
static as_record add_bins_to_rec(lua_State *L, int index, int numBins)
{
as_record rec;
as_record_init(&rec, numBins);
// Push another reference to the table on top of the stack (so we know
// where it is, and this function can work for negative, positive and
// pseudo indices
lua_pushvalue(L, index);
// stack now contains: -1 => table
lua_pushnil(L);
// stack now contains: -1 => nil; -2 => table
while (lua_next(L, -2))
{
// stack now contains: -1 => value; -2 => key; -3 => table
// copy the key so that lua_tostring does not modify the original
lua_pushvalue(L, -2);
// stack now contains: -1 => key; -2 => value; -3 => key; -4 => table
const char *binName = lua_tostring(L, -1);
// add to record
if (lua_isnumber(L, -2)){
int intValue = lua_tointeger(L, -2);
as_record_set_int64(&rec, binName, intValue);
} else if (lua_isstring(L, -2)){
const char *value = lua_tostring(L, -2);
as_record_set_str(&rec, binName, value);
} else if (lua_istable(L, -2)){
// make a as_list and populate it
as_arraylist *list = as_arraylist_new(3, 3);
lua_pushvalue(L, -2);
lua_pushnil(L);
// This is needed for it to even get the first value
while (lua_next(L, -2))
{
lua_pushvalue(L, -2);
//const char *key = lua_tostring(L, -1);
const char *value = lua_tostring(L, -2);
// populate the as_list
as_arraylist_append_str(list, value);
//printf("%s => %s\n", key, value);
lua_pop(L, 2);
}
lua_pop(L, 1);
// put the list in a bin
as_record_set_list(&rec, binName, (as_list*)as_val_reserve(list));
}
// pop value + copy of key, leaving original key
lua_pop(L, 2);
// stack now contains: -1 => key; -2 => table
}
// stack now contains: -1 => table (when lua_next returns 0 it pops the key
// but does not push anything.)
// Pop table
lua_pop(L, 1);
// Stack is now the same as it was on entry to this function
return rec;
}
/**
* Creates 100 records and 9 indexes.
*
* Records are structured as:
* {a: String, b: Integer, c: Integer, d: Integer, e: Integer}
*
* The key is "a-b-c-d-e"
*
* The values are:
* a = "abc"
* b = 100
* c = <current index>
* d = c % 10
* e = b + (c + 1) * (d + 1) / 2
*/
bool query_foreach_create()
{
as_error err;
as_error_reset(&err);
int n_recs = 100;
as_status status;
as_index_task task;
// create index on "a"
status = aerospike_index_create(as, &err, &task, NULL, NAMESPACE, SET, "a", "idx_test_a", AS_INDEX_STRING);
if ( status == AEROSPIKE_OK ) {
aerospike_index_create_wait(&err, &task, 0);
}
else {
info("error(%d): %s", err.code, err.message);
}
// create index on "b"
status = aerospike_index_create(as, &err, &task, NULL, NAMESPACE, SET, "b", "idx_test_b", AS_INDEX_NUMERIC);
if ( status == AEROSPIKE_OK ) {
aerospike_index_create_wait(&err, &task, 0);
}
else {
info("error(%d): %s", err.code, err.message);
}
// create index on "c"
status = aerospike_index_create(as, &err, &task, NULL, NAMESPACE, SET, "c", "idx_test_c", AS_INDEX_NUMERIC);
if ( status == AEROSPIKE_OK ) {
aerospike_index_create_wait(&err, &task, 0);
}
else {
info("error(%d): %s", err.code, err.message);
}
// create index on "d"
status = aerospike_index_create(as, &err, &task, NULL, NAMESPACE, SET, "d", "idx_test_d", AS_INDEX_NUMERIC);
if ( status == AEROSPIKE_OK ) {
aerospike_index_create_wait(&err, &task, 0);
}
else {
info("error(%d): %s", err.code, err.message);
}
// create complex index on "x"
status = aerospike_index_create_complex(as, &err, &task, NULL, NAMESPACE, SET, "x", "idx_test_x", AS_INDEX_TYPE_LIST, AS_INDEX_STRING);
if ( status == AEROSPIKE_OK ) {
aerospike_index_create_wait(&err, &task, 0);
}
else {
info("error(%d): %s", err.code, err.message);
}
// create complex index on "y"
status = aerospike_index_create_complex(as, &err, &task, NULL, NAMESPACE, SET, "y", "idx_test_y", AS_INDEX_TYPE_MAPKEYS, AS_INDEX_STRING);
if ( status == AEROSPIKE_OK ) {
aerospike_index_create_wait(&err, &task, 0);
}
else {
info("error(%d): %s", err.code, err.message);
}
// create complex index on "y"
status = aerospike_index_create_complex(as, &err, &task, NULL, NAMESPACE, SET, "y", "idx_test_y1", AS_INDEX_TYPE_MAPVALUES, AS_INDEX_STRING);
if ( status == AEROSPIKE_OK ) {
aerospike_index_create_wait(&err, &task, 0);
}
else {
info("error(%d): %s", err.code, err.message);
}
// create complex index on "z"
status = aerospike_index_create_complex(as, &err, &task, NULL, NAMESPACE, SET, "z", "idx_test_z", AS_INDEX_TYPE_LIST, AS_INDEX_NUMERIC);
if ( status == AEROSPIKE_OK ) {
aerospike_index_create_wait(&err, &task, 0);
}
else {
info("error(%d): %s", err.code, err.message);
}
// insert records
for ( int i = 0; i < n_recs; i++ ) {
char * a = "abc";
int b = n_recs;
int c = i;
int d = i % 10;
int e = b + (c + 1) * (d + 1) / 2;
char keystr[64] = { '\0' };
snprintf(keystr, 64, "%s-%d-%d-%d-%d", a, b, c, d, e);
// Make list
as_arraylist list;
as_arraylist_init(&list, 3, 0);
if ( (i%3) == 0) {
as_arraylist_append_str(&list, "x");
as_arraylist_append_str(&list, "x1");
as_arraylist_append_str(&list, "x2");
} else {
as_arraylist_append_str(&list, "not_x1");
as_arraylist_append_str(&list, "not_x2");
as_arraylist_append_str(&list, "not_x3");
}
// Make map
as_hashmap map;
as_hashmap_init(&map, 1);
if ( (i%7) == 0) {
as_stringmap_set_str((as_map *) &map, "ykey", "yvalue");
} else {
as_stringmap_set_str((as_map *) &map, "ykey_not", "yvalue_not");
}
// Make list of integers
as_arraylist list2;
as_arraylist_init(&list2, 5, 0);
as_arraylist_append_int64(&list2, i);
as_arraylist_append_int64(&list2, i+1);
as_arraylist_append_int64(&list2, i+2);
as_arraylist_append_int64(&list2, i+3);
as_arraylist_append_int64(&list2, i+4);
as_record r;
as_record_init(&r, 9);
as_record_set_str(&r, "a", a);
as_record_set_int64(&r, "b", b);
as_record_set_int64(&r, "c", c);
as_record_set_int64(&r, "d", d);
as_record_set_int64(&r, "e", e);
as_record_set_list(&r, "x", (as_list *) &list);
as_record_set_map(&r, "y", (as_map *) &map);
as_record_set_list(&r, "z", (as_list *) &list2);
as_key key;
as_key_init(&key, NAMESPACE, SET, keystr);
aerospike_key_put(as, &err, NULL, &key, &r);
as_record_destroy(&r);
if (err.code != AEROSPIKE_OK) {
error("aerospike_key_put() failed %d %s", err.code, err.message);
return false;
}
as_record *r1 = NULL;
aerospike_key_exists(as, &err, NULL, &key, &r1);
as_key_destroy(&key);
if (err.code != AEROSPIKE_OK) {
error("aerospike_key_exists() failed %d %s", err.code, err.message);
return false;
}
if (! r1) {
error("key not found %s", keystr);
return false;
}
as_record_destroy(r1);
}
return true;
}
int
main(int argc, char* argv[])
{
// Parse command line arguments.
if (! example_get_opts(argc, argv, EXAMPLE_BASIC_OPTS)) {
exit(-1);
}
// Connect to the aerospike database cluster.
aerospike as;
example_connect_to_aerospike(&as);
// Start clean.
example_remove_test_record(&as);
// Register the UDF in the database cluster.
if (! example_register_udf(&as, UDF_FILE_PATH)) {
example_cleanup(&as);
exit(-1);
}
// Write a record to the database.
if (! write_record(&as)) {
cleanup(&as);
exit(-1);
}
as_error err;
// Apply a simple UDF, with no arguments and no return value.
if (aerospike_key_apply(&as, &err, NULL, &g_key, UDF_MODULE,
"test_bin_1_add_1000", NULL, NULL) != AEROSPIKE_OK) {
LOG("aerospike_key_apply() returned %d - %s", err.code, err.message);
cleanup(&as);
exit(-1);
}
LOG("test_bin_1_add_1000() was successfully applied");
if (! example_read_test_record(&as)) {
example_cleanup(&as);
exit(-1);
}
// Create an argument list for a (different) UDF. By using
// as_arraylist_inita() we avoid some but not all internal heap usage, so we
// must call as_arraylist_destroy().
as_arraylist args;
as_arraylist_inita(&args, 3);
as_arraylist_append_str(&args, "test-bin-2");
as_arraylist_append_int64(&args, 4);
as_arraylist_append_int64(&args, 400);
// Expect an integer return value.
as_val* p_return_val = NULL;
// Apply a UDF with arguments and a return value.
if (aerospike_key_apply(&as, &err, NULL, &g_key, UDF_MODULE,
"bin_transform", (as_list*)&args, &p_return_val) != AEROSPIKE_OK) {
LOG("aerospike_key_apply() returned %d - %s", err.code, err.message);
as_arraylist_destroy(&args);
cleanup(&as);
exit(-1);
}
as_arraylist_destroy(&args);
if (! p_return_val) {
LOG("aerospike_key_apply() retrieved null as_val object");
cleanup(&as);
exit(-1);
}
// Extract an integer from the as_val returned.
int64_t i_val = as_integer_getorelse(as_integer_fromval(p_return_val), -1);
// Caller's responsibility to destroy as_val returned.
as_val_destroy(p_return_val);
if (i_val == -1) {
LOG("aerospike_key_apply() retrieved non-as_integer object");
cleanup(&as);
exit(-1);
}
LOG("bin_transform() was successfully applied - returned %" PRId64, i_val);
if (! example_read_test_record(&as)) {
example_cleanup(&as);
exit(-1);
}
// Cleanup and disconnect from the database cluster.
cleanup(&as);
LOG("udf example successfully completed");
return 0;
}
