113 {
114 if (ids) ids.Clear();
117
118
119
120
121
122
123 if ( numOfRecipes == 0 ) return 0;
124 int found = 0;
126 for (int i = 0; i < numOfRecipes; i++)
127 {
129
131 {
132 if (ids) ids.Insert( p_recipe.GetID() );
133 found++;
134 }
135 }
136 return found;
137 }
ItemBase m_ingredient1[MAX_CONCURENT_RECIPES]
ref array< ref RecipeBase > m_RecipeList
int m_ResolvedRecipes[MAX_CONCURENT_RECIPES]
int GetRecipeIntersection(int num_of_ingredients, ItemBase items[])
fills an array with recipe IDs which 'item_a' and 'item_b' share
ItemBase m_ingredient2[MAX_CONCURENT_RECIPES]
int SortIngredients(int num_of_ingredients, ItemBase items_unsorted[], int resolved_recipes[])