Function recursive_structures

libs/@local/hashql/core/src/intern/map.rs:920–986

()

    #[test]
    fn recursive_structures() {
        let heap = Heap::new();
        let map = InternMap::<LinkedList>::new(&heap);

        // Create a linked list using provisioned IDs
        let node3_id = map.provision();
        let node3 = map.intern_provisioned(
            node3_id,
            PartialLinkedList {
                value: 3,
                next_id: None,
            },
        );

        let node2_id = map.provision();
        let node2 = map.intern_provisioned(
            node2_id,
            PartialLinkedList {
                value: 2,
                next_id: Some(node3.id()),
            },
        );

        let node1_id = map.provision();
        let node1 = map.intern_provisioned(
            node1_id,
            PartialLinkedList {
                value: 1,
                next_id: Some(node2.id()),
            },
        );

        // Verify the links
        assert_eq!(node1.next_id, Some(node2.id()));
        assert_eq!(node2.next_id, Some(node3.id()));
        assert_eq!(node3.next_id, None);

        // Create a similar list but using the closure-based intern method
        let list = map.intern(|head_id| {
            // First create the tail node
            let tail = map.intern_partial(PartialLinkedList {
                value: 6,
                next_id: Some(head_id.value()),
            });

            // Then create the middle node pointing to the tail
            let middle = map.intern_partial(PartialLinkedList {
                value: 5,
                next_id: Some(tail.id()),
            });

            // Return the head partial that points to the middle
            PartialLinkedList {
                value: 4,
                next_id: Some(middle.id()),
            }
        });