Examples of top()


Examples of com.trolltech.qt.core.QRectF.top()

      rect.setBottomRight(p);
      if (!rect.contains(newPos)) {
        // Keep the item inside the scene rect.
        newPos.setX(Math.min(rect.right(), Math.max(newPos.x(), rect
            .left())));
        newPos.setY(Math.min(rect.bottom(), Math.max(newPos.y(), rect
            .top())));
      }
      long x = Math.round(newPos.x() / scene.tileSize)
          * scene.tileSize;
      long y = Math.round(newPos.y() / scene.tileSize)
View Full Code Here

Examples of fcagnin.jglsdk.glutil.MatrixStack.top()

        {
            currMatrix.push();
            currMatrix.scale( 100.0f, 1.0f, 100.0f );

            glUniform4f( baseColorUnif, 0.2f, 0.5f, 0.2f, 1.0f );
            glUniformMatrix4( modelToCameraMatrixUnif, false, currMatrix.top().fillAndFlipBuffer( mat4Buffer ) );

            plane.render();

            currMatrix.pop();
        }
View Full Code Here

Examples of limelight.util.Box.top()

    scrollBar.setValue(10);

    Box sliderBounds = scrollBar.getSliderBounds();
    final ScrollRepeater.ScrollCondition condition = processor.getNotInSliderScrollCondition();

    processor.setMouseLocation(7, sliderBounds.top() - 1);
    assertEquals(true, condition.canScroll());

    processor.setMouseLocation(7, sliderBounds.top() + 1);
    assertEquals(false, condition.canScroll());
View Full Code Here

Examples of org.apache.lucene.facet.TopOrdAndFloatQueue.top()

          }
          reuse.ord = ord;
          reuse.value = values[ord];
          reuse = q.insertWithOverflow(reuse);
          if (q.size() == topN) {
            bottomValue = q.top().value;
          }
        }
      }

      ord = siblings[ord];
View Full Code Here

Examples of org.apache.lucene.facet.TopOrdAndIntQueue.top()

            // sparse case unnecessarily
            q = new TopOrdAndIntQueue(topN);
          }
          reuse = q.insertWithOverflow(reuse);
          if (q.size() == topN) {
            bottomCount = q.top().value;
          }
        }
      }
    }
View Full Code Here

Examples of org.apache.lucene.facet.TopOrdAndIntQueue.top()

            // sparse case unnecessarily
            q = new TopOrdAndIntQueue(topN);
          }
          reuse = q.insertWithOverflow(reuse);
          if (q.size() == topN) {
            bottomCount = q.top().value;
          }
        }
      }
    }
View Full Code Here

Examples of org.apache.lucene.search.spell.SuggestWordQueue.top()

        sug.score = sd.getDistance(original, sug.string);
        if (sug.score < min) continue;
        sugQueue.insertWithOverflow(sug);
        if (sugQueue.size() == numSug) {
          // if queue full, maintain the minScore score
          min = sugQueue.top().score;
        }
      }

      // create token
      SpellCheckResponse.Suggestion suggestion = origVsSuggestion.get(original);
View Full Code Here

Examples of org.apache.lucene.search.spell.SuggestWordQueue.top()

        sug.score = sd.getDistance(original, sug.string);
        if (sug.score < min) continue;
        sugQueue.insertWithOverflow(sug);
        if (sugQueue.size() == numSug) {
          // if queue full, maintain the minScore score
          min = sugQueue.top().score;
        }
      }

      // create token
      SpellCheckResponse.Suggestion suggestion = origVsSuggestion.get(original);
View Full Code Here

Examples of org.apache.lucene.search.spell.SuggestWordQueue.top()

                }
            }
            sugQueue.insert(sugWord);
            if (sugQueue.size() == numSug) {
                // if queue full, maintain the minScore score
                min = ((SuggestWord) sugQueue.top()).score;
            }
            sugWord = new SuggestWord();
        }

        // convert to array string
View Full Code Here

Examples of org.apache.lucene.util.PriorityQueue.top()

          queue.add(new BrowseFacet(String.valueOf(facet), iter.count));
          qsize++;
        }
        if(facet != null)
        {
          BrowseFacet rootFacet = (BrowseFacet)queue.top();
          minHits = rootFacet.getHitCount() + 1;
          // facet count less than top of min heap, it will never be added
          while(((facet = iter.next(minHits)) != null))
          {
            rootFacet.setValue(String.valueOf(facet));
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.