ps-to-discourse or
> in this thread.
>
In some parts of the world, asking for feedback on a topic via a different
medium is seen as unfriendly act ... but still there is this thread.
Wishing a happy day,
Andreas
The plan is that the transpose function will return this eventually and
within the 1.0 time frame but it's not done yet. It will probably not be
a PermutedDimsArray though because it wouldn't do the right thing for the
conjugate transpose of a complex matrix.
On Wednesday, October 12, 2016 at 5
Why does stringmime("image/png" produce jpeg?
On Thursday, October 13, 2016 at 7:44:42 AM UTC+2, love...@gmail.com wrote:
>
> I have some jpeg images saved as base64 encoded strings (such strings can
> be produced by ```stringmime("image/png", convert(Image, rand(5,5)))```
> using Images.jl). bu
It's not on purpose. It is just that it hasn't been implemented yet. It
would be great if you could open a pull request with such a method.
You might also want to define a special type for C+λI such that you can
avoid creating a new matrix but it is probably better to experiment with
such a typ
Hello colleagues,
it's quite nice to structure testing with @testset in v0.5 (and higher),
but it doesn't exist in 0.4. And it's not expected to be backported.
Could Compat be a place for this? Or just build two blocks (>0.4 and <=
v0.4) in runtests.jl ?
Hello colleague,
On Saturday, October 8, 2016 at 12:23:00 PM UTC+2, Femto Trader wrote:
>
> my main development environment is under Mac OS X
> but I'm looking for a Linux distribution (that I will run under VirtualBox)
> that have Julia 0.5.0 support (out of the box)
>
> Even Debian Sid is 0.4.7
ation.
I'm contributing to the ecosystem and it has been really a pleasure to be
part of the story.
Wishing a happy day,
Andreas
I haven't used it, but https://github.com/JuliaWeb/Requests.jl looks
reasonable
On Thursday, October 6, 2016 at 2:01:54 PM UTC+2, Jeffrey Sarnoff wrote:
>
> ok, how (within Julia)?
>
> On Thursday, October 6, 2016 at 6:19:00 AM UTC-4, Johan Sigfrids wrote:
>>
>> I would probably do a HTTP HEAD re
The documentation should be expanded with more examples. Many of the linear
algebra functions work for arbitrary input types so if you construct a
matrix with rational or integer inputs then many of the functions will
still work. We don't have much support in base for fancy math on such
matrice
Hello colleague,
On Thursday, September 29, 2016 at 9:36:43 AM UTC+2, Ferran Mazzanti wrote:
>
> Nobody is using PyPlot under OSX, please?
>
your description of the error/failure is quite broad. Please file an issue
to the package and provide details.
I'm not a OSX user (and also not pyplot), b
Hello colleague,
On Monday, September 26, 2016 at 12:50:44 AM UTC+2, Cedric St-Jean wrote:
>
> I faced very similar issues with ClobberingReload.jl.
> https://github.com/cstjean/ClobberingReload.jl/blob/master/src/ClobberingReload.jl
> Check
> out parse_file (courtesy of @stevengj), parse_modul
l, so the module exists with the orginal name, but with more
functionality
Any pointer to read?
Wishing a happy day,
Andreas
Hello colleague,
On Wednesday, September 21, 2016 at 8:34:21 PM UTC+2, Chris Rackauckas
wrote:
>
> I've managed to plot quite a few large datasets. GR through Plots.jl works
> very well for this. I tend to still prefer the defaults of PyPlot, but GR
> is just so much faster that I switch the ba
Hello colleagues,
some packages have started, some are in the process to fix their
requirements to julia > v0.3.
My question, especially to the universities/teaching communities: are there
still 0.3 users?
(and maybe you provide a 'why' along that)
Wishing a happy day,
Andreas
Hello,
On Tuesday, September 13, 2016 at 10:17:30 PM UTC+2, Yichao Yu wrote:
>
> On Tue, Sep 13, 2016 at 4:11 PM, Yichao Yu
> > wrote:
>
>> I'm able to reproduce it in rr and found the issue.
>> TL;DR the issue is at
>> https://github.com/JuliaGraphics/Cairo.jl/blame/master/src/Cairo.jl#L625,
Hello colleague,
On Tuesday, September 13, 2016 at 7:25:38 PM UTC+2, Yichao Yu wrote:
>
>
> On Tue, Sep 13, 2016 at 12:49 PM, Andreas Lobinger > wrote:
>
>> Hello colleagues,
>>
>> i'm trying to find out, why this
>> ...
>>
> fails miserabl
p: 0x7f00077c4c92)
fails miserably. I guess, but cannot track it down right now: There is
something wrong in memory management of Cairo.jl that only shows up for
objects that could have been freed long ago and julia and libcairo have
different concepts of invalidation.
Any blog/receipe/issue that deals with GC debugging?
Wishing a happy day,
Andreas
r comparison.
>
> On 10 Sep 2016, at 2:34 AM, Andreas Noack
> wrote:
>
> Try to time it again with threading disabled. Sometimes the
> threading heuristics can cause unintuitive performance.
>
> On Friday, September 9, 2016 at 6:39:13 AM UTC-4, Sheehan Olver wrote:
>>
&g
It would be helpful if you could provide a self-contained example. Also,
would it be possible to try out the release candidate for 0.5. We have made
a few changes to the ARPACK wrappers so it would be useful to know if is
only happening on 0.4. Thanks.
On Saturday, September 10, 2016 at 10:41:2
Try to time it again with threading disabled. Sometimes the
threading heuristics can cause unintuitive performance.
On Friday, September 9, 2016 at 6:39:13 AM UTC-4, Sheehan Olver wrote:
>
>
> I have the following code that is part of a Householder routine, where
> j::Int64,
> N::Int64, R.cols:
My memory is too short. I just realized that I implemented a generic
pivoted QR last fall so if you try out the prerelease of Julia 0.5 then
you'll be able to compute the pivoted QR of a BigFloat matrix.
On Wednesday, September 7, 2016 at 9:20:12 AM UTC-4, Andreas Noack wrote:
>
We use LAPACK's QR with column pivoting.
See http://www.netlib.org/lapack/lug/node42.html. LAPACK uses blocking for
BLAS3 but that is not necessary for a generic implementation. So it's the
task is just to sort the columns by norm at each step. If you want to try
an implementation you can look
btw:
i'm running this now with the MetServiceDev/Tk.jl (actually only a small
change) only and Winston from master in 0.5-rc3 sucessfully. For
Winston/Gtk there is an Gtk issue opened.
Evan, this is exactly where you should use I, i.e.
m = m + λ*I
The reason is that eye(m) will first allocate a dense matrix of size(m,1)^2
elements. Then * will do size(m,1)^2 multiplications of lambda and allocate
a new size(m,1)^2 matrix for the result. Finally, size(m,1)^2 additions
will be co
Julia is developing over time. Originally, eye was probably implemented to
mimic Matlab. Later we realized that the type system allowed us to define
the much nicer UniformScaling which has the special case
const I = UniformScaling(1)
which is almost alway better to use unless you plan to modify s
We could deprecate eye. Then the users would get a warning directing them
to use `I` instead.
On Mon, Aug 29, 2016 at 6:29 AM, Júlio Hoffimann
wrote:
> I still think that having a "global variable" named "I" is not robust.
> I've read so many scripts in matlab that do I = eye(n). This approach i
n Mon, Aug 29, 2016 at 6:17 AM, Júlio Hoffimann
wrote:
> Hi Andreas,
>
> As a user I would like to write
>
> B = eye(1) * A
>
> and have the performance of
>
> B = A
>
> 90% of the users won't be aware of this 1-character variable "I" defined
&g
No. We are only exposing `cond` but as you can see
in https://github.com/JuliaLang/julia/blob/master/base/linalg/lu.jl#L235 we
are actually getting `rcond` from LAPACK and then calling `inv`. I can see
the usefulness of working with a number in [0,1] instead of [1,inf) but it
seems superfluous
You can also overwrite eye
Could you elaborate on the "90% of the users won't be aware of these
internal details in their day-to-day coding" part? If we ignore the name
for a while, why is `I` not what you want here? It is as efficient as it
can possibly be.
On Sunday, August 28, 2016 at 3:39:
Hello colleague,
On Saturday, August 27, 2016 at 12:04:22 AM UTC+2, K leo wrote:
>
> so that it works with version 0.5.
could you please list/report what errors you get? Do you use Tk or Gtk? I
looked a little bit around yesterday (with Gtk) and it looks like plotting
does work, but not displ
Hello colleague,
On Saturday, August 27, 2016 at 9:20:32 AM UTC+2, Liye zhang wrote:
>
> Julia and its packages are installed using the network at my home. When I
> try to install new package using the network in my company, there are
> errors as mentioned above.
>
> When I update using the netw
https://github.com/stevengj/PyPlot.jl/issues/164
Hello,
On Sunday, August 21, 2016 at 1:16:22 PM UTC+2, Milan Bouchet-Valat wrote:
>
> Le dimanche 21 août 2016 à 01:36 -0700, Andreas Lobinger a écrit :
> > Hello colleagues,
> >
> > i'm trying to use unsafe_wrap from a pointer from an external call
>
code runs correctly (copy to but UInt8 seq.)
A better explaination of the error?
Wishing a happy day,
Andreas
Hello colleague,
On Thursday, August 18, 2016 at 10:47:27 AM UTC+2, Ferran Mazzanti wrote:
>
> Dear all,
>
> looks like lots of messing around with versions had rendered PyPlot
> unusable in 0.4.6 under OSX (at least).
> Now I need to do some work that requires its use so I need to have it up
>
Hello colleague,
On Wednesday, August 17, 2016 at 3:01:37 PM UTC+2, Oliver Schulz wrote:
>
> > unless they just became numbers to index into a global array somewhere
>
> I had assumed that this is basically what Symbols (being interned strings)
> are.
>
I might write something stupid here, but f
Hello colleague,
On Wednesday, August 17, 2016 at 11:12:51 AM UTC+2, Oliver Schulz wrote:
>
> Sure - I was assuming that as Symbol (as an interned string) is basically
> just a pointer. So comparisons are O(1), etc. What I'd like to understand
> is, why can't it be a bitstype? Currently, it's n
Hello colleague,
On Wednesday, August 17, 2016 at 5:10:49 AM UTC+2, Jan Hlavacek wrote:
> On Tuesday, August 16, 2016 at 3:26:44 PM UTC-4, Andreas Lobinger wrote:
>>
>>
>> Looks like the local julia installation has identified a missing package
>> repository and then
Hello colleague,
On Tuesday, August 16, 2016 at 5:41:47 PM UTC+2, Jan Hlavacek wrote:
>
> They have recently installed a whole bunch of packages system wide, so
> that they are available in all projects without having to install them
> locally. However, when I try to use a package from one of t
Hello colleague,
On Saturday, August 13, 2016 at 6:38:31 PM UTC+2, Steven G. Johnson wrote:
>
>
> On Friday, August 12, 2016 at 2:45:12 AM UTC-4, Andreas Lobinger wrote:
>
> can someone please point me to some (more) documentation/packages about
>> handling tre
Hello colleague,
looks like a problem with Requires and maybe was caused by some missing
'other' update.
The CI shows Plotly working:
http://pkg.julialang.org/logs/Plotly_0.5.log
You could check, if all required packages are at the correct version.
Wishing a happy day,
Andreas
y day,
Andreas
There is a memory allocation(?) bug in 0.5.0-rc1+0, recommendation is to go
to rc1+1.
On Wednesday, August 10, 2016 at 12:04:36 PM UTC+2, Tamas Papp wrote:
>
> Thanks. Forgot to say that I am using v"0.5.0-rc1+0".
>
>
Hello colleague,
On Wednesday, August 10, 2016 at 10:11:46 AM UTC+2, Tomas Lycken wrote:
>
> Both instances of Julia are runnable, so I don’t think I deleted something
> I shouldn’t have in either folder.
>
> What has changed to make Julia 0.5 so big? Are there any build artifacts I
> can/shoul
Hello,
we somehow have similar problem (not in julia, but matlab). One idea is to
have a long (624 32-bit int) (random) number available and multiply by the
single seed. Or get /dev/random for seeding and store it along the output.
ntry like
> this in Compat.jl.
>
> On Sunday, August 7, 2016 at 10:02:44 PM UTC+2, Andreas Noack wrote:
>>
>> It would be great with an entry for this in Compat.jl, e.g. something like
>>
>> cholfact(A::HermOrSym, args...) = cholfact(A.data, A.uplo, args...)
>>
It would be great with an entry for this in Compat.jl, e.g. something like
cholfact(A::HermOrSym, args...) = cholfact(A.data, A.uplo, args...)
On Sun, Aug 7, 2016 at 2:44 PM, Chris <7hunderstr...@gmail.com> wrote:
> mmh, could you explain your comment a little more?
>
> David, thanks for the tip
>>>
>>> Actually: I'm not sure we should chalk the error up to ARPACK. Julia 0.4
>>> is able to produce a (correct, I think) answer to
>>>
>>> eigs(A, C)
>>>
>>> but 0.5 gives an ARPACK error. I don't suppose ARPACK chang
ut 0.5 gives an ARPACK error. I don't suppose ARPACK changed between
>> Julia versions...!?
>>
>> On Sat, Aug 6, 2016 at 1:54 AM, Madeleine Udell
>> wrote:
>>
>>> Andreas, thanks for the investigation. I'll use 0.5 for now, and hope
>>&g
sure we should chalk the error up to ARPACK. Julia 0.4
> is able to produce a (correct, I think) answer to
>
> eigs(A, C)
>
> but 0.5 gives an ARPACK error. I don't suppose ARPACK changed between
> Julia versions...!?
>
> On Sat, Aug 6, 2016 at 1:54 AM, Made
I've looked a bit into this. I believe there is a bug in the Julia wrappers
on 0.4. The good news is that the bug appears to be fixed on 0.5. The bad
news is the ARPACK seems to have a hard time with the problem. I get
julia> eigs(A,C,nev = 1, which = :LR)[1]
ERROR: Base.LinAlg.ARPACKException("
Yes. We are stricter now. LAPACK doesn't check for symmetry at all which we
used to mimic. It might seem pedantic but it will capture programming
errors and it is more in line with how check things elsewhere and it's in
line with the behavior for the sparse Cholesky. For now, you'd need to use
So do i understand correctly that the current win64 build doesn't include
git/ssh via proxy? Or is just the setting in (where?) missing? Is there a
counterpart to the https-insteadof-git setting available?
I know it's not helpful, but i get (behind a company http/https proxy) the
same error with
My first reaction was: Just go forward and do it. Then i started to read
the comments in
https://internals.rust-lang.org/t/proposal-the-rust-platform/3745/35
Hello colleague,
On Friday, July 29, 2016 at 8:59:36 AM UTC+2, Juan Lopez wrote:
>
> Hello,
>
> I have a function which is doing basically an operation inside a loop and
> when adding @simd or @inbounds time doesn't improve, in any case it seems
> slightly worse.
>
> Is there an explanation f
On Thursday, July 28, 2016 at 4:37:24 PM UTC+2, Uwe Fechner wrote:
>
> The following command fixed the problem:
> sudo apt-get install libssl-dev
>
> Perhaps this command could be mentioned in the section "Ubuntu" of
> Readme.md
>
it actually is, in section Required Build Tools and External L
As the error message relates to a missing OpenSSL ->
try to find setttings for: OPENSSL_LIBRARIES OPENSSL_INCLUDE_DIR, it might
be an idea to install the openSSL development package.
Hello colleague,
On Tuesday, July 26, 2016 at 5:58:28 PM UTC+2, Stefan Karpinski wrote:
>
> On Mon, Jul 25, 2016 at 1:23 PM, Stefan Karpinski > wrote:
>
>> Compat.jl does this extensively with respect to Julia itself.
>
>
> Another example, just submitted to BinDeps:
>
> https://github.com/JuliaL
Hello colleagues,
On Monday, July 25, 2016 at 4:40:10 PM UTC+2, Stefan Karpinski wrote:
>
> The difference between the Julia package ecosystem and DLL hell is that
> DLLs expose static interfaces and cannot adapt to their environment. If
> libA.dll expects on interface from libC.dll and libB.dll
The UpperTriangular and LinAlg.UnitLowerTriangular parts are not necessary.
Julia will detect that but since we already know that they are triangular
we can save the costs of the checks.
A_ldiv_B!(A,b) is indeed ugly. It's just A\b where the result is stored in
b. That is useful here because it wi
A couple of things go wrong here. Right now, Julia tries to use the QR
factorization to solve underdetermined systems. If things had worked the
way I'd planned, your matrix would have been promoted to floating point
elements (I know that it's not what you want so keep reading). The
promotion fa
just my two cents...
On Tuesday, July 12, 2016 at 5:28:24 AM UTC+2, Chris Rackauckas wrote:
>
>
> MATLAB really improved their JIT in 2015b, but as you can see, it cannot
> come close to Julia. The main reason is that, although it can do quite a
> bit because it ensures type stability, it has ty
On Monday, July 11, 2016 at 6:38:13 PM UTC+2, Sisyphuss wrote:
>
> It's surprising to see Python so slow and Matlab so fast.
>
> Matlab: does the JIT compiler translate the loops to C?
>
Not to C, rather directly to machine code. LLVM seems to be in use here,
also.
2 small things:
* a more recent Matlab should already be faster, especially in this loop
thing
* random generators' runtime -depending on the complexity they spend-
really makes a difference.
The for Cholesky and sparse LDLt there are methods for reusing an existing
symbolic factorization. They are cholfact!/ldltfact!(Factorization,Matrix)
so you can e.g. do
```
julia> A = sprandn(100,100,0.1) + 10I;
julia> F = cholfact(Symmetric(A));
julia> cholfact!(F, Symmetric(A - I));
```
ons and (still) Winston. I just tested Plots.jl
with GR backend and could plot 5e6 random lines. Maybe you look into this.
Wishing a happy day,
Andreas
i ran a Pkg.update()
and today with a Pkg.update i'm asked for githup username and passwd?
Any idea?
Wishing a happy day,
Andreas
We could consider not to throw in cholfact but only when the factorization
is applied. This is what we do for LU and BunchKaufman.
On Saturday, June 11, 2016 at 5:02:55 PM UTC-4, Tony Kelman wrote:
>
> For now, you can just manually make the same cholmod calls that cholfact
> does, then use the
To start with the conclusion, the easiest solution here is to use the
lufact, i.e. lufact(sparse(A))\ones(3). The explanation is that when a
sparse matrix is symmetric, we first try to use a sparse Cholesky
factorization and when that fails we try a sparse LDLt factorization. Both
use Cholmod,
Hello colleague,
i ran (twice) into a problem that looked similar by the symtoms. In both
cases the git configuration of METADATA were corrupted and in the recent
case the remote setting was somehow routed to the Package name. -> Look in
.julia/v0.4/METADATA/.git/config. If you see your Package
Yes. The way out Ls are constructed will ensure that it has 1s in the
diagonal.
On Tuesday, June 7, 2016 at 6:20:26 PM UTC-4, Gabriel Goh wrote:
>
> A simple question as posed in the title, this is guaranteed by LAPACK
>
> The factorization has the form
> A = P * L * U
> where
For clarification, i'm using now
git config --global url."https://@".insteadOf git://
so including my github name for even anonymous access.
Works somehow.
talls METADATA afaics.
However, trying Pkg.add fails with
INFO: Cloning cache of Compat from git://github.com/JuliaLang/Compat.jl.git
fatal: unable to access 'https://github.com//JuliaLang/Compat.jl.git' : The
requested URL returned error: 400
Any idea?
Wishing a happy day,
Andreas
On Wednesday, June 1, 2016 at 8:49:44 PM UTC+2, Ford Ox wrote:
>
> When we are on this topic
>
> Why does
> [1 + 2]
> result in
> [3]
> instead of
> [1 + 2]
>
>
well, in v0.5 with the correct element limiter
_
_ _ _(_)_ | A fresh approach to technical computing
(_)
It's valid and interesting to measure full roundtrip including compile time
like you do, however in examples like this, the julia overhead on compiling
dominates your measurement.
You could put your code into a package and pre-compile.
In any case your not measuring the time to run the code onl
On Wednesday, June 1, 2016 at 11:30:01 AM UTC+2, Lutfullah Tomak wrote:
>
> Do what the warning says. Replace ',' with ';', meaning ["8"; 9; 10; c] or
> ["8"; 9;10; [12; "c"]]
>
julia> b = ["8";9;10;[12;"c"]]
5-element Array{Any,1}:
"8"
9
10
12
"c"
I'd like to have b[4] = [12;"c"]
Hello colleagues,
i actually was a little bit puzzled by this:
_
_ _ _(_)_ | A fresh approach to technical computing
(_) | (_) (_)| Documentation: http://docs.julialang.org
_ _ _| |_ __ _ | Type "?help" for help.
| | | | | | |/ _` | |
| | |_|
On Wednesday, June 1, 2016 at 10:44:42 AM UTC+2, Henri Girard wrote:
>
> Gadfly is deprecated : Does it mean we shouldn't use it anymore ?
>
Where did you get the message that Gadlfy is deprecated?
If you mean, you get a lot of deprecation warning, when trying to run
Gadfly on julia v0.5dev, y
Discuss ideas here or over there at julia-dev.
Development work will happen in https://github.com/JuliaLang/julia
http://docs.julialang.org/en/release-0.4/ contains a part developer
documentation.
Hello colleagues,
thanks for all answers. And now the punchline: How do i find this in the
documentation?
Wishing a happy day,
Andreas
Stefan Karpinski wrote:
>
> Since Julia 0.4 [] is what you're looking for.
>
> On Tue, May 24, 2016 at 1:06 PM, Andreas Lobinger > wrote:
>
>> Hello colleagues,
>>
>> it really feels strange to ask this, but what is the julia equivalent of
>> python'
here)
Wishing a happy day,
Andreas
Example? (i had today some intermediate github problems with connectivity
and functions)
On Monday, May 23, 2016 at 7:06:44 PM UTC+2, Cedric St-Jean wrote:
>
> I'm up to my 15th pull request or so, and almost every time I do
> Pkg.submit("PackageName"), the opened webpage is missing the green "C
ot_xy += x[i]*y[i]
> end
> b1 = (tot_xy - mx*tot_y)/tot_dx # a 1\n cancels in the top and bottom
> b0 = tot_y/n - b1*mx
> return [b0, b1]
> end
>
> If anyone has any comments on what could be made better.
>
> Thanks,
> Gabriel
>
> On Monday, May 2
return [b0, b1]
> end
>
> Which I find speeds up around 3x, or do you mean writing a custom cov
> function that is smarter about memory? (I am returning an array as I like
> to be able to do vector math on the coefficients ... but if I return a
> tuple it isn't much faster fo
On Sunday, May 22, 2016 at 11:06:49 PM UTC+2, Tony Kelman wrote:
>
> URLs in metadata need to be manually updated when repos are moved. It
> doesn't need to be done right away because github puts in place a redirect,
> but that redirect can be interfered with.
>
> What problems did you have with
I don't think that linreg has received much attention over the years. Most
often it is almost as simple to use \. It you take a look at linreg then
I'd suggest that you try to write in terms of cov and var and return a
tuple instead of an Array. That will speed up the computation already now
an
,
Andreas
seems now to be following the
even-if-you-dont-want-to-be-our-user-you-need-to-handover-a-lot-of-data-to-us
rule.
Any idea?
Wishing a happy day,
Andreas
The Hackathon on Saturday is quite flexible so if somebody volunteers to
organize such session then I'm sure we can make it happen. There should be
people around that are knowledgeable about the topics.
On Tuesday, May 17, 2016 at 10:26:00 AM UTC-4, Josef Sachs wrote:
>
> Will there be any organ
I think there'll necessarily be some overhead in the decompression of the
packed Booleans in a BitArray. The difference between Bool and Int8 is that
the Int8 is promoted to a Float64 whereas a Bool is not. It appears that
the Bool multiplication
in
https://github.com/JuliaLang/julia/blob/a717
...) doesn't work, you could raise a concrete issue on
github - there you get more audience with julia internal know-how.
Wishing a happy day,
Andreas
On Friday, May 6, 2016 at 8:51:47 AM UTC+2, Ján Adamčák wrote:
>
> Nobody???
>
> Dňa pondelok, 2. mája 2016 11:30:11
Hello colleague,
how did you set the correct dimensions?
On Tuesday, May 3, 2016 at 10:53:59 AM UTC+2, Christoph Ortner wrote:
>
> If I create a context using `compose`, and then call `display(ctx)`, then
> I end up with an image that looks roughly right but doesn't have the
> correct dimensio
These are Glib or Gtk warnings and in the first entry you see, which
program/process caused them. Strange is, that you get them in your julia
REPL. I see similar warnings in the terminals, where i started e.g. firefox.
On Tuesday, April 26, 2016 at 4:06:09 AM UTC+2, K leo wrote:
>
> Plots work,
Hello colleagues,
i learned this is triggered manually and not regularly, however looking at
the webpage updates of 7 or 14 days are mentioned.
Wishing a happy day,
Andreas
Thank you for all answers.
I remembered, that i saw something in the documentation, but i rather
suspected it in Control Flow.
Actually the foo(a,b,c) do x notation i also see as benefit. The foo(a,b,c)
do without argument is leading to the 'wrong' assumptions, code would look
clearer without.
While it's obviously some kind of
implicit loop, what is the loop index or subject?
Wishing a happy day,
Andreas
On Friday, April 15, 2016 at 6:35:15 PM UTC+2, Christoph Ortner wrote:
>
> many tanks for this - that looks perfect.
>
> unfortunately my Gtk installation seems broken, so it will be a while
> until I can try this out.
>
_
_ _ _(_)_ | A fresh approach to technical
Hello colleague,
On Friday, April 15, 2016 at 6:30:51 PM UTC+2, Christoph Ortner wrote:
>
> right I mean b) - I have 1000, say, line segments or polygons, each with
> the same number of points. All I can do is loop, yes?
>
> Thanks,
> Christoph
>
>
>
> you are saying this is currently not implem
Hello colleague,
On Friday, April 15, 2016 at 5:17:29 PM UTC+2, Christoph Ortner wrote:
>
> I understand from the example
> how to vectorise drawing of circles.
>
> The syntax for a two-point line segment seems to beline( [(x0, y0),
> (x1, y1)] ) I don't see an analogy with `circle`?
>
> Bu
1 - 100 of 758 matches
Mail list logo
