Bool sb_trie_state_is_leaf (const SBTrieState *s) { if (!s) return FALSE; return trie_state_is_leaf (s->trie_state); }
/* * call-seq: * leaf? -> true/false * * Returns true if there are no branches at this node. */ static VALUE rb_trie_node_leaf(VALUE self) { TrieState *state; Data_Get_Struct(self, TrieState, state); return trie_state_is_leaf(state) ? Qtrue : Qnil; }
bool ATTrie :: isLeaf(ATTrie::Position pos) { return trie_state_is_leaf( (TrieState*)pos); }
/** * @brief Get data from leaf state * * @param s : a leaf state * * @return the data associated with the leaf state @a s, * or TRIE_DATA_ERROR if @a s is not a leaf state * * Get value from a leaf state of trie. Getting value from a non-leaf state * will result in TRIE_DATA_ERROR. */ TrieData trie_state_get_data (const TrieState *s) { return trie_state_is_leaf (s) ? tail_get_data (s->trie->tail, s->index) : TRIE_DATA_ERROR; }
Bool sb_trie_state_is_leaf (const SBTrieState *s) { return trie_state_is_leaf (s->trie_state); }