Using tries to inflect word endings.

• §1. Suffix inflections
• §3. General tries

§1. Suffix inflections. The following inflects the ending of the supplied text. It does so by running the text through an avinue: see Tries and Avinues (in foundation), which is where the asterisk notation is handled.

int Inflect::suffix?Usage of Inflect::suffix:
§3
Grading Adjectives - §2, §3, §4
Past Participles - §2
Pluralisation - §4(OUTPUT_STREAM, match_avinue *T, text_stream *from) {
    inchar32_t *result = Tries::search_avinue(T, from);
    return Inflect::follow_suffix_instruction(OUT, from, result);
}

§2. The foundation code returns a result which may be null, if no match was found. In that event, we leave the text unchanged, just as if the result had been 0 — meaning "change nothing".

int Inflect::follow_suffix_instruction?Usage of Inflect::follow_suffix_instruction:
§1
Declensions - §7, §9(OUTPUT_STREAM, text_stream *from,
    inchar32_t *instruction) {
    int success = TRUE;
    if (instruction == NULL) { success = FALSE; instruction = U"0"; }
    TEMPORARY_TEXT(outcome)
    Modify the original according to the instruction2.1;
    Write the output, interpreting plus signs as word breaks2.2;
    DISCARD_TEXT(outcome)
    return success;
}

§2.1. In general the result either has an initial digit, in which case it removes that many terminal letters, or does not, in which case it removes all the letters (and thus the result text replaces the original entirely). The special character + after a digit means "duplicate the last character"; in other contexts it means "break words here".

For example, the result 3ize tells us to strike out the last 3 characters and add "ize".

Modify the original according to the instruction2.1 =

    int back = (int) (instruction[0] - '0');
    if ((back < 0) || (back > 9)) {
        WRITE_TO(outcome, "%w", instruction);
    } else {
        for (int i = 0, len = Str::len(from); i<len-back; i++)
            PUT_TO(outcome, Str::get_at(from, i));
        int j = 1;
        if (instruction[j] == '+') {
            inchar32_t last = Str::get_last_char(outcome); PUT_TO(outcome, last); j++;
        }
        for (; instruction[j]; j++) PUT_TO(outcome, instruction[j]);
    }

• This code is used in §2.

§2.2. Write the output, interpreting plus signs as word breaks2.2 =

    LOOP_THROUGH_TEXT(pos, outcome)
        if (Str::get(pos) == '+') PUT(' ');
        else PUT(Str::get(pos));

• This code is used in §2.

§3. General tries. Here we take a word assemblage and apply suffix inflection to the first word alone, preserving the rest: for example, "make the tea" might become "making the tea". However, if the result of this inflection contains any + signs, those once again become word boundaries.

word_assemblage Inflect::first_word?Usage of Inflect::first_word:
Lexical Clusters - §4.1.1
Verb Conjugation - §7.2.1(word_assemblage wa, match_avinue *T) {
    vocabulary_entry **words;
    int no_words;
    WordAssemblages::as_array(&wa, &words, &no_words);
    if (no_words == 0) return wa;

    TEMPORARY_TEXT(unsuffixed)
    TEMPORARY_TEXT(suffixed)
    WRITE_TO(unsuffixed, "%V", words[0]);
    int s = Inflect::suffix(suffixed, T, unsuffixed);
    if (s == FALSE) {
        LOOP_THROUGH_TEXT(pos, unsuffixed)
            if (Str::get(pos) == '+') PUT_TO(suffixed, ' ');
            else PUT_TO(suffixed, Str::get(pos));
    }
    wording W = Feeds::feed_text(suffixed);
    WordAssemblages::truncate(&wa, 1);
    DISCARD_TEXT(suffixed)
    DISCARD_TEXT(unsuffixed)
    return WordAssemblages::join(WordAssemblages::from_wording(W), wa);
}