lineage2/l2j_mobius
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Changes based on Java 10 recommendations.

Browse Source
This commit is contained in:
MobiusDev
2018-08-05 19:38:51 +00:00
parent 29eb40b3fa
commit 7cbd09ae2e
94 changed files with 260 additions and 168 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
L2J_Mobius_2.5_Underground/java/com/l2jmobius/gameserver/handler/DailyMissionHandler.java
View File

@@ -49,7 +49,6 @@ public class DailyMissionHandler
{
try
{
ScriptEngineManager.getInstance().executeDailyMissionMasterHandler();
}
catch (Exception e)

4
L2J_Mobius_2.5_Underground/java/com/l2jmobius/gameserver/ui/Gui.java
View File

@@ -311,8 +311,8 @@ public class Gui
JScrollPane scrollPanel = new JScrollPane(txtrConsole);
scrollPanel.setBounds(0, 0, 800, 550);
JLayeredPane layeredPanel = new JLayeredPane();
layeredPanel.add(scrollPanel, new Integer(0), 0);
layeredPanel.add(systemPanel, new Integer(1), 0);
layeredPanel.add(scrollPanel, 0, 0);
layeredPanel.add(systemPanel, 1, 0);
// Set frame.
JFrame frame = new JFrame("Mobius - GameServer");

12
L2J_Mobius_2.5_Underground/java/com/l2jmobius/gameserver/util/cron4j/SchedulingPattern.java
View File

@@ -370,7 +370,7 @@ public class SchedulingPattern
ArrayList<Integer> values = new ArrayList<>();
for (int i = min; i <= max; i++)
{
values.add(new Integer(i));
values.add(i);
}
return values;
}
@@ -393,7 +393,7 @@ public class SchedulingPattern
if (size == 1)
{
ArrayList<Integer> values = new ArrayList<>();
values.add(new Integer(v1));
values.add(v1);
return values;
}
String v2Str = st.nextToken();
@@ -411,7 +411,7 @@ public class SchedulingPattern
{
for (int i = v1; i <= v2; i++)
{
values.add(new Integer(i));
values.add(i);
}
}
else if (v1 > v2)
@@ -420,17 +420,17 @@ public class SchedulingPattern
int max = parser.getMaxValue();
for (int i = v1; i <= max; i++)
{
values.add(new Integer(i));
values.add(i);
}
for (int i = min; i <= v2; i++)
{
values.add(new Integer(i));
values.add(i);
}
}
else
{
// v1 == v2
values.add(new Integer(v1));
values.add(v1);
}
return values;
}