Hello,
I use memoization frequently and have run into two problems with the move
to Julia 0.5.0.
The first is not too serious and I hope can be fixed readily. The first
time I memoize a function, a warning is generated like this:
julia> using Memoize
julia> @memoize f(a) = a+1
WARNING: symb
Not a permanent fix, but the Qt4Agg backend works just fine. You just have
to add
backend : Qt4Aggto
~/.matplotlib/matplotlibrc.
This suggestion worked for me. The file matplotlibrc didn't exist but I
just created it and added that single line.
On Wednesday, July 13, 2016 at 10:26:26 AM UT
delete the folder /System/Library/Frameworks/Tk.framework
or will that mess other stuff up?
I’ve not had this problem on my Linux computer.
> On Jul 13, 2016, at 10:12, Ed Scheinerman
> wrote:
>
> Sigh, yes I tried that.
>
>> On Jul 13, 2016, at 09:04, Tom Breloff w
Sigh, yes I tried that.
> On Jul 13, 2016, at 09:04, Tom Breloff wrote:
>
> Have you tried using the conda local install?
>
> ENV["PYTHON"] = ""
> Pkg.build("PyPlot")
>
> Also it's not a real solution, but you could try Plots.jl with a different
> backend. It sounds like you have a system lib
n line)
Abort trap: 6
On Wednesday, July 13, 2016 at 8:37:28 AM UTC-4, Ed Scheinerman wrote:
>
>
>
> On Tuesday, July 12, 2016 at 8:16:03 AM UTC-4, David P. Sanders wrote:
>>
>> As a quick solution, I would suggest deleting or renaming ~/.julia/v0.4
>> and r
On Tuesday, July 12, 2016 at 8:16:03 AM UTC-4, David P. Sanders wrote:
>
> As a quick solution, I would suggest deleting or renaming ~/.julia/v0.4
> and reinstalling all the packages.
>
>
>
Good suggestion, minor hassle. Did it and the problem is not solved. I got
this today:
Exception in Tkin
I've suddenly been having a great deal of trouble with PyPlot on Julia
0.4.6 on Mac.
Here's one sort of problem I've gotten:
julia> plot([1,2],[1,3])
ERROR: ArgumentError: haskey of NULL PyObject
in haskey at /Users/ers/.julia/v0.4/PyCall/src/PyCall.jl:292
in plot at /Users/ers/.julia/v0.4
It seems, perhaps, that the problem is actually with PyCall. Other packages
that I regularly use are now causing problems ...
On Wednesday, May 25, 2016 at 8:22:07 AM UTC-4, Ed Scheinerman wrote:
>
> I use PyPlot a lot with my Julia work so I've got a big problem in that
> PyPlo
I use PyPlot a lot with my Julia work so I've got a big problem in that
PyPlot has suddenly stopped working after the latest Pkg.update()
julia> using PyPlot
INFO: Precompiling module PyPlot...
ERROR: LoadError: InitError: cfunction: pyjlwrap_repr does not return
in __init__ at /Users/ers/.ju
I've posted a proposed solution
here: https://github.com/scheinerman/RiemannComplexNumbers.jl.git
On Saturday, January 10, 2015 at 8:55:09 AM UTC-5, Ed Scheinerman wrote:
>
> Is there a way to have a single complex infinity? This may come at the
> cost of computational effici
NaN*im
Second: Dividing by infinity (expect inf/inf) should give 0, but this is
inconsistent:
julia> 1/Inf
0.0
julia> 1/(Inf*im)
0.0 - 0.0im
julia> 1/(Inf+Inf*im) # should be complex zero
NaN + NaN*im
On Saturday, January 10, 2015 at 8:55:09 AM UTC-5, Ed Scheinerman wrote:
>
eone who's also not a top-notch coder, it might be easier
> than you think. It's so easy to create types in Julia that with a few
> basics and some Googling, you can do quite a bit. You can also start small
> just to experiment.
>
> On Sun, Jan 11, 2015 at 8:44 AM, Ed S
they do,
creating polynomial and rational function types that properly handle
complex infinity would be good too. That way f(x) =(2x-1)/(x+1) would
evaluate f(Inf) as 2. :-)
On Saturday, January 10, 2015 at 7:55:09 AM UTC-6, Ed Scheinerman wrote:
>
> Is there a way to have a single compl
Great. I'll wait for a stable 0.4. Thanks for the speedy reply.
On Saturday, January 10, 2015 at 8:06:45 AM UTC-6, Mike Innes wrote:
>
> You can override the `call` function to do just this, but the behaviour is
> new to 0.4.
>
> On 10 January 2015 at 14:04, Ed Scheinerma
I'm working on a type that will have a function-like behavior, so I'd like
to write f(x) to evaluate the function f at x. I could define
getindex(f::MyType,x::Number) so f[x] would behave as desired, but it would
be aesthetically pleasing to be able to type f(x) in this case. Is there a
way to
Is there a way to have a single complex infinity? This may come at the cost
of computational efficiency I suppose, but I can think of situations where
all of the following give the same result:
julia> (1+1im)/0
Inf + Inf*im
julia> 1im/0
NaN + Inf*im
julia> 1/0 + im
Inf + 1.0im
It would be nic
I had a (fixable) problem installing on my Macbook Air. Upon first launch
in a terminal window I got this error:
Warning: error initializing module LinAlg:
ErrorException("error compiling __init__: error compiling check_blas: error
compiling openblas_get_config: could not load module libopenbla
e examples on Graphs.jl to make the learning
> curve less steep.
>
> Dahua
>
>
> On Saturday, November 22, 2014 9:20:10 PM UTC+8, Ed Scheinerman wrote:
>>
>> Hi all,
>>
>> I have found the Graphs.jl package difficult to work with, so I've been
>>
Hi all,
I have found the Graphs.jl package difficult to work with, so I've been
(slowly) putting together a SimpleGraphs.jl package available
here: https://github.com/scheinerman/SimpleGraphs.jl
It's probably not as full featured as the Graphs.jl package, but it's
easier (at least for me) to
I ran into the following problem creating partitions of objects of varying
types. I'm using the DisjointSets structure found in the DataStructures
module.
This code runs fine:
using DataStructures
elements = ["alpha", "beta", "gamma", "delta"]
parts = DisjointSets{ASCIIString}(elements)#
git push ers metadata-v2
>
> 4) If all of that works, then go back to the GitHub page for your fork,
> and click the "pull request" link:
>
> [image: Inline image 2]
>
> The next page should show a preview of the changes, which should only
> include the single commit wi
I tried following the instructions here:
http://docs.julialang.org/en/release-0.3/manual/packages/#publishing-your-package
to publish my "Permutations" module (available here:
https://github.com/scheinerman/Permutations.jl
)
Here's the output I got:
julia> Pkg.publish()
INFO: Validating METAD
is smart enough to remove
> bound checking on its own. In that case adding @inbounds won't help.
>
> On Friday, August 29, 2014 8:03:35 PM UTC+3, Ed Scheinerman wrote:
>>
>> I'd like to use @inbounds also to speed up code that I'm 100% sure has
>> proper arra
I'd like to use @inbounds also to speed up code that I'm 100% sure has
proper array indices. But I tried the following experiment and found no
significant difference using or omitting @inbounds before the array access.
What am I doing wrong? Or is bounds checking so super efficient that I
shoul
ring ranges to be faster. (#5778)
>
> On Aug 25, 2014, at 8:45 AM, Ed Scheinerman
> wrote:
>
> > Thanks again for the pointer to the release notes.
> >
> > The issue I raised was not dealt with in the release notes: namely, 1:5
> == [1:5] evaluates as true in Julia
ia/issues/7867 and the
>> discussion in https://github.com/JuliaLang/julia/issues/5778 for
>> information on the change.
>>
>> -Jacob
>>
>>
>> On Sat, Aug 23, 2014 at 9:02 AM, Ed Scheinerman <
>> edward.scheiner...@gmail.com> wrote:
>>
>&g
gt; On Saturday, August 23, 2014 9:06:50 AM UTC-4, Valentin Churavy wrote:
>>
>> There is https://github.com/JuliaLang/julia/blob/v0.3.0/NEWS.md
>>
>> On Saturday, 23 August 2014 15:02:56 UTC+2, Ed Scheinerman wrote:
>>>
>>> Is there a document describing n
THANKS!
On Saturday, August 23, 2014 9:06:50 AM UTC-4, Valentin Churavy wrote:
>
> There is https://github.com/JuliaLang/julia/blob/v0.3.0/NEWS.md
>
> On Saturday, 23 August 2014 15:02:56 UTC+2, Ed Scheinerman wrote:
>>
>> Is there a document describing new features
Is there a document describing new features and significant changes between
versions 0.2 and 0.3?
One item I noticed is that in 0.2 the express 1:5 == [1:5] evaluated as true,
but in 0.3 it's false.
7;t want to try, the fix will be committed within an hour.
>>
>> Ivar
>>
>> kl. 18:30:55 UTC+2 lørdag 2. august 2014 skrev Stefan Karpinski følgende:
>>>
>>> Would you be willing to take a crack at making a pull request? This
>>> should be a one-lin
I work a good deal with Set objects. When I found the sizehint function, I
thought this would be useful to use as the data structure supporting my
sets would be pre-allocated to be large enough for what I anticipated
putting therein. But sizehint doesn't apply to Set objects:
julia> A = Set()
S
or remove.
julia> Pkg.publish()
ERROR: METADATA is behind origin/metadata-v2 – run Pkg.update() before
publishing
in publish at pkg/entry.jl:259
in anonymous at pkg/dir.jl:28
in cd at file.jl:22
in cd at pkg/dir.jl:28
in publish at pkg.jl:53
Suggestions?
On Sun, Jul 27, 2014 at
structure that.
Perhaps you can provide me with a *simple* version so I can use that as a
template? -Ed
On Fri, Jul 25, 2014 at 12:07 AM, Kevin Squire
wrote:
>
>
>
> On Thu, Jul 24, 2014 at 4:52 PM, Ed Scheinerman <
> edward.scheiner...@gmail.com> wrote:
>
>> Thanks K
type are definitely
> useful!
>
> I'm wondering if you're interested in creating an official package out of
> this? It would require a few small changes to follow Julia conventions, but
> would make it easier for people to test. What do you think?
>
> Cheers!
>
nload from github:
https://github.com/scheinerman/Permutation.git
but all you need is the file "permutation.jl" (attached) and the brief
instructions "permutation.pdf" (also attached).
-Ed Scheinerman
permutation.jl
Description: Binary data
permutation.pdf
Description: Adobe PDF document
delete vertices!
On Sunday, February 23, 2014 12:50:01 PM UTC-5, Uwe Korn wrote:
>
>
> On Saturday, 22 February 2014 22:24:24 UTC, Ed Scheinerman wrote:
>>
>> I have looked through the documentation for the Graphs package here:
>> http://julialang.org/Graphs.jl/index.h
I have looked through the documentation for the Graphs package here:
http://julialang.org/Graphs.jl/index.html
But I'm finding it difficult to get started, even creating simple graphs
(undirected, no loops, no multiple edges). Adding vertices doesn't seem to
work.
Is there a tutorial somewhere
37 matches
Mail list logo
