diff options
author | David Robillard <d@drobilla.net> | 2011-04-27 21:55:56 +0000 |
---|---|---|
committer | David Robillard <d@drobilla.net> | 2011-04-27 21:55:56 +0000 |
commit | fc172b2cdf438b216ef16ecaf6a1467fecf9bea5 (patch) | |
tree | 4883aacfcdb21eecd80698cdd5f35f53b9f69b6c /src/sord.c | |
parent | a57e86686e3143bd6e0873264a12a04cf7e9939d (diff) | |
download | sord-fc172b2cdf438b216ef16ecaf6a1467fecf9bea5.tar.gz sord-fc172b2cdf438b216ef16ecaf6a1467fecf9bea5.tar.bz2 sord-fc172b2cdf438b216ef16ecaf6a1467fecf9bea5.zip |
Remove unused API.
git-svn-id: http://svn.drobilla.net/sord/trunk@89 3d64ff67-21c5-427c-a301-fe4f08042e5a
Diffstat (limited to 'src/sord.c')
-rw-r--r-- | src/sord.c | 87 |
1 files changed, 0 insertions, 87 deletions
@@ -1047,90 +1047,3 @@ sord_remove(SordModel sord, const SordQuad tup) --sord->n_quads; } - -void -sord_remove_iter(SordModel sord, SordIter iter) -{ - SordQuad tup; - sord_iter_get(iter, tup); - - SORD_WRITE_LOG("Remove " TUP_FMT "\n", TUP_FMT_ARGS(tup)); - - // TODO: Directly remove the iterator's index (avoid one search) - - for (unsigned i = 0; i < NUM_ORDERS; ++i) { - if (sord->indices[i]) { - const int* const ordering = orderings[i]; - const SordQuad key = { - tup[ordering[0]], tup[ordering[1]], tup[ordering[2]], tup[ordering[3]] - }; - GSequenceIter* const cur = index_search(sord, sord->indices[i], key); - if (!g_sequence_iter_is_end(cur)) { - g_sequence_remove(cur); - } else { - assert(i == 0); // Assuming index coherency - } - } - } - - for (int i = 0; i < TUP_LEN; ++i) - sord_drop_quad_ref(sord, tup[i]); - - --sord->n_quads; - - iter->end = g_sequence_iter_is_end(iter->cur); -} - -void -sord_remove_graph(SordModel sord, SordNode graph) -{ -#if 0 - if (!sord->indices[GSPO]) - return; - - // Remove all quads in graph from non-graph indices - BDBCUR* cur = tcbdbcurnew(sord->indices[GSPO]); - const SordQuad search_key = { graph, 0, 0, 0 }; - int key_size = sizeof(SordQuad); - tcbdbcurjump(cur, &search_key, key_size); - do { - const SordNode* key = (const SordNode*)tcbdbcurkey3(cur, &key_size); - if (!key || key[0] != graph) - break; - - for (unsigned i = 0; i < GSPO; ++i) { - if (sord->indices[i]) { - const int* const ordering = orderings[i]; - const SordQuad tup = { key[1], key[2], key[3], key[0] }; // Key in SPOG order - const SordQuad subkey = { - tup[ordering[0]], tup[ordering[1]], tup[ordering[2]], tup[ordering[3]] - }; - if (!tcbdbout(sord->indices[i], &subkey, sizeof(SordQuad))) - fprintf(stderr, "Failed to remove key " TUP_FMT "\n", TUP_FMT_ARGS(subkey)); - } - } - - --sord->n_quads; - } while (tcbdbcurnext(cur)); - - // Remove all quads in graph from graph indices - for (unsigned i = GSPO; i < NUM_ORDERS; ++i) { - if (sord->indices[i]) { - BDBCUR* cur = tcbdbcurnew(sord->indices[i]); - tcbdbcurjump(cur, &search_key, key_size); - while (true) { - const SordNode* key = (const SordNode*)tcbdbcurkey3(cur, &key_size); - if (!key || key[0] != graph) { - break; - } else if (i == GSPO) { - for (int i = 0; i < TUP_LEN; ++i) { - sord_drop_quad_ref(sord, key[i]); - } - } - if (!tcbdbcurout(cur)) - break; - } - } - } -#endif -} |