docs: Make ..<, .. ^ more discoverable (#14835)

This commit is contained in:
Manuel Bojato 2020-06-27 16:42:58 -05:00 • committed by GitHub
commit bc66788b3f
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23

View file

@ -45,9 +45,9 @@ Proc Usage
Seqs
----
======================================== ==========================================
=========================================== ==========================================
Proc Usage
======================================== ==========================================
=========================================== ==========================================
`newSeq<#newSeq>`_ Create a new sequence of a given length
`newSeqOfCap<#newSeqOfCap,Natural>`_ Create a new sequence with zero length
and a given capacity
@ -62,7 +62,10 @@ Proc Usage
`pop<#pop,seq[T][T]>`_ Remove and return last item of a sequence
`x & y<#&,seq[T][T],seq[T][T]>`_ Concatenate two sequences
`x[a..b]<#[],openArray[T],HSlice[U,V]>`_ Slice of a sequence (both ends included)
======================================== ==========================================
`x[a..^b]<#[],openArray[T],HSlice[U,V]>`_ Slice of a sequence but `b` is a
reversed index (both ends included)
`x[a..\<b]<#[],openArray[T],HSlice[U,V]>`_ Slice of a sequence (excluded upper bound)
=========================================== ==========================================
**See also:**
* `sequtils module <sequtils.html>`_ for operations on container
@ -160,8 +163,10 @@ Proc Usage
`T or F<#or,bool,bool>`_ Boolean `or`
`T xor F<#xor,bool,bool>`_ Boolean `xor` (exclusive or)
`not T<#not,bool>`_ Boolean `not`
`a[^x]<#^.t,int>`_ Take the element at the reversed index `x`
`a .. b<#..,T,U>`_ Binary slice that constructs an interval
`[a, b]`
`a ..^ b<#..^.t,untyped,untyped>`_ Interval `[a, b]` but `b` as reversed index
[a ..< b](#..<.t,untyped,untyped) Interval `[a, b)` (excluded upper bound)
[runnableExamples](#runnableExamples,untyped) Create testable documentation
============================================= ============================================