Is this serious? No one knows how to create a login form in Compojure?
I'm seriously confused. I can create accounts, but I can't get the
login part to work. What could I possibly be doing wrong? Is there
anything in my code that indicates something wrong? Is there anything
I could show that could
Hi,
First all congratulations to the new release!
Looking at the change log, I'm not sure I understand the following:
"Explicit output-schema metadata on a fnk is taken as gold, rather than
being merged with explicit data by analyzing the fnk body, and must be
explicit rather than a spec"
Thx
Se
Yes, I suppose that's not very clear.
Fnk attempts to guess the output schema of your function by looking at the
body -- if the return value has literal map structure, this is
automatically taken as the output schema. Since this analysis is fragile
(maps are created programatically, within a l
Scrypt is a tiny Clojure library for working with the scrypt key derivation
function. It is an alternative to bcrypt and PBKDF2.
Release notes:
http://blog.clojurewerkz.org/blog/2013/05/02/scrypt-1-dot-0-0-is-released/
--
MK
http://github.com/michaelklishin
http://twitter.com/michaelklishin
--
I've been refactoring some code recently, part of which has include the
introduction of higher-order function. But this is causing me some
grief in terms of extra work. Let me give an example:
user> (defn my-function [x y])
#'user/my-function
user> (doc my-function)
-
use
I committed the codebase to github. I'm open-sourcing the whole
project anyways, so here is what I have thus far. Since I'm stuck at
the login, the conversion stops there, so this isn't the complete
codebase and basically still a skeleton:
https://github.com/dt1/SoloResume
--
--
You received th
I've been working on my proposal for this project. Here's a rough draft:
https://gist.github.com/olenhad/5501208 of what I have so far. Would love
some eye balls to verify if its on the right track.
Its a little rushed as I just got free from exams.
Cheers
Omer
@olenhad
On Mon, Feb 25, 2013 at
Hey Jozef and others,
I am looking for a clojure developer for a project or even employment. The
company is a well funded startup located in the center of vienna and we
have built a collaborative editing web app (similar to google docs - but
for plain html) fully based on clojure.
Anyone inter
phillip.l...@newcastle.ac.uk (Phillip Lord) writes:
> I've been refactoring some code recently, part of which has include
> the introduction of higher-order function. But this is causing me some
> grief in terms of extra work. Let me give an example:
>
> user> (defn my-function [x y])
> #'user/my-
Hi everyone,
I was wondering if the interceptor concept from Pedestal would also be a
good fit in this proposal ?
>From what I gathered it helps break the flow of execution of the handling
of requests while still having
something that looks like ring middlewares.
Am I off topic or is there so
Hmm, interesting, but games usually involve much state and changes to keep
up their worlds alive.. how do you abstract over this? For example, if you
need to move something, then surely you will call for a change.. right
inside the user code that happens all the time.. isn't it so? Just
interes
Hi,
> Does this make more sense?
Yes, it's all clear now. :)
> Do you forsee running into any issues with this change?
NATM.
thx
Las
2013/5/2 Jason Wolfe
> Yes, I suppose that's not very clear.
>
> Fnk attempts to guess the output schema of your function by looking at the
> body -- if the r
Tassilo Horn writes:
>> I've been refactoring some code recently, part of which has include
>> the introduction of higher-order function. But this is causing me some
>> grief in terms of extra work. Let me give an example:
>>
>> user> (defn my-function [x y])
>> #'user/my-function
>> user> (doc my
lazy-seq only delays its own evaluation, it is not "recursive" :
(lazy-seq [0 1 2 3]) will evaluate the whole vector as soon as it is
forced. This means that it should wrap the tail of the lazy sequence
you are building.
Consequently, I find that the easiest way to use lazy-seq is as a
second argu
phillip.l...@newcastle.ac.uk (Phillip Lord) writes:
>> Well, that's nothing special wrt. higher-order functions, but a
>> limitation when you define functions with `def`. E.g.,
>>
>> (def my-function (fn [x y]))
>
> Yes, of course. But I have defn to use an option in this case.
Sure. `defn`
On May 2, 2013 2:04 AM, "David Toomey" wrote:
> Is there anything
> I could show that could reveal the problem?
Yes, you should have shown the stack trace of the exception (or at least
the part from the top of the text down to your code).
But even without that, you have an error coming out of no
A very simple library for loading application level config from a
configuration file in a nice way, with caching and reloading functionality.
Any other configuration libraries I found were either massively overkill
for my needs (full on validation schemas built in), too complicated to set
up a
On 2 May 2013 12:09, Alex Fowler wrote:
> Hmm, interesting, but games usually involve much state and changes to keep
> up their worlds alive.. how do you abstract over this?
I work out what changes are required to the scene by comparing the current
data structure with the previous one, then cha
Tassilo Horn writes:
>>> But since you have to add the docstring by hand anyway, I don't think
>>> that's much of an issue:
>>>
>>> (def ^{:doc "Applies my-function to 10 and y."
>>> :arglists '([y])}
>>>my-partial-function (partial my-function 10))
>>
>> Sure this is what I hav
On Thu, May 2, 2013 at 8:33 AM, Phillip Lord
wrote:
> Well, I guess I will code up a simple macro; in my current case, I can
> infer the arglists anyway.
>
Once you do, be sure to weigh the complexity against:
(defn my-partial-function [y] (my-function 10 y))
--
--
You received this message b
Hi, what do you think about dsl version using map?
Nice Idea was proposed here
http://www.reddit.com/r/Clojure/comments/1djbio/growing_a_lanugage_with_clojure_and_instaparse/c9qwv4d
On Tuesday, April 9, 2013 12:41:38 PM UTC+3, puzzler wrote:
>
> On Tue, Apr 9, 2013 at 1:33 AM, Tassilo Horn >wrot
On May 2, 5:21 am, "John D. Hume" wrote:
> On May 2, 2013 2:04 AM, "David Toomey" wrote:
>
> > Is there anything
> > I could show that could reveal the problem?
>
> Yes, you should have shown the stack trace of the exception (or at least
> the part from the top of the text down to your code).
>
I've never used noir and have barely used 4clojure, but both of them
apparently do hidden global things that make it hard to know the context in
which your code is running. Your app needs to be wrapped in noir's
`wrap-noir-session` middleware in much the same way this blog post shows
Ring's `wrap-s
On Thursday, May 2, 2013 10:19:51 AM UTC-4, David Toomey wrote:
>
> [snipped]
If you want help in the future, I'd recommend spending less time demanding
answers and more time reading responses and code.
I've never looked at the 4clojure source, didn't even know it was on
github. I've never us
>> Does the projects look like the work of someone that is an utter moron
... your response certainly is.
On Thu, May 2, 2013 at 10:28 AM, Jay Fields wrote:
> On Thursday, May 2, 2013 10:19:51 AM UTC-4, David Toomey wrote:
>
>>
>> [snipped]
>
>
> If you want help in the future, I'd recommend s
"John D. Hume" writes:
> On Thu, May 2, 2013 at 8:33 AM, Phillip Lord
> wrote:
>
>> Well, I guess I will code up a simple macro; in my current case, I can
>> infer the arglists anyway.
>>
>
> Once you do, be sure to weigh the complexity against:
>
> (defn my-partial-function [y] (my-function 10 y
Devin Walters writes:
> Voicing strong disagreement with using emacs-live as a starting
> point. One reason: They rebind a bunch of default emacs bindings,
> which is just fine by me, but C-h to a newcomer is important, and IIRC
> they rebound it.
>
> I think Phil's emacs-starter-kit modules/pack
Nice! Thank you for open-sourcing it.
Il giorno giovedì 2 maggio 2013 10:10:38 UTC+2, Michael Klishin ha scritto:
>
> Scrypt is a tiny Clojure library for working with the scrypt key derivation
> function. It is an alternative to bcrypt and PBKDF2.
>
> Release notes:
> http://blog.clojurewerkz.org
I agree with you, but personally found that the starter-kit wasn't as divergent
from the norm as emacs-live and didn't have as many strong opinions. My big
complaint is really just the rebinding of C-h. It's important for newcomers to
be able to use that to learn about bindings and so on that ar
After a year and a half of use, I still don't know anything about C-h, I've
gotten by for a year or so on 'M-x describe-bindings' and more ad-hoc
methods of finding stuff out.
On Thu, May 2, 2013 at 1:29 PM, Devin Walters wrote:
> I agree with you, but personally found that the starter-kit wasn
Titanium [1] is a Clojure graph library built on top of Aurelius Titan.
1.0.0-beta1 is a major development milestone that upgrade Titanium to Titan
0.3,
extracts Blueprints graph operations into a separate library (Archimedes)
and
switches Titanium to Ogre [2] for graph querying. This release has
On Thu, May 2, 2013 at 7:19 AM, Max Gonzih wrote:
> Hi, what do you think about dsl version using map?
>
The short answer is that this is already supported. In the github readme,
you'll find a section labeled "Combinators", in which I outline
instaparse's dsl for creating grammars as a map from
Michael is being far too kind. We've already had multiple people from the
Clojure community opening issues and pull requests on all three of the
graphy projects. Thank you all! On the flip side, if you are interested in
getting started with (or getting involved) with these projects, shoot me an
Given pseudo-code (Ruby-ish):
due = 100
cards = cards.map do |card|
card.applied_balance = max(0, due - card.balance)
due -= card.applied_balance
Notice how due changes at each turn, and each successive item in
"cards" sees the change.
What's an idiomatic way to do this in Clojure withou
You can use reduce to carry forward both the new value on the cards, and
the new value of "due".
user> (let [due 100
cards [{:balance 120} {:balance 30} {:balance 35} {:balance
40}]]
(reduce (fn [[due cards] card]
(let [applied (max 0 (- due (:balance card))
Sounds interesting. The repo seems to be unavailable on Github, is that
correct?
Jeroen
On Sun, Apr 28, 2013 at 3:52 PM, Steven Degutis wrote:
> Great, thanks.
>
> Now it's at https://clojars.org/stories
>
> -Steven
>
>
> On Sun, Apr 28, 2013 at 1:25 AM, Michael Klishin <
> michael.s.klis...@g
Yeah I deleted it. Realized it's not worth anyone's time.
On Thu, May 2, 2013 at 4:44 PM, Jeroen van Dijk
wrote:
> Sounds interesting. The repo seems to be unavailable on Github, is that
> correct?
>
> Jeroen
>
>
> On Sun, Apr 28, 2013 at 3:52 PM, Steven Degutis wrote:
>>
>> Great, thanks.
>>
>>
Is this code applying an amount due against a customer's list of credit
cards? If so, there seems to be a bug. The third line should be:
card.appliedBalance = min(due, card.balance)
and the Clojure code I'd write is:
(defrecord Card [balance applied-balance])
(defn apply-due-to-cards [[d
Wow.
Got surprised with 404! Sad.
On Thursday, May 2, 2013 6:58:57 PM UTC-3, Steven Degutis wrote:
>
> Yeah I deleted it. Realized it's not worth anyone's time.
>
> On Thu, May 2, 2013 at 4:44 PM, Jeroen van Dijk
> > wrote:
> > Sounds interesting. The repo seems to be unavailable on Github, i
Here, it's back up for a while: https://github.com/sdegutis/stories
Please fork it.
-Steven
On Thu, May 2, 2013 at 5:36 PM, Paulo Suzart wrote:
> Wow.
>
> Got surprised with 404! Sad.
>
>
> On Thursday, May 2, 2013 6:58:57 PM UTC-3, Steven Degutis wrote:
>>
>> Yeah I deleted it. Realized it's n
Hi,
This is what I get using the head of master.
Typed :ReplHere
E117: Unknown function: fireplace#ns
E116: Invalid arguments for function redl#repl#create
no idea what is going on.
On 4 April 2013 22:19, dgrnbrg wrote:
> You there are plug mappings for all the repl actions:
>
> clj_repl_en
Make sure to have vimfireplace installed and a repl up and going for the
project.
--
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note that posts from new members are moderated - pleas
Epic win. Thanks guys, this is a really neat technique! I was thinking
the solution must be something like reduce but with two values, the
due amount and the cards, but I couldn't figure out how to get the
cards to "map". Turns out conj was the missing piece of the puzzle.
Thanks again!
On Thu, Ma
This isn't idiomatic but can be useful for modeling mutable computations in
pure functions:
(use '[blancas.morph core monads])
(def cards [{:balance 30} {:balance 25}])
(def due 100)
(run-state (mapm #(monad [due get-state
app (state (min due (:balance %)))
On May 2, 7:59 am, "John D. Hume" wrote:
> I've never used noir and have barely used 4clojure, but both of them
> apparently do hidden global things that make it hard to know the context in
> which your code is running. Your app needs to be wrapped in noir's
> `wrap-noir-session` middleware in m
45 matches
Mail list logo
