List of depth() Examples

Examples of depth()

com.arjuna.ats.arjuna.coordinator.ActionHierarchy.depth()
Returns the current depth of the hierarchy. @return the hierarchy depth.
com.avaje.ebeaninternal.api.SpiTransaction.depth()
Modify and return the current 'depth' of the transaction.
As we cascade save or delete we traverse the object graph tree. Going up to Assoc Ones the depth decreases and going down to Assoc Manys the depth increases.

The depth is used for ordering batching statements. The lowest depth get executed first during save.
com.sun.jdi.request.StepRequest.depth()
@return the step depth
com.tll.util.PropertyPath.depth()
@return The number of "nodes" in the parsed property path.
E.g.: propA.propB[3].propC has a depth of 3.
de.anomic.crawler.CrawlProfile.depth()
Gets depth of crawl job (or height of the tree which will be created by the crawler). @return depth of crawl job
de.anomic.crawler.retrieval.Request.depth()
gnu.x11.Depth.depth()
it.highwaytech.db.HierPath.depth()
megamek.common.IHex.depth()
@return a level indicating how far features in this hex extend below thesurface elevation.
org.apache.hadoop.fs.Path.depth()
Return the number of elements in this path.
org.aspectj.org.eclipse.jdt.internal.compiler.lookup.ReferenceBinding.depth()
org.eclipse.jdt.internal.compiler.lookup.ReferenceBinding.depth()
org.freeplane.features.map.NodeModel.depth()
org.hibernate.search.annotations.IndexedEmbedded.depth()
org.neo4j.graphdb.traversal.TraversalBranch.depth()
The depth for this expansion source compared to the start node of the traversal. @return the depth of this expansion source.
org.richfaces.model.TreeRowKey.depth()
getter for key depth @return key depth

Examples of org.hibernate.search.annotations.IndexedEmbedded.depth()

    getAnalyzerDefs( member, context );


    IndexedEmbedded embeddedAnn = member.getAnnotation( IndexedEmbedded.class );
    if ( embeddedAnn != null ) {
      int oldMaxLevel = maxLevel;
      int potentialLevel = embeddedAnn.depth() + level;
      if ( potentialLevel < 0 ) {
        potentialLevel = Integer.MAX_VALUE;
      }
      maxLevel = potentialLevel > maxLevel ? maxLevel : potentialLevel;
      level++;

View Full Code Here

Examples of org.hibernate.search.annotations.IndexedEmbedded.depth()


  private void checkForIndexedEmbedded(XProperty member, PropertiesMetadata propertiesMetadata, String prefix, Set<XClass> processedClasses, ConfigContext context) {
    IndexedEmbedded embeddedAnn = member.getAnnotation( IndexedEmbedded.class );
    if ( embeddedAnn != null ) {
      int oldMaxLevel = maxLevel;
      int potentialLevel = embeddedAnn.depth() + level;
      if ( potentialLevel < 0 ) {
        potentialLevel = Integer.MAX_VALUE;
      }
      maxLevel = potentialLevel > maxLevel ? maxLevel : potentialLevel;
      level++;

View Full Code Here

Examples of org.hibernate.search.annotations.IndexedEmbedded.depth()

    if ( embeddedAnn != null ) {
      //collection role in Hibernate is made of the actual hosting class of the member (see HSEARCH-780)
      this.indexedEmbeddedCollectionRoles
          .add( StringHelper.qualify( classHostingMember.getName(), member.getName() ) );
      int oldMaxLevel = maxLevel;
      int potentialLevel = embeddedAnn.depth() + level;
      if ( potentialLevel < 0 ) {
        potentialLevel = Integer.MAX_VALUE;
      }
      maxLevel = potentialLevel > maxLevel ? maxLevel : potentialLevel;
      level++;

View Full Code Here

Examples of org.hibernate.search.annotations.IndexedEmbedded.depth()


  private void checkForIndexedEmbedded(XProperty member, PropertiesMetadata propertiesMetadata, String prefix, Set<XClass> processedClasses, ConfigContext context) {
    IndexedEmbedded embeddedAnn = member.getAnnotation( IndexedEmbedded.class );
    if ( embeddedAnn != null ) {
      int oldMaxLevel = maxLevel;
      int potentialLevel = embeddedAnn.depth() + level;
      if ( potentialLevel < 0 ) {
        potentialLevel = Integer.MAX_VALUE;
      }
      maxLevel = potentialLevel > maxLevel ? maxLevel : potentialLevel;
      level++;

View Full Code Here

Examples of org.neo4j.graphdb.traversal.TraversalBranch.depth()

                        return new BranchSelector(){
                            @Override
                            public TraversalBranch next() {
                                TraversalBranch branch=startBranch;
                                while (branch!=null) {
                                    if (branch.depth()<branch.next().depth()) return branch;
                                    branch=branch.next();
                                }
                                return null;
                            }
                        };

View Full Code Here

Examples of org.richfaces.model.TreeRowKey.depth()

    
    if (tree.isRowAvailable()) {
      if (!tree.isLeaf()) {
        TreeRowKey key = rowKey;
        
        while (key != null && key.depth() != 0) {
          addQueuedState(key, NodeState.EXPANDED);
          key = (TreeRowKey) tree.getParentRowKey(key);
        };
        
      } else {

View Full Code Here

Examples of org.richfaces.model.TreeRowKey.depth()

  
  public void mergeSubState(TreeRowKey rowKey, TreeState subState) {
    Iterator<TreeRowKey> iter = subState.expandedNodes.iterator();
    while (iter != null && iter.hasNext()) {
      TreeRowKey key = iter.next().getSubKey(1);
      if (key.depth() > 0) {
          expandedNodes.add(new ListRowKey((ListRowKey)rowKey, (ListRowKey)key));
      } else if (!expandedNodes.contains(rowKey)) {
          expandedNodes.add(rowKey);
      }
    }

View Full Code Here

Examples of org.richfaces.model.TreeRowKey.depth()

          Iterator<RowKeyHolder> ajaxKeysItr = holders.iterator();
          while (ajaxKeysItr.hasNext()) {
            RowKeyHolder keyHolder = ajaxKeysItr.next();
            TreeRowKey key = keyHolder.getRowKey();


            if (key != null && key.depth() == 0) {
              key = null;
            }


            tree.setRowKey(context, key);

View Full Code Here

Examples of org.richfaces.model.TreeRowKey.depth()

                  //skip nodes that's parent nodes have been rendered
                  continue;
                }
              }


              if (key == null || key.depth() == 0) {
                nullRoot = true;
                key = null;
              }


              tree.setRowKey(context, key);

View Full Code Here

0 1 2 3 4 5

TOP

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.