Botre
Members
-
Joined
-
Last visited
Everything posted by Botre
-
weeee -
-
1950 :x inb4 2000. Maxi, please give out some free stuff to keep new users hooked :|
pls use getObjects() instead of objects.
Anne pls *self-censored*
Because I decided that's where that inheritance branch should end There's no need for it to been extendable. Making a class final really just makes it unextendable ^^
Yup. I currently only have one script an account so I only ever create one instance of it :p But yeah will probably make it static later on ^^
It's not only about quick reaction times. Knowing which tree or set of trees to chop next accurately and almost in real-time allows me write behavior accordingly, instead of hovering over the tree I last interacted with I can move the mouse / camera to the next target, prepare a right click, etc.... It also allows me to switch to a target B (closer to me because of movement) while walking to an initial target A. But yeah perhaps it doesn't justify a separate thread, but it doesn't seem to hurt anything as of now, we'll see ^^
public RSExperienceTable() { generateTable(126); } to public RSExperienceTable() { generateTable(500); } It would take 5 seconds. And it's unlikely I'll ever have to pay that time price :p If they were to update it to 500 with the current formula it would take 536870911 xp. Meaning you would have to calc a long every x seconds. But why stop at 500? Why not make the calculation return a BigDecimal, just to be safe, in case they add decimal levels?
That's why I'm using table look-up :p
It ended when the other player moved. I suppose I could add random camera movement but I'd rather have them fix it internally :p
Dat gif quality. It's actually on the tree but prioritizing the actions of the nearby player, it should just right click :p
(I was using version 2.3.39) I am trying to interact with the tree with .interact(String action);
Donates sperm. Mother goes to sperm bank to buy a baby. Welcome to the frather club.
It still uses table look-up (because it's cheaper). I made it generate the table though, because otherwise certain people will cry about it not being flexible (I personally really doubt they'll ever implement levels > 126 but whatever).
LAST UPDATE: MARCH 26, 2015 package org.bjornkrols.experience; import java.util.Arrays; /** * @author Bjorn Krols (Botre) * @version 0.1 * @since March 6, 2015 */ public final class ExperienceTable { /** * The maximum skill level in OSRS. */ private static final int MAXIMUM_LEVEL = 99; /** * A table holding the experience amounts for a specific number of levels. */ private static final int[] TABLE = create(MAXIMUM_LEVEL); private ExperienceTable() { // This class should never be instantiated. // Do not delete or make accessible. } /** * @return The total amount of experience required for the level. */ public static int getXp(int level) { return level == 0 ? 0 : TABLE[level - 1]; } /** * @return The level acquired by the amount of experience. */ public static int getLevel(int experience) { return Math.abs(Arrays.binarySearch(TABLE, experience) + 1); } /** * Creates the experience table. */ private static int[] create(int maximumLevel) { int[] table = new int[maximumLevel]; int experience = 0; for (int i = 1; i < maximumLevel; i++) { experience += Math.floor(i + 300 * Math.pow(2, i / 7.0)); table[i] = (int) Math.floor(experience / 4); } return table; } }
neato
Constant fast tree scanning. Really pays off when you need to switch targets quickly (when chopping low level trees for example). Don't worry, it's a safe and cost-efficient implementation.
