aboutsummaryrefslogtreecommitdiff
AgeCommit message (Collapse)AuthorFilesLines
2014-07-16Update NEWS file2.0.0Boris Kolpackov1-6/+15
2014-06-27Remove stray print statementBoris Kolpackov1-2/+0
2014-06-20Reset element/attribute qualification in imported schemasBoris Kolpackov1-0/+6
2014-06-20Handle corner case in mixed content inheritanceBoris Kolpackov1-2/+14
2014-03-21Update copyrightBoris Kolpackov106-108/+108
2014-03-19Remove author from source filesBoris Kolpackov110-112/+0
2014-01-18Update INSTALL fileBoris Kolpackov1-6/+4
2014-01-18Fix import stubBoris Kolpackov1-1/+1
2013-12-09Fix bug in handling untyped, ref'ed substitution group elementsBoris Kolpackov1-10/+1
2013-11-21Add support for not cleaning generated files (m4)Boris Kolpackov2-3/+10
2013-11-16Bump version to 2.0.0Boris Kolpackov1-1/+1
2013-11-13Drop support for Xerces-C++ 2-seriesBoris Kolpackov5-78/+21
2013-07-04Handle case of unspecified element type in substitution groupBoris Kolpackov1-3/+17
2013-05-30Get rid of dependency on Boost filesystemBoris Kolpackov15-632/+67
2012-12-19Add generator that returns list of included/imported schemasBoris Kolpackov3-0/+106
2012-07-30Take into account type when resolve ref nameBoris Kolpackov1-2/+9
Apparently it is legal to have an element and an attribute with the same name.
2012-06-22Get rid of dependency on libcultBoris Kolpackov28-557/+374
2012-05-09Use standard types instead of ones from libcultBoris Kolpackov72-758/+756
2012-05-09Use standard containers instead of ones from libcultBoris Kolpackov15-329/+139
2012-05-09Use graph container from libcutl instead of libcultBoris Kolpackov17-332/+131
2012-05-07Get rid of dependency on libfrontend-elementsBoris Kolpackov48-1129/+616
Use libcutl facilities instead.
2012-05-07Use one type for structurally-equivalent anonymous typesBoris Kolpackov1-5/+299
2011-10-28Bump version to 1.19.0Boris Kolpackov1-1/+1
2011-10-28Ignore particles with minOccurs==0 and maxOccurs==0Boris Kolpackov1-158/+185
Some twisted schemas use them in inheritance-by-restriction to indicate that a particle is not allowed. The normal way to do this is simply not to have the particle.
2011-06-02Add support for fat type filesBoris Kolpackov2-5/+45
Such files also contain all the global elements that this type classifies.
2011-06-02Add accessor for facet mapBoris Kolpackov1-2/+7
2011-02-14Update NEWS file1.18.0Boris Kolpackov1-0/+8
2011-02-08Bump version to 1.18.0Boris Kolpackov1-1/+1
2011-01-04Copyright updateBoris Kolpackov106-108/+108
2010-10-11Handle multiple patternsBoris Kolpackov1-2/+16
2010-06-04Use normalized base path to construct absolute pathBoris Kolpackov1-8/+30
This prevents us from hitting a system limit on path lengths with path moving up and down with '..'.
2010-05-13Trim leading and trailing whitespaces in various XML Schema attributesxsd-fe-1.17Boris Kolpackov1-68/+144
This allows us to handle things like <element name="foo " ... />.
2010-04-27Update prerequisites information1.17.0Boris Kolpackov1-3/+3
2010-04-27Bump version to 1.17.0Boris Kolpackov1-1/+1
2010-04-27Update NEWS fileBoris Kolpackov1-0/+13
2010-04-22Name anonymous union membersBoris Kolpackov1-0/+86
They might be used via the new enum synthesis feature.
2010-04-22Update boost import stubBoris Kolpackov5-7/+32
2010-04-22Don't copy default values for non-optional attributesBoris Kolpackov1-2/+15
2010-04-15Change predicate names to end on _pBoris Kolpackov11-112/+112
2010-04-15Edges don't have annotationsBoris Kolpackov2-32/+0
2010-04-15Implement enum synthesis from unionBoris Kolpackov9-1/+474
A union which has enumerations with a common base as members can be transformed to an equivalent enumeration.
2010-04-15Rename annotated() to annotated_p(), add claer_*() to ArgumentsBoris Kolpackov4-24/+50
2010-04-15Remove unused includeBoris Kolpackov1-5/+0
2010-04-15Keep track of the Arguments edgesBoris Kolpackov2-3/+58
Also add support for removing them.
2010-04-15Make resetting functions from graph publicBoris Kolpackov1-0/+5
2010-04-15Allow resetting edges on nodesBoris Kolpackov6-10/+0
2010-04-15Remove "sink" add_edge_right from nodeBoris Kolpackov1-13/+0
To perform more complex transformations on the graph (e.g., replacing nodes) we need to track all edges pointing to the nodes.
2010-03-19Remove unneeded virtual function qualificationsBoris Kolpackov1-2/+2
2010-03-03Resolve anonymous bases in the multi-schema compilationBoris Kolpackov4-1/+65
Also, resolve anonymous specialization arguments (list and union).
2010-03-03Add union information to the semantics graphBoris Kolpackov14-29/+449
New test: union.
generated by cgit v1.1 at 2024-05-19 03:31:51 +0000