refset

#!/usr/bin/env python3

# MIT License

# Copyright (c) 2023-2024 Håkan Råberg and Steven Deobald

# Copyright (c) 2024 JUXT Ltd

# Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

refset

;; Imagine you have Persons and Dogs entities in you database, with a :dog/master relationship from Dogs to Persons

;; you want a report of how many dog each person in you database has, as a set of [<person-name> <number-of-dogs>], e.g:

#{["John Doe" 3]
  ["Foo bar" 0]
  ["Chuck Norris" 1]}

;; in particular, you want person who do not have a dog to appear in this report.

refset

(defn relate [& pairs]
  (assert (even? (count pairs)) "relate requires an even number of arguments")
  (->> pairs
       (partition 2)
       (map (fn [[k vs]] (map #(hash-map k %) vs)))
       (apply map merge)))


(defn matches-specmap? [specmap m]
  (reduce-kv

refset

(ns explore-datafy-nav
  "Sample code demonstrating naving around a random graph of data.
   The graph very likely will have circular references, which is not a problem.
   To see the results, execute the entire file.
   Each step in the nav process will be printed out, as well as the initial db.
   Subsequent executions will generate a new random db."
  (:require [clojure.datafy :refer [datafy nav]]))

(defn generate-db
  "Generate a random database of users and departments.

refset

(ns excel.api.s3
  (:require [cognitect.aws.client.api :as aws]
            [integrant.core :as ig]
            [clojure.tools.logging :as log]))

(defmethod ig/init-key ::client
  [_ _]
  (create-s3-client))

;; Code below may end up being a periodic background process for limiting s3

refset

;; Assumes https://github.com/jstepien/flames available
;; requires http://riemann.io to be installed.
(def flames (atom nil))

(defn flames-start! []
   ;; We resolve explicitly here, to avoid warnings when not working
   ;; with flamegraphs
  (if-not @flames
    (let [config {:port 54321, :host "localhost"}]
      (reset! flames ((requiring-resolve 'flames.core/start!) config))

refset

(-> (java.lang.management.ManagementFactory/getRuntimeMXBean)
    (.getName)
    (clojure.string/split #"@")
    (first))

refset

(defn visit [m visitors]
  ;; [node node-s next-s down-s right-s get-right get-down init-right-s cut-down cut-right :as m]
  ;; {:keys [break]} next-s
  ;; ;use next-state by default, unless down or right is necessary
  (let
    [dovisit (fn [m dir]
               (loop [s m [v & vs] visitors]
                 (if v (recur (apply v (concat [dir] s)) vs) s)))
     m2 (dovisit m :pre)
     ;break/cut checks should be between each visitor (:pre :post and :in) according to zip-visit

refset

  ;; LWW Register
  ;; https://speakerdeck.com/ept/data-structures-as-queries-expressing-crdts-using-datalog?slide=15

  (def schema
    {:assign/time  {:db/valueType :Number}
     :assign/key   {:db/valueType :Number}
     :assign/value {:db/valueType :Number}})

  (def rules
    '[[(older ?t1 ?key)

refset

  ;; RGA
  ;; https://speakerdeck.com/ept/data-structures-as-queries-expressing-crdts-using-datalog?slide=22

  (def schema
    {:id/node       {:db/valueType :Number}
     :id/ctr        {:db/valueType :Number}
     :insert/id     {:db/valueType :Eid}
     :insert/parent {:db/valueType :Eid}
     :assign/id     {:db/valueType :Eid}
     :assign/elem   {:db/valueType :Eid}