Class IntersectionCPQ

All Implemented Interfaces:
CPQ, OutputSQL, OutputXML

public class IntersectionCPQ extends Object implements CPQ
CPQ modelling the intersection between CPQs (also known as the conjunction operation).
  • Field Details

    • cpq

      private List<CPQ> cpq
      The CPQs of the intersection.
  • Constructor Details

    • IntersectionCPQ

      public IntersectionCPQ(List<CPQ> cpq)
      Constructs a new intersection CPQ with the given CPQs to intersect.
      cpq - The CPQs to intersect.
      IllegalArgumentException - When less than two CPQs are provided.
  • Method Details

    • toString

      public String toString()
      toString in class Object
    • toSQL

      public String toSQL()
      Description copied from interface: OutputSQL
      Converts this object to an SQL query.
      Specified by:
      toSQL in interface OutputSQL
      An SQL query representing this object.
    • writeXML

      public void writeXML(IndentWriter writer)
      Description copied from interface: OutputXML
      Writes this object as XML to the given writer.
      Specified by:
      writeXML in interface OutputXML
      writer - The writer to write to.
    • toQueryGraph

      public QueryGraphCPQ toQueryGraph(QueryGraphCPQ.Vertex source, QueryGraphCPQ.Vertex target)
      Description copied from interface: CPQ
      Computes and returns the query graph for this CPQ using the given source and target vertices for the computation. Usually using CPQ.toQueryGraph() instead should be sufficient for most use cases, using this version instead can lead to unexpected results.
      Specified by:
      toQueryGraph in interface CPQ
      source - The source vertex to use.
      target - The target vertex to use.
      The query graph for this CPQ.
      See Also:
    • getDiameter

      public int getDiameter()
      Description copied from interface: CPQ
      Returns the diameter of this CPQ. The diameter of a CPQ is the largest number of labels to which the join operation is applied. A simpler way to think of this concept is the length of the largest path through the CPQ from source to target.
      Specified by:
      getDiameter in interface CPQ
      The diameter of this CPQ.
    • isLoop

      public boolean isLoop()
      Description copied from interface: CPQ
      Tests if this CPQ is a loop, meaning its source and target are the same. When visualised as a query graph this means that the source and target node are the same node. In its grammar form this means that there is an intersection with identity at the highest level in the CPQ.
      Specified by:
      isLoop in interface CPQ
      True if this CPQ is a loop.
      See Also: