Help Help

[L2shaken]

http://imgur.com/a/gZoEQ
 

protected L2PcInstance getPlayerWithMaxScore()
{
L2PcInstance max = players.head().getNext().getKey();

for (L2PcInstance player : players.keySet())
if (players.get(player)[2] > players.get(max)[2])
max = player;

return max;
}

I have this error, can someone tell me how to stay?

Edited December 3, 2016 by L2shaken

[bravetobe]

http://imgur.com/a/gZoEQ

 

protected L2PcInstance getPlayerWithMaxScore()

{

L2PcInstance max = players.head().getNext().getKey();

 

for (L2PcInstance player : players.keySet())

if (players.get(player)[2] > players.get(max)[2])

max = player;

 

return max;

}

 

I have this error, can someone tell me how to stay?

create a method named head() and get the head of that HashMap  :dat:

 

 

BTW,u asked the same question in ur previous topic.

 

Tryskell answer u already and he gave u the code which u need:

 

EventTeam winner = null;
for (EventTeam team : teams.values())
      if (team.getScore() > ((winner == null) ? 0 : winner.getScore()))
             winner = team;


return winner;

If you got only 2 teams max, forever, it's easier to simply write both teams and compare team1 and team2 getScore().

 

If you can't complete or integrate what I wrote, simply forget to open a server for the next 6 months minimum and take time to learn Java.

 

PS : it's generally terrible to return a simple id, which means you must find back the associated team in one way or another after the getWinner(). It's far better then to take back the entire EventTeam which probably holds all useful informations, such as team compo, the score, the id, etc.

 

PS2 : I avoid to use or provide lambdas writting style, first because I don't want to seek the best writting style, second because lambdas is still shady for 90% of ppl, similar to maven vs ant, third because it's the most popular writting style and at least anyone will understand it.

 

Edited December 3, 2016 by bravetobe

[L2shaken]

create a method named head() and get the head of that HashMap  :dat:

 

 

BTW,u asked the same question in ur previous topic.

 

Tryskell answer u already and he gave u the code which u need:

 

This code is part of the Phoenix Event Engine, I could not do it that way that Tryskell quoted.

Event Link: http://www.mediafire.com/file/ww4b3u0efs58t8q/Phoenix+Event+Engine+aCis.rar

Edited December 3, 2016 by L2shaken

[bravetobe]

create a boolean kappa true

winner null

while loop it with hasNext()

if boolean ,get score and compare it with 0/1 whatever u want (if event has 1 player,do u want him to win?), and make him winner/max and change kappa to false.It supposed to get the first player and make him winner so u can compare it with the next players

else compare it with max score and set him winner

later on do what u want,u found the guy

 

P.S U need to declare properly too.not gonna code u

loop hasNext() -> iterator.

Also,i dont like hashmap.Thats how i would do it tho

Edited December 3, 2016 by bravetobe

[Tessa]

Get back when you finish the programming fundamentals course... especially the data structures. :lol:

[bravetobe]

Get back when you finish the programming fundamentals course... especially the data structures. :lol:

wut mate...

 

show me the code,if u actually want to make a point and prove me wrong.

Thats what i said works.

 

I m not like Access ,just to let u know

Edited December 3, 2016 by bravetobe

[Tessa]

wut mate...

 

show me the code,if u actually want to make a point and prove me wrong.

Thats what i said works.

 

I m not like Access ,just to let u know

My suggestion was for the author of this topic. :lol:

[bravetobe]

My suggestion was for the author of this topic. :lol:

For a moment i wanted to answer like " use dickHead() instead of head()" but then i would be immature ...

 

Thats what happens tho when u leech code .Next time i will do tho Kappa

mb

[SweeTs]

bravetobe, next L2jDeveloper supporting Greek section, confirmed storka :lol:

Edited December 3, 2016 by SweeTs

[AccessDenied]

bravetobe, next L2jDeveloper supporting Greek section, confirmed storka :lol:

bravetobe he failed opening frozen 100% balanco PROFESSIONALA servidor and now he HATIRINO 

[bravetobe]

bravetobe, next L2jDeveloper supporting Greek section, confirmed storka :lol:

all the way to the top,just give me privs to ban several plebs ... 

Fck hashmap tho.

 

Gate lyfe >ArrayList > 0 >HashMap > L2J developing for me :(

[Tessa]

What you have against the hashmap? :lol:

[L2shaken]

:(

Edited December 4, 2016 by L2shaken

[bravetobe]

:(

U got ur answer ...

 

Really if u dont know how to code it,go fckign tutorials for hashmap.Do this favor to urself and if u expect someone to spoonfood that dogsh1t,then stop l2jdeveloping

[SweeTs]

You know, if you can't do something, you don't do it. So, don't add phoenix :P

[Versus]

If it's such a problem to adapt the code, why don't you simply use the javolution lib and be done with it, instead of creating a new topic for each method that doesn't exist on HashMap?