|
@@ -38,24 +38,24 @@ public class DocumentSkill extends DocumentBase
|
|
|
{
|
|
|
public static class Skill
|
|
|
{
|
|
|
- public int id;
|
|
|
- public String name;
|
|
|
- public StatsSet[] sets;
|
|
|
- public StatsSet[] enchsets1;
|
|
|
- public StatsSet[] enchsets2;
|
|
|
- public StatsSet[] enchsets3;
|
|
|
- public StatsSet[] enchsets4;
|
|
|
- public StatsSet[] enchsets5;
|
|
|
- public StatsSet[] enchsets6;
|
|
|
- public StatsSet[] enchsets7;
|
|
|
- public StatsSet[] enchsets8;
|
|
|
- public int currentLevel;
|
|
|
- public List<L2Skill> skills = new FastList<>();
|
|
|
- public List<L2Skill> currentSkills = new FastList<>();
|
|
|
+ public int id;
|
|
|
+ public String name;
|
|
|
+ public StatsSet[] sets;
|
|
|
+ public StatsSet[] enchsets1;
|
|
|
+ public StatsSet[] enchsets2;
|
|
|
+ public StatsSet[] enchsets3;
|
|
|
+ public StatsSet[] enchsets4;
|
|
|
+ public StatsSet[] enchsets5;
|
|
|
+ public StatsSet[] enchsets6;
|
|
|
+ public StatsSet[] enchsets7;
|
|
|
+ public StatsSet[] enchsets8;
|
|
|
+ public int currentLevel;
|
|
|
+ public List<L2Skill> skills = new FastList<>();
|
|
|
+ public List<L2Skill> currentSkills = new FastList<>();
|
|
|
}
|
|
|
|
|
|
private Skill _currentSkill;
|
|
|
- private List<L2Skill> _skillsInFile = new FastList<>();
|
|
|
+ private final List<L2Skill> _skillsInFile = new FastList<>();
|
|
|
|
|
|
public DocumentSkill(File file)
|
|
|
{
|
|
@@ -64,7 +64,7 @@ public class DocumentSkill extends DocumentBase
|
|
|
|
|
|
private void setCurrentSkill(Skill skill)
|
|
|
{
|
|
|
- _currentSkill = skill;
|
|
|
+ _currentSkill = skill;
|
|
|
}
|
|
|
|
|
|
@Override
|
|
@@ -87,7 +87,7 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
catch (RuntimeException e)
|
|
|
{
|
|
|
- _log.log(Level.SEVERE, "Error in table: "+name+" of Skill Id "+_currentSkill.id, e);
|
|
|
+ _log.log(Level.SEVERE, "Error in table: " + name + " of Skill Id " + _currentSkill.id, e);
|
|
|
return "";
|
|
|
}
|
|
|
}
|
|
@@ -97,11 +97,11 @@ public class DocumentSkill extends DocumentBase
|
|
|
{
|
|
|
try
|
|
|
{
|
|
|
- return _tables.get(name)[idx-1];
|
|
|
+ return _tables.get(name)[idx - 1];
|
|
|
}
|
|
|
catch (RuntimeException e)
|
|
|
{
|
|
|
- _log.log(Level.SEVERE, "wrong level count in skill Id "+_currentSkill.id+" name: "+name+ " index : "+idx, e);
|
|
|
+ _log.log(Level.SEVERE, "wrong level count in skill Id " + _currentSkill.id + " name: " + name + " index : " + idx, e);
|
|
|
return "";
|
|
|
}
|
|
|
}
|
|
@@ -109,11 +109,11 @@ public class DocumentSkill extends DocumentBase
|
|
|
@Override
|
|
|
protected void parseDocument(Document doc)
|
|
|
{
|
|
|
- for (Node n=doc.getFirstChild(); n != null; n = n.getNextSibling())
|
|
|
+ for (Node n = doc.getFirstChild(); n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("list".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
- for (Node d=n.getFirstChild(); d != null; d = d.getNextSibling())
|
|
|
+ for (Node d = n.getFirstChild(); d != null; d = d.getNextSibling())
|
|
|
{
|
|
|
if ("skill".equalsIgnoreCase(d.getNodeName()))
|
|
|
{
|
|
@@ -149,272 +149,348 @@ public class DocumentSkill extends DocumentBase
|
|
|
String levels = attrs.getNamedItem("levels").getNodeValue();
|
|
|
int lastLvl = Integer.parseInt(levels);
|
|
|
if (attrs.getNamedItem("enchantGroup1") != null)
|
|
|
+ {
|
|
|
enchantLevels1 = EnchantGroupsData.getInstance().addNewRouteForSkill(skillId, lastLvl, 1, Integer.parseInt(attrs.getNamedItem("enchantGroup1").getNodeValue()));
|
|
|
+ }
|
|
|
if (attrs.getNamedItem("enchantGroup2") != null)
|
|
|
+ {
|
|
|
enchantLevels2 = EnchantGroupsData.getInstance().addNewRouteForSkill(skillId, lastLvl, 2, Integer.parseInt(attrs.getNamedItem("enchantGroup2").getNodeValue()));
|
|
|
+ }
|
|
|
if (attrs.getNamedItem("enchantGroup3") != null)
|
|
|
+ {
|
|
|
enchantLevels3 = EnchantGroupsData.getInstance().addNewRouteForSkill(skillId, lastLvl, 3, Integer.parseInt(attrs.getNamedItem("enchantGroup3").getNodeValue()));
|
|
|
+ }
|
|
|
if (attrs.getNamedItem("enchantGroup4") != null)
|
|
|
+ {
|
|
|
enchantLevels4 = EnchantGroupsData.getInstance().addNewRouteForSkill(skillId, lastLvl, 4, Integer.parseInt(attrs.getNamedItem("enchantGroup4").getNodeValue()));
|
|
|
+ }
|
|
|
if (attrs.getNamedItem("enchantGroup5") != null)
|
|
|
+ {
|
|
|
enchantLevels5 = EnchantGroupsData.getInstance().addNewRouteForSkill(skillId, lastLvl, 5, Integer.parseInt(attrs.getNamedItem("enchantGroup5").getNodeValue()));
|
|
|
+ }
|
|
|
if (attrs.getNamedItem("enchantGroup6") != null)
|
|
|
+ {
|
|
|
enchantLevels6 = EnchantGroupsData.getInstance().addNewRouteForSkill(skillId, lastLvl, 6, Integer.parseInt(attrs.getNamedItem("enchantGroup6").getNodeValue()));
|
|
|
+ }
|
|
|
if (attrs.getNamedItem("enchantGroup7") != null)
|
|
|
+ {
|
|
|
enchantLevels7 = EnchantGroupsData.getInstance().addNewRouteForSkill(skillId, lastLvl, 7, Integer.parseInt(attrs.getNamedItem("enchantGroup7").getNodeValue()));
|
|
|
+ }
|
|
|
if (attrs.getNamedItem("enchantGroup8") != null)
|
|
|
+ {
|
|
|
enchantLevels8 = EnchantGroupsData.getInstance().addNewRouteForSkill(skillId, lastLvl, 8, Integer.parseInt(attrs.getNamedItem("enchantGroup8").getNodeValue()));
|
|
|
+ }
|
|
|
|
|
|
- _currentSkill.id = skillId;
|
|
|
- _currentSkill.name = skillName;
|
|
|
- _currentSkill.sets = new StatsSet[lastLvl];
|
|
|
- _currentSkill.enchsets1 = new StatsSet[enchantLevels1];
|
|
|
- _currentSkill.enchsets2 = new StatsSet[enchantLevels2];
|
|
|
- _currentSkill.enchsets3 = new StatsSet[enchantLevels3];
|
|
|
- _currentSkill.enchsets4 = new StatsSet[enchantLevels4];
|
|
|
- _currentSkill.enchsets5 = new StatsSet[enchantLevels5];
|
|
|
- _currentSkill.enchsets6 = new StatsSet[enchantLevels6];
|
|
|
- _currentSkill.enchsets7 = new StatsSet[enchantLevels7];
|
|
|
- _currentSkill.enchsets8 = new StatsSet[enchantLevels8];
|
|
|
+ _currentSkill.id = skillId;
|
|
|
+ _currentSkill.name = skillName;
|
|
|
+ _currentSkill.sets = new StatsSet[lastLvl];
|
|
|
+ _currentSkill.enchsets1 = new StatsSet[enchantLevels1];
|
|
|
+ _currentSkill.enchsets2 = new StatsSet[enchantLevels2];
|
|
|
+ _currentSkill.enchsets3 = new StatsSet[enchantLevels3];
|
|
|
+ _currentSkill.enchsets4 = new StatsSet[enchantLevels4];
|
|
|
+ _currentSkill.enchsets5 = new StatsSet[enchantLevels5];
|
|
|
+ _currentSkill.enchsets6 = new StatsSet[enchantLevels6];
|
|
|
+ _currentSkill.enchsets7 = new StatsSet[enchantLevels7];
|
|
|
+ _currentSkill.enchsets8 = new StatsSet[enchantLevels8];
|
|
|
|
|
|
- for (int i=0; i < lastLvl; i++)
|
|
|
+ for (int i = 0; i < lastLvl; i++)
|
|
|
{
|
|
|
_currentSkill.sets[i] = new StatsSet();
|
|
|
_currentSkill.sets[i].set("skill_id", _currentSkill.id);
|
|
|
- _currentSkill.sets[i].set("level", i+1);
|
|
|
- _currentSkill.sets[i].set("name", _currentSkill.name);
|
|
|
+ _currentSkill.sets[i].set("level", i + 1);
|
|
|
+ _currentSkill.sets[i].set("name", _currentSkill.name);
|
|
|
}
|
|
|
|
|
|
if (_currentSkill.sets.length != lastLvl)
|
|
|
- throw new RuntimeException("Skill id="+skillId+" number of levels missmatch, "+lastLvl+" levels expected");
|
|
|
+ {
|
|
|
+ throw new RuntimeException("Skill id=" + skillId + " number of levels missmatch, " + lastLvl + " levels expected");
|
|
|
+ }
|
|
|
|
|
|
Node first = n.getFirstChild();
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("table".equalsIgnoreCase(n.getNodeName()))
|
|
|
+ {
|
|
|
parseTable(n);
|
|
|
+ }
|
|
|
}
|
|
|
- for (int i=1; i <= lastLvl; i++)
|
|
|
+ for (int i = 1; i <= lastLvl; i++)
|
|
|
{
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("set".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
- //Extractable item skills by Zoey76
|
|
|
+ // Extractable item skills by Zoey76
|
|
|
if ("capsuled_items_skill".equalsIgnoreCase(n.getAttributes().getNamedItem("name").getNodeValue()))
|
|
|
- setExtractableSkillData(_currentSkill.sets[i-1], getTableValue("#extractableItems", i));
|
|
|
+ {
|
|
|
+ setExtractableSkillData(_currentSkill.sets[i - 1], getTableValue("#extractableItems", i));
|
|
|
+ }
|
|
|
else
|
|
|
- parseBeanSet(n, _currentSkill.sets[i-1], i);
|
|
|
+ {
|
|
|
+ parseBeanSet(n, _currentSkill.sets[i - 1], i);
|
|
|
+ }
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
- for (int i=0; i < enchantLevels1; i++)
|
|
|
+ for (int i = 0; i < enchantLevels1; i++)
|
|
|
{
|
|
|
_currentSkill.enchsets1[i] = new StatsSet();
|
|
|
_currentSkill.enchsets1[i].set("skill_id", _currentSkill.id);
|
|
|
- //currentSkill.enchsets1[i] = currentSkill.sets[currentSkill.sets.length-1];
|
|
|
- _currentSkill.enchsets1[i].set("level", i+101);
|
|
|
- _currentSkill.enchsets1[i].set("name", _currentSkill.name);
|
|
|
- //currentSkill.enchsets1[i].set("skillType", "NOTDONE");
|
|
|
+ // currentSkill.enchsets1[i] = currentSkill.sets[currentSkill.sets.length-1];
|
|
|
+ _currentSkill.enchsets1[i].set("level", i + 101);
|
|
|
+ _currentSkill.enchsets1[i].set("name", _currentSkill.name);
|
|
|
+ // currentSkill.enchsets1[i].set("skillType", "NOTDONE");
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("set".equalsIgnoreCase(n.getNodeName()))
|
|
|
+ {
|
|
|
parseBeanSet(n, _currentSkill.enchsets1[i], _currentSkill.sets.length);
|
|
|
+ }
|
|
|
}
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant1".equalsIgnoreCase(n.getNodeName()))
|
|
|
- parseBeanSet(n, _currentSkill.enchsets1[i], i+1);
|
|
|
+ {
|
|
|
+ parseBeanSet(n, _currentSkill.enchsets1[i], i + 1);
|
|
|
+ }
|
|
|
}
|
|
|
}
|
|
|
|
|
|
if (_currentSkill.enchsets1.length != enchantLevels1)
|
|
|
- throw new RuntimeException("Skill id="+skillId+" number of levels missmatch, "+enchantLevels1+" levels expected");
|
|
|
+ {
|
|
|
+ throw new RuntimeException("Skill id=" + skillId + " number of levels missmatch, " + enchantLevels1 + " levels expected");
|
|
|
+ }
|
|
|
|
|
|
- for (int i=0; i < enchantLevels2; i++)
|
|
|
+ for (int i = 0; i < enchantLevels2; i++)
|
|
|
{
|
|
|
_currentSkill.enchsets2[i] = new StatsSet();
|
|
|
- //currentSkill.enchsets2[i] = currentSkill.sets[currentSkill.sets.length-1];
|
|
|
+ // currentSkill.enchsets2[i] = currentSkill.sets[currentSkill.sets.length-1];
|
|
|
_currentSkill.enchsets2[i].set("skill_id", _currentSkill.id);
|
|
|
- _currentSkill.enchsets2[i].set("level", i+201);
|
|
|
- _currentSkill.enchsets2[i].set("name", _currentSkill.name);
|
|
|
- //currentSkill.enchsets2[i].set("skillType", "NOTDONE");
|
|
|
+ _currentSkill.enchsets2[i].set("level", i + 201);
|
|
|
+ _currentSkill.enchsets2[i].set("name", _currentSkill.name);
|
|
|
+ // currentSkill.enchsets2[i].set("skillType", "NOTDONE");
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("set".equalsIgnoreCase(n.getNodeName()))
|
|
|
+ {
|
|
|
parseBeanSet(n, _currentSkill.enchsets2[i], _currentSkill.sets.length);
|
|
|
+ }
|
|
|
}
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant2".equalsIgnoreCase(n.getNodeName()))
|
|
|
- parseBeanSet(n, _currentSkill.enchsets2[i], i+1);
|
|
|
+ {
|
|
|
+ parseBeanSet(n, _currentSkill.enchsets2[i], i + 1);
|
|
|
+ }
|
|
|
}
|
|
|
}
|
|
|
|
|
|
if (_currentSkill.enchsets2.length != enchantLevels2)
|
|
|
- throw new RuntimeException("Skill id="+skillId+" number of levels missmatch, "+enchantLevels2+" levels expected");
|
|
|
+ {
|
|
|
+ throw new RuntimeException("Skill id=" + skillId + " number of levels missmatch, " + enchantLevels2 + " levels expected");
|
|
|
+ }
|
|
|
|
|
|
- for (int i=0; i < enchantLevels3; i++)
|
|
|
+ for (int i = 0; i < enchantLevels3; i++)
|
|
|
{
|
|
|
_currentSkill.enchsets3[i] = new StatsSet();
|
|
|
_currentSkill.enchsets3[i].set("skill_id", _currentSkill.id);
|
|
|
- _currentSkill.enchsets3[i].set("level", i+301);
|
|
|
- _currentSkill.enchsets3[i].set("name", _currentSkill.name);
|
|
|
+ _currentSkill.enchsets3[i].set("level", i + 301);
|
|
|
+ _currentSkill.enchsets3[i].set("name", _currentSkill.name);
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("set".equalsIgnoreCase(n.getNodeName()))
|
|
|
+ {
|
|
|
parseBeanSet(n, _currentSkill.enchsets3[i], _currentSkill.sets.length);
|
|
|
+ }
|
|
|
}
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant3".equalsIgnoreCase(n.getNodeName()))
|
|
|
- parseBeanSet(n, _currentSkill.enchsets3[i], i+1);
|
|
|
+ {
|
|
|
+ parseBeanSet(n, _currentSkill.enchsets3[i], i + 1);
|
|
|
+ }
|
|
|
}
|
|
|
}
|
|
|
|
|
|
if (_currentSkill.enchsets3.length != enchantLevels3)
|
|
|
- throw new RuntimeException("Skill id="+skillId+" number of levels missmatch, "+enchantLevels3+" levels expected");
|
|
|
+ {
|
|
|
+ throw new RuntimeException("Skill id=" + skillId + " number of levels missmatch, " + enchantLevels3 + " levels expected");
|
|
|
+ }
|
|
|
|
|
|
- for (int i=0; i < enchantLevels4; i++)
|
|
|
+ for (int i = 0; i < enchantLevels4; i++)
|
|
|
{
|
|
|
_currentSkill.enchsets4[i] = new StatsSet();
|
|
|
_currentSkill.enchsets4[i].set("skill_id", _currentSkill.id);
|
|
|
- _currentSkill.enchsets4[i].set("level", i+401);
|
|
|
- _currentSkill.enchsets4[i].set("name", _currentSkill.name);
|
|
|
+ _currentSkill.enchsets4[i].set("level", i + 401);
|
|
|
+ _currentSkill.enchsets4[i].set("name", _currentSkill.name);
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("set".equalsIgnoreCase(n.getNodeName()))
|
|
|
+ {
|
|
|
parseBeanSet(n, _currentSkill.enchsets4[i], _currentSkill.sets.length);
|
|
|
+ }
|
|
|
}
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant4".equalsIgnoreCase(n.getNodeName()))
|
|
|
- parseBeanSet(n, _currentSkill.enchsets4[i], i+1);
|
|
|
+ {
|
|
|
+ parseBeanSet(n, _currentSkill.enchsets4[i], i + 1);
|
|
|
+ }
|
|
|
}
|
|
|
}
|
|
|
|
|
|
if (_currentSkill.enchsets4.length != enchantLevels4)
|
|
|
- throw new RuntimeException("Skill id="+skillId+" number of levels missmatch, "+enchantLevels4+" levels expected");
|
|
|
+ {
|
|
|
+ throw new RuntimeException("Skill id=" + skillId + " number of levels missmatch, " + enchantLevels4 + " levels expected");
|
|
|
+ }
|
|
|
|
|
|
- for (int i=0; i < enchantLevels5; i++)
|
|
|
+ for (int i = 0; i < enchantLevels5; i++)
|
|
|
{
|
|
|
_currentSkill.enchsets5[i] = new StatsSet();
|
|
|
_currentSkill.enchsets5[i].set("skill_id", _currentSkill.id);
|
|
|
- _currentSkill.enchsets5[i].set("level", i+501);
|
|
|
- _currentSkill.enchsets5[i].set("name", _currentSkill.name);
|
|
|
+ _currentSkill.enchsets5[i].set("level", i + 501);
|
|
|
+ _currentSkill.enchsets5[i].set("name", _currentSkill.name);
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("set".equalsIgnoreCase(n.getNodeName()))
|
|
|
+ {
|
|
|
parseBeanSet(n, _currentSkill.enchsets5[i], _currentSkill.sets.length);
|
|
|
+ }
|
|
|
}
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant5".equalsIgnoreCase(n.getNodeName()))
|
|
|
- parseBeanSet(n, _currentSkill.enchsets5[i], i+1);
|
|
|
+ {
|
|
|
+ parseBeanSet(n, _currentSkill.enchsets5[i], i + 1);
|
|
|
+ }
|
|
|
}
|
|
|
}
|
|
|
|
|
|
if (_currentSkill.enchsets5.length != enchantLevels5)
|
|
|
- throw new RuntimeException("Skill id="+skillId+" number of levels missmatch, "+enchantLevels5+" levels expected");
|
|
|
+ {
|
|
|
+ throw new RuntimeException("Skill id=" + skillId + " number of levels missmatch, " + enchantLevels5 + " levels expected");
|
|
|
+ }
|
|
|
|
|
|
- for (int i=0; i < enchantLevels6; i++)
|
|
|
+ for (int i = 0; i < enchantLevels6; i++)
|
|
|
{
|
|
|
_currentSkill.enchsets6[i] = new StatsSet();
|
|
|
_currentSkill.enchsets6[i].set("skill_id", _currentSkill.id);
|
|
|
- _currentSkill.enchsets6[i].set("level", i+601);
|
|
|
- _currentSkill.enchsets6[i].set("name", _currentSkill.name);
|
|
|
+ _currentSkill.enchsets6[i].set("level", i + 601);
|
|
|
+ _currentSkill.enchsets6[i].set("name", _currentSkill.name);
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("set".equalsIgnoreCase(n.getNodeName()))
|
|
|
+ {
|
|
|
parseBeanSet(n, _currentSkill.enchsets6[i], _currentSkill.sets.length);
|
|
|
+ }
|
|
|
}
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant6".equalsIgnoreCase(n.getNodeName()))
|
|
|
- parseBeanSet(n, _currentSkill.enchsets6[i], i+1);
|
|
|
+ {
|
|
|
+ parseBeanSet(n, _currentSkill.enchsets6[i], i + 1);
|
|
|
+ }
|
|
|
}
|
|
|
}
|
|
|
|
|
|
if (_currentSkill.enchsets6.length != enchantLevels6)
|
|
|
- throw new RuntimeException("Skill id="+skillId+" number of levels missmatch, "+enchantLevels6+" levels expected");
|
|
|
+ {
|
|
|
+ throw new RuntimeException("Skill id=" + skillId + " number of levels missmatch, " + enchantLevels6 + " levels expected");
|
|
|
+ }
|
|
|
|
|
|
- for (int i=0; i < enchantLevels7; i++)
|
|
|
+ for (int i = 0; i < enchantLevels7; i++)
|
|
|
{
|
|
|
_currentSkill.enchsets7[i] = new StatsSet();
|
|
|
_currentSkill.enchsets7[i].set("skill_id", _currentSkill.id);
|
|
|
- _currentSkill.enchsets7[i].set("level", i+701);
|
|
|
- _currentSkill.enchsets7[i].set("name", _currentSkill.name);
|
|
|
+ _currentSkill.enchsets7[i].set("level", i + 701);
|
|
|
+ _currentSkill.enchsets7[i].set("name", _currentSkill.name);
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("set".equalsIgnoreCase(n.getNodeName()))
|
|
|
+ {
|
|
|
parseBeanSet(n, _currentSkill.enchsets7[i], _currentSkill.sets.length);
|
|
|
+ }
|
|
|
}
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant7".equalsIgnoreCase(n.getNodeName()))
|
|
|
- parseBeanSet(n, _currentSkill.enchsets7[i], i+1);
|
|
|
+ {
|
|
|
+ parseBeanSet(n, _currentSkill.enchsets7[i], i + 1);
|
|
|
+ }
|
|
|
}
|
|
|
}
|
|
|
|
|
|
if (_currentSkill.enchsets7.length != enchantLevels7)
|
|
|
- throw new RuntimeException("Skill id="+skillId+" number of levels missmatch, "+enchantLevels7+" levels expected");
|
|
|
+ {
|
|
|
+ throw new RuntimeException("Skill id=" + skillId + " number of levels missmatch, " + enchantLevels7 + " levels expected");
|
|
|
+ }
|
|
|
|
|
|
- for (int i=0; i < enchantLevels8; i++)
|
|
|
+ for (int i = 0; i < enchantLevels8; i++)
|
|
|
{
|
|
|
_currentSkill.enchsets8[i] = new StatsSet();
|
|
|
_currentSkill.enchsets8[i].set("skill_id", _currentSkill.id);
|
|
|
- _currentSkill.enchsets8[i].set("level", i+801);
|
|
|
- _currentSkill.enchsets8[i].set("name", _currentSkill.name);
|
|
|
+ _currentSkill.enchsets8[i].set("level", i + 801);
|
|
|
+ _currentSkill.enchsets8[i].set("name", _currentSkill.name);
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("set".equalsIgnoreCase(n.getNodeName()))
|
|
|
+ {
|
|
|
parseBeanSet(n, _currentSkill.enchsets8[i], _currentSkill.sets.length);
|
|
|
+ }
|
|
|
}
|
|
|
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant8".equalsIgnoreCase(n.getNodeName()))
|
|
|
- parseBeanSet(n, _currentSkill.enchsets8[i], i+1);
|
|
|
+ {
|
|
|
+ parseBeanSet(n, _currentSkill.enchsets8[i], i + 1);
|
|
|
+ }
|
|
|
}
|
|
|
}
|
|
|
|
|
|
if (_currentSkill.enchsets8.length != enchantLevels8)
|
|
|
- throw new RuntimeException("Skill id="+skillId+" number of levels missmatch, "+enchantLevels8+" levels expected");
|
|
|
+ {
|
|
|
+ throw new RuntimeException("Skill id=" + skillId + " number of levels missmatch, " + enchantLevels8 + " levels expected");
|
|
|
+ }
|
|
|
|
|
|
makeSkills();
|
|
|
- for (int i=0; i < lastLvl; i++)
|
|
|
+ for (int i = 0; i < lastLvl; i++)
|
|
|
{
|
|
|
_currentSkill.currentLevel = i;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
Node msgId = n.getAttributes().getNamedItem("msgId");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- else if (condition != null && msgId != null)
|
|
|
+ }
|
|
|
+ else if ((condition != null) && (msgId != null))
|
|
|
{
|
|
|
condition.setMessageId(Integer.decode(getValue(msgId.getNodeValue(), null)));
|
|
|
Node addName = n.getAttributes().getNamedItem("addName");
|
|
|
- if (addName != null && Integer.decode(getValue(msgId.getNodeValue(), null)) > 0)
|
|
|
+ if ((addName != null) && (Integer.decode(getValue(msgId.getNodeValue(), null)) > 0))
|
|
|
+ {
|
|
|
condition.addName();
|
|
|
+ }
|
|
|
}
|
|
|
_currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
@@ -424,20 +500,22 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
- for (int i=lastLvl; i < lastLvl+enchantLevels1; i++)
|
|
|
+ for (int i = lastLvl; i < (lastLvl + enchantLevels1); i++)
|
|
|
{
|
|
|
- _currentSkill.currentLevel = i-lastLvl;
|
|
|
+ _currentSkill.currentLevel = i - lastLvl;
|
|
|
boolean foundCond = false, foundFor = false;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant1cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
foundCond = true;
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if ("enchant1for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -448,16 +526,18 @@ public class DocumentSkill extends DocumentBase
|
|
|
// If none found, the enchanted skill will take effects from maxLvL of norm skill
|
|
|
if (!foundCond || !foundFor)
|
|
|
{
|
|
|
- _currentSkill.currentLevel = lastLvl-1;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = lastLvl - 1;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if (!foundCond && "cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if (!foundFor && "for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -466,20 +546,22 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
- for (int i=lastLvl+enchantLevels1; i < lastLvl+enchantLevels1+enchantLevels2; i++)
|
|
|
+ for (int i = lastLvl + enchantLevels1; i < (lastLvl + enchantLevels1 + enchantLevels2); i++)
|
|
|
{
|
|
|
boolean foundCond = false, foundFor = false;
|
|
|
- _currentSkill.currentLevel = i-lastLvl-enchantLevels1;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = i - lastLvl - enchantLevels1;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant2cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
foundCond = true;
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if ("enchant2for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -488,18 +570,20 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
// If none found, the enchanted skill will take effects from maxLvL of norm skill
|
|
|
- if(!foundCond || !foundFor)
|
|
|
+ if (!foundCond || !foundFor)
|
|
|
{
|
|
|
- _currentSkill.currentLevel = lastLvl-1;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = lastLvl - 1;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if (!foundCond && "cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if (!foundFor && "for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -508,20 +592,22 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
- for (int i=lastLvl+enchantLevels1+enchantLevels2; i < lastLvl+enchantLevels1+enchantLevels2+enchantLevels3; i++)
|
|
|
+ for (int i = lastLvl + enchantLevels1 + enchantLevels2; i < (lastLvl + enchantLevels1 + enchantLevels2 + enchantLevels3); i++)
|
|
|
{
|
|
|
boolean foundCond = false, foundFor = false;
|
|
|
- _currentSkill.currentLevel = i-lastLvl-enchantLevels1-enchantLevels2;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = i - lastLvl - enchantLevels1 - enchantLevels2;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant3cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
foundCond = true;
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if ("enchant3for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -530,18 +616,20 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
// If none found, the enchanted skill will take effects from maxLvL of norm skill
|
|
|
- if(!foundCond || !foundFor)
|
|
|
+ if (!foundCond || !foundFor)
|
|
|
{
|
|
|
- _currentSkill.currentLevel = lastLvl-1;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = lastLvl - 1;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if (!foundCond && "cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if (!foundFor && "for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -550,20 +638,22 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
- for (int i=lastLvl+enchantLevels1+enchantLevels2+enchantLevels3; i < lastLvl+enchantLevels1+enchantLevels2+enchantLevels3+enchantLevels4; i++)
|
|
|
+ for (int i = lastLvl + enchantLevels1 + enchantLevels2 + enchantLevels3; i < (lastLvl + enchantLevels1 + enchantLevels2 + enchantLevels3 + enchantLevels4); i++)
|
|
|
{
|
|
|
boolean foundCond = false, foundFor = false;
|
|
|
- _currentSkill.currentLevel = i-lastLvl-enchantLevels1-enchantLevels2-enchantLevels3;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = i - lastLvl - enchantLevels1 - enchantLevels2 - enchantLevels3;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant4cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
foundCond = true;
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if ("enchant4for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -572,18 +662,20 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
// If none found, the enchanted skill will take effects from maxLvL of norm skill
|
|
|
- if(!foundCond || !foundFor)
|
|
|
+ if (!foundCond || !foundFor)
|
|
|
{
|
|
|
- _currentSkill.currentLevel = lastLvl-1;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = lastLvl - 1;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if (!foundCond && "cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if (!foundFor && "for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -592,20 +684,22 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
- for (int i=lastLvl+enchantLevels1+enchantLevels2+enchantLevels3+enchantLevels4; i < lastLvl+enchantLevels1+enchantLevels2+enchantLevels3+enchantLevels4+enchantLevels5; i++)
|
|
|
+ for (int i = lastLvl + enchantLevels1 + enchantLevels2 + enchantLevels3 + enchantLevels4; i < (lastLvl + enchantLevels1 + enchantLevels2 + enchantLevels3 + enchantLevels4 + enchantLevels5); i++)
|
|
|
{
|
|
|
boolean foundCond = false, foundFor = false;
|
|
|
- _currentSkill.currentLevel = i-lastLvl-enchantLevels1-enchantLevels2-enchantLevels3-enchantLevels4;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = i - lastLvl - enchantLevels1 - enchantLevels2 - enchantLevels3 - enchantLevels4;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant5cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
foundCond = true;
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if ("enchant5for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -614,18 +708,20 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
// If none found, the enchanted skill will take effects from maxLvL of norm skill
|
|
|
- if(!foundCond || !foundFor)
|
|
|
+ if (!foundCond || !foundFor)
|
|
|
{
|
|
|
- _currentSkill.currentLevel = lastLvl-1;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = lastLvl - 1;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if (!foundCond && "cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if (!foundFor && "for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -634,20 +730,22 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
- for (int i=lastLvl+enchantLevels1+enchantLevels2+enchantLevels3+enchantLevels4+enchantLevels5; i < lastLvl+enchantLevels1+enchantLevels2+enchantLevels3+enchantLevels4+enchantLevels5+enchantLevels6; i++)
|
|
|
+ for (int i = lastLvl + enchantLevels1 + enchantLevels2 + enchantLevels3 + enchantLevels4 + enchantLevels5; i < (lastLvl + enchantLevels1 + enchantLevels2 + enchantLevels3 + enchantLevels4 + enchantLevels5 + enchantLevels6); i++)
|
|
|
{
|
|
|
boolean foundCond = false, foundFor = false;
|
|
|
- _currentSkill.currentLevel = i-lastLvl-enchantLevels1-enchantLevels2-enchantLevels3-enchantLevels4-enchantLevels5;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = i - lastLvl - enchantLevels1 - enchantLevels2 - enchantLevels3 - enchantLevels4 - enchantLevels5;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant6cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
foundCond = true;
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if ("enchant6for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -656,18 +754,20 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
// If none found, the enchanted skill will take effects from maxLvL of norm skill
|
|
|
- if(!foundCond || !foundFor)
|
|
|
+ if (!foundCond || !foundFor)
|
|
|
{
|
|
|
- _currentSkill.currentLevel = lastLvl-1;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = lastLvl - 1;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if (!foundCond && "cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if (!foundFor && "for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -676,20 +776,22 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
- for (int i=lastLvl+enchantLevels1+enchantLevels2+enchantLevels3+enchantLevels4+enchantLevels5+enchantLevels6; i < lastLvl+enchantLevels1+enchantLevels2+enchantLevels3+enchantLevels4+enchantLevels5+enchantLevels6+enchantLevels7; i++)
|
|
|
+ for (int i = lastLvl + enchantLevels1 + enchantLevels2 + enchantLevels3 + enchantLevels4 + enchantLevels5 + enchantLevels6; i < (lastLvl + enchantLevels1 + enchantLevels2 + enchantLevels3 + enchantLevels4 + enchantLevels5 + enchantLevels6 + enchantLevels7); i++)
|
|
|
{
|
|
|
boolean foundCond = false, foundFor = false;
|
|
|
- _currentSkill.currentLevel = i-lastLvl-enchantLevels1-enchantLevels2-enchantLevels3-enchantLevels4-enchantLevels5-enchantLevels6;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = i - lastLvl - enchantLevels1 - enchantLevels2 - enchantLevels3 - enchantLevels4 - enchantLevels5 - enchantLevels6;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant7cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
foundCond = true;
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if ("enchant7for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -698,18 +800,20 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
// If none found, the enchanted skill will take effects from maxLvL of norm skill
|
|
|
- if(!foundCond || !foundFor)
|
|
|
+ if (!foundCond || !foundFor)
|
|
|
{
|
|
|
- _currentSkill.currentLevel = lastLvl-1;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = lastLvl - 1;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if (!foundCond && "cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if (!foundFor && "for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -718,20 +822,22 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
}
|
|
|
- for (int i=lastLvl+enchantLevels1+enchantLevels2+enchantLevels3+enchantLevels4+enchantLevels5+enchantLevels6+enchantLevels7; i < lastLvl+enchantLevels1+enchantLevels2+enchantLevels3+enchantLevels4+enchantLevels5+enchantLevels6+enchantLevels7+enchantLevels8; i++)
|
|
|
+ for (int i = lastLvl + enchantLevels1 + enchantLevels2 + enchantLevels3 + enchantLevels4 + enchantLevels5 + enchantLevels6 + enchantLevels7; i < (lastLvl + enchantLevels1 + enchantLevels2 + enchantLevels3 + enchantLevels4 + enchantLevels5 + enchantLevels6 + enchantLevels7 + enchantLevels8); i++)
|
|
|
{
|
|
|
boolean foundCond = false, foundFor = false;
|
|
|
- _currentSkill.currentLevel = i-lastLvl-enchantLevels1-enchantLevels2-enchantLevels3-enchantLevels4-enchantLevels5-enchantLevels6-enchantLevels7;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = i - lastLvl - enchantLevels1 - enchantLevels2 - enchantLevels3 - enchantLevels4 - enchantLevels5 - enchantLevels6 - enchantLevels7;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if ("enchant8cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
foundCond = true;
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if ("enchant8for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -740,18 +846,20 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
}
|
|
|
// If none found, the enchanted skill will take effects from maxLvL of norm skill
|
|
|
- if(!foundCond || !foundFor)
|
|
|
+ if (!foundCond || !foundFor)
|
|
|
{
|
|
|
- _currentSkill.currentLevel = lastLvl-1;
|
|
|
- for (n=first; n != null; n = n.getNextSibling())
|
|
|
+ _currentSkill.currentLevel = lastLvl - 1;
|
|
|
+ for (n = first; n != null; n = n.getNextSibling())
|
|
|
{
|
|
|
if (!foundCond && "cond".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
|
Condition condition = parseCondition(n.getFirstChild(), _currentSkill.currentSkills.get(i));
|
|
|
Node msg = n.getAttributes().getNamedItem("msg");
|
|
|
- if (condition != null && msg != null)
|
|
|
+ if ((condition != null) && (msg != null))
|
|
|
+ {
|
|
|
condition.setMessage(msg.getNodeValue());
|
|
|
- _currentSkill.currentSkills.get(i).attach(condition,false);
|
|
|
+ }
|
|
|
+ _currentSkill.currentSkills.get(i).attach(condition, false);
|
|
|
}
|
|
|
else if (!foundFor && "for".equalsIgnoreCase(n.getNodeName()))
|
|
|
{
|
|
@@ -766,9 +874,9 @@ public class DocumentSkill extends DocumentBase
|
|
|
private void makeSkills()
|
|
|
{
|
|
|
int count = 0;
|
|
|
- _currentSkill.currentSkills = new FastList<>(_currentSkill.sets.length+_currentSkill.enchsets1.length+_currentSkill.enchsets2.length+_currentSkill.enchsets3.length+_currentSkill.enchsets4.length+_currentSkill.enchsets5.length+_currentSkill.enchsets6.length+_currentSkill.enchsets7.length+_currentSkill.enchsets8.length);
|
|
|
+ _currentSkill.currentSkills = new FastList<>(_currentSkill.sets.length + _currentSkill.enchsets1.length + _currentSkill.enchsets2.length + _currentSkill.enchsets3.length + _currentSkill.enchsets4.length + _currentSkill.enchsets5.length + _currentSkill.enchsets6.length + _currentSkill.enchsets7.length + _currentSkill.enchsets8.length);
|
|
|
|
|
|
- for (int i=0; i < _currentSkill.sets.length; i++)
|
|
|
+ for (int i = 0; i < _currentSkill.sets.length; i++)
|
|
|
{
|
|
|
try
|
|
|
{
|
|
@@ -777,111 +885,111 @@ public class DocumentSkill extends DocumentBase
|
|
|
}
|
|
|
catch (Exception e)
|
|
|
{
|
|
|
- _log.log(Level.SEVERE, "Skill id="+_currentSkill.sets[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.sets[i]).getDisplayId()+"level"+_currentSkill.sets[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.sets[i]).getLevel(), e);
|
|
|
+ _log.log(Level.SEVERE, "Skill id=" + _currentSkill.sets[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.sets[i]).getDisplayId() + "level" + _currentSkill.sets[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.sets[i]).getLevel(), e);
|
|
|
}
|
|
|
}
|
|
|
int _count = count;
|
|
|
- for (int i=0; i < _currentSkill.enchsets1.length; i++)
|
|
|
+ for (int i = 0; i < _currentSkill.enchsets1.length; i++)
|
|
|
{
|
|
|
try
|
|
|
{
|
|
|
- _currentSkill.currentSkills.add(_count+i, _currentSkill.enchsets1[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets1[i]));
|
|
|
+ _currentSkill.currentSkills.add(_count + i, _currentSkill.enchsets1[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets1[i]));
|
|
|
count++;
|
|
|
}
|
|
|
catch (Exception e)
|
|
|
{
|
|
|
- _log.log(Level.SEVERE, "Skill id="+_currentSkill.enchsets1[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets1[i]).getDisplayId()+" level="+_currentSkill.enchsets1[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets1[i]).getLevel(), e);
|
|
|
+ _log.log(Level.SEVERE, "Skill id=" + _currentSkill.enchsets1[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets1[i]).getDisplayId() + " level=" + _currentSkill.enchsets1[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets1[i]).getLevel(), e);
|
|
|
}
|
|
|
}
|
|
|
_count = count;
|
|
|
- for (int i=0; i < _currentSkill.enchsets2.length; i++)
|
|
|
+ for (int i = 0; i < _currentSkill.enchsets2.length; i++)
|
|
|
{
|
|
|
try
|
|
|
{
|
|
|
- _currentSkill.currentSkills.add(_count+i, _currentSkill.enchsets2[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets2[i]));
|
|
|
+ _currentSkill.currentSkills.add(_count + i, _currentSkill.enchsets2[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets2[i]));
|
|
|
count++;
|
|
|
}
|
|
|
catch (Exception e)
|
|
|
{
|
|
|
- _log.log(Level.SEVERE, "Skill id="+_currentSkill.enchsets2[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets2[i]).getDisplayId()+" level="+_currentSkill.enchsets2[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets2[i]).getLevel(), e);
|
|
|
+ _log.log(Level.SEVERE, "Skill id=" + _currentSkill.enchsets2[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets2[i]).getDisplayId() + " level=" + _currentSkill.enchsets2[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets2[i]).getLevel(), e);
|
|
|
}
|
|
|
}
|
|
|
_count = count;
|
|
|
- for (int i=0; i < _currentSkill.enchsets3.length; i++)
|
|
|
+ for (int i = 0; i < _currentSkill.enchsets3.length; i++)
|
|
|
{
|
|
|
try
|
|
|
{
|
|
|
- _currentSkill.currentSkills.add(_count+i, _currentSkill.enchsets3[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets3[i]));
|
|
|
+ _currentSkill.currentSkills.add(_count + i, _currentSkill.enchsets3[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets3[i]));
|
|
|
count++;
|
|
|
}
|
|
|
catch (Exception e)
|
|
|
{
|
|
|
- _log.log(Level.SEVERE, "Skill id="+_currentSkill.enchsets3[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets3[i]).getDisplayId()+" level="+_currentSkill.enchsets3[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets3[i]).getLevel(), e);
|
|
|
+ _log.log(Level.SEVERE, "Skill id=" + _currentSkill.enchsets3[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets3[i]).getDisplayId() + " level=" + _currentSkill.enchsets3[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets3[i]).getLevel(), e);
|
|
|
}
|
|
|
}
|
|
|
_count = count;
|
|
|
- for (int i=0; i < _currentSkill.enchsets4.length; i++)
|
|
|
+ for (int i = 0; i < _currentSkill.enchsets4.length; i++)
|
|
|
{
|
|
|
try
|
|
|
{
|
|
|
- _currentSkill.currentSkills.add(_count+i, _currentSkill.enchsets4[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets4[i]));
|
|
|
+ _currentSkill.currentSkills.add(_count + i, _currentSkill.enchsets4[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets4[i]));
|
|
|
count++;
|
|
|
}
|
|
|
catch (Exception e)
|
|
|
{
|
|
|
- _log.log(Level.SEVERE, "Skill id="+_currentSkill.enchsets4[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets4[i]).getDisplayId()+" level="+_currentSkill.enchsets4[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets4[i]).getLevel(), e);
|
|
|
+ _log.log(Level.SEVERE, "Skill id=" + _currentSkill.enchsets4[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets4[i]).getDisplayId() + " level=" + _currentSkill.enchsets4[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets4[i]).getLevel(), e);
|
|
|
}
|
|
|
}
|
|
|
_count = count;
|
|
|
- for (int i=0; i < _currentSkill.enchsets5.length; i++)
|
|
|
+ for (int i = 0; i < _currentSkill.enchsets5.length; i++)
|
|
|
{
|
|
|
try
|
|
|
{
|
|
|
- _currentSkill.currentSkills.add(_count+i, _currentSkill.enchsets5[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets5[i]));
|
|
|
+ _currentSkill.currentSkills.add(_count + i, _currentSkill.enchsets5[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets5[i]));
|
|
|
count++;
|
|
|
}
|
|
|
catch (Exception e)
|
|
|
{
|
|
|
- _log.log(Level.SEVERE, "Skill id="+_currentSkill.enchsets5[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets5[i]).getDisplayId()+" level="+_currentSkill.enchsets5[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets5[i]).getLevel(), e);
|
|
|
+ _log.log(Level.SEVERE, "Skill id=" + _currentSkill.enchsets5[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets5[i]).getDisplayId() + " level=" + _currentSkill.enchsets5[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets5[i]).getLevel(), e);
|
|
|
}
|
|
|
}
|
|
|
_count = count;
|
|
|
- for (int i=0; i < _currentSkill.enchsets6.length; i++)
|
|
|
+ for (int i = 0; i < _currentSkill.enchsets6.length; i++)
|
|
|
{
|
|
|
try
|
|
|
{
|
|
|
- _currentSkill.currentSkills.add(_count+i, _currentSkill.enchsets6[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets6[i]));
|
|
|
+ _currentSkill.currentSkills.add(_count + i, _currentSkill.enchsets6[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets6[i]));
|
|
|
count++;
|
|
|
}
|
|
|
catch (Exception e)
|
|
|
{
|
|
|
- _log.log(Level.SEVERE, "Skill id="+_currentSkill.enchsets6[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets6[i]).getDisplayId()+" level="+_currentSkill.enchsets6[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets6[i]).getLevel(), e);
|
|
|
+ _log.log(Level.SEVERE, "Skill id=" + _currentSkill.enchsets6[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets6[i]).getDisplayId() + " level=" + _currentSkill.enchsets6[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets6[i]).getLevel(), e);
|
|
|
}
|
|
|
}
|
|
|
_count = count;
|
|
|
- for (int i=0; i < _currentSkill.enchsets7.length; i++)
|
|
|
+ for (int i = 0; i < _currentSkill.enchsets7.length; i++)
|
|
|
{
|
|
|
try
|
|
|
{
|
|
|
- _currentSkill.currentSkills.add(_count+i, _currentSkill.enchsets7[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets7[i]));
|
|
|
+ _currentSkill.currentSkills.add(_count + i, _currentSkill.enchsets7[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets7[i]));
|
|
|
count++;
|
|
|
}
|
|
|
catch (Exception e)
|
|
|
{
|
|
|
- _log.log(Level.SEVERE, "Skill id="+_currentSkill.enchsets7[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets7[i]).getDisplayId()+" level="+_currentSkill.enchsets7[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets7[i]).getLevel(), e);
|
|
|
+ _log.log(Level.SEVERE, "Skill id=" + _currentSkill.enchsets7[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets7[i]).getDisplayId() + " level=" + _currentSkill.enchsets7[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets7[i]).getLevel(), e);
|
|
|
}
|
|
|
}
|
|
|
_count = count;
|
|
|
- for (int i=0; i < _currentSkill.enchsets8.length; i++)
|
|
|
+ for (int i = 0; i < _currentSkill.enchsets8.length; i++)
|
|
|
{
|
|
|
try
|
|
|
{
|
|
|
- _currentSkill.currentSkills.add(_count+i, _currentSkill.enchsets8[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets8[i]));
|
|
|
+ _currentSkill.currentSkills.add(_count + i, _currentSkill.enchsets8[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets8[i]));
|
|
|
count++;
|
|
|
}
|
|
|
catch (Exception e)
|
|
|
{
|
|
|
- _log.log(Level.SEVERE, "Skill id="+_currentSkill.enchsets8[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets8[i]).getDisplayId()+" level="+_currentSkill.enchsets8[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets8[i]).getLevel(), e);
|
|
|
+ _log.log(Level.SEVERE, "Skill id=" + _currentSkill.enchsets8[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets8[i]).getDisplayId() + " level=" + _currentSkill.enchsets8[i].getEnum("skillType", L2SkillType.class, L2SkillType.DUMMY).makeSkill(_currentSkill.enchsets8[i]).getLevel(), e);
|
|
|
}
|
|
|
}
|
|
|
}
|