L2EnchantSkillLearn.java 3.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129
  1. /*
  2. * This program is free software: you can redistribute it and/or modify it under
  3. * the terms of the GNU General Public License as published by the Free Software
  4. * Foundation, either version 3 of the License, or (at your option) any later
  5. * version.
  6. *
  7. * This program is distributed in the hope that it will be useful, but WITHOUT
  8. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
  9. * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
  10. * details.
  11. *
  12. * You should have received a copy of the GNU General Public License along with
  13. * this program. If not, see <http://www.gnu.org/licenses/>.
  14. */
  15. package com.l2jserver.gameserver.model;
  16. import com.l2jserver.gameserver.datatables.EnchantGroupsData;
  17. import com.l2jserver.gameserver.model.L2EnchantSkillGroup.EnchantSkillHolder;
  18. import gnu.trove.map.hash.TIntIntHashMap;
  19. /**
  20. * This class ...
  21. * @version $Revision: 1.2.4.2 $ $Date: 2005/03/27 15:29:33 $
  22. */
  23. public final class L2EnchantSkillLearn
  24. {
  25. private final int _id;
  26. private final int _baseLvl;
  27. private final TIntIntHashMap _enchantRoutes = new TIntIntHashMap();
  28. public L2EnchantSkillLearn(int id, int baseLvl)
  29. {
  30. _id = id;
  31. _baseLvl = baseLvl;
  32. }
  33. public void addNewEnchantRoute(int route, int group)
  34. {
  35. _enchantRoutes.put(route, group);
  36. }
  37. /**
  38. * @return Returns the id.
  39. */
  40. public int getId()
  41. {
  42. return _id;
  43. }
  44. /**
  45. * @return Returns the minLevel.
  46. */
  47. public int getBaseLevel()
  48. {
  49. return _baseLvl;
  50. }
  51. public static int getEnchantRoute(int level)
  52. {
  53. return (int) Math.floor(level / 100);
  54. }
  55. public static int getEnchantIndex(int level)
  56. {
  57. return (level % 100) - 1;
  58. }
  59. public static int getEnchantType(int level)
  60. {
  61. return ((level - 1) / 100) - 1;
  62. }
  63. public L2EnchantSkillGroup getFirstRouteGroup()
  64. {
  65. return EnchantGroupsData.getInstance().getEnchantSkillGroupById(_enchantRoutes.values()[0]);
  66. }
  67. public int[] getAllRoutes()
  68. {
  69. return _enchantRoutes.keys();
  70. }
  71. public int getMinSkillLevel(int level)
  72. {
  73. if ((level % 100) == 1)
  74. {
  75. return _baseLvl;
  76. }
  77. return level - 1;
  78. }
  79. public boolean isMaxEnchant(int level)
  80. {
  81. int enchantType = L2EnchantSkillLearn.getEnchantRoute(level);
  82. if ((enchantType < 1) || !_enchantRoutes.contains(enchantType))
  83. {
  84. return false;
  85. }
  86. int index = L2EnchantSkillLearn.getEnchantIndex(level);
  87. if ((index + 1) >= EnchantGroupsData.getInstance().getEnchantSkillGroupById(_enchantRoutes.get(enchantType)).getEnchantGroupDetails().size())
  88. {
  89. return true;
  90. }
  91. return false;
  92. }
  93. public EnchantSkillHolder getEnchantSkillHolder(int level)
  94. {
  95. int enchantType = L2EnchantSkillLearn.getEnchantRoute(level);
  96. if ((enchantType < 1) || !_enchantRoutes.contains(enchantType))
  97. {
  98. return null;
  99. }
  100. int index = L2EnchantSkillLearn.getEnchantIndex(level);
  101. L2EnchantSkillGroup group = EnchantGroupsData.getInstance().getEnchantSkillGroupById(_enchantRoutes.get(enchantType));
  102. if (index < 0)
  103. {
  104. return group.getEnchantGroupDetails().get(0);
  105. }
  106. else if (index >= group.getEnchantGroupDetails().size())
  107. {
  108. return group.getEnchantGroupDetails().get(EnchantGroupsData.getInstance().getEnchantSkillGroupById(_enchantRoutes.get(enchantType)).getEnchantGroupDetails().size() - 1);
  109. }
  110. return group.getEnchantGroupDetails().get(index);
  111. }
  112. }