docs: IndexedList and IIndexedList in the changelog and the collection table

The changelog lists the new functions, the renamed `ImmutableList` module and functions, the breaking changes of the
`List` semantics and the removed functions and modules. The collection tables name `IndexedList` with `indexedList { }`
and `IIndexedList` instead of `ImmutableList` and `IIndexedSeq`, and the tutorial creates an `IndexedList`.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>

Author: xperiandri

CHANGELOG.md

@@ -15,6 +15,17 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 * The `FSharp.Collections.Immutable.Option.FlatList` and `FSharp.Collections.Immutable.Tuple.FlatList` modules repeat the
   functions that use value options or struct tuples with options and reference tuples.
 * The `FlatListBuilder` module works on the builder of a flat list, and `flatList { }` builds a flat list.
+* `IndexedList` has every function of the FSharp.Core `List` module that applies to an immutable list, with its semantics,
+  parameter names and exceptions and with stable sorts, plus `add`, `binarySearch`, `blit`, `cons`, `indexOf`,
+  `indexOfWith`, `lastIndexOf`, `lastIndexOfWith`, `ofReadOnlySpan`, `ofSpan`, `skipLast`, `sortWithComparer`,
+  `takeLast`, `tryTail`, `tryUncons`, `uncons` and the struct partial active patterns `Cons` and `Nil`.
+* The `IIndexedList` module has the functions of `IndexedList` for `IImmutableList<'T>`, without the creation and builder
+  functions, `binarySearch` and `blit`, plus `clear`. Its functions keep the implementation of the input list where the
+  result has the element type of the input, and return an `IndexedList` otherwise.
+* The `FSharp.Collections.Immutable.Option` and `FSharp.Collections.Immutable.Tuple` namespaces have `IndexedList` and
+  `IIndexedList` modules that repeat the functions that use value options or struct tuples with options and reference
+  tuples.
+* The `IndexedListBuilder` module works on the builder of an indexed list, and `indexedList { }` builds an indexed list.
 
 ### Changed
 
@@ -24,6 +35,17 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
   `voption`; the functions that return tuples return struct tuples.
 * `FlatList`: every function throws what the FSharp.Core `Array` function of the same name throws. `take` and `splitAt`
   throw for a count beyond the length, and a default `ImmutableArray` throws `ArgumentNullException`.
+* The `ImmutableList` module is renamed to `IndexedList`, and `reverse`, `withItem`, `insert`, `insertRange` and
+  `removeRange` are renamed to `rev`, `updateAt`, `insertAt`, `insertManyAt` and `removeManyAt`.
+* `IndexedList`: the `try*` functions return `voption`; `choose`, `pick`, `tryPick` and `unfold` take functions that
+  return `voption`, and the generator of `unfold` returns the element before the state, as in `List.unfold`; the
+  functions that return tuples return struct tuples.
+* `IndexedList`: every function throws what the FSharp.Core `List` function of the same name throws, and a `null` indexed
+  list throws `ArgumentNullException`. `take`, `skip` and `splitAt` throw the exceptions of `List` for a count beyond the
+  length.
+* `IndexedList`: `append` takes two indexed lists; `contains` compares in F# structural equality; `except` removes every
+  element equal to an excluded item and the duplicates of the other elements, as `List.except` does; the sorting functions
+  are stable and order in F# generic comparison.
 
 ### Removed
 
@@ -32,6 +54,12 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 * `FlatList.removeAll`, `removeAllWith`, `removeRange`, `sortRange`, `sortRangeWith`, `sortRangeWithComparer` and `sub`,
   and the `ImmutableArray` module alias of `FlatList`.
 * The `Seq` module of conversions between the collections.
+* `ImmutableList.index`, `indexWith`, `indexFrom`, `indexFromWith`, `indexRange`, `indexRangeWith` and their `lastIndex`
+  counterparts: use `IndexedList.indexOf`, `indexOfWith`, `lastIndexOf` and `lastIndexOfWith`.
+* `ImmutableList.clear`, `exceptWith`, `filterFold`, `remove`, `removeWith`, `replace`, `replaceWith`, `reverseRange`,
+  `skipUntil` and `takeUntil`: use `IndexedList.empty`, `IIndexedList.clear`, `skipWhile`, `takeWhile` or the members of
+  `ImmutableList<'T>`.
+* The `IndexedSeq` module, its `ReadOnlyList` alias and the `IIndexedSeq<'T>` abbreviation of `IReadOnlyList<'T>`.
 
 ## [1.0.0] - 2020-02-23
 

README.md

@@ -13,14 +13,14 @@ Please also join the [F# Open Source Group](http://fsharp.github.com)
 | Module | .NET type | Computation expression |
 |---|---|---|
 | `FlatList` | `ImmutableArray<'T>` | `flatList { }` |
-| `ImmutableList` | `ImmutableList<'T>` | – |
+| `IndexedList` | `ImmutableList<'T>` | `indexedList { }` |
+| `IIndexedList` | `IImmutableList<'T>` | – |
 | `Stack` | `ImmutableStack<'T>` | – |
 | `Queue` | `ImmutableQueue<'T>` | – |
 | `HashMap` | `ImmutableDictionary<'Key, 'Value>` | – |
 | `SortedMap` | `ImmutableSortedDictionary<'Key, 'Value>` | – |
 | `HashSet` | `ImmutableHashSet<'T>` | – |
 | `SortedSet` | `ImmutableSortedSet<'T>` | – |
-| `IIndexedSeq` | `IReadOnlyList<'T>` | – |
 
 [Documentation](https://fsprojects.github.io/FSharp.Collections.Immutable/)
 

docsSrc/Explanations/Background.md

@@ -27,14 +27,14 @@ While F# has its own built-in immutable collections, System.Collections.Immutabl
 | Module | .NET type | Computation expression |
 |---|---|---|
 | `FlatList` | `ImmutableArray<'T>` | `flatList { }` |
-| `ImmutableList` | `ImmutableList<'T>` | – |
+| `IndexedList` | `ImmutableList<'T>` | `indexedList { }` |
+| `IIndexedList` | `IImmutableList<'T>` | – |
 | `Stack` | `ImmutableStack<'T>` | – |
 | `Queue` | `ImmutableQueue<'T>` | – |
 | `HashMap` | `ImmutableDictionary<'Key, 'Value>` | – |
 | `SortedMap` | `ImmutableSortedDictionary<'Key, 'Value>` | – |
 | `HashSet` | `ImmutableHashSet<'T>` | – |
 | `SortedSet` | `ImmutableSortedSet<'T>` | – |
-| `IIndexedSeq` | `IReadOnlyList<'T>` | – |
 
 ---
 

docsSrc/Tutorials/Getting_Started.md

@@ -22,7 +22,7 @@ open FSharp.Collections.Immutable
 
 ``` F#
 // Create an immutable list
-let list1 = ImmutableList.ofSeq [1; 2; 3]
+let list1 = IndexedList.ofSeq [1; 2; 3]
 
 // Create an immutable hash set
 let set1 = HashSet.ofSeq ["a"; "b"]

docsSrc/index.md

@@ -9,14 +9,14 @@ F# bindings for [System.Collections.Immutable](https://learn.microsoft.com/en-us
 | Module | .NET type | Computation expression |
 |---|---|---|
 | `FlatList` | `ImmutableArray<'T>` | `flatList { }` |
-| `ImmutableList` | `ImmutableList<'T>` | – |
+| `IndexedList` | `ImmutableList<'T>` | `indexedList { }` |
+| `IIndexedList` | `IImmutableList<'T>` | – |
 | `Stack` | `ImmutableStack<'T>` | – |
 | `Queue` | `ImmutableQueue<'T>` | – |
 | `HashMap` | `ImmutableDictionary<'Key, 'Value>` | – |
 | `SortedMap` | `ImmutableSortedDictionary<'Key, 'Value>` | – |
 | `HashSet` | `ImmutableHashSet<'T>` | – |
 | `SortedSet` | `ImmutableSortedSet<'T>` | – |
-| `IIndexedSeq` | `IReadOnlyList<'T>` | – |
 
 ---