# maybe this should be something like cover.contains() to handle Cover subclasses
def find_hypercubes(lens_values, cover):
  cube_ids = []
  for i, center in enumerate(cover.centers_):
    lower_bounds, upper_bounds = center - cover.radius_, center + cover.radius_
    if np.all(lens_values >= lower_bounds) and np.all(lens_values <= upper_bounds):
      cube_ids.append(i)
  return cube_ids

def find_nodes(cube_ids, kmgraph):
  nodes = {}
  for node, data_ids in kmgraph['nodes'].items():
    if node.startswith(tuple(['cube'+str(i) for i in cube_ids])):
      nodes[node] = data_ids
  return nodes

def assign_nodes(data_values, data, nodes, knn):
  knn_data = []
  knn_node_ids = []
  for node, data_ids in nodes.items():
    node_data = data[data_ids]
    knn_data.append(node_data)
    knn_node_ids.append([node]*len(node_data))
  knn_data = np.vstack(knn_data)
  knn_node_ids = np.concatenate(knn_node_ids)
  knn.fit(knn_data)
  nn_ids = knn.kneighbors([data_values], return_distance=False)
  return np.unique(knn_node_ids[nn_ids])