Files
grafX2/doxydoc/html/op__c_8h-source.html

213 lines
23 KiB
HTML
Raw Blame History

This file contains ambiguous Unicode characters
This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>GrafX2: op_c.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css">
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.8 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
<li><a href="annotated.html"><span>Data&nbsp;Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File&nbsp;List</span></a></li>
</ul>
</div>
<h1>op_c.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* Grafx2 - The Ultimate 256-color bitmap paint program</span>
<a name="l00002"></a>00002 <span class="comment"></span>
<a name="l00003"></a>00003 <span class="comment"> Copyright 2007 Adrien Destugues</span>
<a name="l00004"></a>00004 <span class="comment"> Copyright 1996-2001 Sunset Design (Guillaume Dorme &amp; Karl Maritaud)</span>
<a name="l00005"></a>00005 <span class="comment"></span>
<a name="l00006"></a>00006 <span class="comment"> Grafx2 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 GNU General Public License</span>
<a name="l00008"></a>00008 <span class="comment"> as published by the Free Software Foundation; version 2</span>
<a name="l00009"></a>00009 <span class="comment"> of the License.</span>
<a name="l00010"></a>00010 <span class="comment"></span>
<a name="l00011"></a>00011 <span class="comment"> Grafx2 is distributed in the hope that it will be useful,</span>
<a name="l00012"></a>00012 <span class="comment"> but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00013"></a>00013 <span class="comment"> MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00014"></a>00014 <span class="comment"> GNU General Public License for more details.</span>
<a name="l00015"></a>00015 <span class="comment"></span>
<a name="l00016"></a>00016 <span class="comment"> You should have received a copy of the GNU General Public License</span>
<a name="l00017"></a>00017 <span class="comment"> along with Grafx2; if not, see &lt;http://www.gnu.org/licenses/&gt; or</span>
<a name="l00018"></a>00018 <span class="comment"> write to the Free Software Foundation, Inc.,</span>
<a name="l00019"></a>00019 <span class="comment"> 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.</span>
<a name="l00020"></a>00020 <span class="comment">*/</span>
<a name="l00021"></a>00021 <span class="preprocessor">#ifndef _OP_C_H_</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define _OP_C_H_</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span>
<a name="l00024"></a>00024 <span class="preprocessor">#include "struct.h"</span>
<a name="l00025"></a>00025
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="keyword">typedef</span> <span class="keyword">struct </span>Composantes * Bitmap24B;
<a name="l00029"></a>00029 <span class="keyword">typedef</span> byte * Bitmap256;
<a name="l00030"></a>00030
<a name="l00031"></a>00031
<a name="l00032"></a>00032
<a name="l00034"></a>00034
<a name="l00035"></a><a class="code" href="structTable__conversion.html">00035</a> <span class="keyword">typedef</span> <span class="keyword">struct</span>
<a name="l00036"></a>00036 {
<a name="l00037"></a><a class="code" href="structTable__conversion.html#df7f4629dfa909f1f89f98f5abfd0c4e">00037</a> <span class="keywordtype">int</span> nbb_r; <span class="comment">// Nb de bits de précision sur les rouges</span>
<a name="l00038"></a><a class="code" href="structTable__conversion.html#c4e7a2a81a7215dd14060cfe17f0f13d">00038</a> <span class="keywordtype">int</span> nbb_v; <span class="comment">// Nb de bits de précision sur les verts</span>
<a name="l00039"></a><a class="code" href="structTable__conversion.html#96956ba312181a51517516ed52218b06">00039</a> <span class="keywordtype">int</span> nbb_b; <span class="comment">// Nb de bits de précision sur les bleu</span>
<a name="l00040"></a>00040
<a name="l00041"></a><a class="code" href="structTable__conversion.html#2f0c4f636d3615d2e04c5d2be8542a8a">00041</a> <span class="keywordtype">int</span> rng_r; <span class="comment">// Nb de valeurs sur les rouges (= 1&lt;&lt;nbb_r)</span>
<a name="l00042"></a><a class="code" href="structTable__conversion.html#5f5d466e018eb4903bf0e0f494ad2018">00042</a> <span class="keywordtype">int</span> rng_v; <span class="comment">// Nb de valeurs sur les verts (= 1&lt;&lt;nbb_v)</span>
<a name="l00043"></a><a class="code" href="structTable__conversion.html#97e84f24aef33421319d33a014389e01">00043</a> <span class="keywordtype">int</span> rng_b; <span class="comment">// Nb de valeurs sur les bleus (= 1&lt;&lt;nbb_b)</span>
<a name="l00044"></a>00044
<a name="l00045"></a><a class="code" href="structTable__conversion.html#b12c01d1e04cc09e9481b92fb9804352">00045</a> <span class="keywordtype">int</span> dec_r; <span class="comment">// Coefficient multiplicateur d'accès dans la table (= nbb_v+nbb_b)</span>
<a name="l00046"></a><a class="code" href="structTable__conversion.html#3c70df54017d96961dcedfeb8b889358">00046</a> <span class="keywordtype">int</span> dec_v; <span class="comment">// Coefficient multiplicateur d'accès dans la table (= nbb_b)</span>
<a name="l00047"></a><a class="code" href="structTable__conversion.html#c95bdd426b8350342c58695e66cc88a8">00047</a> <span class="keywordtype">int</span> dec_b; <span class="comment">// Coefficient multiplicateur d'accès dans la table (= 0)</span>
<a name="l00048"></a>00048
<a name="l00049"></a><a class="code" href="structTable__conversion.html#429d4a5ce8dd2e43d2997a430a595b6d">00049</a> <span class="keywordtype">int</span> red_r; <span class="comment">// Coefficient réducteur de traduction d'une couleur rouge (= 8-nbb_r)</span>
<a name="l00050"></a><a class="code" href="structTable__conversion.html#422ff8a260e91d3ba9c17a0dc4526646">00050</a> <span class="keywordtype">int</span> red_v; <span class="comment">// Coefficient réducteur de traduction d'une couleur verte (= 8-nbb_v)</span>
<a name="l00051"></a><a class="code" href="structTable__conversion.html#1525ff44115319b5f49c330fd51ee9bd">00051</a> <span class="keywordtype">int</span> red_b; <span class="comment">// Coefficient réducteur de traduction d'une couleur bleue (= 8-nbb_b)</span>
<a name="l00052"></a>00052
<a name="l00053"></a><a class="code" href="structTable__conversion.html#4cc96face1e6feca340ea35e09cbae97">00053</a> byte * table;
<a name="l00054"></a>00054 } <a class="code" href="structTable__conversion.html">Table_conversion</a>;
<a name="l00055"></a>00055
<a name="l00056"></a>00056
<a name="l00057"></a>00057
<a name="l00059"></a>00059
<a name="l00060"></a><a class="code" href="structTable__occurence.html">00060</a> <span class="keyword">typedef</span> <span class="keyword">struct</span>
<a name="l00061"></a>00061 {
<a name="l00062"></a><a class="code" href="structTable__occurence.html#ec3470b3718e44ef80ee9d279e7f1bd7">00062</a> <span class="keywordtype">int</span> nbb_r; <span class="comment">// Nb de bits de précision sur les rouges</span>
<a name="l00063"></a><a class="code" href="structTable__occurence.html#0c312a3690fd2a3fe5576efd340c59f0">00063</a> <span class="keywordtype">int</span> nbb_v; <span class="comment">// Nb de bits de précision sur les verts</span>
<a name="l00064"></a><a class="code" href="structTable__occurence.html#7c86b80b844f6b5b98532b83cb439f09">00064</a> <span class="keywordtype">int</span> nbb_b; <span class="comment">// Nb de bits de précision sur les bleu</span>
<a name="l00065"></a>00065
<a name="l00066"></a><a class="code" href="structTable__occurence.html#628e462ef68244f989548664a11026d9">00066</a> <span class="keywordtype">int</span> rng_r; <span class="comment">// Nb de valeurs sur les rouges (= 1&lt;&lt;nbb_r)</span>
<a name="l00067"></a><a class="code" href="structTable__occurence.html#ff18c587e286e9eab693d223a0c7087b">00067</a> <span class="keywordtype">int</span> rng_v; <span class="comment">// Nb de valeurs sur les verts (= 1&lt;&lt;nbb_v)</span>
<a name="l00068"></a><a class="code" href="structTable__occurence.html#d2752d88b78b4c6139ae2c6066539749">00068</a> <span class="keywordtype">int</span> rng_b; <span class="comment">// Nb de valeurs sur les bleus (= 1&lt;&lt;nbb_b)</span>
<a name="l00069"></a>00069
<a name="l00070"></a><a class="code" href="structTable__occurence.html#0519a9d86e5db06f3a0b45032e77e22e">00070</a> <span class="keywordtype">int</span> dec_r; <span class="comment">// Coefficient multiplicateur d'accès dans la table (= nbb_v+nbb_b)</span>
<a name="l00071"></a><a class="code" href="structTable__occurence.html#0243e53cef2255cdf88627b2f0581489">00071</a> <span class="keywordtype">int</span> dec_v; <span class="comment">// Coefficient multiplicateur d'accès dans la table (= nbb_b)</span>
<a name="l00072"></a><a class="code" href="structTable__occurence.html#559654030f915c7183521406bc7c0e87">00072</a> <span class="keywordtype">int</span> dec_b; <span class="comment">// Coefficient multiplicateur d'accès dans la table (= 0)</span>
<a name="l00073"></a>00073
<a name="l00074"></a><a class="code" href="structTable__occurence.html#d480f134874e3c0377078e5ae3d0941a">00074</a> <span class="keywordtype">int</span> red_r; <span class="comment">// Coefficient réducteur de traduction d'une couleur rouge (= 8-nbb_r)</span>
<a name="l00075"></a><a class="code" href="structTable__occurence.html#fdff9a02522dd568e312fb09fbeed692">00075</a> <span class="keywordtype">int</span> red_v; <span class="comment">// Coefficient réducteur de traduction d'une couleur verte (= 8-nbb_v)</span>
<a name="l00076"></a><a class="code" href="structTable__occurence.html#2a1b25e84964f6b2fc81c677393a8c26">00076</a> <span class="keywordtype">int</span> red_b; <span class="comment">// Coefficient réducteur de traduction d'une couleur bleue (= 8-nbb_b)</span>
<a name="l00077"></a>00077
<a name="l00078"></a><a class="code" href="structTable__occurence.html#1a00ffbd967d5c0d736994208adfd056">00078</a> <span class="keywordtype">int</span> * table;
<a name="l00079"></a>00079 } <a class="code" href="structTable__occurence.html">Table_occurence</a>;
<a name="l00080"></a>00080
<a name="l00081"></a>00081
<a name="l00082"></a>00082
<a name="l00084"></a>00084
<a name="l00085"></a><a class="code" href="structCluster.html">00085</a> <span class="keyword">typedef</span> <span class="keyword">struct</span>
<a name="l00086"></a>00086 {
<a name="l00087"></a><a class="code" href="structCluster.html#4566203e912034dbc6bbcf6d8c818872">00087</a> <span class="keywordtype">int</span> occurences; <span class="comment">// Nb total d'occurences des couleurs de l'ensemble</span>
<a name="l00088"></a>00088
<a name="l00089"></a>00089 <span class="comment">// Grande couverture</span>
<a name="l00090"></a><a class="code" href="structCluster.html#93dae86d12355da380b510750c0fa07c">00090</a> byte Rmin,Rmax;
<a name="l00091"></a><a class="code" href="structCluster.html#401c1b8f481acaff14b348f37f698beb">00091</a> byte Vmin,Vmax;
<a name="l00092"></a><a class="code" href="structCluster.html#5fc93235c7f585bce006b313d8f250c6">00092</a> byte Bmin,Bmax;
<a name="l00093"></a>00093
<a name="l00094"></a>00094 <span class="comment">// Couverture minimale</span>
<a name="l00095"></a><a class="code" href="structCluster.html#8cf7346ac5f5da89b4fc3dea4cdf7d60">00095</a> byte rmin,rmax;
<a name="l00096"></a><a class="code" href="structCluster.html#454f589dfc393bc91f52d7e164ddd219">00096</a> byte vmin,vmax;
<a name="l00097"></a><a class="code" href="structCluster.html#b8821d7d10c2b760c107cc0475c0a54a">00097</a> byte bmin,bmax;
<a name="l00098"></a>00098
<a name="l00099"></a><a class="code" href="structCluster.html#c2d40128ba52d4b2f075da06721d15bb">00099</a> byte plus_large; <span class="comment">// Composante ayant la plus grande variation (0=Rouge,1=Vert,2=Bleu)</span>
<a name="l00100"></a><a class="code" href="structCluster.html#401095cf67348fd08ce9bf8af41948fe">00100</a> byte r,v,b; <span class="comment">// Couleur synthétisant l'ensemble</span>
<a name="l00101"></a><a class="code" href="structCluster.html#1098c34e562a9b3a8cc9812e4cfcc800">00101</a> byte h; <span class="comment">// Chrominance</span>
<a name="l00102"></a><a class="code" href="structCluster.html#9a132c5ce3af55a985da90b721bbd68f">00102</a> byte l; <span class="comment">// Luminosité</span>
<a name="l00103"></a>00103 } <a class="code" href="structCluster.html">Cluster</a>;
<a name="l00104"></a>00104
<a name="l00105"></a>00105
<a name="l00106"></a>00106
<a name="l00108"></a>00108
<a name="l00109"></a><a class="code" href="structClusterSet.html">00109</a> <span class="keyword">typedef</span> <span class="keyword">struct</span>
<a name="l00110"></a>00110 {
<a name="l00111"></a><a class="code" href="structClusterSet.html#56c7f2614a2cc87c82e8f1f41d4b5382">00111</a> <span class="keywordtype">int</span> nb;
<a name="l00112"></a><a class="code" href="structClusterSet.html#479ce18a3b07828774d6ccd79f020454">00112</a> <span class="keywordtype">int</span> nbmax;
<a name="l00113"></a><a class="code" href="structClusterSet.html#3c3678e394b52bfbac252397476185e2">00113</a> <a class="code" href="structCluster.html">Cluster</a> * clusters;
<a name="l00114"></a>00114 } <a class="code" href="structClusterSet.html">ClusterSet</a>;
<a name="l00115"></a>00115
<a name="l00116"></a>00116
<a name="l00117"></a>00117
<a name="l00119"></a>00119
<a name="l00120"></a><a class="code" href="structDegrade.html">00120</a> <span class="keyword">typedef</span> <span class="keyword">struct</span>
<a name="l00121"></a>00121 {
<a name="l00122"></a><a class="code" href="structDegrade.html#a7876eacf6a7433cf5a0bd66bdb4cce3">00122</a> <span class="keywordtype">int</span> nbcouleurs; <span class="comment">// Nombre de couleurs dans le dégradé</span>
<a name="l00123"></a><a class="code" href="structDegrade.html#470f727305192a33d819df8f40b95cdb">00123</a> <span class="keywordtype">float</span> min; <span class="comment">// Chrominance minimale du dégradé</span>
<a name="l00124"></a><a class="code" href="structDegrade.html#53bb2914eaa3cac989c266a565e7167e">00124</a> <span class="keywordtype">float</span> max; <span class="comment">// Chrominance maximale du dégradé</span>
<a name="l00125"></a><a class="code" href="structDegrade.html#67b136dd81e012a65bcba195c78e59a2">00125</a> <span class="keywordtype">float</span> hue; <span class="comment">// Chrominance moyenne du dégradé</span>
<a name="l00126"></a>00126 } <a class="code" href="structDegrade.html">Degrade</a>;
<a name="l00127"></a>00127
<a name="l00128"></a>00128
<a name="l00129"></a>00129
<a name="l00131"></a>00131
<a name="l00132"></a><a class="code" href="structDegradeSet.html">00132</a> <span class="keyword">typedef</span> <span class="keyword">struct</span>
<a name="l00133"></a>00133 {
<a name="l00134"></a><a class="code" href="structDegradeSet.html#dc4e0054dafc6884df1cd5eb04311f7f">00134</a> <span class="keywordtype">int</span> nb; <span class="comment">// Nombre de dégradés dans l'ensemble</span>
<a name="l00135"></a><a class="code" href="structDegradeSet.html#b25685774fbed6981bdf7011b2d9b9da">00135</a> <span class="keywordtype">int</span> nbmax; <span class="comment">// Nombre maximum de dégradés</span>
<a name="l00136"></a><a class="code" href="structDegradeSet.html#052359ce65c4f93831ad884ae9bf2eb8">00136</a> <a class="code" href="structDegrade.html">Degrade</a> * degrades; <span class="comment">// Les dégradés</span>
<a name="l00137"></a>00137 } <a class="code" href="structDegradeSet.html">DegradeSet</a>;
<a name="l00138"></a>00138
<a name="l00139"></a>00139
<a name="l00140"></a>00140
<a name="l00144"></a>00144
<a name="l00145"></a>00145 <a class="code" href="structTable__conversion.html">Table_conversion</a> * TC_New(<span class="keywordtype">int</span> nbb_r,<span class="keywordtype">int</span> nbb_v,<span class="keywordtype">int</span> nbb_b);
<a name="l00146"></a>00146 <span class="keywordtype">void</span> TC_Delete(<a class="code" href="structTable__conversion.html">Table_conversion</a> * t);
<a name="l00147"></a>00147 byte TC_Get(<a class="code" href="structTable__conversion.html">Table_conversion</a> * t,<span class="keywordtype">int</span> r,<span class="keywordtype">int</span> v,<span class="keywordtype">int</span> b);
<a name="l00148"></a>00148 <span class="keywordtype">void</span> TC_Set(<a class="code" href="structTable__conversion.html">Table_conversion</a> * t,<span class="keywordtype">int</span> r,<span class="keywordtype">int</span> v,<span class="keywordtype">int</span> b,byte i);
<a name="l00149"></a>00149
<a name="l00150"></a>00150 <span class="keywordtype">void</span> RGBtoHSL(<span class="keywordtype">int</span> r, <span class="keywordtype">int</span> v,<span class="keywordtype">int</span> b, byte* h, byte*s, byte* l);
<a name="l00151"></a>00151 <span class="keywordtype">void</span> HSLtoRGB(byte h, byte s, byte l, byte* r, byte* g, byte* b);
<a name="l00152"></a>00152
<a name="l00153"></a>00153
<a name="l00157"></a>00157
<a name="l00158"></a>00158 <span class="keywordtype">void</span> TO_Init(<a class="code" href="structTable__occurence.html">Table_occurence</a> * t);
<a name="l00159"></a>00159 <a class="code" href="structTable__occurence.html">Table_occurence</a> * TO_New(<span class="keywordtype">int</span> nbb_r,<span class="keywordtype">int</span> nbb_v,<span class="keywordtype">int</span> nbb_b);
<a name="l00160"></a>00160 <span class="keywordtype">void</span> TO_Delete(<a class="code" href="structTable__occurence.html">Table_occurence</a> * t);
<a name="l00161"></a>00161 <span class="keywordtype">int</span> TO_Get(<a class="code" href="structTable__occurence.html">Table_occurence</a> * t,<span class="keywordtype">int</span> r,<span class="keywordtype">int</span> v,<span class="keywordtype">int</span> b);
<a name="l00162"></a>00162 <span class="keywordtype">void</span> TO_Set(<a class="code" href="structTable__occurence.html">Table_occurence</a> * t,<span class="keywordtype">int</span> r,<span class="keywordtype">int</span> v,<span class="keywordtype">int</span> b,<span class="keywordtype">int</span> i);
<a name="l00163"></a>00163 <span class="keywordtype">void</span> TO_Inc(<a class="code" href="structTable__occurence.html">Table_occurence</a> * t,<span class="keywordtype">int</span> r,<span class="keywordtype">int</span> v,<span class="keywordtype">int</span> b);
<a name="l00164"></a>00164 <span class="keywordtype">void</span> TO_Compter_occurences(<a class="code" href="structTable__occurence.html">Table_occurence</a> * t,Bitmap24B image,<span class="keywordtype">int</span> taille);
<a name="l00165"></a>00165
<a name="l00166"></a>00166
<a name="l00167"></a>00167
<a name="l00171"></a>00171
<a name="l00172"></a>00172 <span class="keywordtype">void</span> Cluster_Analyser(<a class="code" href="structCluster.html">Cluster</a> * c,<a class="code" href="structTable__occurence.html">Table_occurence</a> * to);
<a name="l00173"></a>00173 <span class="keywordtype">void</span> Cluster_Split(<a class="code" href="structCluster.html">Cluster</a> * c,<a class="code" href="structCluster.html">Cluster</a> * c1,<a class="code" href="structCluster.html">Cluster</a> * c2,<span class="keywordtype">int</span> teinte,<a class="code" href="structTable__occurence.html">Table_occurence</a> * to);
<a name="l00174"></a>00174 <span class="keywordtype">void</span> Cluster_Calculer_teinte(<a class="code" href="structCluster.html">Cluster</a> * c,<a class="code" href="structTable__occurence.html">Table_occurence</a> * to);
<a name="l00175"></a>00175
<a name="l00176"></a>00176
<a name="l00177"></a>00177
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <span class="keywordtype">void</span> CS_Init(<a class="code" href="structClusterSet.html">ClusterSet</a> * cs,<a class="code" href="structTable__occurence.html">Table_occurence</a> * to);
<a name="l00183"></a>00183 <a class="code" href="structClusterSet.html">ClusterSet</a> * CS_New(<span class="keywordtype">int</span> nbmax,<a class="code" href="structTable__occurence.html">Table_occurence</a> * to);
<a name="l00184"></a>00184 <span class="keywordtype">void</span> CS_Delete(<a class="code" href="structClusterSet.html">ClusterSet</a> * cs);
<a name="l00185"></a>00185 <span class="keywordtype">void</span> CS_Get(<a class="code" href="structClusterSet.html">ClusterSet</a> * cs,<a class="code" href="structCluster.html">Cluster</a> * c);
<a name="l00186"></a>00186 <span class="keywordtype">void</span> CS_Set(<a class="code" href="structClusterSet.html">ClusterSet</a> * cs,<a class="code" href="structCluster.html">Cluster</a> * c);
<a name="l00187"></a>00187 <span class="keywordtype">void</span> CS_Generer(<a class="code" href="structClusterSet.html">ClusterSet</a> * cs,<a class="code" href="structTable__occurence.html">Table_occurence</a> * to);
<a name="l00188"></a>00188 <span class="keywordtype">void</span> CS_Calculer_teintes(<a class="code" href="structClusterSet.html">ClusterSet</a> * cs,<a class="code" href="structTable__occurence.html">Table_occurence</a> * to);
<a name="l00189"></a>00189 <span class="keywordtype">void</span> CS_Generer_TC_et_Palette(<a class="code" href="structClusterSet.html">ClusterSet</a> * cs,<a class="code" href="structTable__conversion.html">Table_conversion</a> * tc,<span class="keyword">struct</span> Composantes * palette);
<a name="l00190"></a>00190
<a name="l00194"></a>00194
<a name="l00195"></a>00195 <span class="keywordtype">void</span> DS_Init(<a class="code" href="structDegradeSet.html">DegradeSet</a> * ds,<a class="code" href="structClusterSet.html">ClusterSet</a> * cs);
<a name="l00196"></a>00196 <a class="code" href="structDegradeSet.html">DegradeSet</a> * DS_New(<a class="code" href="structClusterSet.html">ClusterSet</a> * cs);
<a name="l00197"></a>00197 <span class="keywordtype">void</span> DS_Delete(<a class="code" href="structDegradeSet.html">DegradeSet</a> * ds);
<a name="l00198"></a>00198 <span class="keywordtype">void</span> DS_Generer(<a class="code" href="structDegradeSet.html">DegradeSet</a> * ds,<a class="code" href="structClusterSet.html">ClusterSet</a> * cs);
<a name="l00199"></a>00199
<a name="l00200"></a>00200
<a name="l00201"></a>00201
<a name="l00202"></a>00202 <span class="comment">// Convertie avec le plus de prcision possible une image 24b en 256c</span>
<a name="l00203"></a>00203 <span class="comment">// Renvoie s'il y a eu une erreur ou pas..</span>
<a name="l00204"></a>00204 <span class="keywordtype">int</span> Convert_bitmap_24B_to_256(Bitmap256 Dest,Bitmap24B Source,<span class="keywordtype">int</span> largeur,<span class="keywordtype">int</span> hauteur,<span class="keyword">struct</span> Composantes * palette);
<a name="l00205"></a>00205
<a name="l00206"></a>00206
<a name="l00207"></a>00207
<a name="l00208"></a>00208 <span class="preprocessor">#endif</span>
</pre></div></div>
<hr size="1"><address style="text-align: right;"><small>Generated on Fri Mar 6 16:29:55 2009 for GrafX2 by&nbsp;
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.8 </small></address>
</body>
</html>