|
69 | 69 | async function get_allowed_objects() { |
70 | 70 | toggle_loading() |
71 | 71 | allowed_objects.value = {} |
72 | | - const responses = await Promise.all( |
73 | | - filenames.map((filename) => |
74 | | - api_fetch({ schema, params: { filename, supported_feature } }), |
75 | | - ) |
76 | | - ) |
77 | | - const values = responses.map((r) => r.data.value.allowed_objects) |
78 | | - const allKeys = [...new Set(values.flatMap((v) => Object.keys(v)))] |
79 | | - const commonKeys = allKeys.filter( |
80 | | - (key) => !values.some((obj) => !Object.prototype.hasOwnProperty.call(obj, key)), |
| 72 | + const promise_array = [] |
| 73 | + for (const filename of filenames) { |
| 74 | + const params = { filename, supported_feature } |
| 75 | + const promise = api_fetch({ schema, params }) |
| 76 | + promise_array.push(promise) |
| 77 | + } |
| 78 | + const api_responses = await Promise.all(promise_array) |
| 79 | + const allowed_objects_list = [] |
| 80 | + for (const api_response of api_responses) { |
| 81 | + allowed_objects_list.push(api_response.data.value.allowed_objects) |
| 82 | + } |
| 83 | + const all_keys = [ |
| 84 | + ...new Set( |
| 85 | + allowed_objects_list.flatMap((allowed_object_map) => |
| 86 | + Object.keys(allowed_object_map), |
| 87 | + ), |
| 88 | + ), |
| 89 | + ] |
| 90 | + const common_keys = all_keys.filter( |
| 91 | + (candidate_key) => |
| 92 | + !allowed_objects_list.some( |
| 93 | + (allowed_object_map) => |
| 94 | + !Object.prototype.hasOwnProperty.call(allowed_object_map, candidate_key), |
| 95 | + ), |
81 | 96 | ) |
82 | | - const finalObject = {} |
83 | | - for (const key of commonKeys) { |
84 | | - const loadScores = values.map((obj) => obj[key].is_loadable) |
85 | | - const priorities = values |
86 | | - .map((obj) => obj[key].object_priority) |
87 | | - .filter((p) => p !== undefined && p !== null) |
88 | | - finalObject[key] = { is_loadable: Math.min(...loadScores) } |
89 | | - if (priorities.length) { |
90 | | - finalObject[key].object_priority = Math.max(...priorities) |
| 97 | + const final_object = {} |
| 98 | + for (const key of common_keys) { |
| 99 | + const load_score_list = allowed_objects_list.map( |
| 100 | + (allowed_object_map) => allowed_object_map[key].is_loadable, |
| 101 | + ) |
| 102 | + const priority_list = allowed_objects_list |
| 103 | + .map((allowed_object_map) => allowed_object_map[key].object_priority) |
| 104 | + .filter((priority_value) => priority_value !== undefined && priority_value !== null) |
| 105 | + final_object[key] = { is_loadable: Math.min(...load_score_list) } |
| 106 | + if (priority_list.length) { |
| 107 | + final_object[key].object_priority = Math.max(...priority_list) |
91 | 108 | } |
92 | 109 | } |
93 | | - allowed_objects.value = finalObject |
94 | | - let alreadySelected = false |
95 | | - const objectKeys = Object.keys(finalObject) |
96 | | - if (objectKeys.length) { |
97 | | - const highestLoadScore = Math.max( |
98 | | - ...objectKeys.map((key) => finalObject[key].is_loadable) |
| 110 | + allowed_objects.value = final_object |
| 111 | + let already_selected = false |
| 112 | + const object_keys = Object.keys(final_object) |
| 113 | + if (object_keys.length) { |
| 114 | + const highest_load_score = Math.max( |
| 115 | + ...object_keys.map((k) => final_object[k].is_loadable), |
99 | 116 | ) |
100 | | - if (highestLoadScore > 0) { |
101 | | - const bestScoreObjects = objectKeys.filter( |
102 | | - (key) => finalObject[key].is_loadable === highestLoadScore |
| 117 | + if (highest_load_score > 0) { |
| 118 | + const best_score_objects = object_keys.filter( |
| 119 | + (k) => final_object[k].is_loadable === highest_load_score, |
103 | 120 | ) |
104 | | - if (bestScoreObjects.length === 1) { |
105 | | - set_geode_object(bestScoreObjects[0]) |
106 | | - alreadySelected = true |
| 121 | + if (best_score_objects.length === 1) { |
| 122 | + set_geode_object(best_score_objects[0]) |
| 123 | + already_selected = true |
107 | 124 | } else { |
108 | | - const highestPriority = Math.max( |
109 | | - ...bestScoreObjects.map( |
110 | | - (key) => finalObject[key].object_priority ?? -Infinity |
111 | | - ) |
| 125 | + const highest_priority = Math.max( |
| 126 | + ...best_score_objects.map( |
| 127 | + (k) => final_object[k].object_priority ?? -Infinity, |
| 128 | + ), |
112 | 129 | ) |
113 | | - const bestPriorityObjects = bestScoreObjects.filter( |
114 | | - (key) => finalObject[key].object_priority === highestPriority |
| 130 | + const best_priority_objects = best_score_objects.filter( |
| 131 | + (k) => final_object[k].object_priority === highest_priority, |
115 | 132 | ) |
116 | | - if (highestPriority !== -Infinity && bestPriorityObjects.length === 1) { |
117 | | - set_geode_object(bestPriorityObjects[0]) |
118 | | - alreadySelected = true |
| 133 | + if (highest_priority !== -Infinity && best_priority_objects.length === 1) { |
| 134 | + set_geode_object(best_priority_objects[0]) |
| 135 | + already_selected = true |
119 | 136 | } |
120 | 137 | } |
121 | 138 | } |
122 | 139 | } |
123 | | - if (!alreadySelected && objectKeys.length === 1) { |
124 | | - set_geode_object(objectKeys[0]) |
| 140 | + if (!already_selected && object_keys.length === 1) { |
| 141 | + set_geode_object(object_keys[0]) |
125 | 142 | } |
126 | 143 | toggle_loading() |
127 | 144 | } |
128 | 145 |
|
| 146 | +
|
129 | 147 | function set_geode_object(input_geode_object) { |
130 | 148 | if (input_geode_object != "") { |
131 | 149 | emit("update_values", { input_geode_object }) |
|
0 commit comments