This was a very helpful answer. Thank you very much for responding.
Cheers,
Colin
On 16 October 2016 at 20:23, Milan Bouchet-Valat wrote:
> Le samedi 15 octobre 2016 à 20:36 -0700, colintbow...@gmail.com a
> écrit :
> > Hi all,
> >
> > Twice now I've thought I had
This is interesting thanks. I didn't realise you could re-assign j inside
the index like that. A very neat notational trick. But I agree that looking
forward the filter! option is probably best. I'll adjust my code
accordingly, many thanks.
As an aside, every time I post code to this list I get
Yep. Agreed. Totally redundant :-)
Cheers,
Colin
On 4 June 2016 at 05:11, DNF wrote:
> Your in-method is a bit odd:
>
> Base.in{T}(x::T, r::BasicInterval{T}) = (r.start <= x <= r.stop) ? true :
> false
>
> Why don't you just write
>
> Base.in{T}(x::T, r::BasicInterval{T}) =
Hi Jeremy,
This sounded promising, as at some point I did have IPython installed so I
could use Jacob Quinn's Sublime-IJulia package. It is possible that
something was left behind. However, unfortunately I haven't been able to
find anything that looks suspicious (I'm on Ubuntu 14.04). For those
I've not heard of lightbox. Do you mean LightTable? I used to use
LightTable with Mike Innes Juno package, but made the switch to Atom
because my understanding is that from v0.4 onwards, Mike will be
concentrating his efforts there. To be honest, I'm really happy with Atom
and the Julia packages.
If you're interested, the source is here:
https://github.com/colintbowers/DependentBootstrap.jl
I haven't tried to make it into a registered package yet as I'm still
tinkering with it a fair bit. But I think I'm nearly there. It is fairly
comprehensive for univariate bootstrapping, ie lots of
Thanks for responding. Yes, I think I will do it your way. I was initially
hoping there would be a neat way to duplicate how R would do it, ie, with
keyword arguments typically always strings or numbers since this is what
many new users will be familiar with, but maybe in the end it would just be
end
UF1 = CRRA(4,2,1)
UF2 = LogUtility()
@time test1(UF1)
@time test2(UF2)
elapsed time: 0.005229738 seconds (80 bytes allocated)
elapsed time: 0.004894504 seconds (80 bytes allocated)
On Tuesday, June 23, 2015 at 8:28:28 PM UTC-4, Colin Bowers wrote:
Yes, that is pretty much how I
My apologies for not responding sooner. I have been clearing a stack of
referee reports off my desk.
No problems. It's end of semester here in Australia so I've been buried
under piles of marking anyway :-)
Thus, I would be very interested in learning more about your work in coding
the MCS
Yes, that is pretty much how I would do it, although, as I said in my
previous post, I would set `UtilityFunction` to an abstract type, and then
define my actual utility function immutable, say `MyCustomUtilityFunc`, as
a subtype of `UtilityFunction`. That way you can easily add different types
of
Cool, works for me. Many thanks.
On 16 June 2015 at 10:27, David Gold david.gol...@gmail.com wrote:
`collect(myIntSet)` should also do it, I believe.
On Monday, June 15, 2015 at 8:20:15 PM UTC-4, colint...@gmail.com wrote:
Ah, I understand. Thanks for responding and pointing me to the
11 matches
Mail list logo