-/**\r
- * ============LICENSE_START=======================================================\r
- * org.onap.aai\r
- * ================================================================================\r
- * Copyright © 2017-2018 AT&T Intellectual Property. All rights reserved.\r
- * Copyright © 2017-2018 Amdocs\r
- * ================================================================================\r
- * Licensed under the Apache License, Version 2.0 (the "License");\r
- * you may not use this file except in compliance with the License.\r
- * You may obtain a copy of the License at\r
- *\r
- * http://www.apache.org/licenses/LICENSE-2.0\r
- *\r
- * Unless required by applicable law or agreed to in writing, software\r
- * distributed under the License is distributed on an "AS IS" BASIS,\r
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r
- * See the License for the specific language governing permissions and\r
- * limitations under the License.\r
- * ============LICENSE_END=========================================================\r
- */\r
-package org.onap.aai.sparky.util;\r
-\r
-import java.util.ArrayList;\r
-import java.util.List;\r
-\r
-public class SuggestionsPermutation {\r
-\r
- /*\r
- * Will return all the unique combinations of the suggestions provided. The order of the\r
- * permutation is not taken into account when computing the uniqueness. eg: A list of A,B,C,D will\r
- * return [[A], [A, B, C, D], [A, C, D], [A, D], [B], [B, C, D], [B, D], [C], [C, D], [D]]\r
- * \r
- * @param list The list to create the unique permutations\r
- * \r
- * @return A Arraylist which contains a array list of all possible combinations\r
- */\r
- public static ArrayList<ArrayList<String>> getUniqueListForSuggestions(\r
- List<String> originalList) {\r
- ArrayList<ArrayList<String>> lists = new ArrayList<ArrayList<String>>();\r
- if (originalList.isEmpty()) {\r
- lists.add(new ArrayList<String>());\r
- return lists;\r
- }\r
- List<String> list = new ArrayList<String>(originalList);\r
- String head = list.get(0);\r
- ArrayList<String> rest = new ArrayList<String>(list.subList(1, list.size()));\r
- \r
- for (ArrayList<String> activeList : getUniqueListForSuggestions(rest)) {\r
- ArrayList<String> newList = new ArrayList<String>();\r
- newList.add(head);\r
- newList.addAll(activeList);\r
- lists.add(newList);\r
- lists.add(activeList);\r
- }\r
- return lists;\r
- }\r
- \r
- public static ArrayList<ArrayList<String>> getNonEmptyUniqueLists(List<String> list){\r
- ArrayList<ArrayList<String>> lists = getUniqueListForSuggestions(list);\r
- // remove empty list from the power set \r
- for (ArrayList<String> emptyList : lists ){\r
- if ( emptyList.isEmpty() ) {\r
- lists.remove(emptyList);\r
- break;\r
- }\r
- }\r
- return lists;\r
- }\r
-\r
- public static List<List<String>> getListPermutations(List<String> list) {\r
- List<String> inputList = new ArrayList<String>();\r
- inputList.addAll(list);\r
- if (inputList.size() == 0) {\r
- List<List<String>> result = new ArrayList<List<String>>();\r
- result.add(new ArrayList<String>());\r
- return result;\r
- }\r
-\r
- List<List<String>> listOfLists = new ArrayList<List<String>>();\r
-\r
- String firstElement = inputList.remove(0);\r
-\r
- List<List<String>> recursiveReturn = getListPermutations(inputList);\r
- for (List<String> li : recursiveReturn) {\r
-\r
- for (int index = 0; index <= li.size(); index++) {\r
- List<String> temp = new ArrayList<String>(li);\r
- temp.add(index, firstElement);\r
- listOfLists.add(temp);\r
- }\r
-\r
- }\r
- return listOfLists;\r
- }\r
-\r
-}\r
+/**
+ * ============LICENSE_START===================================================
+ * SPARKY (AAI UI service)
+ * ============================================================================
+ * Copyright © 2017 AT&T Intellectual Property.
+ * Copyright © 2017 Amdocs
+ * All rights reserved.
+ * ============================================================================
+ * 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.
+ * ============LICENSE_END=====================================================
+ *
+ * ECOMP and OpenECOMP are trademarks
+ * and service marks of AT&T Intellectual Property.
+ */
+package org.onap.aai.sparky.util;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class SuggestionsPermutation {
+
+ /*
+ * Will return all the unique combinations of the suggestions provided. The order of the
+ * permutation is not taken into account when computing the uniqueness. eg: A list of A,B,C,D will
+ * return [[A], [A, B, C, D], [A, C, D], [A, D], [B], [B, C, D], [B, D], [C], [C, D], [D]]
+ *
+ * @param list The list to create the unique permutations
+ *
+ * @return A Arraylist which contains a array list of all possible combinations
+ */
+ public static ArrayList<ArrayList<String>> getUniqueListForSuggestions(
+ List<String> originalList) {
+ ArrayList<ArrayList<String>> lists = new ArrayList<ArrayList<String>>();
+ if (originalList.isEmpty()) {
+ lists.add(new ArrayList<String>());
+ return lists;
+ }
+ List<String> list = new ArrayList<String>(originalList);
+ String head = list.get(0);
+ ArrayList<String> rest = new ArrayList<String>(list.subList(1, list.size()));
+
+ for (ArrayList<String> activeList : getUniqueListForSuggestions(rest)) {
+ ArrayList<String> newList = new ArrayList<String>();
+ newList.add(head);
+ newList.addAll(activeList);
+ lists.add(newList);
+ lists.add(activeList);
+ }
+ return lists;
+ }
+
+ public static ArrayList<ArrayList<String>> getNonEmptyUniqueLists(List<String> list){
+ ArrayList<ArrayList<String>> lists = getUniqueListForSuggestions(list);
+ // remove empty list from the power set
+ for (ArrayList<String> emptyList : lists ){
+ if ( emptyList.isEmpty() ) {
+ lists.remove(emptyList);
+ break;
+ }
+ }
+ return lists;
+ }
+
+ public static List<List<String>> getListPermutations(List<String> list) {
+ List<String> inputList = new ArrayList<String>();
+ inputList.addAll(list);
+ if (inputList.size() == 0) {
+ List<List<String>> result = new ArrayList<List<String>>();
+ result.add(new ArrayList<String>());
+ return result;
+ }
+
+ List<List<String>> listOfLists = new ArrayList<List<String>>();
+
+ String firstElement = inputList.remove(0);
+
+ List<List<String>> recursiveReturn = getListPermutations(inputList);
+ for (List<String> li : recursiveReturn) {
+
+ for (int index = 0; index <= li.size(); index++) {
+ List<String> temp = new ArrayList<String>(li);
+ temp.add(index, firstElement);
+ listOfLists.add(temp);
+ }
+
+ }
+ return listOfLists;
+ }
+
+}
Code Review / aai / sparky-be.git / blobdiff