A list with a given element having the Focus.

FocusList has some invariants that must be protected. You should not use the FocusList constructor or the focusListFocus or focusList accessors.

Implemented under the hood as a Seq.

Safely create a FocusList from a list.

>>> fromListFL (Focus 1) ["cat","dog","goat"]
Just (FocusList (Focus 1) ["cat","dog","goat"])

>>> fromListFL NoFocus []
Just (FocusList NoFocus [])

If the Focus is out of range for the list, then Nothing will be returned.

>>> fromListFL (Focus (-1)) ["cat","dog","goat"]
Nothing

>>> fromListFL (Focus 3) ["cat","dog","goat"]
Nothing

>>> fromListFL NoFocus ["cat","dog","goat"]
Nothing

complexity: O(n) where n is the length of the input list.

Create a FocusList from any Foldable container.

This just calls toList on the Foldable, and then passes the result to fromListFL.

fromFoldableFL foc (foldable :: Data.Sequence.Seq Int) == fromListFL foc (toList foldable)

complexity: O(n) where n is the length of the Foldable

Get the underlying Seq in a FocusList.

complexity: O(1)

Return the length of a FocusList.

>>> let Just fl = fromListFL (Focus 2) ["hello", "bye", "parrot"]
>>> lengthFL fl
3

complexity: O(1)

Return True if the FocusList is empty.

>>> isEmptyFL emptyFL
True

>>> isEmptyFL $ singletonFL "hello"
False

Any FocusList with a Focus should never be empty.

hasFocusFL fl ==> not (isEmptyFL fl)

The opposite is also true.

complexity: O(1)

Get the item the FocusList is focusing on. Return Nothing if the FocusList is empty.

>>> let Just fl = fromListFL (Focus 0) ['a'..'c']
>>> getFocusItemFL fl
Just 'a'

>>> getFocusItemFL emptyFL
Nothing

This will always return Just if there is a Focus.

hasFocusFL fl ==> isJust (getFocusItemFL fl)

complexity: O(log(min(i, n - i))) where i is the Focus, and n is the length of the FocusList.

Lookup the element at the specified index, counting from 0.

>>> let Just fl = fromListFL (Focus 0) ['a'..'c']
>>> lookupFL 0 fl
Just 'a'

Returns Nothing if the index is out of bounds.

>>> let Just fl = fromListFL (Focus 0) ['a'..'c']
>>> lookupFL 100 fl
Nothing
>>> lookupFL (-1) fl
Nothing

Always returns Nothing if the FocusList is empty.

lookupFL i emptyFL == Nothing

complexity: O(log(min(i, n - i))) where i is the index you want to look up, and n is the length of the FocusList.

Find the index of the first element in the FocusList.

>>> let Just fl = fromListFL (Focus 1) ["hello", "bye", "tree"]
>>> indexOfFL "hello" fl
Just 0

If more than one element exists, then return the index of the first one.

>>> let Just fl = fromListFL (Focus 1) ["dog", "cat", "cat"]
>>> indexOfFL "cat" fl
Just 1

If the element doesn't exist, then return Nothing

>>> let Just fl = fromListFL (Focus 1) ["foo", "bar", "baz"]
>>> indexOfFL "hogehoge" fl
Nothing

Find a value in a FocusList. Similar to Data.List.find.

>>> let Just fl = fromListFL (Focus 1) ["hello", "bye", "tree"]
>>> findFL (\a -> a == "hello") fl
Just "hello"

This will only find the first value.

>>> let Just fl = fromListFL (Focus 0) ["hello", "bye", "bye"]
>>> findFL (\a -> a == "bye") fl
Just "bye"

If no values match the comparison, this will return Nothing.

>>> let Just fl = fromListFL (Focus 1) ["hello", "bye", "parrot"]
>>> findFL (\a -> a == "ball") fl
Nothing

complexity: O(n) where n is the length of the FocusList.

Return True if the Focus in a FocusList exists.

Return False if the Focus in a FocusList is NoFocus.

>>> hasFocusFL $ singletonFL "hello"
True

>>> hasFocusFL emptyFL
False

complexity: O(1)

Get the Focus from a FocusList.

>>> getFocusFL $ singletonFL "hello"
Focus 0

>>> let Just fl = fromListFL (Focus 3) [0..9]
>>> getFocusFL fl
Focus 3

>>> getFocusFL emptyFL
NoFocus

complexity: O(1)

Prepend a value to a FocusList.

This can be thought of as a "cons" operation.

>>> prependFL "hello" emptyFL
FocusList (Focus 0) ["hello"]

The focus will be updated when prepending:

>>> prependFL "bye" (singletonFL "hello")
FocusList (Focus 1) ["bye","hello"]

Prepending to a FocusList will always update the Focus:

getFocusFL fl < getFocusFL (prependFL a fl)

complexity: O(1)

Append a value to the end of a FocusList.

This can be thought of as a "snoc" operation.

>>> appendFL emptyFL "hello"
FocusList (Focus 0) ["hello"]

>>> appendFL (singletonFL "hello") "bye"
FocusList (Focus 0) ["hello","bye"]

Appending a value to an empty FocusList is the same as using singletonFL.

appendFL emptyFL a == singletonFL a

complexity: O(log n) where n is the length of the FocusList.

A combination of appendFL and setFocusFL.

>>> let Just fl = fromListFL (Focus 1) ["hello", "bye", "tree"]
>>> appendSetFocusFL fl "pie"
FocusList (Focus 3) ["hello","bye","tree","pie"]

The Focus will always be updated after calling appendSetFocusFL.

getFocusFL (appendSetFocusFL fl a) > getFocusFL fl

complexity: O(log n) where n is the length of the FocusList.

Insert a new value into the FocusList. The Focus of the list is changed appropriately.

Inserting an element into an empty FocusList will set the Focus on that element.

>>> insertFL 0 "hello" emptyFL
FocusList (Focus 0) ["hello"]

The Focus will not be changed if you insert a new element after the current Focus.

>>> insertFL 1 "hello" (singletonFL "bye")
FocusList (Focus 0) ["bye","hello"]

The Focus will be bumped up by one if you insert a new element before the current Focus.

>>> insertFL 0 "hello" (singletonFL "bye")
FocusList (Focus 1) ["hello","bye"]

Behaves like Data.Sequence.insertAt. If the index is out of bounds, it will be inserted at the nearest available index

>>> insertFL 100 "hello" emptyFL
FocusList (Focus 0) ["hello"]

>>> insertFL 100 "bye" (singletonFL "hello")
FocusList (Focus 0) ["hello","bye"]

>>> insertFL (-1) "bye" (singletonFL "hello")
FocusList (Focus 1) ["bye","hello"]

complexity: O(log(min(i, n - i))) where i is the index you want to insert at, and n is the length of the FocusList.

Remove an element from a FocusList.

If the element to remove is not the Focus, then update the Focus accordingly.

For example, if the Focus is on index 1, and we have removed index 2, then the focus is not affected, so it is not changed.

>>> let focusList = unsafeFromListFL (Focus 1) ["cat","goat","dog","hello"]
>>> removeFL 2 focusList
Just (FocusList (Focus 1) ["cat","goat","hello"])

If the Focus is on index 2 and we have removed index 1, then the Focus will be moved back one element to set to index 1.

>>> let focusList = unsafeFromListFL (Focus 2) ["cat","goat","dog","hello"]
>>> removeFL 1 focusList
Just (FocusList (Focus 1) ["cat","dog","hello"])

If we remove the Focus, then the next item is set to have the Focus.

>>> let focusList = unsafeFromListFL (Focus 0) ["cat","goat","dog","hello"]
>>> removeFL 0 focusList
Just (FocusList (Focus 0) ["goat","dog","hello"])

If the element to remove is the only element in the list, then the Focus will be set to NoFocus.

>>> let focusList = unsafeFromListFL (Focus 0) ["hello"]
>>> removeFL 0 focusList
Just (FocusList NoFocus [])

If the Int for the index to remove is either less than 0 or greater then the length of the list, then Nothing is returned.

>>> let focusList = unsafeFromListFL (Focus 0) ["hello"]
>>> removeFL (-1) focusList
Nothing

>>> let focusList = unsafeFromListFL (Focus 1) ["hello","bye","cat"]
>>> removeFL 3 focusList
Nothing

If the FocusList passed in is Empty, then Nothing is returned.

>>> removeFL 0 emptyFL
Nothing

complexity: O(log(min(i, n - i))) where i is index of the element to remove, and n is the length of the FocusList.

Delete an element from a FocusList.

>>> let Just fl = fromListFL (Focus 0) ["hello", "bye", "tree"]
>>> deleteFL "bye" fl
FocusList (Focus 0) ["hello","tree"]

The focus will be updated if an item before it is deleted.

>>> let Just fl = fromListFL (Focus 1) ["hello", "bye", "tree"]
>>> deleteFL "hello" fl
FocusList (Focus 0) ["bye","tree"]

If there are multiple matching elements in the FocusList, remove them all.

>>> let Just fl = fromListFL (Focus 0) ["hello", "bye", "bye"]
>>> deleteFL "bye" fl
FocusList (Focus 0) ["hello"]

If there are no matching elements, return the original FocusList.

>>> let Just fl = fromListFL (Focus 2) ["hello", "good", "bye"]
>>> deleteFL "frog" fl
FocusList (Focus 2) ["hello","good","bye"]

Move an existing item in a FocusList to a new index.

The Focus gets updated appropriately when moving items.

>>> let Just fl = fromListFL (Focus 1) ["hello", "bye", "parrot"]
>>> moveFromToFL 0 1 fl
Just (FocusList (Focus 0) ["bye","hello","parrot"])

The Focus may not get updated if it is not involved.

>>> let Just fl = fromListFL (Focus 0) ["hello", "bye", "parrot"]
>>> moveFromToFL 1 2 fl
Just (FocusList (Focus 0) ["hello","parrot","bye"])

If the element with the Focus is moved, then the Focus will be updated appropriately.

>>> let Just fl = fromListFL (Focus 2) ["hello", "bye", "parrot"]
>>> moveFromToFL 2 0 fl
Just (FocusList (Focus 0) ["parrot","hello","bye"])

If the index of the item to move is out bounds, then Nothing will be returned.

>>> let Just fl = fromListFL (Focus 2) ["hello", "bye", "parrot"]
>>> moveFromToFL 3 0 fl
Nothing

If the new index is out of bounds, then Nothing wil be returned.

>>> let Just fl = fromListFL (Focus 2) ["hello", "bye", "parrot"]
>>> moveFromToFL 1 (-1) fl
Nothing

complexity: O(log n) where n is the length of the FocusList.

Intersperse a new element between existing elements in the FocusList.

>>> let Just fl = fromListFL (Focus 0) ["hello", "bye", "cat"]
>>> intersperseFL "foo" fl
FocusList (Focus 0) ["hello","foo","bye","foo","cat"]

The Focus is updated accordingly.

>>> let Just fl = fromListFL (Focus 2) ["hello", "bye", "cat", "goat"]
>>> intersperseFL "foo" fl
FocusList (Focus 4) ["hello","foo","bye","foo","cat","foo","goat"]

The item with the Focus should never change after calling intersperseFL.

getFocusItemFL (fl :: FocusList Int) == getFocusItemFL (intersperseFL a fl)

intersperseFL should not have any effect on a FocusList with less than two items.

emptyFL == intersperseFL x emptyFL

singletonFL a == intersperseFL x (singletonFL a)

complexity: O(n) where n is the length of the FocusList.

Reverse a FocusList. The Focus is updated accordingly.

>>> let Just fl = fromListFL (Focus 0) ["hello", "bye", "cat"]
>>> reverseFL fl
FocusList (Focus 2) ["cat","bye","hello"]

>>> let Just fl = fromListFL (Focus 2) ["hello", "bye", "cat", "goat"]
>>> reverseFL fl
FocusList (Focus 1) ["goat","cat","bye","hello"]

The item with the Focus should never change after calling intersperseFL.

getFocusItemFL (fl :: FocusList Int) == getFocusItemFL (reverseFL fl)

Reversing twice should not change anything.

(fl :: FocusList Int) == reverseFL (reverseFL fl)

Reversing empty lists and single lists should not do anything.

emptyFL == reverseFL emptyFL

singletonFL a == reverseFL (singletonFL a)

complexity: O(n) where n is the length of the FocusList.

Set the Focus for a FocusList.

This is just like updateFocusFL, but doesn't return the newly focused item.

setFocusFL i fl == fmap snd (updateFocusFL i fl)

complexity: O(1)

Update the Focus for a FocusList and get the new focused element.

>>> updateFocusFL 1 =<< fromListFL (Focus 2) ["hello","bye","dog","cat"]
Just ("bye",FocusList (Focus 1) ["hello","bye","dog","cat"])

If the FocusList is empty, then return Nothing.

>>> updateFocusFL 1 emptyFL
Nothing

If the new focus is less than 0, or greater than or equal to the length of the FocusList, then return Nothing.

>>> updateFocusFL (-1) =<< fromListFL (Focus 2) ["hello","bye","dog","cat"]
Nothing

>>> updateFocusFL 4 =<< fromListFL (Focus 2) ["hello","bye","dog","cat"]
Nothing

complexity: O(log(min(i, n - i))) where i is the new index to put the Focus on, and n -- is the length of the FocusList.

Sort a FocusList.

The Focus will stay with the element that has the Focus.

>>> let Just fl = fromListFL (Focus 2) ["b", "c", "a"]
>>> sortByFL compare fl
FocusList (Focus 0) ["a","b","c"]

Nothing will happen if you try to sort an empty FocusList, or a FocusList with only one element.

emptyFL == sortByFL compare emptyFL

singletonFL a == sortByFL compare (singletonFL a)

The element with the Focus should be the same before and after sorting.

getFocusItemFL (fl :: FocusList Int) == getFocusItemFL (sortByFL compare fl)

Sorting a FocusList and getting the underlying Seq should be the same as getting the underlying Seq and then sorting it.

toSeqFL (sortByFL compare (fl :: FocusList Int)) == sortBy compare (toSeqFL fl)

WARNING: The computational complexity for this is very bad. It should be able to be done in O(n * log n), but the current implementation is O(n^2) (or worse), where n is the length of the FocusList. This function could be implemented the same way Data.Sequence.sortBy is implemented. However, a small change needs to be added to that function to keep track of the Focus in the FocusList and make sure it gets updated properly. If you're interested in fixing this, please send a PR.

Create an empty FocusList without a Focus.

>>> emptyFL
FocusList NoFocus []

complexity: O(1)

Create a FocusList with a single element.

>>> singletonFL "hello"
FocusList (Focus 0) ["hello"]

complexity: O(1)

Unsafely create a FocusList. This does not check that the focus actually exists in the list. This is an internal function and should generally not be used. It is only safe to use if you ALREADY know the Focus is within the list.

Instead, you should generally use fromListFL.

The following is an example of using unsafeFromListFL correctly.

>>> unsafeFromListFL (Focus 1) [0..2]
FocusList (Focus 1) [0,1,2]

>>> unsafeFromListFL NoFocus []
FocusList NoFocus []

unsafeFromListFL can also be used uncorrectly. The following is an example of unsafeFromListFL allowing you to create a FocusList that does not pass invariantFL.

>>> unsafeFromListFL (Focus 100) [0..2]
FocusList (Focus 100) [0,1,2]

If fromListFL returns a Just FocusList, then unsafeFromListFL should return the same FocusList.

complexity: O(n) where n is the length of the input list.

Unsafely get the Focus from a FocusList. If the Focus is NoFocus, this function returns error.

This function is only safe if you already have knowledge that the FocusList has a Focus.

Generally, getFocusFL should be used instead of this function.

>>> let Just fl = fromListFL (Focus 1) [0..9]
>>> unsafeGetFocusFL fl
1

>>> unsafeGetFocusFL emptyFL
*** Exception: ...
...

complexity: O(1)

Unsafely get the value of the Focus from a FocusList. If the Focus is NoFocus, this function returns error.

This function is only safe if you already have knowledge that the FocusList has a Focus.

Generally, getFocusItemFL should be used instead of this function.

>>> let Just fl = fromListFL (Focus 0) ['a'..'c']
>>> unsafeGetFocusItemFL fl
'a'

>>> unsafeGetFocusFL emptyFL
*** Exception: ...
...

complexity: O(log(min(i, n - i))) where i is the Focus, and n is the length of the FocusList.

This is an invariant that the FocusList must always protect.

The functions in this module should generally protect this invariant. If they do not, it is generally a bug.

The invariants are as follows:

• The Focus in a FocusList can never be negative.
• If there is a Focus, then it actually exists in the FocusList.
• There needs to be a Focus if the length of the FocusList is greater than 0.

complexity: O(log n), where n is the length of the FocusList.

Given a Gen for a, generate a valid FocusList.

A Focus for the FocusList.

The Focus is either NoFocus (if the Focuslist is empty), or Focus Int to represent focusing on a specific element of the FocusList.

Returns True if a Focus exists, and False if not.

>>> hasFocus (Focus 0)
True

>>> hasFocus NoFocus
False

complexity: O(1)

Get the focus index from a Focus.

>>> getFocus (Focus 3)
Just 3

>>> getFocus NoFocus
Nothing

complexity: O(1)

Convert a Maybe Int to a Focus.

>>> maybeToFocus (Just 100)
Focus 100

>>> maybeToFocus Nothing
NoFocus

maybeToFocus and getFocus witness an isomorphism.

focus == maybeToFocus (getFocus focus)

maybeInt == getFocus (maybeToFocus maybeInt)

complexity: O(1)

A fold function for Focus.

This is similar to maybe for Maybe.

>>> foldFocus "empty" (\i -> "focus at " <> show i) (Focus 3)
"focus at 3"

>>> foldFocus Nothing Just NoFocus
Nothing

foldFocus NoFocus Focus focus == focus

A Prism' for focusing on the Focus constructor in a Focus data type.

A Prism' for focusing on the NoFocus constructor in a Focus data type.

Unsafely get the focus index from a Focus.

Returns an error if NoFocus.

>>> unsafeGetFocus (Focus 50)
50

>>> unsafeGetFocus NoFocus
*** Exception: ...
...

complexity: O(1)