# HG changeset patch
# User Mike Becker <universe@uap-core.de>
# Date 1570287426 -7200
# Node ID 9f86bc73f96bfa2215fbbd8bbfd9ccf125dc5e9c
# Parent  885f31c6098b916e4ba2839de6141c996f9a50fc
adjusts the UcxArray documentation to the recent changes

diff -r 885f31c6098b -r 9f86bc73f96b docs/src/modules.md
--- a/docs/src/modules.md	Thu Oct 03 11:16:12 2019 +0200
+++ b/docs/src/modules.md	Sat Oct 05 16:57:06 2019 +0200
@@ -50,9 +50,10 @@
 The UCX Array is an implementation of a dynamic array with automatic
 reallocation. The array structure contains a capacity, the current size,
 the size of each element, the raw pointer to the memory area and an allocator.
-Unlike an [UcxList](#list), the array structure is typically passed by value,
-unless it is subjected to change. Arrays are in most cases much faster than
-linked list.
+Arrays are in most cases much faster than linked list.
+One can decide, whether to create a new array on the heap with `ucx_array_new()`
+or to save one indirection by initializing a `UcxArray` structure on the stack
+with `ucx_array_init()`.
 
 ### Remove duplicates from an array of strings