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

net.minidev.json.actions.traverse.TreeTraverseAction Maven / Gradle / Ivy

Go to download

JSON (JavaScript Object Notation) is a lightweight data-interchange format. It is easy for humans to read and write. It is easy for machines to parse and generate. It is based on a subset of the JavaScript Programming Language, Standard ECMA-262 3rd Edition - December 1999. JSON is a text format that is completely language independent but uses conventions that are familiar to programmers of the C-family of languages, including C, C++, C#, Java, JavaScript, Perl, Python, and many others. These properties make JSON an ideal data-interchange language.

There is a newer version: 2.5.1
Show newest version
package net.minidev.json.actions.traverse;

import java.util.List;
import java.util.Map;
import java.util.Map.Entry;

/**
 * An interface for a processing action on the nodes of a {@link M} tree
 * while traversing it. The order in which the callbacks are listed
 * below is the order in which they are called by the {@link TreeTraverser}
 * 

 * See package-info for more details
 *
 * @author [email protected]
 */
public interface TreeTraverseAction, L extends List> {
	/**
	 * called before any traversal of the {@link M} tree starts
	 * @param object TODO
	 * @return true if traversal should start at all
	 */
	boolean start(M object);

	/**
	 * called when a new entry is encountered and before any processing is performed on it
	 * @param fullPathToEntry TODO
	 * @param entry TODO
	 * @return true if the entry should be processed
	 */
	boolean traverseEntry(String fullPathToEntry, Entry entry);

	/**
	 * the last callback for each entry in an {@link M} map. if this method returns true
	 * the {@link TreeTraverser} removes the entry from the map. there is no further
	 * handling of the entry.
	 * 
	 * @param fullPathToEntry TODO
	 * @param entry TODO
	 * @return true if the entry and its subtree should be removed from the M tree
	 */
	boolean removeEntry(String fullPathToEntry, Entry entry);

	/**
	 * called when a non-leaf entry is encountered inside an M object
	 * 
	 * @param fullPathToSubtree TODO
	 * @param entryValue TODO
	 * @return true if the non-leaf entry should be recursively traversed
	 */
	boolean recurInto(String fullPathToSubtree, M entryValue);

	/**
	 * called when a non-leaf item is encountered inside an L object
	 * @param fullPathToContainingList TODO
	 * @param entryValue TODO
	 * @return true if the non-leaf item should be recursively traversed
	 */
	boolean recurInto(String fullPathToContainingList, L entryValue);

	/**
	 * called for each leaf of an M map is encountered
	 * @param fullPathToEntry TODO
	 * @param entry TODO
	 */
	void handleLeaf(String fullPathToEntry, Entry entry);

	/**
	 * called for each leaf of an L list is encountered
	 * @param fullPathToContainingList - the item
	 * @param listIndex - the ordered location of the item in the list
	 * @param listItem -
	 */
	void handleLeaf(String fullPathToContainingList, int listIndex, Object listItem);

	/**
	 * called after the traversal ends,
	 * and just before the {@link #start} method exits
	 */
	void end();

	/**
	 * holds the result of the traversal,
	 * as assigned by the action implementing this interface
	 * @return result
	 */
	Object result();
}
    

    

    

            

    

            



    
    






    
© 2015 - 2024 Weber Informatics LLC | Privacy Policy