Next: Operators, Previous: Byte Array Data Traversal Functions, Up: Top [Index]
The aime intrinsic string type does not suit well stored binary data, as the type does not allow for zero bytes. Intrinsic string retriever functions pick up key associated data up to the first embedded zero byte.
void db_s_delete(table t, text k);
deletes the k key from table t.
integer db_s_first(text &d, table t, text &k);
is zero if table t maps no key, non zero otherwise. In the latter case k is set to the first mapped key and d to its associated data.
text db_s_fix(table t, text k, text d);
is d, associates d to key k in table t.
void db_s_get(text &d, table t, text k);
sets d to the associated data of key k in table t.
integer db_s_greater(text &d, table t, text s, text &k);
is zero if table t maps no greater key than s, non zero otherwise. In the latter case k is set to the first mapped greater key and d to its associated data.
integer db_s_jack(text &d, table t, text k);
is non zero if table t has a key k, zero if it doesn’t. Sets d to the k associated data for a non zero evaluation.
integer db_s_key(table t, text k);
is non zero if table t has a key k, zero if it doesn’t.
integer db_s_last(text &d, table t, text &k);
is zero if table t maps no key, non zero otherwise. In the latter case k is set to the last mapped key and d to its associated data.
integer db_s_less(text &d, table t, text s, text &k);
is zero if table t maps no lesser key than s, non zero otherwise. In the latter case k is set to the first mapped greater key and d to its associated data.
integer db_s_lower(text &d, table t, text s, text &k);
is zero if table t maps no matching or lesser key than s, non zero otherwise. In the latter case k is set to the last mapped not greater key and d to its associated data.
integer db_s_over(text &d, table t, text k);
is non zero if table t has a key k, zero if it doesn’t. Sets d to the k associated data for a non zero evaluation and removes the key from t.
text db_s_pick(table t, text k);
is the k key associated data in table t, k is removed from t.
text db_s_put(table t, text k, text d);
is d, puts a new key k in table t with d for associated data.
text db_s_query(table t, text k);
is the k key associated data in table t.
void db_s_resign(table t, text k);
deletes the k key from table t when the key is present.
integer db_s_upper(text &d, table t, text s, text &k);
is zero if table t maps no matching or greater key than s, non zero otherwise. In the latter case k is set to the first mapped not less key and d to its associated data.
void db_s_yank(text &d, table t, text k);
sets d to the associated data of key k in table t and removes k from t.
integer db_sk_first(table t, text &k);
is zero if table t maps no key, non zero otherwise. In the latter case k is set to the first mapped key.
integer db_sk_greater(table t, text s, text &k);
is zero if table t maps no greater key than s, non zero otherwise. In the latter case k is set to the first mapped greater key.
integer db_sk_last(table t, text &k);
is zero if table t maps no key, non zero otherwise. In the latter case k is set to the last mapped key.
integer db_sk_less(table t, text s, text &k);
is zero if table t maps no lesser key than s, non zero otherwise. In the latter case k is set to the last mapped lesser key.
integer db_sk_lower(table t, text s, text &k);
is zero if table t maps no matching or lesser key than s, non zero otherwise. In the latter case k is set to the last mapped not greater key.
integer db_sk_upper(table t, text s, text &k);
is zero if table t maps no matching or greater key than s, non zero otherwise. In the latter case k is set to the first mapped not less key.
Next: Operators, Previous: Byte Array Data Traversal Functions, Up: Top [Index]