org.dellroad.hl7.HL7Util Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of hl7lib Show documentation
Lightweight Java library for HL7 messages
The newest version!

/*
 * Copyright (C) 2008 Archie L. Cobbs. All rights reserved.
 */

package org.dellroad.hl7;

/**
 * Utility methods.
 */
public final class HL7Util {

    private HL7Util() {
    }

    /**
     * Convenience method. Equivalent to:
     *  
     *  find(value, sep, 0, value.length())
     *  
     *
     * @param value string to search
     * @param sep separator character to search for
     * @return separator occurrences
     */
    public static int[] find(String value, char sep) {
        return find(value, sep, 0, value.length());
    }

    /**
     * Convenience method. Equivalent to:
     *  
     *  find(value, sep, start, value.length())
     *  
     *
     * @param value string to search
     * @param sep separator character to search for
     * @param start starting offset in {@code value}
     * @return separator occurrences
     */
    public static int[] find(String value, char sep, int start) {
        return find(value, sep, start, value.length());
    }

    /**
     * Find all occurrences of the separator character in the sub-string.
     *
     * @param value entire string
     * @param sep separator character to search for
     * @param start starting index of sub-string to search (inclusive)
     * @param end ending index of sub-string to search (exclusive)
     * @return indexes of all occurrences of sep, in order, plus one extra index equal to end
     * @throws StringIndexOutOfBoundsException if start is less than zero or end is
     *  greater than the length of value
     */
    public static int[] find(String value, char sep, int start, int end) {

        // Count occurrences
        int count = 0;
        for (int i = start; i < end; i++) {
            if (value.charAt(i) == sep)
                count++;
        }

        // Allocate array and record them
        int[] positions = new int[count + 1];
        if (count > 0) {
            int j = 0;
            for (int i = start; i < end; i++) {
                if (value.charAt(i) == sep) {
                    positions[j++] = i;
                    if (j == count)
                        break;
                }
            }
        }

        // Done
        positions[count] = end;
        return positions;
    }
}