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

net.minidev.json.actions.navigate.CopyPathsAction 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.navigate;

import net.minidev.json.JSONArray;
import net.minidev.json.JSONObject;
import net.minidev.json.actions.path.TreePath;

import java.util.Collection;
import java.util.Stack;

/**
 * Creates a copy of a {@link JSONObject} containing just the nodes on the paths specified.
 * 

 * Specified paths that do not exist in the source object are ignored silently.
 * Specifying an empty list of paths to navigate or only non-existent paths will result in an empty
 * object being returned.
 * 

 * See package-info for more details
 * 

 * Example:
 * 

 * To copy the branch k1.k2 from {k1:{k2:v1}, k3:{k4:v2}} instantiate the copier like so:
 * new JSONObjectCopier("k1.k2")
 * The resulting copy would be {k1:{k2:v1}}
 * 

 * See unit tests for more examples
 *
 * @author [email protected]
 * @since 15 March 2016.
 *
 */
public class CopyPathsAction implements JSONNavigateAction {
	protected JSONObject destTree;
	protected JSONObject destBranch;
	protected Stack destNodeStack;

	@Override
	public boolean start(JSONObject source, Collection pathsToCopy) {
		if (source == null) {
			destTree = null;
			return false;
		}
		destTree = new JSONObject();
		if (pathsToCopy == null || pathsToCopy.size() == 0) {
			return false;
		}
		return true;
	}

	@Override
	public boolean recurInto(TreePath jp, JSONObject o) {
		//reached JSONObject node - instantiate it and recur
		handleNewNode(jp, new JSONObject());
		return true;
	}

	private void handleNewNode(TreePath jp, Object node) {
		if (!jp.hasPrev()) {
			return;
		}
		if (destNodeStack.peek() instanceof JSONObject) {
			((JSONObject) destNodeStack.peek()).put(jp.curr(), node);
		} else if (destNodeStack.peek() instanceof JSONArray) {
			((JSONArray) destNodeStack.peek()).add(node);
		}
		destNodeStack.push(node);
	}

	@Override
	public boolean recurInto(TreePath jp, JSONArray o) {
		//reached JSONArray node - instantiate it and recur
		handleNewNode(jp, new JSONArray());
		return true;
	}

	@Override
	public void foundLeafBeforePathEnd(TreePath jp, Object obj) {
		throw new IllegalArgumentException("branch is shorter than path - path not found in source: '" + jp.origin() + "'");
	}

	@Override
	public void pathTailNotFound(TreePath jp, Object source) {
		throw new IllegalArgumentException("cannot find next element of path - path not found in source: '" + jp.origin() + "'");
	}

	@Override
	public void handleLeaf(TreePath jp, Object o) {
		((JSONObject) destNodeStack.peek()).put(jp.curr(), o);
	}

	@Override
	public void handleLeaf(TreePath jp, int arrIndex, Object o) {
		((JSONArray) destNodeStack.peek()).add(o);
	}

	@Override
	public void recurEnd(TreePath jp, JSONObject jo) {
		destNodeStack.pop();
	}

	@Override
	public void recurEnd(TreePath jp, JSONArray ja) {
		destNodeStack.pop();
	}

	@Override
	public boolean pathStart(String path) {
		destBranch = new JSONObject();
		destNodeStack = new Stack();
		destNodeStack.push(destBranch);
		return true;
	}

	@Override
	public void pathEnd(String path) {
		destTree.merge(destBranch);
	}

	@Override
	public boolean failSilently(String path, Exception e) {
		return false;
	}

	@Override
	public boolean failFast(String path, Exception e) {
		return false;
	}

	@Override
	public void end() {

	}

	@Override
	public Object result() {
		return destTree;
	}
}
    

    

    

            

    

            



    
    






    
© 2015 - 2024 Weber Informatics LLC | Privacy Policy