There is no T which satisfies the type parameter for Foo(B). Therefore this
type cannot be constructed.
If you wanted to create a type which is specialized on any Bar object, then
you must do so at the type parameter level:
type Foo{B:Bar}
y::Array{B}
end
Note, that Array{T} is still not
Did you actually build Julia studio?
The instructions for Linux can be found here:
https://github.com/forio/julia-studio/blob/master/linux-build.md
Well, skip the Julia 0.2 installation step.
Best regards:
Uwe
On Thursday, March 20, 2014 12:11:58 AM UTC+1, K leo wrote:
That doesn't seem to
Sounds like this issue I had: https://github.com/JuliaStats/GLM.jl/issues/61
The solution was to update Julia.
Hum, ok.
Although the short-circuit is more or less known among several programming
languages, I don't think it's that readable outside of an if.
Maybe after a while one starts to read that code as if then, but it's not
so straightforward to beginners reading someone else's code.
But the
On that note is somebody working on a LightTable integration?
As it happens I'm having a go at it. It's probably buggy and definitely
missing features at the moment, but it's already a nice way to develop
packages (no more pesky reloading files).
https://github.com/one-more-minute/Jewel
On Thu, Mar 20, 2014 at 7:24 PM, Cristóvão Duarte Sousa
cris...@gmail.com wrote:
Although the short-circuit is more or less known among several programming
languages, I don't think it's that readable outside of an if.
Maybe after a while one starts to read that code as if then, but it's not
so
I would urge you to always put a semicolon after the condition; you'd be
surprised at how often part of the consequent is parsed as part of the
condition otherwise! It's quite brittle.
In fact, I think that semicolon or newline should be required after the if
condition for this reason.
It's
Toivo, thanks for the advice. Indeed I had the feeling of some brittleness
when not using the semicolon, but I hadn't had any trouble yet.
Chris, I like that or short-circuit usage, it sounds very funny in Perl :)
On Thu, Mar 20, 2014 at 10:40 AM, Toivo Henningsson toivo@gmail.comwrote:
I
@Stefan
I'm *not *advocating for the ability of the user to be able to have
variable names like Julia key words. Consider key words to be sacred
during this thread. I'm old enough to remember playing with PL/1's ability
to declare variables with the same name as keywords -- imagine a boolean
Thanks for the response! Where can i find the nightlies for windows?
On Thursday, March 20, 2014 4:41:08 AM UTC-4, Johan Sigfrids wrote:
Sounds like this issue I had:
https://github.com/JuliaStats/GLM.jl/issues/61
The solution was to update Julia.
Greetings,
I see a different behavior for filter on tasks and ranges.
If I do
for n = filter(iseven, 1:10)
println(n)
end
I get 2,4,6,8
However if I do
function ints()
for i = 1:10
produce(i)
end
end
for n = filter(iseven, @task ints())
println(n)
end
I get
Hi,
I have just begun learning Julia and, as an exercise, I tried to
re-implement an algorithm that I had previously implemented in
Mathematica. The problem consists of calculating the following expression
Q(t)=-e^{-t-1}+sum _{n=0}^{floor(t)} e^{n-t} (t-n) L_n^1(t-n)/(n+1)
for large t (here
Can you submit a pull request to Julia? Editor configuration files for a
variety of editors are distributed with Julia in the contrib
directory: https://github.com/JuliaLang/julia/tree/master/contrib
It looks like you are missing the reserved
wordshttps://github.com/JuliaLang/julia/blob/master/src/julia-parser.scm#L89-L92:
let, local, bitstype, ccall, baremodule
You should probably also define:
Open Strings 2 =
Close Strings 2 =
End-of-line Ends String 2 = false
Open Block Comments = #=
On Thursday, March 20, 2014 8:26:56 AM UTC-4, Paweł Biernat wrote:
# implementation via recursive definition of laguerre polynomials
function laguerrel_recursive(n::Integer, alpha::Number, x::Number)
l0 = 1# L_{0}
l1 = 1+alpha-x# L_{1}
This
Yes, I'm a beginner in julia, (but an expert in R),
and have been trying things in julia, on and off, for more than a year..
Today I updated my julia (see versioninfo below), and also wanted to
update my (Statistics related) packages.
There was an issue that Pkg.add(RDatasets) did not work
On Thursday, March 20, 2014 8:26:56 AM UTC-4, Paweł Biernat wrote:
So it seems that BigFloat is the major drawback. I really wander how
Mathematica handles the generation of Laguerre polynomials. I am aware of
the GSL bindings and the function sf_laguerre_n, but it also returns NaNs
for
This is just the right place to post about this sort of thing. You can also
always open an issue with specific problems like this. In this case, it
happens that there's already an ongoing debate that's closely related in
two issues:
- https://github.com/JuliaLang/julia/pull/5810
-
For example, you may be able to use the analytical asymptotic form of the
Laguerre polynomial for large n. Computing special functions efficiently
is all about switching between different asymptotic forms, recurrences,
etcetera, for different regions of the parameter space.
You're absolutely right – I'm testing a patch for this right now.
Fundamentally, this raises an issue that I've brought up before: filter is
poorly named because the name doesn't indicate whether you keep or drop the
items which the predicate matches. It would be much clearer if we had two
Actually, I think that rather than being a misinterpretation of the
predicate direction, this may be due to
https://github.com/JuliaLang/julia/issues/6125 because the Filter code is
older than the new way that Tasks are iterated.
On Thu, Mar 20, 2014 at 11:45 AM, Stefan Karpinski
I found the nightlies, but i am still getting an error
julia using GLM, RDatasets
julia form = dataset(datasets,Formaldehyde);
julia lm1 = lm(OptDen ~ Carb, form)
Formula: OptDen ~ Carb
Coefficients:
Evaluation succeeded, but an error occurred while showing value of type
LmMod:
ERROR: .+= not
Issue created https://github.com/JuliaLang/julia/issues/6224.
On Thu, Mar 20, 2014 at 12:17 PM, Stefan Karpinski ste...@karpinski.orgwrote:
Actually, I think that rather than being a misinterpretation of the
predicate direction, this may be due to
Ah, that makes sense, thanks.
The reason why I originally wrote that off without trying it (not a good
idea, I suppose!) is that I thought it would give me the same kind
of behavior exhibited when you define a function like:
f{N:Number}(a::N, b::N)
which asserts that a and b are the same
Too bad there isn't a inverse if statement like:
do_stuff() if i == 1
A while ago, Alan sent this implementation of accumarray:
function accumarray(subs, val, fun=sum, fillval=0; sz=maximum(subs,1),
issparse=false)
counts = Dict()
for i = 1:size(subs,1)
counts[subs[i,:]]=[get(counts,subs[i,:],[]),val[i...]]
end
A = fillval*ones(sz...)
for j =
To get a backtrace of the potential problem, in the julia repl start up a
kernel by import IJulia. If the kernel is crashing for some reason this
should provide more clues as to what is going on.
On Thursday, March 20, 2014 4:21:35 PM UTC-4, Eka Palamadai wrote:
I did a git pull today, then
The suffix `if` and `unless` is the reason I never managed to become literate
in Ruby. Maybe it is just a matter of time and experience, but I read code
lines from left to right, and my mental read buffer is not long enough to see
the `if` that someone hid at the end of the line.
I agree. I've never liked python's do_stuff() if i == 1. It's too
disconcerting to parse what's going on and then have to backtrack and think
about the condition that came afterwards. I've found the i == 1
do_stuff() has become really natural after only using it a few times.
-Jacob
On Thu, Mar
Taking into account your suggestions I came up with an ad-hoc
implementation tailored for my needs. Instead of computing
Laguerre(n,1,t-n) I compute the whole expression
Laguerre(n,1,t-n)*exp(-(t-n))*(t-n) via a function laguerrel_xexpx.
Because I incorporated the exponential factor into the
When i did 'import IJulia' at the julia prompt, i got the following output
connect ipython with --existing profile-97310.json
I restarted ipython as
ipython notebook --profile profile-97310.json
When i try a simple code snippet in the browser notebook, i get the
following message
NameError
I'm not so sure about i == 1 do_stuff() being readable, but I think it's
better than do_stuff() if i==1. Every time I see i==1 do_stuff(), I have
to stop and reason about what it's doing, but at least it isn't tricky.
With either you can read it easily, or you see that something weird is
going
Why can't we do this? (and how can I do it?)
julia s
@GMTAPI@-00\0 -R-10/0/35/45 -JM14c -Ba2 -P lixo.ps
julia s[16] =
ERROR: no method setindex!(ASCIIString, ASCIIString, Int64)
You may be interested to have a look at the implementation I wrote in
RandomMatrices.jl; the package unfortunately is broken on master and I
really haven't had the time to fix yet, but this may give you some
idea of what is possible in Julia.
It is also entirely possible that you can find a
Well, ... thanks
But naive question though. If we can do it with elaborate tricks, why not
just have a clean simple way?
Sexta-feira, 21 de Março de 2014 2:21:45 UTC, J Luis escreveu:
Why can't we do this? (and how can I do it?)
julia s
@GMTAPI@-00\0 -R-10/0/35/45 -JM14c -Ba2 -P
It looks like I will not be able to use this REPL until the TTY bug gets
fixed in Julia. Pity...
i couldn't find a issue report, but it's fixed now (and not actually
necessary to run the code, since it was only used in the cleanup step).
here's the code with some of my original typo's fixed
It is a bad idea to modify internal data, even though it is allowed. If you
want a mutable string-like object, we have a IOBuffer() type which is
designed for building up strings.
On Thu, Mar 20, 2014 at 10:59 PM, J Luis jmfl...@gmail.com wrote:
Well, ... thanks
But naive question though. If
Yes, you would have to enforce that in the inner constructor for the type.
What are you seeing for performance?
On Thu, Mar 20, 2014 at 11:25 PM, andrew cooke and...@acooke.org wrote:
for the record, this almost works, once types are specified. what seems
to limit things is the lack
I wrote a similar package long ago for Python and remember SGE array jobs well.
If ClusterManager's addprocs_sge function doesn't respect the current
working directory in the worker processes, it would be nice to file an
issue about it. It would be really nice to have your code integrated
more
Hi Wenlin,
Thanks for your interest in Julia GSoC. Please note that submissions
close tomorrow, Friday, March 21 at 19:00 UTC and we cannot
accept applications after that deadline.
If you would like to take up this project, I would encourage you to send
in an application based on your emails as
Dear Jiahao Chen,
Thanks for the remind. I will submit the application proposal soon.
Hopefully we could code the summer away together. Thank you.
Thanks,
Wenlin Hu
On Thu, Mar 20, 2014 at 11:33 PM, Jiahao Chen jia...@mit.edu wrote:
Hi Wenlin,
Thanks for your interest in Julia GSoC. Please
Thanks, Jameson. For us, beginners, could you add some notes about how to
use it, and what is happening under the hood?
Hi,
Yes, since Julia implements co-operative multi tasking, a process cannot
respond to any other requests if it is CPU bound.
The wait functions currently do not have a timeout, though there has been
some discussion on the need for the same on github.
I have added a few more inter-task
Amazing thread.
Certainly writing an OS in Julia wouldn't be easy (for basically the same
reasons that it's impossible to write an OS with standard CPython -- the
Julia interpreter needs an underlying operating system to run). But people
have written an OS with Python! Cleese:
Dear Jiahao Chen,
I have submitted the proposal for data parallel tasks through
Google-melange. I would be really appreciated if you could leave some
comment on it. Thank you.
Thanks,
Wenlin Hu
On Thu, Mar 20, 2014 at 11:40 PM, Wenlin Hu hiroshima...@gmail.com wrote:
Dear Jiahao Chen,
45 matches
Mail list logo
