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

org.neo4j.configuration.helpers.ConfigPatternBuilder Maven / Gradle / Ivy

There is a newer version: 5.26.0
Show newest version
/*
 * Copyright (c) "Neo4j"
 * Neo4j Sweden AB [http://neo4j.com]
 *
 * This file is part of Neo4j.
 *
 * Neo4j is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see .
 */
package org.neo4j.configuration.helpers;

import org.apache.commons.lang3.StringUtils;

import java.util.Map;
import java.util.Optional;
import java.util.regex.Pattern;
import java.util.stream.Collectors;

public class ConfigPatternBuilder
{
    // Map supported wildcards to their java regex definition.
    // N.b. we do not currently offer a way to escape wildcard characters (i.e. match on literal '?' or '*')
    private static final Map supportedWildcards = Map.of(
            '?', ".{0,1}",
            '*', ".+"
    );

    private static final String wildcardCharacters = supportedWildcards.keySet()
                                                                       .stream()
                                                                       .map( Object::toString )
                                                                       .collect( Collectors.joining( "" ) );

    /**
     * Converts a user-supplied string containing supported wildcards into a Java Regular Expression Pattern that can be used to test if strings match the
     * user-supplied string. Any input characters that are not supported wildcards will be escaped if necessary.
     * 

* If the user-supplied string does not contains wildcards then an empty optional is returned. * * @param pattern user-supplied string that may contain wildcards * @param patternFlags a java.util.regex.Pattern bitmask to coinfigure pattern behaviour * @return an optional containing a Pattern if the user-supplied string contains wildcards. */ public static Optional optionalPatternFromConfigString( String pattern, int patternFlags ) { if ( !StringUtils.containsAny( pattern, wildcardCharacters ) ) { return Optional.empty(); } return Optional.of( patternFromConfigString( pattern, patternFlags ) ); } /** * Converts a user-supplied string containing supported wildcards into a Java Regular Expression Pattern that can be used to test if strings match the * user-supplied string. Any input characters that are not supported wildcards will be escaped if necessary. * * @param pattern user-supplied string that may contain wildcards * @param patternFlags a java.util.regex.Pattern bitmask to coinfigure pattern behaviour * @return a Pattern */ public static Pattern patternFromConfigString( String pattern, int patternFlags ) { return buildRegexPattern( pattern, patternFlags ); } private static Pattern buildRegexPattern( String name, int patternFlags ) { final var pattern = new StringBuilder(); StringBuilder buffer = new StringBuilder(); for ( int i = 0; i < name.length(); i++ ) { final var ch = name.charAt( i ); if ( supportedWildcards.containsKey( ch ) ) { flushBuffer( buffer, pattern ); pattern.append( supportedWildcards.get( ch ) ); } else { buffer.append( ch ); } } flushBuffer( buffer, pattern ); return Pattern.compile( pattern.toString(), patternFlags ); } private static void flushBuffer( StringBuilder fromBuffer, StringBuilder toPattern ) { if ( fromBuffer.length() > 0 ) { toPattern.append( Pattern.quote( fromBuffer.toString() ) ); fromBuffer.delete( 0, Integer.MAX_VALUE ); } } }





© 2015 - 2025 Weber Informatics LLC | Privacy Policy