qwt__raster__data_8cpp-source.html
来自「QWT5.01用于Qt开发的二维图形库程序」· HTML 代码 · 共 388 行 · 第 1/3 页
HTML
388 行
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>Qwt User's Guide: qwt_raster_data.cpp Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.4.6 --><div class="tabs"> <ul> <li><a href="index.html"><span>Main Page</span></a></li> <li><a href="classes.html"><span>Classes</span></a></li> <li id="current"><a href="files.html"><span>Files</span></a></li> <li><a href="pages.html"><span>Related Pages</span></a></li> </ul></div><h1>qwt_raster_data.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- mode: C++ ; c-file-style: "stroustrup" -*- *****************************</span><a name="l00002"></a>00002 <span class="comment"> * Qwt Widget Library</span><a name="l00003"></a>00003 <span class="comment"> * Copyright (C) 1997 Josef Wilgen</span><a name="l00004"></a>00004 <span class="comment"> * Copyright (C) 2002 Uwe Rathmann</span><a name="l00005"></a>00005 <span class="comment"> *</span><a name="l00006"></a>00006 <span class="comment"> * This library is free software; you can redistribute it and/or</span><a name="l00007"></a>00007 <span class="comment"> * modify it under the terms of the Qwt License, Version 1.0</span><a name="l00008"></a>00008 <span class="comment"> *****************************************************************************/</span><a name="l00009"></a>00009 <a name="l00010"></a>00010 <span class="preprocessor">#include "qwt_raster_data.h"</span><a name="l00011"></a>00011 <a name="l00012"></a>00012 <span class="keyword">class </span>QwtRasterData::Contour3DPoint<a name="l00013"></a>00013 {<a name="l00014"></a>00014 <span class="keyword">public</span>:<a name="l00015"></a>00015 <span class="keyword">inline</span> <span class="keywordtype">void</span> setPos(<span class="keywordtype">double</span> x, <span class="keywordtype">double</span> y)<a name="l00016"></a>00016 {<a name="l00017"></a>00017 d_x = x;<a name="l00018"></a>00018 d_y = y;<a name="l00019"></a>00019 }<a name="l00020"></a>00020 <a name="l00021"></a>00021 <span class="keyword">inline</span> QwtDoublePoint pos()<span class="keyword"> const</span><a name="l00022"></a>00022 <span class="keyword"> </span>{<a name="l00023"></a>00023 <span class="keywordflow">return</span> QwtDoublePoint(d_x, d_y);<a name="l00024"></a>00024 }<a name="l00025"></a>00025 <a name="l00026"></a>00026 <span class="keyword">inline</span> <span class="keywordtype">void</span> setX(<span class="keywordtype">double</span> x) { d_x = x; }<a name="l00027"></a>00027 <span class="keyword">inline</span> <span class="keywordtype">void</span> setY(<span class="keywordtype">double</span> y) { d_y = y; }<a name="l00028"></a>00028 <span class="keyword">inline</span> <span class="keywordtype">void</span> setZ(<span class="keywordtype">double</span> z) { d_z = z; }<a name="l00029"></a>00029 <a name="l00030"></a>00030 <span class="keyword">inline</span> <span class="keywordtype">double</span> x()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> d_x; }<a name="l00031"></a>00031 <span class="keyword">inline</span> <span class="keywordtype">double</span> y()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> d_y; }<a name="l00032"></a>00032 <span class="keyword">inline</span> <span class="keywordtype">double</span> z()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> d_z; }<a name="l00033"></a>00033 <a name="l00034"></a>00034 <span class="keyword">private</span>:<a name="l00035"></a>00035 <span class="keywordtype">double</span> d_x;<a name="l00036"></a>00036 <span class="keywordtype">double</span> d_y;<a name="l00037"></a>00037 <span class="keywordtype">double</span> d_z;<a name="l00038"></a>00038 };<a name="l00039"></a>00039 <a name="l00040"></a>00040 <span class="keyword">class </span>QwtRasterData::ContourPlane<a name="l00041"></a>00041 {<a name="l00042"></a>00042 <span class="keyword">public</span>:<a name="l00043"></a>00043 <span class="keyword">inline</span> ContourPlane(<span class="keywordtype">double</span> z):<a name="l00044"></a>00044 d_z(z)<a name="l00045"></a>00045 {<a name="l00046"></a>00046 }<a name="l00047"></a>00047 <a name="l00048"></a>00048 <span class="keyword">inline</span> <span class="keywordtype">bool</span> intersect(<span class="keyword">const</span> Contour3DPoint vertex[3],<a name="l00049"></a>00049 QwtDoublePoint line[2], <span class="keywordtype">bool</span> ignoreOnPlane) <span class="keyword">const</span>;<a name="l00050"></a>00050 <a name="l00051"></a>00051 <span class="keyword">inline</span> <span class="keywordtype">double</span> z()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> d_z; }<a name="l00052"></a>00052 <a name="l00053"></a>00053 <span class="keyword">private</span>:<a name="l00054"></a>00054 <span class="keyword">inline</span> <span class="keywordtype">int</span> compare(<span class="keywordtype">double</span> z) <span class="keyword">const</span>;<a name="l00055"></a>00055 <span class="keyword">inline</span> QwtDoublePoint intersection(<a name="l00056"></a>00056 <span class="keyword">const</span> Contour3DPoint& p1, <span class="keyword">const</span> Contour3DPoint &p2) <span class="keyword">const</span>;<a name="l00057"></a>00057 <a name="l00058"></a>00058 <span class="keywordtype">double</span> d_z;<a name="l00059"></a>00059 };<a name="l00060"></a>00060 <a name="l00061"></a>00061 <span class="keyword">inline</span> <span class="keywordtype">bool</span> QwtRasterData::ContourPlane::intersect(<a name="l00062"></a>00062 <span class="keyword">const</span> Contour3DPoint vertex[3], QwtDoublePoint line[2],<a name="l00063"></a>00063 <span class="keywordtype">bool</span> ignoreOnPlane)<span class="keyword"> const</span><a name="l00064"></a>00064 <span class="keyword"></span>{<a name="l00065"></a>00065 <span class="keywordtype">bool</span> found = <span class="keyword">true</span>;<a name="l00066"></a>00066 <a name="l00067"></a>00067 <span class="comment">// Are the vertices below (-1), on (0) or above (1) the plan ?</span><a name="l00068"></a>00068 <span class="keyword">const</span> <span class="keywordtype">int</span> eq1 = compare(vertex[0].z());<a name="l00069"></a>00069 <span class="keyword">const</span> <span class="keywordtype">int</span> eq2 = compare(vertex[1].z());<a name="l00070"></a>00070 <span class="keyword">const</span> <span class="keywordtype">int</span> eq3 = compare(vertex[2].z());<a name="l00071"></a>00071 <a name="l00072"></a>00072 <span class="comment">/*</span><a name="l00073"></a>00073 <span class="comment"> (a) All the vertices lie below the contour level.</span><a name="l00074"></a>00074 <span class="comment"> (b) Two vertices lie below and one on the contour level.</span><a name="l00075"></a>00075 <span class="comment"> (c) Two vertices lie below and one above the contour level.</span><a name="l00076"></a>00076 <span class="comment"> (d) One vertex lies below and two on the contour level.</span><a name="l00077"></a>00077 <span class="comment"> (e) One vertex lies below, one on and one above the contour level.</span><a name="l00078"></a>00078 <span class="comment"> (f) One vertex lies below and two above the contour level.</span><a name="l00079"></a>00079 <span class="comment"> (g) Three vertices lie on the contour level.</span><a name="l00080"></a>00080 <span class="comment"> (h) Two vertices lie on and one above the contour level.</span><a name="l00081"></a>00081 <span class="comment"> (i) One vertex lies on and two above the contour level.</span><a name="l00082"></a>00082 <span class="comment"> (j) All the vertices lie above the contour level.</span><a name="l00083"></a>00083 <span class="comment"> */</span><a name="l00084"></a>00084 <a name="l00085"></a>00085 <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> tab[3][3][3] =<a name="l00086"></a>00086 {<a name="l00087"></a>00087 <span class="comment">// jump table to avoid nested case statements</span><a name="l00088"></a>00088 { { 0, 0, 8 }, { 0, 2, 5 }, { 7, 6, 9 } },<a name="l00089"></a>00089 { { 0, 3, 4 }, { 1, 10, 1 }, { 4, 3, 0 } },<a name="l00090"></a>00090 { { 9, 6, 7 }, { 5, 2, 0 }, { 8, 0, 0 } }<a name="l00091"></a>00091 };<a name="l00092"></a>00092 <a name="l00093"></a>00093 <span class="keyword">const</span> <span class="keywordtype">int</span> edgeType = tab[eq1+1][eq2+1][eq3+1];<a name="l00094"></a>00094 <span class="keywordflow">switch</span> (edgeType) <a name="l00095"></a>00095 {<a name="l00096"></a>00096 <span class="keywordflow">case</span> 1:<a name="l00097"></a>00097 <span class="comment">// d(0,0,-1), h(0,0,1)</span><a name="l00098"></a>00098 line[0] = vertex[0].pos();<a name="l00099"></a>00099 line[1] = vertex[1].pos();<a name="l00100"></a>00100 <span class="keywordflow">break</span>;<a name="l00101"></a>00101 <span class="keywordflow">case</span> 2:<a name="l00102"></a>00102 <span class="comment">// d(-1,0,0), h(1,0,0)</span><a name="l00103"></a>00103 line[0] = vertex[1].pos();<a name="l00104"></a>00104 line[1] = vertex[2].pos();<a name="l00105"></a>00105 <span class="keywordflow">break</span>;<a name="l00106"></a>00106 <span class="keywordflow">case</span> 3:<a name="l00107"></a>00107 <span class="comment">// d(0,-1,0), h(0,1,0)</span><a name="l00108"></a>00108 line[0] = vertex[2].pos();<a name="l00109"></a>00109 line[1] = vertex[0].pos();<a name="l00110"></a>00110 <span class="keywordflow">break</span>;<a name="l00111"></a>00111 <span class="keywordflow">case</span> 4:<a name="l00112"></a>00112 <span class="comment">// e(0,-1,1), e(0,1,-1)</span><a name="l00113"></a>00113 line[0] = vertex[0].pos();<a name="l00114"></a>00114 line[1] = intersection(vertex[1], vertex[2]);<a name="l00115"></a>00115 <span class="keywordflow">break</span>;<a name="l00116"></a>00116 <span class="keywordflow">case</span> 5:⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?