/*
 * 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.tinkerpop.gremlin.process.traversal.step.map;

import org.apache.tinkerpop.gremlin.process.traversal.Traversal;
import org.apache.tinkerpop.gremlin.process.traversal.Traverser;
import org.apache.tinkerpop.gremlin.process.traversal.traverser.TraverserRequirement;

import java.util.Collections;
import java.util.Set;

/**
 * Reference implementation for substring step, a mid-traversal step which returns a substring of the incoming string
 * traverser with a 0-based start index (inclusive) and optionally an end index (exclusive). If the start index is negative then it will
 * begin at the specified index counted from the end of the string, or 0 if exceeding the string length. Likewise, if
 * the end index is negative then it will end at the specified index counted from the end of the string, or 0 if exceeding the string length.
 * End index is optional, if it is not specified or if it exceeds the length of the string then all remaining characters will
 * be returned. End index <= start index will return the empty string. Null values are not processed and remain as null when returned.
 * If the incoming traverser is a non-String value then an {@code IllegalArgumentException} will be thrown.
 *
 * @author David Bechberger (http://bechberger.com)
 * @author Yang Xia (http://github.com/xiazcy)
 */
public final class SubstringGlobalStep<S, E> extends ScalarMapStep<S, E> {

    private final Integer start;
    private final Integer end;

    public SubstringGlobalStep(final Traversal.Admin traversal, final Integer startIndex, final Integer endIndex) {
        super(traversal);
        this.start = startIndex;
        this.end = endIndex;
    }

    public SubstringGlobalStep(final Traversal.Admin traversal, final Integer startIndex) {
        this(traversal, startIndex, null);
    }

    public Integer getStart() {
        return this.start;
    }

    public Integer getEnd() {
        return this.end;
    }

    @Override
    protected E map(final Traverser.Admin<S> traverser) {
        final S item = traverser.get();
        // throws when incoming traverser isn't a string
        if (null != item && !(item instanceof String)) {
            throw new IllegalArgumentException(
                    String.format("The substring() step can only take string as argument, encountered %s", item.getClass()));
        }

        // to preserve null items
        final String strItem = (String) item;

        if (null == strItem)
            return null;

        final int newStart = processStringIndex(strItem.length(), this.start);
        if (null == this.end)
            return (E) strItem.substring(newStart);

        final int newEnd = processStringIndex(strItem.length(), this.end);
        if (newEnd <= newStart)
            return (E) "";

        return (E) strItem.substring(newStart, newEnd);
    }

    @Override
    public Set<TraverserRequirement> getRequirements() {
        return Collections.singleton(TraverserRequirement.OBJECT);
    }

    @Override
    public int hashCode() {
        int result = super.hashCode();
        result = 31 * result + this.start.hashCode();
        result = 31 * result + (null != this.end ? this.end.hashCode() : 0);
        return result;
    }

    // Helper function to process indices. If it is negative (which counts from end of string) it is converted
    // to the positive index position or 0 when negative index exceeds the string length. If it is positive and exceeds
    // the length of the string, it is assumed to equal to the length, which means an empty string will be returned.
    private int processStringIndex(int strLen, int index) {
        if (index < 0) {
            return Math.max(0, (strLen + index) % strLen);
        } else {
            return Math.min(index, strLen);
        }
    }
}
