mirror/shash
1
0
Fork 0
mirror of https://github.com/rxi/shash.git synced 2024-11-24 08:44:36 +00:00
Code Issues Packages Projects Releases Wiki Activity
10 Commits 1 Branch 0 Tags 37 KiB
d4d1b9a0d8
Commit Graph

10 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
=
d4d1b9a0d8 Add object itself to the collision set instead of checking it each iteration 2022-06-22 08:40:56 +03:00
=
56a0dc8d5f Use clear in shash:clear too 2022-06-16 19:01:17 +03:00
=
9004e35d4a Use LuaJIT's table.clear where possible 2022-06-16 16:51:01 +03:00
=
e761142dee Version 0.1.2 2022-06-16 16:39:09 +03:00
=
3ca0d85dc9 Micro optimizations for LuaJIT 2022-06-16 16:36:06 +03:00
=
8f59f8f7ba Reduce the repeated usage of cell_position in update 2022-06-16 16:31:39 +03:00
rxi
7e2bbef019 Version 0.1.1 2017-04-03 19:36:31 +01:00
rxi
3718c5a827 Updated copyright year 2016 -> 2017 2017-04-03 19:35:52 +01:00
rxi
90476217a3 Made :each()'s order deterministic 
As table hashes are generated from their GC pointer, and these pointers
are potentially different each time a program is run, using them for
keys in a table causes the iteration order to potentially differ between
runs, too. This commit changes each_overlapping_entity() to not iterate
the set of entities, assuring the order in which :each() passes entities
to the callback function is deterministic.
 2017-03-23 19:13:34 +00:00
rxi
6a6a7dea85 Initial commit 2016-08-20 09:13:52 +01:00