CTAN Comprehensive TeX Archive Network

Search index

The search found 16 of 170 hits in 5ms.

Business letters in the Italian style
Last modified in Catalogue: 2022-01-14 00:34
Process index output to produce typesettable code
Last modified in Catalogue: 2022-02-05 19:34
Combine single PDF files into one file
Last modified in Catalogue: 2022-03-08 08:34
Plain multilanguage support
Last modified in Catalogue: 2022-03-17 07:33
An alternative index processor to imakeidx written with Haskell
Last modified in Catalogue: 2022-04-05 22:34
Collaborative annotation tool for
Last modified in Catalogue: 2022-06-08 09:34
Class for academic works at FEI University Center — Brazil
Last modified in Catalogue: 2022-12-24 09:33
Manipulate COntent Oriented Lists
Last modified in Catalogue: 2023-05-05 10:33
Sanitize umlauts for MakeIndex and pdf
Last modified in Catalogue: 2023-05-15 20:33
Indices locorum citatorum
Last modified in Catalogue: 2023-05-17 20:33
Standard package for creating indexes
Last modified in Catalogue: 2023-06-09 12:34
Simple Belgian invoice without VAT
Last modified in Catalogue: 2023-07-06 07:33
Package for typesetting exam scripts
Last modified in Catalogue: 2023-07-10 07:33
class for No Starch Press
Last modified in Catalogue: 2023-07-19 22:33
Index citations by author names
Last modified in Catalogue: 2023-08-10 21:34
Manage and index acronyms and terms
Last modified in Catalogue: 2023-08-10 21:34

Tips for the Search

TL;DR: the extended search tries to interprete some words and characters specially. This is not just Google.

The CTAN search provides some powerful features to express the query. You can use these features to get better results. Some of the features are described here. This feature list is by far not complete. It will be extended when required.

Prefix Search

The search term is split into words. The search engine finds the items containing all search terms at the beginning of words. The comparison is performed case-insensitive.

This is the same as adding the wildcard character * to the end of all words.

Word-based Search

The search term is split into words. The search engine finds the items containing all search terms as words. The order of the words just influences the order of the hits. The comparison is performed case-insensitive.

Wildcard Search

The meta-characters * and ? can be contained in the search term to denote an arbitrary number of characters and a single character respective.

bibtool*

Note that wildcards are not allowed at the beginning of a word.

Excluding words

Prefixing a word by - or NOT (in upper case) will exclude all hits for this word from the results.

sudoku -related

sudoku NOT related

Boolean Combinations

A boolean query can be formulated with the operators AND, OR, and NOT. Parentheses can be used to group sub-expressions.

tex AND NOT knuth

Fuzzy Search

If you are not sure about the spelling of your search you can initiate a fuzzy search. For this purpose append a ~ to the search word. This search also returns hits which are not literal matches but variations thereof.

bibtol~

Note that fuzzy search usually returns lots of hits. Thus be careful.

Guest Book Sitemap Contact Contact Author