While I understand your point, the success of a new programming language
depends on the availability of a good IDE. Apart from the projects,
mentioned so far I also want to mention spyder. Integrating Julia support
would be easy and it would make the transition for Python users easier.
Not every
PyPlot is now mostly supported on the master branch of Plots.jl. See the
readme/examples. Comments/issues welcome.
On Sun, Sep 13, 2015 at 4:17 PM, David van Leeuwen <
david.vanleeu...@gmail.com> wrote:
> Hello,
>
> On Thursday, September 10, 2015 at 10:26:35 PM UTC+2, Tom Breloff wrote:
>>
>>
It lets you use a constant global (which is much more performant than a
mutable global). The const has known type so the compiler can do a better
job inferring types for other variables that interact with it. See:
http://julia.readthedocs.org/en/latest/manual/performance-tips/#avoid-global-variab
This is the only implementation of MIDI in Julia, so I’d think it’s OK to go
with MIDI.jl and have it be a nucleus for MIDI-releated development in Julia. I
can probably contribute to MIDI device I/O on Linux and OSX, so if you’ve got
Windows covered then we’re good to go.
I’ll get a bit more f
That's interesting - but what advantage does it have over a single global
variable?
On Sunday, September 13, 2015 at 7:03:24 PM UTC-7, Tom Breloff wrote:
>
> Here's a pattern I like to use a lot, that should be what you're looking
> for. Wrap your value in a type, and have a global const of tha
Here's a pattern I like to use a lot, that should be what you're looking
for. Wrap your value in a type, and have a global const of that type, with
a getter and setter method (you can skip the getter/setter, but it makes it
nicer).
julia> type GlobalVarHolder
mybool::Bool
en
I'm not sure that I entirely understand your problem but it wouldn't be
particularly hard to write macros such that you could define
@single_threaded function foo(a::Int) ... end
@parallel function foo(a::Int) ... end
The expansion of @single_threaded would change the function name to be
`foo_
although it's not clear that's much better than
if USE_A
using A
else
using B
end
really...
On Sunday, 13 September 2015 21:59:37 UTC-3, andrew cooke wrote:
>
>
> the following works..
>
> first, defining module AB:
>
> module A
> export foo
> foo() = println("a")
> end
>
> module B
> e
ah, no it wouldn't, sorry.
On Sunday, 13 September 2015 22:18:24 UTC-3, Seth wrote:
>
> This looks interesting but I'd want to give the user the option of turning
> parallelization on and off at will. Not sure this will do it.
>
> On Sunday, September 13, 2015 at 5:59:37 PM UTC-7, andrew cooke w
This looks interesting but I'd want to give the user the option of turning
parallelization on and off at will. Not sure this will do it.
On Sunday, September 13, 2015 at 5:59:37 PM UTC-7, andrew cooke wrote:
>
>
> the following works..
>
> first, defining module AB:
>
> module A
> export foo
> fo
the following works..
first, defining module AB:
module A
export foo
foo() = println("a")
end
module B
export foo
foo() = println("b")
end
module AB
if Main.USE_A
using A
else
using B
end
export foo
end
that depends on Main.USE_A, where Main is the initial module when things
start up
i don't know of a good way to do this.
really, parameterised modules would be great.
the simplest thing i can think of is if modules are first class and using
etal can take an expression, but the following doesn't run:
module A
foo() = println("a")
end
module B
foo() = println("b")
end
modul
What Linux distribution are you using? You probably need to install
libcurl-dev.
On Saturday, September 12, 2015 at 1:15:13 PM UTC-7, Paddy Healy wrote:
>
> Greetings,
>
> I'm new to julia and even newer to plotly. I'm getting a libcurl error
> when I call Plotly.plot():
>
> julia> response =
What Linux distribution are you using? You probably need to install
libcurl-dev
On Saturday, September 12, 2015 at 1:15:13 PM UTC-7, Paddy Healy wrote:
>
> Greetings,
>
> I'm new to julia and even newer to plotly. I'm getting a libcurl error
> when I call Plotly.plot():
>
> julia> response = P
Hi,
I don't know whether this will make a difference, but your version of Julia
is almost a year old. Current stable is up to 0.3.11 now with a 0.4 release
just around the corner. Unless you can reproduce the problem in a more
current version, it might be difficult to get help.
On Saturday, Se
Hi all,
I'd like to track a setting throughout my module (that will cause the
[transparent] dispatch of either single-threaded or parallel versions of
many different functions). Is there a more Julian way of doing the
following? This seems inelegant:
_parallel = false# start off without pa
If you were to name it MIDI, I would suggest putting it in all caps as
that's how it's usually stylized, and most of our acronym package
names are in all caps. For name discussion, I suggest you just open a
pull request to publish your package and ask for feedback on the name,
etc... I find your
Since this is a top hit on google for this issue, I'm posting here just to
add that you see this error if you add a println() to your finalize
function, to check whether it is called :o)
One solution is to increment a global counter in the finalizer and print
the counter before and after gc().
This is the code that uses sparse matrices:
for i = 1:n
for j = i:n
if i == j
sp = start'*sparse([i,n+i,2n+1],[i,n+i,2n+1],[1,1,-1])
lhs[rctr,:] = -2*sp -2*radii[i]*c
rhs[rctr] = -(sp*start)[1] -radii[i]^2
On Saturday, 5 September 2015 21:03:28 UTC+2, kike wrote:
>
> They say that Julia is a language that is simple and fast with a great
> future ... but if they want to extend and reach non-programrs, there is
> that make things easier and simple ... that is to say a IDE JuliaEstudio
> type.
>
Hi all,
For the past few weeks, I've been working on a basic MIDI library for
Julia, and I'm about ready to release the initial version. I had wanted to
use Julia to experiment with algorithmic composition & music analysis, but
there didn't seem to be anything available for that.
I couldn't eve
`apt-get install build-essential`
On Sun, Sep 13, 2015 at 4:02 PM, Sisyphuss wrote:
> No, I mean general compiling tool kit in linux, so that I can also use
> them to compile other programs.
>
> I have seen it somewhere, but I forgot it.
>
>
>
> On Sunday, September 13, 2015 at 1:58:56 PM UTC+2,
There aren't built-in data structures defined in Julia's standard library
right now for higher-dimensional sparse matrices, no. But you can certainly
come up with your own data structure and use it however you like. Are there
any dimensions in your problem along which every 2-dimensional slice h
I had the same issue recently, and I tried a bunch of stuff. I think
deleting the "Julia Package Manager" Github token from my Github settings
is what fixed it for me.
On Sun, Sep 13, 2015 at 4:04 PM, Diego Javier Zea
wrote:
> I'm getting this problem with *git* when I do* Pkg.publish()*. How c
Hello,
On Thursday, September 10, 2015 at 10:26:35 PM UTC+2, Tom Breloff wrote:
>
> This may be a slightly premature announcement, but I wanted to put it out
> there so that people that have strong opinions have a chance to give their
> thoughts. Here's the link:
>
> https://github.com/tbrelof
Well, you're right that the original problem comes from the install of
IJulia. And it was generated because the IJulia code is using a version of
cp() which does not exist in v0.3. But that was the only error generated
and since then my julia crashes every time I try to use python from it (via
To answer some of my own questions...
1 - Some is in Compose.jl, but it's not all exposed, and I think I need the
lower level details so I am bumbling ahead.
2 - I've made things strongly typed as I suggested and then the Cairo.jl
naming became clearer - it omits nouns that are implied by type
I'm getting this problem with *git* when I do* Pkg.publish()*. How can I
solve it? Thanks
julia> Pkg.publish()
INFO: Validating METADATA
INFO: Pushing PairedListMatrices permanent tags: v0.0.1, v0.0.2
INFO: Submitting METADATA changes
INFO: Forking JuliaLang/METADATA.jl to diegozea
INFO: Could no
No, I mean general compiling tool kit in linux, so that I can also use them
to compile other programs.
I have seen it somewhere, but I forgot it.
On Sunday, September 13, 2015 at 1:58:56 PM UTC+2, Isaiah wrote:
>
> For future reference, required tools and libraries are listed in the build
> i
as others have said, the profiler is the way to go.
i just wanted to add, and sorry if this was already obvious, that your
implementation (and almost anyone else's, unless they have achieved the god
like status of adam langley, dan brown, et al), is likely going to leak
info via timing attacks
On Sun, Sep 13, 2015 at 3:17 PM, David Higgins wrote:
> This is a big one. It happened to me last night and it turns out that Julia
> crashes every time I try to call a Python library from it now.
>
> I've just done a reinstall and it still hasn't fixed it.
>
> I need this to prepare some figures
This is a big one. It happened to me last night and it turns out that Julia
crashes every time I try to call a Python library from it now.
I've just done a reinstall and it still hasn't fixed it.
I need this to prepare some figures for tomorrow morning, so I'd really
appreciate any quick help.
ah, Compose has this. thanks.
On Sunday, 13 September 2015 14:20:01 UTC-3, Andreas Lobinger wrote:
>
> Hello colleague,
>
> 1 - you miss that actually Cairo.jl defines text setting with the 'toy'
> interface and setting via pangocairo. text uses a pango layout, set_text
> uses the cairo-only i
Hello colleague,
1 - you miss that actually Cairo.jl defines text setting with the 'toy'
interface and setting via pangocairo. text uses a pango layout, set_text
uses the cairo-only interface. I think used both already and fed fontfiles
into pango.
2 - maybe/maybe not. In general i'd rather sp
Thanks! Now all is clear.
On Sunday, September 13, 2015 at 6:46:25 PM UTC+2, Kristoffer Carlsson
wrote:
>
> From dft.jl
>
> \(p::Plan, x::AbstractArray) = inv(p) * x
>
>
>
> On Sunday, September 13, 2015 at 6:38:48 PM UTC+2, Gabor wrote:
>>
>> Thank you for the positive answer.
>>
>> May I have
I thought it might be better to ask here that make an issue on Cairo.jl but
I can do that instead if necessary.
I am adding calls to the pango text API and have some questions:
1 - How did people manage without these? Is everyone using the Cairo "toy"
API? Or have I missed some already exist
>From dft.jl
\(p::Plan, x::AbstractArray) = inv(p) * x
On Sunday, September 13, 2015 at 6:38:48 PM UTC+2, Gabor wrote:
>
> Thank you for the positive answer.
>
> May I have one more question?
>
> Let b=fft(a) and P=plan_fft(a).
> Are the following two expressions equally good?
> a = inv(P) *
Thank you for the positive answer.
May I have one more question?
Let b=fft(a) and P=plan_fft(a).
Are the following two expressions equally good?
a = inv(P) * b
a = P \ b
On Sunday, September 13, 2015 at 6:15:05 PM UTC+2, Yichao Yu wrote:
>
> On Sun, Sep 13, 2015 at 11:53 AM, > wrote:
> >
Thank you, this looks very nice.
On Sunday, September 13, 2015 at 4:29:15 AM UTC-5, Diego Javier Zea wrote:
>
> I was trying to save a matrix of *88000 x 88000* distances on a *Symmetric
> *but I got an *OutOfMemoryError*. Trying to use a sparse matrix solves
> the memory problem, but takes more
On Sun, Sep 13, 2015 at 11:53 AM, wrote:
> I am learning the new FFTW syntax of version 0.4.0.
>
> One thing that surprised me is the possibility of using
> inv(plan1) for ifft, where plan1 was created for fft by plan_fft.
>
> Could you confirm please, that this method is just as efficient
> as c
Values in tuples are either stored in registers or on the stack as decided
by the compiler, whereas Arrays are currently always allocated on the heap.
Allocating on the heap is more expensive to begin with, and heap allocated
objects have to be garbage collected when they're no longer in use.
I
I am learning the new FFTW syntax of version 0.4.0.
One thing that surprised me is the possibility of using
inv(plan1) for ifft, where plan1 was created for fft by plan_fft.
Could you confirm please, that this method is just as efficient
as creating a separate plan2 for ifft by a separate plan_
I am learning the new FFTW syntax of version 0.4.0.
One thing that surprised me is the possibility of using
a plan1 that was created by plan_fft as inv(plan1) for ifft.
Could you conform please that this method is just as efficient
as creating a separate plan2 for ifft by a separate plan_ifft c
I'm doing sequential linear programming on quadratic constraints. Using
matrices makes this much more straight-forward. Without 4th rank matrices,
I have to generate a large number of 2nd rank matrices for every iteration.
However, I gather from your answer that only 2nd rank sparse matrices
For future reference, required tools and libraries are listed in the build
instructions:
https://github.com/JuliaLang/julia/blob/master/README.md#required-build-tools-and-external-libraries
On Sun, Sep 13, 2015 at 5:51 AM, Sisyphuss wrote:
> Thanks Kristoffer! I complete the building now.
>
> On
Thanks Kristoffer! I complete the building now.
On Sunday, September 13, 2015 at 11:11:09 AM UTC+2, Kristoffer Carlsson
wrote:
>
> Run make again. What happens?
>
> On Sunday, September 13, 2015 at 11:05:21 AM UTC+2, Sisyphuss wrote:
>>
>> I tried to build the v0.4 candidate in my Ubuntu 14.04.
>
I find that I have so many things missing.
Is there any way that I can install all develop tools in one shot ?
On Sunday, September 13, 2015 at 11:11:09 AM UTC+2, Kristoffer Carlsson
wrote:
>
> Run make again. What happens?
>
> On Sunday, September 13, 2015 at 11:05:21 AM UTC+2, Sisyphuss wrot
I was trying to save a matrix of *88000 x 88000* distances on a *Symmetric *but
I got an *OutOfMemoryError*. Trying to use a sparse matrix solves the
memory problem, but takes more than 12 hours to finish. So I create this
package (https://github.com/diegozea/PairedListMatrices.jl) for solve thi
gfortran: command not found.
I think I should install gfortran.
On Sunday, September 13, 2015 at 11:11:09 AM UTC+2, Kristoffer Carlsson
wrote:
>
> Run make again. What happens?
>
> On Sunday, September 13, 2015 at 11:05:21 AM UTC+2, Sisyphuss wrote:
>>
>> I tried to build the v0.4 candidate in
Run make again. What happens?
On Sunday, September 13, 2015 at 11:05:21 AM UTC+2, Sisyphuss wrote:
>
> I tried to build the v0.4 candidate in my Ubuntu 14.04.
>
> I `git checkout release-0.4`
>
> After half an hour's make, I got:
>
> ```
> llvm[6]: === Finished Linking Release Executable Sampl
I tried to build the v0.4 candidate in my Ubuntu 14.04.
I `git checkout release-0.4`
After half an hour's make, I got:
```
llvm[6]: === Finished Linking Release Executable Sample (without
symbols)
llvm[2]: * Completed Release Build
make: *** [julia-deps] Error 2
```
And I have no julia
I found the solution here:
https://github.com/JuliaLang/julia/issues/13089
On Thursday, September 10, 2015 at 10:40:23 PM UTC+2, Evan wrote:
>
> Hi, I am trying to install Julia on a Mageia 5 i7 system. In Make.user I
> put this:
>
> USE_SYSTEM_LLVM=1
> USE_SYSTEM_BLAS=1
> USE_SYSTEM_LAPACK=1
Many thanks!
I've understood that parametric type and number of dimension are
necessary, then I can write something like:
type MyArr{N} <: AbstractArray{String,N}
...
end
but, cause I want constructor receives the range of components for each
dimension like:
a = MyArr{3}(2,3,4)
I MUST ensure
53 matches
Mail list logo
