"朱" means a kind of red colors in Japanese
(https://ja.wikipedia.org/wiki/%E6%9C%B1%E8%89%B2). You placed it at the
best circle of the logo.
On Friday, September 30, 2016 at 9:47:04 AM UTC+9, Waldir Pimenta wrote:
>
> Hi all. I made a proposal for the logo for the Julia-i18n organization:
> ht
eulergamma is the ASCII alias for γ.
julia> γ
γ = 0.5772156649015...
julia> eulergamma
γ = 0.5772156649015...
julia> γ === eulergamma
true
If you are interested in generating the list of constants, you can use this
script:
https://github.com/isagalaev/highlight.js/blob/d506d1d305e18809b2f5
You may be interested in Merlin.jl: https://github.com/hshindo/Merlin.jl.
This supports describing computation graphs in Julia and optimization.
On Saturday, June 25, 2016 at 8:27:31 AM UTC+9, Gabriel Goh wrote:
>
> I'm wondering if a library in Julia exists where I can specify dataflow
> graphs
I guess what you want is RLEVector of RLEVectors.jl:
https://github.com/phaverty/RLEVectors.jl.
This does run-length encoding for repeated elements and hence applying a
function to all elements would be fast.
julia> v = RLEVector(vcat(zeros(1), ones(1)))
RLEVectors.RLEVector{Float64,Int
This may be an off-the-topic suggestion, but Spacemacs with ESS layer is
almost an IDE to me.
I started to use it a few days ago (so I may missing something important)
and found it includes features like:
* REPL integration
* Completing names from imported modules
* Document viewer
* etc.
I bel
I think GNU parallel is the best tool for that purpose.
http://www.gnu.org/software/parallel/
You can pass -j option to control the number of maximum jobs at a time.
Hi, Elmo,
Thank you for using our Bio.jl package.
I guess that is because you didn't run `using Bio.Seq` before opening a
FASTA file. Types and functions related to biological sequences are defined
in the`Bio.Seq` module, not `Bio`.
And, you don't have to install neither Colm nor Ragel in order
Sorry, I meant:
Base.isless(s1::State, s2::State) = isless(s1.a, s2.a) || (s1.a == s2.a &&
isless(s1.b, s2.b))
On Friday, January 8, 2016 at 7:56:51 PM UTC+9, Kenta Sato wrote:
>
> The priority queue in Base is different from priority queues in other
> languages.
> I
The priority queue in Base is different from priority queues in other
languages.
I think you can use a plain priority queue (or heap) defined the
DataStructures.jl package.
To pair priority and state, `priority => state` would be helpful. This
paired values are ordered by the first element (prio
I've never tried, but you may be able to use streaming XML parsing of the
LibExpat.jl package to parse such a large XML file.
See https://github.com/amitmurthy/LibExpat.jl#streaming-xml-parsing.
On Tuesday, January 5, 2016 at 11:55:52 PM UTC+9, Brandon Booth wrote:
>
> I'm trying to parse a seri
iral
>
> On Thursday, November 12, 2015 at 5:00:34 AM UTC+5:30, Kenta Sato wrote:
>>
>> JuliaML! sounds cool!
>> I can offer the JuliaML organization my random forest package (
>> https://github.com/bicycle1885/RandomForests.jl).
>> I will have enough time to update a
JuliaML! sounds cool!
I can offer the JuliaML organization my random forest package (
https://github.com/bicycle1885/RandomForests.jl).
I will have enough time to update and maintain the package, but I'm not a
specialist in machine learning. So, if anyone has much better
implementation ideas, it
I thought that `foo[i] = x` is a syntax sugar of `setindex!(foo, x, i)` and
hence the return values are identical in both cases. This is suggested in a
section of the manual:
http://julia.readthedocs.org/en/release-0.3/stdlib/collections/#indexable-collections
.
setindex!(*collection*, *value*,
gt;> finalizer(smart_p, p -> c_free(p.pointer))
>> end
>> end
>>
>> p = SmartPointer{Uint8}(convert(Ptr{Uint8}, c_malloc(1024)))
>>
>> Am I doing something wrong?
>>
>>
>> On Sunday, March 16, 2014 12:12:31 AM UTC+9, Patrick O&#
TC+9, Patrick O'Leary wrote:
>
> Maybe finalizer() will do what you need?
> http://julia.readthedocs.org/en/latest/stdlib/base/#Base.finalizer
>
> On Saturday, March 15, 2014 9:49:56 AM UTC-5, Kenta Sato wrote:
>>
>> Hi everyone,
>>
>> I'm w
Hi everyone,
I'm wondering if there are "smart pointers" like C++ in Julia.
Calling C functions often require managing raw pointers allocated in the C
functions.
After allocating a pointer, I want to wrap it up with a smart pointer,
which automatically frees the raw pointer when the smart pointe
st :)
P.S. As announced here (
https://groups.google.com/forum/#!topic/julia-users/Yw5pB4voy1s), I
released DocOpt.jl package.
On Tuesday, March 11, 2014 2:35:17 AM UTC+9, Steven G. Johnson wrote:
>
>
>
> On Sunday, March 9, 2014 10:20:23 PM UTC-4, Kenta Sato wrote:
>>
>
of "document" and
> "options".
>
>
> On Mon, Mar 10, 2014 at 1:38 AM, Kenta Sato
> > wrote:
>
>> Hi,
>>
>> A few days ago, I released a new port of docopt written in Julia.
>> This is my first package written in Julia, so the code c
Hi,
A few days ago, I released a new port of docopt written in Julia.
This is my first package written in Julia, so the code can contain some bad
practice.
The package is currently not registered as an official package, but
available from my repository (https://github.com/bicycle1885/Docopt.jl).
nversions, which will save you a lot of headache (also, it does
>> everything using ctypes which will make cross-platform deployment much
>> simpler).
>>
>>
>> On Sat, Mar 8, 2014 at 10:11 PM, Kenta Sato
>> > wrote:
>>
>>> Hi,
>>>
>>&g
ve you a lot of headache (also, it does
> everything using ctypes which will make cross-platform deployment much
> simpler).
>
>
> On Sat, Mar 8, 2014 at 10:11 PM, Kenta Sato
> > wrote:
>
>> Hi,
>>
>> I'm new to the Julia language, and I'm now t
Hi,
I'm new to the Julia language, and I'm now trying the Julia C API in order
to call Julia functions from Python.
I've become successful with calling some basic Julia functions such as (*)
and sqrt() and converting the returned values to corresponding ones in
Python.
But I've got into a troub
22 matches
Mail list logo
