Minor cleanup of data.ipkg

jdevuyst · Sep 20, 2018 · 0e7eb14 · 0e7eb14
1 parent 4fbc49c
commit 0e7eb14
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 5 deletions.
diff --git a/README.md b/README.md
@@ -135,4 +135,4 @@ These operations take O(log<sub>n</sub>) time. See Okasaki's book for techniques
 
 By construction all accesses and updates to a `RandomAccessList` are proved to be safe.
 
-Usually arrays allow efficient append and prepend is expensive. In `RandomAccessList`, prepend is cheap and append is expensive. The performance of these operations can be swapped by translating all indices. That is, `cons` can be interpreted as an append and access to indices can be translated as follows: `realIndex(virtualIndex) = size - 1 - virtualIndex`,
+Usually arrays allow efficient append and prepend is expensive. In `RandomAccessList`, prepend is cheap and append is expensive. The performance of these operations can be swapped by translating all indices. That is, `cons` can be interpreted as an append and access to indices can be translated as follows: `realIndex(virtualIndex) = size - 1 - virtualIndex`.
diff --git a/data.ipkg b/data.ipkg
@@ -1,10 +1,8 @@
 package data
 
-sourceloc = git@github.com:jdevuyst/idris-data.git
+sourceloc = https://github.com/jdevuyst/idris-data
 
-pkgs = contrib
-
-opts = "--warnreach"
+opts = "--warnreach -p contrib"
 
 sourcedir = src
 modules = Decidable.IntOrder
Original file line number	Diff line number	Diff line change
Expand Up		@@ -135,4 +135,4 @@ These operations take O(log<sub>n</sub>) time. See Okasaki's book for techniques

		By construction all accesses and updates to a `RandomAccessList` are proved to be safe.

		Usually arrays allow efficient append and prepend is expensive. In `RandomAccessList`, prepend is cheap and append is expensive. The performance of these operations can be swapped by translating all indices. That is, `cons` can be interpreted as an append and access to indices can be translated as follows: `realIndex(virtualIndex) = size - 1 - virtualIndex`,
		Usually arrays allow efficient append and prepend is expensive. In `RandomAccessList`, prepend is cheap and append is expensive. The performance of these operations can be swapped by translating all indices. That is, `cons` can be interpreted as an append and access to indices can be translated as follows: `realIndex(virtualIndex) = size - 1 - virtualIndex`.