public DataFixer build(final Executor executor) { final DataFixerUpper fixerUpper = new DataFixerUpper(new Int2ObjectAVLTreeMap<>(schemas), new ArrayList<>(globalList), new IntAVLTreeSet(fixerVersions)); final IntBidirectionalIterator iterator = fixerUpper.fixerVersions().iterator(); while (iterator.hasNext()) { final int versionKey = iterator.nextInt(); final Schema schema = schemas.get(versionKey); for (final String typeName : schema.types()) { CompletableFuture.runAsync(() -> { final Type<?> dataType = schema.getType(() -> typeName); final TypeRewriteRule rule = fixerUpper.getRule(DataFixUtils.getVersion(versionKey), dataVersion); dataType.rewrite(rule, DataFixerUpper.OPTIMIZATION_RULE); }, executor).exceptionally(e -> { LOGGER.error("Unable to build datafixers", e); Runtime.getRuntime().exit(1); return null; }); } } return fixerUpper; } }
@Override public IntBidirectionalIterator iterator() { return sortedSet.iterator(); } @Override
@Override public IntBidirectionalIterator iterator(final int from) { return sortedSet.iterator(from); } @Override
@Override public IntBidirectionalIterator iterator(final int from) { return IntIterators.unmodifiable(sortedSet.iterator(from)); } @Override
@Override public IntBidirectionalIterator iterator() { return IntIterators.unmodifiable(sortedSet.iterator()); } @Override
for (IntIterator setIterator = comprisedRow.getValue().iterator(); setIterator.hasNext(); /* NOP */) { int rowNum = setIterator.nextInt(); while (conversionBuffer.position() < rowNum) {
/** * Indicates that the bins have been finalised and no more changes will occur */ public void finaliseBins() { // precompute bin widths binWidth = new Int2IntLinkedOpenHashMap(bins.size()); IntBidirectionalIterator it = bins.keySet().iterator(); int lastStart = it.nextInt(); while (it.hasNext()) { int start = it.nextInt(); binWidth.put(lastStart, start - lastStart); lastStart = start; } binWidth.put(lastStart, lastBinEnd - lastStart + 1); } /**
Int2ObjectMap.Entry<IntSortedSet> entry = entryIterator.next(); for (IntIterator setIterator = entry.getValue().iterator(); setIterator.hasNext(); /* NOP */) { int rowNum = setIterator.nextInt(); retVal.addRow(entry.getIntKey(), rowNum);
/** Checks whether this interval is equal to another set of integers. * * @param o an object. * @return true if <code>o</code> is an ordered set of integer containing * the same element of this interval in the same order, or if <code>o</code> * is a set of integers containing the same elements of this interval. */ public boolean equals( final Object o ) { if ( o instanceof Interval ) return ((Interval)o).left == left && ((Interval)o).right == right; else if ( o instanceof IntSortedSet ) { // For sorted sets, we require the same order IntSortedSet s = (IntSortedSet) o; if ( s.size() != length() ) return false; int n = length(); IntIterator i = iterator(), j = s.iterator(); while( n-- != 0 ) if ( i.nextInt() != j.nextInt() ) return false; return true; } else if ( o instanceof IntSet ) { // For sets, we just require the same elements IntSet s = (IntSet) o; if ( s.size() != length() ) return false; int n = length(); IntIterator i = iterator(); while( n-- != 0 ) if ( ! s.contains( i.nextInt() ) ) return false; return true; } else return false; } }
/** Checks whether this interval is equal to another set of integers. * * @param o an object. * @return true if <code>o</code> is an ordered set of integer containing * the same element of this interval in the same order, or if <code>o</code> * is a set of integers containing the same elements of this interval. */ public boolean equals( final Object o ) { if ( o instanceof Interval ) return ((Interval)o).left == left && ((Interval)o).right == right; else if ( o instanceof IntSortedSet ) { // For sorted sets, we require the same order IntSortedSet s = (IntSortedSet) o; if ( s.size() != length() ) return false; int n = length(); IntIterator i = iterator(), j = s.iterator(); while( n-- != 0 ) if ( i.nextInt() != j.nextInt() ) return false; return true; } else if ( o instanceof IntSet ) { // For sets, we just require the same elements IntSet s = (IntSet) o; if ( s.size() != length() ) return false; int n = length(); IntIterator i = iterator(); while( n-- != 0 ) if ( ! s.contains( i.nextInt() ) ) return false; return true; } else return false; } }
if (s.size() != length()) return false; int n = length(); IntIterator i = iterator(), j = s.iterator(); while(n-- != 0) if (i.nextInt() != j.nextInt()) return false; return true;