mirror of
https://github.com/krgamestudios/Toy.git
synced 2026-04-15 23:04:08 +10:00
To help with storing strings within tables, I've replaced the unused '_padding' member of 'Toy_String' with 'cachedHash', which is set to zero on string allocation. The hash of a string isn't generated and stored until it's actually needed, as the rope pattern means not every string needs a hash - hopefully this will save unnecessarily wasted time. When a hash of a string is needed, the hashing function first checks to see if that string already has one, and if so, returns it. Again, less time wasted. When generating a new string hash, the hashing function takes the string's type into account, as node-based strings first need their contents assembled into a simple char buffer. Other changes include: * Changed 'TOY_VALUE_TO_*' to 'TOY_VALUE_FROM_*' * Changed 'TOY_VALUE_IS_EQUAL' to 'TOY_VALUES_ARE_EQUAL' * Added a missing '#pragma once' to 'toy_print.h'
134 lines
2.7 KiB
C
134 lines
2.7 KiB
C
#include "toy_stack.h"
|
|
#include "toy_console_colors.h"
|
|
|
|
#include <stdio.h>
|
|
|
|
int test_stack_basics() {
|
|
//allocate and free the stack
|
|
{
|
|
Toy_Stack* stack = Toy_allocateStack();
|
|
|
|
//check if it worked
|
|
if (
|
|
stack == NULL ||
|
|
stack->capacity != 64 ||
|
|
stack->count != 0)
|
|
{
|
|
fprintf(stderr, TOY_CC_ERROR "ERROR: failed to allocate Toy_Stack\n" TOY_CC_RESET);
|
|
Toy_freeStack(stack);
|
|
return -1;
|
|
}
|
|
|
|
Toy_freeStack(stack);
|
|
}
|
|
|
|
//push, peek and pop stack
|
|
{
|
|
Toy_Stack* stack = Toy_allocateStack();
|
|
|
|
//check if it worked (push)
|
|
Toy_pushStack(&stack, TOY_VALUE_FROM_INTEGER(42));
|
|
Toy_pushStack(&stack, TOY_VALUE_FROM_INTEGER(69));
|
|
Toy_pushStack(&stack, TOY_VALUE_FROM_INTEGER(420));
|
|
if (
|
|
stack == NULL ||
|
|
stack->capacity != 64 ||
|
|
stack->count != 3)
|
|
{
|
|
fprintf(stderr, TOY_CC_ERROR "ERROR: failed to push Toy_Stack\n" TOY_CC_RESET);
|
|
Toy_freeStack(stack);
|
|
return -1;
|
|
}
|
|
|
|
//check if it worked (peek)
|
|
Toy_Value top1 = Toy_peekStack(&stack);
|
|
if (
|
|
TOY_VALUE_IS_INTEGER(top1) != true ||
|
|
TOY_VALUE_AS_INTEGER(top1) != 420)
|
|
{
|
|
fprintf(stderr, TOY_CC_ERROR "ERROR: failed to peek Toy_Stack\n" TOY_CC_RESET);
|
|
Toy_freeStack(stack);
|
|
return -1;
|
|
}
|
|
|
|
//check if it worked (pop)
|
|
Toy_Value top2 = Toy_popStack(&stack);
|
|
if (
|
|
stack == NULL ||
|
|
stack->capacity != 64 ||
|
|
stack->count != 2 ||
|
|
TOY_VALUE_IS_INTEGER(top2) != true ||
|
|
TOY_VALUE_AS_INTEGER(top2) != 420)
|
|
{
|
|
fprintf(stderr, TOY_CC_ERROR "ERROR: failed to pop Toy_Stack\n" TOY_CC_RESET);
|
|
Toy_freeStack(stack);
|
|
return -1;
|
|
}
|
|
|
|
//check if it worked (post-pop peek)
|
|
Toy_Value top3 = Toy_peekStack(&stack);
|
|
if (
|
|
TOY_VALUE_IS_INTEGER(top3) != true ||
|
|
TOY_VALUE_AS_INTEGER(top3) != 69)
|
|
{
|
|
fprintf(stderr, TOY_CC_ERROR "ERROR: failed to pop then peek Toy_Stack\n" TOY_CC_RESET);
|
|
Toy_freeStack(stack);
|
|
return -1;
|
|
}
|
|
|
|
Toy_freeStack(stack);
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
int test_stack_stress() {
|
|
//stress the stack's contents
|
|
{
|
|
Toy_Stack* stack = Toy_allocateStack();
|
|
|
|
//allocate 500 values
|
|
for (int i = 0; i < 500; i++) {
|
|
Toy_pushStack(&stack, TOY_VALUE_FROM_INTEGER(i));
|
|
}
|
|
|
|
//check if it worked
|
|
if (
|
|
stack == NULL ||
|
|
stack->capacity != 512 ||
|
|
stack->count != 500)
|
|
{
|
|
fprintf(stderr, TOY_CC_ERROR "ERROR: failed to stress the Toy_Stack\n" TOY_CC_RESET);
|
|
Toy_freeStack(stack);
|
|
return -1;
|
|
}
|
|
|
|
Toy_freeStack(stack);
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
int main() {
|
|
//run each test set, returning the total errors given
|
|
int total = 0, res = 0;
|
|
|
|
{
|
|
res = test_stack_basics();
|
|
if (res == 0) {
|
|
printf(TOY_CC_NOTICE "All good\n" TOY_CC_RESET);
|
|
}
|
|
total += res;
|
|
}
|
|
|
|
{
|
|
res = test_stack_stress();
|
|
if (res == 0) {
|
|
printf(TOY_CC_NOTICE "All good\n" TOY_CC_RESET);
|
|
}
|
|
total += res;
|
|
}
|
|
|
|
return total;
|
|
}
|