If you have any control over the writer end you could also choose a specific
terminal character that is not otherwise in your grammar and insert it before
the next data set.
Then you could be assured of a full parse.
--
You received this message because you are subscribed to the Google
Groups
I didn't know Instaparse supported readers. Is there no way to read from the
stream into a string until the terminal character for your grammar is found and
parse that ? I assume you have no control over the source data?
--
You received this message because you are subscribed to the Google
Gro
While I think the latter two solutions show off Clojures ease of extensibility,
I personally believe the first technique is more appropriate for the current
wxample.
I mean, how many different ways of calculating and rounding a percentage are
there?
--
You received this message because you
What I meant was that you use all b's to generate the max date for B (used as
input for its dependencies) but simply bundle all b's into B's bill. You can't
bill them before or after B because they're effectively line items on B.
--
You received this message because you are subscribed to t
If, say C cannot depend on any b directly, (I.e. C can only depend on B), and
your domain rules say you can only bill for all b's when you bill B, then
really you have a self contained sub-graph with only one bill date for the root
node B.
You can simply ignore backfilling the billing date for b
You said b can't be billed after B. But it sounds like it can't be billed
before.
Say b is ready at 1, can you bill it at 1 and then B at 2?
Anyway, my first thought was using weights on the edges equal to the duration
between the dependencies and use a max cost on the graph. But calculating
I second Google Calendar.
You can make appointments "show as busy" so the details are not shared with all
clients. Then share your calendar with each client. You can invite specific
clients to specific appointments via email, make some of them recurring, and
it's up to the client to respond to
Well at least I can know guess at the etymology : sql join leaps to mind,
joining on a different "branch" of the state tree with keys from another branch.
I didn't understand that until I read your tutorial.
On Monday, January 27, 2014 10:35:54 AM UTC-8, David Nolen wrote:
> om/join is conceptu
I'm a big fan of this new tutorial.
It hi-lights some of the benefits of cursors, and I actually realize how I
might use om/join suddenly :D
--
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups
Did you get this fixed Rudi?
If your project file requires om 0.2.3, then it was something with the
lein new command (which is now fixed).
I recommend manually changing the project file to require om 0.3.0 and then
don't forget to "lein cljscript clean" before recompiling (which I did).
O
I was following along with this and hit an interesting "bug"
The contact list delete button actually works "out of the gate" in the first
example, (when its supposed to fail) and when I add the deref in the next step
I get
Uncaught Error: No protocol method IDeref.-deref defined for type
om.c
Ha! Just saw your Sortable example popup in Git!
Very cool.
On Thursday, January 2, 2014 4:00:45 PM UTC-8, David Pidcock wrote:
> Very nice. Relatively easy to follow. Basically it's re-implementing the
> drag-list behaviour in React. I had thought to re-use some ex
te up a simpler Om example
> in the future.
>
> David
>
>
> On Tue, Dec 31, 2013 at 12:43 AM, David Pidcock
>
> > wrote:
>
>> On Thursday, December 19, 2013 11:12:12 AM UTC-8, David Nolen wrote:
>> > Enjoy,
>> http://swannodette.github.io/2013/12/17/
On Thursday, December 19, 2013 11:12:12 AM UTC-8, David Nolen wrote:
> Enjoy, http://swannodette.github.io/2013/12/17/the-future-of-javascript-mvcs/
>
>
>
> David
I've been playing around with some basics. I'm still a relative n00b when it
comes to functional programming, and I've never looked
o the printer for the map is finding nulls for many of the keys in the
schema, and so it's skipping them.
On Saturday, April 20, 2013 5:39:16 PM UTC-7, David Pidcock wrote:
>
> Well, using the Lein protobuf generator at least helps with the Exception,
> but it doesn't help with
to the toString, but the behviour looks like a
depth-first print that bails before it gets to the other elements of the
map.
On Saturday, April 20, 2013 4:54:08 PM UTC-7, David Pidcock wrote:
>
> Well today has been the first chance I've had to try this, and
> unfortunately, it&
get more time, I'm going to regenerate them with the lein proto plugin.
On Friday, April 12, 2013 8:08:01 AM UTC-7, David Pidcock wrote:
>
> Thanks - I'll give that a try.
>
> On Thursday, April 11, 2013 11:18:06 AM UTC-7, Alan Malloy wrote:
>>
>> 0.6.2 is
hat does what you expect.
>
> On Thursday, April 11, 2013 8:39:12 AM UTC-7, David Pidcock wrote:
>>
>>
>> I have some Java classes generated elsewhere (not by the lein proto
>> plugin) and I'm wanting to use them as the basis for the [protobuf
>> "0.6
I have some Java classes generated elsewhere (not by the lein proto plugin)
and I'm wanting to use them as the basis for the [protobuf "0.6.2"] code
interactions (for interdependency with an existing java project)
One thing I noticed about the output in REPL is that only the first key is
pre
19 matches
Mail list logo
