Outrageously Funny Search Suggestion Engine :: Subcompletely

👉 In computer science, a subcompletely is a subset of another set. For example, if you have two sets A and B, the subcompletely containing set C is defined as: C = {A ∪ B}

subcompletely