Dear Haskellers,
who needs this kind of documentation?
http://hackage.haskell.org/packages/archive/tfp/0.2/doc/html/Types-Data-Num-Decimal-Literals.html
isn't this a kind of spam?
Cheers,
Uwe
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Haskell XML Toolbox 7.2
I would like to announce a new version of the Haskell XML Toolbox.
This is mainly a bug fix release, but there is one new module
for converting data between user defined types and the
HXT DOM structure.
This new modules enables the simple persistent storage and retrieval
, (a_remove_whitespace, v_1)
, (a_encoding, isoLatin1)
, (a_issue_warnings, v_0)
, (a_trace, "1")
]
-
Cheers,
Uwe Schmidt
--
Uwe Schmidt
Web: http://www.fh-wedel.de/~si/
___
ns_for_XML_Schema";
Cheers,
Uwe
--
Uwe Schmidt
FH Wedel
http://www.fh-wedel.de/~si/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Yitzchak Gale wrote:
> Another question about HaXML and HXT -
> what is the level of XML spec. compliance?
Implementing the XML 1.0 Standard was
one of the goals of HXT when starting the project.
This includes full support of DTD processing,
which turned out to be the hardest part of the
whole pa
Rene de Visser wrote:
> I think a step towards support medium size documents in HXT would be to
> store the tags and content more efficiently.
> If I undertand the coding correctly every tag is stored as a seperate
> Haskell string. As each byte of a string under GHC takes 12 bytes this alone
>
apfelmus wrote:
> Ah! I got struck by a trick: it's possible to store every tag name in
> full only once but still present a simple tree with full tag names to
> the user. You simply share all the tag names. For instance, in
>
>let x = "mytagname" in Tree (Tag x) [Tree (Tag x) [Text "foobar"]]
Hi all,
what's the simplest way to check, whether a given string
is a wellformed regular expression?
In the API there's just a "mkRegex" which does not make
any checks, and the "matchRegex" which throws an exception
when the regex isn't wellformed.
So do I need the IO monad for checking a regex?
Hi Fernand,
> Everything works fine except for the fact that all the nodes «
> »
> (that is, a space (an XML text node whose contents are a single space
> character)
> within a element node) get transformed to a « » element
I can't really reproduce this:
A simple ghci session gives the follow
Hi Miguel,
> Hmmm, with 'readString ... " "' everything works fine,
> but with 'readString ... " "' it doesn't.
> Seems to be a bug in HXT.
I don't see the bug:
--
*Main> runX $ ( readString [(a_validate,v_0)] " "
>>> setTraceLevel 4 >>> traceDoc "doc af
Hi Miguel,
> Try " " and a_indent writing option.
yes, with the indent option set, whitespace
becomes insignificant and will change during
formating, and so the contents
of the inner element reduces to empty
Turn of the indentation and you get the
result you want.
Cheers,
Uwe
--
Web: http:/
Rene de Visser wrote:
> "Matthew Pocock" <[EMAIL PROTECTED]> schrieb im Newsbeitrag
> news:[EMAIL PROTECTED]
> > On Thursday 24 January 2008, Albert Y. C. Lai wrote:
> >> Matthew Pocock wrote:
> >> > I've been using hxt to process xml files. Now that my files are getting
> >> > a
> >> > bit bigg
Rene de Visser wrote:
> If I remember correctly, the data type of the tree in HXT is something like
>
> data Tree = Tree NodeData [Tree]
>
> which means that already processed parts of the tree can't be garbage
> collected because the parent node is holding onto them.
This statement only holds
Hi Neil,
> Please send a patch with whatever come up with, so others can make use
> of it. I've already added Data.HTML.TagSoup.Tree to the latest darcs
> version, which does as well as it can with tag matching, but is
> entirely strict. Having a lazy version would be great.
It's too early for a
Lieber Herr Hübel,
lieber Herr Schlatt,
ich habe gerade das Announcement von Holumbus
in haskell.org gelesen und natürlich auch Holumbus ausprobiert.
RICHTIG GUT!
Viele Gruesse
Uwe Schmidt
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
Uwe Schmidt wrote:
> Lieber Herr Hübel,
> lieber Herr Schlatt,
sorry for spamming haskell-cafe
Uwe
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ln wrote:
> I would like to try HXT, but I can't manage to build it. I resolved all
>
> the dependencies, but I get the following error:
> > > [EMAIL PROTECTED]:~/Desktop/hxt$ make all
> > > make -C src all VERSION=7.5
> > > make[1]: Entering directory `/home/ln/Desktop/hxt/src'
> > > make in
Daniel McAllansmith wrote:
> I'm having some problems with connections leaking when using 7.4. I've
> just checked and it happens with 7.5 off of hackage as well.
>
> It appears that readDocument doesn't close the connection when using the
> haskell http library, it works ok when curl is used tho
>>>
arrIO print
)
return ()
x is processed within an arrow by lifting the print function to then arrow
level.
There is a new wiki page about picklers
http://www.haskell.org/haskellwiki/HXT/Conversio
Model UseCaseModel
processUseCaseModel
= arrIO ( \ x -> do {print x ; return x})
---
This program will print the internal haskell value and
writes the data to "new-uc.xml"
Cheers
Uwe
--
Uwe Schmidt
Web: http://www.fh-wedel.de/~si/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Haskell XML Toolbox 8.0.0
I would like to announce a new version of the Haskell XML Toolbox.
The main change is the separation of the old filter interface
into a separate package "hxt-filter".
This makes the API simpler and more readable.
The filter API will not be developed further. But all the
Ketil Malde wrote:
> I don't think that is legal XML. The definitions of STag and Attribute
> from http://www.w3.org/TR/xml11/#NT-STag are:
>
> [40] STag::= '<' Name (S Attribute)* S? '>'
> [41] Attribute ::=Name Eq AttValue
>
> And 'S' represents one or more whitespace chara
Thomas M. DuBuisson wrote:
> As you can probably tell, I didn't invest enough into the
> non-performance aspects of pureMD5. Faced with actual users ;-), I have
> released version 0.2.0 which has the bug fix, a new API (type prevention
> from re-finalizing a digest), and a reasonable set of quick
emented.
Cheers,
Uwe
--
Uwe Schmidt
FH Wedel
http://www.fh-wedel.de/~si/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Don wrote
> I see fairly regular complaints about too many Haskell libraries,
> bewildering choice of difficult-to-determine quality.
>
> I've tried to summarize the state of Hackage, and what projects are
> active to make it easier to find high quality libraries:
>
> http://tinyurl.com/2cqw9s
Bas wrote:
> Ordering by nr of direct/indirect reverse dependencies might also be
> useful.
this is already done. After indexing the cabal pages, the dependencies are all
known and a package rank is derived from that graph. That is also used in the
(new) function search, functions in base (and
On Thursday 03 June 2010 06:27:43 am Don Stewart wrote:
> I've been posting CSV files of the download statistics here:
>
>http://www.galois.com/~dons/hackage/hackage-downloads.csv
>
> The next quarter's aggregated downloads are due soon.
>
> The Arch Haskell site uses these stats to compute
Haskell XML Toolbox 9.0.0
I would like to announce a new version of the Haskell XML Toolbox.
HXT has grown over the years. Components for XPath, XSLT, validation with
RelaxNG, picklers for conversion from/to native Haskell data, lazy parsing
with tagsoup, input via curl and native Haskell HTTP
Hello Henning,
> hxt-filter does not seem to be updated to hxt-9.0. How about providing
> hxt-filter with DEPRECATED pragmas for the functions that tell me how to
> rewrite functions from hxt-filter to arrows? Or is there another guide
> about how to move from hxt-filter to arrows?
Sorry, but the
Hi Gregory,
> Could you explain to me why HXT uses arrows? I have never been able
> to figure out what advantage this gives your library over monads. Since
> your arrows in practice implement ArrowApply, they are really just
> monads anyway, so it seems to me that using arrows instead of monad
Hi Gregory,
> ...
> No, but there is no point in using a formalism that adds complexity
> without adding functionality. Arrows are more awkward to use than
> monads because they were intentionally designed to be less powerful than
> monads in order to cover situations in which one could not use a
Hi Gregory,
> > As I understood, John Hughes invented the arrows as a generalisation
> > of monads, you say it's a less powerful concept. I'm a bit puzzled with
> > that. Could you explain these different views.
> >
>
> Consider the following example:
>
> f :: Int -> m a
> f i = monads
Dear Haskellers,
I've a question about type class design. When
developing the set of functions for a class, there
are often two or more functions, let's say f and g,
where the semantics of g can be expressed by f.
When writing down the code, there are two choices
for g. First g is included in the
Hi Ivan,
> Another possible argument: large type classes can look daunting for
> both implementors and users, even if only one or two methods need to
> be defined for a minimal instantiation (I'm tring to work out what to
> do here myself, as I have some typeclasses that for efficiency reasons
> i
Haskell XML Toolbox 8.5.0
I would like to announce a new version of the Haskell XML Toolbox.
The main change in this release is the separation of the XPath module and the
XSLT module into separate packages hxt-xpath and hxt-xslt. So the
base package becomes a bit smaller. Installation shouldn't
Hi Mads,
> In HXT, namespace prefixes bound by an XML document are valid in the
> context of an XPath. How do avoid that?
>
> An example program will clarify:
>
> simpleXml :: String
> simpleXml = " xmlns:soap=\"http://www.w3.org/2003/05/soap-envelope\"/>"
>
> nsEnv :: [(String, String)]
> nsEn
Hi Mads,
> I am trying to use HXT to evaluate XPath expressions. The XPath
> expressions are not specified by myself, but by users of my program.
> However, the idea behind HXT's error handling confuses me. Maybe
> somebody can enlighten me.
>
> This program fragment:
>
> evalXPath :: String ->
Hi Mads,
> > This is a right point. Here the current XPath calling interface is too
> > simple.
> > A separation into XPath parsing and evaluation would be more flexible.
> > The parsing (and error handling of XPath syntax errors) could be done once.
> > I will extend the interface to support th
Hi Mads,
> Replying to myself:
>
> > I think another example will clarify my point. The code:
> >
> > simpleXmlOne, simpleXmlTwo :: String
> > simpleXmlOne = "http://foo.org\"/>"
> > simpleXmlTwo = "http://foo.org\"/>"
> >
> > nsEnv :: [(String, String)]
> > nsEnv = [ ("notFoo", "http://not
Hi John and Malcom,
> I know that the HaXml library has a separate error-correcting HTML
> parser that works around most of the common non-well-formedness bugs
> in HTML:
> Text.XML.HaXml.Html.Parse
>
> I believe HXT has a similar parser:
> Text.XML.HXT.Parser.HtmlParsec
>
> Indeed, some
Hi Ivan,
> Uwe Schmidt writes:
> > The HTML parser in HXT is based on tagsoup. It's a lazy parser
> > (it does not use parsec) and it tries to parse everything as HTML.
> > But garbage in, garbage out, there is no approach to repair illegal HTML
> > as e.g. the
Hi Roly,
> I'm looking for a simple way to rewrite strings according to simple
> composable rules like:
>
> replace "_" by "\\(\\hole\\)"
> replace "-n" where n matches an integer by "^{n}"
>
> so that I can import some pretty-printed output into a LaTeX alltt
> environment. I'm guessing that this
l contains two text nodes, one for "foo"
and one for "bar". If you later search for a text "foobar"
you don't find a node. The melting of adjacent text nodes can
be done with
... (xshow (deep getText) >>> mkText) ...
Cheers,
Uwe
--
Uwe Schmidt
Hi Tobias,
> 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
> writ
Hi Tobias,
> When is the release of hxt-9.1 on hackage expected?
I've uploaded a hxt-9.0.1 to hackage with that bug removed.
Cheers,
Uwe
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Patrick,
> Is it just me, or is HXT slow? I noticed that both reading a document
> from a file, as well as running computations, are exceedingly slow,
> with simple stuff like 'get the contents of everything with a given
> class' taking .3 seconds for a 400KB HTML file in Python using lxml
> an
Haskell XML Toolbox 9.1
I would like to announce an update hxt-9.1 of the Haskell XML Toolbox.
Main changes compared to hxt-9.0 are
* space optimization of DOM tree for better performance for lager XML
documents
* optimization of space used during parsing in native XML and HTML parsers
* a bin
Hi Henry,
> I have just spent many hours staring at code and losing some hair. My
> hope is to save you the same experience someday. Here was my goal:
>
> Take some XML, like and
> replace the align attribute with a class attribute, but only if the
> value of the align attribute was not null.
ith the wrong structure
of that document, or correct the XML file (and give the
maintainers of that file a bug report).
But with the error message HXT gave you,
there is some room for improvements.
Cheers,
Uwe
--
Uwe Schmidt
FH Wedel
__
49 matches
Mail list logo
