You can subscribe to this list here.
2001 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}
(10) 
_{Aug}
(5) 
_{Sep}
(3) 
_{Oct}
(41) 
_{Nov}
(41) 
_{Dec}
(33) 

2002 
_{Jan}
(75) 
_{Feb}
(10) 
_{Mar}
(170) 
_{Apr}
(174) 
_{May}
(66) 
_{Jun}
(11) 
_{Jul}
(10) 
_{Aug}
(44) 
_{Sep}
(73) 
_{Oct}
(28) 
_{Nov}
(139) 
_{Dec}
(52) 
2003 
_{Jan}
(35) 
_{Feb}
(93) 
_{Mar}
(62) 
_{Apr}
(10) 
_{May}
(55) 
_{Jun}
(70) 
_{Jul}
(37) 
_{Aug}
(16) 
_{Sep}
(56) 
_{Oct}
(31) 
_{Nov}
(57) 
_{Dec}
(83) 
2004 
_{Jan}
(85) 
_{Feb}
(67) 
_{Mar}
(27) 
_{Apr}
(37) 
_{May}
(75) 
_{Jun}
(85) 
_{Jul}
(160) 
_{Aug}
(68) 
_{Sep}
(104) 
_{Oct}
(25) 
_{Nov}
(39) 
_{Dec}
(23) 
2005 
_{Jan}
(10) 
_{Feb}
(45) 
_{Mar}
(43) 
_{Apr}
(19) 
_{May}
(108) 
_{Jun}
(31) 
_{Jul}
(41) 
_{Aug}
(23) 
_{Sep}
(65) 
_{Oct}
(58) 
_{Nov}
(44) 
_{Dec}
(54) 
2006 
_{Jan}
(96) 
_{Feb}
(27) 
_{Mar}
(69) 
_{Apr}
(59) 
_{May}
(67) 
_{Jun}
(35) 
_{Jul}
(13) 
_{Aug}
(461) 
_{Sep}
(160) 
_{Oct}
(399) 
_{Nov}
(32) 
_{Dec}
(72) 
2007 
_{Jan}
(316) 
_{Feb}
(305) 
_{Mar}
(318) 
_{Apr}
(54) 
_{May}
(194) 
_{Jun}
(173) 
_{Jul}
(282) 
_{Aug}
(91) 
_{Sep}
(227) 
_{Oct}
(365) 
_{Nov}
(168) 
_{Dec}
(18) 
2008 
_{Jan}
(71) 
_{Feb}
(111) 
_{Mar}
(155) 
_{Apr}
(173) 
_{May}
(70) 
_{Jun}
(67) 
_{Jul}
(55) 
_{Aug}
(83) 
_{Sep}
(32) 
_{Oct}
(68) 
_{Nov}
(80) 
_{Dec}
(29) 
2009 
_{Jan}
(46) 
_{Feb}
(18) 
_{Mar}
(95) 
_{Apr}
(76) 
_{May}
(140) 
_{Jun}
(98) 
_{Jul}
(84) 
_{Aug}
(123) 
_{Sep}
(94) 
_{Oct}
(131) 
_{Nov}
(142) 
_{Dec}
(125) 
2010 
_{Jan}
(128) 
_{Feb}
(158) 
_{Mar}
(172) 
_{Apr}
(134) 
_{May}
(94) 
_{Jun}
(84) 
_{Jul}
(32) 
_{Aug}
(127) 
_{Sep}
(167) 
_{Oct}
(109) 
_{Nov}
(69) 
_{Dec}
(78) 
2011 
_{Jan}
(39) 
_{Feb}
(58) 
_{Mar}
(52) 
_{Apr}
(47) 
_{May}
(56) 
_{Jun}
(76) 
_{Jul}
(55) 
_{Aug}
(54) 
_{Sep}
(165) 
_{Oct}
(255) 
_{Nov}
(328) 
_{Dec}
(263) 
2012 
_{Jan}
(82) 
_{Feb}
(147) 
_{Mar}
(400) 
_{Apr}
(216) 
_{May}
(209) 
_{Jun}
(160) 
_{Jul}
(86) 
_{Aug}
(141) 
_{Sep}
(156) 
_{Oct}
(6) 
_{Nov}

_{Dec}

2015 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}
(1) 
_{Aug}

_{Sep}
(1) 
_{Oct}

_{Nov}
(1) 
_{Dec}
(2) 
2016 
_{Jan}

_{Feb}
(2) 
_{Mar}
(2) 
_{Apr}
(1) 
_{May}
(1) 
_{Jun}
(2) 
_{Jul}
(1) 
_{Aug}
(1) 
_{Sep}

_{Oct}

_{Nov}
(1) 
_{Dec}

S  M  T  W  T  F  S 






1
(5) 
2
(2) 
3
(4) 
4
(6) 
5
(10) 
6
(6) 
7
(5) 
8
(8) 
9

10

11
(11) 
12

13

14
(2) 
15
(1) 
16

17

18
(5) 
19
(1) 
20
(8) 
21
(6) 
22
(13) 
23
(7) 
24
(2) 
25
(12) 
26
(4) 
27
(22) 
28
(12) 
29
(12) 
30
(9) 
From: David Bateman <adb014@us...>  20070625 20:20:34

Update of /cvsroot/octave/octaveforge/extra/triangular/src In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv16027/triangular/src Added Files: Makefile uppertri.cc Log Message: Add example triangular matrix type to document the procedure of adding user types to Octave  NEW FILE: Makefile  PROGS = $(patsubst %.cc,%.oct,$(wildcard *.cc)) all: $(PROGS) $(PROGS): Makefile %.oct: %.cc mkoctfile $< clean: ; $(RM) *.o core octavecore *.oct *~  NEW FILE: uppertri.cc  #include <octave/oct.h> #include <octave/ovremat.h> #include <octave/ovscalar.h> #include <octave/ops.h> #include <octave/ovtypeinfo.h> static octave_base_value * default_numeric_conversion_function (const octave_base_value& a); class octave_triangular_matrix : public octave_matrix { public: enum tri_type{ Upper = 0, Lower = 1 }; octave_triangular_matrix (void) : octave_matrix(Matrix (0,0)) { }; octave_triangular_matrix (const Matrix &m, tri_type t = Upper) : octave_matrix (m), tri (t) { octave_idx_type nr = m.rows (); octave_idx_type nc = m.cols (); if (tri == Upper) for (octave_idx_type j = 0; j < nc; j++) for (octave_idx_type i = j + 1; i < nr; i++) matrix (i, j) = 0; else for (octave_idx_type j = 0; j < nc; j++) for (octave_idx_type i = 0; i < j; i++) matrix (i, j) = 0; } octave_triangular_matrix (const octave_triangular_matrix& T) : octave_matrix (T), tri (T.tri) { }; ~octave_triangular_matrix (void) { }; octave_base_value *clone (void) const { return new octave_triangular_matrix (*this); } octave_base_value *empty_clone (void) const { return new octave_triangular_matrix (); } octave_value subsref (const std::string &type, const std::list<octave_value_list>& idx) { octave_value retval; int skip = 1; switch (type[0]) { case '(': retval = do_index_op (idx.front (), true); break; case '.': retval = dotref (idx.front ())(0); break; case '{': error ("%s cannot be indexed with %c", type_name().c_str(), type[0]); break; default: panic_impossible (); } if (! error_state) retval = retval.next_subsref (type, idx, skip); return retval; } octave_value_list dotref (const octave_value_list& idx) { octave_value_list retval; std::string nm = idx(0).string_value (); if (nm == "type") if (isupper ()) retval = octave_value ("Upper"); else retval = octave_value ("Lower"); else error ("%s can indexed with .%s", type_name().c_str(), nm.c_str()); return retval; } // Need to define as map so tha "a.type = ..." can work bool is_map (void) const { return true; } octave_value subsasgn (const std::string& type, const std::list<octave_value_list>& idx, const octave_value& rhs) { octave_value retval; switch (type[0]) { case '(': { if (type.length () == 1) retval = numeric_assign (type, idx, rhs); else if (type.length () == 2) { std::list<octave_value_list>::const_iterator p = idx.begin (); octave_value_list key_idx = *++p; std::string key = key_idx(0).string_value (); if (key == "type") error ("use 'uppertri' or 'lowertri' to set type"); else error ("%s can indexed with .%s", type_name().c_str(), key.c_str()); } else error ("in indexed assignment of %s, illegal assignment", type_name().c_str ()); } break; case '.': { octave_value_list key_idx = idx.front (); std::string key = key_idx(0).string_value (); if (key == "type") error ("use 'uppertri' or 'lowertri' to set matrix type"); else error ("%s can indexed with .%s", type_name().c_str(), key.c_str()); } break; case '{': error ("%s cannot be indexed with %c", type_name().c_str (), type[0]); break; default: panic_impossible (); } return retval; } octave_base_value *try_narrowing_conversion (void) { octave_base_value *retval = 0; if (matrix.nelem () == 1) retval = new octave_scalar (matrix (0, 0)); else if (tri == Upper) { octave_idx_type nr = matrix.rows (); octave_idx_type nc = matrix.cols (); for (octave_idx_type j = 0; j < nc; j++) for (octave_idx_type i = j + 1; i < nr; i++) if (matrix.elem (i, j) != 0.0) { retval = new octave_matrix (matrix); break; } } else { octave_idx_type nc = matrix.cols (); for (octave_idx_type j = 0; j < nc; j++) for (octave_idx_type i = 0; i < j; i++) if (matrix.elem (i, j) != 0.0) { retval = new octave_matrix (matrix); break; } } return retval; } type_conv_fcn numeric_conversion_function (void) const { return default_numeric_conversion_function; } bool isupper (void) const { return (tri == Upper); } bool islower (void) const { return (tri == Lower); } tri_type tritype (void) const { return tri; } void assign (const octave_value_list& idx, const Matrix& rhs) { octave_matrix::assign(idx, rhs); } octave_triangular_matrix transpose (void) const { return octave_triangular_matrix (this>matrix_value().transpose (), (tri == Upper ? Lower : Upper)); } void print (std::ostream& os, bool pr_as_read_syntax = false) const { octave_matrix::print (os, pr_as_read_syntax); os << (tri == Upper ? "Upper" : "Lower") << " Triangular"; newline(os); } private: tri_type tri; DECLARE_OCTAVE_ALLOCATOR DECLARE_OV_TYPEID_FUNCTIONS_AND_DATA }; static octave_base_value * default_numeric_conversion_function (const octave_base_value& a) { CAST_CONV_ARG (const octave_triangular_matrix&); return new octave_matrix (v.array_value ()); } DEFINE_OCTAVE_ALLOCATOR (octave_triangular_matrix); DEFINE_OV_TYPEID_FUNCTIONS_AND_DATA (octave_triangular_matrix, "triangular matrix", "double"); DEFCONV (octave_triangular_conv, octave_triangular_matrix, matrix) { CAST_CONV_ARG (const octave_triangular_matrix &); return new octave_matrix (v.matrix_value ()); } DEFUNOP (uplus, triangular_matrix) { CAST_UNOP_ARG (const octave_triangular_matrix&); std::cerr << "here\n"; return new octave_triangular_matrix (v); } DEFUNOP (uminus, triangular_matrix) { CAST_UNOP_ARG (const octave_triangular_matrix&); return new octave_triangular_matrix ( v.matrix_value (), v.tritype ()); } DEFUNOP (transpose, triangular_matrix) { CAST_UNOP_ARG (const octave_triangular_matrix&); return new octave_triangular_matrix (v.transpose ()); } DEFBINOP(ldiv, triangular_matrix, matrix) { CAST_BINOP_ARGS (const octave_triangular_matrix&, const octave_matrix&); const Matrix m = v1.matrix_value (); const Matrix b = v2.matrix_value (); octave_idx_type nr = m.rows (); octave_idx_type nc = m.cols (); octave_idx_type b_nc = b.cols (); Matrix retval; if (nr != nc) error ("matrix must be square"); else if (nr == 0  nc == 0  nr != b.rows ()) error ("matrix dimension mismatch solution of linear equations"); else { retval = b; if (v1.isupper ()) { for (octave_idx_type j = 0; j < b_nc; j++) for (octave_idx_type k = nr  1; k >= 0; k) { if (retval (k, j) != 0.) { retval (k, j) /= m (k, k); for (octave_idx_type i = 0; i < k; i++) retval (i, j) = retval (k, j) * m (i, k); } } } else { for (octave_idx_type j = 0; j < b_nc; j++) for (octave_idx_type k = 0; k < nr; k++) { if (retval (k, j) != 0.) { retval (k, j) /= m (k, k); for (octave_idx_type i = k + 1; i < nr; i++) retval (i, j) = retval (k, j) * m (i, k); } } } } return retval; } DEFASSIGNOP (assign, triangular_matrix, triangular_matrix) { CAST_BINOP_ARGS (octave_triangular_matrix &, const octave_triangular_matrix&); v1.assign(idx, v2.matrix_value()); return octave_value(); } DEFASSIGNOP (assignm, triangular_matrix, matrix) { CAST_BINOP_ARGS (octave_triangular_matrix &, const octave_matrix&); v1.assign(idx, v2.matrix_value()); return octave_value(); } DEFASSIGNOP (assigns, triangular_matrix, scalar) { CAST_BINOP_ARGS (octave_triangular_matrix &, const octave_scalar&); v1.assign(idx, v2.matrix_value()); return octave_value(); } void install_tri_ops (void) { INSTALL_UNOP (op_uminus, octave_triangular_matrix, uminus); INSTALL_UNOP (op_uplus, octave_triangular_matrix, uplus); INSTALL_UNOP (op_transpose, octave_triangular_matrix, transpose); INSTALL_UNOP (op_hermitian, octave_triangular_matrix, transpose); INSTALL_BINOP (op_ldiv, octave_triangular_matrix, octave_matrix, ldiv); INSTALL_ASSIGNOP (op_asn_eq, octave_triangular_matrix, octave_matrix, assign); INSTALL_ASSIGNOP (op_asn_eq, octave_triangular_matrix, octave_triangular_matrix, assignm); INSTALL_ASSIGNOP (op_asn_eq, octave_triangular_matrix, octave_scalar, assigns); } static bool triangular_type_loaded = false; static void install_triangular (void) { if (!triangular_type_loaded) { octave_triangular_matrix::register_type (); install_tri_ops (); triangular_type_loaded = true; mlock ("uppertri"); mlock ("lowertri"); } } // PKG_ADD: autoload ("istri", "uppertri.oct"); DEFUN_DLD (istri, args, , "Returns true if argument is a triangular matrix") { int nargin = args.length (); octave_value retval; if (nargin != 1) print_usage (); else if (! triangular_type_loaded) retval = false; else retval = args(0).type_id () == octave_triangular_matrix::static_type_id (); return retval; } // PKG_ADD: autoload ("lowertri", "uppertri.oct"); DEFUN_DLD (lowertri, args, , "Creates a lower triangular matrix") { int nargin = args.length (); octave_value retval; if (nargin != 1) print_usage (); else { Matrix m = args(0).matrix_value(); if (!error_state) { install_triangular (); retval = new octave_triangular_matrix (m, octave_triangular_matrix::Lower); } } return retval; } DEFUN_DLD (uppertri, args, , "Creates an upper triangular matrix") { int nargin = args.length (); octave_value retval; if (nargin != 1) print_usage (); else { Matrix m = args(0).matrix_value(); if (!error_state) { install_triangular (); retval = new octave_triangular_matrix (m, octave_triangular_matrix::Upper); } } return retval; } 
From: David Bateman <adb014@us...>  20070625 20:19:49

Update of /cvsroot/octave/octaveforge/extra/triangular In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv16027/triangular Added Files: COPYING DESCRIPTION INDEX Makefile Log Message: Add example triangular matrix type to document the procedure of adding user types to Octave  NEW FILE: INDEX  triangular >> Example Octave User Type triangular istri uppertri lowertri  NEW FILE: Makefile  sinclude ../../Makeconf PKG_FILES = COPYING DESCRIPTION INDEX $(wildcard src/*) \ $(wildcard inst/*) doc/triangular.pdf doc/uppertri.cc SUBDIRS = doc/ .PHONY: $(SUBDIRS) prepkg:: @for _dir in $(SUBDIRS); do \ make C $$_dir all; \ done clean: @for _dir in $(SUBDIRS); do \ make C $$_dir $(MAKECMDGOALS); \ done  NEW FILE: DESCRIPTION  Name: Triangular Version: 1.0.0 Date: 20070625 Author: David Bateman Maintainer: David Bateman Title: Triangular. Description: Simple example of a user type implementing a simple matrix type for triangular matrices. Depends: octave (> 2.9.9) Autoload: no License: GPL version 2 or later Url: http://octave.sf.net  NEW FILE: COPYING  GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 675 Mass Ave, Cambridge, MA 02139, USA 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 softwareto 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 machinereadable 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 machinereadable 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 royaltyfree 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. <one line to give the program's name and a brief idea of what it does.> Copyright (C) 19yy <name of author> 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., 675 Mass Ave, Cambridge, MA 02139, USA. 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) 19yy 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 mouseclicks or menu itemswhatever 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. <signature of Ty Coon>, 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. 
From: David Bateman <adb014@us...>  20070625 20:19:49

Update of /cvsroot/octave/octaveforge/extra/triangular/inst In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv16027/triangular/inst Added Files: triangular.m Log Message: Add example triangular matrix type to document the procedure of adding user types to Octave  NEW FILE: triangular.m  ## Copyright (C) 2003 David Bateman ## ## 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 021101301 USA ## * texinfo * ## @deftypefn {Function File} {} triangular () ## ## Manual for test triangular matrix user type. ## @end deftypefn ## PKG_ADD: mark_as_command triangular function retval = triangular () doc ("triangular"); endfunction 
From: David Bateman <adb014@us...>  20070625 20:19:48

Update of /cvsroot/octave/octaveforge/extra/triangular/doc In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv16027/triangular/doc Added Files: Makefile triangular.texi Log Message: Add example triangular matrix type to document the procedure of adding user types to Octave  NEW FILE: Makefile  sinclude ../../../Makeconf # Fill in the variables as it makes testing the package manager easier ifeq ($(MKDOC),) MKDOC = ../../../admin/mkdoc MAKEINFO = makeinfo nosplit TEXI2DVI = texi2dvi clean DVIPS = dvips LN_S = ln s endif INFODOC = triangular.info PSDOC = $(patsubst %.info,%.ps,$(INFODOC)) PDFDOC = $(patsubst %.info,%.pdf,$(INFODOC)) HTMLDOC = $(patsubst %.info,%.html,$(INFODOC)) TEXIDOC = $(patsubst %.info,%.texi,$(INFODOC)) DOCS = $(INFODOC) $(PDFDOC) DOCSTRINGS = DOCSTRINGS INDEX = ../INDEX TMPDELETES = *.log *.dvi $(DOCSTRINGS) *~ uppertri.cc DELETES = $(TMPDELETES) *.ps *.pdf *.info $(DOCS) *.html triangular/ html/ all : uppertri.cc $(PDFDOC) $(HTMLDOC) ../inst/doc.info ../inst/doc.info : $(INFODOC) cp f $(INFODOC) ../inst/doc.info uppertri.cc : ../src/uppertri.cc cp f $< $@ %.dvi : %.texi @if test "x$(TEXI2DVI)" != "x"; then \ echo "Making dvi $@"; \ TEXINPUTS="./:$../../..:$(TEXINPUTS):"; \ export TEXINPUTS; \ $(TEXI2DVI) $< ; \ fi %.ps : %.dvi @if test "x$(TEXI2DVI)" != "x" && test "x$(DVIPS)" != "x"; then \ echo "Making postscript $@"; \ $(DVIPS) o $@ $< ; \ fi %.pdf : %.dvi @if test "x$(TEXI2DVI)" != "x" && test "x$(DVIPDF)" != "x"; then \ echo "Making pdf $@"; \ $(DVIPDF) $< ; \ fi %.info : %.texi @if test "x$(MAKEINFO)" != "x"; then \ echo "Making info $@"; \ $(MAKEINFO) I./ I../../../ $< ; \ fi # Need a stupid copy of the TOC for older texi2html versions # Newer texi2html place documentation in a subdirectory %.html : %.texi @if test "x$(TEXI2HTML)" != "x"; then \ echo "Making html $@"; \ $(TEXI2HTML) I . I ../../.. iftex subdir=./ expandinfo $< ; \ if test ! e "$(@:.html=_toc.html)"; then \ if test ! e "triangular/$@"; then \ $(INSTALL_DATA) triangular/$(@:.html=_toc.html) triangular/$@ ; \ fi; \ if [ ! e "triangular/index.html" ]; then \ $(LN_S) $@ triangular/index.html; \ fi; \ mv triangular html; \ $(INSTALL_DATA) *.png html; \ else \ if test ! e "$@"; then \ $(INSTALL_DATA) $(@:.html=_toc.html) $@ ; \ fi; \ if [ ! e "html/" ]; then \ mkdir html; \ fi; \ $(INSTALL_DATA) *.png *.html html; \ if [ ! e "html/index.html" ]; then \ $(LN_S) $@ html/index.html; \ fi \ fi \ fi clean: @echo "Cleaning..."; \ $(RM) fr $(DELETES) dist: all count: wc *.texi  NEW FILE: triangular.texi  \input texinfo @setfilename triangular.info @settitle @titlepage @title Communications Toolbox for Octave @subtitle June 2007 @author David Bateman @page @vskip 0pt plus 1filll Copyright @copyright{} 2007 Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the same conditions as for modified versions. @end titlepage @contents @ifinfo @node Top, User Types in OctFiles @top @end ifinfo @menu * User Types in OctFiles:: @end menu @node User Types in OctFiles @chapter User Types in OctFiles As Octave is written largely in C++, it can benefit from all of the object oriented programming capabilities of the C++ language. This makes it easy to add additional types to the Octave scripting language using the overloading capabilities of the C++ language. Any of the existing Octave classes might be used as a basis for a new C++ class representing the new type. The basic class for the new user type to inherit from is @code{octave_base_value}, that contains all the default behaviors for the basic functionality of all Octave classes. The following pages includes a simple example of a user type in an octfile. It produces a new type for triangular matrices based on the @code{octave_matrix} class, and overloads certain operators including the left division operator, to allow rapid solution of linear equations including triangular @example @verbatiminclude uppertri.cc @end example It should be noted that the above class, is given as an example only, as Octave includes the ability to identify triangular matrices and use the appropriate method for the left division operator. It is however useful as an example. Before the new user type can be used, it has to be registered as a valid Octave type. This is performed by the @code{register_type} method in the @code{install_triangular} function above. The @code{install_triangular} function also sets up the overloaded functions in the @code{install_tri_ops} function. A number of functions are overloaded, including the transpose, unary operators and the left division operators. Also note that there are three different assignment operators defined. Finally, the constructor functions are locked in to Octave memory with the @code{mlock} function. The reason the constructor functions need to be locked into memory is that @example @group a = uppertri (randn (3,3)); clear uppertri disp(a) @end group @end example @noindent would result in @code{a} being left defined, but the type it refers to being cleared from Octave's memory. The next reference to @code{a}, will then result in Octave exiting abnormally. Note that in most ways user types have the same capabilities as any other Octave type. There are a few minor points were user types differ. Firstly, as the @code{octave_value} class has no knowledge of the user type, extracting the user type from the @code{octave_value} or setting the @code{octave_value} to the user type is necessarily different. Extracting the user type from the @code{octave_value} is done with @example @group const octave_triangular_matrix ((const octave_triangular_matrix&) args(0).get_rep(); @end group @end example @noindent and setting the @code{octave_value} is done with @example @group octave_value retval = new octave_triangular_matrix (@dots{}) retval.maybe_mutate (); @end group @end example It should be noted that the normal @code{octave_value} constructors call the @code{maybe_mutate} method, that check whether the previous operations should result in the type of the returned value being changed, using the @code{try_narrowing_conversion} function. The constructor functions in the example code, know the type won't change and so can ignore te @code{maybe_mutate} functions. Two other important functions in the above class are the @code{subsref} and @code{subsasgn} functions. The @code{subsref} function is used for indexed referencing of variable of the user type such as @code{a (1)}, @code{a.type} or even @code{a (1).type}. The @code{subsasgn} function is similar, but is used for indexed assignments to the user type (ie. when the variable is on the lefthand side of the assigment). It should be noted that to allow assignments such as @example @group a = uppertri (@dots{}); a.type = @dots{}; @end group @end example @noindent to work as expected, then the user type must be declared as a map by having the @code{is_map} method return true. The use of ".type" above to reference the type of the triangular matrix, is not necessarily recommended, but is rather an indication of how this type of indexing might be implemented. A final important function included in the above class is the @code{numeric_conversion_function}. This returns a pointer to a function, that converts the triangular matrix to a normal Octave matrix. This allows the operators for normal Octave matrices to be applied to the user defined triangular matrices, with the return type being a normal Octave matrix type. @bye 
From: David Bateman <adb014@us...>  20070625 20:17:40

Update of /cvsroot/octave/octaveforge/extra/triangular/src In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv15225/src Log Message: Directory /cvsroot/octave/octaveforge/extra/triangular/src added to the repository 
From: David Bateman <adb014@us...>  20070625 20:17:40

Update of /cvsroot/octave/octaveforge/extra/triangular/inst In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv15225/inst Log Message: Directory /cvsroot/octave/octaveforge/extra/triangular/inst added to the repository 
From: David Bateman <adb014@us...>  20070625 20:17:40

Update of /cvsroot/octave/octaveforge/extra/triangular/doc In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv15225/doc Log Message: Directory /cvsroot/octave/octaveforge/extra/triangular/doc added to the repository 
From: David Bateman <adb014@us...>  20070625 20:17:14

Update of /cvsroot/octave/octaveforge/extra/triangular In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv15167/triangular Log Message: Directory /cvsroot/octave/octaveforge/extra/triangular added to the repository 
From: sissou <sissou@us...>  20070625 20:09:29

Update of /cvsroot/octave/octaveforge/main/signal/inst In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv11908 Modified Files: barthannwin.m Log Message: Minor corrections. Index: barthannwin.m =================================================================== RCS file: /cvsroot/octave/octaveforge/main/signal/inst/barthannwin.m,v retrieving revision 1.1 retrieving revision 1.2 diff u d r1.1 r1.2  barthannwin.m 18 Jun 2007 20:34:34 0000 1.1 +++ barthannwin.m 25 Jun 2007 20:09:29 0000 1.2 @@ 29,5 +29,6 @@ N = L1; n = 0:N;  w = 0.62 0.48.*abs(n./(L1)  0.5)+0.38*cos(2.*pi*(n./(L1)0.5)) + w = 0.62 0.48.*abs(n./(L1)  0.5)+0.38*cos(2.*pi*(n./(L1)0.5)); +endfunction; 
From: alex <abarth93@us...>  20070625 16:19:34

Update of /cvsroot/octave/octaveforge/main/geometry In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv3251 Modified Files: DESCRIPTION Log Message: griddata returns now NaN for location where no value can be obtained (instead of 0) Index: DESCRIPTION =================================================================== RCS file: /cvsroot/octave/octaveforge/main/geometry/DESCRIPTION,v retrieving revision 1.7 retrieving revision 1.8 diff u d r1.7 r1.8  DESCRIPTION 28 Mar 2007 18:54:13 0000 1.7 +++ DESCRIPTION 25 Jun 2007 16:19:11 0000 1.8 @@ 1,5 +1,5 @@ Name: Geometry Version: 1.0.1 +Version: 1.0.2 Date: 20060806 Author: Various Authors Maintainer: The Octave Community 
From: alex <abarth93@us...>  20070625 16:19:34

Update of /cvsroot/octave/octaveforge/main/geometry/inst In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv3251/inst Modified Files: griddata.m Log Message: griddata returns now NaN for location where no value can be obtained (instead of 0) Index: griddata.m =================================================================== RCS file: /cvsroot/octave/octaveforge/main/geometry/inst/griddata.m,v retrieving revision 1.4 retrieving revision 1.5 diff u d r1.4 r1.5  griddata.m 23 Mar 2007 16:14:32 0000 1.4 +++ griddata.m 25 Jun 2007 16:19:11 0000 1.5 @@ 61,6 +61,8 @@ ## triangulate data tri=delaunay(x,y); zi=zeros(size(xi)); + ## initialize all data with NaN + zi(:) = NaN; if strcmp(method,'cubic') error("griddata(...,'cubic') cubic interpolation not yet implemented\n") 
From: Michael Goffioul <goffioul@us...>  20070625 13:44:38

Update of /cvsroot/octave/octaveforge/extra/java/src In directory sc8prcvs3.sourceforge.net:/tmp/cvsserv3711/src Modified Files: __java__.cc Log Message: avoid JVM to register signal handlers Index: __java__.cc =================================================================== RCS file: /cvsroot/octave/octaveforge/extra/java/src/__java__.cc,v retrieving revision 1.27 retrieving revision 1.28 diff u d r1.27 r1.28  __java__.cc 23 Jun 2007 14:13:23 0000 1.27 +++ __java__.cc 25 Jun 2007 13:44:36 0000 1.28 @@ 233,10 +233,11 @@ strcpy (octave_path_optionString, init_octave_path.c_str ()); vm_args.version = JNI_VERSION_1_2;  vm_args.nOptions = 2 /* 3 */; + vm_args.nOptions = 3 /* 3 */; options[0].optionString = class_path_optionString; options[1].optionString = octave_path_optionString; //options[2].optionString = "Dsun.java2d.opengl=True"; + options[2].optionString = "Xrs"; vm_args.options = options; vm_args.ignoreUnrecognized = false; 