Lines Matching full:testdata
159 int CachedFrame::compare(BestData& testData, const BestData& bestData) const
161 if (testData.mNode->tabIndex() != bestData.mNode->tabIndex()) {
162 if (testData.mNode->tabIndex() < bestData.mNode->tabIndex()
164 testData.mNode->setCondition(CachedNode::HIGHER_TAB_INDEX);
172 if (testData.mInNav != bestData.mInNav) {
174 testData.mNode->setCondition(CachedNode::IN_CURSOR);
179 if (testData.mInNav) {
180 if (bestData.mMajorDelta < testData.mMajorDelta) {
181 testData.mNode->setCondition(CachedNode::CLOSER_IN_CURSOR);
184 if (testData.mMajorDelta < bestData.mMajorDelta)
187 if (testData.mMajorDelta < 0 && bestData.mMajorDelta >= 0) {
188 testData.mNode->setCondition(CachedNode::FURTHER);
191 if ((testData.mMajorDelta ^ bestData.mMajorDelta) < 0) // one above, one below (or one left, one right)
194 bool testInWorking = testData.inOrSubsumesWorking();
195 if (bestInWorking && testData.mWorkingOutside && testData.mNavOutside) {
196 testData.mNode->setCondition(CachedNode::IN_WORKING);
202 bool testInNav = directionChange() && testData.inOrSubsumesNav();
204 if (bestInNav && testData.mNavOutside) {
205 testData.mNode->setCondition(CachedNode::IN_UMBRA);
212 if (testData.mCursorChild != bestData.mCursorChild) {
214 testData.mNode->setCondition(CachedNode::IN_CURSOR_CHILDREN);
221 bool testOverlap = bestTestIn || (testData.mWorkingOverlap != 0 && bestData.mWorkingOverlap == 0);
222 bool bestOverlap = bestTestIn || (testData.mWorkingOverlap == 0 && bestData.mWorkingOverlap != 0);
225 if (bestData.mMajorButt < 10 && testData.mMajorButt >= 40) {
226 testData.mNode->setCondition(CachedNode::BUTTED_UP);
229 if (testData.mMajorButt < 10 && bestData.mMajorButt >= 40)
233 if (bestOverlap && bestData.mMajorDelta < testData.mMajorDelta) { // choose closest major axis center
234 testData.mNode->setCondition(CachedNode::CLOSER);
237 if (testOverlap && testData.mMajorDelta < bestData.mMajorDelta)
239 if (bestOverlap && bestData.mMajorDelta2 < testData.mMajorDelta2) {
240 testData.mNode->setCondition(CachedNode::CLOSER_TOP);
243 if (testOverlap && testData.mMajorDelta2 < bestData.mMajorDelta2)
246 if (bestOverlap && ((bestData.mSideDistance <= 0 && testData.mSideDistance > 0) ||
247 abs(bestData.mSideDistance) < abs(testData.mSideDistance))) {
248 testData.mNode->setCondition(CachedNode::LEFTMOST);
251 if (testOverlap && ((testData.mSideDistance <= 0 && bestData.mSideDistance > 0) ||
252 abs(testData.mSideDistance) < abs(bestData.mSideDistance)))
257 SkFixed testMultiplier = testData.mWorkingOverlap > testData.mNavOverlap ?
258 testData.mWorkingOverlap : testData.mNavOverlap;
261 int testDistance = testData.mDistance;
276 int side = testData.mSideDistance;
283 negative = side < 0 && testData.mSideDistance > 0;
293 testData.mNode->setCondition(CachedNode::CLOSER_OVERLAP);
299 int distance = testData.mDistance + testData.mSideDistance;
302 testData.mNode->setCondition(CachedNode::CLOSER_RAW_DISTANCE);
308 if (testData.mSideDistance > best) {
309 testData.mNode->setCondition(CachedNode::SIDE_DISTANCE);
312 if (testData.mSideDistance < best)
315 if (testData.mPreferred < bestData.mPreferred) {
316 testData.mNode->setCondition(CachedNode::PREFERRED);
319 if (testData.mPreferred > bestData.mPreferred)
387 BestData testData;
388 testData.mNode = test;
389 testData.mFrame = this;
391 testData.setMouseBounds(bounds);
392 testData.setNodeBounds(bounds);
407 if (checkForHidden && mRoot->maskIfHidden(&testData) == true) {
412 testRect.intersect(testData.mouseBounds());
516 BestData testData;
517 testData.mNode = test;
518 testData.mFrame = this;
519 testData.setMouseBounds(testRect);
520 testData.setNodeBounds(testRect);
521 if (mRoot->maskIfHidden(&testData) == true)
674 BestData testData;
675 if (frameNodeCommon(testData, test, bestData, &originalData) == REJECT_TEST)
681 testData.setNodeBounds(test->ring(this, part));
682 if (testData.setDownDirection(history()))
684 int result = framePartCommon(testData, test, bestData);
688 BestData innerData = testData;
696 *bestData = testData;
714 BestData testData;
715 if (frameNodeCommon(testData, test, bestData, &originalData) == REJECT_TEST)
721 testData.setNodeBounds(test->ring(this, part));
722 if (testData.setLeftDirection(history()))
724 int result = framePartCommon(testData, test, bestData);
728 BestData innerData = testData;
736 *bestData = testData;
743 int CachedFrame::frameNodeCommon(BestData& testData, const CachedNode* test,
746 testData.mFrame = this;
747 testData.mNode = test;
750 testData.mNode->setCondition(CachedNode::DISABLED);
755 testData.mNode->setCondition(CachedNode::NAVABLE);
759 testData.mNode->setCondition(CachedNode::NAVABLE);
764 testData.mNode->setCondition(CachedNode::UNDER_LAYER);
767 // if (isNavable(test, &testData.mNodeBounds, walk) == false) {
768 // testData.mNode->setCondition(CachedNode::NAVABLE);
773 testData.mNode->setCondition(CachedNode::NOT_CURSOR_NODE);
777 // testData.mNode->setCondition(CachedNode::NOT_ENCLOSING_CURSOR);
781 testData.mCursorChild = par ? test->parentGroup() == par : false;
784 if (mRoot->mCursor && testData.mNode->parentIndex() != bestData->mNode->parentIndex()) {
789 if (testData.mNode->parentIndex() == cursorParentIndex)
793 if (testData.mNode->parent() == bestData->mNode) {
794 testData.mNode->setCondition(CachedNode::CHILD);
797 if (testData.mNode == bestData->mNode->parent())
799 int testInBest = testData.isContainer(bestData); /* -1 pick best over test, 0 no containership, 1 pick test over best */
807 testData.mNode->setCondition(CachedNode::OUTSIDE_OF_BEST);
811 testInBest = testData.isContainer(originalData);
813 testData.mNode->setCondition(CachedNode::OUTSIDE_OF_ORIGINAL);
820 int CachedFrame::framePartCommon(BestData& testData,
824 && testData.bounds().contains(mRoot->mCursorBounds)
826 testData
829 testData.setDistances();
831 int compared = compare(testData, *bestData);
848 BestData testData;
849 if (frameNodeCommon(testData, test, bestData, &originalData) == REJECT_TEST)
855 testData.setNodeBounds(test->ring(this, part));
856 if (testData.setRightDirection(history()))
858 int result = framePartCommon(testData, test, bestData);
862 BestData innerData = testData;
870 *bestData = testData;
884 BestData testData;
885 if (frameNodeCommon(testData, test, bestData, &originalData) == REJECT_TEST)
891 testData.setNodeBounds(test->ring(this, part));
892 if (testData.setUpDirection(history()))
894 int result = framePartCommon(testData, test, bestData);
898 BestData innerData = testData;
906 *bestData = testData;
