Comments (5)
Hey, great that you put so much work in finding the places that could be improved. I closed some old issues about a year ago because I thought nobody was interested anymore.
As I commented in #9 there are no allocations on the heap in the search algorithm. Only the utilities around it allocate. But they mostly Allocate short lived objects, that the compiler/gc can easily reason about. But these things could indeed improve.
But I don't want to slavishly work towards less allocations unless if it is giving problems. Zero allocations, like all performance optimizations shouldn't be done prematurely. And should only be done where it matters.
Do you have any problems, what is your use case, how are you using the library?
(In my own use case I search for paths on a separate thread, long paths but only a handful per second. In this case I don't notice any problems. I can imagine that in other use cases the code might not behave so nice. We can fix that!)
from astar.
You can DIY and create a pull request...
from astar.
Closing because of no response, and I'm working on a big refactor that will probably also alleviate some of these issues.
from astar.
How is the state of this issue? It is eatinng literally TONS of memory just for one 600x600 grid with only lateral movements enabled.
Thanks
from astar.
@JoNMii as far as I know there are no outstanding memory/performance issues with this library. But I'd be happy to improve things if someone show's me a case where the code behaves badly. As I care a lot about performance :).
I can't really do much with the comment 'TONS'. Is the memory used increasing more than you expect? For example I would expect a 600x600 grid to use 4x as much memory as a 300*300.
from astar.
Related Issues (20)
- Considering the size of the agent
- Finding closest path to unreachable end cell HOT 4
- Deterministic? HOT 2
- Info: v2 WIP version available on Master HOT 2
- Hidden Connect method HOT 3
- Documentation / IntelliSense support HOT 5
- Isometric Support HOT 1
- Coming to v3 HOT 3
- Path. HOT 3
- No issue just a question. HOT 3
- Saving and loading graphs HOT 7
- TODO: release new minor version with save/load changes HOT 1
- just question HOT 2
- Question: GPS coordinates HOT 3
- Question HOT 1
- Explanation on how velocity is used HOT 6
- Question : Bidirectional graph search HOT 1
- Question: obstacles HOT 3
- Discussion on algorithms HOT 5
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from astar.