001package org.hl7.fhir.utilities; 002 003import java.util.ArrayList; 004import java.util.Collection; 005import java.util.Collections; 006import java.util.Comparator; 007import java.util.HashMap; 008import java.util.Iterator; 009import java.util.List; 010import java.util.Map; 011 012 013public class NamedItemList<T extends org.hl7.fhir.utilities.NamedItemList.NamedItem> implements Collection<T> { 014 public interface NamedItem { 015 public String getListName(); 016 } 017 018 019 private static final int SIZE_CUTOFF_MAP = 10; 020 021 022 private List<T> list = new ArrayList<>(); 023 private Map<String, List<T>> map = null; 024 025 @Override 026 public int size() { 027 return list.size(); 028 } 029 030 @Override 031 public boolean isEmpty() { 032 return list.isEmpty(); 033 } 034 035 @Override 036 public boolean contains(Object o) { 037 return list.contains(o); 038 } 039 040 @Override 041 public Iterator<T> iterator() { 042 return list.iterator(); 043 } 044 045 @Override 046 public Object[] toArray() { 047 return list.toArray(); 048 } 049 050 @Override 051 public <T> T[] toArray(T[] a) { 052 return list.toArray(a); 053 } 054 055 @Override 056 public boolean add(T e) { 057 addToMap(e); 058 return list.add(e); 059 } 060 public void add(int index, T e) { 061 addToMap(e); 062 list.add(index, e); 063 } 064 065 @Override 066 public boolean remove(Object o) { 067 map = null; 068 return list.remove(o); 069 } 070 071 @Override 072 public boolean containsAll(Collection<?> c) { 073 return list.containsAll(c); 074 } 075 076 @Override 077 public boolean addAll(Collection<? extends T> c) { 078 for(T e : c) { 079 addToMap(e); 080 } 081 return list.addAll(c); 082 } 083 084 @Override 085 public boolean removeAll(Collection<?> c) { 086 map = null; 087 return list.removeAll(c); 088 } 089 090 @Override 091 public boolean retainAll(Collection<?> c) { 092 map = null; 093 return list.retainAll(c); 094 } 095 096 @Override 097 public void clear() { 098 list.clear(); 099 map = null; 100 } 101 102 public List<T> getByName(String name) { 103 List<T> res = new ArrayList<>(); 104 if (size() > SIZE_CUTOFF_MAP) { 105 if (map == null) { 106 buildMap(); 107 } 108 List<T> l = map.get(name); 109 if (l != null) { 110 res.addAll(l); 111 } 112 } else { 113 for (T child : list) { 114 if (name.equals(child.getListName())) { 115 res.add(child); 116 } 117 } 118 } 119 return res; 120 } 121 122 public int getSizeByName(String name) { 123 if (map == null) { 124 buildMap(); 125 } 126 List<T> l = map.get(name); 127 return l == null ? 0 : l.size(); 128 } 129 130 public T get(int c) { 131 return list.get(c); 132 } 133 134 private void buildMap() { 135 map = new HashMap<>(); 136 for (T child : list) { 137 addToMap(child); 138 } 139 } 140 141 private void addToMap(T child) { 142 if (map == null) { 143 // map will be re-built anyway in next call to getByName 144 return; 145 } 146 String n = child.getListName(); 147 List<T> l = map.get(n); 148 if (l == null) { 149 l = new ArrayList<>(); 150 map.put(n,l); 151 } 152 l.add(child); 153 } 154 155 public void sort(Comparator<? super T> sorter) { 156 Collections.sort(list, sorter); 157 } 158 159 public void clearMap() { 160 map = null; 161 } 162 163 public int indexOf(T child) { 164 return list.indexOf(child); 165 } 166}