Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Entity Component System In Symta

Name: Anonymous 2015-06-27 0:55

Example Use:
https://github.com/saniv/symta/blob/master/src/ecs_test.s

Implementation:
https://github.com/saniv/symta/blob/master/src/ecs.s

Running the example would produce:
(123 456 789)
gasoline
(car (0 1))(wheels (1 (2 4 6 8)))(engine (1 gasoline))(chassis (1 0))(wheel (2 3)(4 5)(6 7)(8 9))(scale )(direction (1 (0 0 0))(3 (0 0 0))(5 (0 0 0))(7 (0 0 0))(9 (0 0 0)))(xyz (1 (0 0 0))(3 (0 0 0))(5 (0 0 0))(7 (0 0 0))(9 (0 0 0)))

Name: Anonymous 2015-06-27 0:57

Note that Car.wheels.1.xyz doesn't got through hashtables, but more like a vtable access. So it should be fast enough

Name: Anonymous 2015-06-28 10:37

Updated the implementation, now everything is made out of components - even arrays. Which makes it easier to serialize stuff.

the example code now gives:
(1 2 3)
gasoline
(4 5 6)
(wheels (0 (4 8 12 16)))(engine (0 gasoline))(chassis (0 0))(n7_ )(n6_ )(n5_ )(n4_ )(n3_ (3 16))(n2_ (1 6)(2 0)(3 12)(6 0)(7 0)(10 0)(11 0)(14 0)(15 0)(18 0)(19 0))(n1_ (1 5)(2 0)(3 8)(6 0)(7 0)(10 0)(11 0)(14 0)(15 0)(18 0)(19 0))(n0_ (1 4)(2 0)(3 4)(6 0)(7 0)(10 0)(11 0)(14 0)(15 0)(18 0)(19 0))(wheel (4 5)(8 9)(12 13)(16 17))(direction (0 (0 0 0))(5 (0 0 0))(9 (0 0 0))(13 (0 0 0))(17 (0 0 0)))(xyz (0 (4 5 6))(5 (0 0 0))(9 (0 0 0))(13 (0 0 0))(17 (0 0 0)))


Runtime was updated too, because I've found bug with add_lib_folder, not collapsing multiple '/'-slashes into one, so "/usr/lib" and "/usr/lib/" were treated as separate folders.

Name: Anonymous 2015-06-29 0:15

i love you

Name: Anonymous 2015-06-29 12:01

>>1
Too bad you're still a degenerate racist ;-)

Name: Anonymous 2015-06-29 21:58

>>5
No. I'm not a racist. I'm fighting for minority rights nowadays: http://forum.freegamedev.net/viewtopic.php?f=46&t=6405

There is just so much injustice and prejudice in this racial excluding world!

Name: Anonymous 2015-06-30 1:33

I love what you're doing with symta but why do you start new threads about your symta updates? Is it a little easier than finding your old threads about symta?

Name: Anonymous 2015-06-30 2:26

>>7
older threads are historic and many them of were hijacked into political discourse, beyond repair

Name: Anonymous 2015-06-30 7:24

Jackson 5 GET.

Name: Anonymous 2015-06-30 19:12

>>9
Epic! xD

Name: Anonymous 2015-06-30 19:38

Dub Checking System in Symta

Name: Anonymous 2015-06-30 22:39

Symta doesn't pass the man or boy test, so it's irrelevant.

Please, don't post about Symta any more, until it passes the man or boy test.

Name: Anonymous 2015-06-30 23:06

>>12
shit off poop face

Name: Anonymous 2015-06-30 23:36

>>12
Only Algol really passes it, because it depends on a very inefficient evaluation strategy. Haskell is slow exactly because of trying to emulate it.

Name: Anonymous 2015-06-30 23:46

>>12
Was there even proof of this claim to begin with?

Name: Anonymous 2015-07-01 0:12

When is Nikita going to release her Symta browser and IDA killer?

Nikita is all talk and no action.

Name: Anonymous 2015-07-01 0:16

>>16
Nikita haven't promised to release IDA killer. But long time ago he has released a working 32bit and 16bit x86 disassembler. Browsers nowadays require too much effort and have more code than OS kernel.

Name: Anonymous 2015-07-01 0:18

Name: Anonymous 2015-07-01 1:53

G-d dammit it nikita.

https://github.com/saniv/ancient-symta-versions/blob/master/v0.1/examples/huffman
huff Xs -> Xs,sort,{[X@Xs Ys:_:@(nb X)]->[[Xs,len+1 X]@Ys,r]} | sort by=lhd
| {[[A X] [B Y] @Xs]->bins A+B [X Y] Xs | r; [[_ X]]->X}
| {Bs [A B]->[@(r [@Bs 0] A) @(r [@Bs 1] B)]; Bs X->[[X Bs]]} []
huffEnc Xs -> Fs:(sort Xs,huff by=lhd) mapc (bget ? Fs) Xs
huffEnc "The algorithm for generating a Huffman tree is very simple." | say

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List