fbfcd56021
This CL is part I of IV (I broke down the 1280 files into 4 CLs). Review URL: https://codereview.appspot.com/6485054 git-svn-id: http://skia.googlecode.com/svn/trunk@5262 2bbb7eff-a529-9590-31e7-b0007b416f81
93 lines
2.6 KiB
C++
93 lines
2.6 KiB
C++
|
|
/*
|
|
* Copyright 2006 The Android Open Source Project
|
|
*
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
* found in the LICENSE file.
|
|
*/
|
|
|
|
|
|
#ifndef SkDOM_DEFINED
|
|
#define SkDOM_DEFINED
|
|
|
|
#include "SkChunkAlloc.h"
|
|
#include "SkScalar.h"
|
|
#include "SkTemplates.h"
|
|
|
|
struct SkDOMNode;
|
|
struct SkDOMAttr;
|
|
|
|
class SkDOM {
|
|
public:
|
|
SkDOM();
|
|
~SkDOM();
|
|
|
|
typedef SkDOMNode Node;
|
|
typedef SkDOMAttr Attr;
|
|
|
|
/** Returns null on failure
|
|
*/
|
|
const Node* build(const char doc[], size_t len);
|
|
const Node* copy(const SkDOM& dom, const Node* node);
|
|
|
|
const Node* getRootNode() const;
|
|
|
|
enum Type {
|
|
kElement_Type,
|
|
kText_Type
|
|
};
|
|
Type getType(const Node*) const;
|
|
|
|
const char* getName(const Node*) const;
|
|
const Node* getFirstChild(const Node*, const char elem[] = NULL) const;
|
|
const Node* getNextSibling(const Node*, const char elem[] = NULL) const;
|
|
|
|
const char* findAttr(const Node*, const char attrName[]) const;
|
|
const Attr* getFirstAttr(const Node*) const;
|
|
const Attr* getNextAttr(const Node*, const Attr*) const;
|
|
const char* getAttrName(const Node*, const Attr*) const;
|
|
const char* getAttrValue(const Node*, const Attr*) const;
|
|
|
|
// helpers for walking children
|
|
int countChildren(const Node* node, const char elem[] = NULL) const;
|
|
|
|
// helpers for calling SkParse
|
|
bool findS32(const Node*, const char name[], int32_t* value) const;
|
|
bool findScalars(const Node*, const char name[], SkScalar value[], int count) const;
|
|
bool findHex(const Node*, const char name[], uint32_t* value) const;
|
|
bool findBool(const Node*, const char name[], bool*) const;
|
|
int findList(const Node*, const char name[], const char list[]) const;
|
|
|
|
bool findScalar(const Node* node, const char name[], SkScalar value[]) const
|
|
{
|
|
return this->findScalars(node, name, value, 1);
|
|
}
|
|
|
|
bool hasAttr(const Node*, const char name[], const char value[]) const;
|
|
bool hasS32(const Node*, const char name[], int32_t value) const;
|
|
bool hasScalar(const Node*, const char name[], SkScalar value) const;
|
|
bool hasHex(const Node*, const char name[], uint32_t value) const;
|
|
bool hasBool(const Node*, const char name[], bool value) const;
|
|
|
|
class AttrIter {
|
|
public:
|
|
AttrIter(const class SkDOM&, const Node*);
|
|
const char* next(const char** value);
|
|
private:
|
|
const Attr* fAttr;
|
|
const Attr* fStop;
|
|
};
|
|
|
|
SkDEBUGCODE(void dump(const Node* node = NULL, int tabLevel = 0) const;)
|
|
SkDEBUGCODE(static void UnitTest();)
|
|
|
|
private:
|
|
SkChunkAlloc fAlloc;
|
|
Node* fRoot;
|
|
friend class AttrIter;
|
|
friend class SkDOMParser;
|
|
};
|
|
|
|
#endif
|
|
|