MCPcopy Create free account

hub / github.com/Water-Melon/Melon / functions

Functions1,346 in github.com/Water-Melon/Melon

⨍ Functions 1,346◇ Types & classes 323
↓ 1 callersFunctiontest_init_permutation
t/rc.c:220
↓ 1 callersFunctiontest_inline_decrease_delete
t/fheap.c:288
↓ 1 callersFunctiontest_inline_free
t/rbtree.c:526
↓ 1 callersFunctiontest_inline_insert_search
Test 11: inline insert/search */
t/rbtree.c:406
↓ 1 callersFunctiontest_inline_node_free
Test 16: inline node_free */
t/rbtree.c:578
↓ 1 callersFunctiontest_inline_ops
t/fheap.c:241
↓ 1 callersFunctiontest_inline_performance_benchmark
Test 47: performance benchmark - inline insert + search */
t/rbtree.c:1809
↓ 1 callersFunctiontest_inline_reset
Test 15: inline reset */
t/rbtree.c:545
↓ 1 callersFunctiontest_inline_root_search
Test 12: inline root_search */
t/rbtree.c:437
↓ 1 callersFunctiontest_inorder_traversal
Test 26: in-order traversal verification */
t/rbtree.c:1123
↓ 1 callersFunctiontest_insert_search
t/hash.c:193
↓ 1 callersFunctiontest_insert_search
Test 2: insert and search basic */
t/rbtree.c:61
↓ 1 callersFunctiontest_insert_with_malloc_val
t/hash.c:211
↓ 1 callersFunctiontest_integer_dec
t/expr.c:207
↓ 1 callersFunctiontest_integer_hex
t/expr.c:219
↓ 1 callersFunctiontest_integer_hex_upper
t/expr.c:231
↓ 1 callersFunctiontest_integer_oct
t/expr.c:243
↓ 1 callersFunctiontest_integer_zero
t/expr.c:255
↓ 1 callersFunctiontest_invalid_bits
Test invalid bits parameter */
t/aes.c:85
↓ 1 callersFunctiontest_invalid_input
* Test invalid inputs */
t/rs.c:295
↓ 1 callersFunctiontest_invalid_octal_real_fallback
Test: "09.5" — non-octal digit after leading 0, but real due to '.' */
t/expr.c:2133
↓ 1 callersFunctiontest_inverse_basic
t/matrix.c:155
↓ 1 callersFunctiontest_inverse_non_square
t/matrix.c:225
↓ 1 callersFunctiontest_inverse_preserves_input
t/matrix.c:242
↓ 1 callersFunctiontest_inverse_singular
t/matrix.c:206
↓ 1 callersFunctiontest_ipc_registration_perf
* Performance test: register many IPC handlers using hash table */
t/ipc.c:61
↓ 1 callersFunctiontest_is_websocket_detection
t/websocket.c:26
↓ 1 callersFunctiontest_iter_del_all
Test 40: iterate-delete: delete ALL nodes during iterate (current) */
t/rbtree.c:1581
↓ 1 callersFunctiontest_iter_del_both_multiple
Test 41: iterate-delete: delete both current and next at multiple positions */
t/rbtree.c:1602
↓ 1 callersFunctiontest_iter_del_large_scattered
Test 45: iterate-delete: large tree (100 nodes), delete scattered positions */
t/rbtree.c:1701
↓ 1 callersFunctiontest_iter_del_leaf
Test 33: iterate-delete: delete a leaf node (no children) */
t/rbtree.c:1415
↓ 1 callersFunctiontest_iter_del_max
Test 31: iterate-delete: delete the maximum (last visited) node */
t/rbtree.c:1371
↓ 1 callersFunctiontest_iter_del_min
Test 30: iterate-delete: delete the minimum (first visited) node */
t/rbtree.c:1349
↓ 1 callersFunctiontest_iter_del_multiple_consecutive
Test 38: iterate-delete: delete multiple consecutive nodes (current) */
t/rbtree.c:1532
↓ 1 callersFunctiontest_iter_del_next_near_end
Test 42: iterate-delete: delete next when current is second-to-last */
t/rbtree.c:1638
↓ 1 callersFunctiontest_iter_del_next_of_first
Test 36: iterate-delete: delete next of first node (delete 2nd visited) */
t/rbtree.c:1486
↓ 1 callersFunctiontest_iter_del_next_of_penultimate
Test 37: iterate-delete: delete next of second-to-last (delete max via next) */
t/rbtree.c:1510
↓ 1 callersFunctiontest_iter_del_one_child
Test 34: iterate-delete: delete node with one child */
t/rbtree.c:1438
↓ 1 callersFunctiontest_iter_del_root
Test 32: iterate-delete: delete the root node */
t/rbtree.c:1392
↓ 1 callersFunctiontest_iter_del_single_node
Test 43: iterate-delete single node tree - delete the only node */
t/rbtree.c:1660
↓ 1 callersFunctiontest_iter_del_skip_every_other
Test 39: iterate-delete: delete multiple via next (skip every other) */
t/rbtree.c:1555
↓ 1 callersFunctiontest_iter_del_two_children
Test 35: iterate-delete: delete node with two children */
t/rbtree.c:1461
↓ 1 callersFunctiontest_iter_del_two_nodes
Test 44: iterate-delete two node tree - delete first, verify second visited */
t/rbtree.c:1680
↓ 1 callersFunctiontest_iterate
t/queue.c:175
↓ 1 callersFunctiontest_iterate
t/hash.c:315
↓ 1 callersFunctiontest_iterate
t/rbtree.c:234
↓ 1 callersFunctiontest_iterate_early_stop
t/rbtree.c:273
↓ 1 callersFunctiontest_iterate_empty
t/queue.c:405
↓ 1 callersFunctiontest_iterate_empty
Test 8: iterate empty tree */
t/rbtree.c:303
↓ 1 callersFunctiontest_iterate_free_index_future_nonadj
t/queue.c:956
↓ 1 callersFunctiontest_iterate_free_index_tail
t/queue.c:904
↓ 1 callersFunctiontest_iterate_multi_queue_remove
t/queue.c:1350
↓ 1 callersFunctiontest_iterate_remove_all_at_once
t/queue.c:1462
↓ 1 callersFunctiontest_iterate_remove_current
t/queue.c:551
↓ 1 callersFunctiontest_iterate_remove_current_and_next
t/queue.c:787
↓ 1 callersFunctiontest_iterate_remove_current_and_prev
t/queue.c:1022
↓ 1 callersFunctiontest_iterate_remove_current_deferred_free
* Test: remove current node during iterate with actual key/val freers (M_HASH_F_KV). * Verifies: * 1) The freers are NOT called during the handler
t/hash.c:366
↓ 1 callersFunctiontest_iterate_remove_every_other
t/queue.c:1298
↓ 1 callersFunctiontest_iterate_remove_multiple_current
* Test: remove multiple current nodes during iterate with actual free. * All even-keyed nodes are removed (with M_HASH_F_KV). * Verifies that every
t/hash.c:416
↓ 1 callersFunctiontest_iterate_remove_next
t/queue.c:596
↓ 1 callersFunctiontest_iterate_remove_next_node
* Test: remove a non-current node (the next in the iter chain) during iterate. * This verifies that mln_hash_iterate reads next_idx AFTER the handler
t/hash.c:511
↓ 1 callersFunctiontest_iterate_remove_prev_via_queue_remove
t/queue.c:855
↓ 1 callersFunctiontest_iterate_remove_prev_via_queue_remove_wrap
* Test: wrap-around with mln_queue_remove() during iteration (previously visited head). * Same as test_iterate_remove_prev_via_queue_remove but with
t/queue.c:1395
↓ 1 callersFunctiontest_iterate_remove_previous
t/queue.c:712
↓ 1 callersFunctiontest_iterate_remove_single
t/queue.c:1198
↓ 1 callersFunctiontest_iterate_remove_then_abort
t/queue.c:1244
↓ 1 callersFunctiontest_iterate_remove_via_remove
t/queue.c:663
↓ 1 callersFunctiontest_iterate_remove_wraparound
t/queue.c:1140
↓ 1 callersFunctiontest_iterate_selective_queue_remove
t/queue.c:1079
↓ 1 callersFunctiontest_iterate_update_current
* Test: update current node via mln_hash_update during iterate. * Verifies: * 1) The in-place key/val swap works without breaking iteration * 2
t/hash.c:461
↓ 1 callersFunctiontest_iterate_with_remove
t/hash.c:336
↓ 1 callersFunctiontest_iterate_wraparound
t/queue.c:197
↓ 1 callersFunctiontest_k_zero
* Test k=0 decode path (no parity, just copy) */
t/rs.c:270
↓ 1 callersFunctiontest_key_exist
t/hash.c:257
↓ 1 callersFunctiontest_key_free
* Test 12: key_free callback */
t/fheap.c:558
↓ 1 callersFunctiontest_keywords
2. Keywords: "on" and "off" map to custom keyword tokens */
t/lex.c:140
↓ 1 callersFunctiontest_known_primes
t/prime_generator.c:54
↓ 1 callersFunctiontest_large_data
t/md5.c:248
↓ 1 callersFunctiontest_large_data
t/rc.c:171
↓ 1 callersFunctiontest_large_data
Test 4: Large data send and receive */
t/connection.c:190
↓ 1 callersFunctiontest_large_data
* Test with larger data sizes */
t/rs.c:332
↓ 1 callersFunctiontest_large_queue
t/queue.c:378
↓ 1 callersFunctiontest_large_tree
Test 20: large tree (1000 nodes) */
t/rbtree.c:695
↓ 1 callersFunctiontest_lazy_quantifiers
t/regexp.c:796
↓ 1 callersFunctiontest_leading_colon_func
Test: leading colon before function call */
t/expr.c:2023
↓ 1 callersFunctiontest_leading_colon_number
Test: colon before numeric constant */
t/expr.c:2037
↓ 1 callersFunctiontest_leading_colon_variable
Test: leading colon should be skipped like lex-based parser */
t/expr.c:1995
↓ 1 callersFunctiontest_lex_dup_test
====================================================================== */ 12. test_lex_dup */ ==
t/parser_generator.c:357
↓ 1 callersFunctiontest_lex_result_clean
16. lex_result_clean */
t/lex.c:541
↓ 1 callersFunctiontest_literal_match
t/regexp.c:44
↓ 1 callersFunctiontest_log_accessors
* test accessor functions */
t/log.c:61
↓ 1 callersFunctiontest_log_before_init
* test log before init (stderr only) */
t/log.c:128
↓ 1 callersFunctiontest_log_format_specifiers
* test all format specifiers */
t/log.c:28
↓ 1 callersFunctiontest_log_levels
* test basic log output at all levels */
t/log.c:15
↓ 1 callersFunctiontest_log_writen
* test mln_log_writen */
t/log.c:82
↓ 1 callersFunctiontest_long_identifier
22. Long identifier (tests buffer growth) */
t/lex.c:687
↓ 1 callersFunctiontest_long_key
t/rc.c:89
↓ 1 callersFunctiontest_long_length
t/asn1.c:172
↓ 1 callersFunctiontest_long_string
=========================================================== * 10. Long string single-alloc stress * ===============================================
t/string.c:524
↓ 1 callersFunctiontest_loop
t/expr.c:617
← previousnext →601–700 of 1,346, ranked by callers