⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 splashxpathscanner.h

📁 将pdf文档转换为高质量的html文档
💻 H
字号:
//========================================================================//// SplashXPathScanner.h////========================================================================#ifndef SPLASHXPATHSCANNER_H#define SPLASHXPATHSCANNER_H#include <aconf.h>#ifdef USE_GCC_PRAGMAS#pragma interface#endif#include "SplashTypes.h"class SplashXPath;struct SplashIntersect;//------------------------------------------------------------------------// SplashXPathScanner//------------------------------------------------------------------------class SplashXPathScanner {public:  // Create a new SplashXPathScanner object.  <xPathA> must be sorted.  SplashXPathScanner(SplashXPath *xPathA, GBool eoA);  ~SplashXPathScanner();  // Return the path's bounding box.  void getBBox(int *xMinA, int *yMinA, int *xMaxA, int *yMaxA)    { *xMinA = xMin; *yMinA = yMin; *xMaxA = xMax; *yMaxA = yMax; }  // Return the min/max x values for the span at <y>.  void getSpanBounds(int y, int *spanXMin, int *spanXMax);  // Returns true if (<x>,<y>) is inside the path.  GBool test(int x, int y);  // Returns true if the entire span ([<x0>,<x1>], <y>) is inside the  // path.  GBool testSpan(int x0, int x1, int y);  // Returns the next span inside the path at <y>.  If <y> is  // different than the previous call to getNextSpan, this returns the  // first span at <y>; otherwise it returns the next span (relative  // to the previous call to getNextSpan).  Returns false if there are  // no more spans at <y>.  GBool getNextSpan(int y, int *x0, int *x1);private:  void computeIntersections(int y);  SplashXPath *xPath;  GBool eo;  int xMin, yMin, xMax, yMax;  int interY;			// current y value  int interIdx;			// current index into <inter> - used by				//   getNextSpan   int interCount;		// current EO/NZWN counter - used by				//   getNextSpan  int xPathIdx;			// current index into <xPath> - used by				//   computeIntersections  SplashIntersect *inter;	// intersections array for <interY>  int interLen;			// number of intersections in <inter>  int interSize;		// size of the <inter> array};#endif

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -