CTAN Comprehensive TeX Archive Network

Search pgf

The search found 16 of 362 hits in 5ms.

Work with some 2D TikZ commands (French)
Last modified in Catalogue: 2024-11-25 16:35
Write on grid lines
Last modified in Catalogue: 2024-11-25 16:35
Draw Bernoulli trees with TikZ
Last modified in Catalogue: 2024-11-25 16:35
Fancy QR-Codes with TikZ
Last modified in Catalogue: 2024-11-27 09:35
Extensions for graphics, plots and feynman graphs in high energy physics
Last modified in Catalogue: 2024-11-27 20:35
Draw two-dimensional Euclidean lattices with TikZ
Last modified in Catalogue: 2024-11-28 08:35
Externalization of graphics and memoization of compilation results in general
Last modified in Catalogue: 2024-12-03 07:35
Drawing little marmots in TikZ
Last modified in Catalogue: 2024-12-11 18:35
Tool for linguists and phoneticians to visualize tone value patterns
Last modified in Catalogue: 2024-12-13 10:35
Create slideshows with simple animations
Last modified in Catalogue: 2024-12-14 16:35
A 2D graphics library to draw TikZ graphics using the Lua programming language
Last modified in Catalogue: 2024-12-16 08:35
Drawing bricks with TikZ
Last modified in Catalogue: 2024-12-16 19:35
Flexible book notes in Japanese
Last modified in Catalogue: 2025-01-04 14:35
Draw Sankey diagrams with TikZ
Last modified in Catalogue: 2025-01-10 16:35
Define pgfmath functions using xfp
Last modified in Catalogue: 2025-01-11 17:35
A TikZ library for creating BPMN models
Last modified in Catalogue: 2025-01-12 08:35

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