1
1
using System . Collections . Immutable ;
2
+ using System . Linq ;
2
3
using NUnit . Framework ;
3
4
4
5
namespace DotRecast . Detour . Test ;
@@ -37,6 +38,20 @@ public void TestFindNode()
37
38
}
38
39
}
39
40
41
+ int sum = counts . Sum ( ) ;
42
+ Assert . That ( sum , Is . EqualTo ( 10 ) ) ;
43
+
44
+ // check GetNodeIdx GetNodeAtIdx
45
+ for ( int i = 0 ; i < sum ; ++ i )
46
+ {
47
+ var node = pool . GetNodeAtIdx ( i ) ;
48
+ var nodeIdx = pool . GetNodeIdx ( node ) ;
49
+ var nodeByIdx = pool . GetNodeAtIdx ( nodeIdx ) ;
50
+
51
+ Assert . That ( node , Is . SameAs ( nodeByIdx ) ) ;
52
+ Assert . That ( nodeIdx , Is . EqualTo ( i ) ) ;
53
+ }
54
+
40
55
// check count
41
56
for ( int i = 0 ; i < counts . Length ; ++ i )
42
57
{
@@ -47,7 +62,7 @@ public void TestFindNode()
47
62
48
63
var node = pool . FindNode ( i ) ;
49
64
Assert . That ( nodes [ 0 ] , Is . SameAs ( node ) ) ;
50
-
65
+
51
66
var node2 = pool . FindNode ( i ) ;
52
67
Assert . That ( nodes [ 0 ] , Is . SameAs ( node2 ) ) ;
53
68
}
@@ -58,5 +73,12 @@ public void TestFindNode()
58
73
Assert . That ( n , Is . EqualTo ( 0 ) ) ;
59
74
Assert . That ( nodes , Is . Null ) ;
60
75
}
76
+
77
+ var totalCount = pool . GetNodeMap ( ) . Sum ( x => x . Value . Count ) ;
78
+ Assert . That ( totalCount , Is . EqualTo ( sum ) ) ;
79
+
80
+ pool . Clear ( ) ;
81
+ totalCount = pool . GetNodeMap ( ) . Sum ( x => x . Value . Count ) ;
82
+ Assert . That ( totalCount , Is . EqualTo ( 0 ) ) ;
61
83
}
62
84
}
0 commit comments