On 12/03/2010 10:48 AM, Serguey Zefirov wrote:
> 2010/12/3 Permjacov Evgeniy :
>>> Most of the time you can get away with usual block ciphers (and even
>>> with weaker parameters). There is a scheme that transforms block
>>> cipher into hash function:
>>> http://en.wikipedia.org/wiki/CRHF#Hash_func
2010/12/3 Permjacov Evgeniy :
>>> */me wrote it into to_read list. The problem is, however, that block
>>> ciphers are quite unfriendly to plain word8 streams. It is not a deadly
>>> problem, but i'd like to avoid block collections.
>> All one-way hashes do block collections. This is unavoidable.
>
Hello café,
I have seen tutorials about extracting information from a tag soup, but I
have a different use case:
I want to read a xml file, find a tag, change its content, and write the xml
file back.
This is an example of the files
http://ns.adobe.com/AdobeInDesign/idml/1.0/packaging"; DOMVers
On 02/12/2010 23:48, Claus Reinke wrote:
The haskell.org server migration is now complete.
Please let us know if you have any problems.
Beginning this week, the majority of mails from haskell.org
lists seem to end up in my ISP's spam filter. That would be
Yahoo! - I wonder whether others here h
Should be fixed. PDF previews are currently broken, but images should be fine.
2010/12/3 Eugene Kirpichov :
> Hello,
>
> Any news on this one?
>
>
>
> 01.12.2010, в 11:53, Yitzchak Gale написал(а):
>
>> Eugene Kirpichov wrote:
>>> I looked at a couple pages of mine...
>>> and looks
>>> like the
2010/12/3 Thomas Schilling :
> Should be fixed. PDF previews are currently broken, but images should be
> fine.
Unfortunately they aren't. Please take a look at
http://www.haskell.org/haskellwiki/Timeplot .
>
> 2010/12/3 Eugene Kirpichov :
>> Hello,
>>
>> Any news on this one?
>>
>>
>>
>> 01.12.
Thanks to Edward Z Yang - the problem has gone.
The point is that I used raw URLs to include these images, but I
should have used [[Image:MyImage.png]].
3 декабря 2010 г. 15:22 пользователь Eugene Kirpichov
написал:
> 2010/12/3 Thomas Schilling :
>> Should be fixed. PDF previews are currently b
This was because, for some odd reason, the images were stored using
absolute URLs and not real wikilinks. I've fixed most of them on that
page.
Edward
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Hi,
I have some problems with the error processing in HXT.
Here is a trivial example:
e <- runX (transformDoc [] someRules src dst)
transformDoc cfg rules src dst =
configSysVars cfg >>>
readDocument [] src >>>
rules >>> -- some transformations
writeDocument [] dst >>>
getErrSt
I really wouldn't use tag soup for this. Haskell has libraries specifically
for XML processing which might be better suited to your needs.
On Fri, Dec 3, 2010 at 5:59 AM, David Virebayre
> wrote:
> Hello café,
>
> I have seen tutorials about extracting information from a tag soup, but I
> have
I'm planning on using Happy for my compiler construction class this
quarter. The only problem so far is that emacs keeps trying to mangle
my .y files because it assumes I mean them for yacc. Is there an emacs
mode for Happy or is it maybe time to also buckle down to learning
elisp and write one mys
I've seen questions on using HStringTemplate with syb-with-class on
the list before, but haven't seen this issue addressed. I'm hoping
it's a noob issue, and, therefore, thought I would check with the list
before spending too much time digging around for solutions.
I'm attempting to use HStringTem
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 11/28/10 08:47 , Florian Weimer wrote:
> * Gregory Collins:
>
>> * Andrew Coppin:
>>> Hypothesis: The fact that the average Haskeller thinks that this
>>> kind of dense cryptic material is "pretty garden-variety" notation
>>> possibly explains why
I may be missing something, but it is not clear to me if you want
cryptographic security. If you do, then the only safe choice
is to use a standard algorithm (or block cipher construction,
perhaps). Sorry if that's already what you are discussing -
I don't know whether there are any established alg
On 12/01/10 21:35, Larry Evans wrote:
> On 11/30/10 13:43, Noah Easterly wrote:
[snip]
>> Thanks, Larry, this is some interesting stuff.
>>
>> I'm not sure yet whether Q is equivalent - it may be, but I haven't been
>> able to thoroughly grok it yet.
>>
[snip]
>
> Hi Noah,
>
> The attached is my
On 12/03/2010 11:40 AM, Serguey Zefirov wrote:
> 2010/12/3 Permjacov Evgeniy :
*/me wrote it into to_read list. The problem is, however, that block
ciphers are quite unfriendly to plain word8 streams. It is not a deadly
problem, but i'd like to avoid block collections.
>>> All one-wa
2010/12/4 Permjacov Evgeniy :
>> near cryptographic) security. To quote Wikipedia again: "The avalanche
>> effect is evident if, when an input is changed slightly (for example,
>> flipping a single bit) the output changes significantly (e.g., half
>> the output bits flip)."
> This simply means, tha
On Thu, 2 Dec 2010, Robert Greayer wrote:
On Thu, Dec 2, 2010 at 4:39 PM, Antoine Latter wrote:
On Thu, Dec 2, 2010 at 3:29 PM, Andrew Coppin
wrote:
What we /can't/ do is define a polymorphic map function. One might try to do
something like
class Functor f where
type Element f :: *
On 12/2/10 4:47 PM, Iavor Diatchki wrote:
Hi,
You have it exactly right, and I don't think that there's a
particularly deep reason to prefer the one over the other. It seems
that computer science people
tend to go with the (product-function) terminology, while math people
seem to prefer the (sum
19 matches
Mail list logo
