summaryrefslogtreecommitdiff
path: root/keywords.c (follow)
Commit message (Collapse)AuthorAge
* Add missing initialisations in the 'word' structure.Simon Tatham2017-05-14
| | | | | | | | | | | The 'breaks' and 'aux' fields were filled in rather inconsistently at various places where a word is created - especially the outlying ones that manufacture pieces of document during internal processing of contents, index, bibliography, cross-references etc rather than directly from the input file. This has never led to any user-visible behaviour change that I've noticed, but it made a lot of annoying noise in the valgrind output, which got in my way last week when I was trying to debug the CHM generation.
* Revamp of the Halibut error handling mechanism.Simon Tatham2012-08-29
| | | | | | | | | | | | | | | | I'm not quite sure why I ever thought it was a good idea to have a central variadic error() function taking an integer error code followed by some list of arguments that depend on that code. It now seems obvious to me that it's a much more sensible idea to have a separate function per error, so that we can check at compile time that the arguments to each error call are of the right number and type! So I've done that instead. A side effect is that the errors are no longer formatted into a fixed-size buffer before going to stderr, so I can remove all the %.200s precautions in the format strings. [originally from svn r9639]
* Switch the memory allocation macros from the Halibut onesSimon Tatham2004-06-12
| | | | | | | | | | | | | (mknew/mknewa/resize) to the PuTTY ones (snew/snewn/sresize). snewn and mknewa have their arguments opposite ways round; this may make the change initially painful but in the long term will free me of a nasty context switch every time I move between codebases. Also sresize takes an explicit type operand which is used to cast the return value from realloc, thus enforcing that it must be correct, and arranging that if anyone tries to compile Halibut with a C++ compiler there should be a lot less pain. [originally from svn r4276]
* Oops, nearly forgot. Nesting one numbered list inside another shouldSimon Tatham2004-03-23
| | | | | | not break the numbering of the outer one! [originally from svn r3955]
* Rename Buttress to Halibut. I _think_ I've caught everything in this pass.Simon Tatham2002-08-05
| | | | [originally from svn r1800]
* Keywords are now collected using a B-tree rather than an array withSimon Tatham2001-12-14
| | | | | | | | heapsort. This makes the code much simpler for a start, but the main reason is so that we can spot duplicate keywords as we go along rather than having to wait until the end of input processing. [originally from svn r1489]
* This update should bring the Windows Help back end up toSimon Tatham2001-12-04
| | | | | | | near-complete functionality. All that's missing now is indexing and horizontal rules. [originally from svn r1449]
* Introduce the ability to relabel a section as an `example' orSimon Tatham2001-11-24
| | | | | | | | | | | | | | `question' or so on, using the syntax \S{mysection}{example} An example of foobar so that in cross-references it will be referred to as `example 5.1.2' instead of `section 5.1.2'. NOTE WELL: until now Buttress has supported multiple section keywords using the same syntax, so that you could xref the above section as \k{mysection} _or_ \k{example} with the same effect. This behaviour is now revoked because I don't think anyone was using it; if you suddenly find you're getting undefined-keyword errors this may be why. [originally from svn r1408]
* Oops, that new heading-level error check was a bit over-zealous.Simon Tatham2001-10-26
| | | | | | Fixed again. [originally from svn r1330]
* Enforce proper ordering of heading levels: specifically, ensure theSimon Tatham2001-10-25
| | | | | | | | | | user doesn't skip a heading level (\H before any \C or \A, or \S straight after \C with no intervening \H). The precise criterion is that when creating section a.b.c.d, sections a.b.c, a.b and a should already exist. This ensures the section tree really is a properly formed tree with no missing nodes. [originally from svn r1329]
* Configurability backbone, and first use of itSimon Tatham1999-11-07
| | | | [originally from svn r275]
* First backend! Text output now pretty much works.Simon Tatham1999-10-20
| | | | [originally from svn r240]
* Further development; mid-end index handling pretty much there!Simon Tatham1999-10-18
| | | | [originally from svn r238]
* Further development: index work, phase ISimon Tatham1999-10-16
| | | | [originally from svn r237]
* Redo memory allocation to use mknew macroSimon Tatham1999-09-02
| | | | [originally from svn r214]
* Further development; bibliographies seem to workSimon Tatham1999-08-15
| | | | [originally from svn r200]
* More development; not nearly finished yetSimon Tatham1999-08-09
[originally from svn r193]