I wrote a range limited isa_leapyear(year) good in 1800..2200.
Your look is appreciated; I do not understand this:
The first version runs 50x more slowly than the second version.
The first is better practice, is there a way to make it behave?
They differ only in placing the bit table (local vs
Thanks to all.
On Friday, July 3, 2015 at 8:21:53 AM UTC-4, Jeffrey Sarnoff wrote:
I wrote a range limited isa_leapyear(year) good in 1800..2200.
Your look is appreciated; I do not understand this:
The first version runs 50x more slowly than the second version.
The first is better practice
After reviewing prior relevant topics, it is unclear that there is a
recommended way to work from within julia with multiple files compressed as
one.
I have ~1500 very small files (text now, could be .jld) that are best
combined into 2-4 compressed aggregates. Usually, I need to retrieve just
Quiet NaNs (QNaNs) were introduced into the Floating Point Standard as a
tool for applied numerical work. That's why there are so many of them
(Float64s have nearly 2^52 of them, Float32s have nearly 2^23 and Float16s
have nearly 2^10 QNaNs). AFAIK Julia and most other languages use one or
Quiet NaNs (QNaNs) were introduced into the Floating Point Standard as a
tool for applied numerical work. That's why there are so many of them
(Float64s have nearly 2^52 of them, Float32s have nearly 2^23 and Float16s
have nearly 2^10 QNaNs). AFAIK Julia and most other languages use one or
16, 2015 at 2:16:39 PM UTC-4, Jeffrey Sarnoff wrote:
I have immediate use for this. Thanks. Please follow Tony's advice, so I
can keep up to date with any modifications.
On Saturday, August 15, 2015 at 8:13:57 PM UTC-4, vav...@uwaterloo.ca
wrote:
I wrote a short macro for Julia 0.4
I have immediate use for this. Thanks. Please follow Tony's advice, so I
can keep up to date with any modifications.
On Saturday, August 15, 2015 at 8:13:57 PM UTC-4, vav...@uwaterloo.ca wrote:
I wrote a short macro for Julia 0.4 to generate fixed-length tuples using
comprehension-like
I have two suggestions:
Change the pale colors to something less pale. I am not critical of your
aesthetic, just pragmatic.
Generally, printing on white with more saturated, deeper rather than
lighter colors is more readable.
Also try to avoid pure yellows and pure reds, they are difficult
Or, what is a good approach to saving and reloading Int128s .. -x .. +x?
I'm always available to advocate for consonant symmetry and autodydactic
expressiveness on Julia's behalf. The consensual upwelling that let the
broader decision deserves respect. That motive intent was to finalize one
important tailoring of Julia's experience -- the experiences we each have.
there in the original HDF5 repository.
I don't remember the status of this at all. I hate to say it, but why
don't
you just try it out and see if it works? If not, please file an issue---
shouldn't be hard to fix.
--Tim
On Wednesday, August 19, 2015 12:37:32 PM Jeffrey Sarnoff wrote:
I saw a note
It works
On Wednesday, August 19, 2015 at 4:44:51 PM UTC-4, Jeffrey Sarnoff wrote:
I can do that. If it goes south, I note the issue. You showed me how to
use it the first time, Thanks TIm.
On Wednesday, August 19, 2015 at 4:20:22 PM UTC-4, Tim Holy wrote:
They were split, but google
+1 respellings and renamings that follow from this thread
If you know, please provide us with those words/names/symbols in v0.4 today
that have capitalizations, spellings, or patternings that are inconsistent
with the way very similar role/intent/use/purpose is expressed in better
reviewed,
you created R to hold 600 things, things indexable as R[1]..R[600]
mnths=600
R=zeros(Float64,mnths)
later you bring Julia's attention to R[600+1], just one step 'out of bounds'
when i is 600, i+1 is 601
In Julia, the top part of the range is included
That loop should be
for i in 3:(600-1)
any chance putting in 'Symbol' with a preferred use warning to (depr..)
'symbol'?
On Thursday, August 20, 2015 at 11:21:41 AM UTC-4, Stefan Karpinski wrote:
Yes. In old languages, there's no longer any hope of fixing the
inconsistencies.
On Thursday, August 20, 2015, Sisyphuss
:
Thank you Jeff.
On Friday, August 21, 2015 at 3:51:41 PM UTC-5, Jeffrey Sarnoff wrote:
you created R to hold 600 things, things indexable as R[1]..R[600]
mnths=600
R=zeros(Float64,mnths)
later you bring Julia's attention to R[600+1], just one step 'out of
bounds'
when i is 600, i+1 is 601
Calling error(message) should report an error from the function in which
it is called, and it would be helpful to show the call chain. Currently,
calling error reports an error from the top of the call chain, the function
generating the error is not shown. Throwing an exception is either
Thank you Curtis.
On Saturday, August 22, 2015 at 2:03:20 PM UTC-4, Eric Davies wrote:
Here they are! https://github.com/quinnj/TimeZones.jl
IMO it's better than pytz, which is exciting.
All credit goes to Curtis Vogt @omus.
Scott makes a good point. Thank you Jacob.
On Sun, Aug 23, 2015 at 6:33 AM, Scott Jones scott.paul.jo...@gmail.com
wrote:
I like ask the things that Jacob is working on for Julia, really important
stuff for general programming, this, strings, databases, CSV, etc.
+100
I agree. There may be some help from one of the pkgs listed, in case you
missed either
(at least one needs updating to work v0.4, I don't know about v0.3)
JuliaAstro https://github.com/JuliaAstro svaksha-Astronomy
https://github.com/svaksha/Julia.jl/blob/master/Astronomy.md
On Sunday, August
not throw -- raise
On Sun, Aug 16, 2015 at 2:59 PM, Jeffrey Sarnoff jeffrey.sarn...@gmail.com
wrote:
Writing customized exception, I want to include the name of a var used as
an argument in the caller of the function generating the exception.
I saw similiar access from a function once, and am
Writing customized exception, I want to include the name of a var used as
an argument in the caller of the function generating the exception.
I saw similiar access from a function once, and am unable to re-locate
that. thanks.
function caller(potato::Int)
called(potato)
end
function
Table driven implementation, so the logic is easily changed to suit.
Introduces (afaik) two operators that push Maybe to True, False
respectively.
https://github.com/J-Sarnoff/ThreeValued.jl
On Sunday, August 23, 2015 at 10:14:11 PM UTC-4, Jeffrey Sarnoff wrote:
Table driven implementation, so the logic is easily changed to suit.
Introduces (afaik) two operators that push Maybe to True, False
respectively.
fixed, thank you
On Thursday, July 23, 2015 at 6:45:11 PM UTC-4, Jeffrey Sarnoff wrote:
The Fix (recommended to us by a reliable google groups contributor):
There is an Bug that is causing that they can disable the tags till they
get the Tags bug fixed.
On Thursday, July 23, 2015 at 6
otoh I have no knowledge of the way of the Wiki
On Sat, Aug 1, 2015 at 12:14 PM, Jeffrey Sarnoff jeffrey.sarn...@gmail.com
wrote:
Yes, the second -- I agree on the import of unbaised content, and this
thread is that.
On Sat, Aug 1, 2015 at 12:04 PM, Waldir Pimenta waldir.pime...@gmail.com
, which can be cited
down to the page number. Or were you suggesting this as evidence of
significant interest in the concept from an implementation perspective / an
independent community?
On Saturday, August 1, 2015 at 4:37:41 PM UTC+1, Jeffrey Sarnoff wrote:
If (and only if) appropriate
If (and only if) appropriate to Wikipedia guidelines / practice, I suggest
including reference to this thread in the revision of a page to resubmit
for Wikipedia.
On Fri, Jul 31, 2015 at 9:49 PM, Waldir Pimenta waldir.pime...@gmail.com
wrote:
The Wikipedia article was redirected quite recently
, 2015 at 5:00:15 PM UTC-4, Jason Riedy wrote:
And Jeffrey Sarnoff writes:
IEEE 754-2008 makes it clear that QNaN payload values are fare game:
(is says details of NaN propagtion may have vender differences, and)
Having been in the room at the time of utter despair... (And
admittedly
The correct function definition should be
julia f{T : Furniture}(::Type{T}) = 10
On Monday, August 3, 2015 at 4:44:31 PM UTC-7, Jeffrey Sarnoff wrote:
would you mind updating this, I just ran it and did not know how to
change {T : Furnature} to Use Any[a,b, ..] instead, thank you
would you mind updating this, I just ran it and did not know how to
change {T : Furnature} to Use Any[a,b, ..] instead, thank you
julia abstract Furnature
julia type Table : Furnature
end
julia f({T : Furnature})(::Type{T}) = 10
WARNING: deprecated syntax {a,b, ...}.
Use Any[a,b,
If you accept that an Int8 is a narrower integer type than Int32|64 and
that the two Int8 operands to an addition, subtraction, multiplication,
are promoted to Ints before the operation occurs To minimize the
practical impact of this overflow, It is hard to argue that they have
first been
(cont.)
after reading that, I did not expect this:
```julia
julia a=typemax(Int8)+typemax(Int8)
-2
julia a=typemax(Int8)*typemax(Int8)
1
julia a=typemin(Int8)-typemax(Int8)
1
```
```
On Monday, August 3, 2015 at 7:42:03 PM UTC-4, Sisyphuss wrote:
integer addition...
Zenna, I had been wondering if there might be something in the tiling
nature that makes unums particularly well suited to solving problems posed
on higher dimensional surfaces?
On Friday, July 31, 2015 at 3:54:29 PM UTC-4, Zenna Tavares wrote:
The quick explanation for why unums/ubounds
What would be the first problem you address with this made hardware?
On Friday, July 31, 2015 at 3:39:01 PM UTC-4, John Gustafson wrote:
I discuss this in the book; there have to be strict bounds on how long a
computation remains in the *g*-layer (fused) or people would dump their
entire
estimation, with instructable, or at least disciplined and
non-contrarian NaN propogators.
On Monday, August 3, 2015 at 3:58:37 PM UTC-4, Jeffrey Sarnoff wrote:
Jason,
If the software or circuitry is IEEE 758-2008 compliant, all those quiet
NaNs are usable. Most vendors select one or two
expressed an abiding regard for the efficacy and
utillity of quiet NaNs as a numerical software engineers' participatory
tool. That's what prompted me to to write the module.
Thank you both for the thoughts.
On Monday, August 3, 2015 at 12:56:57 PM UTC-4, Jason Riedy wrote:
And Jeffrey
If correct rounding is a goal:
For almost all Float64 arguments to elementary functions, working with
120bit significands will assure an accurately rounded result almost always
and working with 168bit significand obtains a correctly rounded Float64
value all the time (at least for the
+1 for grain of salt
On Saturday, July 25, 2015 at 9:11:54 AM UTC-4, Job van der Zwan wrote:
So I came across the concept of UNUMs on the Pony language mailing list
http://lists.ponylang.org/pipermail/ponydev/2015-July/71.html this
morning. I hadn't heard of them before, and a quick
It has been my experience that, with an appropriate choice of data
structure and straightforward lines of code, Julia is better.
The Julia realization will be fast enough .. for the operations you need
2x-3x C, once the loop executes, and it is much less
hassle, and easier to maintain. There
a few in the same micro, hundreds in the same milli... Why
would this matter?
c) integer is much preferred
Where is the implementation? I'm curious to check out your progress.
On Aug 10, 2015, at 10:45 PM, Jeffrey Sarnoff jeffrey...@gmail.com
javascript: wrote:
timestamp questions
ζ testing is welcome next Thursday -- before then, the location is in
flux.
I will be available to remedy any hiccups then and through that weekend.
On Tuesday, August 11, 2015 at 10:09:00 AM UTC-4, Jeffrey Sarnoff wrote:
regarding (a) .. it does not matter to me. It matters to people
moving the use of AbstractString from the types of the arguments to become
a type parameter fixes baz
changing AbstractString to ASCIIString without moving anything also works
zab{T:AbstractString}(a::Vector{Tuple{T,T}}) = 4
zab(a::AbstractString) = zab([(a,a)])
zab(a)
4
timestamp questions for Tom:
(a) is the most refined temporal resolution of your timestamps
milliseconds (1/1_000 seconds)?
(b) do you ever get multiple items that have identical timestamps? (If so,
what is the most you have seen.)
(c) do you want your timestamp to be an integer (best), a
:46 PM UTC-4, Sisyphuss wrote:
@Jeffrey, I don't quite get your idea. You agree with me?
From your example, the document has claimed something it hasn't done?
On Tuesday, August 4, 2015 at 5:34:51 AM UTC+2, Jeffrey Sarnoff wrote:
(cont.)
after reading that, I did not expect
something it hasn't done?
On Tuesday, August 4, 2015 at 5:34:51 AM UTC+2, Jeffrey Sarnoff wrote:
(cont.)
after reading that, I did not expect this:
```julia
julia a=typemax(Int8)+typemax(Int8)
-2
julia a=typemax(Int8)*typemax(Int8)
1
julia a=typemin(Int8)-typemax(Int8)
1
Was this unrolling the example you gave that looped four times? Would it
be correct to assume that the relative advantage is highly dependant upon
loop repetitions?
On Sunday, August 9, 2015 at 1:45:13 PM UTC-4, Tero Frondelius wrote:
It seems that the package runtests.jl will give you the
for machine learning, look at https://github.com/JuliaStats/MLBase.jl and
the entry for Julia at
https://github.com/josephmisiti/awesome-machine-learning
generally, try the search field at http://pkg.julialang.org/ (going
forward, you may be happier with v0.4 -- note this is a selection on
for machine learning, look at https://github.com/JuliaStats/MLBase.jl and
the entry for Julia at
https://github.com/josephmisiti/awesome-machine-learning
generally, try the search field at http://pkg.julialang.org/ (going
forward, you may be happier with v0.4 -- note this is a selection on that
longer
function form significant in terms of performance. That would encourage
people writing awkwardly long one-liners for all the wrong reasons.
On Mon, Aug 10, 2015 at 1:01 AM, Jeffrey Sarnoff
jeffrey.sarn...@gmail.com wrote:
Is there a reason to add @inline to functions that are defined
Hi Tom,
I am writing you a timestamp function now.
(a) is the most refined temporal resolution of your timestamps
milliseconds (1/1_000 seconds)?
(b) do you ever get multiple items that have identical timestamps? (If so,
what is the most you have seen.)
(c) do you want your timestamp to be an
if you want to do this, yes:
julia a=Dict(A=1, B=2)
Dict{ASCIIString,Int64} with 2 entries:
B = 2
A = 1
julia around_a=Dict(A=3, B=a)
Dict{ASCIIString,Any} with 2 entries:
B = Dict(B=2,A=1)
A = 3
julia if (around_a[B][A] == 1)
delete!(around_a[B],A);
end
julia
Dates.Hour, .. Dates.Millisecond what to put their parens around DateTime
entities only.
Dates.Year. .. Dates.Day are more open-minded, enparenning DateTime or Date
entities.
take 'em for a spin like this:
Dates.Hour(time_series[2]) - Dates.Hour(time_series[1])
Here's to a Good Evening
Ben, much as I would like there to be a second kind of typealias, *typealiased
-- *that let us work with the renanamings wiithout risk to the objects of
the type originally aliased -- this is not on the radar now. It is hard to
peel off enough to form the CIGAR when the role of typealias is to
.
--- You want time differences to just work so you can do the same.
I agree.
On Saturday, August 15, 2015 at 2:46:04 AM UTC-4, Jeffrey Sarnoff wrote:
Ian --
I can imagine a long-winded solution where the relevant time units are
extracted and differenced, but I was hoping for simpler
On Saturday, August 15, 2015 at 5:59:36 AM UTC-4, Kaj Wiik wrote:
You can get Int64 value by duration.value and convert 'by hand' from
there. A possibility to convert from Millisecond to DateTime would be
nice...
There should be
durationAB = DateTimeB - DateTimeA
a more fully
helpful example).
On Saturday, August 15, 2015 at 2:21:04 AM UTC-4, Jeffrey Sarnoff wrote:
well that's accurate -- I was not trying to make them nefarious, I mistook
the emphasis.
I will come back with a more fully driveable example in about 15mins.
On Friday, August 14
+1 for your clean-up (understated and well-articulated)
On Friday, August 14, 2015 at 4:20:09 PM UTC-4, Jarrett Revels wrote:
Hi!
ForwardDiff.jl https://github.com/JuliaDiff/ForwardDiff.jl, a Julia
package for performing automatic differentiation, has just been updated and
is now much
well that's accurate -- I was not trying to make them nefarious, I mistook
the emphasis.
I will come back with a more fully driveable example in about 15mins.
On Friday, August 14, 2015 at 7:41:04 PM UTC-4, Ian Butterworth wrote:
Trying to get the number of hours between these two dates
like we
discussed would be good if possible.
On Saturday, 15 August 2015 06:16:09 UTC-4, Jeffrey Sarnoff wrote:
What would like two lines of code to do with durations?
On Friday, August 14, 2015 at 7:41:04 PM UTC-4, Ian Butterworth wrote:
Trying to get the number of hours between these two
A better perspective is that before seeing Stefan's help -- your approach
to writing baz was somewhat inartful -- nothing wrong with that.
Your function accepts a vector of 2-Tuples where each tupled element is
e.g. an ASCII string, a Unicode string or a UTF16 symbol.
You described the
I can save you some time, if you allow .. at present and forward more years
than you expect, there is no better nor any roughly as good.
On Wednesday, August 12, 2015 at 7:34:09 AM UTC-4, Páll Haraldsson wrote:
On Wednesday, August 5, 2015 at 5:33:59 PM UTC, David Gold wrote:
I've been
here is an example of reinterpreting a subarray in v0.4:
```julia
julia a=Int8[1,2,3,4]
4-element Array{Int8,1}:
1
2
3
4
julia b=reinterpret(Uint8,a)
4-element Array{UInt8,1}:
0x01
0x02
0x03
0x04
julia b=reinterpret(Uint8,a[2:3])
2-element Array{UInt8,1}:
0x02
0x03
```
On Sunday,
(mistyped -- here is the msg)
Just to clarify, your note is about subarrays per se.
Here is an example of reinterpreting a subselected vector in v0.4.
It is the use of `sub` in this context that generates an error:
julia a=Int8[1,2,3,4];print(a)
Int8[1,2,3,4]
julia
/issues/12446
I'd like to learn more about it.
On Monday, August 3, 2015 at 4:33:02 PM UTC+2, Stuart Brorson wrote:
On Sun, 2 Aug 2015, Jeffrey Sarnoff wrote:
Quiet NaNs (QNaNs) were introduced into the Floating Point Standard as
a
tool for applied numerical work. That's why
thank you for the information
On Sunday, August 9, 2015 at 11:13:24 PM UTC-4, Yichao Yu wrote:
On Sun, Aug 9, 2015 at 11:08 PM, Jeffrey Sarnoff
jeffrey...@gmail.com javascript: wrote:
here is an example of reinterpreting a subarray in v0.4:
```julia
julia a=Int8[1,2,3,4]
4
Is there a reason to add @inline to functions that are defined using the
form fn(x) = do_fn(x), or is it redundant in v0.4?
If it is safe and would not slow down everything, I would like to put
something in .juliarc that would show Arrays in the REPL using showcompact
rather than the default display().
, the return type would become Union(Int16,Int32).
Does that carry performance implications?
Regards
On Wednesday, August 5, 2015 at 10:05:05 AM UTC-4, Milan Bouchet-Valat
wrote:
Le mardi 04 août 2015 à 14:44 -0700, Jeffrey Sarnoff a écrit :
Or, it may be that the docs are behind the design
). An admin probably
needs to prune the tags.
Regards
-
Avik
On Thursday, 23 July 2015 23:02:58 UTC+1, Jeffrey Sarnoff wrote:
I posted a request for help with google, and they responded :
Apparently some action on julia-dev introduced a duplicate tag, a
second tag that differs only
The Fix (recommended to us by a reliable google groups contributor):
There is an Bug that is causing that they can disable the tags till they
get the Tags bug fixed.
On Thursday, July 23, 2015 at 6:13:42 PM UTC-4, Jeffrey Sarnoff wrote:
Regards
On Thursday, July 23, 2015 at 6:10:11 PM UTC
/apps/4pfJ6fdnAwM/RPTkQWSCgkkJ
On Thursday, July 23, 2015 at 5:19:08 PM UTC-4, Avik Sengupta wrote:
Same here.
On Thursday, 23 July 2015 20:45:30 UTC+1, Jeffrey Sarnoff wrote:
?
?
thank you, again
On Sunday, July 26, 2015 at 3:59:01 PM UTC-4, Jameson wrote:
Module import/using paths are always absolute (from Main), unless prefixed
by one (or more) dots. So for this example, try:
using .SubModule
On Sat, Jul 25, 2015 at 10:15 AM Jeffrey Sarnoff jeffrey...@gmail.com
this happend after a general linux update + system revision, Julia was not
involved until after the fact
I have tried deleting all GMP stuff, then putting some back (it did not
help, and I couldnt get rid of it all
without also loosing the linuxmint gui). I just cloned Julia and rebuilt
it
I have a package layed out something like this:
Package
Package.jl
src
file1.jl
submodule.jl
module SubModule
export subThing
end
file2.jl
...use subThing...
Package.jl
include(src/file1.jl)
include(
above should read
Package.jl
module Package
include(src/file1.jl)
include( src/submodule.jl)
using SubModule
include( src/file2.jl ) # needs subThing
end
On Saturday, July 25, 2015 at 9:41:47 AM UTC-4, Jeffrey Sarnoff wrote:
I have a package layed out something
SubModule. I assume that your
src/file2.jl defines the SubModule and when you include it you don't have
to write using SubModule at all. Or I just misunderstood your question.
On Saturday, July 25, 2015 at 4:45:29 PM UTC+3, Jeffrey Sarnoff wrote:
above should read
Package.jl
module
Cleve Moler's discussion is not quite as contextually invariant as are
William Kahan's and James Demmel's.
In fact the numerical analysis community has made an overwhelmingly
strong case that, roughly speaking,
one is substantively better situated where denormalized floating point
values will
Hello Avik. That is fact.
As you knowl, the local offset often is obtainable through calls to C or
C++ Standard libraries.
Unfortunately OSs vary greatly in the care and feeding of flexible and
accurate support for time.
Some OSs may need us to provide portable run-alikes (or not). Is
⟅1⟆ for the 3rd language
On Wednesday, July 15, 2015 at 10:05:59 PM UTC-4, Jeffrey Sarnoff wrote:
+1
On Wednesday, July 15, 2015 at 8:54:37 PM UTC-4, Ismael VC wrote:
You can see the pull request here:
https://github.com/JuliaLang/julialang.github.com/pull/252
Working demo here: http
+1
On Wednesday, July 15, 2015 at 8:54:37 PM UTC-4, Ismael VC wrote:
You can see the pull request here:
https://github.com/JuliaLang/julialang.github.com/pull/252
Working demo here: http://julialanges.github.io
Please let me know what do you think.
With regard to (1), the first place to look is the package homepage on
github. You have to scroll down to see the README.md file displayed.
searching google with, e.g. for gadfly: site:github.com Gadfly.jl (no
quotes) gives up these two urls at top.:
https://github.com/dcjones/Gadfly.jl
just curious, why are the full hashes not compared when least significant
octets match (above)?
On Thursday, July 16, 2015 at 12:25:01 PM UTC-4, Matt Bauman wrote:
On Thursday, July 16, 2015 at 12:19:25 PM UTC-4, milktrader wrote:
Also, back to the OP question, is the correct solution to
Reading docs peppered with red is bit headache inducing for me. Is there
support for a less aggressive color?
it is a fairer test working from a second copy of the data that has been
prescaled(x::Float64) = x * 2.0^64
On Monday, July 13, 2015 at 12:51:33 PM UTC-4, Jeffrey Sarnoff wrote:
Staying with Float64, see if the runtime comes way down when you prescale
the data using prescale(x) = x * 2.0^64
of operations may help.
On Monday, July 13, 2015 at 9:45:59 AM UTC-4, Jeffrey Sarnoff wrote:
Cleve Moler's discussion is not quite as contextually invariant as are
William Kahan's and James Demmel's.
In fact the numerical analysis community has made an overwhelmingly
strong case that, roughly
is a good strategy when the largest of the data values is not large
On Monday, July 13, 2015 at 12:04:32 PM UTC-4, Yichao Yu wrote:
On Mon, Jul 13, 2015 at 11:39 AM, Jeffrey Sarnoff
jeffrey...@gmail.com javascript: wrote:
Thanks for sharing your view about denormal values. I hope what I said
Denormals were made part of the IEEE Floating Point standard after some
very careful numerical analysis showed that accomodating them would
substantively improve the quality of floating point results and this would
lift the quality of all floating point work. Surprising it may be,
nonetheless
and this: Cleve Moler tries to see it your way
Moler on floating point denormals
http://blogs.mathworks.com/cleve/2014/07/21/floating-point-denormals-insignificant-but-controversial-2/
On Monday, July 13, 2015 at 2:11:22 AM UTC-4, Jeffrey Sarnoff wrote:
Denormals were made part of the IEEE
18, 2015 at 7:19:20 AM UTC+10, Jeffrey Sarnoff wrote:
Reading docs peppered with red is bit headache inducing for me. Is
there support for a less aggressive color?
resources at compile-time.
On Sun, Jul 12, 2015 at 1:55 AM Jeffrey Sarnoff jeffrey...@gmail.com
javascript: wrote:
Jameson, in v0.4 is it best not to care about adding a layer of
consolidation that is purely artifact -- If so, well ok and yuk.
Some of these named variables are better
is that these things are going to happen at some point in any
case, at least if I read the discussion re packages correctly.
*From:* julia...@googlegroups.com [mailto:julia...@googlegroups.com] *On
Behalf Of *Jeffrey Sarnoff
*Sent:* Tuesday, July 14, 2015 2:41 AM
*To:* julia...@googlegroups.com
Are you running the function once to let Julia compile it before doing the
timing? Looking at code_lowered() for each shows the assignment happens via
one larger or eight smaller GenSym temporaries. I see the slower of the two
running ~1.5x not 50x the faster.
On Monday, August 24, 2015 at
Thank you -- clearly given.
On Friday, October 23, 2015 at 12:07:07 PM UTC-4, Steven G. Johnson wrote:
>
>
>
> On Friday, October 23, 2015 at 8:37:58 AM UTC-4, Jeffrey Sarnoff wrote:
>>
>> I want to allow users of my Float12x module the choice of faster
or the other pair in the midst of an encompassing and encompassed chain of
function calls?
And allow them to be swapped at runtime with a module level call?
On Friday, October 23, 2015 at 12:07:07 PM UTC-4, Steven G. Johnson wrote:
>
>
>
> On Friday, October 23, 2015 at 8:37:58 AM UT
I want to allow users of my Float12x module the choice of faster or more
precise trig
(at the moment, 103bits over 0..2pi is ~30% faster than 106bits; the
more precise version also handles larger arguments).
The choice needs to be made before the using statement, as it governs the
inclusion
ession does Pkg.build(), (presumably for some other
> package or update), then won't the setting be overwritten with the default
> build setting?
>
> On Fri, Oct 23, 2015 at 12:11 PM, Jeffrey Sarnoff <jeffrey...@gmail.com
> > wrote:
>
>> Thank you -- clearly given.
&
Or have two versions that share almost all of the code. .. appreciate the
feedback, moving on.
On Friday, October 23, 2015 at 1:10:22 PM UTC-4, Jeffrey Sarnoff wrote:
>
> yes -- I suppose choosing one happyesque medium is the way to go at first.
>
> On Friday, October 23, 2015 at
I was thinking about continued fraction evaluation. Your 'misread' was very
informative. I appreciate the detail -- that is very helpful.
On Wednesday, October 21, 2015 at 3:50:52 PM UTC-4, Jeffrey Sarnoff wrote:
>
> good look -- thanks
>
> On Sunday, October 18, 2015 at 9:13:14 PM
1 - 100 of 588 matches
Mail list logo
