Jump to content

FrostBug

Scripter III
  • Posts

    3967
  • Joined

  • Last visited

  • Days Won

    5
  • Feedback

    100%

Everything posted by FrostBug

  1. FrostBug

    OSBot 1.8.1-6

    Isn't the issue merely that the multiplier used in relation to lowestAvailableCameraPitchAngle is incorrect?
  2. Well, you may as well skip a step and use: MouseDestination dest = object.getMouseDestination(); sA.client.moveMouse(dest, true);
  3. There are 2 types of for loops; The 'standard' for loop which loops through a code block while a condition is true, executing some logic after every loop as well (usually incrementation). example: for(int i = 0; i < 10; i++) { //Code block } this would execute the code block until the variable i is no longer less than 10; And will increment i by one after each execution of the code block. This type of for loop is commonly used for iterating through arrays of primitive types, grabbing elements by index. another variation of the for loop (often referred to as a for-each loop) is used to pull elements out of a collection. This type of for-loop will only work with collections that implement the Iterable interface, and is essentially a limited iteration by the collections iterator. for(Object element : collection) { //Do something with the elementa }
  4. item#getName should return the correct name string as it is now. That is with the exception of noted items; For which it will return "null"; It's a known issue
  5. FrostBug

    v1.7.90-.97

    Awesome ! thanks
  6. FrostBug

    v1.7.90-.97

    .93 doesn't recognize MessageType.GAME; But rather has .GAME0, .GAME1, .GAME99 and a few other odd ones Kinda breaks certain scripts
  7. Bot class has a public getter for BotCanvas, which you can repaint or grab Graphics from; However, the getter is reobfuscated with every release I suppose you could grab it between compilations using reflection; Try something like this.. Field[] fields = bot.getClass().getDeclaredFields(); BotCanvas canvas = null; for (Field field : fields) { if (field.getType().isAssignableFrom(BotCanvas.class)) { try { field.setAccessible(true); canvas = (BotCanvas) field.get(bot); } catch (IllegalArgumentException | IllegalAccessException ex) { //Exception handling } } } if(canvas != null) { Graphics g = canvas.getGraphics(); //Grab graphics context canvas.repaint(); //Repaint }
  8. in .88 some infinite loops were given timeouts in the moveMouse method Probably other changes too, though
  9. tfw you didnt just quote his post to see that all the bb tags were empty
  10. What an insightful question ( ͡° ͜ʖ ͡°)
  11. ASM or reflection I reckon (As people have mentioned) I made a client once (For simple paint rendering of loaded NPCs & objects) in ASM; Learned a lot of bytecode from that; So I would definitely recommend giving it a try; Simple stuff anyway. Making a full blown botting client alone is.. not a good idea IMO
  12. FrostBug

    v1.7.87

    Praise lord @Zach!
  13. Nice Am curious as to how it clicks 2800 meters per second ;)
  14. Looks decent; But to make it even better, perhaps add in some checks to make sure that the right entity is clicked, if multiple entities of the same type is on the cursor @ Laz, does osbot2 do that?
  15. Not used particularly often in high-level scripts I reckon; But its used on occasion in games and graphical/mathematical programs I suppose
  16. FrostBug

    v1.7.82-6

    83 works perfectly fine for me, thanks!
  17. Sounds like it might be fun; I'd be interested if you really do succeed in assembling a capable team; And by capable, I do mean that they should have game-writing experrience and at least some of them MUST have networking experience Experrience with developing as a team required too
  18. PriorityQueue sorts whatever you insert into it by using its compareTo method; So you will want your NodeRectangle class to implement the Comparable interface (Comparable<NodeRectangle>), and compare their F values; Then calling poll on the PQ will always retrieve the best node with O(1) efficiency, and inserting into the PQ is O(log2n) efficiency
  19. Nice looking application c: although it can be improved in a few places :E, I see you're manually searching for the best node for each iteration; Which is extremely costly compared to using a PQ which does this for you upon insertion
  20. I can't imagine that plus signs would work fine, since they are interpreted as spaces a Dragon dagger(p+) for example, would be translated to Dragon+dagger(p+) = 3 words: "Dragon", "dagger(p" and ")"
  21. Note that certain items with apostrophe or plus signs in their name may require URL encoding replace "+" with %2B and replace " ' " (apostrophe) with %27
  22. FrostBug

    v1.7.77-79

    Any news regarding ItemDefinition#getName for noted items?
  23. JPS wouldn't be good for this type of graph at all He's not using a tile grid, but nodes placed somewhat randomly with X edges per node. JPS works best only when using a graph with large open spaces, like a tile grid. JPS would be inferior in this case, also due to the fact that his graph doesn't have any unwalkable nodes
×
×
  • Create New...