Lines Matching defs:in
9 * possibly in exchange for a fee, provided that this copyright notice appears
51 * In general, highly portable and reusable C modules which expose their
54 * readable, in the implementation, however!
311 * Free all the nodes in the dictionary by using the dictionary's
359 * Initialize a dictionary in the likeness of another dictionary
380 * Remove all nodes from the dictionary (without freeing them in any way).
396 * debugging purposes, and should be placed in assert statements. Just because
398 * corruptions in the tree may simply cause undefined behavior.
454 * Locate a node in the dictionary having the given key.
676 * successor (i.e. the leftmost node in the right subtree.) By doing this,
712 * in place of the node that we want deleted.
894 * next key in the the left to right ordering. If the node has
921 * Return the given node's predecessor, in the key order.
1204 leftnode->left = NULL; /* suppress assertion in dict_load_next */
1297 input_t in;
1318 if (!fgets(in, sizeof(input_t), stdin))
1321 switch (in[0]) {
1332 if (tokenize(in+1, &tok1, &tok2, (char **) 0) != 2) {
1362 input_t in;
1373 "l <key> lookup value in dictionary\n"
1381 "t dump whole dictionary in sort order\n"
1395 if (!fgets(in, sizeof(input_t), stdin))
1398 switch(in[0]) {
1403 if (tokenize(in+1, &tok1, &tok2, (char **) 0) != 2) {
1424 if (tokenize(in+1, &tok1, (char **) 0) != 1) {
1446 if (tokenize(in+1, &tok1, (char **) 0) != 1) {
1451 switch (in[0]) {
1496 if (tokenize(in+1, &tok1, (char **) 0) != 1) {
1509 if (tokenize(in+1, &tok1, &tok2, (char **) 0) != 2) {
