Fixes to contributor module documentation

- Changed "Contrib" to "Contributor"
- Fixed mismatched inline code in list* usage
- Added missing hyperlink targets
This commit is contained in:
Kevin Yap 2014-12-06 12:32:11 -08:00
parent 997501bcc4
commit d657e5eb2d
5 changed files with 17 additions and 14 deletions

View File

@ -46,7 +46,7 @@ ap-each-while
Usage: ``(ap-each-while list pred body)`` Usage: ``(ap-each-while list pred body)``
Evaluate the form for each element where the predicate form returns Evaluate the form for each element where the predicate form returns
True. `True`.
.. code-block:: hy .. code-block:: hy
@ -63,7 +63,7 @@ ap-map
Usage: ``(ap-map form list)`` Usage: ``(ap-map form list)``
The anaphoric form of map works just like regular map except that The anaphoric form of map works just like regular map except that
instead of a function object it takes a Hy form. The special name, instead of a function object it takes a Hy form. The special name
``it`` is bound to the current object from the list in the iteration. ``it`` is bound to the current object from the list in the iteration.
.. code-block:: hy .. code-block:: hy

View File

@ -1,6 +1,6 @@
=========================
Contrib Modules Index Contributor Modules Index
===================== =========================
Contents: Contents:

View File

@ -25,7 +25,7 @@ optimization (TCO) in their Hy code.
allowing efficient structured programming. allowing efficient structured programming.
-- Wikipedia (http://en.wikipedia.org/wiki/Tail_call) -- Wikipedia (http://en.wikipedia.org/wiki/Tail_call)
Macros Macros
====== ======

View File

@ -4,8 +4,8 @@ defmulti
.. versionadded:: 0.10.0 .. versionadded:: 0.10.0
`defmulti` lets you arity-overload a function by the given number of `defmulti` lets you arity-overload a function by the given number of
args and/or kwargs. Inspired by clojures take on `defn`. args and/or kwargs. Inspired by Clojure's take on `defn`.
.. code-block:: clj .. code-block:: clj

View File

@ -419,6 +419,9 @@ Contrast with :ref:`iterable?-fn`.
=> (iterator? (iter {:a 1 :b 2 :c 3})) => (iterator? (iter {:a 1 :b 2 :c 3}))
True True
.. _list*-fn:
list* list*
----- -----
@ -484,7 +487,7 @@ merge-with
.. versionadded:: 0.10.1 .. versionadded:: 0.10.1
Usage: ``(merge-with f &rest maps) Usage: ``(merge-with f &rest maps)``
Returns a map that consist of the rest of the maps joined onto first. Returns a map that consist of the rest of the maps joined onto first.
If a key occurs in more than one map, the mapping(s) from the latter If a key occurs in more than one map, the mapping(s) from the latter
@ -612,7 +615,7 @@ Raise ``ValueError`` if ``n`` is negative.
.. _numeric?-fn: .. _numeric?-fn:
numeric? numeric?
--------- --------
Usage: ``(numeric? x)`` Usage: ``(numeric? x)``
@ -680,7 +683,7 @@ Raises ``TypeError`` if ``(not (numeric? x))``.
.. _second-fn: .. _second-fn:
second second
------- ------
Usage: ``(second coll)`` Usage: ``(second coll)``
@ -762,7 +765,7 @@ Return `True` if x is zero (0).
Sequence Functions Sequence Functions
======================= ==================
Sequence functions can either create or operate on a potentially Sequence functions can either create or operate on a potentially
infinite sequence without requiring the sequence be fully realized in infinite sequence without requiring the sequence be fully realized in
@ -821,7 +824,7 @@ To get the Fibonacci number at index 9, (starting from 0):
.. _cycle-fn: .. _cycle-fn:
cycle cycle
------ -----
Usage: ``(cycle coll)`` Usage: ``(cycle coll)``
@ -1156,7 +1159,7 @@ Return an iterator from ``coll`` as long as predicate, ``pred`` returns True.
=> (list (take-while neg? [ 1 2 3 -4 5])) => (list (take-while neg? [ 1 2 3 -4 5]))
[] []
.. _zipwith: .. _zipwith-fn:
zipwith zipwith
------- -------