On Fri, Oct 26, 2012 at 2:34 AM, Jake McArthur wrote:
> I golfed a bit. :)
>
> sequence <=< filterM (const [False ..])
>
>
What is "golfed" and "<=<" ? Please, explain.
Thanks,
Dmitri
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://ww
On Fri, Oct 26, 2012 Alex Stangl wrote:
>* *
> combos [] = [[]]
> combos ([]:ls) = combos ls
> combos ((h:t):ls) = map (h:) (combos ls) ++ combos (t:ls)
>
Excellent, thanks!
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/m
Hi all,
I am looking for the algorithm and code better then the one I wrote (please
see below) to solve the problem given in the subject.
Unfortunately I finally need to implement this algorithm in Java. That's
why I am not only interested in beautiful Haskell algorithms, but also in
the one that I
Marcot,
Thanks for the detailed info!
Looks like "aptitude install libcurl4-gnutls-dev" solved the problem.
cheers,
Dmitri
On Tue, Aug 14, 2012 at 6:29 PM, Marco Túlio Pimenta Gontijo <
marcotmar...@gmail.com> wrote:
> Hi dokondr.
>
> On Tue, Aug 14, 2012 at
Please help to solve a problem installing curl package (
http://hackage.haskell.org/package/curl/) on Debian 6.0.5.
I am running the most recent Debian Haskell platform with GHC 6.12.1.
I did:
-> cabal update
-> cabal install cabal-install
It is interesting that in case you do again 'cabal update"
;
> On Mon, Feb 20, 2012 at 2:01 PM, dokondr wrote:
>
>> Please advise on a simple GUI library to display JSON data. A library
>> that is easy to build both on Win, Linux and OsX. I need a scrollable view
>> to show a list of JSON objects. Every object may contain other objects
Please advise on a simple GUI library to display JSON data. A library that
is easy to build both on Win, Linux and OsX. I need a scrollable view to
show a list of JSON objects. Every object may contain other objects
(recursively). List may have thousands of objects. Fields may have very
long text v
;
> --
> Edward Amsden
>
> On Wed, Feb 1, 2012 at 5:04 PM, dokondr wrote:
> > Hello,
> > I am pleased to announce NubFinder research project.
> > Goal: develop technology to search and analyze user opinions on the Web.
> > NubFinder and NubTrend are research
t;
doko...@gmail.com
http://sites.google.com/site/dokondr/welcome
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
**Bardur Arantsson wrote:
>On 01/26/2012 11:16 AM, dokondr wrote:
>> Ideally, I would be happy to be able to write in Haskell a complete
>> front-end / GUI, so it could be compiled to different back-ends:
Javascript
>> to run in the Browser and also a standalone app.
>&
On Thu, Jan 19, 2012 at 1:37 AM, Dag Odenhall wrote:
>
> On Tue, 2012-01-17 at 22:05 +0300, dokondr wrote:
> >
> > I prefer using Turing complete PL to program web client, like the one
> used
> > in GWT (Java) or Cappuccino (Objective-J). http://cappuccino.org/learn/
&
On Wed, Jan 18, 2012 at 10:47 AM, John Lenz wrote:
>
>
> I don't see a great need of developing something like GWT for haskell,
> since we already have good support for all sorts of existing tools that
> span more than just haskell, like extjs, yui, and jqueryui.
>
Haskell makes my work doable i
On Tue, Jan 17, 2012 at 6:42 PM, John Lenz wrote:
>
> HTML5 Canvas is great for charts. If you go this route you might as well
> use a library which draws charts for you instead of writing all this code
> yourself.
>
> Personally, I use extjs version 4 which has some amazing charts, but there
>
Hi all,
I hope to use Haskell for graphics (charts) programming in Web client.
My current implementation in brief:
Server side, Haskell modules:
1) collecting various statistics from Twitter
2) generating text data for Gnuplot (http://www.gnuplot.info/)
3) Gnuplot creates png files with charts
We
seTime defaultTimeLocale timeFormat1
timeStr :: Maybe UTCTime)
where
tryFormat time
| time == Nothing = parseTime defaultTimeLocale timeFormat2 timeStr
:: Maybe UTCTime
| otherwise = time
Not a very easy way, isn't it?
On Sun, Dec 11, 2011 at 9:22 PM, Yitzchak Gale
Hi,
I got quite used to a sequence providing simple data persistence :
1) Store my data to a file:
writeFile fileName (show someData)
2) Some time later read this data back:
line <- readFile fileName
let someData = read line :: SomeDataType
Having this done hundreds of times I now got stuck with
Hi,
I need to read / write epoch seconds from / to plain text files.
When I try to read POSIXTime that I use in my own data type:
data TimedClassRecT = TCR {timeStamp :: POSIXTime, classCosMap :: Map.Map
String Float}
deriving (Eq, Read, Show)
I get the following error:
No
On Thu, Dec 8, 2011 at 7:39 PM, Antoine Latter wrote:
> On Thu, Dec 8, 2011 at 9:30 AM, dokondr wrote:
> > Ok, maybe you could advise what packages to use for this simple scenario:
> >
> > I have two text strings with dates:
> >
> > s1 = "Wed, 07 Dec 2011
middle between these dates
3) Print out all three dates in the different format, like these:
2011, 7 Dec, Wed, 10:11:00
What functions should I use to implement this?
On Thu, Dec 8, 2011 at 7:13 PM, Antoine Latter wrote:
> On Thu, Dec 8, 2011 at 9:01 AM, dokondr wrote:
> > Now, w
mat1 = "%a, %d %b %Y %T %z"
timeFormat2 = "%m/%e/%Y %l:%M:%S %p"
-- timeFormat1 = "%m/%d/%Y %l:%M:%S %p"
On Thu, Dec 8, 2011 at 6:30 PM, dokondr wrote:
> I need to parse time strings like "Wed, 07 Dec 2011 10:09:21 +" to a
> type that:
>
#x27;time' package are all parseable with
> `parseTime` [1].
>
> Erik
>
[1]
> http://hackage.haskell.org/packages/archive/time/latest/doc/html/Data-Time-Format.html#v:parseTime
>
> On Thu, Dec 8, 2011 at 14:16, dokondr wrote:
> > Hi,
> > What would be the simp
Hi,
What would be the simplest way to convert strings like "Wed, 07 Dec 2011
10:09:21 +" to System.Time.ClockTime ?
Thanks!
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I was trying to google "haskell process sleep" without much success. It
really needs some experience to construct hoogle queries correctly :)
Thanks everybody for your help!
On Tue, Dec 6, 2011 at 8:07 PM, Paul R wrote:
> dokondr> Hi, I need to make the current process (executi
Hi,
I need to make the current process (executing thread) go to sleep for a
given amount of time. Can't find where threadSleep is defined.
Thanks!
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-caf
t;
> In this case, "/" is absolute, so it is returned.
>
> If you wish to add a trailing path separator, use
> `addTrailingPathSeparator`.
>
> Erik
>
> On Mon, Dec 5, 2011 at 15:53, dokondr wrote:
> > Balazs, thanks for your comments!
> > The fir
rom
> System.FilePath)
> instead of ++ "/" ++
>
> Balazs
>
>
> On Mon, Dec 5, 2011 at 1:44 PM, dokondr wrote:
>
>> This is how I finally solved this problem for POSIX complaint system:
>>
>> --
>> -- TestRun
>> --
>> module Main w
I don't actually need UTF-16 code in these strings. I would rather filter
them out before writing such strings to a file.
What would be a simple filter to do this?
*Albert Y. C. Lai* trebla at vex.net
wrote:
On 11-12-04 07:08 AM, dokondr wrote: >* In GHC 7.0.3 / Mac OS X when t
criptPath curDir
return path
getMyPath' (Executable path) _ = fst (splitFileName path)
getMyPath' (RunGHC path) _ = fst (splitFileName path)
getMyPath' Interactive curDir = curDir++"/"
--
All the best,
Dmitri O. Kondratiev
"This is what keeps
Erik
>
> On Sun, Dec 4, 2011 at 13:12, dokondr wrote:
> > Correct url of a "bad" string:
> >
> http://twitter.com/#!/search/Hoping%20You%20Have%20A%20iPhone%20When%20I%20Do%20This%20lang%3Aen<http://twitter.com/#%21/search/Hoping%20You%20Have%20A%20iPhone%20When%20I%
Correct url of a "bad" string:
http://twitter.com/#!/search/Hoping%20You%20Have%20A%20iPhone%20When%20I%20Do%20This%20lang%3Aen
On Sun, Dec 4, 2011 at 3:08 PM, dokondr wrote:
> Hi,
> In GHC 7.0.3 / Mac OS X when trying to:
>
> writeFile "someFile" "(Ho
Hi,
In GHC 7.0.3 / Mac OS X when trying to:
writeFile "someFile" "(Hoping You Have A iPhone When I Do This) Lol Sleep
Is When You Close These ---> \55357\56384"
I get:
commitBuffer: invalid argument (Illegal byte sequence)
The string I am trying to write can also be seen here:
http://twitter.c
Balazs, thanks!
It's great that these packages exist!
On Thu, Dec 1, 2011 at 11:17 PM, Balazs Komuves wrote:
>
> Hello,
>
> I'm not subscribed to haskell cafe, but I browse the archives sometimes.
>
> As Simon Hengel wrote there, there are two packages on Hackage
> trying to solve this exact p
;All Parameters: [$@]"
Again, any way to get the same functionality in GHC?
On Thu, Dec 1, 2011 at 10:32 PM, Giovanni Tirloni wrote:
> On Thu, Dec 1, 2011 at 5:26 PM, dokondr wrote:
>
>> On the contrary, standard shell variable $0 - contains a full path to the
>> program location in t
ct.
>
> Cheers,
>
> --
> Felipe.
>
--
All the best,
Dmitri O. Kondratiev
"This is what keeps me going: discovery"
doko...@gmail.com
http://sites.google.com/site/dokondr/welcome
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi,
When my program starts it needs to know a complete path to the directory
from which it was invoked.
In terms of standard shell (sh) I need the Haskell function that will do
equivalent to:
#!/bin/sh
path=$(dirname $0)
How to get this path in Haskell?
getProgName :: IO String
defined System.En
ble than they are worth since
> they don't accurately model the way AWS will respond to you under load. The
> free tier at AWS should allow you to experiment with building an app. The
> first couple of months of development cost us less than $1.
>
> Steve
>
> O
On Wed, Nov 9, 2011 at 8:41 PM, Bas van Dijk wrote:
> On 9 November 2011 11:59, dokondr wrote:
> > What Haskell package to work with NoSQL storage is both mature and
> easiest
> > to use?
> > I need persistent storage for simple key/value lists (not complex JSON
>
On Wed, Nov 9, 2011 at 5:46 PM, Daniel Schoepe wrote:
> On Wed, 9 Nov 2011 13:59:46 +0300, dokondr wrote:
> > Hi,
> > What Haskell package to work with NoSQL storage is both mature and
> easiest
> > to use?
> > I need persistent storage for simple key/value li
On Wed, Nov 9, 2011 at 2:11 PM, Giovanni Tirloni wrote:
> I meant install new packages through cabal under a different username. The
> cabal repo should be localized unless you specify --global
>
> Please see Rogan's suggestions.
>
>
Thanks for your help!
In case I upgrade to the latest Haskell Pl
Hi,
What Haskell package to work with NoSQL storage is both mature and easiest
to use?
I need persistent storage for simple key/value lists (not complex JSON
docs).
CouchDB and Cassandra seems to be overkill for my needs. What about Riak,
MongoDB, Voldemort, etc. ?
Thanks!
Dmitri.
__
On Wed, Nov 9, 2011 at 3:48 AM, Rogan Creswick wrote:
> On Tue, Nov 8, 2011 at 4:30 PM, Giovanni Tirloni
> wrote:
> >> 3) How to install it into a separate location so it would not ruin my
> >> current platform?
> >
> > You can install it under a different username.
>
Haskell Platform (HP) is
Hi,
I am running GHC 6.12.3 at Mac OSX and have numerous problems with 'cabal
install' of different packages.
For example:
~>cabal install mongoDB
Resolving dependencies...
Configuring mongoDB-1.1.0...
Preprocessing library mongoDB-1.1.0...
Building mongoDB-1.1.0...
...
Control/Monad/MVar.hs:16:34:
requires QuickCheck
==2.1.*
QuickCheck-2.4.1 was excluded because tagsoup-0.8 requires QuickCheck
==2.1.*
QuickCheck-2.4.1.1 was excluded because tagsoup-0.8 requires QuickCheck
==2.1.*
On Tue, Nov 8, 2011 at 2:43 PM, dokondr wrote:
>
>
> On Tue, Nov 8, 2011 at 2:31 PM, Audun Skauge
On Tue, Nov 8, 2011 at 2:31 PM, Audun Skaugen wrote:
> Erik Hesselink wrote:
>
>> On Tue, Nov 8, 2011 at 12:16, Ivan Lazar Miljenovic
>> wrote:
>>
>>
>>> On 8 November 2011 22:10, Erik Hesselink wrote:
>>>
>>>
This is because hSimpleDB doesn't specify version ranges on its
dependencies
xt changed its module structure
> going from 9.0 to 9.1, hSimpleDB doesn't build against 9.0.
>
> You can try to build it by adding '--constraint=hxt==9.0.\*' after
> your cabal-install command. You can also ask the author to add version
> ranges to the package.
>
&
Hi,
On Mac OSX, ghc-6.12.3, I have successfully installed the 'hxt' package:
http://hackage.haskell.org/package/hxt-8.5.2
Registering hxt-9.1.4...
Installing library in /Users/user/.cabal/lib/hxt-9.1.4/ghc-6.12.3
Now when I try to install hSimpleDB (
http://hackage.haskell.org/package/hSimpleDB)
On Wed, Nov 2, 2011 at 3:12 AM, dokondr wrote:
> Thanks everybody for advice!
> I'll try to clarify what I mean by persistence and concurrent access that
> preserves "happens-before" relationship.
> 1) Persistence - imagine Haskell run-time executing in infinite physi
Thanks everybody for advice!
I'll try to clarify what I mean by persistence and concurrent access that
preserves "happens-before" relationship.
1) Persistence - imagine Haskell run-time executing in infinite physical
memory. My idea is to implement really huge, "almost infinite memory" in
the clou
ll
do, no concurrency yet. Next step - NData.Map persisted in SimpleDB or
Cassandra or Redis, with concurrent access supported.
So it looks like NData.Map should be a monad ...
Any ideas on implementation and similar work?
Thanks!
Dmitri
---
http://sites.google.com/site/dokondr/welcome
__
On Tue, Nov 1, 2011 at 10:53 AM, Neil Davies
wrote:
> Word of caution
>
> Understand the semantics (and cost profile) of the AWS services first -
> you can't just open a HTTP connection and dribble data out over several
> days and hope for things to work. It is not a system that has that sort of
>
On Tue, Nov 1, 2011 at 5:03 AM, Ryan Newton wrote:
> Any example code of using hscassandra package would really help!
>>
>
> I'll ask my student. We may have some simple examples.
>
> Also, I have no idea as to their quality but I was pleasantly surprised to
> find three different amazon relate
On Tue, Nov 1, 2011 at 12:07 AM, Ryan Newton wrote:
> ...
> For a NOSQL layer -- I'm looking for the answer to that same question
> myself! We've been experimenting with Cassandra (used via the hscassandra
> package based in turn on cassandra-thrift). Already it's clear that there
> are many ar
On Mon, Oct 31, 2011 at 6:50 PM, John Lenz wrote:
> CouchDB works great, although I decided to go with SimpleDB since then it
> is amazon's problem to scale and allocate disk and so forth, which I like
> better. For couchdb, you can use my package couchdb-enumerator on hackage.
>
>
> Regarding C
On Mon, Oct 31, 2011 at 6:50 PM, John Lenz wrote:
> 4) My code processes hundreds of messages. Every message is processed in
>
>> exactly the same way as the others. So the code can be easily
>> parallelized. Any Haskell frameworks that will allow me to run this code
>> in a simple concurrency m
Hi,
Please share your experience / ideas on AWS storage most friendly to
Haskell.
So far I store my data mostly in Data.Map structures serialized to text
files with write / read functions. Now I was requested to move my app and
data to Amazon cloud. As far as I know there are two main storage types
am
thinking how to convert directed graph (that results from POS tagging) into
vector. Any ideas, links here?
Thanks!
On 28 October 2011 00:27, dokondr wrote:
> My mistake: need advice on libraries and data types not for trees but for
> directed graphs.
>
> On Thu, Oct 27, 2011 at 4:4
My mistake: need advice on libraries and data types not for trees but for
directed graphs.
On Thu, Oct 27, 2011 at 4:49 PM, dokondr wrote:
> Please advise on Haskell libraries to compare trees in textual
> representation.
> I need to compare both structure and node contents of two tr
Please advise on Haskell libraries to compare trees in textual
representation.
I need to compare both structure and node contents of two trees, find
similar sub-trees, and need some metric to measure distance between two
trees.
Also need advice on simple parser to convert textual tree representatio
ice )
--
All the best,
Dmitri O. Kondratiev
"This is what keeps me going: discovery"
doko...@gmail.com
http://sites.google.com/site/dokondr/welcome
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi,
I need to call Stanford NLP Parser from Haskell (unfortunately Haskell does
not have a similar one):
http://nlp.stanford.edu/software/lex-parser.shtml
What would be the most reliable framework for this?
Thanks!
Dmitri
___
Haskell-Cafe mailing list
H
should be equal to (f1 . f2 . f3)
> now.
>
This is a nice one, looks already like tiny DSL )
I think I've got the main idea - enumerate in my program all function
compositions in some data structure for Haskell to compile, and the
associate these with parameter values in external file.
On Wed, Aug 24, 2011 at 4:44 PM, Iustin Pop wrote:
> On Wed, Aug 24, 2011 at 04:35:42PM +0400, dokondr wrote:
> > Hi,
> > What is the Haskell way to compose functions in run-time?
> > Depending on configuration parameters I need to be able to compose
> function
>
Hi,
What is the Haskell way to compose functions in run-time?
Depending on configuration parameters I need to be able to compose function
in several ways without recompilation.
When program starts it reads configuration parameters from a text file. For
example, I have three functions, f1, f2, f3,
.
It would then be the ideal PL for reliable programming of adaptive,
distributed real-world systems!
--
All the best,
Dmitri O. Kondratiev
"This is what keeps me going: discovery"
doko...@gmail.com
http://sites.google.com/site/dokondr/welcome
_
On Mon, Aug 15, 2011 at 12:36 PM, Holger Reinhardt wrote:
> Hi,
>
> the actor package seems unmaintained and probably doesn't fit your needs.
> If you want to implement some kind of publish/subscribe system over the
> network, I'd suggest you take a look at ZeroMQ[1] and AMQP[2].
> AMQP is probabl
On Sat, Aug 13, 2011 at 3:54 PM, dokondr wrote:
> Hi,
> I am trying to figure out what Haskell libraries can be used to build
> publish / subscribe communication between threads running both in the same
> and different address spaces on the net.
> For my needs any of these m
quot;
doko...@gmail.com
http://sites.google.com/site/dokondr/welcome
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi,
I am looking for Haskell libraries to do approximate string matching:
http://en.wikipedia.org/wiki/Approximate_string_matching
I need this to reduce a set of English word variants with spelling errors to
a single canonical dictionary entry.
Any libraries to work with spelling will also help.
T
a wrote:
>
>
> On Tue, Jul 26, 2011 at 1:30 PM, dokondr wrote:
>
>> Hi,
>> Can't find on hackage any sparse vector library. Does such thing exist?
>> I need efficient storage and dot product calculation for very sparse
>> vectors with about 10 out of 40 000
Hi,
Can't find on hackage any sparse vector library. Does such thing exist?
I need efficient storage and dot product calculation for very sparse
vectors with about 10 out of 40 000 non-zero components.
One solution would be to represent Sparse Vector as Data.Map with
(component_index, component_val
70 matches
Mail list logo
