> interested in this kind of functionality please contact me directly.
>
>
> On Wed, Nov 2, 2016 at 10:37 AM, Seth <catc...@bromberger.com
> > wrote:
> > From http://juliacomputing.com/products/juliafin.html
> >
> >> JuliaDB is a high-performance, colum
>From http://juliacomputing.com/products/juliafin.html
*JuliaDB* is a high-performance, columnar data store for working with
> large-scale time series data. What sets it apart from the existing products
> in this area is the tight-knit integration of data and algorithms with the
> full power
On Tuesday, September 27, 2016 at 4:06:10 AM UTC-7, cormu...@mac.com wrote:
>
> Ah, yes. Strange. Thanks.
>
> Trying to install it looks like it's not the simple solution I was looking
> for.
>
> WARNING: The following packages do not have relocatable bottles,
> installation may fail!
>
Sorry if this is not relevant to your use of LightGraphs, but I wanted to
make sure everyone's aware of a change in the API for the
`induced_subgraph()` function.
Starting in LightGraphs 0.7.1, `induced_subgraph()` will, in addition to
the subgraph itself, return a mapping of the original
node.edges)
> ...
> ```
>
> -erik
>
>
>
> On Tue, Aug 2, 2016 at 1:56 PM, Seth <catc...@bromberger.com
> > wrote:
>
>>
>>
>> On Tuesday, August 2, 2016 at 10:41:26 AM UTC-7, Seth wrote:
>>>
>>> So, a 62.5 million edge LightGraphs.Gr
On Tuesday, August 2, 2016 at 10:41:26 AM UTC-7, Seth wrote:
>
> So, a 62.5 million edge LightGraphs.Graph should only take about a 1.25
> gigs of memory, all-in. However, because the edges are being added to
> vectors within the datastructure, and each vector is doing it
So, a 62.5 million edge LightGraphs.Graph should only take about a 1.25
gigs of memory, all-in. However, because the edges are being added to
vectors within the datastructure, and each vector is doing its own memory
allocation, we wind up with the Julia process taking ~6.5 gigs.
Given that we
Simpler, perhaps:
julia> foo(x) = x + 6
foo (generic function with 1 method)
julia> string(foo)
"foo"
julia> string(foos) # just to show it's not arbitrary
ERROR: UndefVarError: foos not defined
On Friday, April 8, 2016 at 11:50:45 PM UTC-7, K leo wrote:
>
> Thanks. I have an array
ITerm with Compose.jl and TerminalExtensions.jl allows me to use
GraphPlots.jl to visualize LightGraph output.
On Saturday, April 2, 2016 at 3:45:22 AM UTC-7, Oliver Schulz wrote:
>
> Hi,
>
> I'm looking for a Julia console with inline graphics (e.g. to display
> Gadfly plots). There's
Hi all,
I have the following on 0.4.6-pre+18:
z = [Pair((+,1,5,7), 3), Pair((-,6,5,3,5,8), 1)]
type Foo
x::Array{Pair{Tuple{Function, Vararg{Int}}, Int}}
end
and I'm getting
julia> Foo(z)
ERROR: MethodError: `convert` has no method matching
Hi James,
I started a conversation regarding the same on the gitter
channel https://gitter.im/JuliaGraphs/LightGraphs.jl with Seth Bromberger
Thanks :)
Mridul
On Saturday, 12 March 2016 06:51:24 UTC+5:30, James Fairbanks wrote:
>
> Hi Mridul,
>
> JuliaGraphs is a Github
Thanks,
Mridul Seth
Seems to me that this is just a more complex repeat...until or do...while
bottom-conditional loop, which has already been discussed and rejected (to
my disappointment).
On Wednesday, December 9, 2015 at 7:05:43 AM UTC-8, Dan wrote:
>
> *A non-breaking Julia control-flow change to separate the
age"))
> ...
> else
> ...
> end
>
>
> On Monday, December 7, 2015 at 10:50:56 AM UTC-5, Seth wrote:
>>
>> Is there a way to specify a conditional dependency (that is, use package
>> Foo if it's available and define functions that use things from Foo;
&
``
> On Tuesday, December 8, 2015 at 11:02:17 AM UTC-5, Jeffrey Sarnoff wrote:
>>
>> if isdir(joinpath(Pkg.dir(),"Package"))
>> ...
>> else
>> ...
>> end
>>
>>
>> On Monday, December 7, 2015 at 10:50:56 AM UTC-5, Seth wrote
Is there a way to specify a conditional dependency (that is, use package
Foo if it's available and define functions that use things from Foo;
otherwise, don't define the functions or throw an error message) on
packages that contain macros? isdefined(Main, :Package) won't work since
the macros
I was just about to post this result, which I don't understand. Why should
0.0 == -0.0
but bar(0.0) != bar(-0.0) when bar is immutable? (yes, you can override ==
for this to be ==(x::bar, y::bar) = x.a == y.a, but that seems as if it
should be unnecessary.)
On Monday, December 7, 2015 at
Are you connected to the internet? Can you get to https://www.github.com
from your browser? Do you have a firewall / proxy / other network filtering
device between you and github?
On Saturday, December 5, 2015 at 11:41:41 PM UTC-8, bbd 666 wrote:
>
> I've just installed Julia 0.3.12
> I can't
Hi,
I'm moving from Gzip.jl to Libz.jl, and am running into a problem. Gzip
used to allow a file to be opened using its methods even if the file was
not encrypted. Libz doesn't allow that.
The problem I'm having is that I can't figure out a try/catch/finally that
works. Basically, I want this
) do io
> do_sth(io)
> end
> ```
>
> which ensures that `io` will be closed no matter what.
>
> -erik
>
>
> On Sun, Dec 6, 2015 at 8:16 PM, Seth <catc...@bromberger.com
> > wrote:
>
>> Hi,
>>
>> I'm moving from Gzip.jl to Libz.j
That works, but I'm concerned with the part of the original post that says
" I want to change some of the bits and get a hex back"
I'm hoping that the OP's plan to "change bits" is not realized by changing
the string representation, but rather changing the bit representation
(using << and >>
Maybe this will work for you?
julia> a = "foobarbaz"
"foobarbaz"
julia> b = SubString(a,3,6)
"obar"
julia> typeof(b)
SubString{ASCIIString}
julia> c = ASCIIString(b)
"obar"
julia> typeof(c)
ASCIIString
On Friday, December 4, 2015 at 2:48:12 PM UTC-8, Charles Santana wrote:
>
> Hi people,
>
I'd rather not alter any of the source files. Is there a Pkg command that
will recompile? (Pkg.build() doesn't seem to do it).
Awesome. Thank you.
On Friday, December 4, 2015 at 4:29:57 PM UTC-8, Tony Kelman wrote:
>
> Base.compilecache
>
> On Friday, December 4, 2015 at 2:50:03 PM UTC-8, Seth wrote:
>>
>> I'd rather not alter any of the source files. Is there a Pkg command that
>> will r
you're binary-or'ing a bit with 0x0, which means you're not going to change
it.
There's some useful information
here: https://en.wikipedia.org/wiki/Bit_manipulation
On Friday, December 4, 2015 at 9:47:45 AM UTC-8, Martin Somers wrote:
>
>
>
> On Friday, 4 December 2015 16:36:34 UTC, James
If you don't like regexes,
julia> a = ["apple","bear","ape","collar"]
4-element Array{ASCIIString,1}:
"apple"
"bear"
"ape"
"collar"
julia> filter(x->contains(x,"ap"),a)
2-element Array{ASCIIString,1}:
"apple"
"ape"
julia> filter(x->contains(x,"ar"),a)
2-element Array{ASCIIString,1}:
One way using my previous code:
julia> find(x->contains(x,"ap"),a)
2-element Array{Int64,1}:
1
3
julia> find(x->contains(x,"ar"),a)
2-element Array{Int64,1}:
2
4
On Thursday, December 3, 2015 at 1:24:07 PM UTC-8, Jason McConochie wrote:
>
> Thank you to all. In particular, how can the
That's really elegant. Is there a reason filter() is defined for regex
strings but not ASCIIStrings?
On Thursday, December 3, 2015 at 12:55:50 PM UTC-8, Stefan Karpinski wrote:
>
> You can just pass a Regex object to filter:
>
> filter(r"a.*b.*c"i,
n but that's pretty arbitrary. You could just
> as well check for containment the other way. Or prefix, or suffix, etc.
>
> On Thu, Dec 3, 2015 at 4:01 PM, Seth <catc...@bromberger.com
> > wrote:
>
>> That's really elegant. Is there a reason filter() is defined for
This is great. I assume it catches "for i in n" where n is a scalar, also,
right?
I could see requiring this by default in all my packages.
On Wednesday, December 2, 2015 at 1:49:22 AM UTC-8, Eric Forgy wrote:
>
> Some more improvements...
>
> julia> n = 5
> 5
>
> julia> for i = n
>
Probably has to do with global scope. Try putting it in a function:
julia> function f()
tic()
start = time()
sleep(1)
done = time()
toc()
println(done - start)
end
f (generic function with 1 method)
julia> f()
elapsed time: 1.003258943 seconds
urday, November 28, 2015 at 3:15:18 AM UTC+2, Seth wrote:
>>
>> I guess that makes sense, though I struggle to see why one would create
>> an iterator that produces multiple types.
>>
>> On Friday, November 27, 2015 at 4:45:26 PM UTC-8, ele...@gmail.com wrote:
&
I have implemented my own iterator that works against edges in a graph, and
edges(g) returns the iterator. However, collect(edges(g)) returns an array
of Any,1. I'd like it to return an array of Edge, 1. What am I missing?
t; goes and copy them to the right type collection later, or iterate twice.
>
> On Saturday, November 28, 2015 at 10:17:09 AM UTC+10, Seth wrote:
>>
>> Well, I just found collect(Edge, edges(g)) works, but it would be nice
>> if collect() returned a vector of Edge by def
stead of Any, otherwise it would have to iterate the collection to
>> find all the types and either accumulate the results in an Any collection
>> as it goes and copy them to the right type collection later, or iterate
>> twice.
>>
>> On Saturday, November 28, 2015 at 10
Well, I just found collect(Edge, edges(g)) works, but it would be nice if
collect() returned a vector of Edge by default. Any ideas?
On Friday, November 27, 2015 at 3:46:58 PM UTC-8, Seth wrote:
>
> I have implemented my own iterator that works against edges in a graph,
> and edges(g
Are you doing floating point calculations? Some FP operations aren't
associative and therefore may appear different on successive runs of a
parallel operation depending on what's summed first:
julia> (0.1 + 0.2) + 0.3
0.6001
julia> 0.1 + (0.2 + 0.3)
0.6
On Thursday, November 26,
I would suggest that
> sizehint!(c,n) where n is smaller than the current size of the collection c
> should do this, if someone wants to take a crack at it.
>
> On Wed, Nov 25, 2015 at 5:02 PM, Seth <catc...@bromberger.com
> > wrote:
>
>> Inspired by a discussio
Inspired by a discussion
here: https://github.com/JuliaLang/julia/issues/14112#issuecomment-159715454,
it might be nice to be able to reduce the amount of "padded"
(allocated-but-not-yet-used) memory for dynamic structures in certain cases
where we're not planning to expand the structures
Why not simply
_, x, _, y = f()
? This seems easier to read and understand. _ is a valid variable but is
typically used for superfluous assignment.
On Monday, November 23, 2015 at 9:56:27 AM UTC-8, Sisyphuss wrote:
>
> OK, so if I have a function which returns a tuple (a,b,c,d),
> but I only
rem_vertex!() soon thanks to Carlo Lucibello, but
it's not in master yet and it's probably not as performant as the above.
Thanks,
Seth.
On Monday, November 23, 2015 at 5:17:33 AM UTC-8, Aleksandr Mikheev wrote:
>
> Hi all,
>
> I'm currently using LightGraphs package in my stud
Keep in mind that induced subgraphs will not preserve vertex numbering, so
if you do something like
G = G[4,5,6]
your old vertices 4, 5, and 6 will be renumbered so that the new G has
vertices in the range 1 : 3.
On Monday, November 23, 2015 at 5:23:55 AM UTC-8, Seth wrote:
>
> Ale
On Monday, November 23, 2015 at 2:09:13 PM UTC-8, Aleksandr Mikheev wrote:
>
> Excuse me once again. How can I use rem_vertex!() now? I tried to update
> my package - didn't help. I tried to do a new file (called GraphFeatures),
> in witch I copied all the functions from here
>
Er. Sorry for the bad instructions. Don't use Pkg.clone("LightGraphs"), use
Pkg.checkout("LightGraphs").
On Monday, November 23, 2015 at 2:31:42 PM UTC-8, Seth wrote:
>
>
>
> On Monday, November 23, 2015 at 2:09:13 PM UTC-8, Aleksandr Mikheev wrote:
>>
...and just to follow up, rem_vertex!() is now in LightGraphs master. This
will be more efficient if the connected components you're trying to remove
are small relative to the ones you want to preserve.
On Monday, November 23, 2015 at 5:28:04 AM UTC-8, Seth wrote:
>
> Keep in mind that i
Avik,
what happens with precompilation if .julia isn't writable? (Too chicken to
try it out here.)
On Monday, November 16, 2015 at 4:30:34 AM UTC-8, Avik Sengupta wrote:
>
> .julia does not need to be writable for running Julia code. It needs to be
> writable for package operations (add,
# can't use push! here, but must manually track index instead
> end
>
> I don't know what `dynamic` does in this context, and I can't find it in
> the docs, so can't help you there :)
>
> // T
>
> On Monday, November 16, 2015 at 2:07:13 AM UTC+1, Seth wrote:
>
> What happen
well, nullspace appears to be defined for dense arrays only - and rank is
defined for abstract arrays but will fail in svdvals!() when passed a
sparse array (this is arguably a bug).
On Monday, November 16, 2015 at 1:12:04 PM UTC-8, Laurent Bartholdi wrote:
>
> Hello world,
> I'm new at julia,
Yup, I'm convinced. Though if we ever get
https://github.com/JuliaLang/julia/issues/9147 implemented perhaps it'll be
faster in the case of zeros too :)
On Monday, November 16, 2015 at 9:42:40 AM UTC-8, Tomas Lycken wrote:
>
> Yeah, that makes it even more clear that they’re very similar:
>
>
the low-hanging fruit) and a
bad sign (that we may be hitting the limits of what we can do). I'm sure
we've missed some stuff, though.
Thanks for the discussion. Feel free to join us over
at https://github.com/JuliaGraphs/LightGraphs.jl/issues if this sort of
stuff interests you :)
Seth
I managed to squeeze a bit more performance out of it:
_insert_and_dedup!(v::Vector{Int}, x::Int) = isempty(splice!(v, searchsorted
(v,x), x))
If there's a better way of doing it, please let me know.
On Monday, November 16, 2015 at 3:37:34 PM UTC-8, Seth wrote:
>
> I found this stackov
Thank you, Tim - I'll definitely check it out. Right now I can't seem to
find an efficient way of doing it, but there are a few tricks in
Iterators.jl that might work.
On Sunday, November 15, 2015 at 1:33:29 PM UTC-8, Tim Holy wrote:
>
> This may also be a case where writing an iterator that
What happens if you use sizehint!() with dynamic()?
On Sunday, November 15, 2015 at 3:35:45 PM UTC-8, Steven G. Johnson wrote:
>
> function prealloc(n)
> a = Array(Int, n)
> for i = 1:n
> a[i] = i
> end
> return a
> end
> function dynamic(n)
> a = Int[]
> for i =
4bd975a6cc5f240d/base/multidimensional.jl#L134-L150
>
>
> but perhaps vectorization isn't applicable to your problem anyway.
>
> --Tim
>
> On Sunday, November 15, 2015 05:06:23 PM Seth wrote:
> > Thank you, Tim - I'll definitely check it out. Right now I can't see
Hustf, I don't know why my reply didn't show up here yesterday, but I
wanted to thank you for the code. I'm looking at how to make that work.
Thanks for your response.
On Saturday, November 14, 2015 at 2:18:45 PM UTC-8, hustf wrote:
>
> I believe this work-in-progress type may be adapted? I
Is it always expected that foo[i] == collect(foo)[i]? I'm running into a
bit of an issue with undirected graphs where this may not be the case for
collections of graph edges, and I'm wondering how much time I should sink
into fixing a problem that might not even exist.
The discrepancy is with
in(el, S) or el in S.
On Thursday, November 12, 2015 at 2:36:28 PM UTC-8, Freddy Chua wrote:
>
> haskey does not work for Set ? It only works for Dict. Should it be that
> way? How do I test whether an element is in a Set?
>
gt;
> On Wednesday, November 11, 2015 at 8:50:17 PM UTC-8, Seth wrote:
>>
>> Thanks, Tony. It's in tests, so I guess I can make it version-dependent.
>> Is there a better way to do it? I had version conditionals throughout the
>> code during the 0.3 - 0.4 cycle, and it was less
...and I just discovered Requires.jl. Fantastic stuff.
On Thursday, November 12, 2015 at 8:55:23 PM UTC-8, Seth wrote:
>
> This could be useful to me :)
>
> I have a couple of functions that require JuMP but I don't want to add
> JuMP to my REQUIRE file. My usual tactic of che
This could be useful to me :)
I have a couple of functions that require JuMP but I don't want to add JuMP
to my REQUIRE file. My usual tactic of checking isdefined(:JuMP) won't work
because JuMP uses macros that are evaluated prior to runtime. However, I
was unable to make the following code
nk you.
>
> Freddy Chua
>
>
> On Thu, Nov 12, 2015 at 3:06 PM, Seth <catc...@bromberger.com
> > wrote:
>
>> in(el, S) or el in S.
>>
>>
>> On Thursday, November 12, 2015 at 2:36:28 PM UTC-8, Freddy Chua wrote:
>>>
>>> haskey do
LightGraphs started failing 0.5 tests, while -release is fine:
https://travis-ci.org/JuliaGraphs/LightGraphs.jl/jobs/90631116
apparently foo[3,:] now returns [x,y,z] instead of [x y z].
1) could someone confirm this new behavior?
2) what's the best way of handling this besides disabling tests
Awesome. Feel free to open up a LightGraphs issue to track.
On Wednesday, November 11, 2015 at 2:24:13 PM UTC-8, Alireza Nejati wrote:
>
> Both! :)
:43:02 PM UTC-8, Tony Kelman wrote:
>
> Yes. https://github.com/JuliaLang/julia/pull/13612
> It's in NEWS.md.
>
> Make your code version-dependent if it can't handle the new behavior.
>
>
> On Wednesday, November 11, 2015 at 8:19:32 PM UTC-8, Seth wrote:
>>
>> L
If I'm reading the graphs correctly, the underlying data is a year old.
On Monday, November 9, 2015 at 3:10:41 PM UTC-8, Ken B wrote:
>
> Here's a nice comparison of languages used in github repo's and Julia is
> #43 out of 50:
> http://githut.info/
>
> On Thursday, 5 November 2015 02:50:43
Hi Rob,
I built it (and openblas) myself (via git clone) since I'm testing out
Cxx.jl. Xcode is Version 7.1 (7B91b).
Seth.
On Friday, November 6, 2015 at 3:54:04 PM UTC-8, Rob J Goedman wrote:
>
> Seth,
>
> You must have built Julia 0.4.1-pre yourself. Did you use brew?
>
>
André,
Would you mind posting a link to the notebooks? (Also, if there's any
possibility of an English translation for your presentation, that'd be
amazing.)
Thanks,
S.
On Friday, November 6, 2015 at 3:07:47 AM UTC-8, André Lage wrote:
>
> Hello,
>
> I'll be giving the tutorial "Introduction
The way we do it in LightGraphs is as follows:
try
using GraphMatrices
import GraphMatrices.CombinatorialAdjacency
nothing
catch
end
and then
if isdefined(:GraphMatrices)
... conditional code here
end
taking advantage of the fact that :Package is defined when "Package" is
Could someone please clue me in on IntSet?
1) Does the fact that it's implemented as a bitstring mean that it's a
dense vector that takes n bits to store values from 1:n?
2) Does this also mean that search and insertion is O(1)?
3) What are common use cases for IntSets?
4) Anything else that's
It sounds like you don't have '.' in your path. In cygwin, in your bin
directory, type ./julia and see if that works.
On Sunday, November 1, 2015 at 3:31:42 PM UTC-8, digxx wrote:
>
> Thank you. After hours of compilation it finally finished without errors.
> Now I have the Julia.exe file in
+1
On Thursday, October 29, 2015 at 5:56:46 AM UTC-7, Tom Breloff wrote:
>
> Lets close the topic. Keep them both.
>
> On Thu, Oct 29, 2015 at 8:47 AM, feza
> wrote:
>
>> My only problem with `=` vs `in`
>> is that even the base julia code is inconsistent! Looking at one
One solution is to make sure you're using the current release version of
Julia: parse(Int,string(lista[3])[1]) works as intended.
On Wednesday, October 28, 2015 at 3:06:26 AM UTC-7, paul analyst wrote:
>
> Is ok but I can`t convert to int
> julia> string(lista[3])[1]
> '4'
>
> julia>
On Wednesday, October 28, 2015 at 10:20:00 AM UTC-7, Ismael VC wrote:
>
> How can I start 2 workers on each node, using Julia 0.3.11?
>
> [count*][user@]host[:port] [bind_addr[:port]]
>
> The way I understand:
>
> [count*][user@]host[:port] [bind_addr[:port]]
>
> Is that `count` is an integer
a critical bug identified we'll do
our best to fix it.
Thanks,
Seth.
I know it's good to use sizehint! with an estimate of the sizes of
(variable-length) containers such as vectors, but I have a couple of
questions I'm hoping someone could answer:
1) what are the benefits of using sizehint!? (How does it work, and under
what circumstances is it beneficial?)
2)
n the
>> size(A) in Julia. sizehint! modifies that underlying storage without
>> changing the size(A) in Julia.
>>
>> -Jacob
>>
>> On Wed, Oct 21, 2015 at 12:46 PM, Seth <c...@bromberger.com> wrote:
>>
>>> I know it's good to use sizehint
object is removed. There's an old
> issue about providing a way to "shrink" the underlying storage:
> https://github.com/JuliaLang/julia/issues/2879
>
> -Jacob
>
> On Wed, Oct 21, 2015 at 1:26 PM, Seth <catc...@bromberger.com
> > wrote:
>
>> Thanks
good now.
>
> On Sunday, October 18, 2015 at 1:28:08 PM UTC-5, Seth wrote:
>>
>> "You're replying too quickly. Please wait 277 hours before trying again."
>>
>> one comment every 11 days, or is this a bug? (I'd post it there, but)
>>
>>
>
"You're replying too quickly. Please wait 277 hours before trying again."
one comment every 11 days, or is this a bug? (I'd post it there, but)
On Tuesday, October 13, 2015 at 5:50:21 PM UTC-7, Jonathan Malmaud wrote:
>
> Also just realized there's extensive support for oneboxing (smart
This is very cool! Just FYI for others: we have native LightGraphs
integration for GraphPlot now - it joins GraphLayout and TikzGraphs as
supported rendering packages.
On Friday, October 16, 2015 at 5:57:25 AM UTC-7, Jihui Han wrote:
>
> https://github.com/afternone/GraphPlot.jl
>
>
>
Surround it by parens:
julia> ($)(x::Int, y::Int) = x+y+5
...
julia> ($)(5,7)
17
On Wednesday, October 7, 2015 at 11:39:03 AM UTC-7, cheng wang wrote:
>
> Hello everyone,
>
> I try to do $(x,y)=something, it says: syntax: invalid assignment location
> while +(x,y)=something is ok.
>
> Is there
Oops, hit post too quickly. Can also be called infix:
julia> 5 $ 7
17
On Wednesday, October 7, 2015 at 12:05:10 PM UTC-7, Seth wrote:
>
> Surround it by parens:
>
> julia> ($)(x::Int, y::Int) = x+y+5
> ...
> julia> ($)(5,7)
> 17
>
> On Wednesday, October 7, 2
As a related aside, what's the significance of the "$" in front of
"local_var"?
On Monday, October 5, 2015 at 4:04:13 PM UTC-7, Jameson wrote:
>
> despite your naming convention, it looks like "local_var" was a global.
> try wrapping it in a let block:
>
> let local_var=123
> @everywhere
Working for me at Wed Sep 23 07:13:36 PDT 2015
On Wednesday, September 23, 2015 at 7:11:55 AM UTC-7, Lars Ruthotto wrote:
>
> Dear all,
>
> I just noticed that Juliabox doesn't work right now. Is there an expected
> maintenance going on and does anybody know when it will be back?
>
> Thanks,
>
Failed to load resource: the server responded with a status of 503
>>>> (Service Unavailable: Back-end server is at capacity)
>>>>
>>>> I heard JuliaBox is running on Amazon EC2, so I think there are some
>>>> limitation for number of concurrent user
I got it to work and wrote my process up
here: https://github.com/JuliaLang/julia/issues/10766
On Monday, September 21, 2015 at 9:05:38 PM UTC-7, Amit Murthy wrote:
>
> julia> Pkg.publish()
>
> INFO: Validating METADATA
> INFO: Pushing LibCURL permanent tags: v0.1.6
> INFO: Submitting METADATA
Note that the broadcasting works for sparse matrices only on recent builds.
On Monday, September 21, 2015 at 6:28:46 AM UTC-7, Matt Bauman wrote:
>
> The bitwise operations (&, |) broadcast over arrays and work just fine for
> this. Watch out for their precedence, though: you need to wrap them
As an interim step, you can also get text profiling information using
Profile.print() if the graphics aren't working.
On Sunday, September 20, 2015 at 11:35:35 AM UTC-7, Daniel Carrera wrote:
>
> Hmm... ProfileView gives me an error:
>
> ERROR: panzoom not defined
> in view at
Might be nice to be able to bind a single ^D (EOF) to workspace() so that
we can reset easily.
On Friday, September 18, 2015 at 1:43:51 PM UTC-7, Scott Jones wrote:
>
> workspace() should give a new REPL environment in Julia.
>
> On Friday, September 18, 2015 at 4:34:41 PM UTC-4, Christof
Are there similar plans to revamp sparse matrices? (I'd like to start
getting informed as early as possible).
On Friday, September 18, 2015 at 2:14:53 AM UTC-7, Tim Holy wrote:
>
> On Thursday, September 17, 2015 11:55:56 PM harven wrote:
> > I see that there are many changes scheduled for
We'd also love to see it in LightGraphs if you want to make a PR there:
https://github.com/JuliaGraphs/LightGraphs.jl.
On Friday, September 18, 2015 at 12:56:07 AM UTC-7, Michela Di Lullo wrote:
>
> Hello everyone,
>
> I wrote a new julia function that calculates (a) cycle basis of a
>
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,
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
)
> gv() = true
> true
>
> julia> gv!(false)
> false
>
> julia> f()
> gv() = false
> false
>
>
>
>
> On Sunday, September 13, 2015 at 6:33:16 PM UTC-4, Seth wrote:
>>
>> Hi all,
>>
>> I'd like to track a setting throughout my module (t
t; etal can take an expression, but the following doesn't run:
>>
>> module A
>> foo() = println("a")
>> end
>>
>> module B
>> foo() = println("b")
>> end
>>
>> module AB
>> m(x) = x ? A : B
>> end
>>
would vec() also work for you? It's supposed to be pretty fast.
julia> a = rand(4,4)
4x4 Array{Float64,2}:
0.794534 0.618345 0.941777 0.449794
0.0615869 0.513610.141349 0.874955
0.504186 0.0687788 0.64149 0.863215
0.485404 0.193311 0.766789 0.0304138
julia> vec(a)
The numerics tested work properly.
on
Julia Version 0.4.0-pre+7107
Commit 4e44a1c (2015-08-31 16:51 UTC)
Platform Info:
System: Darwin (x86_64-apple-darwin14.5.0)
CPU: Intel(R) Core(TM) i7-5557U CPU @ 3.10GHz
WORD_SIZE: 64
BLAS: libopenblas (USE64BITINT DYNAMIC_ARCH NO_AFFINITY Haswell)
julia> remotecall_fetch(2, whos, )
>From worker 2:ArrayViews137 KB Module :
ArrayViews
>From worker 2:AutoHashEquals 5345 bytes Module :
AutoHashEquals
>From worker 2: Base 20321 KB Module : Base
>From worker 2:
Not sure if this is significant, but rmprocs(2) returns immediately with
:ok and frees up the memory (again, according to Activity Monitor).
On Wednesday, September 9, 2015 at 2:06:24 PM UTC-7, Seth wrote:
>
> julia> remotecall_fetch(2, whos, )
> From worker 2:
I *think *it's based on the first element:
julia> (2,2) < (3,3) # this makes intuitive sense
true
julia> (2,2) < (1,3) # this makes intuitive sense
false
julia> (2,2) < (3,1) # this is somewhat confusing
true
but it might be nice to have pairwise comparisons, so that, for example,
one
1 - 100 of 334 matches
Mail list logo