PacketHistory and memory efficiency? #6995
Replies: 1 comment 8 replies
-
Hi Marek,
Yes, indeed due to the unordered set, the 16-byte To properly commit, you have to create a fork of the repository: https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/working-with-forks/fork-a-repo Then do your changes there, push to your fork and create a pull request: https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/proposing-changes-to-your-work-with-pull-requests/creating-a-pull-request-from-a-fork |
Beta Was this translation helpful? Give feedback.
Uh oh!
There was an error while loading. Please reload this page.
-
Hello.
I'm new here. I see sophisticated language constructs in code of PacketHistory.xxx (the little comlete thing), and as I get to know the code almost everything seems to be written that way, what completely explains why nodes are crashing later or sooner in cities with >200nodes that try to be reachable.
If I change one little configuration constant usually something breaks. Something which have only the system memory management in common.
So am I wrong - reagrding PacketHistory - to be efficient in allocationg 16Bytes (as stated in comment inside sources) used are techniques that need to allocate 40Bytes of heap per every new 16Byte element?
I try to write this module from scratch, but I don't know how to properly commit.
Can someone point me to guide to easy steps of how to contribute I will be glad to create pull request.
Regards, Marek
Beta Was this translation helpful? Give feedback.
All reactions