plot/0000755000175000017500000000000011652304773013044 5ustar carandraugcarandraugplot/inst/0000755000175000017500000000000011652305002014003 5ustar carandraugcarandraugplot/inst/gplot3.m0000644000175000017500000000452611652277344015421 0ustar carandraugcarandraug## Copyright (C) 2010 Soren Hauberg ## ## This program is free software; you can redistribute it and/or modify it ## under the terms of the GNU General Public License as published by ## the Free Software Foundation; either version 3 of the License, or (at ## your option) any later version. ## ## This program is distributed in the hope that it will be useful, but ## WITHOUT ANY WARRANTY; without even the implied warranty of ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ## General Public License for more details. ## ## You should have received a copy of the GNU General Public License ## along with this program; see the file COPYING. If not, see ## . ## -*- texinfo -*- ## @deftypefn {Function File} {} gplot3 (@var{a}, @var{xyz}) ## @deftypefnx {Function File} {} gplot3 (@var{a}, @var{xyz}, @var{line_style}) ## @deftypefnx {Function File} {[@var{x}, @var{y}, @var{z}] =} gplot3 (@var{a}, @var{xyz}) ## Plot a 3-dimensional graph defined by @var{A} and @var{xyz} in the ## graph theory sense. @var{A} is the adjacency matrix of the array to ## be plotted and @var{xy} is an @var{n}-by-3 matrix containing the ## coordinates of the nodes of the graph. ## ## The optional parameter @var{line_style} defines the output style for ## the plot. Called with no output arguments the graph is plotted ## directly. Otherwise, return the coordinates of the plot in @var{x} ## and @var{y}. ## @seealso{gplot, treeplot, etreeplot, spy} ## @end deftypefn function [x, y, z] = gplot3 (A, xyz, varargin) if (nargin < 2) print_usage (); endif if (length (varargin) == 0) varargin {1} = "-"; endif [i, j] = find (A); xcoord = [xyz(i,1), xyz(j,1), NA(length(i),1)]'(:); ycoord = [xyz(i,2), xyz(j,2), NA(length(i),1)]'(:); zcoord = [xyz(i,3), xyz(j,3), NA(length(i),1)]'(:); if (nargout == 0) plot3 (xcoord, ycoord, zcoord, varargin {:}); else x = xcoord; y = ycoord; z = zcoord; endif endfunction %!demo %! ## Define adjacency matrix of a graph with 5 nodes %! A = [0, 1, 0, 0, 1; %! 1, 0, 1, 1, 1; %! 0, 1, 0, 1, 1; %! 0, 1, 1, 0, 1; %! 1, 1, 1, 1, 0 ]; %! %! ## Define 3D points of the nodes %! xyz = [2, 1, 3/2; %! 3, 2, 2; %! 8/3, 3, 1; %! 5/3, 3, 1; %! 1, 2, 2 ]; %! %! ## Plot the 3D graph %! gplot3 (A, xyz); plot/inst/plotdecimate.m0000644000175000017500000001130211652263620016641 0ustar carandraugcarandraug## Copyright (C) 2006 Francesco Potort́ ## ## This program is free software; you can redistribute it and/or modify ## it under the terms of the GNU General Public License as published by ## the Free Software Foundation; either version 2 of the License, or ## (at your option) any later version. ## ## This program is distributed in the hope that it will be useful, ## but WITHOUT ANY WARRANTY; without even the implied warranty of ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ## GNU General Public License for more details. ## ## You should have received a copy of the GNU General Public License ## along with this program; if not, write to the Free Software Foundation, ## Inc., 51 Franklin Street, 5th Floor, Boston, MA 02110-1301, USA. ## -*- texinfo -*- ## @deftypefn {Function File} {} plotdecimate (@var{P}) ## @deftypefnx {Function File} {} plotdecimate (@var{P}, @var{so}) ## @deftypefnx {Function File} {} plotdecimate (@var{P}, @var{so}, @var{res}) ## Optimise plot data by removing redundant points and segments ## ## The first parameter @var{P} is a two-column matrix to be plotted as X and ## Y coordinates. The second optional argument @var{so} disables segment ## optimisation when set to @var{false} (default is @var{true}). The third ## optional argument @var{res} is the size of the largest error on the plot: ## if it is a scalar, it is meant relative to the range of X and Y values ## (default 1e-3); if it is a 2x1 array, it contains the absolute errors for ## X and Y. Returns a two-column matrix containing a subset of the rows of ## @var{P}. A line plot of @var{P} has the same appearance as a line plot of ## the output, with errors smaller than @var{res}. When creating point ## plots, set @var{so} to @var{false}. ## @end deftypefn function C = plotdecimate (P, so, res) if (!ismatrix(P) || columns(P) != 2) error("P must be a matrix with two columns"); endif if (nargin < 2) so = true; # do segment optimisation endif if (nargin < 3) res = 1e-3; # default resolution is 1000 dots/axis endif ## Slack: admissible error on coordinates on the output plot if (isscalar(res)) if (res <= 0) error("res must be positive"); endif E = range(P)' * res; # build error vector using range of data elseif (ismatrix(res)) if (!all(size(res) == [2 1]) || any(res <= 0)) error("res must be a 2x1 matrix with positive values"); endif E = res; # take error vector as it is else error("res should be a scalar or matrix"); endif if (rows(P) < 3) C = P; return; # nothing to do endif P ./= repmat(E',rows(P),1); # normalize P rot = [0,-1;1,0]; # rotate a vector pi/4 anticlockwise ## Iteratively remove points too near to the previous point while (1) V = [true; sumsq(diff(P),2) > 1]; # points far from the previous ones if (all(V)) break; endif V = [true; diff(V) >= 0]; # identify the sequence leaders P = P(V,:); # remove them endwhile ## Remove points laying near to a segment: for each segment R->S, build a ## unitary-lenght projection vector D perpendicular to R->S, and project ## R->T over D to compute the distance ot T from R->S. if (so) # segment optimisation ## For each segment, r and s are its extremes r = 1; R = P(1,:)'; # start of segment s = 2; S = P(2,:)'; # end of the segment rebuild = true; # build first projection vector for t = 3:rows(P) if (rebuild) # build projection vector D = rot*(S-R)/sqrt(sumsq(S-R)); # projection vector for distance rebuild = false; # keep current projection vector endif T = P(t,:)'; # next point if (abs(sum((T-R).*D)) < 1 # T is aligned && sum((T-R).*(S-R)) > 0) # going forward V(s) = false; # do not plot s else # set a new segment r = s; R = S; # new start of segment rebuild = true; # rebuild projection vector endif s = t; S = T; # new end of segment endfor endif C = P(V,:) .* repmat(E',sum(V),1); # denormalize P endfunction %!test %! x = [ 0 1 2 3 4 8 8 8 8 8 9 ]'; %! y = [ 0 1 1 1 1 1 1 2 3 4 5 ]'; %! %! x1 = [0 1 8 8 9]'; %! y1 = [0 1 1 4 5]'; %! # optimised for segment plot %! %! x2 = [ 0 1 2 3 4 8 8 8 8 9 ]'; %! y2 = [ 0 1 1 1 1 1 2 3 4 5 ]'; %! # double points removed %! %! P = [x,y]; %! # Original %! P1 = [x1, y1]; %! # optimised segments %! P2 = [x2, y2]; %! # double points removed %! %! assert(plotdecimate(P), P1); %! assert(plotdecimate(P, false), P2); plot/inst/tricontour.m0000644000175000017500000001014411652274745016414 0ustar carandraugcarandraug## Copyright (C) 2008 Andreas Stahel ## ## This program is free software; you can redistribute it and/or modify ## it under the terms of the GNU General Public License as published by ## the Free Software Foundation; either version 2 of the License, or ## (at your option) any later version. ## ## This program is distributed in the hope that it will be useful, ## but WITHOUT ANY WARRANTY; without even the implied warranty of ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ## GNU General Public License for more details. ## ## You should have received a copy of the GNU General Public License ## along with this program; if not, write to the Free Software ## Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA ## 02110-1301 USA ## -*- texinfo -*- ## @deftypefn {Function File} {} tricontour (@var{tri}, @var{x}, @var{y}, @var{z}, @var{levels}) ## @deftypefnx {Function File} {} tricontour (@var{tri}, @var{x}, @var{y}, @var{z}, @var{levels}, @var{linespec}) ## Plot level curves for the values of @code{@var{z}} on a triangular mesh in 2D. ## ## The variable @var{tri} is the triangular meshing of the points ## @code{(@var{x}, @var{y})} which is returned from @code{delaunay}. The ## variable @var{levels} is a vector with the values of the countour levels. If ## @var{levels} is a scalar, then it corresponds to the number of ## level curves to be drawn. If exactly one level curve is desired, list ## the level twice in the vector @var{levels}. ## ## If given, @var{linespec} determines the properties to use for the ## lines. ## ## The output argument @var{h} is the graphic handle to the plot. ## @seealso{plot, trimesh, delaunay} ## @end deftypefn function h = tricontour (tri, x, y, z, levels, varargin) if (nargin < 5) print_usage (); endif if isscalar(levels); dom=[min(z),max(z)]; dom=mean(dom)+0.99*(dom-mean(dom)); levels=linspace(dom(1),dom(2),levels); endif levels=sort(levels); lmin=levels(1); lmax=levels(length(levels)); pData=[]; %% no preallocation %% pData=zeros(12000,2); %% preallocation pPoints=0; for el=1:length(tri) values=[z(tri(el,1)),z(tri(el,2)),z(tri(el,3))]; minval=min(values); maxval=max(values); locallevel=levels(minval<=levels+eps); # select the levels to be plotted if size(locallevel)>0 locallevel=locallevel(locallevel<=maxval+eps); endif for level=locallevel points=zeros(1,2); npoints=1; dl=values-level; if (abs(dl(1))<=10*eps) points(npoints,:)=[x(tri(el,1)),y(tri(el,1))];npoints++;endif if (abs(dl(2))<=10*eps) points(npoints,:)=[x(tri(el,2)),y(tri(el,2))];npoints++;endif if (abs(dl(3))<=10*eps) points(npoints,:)=[x(tri(el,3)),y(tri(el,3))];npoints++;endif if (npoints<=2) if ((dl(1)*dl(2)) < 0) # intersection between 1st and 2nd point points(npoints,:)= ( dl(2)*[x(tri(el,1)),y(tri(el,1))]... -dl(1)*[x(tri(el,2)),y(tri(el,2))])/(dl(2)-dl(1)); npoints++; endif if ((dl(1)*dl(3)) < 0) # intersection between 1st and 3rd point points(npoints,:)= ( dl(3)*[x(tri(el,1)),y(tri(el,1))]... -dl(1)*[x(tri(el,3)),y(tri(el,3))])/(dl(3)-dl(1)); npoints++; endif if ((dl(3)*dl(2)) < 0) # intersection between 2nd and 3rd point points(npoints,:)= ( dl(2)*[x(tri(el,3)),y(tri(el,3))]... -dl(3)*[x(tri(el,2)),y(tri(el,2))])/(dl(2)-dl(3)); npoints++; endif endif pData=[pData;points; NaN,NaN ]; %% no preallocation %% pData(pPoints+1:pPoints+npoints,1:2)=[points; NaN,NaN ]; %% preallocation pPoints += npoints; endfor # level endfor # el pData=pData(1:pPoints-1,:); if (nargout>0) h= plot(pData(:,1),pData(:,2),varargin(:)); else plot(pData(:,1),pData(:,2),varargin(:)); endif endfunction %!demo %! rand ('state', 2) %! x = rand (100, 1)-0.5; %! y = rand (100, 1)-0.5; %! z= (x.*y); %! tri = delaunay (x, y); %! tricontour (tri, x, y, z, [-0.25:0.05:0.25]); %! axis equal %! grid on plot/inst/dxfwrite.m0000644000175000017500000001052411652300414016021 0ustar carandraugcarandraug## Copyright (C) 2004 Patrick Labbe ## Copyright (C) 2004 Laurent Mazet ## Copyright (C) 2005 Larry Doolittle ## ## This program is free software; you can redistribute it and/or modify ## it under the terms of the GNU General Public License as published by ## the Free Software Foundation; either version 2 of the License, or ## (at your option) any later version. ## ## This program is distributed in the hope that it will be useful, ## but WITHOUT ANY WARRANTY; without even the implied warranty of ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ## GNU General Public License for more details. ## ## You should have received a copy of the GNU General Public License ## along with this program; If not, see . ## -*- texinfo -*- ## @deftypefn {Function File} {@var{nb} =} dxfwrite (@var{filename}, @var{pl}, @dots{}) ## ## Write @var{filename} as a DXF file. Polyline @var{pl} must be defined as ## matrix of 1, 2 or 3 columns respectively for x, y and z coordinates. The ## number of polyline (@var{nb}) or 0 is returned. ## @end deftypefn function [nb] = dxfwrite (filename, varargin) ## Check file name sn = split(filename, "."); if !strcmp(tolower(deblank(sn(end,:))), "dxf") filename = [filename, ".dxf"]; endif ## Check arguments nb = 0; if nargin <= 1 usage("dxfwrite = (filename, pl, ...)"); return; endif ## Open file fid = fopen (filename, "wt"); if fid <= 0 error("error opening file \"%s\"\n", filename); endif ## Format string FMT = sprintf("%%.%dg", save_precision); ## Header declarations fprintf (fid, ["0\nSECTION\n", "2\nHEADER\n"]); ## DXF version fprintf (fid, ["9\n$ACADVER\n", "1\nAC1009\n"]); ## AutoCAD R11 ## End of headers fprintf (fid, "0\nENDSEC\n"); ## Table declarations fprintf (fid, ["0\nSECTION\n", "2\nTABLES\n"]); ## Line type declarations fprintf (fid, ["0\nTABLE\n", "2\nLTYPE\n"]); ## Number of line types fprintf (fid, "70\n1\n"); ## New line type fprintf (fid, "0\nLTYPE\n"); ## Line type name fprintf (fid, "2\nCONTINUOUS\n"); ## Standard flags fprintf (fid, "70\n0\n"); ## Optimal for AutoCAD ## Descriptive text for linetype fprintf (fid, "3\nContinuous line\n"); ## Alignment code fprintf (fid, "72\n65\n"); ## the ASCII code for A ## Number of linetype elements fprintf (fid, "73\n0\n"); ## Total pattern length fprintf (fid, "40\n0\n"); ## Pattern definition ## ??? ## End of line types fprintf (fid, "0\nENDTAB\n"); ## Layers declarations fprintf (fid, ["0\nTABLE\n", "2\nLAYER\n"]); ## Number of layers fprintf (fid, "70\n%d\n", nargin-1); nb = 0; for i=1:nargin-1 nb++; ## New layer fprintf (fid, "0\nLAYER\n"); ## Layer name fprintf (fid, "2\nCurve%d\n", nb); ## Standard flags fprintf (fid, "70\n0\n"); ## Optimal for AutoCAD ## Line type fprintf (fid, "6\nCONTINUOUS\n"); ## Color number fprintf (fid, "62\n%d\n", nb); endfor ## End of layers fprintf (fid, "0\nENDTAB\n"); ## End of tables fprintf (fid, "0\nENDSEC\n"); ## Entity declarations fprintf (fid, ["0\nSECTION\n", "2\nENTITIES\n"]); nb = 0; for i=1:nargin-1 tmp_pl = varargin{1+nb++}; ## Check curve dimension (1, 2 or 3) if columns(tmp_pl) <= 3 pl = zeros(rows(tmp_pl), 3); pl(:, 1:columns(tmp_pl)) = tmp_pl; else warning ("%dth entry skipped (more than 3 dimensions)", nb); continue; endif ## Check if the curve is closed closed = false; if pl(1, :) == pl(rows(pl), :) closed = true; pl = pl([1:rows(pl)-1], :); endif ## New polyline fprintf (fid, "0\nPOLYLINE\n"); ## Layer name fprintf (fid, "8\nCurve%d\n", nb); ## Line type name fprintf (fid, "6\nCONTINUOUS\n"); ## Color number??? fprintf (fid, "66\n%d\n", nb); ## Standard flags fprintf (fid, "70\n%d\n", closed); ## Layer specification layspec = sprintf("8\nCurve%d\n", nb); ## List of vertex fprintf(fid, ["0\nVERTEX\n", layspec, \ "10\n",FMT,"\n", "20\n",FMT,"\n", "30\n",FMT,"\n"], pl.'); ## End of polyline fprintf(fid, "0\nSEQEND\n"); endfor ## End of entities fprintf(fid, "0\nENDSEC\n"); ## End of file fprintf(fid, "0\nEOF\n"); ## Close file fclose(fid); endfunction plot/inst/tics.m0000644000175000017500000000275711652304750015147 0ustar carandraugcarandraug## Copyright (C) 2002 Paul Kienzle ## Copyright (C) 2005 Dmitri A. Sergatskov ## Copyright (C) 2007 Russel Valentine ## Copyright (C) 2007 Peter Gustafson ## This program is in the public domain ## -*- texinfo -*- ## @deftypefn {Function File} {} tics (@var{axis}, [@var{pos1}, @var{pos2}, @dots{}], [@var{lab1}, @var{lab2}, @dots{}],) ## Explicitly set the tic positions and labels for the given axis. ## ## @var{axis} must be 'x', 'y' or 'z'. ## ## If no positions or labels are given, then restore the default. ## If positions are given but no labels, use those positions with the ## normal labels. If positions and labels are given, each position ## labeled with the corresponding row from the label matrix. ## ## @end deftypefn function tics (axis, pos, lab) if ( nargin < 1 || nargin > 3 ) print_usage; endif t = lower (axis); if (t ~= "x" && t ~= "y" && t ~= "z") error ("First input argument must be one of 'x', 'y' or 'z'"); endif if (nargin == 1) set (gca(), [t, "tick"], []); set (gca(), [t, "tickmode"], "auto"); set (gca(), [t, "ticklabel"], ""); set (gca(), [t, "ticklabelmode"], "auto"); elseif (nargin == 2) set (gca(), [t, "tick"], pos); set (gca(), [t, "ticklabel"], ""); set (gca(), [t, "ticklabelmode"], "auto"); elseif (nargin == 3) set (gca(), [t, "tick"], pos); set (gca(), [t, "ticklabel"], lab); else ## we should never get here anyway print_usage; endif endfunction plot/inst/zoom.m0000644000175000017500000000036311652303476015164 0ustar carandraugcarandraug## Copyright (C) 2004 Paul Kienzle ## This program is in the public domain ## -*- texinfo -*- ## @deftypefn {Function File} {} zoom ## Compatibility function; does nothing. ## @end deftypefn function zoom endfunction plot/inst/hist2d.m0000644000175000017500000000246011652303476015375 0ustar carandraugcarandraug## Copyright (C) 2006 Paul Kienzle ## This program is in the public domain ## -*- texinfo -*- ## @deftypefn {Function File} {[@var{counts}, @var{xbins}, @var{ybins}] =} hist2d ([@var{x}, @var{y}], @var{xbins}, @var{ybins}, @var{norm}) ## Produce a 2D histogram. ## ## Points xi,yi are stored in a 2-column array. ## If ybins is missing, use xbins. ## If bins is a scalar, use that many bins. ## If bins is a vector, it represents bin edges. ## ## @end deftypefn function [ret_counts, xbins, ybins] = hist2d(M,xbins,ybins) if nargin < 1 && nargin > 3 print_usage end lo = min(M); hi = max(M); if nargin == 1 ybins = xbins = 10; elseif nargin == 2 ybins = xbins; endif # If n bins, find centers based on n+1 bin edges if isscalar(xbins) xbins = linspace(lo(1),hi(1),xbins+1); xbins = (xbins(1:end-1)+xbins(2:end))/2; end if isscalar(ybins) ybins = linspace(lo(2),hi(2),ybins+1); ybins = (ybins(1:end-1)+ybins(2:end))/2; end xcut = (xbins(1:end-1)+xbins(2:end))/2; ycut = (ybins(1:end-1)+ybins(2:end))/2; xidx = lookup(xcut,M(:,1))+1; yidx = lookup(ycut,M(:,2))+1; counts = sparse(xidx,yidx,1,length(xbins),length(ybins),'sum'); if nargout ret_counts = full(counts'); else mesh(xbins,ybins,full(counts')); end endfunction plot/DESCRIPTION0000644000175000017500000000043511652300451014541 0ustar carandraugcarandraugName: Plot Version: 1.1.0 Date: 2011-10-27 Author: Various Authors Maintainer: The Octave Community Title: Plotting. Description: Additional ploting tools for Octave. Categories: Plotting Depends: octave (>= 3.2) Autoload: yes License: GPL version 2 or later Url: http://octave.sf.net plot/COPYING0000644000175000017500000004307710751613601014102 0ustar carandraugcarandraug GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, see . Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Library General Public License instead of this License.