Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.java.programmer > #31621
| From | Sebastian <news@seyweiler.dyndns.org> |
|---|---|
| Newsgroups | comp.lang.java.programmer |
| Subject | Re: Easy exhaustive search with Java 8 Streams |
| Date | 2015-04-29 09:45 +0200 |
| Organization | albasani.net |
| Message-ID | <mhq26v$vsp$1@news.albasani.net> (permalink) |
| References | <mhlvba$c1p$1@news.albasani.net> <exhaustive-search-20150428225700@ram.dialup.fu-berlin.de> |
Am 28.04.2015 23:01, schrieb Stefan Ram: > Sebastian <news@seyweiler.dyndns.org> writes: >> remove(DIGITS, s, e, n, d, m, o, r).stream().flatMap( y -> > > The program above has a hardcoded solution for a single specific > fixed puzzle. So, for the next puzzle, it has to be written anew? > This is »easy«? > > I like generalized solutions: > Quite so. But I believe you misunderstood the aim of my post. I simply wanted to point out a particular use of a monadic interface in Java. The particular example was completely irrelevant to that point. (What was relevant, however, was finding ALL solutions, not just one.) -- Sebastian
Back to comp.lang.java.programmer | Previous | Next — Previous in thread | Find similar | Unroll thread
Easy exhaustive search with Java 8 Streams Sebastian <news@seyweiler.dyndns.org> - 2015-04-27 20:32 +0200
Re: Easy exhaustive search with Java 8 Streams Jan Burse <janburse@fastmail.fm> - 2015-04-28 12:35 +0200
Re: Easy exhaustive search with Java 8 Streams Sebastian <news@seyweiler.dyndns.org> - 2015-04-29 11:12 +0200
Re: Easy exhaustive search with Java 8 Streams j4n bur53 <janburse@fastmail.fm> - 2015-04-30 09:02 +0200
Re: Easy exhaustive search with Java 8 Streams Sebastian <news@seyweiler.dyndns.org> - 2015-04-29 09:45 +0200
csiph-web