How to use

newLinkedHashSet

method

in

org.apache.drill.shaded.guava.com.google.common.collect.Sets

@Override
protected Collection<SchemaPath> transformColumns(Collection<SchemaPath> projectedColumns) {
 Set<SchemaPath> transformed = Sets.newLinkedHashSet();
 if (!isStarQuery()) {
  for (SchemaPath column : projectedColumns) {
   transformed.add(column);
  }
 } else {
  transformed.add(SchemaPath.STAR_COLUMN);
 }
 return transformed;
}

/**
 * Returns a sequence of field names in the order that they show up in the schema.
 */
protected Collection<String> getChildFieldNames() {
 return Sets.newLinkedHashSet(Iterables.transform(field.getChildren(), new Function<MaterializedField, String>() {
  @Nullable
  @Override
  public String apply(MaterializedField field) {
   return Preconditions.checkNotNull(field).getName();
  }
 }));
}

Set<Entry<TabletFragmentInfo, String>> regionsToAssignSet = Sets.newLinkedHashSet(regionsToScan.entrySet());

public MapRDBFunctionalIndexInfo(IndexDescriptor indexDesc) {
 this.indexDesc = indexDesc;
 columnToConvert = Maps.newHashMap();
 exprToConvert = Maps.newHashMap();
 pathsInExpr = Maps.newHashMap();
 // keep the order of new paths, it may be related to the naming policy
 newPathsForIndexedFunction = Sets.newLinkedHashSet();
 allPathsInFunction = Sets.newHashSet();
 init();
}

@Override
protected Collection<SchemaPath> transformColumns(Collection<SchemaPath> columns) {
 Set<SchemaPath> transformed = Sets.newLinkedHashSet();
 Set<SchemaPath> encodedSchemaPathSet = Sets.newLinkedHashSet();

Set<SchemaPath> transformed = Sets.newLinkedHashSet();
completeFamilies = Sets.newHashSet();

/**
 * Returns a sequence of field names in the order that they show up in the schema.
 */
protected Collection<String> getChildFieldNames() {
 return Sets.newLinkedHashSet(Iterables.transform(field.getChildren(), new Function<MaterializedField, String>() {
  @Nullable
  @Override
  public String apply(MaterializedField field) {
   return Preconditions.checkNotNull(field).getName();
  }
 }));
}

/**
 * Get a single IndexConditionInfo in which indexCondition has field  on all indexes in this.indexes
 * @return
 */
public IndexConditionInfo getCollectiveInfo(IndexLogicalPlanCallContext indexContext) {
 Set<LogicalExpression> paths = Sets.newLinkedHashSet();
 for (IndexDescriptor index : indexes ) {
  paths.addAll(index.getIndexColumns());
  //paths.addAll(index.getNonIndexColumns());
 }
 return indexConditionRelatedToFields(Lists.newArrayList(paths), condition);
}

/**
 * Creates a <i>mutable</i> {@code LinkedHashSet} instance containing the given elements in order.
 *
 * <p><b>Note:</b> if mutability is not required and the elements are non-null, use {@link
 * ImmutableSet#copyOf(Iterable)} instead.
 *
 * <p><b>Note for Java 7 and later:</b> if {@code elements} is a {@link Collection}, you don't
 * need this method. Instead, use the {@code LinkedHashSet} constructor directly, taking advantage
 * of the new <a href="http://goo.gl/iz2Wi">"diamond" syntax</a>.
 *
 * <p>Overall, this method is not very useful and will likely be deprecated in the future.
 *
 * @param elements the elements that the set should contain, in order
 * @return a new {@code LinkedHashSet} containing those elements (minus duplicates)
 */
public static <E> LinkedHashSet<E> newLinkedHashSet(Iterable<? extends E> elements) {
 if (elements instanceof Collection) {
  return new LinkedHashSet<E>(Collections2.cast(elements));
 }
 LinkedHashSet<E> set = newLinkedHashSet();
 Iterables.addAll(set, elements);
 return set;
}

public static VectorContainer getTransferClone(VectorAccessible incoming, VectorWrapper<?>[] ignoreWrappers, OperatorContext oContext) {
 Iterable<VectorWrapper<?>> wrappers = incoming;
 if (ignoreWrappers != null) {
  final List<VectorWrapper<?>> ignored = Lists.newArrayList(ignoreWrappers);
  final Set<VectorWrapper<?>> resultant = Sets.newLinkedHashSet(incoming);
  resultant.removeAll(ignored);
  wrappers = resultant;
 }
 final VectorContainer vc = new VectorContainer(oContext);
 for (VectorWrapper<?> w : wrappers) {
  vc.cloneAndTransfer(w);
 }
 return vc;
}

Set<Entry<TabletFragmentInfo, String>> regionsToAssignSet = Sets.newLinkedHashSet(regionsToScan.entrySet());

Set<K> keysToLoad = Sets.newLinkedHashSet();
for (K key : keys) {
 V value = get(key);

public MapRDBFunctionalIndexInfo(IndexDescriptor indexDesc) {
 this.indexDesc = indexDesc;
 columnToConvert = Maps.newHashMap();
 exprToConvert = Maps.newHashMap();
 pathsInExpr = Maps.newHashMap();
 // keep the order of new paths, it may be related to the naming policy
 newPathsForIndexedFunction = Sets.newLinkedHashSet();
 allPathsInFunction = Sets.newHashSet();
 init();
}

@Override
protected Collection<SchemaPath> transformColumns(Collection<SchemaPath> columns) {
 Set<SchemaPath> transformed = Sets.newLinkedHashSet();
 Set<SchemaPath> encodedSchemaPathSet = Sets.newLinkedHashSet();

Set<RelDataTypeField> rowfields = Sets.newLinkedHashSet();
final List<SchemaPath> columns = Lists.newArrayList();
for (RelDataTypeField f : fields) {

Set<SchemaPath> transformed = Sets.newLinkedHashSet();
completeFamilies = Sets.newHashSet();

Set<SchemaPath> selectedSchemaPaths = Sets.newLinkedHashSet();