-
Notifications
You must be signed in to change notification settings - Fork 157
/
Copy pathcycle.js
107 lines (99 loc) · 2.92 KB
/
cycle.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
/*Copyright 2021 Kirk McDonald
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.*/
function getFuelConsumers(spec, recipes) {
let consumers = []
for (let recipe of recipes) {
let building = spec.getBuilding(recipe)
if (building !== null && building.fuel === "chemical") {
consumers.push(recipe)
}
}
return consumers
}
function neighboringRecipes(spec, recipes, recipe, invert) {
let result = new Set()
let itemSet
if (invert) {
itemSet = recipe.products
} else {
itemSet = recipe.getIngredients()
}
for (let ing of itemSet) {
let recipeSet
if (invert) {
recipeSet = ing.item.uses
if (ing.item === spec.fuel.item) {
recipeSet = recipeSet.concat(getFuelConsumers(spec, recipes))
}
} else {
recipeSet = ing.item.recipes
}
for (let recipe of recipeSet) {
if (!recipes.has(recipe)) {
continue
}
result.add(recipe)
}
}
return result
}
function visit(spec, recipes, recipe, seen, invert) {
if (seen.has(recipe)) {
return []
}
seen.add(recipe)
let neighbors = neighboringRecipes(spec, recipes, recipe, invert)
let result = []
for (let neighbor of neighbors) {
let x = visit(spec, recipes, neighbor, seen, invert)
result.push(...x)
}
result.push(recipe)
return result
}
function isSelfCycle(component) {
let recipe = Array.from(component)[0]
let products = new Set()
for (let {item} of recipe.products) {
products.add(item)
}
for (let {item} of recipe.getIngredients()) {
if (products.has(item)) {
return true
}
}
return false
}
export function getCycleRecipes(spec, recipes) {
let seen = new Set()
let L = []
for (let recipe of recipes) {
let x = visit(spec, recipes, recipe, seen, false)
L.push(...x)
}
//let components = []
let result = new Set()
seen = new Set()
for (let i = L.length - 1; i >= 0; i--) {
let root = L[i]
if (seen.has(root)) {
continue
}
let component = visit(spec, recipes, root, seen, true)
if (component.length > 1 || isSelfCycle(component)) {
for (let recipe of component) {
result.add(recipe)
}
}
//components.push(component)
}
return result
}