Thanks Tim, that makes total sense, though I was thinking of a way of
expressing this in a matlab-ish kind of way.
How about defining a macro to override type promotion, similar to @inbounds?
@nopromote b = A / uint8(2)
I would like something shorter, but we could decide on the exact name
It seems like div might do exactly what you want, although I'm not sure
what it does behind the scenes.
julia A = rand(Uint8, (100, 100));
julia b = div(A, uint8(2))
100x100 Array{Uint8,2}:
...
Also, it seems like it keeps the type of the numerator, no matter the
(integer) type of the
code_native takes a tuple of types that are used to find the method to be
compiled / displayed.
But how does those types work for keyword arguments? I am getting ERROR:
no method found for the specified argument types.
I have tried omitting the types altogether, or specifying them in the
So what is the state of things? Still no luck on Windows for me this
morning.
I did Pkg.update(), Pkg.checkout(ZipFile), Pkg.build(TestImages) in
various combinations and got the same results, no download.
I looked in the presumably updated build.jl file, I still see the same call
to
I'm trying to find a way to see if a user has typed anything into the REPL
while a long-running computation takes place so that users can hit a special
key to pause their computation and inspect its intermediate state.
To get started, I wrote this snippet and tried to see if it would count
Use set_mode! to change to raw (not-line-buffered) mode first and call
start reading. You may need to invoke process_events too
Or perhaps structure your algorithm to handle ^C and recover gracefully
Or run the code in a separate worker and send progress updates to the
controller
On Friday,
I don't see that as a viable option either.
I am trying to find out which other operations would do such promotion, but
so far the relevant one seems to be only division, I can handle that.
Now, in terms of hypothetical workarounds, what about having a macro to
override type promotion? Would that
Ok, I'll do that tomorrow.
Once again pythonistas feel the need for
a single high-level-high-performance language:
https://tech.dropbox.com/2014/04/introducing-pyston-an-upcoming-jit-based-python-implementation/
I think that this is great news for Julia, especially if Dropbox puts
serious engineering effort into this project. Julia is dynamically typed
just like Python, so all the high level optimizations PySton needs to make
a Python LLVM JIT fast will be aplicable to Julia. Both will sit ontop of
Unsexy, comprehensive modules are the best kind.
On Apr 4, 2014, at 7:23 PM, andrew cooke and...@acooke.org wrote:
An unsexy (but comprehensive!) module for calculating CRCs.
https://github.com/andrewcooke/CRC.jl
Andrew
This is really great, Doug. Would you be willing to share the raw Rmd source?
Fernando Perez wanted to show what your Rpubs document would look like in the
new native R implementation of IPython.
-- John
On Apr 4, 2014, at 2:17 PM, Douglas Bates dmba...@gmail.com wrote:
In describing to
This is indeed great. It made me consider if we should have a Subset type that
contains an array and an integer that encodes the subset with its one bits.
That would seems to alleviate the mutation issues that these combinatorics
iterators have – iterating all the subsets of something would
Yes, this is great. It does make me wonder if we should have a Subset type
that wraps a vector and an integer indicating the values to include in the
subset. Something like this:
immutable Subset{T} : AbstractVector{T}
values::Vector{T}
subset::Uint64
end
With this type, you could make
First, my environment is:
Ubuntu latest,
IPython, IJulia from github, plus all the dependencies at latest.
IPython is working just great. I get an error when I try to start it with
profile julia:
ipython notebook --profile julia
/usr/local/lib/python2.7/dist-packages/IPython/frontend.py:30:
15 matches
Mail list logo
