org.jamplate.impl.parser

Class MergeFlatByOrderParser

java.lang.Object

org.jamplate.impl.parser.MergeByOrderParser

org.jamplate.impl.parser.MergeFlatByOrderParser

All Implemented Interfaces:

Parser

public class MergeFlatByOrderParser
extends MergeByOrderParser

A merging parser that does not allow two trees having any dominance between each other. The first dominant tree always wins.

Since:

0.2.0 ~2021.05.19

Version:

0.2.0

Author:

LSafer

Field Summary

Fields inherited from class org.jamplate.impl.parser.MergeByOrderParser

parser

Constructor Summary

Constructors

Constructor and Description
MergeFlatByOrderParser(@NotNull Parser parser) Construct a new parser that filters the results to have no dominance between etcher.

Method Summary

Modifier and Type	Method and Description
protected boolean	check(@NotNull Tree previous, @NotNull Tree next) Check if the down-structure of the given next can be alongside with the given previous in its structure.

Methods inherited from class org.jamplate.impl.parser.MergeByOrderParser

parse

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

MergeFlatByOrderParser

public MergeFlatByOrderParser(@NotNull
                              @NotNull Parser parser)

Construct a new parser that filters the results to have no dominance between etcher.

Parameters:

parser - the parser to be wrapped by the constructed parser.

Throws:

java.lang.NullPointerException - if the given parser is null.

Since:

0.2.0 ~2021.05.20

Method Detail

check

protected boolean check(@NotNull
                        @NotNull Tree previous,
                        @NotNull
                        @NotNull Tree next)

Description copied from class: MergeByOrderParser

Check if the down-structure of the given next can be alongside with the given previous in its structure.

Overrides:

check in class MergeByOrderParser

Parameters:

previous - the previous tree that is always wins.

next - the slave tree that might win or might lose depending on if it clashes with the previous or not.

Returns:

true, if the given next can be with the given previous.