sml-projects

partial refactoring so we use EnemyMap.t for collection of enemies

2025-02-13 13:36:30 +00:00

bin-search.sml

implement bin-vec (vector that always stores its elements in order, for binary search)

2025-01-19 12:06:56 +00:00

bin-vec.sml

implement code for precomputing reachable platforms so it can be reused (but haven't modified implementation of Dijkstra's algorithm to use it, and haven't added it to game type yet)

2025-01-31 03:46:28 +00:00

block.sml

scale player.sml in the same way that wall.sml is being scaled, and also: make 'x' and 'y' arguments to Block.lerp Real32.real values rather than int values (with calling code making the necessary changes) as the code was converting between int and real multiple times

2024-12-17 09:16:22 +00:00

chain-edge.sml

add asset for ChainEdge (attack)

2025-02-07 13:42:38 +00:00

collision.sml

extract a couple of collision functions to a separate module for reuse

2025-02-08 08:39:04 +00:00

constants.sml

add code so that bat also moves vertically (in addition to previous horizontal movement) when updating enemy state

2025-02-12 00:25:55 +00:00

entity-type.sml

refactor file order in preparation for adding GapMap for enemy

2025-02-13 11:24:44 +00:00

field.sml

draw basic field over player when player is attacking

2024-12-28 04:06:27 +00:00

game-type.sml

partial refactoring so we use EnemyMap.t for collection of enemies

2025-02-13 13:36:30 +00:00

game-update.sml

partial refactoring so we use EnemyMap.t for collection of enemies

2025-02-13 13:36:30 +00:00

graph.sml

precompute graph to be used for dijkstra's algorithm, resulting in CPU usage that never exceed 7/home/humza/Downloads/sml/oh-my-stars/fcore/path-finding.sml with 5 enemies and eliminating lag

2025-01-31 04:32:53 +00:00

path-finding.sml

precompute graph to be used for dijkstra's algorithm, resulting in CPU usage that never exceed 7/home/humza/Downloads/sml/oh-my-stars/fcore/path-finding.sml with 5 enemies and eliminating lag

2025-01-31 04:32:53 +00:00

physics.sml

refactor file order in preparation for adding GapMap for enemy

2025-02-13 11:24:44 +00:00

platform.sml

write code for new loop implementation of dijkstra's algorithm, which uses a precomputed graphy; however, this is not used yet as we need to add the graph to the game type first, and pass it along with other parameters, down to the path-finding.sml function

2025-01-31 04:10:58 +00:00

player-patch.sml

refactor file order in preparation for adding GapMap for enemy

2025-02-13 11:24:44 +00:00

player.sml

partial refactoring so we use EnemyMap.t for collection of enemies

2025-02-13 13:36:30 +00:00

projectile.sml

fix compile errors after previous commit (which involved reimplementing the quad tree to eliminate the possibility of a class of bugs I was experiencing; the problem was that the quad bounds were being passed recursively in different functions, but the long argument list in these functions made it difficult to see where the mismatch was)

2025-01-27 23:41:59 +00:00

quad-tree-fold.sml

add code so that bat also moves vertically (in addition to previous horizontal movement) when updating enemy state

2025-02-12 00:25:55 +00:00

quad-tree-type.sml

add code so that bat also moves vertically (in addition to previous horizontal movement) when updating enemy state

2025-02-12 00:25:55 +00:00

quad-tree.sml

partial refactoring so we use EnemyMap.t for collection of enemies

2025-02-13 13:36:30 +00:00

trace-jump.sml

refactor file order in preparation for adding GapMap for enemy

2025-02-13 11:24:44 +00:00

wall.sml

fix compile errors after previous commit (which involved reimplementing the quad tree to eliminate the possibility of a class of bugs I was experiencing; the problem was that the quad bounds were being passed recursively in different functions, but the long argument list in these functions made it difficult to see where the mismatch was)

2025-01-27 23:41:59 +00:00