Examples of BidirectionalEntityReference

org.hibernate.loader.plan.spi.BidirectionalEntityReference

Represents the circular side of a bi-directional entity association. Wraps a reference to the associated (target) EntityReference.

The {@link org.hibernate.loader.plan.exec.spi.EntityReferenceAliases} for this object is the same asfor its target EntityReference, and can be looked up via {@link org.hibernate.loader.plan.exec.spi.AliasResolutionContext#resolveEntityReferenceAliases(String)}using the value returned by {@link #getQuerySpaceUid()}. This relies on reference lookups against the EntityReference instances, therefore this allows representation of the circularity but with a little protection against potential stack overflows. This is unfortunately still a cyclic graph. An alternative approach is to make the graph acyclic (DAG) would be to follow the process I adopted in the original HQL Antlr v3 work with regard to always applying an alias to the "persister reference", even where that meant creating a generated, unique identifier as the alias. That allows other parts of the tree to refer to the "persister reference" by that alias without the need for potentially cyclic graphs (think ALIAS_REF in the current ORM parser). Those aliases can then be mapped/catalogued against the "persister reference" for retrieval as needed. @author Steve Ebersole

org.hibernate.loader.plan2.spi.BidirectionalEntityReference

Represents the circular side of a bi-directional entity fetch. Wraps a reference to an EntityReference as an EntityFetch. We can use the special type as a trigger in AliasResolutionContext, etc to lookup information based on the wrapped reference.

This relies on reference lookups against the EntityReference instances, therefore this allows representation of the circularity but with a little protection against potential stack overflows. This is unfortunately still a cyclic graph. An alternative approach is to make the graph acyclic (DAG) would be to follow the process I adopted in the original HQL Antlr v3 work with regard to always applying an alias to the "persister reference", even where that meant creating a generated, unique identifier as the alias. That allows other parts of the tree to refer to the "persister reference" by that alias without the need for potentially cyclic graphs (think ALIAS_REF in the current ORM parser). Those aliases can then be mapped/catalogued against the "persister reference" for retrieval as needed. @author Steve Ebersole

              attributeDefinition.getName()
          )
      );
    }


    final BidirectionalEntityReference bidirectionalEntityReference =
        new BidirectionalEntityReferenceImpl( this, attributeDefinition, targetEntityReference );
    addBidirectionalEntityReference( bidirectionalEntityReference );
    return bidirectionalEntityReference;
  }

              attributeDefinition.getName()
          )
      );
    }


    final BidirectionalEntityReference bidirectionalEntityReference =
        new BidirectionalEntityReferenceImpl( this, attributeDefinition, targetEntityReference );
    addBidirectionalEntityReference( bidirectionalEntityReference );
    return bidirectionalEntityReference;
  }

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.

Examples of BidirectionalEntityReference

Examples of org.hibernate.loader.plan.spi.BidirectionalEntityReference

Examples of org.hibernate.loader.plan2.spi.BidirectionalEntityReference