This code is very unoptimized, should try reworking it.
|
this will work with any region clipping for 667 that loads only regions needed.
[Java] SERVER SIDE: CLIPPED FOLLOWING - Pastebin.com
do that
https://dl.dropboxusercontent.com/u/...20clipping.rar
add that to serverCode:Region.init();
This code is very unoptimized, should try reworking it.
But i guess it still Efficient enough to provide a good enough 667 clipping though right?
i guess some programmers are to lazy to type quality code.
No signature no problem.
Path finding without abstraction is disgusting and slow, this has little to no abstraction.
Mirrors in case.
https://paste.ee/p/Jx0aN
https://www.mediafire.com/?b6ostmsrq1123ar
This system needs a whole revamp. Thanks I guess, I don't know if anyone can test to verify.
For start there is no sense of a point, just two lists that contains x or y coordinates and the ordinal is in relation to the point. The path-finding algorithm also uses multiple if clauses that use hard-coded values mixed with binary operators. Due to the failure in abstracting points/paths this method is extremely verbose and difficult to read. It also only works for players but should can easily be modified to work for npcs or any other entities. It should also only return a list of points first then another method should be used to change the walking queue instead of the path-finding method. All in all being written in this way and the difficulty in reading it is much less intuitive to find issues and optimize the code.
it works and its an little faster. =)
« Previous Thread | Next Thread » |
Thread Information |
Users Browsing this ThreadThere are currently 1 users browsing this thread. (0 members and 1 guests) |