Nodetree code from the testing unit:
Code:
// Nodetree test
AG_Nodetree* Nodetree = AG_NodetreeCreate();
AG_Nodetree* NodetreeChild1 = AG_NodetreeAddChild( Nodetree );
AG_Nodetree* NodetreeChild2 = AG_NodetreeAddChild( Nodetree );
AG_Nodetree* NodetreeChild3 = AG_NodetreeAddChild( Nodetree );
AG_NodetreeSetItem( NodetreeChild1, "Nodetree: 1" );
AG_NodetreeSetItem( NodetreeChild2, "Nodetree: 2" );
AG_NodetreeSetItem( NodetreeChild3, "Nodetree: 3" );
AG_NodetreeRemoveChild( NodetreeChild1 );
AG_NodetreeRemoveChild( NodetreeChild2 );
AG_Nodetree* NodetreeTemp = AG_NodetreeGetNext( Nodetree, NULL );
Value = AG_NodetreeGetItem( NodetreeTemp );
printf( "%s", Value );
AG_NodetreeRemove( Nodetree );
Please note that the notetree structure is one of the more advanced structs resulting in more code.