xxq250/Nasal-Interpreter
1
0
Fork 1
mirror of https://github.com/ValKmjolnir/Nasal-Interpreter.git synced 2026-07-23 11:28:45 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

📝 delete std/sort.nas & update test file

Browse Source
This commit is contained in:
ValKmjolnir
2023-07-23 00:30:14 +08:00
parent 8454bed0fe
commit a72a42fa41
13 changed files with 143 additions and 127 deletions
Download Patch File Download Diff File Expand all files Collapse all files
std/lib.nas
+29
View File
@@ -217,6 +217,35 @@ var println = func(elems...) {
return __println(elems);
}
# sort function using quick sort
# not very efficient... :(
var sort=func(){
srand(); # be aware! this causes global changes
var quick_sort_core=func(vec,left,right,cmp){
if(left>=right) return nil;
var base=left+int(rand()*(right-left));
(vec[left],vec[base])=(vec[base],vec[left]);
var (i,j,tmp)=(left,right,vec[left]);
while(i<j){
while(i<j and cmp(tmp,vec[j]))
j-=1;
vec[i]=vec[j];
while(i<j and cmp(vec[i],tmp))
i+=1;
vec[j]=vec[i];
j-=1;
}
vec[i]=tmp;
quick_sort_core(vec,left,i-1,cmp);
quick_sort_core(vec,i+1,right,cmp);
return nil;
}
return func(vec,cmp=func(a,b){return a<b;}){
quick_sort_core(vec,0,size(vec)-1,cmp);
return nil;
}
}();
var isfunc = func(f) {
return typeof(f)=="func";
}
std/sort.nas
-56
View File
@@ -1,56 +0,0 @@
# sort.nas
# valkmjolnir 2021/4/2
var sort=func(){
srand(); # be aware! this causes global changes
var quick_sort_core=func(vec,left,right,cmp){
if(left>=right) return nil;
var base=left+int(rand()*(right-left));
(vec[left],vec[base])=(vec[base],vec[left]);
var (i,j,tmp)=(left,right,vec[left]);
while(i<j){
while(i<j and cmp(tmp,vec[j]))
j-=1;
vec[i]=vec[j];
while(i<j and cmp(vec[i],tmp))
i+=1;
vec[j]=vec[i];
j-=1;
}
vec[i]=tmp;
quick_sort_core(vec,left,i-1,cmp);
quick_sort_core(vec,i+1,right,cmp);
return nil;
}
return func(vec,cmp=func(a,b){return a<b;}){
quick_sort_core(vec,0,size(vec)-1,cmp);
return nil;
}
}();
var var_sort=func(){
srand(); # be aware! this causes global changes
var quick_sort_core=func(vec,left,right){
if(left>=right) return nil;
var base=left+int(rand()*(right-left));
(vec[left],vec[base])=(vec[base],vec[left]);
var (i,j,tmp)=(left,right,vec[left]);
while(i<j){
while(i<j and tmp<vec[j])
j-=1;
vec[i]=vec[j];
while(i<j and vec[i]<tmp)
i+=1;
vec[j]=vec[i];
j-=1;
}
vec[i]=tmp;
quick_sort_core(vec,left,i-1);
quick_sort_core(vec,i+1,right);
return nil;
}
return func(vec){
quick_sort_core(vec,0,size(vec)-1);
return nil;
}
}();