feat: IndexedList and IIndexedList modules with the vocabulary of the FSharp.Core List module

`IndexedList` (`ImmutableList<'T>`) replaces the `ImmutableList` module. It has every function of `List` that applies to
an immutable list, with the parameter names, the checks and the exceptions of `List` and with stable sorts, plus the
extras of ADR 0001: `add`, `binarySearch`, `blit`, `cons`, `uncons`, `tryUncons`, the struct partial patterns `Cons` and
`Nil`, `indexOf`, `lastIndexOf`, `skipLast`, `takeLast`, `tryTail` and `sortWithComparer`. `IIndexedList` has the same
functions for `IImmutableList<'T>` without creation, builder, `binarySearch` and `blit`, plus `clear`; a result with the
element type of the input keeps the implementation of the input. The `Option` and `Tuple` namespaces repeat the
functions that use value options or struct tuples, `IndexedListBuilder` works on the builder of an indexed list, and
`indexedList { }` builds one.

`Helper.fs` gains three internal modules for the modules that mirror `List`: `ListChecks` throws the exceptions of `List`
for lengths and indices with the parameter names that the caller passes, `ListArrays` runs the functions of two and three
lists over arrays and checks the lengths after the common prefix, as `List` does, and `Snapshot` copies a collection into
an array.

The `ImmutableList` and `IndexedSeq` modules, the `ReadOnlyList` alias and the `IIndexedSeq<'T>` abbreviation are removed.

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

Author: xperiandri

src/FSharp.Collections.Immutable/ComputationExpressions.fs

@@ -17,3 +17,17 @@ module ComputationExpressions =
     /// Evaluates to a flat list of 0, 1, 4, 9, 100 and 200.
     /// </example>
     let flatList = FlatListCE ()
+
+    /// <summary>Builds an indexed list.</summary>
+    /// <example id="indexedList-1">
+    /// <code lang="fsharp">
+    /// let squares = indexedList {
+    ///     yield 0
+    ///     for i in 1..3 do
+    ///         yield i * i
+    ///     yield! [ 100; 200 ]
+    /// }
+    /// </code>
+    /// Evaluates to an indexed list of 0, 1, 4, 9, 100 and 200.
+    /// </example>
+    let indexedList = IndexedListCE ()

src/FSharp.Collections.Immutable/FSharp.Collections.Immutable.fsproj

@@ -29,10 +29,22 @@
     <Compile Include="FlatList\FlatListTuple.fs" />
     <Compile Include="FlatList\FlatListBuilder.fs" />
     <Compile Include="FlatList\FlatListCE.fs" />
+    <Compile Include="IndexedList\IndexedList.fsi" />
+    <Compile Include="IndexedList\IndexedList.fs" />
+    <Compile Include="IndexedList\IndexedListOption.fsi" />
+    <Compile Include="IndexedList\IndexedListOption.fs" />
+    <Compile Include="IndexedList\IndexedListTuple.fsi" />
+    <Compile Include="IndexedList\IndexedListTuple.fs" />
+    <Compile Include="IndexedList\IIndexedList.fsi" />
+    <Compile Include="IndexedList\IIndexedList.fs" />
+    <Compile Include="IndexedList\IIndexedListOption.fsi" />
+    <Compile Include="IndexedList\IIndexedListOption.fs" />
+    <Compile Include="IndexedList\IIndexedListTuple.fsi" />
+    <Compile Include="IndexedList\IIndexedListTuple.fs" />
+    <Compile Include="IndexedList\IndexedListBuilder.fs" />
+    <Compile Include="IndexedList\IndexedListCE.fs" />
     <Compile Include="Stack.fs" />
-    <Compile Include="ImmutableList.fs" />
     <Compile Include="Queue.fs" />
-    <Compile Include="IndexedSeq.fs" />
     <Compile Include="Maps.fs" />
     <Compile Include="Sets.fs" />
     <Compile Include="ComputationExpressions.fs" />