first commit

.gitignore

@@ -0,0 +1,2 @@
+.stack-work/
+*~

CHANGELOG.md

@@ -0,0 +1,11 @@
+# Changelog for `ladder`
+
+All notable changes to this project will be documented in this file.
+
+The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
+and this project adheres to the
+[Haskell Package Versioning Policy](https://pvp.haskell.org/).
+
+## Unreleased
+
+## 0.1.0.0 - YYYY-MM-DD

LICENSE

@@ -0,0 +1,26 @@
+Copyright 2025 Author name here
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+1.  Redistributions of source code must retain the above copyright notice, this
+    list of conditions and the following disclaimer.
+
+2.  Redistributions in binary form must reproduce the above copyright notice,
+    this list of conditions and the following disclaimer in the documentation
+    and/or other materials provided with the distribution.
+
+3.  Neither the name of the copyright holder nor the names of its contributors
+    may be used to endorse or promote products derived from this software
+    without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

README.md

@@ -0,0 +1 @@
+# ladder

Setup.hs

@@ -0,0 +1,2 @@
+import Distribution.Simple
+main = defaultMain

app/Main.hs

@@ -0,0 +1,6 @@
+module Main (main) where
+
+import Lib
+
+main :: IO ()
+main = someFunc

ladder.cabal

@@ -0,0 +1,69 @@
+cabal-version: 2.2
+
+-- This file has been generated from package.yaml by hpack version 0.37.0.
+--
+-- see: https://github.com/sol/hpack
+
+name:           ladder
+version:        0.1.0.0
+description:    Please see the README on GitHub at <https://github.com/githubuser/ladder#readme>
+homepage:       https://github.com/githubuser/ladder#readme
+bug-reports:    https://github.com/githubuser/ladder/issues
+author:         Author name here
+maintainer:     example@example.com
+copyright:      2025 Author name here
+license:        BSD-3-Clause
+license-file:   LICENSE
+build-type:     Simple
+extra-source-files:
+    README.md
+    CHANGELOG.md
+
+source-repository head
+  type: git
+  location: https://github.com/githubuser/ladder
+
+library
+  exposed-modules:
+      Data.AssocMap
+      Graph
+      Lib
+  other-modules:
+      Paths_ladder
+  autogen-modules:
+      Paths_ladder
+  hs-source-dirs:
+      src
+  ghc-options: -Wall -Wcompat -Widentities -Wincomplete-record-updates -Wincomplete-uni-patterns -Wmissing-export-lists -Wmissing-home-modules -Wpartial-fields -Wredundant-constraints
+  build-depends:
+      base >=4.7 && <5
+  default-language: Haskell2010
+
+executable ladder-exe
+  main-is: Main.hs
+  other-modules:
+      Paths_ladder
+  autogen-modules:
+      Paths_ladder
+  hs-source-dirs:
+      app
+  ghc-options: -Wall -Wcompat -Widentities -Wincomplete-record-updates -Wincomplete-uni-patterns -Wmissing-export-lists -Wmissing-home-modules -Wpartial-fields -Wredundant-constraints -threaded -rtsopts -with-rtsopts=-N
+  build-depends:
+      base >=4.7 && <5
+    , ladder
+  default-language: Haskell2010
+
+test-suite ladder-test
+  type: exitcode-stdio-1.0
+  main-is: Spec.hs
+  other-modules:
+      Paths_ladder
+  autogen-modules:
+      Paths_ladder
+  hs-source-dirs:
+      test
+  ghc-options: -Wall -Wcompat -Widentities -Wincomplete-record-updates -Wincomplete-uni-patterns -Wmissing-export-lists -Wmissing-home-modules -Wpartial-fields -Wredundant-constraints -threaded -rtsopts -with-rtsopts=-N
+  build-depends:
+      base >=4.7 && <5
+    , ladder
+  default-language: Haskell2010

package.yaml

@@ -0,0 +1,59 @@
+name:                ladder
+version:             0.1.0.0
+github:              "githubuser/ladder"
+license:             BSD-3-Clause
+author:              "Author name here"
+maintainer:          "example@example.com"
+copyright:           "2025 Author name here"
+
+extra-source-files:
+- README.md
+- CHANGELOG.md
+
+# Metadata used when publishing your package
+# synopsis:            Short description of your package
+# category:            Web
+
+# To avoid duplicated efforts in documentation and dealing with the
+# complications of embedding Haddock markup inside cabal files, it is
+# common to point users to the README.md file.
+description:         Please see the README on GitHub at <https://github.com/githubuser/ladder#readme>
+
+dependencies:
+- base >= 4.7 && < 5
+
+ghc-options:
+- -Wall
+- -Wcompat
+- -Widentities
+- -Wincomplete-record-updates
+- -Wincomplete-uni-patterns
+- -Wmissing-export-lists
+- -Wmissing-home-modules
+- -Wpartial-fields
+- -Wredundant-constraints
+
+library:
+  source-dirs: src
+
+executables:
+  ladder-exe:
+    main:                Main.hs
+    source-dirs:         app
+    ghc-options:
+    - -threaded
+    - -rtsopts
+    - -with-rtsopts=-N
+    dependencies:
+    - ladder
+
+tests:
+  ladder-test:
+    main:                Spec.hs
+    source-dirs:         test
+    ghc-options:
+    - -threaded
+    - -rtsopts
+    - -with-rtsopts=-N
+    dependencies:
+    - ladder

src/Data/AssocMap.hs

@@ -0,0 +1,54 @@
+module Data.AssocMap
+  ( AssocMap,
+    empty,
+    insert,
+    delete,
+    alter,
+    member,
+    lookup,
+    findWithDefault,
+  )
+where
+
+import qualified Data.List as List
+import Data.Maybe (fromMaybe, isJust)
+import Prelude hiding (lookup)
+
+newtype AssocMap k v = AssocMap [(k, v)]
+
+empty :: AssocMap k v
+empty = AssocMap []
+
+delete :: (Eq k) => k -> AssocMap k v -> AssocMap k v
+delete = alter (const Nothing)
+
+insert :: (Eq k) => k -> v -> AssocMap k v -> AssocMap k v
+insert key value = alter (const (Just value)) key
+
+member :: (Eq a) => a -> AssocMap a b -> Bool
+member x (AssocMap xs) = isJust (List.lookup x xs)
+
+lookup :: (Eq k) => k -> AssocMap k v -> Maybe v
+lookup key (AssocMap xs) = List.lookup key xs
+
+findWithDefault :: (Eq k) => v -> k -> AssocMap k v -> v
+findWithDefault defaultValue key assocMap = fromMaybe defaultValue (lookup key assocMap)
+
+alter :: (Eq k) => (Maybe v -> Maybe v) -> k -> AssocMap k v -> AssocMap k v
+alter f key (AssocMap xs) = AssocMap (alter' xs)
+  where
+    {-
+      If list is empty, it means the key is missing, so we evaluate the provided function with Nothing.
+      If the function evaluates to Nothing, we keep the list empty.
+      If the function evaluates to a value, we add a mapping between key and value.
+    -}
+    alter' [] = maybe [] (\value -> [(key, value)]) (f Nothing)
+    {-
+    If the list is not empty, we recursively search for a mapping that has the provided key.
+    If the there is a mapping with the provided key, we call the function passing the found value.
+    If the function evaluates to Nothing, we delete the mapping.
+    If the function evaluates to a value, we update the mapping.
+    -}
+    alter' ((key', value') : xs')
+      | key == key' = maybe xs' (\value -> (key, value) : xs') (f (Just value'))
+      | otherwise = (key', value') : alter' xs'

src/Graph.hs

@@ -0,0 +1,59 @@
+module Graph
+  ( DiGraph,
+    hasNode,
+    addNode,
+    empty,
+    addEdge,
+    addEdges,
+    buildDiGraph,
+    children,
+    deleteEdge,
+    deleteEdges,
+    deleteNode,
+    deleteNodes,
+  )
+where
+
+import qualified Data.AssocMap as M
+import qualified Data.List as L
+
+type DiGraph a = M.AssocMap a [a]
+
+empty :: DiGraph a
+empty = M.empty
+
+hasNode :: (Eq a) => DiGraph a -> a -> Bool
+hasNode = flip M.member
+
+addNode :: (Eq a) => DiGraph a -> a -> DiGraph a
+addNode graph node = M.insert node [] graph
+
+addEdge :: (Eq a) => (a, a) -> DiGraph a -> DiGraph a
+addEdge (node, child) = M.alter insertEdge node
+  where
+    insertEdge Nothing = Just [child]
+    insertEdge (Just nodes) = Just $ L.nub (child : nodes)
+
+addEdges :: (Eq a) => [(a, a)] -> DiGraph a -> DiGraph a
+addEdges edges graph = foldr addEdge graph edges
+
+buildDiGraph :: (Eq a) => [(a, [a])] -> DiGraph a
+buildDiGraph = foldr (\(node, childs) -> M.insert node (L.nub childs)) M.empty
+
+children :: (Eq a) => a -> DiGraph a -> [a]
+children = M.findWithDefault []
+
+deleteNode :: (Eq a) => a -> DiGraph a -> DiGraph a
+deleteNode = M.delete
+
+deleteNodes :: (Eq a) => [a] -> DiGraph a -> DiGraph a
+deleteNodes nodes graph = foldr deleteNode graph nodes
+
+deleteEdge :: (Eq a) => (a, a) -> DiGraph a -> DiGraph a
+deleteEdge (node, child) = M.alter aux node
+  where
+    aux Nothing = Nothing
+    aux (Just nodes) = Just (L.delete child nodes)
+
+deleteEdges :: (Eq a) => [(a, a)] -> DiGraph a -> DiGraph a
+deleteEdges edges graph = foldr deleteEdge graph edges

src/Lib.hs

@@ -0,0 +1,6 @@
+module Lib
+    ( someFunc
+    ) where
+
+someFunc :: IO ()
+someFunc = putStrLn "someFunc"

stack.yaml

@@ -0,0 +1,66 @@
+# This file was automatically generated by 'stack init'
+#
+# Some commonly used options have been documented as comments in this file.
+# For advanced use and comprehensive documentation of the format, please see:
+# https://docs.haskellstack.org/en/stable/configure/yaml/
+
+# A 'specific' Stackage snapshot or a compiler version.
+# A snapshot resolver dictates the compiler version and the set of packages
+# to be used for project dependencies. For example:
+#
+# snapshot: lts-23.0
+# snapshot: nightly-2024-12-13
+# snapshot: ghc-9.8.4
+#
+# The location of a snapshot can be provided as a file or url. Stack assumes
+# a snapshot provided as a file might change, whereas a url resource does not.
+#
+# snapshot: ./custom-snapshot.yaml
+# snapshot: https://example.com/snapshots/2024-01-01.yaml
+snapshot: lts-22.43
+
+# User packages to be built.
+# Various formats can be used as shown in the example below.
+#
+# packages:
+# - some-directory
+# - https://example.com/foo/bar/baz-0.0.2.tar.gz
+#   subdirs:
+#   - auto-update
+#   - wai
+packages:
+- .
+# Dependency packages to be pulled from upstream that are not in the snapshot.
+# These entries can reference officially published versions as well as
+# forks / in-progress versions pinned to a git hash. For example:
+#
+# extra-deps:
+# - acme-missiles-0.3
+# - git: https://github.com/commercialhaskell/stack.git
+#   commit: e7b331f14bcffb8367cd58fbfc8b40ec7642100a
+#
+# extra-deps: []
+
+# Override default flag values for project packages and extra-deps
+# flags: {}
+
+# Extra package databases containing global packages
+# extra-package-dbs: []
+
+# Control whether we use the GHC we find on the path
+# system-ghc: true
+#
+# Require a specific version of Stack, using version ranges
+# require-stack-version: -any # Default
+# require-stack-version: ">=3.3"
+#
+# Override the architecture used by Stack, especially useful on Windows
+# arch: i386
+# arch: x86_64
+#
+# Extra directories used by Stack for building
+# extra-include-dirs: [/path/to/dir]
+# extra-lib-dirs: [/path/to/dir]
+#
+# Allow a newer minor version of GHC than the snapshot specifies
+# compiler-check: newer-minor

stack.yaml.lock

@@ -0,0 +1,12 @@
+# This file was autogenerated by Stack.
+# You should not edit this file by hand.
+# For more information, please see the documentation at:
+#   https://docs.haskellstack.org/en/stable/topics/lock_files
+
+packages: []
+snapshots:
+- completed:
+    sha256: 08bd13ce621b41a8f5e51456b38d5b46d7783ce114a50ab604d6bbab0d002146
+    size: 720271
+    url: https://raw.githubusercontent.com/commercialhaskell/stackage-snapshots/master/lts/22/43.yaml
+  original: lts-22.43

test/Spec.hs

@@ -0,0 +1,2 @@
+main :: IO ()
+main = putStrLn "Test suite not yet implemented"