The Computer And General Tech Thread - Software, Hardware, Questions, etc.

[Travis B.]

I have created an extensible, user-friendly HTTP (mind you, not HTTPS) server for zeptoforth and, on top of it, a basic demo illustrating its use and a simple HTTP file server. While I had previously created HTTP servers for zeptoforth, they weren't easily extensible and were essentially single-purpose demos.

The source code for the HTTP server is at https://github.com/tabemann/zeptoforth/ ... _server.fs.

The source code for the HTTP file server is at https://github.com/tabemann/zeptoforth/ ... r_files.fs.

The source code for the HTTP demo is at https://github.com/tabemann/zeptoforth/ ... er_demo.fs.

And here are some screenshots:

picocalc_http_server_dump_tasks.png (93.51 KiB) Viewed 12951 times

picocalc_http_server_files.png (55.03 KiB) Viewed 12951 times

picocalc_http_server_files_matrix.png (115.14 KiB) Viewed 12951 times

[jcb]

Cloudflare is going to block AI crawlers soon.
- https://www.nbcnews.com/tech/tech-news/ ... rcna352446

[Travis B.]

Here are a few different fractals generated with Lindenmayer systems using turtle graphics under zeptoforth.

A Gosper curve ─ the source code is at https://github.com/tabemann/zeptoforth/ ... _gosper.fs

GOSPER.PNG (12.11 KiB) Viewed 12648 times

A Lévy C curve ─ the source code is at https://github.com/tabemann/zeptoforth/ ... e_levyc.fs

LEVYC.PNG (10.61 KiB) Viewed 12648 times

A plant ─ the source code is at https://github.com/tabemann/zeptoforth/ ... e_plant.fs

PLANT.PNG (12.57 KiB) Viewed 12648 times

[zompist]

Those are really pretty, Travis!

[Ares Land]

Seconded!

[WeepingElf]

Those are really pretty, Travis!

They are!

[Glenn]

Seconded!

Thirded! Those are really lovely!

[Travis B.]

Thank you guys!

[Travis B.]

I have implemented four L-system 'bushes' from https://paulbourke.net/fractals/lsys/:

https://github.com/tabemann/zeptoforth/ ... r_bush0.fs

BUSH0.PNG (6.78 KiB) Viewed 12563 times

https://github.com/tabemann/zeptoforth/ ... r_bush1.fs

BUSH1.PNG (20.37 KiB) Viewed 12563 times

[Travis B.]

https://github.com/tabemann/zeptoforth/ ... r_bush2.fs

BUSH2.PNG (20.19 KiB) Viewed 12563 times

https://github.com/tabemann/zeptoforth/ ... r_bush3.fs

BUSH3.PNG (19.99 KiB) Viewed 12563 times

[Travis B.]

https://github.com/tabemann/zeptoforth/ ... riangle.fs

TRIANGLE.PNG (22.23 KiB) Viewed 12509 times

https://github.com/tabemann/zeptoforth/ ... er_star.fs

STAR.PNG (4.01 KiB) Viewed 12509 times

https://github.com/tabemann/zeptoforth/ ... owflake.fs

QDSNWFLK.PNG (4.72 KiB) Viewed 12509 times

[Travis B.]

More L-systems, now of my creation! As you can tell by this point, I am on an L-system kick at the moment.

https://github.com/tabemann/zeptoforth/ ... y_bush0.fs

MYBUSH0.PNG (26.58 KiB) Viewed 12474 times

https://github.com/tabemann/zeptoforth/ ... y_bush1.fs

MYBUSH1.PNG (25.35 KiB) Viewed 12474 times

[Travis B.]

https://github.com/tabemann/zeptoforth/ ... y_bush2.fs

MYBUSH2.PNG (11.12 KiB) Viewed 12474 times

https://github.com/tabemann/zeptoforth/ ... y_bush3.fs

MYBUSH3.PNG (14.3 KiB) Viewed 12474 times

[Raphael]

Great!

[alice]

Niiiice!

[Travis B.]

Here is a port of the "Quiverbloom" demo for QB64 to zeptoforth on the RP2350 for the PicoCalc. It is slow, I must admit, but it runs. The source code is at https://github.com/tabemann/zeptoforth/ ... erbloom.fs. The original code it is based off of is at https://github.com/oonap0oo/QB64-projec ... bloom2.bas.

And here are some screenshots:

QVBLOOM0.PNG (11.92 KiB) Viewed 12392 times

QVBLOOM1.PNG (14.54 KiB) Viewed 12392 times

QVBLOOM2.PNG (15.22 KiB) Viewed 12392 times

[WeepingElf]

Very beautiful! Thanks for sharing!

[Travis B.]

I found a neat fast floating-point square root approximation algorithm (which was used in Quake III Arena of all things), and I am going to add it to my code when I get home -- it should make it faster overall.

[bradrn]

I found a neat fast floating-point square root approximation algorithm (which was used in Quake III Arena of all things), and I am going to add it to my code when I get home -- it should make it faster overall.

Fast inverse square root, I think you mean. (It’s pretty famous.)

[Travis B.]

I found a neat fast floating-point square root approximation algorithm (which was used in Quake III Arena of all things), and I am going to add it to my code when I get home -- it should make it faster overall.

Fast inverse square root, I think you mean. (It’s pretty famous.)

Yes, Quake III Arena is using it for the inverse, but I'll be using it for the inverse of the inverse by doing the following:

Code: Select all

: vapproxisqrt { x -- isqrt }
  x 0.5e0 v* { x2 }
  $5F3759DF x 1 arshift - { y } \ yes, this is correct
  y 1.5e0 x2 y v* y v* v- v* \ 1st iteration of Newton-Raphson
;
: vapproxsqrt ( x -- sqrt ) dup vapproxisqrt v* ;