STL/C++
RB-tree, vector instantiations, delegates, Insert_node, deque, sort, introsort, SIMD, regex, variant
| Address | Size | Name | Description |
|---|---|---|---|
| 0x0064E4C0 | 87 | STL_map_lower_bound_uint64_enchant | Performs binary search tree lower_bound operation on map with uint64 keys, traversing left/right children based on enchant value comparison. |
| 0x0064EBD0 | 105 | STL_map_init_0x20_grade | Initializes an STL map node (0x20 bytes) with self-pointers for RB-tree grade structure and color flag 0x101 |
| 0x0064ED30 | 105 | STL_map_init_0x20_enchant | Initializes a std::map<int,int> node (0x20 bytes) for enchant data with sentinel/root setup |
| 0x0064F2F0 | 80 | STL_map_clear_0x18_enchant | Clears an STL map container with 0x18-byte nodes, deallocating tree and root node memory for enchant data. |
| 0x0064F370 | 57 | STL_map_destroy_0x1c_enchant | Destroys STL map nodes for enchant data (0x1c size), deallocates tree and frees memory block. |
| 0x0064F3D0 | 57 | STL_map_destroy_complex_enchant | Destructor for std::map<K,V> containing complex enchant data; clears all nodes and deallocates map structure (0x30 bytes) |
| 0x0064F430 | 57 | STL_map_destroy_with_0x18_subtree | Destroys an STL map node by recursively deleting its 0x18-offset subtree, then deallocating the map structure. |
| 0x0064F490 | 57 | STL_map_destroy_with_nested_map | Destroys a map container by recursively deleting nested map nodes, then deallocating the root node structure (0x60 bytes). |
| 0x0064F4F0 | 57 | STL_map_destroy_with_string_member | Destroys STL map nodes containing string members, then deallocates the map container (0x1c bytes). |
| 0x0064F550 | 80 | STL_map_clear_0x20_grade | Clears an STL map container with 0x20-byte nodes storing grade data, deallocating tree nodes and internal structures. |
| 0x0064F5D0 | 57 | STL_map_destroy_with_string_0x20 | Destroys STL map container by recursively deleting all tree nodes then freeing the map object (0x2c bytes). |
| 0x0064F630 | 57 | STL_map_destroy_with_string_enchant | Destroys STL map container with recursive deletion of all nodes, then frees the map structure (0x30 bytes). |
| 0x0064F690 | 60 | STL_map_destroy_enchant_category | Destroys an STL map container for enchant categories by deleting all nodes then freeing the allocated memory. |
| 0x0064F6F0 | 81 | STL_map_clear_with_string_0x20 | Clears an STL map container by recursively deleting all tree nodes and deallocating the root node (0x2c bytes). |
| 0x0064FF80 | 65 | STL_map_clear_wrapper_0x18_enchant | Wrapper that clears an STL map container storing enchantment data (0x18 byte entries) with exception handling. |
| 0x0064FFD0 | 41 | STL_tree_destroy_0x1c | Destroys STL tree node by recursively deleting all subtree nodes, then deallocating the tree root structure (0x1c bytes). |
| 0x00650030 | 68 | STL_map_clear_complex_enchant | Clears all nodes from a complex enchant STL tree map and deallocates the container (30 bytes). |
| 0x00650090 | 68 | STL_map_clear_with_0x18_subtree | Clears STL map by deleting all tree nodes with 0x18-byte subtree structure, then frees the map container. |
| 0x006500F0 | 68 | STL_map_clear_with_nested_map | Clears a nested STL map by deleting all nodes, then deallocates the map container (60 bytes). |
| 0x00650150 | 68 | STL_map_clear_with_string_member | Clears STL map by deleting all nodes with string members, then deallocates the map container (0x1c bytes). |
| 0x006501B0 | 65 | STL_map_clear_wrapper_0x20_grade | Wrapper that clears an STL map container with 0x20-byte grade entries, includes stack canary protection. |
| 0x00650200 | 68 | STL_map_clear_with_string_0x20_b | Clears STL map container by recursively deleting all tree nodes, then deallocates the map structure (0x2c bytes). |
| 0x00650260 | 68 | STL_map_clear_with_string_enchant | Clears STL map container by recursively deleting all tree nodes, then deallocates the 0x30-byte map structure. |
| 0x006502C0 | 71 | STL_map_clear_enchant_category | Destructs and deallocates an STL tree container for enchant category data, freeing all nodes and 0x80 bytes of memory. |
| 0x00650600 | 83 | STL_map_clear_nested_map_enchant | Clears nested STL map of enchant data by deleting tree nodes and freeing allocated memory at offset 0x60 |
| 0x006508E0 | 83 | STL_map_clear_and_delete_0x1c | Clears and deallocates an STL map container at offset 0x38, recursively deleting all tree nodes and freeing allocated memory. |
| 0x00650A00 | 144 | STL_map_swap_enchant | Swaps two STL map/tree containers, clearing destination if needed; exchanges root pointers and sizes. |
| 0x00650AB0 | 279 | STL_map_insert_or_find_0x30 | STL map insert_or_find for 0x30-byte nodes; locates/creates enchantment data entries with binary search tree traversal. |
| 0x00650BD0 | 274 | STL_map_insert_or_find_0x20 | STL map node insertion/lookup; finds or creates node with 0x20-byte key, returns pointer to value at offset +6 |
| 0x00650CF0 | 299 | STL_map_insert_or_find_0x60 | STL map insert-or-find operation for 0x60-byte nodes; searches tree and inserts new enchantment record node if key not found. |
| 0x00650E20 | 257 | STL_map_insert_or_find_0x80_enchant | Inserts or finds a 0x80-byte enchant record in STL map, allocating new node if key doesn't exist |
| 0x00650F30 | 27 | STL_scalar_deleting_destructor_4 | STL scalar destructor that conditionally deletes 4-byte object if deletion flag is set in param_2 |
| 0x00653D90 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color invariants. |
| 0x00653FA0 | 517 | Insert_node | STL Red-Black Tree node insertion with rebalancing; maintains tree balance via color flipping and rotations |
| 0x006541B0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties and color balance. |
| 0x006543C0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties and color constraints after adding new node. |
| 0x006545D0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties and parent/child pointers |
| 0x006547E0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure and color invariants |
| 0x006549F0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; manages tree structure and color property maintenance |
| 0x00654C00 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree invariants and color properties during insertion operations. |
| 0x00654E10 | 517 | STL_Tree_val__Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree invariants and color properties. |
| 0x00655020 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree invariants and color properties |
| 0x006580A0 | 238 | STL_rbtree_copy_nodes_0x18 | Recursively copies red-black tree nodes with exception handling, allocating new nodes and copying left/right subtrees. |
| 0x006581B0 | 241 | STL_rbtree_copy_nodes_0x1c | Recursively copies red-black tree nodes from source to destination with exception handling and node allocation. |
| 0x006582C0 | 516 | STL_vector_insert_0x40 | STL vector insert operation for 0x40-byte elements (CEnchantEffect); allocates/reallocates buffer and copies elements |
| 0x006584D0 | 84 | STL_tree_clear_and_delete_pair | Clears and deallocates an STL tree container with its paired nodes, recursively deleting child nodes before freeing the tree structure. |
| 0x00658550 | 94 | STL_tree_delete_nodes_recursive_0x10 | Recursively deletes binary tree nodes by traversing left subtree then deallocating 24-byte node structures |
| 0x006585C0 | 130 | STL_tree_delete_nodes_with_pair_subtree | Recursively deletes tree nodes containing key-value pairs, deallocating memory for subtrees and node structures. |
| 0x00658650 | 94 | STL_tree_delete_nodes_recursive_0x10_b | Recursively deletes binary tree nodes; traverses right subtree then deallocates node if no left child. |
| 0x006586C0 | 130 | STL_tree_delete_nodes_with_pair_subtree_b | Recursively deletes tree nodes containing paired data, deallocating memory for each node and its subtree. |
| 0x00658750 | 137 | STL_hash_find_string_bucket | Searches hash table bucket for matching string key; returns iterator pair (node, found_flag) via output param. |
| 0x006587E0 | 118 | STL_hash_delete_node_with_string | Deletes a hash table node by destructing its string key and freeing the node's memory allocation. |
| 0x00658860 | 97 | fill<> | STL std::fill template instantiation for various list iterator types (unsigned int, strings, pairs); initializes ranges with values |
| 0x00658970 | 609 | STL_unordered_map_insert_range_with_rehash | Inserts range of string elements into unordered_map with FNV-1a hashing, handles bucket rehashing on load factor threshold |
| 0x00658BE0 | 31 | std_fill | STL template instantiation: std fill |
| 0x00658C00 | 251 | STL_map_copy_ctor_0x18 | Copy constructor for STL map node; initializes sentinel node and recursively copies red-black tree structure from source map. |
| 0x00659980 | 86 | STL_hash_delete_bucket_array | Deallocates a dynamic bucket array from an STL hash container, validating size constraints before freeing memory. |
| 0x00659AF0 | 7 | STL_locale_facet__ClearTree | Clears and deallocates all nodes from an STL tree container, freeing key-value pair memory. |
| 0x00659B00 | 57 | STL_map_destroy_pair_subtree_a | Destroys a map's red-black tree by recursively deleting nodes, then deallocates the map structure (24 bytes). |
| 0x00659B80 | 81 | STL_map_destroy_pair_subtree_b | Destroys a tree node pair by recursively deleting child nodes and freeing the node structure (24 bytes). |
| 0x00659C80 | 54 | STL_hash_clear_string_nodes | Clears all string nodes from an STL hash container and deallocates the hash structure memory (0x38 bytes). |
| 0x00659CD0 | 66 | STL_map_clear_pair_tree | Wrapper that clears and deallocates all nodes in an STL map's red-black tree, invoking tree deletion with exception handler setup. |
| 0x00659D20 | 68 | STL_map_destroy_pair_subtree_c | Destroys an STL map node by recursively deleting child subtrees and deallocating the node memory. |
| 0x00659D80 | 83 | STL_unordered_map_clear_string_nodes | Clears all nodes from an STL unordered_map with string keys by deleting bucket array and freeing node memory. |
| 0x0065BDD0 | 232 | STL_vector_resize_fill | Resizes STL vector to new size, filling new elements with given value; handles memory allocation with alignment for sizes >= 4KB |
| 0x0065BEC0 | 37 | STL_destroy_range_vtable_0x40 | STL template instantiation: STL destroy range vtable 0x40 |
| 0x0065BEF0 | 512 | STL_unordered_map_rehash_buckets | Rehashes unordered_map buckets by resizing bucket vector and redistributing elements using FNV1a hash algorithm. |
| 0x0065C4F0 | 10 | STL_Xlength_error_vector_0x40 | Throws std::length_error exception when vector allocation exceeds maximum allowed size limit. |
| 0x0065C500 | 51 | STL_vector_deallocate_0x40 | Deallocates STL vector memory with 0x40-byte elements, handling both small/large allocations with overflow checks. |
| 0x0065C5C0 | 124 | STL_vector_ctor_effect_node | Constructs STL vector for effect nodes; allocates 0x18-byte linked list node, initializes pointers/capacity. |
| 0x0065C650 | 238 | STL_rb_tree_copy_node | Recursively copies a red-black tree node with color preservation, allocating new nodes and linking subtrees. |
| 0x0065C760 | 84 | STL_map_clear_item_tree | Recursively deletes item tree nodes from CItemSlotManager's red-black tree and deallocates memory structures. |
| 0x0065C7E0 | 94 | STL_tree_delete_nodes_recursive | Recursively deletes tree nodes by traversing left subtree then freeing current node; typical BST cleanup. |
| 0x0065C850 | 75 | _Find_lower_bound<> | STL red-black tree lower_bound search; finds first node with value >= search key in ordered set |
| 0x0065C8A0 | 537 | STL_unordered_map_insert_or_find_fnv1a | Inserts or finds a string key in unordered_map using FNV-1a hash, rehashing buckets if load factor exceeded. |
| 0x0065CAC0 | 822 | STL_num_put_wchar__format_grouped_digits | Formats grouped digits for locale-aware wide character numeric output, inserting thousands separators between digit groups. |
| 0x0065CE00 | 818 | STL_num_put_wchar__format_with_separator | Formats wide character numeric output with thousands separators using STL locale conventions. |
| 0x0065DBB0 | 1611 | STL_num_put_wchar__format_float_64bit | Formats 64-bit floating point numbers for wide character output using locale-specific decimal point handling. |
| 0x0065E200 | 1286 | STL_num_put_wchar__format_float_narrow | Formats floating-point numbers to narrow (char) representation using locale-specific decimal point for STL num_put. |
| 0x00662940 | 502 | STL_num_put_wchar__do_put_int_decimal_64bit | STL num_put facet formatting 64-bit signed integers to wide character output with padding and sign handling |
| 0x00662B40 | 423 | STL_num_put_wchar__do_put_int_hex_32bit | STL num_put formatter for wide-character hexadecimal 32-bit integer output with field width and padding control |
| 0x00662CF0 | 434 | STL_num_put_wchar__do_put_int_hex_64bit | STL num_put facet formatting 64-bit hexadecimal integers with width padding and sign prefix handling for wide character output streams |
| 0x00662EB0 | 434 | STL_num_put_wchar__do_put_int_binary_32bit | Formats and outputs a 32-bit binary integer with padding, sign prefix, and width adjustment for wide character stream. |
| 0x00663070 | 434 | STL_num_put_wchar__do_put_int_binary_64bit | Formats and outputs a 64-bit binary integer with width, fill padding, and sign prefix to a wide character stream. |
| 0x00663230 | 434 | STL_num_put_wchar__do_put_int_octal_32bit | STL num_put locale facet for wide-char octal integer formatting with field width, alignment, and sign handling |
| 0x006633F0 | 434 | STL_num_put_wchar__do_put_int_octal_64bit | Formats a 64-bit unsigned integer in octal notation with padding and sign prefix for wide character output. |
| 0x006635B0 | 529 | STL_num_put_wchar__put_uint32_dispatch | Dispatches 32-bit unsigned integer formatting based on base/type specifier (decimal, octal, hex, binary) for wide character output. |
| 0x006637F0 | 618 | STL_num_put_wchar__put_uint64_dispatch | Dispatches uint64 formatting across decimal, octal, hex, and binary bases with locale-aware prefix handling for wide characters. |
| 0x00663A90 | 345 | STL_num_put_wchar__put_signed_decimal | Formats signed 64-bit integer to wide-character string with padding and digit grouping for display. |
| 0x00663BF0 | 156 | STL_num_put_wchar__try_locale_put | Wrapper for STL num_put<wchar_t> that initializes locale numpunct and formats signed decimal output with exception handling. |
| 0x00663C90 | 271 | STL_num_put_wchar__put_bool_text | Formats and outputs a boolean value as wide-character text with padding and sign handling for STL num_put facet. |
| 0x00663DA0 | 370 | STL_num_put_wchar__put_string_quoted | Formats and outputs a quoted wide-character string with padding, escaping special characters within the quotes. |
| 0x00663F20 | 389 | STL_num_put_wchar__put_float_formatted_32bit | Formats and writes a floating-point number to a wide-character string buffer with padding, sign, and grouping separators. |
| 0x006640B0 | 392 | STL_num_put_wchar__put_float_formatted_64bit | Formats and outputs a 64-bit floating-point number as wide characters with padding, grouping separators, and sign handling. |
| 0x00664240 | 327 | STL_num_put_wchar__put_float_formatted_narrow | Formats and writes a floating-point number with padding to a wide character string buffer, handling sign, decimal point, and digit grouping. |
| 0x00664390 | 185 | STL_num_put_wchar__put_pointer | Formats and outputs a pointer value in hexadecimal notation with optional padding and "0x" prefix for wide character streams. |
| 0x00664450 | 237 | STL_num_put__format_uint32_with_separator | Formats uint32 with thousand separators into wide-char buffer, handling odd/even digit positioning and separator character insertion. |
| 0x00664540 | 480 | STL_num_put__format_uint64_with_separator | Formats a 64-bit unsigned integer to decimal string with thousands separator (comma) and appends to buffer. |
| 0x00664720 | 118 | STL_num_put__copy_digits_with_separator | Appends digit range to buffer, inserts thousands separator (param_6) at specified position, reallocates if needed. |
| 0x006647A0 | 370 | STL_locale__init_numpunct_string | Initializes STL locale numpunct facet string member with locale-specific numeric formatting information and manages memory allocation. |
| 0x00664920 | 96 | generic_object__ctor_with_param | Initializes object with virtual destructor pointers and stores parameter; sets up SEH frame for C++ exception handling. |
| 0x00664980 | 140 | STL_locale_facet__ctor_with_tree | Constructs CEnchantEffect object with tree node initialization, allocates 0x18-byte doubly-linked list node |
| 0x00664A10 | 21 | STL_locale_facet__ctor_minimal | Constructs CEnchantEffectBase object, initializing vtable pointer and ref count parameter. |
| 0x00664A30 | 79 | STL_locale_facet__dtor_with_node_delete | Destructor for STL locale facet node that deallocates 24-byte node structure stored at offset +8 with stack canary protection. |
| 0x00664A90 | 67 | STL_locale_facet__dtor_delete_0x18_a | STL locale facet destructor that conditionally deletes a 0x18-byte allocated object with stack canary protection |
| 0x00664B10 | 75 | STL_locale_facet__dtor_delete_0x18_b | Destructor for STL locale facet object; deallocates 0x18-byte heap memory block if pointer at offset +4 is non-null. |
| 0x00664B60 | 120 | STL_locale_facet__dtor_cleanup_0x1c | Destructor cleanup for STL locale facet; deallocates tree structure and facet object at offset +4 |
| 0x00664BE0 | 75 | STL_locale_facet__dtor_delete_0x18_c | Destructor for STL locale facet object; conditionally deletes 0x18-byte allocation at offset +4 with stack cookie validation. |
| 0x00664C30 | 75 | STL_locale_facet__dtor_delete_0x1c | Destructor for STL locale facet object; conditionally deallocates 0x1c-byte member at offset +4 with XOR cookie validation. |
| 0x00664C80 | 77 | STL_locale_facet__dtor_string_cleanup | Destructor wrapper for std::string cleanup within STL locale facet; manages stack frame and calls string destructor with XOR-based canary validation. |
| 0x00664CD0 | 80 | STL_locale_facet__dtor_with_cleanup_call | Destructor wrapper for STL locale facet that clears internal tree structure and restores exception handler state |
| 0x00664D20 | 260 | STL_locale__clear_tree_and_data | Clears a tree-based locale data structure by traversing and destroying all nodes, then reinitializing buckets and string hash storage. |
| 0x00664E70 | 56 | STL_wchar_output__put_single_char | Appends a single wide character to a buffer, expanding capacity if needed via callback function. |
| 0x00664EB0 | 40 | STL_locale_string__copy_assign | Assigns one STL string to another via copy assignment, handling small string optimization (SSO) and delegating to range assignment. |
| 0x00664EE0 | 223 | STL_tree_uint__find_or_insert | Inserts or finds a uint key in an STL tree container, allocating a red-black tree node if key doesn't exist. |
| 0x00664FC0 | 321 | STL_tree_uint__find_or_insert_with_subtree | STL map/tree find-or-insert operation for uint keys; allocates new node with subtree if key not found |
| 0x00665110 | 83 | operator++ | STL red-black tree iterator pre-increment operator; advances const_iterator to next in-order node |
| 0x00665170 | 83 | operator++ | STL tree iterator pre-increment operator; advances to next node in red-black tree traversal for unsigned int set |
| 0x006651D0 | 83 | operator++ | STL red-black tree iterator pre-increment operator; advances to next in-order node by traversing right subtree or parent chain |
| 0x00665230 | 132 | STL_tree_iterator__decrement | Decrements a red-black tree iterator to the previous node by traversing left subtree or up to parent as needed. |
| 0x006652C0 | 288 | STL_num_put_wchar__put_char_escaped | Formats wide character output with escape sequences, wrapping char in single quotes and escaping special/control chars |
| 0x006653E0 | 115 | STL_num_put_wchar__put_hex_0x_prefix | Outputs "0x" prefix for hexadecimal number formatting in wide-character STL num_put locale facet |
| 0x00665460 | 194 | STL_num_put_wchar__format_float_parts_32bit | Formats floating-point number parts (sign, integer digits with separators, decimal point, fractional digits) for wide-character output in num_put locale facet. |
| 0x00665530 | 197 | STL_num_put_wchar__format_float_parts_64bit | Formats floating-point number parts (sign, integer digits with separators, decimal point, fractional digits) into wide-character output buffer. |
| 0x00665600 | 194 | STL_num_put_wchar__format_float_parts_narrow | Formats floating-point number parts (sign, digits, decimal point, exponent) into wide-character output buffer with grouping separators. |
| 0x006656D0 | 246 | STL_num_put__write_hex_digits_64bit | Writes 64-bit unsigned integer as hexadecimal digits to wide-character string buffer with case control. |
| 0x006657D0 | 644 | STL_num_put_wchar__format_decimal_32bit_full | Formats a 32-bit decimal number with locale-aware grouping separators for wide-character output buffer. |
| 0x00665A60 | 665 | STL_num_put_wchar__format_decimal_64bit_full | Formats a 64-bit decimal number with locale-aware grouping separators for wide character output in STL num_put facet. |
| 0x00665D00 | 603 | STL_num_put_wchar__format_decimal_string_full | Formats decimal string output for wide-character locale-aware number formatting with grouping separator support. |
| 0x00665F60 | 152 | STL_num_put__put_binary_digits_32bit | Converts 32-bit unsigned integer to binary string representation and outputs to wide-character buffer. |
| 0x00666000 | 173 | STL_num_put__write_binary_digits_64bit | Converts a 64-bit unsigned integer to binary digit string and appends to wide-character buffer. |
| 0x006660B0 | 561 | STL_num_put_wchar__format_decimal_uint32_grouped | Formats uint32 with thousands separators for wide-char output, handling locale-specific grouping rules. |
| 0x006674E0 | 131 | STL_map_allocate_node_with_destructors | Allocates STL map node (12 bytes) with two destructor pointers and copies data from source struct. |
| 0x00668DF0 | 704 | STL_rbtree_erase_rebalance_enchant_D | Red-black tree node erasure with rebalancing; handles node removal and color/structure restoration for enchant data container |
| 0x006690B0 | 704 | STL_rbtree_erase_rebalance_enchant_E | Red-black tree node erasure with rebalancing; handles node removal and tree restructuring to maintain RB-tree properties. |
| 0x00669380 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color invariants |
| 0x00669590 | 517 | STL_RBTree_Insert_Node | STL red-black tree node insertion with rebalancing; maintains tree structure and color properties for balanced lookup operations. |
| 0x006697A0 | 84 | STL_rbtree_rotate_left_D | Red-black tree left rotation operation; rebalances tree structure by rotating node and updating parent pointers |
| 0x00669800 | 84 | STL_rbtree_rotate_left_E | Red-black tree left rotation operation that rebalances tree structure by rotating node and updating parent/child pointers |
| 0x00669860 | 88 | STL_rbtree_rotate_right_D | Performs right rotation on red-black tree node, updating parent pointers and tree structure accordingly. |
| 0x006698C0 | 88 | STL_rbtree_rotate_right_E | Performs right rotation on red-black tree node; updates parent pointers and tree root reference. |
| 0x00669920 | 95 | STL_vector_allocate_effect_entries | Allocates aligned memory for effect entry array with 0x18-byte elements, aligning to 32-byte boundaries for cache efficiency. |
| 0x00669980 | 102 | STL_vector_allocate_effect_entries_b | Allocates aligned memory pool for effect entry structures (0x1c bytes each) with overflow protection and alignment to 32-byte boundaries. |
| 0x00669E50 | 94 | STL_tree_delete_nodes_recursive_0x20 | Recursively deletes binary tree nodes by traversing left subtree then deallocating node; handles 0x20-byte STL tree node structures. |
| 0x00669F80 | 80 | STL_tree_clear_and_delete_0x20 | Clears and deallocates STL tree node structure (0x20 bytes), recursively deleting child nodes if present. |
| 0x0066A000 | 65 | STL_map_clear_tree_0x20 | Clears and deallocates all nodes from a 32-byte STL tree/map by calling recursive deletion helper with stack canary protection. |
| 0x0066AC90 | 60 | operator() | FNV-1a hash function for 32-bit unsigned long values, computing hash with XOR and multiply operations. |
| 0x0066B8E0 | 236 | RBTree__CopyNodes | Recursively copies RB-tree nodes, allocating new 0x20-byte nodes and copying data from source to destination tree. |
| 0x0066B9F0 | 84 | RBTree__DestroySubtree_0x20 | Destroys RBTree subtree by recursively deleting child nodes and deallocating node memory with stack guard. |
| 0x0066BA70 | 94 | RBTree__DestroyNodes_0x14 | Recursively destroys red-black tree nodes by traversing left subtree then deallocating node; part of RBTree cleanup sequence. |
| 0x0066BAE0 | 94 | RBTree__DestroyNodes_0x18a | Recursively destroys Red-Black tree nodes by traversing left subtree and deallocating node memory |
| 0x0066BB50 | 94 | RBTree__DestroyNodes_0x18b | Recursively destroys red-black tree nodes by traversing left subtree then deallocating current node. |
| 0x0066BBC0 | 94 | RBTree__DestroyNodes_0x18c | Recursively destroys RBTree nodes by traversing left subtree and freeing each node's memory via operator delete. |
| 0x0066BC30 | 94 | RBTree__DestroyNodes_0x18d | Recursively destroys red-black tree nodes by traversing left subtree and deallocating each node with operator delete. |
| 0x0066BCA0 | 119 | RBTree__DestroyNodes_0x2c_str | Recursively destroys RBTree nodes containing 0x2c-byte structures with string members, deallocating memory. |
| 0x0066BD30 | 119 | RBTree__DestroyNodes_0x34 | Recursively destroys Red-Black Tree nodes by traversing left subtree, deleting node data, and freeing allocated memory. |
| 0x0066BDC0 | 94 | RBTree__DestroyNodes_0x18e | Recursively destroys red-black tree nodes by traversing left subtree and deallocating each node via operator delete. |
| 0x0066BE30 | 94 | RBTree__DestroyNodes_0x20 | Recursively destroys red-black tree nodes by traversing left subtree then deleting node with XOR stack canary. |
| 0x0066BEA0 | 99 | _Find_last<> | STL hash table internal method that finds the last node in a bucket chain matching a given hash value and key. |
| 0x0066BF10 | 99 | _Find_last<> | STL hash table internal method that finds the last node in a bucket chain matching a given hash value and key. |
| 0x0066BF80 | 99 | _Find_last<> | STL hash table internal method finding last matching bucket node for unsigned int key with hash collision resolution |
| 0x0066BFF0 | 99 | _Find_last<> | STL hash table internal method finding last matching node in collision chain by key hash, returns iterator result pair |
| 0x0066C060 | 99 | _Find_last<> | STL hash table lookup returning last matching node in collision chain for unsigned int key |
| 0x0066C0D0 | 99 | _Find_last<> | STL hash table internal method that finds the last node in a bucket chain matching a given hash value and key. |
| 0x0066C140 | 99 | _Find_last<> | STL unordered_map hash bucket search; finds last node with matching key hash in collision chain |
| 0x0066C1B0 | 99 | _Find_last<> | STL hash table internal method that finds the last node in a bucket chain matching a given hash value and key. |
| 0x0066C220 | 99 | _Find_last<> | STL hash table bucket traversal; finds last matching element in collision chain or returns sentinel node pair |
| 0x0066C290 | 99 | _Find_last<> | STL hash table internal method that finds the last node in a bucket chain matching a given hash value and key. |
| 0x0066C300 | 99 | _Find_last<> | STL hash table internal method that finds the last node in a bucket chain matching a given hash value and key. |
| 0x0066C370 | 99 | _Find_last<> | STL hash table internal method finding last matching bucket node by hash value, returns iterator pair with node and bucket link. |
| 0x0066C450 | 75 | _Find_lower_bound<> | STL red-black tree lower_bound search; traverses tree to find first node with value >= search key |
| 0x0066C4A0 | 75 | _Find_lower_bound<> | STL tree lower_bound search implementation; finds first element >= key in Red-Black tree using binary search traversal |
| 0x0066C4F0 | 75 | _Find_lower_bound<> | STL binary search tree lower_bound operation; finds first node with value >= search key in balanced tree |
| 0x0066C540 | 87 | RBTree__LowerBound_8byte | Performs lower_bound search on 64-bit key red-black tree node, returns iterator with node/parent/direction info |
| 0x0066C5A0 | 56 | _Fnv1a_append_value<> | FNV-1a hash computation for 4-byte values; iteratively XORs and multiplies by FNV prime 0x1000193 |
| 0x0066C650 | 158 | HashMap__Destroy_0x50 | Destroys a HashMap instance by freeing its internal buffer and deallocating the structure (0x50 bytes). |
| 0x0066C700 | 126 | HashMap__DestroyBuckets | Deallocates bucket chain nodes in a HashMap by recursively deleting linked list entries and their containers. |
| 0x0066C7A0 | 113 | HashMap__Destroy_0x2c | Destroys a HashMap by freeing its internal bucket array and deallocating the HashMap structure itself (0x2c bytes). |
| 0x0066C820 | 137 | HashMap__Destroy_0x2c_nested | Destroys a HashMap with 0x2c-sized elements, freeing nested vector buffer and deallocating hash table node memory. |
| 0x0066C8C0 | 113 | HashMap__Destroy_0x2c_b | Destroys a HashMap by clearing its count field, freeing internal structures, and deallocating the 0x2c-sized HashMap object. |
| 0x0066C940 | 137 | HashMap__Destroy_0x2c_nested_b | Destroys a nested HashMap structure by freeing its buffer and deallocating the 0x2c-sized node container. |
| 0x0066C9E0 | 91 | HashMap__DestroyBuckets_b | Destroys HashMap bucket array by deallocating linked list nodes and the bucket table itself. |
| 0x0066DB70 | 84 | HashMap__DestroyBuckets_c | Destroys HashMap bucket array by deallocating bucket nodes and the bucket array itself with XOR canary protection. |
| 0x0066E380 | 166 | STL_list__PushBack_int | Inserts an integer value into a doubly-linked list node, checking length limit (0x15555555) before allocation. |
| 0x0066E430 | 97 | fill<> | Standard library template function that fills a range of std::list iterators with a value across multiple instantiations. |
| 0x0066E4A0 | 97 | fill<> | STL std::fill template instantiation for initializing std::list iterators with values (unsigned int, strings, pairs) |
| 0x0066E510 | 97 | fill<> | STL std::fill template instantiation for initializing std::list iterators with values (unsigned int, string, pair types) |
| 0x0066E580 | 97 | fill<> | STL std::fill template instantiation for list iterators; initializes range with value for unsigned int, string, and pair containers |
| 0x0066E5F0 | 97 | fill<> | STL std::fill template instantiation for filling std::list iterator ranges with values across multiple type specializations |
| 0x0066E660 | 97 | fill<> | STL std::fill template instantiation for filling std::list containers with values across multiple type specializations |
| 0x0066E6D0 | 97 | fill<> | STL template instantiation for std::fill() operating on std::list iterators with various element types (unsigned int, strings, pairs) |
| 0x0066E740 | 97 | fill<> | STL std::fill template instantiation for std::list iterators with unsigned int, string, and pair<uint,uint> elements |
| 0x0066E7B0 | 97 | fill<> | STL template instantiation for std::fill() algorithm on various list iterator types (unsigned int, string, pair containers) |
| 0x0066E820 | 97 | fill<> | STL std::fill template instantiation for initializing std::list iterators with value types (unsigned int, string, pair) |
| 0x0066E890 | 97 | fill<> | STL std::fill template instantiation for initializing std::list iterators with values (unsigned int, string, pair types) |
| 0x0066E900 | 97 | fill<> | STL std::fill template instantiation for initializing std::list containers with unsigned int, string, and pair values |
| 0x0066E970 | 97 | fill<> | STL std::fill template instantiation for initializing std::list iterators with values (unsigned int, string, pair types) |
| 0x0066F5F0 | 31 | STL_fill_range_4byte_a | Fills a memory range with a constant value using element-sized strides |
| 0x0066F610 | 31 | STL_fill_range_4byte_b | Fills a memory range with a constant value using element-sized strides |
| 0x0066F630 | 31 | STL_fill_range_4byte_c | Fills a memory range with a constant value using element-sized strides |
| 0x0066F650 | 31 | STL_fill_range_4byte_d | Fills a memory range with a constant value using element-sized strides |
| 0x0066F670 | 31 | STL_fill_range_4byte_e | Fills a memory range with a constant value using element-sized strides |
| 0x0066F690 | 31 | STL_fill_range_4byte_f | Fills a memory range with a constant value using element-sized strides |
| 0x0066F6B0 | 31 | STL_fill_range_4byte_g | Fills a memory range with a constant value using element-sized strides |
| 0x0066F6D0 | 31 | STL_fill_range_4byte_h | Fills a memory range with a constant value using element-sized strides |
| 0x0066F6F0 | 31 | STL_fill_range_4byte_i | Fills a memory range with a constant value using element-sized strides |
| 0x0066F710 | 31 | STL_fill_range_4byte_j | Fills a memory range with a constant value using element-sized strides |
| 0x0066F730 | 31 | STL_fill_range_4byte_k | Fills a memory range with a constant value using element-sized strides |
| 0x0066F750 | 31 | STL_fill_range_4byte_l | Fills a memory range with a constant value using element-sized strides |
| 0x0066F770 | 31 | STL_fill_range_4byte_m | Fills a memory range with a constant value using element-sized strides |
| 0x0066F790 | 168 | HashMap__Init_0x10 | Initializes a HashMap with 16 buckets, setting up linked-list sentinel node and load factor threshold (0.5). |
| 0x0066F840 | 168 | HashMap__Init_0x10b | Initializes a HashMap with default capacity 0x10, sets up circular doubly-linked sentinel node, allocates bucket array |
| 0x0066F8F0 | 168 | HashMap__Init_0x14 | Initializes a HashMap with sentinel node, default load factor 1.0, and allocates 16 initial buckets. |
| 0x0066FFB0 | 64 | HashMap__FreeBucket_0xc | Frees a HashMap bucket node by deleting its allocated memory at offset +4 with stack canary protection. |
| 0x00670000 | 64 | HashMap__FreeBucket_0x10 | Frees a 16-byte bucket node in a HashMap by calling operator delete on offset +4 pointer with stack canary protection. |
| 0x00670050 | 64 | HashMap__FreeBucket_0x10_c | Frees a 0x10-sized bucket allocation within a HashMap, deallocating stored pointer if non-null. |
| 0x006700A0 | 64 | HashMap__FreeBucket_0x10_d | Frees a 0x10-sized bucket allocation within a HashMap, with stack cookie validation for security. |
| 0x006700F0 | 64 | HashMap__FreeBucket_0x10_e | Frees a 0x10-byte allocated bucket from a HashMap by calling operator delete on offset +4 if non-null. |
| 0x00670140 | 64 | HashMap__FreeBucket_0x10_f | Frees allocated memory (0x50 bytes) stored at offset +4 in HashMap bucket structure with stack canary protection. |
| 0x00670190 | 64 | HashMap__FreeBucket_0x10_g | Frees allocated memory in a HashMap bucket entry (0x10 size) by calling operator delete on offset +4 |
| 0x006701E0 | 64 | HashMap__FreeBucket_0x10_h | Frees a 0x2c-byte bucket node from a HashMap by calling operator_delete on the pointer at offset +4 |
| 0x00670230 | 64 | HashMap__FreeBucket_0x10_i | Frees allocated memory in a HashMap bucket entry by calling operator delete with 0x10 byte size and XOR canary. |
| 0x00670280 | 64 | HashMap__FreeBucket_0x10_j | Frees allocated bucket memory in HashMap by calling operator_delete on offset +4 if non-null, with stack canary protection. |
| 0x006702D0 | 64 | HashMap__FreeBucket_0x10_k | Frees a 0x10-sized bucket allocation from a HashMap, deallocating key memory if bucket pointer is non-null. |
| 0x00670320 | 64 | HashMap__FreeBucket_0x10_l | Frees a 0x2c-byte allocated bucket in a HashMap structure, with stack canary protection via XOR. |
| 0x00670370 | 64 | HashMap__FreeBucket_0x10_m | Deallocates a HashMap bucket node by freeing its 0x2c-byte payload at offset +4 with stack canary protection. |
| 0x006703C0 | 64 | HashMap__FreeBucket_0x10_n | Frees a 0x18-byte bucket/node allocated within a HashMap, with stack cookie validation for security. |
| 0x00670410 | 64 | HashMap__FreeBucket_0x10_o | Frees allocated bucket memory in HashMap by calling operator_delete on offset+4 pointer with size 0x14 bytes |
| 0x00670460 | 64 | HashMap__FreeBucket_0x10_p | Frees a 0x18-byte bucket node in a HashMap by deleting the pointer stored at offset +4. |
| 0x006704B0 | 64 | HashMap__FreeBucket_0x14 | Frees dynamically allocated bucket memory in a HashMap by calling operator delete on stored pointer at offset +4 |
| 0x00670500 | 64 | HashMap__FreeBucket_0x14_b | Frees a 0x18-byte bucket node in a HashMap by deleting the pointer stored at offset +4 with stack canary protection. |
| 0x00670550 | 64 | HashMap__FreeBucket_0x14_c | Frees dynamically allocated bucket memory (0x18 bytes) in a HashMap by calling operator delete with XOR stack canary. |
| 0x006705A0 | 64 | HashMap__FreeBucket_0x14_d | Frees dynamically allocated bucket memory (0x2c bytes) in a HashMap with stack cookie validation |
| 0x006705F0 | 64 | HashMap__FreeBucket_0x18 | Deallocates a 0x34-byte bucket node from a HashMap by calling operator_delete on offset +4 |
| 0x00670640 | 64 | HashMap__FreeBucket_0x18_b | Frees a 0x20-byte allocated bucket node in a HashMap by calling operator delete on offset+4 |
| 0x00670690 | 64 | HashMap__FreeBucket_0x18_c | Frees a 0x18-byte allocated bucket from a HashMap, with stack canary protection via XOR. |
| 0x006706E0 | 102 | HashMap__DestroyAndFree_0x10 | Destroys and deallocates a HashMap by freeing its internal vector buffer and node memory structures. |
| 0x00670770 | 102 | HashMap__DestroyAndFree_0x10_b | Destroys and deallocates a HashMap structure by freeing its internal vector buffer and node memory in 0x10-byte chunks. |
| 0x00670800 | 102 | HashMap__DestroyAndFree_0x10_c | Destroys and frees a HashMap structure by deallocating its internal bucket array and the HashMap object itself. |
| 0x00670890 | 102 | HashMap__DestroyAndFree_0x10_d | Destroys and deallocates a HashMap structure by freeing internal vector buffer and nested allocated pointers |
| 0x00670920 | 83 | HashMap__DestroyAndFree_0x50 | Destroys and deallocates a HashMap container with 0x50-byte elements, freeing internal vector buffer and calling destructor before delete. |
| 0x00670990 | 83 | HashMap__DestroyAndFree_0x14_b | Destroys and deallocates a HashMap structure, freeing internal buckets and releasing the 0x14-byte object. |
| 0x00670A00 | 83 | HashMap__DestroyAndFree_0x14_c | Destroys HashMap by freeing internal buffer, calling destructor on entries, then deallocating the 0x2c-byte HashMap structure. |
| 0x00670A70 | 102 | HashMap__DestroyAndFree_0x10_e | Destroys HashMap by freeing internal vector buffer and deallocating bucket array and hashmap structure. |
| 0x00670B00 | 83 | HashMap__DestroyAndFree_0x18 | Destroys HashMap contents via nested destruction, then deallocates the 0x2c-sized HashMap structure and its buffer. |
| 0x00670B70 | 102 | HashMap__DestroyAndFree_0x2c_b | Destroys and deallocates a HashMap structure by freeing internal vector buffer and node memory allocations. |
| 0x00670C00 | 83 | HashMap__DestroyAndFree_0x18_b | Destroys and deallocates a HashMap structure, freeing internal vector buffer and 0x2c-sized hash table node memory. |
| 0x00670C70 | 83 | HashMap__DestroyAndFree_0x18_c | Destroys and deallocates a HashMap structure, freeing its vector buffer and nested contents before deleting the object. |
| 0x00670CE0 | 102 | HashMap__DestroyAndFree_0x10_f | Destroys and deallocates a HashMap structure, freeing its internal vector buffer and hash bucket nodes via operator delete. |
| 0x00670D70 | 86 | STL_vector__FreeBuffer | Deallocates memory buffer from STL vector, handling aligned allocation metadata and validating heap integrity before freeing. |
| 0x00670E00 | 86 | STL_vector__FreeBuffer_b | Deallocates STL vector buffer with overflow protection, validates allocation metadata before calling operator delete. |
| 0x00670E90 | 86 | STL_vector__FreeBuffer_c | Deallocates STL vector buffer memory with overflow validation and CXX exception handling frame setup. |
| 0x00670F20 | 86 | STL_vector__FreeBuffer_d | Deallocates memory for an STL vector buffer, handling aligned heap blocks with size validation before calling operator delete. |
| 0x00670FB0 | 86 | STL_vector__FreeBuffer_e | Frees allocated buffer memory for STL vector, validating heap metadata before deallocation with stack canary protection. |
| 0x00671040 | 86 | STL_vector__FreeBuffer_f | Deallocates vector buffer memory, handling aligned allocation metadata and validating heap integrity before calling operator delete. |
| 0x006710D0 | 86 | STL_vector__FreeBuffer_g | Deallocates STL vector buffer memory with overflow validation, calls operator delete with XOR-encoded stack cookie. |
| 0x00671160 | 86 | STL_vector__FreeBuffer_h | Deallocates STL vector buffer memory with overflow protection, validating allocation header before freeing. |
| 0x006711F0 | 86 | STL_vector__FreeBuffer_i | Deallocates memory buffer for STL vector, handling aligned allocations with size validation before calling operator delete. |
| 0x00671280 | 86 | STL_vector__FreeBuffer_j | Deallocates STL vector buffer with overflow protection and XOR stack cookie validation before operator delete. |
| 0x00671310 | 86 | STL_vector__FreeBuffer_k | Deallocates STL vector buffer with overflow protection, validating allocation metadata before freeing memory. |
| 0x006713A0 | 86 | STL_vector__FreeBuffer_l | Deallocates STL vector buffer with overflow validation, calls operator delete with XOR stack cookie and size alignment |
| 0x00671430 | 86 | STL_vector__FreeBuffer_m | Deallocates memory buffer for STL vector, validating heap metadata and freeing allocated blocks via operator delete |
| 0x006714C0 | 75 | HashMap__FreeBucket_0xc_b | Frees a heap-allocated bucket node (size 0xc bytes) in a HashMap by calling operator delete with stack canary validation. |
| 0x00671510 | 75 | HashMap__FreeBucket_0xc_c | Frees allocated memory bucket in HashMap by calling operator_delete on non-null bucket pointer at offset +4 |
| 0x00671560 | 75 | HashMap__FreeBucket_0xc_d | Frees allocated memory in a HashMap bucket by calling operator delete on the bucket's data pointer at offset +4. |
| 0x006715B0 | 75 | HashMap__FreeBucket_0xc_e | Deallocates a HashMap bucket by freeing its 16-byte allocation at offset +4 with stack canary validation. |
| 0x00671600 | 75 | HashMap__FreeBucket_0xc_f | Frees a 16-byte allocated bucket node in a HashMap by calling operator_delete on offset +4 if non-null. |
| 0x00671650 | 151 | HashMap__DestroyAndFree_0x50_b | Destroys and deallocates a HashMap structure by freeing its internal bucket array and the HashMap object itself. |
| 0x006716F0 | 107 | HashMap__DestroyAndFree_0x14 | Destroys and deallocates a HashMap structure by freeing its bucket array and the HashMap object itself. |
| 0x00671760 | 120 | HashMap__DestroyAndFree_0x2c | Destroys and deallocates a HashMap structure by freeing its internal bucket array and the HashMap object itself. |
| 0x006717E0 | 75 | HashMap__FreeBucket_0x10_b | Deallocates a 0x10-sized bucket node in a HashMap by calling operator delete on the stored pointer at offset +4. |
| 0x00671830 | 149 | HashMap__DestroyAndFree_0x2c_nested | Destroys and frees a HashMap with 0x2c-sized entries, including nested vector buffer cleanup and XOR stack canary verification. |
| 0x00671AF0 | 80 | STL_map_clear_tree_0x18a | Clears STL map tree nodes by destroying child nodes and deallocating tree structure memory (0x18 bytes). |
| 0x00671B70 | 80 | STL_map_clear_tree_0x18b | Clears and deallocates an STL map node (0x18b size) by destroying child nodes and freeing memory with XOR cookie validation. |
| 0x00671BF0 | 80 | STL_map_clear_tree_0x18c | Clears and deallocates an STL map container with 0x18c-byte nodes, destroying child nodes and freeing memory with XOR stack canary protection. |
| 0x00671C70 | 80 | STL_map_clear_tree_0x18d | Clears STL map container by destroying tree nodes and deallocating internal tree structure (0x18d byte size). |
| 0x00671CF0 | 57 | STL_map_clear_tree_0x2c_str | Clears and deallocates a Red-Black tree node structure (0x2c bytes) containing string keys from STL map. |
| 0x00671D50 | 57 | STL_map_clear_tree_0x34 | Destroys all nodes in a red-black tree (size 0x34) and deallocates the tree structure memory. |
| 0x00671DB0 | 80 | STL_map_clear_tree_0x14 | Clears STL map container by destroying red-black tree nodes and deallocating map node structure (0x14 bytes). |
| 0x00671E30 | 80 | STL_map_clear_tree_0x18e | Clears and deallocates an STL map's red-black tree node structure (0x18e bytes), destroying child nodes and freeing memory. |
| 0x00673E40 | 223 | STL_map_find_or_insert_uint_24byte | STL map insertion helper: finds or inserts a 24-byte value by uint key, returns iterator to value pair. |
| 0x00673F20 | 83 | operator++ | STL tree iterator pre-increment operator; advances to next node in RB-tree, handling left subtree traversal and parent backtracking |
| 0x00673F80 | 83 | operator++ | STL tree iterator pre-increment operator; advances to next node in red-black tree traversal by finding successor node |
| 0x00673FE0 | 83 | operator++ | STL tree iterator pre-increment operator; advances to next node in red-black tree traversal for unsigned int set. |
| 0x00674040 | 83 | operator++ | STL tree iterator pre-increment operator; advances to next node in red-black tree traversal by moving right subtree or up to parent |
| 0x006740A0 | 83 | operator++ | STL tree iterator pre-increment operator; advances const_iterator to next node in binary search tree by height/color traversal. |
| 0x00685620 | 704 | RBTree__ExtractNode_a | Extracts and unlinks a node from red-black tree, performs rebalancing rotations and color fixes to maintain RB-tree properties. |
| 0x006858E0 | 704 | STL_rbtree_erase_rebalance_datatable_A | Red-black tree node erasure with rebalancing for unsigned int datatable; handles successor swapping and color restoration. |
| 0x00685BA0 | 704 | STL_rbtree_erase_rebalance_datatable_B | Red-black tree node erasure with rebalancing for unsigned int data table, handles successor node replacement and tree restructuring. |
| 0x00685E60 | 704 | STL_rbtree_erase_rebalance_datatable_C | Red-black tree node erasure with rebalancing for unsigned int data table; handles successor promotion and color restoration. |
| 0x006876A0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree invariants and color properties. |
| 0x006878B0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure and color invariants |
| 0x00687AC0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree invariants and color properties. |
| 0x00687CD0 | 517 | Insert_node | STL Red-Black Tree node insertion with rebalancing; maintains tree properties and color invariants |
| 0x00687EE0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree invariants and handles color adjustments for BST operations. |
| 0x006880F0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color balance |
| 0x00688300 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree invariants and color properties. |
| 0x00688510 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure and color invariant |
| 0x00688720 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree invariants and color properties for map/set containers |
| 0x00688930 | 84 | RBTree__RotateLeft | Performs left rotation on RB-tree node, promoting right child and updating parent pointers and root reference. |
| 0x00688990 | 84 | STL_rbtree_node_delete_callback_A | Red-black tree node deletion callback that relinks parent/child pointers during node removal |
| 0x006889F0 | 84 | STL_rbtree_node_delete_callback_B | Red-black tree node removal callback that unlinks a node from its parent/sibling pointers during deletion. |
| 0x00688A50 | 84 | STL_rbtree_node_delete_callback_C | Red-black tree node deletion callback that relinks parent pointers and maintains tree structure during node removal. |
| 0x00688AB0 | 132 | _Rehash_for_1 | Rehashes std::unordered_set<std::string> by calculating new bucket count and reallocating hash table storage. |
| 0x00688B40 | 132 | _Rehash_for_1 | Rehashes std::unordered_set<std::string> by calculating new bucket count and reallocating hash table |
| 0x00688BD0 | 88 | RBTree__NodeRotateHelper_a | Performs right rotation on red-black tree node; updates parent pointers and rebalances tree structure. |
| 0x00688C30 | 88 | RBTree__NodeRotateHelper_b | Performs right rotation on red-black tree node; updates parent pointers and maintains tree structure invariants. |
| 0x00688C90 | 88 | RBTree__NodeRotateHelper_c | Red-Black tree right rotation helper; repositions node by updating parent pointers and child links during tree rebalancing. |
| 0x00688CF0 | 88 | RBTree__NodeRotateHelper_d | Performs right rotation on red-black tree node, updating parent pointers and tree structure accordingly. |
| 0x00688D50 | 225 | STL_node_delete_16byte | Deletes a 16-byte STL node after validation; calls operator_delete if node pointers differ, with stack canary check. |
| 0x00688F30 | 225 | STL_rbtree_node_destroy | Deallocates a red-black tree node if pointers differ; validates stack canary before cleanup. |
| 0x00689110 | 225 | STL_rbtree_node_delete | Deallocates a single red-black tree node if param_1 differs from param_2 (likely end iterator check). |
| 0x006892F0 | 225 | STL_rbtree_destroy_and_dealloc_C | Destroys and deallocates a red-black tree node if pointers differ, with stack canary validation for buffer overflow protection. |
| 0x00689B70 | 95 | stl_alloc_aligned_0x18 | Allocates aligned memory for arrays of 0x18-byte elements with overflow checks and 32-byte alignment for sizes โฅ0x1000. |
| 0x0068CB00 | 99 | _Find_last<> | STL hash table internal method that finds the last matching bucket entry for a given hash value in unordered map/set |
| 0x0068CB70 | 56 | _Fnv1a_append_value<> | FNV-1a hash computation for 4-byte value; multiplies by FNV prime 0x1000193 with XOR folding |
| 0x0068D020 | 97 | fill<> | STL std::fill template instantiation for std::list iterators; initializes list elements with value. |
| 0x0068D1B0 | 31 | STL_fill_4byte_A | Fills a memory range with a constant value using element-sized strides |
| 0x0068D1D0 | 31 | STL_fill_4byte_B | Fills a memory range with a constant value using element-sized strides |
| 0x0068D640 | 87 | STL_vector__ClearAndDealloc_a | Clears vector contents and deallocates memory; calls RangeDelete then Deallocate with SEH protection. |
| 0x0068D6A0 | 87 | STL_vector__ClearAndDealloc_b | Clears and deallocates an STL vector by calling range delete and deallocate helper functions with stack canary protection. |
| 0x0068D700 | 86 | STL_vector__RangeDelete_a | Deallocates memory for a range-deleted STL vector, handling small/large allocations with guard validation. |
| 0x0068D790 | 86 | STL_vector__RangeDelete_b | Deletes a range of elements from an STL vector, freeing allocated memory with bounds validation. |
| 0x0068D9A0 | 140 | STL_vector__Deallocate_a | Deallocates STL vector by freeing internal buffer and vector object via operator delete with XOR stack canary. |
| 0x0068DA50 | 140 | STL_vector__Deallocate_b | Deallocates STL vector memory, destroys contained objects via virtual destructor, clears size metadata. |
| 0x00690390 | 225 | STL_rbtree_destroy_and_dealloc_D | Destroys and deallocates a red-black tree node if param_1 differs from param_2; includes stack canary validation. |
| 0x00690570 | 10 | STL_Xlength_error_enchant_config | Throws std::length_error exception when a vector exceeds maximum allowed size during enchant config operations. |
| 0x00690580 | 49 | STL_string_deallocate_large | Deallocates STL string memory with size validation; multiplies param_2 by 100 and checks allocation header consistency. |
| 0x00690670 | 99 | _Find_last<> | STL hash table internal method finding last matching node in collision chain by key, returns iterator pair with node and hash bucket link. |
| 0x006906E0 | 99 | _Find_last<> | STL hash table internal method that finds the last node in a bucket chain matching a given hash value and key. |
| 0x00690750 | 138 | STL_deque__Deallocate_a | Deallocates STL deque by freeing internal map pointer and releasing allocated memory block of 0x38 bytes. |
| 0x006907F0 | 138 | STL_deque__Deallocate_b | Deallocates STL deque internal buffer; nullifies size, releases allocated memory via virtual destructor call, then frees node object. |
| 0x00690CF0 | 97 | fill<> | STL std::fill template instantiation for various container iterators (unsigned int, strings, pairs); generic range fill operation |
| 0x00690D60 | 97 | fill<> | STL std::fill<> template instantiation for initializing std::list iterators with unsigned int, string, and pair values |
| 0x006936B0 | 22 | STLIterator__SetVTable | Initializes STL iterator vtable pointer and copies offset+4 value from source object to iterator. |
| 0x006936D0 | 22 | STL_iterator__construct | Initializes STL iterator object with vtable pointer and copies state from source iterator at offset +4 |
| 0x006936F0 | 16 | STL_set__default_vtable | Sets vtable pointer for STL container object initialization (likely std::set instantiation) |
| 0x00693700 | 16 | std_set_ctor_or_init | Initializes vtable pointer for STL set container instance at given address |
| 0x006938B0 | 636 | STL_hash_table_rehash | Rehashes hash table by allocating new bucket array and reinserting existing elements with proper sizing. |
| 0x00693B30 | 636 | STL_vector_grow_and_fill_B | Rehashes hash table by allocating new bucket array, copying existing elements, and updating capacity/size metadata. |
| 0x00693DF0 | 22 | STL_iterator_init_vtable_i | Initializes STL iterator vtable by setting virtual function pointer and copying iterator state from source object. |
| 0x00693E10 | 22 | STL_iterator_init_vtable_j | Initializes vtable for STL iterator by setting constructor pointer and copying offset+4 value from source object. |
| 0x00693E30 | 16 | STL_set_vtable_ptr_c | Initializes vtable pointer for STL set container to default implementation vtable at 0100a154. |
| 0x00693E40 | 16 | STL_set_vtable_ptr_d | Initializes vtable pointer for std::set destructor; assigns destructor vtable to object at param_1 |
| 0x00694150 | 288 | STL_rbtree_destroy_and_dealloc_E | Destroys red-black tree node and deallocates memory; calls destructor on left child if exists, then frees node. |
| 0x006943B0 | 288 | STL_rbtree_destroy_and_dealloc_F | Destroys red-black tree node by invoking destructor and deallocating 0x38 bytes of memory. |
| 0x00697210 | 116 | STL_rbtree_copy_tree | Copies a red-black tree structure by recursively cloning nodes and updating min/max sentinel pointers. |
| 0x00697290 | 232 | STL_rbtree_copy_nodes_recursive | Recursively copies red-black tree nodes; creates new node with param_3 value, processes left/right subtrees via recursion. |
| 0x006973A0 | 84 | STL_rbtree_destroy_and_free | Destroys red-black tree nodes and deallocates tree structure with XOR-based stack canary protection. |
| 0x00697420 | 94 | STL_rbtree_leftmost | Recursively traverses red-black tree to find and delete leftmost node, freeing 0x14-byte node structures. |
| 0x00697490 | 94 | STL_rbtree_rightmost | Recursively traverses red-black tree to find and delete rightmost node, deallocating memory. |
| 0x00697500 | 445 | STL_rbtree_find_insert_pos_uint | Finds insertion position in red-black tree of unsigned ints, returns iterator and insertion side flag |
| 0x006976C0 | 434 | STL_rbtree_find_insert_pos_int | Finds insertion position in red-black tree for unsigned int keys, handling left/right child placement and tree balancing. |
| 0x00697880 | 75 | _Find_lower_bound<> | STL red-black tree lower_bound search traversing nodes to find first element not less than key value |
| 0x006978D0 | 75 | _Find_lower_bound<> | STL red-black tree lower_bound search; finds first node with key >= search value in ordered set |
| 0x00697920 | 75 | STL_rbtree_size | Finds lower_bound position in red-black tree by comparing key with node values, returns iterator-like structure |
| 0x00697970 | 271 | STL_rbtree_merge_unique | Merges nodes from one red-black tree into another, maintaining unique key ordering and rebalancing tree structure. |
| 0x00697A80 | 298 | STL_set_construct_from_uint_range | Constructs red-black tree set from uint range [param_2, param_3), inserting elements with duplicate detection. |
| 0x00697BB0 | 298 | STL_set_construct_from_int_range | Constructs a red-black tree set from an integer range [param_2, param_3), inserting nodes via tree balancing. |
| 0x00697CE0 | 64 | STL_rbtree_begin_iter | Deletes/frees a red-black tree node at offset +4, with stack canary protection for exception safety. |
| 0x00697D30 | 64 | STL_rbtree_node_destructor | Destroys a red-black tree node by deallocating its 0x1c-byte memory block at offset +4. |
| 0x00697D80 | 64 | STL_rbtree_begin_iter_b | Deletes a red-black tree node by freeing allocated memory at offset +4 with stack canary protection. |
| 0x00697DD0 | 64 | STL_rbtree_end_iter_b | Destructs red-black tree node by deleting heap-allocated member at offset +4 with stack canary validation. |
| 0x00697E20 | 80 | STL_rbtree_erase_all | Clears red-black tree by deleting all nodes; frees header node and root node with stack canary protection. |
| 0x00697EC0 | 121 | STL_rbtree_erase_node_int | Destroys red-black tree node by freeing its subtree and deallocating the node structure (0x1c bytes). |
| 0x00697F40 | 121 | STL_rbtree_node_destroy_uint | Destroys and deallocates a red-black tree node containing uint data, freeing associated child nodes first. |
| 0x00697FC0 | 75 | STL_rbtree_lower_bound_int | Destroys a red-black tree node by deallocating its memory (0x14 bytes), likely called during tree deletion or rebalancing. |
| 0x00698010 | 75 | STL_rbtree_lower_bound_uint | Destructor for red-black tree node; deallocates node memory (0x14 bytes) with stack canary validation. |
| 0x00698060 | 75 | STL_rbtree_find_int | Destructs a red-black tree node by deallocating its memory (0x1c bytes) with stack canary protection. |
| 0x006980B0 | 75 | STL_rbtree_find_uint | Destroys a red-black tree node by deallocating its 0x1c-byte memory block with stack canary protection. |
| 0x00698100 | 75 | STL_rbtree_find_int_b | Destructs a red-black tree node by deallocating its 0x14-byte payload if present, with stack canary protection. |
| 0x00698150 | 75 | STL_rbtree_find_uint_b | Destructor for red-black tree node; deallocates node memory (0x14 bytes) with XOR canary validation. |
| 0x006981A0 | 81 | STL_rbtree_clear_int | Clears a red-black tree by destroying and freeing all nodes, resetting the container to empty state. |
| 0x00698200 | 81 | STL_rbtree_clear_uint | Clears/destroys a red-black tree container storing uint keys, freeing all allocated nodes and resetting structure. |
| 0x00698260 | 65 | STL_rbtree_insert_unique_int | Clears all nodes from a red-black tree container by calling erase_all with stack canary protection. |
| 0x006982B0 | 90 | STL_rbtree_assign | Assigns param_2 tree to param_1, clearing param_1's nodes and copying param_2's tree structure. |
| 0x00698320 | 275 | STL_rbtree_insert_unique_check_uint | Red-black tree insertion with uniqueness check for uint keys; allocates node if key doesn't exist, returns node offset. |
| 0x00698440 | 275 | STL_rbtree_insert_unique_check_int | Inserts a unique element into an STL red-black tree, checking for duplicates and managing tree node allocation. |
| 0x00698560 | 83 | operator++ | STL tree iterator pre-increment operator; advances to next node in red-black tree traversal |
| 0x006985C0 | 83 | operator++ | STL tree iterator pre-increment operator; advances to next node in red-black tree traversal |
| 0x0069A020 | 704 | STL_rbtree_extract_node | Extracts and rebalances a node from red-black tree, handling successor replacement and color fix-up. |
| 0x0069A2F0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties and color invariants |
| 0x0069A500 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; handles tree structure updates and color fixes. |
| 0x0069A710 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties after adding new node |
| 0x0069A920 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree balance invariants and parent/child pointers. |
| 0x0069AB30 | 84 | STL_rbtree_rotate_right_8c | Red-black tree right rotation operation; rebalances tree by rotating node and updating parent pointers |
| 0x0069AB90 | 88 | STL_rbtree_rotate_left_8c | Red-black tree left rotation: restructures tree node by rotating param_2 up and iVar1 down, updating parent pointers. |
| 0x0069C730 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties and updates parent/child pointers |
| 0x0069D200 | 94 | STL_rbtree_destroy_nodes_14_recursive | Recursively destroys red-black tree nodes by traversing right subtree, then deallocating current node with 0x14 byte size. |
| 0x0069D270 | 75 | STL_rbtree_lower_bound_int_14 | STL red-black tree lower_bound operation; finds first node with key >= search value, stores result in iterator struct |
| 0x0069D2C0 | 281 | STL_rbtree_find_or_insert_string_28 | Finds or inserts a string key into an STL red-black tree map, returning node pointer and insertion success flag. |
| 0x0069D4C0 | 64 | STL_rbtree_begin_28 | Destroys red-black tree node by freeing allocated memory at offset +4 with size 0x14 bytes. |
| 0x0069D510 | 80 | STL_rbtree_clear_28 | Clears and deallocates red-black tree nodes; destroys tree structure if sentinel node, otherwise deletes root node. |
| 0x0069D590 | 75 | STL_rbtree_lower_bound_str_28 | Destructs red-black tree node by freeing 20-byte allocated memory with stack canary validation. |
| 0x0069D5E0 | 75 | STL_rbtree_find_str_28 | Destroys a red-black tree node by deallocating its 0x14-byte structure with stack canary protection. |
| 0x0069D630 | 65 | STL_rbtree_clear_unique_int_14 | Clears a red-black tree container with stack frame setup and canary-based buffer overflow protection. |
| 0x0069D680 | 108 | STL_rbtree_destructor_int_14 | Red-black tree destructor that recursively deletes all nodes and deallocates the tree structure. |
| 0x0069D730 | 108 | STL_rbtree_erase_str_28 | Destructs an STL red-black tree node, recursively deleting string-keyed entries and freeing allocated memory. |
| 0x0069E020 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure and color properties after insert. |
| 0x0069E720 | 147 | STL_rbtree_move_constructor | Move-constructs red-black tree node, allocating sentinel node and transferring parent/child pointers between trees. |
| 0x0069E7C0 | 139 | STL_rbtree_destroy_nodes_28_recursive | Recursively destroys red-black tree nodes by traversing left subtree then deallocating node with stack unwinding protection. |
| 0x0069E860 | 132 | STL_rbtree_destroy_nodes_20_recursive | Recursively destroys red-black tree nodes by traversing left subtree and deallocating 32-byte node structures. |
| 0x0069E8F0 | 75 | STL_rbtree_find_str_28b | Red-black tree lower_bound search on integer keys, returns iterator to first element >= target value |
| 0x0069E9D0 | 64 | STL_rbtree_begin_20 | Deletes a red-black tree node by freeing allocated memory at offset +4, with stack canary protection. |
| 0x0069EA20 | 64 | STL_rbtree_end_20 | Destroys red-black tree node by deallocating 0x1c-byte structure at offset+4 with stack canary verification. |
| 0x0069EA70 | 64 | STL_rbtree_begin_28b | Deletes a red-black tree node by calling operator_delete on offset+4, with stack canary validation (XOR check). |
| 0x0069EAC0 | 113 | STL_rbtree_insert_unique_int_20 | Exception handler cleanup that destructs a std::string and deallocates 0x28-byte memory block on stack unwinding. |
| 0x0069EB40 | 57 | STL_rbtree_destructor_int | Destroys red-black tree nodes recursively then deallocates the tree structure with stack guard cookie validation. |
| 0x0069EBA0 | 57 | STL_rbtree_destructor_int_28 | Destroys red-black tree nodes recursively then deallocates the tree structure (28-byte nodes). |
| 0x0069EC00 | 139 | STL_rbtree_erase_int_28 | Destroys and deallocates an STL red-black tree structure, recursively freeing all nodes and the tree root. |
| 0x0069ECA0 | 123 | STL_rbtree_node_destructor_int_20 | Destructs red-black tree node by clearing its contents and deallocating 32-byte memory block at offset +4. |
| 0x0069ED20 | 75 | STL_rbtree_node_destructor_int | Destructs a red-black tree node by calling operator_delete on offset+4 (child pointer), likely cleanup during tree rebalancing or deletion. |
| 0x0069ED70 | 75 | STL_rbtree_lower_bound_int_28 | Destructor for red-black tree node; deallocates 32-byte node memory if pointer at offset +4 is non-null |
| 0x0069EDC0 | 104 | STL_rbtree_clear_20 | Clears and deallocates a red-black tree node structure, freeing internal string data and the node itself. |
| 0x0069EE50 | 68 | STL_rbtree_destructor_int_20 | Destroys red-black tree nodes recursively then deallocates the tree structure with stack canary validation. |
| 0x0069EEB0 | 68 | STL_rbtree_count_int_28 | Destructor for red-black tree container; recursively destroys nodes then deallocates tree structure memory. |
| 0x0069EF10 | 83 | STL_rbtree_erase_node_int_20 | Erases and deallocates all nodes in an STL red-black tree, recursively destroying child nodes before freeing root allocation. |
| 0x0069EF80 | 83 | STL_rbtree_erase_node_int_28 | Wrapper for red-black tree node erasure; sets up stack frame and delegates to STL_rbtree_clear_20 with canary-protected parameters. |
| 0x0069EFE0 | 89 | STL_rbtree_node_destructor_20 | Destructor for red-black tree node; recursively destroys child nodes then deallocates memory with stack canary protection. |
| 0x0069F050 | 68 | STL_rbtree_swap_28 | Clears a red-black tree container by calling STL_rbtree_clear_20 with stack canary protection. |
| 0x0069F0A0 | 27 | STL_rbtree_delete_if_owned | Conditional destructor that deletes rbtree node if ownership flag (param_2 & 1) is set, otherwise returns node pointer. |
| 0x0069F850 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree invariants and color properties. |
| 0x0069FA60 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color balance. |
| 0x0069FF00 | 234 | STL_rbtree_insert_unique_int_14b | Inserts unique integer key into red-black tree; returns node pointer and success flag indicating if insertion occurred or key already exists. |
| 0x0069FFF0 | 121 | STL_rbtree_node_init_int_14 | Initializes a red-black tree node with sentinel values and color flag (0x101 = red node marker). |
| 0x006A0080 | 86 | CPaidItemMgr__Clear | Initializes/clears a red-black tree container for CPaidItemMgr, setting up an empty item node collection with stack guard. |
| 0x006A09C0 | 123 | STL_rbtree_node_destructor_str | Destructor for red-black tree node with string data; deallocates vectors and optionally frees the node structure. |
| 0x006A0A40 | 108 | STL_rbtree_clear_28b | Destructor for STL red-black tree container; clears all vector elements, erases map nodes, optionally deallocates object. |
| 0x006A12F0 | 94 | STL_rbtree_find_node_recursive_int | Recursively searches red-black tree nodes; deallocates node if it has no left child, otherwise recurses left. |
| 0x006A1360 | 94 | STL_rbtree_find_and_delete_int | Recursively searches red-black tree node, deletes if leaf (char at offset 0xd is null), with SEH exception handling. |
| 0x006A13D0 | 119 | STL_rbtree_erase_int_c | Recursively erases red-black tree nodes with null left child, deallocating 0x20-byte node structures. |
| 0x006A1460 | 166 | STL_rbtree_insert_unique_str_28 | Recursively inserts unique string nodes into red-black tree, erasing duplicates and deallocating memory for leaf nodes. |
| 0x006A1520 | 75 | STL_rbtree_lower_bound_int_a | Performs lower_bound search on red-black tree with integer keys, returns iterator to first element >= search value |
| 0x006A1570 | 75 | STL_rbtree_lower_bound_int_b | Finds the first node in red-black tree with key >= search value; returns iterator struct with node, comparison result, parent |
| 0x006A15C0 | 75 | STL_rbtree_lower_bound_int_c | Performs binary search tree lower_bound operation on red-black tree with integer keys, returning iterator to first element >= search value |
| 0x006A1610 | 75 | STL_rbtree_lower_bound_int_d | Red-black tree lower_bound search for integer keys; traverses tree storing node pointers and comparison results in output struct. |
| 0x006A1660 | 489 | STL_vector_insert_range | Inserts a range of elements into an STL vector, reallocating if necessary and preserving existing elements. |
| 0x006A18F0 | 34 | STL_rbtree_copy_range | Copies memory range [param_1, param_2) to param_3, returns end pointer of copied data |
| 0x006A1920 | 181 | STL_vector_int_copy | Copies integer vector data by allocating new memory and performing memmove of source vector contents. |
| 0x006A19E0 | 172 | STL_rbtree_assign_28 | Copy assignment operator for red-black tree container, copying node destructors and multiple vector data members. |
| 0x006A1A90 | 134 | CItemTable__InitializeItemStringBuffer | Initializes item table string buffer with zero-filled capacity fields and calls item string assignment. |
| 0x006A1B20 | 132 | CItemTable__Clear | Clears and reinitializes item table structure by zeroing multiple offset fields and calling item string assignment. |
| 0x006A1BB0 | 64 | STL_rbtree_begin_e | Deletes a red-black tree node by calling operator_delete on the node pointer stored at offset +4. |
| 0x006A1C00 | 64 | STL_rbtree_end_e | Destructs red-black tree node by freeing 32-byte allocated memory at offset +4, with stack canary protection. |
| 0x006A1C50 | 64 | STL_rbtree_destructor | Destructor for red-black tree node; deallocates memory at offset +4 with XOR cookie stack guard check. |
| 0x006A1CA0 | 64 | STL_rbtree_end_f | Destructor for STL red-black tree node; deallocates memory at offset +4 with XOR-obfuscated stack canary check. |
| 0x006A1CF0 | 64 | STL_rbtree_begin_g | Destroys a red-black tree node by deallocating its memory (0x58 bytes) with stack canary protection. |
| 0x006A1D40 | 75 | STL_rbtree_lower_bound_int_e | Destructor for red-black tree node; deallocates child node at offset +4 with stack canary verification. |
| 0x006A1DA0 | 80 | STL_rbtree_clear_recursive | Recursively clears red-black tree nodes by finding and deleting leaf nodes, then deallocates tree structure. |
| 0x006A1E20 | 80 | STL_rbtree_clear_f | Clears a red-black tree node by recursively deleting children and freeing allocated memory with XOR cookie validation. |
| 0x006A1EA0 | 57 | STL_rbtree_destroy_int | Destroys a red-black tree by erasing all nodes and deallocating the tree structure (0x20 bytes). |
| 0x006A1F00 | 57 | STL_rbtree_insert_unique_int_f | Inserts unique integer into red-black tree; calls insert function then deletes parameter on scope exit. |
| 0x006A1F60 | 75 | STL_rbtree_lower_bound_int_f | Destroys red-black tree node by deallocating 0x20-byte memory block at offset +4 with stack canary protection. |
| 0x006A1FB0 | 75 | STL_rbtree_lower_bound_int_g | Destroys red-black tree node by deallocating 32-byte memory block at offset +4 with stack canary protection. |
| 0x006A2000 | 113 | STL_rbtree_destroy_and_free_20 | Destroys and deallocates red-black tree node, erasing all children before freeing the root node memory. |
| 0x006A2080 | 155 | STL_rbtree_destroy_and_free_58 | Destroys and deallocates a red-black tree node structure, erasing all nodes and freeing the tree container memory. |
| 0x006A2120 | 75 | STL_rbtree_find_int_g | Destructs a red-black tree node by deallocating its 0x20-byte payload via operator_delete with stack canary validation. |
| 0x006A2170 | 75 | STL_rbtree_find_int_h | Destructor that deallocates a red-black tree node's memory (0x20 bytes) with stack cookie validation. |
| 0x006A21C0 | 75 | STL_rbtree_find_str_28c | Destructor for red-black tree node; deallocates 32-byte memory block at offset +4 with stack canary validation. |
| 0x006A2210 | 75 | STL_rbtree_lower_bound_str_28b | Destructs red-black tree node by freeing 0x58-byte allocated memory with stack canary validation. |
| 0x006A2260 | 74 | STL_rbtree_erase_str_28b | Erases and deallocates a red-black tree node containing a string, freeing both child pointer and node structure. |
| 0x006A22D0 | 68 | STL_rbtree_erase_node_wrapper_28b | Wrapper that erases a red-black tree node with stack canary protection; calls STL_rbtree_erase_node_28 |
| 0x006A23A0 | 106 | STL_map_string__EraseNode | Deallocates a node in an STL map with string keys, handling memory cleanup and buffer validation before deletion. |
| 0x006A2860 | 40 | operator= | SimpleString assignment operator that calculates string length and appends buffer content to the SimpleString instance |
| 0x006A63C0 | 370 | STL_string_find_substring | Searches for a substring within an STL string using memchr optimization, comparing chunks of 4 bytes at a time for efficiency. |
| 0x006A6540 | 35 | std_string__assign_cstr_b | Calculates C-string length and assigns it to std::string via range assignment, wrapping strlen logic. |
| 0x006A6EF0 | 517 | Insert_node | STL std::map/set red-black tree node insertion with rebalancing; maintains tree structure and color properties. |
| 0x006A7100 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure and color properties during element addition. |
| 0x006A7310 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure and color properties after insert. |
| 0x006A7520 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; handles tree structure updates and color property maintenance. |
| 0x006A7730 | 106 | STL_rbtree_erase_node_28 | Deallocates a red-black tree node by freeing its allocated memory block with bounds validation. |
| 0x006A77F0 | 165 | STL_list__InsertNode | Inserts a new node into STL list structure, managing bidirectional links and capacity tracking with XOR canary validation. |
| 0x006A78A0 | 219 | STL_vector_grow_and_memcpy | Allocates STL vector, writes 2-byte header + size field, then memcpys payload data for packet/serialization buffers. |
| 0x006A79E0 | 37 | _Uninitialized_value_construct_n<struct_std::_Parallelism_allocator<unsigned_int>_> | Initializes an array of unsigned integers to zero using memset, returns pointer to end of allocated block. |
| 0x006A7A10 | 37 | _Uninitialized_value_construct_n<struct_std::_Parallelism_allocator<unsigned_int>_> | Initializes a range of unsigned integers to zero and returns pointer to end of allocated range. |
| 0x006A7A40 | 28 | _Zero_range<> | STL template utility that zeroes a memory range by calling memset with calculated byte count between two pointers. |
| 0x006A7A60 | 28 | _Zero_range<> | STL template function that zeroes a memory range by calling memset between two pointers |
| 0x006A8940 | 10 | STL_Xlength_error_variant_a | Throws std::length_error exception when a deque container exceeds maximum allowable length during RO client operation. |
| 0x006A8950 | 10 | STL_Xlength_error_variant_b | Throws std::length_error exception when deque container exceeds maximum allowed size limit |
| 0x006A8F40 | 48 | STL_deque_back_4byte | Returns the last element from an STL deque container with 4-byte elements using chunked block indexing. |
| 0x006AA020 | 39 | STL_string_resize_truncate | Truncates STL string to specified length if within current capacity, null-terminates, throws exception if new size exceeds capacity. |
| 0x006AE9D0 | 83 | operator++ | STL tree iterator pre-increment operator; advances to next node in red-black tree traversal for unsigned int set |
| 0x006AEFE0 | 704 | STL_rbtree_erase_rebalance_variant | Red-black tree node erasure with rebalancing; handles color restoration after deleting a node from the tree. |
| 0x006AF2B0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree balance properties and updates parent/child pointers. |
| 0x006AF520 | 144 | STL_vector_string_assign | Assigns a new vector of strings by allocating storage, moving elements, and replacing the old storage with new capacity. |
| 0x006AF640 | 10 | STL_Xlength_error_variant_c | Throws std::length_error exception when vector allocation exceeds maximum allowed size limit |
| 0x006AF650 | 10 | STL_Xlength_error_variant_d | Throws std::length_error exception when vector size exceeds maximum allowed length |
| 0x006B04CF | 107 | STL_tree_iterator__advance_and_copy_string | Advances STL tree iterator and copies the string data from current node (+0x10 offset) into output. Returns result vector with 3 fields when at end sentinel. |
| 0x006B0570 | 5 | operator++ | STL red-black tree iterator increment (operator++). Moves to the next in-order node. |
| 0x006B1B10 | 22 | ostream__set_fill_char | Sets fill character in output stream object at offset 0x40 within stream state structure |
| 0x006B1B30 | 432 | ostream__put_char_with_pad | Outputs a character to std::basic_ostream with field width padding, managing width state and error handling. |
| 0x006B1D20 | 161 | STL_string_ctor_fill | STL std::string constructor that fills a string with repeated character, managing inline vs heap allocation based on size. |
| 0x006B2400 | 26 | ostream__set_hex_format | Sets hexadecimal output formatting flag in stream's format state word at offset 0x14. |
| 0x006B2EE0 | 12 | ostream__set_failbit | Sets the failbit flag (0x4) in the std::basic_ostream state field at offset 0x14 |
| 0x006C2010 | 426 | STL_vector_dword__insert_grow | STL vector insertion with growth: reallocates capacity, copies existing elements, inserts new element, deallocates old buffer |
| 0x006C3260 | 10 | STL_Xlength_error_vector_dword_b | Throws std::length_error exception when a vector allocation request exceeds maximum size limits |
| 0x006C3270 | 56 | STL_free_array_checked | Deallocates STL container memory with bounds validation; checks allocation header and validates buffer size before deletion. |
| 0x006C4270 | 223 | STL_map_insert_skill_effect_node | Inserts a skill effect node into a red-black tree map, allocating 24-byte node with skill ID and initializing tree pointers. |
| 0x006C4BE0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties after adding new node |
| 0x006C5DA0 | 426 | STL_vector_dword__insert_grow_b | STL vector insert operation that grows capacity, reallocates memory, and shifts elements to insert new value at specified position. |
| 0x006C5F70 | 424 | STL_vector_12byte__resize_grow | Reallocates and grows a 12-byte element vector, copying existing data and filling new elements with initialization value. |
| 0x006C78A0 | 48 | STL_vector_12byte__fill_zero | STL template instantiation: STL vector 12byte fill zero |
| 0x006C78D0 | 47 | STL_vector_12byte__copy_range | Copies a range of 12-byte elements from source to destination buffer using pointer arithmetic and manual byte copying. |
| 0x006C7900 | 10 | STL_Xlength_error_vector_12byte_c | Throws std::length_error exception when vector allocation exceeds maximum allowed size |
| 0x006C7910 | 54 | STL_delete_checked_array_b | Deallocates STL array with size validation; checks allocation metadata and validates buffer bounds before deletion. |
| 0x006C8330 | 88 | STL_vector_0x18_push_back | Pushes 24-byte element into STL vector; grows capacity if needed via STL_vector_0x18_grow_and_insert |
| 0x006C8BB0 | 449 | STL_vector_particle_ptr_grow_and_insert | STL vector grow-and-insert for particle pointers; reallocates and inserts new particle element into effect particle list. |
| 0x006C8E00 | 106 | STL_vector_free_buffer | Frees STL vector heap buffer with alignment validation and heap header integrity checks before deallocation. |
| 0x006C93E0 | 10 | STL_Xlength_error_particle_ptr | Throws std::length_error exception when a vector exceeds maximum allowable size limit. |
| 0x006C93F0 | 55 | deallocate | STL allocator deallocate wrapper for unsigned int arrays; handles large allocations (>4KB) with safety validation before calling operator delete. |
| 0x006CB140 | 165 | STL_intrusive_list_node_insert | Inserts a new node into an intrusive doubly-linked list with capacity check; throws if list exceeds size limit. |
| 0x006CB220 | 449 | STL_vector_textured_effect_grow_and_insert | STL vector grow-and-insert for textured_effect elements; allocates new buffer, copies existing data, inserts new element, deallocates old buffer |
| 0x006CBAC0 | 10 | STL_Xlength_error_textured_effect | Throws std::length_error exception when vector exceeds maximum allowed size limit |
| 0x006CBAD0 | 55 | CRT_free_aligned_buffer | Frees aligned memory buffer with overflow validation; checks alignment padding before deallocation. |
| 0x006CDD10 | 83 | operator++ | STL red-black tree iterator pre-increment operator; advances to next in-order node |
| 0x006CE4C0 | 517 | Insert_node | STL std::_Tree_val template method that inserts a new node into a balanced tree structure and rebalances if needed. |
| 0x006D3CF0 | 10 | STL_ThrowLengthError | Throws std::length_error exception for vector overflow; particle batch size exceeds maximum capacity limit. |
| 0x006D3D00 | 55 | deallocate | STL allocator deallocate wrapper that validates alignment and delegates to operator delete for memory deallocation |
| 0x006E1200 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree invariants after insertion. |
| 0x006E1410 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree invariants and color properties. |
| 0x006E3D10 | 73 | _Allocate<8,struct_std::_Default_allocate_traits,0> | STL memory allocator with 32-byte alignment for objects โค4096 bytes, throws on allocation failure or overflow. |
| 0x006E4010 | 5 | CActObjectExt__InfiniteRecursion | Infinite recursion stub - calls itself without termination condition, likely placeholder or corrupted function |
| 0x006F1680 | 94 | STL_map_delete_effect_nodes_recursive | Recursively deletes effect node tree by traversing left children and freeing each node (18 bytes). |
| 0x006F16F0 | 75 | STL_map_find_effect_node | Binary search tree node traversal for effect map lookup; returns iterator with comparison result and parent node |
| 0x006F1820 | 80 | STL_map_clear_effect_tree | Clears an STL map of effect tree nodes by recursively deleting all nodes and deallocating the map structure. |
| 0x006F1990 | 223 | STL_map_insert_effect_node | Inserts effect node into STL map container after finding position; allocates 24-byte node with effect ID and initializes tree pointers. |
| 0x006F1A70 | 83 | operator++ | STL red-black tree iterator increment operator; advances to next in-order node by traversing right subtree or parent chain. |
| 0x006F1F40 | 704 | STL_rbtree_erase_rebalance_effect_A | Red-black tree node erasure with rebalancing for unsigned int set; handles node replacement and tree structure maintenance. |
| 0x006F2200 | 517 | Insert_node | STL Red-Black tree node insertion with rebalancing; handles tree structure maintenance and color property restoration after insert. |
| 0x006F2410 | 84 | STL_rbtree_rotate_left_effect | Red-black tree left rotation for effect/status data structure with parent pointer updates and root rebalancing. |
| 0x006F2470 | 88 | STL_rbtree_rotate_right_effect | Red-black tree right rotation with parent/child pointer updates for effect data structure rebalancing |
| 0x006F24D0 | 106 | STL_map_erase_effect_node | Erases an effect node from STL map; recursively deletes children if node is leaf, then clears map structure |
| 0x006F69B0 | 10 | STL_Xout_of_range_effect | Throws std::out_of_range exception for invalid array subscript access in STL array<T,N> container |
| 0x006F9530 | 449 | STL_vector_dword__insert_realloc | Reallocates and reorganizes STL vector<DWORD> storage when inserting element at arbitrary position, handling alignment and old buffer deallocation. |
| 0x006F9D80 | 10 | STL_Xlength_error_vector_dword_c | Throws std::length_error exception when vector size exceeds maximum allowed capacity limit |
| 0x006F9D90 | 55 | deallocate | STL allocator deallocate wrapper; frees memory with size validation, calls operator delete with adjusted pointer/size for large allocations (>4KB). |
| 0x006FC180 | 97 | STL_map_delete_nodes_recursive | Recursively deletes all nodes in a binary search tree (red-black tree) map structure via post-order traversal. |
| 0x006FC1F0 | 75 | STL_map_init_node | Initializes a node in an STL map by finding the correct insertion position through binary tree traversal based on key comparison. |
| 0x006FC530 | 242 | STL_map_insert_node_with_memset | Inserts a node into an STL map container with zero-initialization of a 2KB data buffer within the allocated node. |
| 0x006FCA60 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure and color properties after insert |
| 0x006FCC70 | 94 | STL_map_delete_nodes_recursive_B | Recursively deletes tree nodes in STL map by traversing left subtree, then deallocating current node with stack canary validation. |
| 0x006FD660 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure and color properties |
| 0x006FD870 | 94 | STL_map_delete_nodes_recursive_C | Recursively deletes nodes in an STL map by traversing left subtree and deallocating each node (18 bytes). |
| 0x006FD8E0 | 75 | _Find_lower_bound<> | STL red-black tree lower_bound search: finds first node with value >= target in ordered set |
| 0x006FDC00 | 83 | operator++ | STL red-black tree iterator pre-increment operator; advances to next node in sorted unsigned int set |
| 0x006FDDF0 | 267 | STL_map_insert_or_find_node | Thread-safe STL map insertion that finds or creates a node for a given key, returning 1 if new node inserted, 0 if key already exists. |
| 0x006FE040 | 704 | std__Tree__erase_and_rebalance | Red-black tree node erasure with color rebalancing; handles single/double child cases and tree restructuring. |
| 0x006FE300 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree invariants and color properties. |
| 0x006FE510 | 84 | STL_rbtree_rotate_left_network | Red-black tree left rotation; rebalances tree by rotating node left and updating parent pointers. |
| 0x006FE570 | 88 | STL_rbtree_rotate_right_network | Red-black tree right rotation; rebalances tree by rotating node param_2 up and param_1 down, updating parent pointers. |
| 0x006FE5D0 | 34 | STL_copy_forward_memmove_u | Copies memory from source to destination and returns pointer to end of copied data in destination buffer. |
| 0x006FE600 | 37 | _Uninitialized_value_construct_n<struct_std::_Parallelism_allocator<unsigned_int>_> | Initializes a range of unsigned integers to zero and returns pointer to end of allocated region. |
| 0x006FE630 | 28 | _Zero_range<> | STL template utility that zero-initializes a memory range by calculating size from two pointers and calling memset. |
| 0x006FE650 | 34 | STL_copy_forward_memmove_v | Copies memory region forward using memmove, returns pointer to end of destination buffer. |
| 0x006FEA80 | 397 | STL_vector__grow_and_insert | Reallocates and reorganizes a vector's internal buffer when growing capacity, with circular buffer support for element insertion. |
| 0x006FECE0 | 10 | STL_Xlength_error_006fea80 | Throws std::length_error exception when deque container exceeds maximum allowed size limit. |
| 0x006FED50 | 275 | STL_unordered_map_find<char> | Searches hash table for string key using FNV-1a hash; returns iterator to matching node or end |
| 0x006FEF40 | 87 | STL_hash_map_clear_bucket | Clears a hash map bucket by deleting the node and destroying its associated entry with stack canary protection. |
| 0x006FEFA0 | 86 | STL_hash_map_delete_node | Deallocates memory for STL hash_map node, validating allocation metadata before calling operator delete |
| 0x006FF030 | 87 | STL_hash_map_clear_bucket_B | Clears a hash map bucket by deleting its node and destroying the associated entry with stack canary protection. |
| 0x006FF090 | 101 | STL_hash_map_destroy_entry | Destroys hash map entry by freeing key string and entry node, with XOR stack canary protection |
| 0x006FF120 | 106 | STL_hash_map_clear_all_buckets | Clears all buckets in an STL hash_map by deleting nodes and destroying entries with stack canary protection. |
| 0x006FF190 | 128 | STL_hash_map_clear_and_free | Destructor that clears/destroys STL hash_map nodes and entries, optionally deallocates container memory if param_2 flag set. |
| 0x006FF320 | 317 | STL_vector_resize_and_fill | Resizes a vector to new capacity and fills all elements with a specified value, handling aligned allocation for large buffers. |
| 0x00700410 | 34 | memmove_range_copy | Copies memory from range [start, end) to destination buffer, returns pointer to end of copied data. |
| 0x00700440 | 462 | std__vector_12__reallocate | Reallocates std::vector storage for 12-byte elements, handling growth with alignment and old buffer deallocation. |
| 0x00700740 | 127 | STL_vector_12byte__deallocate | Deallocates std::vector with 12-byte elements, handling aligned memory cleanup via operator delete. |
| 0x007010C0 | 49 | memset_12byte_elements | Zeros out memory for array of 12-byte elements and returns pointer to end of zeroed region. |
| 0x00701100 | 10 | STL_Xlength_error_vector_too_long_2 | STL exception handler that throws std::length_error for vector capacity overflow |
| 0x00701110 | 54 | deallocate | STL allocator deallocate for GSISymbolEntry; validates heap block size and calls operator delete with adjusted pointer/size. |
| 0x007019C0 | 600 | STL_vector_28byte__insert | Inserts a 28-byte element (party member struct with strings) into STL vector with 1.5x capacity growth and old buffer deallocation. |
| 0x00708190 | 10 | STL_Xlength_error_vector_too_long_3 | Throws std::length_error exception with "vector too long" message for vector capacity violations |
| 0x007081A0 | 60 | STL_deallocate_28byte_array | Deallocates memory for array of 28-byte elements with overflow protection; validates allocation metadata before calling operator delete. |
| 0x00708230 | 169 | STL_vector_28byte__push_back | Pushes 28-byte element (likely containing std::string) into vector; uses move semantics for string member, falls back to insert if capacity exhausted. |
| 0x0070A900 | 228 | STL_vector_int__resize_grow | Grows STL vector<int> capacity by allocating new memory, copying existing elements, and zeroing new space. |
| 0x0070AA10 | 28 | _Zero_range<> | STL template utility that zero-initializes a memory range from pointer to end address using memset. |
| 0x0070D5D0 | 34 | STL_memmove_elements | Moves memory block and returns pointer to end of destination; calculates size as (end - start) offset. |
| 0x0070D600 | 34 | STL_copy_range_elements | Moves memory range from param_1 to param_2 into param_3, returning new end pointer after copy. |
| 0x0070D630 | 34 | STL_copy_range_forward | Copies memory range from param_1 to param_3, returns end pointer of destination buffer after copy. |
| 0x0070D660 | 105 | STL_destruct_68byte_range | Destructs a range of 68-byte STL vector entries by iterating and calling delete handlers with exception frame setup. |
| 0x0070D6D0 | 25 | STL_memset_zero_int_array | Zeroes an integer array by clearing param_2 * 4 bytes (param_2 integers) starting at param_1. |
| 0x0070D6F0 | 28 | STL_is_null_check | Checks if pointer is null and extracts upper 24 bits; returns combined result as 32-bit value. |
| 0x0070D710 | 377 | STL_vector_int__resize_fill | Resizes STL vector<int> to param_2 size, filling new elements with param_3 value, managing heap allocation |
| 0x0070D8B0 | 525 | STL_vector_12byte__reallocate | Reallocates STL vector storage for 12-byte elements, handling growth with alignment and destructor calls. |
| 0x0070DAD0 | 462 | STL_vector_12byte__reallocate_v2 | Reallocates STL vector of 12-byte elements with growth strategy, handles alignment for large allocations. |
| 0x0070DCB0 | 517 | STL_vector_68byte__reallocate | Reallocates STL vector of 68-byte elements, growing capacity and copying/initializing data with exception safety. |
| 0x0070DEC0 | 465 | STL_vector_36byte__reallocate | Reallocates STL vector of 36-byte elements with capacity growth, handling alignment for large allocations |
| 0x0070E0A0 | 527 | STL_vector_24byte__reallocate | Reallocates STL vector of 24-byte elements with capacity growth, initializing new elements and moving existing data. |
| 0x0070E6E0 | 106 | STL_vector_delete_68byte_entry | Deallocates a 68-byte STL vector entry with overflow detection and sized memory deallocation via operator delete. |
| 0x0070E840 | 127 | STL_vector_delete_68byte_entry_B | Deallocates STL vector of 68-byte entries with XOR cookie validation and overflow protection before calling operator delete. |
| 0x0070E8E0 | 147 | STL_vector_clear_68byte_elements | Clears and deallocates a vector of 68-byte elements, destructing all items before freeing memory. |
| 0x0070E990 | 128 | STL_vector_delete_68byte_entry_C | Deallocates STL vector of 68-byte elements with proper size calculation and bounds validation before calling operator delete. |
| 0x0070F180 | 143 | STL_vector_68byte_resize | Resizes STL vector of 68-byte elements, shrinking by destructing or growing via reallocation/initialization. |
| 0x0070F210 | 175 | STL_vector_36byte_resize | Resizes STL vector of 36-byte elements, managing capacity and zero-initializing new elements with reallocation threshold of 1000. |
| 0x0070F890 | 92 | STL_vector_68byte_clear_range | Iterates through 68-byte vector elements (stride 0xc) and clears each element via destructor calls. |
| 0x0070F8F0 | 22 | STL_vector_68byte__destruct_range_wrapper | Wrapper that destructs a range of 68-byte objects in an STL vector by delegating to the range destructor. |
| 0x0070F910 | 93 | STL_vector_24byte_dealloc_old | Deallocates a vector of 24-byte elements by iterating through and freeing each element's internal vector. |
| 0x0070F9B0 | 3 | STL_vector_12byte_identity_getter | Returns the input parameter unchanged; likely a trivial getter or thunk for 12-byte vector object pass-through. |
| 0x0070F9C0 | 3 | STL_vector_move_return | Identity function returning fastcall parameter; likely compiler-generated move/return optimization for 12-byte STL vector |
| 0x0070F9D0 | 3 | STL_vector_68byte_identity | Identity function returning input parameter unchanged; likely compiler-generated inline or template instantiation wrapper. |
| 0x0070F9E0 | 3 | STL_vector_36byte_copy_constructor_return_this | STL vector copy constructor or assignment operator that returns *this for method chaining on 36-byte objects |
| 0x0070F9F0 | 3 | STL_vector_24byte_move_constructor_or_assignment | STL vector move constructor/assignment operator that returns reference to this object after initialization or copy from param_1 |
| 0x0070FA00 | 138 | STL_fill_int_array | Fills array of integers with value from param_3, or zeros if param_3 is null; optimized loop unrolling for 4-element chunks |
| 0x0070FA90 | 143 | STL_zero_init_12byte_elements | Initializes array of 12-byte structures to zero; clears param_2 consecutive elements by writing 12 bytes per iteration. |
| 0x0070FB20 | 49 | STL_memset_12byte_elements | Zeroes memory for array of 12-byte elements and returns pointer to end of cleared region. |
| 0x0070FB60 | 188 | STL_zero_init_68byte_elements | Initializes array of 68-byte structures to zero; zeroes 0x44 bytes per element, clears specific offset fields, advances pointer by element size. |
| 0x0070FC20 | 49 | STL_memset_36byte_elements | Zeroes memory for param_2 elements of 0x24 (36) bytes each, returns pointer past zeroed region |
| 0x0070FC60 | 150 | STL_init_24byte_elements_default | Initializes array of 24-byte elements (6 dwords each) to default values: -1,-1,4,0,0,0 pattern repeated |
| 0x0070FD00 | 161 | STL_move_12byte_elements | Moves 12-byte elements (3x uint32) from source to destination buffer, zeroing source and advancing pointers. |
| 0x0070FDB0 | 145 | STL_copy_construct_68byte_range | Copy-constructs 68-byte elements from param_2 to param_4 range, then destructs source range using SEH exception handling. |
| 0x0070FE50 | 179 | STL_move_24byte_elements | Moves 24-byte elements from source to destination while zeroing source, advancing by 6 DWORD increments per iteration. |
| 0x0070FF10 | 159 | STL_move_24byte_string_elements | Moves 24-byte string elements from source to destination range, clearing source after move (STL vector/deque relocation). |
| 0x0070FFB0 | 10 | STL_Xlength_error_vector_int_b | Throws std::length_error exception when vector allocation exceeds maximum allowed size limit. |
| 0x0070FFC0 | 10 | STL_Xlength_error_vector_12byte_d | Throws std::length_error exception for vector operations exceeding maximum allowed size |
| 0x0070FFD0 | 10 | STL_Xlength_error_vector_12byte_e | Throws std::length_error exception when a vector exceeds maximum allowed size limit. |
| 0x0070FFE0 | 10 | STL_Xlength_error_vector_68byte | Throws std::length_error exception when vector size exceeds maximum allowed length limit |
| 0x0070FFF0 | 10 | STL_Xlength_error_vector_36byte | Throws std::length_error exception when vector size exceeds maximum allowed capacity limit |
| 0x00710000 | 10 | STL_Xlength_error_vector_24byte | Throws std::length_error exception when vector size exceeds maximum allowed length |
| 0x00710010 | 55 | STL_vector_dealloc_invalid_param_A | Deallocates STL vector memory with bounds checking; validates allocation size and pointer alignment before deletion. |
| 0x00710050 | 54 | STL_vector_dealloc_invalid_param_B | Deallocates STL vector memory with validation; checks allocation metadata and size constraints before operator delete. |
| 0x00710090 | 54 | STL_vector_dealloc_invalid_param_C | Validates and deallocates STL vector memory with bounds checking; calls invalid_parameter if allocation metadata is corrupted. |
| 0x007100D0 | 57 | STL_vector_dealloc_invalid_param_D | Validates and deallocates STL vector memory with size check; calls invalid_parameter if allocation metadata is corrupted. |
| 0x00710120 | 54 | STL_vector_dealloc_invalid_param_E | Validates and deallocates STL vector memory with bounds checking; raises exception if allocation metadata is invalid. |
| 0x00710160 | 54 | STL_vector_dealloc_invalid_param_F | Deallocates STL vector memory with heap guard validation; checks allocation metadata before calling operator delete. |
| 0x007101A0 | 348 | CRT_stringbuf_overflow | std::basic_streambuf overflow handler that reallocates internal buffer when full, copying existing data and appending new character. |
| 0x00710300 | 94 | CRT_stringbuf_pbackfail | Implements stringbuf putback failure handler; moves read position back and validates/stores character in buffer. |
| 0x00710360 | 103 | STL_vector_int_resize | Resizes an std::vector<int> by adjusting size; grows capacity if needed, zero-initializes new elements. |
| 0x007103D0 | 167 | STL_vector_24byte_resize | Resizes STL vector of 24-byte elements (likely std::string triplets), destructing excess elements or initializing new ones. |
| 0x00710480 | 420 | CRT_stringbuf_seekoff | Seeks to position in string buffer; validates bounds and updates read/write pointers based on seek mode (begin/current/end). |
| 0x00710630 | 204 | CRT_stringbuf_pubseekpos | Seeks to absolute position in stringbuf with bounds validation; updates get/put pointers and returns result in output array. |
| 0x00710700 | 70 | stringbuf_underflow | Refills string buffer by updating read position and returning next character from input buffer, with bounds validation. |
| 0x00710750 | 200 | CRT_create_stringstream | Allocates and initializes a CRT_stringstream object with vtable, clearing internal buffers and state fields. |
| 0x00710BA0 | 109 | CRmaFile__destructor | Destructor for CRmaFile object that frees internal vector and optionally deallocates the object itself. |
| 0x00710C10 | 392 | STL_vector_20byte_reallocate | Reallocates STL vector of 20-byte elements with capacity growth, handling alignment and exception safety. |
| 0x00710DB0 | 148 | CRmaFile__ctor_inplace | Constructs CRmaFile object in-place, initializing vftable, resource handle, and buffer state fields. |
| 0x00710E60 | 128 | STL_vector_20byte_free | Deallocates STL vector of 20-byte elements; validates heap metadata and calls operator delete with size information. |
| 0x00711830 | 3 | STL_vector_20byte_return_this | Trivial pass-through function returning first parameter; likely inlined compiler-generated STL vector method or constructor chain. |
| 0x00711840 | 45 | STL_relocate_20byte_elements | Relocates array of 20-byte elements (5ร4-byte dwords) from source to destination buffer by copying in a loop. |
| 0x00711870 | 10 | STL_Xlength_error_vector_20byte | STL vector length error handler that throws exception when vector size exceeds maximum allowable length |
| 0x00711880 | 54 | deallocate | STL allocator deallocate for GSISymbolEntry; frees memory with size validation and optional indirection check. |
| 0x007118C0 | 166 | CStringStream__Constructor | Allocates and constructs a stringstream object (0x124 bytes) with resource handle initialization for RO client. |
| 0x00712190 | 431 | std_string__append_range | Appends characters from iterator range to std::string with 1.5x capacity growth; handles SSO (small string optimization) with 16-byte inline buffer. |
| 0x00712350 | 436 | std_vector_8byte__insert_reallocate | Inserts 8-byte element into STL vector with 1.5x capacity growth, reallocating and copying existing elements before/after insertion point. |
| 0x00712660 | 106 | std_vector_8byte__deallocate | Deallocates std::vector<8-byte element> by freeing aligned buffer, handling large allocations with metadata offset. |
| 0x00714CB0 | 44 | copy_8byte_elements_forward | Copy 8byte elements forward |
| 0x00714CE0 | 45 | relocate_8byte_elements | Relocates 8-byte (64-bit) elements from source range to destination with calculated offset; used in vector/container reallocation. |
| 0x00714D10 | 10 | STL_Xlength_error_vector_too_long | Throws std::length_error exception with "vector too long" message when vector capacity exceeds limit |
| 0x00714D20 | 55 | deallocate | STL allocator deallocate for phmap hash containers; validates alignment and delegates to operator delete |
| 0x00714E20 | 113 | std_string__assign_from_cstr | Computes strlen of C-string and assigns it to std::string via range assignment helper. |
| 0x007150E0 | 109 | CResource__ScalarDeletingDestructor_250 | Destructor for CResource class that destroys entries and optionally deallocates the object if scalar deleting flag is set. |
| 0x00715730 | 28 | STL_is_empty_check_c | Checks if STL container is empty by testing if pointer/handle equals zero, returns boolean result. |
| 0x00715750 | 28 | STL_is_empty_check_d | Checks if STL container is empty by testing if pointer param is null, returns boolean result in lowest byte. |
| 0x007160D0 | 276 | STL_vector_int_insert | Inserts an element into an STL vector<int>, reallocating and shifting elements as needed with capacity growth strategy. |
| 0x00716210 | 329 | STL_vector_36byte__insert_and_grow | Inserts a 36-byte element into STL vector, reallocating and copying existing elements if capacity exceeded. |
| 0x00716380 | 385 | STL_vector_int__reallocate_v3 | Reallocates STL vector<int> storage with alignment optimization for allocations >=4KB, preserving existing elements. |
| 0x00716530 | 28 | _Zero_range<> | STL template utility that zeroes a memory range from pointer to endpoint, used for container initialization |
| 0x00716680 | 128 | STL_vector_36byte_free | Deallocates STL vector of 36-byte elements with heap validation and sized deallocation. |
| 0x00717000 | 87 | STL_vector__Change_array_00717000 | STL vector internal method that reallocates and changes the underlying buffer for dynamic array storage. |
| 0x00717060 | 115 | STL_vector__Change_array_00717060 | Reallocates std::vector storage for FileSymbolInfo elements; handles old buffer deallocation and new buffer initialization with 0x24-byte element size. |
| 0x007171E0 | 142 | STL_vector__Reallocate_exactly_007171e0 | Reallocates vector storage by validating new capacity, moving elements, and updating array size for GSI symbol entries. |
| 0x007172A0 | 52 | STL_vector_36byte_copy_element | STL template instantiation: STL vector 36byte copy element |
| 0x007172E0 | 54 | STL_vector_36byte_move_element | Moves 36-byte elements from source to destination vector, copying 9 undefined4 values per element until source pointer reaches end. |
| 0x00717320 | 10 | STL_ThrowVectorLengthError | Throws std::length_error exception with "vector too long" message for STL vector overflow |
| 0x00717330 | 92 | STL_vector_alloc_and_validate | Allocates aligned memory for STL vector with 32-byte alignment, validates size limits, throws on overflow or excessive allocation requests. |
| 0x00717390 | 95 | STL_vector_36byte_alloc_validate | Allocates aligned memory for STL vector of 36-byte elements with overflow/size validation and 32-byte alignment. |
| 0x007173F0 | 54 | STL_vector_dealloc_invalid_param_G | Deallocates STL vector memory with bounds validation; verifies allocation size doesn't exceed 4KB and frees via operator delete. |
| 0x00717CC0 | 116 | STL_vector_36byte_dealloc_old | Deallocates vector of 36-byte elements by iterating through range [param_1, param_2) and freeing each element's sub-allocations. |
| 0x00717D40 | 431 | STL_vector_36byte__emplace_grow | Grows STL vector of 36-byte elements by reallocating memory, copying existing data, and inserting new element at specified position. |
| 0x00717F20 | 548 | STL_vector_12byte__emplace_grow | Grows STL vector of 12-byte elements (CAnimKeyframeVec), reallocates memory with 1.5x expansion, copies existing data and inserts new element. |
| 0x00718150 | 137 | STL_vector_36byte_grow_and_copy | Grows STL vector of 36-byte elements by copying items from source to destination buffer, then deallocates old memory. |
| 0x007181E0 | 162 | STL_vector_12byte_grow_and_copy | Copies 12-byte structures (3x uint32) from source vector to destination, zeroing source elements during iteration. |
| 0x00718290 | 113 | STL_vector_36byte_copy_int_subvec | Copies three consecutive STL int vectors (each 12 bytes) from a 36-byte structure with SEH setup. |
| 0x007184F0 | 198 | STL_vector_36byte_relocate_range | Relocates 36-byte STL vector data by moving three 12-byte chunks from source to destination and clearing source. |
| 0x00718AE0 | 22 | STL_vector_36byte__dealloc_old_wrapper | Wrapper that reorders parameters and delegates to STL vector 36-byte element deallocation function. |
| 0x00718B00 | 36 | STL_vector_12byte__destruct_range | STL template instantiation: STL vector 12byte destruct range |
| 0x00718B30 | 143 | STL_vector_12byte_clear_and_dealloc | Clears and deallocates a 12-byte STL vector, freeing allocated memory and resetting the vector state. |
| 0x00718BE0 | 10 | STL_Xlength_error_vector_36byte_c | Throws std::length_error exception with "vector too long" message for vector capacity violations |
| 0x00718BF0 | 10 | STL_Xlength_error_vector_12byte_f | Throws std::length_error exception when vector allocation exceeds maximum allowed size limit |
| 0x00718C00 | 95 | STL_vector_allocate_aligned_36byte | Allocates memory for 36-byte vector elements with 32-byte alignment, validating count and handling overflow. |
| 0x00718C60 | 54 | STL_vector_dealloc_invalid_param_H | Deallocates STL vector memory with bounds validation; checks allocation metadata and size constraints before freeing. |
| 0x00718CA0 | 54 | STL_vector_dealloc_invalid_param_I | Validates and deallocates STL vector memory with size checks; calls invalid_parameter if allocation metadata is corrupted. |
| 0x0071BF10 | 241 | STL_rbtree__copy_recursive | Recursively copies red-black tree nodes; allocates new node, copies color/data, and recursively clones left/right subtrees. |
| 0x0071C020 | 149 | STL_rbtree__erase_recursive_with_map | Recursively erases red-black tree nodes and associated map entries, deallocating memory for each node. |
| 0x0071C0D0 | 116 | STL_rbtree__erase_recursive_with_string_impl | Recursively erases red-black tree nodes with string keys; deallocates node memory after recursive traversal. |
| 0x0071C150 | 119 | STL_rbtree__erase_recursive_20byte_node | Recursively deletes red-black tree nodes (20-byte elements); frees left subtree then deallocates current node. |
| 0x0071C1E0 | 1002 | STL_sort__insertion_sort_32byte | Implements insertion sort for 32-byte elements with dynamic memory allocation and element shifting during sort operations. |
| 0x0071C5F0 | 380 | STL_sort__make_heap_32byte | Builds a max-heap from 32-byte elements by repeatedly sifting down heap nodes in reverse order. |
| 0x0071C790 | 262 | STL_sort__median_of_three_32byte | Finds median of three 32-byte elements by comparing ushort values at offset 0xc, swapping to sort order via temporary stack buffer. |
| 0x0071C8A0 | 1082 | STL_sort__partition_32byte | STL introsort partition for 32-byte elements using median-of-three pivot and Dutch flag three-way split |
| 0x0071CCE0 | 495 | STL_sort__sift_down_32byte | Sift-down heap operation for 32-byte elements with embedded vector data; maintains max-heap property during sort. |
| 0x0071CED0 | 319 | STL_sort__introsort_32byte | Introsort implementation for 32-byte element arrays; switches to insertion sort for small ranges, heapsort when depth limit exceeded. |
| 0x0071D010 | 362 | STL_map_int__emplace_or_find | STL map<int,T> lookup/insertion: finds existing int key node or creates+inserts new 0x1C-byte node with nested map structure |
| 0x0071D180 | 415 | STL_map_string__emplace_or_find | STL map<string,T> emplace_or_find: inserts new node if key absent, returns existing/new node pair with bool flag |
| 0x0071D320 | 37 | STL_list__init_sentinel | Initializes a doubly-linked list sentinel node with self-referential pointers for empty list state. |
| 0x0071D350 | 286 | STL_vector_pair__copy_ctor | Copy constructor for STL vector of pairs; allocates memory and copies all pair elements from source to destination vector. |
| 0x0071D6A0 | 16 | STL_pair_init_zero | Initializes a std::pair<uint32, uint32> by zeroing both first and second members (8 bytes total). |
| 0x0071DC10 | 83 | STL_vector_triple__init_zero | Initializes three 32-bit fields (offsets 0x14, 0x18, 0x1c) to zero in an STL vector structure, managing stack frame pointer. |
| 0x0071DC70 | 64 | STL_optional__delete_12byte | Destructor for optional<T> containing 12-byte object; frees heap allocation if present via operator delete |
| 0x0071DCC0 | 64 | STL_optional__delete_12byte_b | Destructor for std::optional<T> where T is 12 bytes; calls operator delete if optional contains a value |
| 0x0071DD10 | 64 | STL_optional__delete_12byte_c | Destructor for std::optional<T> where T is a 12-byte object; deallocates managed pointer if present. |
| 0x0071DD60 | 64 | STL_optional__delete_12byte_d | Destructor for optional<T> wrapper containing 12-byte managed object; deallocates heap memory if optional holds value. |
| 0x0071DDB0 | 64 | STL_optional__delete_12byte_e | Destructor for optional<T> (12-byte type); deallocates managed pointer if present, includes stack cookie validation. |
| 0x0071DE00 | 33 | STL_linked_list__clear_head | Deletes the head node of a linked list and clears the pointer, invoking the node's destructor via virtual method at offset 0x10. |
| 0x0071DE30 | 75 | STL_optional__delete_12byte_f | Destroys an STL optional containing a 12-byte object by calling operator delete on the managed pointer if present. |
| 0x0071DE80 | 75 | STL_optional__delete_12byte_g | Destructor for std::optional containing 12-byte object; deallocates managed pointer if initialized |
| 0x0071DED0 | 75 | STL_optional__delete_12byte_h | Destructor for std::optional<T> with 12-byte payload; deallocates contained object if present via operator delete |
| 0x0071DF30 | 57 | STL_rbtree__destroy_sentinel_map | Destroys a red-black tree sentinel node map by recursively erasing all nodes and deallocating the tree structure. |
| 0x0071DF90 | 57 | STL_rbtree__destroy_sentinel_map_b | Destroys a red-black tree sentinel node by recursively erasing all nodes then deallocating the tree structure. |
| 0x0071DFF0 | 57 | STL_rbtree__destroy_sentinel_map_c | Destroys a red-black tree sentinel node map by recursively erasing entries and freeing allocated memory (0x2c bytes). |
| 0x0071E050 | 146 | STL_rbtree__delete_node_with_map | Recursively deletes STL red-black tree node and its associated map data structure, deallocating 0x20 and 0x1c byte blocks. |
| 0x0071E0F0 | 110 | STL_rbtree__delete_node_with_string | Destroys an RB-tree node by deallocating its string value and node structure (0x2c bytes). |
| 0x0071E170 | 75 | STL_optional__delete_1c_node | Deallocates a 0x1c-byte node structure by calling operator_delete if the pointer at offset +4 is non-null. |
| 0x0071E1C0 | 75 | STL_optional__delete_2c_node | Deletes a node from an STL optional container by freeing allocated memory at offset +4 with size 0x2c bytes. |
| 0x0071E210 | 92 | STL_shared_ptr__release_ref | Decrements shared_ptr reference count and invokes virtual destructor (offset 0x10) if pointer becomes null. |
| 0x0071E270 | 74 | STL_linked_list__destroy_pair_c | Destroys a linked list node pair by deallocating internal pointer and node structure with stack canary protection. |
| 0x0071E2E0 | 74 | STL_linked_list__destroy_pair_c_b | Destroys a linked list node pair by deallocating internal pointer and node structure with XOR-based stack canary protection. |
| 0x0071E350 | 74 | STL_linked_list__destroy_pair_c_c | Destroys a linked list node pair by deallocating inner node and outer container with XOR stack canary validation. |
| 0x0071E550 | 65 | STL_string__dtor_wrapper | Wrapper function that destructs an STL string object with stack canary protection for exception handling. |
| 0x0071E5A0 | 128 | STL_vector_14byte__dealloc | Deallocates a vector of 14-byte elements by freeing the underlying memory buffer with size tracking and guard validation. |
| 0x0071E640 | 128 | STL_vector_14byte__dealloc_b | Deallocates STL vector of 14-byte elements, validating heap metadata before calling operator delete. |
| 0x0071E6E0 | 106 | STL_vector_10byte__dealloc | Deallocates 10-byte STL vector by freeing heap memory with overflow check and exception handling. |
| 0x0071E770 | 128 | STL_vector_14byte__dealloc_c | Deallocates a 14-byte STL vector by freeing its allocated memory buffer with size validation. |
| 0x0071EEF0 | 65 | STL_vector_10byte__dealloc_wrapper | Exception handler wrapper for STL vector deallocation with stack cookie validation and SEH frame setup. |
| 0x0071EF40 | 65 | STL_vector_14byte__dealloc_b_wrapper | Exception handler wrapper that safely deallocates a 14-byte STL vector with stack unwinding protection. |
| 0x0071EF90 | 65 | STL_vector_14byte__dealloc_c_wrapper | Exception-safe wrapper for 14-byte STL vector deallocation with stack canary protection and SEH frame setup |
| 0x0071EFE0 | 65 | STL_vector_14byte__dealloc_wrapper | Wrapper function that deallocates a 14-byte STL vector with structured exception handling and stack canary validation. |
| 0x0071F030 | 65 | STL_vector_14byte__dealloc_b_wrapper2 | Wrapper function that deallocates a 14-byte STL vector with stack cookie verification and exception handling setup. |
| 0x0071F080 | 80 | STL_rbtree__destroy_sentinel_20byte | Destroys a red-black tree sentinel node by recursively erasing all nodes then deallocating 32 bytes of memory. |
| 0x0071F160 | 158 | STL_sort__swap_32byte_elements | Swaps two 32-byte STL vector elements by copying data and reallocating destination buffer if needed. |
| 0x007253F0 | 517 | Insert_node | Red-Black tree node insertion with rebalancing; maintains tree properties and color balance after insertion. |
| 0x00725600 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; handles parent/child pointers and color maintenance. |
| 0x00725810 | 106 | STL_rbtree_delete_20byte_node | Deallocates a 20-byte STL red-black tree node, handling heap management with XOR stack canary validation. |
| 0x007258A0 | 95 | STL_vector_alloc_aligned_rsm_A | Allocates aligned memory for RSM vector elements with 12-byte stride, enforcing 32-byte alignment for large blocks. |
| 0x00725900 | 95 | STL_vector_alloc_aligned_rsm | Allocates memory for RSM vector with 12-byte elements, aligning blocks โฅ4KB to 32-byte boundaries |
| 0x00725960 | 95 | STL_vector_allocate_aligned_RSM | Allocates aligned memory for RSM vector elements (12 bytes each), with 32-byte alignment for sizes >=4096. |
| 0x007259C0 | 102 | STL_vector_alloc_aligned_32byte | Allocates aligned memory for vector elements (28-byte stride), with 32-byte alignment for sizes โฅ4KB, throws on overflow. |
| 0x00725A30 | 116 | STL_vector_string_destroy_and_free | Destroys and deallocates a std::vector<std::string>, freeing all string elements and resetting vector state to empty. |
| 0x00728FC0 | 264 | STL_vector_byte_insert_and_grow | Inserts a byte into an STL vector at a given position, reallocating and growing capacity if needed. |
| 0x007290F0 | 449 | STL_vector_int_insert_and_grow | Inserts element into std::vector<int>, reallocating and copying data with 1.5x growth strategy when capacity exceeded. |
| 0x007292C0 | 23 | STL_vector_init_empty_007292c0 | Initializes an STL vector to empty state by zeroing three pointer fields (data, size, capacity). |
| 0x00729710 | 10 | STL_Xlength_error_vector_int_c | Throws std::length_error exception when vector allocation exceeds maximum allowable size |
| 0x00729720 | 55 | STL_vector_dealloc_invalid_param_J | Deallocates STL vector memory with size validation; checks allocated block size against capacity before calling operator delete. |
| 0x0072BA20 | 165 | STL_list_push_back | Inserts a new node containing param_2 data at the end of a doubly-linked list, with capacity overflow check (0x15555555 sentinel). |
| 0x0072BB60 | 420 | STL_vector_8byte_insert_and_grow | Inserts an 8-byte pair into STL vector, reallocates with growth strategy, copies existing elements, handles alignment for large allocations. |
| 0x0072BD30 | 565 | STL_vector_20byte_insert_and_grow | STL vector<20-byte element> insertion with automatic growth; allocates new buffer, constructs element, moves existing elements, deallocates old buffer. |
| 0x0072BF70 | 449 | STL_vector_ptr_insert_and_grow | STL vector<void*> insertion at position with automatic capacity growth and memory reallocation. |
| 0x0072C310 | 94 | STL_map_delete_nodes_recursive_D3D | Recursively deletes tree nodes in STL map structure by traversing left subtree and deallocating node memory. |
| 0x0072C380 | 119 | STL_map_delete_rune_nodes_recursive | Recursively deletes nodes in a map/tree structure containing rune data, deallocating memory for each node traversal. |
| 0x0072C410 | 119 | STL_map_delete_rune_nodes_recursive2 | Recursively deletes rune node tree structure, destroying string vectors and freeing allocated memory nodes. |
| 0x0072C4C0 | 75 | STL_map_lower_bound_int_key | STL map lower_bound operation for integer keys; finds first element >= search key in RB-tree |
| 0x0072C510 | 75 | STL_map_lower_bound_int_key2 | Performs binary search tree lower_bound operation on std::map with integer keys, returning iterator to first element >= search key |
| 0x0072C560 | 75 | STL_map_lower_bound_int_key3 | Binary search tree lower_bound for integer keys; finds first node with key >= search value |
| 0x0072C5B0 | 389 | STL_sort_median_of_nine | Partitions array into 9 segments and sorts them for quicksort pivot selection via median-of-nine algorithm |
| 0x0072C740 | 402 | STL_sort_partition | Quicksort partition function that uses median-of-three pivot selection and two-way partitioning for sorting integer pointers by dereferenced offset values. |
| 0x0072C8E0 | 174 | STL_sort_sift_down | Performs sift-down heap operation to restore heap property after element removal or replacement in binary heap. |
| 0x0072C990 | 222 | STL_vector_int_resize_2 | Resizes an int vector by reallocating memory, copying existing elements, and filling new elements with a specified value. |
| 0x0072CAA0 | 555 | STL_introsort_by_priority | Introsort (quicksort+heapsort+insertion) sorting sprite/entity pointers by priority field at offset +4 for Z-order layering. |
| 0x0072CCD0 | 155 | STL_vector_20byte__move_elements | Moves array of 20-byte CRuneSlot objects from source to destination, copying 5 elements (vptrs + data) per iteration. |
| 0x0072CD70 | 50 | CRuneSlot__Constructor | Constructs a CRuneSlot object by initializing vtable pointer and copying 4 parameter values into the 20-byte structure. |
| 0x0072CFA0 | 23 | STL_vector_init_empty_0072cfa0 | Initializes an STL vector to empty state by zeroing capacity, size, and pointer fields. |
| 0x0072D330 | 64 | STL_unique_ptr_destroy_0x1C | Destroys a unique_ptr by deallocating its managed 0x1C-byte object if non-null, with stack canary protection |
| 0x0072D380 | 64 | STL_unique_ptr_destroy_0x1C_b | Destructor for unique_ptr managing 0x20-byte allocated objects; calls operator delete if pointer non-null |
| 0x0072D3D0 | 64 | STL_unique_ptr_destroy_0x1C_c | Destroys a unique_ptr managing a 0x20-byte allocated object with stack canary protection and exception handling. |
| 0x0072D420 | 80 | STL_map_clear_string_tree | Clears a std::map<string, tree_node> by recursively deleting all nodes and deallocating the map structure. |
| 0x0072D4A0 | 57 | STL_map_clear_rune_tree | Recursively deletes all nodes in a rune tree map structure, then deallocates the map container itself (0x20 bytes). |
| 0x0072D500 | 57 | STL_map_clear_rune_tree2 | Clears a rune tree map by recursively deleting nodes, then deallocates the map structure (32 bytes). |
| 0x0072D560 | 75 | STL_unique_ptr_destroy_rune_data_a | Destroys a unique_ptr managing rune data by deallocating the 28-byte rune object at offset +4 |
| 0x0072D5B0 | 113 | STL_unique_ptr_destroy_rune_vec_and_obj | Destroys a unique_ptr managing a rune vector and its allocated object, deallocating vector memory and freeing 32-byte object. |
| 0x0072D630 | 113 | STL_unique_ptr_destroy_rune_string_vec_and_obj | Destroys a unique_ptr managing a CRuneGroup string vector; deallocates nested strings then frees the 32-byte object. |
| 0x0072D6B0 | 75 | STL_unique_ptr_destroy_rune_data_b | Destroys a unique_ptr managing rune_data by deallocating the 0x1c-byte object at offset +4 |
| 0x0072D700 | 75 | STL_unique_ptr_destroy_rune_data_c | Destroys a unique_ptr managing rune data by deallocating 0x20 bytes at offset +4 with stack canary protection. |
| 0x0072D750 | 75 | STL_unique_ptr_destroy_rune_data_d | Destroys a unique_ptr managing rune data by deallocating the 32-byte rune object at offset +4 |
| 0x0072D7D0 | 65 | STL_unique_ptr_destroy_string_map_wrapper | Destroys a std::unique_ptr wrapping a string-keyed map by clearing its tree structure and cleaning up stack frame. |
| 0x0072D820 | 68 | STL_unique_ptr_destroy_rune_map_tree | Destroys a rune map tree by recursively deleting nodes, then deallocates the tree root structure (32 bytes). |
| 0x0072D880 | 68 | STL_unique_ptr_destroy_rune_map_tree2 | Destroys a rune map tree by recursively deleting nodes then freeing the root node structure (0x20 bytes). |
| 0x0072D8E0 | 68 | STL_unique_ptr_destroy_vector_8byte | Destroys a unique_ptr managing an 8-byte vector by deallocating its memory with stack guard protection. |
| 0x0072D930 | 68 | STL_unique_ptr_destroy_rune_string_vec | Wrapper that destroys a rune string vector by calling CRuneGroup's nested string vector destructor with stack canary protection. |
| 0x0072D980 | 106 | STL_vector_deallocate_with_validation | Deallocates STL vector memory with heap corruption detection; validates metadata and calls operator delete with size validation. |
| 0x0072DED0 | 82 | STL_string_less_compare | Compares two std::string objects lexicographically, returning -1, 0, or 1 for less/equal/greater ordering. |
| 0x0072DF30 | 84 | STL_string_less_compare2 | Compares two STL strings lexicographically, returning true if first string is strictly less than second. |
| 0x00730490 | 291 | STL_string_find_substr | Searches for substring in STL string using memchr + chunked comparison, returns position or -1 if not found |
| 0x00730E50 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties and color invariants. |
| 0x00731060 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color balance invariants. |
| 0x00731270 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure and color invariants |
| 0x00731480 | 82 | STL_vector_int__fill_with_memset | Fills integer vector with either zeros or repeated value; optimized memset path for zero initialization. |
| 0x007314E0 | 10 | STL_Xlength_error_vector_ptr | Throws std::length_error exception when a vector exceeds maximum allowed size during allocation. |
| 0x007314F0 | 10 | STL_Xlength_error_rune_vector | Throws std::length_error exception when a vector exceeds maximum allowed size limit |
| 0x00731500 | 10 | STL_Xlength_error_vector_20byte_b | Throws std::length_error exception when vector size exceeds maximum allowed length |
| 0x00731510 | 55 | deallocate | STL allocator deallocate wrapper; frees memory with size validation, handles oversized allocations via pointer offset lookup. |
| 0x00731550 | 55 | deallocate | STL allocator deallocate wrapper that validates heap metadata and frees memory via operator delete |
| 0x00731590 | 54 | deallocate | STL allocator deallocate for GSISymbolEntry; frees memory with optional indirection and size validation. |
| 0x00734290 | 561 | STL_vector_20byte__emplace_grow | Grows STL vector of 20-byte elements by reallocating buffer, copying data, invoking destructors, and managing security callbacks. |
| 0x00735B10 | 10 | STL_Xlength_error_vector_20byte_c | Throws std::length_error exception for vector capacity overflow, wrapper for STL error handling. |
| 0x00735B20 | 54 | deallocate | STL allocator deallocate for GSISymbolEntry; frees memory with size validation and optional indirection through header pointer. |
| 0x00736560 | 119 | STL_map_delete_skilltree_nodes_recursive | Recursively deletes skill tree map nodes by traversing left subtree and freeing nodes with no right child. |
| 0x007365F0 | 114 | STL_map_delete_skilltree_nodes_recursive2 | Recursively deletes skill tree node structures from STL map by traversing left subtree and deallocating nodes. |
| 0x00736670 | 75 | STL_map_lower_bound_skilltree | Binary search tree lower_bound operation on skill tree map; finds first node with key >= search value |
| 0x007366C0 | 75 | STL_map_int_lower_bound_skill | Performs lower_bound search on red-black tree skill map, returns iterator to first element >= key |
| 0x00736710 | 75 | STL_map_int_lower_bound_effect | STL map lower_bound search on integer keys, traversing red-black tree nodes to find insertion point for effect entries. |
| 0x00736C10 | 57 | STL_map_skilltree_destroy_and_free_a | Destroys and deallocates a skill tree STL map by recursively deleting all nodes then freeing the container. |
| 0x00736C70 | 57 | STL_map_skilltree_destroy_and_free_b | Destroys skilltree map by recursively deleting all nodes, then frees the map container allocation (0x20 bytes). |
| 0x00736CD0 | 113 | STL_unique_ptr_destroy_list_0x1C | Destroys and deallocates a 0x1C-sized list node structure, freeing memory if pointer at offset +4 is valid. |
| 0x00736F00 | 85 | STL_list_node_destroy_and_free | Destroys and deallocates an STL list node by nullifying links, calling destructors, and freeing memory. |
| 0x00736F80 | 68 | STL_map_skilltree_clear_and_free_a | Recursively deletes all skill tree nodes from STL map, then frees the map container memory. |
| 0x00736FE0 | 68 | STL_map_skilltree_clear_and_free_b | Recursively deletes all skilltree nodes from a map container, then frees the map structure itself. |
| 0x00737240 | 250 | STL_map_int_skilleffect_insert_or_find | Inserts or finds a skill effect entry in STL map<int, SkillEffectEntry>, allocating 0x20-byte nodes with red-black tree structure. |
| 0x00737420 | 83 | operator++ | STL tree iterator pre-increment operator; advances to next node in red-black tree traversal |
| 0x00737480 | 83 | operator++ | STL red-black tree const iterator pre-increment operator; advances to next in-order node |
| 0x007374E0 | 83 | operator++ | STL tree iterator increment operator; advances const iterator to next in-order node in red-black tree |
| 0x00737840 | 194 | STL_map_int_erase_skill | Erases a skill entry from an STL map by key, performing RB-tree node extraction and deallocation. |
| 0x007379A0 | 102 | STL_map_int_find_skill | Finds a skill entry in an STL map by ID and returns iterator; returns end iterator if not found. |
| 0x00737A10 | 137 | STL_map_int_erase_skill_2 | Erases a skill entry from an STL map by skill ID, extracting and deleting the node if found and valid. |
| 0x00737AE0 | 77 | STL_map_int_erase_effect | Erases an effect entry from an STL map by key, locating it via lower_bound and removing the RBTree node. |
| 0x00738700 | 704 | STL_RBTree_ExtractNode | Removes a node from std::map red-black tree, handles successor replacement and rebalancing via color fixup rotations. |
| 0x007389C0 | 704 | STL_RBTree_ExtractNode_2 | Red-black tree node extraction/removal with rebalancing; handles successor replacement and tree structure updates. |
| 0x00738C80 | 517 | Insert_node | STL Red-Black tree node insertion with rebalancing; maintains tree properties after inserting new node into balanced binary search tree |
| 0x00738E90 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure and color properties during insertion |
| 0x007390A0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree invariants and updates parent/child pointers |
| 0x007392B0 | 84 | STL_RBTree_RotateLeft | Performs left rotation on red-black tree node; updates parent pointers and tree root reference accordingly. |
| 0x00739310 | 84 | STL_RBTree_RotateLeft_2 | Performs left rotation on red-black tree node; updates parent pointers and maintains tree structure invariants. |
| 0x00739370 | 88 | STL_RBTree_RotateRight | Performs right rotation on red-black tree node; updates parent pointers and tree root if necessary. |
| 0x007393D0 | 88 | STL_RBTree_RotateRight_2 | Performs right rotation on red-black tree node, updating parent pointers and tree root reference accordingly. |
| 0x007394F0 | 153 | STL_tree_destroy_recursive_0x40 | Recursively destroys tree nodes with red-black tree structure (0x40 byte nodes), deallocating right children and node resources. |
| 0x007395A0 | 153 | STL_tree_destroy_recursive_0x1C | Recursively destroys left subtree nodes of a binary tree, deallocates node memory, and invokes destructor callback. |
| 0x00739650 | 153 | STL_tree_destroy_recursive_0x18 | Recursively destroys binary search tree nodes, deallocating left children and invoking destructors on node data pointers. |
| 0x007398A0 | 57 | STL_map_skilltree_clear_0x40 | Clears and deallocates an STL map node of size 0x40 bytes by recursively destroying its tree structure |
| 0x00739900 | 57 | STL_map_skilltree_clear_0x1C | Clears and deallocates a skill tree map node (0x1C size), recursively destroying children before freeing memory. |
| 0x00739960 | 57 | STL_map_skilltree_clear_0x18 | Destroys and deallocates an STL map node (0x18 byte size) used in skill tree data structure |
| 0x00739AE0 | 68 | STL_map_skilltree_destroy_tree_0x40 | Destroys a skill tree map by recursively freeing all nodes then deallocating the root node (40-byte structure). |
| 0x00739B40 | 68 | STL_map_skilltree_destroy_tree_0x1C | Destroys a skill tree map by recursively deleting tree nodes then freeing the map structure (0x40 bytes). |
| 0x00739BA0 | 68 | STL_tree_0x18__destroy_and_delete_skilltree | Destroys skill tree nodes recursively then deallocates the tree root node (0x40 bytes), with stack canary protection. |
| 0x00739C00 | 89 | STL_tree_0x1c__destroy_and_delete_skilltree | Destructor for STL tree node containing skill tree data; recursively destroys tree and deallocates memory. |
| 0x0073B030 | 22 | STL_iterator_init_vtable_k | Initializes STL iterator vtable pointer and copies iterator state from source parameter |
| 0x0073B050 | 22 | STL_iterator_init_vtable_pimpl | Initializes STL iterator vtable and copies offset+4 data member for iterator implementation object. |
| 0x0073C2F0 | 22 | STL_iterator__set_vtable | Initializes STL iterator vtable pointer and copies offset+4 data member to param_2[1]. |
| 0x0073C310 | 22 | STL_iterator_init_vtable_n | Initializes STL iterator vtable and copies size/capacity field from source container object. |
| 0x007416F0 | 75 | STL_map_int_lower_bound_factory_a | Performs binary search tree lower_bound operation on std::map<int, ?>, returning iterator to first element >= key |
| 0x00741740 | 75 | STL_map_int_lower_bound_factory_b | STL map lower_bound search on integer keys; traverses BST from root, comparing search key with node values to find insertion point. |
| 0x00741790 | 75 | STL_map__lower_bound_int | STL std::map lower_bound for int keys; traverses red-black tree to find first node with key >= search value |
| 0x007437D0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree invariants and color properties. |
| 0x007439E0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree invariants and color properties. |
| 0x00743BF0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure invariants and color properties. |
| 0x0074D500 | 211 | STL_random_shuffle_rejection | Fisher-Yates shuffle using rejection sampling with CryptoPP RNG; shuffles array in-place between param_1 and param_2. |
| 0x0074D5F0 | 146 | STL_random_shuffle | Fisher-Yates shuffle implementation for undefined4 array using CryptoPP RNG with rejection sampling for uniform distribution. |
| 0x0075E0E0 | 75 | STL_vector_string_destructor_4elem | Destroys STL vector of 4 std::string elements by iterating destructor over 0x18-byte string objects. |
| 0x0076E3F0 | 138 | STL_map__DestroySubtree | Recursively destroys a binary search tree node and its left subtree, deallocating memory for each node visited. |
| 0x0076E490 | 75 | STL_map_int__lower_bound_0x76e490 | STL map lower_bound search on integer keys; finds first element >= search value in binary tree |
| 0x0076F0C0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree invariants and color balance. |
| 0x0076F910 | 99 | _Find_last<> | STL hash table internal method that finds the last node in a bucket chain matching a given hash value and key. |
| 0x0076FAE0 | 428 | STL_unordered_set_string__insert | Inserts a string element into std::unordered_set, computing FNV-1a hash and finding bucket position for collision handling. |
| 0x0076FC90 | 480 | STL_unordered_map__insert_node | Inserts a node into an unordered_map hash table with collision chain linking and rehashing if load factor exceeded. |
| 0x0076FE80 | 97 | fill<> | STL template instantiation for std::fill algorithm across various list iterator types used in RO client data structures |
| 0x0076FEF0 | 369 | STL_unordered_set_string__insert_b | Inserts a string element into an STL unordered_set with hash collision handling and dynamic rehashing |
| 0x00770070 | 31 | STL_fill_range | Fills a memory range with a constant value using element-sized strides |
| 0x00770150 | 125 | std_function__copy_ctor | Copy constructor for std::function wrapper; copies callable state and invokes copy semantics based on storage type flags |
| 0x007701D0 | 126 | std_bad_cast__copy_ctor | Copy constructor for std::bad_cast exception class; initializes vftable and copies exception message string. |
| 0x00770250 | 109 | std_bad_cast__default_ctor | Constructs std::bad_cast exception object with vtable pointers and "bad cast" message string. |
| 0x00770380 | 86 | STL_vector_deallocate_aligned | Deallocates aligned STL vector memory with overflow validation before calling operator delete. |
| 0x007705F0 | 75 | STL_unordered_map__clear | Clears an unordered_map by deallocating hash nodes and resetting bucket array to empty state. |
| 0x00770640 | 78 | std_exception__dtor | Destructor for std::exception that clears vftable and invokes exception cleanup via __std_exception_destroy |
| 0x00770730 | 100 | std_exception__scalar_dtor | Destructor for std::exception that optionally deallocates memory and calls exception cleanup via __std_exception_destroy. |
| 0x007710C6 | 71 | STL_map__get_value_or_default | STL map iterator dereference: returns value ptr from tree node, or default empty string if at end sentinel |
| 0x00771266 | 61 | STL_map__get_value_ptr | STL map iterator dereference: returns value ptr from tree node, or null if at end sentinel |
| 0x00771406 | 71 | STL_map__get_value_or_default_00771406 | STL map iterator dereference: returns value ptr from tree node, or default empty string if at end sentinel |
| 0x0077159F | 61 | STL_map__get_value_ptr_0077159f | STL map iterator dereference: returns value ptr from tree node, or null if at end sentinel |
| 0x007719B0 | 232 | STL_vector_uint__resize_fill | Resizes a uint vector to param_2 elements, filling new elements with param_3 value; handles memory allocation with alignment optimization. |
| 0x00771CE0 | 362 | STL_unordered_map__rehash_0x771ce0 | Rehashes unordered_map buckets to new capacity; recalculates hash positions and relinks bucket chain nodes. |
| 0x00771E70 | 95 | STL_unordered_map__insert_at_bucket | Inserts a node into an unordered_map bucket, maintaining doubly-linked list pointers and updating bucket head references. |
| 0x00771F10 | 167 | std_function__move_assign | Moves std::function state from source to destination, handling small object optimization and type-erased callable storage. |
| 0x00771FC0 | 132 | _Rehash_for_1 | Rehashes unordered_set<string> bucket table by calculating new size and reallocating buckets when load factor threshold exceeded. |
| 0x007720B0 | 400 | STL_vector_string__assign_range | Assigns a range of std::basic_string elements to a vector, reallocating capacity if needed with 1.5x growth strategy. |
| 0x00772260 | 34 | STL_memmove_and_advance | Copies memory from source to destination and returns new destination pointer advanced by bytes copied. |
| 0x00772290 | 68 | _Copy_unchecked<class_std::basic_string<char,struct_std::char_traits<char>,class_std::allocator<char>_>*,class_std::basic_string<char,struct_std::char_traits<char>,class_std::allocator<char>_>*> | STL template that copies a range of std::string objects from source to destination without bounds checking. |
| 0x007722E0 | 451 | STL_vector_1c__grow_and_insert | Grows STL vector<28-byte struct>, inserts element at param_2 offset, reallocates and copies data with exception safety. |
| 0x00772590 | 75 | STL_map_int__lower_bound_6c | Performs binary search lower_bound on red-black tree node structure, returns iterator with key comparison result |
| 0x007748A0 | 148 | STL_vector_1c__reserve | Reserves capacity for STL vector<struct_1c> by allocating new memory and copying data with 1.5x growth factor. |
| 0x00774940 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties and color balance |
| 0x00774B50 | 136 | STL_vector_1c__deallocate | Deallocates STL vector of 0x1c-byte elements, handling aligned memory with size validation before calling operator delete. |
| 0x00774C00 | 64 | STL_memmove_1c_elements | Moves memory block of N elements (0x1c bytes each) from source to dest, returns pointer past last moved element |
| 0x00774C40 | 10 | STL_Xlength_error_vector_1c_b | Throws std::length_error exception for vector allocation exceeding maximum size limit |
| 0x00774C50 | 102 | STL_vector_1c__allocate | Allocates aligned memory for STL vector with 0x1c-byte elements, aligning to 32-byte boundaries for larger allocations. |
| 0x00774CC0 | 60 | STL_vector_1c__deallocate_2 | Deallocates STL vector memory for elements of size 0x1c bytes, with overflow detection and aligned deallocation. |
| 0x00775860 | 141 | std_string__assign_substr | Assigns a substring from a C-string buffer to a std::string, validating length doesn't overflow capacity. |
| 0x00775980 | 96 | STL_list_init_12byte | Initializes a 12-byte STL doubly-linked list node with self-referential head pointers for an empty list |
| 0x00775A30 | 64 | STL_list_clear_node_12byte_A | Deallocates a 12-byte node from an STL list by calling operator delete on the node pointer at offset +4. |
| 0x00775A80 | 64 | STL_list_clear_node_20byte_A | Deallocates a 20-byte node from an STL list by calling operator delete with stack canary XOR protection. |
| 0x00775AD0 | 75 | STL_list_clear_node_12byte_B | Deallocates a 12-byte node from an STL list by calling operator_delete on the node pointer at offset +4. |
| 0x00775B20 | 75 | STL_list_clear_node_20byte_B | Deallocates a single 20-byte node from an STL list by calling operator_delete with size 0x14 and stack canary validation. |
| 0x00775B70 | 74 | STL_list_destroy_12byte | Destroys a 12-byte STL list node by deallocating internal node pointer and list container itself. |
| 0x00775BE0 | 74 | STL_list_destroy_20byte | Destroys a 20-byte STL list node by freeing the linked list head pointer and the list structure itself. |
| 0x00775E70 | 174 | STL_list_insert_node_20byte | Inserts a 20-byte node into a doubly-linked list, allocating node memory and updating list pointers and size counter. |
| 0x00776760 | 170 | STL_map_insert_achievement_node | Initializes STL map node structure for achievement data; allocates 0x2c-byte node with bidirectional pointers and 0x101 color flag. |
| 0x00778490 | 64 | STL_list_clear_node_52byte | Deallocates a 52-byte node from an STL list by freeing the allocated memory at offset +4. |
| 0x00778890 | 106 | STL_vector_deallocate_aligned_B | Deallocates aligned STL vector memory with overflow detection, validates alignment metadata before calling operator delete. |
| 0x00778F80 | 290 | STL_map_int_string_insert_or_find | STL map<int, string> operator[] implementation: finds or inserts key, returns pointer to string value |
| 0x0077FB20 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties and color balance |
| 0x0077FD30 | 10 | STL_Xlength_error_achievement_b | Throws std::length_error exception for vector overflow, called when vector size exceeds maximum capacity |
| 0x0077FD40 | 10 | STL_Xlength_error_achievement_c | Throws std::length_error exception when vector allocation exceeds maximum allowed size limit. |
| 0x00788220 | 150 | STL_vector_destruct_elements_4c | Destructs STL vector elements by iterating through allocation and freeing memory via operator delete with XOR-obfuscated stack canary. |
| 0x007882E0 | 64 | STL_list_delete_node_10 | Deletes STL list node by freeing 16-byte allocated memory at offset +4, with stack cookie validation |
| 0x00788330 | 75 | STL_list_delete_node_10_v2 | Deallocates a 16-byte node in an STL list by calling operator delete on offset+4 with XOR stack canary protection. |
| 0x007885E0 | 16 | BezierCurve__AddControlPoint_Thunk | Thunk wrapper that delegates to BezierCurve::AddControlPoint with stack-based arguments for curve control point addition. |
| 0x007889A0 | 64 | STL_list_delete_node_30 | Deletes a list node by freeing allocated memory at offset +4, with stack cookie validation for buffer overflow protection. |
| 0x007889F0 | 64 | STL_list_delete_node_1c | Deletes a 28-byte (0x1c) heap-allocated node from an STL list, with stack canary protection. |
| 0x00788C20 | 75 | STL_list_delete_node_1c_v2 | Deletes a node from an STL list by freeing allocated memory at offset +4, with stack canary protection. |
| 0x007896F0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree invariants after inserting new node into binary search tree structure. |
| 0x00789D20 | 34 | memmove_to_dest | Moves memory from param_1 to param_3, returning pointer to end of copied data in destination. |
| 0x00789D50 | 334 | UIItemCatalog__VectorInsertGrow | Inserts element into UIItemCatalog vector at specified position, growing capacity by 1.5x when needed. |
| 0x0078A6C0 | 10 | vector_too_long_A | Throws std::length_error exception for vector overflow in UIItemCatalogView operations |
| 0x0078A6D0 | 92 | allocate_vector_4byte_aligned_32 | Allocates memory for 4-byte element vectors with 32-byte alignment for large allocations (>=4096 bytes). |
| 0x0078A730 | 55 | deallocate | Deallocates memory with size validation; retrieves actual allocation size from header if >4KB, validates heap integrity before deletion. |
| 0x0078A770 | 34 | STL_move_and_offset | Moves memory block and returns pointer offset by destination base, used for STL container relocation. |
| 0x0078AAC0 | 95 | std_exception__bad_alloc_ctor | Constructs std::bad_alloc exception object, initializes vtable, and cleans up allocated memory if needed. |
| 0x0078AB30 | 74 | UIItemCatalog__cleanup_and_throw_bad_alloc | Cleans up UIItemCatalog resources and throws std::bad_alloc exception on memory allocation failure. |
| 0x0078AE90 | 93 | UIItemCatalog__AssignStringFromCStr | Assigns a C string to UIItemCatalog's internal std::string, computing length and handling null input. |
| 0x0078B382 | 68 | STL_vector__dtor_and_free_pair | Deallocates vector<int> contents, zeros pair structure, then frees the pair allocation (12 bytes each) |
| 0x0078B4A0 | 10 | vector_too_long_B | Throws std::length_error exception for vector overflow in search view B operations |
| 0x0078B4B0 | 55 | deallocate | STL allocator deallocate wrapper; frees memory with size validation and overflow check for allocated blocks. |
| 0x0078B4F0 | 34 | memmove_to_dest_B | Moves memory from src to dest, returns pointer to end of copied region (dest + byte count). |
| 0x0078B520 | 449 | UIItemCatalogSearchB__VectorInsertGrow | Inserts element into UIItemCatalogSearchB vector with 1.5x growth strategy and 32-byte aligned allocation for sizes โฅ4KB. |
| 0x0078BE17 | 153 | STL_vector__deallocate_buffer_0078be17 | Deallocates a vector's internal buffer. Handles both sized (capacity-based) and unsized (end-begin-based) deallocation paths. |
| 0x0078BF40 | 10 | vector_too_long_C | Throws std::length_error exception for vector capacity violations in STL container operations. |
| 0x0078BF50 | 55 | deallocate | STL allocator deallocate wrapper that validates heap metadata and frees memory blocks, with overflow protection for large allocations. |
| 0x0078BF90 | 34 | STL_vector_move_and_advance | Moves memory block and returns pointer to destination end; mimics std::vector iterator semantics for relocation. |
| 0x0078BFC0 | 449 | UIItemCatalogUnpurchased__VectorInsertGrow | Inserts element into UIItemCatalogUnpurchased vector with 1.5x growth strategy and page-aligned allocation for sizes โฅ4KB. |
| 0x0078CB9E | 56 | STL_pair__free_and_delete | Zeros pair node, frees internal buffer (12 bytes), then frees the pair itself (12 bytes) |
| 0x0078CD00 | 10 | vector_too_long_D | STL exception handler that throws std::length_error when vector size exceeds maximum allowed capacity |
| 0x0078CD10 | 55 | deallocate | STL allocator deallocate wrapper; validates heap metadata and frees memory allocated for unsigned int arrays in RO game client |
| 0x0078ED30 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties and color invariants. |
| 0x007924B0 | 64 | STL_list_clear_node_28byte_A | Deallocates a 28-byte node in an STL list by calling operator delete on the node pointer at offset +4. |
| 0x00792500 | 75 | STL_list_clear_node_28byte_B | Clears a 28-byte STL list node by deallocating its dynamically allocated memory via operator delete. |
| 0x00792550 | 75 | STL_list_clear_node_28byte_C | Deallocates a 28-byte node in an STL list by calling operator_delete on the node pointer stored at offset +4. |
| 0x007927C0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties and color balance. |
| 0x00792F90 | 34 | STL_memmove_with_offset_return | Moves memory from param_1 to param_3 using calculated size, returns new end pointer offset. |
| 0x00792FC0 | 34 | STL_copy_range_and_advance | Copies memory range from param_1 to param_3, returns new pointer position after copy (likely STL iterator operation) |
| 0x00792FF0 | 34 | STL_vector_move_assign_wrapper | Moves memory block and returns new end pointer; typical STL vector assignment/move operation wrapper. |
| 0x00793020 | 104 | STL_element_0x30_destructor | Destructs array of 0x30-byte elements by iterating and destroying embedded std_string members. |
| 0x00793090 | 449 | STL_vector_vending_insert_grow | Grows STL vector of vending shop data by reallocating memory, inserting new element, and copying existing data. |
| 0x00793260 | 449 | STL_vector_vending_insert_grow_b | STL vector grow operation for vending list; inserts element at position, reallocates with 1.5x growth, copies existing data around insertion point. |
| 0x00793430 | 449 | STL_vector_vending_insert_grow_c | Grows vending vector by reallocating memory, inserting new element at position, and copying existing data with overflow checks. |
| 0x00793600 | 94 | STL_tree_destroy_recursive_0x18_b | Recursively destroys tree nodes by post-order traversal, deallocating 0x18-byte node structures via operator delete. |
| 0x00793670 | 75 | STL_rbtree_lower_bound_C | STL red-black tree lower_bound search; finds first node with key >= search value in RO item/NPC database tree |
| 0x00793B10 | 64 | STL_list_clear_node_24byte | Deallocates a 24-byte node from an STL list by calling operator_delete on the node pointer at offset +4. |
| 0x00793B60 | 80 | STL_map_erase_node_18byte | Erases an 18-byte node from STL map by destroying recursive tree structure and deallocating node memory with XOR-based security cookie validation. |
| 0x00793BE0 | 75 | STL_map_free_node_18byte_a | Frees an STL map node by deallocating its 24-byte payload via operator delete with stack canary protection. |
| 0x00793C30 | 75 | STL_map_free_node_18byte_b | Deallocates an STL map node containing an 18-byte value by calling operator delete on offset+4 |
| 0x00793C80 | 57 | STL_map_clear_and_free | Destroys string elements in a UIListWnd map container and frees the underlying memory allocation. |
| 0x00793CE0 | 65 | STL_map_erase_node_wrapper | Wrapper for STL map node erasure with stack canary check; calls STL_map_erase_node_18byte for 18-byte value removal |
| 0x00793D30 | 106 | STL_vector_deallocate_4byte_b | Deallocates STL vector memory for 4-byte elements with overflow size handling and security checks. |
| 0x00793DC0 | 106 | STL_vector_deallocate_4byte_c | Deallocates STL vector memory for 4-byte elements, handling both direct and offset-based heap pointers with validation. |
| 0x00793E50 | 106 | STL_vector_deallocate_4byte_d | Deallocates STL vector memory with 4-byte element alignment, validating heap metadata before calling delete operator. |
| 0x00793EE0 | 143 | STL_vector_deallocate_with_cleanup | Destructs and deallocates an STL vector container, invoking element destructors (0x30-byte objects) before freeing underlying memory. |
| 0x00793F90 | 120 | STL_map_clear_and_deallocate | Destructs and deallocates a UIServiceItemMap STL container, clearing vectors, map nodes, and string elements before freeing memory. |
| 0x00794210 | 83 | operator++ | STL tree iterator pre-increment operator; advances to next node in red-black tree traversal by visiting right subtree or parent chain. |
| 0x007997C0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties after adding new node to maintain BST ordering |
| 0x007999D0 | 10 | STL_Xlength_error_vending_a | Throws std::length_error exception when a vector allocation exceeds maximum size limits |
| 0x007999E0 | 10 | STL_Xlength_error_vending_b | Throws std::length_error exception when vector allocation exceeds maximum size limit |
| 0x007999F0 | 10 | STL_Xlength_error_vending_c | Throws std::length_error exception when vector allocation exceeds maximum size limit |
| 0x00799A40 | 55 | deallocate | STL allocator deallocate wrapper; frees memory with size validation, calls operator delete with adjusted pointer/size for large allocations (>4KB). |
| 0x00799A80 | 55 | STL_vector_deallocate_vending | Deallocates STL vector memory with size validation, handling both small buffers and heap-allocated blocks. |
| 0x00799AC0 | 55 | deallocate | STL allocator deallocate wrapper that validates heap metadata and frees memory blocks with size tracking |
| 0x00799B00 | 173 | STL_list_push_back_item_100byte | Inserts a 256-byte vending/inventory item into STL list; throws if list exceeds 16M elements. |
| 0x00799BB0 | 34 | STL_vector_move_range | Moves memory range from param_1 to param_3, returns new end pointer (typical STL vector reallocation helper) |
| 0x00799BE0 | 34 | STL_memmove_with_offset_calculation | Moves memory from param_1 to param_3 using size (param_2 - param_1), returns new offset. |
| 0x00799C10 | 114 | STL_map_destroy_nodes_actor_layer | Recursively destroys tree nodes in a C3dActorPC layer map, deallocating memory and invoking destructors. |
| 0x00799C90 | 415 | STL_vector_charcreate_insert_grow_a | Reallocates STL vector storage for character creation data, growing capacity and copying existing elements to new buffer. |
| 0x00799E40 | 415 | STL_vector_charcreate_insert_grow_b | Reallocates STL vector for character creation with growth strategy, handles memory alignment for large allocations. |
| 0x00799FF0 | 28 | _Zero_range<> | STL template utility that zero-initializes a memory range by calling memset between two pointers |
| 0x0079A010 | 28 | _Zero_range<> | STL template function that zeroes a memory range from param_1 to param_2 by size calculation. |
| 0x0079A4C0 | 57 | STL_map_destroy_actor_layer_a | Destroys STL map nodes for actor layer and deallocates the map container (0x20 bytes). |
| 0x0079A520 | 68 | STL_map_destroy_actor_layer_b | Destroys STL map container for actor layer by freeing all nodes then deallocating the map structure itself. |
| 0x0079A580 | 106 | STL_vector_deallocate_skill | Deallocates STL vector memory for skill data, validating allocation metadata before freeing. |
| 0x0079A610 | 106 | STL_vector_deallocate_generic_a | Deallocates STL vector memory with heap integrity validation; checks allocation metadata before calling operator delete. |
| 0x0079F670 | 3 | STL_vector_trivial_identity_return | Trivial pass-through function returning its argument unchanged; likely compiler-generated for STL vector operations or template instantiation. |
| 0x0079F680 | 3 | STL_vector_identity_return | Identity function returning input parameter unchanged; likely compiler-generated trivial wrapper or inline candidate. |
| 0x0079F690 | 10 | STL_Xlength_error_charcreate_a | Throws std::length_error exception for vector capacity overflow in character creation context |
| 0x0079F6A0 | 10 | STL_Xlength_error_charcreate_b | Throws std::length_error exception when vector allocation exceeds maximum size limit |
| 0x0079F6B0 | 55 | deallocate | STL allocator deallocate wrapper; validates heap metadata and frees memory via operator delete with size parameter |
| 0x0079F6F0 | 55 | deallocate | STL allocator deallocate wrapper; frees memory with size validation, calls operator delete with adjusted pointer/size |
| 0x007A2110 | 104 | stl_vector_0x38_destroy_range | Destroys a range of std::string objects in an STL vector with 0x38-byte elements by iterating and calling destructors. |
| 0x007A2180 | 585 | stl_vector_0x38_insert_reallocate | Reallocates and reinserts an element into a 0x38-byte STL vector, growing capacity by 1.5x when needed. |
| 0x007A23E0 | 137 | stl_vector_0x38_copy_range | Copies range of 0x38-byte elements from [param_1, param_2) to param_3 via move construction with exception safety. |
| 0x007A2470 | 113 | stl_vector_0x38_copy_construct_element | Copy-constructs a 0x38-byte structure element by copying two STL strings and two 4-byte fields from source to destination. |
| 0x007A2640 | 200 | stl_vector_0x38_move_construct_element | Move-constructs a 0x38-byte STL vector element by copying data and zeroing source, used for efficient vector element transfer in RO client. |
| 0x007A2730 | 151 | stl_vector_0x38_deallocate | Deallocates an STL vector of 0x38-byte elements, destroying contained objects and freeing allocated memory. |
| 0x007A4350 | 22 | STL_vector_0x38_destroy_range_wrapper | Wrapper that destroys a range of 0x38-sized STL vector elements by delegating to stl_vector_0x38_destroy_range with reordered parameters. |
| 0x007A4370 | 10 | STL_Xlength_error_vector_0x38 | Throws std::length_error exception when vector size exceeds maximum allowed length |
| 0x007A4380 | 60 | stl_vector_0x38_free_storage | Deallocates STL vector storage of 0x38-byte elements with overflow validation before operator delete. |
| 0x007A43D0 | 34 | stl_uninitialized_memmove | Moves memory block and returns pointer to end of destination buffer; used for STL container uninitialized copy operations. |
| 0x007A4400 | 34 | stl_uninitialized_memmove_b | Moves memory block and returns pointer to end of destination buffer; used for uninitialized STL container operations. |
| 0x007A4430 | 449 | STL_vector_color_insert_grow | Inserts element into color vector with dynamic growth, reallocates memory with 1.5x expansion strategy, handles alignment for allocations โฅ4KB. |
| 0x007A4600 | 421 | STL_vector_wchar_insert_grow | Inserts element into wchar_t vector with 1.5x capacity growth; allocates aligned buffer, memmoves surrounding elements, frees old buffer. |
| 0x007A47D0 | 489 | STL_vector_24byte__insert_grow | STL vector insertion with reallocation: inserts param_3 range at param_2 position, grows capacity if needed. |
| 0x007A4BC0 | 106 | STL_vector_deallocate_service_a | Deallocates STL vector memory with overflow detection and optional heap metadata cleanup. |
| 0x007A4C50 | 106 | STL_vector_deallocate_service_b | Deallocates STL vector memory with validation; checks allocation size and calls operator delete with XOR-encoded cookie. |
| 0x007A6760 | 10 | STL_Xlength_error_vector_wchar_b | Throws std::length_error exception for vector size exceeding maximum allowed length limit |
| 0x007A6770 | 10 | STL_Xlength_error_vector_color | Throws std::length_error exception when vector allocation exceeds maximum allowable size limit |
| 0x007A6780 | 51 | stl_vector_short_free_storage | Deallocates storage for a std::vector<short>, handling both small object optimization and heap allocation cases. |
| 0x007A67C0 | 55 | deallocate | STL allocator deallocate wrapper that handles large allocations (>4KB) with header validation before calling operator delete. |
| 0x007A7FA0 | 39 | stl_vector_int_push_back_007a | STL vector push_back implementation for int elements; appends value to vector with capacity check and reallocation. |
| 0x007AC790 | 132 | stl__rbtree_decrement | Red-black tree node decrement operation; navigates to previous node in in-order traversal by checking color and parent/child pointers. |
| 0x007AF060 | 95 | stl__allocate_12byte_array | Allocates aligned 12-byte array with overflow checking; aligns to 32-byte boundary for sizes โฅ4096 bytes |
| 0x007AF0C0 | 95 | stl__allocate_24byte_array | Allocates aligned 24-byte element arrays with overflow checks; aligns to 32-byte boundaries for large allocations. |
| 0x007AF120 | 34 | stl__relocate_range_copy_1 | Relocates memory range by moving bytes and returns new end pointer; STL vector/deque relocation helper. |
| 0x007AF150 | 34 | STL_relocate_range_copy | Copies memory range via memmove and returns pointer to end of relocated data in destination buffer. |
| 0x007AF180 | 449 | std__vector_int__insert_reallocate_2 | Reallocates and reorganizes std::vector<int> storage when inserting element at arbitrary position, growing capacity as needed. |
| 0x007B25B0 | 10 | stl__throw_vector_too_long_1 | Throws std::length_error exception when std::vector size exceeds maximum allowed length |
| 0x007B25C0 | 10 | stl__throw_vector_too_long_2 | Throws std::length_error exception when vector allocation exceeds maximum allowable size limit. |
| 0x007B25D0 | 55 | deallocate | STL allocator deallocate wrapper; frees memory with overflow validation for allocations >4KB |
| 0x007B6B00 | 34 | stl_memmove_range_007b | Copies a range of bytes from source to destination and returns pointer to end of copied data. |
| 0x007B6B30 | 449 | std__vector_int__insert_reallocate_007b | STL vector<int> insertion with reallocation; grows capacity, copies existing elements, inserts new element, deallocates old buffer |
| 0x007B6D00 | 436 | std__vector_pair_int__insert_reallocate | Reallocates and inserts a pair<int,int> element into std::vector, handling growth, alignment, and memory management with overflow checks. |
| 0x007B6EC0 | 517 | std__vector_struct32__insert_reallocate | Reallocates and reorganizes a vector of 32-byte structures during insertion, handling memory growth and element relocation. |
| 0x007B70D0 | 473 | std__vector_struct32__resize_grow | Resizes a vector of 32-byte structs by allocating new memory, copying existing elements, and constructing new ones. |
| 0x007B72B0 | 204 | std__vector_struct32__uninitialized_move | Moves 32-byte structures from source to destination vector, clearing source and initializing dest elements. |
| 0x007B7380 | 141 | std__vector_struct32__copy_construct_element | Copy-constructs a 32-byte struct element, copying fields and zeroing source; likely for RO packet/data structure copying. |
| 0x007B7700 | 90 | std__vector_struct32__destroy_elements_a | Destructs vector of 32-byte structures by calling destructor on each element; likely std::vector<std::string> or similar container cleanup. |
| 0x007B7760 | 90 | std__vector_struct32__destroy_elements_b | Destroys std::string elements in a vector of 32-byte structs by iterating and calling destructors on each element. |
| 0x007B85FA | 60 | std_string__assign_from_cstr_007b85fa | Initializes an std::string from a C-string parameter. Calculates the string length by scanning for the null terminator, then calls std_string__assign_range to assign the content. |
| 0x007BB340 | 92 | std__vector_struct32__deallocate_a | Destructs a vector of 32-byte structures by calling destructor on each std::string element in range [param_1, param_2) |
| 0x007BB3A0 | 92 | std__vector_struct32__deallocate_b | Destructs vector of 32-byte structs by iterating and calling std_string destructor on each element. |
| 0x007BB400 | 3 | std__noop_stub_007bb400 | Identity function that returns its parameter unchanged; likely a stub or placeholder for template instantiation. |
| 0x007BB410 | 142 | std__vector_struct32__fill_construct | Initializes a vector of 32-byte structures by zero-filling each element across multiple iterations. |
| 0x007BB4A0 | 44 | stl_memmove_8byte_elements | STL template instantiation: stl memmove 8byte elements |
| 0x007BB4D0 | 45 | CRT_memmove_backward_8byte | Moves 8-byte elements backward in memory to handle overlapping regions safely (reverse direction copy). |
| 0x007BB500 | 203 | std__vector_struct32__uninitialized_copy | Copies array of 32-byte structures (8 dwords each) from source to destination with zero-initialization of unused fields. |
| 0x007BB5D0 | 10 | std__vector_int__length_error_007bb5d0 | Throws std::length_error exception when vector size exceeds maximum allowed length limit |
| 0x007BB5E0 | 10 | STL_vector_throw_length_error | Throws std::length_error exception when vector allocation exceeds maximum allowed size |
| 0x007BB5F0 | 10 | std__vector_struct32__length_error_007bb5f0 | Throws std::length_error exception when std::vector<struct32> exceeds maximum size limit |
| 0x007BB600 | 10 | STL_vector_struct32_throw_length_error | Throws std::length_error exception when vector size exceeds maximum allowed length |
| 0x007BB610 | 391 | std__wstring__append_fill | Appends param_2 copies of wide character param_3 to std::wstring, reallocating if needed. |
| 0x007BB840 | 55 | deallocate | STL allocator deallocate wrapper that frees memory blocks >4KB with boundary validation before operator delete call |
| 0x007BB880 | 55 | deallocate | STL allocator deallocate for phmap containers; validates alignment and delegates to operator delete with size |
| 0x007BB8C0 | 51 | std__vector_struct32__free_buffer_a | Deallocates vector buffer for struct32 elements, validating alignment and delegating to operator delete |
| 0x007BB900 | 51 | STL_vector_deallocate_buffer | Deallocates a vector's internal buffer, handling small/large allocations with size validation before operator delete. |
| 0x007BB940 | 51 | std__vector_struct32__free_buffer_c | Deallocates vector buffer with size validation; checks allocation overhead and calls operator delete with computed size. |
| 0x007C2330 | 449 | std__vector_int__insert_single | Inserts a single int element into std::vector, reallocating and shifting elements as needed with overflow protection. |
| 0x007C49D0 | 23 | std__vector_triple__default_ctor | Initializes a std::vector by zeroing its three control members (data pointer, size, capacity). |
| 0x007C4C30 | 282 | std__map_EnchantSubInfo__insert_or_find | STL map insertion that finds or creates EnchantSubInfo nodes by ID, used in UI card merge window |
| 0x007C4D50 | 83 | operator++ | STL tree iterator pre-increment operator that advances to next node in red-black tree traversal order |
| 0x007C6B10 | 163 | std__map_EnchantSubInfo__destroy_tree | Recursively destroys a red-black tree node in std::map<EnchantSubInfo>, deallocating strings and memory. |
| 0x007C6D30 | 60 | std__map_EnchantSubInfo__destroy_and_free_A | Destroys and deallocates an std::map<EnchantSubInfo> by clearing the tree structure and freeing the allocated memory block (0x1b0 bytes). |
| 0x007C6D90 | 71 | std__map_EnchantSubInfo__destroy_and_free_B | Destroys and deallocates a std::map<EnchantSubInfo> container, freeing its tree nodes and allocated memory. |
| 0x007C6F30 | 83 | operator++ | STL tree iterator pre-increment operator; advances to next in-order node in red-black tree of unsigned ints |
| 0x007C74E0 | 704 | STL_rbtree_erase_rebalance_card | Red-black tree node erasure with rebalancing; removes node and maintains tree balance properties via rotations and color adjustments. |
| 0x007C77A0 | 84 | std__tree__rotate_left | STL red-black tree left rotation: rebalances tree by rotating node left around its right child |
| 0x007C7800 | 88 | std__tree__rotate_right | Performs right rotation on a red-black tree node, updating parent pointers and tree root if necessary. |
| 0x007CC370 | 443 | STL_vector_16byte_card__insert_grow | Inserts a 16-byte card element into STL vector, reallocating and copying existing elements with growth strategy. |
| 0x007CDA70 | 68 | std_string__destructor_wrapper_A | Exception-safe wrapper that destructs std::string with stack canary protection and SEH frame setup. |
| 0x007CDAC0 | 68 | std_string__destructor_wrapper_B | Exception-safe wrapper for std::string destructor with stack canary validation and SEH frame setup |
| 0x007CDB10 | 68 | std_string__destructor_wrapper_C | Wrapper that destructs a std::string object with stack canary security checks (XOR cookie validation) |
| 0x007CDB60 | 68 | std_string__destructor_wrapper_D | Wrapper that calls std::string destructor with stack cookie validation and exception handling frame setup. |
| 0x007CDBB0 | 68 | std_string__destructor_wrapper_E | Exception-safe wrapper for std::string destructor with stack cookie validation and SEH frame setup |
| 0x007CDC00 | 68 | std_string__destructor_wrapper_F | Wrapper for std::string destructor with stack cookie validation; calls std_string__destructor after XOR security check. |
| 0x007CDC50 | 106 | std__vector__deallocate_aligned | Deallocates aligned memory block with overflow validation, retrieving original pointer from offset if allocation exceeded 4KB threshold. |
| 0x007CDD70 | 82 | std__tree__find_leftmost_or_parent | Locates the leftmost node or parent in a red-black tree (offset 0xd indicates node color/sentinel flag) |
| 0x007D2680 | 36 | STL_copy_16byte_card_elements | Copies 16-byte card item elements from source to destination buffer, used for inventory/storage card data synchronization. |
| 0x007D26B0 | 10 | std__vector_16byte__throw_length_error | Throws std::length_error exception when std::vector<16-byte element> size exceeds maximum capacity |
| 0x007D26C0 | 51 | std__vector_16byte__deallocate | Deallocates memory for std::vector of 16-byte elements with overflow checking before calling operator delete. |
| 0x007D2CE0 | 151 | STL_rbtree_destroy_nodes_rune | Recursively destroys red-black tree nodes containing rune data, freeing strings and allocated memory. |
| 0x007D3040 | 60 | std__map_RuneSlot__destroy_and_free | Destroys and deallocates a std::map<RuneSlot> container by recursively freeing all red-black tree nodes then releasing the map object. |
| 0x007D30A0 | 140 | STL_rbtree_free_node_with_string | Deallocates red-black tree node containing string by destroying string members and freeing node memory (0x118 bytes). |
| 0x007D3190 | 71 | STL_rbtree_clear_and_free_rune_a | Destroys red-black tree nodes for rune data and deallocates the tree structure (0x118 bytes). |
| 0x007D31F0 | 100 | STL_rbtree_node_string_dtor | Destructor for red-black tree node containing std::string; cleans up string data with stack canary protection |
| 0x007D3260 | 169 | STL_rbtree_clear_rune_map_a | Clears and deallocates a red-black tree storing rune map data; destroys all nodes and frees the tree structure. |
| 0x007D3320 | 169 | STL_rbtree_clear_rune_map_b | Clears red-black tree of rune map entries by destructing string nodes and freeing allocated tree structure memory |
| 0x007D41A0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; handles tree structure updates and color property maintenance. |
| 0x007D5920 | 94 | STL_rbtree_destroy_nodes_4c | Recursively destroys red-black tree nodes by traversing left subtree and deallocating 0x4c-byte node structures. |
| 0x007D5ED0 | 64 | std__list_12byte__free_node | Frees a 12-byte list node by deleting its allocated data pointer with stack canary protection. |
| 0x007D5F20 | 64 | std__list_12byte__free_node_v2 | Deallocates a 12-byte list node by freeing its dynamic memory allocation at offset +4. |
| 0x007D5F70 | 75 | std__list_12byte__free_node_safe | Safely deallocates a 12-byte list node by calling operator delete on offset +4 if non-null, with stack protection. |
| 0x007D5FC0 | 75 | std__list_12byte__free_node_safe_v2 | Safely deallocates a 12-byte list node by calling operator delete with stack canary protection (XOR cookie validation). |
| 0x007D6010 | 80 | std__map_4C__destroy_tree_recursive | Recursively destroys red-black tree nodes in std::map<int,int> by deallocating node memory with XOR stack canary protection. |
| 0x007D6090 | 74 | STL_rbtree_free_node_generic | Deallocates red-black tree node by freeing internal pointer and node structure itself with stack canary protection. |
| 0x007D6100 | 65 | STL_map_4C__clear_tree | Clears an STL map container by recursively destroying all nodes in its red-black tree structure. |
| 0x007DB020 | 10 | std__vector_12byte__throw_length_error | Throws std::length_error exception when vector size exceeds maximum allowed capacity |
| 0x007DB030 | 10 | std__vector_12byte__throw_length_error_v2 | Throws std::length_error exception when std::vector size exceeds maximum allowed length |
| 0x007DB040 | 95 | std__vector_12byte__aligned_allocate | Allocates aligned 12-byte vector elements with overflow checks; aligns to 32-byte boundary for large allocations. |
| 0x007DB0A0 | 165 | STL_doubly_linked_list_insert_node | Inserts a new node into doubly-linked list; maintains prev/next pointers and increments size counter |
| 0x007DB150 | 173 | STL_list_push_back_render_vertex_b | Inserts a render vertex into a doubly-linked list, allocating 16-byte nodes with position/color data, throws if list exceeds capacity. |
| 0x007DB200 | 118 | STL_vector_grow_and_init | Initializes STL vector with allocated capacity node; sets up vtable, size=0, and creates internal buffer management structure. |
| 0x007DB280 | 171 | STL_vector_shrink_or_free_a | Destructor that deallocates STL vector's internal buffer and resets capacity/size to zero. |
| 0x007DB360 | 171 | STL_vector_destructor_b | Destructor for STL vector that deallocates internal buffer and calls destructor on contained elements via callback. |
| 0x007E8080 | 10 | STL_Xlength_error_camera3d | Throws std::length_error exception when a vector allocation exceeds maximum size limit |
| 0x007E8090 | 54 | deallocate | STL allocator deallocate for GSISymbolEntry; frees memory with size validation and pool header adjustment for large allocations. |
| 0x007E8B10 | 131 | STL_iterator__get_string_and_cleanup | Retrieves a string from an STL iterator node (offset 0xC of the node), assigns it to a local std::string via assign_range, then cleans up temporary string buffers. Checks bounds against the container's end sentinel before accessing. |
| 0x007E95CE | 123 | STL_iterator__extract_string_and_cleanup | Extracts a C-string from the current STL iterator position (offset 0xC of the node), assigns it to a local std::string, and cleans up temporary string buffers. Similar to get_string_and_cleanup but with register-based iterator tracking. |
| 0x007E9960 | 10 | STL_Xlength_error_styling_shop | Throws std::length_error exception for vector allocation exceeding maximum size limit |
| 0x007E9A10 | 165 | STL_list_push_back_4byte | Inserts a 4-byte element into a bidirectional linked list node, updating size counter and maintaining forward/backward pointers. |
| 0x007EB260 | 449 | STL_vector_insert_with_reallocation | Reallocates and inserts element into STL vector, handling growth strategy and memory alignment for styling data |
| 0x007EB430 | 449 | STL_vector_insert_realloc_with_growth | Reallocates and grows STL vector for styling data, inserts new element at position, copies existing elements |
| 0x007EC810 | 83 | operator++ | STL tree iterator pre-increment operator; advances red-black tree node traversal to next in-order element |
| 0x007F7C80 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure and color properties. |
| 0x007F7E90 | 10 | STL_Xlength_error_vector_7e90 | Throws std::length_error exception for vector size overflow; called when vector allocation exceeds maximum size |
| 0x007F7EA0 | 10 | STL_Xlength_error_vector_7ea0 | Throws std::length_error exception when vector allocation exceeds maximum size limit |
| 0x007F7EB0 | 55 | deallocate | STL allocator deallocate wrapper; frees memory with overflow check, calls operator delete with adjusted pointer/size. |
| 0x007F7EF0 | 55 | deallocate | STL allocator deallocate wrapper; validates allocation size and delegates to operator delete with metadata offset handling |
| 0x007FA920 | 264 | std__vector_char__insert_reallocate | Reallocates and reorganizes std::vector<char> storage when inserting element, growing capacity by 1.5x or to fit new size |
| 0x007FB6C1 | 51 | std_string__assign_conditional | Conditionally assigns a string from one of two sources based on a flag. Selects between a stack-based string and a parameter string, then calls std_string__assign_range to copy the chosen content. |
| 0x007FCA7A | 131 | std_string__substr_and_cleanup | Extracts a substring from the source string and cleans up the original buffer. Takes a position and computes the remaining length, assigns the substring via std_string__assign_range, then frees the original string's heap allocation. |
| 0x007FE530 | 63 | std__string__find_char | Finds first occurrence of character in std::string starting at position, returns offset or -1 if not found |
| 0x007FE800 | 334 | std__vector_int__insert_reallocate | Reallocates and reorganizes std::vector<int> storage when inserting element, copying existing data around insertion point. |
| 0x007FE970 | 569 | std__vector_12__insert_reallocate | Reallocates and reorganizes a 12-byte element vector, inserting new capacity and moving existing elements to maintain vector integrity. |
| 0x007FEBB0 | 572 | std__vector_48__insert_reallocate | Reallocates and reorganizes a 48-byte element vector, inserting a new element at a specified position while maintaining capacity growth strategy. |
| 0x007FEDF0 | 436 | std__vector_8__insert_reallocate | Reallocates and inserts 8-byte elements into std::vector, copying existing elements and inserting new element at specified position. |
| 0x007FEFB0 | 131 | std__vector_char__assign_range | Assigns a range of bytes to a std::vector<char>, reallocating memory and copying data via memmove with XOR canary validation. |
| 0x007FF040 | 169 | STL_Vector_CopyElements_Stride3 | Copies 3 consecutive undefined4 values per iteration from source to destination vector, clearing source elements. |
| 0x007FF0F0 | 123 | std__vector_48__move_elements | Copies 48-byte elements from source to destination vector, iterating through param_1 until param_2, returning updated destination pointer. |
| 0x007FF170 | 119 | std__vector_48__copy_construct_element | Copies a 48-byte STL vector element by duplicating string and associated metadata from source to destination. |
| 0x007FF1F0 | 106 | std__pair_string__copy_ctor | Copy constructor for std::pair<string, string>; initializes both string members via STL copy assignment with exception handling. |
| 0x007FF6E0 | 191 | std__vector_int__copy_ctor_b | Copy constructor for std::vector<int>; allocates memory, copies elements from source vector to destination vector. |
| 0x007FFA40 | 161 | STL_vector_48byte__move_constructor | Move constructor for 48-byte vector; copies data pointers and clears source vector state. |
| 0x007FFAF0 | 90 | STL_vector_48byte__destroy_element | Destroys all std::string elements in a 48-byte STL vector by iterating and calling destructors (0x30-byte stride). |
| 0x007FFB50 | 77 | STL_vector_48byte__destroy_element_v2 | Destroys a std::string element within an STL vector, handling stack frame setup and XOR-based canary validation. |
| 0x007FFBA0 | 105 | CRT_string_exception_cleanup | Exception cleanup handler that destructs std::string objects during stack unwinding in RO client. |
| 0x007FFC10 | 105 | CRT_destroy_two_std_strings | Destroys two std::string objects with stack canary protection; likely cleanup for exception handling or scope exit. |
| 0x00800000 | 65 | STL_string_destructor_wrapper | Wrapper that destroys an STL string object with stack cookie validation and exception handling setup. |
| 0x00800050 | 171 | STL_optional_string_to_string | Converts optional string to std::string by extracting data range and assigning to destination string object. |
| 0x00800100 | 92 | STL_bitset_iterator_advance | Advances a bitset iterator by param_2 positions, updating both the word pointer and bit offset within the word. |
| 0x00805F81 | 541 | std_string__split_by_delimiter | Splits an std::string by a delimiter character. Extracts a substring starting at param_1, finds the delimiter using STL_String__Find, extracts the portion before the delimiter, and appends both parts to a vector of strings. Returns a pointer to the result vector. |
| 0x00806380 | 92 | STL_vector_12byte__move_element | Iterates through 12-byte vector elements (param_1 to param_2) and deallocates each, with stack canary protection. |
| 0x008063E0 | 92 | STL_vector_48byte__move_element | Destroys 48-byte STL vector elements by iterating and calling destructors on each std_string member in range. |
| 0x00806440 | 44 | STL_copy_8byte_elements_forward | STL template instantiation: STL copy 8byte elements forward |
| 0x00806470 | 45 | STL_relocate_8byte_elements | Relocates 8-byte elements (2x undefined4) from source to destination buffer with offset adjustment. |
| 0x008064A0 | 10 | STL_Xlength_error_vector_int_d | Throws std::length_error exception when vector allocation exceeds maximum allowed size limit |
| 0x008064B0 | 10 | STL_Xlength_error_vector_8byte_c | Throws std::length_error exception when vector size exceeds maximum allowable length |
| 0x008064C0 | 10 | STL_Xlength_error_vector_12byte_g | Throws std::length_error exception when a vector exceeds maximum allowed size during allocation |
| 0x008064D0 | 10 | STL_Xlength_error_vector_48byte | Throws std::length_error exception for vector size overflow; called when vector allocation exceeds max_size() |
| 0x008064E0 | 92 | STL_vector_int__grow_and_copy | Allocates aligned memory for integer vector growth, multiplying size by 4 and aligning to 32-byte boundaries with overflow checks. |
| 0x00806540 | 55 | deallocate | Deallocates memory block with size validation; checks alignment and delegates to operator delete |
| 0x00806580 | 55 | deallocate | Deallocates memory from phmap hash container with size validation; checks allocation header and calls operator delete. |
| 0x008065C0 | 54 | deallocate | STL allocator deallocate for GSI symbol entries; frees memory with size validation and alignment checks |
| 0x00806600 | 54 | deallocate | STL allocator deallocate for GSISymbolEntry; frees memory with size validation and heap metadata checks. |
| 0x00806D10 | 83 | operator++ | STL red-black tree iterator increment operator; advances to next node in sorted unsigned int set. |
| 0x00808340 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure and handles color property updates. |
| 0x00808550 | 129 | STL_map_lower_bound | Performs binary search tree traversal to find lower bound of string key in STL map node structure using character comparison. |
| 0x008085E0 | 355 | STL_list_deep_copy | Deep copies a doubly-linked list of CItemSlotNode elements, allocating new nodes and maintaining bidirectional pointers. |
| 0x00808750 | 234 | STL_map_copy_constructor | Copy constructor for STL red-black tree map; initializes tree structure and recursively copies all nodes from source map. |
| 0x00808960 | 105 | CItemSlotManager__RemoveItemNode | Removes and deallocates the last item node from a linked list structure, clearing item slot references before deletion. |
| 0x0080D1A0 | 145 | STL_list_erase_node | Removes a node from a doubly-linked list by unlinking it and freeing its memory allocation. |
| 0x0080D250 | 154 | STL_vector_copy_16byte_elements | Initializes a vector and copies 16-byte elements from source vector param_2 to destination vector param_1. |
| 0x008125E0 | 134 | STL_vector_16byte_allocate | Allocates aligned 16-byte element vector storage with 32-byte alignment for large buffers, initializes STL vector pointers. |
| 0x00812670 | 149 | STL_vector_0x4C_destructor | Destructs STL vector of 0x4C-byte vending items, calls CVendingManager__DestroyItemEntry for each element, deallocates memory |
| 0x008127E0 | 94 | STL_map_recursive_delete_nodes | Recursively deletes nodes in an STL map by traversing right subtree and deallocating each node (18 bytes). |
| 0x00812850 | 75 | STL_map_lower_bound_int | Finds the first map node with key >= search value in RB-tree, returns iterator with node/parent/side info |
| 0x008128A0 | 36 | STL_list_find_by_field2 | Searches a doubly-linked list for a node whose field[2] matches the target value, storing result in param_1. |
| 0x00812A40 | 64 | STL_map_node_delete_single | Deletes a single STL map node by freeing its allocated value (24-byte structure) via operator delete. |
| 0x00812A90 | 80 | STL_map_clear_and_delete_root | Clears and deallocates an STL map container, recursively deleting all nodes and freeing the root structure. |
| 0x00812B10 | 75 | STL_map_node_delete_single_2 | Deletes a single STL map node by deallocating its value (24-byte structure) at offset +4. |
| 0x00812B60 | 75 | STL_map_node_delete_single_3 | Deletes a single STL map node by freeing its allocated memory (24 bytes) with stack cookie validation. |
| 0x00812BB0 | 65 | STL_map_clear_wrapper | Wrapper that clears and deallocates all nodes in an STL map container with stack frame protection. |
| 0x00815160 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties and parent/child pointers |
| 0x00815370 | 95 | STL_vector_24byte_allocate | Allocates aligned memory for STL vector with 24-byte elements, with 32-byte alignment for sizes >=4096 |
| 0x008164A0 | 334 | STL_vector_int__insert_grow | Reallocates std::vector<int> with 1.5x growth factor during insertion, relocating elements via memmove. |
| 0x00816610 | 582 | STL_vector_0x34elem__insert_realloc | STL vector<0x34-byte element> insertion with reallocation; grows capacity and relocates elements when inserting at position. |
| 0x00816AB0 | 601 | STL_vector_0x1celem__insert_realloc | Reallocates and reorganizes STL vector of 0x1c-byte elements when inserting, managing capacity growth and element copying. |
| 0x00816D10 | 192 | STL_vector_0x1c__copy_elements | Copies vector elements of size 0x1c (28 bytes) from source to destination, clearing source after copy. |
| 0x00816DD0 | 123 | STL_vector_0x34__copy_range | Copies a range of 0x34-byte elements from param_1 to param_3, moving each element backward in the destination vector. |
| 0x00816E50 | 127 | STL_vector_0x1c__move_elements | Moves std::string ownership between two std::string objects using move semantics, clearing source and invalidating destination. |
| 0x00816ED0 | 129 | STL_vector_0x34__move_elements_with_string | Copies a 19-byte structure (string + metadata) from source to destination, likely for STL vector element relocation during reallocation. |
| 0x00816F60 | 181 | STL_vector_int__copy_construct | Copies integer vector contents from source to newly allocated destination, initializing vector structure with capacity. |
| 0x00817020 | 171 | STL_vector_0x34__move_constructor | Move constructor for 0x34-byte vector: transfers ownership of buffer and state from source to destination vector, clearing source. |
| 0x00818D30 | 64 | STL_map_node_delete_0xC | Deletes STL map node by freeing 12-byte payload at offset +4, with stack canary validation. |
| 0x00818D80 | 64 | STL_map_node_delete_0xC_v2 | Deletes STL map node by freeing 0xC-sized allocated data member at offset +4 with XOR stack canary protection. |
| 0x00818DD0 | 75 | STL_map_node_delete_0xC_v3 | Deletes a 0xC-sized STL map node by freeing its allocated memory at offset +4 with stack canary protection. |
| 0x00818E20 | 101 | STL_shared_ptr_delete_0x14 | Deallocates a shared_ptr managed object of size 0x14 bytes, calling vector deallocate then operator delete. |
| 0x00818EA0 | 91 | STL_vector_0x1C_destroy_strings | Destroys all std::string elements in a 0x1C-sized vector by iterating and calling destructors on each element. |
| 0x00818F00 | 90 | STL_vector_0x34_destroy_strings | Destroys vector of 0x34-sized elements by iterating and calling destructor on each std_string member. |
| 0x00818F60 | 74 | STL_map_clear_delete_0xC | Destroys STL map container by deallocating internal node (0xC bytes) and map structure itself with XOR canary protection. |
| 0x00819050 | 68 | STL_string_destructor_wrapper_4 | Wrapper that destructs an STL string with stack canary protection via XOR-based stack overflow detection. |
| 0x008190B0 | 184 | STL_vector_0x1C_destructor | Destroys STL vector of 0x1C-sized elements by invoking destructor on each string element before freeing allocated memory. |
| 0x00819180 | 171 | STL_vector_0x34_destructor | Destructor for STL vector container with 0x34-byte elements; deallocates all elements and backing memory. |
| 0x00819250 | 136 | STL_vector_0x1C_deallocate | Deallocates STL vector of 0x1C-sized elements, handling alignment and calling operator delete with size validation. |
| 0x00819300 | 86 | STL_string_pair_destructor | Destructs a pair of std::string objects by calling destructors on both string members with stack canary protection. |
| 0x00819360 | 65 | STL_string_destructor_wrapper_5 | Wrapper for std::string destructor with stack guard (XOR canary) and structured exception handling (SEH). |
| 0x00819C90 | 71 | STL_string_destructor_wrapper_6 | Destructor for CUIComponent class; sets up exception handling and calls parent destructor with canary validation. |
| 0x00819CE0 | 71 | STL_string_destructor_wrapper_7 | Destructor for CUITextInput class that cleans up strings and associated UI components before object destruction. |
| 0x00819D30 | 71 | STL_string_destructor_wrapper_8 | Destructor for CUIComponent class; performs stack canary validation and calls CUIComponent destructor via virtual method table. |
| 0x0081A3A0 | 28 | std_string__append_from_std_string | Appends string data from one std::string to another, handling small string optimization by dereferencing pointer if needed. |
| 0x0082010C | 701 | std_string__extract_and_process_tags | Iteratively extracts and processes tagged substrings from a source string. Uses _Traits_find to locate opening/closing tag delimiters, extracts content between them, updates a position counter, and moves-assigns the result back to the source. Continues until no more tags are found. |
| 0x0082868B | 99 | STL_rbtree__cleanup_and_erase_nodes | Cleans up an STL red-black tree container. Sets the node destructor to STL_rbtree_node_destructor_str, deallocates any associated vector storage, then erases and destroys two red-black tree node chains (28-byte elements). |
| 0x0082B1E9 | 202 | std_string__append_and_cleanup_two | Appends the contents of one std::string buffer to the destination string via std_string__append_buffer, then cleans up and frees both the source string and a secondary temporary string buffer. |
| 0x00832A40 | 93 | STL_vector_destruct_range_0x1c | Destructs array of 0x1c-byte elements (likely std::string pairs) by calling destructor on each element in range. |
| 0x00832AA0 | 92 | STL_vector_destruct_range_0x34 | Destructs range of 0x34-byte elements by calling std::string destructor on each; used for STL vector cleanup. |
| 0x00832B00 | 106 | STL_vector_int_deallocate | Deallocates STL vector<int> buffer, handling aligned allocations with metadata validation before calling operator delete. |
| 0x00832B90 | 64 | STL_vector_relocate_0x1c | Relocates STL vector elements (0x1c bytes each) via memmove, returns pointer past last moved element. |
| 0x00832BD0 | 10 | STL_Xlength_error_vector_int_e | Throws std::length_error exception for vector size overflow condition in STL vector operations |
| 0x00832BE0 | 10 | STL_Xlength_error_vector_1c_c | Throws std::length_error exception when vector allocation exceeds maximum allowed size limit |
| 0x00832BF0 | 10 | STL_Xlength_error_vector_0x34 | Throws std::length_error exception when a vector allocation exceeds maximum allowed size |
| 0x00832C00 | 10 | STL_Xlength_error_label_text | Throws std::length_error exception for vector capacity overflow in STL container operations. |
| 0x00832C10 | 92 | STL_vector_allocate_aligned_int | Allocates aligned memory for int vector; uses 32-byte alignment for sizes >=0x1000 bytes, stores raw pointer at offset -4. |
| 0x00832C70 | 95 | STL_vector_grow_checked_a | Allocates aligned memory for STL vector growth, multiplying capacity by 12 with 32-byte alignment for elements โฅ4KB. |
| 0x00832CD0 | 95 | STL_vector_grow_checked_b | Allocates aligned memory for STL vector of 20-byte elements with overflow checks and 32-byte alignment. |
| 0x00832D30 | 238 | STL_string_assign_fill | std::string::assign(size_t, char) - fills string with N copies of char, using SSO for small strings and 1.5x growth strategy |
| 0x00832EC0 | 55 | deallocate | STL allocator deallocate wrapper that frees memory blocks >4KB via operator delete with size validation |
| 0x00832F00 | 60 | STL_vector_1c_deallocate | Deallocates STL vector memory with 0x1c-byte elements, validating alignment before calling operator delete. |
| 0x00832F50 | 49 | STL_vector_0x34elem__deallocate | Deallocates STL vector memory for elements of 0x34 bytes, with bounds checking and aligned block deallocation. |
| 0x00832F90 | 60 | STL_vector_label_deallocate | Deallocates STL vector of label structs (0x1c bytes each), handling large allocations with overflow checks before freeing. |
| 0x00832FE0 | 69 | STL_list_erase_node_12byte | Removes and deallocates a 12-byte node from a doubly-linked list, updating prev/next pointers and decrementing list size. |
| 0x00833050 | 167 | STL_vector_erase_0x18 | Erases element from vector of 0x18-byte structs containing std::strings, shifting subsequent elements forward and decrementing size. |
| 0x00833100 | 383 | STL_vector_bool_erase | Erases a single bit from a std::vector<bool> by shifting subsequent bits left and updating size/capacity metadata. |
| 0x00833350 | 34 | STL_memmove_range_forward | Copies memory range from param_1 to param_3 by calculating size as (param_2 - param_1), returns end pointer of copied range. |
| 0x00833380 | 34 | STL_memmove_range_forward_b | Moves memory range from param_1 to param_3, returns new end pointer after copy operation. |
| 0x008333B0 | 34 | STL_memmove_range_forward_c | Moves memory range from param_1 to param_3, returning end pointer of destination buffer after copy. |
| 0x008333E0 | 166 | STL_list_int_insert | Inserts an integer value into a std::list node, allocating 12-byte doubly-linked list node with prev/next pointers and int value. |
| 0x00833490 | 276 | STL_vector_insert_ptr_00833490 | Inserts element into std::vector<int/ptr>, reallocates with 1.5x growth strategy, uses FID_conflict__Change_array deallocation path |
| 0x008335D0 | 571 | STL_vector_insert_element_0x1c | Inserts a 28-byte element into std::vector at specified position with 1.5x capacity growth and memory reallocation. |
| 0x00833820 | 276 | STL_vector_int__insert_grow_clientinfo | Reallocates std::vector<int> with 1.5x growth factor, inserts element at position, used by SelectClientInfo packet handlers. |
| 0x00833960 | 334 | STL_vector_insert_ptr | Inserts a 4-byte element into STL vector at specified position with 1.5x growth reallocation strategy. |
| 0x00833AD0 | 276 | STL_vector_grow_and_insert_4byte | Grows STL vector capacity and inserts 4-byte element at position, reallocating and moving existing data as needed. |
| 0x00833C10 | 551 | STL_vector_insert_0xc | Inserts element into std::vector<T> with 12-byte elements, reallocating with 1.5x growth factor and max capacity 0x15555555. |
| 0x00833E40 | 129 | STL_tree_destroy_recursive | Recursively destroys std::set/map red-black tree nodes, deallocating string data and node memory (0x30 bytes). |
| 0x00833ED0 | 75 | STL_rbtree_find_int_node | Red-black tree lower_bound search for integer key, returns iterator with comparison result and parent node |
| 0x00833F20 | 75 | STL_rbtree_find_string_node | Red-black tree node search by string comparison, returns iterator with found node and comparison result. |
| 0x00833F70 | 82 | STL_rbtree_free_node_html | Deallocates a red-black tree node by zeroing its right child pointer and freeing allocated memory (0x1d0 bytes). |
| 0x00834030 | 162 | STL_vector_move_relocate_0xc | Moves and zeros 12-byte elements from source range to destination, clearing source memory for non-trivial type semantics. |
| 0x008340E0 | 51 | STL_vector_swap_contents | Swaps contents of two 12-byte STL vectors (3x 4-byte elements) by copying all fields between them. |
| 0x00834120 | 242 | STL_set_int_insert | Inserts an integer into an std::set red-black tree, allocating a 0x30-byte node and rebalancing if no duplicate exists. |
| 0x00834250 | 141 | STL_rbtree_node_initialize | Initializes a red-black tree node by copying data from source to destination and clearing source node fields. |
| 0x008342E0 | 147 | STL_rbtree_node_copy_and_initialize | Copies red-black tree node data from source to destination and clears source node fields post-insertion. |
| 0x00834380 | 181 | STL_vector_int_copy_ctor_00834380 | std::vector<int> copy constructor that allocates buffer and copies integer elements via memmove from source vector |
| 0x008375D0 | 144 | STL_list_create_node_and_push | Initializes an STL list node structure with bidirectional pointers and clears associated metadata fields. |
| 0x00837750 | 64 | STL_list_clear_node_20byte_C | Deallocates a 20-byte node from an STL list by calling operator_delete on the node pointer at offset +4. |
| 0x008377A0 | 64 | STL_list_clear_node_20byte_D | Deallocates a 20-byte STL list node by freeing its allocated memory (0x30 bytes) with stack canary protection. |
| 0x008377F0 | 64 | STL_list_clear_node_20byte_E | Deallocates a 20-byte STL list node by calling operator_delete with size 0x30 on the pointer at offset +4. |
| 0x00837870 | 75 | STL_list_clear_node_12byte_C | Deallocates a 12-byte node in an STL list by calling operator_delete on the next pointer offset +4. |
| 0x008378C0 | 78 | STL_list_clear_node_12byte_D | Deallocates a 12-byte STL list node by calling operator_delete on offset+4, with stack canary validation. |
| 0x00837A10 | 123 | STL_tree_node_delete_0x30 | Destructs and deallocates a 0x30-byte std::set/map tree node containing a std::string key/value. |
| 0x00837B10 | 75 | STL_list_clear_node_12byte_E | Deallocates a 12-byte node from an STL list by calling operator_delete with size 0x30 on the pointer at offset +4. |
| 0x00837B60 | 75 | STL_list_clear_node_12byte_F | Clears and deallocates a 12-byte STL list node by freeing its allocated memory at offset +4. |
| 0x00837DB0 | 68 | STL_tree__destroy_and_delete_component | Destroys BST nodes recursively then deallocates the tree root node (0x30 bytes), with stack canary validation. |
| 0x00837F10 | 106 | STL_vector_int_deallocate_00837f10 | Deallocates STL vector<int> buffer with aligned memory management and integrity validation before operator delete. |
| 0x00837FB0 | 5 | STL_vector_0x18_dealloc | Deallocates an STL vector with 0x18-byte header, handling aligned memory blocks via operator delete with overflow checks. |
| 0x00837FC0 | 197 | STL_vector_destruct_and_dealloc_0x3c | Destructs and deallocates vector of 60-byte elements, calling destructors on two std::strings per element before deallocation. |
| 0x00838150 | 151 | STL_vector_deallocate_with_0xc_cleanup | Deallocates STL vector with 0xc-sized element cleanup; iterates and destroys each element before freeing memory. |
| 0x008389F0 | 118 | STL_tree__destroy_and_delete_component_b | Destroys a tree-based UI component (CUIListBox) by recursively freeing nodes and deallocating the tree structure with security cookie validation. |
| 0x00838A90 | 105 | STL_tree__destroy_and_delete_component_c | Destroys and deallocates a tree-based component (CUIListBox), recursively freeing nodes and releasing allocated memory. |
| 0x00838F60 | 118 | STL_tree__destroy_and_delete_component_d | Destroys and deallocates CUIListBox tree node structure, recursively freeing subtree and releasing 0x30 byte memory block |
| 0x0083A440 | 266 | STL_map_int_int__insert_or_find_2 | STL map node insertion/lookup for integer key-value pairs; finds or creates red-black tree node and returns pointer to value |
| 0x0083A550 | 269 | STL_map_int_string__insert_or_find | Inserts or finds int key in std::map<int, std::string>, allocates 0x30-byte node if missing, returns pointer to string value. |
| 0x00866DD0 | 87 | STL_Vector_ChangeArray | std::vector memory reallocation helper that manages buffer resizing and deallocation for dynamic arrays |
| 0x00866E30 | 139 | STL_vector_4byte_reserve_capacity | Reserves capacity for a 4-byte element vector; reallocates with growth strategy or allocates initial buffer. |
| 0x00866EE0 | 36 | STL_vector_0xc_destroy_range | STL template instantiation: STL vector 0xc destroy range |
| 0x00866F10 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color balance. |
| 0x00867120 | 517 | Insert_node | STL std::_Tree red-black tree node insertion with rebalancing; maintains binary search tree invariants and color properties. |
| 0x00867490 | 106 | STL_vector_0xc_dealloc | Deallocates STL vector memory with size 0xc bytes, handling aligned heap blocks and validating pointer metadata. |
| 0x00867520 | 106 | STL_vector_0x18_dealloc | Deallocates STL vector with 0x18-byte element size, handling aligned memory blocks via operator delete |
| 0x008675B0 | 64 | STL_vector_1C_memmove | Moves 1C-byte aligned elements within STL vector, returns pointer to end of moved range. |
| 0x008675F0 | 10 | STL_Xlength_error_vector_insert_ptr | Throws std::length_error exception when vector insertion would exceed maximum allowable length |
| 0x00867600 | 10 | STL_Xlength_error_vector_4byte | Throws std::length_error exception when vector size exceeds maximum allowed length |
| 0x00867610 | 10 | STL_Xlength_error_vector_0x1c | Throws std::length_error exception when vector allocation exceeds maximum size limit |
| 0x00867620 | 10 | STL_Xlength_error_vector_0xc | Throws std::length_error exception when a vector allocation exceeds maximum allowable size |
| 0x00867630 | 92 | STL_vector_grow_alloc_ptr | Allocates aligned memory for pointer vector with overflow checks; aligns to 32-byte boundary with metadata storage. |
| 0x00867690 | 92 | STL_vector_grow_alloc_4byte | Allocates aligned memory for 4-byte STL vector growth with 32-byte alignment and overflow checking. |
| 0x008676F0 | 95 | STL_vector_grow_alloc_A | Allocates aligned memory for STL vector growth with 32-byte alignment and overflow protection |
| 0x00867750 | 95 | STL_vector_grow_alloc_B | Allocates aligned memory for STL vector growth with 32-byte boundary alignment and overflow protection. |
| 0x008677B0 | 95 | STL_aligned_alloc_0x30 | Allocates aligned memory for arrays of 48-byte elements, with 32-byte alignment for large allocations (>=4096 bytes). |
| 0x00868C50 | 55 | STL_aligned_dealloc_4byte | Deallocates 4-byte aligned arrays, recovering original pointer for large allocations (>4KB) before freeing |
| 0x00868C90 | 55 | STL_aligned_dealloc_4byte_b | Deallocates STL aligned memory for 4-byte element arrays with validation of allocation metadata |
| 0x00868CD0 | 60 | STL_aligned_dealloc_0x1c | Deallocates aligned memory for arrays of 28-byte elements, validates alignment metadata, calls operator delete. |
| 0x00868D20 | 54 | STL_aligned_dealloc_0xc | Deallocates aligned memory for arrays of 12-byte elements, validating alignment before freeing via operator delete. |
| 0x008695B0 | 72 | STL_list_erase_node_0x1d0 | Removes a node from doubly-linked list by unlinking pointers, decrementing size, and freeing 0x1D0-byte allocation. |
| 0x00869670 | 192 | STL_string_find_first_not_of | Finds first character position in string not matching any char in given set, starting from offset param_3 |
| 0x00869730 | 192 | STL_string_find_first_of | Finds first character from charset in string starting at offset, returns index or -1; uses lookup table for O(n) search. |
| 0x00869AA0 | 36 | max_pair_by_second | Returns the pair with larger second element; if equal, returns pair with larger first element. Used for coordinate/position comparisons. |
| 0x0086A4E0 | 181 | STL_list_push_back_0x1d0 | Inserts 0x1D0-byte node into doubly-linked list with 0x8D3DCB max capacity; copies 456 bytes of data. |
| 0x0086A5A0 | 297 | STL_bitset_fill_range | Fills a bitset range with a boolean value by handling word-aligned memset and bit masking for partial words. |
| 0x0086AB00 | 208 | STL_string_rtrim | Removes trailing characters from std::string that match any byte in a charset; uses lookup table for O(n) efficiency. |
| 0x0086B5A0 | 47 | STL_std_string__equals | Compares two std::string objects for equality, handling SSO by dereferencing heap pointers when capacity exceeds 15 bytes. |
| 0x0086B5D0 | 116 | STL_map_node__recursive_destroy | Recursively destroys std::map BST nodes by traversing right child, destructing string values, and freeing 0x2c-byte nodes. |
| 0x0086B650 | 129 | STL_map__lower_bound | std::map::lower_bound for string keys; traverses BST returning iterator with node pointer, direction flag, and parent. |
| 0x0086B6E0 | 31 | STL_fill_range_u32 | Fills a memory range with a constant value using element-sized strides |
| 0x0086C990 | 64 | STL_map_node_delete_0x2c | Deletes a 0x2C-byte STL map node by freeing its value pointer at offset +4 with stack canary protection. |
| 0x0086CA40 | 86 | STL_vector_dealloc_4byte | Deallocates STL vector buffer with aligned pointer recovery and overflow validation before deletion. |
| 0x0086CAD0 | 57 | STL_map_destroy_tree_0x2c | Destroys STL map tree by recursively freeing all 0x2C-byte nodes, then deallocates sentinel node. |
| 0x0086CB30 | 110 | STL_map_node_destroy_with_string_0x2c | Destroys STL map node (0x2C bytes) by calling string destructor on member at offset +4, then frees node. |
| 0x0086CBB0 | 75 | STL_map_node_free_0x2c | Deallocates a 0x2C-byte STL map node, checking validity at offset +4 before calling operator delete with stack canary protection. |
| 0x0086CC00 | 142 | STL_map_node_clear_and_free_0x34 | Clears STL map node's child count, recursively destroys child subtree, frees 0x34-byte node allocation |
| 0x0086CCB0 | 68 | STL_map_destroy_tree_0x2c_b | Destroys STL map tree structure with 0x2C-byte nodes by recursively freeing all nodes then deallocating root. |
| 0x0086CD10 | 65 | STL_string_dtor_wrapper | Exception-safe wrapper that invokes std::string destructor with stack cookie validation for safe cleanup |
| 0x0086CD60 | 80 | STL_string_dtor_at_offset8 | Destroys std::string member at offset +8 from given address, with SEH exception handling frame setup. |
| 0x0086CDB0 | 87 | STL_container_cleanup_vec_map | Cleans up STL vector (4-byte elements) and map (0x34-byte nodes) by deallocating and freeing memory with stack canary protection. |
| 0x0086DB70 | 184 | STL_pair_move_assign_2strings | Move-assigns two std::string members from source pair to destination pair, destructing old strings and clearing source. |
| 0x0086DC30 | 331 | STL_map_insert_or_find_string_key | Inserts or finds string key in STL map, allocating tree node if key doesn't exist, returns iterator offset. |
| 0x0086DD80 | 294 | STL_map_insert_or_find_string_key_b | Inserts or finds a string key in STL map; returns pointer to value node, allocates new node if key doesn't exist. |
| 0x0086DEB0 | 83 | operator++ | STL red-black tree iterator pre-increment operator; advances to next node in sorted unsigned int set |
| 0x0086F4B0 | 128 | assign_cstring_to_std_string | Assigns a C-string to an std::string by calculating length and calling std_string__assign_range |
| 0x008703E0 | 93 | assign_cstring_length_to_std_string | Calculates C-string length via null-terminator scan, then assigns string content to std::string object using range assignment. |
| 0x00889BB0 | 317 | STL_vector_int__resize_fill_aligned | Resizes std::vector<int> to param_2 size, allocating aligned memory (32-byte) if needed and filling with param_3 value. |
| 0x0088A100 | 704 | STL_rbtree_insert_and_rebalance | Red-black tree node insertion with rebalancing; maintains RB-tree invariants via rotations and color adjustments. |
| 0x0088A440 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color balance. |
| 0x0088A650 | 84 | STL_rbtree_rotate_left_3 | Red-black tree left rotation: rebalances tree by rotating node left, updating parent and child pointers |
| 0x0088A700 | 16 | STL_vtable_setter_0088a700 | Sets virtual table pointer for SetPointer class instance to enable polymorphic behavior |
| 0x0088A710 | 16 | STL_vtable_setter_0088a710 | Sets virtual function table pointer for an STL container or object to InitVirtualFunctionPointer at 0x01031da8 |
| 0x0088A720 | 16 | STL_vtable_setter_0088a720 | Sets virtual method table pointer for STL container or game object initialization |
| 0x0088A730 | 88 | STL_tree_rotate_node | Performs right rotation on a red-black tree node, updating parent pointers and maintaining tree structure invariants. |
| 0x0088A810 | 296 | STL_vector_of_vectors_1C__destroy | Destroys a 2D vector of std::string objects; deallocates inner vectors then outer container with proper size tracking. |
| 0x0088AA70 | 21 | STL_num_put_do_put_wrapper | Wrapper that delegates to STL_num_put_do_put_ptr for numeric formatting output operations |
| 0x0088AA90 | 171 | STL_unordered_map_rehash_2 | Moves unordered_map state from param_3 to param_1, clearing param_3's buckets and resetting to small state. |
| 0x0088ABD0 | 202 | FNV1a_hash_compute | Computes FNV-1a hash of buffer data using magic constants 0x811c9dc5 and 0x1000193 with additional mixing |
| 0x0088B060 | 34 | STL_memmove_range_A | Copies memory from param_1 to param_3 for (param_2 - param_1) bytes, returns end pointer of destination. |
| 0x0088B090 | 34 | STL_memmove_range_B | Copies memory range [param_1, param_2) to param_3, returns pointer to end of copied data. |
| 0x0088B0C0 | 34 | STL_copy_range_to_destination | Copies a range of memory from param_1 to param_2 into param_3, returns end iterator of destination. |
| 0x0088B190 | 366 | STL_map_insert_node | Inserts a new node into an STL map, performing BST traversal to find insertion position and rebalancing the tree structure. |
| 0x0088B300 | 343 | std__vector_1C__insert_grow_copy | Grows std::vector<T> capacity (1.5x factor) and inserts 0x1C-byte element at specified position using copy constructor. |
| 0x0088B490 | 346 | std__vector_1C__emplace_back_grow | Grows std::vector<T> (28-byte elements) by 1.5x, relocates existing elements, inserts new element at position. |
| 0x0088B620 | 536 | STL_vector_30byte__erase_and_relocate | Erases element from 30-byte struct vector, reallocates with growth strategy, relocates remaining elements while preserving order. |
| 0x0088B850 | 508 | STL_vector_0C__erase_and_relocate | STL vector insert operation: allocates new buffer, copies elements before/after insertion point, inserts new element, deallocates old buffer. |
| 0x0088BA60 | 449 | STL_vector_grow_and_insert | Inserts element into STL vector, reallocates with 1.5x growth, copies old data before/after insertion point. |
| 0x0088BC30 | 343 | std__vector_1C__insert_grow_move | Inserts a 0x1C-byte element into std::vector with capacity growth, relocating existing elements using move semantics. |
| 0x0088BDC0 | 94 | STL_rbtree_destroy_nodes_18byte | Recursively destroys red-black tree nodes by traversing left subtree and deallocating 24-byte node structures. |
| 0x0088BE30 | 119 | STL_rbtree_destroy_nodes_1C_byte | Recursively destroys red-black tree nodes; deallocates left subtree, deletes node pair, and frees 28-byte node structure. |
| 0x0088BEC0 | 158 | STL_unordered_map_find_by_string_key | Finds a node in an STL unordered_map by string key, returns iterator pair with node pointer and found flag. |
| 0x0088BF60 | 75 | STL_rbtree_lower_bound_2 | STL red-black tree lower_bound search traversing tree nodes by comparing key against node values at offset +0x10 |
| 0x0088C1B0 | 496 | STL_unordered_map_insert | Inserts a key-value pair into an unordered_map with string keys, handling rehashing and load factor management. |
| 0x0088C3B0 | 137 | STL_vector_1C_copy_element | Copies vector elements of size 28 bytes (7 x 4-byte units) from source to destination, including string field assignment. |
| 0x0088C440 | 192 | STL_vector_1C_relocate_elements | Relocates elements from source vector to destination, copying 28-byte structures and clearing source entries. |
| 0x0088C500 | 82 | STL_vector_1C_copy_construct_element | Copies a 28-byte (0x1C) struct element with string field, performing deep copy of string via STL_string_copy_assign. |
| 0x0088C560 | 68 | STL_string_move_construct_from_cstring | Constructs an STL string object via move semantics, initializing from a null-terminated C string pointer. |
| 0x0088C5B0 | 127 | STL_vector_1C_move_elements | Move-semantics transfer of 28-byte vector state (data ptr, size, capacity) from source to destination, clearing source. |
| 0x0088C6B0 | 97 | fill<> | STL std::fill template instantiation for filling std::list iterators with values (unsigned int, string, pair types) |
| 0x0088C830 | 393 | STL_list_copy_with_strings | Copies a doubly-linked list of STL strings, allocating new nodes and deep-copying string data from source to destination list. |
| 0x0088CB20 | 158 | STL_vector_byte_construct_fill | Constructs std::vector<byte> by allocating buffer and filling with repeated byte value; used for packet/buffer initialization. |
| 0x0088E590 | 190 | CUIWndWithRBTree__Constructor | Initializes CUIWndWithRBTree object with default RB-tree state, zeroes item table and UI component fields. |
| 0x0088FFD0 | 106 | stl_vector_dealloc_4byte_ffd0 | Deallocates STL vector memory with 4-byte element alignment, handling aligned allocation metadata. |
| 0x00890060 | 128 | stl_vector_dealloc_48byte | Deallocates STL vector of 48-byte elements with overflow detection and aligned memory block freeing. |
| 0x00890110 | 127 | stl_vector_dealloc_12byte | Deallocates STL vector of 12-byte elements with overflow check and aligned memory deallocation via operator delete. |
| 0x00891F60 | 83 | operator++ | STL red-black tree iterator pre-increment operator; advances to next node by traversing right subtree or parent chain. |
| 0x0089D340 | 259 | STL_map_int_short__insert_or_find | Inserts or finds a node in a red-black tree-based std::map<int,short>, returning the value at offset +5 of the node. |
| 0x008CFCB0 | 204 | std__string__truncate_at_delimiter | Truncates a std::string at the first occurrence of a delimiter string, keeping only the prefix before the delimiter. |
| 0x008D13E0 | 136 | std__vector_12__reserve | Allocates and initializes vector storage for 12-byte elements with aligned allocation for sizes >=0x1000 bytes. |
| 0x008D1470 | 227 | std__vector_1C__destroy_and_replace | Destroys all std::vector elements (28-byte structs with embedded strings), frees allocation, replaces with new buffer pointers. |
| 0x008D1560 | 93 | std__vector_1C__destroy_range | Destroys a range of std::string objects in a vector by calling destructor on each element from param_1 to param_2. |
| 0x008D15C0 | 721 | STL_unordered_map__rehash_B | Rehashes an STL unordered_map by reallocating and reinitializing its internal bucket array to a larger power-of-2 size. |
| 0x008D18A0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure and color properties after inserting a new node |
| 0x008D1AB0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color invariants. |
| 0x008D1CC0 | 184 | std__vector_1C__clear_and_free | Clears and deallocates a vector of 0x1C-byte elements (likely std::string objects based on destructor calls) |
| 0x008D1D90 | 58 | std__vector_30__relocate | Relocates a vector of 48-byte (0x30) elements by moving memory and returning adjusted destination pointer. |
| 0x008D1DD0 | 55 | STL_Vector12_Relocate | Relocates vector<12-byte elements> data, moves param_2-param_1 bytes from param_1 to param_3, returns new end pointer. |
| 0x008D1E10 | 10 | std__vector__throw_length_error | Throws std::length_error exception when vector size exceeds maximum allowed capacity |
| 0x008D1E20 | 10 | std__vector__throw_length_error_2 | Throws std::length_error exception for vector capacity overflow; STL error handler for invalid allocation sizes |
| 0x008D1E30 | 10 | std__vector__throw_length_error_3 | Throws std::length_error exception when vector size exceeds maximum allowed capacity limit |
| 0x008D1E40 | 10 | std__vector__throw_length_error_4 | Throws std::length_error exception when vector size exceeds maximum allowed capacity limit. |
| 0x008D1E50 | 10 | std__vector__throw_length_error_5 | Throws std::length_error exception when std::vector allocation exceeds maximum allowed size |
| 0x008D1E60 | 102 | std__vector_1C__allocate_buffer | Allocates aligned buffer for std::vector with 0x1C-byte elements, aligning to 32-byte boundary for large allocations. |
| 0x008D1F80 | 46 | STL_vector_string_0x18_clear | Clears a std::vector<std::string> by destructing each 0x18-byte string element and resetting size to 0. |
| 0x008D2180 | 55 | deallocate | STL allocator deallocate wrapper; validates heap pointer bounds before freeing memory block of (param_2 * 4) bytes. |
| 0x008D21C0 | 54 | deallocate | STL allocator deallocate for GSISymbolEntry; frees memory with overflow validation and size adjustment. |
| 0x008D2200 | 60 | std__vector_1C__deallocate_buffer | Deallocates vector buffer of 28-byte elements, validating alignment and delegating to operator delete |
| 0x008D2250 | 54 | deallocate | STL allocator deallocate for GSISymbolEntry; frees memory with optional header adjustment for large blocks. |
| 0x008D2370 | 170 | STL_list__push_back_with_grow | Appends node to intrusive doubly-linked list with capacity check; throws if size reaches max (0x7ffffff) |
| 0x008D2420 | 39 | std__vector_int__push_back | std::vector<int>::push_back - appends element to vector, reallocates if capacity exceeded |
| 0x008D2450 | 39 | std__vector_int__push_back_2 | std::vector<int> push_back implementation with fast path for reserved capacity, fallback to reallocation if full |
| 0x008D2480 | 169 | STL_vector_1C__push_back_with_grow | Pushes 28-byte element to STL vector; copies data and advances buffer pointer, or calls grow handler if full |
| 0x008D3DA0 | 141 | STL_map__ClearAllElements_WithConditionalCallbacks | Iterates 16 map elements, clears flag at offset 0x2b, invokes vtable method at offset 0x98, conditionally processes 2 extra elements based on game state. |
| 0x008D3E30 | 149 | STL_map__DefaultConstruct_76byte | Initializes STL map node (76 bytes) with zero-initialized buckets and sets internal pointers to null state. |
| 0x008D3ED0 | 418 | STL_list_assign_range_12byte | STL list assign operation that replaces contents with range [param_2, param_3), managing 12-byte nodes with bidirectional links |
| 0x008D40A0 | 399 | STL_vector_assign_range_8byte | Assigns a range of 8-byte elements to an STL vector, reallocating capacity if needed and preserving existing elements. |
| 0x008D4250 | 34 | std__vector__relocate_trivial | Relocates trivially-copyable vector elements via memmove, returns new end iterator position. |
| 0x008D4280 | 238 | STL_tree_copy_nodes_24byte | Recursively copies binary search tree nodes with 24-byte elements, preserving structure and color information. |
| 0x008D4390 | 241 | STL_tree_copy_nodes_88byte | Recursively copies binary search tree nodes (88-byte elements) from source to destination tree structure with proper parent/child linkage. |
| 0x008D44A0 | 250 | STL_tree_copy_nodes_36byte | Recursively copies STL tree nodes (36-byte elements) from source to destination, initializing node structure and left/right subtrees. |
| 0x008D45C0 | 420 | STL_map_string_emplace | Inserts or finds a node in a map<string, vector> container, returning iterator and success flag in param_2. |
| 0x008D4770 | 330 | STL_vector_string_insert_24byte | Inserts a 24-byte STL string element into vector at specified position, reallocating storage if needed. |
| 0x008D48F0 | 449 | STL_vector_insert_4byte_v2 | STL vector insert operation for 4-byte elements with capacity growth and memory alignment handling at offset param_2 |
| 0x008D4AC0 | 595 | STL_vector_60byte__emplace_grow | STL vector reallocation with 1.5x growth factor, element insertion at position, and old buffer deallocation for 60-byte elements. |
| 0x008D4D20 | 449 | STL_vector_insert_4byte | Inserts a 4-byte element into STL vector at specified position, reallocating and copying data as needed. |
| 0x008D4EF0 | 489 | STL_vector_insert_28byte | Inserts a 28-byte element into STL vector, reallocating storage and moving existing elements as needed. |
| 0x008D5190 | 84 | STL_tree__DeleteNode_and_cleanup | Destruys STL tree node with conditional cleanup of child nodes, deallocates node and parent structs. |
| 0x008D5210 | 94 | STL_tree__DeleteSubtree_recursive | Recursively deletes binary tree nodes by post-order traversal (right subtree first), then deallocates node memory. |
| 0x008D5280 | 94 | STL_tree__DeleteSubtree_recursive_B | Recursively deletes all nodes in a binary tree subtree by performing post-order traversal and deallocating each node. |
| 0x008D52F0 | 148 | STL_rbtree__DestroyNodes_with_string | Recursively destroys red-black tree nodes containing std::string values by traversing left subtree and deallocating node memory. |
| 0x008D5390 | 129 | STL_rbtree__DestroyNode_with_string_key | Recursively destroys red-black tree nodes, deallocating string keys and node memory (0x58 bytes). |
| 0x008D5420 | 119 | STL_rbtree__DestroyNode | Recursively destroys red-black tree nodes; deallocates node memory after destroying left subtree. |
| 0x008D54B0 | 94 | STL_rbtree__DestroyNodes_simple | Recursively destroys red-black tree nodes by traversing right subtree then deallocating node memory. |
| 0x008D5520 | 141 | STL_rbtree__DestroyNodes_with_string_C | Recursively destroys red-black tree nodes containing std::string values, deallocating each node after string cleanup. |
| 0x008D55C0 | 116 | STL_rbtree__DestroyNodes_with_string_recursive | Recursively destroys red-black tree nodes containing std::string, deallocating left subtree and string data. |
| 0x008D5640 | 132 | STL_rbtree__DestroyNodes_with_string_vec | Recursively destroys red-black tree nodes containing std::string elements, freeing memory bottom-up. |
| 0x008D56D0 | 94 | STL_rbtree__DestroyNodes_simple_B | Recursively destroys red-black tree nodes by traversing right subtree and deallocating node memory via operator delete. |
| 0x008D5740 | 129 | STL_rbtree__DestroyNodes_with_string_E | Recursively destroys red-black tree nodes containing std::string elements, deallocating memory for each node. |
| 0x008D57D0 | 94 | STL_rbtree__DestroyNodes_simple_C | Recursively destroys red-black tree nodes by traversing left subtree and freeing each node with operator_delete. |
| 0x008D5860 | 75 | std__map__lower_bound_int | STL map lower_bound operation on integer keys; finds first element >= search key in balanced tree |
| 0x008D58B0 | 75 | std__map__lower_bound_int_2 | STL map lower_bound implementation for integer keys; finds first element >= search value in RB-tree |
| 0x008D5900 | 75 | std__map__lower_bound_int_3 | STL map lower_bound implementation for int keys; traverses red-black tree to find first element >= search key |
| 0x008D5950 | 129 | STL_map_string__LowerBound_8byte | Performs binary search lower_bound on std::map<string, 8-byte_value> using in-order tree traversal with string comparison. |
| 0x008D59E0 | 129 | STL_map_string__LowerBound_12byte | Performs binary search lower_bound on STL map with string keys, returns iterator to first element >= search key |
| 0x008D5A70 | 119 | STL_map__EraseNode_with_string | Erases and deallocates an STL map node containing a string key-value pair, cleaning up associated memory. |
| 0x008D5AF0 | 28 | std__map__empty | Checks if std::map container is empty by testing if internal node pointer is null |
| 0x008D5B10 | 123 | STL_vector_60byte__MoveElementsForward | Moves 60-byte vector elements forward by constructing each element and advancing destination pointer by element size. |
| 0x008D5B90 | 191 | STL_vector_28byte__MoveElements | Moves elements from source to destination vector, clearing source and preserving 7-DWORD struct data via move semantics. |
| 0x008D5C50 | 123 | STL_vector_60byte__CopyAssignElement | Copies a 60-byte structure element (likely game entity/item data) from source to destination via STL vector assignment. |
| 0x008D5CD0 | 132 | STL_vector_28byte__CopyAssignElement | Copies a 28-byte STL vector element, clearing source after move, with SEH frame setup for exception handling. |
| 0x008D5DF0 | 36 | std__list__find_by_field | Finds and returns iterator to list node where field at offset +8 matches target value, or end sentinel if not found. |
| 0x008D5E50 | 297 | STL_map_int_emplace_16byte | STL map emplace operation for int keys with 16-byte values; inserts node or returns existing iterator and bool. |
| 0x008D5FF0 | 234 | STL_tree_copy_ctor_24byte | Copy constructor for STL red-black tree node (24-byte size); initializes tree structure and recursively copies all nodes from source tree. |
| 0x008D6150 | 234 | STL_tree_copy_ctor_88byte | Copies an STL red-black tree node structure (88 bytes), initializing sentinel nodes and recursively duplicating all child nodes. |
| 0x008D6240 | 148 | STL_tree__CopyNode_88byte | Copies an 88-byte STL tree node by duplicating all members including string, integers, and binary data fields. |
| 0x008D62E0 | 250 | STL_vector_copy_ctor_28byte | Copy constructor for STL vector of 28-byte elements; allocates capacity and deep-copies each element via STL_string_copy_assign |
| 0x008D69D0 | 169 | STL_vector_60byte__MoveConstruct | Move constructs 60-byte STL vector by copying data members and zeroing source vector state. |
| 0x008D6A80 | 178 | STL_map__CopyNodeStrings | Copies multiple STL string fields from source node to destination node, handling 6 string members at fixed offsets plus metadata. |
| 0x008D8860 | 127 | STL_map__EraseNode_with_string_B | Erases and deallocates a map node containing a string key-value pair, cleaning up resources via destructor. |
| 0x008D89C0 | 80 | STL_map__ClearTree_simple | Clears STL map tree by recursively deleting subtree and freeing node memory with XOR cookie validation. |
| 0x008D8CC0 | 81 | STL_map__ClearTree_with_string | Recursively destroys a red-black tree node and deallocates memory for STL map with string keys during cleanup. |
| 0x008D94A0 | 54 | STL_map__EraseAndDelete | Erases a node from an STL map container and deallocates its memory, including string key cleanup. |
| 0x008D96E0 | 68 | STL_map__ClearTree_with_vector | Destroys red-black tree nodes and deallocates STL map container memory (20 bytes). |
| 0x008D9740 | 66 | STL_map__ClearTree_simple_B | Clears a binary search tree node and recursively deletes all child nodes in a map container. |
| 0x008D9790 | 68 | STL_map__ClearTree_with_string_B | Clears and deallocates an STL red-black tree node structure, destroying all string-keyed map entries before freeing memory. |
| 0x008D9A80 | 106 | STL_vector__BoundsCheckDelete | Deallocates STL vector memory with bounds validation; handles aligned allocations and guard zones. |
| 0x008D9B10 | 181 | STL_vector__BoundsCheckDelete_with_string | Destructs and deallocates a vector of std::string objects with bounds checking and memory validation. |
| 0x008D9BF0 | 93 | STL_vector__EraseWithStringCleanup | Destructor for STL vector that safely cleans up string elements before erasing vector contents. |
| 0x008D9C50 | 114 | STL_vector__StringElement__Destructor | Destructor for vector element containing std::string; calls string destructors and bounds check cleanup. |
| 0x008DA630 | 92 | STL_map__ClearTree_with_vector_B | Destroys red-black tree nodes and deallocates memory for STL map container cleanup with vector element deletion. |
| 0x008DAA90 | 263 | STL_map_int_subscript_24byte | STL map operator[] for int keys with 24-byte values; finds/inserts node and returns value pointer. |
| 0x008DABA0 | 239 | STL_map_int_subscript_76byte | STL map subscript operator for 76-byte values; inserts new node if key doesn't exist, returns reference to value |
| 0x008DAC90 | 272 | STL_map_int_subscript_88byte | STL map subscript operator for int keys with 88-byte values; inserts new node if key doesn't exist, returns reference to value |
| 0x008DADB0 | 276 | STL_map_string_subscript_8byte | STL map operator[] for string keys with 8-byte values; inserts new node if key not found, returns reference to value. |
| 0x008DAED0 | 308 | STL_map_string_subscript_12byte | STL map operator[] for string keys with 12-byte values; inserts new node if key doesn't exist, returns value reference |
| 0x008DB010 | 83 | operator++ | STL tree iterator pre-increment operator; advances to next node in red-black tree traversal by following right subtree or parent pointers |
| 0x008DB070 | 83 | operator++ | STL red-black tree iterator pre-increment operator; advances to next in-order node by traversing right subtree or parent chain |
| 0x008DB0D0 | 83 | operator++ | STL red-black tree iterator pre-increment operator; advances to next in-order node by traversing right subtree or parent chain. |
| 0x008DB130 | 111 | STL_vector__EraseWithStringCleanup_C | Destructor for STL vector that cleanups string elements and optionally deallocates the vector object itself. |
| 0x008DB1B0 | 132 | STL_vector__EraseWithStringCleanup_D | Destructor for STL vector that erases elements and cleans up string data before optional deallocation |
| 0x008DBAB0 | 92 | STL_map__ClearTree_with_vector_ScalarDel | Destroys RB-tree nodes and deallocates memory for STL map cleanup with scalar element deletion. |
| 0x008DC000 | 200 | STL_map_string__AccumulateVector2_8byte | Finds string key in map, accumulates paired float[2] values into four int accumulators (bounds/totals). |
| 0x008E18F0 | 87 | FindNextActiveMapEntry | Iterates through STL map to find next entry where offset+0x2c flag is set, returns value from indexed array. |
| 0x008E1A40 | 175 | MapCell__GetIndexFromCoordinates | Validates and converts 2D map coordinates to linear cell index within a grid-based container structure. |
| 0x008E2E60 | 101 | STL_map__EraseNodeByKey | Erases all nodes from an STL map container and resets internal state (size, pointers, flags) |
| 0x008E4650 | 169 | STL_map_string__FindKey_12byte | Searches for a key in an STL map<string, 12-byte_value>, returns true if key found via LowerBound comparison. |
| 0x00907A00 | 92 | STL_vector_3C__DestroyRange | Destroys range of 0x3C-byte elements in std::vector by iterating and calling destructor on each. |
| 0x00907A60 | 92 | STL_vector_1C__DestroyElements | Destroys range of std::vector elements (0x1C bytes each) by calling destructor on each std::string member. |
| 0x00907AC0 | 704 | STL_RBTree__EraseNode | Removes a node from red-black tree with rebalancing, handling successor relinking and color fixup via rotations. |
| 0x00907DB0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains BST properties and color invariants. |
| 0x00907FC0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color invariants. |
| 0x009081D0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color balance |
| 0x009083E0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color invariants. |
| 0x009085F0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color balance |
| 0x00908800 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color invariants. |
| 0x00908A10 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree invariants and color properties. |
| 0x00908C20 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree balance property and updates parent pointers. |
| 0x00908E30 | 84 | STL_RBTree__RotateLeft | Performs left rotation on red-black tree node, updating parent pointers and handling root case via tree header. |
| 0x00908E90 | 88 | STL_RBTree__RotateRight | Performs right rotation on red-black tree node, updating parent pointers and handling root rebalancing case. |
| 0x00908EF0 | 183 | STL_vector_1C__Destructor | Destructs std::vector of 0x1C-byte elements (likely containing std::string), deallocating all strings and buffer memory. |
| 0x00908FC0 | 10 | STL_vector__ThrowLengthError_1 | Throws std::length_error exception when std::vector allocation exceeds maximum allowed size limit. |
| 0x00908FD0 | 10 | STL_vector__ThrowLengthError_2 | Throws std::length_error exception for STL vector overflow; terminates on vector size exceeds max_size() |
| 0x00908FE0 | 10 | STL_Xlength_error_vector_28byte | Throws std::length_error exception when vector size exceeds maximum allowed length during allocation |
| 0x00908FF0 | 102 | STL_vector_28byte__GrowAndAllocate | Allocates aligned 28-byte element vector storage with growth factor, aligns to 32-byte boundary for cache efficiency. |
| 0x00909150 | 33 | STL_rbtree_string_clear | Clears a red-black tree container with string keys by destroying all nodes and resetting pointers and size. |
| 0x009092C0 | 55 | deallocate | STL allocator deallocate wrapper that validates heap metadata and frees memory blocks, checking for corruption. |
| 0x00909300 | 57 | STL_vector_60byte__Delete | Deletes a 60-byte vector element at index param_2 with bounds checking and memory deallocation. |
| 0x00909350 | 60 | STL_vector__BoundsCheckDelete_B | Deallocates STL vector memory with bounds validation; checks allocation size against threshold (0xfff) before operator delete. |
| 0x00909530 | 170 | UIWindowMgr__DoublyLinkedList_InsertAndCopy | Inserts a copy-constructed UIWindowMgr item into a doubly-linked list, growing capacity if needed; throws if list exceeds size limit. |
| 0x009095E0 | 173 | STL_list__InsertNode_UIWndMapData | Inserts a new UIWndMapData node into intrusive linked list, throws if capacity exceeded (0x4ec4ec nodes max) |
| 0x00909690 | 39 | STL_vector_4byte_push_back | STL vector push_back for 4-byte elements; appends to buffer if space available, otherwise reallocates. |
| 0x0090C110 | 34 | STL_memmove_range_D | Copies memory range from param_1 to param_2 into param_3, returns new end pointer after copy. |
| 0x0090C300 | 582 | STL_vector_1C__grow_and_insert | STL vector grow-and-insert for 28-byte elements using 1.5x growth strategy with aligned allocation and element relocation. |
| 0x0090C550 | 94 | STL_rbtree__DestroyNodes_simple_D | Recursively destroys red-black tree nodes by traversing right subtree and freeing node memory. |
| 0x0090C610 | 91 | STL_vector_1C__CopyAssign_with_string | Copies a string-containing STL vector element by assigning string and copying 24-byte capacity/size metadata. |
| 0x0090C670 | 23 | STL_vector_init_empty_B | Initializes an empty STL vector by zeroing three pointer fields (data, size, capacity). |
| 0x0090D120 | 98 | STL_string__ConstructFromCStr | Constructs std::string from C-string by initializing SSO buffer and assigning via range assignment. |
| 0x0090D1B0 | 99 | STL_string__DefaultConstruct | Initializes an STL string object to empty state with small string optimization (SSO) buffer, sets capacity flag to 0xF |
| 0x0090D220 | 80 | STL_set__DestroyTree | Destroys an STL set/tree structure by recursively freeing nodes and deallocating the tree header with XOR stack canary validation. |
| 0x0090D2C0 | 65 | STL_set__Destructor | Destroys STL set container by recursively deallocating tree nodes; includes stack canary validation for security. |
| 0x0090D310 | 151 | STL_vector_1C__ClearAndFree | Destroys and deallocates std::vector<UISkillWnd_StringElement> (0x1C-byte elements) with bounds validation. |
| 0x0090D3D0 | 106 | STL_vector_20__DeallocateBuffer | Deallocates STL vector buffer memory, handling aligned allocation headers and validating heap integrity before deletion. |
| 0x00917470 | 91 | STL_vector_32byte__reassign_buffer | Reallocates 32-byte element vector buffer; handles null initialization and deallocates old buffer with proper size alignment. |
| 0x00917500 | 136 | STL_vector_32byte__reallocate_copy | Reallocates and copies 32-byte-aligned STL vector buffer with exception handling via SEH frame setup. |
| 0x009175B0 | 164 | STL_vector_1C__copy_range_with_string | Copies a range of 0x1C-byte skill elements from source to destination vector, copying embedded strings and preserving metadata. |
| 0x00917660 | 162 | STL_vector_1C__move_range_with_string | Moves a range of STL vector elements (0x1c-sized structs with strings) from param_2 to param_4, copying strings and metadata. |
| 0x00917710 | 10 | STL_Xlength_error_vector_1C_grow | Throws std::length_error exception when vector capacity exceeds maximum allowable size limit |
| 0x00917720 | 10 | STL_Xlength_error_tooltip_line | Throws std::length_error exception when vector allocation exceeds maximum allowed size limit. |
| 0x00917730 | 92 | STL_aligned_alloc_32byte_elements | Allocates memory for array of 32-byte elements with 32-byte alignment, validating count and size limits. |
| 0x00917790 | 133 | STL_vector_74byte__clear_elements | Clears STL vector of 74-byte elements by invoking destructor on each element and resetting size to 0 |
| 0x00917820 | 60 | STL_vector_1C__deallocate_buffer | Deallocates a vector buffer of 0x1C-byte elements, validating alignment and delegating to operator delete |
| 0x00917870 | 51 | STL_vector_32byte__deallocate_buffer | Deallocates STL vector buffer of 32-byte elements with validation of large allocation headers before freeing. |
| 0x00917BF0 | 696 | STL_list_assign_0x80_nodes | STL list assignment that copies quest entries (CQuestEntry) between doubly-linked list nodes of 0x80 bytes each. |
| 0x00917EE0 | 652 | STL_list_assign_0x38_nodes | Assigns a range of 0x38-byte nodes to an STL list, copying/reusing existing nodes or creating new ones as needed. |
| 0x009181A0 | 240 | STL_tree_copy_node_0x44 | Recursively copies a 0x44-byte STL tree node with left/right children, initializing parent pointers and color attributes. |
| 0x009182B0 | 236 | STL_tree_copy_node_0x20 | Recursively copies a red-black tree node (0x20 bytes) with left/right children, preserving color and parent pointers. |
| 0x009183C0 | 132 | STL_tree_destroy_nodes_0x44_recursive | Recursively destroys red-black tree nodes (0x44 bytes each) with embedded std::string, deallocating left subtree first. |
| 0x00918450 | 94 | STL_tree_destroy_nodes_0x20_recursive | Recursively destroys red-black tree nodes (0x20 bytes) via post-order traversal, deallocating each node after processing children. |
| 0x009184C0 | 94 | STL_RBTree_DestroyNode_Recursive | Recursively destroys red-black tree nodes by traversing right subtree then deallocating node if leaf. |
| 0x00918530 | 132 | STL_tree_destroy_nodes_0x44_recursive_B | Recursively destroys tree nodes with 0x44 byte allocation size, deallocating left subtree and node memory. |
| 0x009185C0 | 94 | STL_tree_destroy_nodes_recursive | Recursively destroys tree nodes by traversing left subtree then deallocating node (0x20 bytes). |
| 0x00918630 | 222 | STL_list_mergesort_simple_asc | Merge sort implementation for doubly-linked list nodes, sorting by offset 0x1d field in ascending order |
| 0x00918710 | 222 | STL_list_mergesort_simple_desc | Mergesort implementation for doubly-linked list nodes, sorting in descending order by offset 0x1d field value. |
| 0x00918B10 | 222 | STL_list_mergesort_numeric_asc | Merge sort implementation for linked list nodes sorted by numeric field at offset 0x15 in ascending order |
| 0x00918BF0 | 222 | STL_list_mergesort_numeric_desc | Merges two sorted linked lists in descending order by numeric value at offset 0x15, used for item/drop sorting. |
| 0x00918CD0 | 362 | STL_list_mergesort_wide_cmp_asc | Merge sort comparator for wide character strings in ascending order; merges two sorted lists by comparing wide string values. |
| 0x00918E40 | 362 | STL_list_mergesort_wide_cmp_desc | Merges two sorted sublists of wide strings in descending order using comparison-based reordering of linked list nodes. |
| 0x00918FB0 | 222 | STL_list_mergesort_custom_cmp_A | Merge sort implementation for doubly-linked list using custom comparator on offset 0x1e field |
| 0x00919090 | 222 | STL_list_mergesort_custom_cmp_B | Merge sort implementation for doubly-linked list nodes using custom comparator at offset 0xe |
| 0x00919170 | 222 | STL_list_mergesort_custom_cmp_C | Mergesort implementation for doubly-linked list nodes using custom comparator on offset 0xe field |
| 0x00919440 | 139 | STL_tree_node_0x44__copy_assign | Copies a 0x44-byte tree node containing 3 ints, an STL string, and 4 additional ints with EH frame setup. |
| 0x009195A0 | 148 | STL_triple_string__init_empty | Initializes a struct with three empty std::string objects using small-string optimization (SSO) with 0xF byte capacity. |
| 0x0091A2C0 | 57 | STL_tree_0x44__destroy_and_free | Destroys and deallocates an STL tree node structure (0x44 bytes), recursively freeing all child nodes before cleanup. |
| 0x0091A320 | 80 | STL_tree_0x20__destroy_and_free | Destroys and deallocates an STL tree container node, recursively freeing child nodes if tree is not marked as deleted. |
| 0x0091A3A0 | 80 | STL_tree_0x20__destroy_and_free_B | Destroys and deallocates an STL red-black tree node structure with conditional recursive cleanup based on a flag at offset 0xd. |
| 0x0091A770 | 68 | STL_RBTree_0x44_Destructor | Destructor for 0x44-sized red-black tree node; recursively destroys all nodes then deallocates root. |
| 0x0091A7D0 | 65 | STL_map_0x20_node__scalar_dtor_A | Destructor for STL map node with 0x20 byte size; calls tree destruction with stack canary protection. |
| 0x0091A820 | 65 | STL_map_0x20_node__scalar_dtor_B | Destructor for STL map node; calls tree destroy/free with stack cookie-based security check (XOR canary validation) |
| 0x0091A8D0 | 151 | STL_vector_string_12byte__destroy_and_free | Destroys and deallocates a vector of 12-byte string elements with allocation size validation and XOR stack cookie protection. |
| 0x0091A990 | 99 | STL_triple_string__destructor | Destructor for a struct containing three std::string members; destroys each string in reverse order with stack canary protection. |
| 0x0091AEE0 | 92 | STL_tree_0x44__scalar_dtor | Destructs and deallocates an STL tree node (0x44 bytes), recursively destroying child nodes then freeing memory. |
| 0x0091B1A0 | 133 | STL_tree_0x20__copy_assign | Copy-assigns red-black tree of 0x20-byte nodes, clearing destination and updating min/max sentinel pointers. |
| 0x0091B330 | 320 | STL_map_insert_guild_member_entry | Inserts a guild member entry into an STL map by character ID, allocating and positioning a new node in the red-black tree structure. |
| 0x0091B480 | 275 | STL_map_insert_guild_ui_entry | Inserts a new node into a red-black tree map structure, allocating a 32-byte node and positioning it based on guild UI entry key comparison. |
| 0x0091B5A0 | 263 | STL_map_insert_listitem_node | Inserts a new node into an STL map container, maintaining sorted order by key value at param_2 offset. |
| 0x0091BB50 | 92 | STL_tree_0x44__destroy_and_free_C | Destroys and deallocates an STL tree node structure (0x44 bytes), recursively freeing all child nodes before releasing memory. |
| 0x0092B5B0 | 134 | STL_vector_8byte__allocate_buffer | Allocates aligned buffer for 8-byte element vector with 32-byte alignment for large allocations >=4KB |
| 0x0092B660 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color balance. |
| 0x0092B870 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties after adding new node |
| 0x0092BA80 | 517 | STL_TreeNode_Insert | STL red-black tree node insertion with rebalancing; handles tree structure maintenance and color property restoration. |
| 0x0092BC90 | 33 | STL_rbtree_0x44_clear | Clears red-black tree by recursively destroying all nodes and resetting sentinel/root pointers to empty state. |
| 0x0092BCC0 | 106 | STL_tree_0x20__clear_all | Clears red-black tree nodes (0x20 bytes each), recursively destroys all data, resets sentinels, zeroes size counter. |
| 0x0092BF70 | 501 | STL_vector_emplace_back_12byte | Inserts a 12-byte element into STL vector at position, reallocating and copying existing elements as needed. |
| 0x0092C170 | 129 | STL_tree_destroy_nodes_with_string_recursive | Recursively destroys binary tree nodes, deallocating std::string members and node structures (0x4c bytes each). |
| 0x0092C200 | 75 | STL_tree_lower_bound_int_key | Red-black tree lower_bound search returning iterator triplet (node, found_flag, bound) for integer key lookup in quest/menu systems. |
| 0x0092C700 | 127 | STL_vector_12byte__deallocate_buffer | Deallocates STL vector buffer of 12-byte elements with validation of large allocation headers before freeing. |
| 0x0092C930 | 239 | STL_map_insert_quest_entry | Inserts a new quest objective entry into an STL map, allocating and initializing a CQuestObjective node with bounds checking. |
| 0x00932160 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color invariants |
| 0x00932370 | 46 | STL_copy_12byte_structs | STL template instantiation: STL copy 12byte structs |
| 0x009323A0 | 47 | STL_relocate_12byte_structs | Relocates array of 12-byte structs by copying from source range [param_1, param_2) to offset destination. |
| 0x009323D0 | 10 | STL_Xlength_error_vector_12byte | Throws std::length_error exception when vector size exceeds maximum allowed length |
| 0x009323E0 | 54 | deallocate | STL allocator deallocate for GSISymbolEntry; frees memory with overflow validation and operator delete wrapper. |
| 0x009326E0 | 39 | STL_vector_push_back_4byte | STL vector::push_back for 4-byte elements; appends to end with reallocation when capacity exceeded. |
| 0x00932710 | 49 | STL_vector_push_back_12byte | STL vector::push_back for 12-byte elements; fast path copies data if capacity available, else reallocates |
| 0x0095B8F0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree structure and color invariants. |
| 0x00960D90 | 280 | STL_map_int_int__insert_or_find | std::map<int,int> insert-or-find; returns iterator and bool indicating if new node was inserted |
| 0x00960EB0 | 23 | STL_vector_int__default_constructor | Initializes a std::vector<int> by zeroing its three control members (data pointer, size, capacity). |
| 0x00961190 | 83 | operator++ | STL tree iterator pre-increment operator that advances to next node in red-black tree traversal order |
| 0x00963B80 | 87 | STL_vector__Change_array_00963b80 | STL vector internal method that reallocates and reassigns buffer pointers when capacity changes during growth/shrink operations. |
| 0x00963C20 | 577 | STL_vector_0x3c__emplace_reallocate | Reallocates std::vector<0x3C-byte element> with 1.5x growth, inserts element at position, moves existing elements, destructs old buffer. |
| 0x00963E70 | 123 | STL_vector_0x3c__move_element | Moves UISearchResultItem element by copying string fields and copying numeric data at offsets 0x34-0x38. |
| 0x00965380 | 37 | STL_vector_0x3c_destroy_range | STL template instantiation: STL vector 0x3c destroy range |
| 0x009653B0 | 182 | STL_vector_0x3c__copy_element_range | Copies a range of 0x3c-byte UISearchResultItem elements into destination vector, copying strings and numeric fields. |
| 0x00965470 | 180 | STL_vector_0x3c__copy_element_range_b | Copies a range of UISearchResultItem elements (0x3c bytes each) into a destination vector, cloning strings and copying metadata fields. |
| 0x00965530 | 10 | STL_Xlength_error_vector_0x3c | Throws std::length_error exception when vector allocation exceeds maximum allowed size limit |
| 0x00965540 | 57 | STL_vector_0x3c__free_buffer | Frees dynamically allocated buffer for STL vector with 0x3c-byte elements, validating alignment before deallocation. |
| 0x00965870 | 64 | LinkedListNode__FreeSentinel | Frees sentinel node's allocated memory (offset +4) using stack cookie protection during cleanup. |
| 0x00970B30 | 34 | stl_uninitialized_move_range | Moves memory range from source to destination and returns pointer to end of moved data in destination buffer. |
| 0x00970B60 | 444 | stl_vector_wchar__insert | Inserts a single wchar_t element into std::vector, managing capacity growth (1.5x), element shifting via memmove, and aligned memory allocation. |
| 0x00970DE0 | 106 | stl_vector_wchar__free_buffer | Deallocates buffer for std::vector<wchar_t>, handling aligned memory with optional header offset calculation before deletion. |
| 0x00971D80 | 10 | STL_Xlength_error_vector_wchar | Throws std::length_error exception for vector operations exceeding maximum allowed size |
| 0x00971D90 | 51 | STL_vector_wchar__free_buffer | Deallocates dynamic buffer for std::vector<wchar_t>, adjusting for SSO threshold and validating allocation metadata. |
| 0x00972180 | 264 | STL_map_insert_skilltree_node | Inserts a skill tree node into a binary search tree map, allocating and positioning nodes by skill ID comparison. |
| 0x00972290 | 83 | operator++ | STL red-black tree iterator pre-increment operator; advances to next in-order node by traversing right subtree or parent chain |
| 0x00973910 | 704 | STL_rbtree_erase_rebalance_uint | Red-black tree node erase with rebalancing for unsigned int values; handles tree restructuring and color property restoration. |
| 0x00973BD0 | 84 | STL_rbtree_rotate_left_b | Red-black tree left rotation with parent pointer updates and root/child link rebalancing. |
| 0x00973C30 | 88 | STL_rbtree_rotate_right_b | Red-black tree right rotation: repositions node param_2 as parent of param_1, updating parent pointers and tree root if necessary. |
| 0x00973F80 | 174 | STL_list_skilltree__insert_node | Allocates and inserts a new node into a doubly-linked list of skill tree data, incrementing list size counter. |
| 0x00974030 | 37 | STL_rbtree_0x4c_init | Initializes a red-black tree sentinel node; allocates 0x4c-byte node and sets bidirectional pointers to itself. |
| 0x0097A080 | 43 | STL_vector_string_push_back | Appends a string to STL vector; reallocates if capacity exceeded, otherwise copies to next slot. |
| 0x0097ABE0 | 82 | STL_vector_string__get_at | Wrapper around STL vector string access; sets up stack frame and delegates to __at() for bounds-checked element retrieval. |
| 0x0097AF80 | 10 | STL_Xout_of_range_vector_string_at | Throws std::out_of_range exception for invalid vector subscript access in STL vector container |
| 0x0097AF90 | 51 | STL_vector_string__at | std::vector<std::string>::at() - bounds-checked element access returning pointer to string at index param_2 |
| 0x0097B450 | 34 | STL_memmove_range_E | Copies memory from param_1 to param_3 for (param_2 - param_1) bytes, returns end pointer of destination. |
| 0x0097B480 | 449 | STL_vector_insert_4byte_skilltree | STL vector insertion for 4-byte elements (skill tree); reallocates with 1.5x growth, copies existing data, inserts new element, deallocates old buffer. |
| 0x0097BAB0 | 591 | STL_vector_0xe__copy_and_sort | STL vector insert operation: allocates new buffer, copies elements before/after insertion point, deallocates old buffer |
| 0x0097BD10 | 406 | STL_sort_median_of_nine_0x24 | Selects median-of-nine pivot for introsort quicksort partitioning on 0x24-byte elements; uses 3-of-3 median for small ranges. |
| 0x0097BEB0 | 432 | STL_sort_swap_elements_0x24 | Inserts element into sorted vector by shifting elements and maintaining sort order; handles string data members with proper cleanup. |
| 0x0097C070 | 528 | STL_sort_swap_strings_0x24 | Heapify operation for STL container of 36-byte structures (0x24); performs downheap sift for binary heap sort/priority queue maintenance. |
| 0x0097C280 | 1835 | STL_sort_quicksort_0x24 | STL quicksort partition implementation with 3-way partitioning for 0x24-byte elements (likely item/inventory structures) |
| 0x0097C9D0 | 325 | STL_sort_partition_0x24 | STL heap sort partition operation with string element handling; sifts down/up heap elements (0x24-byte records with embedded strings). |
| 0x0097CB20 | 482 | STL_sort_introsort_0x24 | Introsort algorithm sorting array of 0x24-byte structs (likely UISkillTreeDataItem) with depth limit and fallback to insertion sort. |
| 0x0097CD10 | 113 | STL_vector_0xe__copy_string_element | Copies a string element into STL vector node, initializing vtable pointer and two string fields with exception handling. |
| 0x0097CE70 | 222 | STL_sort_iter_swap_0x24 | Swaps two std::string objects by exchanging their buffer pointers, sizes, and capacity with SSO optimization. |
| 0x0097CF50 | 184 | STL_vector_0x30__copy_element | Move-constructs two 0x30-byte STL vector objects; copies data and clears source, typical std::vector move semantics. |
| 0x0097D1F0 | 162 | STL_vector_dealloc_with_check | Deallocates STL vector elements by invoking destructors on each item, then frees underlying memory buffer. |
| 0x0097D2B0 | 133 | STL_vector_dealloc_with_check_b | Deallocates STL vector by destructing elements and freeing aligned memory block via operator delete |
| 0x0097E010 | 131 | std_string__assign_cstr | Calculates C-string length and assigns it to std::string via range assignment |
| 0x00982260 | 37 | stl_vector_destroy_range_0xe | STL template instantiation: stl vector destroy range 0xe |
| 0x00982290 | 37 | stl_vector_destroy_range_0x10 | STL template instantiation: stl vector destroy range 0x10 |
| 0x009822C0 | 37 | stl_vector_destroy_range_0x9 | STL template instantiation: stl vector destroy range 0x9 |
| 0x009822F0 | 172 | stl_vector_copy_construct_range_0xe | Copies range of UISkillTreeWnd objects into STL vector, initializing vtable and string members for each element. |
| 0x00982510 | 170 | STL_vector_0xe__copy_string_pair | Copies vector of string pairs (skill tree data), duplicating strings and maintaining pair structure with size 0xe elements. |
| 0x00982730 | 10 | stl_vector_throw_length_error_a | Throws std::length_error exception when vector size exceeds maximum allowed length capacity |
| 0x00982740 | 10 | stl_vector_throw_length_error_b | Throws std::length_error exception when vector allocation exceeds maximum allowed size limit |
| 0x00982750 | 10 | stl_vector_throw_length_error_c | Throws std::length_error exception when a vector allocation would exceed maximum size limits |
| 0x00982760 | 10 | stl_vector_throw_length_error_d | Throws std::length_error exception when a vector allocation exceeds maximum size limit. |
| 0x00982770 | 55 | stl_vector_dealloc_4byte | Deallocates STL vector memory for 4-byte elements with overflow check and CRT heap validation |
| 0x009827B0 | 60 | stl_vector_dealloc_0x38byte | Deallocates STL vector memory for 0x38-byte elements with overflow detection and custom delete operator. |
| 0x00982800 | 51 | stl_vector_dealloc_0x40byte | Deallocates STL vector of 0x40-byte elements with overflow detection and aligned memory cleanup. |
| 0x00982840 | 54 | stl_vector_dealloc_0x24byte | Deallocates STL vector of 0x24-byte elements with overflow safety check before calling delete operator. |
| 0x00982940 | 34 | STL_memmove_range_F | Copies memory range from param_1 to param_2 into param_3, returns end pointer of copied data. |
| 0x00982970 | 34 | STL_copy_range_to_buffer | Copies a range of memory [param_1, param_2) to param_3, returns pointer to end of copied data. |
| 0x009829A0 | 34 | STL_move_range | Moves memory range [param_1, param_2) to param_3, returns pointer to end of destination range. |
| 0x009829D0 | 34 | STL_copy_range_I | Copies memory range [param_1, param_2) to param_3, returns pointer to end of destination buffer. |
| 0x00982B20 | 75 | STL_rbtree_lower_bound_b | Red-black tree lower_bound search returning iterator to first element >= key; updates param_2 with node and comparison result. |
| 0x00983080 | 415 | STL_vector_int_reallocate_grow | Reallocates and grows an STL vector<int> container, handling alignment and memory management for capacity expansion. |
| 0x00983320 | 28 | _Zero_range<> | STL template that zeroes memory range from param_1 to param_2, used for clearing containers and allocated buffers. |
| 0x00983340 | 28 | _Zero_range<> | STL template function that zeroes a memory range by calling memset from param_1 to param_2 |
| 0x00983360 | 28 | _Zero_range<> | STL template utility that zero-initializes a memory range by calculating size from two pointers and calling memset. |
| 0x00983380 | 28 | _Zero_range<> | STL template that zeroes a memory range by calling memset from start pointer to end pointer. |
| 0x00986340 | 290 | CUIScrollableList__MapSubscript | std::map subscript operator for CUIScrollableList; finds/inserts node in red-black tree, returns value pointer at offset +5 |
| 0x00986470 | 35 | CUIAdventureGuide__ScalarDtor_A | Scalar destructor for CUIAdventureGuide that cleans up resources and optionally deallocates object memory |
| 0x009864A0 | 35 | CUIAdventureGuide__ScalarDtor_B | Scalar destructor for CUIAdventureGuide; conditionally deallocates 0x100 bytes if delete flag set |
| 0x009864D0 | 35 | CUIAdventureGuide__ScalarDtor_C | Scalar destructor for CUIAdventureGuide; destroys list panel and conditionally frees 0x138-byte object. |
| 0x00986500 | 35 | CUIAdventureGuide__ScalarDtor_D | Destructor for CUIAdventureGuide that cleans up List3Panel and conditionally deallocates the object (0x138 bytes). |
| 0x00986530 | 35 | CUIAdventureGuide__ScalarDtor_E | Destructor for CUIAdventureGuide that destroys the list panel and optionally deallocates the object instance (0x138 bytes). |
| 0x00986560 | 35 | CUIAdventureGuide__ScalarDtor_F | Destructor for CUIAdventureGuide that cleans up List3Panel and conditionally deallocates the object instance. |
| 0x00986590 | 35 | CUIAdventureGuide__ScalarDtor_G | Destructor for CUIAdventureGuide that calls component destructor and conditionally frees 200-byte object memory. |
| 0x00986630 | 35 | CUIAdventureGuide__ScalarDtor_H | Scalar destructor for CUIAdventureGuide that calls component destructor and conditionally deallocates 0xf8 bytes if delete_flag is set. |
| 0x00986940 | 35 | CUIAdventureGuide__ScalarDtor_I | Destructor for CUIAdventureGuide that conditionally deallocates 0xf0 bytes if param_2's LSB is set |
| 0x00993DB0 | 22 | CUIScrollableList__VtableThunk_3db0 | Initializes vtable pointer and copies offset+4 data, typical C++ thunk for CUIScrollableList virtual method dispatch |
| 0x00993DD0 | 22 | CUIScrollableList__VtableThunk_3dd0 | VTable thunk that initializes vptr and copies member offset +4 for CUIScrollableList object construction |
| 0x00993DF0 | 22 | CUIScrollableList__VtableThunk_3df0 | Virtual table thunk that initializes vftable pointer and copies offset+4 data member for CUIScrollableList object construction. |
| 0x00993E10 | 22 | CUIScrollableList__VtableThunk_3e10 | Vtable thunk initializing CUIScrollableList vftable pointer and copying offset+4 member to output param. |
| 0x00993E30 | 22 | CUIScrollableList__VtableThunk_3e30 | CUIScrollableList vtable thunk that initializes vftable pointer and copies member offset+4 to output parameter |
| 0x00993E50 | 22 | CUIScrollableList__VtableThunk_3e50 | Initializes vftable pointer and copies offset+4 data for CUIScrollableList object construction/assignment. |
| 0x00993E70 | 22 | CUIScrollableList__VtableThunk_3e70 | Virtual method thunk that initializes vftable pointer and copies offset+4 member to output parameter for CUIScrollableList. |
| 0x00993E90 | 22 | CUIScrollableList__VtableThunk_3e90 | VTable thunk initializing CUIScrollableList vtable pointer and copying offset+4 member to output parameter |
| 0x00993EB0 | 22 | CUIScrollableList__VtableThunk_3eb0 | VTable thunk that initializes a CUIScrollableList object with vtable pointer and copies offset+4 data member. |
| 0x00993ED0 | 22 | CUIScrollableList__VtableThunk_3ed0 | VTable thunk for CUIScrollableList that initializes vtable pointer and copies offset+4 member during construction/initialization. |
| 0x00993EF0 | 22 | CUIScrollableList__VtableThunk_3ef0 | VTable thunk that initializes vtable pointer and copies offset+4 data member for CUIScrollableList object |
| 0x00993F10 | 22 | CUIScrollableList__VtableThunk_3f10 | Virtual method thunk that initializes vtable pointer and copies offset+4 member from source object. |
| 0x00993F30 | 22 | CUIScrollableList__VtableThunk_3f30 | Vtable thunk that initializes CUIScrollableList vftable pointer and copies offset+4 data member to output. |
| 0x00993F50 | 22 | CUIScrollableList__VtableThunk_3f50 | CUIScrollableList vtable thunk that initializes vftable pointer and copies offset+4 data member to param_2[1] |
| 0x00993F70 | 22 | CUIScrollableList__VtableThunk_3f70 | VTable thunk that initializes a CUIScrollableList object with vtable pointer and copies offset+4 data member. |
| 0x00993F90 | 22 | CUIScrollableList__VtableThunk_3f90 | VTable thunk initializing CUIScrollableList instance with vtable pointer and copying offset+4 member data |
| 0x00993FB0 | 22 | CUIScrollableList__VtableThunk_3fb0 | CUIScrollableList vtable thunk that initializes vftable pointer and copies offset+4 member to output parameter |
| 0x00993FD0 | 22 | CUIScrollableList__VtableThunk_3fd0 | CUIScrollableList virtual method thunk that initializes vftable pointer and copies offset+4 data member to output parameter. |
| 0x00993FF0 | 22 | CUIScrollableList__VtableThunk_3ff0 | Vtable thunk that initializes vftable pointer and copies offset+4 data for CUIScrollableList object construction |
| 0x00994030 | 22 | CUIScrollableList__VtableThunk_4030 | VTable thunk that initializes a CUIScrollableList object with vtable pointer and copies member data from offset +4 |
| 0x00994050 | 22 | CUIScrollableList__VtableThunk_4050 | Virtual thunk that initializes vftable pointer and copies offset+4 data member for CUIScrollableList object construction. |
| 0x00994070 | 22 | CUIScrollableList__VtableThunk_4070 | Vtable thunk that initializes vftable pointer and copies offset+4 member for CUIScrollableList object |
| 0x00994090 | 22 | CUIScrollableList__VtableThunk_4090 | Vtable thunk that initializes vftable pointer and copies offset+4 data member for CUIScrollableList object construction. |
| 0x009940B0 | 22 | CUIScrollableList__VtableThunk_40b0 | Virtual table thunk that initializes vtable pointer and copies offset+4 member for CUIScrollableList object construction/initialization |
| 0x009940D0 | 22 | CUIScrollableList__VtableThunk_40d0 | CUIScrollableList vtable thunk that initializes vftable pointer and copies offset+4 member to param_2[1] |
| 0x009940F0 | 22 | CUIScrollableList__VtableThunk_40f0 | VTable thunk initializing CUIScrollableList object with vtable pointer and copying member data from source. |
| 0x00994110 | 22 | CUIScrollableList__VtableThunk_4110 | Initializes vtable pointer and copies offset+4 member for CUIScrollableList object construction/assignment. |
| 0x00994130 | 22 | CUIScrollableList__VtableThunk_4130 | Vtable thunk that initializes vftable pointer and copies offset+4 member for CUIScrollableList object. |
| 0x00994150 | 22 | CUIScrollableList__CopyVtable | Copies vtable pointer and offset+4 member to destination, likely initializing a UI scrollable list object copy. |
| 0x00994170 | 22 | CUIScrollableList__VtableThunk_4170 | Initializes vtable pointer and copies member data for CUIScrollableList object construction/assignment. |
| 0x00994190 | 65 | CUIScrollableList__StdFuncDtor_4190 | Destructor for std::function wrapper in CUIScrollableList; conditionally deletes 8-byte functor object. |
| 0x009941E0 | 65 | CUIScrollableList__StdFuncDtor_41e0 | Destructor for CUIScrollableList's std::function wrapper; conditionally deallocates 8-byte functor object via operator delete. |
| 0x00994230 | 65 | CUIScrollableList__StdFuncDtor_4230 | Destructor for CUIScrollableList's std::function wrapper; conditionally deletes 8-byte function object if flag set. |
| 0x00994280 | 65 | CUIScrollableList__StdFuncDtor_4280 | Destructor for std::function wrapper in CUIScrollableList; conditionally deallocates 8-byte function object. |
| 0x009942D0 | 65 | CUIScrollableList__StdFuncDtor_42d0 | Destructor for CUIScrollableList that conditionally deallocates 8-byte object with stack canary protection |
| 0x00994320 | 65 | CUIScrollableList__StdFuncDtor_4320 | Destructor for std::function object in CUIScrollableList; conditionally deallocates 8-byte functor with XOR-based stack canary validation |
| 0x00994370 | 65 | CUIScrollableList__StdFuncDtor_4370 | Destructor for std::function wrapper in CUIScrollableList; conditionally deletes 8-byte functor object with stack canary protection. |
| 0x009943C0 | 65 | CUIScrollableList__StdFuncDtor_43c0 | Destructor for CUIScrollableList std::function wrapper; conditionally deallocates 8-byte managed object with stack canary protection |
| 0x00994410 | 65 | CUIScrollableList__StdFuncDtor_4410 | Destructor for CUIScrollableList's std::function wrapper; conditionally deallocates 8-byte functor object |
| 0x00994460 | 65 | CUIScrollableList__StdFuncDtor_4460 | Destructor for CUIScrollableList's std::function wrapper; conditionally deallocates 8-byte functor object |
| 0x009944B0 | 65 | CUIScrollableList__StdFuncDtor_44b0 | Destructor for CUIScrollableList std::function wrapper; conditionally deallocates 8-byte functor object via operator delete |
| 0x00994500 | 65 | CUIScrollableList__StdFuncDtor_4500 | Destructor for CUIScrollableList's std::function wrapper; conditionally deallocates 8-byte object using XOR stack cookie. |
| 0x00994550 | 65 | CUIScrollableList__StdFuncDtor_4550 | Destructor for CUIScrollableList that conditionally deallocates 8-byte std::function object with XOR stack cookie validation. |
| 0x009945A0 | 65 | CUIScrollableList__StdFuncDtor_45a0 | Destructor for CUIScrollableList std::function wrapper; conditionally deallocates 8-byte functor object based on param_2 flag. |
| 0x009945F0 | 65 | CUIScrollableList__StdFuncDtor_45f0 | Destructor for CUIScrollableList std::function wrapper; conditionally deallocates 8-byte functor object via operator delete |
| 0x00994640 | 65 | CUIScrollableList__StdFuncDtor_4640 | Destructor for std::function wrapper in CUIScrollableList; conditionally deallocates 8-byte functor object using XOR stack canary. |
| 0x00994690 | 65 | CUIScrollableList__StdFuncDtor_4690 | Destructor for std::function wrapper in CUIScrollableList; conditionally deallocates 8-byte functor object if deletion flag set. |
| 0x009946E0 | 65 | CUIScrollableList__StdFuncDtor_46e0 | Destructor for std::function wrapper in CUIScrollableList; conditionally deallocates 8-byte functor object. |
| 0x00994730 | 65 | CUIScrollableList__StdFuncDtor_4730 | Destructor for CUIScrollableList that conditionally deallocates 8-byte object based on param_2 flag |
| 0x00994780 | 65 | CUIScrollableList__StdFuncDtor_4780 | Destructor for CUIScrollableList's std::function wrapper; conditionally deallocates 8-byte functor object. |
| 0x009947D0 | 65 | CUIScrollableList__StdFuncDtor_47d0 | Destructor for std::function wrapper in CUIScrollableList; conditionally deallocates 8-byte functor object with XOR-based stack canary check. |
| 0x00994820 | 65 | CUIScrollableList__StdFuncDtor_4820 | Destructor for std::function wrapper in CUIScrollableList; conditionally deletes 8-byte function object if param_2 is true |
| 0x00994870 | 65 | CUIScrollableList__StdFuncDtor_4870 | Destructor for std::function object in CUIScrollableList; conditionally deletes wrapped callable with stack canary protection. |
| 0x009948C0 | 65 | CUIScrollableList__StdFuncDtor_48c0 | Destructor for CUIScrollableList's std::function wrapper; conditionally deallocates 8-byte function object if deletion flag set. |
| 0x00994910 | 65 | CUIScrollableList__StdFuncDtor_4910 | Destructor for std::function wrapper in CUIScrollableList; conditionally deallocates 8-byte functor object if deletion flag set |
| 0x00994960 | 65 | CUIScrollableList__StdFuncDtor_4960 | Destructor for CUIScrollableList std::function wrapper; conditionally deallocates 8-byte function object based on param_2 flag. |
| 0x009949B0 | 65 | CUIScrollableList__StdFuncDtor_49b0 | Destructor for CUIScrollableList std::function wrapper; conditionally deallocates 8-byte functor object using XOR stack guard. |
| 0x00994A00 | 65 | CUIScrollableList__StdFuncDtor_4a00 | Destructor for std::function object in CUIScrollableList; conditionally deallocates 8-byte functor with XOR stack canary check. |
| 0x00994A50 | 65 | CUIScrollableList__StdFuncDtor_4a50 | Destructor for CUIScrollableList std::function wrapper; conditionally deallocates 8-byte object via operator delete |
| 0x00994AA0 | 65 | CUIScrollableList__StdFuncDtor_4aa0 | Destructor for CUIScrollableList's std::function wrapper; conditionally deallocates 8-byte object if param_2 is true |
| 0x00994AF0 | 65 | CUIScrollableList__StdFuncDtor_4af0 | Destructor for std::function object in CUIScrollableList; conditionally deallocates 8-byte functor with stack guard |
| 0x00994B40 | 65 | CUIScrollableList__DestroyItemCallbacks | Iterates through list items calling virtual destructor (offset 0xdc) on each, cleaning up callbacks |
| 0x00994B90 | 65 | CUIScrollableList__StdFuncDtor_4b90 | Iterates through scrollable list items invoking virtual destructor/cleanup callback (offset 0xdc) on each item. |
| 0x00994BE0 | 65 | CUIScrollableList__DestroyCallbacks | Iterates through callback list and invokes destructor on each callback object in scrollable list |
| 0x00994C30 | 65 | CUIScrollableList__StdFuncDtor_4c30 | Iterates through scrollable list items, invoking destructor callback (vtable+0xdc) on each element. |
| 0x00994C80 | 20 | CUIScrollableList__DelegateForwarder_4c80 | Wrapper that forwards selection change events from CUIScrollableList to registered delegate callbacks |
| 0x00994DC0 | 20 | CUIScrollableList__DelegateForwarder_4dc0 | Wrapper that delegates to CUIScrollableList::UpdateVisibleItems to refresh visible UI list items. |
| 0x00994DE0 | 20 | CUIScrollableList__DelegateForwarder_4de0 | Delegate forwarder that calls CUIScrollableList::UpdateVisibleItems to refresh displayed list items. |
| 0x00994E00 | 20 | CUIScrollableList__DelegateForwarder_4e00 | Wrapper that delegates to CUIScrollableList::UpdateVisibleItems to refresh visible item display in scrollable UI list |
| 0x00994E20 | 20 | CUIScrollableList__DelegateForwarder_4e20 | Forwards delegate call to CUIScrollableList::UpdateVisibleItems with dereferenced parameter |
| 0x00994E50 | 23 | CUIScrollableList__VtableThunk_4e50 | Virtual method thunk that delegates to CUIScrollableList__ReturnStub; passes parameter through to stub function |
| 0x00994E70 | 23 | CUIScrollableList__SetTitle | Thunk wrapper that delegates SetTitle call from CUIScrollableList to CUIAdventureGuide implementation |
| 0x00994E90 | 23 | CUIAdventureGuide__SetTitle_Thunk | Vtable thunk that forwards SetTitle call to CUIAdventureGuide with type conversion |
| 0x00994EB0 | 23 | CUIScrollableList__VtableThunk_4eb0 | Vtable thunk that delegates SetTitle call to CUIAdventureGuide, forwarding param_2 as title argument |
| 0x00995260 | 23 | CUIScrollableList__ForwardScrollEventToAdventureGuide | Forwards scroll events from CUIScrollableList to CUIAdventureGuide's OnScrollEvent handler |
| 0x00995280 | 23 | CUIAdventureGuide__BindQuestData_Thunk | Thunk forwarder that delegates to CUIAdventureGuide::BindQuestData for quest data binding |
| 0x009952A0 | 23 | CUIAdventureGuide__PopulateRichTextPanel_Forwarder | Forwards call to populate Adventure Guide rich text panel with given parameters |
| 0x009952C0 | 23 | CUIScrollableList__SetQuestDisplayData | Forwards quest display data assignment to UIQuestWnd, used for populating quest list UI elements |
| 0x009952E0 | 20 | CUIAdventureGuide__UpdateItemDisplay_Thunk | Thunk wrapper that forwards calls to CUIAdventureGuide::UpdateItemDisplay for adventure guide item UI refresh |
| 0x00995550 | 3 | identity_return_this_5550 | Identity function that returns its parameter unchanged; likely compiler-generated or used for type casting/forwarding. |
| 0x00995560 | 3 | identity_return_this_5560 | Identity function that returns its parameter unchanged; likely used for template instantiation or callback compatibility. |
| 0x00995570 | 3 | identity_return_this_5570 | Identity function that returns its parameter unchanged; likely compiler-generated or used for type casting/forwarding in template instantiation. |
| 0x00995580 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties after adding new node to container. |
| 0x00995790 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree invariant and color properties. |
| 0x009959A0 | 22 | CUIScrollableList__VtableThunk_59a0 | Initializes vtable pointer and copies offset+4 data member for CUIScrollableList object construction. |
| 0x009959C0 | 22 | CUIScrollableList__VtableThunk_59c0 | Initializes CUIScrollableList vtable pointer and copies offset+4 member to output parameter structure. |
| 0x009959E0 | 22 | CUIScrollableList__VtableThunk_59e0 | Virtual table thunk that initializes CUIScrollableList vtable pointer and copies member offset 4 to output parameter. |
| 0x00995A00 | 22 | CUIScrollableList__VtableThunk_5a00 | Initializes vtable pointer and copies offset+4 data member for CUIScrollableList object construction/assignment. |
| 0x00995A20 | 22 | CUIScrollableList__VtableThunk_5a20 | Virtual method thunk that initializes vtable pointer and copies offset+4 member to output parameter for CUIScrollableList |
| 0x00995A40 | 22 | CUIScrollableList__VtableThunk_5a40 | Initializes vtable pointer and copies offset+4 data member during CUIScrollableList object construction/assignment. |
| 0x00995A60 | 22 | CUIScrollableList__VtableThunk_5a60 | Initializes vtable pointer and copies offset+4 member from source object in CUIScrollableList construction/assignment. |
| 0x00995A80 | 22 | CUIScrollableList__VtableThunk_5a80 | VTable initialization thunk for CUIScrollableList; sets vtable pointer and copies offset+4 data member to output. |
| 0x00995AA0 | 22 | CUIScrollableList__VtableThunk_5aa0 | Initializes vftable pointer and copies offset+4 data member for CUIScrollableList object construction/copy. |
| 0x00995AC0 | 22 | CUIScrollableList__VtableThunk_5ac0 | Initializes vtable pointer and copies offset+4 data member for CUIScrollableList object construction. |
| 0x00995AE0 | 22 | CUIScrollableList__VtableThunk_5ae0 | VTable thunk that initializes vtable pointer and copies offset+4 data for CUIScrollableList object construction |
| 0x00995B00 | 22 | CUIScrollableList__VtableThunk_5b00 | Copy vtable pointer and offset+4 value to output parameters; likely CUIScrollableList initialization/assignment thunk |
| 0x00995B20 | 22 | CUIScrollableList__VtableThunk_5b20 | CUIScrollableList vtable thunk that initializes vftable pointer and copies offset+4 data member to output. |
| 0x00995B40 | 22 | CUIScrollableList__VtableThunk_5b40 | Initializes vtable pointer and copies offset+4 member for CUIScrollableList object construction/assignment. |
| 0x00995B60 | 22 | CUIScrollableList__VtableThunk_5b60 | Initializes vtable pointer and copies offset+4 data member for CUIScrollableList object construction/assignment. |
| 0x00995B80 | 22 | CUIScrollableList__VtableThunk_5b80 | Initializes vtable pointer and copies offset+4 data member for CUIScrollableList object construction. |
| 0x00995BA0 | 22 | CUIScrollableList__VtableThunk_5ba0 | Initializes CUIScrollableList vtable pointer and copies offset+4 member to output parameter structure. |
| 0x00995BC0 | 22 | CUIScrollableList__VtableThunk_5bc0 | Initializes vftable pointer and copies offset+4 member from param_1 to param_2[1] for CUIScrollableList object. |
| 0x00995BE0 | 22 | CUIScrollableList__VtableThunk_5be0 | Initializes CUIScrollableList vtable pointer and copies member variable from source object at offset +4 |
| 0x00995C00 | 22 | CUIScrollableList__VtableThunk_5c00 | Initializes CDelegate iterator vtable and copies param_1+4 offset value to param_2[1] |
| 0x00995C20 | 22 | CUIScrollableList__VtableThunk_5c20 | Copy vtable pointer and offset+4 data member to destination, likely copy/assignment helper for CUIScrollableList |
| 0x00995C40 | 22 | CUIScrollableList__VtableThunk_5c40 | Initializes vtable pointer and copies offset+4 data member for CUIScrollableList object construction. |
| 0x00995C60 | 22 | CUIScrollableList__VtableThunk_5c60 | Initializes CUIScrollableList vtable pointer and copies offset+4 data member to param_2[1] |
| 0x00995C80 | 22 | CUIScrollableList__VtableThunk_5c80 | Initializes vfptr and copies offset+4 data; likely copy constructor or assignment operator thunk for CUIScrollableList |
| 0x00995CA0 | 22 | CUIScrollableList__VtableThunk_5ca0 | CUIScrollableList vtable thunk that initializes vftable pointer and copies offset+4 member to output parameter |
| 0x00995CC0 | 22 | CUIScrollableList__VtableThunk_5cc0 | CUIScrollableList vtable initialization thunk; sets vftable pointer and copies offset+4 data member |
| 0x00995CE0 | 22 | CUIScrollableList__VtableThunk_5ce0 | CUIScrollableList vtable thunk that initializes vptr and copies offset+4 data member to output |
| 0x00995D00 | 22 | CUIScrollableList__VtableThunk_5d00 | CUIScrollableList vtable thunk that initializes vftable pointer and copies offset+4 member to output param |
| 0x00995D20 | 22 | CUIScrollableList__VtableThunk_5d20 | Initializes vtable pointer and copies offset+4 member from source object during CUIScrollableList construction/assignment. |
| 0x00995D40 | 22 | CUIScrollableList__VtableThunk_5d40 | Copy constructor thunk for CUIScrollableList; copies vtable pointer and member offset +4 to destination. |
| 0x00995D60 | 22 | CUIScrollableList__VtableThunk_5d60 | VTable thunk initializing CUIScrollableList object with vtable pointer and copying member at offset +4 |
| 0x00995D80 | 341 | STL_swap_function_objects | Swaps two std::function objects with small buffer optimization, handling both inline and heap-allocated callables. |
| 0x00995EE0 | 341 | std_function__swap | std::function swap implementation that exchanges two callable objects, handling both small-buffer and heap-allocated cases via vtable operations. |
| 0x00996BD0 | 10 | STL_vector_length_error | Throws std::length_error exception when vector size exceeds maximum allowed length limit |
| 0x00996BE0 | 10 | STL_Xlength_error_scrolllist_insert_b | Throws std::length_error exception when vector allocation exceeds maximum size limit |
| 0x00996BF0 | 10 | STL_vector_length_error_throw | Throws std::length_error exception when vector size exceeds maximum allowed length limit. |
| 0x00996C00 | 10 | STL_Xlength_error_vector_int_realloc | Throws std::length_error exception when vector allocation exceeds maximum size limit |
| 0x00996C10 | 55 | deallocate | STL allocator deallocate wrapper that validates heap chunk size and calls operator delete with adjusted parameters. |
| 0x00996C50 | 55 | deallocate | STL allocator deallocate wrapper that frees memory blocks with size validation and overflow protection for std::allocator |
| 0x00996C90 | 55 | deallocate | STL allocator deallocate wrapper that validates heap metadata and frees memory via operator delete |
| 0x00996CD0 | 55 | deallocate | STL allocator deallocate wrapper; frees memory with size validation, calls operator delete with adjusted pointer/size |
| 0x00996D10 | 94 | STL_tree_destroy_nodes_recursive_A | Recursively destroys std::set/map tree nodes by traversing right children and freeing 0x18-byte node structures. |
| 0x00996D80 | 94 | STL_tree_destroy_nodes_recursive_B | Recursively destroys binary search tree nodes (0x18-byte), deallocating right subtree before node itself with stack protection. |
| 0x00998C20 | 207 | STL_tree_destroy_nodes_and_free | Destroys STL tree nodes recursively and deallocates tree structure with scalar deletor for CUIScrollableListEx |
| 0x00999010 | 83 | operator++ | STL tree iterator increment operator; advances red-black tree node pointer to next in-order successor using binary search tree traversal logic. |
| 0x0099A8E0 | 219 | STL_map_insert_adventure_quest_node | Inserts or updates an adventure quest node into a STL map, allocating new node if quest ID doesn't exist or level requirement differs. |
| 0x0099F4B0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color invariants |
| 0x0099F940 | 144 | STL_string_replace_range | Assigns a range of characters from source to destination string, initializing dest and copying iVar1 to iVar2 elements. |
| 0x0099FAA0 | 94 | STL_tree_destroy_nodes_recursive_C | Recursively destroys binary tree nodes by traversing left subtree and deallocating each node; includes stack canary validation. |
| 0x0099FB10 | 75 | STL_tree_find_or_lower_bound | STL red-black tree traversal finding lower_bound position by comparing key value at param_3 against node keys |
| 0x009A02A0 | 263 | STL_map_insert_richtext_node | Inserts a richtext node into an STL map, allocating and positioning new nodes in a binary tree structure. |
| 0x009A03B0 | 236 | STL_map_insert_richtext_sprite_node | Inserts a richtext sprite node into an STL map, allocating a 24-byte node structure and managing tree insertion with capacity checks. |
| 0x009A04A0 | 236 | STL_map_int_insert_or_find | Inserts or finds a node in STL map with integer key, allocates new node if key doesn't exist, returns pointer to value |
| 0x009A16A0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree balance property and updates tree structure pointers. |
| 0x009A18B0 | 517 | Insert_node | STL Red-Black Tree node insertion with rebalancing; maintains tree structure and color properties |
| 0x009A1E90 | 330 | STL_vector_36b__reallocate_insert | Reallocates and inserts element into STL vector<Element_36b>, growing capacity and repositioning existing elements. |
| 0x009A2010 | 333 | STL_vector_36b__reallocate_insert_copy | Reallocates STL vector of 36-byte elements and inserts a copy at specified position, growing capacity as needed. |
| 0x009A2190 | 208 | STL_vector_36b__move_elements | Moves vector elements (36-byte structures) from source to destination, clearing source and returning new destination end pointer. |
| 0x009A2260 | 150 | STL_vector_36b__init_element | Initializes a 36-byte STL vector element by zeroing fields and setting SSO small-string optimization flag (0xf). |
| 0x009A2300 | 103 | STL_vector_36b__copy_element | Copies STL vector element by duplicating string and copying 12 bytes of associated data (offset 0x18-0x27) |
| 0x009A2370 | 90 | STL_vector_36b__destroy_range | Destroys a range of std::string objects in an STL vector by calling destructor on each element sequentially. |
| 0x009A23D0 | 174 | STL_vector_36b__deallocate | Deallocates STL vector of 0x24-byte elements (likely ItemInfo structs), destructing strings before freeing memory. |
| 0x009A2510 | 65 | STL_vector_36b__destroy_single | Destroys a single std::string element with stack canary protection via XOR-based security cookie validation. |
| 0x009A48B0 | 205 | STL_vector_36b__swap_and_destroy | Swaps vector contents and deallocates old buffer; handles 36-byte elements (likely RO item/mob struct data). |
| 0x009A4990 | 92 | STL_vector_36b__destroy_range_b | Destroys a range of std::string objects in an STL vector by iterating from param_1 to param_2 with stride 0x24 bytes. |
| 0x009A49F0 | 10 | STL_vector_36b__throw_length_error | Throws std::length_error exception when vector size exceeds maximum allowed length during allocation |
| 0x009A4A00 | 95 | STL_vector_36b__allocate | Allocates aligned memory for STL vector of 36-byte elements with 32-byte alignment padding for cache optimization |
| 0x009A4A60 | 54 | STL_vector_36b__deallocate_raw | Deallocates STL vector with 0x24-byte elements, validating allocation header and calling operator delete with adjusted size. |
| 0x009A5080 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties and color invariants. |
| 0x009A5290 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color balance |
| 0x009A8170 | 94 | STL_tree__recursive_delete_28b_A | Recursively deletes BST nodes by traversing left subtree, then deallocating current node; stack canary protection present. |
| 0x009A81E0 | 94 | STL_tree__recursive_delete_28b_B | Recursively deletes tree nodes in post-order (children before parent) with stack unwinding and security cookie validation. |
| 0x009A8250 | 153 | STL_tree__recursive_delete_64b | Recursively deletes binary search tree nodes; processes left subtree then deallocates node with virtual destructor call. |
| 0x009A8300 | 75 | STL_tree__lower_bound_int_A | STL red-black tree lower_bound operation for integer keys; finds first node >= search value |
| 0x009A8350 | 75 | STL_tree__lower_bound_int_B | STL red-black tree lower_bound search for integer keys; finds first node >= target value |
| 0x009A85B0 | 80 | STL_tree__destroy_28b_A | Destroys STL tree node structure, recursively deleting child nodes before freeing parent memory with XOR cookie validation. |
| 0x009A8630 | 80 | STL_tree__destroy_28b_B | Destroys STL tree node structure by recursively deleting children and freeing allocated memory with XOR stack canary validation. |
| 0x009A86B0 | 57 | STL_tree__destroy_64b | Destroys STL tree structure by recursively deleting all nodes then freeing the root node allocation. |
| 0x009A8710 | 65 | STL_tree__safe_destroy_28b_A | Safe wrapper for STL tree destruction with stack canary protection and exception handling setup |
| 0x009A8760 | 65 | STL_tree__safe_destroy_28b_B | Safe wrapper for STL tree destruction with stack canary validation and exception handling setup (28-byte nodes) |
| 0x009A87B0 | 68 | STL_tree__safe_destroy_64b | Safely destroys an STL tree structure by recursively deleting nodes and deallocating the root node with stack cookie validation. |
| 0x009A9AF0 | 223 | STL_map_insert_richtext_style_node | Inserts a richtext style node into STL map, initializing node structure and handling capacity validation. |
| 0x009ACE60 | 75 | STL_map_find_or_lower_bound_component | Binary search tree traversal to find node with key >= target in RO map/set; returns iterator state in param_2 |
| 0x009AD280 | 223 | STL_map_insert_component_node | Inserts a new node into an STL map container for component storage, allocating 0x18-byte node and linking into tree. |
| 0x009AD7F0 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains tree properties and color invariants. |
| 0x009B1D20 | 34 | STL_memmove_range_A_enchant | Moves memory block from param_1 to param_3, returning new end pointer; generic range copy utility. |
| 0x009B1D50 | 34 | STL_memmove_range_checked | Moves memory from param_1 to param_3 for (param_2 - param_1) bytes, returns new end pointer. |
| 0x009B1D80 | 94 | STL_tree_destroy_nodes_recursive_D | Recursively destroys binary tree nodes by traversing left subtree then deallocating node memory with XOR cookie canary validation. |
| 0x009B1DF0 | 415 | STL_vector_4byte__reallocate_and_grow_A | Reallocates and grows a 4-byte element STL vector, handling alignment and memory management with overflow checks. |
| 0x009B1FA0 | 415 | STL_vector_4byte__reallocate_and_grow_C | Reallocates and grows an STL vector of 4-byte elements with exponential growth strategy and aligned memory management. |
| 0x009B21B0 | 28 | _Zero_range<> | STL template utility that zeroes a memory range from pointer param_1 to param_2 by calling memset. |
| 0x009B21D0 | 28 | _Zero_range<> | STL template that zero-initializes a memory range by clearing bytes from param_1 to param_2 |
| 0x009B40B0 | 263 | STL_map_insert_scrollpanel_node | Inserts a node into an STL map container for scroll panel, maintaining BST order by key value from param_2. |
| 0x009BC990 | 22 | STL_Iterator__Initialize | Initializes STL iterator vtable pointer and copies offset+4 data member from source object. |
| 0x009BC9B0 | 22 | STL_iterator_vtable_init_enchant_02 | Initializes STL iterator vtable pointer and copies offset+4 data member from source object. |
| 0x009BC9D0 | 22 | STL_iterator_vtable_init_enchant_03 | Initializes STL iterator virtual table pointer and copies offset+4 data member to output structure. |
| 0x009BC9F0 | 22 | STL_iterator_copy_constructor | Copies STL iterator vtable pointer and state from source iterator (param_1) to destination (param_2) |
| 0x009BCA10 | 22 | STL_iterator_construct | Initializes STL iterator object by setting vtable pointer and copying internal state from source iterator. |
| 0x009BCA30 | 22 | STL_iterator_copy_ctor | Copy constructor for STL iterator; initializes vtable pointer and copies internal state from source iterator. |
| 0x009BCA50 | 22 | STL_iterator_vtable_init_enchant_07 | Initializes STL iterator by copying vtable pointer and offset value from source iterator object. |
| 0x009BCA70 | 22 | STL_iterator_vtable_init_enchant_08 | Copy constructor for STL iterator; initializes vtable pointer and copies iterator state from source. |
| 0x009BCA90 | 22 | STL_iterator_vtable_init_enchant_09 | Copies STL iterator vtable pointer and advances to next element in enchant data structure. |
| 0x009BCAB0 | 22 | STL_iterator_constructor_enchant_10 | Initializes STL iterator vtable pointer and copies offset+4 data member for enchant slot 10 object. |
| 0x009BCAD0 | 22 | STL_iterator_vtable_init_enchant_11 | Copies STL iterator vtable pointer and internal state from source iterator to destination iterator object. |
| 0x009BCAF0 | 22 | STL_iterator_vtable_init_enchant_12 | Copies STL iterator vtable pointer and internal state from source to destination object. |
| 0x009BCB10 | 22 | STL_iterator_vtable_init_enchant_13 | Copies STL iterator vtable pointer and internal state from source to destination iterator object. |
| 0x009BCB30 | 22 | STL_iterator__copy_constructor | Copies STL iterator state by copying vtable pointer and internal offset to destination object. |
| 0x009BCB50 | 22 | STL_Iterator_Construct | Initializes STL iterator vtable pointer and copies offset+4 value; basic iterator construction wrapper. |
| 0x009BCB70 | 22 | STL_iterator_vtable_init_enchant_16 | Copies STL iterator vtable pointer and advances iterator position by 4 bytes (likely node advancement in linked list) |
| 0x009BCB90 | 22 | STL_iterator_vtable_init_enchant_17 | Initializes STL iterator vtable pointer and copies offset+4 data member for enchant container iteration. |
| 0x009BD5F0 | 3 | STL_vector_4byte__noop_destroy_a | No-op destructor for STL vector of 4-byte elements; returns parameter unchanged for trivial cleanup. |
| 0x009BD600 | 3 | STL_vector_4byte__noop_destroy_c | No-op destructor for 4-byte STL vector elements; returns input unchanged, used for types without dynamic cleanup. |
| 0x009BD610 | 517 | Insert_node | STL red-black tree node insertion with rebalancing; maintains binary search tree properties and color invariants. |
| 0x009BD820 | 22 | STL_Iterator__Copy_Constructor_18 | Initializes STL iterator copy by setting vtable pointer and copying internal state from source iterator. |
| 0x009BD840 | 22 | STL_iterator_vtable_init_enchant_19 | Copies STL iterator vtable pointer and advances internal state pointer by 4 bytes for enchant data traversal. |
| 0x009BD860 | 22 | STL_iterator_init | Initializes STL iterator by setting vtable pointer and copying internal state from source iterator object. |
| 0x009BD880 | 22 | STL_iterator_init_from_vtable | Initializes STL iterator with vtable pointer and copies member offset from source object. |
| 0x009BD8A0 | 22 | STL_iterator_init_with_offset | Initializes an STL iterator with a vtable pointer and copies a 4-byte offset value from source object. |
| 0x009BD8C0 | 22 | STL_iterator_vtable_init_enchant_23 | Initializes STL iterator vtable with copy constructor and copies offset+4 data member to iterator object. |
| 0x009BD8E0 | 22 | STL_iterator__assign_vtable_and_data | Assigns vtable pointer and copies 4-byte data member from source object to iterator instance. |
| 0x009BD900 | 22 | STL_iterator_ctor_enchant_25 | Initializes STL iterator vtable pointer and copies offset+4 data member for enchant item iterator. |
| 0x009BD920 | 22 | STL_iterator_vtable_init_enchant_26 | Initializes STL iterator with vtable pointer and copies offset+4 data member to iterator's second field. |
| 0x009BD940 | 22 | STL_iterator_init_copy_offset | Initializes STL iterator vtable pointer and copies member data from source offset +4 |
| 0x009BD960 | 22 | STL_Iterator_Dereference_Enchant_28 | Initializes STL iterator by setting vtable pointer and copying dereferenced value from source iterator. |
| 0x009BD980 | 22 | STL_iterator_vtable_init_enchant_29 | Initializes STL iterator vtable pointer and copies offset+4 data member, likely iterator construction/assignment. |
| 0x009BD9A0 | 22 | STL_iterator_vtable_init_enchant_30 | Copies STL iterator object by copying vtable pointer and internal state from source to destination. |
| 0x009BD9C0 | 22 | STL_iterator__initialize | Initializes STL iterator vtable with copy constructor and advances iterator offset by 4 bytes. |
| 0x009BD9E0 | 22 | STL_iterator_vtable_init_enchant_32 | Initializes STL iterator vtable by setting constructor pointer and copying offset+4 value from source object. |
| 0x009BDA00 | 22 | STL_iterator__set_vtable_and_copy_data | Sets vtable pointer and copies 4-byte data member from source object to iterator wrapper. |
| 0x009BDA20 | 22 | STL_function_copy_constructor_enchant_17 | Copy constructs STL function object for enchant_17, copying vtable ptr and functor state from source. |
| 0x009BDA40 | 341 | std_function__swap_A | Swaps internal pointers of two std::function objects, handling small object optimization and managed resource cleanup. |
| 0x009BDBA0 | 341 | std_function__swap_B | Swaps two std::function objects, handling both small buffer optimization and heap-allocated callable state. |
| 0x009BDD00 | 341 | std_function__swap_C | Swaps two std::function objects, handling both small and large callable objects with proper cleanup and move semantics. |
| 0x009BDF70 | 10 | stl_vector_xlength_error_G | Throws std::length_error exception when a vector allocation exceeds maximum allowed size |
| 0x009BDF80 | 10 | stl_vector_xlength_error_H | Throws std::length_error exception when vector allocation exceeds maximum allowable size limit. |
| 0x009BDF90 | 55 | deallocate | STL allocator deallocate wrapper that frees memory blocks, validating alignment for large allocations (>4KB) before deletion. |
| 0x009BDFD0 | 55 | stl_sized_delete_with_alignment | Deallocates aligned memory block with size validation; adjusts pointer for over-sized allocations (>4KB). |
| 0x009BE1E0 | 99 | STL_pair_string_destructor | Destroys an STL pair containing strings by calling destructors on both string members with stack canary protection. |
| 0x009BE250 | 99 | stl_pair_string_destructor_B | Destroys std::pair<string, string> by calling destructors on both string members with stack canary protection. |
| 0x009BE2C0 | 64 | STL_DeleteFunctorForSize12 | Functor that deletes dynamically allocated memory of 12-byte objects with stack canary protection |
| 0x009BE310 | 64 | STL_Deleter_16__operator_call | STL deleter functor that deallocates 16-byte objects stored in container at offset +4 with XOR cookie validation. |
| 0x009BE360 | 75 | stl_functor_delete_12_B | Destructor functor that conditionally deletes dynamically allocated memory at offset +4 with stack canary protection |
| 0x009BE3B0 | 75 | STL_AllocatorDelete_16 | Deletes 16-byte allocated memory block via operator_delete with stack canary protection. |
| 0x009BE4A0 | 263 | STL_map_int_subscript_or_insert | STL map operator[] implementation - finds or inserts node by integer key, returns value pointer. |
| 0x009BE5B0 | 83 | operator++ | STL tree iterator pre-increment operator; advances red-black tree node pointer to next in-order position. |
| 0x009BE610 | 83 | operator++ | STL tree iterator pre-increment operator advancing to next node in red-black tree traversal order |
| 0x009BE670 | 83 | operator++ | STL tree iterator pre-increment operator; advances to next node in binary search tree traversal by navigating right subtree or parent chain. |
| 0x009C1D30 | 78 | STL_rbtree_lower_bound_A | STL red-black tree lower_bound search; finds first node with key >= search value, stores result in param_2 |
| 0x009C1D80 | 78 | STL_rbtree_lower_bound_B | Finds the first red-black tree node with key >= search value, returns iterator or end if not found |
| 0x009C1DD0 | 93 | std_function__ctor_with_callback_A | Constructs std::function object with callback param_2, initializes vtable and SEH exception handler frame. |
| 0x009C1E30 | 93 | STL_function_construct_with_callback | Constructs std::function object with callback parameter, initializes vtable and stores callback reference in member |
| 0x009C1E90 | 93 | STL_function_constructor_with_callback | Constructs std::function object, initializes vtable and stores callback param_2 in member slot [1] |
| 0x009C1EF0 | 93 | std_function__ctor_with_callback_D | Constructs std::function object with callback param_2, initializing vtable and exception frame pointer. |
| 0x009C1F50 | 93 | std_function__ctor_with_callback_E | Constructs std::function object with callback parameter, initializing vtable and storing callback reference |
| 0x009C1FB0 | 93 | std_function__ctor_with_callback_F | Constructs std::function object with callback, initializes vtable and stores callback pointer in parameter object. |
| 0x009C2010 | 93 | std_function__ctor_with_callback_G | std::function constructor initializing callback wrapper with vtable pointer and storing function object reference |
| 0x009C2070 | 34 | stl_move_range_forward | Moves memory range forward and returns pointer to end of moved data in destination buffer. |
| 0x009C20A0 | 415 | stl_vector_ptr_reallocate | Reallocates an STL vector of pointers with size validation, alignment, and proper cleanup of old memory blocks. |
| 0x009C2280 | 28 | _Zero_range<> | STL template function that zeros a memory range from param_1 to param_2 using memset |
| 0x009C22A0 | 85 | stl_vector_rotate_by_reverse | Rotates vector elements by reversing sublists; moves range [param_3, param_4) to position param_2. |
| 0x009C2750 | 33 | std_function__destroy_stored | Destroys stored std::function object by calling its deleter virtual function and nullifying the pointer. |
| 0x009C2780 | 33 | std_function__destroy_stored_B | Destroys stored function object by invoking virtual destructor at offset 0x10, then nullifies the pointer. |
| 0x009C27B0 | 92 | std_function__destroy_with_seh_A | Destroys std::function object by invoking deleter on managed callable at offset +36, with SEH frame setup for exception safety. |
| 0x009C2810 | 92 | std_function__destroy_with_seh_B | Destroys std::function object by invoking virtual destructor on stored functor and clearing function pointer. |
| 0x009C2870 | 106 | stl_vector_ptr_deallocate | Deallocates STL vector memory with overflow detection, handling aligned pointer blocks and chunk headers. |
| 0x009C6380 | 22 | std_function__copy_constructor | Copy constructs a std::function object by setting vtable pointer and copying functor state from source. |
| 0x009C63A0 | 22 | STL_function_copy_ctor | Copy constructor for std::function wrapper; copies vtable pointer and target function object reference |
| 0x009C63C0 | 22 | std_function__copy_construct_vtable_D | Copy constructor for std::function wrapper; initializes vtable pointer and copies functor state from source object. |
| 0x009C63E0 | 22 | STL_function_copy_constructor | Copy constructor for std::function wrapper; copies vtable pointer and function object state from source to destination. |
| 0x009C6400 | 22 | std_function__copy_construct_vtable_F | Copy constructor for std::function wrapper; copies vtable pointer and function object data member. |
| 0x009C6420 | 22 | std_function__copy_construct_vtable_G | Copy constructs std::function object by setting vtable pointer and copying stored functor state from source. |
| 0x009C6440 | 22 | std_function__copy_construct_vtable_H | Copy constructor for std::function wrapper; copies vtable pointer and function object state from source to destination. |
| 0x009C6460 | 22 | std_function__copy_construct_vtable_I | Copy constructor for std::function wrapper; copies vtable pointer and target function object reference. |
| 0x009C6480 | 22 | STL_Function_CopyConstruct | Copy-constructs an std::function object by setting vtable and copying stored functor state |
| 0x009C64A0 | 22 | std_function__copy_construct_vtable_K | Copy constructs a std::function wrapper by setting vtable pointer and copying functor state from source. |
| 0x009C64C0 | 22 | std_function__copy_construct_vtable_L | Copy constructs a std::function object by setting vtable pointer and copying functor data member. |
| 0x009C64E0 | 22 | STL_Function_CopyConstructor | Copy constructs an STL function object by setting vtable pointer and copying stored function state. |
| 0x009C6500 | 22 | std_function__copy_construct_vtable_N | Copy constructs a std::function object by setting vtable pointer and copying stored function pointer/data. |
| 0x009C6520 | 22 | std_function__copy_construct_vtable_O | Copy constructs an std::function object by setting vtable pointer and copying stored function state. |
| 0x009C6540 | 22 | std_function__copy_construct_vtable_P | Copy constructor for std::function wrapper; copies vtable pointer and function object data. |
| 0x009C6560 | 22 | std_function__copy_construct_vtable_Q | Initializes std::function object by setting vtable pointer and copying functor state from source. |
| 0x009C6580 | 22 | std_function__copy_construct_vtable_R | Copy constructor for std::function wrapper; copies vtable pointer and stores functor state from source object. |
| 0x009C65A0 | 65 | stl_functor_conditional_delete_8_A | STL functor that conditionally deletes an 8-byte object based on boolean parameter; includes stack cookie validation. |
| 0x009C65F0 | 65 | STL_ConditionalDelete_8Byte | STL functor that conditionally deletes 8-byte heap objects based on boolean parameter with stack canary protection. |
| 0x009C6640 | 65 | stl_functor_conditional_delete_8_C | STL functor that conditionally deletes 8-byte heap objects based on boolean parameter; includes stack canary protection. |
| 0x009C6690 | 65 | stl_functor_conditional_delete_8_D | STL functor that conditionally deletes an 8-byte object based on boolean parameter; includes stack canary validation. |
| 0x009C66E0 | 65 | stl_functor_conditional_delete_8_E | Conditionally deletes 8-byte heap allocation if param_2 is true; wrapper around operator delete with stack canary protection. |
| 0x009C6730 | 65 | stl_functor_conditional_delete_8_F | STL functor that conditionally deletes an 8-byte object if param_2 is non-zero; includes stack canary protection. |
| 0x009C6780 | 65 | stl_functor_conditional_delete_8_G | STL functor that conditionally deletes 8-byte objects based on a boolean parameter; includes stack cookie validation. |
| 0x009C67D0 | 65 | stl_functor_conditional_delete_8_H | Conditional memory deallocation functor that deletes 8-byte objects only if condition parameter is true. |
| 0x009C6820 | 65 | stl_functor_conditional_delete_8_I | STL functor that conditionally deletes an 8-byte heap allocation based on boolean parameter; includes stack cookie validation. |
| 0x009C6870 | 65 | STL_ConditionalDelete_8bytes | STL functor that conditionally deletes 8-byte allocated memory if condition parameter is true, with stack guard. |
| 0x009C68C0 | 65 | stl_functor_conditional_delete_8_K | Conditional deleter functor that deallocates 8-byte objects only when condition parameter is true; includes stack canary protection. |
| 0x009C6910 | 65 | stl_functor_conditional_delete_8_L | Conditional memory deallocator functor that deletes 8-byte objects only if condition parameter is true, with stack canary protection. |
| 0x009C6960 | 65 | stl_functor_conditional_delete_8_M | STL functor that conditionally deletes an 8-byte object pointer based on boolean parameter; includes stack canary protection. |
| 0x009C69B0 | 65 | stl_functor_conditional_delete_8_N | Conditional memory deallocator functor that deletes 8-byte objects only when condition parameter is true, with stack canary protection. |
| 0x009C6A00 | 65 | stl_functor_conditional_delete_8_O | Functor that conditionally deletes an 8-byte heap object if condition param is true; includes stack canary check. |
| 0x009C6A50 | 65 | stl_functor_conditional_delete_8_P | Conditional memory deallocator functor that deletes 8-byte objects only when condition parameter is true |
| 0x009C6AA0 | 65 | stl_functor_conditional_delete_8_Q | Conditional deleter functor that deallocates 8-byte objects only when condition parameter is true, with stack canary protection. |
| 0x009C6E70 | 3 | stl_identity_passthrough | Identity function that returns input unchanged; used as STL functor or callback template parameter in container operations. |
| 0x009C6E80 | 22 | STL_function_copy_construct | Initializes std::function object by copying vtable pointer and functor data from source to destination. |
| 0x009C6EA0 | 22 | std_function__copy_construct_vtable_T | Initializes std::function vtable with copy constructor and copies function state from source object at param_1+4 |
| 0x009C6EC0 | 22 | std_function__copy_construct_vtable_U | Copy constructs std::function object by setting vtable pointer and copying stored functor data |
| 0x009C6EE0 | 22 | STL_function_copy_construct_vtable | Initializes std::function vtable with copy constructor and stores internal state from source function object. |
| 0x009C6F00 | 22 | STL_function_copy_constructor_W | Copy constructs std::function object by setting vtable pointer and copying functor state member. |
| 0x009C6F20 | 22 | std_function__copy_construct_vtable_X | Copies std::function object by setting vtable pointer and copying functor state from source to destination. |
| 0x009C6F40 | 22 | std_function__copy_construct_vtable_Y | Copy constructs std::function object by setting vtable pointer and copying stored functor state. |
| 0x009C6F60 | 22 | std_function__copy_construct | Copy constructs a std::function object by setting vtable pointer and copying stored function data member. |
| 0x009C6F80 | 22 | STL_Function_CopyConstructor_AA | Copy-constructs STL function object by setting vtable and copying function pointer from source. |
| 0x009C6FA0 | 22 | std_function__copy_construct_vtable_AB | Copy constructs a std::function object by copying vtable pointer and functor state from source |
Part 3 of STL/C++: functions 3,805 to 5,729, 0x009C6FC0 to 0x00FBED70
No function in this part matches that. Search all 43,836 functions instead.