returns ranking of item given in parameter , zero if not present in the candidate list concode_field_sep Score score concode_elem_sep int number_of_candidates concode_elem_sep long bestSuboptimal concode_elem_sep TreeSet<Item> sorted_items concode_elem_sep List<Float> textualBranchHeuristic concode_elem_sep float max_unseen concode_elem_sep List<Float> socialBranchHeuristic concode_elem_sep double min_topk concode_elem_sep Map<Long,Item> items concode_elem_sep double max_rest concode_field_sep void filterNextLetter concode_elem_sep void debug concode_elem_sep float getTextualBranchHeuristic concode_elem_sep List<Item> getListTopk concode_elem_sep Item getItem concode_elem_sep void addWordBranchHeuristic concode_elem_sep void reorder concode_elem_sep boolean containsItemId concode_elem_sep void setBranchHeuristics concode_elem_sep int getNumberOfSortedItems concode_elem_sep void addItem concode_elem_sep void filterNextWord concode_elem_sep Map<Long,Item> getItems concode_elem_sep List<Long> getLongListTopk concode_elem_sep void updateAlpha concode_elem_sep void addTagToItem concode_elem_sep void updateTextualScore concode_elem_sep boolean terminationCondition concode_elem_sep void updateSocialScore concode_elem_sep double getMaxRest concode_elem_sep Set<Long> getSetTopk concode_elem_sep float getSocialBranchHeuristic
int function ( long arg0 , int arg1 ) { int loc0 = 1 ; for ( Item loc1 : this . sorted_items ) { if ( arg0 == loc1 . getItemId ( ) ) return loc0 ; loc0 ++ ; } return 0 ; }