summaryrefslogtreecommitdiffstats
path: root/tcl8.6/doc/linsert.n
diff options
context:
space:
mode:
authorWilliam Joye <wjoye@cfa.harvard.edu>2016-12-21 22:47:21 (GMT)
committerWilliam Joye <wjoye@cfa.harvard.edu>2016-12-21 22:47:21 (GMT)
commit5514e37335c012cc70f5b9aee3cedfe3d57f583f (patch)
tree4ba7d8aad13735e52f59bdce7ca5ba3151ebd7e3 /tcl8.6/doc/linsert.n
parent768f87f613cc9789fcf8073018fa02178c8c91df (diff)
downloadblt-5514e37335c012cc70f5b9aee3cedfe3d57f583f.zip
blt-5514e37335c012cc70f5b9aee3cedfe3d57f583f.tar.gz
blt-5514e37335c012cc70f5b9aee3cedfe3d57f583f.tar.bz2
undo subtree
Diffstat (limited to 'tcl8.6/doc/linsert.n')
-rw-r--r--tcl8.6/doc/linsert.n55
1 files changed, 0 insertions, 55 deletions
diff --git a/tcl8.6/doc/linsert.n b/tcl8.6/doc/linsert.n
deleted file mode 100644
index 91db726..0000000
--- a/tcl8.6/doc/linsert.n
+++ /dev/null
@@ -1,55 +0,0 @@
-'\"
-'\" Copyright (c) 1993 The Regents of the University of California.
-'\" Copyright (c) 1994-1996 Sun Microsystems, Inc.
-'\" Copyright (c) 2001 Kevin B. Kenny <kennykb@acm.org>. All rights reserved.
-'\"
-'\" See the file "license.terms" for information on usage and redistribution
-'\" of this file, and for a DISCLAIMER OF ALL WARRANTIES.
-'\"
-.TH linsert n 8.2 Tcl "Tcl Built-In Commands"
-.so man.macros
-.BS
-'\" Note: do not modify the .SH NAME line immediately below!
-.SH NAME
-linsert \- Insert elements into a list
-.SH SYNOPSIS
-\fBlinsert \fIlist index \fR?\fIelement element ...\fR?
-.BE
-.SH DESCRIPTION
-.PP
-This command produces a new list from \fIlist\fR by inserting all of the
-\fIelement\fR arguments just before the \fIindex\fR'th element of
-\fIlist\fR. Each \fIelement\fR argument will become a separate element of
-the new list. If \fIindex\fR is less than or equal to zero, then the new
-elements are inserted at the beginning of the list, and if \fIindex\fR is
-greater or equal to the length of \fIlist\fR, it is as if it was \fBend\fR.
-As with \fBstring index\fR, the \fIindex\fR value supports both simple index
-arithmetic and end-relative indexing.
-.PP
-Subject to the restrictions that indices must refer to locations inside the
-list and that the \fIelement\fRs will always be inserted in order, insertions
-are done so that when \fIindex\fR is start-relative, the first \fIelement\fR
-will be at that index in the resulting list, and when \fIindex\fR is
-end-relative, the last \fIelement\fR will be at that index in the resulting
-list.
-.SH EXAMPLE
-.PP
-Putting some values into a list, first indexing from the start and
-then indexing from the end, and then chaining them together:
-.PP
-.CS
-set oldList {the fox jumps over the dog}
-set midList [\fBlinsert\fR $oldList 1 quick]
-set newList [\fBlinsert\fR $midList end-1 lazy]
-# The old lists still exist though...
-set newerList [\fBlinsert\fR [\fBlinsert\fR $oldList end-1 quick] 1 lazy]
-.CE
-.SH "SEE ALSO"
-list(n), lappend(n), lindex(n), llength(n), lsearch(n),
-lset(n), lsort(n), lrange(n), lreplace(n),
-string(n)
-.SH KEYWORDS
-element, insert, list
-'\" Local Variables:
-'\" mode: nroff
-'\" End: