hdkv/i2_bot
Archived
1
Fork 0
Code Releases Activity

So, /best in new way is back

Browse Source
This commit is contained in:
Vladimir Hodakov 2018-02-07 14:37:50 +04:00
parent bacf76fd39
commit c7a8fcf6de
1 changed files with 43 additions and 46 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

89
lib/pokedexer/getters.go
View File

@ -6,10 +6,9 @@ package pokedexer
import ( import (
"git.wtfteam.pro/fat0troll/i2_bot/lib/dbmapping" "git.wtfteam.pro/fat0troll/i2_bot/lib/dbmapping"
"sort" "sort"
"strconv"
) )
// External functions
func (p *Pokedexer) getBestPokememes(playerID int) ([]*dbmapping.PokememeFull, bool) { func (p *Pokedexer) getBestPokememes(playerID int) ([]*dbmapping.PokememeFull, bool) {
pokememesArray := make([]*dbmapping.PokememeFull, 0) pokememesArray := make([]*dbmapping.PokememeFull, 0)
@ -30,57 +29,55 @@ func (p *Pokedexer) getBestPokememes(playerID int) ([]*dbmapping.PokememeFull, b
allPokememes := c.DataCache.GetAllPokememes() allPokememes := c.DataCache.GetAllPokememes()
pokememesArraySorted := make([]*dbmapping.PokememeFull, 0)
for i := range allPokememes { for i := range allPokememes {
pokememesArraySorted = append(pokememesArraySorted, allPokememes[i]) // Adding only affordable pokememes...
if (allPokememes[i].Pokememe.Defence < profileRaw.Power) || allPokememes[i].Pokememe.Purchaseable {
// ...and only of needed grade (+1 until 9)
neededGrade := 0
if profileRaw.LevelID < 9 {
neededGrade = profileRaw.LevelID + 1
} else {
neededGrade = 9
}
if allPokememes[i].Pokememe.Grade == neededGrade {
// ...and only of our elements if our level past 4
matchLeague := false
if profileRaw.LevelID < 4 {
matchLeague = true
} else {
for j := range allPokememes[i].Elements {
if allPokememes[i].Elements[j].LeagueID == playerRaw.LeagueID {
matchLeague = true
}
}
}
if matchLeague {
pokememesArray = append(pokememesArray, allPokememes[i])
}
}
}
} }
sort.Slice(pokememesArraySorted, func(i, j int) bool { c.Log.Debug(strconv.Itoa(len(pokememesArray)) + " pokememes passed initial /best filtration.")
return pokememesArraySorted[i].Pokememe.Attack > pokememesArraySorted[j].Pokememe.Attack
// As we have already filtered this array, we need to sort it and pass to view
sort.Slice(pokememesArray, func(i, j int) bool {
return pokememesArray[i].Pokememe.Attack > pokememesArray[j].Pokememe.Attack
}) })
if profileRaw.LevelID < 4 { if len(pokememesArray) > 5 {
for i := range pokememesArraySorted { idx := 0
if (pokememesArraySorted[i].Pokememe.Defence < profileRaw.Power) || (pokememesArraySorted[i].Pokememe.Purchaseable) {
if allPokememes[i].Pokememe.Grade == profileRaw.LevelID+1 { pokememesArrayShorted := make([]*dbmapping.PokememeFull, 0)
pokememesArray = append(pokememesArray, pokememesArraySorted[i])
} for i := range pokememesArray {
} if idx < 5 {
} pokememesArrayShorted = append(pokememesArrayShorted, pokememesArray[i])
} else if profileRaw.LevelID > 8 {
// TODO: Remove it on 10th grade pokememes arrival
for i := range allPokememes {
if pokememesArraySorted[i].Pokememe.Grade == 9 {
matchLeague := false
for j := range pokememesArraySorted[i].Elements {
if pokememesArraySorted[i].Elements[j].LeagueID == playerRaw.LeagueID {
matchLeague = true
}
}
if matchLeague {
if (pokememesArraySorted[i].Pokememe.Defence < profileRaw.Power) || (pokememesArraySorted[i].Pokememe.Purchaseable) {
pokememesArray = append(pokememesArray, pokememesArraySorted[i])
}
}
}
}
} else {
for i := range allPokememes {
if pokememesArraySorted[i].Pokememe.Grade == profileRaw.LevelID+1 {
matchLeague := false
for j := range pokememesArraySorted[i].Elements {
if pokememesArraySorted[i].Elements[j].LeagueID == playerRaw.LeagueID {
matchLeague = true
}
}
if matchLeague {
if (pokememesArraySorted[i].Pokememe.Defence < profileRaw.Power) || (pokememesArraySorted[i].Pokememe.Purchaseable) {
pokememesArray = append(pokememesArray, pokememesArraySorted[i])
}
}
} }
idx++
} }
pokememesArray = pokememesArrayShorted
} }
return pokememesArray, true return pokememesArray, true