GitHub/gf-core
1
0
Fork 1
mirror of https://github.com/GrammaticalFramework/gf-core.git synced 2026-05-20 00:22:51 -06:00
Code Issues Packages Projects Releases Wiki Activity

simpler but working name allocator

Browse Source
This commit is contained in:
Krasimir Angelov
2022-12-10 18:43:26 +01:00
parent 8f7e4c084c
commit 00227014b8
1 changed files with 32 additions and 48 deletions
Download Patch File Download Diff File Expand all files Collapse all files

80
src/runtime/c/pgf/namespace.h
View File

@@ -324,6 +324,8 @@ Namespace<V> namespace_insert(Namespace<V> map, ref<V> value)
} }
} }
static constexpr char alphabet[] = "0123456789abcdefghijklmnopqrstuvwxyz";
template <class V> template <class V>
class PgfNameAllocator { class PgfNameAllocator {
size_t available; size_t available;
@@ -332,6 +334,32 @@ class PgfNameAllocator {
ref<V> value; ref<V> value;
PgfText *name; PgfText *name;
Namespace<V> insert(Namespace<V> map)
{
if (map == 0) {
value = PgfDB::malloc<V>(name->size+1);
memcpy(&value->name, name, sizeof(PgfText)+name->size+1);
return Node<ref<V>>::new_node(value);
}
int cmp = textcmp(name,&map->value->name);
if (cmp < 0) {
Namespace<V> left = insert(map->left);
if (left != 0) {
map = Node<ref<V>>::upd_node(map,left,map->right);
return Node<ref<V>>::balanceL(map);
}
} else if (cmp > 0) {
Namespace<V> right = insert(map->right);
if (right != 0) {
map = Node<ref<V>>::upd_node(map,map->left,right);
return Node<ref<V>>::balanceR(map);
}
}
return 0;
}
public: public:
PgfNameAllocator(PgfText *name_pattern) PgfNameAllocator(PgfText *name_pattern)
{ {
@@ -383,54 +411,10 @@ public:
Namespace<V> allocate(Namespace<V> map) Namespace<V> allocate(Namespace<V> map)
{ {
static char alphabet[] = "0123456789abcdefghijklmnopqrstuvwxyz";
if (map == 0) {
value = PgfDB::malloc<V>(name->size+1);
memcpy(&value->name, name, sizeof(PgfText)+name->size+1);
return Node<ref<V>>::new_node(value);
}
for (;;) { for (;;) {
int cmp; Namespace<V> new_map = insert(map);
size_t i; if (new_map != 0)
for (i = 0; ; i++) { return new_map;
if (i >= name->size) {
cmp = -(i < map->value->name.size);
break;
}
if (i >= map->value->name.size) {
cmp = 1;
break;
}
if (name->text[i] > map->value->name.text[i]) {
cmp = 1;
break;
} else if (name->text[i] < map->value->name.text[i]) {
cmp = -1;
break;
}
}
if (cmp < 0) {
Namespace<V> left = allocate(map->left);
if (left != 0) {
map = Node<ref<V>>::upd_node(map,left,map->right);
return Node<ref<V>>::balanceL(map);
}
} else if (cmp > 0) {
Namespace<V> right = allocate(map->right);
if (right != 0) {
map = Node<ref<V>>::upd_node(map,map->left,right);
return Node<ref<V>>::balanceR(map);
}
} else {
return 0;
}
if (i >= fixed)
return 0;
if (name->size >= available) { if (name->size >= available) {
size_t new_size = name->size + 10; size_t new_size = name->size + 10;
@@ -443,7 +427,7 @@ public:
available = new_size; available = new_size;
} }
i = name->size++; size_t i = name->size++;
while (i >= fixed) { while (i >= fixed) {
name->text[i+1] = name->text[i]; name->text[i+1] = name->text[i];
i--; i--;