106 {
107 if (ids) ids.Clear();
110
111
112
113
114
115
116 if ( numOfRecipes == 0 ) return 0;
117 int found = 0;
118 RecipeBase p_recipe = NULL;
119 for (int i = 0; i < numOfRecipes; i++)
120 {
122
124 {
125 if (ids) ids.Insert( p_recipe.
GetID() );
126 found++;
127 }
128 }
129 return found;
130 }
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[])
bool CheckRecipe(ItemBase item1, ItemBase item2, PlayerBase player)