Fork me on GitHub

So I’m looking for a GUI framework to use on desktop, something with minimal boilerplate. I think I can store my state in flat edn files.


@U01KQ9EGU79 - This one looks promising


I think a reagent based tookit will be good as I’m quite comfortable with hiccup.


Was also checking out electron.

Thomas Tay02:02:45

I'm confused - if you're looking for desktop gui, why not use Swing


Some of the options on desktop are: • (no event handling afaik) • clojure library on top of JavaFX • clojure library on top of swing • any cljs lib + electron • Obviously, I'm biased towards the last one (membrane)

👍 1

Ok, maybe I don’t care about boilerplate too much. I could go with electron because it’s what I know and I have access to node for more flexibility.

👍 1

I've used electron before and it works well


Anyone try using proton native with cljs?


Alright, so I got Electron working. I have no idea how to make tabs in clojurescript or reagent. What are some general concepts I should think about when making tabs?


Nevermind. Got tabs working just fine.


On the topic of databases and persistent storage. What's the preferred way to store data? I was planning on straight up using edn files, but given that my app is going to be electron and cljs based, and that I also don't want to use any SQL, which solution do you guys recommend? Another possibility is I could stick with flat edn and somehow use clojure as my backend instead of nodejs.


I usually end up with a DB anyway even if I start with flat files. You can try datalevin if you want to use datalog. Else an embedded db like sqlite or hsqldb might also work well.


How exactly does something like Datalevin work? Does it create a file? If so, what file? What format? Is there a default location?


I think you should compare it to sqlite: do you care in which format sqlite stores its db?


I more so want to be able to find it. Like I care if it’s a dotfile or stored in /tmp/ or something like that.


I just took a look at the datalevin binary.


$ dtlv --help

  Datalevin (version: 0.4.9)

Usage: dtlv [options] [command] [arguments]

  exec  Execute database transactions or queries
  copy  Copy a database, regardless of whether it is now in use
  drop  Drop or clear a database
  dump  Dump the content of a database to standard output
  load  Load data from standard input into a database
  stat  Display statistics of database

  -a, --all        Include all of the sub-databases
  -c, --compact    Compact while copying.
  -d, --dir PATH   Path to the database directory
  -D, --delete     Delete the sub-database, not just empty it
  -f, --file PATH  Path to the specified file
  -g, --datalog    Dump/load as a Datalog database
  -h, --help       Show usage
  -l, --list       List the names of sub-databases instead of the content
  -V, --version    Show Datalevin version and exit

Omit the command to enter the interactive shell.
See 'dtlv help <command>' to read about a specific command.


In the code you will refer to the db file as (def conn (d/get-conn "/var/datalevin/mydb" schema))


so it's pretty clear where it stores the data


Ah I see. Thank you for your help. Imma try understanding and implementing it now.


how would you merge list of maps into a map? :thinking_face:

Umar Daraz10:02:07

(apply merge [{:a 1} {:b 2}])  => {:a 1 :b 2}

💪 1
Umar Daraz10:02:38

@audrius are you looking for something like this


You could replay in a thread. That would remove a need to tag specific person and prevent from common mistake - tagging wrong person 😉

😄 1
🍻 1
Umar Daraz11:02:49

Sorry audrius, keep that in mind 💡

Jim Newton12:02:03

What is the correct way to control the clojure random number generator. I see the functions and ? But I don't see the discussion of how to get and set the random seed, how to reset the generator to a previous state (e.g., for reproducing errors in functions which use random numbers), and how to assure (or whether it is assured) that new processes get their seed set the same way.


@jimka.issy It's probably better to use a library like or clojure.test.check for this


or raw Java interop


In particular, class java.util.Random provides an explicit method to set the seed, and a variety of methods to get different distributions/types of randomly generated values from such a generator.


There is also SecureRandom

Jim Newton13:02:17

Sorry, to help me understand. are you suggesting I should avoid rand, rand-int and rand-nth, and in stead use the java Random interface? Or are you suggesting that rand, rand-int, and rand-nth promise to use the java Random interface, so I can mix and match them freely?


the first, if you need seed


I believe that the JVM methods used by the Clojure function rand has no way of setting a seed explicitly.


That is the reason for suggesting the former, if you want to explicitly assign seed values.


sometimes i run a lein run command and after completion, the process doesn't exit, so I have to CTRL-C to exit


anyone know why this happens or how I can prevent it?


if the code ever uses pmap for example, there are going to be non-daemon threads running (which prevents the JVM from shutting down)


Thanks! I'm not using pmap anywhere, but I do call require instead of using :require in the ns macro. i'll poke around to see what i'm missing


turns out I had a call in another file that was doing somthing like that. thanks for the heads-up to both of you!

🎉 1

q: does anyone have a recommendation for clojure friendly jvm instrumentation ? Something like newrelic or dynatrace


Instrumentation for what purpose? Profiling? Perhaps this can be useful: (edited)


hmm. I'm looking to get metrics on our app's performance and to capture errors


There are obviously a number of choices; Elastic APM has worked fine for me. Quite easy to write your own simple wrapper around the Java agent API. Or I guess you can also take a wrapper such as, provided to you by the Finnish national public broadcasting company.

👍 1

@U051Q4BJY We'll been using New Relic in production for years with Clojure and we've been very happy with it. A couple of caveats: if you're using a "non-standard web server", such as http-kit, New Relic doesn't support that very well (we switched back to Jetty to address this); adding Trace metadata is a bit of a pain -- I blogged about that some years ago on (and see also which may have been addressed in a later New Relic release but I think we still have that config in place).

👍 1

ok, I'm familiar with newrelic from my days as a rails dev, so I think I'll start exploring that now that I know it's viable.. Thank you everyone for your feedback - very much appreciated!


Feel free to DM me with Qs if you run into issues with New Relic and Clojure @U051Q4BJY

🙏 1

thanks - the project I'm instrumenting uses aleph, so I have a feeling it fits in the 'non-standard' category


Definitely. I was able to get some way with http-kit by explicitly telling New Relic to instrument certain classes/methods via configuration. Not sure if I still have that on hand but I can search our repo history for it if needed.


I just tried out the clojure-metrics library the other day for the first time, it may have some useful tools for you.

👀 1

We just recently migrated from New Relic's old plugin architecture (and their ancient metrics Java lib) to the new Telemetry SDK stuff which provides access to their Metrics API as well as Logging API and a couple of other APIs. Apart from the resolutely Java-focused API design, it was pretty easy to get it all integrated and working. We publish a lot of custom application metrics. (I ranted about this SDK on Twitter recently because of the custom types it uses to try to encapsulate what could just be a regular hash map!)


looks like I have the go-ahead to change our webserver from aleph to jetty, so that's step one. I'm hoping it's as straightforward as it seems 🤞

Eric Ihli18:02:43

Thoughts on this idea? I'm trying to turn a Trie data structure that is represented in Clojure as a HashMap (`{"D" {"O" {"G" {:val "DOG"} "T" {:val "DOT"}} :val "DO"}}`) into a "" which is just a raw array of bytes in a particular order. To work with that trie-as-a-byte-array data structure, I need some help navigating around the byte array. I was thinking some type of "cursor". It has a reference to the byte array, but all the iteration protocols are implemented by adjusting the location of the cursor. Something like this...

(defprotocol IByteArrayCursor
  (loc [_])
  (jump [_ loc] "Moves location of cursor to specified index.")
  (forward [_] [_ n])
  (backward [_] [_ n])
  (slice [_ end])
  (ba= [_ other-ba]))

(deftype ByteArrayCursor [ba loc]
  (nth [_ i]
    (if (and (>= i 0)
             (< i (count ba)))
      (ByteArrayCursor. ba i)
      (throw (ex-info "Index out of bounds."))))
  (nth [self i not-found]
    (if (and (>= i 0)
             (< i (count ba)))
      (ByteArrayCursor. ba i)

  (loc [_] loc)
  (jump [_ loc] (ByteArrayCursor. ba loc))
  (forward [_ n] (ByteArrayCursor. ba (+ loc n)))
  (backward [_ n] (ByteArrayCursor. ba (- loc n)))
  (slice [_ n]
    (loop [i 0 r []]
      (if (or (= i n)
              (>= (+ loc i) (count ba)))
        (ByteArrayCursor. (byte-array r) 0)
        (recur (inc i) (conj r (aget ba (+ i loc)))))))
Is this reasonable? Am I overlooking a simpler alternative? Am I not seeing any particular "gotchas"? Thanks for any thoughts anyone has.


i think you're making a zipper. i'd check out that


It seems odd that a 'cursor' implements a slice operation like that. If the cursor is really just an index into a byte array ...

Eric Ihli18:02:09

That's a good point. I might not need it. I'm basically doing a lot of packing and unpacking bytes. So I'll read one byte that says "The next 20 bytes make up that value you want to decode.". Then I'll take a 20 byte slice and send it to the decode function. That decode function also makes use of the cursor functionality. But it eventually reads all the way to the end of whatever its given. I guess another type of interface that would give me the functionality of being able to read from the start to the end of some bytes in the middle of a byte array would be a "view" rather than a "slice".


are you aware of java.nio.ByteBuffer?


(it is super mutable, which is meh)


but it basically does all those things

Eric Ihli18:02:06

Oh interesting. That looks like a great idea. I think a wrapper around ByteBuffer will be nice.

Scott Starkey19:02:59

Hi there, folks. I’m trying to sort a map with an initial decreasing numeric sort and a tie-breaker alphabetical sort.

[{:name "Andy", :score 22} {:name "Charlie", :score 25} {:name "Bruce", :score 25} {:name "Xerxes, :score 7}]
This should sort to be:
[{:name "Bruce", :score 25} {:name "Charlie", :score 25} {:name "Andy", :score 22} {:name "Xerxes, :score 7}]
The tie of “:score 25” is resolved alphabetically by the :name field. I’ve looked at sort-by and it shows examples of tie-breaker sorts. I see examples of with juxt, and examples of overriding with with >. However, I’m having problems finding examples that combine the two. Can someone help? Thanks in advance!


@scotto (juxt (comp - :score) :name) is probably good enough for your needs here?


Although your data seems to have a string for the :score for "Andy" -- is that true? (that scores can be strings or numbers)


If you have to deal with potential strings sorting as the number they represent, you'll need a helper function in there, something like (fn [s] (if (string? s) (Long/parseLong s) s)) -- which can go in the comp between - and :score

Scott Starkey19:02:12

Oops, I did not mean a string for Andy’s score. 🙂 Thanks for the catch


speaking of Andy is a guide for writing and using comparators in clojure, which is another way to do this

👍 1
Scott Starkey19:02:18

I’ll check it out.

Scott Starkey19:02:49

Wow @hiredman - That page is excellent and thorough! Thanks!

Scott Starkey20:02:23

Also, I had to scratch my head a while about the minus sign in @seancorfield’s example above. I think the minus sign is a negative-making function, so sorting by the scores negatively sorts them descending. That’s a nice little trick! Thanks!


(comp - :score) = (fn [data] (- (:score data))) or (fn [data] (- 0 (:score data)))


There's also clojure.core/unchecked-negate

dev master22:02:14

is it possible to load a clojure script file from java, and then execute a function from that clojure file?


one call to require the ns, another to lookup the function, then you can invoke it


Alright, so I got Electron working. I have no idea how to make tabs in clojurescript or reagent. What are some general concepts I should think about when making tabs?


On the topic of databases and persistent storage. What's the preferred way to store data? I was planning on straight up using edn files, but given that my app is going to be electron and cljs based, and that I also don't want to use any SQL, which solution do you guys recommend? Another possibility is I could stick with flat edn and somehow use clojure as my backend instead of nodejs.