class_docstr: Regex::Trie in Python. Creates a Trie out of a list of words. The trie can be exported to a Regex pattern.
  The corresponding Regex should match much faster than a simple Regex union.
class_docstr_tok: ["Regex",":",":Trie","in","Python",".","Creates","a","Trie","out","of","a","list","of","words",".","The","trie","can","be","exported","to","a","Regex","pattern",".","The","corresponding","Regex","should","match","much","faster","than","a","simple","Regex","union","."]
code: def add(self, word):
      ref = self.data
      for char in word:
          ref[char] = char in ref and ref[char] or {}
          ref = ref[char]
      ref[""] = 1
  
imports: import argparse
  import fnmatch
  import re
  import shutil
  import sys
  import os
  from .None import constants
  from .cuda_to_hip_mappings import CUDA_TO_HIP_MAPPINGS
  from .cuda_to_hip_mappings import MATH_TRANSPILATIONS
  from typing import Dict, List, Iterator, Optional
  from collections.abc import Mapping, Iterable
  from enum import Enum
label_desc: Use image node_id 2 for calling the Trie obj's underlying member method code with example usage: obj.add(word) without return types