Hi,
currently when one install a cabal package it compiles it and then install
generated binaries. I wonder whether or not it would be useful to have
pre-compiled binaries as many package managers usually do (e.g. apt). I
often think that would save some time on the expense of a busier hackage
ser
Hi,
I've done a complete refactoring of oauth library. This new version is
incompatible (in terms of interface) with the previous one. An example of
use is available here:
http://projects.bitforest.org/hoauth/dist/doc/html/hoauth/Network-OAuth.html
Probably the major change is that, along the fun
Wrong link. This is the right one:
http://projects.bitforest.org/hoauth/dist/doc/html/hoauth/Network-OAuth-Consumer.html
~dsouza
On Sun, Mar 28, 2010 at 2:59 PM, Diego Souza wrote:
> Hi,
>
> I've done a complete refactoring of oauth library. This new version is
> incompat
Not exactly São Carlos: São Paulo - SP.
On Tue, May 19, 2009 at 09:28:55PM -0300, Maurício wrote:
> Anybody else around here?
>
> Best,
> Maurício
>
> ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/h
Hi,
I come up with the following solution for this easy spoj problem (warning!):
problem: https://www.spoj.pl/problems/ARITH2/
solution: http://hpaste.org/fastcgi/hpaste.fcgi/view?id=5720#a5720
I'd like to make it run faster, if possible. What should I do to
identify the bottlenecks and once I
Hi all,
I wrote a small library in haskell do deal with oauth authentication. It
turns out it is my first library in haskell as well. As I'm beginner in
haskell, I'm asking for a review of someone more experienced/proficient
before even daring to create a cabal pkg and dist it to hackage. :-)
Any
Hi Alex,
> - In the Token datatype, you can automatically create the accessor
> functions (oath_token, etc.) by using named fields:
I though about that too and I was not sure about what to do. The reason
I didn't use it is because I don't export the value constructors of
Token type, that is why I
Hi Alex,
It indeed helped a lot. I'm still reading more about
Control.Applicative, but I applied your other suggestions and they in
fact reduced duplication.
I'm going to upload it to hackage and let's see how it goes.
Thanks,
--
~dsouza
yahoo!im: paravinicius
gpg key fingerprint: 71B8 CE21 3A6
Dear Haskellers,
hoauth is a library which helps you to deal with oauth protocol.
Currently it supports only consumer side applications, but there are
plans to add service providers support in near future.
The source code can be found at [darcs]: http://projects.bitforest.org/hoauth/
and now in h
Hi Don,
no, not really, I completely missed that point. But if that is the case,
I presume there is no difference in using other licenses, like BSD3. Is
that the case?
Thanks,
On Mon, Aug 24, 2009 at 02:24:09PM -0700, Don Stewart wrote:
> I notice hoauth is packaged as LGPL. Since we use static
I've found [obviously] a huge thread about licensing on haskell-c...@.
After reading [most] of it, I realized the best thing to do is change
the license and start using BSD3.
--
~dsouza
yahoo!im: paravinicius
gpg key fingerprint: 71B8 CE21 3A6E F894 5B1B 9ECE F88E 067F E891 651E
> I'm sure I'm not alone when I say I'd like to see the longer,
> more technical response.
No, you aren't. Please `flood in' :-)
--
~dsouza
yahoo!im: paravinicius
gpg key fingerprint: 71B8 CE21 3A6E F894 5B1B 9ECE F88E 067F E891 651E
___
Haskell-C
Hi,
I was trying to solve a simple problem in SPOJ, however, after two weeks
trying almost everything I could think of, I was still getting
WrongAnswer.
Then I decided to do the same thing in C++ and I really got puzzled when
I got ACcepted.
I tried to understand what was different without succe
> Looks like the output should be sorted. The C++ version does this with the
> iterator over map implicitly. I don't spot where your haskell
> version sorts the output.
>
> There could be other problems, that's just what I can notice in 2 minutes of
> looking.
>
> Good luck!
Jason,
I assumed D
On Sun, Sep 13, 2009 at 11:34:16AM +0200, Max Rabkin wrote:
> That is part of the contract of toAscList (the "Asc" stands for
> "ascending order"), but because of the way Map is implemented, the
> result of toList is also sorted.
Cool. It is good to know that toAscList and toList would produce the
On Sun, Sep 13, 2009 at 09:57:50PM -0700, Iavor Diatchki wrote:
> (argh, sorry about that, I pressed something and gmail sent my
> unfinished email!)
>
> On Sun, Sep 13, 2009 at 9:54 PM, Iavor Diatchki
> wrote:
> > Hi,
> > It seems that the problem is the site is using GHC 6.6.1, and
> > somethin
Well, if you want you might use images inline as well:
http://en.wikipedia.org/wiki/Data_URI_scheme#Advantages
>From my experience, this is supported by all major browser, including IE.
Regards,
~dsouza
On Thu, Sep 23, 2010 at 9:03 AM, Joachim Breitner
wrote:
> Hi,
>
> Am Donnerstag, den 23.09.
Dear haskellers,
I'd like assistance figuring out a strange space leak using zlib
package.
To make it easier to reproduce I've come up with the following snippet
that pretty much resumes up the problem I'm trying to solve:
> -- omitting imports and function signatures
> encode = compress . L.fro
Sorry, I should've removed the pid number from the output. The
following should be correct:
> $ sudo dd if=/dev/sda bs=4K count=2048K | ./test +RTS -M1M -s >/dev/null
>
...
8589934592 bytes (8.6 GB) copied, 243.525 s, 35.3 MB/s
41,942,119,192
The whois still says it is registered to Galois, Inc. Then, hopefully, it is
just a DNS problem.
Guys, if you that are responsible for managing haskell.org need a hand with
sysadmin tasks I volunteer to work. I don't have lots of spare time, but I
do have some. Just let me know.
Thanks,
On Fri,
Hello Haskellers,
I'm playing a bit with Data.Judy. However, I noticed that using StablePtr
incurs in some performance problems, I don't have any numbers but as a
example use Int and ByteString as values and you can notice the difference
without any benchmarking tool with the example that comes in
Gregory Collins wrote:
> Pointers are mapped to StablePtrs using *drumroll* a hash table,
> so you can give up on getting acceptable performance out of this
> combination IMO.
>
> G
>
> On Mon, Dec 20, 2010 at 5:06 PM, Diego Souza wrote:
> > Hello Haskellers,
> &
Hi,
maybe you have already considered this and dropped it out for whenever
reasons. Anyways, what if you stick with Int or Data.Word.Word types and use
Data.Bits.bitSize or maxBound to check in runtime what the word size is. It
might be easier than using CPP extension.
~dsouza
On Sun, Jan 2, 201
Hi,
thanks for the feedbacks. They sound very reasonable.
Going back in time, the first version was in fact a pure library.
However, at some point I changed this as I thought it would make it
easier to use, which might have been a mistake of mine. Back then
http-enumerator wasn't available and af
On 02/15/2011 05:49 PM, Diego Souza wrote:
>> Hi,
>>
>> thanks for the feedbacks. They sound very reasonable.
>>
>> Going back in time, the first version was in fact a pure library.
>> However, at some point I changed this as I thought it would make it
>>
that. I'll definitely
take a look on this!
Thanks,
On Wed, Feb 16, 2011 at 8:33 AM, Vincent Hanquez wrote:
> On Tue, Feb 15, 2011 at 11:49:16PM -0200, Diego Souza wrote:
>> Hi,
>>
>> thanks for the feedbacks. They sound very reasonable.
>>
>> Going back in ti
Thanks! I'll merge it tonight :-)
On Wed, Feb 16, 2011 at 3:33 PM, Jeremy Fitzhardinge wrote:
> On 02/16/2011 06:00 AM, Diego Souza wrote:
>> I was thinking in separating the core and http functions in order to
>> be able to provide implementation for http-enumerator without
The perl community has something really interesting for quite long time:
http://wiki.cpantesters.org/wiki/HomePage
Or more specifically:
http://matrix.cpantesters.org/?dist=DBI
The idea is simple: there are many different platforms that would be
to expensive for one to support. So they ask the co
A little delayed, but might be useful.
I personally use icicles. I found the M-* great for narrowing results
down. I've tried anything and ido also, but icicles ended up winning,
for my taste at least.
A side note, speedbar actually *does* works for bufffers. Simply type
*b* on the speedbar and y
29 matches
Mail list logo
