You're probably missing dependencies. Check the files in dependency walker. Or
use the WinRPM.jl package which handles them automatically.
On Thu, Sep 17, 2015 at 6:06 AM -0700, "STAR0SS" wrote:
Talking about GtkSourceView, shouldn't these binaries work on windows ?
They seems to be valid wind
I skimmed some of their c api and it looked pretty usable.
On Fri, Sep 18, 2015 at 9:02 AM -0700, "Keno Fischer"
wrote:
Arrayfire is written in C++, so the C++ is by far the simplest way to
interface with it. This work was mostly exploratory, to see if it was
useful at all. If somebody wanted
No, that's not normal. Did you first install julia when it was version 0.2?
On Thu, Oct 8, 2015 at 9:44 PM -0700, wrote:
I got it working now. The suggestion to start with an empty ~/.julia/
didn't work, but fortunately I just renamed .julia to .oldjulia and kept
everything there. After remov
yone know when 0.4.0 will be available to test with on Travis?
Currently the options seem to be "nightly", which is 0.5-dev, and
"release", which is 0.3.11.
Thanks,
Lindsey
On Friday, October 9, 2015 at 4:20:32 AM UTC-7, Tony Kelman wrote:
>
> At long last, we can announc
ulia> homedir()
"C:\\Users\\Tomas Lycken"
A .juliarc in that directory still isn’t run, though.
// T
On Thursday, October 15, 2015 at 3:28:08 PM UTC+2, Tony Kelman wrote:
Are HOMEDRIVE and HOMEPATH set? The homedir() function should be falling
> back to the concatenation of those on windows.
>
This is code that I used gmres function in Matlab.
function y = afun(x)
y = [0; x(1:n-1)] + [x(2:n); 0];
end
n = 21;
x=ones(n,1);
b = afun(x);
v=gmres(@afun,-b)
but I do not know how to use it in julia. How to pass the afun into gmres
when the input A (resp. Pl, Pr) is a function returning
I searched the log for the word error.
The julia executable ends up at ./usr/bin/julia.exe, unlike a unix source build
Windows doesn't support symbolic links very well so we do not create a ./julia
convenience link.
On Sun, Nov 1, 2015 at 6:15 PM -0800, "Seth" wrote:
It sounds like you don
It might be a different kind of InexactError then. Try adding a @show on the
rhs value, see what type it is. The array might need to be constructed in a way
that it's capable of holding dual number element types.
On Mon, Nov 2, 2015 at 3:18 PM -0800, wrote:
Hi Tony:
Thanks, but rem
Julia 0.4 and earlier shell out to command line git for Pkg. If you haven't run
`make win-extras binary-dist` then run the generated installer, then when you
run Julia in cygwin it is trying to call cygwin's git which does not work.
On Mon, Nov 2, 2015 at 3:13 PM -0800, "digxx
-pre-x86_64.exe: Permission denied
Did you mean sth else?
Am Dienstag, 3. November 2015 00:25:31 UTC+1 schrieb Tony Kelman:
> Julia 0.4 and earlier shell out to command line git for Pkg. If you
> haven't run `make win-extras binary-dist` then run the generated installer,
> then when you run Ju
You just need the embedded copy of portable git to be in place and on julia's
path before cygwin's git. The installer is the fewest steps to make sure that's
set up properly.
On Mon, Nov 2, 2015 at 5:02 PM -0800, "digxx" wrote:
So basically you mean I have to change the way julia0.4 wants to
The cygwin git is posix-style and handles paths differently than the mingw
portable git. Pkg could maybe be fixed to work with cygwin's git, but on master
we're using libgit2 now instead of shelling out.
On Tue, Nov 3, 2015 at 12:21 AM -0800, "digxx" wrote:
I will try tonight...
Though I'm c
I just got Julia compiled successfully on RHEL 5.5 after following this
note https://github.com/JuliaLang/julia#centos-5
I was expecting this to be much more difficult than it ended up being, so
my compliments to the team that set up the build system. This doesn't rule
out future more subtle pr
s (USE64BITINT DYNAMIC_ARCH NO_AFFINITY)
LAPACK: libopenblas
LIBM: libopenlibm
then the backtrace for that last error is slightly different, it says "in *
at linalg/sparse.jl:171." So, something having to do with splice! then?
Anyone have any recommendations how to figure out what's going on?
Thanks,
Tony
symbolic can really mean
symbolic, actually populating the array of nonzeros with the real
expressions.
-Tony
splice! with deleteat! in
linalg/sparse.jl. Testing this now and will put together a PR if it works.
-Tony
ary-installed
version of Julia? I'm trying to read through the Makefile to make sense of
what it's doing. While the Makefile works beautifully, it is a bit
confusing (as are all build systems) to figure out which piece of it does
what I'm asking about here.
Thanks,
Tony
ease\bin\\../lib/julia/sys.ji"
not found
The sys.ji file I removed had been located in
Julia-0.3.0-prerelease/lib/julia, so something the batch file and/or the
way the -b flag works probably needs to be tweaked to account for the move.
Should I file an issue?
-Tony
Have a look here, https://github.com/jcrist/Control.jl is making better
progress than anything else I've found in the topic. He has wrappers to
Slicot as well.
On Thursday, February 20, 2014 1:56:20 PM UTC-8, Uwe Fechner wrote:
>
> Hello,
>
> I could not find any control system library for Julia
Sorry I was unclear, I shouldn't post at 4 am and Google groups needs an
edit button.
Where does prepare-julia-env.bat get created? I think it's out-of-date
w.r.t. the location of the system image file.
What I'm seeing now is "ERROR: unknown option -b" in process_options at
client.jl:306. Does
rently working on automated control of kite-power systems. A
> little video about our
> project: http://www.youtube.com/watch?v=FJmlt3_dOuA
>
> Best regards:
>
> Uwe
>
> Am 21.02.2014 00:24, schrieb Tony Kelman:
>
> Have a look here, https://github.com/jcrist/Control.jl
ks in base and rebuild the
system image, but that's a desireable thing to know how to do regardless.
-Tony
On Thursday, February 20, 2014 6:51:52 PM UTC-8, Jameson wrote:
>
> It's copied from contrib/windows. And apparently needs to be updated for
> julia 0.3. Feel free to subm
PL2 license.
> Not sure what to make of this. The most recent free version should
> definitely be the one used.
>
> On Thursday, February 20, 2014 9:25:10 PM UTC-6, Jeremy West wrote:
>>
>> I guess somebody got impatient with my disappearance :) I'll probably
>> cont
body else does.
About 65% of the time in your test appears to be spent in the
double-transpose at the end of sparse matmul (lines 175 and 176 of
linalg/sparse.jl).
-Tony
On Friday, February 21, 2014 6:48:44 PM UTC-8, John Myles White wrote:
>
> Are you timing these in the global scope
er would be able to recognize that the two inputs are the same as one
another, so it's known in advance that the output will be symmetric and we
can skip half the work?
-Tony
On Friday, February 21, 2014 10:38:53 PM UTC-8, Tony Kelman wrote:
>
> Is the right way to rectify the glob
t; matrix of all ones with itself), I think your case
would be good to add.
-Tony
On Saturday, February 22, 2014 4:34:43 AM UTC-8, Tim Holy wrote:
>
> Looks like our algorithm is based on Gustavson 78, and on modern machines
> (i.e., cache-miss dominated) there seems to be a much fas
There's a major difference in philosophy in that much of the high-level
functionality in Mathematica is hidden in internal logic that is
deliberately difficult for users to dive into. For example,
from
http://reference.wolfram.com/mathematica/tutorial/SomeNotesOnInternalImplementation.html#3826
There's probably a fancier way of Currying or partial application, but the
direct translation of making an anonymous function of just the first input
would be:
t -> costFunction(t, X, y)
On Friday, February 28, 2014 11:18:54 AM UTC-8, Paulo Castro wrote:
>
> Hi!
>
> I'm doing the Machine Lear
Sorry for bumping a month-old thread, but I was searching for this:
> more time is spent building and precompiling the system image (which
cannot be sped up with -j N) than actually compiling and linking its C
sources.
Can you explain why building the system image can't be parallelized? Could
ge (by moving or deleting
lib/julia/sys.ji then running bin/prepare-julia-env.bat) makes the warning
go away. In case anyone else sees this and wonders whether it means
anything...
-Tony
It's very Windows-specific, but has anyone investigated communicating
between Julia and Windows apps via COM? I used to do this with Matlab all
the time, auto-generate long repetitive Powerpoint presentations or Word
reports programmatically.
On Saturday, March 8, 2014 11:44:49 PM UTC-8, James
+1 for more "doing-the-right-thing"-ness wrt annoying carriage returns.
Semi-related: in test/spawn.jl, the tests on lines 17 and 23 fail when run
in a Windows command prompt but succeed from an MSYS/Cygwin terminal
because they pipe to whichever sort.exe is found in PATH, and lines are
termina
l he's put together, and he's
been very responsive to troubleshooting and feature requests.
-Tony
Try `make -C src clean-flisp`
On Tuesday, March 11, 2014 12:55:38 PM UTC-7, Comer Duncan wrote:
>
> I have been out of town for ten days and today did a git pull. I then did
> the usual make and got what appears to be a normal make except near the end
> I get the following spew:
>
> LINK sr
y is probably the best long-term way for
Windows users to get up and running without having a full build system
installed.
-Tony
On Tuesday, March 11, 2014 1:55:17 PM UTC-7, Jake Bolewski wrote:
>
> This is really great. As someone who has gone most of his life without
> using Win
Try run(`explorer C:\\myfile.txt`) - it's obviously non-portable and it's
seeming to give a "failed process: Process(`explorer 'C:\myfile.txt'`,
ProcessExited(1)) [1]" error, but it does open the file.
.bat files seem to work fine with run:
run(`$JULIA_HOME\\echo.bat hello`)
Hopefully someone w
+1 to looking at getting Julia and its dependencies into Chocolatey, have
had good experiences with it so far but not sure yet how to create new
packages.
Is there any harm in keeping debugging back-and-forth off the list? It's
good to have these things in public somewhere, either on a list or
+1 to looking at getting Julia and its dependencies into Chocolatey, have
had good experiences with it so far but not sure yet how to create new
packages.
Is there any harm in keeping debugging back-and-forth *on* the list? It's
good to have these things in public somewhere, either on a list or
While you're considering API changes, what would you think about getting
rid of the "xp" from derivative_rules
here
https://github.com/johnmyleswhite/Calculus2.jl/blob/master/src/symbolic/gradexpr.jl#L121-L186
?
Derivative calculations that use xp can trivially multiply by it without it
bein
> The dynamic names for a field in a matlab struct is (btw: this is recent)
To pick a nit, dynamic field names for structs have been around since R13,
not what I'd call
recent:
http://blogs.mathworks.com/loren/2005/12/13/use-dynamic-field-references/
The containers.Map version was added in R20
The error message could maybe be misleading, since it's running a
multi-line rule? Do you have `install_name_tool` on your path?
On Friday, March 28, 2014 6:21:56 PM UTC-7, Guillermo Garza wrote:
>
> Isaiah, the file is decompressed, but nothing changes. I get the same
> error.
>
> /bin/sh: li
Whole-array inequalities between matrices can have context-dependent
meanings. For example, you can define a very useful ordering among the set
of positive semidefinite symmetric matrices - this is used in constrained
optimization (semidefinite programming) since the space of positive
semidefin
be sustainably maintained if there's a way of constantly testing it
that gets checked regularly. Perhaps a Jenkins instance, or a locally
hosted Travis image somewhere? Would need some developer bandwidth to get
set up, and issues flagged when they occur.
-Tony
usable as a drop-in replacement for GMP?
A MinGW build of GLPK should work with a MinGW build of GMP (like the one
Julia's using, and probably R too?), but if you want to use a pre-compiled
binary for one or the other you'll have to be very careful to use
compatible compiler versions.
Another semi-hacky option here is using a conventional double-precision LP
solver to tell you the active set at the solution the solver considered
optimal (up to whatever its tolerance was set to). Then you can take that
active set and solve the arbitrary-precision version of the constraint
mat
Have a look at the IterativeSolvers
package: https://github.com/JuliaLang/IterativeSolvers.jl
It hasn't seen much development in the last couple months, but it does
contain CG and GMRES implementations that can take preconditioners.
On Wednesday, April 9, 2014 8:53:02 AM UTC-7, Alexander Samoi
Unless I'm blind and just can't find one, it appears there is not yet a
solid high-dimensional computational geometry package for Julia, like
cddlib or the Multi-Parametric Toolbox for Matlab. I imagine a wrapper
around cddlib would be fairly easy to write (perhaps even autogenerated),
or you c
MPFR and GMP are LGPL, which is not quite as problematic or viral.
Some of SuiteSparse is GPL, parts of it are LGPL, and at least one file of
the Julia code in base for sparse matrices that is based on parts of
SuiteSparse is also LGPL.
On Thursday, April 10, 2014 7:18:45 AM UTC-7, Jake Bolews
help> setdiff
INFO: Loading help data...
Base.setdiff(s1, s2)
Construct the set of elements in "s1" but not "s2". Maintains
order with arrays. Note that both arguments must be collections,
and both will be iterated over. In particular,
"setdiff(set,element)" where "element" is a potent
lia AD for the same model formulation,
and allow JuMP models to access a wider variety of existing optimization
solvers, and solvers written entirely in Julia to access a huge number of
existing test problems.
-Tony
On Saturday, April 12, 2014 10:14:51 PM UTC-7, Dominique Orban wrote:
>
>
That's fixable. I spent a bunch of time last year making it much easier to
build dll's of the COIN-OR solvers. There are 64-bit binaries
here
https://projects.coin-or.org/CoinMP/browser/releases/1.7.6/CoinMP/CoinMP.zip
and an issue open here https://github.com/JuliaOpt/Cbc.jl/issues/5
On Sat
Anybody else get a "no method sparse(Int64, Int64, Array{Int64,1}, Int64,
Int64, Function)" when you try b = sparse(2,1,-1,10,1), or just me (win64,
bf709c)?
Aside from that, A\full(b) should work in this case.
On Sunday, April 13, 2014 11:40:02 PM UTC-7, Jameson wrote:
>
> IIRC, spare divisio
This might be the same Haswell Windows OpenBlas threading problem
as https://github.com/JuliaLang/julia/issues/6504
Does inv(rand(3,3)) crash? What about if you run blas_set_num_threads(1)
beforehand?
On Sunday, April 13, 2014 12:55:41 PM UTC-7, Ariel Keselman wrote:
>
> Just installed Julia 6
This conversation is reminding me of a post from John D Cook a couple years
ago (www.johndcook.com/blog/2012/04/02/why-scipy/) where he said he would
"rather do math in a general-purpose language than try to do
general-purpose programming in a math language." He has a point, for
example interfa
You can work from a binary installation to test your changes locally, but
you'll need to rebuild the "system image" for changes to Julia code in base
to take effect. Last I checked this detail is not explicitly documented
anywhere, adding a sentence or two to CONTRIBUTING.md about this would be
27 PM UTC-7, David P. Sanders wrote:
>
>
>
> El lunes, 14 de abril de 2014 04:42:47 UTC-5, Tony Kelman escribió:
>>
>> Anybody else get a "no method sparse(Int64, Int64, Array{Int64,1}, Int64,
>> Int64, Function)" when you try b = sparse(2,1,-1,10,1), or
> written in Julia shouldn't be tied to a particular AD implementation or
>> modeling language; ideally they will just implement a nonlinear
>> MathProgBase interface (which doesn't quite exist yet), on top of which
>> they could be called from JuMP or AMPL. I agree wit
> At least in Python, trips in and out of ADOL-C almost count for nothing
as they're just passing pointers around.
This might be the case in Julia as well. But I think you'll agree that
ADOL-C and friends are much more opaque and less hackable than Julia code.
> At least on OSX, both can be ins
> Sure, they're opaque but I'm saying that they're opaque for a reason. AD
is an entire field of research. As is optimization.
I don't entirely understand the details, but there are some features of
Julia as a language that allow you to do some truly new things with respect
to AD (and maybe eve
How about
mysize(A) = if ndims(A) == 1; return length(A), 1; else return size(A); end
Though this is kind of lying, since a true 1-dimensional vector doesn't
have a second dimension.
If it really makes your life easier to treat vectors as n-by-1 column
matrices like Matlab does, you can curren
The "logical indexing" version of that would be
f = Dstc["time"][i] .<= Dstr["time"] .< Dstc["time"][i+1]
dN = Dstr["NH3"][f]
In other words dropping the "find" and using a boolean array (BitArray) to
do the indexing. In Matlab this is usually faster, not sure whether the
same speed comparison t
Bokeh looks very nice indeed! I would absolutely use this, if I didn't have
to go through Python.
That last one should be fixed
by
https://github.com/JuliaLang/julia/commit/5ab3020077f8947d806fddaab8de45381908a9c5,
there's been some churn in random-number generation recently and how those
dependencies are handled.
On Friday, April 18, 2014 1:43:10 PM UTC-7, Comer Duncan wrote:
>
> Ok, I
I just opened an issue at
https://github.com/IainNZ/PackageEvaluator.jl/issues/51 to discuss getting
Windows package testing into PackageEvaluator, if that might be possible.
-Tony
On Saturday, April 19, 2014 9:33:59 AM UTC-7, Laszlo Hars wrote:
>
> Tobias,
>
> It is not a bug: the C
First hurdle is getting Julia to run on an ARM processor,
see https://github.com/JuliaLang/julia/issues/3134
If Objective-C code has the same ABI as conventional C, then I imagine
Julia's ccall's should work the same
(http://nbviewer.ipython.org/gist/evanmiller/9022903 looks relevant?).
Don't
We're not turning it into a shared library at present, but we are already
building librbio.a under deps/SuiteSparse-4.2.1/RBio/Lib
I bet with a few additional lines
here https://github.com/JuliaLang/julia/blob/master/deps/Makefile#L1239-L1247
you could leverage that to save some time? Pure-Juli
Some of this functionality might be available by accessing CHOLMOD types
and functions, but they aren't fully exported, documented, etc. Last time I
tried to use these it looked like there were some memory leaks as well.
On Sunday, April 27, 2014 12:50:47 PM UTC-7, Andreas Noack Jensen wrote:
>
Hi. When you cross-post the same question to both the mailing list and as a
new Github issue, it would help people keep track of things if you could
post links from one to the other
- https://github.com/JuliaLang/julia/issues/6687
As I wrote on the Github issue, this is due to the LibCURL.jl pa
If you're assembling the matrix in row-sorted column-major order and
there's no duplication, then you can also skip the conversion work by using
the SparseMatrixCSC constructor directly.
On Wednesday, April 30, 2014 1:10:31 AM UTC-7, Viral Shah wrote:
>
> Could you post your code? Will avoid me
gt;>
>> >> Thanks for all the comments. These are helpful. It had not crossed
>> my mind that I could control the data type of the indices.
>> >>
>> >> Using the SparseMatrixCSC constructor directly would probably be very
>> helpful. Do you learn about
I'm not sure if the functionality is in base, but presumably one of the
http client packages (like https://github.com/loladiro/Requests.jl) could
do what you're looking for?
On Wednesday, April 30, 2014 8:57:17 AM UTC-7, joanenric barcelo wrote:
>
> Hi!
>
> I'm coming from Matlab and I would li
Do those deps.jl files exist? What happens if you do Pkg.build("GnuTLS") or
Pkg.build("Cairo") ?
On Saturday, May 3, 2014 3:16:30 AM UTC-7, joanenric barcelo wrote:
>
> I cannot use Requests package in Win XP. I get the following message:
>
> OpenBLAS : Your OS does not support AVX instructions.
>
> if isfile(joinpath(Pkg.dir("Gurobi"),"deps","deps.jl"))
> include("../deps/deps.jl")
> else
> error("Gurobi not properly installed. Please run Pkg.build(\"Gurobi\")")
> end
>
>
> On Saturday, May 3, 2
On the lines where you initialize k and l to [0 0 0 0 0 0], that is an
array of integers by default. Then in the for loops where you try to assign
a floating-point result into that array, you get an InexactError because a
general floating-point number can't be exactly represented as an integer.
This is without a doubt the most frustrating aspect of using Julia, so it's
definitely an issue most people would like to see addressed. As I
understand it there are some technical challenges that make this more
difficult to do in a satisfying way than one would hope. The JIT backend is
likely
suggest!
>
>
>
> El sábado, 3 de mayo de 2014 16:54:35 UTC+1, Tony Kelman escribió:
>>
>> Good call Miles, that does make things easier to figure out for users.
>>
>> I was able to reproduce the problem with Requests/GnuTLS on Windows XP
>> (look what yo
Good catch. This looks almost entirely due to the order in which
Polynomial.jl is creating the companion matrix. The modified version
at https://github.com/loladiro/Polynomials.jl which stores the coefficients
in the mathematical order instead of the Matlab order does a little better,
but worry
> be related to this patch https://github.com/amitmurthy/LibCURL.jl/pull/10that
> was recently applied. Maybe Tony can help out here.
>
>
> On Tue, May 6, 2014 at 7:13 PM, joanenric barcelo
>
> > wrote:
>
>> Thanks Amit, I've tried your package
Good work! For eventual sparse Jacobians you'll probably want to have a
look at the various Julia automatic differentiation packages that folks
have put together. Many of their uses have been confined to optimization
(and maybe also solving nonlinear systems of equations?) so far, but DAE
solve
the
deps/build.jl I wrote in that patch would just automatically do that.
On Tuesday, May 6, 2014 1:47:11 PM UTC-7, Tony Kelman wrote:
>
> I'll have a look. It might be another case of Windows XP missing a some
> function in its runtime library that libcurl.dll is trying to use.
>
3.0
> 2.0
> 1.0
>
> This is almost the same result as with Matlab above. Does this mean,
> Polynomial is constructing a different / wrong companion matrix?
>
>
> On Monday, May 5, 2014 11:24:47 PM UTC+2, Tony Kelman wrote:
>>
>> Good catch.
By default GitHub doesn't enable issue tracking in forked repositories, the
person who makes the fork has to manually go do that under settings.
On Friday, May 9, 2014 9:39:56 AM UTC-7, Hans W Borchers wrote:
>
> @Jameson
> I am writing a small report on scientific programming with Julia. I
> c
1. There's Julia Studio by Forio, Julia-specific plugins for IPython,
Sublime Text, and Light Table, as well as a few native-Julia IDE's (using
Gtk or OpenGL or other toolkits) being worked on by various people.
2. https://github.com/malmaud/Autoreload.jl might be one solution for this?
3. Don'
ed, but I don't know if I'll have
> the time to set up a build environment for testing it before the next
> binary pre-release.
>
> @Tony Kelman
>
> Summing it up: For each of the points a solution exists but none of them
> are treated as core part of the system and a
I couldn't find one, I don't think Sundials or DASSL do BVP's. Would be a
useful thing to write though!
Porting some BVP solvers and pseudospectral optimal control codes (like
PSOPT http://www.psopt.org/ or GPOPS-II
http://vdol.mae.ufl.edu/JournalPublications/TOMS-GPOPS-II-August-2013.pdf)
int
BinDeps.debug("ZMQ") may help? Could use clearer docs.
On Sunday, May 11, 2014 10:29:51 PM UTC-7, Kuba Roth wrote:
>
> Ok, I think I found what actually was happening.
> If I have a library already on the system path Pkg skips the building
> step. This is fine but the message it gives is kind of
> Matlab uses the = version but only allows ranges on the right hand side
Not quite, you can use other "iterables" (not that Matlab has a very formal
definition of the term) in Matlab for loops like arbitrary vectors or cell
arrays or matrices, but it's very particular about looping through by
Hello, new user and subscriber here. Is there a way to decompose a
UnionType back into its constituent type(s)?
I tried names():
> dt = Union(Int,Float64)
> names(dt)
1-element Array{Symbol,1}:
:types
convert() seems to hit dead-ends.
Help appreciated.
Tony
Fantastic. Thank you all.
Hello,
It's hopefully a small thing. In REPL, is there a way to print text in
color? I'm doing a bunch of poor man's debugging using println and having
some color differentiation would help productivity.
T
Sundials needs BinDeps integration. I can help here, but haven't used
Sundials before. Anyone have experience using it under MinGW, any hangups
to watch out for?
On Tuesday, May 27, 2014 2:35:01 PM UTC-7, Alex wrote:
>
> The Sundials.jl interfaces the Sundials library, which includes stiff ODE
there are some undefined references in Sundials
(to `N_VNewEmpty_Serial' and `N_VCloneVectorArrayEmpty_Serial') that are
preventing libsundials_nvecserial from building as a dll. Anyone familiar
with the code know where to hunt around for those? Should just need another
link flag or tw
o, note that the user can push!(DL_LOAD_PATH, "C:/path/to/lib/") to
> tell julia where to find a dependency, without needing to modify the
> library. therefore it is preferable for a library not to hardcode a
> path, since this limits the user (Base.find_library is also provided
Hello,
I'm trying to write a finalizer for an object that is also used as the key
in a WeakKeyDict{k,v}, and I'm having a bit of trouble getting it to work.
The context is that I need to use the WeakKeyDict to handle a bunch of
additional cleanup before the WeakKeyDict's deleter handles the re
I have seen
* ddmmmyy (01Dec09)
* ddmmm (01Dec2009)
* single digit month code stemming from futures delivery codes i.e. F4
(Jan2014), so 1F4 for very terse near-term
date.
http://www.cmegroup.com/market-data/volume-open-interest/volume-by-price-faq.html#q7
On Wednesday, May 28, 2014 9:38:11
I think the Xcode fake-gcc is higher on the path than the Homebrew real-gcc.
Try
CC=/usr/local/bin/gcc
CXX=/usr/local/bin/g++
On Thursday, May 29, 2014 1:00:17 AM UTC-7, Freddy Chua wrote:
>
> Does not work, the compiler revert back to using clang
>
> On Thursday, May 29, 2014 1:57:25 PM UTC+8,
I just submitted a pull request
here https://github.com/JuliaLang/Sundials.jl/pull/12, comments welcome.
In the meantime you can test this out as follows (you might need to do
Pkg.rm("Sundials") first):
Pkg.clone("https://github.com/tkelman/Sundials.jl";)
Pkg.checkout("bindeps")
Pkg.build("Sund
I also have a similar kind of problem when doing some unrelated xml parsing
tests using LightXML today. My code hasn't changed. The stack trace
suggests it's not LightXML related but more how the type inference got
confused.
Strangely enough, as long as I repeat the function call with the same
I actually just started collaborating with these
guys http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6546013 who
recently moved from MIT to Berkeley. They're using Chisel, Bluespec, and a
custom compiler that takes a graph representation of an algorithm and
determines a hardware layout an
make these more accessible and
easier to control. Is your code running in serial, or multithreaded with
OpenMP, or on a distributed cluster with MPI? I'm not sure what's the
largest HPC-class system people have run Julia on yet.
-Tony
On Tuesday, June 3, 2014 2:25:19 AM UTC-7, Thomas Moor
1 - 100 of 985 matches
Mail list logo
