openscad/dotSCAD
1
0
Fork 0
mirror of https://github.com/JustinSDK/dotSCAD.git synced 2025-08-08 07:46:39 +02:00
Code Issues Releases Wiki Activity

refactor

Browse Source
This commit is contained in:
Justin Lin
2021-03-04 18:09:22 +08:00
parent d75412ace4
commit bb7d4ccb34
3 changed files with 55 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
src/collection/__comm__/_str_hash.scad Normal file
View File

@@ -0,0 +1,11 @@
use <../../util/sum.scad>;
function _str_hash(value) =
let(
s = str(value),
leng = len(s)
)
sum([
for(i = [0:leng - 1])
ord(s[i]) * pow(31, leng - 1 - i)
]);

23
src/collection/_impl/_hashset_impl.scad Normal file
View File

@@ -0,0 +1,23 @@
use <../../util/slice.scad>;
use <../../util/some.scad>;
function _hashset_add(set, elem, hash, eq) =
let(
idx = hash(elem) % len(set),
bucket = set[idx]
)
len(bucket) == 0 ? concat(slice(set, 0, idx), [[elem]], slice(set, idx + 1)) :
some(bucket, function(e) eq(e, elem)) ? set :
concat(
slice(set, 0, idx),
[concat(bucket, [elem])],
slice(set, idx + 1)
);
function _hashset(elems, leng, buckets, hash, eq, i = 0) =
i == leng ? buckets :
_hashset(elems, leng, _hashset_add(buckets, elems[i], hash, eq), hash, eq, i + 1);
function _find(lt, elem, eq, leng, i = 0) =
i == leng ? -1 :
eq(lt[i], elem) ? i : _find(lt, elem, eq, leng, i + 1);

51
src/collection/hashset.scad
View File

@@ -1,21 +1,28 @@
use <../util/sum.scad>; use <__comm__/_str_hash.scad>;
use <_impl/_hashset_impl.scad>;
use <../util/slice.scad>; use <../util/slice.scad>;
use <../util/some.scad>; use <../util/some.scad>;
function strhash(value) = // public functions: hashset, hashset_has, hashset_add, hashset_del, hashset_list
let(
s = str(value),
leng = len(s)
)
sum([
for(i = [0:leng - 1])
ord(s[i]) * pow(31, leng - 1 - i)
]);
df_hash = function(e) strhash(e); /*
use <collection/hashset.scad>;
s = hashset([1, 2, 3, 4, 5, 2, 3, 5]);
echo(hashset_list(s));
s2 = hashset_add(s, 9);
echo(hashset_list(s2));
echo(hashset_has(s2, 13));
echo(hashset_list(hashset_del(s2, 2)));
*/
df_hash = function(e) _str_hash(e);
df_eq = function(e1, e2) e1 == e2; df_eq = function(e1, e2) e1 == e2;
function hashset(elems, bucket_size = 16, hash = df_hash, eq = df_eq) = function hashset(elems, hash = df_hash, eq = df_eq, bucket_size = 16) =
let( let(
elems_undef = is_undef(elems), elems_undef = is_undef(elems),
size = elems_undef ? bucket_size : len(elems), size = elems_undef ? bucket_size : len(elems),
@@ -24,25 +31,11 @@ function hashset(elems, bucket_size = 16, hash = df_hash, eq = df_eq) =
elems_undef ? buckets : elems_undef ? buckets :
_hashset(elems, len(elems), buckets, hash, eq); _hashset(elems, len(elems), buckets, hash, eq);
function _hashset(elems, leng, buckets, hash, eq, i = 0) =
i == leng ? buckets :
_hashset(elems, leng, hashset_add(buckets, elems[i], hash, eq), hash, eq, i + 1);
function hashset_has(set, elem, hash = df_hash, eq = df_eq) = function hashset_has(set, elem, hash = df_hash, eq = df_eq) =
some(set[hash(elem) % len(set)], function(e) eq(e, elem)); some(set[hash(elem) % len(set)], function(e) eq(e, elem));
function hashset_add(set, elem, hash = df_hash, eq = df_eq) = function hashset_add(set, elem, hash = df_hash, eq = df_eq) =
let( _hashset_add(set, elem, hash, eq);
idx = hash(elem) % len(set),
bucket = set[idx]
)
len(bucket) == 0 ? concat(slice(set, 0, idx), [[elem]], slice(set, idx + 1)) :
some(bucket, function(e) eq(e, elem)) ? set :
concat(
slice(set, 0, idx),
[concat(bucket, [elem])],
slice(set, idx + 1)
);
function hashset_del(set, elem, hash = df_hash, eq = df_eq) = function hashset_del(set, elem, hash = df_hash, eq = df_eq) =
let( let(
@@ -59,10 +52,6 @@ function hashset_del(set, elem, hash = df_hash, eq = df_eq) =
slice(set, bidx + 1) slice(set, bidx + 1)
); );
function _find(lt, elem, eq, leng, i = 0) =
i == leng ? -1 :
eq(lt[i], elem) ? i : _find(lt, elem, eq, leng, i + 1);
function hashset_list(set) = [ function hashset_list(set) = [
for(bucket = set) for(bucket = set)
for(elem = bucket) for(elem = bucket)