Alternate method to dependent, nested if statements to check multiple states
Is there an easier way to process multiple true/false states than using nested if statements? I think there is, and it would be to create a sequence of states, and then use a function like when to determine if all states were true, and drop out if not. I am asking the question to make sure there is not a preferred Clojure way to do this.
Setting up Clojure Project And Sub Projects
This is primarily a lein question about setting up a major project and its sub-projects, and is not intended to be a discussion question. Instead, I am interested in either a pointer to documentation or to a Clojure/lein best practices link.
Can Clojure’s thread-based agents handle c10k performance?
I’m writing a c10k-style service and am trying to evaluate Clojure’s performance. Can Clojure agents handle this scale of concurrency with its thread-based agents? Other high performance systems seem to be moving towards async-IO/events/greenlets, albeit at a seemingly higher complexity cost.
Why can’t we write nested shorthand functions in Clojure?
I tried to evaluate a Clojure expression with nested shorthand functions today, and it wouldn’t let me.
What’s so great about Clojure? [closed]
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for […]
How to type hint `cond->` within `->`
The following code produces two reflection warnings (for .getBytes):
How will the new development of Java influence its interoperability with languages like Scala and Clojure?
As far as I understand, both Scala and Clojure have been designed as new languages that
Is Clojure a 3GL or a 4GL?
A bit of background (in case I’m mistaken)…
Accessing the history of a `ref` in Clojure
The documentation for ref shows a :max-history option and states that “refs accumulate history dynamically as needed to deal with read demands.” I can see that there is history at the REPL, but I don’t see how to find previous values of a ref:
Byte code weaving vs Lisp macros
I have been reading about the libraries people have written for languages like Java and C# that make use of byte code weaving to do things like intercept function calls, insert logging code, etc. I have also been reading up on Lisp/Clojure macros in an attempt to better understand how to utilize them. The more I read about macros, the more it seems like they provide the same kind of functionality as byte code weaving libraries. By functionality, I mean the ability to manipulate code at compile time.