Java String Array Merge merge(String[] mainSelector, String[] base)

Description

merge

License

Open Source License

Declaration

static String[] merge(String[] mainSelector, String[] base) 

Method Source Code

//package com.java2s;
/**// ww w .  jav a  2  s.co  m
 * MIT License (MIT)
 *
 * Copyright (c) 2014 Volker Berlin
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 * 
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * UT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 *
 * @author Volker Berlin
 * @license: The MIT license <http://opensource.org/licenses/MIT>
 */

public class Main {
    static String[] merge(String[] mainSelector, String[] base) {
        int count = 0;

        // is there an & operator in the selector?
        for (String s : base) {
            int andCount = 0;
            int idx = -1;
            while ((idx = s.indexOf('&', idx + 1)) >= 0) {
                andCount++;
            }
            count += mainSelector.length * Math.max(1, andCount);
        }
        String[] sel = new String[count];
        for (int j = 0, t = 0; j < base.length; j++) {
            String selector = base[j];
            int idx = selector.lastIndexOf('&');
            if (idx < 0) {
                for (int m = 0; m < mainSelector.length; m++) {
                    sel[t++] = mainSelector[m] + ' ' + selector;
                }
            } else {
                int off = t;
                int andCount;
                do {
                    int a = (t - off);
                    int idx2 = idx;
                    selector = base[j];
                    andCount = 0;
                    do {
                        int x = a % mainSelector.length;
                        selector = selector.substring(0, idx2) + mainSelector[x] + selector.substring(idx2 + 1);
                        a /= mainSelector.length;
                        andCount++;
                    } while ((idx2 = selector.lastIndexOf('&', idx2 - 1)) >= 0);
                    sel[t++] = selector;
                } while ((t - off) < (mainSelector.length * andCount));
            }
        }
        return sel;
    }
}

Related

1. merge(String[] arr)
2. merge(String[] pieces, String sep)
3. merge(String[] src, String delimiter)
4. merge(String[] str, String sep)
5. merge(T[] arr0, String delimiter)