Haskell: moving image on horizontal line

by

The fundamental algorithm is the same as your vertical shift function, since String is also a list of characters, [Char].

You can generalize your algorithm to a move function since the code for moveVer really only requires a list and has no dependency on Img:

move :: Int -> [a] -> [a]
move n xs = take len $ drop (mod n len) $ cycle xs
  where len = length xs

Now you can rewrite your moveVer function in terms of move:

moveVer :: Int -> Img -> Img
moveVer = move

And since a string is just a List of characters, you can map over the list of strings and use the move function to do your horizontal movement.

moveHor :: Int -> Img -> Img
moveHor n = map $ move n

More Related Contents:

  1. Getting started with Haskell
  2. Applicatives compose, monads don’t
  3. What does (f .) . g mean in Haskell?
  4. Is there a Haskell idiom for updating a nested data structure?
  5. How do you represent a graph in Haskell?
  6. What are paramorphisms?
  7. Is monad bind (>>=) operator closer to function composition (chaining) or function application?
  8. Large-scale design in Haskell? [closed]
  9. How to compare two functions for equivalence, as in (λx.2*x) == (λx.x+x)?
  10. What are “n+k patterns” and why are they banned from Haskell 2010?
  11. Should do-notation be avoided in Haskell?
  12. Applicative functor evaluation is not clear to me
  13. What constitutes a fold for types other than list?
  14. Ordering of parameters to make use of currying
  15. Pattern matching identical values
  16. How to use (->) instances of Monad and confusion about (->)
  17. Abusing the algebra of algebraic data types – why does this work?
  18. Iterate over all pair combinations without repetition in Haskell
  19. How to interpret bind/>>= of the function instance?
  20. What’s the status of multicore programming in Haskell?
  21. What does “pure” mean in “pure functional language”?
  22. Implement zip using foldr
  23. How to enumerate a recursive datatype in Haskell?
  24. Functional lenses
  25. Why does OCaml sometimes require eta expansion?
  26. How Monads are considered pure?
  27. How to compare two functions for extensional equivalence, as in (λx.2*x) == (λx.x+x)?
  28. Explanation of “tying the knot”
  29. ‘some’ and ‘many’ functions from the ‘Alternative’ type class [duplicate]
  30. Sampling sequences of random numbers in Haskell

Leave a Comment