33 public strictfp class S2CellUnion implements S2Region, Iterable<S2CellId> {
36   private ArrayList<S2CellId> cellIds = new ArrayList<S2CellId>();
41   public void initFromCellIds(ArrayList<S2CellId> cellIds) {  in initFromCellIds()
57   public void initSwap(ArrayList<S2CellId> cellIds) {  in initSwap()
62   public void initRawCellIds(ArrayList<S2CellId> cellIds) {  in initRawCellIds()
68     this.cellIds = new ArrayList<S2CellId>(size);  in initRawIds()
70       this.cellIds.add(new S2CellId(id));  in initRawIds()
81   public void initRawSwap(ArrayList<S2CellId> cellIds) {  in initRawSwap()
82     this.cellIds = new ArrayList<S2CellId>(cellIds);  in initRawSwap()
91   public S2CellId cellId(int i) {  in cellId()
97   public Iterator<S2CellId> iterator() {  in iterator()
102   public ArrayList<S2CellId> cellIds() {  in cellIds()
118   public void denormalize(int minLevel, int levelMod, ArrayList<S2CellId> output) {  in denormalize()
124     for (S2CellId id : this) {  in denormalize()
130         newLevel += (S2CellId.MAX_LEVEL - (newLevel - minLevel)) % levelMod;  in denormalize()
131         newLevel = Math.min(S2CellId.MAX_LEVEL, newLevel);  in denormalize()
136         S2CellId end = id.childEnd(newLevel);  in denormalize()
160   public boolean contains(S2CellId id) {  in contains()
184   public boolean intersects(S2CellId id) {  in intersects()
203     for (S2CellId id : that) {  in contains()
224     for (S2CellId id : union) {  in intersects()
246   public void getIntersection(S2CellUnion x, S2CellId id) {  in getIntersection()
258       S2CellId idmax = id.rangeMax();  in getIntersection()
283       S2CellId imin = x.cellId(i).rangeMin();  in getIntersection()
284       S2CellId jmin = y.cellId(j).rangeMin();  in getIntersection()
329   private int indexedBinarySearch(List<S2CellId> l, S2CellId key, int low) {  in indexedBinarySearch()
334       S2CellId midVal = l.get(mid);  in indexedBinarySearch()
360     ArrayList<S2CellId> output = new ArrayList<S2CellId>();  in expand()
361     long levelLsb = S2CellId.lowestOnBitForLevel(level);  in expand()
364       S2CellId id = cellId(i);  in expand()
393     int minLevel = S2CellId.MAX_LEVEL;  in expand()
394     for (S2CellId id : this) {  in expand()
423     for (S2CellId id : this) {  in getCapBound()
438     for (S2CellId id : this) {  in getCapBound()
447     for (S2CellId id : this) {  in getRectBound()
465     return contains(S2CellId.fromPoint(p));  in contains()
477     for (S2CellId cellId : cellIds) {  in leafCellsCovered()
478       int invertedLevel = S2CellId.MAX_LEVEL - cellId.level();  in leafCellsCovered()
499     return S2Cell.averageArea(S2CellId.MAX_LEVEL) * leafCellsCovered();  in averageBasedArea()
510     for (S2CellId cellId : cellIds) {  in approxArea()
524     for (S2CellId cellId : cellIds) {  in exactArea()
543     for (S2CellId id : this) {  in hashCode()
565     ArrayList<S2CellId> output = new ArrayList<S2CellId>(cellIds.size());  in normalize()
569     for (S2CellId id : this) {  in normalize()