ReflexHash Class Reference

Public Member Functions
bool	init (const SkRect &bounds, int vertexCount)
void	add (TriangulationVertex *v)
void	remove (TriangulationVertex *v)
bool	checkTriangle (const SkPoint &p0, const SkPoint &p1, const SkPoint &p2, uint16_t ignoreIndex0, uint16_t ignoreIndex1) const

Detailed Description

Definition at line 1523 of file SkPolyUtils.cpp.

Member Function Documentation

add()

void ReflexHash::add ( TriangulationVertex *  v )

inline

Definition at line 1555 of file SkPolyUtils.cpp.

                                     {
        int index = hash(v);
        fGrid[index].addToTail(v);
        ++fNumVerts;
    }

checkTriangle()

bool ReflexHash::checkTriangle ( const SkPoint &  p0, const SkPoint &  p1, const SkPoint &  p2, uint16_t  ignoreIndex0, uint16_t  ignoreIndex1  ) const

inline

Definition at line 1567 of file SkPolyUtils.cpp.

                                                                           {
        if (!fNumVerts) {
            return false;
        }
 
        SkRect triBounds;
        compute_triangle_bounds(p0, p1, p2, &triBounds);
        int h0 = (triBounds.fLeft - fBounds.fLeft)*fGridConversion.fX;
        int h1 = (triBounds.fRight - fBounds.fLeft)*fGridConversion.fX;
        int v0 = (triBounds.fTop - fBounds.fTop)*fGridConversion.fY;
        int v1 = (triBounds.fBottom - fBounds.fTop)*fGridConversion.fY;
 
        for (int v = v0; v <= v1; ++v) {
            for (int h = h0; h <= h1; ++h) {
                int i = v * fHCount + h;
                for (SkTInternalLList<TriangulationVertex>::Iter reflexIter = fGrid[i].begin();
                     reflexIter != fGrid[i].end(); ++reflexIter) {
                    TriangulationVertex* reflexVertex = *reflexIter;
                    if (reflexVertex->fIndex != ignoreIndex0 &&
                        reflexVertex->fIndex != ignoreIndex1 &&
                        point_in_triangle(p0, p1, p2, reflexVertex->fPosition)) {
                        return true;
                    }
                }
 
            }
        }
 
        return false;
    }

init()

bool ReflexHash::init ( const SkRect &  bounds, int  vertexCount  )

inline

Definition at line 1525 of file SkPolyUtils.cpp.

                                                     {
        fBounds = bounds;
        fNumVerts = 0;
        SkScalar width = bounds.width();
        SkScalar height = bounds.height();
        if (!SkIsFinite(width, height)) {
            return false;
        }
 
        // We want vertexCount grid cells, roughly distributed to match the bounds ratio
        SkScalar hCount = SkScalarSqrt(sk_ieee_float_divide(vertexCount*width, height));
        if (!SkIsFinite(hCount)) {
            return false;
        }
        fHCount = std::max(std::min(SkScalarRoundToInt(hCount), vertexCount), 1);
        fVCount = vertexCount/fHCount;
        fGridConversion.set(sk_ieee_float_divide(fHCount - 0.001f, width),
                            sk_ieee_float_divide(fVCount - 0.001f, height));
        if (!fGridConversion.isFinite()) {
            return false;
        }
 
        fGrid.resize(fHCount*fVCount);
        for (int i = 0; i < fGrid.size(); ++i) {
            fGrid[i].reset();
        }
 
        return true;
    }

remove()

void ReflexHash::remove ( TriangulationVertex *  v )

inline

Definition at line 1561 of file SkPolyUtils.cpp.

                                        {
        int index = hash(v);
        fGrid[index].remove(v);
        --fNumVerts;
    }

---

The documentation for this class was generated from the following file:

• third_party/skia/src/utils/SkPolyUtils.cpp