Looking to form a coder team to write necessary resources

[Nestharus]

Thread title says it all.

If you're not busy with anything and feel like coding resources that can help the general community, just reply to the thread saying that you are working on whatever resource so that I can put your name next to the resource on the list. When done, we'll look over it and refine it if need be, then you get to submit it and we all get to use it for our maps, woo.

Resources to be coded

Sorting

Heap Sort
Merge Sort
Q Sort
​

Collections

Binary Tree Operations for Arrays
BST ~nestharus
AVL Tree
Red Black Tree
B-Tree
B+Tree
Kd-Tree (with balancing ofc)
Quad-Tree
Octal-Tree
Binary Heap (array + linked)
Catalog (see http://www.hiveworkshop.com/forums/jass-resources-412/snippet-catalog-192452/)
Hashtable (will be faster than data table? unknown)
Vector
​

Math

BigInt (support base conversion)
Ln
​

Combat

Damage Modifiers
​

Language

Eventually going to need a better language than Galaxy, but it sounds like grim001 is working on one.
​

Resources Finished

Dynamic Memory Allocator
http://www.hiveworkshop.com/forums/sc2-resources-675/linked-list-v1-0-0-1-a-220531/
http://www.hiveworkshop.com/forums/sc2-resources-675/queue-v1-0-0-0-a-220533/
http://www.hiveworkshop.com/forums/sc2-resources-675/stack-v1-0-0-0-a-220532/
​

 

[Dr Super Good]

Ln

I assume you are after something more advanced than just...

fixed Ln(fixed x){
    return Log2(x)/Log2(2.7182818);
}

Damage Modifiers

Um what?!

 

[Nestharus]

I assume you are after something more advanced than just...

fixed Ln(fixed x){
    return Log2(x)/Log2(2.7182818);
}

nop, that's it =)

 

[Dr Super Good]

A good idea would be some binary tree algorthims that work on generic arrays (for array mapped binary trees).

 

[Nestharus]

A good idea would be some binary tree algorthims that work on generic arrays (for array mapped binary trees).

Would you like to code that? : )

 

[Magtheridon96]

Is Galaxy an interpreted language? Or is it compiled? (I doubt that, I bet it's just as slow as JASS)

edit
Also, can Galaxy structs have functions inside them?
There are 0 tutorials on this language.

The best source I found only explains loops and that's just about it >.>

 

[Dr Super Good]

Is Galaxy an interpreted language? Or is it compiled? (I doubt that, I bet it's just as slow as JASS)

It compiles to byte code which is interpreted by a virtual machine similar to Java. Due to the way it compiles (at map start) one can expect the results to be not very optimized. Because it works with byte code it references variable using an address rather than a name which is why it runs so much faster than JASS and why it can only allocate so much space for variables.

Also, can Galaxy structs have functions inside them?

Obviously not. C does not allow it so why should Galaxy? Sounds a very silly place to put functions...

 

[Magtheridon96]

C++ allows them though.
Meh, we're totally fine without them.

 

[Dr Super Good]

Maybe you should specify the interface (header) for the systems you want done.