L2EnchantSkillLearn.java 3.3 KB

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