In a language with "pointer" types, reference counting cannot work. If you
create a cycle (like a linked list where the last element points to the first
one) you can never reach count 0 for all the objects in the cycle. The only way
to properly manage memory environments where you allow
A META header in the section of the HTML page can force a recurrent
refresh. The first article Google found on the subject is this one:
http://www.htmlgoodies.com/tutorials/getting_started/article.php/3479551 The
article also shows a micro-snippet in JavaScript to obtain a similar effect on
a
https://www.haskell.org/haskellwiki/List_comprehension
On 27 December 2014 at 18:31, Aai agroeneveld...@gmail.com wrote:
Ok, I misinterpreted this enormously (I was just focused on the Haslell
expression you started with). It would be nice if you could illustrate your
last mail with an
Actuary the use of ravel and antibase is common practice to solve
certain problems in APL and isn't considered cheating. So I wouldn't
say it's not nice but I would definitely go for antibase instead of
a combination of floored-divide and modulus. As a bonus, a solution
based on antibase would
Limits for Windows:
http://msdn.microsoft.com/en-us/library/windows/desktop/aa366778(v=vs.85).aspx
Hardware can put stricter restrictions: the motherboard of my PC has a bus with
enough pins to address only 16G and that's it.
--
Stefano
-Original Message-
From:
? As in the _virtual_ address space of applications running on your OS is
limited to 16GB? Or your machine can't host more than 16GB of _physical_
RAM? The latter seems more likely to me.
Please excuse typos; sent from a phone.
On Jun 12, 2014, at 10:11 AM, Stefano Lanzavecchia s...@apl.it
Regarding COM, there's a now relatively old technology to do without the
registration. Here's a random link on the subject:
http://stackoverflow.com/questions/5132372/how-to-configure-registrationless-com-components
I have not tried it yet but it looks interesting and there are free tools
to
-Original Message-
From: programming-boun...@forums.jsoftware.com [mailto:programming-
boun...@forums.jsoftware.com] On Behalf Of Martin Saurer
Sent: Friday, March 7, 2014 2:12 PM
To: programm...@jsoftware.com
Subject: Re: [Jprogramming] J in 5 minutes
Hello all Jers,
My two
Reinventing The (Square) Wheel Department.
Problem: given a rectangle ABCD defined by four points on the xy-plane,
detect whether a given point (a mouseclick) falls inside ABCD.
This might help.
Note that side
AB isn't necessarily parallel to the x or y axes.
But first you must rotate
Problem: given a rectangle ABCD defined by four points on the
xy-plane, detect whether a given point (a mouseclick) falls inside ABCD.
This might help.
Forgive the missing link: http://dfns.dyalog.com/n_abc.htm
--
Stefano
[ Once you say you're going to settle for second, that's what
Ugly as hell (but my J doesn't get any better without practicing):
cross =.(((1 {. 0 # ]), ]) {~ (:*(|.+.])@(=/~))@i.@#)
NB. Works for strings with replicated entries
cross 'aabbcdeabcde'
aa
b b
cc
d d
ee
aa
b b
cc
I had heard about COM in Win8.
Is it still being promoted as a development target? It's been tolerated in
.Net
for ages but always prefaced with phrases like legacy technology.
COM's main drawback is that it has not caught on outside of Microsoft. For
those of us interested in portable
12 matches
Mail list logo
