To manage searchable tables of named symbols.

• §1. Introduction
• §6. Unnaming a symbol
• §7. From name to symbol
• §11. Creation by unique name
• §13. From ID to symbol
• §15. From symbol to ID
• §18. URL-style symbol names
• §21. Striking out symbols
• §22. Logging

§1. Introduction. A symbols table indexes the symbols available in a given package, and indexes each symbol in two ways:

• (a) With a dictionary for (fairly) efficient lookup by name; and
• (b) With an array for rapid lookup by ID number.

Note that symbol IDs are just unsigned integers, though always integers which exceed SYMBOL_BASE_VAL. They can be interpreted only in context of the symbols table they refer to: so, for example, the ID 0x40000005 will mean one thing in one package and something else in another. Note: do not change the value of SYMBOL_BASE_VAL without considering the effect on the file compression scheme in Inter in Binary Files.

Some packages are very small. To save memory, the dictionary (a) is created only when the number of symbols reaches NO_SYMBOLS_WORTH_A_DICTIONARY; if there are fewer than that, it's quicker to perform name searches exhaustively anyway, so there's no real loss in speed.

define SYMBOL_BASE_VAL 0x40000000
define NO_SYMBOLS_WORTH_A_DICTIONARY 5

typedef struct inter_symbols_table {
    struct inter_package *owning_package;

    struct dictionary *symbols_dictionary;  this is (a)

    struct inter_symbol **symbol_array;  and this is (b)
    int symbol_array_size;
    inter_ti next_free_symbol_ID;

    inter_ti resource_ID;  within the warehouse for the tree holding the package
    CLASS_DEFINITION
} inter_symbols_table;

• The structure inter_symbols_table is accessed in 2/pck, 3/iibf, 3/iitf and here.

§2.

inter_symbols_table *InterSymbolsTable::new?Usage of InterSymbolsTable::new:
The Warehouse - §8
Inter in Binary Files - §9.1.3.2.2(inter_ti resource_ID) {
    inter_symbols_table *ST = CREATE(inter_symbols_table);
    ST->owning_package = NULL;

    ST->symbols_dictionary = NULL;

    ST->symbol_array_size = 16;
    ST->symbol_array = (inter_symbol **) Memory::calloc(ST->symbol_array_size,
        sizeof(inter_symbol *), INTER_SYMBOLS_MREASON);
    for (int i=0; i<ST->symbol_array_size; i++) ST->symbol_array[i] = NULL;
    ST->next_free_symbol_ID = SYMBOL_BASE_VAL;

    ST->resource_ID = resource_ID;
    return ST;
}

§3. Symbols tables and inter packages correspond exactly to each other, but are not merged into a single data structure for timing reasons (mainly in the harder case when loading binary Inter from a file).

See InterPackage::set_scope for where owning_package is set. This function is the inverse of InterPackage::scope:

inter_package *InterSymbolsTable::package?Usage of InterSymbolsTable::package:
§18, §22
Symbols - §3
Inter in Text Files - §5.1
Inter Data Types - §17.11(inter_symbols_table *ST) {
    if (ST) return ST->owning_package;
    return NULL;
}

§4. It is legal to strike a symbol out of a table, by setting its array entry to be null, though this must be done with great care (if there are references to this symbol in Inter code anywhere, for example, trouble would follow). But this means the array may contain some nulls. The following macro loops through non-null symbols S in the table T; note that the second for "loop" executes once if S is non-null, and not at all if it is null.

define LOOP_OVER_SYMBOLS_TABLE(S, T)
    for (int i=0; i<(T?(T->symbol_array_size):0); i++)
        for (inter_symbol *S = T->symbol_array[i]; S; S = NULL)

§5. The following private-to-us function is an all-purpose way to access symbols in a table by name.

If a symbol called name exists, we return it; or, if wire_following is set, we follow the wiring to the symbol at the end of the cable — this is what the name actually means; the name doesn't really have a local meaning within the package, in this case. (Note that the result is then a symbol outside the table being searched, and therefore belonging to a different package to the one we started in.)

If no such symbol exists, but create is set, we then create it. If ID is zero, we give it the next free symbol ID within the table; otherwise we give it exactly the id ID. This is needed when loading binary Inter from a file, and we need to make sure that we use the same IDs as those expected by that binary code. In that situation, we keep nudging T->next_free_symbol_ID upwards as required to ensure that it ends up being equal to 1 more than the highest symbol ID defined.

inter_symbol *InterSymbolsTable::search_inner?Usage of InterSymbolsTable::search_inner:
§7, §8, §9, §10(inter_symbols_table *T, text_stream *name,
    int create, inter_ti ID, int wire_following) {
    if (T == NULL) internal_error("no symbols table");
    Handle the empty symbol name as a special case5.1;
    Look for the name in the table, and return it if it exists5.2;
    if (create) Create a new symbol with this name, and return it5.3;
    return NULL;
}

§5.1. Handle the empty symbol name as a special case5.1 =

    if (Str::len(name) == 0) {
        if (create) internal_error("cannot create a symbol with the empty name");
        return NULL;
    }

• This code is used in §5.

§5.2. Look for the name in the table, and return it if it exists5.2 =

    inter_symbol *S = NULL;
    if (T->symbols_dictionary == NULL) {
        LOOP_OVER_SYMBOLS_TABLE(A, T)
            if (Str::eq(name, InterSymbol::identifier(A))) {
                S = A; break;
            }
    } else {
        dict_entry *de = Dictionaries::find(T->symbols_dictionary, name);
        if (de) S = (inter_symbol *) Dictionaries::value_for_entry(de);
    }
    if (S) {
        if (wire_following) S = Wiring::cable_end(S);
        return S;
    }

• This code is used in §5.

§5.3. Create a new symbol with this name, and return it5.3 =

    if (ID == 0) ID = T->next_free_symbol_ID++;
    else if (T->next_free_symbol_ID <= ID) T->next_free_symbol_ID = ID+1;
    inter_symbol *S = InterSymbol::new_for_symbols_table(name, T, ID);
    Add S to the array5.3.1;
    if (T->symbols_dictionary) {
        Add S to the dictionary5.3.2;
    } else {
        if (T->next_free_symbol_ID - SYMBOL_BASE_VAL >= NO_SYMBOLS_WORTH_A_DICTIONARY)
            Make a dictionary from the whole symbols array, including the new S5.3.3;
    }
    return S;

• This code is used in §5.

§5.3.1. Add S to the array5.3.1 =

    int index = (int) ID - (int) SYMBOL_BASE_VAL;
    if (index < 0) internal_error("bad symbol ID index");
    if (index >= T->symbol_array_size) {
        int new_size = T->symbol_array_size;
        while (index >= new_size) new_size = new_size * 4;

        inter_symbol **enlarged = (inter_symbol **)
            Memory::calloc(new_size, sizeof(inter_symbol *), INTER_SYMBOLS_MREASON);
        for (int i=0; i<new_size; i++)
            if (i < T->symbol_array_size)
                enlarged[i] = T->symbol_array[i];
            else
                enlarged[i] = NULL;
        Memory::I7_free(T->symbol_array, INTER_SYMBOLS_MREASON, T->symbol_array_size);
        T->symbol_array_size = new_size;
        T->symbol_array = enlarged;
    }
    if (index >= T->symbol_array_size) internal_error("inter symbols expansion failed");
    T->symbol_array[index] = S;

• This code is used in §5.3.

§5.3.2. Add S to the dictionary5.3.2 =

    Dictionaries::create(T->symbols_dictionary, name);
    Dictionaries::write_value(T->symbols_dictionary, name, (void *) S);

• This code is used in §5.3.

§5.3.3. Make a dictionary from the whole symbols array, including the new S5.3.3 =

    T->symbols_dictionary = Dictionaries::new(16, FALSE);
    LOOP_OVER_SYMBOLS_TABLE(A, T) {
        Dictionaries::create(T->symbols_dictionary, InterSymbol::identifier(A));
        Dictionaries::write_value(T->symbols_dictionary, InterSymbol::identifier(A), (void *) A);
    }

• This code is used in §5.3.

§6. Unnaming a symbol.

int InterSymbolsTable::unname(inter_symbols_table *T, text_stream *name) {
    if (T->symbols_dictionary) {
        dict_entry *E = Dictionaries::find(T->symbols_dictionary, name);
        if (E) {
            inter_symbol *A = (inter_symbol *) E->value;
            E->value = NULL;
            A->identifier = Str::new();
            WRITE_TO(A->identifier, "nameless__%d", A->symbol_ID);
            return TRUE;
        }
    } else {
        LOOP_OVER_SYMBOLS_TABLE(A, T) {
            if (Str::eq(InterSymbol::identifier(A), name)) {
                A->identifier = Str::new();
                WRITE_TO(A->identifier, "nameless__%d", A->symbol_ID);
                return TRUE;
            }
        }
    }
    return FALSE;
}

§7. From name to symbol. Variations on the above then provide an API for looking up the meaning of names within a symbols table.

First: what if anything does name mean? Return NULL if nothing.

This is wire-following: that is, if the answer is a symbol wired to another symbol elsewhere in the tree, then we return that other symbol.

inter_symbol *InterSymbolsTable::symbol_from_name?Usage of InterSymbolsTable::symbol_from_name:
§12, §19, §20
Packages - §11
Transmigration - §4.1, §4.2.1
Inter in Text Files - §4, §5, §5.1, §6, §7.1, §12.14
Metadata - §3
The PropertyValue Construct - §4
The Inv Construct - §7.1
The Lab Construct - §4
The Label Construct - §4(inter_symbols_table *T, text_stream *name) {
    return InterSymbolsTable::search_inner(T, name, FALSE, 0, TRUE);
}

§8. The same, but not wire-following. The result might therefore be a symbol which is wired to something elsewhere in the tree, and doesn't really have a local meaning of its own.

inter_symbol *InterSymbolsTable::symbol_from_name_not_following?Usage of InterSymbolsTable::symbol_from_name_not_following:
Packages - §20
The Wiring - §11, §12, §14
Transmigration - §3.4(inter_symbols_table *T,
    text_stream *name) {
    return InterSymbolsTable::search_inner(T, name, FALSE, 0, FALSE);
}

§9. The same, but creating the name if it doesn't exist already.

inter_symbol *InterSymbolsTable::symbol_from_name_creating?Usage of InterSymbolsTable::symbol_from_name_creating:
§11
Transmigration - §3.4, §4.1.1, §4.2.1.1
Inter in Text Files - §4(inter_symbols_table *T,
    text_stream *name) {
    return InterSymbolsTable::search_inner(T, name, TRUE, 0, TRUE);
}

§10. Use this variant, which forces the symbol ID to a particular value, only if you are sure you know what you're doing. It would be disastrous to use an ID already taken.

inter_symbol *InterSymbolsTable::symbol_from_name_creating_at_ID?Usage of InterSymbolsTable::symbol_from_name_creating_at_ID:
Inter in Binary Files - §9.1.3.2.2(inter_symbols_table *T,
    text_stream *name, inter_ti ID) {
    return InterSymbolsTable::search_inner(T, name, TRUE, ID, TRUE);
}

§11. Creation by unique name. Here we definitely want a new symbol, not an existing one, and if necessary we monkey with the proposed name for it until it differs from the name of anything already defined in the package.

inter_symbol *InterSymbolsTable::create_with_unique_name?Usage of InterSymbolsTable::create_with_unique_name:
§16.1.2, §20
The Wiring - §12, §14
Inter in Text Files - §5.1, §12.14(inter_symbols_table *T,
    text_stream *name) {
    return InterSymbolsTable::symbol_from_name_creating(T,
        InterSymbolsTable::render_identifier_unique(T, name));
}

§12. Which uses the following to construct its unique name:

text_stream *InterSymbolsTable::render_identifier_unique?Usage of InterSymbolsTable::render_identifier_unique:
§11(inter_symbols_table *T,
    text_stream *name) {
    inter_symbol *ST;
    int N = 1, A = 0, still_unduplicated = TRUE;
    while ((ST = InterSymbolsTable::symbol_from_name(T, name)) != NULL) {
        if (still_unduplicated) {
            name = Str::duplicate(name);
            still_unduplicated = FALSE;
        }
        TEMPORARY_TEXT(TAIL)
        WRITE_TO(TAIL, "_%d", N++);
        if (A > 0) Str::truncate(name, Str::len(name) - A);
        A = Str::len(TAIL);
        WRITE_TO(name, "%S", TAIL);
        Str::truncate(name, 31);
        DISCARD_TEXT(TAIL)
    }
    return name;
}

§13. From ID to symbol. Symbols are represented in Inter bytecode by their ID numbers, but these only make sense in the context of a symbols table: i.e., the same ID can have a different meaning in one inter frame than in another. We provide two ways to access this: one following equations, the other not.

inter_symbol *InterSymbolsTable::symbol_from_ID_not_following?Usage of InterSymbolsTable::symbol_from_ID_not_following:
Inter in Text Files - §10
Verifying Inter - §1.2
Inter Value Pairs - §13(inter_symbols_table *T,
    inter_ti ID) {
    if (T == NULL) return NULL;
    int index = (int) ID - (int) SYMBOL_BASE_VAL;
    if (index < 0) return NULL;
    if (index >= T->symbol_array_size) return NULL;
    return T->symbol_array[index];
}

inter_symbol *InterSymbolsTable::symbol_from_ID?Usage of InterSymbolsTable::symbol_from_ID:
§14
Inter in Binary Files - §9.1.4
Verifying Inter - §2, §3, §4
Inter Value Pairs - §13, §22.2
Inter Data Types - §14
The Package Construct - §10(inter_symbols_table *T, inter_ti ID) {
    inter_symbol *S = InterSymbolsTable::symbol_from_ID_not_following(T, ID);
    return Wiring::cable_end(S);
}

§14. It's convenient to have some abbreviations for common ways to access the above.

inter_symbol *InterSymbolsTable::symbol_from_ID_at_node?Usage of InterSymbolsTable::symbol_from_ID_at_node:
Inter Constructs - §19
The Constant Construct - §7
The Instance Construct - §3, §6
The Package Construct - §9
The PackageType Construct - §4
The Permission Construct - §3, §6
The Primitive Construct - §5, §8
The Property Construct - §5, §6
The PropertyValue Construct - §6
The Typename Construct - §6
The Variable Construct - §6
The Inv Construct - §9
The Lab Construct - §6
The Label Construct - §6
The Local Construct - §6(inter_tree_node *P, int x) {
    return InterSymbolsTable::symbol_from_ID(InterPackage::scope_of(P), P->W.instruction[x]);
}

inter_symbol *InterSymbolsTable::global_symbol_from_ID_at_node?Usage of InterSymbolsTable::global_symbol_from_ID_at_node:
The Package Construct - §7
The Inv Construct - §9(inter_tree_node *P, int x) {
    return InterSymbolsTable::symbol_from_ID(Inode::globals(P), P->W.instruction[x]);
}

inter_symbol *InterSymbolsTable::symbol_from_ID_in_package(inter_package *owner, inter_ti ID) {
    return InterSymbolsTable::symbol_from_ID(InterPackage::scope(owner), ID);
}

§15. From symbol to ID. If all we want is to read the ID of a symbol definitely present in the given symbols table, that's easy. Suppose we have this example:

    +-----------------+
    | Package P       |
    |                 |
    | 0: example      |
    | 1: another      |
    | 2: plugh        |
    | 3: further      |
    +-----------------+

Then if we want the ID of symbol plugh in package P, we just return 3, its symbol ID within the table.

Here, if P is null then we use the root package, and therefore the global symbols table.

inter_ti InterSymbolsTable::id_from_symbol_not_creating?Usage of InterSymbolsTable::id_from_symbol_not_creating:
The Package Construct - §11(inter_tree *I,
    inter_package *P, inter_symbol *S) {
    if (S == NULL) internal_error("no symbol");
    inter_symbols_table *T = InterPackage::scope(P);
    if (T == NULL) T = InterTree::global_scope(I);
    if (T != S->owning_table) {
        LOG("Symbol is $3, owned by $4, but we wanted ID from $4\n", S, S->owning_table, T);
        internal_error("ID not available in this scope");
    }
    return S->symbol_ID;
}

inter_ti InterSymbolsTable::id_from_global_symbol(inter_tree *I, inter_symbol *S) {
    return InterSymbolsTable::id_from_symbol_not_creating(I, NULL, S);
}

§16. However, things become more interesting if we do not know that the symbol S belongs to P. Suppose:

    +-----------------+    +-----------------+
    | Package P       |    | Package SP      |
    |                 |    |                 |
    | 0: example      |    | 0: xyzzy        |
    | 1: another      |    | 1: plugh        |
    | 2: further      |    |                 |
    +-----------------+    +-----------------+

and suppose we again want the ID for plugh within package P. The only way to do this is to create a new symbol in P and wire it to plugh:

    +-----------------+
    | Package P       |
    |                 |    +-----------------+
    | 0: example      |    | Package SP      |
    | 1: another      |    |                 |
    | 2: further      |    |   0: xyzzy      |
    | 3: plugh ~~~~~~~~~~~~~~> 1: plugh      |
    +-----------------+    +-----------------+

We can then return 3 as the ID of plugh within P.

Note that there are now two symbols named plugh, one in each package. But the new one in P is a sort of reference only: it is wired to the old one in SP. To see what the new plugh means, one must follow the wiring to the old plugh. But this is no real burden, because:

• (a) A name-search by InterSymbolsTable::symbol_from_name on "plugh" within the package P finds the new plugh symbol but then follows the wiring to the old plugh in SP, and returns that; and
• (b) So does ID lookup by InterSymbolsTable::symbol_from_ID on ID 3 within P.

In effect, once the following function has been used, everything will work just as if the symbol were in P after all.

Finally, note that this awkward case:

    +-----------------+    +-----------------+
    | Package P       |    | Package SP      |
    |                 |    |                 |
    | 0: plugh        |    | 0: xyzzy        |
    | 1: another      |    | 1: plugh        |
    | 2: further      |    |                 |
    +-----------------+    +-----------------+

also needs to be handled: i.e., where package P already contains a different and unrelated symbol coincidentally called "plugh". In that case, we end up with:

    +-----------------+
    | Package P       |
    |                 |    +-----------------+
    | 0: plugh        |    | Package SP      |
    | 1: another      |    |                 |
    | 2: further      |    |   0: xyzzy      |
    | 3: plugh_1 ~~~~~~~~~~~~> 1: plugh      |
    +-----------------+    +-----------------+

This time, the reference symbol has been named "plugh_1" to avoid a name collision with the original plugh in package P.

inter_ti InterSymbolsTable::id_from_symbol?Usage of InterSymbolsTable::id_from_symbol:
§17
Transmigration - §4.1.1, §4.2.1.1
Inter Value Pairs - §13
The Package Construct - §4, §11
The Inv Construct - §3, §10(inter_tree *I, inter_package *P, inter_symbol *S) {
    if (S == NULL) internal_error("no symbol");
    inter_symbols_table *P_table = InterPackage::scope(P);
    if (P_table == NULL) P_table = InterTree::global_scope(I);
    return InterSymbolsTable::id_from_symbol_in_table(P_table, S);
}

inter_ti InterSymbolsTable::id_from_symbol_in_table?Usage of InterSymbolsTable::id_from_symbol_in_table:
Inter Data Types - §15(inter_symbols_table *P_table, inter_symbol *S) {
    if (S == NULL) internal_error("no symbol");
    if (P_table == NULL) internal_error("no table");
    inter_symbols_table *SP_table = S->owning_table;
    if (P_table != SP_table) We need an ID to a faraway symbol16.1
    else return S->symbol_ID;
}

§16.1. Because global symbols are visible everywhere, we never need local IDs for them on a package-by-package basis, so it is an error to call this function if S is a global.

We need an ID to a faraway symbol16.1 =

    LOGIF(INTER_SYMBOLS,
        "Seek ID of $3 from $4, which is not its owner $4\n", S, P_table, SP_table);
    If this table already has a symbol wired to that faraway symbol, fine: use that16.1.1;
    Otherwise make a new symbol in the table and wire it to the faraway one16.1.2;

• This code is used in §16.

§16.1.1. If this table already has a symbol wired to that faraway symbol, fine: use that16.1.1 =

    LOOP_OVER_SYMBOLS_TABLE(E, P_table)
        if (Wiring::wired_to(E) == S)
            return (inter_ti) E->symbol_ID;

• This code is used in §16.1.

§16.1.2. Otherwise make a new symbol in the table and wire it to the faraway one16.1.2 =

    inter_symbol *X = InterSymbolsTable::create_with_unique_name(P_table, InterSymbol::identifier(S));
    Wiring::wire_to(X, S);
    return X->symbol_ID;

• This code is used in §16.1.

§17. The same operation, but the local context expressed differently:

inter_ti InterSymbolsTable::id_at_bookmark?Usage of InterSymbolsTable::id_at_bookmark:
Inter Data Types - §15
The Constant Construct - §2, §4
The Instance Construct - §2
The Package Construct - §4
The PackageType Construct - §2
The Permission Construct - §2
The Primitive Construct - §2
The Property Construct - §2
The PropertyValue Construct - §2
The Typename Construct - §2
The Variable Construct - §2
The Inv Construct - §3
The Lab Construct - §2
The Label Construct - §2
The Local Construct - §2(inter_bookmark *IBM,
    inter_symbol *S) {
    return InterSymbolsTable::id_from_symbol(InterBookmark::tree(IBM),
        InterBookmark::package(IBM), S);
}

§18. URL-style symbol names. We saw in InterPackage::write_URL that every package can be identified uniquely by a URL, so that, say, /main/example/whatever means the package whatever in the package example in the package main at the root of the tree.

As a result, symbols can also have unique URLs: /main/example/whatever/plugh means the symbol called plugh which is in that package.

This is not really two different conventions. The URL for a package is the same as the URL for the symbol of that package's name, so really we can think of URLs for packages as a special case of URLs for symbols.

define MAX_URL_SYMBOL_NAME_DEPTH 512

void InterSymbolsTable::write_symbol_URL?Usage of InterSymbolsTable::write_symbol_URL:
Symbols - §21
The Wiring - §12
Inter in Text Files - §5.2, §10
Verifying Inter - §2
Inter Data Types - §19
The Plug Construct - §3(OUTPUT_STREAM, inter_symbol *S) {
    inter_package *chain[MAX_URL_SYMBOL_NAME_DEPTH];
    int chain_length = 0;
    inter_package *P = InterSymbolsTable::package(S->owning_table);
    if (P == NULL) { WRITE("%S", InterSymbol::identifier(S)); return; }
    while (P) {
        if (chain_length >= MAX_URL_SYMBOL_NAME_DEPTH) internal_error("package nesting too deep");
        chain[chain_length++] = P;
        P = InterPackage::parent(P);
    }
    for (int i=chain_length-1; i>=0; i--) WRITE("/%S", InterPackage::name(chain[i]));
    WRITE("/%S", InterSymbol::identifier(S));
}

§19. Conversely, we parse a URL and locate the symbol it describes.

All URLs here are absolute. If no initial / occurs, the URL is assumed to be a global name: so /global_name and global_name both mean the same thing, i.e., the symbol named global_name in the root package. However, this/that means a symbol named this/that (which cannot ever exist), not a symbol named that in a package named this.

inter_symbol *InterSymbolsTable::URL_to_symbol?Usage of InterSymbolsTable::URL_to_symbol:
§20
Inter in Text Files - §5.1, §7.1
The Plug Construct - §2
The Socket Construct - §2(inter_tree *I, text_stream *URL) {
    if (Str::get_first_char(URL) == '/') {
        inter_package *at_P = I->root_package;
        TEMPORARY_TEXT(C)
        LOOP_THROUGH_TEXT(P, URL) {
            wchar_t c = Str::get(P);
            if (c == '/') {
                if (Str::len(C) > 0) {
                    at_P = InterPackage::from_name(at_P, C);
                    if (at_P == NULL) return NULL;
                }
                Str::clear(C);
            } else {
                PUT_TO(C, c);
            }
        }
        return InterSymbolsTable::symbol_from_name(InterPackage::scope(at_P), C);
    }
    return InterSymbolsTable::symbol_from_name(InterTree::global_scope(I), URL);
}

§20. This variation creates a wired symbol in T to the given URL if there is currently nothing at that URL; it is used when reading in textual Inter files, as a way of handling forward references.

inter_symbol *InterSymbolsTable::wire_to_URL?Usage of InterSymbolsTable::wire_to_URL:
Inter in Text Files - §12.14
Inter Data Types - §17.11(inter_tree *I, text_stream *URL,
    inter_symbols_table *T) {
    inter_symbol *S = InterSymbolsTable::URL_to_symbol(I, URL);
    if (S == NULL) {
        TEMPORARY_TEXT(leaf)
        LOOP_THROUGH_TEXT(pos, URL) {
            wchar_t c = Str::get(pos);
            if (c == '/') Str::clear(leaf);
            else PUT_TO(leaf, c);
        }
        if (Str::len(leaf) == 0) return NULL;
        S = InterSymbolsTable::symbol_from_name(T, leaf);
        if (!((S) && (Wiring::is_wired_to_name(S)) &&
            (Str::eq(Wiring::wired_to_name(S), URL)))) {
            S = InterSymbolsTable::create_with_unique_name(T, leaf);
            Wiring::wire_to_name(S, URL);
        }
        DISCARD_TEXT(leaf)
    }
    return S;
}

§21. Striking out symbols. This is a desperation measure. The tree may be full of references to S made by its ID: those IDs will then fail to resolve if the array entry for S has been struck out to NULL, and the result could be horribly inconsistent. So the function should be used only with great care.

Note that the name is not removed from the dictionary (if the table has one). This means that textual lookups on it might still return S: so, again, do not use the function if that is able to cause problems.

void InterSymbolsTable::remove_symbol?Usage of InterSymbolsTable::remove_symbol:
Transmigration - §3.4(inter_symbol *S) {
    int index = (int) S->symbol_ID - (int) SYMBOL_BASE_VAL;
    Wiring::wire_to(S, NULL);
    S->owning_table->symbol_array[index] = NULL;
}

§22. Logging.

void InterSymbolsTable::log?Usage of InterSymbolsTable::log:
Bytecode Module - §3.6(OUTPUT_STREAM, void *vst) {
    inter_symbols_table *ST = (inter_symbols_table *) vst;
    if (ST == NULL) WRITE("<null-stable>");
    else {
        WRITE("<%d:", ST->allocation_id);
        inter_package *P = InterSymbolsTable::package(ST);
        if (P == NULL) WRITE("(root)"); else WRITE("$6", P);
        WRITE(">");
    }
}