【升星优化】选择祭品神将页面,按照神将图鉴排序的反向规则进行排列,使珍贵的神将排序更为靠后,本体仍放在最后的位置
parent
bee0fa412e
commit
a4727e6de7
|
@ -238,7 +238,8 @@ function this.HeroSortData(heroData)
|
||||||
if a.heroConfig.Star == b.heroConfig.Star then
|
if a.heroConfig.Star == b.heroConfig.Star then
|
||||||
if a.lv == b.lv then
|
if a.lv == b.lv then
|
||||||
if a.id ~= curHeroData.Id and b.id ~= curHeroData.Id or a.id == curHeroData.Id and b.id == curHeroData.Id then
|
if a.id ~= curHeroData.Id and b.id ~= curHeroData.Id or a.id == curHeroData.Id and b.id == curHeroData.Id then
|
||||||
return a.id > b.id
|
-- return a.id > b.id
|
||||||
|
return a.heroConfig.Sort > b.heroConfig.Sort
|
||||||
else
|
else
|
||||||
return not a.id ~= curHeroData.Id and b.id == curHeroData.Id
|
return not a.id ~= curHeroData.Id and b.id == curHeroData.Id
|
||||||
end
|
end
|
||||||
|
|
|
@ -313,7 +313,7 @@ function this.HeroSortData(heroData)
|
||||||
if a.heroConfig.Star == b.heroConfig.Star then
|
if a.heroConfig.Star == b.heroConfig.Star then
|
||||||
if a.lv == b.lv then
|
if a.lv == b.lv then
|
||||||
if a.id ~= curHeroData.id and b.id ~= curHeroData.id or a.id == curHeroData.id and b.id == curHeroData.id then
|
if a.id ~= curHeroData.id and b.id ~= curHeroData.id or a.id == curHeroData.id and b.id == curHeroData.id then
|
||||||
return a.id > b.id
|
return a.heroConfig.Sort > b.heroConfig.Sort
|
||||||
else
|
else
|
||||||
return not a.id ~= curHeroData.id and b.id == curHeroData.id
|
return not a.id ~= curHeroData.id and b.id == curHeroData.id
|
||||||
end
|
end
|
||||||
|
|
Loading…
Reference in New Issue