of these outputs?
When you say
some positive integer :: [Word8]
what you're effectively saying is
some positive integer `mod` 256
because that's what fits into a slot that's 8 bits wide.
So:
1000 `mod` 256 = 232
1 `mod` 256 = 16
and so on.
-Steve Schafer
on Windows, as far as possible means locking it across the
whole system.
Windows does allow finer-grained control (including byte-range locking),
but most applications don't bother.
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
will result in more chaos when said developer is
hit by a bus?
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
..0.5], but also works for
[0.1,0.2..1234567890.5].
A good rule of thumb: For every proposal that purports to eliminate
having to explicitly take into consideration the limited precision of
floating-point representations, there exists a trivial example that
breaks that proposal.
-Steve Schafer
On Tue, 27 Sep 2011 13:13:39 -0600, you wrote:
On Tue, 2011-09-27 at 12:36 -0400, Steve Schafer wrote:
[0.1,0.2..0.5] isn't the problem. The problem is coming up with
something that not only works for [0.1,0.2..0.5], but also works for
[0.1,0.2..1234567890.5].
A good rule of thumb
in
cryptography. But those are invariably FIXED LENGTH multiple-byte
integers. As I mentioned before, to the best of my knowledge, no one
uses variable-size representations in those kinds of
computationally-intensive applications.
-Steve Schafer
___
Haskell
that such a PRNG wouldn't be very efficient), so I'm still
not sure that I understand the question.
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
unlikely that a single function (other than simply taking the
logarithm) can handle the majority of applications.
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
and generate a set of pseudorandom numbers ranging
from 0 to n-1, that's easily done using the standard random number
methods.
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--the compiler would be
able to insert explicit object lifetime management directly into the
code.
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.).
As for Haskell, I would still vote for UTF-8 only, though. The only
reason to favor anything else is legacy compatibility with existing
Haskell source files, and that isn't really an issue here.
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe
your grammar.
I don't know how much experience you have with language grammars, but it
might be helpful to try to write down MMIXAL's grammar using EBNF
notation, as a starting point.
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe
exactly how a parser is supposed to work,
so it's not clear what the problem is...)
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Wed, 27 Oct 2010 14:13:31 +0100, you wrote:
They're just figureheads for a shadowy cabal :-D
You mean the Haskelluminati?
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
not have that limitation), you
can make it work for larger numbers/longer strings:
genbin n = map (showFixed n) [0..2^n-1::Integer]
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
as often as you want, and the preprocessor is invoked
automatically, as needed.
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Fri, 8 Oct 2010 09:56:07 +0200, you wrote:
Unfortunately, hurry is pronounced differently in British and US
English [1], so again I was a little bit confused :-).
[1] http://en.wiktionary.org/wiki/hurry#Pronunciation
The US sample is correct for someone from California, but it's not the
way
put them in that order; i.e., that it
was a purposeful act.
I think the reason for this conceptual distinction can be traced to the
derivation of ordering as the gerund form of the verb order, in that
it implies that an action has occurred (or is still occurring).
-Steve Schafer
to say: The project is too
big for one person, or a small group of people. But it also can't happen
unless there's a shared understanding of what is important and why it is
important, and that's what seems to be lacking here.
-Steve Schafer
___
Haskell
On Sat, 2 Oct 2010 11:02:21 -0700, you wrote:
I imagine someone looking at a lovely app and saying, Wow -- great
interface! I bet it was programmed in Haskell.
While I can agree with the sentiment...well, good luck with that. ;-)
-Steve Schafer
toolkits.
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
if we want people to pay any attention to the software that
we write!
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, 10 Aug 2010 18:27:49 -0300, you wrote:
Nope. For example, suppose we have:
int randomNumber(int min, int max);
Equivalentely:
randomNumber :: Int - Int - IO Int
In Haskell if we say
(+) $ randomNumber 10 15 * randomNumber 10 15
That's the same as
let x = randomNumber 10 15
On Fri, 23 Jul 2010 18:08:39 +0100, you wrote:
Anybody have any theroes why Trend Micro Antivirus is reporting this as
a confirmed fraud/attack site?
Because someone somewhere has used the nyud.net distribution service to
distribute malware. Since it's a free service, it's pretty much
On Fri, 09 Jul 2010 10:07:06 -0400, you wrote:
I don't think I've ever seen them *followed* by commas. Preceded, always.
In American English, they're always followed by commas, and preceded by
comma, semicolon, dash or left parenthesis, depending on the specific
context.
Examples from various
On Fri, 9 Jul 2010 17:14:31 +0200, you wrote:
One of the nice things about English is that there is often never an
always. See http://grammar.quickanddirtytips.com/ie-eg-oh-my.aspx for a
discussion.
Well, that page pretty much confirms what I said. In AMERICAN English,
they're always followed by
On Wed, 16 Jun 2010 18:30:47 +0200, you wrote:
Then I thought, what if I replace the (*) and (+) operations which are applied
when I multipy the matrix with a vector (i.e. a vector if inputs or outputs)
by something more general. So I replaced (+) by function application and my
matrix was now
On Tue, 15 Jun 2010 19:23:35 +0200, you wrote:
When I know my supplies I want to know what I can produce. When I know what I
want to produce I want to know what supplies I need for that. Both kinds of
questions should be answered by a singe Process thingy.
I want to be able to chain processes
characteristics of disk latency, etc., could
very well be patentable.
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, 06 Apr 2010 14:57:30 +0200, you wrote:
I agree, and this is why I phased out apfelmus in favor of the
pseudonym Heinrich Apfelmus.
You mean your name isn't really Applesauce?
Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
to discriminate in favor of is smaller than the
difference between individuals.
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
As or Bs, because there
is nearly always substantial overlap between the categories in whatever
criterion it is that you're measuring.
-Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
don't have to worry about failures at all.
You generally only care about atomicity at some outer, observable
level; there is rarely any point in worrying about nested atomicity.
Steve Schafer
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
the internal redundancy of the keys to come
up with an efficient function?
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
...)
(if test
(begin stmt1
stmt2 ...))
(let ((if #t))
(when if (set! if 'now))
if))
Evaluating the above returns now.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com
actually be drawn away
from Preset/Present and towards Colour, noticing that it is spelled
incorrectly...
Count me in the prefers hyphens camp, by the way.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Here is some furniture that ought to appeal to the Haskell afficionado:
http://karl-andersson.se/view_product.asp?rangeId=39catId=2picture=2
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe
(if that is
the right term in english) on plush sloth bears.
A sloth bear is a kind of bear, not a sloth. Amazon also has some sloth
stuffed animals, too. If you get one that's reasonably large, then you
can get a lambda-imprinted Cafe Press t-shirt in an infant size that
would fit it.
Steve Schafer
'? Those things are the rough equivalents of terms like
`monoid'.
Stress, probably, at least in basic terms. Tensor, probably not.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
your product only at the kinds of engineers
who _can_ do those things, you will be reaching a tiny, tiny fraction of
the overall population.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe
-esque journey that never seems to get anywhere.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
certainly care
about that magnitude of error.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
with lots of tall buildings, it might be
difficult to obtain a GPS signal of high enough quality. Some of the
purpose-built GPS time receivers have better antennas than a
consumer-grade GPS device.
Steve Schafer
Fenestra Technologies Corp
http://www.fenestra.com
On Fri, 09 Jan 2009 09:28:49 -0600, you wrote:
I'm not sure that the original question implied *that* level of need.
I can't imagine being worried about leap seconds yet at the same time
being willing to accept the potential vagaries of any of the built-in
clocks.
Steve Schafer
Fenestra
of the look and feel
of what programmers from other languages are comfortable with. And then
transform that program, step-by-step, into something that takes
advantage of Haskell's strengths.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com
function, in fact) that also has a side effect.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
see reported in the Properties dialog,
but it's quite possible that you're setting the value of the wrong
one, and that's why you're not seeing what you expect.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing
a set of
TrueType fonts into the EXE.)
There are a gazillion resource editors available for modifying the
resources linked into an EXE; go to the Wikipedia page for a reasonable
starting point:
http://en.wikipedia.org/wiki/Resource_(Windows)
Steve Schafer
Fenestra Technologies Corp
http
that is all about.
This is known as name mangling. See the Wikipedia article for more info:
http://en.wikipedia.org/wiki/Name_mangling
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe
will necessarily map to the
same screen pixel.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
different from a general-purpose programming
language? You're just drawing the line in the sand in a different
place. You end up with a programming system where compilation is a side
effect of executing the real program.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com
the same thing if you
use the DIR command from a command-line prompt.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
. After all, Andrew's original message mentioned stuff
the type system was never designed to do.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
of using the type system to solve one of the liar/truthteller logic
problems. And so on.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
rejoinder is, To what end? To extend the _syntax_ of the type
system in a way that allows such natural expression turns it into yet
another programming language. So what have we gained?
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com
On Mon, 27 Aug 2007 19:05:06 +0200, you wrote:
Where do I go wrong (I)?
b is defined to be _half_ of the chord (the semichord, I suppose).
You're assuming it to be the entire chord.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com
identity sin^2 @ + cos^2 @ = 1 and rearranging,
we get:
x = a - sqrt(a^2 - b^2)
I don't know offhand if there's a straightforward way to arrive at this
result without using trigonometry.
By the way, I found http://www.1728.com/circsect.htm by Googling height
chord.
Steve Schafer
Fenestra
On Sun, 26 Aug 2007 21:30:30 -0400, you wrote:
I don't know offhand if there's a straightforward way to arrive at this
result without using trigonometry.
Duh. Of course there is
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com
On Thu, 16 Aug 2007 00:05:14 +0200, you wrote:
I'm not sure what you mean by with replacement
With replacement means that you select a value from the source, but
you don't actually remove it. That way, it's still available to be
selected again later.
Steve Schafer
Fenestra Technologies Corp
answers the second question, the
Logician knows the solution. How can this be? What answer did John give
that allows the Logician to solve the problem?
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
and
thus more likely to cause angst among beginners.
Or are you proposing to get rid of layout altogether and rely on
punctuation?
I just can't think of a rule that would be easier to understand (and
quicker to assimilate) than the current one.
Steve Schafer
Fenestra Technologies Corp.
http
On Thu, 19 Jul 2007 10:55:19 -0700 (PDT), you wrote:
The question suggests to use some functions defined in the section, and one
of them is iSort.
Aha. Well, that one certainly lends itself better to this particular
proplen than either map or filter.
minimumValue :: [Int] - Int
minimumValue ns
On Thu, 19 Jul 2007 19:26:39 +0100, you wrote:
Actually, since Haskell is lazy and only the first element is required
for minimumValue, the above algorithm should be O(n).
You're right (as long as the sort algorithm itself is sufficiently lazy,
of course).
Steve Schafer
Fenestra Technologies
On Thu, 19 Jul 2007 12:30:06 -0700 (PDT), you wrote:
I have defined the first line it seems right to me
Close, but not quite. Think of the result that line would give on
[1,1,2].
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com
response is NOT, Oh, don't do that; do this
other [less intuitive] thing instead. The welcoming response is to fix
the damn thing so that the intuitive approach works!
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing
improving software quality. A meaningful benchmark
would be one that compares end-to-end software development lifecycles,
including not only runtime performance, but also development costs,
debugging and maintenance time, reliability, etc.
Steve Schafer
Fenestra Technologies Corp.
http
is about the only reasonably common I/O-related task
that has any sort of complexity. Most everything else is reading or
writing streams of bytes; the hard part is what happens between the
reading and the writing.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com
the
first non-ASCII character was encountered.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of themselves. Look
up Russell's Paradox in Wikipedia.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
-8. A BOM
character isn't required for UTF-8 (it really only makes sense with
UTF-16), but a UTF-8-aware processor should skip right over it if it's
there.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
, then you have only yourself to blame
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, TRUE FALSE.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
standard there is, if
for no other reason than to avoid going insane.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
that required for parentheses.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
time (ISine p o t (SineTail l)) =
if on time (ISine p o t (SineTail l))
then [letter (ISine p o t (SineTail l))]
else []
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
asked specifically about that.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, regardless of the
choice of language. Perhaps what sets Haskell apart is that, unlike most
languages, it also makes writing _bad_ software hard. ;)
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe
because (a) I think it just might be worth it, and (b) I
can't help myself--I have an insatiable craving for new knowledge.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
aren't really interested, and if at
some future point they become interested, they'll find the way on their
own.
Steve Schafer
Fenestra Technologies Corp.
http:/www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
cannot refer to page
numbers, yet must be processed after transforming questions to rectangles?
It's not until you get to the rectangles level that you can see the
text and tokens that need to be replaced.
Thanks for all of the discussion. I think I have a lot to ponder
Steve
the same
kinds of problems that the textual Haskell has
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Fri, 29 Dec 2006 09:01:37 -0800, you wrote:
Steve Schafer wrote:
I can easily rewrite it in point-free style:
process1 = baz . bar . foo
Not unless you have a much fancier version of function composition,
like...
http://okmij.org/ftp/Haskell/types.html#polyvar-comp
Sorry; I
On Fri, 29 Dec 2006 14:23:20 +0300, you wrote:
it force you to give names to intermediate results which is considered as
good programing style - program becomes more documented.
But that would imply that function composition and in-line function
definition are also Bad Style.
Steve Schafer
] - [SequenceLayout] - SFO
MediaKind, MediaSize and Language are simple enumerations; everything
else is a complex structure.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
lots of tupling and
un-tupling).
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
be said for many other examples
of the use of the State monad (and Reader and Writer as well). They
frequently don't do anything that couldn't be done purely
functionally.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell
is to hold onto things I need later, but not right now.
So here's the (restated) question: Is there some way to represent the
process in good ol' text form that preserves the elegance and
conciseness of the graphical representation?
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com
at
the cost of introducing a few more steps:
(y07,y08) = f07 y01 y06;
would become
y' = f07 y01 y06;
y07 = f07a y';
y08 = f07b y';
where f07a = fst and f07b = snd.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe
be something that looks like
this:
process = f14 . f13 . ... . f01
or
process = f01 = f02 = ... = f14
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
should have realized that Oleg would have had something to say
about it. ;)
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
example of this is a problem that has a finite solution, but
whose solution is most clearly expressed in terms of operations on
infinite structures.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell
To: Creighton Hogg [EMAIL PROTECTED]
Subject: Re: [Haskell-cafe] Picking out elements of a heterogenous list
From: Steve Schafer [EMAIL PROTECTED]
Date: Tue, 05 Dec 2006 12:33:16 -0500
On Tue, 5 Dec 2006 11:08:07 -0600, you wrote:
Hi Haskell-ers,
So I think I understand the idea of creating
of this homogenous wrapper in
Haskesll is just like it is in Java:
myList = [(Integer 42), (Character 'a'), (Float 3.14159)]
vs.
myList = new LinkedList();
myList.add(new Integer(42));
myList.add(new Character('a'));
myList.add(new Float(3.14159));
Steve Schafer
Fenestra Technologies Corp
impossible to know
whether the first element of the new list will be Alice or Alice:1
until the entire original list has been traversed), but I thought I'd
put the question out to the community to see if anyone had any brilliant
insights.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com
of the second rule: If there are multiple
occurrences of a string, the _first_ occurrence has to be tagged, too,
not just the second through n'th occurrences. The result of the above
would have to be:
[Alice,Bob:1,Cindy:1,Bob:2,Bob:3,Dave,Cindy:2,Tim:1,Tim:2,Tim:3,...]
Steve Schafer
Fenestra
something to
itself.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
options as well.
Steve Schafer
Fenestra Technologies Corp.
http://www.fenestra.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
The reason I'm posting this here is that I have a gnawing suspicion that
the unflatten/prepend/isChild functions, and possibly the Node data type
as well, are not the most elegant way to go about solving the problem,
and that I'm missing another more obvious way to do it.
Any suggestions?
Thanks,
Steve
want in your own code, but I don't
think you should hold your breath waiting for someone else to come up
with that kind of pseudo-XML parser, since by definition it would be a
special-purpose tool.
Steve Schafer
Fenestra Technologies Corp
http://www.fenestra.com
On Wed, 21 Apr 2004 14:57:57 +0100, you wrote:
How about implementing a directly recursive solution? Simply
accumulate the sum so far, together with the list elements you have
already peeled off. Once the sum plus the next element would exceed
the threshold, emit the accumulated elements, and
1 - 100 of 101 matches
Mail list logo
