freenode/#shirakumo - IRC Chatlog
Search
12:06:21
Shinmera
Fixed the Trial problem where dymanic insertions (compile-into-pass) would not properly reinstate the order.
12:06:41
Shinmera
As a side effect there's now the functions ENTER* and LEAVE* that should be used for dynamic insertions.
12:07:07
Shinmera
ENTER and LEAVE from before should only be used for things that don't require rendering, or during a static load block.
12:21:16
Shinmera
I've also been thinking about ripping out Flare and replacing the indexed-set thingy with something better.
12:26:02
Shinmera
Maybe something like a flat vector with a deletion counter and compaction only once the counter gets too high.
12:26:25
Shinmera
or splitting into chunks of limited size so the maximum work per deletion is always bounded.
12:26:51
Shinmera
Could probably also get away with an unsorted table iteration for a lot of things.\
12:38:40
Shinmera
Well, 1) flare is barely used so it's a whole system and complexity that's kinda shitty to have around
12:38:56
Shinmera
2) yes, speed. The indexed set uses a doubly-linked list, which is not great for what you do most with it: iteration
12:50:44
selwyn
hopefully avoiding wasteful re-renders will help the situation, but alloy is weirdly slow
12:51:51
Shinmera
text is reuploaded to the gpu every frame because of the allocation problems I talked about
12:52:51
Shinmera
if we can allocate a buffer for every text that problem goes away entirely, but then we have to know when and how to deallocate.
12:55:52
selwyn
is the focus invariant you mentioned that only one thing can have strong focus in the tree?
12:57:57
Shinmera
At any time there's always exactly one thing that has strong focus. Additionally, an element can only be weakly focused if either its parent is strongly focused, or a child in the tree is strongly focused.
12:58:17
Shinmera
I had a case where an element should have had strong focus, and in fact it was still set as the focused element, but its focus value was nil.
13:23:52
selwyn
well, i suppose it's somewhat acceptable to postpone that in a ui toolkit that's meant for games
14:33:35
selwyn
you can do fourier transforms in any number of dimensions, as well as over arbitrary finite groups, function spaces, lots of places
14:35:29
selwyn
the higher dimensional ones are not really useful in signal processing afaict, which is why they are somewhat neglected i guess
14:50:58
selwyn
cancel that, some kind soul has made a n-dimensional fourier transform in common lisp
15:34:50
Shinmera
Spawning ten threads each opening and closing 1000 times gets me ~225 connections per second for each thread.
15:39:30
Shinmera
Across the 100 threads looks like they can each send around 4'500 messages per second.
15:57:18
Shinmera
Looks like on my machine I can get around 14'500 messages per second delivered and received (so full round-trip)