Mercurial > octave-nkf

comparison libinterp/octave-value/ov-base.h @ 20132:1f9ed81bd173

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
maint: Fix spelling and grammar mistakes in docs and comments (bug #44878) * NEWS, io.txi, file-io.cc, jit-ir.h, jit-typeinfo.h, ls-oct-binary.cc: Fix misspellings of "compatibility" and "compatible". * bsxfun.cc, file-io.cc, ov-base.h, oct-shlib.h, mesh.m: Fix misspellings of "overridden". * emacs.txi, image.txi, graphics.cc, __magick_read__.cc: Replace verb phrase "allows to" with "allows one to".
author Rafael Laboissiere <rafael@laboissiere.net>
date Sun, 19 Apr 2015 06:53:30 -0300
parents 09ed6f7538dd
children 5dfaaaae784f
comparison
equal deleted inserted replaced
20131:bb59bdbdb8ac 20132:1f9ed81bd173
217 217
218 // Empty clone. 218 // Empty clone.
219 virtual octave_base_value * 219 virtual octave_base_value *
220 empty_clone (void) const; 220 empty_clone (void) const;
221 221
222 // Unique clone. Usually clones, but may be overriden to fake the 222 // Unique clone. Usually clones, but may be overridden to fake the
223 // cloning when sharing copies is to be controlled from within an 223 // cloning when sharing copies is to be controlled from within an
224 // instance (see octave_class). 224 // instance (see octave_class).
225 virtual octave_base_value * 225 virtual octave_base_value *
226 unique_clone (void) { return clone (); } 226 unique_clone (void) { return clone (); }
227 227
762 // array type, x is not a matching scalar type, or n is out of range. 762 // array type, x is not a matching scalar type, or n is out of range.
763 // Never error. 763 // Never error.
764 virtual bool 764 virtual bool
765 fast_elem_insert (octave_idx_type n, const octave_value& x); 765 fast_elem_insert (octave_idx_type n, const octave_value& x);
766 766
767 // This is a helper for the above, to be overriden in scalar types. The 767 // This is a helper for the above, to be overridden in scalar types. The
768 // whole point is to handle the insertion efficiently with just *two* VM 768 // whole point is to handle the insertion efficiently with just *two* VM
769 // calls, which is basically the theoretical minimum. 769 // calls, which is basically the theoretical minimum.
770 virtual bool 770 virtual bool
771 fast_elem_insert_self (void *where, builtin_type_t btyp) const; 771 fast_elem_insert_self (void *where, builtin_type_t btyp) const;
772 772