All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.apache.parquet.glob.GlobExpander Maven / Gradle / Ivy

There is a newer version: 1.15.0
Show newest version
/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you 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.
 */
package org.apache.parquet.glob;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import org.apache.parquet.glob.GlobNode.Atom;
import org.apache.parquet.glob.GlobNode.GlobNodeSequence;
import org.apache.parquet.glob.GlobNode.OneOf;

/**
 * Implementation of {@link org.apache.parquet.Strings#expandGlob(String)}
 */
public final class GlobExpander {
  private GlobExpander() {}

  /**
   * Expands a string with braces ("{}") into all of its possible permutations.
   * We call anything inside of {} braces a "one-of" group.
   * 

* The only special characters in this glob syntax are '}', '{' and ',' *

* The top-level pattern must not contain any commas, but a "one-of" group separates * its elements with commas, and a one-of group may contain sub one-of groups. *

* For example: * start{a,b,c}end -> startaend, startbend, startcend * start{a,{b,c},d} -> startaend, startbend, startcend, startdend * {a,b,c} -> a, b, c * start{a, b{x,y}} -> starta, startbx, startby * * @param globPattern a string in the format described above * @return a list of all the strings that would satisfy globPattern, including duplicates */ public static List expand(String globPattern) { return GlobExpanderImpl.expand(GlobParser.parse(globPattern)); } /** * Transforms a tree of {@link GlobNode} into a list of all the strings that satisfy * this tree. */ private static final class GlobExpanderImpl implements GlobNode.Visitor> { private static final GlobExpanderImpl INSTANCE = new GlobExpanderImpl(); private GlobExpanderImpl() {} public static List expand(GlobNode node) { return node.accept(INSTANCE); } @Override public List visit(Atom atom) { // atoms are the base case, just return a singleton list return Collections.singletonList(atom.get()); } @Override public List visit(OneOf oneOf) { // in the case of OneOf, we just need to take all of // the possible values the OneOf represents and // union them together List results = new ArrayList(); for (GlobNode n : oneOf.getChildren()) { results.addAll(n.accept(this)); } return results; } @Override public List visit(GlobNodeSequence seq) { // in the case of a sequence, for each child // we need to expand the child into all of its // possibilities, then do a cross product of // all the children, in order. List results = new ArrayList(); for (GlobNode n : seq.getChildren()) { results = crossOrTakeNonEmpty(results, n.accept(this)); } return results; } /** * Computes the cross product of two lists by adding each string in list1 to each string in list2. * If one of the lists is empty, a copy of the other list is returned. * If both are empty, an empty list is returned. */ public static List crossOrTakeNonEmpty(List list1, List list2) { if (list1.isEmpty()) { ArrayList result = new ArrayList(list2.size()); result.addAll(list2); return result; } if (list2.isEmpty()) { ArrayList result = new ArrayList(list1.size()); result.addAll(list1); return result; } List result = new ArrayList(list1.size() * list2.size()); for (String s1 : list1) { for (String s2 : list2) { result.add(s1 + s2); } } return result; } } }





© 2015 - 2025 Weber Informatics LLC | Privacy Policy