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

com.itextpdf.forms.xfa.InverseStore Maven / Gradle / Ivy

Go to download

There is a newer version: 8.0.5
Show newest version
/*
    This file is part of the iText (R) project.
    Copyright (c) 1998-2024 Apryse Group NV
    Authors: Apryse Software.

    This program is offered under a commercial and under the AGPL license.
    For commercial licensing, contact us at https://itextpdf.com/sales.  For AGPL licensing, see below.

    AGPL licensing:
    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU Affero 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 Affero General Public License for more details.

    You should have received a copy of the GNU Affero General Public License
    along with this program.  If not, see .
 */
package com.itextpdf.forms.xfa;

import java.util.ArrayList;
import java.util.List;

/**
 * A structure to store each part of a SOM name and link it to the next part
 * beginning from the lower hierarchy.
 */
class InverseStore {
    protected List part = new ArrayList<>();
    protected List follow = new ArrayList<>();

    /**
     * Gets the full name by traversing the hierarchy using only the
     * index 0.
     *
     * @return the full name
     */
    public String getDefaultName() {
        InverseStore store = this;
        while (true) {
            Object obj = store.follow.get(0);
            if (obj instanceof String)
                return (String) obj;
            store = (InverseStore) obj;
        }
    }

    /**
     * Search the current node for a similar name. A similar name starts
     * with the same name but has a different index. For example, "detail[3]"
     * is similar to "detail[9]". The main use is to discard names that
     * correspond to out of bounds records.
     *
     * @param name the name to search
     * @return true if a similitude was found
     */
    public boolean isSimilar(String name) {
        int idx = name.indexOf('[');
        name = name.substring(0, idx + 1);
        for (int k = 0; k < part.size(); ++k) {
            if (part.get(k).startsWith(name))
                return true;
        }
        return false;
    }
}
    

    

    

            

    

            



    
    






    
© 2015 - 2024 Weber Informatics LLC | Privacy Policy