mirror of
https://github.com/krgamestudios/Toy.git
synced 2026-04-15 14:54:07 +10:00
Kayne Ruse
14653a303f
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'
57 lines
1.8 KiB
C
57 lines
1.8 KiB
C
#pragma once
|
|
|
|
#include "toy_common.h"
|
|
|
|
#include "toy_bucket.h"
|
|
#include "toy_value.h"
|
|
|
|
//rope pattern
|
|
typedef struct Toy_String { //32 | 64 BITNESS
|
|
enum Toy_StringType {
|
|
TOY_STRING_NODE,
|
|
TOY_STRING_LEAF,
|
|
TOY_STRING_NAME,
|
|
} type; //4 | 4
|
|
|
|
unsigned int length; //4 | 4
|
|
unsigned int refCount; //4 | 4
|
|
unsigned int cachedHash; //4 | 4
|
|
|
|
union {
|
|
struct {
|
|
struct Toy_String* left; //4 | 8
|
|
struct Toy_String* right; //4 | 8
|
|
} node; //8 | 16
|
|
|
|
struct {
|
|
int _dummy; //4 | 4
|
|
char data[]; //- | -
|
|
} leaf; //4 | 4
|
|
|
|
struct {
|
|
Toy_ValueType type; //4 | 4
|
|
char data[]; //- | -
|
|
} name; //4 | 4
|
|
} as; //8 | 16
|
|
} Toy_String; //24 | 32
|
|
|
|
TOY_API Toy_String* Toy_createString(Toy_Bucket** bucketHandle, const char* cstring);
|
|
TOY_API Toy_String* Toy_createStringLength(Toy_Bucket** bucketHandle, const char* cstring, int length);
|
|
|
|
TOY_API Toy_String* Toy_createNameString(Toy_Bucket** bucketHandle, const char* cname); //for variable names
|
|
|
|
TOY_API Toy_String* Toy_copyString(Toy_Bucket** bucketHandle, Toy_String* str);
|
|
TOY_API Toy_String* Toy_deepCopyString(Toy_Bucket** bucketHandle, Toy_String* str);
|
|
|
|
TOY_API Toy_String* Toy_concatStrings(Toy_Bucket** bucketHandle, Toy_String* left, Toy_String* right);
|
|
|
|
TOY_API void Toy_freeString(Toy_String* str);
|
|
|
|
TOY_API int Toy_getStringLength(Toy_String* str);
|
|
TOY_API int Toy_getStringRefCount(Toy_String* str);
|
|
|
|
TOY_API char* Toy_getStringRawBuffer(Toy_String* str); //allocates the buffer on the heap, needs to be freed
|
|
|
|
TOY_API int Toy_compareStrings(Toy_String* left, Toy_String* right); //return value mimics strcmp()
|
|
|