mirror of
https://github.com/UpsilonNumworks/Upsilon.git
synced 2026-01-19 00:37:25 +01:00
[poincare] Increase TreePool
This commit is contained in:
@@ -118,7 +118,7 @@ public:
|
||||
}
|
||||
|
||||
private:
|
||||
constexpr static int BufferSize = 2048;
|
||||
constexpr static int BufferSize = 4096;
|
||||
constexpr static int MaxNumberOfNodes = BufferSize/sizeof(TreeNode);
|
||||
constexpr static int MaxNumberOfStaticNodes = 200; // TODO: count how may are needed
|
||||
|
||||
|
||||
@@ -46,9 +46,9 @@ QUIZ_CASE(tree_by_reference_allocation_failures) {
|
||||
BlobByReference b(1);
|
||||
assert_pool_size(1);
|
||||
{
|
||||
BlobByReference array[100];
|
||||
BlobByReference array[500];
|
||||
assert(pool_size() > 1);
|
||||
assert(pool_size() < 100);
|
||||
assert(pool_size() < 500);
|
||||
}
|
||||
assert_pool_size(1);
|
||||
}
|
||||
|
||||
@@ -46,9 +46,9 @@ QUIZ_CASE(tree_by_value_allocation_failures) {
|
||||
BlobByValue b(1);
|
||||
assert_pool_size(1);
|
||||
{
|
||||
BlobByValue array[100];
|
||||
BlobByValue array[500];
|
||||
assert(pool_size() > 1);
|
||||
assert(pool_size() < 100);
|
||||
assert(pool_size() < 500);
|
||||
}
|
||||
assert_pool_size(1);
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user