[Lxml-checkins] r42850 - lxml/trunk/doc

scoder at codespeak.net scoder at codespeak.net
Tue May 8 14:23:09 CEST 2007


Author: scoder
Date: Tue May  8 14:23:09 2007
New Revision: 42850

Modified:
   lxml/trunk/doc/performance.txt
Log:
cleanup

Modified: lxml/trunk/doc/performance.txt
==============================================================================
--- lxml/trunk/doc/performance.txt	(original)
+++ lxml/trunk/doc/performance.txt	Tue May  8 14:23:09 2007
@@ -1,3 +1,4 @@
+====================
 Benchmarks and Speed
 ====================
 
@@ -27,7 +28,7 @@
 
 
 How to read the timings
------------------------
+=======================
 
 The statements made here are backed by the (micro-)benchmark scripts
 `bench_etree.py`_, `bench_xpath.py`_ and `bench_objectify.py`_ that come with
@@ -73,7 +74,7 @@
 
 
 General notes
--------------
+=============
 
 First thing to say: there *is* an overhead involved in having a DOM-like C
 library mimic the ElementTree API.  As opposed to ElementTree, lxml has to
@@ -92,7 +93,7 @@
 
 
 Parsing and Serialising
------------------------
+=======================
 
 These are areas where lxml excels.  The reason is that both parts are executed
 entirely at the C level, without major interaction with Python code.  The
@@ -164,7 +165,7 @@
 
 
 The ElementTree API
--------------------
+===================
 
 Since all three libraries implement the same API, their performance is easy to
 compare in this area.  A major disadvantage for lxml's performance is the
@@ -390,7 +391,7 @@
 
 
 An bigger example
------------------
+=================
 
 A while ago, Uche Ogbuji posted a benchmark proposal at `xml.org`_ that would
 read in a 3 MB XML version of the Old Testament of the Bible and look for the
@@ -504,7 +505,7 @@
 
 
 lxml.objectify
---------------
+==============
 
 The following timings are based on the benchmark script `bench_objectify.py`_.
 


More information about the lxml-checkins mailing list