Esempio n. 1
0
bool
ESSimpleRenderView::Create(int nId, _Rect rRect, MercuryBaseView* pOwner, ESChildControl* pParent){
	m_szPage.SetSize(rRect.Width(), rRect.Height());
	m_szView.SetSize(rRect.Width(), m_nContentHeight);
	bool bRet = ESChildScrollView::Create(nId, rRect, pOwner, pParent);
	if( bRet ){
		}
	return bRet;
	}
Esempio n. 2
0
static bool intersectEnd(const Cubic& cubic1, bool start, const Cubic& cubic2, const _Rect& bounds2,
        Intersections& i) {
    _Line line1;
    line1[0] = line1[1] = cubic1[start ? 0 : 3];
    _Point dxy1 = line1[0] - cubic1[start ? 1 : 2];
    dxy1 /= precisionUnit;
    line1[1] += dxy1;
    _Rect line1Bounds;
    line1Bounds.setBounds(line1);
    if (!bounds2.intersects(line1Bounds)) {
        return false;
    }
    _Line line2;
    line2[0] = line2[1] = line1[0];
    _Point dxy2 = line2[0] - cubic1[start ? 3 : 0];
    dxy2 /= precisionUnit;
    line2[1] += dxy2;
#if 0 // this is so close to the first bounds test it isn't worth the short circuit test
    _Rect line2Bounds;
    line2Bounds.setBounds(line2);
    if (!bounds2.intersects(line2Bounds)) {
        return false;
    }
#endif
    Intersections local1;
    if (!intersect(cubic2, line1, local1)) {
        return false;
    }
    Intersections local2;
    if (!intersect(cubic2, line2, local2)) {
        return false;
    }
    double tMin, tMax;
    tMin = tMax = local1.fT[0][0];
    for (int index = 1; index < local1.fUsed; ++index) {
        tMin = std::min(tMin, local1.fT[0][index]);
        tMax = std::max(tMax, local1.fT[0][index]);
    }
    for (int index = 1; index < local2.fUsed; ++index) {
        tMin = std::min(tMin, local2.fT[0][index]);
        tMax = std::max(tMax, local2.fT[0][index]);
    }
#if SK_DEBUG
    debugDepth = 0;
#endif
    return intersect2(cubic1, start ? 0 : 1, start ? 1.0 / precisionUnit : 1 - 1.0 / precisionUnit,
            cubic2, tMin, tMax, 1, i);
}
Esempio n. 3
0
void find_tight_bounds(const Cubic& cubic, _Rect& bounds) {
    CubicPair cubicPair;
    chop_at(cubic, cubicPair, 0.5);
    if (!tiny(cubicPair.first()) && !controls_inside(cubicPair.first())) {
        find_tight_bounds(cubicPair.first(), bounds);
    } else {
        bounds.add(cubicPair.first()[0]);
        bounds.add(cubicPair.first()[3]);
    }
    if (!tiny(cubicPair.second()) && !controls_inside(cubicPair.second())) {
        find_tight_bounds(cubicPair.second(), bounds);
    } else {
        bounds.add(cubicPair.second()[0]);
        bounds.add(cubicPair.second()[3]);
    }
}
Esempio n. 4
0
void
RenderItemText::Draw(_DC* pDC, _Rect rcItem, _Rect rcDraw, ESChildControl* pControl){
	if( !m_pStyle ) return;
	Font*	pFontOld	= pDC->SelectObject(&m_pStyle->m_font);
	int		nBkModeOld	= pDC->SetBkMode(TRANSPARENT);
	pDC->SetTextColor(m_crText);

	_Rect rcText;
	if( m_nHAlign == Alignment::HAlign_Center ){
		rcText.left		= rcItem.left + (rcItem.Width() - m_szText.cx)/2;
		rcText.right	= rcText.left + m_szText.cx;
		}
	else{
		if( m_nHAlign == Alignment::HAlign_Right ){
			rcText.left		= rcItem.right - m_szText.cx;
			rcText.right	= rcItem.right;
			}
		else{
			rcText.left		= rcItem.left;
			rcText.right	= rcItem.left + m_szText.cx;
			}
		}

	if( m_nVAlign == Alignment::VAlign_Middle ){
		rcText.top		= rcItem.top + (rcItem.Height() - m_szText.cy)/2;
		rcText.bottom	= rcText.top + m_szItem.cy;
		}
	else{
		if( m_nVAlign == Alignment::VAlign_Bottom ){
			rcText.top		= rcItem.bottom - m_szText.cy;
			rcText.bottom	= rcItem.bottom;
			}
		else{
			rcText.top		= rcItem.top;
			rcText.bottom	= rcItem.top + m_szText.cy;
			}
		}
		
	_string sText = m_sText;
	if( sText.length() )
		ESLocalizationMan::ParseText(sText);
	pDC->ExtTextOut     (rcText.left, rcText.top, ETO_CLIPPED, rcDraw, sText.c_str());
	pDC->SetBkMode		(nBkModeOld);
	pDC->SelectObject	(pFontOld);
	}
Esempio n. 5
0
// intersect the end of the cubic with the other. Try lines from the end to control and opposite
// end to determine range of t on opposite cubic.
static bool intersectEnd(const Cubic& cubic1, bool start, const Cubic& cubic2, const _Rect& bounds2,
        Intersections& i) {
 //   bool selfIntersect = cubic1 == cubic2;
    _Line line;
    int t1Index = start ? 0 : 3;
    line[0] = cubic1[t1Index];
    // don't bother if the two cubics are connnected
#if 0
    if (!selfIntersect && (line[0].approximatelyEqual(cubic2[0])
            || line[0].approximatelyEqual(cubic2[3]))) {
        return false;
    }
#endif
    bool result = false;
    SkTDArray<double> tVals; // OPTIMIZE: replace with hard-sized array
    for (int index = 0; index < 4; ++index) {
        if (index == t1Index) {
            continue;
        }
        _Vector dxy1 = cubic1[index] - line[0];
        dxy1 /= gPrecisionUnit;
        line[1] = line[0] + dxy1;
        _Rect lineBounds;
        lineBounds.setBounds(line);
        if (!bounds2.intersects(lineBounds)) {
            continue;
        }
        Intersections local;
        if (!intersect(cubic2, line, local)) {
            continue;
        }
        for (int idx2 = 0; idx2 < local.used(); ++idx2) {
            double foundT = local.fT[0][idx2];
            if (approximately_less_than_zero(foundT)
                    || approximately_greater_than_one(foundT)) {
                continue;
            }
            if (local.fPt[idx2].approximatelyEqual(line[0])) {
                if (i.swapped()) { // FIXME: insert should respect swap
                    i.insert(foundT, start ? 0 : 1, line[0]);
                } else {
                    i.insert(start ? 0 : 1, foundT, line[0]);
                }
                result = true;
            } else {
                *tVals.append() = local.fT[0][idx2];
            }
        }
    }
    if (tVals.count() == 0) {
        return result;
    }
    QSort<double>(tVals.begin(), tVals.end() - 1);
    double tMin1 = start ? 0 : 1 - LINE_FRACTION;
    double tMax1 = start ? LINE_FRACTION : 1;
    int tIdx = 0;
    do {
        int tLast = tIdx;
        while (tLast + 1 < tVals.count() && roughly_equal(tVals[tLast + 1], tVals[tIdx])) {
            ++tLast;
        }
        double tMin2 = SkTMax(tVals[tIdx] - LINE_FRACTION, 0.0);
        double tMax2 = SkTMin(tVals[tLast] + LINE_FRACTION, 1.0);
        int lastUsed = i.used();
        result |= intersect3(cubic1, tMin1, tMax1, cubic2, tMin2, tMax2, 1, i);
        if (lastUsed == i.used()) {
            tMin2 = SkTMax(tVals[tIdx] - (1.0 / gPrecisionUnit), 0.0);
            tMax2 = SkTMin(tVals[tLast] + (1.0 / gPrecisionUnit), 1.0);
            result |= intersect3(cubic1, tMin1, tMax1, cubic2, tMin2, tMax2, 1, i);
        }
        tIdx = tLast + 1;
    } while (tIdx < tVals.count());
    return result;
}
Esempio n. 6
0
bool
ESChildSlider::CalcCursorRect(_Rect rcBar, _Rect& rcCursor){
	_Size szCursorImg(0, 0);
	float fZoomCX = 1.0f, fZoomCY = 1.0f;
	if( m_pOwner )
		m_pOwner->GetZoom(fZoomCX, fZoomCY);
	if( !m_imageCursor.IsNull() )
		szCursorImg.SetSize(m_imageCursor.GetWidth()*fZoomCX, m_imageCursor.GetHeight()*fZoomCY);

	if( m_nPos < m_nMin ){
		m_nPos				= m_nMin;
		if( m_bVerticalMode ){
			rcCursor.top		= rcBar.bottom - szCursorImg.cy;
			rcCursor.left		= rcBar.left + (rcBar.Width() - szCursorImg.cx)/2;
			rcCursor.right		= rcCursor.left + szCursorImg.cx;
			rcCursor.bottom		= rcCursor.top + szCursorImg.cy;
			}
		else{
			rcCursor.left		= rcBar.left;
			rcCursor.top		= rcBar.top + (rcBar.Height() - szCursorImg.cy)/2;
			rcCursor.right		= rcCursor.left + szCursorImg.cx;
			rcCursor.bottom		= rcCursor.top + szCursorImg.cy;
			}
		return true;
		}

	if( m_nPos > m_nMax ){
		m_nPos				= m_nMax;
		if( m_bVerticalMode ){
			rcCursor.top		= rcBar.top;
			rcCursor.left		= rcBar.left + (rcBar.Width() - szCursorImg.cx)/2;
			rcCursor.right		= rcCursor.left + szCursorImg.cx;
			rcCursor.bottom		= rcCursor.top + szCursorImg.cy;
			}
		else{
			rcCursor.left		= rcBar.right - szCursorImg.cx;
			rcCursor.top		= rcBar.top + (rcBar.Height() - szCursorImg.cy)/2;
			rcCursor.right		= rcCursor.left + szCursorImg.cx;
			rcCursor.bottom		= rcCursor.top + szCursorImg.cy;
			}
		return true;
		}

	if( m_bVerticalMode ){
		float fDelta		= (float)((rcBar.Height() - szCursorImg.cy) / ((m_nMax - m_nMin)*1.0f));
		m_ptCursorPos.y		= (rcBar.bottom - szCursorImg.cy) - (int)(fDelta*(m_nPos - m_nMin));
		m_ptCursorPos.x		= rcBar.left;

		rcCursor.top		= m_ptCursorPos.y;
		rcCursor.left		= rcBar.left + (rcBar.Width() - szCursorImg.cx)/2;
		rcCursor.right		= rcCursor.left + szCursorImg.cx;
		rcCursor.bottom		= rcCursor.top + szCursorImg.cy;
		}
	else{
		float fDelta		= (float)((rcBar.Width() - szCursorImg.cx) / ((m_nMax - m_nMin)*1.0f));
		m_ptCursorPos.x		= rcBar.left + (int)(fDelta*(m_nPos - m_nMin));
		m_ptCursorPos.y		= rcBar.top;

		rcCursor.left		= m_ptCursorPos.x;
		rcCursor.top		= rcBar.top + (rcBar.Height() - szCursorImg.cy)/2;
		rcCursor.right		= rcCursor.left + szCursorImg.cx;
		rcCursor.bottom		= rcCursor.top + szCursorImg.cy;
		}
	return true;
	}