Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int count_letters(string in_what, string letter)
- {
- in_what = to_lower_case(in_what);
- int before, after;
- before = length(in_what);
- after = length(replace_string(in_what, letter, ""));
- return before-after;
- }
- void main(string letter, int extra_amount, boolean most_letters, boolean every_item_in_game)
- {
- int sort_modifier;
- if(most_letters)
- sort_modifier = 1;
- else
- sort_modifier = -1;
- int hatidx,backidx,shirtidx,weaponidx,offhandidx,pantsidx,accidx,famidx = 0;
- boolean[item] map;
- if(every_item_in_game)
- map = $items[];
- else
- foreach it in get_inventory()
- map[it] = true;
- item[int] hats, backs, shirts, weapons, offhands, pants, accs, fams;
- foreach key in map
- {
- switch(key.to_slot())
- {
- case $slot[hat]:
- hats[hatidx] = key;
- hatidx += 1;
- break;
- case $slot[back]:
- backs[backidx] = key;
- backidx += 1;
- break;
- case $slot[shirt]:
- shirts[shirtidx] = key;
- shirtidx += 1;
- break;
- case $slot[weapon]:
- if (weapon_hands(key) == 1)
- {
- weapons[weaponidx] = key;
- weaponidx += 1;
- }
- break;
- case $slot[off-hand]:
- offhands[offhandidx] = key;
- offhandidx += 1;
- break;
- case $slot[pants]:
- pants[pantsidx] = key;
- pantsidx += 1;
- break;
- case $slot[acc1]:
- accs[accidx] = key;
- accidx += 1;
- break;
- case $slot[familiar]:
- fams[famidx] = key;
- famidx += 1;
- break;
- }
- }
- sort hats by -sort_modifier*count_letters(value, letter);
- sort backs by -sort_modifier*count_letters(value, letter);
- sort shirts by -sort_modifier*count_letters(value, letter);
- sort weapons by -sort_modifier*count_letters(value, letter);
- sort offhands by -sort_modifier*count_letters(value, letter);
- sort pants by -sort_modifier*count_letters(value, letter);
- sort accs by -sort_modifier*count_letters(value, letter);
- sort fams by -sort_modifier*count_letters(value, letter);
- hatidx = count_letters(hats[0], letter);
- backidx = count_letters(backs[0], letter);
- shirtidx = count_letters(shirts[0], letter);
- weaponidx = count_letters(weapons[0], letter);
- offhandidx = count_letters(offhands[0], letter);
- pantsidx = count_letters(pants[0], letter);
- accidx = count_letters(accs[0], letter);
- famidx = count_letters(fams[0], letter);
- print("=== Hats ===", "blue");
- foreach key in hats
- if (count_letters(hats[key], letter)*sort_modifier >= hatidx*sort_modifier - extra_amount)
- print(hats[key] + " -> " + count_letters(hats[key], letter));
- print("=== Back items ===", "blue");
- foreach key in backs
- if (count_letters(backs[key], letter)*sort_modifier >= backidx*sort_modifier - extra_amount)
- print(backs[key] + " -> " + count_letters(backs[key], letter));
- print("=== Shirts ===", "blue");
- foreach key in shirts
- if (count_letters(shirts[key], letter)*sort_modifier >= shirtidx*sort_modifier - extra_amount)
- print(shirts[key] + " -> " + count_letters(shirts[key], letter));
- print("=== Weapons (1-handed only) ===", "blue");
- foreach key in weapons
- if (count_letters(weapons[key], letter)*sort_modifier >= weaponidx*sort_modifier - extra_amount)
- print(weapons[key] + " -> " + count_letters(weapons[key], letter));
- print("=== Off-hands ===", "blue");
- foreach key in offhands
- if (count_letters(offhands[key], letter)*sort_modifier >= offhandidx*sort_modifier - extra_amount)
- print(offhands[key] + " -> " + count_letters(offhands[key], letter));
- print("=== Pants ===", "blue");
- foreach key in pants
- if (count_letters(pants[key], letter)*sort_modifier >= pantsidx*sort_modifier - extra_amount)
- print(pants[key] + " -> " + count_letters(pants[key], letter));
- print("=== Accessories ===", "blue");
- foreach key in accs
- if (count_letters(accs[key], letter)*sort_modifier >= accidx*sort_modifier - extra_amount)
- print(accs[key] + " -> " + count_letters(accs[key], letter));
- print("=== Familiar equipment ===", "blue");
- foreach key in fams
- if (count_letters(fams[key], letter)*sort_modifier >= famidx*sort_modifier - extra_amount)
- print(fams[key] + " -> " + count_letters(fams[key], letter));
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement