Lines Matching defs:in
9 * possibly in exchange for a fee, provided that this copyright notice appears
45 * In general, highly portable and reusable C modules which expose their
48 * readable, in the implementation, however!
305 * Free all the nodes in the dictionary by using the dictionary's
353 * Initialize a dictionary in the likeness of another dictionary
374 * Remove all nodes from the dictionary (without freeing them in any way).
389 * debugging purposes, and should be placed in assert statements. Just because
391 * corruptions in the tree may simply cause undefined behavior.
448 * Locate a node in the dictionary having the given key.
670 * successor (i.e. the leftmost node in the right subtree.) By doing this,
706 * in place of the node that we want deleted.
888 * next key in the the left to right ordering. If the node has
915 * Return the given node's predecessor, in the key order.
1194 leftnode->left = NULL; /* suppress assertion in dict_load_next */
1287 input_t in;
1308 if (!fgets(in, sizeof(input_t), stdin))
1311 switch (in[0]) {
1322 if (tokenize(in+1, &tok1, &tok2, (char **) 0) != 2) {
1352 input_t in;
1363 "l <key> lookup value in dictionary\n"
1371 "t dump whole dictionary in sort order\n"
1385 if (!fgets(in, sizeof(input_t), stdin))
1388 switch(in[0]) {
1393 if (tokenize(in+1, &tok1, &tok2, (char **) 0) != 2) {
1414 if (tokenize(in+1, &tok1, (char **) 0) != 1) {
1436 if (tokenize(in+1, &tok1, (char **) 0) != 1) {
1441 switch (in[0]) {
1486 if (tokenize(in+1, &tok1, (char **) 0) != 1) {
1499 if (tokenize(in+1, &tok1, &tok2, (char **) 0) != 2) {
