Datasets:
OpenTransformer
/
scraped-web-data

Dataset card Data Studio Files
xet
 Community
url
stringlengths
11
2.25k
text
stringlengths
88
50k
ts
timestamp[s]date
2026-01-13 08:47:33
2026-01-13 09:30:40
http://hackage.haskell.org/package/semigroupoids-1.2.6.1/docs/doc-index.html
semigroupoids-1.2.6.1: Haskell 98 semigroupoids: Category sans id (Index) Contents Index semigroupoids-1.2.6.1: Haskell 98 semigroupoids: Category sans id Index $> Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus -<- Data.Functor.Bind -<< Data.Functor.Bind ->- Data.Functor.Bind .> Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus <!> Data.Functor.Alt , Data.Functor.Plus <$ Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus <$> Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus <. Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus <..> Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus <.> Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus >>- Data.Functor.Bind Alt Data.Functor.Alt , Data.Functor.Plus apDefault Data.Functor.Bind Apply Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus Bind Data.Functor.Bind BindTrans Data.Functor.Bind.Trans Dual   1 (Type/Class) Data.Semigroupoid.Dual 2 (Data Constructor) Data.Semigroupoid.Dual fmap Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus fold1 Data.Semigroup.Foldable Foldable1 Data.Semigroup.Foldable foldMap1 Data.Semigroup.Foldable foldMap1Default Data.Semigroup.Traversable foldMapDefault1 Data.Semigroup.Foldable for1_ Data.Semigroup.Foldable Functor Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus getDual Data.Semigroupoid.Dual getSemi Data.Semigroupoid join Data.Functor.Bind liftB Data.Functor.Bind.Trans liftF2 Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus liftF3 Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus many Data.Functor.Alt , Data.Functor.Plus MaybeApply   1 (Type/Class) Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus 2 (Data Constructor) Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus o Data.Semigroupoid Plus Data.Functor.Plus returning Data.Functor.Bind runMaybeApply Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus runStatic Data.Semigroupoid.Static Semi   1 (Type/Class) Data.Semigroupoid 2 (Data Constructor) Data.Semigroupoid Semigroupoid Data.Semigroupoid sequence1 Data.Semigroup.Traversable sequenceA1_ Data.Semigroup.Foldable some Data.Functor.Alt , Data.Functor.Plus Static   1 (Type/Class) Data.Semigroupoid.Static 2 (Data Constructor) Data.Semigroupoid.Static Traversable1 Data.Semigroup.Traversable traverse1 Data.Semigroup.Traversable traverse1_ Data.Semigroup.Foldable unwrapApplicative Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus unwrapCategory Data.Semigroupoid WrapApplicative Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus WrapCategory Data.Semigroupoid WrappedApplicative Data.Functor.Bind , Data.Functor.Apply , Data.Functor.Alt, Data.Functor.Plus WrappedCategory Data.Semigroupoid zero Data.Functor.Plus Produced by Haddock version 2.10.0
2026-01-13T09:30:25
http://mirror.datacenter.by/debian-cd/
Welcome to mirror.datacenter.by , FOSS mirror hosted at Beltelecom datacenter (55, Zaharova str., Minsk, Belarus) Hardware: 2 x Intel(R) Xeon(R) E5606 CPU @ 2.13GHz, 12 GB DDR3, 20TB disk enclosure with 240Gb SSD cache, 2Gbps bandwidth Accessible both via IPv4 178.124.134.106 and IPv6 2a02:2208:1:3::12 Hardware sponsored by: beltelecom.by , hoster.by Mirror supported by the community. This host is a part of NTP Pool Project . Use by.pool.ntp.org for time sync. Contacts: Index of /debian-cd/ Index of /debian-cd/ ../ 13.3.0/ 10-Jan-2026 21:07 - 13.3.0-live/ 10-Jan-2026 21:07 - current/ 10-Jan-2026 21:07 - current-live/ 10-Jan-2026 21:07 - project/ 23-May-2005 16:50 - ls-lR.gz 12-Jan-2026 15:12 10927
2026-01-13T09:30:25
http://hackage.haskell.org/package/semigroupoids-1.2.6.1/docs/Data-Semigroup-Traversable.html
Data.Semigroup.Traversable Source Contents Index semigroupoids-1.2.6.1: Haskell 98 semigroupoids: Category sans id Portability portable Stability provisional Maintainer Edward Kmett <ekmett@gmail.com> Safe Haskell Safe-Infered Data.Semigroup.Traversable Description   Documentation class ( Foldable1 t, Traversable t) => Traversable1 t where Source Methods traverse1 :: Apply f => (a -> f b) -> t a -> f (t b) Source sequence1 :: Apply f => t (f b) -> f (t b) Source Instances Traversable1 Tree   Traversable1 NonEmpty   Traversable1 Identity   Traversable1 f => Traversable1 ( IdentityT f)   ( Traversable1 f, Traversable1 g) => Traversable1 ( Compose f g)   ( Traversable1 f, Traversable1 g) => Traversable1 ( Product f g)   foldMap1Default :: ( Traversable1 f, Semigroup m) => (a -> m) -> f a -> m Source Produced by Haddock version 2.10.0
2026-01-13T09:30:25
http://hackage.haskell.org/package/semigroupoids-1.2.6.1/docs/Data-Functor-Alt.html
Data.Functor.Alt Source Contents Index semigroupoids-1.2.6.1: Haskell 98 semigroupoids: Category sans id Portability portable Stability provisional Maintainer Edward Kmett <ekmett@gmail.com> Safe Haskell Safe-Infered Data.Functor.Alt Description   Synopsis class Functor f => Alt f where (<!>) :: f a -> f a -> f a some :: Applicative f => f a -> f [a] many :: Applicative f => f a -> f [a] module Data.Functor.Apply Documentation class Functor f => Alt f where Source Laws: <!> is associative: (a <!> b) <!> c = a <!> (b <!> c) <$> left-distributes over <!>: f <$> (a <!> b) = (f <$> a) <!> (f <$> b) If extended to an Alternative then <!> should equal <|> . Ideally, an instance of Alt also satisfies the "left distributon" law of MonadPlus with respect to . : <.> right-distributes over <!>: (a <!> b) <.> c = (a <.> c) <!> (b <.> c) But Maybe , IO , Either a , ErrorT e m , and STM satisfy the alternative "left catch" law instead: pure a <!> b = pure a However, this variation cannot be stated purely in terms of the dependencies of Alt . When and if MonadPlus is successfully refactored, this class should also be refactored to remove these instances. The right distributive law should extend in the cases where the a Bind or Monad is provided to yield variations of the right distributive law: (m <!> n) >>- f = (m >>- f) <!> (m >>- f) (m <!> n) >>= f = (m >>= f) <!> (m >>= f) Methods (<!>) :: f a -> f a -> f a Source ( | ) without a required empty some :: Applicative f => f a -> f [a] Source many :: Applicative f => f a -> f [a] Source Instances Alt []   Alt IO This instance does not actually satisfy the ( . ) right distributive law It instead satisfies the Left-Catch law Alt Maybe   Alt Seq   Alt IntMap   Alt Option   Alt NonEmpty   Alt ( Either a)   MonadPlus m => Alt ( WrappedMonad m)   Ord k => Alt ( Map k)   ( Bind f, Monad f) => Alt ( MaybeT f)   Apply f => Alt ( ListT f)   Alt f => Alt ( IdentityT f)   Alternative f => Alt ( WrappedApplicative f)   ArrowPlus a => Alt ( WrappedArrow a b)   Alt f => Alt ( WriterT w f)   Alt f => Alt ( WriterT w f)   Alt f => Alt ( StateT e f)   Alt f => Alt ( StateT e f)   Alt f => Alt ( ReaderT e f)   ( Bind f, Monad f) => Alt ( ErrorT e f)   Alt f => Alt ( Static f a)   Alt f => Alt ( RWST r w s f)   Alt f => Alt ( RWST r w s f)   module Data.Functor.Apply Produced by Haddock version 2.10.0
2026-01-13T09:30:25
https://upsilon.cc/~zack/research/
research zack's home page / research home research publications committees teaching hacking debian software talks blog about My main job is doing research (and teaching ) at the Laboratoire PPS of the Université Paris Diderot - Paris 7 . My current and not-so current research interests are summarized below, a list of my publications is available from a separate page . research interests free software and how formal methods can be applied to address the complexity of the scenarios brought by the open source development model. I'm currently a member of the mancoosi research project, which is addressing some of this challenges, in particular the upgrade problem of packages in GNU/Linux distributions type theory and in particular proof assistants / interactive theorem provers. I've been one of the architect of the Matita proof assistant , though now I'm contributing code more sparingly; both my master and Ph.D. theses have been about Matita. I've also worked on distributed digital libraries of formalized mathematics, such as the HELM library web technologies , in particular: type systems for typing XML trees (I'm currently a member of W3C 's XML Schema working group ) and document validation, overlapping markup, web collaboration (as in wiki s) and its interaction with content constraints publications A list of my publications is available on a dedicated page . committees I've been involved in a number of scientific committees . Copyright © 2007-2022 by Stefano Zacchiroli <zack@upsilon.cc> Homepage by Stefano Zacchiroli is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License . Last edited Fri 01 Apr 2016 02:53:54 PM CEST Fri 21 Dec 2007 05:30:26 PM CET -->
2026-01-13T09:30:25
https://upsilon.cc/~zack/blog/posts/2009/12/podcast_di_caterpillar:_da_fan_per_i_fan/
podcast di caterpillar: da fan per i fan zack's home page / blog / posts / 2009 / 12 / podcast di caterpillar: da fan per i fan podcast non ufficiale di Caterpillar: senza attese! update 2014 : purtroppo, il servizio drivecast sul quale mi basavo per offire questo Podcast non offre più la possibilità di registrare emittenti radio. Sembra sia così da inizio 2014 ed i "feed" pre-esistenti che si basavano su emittenti radio (come questo mio) sono stati rimossi. Di conseguenza questo servizio di podcast non ufficiale è sospeso . Se siete a conoscenza di servizi alternativi a drivecast per ripristinare il servizio fatemi sapere . short story Qua potete trovare un podcast di Caterpillar non ufficiale , con tanto di musica, pubblicità che ne paga i diritti (che quindi siete pregati di ascoltare); le puntate sono disponibili subito dopo la fine delle trasmissioni , solitamente 5 minuti dopo la fine delle stesse, da lunedì a venerdì. L'interesse principale sta in quest'ultimo aspetto, dato che il podcast ufficiale di Caterpillar è aggiornato il primo giorno lavorativo successivo (... quando va bene e con calma) ad ogni emissione radiofonica. long story Come sapete sono un fan di Caterpillar : più che una trasmissione radiofonica, uno stile di vita . È uno dei contatti culturali con l'Italia dai quali ne riesco ne voglio separarmi, nella mia vita da emigrato. Pago ancora il canone Rai , nonostante non possegga più una televisione in Italia, solo perché so (mi illudo?) che parte del suo importo serve a pagare lo stipendio del Dott. Cirri, del Dott. Solibello e della ottima redazione della quale fanno parte. Da molti anni quindi porto con me (in USA, in Francia, alle conferenze) il podcast di Caterpillar per ascoltarlo quando altri svaghi come leggere sono meno praticabili, e.g. quando sono in bici. A partire dalla stagione scorsa sono orgoglioso di non avere perso nemmeno una puntata dell'intera stagione di Caterpillar. Ciò nonostante, devo riconoscere che il podcast di Caterpillar è veramente "difettoso". Il problema principale è la cadenza dell'aggiornamento : viene aggiornato nella tarda mattinata del primo giorno lavorativo successivo alla messa in onda della emissione corrispondente. Considerando la natura giornalistica e di attualità di molti servizi, questo aspetto risulta particolarmente fastidioso. Nondimeno è possibile "aggirare" questo problema con l'ascolto in diretta, dato che la webradio non è poi così tanto praticabile: le disconnessioni sono all'ordine del giorno. La pubblicazione del podcast poi non è affidabile: a volte, ad esempio quando la troupe è in trasferta, si verificano ritardi di pubblicazione di uno o più giorni lavorativi . Infine, il confronto con il podcast di Radio France (disponibile pochi minuti dopo la fine di ogni emissione) è assolutamente a sfavore di Radio 2: sarò diventato troppo filo francese? Per concludere lo sfogo, da informatico quale sono ho l'impressione che gli episodi del podcast siano pubblicati a mano dal webmaster, il che ha un che di sorprendente dato che, avendo a disposizioni tutte le informazioni necessarie, il task è completamente (e facilmente) automatizzabile . Ergo, se si ammala il webmaster o chi per lui il podcast non viene pubblicato. Assurdo. Il mio contributo qui è quindi una sorta di protesta non violenta : usando il servizio DriveCast ho creato il mio podcast non ufficiale di Caterpillar . Lo rendo qui pubblico per gli ascoltatori insoddisfatti come me dall'attuale servizio: http://upsilon.cc/~zack/podcast/drivecast.rss Purtroppo, non sono in grado di dare esattamente lo stesso contenuto del podcast ufficiale, principalmente perché mi mancano le seguenti informazioni: minutaggio di inizio/fine degli stacchi musicali (che loro tagliano, probabilmente per ragioni di diritti, nonostante un paio di anni fa li pubblicassero interamente) minutaggio di inizio/fine degli stacchi pubblicitari (che loro tagliano parimenti) Il "mio" podcast contiene quindi sia pubblicità che musica , nella speranza che il distribuire la pubblicità sia sufficiente a pagare la musica distribuita. Solitamente, DriveCast rende disponibile gli episodi pochi minuti dopo la fine della registrazione (da 5 a 7 minuti, nei miei test di questi giorni natalizi). È illegale tutto questo? Purtroppo, per i soliti (stupidi?) motivi contrattuali di diritti musicali è molto probabile che lo sia ( IANAL ), nonostante le mie buone intenzioni di ripagare la (loro) musica con la (loro stessa) pubblicità. Io pubblico comunque il feed e qui faccio autodenuncia. Vedremo. Inoltre, se qualcuno ha idea di come avere accesso alle informazioni di minutaggio necessarie, sono disponibile a scrivere il software necessario a tagliare in automatico gli stacchi musicali e pubblicitari. Se pensate di usare il podcast in quanto preferibile rispetto a quello ufficiale, vi prego di segnalarlo (via mail o lasciando un commento ), a mo di "peer pressure" nei confronti della redazione e/o di Radio Rai in modo che migliori il servizio di podcast. Da parte mia, invierò testé alla redazione un link a questo post. Buon ascolto! Tags: caterpillar italy lang/italian podcast radio radio2 rai Copyright © 2007-2022 by Stefano Zacchiroli <zack@upsilon.cc> Homepage by Stefano Zacchiroli is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License . Last edited Tue 14 Jan 2014 10:19:12 AM CET Tue 29 Dec 2009 03:51:10 PM CET -->
2026-01-13T09:30:25
https://www.debian.org/releases/stable/amd64/apa
Appendix A. Installation Howto Appendix A. Installation Howto       Appendix A. Installation Howto Table of Contents A.1. Preliminaries A.2. Booting the installer A.2.1. Optical disc A.2.2. USB memory stick A.2.3. Booting from network A.2.4. Booting from hard disk A.3. Installation A.4. Send us an installation report A.5. And finally… This document describes how to install Debian GNU/Linux trixie for the 64-bit PC ( “ amd64 ” ) with the new debian-installer . It is a quick walkthrough of the installation process which should contain all the information you will need for most installs. When more information can be useful, we will link to more detailed explanations in other parts of this document.       8.6. Recovering a Broken System   A.1. Preliminaries
2026-01-13T09:30:25
https://rubygems.org/gems/american_date
american_date | RubyGems.org | your community gem host ⬢ RubyGems nav#focus mousedown->nav#mouseDown click@window->nav#hide"> Navigation menu autocomplete#choose mouseover->autocomplete#highlight"> Search Gems… Releases Blog Gems Guides Sign in Sign up american_date 1.3.0 American style month/day/year date parsing for ruby 1.9+ Gemfile: = install: = Versions: 1.3.0 July 13, 2023 (7 KB) 1.2.0 November 17, 2021 (8.5 KB) 1.1.1 October 28, 2015 (8 KB) 1.1.0 March 22, 2013 (8 KB) 1.0.1 March 20, 2013 (7.5 KB) Show all versions (6 total) Development Dependencies (2): minitest >= 5 minitest-global_expectations >= 0 Show all transitive dependencies Owners: Pushed by: Authors: Jeremy Evans SHA 256 checksum: = ← Previous version Total downloads 13,151,314 For this version 1,361,143 Version Released: July 13, 2023 2:53pm License: MIT Required Ruby Version: >= 0 Links: Homepage Changelog Bug Tracker Download Review changes Badge Subscribe RSS Report abuse Reverse dependencies Status Uptime Code Data Stats Contribute About Help API Policies Support Us Security RubyGems.org is the Ruby community’s gem hosting service. Instantly publish your gems and then install them . Use the API to find out more about available gems . Become a contributor and improve the site yourself. The RubyGems.org website and service are maintained and operated by Ruby Central’s Open Source Program and the RubyGems team. It is funded by the greater Ruby community through support from sponsors, members, and infrastructure donations. If you build with Ruby and believe in our mission, you can join us in keeping RubyGems.org, RubyGems, and Bundler secure and sustainable for years to come by contributing here . Operated by Ruby Central Designed by DockYard Hosted by AWS Resolved with DNSimple Monitored by Datadog Gems served by Fastly Monitored by Honeybadger Secured by Mend.io English Nederlands 简体中文 正體中文 Português do Brasil Français Español Deutsch 日本語
2026-01-13T09:30:25
https://www.unicode.org/glossary/#UCS
Glossary Glossary Tech Site | Site Map | Search   Glossary of Unicode Terms   A B C D E F G H I J K L M N O P-Q R S T U V W X-Y Z This glossary is updated periodically to stay synchronized with changes to various standards maintained by the Unicode Consortium. See About Unicode Terminology for translations of various terms. There is also an FAQ section on the website. A Abjad . A writing system in which only consonants are indicated. The term “abjad” is derived from the first four letters of the traditional order of the Arabic script: alef, beh, jeem, dal . (See Section 6.1, Writing Systems .) Abstract Character . A unit of information used for the organization, control, or representation of textual data. (See definition D7 in Section 3.4, Characters and Encoding .) Abstract Character Sequence . An ordered sequence of one or more abstract characters. (See definition D8 in Section 3.4, Characters and Encoding .) Abugida . A writing system in which consonants are indicated by the base letters that have an inherent vowel, and in which other vowels are indicated by additional distinguishing marks of some kind modifying the base letter. The term “abugida” is derived from the first four letters of the Ethiopic script in the Semitic order: alf, bet, gaml, dant . (See Section 6.1, Writing Systems .) Accent Mark . A mark placed above, below, or to the side of a character to alter its phonetic value. (See also diacritic .) Acrophonic . Denoting letters or numbers by the first letter of their name. For example, the Greek acrophonic numerals are variant forms of such initial letters. Aksara . (1) In Sanskrit grammar, the term for “letter” in general, as opposed to consonant ( vyanjana ) or vowel ( svara ). Derived from the first and last letters of the traditional ordering of Sanskrit letters—“a” and “ksha”. (2) More generally, in Indic writing systems, aksara refers to an orthographic syllable . Algorithm . A term used in a broad sense in the Unicode Standard, to mean the logical description of a process used to achieve a specified result. This does not require the actual procedure described in the algorithm to be followed; any implementation is conformant as long as the results are the same. Alphabet . A writing system in which both consonants and vowels are indicated. The term “alphabet” is derived from the first two letters of the Greek script: alpha, beta . (See Section 6.1, Writing Systems .) Alphabetic Property . Informative property of the primary units of alphabets and/or syllabaries. (See Section 4.10, Letters, Alphabetic, and Ideographic .) Alphabetic Sorting . (See collation .) AMTRA . Acronym for Arabic Mark Transient Reordering Algorithm . (See Unicode Standard Annex #53, “Unicode Arabic Mark Rendering.” ) Annotation . The association of secondary textual content with a point or range of the primary text. (The value of a particular annotation is considered to be a part of the “content” of the text. Typical examples include glossing, citations, exemplification, Japanese yomi, and so on.) ANSI .  (1) The American National Standards Institute. (2) The Microsoft collective name for all Windows code pages. Sometimes used specifically for code page 1252, which is a superset of ISO/IEC 8859-1. Apparatus Criticus . Collection of conventions used by editors to annotate and comment on text. Arabic Digits . The term "Arabic digits" may mean either the digits in the Arabic script (see Arabic-Indic digits ) or the ordinary ASCII digits in contrast to Roman numerals (see European digits ). When the term "Arabic digits" is used in Unicode specifications, it means Arabic-Indic digits. See Terminology for Digits for additional information on terminology related to digits. Arabic-Indic Digits . Forms of decimal digits used in most parts of the Arabic world (for instance, U+0660, U+0661, U+0662, U+0663). Although European digits (1, 2, 3,…) derive historically from these forms, they are visually distinct and are coded separately. (Arabic-Indic digits are sometimes called Indic numerals; however, this nomenclature leads to confusion with the digits currently used with the scripts of India.) Variant forms of Arabic-Indic digits used chiefly in Iran and Pakistan are referred to as Eastern Arabic-Indic digits . (See Section 9.2, Arabic .) See Terminology for Digits for additional information on terminology related to digits. ASCII . (1) The American Standard Code for Information Interchange, a 7-bit coded character set for information interchange. It is the U.S. national variant of ISO/IEC 646 and is formally the U.S. standard ANSI X3.4. It was proposed by ANSI in 1963 and finalized in 1968. (2) The set of 128 Unicode characters from U+0000 to U+007F, including control codes as well as graphic characters. (3) ASCII has been incorrectly used to refer to various 8-bit character encodings that include ASCII characters in the first 128 code points. ASCII digits . The digit characters U+0030 to U+0039. Also known as European digits . See Terminology for Digits for additional information on terminology related to digits. Assigned Character .  A code point that is assigned to an abstract character. This refers to graphic, format, control, and private-use characters that have been encoded in the Unicode Standard. (See Section 2.4, Code Points and Characters .) Assigned Code Point .  (See designated code point .) Atomic Character .  A character that is not decomposable. (See decomposable character .) B Base Character . Any graphic character except for those with the General Category of Combining Mark (M). (See definition D51 in Section 3.6, Combination .) In a combining character sequence, the base character is the initial character, which the combining marks are applied to. Basic Multilingual Plane . Plane 0, abbreviated as BMP. Bicameral . A script that distinguishes between two cases. (See case .) Most often used in the context of Latin-based alphabets of Europe and elsewhere in the world. Bidi . Abbreviation of bidirectional, in reference to mixed left-to-right and right-to-left text. Bidirectional Display . The process or result of mixing left-to-right text and right-to-left text in a single line. (See Unicode Standard Annex #9, “Unicode Bidirectional Algorithm.” ) Big-endian . A computer architecture that stores multiple-byte numerical values with the most significant byte (MSB) values first. Binary Files . Files containing nontextual information. Block . A grouping of characters within the Unicode encoding space used for organizing code charts. Each block is a uniquely named, continuous, non-overlapping range of code points, containing a multiple of 16 code points, and starting at a location that is a multiple of 16. A block may contain unassigned code points, which are reserved. BMP . Acronym for Basic Multilingual Plane . BMP Character . A Unicode encoded character having a BMP code point. (See supplementary character .) BMP Code Point . A Unicode code point between U+0000 and U+FFFF. (See supplementary code point .) BNF . Acronym for Backus-Naur Form , a formal meta-syntax for describing context-free syntaxes. (For details, see Appendix A, Notational Conventions .) BOCU-1 . Acronym for Binary Ordered Compression for Unicode. A Unicode compression scheme that is MIME-compatible (directly usable for e-mail) and preserves binary order, which is useful for databases and sorted lists. BOM .  Acronym for byte order mark . Bopomofo . An alphabetic script used primarily in the Republic of China (Taiwan) to write the sounds of Mandarin Chinese and some other dialects. Each symbol corresponds to either the syllable-initial or syllable-final sounds; it is therefore a subsyllabic script in its primary usage. The name is derived from the names of its first four elements. More properly known as zhuyin zimu or zhuyin fuhao in Mandarin Chinese. Boustrophedon . A pattern of writing seen in some ancient manuscripts and inscriptions, where alternate lines of text are laid out in opposite directions, and where right-to-left lines generally use glyphs mirrored from their left-to-right forms. Literally, “as the ox turns,” referring to the plowing of a field. Braille . A writing system using a series of raised dots to be read with the fingers by people who are blind or whose eyesight is not sufficient for reading printed material. (See Section 21.1, Braille .) Braille Pattern . One of the 64 (for six-dot Braille) or 256 (for eight-dot Braille) possible tangible dot combinations. Byte . (1) The minimal unit of addressable storage for a particular computer architecture. (2) An octet. Note that many early computer architectures used bytes larger than 8 bits in size, but the industry has now standardized almost uniformly on 8-bit bytes. The Unicode Standard follows the current industry practice in equating the term byte with octet and using the more familiar term byte in all contexts. (See octet .) Byte Order Mark . The Unicode character U+FEFF when used to indicate the byte order of a text. (See Section 2.13, Special Characters and Noncharacters , and Section 23.8, Specials .) Byte Serialization . The order of a series of bytes determined by a computer architecture. Byte-Swapped . Reversal of the order of a sequence of bytes. C Camelcase . A casing convention for compound terms or identifiers, in which the letters are mostly lowercased, but component words or abbreviations may be capitalized. For example, "ThreeWordTerm" or "threeWordTerm". Canonical . (1) Conforming to the general rules for encoding—that is, not compressed, compacted, or in any other form specified by a higher protocol. (2) Characteristic of a normative mapping and form of equivalence specified in Chapter 3, Conformance . Canonical Composition . A step in the algorithm for Unicode Normalization Forms, during which decomposed sequences are replaced by primary composites, where possible. (See definition D115 in Section 3.11, Normalization Forms .) Canonical Decomposable Character . A character that is not identical to its canonical decomposition. (See definition D69 in Section 3.7, Decomposition .) Canonical Decomposition . Mapping to an inherently equivalent sequence—for example, mapping ä to a +  combining umlaut. (For a full, formal definition, see definition D68 in Section 3.7, Decomposition .) Canonical Equivalence . The relation between two character sequences whose full canonical decompositions are identical. (See definition D70 in Section 3.7, Decomposition .) Canonical Equivalent . Two character sequences are said to be canonical equivalents if their full canonical decompositions are identical. (See definition D70 in Section 3.7, Decomposition .) Canonical Ordering . The order of a combining character sequence that results from the application of the Canonical Ordering Algorithm, a step in the process of normalization of strings. See definition D109 in Section 3.11, Normalization Forms . Cantillation Mark . A mark that is used to indicate how a text is to be chanted or sung. Capital Letter . Synonym for uppercase letter . (See case .) Case . (1) Feature of certain alphabets where the letters have two distinct forms. These variants, which may differ markedly in shape and size, are called the uppercase letter (also known as capital or majuscule ) and the lowercase letter (also known as small or minuscule ). (2) Normative property of characters, consisting of uppercase, lowercase, and titlecase (Lu, Ll, and Lt). (See Section 4.2, Case .) Case Folding . The mapping of strings to a particular case form, to facilitate searching and sorting of text. Case foldings may be simple, when the case mappings are required not to change the length of the strings to compare, or full, when the case mappings may change the length of the strings to compare. (See Section 3.13.3, Default Case Folding .) Case Mapping . The association of the uppercase, lowercase, and titlecase forms of a letter. (See Section 5.18, Case Mappings .) Case-Ignorable . A character C is defined to be case-ignorable if C has the value MidLetter (ML), MidNumLet (MB), or Single_Quote (SQ) for the Word_Break property or its General_Category is one of Nonspacing_Mark (Mn), Enclosing_Mark (Me), Format (Cf), Modifier_Letter (Lm), or Modifier_Symbol (Sk). (See definition D136 in Section 3.13, Default Case Algorithms .) Case-Ignorable Sequence . A sequence of zero or more case-ignorable characters. (See definition D137 in Section 3.13, Default Case Algorithms .) CCC . Short name for the Canonical_Combining_Class property, usually lowercased: ccc. CCS . (1) Acronym for coded character set . (2) Also used as an acronym for combining character sequence . Cedilla . A mark originally placed beneath the letter c in French, Portuguese, and Spanish to indicate that the letter is to be pronounced as an s, as in façade . Obsolete Spanish diminutive of ceda , the letter z . CEF . Acronym for character encoding form . CES . Acronym for character encoding scheme . Character . (1) The smallest component of written language that has semantic value; refers to the abstract meaning and/or shape, rather than a specific shape (see also glyph ), though in code tables some form of visual representation is essential for the reader’s understanding. (2) Synonym for abstract character . (3) The basic unit of encoding for the Unicode character encoding. (4) The English name for the ideographic written elements of Chinese origin. [See ideograph (2).] Character Block . (See block .) Character Class . A set of characters sharing a particular set of properties. Character Encoding Form . Mapping from a character set definition to the actual code units used to represent the data. Character Encoding Scheme . A character encoding form plus byte serialization. There are seven character encoding schemes in Unicode: UTF-8, UTF-16, UTF-16BE, UTF-16LE, UTF-32, UTF-32BE, and UTF-32LE. Character Entity . Expression of the form & for "&" or   for the no-break space. These are found in markup language files like HTML or XML. There are also numerically defined character entities. (See also character escape .) Character Escape . A numerical expression of the form \uXXXX, \xXXXX or &#xXXXX; where X is a hex digit, or &#dddd; where d is a decimal digit. These are found in programming source code or markup language files (such as HTML or XML). Character Name . A unique string used to identify each abstract character encoded in the standard. (See definition D4 in Section 3.3, Semantics .) Character Name Alias . An additional unique string identifier, other than the character name, associated with an encoded character in the standard. (See definition D5 in Section 3.3, Semantics .) Character Properties . A set of property names and property values associated with individual characters. (See Chapter 4, Character Properties .) Character Repertoire . The collection of characters included in a character set. Character Sequence . Synonym for abstract character sequence . Character Set . A collection of elements used to represent textual information. Charset . (See coded character set .) Chillu . Abbreviation for chilaaksharam (singular) ( cillakṣaram ). Refers to any of a set of sonorant consonants in Malayalam, when appearing in syllable-final position with no inherent vowel. Choseong . A sequence of one or more leading consonants in Korean. Chu Hán . The name for Han characters used in Vietnam; derived from hànzì . Chu Nôm . A demotic script of Vietnam developed from components of Han characters. Its creators used methods similar to those used by the Chinese in creating Han characters. CJK . Acronym for Chinese, Japanese, and Korean. A variant, CJKV , means Chinese, Japanese, Korean, and Vietnamese. CJK Unified Ideograph . A Han character that has undergone the process of Han unification (conducted primarily by the Ideographic Research Group) and been encoded as a single ideograph with one or more clearly identified CJK source mappings. CJK unified ideographs have no decomposition mappings, and the set of them in the Unicode Standard is normatively specified by the Unified_Ideograph property. CLDR . (See Unicode Common Locale Data Repository .) Coded Character . (See encoded character .) Coded Character Representation . Synonym for coded character sequence . Coded Character Sequence . An ordered sequence of one or more code points. Normally, this consists of a sequence of encoded characters, but it may also include noncharacters or reserved code points. (See definition D12 in Section 3.4, Characters and Encoding .) Coded Character Set . A character set in which each character is assigned a numeric code point. Frequently abbreviated as character set, charset , or code set ; the acronym CCS is also used. Code Page . A coded character set, often referring to a coded character set used by a personal computer—for example, PC code page 437, the default coded character set used by the U.S. English version of the DOS operating system. Code Point . (1) Any value in the Unicode codespace; that is, the range of integers from 0 to 10FFFF 16 . (See definition D10 in Section 3.4, Characters and Encoding .) Not all code points are assigned to encoded characters. See code point type . (2) A value, or position, for a character, in any coded character set. Code Point Type . Any of the seven fundamental classes of code points in the standard: Graphic, Format, Control, Private-Use, Surrogate, Noncharacter, Reserved. (See definition D10a in Section 3.4, Characters and Encoding .) Code Position . Synonym for code point . Used in ISO character encoding standards. Code Set . (See coded character set .) Codespace . (1) A range of numerical values available for encoding characters. (2) For the Unicode Standard, a range of integers from 0 to 10FFFF 16 . (See definition D9 in Section 3.4, Characters and Encoding .) Code Unit . The minimal bit combination that can represent a unit of encoded text for processing or interchange. The Unicode Standard uses 8-bit code units in the UTF-8 encoding form, 16-bit code units in the UTF-16 encoding form, and 32-bit code units in the UTF-32 encoding form. (See definition D77 in Section 3.9, Unicode Encoding Forms .) Code Value . Obsolete synonym for code unit . Codomain . For a mapping, the codomain is the set of code points or sequences that it maps to, while the domain is the set of values that are mapped. For example, a canonical decomposition is a mapping from a set of code points to a set of sequences; the codomain is the set of canonical equivalent mappings. (See also domain .) Collation . The process of ordering units of textual information. Collation is usually specific to a particular language. Also known as alphabetizing or alphabetic sorting . Unicode Technical Standard #10, “Unicode Collation Algorithm," defines a complete, unambiguous, specified ordering for all characters in the Unicode Standard. Combining Character . A character with the General Category of Combining Mark (M). (See definition D52 in Section 3.6, Combination .) (See also nonspacing mark .) Combining Character Sequence . A maximal character sequence consisting of either a base character followed by a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner ; or a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner . (See definition D56 in Section 3.6, Combination .) Combining Class . A numeric value in the range 0..254 given to each Unicode code point, formally defined as the property Canonical_Combining_Class. (See definition D104 in Section 3.11, Normalization Forms .) Combining Mark . A commonly used synonym for combining character . Compatibility . (1) Consistency with existing practice or preexisting character encoding standards. (2) Characteristic of a normative mapping and form of equivalence specified in Section 3.7, Decomposition . Compatibility Character . A character that would not have been encoded except for compatibility and round-trip convertibility with other standards. (See Section 2.3, Compatibility Characters .) Compatibility Composite Character . Synonym for compatibility decomposable character . Compatibility Decomposable Character . A character whose compatibility decomposition is not identical to its canonical decomposition. (See definition D66 in Section 3.7, Decomposition .) Compatibility Decomposition . Mapping to a roughly equivalent sequence that may differ in style. (For a full, formal definition, see definition D65 in Section 3.7, Decomposition .) Compatibility Equivalence . The relation between two character sequences whose full compatibility decompositions are identical. (See definition D67 in Section 3.7, Decomposition .) Compatibility Equivalent . Two character sequences are said to be compatibility equivalents if their full compatibility decompositions are identical. (See definition D67 in Section 3.7, Decomposition .) Compatibility Ideograph . A Han character encoded for compatibility with some East Asian character encoding, but which is not encoded as a CJK unified ideograph . Instead, each compatibility ideograph has a canonical decomposition mapping to a particular CJK unified ideograph. Compatibility Precomposed Character . Synonym for compatibility decomposable character . Compatibility Variant . A character that generally can be remapped to another character without loss of information other than formatting. Composite Character . (See decomposable character .) Composite Character Sequence . (See combining character sequence .) Composition Exclusion . A Canonical Decomposable Character which has the property value Composition_Exclusion=True. (Used in the definition of Unicode Normalization Forms.) (See definition D112 in Section 3.11, Normalization Forms .) Conformance . Adherence to a specified set of criteria for use of a standard. (See Chapter 3, Conformance .) Confusable . Of similar or identical appearance. When referring to characters in strings, the appearance of confusable characters can make different identifiers hard or impossible to distinguish. (See also Unicode Technical Standard #39, "Unicode Security Mechanisms" .) Conjunct Form . A ligated form representing a consonant conjunct . Consonant Cluster .  A sequence of two or more consonantal sounds. Depending on the writing system, a consonant cluster may be represented by a single character or by a sequence of characters. (Contrast digraph .) Consonant Conjunct . A sequence of two or more adjacent consonantal letterforms, consisting of a sequence of one or more dead consonants followed by a normal, live consonant letter. A consonant conjunct may be ligated into a single conjunct form, or it may be represented by graphically separable parts, such as subscripted forms of the consonant letters. Consonant conjuncts are associated with the Brahmi family of Indic scripts. (See Section 12.1, Devanagari .) Contextual Variant . A text element can have a presentation form that depends on the textual context in which it is rendered. This presentation form is known as a contextual variant . Contributory Property . A simple property defined merely to make the statement of a rule defining a derived property more compact or general. (See definition D35a in Section 3.5, Properties .) Control Codes . The 65 characters in the ranges U+0000..U+001F and U+007F..U+009F. Also known as control characters . Core Specification . The central part of the Unicode Standard–the portion which up until Version 5.0 was published as a separate book. Starting with Version 5.2, this part of the standard has been published online only, rather than as a book. The core specification consists of the general introduction and framework for the standard, the formal conformance requirements, many implementation guidelines, and extensive chapters providing information about all the encoded characters, organized by script or by significant classes of characters. Formally, a version of the Unicode Standard is defined by an edition of this core specification, together with the Code Charts , Unicode Standard Annexes , and the Unicode Character Database Cursive . Writing where the letters of a word are connected. D Dasia . Greek term for rough breathing mark, used in polytonic Greek character names. DBCS . Acronym for double-byte character set . Dead Consonant . An Indic consonant character followed by a virama character. This sequence indicates that the consonant has lost its inherent vowel. (See Section 12.1, Devanagari .) Decimal Digits . Digits that can be used to form decimal-radix numbers. Decomposable Character . A character that is equivalent to a sequence of one or more other characters, according to the decomposition mappings found in the Unicode Character Database, and those described in Section 3.12, Conjoining Jamo Behavior . It may also be known as a precomposed character or a composite character. (See definition D63 in Section 3.7, Decomposition .) Decomposition . (1) The process of separating or analyzing a text element into component units. These component units may not have any functional status, but may be simply formal units—that is, abstract shapes. (2) A sequence of one or more characters that is equivalent to a decomposable character. (See definition D64 in Section 3.7, Decomposition .) Decomposition Mapping . A mapping from a character to a sequence of one or more characters that is a canonical or compatibility equivalent and that is listed in the character names list or described in Section 3.12, Conjoining Jamo Behavior . (See definition D62 in Section 3.7, Decomposition .) Default Ignorable . Default ignorable code points are those that should be ignored by default in rendering unless explicitly supported. They have no visible glyph or advance width in and of themselves, although they may affect the display, positioning, or adornment of adjacent or surrounding characters. (See Section 5.21, Ignoring Characters in Processing .) Defective Combining Character Sequence . A combining character sequence that does not start with a base character. (See definition D57 in Section 3.6, Combination .) Demotic Script . (1) A script or a form of a script used to write the vernacular or common speech of some language community. (2) A simplified form of the ancient Egyptian hieratic writing. Dependent Vowel . A symbol or sign that represents a vowel and that is attached or combined with another symbol, usually one that represents a consonant. For example, in writing systems based on Arabic, Hebrew, and Indic scripts, vowels are normally represented as dependent vowel signs. Deprecated . Of a coded character or a character property, strongly discouraged from use. (Not the same as obsolete .) Deprecated Character . A coded character whose use is strongly discouraged. Such characters are retained in the standard, indefinitely but should not be used. (See definition D13 in Section 3.4, Characters and Encoding .) Designated Code Point . Any code point that has either been assigned to an abstract character ( assigned characters ) or that has otherwise been given a normative function by the standard (surrogate code points and noncharacters). This definition excludes reserved code points. Also known as assigned code point . (See Section 2.4 Code Points and Characters .) Deterministic Comparison . A string comparison in which strings that do not have identical contents will compare as unequal. There are two main varieties, depending on the sense of "identical:" (a) binary equality, or (b) canonical equivalence. This is a property of the comparison mechanism, and not of the sorting algorithm. Also known as stable (or semi-stable ) comparison . Deterministic Sort . A sort algorithm which returns exactly the same output each time it is applied to the same input. This is a property of the sorting algorithm, and not of the comparison mechanism. For example, a randomized Quicksort (which picks a random element as the pivot element, for optimal performance) is not deterministic. Multiprocessor implementations of a sort algorithm may also not be deterministic. Diacritic . (1) A mark applied or attached to a symbol to create a new symbol that represents a modified or new value. (2) A mark applied to a symbol irrespective of whether it changes the value of that symbol. In the latter case, the diacritic usually represents an independent value (for example, an accent, tone, or some other linguistic information). Also called diacritical mark or diacritical . (See also combining character and nonspacing mark .) Diaeresis . Two horizontal dots over a letter, as in naïve . The diaeresis is not distinguished from the umlaut in the Unicode character encoding. (See umlaut .) Dialytika . Greek term for diaeresis or trema , used in Greek character names. Digits . (See Arabic digits , European digits , and Indic digits .) See Terminology for Digits for additional information on terminology related to digits. Digraph . A pair of signs or symbols (two graphs), which together represent a single sound or a single linguistic unit. The English writing system employs many digraphs (for example, th, ch, sh, qu, and so on). The same two symbols may not always be interpreted as a digraph (for example, ca th ode versus ca th ouse ). When three signs are so combined, they are called a trigraph . More than three are usually called an n-graph . Dingbats . Typographical symbols and ornaments. Diphthong . A pair of vowels that are considered a single vowel for the purpose of phonemic distinction. One of the two vowels is more prominent than the other. In writing systems, diphthongs are sometimes written with one symbol and sometimes with more than one symbol (for example, with a digraph ). Direction . (See paragraph direction .) Directionality Property . A property of every graphic character that determines its horizontal ordering as specified in Unicode Standard Annex #9, “Unicode Bidirectional Algorithm.” (See Section 4.4, Directionality .) Display Cell . A rectangular region on a display device within which one or more glyphs are imaged. Display Order . The order of glyphs presented in text rendering. (See logical order and Section 2.2, Unicode Design Principles .) Domain . 1. For a mapping, the domain is the set of code points or sequences that are mapped, while the codomain is the set of values they are mapped to. For example, a canonical decomposition is a mapping from a set of code points to a set of sequences; the domain is the entire Unicode codespace. (See also codomain .) 2. A realm of administrative autonomy, authority or control in the Internet, identified by a domain name. Domain Name . The part of a network address that identifies it as belonging to a particular domain. (Oxford Languages definition.) A domain name is a string of characters. The rules for how Unicode characters can be used in domain names is the concern of IDNA and of UTS #46, Unicode IDNA Compatibility Processing . Double-Byte Character Set . One of a number of character sets defined for representing Chinese, Japanese, or Korean text (for example, JIS X 0208-1990). These character sets are often encoded in such a way as to allow double-byte character encodings to be mixed with single-byte character encodings. Abbreviated DBCS . (See also multibyte character set .) Ductility . The ability of a cursive font to stretch or compress the connective baseline to effect text justification. Dynamic Composition . Creation of composite forms such as accented letters or Hangul syllables from a sequence of characters. E EBCDIC . Acronym for Extended Binary-Coded Decimal Interchange Code. A group of coded character sets used on mainframes that consist of 8-bit coded characters. EBCDIC coded character sets reserve the first 64 code points (x00 to x3F) for control codes, and reserve the range x41 to xFE for graphic characters. The English alphabetic characters are in discontinuous segments with uppercase at xC1 to xC9, xD1 to xD9, xE2 to xE9, and lowercase at x81 to x89, x91 to x99, xA2 to xA9. ECCS . Acronym for extended combining character sequence . EGC . Acronym for extended grapheme cluster . Embedding . A concept relevant to bidirectional behavior. (See Unicode Standard Annex #9, “Unicode Bidirectional Algorithm,” for detailed terminology and definitions.) Emoji . (1) The Japanese word for "pictograph." (2) Certain pictographic and other symbols encoded in the Unicode Standard that are commonly given a colorful or playful presentation when displayed on devices. Many of the emoji in Unicode were originally encoded for compatibility with Japanese telephone symbol sets. (3) Colorful or playful symbols which are not encoded as characters but which are widely implemented as graphics. (See pictograph .) Emoticon . A symbol added to text to express emotional affect or reaction—for example, sadness, happiness, joking intent, sarcasm, and so forth. Emoticons are often expressed by a conventional kind of "ASCII art," using sequences of punctuation and other symbols to portray likenesses of facial expressions. In Western contexts these are often turned sideways, as :-) to express a happy face; in East Asian contexts other conventions often portray a facial expression without turning, as ^-^. Rendering systems often recognize conventional emoticon sequences and display them as colorful or even animated glyphs in text. There is also a set of dedicated pictographic symbols—mostly representing different facial expressions—encoded as characters in the Unicode Standard. (See pictograph .) Encapsulated Text . (1) Plain text surrounded by formatting information. (2) Text recoded to pass through narrow transmission channels or to match communication protocols. Enclosing Mark . A nonspacing mark with the General Category of Enclosing Mark (Me). (See definition D54 in Section 3.6, Combination .) Enclosing marks are a subclass of nonspacing marks that surround a base character, rather than merely being placed over, under, or through it. Encoded Character . An association (or mapping) between an abstract character and a code point . (See definition D11 in Section 3.4, Characters and Encoding .) By itself, an abstract character has no numerical value, but the process of “encoding a character” associates a particular code point with a particular abstract character, thereby resulting in an “encoded character.” Encoding Form . (See character encoding form .) Encoding Scheme . (See character encoding scheme .) Equivalence . In the context of text processing, the process or result of establishing whether two text elements are identical in some respect. Equivalent Sequence . (See canonical equivalent .) Escape Sequence . A sequence of bytes that is used for code extension. The first byte in the sequence is escape (hex 1B). EUDC . Acronym for end-user defined character. A character defined by an end user, using a private-use code point, to represent a character missing in a particular character encoding. These are common in East Asian implementations. European Digits . Forms of decimal digits first used in Europe and now used worldwide. Historically, these digits were derived from the Arabic digits; they are sometimes called “Arabic numerals,” but this nomenclature leads to confusion with the real Arabic-Indic digits . Also called "Western digits" and "Latin digits." See Terminology for Digits for additional information on terminology related to digits. Extended Base . Any base character, or any standard Korean syllable block. (See definition D51a in Section 3.6, Combination .) Extended Combining Character Sequence . A maximal character sequence consisting of either an extended base followed by a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner ; or a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner . Abbreviated as ECCS . (See definition D56a in Section 3.6, Combination .) Extended Grapheme Cluster . The text between extended grapheme cluster boundaries as specified by Unicode Standard Annex #29, "Unicode Text Segmentation." Abbreviated as EGC . (See definition D61 in Section 3.6, Combination .) F Fancy Text . (See rich text .) Fixed Position Class . A subset of the range of numeric values for combining classes—specifically, any value in the range 10..199. (See definition D105 in Section 3.11, Normalization Forms .) Floating ( diacritic, accent, mark ). (See nonspacing mark .) Folding . An operation that maps similar characters to a common target, such as uppercasing or lowercasing a string. Folding operations are most often used to temporarily ignore certain distinctions between characters. Font . A collection of glyphs used for the visual depiction of character data. A font is often associated with a set of parameters (for example, size, posture, weight, and serifness), which, when set to particular values, generate a collection of imagable glyphs. Format Character . A character that is inherently invisible but that has an effect on the surrounding characters. Format Code . Synonym for format character . Format Control Character . Synonym for format character . Formatted Text . (See rich text .) FSS-UTF . Acronym for File System Safe UCS Transformation Format , published by the X/Open Company Ltd., and intended for the UNIX environment. Now known as UTF-8 . Full Composition Exclusion . A Canonical Decomposable Character which has the property value Full_Composition_Exclusion=True. (Used in the definition of Unicode Normalization Forms.) (See definition D113 in Section 3.11, Normalization Forms .) Fullwidth . Characters of East Asian character sets whose glyph image extends across the entire character display cell. In legacy character sets, fullwidth characters are normally encoded in two or three bytes. The Japanese term for fullwidth characters is zenkaku . FVS . Acronym for Mongolian Free Variation Selector . G G11n . (See globalization .) GC . 1. Acronym for grapheme cluster . 2. Short name for the General_Category property, usually lowercased: gc. GCGID . Acronym for Graphic Character Global Identifier. These are listed in the IBM document Character Data Representation Architecture, Level 1, Registry SC09-1391 . General Category . Partition of the characters into major classes such as letters, punctuation, and symbols, and further subclasses for each of the major classes. (See Section 4.5, General Category .) Generative . Synonym for productive . Globalization . (1) The overall process for internationalization and localization of  software products. (2) a synonym for internationalization. Also known by the abbreviation "g11n". Note that the meaning of "globalization" which is relevant to software products should be distinguished from the more widespread use of "globalization" in the context of economics. (See internationalization , localization .) Glyph . (1) An abstract form that represents one or more glyph images. (2) A synonym for glyph image . In displaying Unicode character data, one or more glyphs may be selected to depict a particular character. These glyphs are selected by a rendering engine during composition and layout processing. (See also character .) Glyph Code . A numeric code that refers to a glyph. Usually, the glyphs contained in a font are referenced by their glyph code. Glyph codes may be local to a particular font; that is, a different font containing the same glyphs may use different codes. Glyph Identifier . Similar to a glyph code, a glyph identifier is a label used to refer to a glyph within a font. A font may employ both local and global glyph identifiers. Glyph Image . The actual, concrete image of a glyph representation having been rasterized or otherwise imaged onto some display surface. Glyph Metrics . A collection of properties that specify the relative size and positioning along with other features of a glyph. Grapheme . (1) A minimally distinctive unit of writing in the context of a particular writing system. For example, ‹b› and ‹d› are distinct graphemes in English writing systems because there exist distinct words like big and dig. Conversely, a lowercase italiform letter a and a lowercase Roman letter a are not distinct graphemes because no word is distinguished on the basis of these two different forms. (2) What a user thinks of as a character. Grapheme Base . A character with the property Grapheme_Base, or any standard Korean syllable block. (See definition D58 in Section 3.6, Combination .) Grapheme Cluster . The text between grapheme cluster boundaries as specified by Unicode Standard Annex #29, "Unicode Text Segmentation." (See definition D60 in Section 3.6, Combination .) A grapheme cluster represents a horizontally segmentable unit of text, consisting of some grapheme base (which may consist of a Korean syllable) together with any number of nonspacing marks applied to it. Grapheme Extender . A character with the property Grapheme_Extend. (See definition D59 in Section 3.6, Combination .) Grapheme extender characters consist of all nonspacing marks, zero width joiner , zero width non-joiner , and a small number of spacing marks. Graphic Character . A character with the General Category of Letter (L), Combining Mark (M), Number (N), Punctuation (P), Symbol (S), or Space Separator (Zs). (See definition D50 in Section 3.6. Combination .) Guillemet . Punctuation marks resembling small less-than and greater-than signs, used as quotation marks in French and other languages. (See “Language-Based Usage of Quotation Marks” in Section 6.2, General Punctuation .) H Halant . A preferred Hindi synonym for a virama . It literally means killer , referring to its function of killing the inherent vowel of a consonant letter. (See virama .) Half-Consonant Form . In the Devanagari script and certain other scripts of the Brahmi family of Indic scripts, a dead consonant may be depicted in the so-called half-form. This form is composed of the distinctive part of a consonant letter symbol without its vertical stem. It may be used to create conjunct forms that follow a horizontal layout pattern. Also known as half-form . Halfwidth . Characters of East Asian character sets whose glyph image occupies half of the character display cell. In legacy character sets, halfwidth characters are normally encoded in a single byte. The Japanese term for halfwidth characters is hankaku . Han Characters . Ideographic characters of Chinese origin. (See Section 18.1, Han .) Hangul . The name of the script used to write the Korean language. Hangul Syllable . (1) Any of the 11,172 encoded characters of the Hangul Syllables character block, U+AC00..U+D7A3. Also called a precomposed Hangul syllable to clearly distinguish it from a Korean syllable block. (2) Loosely speaking, a Korean syllable block . Hanja . The Korean name for Han characters; derived from the Chinese word hànzì . Hankaku . (See halfwidth .) Han Unification . The process of identifying Han characters that are in common among the writing systems of Chinese, Japanese, Korean, and Vietnamese. Hànzì . The Mandarin Chinese name for Han characters. Harakat . Marks used in the Arabic script to indicate vocalization with short vowels. A subtype of tashkil . Hasant . The Bangla name for halant . (See virama .) Higher-Level Protocol . Any agreement on the interpretation of Unicode characters that extends beyond the scope of this standard. Note that such an agreement need not be formally announced in data; it may be implicit in the context. (See definition D16 in Section 3.4, Characters and Encoding .) High-Surrogate Code Point . A Unicode code point in the range U+D800 to U+DBFF. (See definition D71 in Section 3.8, Surrogates .) High-Surrogate Code Unit . A 16-bit code unit in the range D800 16 to DBFF 16 , used in UTF-16 as the leading code unit of a surrogate pair. Also known as a leading surrogate . (See definition D72 in Section 3.8, Surrogates .) Hiragana (ひらがな). One of two standard syllabaries associated with the Japanese writing system. Hiragana syllables are typically used in the representation of native Japanese words and grammatical particles, or are used as a fallback representation of other words when the corresponding kanji is either difficult to remember or obscure. (See also katakana .) Horizontal Extension . This refers to the process of adding a new IRG source reference to an existing CJK unified ideograph, along with a new representative glyph for the code charts that shows how the character appears in its source. It does not involve encoding a new character, but rather just adding the source reference and new glyph to the code charts. HTML . HyperText Markup Language. A text description language related to SGML; it mixes text format markup with plain text content to describe formatted text. HTML is ubiquitous as the source language for Web pages on the Internet. Starting with HTML 4.0, the Unicode Standard functions as the reference character set for HTML content. (See also SGML .) I I18n . (See internationalization .) IANA . Acronym for Internet Assigned Numbers Authority. ICU . Acronym for International Components for Unicode, an Open Source set of C/C++ and Java libraries for Unicode and software internationalization support. For information, see https://icu.unicode.org/ Ideograph (or ideogram ). (1) Any symbol that primarily denotes an idea or concept in contrast to a sound or pronunciation—for example, ♻, which denotes the concept of recycling by a series of bent arrows. (2) A generic term for the unit of writing of a logosyllabic writing system. In this sense, ideograph (or ideogram) is not systematically distinguished from logograph (or logogram). (3) A term commonly used to refer specifically to Han characters, equivalent to the Chinese, Japanese, or Korean terms also sometimes used: hànzì , kanji , or hanja . (See logograph , pictograph , sinogram .) Ideographic Property . Informative property of characters that are ideographs. (See Section 4.10, Letters, Alphabetic, and Ideographic .) Ideographic Variation Sequence . A variation sequence registered in the Ideographic Variation Database . The registration of ideographic variation sequences is subject to the rules specified in Unicode Technical Standard #37, "Unicode Ideographic Variation Database." The base character for an ideographic variation sequence must be an ideographic character, and it makes use of a variation selector in the range U+E0100..U+E01EF. The term ideographic variation sequence is sometimes abbreviated as "IVS". IDN . (See Internationalized Domain Name .) IDNA (1) The IDNA2008 protocol for IDNs defined in RFCs 5891 , 5892 , 5893 and 5894 . The protocol categorizes characters (for example as PVALID or DISALLOWED) based on Unicode properties as described in RFC 5892 . (For the range of valid code points for each Unicode version, see the data file for the derived IDNA2008_Category property.) (2) The earlier IDNA2003 protocol. (See IDNA Compatibility Processing for differences between IDNA2003 and IDNA2008 .) IDNA Compatibility Processing . (See Unicode Technical Standard #46, "Unicode IDNA Compatibility Processing" .) IDNA2003 . (See IDNA (2).) IDNA2008 . (See IDNA (1).) IICore . A subset of common-use CJK unified ideographs, defined as the fixed collection 370 IICore in ISO/IEC 10646. This subset contains 9,810 ideographs and is intended for common use in East Asian contexts, particularly for small devices that cannot support the full range of CJK unified ideographs encoded in the Unicode Standard. Ijam . Diacritical marks applied to basic letter forms to derive new (usually consonant) letters for extended Arabic alphabets. For example, see the three dots below which appear in the letter peh: پ Ijam marks are not separately encoded as combining marks in the Unicode Standard, but instead are integral parts of each atomically encoded Arabic letter. Contrast tashkil . See also Section 9.2, Arabic . Ill-Formed Code Unit Sequence . A code unit sequence that does not follow the specification of a Unicode encoding form. (See definition D84 in Section 3.9, Unicode Encoding Forms .) Ill-Formed Code Unit Subsequence . A non-empty subsequence of a Unicode code unit sequence X which does not contain any code units which also belong to any minimal well-formed subsequence of X. (See definition D84a in Section 3.9, Unicode Encoding Forms .) IME . (See Input Method Editor .) In-Band . An in-band channel conveys information about text by embedding that information within the text itself, with special syntax to distinguish it. In-band information is encoded in the same character set as the text, and is interspersed with and carried along with the text data. Examples are XML and HTML markup. Independent Vowel . In Indic scripts, certain vowels are depicted using independent letter symbols that stand on their own. This is often true when a word starts with a vowel or a word consists of only a vowel. Indic Digits . Forms of decimal digits used in various Indic scripts (for example, Devanagari: U+0966, U+0967, U+0968, U+0969). Arabic digits (and, eventually, European digits) derive historically from these forms. See Terminology for Digits for additional information on terminology related to digits. Informative . Information in this standard that is not normative but that contributes to the correct use and implementation of the standard. Inherent Vowel . In writing systems based on a script in the Brahmi family of Indic scripts, a consonant letter symbol nor
2026-01-13T09:30:25
https://www.debian.org/MailingLists/#subglitches
Debian -- Mailing Lists Skip Quicknav Blog Micronews Planet Wiki Mailing Lists Mailing Lists Introduction Basic use Disclaimer / Privacy policy / Legal information Subscription / Unsubscription Code of conduct List maintenance Debian mailing list advertising policy / Spam Fighting Introduction Debian is developed through distributed development all around the world. Therefore, e-mail is the preferred way to discuss various items. Much of the conversation between Debian developers and users is managed through several mailing lists . There are many world-open mailing lists, meaning anyone can read everything that is posted, and participate in the discussions. Everyone is encouraged to help development of Debian and to spread the word of free software. There are also a few lists which are only open to official Debian developers; please don't interpret this as closed development, it sometimes doesn't make much sense discussing internal topics with non-developers. All original Debian mailing lists are run on a special server, using an automatic mail processing software called SmartList. This server is called lists.debian.org . All submission, subscription and unsubscription messages have to be sent to a particular address at this host. Basic use Each Debian mailing list has a submission address in the form listname @lists.debian.org , a control request address in the form listname -request@lists.debian.org , and a web page at https://lists.debian.org/ listname / . To send an email to a list, simply send it to the submission address. To subscribe to a list to be able to read incoming mails as they arrive, or to unsubscribe from a list, use the control request address ( see below ). The current list of available mailing lists is at https://lists.debian.org/ , presented sorted by topic and unsorted. We also maintain some usage statistics for the mailing lists: check the average number of posts before subscribing to a list in order to avoid being flooded by mails. Disclaimer / Privacy policy / Legal information The mailing lists are public forums . All emails sent to the lists are distributed both to the list subscribers and copied to the public archive , for people to browse or search without the need to be subscribed. Furthermore, you can browse our mailing lists as Usenet newsgroups. There may be other places where lists are distributed — please make sure you never send any confidential or unlicensed material to the lists. This includes things like e-mail addresses. Of particular note is the fact that spammers, viruses, worms etc have been known to abuse e-mail addresses posted to our mailing lists. Debian maintains the mailing lists in good faith and will take steps to curb all noticed abuse and maintain uninterrupted normal service. At the same time, Debian is not responsible for all mailing list posts or anything that may happen in relation to them. Please see our disclaimer of responsibility for more information. Subscription / Unsubscription Anyone is able to subscribe/unsubscribe on their own to any mailing list, presuming the subscription policy for a particular list is open . You can use simple web forms to subscribe or unsubscribe from individual mailing lists, available at their respective web pages at https://lists.debian.org/ . To subscribe or unsubscribe from multiple mailing lists at once, use the list subscription or unsubscription web forms, respectively. The former page also includes descriptions and the subscription policy for each list. The requests for subscription or unsubscription can also be sent by email, to a special control address, which is slightly different from the lists address. Subscription or unsubscription messages should NOT be sent to the address of the mailing list itself. To subscribe to or unsubscribe from a mailing list, please send mail to <listname> -REQUEST@lists.debian.org with the word subscribe or unsubscribe as subject. Please remember the -REQUEST part of the address. As part of the subscription process, the list software will send you an email to which you must reply in order to finish subscribing. This is a security measure to keep people from subscribing others to the lists without their permission. Common glitches in the (un)subscription process Please remember that an unsubscription request should be sent from the address that is subscribed . If that is not possible, the Subject: header should be: unsubscribe subscribedaddress@subscribed.domain , or you can use the unsubscription web form. If you're receiving mail from a mailing list but you can't find the address through which you are subscribed, you can use the full headers of the received messages which will include something like this: From bounce-debian-foo=quux=example.com@lists.debian.org Tue Apr 22 01:38:14 2003 This tells you reliably that the list in question is called debian-foo and that the subscribed address is quux@example.com . In this (fictional) case you would send e-mail to debian-foo-request@lists.debian.org with unsubscribe quux@example.com in the Subject field. The address you should send your unsubscribe request to is also in the List-Unsubscribe-Header of every mail. Unfortunately it's currently impossible to subscribe with a username that matches procmail's check for mail coming from a daemon. This means that a username may not have mail , admin , root , master or similar strings in it (see procmailrc(5) for FROM_DAEMON ). Another known limitation in our mailing list software is that most rejected e-mails get silently dropped, so the user has no real indication on what went wrong. For example, it is common for people to try to subscribe an address that is already subscribed: SmartList will simply ignore their e-mail. If you are uncertain as to whether you are subscribed to a mailing list of ours, send mail to majordomo@lists.debian.org with which your.email@address in the body. Further information about this service (the so-called MajorSmart ) is available by sending another mail to the same address with help in the body. Code of conduct When using the Debian mailing lists, please follow the Debian Code of Conduct in addition to these rules: The mailing lists exist to foster the development and use of Debian. Non-constructive or off-topic messages, along with other abuses, are not welcome. Do not send spam ; see the advertising policy below. Send all of your e-mails in English. Only use other languages on mailing lists where that is explicitly allowed (e.g. French on debian-user-french). Make sure that you are using the proper list. In particular, don't send user-related questions to developer-related mailing lists. Wrap your lines at 80 characters or less for ordinary discussion. Lines longer than 80 characters are acceptable for computer-generated output (e.g., ls -l ). Do not send automated out-of-office or vacation messages. Do not send test messages to determine whether your mail client is working. Do not send subscription or unsubscription requests to the list address itself; use the respective -request address instead. Please don't send your messages in HTML; use plain text instead. Avoid sending large attachments. Do not quote messages that were sent to you by other people in private mail, unless agreed beforehand. When replying to messages on the mailing list, do not send a carbon copy (CC) to the original poster unless they explicitly request to be copied. If you want to complain to someone who sent you a carbon copy when you did not ask for it, do it privately. If you send messages to lists to which you are not subscribed, always note that fact in the body of your message. Do not use foul language; besides, some people receive the lists via packet radio, where swearing is illegal. Try not to flame ; it is not polite. Use common sense all the time. List maintenance If you wish to request a new mailing list, please read the HOWTO . If you're having problems subscribing or unsubscribing, please make sure you've followed the proper procedure before trying to contact us. Make sure that you have seen the caveats regarding subscription/unsubscription . To contact the list maintainer, send e-mail in English to listmaster@lists.debian.org . Alternatively, you can file a bug report against the lists.debian.org pseudo-package. If you were unable to unsubscribe from a mailing list, please include a copy of all the headers of an example message that you have received from that list in your e-mail. Debian mailing list advertising policy / Spam Fighting The sending of any kind of unsolicited bulk email (also known as spam ) to any of the Debian lists is prohibited. Senders of such messages can get blocked from posting on lists and/or reported to the relevant authorities. The Debian Listmasters do their best to stop as many such emails as possible from reaching the lists. On a typical day, over 40,000 such messages are blocked. Many of the rules we use to block spammers and their messages have been reported to us by subscribers. If you wish to help us reduce the amount of spam even more, your help is very much appreciated. To report spam properly, you need to do the following: Find a copy of the message at the list archives . Find a SpamAssassin rule to catch this type of spam. Keep in mind that this rule will be applied against all lists, and that we want to keep the false positives to a minimum. (you can see our ruleset at https://salsa.debian.org/debian-listmasters/spamassassin_config ) Send email to listmaster@lists.debian.org with the exact URL of the message, and the said filter rule, if possible. You will get a reply when we act on your submission. Please bear in mind that we will only act on reported spam messages/patterns that have been sent in the last few hours, because there is no point in having out of date filtering rules. Also, please do not send any pre-packaged lists of rules you have found somewhere. They very rarely provide good results on our lists, because they receive some pretty unique traffic. Do not allow any emails that you receive from any Debian mailing lists to be sent to an automated spam reporting system. Doing so is often harmful to all users and will force us to block you from receiving traffic from all Debian lists until you prove that you will not do so again. More efforts to reduce spam on the lists and in the archive https://lists.debian.org/ can be found at https://wiki.debian.org/Teams/ListMaster/ListArchiveSpam Back to the Debian Project homepage . This page is also available in the following languages: Select your language dansk Deutsch español français Galego hrvatski Italiano magyar Nederlands norsk (bokmål) polski Português slovenčina suomi svenska Tiếng Việt Български (Bəlgarski) Русский (Russkij) українська (ukrajins'ka) 中文(简) 中文(HK) 中文(繁) 日本語 (Nihongo) česky 한국어 (Korean) How to set the default document language Home About Social Contract Code of Conduct Free Software Legal Info Help Debian Getting Debian Network install CD/USB ISO images Pure Blends Debian Packages Developers' Corner News Project News Events Documentation Release Info Debian Wiki Support Debian International Security Information Bug reports Mailing Lists Site map Search The Debian Blog Debian Micronews Debian Planet See our contact page to get in touch. Web site source code is available . Last Modified: Tue, Jun 13 17:32:29 UTC 2023   Last Built: Sat, Jan 10 23:26:36 UTC 2026 Copyright © 1997-2023 SPI and others; See license terms Debian is a registered trademark of Software in the Public Interest, Inc.
2026-01-13T09:30:25
http://hackage.haskell.org/package/semigroupoids-1.2.6.1/docs/Data-Functor-Apply.html
Data.Functor.Apply Source Contents Index semigroupoids-1.2.6.1: Haskell 98 semigroupoids: Category sans id Portability portable Stability provisional Maintainer Edward Kmett <ekmett@gmail.com> Safe Haskell Safe-Infered Data.Functor.Apply Contents Functors Apply - a strong lax semimonoidal endofunctor Wrappers Description   Synopsis class Functor f where fmap :: (a -> b) -> f a -> f b (<$) :: a -> f b -> f a (<$>) :: Functor f => (a -> b) -> f a -> f b ($>) :: Functor f => f a -> b -> f b class Functor f => Apply f where (<.>) :: f (a -> b) -> f a -> f b (.>) :: f a -> f b -> f b (<.) :: f a -> f b -> f a (<..>) :: Apply w => w a -> w (a -> b) -> w b liftF2 :: Apply w => (a -> b -> c) -> w a -> w b -> w c liftF3 :: Apply w => (a -> b -> c -> d) -> w a -> w b -> w c -> w d newtype WrappedApplicative f a = WrapApplicative { unwrapApplicative :: f a } newtype MaybeApply f a = MaybeApply { runMaybeApply :: Either (f a) a } Functors class Functor f where The Functor class is used for types that can be mapped over. Instances of Functor should satisfy the following laws: fmap id == id fmap (f . g) == fmap f . fmap g The instances of Functor for lists, Maybe and IO satisfy these laws. Methods fmap :: (a -> b) -> f a -> f b (<$) :: a -> f b -> f a Replace all locations in the input with the same value. The default definition is fmap . const , but this may be overridden with a more efficient version. Instances Functor []   Functor IO   Functor ZipList   Functor Maybe   Functor Tree   Functor Seq   Functor ViewL   Functor ViewR   Functor IntMap   Functor Option   Functor NonEmpty   Functor Identity   Functor Id   Functor Elem   Functor FingerTree   Functor Node   Functor Digit   Functor Id   Functor ((->) r)   Functor ( Either a)   Functor ( (,) a)   Functor ( Const m)   Monad m => Functor ( WrappedMonad m)   Functor ( Map k)   Functor m => Functor ( MaybeT m)   Functor m => Functor ( ListT m)   Functor m => Functor ( IdentityT m)   Functor (StateR s)   Functor (StateL s)   Functor (State s)   Functor f => Functor ( MaybeApply f)   Functor f => Functor ( WrappedApplicative f)   Functor f => Functor (Act f)   Arrow a => Functor ( WrappedArrow a b)   Functor ( Cokleisli w a)   Functor m => Functor ( WriterT w m)   Functor m => Functor ( WriterT w m)   Functor m => Functor ( StateT s m)   Functor m => Functor ( StateT s m)   Functor m => Functor ( ReaderT r m)   Functor m => Functor ( ErrorT e m)   Functor ( ContT r m)   ( Functor f, Functor g) => Functor ( Compose f g)   ( Functor f, Functor g) => Functor ( Product f g)   Functor f => Functor ( Static f a)   Functor m => Functor ( RWST r w s m)   Functor m => Functor ( RWST r w s m)   (<$>) :: Functor f => (a -> b) -> f a -> f b An infix synonym for fmap . ($>) :: Functor f => f a -> b -> f b Source TODO: move into Data.Functor Apply - a strong lax semimonoidal endofunctor class Functor f => Apply f where Source A strong lax semi-monoidal endofunctor. This is equivalent to an Applicative without pure . Laws: associative composition: (.) <$> u <.> v <.> w = u <.> (v <.> w) Methods (<.>) :: f (a -> b) -> f a -> f b Source (.>) :: f a -> f b -> f b Source a .> b = const id $ a . b (<.) :: f a -> f b -> f a Source a . b = const <$ a . b Instances Apply []   Apply IO   Apply ZipList   Apply Maybe   Apply Tree   Apply Seq   Apply IntMap An IntMap is not Applicative , but it is an instance of Apply Apply Option   Apply NonEmpty   Apply Identity   Apply ((->) m)   Apply ( Either a)   Semigroup m => Apply ( (,) m)   Semigroup m => Apply ( Const m)   Monad m => Apply ( WrappedMonad m)   Ord k => Apply ( Map k) A Map is not Applicative , but it is an instance of Apply ( Bind m, Monad m) => Apply ( MaybeT m)   Apply m => Apply ( ListT m)   Apply w => Apply ( IdentityT w)   Apply f => Apply ( MaybeApply f)   Applicative f => Apply ( WrappedApplicative f)   Arrow a => Apply ( WrappedArrow a b)   Apply ( Cokleisli w a)   ( Apply m, Semigroup w) => Apply ( WriterT w m)   ( Apply m, Semigroup w) => Apply ( WriterT w m)   Bind m => Apply ( StateT s m)   Bind m => Apply ( StateT s m)   Apply m => Apply ( ReaderT e m)   ( Bind m, Monad m) => Apply ( ErrorT e m)   Apply ( ContT r m)   ( Apply f, Apply g) => Apply ( Compose f g)   ( Apply f, Apply g) => Apply ( Product f g)   Apply f => Apply ( Static f a)   ( Bind m, Semigroup w) => Apply ( RWST r w s m)   ( Bind m, Semigroup w) => Apply ( RWST r w s m)   (<..>) :: Apply w => w a -> w (a -> b) -> w b Source A variant of <.> with the arguments reversed. liftF2 :: Apply w => (a -> b -> c) -> w a -> w b -> w c Source Lift a binary function into a comonad with zipping liftF3 :: Apply w => (a -> b -> c -> d) -> w a -> w b -> w c -> w d Source Lift a ternary function into a comonad with zipping Wrappers newtype WrappedApplicative f a Source Wrap an Applicative to be used as a member of Apply Constructors WrapApplicative   Fields unwrapApplicative :: f a   Instances Functor f => Functor ( WrappedApplicative f)   Applicative f => Applicative ( WrappedApplicative f)   Alternative f => Alternative ( WrappedApplicative f)   Applicative f => Apply ( WrappedApplicative f)   Alternative f => Alt ( WrappedApplicative f)   Alternative f => Plus ( WrappedApplicative f)   newtype MaybeApply f a Source Transform a Apply into an Applicative by adding a unit. Constructors MaybeApply   Fields runMaybeApply :: Either (f a) a   Instances Functor f => Functor ( MaybeApply f)   Apply f => Applicative ( MaybeApply f)   Comonad f => Comonad ( MaybeApply f)   Extend f => Extend ( MaybeApply f)   Apply f => Apply ( MaybeApply f)   Produced by Haddock version 2.10.0
2026-01-13T09:30:25
https://oftc.net/
OFTC - Home OFTC Skip to content Home News Staff Documentation Help Chat! OFTC OFTC The Open and Free Technology Community is a volunteer-run network that aims to provide stable and effective collaboration services to members of the community in any part of the world, while closely listening to their needs and desires. You can reach the OFTC IRC network by using a traditional IRC Client of choice, or by the WebChat that we provide. The webchat enables you to connect to the network and chat directly from within your browser. Connect your client to ircs://irc.oftc.net:6697 To connect securely, use ports 6697 or 9999. TLS/SSL is supported on all servers. Our server certificates are signed by Let’s Encrypt . We also publish DNSSEC-signed TLSA records: dig _6697._tcp.irc.oftc.net tlsa . Both IPv4 and IPv6 are available. Use of Tor is permitted to the address above. You can also connect to the onion service: ircs://oftcnet6xg6roj6d7id4y4cu6dchysacqj2ldgea73qzdagufflqxrid.onion:6697 (Not recommended) To connect without TLS/SSL use ports 6667-6670 or 7000. IRC services (NickServ, ChanServ) are available for nick and channel registration. See CertFP for how to configure client certificate-based NickServ identification. Recent News July 13, 2025 We are excited to announce that we have voted to adopt a new constitution for OFTC ! This new version comes after more than a year of discussion and drafting, and as this update is substantially more than a simple amendment, SPI was consulted about the change. The goals of this rewrite include calibrating our governance document with how the network’s process have adapted over the past two decades, and reducing the administrative overhead in our annual elections. The old version is still available for comparison. We initiated an amendment vote on June 7, ending July 7, with the outcome announced to staff and the SPI board on July 12. The previous constitution required 3/4ths of NOC and 3/4ths of NetOps to vote yes for the amendment to pass. The final results were: NOC: 7 yes, 0 no, 1 didn’t vote NetOp: 6 yes, 0 no, 1 didn’t vote April 25, 2025 At the end of February we learned that The Matrix.org Foundation required additional funding to avoid decommissioning the official Matrix bridge to OFTC. In early April we were informed of a potential sponsorship that would save the bridge, however due to a serious wave of abuse on the Matrix platform, confirmation of this was not possible at that time. The Foundation has now confirmed that their primary sponsor, Element, has pledged to ensure that the Foundation can continue operating the OFTC bridge. February 28, 2025 The Matrix.org Foundation recently published a blog post stating that unless they raise temporary funding by the end of March, and also solicit further, more sustained funding in the month after that, they will start scaling back operations and discontinue running and maintaining their flagship inter-protocol bridges, including the official bridge to OFTC. In the event that they do not meet their ambitious goals, we are providing pointers below to resources so that our users can plan how to proceed, and avoid splitting their communities. While there are some forks of the matrix-appservice-irc codebase, we are not aware of any equipped to maintain this as a community fork. However, there are other options, such as Matterbridge which bridges to a variety of other protocols as well, and Heisenbridge which offers a one-to-many bridging option. The Matrix.org Foundation has indicated to us that that they will make plans for the worst-case scenario, and we will communicate further as we get more information. November 01, 2024 2024 staff election results - thanks to Steve McIntyre (Sledge) and Pierre-Elliott Bécue (peb) for running the elections as counters this year. March 23, 2024 2023 staff election results - thanks to Steve McIntyre (Sledge), Alexander Færøy (ahf), and Pierre-Elliott Bécue (peb) for running the elections as counters this year. Need network support? #oftc support@oftc.net Back to top Review our code: OFTC on Github Other issues? Public issue tracker Stay informed: Atom/RSS news feed On the Fediverse Founded in 2001 by members of the Open Source and Free Software communities, OFTC aims to provide those communities with better communication, development, and support infrastructure. OFTC is a member of Software in the Public Interest . Contributions to SPI keep OFTC running. Back to top
2026-01-13T09:30:25
http://rb.zq1.de/scripts/
Index of /scripts Index of /scripts Name Last modified Size Description Parent Directory   -   checkresults.sh 2017-06-28 19:15 172   classifyresults.sh 2021-06-01 05:06 368   jsondiff 2018-11-07 15:51 208   reproduciblejsonfilter.py 2017-07-12 12:53 503  
2026-01-13T09:30:26
http://mirror.as35701.net/debian-cd/
Index of /debian-cd Index of /debian-cd Name Last modified Size Description Parent Directory   -   13.3.0-live/ 2026-01-10 22:07 -   13.3.0/ 2026-01-10 22:07 -   current-live/ 2026-01-10 22:07 -   current/ 2026-01-10 22:07 -   ls-lR.gz 2026-01-11 00:12 11K   project/ 2005-05-23 18:50 -   Apache/2.4.66 (Debian) Server at mirror.as35701.net Port 80
2026-01-13T09:30:26
http://rb.zq1.de/leap/
Index of /leap Index of /leap Name Last modified Size Description Parent Directory   -   15.0/ 2018-07-16 11:36 -   15.1/ 2018-10-29 04:16 -   15.2/ 2020-07-24 18:11 -   15.3/ 2021-05-31 05:51 -   15.5/ 2023-06-08 15:12 -  
2026-01-13T09:30:26
https://rubygems.org/gems/rack-unreloader
rack-unreloader | RubyGems.org | your community gem host ⬢ RubyGems nav#focus mousedown->nav#mouseDown click@window->nav#hide"> Navigation menu autocomplete#choose mouseover->autocomplete#highlight"> Search Gems… Releases Blog Gems Guides Sign in Sign up rack-unreloader 2.1.0 Rack::Unreloader is a rack middleware that reloads application files when it detects changes, unloading constants defined in those files before reloading. Gemfile: = install: = Versions: 2.1.0 January 18, 2023 (17 KB) 2.0.0 June 23, 2022 (15 KB) 1.8.0 October 15, 2021 (21 KB) 1.7.0 March 18, 2019 (20 KB) 1.6.0 February 24, 2017 (19.5 KB) Show all versions (13 total) Development Dependencies (3): minitest >= 5.6.1 minitest-global_expectations >= 0 minitest-hooks >= 0 Show all transitive dependencies Owners: Pushed by: Authors: Jeremy Evans SHA 256 checksum: = ← Previous version Total downloads 478,218 For this version 58,722 Version Released: January 18, 2023 7:58pm License: MIT Required Ruby Version: >= 1.9.2 Links: Homepage Changelog Source Code Mailing List Bug Tracker Download Review changes Badge Subscribe RSS Report abuse Reverse dependencies Status Uptime Code Data Stats Contribute About Help API Policies Support Us Security RubyGems.org is the Ruby community’s gem hosting service. Instantly publish your gems and then install them . Use the API to find out more about available gems . Become a contributor and improve the site yourself. The RubyGems.org website and service are maintained and operated by Ruby Central’s Open Source Program and the RubyGems team. It is funded by the greater Ruby community through support from sponsors, members, and infrastructure donations. If you build with Ruby and believe in our mission, you can join us in keeping RubyGems.org, RubyGems, and Bundler secure and sustainable for years to come by contributing here . Operated by Ruby Central Designed by DockYard Hosted by AWS Resolved with DNSimple Monitored by Datadog Gems served by Fastly Monitored by Honeybadger Secured by Mend.io English Nederlands 简体中文 正體中文 Português do Brasil Français Español Deutsch 日本語
2026-01-13T09:30:26
http://rb.zq1.de/compare.factory-20251103/
Index of /compare.factory-20251103 Index of /compare.factory-20251103 Name Last modified Size Description Parent Directory   -   build-compare-differed-builds-nachbau.txt 2025-11-03 12:00 8.2K   build-compare-differed-builds.txt 2025-11-03 12:00 1.7K   build-time.txt 2025-11-03 12:01 277K   build-verify-failed.txt 2025-11-03 12:00 8.2K   checksums.txt 2025-11-03 12:00 29M   differed-builds-nachbau.txt 2025-11-03 12:00 11K   differed-builds.txt 2025-11-03 12:00 2.6K   diffs/ 2025-11-05 13:58 -   failchecklist 2025-11-03 12:00 872   failed-builds.txt 2025-11-03 12:00 914   fast-builds.txt 2018-02-06 21:44 137K   giturls 2022-06-30 19:37 2.0M   giturls.good 2022-07-25 21:50 603K   graph.png 2025-11-03 12:18 12K   j3.swp 2025-03-25 06:49 0   minor-differed-builds.txt 2025-11-03 12:00 891   monthlyurl.txt 2025-10-01 09:09 5.9K   nachbau.swo 2025-01-11 19:20 0   nachbau.swp 2025-01-11 19:20 0   nachbaunew.swp 2025-03-14 20:17 0   oscpr 2025-11-03 11:57 418K   oscpr.failed 2025-11-03 12:00 1.0K   rb-class-a.txt 2025-11-03 12:17 445K   rb-class-dvi.txt 2025-11-03 12:17 860   rb-class-edj.txt 2025-11-03 12:17 2.4K   rb-class-elc.txt 2025-11-03 12:17 26K   rb-class-gem.txt 2025-11-03 12:17 0   rb-class-html.txt 2025-11-03 12:17 17M   rb-class-jar.txt 2025-11-03 12:17 47K   rb-class-javadoc.txt 2025-11-03 12:17 92   rb-class-mono.txt 2025-11-03 12:17 30   rb-class-pdf.txt 2025-11-03 12:17 1.3K   rb-class-png.txt 2025-11-03 12:17 13K   rb-class-ps.txt 2025-11-03 12:17 1.0K   rb-class-pyc.txt 2025-11-03 12:17 13K   rb-class-so.txt 2025-11-03 12:17 60K   rb-class-svg.txt 2025-11-03 12:17 1.4K   rb-class-tar.gz.txt 2025-11-03 12:17 0   rbbuild-tried.txt 2024-02-26 21:01 214K   rbplot.csv 2025-11-03 12:02 52K   rbstats.txt 2025-11-03 12:00 358   report-202009.txt 2020-10-01 15:54 1.4K   report-202010.txt 2020-10-30 06:27 1.6K   report-202011.txt 2020-11-28 01:18 1.6K   report-202012.txt 2020-12-31 13:46 1.5K   report-202101.txt 2021-01-29 15:17 1.5K   report-202102.txt 2021-02-27 07:17 1.6K   report-202103.txt 2021-03-28 11:24 1.1K   report-202104.txt 2021-04-29 03:40 2.1K   report-202105.txt 2021-06-01 05:52 1.8K   report-202106.txt 2021-06-30 09:54 1.6K   report-202107.txt 2021-07-30 12:07 1.2K   report-202108.txt 2021-08-30 18:31 1.3K   report-202109.txt 2021-09-30 19:55 1.3K   report-202110.txt 2021-10-31 11:20 1.1K   report-202111.txt 2021-11-30 20:43 1.1K   report-202112.txt 2021-12-31 20:19 1.3K   report-202201.txt 2022-01-31 13:53 1.1K   report-202203.txt 2022-03-31 22:21 1.5K   report-202204.txt 2022-04-28 15:12 2.4K   report-202205.txt 2022-06-01 16:52 2.1K   report-202206.txt 2022-07-04 19:48 1.3K   report-202207.txt 2022-07-31 21:29 5.5K   report-202208.txt 2022-09-01 21:02 4.7K   report-202209.txt 2022-10-05 12:29 4.8K   report-202210.txt 2022-11-03 19:52 4.0K   report-202212.txt 2023-01-09 13:12 12K   report-202301.txt 2023-01-31 09:40 11K   report-202301.txt.in 2023-01-31 09:40 934   report-202302.txt 2023-03-01 15:37 6.4K   report-202302.txt.in 2023-03-01 13:51 52   report-202303.txt 2023-04-02 18:50 5.5K   report-202303.txt.in 2023-04-02 19:32 120   report-202305.txt.in 2023-05-12 09:16 6   report-202306.txt.in 2023-06-30 14:11 402   report-202307.txt.in 2023-07-31 15:12 859   report-202308.txt.in 2023-08-30 09:06 261   report-202401.txt.in 2024-01-31 14:36 82   report-202402.txt.in 2024-02-28 13:31 80   report-202403.txt.in 2024-03-31 18:47 555   report-202404.txt.in 2024-04-30 08:06 874   report-202405.txt.in 2024-05-31 14:33 77   report-202406.txt.in 2024-06-30 21:48 311   report-202407.txt.in 2024-07-31 09:51 2.2K   report-202408.txt.in 2024-09-04 09:07 2.7K   report-202409.txt.in 2024-10-02 12:37 1.5K   report-202410.txt.in 2024-10-30 14:58 816   report-202411.txt 2024-11-29 17:26 11K   report-202411.txt.in 2024-11-29 17:25 493   report-202412.txt.in 2024-12-30 21:03 1.6K   report-202501.txt 2025-01-31 11:34 13K   report-202501.txt.in 2025-01-31 10:24 2.1K   report-202502.txt 2025-02-28 08:39 12K   report-202502.txt.in 2025-02-28 08:39 894   report-202503.txt.in 2025-03-31 21:14 958   report-202504.txt.in 2025-04-30 07:34 243   report-202505.txt.in 2025-05-29 07:59 917   report-202506.txt.in 2025-07-02 09:48 547   report-202507.txt.in 2025-07-31 18:33 232   report-202508.txt.in 2025-08-31 10:16 286   report-202509.txt.in 2025-09-30 21:51 93   report-202510.txt.in 2025-11-02 16:52 265   report.txt 2025-11-03 09:26 6.5K   reproducible.json 2025-11-03 12:01 6.7M   status-FTBFS-builds.txt 2024-02-26 21:01 1.4K   status-notforus-builds.txt 2024-02-26 21:01 3.9K   status-succeeded-builds.txt 2024-02-26 21:01 209K   status-waitdep-builds.txt 2024-02-26 21:01 168   timebombs 2025-10-18 05:49 5.9K   unreproduciblerings.txt 2025-11-03 12:01 445  
2026-01-13T09:30:26
http://rb.zq1.de/compare.factory-20250430/
Index of /compare.factory-20250430 Index of /compare.factory-20250430 Name Last modified Size Description Parent Directory   -   build-compare-differed-builds-nachbau.txt 2025-04-30 11:42 2.8K   build-compare-differed-builds.txt 2025-04-30 11:42 2.4K   build-time.txt 2025-04-30 11:43 275K   build-verify-failed.txt 2025-04-30 11:42 2.8K   checksums.txt 2025-04-30 11:42 29M   differed-builds-nachbau.txt 2025-04-30 11:42 6.0K   differed-builds.txt 2025-04-30 11:42 3.6K   diffs/ 2025-05-09 09:41 -   failchecklist 2025-04-30 11:42 622   failed-builds.txt 2025-04-30 11:42 667   fast-builds.txt 2018-02-06 21:44 137K   giturls 2022-06-30 19:37 2.0M   giturls.good 2022-07-25 21:50 603K   graph.png 2025-04-30 11:47 11K   j3.swp 2025-03-25 06:49 0   minor-differed-builds.txt 2025-04-30 11:42 1.2K   monthlyurl.txt 2025-04-01 10:02 5.2K   nachbau.swo 2025-01-11 19:20 0   nachbau.swp 2025-01-11 19:20 0   nachbaunew.swp 2025-03-14 20:17 0   oscpr 2025-04-30 07:05 415K   oscpr.failed 2025-04-30 11:42 465   rb-class-a.txt 2025-04-30 11:46 443K   rb-class-dvi.txt 2025-04-30 11:46 860   rb-class-edj.txt 2025-04-30 11:46 2.4K   rb-class-elc.txt 2025-04-30 11:46 26K   rb-class-gem.txt 2025-04-30 11:46 0   rb-class-html.txt 2025-04-30 11:46 17M   rb-class-jar.txt 2025-04-30 11:46 314K   rb-class-javadoc.txt 2025-04-30 11:46 92   rb-class-mono.txt 2025-04-30 11:46 30   rb-class-pdf.txt 2025-04-30 11:46 2.9K   rb-class-png.txt 2025-04-30 11:46 14K   rb-class-ps.txt 2025-04-30 11:46 486   rb-class-pyc.txt 2025-04-30 11:46 9.8K   rb-class-so.txt 2025-04-30 11:46 44K   rb-class-svg.txt 2025-04-30 11:46 1.4K   rb-class-tar.gz.txt 2025-04-30 11:46 0   rbbuild-tried.txt 2024-02-26 21:01 214K   rbplot.csv 2025-04-30 11:45 47K   rbstats.txt 2025-04-30 11:42 358   report-202009.txt 2020-10-01 15:54 1.4K   report-202010.txt 2020-10-30 06:27 1.6K   report-202011.txt 2020-11-28 01:18 1.6K   report-202012.txt 2020-12-31 13:46 1.5K   report-202101.txt 2021-01-29 15:17 1.5K   report-202102.txt 2021-02-27 07:17 1.6K   report-202103.txt 2021-03-28 11:24 1.1K   report-202104.txt 2021-04-29 03:40 2.1K   report-202105.txt 2021-06-01 05:52 1.8K   report-202106.txt 2021-06-30 09:54 1.6K   report-202107.txt 2021-07-30 12:07 1.2K   report-202108.txt 2021-08-30 18:31 1.3K   report-202109.txt 2021-09-30 19:55 1.3K   report-202110.txt 2021-10-31 11:20 1.1K   report-202111.txt 2021-11-30 20:43 1.1K   report-202112.txt 2021-12-31 20:19 1.3K   report-202201.txt 2022-01-31 13:53 1.1K   report-202203.txt 2022-03-31 22:21 1.5K   report-202204.txt 2022-04-28 15:12 2.4K   report-202205.txt 2022-06-01 16:52 2.1K   report-202206.txt 2022-07-04 19:48 1.3K   report-202207.txt 2022-07-31 21:29 5.5K   report-202208.txt 2022-09-01 21:02 4.7K   report-202209.txt 2022-10-05 12:29 4.8K   report-202210.txt 2022-11-03 19:52 4.0K   report-202212.txt 2023-01-09 13:12 12K   report-202301.txt 2023-01-31 09:40 11K   report-202301.txt.in 2023-01-31 09:40 934   report-202302.txt 2023-03-01 15:37 6.4K   report-202302.txt.in 2023-03-01 13:51 52   report-202303.txt 2023-04-02 18:50 5.5K   report-202303.txt.in 2023-04-02 19:32 120   report-202305.txt.in 2023-05-12 09:16 6   report-202306.txt.in 2023-06-30 14:11 402   report-202307.txt.in 2023-07-31 15:12 859   report-202308.txt.in 2023-08-30 09:06 261   report-202401.txt.in 2024-01-31 14:36 82   report-202402.txt.in 2024-02-28 13:31 80   report-202403.txt.in 2024-03-31 18:47 555   report-202404.txt.in 2024-04-30 08:06 874   report-202405.txt.in 2024-05-31 14:33 77   report-202406.txt.in 2024-06-30 21:48 311   report-202407.txt.in 2024-07-31 09:51 2.2K   report-202408.txt.in 2024-09-04 09:07 2.7K   report-202409.txt.in 2024-10-02 12:37 1.5K   report-202410.txt.in 2024-10-30 14:58 816   report-202411.txt 2024-11-29 17:26 11K   report-202411.txt.in 2024-11-29 17:25 493   report-202412.txt.in 2024-12-30 21:03 1.6K   report-202501.txt 2025-01-31 11:34 13K   report-202501.txt.in 2025-01-31 10:24 2.1K   report-202502.txt 2025-02-28 08:39 12K   report-202502.txt.in 2025-02-28 08:39 894   report-202503.txt.in 2025-03-31 21:14 958   report-202504.txt.in 2025-04-30 07:34 243   report.txt 2025-04-30 11:43 5.9K   reproducible.json 2025-04-30 11:43 6.7M   status-FTBFS-builds.txt 2024-02-26 21:01 1.4K   status-notforus-builds.txt 2024-02-26 21:01 3.9K   status-succeeded-builds.txt 2024-02-26 21:01 209K   status-waitdep-builds.txt 2024-02-26 21:01 168   timebombs 2025-04-25 12:40 5.1K   unreproduciblerings.txt 2025-04-30 11:43 589  
2026-01-13T09:30:26
http://hackage.haskell.org/package/semigroupoids-1.2.6.1/docs/Data-Semigroupoid-Static.html
Data.Semigroupoid.Static Source Contents Index semigroupoids-1.2.6.1: Haskell 98 semigroupoids: Category sans id Safe Haskell Safe-Infered Data.Semigroupoid.Static Documentation newtype Static f a b Source Constructors Static   Fields runStatic :: f (a -> b)   Instances Applicative f => Arrow ( Static f)   Alternative f => ArrowZero ( Static f)   Alternative f => ArrowPlus ( Static f)   Applicative f => ArrowChoice ( Static f)   Applicative f => Category ( Static f)   Apply f => Semigroupoid ( Static f)   Functor f => Functor ( Static f a)   Applicative f => Applicative ( Static f a)   ( Comonad f, Semigroup a, Monoid a) => Comonad ( Static f a)   ( Extend f, Semigroup a) => Extend ( Static f a)   Apply f => Apply ( Static f a)   Alt f => Alt ( Static f a)   Plus f => Plus ( Static f a)   Produced by Haddock version 2.10.0
2026-01-13T09:30:26
https://sendgrid.com/
SendGrid Email API and Email Marketing Campaigns | SendGrid Products <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Email API Trusted for reliable email delivery at scale. Overview An icon of a right arrow Take a tour An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Features <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> SMTP Service Email Validation Deliverability Insights <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Dynamic Templates Email Infrastructure 5-minute Integration <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Email Marketing Campaigns A suite of tools to create engaging email campaigns. Overview An icon of a right arrow Take a tour An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Features <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Email Automation Signup Forms Email Testing <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Email Design Email Templates Email Statistics <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Expert Services (Twilio Professional Services) Partner with an email expert. Overview An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Services <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Set-Up Assistance Delivery Help Ongoing Consulting Why SendGrid <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Overview Get more messages delivered. See better results. Why Twilio SendGrid An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Calculate Your Email ROI Our Delivery Rates Free Plan Email + SMS, WhatsApp, and More <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Solutions See how we can serve your email program. Email Solutions An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Developers Startups  ↗ High-Volume Senders <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Marketers Enterprises Ecommerce <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> ">   <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Customer Stories Leading brands trust SendGrid. See more customers An icon of a outbound link arrow Shopify logo ibotta logo Glassdoor logo Phenix logo Strava logo Vacasa logo <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> ">   Resources <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Resources Tips and tools to optimize your email program. See all resources An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Guides Blog <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Customer Stories Email Marketing Guide <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Customer Help Resources to send your best with Twilio SendGrid. Support An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> FAQ Status Partners   <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Knowledge Center API Reference Privacy and Security <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Featured Resources Our most popular content. Email Marketing Best Practices Developers <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Get started Resources to integrate and send via our APIs. View docs An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Start in 5 Minutes API Reference <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Event Webhook Libraries  ↗ <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> ">   <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Popular Topics Additional resources for successful integration. View Knowledge Center An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Templates Inbound Parse Webhook <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Contact Support Status Email Validation API <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Featured Libraries We support your language. Explore on Github An icon of a outbound link arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> c URL Node Ruby <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> PHP Go Python <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Java C# Pricing Contact us <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Support Already a Twilio SendGrid Customer? Contact support for help! Contact support An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Talk to sales Need help? Talk to an expert who can recommend the right solution for your email program. Contact sales An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> FAQ Get answers to frequently asked questions about Twilio SendGrid. View FAQ An icon of a right arrow Sign in Start for free Menu Products <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Email API Trusted for reliable email delivery at scale. Overview An icon of a right arrow Take a tour An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Features <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> SMTP Service Email Validation Deliverability Insights <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Dynamic Templates Email Infrastructure 5-minute Integration <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Email Marketing Campaigns A suite of tools to create engaging email campaigns. Overview An icon of a right arrow Take a tour An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Features <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Email Automation Signup Forms Email Testing <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Email Design Email Templates Email Statistics <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Expert Services (Twilio Professional Services) Partner with an email expert. Overview An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Services <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Set-Up Assistance Delivery Help Ongoing Consulting Why SendGrid <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Overview Get more messages delivered. See better results. Why Twilio SendGrid An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Calculate Your Email ROI Our Delivery Rates Free Plan Email + SMS, WhatsApp, and More <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Solutions See how we can serve your email program. Email Solutions An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Developers Startups  ↗ High-Volume Senders <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Marketers Enterprises Ecommerce <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> ">   <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Customer Stories Leading brands trust SendGrid. See more customers An icon of a outbound link arrow Shopify logo ibotta logo Glassdoor logo Phenix logo Strava logo Vacasa logo <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> ">   Resources <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Resources Tips and tools to optimize your email program. See all resources An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Guides Blog <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Customer Stories Email Marketing Guide <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Customer Help Resources to send your best with Twilio SendGrid. Support An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> FAQ Status Partners   <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Knowledge Center API Reference Privacy and Security <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Featured Resources Our most popular content. Email Marketing Best Practices Developers <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Get started Resources to integrate and send via our APIs. View docs An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Start in 5 Minutes API Reference <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Event Webhook Libraries  ↗ <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> ">   <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Popular Topics Additional resources for successful integration. View Knowledge Center An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Templates Inbound Parse Webhook <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Contact Support Status Email Validation API <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Featured Libraries We support your language. Explore on Github An icon of a outbound link arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> c URL Node Ruby <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> PHP Go Python <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Java C# Pricing <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> OVERVIEW Get more messages delivered. See better results. Email Automation Signup Forms Email Testing See All Features An icon of a right arrow Email Automation Signup Forms Email Testing See All Features An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> OVERVIEW Get more messages delivered. See better results. Email Automation Signup Forms Email Testing See All Features An icon of a right arrow Email Automation Signup Forms Email Testing See All Features An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> OVERVIEW Get more messages delivered. See better results. Email Automation Signup Forms Email Testing See All Features An icon of a right arrow Email Automation Signup Forms Email Testing See All Features An icon of a right arrow Contact us <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Support Already a Twilio SendGrid Customer? Contact support for help! Contact support An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Talk to sales Need help? Talk to an expert who can recommend the right solution for your email program. Contact sales An icon of a right arrow <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> FAQ Get answers to frequently asked questions about Twilio SendGrid. View FAQ An icon of a right arrow Sign in Start for free Twilio SendGrid Turn emails into revenue with a fully integrated email platform <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> With 99% deliverability and infrastructure that sends 148+ billion emails every month, Twilio's all-in-one customer engagement platform gives you everything you need to deliver email at scale. The result: increased customer engagement and higher ROI.  Start for free See plans & pricing An icon of a right arrow No credit card required Get started quickly Access to all Twilio products Email API and SMTP service for developers Trusted API for email delivery at scale. Learn more Email campaigns for marketers Tools to create engaging email campaigns. Learn more The Twilio SendGrid difference Proven deliverability <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> The tools and expertise you need to optimize your inbox delivery rate. Reach the inbox An icon of a right arrow Scale with confidence <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Send on a world-class platform that delivers more than 100 billion emails every month. Send & grow An icon of a right arrow Email expertise <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Experts can help you optimize your program, troubleshoot, and resolve issues. Work with experts An icon of a right arrow The email API by developers for developers <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Integrate and deliver in minutes with our RESTful APIs and SMTP, libraries to support your programming language, and interactive documentation. Learn more Take a tour JavaScript logo Curl logo Ruby logo Python logo Go logo PHP logo Java logo C# logo // using Twilio SendGrid's v3 Node.js Library // https://github.com/sendgrid/sendgrid-nodejs const sgMail = require('@sendgrid/mail'); sgMail.setApiKey(process.env.SENDGRID_API_KEY); const msg = { to: 'test@example.com', from: 'test@example.com', subject: 'Sending with Twilio SendGrid is Fun', text: 'and easy to do anywhere, even with Node.js', html: '<strong>and easy to do anywhere, even with Node.js</strong>', }; sgMail.send(msg); curl --request POST \ --url https://api.sendgrid.com/v3/mail/send \ --header "Authorization: Bearer $SENDGRID_API_KEY" \ --header 'Content-Type: application/json' \ --data '{"personalizations": [{"to": [{"email": "test@example.com"}]}],"from": {"email": "test@example.com"},"subject": "Sending with SendGrid is Fun","content": [{"type": "text/plain", "value": "and easy to do anywhere, even with cURL"}]}' # using SendGrid's Ruby Library # https://github.com/sendgrid/sendgrid-ruby require 'sendgrid-ruby' include SendGrid from = Email.new(email: 'test@example.com') to = Email.new(email: 'test@example.com') subject = 'Sending with SendGrid is Fun' content = Content.new(type: 'text/plain', value: 'and easy to do anywhere, even with Ruby') mail = Mail.new(from, subject, to, content) sg = SendGrid::API.new(api_key: ENV['SENDGRID_API_KEY']) response = sg.client.mail._('send').post(request_body: mail.to_json) puts response.status_code puts response.body puts response.headers # using SendGrid's Python Library # https://github.com/sendgrid/sendgrid-python import os from sendgrid import SendGridAPIClient from sendgrid.helpers.mail import Mail message = Mail( from_email='from_email@example.com', to_emails='to@example.com', subject='Sending with Twilio SendGrid is Fun', html_content='<strong>and easy to do anywhere, even with Python</strong>') try: sg = SendGridAPIClient(os.environ.get('SENDGRID_API_KEY')) response = sg.send(message) print(response.status_code) print(response.body) print(response.headers) except Exception as e: print(e.message) // using SendGrid's Go Library // https://github.com/sendgrid/sendgrid-go package main import ( "fmt" "log" "os" "github.com/sendgrid/sendgrid-go" "github.com/sendgrid/sendgrid-go/helpers/mail" ) func main() { from := mail.NewEmail("Example User", "test@example.com") subject := "Sending with SendGrid is Fun" to := mail.NewEmail("Example User", "test@example.com") plainTextContent := "and easy to do anywhere, even with Go" htmlContent := "<strong>and easy to do anywhere, even with Go</strong>" message := mail.NewSingleEmail(from, subject, to, plainTextContent, htmlContent) client := sendgrid.NewSendClient(os.Getenv("SENDGRID_API_KEY")) response, err := client.Send(message) if err != nil { log.Println(err) } else { fmt.Println(response.StatusCode) fmt.Println(response.Body) fmt.Println(response.Headers) } } <?php require 'vendor/autoload.php'; // If you're using Composer (recommended) // Comment out the above line if not using Composer // require("/sendgrid-php.php"); // If not using Composer, uncomment the above line and // download sendgrid-php.zip from the latest release here, // replacing with the path to the sendgrid-php.php file, // which is included in the download: // https://github.com/sendgrid/sendgrid-php/releases $email = new \SendGrid\Mail\Mail(); $email->setFrom("test@example.com", "Example User"); $email->setSubject("Sending with SendGrid is Fun"); $email->addTo("test@example.com", "Example User"); $email->addContent("text/plain", "and easy to do anywhere, even with PHP"); $email->addContent( "text/html", "<strong>and easy to do anywhere, even with PHP</strong>" ); $sendgrid = new \SendGrid(getenv('SENDGRID_API_KEY')); try { $response = $sendgrid->send($email); print $response->statusCode() . "\n"; print_r($response->headers()); print $response->body() . "\n"; } catch (Exception $e) { echo 'Caught exception: '. $e->getMessage() ."\n"; } // using SendGrid's Java Library // https://github.com/sendgrid/sendgrid-java import com.sendgrid.*; import java.io.IOException; public class Example { public static void main(String[] args) throws IOException { Email from = new Email("test@example.com"); String subject = "Sending with SendGrid is Fun"; Email to = new Email("test@example.com"); Content content = new Content("text/plain", "and easy to do anywhere, even with Java"); Mail mail = new Mail(from, subject, to, content); SendGrid sg = new SendGrid(System.getenv("SENDGRID_API_KEY")); Request request = new Request(); try { request.setMethod(Method.POST); request.setEndpoint("mail/send"); request.setBody(mail.build()); Response response = sg.api(request); System.out.println(response.getStatusCode()); System.out.println(response.getBody()); System.out.println(response.getHeaders()); } catch (IOException ex) { throw ex; } } } // using SendGrid's C# Library // https://github.com/sendgrid/sendgrid-csharp using SendGrid; using SendGrid.Helpers.Mail; using System; using System.Threading.Tasks; namespace Example { internal class Example { private static void Main() { Execute().Wait(); } static async Task Execute() { var apiKey = Environment.GetEnvironmentVariable("NAME_OF_THE_ENVIRONMENT_VARIABLE_FOR_YOUR_SENDGRID_KEY"); var client = new SendGridClient(apiKey); var from = new EmailAddress("test@example.com", "Example User"); var subject = "Sending with SendGrid is Fun"; var to = new EmailAddress("test@example.com", "Example User"); var plainTextContent = "and easy to do anywhere, even with C#"; var htmlContent = "<strong>and easy to do anywhere, even with C#</strong>"; var msg = MailHelper.CreateSingleEmail(from, to, subject, plainTextContent, htmlContent); var response = await client.SendEmailAsync(msg); } } } Intuitive email marketing campaigns for marketers <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Build meaningful connections with easy-to-use email marketing tools that streamline everything from design to send. Learn more Take a tour Free trial Start sending email with SendGrid for free <title>An icon of a outbound link arrow</title> <path class="icon-stroke" d="M75.3037 3.98207L3 75.5935M75.3037 3.98207L76.0435 43.3021M75.3037 3.98207L35.951 3.59351" stroke="#F22F46" stroke-width="5.5" stroke-linecap="round" stroke-linejoin="round"/> </svg> "> Sign up for a free trial to experience SendGrid’s reliable, scalable email delivery. Start for free View pricing Products Email Marketing Email API Twilio Programmable SMS Expert Services (Twilio Professional Services) One Platform Solution Pricing View all products An icon of a right arrow SendGrid is For Startups Enterprises High Volume Senders Marketers Ecommerce Developers Our customers An icon of a outbound link arrow Resources Guides Blog Knowledge Center Status Email Deliverability Guide State of Customer Engagement Contact support An icon of a right arrow Developers Start in 5 minutes API Reference SMTP Service Libraries Event Webhook Integration & Partners Go to docs An icon of a right arrow Company About Twilio SendGrid Our Team Our Customers Careers at Twilio Twilio Press & Media Trust & Security Contact us An icon of a right arrow Sitemap Privacy Terms Copyright 2026 SendGrid Twitter logo
2026-01-13T09:30:26
https://salsa.debian.org/reproducible-builds/reproducible-notes
Reproducible Builds / reproducible-notes · GitLab R reproducible-notes Project information Notes on build reproducibility of Debian packages Read more 18,531 Commits 5 Branches 0 Tags README Created on May 15, 2018 Loading
2026-01-13T09:30:26
https://www.brainspl.at/imprint/#ht-content
Imprint - Skip to content Home About Us Imprint Contact Home About Us Imprint Contact Imprint Home Imprint Michael Spielmann Grillparzerstraße 15 4020 Linz, Austria +43 732 345312 E-Mail: admin@brainspl.at 2026 Copyrights | brainspl.at Recent Posts Your Safety Checklist: Verifying Licenses and Fair Play at Online Casinos How to Choose the Right Online Casino in Malta How Venmo Changed the Finance Game This is why you should use Ruby on Rails The Creator of Ruby-on-Rails – Someone You Should Know! Categories Ruby on Rails Archives October 2025 June 2025 March 2025 August 2021 June 2021 February 2021 January 2021
2026-01-13T09:30:26
http://rb.zq1.de/sle/
Index of /sle Index of /sle Name Last modified Size Description Parent Directory   -   15.0/ 2018-08-20 23:05 -   15.1/ 2019-11-23 22:18 -   15.2/ 2020-07-22 08:53 -   15.3/ 2021-05-31 05:51 -   15.4/ 2022-04-06 09:32 -   15.5/ 2023-03-19 12:09 -   15.6/ 2024-05-23 13:58 -  
2026-01-13T09:30:26
https://docs.asciidoctor.org/asciidoctorj/latest/guides/extension-migration-guide-16-to-20/
Extension Migration: 1.6.x to 2.0.x | Asciidoctor Docs Asciidoctor Docs In this project AsciiDoc Language Syntax Quick Reference Processing Asciidoctor Ruby Asciidoctor.js JavaScript AsciidoctorJ Java Extensions Add-on Converters PDF Ruby EPUB3 Ruby reveal.js Ruby, JavaScript Source Compilers Reducer Ruby, JavaScript Extended Syntax Asciidoctor Diagram Ruby Tooling Build Automation Maven Tools Java Gradle Plugin Java Asciidoclet Java Text Editors / Viewers Browser Extension IntelliJ Plugin Chat List --> Source Tweets AsciidoctorJ Distribution Installation Usage Command Line Interface Convert Documents The Asciidoctor Interface Conversion Options Locate Files Safe Modes Examples Converting to EPUB3 Ruby Runtime Register a Ruby Extension Logs Handling API Read the Document Tree Write a Custom Converter Extensions API AsciidoctorJ Conversion Process Overview Understanding the AST Classes Write an Extension Block Macro Processor Inline Macro Processor Block Processor Include Processor Preprocessor Postprocessor Treeprocessor Docinfo Processor Register Extensions Manually Registering Extensions with javaExtensionRegistry Bulk Extension Registration ( Extension Groups ) Automatically Loading Extensions Logging Syntax Highlighter API Implement a Syntax Highlighter Adapter Lifecycle of a SyntaxHighlighterAdapter Format the Source Block Element Link and Copy External Resources Static Syntax Highlighting During Conversion Invocation Order Automatically Load a Syntax Highlighter Help & Guides Updating to New Releases v3.0.x migration guide Extension Migration: 1.6.x to 2.0.x Extension Migration: 1.5.x to 1.6.x Running in Frameworks Using AsciidoctorJ in an OSGi environment Running AsciidoctorJ on WildFly Running AsciidoctorJ with Spring Boot Accessing the JRuby Instance Loading Ruby Libraries Loading External Gems with GEM_PATH Optimization Using a pre-release version Using a Snapshot Version Development Project Layout Local Development Develop in an IDE Continuous Integration AsciidoctorJ 3.0 AsciiDoc Asciidoctor 2.0 Asciidoctor.js 3.0 2.2 AsciidoctorJ 3.0 2.5 Asciidoctor PDF 2.3 2.2 2.1 2.0 Asciidoctor EPUB3 2.3 Asciidoctor reveal.js 5.0 4.1 Maven Tools 3.2 Gradle Plugin Suite 5.0 4.0 Asciidoclet 2.0 1.5.6 Asciidoctor Diagram 3.0.1 Browser Extension Community AsciidoctorJ Help & Guides Updating to New Releases Extension Migration: 1.6.x to 2.0.x 3.0 3.0 2.5 Edit this Page Extension Migration: 1.6.x to 2.0.x Between 1.6.x and 2.0.x there are only very few API changes that affect an extension writer. This guide will illustrate the changes If you want to migrate from 1.5.x to the latest version, i.e. 2.0.x, please follow all individual sections, i.e. first Extension Migration Guide: 1.5.x to 1.6.x and then this. Extension registry location update You might have implemented the org.asciidoctor.extension.spi.ExtensionRegistry Service Interface to automatically register extensions as explained in the Automatically Loading Extensions . To achieve this you might have added these two artifacts: First the implementation: MyExtension.java for AsciidoctorJ 1.5.x or 1.6.x package com.example; import org.asciidoctor.extension.spi.ExtensionRegistry; public class MyExtension implements ExtensionRegistry { @Override public void register(Asciidoctor asciidoctor) { JavaExtensionRegistry javaExtensionRegistry = asciidoctor.javaExtensionRegistry(); javaExtensionRegistry.treeprocessor(MyTreeprocessor.class); } } Additionally you have added a file in META-INF/services/ that declares your extensions and allows it to be discovered: /META-INF/services/org.asciidoctor.extension.spi.ExtensionRegistry for AsciidoctorJ 1.5.x or 1.6.x com.example.MyExtension Now the interface org.asciidoctor.extension.spi.ExtensionRegistry moved to org.asciidoctor.jruby.extension.spi.ExtensionRegistry . That means that you have to update the name of the interface and rename the file in /META-INF/services/ . In particular the last step is easily overseen as the compiler will not warn you. Therefore the implementation has to look like this: MyExtension.java for AsciidoctorJ 2.0.x package com.example; import org.asciidoctor.jruby.extension.spi.ExtensionRegistry; (1) public class MyExtension implements ExtensionRegistry { @Override public void register(Asciidoctor asciidoctor) { JavaExtensionRegistry javaExtensionRegistry = asciidoctor.javaExtensionRegistry(); javaExtensionRegistry.treeprocessor(MyTreeprocessor.class); } } 1 Import ExtensionRegistry from the new package Additionally the file /META-INF/services/org.asciidoctor.extension.spi.ExtensionRegistry has to be renamed to /META-INF/services/org.asciidoctor.jruby.extension.spi.ExtensionRegistry . /META-INF/services/org.asciidoctor.jruby.extension.spi.ExtensionRegistry for AsciidoctorJ 2.0.x com.example.MyExtension InlineMacroProcessor should return a PhraseNode instead of a String A really simple extension yell can be implemented as an InlineMacroProcessor . It just writes the target value as an upper-case string. For example yell:yes[] is replaced by YES in the generated document. YellMacroProcessor.java for AsciidoctorJ 1.5.x or 1.6.x public class YellMacroProcessor extends InlineMacroProcessor { public YellMacroProcessor(String macroName, Map<String, Object> config) { super(macroName, config); } @Override public Object process(ContentNode parent, String target, Map<String, Object> attributes) { return target.toUpperCase(); } } The implementation also works with Asciidoctor 2.0.x but since version 2.0.0.rc.3 of Asciidoctor, when a String is returned, following entry is logged: INFO: expected substitution value for custom inline macro to be of type Inline; got String: yell:yes[] The correct implementation with Asciidoctor 2.0.x is to return a PhraseNode : YellMacroProcessor.java for AsciidoctorJ 2.0.x public class YellMacroProcessor extends InlineMacroProcessor { public YellMacroProcessor(String macroName, Map<String, Object> config) { super(macroName, config); } @Override public Object process(ContentNode parent, String target, Map<String, Object> attributes) { return createPhraseNode(parent, "quoted", target.toUpperCase(), attributes, new HashMap<>()); } } v3.0.x migration guide Extension Migration: 1.5.x to 1.6.x Asciidoctor Home --> Docs Chat Source List (archive) @asciidoctor Copyright © 2026 Dan Allen, Sarah White, and individual Asciidoctor contributors. Except where noted, the content is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) license. The UI for this site is derived from the Antora default UI and is licensed under the MPL-2.0 license. Several icons are imported from Octicons and are licensed under the MIT license. AsciiDoc® and AsciiDoc Language™ are trademarks of the Eclipse Foundation, Inc. Thanks to our backers and contributors for helping to make this project possible. Additional thanks to: Authored in AsciiDoc . Produced by Antora and Asciidoctor .
2026-01-13T09:30:26
https://github.com/jeremyevans/ape_tag_libs/actions/workflows/ci.yml
CI · Workflow runs · jeremyevans/ape_tag_libs · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / ape_tag_libs Public Notifications You must be signed in to change notification settings Fork 6 Star 12 Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights Actions: jeremyevans/ape_tag_libs Actions --> All workflows Workflows CI CI Show more workflows... Management Caches CI CI Actions Loading... Loading Sorry, something went wrong. Uh oh! There was an error while loading. Please reload this page . --> will be ignored since log searching is not yet available Show workflow options Create status badge Create status badge Loading Uh oh! There was an error while loading. Please reload this page . ci.yml --> will be ignored since log searching is not yet available 10 workflow runs 10 workflow runs Event Filter by Event Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching events. Status Filter by Status Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching statuses. Branch Filter by Branch Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching branches. Actor Filter by Actor Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching users. Test Ruby 4.0 specifically in CI CI #19: Commit 3564191 pushed by jeremyevans 45s master master 45s View workflow file Add Ruby 4.0 to CI CI #18: Commit 69974f3 pushed by jeremyevans 57s master master 57s View workflow file Use SimpleCov.add_filter block instead of string CI #17: Commit e197871 pushed by jeremyevans 51s master master 51s View workflow file Add JRuby 10.0 to CI CI #16: Commit ae22ae4 pushed by jeremyevans 2m 5s master master 2m 5s View workflow file Fix rdoc task name CI #15: Commit d9f4e84 pushed by jeremyevans 47s master master 47s View workflow file Switch rdoc task to normal rake task, avoid rdoc/task require CI #14: Commit f3c7665 pushed by jeremyevans 48s master master 48s View workflow file Fix ci.yml CI #13: Commit 0f39b6b pushed by jeremyevans 56s master master 56s View workflow file Work with ubuntu-latest using 24.04 by default in CI CI #12: Commit aed8866 pushed by jeremyevans Failure master master Failure View workflow file Add Ruby 3.4 to CI CI #11: Commit c6bbd56 pushed by jeremyevans 56s master master 56s View workflow file Use -W:strict_unused_block when running tests on Ruby 3.4+ CI #10: Commit ebab050 pushed by jeremyevans 51s master master 51s View workflow file You can’t perform that action at this time.
2026-01-13T09:30:26
https://github.com/jeremyevans/roda
GitHub - jeremyevans/roda: Routing Tree Web Toolkit Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / roda Public forked from soveran/cuba Notifications You must be signed in to change notification settings Fork 151 Star 2.2k Routing Tree Web Toolkit roda.jeremyevans.net License MIT license 2.2k stars 257 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/roda   master Branches Tags Go to file Code Open more actions menu     Folders and files Name Name Last commit message Last commit date Latest commit   History 1,867 Commits .github/ workflows .github/ workflows     doc doc     lib lib     spec spec     www www     .ci.gemfile .ci.gemfile     .gitignore .gitignore     CHANGELOG CHANGELOG     CONTRIBUTING CONTRIBUTING     MIT-LICENSE MIT-LICENSE     README.rdoc README.rdoc     Rakefile Rakefile     roda.gemspec roda.gemspec     View all files Repository files navigation README Contributing MIT license A routing tree web toolkit, designed for building fast and maintainable web applications in Ruby. Table of contents Installation Resources Goals Usage Running the application The routing tree Matchers Optional segments Match/Route Block Return Values Status codes Verb methods Root method Request and Response Pollution Composition Testing Settings Rendering Security Code Reloading Plugins No introspection Inspiration Ruby Support Policy Installation $ gem install roda Resources Website roda.jeremyevans.net Source github.com/jeremyevans/roda Bugs github.com/jeremyevans/roda/issues Discussion Forum (GitHub Discussions) github.com/jeremyevans/roda/discussions Alternate Discussion Forum (Google Group) groups.google.com/group/ruby-roda Goals Roda is designed with the following SUPER goals in mind: Simplicity Understandability Performance Extensibility Reliability Simplicity Roda is designed to be simple, both internally and externally. It uses a routing tree to enable you to write simpler and DRYer code. Understandability Roda is designed to avoid hidden control flow, so it is easy to follow the control flow you write in your routing tree to see the application’s entire handling process for a given request. Performance Roda has low per-request overhead, and the use of a routing tree and intelligent caching of internal datastructures makes it significantly faster than other popular ruby web frameworks. Extensibility Roda is built completely out of plugins, which makes it very extensible. You can override any part of Roda and call super to get the default behavior. Reliability Roda supports and encourages immutability. Roda apps are designed to be frozen in production, which eliminates possible thread safety issues. Additionally, Roda limits the instance variables, constants, and methods that it uses, so that they do not conflict with the ones you use for your application. Usage Here’s a simple application, showing how the routing tree works: # cat config.ru require "roda" class App < Roda route do | r | # GET / request r . root do r . redirect "/hello" end # /hello branch r . on "hello" do # Set variable for all routes in /hello branch @greeting = 'Hello' # GET /hello/world request r . get "world" do "#{@greeting} world!" end # /hello request r . is do # GET /hello request r . get do "#{@greeting}!" end # POST /hello request r . post do puts "Someone said #{@greeting}!" r . redirect end end end end end run App . freeze . app Here’s a breakdown of what is going on in the block above: The route block is called whenever a new request comes in. It is yielded an instance of a subclass of Rack::Request with some additional methods for matching routes. By convention, this argument should be named r . The primary way routes are matched in Roda is by calling r.on , r.is , r.root , r.get , or r.post . Each of these “routing methods” takes a “match block”. Each routing method takes each of the arguments (called matchers) that are given and tries to match it to the current request. If the method is able to match all of the arguments, it yields to the match block; otherwise, the block is skipped and execution continues. r.on matches if all of the arguments match. r.is matches if all of the arguments match and there are no further entries in the path after matching. r.get matches any GET request when called without arguments. r.get (when called with any arguments) matches only if the current request is a GET request and there are no further entries in the path after matching. r.root only matches a GET request where the current path is / . If a routing method matches and control is yielded to the match block, whenever the match block returns, Roda will return the Rack response array (containing status, headers, and body) to the caller. If the match block returns a string and the response body hasn’t already been written to, the block return value will be interpreted as the body for the response. If none of the routing methods match and the route block returns a string, it will be interpreted as the body for the response. r.redirect immediately returns the response, allowing for code such as r.redirect(path) if some_condition . If r.redirect is called without arguments and the current request method is not GET , it redirects to the current path. The .freeze.app at the end is optional. Freezing the app makes modifying app-level settings raise an error, alerting you to possible thread-safety issues in your application. It is recommended to freeze the app in production and during testing. The .app is an optimization, which saves a few method calls for every request. Running the Application Running a Roda application is similar to running any other rack-based application that uses a config.ru file. You can start a basic server using rackup , puma , unicorn , passenger , or any other webserver that can handle config.ru files: $ rackup The Routing Tree Roda is called a routing tree web toolkit because the way most sites are structured, routing takes the form of a tree (based on the URL structure of the site). In general: r.on is used to split the tree into different branches. r.is finalizes the routing path. r.get and r.post handle specific request methods. So, a simple routing tree might look something like this: r . on "a" do # /a branch r . on "b" do # /a/b branch r . is "c" do # /a/b/c request r . get do end # GET /a/b/c request r . post do end # POST /a/b/c request end r . get "d" do end # GET /a/b/d request r . post "e" do end # POST /a/b/e request end end It’s also possible to handle the same requests, but structure the routing tree by first branching on the request method: r . get do # GET r . on "a" do # GET /a branch r . on "b" do # GET /a/b branch r . is "c" do end # GET /a/b/c request r . is "d" do end # GET /a/b/d request end end end r . post do # POST r . on "a" do # POST /a branch r . on "b" do # POST /a/b branch r . is "c" do end # POST /a/b/c request r . is "e" do end # POST /a/b/e request end end end This allows you to easily separate your GET request handling from your POST request handling. If you only have a small number of POST request URLs and a large number of GET request URLs, this may make things easier. However, routing first by the path and last by the request method is likely to lead to simpler and DRYer code. This is because you can act on the request at any point during the routing. For example, if all requests in the /a branch need access permission A and all requests in the /a/b branch need access permission B , you can easily handle this in the routing tree: r . on "a" do # /a branch check_perm ( :A ) r . on "b" do # /a/b branch check_perm ( :B ) r . is "c" do # /a/b/c request r . get do end # GET /a/b/c request r . post do end # POST /a/b/c request end r . get "d" do end # GET /a/b/d request r . post "e" do end # POST /a/b/e request end end Being able to operate on the request at any point during the routing is one of the major advantages of Roda. Matchers Other than r.root , the routing methods all take arguments called matchers. If all of the matchers match, the routing method yields to the match block. Here’s an example showcasing how different matchers work: class App < Roda route do | r | # GET / r . root do "Home" end # GET /about r . get "about" do "About" end # GET /post/2011/02/16/hello r . get "post" , Integer , Integer , Integer , String do | year , month , day , slug | "#{year}-#{month}-#{day} #{slug}" #=> "2011-02-16 hello" end # GET /username/foobar branch r . on "username" , String , method: :get do | username | user = User . find_by_username ( username ) # GET /username/foobar/posts r . is "posts" do # You can access user here, because the blocks are closures. "Total Posts: #{user.posts.size}" #=> "Total Posts: 6" end # GET /username/foobar/following r . is "following" do user . following . size . to_s #=> "1301" end end # /search?q=barbaz r . get "search" do "Searched for #{r.params['q']}" #=> "Searched for barbaz" end r . is "login" do # GET /login r . get do "Login" end # POST /login?user=foo&password=baz r . post do "#{r.params['user']}:#{r.params['password']}" #=> "foo:baz" end end end end Here’s a description of the matchers. Note that “segment”, as used here, means one part of the path preceded by a / . So, a path such as /foo/bar//baz has four segments: /foo , /bar , / , and /baz . The / here is considered the empty segment. String If a string does not contain a slash, it matches a single segment containing the text of the string, preceded by a slash. "" # matches "/" "foo" # matches "/foo" "foo" # does not match "/food" If a string contains any slashes, it matches one additional segment for each slash: "foo/bar" # matches "/foo/bar" "foo/bar" # does not match "/foo/bard" Regexp Regexps match one or more segments by looking for the pattern, preceded by a slash, and followed by a slash or the end of the path: /foo\w+/ # matches "/foobar" /foo\w+/ # does not match "/foo/bar" /foo/i # matches "/foo", "/Foo/" /foo/i # does not match "/food" If any patterns are captured by the Regexp, they are yielded: /foo\w+/ # matches "/foobar", yields nothing /foo(\w+)/ # matches "/foobar", yields "bar" Class There are two classes that are supported as matchers, String and Integer. String matches any non-empty segment, yielding the segment except for the preceding slash Integer matches any segment of 0-9, returns matched values as integers Using String and Integer is the recommended way to handle arbitrary segments String # matches "/foo", yields "foo" String # matches "/1", yields "1" String # does not match "/" Integer # does not match "/foo" Integer # matches "/1", yields 1 Integer # does not match "/" Symbol Symbols match any nonempty segment, yielding the segment except for the preceding slash: :id # matches "/foo" yields "foo" :id # does not match "/" Symbol matchers operate the same as the class String matcher, and is the historical way to do arbitrary segment matching. It is recommended to use the class String matcher in new code as it is a bit more intuitive. Proc Procs match unless they return false or nil: proc { true } # matches anything proc { false } # does not match anything Procs don’t capture anything by default, but they can do so if you add the captured text to r.captures . Arrays Arrays match when any of their elements match. If multiple matchers are given to r.on , they all must match (an AND condition). If an array of matchers is given, only one needs to match (an OR condition). Evaluation stops at the first matcher that matches. Additionally, if the matched object is a String, the string is yielded. This makes it easy to handle multiple strings without a Regexp: [ 'page1' , 'page2' ] # matches "/page1", "/page2" [] # does not match anything Sets Sets match if the next segment in the request path matches one of the elements in the set (non-String elements in the set are ignored). The matched element is yielded. Set [ 'page1' , 'page2' ] # matches "/page1", "/page2" Set [] # does not match anything In general, a Set matcher has the same behavior as an Array matcher containing only the set’s string elements, but will perform better for when there are a large number of elements in the set. Hash Hashes allow easily calling specialized match methods on the request. The default registered matchers included with Roda are documented below. Some plugins add additional hash matchers, and the hash_matcher plugin allows for easily defining your own: class App < Roda plugin :hash_matcher hash_matcher ( :foo ) do | v | # ... end route do | r | r . on foo: 'bar' do # ... end end end :all The :all matcher matches if all of the entries in the given array match, so r . on all: [ String , String ] do # ... end is the same as: r . on String , String do # ... end The reason it also exists as a separate hash matcher is so you can use it inside an array matcher, so: r . on [ 'foo' , { all: [ 'foos' , Integer ]}] do end would match /foo and /foos/10 , but not /foos . :method The :method matcher matches the method of the request. You can provide an array to specify multiple request methods and match on any of them: { method: :post } # matches POST { method: [ 'post' , 'patch' ]} # matches POST and PATCH true If true is given directly as a matcher, it always matches. false, nil If false or nil is given directly as a matcher, it doesn’t match anything. Everything else Everything else raises an error, unless support is specifically added for it (some plugins add support for additional matcher types). Optional segments There are multiple ways you can handle optional segments in Roda. For example, let’s say you want to accept both /items/123 and /items/123/456 , with 123 being the item’s id, and 456 being some optional data. The simplest way to handle this is by treating this as two separate routes with a shared branch: r . on "items" , Integer do | item_id | # Shared code for branch here # /items/123/456 r . is Integer do | optional_data | end # /items/123 r . is do end end This works well for many cases, but there are also cases where you really want to treat it as one route with an optional segment. One simple way to do that is to use a parameter instead of an optional segment (e.g. /items/123?opt=456 ). r . is "items" , Integer do | item_id | optional_data = r . params [ 'opt' ]. to_s end However, if you really do want to use a optional segment, there are a couple different ways to use matchers to do so. One is using an array matcher where the last element is true: r . is "items" , Integer , [ String , true ] do | item_id , optional_data | end Note that this technically yields only one argument instead of two arguments if the optional segment isn’t provided. An alternative way to implement this is via a regexp: r . is "items" , /(\d+)(?:\/(\d+))?/ do | item_id , optional_data | end Match/Route Block Return Values If the response body has already been written to by calling response.write directly, then any return value of a match block or route block is ignored. If the response body has not already been written to, then the match block or route block return value is inspected: String used as the response body nil, false ignored everything else raises an error Plugins can add support for additional match block and route block return values. One example of this is the json plugin, which allows returning arrays and hashes in match and route blocks and converts those directly to JSON and uses the JSON as the response body. Status Codes When it comes time to finalize a response, if a status code has not been set manually and anything has been written to the response, the response will use a 200 status code. Otherwise, it will use a 404 status code. This enables the principle of least surprise to work: if you don’t handle an action, a 404 response is assumed. You can always set the status code manually, via the status attribute for the response. route do | r | r . get "hello" do response . status = 200 end end When redirecting, the response will use a 302 status code by default. You can change this by passing a second argument to r.redirect : route do | r | r . get "hello" do r . redirect "/other" , 301 # use 301 Moved Permanently end end Verb Methods As displayed above, Roda has r.get and r.post methods for matching based on the HTTP request method. If you want to match on other HTTP request methods, use the all_verbs plugin. When called without any arguments, these match as long as the request has the appropriate method, so: r . get do end matches any GET request, and r . post do end matches any POST request If any arguments are given to the method, these match only if the request method matches, all arguments match, and the path has been fully matched by the arguments, so: r . post "" do end matches only POST requests where the current path is / . r . get "a/b" do end matches only GET requests where the current path is /a/b . The reason for this difference in behavior is that if you are not providing any arguments, you probably don’t want to also test for an exact match with the current path. If that is something you do want, you can provide true as an argument: r . on "foo" do r . get true do # Matches GET /foo, not GET /foo/.* end end If you want to match the request method and do only a partial match on the request path, you need to use r.on with the :method hash matcher: r . on "foo" , method: :get do # Matches GET /foo(/.*)? end Root Method As displayed above, you can also use r.root as a match method. This method matches GET requests where the current path is / . r.root is similar to r.get "" , except that it does not consume the / from the path. Unlike the other matching methods, r.root takes no arguments. Note that r.root does not match if the path is empty; you should use r.get true for that. If you want to match either the empty path or / , you can use r.get ["", true] , or use the slash_path_empty plugin. Note that r.root only matches GET requests. So, to handle POST / requests, use r.post '' . Request and Response While the request object is yielded to the route block, it is also available via the request method. Likewise, the response object is available via the response method. The request object is an instance of a subclass of Rack::Request , with some additional methods. If you want to extend the request and response objects with additional modules, you can use the module_include plugin. Pollution Roda tries very hard to avoid polluting the scope of the route block. This should make it unlikely that Roda will cause namespace issues with your application code. Some of the things Roda does: The only instance variables defined by default in the scope of the route block are @_request and @_response . All instance variables in the scope of the route block used by plugins that ship with Roda are prefixed with an underscore. The main methods defined, beyond the default methods for Object , are env , opts , request , response , and session . call and _call are also defined, but are deprecated. All other methods defined are prefixed with roda Constants inside the Roda namespace are all prefixed with Roda (e.g., Roda::RodaRequest ). Composition You can mount any Rack app (including another Roda app), with its own middlewares, inside a Roda app, using r.run : class API < Roda route do | r | r . is do # ... end end end class App < Roda route do | r | r . on "api" do r . run API end end end run App . app This will take any path starting with /api and send it to API . In this example, API is a Roda app, but it could easily be a Sinatra, Rails, or other Rack app. When you use r.run , Roda calls the given Rack app ( API in this case); whatever the Rack app returns will be returned as the response for the current application. If you have a lot of rack applications that you want to dispatch to, and which one to dispatch to is based on the request path prefix, look into the multi_run plugin. hash_branches plugin If you are just looking to split up the main route block up by branches, you should use the hash_branches plugin, which keeps the current scope of the route block: class App < Roda plugin :hash_branches hash_branch "api" do | r | r . is do # ... end end route do | r | r . hash_branches end end run App . app This allows you to set instance variables in the main route block and still have access to them inside the api route block. Testing It is very easy to test Roda with Rack::Test or Capybara . Roda’s own tests use minitest/spec . The default Rake task will run the specs for Roda. Settings Each Roda app can store settings in the opts hash. The settings are inherited by subclasses. Roda . opts [ :layout ] = "guest" class Users < Roda ; end class Admin < Roda opts [ :layout ] = "admin" end Users . opts [ :layout ] # => 'guest' Admin . opts [ :layout ] # => 'admin' Feel free to store whatever you find convenient. Note that when subclassing, Roda only does a shallow clone of the settings. If you store nested structures and plan to mutate them in subclasses, it is your responsibility to dup the nested structures inside Roda.inherited (making sure to call super ). This should be done so that modifications to the parent class made after subclassing do not affect the subclass, and vice-versa. The plugins that ship with Roda freeze their settings and only allow modification to their settings by reloading the plugin, and external plugins are encouraged to follow this approach. The following options are respected by the default library or multiple plugins: :add_script_name Prepend the SCRIPT_NAME for the request to paths. This is useful if you mount the app as a path under another app. :check_arity Whether arity for blocks passed to Roda should be checked to determine if they can be used directly to define methods or need to be wrapped. By default, for backwards compatibility, this is true, so Roda will check blocks and handle cases where the arity of the block does not match the expected arity. This can be set to :warn to issue warnings whenever Roda detects an arity mismatch. If set to false , Roda does not check the arity of blocks, which can result in failures at runtime if the arity of the block does not match what Roda expects. Note that Roda does not check the arity for lambda blocks, as those are strict by default. :check_dynamic_arity Similar to :check_arity, but used for checking blocks where the number of arguments Roda will call the blocks with is not possible to determine when defining the method. By default, Roda checks arity for such methods, but doing so actually slows the method down even if the number of arguments matches the expected number of arguments. :freeze_middleware Whether to freeze all middleware when building the rack app. :json_parser A callable for parsing JSON ( JSON.parse in general used by default). :json_serializer A callable for serializing JSON ( to_json in general used by default). :root Set the root path for the app. This defaults to the current working directory of the process. :sessions_convert_symbols This should be set to true if the sessions in use do not support roundtripping of symbols (for example, when sessions are serialized via JSON). There may be other options supported by individual plugins, if so it will be mentioned in the documentation for the plugin. Rendering Roda ships with a render plugin that provides helpers for rendering templates. It uses Tilt , a gem that interfaces with many template engines. The erb engine is used by default. Note that in order to use this plugin you need to have Tilt installed, along with the templating engines you want to use. This plugin adds the render and view methods, for rendering templates. By default, view will render the template inside the default layout template; render will just render the template. class App < Roda plugin :render route do | r | @var = '1' r . get "render" do # Renders the views/home.erb template, which will have access to # the instance variable @var, as well as local variable content. render ( "home" , locals: { content: "hello, world" }) end r . get "view" do @var2 = '1' # Renders the views/home.erb template, which will have access to the # instance variables @var and @var2, and takes the output of that and # renders it inside views/layout.erb (which should yield where the # content should be inserted). view ( "home" ) end end end You can override the default rendering options by passing a hash to the plugin: class App < Roda plugin :render , escape: true , # Automatically escape output in erb templates using Erubi's escaping support views: 'admin_views' , # Default views directory layout_opts: { template: 'admin_layout' , engine: 'html.erb' }, # Default layout options template_opts: { default_encoding: 'UTF-8' } # Default template options end Security Web application security is a very large topic, but here are some things you can do with Roda to prevent some common web application vulnerabilities. Session Security By default, Roda doesn’t turn on sessions, and if you don’t need sessions, you can skip this section. If you do need sessions, Roda offers two recommended ways to implement cookie-based sessions. If you do not need any session support in middleware, and only need session support in the Roda application, then use the sessions plugin: require 'roda' class App < Roda plugin :sessions , secret: ENV [ 'SESSION_SECRET' ] end The :secret option should be a randomly generated string of at least 64 bytes. If you have middleware that need access to sessions, then use the RodaSessionMiddleware that ships with Roda: require 'roda' require 'roda/session_middleware' class App < Roda use RodaSessionMiddleware , secret: ENV [ 'SESSION_SECRET' ] end If you need non-cookie based sessions (such as sessions stored in a database), you should use an appropriate external middleware. It is possible to use other session cookie middleware such as Rack::Session::Cookie , but other middleware may not have the same security features that Roda’s session support does. For example, the session cookies used by the Rack::Session::Cookie middleware provided by Rack before Rack 3 are not encrypted, just signed to prevent tampering. For any cookie-based sessions, make sure that the necessary secrets ( :secret option) are not disclosed to an attacker. Knowledge of the secret(s) can allow an attacker to inject arbitrary session values. In the case of Rack::Session::Cookie , that can also lead remote code execution. Cross Site Request Forgery (CSRF) CSRF can be prevented by using the route_csrf plugin that ships with Roda. The route_csrf plugin uses modern security practices to create CSRF tokens, requires request-specific tokens by default, and offers control to the user over where in the routing tree that CSRF tokens are checked. For example, if you are using the public plugin to serve static files and the assets plugin to serve assets, you wouldn’t need to check for CSRF tokens for either of those, so you could put the CSRF check after those in the routing tree, but before handling other requests: route do | r | r . public r . assets check_csrf! # Must call this to check for valid CSRF tokens # ... end Cross Site Scripting (XSS) The easiest way to prevent XSS with Roda is to use a template library that automatically escapes output by default. The :escape option to the render plugin sets the ERB template processor to escape by default, so that in your templates: <%= '<>' %> # outputs <> <%== '<>' %> # outputs <> When using the :escape option, you will need to ensure that your layouts are not escaping the output of the content template: <%== yield %> # not <%= yield %> This support requires Erubi . Unexpected Parameter Types Rack converts submitted parameters into a hash of strings, arrays, and nested hashes. Since the user controls the submission of parameters, you should treat any submission of parameters with caution, and should be explicitly checking and/or converting types before using any submitted parameters. One way to do this is explicitly after accessing them: # Convert foo_id parameter to an integer request . params [ 'foo_id' ]. to_i However, it is easy to forget to convert the type, and if the user submits foo_id as a hash or array, a NoMethodError will be raised. Worse is if you do: some_method ( request . params [ 'bar' ]) Where some_method supports both a string argument and a hash argument, and you expect the parameter will be submitted as a string, and some_method ‘s handling of a hash argument performs an unauthorized action. Roda ships with a typecast_params plugin that can easily handle the typecasting of submitted parameters, and it is recommended that all Roda applications that deal with parameters use it or another tool to explicitly convert submitted parameters to the expected types. Content Security Policy The Content-Security-Policy HTTP header can be used to instruct the browser on what types of content to allow and where content can be loaded from. Roda ships with a content_security_policy plugin that allows for the easy configuration of the content security policy. Here’s an example of a fairly restrictive content security policy configuration: class App < Roda plugin :content_security_policy do | csp | csp . default_src :none # deny everything by default csp . style_src :self csp . script_src :self csp . connect_src :self csp . img_src :self csp . font_src :self csp . form_action :self csp . base_uri :none csp . frame_ancestors :none csp . block_all_mixed_content csp . report_uri 'CSP_REPORT_URI' end end Other Security Related HTTP Headers You may want to look into setting the following HTTP headers, which can be done at the web server level, but can also be done at the application level using using the default_headers plugin: Strict-Transport-Security Enforces SSL/TLS Connections to the application. X-Content-Type-Options Forces some browsers to respect a declared Content-Type header. X-Frame-Options Provides click-jacking protection by not allowing usage inside a frame. Only include this if you want to support and protect old browsers that do not support Content-Security-Policy. Example: class App < Roda plugin :default_headers , 'Content-Type' => 'text/html' , 'Strict-Transport-Security' => 'max-age=63072000; includeSubDomains' , 'X-Content-Type-Options' => 'nosniff' , 'X-Frame-Options' => 'deny' end Rendering Templates Derived From User Input Roda’s rendering plugin by default checks that rendered templates are inside the views directory. This is because rendering templates outside the views directory is not commonly needed, and it prevents a common attack (which is especially severe if there is any location on the file system that users can write files to). You can specify which directories are allowed using the :allowed_paths render plugin option. If you really want to turn path checking off, you can do so via the check_paths: false render plugin option. Code Reloading Roda does not ship with integrated support for code reloading, but there are rack-based reloaders that will work with Roda apps. Zeitwerk (which Rails now uses for reloading) can be used with Roda. It requires minimal setup and handles most cases. It overrides require when activated. If it can meet the needs of your application, it’s probably the best approach. rack-unreloader uses a fast approach to reloading while still being fairly safe, as it only reloads files that have been modified, and unloads constants defined in the files before reloading them. It can handle advanced cases that Zeitwerk does not support, such as classes defined in multiple files (common when using separate route files for different routing branches in the same application). However, rack-unreloader does not modify core classes and using it requires modifying your application code to use rack-unreloader specific APIs, which may not be simple. AutoReloader provides transparent reloading for all files reached from one of the reloadable_paths option entries, by detecting new top-level constants and removing them when any of the reloadable loaded files changes. It overrides require and require_relative when activated (usually in the development environment). No configurations other than reloadable_paths are required. rerun uses a fork/exec approach for loading new versions of your app. It work without any changes to application code, but may be slower as they have to reload the entire application on every change. However, for small apps that load quickly, it may be a good approach. There is no one reloading solution that is the best for all applications and development approaches. Consider your needs and the tradeoffs of each of the reloading approaches, and pick the one you think will work best. If you are unsure where to start, it may be best to start with Zeitwerk, and only consider other options if it does not work well for you. Plugins By design, Roda has a very small core, providing only the essentials. All nonessential features are added via plugins. Roda’s plugins can override any Roda method and call super to get the default behavior, which makes Roda very extensible. Roda ships with a large number of plugins , and some other libraries ship with support for Roda . How to create plugins Authoring your own plugins is pretty straightforward. Plugins are just modules, which may contain any of the following modules: InstanceMethods module included in the Roda class ClassMethods module that extends the Roda class RequestMethods module included in the class of the request RequestClassMethods module extending the class of the request ResponseMethods module included in the class of the response ResponseClassMethods module extending the class of the response If the plugin responds to load_dependencies , it will be called first, and should be used if the plugin depends on another plugin. If the plugin responds to configure , it will be called last, and should be used to configure the plugin. Both load_dependencies and configure are called with the additional arguments and block that was given to the plugin call. So, a simple plugin to add an instance method would be: module MarkdownHelper module InstanceMethods def markdown ( str ) BlueCloth . new ( str ). to_html end end end Roda . plugin MarkdownHelper Registering plugins If you want to ship a Roda plugin in a gem, but still have Roda load it automatically via Roda.plugin :plugin_name , you should place it where it can be required via roda/plugins/plugin_name and then have the file register it as a plugin via Roda::RodaPlugins.register_plugin . It’s recommended, but not required, that you store your plugin module in the Roda::RodaPlugins namespace: class Roda module RodaPlugins module Markdown module InstanceMethods def markdown ( str ) BlueCloth . new ( str ). to_html end end end register_plugin :markdown , Markdown end end To avoid namespace pollution, you should avoid creating your module directly in the Roda namespace. Additionally, any instance variables created inside InstanceMethods should be prefixed with an underscore (e.g., @_variable ) to avoid polluting the scope. Finally, do not add any constants inside the InstanceMethods module, add constants to the plugin module itself ( Markdown in the above example). If you are planning on shipping your plugin in an external gem, it is recommended that you follow standard gem naming conventions for extensions . So if your plugin module is named FooBar , your gem name should be roda-foo_bar . No Introspection Because a routing tree does not store the routes in a data structure, but directly executes the routing tree block, you cannot introspect the routes when using a routing tree. If you would like to introspect your routes when using Roda, there is an external plugin named roda-route_list , which allows you to add appropriate comments to your routing files, and has a parser that will parse those comments into routing metadata that you can then introspect. Inspiration Roda was inspired by Sinatra and Cuba . It started out as a fork of Cuba, from which it borrows the idea of using a routing tree (which Cuba in turn took from Rum ). From Sinatra, it takes the ideas that route blocks should return the request bodies and that routes should be canonical. Roda’s plugin system is based on the plugin system used by Sequel . Ruby Support Policy Roda fully supports the currently supported versions of Ruby (MRI) and JRuby. It may support unsupported versions of Ruby or JRuby, but such support may be dropped in any minor version if keeping it becomes a support issue. The minimum Ruby version required to run the current version of Roda is 1.9.2, and the minimum JRuby version is 9.0.0.0. License MIT Maintainer Jeremy Evans <code@jeremyevans.net> About Routing Tree Web Toolkit roda.jeremyevans.net Resources Readme License MIT license Contributing Contributing Uh oh! There was an error while loading. Please reload this page . Activity Stars 2.2k stars Watchers 56 watching Forks 151 forks Report repository Used by 3.2k + 3,150 Languages Ruby 96.7% HTML 3.3% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time.
2026-01-13T09:30:26
https://github.com/jeremyevans/forme/actions/workflows/ci.yml
CI · Workflow runs · jeremyevans/forme · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / forme Public Notifications You must be signed in to change notification settings Fork 27 Star 329 Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights Actions: jeremyevans/forme Actions --> All workflows Workflows CI CI pages-build-deployment pages-build-deployment Show more workflows... Management Caches Deployments CI CI Actions Loading... Loading Sorry, something went wrong. Uh oh! There was an error while loading. Please reload this page . --> will be ignored since log searching is not yet available Show workflow options Create status badge Create status badge Loading Uh oh! There was an error while loading. Please reload this page . ci.yml --> will be ignored since log searching is not yet available 16 workflow runs 16 workflow runs Event Filter by Event Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching events. Status Filter by Status Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching statuses. Branch Filter by Branch Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching branches. Actor Filter by Actor Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching users. Add Ruby 4.0 to CI CI #121: Commit fa3f50c pushed by jeremyevans 12m 45s master master 12m 45s View workflow file Bump version to 2.7.0 CI #120: Commit 388c069 pushed by jeremyevans 1m 33s master master 1m 33s View workflow file Omit closing / for void element tags CI #119: Commit 7ada3d6 pushed by jeremyevans 1m 22s master master 1m 22s View workflow file Allow emit: false option to work correctly for non-model template forms CI #118: Commit 6277bb1 pushed by jeremyevans 2m 18s master master 2m 18s View workflow file Use SimpleCov.add_filter block instead of string CI #117: Commit fb17615 pushed by jeremyevans 2m 19s master master 2m 19s View workflow file Add JRuby 10.0 to CI CI #116: Commit f3f2206 pushed by jeremyevans 6m 55s master master 6m 55s View workflow file Switch rdoc task to normal rake task, avoid rdoc/task require CI #115: Commit 62f43ca pushed by jeremyevans 2m 49s master master 2m 49s View workflow file Support :label_attr as an option-specific option for radioset/checkbo… CI #114: Commit 856e9ab pushed by jeremyevans 2m 4s master master 2m 4s View workflow file Fix concurrent-ruby version in Ruby 2.5/2.6 CI CI #113: Commit 675c9de pushed by jeremyevans 1m 27s master master 1m 27s View workflow file Allow Tag#initialize to accept a block, and treat it the same as the … CI #112: Commit 124fc54 pushed by jeremyevans 2m 5s master master 2m 5s View workflow file Install libsqlite3-dev in CI, hopefully fixes Ruby 2.0-2.4 CI #111: Commit a3f3415 pushed by jeremyevans 1m 28s master master 1m 28s View workflow file CI CI #110: by jeremyevans 2m 14s master master 2m 14s View workflow file Add Ruby 3.4 to CI CI #109: Commit 792668a pushed by jeremyevans 3m 52s master master 3m 52s View workflow file Try to work around CI failure on JRuby 9.4 CI #108: Commit f9d2bf7 pushed by jeremyevans 1m 14s master master 1m 14s View workflow file Make specs pass with recent version of Sinatra CI #107: Commit b3631c9 pushed by jeremyevans 1m 9s master master 1m 9s View workflow file Use -W:strict_unused_block when running tests on Ruby 3.4+ CI #106: Commit 7452d6d pushed by jeremyevans 2m 7s master master 2m 7s View workflow file You can’t perform that action at this time.
2026-01-13T09:30:26
http://rb.zq1.de/compare.factory-20250901/
Index of /compare.factory-20250901 Index of /compare.factory-20250901 Name Last modified Size Description Parent Directory   -   build-compare-differed-builds-nachbau.txt 2025-09-01 14:49 9.1K   build-compare-differed-builds.txt 2025-09-01 14:49 1.9K   build-time.txt 2025-09-01 14:50 275K   build-verify-failed.txt 2025-09-01 14:49 9.1K   checksums.txt 2025-09-01 14:49 29M   differed-builds-nachbau.txt 2025-09-01 14:49 12K   differed-builds.txt 2025-09-01 14:49 2.9K   diffs/ 2025-09-01 07:54 -   failchecklist 2025-09-01 14:49 955   failed-builds.txt 2025-09-01 14:49 1.0K   fast-builds.txt 2018-02-06 21:44 137K   giturls 2022-06-30 19:37 2.0M   giturls.good 2022-07-25 21:50 603K   graph.png 2025-07-31 19:08 11K   j3.swp 2025-03-25 06:49 0   minor-differed-builds.txt 2025-09-01 14:49 1.0K   monthlyurl.txt 2025-08-02 19:18 5.6K   nachbau.swo 2025-01-11 19:20 0   nachbau.swp 2025-01-11 19:20 0   nachbaunew.swp 2025-03-14 20:17 0   oscpr 2025-09-01 07:48 415K   oscpr.failed 2025-09-01 14:49 297   rb-class-a.txt 2025-09-01 15:44 442K   rb-class-dvi.txt 2025-09-01 15:44 860   rb-class-edj.txt 2025-09-01 15:44 2.4K   rb-class-elc.txt 2025-09-01 15:44 26K   rb-class-gem.txt 2025-09-01 15:44 0   rb-class-html.txt 2025-09-01 15:44 17M   rb-class-jar.txt 2025-09-01 15:44 46K   rb-class-javadoc.txt 2025-09-01 15:44 92   rb-class-mono.txt 2025-09-01 15:44 30   rb-class-pdf.txt 2025-09-01 15:44 1.3K   rb-class-png.txt 2025-09-01 15:44 13K   rb-class-ps.txt 2025-09-01 15:44 1.0K   rb-class-pyc.txt 2025-09-01 15:44 7.6K   rb-class-so.txt 2025-09-01 15:44 45K   rb-class-svg.txt 2025-09-01 15:44 1.4K   rb-class-tar.gz.txt 2025-09-01 15:44 0   rbbuild-tried.txt 2024-02-26 21:01 214K   rbplot.csv 2025-09-01 14:55 50K   rbstats.txt 2025-09-01 14:49 358   report-202009.txt 2020-10-01 15:54 1.4K   report-202010.txt 2020-10-30 06:27 1.6K   report-202011.txt 2020-11-28 01:18 1.6K   report-202012.txt 2020-12-31 13:46 1.5K   report-202101.txt 2021-01-29 15:17 1.5K   report-202102.txt 2021-02-27 07:17 1.6K   report-202103.txt 2021-03-28 11:24 1.1K   report-202104.txt 2021-04-29 03:40 2.1K   report-202105.txt 2021-06-01 05:52 1.8K   report-202106.txt 2021-06-30 09:54 1.6K   report-202107.txt 2021-07-30 12:07 1.2K   report-202108.txt 2021-08-30 18:31 1.3K   report-202109.txt 2021-09-30 19:55 1.3K   report-202110.txt 2021-10-31 11:20 1.1K   report-202111.txt 2021-11-30 20:43 1.1K   report-202112.txt 2021-12-31 20:19 1.3K   report-202201.txt 2022-01-31 13:53 1.1K   report-202203.txt 2022-03-31 22:21 1.5K   report-202204.txt 2022-04-28 15:12 2.4K   report-202205.txt 2022-06-01 16:52 2.1K   report-202206.txt 2022-07-04 19:48 1.3K   report-202207.txt 2022-07-31 21:29 5.5K   report-202208.txt 2022-09-01 21:02 4.7K   report-202209.txt 2022-10-05 12:29 4.8K   report-202210.txt 2022-11-03 19:52 4.0K   report-202212.txt 2023-01-09 13:12 12K   report-202301.txt 2023-01-31 09:40 11K   report-202301.txt.in 2023-01-31 09:40 934   report-202302.txt 2023-03-01 15:37 6.4K   report-202302.txt.in 2023-03-01 13:51 52   report-202303.txt 2023-04-02 18:50 5.5K   report-202303.txt.in 2023-04-02 19:32 120   report-202305.txt.in 2023-05-12 09:16 6   report-202306.txt.in 2023-06-30 14:11 402   report-202307.txt.in 2023-07-31 15:12 859   report-202308.txt.in 2023-08-30 09:06 261   report-202401.txt.in 2024-01-31 14:36 82   report-202402.txt.in 2024-02-28 13:31 80   report-202403.txt.in 2024-03-31 18:47 555   report-202404.txt.in 2024-04-30 08:06 874   report-202405.txt.in 2024-05-31 14:33 77   report-202406.txt.in 2024-06-30 21:48 311   report-202407.txt.in 2024-07-31 09:51 2.2K   report-202408.txt.in 2024-09-04 09:07 2.7K   report-202409.txt.in 2024-10-02 12:37 1.5K   report-202410.txt.in 2024-10-30 14:58 816   report-202411.txt 2024-11-29 17:26 11K   report-202411.txt.in 2024-11-29 17:25 493   report-202412.txt.in 2024-12-30 21:03 1.6K   report-202501.txt 2025-01-31 11:34 13K   report-202501.txt.in 2025-01-31 10:24 2.1K   report-202502.txt 2025-02-28 08:39 12K   report-202502.txt.in 2025-02-28 08:39 894   report-202503.txt.in 2025-03-31 21:14 958   report-202504.txt.in 2025-04-30 07:34 243   report-202505.txt.in 2025-05-29 07:59 917   report-202506.txt.in 2025-07-02 09:48 547   report-202507.txt.in 2025-07-31 18:33 232   report-202508.txt.in 2025-08-31 10:16 286   report.txt 2025-09-01 14:54 4.6K   reproducible.json 2025-09-01 14:50 6.7M   status-FTBFS-builds.txt 2024-02-26 21:01 1.4K   status-notforus-builds.txt 2024-02-26 21:01 3.9K   status-succeeded-builds.txt 2024-02-26 21:01 209K   status-waitdep-builds.txt 2024-02-26 21:01 168   timebombs 2025-08-22 14:20 5.7K   unreproduciblerings.txt 2025-09-01 14:50 402  
2026-01-13T09:30:26
http://hackage.haskell.org/package/semigroupoids-1.2.6.1/docs/Data-Semigroupoid.html
Data.Semigroupoid Source Contents Index semigroupoids-1.2.6.1: Haskell 98 semigroupoids: Category sans id Portability portable Stability provisional Maintainer Edward Kmett <ekmett@gmail.com> Safe Haskell Safe-Infered Data.Semigroupoid Description A semigroupoid satisfies all of the requirements to be a Category except for the existence of identity arrows. Synopsis class Semigroupoid c where o :: c j k -> c i j -> c i k newtype WrappedCategory k a b = WrapCategory { unwrapCategory :: k a b } newtype Semi m a b = Semi { getSemi :: m } Documentation class Semigroupoid c where Source Category sans id Methods o :: c j k -> c i j -> c i k Source Instances Semigroupoid (->)   Semigroupoid Op   Bind m => Semigroupoid ( Kleisli m)   Extend w => Semigroupoid ( Cokleisli w)   Semigroup m => Semigroupoid ( Semi m)   Category k => Semigroupoid ( WrappedCategory k)   Semigroupoid k => Semigroupoid ( Dual k)   Apply f => Semigroupoid ( Static f)   newtype WrappedCategory k a b Source Constructors WrapCategory   Fields unwrapCategory :: k a b   Instances Category k => Category ( WrappedCategory k)   Category k => Semigroupoid ( WrappedCategory k)   newtype Semi m a b Source Constructors Semi   Fields getSemi :: m   Instances Monoid m => Category ( Semi m)   Semigroup m => Semigroupoid ( Semi m)   Produced by Haddock version 2.10.0
2026-01-13T09:30:26
https://www.unicode.org/glossary/#UTF_32
Glossary Glossary Tech Site | Site Map | Search   Glossary of Unicode Terms   A B C D E F G H I J K L M N O P-Q R S T U V W X-Y Z This glossary is updated periodically to stay synchronized with changes to various standards maintained by the Unicode Consortium. See About Unicode Terminology for translations of various terms. There is also an FAQ section on the website. A Abjad . A writing system in which only consonants are indicated. The term “abjad” is derived from the first four letters of the traditional order of the Arabic script: alef, beh, jeem, dal . (See Section 6.1, Writing Systems .) Abstract Character . A unit of information used for the organization, control, or representation of textual data. (See definition D7 in Section 3.4, Characters and Encoding .) Abstract Character Sequence . An ordered sequence of one or more abstract characters. (See definition D8 in Section 3.4, Characters and Encoding .) Abugida . A writing system in which consonants are indicated by the base letters that have an inherent vowel, and in which other vowels are indicated by additional distinguishing marks of some kind modifying the base letter. The term “abugida” is derived from the first four letters of the Ethiopic script in the Semitic order: alf, bet, gaml, dant . (See Section 6.1, Writing Systems .) Accent Mark . A mark placed above, below, or to the side of a character to alter its phonetic value. (See also diacritic .) Acrophonic . Denoting letters or numbers by the first letter of their name. For example, the Greek acrophonic numerals are variant forms of such initial letters. Aksara . (1) In Sanskrit grammar, the term for “letter” in general, as opposed to consonant ( vyanjana ) or vowel ( svara ). Derived from the first and last letters of the traditional ordering of Sanskrit letters—“a” and “ksha”. (2) More generally, in Indic writing systems, aksara refers to an orthographic syllable . Algorithm . A term used in a broad sense in the Unicode Standard, to mean the logical description of a process used to achieve a specified result. This does not require the actual procedure described in the algorithm to be followed; any implementation is conformant as long as the results are the same. Alphabet . A writing system in which both consonants and vowels are indicated. The term “alphabet” is derived from the first two letters of the Greek script: alpha, beta . (See Section 6.1, Writing Systems .) Alphabetic Property . Informative property of the primary units of alphabets and/or syllabaries. (See Section 4.10, Letters, Alphabetic, and Ideographic .) Alphabetic Sorting . (See collation .) AMTRA . Acronym for Arabic Mark Transient Reordering Algorithm . (See Unicode Standard Annex #53, “Unicode Arabic Mark Rendering.” ) Annotation . The association of secondary textual content with a point or range of the primary text. (The value of a particular annotation is considered to be a part of the “content” of the text. Typical examples include glossing, citations, exemplification, Japanese yomi, and so on.) ANSI .  (1) The American National Standards Institute. (2) The Microsoft collective name for all Windows code pages. Sometimes used specifically for code page 1252, which is a superset of ISO/IEC 8859-1. Apparatus Criticus . Collection of conventions used by editors to annotate and comment on text. Arabic Digits . The term "Arabic digits" may mean either the digits in the Arabic script (see Arabic-Indic digits ) or the ordinary ASCII digits in contrast to Roman numerals (see European digits ). When the term "Arabic digits" is used in Unicode specifications, it means Arabic-Indic digits. See Terminology for Digits for additional information on terminology related to digits. Arabic-Indic Digits . Forms of decimal digits used in most parts of the Arabic world (for instance, U+0660, U+0661, U+0662, U+0663). Although European digits (1, 2, 3,…) derive historically from these forms, they are visually distinct and are coded separately. (Arabic-Indic digits are sometimes called Indic numerals; however, this nomenclature leads to confusion with the digits currently used with the scripts of India.) Variant forms of Arabic-Indic digits used chiefly in Iran and Pakistan are referred to as Eastern Arabic-Indic digits . (See Section 9.2, Arabic .) See Terminology for Digits for additional information on terminology related to digits. ASCII . (1) The American Standard Code for Information Interchange, a 7-bit coded character set for information interchange. It is the U.S. national variant of ISO/IEC 646 and is formally the U.S. standard ANSI X3.4. It was proposed by ANSI in 1963 and finalized in 1968. (2) The set of 128 Unicode characters from U+0000 to U+007F, including control codes as well as graphic characters. (3) ASCII has been incorrectly used to refer to various 8-bit character encodings that include ASCII characters in the first 128 code points. ASCII digits . The digit characters U+0030 to U+0039. Also known as European digits . See Terminology for Digits for additional information on terminology related to digits. Assigned Character .  A code point that is assigned to an abstract character. This refers to graphic, format, control, and private-use characters that have been encoded in the Unicode Standard. (See Section 2.4, Code Points and Characters .) Assigned Code Point .  (See designated code point .) Atomic Character .  A character that is not decomposable. (See decomposable character .) B Base Character . Any graphic character except for those with the General Category of Combining Mark (M). (See definition D51 in Section 3.6, Combination .) In a combining character sequence, the base character is the initial character, which the combining marks are applied to. Basic Multilingual Plane . Plane 0, abbreviated as BMP. Bicameral . A script that distinguishes between two cases. (See case .) Most often used in the context of Latin-based alphabets of Europe and elsewhere in the world. Bidi . Abbreviation of bidirectional, in reference to mixed left-to-right and right-to-left text. Bidirectional Display . The process or result of mixing left-to-right text and right-to-left text in a single line. (See Unicode Standard Annex #9, “Unicode Bidirectional Algorithm.” ) Big-endian . A computer architecture that stores multiple-byte numerical values with the most significant byte (MSB) values first. Binary Files . Files containing nontextual information. Block . A grouping of characters within the Unicode encoding space used for organizing code charts. Each block is a uniquely named, continuous, non-overlapping range of code points, containing a multiple of 16 code points, and starting at a location that is a multiple of 16. A block may contain unassigned code points, which are reserved. BMP . Acronym for Basic Multilingual Plane . BMP Character . A Unicode encoded character having a BMP code point. (See supplementary character .) BMP Code Point . A Unicode code point between U+0000 and U+FFFF. (See supplementary code point .) BNF . Acronym for Backus-Naur Form , a formal meta-syntax for describing context-free syntaxes. (For details, see Appendix A, Notational Conventions .) BOCU-1 . Acronym for Binary Ordered Compression for Unicode. A Unicode compression scheme that is MIME-compatible (directly usable for e-mail) and preserves binary order, which is useful for databases and sorted lists. BOM .  Acronym for byte order mark . Bopomofo . An alphabetic script used primarily in the Republic of China (Taiwan) to write the sounds of Mandarin Chinese and some other dialects. Each symbol corresponds to either the syllable-initial or syllable-final sounds; it is therefore a subsyllabic script in its primary usage. The name is derived from the names of its first four elements. More properly known as zhuyin zimu or zhuyin fuhao in Mandarin Chinese. Boustrophedon . A pattern of writing seen in some ancient manuscripts and inscriptions, where alternate lines of text are laid out in opposite directions, and where right-to-left lines generally use glyphs mirrored from their left-to-right forms. Literally, “as the ox turns,” referring to the plowing of a field. Braille . A writing system using a series of raised dots to be read with the fingers by people who are blind or whose eyesight is not sufficient for reading printed material. (See Section 21.1, Braille .) Braille Pattern . One of the 64 (for six-dot Braille) or 256 (for eight-dot Braille) possible tangible dot combinations. Byte . (1) The minimal unit of addressable storage for a particular computer architecture. (2) An octet. Note that many early computer architectures used bytes larger than 8 bits in size, but the industry has now standardized almost uniformly on 8-bit bytes. The Unicode Standard follows the current industry practice in equating the term byte with octet and using the more familiar term byte in all contexts. (See octet .) Byte Order Mark . The Unicode character U+FEFF when used to indicate the byte order of a text. (See Section 2.13, Special Characters and Noncharacters , and Section 23.8, Specials .) Byte Serialization . The order of a series of bytes determined by a computer architecture. Byte-Swapped . Reversal of the order of a sequence of bytes. C Camelcase . A casing convention for compound terms or identifiers, in which the letters are mostly lowercased, but component words or abbreviations may be capitalized. For example, "ThreeWordTerm" or "threeWordTerm". Canonical . (1) Conforming to the general rules for encoding—that is, not compressed, compacted, or in any other form specified by a higher protocol. (2) Characteristic of a normative mapping and form of equivalence specified in Chapter 3, Conformance . Canonical Composition . A step in the algorithm for Unicode Normalization Forms, during which decomposed sequences are replaced by primary composites, where possible. (See definition D115 in Section 3.11, Normalization Forms .) Canonical Decomposable Character . A character that is not identical to its canonical decomposition. (See definition D69 in Section 3.7, Decomposition .) Canonical Decomposition . Mapping to an inherently equivalent sequence—for example, mapping ä to a +  combining umlaut. (For a full, formal definition, see definition D68 in Section 3.7, Decomposition .) Canonical Equivalence . The relation between two character sequences whose full canonical decompositions are identical. (See definition D70 in Section 3.7, Decomposition .) Canonical Equivalent . Two character sequences are said to be canonical equivalents if their full canonical decompositions are identical. (See definition D70 in Section 3.7, Decomposition .) Canonical Ordering . The order of a combining character sequence that results from the application of the Canonical Ordering Algorithm, a step in the process of normalization of strings. See definition D109 in Section 3.11, Normalization Forms . Cantillation Mark . A mark that is used to indicate how a text is to be chanted or sung. Capital Letter . Synonym for uppercase letter . (See case .) Case . (1) Feature of certain alphabets where the letters have two distinct forms. These variants, which may differ markedly in shape and size, are called the uppercase letter (also known as capital or majuscule ) and the lowercase letter (also known as small or minuscule ). (2) Normative property of characters, consisting of uppercase, lowercase, and titlecase (Lu, Ll, and Lt). (See Section 4.2, Case .) Case Folding . The mapping of strings to a particular case form, to facilitate searching and sorting of text. Case foldings may be simple, when the case mappings are required not to change the length of the strings to compare, or full, when the case mappings may change the length of the strings to compare. (See Section 3.13.3, Default Case Folding .) Case Mapping . The association of the uppercase, lowercase, and titlecase forms of a letter. (See Section 5.18, Case Mappings .) Case-Ignorable . A character C is defined to be case-ignorable if C has the value MidLetter (ML), MidNumLet (MB), or Single_Quote (SQ) for the Word_Break property or its General_Category is one of Nonspacing_Mark (Mn), Enclosing_Mark (Me), Format (Cf), Modifier_Letter (Lm), or Modifier_Symbol (Sk). (See definition D136 in Section 3.13, Default Case Algorithms .) Case-Ignorable Sequence . A sequence of zero or more case-ignorable characters. (See definition D137 in Section 3.13, Default Case Algorithms .) CCC . Short name for the Canonical_Combining_Class property, usually lowercased: ccc. CCS . (1) Acronym for coded character set . (2) Also used as an acronym for combining character sequence . Cedilla . A mark originally placed beneath the letter c in French, Portuguese, and Spanish to indicate that the letter is to be pronounced as an s, as in façade . Obsolete Spanish diminutive of ceda , the letter z . CEF . Acronym for character encoding form . CES . Acronym for character encoding scheme . Character . (1) The smallest component of written language that has semantic value; refers to the abstract meaning and/or shape, rather than a specific shape (see also glyph ), though in code tables some form of visual representation is essential for the reader’s understanding. (2) Synonym for abstract character . (3) The basic unit of encoding for the Unicode character encoding. (4) The English name for the ideographic written elements of Chinese origin. [See ideograph (2).] Character Block . (See block .) Character Class . A set of characters sharing a particular set of properties. Character Encoding Form . Mapping from a character set definition to the actual code units used to represent the data. Character Encoding Scheme . A character encoding form plus byte serialization. There are seven character encoding schemes in Unicode: UTF-8, UTF-16, UTF-16BE, UTF-16LE, UTF-32, UTF-32BE, and UTF-32LE. Character Entity . Expression of the form & for "&" or   for the no-break space. These are found in markup language files like HTML or XML. There are also numerically defined character entities. (See also character escape .) Character Escape . A numerical expression of the form \uXXXX, \xXXXX or &#xXXXX; where X is a hex digit, or &#dddd; where d is a decimal digit. These are found in programming source code or markup language files (such as HTML or XML). Character Name . A unique string used to identify each abstract character encoded in the standard. (See definition D4 in Section 3.3, Semantics .) Character Name Alias . An additional unique string identifier, other than the character name, associated with an encoded character in the standard. (See definition D5 in Section 3.3, Semantics .) Character Properties . A set of property names and property values associated with individual characters. (See Chapter 4, Character Properties .) Character Repertoire . The collection of characters included in a character set. Character Sequence . Synonym for abstract character sequence . Character Set . A collection of elements used to represent textual information. Charset . (See coded character set .) Chillu . Abbreviation for chilaaksharam (singular) ( cillakṣaram ). Refers to any of a set of sonorant consonants in Malayalam, when appearing in syllable-final position with no inherent vowel. Choseong . A sequence of one or more leading consonants in Korean. Chu Hán . The name for Han characters used in Vietnam; derived from hànzì . Chu Nôm . A demotic script of Vietnam developed from components of Han characters. Its creators used methods similar to those used by the Chinese in creating Han characters. CJK . Acronym for Chinese, Japanese, and Korean. A variant, CJKV , means Chinese, Japanese, Korean, and Vietnamese. CJK Unified Ideograph . A Han character that has undergone the process of Han unification (conducted primarily by the Ideographic Research Group) and been encoded as a single ideograph with one or more clearly identified CJK source mappings. CJK unified ideographs have no decomposition mappings, and the set of them in the Unicode Standard is normatively specified by the Unified_Ideograph property. CLDR . (See Unicode Common Locale Data Repository .) Coded Character . (See encoded character .) Coded Character Representation . Synonym for coded character sequence . Coded Character Sequence . An ordered sequence of one or more code points. Normally, this consists of a sequence of encoded characters, but it may also include noncharacters or reserved code points. (See definition D12 in Section 3.4, Characters and Encoding .) Coded Character Set . A character set in which each character is assigned a numeric code point. Frequently abbreviated as character set, charset , or code set ; the acronym CCS is also used. Code Page . A coded character set, often referring to a coded character set used by a personal computer—for example, PC code page 437, the default coded character set used by the U.S. English version of the DOS operating system. Code Point . (1) Any value in the Unicode codespace; that is, the range of integers from 0 to 10FFFF 16 . (See definition D10 in Section 3.4, Characters and Encoding .) Not all code points are assigned to encoded characters. See code point type . (2) A value, or position, for a character, in any coded character set. Code Point Type . Any of the seven fundamental classes of code points in the standard: Graphic, Format, Control, Private-Use, Surrogate, Noncharacter, Reserved. (See definition D10a in Section 3.4, Characters and Encoding .) Code Position . Synonym for code point . Used in ISO character encoding standards. Code Set . (See coded character set .) Codespace . (1) A range of numerical values available for encoding characters. (2) For the Unicode Standard, a range of integers from 0 to 10FFFF 16 . (See definition D9 in Section 3.4, Characters and Encoding .) Code Unit . The minimal bit combination that can represent a unit of encoded text for processing or interchange. The Unicode Standard uses 8-bit code units in the UTF-8 encoding form, 16-bit code units in the UTF-16 encoding form, and 32-bit code units in the UTF-32 encoding form. (See definition D77 in Section 3.9, Unicode Encoding Forms .) Code Value . Obsolete synonym for code unit . Codomain . For a mapping, the codomain is the set of code points or sequences that it maps to, while the domain is the set of values that are mapped. For example, a canonical decomposition is a mapping from a set of code points to a set of sequences; the codomain is the set of canonical equivalent mappings. (See also domain .) Collation . The process of ordering units of textual information. Collation is usually specific to a particular language. Also known as alphabetizing or alphabetic sorting . Unicode Technical Standard #10, “Unicode Collation Algorithm," defines a complete, unambiguous, specified ordering for all characters in the Unicode Standard. Combining Character . A character with the General Category of Combining Mark (M). (See definition D52 in Section 3.6, Combination .) (See also nonspacing mark .) Combining Character Sequence . A maximal character sequence consisting of either a base character followed by a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner ; or a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner . (See definition D56 in Section 3.6, Combination .) Combining Class . A numeric value in the range 0..254 given to each Unicode code point, formally defined as the property Canonical_Combining_Class. (See definition D104 in Section 3.11, Normalization Forms .) Combining Mark . A commonly used synonym for combining character . Compatibility . (1) Consistency with existing practice or preexisting character encoding standards. (2) Characteristic of a normative mapping and form of equivalence specified in Section 3.7, Decomposition . Compatibility Character . A character that would not have been encoded except for compatibility and round-trip convertibility with other standards. (See Section 2.3, Compatibility Characters .) Compatibility Composite Character . Synonym for compatibility decomposable character . Compatibility Decomposable Character . A character whose compatibility decomposition is not identical to its canonical decomposition. (See definition D66 in Section 3.7, Decomposition .) Compatibility Decomposition . Mapping to a roughly equivalent sequence that may differ in style. (For a full, formal definition, see definition D65 in Section 3.7, Decomposition .) Compatibility Equivalence . The relation between two character sequences whose full compatibility decompositions are identical. (See definition D67 in Section 3.7, Decomposition .) Compatibility Equivalent . Two character sequences are said to be compatibility equivalents if their full compatibility decompositions are identical. (See definition D67 in Section 3.7, Decomposition .) Compatibility Ideograph . A Han character encoded for compatibility with some East Asian character encoding, but which is not encoded as a CJK unified ideograph . Instead, each compatibility ideograph has a canonical decomposition mapping to a particular CJK unified ideograph. Compatibility Precomposed Character . Synonym for compatibility decomposable character . Compatibility Variant . A character that generally can be remapped to another character without loss of information other than formatting. Composite Character . (See decomposable character .) Composite Character Sequence . (See combining character sequence .) Composition Exclusion . A Canonical Decomposable Character which has the property value Composition_Exclusion=True. (Used in the definition of Unicode Normalization Forms.) (See definition D112 in Section 3.11, Normalization Forms .) Conformance . Adherence to a specified set of criteria for use of a standard. (See Chapter 3, Conformance .) Confusable . Of similar or identical appearance. When referring to characters in strings, the appearance of confusable characters can make different identifiers hard or impossible to distinguish. (See also Unicode Technical Standard #39, "Unicode Security Mechanisms" .) Conjunct Form . A ligated form representing a consonant conjunct . Consonant Cluster .  A sequence of two or more consonantal sounds. Depending on the writing system, a consonant cluster may be represented by a single character or by a sequence of characters. (Contrast digraph .) Consonant Conjunct . A sequence of two or more adjacent consonantal letterforms, consisting of a sequence of one or more dead consonants followed by a normal, live consonant letter. A consonant conjunct may be ligated into a single conjunct form, or it may be represented by graphically separable parts, such as subscripted forms of the consonant letters. Consonant conjuncts are associated with the Brahmi family of Indic scripts. (See Section 12.1, Devanagari .) Contextual Variant . A text element can have a presentation form that depends on the textual context in which it is rendered. This presentation form is known as a contextual variant . Contributory Property . A simple property defined merely to make the statement of a rule defining a derived property more compact or general. (See definition D35a in Section 3.5, Properties .) Control Codes . The 65 characters in the ranges U+0000..U+001F and U+007F..U+009F. Also known as control characters . Core Specification . The central part of the Unicode Standard–the portion which up until Version 5.0 was published as a separate book. Starting with Version 5.2, this part of the standard has been published online only, rather than as a book. The core specification consists of the general introduction and framework for the standard, the formal conformance requirements, many implementation guidelines, and extensive chapters providing information about all the encoded characters, organized by script or by significant classes of characters. Formally, a version of the Unicode Standard is defined by an edition of this core specification, together with the Code Charts , Unicode Standard Annexes , and the Unicode Character Database Cursive . Writing where the letters of a word are connected. D Dasia . Greek term for rough breathing mark, used in polytonic Greek character names. DBCS . Acronym for double-byte character set . Dead Consonant . An Indic consonant character followed by a virama character. This sequence indicates that the consonant has lost its inherent vowel. (See Section 12.1, Devanagari .) Decimal Digits . Digits that can be used to form decimal-radix numbers. Decomposable Character . A character that is equivalent to a sequence of one or more other characters, according to the decomposition mappings found in the Unicode Character Database, and those described in Section 3.12, Conjoining Jamo Behavior . It may also be known as a precomposed character or a composite character. (See definition D63 in Section 3.7, Decomposition .) Decomposition . (1) The process of separating or analyzing a text element into component units. These component units may not have any functional status, but may be simply formal units—that is, abstract shapes. (2) A sequence of one or more characters that is equivalent to a decomposable character. (See definition D64 in Section 3.7, Decomposition .) Decomposition Mapping . A mapping from a character to a sequence of one or more characters that is a canonical or compatibility equivalent and that is listed in the character names list or described in Section 3.12, Conjoining Jamo Behavior . (See definition D62 in Section 3.7, Decomposition .) Default Ignorable . Default ignorable code points are those that should be ignored by default in rendering unless explicitly supported. They have no visible glyph or advance width in and of themselves, although they may affect the display, positioning, or adornment of adjacent or surrounding characters. (See Section 5.21, Ignoring Characters in Processing .) Defective Combining Character Sequence . A combining character sequence that does not start with a base character. (See definition D57 in Section 3.6, Combination .) Demotic Script . (1) A script or a form of a script used to write the vernacular or common speech of some language community. (2) A simplified form of the ancient Egyptian hieratic writing. Dependent Vowel . A symbol or sign that represents a vowel and that is attached or combined with another symbol, usually one that represents a consonant. For example, in writing systems based on Arabic, Hebrew, and Indic scripts, vowels are normally represented as dependent vowel signs. Deprecated . Of a coded character or a character property, strongly discouraged from use. (Not the same as obsolete .) Deprecated Character . A coded character whose use is strongly discouraged. Such characters are retained in the standard, indefinitely but should not be used. (See definition D13 in Section 3.4, Characters and Encoding .) Designated Code Point . Any code point that has either been assigned to an abstract character ( assigned characters ) or that has otherwise been given a normative function by the standard (surrogate code points and noncharacters). This definition excludes reserved code points. Also known as assigned code point . (See Section 2.4 Code Points and Characters .) Deterministic Comparison . A string comparison in which strings that do not have identical contents will compare as unequal. There are two main varieties, depending on the sense of "identical:" (a) binary equality, or (b) canonical equivalence. This is a property of the comparison mechanism, and not of the sorting algorithm. Also known as stable (or semi-stable ) comparison . Deterministic Sort . A sort algorithm which returns exactly the same output each time it is applied to the same input. This is a property of the sorting algorithm, and not of the comparison mechanism. For example, a randomized Quicksort (which picks a random element as the pivot element, for optimal performance) is not deterministic. Multiprocessor implementations of a sort algorithm may also not be deterministic. Diacritic . (1) A mark applied or attached to a symbol to create a new symbol that represents a modified or new value. (2) A mark applied to a symbol irrespective of whether it changes the value of that symbol. In the latter case, the diacritic usually represents an independent value (for example, an accent, tone, or some other linguistic information). Also called diacritical mark or diacritical . (See also combining character and nonspacing mark .) Diaeresis . Two horizontal dots over a letter, as in naïve . The diaeresis is not distinguished from the umlaut in the Unicode character encoding. (See umlaut .) Dialytika . Greek term for diaeresis or trema , used in Greek character names. Digits . (See Arabic digits , European digits , and Indic digits .) See Terminology for Digits for additional information on terminology related to digits. Digraph . A pair of signs or symbols (two graphs), which together represent a single sound or a single linguistic unit. The English writing system employs many digraphs (for example, th, ch, sh, qu, and so on). The same two symbols may not always be interpreted as a digraph (for example, ca th ode versus ca th ouse ). When three signs are so combined, they are called a trigraph . More than three are usually called an n-graph . Dingbats . Typographical symbols and ornaments. Diphthong . A pair of vowels that are considered a single vowel for the purpose of phonemic distinction. One of the two vowels is more prominent than the other. In writing systems, diphthongs are sometimes written with one symbol and sometimes with more than one symbol (for example, with a digraph ). Direction . (See paragraph direction .) Directionality Property . A property of every graphic character that determines its horizontal ordering as specified in Unicode Standard Annex #9, “Unicode Bidirectional Algorithm.” (See Section 4.4, Directionality .) Display Cell . A rectangular region on a display device within which one or more glyphs are imaged. Display Order . The order of glyphs presented in text rendering. (See logical order and Section 2.2, Unicode Design Principles .) Domain . 1. For a mapping, the domain is the set of code points or sequences that are mapped, while the codomain is the set of values they are mapped to. For example, a canonical decomposition is a mapping from a set of code points to a set of sequences; the domain is the entire Unicode codespace. (See also codomain .) 2. A realm of administrative autonomy, authority or control in the Internet, identified by a domain name. Domain Name . The part of a network address that identifies it as belonging to a particular domain. (Oxford Languages definition.) A domain name is a string of characters. The rules for how Unicode characters can be used in domain names is the concern of IDNA and of UTS #46, Unicode IDNA Compatibility Processing . Double-Byte Character Set . One of a number of character sets defined for representing Chinese, Japanese, or Korean text (for example, JIS X 0208-1990). These character sets are often encoded in such a way as to allow double-byte character encodings to be mixed with single-byte character encodings. Abbreviated DBCS . (See also multibyte character set .) Ductility . The ability of a cursive font to stretch or compress the connective baseline to effect text justification. Dynamic Composition . Creation of composite forms such as accented letters or Hangul syllables from a sequence of characters. E EBCDIC . Acronym for Extended Binary-Coded Decimal Interchange Code. A group of coded character sets used on mainframes that consist of 8-bit coded characters. EBCDIC coded character sets reserve the first 64 code points (x00 to x3F) for control codes, and reserve the range x41 to xFE for graphic characters. The English alphabetic characters are in discontinuous segments with uppercase at xC1 to xC9, xD1 to xD9, xE2 to xE9, and lowercase at x81 to x89, x91 to x99, xA2 to xA9. ECCS . Acronym for extended combining character sequence . EGC . Acronym for extended grapheme cluster . Embedding . A concept relevant to bidirectional behavior. (See Unicode Standard Annex #9, “Unicode Bidirectional Algorithm,” for detailed terminology and definitions.) Emoji . (1) The Japanese word for "pictograph." (2) Certain pictographic and other symbols encoded in the Unicode Standard that are commonly given a colorful or playful presentation when displayed on devices. Many of the emoji in Unicode were originally encoded for compatibility with Japanese telephone symbol sets. (3) Colorful or playful symbols which are not encoded as characters but which are widely implemented as graphics. (See pictograph .) Emoticon . A symbol added to text to express emotional affect or reaction—for example, sadness, happiness, joking intent, sarcasm, and so forth. Emoticons are often expressed by a conventional kind of "ASCII art," using sequences of punctuation and other symbols to portray likenesses of facial expressions. In Western contexts these are often turned sideways, as :-) to express a happy face; in East Asian contexts other conventions often portray a facial expression without turning, as ^-^. Rendering systems often recognize conventional emoticon sequences and display them as colorful or even animated glyphs in text. There is also a set of dedicated pictographic symbols—mostly representing different facial expressions—encoded as characters in the Unicode Standard. (See pictograph .) Encapsulated Text . (1) Plain text surrounded by formatting information. (2) Text recoded to pass through narrow transmission channels or to match communication protocols. Enclosing Mark . A nonspacing mark with the General Category of Enclosing Mark (Me). (See definition D54 in Section 3.6, Combination .) Enclosing marks are a subclass of nonspacing marks that surround a base character, rather than merely being placed over, under, or through it. Encoded Character . An association (or mapping) between an abstract character and a code point . (See definition D11 in Section 3.4, Characters and Encoding .) By itself, an abstract character has no numerical value, but the process of “encoding a character” associates a particular code point with a particular abstract character, thereby resulting in an “encoded character.” Encoding Form . (See character encoding form .) Encoding Scheme . (See character encoding scheme .) Equivalence . In the context of text processing, the process or result of establishing whether two text elements are identical in some respect. Equivalent Sequence . (See canonical equivalent .) Escape Sequence . A sequence of bytes that is used for code extension. The first byte in the sequence is escape (hex 1B). EUDC . Acronym for end-user defined character. A character defined by an end user, using a private-use code point, to represent a character missing in a particular character encoding. These are common in East Asian implementations. European Digits . Forms of decimal digits first used in Europe and now used worldwide. Historically, these digits were derived from the Arabic digits; they are sometimes called “Arabic numerals,” but this nomenclature leads to confusion with the real Arabic-Indic digits . Also called "Western digits" and "Latin digits." See Terminology for Digits for additional information on terminology related to digits. Extended Base . Any base character, or any standard Korean syllable block. (See definition D51a in Section 3.6, Combination .) Extended Combining Character Sequence . A maximal character sequence consisting of either an extended base followed by a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner ; or a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner . Abbreviated as ECCS . (See definition D56a in Section 3.6, Combination .) Extended Grapheme Cluster . The text between extended grapheme cluster boundaries as specified by Unicode Standard Annex #29, "Unicode Text Segmentation." Abbreviated as EGC . (See definition D61 in Section 3.6, Combination .) F Fancy Text . (See rich text .) Fixed Position Class . A subset of the range of numeric values for combining classes—specifically, any value in the range 10..199. (See definition D105 in Section 3.11, Normalization Forms .) Floating ( diacritic, accent, mark ). (See nonspacing mark .) Folding . An operation that maps similar characters to a common target, such as uppercasing or lowercasing a string. Folding operations are most often used to temporarily ignore certain distinctions between characters. Font . A collection of glyphs used for the visual depiction of character data. A font is often associated with a set of parameters (for example, size, posture, weight, and serifness), which, when set to particular values, generate a collection of imagable glyphs. Format Character . A character that is inherently invisible but that has an effect on the surrounding characters. Format Code . Synonym for format character . Format Control Character . Synonym for format character . Formatted Text . (See rich text .) FSS-UTF . Acronym for File System Safe UCS Transformation Format , published by the X/Open Company Ltd., and intended for the UNIX environment. Now known as UTF-8 . Full Composition Exclusion . A Canonical Decomposable Character which has the property value Full_Composition_Exclusion=True. (Used in the definition of Unicode Normalization Forms.) (See definition D113 in Section 3.11, Normalization Forms .) Fullwidth . Characters of East Asian character sets whose glyph image extends across the entire character display cell. In legacy character sets, fullwidth characters are normally encoded in two or three bytes. The Japanese term for fullwidth characters is zenkaku . FVS . Acronym for Mongolian Free Variation Selector . G G11n . (See globalization .) GC . 1. Acronym for grapheme cluster . 2. Short name for the General_Category property, usually lowercased: gc. GCGID . Acronym for Graphic Character Global Identifier. These are listed in the IBM document Character Data Representation Architecture, Level 1, Registry SC09-1391 . General Category . Partition of the characters into major classes such as letters, punctuation, and symbols, and further subclasses for each of the major classes. (See Section 4.5, General Category .) Generative . Synonym for productive . Globalization . (1) The overall process for internationalization and localization of  software products. (2) a synonym for internationalization. Also known by the abbreviation "g11n". Note that the meaning of "globalization" which is relevant to software products should be distinguished from the more widespread use of "globalization" in the context of economics. (See internationalization , localization .) Glyph . (1) An abstract form that represents one or more glyph images. (2) A synonym for glyph image . In displaying Unicode character data, one or more glyphs may be selected to depict a particular character. These glyphs are selected by a rendering engine during composition and layout processing. (See also character .) Glyph Code . A numeric code that refers to a glyph. Usually, the glyphs contained in a font are referenced by their glyph code. Glyph codes may be local to a particular font; that is, a different font containing the same glyphs may use different codes. Glyph Identifier . Similar to a glyph code, a glyph identifier is a label used to refer to a glyph within a font. A font may employ both local and global glyph identifiers. Glyph Image . The actual, concrete image of a glyph representation having been rasterized or otherwise imaged onto some display surface. Glyph Metrics . A collection of properties that specify the relative size and positioning along with other features of a glyph. Grapheme . (1) A minimally distinctive unit of writing in the context of a particular writing system. For example, ‹b› and ‹d› are distinct graphemes in English writing systems because there exist distinct words like big and dig. Conversely, a lowercase italiform letter a and a lowercase Roman letter a are not distinct graphemes because no word is distinguished on the basis of these two different forms. (2) What a user thinks of as a character. Grapheme Base . A character with the property Grapheme_Base, or any standard Korean syllable block. (See definition D58 in Section 3.6, Combination .) Grapheme Cluster . The text between grapheme cluster boundaries as specified by Unicode Standard Annex #29, "Unicode Text Segmentation." (See definition D60 in Section 3.6, Combination .) A grapheme cluster represents a horizontally segmentable unit of text, consisting of some grapheme base (which may consist of a Korean syllable) together with any number of nonspacing marks applied to it. Grapheme Extender . A character with the property Grapheme_Extend. (See definition D59 in Section 3.6, Combination .) Grapheme extender characters consist of all nonspacing marks, zero width joiner , zero width non-joiner , and a small number of spacing marks. Graphic Character . A character with the General Category of Letter (L), Combining Mark (M), Number (N), Punctuation (P), Symbol (S), or Space Separator (Zs). (See definition D50 in Section 3.6. Combination .) Guillemet . Punctuation marks resembling small less-than and greater-than signs, used as quotation marks in French and other languages. (See “Language-Based Usage of Quotation Marks” in Section 6.2, General Punctuation .) H Halant . A preferred Hindi synonym for a virama . It literally means killer , referring to its function of killing the inherent vowel of a consonant letter. (See virama .) Half-Consonant Form . In the Devanagari script and certain other scripts of the Brahmi family of Indic scripts, a dead consonant may be depicted in the so-called half-form. This form is composed of the distinctive part of a consonant letter symbol without its vertical stem. It may be used to create conjunct forms that follow a horizontal layout pattern. Also known as half-form . Halfwidth . Characters of East Asian character sets whose glyph image occupies half of the character display cell. In legacy character sets, halfwidth characters are normally encoded in a single byte. The Japanese term for halfwidth characters is hankaku . Han Characters . Ideographic characters of Chinese origin. (See Section 18.1, Han .) Hangul . The name of the script used to write the Korean language. Hangul Syllable . (1) Any of the 11,172 encoded characters of the Hangul Syllables character block, U+AC00..U+D7A3. Also called a precomposed Hangul syllable to clearly distinguish it from a Korean syllable block. (2) Loosely speaking, a Korean syllable block . Hanja . The Korean name for Han characters; derived from the Chinese word hànzì . Hankaku . (See halfwidth .) Han Unification . The process of identifying Han characters that are in common among the writing systems of Chinese, Japanese, Korean, and Vietnamese. Hànzì . The Mandarin Chinese name for Han characters. Harakat . Marks used in the Arabic script to indicate vocalization with short vowels. A subtype of tashkil . Hasant . The Bangla name for halant . (See virama .) Higher-Level Protocol . Any agreement on the interpretation of Unicode characters that extends beyond the scope of this standard. Note that such an agreement need not be formally announced in data; it may be implicit in the context. (See definition D16 in Section 3.4, Characters and Encoding .) High-Surrogate Code Point . A Unicode code point in the range U+D800 to U+DBFF. (See definition D71 in Section 3.8, Surrogates .) High-Surrogate Code Unit . A 16-bit code unit in the range D800 16 to DBFF 16 , used in UTF-16 as the leading code unit of a surrogate pair. Also known as a leading surrogate . (See definition D72 in Section 3.8, Surrogates .) Hiragana (ひらがな). One of two standard syllabaries associated with the Japanese writing system. Hiragana syllables are typically used in the representation of native Japanese words and grammatical particles, or are used as a fallback representation of other words when the corresponding kanji is either difficult to remember or obscure. (See also katakana .) Horizontal Extension . This refers to the process of adding a new IRG source reference to an existing CJK unified ideograph, along with a new representative glyph for the code charts that shows how the character appears in its source. It does not involve encoding a new character, but rather just adding the source reference and new glyph to the code charts. HTML . HyperText Markup Language. A text description language related to SGML; it mixes text format markup with plain text content to describe formatted text. HTML is ubiquitous as the source language for Web pages on the Internet. Starting with HTML 4.0, the Unicode Standard functions as the reference character set for HTML content. (See also SGML .) I I18n . (See internationalization .) IANA . Acronym for Internet Assigned Numbers Authority. ICU . Acronym for International Components for Unicode, an Open Source set of C/C++ and Java libraries for Unicode and software internationalization support. For information, see https://icu.unicode.org/ Ideograph (or ideogram ). (1) Any symbol that primarily denotes an idea or concept in contrast to a sound or pronunciation—for example, ♻, which denotes the concept of recycling by a series of bent arrows. (2) A generic term for the unit of writing of a logosyllabic writing system. In this sense, ideograph (or ideogram) is not systematically distinguished from logograph (or logogram). (3) A term commonly used to refer specifically to Han characters, equivalent to the Chinese, Japanese, or Korean terms also sometimes used: hànzì , kanji , or hanja . (See logograph , pictograph , sinogram .) Ideographic Property . Informative property of characters that are ideographs. (See Section 4.10, Letters, Alphabetic, and Ideographic .) Ideographic Variation Sequence . A variation sequence registered in the Ideographic Variation Database . The registration of ideographic variation sequences is subject to the rules specified in Unicode Technical Standard #37, "Unicode Ideographic Variation Database." The base character for an ideographic variation sequence must be an ideographic character, and it makes use of a variation selector in the range U+E0100..U+E01EF. The term ideographic variation sequence is sometimes abbreviated as "IVS". IDN . (See Internationalized Domain Name .) IDNA (1) The IDNA2008 protocol for IDNs defined in RFCs 5891 , 5892 , 5893 and 5894 . The protocol categorizes characters (for example as PVALID or DISALLOWED) based on Unicode properties as described in RFC 5892 . (For the range of valid code points for each Unicode version, see the data file for the derived IDNA2008_Category property.) (2) The earlier IDNA2003 protocol. (See IDNA Compatibility Processing for differences between IDNA2003 and IDNA2008 .) IDNA Compatibility Processing . (See Unicode Technical Standard #46, "Unicode IDNA Compatibility Processing" .) IDNA2003 . (See IDNA (2).) IDNA2008 . (See IDNA (1).) IICore . A subset of common-use CJK unified ideographs, defined as the fixed collection 370 IICore in ISO/IEC 10646. This subset contains 9,810 ideographs and is intended for common use in East Asian contexts, particularly for small devices that cannot support the full range of CJK unified ideographs encoded in the Unicode Standard. Ijam . Diacritical marks applied to basic letter forms to derive new (usually consonant) letters for extended Arabic alphabets. For example, see the three dots below which appear in the letter peh: پ Ijam marks are not separately encoded as combining marks in the Unicode Standard, but instead are integral parts of each atomically encoded Arabic letter. Contrast tashkil . See also Section 9.2, Arabic . Ill-Formed Code Unit Sequence . A code unit sequence that does not follow the specification of a Unicode encoding form. (See definition D84 in Section 3.9, Unicode Encoding Forms .) Ill-Formed Code Unit Subsequence . A non-empty subsequence of a Unicode code unit sequence X which does not contain any code units which also belong to any minimal well-formed subsequence of X. (See definition D84a in Section 3.9, Unicode Encoding Forms .) IME . (See Input Method Editor .) In-Band . An in-band channel conveys information about text by embedding that information within the text itself, with special syntax to distinguish it. In-band information is encoded in the same character set as the text, and is interspersed with and carried along with the text data. Examples are XML and HTML markup. Independent Vowel . In Indic scripts, certain vowels are depicted using independent letter symbols that stand on their own. This is often true when a word starts with a vowel or a word consists of only a vowel. Indic Digits . Forms of decimal digits used in various Indic scripts (for example, Devanagari: U+0966, U+0967, U+0968, U+0969). Arabic digits (and, eventually, European digits) derive historically from these forms. See Terminology for Digits for additional information on terminology related to digits. Informative . Information in this standard that is not normative but that contributes to the correct use and implementation of the standard. Inherent Vowel . In writing systems based on a script in the Brahmi family of Indic scripts, a consonant letter symbol nor
2026-01-13T09:30:26
https://www.unicode.org/glossary/#code_unit
Glossary Glossary Tech Site | Site Map | Search   Glossary of Unicode Terms   A B C D E F G H I J K L M N O P-Q R S T U V W X-Y Z This glossary is updated periodically to stay synchronized with changes to various standards maintained by the Unicode Consortium. See About Unicode Terminology for translations of various terms. There is also an FAQ section on the website. A Abjad . A writing system in which only consonants are indicated. The term “abjad” is derived from the first four letters of the traditional order of the Arabic script: alef, beh, jeem, dal . (See Section 6.1, Writing Systems .) Abstract Character . A unit of information used for the organization, control, or representation of textual data. (See definition D7 in Section 3.4, Characters and Encoding .) Abstract Character Sequence . An ordered sequence of one or more abstract characters. (See definition D8 in Section 3.4, Characters and Encoding .) Abugida . A writing system in which consonants are indicated by the base letters that have an inherent vowel, and in which other vowels are indicated by additional distinguishing marks of some kind modifying the base letter. The term “abugida” is derived from the first four letters of the Ethiopic script in the Semitic order: alf, bet, gaml, dant . (See Section 6.1, Writing Systems .) Accent Mark . A mark placed above, below, or to the side of a character to alter its phonetic value. (See also diacritic .) Acrophonic . Denoting letters or numbers by the first letter of their name. For example, the Greek acrophonic numerals are variant forms of such initial letters. Aksara . (1) In Sanskrit grammar, the term for “letter” in general, as opposed to consonant ( vyanjana ) or vowel ( svara ). Derived from the first and last letters of the traditional ordering of Sanskrit letters—“a” and “ksha”. (2) More generally, in Indic writing systems, aksara refers to an orthographic syllable . Algorithm . A term used in a broad sense in the Unicode Standard, to mean the logical description of a process used to achieve a specified result. This does not require the actual procedure described in the algorithm to be followed; any implementation is conformant as long as the results are the same. Alphabet . A writing system in which both consonants and vowels are indicated. The term “alphabet” is derived from the first two letters of the Greek script: alpha, beta . (See Section 6.1, Writing Systems .) Alphabetic Property . Informative property of the primary units of alphabets and/or syllabaries. (See Section 4.10, Letters, Alphabetic, and Ideographic .) Alphabetic Sorting . (See collation .) AMTRA . Acronym for Arabic Mark Transient Reordering Algorithm . (See Unicode Standard Annex #53, “Unicode Arabic Mark Rendering.” ) Annotation . The association of secondary textual content with a point or range of the primary text. (The value of a particular annotation is considered to be a part of the “content” of the text. Typical examples include glossing, citations, exemplification, Japanese yomi, and so on.) ANSI .  (1) The American National Standards Institute. (2) The Microsoft collective name for all Windows code pages. Sometimes used specifically for code page 1252, which is a superset of ISO/IEC 8859-1. Apparatus Criticus . Collection of conventions used by editors to annotate and comment on text. Arabic Digits . The term "Arabic digits" may mean either the digits in the Arabic script (see Arabic-Indic digits ) or the ordinary ASCII digits in contrast to Roman numerals (see European digits ). When the term "Arabic digits" is used in Unicode specifications, it means Arabic-Indic digits. See Terminology for Digits for additional information on terminology related to digits. Arabic-Indic Digits . Forms of decimal digits used in most parts of the Arabic world (for instance, U+0660, U+0661, U+0662, U+0663). Although European digits (1, 2, 3,…) derive historically from these forms, they are visually distinct and are coded separately. (Arabic-Indic digits are sometimes called Indic numerals; however, this nomenclature leads to confusion with the digits currently used with the scripts of India.) Variant forms of Arabic-Indic digits used chiefly in Iran and Pakistan are referred to as Eastern Arabic-Indic digits . (See Section 9.2, Arabic .) See Terminology for Digits for additional information on terminology related to digits. ASCII . (1) The American Standard Code for Information Interchange, a 7-bit coded character set for information interchange. It is the U.S. national variant of ISO/IEC 646 and is formally the U.S. standard ANSI X3.4. It was proposed by ANSI in 1963 and finalized in 1968. (2) The set of 128 Unicode characters from U+0000 to U+007F, including control codes as well as graphic characters. (3) ASCII has been incorrectly used to refer to various 8-bit character encodings that include ASCII characters in the first 128 code points. ASCII digits . The digit characters U+0030 to U+0039. Also known as European digits . See Terminology for Digits for additional information on terminology related to digits. Assigned Character .  A code point that is assigned to an abstract character. This refers to graphic, format, control, and private-use characters that have been encoded in the Unicode Standard. (See Section 2.4, Code Points and Characters .) Assigned Code Point .  (See designated code point .) Atomic Character .  A character that is not decomposable. (See decomposable character .) B Base Character . Any graphic character except for those with the General Category of Combining Mark (M). (See definition D51 in Section 3.6, Combination .) In a combining character sequence, the base character is the initial character, which the combining marks are applied to. Basic Multilingual Plane . Plane 0, abbreviated as BMP. Bicameral . A script that distinguishes between two cases. (See case .) Most often used in the context of Latin-based alphabets of Europe and elsewhere in the world. Bidi . Abbreviation of bidirectional, in reference to mixed left-to-right and right-to-left text. Bidirectional Display . The process or result of mixing left-to-right text and right-to-left text in a single line. (See Unicode Standard Annex #9, “Unicode Bidirectional Algorithm.” ) Big-endian . A computer architecture that stores multiple-byte numerical values with the most significant byte (MSB) values first. Binary Files . Files containing nontextual information. Block . A grouping of characters within the Unicode encoding space used for organizing code charts. Each block is a uniquely named, continuous, non-overlapping range of code points, containing a multiple of 16 code points, and starting at a location that is a multiple of 16. A block may contain unassigned code points, which are reserved. BMP . Acronym for Basic Multilingual Plane . BMP Character . A Unicode encoded character having a BMP code point. (See supplementary character .) BMP Code Point . A Unicode code point between U+0000 and U+FFFF. (See supplementary code point .) BNF . Acronym for Backus-Naur Form , a formal meta-syntax for describing context-free syntaxes. (For details, see Appendix A, Notational Conventions .) BOCU-1 . Acronym for Binary Ordered Compression for Unicode. A Unicode compression scheme that is MIME-compatible (directly usable for e-mail) and preserves binary order, which is useful for databases and sorted lists. BOM .  Acronym for byte order mark . Bopomofo . An alphabetic script used primarily in the Republic of China (Taiwan) to write the sounds of Mandarin Chinese and some other dialects. Each symbol corresponds to either the syllable-initial or syllable-final sounds; it is therefore a subsyllabic script in its primary usage. The name is derived from the names of its first four elements. More properly known as zhuyin zimu or zhuyin fuhao in Mandarin Chinese. Boustrophedon . A pattern of writing seen in some ancient manuscripts and inscriptions, where alternate lines of text are laid out in opposite directions, and where right-to-left lines generally use glyphs mirrored from their left-to-right forms. Literally, “as the ox turns,” referring to the plowing of a field. Braille . A writing system using a series of raised dots to be read with the fingers by people who are blind or whose eyesight is not sufficient for reading printed material. (See Section 21.1, Braille .) Braille Pattern . One of the 64 (for six-dot Braille) or 256 (for eight-dot Braille) possible tangible dot combinations. Byte . (1) The minimal unit of addressable storage for a particular computer architecture. (2) An octet. Note that many early computer architectures used bytes larger than 8 bits in size, but the industry has now standardized almost uniformly on 8-bit bytes. The Unicode Standard follows the current industry practice in equating the term byte with octet and using the more familiar term byte in all contexts. (See octet .) Byte Order Mark . The Unicode character U+FEFF when used to indicate the byte order of a text. (See Section 2.13, Special Characters and Noncharacters , and Section 23.8, Specials .) Byte Serialization . The order of a series of bytes determined by a computer architecture. Byte-Swapped . Reversal of the order of a sequence of bytes. C Camelcase . A casing convention for compound terms or identifiers, in which the letters are mostly lowercased, but component words or abbreviations may be capitalized. For example, "ThreeWordTerm" or "threeWordTerm". Canonical . (1) Conforming to the general rules for encoding—that is, not compressed, compacted, or in any other form specified by a higher protocol. (2) Characteristic of a normative mapping and form of equivalence specified in Chapter 3, Conformance . Canonical Composition . A step in the algorithm for Unicode Normalization Forms, during which decomposed sequences are replaced by primary composites, where possible. (See definition D115 in Section 3.11, Normalization Forms .) Canonical Decomposable Character . A character that is not identical to its canonical decomposition. (See definition D69 in Section 3.7, Decomposition .) Canonical Decomposition . Mapping to an inherently equivalent sequence—for example, mapping ä to a +  combining umlaut. (For a full, formal definition, see definition D68 in Section 3.7, Decomposition .) Canonical Equivalence . The relation between two character sequences whose full canonical decompositions are identical. (See definition D70 in Section 3.7, Decomposition .) Canonical Equivalent . Two character sequences are said to be canonical equivalents if their full canonical decompositions are identical. (See definition D70 in Section 3.7, Decomposition .) Canonical Ordering . The order of a combining character sequence that results from the application of the Canonical Ordering Algorithm, a step in the process of normalization of strings. See definition D109 in Section 3.11, Normalization Forms . Cantillation Mark . A mark that is used to indicate how a text is to be chanted or sung. Capital Letter . Synonym for uppercase letter . (See case .) Case . (1) Feature of certain alphabets where the letters have two distinct forms. These variants, which may differ markedly in shape and size, are called the uppercase letter (also known as capital or majuscule ) and the lowercase letter (also known as small or minuscule ). (2) Normative property of characters, consisting of uppercase, lowercase, and titlecase (Lu, Ll, and Lt). (See Section 4.2, Case .) Case Folding . The mapping of strings to a particular case form, to facilitate searching and sorting of text. Case foldings may be simple, when the case mappings are required not to change the length of the strings to compare, or full, when the case mappings may change the length of the strings to compare. (See Section 3.13.3, Default Case Folding .) Case Mapping . The association of the uppercase, lowercase, and titlecase forms of a letter. (See Section 5.18, Case Mappings .) Case-Ignorable . A character C is defined to be case-ignorable if C has the value MidLetter (ML), MidNumLet (MB), or Single_Quote (SQ) for the Word_Break property or its General_Category is one of Nonspacing_Mark (Mn), Enclosing_Mark (Me), Format (Cf), Modifier_Letter (Lm), or Modifier_Symbol (Sk). (See definition D136 in Section 3.13, Default Case Algorithms .) Case-Ignorable Sequence . A sequence of zero or more case-ignorable characters. (See definition D137 in Section 3.13, Default Case Algorithms .) CCC . Short name for the Canonical_Combining_Class property, usually lowercased: ccc. CCS . (1) Acronym for coded character set . (2) Also used as an acronym for combining character sequence . Cedilla . A mark originally placed beneath the letter c in French, Portuguese, and Spanish to indicate that the letter is to be pronounced as an s, as in façade . Obsolete Spanish diminutive of ceda , the letter z . CEF . Acronym for character encoding form . CES . Acronym for character encoding scheme . Character . (1) The smallest component of written language that has semantic value; refers to the abstract meaning and/or shape, rather than a specific shape (see also glyph ), though in code tables some form of visual representation is essential for the reader’s understanding. (2) Synonym for abstract character . (3) The basic unit of encoding for the Unicode character encoding. (4) The English name for the ideographic written elements of Chinese origin. [See ideograph (2).] Character Block . (See block .) Character Class . A set of characters sharing a particular set of properties. Character Encoding Form . Mapping from a character set definition to the actual code units used to represent the data. Character Encoding Scheme . A character encoding form plus byte serialization. There are seven character encoding schemes in Unicode: UTF-8, UTF-16, UTF-16BE, UTF-16LE, UTF-32, UTF-32BE, and UTF-32LE. Character Entity . Expression of the form & for "&" or   for the no-break space. These are found in markup language files like HTML or XML. There are also numerically defined character entities. (See also character escape .) Character Escape . A numerical expression of the form \uXXXX, \xXXXX or &#xXXXX; where X is a hex digit, or &#dddd; where d is a decimal digit. These are found in programming source code or markup language files (such as HTML or XML). Character Name . A unique string used to identify each abstract character encoded in the standard. (See definition D4 in Section 3.3, Semantics .) Character Name Alias . An additional unique string identifier, other than the character name, associated with an encoded character in the standard. (See definition D5 in Section 3.3, Semantics .) Character Properties . A set of property names and property values associated with individual characters. (See Chapter 4, Character Properties .) Character Repertoire . The collection of characters included in a character set. Character Sequence . Synonym for abstract character sequence . Character Set . A collection of elements used to represent textual information. Charset . (See coded character set .) Chillu . Abbreviation for chilaaksharam (singular) ( cillakṣaram ). Refers to any of a set of sonorant consonants in Malayalam, when appearing in syllable-final position with no inherent vowel. Choseong . A sequence of one or more leading consonants in Korean. Chu Hán . The name for Han characters used in Vietnam; derived from hànzì . Chu Nôm . A demotic script of Vietnam developed from components of Han characters. Its creators used methods similar to those used by the Chinese in creating Han characters. CJK . Acronym for Chinese, Japanese, and Korean. A variant, CJKV , means Chinese, Japanese, Korean, and Vietnamese. CJK Unified Ideograph . A Han character that has undergone the process of Han unification (conducted primarily by the Ideographic Research Group) and been encoded as a single ideograph with one or more clearly identified CJK source mappings. CJK unified ideographs have no decomposition mappings, and the set of them in the Unicode Standard is normatively specified by the Unified_Ideograph property. CLDR . (See Unicode Common Locale Data Repository .) Coded Character . (See encoded character .) Coded Character Representation . Synonym for coded character sequence . Coded Character Sequence . An ordered sequence of one or more code points. Normally, this consists of a sequence of encoded characters, but it may also include noncharacters or reserved code points. (See definition D12 in Section 3.4, Characters and Encoding .) Coded Character Set . A character set in which each character is assigned a numeric code point. Frequently abbreviated as character set, charset , or code set ; the acronym CCS is also used. Code Page . A coded character set, often referring to a coded character set used by a personal computer—for example, PC code page 437, the default coded character set used by the U.S. English version of the DOS operating system. Code Point . (1) Any value in the Unicode codespace; that is, the range of integers from 0 to 10FFFF 16 . (See definition D10 in Section 3.4, Characters and Encoding .) Not all code points are assigned to encoded characters. See code point type . (2) A value, or position, for a character, in any coded character set. Code Point Type . Any of the seven fundamental classes of code points in the standard: Graphic, Format, Control, Private-Use, Surrogate, Noncharacter, Reserved. (See definition D10a in Section 3.4, Characters and Encoding .) Code Position . Synonym for code point . Used in ISO character encoding standards. Code Set . (See coded character set .) Codespace . (1) A range of numerical values available for encoding characters. (2) For the Unicode Standard, a range of integers from 0 to 10FFFF 16 . (See definition D9 in Section 3.4, Characters and Encoding .) Code Unit . The minimal bit combination that can represent a unit of encoded text for processing or interchange. The Unicode Standard uses 8-bit code units in the UTF-8 encoding form, 16-bit code units in the UTF-16 encoding form, and 32-bit code units in the UTF-32 encoding form. (See definition D77 in Section 3.9, Unicode Encoding Forms .) Code Value . Obsolete synonym for code unit . Codomain . For a mapping, the codomain is the set of code points or sequences that it maps to, while the domain is the set of values that are mapped. For example, a canonical decomposition is a mapping from a set of code points to a set of sequences; the codomain is the set of canonical equivalent mappings. (See also domain .) Collation . The process of ordering units of textual information. Collation is usually specific to a particular language. Also known as alphabetizing or alphabetic sorting . Unicode Technical Standard #10, “Unicode Collation Algorithm," defines a complete, unambiguous, specified ordering for all characters in the Unicode Standard. Combining Character . A character with the General Category of Combining Mark (M). (See definition D52 in Section 3.6, Combination .) (See also nonspacing mark .) Combining Character Sequence . A maximal character sequence consisting of either a base character followed by a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner ; or a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner . (See definition D56 in Section 3.6, Combination .) Combining Class . A numeric value in the range 0..254 given to each Unicode code point, formally defined as the property Canonical_Combining_Class. (See definition D104 in Section 3.11, Normalization Forms .) Combining Mark . A commonly used synonym for combining character . Compatibility . (1) Consistency with existing practice or preexisting character encoding standards. (2) Characteristic of a normative mapping and form of equivalence specified in Section 3.7, Decomposition . Compatibility Character . A character that would not have been encoded except for compatibility and round-trip convertibility with other standards. (See Section 2.3, Compatibility Characters .) Compatibility Composite Character . Synonym for compatibility decomposable character . Compatibility Decomposable Character . A character whose compatibility decomposition is not identical to its canonical decomposition. (See definition D66 in Section 3.7, Decomposition .) Compatibility Decomposition . Mapping to a roughly equivalent sequence that may differ in style. (For a full, formal definition, see definition D65 in Section 3.7, Decomposition .) Compatibility Equivalence . The relation between two character sequences whose full compatibility decompositions are identical. (See definition D67 in Section 3.7, Decomposition .) Compatibility Equivalent . Two character sequences are said to be compatibility equivalents if their full compatibility decompositions are identical. (See definition D67 in Section 3.7, Decomposition .) Compatibility Ideograph . A Han character encoded for compatibility with some East Asian character encoding, but which is not encoded as a CJK unified ideograph . Instead, each compatibility ideograph has a canonical decomposition mapping to a particular CJK unified ideograph. Compatibility Precomposed Character . Synonym for compatibility decomposable character . Compatibility Variant . A character that generally can be remapped to another character without loss of information other than formatting. Composite Character . (See decomposable character .) Composite Character Sequence . (See combining character sequence .) Composition Exclusion . A Canonical Decomposable Character which has the property value Composition_Exclusion=True. (Used in the definition of Unicode Normalization Forms.) (See definition D112 in Section 3.11, Normalization Forms .) Conformance . Adherence to a specified set of criteria for use of a standard. (See Chapter 3, Conformance .) Confusable . Of similar or identical appearance. When referring to characters in strings, the appearance of confusable characters can make different identifiers hard or impossible to distinguish. (See also Unicode Technical Standard #39, "Unicode Security Mechanisms" .) Conjunct Form . A ligated form representing a consonant conjunct . Consonant Cluster .  A sequence of two or more consonantal sounds. Depending on the writing system, a consonant cluster may be represented by a single character or by a sequence of characters. (Contrast digraph .) Consonant Conjunct . A sequence of two or more adjacent consonantal letterforms, consisting of a sequence of one or more dead consonants followed by a normal, live consonant letter. A consonant conjunct may be ligated into a single conjunct form, or it may be represented by graphically separable parts, such as subscripted forms of the consonant letters. Consonant conjuncts are associated with the Brahmi family of Indic scripts. (See Section 12.1, Devanagari .) Contextual Variant . A text element can have a presentation form that depends on the textual context in which it is rendered. This presentation form is known as a contextual variant . Contributory Property . A simple property defined merely to make the statement of a rule defining a derived property more compact or general. (See definition D35a in Section 3.5, Properties .) Control Codes . The 65 characters in the ranges U+0000..U+001F and U+007F..U+009F. Also known as control characters . Core Specification . The central part of the Unicode Standard–the portion which up until Version 5.0 was published as a separate book. Starting with Version 5.2, this part of the standard has been published online only, rather than as a book. The core specification consists of the general introduction and framework for the standard, the formal conformance requirements, many implementation guidelines, and extensive chapters providing information about all the encoded characters, organized by script or by significant classes of characters. Formally, a version of the Unicode Standard is defined by an edition of this core specification, together with the Code Charts , Unicode Standard Annexes , and the Unicode Character Database Cursive . Writing where the letters of a word are connected. D Dasia . Greek term for rough breathing mark, used in polytonic Greek character names. DBCS . Acronym for double-byte character set . Dead Consonant . An Indic consonant character followed by a virama character. This sequence indicates that the consonant has lost its inherent vowel. (See Section 12.1, Devanagari .) Decimal Digits . Digits that can be used to form decimal-radix numbers. Decomposable Character . A character that is equivalent to a sequence of one or more other characters, according to the decomposition mappings found in the Unicode Character Database, and those described in Section 3.12, Conjoining Jamo Behavior . It may also be known as a precomposed character or a composite character. (See definition D63 in Section 3.7, Decomposition .) Decomposition . (1) The process of separating or analyzing a text element into component units. These component units may not have any functional status, but may be simply formal units—that is, abstract shapes. (2) A sequence of one or more characters that is equivalent to a decomposable character. (See definition D64 in Section 3.7, Decomposition .) Decomposition Mapping . A mapping from a character to a sequence of one or more characters that is a canonical or compatibility equivalent and that is listed in the character names list or described in Section 3.12, Conjoining Jamo Behavior . (See definition D62 in Section 3.7, Decomposition .) Default Ignorable . Default ignorable code points are those that should be ignored by default in rendering unless explicitly supported. They have no visible glyph or advance width in and of themselves, although they may affect the display, positioning, or adornment of adjacent or surrounding characters. (See Section 5.21, Ignoring Characters in Processing .) Defective Combining Character Sequence . A combining character sequence that does not start with a base character. (See definition D57 in Section 3.6, Combination .) Demotic Script . (1) A script or a form of a script used to write the vernacular or common speech of some language community. (2) A simplified form of the ancient Egyptian hieratic writing. Dependent Vowel . A symbol or sign that represents a vowel and that is attached or combined with another symbol, usually one that represents a consonant. For example, in writing systems based on Arabic, Hebrew, and Indic scripts, vowels are normally represented as dependent vowel signs. Deprecated . Of a coded character or a character property, strongly discouraged from use. (Not the same as obsolete .) Deprecated Character . A coded character whose use is strongly discouraged. Such characters are retained in the standard, indefinitely but should not be used. (See definition D13 in Section 3.4, Characters and Encoding .) Designated Code Point . Any code point that has either been assigned to an abstract character ( assigned characters ) or that has otherwise been given a normative function by the standard (surrogate code points and noncharacters). This definition excludes reserved code points. Also known as assigned code point . (See Section 2.4 Code Points and Characters .) Deterministic Comparison . A string comparison in which strings that do not have identical contents will compare as unequal. There are two main varieties, depending on the sense of "identical:" (a) binary equality, or (b) canonical equivalence. This is a property of the comparison mechanism, and not of the sorting algorithm. Also known as stable (or semi-stable ) comparison . Deterministic Sort . A sort algorithm which returns exactly the same output each time it is applied to the same input. This is a property of the sorting algorithm, and not of the comparison mechanism. For example, a randomized Quicksort (which picks a random element as the pivot element, for optimal performance) is not deterministic. Multiprocessor implementations of a sort algorithm may also not be deterministic. Diacritic . (1) A mark applied or attached to a symbol to create a new symbol that represents a modified or new value. (2) A mark applied to a symbol irrespective of whether it changes the value of that symbol. In the latter case, the diacritic usually represents an independent value (for example, an accent, tone, or some other linguistic information). Also called diacritical mark or diacritical . (See also combining character and nonspacing mark .) Diaeresis . Two horizontal dots over a letter, as in naïve . The diaeresis is not distinguished from the umlaut in the Unicode character encoding. (See umlaut .) Dialytika . Greek term for diaeresis or trema , used in Greek character names. Digits . (See Arabic digits , European digits , and Indic digits .) See Terminology for Digits for additional information on terminology related to digits. Digraph . A pair of signs or symbols (two graphs), which together represent a single sound or a single linguistic unit. The English writing system employs many digraphs (for example, th, ch, sh, qu, and so on). The same two symbols may not always be interpreted as a digraph (for example, ca th ode versus ca th ouse ). When three signs are so combined, they are called a trigraph . More than three are usually called an n-graph . Dingbats . Typographical symbols and ornaments. Diphthong . A pair of vowels that are considered a single vowel for the purpose of phonemic distinction. One of the two vowels is more prominent than the other. In writing systems, diphthongs are sometimes written with one symbol and sometimes with more than one symbol (for example, with a digraph ). Direction . (See paragraph direction .) Directionality Property . A property of every graphic character that determines its horizontal ordering as specified in Unicode Standard Annex #9, “Unicode Bidirectional Algorithm.” (See Section 4.4, Directionality .) Display Cell . A rectangular region on a display device within which one or more glyphs are imaged. Display Order . The order of glyphs presented in text rendering. (See logical order and Section 2.2, Unicode Design Principles .) Domain . 1. For a mapping, the domain is the set of code points or sequences that are mapped, while the codomain is the set of values they are mapped to. For example, a canonical decomposition is a mapping from a set of code points to a set of sequences; the domain is the entire Unicode codespace. (See also codomain .) 2. A realm of administrative autonomy, authority or control in the Internet, identified by a domain name. Domain Name . The part of a network address that identifies it as belonging to a particular domain. (Oxford Languages definition.) A domain name is a string of characters. The rules for how Unicode characters can be used in domain names is the concern of IDNA and of UTS #46, Unicode IDNA Compatibility Processing . Double-Byte Character Set . One of a number of character sets defined for representing Chinese, Japanese, or Korean text (for example, JIS X 0208-1990). These character sets are often encoded in such a way as to allow double-byte character encodings to be mixed with single-byte character encodings. Abbreviated DBCS . (See also multibyte character set .) Ductility . The ability of a cursive font to stretch or compress the connective baseline to effect text justification. Dynamic Composition . Creation of composite forms such as accented letters or Hangul syllables from a sequence of characters. E EBCDIC . Acronym for Extended Binary-Coded Decimal Interchange Code. A group of coded character sets used on mainframes that consist of 8-bit coded characters. EBCDIC coded character sets reserve the first 64 code points (x00 to x3F) for control codes, and reserve the range x41 to xFE for graphic characters. The English alphabetic characters are in discontinuous segments with uppercase at xC1 to xC9, xD1 to xD9, xE2 to xE9, and lowercase at x81 to x89, x91 to x99, xA2 to xA9. ECCS . Acronym for extended combining character sequence . EGC . Acronym for extended grapheme cluster . Embedding . A concept relevant to bidirectional behavior. (See Unicode Standard Annex #9, “Unicode Bidirectional Algorithm,” for detailed terminology and definitions.) Emoji . (1) The Japanese word for "pictograph." (2) Certain pictographic and other symbols encoded in the Unicode Standard that are commonly given a colorful or playful presentation when displayed on devices. Many of the emoji in Unicode were originally encoded for compatibility with Japanese telephone symbol sets. (3) Colorful or playful symbols which are not encoded as characters but which are widely implemented as graphics. (See pictograph .) Emoticon . A symbol added to text to express emotional affect or reaction—for example, sadness, happiness, joking intent, sarcasm, and so forth. Emoticons are often expressed by a conventional kind of "ASCII art," using sequences of punctuation and other symbols to portray likenesses of facial expressions. In Western contexts these are often turned sideways, as :-) to express a happy face; in East Asian contexts other conventions often portray a facial expression without turning, as ^-^. Rendering systems often recognize conventional emoticon sequences and display them as colorful or even animated glyphs in text. There is also a set of dedicated pictographic symbols—mostly representing different facial expressions—encoded as characters in the Unicode Standard. (See pictograph .) Encapsulated Text . (1) Plain text surrounded by formatting information. (2) Text recoded to pass through narrow transmission channels or to match communication protocols. Enclosing Mark . A nonspacing mark with the General Category of Enclosing Mark (Me). (See definition D54 in Section 3.6, Combination .) Enclosing marks are a subclass of nonspacing marks that surround a base character, rather than merely being placed over, under, or through it. Encoded Character . An association (or mapping) between an abstract character and a code point . (See definition D11 in Section 3.4, Characters and Encoding .) By itself, an abstract character has no numerical value, but the process of “encoding a character” associates a particular code point with a particular abstract character, thereby resulting in an “encoded character.” Encoding Form . (See character encoding form .) Encoding Scheme . (See character encoding scheme .) Equivalence . In the context of text processing, the process or result of establishing whether two text elements are identical in some respect. Equivalent Sequence . (See canonical equivalent .) Escape Sequence . A sequence of bytes that is used for code extension. The first byte in the sequence is escape (hex 1B). EUDC . Acronym for end-user defined character. A character defined by an end user, using a private-use code point, to represent a character missing in a particular character encoding. These are common in East Asian implementations. European Digits . Forms of decimal digits first used in Europe and now used worldwide. Historically, these digits were derived from the Arabic digits; they are sometimes called “Arabic numerals,” but this nomenclature leads to confusion with the real Arabic-Indic digits . Also called "Western digits" and "Latin digits." See Terminology for Digits for additional information on terminology related to digits. Extended Base . Any base character, or any standard Korean syllable block. (See definition D51a in Section 3.6, Combination .) Extended Combining Character Sequence . A maximal character sequence consisting of either an extended base followed by a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner ; or a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner . Abbreviated as ECCS . (See definition D56a in Section 3.6, Combination .) Extended Grapheme Cluster . The text between extended grapheme cluster boundaries as specified by Unicode Standard Annex #29, "Unicode Text Segmentation." Abbreviated as EGC . (See definition D61 in Section 3.6, Combination .) F Fancy Text . (See rich text .) Fixed Position Class . A subset of the range of numeric values for combining classes—specifically, any value in the range 10..199. (See definition D105 in Section 3.11, Normalization Forms .) Floating ( diacritic, accent, mark ). (See nonspacing mark .) Folding . An operation that maps similar characters to a common target, such as uppercasing or lowercasing a string. Folding operations are most often used to temporarily ignore certain distinctions between characters. Font . A collection of glyphs used for the visual depiction of character data. A font is often associated with a set of parameters (for example, size, posture, weight, and serifness), which, when set to particular values, generate a collection of imagable glyphs. Format Character . A character that is inherently invisible but that has an effect on the surrounding characters. Format Code . Synonym for format character . Format Control Character . Synonym for format character . Formatted Text . (See rich text .) FSS-UTF . Acronym for File System Safe UCS Transformation Format , published by the X/Open Company Ltd., and intended for the UNIX environment. Now known as UTF-8 . Full Composition Exclusion . A Canonical Decomposable Character which has the property value Full_Composition_Exclusion=True. (Used in the definition of Unicode Normalization Forms.) (See definition D113 in Section 3.11, Normalization Forms .) Fullwidth . Characters of East Asian character sets whose glyph image extends across the entire character display cell. In legacy character sets, fullwidth characters are normally encoded in two or three bytes. The Japanese term for fullwidth characters is zenkaku . FVS . Acronym for Mongolian Free Variation Selector . G G11n . (See globalization .) GC . 1. Acronym for grapheme cluster . 2. Short name for the General_Category property, usually lowercased: gc. GCGID . Acronym for Graphic Character Global Identifier. These are listed in the IBM document Character Data Representation Architecture, Level 1, Registry SC09-1391 . General Category . Partition of the characters into major classes such as letters, punctuation, and symbols, and further subclasses for each of the major classes. (See Section 4.5, General Category .) Generative . Synonym for productive . Globalization . (1) The overall process for internationalization and localization of  software products. (2) a synonym for internationalization. Also known by the abbreviation "g11n". Note that the meaning of "globalization" which is relevant to software products should be distinguished from the more widespread use of "globalization" in the context of economics. (See internationalization , localization .) Glyph . (1) An abstract form that represents one or more glyph images. (2) A synonym for glyph image . In displaying Unicode character data, one or more glyphs may be selected to depict a particular character. These glyphs are selected by a rendering engine during composition and layout processing. (See also character .) Glyph Code . A numeric code that refers to a glyph. Usually, the glyphs contained in a font are referenced by their glyph code. Glyph codes may be local to a particular font; that is, a different font containing the same glyphs may use different codes. Glyph Identifier . Similar to a glyph code, a glyph identifier is a label used to refer to a glyph within a font. A font may employ both local and global glyph identifiers. Glyph Image . The actual, concrete image of a glyph representation having been rasterized or otherwise imaged onto some display surface. Glyph Metrics . A collection of properties that specify the relative size and positioning along with other features of a glyph. Grapheme . (1) A minimally distinctive unit of writing in the context of a particular writing system. For example, ‹b› and ‹d› are distinct graphemes in English writing systems because there exist distinct words like big and dig. Conversely, a lowercase italiform letter a and a lowercase Roman letter a are not distinct graphemes because no word is distinguished on the basis of these two different forms. (2) What a user thinks of as a character. Grapheme Base . A character with the property Grapheme_Base, or any standard Korean syllable block. (See definition D58 in Section 3.6, Combination .) Grapheme Cluster . The text between grapheme cluster boundaries as specified by Unicode Standard Annex #29, "Unicode Text Segmentation." (See definition D60 in Section 3.6, Combination .) A grapheme cluster represents a horizontally segmentable unit of text, consisting of some grapheme base (which may consist of a Korean syllable) together with any number of nonspacing marks applied to it. Grapheme Extender . A character with the property Grapheme_Extend. (See definition D59 in Section 3.6, Combination .) Grapheme extender characters consist of all nonspacing marks, zero width joiner , zero width non-joiner , and a small number of spacing marks. Graphic Character . A character with the General Category of Letter (L), Combining Mark (M), Number (N), Punctuation (P), Symbol (S), or Space Separator (Zs). (See definition D50 in Section 3.6. Combination .) Guillemet . Punctuation marks resembling small less-than and greater-than signs, used as quotation marks in French and other languages. (See “Language-Based Usage of Quotation Marks” in Section 6.2, General Punctuation .) H Halant . A preferred Hindi synonym for a virama . It literally means killer , referring to its function of killing the inherent vowel of a consonant letter. (See virama .) Half-Consonant Form . In the Devanagari script and certain other scripts of the Brahmi family of Indic scripts, a dead consonant may be depicted in the so-called half-form. This form is composed of the distinctive part of a consonant letter symbol without its vertical stem. It may be used to create conjunct forms that follow a horizontal layout pattern. Also known as half-form . Halfwidth . Characters of East Asian character sets whose glyph image occupies half of the character display cell. In legacy character sets, halfwidth characters are normally encoded in a single byte. The Japanese term for halfwidth characters is hankaku . Han Characters . Ideographic characters of Chinese origin. (See Section 18.1, Han .) Hangul . The name of the script used to write the Korean language. Hangul Syllable . (1) Any of the 11,172 encoded characters of the Hangul Syllables character block, U+AC00..U+D7A3. Also called a precomposed Hangul syllable to clearly distinguish it from a Korean syllable block. (2) Loosely speaking, a Korean syllable block . Hanja . The Korean name for Han characters; derived from the Chinese word hànzì . Hankaku . (See halfwidth .) Han Unification . The process of identifying Han characters that are in common among the writing systems of Chinese, Japanese, Korean, and Vietnamese. Hànzì . The Mandarin Chinese name for Han characters. Harakat . Marks used in the Arabic script to indicate vocalization with short vowels. A subtype of tashkil . Hasant . The Bangla name for halant . (See virama .) Higher-Level Protocol . Any agreement on the interpretation of Unicode characters that extends beyond the scope of this standard. Note that such an agreement need not be formally announced in data; it may be implicit in the context. (See definition D16 in Section 3.4, Characters and Encoding .) High-Surrogate Code Point . A Unicode code point in the range U+D800 to U+DBFF. (See definition D71 in Section 3.8, Surrogates .) High-Surrogate Code Unit . A 16-bit code unit in the range D800 16 to DBFF 16 , used in UTF-16 as the leading code unit of a surrogate pair. Also known as a leading surrogate . (See definition D72 in Section 3.8, Surrogates .) Hiragana (ひらがな). One of two standard syllabaries associated with the Japanese writing system. Hiragana syllables are typically used in the representation of native Japanese words and grammatical particles, or are used as a fallback representation of other words when the corresponding kanji is either difficult to remember or obscure. (See also katakana .) Horizontal Extension . This refers to the process of adding a new IRG source reference to an existing CJK unified ideograph, along with a new representative glyph for the code charts that shows how the character appears in its source. It does not involve encoding a new character, but rather just adding the source reference and new glyph to the code charts. HTML . HyperText Markup Language. A text description language related to SGML; it mixes text format markup with plain text content to describe formatted text. HTML is ubiquitous as the source language for Web pages on the Internet. Starting with HTML 4.0, the Unicode Standard functions as the reference character set for HTML content. (See also SGML .) I I18n . (See internationalization .) IANA . Acronym for Internet Assigned Numbers Authority. ICU . Acronym for International Components for Unicode, an Open Source set of C/C++ and Java libraries for Unicode and software internationalization support. For information, see https://icu.unicode.org/ Ideograph (or ideogram ). (1) Any symbol that primarily denotes an idea or concept in contrast to a sound or pronunciation—for example, ♻, which denotes the concept of recycling by a series of bent arrows. (2) A generic term for the unit of writing of a logosyllabic writing system. In this sense, ideograph (or ideogram) is not systematically distinguished from logograph (or logogram). (3) A term commonly used to refer specifically to Han characters, equivalent to the Chinese, Japanese, or Korean terms also sometimes used: hànzì , kanji , or hanja . (See logograph , pictograph , sinogram .) Ideographic Property . Informative property of characters that are ideographs. (See Section 4.10, Letters, Alphabetic, and Ideographic .) Ideographic Variation Sequence . A variation sequence registered in the Ideographic Variation Database . The registration of ideographic variation sequences is subject to the rules specified in Unicode Technical Standard #37, "Unicode Ideographic Variation Database." The base character for an ideographic variation sequence must be an ideographic character, and it makes use of a variation selector in the range U+E0100..U+E01EF. The term ideographic variation sequence is sometimes abbreviated as "IVS". IDN . (See Internationalized Domain Name .) IDNA (1) The IDNA2008 protocol for IDNs defined in RFCs 5891 , 5892 , 5893 and 5894 . The protocol categorizes characters (for example as PVALID or DISALLOWED) based on Unicode properties as described in RFC 5892 . (For the range of valid code points for each Unicode version, see the data file for the derived IDNA2008_Category property.) (2) The earlier IDNA2003 protocol. (See IDNA Compatibility Processing for differences between IDNA2003 and IDNA2008 .) IDNA Compatibility Processing . (See Unicode Technical Standard #46, "Unicode IDNA Compatibility Processing" .) IDNA2003 . (See IDNA (2).) IDNA2008 . (See IDNA (1).) IICore . A subset of common-use CJK unified ideographs, defined as the fixed collection 370 IICore in ISO/IEC 10646. This subset contains 9,810 ideographs and is intended for common use in East Asian contexts, particularly for small devices that cannot support the full range of CJK unified ideographs encoded in the Unicode Standard. Ijam . Diacritical marks applied to basic letter forms to derive new (usually consonant) letters for extended Arabic alphabets. For example, see the three dots below which appear in the letter peh: پ Ijam marks are not separately encoded as combining marks in the Unicode Standard, but instead are integral parts of each atomically encoded Arabic letter. Contrast tashkil . See also Section 9.2, Arabic . Ill-Formed Code Unit Sequence . A code unit sequence that does not follow the specification of a Unicode encoding form. (See definition D84 in Section 3.9, Unicode Encoding Forms .) Ill-Formed Code Unit Subsequence . A non-empty subsequence of a Unicode code unit sequence X which does not contain any code units which also belong to any minimal well-formed subsequence of X. (See definition D84a in Section 3.9, Unicode Encoding Forms .) IME . (See Input Method Editor .) In-Band . An in-band channel conveys information about text by embedding that information within the text itself, with special syntax to distinguish it. In-band information is encoded in the same character set as the text, and is interspersed with and carried along with the text data. Examples are XML and HTML markup. Independent Vowel . In Indic scripts, certain vowels are depicted using independent letter symbols that stand on their own. This is often true when a word starts with a vowel or a word consists of only a vowel. Indic Digits . Forms of decimal digits used in various Indic scripts (for example, Devanagari: U+0966, U+0967, U+0968, U+0969). Arabic digits (and, eventually, European digits) derive historically from these forms. See Terminology for Digits for additional information on terminology related to digits. Informative . Information in this standard that is not normative but that contributes to the correct use and implementation of the standard. Inherent Vowel . In writing systems based on a script in the Brahmi family of Indic scripts, a consonant letter symbol nor
2026-01-13T09:30:26
http://hackage.haskell.org/package/semigroupoids-1.2.6.1/docs/Data-Functor-Plus.html
Data.Functor.Plus Source Contents Index semigroupoids-1.2.6.1: Haskell 98 semigroupoids: Category sans id Portability portable Stability provisional Maintainer Edward Kmett <ekmett@gmail.com> Safe Haskell Safe-Infered Data.Functor.Plus Description   Synopsis class Alt f => Plus f where zero :: f a module Data.Functor.Alt Documentation class Alt f => Plus f where Source Laws: zero <!> m = m m <!> zero = m If extended to an Alternative then zero should equal empty . Methods zero :: f a Source Instances Plus []   Plus IO   Plus Maybe   Plus Seq   Plus IntMap   Plus Option   MonadPlus m => Plus ( WrappedMonad m)   Ord k => Plus ( Map k)   ( Bind f, Monad f) => Plus ( MaybeT f)   ( Apply f, Applicative f) => Plus ( ListT f)   Plus f => Plus ( IdentityT f)   Alternative f => Plus ( WrappedApplicative f)   ArrowPlus a => Plus ( WrappedArrow a b)   Plus f => Plus ( WriterT w f)   Plus f => Plus ( WriterT w f)   Plus f => Plus ( StateT e f)   Plus f => Plus ( StateT e f)   Plus f => Plus ( ReaderT e f)   ( Bind f, Monad f, Error e) => Plus ( ErrorT e f)   Plus f => Plus ( Static f a)   Plus f => Plus ( RWST r w s f)   Plus f => Plus ( RWST r w s f)   module Data.Functor.Alt Produced by Haddock version 2.10.0
2026-01-13T09:30:26
https://docs.asciidoctor.org/asciidoctor/latest/install/ruby-packaging/
Install Using Ruby Packaging | Asciidoctor Docs Asciidoctor Docs In this project AsciiDoc Language Syntax Quick Reference Processing Asciidoctor Ruby Asciidoctor.js JavaScript AsciidoctorJ Java Extensions Add-on Converters PDF Ruby EPUB3 Ruby reveal.js Ruby, JavaScript Source Compilers Reducer Ruby, JavaScript Extended Syntax Asciidoctor Diagram Ruby Tooling Build Automation Maven Tools Java Gradle Plugin Java Asciidoclet Java Text Editors / Viewers Browser Extension IntelliJ Plugin Chat List --> Source Tweets Asciidoctor Features What’s New in 2.0 Install and Update Supported Platforms Install Using Ruby Packaging Install Using Linux Packaging Install on macOS Install on Windows Convert Your First File Converters Available Converters Custom Converter Converter Templates Convertible Contexts Generate HTML Stylesheets Default Stylesheet Stylesheet Modes Apply a Custom Stylesheet Embed a CodeRay or Pygments Stylesheet Manage Images Use Local Font Awesome Add a Favicon Verbatim Block Line Wrapping Skip Front Matter Generate DocBook Generate Manual Pages Process AsciiDoc Using the CLI asciidoctor(1) Specify an Output File Process Multiple Source Files Pipe Content Through the CLI Set Safe Mode CLI Options Process AsciiDoc Using the API Load and Convert Files Load and Convert Strings Generate an HTML TOC Set Safe Mode Enable the Sourcemap Catalog Assets Find Blocks API Options Safe Modes Safe Mode Specific Content AsciiDoc Tooling Syntax Highlighting Highlight.js Rouge CodeRay Pygments Custom Adapter STEM Processing MathJax and HTML Asciidoctor Mathematical STEM Support in the DocBook Toolchain AsciiMath Gem Extensions Register Extensions Log from an Extension Preprocessor Tree Processor Postprocessor Docinfo Processor Block Processor Compound Block Processor Block Macro Processor Inline Macro Processor Include Processor Localization Support Errors and Warnings Migration Guides Upgrade from Asciidoctor 1.5.x to 2.0 Migrate from AsciiDoc.py Migrate from DocBook XML Migrate from Markdown Migrate from Confluence XHTML Migrate from MS Word Asciidoctor 2.0 AsciiDoc Asciidoctor 2.0 Asciidoctor.js 3.0 2.2 AsciidoctorJ 3.0 2.5 Asciidoctor PDF 2.3 2.2 2.1 2.0 Asciidoctor EPUB3 2.3 Asciidoctor reveal.js 5.0 4.1 Maven Tools 3.2 Gradle Plugin Suite 5.0 4.0 Asciidoclet 2.0 1.5.6 Asciidoctor Diagram 3.0.1 Browser Extension Community Asciidoctor Install and Update Install Using Ruby Packaging Edit this Page Install Using Ruby Packaging Using Ruby packaging entails making use of commands provided by Ruby ( gem and bundle ) to install gems. A gem is a packaged Ruby application or library, often retrieved from RubyGems.org . The benefit of using Ruby packaging to install Asciidoctor is that it’s universal. Provided you have configured Ruby correctly, Ruby packaging works the same way across all Ruby runtimes and operating systems. This page explains how to use Ruby packaging to install Asciidoctor from the asciidoctor gem. Unless you’re running in a container (Docker, podman, OCI), never install gems using gem install as the root user. Doing so will almost certainly interfere with, and possibly corrupt, the Ruby installation on your system. We strongly advise you to use Bundler to manage your gems within a project (or an RVM gemset to scope the install to your user/home directory). The gem install instructions are provided for when you’re running in a container or when your using RVM (ideally with a gemset). Configure Ruby packaging If you’re using Linux, the best way to ensure Ruby is configured to use Ruby packaging is to install Ruby using a Ruby version manager. We recommend that you set up RVM and use it to install Ruby in your home directory (i.e., user space). Once that is done, you can safely use the gem or bundle commands to install or update the Asciidoctor gem, or any other gem for that matter. When using Ruby managed by RVM, gems are installed in a location isolated from the system (so you don’t need root/administrator access). If you’re using Windows, you can install Ruby using Chocolatey or the RubyInstaller. You will not be able to use RVM if you are using Windows. If you’re using macOS, you can install Asciidoctor directly using Homebrew, though using RVM is also an option. gem install Once you’ve installed Ruby (and have activated it using rvm use 3.3 if you’re using RVM), open a terminal and type: $ gem install asciidoctor If the gem installed successfully, Asciidoctor’s command line interface (CLI) will be available on your PATH. To confirm that Asciidoctor is available, execute: $ asciidoctor --version You should see information about the Asciidoctor version and your Ruby environment printed in the terminal. Asciidoctor 2.0.26 [https://asciidoctor.org] Runtime Environment (ruby 3.3.0 [x86_64-linux]) (lc:UTF-8 fs:UTF-8 in:- ex:UTF-8) Install a prerelease version To install a prerelease version of Asciidoctor (e.g., a release candidate), include the --pre option when running the gem install command: $ gem install asciidoctor --pre The --pre option will select the prerelease version of Asciidoctor instead of the latest stable version. Note that it’s possible that the prerelease version is older than the latest stable version if no recent prerelease version is available. Bundler Bundler creates a virtual environment that scopes the installation of gems to the current project. Here’s how you can use it to install and run Asciidoctor. Create a Gemfile in the root folder of your project (or the current directory): $ bundle init Add the asciidoctor gem to the bottom of your Gemfile as follows: gem 'asciidoctor' # or specify the version explicitly # gem 'asciidoctor', '2.0.26' Save the Gemfile Open a terminal and install the gem using: $ bundle To upgrade the gem, specify the new version in the Gemfile and run bundle again. Using bundle update (without specifying a gem) is not recommended as it will also update other gems, which may not be the desired result. Once you install using Bundler, you must run any executables provided by the gems (e.g., asciidoctor ) from the directory where Gemfile is located and also prefix the executable name with bundle exec (e.g., bundle exec asciidoctor ). The bundle exec prefix tells Ruby to use the gems defined in the Gemfile . If you want to understand more about Bundler and bundle exec and when to use them, see the article Understanding Bundler . Upgrade using gem update You’re advised against using the gem update command to update a gem managed by the package manager. Doing so puts the system into an inconsistent state as the package manager can no longer track the files (which get installed under /usr/local ). Simply put, system gems should only be updated by the package manager. If you want to use a version of Asciidoctor that is newer than what is installed by the package manager, you should use RVM to install Ruby in your home directory (i.e., user space). Then, you can safely use the gem command to install or update the Asciidoctor gem. When using RVM, gems are installed in a location isolated from the system. You can upgrade Asciidoctor using the gem update command: $ gem update asciidoctor If you accidentally use gem install instead of gem update , then you’ll end up with both versions installed. To remove the older version, use the following gem command: $ gem cleanup asciidoctor Uninstall using gem uninstall You can uninstall Asciidoctor using the gem uninstall command: $ gem uninstall -x asciidoctor The -x option silences the confirmation to remove the asciidoctor executable, instead removing it automatically. In other words, it enables a complete uninstall. If you have multiple versions of Asciidoctor installed, you will be prompted to specify which version you want to uninstall. Select gem to uninstall: 1. asciidoctor-2.0.15 2. asciidoctor-2.0.16 3. All versions > You can uninstall a specific version, or all versions. Type one of the numbers at the prompt ( > ) and press Enter . Supported Platforms Install Using Linux Packaging Asciidoctor Home --> Docs Chat Source List (archive) @asciidoctor Copyright © 2026 Dan Allen, Sarah White, and individual Asciidoctor contributors. Except where noted, the content is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) license. The UI for this site is derived from the Antora default UI and is licensed under the MPL-2.0 license. Several icons are imported from Octicons and are licensed under the MIT license. AsciiDoc® and AsciiDoc Language™ are trademarks of the Eclipse Foundation, Inc. Thanks to our backers and contributors for helping to make this project possible. Additional thanks to: Authored in AsciiDoc . Produced by Antora and Asciidoctor .
2026-01-13T09:30:26
https://github.com/asciidoctor/asciidoctor-reducer
GitHub - asciidoctor/asciidoctor-reducer: :alembic: A tool to generate a single AsciiDoc document by expanding all the include directives reachable from the parent document. Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} asciidoctor / asciidoctor-reducer Public Notifications You must be signed in to change notification settings Fork 2 Star 46 ⚗️ A tool to generate a single AsciiDoc document by expanding all the include directives reachable from the parent document. License MIT license 46 stars 2 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 1 Pull requests 1 Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Actions Security Insights asciidoctor/asciidoctor-reducer   main Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit   History 460 Commits .github/ workflows .github/ workflows     bin bin     js js     lib lib     spec spec     tasks tasks     .deep_cover.rb .deep_cover.rb     .gitattributes .gitattributes     .gitignore .gitignore     .rspec .rspec     .rubocop.yml .rubocop.yml     .yardopts .yardopts     CHANGELOG.adoc CHANGELOG.adoc     Gemfile Gemfile     LICENSE LICENSE     README.adoc README.adoc     Rakefile Rakefile     asciidoctor-reducer.gemspec asciidoctor-reducer.gemspec     release.sh release.sh     View all files Repository files navigation README Code of conduct MIT license Asciidoctor Reducer Asciidoctor Reducer is a tool that reduces an AsciiDoc document containing include directives to a single AsciiDoc document by expanding the includes reachable from the parent document. Additionally, the tool evaluates preprocessor conditionals (unless the option to preserve them is enabled), only keeping those lines from conditions which are true. If the document does not contain any preprocessor directives, the tool returns the unmodified source. 💡 This extension is also published as an npm package named @asciidoctor/reducer for use with Asciidoctor.js, and hence, with Antora. See the README to find instructions on how to use this package. Prerequisites Asciidoctor Reducer is a Ruby application that you install using Ruby packaging. To install and run Asciidoctor Reducer, you need Ruby 2.7 or better. Run the following command to check which version of Ruby you have installed, if any: $ ruby -v If Ruby is not installed, you can install it using RVM (or, if you prefer, the package manager for your system). We generally recommend using RVM as it allows you to install gems without requiring elevated privileges or messing with system libraries. Installation Asciidoctor Reducer is published to RubyGems.org as the gem named asciidoctor-reducer . You can install the latest version of the gem using the following command: $ gem install asciidoctor-reducer Installing this gem makes the asciidoctor-reducer command available on your $PATH. You can also require the gem into the Ruby runtime to use it as a library or Asciidoctor extension. Project-scoped If you prefer to manage the application as a project-scoped dependency, you can declare the gem in the project’s Gemfile : Gemfile source 'https://rubygems.org' gem 'asciidoctor-reducer' You then install the gem using the bundle command: $ bundle --path=.bundle/gems Installing the gem this way makes the bundle exec asciidoctor-reducer command available on your $PATH. Usage Command You can run this tool using the provided command (i.e., CLI), named asciidoctor-reducer . To learn how to use the command, and to verify it’s available, run the command with the -h option: $ asciidoctor-reducer -h On the first line of the help text, you’ll see a synopsis of the command: asciidoctor-reducer [OPTION]... FILE The argument FILE is the AsciiDoc file you want to reduce. The options, represented by [OPTION]... , are optional, as the name suggestions. Thus, to use the command, pass the AsciiDoc file as the sole argument: $ asciidoctor-reducer input.adoc If you only want AsciiDoctor Reducer to process include directives, leaving preprocessor conditional directives untouched, add the --preserve-conditionals option: $ asciidoctor-reducer --preserve-conditionals input.adoc By default, the command will output the reduced AsciiDoc document to the terminal (via stdout). To write the output to a file, specify an output file using the -o option: $ asciidoctor-reducer -o output.adoc input.adoc The command can also read the input document from stdin instead of a file. To use the command in this way, pass - as the first argument: $ cat input.adoc | asciidoctor-reducer - To write the output to a file in this case, specify an output file using the -o option: $ cat input.adoc | asciidoctor-reducer -o output.adoc - API You can also use this tool from a Ruby application using the provided API. To begin, require the API for this library. require 'asciidoctor/reducer/api' Next, reduce a parent document that contains includes. doc = Asciidoctor :: Reducer . reduce_file 'sample.adoc' 📎 The previous call works without having to specify the safe mode since the default safe mode when using this API is :safe . However, if any include target points to a file in an ancestor directory of docdir , you’ll need to set the safe mode to :unsafe by passing the option safe: :unsafe . The options that the reduce_file method accepts are a superset of the Asciidoctor API options. The benefit of this return value is that you can access the reduced source as well as the parsed document that corresponds to it. Use the following call to retrieve the reduced source from the returned document. puts doc . source If you want to retrieve the source split into an array of lines, use the following call instead. puts doc . source_lines If you only want AsciiDoctor Reducer to process include directives, leaving preprocessor conditional directives untouched, set the :preserve_conditionals option: doc = Asciidoctor :: Reducer . reduce_file 'sample.adoc' , preserve_conditionals : true If you don’t need the parsed document, you can retrieve the reduced source directly by passing the String type to the :to option: puts Asciidoctor :: Reducer . reduce_file 'sample.adoc' , to : String You can write the reduced source directly to a file by passing a file path to the :to option: Asciidoctor :: Reducer . reduce_file 'sample.adoc' , to : 'sample-reduced.adoc' In Preprocessor It’s generally not safe to read the lines from the reader in an Asciidoctor preprocessor extension because it introduces side effects. However, Asciidoctor Reducer offers a workaround for that problem. You can use Asciidoctor Reducer to safely retrieve the source lines of the document (with or without resolving preprocessor directives) in order to analyze them or even modify and replace the lines on the reader. Let’s look at how we can retrieve the source lines in an Asciidoctor preprocessor. What you do with those lines is then up to you. require 'asciidoctor/reducer/api' Asciidoctor :: Extensions . register do preprocessor do process do | doc , reader | unless doc . options [ :extension_registry ] &. groups &. include? :reducer reducer_opts = { safe : doc . options [ :safe ] , attributes : doc . options [ :attributes ] . dup } reduced_doc = Asciidoctor :: Reducer . reduce_file reader . file , reducer_opts reduced_source_lines = reduced_doc . source_lines ... end reader end end end Since the extension is registered globally, it’s necessary to short-circuit it when called by reducer. Extension Instead of using the API for this library, you can use the load API provided by Asciidoctor. If you want to register the extension globally, require the library as follows: require 'asciidoctor/reducer' When you use the Asciidoctor load API, the document will automatically be reduced. puts ( Asciidoctor . load_file 'sample.adoc' , safe : :safe ) . source If you want to keep the extension scoped to the call, require the library as follows: require 'asciidoctor/reducer/extensions' Next, use the extensions API to prepare an extension registry and pass it to the Asciidoctor load API: puts ( Asciidoctor . load_file 'sample.adoc' , safe : :safe , extension_registry : Asciidoctor :: Reducer . prepare_registry ) . source Working with the extension directly is intended for low-level operations. Most of the time, you should use the API provided by this library. How it Works Asciidoctor Reducer uses a collection of Asciidoctor extensions to rebuild the AsciiDoc source as a single document. Top-level include files in the input AsciiDoc document are resolved relative to current working directory. It starts by using a preprocessor extension to enhance the PreprocessorReader class to be notified each time an include is entered (pushed) or exited (popped). When an include directive is encountered, the enhanced reader stores the resolved lines and location of the include directive, thus keeping track of where those lines should be inserted in the original source. This information is stored as a stack, where each successive entry contains lines to be inserted into a parent entry. The enhanced reader also stores the location of preprocessor conditionals and whether the lines they enclose should be kept or dropped. The reducer then uses a tree processor extension to fold the include stack into a single sequence of lines. It does so by working from the end of the stack and inserting the lines into the parent until the stack has been flattened. As it goes, it also removes lines that have been excluded by the preprocessor conditionals as well as the directive lines themselves (unless the option to preserve conditionals has been specified). If the sourcemap is enabled, it loads the document again. Finally, it returns the document. The reduced source is available on the reconstructed document via Document#source or Document#source_lines . The source header attributes (those defined in the header of the document) are available via Document#source_header_attributes . Impact on Extensions If the sourcemap is enabled, and the reducer finds lines to replace or filter, the reducer will load the document again using Asciidoctor.load . This step is necessary to synchronize the sourcemap with the reduced source. This call will cause extensions that run during the load phase to be invoked again. An extension can check for this secondary load by checking for the :reduced option in the Document#options hash. If this option is set (the value of which will be true ), then Asciidoctor is loading the reduced document. Include Mapper (Experimental) One of the challenges of reducing a document is that interdocument xrefs that rely on the includes being registered in the document catalog no longer work. That’s because when the reduced document is converted, it has no includes and thus all interdocument xrefs are colocated in the same source file. To work around this shortcoming, Asciidoctor Reducer provides a utility extension named the include mapper that will carry over the includes in the document catalog to the reduced document so they can be imported during conversion. 🔥 The include mapper is experimental and thus subject to change. To use the include mapper when using the CLI to reduce the document, require it using the -r option as follows: $ asciidoctor-reducer -r asciidoctor/reducer/include_mapper -o input-reduced.adoc input.adoc To use the include mapper when converting the reduced document, again require it using the -r option as follows: $ asciidoctor -r asciidoctor/reducer/include_mapper input-reduced.adoc To use the include mapper when using the API, first require the extension: require 'asciidoctor/reducer/include_mapper/extension' You then need to register the extension when reducing the document: Asciidoctor :: Reducer . reduce_file 'sample.adoc' , to : 'sample-reduced.adoc' , extensions : proc { next if document . options [ :reduced ] tree_processor Asciidoctor :: Reducer :: IncludeMapper } Then register it again when converting the reduced document: Asciidoctor . convert_file 'sample-reduced.adoc' , safe : :safe , extensions : proc { tree_processor Asciidoctor :: Reducer :: IncludeMapper } You can also register the extension globally: require 'asciidoctor/reducer/include_mapper' In this case, you don’t have to pass it to the API explicitly. How it Works The include mapper works by adding a magic comment to the bottom of the reduced file. Here’s an example of that comment: //# includes=chapters/chapter-a,chapters/chapter-b When a document that contains the magic comment is converted, the include mapper reads the comma-separated paths in the value and loads them into the includes table of the document catalog. Reduce files in a GitHub repository It’s well known that the AsciiDoc preview on GitHub does not support the include directive. With the help of GitHub Actions, Asciidoctor Reducer is ready-made to solve this problem. In order to set up this automated process, you need to first rename the source file to make room for the reduced file. Let’s call the source file README-source.adoc and the reduced file README.adoc . Next, create a GitHub Actions workflow file named .github/workflows/reduce-readme.yml and populate it with the following contents: .github/workflows/reduce-readme.yml name : Reduce README on : push : paths : - README-source.adoc branches : ['**'] jobs : build : runs-on : ubuntu-latest steps : - name : Checkout Repository uses : actions/checkout@v3 - name : Install Asciidoctor Reducer run : sudo gem install asciidoctor-reducer - name : Reduce README # to preserve preprocessor conditionals, add the --preserve-conditionals option run : asciidoctor-reducer -o README.adoc README-source.adoc - name : Commit and Push README uses : EndBug/add-and-commit@v9 with : add : README.adoc Now, each time you modify, commit, and push the README-source.adoc file, the GitHub Action workflow will run, reduce that file, and push the reduced file back to the repository as README.adoc . If you want to trigger the workflow on changes to other files as well, add those paths or path patterns to the value of the paths key. Development Follow the instructions below to learn how to help develop the project or test-drive the development version. Retrieve the source code Copy the GitHub repository URL and pass it to the git clone command: $ git clone https://github.com/asciidoctor/asciidoctor-reducer Next, switch to the project directory: $ cd asciidoctor-reducer Install the dependencies The dependencies needed to use Asciidoctor Reducer are defined in the Gemfile at the root of the project. You’ll use Bundler to install these dependencies. Use the bundle command to install the project dependencies under the project directory: $ bundle --path=.bundle/gems You must invoke bundle from the project’s root directory so it can locate the Gemfile . Run the tests The test suite is located in the spec directory. The tests are based on RSpec. Run all tests You can run all of the tests using Rake: $ bundle exec rake spec For more fine-grained control, you can also run the tests directly using RSpec: $ bundle exec rspec To run all tests in a single spec, point RSpec at the spec file: $ bundle exec rspec spec/reducer_spec.rb Run specific tests If you only want to run a single test, or a group of tests, you can do so by tagging the test cases, then filtering the test run using that tag. Start by adding the only tag to one or more specifications: it 'should do something new' , only : true do expect ( true ) . to be true end Next, run RSpec with the only flag enabled: $ bundle exec rspec -t only RSpec will only run the specifications that contain this flag. You can also filter tests by keyword. Let’s assume we want to run all the tests that have leveloffset in the description. Run RSpec with the example filter: $ bundle exec rspec -e leveloffset RSpec will only run the specifications that have a description containing the text leveloffset . Generate code coverage To generate a code coverage report when running tests using simplecov, set the COVERAGE environment variable as follows when running the tests: $ COVERAGE=deep bundle exec rake spec You’ll see a total coverage score, a detailed coverage report, and a link to HTML report in the output. The HTML report helps you understand which lines and branches were missed, if any. Run the development version When running the asciidoctor-reducer command from source, you must prefix the command with bundle exec : $ bundle exec asciidoctor-reducer sample.adoc To avoid having to do this, or to make the asciidoctor-reducer command available from anywhere, you need to build the development gem and install it. Authors Asciidoctor Reducer was written by Dan Allen of OpenDevise Inc. and contributed to the Asciidoctor project. Copyright and License Copyright © 2021-present Dan Allen. Use of this software is granted under the terms of the MIT License. See the LICENSE for the full license text. Trademarks AsciiDoc® and AsciiDoc Language™ are trademarks of the Eclipse Foundation, Inc. About ⚗️ A tool to generate a single AsciiDoc document by expanding all the include directives reachable from the parent document. Topics extension tool asciidoc asciidoctor includes Resources Readme License MIT license Code of conduct Code of conduct Uh oh! There was an error while loading. Please reload this page . Activity Custom properties Stars 46 stars Watchers 2 watching Forks 2 forks Report repository Releases 22 tags Uh oh! There was an error while loading. Please reload this page . Languages Ruby 96.2% JavaScript 1.9% Shell 1.9% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time.
2026-01-13T09:30:26
https://github.com/openbsd/ports/tree/master/sysutils/diffoscope
ports/sysutils/diffoscope at master · openbsd/ports · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} openbsd / ports Public Notifications You must be signed in to change notification settings Fork 132 Star 548 Code Pull requests 0 Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Pull requests Security Insights Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time.
2026-01-13T09:30:26
https://rubygems.org/gems/refrigerator
refrigerator | RubyGems.org | your community gem host ⬢ RubyGems nav#focus mousedown->nav#mouseDown click@window->nav#hide"> Navigation menu autocomplete#choose mouseover->autocomplete#highlight"> Search Gems… Releases Blog Gems Guides Sign in Sign up refrigerator 1.8.0 Refrigerator freezes all core classes. It is designed to be used in production, to make sure that none of the core classes are modified at runtime. It can also be used to check libraries to make sure that they don't make unexpected modifications/monkey patches to core classes. Gemfile: = install: = Versions: 1.8.0 December 28, 2024 (12.5 KB) 1.7.0 December 28, 2023 (12.5 KB) 1.6.0 April 18, 2023 (12.5 KB) 1.5.1 January 13, 2023 (12.5 KB) 1.5.0 January 11, 2023 (12.5 KB) Show all versions (11 total) Development Dependencies (2): minitest >= 0 minitest-global_expectations >= 0 Show all transitive dependencies Owners: Pushed by: Authors: Jeremy Evans SHA 256 checksum: = ← Previous version Total downloads 64,773 For this version 7,572 Version Released: December 28, 2024 6:25pm License: MIT Required Ruby Version: >= 1.8.7 Links: Homepage Changelog Source Code Mailing List Bug Tracker Download Review changes Badge Subscribe RSS Report abuse Reverse dependencies Status Uptime Code Data Stats Contribute About Help API Policies Support Us Security RubyGems.org is the Ruby community’s gem hosting service. Instantly publish your gems and then install them . Use the API to find out more about available gems . Become a contributor and improve the site yourself. The RubyGems.org website and service are maintained and operated by Ruby Central’s Open Source Program and the RubyGems team. It is funded by the greater Ruby community through support from sponsors, members, and infrastructure donations. If you build with Ruby and believe in our mission, you can join us in keeping RubyGems.org, RubyGems, and Bundler secure and sustainable for years to come by contributing here . Operated by Ruby Central Designed by DockYard Hosted by AWS Resolved with DNSimple Monitored by Datadog Gems served by Fastly Monitored by Honeybadger Secured by Mend.io English Nederlands 简体中文 正體中文 Português do Brasil Français Español Deutsch 日本語
2026-01-13T09:30:26
https://docs.asciidoctor.org/pdf-converter/2.0/
Asciidoctor PDF Documentation | Asciidoctor Docs Asciidoctor Docs In this project AsciiDoc Language Syntax Quick Reference Processing Asciidoctor Ruby Asciidoctor.js JavaScript AsciidoctorJ Java Extensions Add-on Converters PDF Ruby EPUB3 Ruby reveal.js Ruby, JavaScript Source Compilers Reducer Ruby, JavaScript Extended Syntax Asciidoctor Diagram Ruby Tooling Build Automation Maven Tools Java Gradle Plugin Java Asciidoclet Java Text Editors / Viewers Browser Extension IntelliJ Plugin Chat List --> Source Tweets Asciidoctor PDF What’s New Features Install Asciidoctor PDF Convert AsciiDoc to PDF Image Paths and Formats Image Scaling Background Images Import PDF Pages Inline Images Font and Image Icons Interdocument Xrefs Roles Breakable and Unbreakable Blocks Syntax Highlighting Autofit Text STEM Passthrough Content Autowidth Tables Hide Section Titles Title Page TOC PDF Outline Index Catalog Page Numbers AsciiDoc Attributes for PDF Optimize the PDF Theming Keys, Properties and Values Measurement Units Colors Variables Math Operations Quoted String Fonts Custom Fonts Prepare a Custom Font Fallback Fonts Create a CJK Theme Block Styles Block Image Styles Table Styles Text Styles Theme Images Customize the Theme Custom Roles Covers Title Page Add Running Content Configure the Page Numbers Print and Prepress Modes Apply a Theme Source Highlighting Themes Theme Keys Reference Extends Font Page Base Role Abstract Admonition Block Block Image Button Callout List and Number Caption Code Block Codespan Cover Description List Example Footnotes Heading Index Keyboard Link List Mark Menu Prose Quote Quotes Running Content Section Sidebar SVG Table Thematic Break Title Page TOC Verse Extend the PDF Converter Create a Converter Use the Converter Customization Use Cases Asciidoctor PDF 2.0 AsciiDoc Asciidoctor 2.0 Asciidoctor.js 3.0 2.2 AsciidoctorJ 3.0 2.5 Asciidoctor PDF 2.3 2.2 2.1 2.0 Asciidoctor EPUB3 2.3 Asciidoctor reveal.js 5.0 4.1 Maven Tools 3.2 Gradle Plugin Suite 5.0 4.0 Asciidoclet 2.0 1.5.6 Asciidoctor Diagram 3.0.1 Browser Extension Community Asciidoctor PDF Introduction 2.0 2.3 2.2 2.1 2.0 Edit this Page Asciidoctor PDF Documentation Asciidoctor PDF is a native PDF converter for AsciiDoc that plugs into the pdf backend. It bypasses the requirement to generate an intermediary format such as DocBook, Apache FO, or LaTeX. Instead, you can use Asciidoctor PDF to convert your documents directly from AsciiDoc to PDF. The aim of this library is to take the pain out of creating PDF documents from AsciiDoc. You’re viewing the documentation for Asciidoctor PDF 2.0. If you’re looking for the documentation for Asciidoctor PDF 1.6, refer to the README in the v1.6.x branch. Asciidoctor PDF 1.6 is no longer being developed and will reach EOL later this year. You are encouraged to migrate to Asciidoctor PDF 2 as soon as possible. Overview Asciidoctor PDF converts an AsciiDoc document directly to a PDF document. The style and layout of the PDF are controlled by a dedicated theme file. To the degree possible, Asciidoctor PDF supports all the features of AsciiDoc that are supported by Asciidoctor. It also provides additional PDF-specific features . However, there are certain limits imposed by the PDF format and the underlying PDF library this extension uses. Asciidoctor PDF uses the Prawn gem and Prawn’s extensions, such as prawn-svg and prawn-table, to generate a PDF document. Prawn is a general purpose PDF generator for Ruby that features high-level APIs for common needs like setting up the page and inserting images and low-level APIs for positioning and rendering text and graphics. What’s New Asciidoctor Home --> Docs Chat Source List (archive) @asciidoctor Copyright © 2026 Dan Allen, Sarah White, and individual Asciidoctor contributors. Except where noted, the content is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) license. The UI for this site is derived from the Antora default UI and is licensed under the MPL-2.0 license. Several icons are imported from Octicons and are licensed under the MIT license. AsciiDoc® and AsciiDoc Language™ are trademarks of the Eclipse Foundation, Inc. Thanks to our backers and contributors for helping to make this project possible. Additional thanks to: Authored in AsciiDoc . Produced by Antora and Asciidoctor .
2026-01-13T09:30:26
https://www.unicode.org/glossary/#code_point
Glossary Glossary Tech Site | Site Map | Search   Glossary of Unicode Terms   A B C D E F G H I J K L M N O P-Q R S T U V W X-Y Z This glossary is updated periodically to stay synchronized with changes to various standards maintained by the Unicode Consortium. See About Unicode Terminology for translations of various terms. There is also an FAQ section on the website. A Abjad . A writing system in which only consonants are indicated. The term “abjad” is derived from the first four letters of the traditional order of the Arabic script: alef, beh, jeem, dal . (See Section 6.1, Writing Systems .) Abstract Character . A unit of information used for the organization, control, or representation of textual data. (See definition D7 in Section 3.4, Characters and Encoding .) Abstract Character Sequence . An ordered sequence of one or more abstract characters. (See definition D8 in Section 3.4, Characters and Encoding .) Abugida . A writing system in which consonants are indicated by the base letters that have an inherent vowel, and in which other vowels are indicated by additional distinguishing marks of some kind modifying the base letter. The term “abugida” is derived from the first four letters of the Ethiopic script in the Semitic order: alf, bet, gaml, dant . (See Section 6.1, Writing Systems .) Accent Mark . A mark placed above, below, or to the side of a character to alter its phonetic value. (See also diacritic .) Acrophonic . Denoting letters or numbers by the first letter of their name. For example, the Greek acrophonic numerals are variant forms of such initial letters. Aksara . (1) In Sanskrit grammar, the term for “letter” in general, as opposed to consonant ( vyanjana ) or vowel ( svara ). Derived from the first and last letters of the traditional ordering of Sanskrit letters—“a” and “ksha”. (2) More generally, in Indic writing systems, aksara refers to an orthographic syllable . Algorithm . A term used in a broad sense in the Unicode Standard, to mean the logical description of a process used to achieve a specified result. This does not require the actual procedure described in the algorithm to be followed; any implementation is conformant as long as the results are the same. Alphabet . A writing system in which both consonants and vowels are indicated. The term “alphabet” is derived from the first two letters of the Greek script: alpha, beta . (See Section 6.1, Writing Systems .) Alphabetic Property . Informative property of the primary units of alphabets and/or syllabaries. (See Section 4.10, Letters, Alphabetic, and Ideographic .) Alphabetic Sorting . (See collation .) AMTRA . Acronym for Arabic Mark Transient Reordering Algorithm . (See Unicode Standard Annex #53, “Unicode Arabic Mark Rendering.” ) Annotation . The association of secondary textual content with a point or range of the primary text. (The value of a particular annotation is considered to be a part of the “content” of the text. Typical examples include glossing, citations, exemplification, Japanese yomi, and so on.) ANSI .  (1) The American National Standards Institute. (2) The Microsoft collective name for all Windows code pages. Sometimes used specifically for code page 1252, which is a superset of ISO/IEC 8859-1. Apparatus Criticus . Collection of conventions used by editors to annotate and comment on text. Arabic Digits . The term "Arabic digits" may mean either the digits in the Arabic script (see Arabic-Indic digits ) or the ordinary ASCII digits in contrast to Roman numerals (see European digits ). When the term "Arabic digits" is used in Unicode specifications, it means Arabic-Indic digits. See Terminology for Digits for additional information on terminology related to digits. Arabic-Indic Digits . Forms of decimal digits used in most parts of the Arabic world (for instance, U+0660, U+0661, U+0662, U+0663). Although European digits (1, 2, 3,…) derive historically from these forms, they are visually distinct and are coded separately. (Arabic-Indic digits are sometimes called Indic numerals; however, this nomenclature leads to confusion with the digits currently used with the scripts of India.) Variant forms of Arabic-Indic digits used chiefly in Iran and Pakistan are referred to as Eastern Arabic-Indic digits . (See Section 9.2, Arabic .) See Terminology for Digits for additional information on terminology related to digits. ASCII . (1) The American Standard Code for Information Interchange, a 7-bit coded character set for information interchange. It is the U.S. national variant of ISO/IEC 646 and is formally the U.S. standard ANSI X3.4. It was proposed by ANSI in 1963 and finalized in 1968. (2) The set of 128 Unicode characters from U+0000 to U+007F, including control codes as well as graphic characters. (3) ASCII has been incorrectly used to refer to various 8-bit character encodings that include ASCII characters in the first 128 code points. ASCII digits . The digit characters U+0030 to U+0039. Also known as European digits . See Terminology for Digits for additional information on terminology related to digits. Assigned Character .  A code point that is assigned to an abstract character. This refers to graphic, format, control, and private-use characters that have been encoded in the Unicode Standard. (See Section 2.4, Code Points and Characters .) Assigned Code Point .  (See designated code point .) Atomic Character .  A character that is not decomposable. (See decomposable character .) B Base Character . Any graphic character except for those with the General Category of Combining Mark (M). (See definition D51 in Section 3.6, Combination .) In a combining character sequence, the base character is the initial character, which the combining marks are applied to. Basic Multilingual Plane . Plane 0, abbreviated as BMP. Bicameral . A script that distinguishes between two cases. (See case .) Most often used in the context of Latin-based alphabets of Europe and elsewhere in the world. Bidi . Abbreviation of bidirectional, in reference to mixed left-to-right and right-to-left text. Bidirectional Display . The process or result of mixing left-to-right text and right-to-left text in a single line. (See Unicode Standard Annex #9, “Unicode Bidirectional Algorithm.” ) Big-endian . A computer architecture that stores multiple-byte numerical values with the most significant byte (MSB) values first. Binary Files . Files containing nontextual information. Block . A grouping of characters within the Unicode encoding space used for organizing code charts. Each block is a uniquely named, continuous, non-overlapping range of code points, containing a multiple of 16 code points, and starting at a location that is a multiple of 16. A block may contain unassigned code points, which are reserved. BMP . Acronym for Basic Multilingual Plane . BMP Character . A Unicode encoded character having a BMP code point. (See supplementary character .) BMP Code Point . A Unicode code point between U+0000 and U+FFFF. (See supplementary code point .) BNF . Acronym for Backus-Naur Form , a formal meta-syntax for describing context-free syntaxes. (For details, see Appendix A, Notational Conventions .) BOCU-1 . Acronym for Binary Ordered Compression for Unicode. A Unicode compression scheme that is MIME-compatible (directly usable for e-mail) and preserves binary order, which is useful for databases and sorted lists. BOM .  Acronym for byte order mark . Bopomofo . An alphabetic script used primarily in the Republic of China (Taiwan) to write the sounds of Mandarin Chinese and some other dialects. Each symbol corresponds to either the syllable-initial or syllable-final sounds; it is therefore a subsyllabic script in its primary usage. The name is derived from the names of its first four elements. More properly known as zhuyin zimu or zhuyin fuhao in Mandarin Chinese. Boustrophedon . A pattern of writing seen in some ancient manuscripts and inscriptions, where alternate lines of text are laid out in opposite directions, and where right-to-left lines generally use glyphs mirrored from their left-to-right forms. Literally, “as the ox turns,” referring to the plowing of a field. Braille . A writing system using a series of raised dots to be read with the fingers by people who are blind or whose eyesight is not sufficient for reading printed material. (See Section 21.1, Braille .) Braille Pattern . One of the 64 (for six-dot Braille) or 256 (for eight-dot Braille) possible tangible dot combinations. Byte . (1) The minimal unit of addressable storage for a particular computer architecture. (2) An octet. Note that many early computer architectures used bytes larger than 8 bits in size, but the industry has now standardized almost uniformly on 8-bit bytes. The Unicode Standard follows the current industry practice in equating the term byte with octet and using the more familiar term byte in all contexts. (See octet .) Byte Order Mark . The Unicode character U+FEFF when used to indicate the byte order of a text. (See Section 2.13, Special Characters and Noncharacters , and Section 23.8, Specials .) Byte Serialization . The order of a series of bytes determined by a computer architecture. Byte-Swapped . Reversal of the order of a sequence of bytes. C Camelcase . A casing convention for compound terms or identifiers, in which the letters are mostly lowercased, but component words or abbreviations may be capitalized. For example, "ThreeWordTerm" or "threeWordTerm". Canonical . (1) Conforming to the general rules for encoding—that is, not compressed, compacted, or in any other form specified by a higher protocol. (2) Characteristic of a normative mapping and form of equivalence specified in Chapter 3, Conformance . Canonical Composition . A step in the algorithm for Unicode Normalization Forms, during which decomposed sequences are replaced by primary composites, where possible. (See definition D115 in Section 3.11, Normalization Forms .) Canonical Decomposable Character . A character that is not identical to its canonical decomposition. (See definition D69 in Section 3.7, Decomposition .) Canonical Decomposition . Mapping to an inherently equivalent sequence—for example, mapping ä to a +  combining umlaut. (For a full, formal definition, see definition D68 in Section 3.7, Decomposition .) Canonical Equivalence . The relation between two character sequences whose full canonical decompositions are identical. (See definition D70 in Section 3.7, Decomposition .) Canonical Equivalent . Two character sequences are said to be canonical equivalents if their full canonical decompositions are identical. (See definition D70 in Section 3.7, Decomposition .) Canonical Ordering . The order of a combining character sequence that results from the application of the Canonical Ordering Algorithm, a step in the process of normalization of strings. See definition D109 in Section 3.11, Normalization Forms . Cantillation Mark . A mark that is used to indicate how a text is to be chanted or sung. Capital Letter . Synonym for uppercase letter . (See case .) Case . (1) Feature of certain alphabets where the letters have two distinct forms. These variants, which may differ markedly in shape and size, are called the uppercase letter (also known as capital or majuscule ) and the lowercase letter (also known as small or minuscule ). (2) Normative property of characters, consisting of uppercase, lowercase, and titlecase (Lu, Ll, and Lt). (See Section 4.2, Case .) Case Folding . The mapping of strings to a particular case form, to facilitate searching and sorting of text. Case foldings may be simple, when the case mappings are required not to change the length of the strings to compare, or full, when the case mappings may change the length of the strings to compare. (See Section 3.13.3, Default Case Folding .) Case Mapping . The association of the uppercase, lowercase, and titlecase forms of a letter. (See Section 5.18, Case Mappings .) Case-Ignorable . A character C is defined to be case-ignorable if C has the value MidLetter (ML), MidNumLet (MB), or Single_Quote (SQ) for the Word_Break property or its General_Category is one of Nonspacing_Mark (Mn), Enclosing_Mark (Me), Format (Cf), Modifier_Letter (Lm), or Modifier_Symbol (Sk). (See definition D136 in Section 3.13, Default Case Algorithms .) Case-Ignorable Sequence . A sequence of zero or more case-ignorable characters. (See definition D137 in Section 3.13, Default Case Algorithms .) CCC . Short name for the Canonical_Combining_Class property, usually lowercased: ccc. CCS . (1) Acronym for coded character set . (2) Also used as an acronym for combining character sequence . Cedilla . A mark originally placed beneath the letter c in French, Portuguese, and Spanish to indicate that the letter is to be pronounced as an s, as in façade . Obsolete Spanish diminutive of ceda , the letter z . CEF . Acronym for character encoding form . CES . Acronym for character encoding scheme . Character . (1) The smallest component of written language that has semantic value; refers to the abstract meaning and/or shape, rather than a specific shape (see also glyph ), though in code tables some form of visual representation is essential for the reader’s understanding. (2) Synonym for abstract character . (3) The basic unit of encoding for the Unicode character encoding. (4) The English name for the ideographic written elements of Chinese origin. [See ideograph (2).] Character Block . (See block .) Character Class . A set of characters sharing a particular set of properties. Character Encoding Form . Mapping from a character set definition to the actual code units used to represent the data. Character Encoding Scheme . A character encoding form plus byte serialization. There are seven character encoding schemes in Unicode: UTF-8, UTF-16, UTF-16BE, UTF-16LE, UTF-32, UTF-32BE, and UTF-32LE. Character Entity . Expression of the form & for "&" or   for the no-break space. These are found in markup language files like HTML or XML. There are also numerically defined character entities. (See also character escape .) Character Escape . A numerical expression of the form \uXXXX, \xXXXX or &#xXXXX; where X is a hex digit, or &#dddd; where d is a decimal digit. These are found in programming source code or markup language files (such as HTML or XML). Character Name . A unique string used to identify each abstract character encoded in the standard. (See definition D4 in Section 3.3, Semantics .) Character Name Alias . An additional unique string identifier, other than the character name, associated with an encoded character in the standard. (See definition D5 in Section 3.3, Semantics .) Character Properties . A set of property names and property values associated with individual characters. (See Chapter 4, Character Properties .) Character Repertoire . The collection of characters included in a character set. Character Sequence . Synonym for abstract character sequence . Character Set . A collection of elements used to represent textual information. Charset . (See coded character set .) Chillu . Abbreviation for chilaaksharam (singular) ( cillakṣaram ). Refers to any of a set of sonorant consonants in Malayalam, when appearing in syllable-final position with no inherent vowel. Choseong . A sequence of one or more leading consonants in Korean. Chu Hán . The name for Han characters used in Vietnam; derived from hànzì . Chu Nôm . A demotic script of Vietnam developed from components of Han characters. Its creators used methods similar to those used by the Chinese in creating Han characters. CJK . Acronym for Chinese, Japanese, and Korean. A variant, CJKV , means Chinese, Japanese, Korean, and Vietnamese. CJK Unified Ideograph . A Han character that has undergone the process of Han unification (conducted primarily by the Ideographic Research Group) and been encoded as a single ideograph with one or more clearly identified CJK source mappings. CJK unified ideographs have no decomposition mappings, and the set of them in the Unicode Standard is normatively specified by the Unified_Ideograph property. CLDR . (See Unicode Common Locale Data Repository .) Coded Character . (See encoded character .) Coded Character Representation . Synonym for coded character sequence . Coded Character Sequence . An ordered sequence of one or more code points. Normally, this consists of a sequence of encoded characters, but it may also include noncharacters or reserved code points. (See definition D12 in Section 3.4, Characters and Encoding .) Coded Character Set . A character set in which each character is assigned a numeric code point. Frequently abbreviated as character set, charset , or code set ; the acronym CCS is also used. Code Page . A coded character set, often referring to a coded character set used by a personal computer—for example, PC code page 437, the default coded character set used by the U.S. English version of the DOS operating system. Code Point . (1) Any value in the Unicode codespace; that is, the range of integers from 0 to 10FFFF 16 . (See definition D10 in Section 3.4, Characters and Encoding .) Not all code points are assigned to encoded characters. See code point type . (2) A value, or position, for a character, in any coded character set. Code Point Type . Any of the seven fundamental classes of code points in the standard: Graphic, Format, Control, Private-Use, Surrogate, Noncharacter, Reserved. (See definition D10a in Section 3.4, Characters and Encoding .) Code Position . Synonym for code point . Used in ISO character encoding standards. Code Set . (See coded character set .) Codespace . (1) A range of numerical values available for encoding characters. (2) For the Unicode Standard, a range of integers from 0 to 10FFFF 16 . (See definition D9 in Section 3.4, Characters and Encoding .) Code Unit . The minimal bit combination that can represent a unit of encoded text for processing or interchange. The Unicode Standard uses 8-bit code units in the UTF-8 encoding form, 16-bit code units in the UTF-16 encoding form, and 32-bit code units in the UTF-32 encoding form. (See definition D77 in Section 3.9, Unicode Encoding Forms .) Code Value . Obsolete synonym for code unit . Codomain . For a mapping, the codomain is the set of code points or sequences that it maps to, while the domain is the set of values that are mapped. For example, a canonical decomposition is a mapping from a set of code points to a set of sequences; the codomain is the set of canonical equivalent mappings. (See also domain .) Collation . The process of ordering units of textual information. Collation is usually specific to a particular language. Also known as alphabetizing or alphabetic sorting . Unicode Technical Standard #10, “Unicode Collation Algorithm," defines a complete, unambiguous, specified ordering for all characters in the Unicode Standard. Combining Character . A character with the General Category of Combining Mark (M). (See definition D52 in Section 3.6, Combination .) (See also nonspacing mark .) Combining Character Sequence . A maximal character sequence consisting of either a base character followed by a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner ; or a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner . (See definition D56 in Section 3.6, Combination .) Combining Class . A numeric value in the range 0..254 given to each Unicode code point, formally defined as the property Canonical_Combining_Class. (See definition D104 in Section 3.11, Normalization Forms .) Combining Mark . A commonly used synonym for combining character . Compatibility . (1) Consistency with existing practice or preexisting character encoding standards. (2) Characteristic of a normative mapping and form of equivalence specified in Section 3.7, Decomposition . Compatibility Character . A character that would not have been encoded except for compatibility and round-trip convertibility with other standards. (See Section 2.3, Compatibility Characters .) Compatibility Composite Character . Synonym for compatibility decomposable character . Compatibility Decomposable Character . A character whose compatibility decomposition is not identical to its canonical decomposition. (See definition D66 in Section 3.7, Decomposition .) Compatibility Decomposition . Mapping to a roughly equivalent sequence that may differ in style. (For a full, formal definition, see definition D65 in Section 3.7, Decomposition .) Compatibility Equivalence . The relation between two character sequences whose full compatibility decompositions are identical. (See definition D67 in Section 3.7, Decomposition .) Compatibility Equivalent . Two character sequences are said to be compatibility equivalents if their full compatibility decompositions are identical. (See definition D67 in Section 3.7, Decomposition .) Compatibility Ideograph . A Han character encoded for compatibility with some East Asian character encoding, but which is not encoded as a CJK unified ideograph . Instead, each compatibility ideograph has a canonical decomposition mapping to a particular CJK unified ideograph. Compatibility Precomposed Character . Synonym for compatibility decomposable character . Compatibility Variant . A character that generally can be remapped to another character without loss of information other than formatting. Composite Character . (See decomposable character .) Composite Character Sequence . (See combining character sequence .) Composition Exclusion . A Canonical Decomposable Character which has the property value Composition_Exclusion=True. (Used in the definition of Unicode Normalization Forms.) (See definition D112 in Section 3.11, Normalization Forms .) Conformance . Adherence to a specified set of criteria for use of a standard. (See Chapter 3, Conformance .) Confusable . Of similar or identical appearance. When referring to characters in strings, the appearance of confusable characters can make different identifiers hard or impossible to distinguish. (See also Unicode Technical Standard #39, "Unicode Security Mechanisms" .) Conjunct Form . A ligated form representing a consonant conjunct . Consonant Cluster .  A sequence of two or more consonantal sounds. Depending on the writing system, a consonant cluster may be represented by a single character or by a sequence of characters. (Contrast digraph .) Consonant Conjunct . A sequence of two or more adjacent consonantal letterforms, consisting of a sequence of one or more dead consonants followed by a normal, live consonant letter. A consonant conjunct may be ligated into a single conjunct form, or it may be represented by graphically separable parts, such as subscripted forms of the consonant letters. Consonant conjuncts are associated with the Brahmi family of Indic scripts. (See Section 12.1, Devanagari .) Contextual Variant . A text element can have a presentation form that depends on the textual context in which it is rendered. This presentation form is known as a contextual variant . Contributory Property . A simple property defined merely to make the statement of a rule defining a derived property more compact or general. (See definition D35a in Section 3.5, Properties .) Control Codes . The 65 characters in the ranges U+0000..U+001F and U+007F..U+009F. Also known as control characters . Core Specification . The central part of the Unicode Standard–the portion which up until Version 5.0 was published as a separate book. Starting with Version 5.2, this part of the standard has been published online only, rather than as a book. The core specification consists of the general introduction and framework for the standard, the formal conformance requirements, many implementation guidelines, and extensive chapters providing information about all the encoded characters, organized by script or by significant classes of characters. Formally, a version of the Unicode Standard is defined by an edition of this core specification, together with the Code Charts , Unicode Standard Annexes , and the Unicode Character Database Cursive . Writing where the letters of a word are connected. D Dasia . Greek term for rough breathing mark, used in polytonic Greek character names. DBCS . Acronym for double-byte character set . Dead Consonant . An Indic consonant character followed by a virama character. This sequence indicates that the consonant has lost its inherent vowel. (See Section 12.1, Devanagari .) Decimal Digits . Digits that can be used to form decimal-radix numbers. Decomposable Character . A character that is equivalent to a sequence of one or more other characters, according to the decomposition mappings found in the Unicode Character Database, and those described in Section 3.12, Conjoining Jamo Behavior . It may also be known as a precomposed character or a composite character. (See definition D63 in Section 3.7, Decomposition .) Decomposition . (1) The process of separating or analyzing a text element into component units. These component units may not have any functional status, but may be simply formal units—that is, abstract shapes. (2) A sequence of one or more characters that is equivalent to a decomposable character. (See definition D64 in Section 3.7, Decomposition .) Decomposition Mapping . A mapping from a character to a sequence of one or more characters that is a canonical or compatibility equivalent and that is listed in the character names list or described in Section 3.12, Conjoining Jamo Behavior . (See definition D62 in Section 3.7, Decomposition .) Default Ignorable . Default ignorable code points are those that should be ignored by default in rendering unless explicitly supported. They have no visible glyph or advance width in and of themselves, although they may affect the display, positioning, or adornment of adjacent or surrounding characters. (See Section 5.21, Ignoring Characters in Processing .) Defective Combining Character Sequence . A combining character sequence that does not start with a base character. (See definition D57 in Section 3.6, Combination .) Demotic Script . (1) A script or a form of a script used to write the vernacular or common speech of some language community. (2) A simplified form of the ancient Egyptian hieratic writing. Dependent Vowel . A symbol or sign that represents a vowel and that is attached or combined with another symbol, usually one that represents a consonant. For example, in writing systems based on Arabic, Hebrew, and Indic scripts, vowels are normally represented as dependent vowel signs. Deprecated . Of a coded character or a character property, strongly discouraged from use. (Not the same as obsolete .) Deprecated Character . A coded character whose use is strongly discouraged. Such characters are retained in the standard, indefinitely but should not be used. (See definition D13 in Section 3.4, Characters and Encoding .) Designated Code Point . Any code point that has either been assigned to an abstract character ( assigned characters ) or that has otherwise been given a normative function by the standard (surrogate code points and noncharacters). This definition excludes reserved code points. Also known as assigned code point . (See Section 2.4 Code Points and Characters .) Deterministic Comparison . A string comparison in which strings that do not have identical contents will compare as unequal. There are two main varieties, depending on the sense of "identical:" (a) binary equality, or (b) canonical equivalence. This is a property of the comparison mechanism, and not of the sorting algorithm. Also known as stable (or semi-stable ) comparison . Deterministic Sort . A sort algorithm which returns exactly the same output each time it is applied to the same input. This is a property of the sorting algorithm, and not of the comparison mechanism. For example, a randomized Quicksort (which picks a random element as the pivot element, for optimal performance) is not deterministic. Multiprocessor implementations of a sort algorithm may also not be deterministic. Diacritic . (1) A mark applied or attached to a symbol to create a new symbol that represents a modified or new value. (2) A mark applied to a symbol irrespective of whether it changes the value of that symbol. In the latter case, the diacritic usually represents an independent value (for example, an accent, tone, or some other linguistic information). Also called diacritical mark or diacritical . (See also combining character and nonspacing mark .) Diaeresis . Two horizontal dots over a letter, as in naïve . The diaeresis is not distinguished from the umlaut in the Unicode character encoding. (See umlaut .) Dialytika . Greek term for diaeresis or trema , used in Greek character names. Digits . (See Arabic digits , European digits , and Indic digits .) See Terminology for Digits for additional information on terminology related to digits. Digraph . A pair of signs or symbols (two graphs), which together represent a single sound or a single linguistic unit. The English writing system employs many digraphs (for example, th, ch, sh, qu, and so on). The same two symbols may not always be interpreted as a digraph (for example, ca th ode versus ca th ouse ). When three signs are so combined, they are called a trigraph . More than three are usually called an n-graph . Dingbats . Typographical symbols and ornaments. Diphthong . A pair of vowels that are considered a single vowel for the purpose of phonemic distinction. One of the two vowels is more prominent than the other. In writing systems, diphthongs are sometimes written with one symbol and sometimes with more than one symbol (for example, with a digraph ). Direction . (See paragraph direction .) Directionality Property . A property of every graphic character that determines its horizontal ordering as specified in Unicode Standard Annex #9, “Unicode Bidirectional Algorithm.” (See Section 4.4, Directionality .) Display Cell . A rectangular region on a display device within which one or more glyphs are imaged. Display Order . The order of glyphs presented in text rendering. (See logical order and Section 2.2, Unicode Design Principles .) Domain . 1. For a mapping, the domain is the set of code points or sequences that are mapped, while the codomain is the set of values they are mapped to. For example, a canonical decomposition is a mapping from a set of code points to a set of sequences; the domain is the entire Unicode codespace. (See also codomain .) 2. A realm of administrative autonomy, authority or control in the Internet, identified by a domain name. Domain Name . The part of a network address that identifies it as belonging to a particular domain. (Oxford Languages definition.) A domain name is a string of characters. The rules for how Unicode characters can be used in domain names is the concern of IDNA and of UTS #46, Unicode IDNA Compatibility Processing . Double-Byte Character Set . One of a number of character sets defined for representing Chinese, Japanese, or Korean text (for example, JIS X 0208-1990). These character sets are often encoded in such a way as to allow double-byte character encodings to be mixed with single-byte character encodings. Abbreviated DBCS . (See also multibyte character set .) Ductility . The ability of a cursive font to stretch or compress the connective baseline to effect text justification. Dynamic Composition . Creation of composite forms such as accented letters or Hangul syllables from a sequence of characters. E EBCDIC . Acronym for Extended Binary-Coded Decimal Interchange Code. A group of coded character sets used on mainframes that consist of 8-bit coded characters. EBCDIC coded character sets reserve the first 64 code points (x00 to x3F) for control codes, and reserve the range x41 to xFE for graphic characters. The English alphabetic characters are in discontinuous segments with uppercase at xC1 to xC9, xD1 to xD9, xE2 to xE9, and lowercase at x81 to x89, x91 to x99, xA2 to xA9. ECCS . Acronym for extended combining character sequence . EGC . Acronym for extended grapheme cluster . Embedding . A concept relevant to bidirectional behavior. (See Unicode Standard Annex #9, “Unicode Bidirectional Algorithm,” for detailed terminology and definitions.) Emoji . (1) The Japanese word for "pictograph." (2) Certain pictographic and other symbols encoded in the Unicode Standard that are commonly given a colorful or playful presentation when displayed on devices. Many of the emoji in Unicode were originally encoded for compatibility with Japanese telephone symbol sets. (3) Colorful or playful symbols which are not encoded as characters but which are widely implemented as graphics. (See pictograph .) Emoticon . A symbol added to text to express emotional affect or reaction—for example, sadness, happiness, joking intent, sarcasm, and so forth. Emoticons are often expressed by a conventional kind of "ASCII art," using sequences of punctuation and other symbols to portray likenesses of facial expressions. In Western contexts these are often turned sideways, as :-) to express a happy face; in East Asian contexts other conventions often portray a facial expression without turning, as ^-^. Rendering systems often recognize conventional emoticon sequences and display them as colorful or even animated glyphs in text. There is also a set of dedicated pictographic symbols—mostly representing different facial expressions—encoded as characters in the Unicode Standard. (See pictograph .) Encapsulated Text . (1) Plain text surrounded by formatting information. (2) Text recoded to pass through narrow transmission channels or to match communication protocols. Enclosing Mark . A nonspacing mark with the General Category of Enclosing Mark (Me). (See definition D54 in Section 3.6, Combination .) Enclosing marks are a subclass of nonspacing marks that surround a base character, rather than merely being placed over, under, or through it. Encoded Character . An association (or mapping) between an abstract character and a code point . (See definition D11 in Section 3.4, Characters and Encoding .) By itself, an abstract character has no numerical value, but the process of “encoding a character” associates a particular code point with a particular abstract character, thereby resulting in an “encoded character.” Encoding Form . (See character encoding form .) Encoding Scheme . (See character encoding scheme .) Equivalence . In the context of text processing, the process or result of establishing whether two text elements are identical in some respect. Equivalent Sequence . (See canonical equivalent .) Escape Sequence . A sequence of bytes that is used for code extension. The first byte in the sequence is escape (hex 1B). EUDC . Acronym for end-user defined character. A character defined by an end user, using a private-use code point, to represent a character missing in a particular character encoding. These are common in East Asian implementations. European Digits . Forms of decimal digits first used in Europe and now used worldwide. Historically, these digits were derived from the Arabic digits; they are sometimes called “Arabic numerals,” but this nomenclature leads to confusion with the real Arabic-Indic digits . Also called "Western digits" and "Latin digits." See Terminology for Digits for additional information on terminology related to digits. Extended Base . Any base character, or any standard Korean syllable block. (See definition D51a in Section 3.6, Combination .) Extended Combining Character Sequence . A maximal character sequence consisting of either an extended base followed by a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner ; or a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner . Abbreviated as ECCS . (See definition D56a in Section 3.6, Combination .) Extended Grapheme Cluster . The text between extended grapheme cluster boundaries as specified by Unicode Standard Annex #29, "Unicode Text Segmentation." Abbreviated as EGC . (See definition D61 in Section 3.6, Combination .) F Fancy Text . (See rich text .) Fixed Position Class . A subset of the range of numeric values for combining classes—specifically, any value in the range 10..199. (See definition D105 in Section 3.11, Normalization Forms .) Floating ( diacritic, accent, mark ). (See nonspacing mark .) Folding . An operation that maps similar characters to a common target, such as uppercasing or lowercasing a string. Folding operations are most often used to temporarily ignore certain distinctions between characters. Font . A collection of glyphs used for the visual depiction of character data. A font is often associated with a set of parameters (for example, size, posture, weight, and serifness), which, when set to particular values, generate a collection of imagable glyphs. Format Character . A character that is inherently invisible but that has an effect on the surrounding characters. Format Code . Synonym for format character . Format Control Character . Synonym for format character . Formatted Text . (See rich text .) FSS-UTF . Acronym for File System Safe UCS Transformation Format , published by the X/Open Company Ltd., and intended for the UNIX environment. Now known as UTF-8 . Full Composition Exclusion . A Canonical Decomposable Character which has the property value Full_Composition_Exclusion=True. (Used in the definition of Unicode Normalization Forms.) (See definition D113 in Section 3.11, Normalization Forms .) Fullwidth . Characters of East Asian character sets whose glyph image extends across the entire character display cell. In legacy character sets, fullwidth characters are normally encoded in two or three bytes. The Japanese term for fullwidth characters is zenkaku . FVS . Acronym for Mongolian Free Variation Selector . G G11n . (See globalization .) GC . 1. Acronym for grapheme cluster . 2. Short name for the General_Category property, usually lowercased: gc. GCGID . Acronym for Graphic Character Global Identifier. These are listed in the IBM document Character Data Representation Architecture, Level 1, Registry SC09-1391 . General Category . Partition of the characters into major classes such as letters, punctuation, and symbols, and further subclasses for each of the major classes. (See Section 4.5, General Category .) Generative . Synonym for productive . Globalization . (1) The overall process for internationalization and localization of  software products. (2) a synonym for internationalization. Also known by the abbreviation "g11n". Note that the meaning of "globalization" which is relevant to software products should be distinguished from the more widespread use of "globalization" in the context of economics. (See internationalization , localization .) Glyph . (1) An abstract form that represents one or more glyph images. (2) A synonym for glyph image . In displaying Unicode character data, one or more glyphs may be selected to depict a particular character. These glyphs are selected by a rendering engine during composition and layout processing. (See also character .) Glyph Code . A numeric code that refers to a glyph. Usually, the glyphs contained in a font are referenced by their glyph code. Glyph codes may be local to a particular font; that is, a different font containing the same glyphs may use different codes. Glyph Identifier . Similar to a glyph code, a glyph identifier is a label used to refer to a glyph within a font. A font may employ both local and global glyph identifiers. Glyph Image . The actual, concrete image of a glyph representation having been rasterized or otherwise imaged onto some display surface. Glyph Metrics . A collection of properties that specify the relative size and positioning along with other features of a glyph. Grapheme . (1) A minimally distinctive unit of writing in the context of a particular writing system. For example, ‹b› and ‹d› are distinct graphemes in English writing systems because there exist distinct words like big and dig. Conversely, a lowercase italiform letter a and a lowercase Roman letter a are not distinct graphemes because no word is distinguished on the basis of these two different forms. (2) What a user thinks of as a character. Grapheme Base . A character with the property Grapheme_Base, or any standard Korean syllable block. (See definition D58 in Section 3.6, Combination .) Grapheme Cluster . The text between grapheme cluster boundaries as specified by Unicode Standard Annex #29, "Unicode Text Segmentation." (See definition D60 in Section 3.6, Combination .) A grapheme cluster represents a horizontally segmentable unit of text, consisting of some grapheme base (which may consist of a Korean syllable) together with any number of nonspacing marks applied to it. Grapheme Extender . A character with the property Grapheme_Extend. (See definition D59 in Section 3.6, Combination .) Grapheme extender characters consist of all nonspacing marks, zero width joiner , zero width non-joiner , and a small number of spacing marks. Graphic Character . A character with the General Category of Letter (L), Combining Mark (M), Number (N), Punctuation (P), Symbol (S), or Space Separator (Zs). (See definition D50 in Section 3.6. Combination .) Guillemet . Punctuation marks resembling small less-than and greater-than signs, used as quotation marks in French and other languages. (See “Language-Based Usage of Quotation Marks” in Section 6.2, General Punctuation .) H Halant . A preferred Hindi synonym for a virama . It literally means killer , referring to its function of killing the inherent vowel of a consonant letter. (See virama .) Half-Consonant Form . In the Devanagari script and certain other scripts of the Brahmi family of Indic scripts, a dead consonant may be depicted in the so-called half-form. This form is composed of the distinctive part of a consonant letter symbol without its vertical stem. It may be used to create conjunct forms that follow a horizontal layout pattern. Also known as half-form . Halfwidth . Characters of East Asian character sets whose glyph image occupies half of the character display cell. In legacy character sets, halfwidth characters are normally encoded in a single byte. The Japanese term for halfwidth characters is hankaku . Han Characters . Ideographic characters of Chinese origin. (See Section 18.1, Han .) Hangul . The name of the script used to write the Korean language. Hangul Syllable . (1) Any of the 11,172 encoded characters of the Hangul Syllables character block, U+AC00..U+D7A3. Also called a precomposed Hangul syllable to clearly distinguish it from a Korean syllable block. (2) Loosely speaking, a Korean syllable block . Hanja . The Korean name for Han characters; derived from the Chinese word hànzì . Hankaku . (See halfwidth .) Han Unification . The process of identifying Han characters that are in common among the writing systems of Chinese, Japanese, Korean, and Vietnamese. Hànzì . The Mandarin Chinese name for Han characters. Harakat . Marks used in the Arabic script to indicate vocalization with short vowels. A subtype of tashkil . Hasant . The Bangla name for halant . (See virama .) Higher-Level Protocol . Any agreement on the interpretation of Unicode characters that extends beyond the scope of this standard. Note that such an agreement need not be formally announced in data; it may be implicit in the context. (See definition D16 in Section 3.4, Characters and Encoding .) High-Surrogate Code Point . A Unicode code point in the range U+D800 to U+DBFF. (See definition D71 in Section 3.8, Surrogates .) High-Surrogate Code Unit . A 16-bit code unit in the range D800 16 to DBFF 16 , used in UTF-16 as the leading code unit of a surrogate pair. Also known as a leading surrogate . (See definition D72 in Section 3.8, Surrogates .) Hiragana (ひらがな). One of two standard syllabaries associated with the Japanese writing system. Hiragana syllables are typically used in the representation of native Japanese words and grammatical particles, or are used as a fallback representation of other words when the corresponding kanji is either difficult to remember or obscure. (See also katakana .) Horizontal Extension . This refers to the process of adding a new IRG source reference to an existing CJK unified ideograph, along with a new representative glyph for the code charts that shows how the character appears in its source. It does not involve encoding a new character, but rather just adding the source reference and new glyph to the code charts. HTML . HyperText Markup Language. A text description language related to SGML; it mixes text format markup with plain text content to describe formatted text. HTML is ubiquitous as the source language for Web pages on the Internet. Starting with HTML 4.0, the Unicode Standard functions as the reference character set for HTML content. (See also SGML .) I I18n . (See internationalization .) IANA . Acronym for Internet Assigned Numbers Authority. ICU . Acronym for International Components for Unicode, an Open Source set of C/C++ and Java libraries for Unicode and software internationalization support. For information, see https://icu.unicode.org/ Ideograph (or ideogram ). (1) Any symbol that primarily denotes an idea or concept in contrast to a sound or pronunciation—for example, ♻, which denotes the concept of recycling by a series of bent arrows. (2) A generic term for the unit of writing of a logosyllabic writing system. In this sense, ideograph (or ideogram) is not systematically distinguished from logograph (or logogram). (3) A term commonly used to refer specifically to Han characters, equivalent to the Chinese, Japanese, or Korean terms also sometimes used: hànzì , kanji , or hanja . (See logograph , pictograph , sinogram .) Ideographic Property . Informative property of characters that are ideographs. (See Section 4.10, Letters, Alphabetic, and Ideographic .) Ideographic Variation Sequence . A variation sequence registered in the Ideographic Variation Database . The registration of ideographic variation sequences is subject to the rules specified in Unicode Technical Standard #37, "Unicode Ideographic Variation Database." The base character for an ideographic variation sequence must be an ideographic character, and it makes use of a variation selector in the range U+E0100..U+E01EF. The term ideographic variation sequence is sometimes abbreviated as "IVS". IDN . (See Internationalized Domain Name .) IDNA (1) The IDNA2008 protocol for IDNs defined in RFCs 5891 , 5892 , 5893 and 5894 . The protocol categorizes characters (for example as PVALID or DISALLOWED) based on Unicode properties as described in RFC 5892 . (For the range of valid code points for each Unicode version, see the data file for the derived IDNA2008_Category property.) (2) The earlier IDNA2003 protocol. (See IDNA Compatibility Processing for differences between IDNA2003 and IDNA2008 .) IDNA Compatibility Processing . (See Unicode Technical Standard #46, "Unicode IDNA Compatibility Processing" .) IDNA2003 . (See IDNA (2).) IDNA2008 . (See IDNA (1).) IICore . A subset of common-use CJK unified ideographs, defined as the fixed collection 370 IICore in ISO/IEC 10646. This subset contains 9,810 ideographs and is intended for common use in East Asian contexts, particularly for small devices that cannot support the full range of CJK unified ideographs encoded in the Unicode Standard. Ijam . Diacritical marks applied to basic letter forms to derive new (usually consonant) letters for extended Arabic alphabets. For example, see the three dots below which appear in the letter peh: پ Ijam marks are not separately encoded as combining marks in the Unicode Standard, but instead are integral parts of each atomically encoded Arabic letter. Contrast tashkil . See also Section 9.2, Arabic . Ill-Formed Code Unit Sequence . A code unit sequence that does not follow the specification of a Unicode encoding form. (See definition D84 in Section 3.9, Unicode Encoding Forms .) Ill-Formed Code Unit Subsequence . A non-empty subsequence of a Unicode code unit sequence X which does not contain any code units which also belong to any minimal well-formed subsequence of X. (See definition D84a in Section 3.9, Unicode Encoding Forms .) IME . (See Input Method Editor .) In-Band . An in-band channel conveys information about text by embedding that information within the text itself, with special syntax to distinguish it. In-band information is encoded in the same character set as the text, and is interspersed with and carried along with the text data. Examples are XML and HTML markup. Independent Vowel . In Indic scripts, certain vowels are depicted using independent letter symbols that stand on their own. This is often true when a word starts with a vowel or a word consists of only a vowel. Indic Digits . Forms of decimal digits used in various Indic scripts (for example, Devanagari: U+0966, U+0967, U+0968, U+0969). Arabic digits (and, eventually, European digits) derive historically from these forms. See Terminology for Digits for additional information on terminology related to digits. Informative . Information in this standard that is not normative but that contributes to the correct use and implementation of the standard. Inherent Vowel . In writing systems based on a script in the Brahmi family of Indic scripts, a consonant letter symbol nor
2026-01-13T09:30:26
http://rb.zq1.de/compare.factory-20250702/
Index of /compare.factory-20250702 Index of /compare.factory-20250702 Name Last modified Size Description Parent Directory   -   build-compare-differed-builds-nachbau.txt 2025-07-02 08:42 12K   build-compare-differed-builds.txt 2025-07-02 08:42 2.2K   build-time.txt 2025-07-02 08:42 275K   build-verify-failed.txt 2025-07-02 08:42 12K   checksums.txt 2025-07-02 08:42 28M   differed-builds-nachbau.txt 2025-07-02 08:42 16K   differed-builds.txt 2025-07-02 08:42 3.1K   diffs/ 2025-07-17 09:44 -   failchecklist 2025-07-02 08:42 1.4K   failed-builds.txt 2025-07-02 08:42 1.4K   fast-builds.txt 2018-02-06 21:44 137K   giturls 2022-06-30 19:37 2.0M   giturls.good 2022-07-25 21:50 603K   graph.png 2025-07-02 09:33 12K   j3.swp 2025-03-25 06:49 0   minor-differed-builds.txt 2025-07-02 08:42 1.1K   monthlyurl.txt 2025-05-29 08:01 5.4K   nachbau.swo 2025-01-11 19:20 0   nachbau.swp 2025-01-11 19:20 0   nachbaunew.swp 2025-03-14 20:17 0   oscpr 2025-07-02 05:48 415K   oscpr.failed 2025-07-02 08:42 434   rb-class-a.txt 2025-07-02 10:16 441K   rb-class-dvi.txt 2025-07-02 10:16 860   rb-class-edj.txt 2025-07-02 10:16 2.4K   rb-class-elc.txt 2025-07-02 10:16 26K   rb-class-gem.txt 2025-07-02 10:16 0   rb-class-html.txt 2025-07-02 10:16 17M   rb-class-jar.txt 2025-07-02 10:16 47K   rb-class-javadoc.txt 2025-07-02 10:16 92   rb-class-mono.txt 2025-07-02 10:16 30   rb-class-pdf.txt 2025-07-02 10:16 1.3K   rb-class-png.txt 2025-07-02 10:16 13K   rb-class-ps.txt 2025-07-02 10:16 486   rb-class-pyc.txt 2025-07-02 10:16 3.2K   rb-class-so.txt 2025-07-02 10:16 41K   rb-class-svg.txt 2025-07-02 10:16 1.4K   rb-class-tar.gz.txt 2025-07-02 10:16 0   rbbuild-tried.txt 2024-02-26 21:01 214K   rbplot.csv 2025-07-02 09:50 49K   rbstats.txt 2025-07-02 08:42 359   report-202009.txt 2020-10-01 15:54 1.4K   report-202010.txt 2020-10-30 06:27 1.6K   report-202011.txt 2020-11-28 01:18 1.6K   report-202012.txt 2020-12-31 13:46 1.5K   report-202101.txt 2021-01-29 15:17 1.5K   report-202102.txt 2021-02-27 07:17 1.6K   report-202103.txt 2021-03-28 11:24 1.1K   report-202104.txt 2021-04-29 03:40 2.1K   report-202105.txt 2021-06-01 05:52 1.8K   report-202106.txt 2021-06-30 09:54 1.6K   report-202107.txt 2021-07-30 12:07 1.2K   report-202108.txt 2021-08-30 18:31 1.3K   report-202109.txt 2021-09-30 19:55 1.3K   report-202110.txt 2021-10-31 11:20 1.1K   report-202111.txt 2021-11-30 20:43 1.1K   report-202112.txt 2021-12-31 20:19 1.3K   report-202201.txt 2022-01-31 13:53 1.1K   report-202203.txt 2022-03-31 22:21 1.5K   report-202204.txt 2022-04-28 15:12 2.4K   report-202205.txt 2022-06-01 16:52 2.1K   report-202206.txt 2022-07-04 19:48 1.3K   report-202207.txt 2022-07-31 21:29 5.5K   report-202208.txt 2022-09-01 21:02 4.7K   report-202209.txt 2022-10-05 12:29 4.8K   report-202210.txt 2022-11-03 19:52 4.0K   report-202212.txt 2023-01-09 13:12 12K   report-202301.txt 2023-01-31 09:40 11K   report-202301.txt.in 2023-01-31 09:40 934   report-202302.txt 2023-03-01 15:37 6.4K   report-202302.txt.in 2023-03-01 13:51 52   report-202303.txt 2023-04-02 18:50 5.5K   report-202303.txt.in 2023-04-02 19:32 120   report-202305.txt.in 2023-05-12 09:16 6   report-202306.txt.in 2023-06-30 14:11 402   report-202307.txt.in 2023-07-31 15:12 859   report-202308.txt.in 2023-08-30 09:06 261   report-202401.txt.in 2024-01-31 14:36 82   report-202402.txt.in 2024-02-28 13:31 80   report-202403.txt.in 2024-03-31 18:47 555   report-202404.txt.in 2024-04-30 08:06 874   report-202405.txt.in 2024-05-31 14:33 77   report-202406.txt.in 2024-06-30 21:48 311   report-202407.txt.in 2024-07-31 09:51 2.2K   report-202408.txt.in 2024-09-04 09:07 2.7K   report-202409.txt.in 2024-10-02 12:37 1.5K   report-202410.txt.in 2024-10-30 14:58 816   report-202411.txt 2024-11-29 17:26 11K   report-202411.txt.in 2024-11-29 17:25 493   report-202412.txt.in 2024-12-30 21:03 1.6K   report-202501.txt 2025-01-31 11:34 13K   report-202501.txt.in 2025-01-31 10:24 2.1K   report-202502.txt 2025-02-28 08:39 12K   report-202502.txt.in 2025-02-28 08:39 894   report-202503.txt.in 2025-03-31 21:14 958   report-202504.txt.in 2025-04-30 07:34 243   report-202505.txt.in 2025-05-29 07:59 917   report-202506.txt.in 2025-07-02 09:48 547   report.txt 2025-07-02 09:48 9.4K   reproducible.json 2025-07-02 08:42 6.7M   status-FTBFS-builds.txt 2024-02-26 21:01 1.4K   status-notforus-builds.txt 2024-02-26 21:01 3.9K   status-succeeded-builds.txt 2024-02-26 21:01 209K   status-waitdep-builds.txt 2024-02-26 21:01 168   timebombs 2025-06-19 09:24 5.2K   unreproduciblerings.txt 2025-07-02 08:42 424  
2026-01-13T09:30:26
https://github.com/jeremyevans/sequel-annotate
GitHub - jeremyevans/sequel-annotate: Annotate your Sequel models Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / sequel-annotate Public forked from kennym/annotate-sequel Notifications You must be signed in to change notification settings Fork 12 Star 39 Annotate your Sequel models License MIT license 39 stars 17 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/sequel-annotate   master Branches Tags Go to file Code Open more actions menu     Folders and files Name Name Last commit message Last commit date Latest commit   History 135 Commits .github/ workflows .github/ workflows     lib/ sequel lib/ sequel     spec spec     .ci.gemfile .ci.gemfile     .gitignore .gitignore     CHANGELOG CHANGELOG     Gemfile Gemfile     MIT-LICENSE MIT-LICENSE     README.rdoc README.rdoc     Rakefile Rakefile     sequel-annotate.gemspec sequel-annotate.gemspec     View all files Repository files navigation README MIT license sequel-annotate sequel-annotate annotates Sequel models with schema information. By default, it includes information on columns, indexes, and foreign key constraints for the current table. On PostgreSQL, this includes more advanced information, including check constraints, triggers, comments, and foreign keys constraints for other tables that reference the current table. Example The schema comments are kept at the end of the file by default, using a format similar to: class Item < Sequel :: Model end # Table: items # Columns: # id | integer | PRIMARY KEY DEFAULT nextval('items_id_seq'::regclass) # category_id | integer | NOT NULL # manufacturer_name | character varying(50) | # manufacturer_location | text | # in_stock | boolean | DEFAULT false # name | text | DEFAULT 'John'::text # price | double precision | DEFAULT 0 # Indexes: # items_pkey | PRIMARY KEY btree (id) # name | UNIQUE btree (manufacturer_name, manufacturer_location) # manufacturer_name | btree (manufacturer_name) # Check constraints: # pos_id | (id > 0) # Foreign key constraints: # items_category_id_fkey | (category_id) REFERENCES categories(id) # items_manufacturer_name_fkey | (manufacturer_name, manufacturer_location) REFERENCES manufacturers(name, location) # Triggers: # valid_price | BEFORE INSERT OR UPDATE ON items FOR EACH ROW EXECUTE PROCEDURE valid_price() Install gem install sequel - annotate Usage After loading the models: require 'sequel/annotate' Sequel :: Annotate . annotate ( Dir [ 'models/*.rb' ]) That will append or replace the schema comment in each of the files. It’s best to run this when the repository is clean, and then use your source control tools (e.g. git diff) to see the changes it makes. In some cases, sequel-annotate may not be able to correctly guess the model for the file. In that case, you may need to create an instance manually: sa = Sequel :: Annotate . new ( Item ) sa . annotate ( 'models/item.rb' ) If you want to get the schema comment for a model without appending it to a file: sa . schema_comment If you want to put the schema comment at the beginning of the file you can use the :position option: Sequel :: Annotate . annotate ( Dir [ 'models/*.rb' ], position: :before ) or sa = Sequel :: Annotate . new ( Item ) sa . annotate ( 'models/item.rb' , position: :before ) If your models are nested in a namespace: module ModelNamespace class Item < Sequel :: Model end end Then you can use the :namespace option to set the namespace to use: Sequel :: Annotate . annotate ( Dir [ 'models/*.rb' ], namespace: 'ModelNamespace' ) For PostgreSQL, you can optionally leave out indexes, foreign_keys, references, triggers, comments, and constraints by passing in false as a parameter as follows: Sequel::Annotate.annotate(Dir['models/*.rb'], foreign_keys: false, :indexes: false, constraints: false, comments: false) The columns section can have a border on the top and bottom for easier visual distinction by setting the :border option to true Sequel :: Annotate . annotate ( Dir [ 'models/*.rb' ], border: true ) Models that use datasets that select from subqueries are automatically skipped, as annotations don’t really make sense for them since they are not backed by a table. You can skip other models by using a # sequel-annotate: false magic comment somewhere in the file. Rake Task Here’s an example rake task for sequel-annotate: desc "Update model annotations" task :annotate do # Load the models first Dir [ 'models/*.rb' ]. each { | f | require_relative f } require 'sequel/annotate' Sequel :: Annotate . annotate ( Dir [ 'models/*.rb' ]) end Running Tests Tests of sequel-annotate itself can be run with rake: rake Set the SEQUEL_ANNOTATE_SPEC_POSTGRES_URL environment variable or appropriate libpq environment variables to specify which PostgreSQL database to connect to. License MIT Author Jeremy Evans <code@jeremyevans.net> Based on [annotate-sequel]{ github.com/kennym/annotate-sequel } by Kenny Meyer. About Annotate your Sequel models Resources Readme License MIT license Uh oh! There was an error while loading. Please reload this page . Activity Stars 39 stars Watchers 3 watching Forks 12 forks Report repository Releases 9 tags Packages 0 No packages published Uh oh! There was an error while loading. Please reload this page . Languages Ruby 100.0% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time.
2026-01-13T09:30:26
https://foldoc.org/flame
flame from FOLDOC Contents Help Random flame < messaging > To rant, to speak or write incessantly and/or rabidly on some relatively uninteresting subject or with a patently ridiculous attitude or with hostility toward a particular person or group of people. "Flame" is used as a verb ("Don't flame me for this, but..."), a flame is a single flaming message, and "flamage" /flay'm*j/ the content. Flamage may occur in any medium (e.g. spoken, electronic mail , Usenet news, web ). Sometimes a flame will be delimited in text by marks such as "<flame on>...<flame off>". The term was probably independently invented at several different places. Mark L. Levinson says, "When I joined the Harvard student radio station (WHRB) in 1966, the terms flame and flamer were already well established there to refer to impolite ranting and to those who performed it. Communication among the students who worked at the station was by means of what today you might call a paper-based Usenet group. Everyone wrote comments to one another in a large ledger. Documentary evidence for the early use of flame/flamer is probably still there for anyone fanatical enough to research it." It is reported that "flaming" was in use to mean something like "interminably drawn-out semi-serious discussions" (late-night bull sessions) at Carleton College during 1968-1971. Usenetter Marc Ramsey, who was at WPI from 1972 to 1976, says: "I am 99% certain that the use of "flame" originated at WPI. Those who made a nuisance of themselves insisting that they needed to use a TTY for "real work" came to be known as "flaming asshole lusers". Other particularly annoying people became "flaming asshole ravers", which shortened to "flaming ravers", and ultimately "flamers". I remember someone picking up on the Human Torch pun, but I don't think "flame on/off" was ever much used at WPI." See also asbestos . It is possible that the hackish sense of "flame" is much older than that. The poet Chaucer was also what passed for a wizard hacker in his time; he wrote a treatise on the astrolabe, the most advanced computing device of the day. In Chaucer's "Troilus and Cressida", Cressida laments her inability to grasp the proof of a particular mathematical theorem; her uncle Pandarus then observes that it's called "the fleminge of wrecches." This phrase seems to have been intended in context as "that which puts the wretches to flight" but was probably just as ambiguous in Middle English as "the flaming of wretches" would be today. One suspects that Chaucer would feel right at home on Usenet . [ Jargon File ] Last updated: 2001-03-11 Nearby terms: FLAIR ♦ flaky ♦ flamage ♦ flame ♦ flame bait ♦ flame off ♦ flame on ♦ flamer Try this search on Wikipedia , Wiktionary , Google , OneLook . Loading Tweet   Recent Updates     |     Missing Terms Updated: Thu, 28 Aug 2025 23:32:16 GMT 15284 entries Copyright Denis Howe 1985
2026-01-13T09:30:26
https://www.unicode.org/glossary/#byte
Glossary Glossary Tech Site | Site Map | Search   Glossary of Unicode Terms   A B C D E F G H I J K L M N O P-Q R S T U V W X-Y Z This glossary is updated periodically to stay synchronized with changes to various standards maintained by the Unicode Consortium. See About Unicode Terminology for translations of various terms. There is also an FAQ section on the website. A Abjad . A writing system in which only consonants are indicated. The term “abjad” is derived from the first four letters of the traditional order of the Arabic script: alef, beh, jeem, dal . (See Section 6.1, Writing Systems .) Abstract Character . A unit of information used for the organization, control, or representation of textual data. (See definition D7 in Section 3.4, Characters and Encoding .) Abstract Character Sequence . An ordered sequence of one or more abstract characters. (See definition D8 in Section 3.4, Characters and Encoding .) Abugida . A writing system in which consonants are indicated by the base letters that have an inherent vowel, and in which other vowels are indicated by additional distinguishing marks of some kind modifying the base letter. The term “abugida” is derived from the first four letters of the Ethiopic script in the Semitic order: alf, bet, gaml, dant . (See Section 6.1, Writing Systems .) Accent Mark . A mark placed above, below, or to the side of a character to alter its phonetic value. (See also diacritic .) Acrophonic . Denoting letters or numbers by the first letter of their name. For example, the Greek acrophonic numerals are variant forms of such initial letters. Aksara . (1) In Sanskrit grammar, the term for “letter” in general, as opposed to consonant ( vyanjana ) or vowel ( svara ). Derived from the first and last letters of the traditional ordering of Sanskrit letters—“a” and “ksha”. (2) More generally, in Indic writing systems, aksara refers to an orthographic syllable . Algorithm . A term used in a broad sense in the Unicode Standard, to mean the logical description of a process used to achieve a specified result. This does not require the actual procedure described in the algorithm to be followed; any implementation is conformant as long as the results are the same. Alphabet . A writing system in which both consonants and vowels are indicated. The term “alphabet” is derived from the first two letters of the Greek script: alpha, beta . (See Section 6.1, Writing Systems .) Alphabetic Property . Informative property of the primary units of alphabets and/or syllabaries. (See Section 4.10, Letters, Alphabetic, and Ideographic .) Alphabetic Sorting . (See collation .) AMTRA . Acronym for Arabic Mark Transient Reordering Algorithm . (See Unicode Standard Annex #53, “Unicode Arabic Mark Rendering.” ) Annotation . The association of secondary textual content with a point or range of the primary text. (The value of a particular annotation is considered to be a part of the “content” of the text. Typical examples include glossing, citations, exemplification, Japanese yomi, and so on.) ANSI .  (1) The American National Standards Institute. (2) The Microsoft collective name for all Windows code pages. Sometimes used specifically for code page 1252, which is a superset of ISO/IEC 8859-1. Apparatus Criticus . Collection of conventions used by editors to annotate and comment on text. Arabic Digits . The term "Arabic digits" may mean either the digits in the Arabic script (see Arabic-Indic digits ) or the ordinary ASCII digits in contrast to Roman numerals (see European digits ). When the term "Arabic digits" is used in Unicode specifications, it means Arabic-Indic digits. See Terminology for Digits for additional information on terminology related to digits. Arabic-Indic Digits . Forms of decimal digits used in most parts of the Arabic world (for instance, U+0660, U+0661, U+0662, U+0663). Although European digits (1, 2, 3,…) derive historically from these forms, they are visually distinct and are coded separately. (Arabic-Indic digits are sometimes called Indic numerals; however, this nomenclature leads to confusion with the digits currently used with the scripts of India.) Variant forms of Arabic-Indic digits used chiefly in Iran and Pakistan are referred to as Eastern Arabic-Indic digits . (See Section 9.2, Arabic .) See Terminology for Digits for additional information on terminology related to digits. ASCII . (1) The American Standard Code for Information Interchange, a 7-bit coded character set for information interchange. It is the U.S. national variant of ISO/IEC 646 and is formally the U.S. standard ANSI X3.4. It was proposed by ANSI in 1963 and finalized in 1968. (2) The set of 128 Unicode characters from U+0000 to U+007F, including control codes as well as graphic characters. (3) ASCII has been incorrectly used to refer to various 8-bit character encodings that include ASCII characters in the first 128 code points. ASCII digits . The digit characters U+0030 to U+0039. Also known as European digits . See Terminology for Digits for additional information on terminology related to digits. Assigned Character .  A code point that is assigned to an abstract character. This refers to graphic, format, control, and private-use characters that have been encoded in the Unicode Standard. (See Section 2.4, Code Points and Characters .) Assigned Code Point .  (See designated code point .) Atomic Character .  A character that is not decomposable. (See decomposable character .) B Base Character . Any graphic character except for those with the General Category of Combining Mark (M). (See definition D51 in Section 3.6, Combination .) In a combining character sequence, the base character is the initial character, which the combining marks are applied to. Basic Multilingual Plane . Plane 0, abbreviated as BMP. Bicameral . A script that distinguishes between two cases. (See case .) Most often used in the context of Latin-based alphabets of Europe and elsewhere in the world. Bidi . Abbreviation of bidirectional, in reference to mixed left-to-right and right-to-left text. Bidirectional Display . The process or result of mixing left-to-right text and right-to-left text in a single line. (See Unicode Standard Annex #9, “Unicode Bidirectional Algorithm.” ) Big-endian . A computer architecture that stores multiple-byte numerical values with the most significant byte (MSB) values first. Binary Files . Files containing nontextual information. Block . A grouping of characters within the Unicode encoding space used for organizing code charts. Each block is a uniquely named, continuous, non-overlapping range of code points, containing a multiple of 16 code points, and starting at a location that is a multiple of 16. A block may contain unassigned code points, which are reserved. BMP . Acronym for Basic Multilingual Plane . BMP Character . A Unicode encoded character having a BMP code point. (See supplementary character .) BMP Code Point . A Unicode code point between U+0000 and U+FFFF. (See supplementary code point .) BNF . Acronym for Backus-Naur Form , a formal meta-syntax for describing context-free syntaxes. (For details, see Appendix A, Notational Conventions .) BOCU-1 . Acronym for Binary Ordered Compression for Unicode. A Unicode compression scheme that is MIME-compatible (directly usable for e-mail) and preserves binary order, which is useful for databases and sorted lists. BOM .  Acronym for byte order mark . Bopomofo . An alphabetic script used primarily in the Republic of China (Taiwan) to write the sounds of Mandarin Chinese and some other dialects. Each symbol corresponds to either the syllable-initial or syllable-final sounds; it is therefore a subsyllabic script in its primary usage. The name is derived from the names of its first four elements. More properly known as zhuyin zimu or zhuyin fuhao in Mandarin Chinese. Boustrophedon . A pattern of writing seen in some ancient manuscripts and inscriptions, where alternate lines of text are laid out in opposite directions, and where right-to-left lines generally use glyphs mirrored from their left-to-right forms. Literally, “as the ox turns,” referring to the plowing of a field. Braille . A writing system using a series of raised dots to be read with the fingers by people who are blind or whose eyesight is not sufficient for reading printed material. (See Section 21.1, Braille .) Braille Pattern . One of the 64 (for six-dot Braille) or 256 (for eight-dot Braille) possible tangible dot combinations. Byte . (1) The minimal unit of addressable storage for a particular computer architecture. (2) An octet. Note that many early computer architectures used bytes larger than 8 bits in size, but the industry has now standardized almost uniformly on 8-bit bytes. The Unicode Standard follows the current industry practice in equating the term byte with octet and using the more familiar term byte in all contexts. (See octet .) Byte Order Mark . The Unicode character U+FEFF when used to indicate the byte order of a text. (See Section 2.13, Special Characters and Noncharacters , and Section 23.8, Specials .) Byte Serialization . The order of a series of bytes determined by a computer architecture. Byte-Swapped . Reversal of the order of a sequence of bytes. C Camelcase . A casing convention for compound terms or identifiers, in which the letters are mostly lowercased, but component words or abbreviations may be capitalized. For example, "ThreeWordTerm" or "threeWordTerm". Canonical . (1) Conforming to the general rules for encoding—that is, not compressed, compacted, or in any other form specified by a higher protocol. (2) Characteristic of a normative mapping and form of equivalence specified in Chapter 3, Conformance . Canonical Composition . A step in the algorithm for Unicode Normalization Forms, during which decomposed sequences are replaced by primary composites, where possible. (See definition D115 in Section 3.11, Normalization Forms .) Canonical Decomposable Character . A character that is not identical to its canonical decomposition. (See definition D69 in Section 3.7, Decomposition .) Canonical Decomposition . Mapping to an inherently equivalent sequence—for example, mapping ä to a +  combining umlaut. (For a full, formal definition, see definition D68 in Section 3.7, Decomposition .) Canonical Equivalence . The relation between two character sequences whose full canonical decompositions are identical. (See definition D70 in Section 3.7, Decomposition .) Canonical Equivalent . Two character sequences are said to be canonical equivalents if their full canonical decompositions are identical. (See definition D70 in Section 3.7, Decomposition .) Canonical Ordering . The order of a combining character sequence that results from the application of the Canonical Ordering Algorithm, a step in the process of normalization of strings. See definition D109 in Section 3.11, Normalization Forms . Cantillation Mark . A mark that is used to indicate how a text is to be chanted or sung. Capital Letter . Synonym for uppercase letter . (See case .) Case . (1) Feature of certain alphabets where the letters have two distinct forms. These variants, which may differ markedly in shape and size, are called the uppercase letter (also known as capital or majuscule ) and the lowercase letter (also known as small or minuscule ). (2) Normative property of characters, consisting of uppercase, lowercase, and titlecase (Lu, Ll, and Lt). (See Section 4.2, Case .) Case Folding . The mapping of strings to a particular case form, to facilitate searching and sorting of text. Case foldings may be simple, when the case mappings are required not to change the length of the strings to compare, or full, when the case mappings may change the length of the strings to compare. (See Section 3.13.3, Default Case Folding .) Case Mapping . The association of the uppercase, lowercase, and titlecase forms of a letter. (See Section 5.18, Case Mappings .) Case-Ignorable . A character C is defined to be case-ignorable if C has the value MidLetter (ML), MidNumLet (MB), or Single_Quote (SQ) for the Word_Break property or its General_Category is one of Nonspacing_Mark (Mn), Enclosing_Mark (Me), Format (Cf), Modifier_Letter (Lm), or Modifier_Symbol (Sk). (See definition D136 in Section 3.13, Default Case Algorithms .) Case-Ignorable Sequence . A sequence of zero or more case-ignorable characters. (See definition D137 in Section 3.13, Default Case Algorithms .) CCC . Short name for the Canonical_Combining_Class property, usually lowercased: ccc. CCS . (1) Acronym for coded character set . (2) Also used as an acronym for combining character sequence . Cedilla . A mark originally placed beneath the letter c in French, Portuguese, and Spanish to indicate that the letter is to be pronounced as an s, as in façade . Obsolete Spanish diminutive of ceda , the letter z . CEF . Acronym for character encoding form . CES . Acronym for character encoding scheme . Character . (1) The smallest component of written language that has semantic value; refers to the abstract meaning and/or shape, rather than a specific shape (see also glyph ), though in code tables some form of visual representation is essential for the reader’s understanding. (2) Synonym for abstract character . (3) The basic unit of encoding for the Unicode character encoding. (4) The English name for the ideographic written elements of Chinese origin. [See ideograph (2).] Character Block . (See block .) Character Class . A set of characters sharing a particular set of properties. Character Encoding Form . Mapping from a character set definition to the actual code units used to represent the data. Character Encoding Scheme . A character encoding form plus byte serialization. There are seven character encoding schemes in Unicode: UTF-8, UTF-16, UTF-16BE, UTF-16LE, UTF-32, UTF-32BE, and UTF-32LE. Character Entity . Expression of the form & for "&" or   for the no-break space. These are found in markup language files like HTML or XML. There are also numerically defined character entities. (See also character escape .) Character Escape . A numerical expression of the form \uXXXX, \xXXXX or &#xXXXX; where X is a hex digit, or &#dddd; where d is a decimal digit. These are found in programming source code or markup language files (such as HTML or XML). Character Name . A unique string used to identify each abstract character encoded in the standard. (See definition D4 in Section 3.3, Semantics .) Character Name Alias . An additional unique string identifier, other than the character name, associated with an encoded character in the standard. (See definition D5 in Section 3.3, Semantics .) Character Properties . A set of property names and property values associated with individual characters. (See Chapter 4, Character Properties .) Character Repertoire . The collection of characters included in a character set. Character Sequence . Synonym for abstract character sequence . Character Set . A collection of elements used to represent textual information. Charset . (See coded character set .) Chillu . Abbreviation for chilaaksharam (singular) ( cillakṣaram ). Refers to any of a set of sonorant consonants in Malayalam, when appearing in syllable-final position with no inherent vowel. Choseong . A sequence of one or more leading consonants in Korean. Chu Hán . The name for Han characters used in Vietnam; derived from hànzì . Chu Nôm . A demotic script of Vietnam developed from components of Han characters. Its creators used methods similar to those used by the Chinese in creating Han characters. CJK . Acronym for Chinese, Japanese, and Korean. A variant, CJKV , means Chinese, Japanese, Korean, and Vietnamese. CJK Unified Ideograph . A Han character that has undergone the process of Han unification (conducted primarily by the Ideographic Research Group) and been encoded as a single ideograph with one or more clearly identified CJK source mappings. CJK unified ideographs have no decomposition mappings, and the set of them in the Unicode Standard is normatively specified by the Unified_Ideograph property. CLDR . (See Unicode Common Locale Data Repository .) Coded Character . (See encoded character .) Coded Character Representation . Synonym for coded character sequence . Coded Character Sequence . An ordered sequence of one or more code points. Normally, this consists of a sequence of encoded characters, but it may also include noncharacters or reserved code points. (See definition D12 in Section 3.4, Characters and Encoding .) Coded Character Set . A character set in which each character is assigned a numeric code point. Frequently abbreviated as character set, charset , or code set ; the acronym CCS is also used. Code Page . A coded character set, often referring to a coded character set used by a personal computer—for example, PC code page 437, the default coded character set used by the U.S. English version of the DOS operating system. Code Point . (1) Any value in the Unicode codespace; that is, the range of integers from 0 to 10FFFF 16 . (See definition D10 in Section 3.4, Characters and Encoding .) Not all code points are assigned to encoded characters. See code point type . (2) A value, or position, for a character, in any coded character set. Code Point Type . Any of the seven fundamental classes of code points in the standard: Graphic, Format, Control, Private-Use, Surrogate, Noncharacter, Reserved. (See definition D10a in Section 3.4, Characters and Encoding .) Code Position . Synonym for code point . Used in ISO character encoding standards. Code Set . (See coded character set .) Codespace . (1) A range of numerical values available for encoding characters. (2) For the Unicode Standard, a range of integers from 0 to 10FFFF 16 . (See definition D9 in Section 3.4, Characters and Encoding .) Code Unit . The minimal bit combination that can represent a unit of encoded text for processing or interchange. The Unicode Standard uses 8-bit code units in the UTF-8 encoding form, 16-bit code units in the UTF-16 encoding form, and 32-bit code units in the UTF-32 encoding form. (See definition D77 in Section 3.9, Unicode Encoding Forms .) Code Value . Obsolete synonym for code unit . Codomain . For a mapping, the codomain is the set of code points or sequences that it maps to, while the domain is the set of values that are mapped. For example, a canonical decomposition is a mapping from a set of code points to a set of sequences; the codomain is the set of canonical equivalent mappings. (See also domain .) Collation . The process of ordering units of textual information. Collation is usually specific to a particular language. Also known as alphabetizing or alphabetic sorting . Unicode Technical Standard #10, “Unicode Collation Algorithm," defines a complete, unambiguous, specified ordering for all characters in the Unicode Standard. Combining Character . A character with the General Category of Combining Mark (M). (See definition D52 in Section 3.6, Combination .) (See also nonspacing mark .) Combining Character Sequence . A maximal character sequence consisting of either a base character followed by a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner ; or a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner . (See definition D56 in Section 3.6, Combination .) Combining Class . A numeric value in the range 0..254 given to each Unicode code point, formally defined as the property Canonical_Combining_Class. (See definition D104 in Section 3.11, Normalization Forms .) Combining Mark . A commonly used synonym for combining character . Compatibility . (1) Consistency with existing practice or preexisting character encoding standards. (2) Characteristic of a normative mapping and form of equivalence specified in Section 3.7, Decomposition . Compatibility Character . A character that would not have been encoded except for compatibility and round-trip convertibility with other standards. (See Section 2.3, Compatibility Characters .) Compatibility Composite Character . Synonym for compatibility decomposable character . Compatibility Decomposable Character . A character whose compatibility decomposition is not identical to its canonical decomposition. (See definition D66 in Section 3.7, Decomposition .) Compatibility Decomposition . Mapping to a roughly equivalent sequence that may differ in style. (For a full, formal definition, see definition D65 in Section 3.7, Decomposition .) Compatibility Equivalence . The relation between two character sequences whose full compatibility decompositions are identical. (See definition D67 in Section 3.7, Decomposition .) Compatibility Equivalent . Two character sequences are said to be compatibility equivalents if their full compatibility decompositions are identical. (See definition D67 in Section 3.7, Decomposition .) Compatibility Ideograph . A Han character encoded for compatibility with some East Asian character encoding, but which is not encoded as a CJK unified ideograph . Instead, each compatibility ideograph has a canonical decomposition mapping to a particular CJK unified ideograph. Compatibility Precomposed Character . Synonym for compatibility decomposable character . Compatibility Variant . A character that generally can be remapped to another character without loss of information other than formatting. Composite Character . (See decomposable character .) Composite Character Sequence . (See combining character sequence .) Composition Exclusion . A Canonical Decomposable Character which has the property value Composition_Exclusion=True. (Used in the definition of Unicode Normalization Forms.) (See definition D112 in Section 3.11, Normalization Forms .) Conformance . Adherence to a specified set of criteria for use of a standard. (See Chapter 3, Conformance .) Confusable . Of similar or identical appearance. When referring to characters in strings, the appearance of confusable characters can make different identifiers hard or impossible to distinguish. (See also Unicode Technical Standard #39, "Unicode Security Mechanisms" .) Conjunct Form . A ligated form representing a consonant conjunct . Consonant Cluster .  A sequence of two or more consonantal sounds. Depending on the writing system, a consonant cluster may be represented by a single character or by a sequence of characters. (Contrast digraph .) Consonant Conjunct . A sequence of two or more adjacent consonantal letterforms, consisting of a sequence of one or more dead consonants followed by a normal, live consonant letter. A consonant conjunct may be ligated into a single conjunct form, or it may be represented by graphically separable parts, such as subscripted forms of the consonant letters. Consonant conjuncts are associated with the Brahmi family of Indic scripts. (See Section 12.1, Devanagari .) Contextual Variant . A text element can have a presentation form that depends on the textual context in which it is rendered. This presentation form is known as a contextual variant . Contributory Property . A simple property defined merely to make the statement of a rule defining a derived property more compact or general. (See definition D35a in Section 3.5, Properties .) Control Codes . The 65 characters in the ranges U+0000..U+001F and U+007F..U+009F. Also known as control characters . Core Specification . The central part of the Unicode Standard–the portion which up until Version 5.0 was published as a separate book. Starting with Version 5.2, this part of the standard has been published online only, rather than as a book. The core specification consists of the general introduction and framework for the standard, the formal conformance requirements, many implementation guidelines, and extensive chapters providing information about all the encoded characters, organized by script or by significant classes of characters. Formally, a version of the Unicode Standard is defined by an edition of this core specification, together with the Code Charts , Unicode Standard Annexes , and the Unicode Character Database Cursive . Writing where the letters of a word are connected. D Dasia . Greek term for rough breathing mark, used in polytonic Greek character names. DBCS . Acronym for double-byte character set . Dead Consonant . An Indic consonant character followed by a virama character. This sequence indicates that the consonant has lost its inherent vowel. (See Section 12.1, Devanagari .) Decimal Digits . Digits that can be used to form decimal-radix numbers. Decomposable Character . A character that is equivalent to a sequence of one or more other characters, according to the decomposition mappings found in the Unicode Character Database, and those described in Section 3.12, Conjoining Jamo Behavior . It may also be known as a precomposed character or a composite character. (See definition D63 in Section 3.7, Decomposition .) Decomposition . (1) The process of separating or analyzing a text element into component units. These component units may not have any functional status, but may be simply formal units—that is, abstract shapes. (2) A sequence of one or more characters that is equivalent to a decomposable character. (See definition D64 in Section 3.7, Decomposition .) Decomposition Mapping . A mapping from a character to a sequence of one or more characters that is a canonical or compatibility equivalent and that is listed in the character names list or described in Section 3.12, Conjoining Jamo Behavior . (See definition D62 in Section 3.7, Decomposition .) Default Ignorable . Default ignorable code points are those that should be ignored by default in rendering unless explicitly supported. They have no visible glyph or advance width in and of themselves, although they may affect the display, positioning, or adornment of adjacent or surrounding characters. (See Section 5.21, Ignoring Characters in Processing .) Defective Combining Character Sequence . A combining character sequence that does not start with a base character. (See definition D57 in Section 3.6, Combination .) Demotic Script . (1) A script or a form of a script used to write the vernacular or common speech of some language community. (2) A simplified form of the ancient Egyptian hieratic writing. Dependent Vowel . A symbol or sign that represents a vowel and that is attached or combined with another symbol, usually one that represents a consonant. For example, in writing systems based on Arabic, Hebrew, and Indic scripts, vowels are normally represented as dependent vowel signs. Deprecated . Of a coded character or a character property, strongly discouraged from use. (Not the same as obsolete .) Deprecated Character . A coded character whose use is strongly discouraged. Such characters are retained in the standard, indefinitely but should not be used. (See definition D13 in Section 3.4, Characters and Encoding .) Designated Code Point . Any code point that has either been assigned to an abstract character ( assigned characters ) or that has otherwise been given a normative function by the standard (surrogate code points and noncharacters). This definition excludes reserved code points. Also known as assigned code point . (See Section 2.4 Code Points and Characters .) Deterministic Comparison . A string comparison in which strings that do not have identical contents will compare as unequal. There are two main varieties, depending on the sense of "identical:" (a) binary equality, or (b) canonical equivalence. This is a property of the comparison mechanism, and not of the sorting algorithm. Also known as stable (or semi-stable ) comparison . Deterministic Sort . A sort algorithm which returns exactly the same output each time it is applied to the same input. This is a property of the sorting algorithm, and not of the comparison mechanism. For example, a randomized Quicksort (which picks a random element as the pivot element, for optimal performance) is not deterministic. Multiprocessor implementations of a sort algorithm may also not be deterministic. Diacritic . (1) A mark applied or attached to a symbol to create a new symbol that represents a modified or new value. (2) A mark applied to a symbol irrespective of whether it changes the value of that symbol. In the latter case, the diacritic usually represents an independent value (for example, an accent, tone, or some other linguistic information). Also called diacritical mark or diacritical . (See also combining character and nonspacing mark .) Diaeresis . Two horizontal dots over a letter, as in naïve . The diaeresis is not distinguished from the umlaut in the Unicode character encoding. (See umlaut .) Dialytika . Greek term for diaeresis or trema , used in Greek character names. Digits . (See Arabic digits , European digits , and Indic digits .) See Terminology for Digits for additional information on terminology related to digits. Digraph . A pair of signs or symbols (two graphs), which together represent a single sound or a single linguistic unit. The English writing system employs many digraphs (for example, th, ch, sh, qu, and so on). The same two symbols may not always be interpreted as a digraph (for example, ca th ode versus ca th ouse ). When three signs are so combined, they are called a trigraph . More than three are usually called an n-graph . Dingbats . Typographical symbols and ornaments. Diphthong . A pair of vowels that are considered a single vowel for the purpose of phonemic distinction. One of the two vowels is more prominent than the other. In writing systems, diphthongs are sometimes written with one symbol and sometimes with more than one symbol (for example, with a digraph ). Direction . (See paragraph direction .) Directionality Property . A property of every graphic character that determines its horizontal ordering as specified in Unicode Standard Annex #9, “Unicode Bidirectional Algorithm.” (See Section 4.4, Directionality .) Display Cell . A rectangular region on a display device within which one or more glyphs are imaged. Display Order . The order of glyphs presented in text rendering. (See logical order and Section 2.2, Unicode Design Principles .) Domain . 1. For a mapping, the domain is the set of code points or sequences that are mapped, while the codomain is the set of values they are mapped to. For example, a canonical decomposition is a mapping from a set of code points to a set of sequences; the domain is the entire Unicode codespace. (See also codomain .) 2. A realm of administrative autonomy, authority or control in the Internet, identified by a domain name. Domain Name . The part of a network address that identifies it as belonging to a particular domain. (Oxford Languages definition.) A domain name is a string of characters. The rules for how Unicode characters can be used in domain names is the concern of IDNA and of UTS #46, Unicode IDNA Compatibility Processing . Double-Byte Character Set . One of a number of character sets defined for representing Chinese, Japanese, or Korean text (for example, JIS X 0208-1990). These character sets are often encoded in such a way as to allow double-byte character encodings to be mixed with single-byte character encodings. Abbreviated DBCS . (See also multibyte character set .) Ductility . The ability of a cursive font to stretch or compress the connective baseline to effect text justification. Dynamic Composition . Creation of composite forms such as accented letters or Hangul syllables from a sequence of characters. E EBCDIC . Acronym for Extended Binary-Coded Decimal Interchange Code. A group of coded character sets used on mainframes that consist of 8-bit coded characters. EBCDIC coded character sets reserve the first 64 code points (x00 to x3F) for control codes, and reserve the range x41 to xFE for graphic characters. The English alphabetic characters are in discontinuous segments with uppercase at xC1 to xC9, xD1 to xD9, xE2 to xE9, and lowercase at x81 to x89, x91 to x99, xA2 to xA9. ECCS . Acronym for extended combining character sequence . EGC . Acronym for extended grapheme cluster . Embedding . A concept relevant to bidirectional behavior. (See Unicode Standard Annex #9, “Unicode Bidirectional Algorithm,” for detailed terminology and definitions.) Emoji . (1) The Japanese word for "pictograph." (2) Certain pictographic and other symbols encoded in the Unicode Standard that are commonly given a colorful or playful presentation when displayed on devices. Many of the emoji in Unicode were originally encoded for compatibility with Japanese telephone symbol sets. (3) Colorful or playful symbols which are not encoded as characters but which are widely implemented as graphics. (See pictograph .) Emoticon . A symbol added to text to express emotional affect or reaction—for example, sadness, happiness, joking intent, sarcasm, and so forth. Emoticons are often expressed by a conventional kind of "ASCII art," using sequences of punctuation and other symbols to portray likenesses of facial expressions. In Western contexts these are often turned sideways, as :-) to express a happy face; in East Asian contexts other conventions often portray a facial expression without turning, as ^-^. Rendering systems often recognize conventional emoticon sequences and display them as colorful or even animated glyphs in text. There is also a set of dedicated pictographic symbols—mostly representing different facial expressions—encoded as characters in the Unicode Standard. (See pictograph .) Encapsulated Text . (1) Plain text surrounded by formatting information. (2) Text recoded to pass through narrow transmission channels or to match communication protocols. Enclosing Mark . A nonspacing mark with the General Category of Enclosing Mark (Me). (See definition D54 in Section 3.6, Combination .) Enclosing marks are a subclass of nonspacing marks that surround a base character, rather than merely being placed over, under, or through it. Encoded Character . An association (or mapping) between an abstract character and a code point . (See definition D11 in Section 3.4, Characters and Encoding .) By itself, an abstract character has no numerical value, but the process of “encoding a character” associates a particular code point with a particular abstract character, thereby resulting in an “encoded character.” Encoding Form . (See character encoding form .) Encoding Scheme . (See character encoding scheme .) Equivalence . In the context of text processing, the process or result of establishing whether two text elements are identical in some respect. Equivalent Sequence . (See canonical equivalent .) Escape Sequence . A sequence of bytes that is used for code extension. The first byte in the sequence is escape (hex 1B). EUDC . Acronym for end-user defined character. A character defined by an end user, using a private-use code point, to represent a character missing in a particular character encoding. These are common in East Asian implementations. European Digits . Forms of decimal digits first used in Europe and now used worldwide. Historically, these digits were derived from the Arabic digits; they are sometimes called “Arabic numerals,” but this nomenclature leads to confusion with the real Arabic-Indic digits . Also called "Western digits" and "Latin digits." See Terminology for Digits for additional information on terminology related to digits. Extended Base . Any base character, or any standard Korean syllable block. (See definition D51a in Section 3.6, Combination .) Extended Combining Character Sequence . A maximal character sequence consisting of either an extended base followed by a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner ; or a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner . Abbreviated as ECCS . (See definition D56a in Section 3.6, Combination .) Extended Grapheme Cluster . The text between extended grapheme cluster boundaries as specified by Unicode Standard Annex #29, "Unicode Text Segmentation." Abbreviated as EGC . (See definition D61 in Section 3.6, Combination .) F Fancy Text . (See rich text .) Fixed Position Class . A subset of the range of numeric values for combining classes—specifically, any value in the range 10..199. (See definition D105 in Section 3.11, Normalization Forms .) Floating ( diacritic, accent, mark ). (See nonspacing mark .) Folding . An operation that maps similar characters to a common target, such as uppercasing or lowercasing a string. Folding operations are most often used to temporarily ignore certain distinctions between characters. Font . A collection of glyphs used for the visual depiction of character data. A font is often associated with a set of parameters (for example, size, posture, weight, and serifness), which, when set to particular values, generate a collection of imagable glyphs. Format Character . A character that is inherently invisible but that has an effect on the surrounding characters. Format Code . Synonym for format character . Format Control Character . Synonym for format character . Formatted Text . (See rich text .) FSS-UTF . Acronym for File System Safe UCS Transformation Format , published by the X/Open Company Ltd., and intended for the UNIX environment. Now known as UTF-8 . Full Composition Exclusion . A Canonical Decomposable Character which has the property value Full_Composition_Exclusion=True. (Used in the definition of Unicode Normalization Forms.) (See definition D113 in Section 3.11, Normalization Forms .) Fullwidth . Characters of East Asian character sets whose glyph image extends across the entire character display cell. In legacy character sets, fullwidth characters are normally encoded in two or three bytes. The Japanese term for fullwidth characters is zenkaku . FVS . Acronym for Mongolian Free Variation Selector . G G11n . (See globalization .) GC . 1. Acronym for grapheme cluster . 2. Short name for the General_Category property, usually lowercased: gc. GCGID . Acronym for Graphic Character Global Identifier. These are listed in the IBM document Character Data Representation Architecture, Level 1, Registry SC09-1391 . General Category . Partition of the characters into major classes such as letters, punctuation, and symbols, and further subclasses for each of the major classes. (See Section 4.5, General Category .) Generative . Synonym for productive . Globalization . (1) The overall process for internationalization and localization of  software products. (2) a synonym for internationalization. Also known by the abbreviation "g11n". Note that the meaning of "globalization" which is relevant to software products should be distinguished from the more widespread use of "globalization" in the context of economics. (See internationalization , localization .) Glyph . (1) An abstract form that represents one or more glyph images. (2) A synonym for glyph image . In displaying Unicode character data, one or more glyphs may be selected to depict a particular character. These glyphs are selected by a rendering engine during composition and layout processing. (See also character .) Glyph Code . A numeric code that refers to a glyph. Usually, the glyphs contained in a font are referenced by their glyph code. Glyph codes may be local to a particular font; that is, a different font containing the same glyphs may use different codes. Glyph Identifier . Similar to a glyph code, a glyph identifier is a label used to refer to a glyph within a font. A font may employ both local and global glyph identifiers. Glyph Image . The actual, concrete image of a glyph representation having been rasterized or otherwise imaged onto some display surface. Glyph Metrics . A collection of properties that specify the relative size and positioning along with other features of a glyph. Grapheme . (1) A minimally distinctive unit of writing in the context of a particular writing system. For example, ‹b› and ‹d› are distinct graphemes in English writing systems because there exist distinct words like big and dig. Conversely, a lowercase italiform letter a and a lowercase Roman letter a are not distinct graphemes because no word is distinguished on the basis of these two different forms. (2) What a user thinks of as a character. Grapheme Base . A character with the property Grapheme_Base, or any standard Korean syllable block. (See definition D58 in Section 3.6, Combination .) Grapheme Cluster . The text between grapheme cluster boundaries as specified by Unicode Standard Annex #29, "Unicode Text Segmentation." (See definition D60 in Section 3.6, Combination .) A grapheme cluster represents a horizontally segmentable unit of text, consisting of some grapheme base (which may consist of a Korean syllable) together with any number of nonspacing marks applied to it. Grapheme Extender . A character with the property Grapheme_Extend. (See definition D59 in Section 3.6, Combination .) Grapheme extender characters consist of all nonspacing marks, zero width joiner , zero width non-joiner , and a small number of spacing marks. Graphic Character . A character with the General Category of Letter (L), Combining Mark (M), Number (N), Punctuation (P), Symbol (S), or Space Separator (Zs). (See definition D50 in Section 3.6. Combination .) Guillemet . Punctuation marks resembling small less-than and greater-than signs, used as quotation marks in French and other languages. (See “Language-Based Usage of Quotation Marks” in Section 6.2, General Punctuation .) H Halant . A preferred Hindi synonym for a virama . It literally means killer , referring to its function of killing the inherent vowel of a consonant letter. (See virama .) Half-Consonant Form . In the Devanagari script and certain other scripts of the Brahmi family of Indic scripts, a dead consonant may be depicted in the so-called half-form. This form is composed of the distinctive part of a consonant letter symbol without its vertical stem. It may be used to create conjunct forms that follow a horizontal layout pattern. Also known as half-form . Halfwidth . Characters of East Asian character sets whose glyph image occupies half of the character display cell. In legacy character sets, halfwidth characters are normally encoded in a single byte. The Japanese term for halfwidth characters is hankaku . Han Characters . Ideographic characters of Chinese origin. (See Section 18.1, Han .) Hangul . The name of the script used to write the Korean language. Hangul Syllable . (1) Any of the 11,172 encoded characters of the Hangul Syllables character block, U+AC00..U+D7A3. Also called a precomposed Hangul syllable to clearly distinguish it from a Korean syllable block. (2) Loosely speaking, a Korean syllable block . Hanja . The Korean name for Han characters; derived from the Chinese word hànzì . Hankaku . (See halfwidth .) Han Unification . The process of identifying Han characters that are in common among the writing systems of Chinese, Japanese, Korean, and Vietnamese. Hànzì . The Mandarin Chinese name for Han characters. Harakat . Marks used in the Arabic script to indicate vocalization with short vowels. A subtype of tashkil . Hasant . The Bangla name for halant . (See virama .) Higher-Level Protocol . Any agreement on the interpretation of Unicode characters that extends beyond the scope of this standard. Note that such an agreement need not be formally announced in data; it may be implicit in the context. (See definition D16 in Section 3.4, Characters and Encoding .) High-Surrogate Code Point . A Unicode code point in the range U+D800 to U+DBFF. (See definition D71 in Section 3.8, Surrogates .) High-Surrogate Code Unit . A 16-bit code unit in the range D800 16 to DBFF 16 , used in UTF-16 as the leading code unit of a surrogate pair. Also known as a leading surrogate . (See definition D72 in Section 3.8, Surrogates .) Hiragana (ひらがな). One of two standard syllabaries associated with the Japanese writing system. Hiragana syllables are typically used in the representation of native Japanese words and grammatical particles, or are used as a fallback representation of other words when the corresponding kanji is either difficult to remember or obscure. (See also katakana .) Horizontal Extension . This refers to the process of adding a new IRG source reference to an existing CJK unified ideograph, along with a new representative glyph for the code charts that shows how the character appears in its source. It does not involve encoding a new character, but rather just adding the source reference and new glyph to the code charts. HTML . HyperText Markup Language. A text description language related to SGML; it mixes text format markup with plain text content to describe formatted text. HTML is ubiquitous as the source language for Web pages on the Internet. Starting with HTML 4.0, the Unicode Standard functions as the reference character set for HTML content. (See also SGML .) I I18n . (See internationalization .) IANA . Acronym for Internet Assigned Numbers Authority. ICU . Acronym for International Components for Unicode, an Open Source set of C/C++ and Java libraries for Unicode and software internationalization support. For information, see https://icu.unicode.org/ Ideograph (or ideogram ). (1) Any symbol that primarily denotes an idea or concept in contrast to a sound or pronunciation—for example, ♻, which denotes the concept of recycling by a series of bent arrows. (2) A generic term for the unit of writing of a logosyllabic writing system. In this sense, ideograph (or ideogram) is not systematically distinguished from logograph (or logogram). (3) A term commonly used to refer specifically to Han characters, equivalent to the Chinese, Japanese, or Korean terms also sometimes used: hànzì , kanji , or hanja . (See logograph , pictograph , sinogram .) Ideographic Property . Informative property of characters that are ideographs. (See Section 4.10, Letters, Alphabetic, and Ideographic .) Ideographic Variation Sequence . A variation sequence registered in the Ideographic Variation Database . The registration of ideographic variation sequences is subject to the rules specified in Unicode Technical Standard #37, "Unicode Ideographic Variation Database." The base character for an ideographic variation sequence must be an ideographic character, and it makes use of a variation selector in the range U+E0100..U+E01EF. The term ideographic variation sequence is sometimes abbreviated as "IVS". IDN . (See Internationalized Domain Name .) IDNA (1) The IDNA2008 protocol for IDNs defined in RFCs 5891 , 5892 , 5893 and 5894 . The protocol categorizes characters (for example as PVALID or DISALLOWED) based on Unicode properties as described in RFC 5892 . (For the range of valid code points for each Unicode version, see the data file for the derived IDNA2008_Category property.) (2) The earlier IDNA2003 protocol. (See IDNA Compatibility Processing for differences between IDNA2003 and IDNA2008 .) IDNA Compatibility Processing . (See Unicode Technical Standard #46, "Unicode IDNA Compatibility Processing" .) IDNA2003 . (See IDNA (2).) IDNA2008 . (See IDNA (1).) IICore . A subset of common-use CJK unified ideographs, defined as the fixed collection 370 IICore in ISO/IEC 10646. This subset contains 9,810 ideographs and is intended for common use in East Asian contexts, particularly for small devices that cannot support the full range of CJK unified ideographs encoded in the Unicode Standard. Ijam . Diacritical marks applied to basic letter forms to derive new (usually consonant) letters for extended Arabic alphabets. For example, see the three dots below which appear in the letter peh: پ Ijam marks are not separately encoded as combining marks in the Unicode Standard, but instead are integral parts of each atomically encoded Arabic letter. Contrast tashkil . See also Section 9.2, Arabic . Ill-Formed Code Unit Sequence . A code unit sequence that does not follow the specification of a Unicode encoding form. (See definition D84 in Section 3.9, Unicode Encoding Forms .) Ill-Formed Code Unit Subsequence . A non-empty subsequence of a Unicode code unit sequence X which does not contain any code units which also belong to any minimal well-formed subsequence of X. (See definition D84a in Section 3.9, Unicode Encoding Forms .) IME . (See Input Method Editor .) In-Band . An in-band channel conveys information about text by embedding that information within the text itself, with special syntax to distinguish it. In-band information is encoded in the same character set as the text, and is interspersed with and carried along with the text data. Examples are XML and HTML markup. Independent Vowel . In Indic scripts, certain vowels are depicted using independent letter symbols that stand on their own. This is often true when a word starts with a vowel or a word consists of only a vowel. Indic Digits . Forms of decimal digits used in various Indic scripts (for example, Devanagari: U+0966, U+0967, U+0968, U+0969). Arabic digits (and, eventually, European digits) derive historically from these forms. See Terminology for Digits for additional information on terminology related to digits. Informative . Information in this standard that is not normative but that contributes to the correct use and implementation of the standard. Inherent Vowel . In writing systems based on a script in the Brahmi family of Indic scripts, a consonant letter symbol nor
2026-01-13T09:30:26
http://rb.zq1.de/compare.factory/diffs/
Index of /compare.factory/diffs Index of /compare.factory/diffs Name Last modified Size Description Parent Directory   -   R-base-compare.out 2025-11-10 01:04 287K   Rivet-compare.out 2025-11-25 00:36 1.0M   alex-compare.out 2025-08-09 01:31 18K   app-builder-compare.out 2025-08-21 06:54 848   asymptote-compare.out 2025-06-07 07:15 6.0K   avr-libc-compare.out 2025-09-16 01:37 430   aws-nitro-enclaves-cli-compare.out 2025-12-15 23:48 1.9K   bash-compare.out 2025-12-13 06:32 3.0K   boost-compare.out 2025-12-17 19:01 7.0K   budgie-backgrounds-compare.out 2025-09-04 18:55 71K   cabal-plan-compare.out 2025-08-03 18:16 18K   caja-actions-compare.out 2025-11-06 04:17 1.8K   calibre-compare.out 2025-12-13 06:51 151K   ceph-compare.out 2025-09-10 23:47 1.4K   chezscheme-compare.out 2025-07-08 16:45 2.8K   clisp-compare.out 2025-07-03 10:55 17K   colord-compare.out 2025-08-26 21:42 22K   compleat-compare.out 2025-12-28 12:45 18K   cpphs-compare.out 2025-10-12 06:16 18K   dbus-sharp2-compare.out 2025-04-29 11:23 1.0K   deno-compare.out 2025-10-31 12:32 17K   dvgt-compare.out 2025-06-17 23:42 1.0K   ecl-compare.out 2025-06-17 23:19 162K   efl-compare.out 2025-11-19 18:19 5.3K   emacs-compare.out 2025-12-01 15:04 8.1K   enlightenment-theme-dark-compare.out 2025-06-20 09:56 2.8K   enlightenment-theme-openSUSE-compare.out 2025-12-03 12:03 2.4K   enlightenment-theme-openSUSE-ice-compare.out 2025-04-15 15:11 2.5K   enlightenment-theme-openSUSE-neon-compare.out 2025-03-18 00:57 2.3K   enlightenment-theme-openSUSE-oliveleaf-compare.out 2025-06-18 13:30 4.2K   erlang-compare.out 2025-11-20 16:17 24M   erlang27-compare.out 2025-11-19 11:46 20M   esbuild-compare.out 2025-11-25 07:28 770   ex_doc-compare.out 2025-06-12 09:51 1.6K   flickrnet-compare.out 2025-04-25 11:31 1.0K   forecast-compare.out 2025-12-17 09:51 19K   fpc-compare.out 2025-12-17 10:17 843K   freeciv-compare.out 2025-10-12 07:54 12K   fritzing-compare.out 2025-12-13 09:25 2.0K   gcc7-compare.out 2025-09-08 14:20 133K   ghc-DAV-compare.out 2025-11-27 14:21 17K   ghc-compare.out 2025-09-11 11:36 143K   ghc-hledger-lib-compare.out 2025-12-27 05:58 159K   ghc-typst-compare.out 2025-12-05 18:21 153K   ghc-vty-compare.out 2025-11-27 14:45 89K   ghc-yaml-compare.out 2025-11-27 14:47 18K   ghc-yesod-core-compare.out 2025-11-27 14:49 58K   ghostty-compare.out 2025-03-29 04:53 32K   giac-compare.out 2025-12-17 12:36 1.7K   gimp-compare.out 2025-11-26 23:58 6.0K   ginac-compare.out 2025-05-20 15:51 6.1K   git-annex-compare.out 2025-12-27 06:18 19K   gnome-keyring-sharp-compare.out 2025-07-01 15:36 1.1K   gnu-cobol-compare.out 2025-11-19 11:54 3.4K   golang-github-prometheus-prometheus-compare.out 2025-12-30 13:34 1.1K   grass-compare.out 2025-05-29 14:07 826K   gri-compare.out 2025-05-29 15:34 1.0K   gromacs-compare.out 2025-06-30 06:19 2.9K   gtk-sharp2-compare.out 2025-10-16 18:46 16K   gtk2hs-buildtools-compare.out 2025-03-26 12:18 1.2K   hevea-compare.out 2025-07-30 14:33 3.1K   hledger-compare.out 2025-12-27 07:21 56K   hledger-interest-compare.out 2025-12-27 07:23 18K   installation-images-compare.out 2025-12-26 15:56 63K   intel-opencl-compare.out 2025-11-14 08:48 125K   java-1_8_0-openj9-compare.out 2025-12-17 21:20 7.9M   java-1_8_0-openjdk-compare.out 2025-11-04 22:05 6.3M   java-11-openj9-compare.out 2024-12-15 18:48 31M   java-11-openjdk-compare.out 2025-09-12 03:19 30M   java-17-openj9-compare.out 2025-07-30 10:41 182K   java-17-openjdk-compare.out 2024-12-15 23:54 133K   java-21-openj9-compare.out 2025-11-01 16:53 23K   java-21-openjdk-compare.out 2025-10-27 18:39 15K   java-25-openj9-compare.out 2025-11-02 19:20 23K   keepass-compare.out 2025-11-11 23:31 850   keepass-plugin-HIBPOfflineCheck-compare.out 2025-11-22 10:46 1.0K   kf6-kuserfeedback-compare.out 2025-12-17 04:50 3.0K   kf6-syntax-highlighting-compare.out 2025-12-17 05:18 12K   ksh-compare.out 2025-09-25 10:14 40K   kwctl-compare.out 2025-11-26 18:58 752   lazarus-compare.out 2025-12-27 14:04 4.6K   ldc-compare.out 2025-12-17 23:34 13K   libbluray-compare.out 2025-11-01 07:51 1.1K   libcorrect-compare.out 2025-12-27 23:37 18K   libqt5-qtdoc-compare.out 2025-09-11 03:51 1.0M   libqt5-qtlocation-compare.out 2025-11-21 06:26 4.9K   libqt5-qtscript-compare.out 2025-11-05 20:51 457   libreoffice-compare.out 2025-09-11 19:42 586   lilypond-compare.out 2025-04-29 17:58 7.1K   llvm19-compare.out 2024-12-17 08:50 818   mathgl-compare.out 2025-12-17 06:00 4.0K   maxima-compare.out 2025-09-11 21:45 4.1K   messagelib-compare.out 2025-12-16 19:15 1.6K   mingw32-binutils-compare.out 2025-12-29 15:45 4.7K   mingw32-gcc-compare.out 2025-12-18 05:53 32K   mingw32-gmp-compare.out 2025-03-18 22:55 1.1K   mingw32-mpc-compare.out 2025-03-19 08:21 908   mingw32-mpfr-compare.out 2025-03-18 22:29 918   mingw32-pkgconf-compare.out 2025-03-19 00:59 920   mingw64-binutils-compare.out 2025-12-18 06:02 10K   mingw64-gcc-compare.out 2025-12-18 07:15 39K   mingw64-gmp-compare.out 2025-05-29 08:43 2.8K   mingw64-mpc-compare.out 2025-03-18 22:39 912   mingw64-pkgconf-compare.out 2025-03-14 12:58 924   mono-addins-compare.out 2025-05-05 05:30 22K   mono-basic-compare.out 2025-04-25 11:34 1.8K   mono-core-compare.out 2025-12-18 09:24 24K   mono-zeroconf-compare.out 2025-04-25 11:33 3.2K   musescore-compare.out 2025-12-18 11:50 784   neochat-compare.out 2025-12-16 19:30 20K   neovim-compare.out 2025-12-29 17:04 13K   newtonsoft-json-compare.out 2025-04-24 11:35 1.0K   nftables-compare.out 2025-12-09 00:24 1.9K   nim-compare.out 2025-12-13 20:32 635   nodejs-electron-compare.out 2025-01-04 00:20 866   noisetorch-compare.out 2025-12-18 14:51 14K   nunit-compare.out 2025-12-18 15:17 67K   nunit3-compare.out 2025-03-12 20:25 3.1K   nushell-compare.out 2025-12-18 17:17 24K   nwg-dock-hyprland-compare.out 2025-07-14 22:22 2.0K   nyxt-compare.out 2025-05-29 17:49 756   ocaml-camlp-streams-compare.out 2025-12-06 05:55 5.7K   octave-forge-geometry-compare.out 2025-11-06 15:34 6.9K   octave-forge-ltfat-compare.out 2025-11-06 04:17 12K   octave-forge-nan-compare.out 2025-10-31 05:24 49K   octave-forge-stk-compare.out 2025-11-06 04:17 88K   omnisharp-server-compare.out 2025-10-13 06:20 7.9K   ooRexx-compare.out 2025-05-13 06:05 1.4K   opencloud-server-compare.out 2025-12-27 17:06 2.2K   pandoc-cli-compare.out 2025-12-06 01:04 19K   pgadmin4-compare.out 2025-12-13 22:29 41K   pgloader-compare.out 2025-08-10 01:26 1.6K   pinta-compare.out 2025-04-26 12:34 2.6K   pspp-compare.out 2025-06-24 06:53 18K   pympress-compare.out 2025-07-25 09:26 18K   pythia-compare.out 2025-11-24 23:00 2.2K   python-PyMuPDF-compare.out 2025-10-27 20:47 2.0K   python-aiosmtplib-compare.out 2025-08-09 03:47 16K   python-dtaidistance-compare.out 2025-06-19 13:43 5.7K   python-flake8-comprehensions-compare.out 2025-09-30 05:12 1.8K   python-hdf5plugin-compare.out 2025-10-31 12:52 519K   python-imagecodecs-compare.out 2025-09-05 06:38 10K   python-librosa-compare.out 2025-11-26 10:09 310K   python-numpy1-compare.out 2025-04-08 16:50 18K   python-pydata-sphinx-theme-compare.out 2025-06-20 21:46 46K   python-pygraphviz-compare.out 2025-10-31 04:08 74K   python-scikit-learn-compare.out 2025-09-16 04:52 9.3K   python-scipy-compare.out 2025-12-27 21:44 8.9K   python-torch-compare.out 2025-07-10 21:38 2.7K   python-yt-compare.out 2025-08-28 20:41 48K   python3-pyside6-compare.out 2025-12-05 23:09 1.8K   python39-compare.out 2025-12-27 19:55 1.6K   python313-compare.out 2025-12-29 19:46 25K   python314-compare.out 2025-11-19 21:33 25K   python315-compare.out 2025-12-27 19:15 27K   qgis-compare.out 2025-11-10 06:42 55K   qt6-base-compare.out 2025-12-19 13:52 3.1K   rabbitmq-server-compare.out 2025-08-07 07:52 10K   racket-compare.out 2025-12-10 15:56 9.3M   radare2-compare.out 2025-12-10 16:40 18K   rash-compare.out 2025-03-12 07:05 66K   resources-compare.out 2025-12-26 19:21 14K   river-compare.out 2025-12-26 20:14 26K   rocclr-compare.out 2025-10-20 15:19 3.3K   rocfft-compare.out 2025-11-04 11:44 13K   rocsolver-compare.out 2025-11-20 03:37 12K   rusty_v8-compare.out 2025-12-27 02:23 4.8K   sbcl-compare.out 2025-12-03 17:27 5.7K   scheme48-compare.out 2025-05-29 11:47 10K   scotch-compare.out 2025-09-22 19:27 102K   scsh-compare.out 2025-12-05 22:39 5.5K   sdcc-compare.out 2025-05-14 16:57 454K   sharpfont-compare.out 2025-06-22 06:45 1.0K   smlnj-compare.out 2025-05-29 11:15 103K   swipl-compare.out 2025-10-03 19:48 400K   turbo-compare.out 2025-04-29 11:07 832   virtualbox-compare.out 2025-09-12 06:47 46K   vlang-compare.out 2025-10-23 23:22 1.0K   waylock-compare.out 2025-12-14 13:28 18K   whatsie-compare.out 2025-06-18 12:53 1.5K   wine-compare.out 2025-12-28 06:29 3.0K   xemacs-compare.out 2025-07-03 01:31 412K   xindy-compare.out 2025-06-18 12:28 4.9K   xpra-compare.out 2025-12-14 06:45 1.7K   yast2-control-center-compare.out 2025-09-16 13:02 1.2K   zig-compare.out 2025-10-31 20:59 3.1K   zls-compare.out 2025-12-14 07:49 20K  
2026-01-13T09:30:26
https://asciidoctor.org
Asciidoctor | A fast, open source text processor and publishing toolchain for converting AsciiDoc content to HTML5, DocBook, PDF, and other formats. Asciidoctor About News Code Chat Docs Get Writing! Asciidoctor A fast text processor & publishing toolchain for converting AsciiDoc to HTML5, DocBook & more. Download gem from RubyGems Checkout source from GitHub = Hello, AsciiDoc! Doc Writer <doc@example.com> An introduction to http://asciidoc.org[AsciiDoc]. == First Section * item 1 * item 2 [source,ruby] puts "Hello, World!" Asciidoctor is a fast, open source, Ruby-based text processor for parsing AsciiDoc® into a document model and converting it to output formats such as HTML 5, DocBook 5, manual pages, PDF, EPUB 3, and other formats. Asciidoctor also has an ecosystem of extensions, converters, build plugins, and tools to help you author and publish content written in AsciiDoc . You can find the documentation for these projects at https://docs.asciidoctor.org . In addition to running on Ruby, Asciidoctor can be executed on a JVM using AsciidoctorJ or in any JavaScript environment using Asciidoctor.js . Key documentation Asciidoctor Documentation AsciiDoc Language Documentation AsciiDoc Syntax Quick Reference Sponsors We want to recognize our sponsors for their commitment to improving the state of technical documentation by supporting this project. Thank you sponsors! Without your generous support, Asciidoctor would not be possible. You can support this project by becoming a sponsor through OpenCollective . AsciiDoc Processing and Built-in Converters AsciiDoc is the language. Asciidoctor is the processor. Asciidoctor reads the AsciiDoc source, as shown in the panel on the left in the image below, and converts it to publishable formats, such as HTML 5, as shown rendered in the panel on the right. Asciidoctor provides built-in converters for three output formats by default: HTML 5 , DocBook 5 , and man page (short for manual page). Additional converters, such as PDF and EPUB 3, are provided by separate gems. Asciidoctor also provides an out-of-the-box HTML experience complete with a default stylesheet and built-in integrations like Font Awesome (for icons), highlight.js, Rouge, and Pygments (for source highlighting), and MathJax (for STEM processing). Asciidoctor Ecosystem Although Asciidoctor is written in Ruby, it does not mean you need Ruby to use it. Asciidoctor can be executed on a JVM using AsciidoctorJ or in any JavaScript environment (including the browser) using Asciidoctor.js . Installing an Asciidoctor processor is just the beginning of your publishing experience. Asciidoctor gives you access to a ecosystem of extensions and tools, ranging from add-on converters, to extended syntax, to build plugins, to integrated writing and preview environments: Asciidoctor Diagram Maven plugin and site module Gradle plugin Asciidoclet reveal.js converter EPUB 3 converter IntelliJ plugin web browser extensions and more Asciidoctor is the successor to AsciiDoc.py. If you’re using AsciiDoc.py, see Migrate from AsciiDoc.py to learn how to upgrade to Asciidoctor. Requirements Asciidoctor works on Linux, macOS and Windows and requires one of the following implementations of Ruby : CRuby (aka MRI) 2.3 - 3.3 JRuby 9.1 - 9.4 TruffleRuby (GraalVM) If you’re using a non-English Windows environment, you may bump into an Encoding::UndefinedConversionError when invoking Asciidoctor. To solve this issue, we recommend overriding the default external and internal character encodings to utf-8 . You can do so by setting the RUBYOPT environment variable as follows: RUBYOPT="-E utf-8:utf-8" Once you make this change, all your Unicode headaches should be behind you. If you’re using an IDE like Eclipse, make sure you set the encoding to UTF-8 there as well. Asciidoctor is optimized to work with UTF-8 as the default encoding. Installation Asciidoctor is packaged and distributed to RubyGems.org as a RubyGem (aka gem) named asciidoctor . The asciidoctor gem can be installed on all major operating systems using Ruby packaging tools (gem or bundle). Asciidoctor is also distributed as a Docker image, as a package for numerous Linux distributions, and as a package for macOS (via Homebrew and MacPorts). Linux package managers The version of Asciidoctor installed by the package manager may not match the latest release of Asciidoctor. Consult the package repository for your distribution to find out which version is packaged per distribution release. Alpine Linux (asciidoctor) Arch Linux (asciidoctor) Debian (asciidoctor) Fedora (asciidoctor) OpenSUSE (rubygem-asciidoctor) Ubuntu (asciidoctor) If you want to use a version of Asciidoctor that’s newer than what is installed by the package manager, see the gem installation instructions . apk (Alpine Linux) To install the gem on Alpine Linux, open a terminal and type: $ sudo apk add asciidoctor pacman (Arch Linux) To install the gem on Arch-based distributions, open a terminal and type: $ sudo pacman -S asciidoctor APT On Debian and Debian-based distributions such as Ubuntu, use APT to install Asciidoctor. To install the package, open a terminal and type: $ sudo apt-get install -y asciidoctor DNF On RPM-based Linux distributions, such as Fedora, CentOS, and RHEL, use the DNF package manager to install Asciidoctor. To install the package, open a terminal and type: $ sudo dnf install -y asciidoctor macOS Homebrew You can use Homebrew , the macOS package manager, to install Asciidoctor. If you don’t have Homebrew on your computer, complete the installation instructions first. Once Homebrew is installed, you’re ready to install the asciidoctor gem. Open a terminal and type: $ brew install asciidoctor Homebrew installs the asciidoctor gem into an exclusive prefix that’s independent of system gems. MacPorts You can also use MacPorts , another package manager for macOS, to install Asciidoctor. If you don’t have MacPorts on your computer, complete the installation instructions first. Once MacPorts is installed, you’re ready to install the asciidoctor gem via the Asciidoctor port . Open a terminal and type: $ sudo port install asciidoctor Windows To use Asciidoctor with Windows, you have two options. Chocolatey When you already use chocolatey on your machine, you can use: choco install ruby Then follow gem installation instructions . Rubyinstaller Or you use the Rubyinstaller , download the package for your Windows Version and after the installation go ahead with gem installation instructions . gem install Before installing Asciidoctor using gem install , you should set up RVM (or similar) to install Ruby in your home directory (i.e., user space). Then, you can safely use the gem command to install or update the Asciidoctor gem, or any other gem for that matter. When using RVM, gems are installed in a location isolated from the system. (You should never use the gem command to install system-wide gems). Once you’ve installed Ruby using RVM, and you have activated it using rvm use 3.0 , open a terminal and type: $ gem install asciidoctor If you want to install a pre-release version (e.g., a release candidate), use: $ gem install asciidoctor --pre Docker See Installing Asciidoctor using Docker . Bundler Create a Gemfile in the root folder of your project (or the current directory) Add the asciidoctor gem to your Gemfile as follows: source ' https://rubygems.org ' gem ' asciidoctor ' # or specify the version explicitly # gem 'asciidoctor', '2.0.23' Save the Gemfile Open a terminal and install the gem using: $ bundle To upgrade the gem, specify the new version in the Gemfile and run bundle again. Using bundle update (without specifying a gem) is not recommended as it will also update other gems, which may not be the desired result. Upgrade If you installed Asciidoctor using a package manager, your operating system is probably configured to automatically update packages, in which case you don’t need to update the gem manually. apk (Alpine Linux) To upgrade the gem, use: $ sudo apk add -u asciidoctor APT To upgrade the gem, use: $ sudo apt-get upgrade -y asciidoctor DNF To upgrade the gem, use: $ sudo dnf update -y asciidoctor Homebrew (macOS) To upgrade the gem, use: $ brew update $ brew upgrade asciidoctor MacPorts (macOS) To upgrade the gem, use: $ sudo port selfupdate $ sudo port upgrade asciidoctor gem install If you previously installed Asciidoctor using the gem command, you’ll need to manually upgrade Asciidoctor when a new version is released. You can upgrade the gem by typing: $ gem install asciidoctor When you install a new version of the gem using gem install , you end up with multiple versions installed. Use the following command to remove the old versions: $ gem cleanup asciidoctor Usage If the Asciidoctor gem installed successfully, the asciidoctor command line interface (CLI) will be available on your PATH. To verify it’s available, run the following in your terminal: $ asciidoctor --version You should see information about the Asciidoctor version and your Ruby environment printed in the terminal. Asciidoctor 2.0.23 [https://asciidoctor.org] Runtime Environment (ruby 3.0.1p64 [x86_64-linux]) (lc:UTF-8 fs:UTF-8 in:UTF-8 ex:UTF-8) Command line interface (CLI) The asciidoctor command allows you to invoke Asciidoctor from the command line (i.e., a terminal). The following command converts the file README.adoc to HTML and saves the result to the file README.html in the same directory. The name of the generated HTML file is derived from the source file by changing its file extension to .html . $ asciidoctor README.adoc You can control the Asciidoctor processor by adding various flags and switches, which you can learn about using: $ asciidoctor --help For instance, to write the file to a different directory, use: $ asciidoctor -D output README.adoc The asciidoctor man page provides a complete reference of the command line interface. Refer to the following resources to learn more about how to use the asciidoctor command. Process AsciiDoc using the CLI CLI options Ruby API Asciidoctor also provides an API. The API is intended for integration with other Ruby software, such as Rails, GitHub, and GitLab, as well as other languages, such as Java (via AsciidoctorJ) and JavaScript (via Asciidoctor.js). To use Asciidoctor in your application, you first need to require the gem: require ' asciidoctor ' You can then convert an AsciiDoc source file to an HTML file using: Asciidoctor .convert_file ' README.adoc ' , to_file : true , safe : :safe When using Asciidoctor via the API, the default safe mode is :secure . In secure mode, several core features are disabled, including the include directive. If you want to enable these features, you’ll need to explicitly set the safe mode to :server (recommended) or :safe . You can also convert an AsciiDoc string to embeddable HTML (for inserting in an HTML page) using: content = ' _Zen_ in the art of writing https://asciidoctor.org[AsciiDoc]. ' Asciidoctor .convert content, safe : :safe If you want the full HTML document, enable the header_footer option as follows: content = ' _Zen_ in the art of writing https://asciidoctor.org[AsciiDoc]. ' html = Asciidoctor .convert content, header_footer : true , safe : :safe If you need access to the parsed document, you can split the conversion into discrete steps: content = ' _Zen_ in the art of writing https://asciidoctor.org[AsciiDoc]. ' document = Asciidoctor .load content, header_footer : true , safe : :safe puts document.doctitle html = document.convert Keep in mind that if you don’t like the output Asciidoctor produces, you can change it! Asciidoctor supports custom converters that can handle converting from the parsed document to the generated output. One easy way to customize the output piecemeal is by using the template converter. The template converter allows you to supply a Tilt -supported template file to handle converting any node in the document. However you go about it, you can have 100% control over the output. For more information about how to use the API or to customize the output, see: Process AsciiDoc using the API API options Safe modes Contributing New contributors are always welcome! If you discover errors or omissions in the source code, documentation, or website content, please don’t hesitate to submit an issue or open a pull request with a fix. Here are some ways you can contribute: by using prerelease (alpha, beta or preview) versions by reporting bugs by suggesting new features by writing or editing documentation by writing code with tests —  No patch is too small. fix typos add comments clean up inconsistent whitespace write tests! by refactoring code by fixing issues by reviewing patches The Contributing guide provides information on how to create, style, and submit issues, feature requests, code, and documentation to Asciidoctor. Getting Help Asciidoctor is developed to help you easily write and publish your content. But we can’t do it without your feedback! We encourage you to ask questions and discuss any aspects of the project on the discussion list, on Twitter or in the chat room. Chat (Zulip) https://asciidoctor.zulipchat.com Discussion list (Nabble) https://discuss.asciidoctor.org Twitter Follow @asciidoctor or search for the #asciidoctor hashtag The Asciidoctor organization on GitHub hosts the project’s source code, issue tracker, and sub-projects. Source repository (git) https://github.com/asciidoctor/asciidoctor Issue tracker https://github.com/asciidoctor/asciidoctor/issues Asciidoctor organization on GitHub https://github.com/asciidoctor Code of Conduct The core Asciidoctor project is governed by the Code of Conduct for the Asciidoctor community of projects. By participating, you’re agreeing to honor this code. Let’s work together to make this a welcoming, professional, inclusive, and safe environment for everyone. Versioning and Release Policy This project adheres to semantic versioning ( major.minor.patch ). Typically, patch releases are only made for the current minor release. However, exceptions are made on a case-by-case basis to address security vulnerabilities and other high-priority issues. Copyright and License Copyright © 2012-present Dan Allen, Sarah White, Ryan Waldron, and the individual contributors to Asciidoctor. Use of this software is granted under the terms of the MIT License. See the LICENSE for the full license text. Authors Asciidoctor is led by Dan Allen and Sarah White and has received contributions from many individuals in Asciidoctor’s awesome community. The project was initiated in 2012 by Ryan Waldron based on a prototype written by Nick Hengeveld for the Git website. AsciiDoc.py was started and maintained by Stuart Rackham from 2002 to 2013 and has received contributions from many individuals in the AsciiDoc.py community . Trademarks AsciiDoc® and AsciiDoc Language™ are trademarks of the Eclipse Foundation, Inc. Use AsciiDoc for document markup. Really. It's actually readable by humans, easier to parse and way more flexible than XML. — Linus Torvalds Asciidoctor Project The Asciidoctor project is an effort to bring a comprehensive and accessible publishing toolchain, centered around the AsciiDoc syntax, to a growing range of ecosystems, including Ruby, JavaScript and the JVM. In addition to an AsciiDoc processor and a collection of stylesheets, the project provides plugins for Maven, Gradle and Guard and packages for operating systems such as Fedora, Debian and Ubuntu. It also pushes AsciiDoc to evolve by introducing new ideas and innovation and helps promote AsciiDoc through education and advocacy. Contribute to asciidoctor.org This website is open source! The source is hosted under the Asciidoctor organization on GitHub. If you want to help by improving upon it, fork the project , revise the content, then send a pull request. When the pull request is merged, the site will be updated automatically. Download: Development: GitHub Discussions: Nabble (archive) Chat: Zulip Twitter: @asciidoctor Thanks to our supporters and contributors ! Composed in AsciiDoc. Styled by Foundation. Baked with Awestruct. © Asciidoctor Project 2025. Content licensed under CC-BY-4.0. AsciiDoc is a Trademark of the Eclipse Foundation, Inc.
2026-01-13T09:30:26
http://debian.xfree.com.ar/debian-cd/
Index of /debian-cd Index of /debian-cd Name Last modified Size Description Parent Directory - 13.3.0-live/ 2026-01-10 18:07 - 13.3.0/ 2026-01-10 18:07 - current-live/ 2026-01-10 18:07 - current/ 2026-01-10 18:07 - project/ 2005-05-23 13:50 - ls-lR.gz 2026-01-13 04:12 11K
2026-01-13T09:30:26
http://rb.zq1.de/compare.factory-20250529/
Index of /compare.factory-20250529 Index of /compare.factory-20250529 Name Last modified Size Description Parent Directory   -   build-compare-differed-builds-nachbau.txt 2025-05-29 06:59 3.3K   build-compare-differed-builds.txt 2025-05-29 06:59 2.3K   build-time.txt 2025-05-29 07:01 274K   build-verify-failed.txt 2025-05-29 06:59 3.3K   checksums.txt 2025-05-29 06:59 29M   differed-builds-nachbau.txt 2025-05-29 06:59 6.4K   differed-builds.txt 2025-05-29 06:59 3.5K   diffs/ 2025-05-29 02:19 -   failchecklist 2025-05-29 06:59 671   failed-builds.txt 2025-05-29 06:59 740   fast-builds.txt 2018-02-06 21:44 137K   giturls 2022-06-30 19:37 2.0M   giturls.good 2022-07-25 21:50 603K   graph.png 2025-05-29 07:56 12K   j3.swp 2025-03-25 06:49 0   minor-differed-builds.txt 2025-05-29 06:59 1.2K   monthlyurl.txt 2025-05-05 08:27 5.3K   nachbau.swo 2025-01-11 19:20 0   nachbau.swp 2025-01-11 19:20 0   nachbaunew.swp 2025-03-14 20:17 0   oscpr 2025-05-29 06:57 413K   oscpr.failed 2025-05-29 06:59 532   rb-class-a.txt 2025-05-29 07:21 443K   rb-class-dvi.txt 2025-05-29 07:21 860   rb-class-edj.txt 2025-05-29 07:21 2.4K   rb-class-elc.txt 2025-05-29 07:21 26K   rb-class-gem.txt 2025-05-29 07:21 0   rb-class-html.txt 2025-05-29 07:21 17M   rb-class-jar.txt 2025-05-29 07:21 293K   rb-class-javadoc.txt 2025-05-29 07:21 92   rb-class-mono.txt 2025-05-29 07:21 30   rb-class-pdf.txt 2025-05-29 07:21 2.9K   rb-class-png.txt 2025-05-29 07:21 14K   rb-class-ps.txt 2025-05-29 07:21 486   rb-class-pyc.txt 2025-05-29 07:21 7.1K   rb-class-so.txt 2025-05-29 07:21 45K   rb-class-svg.txt 2025-05-29 07:21 1.4K   rb-class-tar.gz.txt 2025-05-29 07:21 0   rbbuild-tried.txt 2024-02-26 21:01 214K   rbplot.csv 2025-05-29 07:15 48K   rbstats.txt 2025-05-29 06:59 358   report-202009.txt 2020-10-01 15:54 1.4K   report-202010.txt 2020-10-30 06:27 1.6K   report-202011.txt 2020-11-28 01:18 1.6K   report-202012.txt 2020-12-31 13:46 1.5K   report-202101.txt 2021-01-29 15:17 1.5K   report-202102.txt 2021-02-27 07:17 1.6K   report-202103.txt 2021-03-28 11:24 1.1K   report-202104.txt 2021-04-29 03:40 2.1K   report-202105.txt 2021-06-01 05:52 1.8K   report-202106.txt 2021-06-30 09:54 1.6K   report-202107.txt 2021-07-30 12:07 1.2K   report-202108.txt 2021-08-30 18:31 1.3K   report-202109.txt 2021-09-30 19:55 1.3K   report-202110.txt 2021-10-31 11:20 1.1K   report-202111.txt 2021-11-30 20:43 1.1K   report-202112.txt 2021-12-31 20:19 1.3K   report-202201.txt 2022-01-31 13:53 1.1K   report-202203.txt 2022-03-31 22:21 1.5K   report-202204.txt 2022-04-28 15:12 2.4K   report-202205.txt 2022-06-01 16:52 2.1K   report-202206.txt 2022-07-04 19:48 1.3K   report-202207.txt 2022-07-31 21:29 5.5K   report-202208.txt 2022-09-01 21:02 4.7K   report-202209.txt 2022-10-05 12:29 4.8K   report-202210.txt 2022-11-03 19:52 4.0K   report-202212.txt 2023-01-09 13:12 12K   report-202301.txt 2023-01-31 09:40 11K   report-202301.txt.in 2023-01-31 09:40 934   report-202302.txt 2023-03-01 15:37 6.4K   report-202302.txt.in 2023-03-01 13:51 52   report-202303.txt 2023-04-02 18:50 5.5K   report-202303.txt.in 2023-04-02 19:32 120   report-202305.txt.in 2023-05-12 09:16 6   report-202306.txt.in 2023-06-30 14:11 402   report-202307.txt.in 2023-07-31 15:12 859   report-202308.txt.in 2023-08-30 09:06 261   report-202401.txt.in 2024-01-31 14:36 82   report-202402.txt.in 2024-02-28 13:31 80   report-202403.txt.in 2024-03-31 18:47 555   report-202404.txt.in 2024-04-30 08:06 874   report-202405.txt.in 2024-05-31 14:33 77   report-202406.txt.in 2024-06-30 21:48 311   report-202407.txt.in 2024-07-31 09:51 2.2K   report-202408.txt.in 2024-09-04 09:07 2.7K   report-202409.txt.in 2024-10-02 12:37 1.5K   report-202410.txt.in 2024-10-30 14:58 816   report-202411.txt 2024-11-29 17:26 11K   report-202411.txt.in 2024-11-29 17:25 493   report-202412.txt.in 2024-12-30 21:03 1.6K   report-202501.txt 2025-01-31 11:34 13K   report-202501.txt.in 2025-01-31 10:24 2.1K   report-202502.txt 2025-02-28 08:39 12K   report-202502.txt.in 2025-02-28 08:39 894   report-202503.txt.in 2025-03-31 21:14 958   report-202504.txt.in 2025-04-30 07:34 243   report-202505.txt.in 2025-05-29 07:13 913   report.txt 2025-05-29 07:14 8.9K   reproducible.json 2025-05-29 07:00 6.7M   status-FTBFS-builds.txt 2024-02-26 21:01 1.4K   status-notforus-builds.txt 2024-02-26 21:01 3.9K   status-succeeded-builds.txt 2024-02-26 21:01 209K   status-waitdep-builds.txt 2024-02-26 21:01 168   timebombs 2025-04-25 12:40 5.1K   unreproduciblerings.txt 2025-05-29 07:01 572  
2026-01-13T09:30:26
http://hackage.haskell.org/package/semigroupoids-1.2.6.1/docs/Data-Functor-Bind.html
Data.Functor.Bind Source Contents Index semigroupoids-1.2.6.1: Haskell 98 semigroupoids: Category sans id Portability portable Stability provisional Maintainer Edward Kmett <ekmett@gmail.com> Safe Haskell Safe-Infered Data.Functor.Bind Contents Functors Applyable functors Wrappers Bindable functors Description NB: The definitions exported through Data.Functor.Apply need to be included here because otherwise the instances for the transformers package have orphaned heads. Synopsis class Functor f where fmap :: (a -> b) -> f a -> f b (<$) :: a -> f b -> f a (<$>) :: Functor f => (a -> b) -> f a -> f b ($>) :: Functor f => f a -> b -> f b class Functor f => Apply f where (<.>) :: f (a -> b) -> f a -> f b (.>) :: f a -> f b -> f b (<.) :: f a -> f b -> f a (<..>) :: Apply w => w a -> w (a -> b) -> w b liftF2 :: Apply w => (a -> b -> c) -> w a -> w b -> w c liftF3 :: Apply w => (a -> b -> c -> d) -> w a -> w b -> w c -> w d newtype WrappedApplicative f a = WrapApplicative { unwrapApplicative :: f a } newtype MaybeApply f a = MaybeApply { runMaybeApply :: Either (f a) a } class Apply m => Bind m where (>>-) :: m a -> (a -> m b) -> m b join :: m (m a) -> m a (-<<) :: Bind m => (a -> m b) -> m a -> m b (-<-) :: Bind m => (b -> m c) -> (a -> m b) -> a -> m c (->-) :: Bind m => (a -> m b) -> (b -> m c) -> a -> m c apDefault :: Bind f => f (a -> b) -> f a -> f b returning :: Functor f => f a -> (a -> b) -> f b Functors class Functor f where The Functor class is used for types that can be mapped over. Instances of Functor should satisfy the following laws: fmap id == id fmap (f . g) == fmap f . fmap g The instances of Functor for lists, Maybe and IO satisfy these laws. Methods fmap :: (a -> b) -> f a -> f b (<$) :: a -> f b -> f a Replace all locations in the input with the same value. The default definition is fmap . const , but this may be overridden with a more efficient version. Instances Functor []   Functor IO   Functor ZipList   Functor Maybe   Functor Tree   Functor Seq   Functor ViewL   Functor ViewR   Functor IntMap   Functor Option   Functor NonEmpty   Functor Identity   Functor Id   Functor Elem   Functor FingerTree   Functor Node   Functor Digit   Functor Id   Functor ((->) r)   Functor ( Either a)   Functor ( (,) a)   Functor ( Const m)   Monad m => Functor ( WrappedMonad m)   Functor ( Map k)   Functor m => Functor ( MaybeT m)   Functor m => Functor ( ListT m)   Functor m => Functor ( IdentityT m)   Functor (StateR s)   Functor (StateL s)   Functor (State s)   Functor f => Functor ( MaybeApply f)   Functor f => Functor ( WrappedApplicative f)   Functor f => Functor (Act f)   Arrow a => Functor ( WrappedArrow a b)   Functor ( Cokleisli w a)   Functor m => Functor ( WriterT w m)   Functor m => Functor ( WriterT w m)   Functor m => Functor ( StateT s m)   Functor m => Functor ( StateT s m)   Functor m => Functor ( ReaderT r m)   Functor m => Functor ( ErrorT e m)   Functor ( ContT r m)   ( Functor f, Functor g) => Functor ( Compose f g)   ( Functor f, Functor g) => Functor ( Product f g)   Functor f => Functor ( Static f a)   Functor m => Functor ( RWST r w s m)   Functor m => Functor ( RWST r w s m)   (<$>) :: Functor f => (a -> b) -> f a -> f b An infix synonym for fmap . ($>) :: Functor f => f a -> b -> f b Source TODO: move into Data.Functor Applyable functors class Functor f => Apply f where Source A strong lax semi-monoidal endofunctor. This is equivalent to an Applicative without pure . Laws: associative composition: (.) <$> u <.> v <.> w = u <.> (v <.> w) Methods (<.>) :: f (a -> b) -> f a -> f b Source (.>) :: f a -> f b -> f b Source a .> b = const id $ a . b (<.) :: f a -> f b -> f a Source a . b = const <$ a . b Instances Apply []   Apply IO   Apply ZipList   Apply Maybe   Apply Tree   Apply Seq   Apply IntMap An IntMap is not Applicative , but it is an instance of Apply Apply Option   Apply NonEmpty   Apply Identity   Apply ((->) m)   Apply ( Either a)   Semigroup m => Apply ( (,) m)   Semigroup m => Apply ( Const m)   Monad m => Apply ( WrappedMonad m)   Ord k => Apply ( Map k) A Map is not Applicative , but it is an instance of Apply ( Bind m, Monad m) => Apply ( MaybeT m)   Apply m => Apply ( ListT m)   Apply w => Apply ( IdentityT w)   Apply f => Apply ( MaybeApply f)   Applicative f => Apply ( WrappedApplicative f)   Arrow a => Apply ( WrappedArrow a b)   Apply ( Cokleisli w a)   ( Apply m, Semigroup w) => Apply ( WriterT w m)   ( Apply m, Semigroup w) => Apply ( WriterT w m)   Bind m => Apply ( StateT s m)   Bind m => Apply ( StateT s m)   Apply m => Apply ( ReaderT e m)   ( Bind m, Monad m) => Apply ( ErrorT e m)   Apply ( ContT r m)   ( Apply f, Apply g) => Apply ( Compose f g)   ( Apply f, Apply g) => Apply ( Product f g)   Apply f => Apply ( Static f a)   ( Bind m, Semigroup w) => Apply ( RWST r w s m)   ( Bind m, Semigroup w) => Apply ( RWST r w s m)   (<..>) :: Apply w => w a -> w (a -> b) -> w b Source A variant of <.> with the arguments reversed. liftF2 :: Apply w => (a -> b -> c) -> w a -> w b -> w c Source Lift a binary function into a comonad with zipping liftF3 :: Apply w => (a -> b -> c -> d) -> w a -> w b -> w c -> w d Source Lift a ternary function into a comonad with zipping Wrappers newtype WrappedApplicative f a Source Wrap an Applicative to be used as a member of Apply Constructors WrapApplicative   Fields unwrapApplicative :: f a   Instances Functor f => Functor ( WrappedApplicative f)   Applicative f => Applicative ( WrappedApplicative f)   Alternative f => Alternative ( WrappedApplicative f)   Applicative f => Apply ( WrappedApplicative f)   Alternative f => Alt ( WrappedApplicative f)   Alternative f => Plus ( WrappedApplicative f)   newtype MaybeApply f a Source Transform a Apply into an Applicative by adding a unit. Constructors MaybeApply   Fields runMaybeApply :: Either (f a) a   Instances Functor f => Functor ( MaybeApply f)   Apply f => Applicative ( MaybeApply f)   Comonad f => Comonad ( MaybeApply f)   Extend f => Extend ( MaybeApply f)   Apply f => Apply ( MaybeApply f)   Bindable functors class Apply m => Bind m where Source A Monad sans return . Minimal definition: Either join or >>- If defining both, then the following laws (the default definitions) must hold: join = (>>- id) m >>- f = join (fmap f m) Laws: induced definition of <.>: f <.> x = f >>- (<$> x) Finally, there are two associativity conditions: associativity of (>>-): (m >>- f) >>- g == m >>- (\x -> f x >>- g) associativity of join: join . join = join . fmap join These can both be seen as special cases of the constraint that associativity of (->-): (f ->- g) ->- h = f ->- (g ->- h) Methods (>>-) :: m a -> (a -> m b) -> m b Source join :: m (m a) -> m a Source Instances Bind []   Bind IO   Bind Maybe   Bind Tree   Bind Seq   Bind IntMap An IntMap is a Applicative , but it is an instance of Bind Bind Option   Bind NonEmpty   Bind Identity   Bind ((->) m)   Bind ( Either a)   Semigroup m => Bind ( (,) m)   Monad m => Bind ( WrappedMonad m)   Ord k => Bind ( Map k) A Map is not a Monad , but it is an instance of Bind ( Bind m, Monad m) => Bind ( MaybeT m)   ( Bind m, Monad m) => Bind ( ListT m)   Bind m => Bind ( IdentityT m)   ( Bind m, Semigroup w) => Bind ( WriterT w m)   ( Bind m, Semigroup w) => Bind ( WriterT w m)   Bind m => Bind ( StateT s m)   Bind m => Bind ( StateT s m)   Bind m => Bind ( ReaderT e m)   ( Bind m, Monad m) => Bind ( ErrorT e m)   Bind ( ContT r m)   ( Bind f, Bind g) => Bind ( Product f g)   ( Bind m, Semigroup w) => Bind ( RWST r w s m)   ( Bind m, Semigroup w) => Bind ( RWST r w s m)   (-<<) :: Bind m => (a -> m b) -> m a -> m b Source (-<-) :: Bind m => (b -> m c) -> (a -> m b) -> a -> m c Source (->-) :: Bind m => (a -> m b) -> (b -> m c) -> a -> m c Source apDefault :: Bind f => f (a -> b) -> f a -> f b Source returning :: Functor f => f a -> (a -> b) -> f b Source Produced by Haddock version 2.10.0
2026-01-13T09:30:26
http://rb.zq1.de/compare.factory-20250131/
Index of /compare.factory-20250131 Index of /compare.factory-20250131 Name Last modified Size Description Parent Directory   -   build-compare-differed-builds-nachbau.txt 2025-01-31 11:59 2.8K   build-compare-differed-builds.txt 2025-01-31 11:59 1.8K   build-time.txt 2025-01-31 12:00 271K   build-verify-failed.txt 2025-01-31 11:59 2.8K   checksums.txt 2025-01-31 11:59 29M   differed-builds-nachbau.txt 2025-01-31 11:59 5.1K   differed-builds.txt 2025-01-31 11:59 3.5K   diffs/ 2025-02-15 15:30 -   failchecklist 2025-01-31 11:59 0   failed-builds.txt 2025-01-31 11:59 40   fast-builds.txt 2018-02-06 21:44 137K   giturls 2022-06-30 19:37 2.0M   giturls.good 2022-07-25 21:50 603K   graph.png 2025-01-31 12:16 11K   minor-differed-builds.txt 2025-01-31 11:59 1.6K   monthlyurl.txt 2024-12-31 10:42 4.9K   nachbau.swo 2025-01-11 19:20 0   nachbau.swp 2025-01-11 19:20 0   oscpr 2025-01-31 09:30 412K   oscpr.failed 2025-01-31 11:59 1.0K   rb-class-a.txt 2025-01-31 12:10 438K   rb-class-dvi.txt 2025-01-31 12:10 860   rb-class-edj.txt 2025-01-31 12:10 2.4K   rb-class-elc.txt 2025-01-31 12:10 26K   rb-class-gem.txt 2025-01-31 12:10 0   rb-class-html.txt 2025-01-31 12:10 17M   rb-class-jar.txt 2025-01-31 12:10 314K   rb-class-javadoc.txt 2025-01-31 12:10 92   rb-class-mono.txt 2025-01-31 12:10 44   rb-class-pdf.txt 2025-01-31 12:10 20K   rb-class-png.txt 2025-01-31 12:10 14K   rb-class-ps.txt 2025-01-31 12:10 486   rb-class-pyc.txt 2025-01-31 12:10 9.9K   rb-class-so.txt 2025-01-31 12:10 141K   rb-class-svg.txt 2025-01-31 12:10 1.4K   rb-class-tar.gz.txt 2025-01-31 12:10 0   rbbuild-tried.txt 2024-02-26 21:01 214K   rbplot.csv 2025-01-31 12:07 45K   rbstats.txt 2025-01-31 11:59 357   report-202009.txt 2020-10-01 15:54 1.4K   report-202010.txt 2020-10-30 06:27 1.6K   report-202011.txt 2020-11-28 01:18 1.6K   report-202012.txt 2020-12-31 13:46 1.5K   report-202101.txt 2021-01-29 15:17 1.5K   report-202102.txt 2021-02-27 07:17 1.6K   report-202103.txt 2021-03-28 11:24 1.1K   report-202104.txt 2021-04-29 03:40 2.1K   report-202105.txt 2021-06-01 05:52 1.8K   report-202106.txt 2021-06-30 09:54 1.6K   report-202107.txt 2021-07-30 12:07 1.2K   report-202108.txt 2021-08-30 18:31 1.3K   report-202109.txt 2021-09-30 19:55 1.3K   report-202110.txt 2021-10-31 11:20 1.1K   report-202111.txt 2021-11-30 20:43 1.1K   report-202112.txt 2021-12-31 20:19 1.3K   report-202201.txt 2022-01-31 13:53 1.1K   report-202203.txt 2022-03-31 22:21 1.5K   report-202204.txt 2022-04-28 15:12 2.4K   report-202205.txt 2022-06-01 16:52 2.1K   report-202206.txt 2022-07-04 19:48 1.3K   report-202207.txt 2022-07-31 21:29 5.5K   report-202208.txt 2022-09-01 21:02 4.7K   report-202209.txt 2022-10-05 12:29 4.8K   report-202210.txt 2022-11-03 19:52 4.0K   report-202212.txt 2023-01-09 13:12 12K   report-202301.txt 2023-01-31 09:40 11K   report-202301.txt.in 2023-01-31 09:40 934   report-202302.txt 2023-03-01 15:37 6.4K   report-202302.txt.in 2023-03-01 13:51 52   report-202303.txt 2023-04-02 18:50 5.5K   report-202303.txt.in 2023-04-02 19:32 120   report-202305.txt.in 2023-05-12 09:16 6   report-202306.txt.in 2023-06-30 14:11 402   report-202307.txt.in 2023-07-31 15:12 859   report-202308.txt.in 2023-08-30 09:06 261   report-202401.txt.in 2024-01-31 14:36 82   report-202402.txt.in 2024-02-28 13:31 80   report-202403.txt.in 2024-03-31 18:47 555   report-202404.txt.in 2024-04-30 08:06 874   report-202405.txt.in 2024-05-31 14:33 77   report-202406.txt.in 2024-06-30 21:48 311   report-202407.txt.in 2024-07-31 09:51 2.2K   report-202408.txt.in 2024-09-04 09:07 2.7K   report-202409.txt.in 2024-10-02 12:37 1.5K   report-202410.txt.in 2024-10-30 14:58 816   report-202411.txt 2024-11-29 17:26 11K   report-202411.txt.in 2024-11-29 17:25 493   report-202412.txt.in 2024-12-30 21:03 1.6K   report-202501.txt.in 2025-01-31 10:24 2.1K   report.txt 2025-01-31 11:34 13K   reproducible.json 2025-01-31 12:00 6.7M   status-FTBFS-builds.txt 2024-02-26 21:01 1.4K   status-notforus-builds.txt 2024-02-26 21:01 3.9K   status-succeeded-builds.txt 2024-02-26 21:01 209K   status-waitdep-builds.txt 2024-02-26 21:01 168   timebombs 2025-01-25 21:21 4.6K   unreproduciblerings.txt 2025-01-31 12:00 435  
2026-01-13T09:30:26
https://www.blogger.com/comment/fullpage/post/8072464059979174136/3141202997732626062
Post a Comment Blogger  Help Send feedback Sign in Blogger Comments on Hats off : don't count on finding me Collapse all comments Expand all comments Load more To leave a comment, click the button on the top of this page to sign in with Google. Comment as: Select Profile: Google Account  Edit Enter Comment Publish Preview This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply. ©2026 Blogger - Privacy Policy Google apps Main menu
2026-01-13T09:30:26
https://fedoraproject.org
Fedora Linux | The Fedora Project Skip to main content Fedora Logo Fedora Logo Text Get Fedora Get Fedora Editions Editions Our flagship Fedora Linux variants for different uses. Workstation The Fedora edition featuring the latest GNOME desktop. The Linux desktop you've been waiting for. KDE Plasma The Fedora edition featuring the latest KDE Plasma desktop. The next generation personal desktop. Server Run applications on bare metal or the cloud with a Linux server OS packed with the latest open source technology. Cloud Images optimized to run on cloud infrastructures. CoreOS An automatically-updating, minimal operating system for running containerized workloads securely and at scale. IoT A foundation for Internet of Things and Device Edge ecosystem. Atomic Desktops Atomic Desktops The Fedora desktop experiences you know with an additional layer of security and reliability. Silverblue Fedora Silverblue is an atomic desktop operating system aimed at good support for container-focused workflows. Kinoite Fedora Kinoite is an atomic KDE Plasma-based desktop. Sway Atomic Fedora Sway Atomic is an atomic Sway-based desktop. Budgie Atomic Fedora Budgie Atomic ships the popular Budgie desktop environment in an atomic fashion. COSMIC Atomic Fedora COSMIC Atomic ships the COSMIC desktop environment in an atomic fashion. Spins Spins The Desktop spins feature specific Linux Desktop Environments. Our official Workstation Edition uses the GNOME Desktop, but you can install Fedora preconfigured with any of the listed Desktop Environments. Xfce Desktop A complete and well integrated desktop. Cinnamon Desktop A modern desktop featuring a traditional GNOME user experience. MATE+Compiz Desktop A classic Fedora desktop with an additional 3D window manager. i3 Tiling WM Fedora Linux with the i3 Tiling Window Manager. LXQt Desktop A lightweight and well integrated LXQt desktop environment. LXDE Desktop A light, fast, and less resource hungry desktop environment SOAS Desktop Discover. Reflect. Share. Learn. Sway Tiling WM Fedora Linux with the Sway Tiling Window Manager Budgie Desktop Fedora Linux with the Budgie Desktop Miracle Desktop Fedora Linux with the Miracle Window Manager KDE Mobile Desktop A complete, modern desktop built using the KDE Plasma Desktop Environment. COSMIC Desktop Fedora Linux with the COSMIC Desktop Environment. Labs Labs The Labs are Fedora Linux set up with software bundles based on particular topics. Astronomy Powerful, completely open-source and free tools for amateur and professional astronomers. Design Suite Visual design, multimedia production, and publishing suite of free and open source creative tools. Games A collection and perfect showcase of the best games available in Fedora. Jam For audio enthusiasts and musicians who want to create, edit, and produce audio and music on Linux. Python Classroom A classroom lab for teaching the Python programming language to students. Scientific A bundle of open source scientific and numerical tools used in research. Security Lab A safe test environment to work on security auditing, forensics, system rescue and teaching security testing methodologies. Contributors Contributors Accounts & Apps Accounts & Apps These are some of the tools that you will use when contributing to the Fedora Project. Fedora Accounts To be granted access and be credited for your contributions, you will need a Fedora account. Do this first! Mote Most subprojects hold weekly meetings in chatrooms. Fedora's Zodbot listens in on these meetings and keeps the logs here. Badges This is where contributors are awarded tokens of recognition for their contributions. How many can you get! Elections Talented leaders are elected to oversee the Fedora Project and Fedora's subprojects. Fedocal It's Fedora's calendar! Mailing Lists Yes, they still exist. Infrastructure Status This page lists known and scheduled outages of Fedora Project services. Edit this website Edit fedoraproject.org using the content management system! Tip: Use the GitLab SSO link to open a session first. Packaging & Development Packaging & Development These are the tools and Git forges that Fedora packagers and developers use to build the Fedora systems. Fedora Forge This is a new open-source Git platform for Fedora's teams and special interest groups. It will eventually replace Pagure. Bugzilla Fedora Linux bugs are reported to Red Hat's bugzilla. Bodhi This is Fedora's official build system. It is used to create, test, and publish packages. Koji This is the software that builds Fedora's RPM packages. Copr This is an easy-to-use build system for the Fedora community. GitLab GitLab is one of Fedora's official version control systems. It supports single-sign-on with Fedora accounts. GitHub Many of Fedora's groups use this version control system. Pagure This is an open-source git forge that the Fedora Project uses. Package Sources This is an open-source git forge that hosts most of Fedora's source RPM packages. Sourcegraph You can use this to search for things in Fedora's code repositores. See the Fedora Magazine article for more info. Contributor Guides Contributor Guides These documentation pages are contributor-focused. They include Fedora's guidelines, teams, organizational structure, and legal docs. If you are looking for user guides (installation, getting started, etc.) check under the Help menu. Packaging Guidelines Learn about packaging for Fedora Linux — from both a policy and a technical perspective. Engineering Teams Learn about FESCo and Engineering subprojects, SIGs, Work Groups, and teams. Mindshare Teams Activities beyond engineering: Learn about the teams focused on Fedora's outreach, brand, & more. Fedora Council Learn about the Fedora Project governance. Program Management Release planning, scheduling, and status tracking. Diversity & Inclusion The goal of this initiative is to help foster diversity and inclusion in Fedora community. Legal Policies for licensing, trademarks, and other legal issues. Edit these docs Did you notice a glaring typo or a broken link in these docs? Click here to find out how you can help make it right! New Contributors New Contributors We are always excited to work with new contributors. If you're new to the project, check out these sites. Join SIG This is a special interest group that has formed for the sole purpose of helping new contributors get involved. Fedora is big and complex and it needs your help! Connections Connections News & Publications News & Publications These are sites where updates about new and upcomming events, releases, packages, and projects are likely to be posted. You might want to subscribe to some of these to get the notices in your inbox. News & Announcements The Fedora Project Leader likes to post things here. This forum also receives weekly updates from The Fedora Project Manager and the Community Platform Engineering team. Fedora Magazine Fedora new release and beta release announcements show up here first. Test Day announcements are also posted here. This blog also hosts articles contributed from users like you! Fedora Community Blog Announcements that are pertinent to Fedora developers and the Fedora infrastructure team tend to be posted here. Fedora Podcast The Fedora Podcast features interviews and talks with the people who make the Fedora community awesome! Fedora Mastodon Follow us on Mastodon! This is a great place to stay up to date on the latest in the Fedora community. Fedora Twitter Follow us on twitter! This is a great place to stay up to date on the latest in the Fedora community. Ask Fedora Ask Fedora This is Fedora's main forum for all project collaboration and user support. Also, if you have encountered a problem that might be a software bug, this is a good place to triage it with other users before escalating it to Red Hat's bugzilla reporting system. General Q&A If you need help installing, using, or customizing Fedora Linux, or have any other questions about the operating system or the Fedora Project, this is the place to ask! Workstation Use this link to focus on questions and answers about Fedora Workstation. KDE Plasma Use this link to focus on questions and answers about KDE Plasma. Server Use this link to focus on questions and answers about Fedora Server. Cloud Use this link to focus on questions and answers about Fedora Cloud. CoreOS Use this link to focus on questions and answers about Fedora CoreOS. IoT Use this link to focus on questions and answers about Fedora IoT (Internet of Things). GNOME Use this link to focus on questions and answers about the GNOME desktop environment. Installation Use this link to focus on questions and answers about installing Fedora Linux. Project Discussion Project Discussion These are some convenient links to the discussion threads for several of Fedora's larger subprojects and special interest groups. Workstation Use this link to connect with other Workstation contributors. KDE Plasma Use this link to connect with other KDE Plasma contributors. Server The Fedora Server edition working group Cloud The Fedora Cloud edition working group CoreOS The Fedora CoreOS working group IoT The Fedora IoT (Internet of Things) edition working group Silverblue The Fedora Silverblue team Kinoite The Fedora Kinoite team EPEL The Extra Packages for Enterprise Linux special interest group All Teams & Tags Fedora has lots of teams! Click here to see a more complete list. Social & Events Social & Events These are a few free-form communication channels and some links to information about Fedora's release parties and annual conferences. Fedorans regularly come together to celebrate our community and the hard work that we put into it! Flock To Fedora This is the Fedora Project's annual contributor conference. Don't miss this opportunity to meet other Fedora contributors in-person and find out what is happening in the project! The Water Cooler This is the proverbial office “water cooler”, where people gather for “break from work” conversation. Introduce yourself, have (friendly!) off-topic discussions, and socialize! Fedora Social The Fedora Social chat room is a place for Fedora community members to relax and talk about most any topics they wish. Extended Social Channels Beyond the official channels for Fedorans to communicate, community members are involved on other popular platforms as well! Check out IRC, Discord, Telegram, Reddit, and more! Week of Diversity This is a week in September where we highlight the contributions and experiences of women, lgbtq+, and bipoc in Fedora. Release Parties Fedora releases two major versions every year. We celebrate the hard work of our contributors virtually at each release. Help Help Ask Fedora Ask Fedora This is Fedora's main forum for all project collaboration and user support. Also, if you have encountered a problem that might be a software bug, this is a good place to triage it with other users before escalating it to Red Hat's bugzilla reporting system. General Q&A If you need help installing, using, or customizing Fedora Linux, or have any other questions about the operating system or the Fedora Project, this is the place to ask! Workstation Use this link to focus on questions and answers about Fedora Workstation. KDE Plasma Use this link to focus on questions and answers about KDE Plasma. Server Use this link to focus on questions and answers about Fedora Server. Cloud Use this link to focus on questions and answers about Fedora Cloud. CoreOS Use this link to focus on questions and answers about Fedora CoreOS. IoT Use this link to focus on questions and answers about Fedora IoT (Internet of Things). GNOME Use this link to focus on questions and answers about the GNOME desktop environment. Installation Use this link to focus on questions and answers about installing Fedora Linux. User Guides User Guides These are some introductory guides to help users get started with Fedora Linux. Downloading Fedora Linux How to select the appropriate download. Getting Started An in-depth guide to installing Fedora Linux. Upgrading Fedora Linux How to upgrade an existing Fedora Linux installation. HowTo Guides These HowTo guides have been created by Fedora's end users. Common Issues These are not guides. However, if you are having difficulty getting something to work, you should check here to see if it is a known issue. In some cases, workarounds are available. Documentation Documentation Over the years, Fedorans have created many sources of information about Fedora Linux and the Fedora Project. Fedora Docs This is the main index page for all of Fedora's Documentation. If you weren't able to find a direct link to what you were looking for in this site's menus, you can try searching from here. Fedora Quick Docs This is a collection of short HOWTO and FAQ-style documentation for Fedora users. Fedora Wiki This is primarily a collaboration tool for the community. Content that has been submitted here might be out of date and/or it might not have undergone the same level of scrutiny as the information on Fedora Docs. Fedora Magazine Fedora Magazine is a website that hosts promotional articles and short guides contributed from the community about free/libre and open-source software that runs on or works with the Fedora Linux operating system. Fedora Developer From mobile apps to web; from desktop to GUIs to CLI tools; create it all easily with Fedora. About About The Fedora Project is a community of people working together to build a free and open source software platform and to collaborate on and share user-focused solutions built on that platform. Or, in plain English, we make an operating system and we make it easy for you to do useful stuff with it. Fedora’s Mission and Foundations Languages Languages Translations Translations Pick a language to view this page in your language العربية Беларуская Bulgarian Català Čeština Deutsch English Español Persian Suomi Français Friulian Hebrew हिंदी Magyar Indonesian Italiano 日本語 Taqbaylit 한국어 Nederlands Norsk nynorsk Polski Português do Brasil Português русский Slovenščina српски Svenska Türkçe українська 简体中文 繁體中文 Vietnamese Ελληνικά Add a translation Add a translation We use weblate to translate our site. Please find relevant links below. Add translation How to use Weblate Fedora Logo Fedora Logo Text Get Fedora Editions Workstation KDE Plasma Server Cloud CoreOS IoT Atomic Desktops Silverblue Kinoite Sway Atomic Budgie Atomic COSMIC Atomic Spins Xfce Desktop Cinnamon Desktop MATE+Compiz Desktop i3 Tiling WM LXQt Desktop LXDE Desktop SOAS Desktop Sway Tiling WM Budgie Desktop Miracle Desktop KDE Mobile Desktop COSMIC Desktop Labs Astronomy Design Suite Games Jam Python Classroom Scientific Security Lab Contributors Accounts & Apps Fedora Accounts Mote Badges Elections Fedocal Mailing Lists Infrastructure Status Edit this website Packaging & Development Fedora Forge Bugzilla Bodhi Koji Copr GitLab GitHub Pagure Package Sources Sourcegraph Contributor Guides Packaging Guidelines Engineering Teams Mindshare Teams Fedora Council Program Management Diversity & Inclusion Legal Edit these docs New Contributors Join SIG Connections News & Publications News & Announcements Fedora Magazine Fedora Community Blog Fedora Podcast Fedora Mastodon Fedora Twitter Ask Fedora General Q&A Workstation KDE Plasma Server Cloud CoreOS IoT GNOME Installation Project Discussion Workstation KDE Plasma Server Cloud CoreOS IoT Silverblue Kinoite EPEL All Teams & Tags Social & Events Flock To Fedora The Water Cooler Fedora Social Extended Social Channels Week of Diversity Release Parties Help Ask Fedora General Q&A Workstation KDE Plasma Server Cloud CoreOS IoT GNOME Installation User Guides Downloading Fedora Linux Getting Started Upgrading Fedora Linux HowTo Guides Common Issues Documentation Fedora Docs Fedora Quick Docs Fedora Wiki Fedora Magazine Fedora Developer About Fedora’s Mission and Foundations Start of main content It's your Operating System. An innovative platform for hardware, clouds, and containers, built with love by you. 100% Free & Open Source Latest release 43 🎉 Fedora Linux 43 released! A Registered Digital Public Good Editions The leading Linux desktop Fedora Workstation is a polished, easy to use operating system for laptop and desktop computers, featuring GNOME Desktop and a complete set of tools for developers and makers of all kinds. Download Now Learn More The next generation personal desktop Fedora KDE Plasma Desktop is a customizable high-quality desktop built on the latest open source technology to provide an easy and flexible environment to make your computer more personal than ever before. Download Now Learn More A Community Server OS Fedora Server is a powerful, flexible operating system that includes the best and latest datacenter technologies. Download Now Learn More The solid edge foundation Fedora IoT provides a trusted open source platform as a strong foundation for IoT ecosystems. Download Now Learn More The lightweight VM environment Fedora Cloud edition is a powerful and minimal base operating system image with tailored images available for both public and many private cloud uses. Download Now Learn More The container optimized OS Fedora CoreOS is an automatically updating, minimal, container-focused operating system. Download Now Learn More Want more Fedora options? Atomic Desktops The Fedora desktop experiences you know with an additional layer of security and reliability. Learn More Fedora Spins If you prefer an alternative desktop environment such as Xfce, Cinnamon or MATE you can download a Fedora Spin for your preferred desktop environment and use that to install Fedora, pre-configured for the desktop environment of your choice. Learn more Fedora Labs Fedora Labs is a selection of curated bundles of purpose-driven software and content as curated and maintained by members of the Fedora Community. These may be installed as standalone full versions of Fedora or as add-ons to existing Fedora installations. Learn more Miscellaneous Downloads Here you will find the Minimal Fedora Linux image, Fedora's online installer, versions of Fedora Linux packaged as containers that can be run on other operating systems, BitTorrent links, and more. Learn more Support Resources Documentation Extensive documentation is available at the Fedora documentation page. Fedora Docs Support Get support from our community on the Fedora Discussion Forum. Fedora Discussion Chat Users and developers are available in the #fedora channel on Fedora Chat. Fedora Chat Editions Workstation KDE Plasma Server Cloud CoreOS IoT Atomic Desktops Silverblue Kinoite Sway Atomic Budgie Atomic COSMIC Atomic Spins Xfce Desktop Cinnamon Desktop MATE+Compiz Desktop i3 Tiling WM LXQt Desktop LXDE Desktop SOAS Desktop Sway Tiling WM Budgie Desktop Miracle Desktop KDE Mobile Desktop COSMIC Desktop Labs Astronomy Design Suite Games Jam Python Classroom Scientific Security Lab Languages العربية Беларуская Bulgarian Català Čeština Deutsch English Español Persian Suomi Français Friulian Hebrew हिंदी Magyar Indonesian Italiano 日本語 Taqbaylit 한국어 Nederlands Norsk nynorsk Polski Português do Brasil Português русский Slovenščina српски Svenska Türkçe українська 简体中文 繁體中文 Vietnamese Ελληνικά Privacy Statement Legal Code of Conduct Sponsors Help improve this website on the CMS or the GitLab repo Fedora is sponsored by Red Hat. Learn more about the relationship between Red Hat and Fedora.
2026-01-13T09:30:26
https://docs.asciidoctor.org/asciidoctorj/latest/syntax-highlighting/syntax-highlighter/
Syntax Highlighter API | Asciidoctor Docs Asciidoctor Docs In this project AsciiDoc Language Syntax Quick Reference Processing Asciidoctor Ruby Asciidoctor.js JavaScript AsciidoctorJ Java Extensions Add-on Converters PDF Ruby EPUB3 Ruby reveal.js Ruby, JavaScript Source Compilers Reducer Ruby, JavaScript Extended Syntax Asciidoctor Diagram Ruby Tooling Build Automation Maven Tools Java Gradle Plugin Java Asciidoclet Java Text Editors / Viewers Browser Extension IntelliJ Plugin Chat List --> Source Tweets AsciidoctorJ Distribution Installation Usage Command Line Interface Convert Documents The Asciidoctor Interface Conversion Options Locate Files Safe Modes Examples Converting to EPUB3 Ruby Runtime Register a Ruby Extension Logs Handling API Read the Document Tree Write a Custom Converter Extensions API AsciidoctorJ Conversion Process Overview Understanding the AST Classes Write an Extension Block Macro Processor Inline Macro Processor Block Processor Include Processor Preprocessor Postprocessor Treeprocessor Docinfo Processor Register Extensions Manually Registering Extensions with javaExtensionRegistry Bulk Extension Registration ( Extension Groups ) Automatically Loading Extensions Logging Syntax Highlighter API Implement a Syntax Highlighter Adapter Lifecycle of a SyntaxHighlighterAdapter Format the Source Block Element Link and Copy External Resources Static Syntax Highlighting During Conversion Invocation Order Automatically Load a Syntax Highlighter Help & Guides Updating to New Releases v3.0.x migration guide Extension Migration: 1.6.x to 2.0.x Extension Migration: 1.5.x to 1.6.x Running in Frameworks Using AsciidoctorJ in an OSGi environment Running AsciidoctorJ on WildFly Running AsciidoctorJ with Spring Boot Accessing the JRuby Instance Loading Ruby Libraries Loading External Gems with GEM_PATH Optimization Using a pre-release version Using a Snapshot Version Development Project Layout Local Development Develop in an IDE Continuous Integration AsciidoctorJ 3.0 AsciiDoc Asciidoctor 2.0 Asciidoctor.js 3.0 2.2 AsciidoctorJ 3.0 2.5 Asciidoctor PDF 2.3 2.2 2.1 2.0 Asciidoctor EPUB3 2.3 Asciidoctor reveal.js 5.0 4.1 Maven Tools 3.2 Gradle Plugin Suite 5.0 4.0 Asciidoclet 2.0 1.5.6 Asciidoctor Diagram 3.0.1 Browser Extension Community AsciidoctorJ Syntax Highlighter API 3.0 3.0 2.5 Edit this Page Syntax Highlighter API Asciidoctor supports a range of different syntax highlighters: Coderay, HighlightJs, Rouge, Pygments and Prettify. Since version 2.0.0 Asciidoctor also supports to adapt and plug in other syntax highlighters when rendering to HTML. AsciidoctorJ offers this as well since version 2.1.0. Adapting a syntax highlighter to Asciidoctor involves a subset of the following tasks: Include certain stylesheets and scripts into the resulting HTML document. Create stylesheet and script resources in the filesystem in case the document is rendered to a file and it’s converted with the attributes ':linkcss' and ':copycss'. Format the source block element, by wrapping it into <pre/> and <code/> elements with certain attributes. This means to convert the source text puts "Hello World" to the HTML <pre class="highlightme"><code>puts "Hello World"</code></pre> . Format the source text itself by mapping it to span elements. This means to convert the source text puts "Hello World" to the HTML <span class="id">puts</span> <span class="stringliteral">"Hello World"</span> . This result still has to be formatted, which usually means to wrap it in <pre/> and <code/> elements. To adapt to a certain syntax highlighter some of these tasks have to be implemented. The following sections show how to write an adapter for a custom syntax highlighter. Logging Implement a Syntax Highlighter Adapter Asciidoctor Home --> Docs Chat Source List (archive) @asciidoctor Copyright © 2026 Dan Allen, Sarah White, and individual Asciidoctor contributors. Except where noted, the content is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) license. The UI for this site is derived from the Antora default UI and is licensed under the MPL-2.0 license. Several icons are imported from Octicons and are licensed under the MIT license. AsciiDoc® and AsciiDoc Language™ are trademarks of the Eclipse Foundation, Inc. Thanks to our backers and contributors for helping to make this project possible. Additional thanks to: Authored in AsciiDoc . Produced by Antora and Asciidoctor .
2026-01-13T09:30:26
https://docs.asciidoctor.org/asciidoctorj/latest/project/project-layout/
Project Layout | Asciidoctor Docs Asciidoctor Docs In this project AsciiDoc Language Syntax Quick Reference Processing Asciidoctor Ruby Asciidoctor.js JavaScript AsciidoctorJ Java Extensions Add-on Converters PDF Ruby EPUB3 Ruby reveal.js Ruby, JavaScript Source Compilers Reducer Ruby, JavaScript Extended Syntax Asciidoctor Diagram Ruby Tooling Build Automation Maven Tools Java Gradle Plugin Java Asciidoclet Java Text Editors / Viewers Browser Extension IntelliJ Plugin Chat List --> Source Tweets AsciidoctorJ Distribution Installation Usage Command Line Interface Convert Documents The Asciidoctor Interface Conversion Options Locate Files Safe Modes Examples Converting to EPUB3 Ruby Runtime Register a Ruby Extension Logs Handling API Read the Document Tree Write a Custom Converter Extensions API AsciidoctorJ Conversion Process Overview Understanding the AST Classes Write an Extension Block Macro Processor Inline Macro Processor Block Processor Include Processor Preprocessor Postprocessor Treeprocessor Docinfo Processor Register Extensions Manually Registering Extensions with javaExtensionRegistry Bulk Extension Registration ( Extension Groups ) Automatically Loading Extensions Logging Syntax Highlighter API Implement a Syntax Highlighter Adapter Lifecycle of a SyntaxHighlighterAdapter Format the Source Block Element Link and Copy External Resources Static Syntax Highlighting During Conversion Invocation Order Automatically Load a Syntax Highlighter Help & Guides Updating to New Releases v3.0.x migration guide Extension Migration: 1.6.x to 2.0.x Extension Migration: 1.5.x to 1.6.x Running in Frameworks Using AsciidoctorJ in an OSGi environment Running AsciidoctorJ on WildFly Running AsciidoctorJ with Spring Boot Accessing the JRuby Instance Loading Ruby Libraries Loading External Gems with GEM_PATH Optimization Using a pre-release version Using a Snapshot Version Development Project Layout Local Development Develop in an IDE Continuous Integration AsciidoctorJ 3.0 AsciiDoc Asciidoctor 2.0 Asciidoctor.js 3.0 2.2 AsciidoctorJ 3.0 2.5 Asciidoctor PDF 2.3 2.2 2.1 2.0 Asciidoctor EPUB3 2.3 Asciidoctor reveal.js 5.0 4.1 Maven Tools 3.2 Gradle Plugin Suite 5.0 4.0 Asciidoclet 2.0 1.5.6 Asciidoctor Diagram 3.0.1 Browser Extension Community AsciidoctorJ Development Project Layout 3.0 3.0 2.5 Edit this Page Project Layout The project is structured as a multimodule Gradle build. The root folder is the root project and there are several subproject folders, each prefixed with asciidoctorj- . Each subproject produces a primary artifact (e.g., jar or zip) and its supporting artifacts (e.g., javadoc, sources, etc). The subprojects are as follows: asciidoctorj-api The common API for AsciidoctorJ. Other implementations for different platforms than JRuby may reuse and implement this API. Produces the asciidoctorj-api.jar asciidoctorj The main Java bindings for the Asciidoctor RubyGem (asciidoctor) running on JRuby. Also bundles optional RubyGems needed at runtime, such as coderay, tilt, haml and slim. Produces the asciidoctorj jar. asciidoctorj-distribution Produces the distribution zip that provides the standalone asciidoctorj command. asciidoctorj-documentation Contains code examples used for documentation that are run and tested during builds. When tests are modified the gradle task copyAllExamplesToDocs must be executed to update documentation required files in under /docs . asciidoctorj-arquillian-extension Bundles an Arquillian extension that allows to inject an Asciidoctor instance or other instances commonly used by Asciidoctor tests into a test case. asciidoctorj-test-support Contains some common test classes that are used by multiple other subprojects and the Arquillian extension. asciidoctorj-wildfly-integration-test WildFly integration tests. asciidoctorj-springboot-integration-test Spring Boot example app and integration tests. The Gradle build is partitioned into the following files: build.gradle gradle.properties settings.gradle gradle/ wrapper/ ... deploy.gradle deploySnapshot.gradle eclipse.gradle providedConfiguration.gradle publish.gradle sign.gradle asciidoctorj-arquillian-extension/ build.gradle asciidoctorj-api/ build.gradle asciidoctorj-core/ build.gradle asciidoctorj-distribution/ build.gradle asciidoctorj-documentation/ build.gradle asciidoctorj-test-support/ build.gradle asciidoctorj-wildfly-integration-test build.gradle This will publish the all artifacts that have a snapshot version number to oss.jfrog.org . Using a Snapshot Version Local Development Asciidoctor Home --> Docs Chat Source List (archive) @asciidoctor Copyright © 2026 Dan Allen, Sarah White, and individual Asciidoctor contributors. Except where noted, the content is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) license. The UI for this site is derived from the Antora default UI and is licensed under the MPL-2.0 license. Several icons are imported from Octicons and are licensed under the MIT license. AsciiDoc® and AsciiDoc Language™ are trademarks of the Eclipse Foundation, Inc. Thanks to our backers and contributors for helping to make this project possible. Additional thanks to: Authored in AsciiDoc . Produced by Antora and Asciidoctor .
2026-01-13T09:30:26
https://foldoc.org/spam
spam from FOLDOC Contents Help Random spam < messaging > 1. (From Hormel's Spiced Ham, via the Monty Python "Spam" song) To post irrelevant or inappropriate messages to one or more Usenet newsgroups , mailing lists , or other messaging system in deliberate or accidental violation of netiquette . It is possible to spam a newsgroup with one well- (or ill-) planned message, e.g. asking "What do you think of abortion?" on soc.women. This can be done by cross-post ing, e.g. any message which is crossposted to alt.rush-limbaugh and alt.politics.homosexuality will almost inevitably spam both groups. (Compare troll and flame bait ). Posting a message to a significant proportion of all newsgroups is a sure way to spam Usenet and become an object of almost universal hatred. Canter and Siegel spammed the net with their Green card post. If you see an article which you think is a deliberate spam, DO NOT post a follow-up - doing so will only contribute to the general annoyance. Send a polite message to the poster by private e-mail and CC it to "postmaster" at the same address. Bear in mind that the posting's origin might have been forged or the apparent sender's account might have been used by someone else without his permission. The word was coined as the winning entry in a 1937 competition to choose a name for Hormel Foods Corporation's "spiced meat" (now officially known as "SPAM luncheon meat"). Correspondant Bob White claims the modern use of the term predates Monty Python by at least ten years. He cites an editor for the Dallas Times Herald describing Public Relations as "throwing a can of spam into an electric fan just to see if any of it would stick to the unwary passersby." Usenet newsgroup: news.admin.net-abuse . See also netiquette . 2. (A narrowing of sense 1, above) To indiscriminately send large amounts of unsolicited e-mail meant to promote a product or service. Spam in this sense is sort of like the electronic equivalent of junk mail sent to "Occupant". In the 1990s, with the rise in commercial awareness of the net, there are actually scumbags who offer spamming as a "service" to companies wishing to advertise on the net. They do this by mailing to collections of e-mail addresses, Usenet news, or mailing lists. Such practises have caused outrage and aggressive reaction by many net users against the individuals concerned. 3. (Apparently a generalisation of sense 2, above) To abuse any network service or tool by for promotional purposes. "AltaVista is an index , not a promotional tool. Attempts to fill it with promotional material lower the value of the index for everyone. [...] We will disallow URL submissions from those who spam the index. In extreme cases, we will exclude all their pages from the index." -- Altavista . < jargon , programming > 4. To crash a program by overrunning a fixed-size buffer with excessively large input data. See also buffer overflow , overrun screw , smash the stack . < chat , games > 5. (A narrowing of sense 1, above) To flood any chat forum or Internet game with purposefully annoying text or macros. Compare Scrolling . Last updated: 2003-09-21 Nearby terms: spaghetti inheritance ♦ spaghetti with meatballs code ♦ spam ♦ spamdex ♦ spamming Try this search on Wikipedia , Wiktionary , Google , OneLook . Loading Tweet   Recent Updates     |     Missing Terms Updated: Thu, 28 Aug 2025 23:32:16 GMT 15284 entries Copyright Denis Howe 1985
2026-01-13T09:30:26
https://archlinux.org
Arch Linux Arch Linux Home Packages Forums Wiki GitLab Security AUR Download A simple, lightweight distribution You've reached the website for Arch Linux , a lightweight and flexible Linux® distribution that tries to Keep It Simple. Currently we have official packages optimized for the x86-64 architecture. We complement our official package sets with a community-operated package repository that grows in size and quality each and every day. Our strong community is diverse and helpful, and we pride ourselves on the range of skillsets and uses for Arch that stem from it. Please check out our forums and mailing lists to get your feet wet. Also glance through our wiki if you want to learn more about Arch. Learn more... Latest News NVIDIA 590 driver drops Pascal and lower support; main packages switch to Open Kernel Modules 2025-12-20 With the update to driver version 590, the NVIDIA driver no longer supports Pascal (GTX 10xx) GPUs or older. We will replace the nvidia package with nvidia-open , nvidia-dkms with nvidia-open-dkms , and nvidia-lts with nvidia-lts-open . Impact: Updating the NVIDIA packages on systems with Pascal, Maxwell, or older cards will fail to load the driver, which may result in a broken graphical environment. Intervention required for Pascal/older users: Users with GTX 10xx series and older cards must switch to the legacy proprietary branch to maintain support: Uninstall the official nvidia , nvidia-lts , or nvidia-dkms packages. Install nvidia-580xx-dkms from the AUR Users with Turing (20xx and GTX 1650 series) and newer GPUs will automatically transition to the open kernel modules on upgrade and require no manual intervention. .NET packages may require manual intervention 2025-12-11 The following packages may require manual intervention due to the upgrade from 9.0 to 10.0: aspnet-runtime aspnet-targeting-pack dotnet-runtime dotnet-sdk dotnet-source-built-artifacts dotnet-targeting-pack pacman may display the following error failed to prepare transaction (could not satisfy dependencies) for the affected packages. If you are affected by this and require the 9.0 packages, the following commands will update e.g. aspnet-runtime to aspnet-runtime-9.0: pacman -Syu aspnet-runtime-9.0 pacman -Rs aspnet-runtime waydroid >= 1.5.4-3 update may require manual intervention 2025-11-06 The waydroid package prior to version 1.5.4-2 (including aur/waydroid ) creates Python byte-code files (.pyc) at runtime which were untracked by pacman. This issue has been fixed in 1.5.4-3 , where byte-compiling these files is now done during the packaging process. As a result, the upgrade may conflict with the unowned files created in previous versions. If you encounter errors like the following during the update: error: failed to commit transaction (conflicting files) waydroid: /usr/lib/waydroid/tools/__pycache__/__init__.cpython-313.pyc exists in filesystem waydroid: /usr/lib/waydroid/tools/actions/__pycache__/__init__.cpython-313.pyc exists in filesystem waydroid: /usr/lib/waydroid/tools/actions/__pycache__/app_manager.cpython-313.pyc exists in filesystem You can safely overwrite … dovecot >= 2.4 requires manual intervention 2025-10-31 The dovecot 2.4 release branch has made breaking changes which result in it being incompatible with any <= 2.3 configuration file. Thus, the dovecot service will no longer be able to start until the configuration file was migrated, requiring manual intervention. For guidance on the 2.3-to-2.4 migration, please refer to the following upstream documentation: Upgrading Dovecot CE from 2.3 to 2.4 Furthermore, the dovecot 2.4 branch no longer supports their replication feature, it was removed. For users relying on the replication feature or who are unable to perform the 2.4 migration right now, we provide alternative … Recent service outages 2025-08-21 We want to provide an update on the recent service outages affecting our infrastructure. The Arch Linux Project is currently experiencing an ongoing denial of service attack that primarily impacts our main webpage, the Arch User Repository (AUR), and the Forums. We are aware of the problems that this creates for our end users and will continue to actively work with our hosting provider to mitigate the attack. We are also evaluating DDoS protection providers while carefully considering factors including cost, security, and ethical standards. To improve the communication around this issue we will provide regular updates on … Older News 2025-08-04 zabbix >= 7.4.1-2 may require manual intervention 2025-06-21 linux-firmware >= 20250613.12fe085f-5 upgrade requires manual intervention 2025-06-20 Plasma 6.4.0 will need manual intervention if you are on X11 2025-06-16 Transition to the new WoW64 wine and wine-staging 2025-04-17 Valkey to replace Redis in the [extra] Repository 2025-02-17 Cleaning up old repositories 2025-02-03 Glibc 2.41 corrupting Discord installation 2025-01-16 Critical rsync security release 3.4.0 2024-11-19 Providing a license for package sources 2024-09-14 Manual intervention for pacman 7.0.0 and local repositories required Package Search: Recent Updates ( more ) zed 0.218.7-1 x86_64 yabridge 5.1.1-6 x86_64 qtractor 1.5.11-2 x86_64 aqbanking 6.9.1-1 x86_64 clap 1.2.7-1 any gwenhywfar 5.14.1-1 x86_64 lib32-libjpeg-turbo 3.1.3-1 x86_64 libjpeg-turbo 3.1.3-1 x86_64 python-tomlkit 0.14.0-1 any hplip 1:3.25.8-4 x86_64 hawkeye 6.4.1-1 x86_64 python-pysmf 0.1.2-1 x86_64 python-solidpython 1.1.3-7 any libx86 1.1.1-1 x86_64 atuin 18.11.0-1 x86_64 Documentation Wiki Manual Pages Installation Guide Community Mailing Lists IRC Channels Planet Arch International Communities Support Donate T-shirts via Freewear T-shirts via HELLOTUX Tools Mirrorlist Updater Mirror List Mirror Status Development Getting involved Dev Blog Projects in Git Developer Wiki Package Groups Todo Lists ISO Release List Visualizations Differences Reports People Developers Package Maintainers Support Staff Developer Fellows Package Maintainer Fellows Support Staff Fellows Signing Master Keys More Resources Press Coverage Logos & Artwork News Archives RSS Feeds Copyright © 2002-2026 Judd Vinet , Aaron Griffin and Levente Polyák . The Arch Linux name and logo are recognized trademarks . Some rights reserved. The registered trademark Linux® is used pursuant to a sublicense from LMI, the exclusive licensee of Linus Torvalds, owner of the mark on a world-wide basis.
2026-01-13T09:30:26
http://www.google.com/intl/en/about/#menu
About Google: Our products, technology and company information - About Google Jump to Content About Products Company Info News Gemini 3 Flash: Bring any idea to life faster Our latest model with frontier intelligence built for speed can help you quickly learn, build and plan anything. Check it out Play silent looping video Pause silent looping video Explore our products and features across Search, Google Workspace and more Learn all about our leading AI models — and discover their capabilities See how we’re tackling some of the most challenging problems in computer science Play silent looping video Pause silent looping video Gmail in the Gemini era New features built with Gemini — like AI Inbox and AI Overviews — help make Gmail your personal, proactive inbox assistant. See what's coming Google around the globe Learn about Google's work and impact around the world. Explore Get the latest news from Google in your inbox Sign up to receive top stories from the week — from product announcements, to everyday tips. Subscribe Footer links Resources Blog Brand Resource Center Careers Contact us Help Center Investor Relations Locations Press resources Outreach and initiatives Accessibility Crisis Response Google.org Google for Health Grow with Google Learning Public Policy Sustainability Research and technology Google AI Google Cloud Google DeepMind Google for Developers Google Labs Google Research More about us Around the globe Human rights Safety Center Supplier responsibility Transparency Center Transparency Report Privacy Terms Cookies management controls Help English Bahasa Indonesia Deutsch Español Français Italiano Nederlands Português Türkçe polski العربية 中文 (繁體) 中文（简体） 日本語 한국어
2026-01-13T09:30:26
https://www.blogger.com/comment/fullpage/post/8072464059979174136/7098681385143947117
Post a Comment Blogger  Help Send feedback Sign in Blogger Comments on Type Synonyms Generalized : don't count on finding me Collapse all comments Expand all comments Load more To leave a comment, click the button on the top of this page to sign in with Google. Comment as: Select Profile: Google Account  Edit Enter Comment Publish Preview This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply. ©2026 Blogger - Privacy Policy Google apps Main menu
2026-01-13T09:30:26
https://github.com/jeremyevans/hanna/actions/workflows/ci.yml
CI · Workflow runs · jeremyevans/hanna · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / hanna Public forked from raggi/hanna Notifications You must be signed in to change notification settings Fork 15 Star 44 Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights Actions: jeremyevans/hanna Actions --> All workflows Workflows CI CI Show more workflows... Management Caches CI CI Actions Loading... Loading Sorry, something went wrong. Uh oh! There was an error while loading. Please reload this page . --> will be ignored since log searching is not yet available Show workflow options Create status badge Create status badge Loading Uh oh! There was an error while loading. Please reload this page . ci.yml --> will be ignored since log searching is not yet available 12 workflow runs 12 workflow runs Event Filter by Event Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching events. Status Filter by Status Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching statuses. Branch Filter by Branch Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching branches. Actor Filter by Actor Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching users. Add Ruby 4.0 to CI CI #29: Commit ed0bd01 pushed by jeremyevans 9m 27s master master 9m 27s View workflow file Use SimpleCov.add_filter block instead of string CI #28: Commit 8abe829 pushed by jeremyevans 1m 13s master master 1m 13s View workflow file Restrict erb version on JRuby 9.3 to hopefully fix CI CI #27: Commit 670172c pushed by jeremyevans 4m 8s master master 4m 8s View workflow file Add JRuby 10.0 to CI CI #26: Commit d745126 pushed by jeremyevans 4m 20s master master 4m 20s View workflow file Bump version to 1.5.1 CI #25: Commit 6393b42 pushed by jeremyevans 37s master master 37s View workflow file Fix usage with RDoc 6.13.1+ CI #24: Commit 79c453c pushed by jeremyevans 46s master master 46s View workflow file Switch rdoc task to normal rake task, avoid rdoc/task require CI #23: Commit 2b01458 pushed by jeremyevans 1m 13s master master 1m 13s View workflow file CI CI #22: by jeremyevans 1m 15s master master 1m 15s View workflow file Add Ruby 3.4 to CI CI #21: Commit a8d8971 pushed by jeremyevans 2m 10s master master 2m 10s View workflow file Limit rdoc version to <6.4 on Ruby <2.6 in CI CI #20: Commit f109533 pushed by jeremyevans 38s master master 38s View workflow file Try to fix CI failure on JRuby 9.3/9.4 CI #19: Commit 8584004 pushed by jeremyevans 32s master master 32s View workflow file Use -W:strict_unused_block when running tests on Ruby 3.4+ CI #18: Commit c1e3dc0 pushed by jeremyevans 1m 23s master master 1m 23s View workflow file You can’t perform that action at this time.
2026-01-13T09:30:26
https://lists.debian.org/debian-devel-announce/2015/02/msg00010.html
--> Debian Trademark team [ Date Prev ][ Date Next ] [ Thread Prev ][ Thread Next ] [ Date Index ] [ Thread Index ] Debian Trademark team To : debian-devel-announce@lists.debian.org Subject : Debian Trademark team From : Richard Hartmann < richih.mailinglist@gmail.com > Date : Tue, 17 Feb 2015 17:55:53 +0100 Message-id : < [🔎]   20150217165553.GA7023@eudyptes > Mail-followup-to : debian-devel@lists.debian.org Dear all, as Lucas is about to send out an official announcement, he asked us to send out a quick introduction of ourselves. Some of you may know that Debian has had an actual Trademark team for almost two years, now. Anyone requesting permission to use Debian's trademark or reporting violations will have interacted with us via trademark@debian.org. We were able to complete the ~6 month long process of registering Debian's swirl in the U.S. (inadvertently with "Debian" written below due to a label on the specimen being interpreted by the TM office as part of the mark). Currently, work is ongoing to get U.S registrations for: * Debian's swirl (without "Debian" written below) * The name "DebConf" Once we have the above, we will register international marks via the Madrid system. Contrary to Lucas' delegation, our team consists of (in alphabetical order of surname): - Brian Gupta - Richard Hartmann - Joe Healy (Debian Maintainer, thus not officially a full member yet) Richard on behalf of the Debian Trademark team Attachment: signature.asc Description: Digital signature Reply to: debian-devel-announce@lists.debian.org Richard Hartmann (on-list) Richard Hartmann (off-list) Prev by Date: DebConf15: Call for Sprints Next by Date: Delegation for the Trademark Team Previous by thread: DebConf15: Call for Sprints Next by thread: Delegation for the Trademark Team Index(es): Date Thread
2026-01-13T09:30:26
https://upsilon.cc/~zack/blog/posts/2010/06/debian_squeeze_artwork_contest/
debian squeeze artwork contest zack's home page / blog / posts / 2010 / 06 / debian squeeze artwork contest we want you for Squeeze artwork You might have heard that Debian is closing up on the forthcoming Squeeze release. In its aim to be "universal", Debian addresses several different kinds of users and Squeeze will be no exception. For several users, and in particular for desktop users , artworks do matter and initiatives like the one started by Valessio Brito are likely to improve their user experience. In essence, the initiative is a Debian Squeeze artwork "contest" where Debian enthusiasts skilled in graphics can contribute themes and propose them to become the official/default theme for Debian Squeeze. So, are you a Debian enthusiast that would like to help Debian by putting into use your graphic skills? This is a big chance to do that! Before going forward, please check the rather precise requirements that Valessio prepared and check some of the already submitted proposals. Good luck! Tags: artwork debian lang/english planet-debian Copyright © 2007-2022 by Stefano Zacchiroli <zack@upsilon.cc> Homepage by Stefano Zacchiroli is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License . Last edited Tue 15 Jun 2010 10:54:52 AM CEST Tue 15 Jun 2010 10:54:52 AM CEST -->
2026-01-13T09:30:26
https://www.brainspl.at/contact/#ht-content
Contact - Skip to content Home About Us Imprint Contact Home About Us Imprint Contact Contact Home Contact Name: * Email Address: * Subject: * Message: * 2026 Copyrights | brainspl.at Recent Posts Your Safety Checklist: Verifying Licenses and Fair Play at Online Casinos How to Choose the Right Online Casino in Malta How Venmo Changed the Finance Game This is why you should use Ruby on Rails The Creator of Ruby-on-Rails – Someone You Should Know! Categories Ruby on Rails Archives October 2025 June 2025 March 2025 August 2021 June 2021 February 2021 January 2021
2026-01-13T09:30:26
https://www.debian.org/CD/http-ftp/#mirrors
Downloading Debian USB/CD/DVD images via HTTP/FTP Skip Quicknav Blog Micronews Planet Wiki Debian installation media for USB, CD, DVD / Downloading Debian USB/CD/DVD images via HTTP/FTP Debian on CD FAQ Network Install Live images Buy CDs or DVDs Download Download via HTTP/FTP Download with Torrent Download with Jigdo Rsync Mirrors Verify Downloading Debian USB/CD/DVD images via HTTP/FTP The following Debian images are available for download: Official USB/CD/DVD images of the stable release Official USB/CD/DVD images of the testing distribution ( regenerated weekly ) See also: A complete list of debian-cd/ mirrors For network install images, see the network install page. For images of the testing release, see the Debian-Installer page . Official USB/CD/DVD images of the stable release To install Debian on a machine without an Internet connection, it's possible to use CD/USB images (700 MB each) or DVD/USB images (4.7 GB each). Download the first CD/USB or DVD/USB image file, write it using a USB/CD/DVD recorder, and then reboot from that. The first USB/CD/DVD disk contains all the files necessary to install a standard Debian system. CD/USB The following links point to image files which are up to 700 MB in size, making them suitable for writing to normal CD-R(W) media: amd64 arm64 armhf ppc64el riscv64 s390x DVD/USB The following links point to image files which are up to 4.7 GB in size, making them suitable for writing to normal DVD-R/DVD+R and similar media: amd64 arm64 armhf ppc64el riscv64 s390x source Be sure to have a look at the documentation before you install. If you read only one document before installing, read our Installation Howto , a quick walkthrough of the installation process. Other useful documentation includes: Installation Guide , the detailed installation instructions Debian-Installer Documentation , including the FAQ with common questions and answers Debian-Installer Errata , the list of known problems in the installer Registered mirrors of the debian-cd archive Note that some mirrors may not be up to date — the current release of the "stable" USB/CD/DVD images is 13.3.0 . If in doubt, use the primary CD image server in Sweden, Are you interested in offering the Debian CD images on your mirror? If yes, see the instructions on how to set up a CD image mirror . Argentina: debian.xfree.com.ar: HTTP Armenia: mirrors.asnet.am: HTTP Australia: debian.mirror.digitalpacific.com.au: HTTP Australia: mirror.overthewire.com.au: HTTP Austria: debian.anexia.at: HTTP Belarus: mirror.datacenter.by: HTTP Belgium: debian-mirror.behostings.net: HTTP Belgium: mirror.as35701.net: HTTP Brazil: debian.c3sl.ufpr.br: HTTP Brazil: debian.pop-sc.rnp.br: HTTP China: mirror.lzu.edu.cn: HTTP Croatia: debian.carnet.hr: HTTP Czech Republic: debian-cd.mirror.web4u.cz: HTTP Czech Republic: debian.nic.cz: HTTP Czech Republic: debian.superhosting.cz: HTTP Czech Republic: mirror.dkm.cz: HTTP Denmark: mirrors.dotsrc.org: HTTP Denmark: mirrors.rackhosting.com: HTTP Ecuador: mirror.cedia.org.ec: HTTP France: debian.obspm.fr: HTTP France: deb.syxpi.fr: HTTP France: ftp.crifo.org: HTTP France: miroir.univ-lorraine.fr: HTTP Georgia: debian.grena.ge: HTTP Germany: debian-cd.repulsive.eu: HTTP Germany: debian.inf.tu-dresden.de: HTTP Germany: debian.netcologne.de: HTTP Germany: ftp.fau.de: HTTP Germany: ftp.gwdg.de: HTTP Germany: ftp.halifax.rwth-aachen.de: HTTP Germany: ftp.hosteurope.de: HTTP Germany: ftp-stud.hs-esslingen.de: HTTP Germany: ftp.uni-hannover.de: HTTP Germany: ftp.uni-stuttgart.de: HTTP Germany: mirror.23m.com: HTTP Germany: mirror.checkdomain.de: HTTP Germany: mirror.de.leaseweb.net: HTTP Hong Kong: mirror.xtom.com.hk: HTTP Hungary: ftp.bme.hu: HTTP Indonesia: kartolo.sby.datautama.net.id: HTTP Israel: debian.interhost.co.il: HTTP Italy: debian.connesi.it: HTTP Italy: giano.com.dist.unige.it: HTTP Japan: ftp.jaist.ac.jp: HTTP Japan: ftp.nara.wide.ad.jp: HTTP Japan: ftp.riken.jp: HTTP Japan: ftp.yz.yamagata-u.ac.jp: HTTP Korea: ftp.kaist.ac.kr: HTTP Korea: ftp.lanet.kr: HTTP Korea: mirror.siwoo.org: HTTP Latvia: debian.koyanet.lv: HTTP Lithuania: debian.mirror.vu.lt: HTTP Luxembourg: debian.mirror.root.lu: HTTP Mexico: lidsol.fi-b.unam.mx: HTTP Netherlands: debian.snt.utwente.nl: HTTP Netherlands: mirror.duocast.net: HTTP Netherlands: mirror.nl.datapacket.com: HTTP Netherlands: mirror.nl.leaseweb.net: HTTP New Caledonia: debian.lagoon.nc: HTTP New Caledonia: debian.nautile.nc: HTTP Poland: ftp.icm.edu.pl: HTTP Portugal: debian.uevora.pt: HTTP Portugal: ftp.rnl.tecnico.ulisboa.pt: HTTP Portugal: mirrors.up.pt: HTTP Romania: mirrors.pidginhost.com: HTTP Russia: ftp.psn.ru: HTTP Russia: mirror.corbina.net: HTTP Russia: mirror.mephi.ru: HTTP Russia: mirror.truenetwork.ru: HTTP Saudi Arabia: mirror.maeen.sa: HTTP South Africa: debian.saix.net: HTTP South Africa: ftp.is.co.za: HTTP Spain: debian.uvigo.es: HTTP Spain: ftp.caliu.cat: HTTP Spain: ftp.cica.es: HTTP Spain: mirror.raiolanetworks.com: HTTP Sweden: cdimage.debian.org: HTTP Sweden: ftp.acc.umu.se: HTTP Switzerland: debian.ethz.ch: HTTP Taiwan: debian.cs.nycu.edu.tw: HTTP Taiwan: ftp.ncnu.edu.tw: HTTP Taiwan: ftp.tku.edu.tw: HTTP Taiwan: mirror.twds.com.tw: HTTP Ukraine: debian.netforce.hosting: HTTP Ukraine: debian.volia.net: HTTP United Kingdom: debian-iso.mirror.anlx.net: HTTP United Kingdom: ftp.ticklers.org: HTTP United Kingdom: mirrorservice.org: HTTP United States: debian.osuosl.org: HTTP United States: mirror.cogentco.com: HTTP United States: mirror.keystealth.org: HTTP United States: mirrors.bloomu.edu: HTTP United States: mirrors.iu13.net: HTTP United States: mirrors.lug.mtu.edu: HTTP United States: mirrors.ocf.berkeley.edu: HTTP United States: mirror.steadfast.net: HTTP United States: mirror.us.leaseweb.net: HTTP United States: mirror.us.mirhosting.net: HTTP debian_on_cd faq net_install buy jigdo http_ftp This page is also available in the following languages: Select your language català dansk español français Italiano magyar Nederlands polski Português slovenčina suomi svenska Türkçe Русский (Russkij) українська (ukrajins'ka) 中文(简) 中文(HK) 中文(繁) 日本語 (Nihongo) česky 한국어 (Korean) How to set the default document language English-language public mailing list for CDs/DVDs: Debian CD team < debian-cd@lists.debian.org > Home About Social Contract Code of Conduct Free Software Legal Info Help Debian Getting Debian Network install CD/USB ISO images Pure Blends Debian Packages Developers' Corner News Project News Events Documentation Release Info Debian Wiki Support Debian International Security Information Bug reports Mailing Lists Site map Search The Debian Blog Debian Micronews Debian Planet Last Modified: Wed, Dec 31 07:52:56 UTC 2025   Last Built: Tue, Jan 13 07:26:10 UTC 2026 Copyright © 1997-2026 SPI and others; See license terms Debian is a registered trademark of Software in the Public Interest, Inc.
2026-01-13T09:30:26
https://lists.debian.org/debian-devel-announce/2015/02/msg00008.html
--> Bug Squashing Party in Portland, 2015-02-21 [ Date Prev ][ Date Next ] [ Thread Prev ][ Thread Next ] [ Date Index ] [ Thread Index ] Bug Squashing Party in Portland, 2015-02-21 To : debian-devel-announce@lists.debian.org , debian-portland-soc@pdx.debian.net Subject : Bug Squashing Party in Portland, 2015-02-21 From : Vagrant Cascadian < vagrant@debian.org > Date : Sat, 14 Feb 2015 10:56:54 -0800 Message-id : < [🔎]   874mqob9u1.fsf@aikidev.net > Mail-followup-to : debian-devel@lists.debian.org We'll be squashing bugs in Portland, Oregon on Saturday, February 21st, noon to 5pm! https://wiki.debian.org/BSP/2015/02/us/Portland Thanks to Ctrl-H for hosting us! http://ctrlh.org Please join us in adventures leading to the Jessie release! live well, vagrant Attachment: signature.asc Description: PGP signature Reply to: debian-devel-announce@lists.debian.org Vagrant Cascadian (on-list) Vagrant Cascadian (off-list) Prev by Date: Reproducible Builds — proof of concept successful for 83% of all sources in main Next by Date: DebConf15: Call for Sprints Previous by thread: Reproducible Builds — proof of concept successful for 83% of all sources in main Next by thread: DebConf15: Call for Sprints Index(es): Date Thread
2026-01-13T09:30:26
http://rb.zq1.de/?C=S;O=A
Index of / Index of / Name Last modified Size Description RBOS/ 2025-06-06 16:46 -   compare.factory-20190113/ 2019-01-25 13:38 -   compare.factory-20190125/ 2019-02-11 09:27 -   compare.factory-20190211/ 2019-02-28 10:57 -   compare.factory-20190228/ 2019-03-14 13:47 -   compare.factory-20190314/ 2019-03-26 13:56 -   compare.factory-20190326/ 2019-04-05 14:03 -   compare.factory-20190405/ 2019-04-29 12:43 -   compare.factory-20190429/ 2019-05-08 15:15 -   compare.factory-20190508/ 2019-05-28 11:18 -   compare.factory-20190528/ 2019-06-12 13:39 -   compare.factory-20190612/ 2019-06-26 13:43 -   compare.factory-20190626/ 2019-07-13 04:02 -   compare.factory-20190713/ 2019-07-26 10:51 -   compare.factory-20190726/ 2019-08-20 15:49 -   compare.factory-20190824/ 2019-09-26 09:15 -   compare.factory-20190926/ 2019-10-28 14:17 -   compare.factory-20191028/ 2019-11-29 14:45 -   compare.factory-20191129/ 2019-12-23 08:54 -   compare.factory-20191223/ 2020-01-27 10:14 -   compare.factory-20210129/ 2021-10-31 19:45 -   compare.factory-20210227/ 2021-09-30 19:41 -   compare.factory-20210328/ 2021-07-31 15:04 -   compare.factory-20210428/ 2025-12-31 15:52 -   compare.factory-20210531/ 2021-06-30 09:37 -   compare.factory-20210630/ 2021-07-30 12:09 -   compare.factory-20210730/ 2021-08-30 17:13 -   compare.factory-20210830/ 2021-09-30 19:41 -   compare.factory-20210930/ 2021-10-31 19:45 -   compare.factory-20211031/ 2022-03-31 21:57 -   compare.factory-20211130/ 2022-03-01 09:07 -   compare.factory-20211231/ 2025-12-31 15:52 -   compare.factory-20220131/ 2022-01-31 14:10 -   compare.factory-20220301/ 2022-03-01 10:33 -   compare.factory-20220331/ 2022-04-28 15:51 -   compare.factory-20220428/ 2022-04-28 18:48 -   compare.factory-20220601/ 2022-06-01 16:56 -   compare.factory-20220704/ 2022-07-04 20:07 -   compare.factory-20220731/ 2022-07-31 21:35 -   compare.factory-20220901/ 2024-10-30 16:17 -   compare.factory-20221005/ 2022-10-05 12:36 -   compare.factory-20221103/ 2022-11-03 21:42 -   compare.factory-20221212/ 2023-01-09 15:27 -   compare.factory-20230109/ 2023-01-09 15:27 -   compare.factory-20230131/ 2023-02-15 18:10 -   compare.factory-20230301/ 2023-03-01 15:44 -   compare.factory-20230402/ 2023-04-02 19:13 -   compare.factory-20230502/ 2023-04-12 12:06 -   compare.factory-20230602/ 2023-06-30 17:15 -   compare.factory-20230630/ 2024-10-30 16:17 -   compare.factory-20230731/ 2023-07-31 16:25 -   compare.factory-20230830/ 2023-12-04 08:54 -   compare.factory-20231208/ 2023-12-08 09:15 -   compare.factory-20231209/ 2023-12-19 12:13 -   compare.factory-20231231/ 2024-01-30 10:59 -   compare.factory-20240131/ 2024-01-31 19:12 -   compare.factory-20240228/ 2024-03-31 19:04 -   compare.factory-20240331/ 2024-03-31 19:08 -   compare.factory-20240430/ 2024-05-31 14:48 -   compare.factory-20240531/ 2024-05-31 14:51 -   compare.factory-20240630/ 2024-10-30 16:17 -   compare.factory-20240731/ 2024-09-04 09:30 -   compare.factory-20240904/ 2024-09-16 15:18 -   compare.factory-20241002/ 2024-10-02 13:50 -   compare.factory-20241030/ 2024-10-30 16:17 -   compare.factory-20241129/ 2024-11-29 17:34 -   compare.factory-20241231/ 2025-01-30 07:53 -   compare.factory-20250131/ 2025-02-15 15:30 -   compare.factory-20250228/ 2025-03-31 21:29 -   compare.factory-20250331/ 2025-03-31 21:30 -   compare.factory-20250430/ 2025-04-30 11:47 -   compare.factory-20250529/ 2025-05-29 07:56 -   compare.factory-20250702/ 2025-07-02 09:48 -   compare.factory-20250731/ 2025-07-31 19:08 -   compare.factory-20250901/ 2025-09-01 15:46 -   compare.factory-20251001/ 2025-10-01 09:02 -   compare.factory-20251103/ 2025-11-03 12:18 -   compare.factory-20251129/ 2025-11-29 20:37 -   compare.factory-20251231/ 2025-12-31 15:52 -   compare.factory/ 2025-12-31 15:52 -   images/ 2020-09-07 06:12 -   leap/ 2023-06-08 15:11 -   old/ 2018-09-28 05:45 -   other/ 2025-11-21 08:52 -   patches/ 2018-08-08 17:17 -   pkg/ 2019-04-11 11:08 -   presentation/ 2021-11-09 18:27 -   rbo/ 2024-03-05 12:38 -   rbos/ 2024-12-14 20:55 -   scripts/ 2021-06-01 05:06 -   sle/ 2024-05-23 13:58 -   spec/ 2024-03-31 20:13 -   temp/ 2025-07-29 11:53 -   robots.txt-20180625 2018-06-25 16:41 26   README.txt 2017-04-10 22:24 161   compare.factory-2019.tar.zstd 2021-06-11 20:39 136M   compare.factory-2018.tar.zstd 2021-06-11 18:09 330M   compare.factory-2020.tar.zstd 2024-03-09 21:49 428M   compare.factory-2017.tar.zstd 2021-06-11 16:54 1.2G  
2026-01-13T09:30:26
http://hackage.haskell.org/packages/preferred
Preferred versions | Hackage Hackage :: [Package] Home Search   Browse What's new Upload User accounts Preferred versions ADPfusion Preferred ranges: none Deprecated versions: 0.4.0.0 Calculated range: <0.4.0.0 || >0.4.0.0 AFSM Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.1.0, 0.1.1.1, 0.1.1.2, 0.1.1.3, 0.1.2.0 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.1.0 || >0.1.1.0 && <0.1.1.1 || >0.1.1.1 && <0.1.1.2 || >0.1.1.2 && <0.1.1.3 || >0.1.1.3 && <0.1.2.0 || >0.1.2.0 AesonBson Preferred ranges: none Deprecated versions: 0.2.0, 0.2.1 Calculated range: <0.2.0 || >0.2.0 && <0.2.1 || >0.2.1 Agda Preferred ranges: none Deprecated versions: 2.5.1, 2.5.1.1, 2.5.4, 2.5.4.1, 2.6.0, 2.6.1, 2.6.1.1, 2.6.1.2, 2.6.4.2, 2.7.0 Calculated range: <2.5.1 || >2.5.1 && <2.5.1.1 || >2.5.1.1 && <2.5.4 || >2.5.4 && <2.5.4.1 || >2.5.4.1 && <2.6.0 || >2.6.0 && <2.6.1 || >2.6.1 && <2.6.1.1 || >2.6.1.1 && <2.6.1.2 || >2.6.1.2 && <2.6.4.2 || >2.6.4.2 && <2.7.0 || >2.7.0 Allure Preferred ranges: none Deprecated versions: 0.6.0.0, 0.6.1.0, 0.6.2.0, 0.7.0.0, 0.7.1.0, 0.8.0.0, 0.8.1.0, 0.8.1.1, 0.8.1.2, 0.9.3.0, 0.9.3.1, 0.9.3.2, 0.9.3.3, 0.9.4.0, 0.9.4.1 Calculated range: <0.6.0.0 || >0.6.0.0 && <0.6.1.0 || >0.6.1.0 && <0.6.2.0 || >0.6.2.0 && <0.7.0.0 || >0.7.0.0 && <0.7.1.0 || >0.7.1.0 && <0.8.0.0 || >0.8.0.0 && <0.8.1.0 || >0.8.1.0 && <0.8.1.1 || >0.8.1.1 && <0.8.1.2 || >0.8.1.2 && <0.9.3.0 || >0.9.3.0 && <0.9.3.1 || >0.9.3.1 && <0.9.3.2 || >0.9.3.2 && <0.9.3.3 || >0.9.3.3 && <0.9.4.0 || >0.9.4.0 && <0.9.4.1 || >0.9.4.1 BNFC Preferred ranges: none Deprecated versions: 2.6.0.0, 2.6.0.1, 2.6.0.2, 2.8.3, 2.9.6 Calculated range: <2.6.0.0 || >2.6.0.0 && <2.6.0.1 || >2.6.0.1 && <2.6.0.2 || >2.6.0.2 && <2.8.3 || >2.8.3 && <2.9.6 || >2.9.6 BNFC-meta Preferred ranges: none Deprecated versions: 0.1 Calculated range: <0.1 || >0.1 BiobaseXNA Preferred ranges: none Deprecated versions: 0.9.1.0 Calculated range: <0.9.1.0 || >0.9.1.0 BufferedSocket Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.1.0 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.1.0 || >0.1.1.0 Cabal Preferred ranges: none Deprecated versions: 1.24.1.0 Calculated range: <1.24.1.0 || >1.24.1.0 ChannelT Preferred ranges: none Deprecated versions: 0.0.0.1, 0.0.0.3, 0.0.0.5, 0.0.0.6 Calculated range: <0.0.0.1 || >0.0.0.1 && <0.0.0.3 || >0.0.0.3 && <0.0.0.5 || >0.0.0.5 && <0.0.0.6 || >0.0.0.6 ClickHaskell Preferred ranges: none Deprecated versions: 0.1.0, 0.2.0 Calculated range: <0.1.0 || >0.1.0 && <0.2.0 || >0.2.0 Color Preferred ranges: none Deprecated versions: 0.1.3 Calculated range: <0.1.3 || >0.1.3 FTGL Preferred ranges: none Deprecated versions: 1.4 Calculated range: <1.4 || >1.4 Facebook-Password-Hacker-Online-Latest-Version Preferred ranges: none Deprecated versions: 1.0.0 Calculated range: <1.0.0 || >1.0.0 FailT Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.0.1 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.0.1 || >0.1.0.1 Flint2 Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.0.4 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.0.1 || >0.1.0.1 && <0.1.0.2 || >0.1.0.2 && <0.1.0.3 || >0.1.0.3 && <0.1.0.4 || >0.1.0.4 Flint2-Examples Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.0.1 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.0.1 || >0.1.0.1 FloatingHex Preferred ranges: none Deprecated versions: 0.1, 0.2, 0.3 Calculated range: <0.1 || >0.1 && <0.2 || >0.2 && <0.3 || >0.3 Frames-streamly Preferred ranges: none Deprecated versions: 0.1.0.3, 0.1.1.0 Calculated range: <0.1.0.3 || >0.1.0.3 && <0.1.1.0 || >0.1.1.0 GOST34112012-Hash Preferred ranges: >0.1.1.1 Deprecated versions: none Calculated range: >0.1.1.1 GPipe Preferred ranges: none Deprecated versions: 1.0.0, 1.0.1, 1.0.2, 1.0.3, 1.0.4, 1.1.0, 1.1.1, 1.1.2, 1.1.3, 1.1.4, 1.1.5, 1.1.6, 1.1.7, 1.2.0, 1.2.1, 1.3, 1.3.1, 1.3.2, 1.4, 2.0, 2.0.1, 2.0.2, 2.1, 2.1.1, 2.1.2, 2.1.3, 2.1.4, 2.1.5, 2.1.6, 2.1.7, 2.2, 2.2.1, 2.2.2 Calculated range: <1.0.0 || >1.0.0 && <1.0.1 || >1.0.1 && <1.0.2 || >1.0.2 && <1.0.3 || >1.0.3 && <1.0.4 || >1.0.4 && <1.1.0 || >1.1.0 && <1.1.1 || >1.1.1 && <1.1.2 || >1.1.2 && <1.1.3 || >1.1.3 && <1.1.4 || >1.1.4 && <1.1.5 || >1.1.5 && <1.1.6 || >1.1.6 && <1.1.7 || >1.1.7 && <1.2.0 || >1.2.0 && <1.2.1 || >1.2.1 && <1.3 || >1.3 && <1.3.1 || >1.3.1 && <1.3.2 || >1.3.2 && <1.4 || >1.4 && <2.0 || >2.0 && <2.0.1 || >2.0.1 && <2.0.2 || >2.0.2 && <2.1 || >2.1 && <2.1.1 || >2.1.1 && <2.1.2 || >2.1.2 && <2.1.3 || >2.1.3 && <2.1.4 || >2.1.4 && <2.1.5 || >2.1.5 && <2.1.6 || >2.1.6 && <2.1.7 || >2.1.7 && <2.2 || >2.2 && <2.2.1 || >2.2.1 && <2.2.2 || >2.2.2 GPipe-GLFW Preferred ranges: >=1.4.1.4 Deprecated versions: none Calculated range: >=1.4.1.4 HPDF Preferred ranges: none Deprecated versions: 1.5.2 Calculated range: <1.5.2 || >1.5.2 HSet Preferred ranges: none Deprecated versions: 0.0.0, 0.0.1 Calculated range: <0.0.0 || >0.0.0 && <0.0.1 || >0.0.1 HSlippyMap Preferred ranges: none Deprecated versions: 0.1.0.0, 1.0, 1.2, 1.4, 1.6, 1.8, 2.0, 2.1 Calculated range: <0.1.0.0 || >0.1.0.0 && <1.0 || >1.0 && <1.2 || >1.2 && <1.4 || >1.4 && <1.6 || >1.6 && <1.8 || >1.8 && <2.0 || >2.0 && <2.1 || >2.1 HaTeX-qq Preferred ranges: none Deprecated versions: 0.0.0.0, 0.0.1.0 Calculated range: <0.0.0.0 || >0.0.0.0 && <0.0.1.0 || >0.0.1.0 HaXml Preferred ranges: none Deprecated versions: 1.25.10 Calculated range: <1.25.10 || >1.25.10 HaskellNet Preferred ranges: >=0.5.3 Deprecated versions: 0.5.2 Calculated range: >=0.5.3 Hs2lib Preferred ranges: none Deprecated versions: 0.5.7, 0.5.8 Calculated range: <0.5.7 || >0.5.7 && <0.5.8 || >0.5.8 HsOpenSSL Preferred ranges: none Deprecated versions: 0.11.7.3 Calculated range: <0.11.7.3 || >0.11.7.3 Hungarian-Munkres Preferred ranges: none Deprecated versions: 0.1.0, 0.1.1, 0.1.2 Calculated range: <0.1.0 || >0.1.0 && <0.1.1 || >0.1.1 && <0.1.2 || >0.1.2 IPv6Addr Preferred ranges: >=0.5 Deprecated versions: 0.1, 0.2, 0.3, 0.3.0.1, 0.4 Calculated range: >=0.5 LambdaDB Preferred ranges: none Deprecated versions: 0.0.0.5 Calculated range: <0.0.0.5 || >0.0.0.5 LambdaHack Preferred ranges: none Deprecated versions: 0.6.0.0, 0.6.1.0, 0.6.2.0, 0.7.0.0, 0.7.1.0, 0.8.0.0, 0.8.1.0, 0.8.1.1, 0.8.1.2, 0.9.3.0, 0.9.3.1, 0.9.4.0, 0.9.4.1 Calculated range: <0.6.0.0 || >0.6.0.0 && <0.6.1.0 || >0.6.1.0 && <0.6.2.0 || >0.6.2.0 && <0.7.0.0 || >0.7.0.0 && <0.7.1.0 || >0.7.1.0 && <0.8.0.0 || >0.8.0.0 && <0.8.1.0 || >0.8.1.0 && <0.8.1.1 || >0.8.1.1 && <0.8.1.2 || >0.8.1.2 && <0.9.3.0 || >0.9.3.0 && <0.9.3.1 || >0.9.3.1 && <0.9.4.0 || >0.9.4.0 && <0.9.4.1 || >0.9.4.1 Lambdajudge Preferred ranges: >=1.0.0.1 Deprecated versions: none Calculated range: >=1.0.0.1 LazyVault Preferred ranges: none Deprecated versions: 0.0, 0.0.1 Calculated range: <0.0 || >0.0 && <0.0.1 || >0.0.1 ListT Preferred ranges: none Deprecated versions: 0.1.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 Lykah Preferred ranges: none Deprecated versions: 0.0.1 Calculated range: <0.0.1 || >0.0.1 MissingH Preferred ranges: none Deprecated versions: 1.4.1.0, 1.5.0.0, 1.6.0.0 Calculated range: <1.4.1.0 || >1.4.1.0 && <1.5.0.0 || >1.5.0.0 && <1.6.0.0 || >1.6.0.0 MultiChor Preferred ranges: none Deprecated versions: 1.0.0.0 Calculated range: <1.0.0.0 || >1.0.0.0 Munkres-simple Preferred ranges: none Deprecated versions: 0.1.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 NTRU Preferred ranges: none Deprecated versions: 0.1.0.0, 1.0.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 && <1.0.0.0 || >1.0.0.0 NetSNMP Preferred ranges: none Deprecated versions: 0.3.2.4 Calculated range: <0.3.2.4 || >0.3.2.4 Octree Preferred ranges: none Deprecated versions: 0.5.4.1 Calculated range: <0.5.4.1 || >0.5.4.1 QuickCheck Preferred ranges: none Deprecated versions: 2.11, 2.11.1, 2.11.2, 2.12.6, 2.13, 2.15 Calculated range: <2.11 || >2.11 && <2.11.1 || >2.11.1 && <2.11.2 || >2.11.2 && <2.12.6 || >2.12.6 && <2.13 || >2.13 && <2.15 || >2.15 RLP Preferred ranges: <1 Deprecated versions: 1.1.1 Calculated range: <1 RandomDotOrg Preferred ranges: none Deprecated versions: 0.1, 0.2, 0.2.1 Calculated range: <0.1 || >0.1 && <0.2 || >0.2 && <0.2.1 || >0.2.1 SCalendar Preferred ranges: none Deprecated versions: 0.1.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 SConfig Preferred ranges: none Deprecated versions: 0.1.0.0, 0.2.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.2.0.0 || >0.2.0.0 SecureHash-SHA3 Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.0.1 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.0.1 || >0.1.0.1 ShellCheck Preferred ranges: none Deprecated versions: 0.4.0 Calculated range: <0.4.0 || >0.4.0 Spock Preferred ranges: >0.5 Deprecated versions: 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.2.0.0, 0.3.0.0, 0.4.0.0, 0.4.0.1, 0.4.1.0, 0.4.2.0, 0.4.2.1, 0.4.2.2, 0.6.1.1, 0.7.3.0, 0.10.0.0 Calculated range: >0.5 && <0.6.1.1 || >0.6.1.1 && <0.7.3.0 || >0.7.3.0 && <0.10.0.0 || >0.10.0.0 Spock-lucid Preferred ranges: none Deprecated versions: 0.1.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 StrictCheck Preferred ranges: none Deprecated versions: 0.2.1 Calculated range: <0.2.1 || >0.2.1 Villefort Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.0.2, 0.1.0.3, 0.1.0.4, 0.1.0.5, 0.1.0.6, 0.1.0.7, 0.1.0.8, 0.1.1.0, 0.1.1.1, 0.1.1.2, 0.1.1.3, 0.1.1.4, 0.1.1.5, 0.1.1.6, 0.1.1.7, 0.1.1.8, 0.1.1.9, 0.1.1.10, 0.1.1.11, 0.1.1.12, 0.1.1.13, 0.1.1.14, 0.1.1.15, 0.1.2.1, 0.1.2.2, 0.1.2.3, 0.1.2.4, 0.1.2.5, 0.1.2.6, 0.1.2.7, 0.1.2.8, 0.1.2.9, 0.1.2.10, 0.1.2.11, 0.1.2.12 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.0.2 || >0.1.0.2 && <0.1.0.3 || >0.1.0.3 && <0.1.0.4 || >0.1.0.4 && <0.1.0.5 || >0.1.0.5 && <0.1.0.6 || >0.1.0.6 && <0.1.0.7 || >0.1.0.7 && <0.1.0.8 || >0.1.0.8 && <0.1.1.0 || >0.1.1.0 && <0.1.1.1 || >0.1.1.1 && <0.1.1.2 || >0.1.1.2 && <0.1.1.3 || >0.1.1.3 && <0.1.1.4 || >0.1.1.4 && <0.1.1.5 || >0.1.1.5 && <0.1.1.6 || >0.1.1.6 && <0.1.1.7 || >0.1.1.7 && <0.1.1.8 || >0.1.1.8 && <0.1.1.9 || >0.1.1.9 && <0.1.1.10 || >0.1.1.10 && <0.1.1.11 || >0.1.1.11 && <0.1.1.12 || >0.1.1.12 && <0.1.1.13 || >0.1.1.13 && <0.1.1.14 || >0.1.1.14 && <0.1.1.15 || >0.1.1.15 && <0.1.2.1 || >0.1.2.1 && <0.1.2.2 || >0.1.2.2 && <0.1.2.3 || >0.1.2.3 && <0.1.2.4 || >0.1.2.4 && <0.1.2.5 || >0.1.2.5 && <0.1.2.6 || >0.1.2.6 && <0.1.2.7 || >0.1.2.7 && <0.1.2.8 || >0.1.2.8 && <0.1.2.9 || >0.1.2.9 && <0.1.2.10 || >0.1.2.10 && <0.1.2.11 || >0.1.2.11 && <0.1.2.12 || >0.1.2.12 Win32 Preferred ranges: none Deprecated versions: 2.5.4.0 Calculated range: <2.5.4.0 || >2.5.4.0 Win32-dhcp-server Preferred ranges: none Deprecated versions: 0.1, 0.2 Calculated range: <0.1 || >0.1 && <0.2 || >0.2 Win32-services Preferred ranges: none Deprecated versions: 0.2, 0.2.1, 0.2.2, 0.2.2.1 Calculated range: <0.2 || >0.2 && <0.2.1 || >0.2.1 && <0.2.2 || >0.2.2 && <0.2.2.1 || >0.2.2.1 XSaiga Preferred ranges: none Deprecated versions: 1.4.0.0 Calculated range: <1.4.0.0 || >1.4.0.0 Z-Botan Preferred ranges: none Deprecated versions: 0.1.1.0, 0.3.0.0 Calculated range: <0.1.1.0 || >0.1.1.0 && <0.3.0.0 || >0.3.0.0 Z-Data Preferred ranges: none Deprecated versions: 0.1.9.0, 0.8.0.0, 0.8.1.0, 0.8.2.0, 0.8.3.0, 0.8.4.0, 0.8.5.0, 0.8.6.0, 0.8.7.0, 1.3.0.0, 2.0.0.0 Calculated range: <0.1.9.0 || >0.1.9.0 && <0.8.0.0 || >0.8.0.0 && <0.8.1.0 || >0.8.1.0 && <0.8.2.0 || >0.8.2.0 && <0.8.3.0 || >0.8.3.0 && <0.8.4.0 || >0.8.4.0 && <0.8.5.0 || >0.8.5.0 && <0.8.6.0 || >0.8.6.0 && <0.8.7.0 || >0.8.7.0 && <1.3.0.0 || >1.3.0.0 && <2.0.0.0 || >2.0.0.0 Z-IO Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.1.0, 0.8.0.0, 0.8.1.0 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.1.0 || >0.1.1.0 && <0.8.0.0 || >0.8.0.0 && <0.8.1.0 || >0.8.1.0 Z-MessagePack Preferred ranges: none Deprecated versions: 0.4.0.0 Calculated range: <0.4.0.0 || >0.4.0.0 abnf Preferred ranges: none Deprecated versions: 0.1.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 accelerate-cuda Preferred ranges: none Deprecated versions: 0.15.1.0, 0.15.1.1 Calculated range: <0.15.1.0 || >0.15.1.0 && <0.15.1.1 || >0.15.1.1 acme-everything Preferred ranges: none Deprecated versions: 2015.4.15 Calculated range: <2015.4.15 || >2015.4.15 advent-of-code-api Preferred ranges: none Deprecated versions: 0.1.2.0, 0.1.2.1 Calculated range: <0.1.2.0 || >0.1.2.0 && <0.1.2.1 || >0.1.2.1 aern2-mp Preferred ranges: none Deprecated versions: 0.2.9.0 Calculated range: <0.2.9.0 || >0.2.9.0 aeson Preferred ranges: none Deprecated versions: 0.7.0.0, 0.7.0.1, 0.7.0.2, 0.7.0.3, 0.7.0.5, 0.8.0.0, 0.8.0.1, 0.10.0.0 Calculated range: <0.7.0.0 || >0.7.0.0 && <0.7.0.1 || >0.7.0.1 && <0.7.0.2 || >0.7.0.2 && <0.7.0.3 || >0.7.0.3 && <0.7.0.5 || >0.7.0.5 && <0.8.0.0 || >0.8.0.0 && <0.8.0.1 || >0.8.0.1 && <0.10.0.0 || >0.10.0.0 aeson-flatten Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.0.1 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.0.1 || >0.1.0.1 aeson-gadt-th Preferred ranges: none Deprecated versions: 0.2.3 Calculated range: <0.2.3 || >0.2.3 aeson-iproute Preferred ranges: >=0.2.1 Deprecated versions: 0.2 Calculated range: >=0.2.1 aeson-prefix Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.0.1 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.0.1 || >0.1.0.1 aeson-schemas Preferred ranges: none Deprecated versions: 1.0.0, 1.0.1 Calculated range: <1.0.0 || >1.0.0 && <1.0.1 || >1.0.1 aeson-tiled Preferred ranges: none Deprecated versions: 0.0.0.1, 0.0.2.0 Calculated range: <0.0.0.1 || >0.0.0.1 && <0.0.2.0 || >0.0.2.0 aftovolio Preferred ranges: >=0.8 Deprecated versions: 0.5.0.0 Calculated range: >=0.8 agda-language-server Preferred ranges: none Deprecated versions: 0.2.2.6.2 Calculated range: <0.2.2.6.2 || >0.2.2.6.2 airgql Preferred ranges: none Deprecated versions: 0.7.1.0, 0.7.1.1 Calculated range: <0.7.1.0 || >0.7.1.0 && <0.7.1.1 || >0.7.1.1 alarmclock Preferred ranges: >=0.5.0.1 Deprecated versions: 0.1.0.0, 0.5.0.0 Calculated range: >=0.5.0.1 alex Preferred ranges: none Deprecated versions: 3.2.7, 3.2.7.2 Calculated range: <3.2.7 || >3.2.7 && <3.2.7.2 || >3.2.7.2 alg Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.1.0, 0.1.1.1, 0.2.4.0 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.1.0 || >0.1.1.0 && <0.1.1.1 || >0.1.1.1 && <0.2.4.0 || >0.2.4.0 algebraic-graphs-io Preferred ranges: none Deprecated versions: 0.1.1.0, 0.1.2.0, 0.1.3.0, 0.1.4.0, 0.1.5.0, 0.1.5.1, 0.2, 0.3, 0.4 Calculated range: <0.1.1.0 || >0.1.1.0 && <0.1.2.0 || >0.1.2.0 && <0.1.3.0 || >0.1.3.0 && <0.1.4.0 || >0.1.4.0 && <0.1.5.0 || >0.1.5.0 && <0.1.5.1 || >0.1.5.1 && <0.2 || >0.2 && <0.3 || >0.3 && <0.4 || >0.4 algebraic-prelude Preferred ranges: none Deprecated versions: 0.1.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 algorithmic-composition-additional Preferred ranges: >=0.2 Deprecated versions: 0.1.0.0, 0.1.1.0 Calculated range: >=0.2 algorithmic-composition-basic Preferred ranges: >=0.6 Deprecated versions: 0.1.0.0, 0.1.1.0, 0.2.0.0, 0.2.1.0, 0.2.2.0, 0.3.0.0, 0.3.1.0, 0.4.0.0, 0.4.1.0, 0.5.0.0 Calculated range: >=0.6 algorithmic-composition-complex Preferred ranges: >=0.2 Deprecated versions: 0.1.0.0, 0.1.1.0 Calculated range: >=0.2 algorithmic-composition-overtones Preferred ranges: >=0.1.1 Deprecated versions: 0.1.0.0 Calculated range: >=0.1.1 almost-fix Preferred ranges: none Deprecated versions: 0.0.0, 0.0.1 Calculated range: <0.0.0 || >0.0.0 && <0.0.1 || >0.0.1 alternators Preferred ranges: none Deprecated versions: 0.1.1.0 Calculated range: <0.1.1.0 || >0.1.1.0 amazonka Preferred ranges: >=1.0.0 Deprecated versions: 0.3.3, 1.3.5, 1.4.4 Calculated range: >=1.0.0 && <1.3.5 || >1.3.5 && <1.4.4 || >1.4.4 amazonka-core Preferred ranges: >=0.3 Deprecated versions: 0.0.7, 1.3.3, 1.3.5 Calculated range: >=0.3 && <1.3.3 || >1.3.3 && <1.3.5 || >1.3.5 amazonka-iam-policy Preferred ranges: none Deprecated versions: 0.0.3.1 Calculated range: <0.0.3.1 || >0.0.3.1 amazonka-s3-streaming Preferred ranges: none Deprecated versions: 0.2.0.0 Calculated range: <0.2.0.0 || >0.2.0.0 amazonka-test Preferred ranges: none Deprecated versions: 1.3.5 Calculated range: <1.3.5 || >1.3.5 annotated-exception Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.1.0, 0.1.2.0 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.1.0 || >0.1.1.0 && <0.1.2.0 || >0.1.2.0 ansi-terminal Preferred ranges: none Deprecated versions: 1.0.1 Calculated range: <1.0.1 || >1.0.1 ansi-terminal-game Preferred ranges: none Deprecated versions: 0.7.0.0, 0.7.1.0 Calculated range: <0.7.0.0 || >0.7.0.0 && <0.7.1.0 || >0.7.1.0 antiope-athena Preferred ranges: none Deprecated versions: 3.1.0, 4.0.0, 4.0.1 Calculated range: <3.1.0 || >3.1.0 && <4.0.0 || >4.0.0 && <4.0.1 || >4.0.1 antiope-core Preferred ranges: none Deprecated versions: 3.1.0, 4.0.0, 4.0.1 Calculated range: <3.1.0 || >3.1.0 && <4.0.0 || >4.0.0 && <4.0.1 || >4.0.1 antiope-dynamodb Preferred ranges: none Deprecated versions: 3.1.0, 4.0.0, 4.0.1 Calculated range: <3.1.0 || >3.1.0 && <4.0.0 || >4.0.0 && <4.0.1 || >4.0.1 antiope-s3 Preferred ranges: none Deprecated versions: 3.1.0, 4.0.0, 4.0.1, 6.1.0 Calculated range: <3.1.0 || >3.1.0 && <4.0.0 || >4.0.0 && <4.0.1 || >4.0.1 && <6.1.0 || >6.1.0 antiope-sns Preferred ranges: none Deprecated versions: 3.1.0, 4.0.0, 4.0.1 Calculated range: <3.1.0 || >3.1.0 && <4.0.0 || >4.0.0 && <4.0.1 || >4.0.1 antiope-sqs Preferred ranges: none Deprecated versions: 3.1.0, 4.0.0, 4.0.1 Calculated range: <3.1.0 || >3.1.0 && <4.0.0 || >4.0.0 && <4.0.1 || >4.0.1 apecs-stm Preferred ranges: none Deprecated versions: 0.2 Calculated range: <0.2 || >0.2 apiary Preferred ranges: none Deprecated versions: 0.1.0.0, 0.4.3.1, 0.6.0.0, 0.12.0, 0.12.1, 1.4.1 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.4.3.1 || >0.4.3.1 && <0.6.0.0 || >0.6.0.0 && <0.12.0 || >0.12.0 && <0.12.1 || >0.12.1 && <1.4.1 || >1.4.1 apiary-cookie Preferred ranges: none Deprecated versions: 0.4.3.1 Calculated range: <0.4.3.1 || >0.4.3.1 apiary-memcached Preferred ranges: none Deprecated versions: 1.2.0 Calculated range: <1.2.0 || >1.2.0 apiary-persistent Preferred ranges: none Deprecated versions: 0.4.3.1 Calculated range: <0.4.3.1 || >0.4.3.1 apiary-purescript Preferred ranges: none Deprecated versions: 0.17.0 Calculated range: <0.17.0 || >0.17.0 apiary-redis Preferred ranges: none Deprecated versions: 1.5.0 Calculated range: <1.5.0 || >1.5.0 apiary-websockets Preferred ranges: none Deprecated versions: 0.4.3.1 Calculated range: <0.4.3.1 || >0.4.3.1 app-settings Preferred ranges: none Deprecated versions: 0.2.0.4 Calculated range: <0.2.0.4 || >0.2.0.4 arch-web Preferred ranges: none Deprecated versions: 0.3 Calculated range: <0.3 || >0.3 archive-sig Preferred ranges: none Deprecated versions: 0.2.1.0, 0.2.1.1 Calculated range: <0.2.1.0 || >0.2.1.0 && <0.2.1.1 || >0.2.1.1 arithmoi Preferred ranges: none Deprecated versions: 0.4.1.1 Calculated range: <0.4.1.1 || >0.4.1.1 arrow-extras Preferred ranges: none Deprecated versions: 0.1.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 ascii Preferred ranges: none Deprecated versions: 0.0.5 Calculated range: <0.0.5 || >0.0.5 ascii-char Preferred ranges: none Deprecated versions: 1.0.0.17 Calculated range: <1.0.0.17 || >1.0.0.17 ascii-holidays Preferred ranges: none Deprecated versions: 0.1.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 ascii-superset Preferred ranges: none Deprecated versions: 1.2.0.1 Calculated range: <1.2.0.1 || >1.2.0.1 astro Preferred ranges: none Deprecated versions: 0.4.1.0, 0.4.1.1 Calculated range: <0.4.1.0 || >0.4.1.0 && <0.4.1.1 || >0.4.1.1 atlassian-connect-core Preferred ranges: none Deprecated versions: 0.9.0.0 Calculated range: <0.9.0.0 || >0.9.0.0 atom-conduit Preferred ranges: none Deprecated versions: 0.3.1.0, 0.4.0.0, 0.4.0.1, 0.4.0.2, 0.9.0.0 Calculated range: <0.3.1.0 || >0.3.1.0 && <0.4.0.0 || >0.4.0.0 && <0.4.0.1 || >0.4.0.1 && <0.4.0.2 || >0.4.0.2 && <0.9.0.0 || >0.9.0.0 atomic-primops Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.0.2, 0.2.2, 0.2.2.1, 0.3, 0.4, 0.5 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.0.2 || >0.1.0.2 && <0.2.2 || >0.2.2 && <0.2.2.1 || >0.2.2.1 && <0.3 || >0.3 && <0.4 || >0.4 && <0.5 || >0.5 atp-haskell Preferred ranges: none Deprecated versions: 1.14.2 Calculated range: <1.14.2 || >1.14.2 ats-pkg Preferred ranges: none Deprecated versions: 3.4.0.6, 3.4.0.7 Calculated range: <3.4.0.6 || >3.4.0.6 && <3.4.0.7 || >3.4.0.7 attoparsec-ip Preferred ranges: none Deprecated versions: 0.0.0, 0.0.1, 0.0.2, 0.0.3, 0.0.4 Calculated range: <0.0.0 || >0.0.0 && <0.0.1 || >0.0.1 && <0.0.2 || >0.0.2 && <0.0.3 || >0.0.3 && <0.0.4 || >0.0.4 audacity Preferred ranges: none Deprecated versions: 0.0.1 Calculated range: <0.0.1 || >0.0.1 aura Preferred ranges: none Deprecated versions: 3.1.1, 3.1.3, 3.2.0, 3.2.1 Calculated range: <3.1.1 || >3.1.1 && <3.1.3 || >3.1.3 && <3.2.0 || >3.2.0 && <3.2.1 || >3.2.1 auto Preferred ranges: none Deprecated versions: 0.2.0.2, 0.3.0.0, 0.4.2.1 Calculated range: <0.2.0.2 || >0.2.0.2 && <0.3.0.0 || >0.3.0.0 && <0.4.2.1 || >0.4.2.1 auto-update Preferred ranges: none Deprecated versions: 0.2.5 Calculated range: <0.2.5 || >0.2.5 autoexporter Preferred ranges: none Deprecated versions: 0.1.0 Calculated range: <0.1.0 || >0.1.0 autom Preferred ranges: none Deprecated versions: 0.1.0.1, 0.1.0.2 Calculated range: <0.1.0.1 || >0.1.0.1 && <0.1.0.2 || >0.1.0.2 avif Preferred ranges: none Deprecated versions: 1.0.0.0 Calculated range: <1.0.0.0 || >1.0.0.0 avro Preferred ranges: none Deprecated versions: 0.3.1.1, 0.3.4.0, 0.5.0.0 Calculated range: <0.3.1.1 || >0.3.1.1 && <0.3.4.0 || >0.3.4.0 && <0.5.0.0 || >0.5.0.0 b9 Preferred ranges: none Deprecated versions: 0.5.31, 0.5.32, 0.5.34, 0.5.35, 0.5.44, 0.5.46, 0.5.60, 0.5.61, 0.5.62 Calculated range: <0.5.31 || >0.5.31 && <0.5.32 || >0.5.32 && <0.5.34 || >0.5.34 && <0.5.35 || >0.5.35 && <0.5.44 || >0.5.44 && <0.5.46 || >0.5.46 && <0.5.60 || >0.5.60 && <0.5.61 || >0.5.61 && <0.5.62 || >0.5.62 backprop Preferred ranges: none Deprecated versions: 0.2.6.0 Calculated range: <0.2.6.0 || >0.2.6.0 barbies Preferred ranges: none Deprecated versions: 1.1.2.0 Calculated range: <1.1.2.0 || >1.1.2.0 base-compat Preferred ranges: >=0.8.0 Deprecated versions: 0.8.1, 0.10.2, 0.10.3 Calculated range: >=0.8.0 && <0.8.1 || >0.8.1 && <0.10.2 || >0.10.2 && <0.10.3 || >0.10.3 base-orphans Preferred ranges: >=0.4.1 || ==0 Deprecated versions: 0.4.0, 0.4.2, 0.8.8, 0.8.8.1 Calculated range: ==0 || >=0.4.1 && <0.4.2 || >0.4.2 && <0.8.8 || >0.8.8 && <0.8.8.1 || >0.8.8.1 base-prelude Preferred ranges: none Deprecated versions: 0.1.18, 1.0.2, 1.1 Calculated range: <0.1.18 || >0.1.18 && <1.0.2 || >1.0.2 && <1.1 || >1.1 base32-bytestring Preferred ranges: none Deprecated versions: 0.2.0.0, 0.2.0.1 Calculated range: <0.2.0.0 || >0.2.0.0 && <0.2.0.1 || >0.2.0.1 base64 Preferred ranges: >=0.0.1 Deprecated versions: none Calculated range: >=0.0.1 base91 Preferred ranges: >=2 Deprecated versions: 0.1.0, 0.1.1, 0.2.0, 1.0.0, 1.0.1, 1.1.0, 2.0.0 Calculated range: >=2 && <2.0.0 || >2.0.0 beam-migrate Preferred ranges: none Deprecated versions: 0.5.3.0 Calculated range: <0.5.3.0 || >0.5.3.0 beam-postgres Preferred ranges: none Deprecated versions: 0.5.4.2 Calculated range: <0.5.4.2 || >0.5.4.2 beam-sqlite Preferred ranges: none Deprecated versions: 0.5.4.0 Calculated range: <0.5.4.0 || >0.5.4.0 beam-th Preferred ranges: >=0.2 Deprecated versions: 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3 Calculated range: >=0.2 bench Preferred ranges: none Deprecated versions: 1.0.0 Calculated range: <1.0.0 || >1.0.0 bencode Preferred ranges: none Deprecated versions: 0.6.1.0 Calculated range: <0.6.1.0 || >0.6.1.0 bencoding Preferred ranges: none Deprecated versions: 0.2.1.0 Calculated range: <0.2.1.0 || >0.2.1.0 bifunctors Preferred ranges: none Deprecated versions: 5.4 Calculated range: <5.4 || >5.4 binary Preferred ranges: none Deprecated versions: 0.9.0.0, 0.10.0.0 Calculated range: <0.9.0.0 || >0.9.0.0 && <0.10.0.0 || >0.10.0.0 binary-conduit Preferred ranges: none Deprecated versions: 1.2.1.1 Calculated range: <1.2.1.1 || >1.2.1.1 binary-io Preferred ranges: none Deprecated versions: 0.6.1 Calculated range: <0.6.1 || >0.6.1 binary-parsers Preferred ranges: none Deprecated versions: 0.1.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 binary-typed Preferred ranges: none Deprecated versions: 0.2.0.0, 0.2.0.1 Calculated range: <0.2.0.0 || >0.2.0.0 && <0.2.0.1 || >0.2.0.1 bindings-DSL Preferred ranges: none Deprecated versions: 1.0.18 Calculated range: <1.0.18 || >1.0.18 bindings-wlc Preferred ranges: >=0.1.0.3 Deprecated versions: 0.1.0.0, 0.1.0.1, 0.1.0.2 Calculated range: >=0.1.0.3 biohazard Preferred ranges: none Deprecated versions: 1.1.0 Calculated range: <1.1.0 || >1.1.0 biscuit-haskell Preferred ranges: none Deprecated versions: 0.1.0.0, 0.2.0.0, 0.3.0.0, 0.3.0.1 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.2.0.0 || >0.2.0.0 && <0.3.0.0 || >0.3.0.0 && <0.3.0.1 || >0.3.0.1 bitcoin-payment-channel Preferred ranges: >=0.6.0.1 Deprecated versions: 0.1.0.0, 0.1.1.0, 0.1.1.1, 0.1.1.2, 0.1.1.3, 0.2.0.0, 0.2.1.0, 0.2.2.0, 0.2.3.0, 0.2.3.1, 0.3.0.0, 0.3.0.1, 0.4.0.0, 0.4.0.1, 0.5.0.0, 0.5.0.1, 0.6.0.0 Calculated range: >=0.6.0.1 bitvec Preferred ranges: none Deprecated versions: 0.1, 0.1.0.1, 0.1.0.2, 1.0.1.0, 1.0.1.1, 1.0.1.2, 1.0.2.0, 1.0.3.0 Calculated range: <0.1 || >0.1 && <0.1.0.1 || >0.1.0.1 && <0.1.0.2 || >0.1.0.2 && <1.0.1.0 || >1.0.1.0 && <1.0.1.1 || >1.0.1.1 && <1.0.1.2 || >1.0.1.2 && <1.0.2.0 || >1.0.2.0 && <1.0.3.0 || >1.0.3.0 bitwise-enum Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.0.1, 0.1.0.2 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.0.1 || >0.1.0.1 && <0.1.0.2 || >0.1.0.2 bitx-bitcoin Preferred ranges: none Deprecated versions: 0.1.0.0, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.3.0.0, 0.4.0.0, 0.4.0.1, 0.5.0.0, 0.5.0.1, 0.6.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.2.0.0 || >0.2.0.0 && <0.2.0.1 || >0.2.0.1 && <0.2.0.2 || >0.2.0.2 && <0.3.0.0 || >0.3.0.0 && <0.4.0.0 || >0.4.0.0 && <0.4.0.1 || >0.4.0.1 && <0.5.0.0 || >0.5.0.0 && <0.5.0.1 || >0.5.0.1 && <0.6.0.0 || >0.6.0.0 bizzlelude Preferred ranges: none Deprecated versions: 1.0 Calculated range: <1.0 || >1.0 blas Preferred ranges: >=0.7.6 Deprecated versions: 0.4, 0.4.1, 0.5, 0.6, 0.7, 0.7.1, 0.7.2, 0.7.5 Calculated range: >=0.7.6 bloodhound Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.2.0.0, 0.3.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.0.1 || >0.1.0.1 && <0.1.0.2 || >0.1.0.2 && <0.2.0.0 || >0.2.0.0 && <0.3.0.0 || >0.3.0.0 bloomfilter-redis Preferred ranges: none Deprecated versions: 0.1.0.1 Calculated range: <0.1.0.1 || >0.1.0.1 bludigon Preferred ranges: none Deprecated versions: 0.1.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 bluefin-internal Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.1.0 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.1.0 || >0.1.1.0 bond Preferred ranges: none Deprecated versions: 0.11.0.0, 0.11.0.1, 0.11.0.2 Calculated range: <0.11.0.0 || >0.11.0.0 && <0.11.0.1 || >0.11.0.1 && <0.11.0.2 || >0.11.0.2 boots Preferred ranges: >=0.2 Deprecated versions: 0, 0.0.1, 0.0.2, 0.0.3 Calculated range: >=0.2 boots-app Preferred ranges: >=0.2 Deprecated versions: 0.1.0.1, 0.1.0.6 Calculated range: >=0.2 bower-json Preferred ranges: none Deprecated versions: 1.0.0 Calculated range: <1.0.0 || >1.0.0 box-tuples Preferred ranges: none Deprecated versions: 0.2.0.0 Calculated range: <0.2.0.0 || >0.2.0.0 brittany Preferred ranges: none Deprecated versions: 0.14.0.1 Calculated range: <0.14.0.1 || >0.14.0.1 broadcast-chan-conduit Preferred ranges: none Deprecated versions: 0.2.0, 0.2.0.1, 0.2.0.2 Calculated range: <0.2.0 || >0.2.0 && <0.2.0.1 || >0.2.0.1 && <0.2.0.2 || >0.2.0.2 bsb-http-chunked Preferred ranges: none Deprecated versions: 0.0.0.3 Calculated range: <0.0.0.3 || >0.0.0.3 buchhaltung Preferred ranges: none Deprecated versions: 0.0.2 Calculated range: <0.0.2 || >0.0.2 buffer-builder Preferred ranges: none Deprecated versions: 0.2.0.0, 0.2.0.1 Calculated range: <0.2.0.0 || >0.2.0.0 && <0.2.0.1 || >0.2.0.1 bugsnag-hs Preferred ranges: none Deprecated versions: 0.2.0.6 Calculated range: <0.2.0.6 || >0.2.0.6 bugzilla Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.0.1, 0.2.0.0, 0.2.1.0 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.0.1 || >0.1.0.1 && <0.2.0.0 || >0.2.0.0 && <0.2.1.0 || >0.2.1.0 byline Preferred ranges: none Deprecated versions: 1.1.0.0 Calculated range: <1.1.0.0 || >1.1.0.0 byteslice Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.3.0, 0.1.4.0, 0.2.0.0, 0.2.5.1 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.1.0 || >0.1.1.0 && <0.1.2.0 || >0.1.2.0 && <0.1.3.0 || >0.1.3.0 && <0.1.4.0 || >0.1.4.0 && <0.2.0.0 || >0.2.0.0 && <0.2.5.1 || >0.2.5.1 bytestring-builder Preferred ranges: none Deprecated versions: 0.10.4.0, 0.10.4.0.1 Calculated range: <0.10.4.0 || >0.10.4.0 && <0.10.4.0.1 || >0.10.4.0.1 bytestring-tree-builder Preferred ranges: none Deprecated versions: 0.2.7.4, 0.2.7.5 Calculated range: <0.2.7.4 || >0.2.7.4 && <0.2.7.5 || >0.2.7.5 bz2 Preferred ranges: >=0.1.0.1 Deprecated versions: 0.1.0.0 Calculated range: >=0.1.0.1 bz3 Preferred ranges: none Deprecated versions: 0.1.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 c2hs Preferred ranges: none Deprecated versions: 0.28.4 Calculated range: <0.28.4 || >0.28.4 cabal-appimage Preferred ranges: none Deprecated versions: 0.4.0.3 Calculated range: <0.4.0.3 || >0.4.0.3 cabal-bounds Preferred ranges: none Deprecated versions: 0.9.1, 1.0.3, 2.1.0, 2.1.1, 2.2.0 Calculated range: <0.9.1 || >0.9.1 && <1.0.3 || >1.0.3 && <2.1.0 || >2.1.0 && <2.1.1 || >2.1.1 && <2.2.0 || >2.2.0 cabal-cache Preferred ranges: none Deprecated versions: 1.0.5.0, 1.0.5.3, 1.0.5.5 Calculated range: <1.0.5.0 || >1.0.5.0 && <1.0.5.3 || >1.0.5.3 && <1.0.5.5 || >1.0.5.5 cabal-debian Preferred ranges: none Deprecated versions: 3.4 Calculated range: <3.4 || >3.4 cabal-helper Preferred ranges: none Deprecated versions: 0.5.2.0, 0.7.0.1, 0.8.1.0, 0.8.1.1 Calculated range: <0.5.2.0 || >0.5.2.0 && <0.7.0.1 || >0.7.0.1 && <0.8.1.0 || >0.8.1.0 && <0.8.1.1 || >0.8.1.1 cabal-lenses Preferred ranges: none Deprecated versions: 0.11.0 Calculated range: <0.11.0 || >0.11.0 cabal-rpm Preferred ranges: none Deprecated versions: 2.0.5, 2.1.4 Calculated range: <2.0.5 || >2.0.5 && <2.1.4 || >2.1.4 cabal2nix Preferred ranges: none Deprecated versions: 2.4, 2.7.1 Calculated range: <2.4 || >2.4 && <2.7.1 || >2.7.1 cabal2spec Preferred ranges: none Deprecated versions: 1.0, 2.0.0, 2.0.1, 2.0.2, 2.1, 2.1.1, 2.2.0, 2.2.1, 2.2.2, 2.4.2 Calculated range: <1.0 || >1.0 && <2.0.0 || >2.0.0 && <2.0.1 || >2.0.1 && <2.0.2 || >2.0.2 && <2.1 || >2.1 && <2.1.1 || >2.1.1 && <2.2.0 || >2.2.0 && <2.2.1 || >2.2.1 && <2.2.2 || >2.2.2 && <2.4.2 || >2.4.2 cacophony Preferred ranges: >=0.10 Deprecated versions: 0.1.0.0, 0.2.0, 0.3.0, 0.4.0, 0.5.0, 0.6.0, 0.7.0, 0.8.0, 0.9.0, 0.9.1, 0.9.2 Calculated range: >=0.10 calculator Preferred ranges: none Deprecated versions: 0.1.2.2, 0.1.4.0, 0.1.4.1, 0.1.5.0, 0.1.5.1, 0.1.5.2, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.2.2.0, 0.3.0.0, 0.4.0.0 Calculated range: <0.1.2.2 || >0.1.2.2 && <0.1.4.0 || >0.1.4.0 && <0.1.4.1 || >0.1.4.1 && <0.1.5.0 || >0.1.5.0 && <0.1.5.1 || >0.1.5.1 && <0.1.5.2 || >0.1.5.2 && <0.2.0.0 || >0.2.0.0 && <0.2.0.1 || >0.2.0.1 && <0.2.0.2 || >0.2.0.2 && <0.2.2.0 || >0.2.2.0 && <0.3.0.0 || >0.3.0.0 && <0.4.0.0 || >0.4.0.0 call Preferred ranges: none Deprecated versions: 0.2 Calculated range: <0.2 || >0.2 call-alloy Preferred ranges: none Deprecated versions: 0.2.0.0, 0.2.0.1, 0.2.0.3, 0.2.0.4, 0.2.0.5, 0.2.1.0, 0.3, 0.3.0.1, 0.3.0.2, 0.4, 0.4.0.1, 0.4.0.2, 0.5, 0.6, 0.6.0.1, 0.6.0.2 Calculated range: <0.2.0.0 || >0.2.0.0 && <0.2.0.1 || >0.2.0.1 && <0.2.0.3 || >0.2.0.3 && <0.2.0.4 || >0.2.0.4 && <0.2.0.5 || >0.2.0.5 && <0.2.1.0 || >0.2.1.0 && <0.3 || >0.3 && <0.3.0.1 || >0.3.0.1 && <0.3.0.2 || >0.3.0.2 && <0.4 || >0.4 && <0.4.0.1 || >0.4.0.1 && <0.4.0.2 || >0.4.0.2 && <0.5 || >0.5 && <0.6 || >0.6 && <0.6.0.1 || >0.6.0.1 && <0.6.0.2 || >0.6.0.2 camfort Preferred ranges: none Deprecated versions: 0.903 Calculated range: <0.903 || >0.903 carray Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.1.5, 0.1.5.1, 0.1.5.2 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.1 || >0.1.1 && <0.1.2 || >0.1.2 && <0.1.3 || >0.1.3 && <0.1.4 || >0.1.4 && <0.1.5 || >0.1.5 && <0.1.5.1 || >0.1.5.1 && <0.1.5.2 || >0.1.5.2 casing Preferred ranges: none Deprecated versions: 0.1.2.0 Calculated range: <0.1.2.0 || >0.1.2.0 category Preferred ranges: none Deprecated versions: 0.1.2.0 Calculated range: <0.1.2.0 || >0.1.2.0 cdeps Preferred ranges: >=0.1.2.4 Deprecated versions: none Calculated range: >=0.1.2.4 cereal-plus Preferred ranges: none Deprecated versions: 0.3.0 Calculated range: <0.3.0 || >0.3.0 cgi Preferred ranges: none Deprecated versions: 3000.0.0, 3001.0.0, 3001.1.0, 3001.1.3, 3001.1.4, 3001.1.5, 3001.1.5.1, 3001.1.5.2, 3001.1.6.0, 3001.1.7.0, 3001.1.7.1, 3001.1.7.2, 3001.1.7.3, 3001.1.8, 3001.1.8.1 Calculated range: <3000.0.0 || >3000.0.0 && <3001.0.0 || >3001.0.0 && <3001.1.0 || >3001.1.0 && <3001.1.3 || >3001.1.3 && <3001.1.4 || >3001.1.4 && <3001.1.5 || >3001.1.5 && <3001.1.5.1 || >3001.1.5.1 && <3001.1.5.2 || >3001.1.5.2 && <3001.1.6.0 || >3001.1.6.0 && <3001.1.7.0 || >3001.1.7.0 && <3001.1.7.1 || >3001.1.7.1 && <3001.1.7.2 || >3001.1.7.2 && <3001.1.7.3 || >3001.1.7.3 && <3001.1.8 || >3001.1.8 && <3001.1.8.1 || >3001.1.8.1 chart-svg Preferred ranges: none Deprecated versions: 0.5.0.0, 0.8.3.1 Calculated range: <0.5.0.0 || >0.5.0.0 && <0.8.3.1 || >0.8.3.1 chatter Preferred ranges: none Deprecated versions: 0.2.0.0 Calculated range: <0.2.0.0 || >0.2.0.0 check-cfg-ambiguity Preferred ranges: none Deprecated versions: 0.0.0.2 Calculated range: <0.0.0.2 || >0.0.0.2 check-pvp Preferred ranges: none Deprecated versions: 0.0.2 Calculated range: <0.0.2 || >0.0.2 checkers Preferred ranges: none Deprecated versions: 0.5.5 Calculated range: <0.5.5 || >0.5.5 chorale Preferred ranges: none Deprecated versions: 0.1.0, 0.1.1, 0.1.2, 0.1.3 Calculated range: <0.1.0 || >0.1.0 && <0.1.1 || >0.1.1 && <0.1.2 || >0.1.2 && <0.1.3 || >0.1.3 chorale-geo Preferred ranges: none Deprecated versions: 0.1.1 Calculated range: <0.1.1 || >0.1.1 chronologique Preferred ranges: none Deprecated versions: 0.2.1.0, 0.3.0.0, 0.3.0.1, 0.3.1.1, 0.3.1.3 Calculated range: <0.2.1.0 || >0.2.1.0 && <0.3.0.0 || >0.3.0.0 && <0.3.0.1 || >0.3.0.1 && <0.3.1.1 || >0.3.1.1 && <0.3.1.3 || >0.3.1.3 chs-cabal Preferred ranges: none Deprecated versions: 0.1.1.3 Calculated range: <0.1.1.3 || >0.1.1.3 clafer Preferred ranges: >=0.4.2.1 Deprecated versions: 0.3.5, 0.3.5.1, 0.3.6, 0.3.7, 0.3.8, 0.4.0, 0.4.1, 0.4.2 Calculated range: >=0.4.2.1 claferIG Preferred ranges: >=0.4.2.1 Deprecated versions: 0.3.5, 0.3.6, 0.4.0, 0.4.1, 0.4.2 Calculated range: >=0.4.2.1 claferwiki Preferred ranges: >=0.4.2.1 Deprecated versions: 0.3.5, 0.3.6, 0.4.0, 0.4.1, 0.4.2 Calculated range: >=0.4.2.1 clang-pure Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.0.1, 0.1.0.2 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.0.1 || >0.1.0.1 && <0.1.0.2 || >0.1.0.2 clarifai Preferred ranges: none Deprecated versions: 0.1.0.0, 0.1.0.1, 0.1.1.0 Calculated range: <0.1.0.0 || >0.1.0.0 && <0.1.0.1 || >0.1.0.1 && <0.1.1.0 || >0.1.1.0 clash-ghc Preferred ranges: none Deprecated versions: 0.3, 0.3.0.1, 0.3.0.2, 0.5, 0.6.1, 0.6.2, 0.6.11, 0.6.12, 0.6.13, 0.6.14, 0.7, 1.6.0 Calculated range: <0.3 || >0.3 && <0.3.0.1 || >0.3.0.1 && <0.3.0.2 || >0.3.0.2 && <0.5 || >0.5 && <0.6.1 || >0.6.1 && <0.6.2 || >0.6.2 && <0.6.11 || >0.6.11 && <0.6.12 || >0.6.12 && <0.6.13 || >0.6.13 && <0.6.14 || >0.6.14 && <0.7 || >0.7 && <1.6.0 || >1.6.0 clash-lib Preferred ranges: none Deprecated versions: 0.6.11, 0.6.12, 1.6.0 Calculated range: <0.6.11 || >0.6.11 && <0.6.12 || >0.6.12 && <1.6.0 || >1.6.0 clash-prelude Preferred ranges: none Deprecated versions: 1.6.0 Calculated range: <1.6.0 || >1.6.0 clash-vhdl Preferred ranges: none Deprecated versions: 0.6.9 Calculated range: <0.6.9 || >0.6.9 clay Preferred ranges: none Deprecated versions: 0.12.3 Calculated range: <0.12.3 || >0.12.3 clckwrks Preferred ranges: none Deprecated versions: 0.23.17, 0.23.19 Calculated range: <0.23.17 || >0.23.17 && <0.23.19 || >0.23.19 cleff Preferred ranges: none Deprecated versions: 0.3.0.0 Calculated range: <0.3.0.0 || >0.3.0.0 cli-arguments Preferred ranges: >=0.7 Deprecated versions: 0.1.0.0, 0.1.0.1, 0.2.0.0, 0.3.0.0, 0.3.1.0, 0.4.0.0, 0.5.0.0, 0.6.0.0 Calculated range: >=0.7 cli-arguments-strict Preferred ranges: >=0.1 Deprecated versions: none Calculated range: >=0.1 cli-setup Preferred ranges: >=0.1 Deprecated versions: 0.2.1.1 Calculated range: >=0.1 && <0.2.1.1 || >0.2.1.1 cloben Preferred ranges: none Deprecated versions: 0.1.0.2 Calculated range: <0.1.0.2 || >0.1.0.2 closed-classes Preferred ranges: none Deprecated versions: 0.1.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 clustering Preferred ranges: none Deprecated versions: 0.1.0, 0.1.1 Calculated range: <0.1.0 || >0.1.0 && <0.1.1 || >0.1.1 cmark Preferred ranges: none Deprecated versions: 0.3.5, 0.5.3 Calculated range: <0.3.5 || >0.3.5 && <0.5.3 || >0.5.3 codex Preferred ranges: none Deprecated versions: 0.5.0.1 Calculated range: <0.5.0.1 || >0.5.0.1 comfort-array Preferred ranges: none Deprecated versions: 0.1, 0.5.2 Calculated range: <0.1 || >0.1 && <0.5.2 || >0.5.2 comfort-glpk Preferred ranges: none Deprecated versions: 0.0 Calculated range: <0.0 || >0.0 comfort-graph Preferred ranges: none Deprecated versions: 0.0.4 Calculated range: <0.0.4 || >0.0.4 commutative Preferred ranges: none Deprecated versions: 0.0.1, 0.0.1.1, 0.0.1.2 Calculated range: <0.0.1 || >0.0.1 && <0.0.1.1 || >0.0.1.1 && <0.0.1.2 || >0.0.1.2 commutative-semigroups Preferred ranges: none Deprecated versions: 0.1.1.0 Calculated range: <0.1.1.0 || >0.1.1.0 compact-word-vectors Preferred ranges: none Deprecated versions: 0.2 Calculated range: <0.2 || >0.2 composition-extra Preferred ranges: none Deprecated versions: 0.0.0.1, 0.0.0.2, 1.0.0, 1.0.0.1, 1.0.1, 1.0.1.1, 1.0.2, 1.1.0, 1.2.0, 1.3.0 Calculated range: <0.0.0.1 || >0.0.0.1 && <0.0.0.2 || >0.0.0.2 && <1.0.0 || >1.0.0 && <1.0.0.1 || >1.0.0.1 && <1.0.1 || >1.0.1 && <1.0.1.1 || >1.0.1.1 && <1.0.2 || >1.0.2 && <1.1.0 || >1.1.0 && <1.2.0 || >1.2.0 && <1.3.0 || >1.3.0 composition-prelude Preferred ranges: <3.0.0.1 || >=3.0.0.2 Deprecated versions: 2.0.3.0 Calculated range: <2.0.3.0 || >2.0.3.0 && <3.0.0.1 || >=3.0.0.2 conduino Preferred ranges: none Deprecated versions: 0.1.0.0 Calculated range: <0.1.0.0 || >0.1.0.0 conduit-extra Preferred ranges: none Deprecated versions: 0.1.0, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.1.5, 0.1.6, 0.1.7, 1.0.0 Calculated range: <0.1.0 || >0.1.0 && <0.1.1 || >0.1.1 && <0.1.2 || >0.1.2 && <0.1.3 || >0.1.3 && <0.1.4 || >0.1.4 && <0.1.5 || >0.1.5 && <0.1.6 || >0.1.6 && <0.1.7 || >0.1.7 && <1.0.0 || >1.0.0 conduit-parse Preferred ranges: none Deprecated versions: 0.2.1.0 Calculated range: <0.2.1.0 || >0.2.1.0 config-value Preferred ranges: none Deprecated versions: 0.7.0.0 Calculated range: <0.7.0.0 || >0.7.0.0 connections Preferred ranges: none Deprecated versions: 0.0.1, 0.0.2, 0.0.2.1, 0.0.2.2, 0.0.3 Calculated range: <0.0.1 || >0.0.1 && <0.0.2 || >0.0.2 && <0.0.2.1 || >0.0.2.1 && <0.0.2.2 || >0.0.2.2 && <0.0.3 || >0.0.3 console-program Preferred ranges: none Deprecated versions: 0.4.0.0, 0.4.0.1, 0.4.0.2 Calculated range: <0.4.0.0 || >0.4.0.0 && <0.4.0.1 || >0.4.0.1 && <0.4.0.2 || >0.4.0.2 constraints Preferred ranges: none Deprecated versions: 0.13.3 Calculated range: <0.13.3 || >0.13.3 constraints-emerge Preferred ranges: none Deprecated versions: 0.1, 0.1.1 Calculated range: <0.1 || >0.1 && <0.1.1 || >0.1.1 consumers Preferred ranges: none Deprecated versions: 2.3.2.0, 2.3.3.0 Calculated range: <2.3.2.0 || >2.3.2.0 && <2.3.3.0 || >2.3.3.0 containers Preferred ranges: none Deprecated versions: 0.5.8.1, 0.5.9.1 Calculated range: <0.5.8.1 || >0.5.8.1 && <0.5.9.1 || >0.5.9.1 conversion-bytestring Preferred ranges: none Deprecated versions: 1.0.0.0 Calculated range: <1.0.0.0 || >1.0.0.0 convert-annotation Preferred ranges: none Deprecated versions: 0.4.0.0 Calculated range: <0.4.0.0 || >0.4.0.0 copilot-c99 Preferred ranges: none Deprecated versions: 3.1, 3.1.1 Calculated range: <3.1 || >3.1 && <3.1.1 || >3.1.1 core-data Preferred ranges: none Deprecated versions: 0.2.0.0, 0.2.1.0, 0.2.1.2, 0.2.1.3, 0.2.1.4, 0.2.1.5, 0.2.1.7, 0.2.1.8, 0.2.1.9, 0.2.1.10 Calculated range: <0.2.0.0 || >0.2.0.0 && <0.2.1.0 || >0.2.1.0 && <0.2.1.2 || >0.2.1.2 && <0.2.1.3 || >0.2.1.3 && <0.2.1.4 || >0.2.1.4 && <0.2.1.5 || >0.2.1.5 && <0.2.1.7 || >0.2.1.7 && <0.2.1.8 || >0.2.1.8 && <0.2.1.9 || >0.2.1.9 && <0.2.1.10 || >0.2.1.10 core-program Preferred ranges: none Deprecated versions: 0.2.0.0, 0.2.1.0, 0.2.2.0, 0.2.2.2, 0.2.2.3, 0.2.2.4, 0.2.3.0, 0.2.4.1, 0.2.4.2, 0.2.4.4, 0.2.4.5, 0.2.5.0, 0.2.6.0, 0.2.7.1, 0.2.9.1, 0.2.12.0, 0.3.0.7, 0.3.0.8, 0.3.1.0, 0.3.2.0, 0.3.4.0, 0.4.0.0, 0.4.2.0, 0.4.4.0, 0.4.5.0, 0.4.5.1, 0.4.5.3, 0.4.6.1, 0.4.6.4, 0.5.0.1, 0.5.0.2, 0.5.0.3, 0.5.0.4, 0.5.1.0, 0.5.1.1, 0.6.0.1 Calculated range: <0.2.0.0 || >0.2.0.0 && <0.2.1.0 || >0.2.1.0 && <0.2.2.0 || >0.2.2.0 && <0.2.2.2 || >0.2.2.2 && <0.2.2.3 || >0.2.2.3 && <0.2.2.4 || >0.2.2.4 && <0.2.3.0 || >0.2.3.0 && <0.2.4.1 || >0.2.4.1 && <0.2.4.2 || >0.2.4.2 && <0.2.4.4 || >0.2.4.4 && <0.2.4.5 || >0.2.4.5 && <0.2.5.0 || >0.2.5.0 && <0.2.6.0 || >0.2.6.0 && <0.2.7.1 || >0.2.7.1 && <0.2.9.1 || >0.2.9.1 && <0.2.12.0 || >0.2.12.0 && <0.3.0.7 || >0.3.0.7 && <0.3.0.8 || >0.3.0.8 && <0.3.1.0 || >0.3.1.0 && <0.3.2.0 || >0.3.2.0 && <0.3.4.0 || >0.3.4.0 && <0.4.0.0 || >0.4.0.0 && <0.4.2.0 || >0.4.2.0 && <0.4.4.0 || >0.4.4.0 && <0.4.5.0 || >0.4.5.0 && <0.4.5.1 || >0.4.5.1 && <0.4.5.3 || >0.4.5.3 && <0.4.6.1 || >0.4.6.1 && <0.4.6.4 || >0.4.6.4 && <0.5.0.1 || >0.5.0.1 && <0.5.0.2 || >0.5.0.2 && <0.5.0.3 || >0.5.0.3 && <0.5.0.4 || >0.5.0.4 && &
2026-01-13T09:30:26
https://foldoc.org/spam
spam from FOLDOC Contents Help Random spam < messaging > 1. (From Hormel's Spiced Ham, via the Monty Python "Spam" song) To post irrelevant or inappropriate messages to one or more Usenet newsgroups , mailing lists , or other messaging system in deliberate or accidental violation of netiquette . It is possible to spam a newsgroup with one well- (or ill-) planned message, e.g. asking "What do you think of abortion?" on soc.women. This can be done by cross-post ing, e.g. any message which is crossposted to alt.rush-limbaugh and alt.politics.homosexuality will almost inevitably spam both groups. (Compare troll and flame bait ). Posting a message to a significant proportion of all newsgroups is a sure way to spam Usenet and become an object of almost universal hatred. Canter and Siegel spammed the net with their Green card post. If you see an article which you think is a deliberate spam, DO NOT post a follow-up - doing so will only contribute to the general annoyance. Send a polite message to the poster by private e-mail and CC it to "postmaster" at the same address. Bear in mind that the posting's origin might have been forged or the apparent sender's account might have been used by someone else without his permission. The word was coined as the winning entry in a 1937 competition to choose a name for Hormel Foods Corporation's "spiced meat" (now officially known as "SPAM luncheon meat"). Correspondant Bob White claims the modern use of the term predates Monty Python by at least ten years. He cites an editor for the Dallas Times Herald describing Public Relations as "throwing a can of spam into an electric fan just to see if any of it would stick to the unwary passersby." Usenet newsgroup: news.admin.net-abuse . See also netiquette . 2. (A narrowing of sense 1, above) To indiscriminately send large amounts of unsolicited e-mail meant to promote a product or service. Spam in this sense is sort of like the electronic equivalent of junk mail sent to "Occupant". In the 1990s, with the rise in commercial awareness of the net, there are actually scumbags who offer spamming as a "service" to companies wishing to advertise on the net. They do this by mailing to collections of e-mail addresses, Usenet news, or mailing lists. Such practises have caused outrage and aggressive reaction by many net users against the individuals concerned. 3. (Apparently a generalisation of sense 2, above) To abuse any network service or tool by for promotional purposes. "AltaVista is an index , not a promotional tool. Attempts to fill it with promotional material lower the value of the index for everyone. [...] We will disallow URL submissions from those who spam the index. In extreme cases, we will exclude all their pages from the index." -- Altavista . < jargon , programming > 4. To crash a program by overrunning a fixed-size buffer with excessively large input data. See also buffer overflow , overrun screw , smash the stack . < chat , games > 5. (A narrowing of sense 1, above) To flood any chat forum or Internet game with purposefully annoying text or macros. Compare Scrolling . Last updated: 2003-09-21 Nearby terms: spaghetti inheritance ♦ spaghetti with meatballs code ♦ spam ♦ spamdex ♦ spamming Try this search on Wikipedia , Wiktionary , Google , OneLook . Loading Tweet   Recent Updates     |     Missing Terms Updated: Thu, 28 Aug 2025 23:32:16 GMT 15284 entries Copyright Denis Howe 1985
2026-01-13T09:30:26
https://upsilon.cc/~zack/teaching/
teaching zack's home page / teaching home research publications committees teaching hacking debian software talks blog about Below you can find information and resources about my teaching activities . Teaching material Internship topics | Sujets de stage | Argomenti di tesi Teaching material 2023/2024 INF107 - From Logic Gates to Operating Systems , Télécom Paris , Polytechnic Institute of Paris , 1st year of the engineering cycle NET7212 - Safe System Programming (in Rust) , Polytechnic Institute of Paris , 2nd year of the cybersecurity master MSIR - Post Master's Degree in Information Systems Manager , Télécom Paris and ESSEC (as master's co-supervisor) Archive Teaching material related to classes I've taught in the past is available on a separate teaching archive page. Internship topics | Sujets de stage | Argomenti di tesi Internship topics for students interested in pursuing a (MSc) thesis, stage (fr), or tesi (it) with me are available on a dedicated internships page. Copyright © 2007-2022 by Stefano Zacchiroli <zack@upsilon.cc> Homepage by Stefano Zacchiroli is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License . Last edited Wed 06 Sep 2023 03:22:48 PM CEST Fri 21 Dec 2007 12:46:56 PM CET -->
2026-01-13T09:30:26
https://www.debian.org/releases/stable/installmanual
Debian trixie -- Installation Guide Skip Quicknav Blog Micronews Planet Wiki Debian Releases / Debian “trixie” Release Information / Debian trixie -- Installation Guide Debian trixie -- Installation Guide Installation instructions, along with downloadable files, are available for each of the supported architectures: Installation Guide for 64-bit PC (amd64) Installation Guide for 64-bit ARM (AArch64) Installation Guide for Hard Float ABI ARM (armhf) Installation Guide for POWER Processors Installation Guide for RISC-V 64-bit little endian (riscv64) Installation Guide for IBM System z If you have set your browser's localization properly, you can use the above link to get the right HTML version automatically — see content negotiation . Otherwise, pick the exact architecture, language, and format you want from the table below. Architecture Format Languages 64-bit PC (amd64) HTML Catalan Chinese (China) Czech Danish Dutch English French German Greek Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese   PDF Catalan Chinese (China) Czech Danish Dutch English French German Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese   plain text Catalan Chinese (China) Czech Danish Dutch English French German Greek Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese 64-bit ARM (AArch64) HTML Catalan Chinese (China) Czech Danish Dutch English French German Greek Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese   PDF Catalan Chinese (China) Czech Danish Dutch English French German Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese   plain text Catalan Chinese (China) Czech Danish Dutch English French German Greek Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese Hard Float ABI ARM (armhf) HTML Catalan Chinese (China) Czech Danish Dutch English French German Greek Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese   PDF Catalan Chinese (China) Czech Danish Dutch English French German Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese   plain text Catalan Chinese (China) Czech Danish Dutch English French German Greek Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese POWER Processors HTML Catalan Chinese (China) Czech Danish Dutch English French German Greek Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese   PDF Catalan Chinese (China) Czech Danish Dutch English French German Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese   plain text Catalan Chinese (China) Czech Danish Dutch English French German Greek Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese RISC-V 64-bit little endian (riscv64) HTML Catalan Chinese (China) Czech Danish Dutch English French German Greek Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese   PDF Catalan Chinese (China) Czech Danish Dutch English French German Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese   plain text Catalan Chinese (China) Czech Danish Dutch English French German Greek Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese IBM System z HTML Catalan Chinese (China) Czech Danish Dutch English French German Greek Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese   PDF Catalan Chinese (China) Czech Danish Dutch English French German Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese   plain text Catalan Chinese (China) Czech Danish Dutch English French German Greek Hungarian Indonesian Italian Japanese Korean Portuguese Romanian Russian Spanish Swedish Ukrainian Vietnamese Back to the Debian Project homepage . This page is also available in the following languages: Select your language Deutsch español français Italiano Nederlands polski Português svenska 中文(简) 中文(HK) 中文(繁) 한국어 (Korean) Ελληνικά (Ellinika) How to set the default document language Home About Social Contract Code of Conduct Free Software Legal Info Help Debian Getting Debian Network install CD/USB ISO images Pure Blends Debian Packages Developers' Corner News Project News Events Documentation Release Info Debian Wiki Support Debian International Security Information Bug reports Mailing Lists Site map Search The Debian Blog Debian Micronews Debian Planet See our contact page to get in touch. Web site source code is available . Last Modified: Thu, Oct 23 11:51:25 UTC 2025   Last Built: Sat, Jan 10 18:42:00 UTC 2026 Copyright © 1997-2025 SPI and others; See license terms Debian is a registered trademark of Software in the Public Interest, Inc.
2026-01-13T09:30:26
https://www.debian.org/devel/debian-installer/
Debian -- Debian-Installer Skip Quicknav Blog Micronews Planet Wiki Debian Developers' Corner / Debian-Installer News [04 Aug 2025] Debian Installer Trixie RC 3 release [02 Jul 2025] Debian Installer Trixie RC 2 release Older news Installing with the Debian-Installer For official Debian 13.3 installation media and information , see the trixie page . All images linked below are for the version of Debian Installer being developed for the next Debian release and will install Debian testing ( forky ) by default. To install Debian testing , we recommend you use the daily builds of the installer. The following images are available for daily builds: Current daily snapshots netinst CD images amd64 arm64 armhf ppc64el riscv64 s390x netinst CD images (via jigdo ) amd64 arm64 armhf ppc64el riscv64 s390x other images (netboot, USB stick, etc.) amd64 arm64 armhf hurd-i386 mips64el ppc64el riscv64 s390x Notes An architecture can be (temporarily) omitted from the overview of daily built images if daily builds are not (reliably) available. For the installation images, verification files ( SHA512SUMS and SHA256SUMS ) are available in the same directory as the images. For downloading full CD and DVD images the use of jigdo is recommended. Only a limited number of images from the full DVD sets are available as ISO files for direct download. Most users do not need all of the software available on all the discs, so to save space on download servers and mirrors the full sets are only available via jigdo. After using the Debian-Installer , please send us an installation report , even if there weren't any problems. Documentation If you read only one document before installing, read our Installation Howto , a quick walkthrough of the installation process. Other useful documentation includes: Installation Guide: development version (testing) — latest version (Git) detailed installation instructions Debian-Installer FAQ and Debian-CD FAQ common questions and answers Debian-Installer Wiki community maintained documentation Contacting us The debian-boot mailing list is the main forum for discussion and work on Debian-Installer. We also have an IRC channel, #debian-boot on irc.debian.org . This channel is used mainly for development, but occasionally for support. If you do not receive a response, try the mailing list instead. Back to the Debian Project homepage . This page is also available in the following languages: Select your language dansk Deutsch español français Italiano Nederlands polski Português slovenčina svenska Български (Bəlgarski) Русский (Russkij) 中文(简) 中文(HK) 中文(繁) 日本語 (Nihongo) 한국어 (Korean) Ελληνικά (Ellinika) How to set the default document language Home About Social Contract Code of Conduct Free Software Legal Info Help Debian Getting Debian Network install CD/USB ISO images Pure Blends Debian Packages Developers' Corner News Project News Events Documentation Release Info Debian Wiki Support Debian International Security Information Bug reports Mailing Lists Site map Search The Debian Blog Debian Micronews Debian Planet See our contact page to get in touch. Web site source code is available . Last Modified: Sat, Nov 29 15:24:13 UTC 2025   Last Built: Sat, Jan 10 23:30:07 UTC 2026 Copyright © 1997-2025 SPI and others; See license terms Debian is a registered trademark of Software in the Public Interest, Inc.
2026-01-13T09:30:26
https://salsa.debian.org/debian-listmasters/spamassassin_config
Debian Listmasters / spamassassin_config · GitLab S spamassassin_config Project information This is the spamassassin configuration that runs behind bugs.debian.org and lists.debian.org Read more 1,997 Commits 1 Branch 0 Tags README Created on February 22, 2018 Loading
2026-01-13T09:30:26
https://github.com/jeremyevans/sequel-annotate/actions/workflows/ci.yml
CI · Workflow runs · jeremyevans/sequel-annotate · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / sequel-annotate Public forked from kennym/annotate-sequel Notifications You must be signed in to change notification settings Fork 12 Star 39 Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights Actions: jeremyevans/sequel-annotate Actions --> All workflows Workflows CI CI Show more workflows... Management Caches CI CI Actions Loading... Loading Sorry, something went wrong. Uh oh! There was an error while loading. Please reload this page . --> will be ignored since log searching is not yet available Show workflow options Create status badge Create status badge Loading Uh oh! There was an error while loading. Please reload this page . ci.yml --> will be ignored since log searching is not yet available 10 workflow runs 10 workflow runs Event Filter by Event Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching events. Status Filter by Status Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching statuses. Branch Filter by Branch Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching branches. Actor Filter by Actor Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching users. Add Ruby 4.0 to CI CI #32: Commit 06932b6 pushed by jeremyevans 26m 4s master master 26m 4s View workflow file Update CHANGELOG CI #31: Commit 621729d pushed by jeremyevans 2m 35s master master 2m 35s View workflow file Include lazy attributes CI #30: Pull request #25 opened by rgalanakis 2m 51s rgalanakis:lazy-attributes rgalanakis:lazy-attributes 2m 51s View #25 View workflow file Use SimpleCov.add_filter block instead of string CI #29: Commit 4de2cc9 pushed by jeremyevans 2m 32s master master 2m 32s View workflow file Add JRuby 10.0 to CI CI #28: Commit ca04580 pushed by jeremyevans 9m 28s master master 9m 28s View workflow file Switch rdoc task to normal rake task, avoid rdoc/task require CI #27: Commit 39408bc pushed by jeremyevans 2m 27s master master 2m 27s View workflow file Fix CI by using a password for the postgres database CI #26: Commit fee4e1c pushed by jeremyevans 2m 20s master master 2m 20s View workflow file Work with ubuntu-latest using 24.04 by default in CI CI #25: Commit 1696043 pushed by jeremyevans 22s master master 22s View workflow file Restrict sqlite3 version in Ruby 2.3/2.4 CI CI #24: Commit 5d88b56 pushed by jeremyevans 1m 17s master master 1m 17s View workflow file Use -W:strict_unused_block when running tests on Ruby 3.4+ CI #23: Commit 0a99edc pushed by jeremyevans 2m 34s master master 2m 34s View workflow file You can’t perform that action at this time.
2026-01-13T09:30:26
https://heisenbug.blogspot.com/2011/12/showing-thrists-revisited.html#main
don't count on finding me: Showing Thrists Revisited skip to main | skip to sidebar don't count on finding me Monday, December 26, 2011 Showing Thrists Revisited More than three years ago I lamented that it's impossible to to define a show function on thrists, generally, even when the element type is member of the Show class. In the meantime I succeeded to declare certain thrist parametrizations and convince GHC to accept show instances for them. The Appli thrist is such an example. With the upcoming GHC 7.4 things may improve considerably, as it will bring constraint kinds . Remember, thrists are (currently) parameterized like this (* → * → *) → * → * → * , i.e. on types , and with the new kind variable feature we can probably generalize to user-defined kinds . Then the parameters may match Ωmega's: (a → a → *) → a → a → * . So we still result in a type, but we can choose our indices from a vastly bigger domain. Enter constraint kinds! These may be part of our user-defined kinds, so we can form stuff like (Show, *) and supply it for the parameter a . With some luck deriving Show can be more successful and not attached to particular parametrizations. I regrettably still haven't gotten around building a GHC v7.4.1 candidate, so I cannot verify the above, but my gut feeling is that this'll work out... Posted by heisenbug at 5:11 PM Labels: ghc , haskell , thrist 1 comment: Brent said... I don't think this will work. Show is not a kind, it is a constraint (a type-like thing) whose kind is Constraint. So (Show,*) does not make sense. There is still no kind that means "types with a Show instance". December 26, 2011 at 8:49 PM Post a Comment Newer Post Older Post Home Subscribe to: Post Comments (Atom) Blog Archive ►  2022 (1) ►  February (1) ►  2014 (5) ►  November (1) ►  October (1) ►  August (1) ►  July (1) ►  January (1) ►  2013 (5) ►  September (1) ►  August (3) ►  February (1) ►  2012 (2) ►  December (1) ►  September (1) ▼  2011 (7) ▼  December (1) Showing Thrists Revisited ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  February (1) ►  January (1) ►  2010 (19) ►  December (5) ►  November (6) ►  October (1) ►  August (1) ►  July (2) ►  June (4) ►  2009 (12) ►  November (2) ►  October (1) ►  August (1) ►  June (1) ►  May (1) ►  March (4) ►  January (2) ►  2008 (22) ►  October (1) ►  September (3) ►  August (6) ►  July (3) ►  June (2) ►  May (1) ►  April (3) ►  March (1) ►  February (1) ►  January (1) ►  2007 (20) ►  December (2) ►  November (1) ►  October (1) ►  September (1) ►  August (1) ►  July (14) About Me heisenbug I am here and there. You may encounter me if you try, but no guarantees. Just a hint: I am mostly with my family. View my complete profile  
2026-01-13T09:30:26
https://github.com/jeremyevans/ruby-refrigerator
GitHub - jeremyevans/ruby-refrigerator: Freeze all core ruby classes Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / ruby-refrigerator Public Notifications You must be signed in to change notification settings Fork 4 Star 283 Freeze all core ruby classes 283 stars 4 forks Branches Tags Activity Star Notifications You must be signed in to change notification settings Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights jeremyevans/ruby-refrigerator   master Branches Tags Go to file Code Open more actions menu Folders and files Name Name Last commit message Last commit date Latest commit   History 80 Commits .github/ workflows .github/ workflows     bin bin     lib lib     module_names module_names     test test     .ci.gemfile .ci.gemfile     .gitignore .gitignore     CHANGELOG CHANGELOG     MIT-LICENSE MIT-LICENSE     README.rdoc README.rdoc     Rakefile Rakefile     gen_module_names.rb gen_module_names.rb     refrigerator.gemspec refrigerator.gemspec     View all files Repository files navigation README License Refrigerator Refrigerator offers an easy way to freeze all ruby core classes and modules. It’s designed to be used in production and when testing to make sure that no code is making unexpected changes to core classes or modules at runtime. Installation gem install refrigerator Source Code Source code is available on GitHub at github.com/jeremyevans/ruby-refrigerator Usage freeze_core After loading all of the code for your application, you can call the freeze_core method to freeze all core classes: require 'refrigerator' Refrigerator . freeze_core This will freeze all core classes, so that modifications to them at runtime will raise exceptions. In a rack-based application, a good place to call ‘freeze_core` is at the end of the `config.ru` file. You can also pass an :except option to freeze_core with an array of class names not to freeze: Refrigerator . freeze_core ( :except => [ 'BasicObject' ]) One reason to exclude certain classes is because you know they will be modified at runtime. check_require Refrigerator also offers a check_require method for checking libraries for modifications to the core classes. It allows you to easily see what fails when when you try to require the library with a frozen core, and offers some options that you can use to try to get the require to not raise an exception. This allows you to see what changes the library makes to the core classes. Here’s an example of basic use: Refrigerator . check_require ( 'open3' , :modules => [ :Open3 ]) The check_require method takes the following options: :modules Define the given module names before freezing the core (array of symbols) :classes Define the given class names before freezing the core (array of symbols or two element arrays with class name symbol and superclass name symbol) :exclude Exclude the given class/module names from freezing (array of strings) :depends Any dependencies to require before freezing the core (array of strings) Without any options, check_require will likely raise an exception, as it freezes the core before requiring, and if the required files tries to add a class or module to the global namespace, that will fail. The :modules and :classes options exist so that you can predefine the class so that the required file will reopen the existing class instead of defining a new class. The :depends option can be easily used to load all dependencies of the required file before freezing the core. This is also necessary in most cases, especially when using the stdlib, since many stdlib files modify the core classes in ways beyond adding modules or classes. The :exclude option is basically a last resort, where you can disable the freezing of certain core classes, if you know the required library modifies them. Here’s an example using Sequel, a ruby database toolkit: Refrigerator . check_require 'sequel' , :depends => %w'bigdecimal date thread time uri' , :modules => [ :Sequel ] And an example using Roda, a ruby web toolkit: Refrigerator . check_require 'roda' , :depends => %w'rack uri fileutils set tmpdir tempfile thread date time' , :classes => [ :Roda ] Note that many stdlib libraries will fail check_require unless you use the :exclude option, for example, date : Refrigerator . check_require 'date' , :classes => [ :Date , [ :DateTime , :Date ]] # Fails due to Time#to_date addition Refrigerator . check_require 'date' , :classes => [ :Date , [ :DateTime , :Date ]], :exclude => [ 'Time' ] # => true bin/check_require refrigerator ships with a check_require binary that offers access to Refrigerator.check_require from the command line. Here’s the usage: $ bin/check_require Usage: check_require [options] path Options: -m, --modules [Module1,Module2] define given modules under Object before freezing core classes -c [Class1,Class2/SuperclassOfClass2], --classes define given classes under Object before freezing core classes -r, --require [foo,bar/baz] require given libraries before freezing core classes -e, --exclude [Object,Array] exclude given core classes from freezing -h, -?, --help Show this message You can use this to easily check ruby libraries for issues when requiring. For example, let’s try with open3 : $ bin/check_require open3 Traceback (most recent call last): 4: from bin/check_require:42:in `<main>' 3: from /home/billg/ruby-refrigerator/lib/refrigerator.rb:35:in `check_require' 2: from /usr/local/lib/ruby/2.5/rubygems/core_ext/kernel_require.rb:59:in `require' 1: from /usr/local/lib/ruby/2.5/rubygems/core_ext/kernel_require.rb:59:in `require' /usr/local/lib/ruby/2.5/open3.rb:32:in `<top (required)>': can't modify frozen #<Class:Object> (FrozenError) $ bin/check_require -m Open3 open3 As displayed above, open3 does not modify any core classes, beyond defining the Open3 module. Let’s try with date : $ bin/check_require date Traceback (most recent call last): 6: from bin/check_require:42:in `<main>' 5: from /home/billg/ruby-refrigerator/lib/refrigerator.rb:35:in `check_require' 4: from /usr/local/lib/ruby/2.5/rubygems/core_ext/kernel_require.rb:59:in `require' 3: from /usr/local/lib/ruby/2.5/rubygems/core_ext/kernel_require.rb:59:in `require' 2: from /usr/local/lib/ruby/2.5/date.rb:4:in `<top (required)>' 1: from /usr/local/lib/ruby/2.5/rubygems/core_ext/kernel_require.rb:59:in `require' /usr/local/lib/ruby/2.5/rubygems/core_ext/kernel_require.rb:59:in `require': can't modify frozen #<Class:Object> (FrozenError) $ bin/check_require -c Date,DateTime/Date date Traceback (most recent call last): 6: from bin/check_require:42:in `<main>' 5: from /home/billg/ruby-refrigerator/lib/refrigerator.rb:35:in `check_require' 4: from /usr/local/lib/ruby/2.5/rubygems/core_ext/kernel_require.rb:59:in `require' 3: from /usr/local/lib/ruby/2.5/rubygems/core_ext/kernel_require.rb:59:in `require' 2: from /usr/local/lib/ruby/2.5/date.rb:4:in `<top (required)>' 1: from /usr/local/lib/ruby/2.5/rubygems/core_ext/kernel_require.rb:59:in `require' /usr/local/lib/ruby/2.5/rubygems/core_ext/kernel_require.rb:59:in `require': can't modify frozen class (FrozenError) $ bin/check_require -c Date,DateTime/Date -e Time date The first failure is because date defines the Date and DateTime classes, so you must define those classes first, using a slash to separate DateTime from the superclass Date. Note that it still fails in that case, but it doesn’t even tell you why. It turns out the reason is that date also adds to_date and other methods to Time , so you need to exclude the freezing of Time as well. Here are a couple more examples, using Sequel and Roda: bin/check_require -m Sequel -r bigdecimal,date,thread,time,uri sequel bin/check_require -c Roda -r rack,uri,fileutils,set,tmpdir,tempfile,thread,date,time roda Supporting new ruby minor versions The list of constants that freeze_core will freeze are stored in the module_names/*.txt files in the repository, with separate files per ruby minor version. When new ruby minor versions are released, the module_names rake task can be run with the new ruby minor version, and it will generate the appropriate file. Skipped Classes and Modules Internal, deprecated, and private classes and modules are not frozen by refrigerator. License MIT Author Jeremy Evans <code@jeremyevans.net> About Freeze all core ruby classes Resources Readme Uh oh! There was an error while loading. Please reload this page . Activity Stars 283 stars Watchers 9 watching Forks 4 forks Report repository Releases 11 tags Packages 0 No packages published Uh oh! There was an error while loading. Please reload this page . Contributors 2     Uh oh! There was an error while loading. Please reload this page . Languages Ruby 100.0% Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time.
2026-01-13T09:30:26
https://salsa.debian.org/reproducible-builds/diffoscope/issues/new
Sign in · GitLab Debian Salsa Gitlab Sign in to create issues, write comments, review contributions, and more. 
 New user registrations are manually reviewed due to the high volume of spam registrations. It may take a few days before a new account is approved. More information in the Frequently Asked Questions . 
 You can also use our self-service interface to create a team group for managing projects. 
 If you need support check https://wiki.debian.org/Salsa/Doc#Support Debian Salsa Gitlab Username or primary email Password Forgot your password? Remember me Sign in Don't have an account yet? Register now or sign in with Google Bitbucket GitLab.com Remember me Explore Help About GitLab GitLab community forum
2026-01-13T09:30:26
https://lists.debian.org/debian-devel-announce/2015/02/msg00000.html
--> Permanent removals from testing for Jessie [Date Prev][ Date Next ] [Thread Prev][ Thread Next ] [ Date Index ] [ Thread Index ] Permanent removals from testing for Jessie To : debian-devel-announce@lists.debian.org Subject : Permanent removals from testing for Jessie From : Niels Thykier < niels@thykier.net > Date : Wed, 04 Feb 2015 22:25:15 +0100 Message-id : < [🔎]   54D28E3B.3070409@thykier.net > Mail-followup-to : debian-devel@lists.debian.org -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256 Hi, Per [JESSIE FREEZE POLICY], tomorrow is the *last* chance for getting a package *back* into Jessie if it was removed. The requirements are: * The package has no RC bugs in unstable. * The removal was *less than* a week ago. * The request for unblocking *is received* before the end of Thursday (i.e. tomorrow at midnight UTC). After tomorrow, removals are permanent and will *not* be undone! If your package is in danger of being (auto-)removed, and you have a solution to avoid this, please contact us *before* the package is removed. Please refer to the [AUTO-REMOVAL-LIST] for the list of pending removals. Furthermore, consider having a look at the [UDD-RC-BUG-LIST], which contains the current list of non-key packages with RC bugs. Any package listed on either list (and their transitive reverse (build-)depends) is *at risk of removal*. Niels, on behalf of the release team. [JESSIE FREEZE POLICY]: https://release.debian.org/jessie/freeze_policy.html#autoremovals [AUTO-REMOVAL-LIST]: https://udd.debian.org/cgi-bin/autoremovals.cgi [UDD-RC-BUG-LIST]: https://udd.debian.org/bugs/?release=jessie&merged=ign&keypackages=ign&fnewerval=7&flastmodval=7&rc=1&sortby=id&sorto=asc&format=html#results -----BEGIN PGP SIGNATURE----- Version: GnuPG v1 iQIcBAEBCAAGBQJU0o43AAoJEAVLu599gGRCe10QAKAqT+gAzFC37YxRYYp9aSFc t0AlI305riSlldM9eABtVivvnbbgV1zjk76R8nw8nhCfTMCFPFmPd4C8APO7HjOh AsKacRQpqmXdWEwSJD+DuwyOENLEki8RnirQ11qY52jCsNjQYNUAYBBmyrhoSDgO S5wygRGQuuqZEZMycvcSlY5OGaH1Qtfke8BXjO1qfG7QNOnqh3jv7VRDXaIRUJdU VejDdPaFgSHEzz5C2G8lRHNnkgtwmLIH6uy6OUzwzvgnxcrvjNc3VijD3Kn9D/go V+3dYM/B/1J56K+a5YLMRIX17ififulP1cZjVuvwm55VhLbqRQdPUl+XWH0aKWIW SVQe2B47h9+gaxwYpSCEYtZV61Ek0gAUQs0Nfk6ygS3WGQltmca2J+oBsWb/PCkB t2/MVHOGkO6/CfWFgt27XOTMFL0loEAJE0aANMbEhql9JpgBNy6VrlFxF3NIhb8y pHIOwdEwKO+0DwybZN4fU2QlfuO1KQNI8SJlRfKmrq7tEpECgeUYH+XDOFPhVvr7 OKSyqAwY+Pv3SeSfxpwGkhuFRPnu+x00/HNMdRnvDONpLpnkuVPFvworc4V+1Xnl 2MMX+UsJwpqVT5Ep3SHP1NW+hLU9jdsx6XwDJwvtoLMDuV9zWiENRoffNwYnZpbA QIG1IjnEuwFBkI2TYAFs =qc4q -----END PGP SIGNATURE----- Reply to: debian-devel-announce@lists.debian.org Niels Thykier (on-list) Niels Thykier (off-list) Next by Date: Bits from the NM process Next by thread: Bits from the NM process Index(es): Date Thread
2026-01-13T09:30:26
https://discuss.asciidoctor.org
Asciidoctor :: Discussion Asciidoctor :: Discussion Asciidoctor :: Discussion General discussion for Asciidoctor, an open source Ruby implementation of the AsciiDoc markup language. You can post messages via email or through this forum interface. Click Options > Post by email  to get the personalized e-mail address you must use to post to the list via email. Advanced Search New Topic People 1 2 3 4 ... 41 Topics (2029) Replies Last Post Views Announcing the formation of the AsciiDoc Working Group and invitation to join by mojavelinux 1 by habamax The discussion list has moved to the Zulip-powered project chat by mojavelinux 0 by mojavelinux How to do calculations using variables? by roxlu 5 by TonK Golang implementation by gour 5 by diguage Asciidoctor-diagram on Windows by Nanook 10 by pwillard How to include bar chart ? by Jan 4 by mojavelinux Image in table by Trebor 5 by mcp292 How to add page number for a pdf bookmark/cross reference by fluentcoder@gmail.co... 6 by benroll Asciidoctor and Compiler-Explorer by wimalopaan 0 by wimalopaan Can Asciidoctor-pdf suppress creation of the text layer? by kev 1 by mojavelinux swagger2markup looks like it needs support, plus :-) by Elisa 0 by Elisa IDE Previews with sylesheet by bkalbfus 1 by Alexander Schwartz Scrollbar of code block not shown when embeded in admonition block by phgiraud 0 by phgiraud Include section number in order lists's number? by holyjak 0 by holyjak Mathml and Jeuclid by metro 1 by metro graphviz dpi by metro 1 by metro Rendering Admonitions and Callouts in Docx by fbalmeida 0 by fbalmeida Inconsistency in formatted inline elements - space before role name by joswr1ght 0 by joswr1ght Two icon sets (Font Awesome and Material Design) in one document? by Tobi 2 by mojavelinux Problem with ::toc[] and custom HTML template by DrAscii 4 by abelsromero Color for Text by Conrad 8 by youngjim01 Announcement: AsciiDoc cheat sheet for Dash for macOS by holyjak 1 by mojavelinux Cells and CSS role by christophe 1 by mojavelinux Nested tables: stripes and separator by veselov 2 by mojavelinux Counters and ifeval by halol 3 by halol Adding css class resp. role to a horizontal ruler and table rows by grandmasterg 0 by grandmasterg PNGs were recognized....now they're not by KLynn2021 3 by abelsromero Customizing link output in PDF by Patrick Ben Koetter 1 by Alexander Schwartz Generating a PDF using AsciiDoctor by Carl 1 by Carl PDF Table Formatting Issue with AsciiDoc Style Column by weezair 0 by weezair How to define variables globally? by Carl 2 by abelsromero [FIXED] How to compile just the source content? (No document, head, styles, etc.) by toastal 2 by toastal asciidoctor-pdf: Unicode characters ⌚☑💭📝🔒🔑⏰ work, but ↹⏎⇧ don't by Carsten 0 by Carsten callouts for Erlang code by LeHoff 1 by mojavelinux Printing table cell from CSV completely verbatim by Pascal 0 by Pascal How to use border for specific and inline images in pdf? by cwempe 1 by mojavelinux problem installing asciidoctor-mathematical gem by Elisa 2 by mojavelinux Document title, output directory and collapsible block questions by carsten-doctor 9 by abelsromero JDK 17 Early Access build 23 is available by Rory O'Donnell 0 by Rory O'Donnell Reduce size of image by default by tedour 2 by tedour Styling/Theming like in the official docs by lkuty 2 by mojavelinux Difficulties in installing asciidoctor-pdf by hyperscope 7 by mojavelinux JDK 17 Early Access build 21 is available by Rory O'Donnell 0 by Rory O'Donnell Why is it necessary to get approval to join this list? by mojavelinux 4 by hyperscope were there changes to the stylesheet specification? by jlo2k 2 by jlo2k Problems getting wavedrom diagramming to work for asciidoctor-pdf by Elisa 5 by mojavelinux Rouge: should be more clear how to change Rouge attributes by hyperscope 4 by mojavelinux Is there a Live Preview (of Asciidoc) for Emacs or Vim? by Ibn Saeed 2 by hyperscope Source blocks in tables with asciidoctor maven plugin 2.1.0 by Toch 5 by mojavelinux error message on trying to update asciidoctor-pdf by Elisa 6 by yo 1 2 3 4 ... 41 Feeds | Created by mojavelinux | 1 view|%1 views Free forum by Nabble Edit this page
2026-01-13T09:30:26
https://lists.debian.org/debian-devel-announce/2015/02/msg00012.html
--> Hosting offers for Debian development [ Date Prev ][ Date Next ] [ Thread Prev ][ Thread Next ] [ Date Index ] [ Thread Index ] Hosting offers for Debian development To : debian-devel-announce@lists.debian.org Subject : Hosting offers for Debian development From : Lucas Nussbaum < leader@debian.org > Date : Wed, 18 Feb 2015 08:33:20 +0100 Message-id : < [🔎]   20150218073320.GA3348@xanadu.blop.info > Mail-followup-to : debian-devel@lists.debian.org Hi, The Debian Systems Administrators are doing a fantastic job at maintaining our infrastructure. The level of quality and professionalism of their work clearly surpasses what can be found in most organizations, volunteer or not. However, it is often useful, in the context of Debian development, to get access to more temporary resources, in order to explore new ideas, and design or test new services until they are ready to be moved to proper DSA-managed infrastructure. What happened several times is that Developers with such needs ended up hosting those services themselves, which makes it difficult to create a maintenance team around those services, resulting in services that end up suddenly unavailable. Some Developers have been able to host such services elsewhere, usually using their own personal contacts. I've been talking to DSA about this for a while, and DSA has been working on providing a private OpenStack Cloud. Unfortunately, this is not available yet. In the meantime, I've also been in contact with several hosting providers, who agreed to provide resources to Debian Developers. They are now listed on https://wiki.debian.org/ServicesHosting I would like to stress a few things: - it is strongly recommended to engage early with DSA to discuss design choices and identify possible blockers when/if the service will be moved to Debian infrastructure. - those offers are still subject to a per-request approval by the service provider. Developers are expected to describe the planned use of those resources in their requests. - this list is not a closed list. If you are able and willing to provide such resources to Debian Developers, please add yourself to the list, or contact me. Finally, I would like to thank Gandi, GPLHost and Rackspace for supporting Debian this way! - Lucas Attachment: signature.asc Description: Digital signature Reply to: debian-devel-announce@lists.debian.org Lucas Nussbaum (on-list) Lucas Nussbaum (off-list) Prev by Date: Delegation for the Trademark Team Next by Date: [CTTE #762194] Transition plan to systemd by default Previous by thread: Delegation for the Trademark Team Next by thread: [CTTE #762194] Transition plan to systemd by default Index(es): Date Thread
2026-01-13T09:30:26
https://lists.debian.org/debian-devel-announce/2015/02/msg00009.html
--> DebConf15: Call for Sprints [ Date Prev ][ Date Next ] [ Thread Prev ][ Thread Next ] [ Date Index ] [ Thread Index ] DebConf15: Call for Sprints To : debian-devel-announce@lists.debian.org Subject : DebConf15: Call for Sprints From : Tassia Camoes Araujo < tassia@debian.org > Date : Mon, 16 Feb 2015 12:02:53 -0500 Message-id : < [🔎]   20150216170253.GI6734@acaia.ca > Mail-followup-to : debian-devel@lists.debian.org Reply-to : content@debconf.org Would your team benefit from a sprint but organizing it is too much hassle? Are you looking for more people to join your project, but don't know how to reach them? The DebConf organisation team is happy to announce that right before DebConf15 this coming August in Heidelberg, Germany, we can host your team's sprint and take care of the logistics for working space, food and accommodation. You just need to come up with a plan, round up the team and let us know the sprint topic, tasks and goals. These sprints will take place during DebCamp (10‒14 August), and are particularly suitable for teams and people who already plan to attend DebConf. They can also be a great opportunity to attract other interested people, or motivate contributors to join a new team or project. Participation in a sprint can be considered as a DebCamp workplan for those that request sponsorship at the time of their DebConf registration. The main conference itself (DebConf, 15‒22 August) will be filled with talks and other activities, but there can also be space there for sprints that would benefit from having the larger Debian community at hand, giving a point of entry for new team members, and a great way to get results from occasional contributors. If your team is interested in hosting a sprint, please start by creating a wiki page [1] and make sure it includes: * the topic, * goals and tasks to be accomplished, * the expected duration (one day? three days?), * and a section for prospective participants to sign up. Then send the sprint idea to the debian-sprints mailing list [2] before Thursday 30 April. The content team is available to help shapping the sprint plans, as well as with the coordination of space, dates and participants. Please notice that the available space is limited and sprints will be scheduled on a first-come, first-served basis. Looking forward to hearing about your sprints, The DebConf Content team. [1] https://wiki.debian.org/Sprints [2] https://lists.debian.org/debian-sprints/ Attachment: signature.asc Description: Digital signature Reply to: debian-devel-announce@lists.debian.org Tassia Camoes Araujo (on-list) Tassia Camoes Araujo (off-list) Prev by Date: Bug Squashing Party in Portland, 2015-02-21 Next by Date: Debian Trademark team Previous by thread: Bug Squashing Party in Portland, 2015-02-21 Next by thread: Debian Trademark team Index(es): Date Thread
2026-01-13T09:30:26
https://lists.debian.org
Debian Mailing Lists -- Index mailing lists Skip Quicknav About Debian Getting Debian Support Developers' Corner Mailing Lists / Index Debian Mailing Lists Please see the introduction to Debian mailing lists for more information on what they are and how they can be used. There are list indices for the following types of mailing lists: Debconf Users Developers Internationalization and Translations Ports Bug tracking system Miscellaneous Debian Linux Standard Base Software in the Public Interest Other If you wish to browse a complete list of mailing lists, see the complete index . If you wish to browse a list of additional Debian related mailing lists, see the wiki page . To subscribe to or unsubscribe from multiple mailing lists at once, use the subscription or unsubscription web form, respectively. Note that a lot of these mailing lists can be browsed as Usenet newsgroups . Our list archives can also be searched . Take a look at some usage statistics for the lists. Back to: Debian Lists || Debian Project homepage . Home About Social Contract Code of Conduct Free Software Partners Donations Contact Us Getting Debian Network install CD/USB ISO images CD vendors Pre-installed Debian Packages News Project News Events Documentation Release Info Installation manual Debian Books Support Debian International Security Information Bug reports Mailing Lists Mailing List Archives Ports/Architectures Miscellaneous Help Debian Developers' Corner Site map Search You may submit bugs against the list archives using the lists.debian.org pseudo-package or contact the maintainer at listmaster@lists.debian.org . See the Debian contact page for further information on contacting us. Copyright © 2015 SPI and others; See license terms Debian is a registered trademark of Software in the Public Interest, Inc.
2026-01-13T09:30:26
https://lists.debian.org/debian-devel-announce/2015/02/msg00001.html
--> Bits from the NM process [ Date Prev ][ Date Next ] [ Thread Prev ][ Thread Next ] [ Date Index ] [ Thread Index ] Bits from the NM process To : debian-devel-announce@lists.debian.org Subject : Bits from the NM process From : Enrico Zini < enrico@enricozini.org > Date : Thu, 5 Feb 2015 09:03:34 +0100 Message-id : < [🔎]   20150205080334.GA18189@enricozini.org > Mail-followup-to : debian-devel@lists.debian.org Hello, There has been an impromptu DAM meeting at FOSDEM where we brainstormed some improvements to the current situation, and here is what we came up with:  * Application Managers needed There are currently 13 people waiting for an AM to become free. Please mail nm@debian.org to become an AM and help get them into Debian!  * 6 months of DD requirement for AMs now just a recommendation We realised we were losing lots of energy by letting new DDs wait 6 months before allowing them to become AM. At the same time we are requiring previous Debian experience before becoming DD, which makes the second waiting period mostly redundant, so we lifted it: now any DD can become Application Manager as soon as they like. (The old rule was not really a hard limit, but in practice, it was rarely softened. Let's make the "soft" variant official!) This now becomes: "you have been a DD for more than 6 months now and you are not yet an AM, what are you waiting for?"  * Newmaint svn repo migrated to git, NM templates are now in collab-maint It was time to migrate the NM repo from svn to git. In the process, we split FD-only content[1] from the NM templates, and put the NM templates in collab-maint[2] so that all AMs, all DDs and even many Debian Contributors can push improvements to it. Now maintenance of the templates, like fixing of broken links, improving the language, updating bits that became obsolete and so on, can be done by any DD, and it being git, if an applicant spots something to improve in a template, the AM can go "send me a patch and I'll push it!". Also, AMs can now maintain their own branch with local tweaks, and even push it to the repo. [1] http://anonscm.debian.org/cgit/nm/nm.git/ [2] http://anonscm.debian.org/cgit/collab-maint/nm-templates.git/  * Simplified procedure for collab-maint requests Until now, collab-maint requests[3] required that the applicant applied on the Alioth project page and the advocate mailed a signed request to nm@debian.org. We figured that the first step is not really needed, and the need to cross-reference the two separate mails makes it hard to track progress in the FD mailbox. So we decided to skip the need of applying on Alioth: to get collab-maint access, now just ask a DM or DD, with whom you are going to work, to send a *signed* email to nm@debian.org like so:    To: nm@debian.org    Cc: USERNAME-guest@users.alioth.debian.org    Subject:collab-maint request        Please add FIRSTNAME LASTNAME USERNAME-guest to collab-maint.    We are going to work together on project PROJECTNAME". [3] https://lists.debian.org/debian-devel-announce/2012/01/msg00006.html  * Blurring the line between AM and FD We decided to blur the line between Application Managers and Front Desk. Application Managers are now able to:  - read the logs and mailboxes of other application managers  - see the full stats overview of all the processes in https://nm.debian.org/public/stats/ In the future we plan to also allow any AM to add log entries on any process (but not change their state). This requires nontrivial refactoring on the side code, though. Cheers, for the DAMs   Enrico   Jonathan   Christoph -- GPG key: 4096R/E7AD5568 2009-05-08 Enrico Zini <enrico@enricozini.org> Attachment: signature.asc Description: Digital signature Reply to: debian-devel-announce@lists.debian.org Enrico Zini (on-list) Enrico Zini (off-list) Prev by Date: Permanent removals from testing for Jessie Next by Date: OSI Board Elections - call for nominations from Affiliate organizations Previous by thread: Permanent removals from testing for Jessie Next by thread: OSI Board Elections - call for nominations from Affiliate organizations Index(es): Date Thread
2026-01-13T09:30:26
https://lists.debian.org/debian-devel-announce/2015/02/msg00011.html
--> Delegation for the Trademark Team [ Date Prev ][ Date Next ] [ Thread Prev ][ Thread Next ] [ Date Index ] [ Thread Index ] Delegation for the Trademark Team To : debian-devel-announce@lists.debian.org Subject : Delegation for the Trademark Team From : Lucas Nussbaum < leader@debian.org > Date : Tue, 17 Feb 2015 19:51:30 +0100 Message-id : < [🔎]   20150217185130.GA10602@xanadu.blop.info > Mail-followup-to : debian-devel@lists.debian.org Dear Developers, It is my pleasure to announce that, after being active for almost two years, the Debian Trademark Team is now ready to be made official through a delegation (between dashed lines, below). They have just introduced themselves in a separate d-d-a@ post, so I won't say more at this point. But I would like to thank Brian, Richard and Joe for working on those important matters for our project. Lucas ---------------------------------------------------------------- Trademark Team delegation ========================== I hereby appoint the following developers as members of the Debian Trademark Team: - Brian Gupta <bgupta> - Richard Hartmann <richih> Additionally, even though not officially delegated as he is not a Debian Developer yet, Joe Healy is also a member of the Trademark Team. Any previous Debian Trademark Team delegation, not explicitly listed above, is revoked. The delegation is not time-limited. It will be effective until further changes by present or future DPLs. Task Description ---------------- The Trademark team is responsible for: * answering trademark use requests (granting or denying the use of Debian's trademarks) * coordinating new registrations, updates and extensions of Debian trademarks * advising the DPL on trademark policies, in consultation with the project and our legal counsel * documenting the Debian trademark policies ---------------------------------------------------------------- Attachment: signature.asc Description: Digital signature Reply to: debian-devel-announce@lists.debian.org Lucas Nussbaum (on-list) Lucas Nussbaum (off-list) Prev by Date: Debian Trademark team Next by Date: Hosting offers for Debian development Previous by thread: Debian Trademark team Next by thread: Hosting offers for Debian development Index(es): Date Thread
2026-01-13T09:30:26
https://lists.debian.org/debian-devel-announce/2015/02/msg00003.html
--> MiniDebConf Bucharest. May 16-17, 2015. Call for Talks [ Date Prev ][ Date Next ] [ Thread Prev ][ Thread Next ] [ Date Index ] [ Thread Index ] MiniDebConf Bucharest. May 16-17, 2015. Call for Talks To : debian-devel-announce@lists.debian.org , debian-events-eu@lists.debian.org , debian-women@lists.debian.org Subject : MiniDebConf Bucharest. May 16-17, 2015. Call for Talks From : Margarita Manterola < marga@debian.org > Date : Sun, 8 Feb 2015 15:00:59 +0100 Message-id : < [🔎]   20150208140059.GA4105@localhost > Mail-followup-to : debian-devel@lists.debian.org The Debian Women project is proud to announce the second edition of its MiniDebConf, to take place this spring in Bucharest. Last year, the Debian Women MiniDebConf took place in Barcelona, gathering 150 Debian enthusiasts. We are organising two days of talks and activities about Debian on the weekend of May 16 and 17 at the new library building of the Universitatea Politehnica din București (Politehnica University of Bucharest, www.upb.ro). What makes this event special is that all our speakers will be people that identify themselves as women. You can find more information about the event at: http://bucharest2015.mini.debconf.org/ Debian Women invites submissions of proposals for papers, presentations, discussion sessions and tutorials for the event. Submissions are not limited to traditional talks: you could propose a performance, an art installation, a debate or anything else. All talks are welcome, whether newbie or very advanced level, for regular sessions (45 minutes including time for questions, 15 minute break between events) or for short sessions (20 minutes long, with 10 minute break between sessions). Please send any ideas to proposals@bucharest2015.mini.debconf.org. The deadline for proposals is March 15th, but we encourage you to send them earlier rather than later. The MiniDebConf relies on sponsors to be able to cover the expenses of our speakers. If you are interested in sponsoring this event, please contact sponsors@bucharest2015.mini.debconf.org See you in Bucharest! The MiniDebConf Orga Team Attachment: signature.asc Description: Digital signature Reply to: debian-devel-announce@lists.debian.org Margarita Manterola (on-list) Margarita Manterola (off-list) Prev by Date: OSI Board Elections - call for nominations from Affiliate organizations Next by Date: Project Secretary appointment Previous by thread: OSI Board Elections - call for nominations from Affiliate organizations Next by thread: Project Secretary appointment Index(es): Date Thread
2026-01-13T09:30:26
https://www.blogger.com/comment/fullpage/post/8072464059979174136/4914953349085630843
Post a Comment Blogger  Help Send feedback Sign in Blogger Comments on Patterns and Existentials : don't count on finding me Collapse all comments Expand all comments Load more To leave a comment, click the button on the top of this page to sign in with Google. Comment as: Select Profile: Google Account  Edit Enter Comment Publish Preview This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply. ©2026 Blogger - Privacy Policy Google apps Main menu
2026-01-13T09:30:26
https://github.com/jeremyevans/thamble/actions/workflows/ci.yml
CI · Workflow runs · jeremyevans/thamble · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / thamble Public Notifications You must be signed in to change notification settings Fork 1 Star 20 Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights Actions: jeremyevans/thamble Actions --> All workflows Workflows CI CI Show more workflows... Management Caches CI CI Actions Loading... Loading Sorry, something went wrong. Uh oh! There was an error while loading. Please reload this page . --> will be ignored since log searching is not yet available Show workflow options Create status badge Create status badge Loading Uh oh! There was an error while loading. Please reload this page . ci.yml --> will be ignored since log searching is not yet available 7 workflow runs 7 workflow runs Event Filter by Event Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching events. Status Filter by Status Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching statuses. Branch Filter by Branch Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching branches. Actor Filter by Actor Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching users. Add Ruby 4.0 to CI CI #15: Commit 746700c pushed by jeremyevans 26m 26s master master 26m 26s View workflow file Use SimpleCov.add_filter block instead of string CI #14: Commit 8ebbe68 pushed by jeremyevans 1m 50s master master 1m 50s View workflow file Add JRuby 10.0 to CI CI #13: Commit ddbeb24 pushed by jeremyevans 12m 14s master master 12m 14s View workflow file Switch rdoc task to normal rake task, avoid rdoc/task require CI #12: Commit c3084d2 pushed by jeremyevans 50s master master 50s View workflow file Work with ubuntu-latest using 24.04 by default in CI CI #11: Commit 4e21b0a pushed by jeremyevans 6m 26s master master 6m 26s View workflow file Add Ruby 3.4 to CI CI #10: Commit eff4862 pushed by jeremyevans 3m 27s master master 3m 27s View workflow file Use -W:strict_unused_block when running tests on Ruby 3.4+ CI #9: Commit 3da482a pushed by jeremyevans 1m 11s master master 1m 11s View workflow file You can’t perform that action at this time.
2026-01-13T09:30:26
https://github.com/jeremyevans/unicorn-lockdown/actions/workflows/ci.yml
CI · Workflow runs · jeremyevans/unicorn-lockdown · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / unicorn-lockdown Public Notifications You must be signed in to change notification settings Fork 0 Star 10 Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights Actions: jeremyevans/unicorn-lockdown Actions --> All workflows Workflows CI CI Show more workflows... Management Caches CI CI Actions Loading... Loading Sorry, something went wrong. Uh oh! There was an error while loading. Please reload this page . --> will be ignored since log searching is not yet available Show workflow options Create status badge Create status badge Loading Uh oh! There was an error while loading. Please reload this page . ci.yml --> will be ignored since log searching is not yet available 3 workflow runs 3 workflow runs Event Filter by Event Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching events. Status Filter by Status Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching statuses. Branch Filter by Branch Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching branches. Actor Filter by Actor Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching users. Use SimpleCov.add_filter block instead of string CI #25: Commit e5d0ad3 pushed by jeremyevans 4m 50s master master 4m 50s View workflow file Switch rdoc task to normal rake task, avoid rdoc/task require CI #24: Commit 44aa04c pushed by jeremyevans 3m 40s master master 3m 40s View workflow file Use -W:strict_unused_block when running tests on Ruby 3.4+ CI #23: Commit 537befa pushed by jeremyevans 3m 8s master master 3m 8s View workflow file You can’t perform that action at this time.
2026-01-13T09:30:26
https://lists.debian.org/debian-devel-announce/2015/02/msg00002.html
--> OSI Board Elections - call for nominations from Affiliate organizations [ Date Prev ][ Date Next ] [ Thread Prev ][ Thread Next ] [ Date Index ] [ Thread Index ] OSI Board Elections - call for nominations from Affiliate organizations To : debian-devel-announce@lists.debian.org Subject : OSI Board Elections - call for nominations from Affiliate organizations From : Lucas Nussbaum < leader@debian.org > Date : Fri, 6 Feb 2015 12:03:33 +0100 Message-id : < [🔎]   20150206110333.GA23423@xanadu.blop.info > Mail-followup-to : debian-devel@lists.debian.org Dear Developers, The Open Source Initiative (OSI) is renewing part of its board. As an Affiliate Organization, Debian can nominate candidates for the two available Affiliates seats. If you would like to be nominated by Debian please contact me before February 12th. I will then decide who to nominate before the nomination deadline (February 16th). For more information, see: http://opensource.org/board http://opensource.org/organization http://opensource.org/elections http://wiki.opensource.org/bin/OSI+Board+of+Directors/2015_election Lucas Attachment: signature.asc Description: Digital signature Reply to: debian-devel-announce@lists.debian.org Lucas Nussbaum (on-list) Lucas Nussbaum (off-list) Prev by Date: Bits from the NM process Next by Date: MiniDebConf Bucharest. May 16-17, 2015. Call for Talks Previous by thread: Bits from the NM process Next by thread: MiniDebConf Bucharest. May 16-17, 2015. Call for Talks Index(es): Date Thread
2026-01-13T09:30:26
https://lists.debian.org/debian-user-danish/
Debian Mailing Lists -- Index for debian-user-danish mailing lists Skip Quicknav About Debian Getting Debian Support Developers' Corner Mailing Lists / Index for debian-user-danish Debian Mailing Lists debian-user-danish debian-user in Danish Support for Debian users who speak Danish. Language used on this list: Danish. This list is not moderated; posting is allowed by anyone. Posting address: debian-user-danish@lists.debian.org Subscribe / Unsubscribe Your email address:   See these hints if you're having trouble unsubscribing Archives 2003 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2004 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2005 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2006 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2007 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2008 [ Jan ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Oct ] [ Nov ] [ Dec ] 2009 [ Jan ] [ Feb ] [ Mar ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Nov ] 2010 [ Feb ] [ Mar ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Nov ] [ Dec ] 2011 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Sep ] [ Oct ] [ Dec ] 2012 [ Feb ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2013 [ Feb ] [ May ] [ Oct ] [ Nov ] 2014 [ Jun ] [ Sep ] [ Nov ] [ Dec ] 2015 [ Jan ] [ Jul ] [ Aug ] [ Oct ] 2016 [ Feb ] [ Mar ] [ Apr ] [ Aug ] 2017 [ Jan ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Aug ] [ Oct ] [ Dec ] 2019 [ Jan ] [ Apr ] [ Jul ] [ Aug ] 2020 [ Jan ] [ Feb ] [ Aug ] [ Dec ] 2021 [ Jan ] [ Aug ] 2022 [ Jan ] [ Jul ] [ Aug ] [ Nov ] [ Dec ] 2023 [ Jan ] [ Feb ] [ Mar ] [ Sep ] 2024 [ Jan ] [ Feb ] [ May ] [ Jul ] 2025 [ Jun ] List archives get refreshed every 20 minutes. You can link to the most recent page in the archives for this list. Search for: Matching any words Matching all words      Syntax help Sort by: Relevance Date (newest first) Hits per page: 10 50 100 Statistics Excerpt from the list usage statistics pages: , . Back to: Debian Lists || Debian Project homepage . Home About Social Contract Code of Conduct Free Software Partners Donations Contact Us Getting Debian Network install CD/USB ISO images CD vendors Pre-installed Debian Packages News Project News Events Documentation Release Info Installation manual Debian Books Support Debian International Security Information Bug reports Mailing Lists Mailing List Archives Ports/Architectures Miscellaneous Help Debian Developers' Corner Site map Search You may submit bugs against the list archives using the lists.debian.org pseudo-package or contact the maintainer at listmaster@lists.debian.org . See the Debian contact page for further information on contacting us. Copyright © 2015 SPI and others; See license terms Debian is a registered trademark of Software in the Public Interest, Inc.
2026-01-13T09:30:26
https://lists.debian.org/search.html
Debian List Search mailing lists Skip Quicknav About Debian Getting Debian Support Developers' Corner Mailing Lists / search Debian Mailing Lists You can search the Debian mailing lists archives using the form below. A separate form allows to search for archived mails by Message-ID . Search for: Matching any words Matching all words      Syntax help Search lists: debconf-announce debconf-bid-capetown debconf-bid-paris debconf-discuss debconf-infra debconf-kids debconf-mini-berlin debconf-mini-bucharest debconf-mini-hamburg debconf-team debconf-video debconf14-team debconf15-team debconf16-team 68k academy accessibility ada admintool ai alpha amd64 android-tools announce apache arm arm-apple astro autobuild backports backports-announce backports-changes bazel beowulf blends books boot bsd bts-link cd cd-vendors changes chinese chinese-big5 chinese-gb ci cinnamon cli clojure cloud commercial common-lisp consultants cross ctte curiosa custom dak ddtp debbugs derivatives desktop devel devel-announce devel-changes devel-french devel-games devel-italian devel-m68k-changes devel-portuguese devel-powerpc-changes devel-s390-changes devel-spanish devel-sparc-changes doc dpkg dug-by dug-co dug-ie dug-in dug-kosovo dug-latinoamerica dug-muc dug-mx dug-nordic dug-nyc dug-quebec dug-taiwan dug-washington-dc dug-za edu edu-announce edu-french edu-german efi emacsen embedded enterprise esperanto events-apac events-eu events-ha events-na events-nl experimental-changes faq firewall flash fonts freedombox french gcc gis glibc go gtk-gnome hams handheld haskell hpc hppa hurd i18n ia64 infrastructure-announce input-method interix ipv6 isp italian japanese java jobs jr js kde kernel kernel-maint knoppix l10n-albanian l10n-arabic l10n-basque l10n-belarusian l10n-catalan l10n-chinese l10n-czech l10n-danish l10n-dutch l10n-english l10n-esperanto l10n-finnish l10n-fon l10n-french l10n-galician l10n-german l10n-greek l10n-hungarian l10n-indonesian l10n-italian l10n-kannada l10n-korean l10n-malayalam l10n-persian l10n-polish l10n-portuguese l10n-romanian l10n-russian l10n-serbian l10n-sicilian l10n-slovak l10n-spanish l10n-swedish l10n-turkish l10n-vietnamese laespiral laptop legal lex lint-maint lists-test live livecoding localgroups loongarch lsb lts lts-announce lts-changes mate math med mentors metadata mips mirrors mirrors-announce mobile multimedia newmaint newmaint-admin newmaint-discuss news news-french news-german news-italian news-portuguese news-spanish nonprofit ocaml-maint octave openoffice openstack outreach parisc perl photo pilot policy pool popcon powerpc printing project publicity python qa qa-packages qa-private qt-kde r release remote reportbug research riscv rtc ruby russian rust s390 s390-changes scheme science security security-announce security-tools security-tracker services-admin sgml simplified-chinese snapshot snapshots sparc sparc-changes sprints ssh stable-announce superh switzerland tag2upload testing testing-changes testing-security-announce tetex-maint tex-maint toolchain ultralinux upstream user user-catalan user-danish user-de user-dutch user-finnish user-french user-german user-greek user-icelandic user-indonesian user-polish user-portuguese user-slovenian user-spanish user-swedish user-tamil user-turkish user-ukrainian user-vietnamese volatile volatile-announce vote wb-team webapps wiki win32 wine wnpp women www x xen xfce deity package-sponsorship-requests Sort by: Relevance Date (newest first) Hits per page: 10 50 100 Searching 7,535,882 messages Back to the Debian Project homepage . You may submit bugs against the list archives using the lists.debian.org pseudo-package or contact the maintainer at listarchives@debian.org . See the Debian contact page for further information on contacting us. Template last modified: 19 February 2008. Copyright © 1997-2008 SPI ; See license terms and disclaimer . Home About Social Contract Free Software Partners Donations Contact Us Getting Debian CD vendors CD ISO images Network install Pre-installed Debian Packages News Project News Events Documentation Release Info Installation manual Debian Books Support Debian International Security Information Bug reports Mailing Lists Mailing List Archives Ports/Architectures Miscellaneous Help Debian Developers' Corner Site map Search You may submit bugs against the list archives using the lists.debian.org pseudo-package or contact the maintainer at listmaster@lists.debian.org . See the Debian contact page for further information on contacting us. Copyright © 2015 SPI and others; See license terms Debian is a registered trademark of Software in the Public Interest, Inc.
2026-01-13T09:30:26
https://lists.debian.org/debian-l10n-danish/
Debian Mailing Lists -- Index for debian-l10n-danish mailing lists Skip Quicknav About Debian Getting Debian Support Developers' Corner Mailing Lists / Index for debian-l10n-danish Debian Mailing Lists debian-l10n-danish Danish Localization Discussing Danish localization issues, mainly translating Debian docs and programs to Danish. Language used on this list: Danish. This list is not moderated; posting is allowed by anyone. Posting address: debian-l10n-danish@lists.debian.org Subscribe / Unsubscribe Your email address:   See these hints if you're having trouble unsubscribing Archives 2003 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Oct ] 2004 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Dec ] 2005 [ Jan ] [ Feb ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2006 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2007 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2008 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2009 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2010 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2011 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2012 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2013 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2014 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2015 [ Jan ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Nov ] [ Dec ] 2016 [ Feb ] [ Mar ] [ Apr ] [ May ] [ Jun ] [ Jul ] [ Oct ] [ Dec ] 2017 [ Jan ] [ Feb ] [ Mar ] [ Apr ] [ Jul ] [ Aug ] [ Sep ] [ Nov ] 2018 [ Feb ] [ Jul ] [ Aug ] [ Nov ] [ Dec ] 2019 [ Jan ] [ Feb ] [ Apr ] [ May ] [ Jun ] [ Aug ] 2020 [ Feb ] [ Mar ] [ Aug ] [ Sep ] [ Nov ] [ Dec ] 2021 [ Feb ] [ Mar ] [ Oct ] 2022 [ Feb ] [ May ] [ Aug ] [ Oct ] [ Nov ] 2023 [ Jan ] [ Apr ] [ Sep ] 2024 [ Jul ] [ Aug ] [ Sep ] [ Oct ] [ Dec ] 2025 [ Jan ] [ Mar ] [ Jun ] [ Jul ] [ Sep ] [ Dec ] 2026 [ Jan ] List archives get refreshed every 20 minutes. You can link to the most recent page in the archives for this list. Search for: Matching any words Matching all words      Syntax help Sort by: Relevance Date (newest first) Hits per page: 10 50 100 Statistics Excerpt from the list usage statistics pages: , . Back to: Debian Lists || Debian Project homepage . Home About Social Contract Code of Conduct Free Software Partners Donations Contact Us Getting Debian Network install CD/USB ISO images CD vendors Pre-installed Debian Packages News Project News Events Documentation Release Info Installation manual Debian Books Support Debian International Security Information Bug reports Mailing Lists Mailing List Archives Ports/Architectures Miscellaneous Help Debian Developers' Corner Site map Search You may submit bugs against the list archives using the lists.debian.org pseudo-package or contact the maintainer at listmaster@lists.debian.org . See the Debian contact page for further information on contacting us. Copyright © 2015 SPI and others; See license terms Debian is a registered trademark of Software in the Public Interest, Inc.
2026-01-13T09:30:26
http://debian.anexia.at/debian-cd/
Index of /debian-cd/ Index of /debian-cd/ ../ 13.3.0/ 10-Jan-2026 21:07 - 13.3.0-live/ 10-Jan-2026 21:07 - current/ 10-Jan-2026 21:07 - current-live/ 10-Jan-2026 21:07 - project/ 23-May-2005 16:50 - ls-lR.gz 12-Jan-2026 00:12 10930
2026-01-13T09:30:26
https://github.com/jeremyevans/capybara-restore_state/actions/workflows/ci.yml
CI · Workflow runs · jeremyevans/capybara-restore_state · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / capybara-restore_state Public Notifications You must be signed in to change notification settings Fork 0 Star 0 Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights Actions: jeremyevans/capybara-restore_state Actions --> All workflows Workflows CI CI Show more workflows... Management Caches CI CI Actions Loading... Loading Sorry, something went wrong. Uh oh! There was an error while loading. Please reload this page . --> will be ignored since log searching is not yet available Show workflow options Create status badge Create status badge Loading Uh oh! There was an error while loading. Please reload this page . ci.yml --> will be ignored since log searching is not yet available 7 workflow runs 7 workflow runs Event Filter by Event Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching events. Status Filter by Status Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching statuses. Branch Filter by Branch Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching branches. Actor Filter by Actor Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching users. Add Ruby 4.0 to CI CI #15: Commit 0bdd363 pushed by jeremyevans 3m 49s master master 3m 49s View workflow file Use SimpleCov.add_filter block instead of string CI #14: Commit bf80ada pushed by jeremyevans 1m 12s master master 1m 12s View workflow file Add JRuby 10.0 to CI CI #13: Commit f328554 pushed by jeremyevans 3m 50s master master 3m 50s View workflow file Switch rdoc task to normal rake task, avoid rdoc/task require CI #12: Commit 85eff71 pushed by jeremyevans 1m 29s master master 1m 29s View workflow file CI CI #11: by jeremyevans 1m 13s master master 1m 13s View workflow file Add Ruby 3.4 to CI CI #10: Commit 46528db pushed by jeremyevans 1m 15s master master 1m 15s View workflow file Use -W:strict_unused_block when running tests on Ruby 3.4+ CI #9: Commit 5f5a8d0 pushed by jeremyevans 1m 15s master master 1m 15s View workflow file You can’t perform that action at this time.
2026-01-13T09:30:26
http://debian-cd.mirror.web4u.cz/
Index of / Index of / Name Last Modified Size Type .. /   -   Directory 13.3.0 / 2026-Jan-10 22:07:21 -   Directory 13.3.0-live / 2026-Jan-10 22:07:21 -   Directory current / 2026-Jan-10 22:07:21 -   Directory current-live / 2026-Jan-10 22:07:21 -   Directory debian-cd / 2026-Jan-10 22:29:44 -   Directory project / 2005-May-23 18:50:12 -   Directory ls-lR.gz 2026-Jan-12 11:12:01 10.6K application/gzip lighttpd/1.4.45
2026-01-13T09:30:26
http://hackage.haskell.org/packages/tags
Hackage tags | Hackage Hackage :: [Package] Home Search   Browse What's new Upload User accounts Hackage tags By name , #AncientEgypt , .net , Diagrams , Excel , GraphViz , PhLADiPreLiO , PostgreSQL , RealFrac , Ukrainian , ab1 , abif , accelerate , accessanalyzer , accessibility , acme , acmpca , actors , adjunctions , adsb , aerospace , aeson , aftovolio , agda , agpl , ai , aiops , algebra , algebra-uniform , algorithm , algorithm-visualization , algorithmic-composition , algorithmic-music-composition , algorithms , algorithms- , all-rights-reserved , amazon , amazonmq , amplify , amplifyuibuilder , amqp , analysis , anatomy , animation , ansi , aop , apache , api , apigateway , apigatewayv2 , appconfig , appflow , appintegrations , apple , application , application-server , applicationautoscaling , applicationinsights , applicationsignals , applicative , appmesh , apprunner , appstream , appsync , apptest , aps , archaeoinformatics , archive , arcregionswitch , arczonalshift , argumentation , arithmetic , array , arrows , artificial-intelligence , arxiv , ascii , ask , asp , aspect-oriented-programming , assembler , ast , astrology , astronomy , athena , atom , ats , attoparsec , attribute-grammars , audio , auditmanager , authentication , automatic-music-generation , automation , autoscaling , autoscalingplans , avers , aviation , aws , azure , b2bi , backup , backupgateway , barcode , base , base16 , base32 , base64 , batch , bcmdataexports , bedrock , bedrockagentcore , benchmark , benchmarking , big-data , billing , billingconductor , binary , binary-search , bindings , bio , bioinformatics , bioinformatics- , bit , bit-vectors , bitcoin , bits , blockchain , blog , book , browser , bsd , bsd2 , bsd3 , bsd3- , bsd4 , bsparse , budgets , build , build-tool , builders , building , bundle , business , bytes , bytestring , bytestrings , bzip , c , c# , cabal , cache , caching , calendar , capnproto , captcha , cardano , cashflow , cassandra , cast , categories , category , category-theory , catgirls , ce , certificatemanager , cgi , chaos-music , charts , chat , chatbot , chemistry , chess-engine , chromatogram , chrome , chs , ci , classes , classification , clckwrks , cleanrooms , cleanroomsml , cli , cli-tool , clickhouse , client , clipboard , closure , cloud , cloud-haskell , cloud9 , cloudformation , cloudfront , cloudtrail , cloudwatch , clr , clustering , cmdlineargs , code-analysis , code-competitions , code-generation , code-generator , codeartifact , codebuild , codec , codecommit , codeconnections , codecs , codedeploy , codegen , codeguruprofiler , codegurureviewer , codepipeline , codequality , codes , codestar , codestarconnections , codestarnotifications , coerce , cognito , coherency , coin , combinatorics , combinators , command-line , command-line-tool , command-line-tools , commandline , commerce , commercial , common-parts , comonad , comonads , compatibility , compilation , compiler , compiler-plugin , compilers , compilers-interpreters , composite , composition , comprehend , compression , computational-geometry , computer-algebra , concourse , concurrency , concurrent , conduit , config , configuration , connect , connectcampaigns , connectcampaignsv2 , console , constraint , constraints , consul , containers , contract , contracts , contravariant , control , control- , control-language , control. , control.monad , control.parallel.eden , controltower , convenience , conversion , conversions , couchdb , covenant , cpp , cqrs , crdt , criu , cron , crosswords , crypto , cryptocurrency , cryptography , csharp , cssyd , csv , culinary , cur , cursor , customerprofiles , customsetup , data , data- , data-conduit , data-flow , data-mining , data-mining----------- , data-network , data-processing , data-science , data-structure , data-structures , data-text-json-yaml-pandoc , data-text-uniform , database , database- , database-design , database-driver , database-testing-web , databases , databrew , datacontrol , dataflow , datamining , datapipeline , datasync , datazone , date , dax , deadline , debian , debug , debuggers , debugging , decoder , decoding , decompiler , deep-learning , default , delay , deltaq , demo , dependency-injection , dependent-types , deprecated , derive-monoid , derive-monoid- , deriving , desktop , desktop-environment , detective , development , development- , development--- , development-web , devops , devopsguru , dfinity , dhall , dhall-pandoc , diagnostics , diagram , diagrams , diffing , digest , dijkstra , directory , directoryservice , disassembler , discord , distrbution , distributed-computing , distributed-systems , distribution , dlm , dms , dns , docdb , docdbelastic , docker , documentation , domain-specific-language , download-manager , dsl , dsql , dynamic-programming , dynamodb , ebnf , ec2 , ecr , ecs , eden , editing , editor , education , educational , effect , effectful , effects , efficient-xml-pretty-printer , efs , eks , elasticache , elasticbeanstalk , elasticloadbalancing , elasticloadbalancingv2 , elasticsearch , electrs , elliptic-curves , elm , emacs , email , email--- , embedded , emr , emrcontainers , emrserverless , encoding , entityresolution , enumerator , envars , environment , error , error-exception-uniform , error-handling , error-reporting , espeak , eternity , eth , ethereum , etl , eval.so , event-sourcing , eventloop , events , eventschemas , eventsourcing , eventstore , evidently , evs , evt , example , exception , exceptions , executable , experiment , experimental , extension , extremum-estimator , faas , factory , factual , failure , fake , fakedata , fay , fcm , fedora , feed , ffi , ffi- , ffi-tools , file , file-manager , filepath , filesystem , filter , filters , finance , finance- , finance-network-bitcoin , financial , find , finspace , fis , fitness , flatpak , flight , flink , fms , fold , folding , font , forecast , forecasting , foreign , foreign-binding , formal-languages , formal-methods , format , formatting , fortran , foundation , fractals , framework , frauddetector , frp , fsm , fsx , functions , functors , futhark , futures , fuzzy , game , game- , game-development , game-engine , gamelift , games , games- , gateway , geckodriver , gemini , genealogy , general , generative-music-grammars , generic , generics , gentoo , geo , geodgraphy , geography , geometry , geospatial , ghc , gis , gis-programs , git , github , giveyouahead , globalaccelerator , glpk , glue , go , google , gpl , gps , gpu , grafana , graph , graphics , graphql , graphs , greengrass , greengrassv2 , groundhog , groundhog------------------------ , groundstation , groups , grpc , guardduty , gui , hakyll , ham , ham-radio , happstack , hardware , hash , haskeline , haskell , haskell-admin , haskell2010 , haskell2020 , haskell98 , hasql , hateoas , health , healthimaging , healthlake , help , heuristics , hie , hkd , hls , hnum , hsm , hspec , html , http , hxt , hydraulics , hydrology , i18 , i18n , i18n-text , i2c , i3 , iam , ide , identification , identity , identitystore , idl , ihaskell , ihp , image , image-processing , image-viewer , imagebuilder , images , in-other-words , indentation , indexed , infrastructure , inspection , inspector , inspectorv2 , instances , integration , interaction , interactive , interfaces , internetmonitor , interpolated , interpolation , interpreter , interpreters , interval , invoicing , io , io-streams , ioc , iot , iotanalytics , iotcoredeviceadvisor , iotevents , iotfleethub , iotfleetwise , iotsitewise , iotthingsgraph , iottwinmaker , iotwireless , ipa , irc , irc-client , iri , iteratee , ivs , ivschat , j , japanese-natural-language-processing , java , javascript , json , json-rpc , json-web-token , json5 , jsx , jvm , jwt , kafkaconnect , kendra , kendraranking , kerf , ketchup , keynote , keyvalue , keyword-extractor , kinesis , kinesisanalytics , kinesisanalyticsv2 , kinesisfirehose , kinesisvideo , kml , kms , korean , lakeformation , lalr , lambda , lambda-cube , lambdacalculus , language , language- , language-tools , language.nix , languages , latex , launchwizard , lazy , learning , learning-environments , learning-haskell , lens , lenses , lenses----- , lex , lexer , lexers , lexing , lgpl , lib , library , libsodium , licensemanager , lightning , lightsail , linear-algebra , linear-programming , linearalgebra , linguistics , linnet , linux , linux-desktop , lisp , list , lists , little-game , live-coding , llama , llm , local-search , location , log , logger , logging , logic , logic-programming , logs , logstash , lookoutequipment , lookoutmetrics , lookoutvision , lrucache , lua , m2 , machine-learning , machine-vision , machines , macie , macros , mail , managed-functions , managedblockchain , manatee , map , mapreduce , markdown , math , math- , math---------- , mathematics , maths , matrix , mcp , media , mediaconnect , mediaconvert , medialive , mediapackage , mediapackagev2 , mediastore , mediatailor , medical , megaparsec , memoization , memory , memorydb , message-oriented , message-oriented-middleware , meta , metalanguage , metaprogramming , metrics , microcontroller , microservice , middleware , minecraft , miscellaneous , miso , mit , mobile , model , model-learning , modelling , modules , monad , monad-transformers , monadic-regions , monadio , monads , money , monitoring , monoidal , mpa , mpl , mptcp , msk , mtl , multimedia , multimedia-player , mumeric.statistics , murmur , music , musicbrainz , mutable-state , mwaa , n2o , na , naqsha , natural-language , natural-language-processing , neovim , neptune , neptunegraph , net , network , network- , network-api , network-apis , network-control , networkapi , networkapis , networkfirewall , networking , networkmanager , nix , nlp , noise , non-determinism , none , nonempty , notifications , notificationscontacts , ntrol , number , number-theory , numbers , numeric , numerical , numerics , oam , oauth , oauth2 , object-storage , observability , observabilityadmin , ocaml , ocilib , odb , odpi-c , office , ogc , ollama , omics , oop , openapi , opengl , openlayers , opensearchserverless , opensearchservice , opentelemetry , operating-system , operations , opsworks , optics , optimisation , optimization , options , oracle , organizations , orphan-instances , osis , other , other- , overloadelabels , package-management , package.category , packaging , pagerduty , pandoc , panorama , parallel , parallelism , parry , parser , parser-builder , parser-combinators , parsercombinators , parsercombinators-parsing-text , parsers , parsing , parsing- , parsing-text , password , pattern , pattern-classification , pattern-recognition , paymentcryptography , payments , pcaconnectorad , pcaconnectorscep , pcs , pdf , pdf-latex , pdf-viewer , performance , permutations , persistent , personalgrowth , personalize , phantom-types , phishing , phladiprelio , phonetic-languages , phonetics , php , physics , picture , pinboard , pinpoint , pinpointemail , pipes , pkcs11 , pl-sql-tools , plaid , planning , plotting , plugin , plugins , poetry , poker , politic , polymorphism , polyrhythmicity , polysemy , polysemy-filesystem , polysemy-vinyl , polysemy-vinyl-composite , portal , possehl-analytics , postgresql , potoki , prelude , preprocessor , presentation , pretty-printer , pretty-printing , primitive , privacy , probability , process , process-manager , productivity , profiling , profunctors , program , program-transformation , programming-uniform , project , project-management , prompt , propagators , prosodic-languages , prosody , proto , protocol , protocols , proton , proxies , proxy , psp , ptr , public-domain , pugs , pup-events , purescript , pvp , python , qbusiness , ql , qldb , qr , qualifieddo , quality , quant , quantum , quasiqoutes , quasiquoters , quasiquotes , quickcheck , quicksight , quipper , qux , raaz , rabbitmq , radio , rake , ram , random , rap , raphics , raspberrypi , rate-limiter , raw , rbin , rdf , rds , reactive , reactivity , record , records , recursion , redis , redshift , redshiftserverless , refactoring , refactorspaces , reflection , reflection- , reflex , regex , reinforcement-learning , rekognition , relational-algebra , relaxng , relude , remote-management , repl , resiliencehub , resourceexplorer2 , resourcegroups , resources , rest , reverse-engineering , rewriting , rfc , rfc-9901 , rfc4648 , rhythm , rhythmicity , robomaker , robotics , roguelike , roles , rolesanywhere , rounding , route53 , route53profiles , route53recoverycontrol , route53recoveryreadiness , route53resolver , rpc , rss , rss-atom-reader , rtbfabric , ruby , rum , rumba , rust , s3 , s3express , s3objectlambda , s3outposts , s3tables , saas , safe , sagemaker , sample-code , sast , sax , scene , schedule , scheduler , scheduling , schema , science , scientific , scientific-simulation , scotty , screencast , screensaver , script , scripting , sdb , sdr , search , secretsmanager , securitisation , security , security- , securityhub , securitylake , selective , selective-disclosure , selenium , semantic-web , semigroupoids , semigroups , sequences , serialization , serialization- , servant , server , serverless , service , servicecatalog , servicecatalogappregistry , servicediscovery , services , ses , set-theory , setup , shake , shell , shield , si5351 , signatures , signer , silk , silly-tool , simd , simple , simspaceweaver , simulation , singletons , smartcard , smsvoice , smt , smt---------- , snap , snaplet-fay , sns , socket , software , software-defined-radio , solver , sorting , sound , source , source-code-analysis , source-tools , sox , spam , speech-approximation , speech-transformation , spellchecker , spreadsheet , sql , sqlite , sqs , ssm , ssmcontacts , ssmguiconnect , ssmincidents , ssmquicksetup , sso , staged , state-machines , static , static-analysis , staticanalysis , statistical-modeling , statistics , steganography , stemming , stepfunctions , stm , stm32 , stochastic-control , stomp , storage , stratux , stream , streaming , streamly , strict , string , structuredfinance , structuredfinancesecuritisationcashflow , structures , subscriptions , subversion , succinct-data-structures , support-vector-machine , supportapp , svd , svg , swagger , syllable-segmentation , syllables , symbolic-arithmetic , symbolic-computation , syntax , syntcomp , synthetics , syslog , system , system--- , system-tools , systems , systemsmanagersap , tar , task , taskwarrior , tasty , tasty-kat , tax , teaching , telemetry , template , template-haskell , templatehaskell , templates , templating , tensors , terminal , terraform , test , test------------------------ , testing , testing- , testing-hackage , text , text- , text-editor , text-recognition , text-to-speech , text.parsercombinators , text.parsercombinators-parsing-text , text.prettyprint , th , th- , theorem-provers , theorem-proving , these , this , thrift , timbre , time , time-frequency-distributions , time-uniform , timeout , timestream , tinytools , todo , token , tokenisation , toml , tonality , tonatona , tool , tooling , tools , topology , touchdesigner , trace , tracing , training , trans , transfer , transformation , transformation- , transformers , translation , transpiler , tree , tree-sitter , tropical-geometry , tropical-geometry- , truth-maintenance , try , tts , tui , tui-tool , tutorial , tutorials , type , type-errors , type-inference , type-provider , type-safe , type-system , type-theory , typechecking , typeclass , typeid , types , typescript , typesystems , typography , udp , ui , unclassified , unicode , unification , uniform , uniform-handling-of---some-pandoc-stuff , unikernel , uniqueness , uniqueness-periods , uniquenessPeriods , unity3d , unknown , unlift , unsafe , ur-web , urbit , uri , url , user-interface , user-interfaces , userinterface , util , utilities , utility , utils , utils- , utxo , uuid , uuidv7 , uzbl , validation , validity , value , valve , vector , verification , verifiedpermissions , video , video-polysemy , vinyl , visual-programming , visualization , voice , voiceid , vpclattice , vscode , vty , vulkan , waf , wafregional , wafv2 , wai , warning , wasm , watch , water , web , web-scraping , web-server , web-xml , web-yesod , web3 , webassembly , webb , webdevelopment , webdriver , webframework , webrtc , websockets , welcome , well-known-text , wiki , windowmanager , windows , wisdom , wkt , workflow , workspaces , workspacesinstances , workspacesthinclient , workspacesweb , writing-systems , wsjt-x , wsjtx , x11 , xdg , xfce , xlsx , xml , xml- , xmonad , xmpp , xray , yaml , yampa , yampa- , yesod , yi , zeromq , zift , zip , zipkin , zippers , zlib By frequency library (17260), bsd3 (10529), program (4072), mit (3924), data (2600), web (2089), deprecated (1318), text (1080), network (991), gpl (966), development (923), control (873), system (833), language (803), math (755), mpl (676), graphics (667), aws (649), apache (629), database (577), unclassified (492), testing (462), data-structures (351), cloud (320), public-domain (312), game (300), parsing (277), concurrency (267), lgpl (261), sound (229), cryptography (220), codec (212), bsd2 (195), google (189), distribution (160), agpl (154), compilers-interpreters (147), generics (146), ffi (145), algorithms (139), bioinformatics (128), json (122), foreign (119), utils (117), xml (115), frp (111), music (111), yesod (108), ai (103), prelude (102), console (99), monads (98), user-interfaces (96), natural-language-processing (95), numeric (90), bindings (84), finance (83), gui (83), conduit (76), numerical (76), machine-learning (75), compiler (72), servant (72), hardware (71), logging (70), utility (70), configuration (69), time (69), algebra (68), distributed-computing (67), statistics (67), streaming (67), dependent-types (61), cli (59), pipes (58), lenses (57), tools (56), acme (55), application (55), debug (53), test (52), theorem-provers (52), template-haskell (51), game-engine (50), security (48), api (46), graphs (46), formal-methods (44), filesystem (43), logic (43), type-system (43), embedded (40), nix (40), reactivity (40), records (39), parallelism (38), physics (38), compression (36), javascript (36), postgresql (36), snap (35), crypto (33), education (33), enumerator (33), ghc (33), serialization (33), documentation (32), effect (32), code-generation (31), error-handling (31), phonetic-languages (31), parser (30), html (29), image (29), Ukrainian (28), accelerate (27), aviation (27), data-mining (27), failure (26), monad (26), other (26), types (25), combinators (24), constraints (24), csv (24), optimization (24), pretty-printer (24), profiling (24), benchmarking (23), random (23), smt (23), geometry (22), list (22), mathematics (22), bitcoin (21), desktop (21), editor (21), hasql (21), io-streams (21), media (21), optics (21), optimisation (21), streamly (21), comonads (19), compiler-plugin (19), eventsourcing (19), lens (19), simulation (19), foreign-binding (18), network-apis (18), project (18), science (18), symbolic-computation (18), utilities (18), yi (18), array (17), audio (17), happstack (17), ide (17), manatee (17), monitoring (17), number-theory (17), services (17), compatibility (16), geography (16), git (16), haskell (16), jvm (16), networking (16), options (16), polysemy (16), protocol (16), aerospace (15), email (15), java (15), opentelemetry (15), plugin (15), recursion (15), search (15), authentication (14), command-line (14), concurrent (14), gpu (14), graphql (14), sox (14), tensors (14), tree-sitter (14), user-interface (14), bit-vectors (13), dsl (13), exceptions (13), formal-languages (13), shake (13), terminal (13), trace (13), validity (13), clckwrks (12), irc (12), metrics (12), monadic-regions (12), observability (12), string (12), unicode (12), bit (11), chemistry (11), composition (11), data-science (11), functors (11), io (11), parsers (11), performance (11), swagger (11), ui (11), build (10), categories (10), client (10), codecs (10), dhall (10), extension (10), fay (10), ffi-tools (10), functions (10), http (10), nlp (10), pdf (10), reactive (10), reflection (10), scripting (10), teaching (10), tool (10), .net (9), algorithm (9), arrows (9), browser (9), cardano (9), composite (9), distributed-systems (9), hash (9), interfaces (9), maths (9), quipper (9), source-tools (9), static-analysis (9), template (9), vector (9), archive (8), ats (8), bio (8), blockchain (8), business (8), bytestring (8), cli-tool (8), codegen (8), command-line-tools (8), compilers (8), conversion (8), ethereum (8), file (8), gemini (8), graph (8), linguistics (8), neovim (8), pugs (8), regex (8), robotics (8), succinct-data-structures (8), tonatona (8), type (8), uniform (8), algorithmic-composition (7), clustering (7), containers (7), demo (7), docker (7), elm (7), latex (7), live-coding (7), memory (7), phonetics (7), possehl-analytics (7), quasiquotes (7), remote-management (7), simple (7), syntax (7), these (7), zift (7), animation (6), builders (6), building (6), c (6), cache (6), clr (6), data- (6), databases (6), debugging (6), devops (6), games (6), github (6), money (6), package-management (6), password (6), refactoring (6), reflex (6), todo (6), toml (6), tui (6), typography (6), util (6), validation (6), value (6), xmonad (6), PhLADiPreLiO (5), adsb (5), binary (5), category (5), charts (5), ci (5), cloud-haskell (5), command-line-tool (5), contravariant (5), debian (5), desktop-environment (5), effects (5), framework (5), futhark (5), generic (5), interpolation (5), linux (5), logic-programming (5), mail (5), message-oriented-middleware (5), mobile (5), model (5), payments (5), phantom-types (5), politic (5), productivity (5), profunctors (5), pup-events (5), redis (5), safe (5), scheduling (5), service (5), singletons (5), spam (5), speech-approximation (5), stratux (5), svg (5), tar (5), telemetry (5), tooling (5), tree (5), uniqueness (5), yaml (5), accessibility (4), aeson (4), argumentation (4), avers (4), backup (4), cabal (4), category-theory (4), classification (4), commandline (4), comonad (4), database-testing-web (4), disassembler (4), environment (4), experimental (4), font (4), general (4), languages (4), microcontroller (4), n2o (4), openapi (4), operating-system (4), pattern (4), polymorphism (4), primitive (4), reverse-engineering (4), schema (4), shell (4), software (4), sorting (4), speech-transformation (4), stm32 (4), stomp (4), syllable-segmentation (4), thrift (4), unification (4), uniqueness-periods (4), userinterface (4), video (4), vinyl (4), wai (4), webdriver (4), writing-systems (4), apple (3), astronomy (3), attoparsec (3), automation (3), binary-search (3), bioinformatics- (3), bsd4 (3), build-tool (3), combinatorics (3), config (3), data-flow (3), data-structure (3), database- (3), dataflow (3), datamining (3), date (3), eden (3), fedora (3), file-manager (3), format (3), hakyll (3), haskell2010 (3), hkd (3), image-viewer (3), interpreters (3), language- (3), lexer (3), lib (3), lightning (3), linear-algebra (3), linnet (3), machine-vision (3), machines (3), memoization (3), middleware (3), multimedia (3), mutable-state (3), net (3), noise (3), non-determinism (3), numerics (3), plugins (3), poker (3), potoki (3), preprocessor (3), probability (3), quantum (3), quickcheck (3), raspberrypi (3), repl (3), rss (3), selenium (3), semantic-web (3), simd (3), source-code-analysis (3), spreadsheet (3), sqlite (3), templatehaskell (3), timbre (3), tracing (3), unknown (3), visualization (3), voice (3), RealFrac (2), actors (2), adjunctions (2), algorithm-visualization (2), all-rights-reserved (2), aop (2), application-server (2), applicative (2), artificial-intelligence (2), arxiv (2), aspect-oriented-programming (2), base (2), benchmark (2), big-data (2), bsd (2), bundle (2), caching (2), chat (2), clickhouse (2), commercial (2), computational-geometry (2), control- (2), criu (2), customsetup (2), data-text-uniform (2), datacontrol (2), deep-learning (2), default (2), deltaq (2), dependency-injection (2), development- (2), diagnostics (2), diagram (2), digest (2), directory (2), dns (2), download-manager (2), educational (2), example (2), exception (2), executable (2), experiment (2), factual (2), fake (2), fakedata (2), filepath (2), filter (2), filters (2), financial (2), flatpak (2), formatting (2), foundation (2), genealogy (2), geo (2), giveyouahead (2), groups (2), grpc (2), ham (2), haskell-admin (2), haskell98 (2), health (2), help (2), heuristics (2), hie (2), hls (2), hspec (2), i18n (2), i2c (2), idl (2), ihp (2), image-processing (2), integration (2), interaction (2), interpreter (2), iot (2), irc-client (2), lambdacalculus (2), language.nix (2), linearalgebra (2), lists (2), llm (2), local-search (2), mapreduce (2), markdown (2), medical (2), minecraft (2), miso (2), mptcp (2), multimedia-player (2), natural-language (2), numbers (2), oauth (2), oauth2 (2), ocaml (2), opengl (2), oracle (2), packaging (2), pandoc (2), parallel (2), parser-combinators (2), pattern-classification (2), persistent (2), phladiprelio (2), plotting (2), poetry (2), polysemy-filesystem (2), program-transformation (2), project-management (2), prosodic-languages (2), prosody (2), ptr (2), purescript (2), qr (2), qux (2), radio (2), raw (2), rdf (2), resources (2), rewriting (2), rhythm (2), roguelike (2), rpc (2), saas (2), sample-code (2), scientific-simulation (2), scotty (2), server (2), setup (2), software-defined-radio (2), sql (2), state-machines (2), statistical-modeling (2), stm (2), stream (2), structures (2), system-tools (2), task (2), templating (2), th (2), timeout (2), transformation (2), transformers (2), typeclass (2), typescript (2), unsafe (2), ur-web (2), urbit (2), uri (2), visual-programming (2), vulkan (2), web-scraping (2), webassembly (2), windows (2), workflow (2), x11 (2), zip (2), zippers (2), (1), #AncientEgypt (1), Diagrams (1), Excel (1), GraphViz (1), PostgreSQL (1), ab1 (1), abif (1), accessanalyzer (1), acmpca (1), aftovolio (1), agda (1), aiops (1), algebra-uniform (1), algorithmic-music-composition (1), algorithms- (1), amazon (1), amazonmq (1), amplify (1), amplifyuibuilder (1), amqp (1), analysis (1), anatomy (1), ansi (1), apigateway (1), apigatewayv2 (1), appconfig (1), appflow (1), appintegrations (1), applicationautoscaling (1), applicationinsights (1), applicationsignals (1), appmesh (1), apprunner (1), appstream (1), appsync (1), apptest (1), aps (1), archaeoinformatics (1), arcregionswitch (1), arczonalshift (1), arithmetic (1), ascii (1), ask (1), asp (1), assembler (1), ast (1), astrology (1), athena (1), atom (1), attribute-grammars (1), auditmanager (1), automatic-music-generation (1), autoscaling (1), autoscalingplans (1), azure (1), b2bi (1), backupgateway (1), barcode (1), base16 (1), base32 (1), base64 (1), batch (1), bcmdataexports (1), bedrock (1), bedrockagentcore (1), billing (1), billingconductor (1), bits (1), blog (1), book (1), bsd3- (1), bsparse (1), budgets (1), bytes (1), bytestrings (1), bzip (1), c# (1), calendar (1), capnproto (1), captcha (1), cashflow (1), cassandra (1), cast (1), catgirls (1), ce (1), certificatemanager (1), cgi (1), chaos-music (1), chatbot (1), chess-engine (1), chromatogram (1), chrome (1), chs (1), classes (1), cleanrooms (1), cleanroomsml (1), clipboard (1), closure (1), cloud9 (1), cloudformation (1), cloudfront (1), cloudtrail (1), cloudwatch (1), cmdlineargs (1), code-analysis (1), code-competitions (1), code-generator (1), codeartifact (1), codebuild (1), codecommit (1), codeconnections (1), codedeploy (1), codeguruprofiler (1), codegurureviewer (1), codepipeline (1), codequality (1), codes (1), codestar (1), codestarconnections (1), codestarnotifications (1), coerce (1), cognito (1), coherency (1), coin (1), commerce (1), common-parts (1), compilation (1), comprehend (1), computer-algebra (1), concourse (1), connect (1), connectcampaigns (1), connectcampaignsv2 (1), constraint (1), consul (1), contract (1), contracts (1), control-language (1), control. (1), control.monad (1), control.parallel.eden (1), controltower (1), convenience (1), conversions (1), couchdb (1), covenant (1), cpp (1), cqrs (1), crdt (1), cron (1), crosswords (1), cryptocurrency (1), csharp (1), cssyd (1), culinary (1), cur (1), cursor (1), customerprofiles (1), data-conduit (1), data-mining----------- (1), data-network (1), data-processing (1), data-text-json-yaml-pandoc (1), database-design (1), database-driver (1), databrew (1), datapipeline (1), datasync (1), datazone (1), dax (1), deadline (1), debuggers (1), decoder (1), decoding (1), decompiler (1), delay (1), derive-monoid (1), derive-monoid- (1), deriving (1), detective (1), development--- (1), development-web (1), devopsguru (1), dfinity (1), dhall-pandoc (1), diagrams (1), diffing (1), dijkstra (1), directoryservice (1), discord (1), distrbution (1), dlm (1), dms (1), docdb (1), docdbelastic (1), domain-specific-language (1), dsql (1), dynamic-programming (1), dynamodb (1), ebnf (1), ec2 (1), ecr (1), ecs (1), editing (1), effectful (1), efficient-xml-pretty-printer (1), efs (1), eks (1), elasticache (1), elasticbeanstalk (1), elasticloadbalancing (1), elasticloadbalancingv2 (1), elasticsearch (1), electrs (1), elliptic-curves (1), emacs (1), email--- (1), emr (1), emrcontainers (1), emrserverless (1), encoding (1), entityresolution (1), envars (1), error (1), error-exception-uniform (1), error-reporting (1), espeak (1), eternity (1), eth (1), etl (1), eval.so (1), event-sourcing (1), eventloop (1), events (1), eventschemas (1), eventstore (1), evidently (1), evs (1), evt (1), extremum-estimator (1), faas (1), factory (1), fcm (1), feed (1), ffi- (1), finance- (1), finance-network-bitcoin (1), find (1), finspace (1), fis (1), fitness (1), flight (1), flink (1), fms (1), fold (1), folding (1), forecast (1), forecasting (1), fortran (1), fractals (1), frauddetector (1), fsm (1), fsx (1), futures (1), fuzzy (1), game- (1), game-development (1), gamelift (1), games- (1), gateway (1), geckodriver (1), generative-music-grammars (1), gentoo (1), geodgraphy (1), geospatial (1), gis (1), gis-programs (1), globalaccelerator (1), glpk (1), glue (1), go (1), gps (1), grafana (1), greengrass (1), greengrassv2 (1), groundhog (1), groundhog------------------------ (1), groundstation (1), guardduty (1), ham-radio (1), haskeline (1), haskell2020 (1), hateoas (1), healthimaging (1), healthlake (1), hnum (1), hsm (1), hxt (1), hydraulics (1), hydrology (1), i18 (1), i18n-text (1), i3 (1), iam (1), identification (1), identity (1), identitystore (1), ihaskell (1), imagebuilder (1), images (1), in-other-words (1), indentation (1), indexed (1), infrastructure (1), inspection (1), inspector (1), inspectorv2 (1), instances (1), interactive (1), internetmonitor (1), interpolated (1), interval (1), invoicing (1), ioc (1), iotanalytics (1), iotcoredeviceadvisor (1), iotevents (1), iotfleethub (1), iotfleetwise (1), iotsitewise (1), iotthingsgraph (1), iottwinmaker (1), iotwireless (1), ipa (1), iri (1), iteratee (1), ivs (1), ivschat (1), j (1), japanese-natural-language-processing (1), json-rpc (1), json-web-token (1), json5 (1), jsx (1), jwt (1), kafkaconnect (1), kendra (1), kendraranking (1), kerf (1), ketchup (1), keynote (1), keyvalue (1), keyword-extractor (1), kinesis (1), kinesisanalytics (1), kinesisanalyticsv2 (1), kinesisfirehose (1), kinesisvideo (1), kml (1), kms (1), korean (1), lakeformation (1), lalr (1), lambda (1), lambda-cube (1), language-tools (1), launchwizard (1), lazy (1), learning (1), learning-environments (1), learning-haskell (1), lenses----- (1), lex (1), lexers (1), lexing (1), libsodium (1), licensemanager (1), lightsail (1), linear-programming (1), linux-desktop (1), lisp (1), little-game (1), llama (1), location (1), log (1), logger (1), logs (1), logstash (1), lookoutequipment (1), lookoutmetrics (1), lookoutvision (1), lrucache (1), lua (1), m2 (1), macie (1), macros (1), managed-functions (1), managedblockchain (1), map (1), math- (1), math---------- (1), matrix (1), mcp (1), mediaconnect (1), mediaconvert (1), medialive (1), mediapackage (1), mediapackagev2 (1), mediastore (1), mediatailor (1), megaparsec (1), memorydb (1), message-oriented (1), meta (1), metalanguage (1), metaprogramming (1), microservice (1), miscellaneous (1), model-learning (1), modelling (1), modules (1), monad-transformers (1), monadio (1), monoidal (1), mpa (1), msk (1), mtl (1), mumeric.statistics (1), murmur (1), musicbrainz (1), mwaa (1), na (1), naqsha (1), neptune (1), neptunegraph (1), network- (1), network-api (1), network-control (1), networkapi (1), networkapis (1), networkfirewall (1), networkmanager (1), none (1), nonempty (1), notifications (1), notificationscontacts (1), ntrol (1), number (1), oam (1), object-storage (1), observabilityadmin (1), ocilib (1), odb (1), odpi-c (1), office (1), ogc (1), ollama (1), omics (1), oop (1), openlayers (1), opensearchserverless (1), opensearchservice (1), operations (1), opsworks (1), organizations (1), orphan-instances (1), osis (1), other- (1), overloadelabels (1), package.category (1), pagerduty (1), panorama (1), parry (1), parser-builder (1), parsercombinators (1), parsercombinators-parsing-text (1), parsing- (1), parsing-text (1), pattern-recognition (1), paymentcryptography (1), pcaconnectorad (1), pcaconnectorscep (1), pcs (1), pdf-latex (1), pdf-viewer (1), permutations (1), personalgrowth (1), personalize (1), phishing (1), php (1), picture (1), pinboard (1), pinpoint (1), pinpointemail (1), pkcs11 (1), pl-sql-tools (1), plaid (1), planning (1), polyrhythmicity (1), polysemy-vinyl (1), polysemy-vinyl-composite (1), portal (1), presentation (1), pretty-printing (1), privacy (1), process (1), process-manager (1), programming-uniform (1), prompt (1), propagators (1), proto (1), protocols (1), proton (1), proxies (1), proxy (1), psp (1), pvp (1), python (1), qbusiness (1), ql (1), qldb (1), qualifieddo (1), quality (1), quant (1), quasiqoutes (1), quasiquoters (1), quicksight (1), raaz (1), rabbitmq (1), rake (1), ram (1), rap (1), raphics (1), rate-limiter (1), rbin (1), rds (1), record (1), redshift (1), redshiftserverless (1), refactorspaces (1), reflection- (1), reinforcement-learning (1), rekognition (1), relational-algebra (1), relaxng (1), relude (1), resiliencehub (1), resourceexplorer2 (1), resourcegroups (1), rest (1), rfc (1), rfc-9901 (1), rfc4648 (1), rhythmicity (1), robomaker (1), roles (1), rolesanywhere (1), rounding (1), route53 (1), route53profiles (1), route53recoverycontrol (1), route53recoveryreadiness (1), route53resolver (1), rss-atom-reader (1), rtbfabric (1), ruby (1), rum (1), rumba (1), rust (1), s3 (1), s3express (1), s3objectlambda (1), s3outposts (1), s3tables (1), sagemaker (1), sast (1), sax (1), scene (1), schedule (1), scheduler (1), scientific (1), screencast (1), screensaver (1), script (1), sdb (1), sdr (1), secretsmanager (1), securitisation (1), security- (1), securityhub (1), securitylake (1), selective (1), selective-disclosure (1), semigroupoids (1), semigroups (1), sequences (1), serialization- (1), serverless (1), servicecatalog (1), servicecatalogappregistry (1), servicediscovery (1), ses (1), set-theory (1), shield (1), si5351 (1), signatures (1), signer (1), silk (1), silly-tool (1), simspaceweaver (1), smartcard (1), smsvoice (1), smt---------- (1), snaplet-fay (1), sns (1), socket (1), solver (1), source (1), spellchecker (1), sqs (1), ssm (1), ssmcontacts (1), ssmguiconnect (1), ssmincidents (1), ssmquicksetup (1), sso (1), staged (1), static (1), staticanalysis (1), steganography (1), stemming (1), stepfunctions (1), stochastic-control (1), storage (1), strict (1), structuredfinance (1), structuredfinancesecuritisationcashflow (1), subscriptions (1), subversion (1), support-vector-machine (1), supportapp (1), svd (1), syllables (1), symbolic-arithmetic (1), syntcomp (1), synthetics (1), syslog (1), system--- (1), systems (1), systemsmanagersap (1), taskwarrior (1), tasty (1), tasty-kat (1), tax (1), templates (1), terraform (1), test------------------------ (1), testing- (1), testing-hackage (1), text- (1), text-editor (1), text-recognition (1), text-to-speech (1), text.parsercombinators (1), text.parsercombinators-parsing-text (1), text.prettyprint (1), th- (1), theorem-proving (1), this (1), time-frequency-distributions (1), time-uniform (1), timestream (1), tinytools (1), token (1), tokenisation (1), tonality (1), topology (1), touchdesigner (1), training (1), trans (1), transfer (1), transformation- (1), translation (1), transpiler (1), tropical-geometry (1), tropical-geometry- (1), truth-maintenance (1), try (1), tts (1), tui-tool (1), tutorial (1), tutorials (1), type-errors (1), type-inference (1), type-provider (1), type-safe (1), type-theory (1), typechecking (1), typeid (1), typesystems (1), udp (1), uniform-handling-of---some-pandoc-stuff (1), unikernel (1), uniquenessPeriods (1), unity3d (1), unlift (1), url (1), utils- (1), utxo (1), uuid (1), uuidv7 (1), uzbl (1), valve (1), verification (1), verifiedpermissions (1), video-polysemy (1), voiceid (1), vpclattice (1), vscode (1), vty (1), waf (1), wafregional (1), wafv2 (1), warning (1), wasm (1), watch (1), water (1), web-server (1), web-xml (1), web-yesod (1), web3 (1), webb (1), webdevelopment (1), webframework (1), webrtc (1), websockets (1), welcome (1), well-known-text (1), wiki (1), windowmanager (1), wisdom (1), wkt (1), workspaces (1), workspacesinstances (1), workspacesthinclient (1), workspacesweb (1), wsjt-x (1), wsjtx (1), xdg (1), xfce (1), xlsx (1), xml- (1), xmpp (1), xray (1), yampa (1), yampa- (1), zeromq (1), zipkin (1), zlib (1)
2026-01-13T09:30:26
https://upsilon.cc/~zack/hacking/debian/
debian zack's home page / hacking / debian home research publications committees teaching hacking debian software talks blog about I've been a Debian Developer (DD), since March 2001. From April 2010 to April 2013 I've served as Debian Project Leader for three terms . Before serving as DPL, my Debian involvement revolved around the activities listed below (in no particular order). My involvement in them will be more or less on hold during the DPL term. maintenance of OCaml -related packages as the admin of the Debian OCaml maintainers task force fixing one RC bug per-day (and convincing other in doings the same), with the Release Critical Bugs of the Week (RCBW) initiative archive-wide quality assurance , as a member of the Debian QA team ; this includes maintaining infrastructure parts such as the PTS maintenance of several other packages , many of which are XML-related (from W3C recommendations, to rendering tools for mathematics in XML, Python libraries for dealing with XML, and whatnot) maintenance of Vim -related packages, including the Vim editor itself, as a member of the Debian VIM maintainers team ( not any longer ) various other projects , listed on alioth DPL In 2009, I've been standing for DPL in the yearly elections . I did not win, but I've kept information about my attempt . In 2010, I've tried again and I won: a page documenting the attempt is available as well. In 2011, I've been reelected for a 2nd term In 2012, I've been reelected for a 3rd term OCaml All info about Debian OCaml maintenance can nowadays be found on the team wiki page . If you are looking for the old essay of mine Enforcing OCaml link-time compatibility using Debian dependencies , you should most likely rather look for the JFLA 2010 paper Enforcing Type-Safe Linking using Inter-Package Relationships (pdf) . Links my DDPO page , with the full list of packages I'm (co-)maintaining, sponsoring, ... my people.debian.org page , sometime used as a staging area for packages, sometime not, ... (i.e. use at your own risk) some statistics I'm maintaining to monitor the spread of habits in the Debian archive: usage of Version Control Systems for Debian package maintenance usage of the Homepage field in Debian source packages proper usage of the Vcs-Svn field in Debian source packages (currently broken, since svnbuildstat is down ATM) usage of package build helpers in Debian (AKA cdbs vs debhelper) 7 usage of DPKG source formats : 1.0, 3.0 (native), 3.0 (quilt), ... self-links my lintian reports my debtags my DEHS report bugs reported by me Copyright © 2007-2022 by Stefano Zacchiroli <zack@upsilon.cc> Homepage by Stefano Zacchiroli is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License . Last edited Sat 25 May 2013 04:24:14 PM CEST Fri 21 Dec 2007 11:42:41 AM CET -->
2026-01-13T09:30:26
https://github.com/jeremyevans/autoforme/actions/workflows/ci.yml
CI · Workflow runs · jeremyevans/autoforme · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} jeremyevans / autoforme Public Notifications You must be signed in to change notification settings Fork 14 Star 70 Code Issues 0 Pull requests 0 Discussions Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Discussions Actions Security Insights Actions: jeremyevans/autoforme Actions --> All workflows Workflows CI CI pages-build-deployment pages-build-deployment Show more workflows... Management Caches Deployments CI CI Actions Loading... Loading Sorry, something went wrong. Uh oh! There was an error while loading. Please reload this page . --> will be ignored since log searching is not yet available Show workflow options Create status badge Create status badge Loading Uh oh! There was an error while loading. Please reload this page . ci.yml --> will be ignored since log searching is not yet available 19 workflow runs 19 workflow runs Event Filter by Event Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching events. Status Filter by Status Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching statuses. Branch Filter by Branch Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching branches. Actor Filter by Actor Sorry, something went wrong. Filter Loading Sorry, something went wrong. No matching users. Add Ruby 4.0 to CI CI #84: Commit c284f29 pushed by jeremyevans 30m 53s master master 30m 53s View workflow file Avoid Rails 8.1 deprecation warning when running Rails specs CI #83: Commit c11a99c pushed by jeremyevans 30m 40s master master 30m 40s View workflow file Try to use Rails < 7.2 when running specs CI #82: Commit 919cc56 pushed by jeremyevans 30m 13s master master 30m 13s View workflow file Bump version to 1.14.0 CI #81: Commit 808a693 pushed by jeremyevans 18m 25s master master 18m 25s View workflow file Work around spec issue when using Rails 8.0.3 CI #80: Commit 258e6a8 pushed by jeremyevans 30m 53s master master 30m 53s View workflow file Support customizing the searching done for specific columns via colum… CI #79: Commit 42d8831 pushed by jeremyevans 31m 6s master master 31m 6s View workflow file Ensure autoforme request.params is a plain hash when using Rails CI #78: Commit d2b6f7c pushed by jeremyevans 28m 55s master master 28m 55s View workflow file Support autoforme_framework Roda class method in Roda plugin, to allo… CI #77: Commit 15a6da4 pushed by jeremyevans 30m 18s master master 30m 18s View workflow file Remove unneeded line CI #76: Commit 07d99cb pushed by jeremyevans 28m 42s master master 28m 42s View workflow file Handle JRuby 10.0 in CI Gemfile CI #75: Commit da286a6 pushed by jeremyevans 1m 6s master master 1m 6s View workflow file Add JRuby 10.0 to CI CI #74: Commit f6b4d05 pushed by jeremyevans 29m 15s master master 29m 15s View workflow file Use specific concurrent-ruby version in CI for Ruby 2.5/2.6 CI #73: Commit af4100c pushed by jeremyevans 28m 1s master master 28m 1s View workflow file Fix rdoc task name CI #72: Commit 9127f45 pushed by jeremyevans 28m 10s master master 28m 10s View workflow file Switch rdoc task to normal rake task, avoid rdoc/task require CI #71: Commit e2aaf33 pushed by jeremyevans 27m 57s master master 27m 57s View workflow file Remove Ruby 2.3 from CI again CI #70: Commit 583de90 pushed by jeremyevans 28m 46s master master 28m 46s View workflow file Work with ubuntu-latest using 24.04 by default in CI CI #69: Commit 4a9a211 pushed by jeremyevans 2h 34m 3s master master 2h 34m 3s View workflow file Add Ruby 3.4 to CI CI #68: Commit c145d14 pushed by jeremyevans 28m 15s master master 28m 15s View workflow file Try to fix JRuby 9.4 CI CI #67: Commit a84a511 pushed by jeremyevans 49m 4s master master 49m 4s View workflow file Use -W:strict_unused_block when running tests on Ruby 3.4+ CI #66: Commit 39080d3 pushed by jeremyevans 27m 53s master master 27m 53s View workflow file You can’t perform that action at this time.
2026-01-13T09:30:26
https://www.debian.org/CD/http-ftp/#stable
Downloading Debian USB/CD/DVD images via HTTP/FTP Skip Quicknav Blog Micronews Planet Wiki Debian installation media for USB, CD, DVD / Downloading Debian USB/CD/DVD images via HTTP/FTP Debian on CD FAQ Network Install Live images Buy CDs or DVDs Download Download via HTTP/FTP Download with Torrent Download with Jigdo Rsync Mirrors Verify Downloading Debian USB/CD/DVD images via HTTP/FTP The following Debian images are available for download: Official USB/CD/DVD images of the stable release Official USB/CD/DVD images of the testing distribution ( regenerated weekly ) See also: A complete list of debian-cd/ mirrors For network install images, see the network install page. For images of the testing release, see the Debian-Installer page . Official USB/CD/DVD images of the stable release To install Debian on a machine without an Internet connection, it's possible to use CD/USB images (700 MB each) or DVD/USB images (4.7 GB each). Download the first CD/USB or DVD/USB image file, write it using a USB/CD/DVD recorder, and then reboot from that. The first USB/CD/DVD disk contains all the files necessary to install a standard Debian system. CD/USB The following links point to image files which are up to 700 MB in size, making them suitable for writing to normal CD-R(W) media: amd64 arm64 armhf ppc64el riscv64 s390x DVD/USB The following links point to image files which are up to 4.7 GB in size, making them suitable for writing to normal DVD-R/DVD+R and similar media: amd64 arm64 armhf ppc64el riscv64 s390x source Be sure to have a look at the documentation before you install. If you read only one document before installing, read our Installation Howto , a quick walkthrough of the installation process. Other useful documentation includes: Installation Guide , the detailed installation instructions Debian-Installer Documentation , including the FAQ with common questions and answers Debian-Installer Errata , the list of known problems in the installer Registered mirrors of the debian-cd archive Note that some mirrors may not be up to date — the current release of the "stable" USB/CD/DVD images is 13.3.0 . If in doubt, use the primary CD image server in Sweden, Are you interested in offering the Debian CD images on your mirror? If yes, see the instructions on how to set up a CD image mirror . Argentina: debian.xfree.com.ar: HTTP Armenia: mirrors.asnet.am: HTTP Australia: debian.mirror.digitalpacific.com.au: HTTP Australia: mirror.overthewire.com.au: HTTP Austria: debian.anexia.at: HTTP Belarus: mirror.datacenter.by: HTTP Belgium: debian-mirror.behostings.net: HTTP Belgium: mirror.as35701.net: HTTP Brazil: debian.c3sl.ufpr.br: HTTP Brazil: debian.pop-sc.rnp.br: HTTP China: mirror.lzu.edu.cn: HTTP Croatia: debian.carnet.hr: HTTP Czech Republic: debian-cd.mirror.web4u.cz: HTTP Czech Republic: debian.nic.cz: HTTP Czech Republic: debian.superhosting.cz: HTTP Czech Republic: mirror.dkm.cz: HTTP Denmark: mirrors.dotsrc.org: HTTP Denmark: mirrors.rackhosting.com: HTTP Ecuador: mirror.cedia.org.ec: HTTP France: debian.obspm.fr: HTTP France: deb.syxpi.fr: HTTP France: ftp.crifo.org: HTTP France: miroir.univ-lorraine.fr: HTTP Georgia: debian.grena.ge: HTTP Germany: debian-cd.repulsive.eu: HTTP Germany: debian.inf.tu-dresden.de: HTTP Germany: debian.netcologne.de: HTTP Germany: ftp.fau.de: HTTP Germany: ftp.gwdg.de: HTTP Germany: ftp.halifax.rwth-aachen.de: HTTP Germany: ftp.hosteurope.de: HTTP Germany: ftp-stud.hs-esslingen.de: HTTP Germany: ftp.uni-hannover.de: HTTP Germany: ftp.uni-stuttgart.de: HTTP Germany: mirror.23m.com: HTTP Germany: mirror.checkdomain.de: HTTP Germany: mirror.de.leaseweb.net: HTTP Hong Kong: mirror.xtom.com.hk: HTTP Hungary: ftp.bme.hu: HTTP Indonesia: kartolo.sby.datautama.net.id: HTTP Israel: debian.interhost.co.il: HTTP Italy: debian.connesi.it: HTTP Italy: giano.com.dist.unige.it: HTTP Japan: ftp.jaist.ac.jp: HTTP Japan: ftp.nara.wide.ad.jp: HTTP Japan: ftp.riken.jp: HTTP Japan: ftp.yz.yamagata-u.ac.jp: HTTP Korea: ftp.kaist.ac.kr: HTTP Korea: ftp.lanet.kr: HTTP Korea: mirror.siwoo.org: HTTP Latvia: debian.koyanet.lv: HTTP Lithuania: debian.mirror.vu.lt: HTTP Luxembourg: debian.mirror.root.lu: HTTP Mexico: lidsol.fi-b.unam.mx: HTTP Netherlands: debian.snt.utwente.nl: HTTP Netherlands: mirror.duocast.net: HTTP Netherlands: mirror.nl.datapacket.com: HTTP Netherlands: mirror.nl.leaseweb.net: HTTP New Caledonia: debian.lagoon.nc: HTTP New Caledonia: debian.nautile.nc: HTTP Poland: ftp.icm.edu.pl: HTTP Portugal: debian.uevora.pt: HTTP Portugal: ftp.rnl.tecnico.ulisboa.pt: HTTP Portugal: mirrors.up.pt: HTTP Romania: mirrors.pidginhost.com: HTTP Russia: ftp.psn.ru: HTTP Russia: mirror.corbina.net: HTTP Russia: mirror.mephi.ru: HTTP Russia: mirror.truenetwork.ru: HTTP Saudi Arabia: mirror.maeen.sa: HTTP South Africa: debian.saix.net: HTTP South Africa: ftp.is.co.za: HTTP Spain: debian.uvigo.es: HTTP Spain: ftp.caliu.cat: HTTP Spain: ftp.cica.es: HTTP Spain: mirror.raiolanetworks.com: HTTP Sweden: cdimage.debian.org: HTTP Sweden: ftp.acc.umu.se: HTTP Switzerland: debian.ethz.ch: HTTP Taiwan: debian.cs.nycu.edu.tw: HTTP Taiwan: ftp.ncnu.edu.tw: HTTP Taiwan: ftp.tku.edu.tw: HTTP Taiwan: mirror.twds.com.tw: HTTP Ukraine: debian.netforce.hosting: HTTP Ukraine: debian.volia.net: HTTP United Kingdom: debian-iso.mirror.anlx.net: HTTP United Kingdom: ftp.ticklers.org: HTTP United Kingdom: mirrorservice.org: HTTP United States: debian.osuosl.org: HTTP United States: mirror.cogentco.com: HTTP United States: mirror.keystealth.org: HTTP United States: mirrors.bloomu.edu: HTTP United States: mirrors.iu13.net: HTTP United States: mirrors.lug.mtu.edu: HTTP United States: mirrors.ocf.berkeley.edu: HTTP United States: mirror.steadfast.net: HTTP United States: mirror.us.leaseweb.net: HTTP United States: mirror.us.mirhosting.net: HTTP debian_on_cd faq net_install buy jigdo http_ftp This page is also available in the following languages: Select your language català dansk español français Italiano magyar Nederlands polski Português slovenčina suomi svenska Türkçe Русский (Russkij) українська (ukrajins'ka) 中文(简) 中文(HK) 中文(繁) 日本語 (Nihongo) česky 한국어 (Korean) How to set the default document language English-language public mailing list for CDs/DVDs: Debian CD team < debian-cd@lists.debian.org > Home About Social Contract Code of Conduct Free Software Legal Info Help Debian Getting Debian Network install CD/USB ISO images Pure Blends Debian Packages Developers' Corner News Project News Events Documentation Release Info Debian Wiki Support Debian International Security Information Bug reports Mailing Lists Site map Search The Debian Blog Debian Micronews Debian Planet Last Modified: Wed, Dec 31 07:52:56 UTC 2025   Last Built: Tue, Jan 13 07:26:10 UTC 2026 Copyright © 1997-2026 SPI and others; See license terms Debian is a registered trademark of Software in the Public Interest, Inc.
2026-01-13T09:30:26
https://www.unicode.org/glossary/#encoded_character
Glossary Glossary Tech Site | Site Map | Search   Glossary of Unicode Terms   A B C D E F G H I J K L M N O P-Q R S T U V W X-Y Z This glossary is updated periodically to stay synchronized with changes to various standards maintained by the Unicode Consortium. See About Unicode Terminology for translations of various terms. There is also an FAQ section on the website. A Abjad . A writing system in which only consonants are indicated. The term “abjad” is derived from the first four letters of the traditional order of the Arabic script: alef, beh, jeem, dal . (See Section 6.1, Writing Systems .) Abstract Character . A unit of information used for the organization, control, or representation of textual data. (See definition D7 in Section 3.4, Characters and Encoding .) Abstract Character Sequence . An ordered sequence of one or more abstract characters. (See definition D8 in Section 3.4, Characters and Encoding .) Abugida . A writing system in which consonants are indicated by the base letters that have an inherent vowel, and in which other vowels are indicated by additional distinguishing marks of some kind modifying the base letter. The term “abugida” is derived from the first four letters of the Ethiopic script in the Semitic order: alf, bet, gaml, dant . (See Section 6.1, Writing Systems .) Accent Mark . A mark placed above, below, or to the side of a character to alter its phonetic value. (See also diacritic .) Acrophonic . Denoting letters or numbers by the first letter of their name. For example, the Greek acrophonic numerals are variant forms of such initial letters. Aksara . (1) In Sanskrit grammar, the term for “letter” in general, as opposed to consonant ( vyanjana ) or vowel ( svara ). Derived from the first and last letters of the traditional ordering of Sanskrit letters—“a” and “ksha”. (2) More generally, in Indic writing systems, aksara refers to an orthographic syllable . Algorithm . A term used in a broad sense in the Unicode Standard, to mean the logical description of a process used to achieve a specified result. This does not require the actual procedure described in the algorithm to be followed; any implementation is conformant as long as the results are the same. Alphabet . A writing system in which both consonants and vowels are indicated. The term “alphabet” is derived from the first two letters of the Greek script: alpha, beta . (See Section 6.1, Writing Systems .) Alphabetic Property . Informative property of the primary units of alphabets and/or syllabaries. (See Section 4.10, Letters, Alphabetic, and Ideographic .) Alphabetic Sorting . (See collation .) AMTRA . Acronym for Arabic Mark Transient Reordering Algorithm . (See Unicode Standard Annex #53, “Unicode Arabic Mark Rendering.” ) Annotation . The association of secondary textual content with a point or range of the primary text. (The value of a particular annotation is considered to be a part of the “content” of the text. Typical examples include glossing, citations, exemplification, Japanese yomi, and so on.) ANSI .  (1) The American National Standards Institute. (2) The Microsoft collective name for all Windows code pages. Sometimes used specifically for code page 1252, which is a superset of ISO/IEC 8859-1. Apparatus Criticus . Collection of conventions used by editors to annotate and comment on text. Arabic Digits . The term "Arabic digits" may mean either the digits in the Arabic script (see Arabic-Indic digits ) or the ordinary ASCII digits in contrast to Roman numerals (see European digits ). When the term "Arabic digits" is used in Unicode specifications, it means Arabic-Indic digits. See Terminology for Digits for additional information on terminology related to digits. Arabic-Indic Digits . Forms of decimal digits used in most parts of the Arabic world (for instance, U+0660, U+0661, U+0662, U+0663). Although European digits (1, 2, 3,…) derive historically from these forms, they are visually distinct and are coded separately. (Arabic-Indic digits are sometimes called Indic numerals; however, this nomenclature leads to confusion with the digits currently used with the scripts of India.) Variant forms of Arabic-Indic digits used chiefly in Iran and Pakistan are referred to as Eastern Arabic-Indic digits . (See Section 9.2, Arabic .) See Terminology for Digits for additional information on terminology related to digits. ASCII . (1) The American Standard Code for Information Interchange, a 7-bit coded character set for information interchange. It is the U.S. national variant of ISO/IEC 646 and is formally the U.S. standard ANSI X3.4. It was proposed by ANSI in 1963 and finalized in 1968. (2) The set of 128 Unicode characters from U+0000 to U+007F, including control codes as well as graphic characters. (3) ASCII has been incorrectly used to refer to various 8-bit character encodings that include ASCII characters in the first 128 code points. ASCII digits . The digit characters U+0030 to U+0039. Also known as European digits . See Terminology for Digits for additional information on terminology related to digits. Assigned Character .  A code point that is assigned to an abstract character. This refers to graphic, format, control, and private-use characters that have been encoded in the Unicode Standard. (See Section 2.4, Code Points and Characters .) Assigned Code Point .  (See designated code point .) Atomic Character .  A character that is not decomposable. (See decomposable character .) B Base Character . Any graphic character except for those with the General Category of Combining Mark (M). (See definition D51 in Section 3.6, Combination .) In a combining character sequence, the base character is the initial character, which the combining marks are applied to. Basic Multilingual Plane . Plane 0, abbreviated as BMP. Bicameral . A script that distinguishes between two cases. (See case .) Most often used in the context of Latin-based alphabets of Europe and elsewhere in the world. Bidi . Abbreviation of bidirectional, in reference to mixed left-to-right and right-to-left text. Bidirectional Display . The process or result of mixing left-to-right text and right-to-left text in a single line. (See Unicode Standard Annex #9, “Unicode Bidirectional Algorithm.” ) Big-endian . A computer architecture that stores multiple-byte numerical values with the most significant byte (MSB) values first. Binary Files . Files containing nontextual information. Block . A grouping of characters within the Unicode encoding space used for organizing code charts. Each block is a uniquely named, continuous, non-overlapping range of code points, containing a multiple of 16 code points, and starting at a location that is a multiple of 16. A block may contain unassigned code points, which are reserved. BMP . Acronym for Basic Multilingual Plane . BMP Character . A Unicode encoded character having a BMP code point. (See supplementary character .) BMP Code Point . A Unicode code point between U+0000 and U+FFFF. (See supplementary code point .) BNF . Acronym for Backus-Naur Form , a formal meta-syntax for describing context-free syntaxes. (For details, see Appendix A, Notational Conventions .) BOCU-1 . Acronym for Binary Ordered Compression for Unicode. A Unicode compression scheme that is MIME-compatible (directly usable for e-mail) and preserves binary order, which is useful for databases and sorted lists. BOM .  Acronym for byte order mark . Bopomofo . An alphabetic script used primarily in the Republic of China (Taiwan) to write the sounds of Mandarin Chinese and some other dialects. Each symbol corresponds to either the syllable-initial or syllable-final sounds; it is therefore a subsyllabic script in its primary usage. The name is derived from the names of its first four elements. More properly known as zhuyin zimu or zhuyin fuhao in Mandarin Chinese. Boustrophedon . A pattern of writing seen in some ancient manuscripts and inscriptions, where alternate lines of text are laid out in opposite directions, and where right-to-left lines generally use glyphs mirrored from their left-to-right forms. Literally, “as the ox turns,” referring to the plowing of a field. Braille . A writing system using a series of raised dots to be read with the fingers by people who are blind or whose eyesight is not sufficient for reading printed material. (See Section 21.1, Braille .) Braille Pattern . One of the 64 (for six-dot Braille) or 256 (for eight-dot Braille) possible tangible dot combinations. Byte . (1) The minimal unit of addressable storage for a particular computer architecture. (2) An octet. Note that many early computer architectures used bytes larger than 8 bits in size, but the industry has now standardized almost uniformly on 8-bit bytes. The Unicode Standard follows the current industry practice in equating the term byte with octet and using the more familiar term byte in all contexts. (See octet .) Byte Order Mark . The Unicode character U+FEFF when used to indicate the byte order of a text. (See Section 2.13, Special Characters and Noncharacters , and Section 23.8, Specials .) Byte Serialization . The order of a series of bytes determined by a computer architecture. Byte-Swapped . Reversal of the order of a sequence of bytes. C Camelcase . A casing convention for compound terms or identifiers, in which the letters are mostly lowercased, but component words or abbreviations may be capitalized. For example, "ThreeWordTerm" or "threeWordTerm". Canonical . (1) Conforming to the general rules for encoding—that is, not compressed, compacted, or in any other form specified by a higher protocol. (2) Characteristic of a normative mapping and form of equivalence specified in Chapter 3, Conformance . Canonical Composition . A step in the algorithm for Unicode Normalization Forms, during which decomposed sequences are replaced by primary composites, where possible. (See definition D115 in Section 3.11, Normalization Forms .) Canonical Decomposable Character . A character that is not identical to its canonical decomposition. (See definition D69 in Section 3.7, Decomposition .) Canonical Decomposition . Mapping to an inherently equivalent sequence—for example, mapping ä to a +  combining umlaut. (For a full, formal definition, see definition D68 in Section 3.7, Decomposition .) Canonical Equivalence . The relation between two character sequences whose full canonical decompositions are identical. (See definition D70 in Section 3.7, Decomposition .) Canonical Equivalent . Two character sequences are said to be canonical equivalents if their full canonical decompositions are identical. (See definition D70 in Section 3.7, Decomposition .) Canonical Ordering . The order of a combining character sequence that results from the application of the Canonical Ordering Algorithm, a step in the process of normalization of strings. See definition D109 in Section 3.11, Normalization Forms . Cantillation Mark . A mark that is used to indicate how a text is to be chanted or sung. Capital Letter . Synonym for uppercase letter . (See case .) Case . (1) Feature of certain alphabets where the letters have two distinct forms. These variants, which may differ markedly in shape and size, are called the uppercase letter (also known as capital or majuscule ) and the lowercase letter (also known as small or minuscule ). (2) Normative property of characters, consisting of uppercase, lowercase, and titlecase (Lu, Ll, and Lt). (See Section 4.2, Case .) Case Folding . The mapping of strings to a particular case form, to facilitate searching and sorting of text. Case foldings may be simple, when the case mappings are required not to change the length of the strings to compare, or full, when the case mappings may change the length of the strings to compare. (See Section 3.13.3, Default Case Folding .) Case Mapping . The association of the uppercase, lowercase, and titlecase forms of a letter. (See Section 5.18, Case Mappings .) Case-Ignorable . A character C is defined to be case-ignorable if C has the value MidLetter (ML), MidNumLet (MB), or Single_Quote (SQ) for the Word_Break property or its General_Category is one of Nonspacing_Mark (Mn), Enclosing_Mark (Me), Format (Cf), Modifier_Letter (Lm), or Modifier_Symbol (Sk). (See definition D136 in Section 3.13, Default Case Algorithms .) Case-Ignorable Sequence . A sequence of zero or more case-ignorable characters. (See definition D137 in Section 3.13, Default Case Algorithms .) CCC . Short name for the Canonical_Combining_Class property, usually lowercased: ccc. CCS . (1) Acronym for coded character set . (2) Also used as an acronym for combining character sequence . Cedilla . A mark originally placed beneath the letter c in French, Portuguese, and Spanish to indicate that the letter is to be pronounced as an s, as in façade . Obsolete Spanish diminutive of ceda , the letter z . CEF . Acronym for character encoding form . CES . Acronym for character encoding scheme . Character . (1) The smallest component of written language that has semantic value; refers to the abstract meaning and/or shape, rather than a specific shape (see also glyph ), though in code tables some form of visual representation is essential for the reader’s understanding. (2) Synonym for abstract character . (3) The basic unit of encoding for the Unicode character encoding. (4) The English name for the ideographic written elements of Chinese origin. [See ideograph (2).] Character Block . (See block .) Character Class . A set of characters sharing a particular set of properties. Character Encoding Form . Mapping from a character set definition to the actual code units used to represent the data. Character Encoding Scheme . A character encoding form plus byte serialization. There are seven character encoding schemes in Unicode: UTF-8, UTF-16, UTF-16BE, UTF-16LE, UTF-32, UTF-32BE, and UTF-32LE. Character Entity . Expression of the form & for "&" or   for the no-break space. These are found in markup language files like HTML or XML. There are also numerically defined character entities. (See also character escape .) Character Escape . A numerical expression of the form \uXXXX, \xXXXX or &#xXXXX; where X is a hex digit, or &#dddd; where d is a decimal digit. These are found in programming source code or markup language files (such as HTML or XML). Character Name . A unique string used to identify each abstract character encoded in the standard. (See definition D4 in Section 3.3, Semantics .) Character Name Alias . An additional unique string identifier, other than the character name, associated with an encoded character in the standard. (See definition D5 in Section 3.3, Semantics .) Character Properties . A set of property names and property values associated with individual characters. (See Chapter 4, Character Properties .) Character Repertoire . The collection of characters included in a character set. Character Sequence . Synonym for abstract character sequence . Character Set . A collection of elements used to represent textual information. Charset . (See coded character set .) Chillu . Abbreviation for chilaaksharam (singular) ( cillakṣaram ). Refers to any of a set of sonorant consonants in Malayalam, when appearing in syllable-final position with no inherent vowel. Choseong . A sequence of one or more leading consonants in Korean. Chu Hán . The name for Han characters used in Vietnam; derived from hànzì . Chu Nôm . A demotic script of Vietnam developed from components of Han characters. Its creators used methods similar to those used by the Chinese in creating Han characters. CJK . Acronym for Chinese, Japanese, and Korean. A variant, CJKV , means Chinese, Japanese, Korean, and Vietnamese. CJK Unified Ideograph . A Han character that has undergone the process of Han unification (conducted primarily by the Ideographic Research Group) and been encoded as a single ideograph with one or more clearly identified CJK source mappings. CJK unified ideographs have no decomposition mappings, and the set of them in the Unicode Standard is normatively specified by the Unified_Ideograph property. CLDR . (See Unicode Common Locale Data Repository .) Coded Character . (See encoded character .) Coded Character Representation . Synonym for coded character sequence . Coded Character Sequence . An ordered sequence of one or more code points. Normally, this consists of a sequence of encoded characters, but it may also include noncharacters or reserved code points. (See definition D12 in Section 3.4, Characters and Encoding .) Coded Character Set . A character set in which each character is assigned a numeric code point. Frequently abbreviated as character set, charset , or code set ; the acronym CCS is also used. Code Page . A coded character set, often referring to a coded character set used by a personal computer—for example, PC code page 437, the default coded character set used by the U.S. English version of the DOS operating system. Code Point . (1) Any value in the Unicode codespace; that is, the range of integers from 0 to 10FFFF 16 . (See definition D10 in Section 3.4, Characters and Encoding .) Not all code points are assigned to encoded characters. See code point type . (2) A value, or position, for a character, in any coded character set. Code Point Type . Any of the seven fundamental classes of code points in the standard: Graphic, Format, Control, Private-Use, Surrogate, Noncharacter, Reserved. (See definition D10a in Section 3.4, Characters and Encoding .) Code Position . Synonym for code point . Used in ISO character encoding standards. Code Set . (See coded character set .) Codespace . (1) A range of numerical values available for encoding characters. (2) For the Unicode Standard, a range of integers from 0 to 10FFFF 16 . (See definition D9 in Section 3.4, Characters and Encoding .) Code Unit . The minimal bit combination that can represent a unit of encoded text for processing or interchange. The Unicode Standard uses 8-bit code units in the UTF-8 encoding form, 16-bit code units in the UTF-16 encoding form, and 32-bit code units in the UTF-32 encoding form. (See definition D77 in Section 3.9, Unicode Encoding Forms .) Code Value . Obsolete synonym for code unit . Codomain . For a mapping, the codomain is the set of code points or sequences that it maps to, while the domain is the set of values that are mapped. For example, a canonical decomposition is a mapping from a set of code points to a set of sequences; the codomain is the set of canonical equivalent mappings. (See also domain .) Collation . The process of ordering units of textual information. Collation is usually specific to a particular language. Also known as alphabetizing or alphabetic sorting . Unicode Technical Standard #10, “Unicode Collation Algorithm," defines a complete, unambiguous, specified ordering for all characters in the Unicode Standard. Combining Character . A character with the General Category of Combining Mark (M). (See definition D52 in Section 3.6, Combination .) (See also nonspacing mark .) Combining Character Sequence . A maximal character sequence consisting of either a base character followed by a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner ; or a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner . (See definition D56 in Section 3.6, Combination .) Combining Class . A numeric value in the range 0..254 given to each Unicode code point, formally defined as the property Canonical_Combining_Class. (See definition D104 in Section 3.11, Normalization Forms .) Combining Mark . A commonly used synonym for combining character . Compatibility . (1) Consistency with existing practice or preexisting character encoding standards. (2) Characteristic of a normative mapping and form of equivalence specified in Section 3.7, Decomposition . Compatibility Character . A character that would not have been encoded except for compatibility and round-trip convertibility with other standards. (See Section 2.3, Compatibility Characters .) Compatibility Composite Character . Synonym for compatibility decomposable character . Compatibility Decomposable Character . A character whose compatibility decomposition is not identical to its canonical decomposition. (See definition D66 in Section 3.7, Decomposition .) Compatibility Decomposition . Mapping to a roughly equivalent sequence that may differ in style. (For a full, formal definition, see definition D65 in Section 3.7, Decomposition .) Compatibility Equivalence . The relation between two character sequences whose full compatibility decompositions are identical. (See definition D67 in Section 3.7, Decomposition .) Compatibility Equivalent . Two character sequences are said to be compatibility equivalents if their full compatibility decompositions are identical. (See definition D67 in Section 3.7, Decomposition .) Compatibility Ideograph . A Han character encoded for compatibility with some East Asian character encoding, but which is not encoded as a CJK unified ideograph . Instead, each compatibility ideograph has a canonical decomposition mapping to a particular CJK unified ideograph. Compatibility Precomposed Character . Synonym for compatibility decomposable character . Compatibility Variant . A character that generally can be remapped to another character without loss of information other than formatting. Composite Character . (See decomposable character .) Composite Character Sequence . (See combining character sequence .) Composition Exclusion . A Canonical Decomposable Character which has the property value Composition_Exclusion=True. (Used in the definition of Unicode Normalization Forms.) (See definition D112 in Section 3.11, Normalization Forms .) Conformance . Adherence to a specified set of criteria for use of a standard. (See Chapter 3, Conformance .) Confusable . Of similar or identical appearance. When referring to characters in strings, the appearance of confusable characters can make different identifiers hard or impossible to distinguish. (See also Unicode Technical Standard #39, "Unicode Security Mechanisms" .) Conjunct Form . A ligated form representing a consonant conjunct . Consonant Cluster .  A sequence of two or more consonantal sounds. Depending on the writing system, a consonant cluster may be represented by a single character or by a sequence of characters. (Contrast digraph .) Consonant Conjunct . A sequence of two or more adjacent consonantal letterforms, consisting of a sequence of one or more dead consonants followed by a normal, live consonant letter. A consonant conjunct may be ligated into a single conjunct form, or it may be represented by graphically separable parts, such as subscripted forms of the consonant letters. Consonant conjuncts are associated with the Brahmi family of Indic scripts. (See Section 12.1, Devanagari .) Contextual Variant . A text element can have a presentation form that depends on the textual context in which it is rendered. This presentation form is known as a contextual variant . Contributory Property . A simple property defined merely to make the statement of a rule defining a derived property more compact or general. (See definition D35a in Section 3.5, Properties .) Control Codes . The 65 characters in the ranges U+0000..U+001F and U+007F..U+009F. Also known as control characters . Core Specification . The central part of the Unicode Standard–the portion which up until Version 5.0 was published as a separate book. Starting with Version 5.2, this part of the standard has been published online only, rather than as a book. The core specification consists of the general introduction and framework for the standard, the formal conformance requirements, many implementation guidelines, and extensive chapters providing information about all the encoded characters, organized by script or by significant classes of characters. Formally, a version of the Unicode Standard is defined by an edition of this core specification, together with the Code Charts , Unicode Standard Annexes , and the Unicode Character Database Cursive . Writing where the letters of a word are connected. D Dasia . Greek term for rough breathing mark, used in polytonic Greek character names. DBCS . Acronym for double-byte character set . Dead Consonant . An Indic consonant character followed by a virama character. This sequence indicates that the consonant has lost its inherent vowel. (See Section 12.1, Devanagari .) Decimal Digits . Digits that can be used to form decimal-radix numbers. Decomposable Character . A character that is equivalent to a sequence of one or more other characters, according to the decomposition mappings found in the Unicode Character Database, and those described in Section 3.12, Conjoining Jamo Behavior . It may also be known as a precomposed character or a composite character. (See definition D63 in Section 3.7, Decomposition .) Decomposition . (1) The process of separating or analyzing a text element into component units. These component units may not have any functional status, but may be simply formal units—that is, abstract shapes. (2) A sequence of one or more characters that is equivalent to a decomposable character. (See definition D64 in Section 3.7, Decomposition .) Decomposition Mapping . A mapping from a character to a sequence of one or more characters that is a canonical or compatibility equivalent and that is listed in the character names list or described in Section 3.12, Conjoining Jamo Behavior . (See definition D62 in Section 3.7, Decomposition .) Default Ignorable . Default ignorable code points are those that should be ignored by default in rendering unless explicitly supported. They have no visible glyph or advance width in and of themselves, although they may affect the display, positioning, or adornment of adjacent or surrounding characters. (See Section 5.21, Ignoring Characters in Processing .) Defective Combining Character Sequence . A combining character sequence that does not start with a base character. (See definition D57 in Section 3.6, Combination .) Demotic Script . (1) A script or a form of a script used to write the vernacular or common speech of some language community. (2) A simplified form of the ancient Egyptian hieratic writing. Dependent Vowel . A symbol or sign that represents a vowel and that is attached or combined with another symbol, usually one that represents a consonant. For example, in writing systems based on Arabic, Hebrew, and Indic scripts, vowels are normally represented as dependent vowel signs. Deprecated . Of a coded character or a character property, strongly discouraged from use. (Not the same as obsolete .) Deprecated Character . A coded character whose use is strongly discouraged. Such characters are retained in the standard, indefinitely but should not be used. (See definition D13 in Section 3.4, Characters and Encoding .) Designated Code Point . Any code point that has either been assigned to an abstract character ( assigned characters ) or that has otherwise been given a normative function by the standard (surrogate code points and noncharacters). This definition excludes reserved code points. Also known as assigned code point . (See Section 2.4 Code Points and Characters .) Deterministic Comparison . A string comparison in which strings that do not have identical contents will compare as unequal. There are two main varieties, depending on the sense of "identical:" (a) binary equality, or (b) canonical equivalence. This is a property of the comparison mechanism, and not of the sorting algorithm. Also known as stable (or semi-stable ) comparison . Deterministic Sort . A sort algorithm which returns exactly the same output each time it is applied to the same input. This is a property of the sorting algorithm, and not of the comparison mechanism. For example, a randomized Quicksort (which picks a random element as the pivot element, for optimal performance) is not deterministic. Multiprocessor implementations of a sort algorithm may also not be deterministic. Diacritic . (1) A mark applied or attached to a symbol to create a new symbol that represents a modified or new value. (2) A mark applied to a symbol irrespective of whether it changes the value of that symbol. In the latter case, the diacritic usually represents an independent value (for example, an accent, tone, or some other linguistic information). Also called diacritical mark or diacritical . (See also combining character and nonspacing mark .) Diaeresis . Two horizontal dots over a letter, as in naïve . The diaeresis is not distinguished from the umlaut in the Unicode character encoding. (See umlaut .) Dialytika . Greek term for diaeresis or trema , used in Greek character names. Digits . (See Arabic digits , European digits , and Indic digits .) See Terminology for Digits for additional information on terminology related to digits. Digraph . A pair of signs or symbols (two graphs), which together represent a single sound or a single linguistic unit. The English writing system employs many digraphs (for example, th, ch, sh, qu, and so on). The same two symbols may not always be interpreted as a digraph (for example, ca th ode versus ca th ouse ). When three signs are so combined, they are called a trigraph . More than three are usually called an n-graph . Dingbats . Typographical symbols and ornaments. Diphthong . A pair of vowels that are considered a single vowel for the purpose of phonemic distinction. One of the two vowels is more prominent than the other. In writing systems, diphthongs are sometimes written with one symbol and sometimes with more than one symbol (for example, with a digraph ). Direction . (See paragraph direction .) Directionality Property . A property of every graphic character that determines its horizontal ordering as specified in Unicode Standard Annex #9, “Unicode Bidirectional Algorithm.” (See Section 4.4, Directionality .) Display Cell . A rectangular region on a display device within which one or more glyphs are imaged. Display Order . The order of glyphs presented in text rendering. (See logical order and Section 2.2, Unicode Design Principles .) Domain . 1. For a mapping, the domain is the set of code points or sequences that are mapped, while the codomain is the set of values they are mapped to. For example, a canonical decomposition is a mapping from a set of code points to a set of sequences; the domain is the entire Unicode codespace. (See also codomain .) 2. A realm of administrative autonomy, authority or control in the Internet, identified by a domain name. Domain Name . The part of a network address that identifies it as belonging to a particular domain. (Oxford Languages definition.) A domain name is a string of characters. The rules for how Unicode characters can be used in domain names is the concern of IDNA and of UTS #46, Unicode IDNA Compatibility Processing . Double-Byte Character Set . One of a number of character sets defined for representing Chinese, Japanese, or Korean text (for example, JIS X 0208-1990). These character sets are often encoded in such a way as to allow double-byte character encodings to be mixed with single-byte character encodings. Abbreviated DBCS . (See also multibyte character set .) Ductility . The ability of a cursive font to stretch or compress the connective baseline to effect text justification. Dynamic Composition . Creation of composite forms such as accented letters or Hangul syllables from a sequence of characters. E EBCDIC . Acronym for Extended Binary-Coded Decimal Interchange Code. A group of coded character sets used on mainframes that consist of 8-bit coded characters. EBCDIC coded character sets reserve the first 64 code points (x00 to x3F) for control codes, and reserve the range x41 to xFE for graphic characters. The English alphabetic characters are in discontinuous segments with uppercase at xC1 to xC9, xD1 to xD9, xE2 to xE9, and lowercase at x81 to x89, x91 to x99, xA2 to xA9. ECCS . Acronym for extended combining character sequence . EGC . Acronym for extended grapheme cluster . Embedding . A concept relevant to bidirectional behavior. (See Unicode Standard Annex #9, “Unicode Bidirectional Algorithm,” for detailed terminology and definitions.) Emoji . (1) The Japanese word for "pictograph." (2) Certain pictographic and other symbols encoded in the Unicode Standard that are commonly given a colorful or playful presentation when displayed on devices. Many of the emoji in Unicode were originally encoded for compatibility with Japanese telephone symbol sets. (3) Colorful or playful symbols which are not encoded as characters but which are widely implemented as graphics. (See pictograph .) Emoticon . A symbol added to text to express emotional affect or reaction—for example, sadness, happiness, joking intent, sarcasm, and so forth. Emoticons are often expressed by a conventional kind of "ASCII art," using sequences of punctuation and other symbols to portray likenesses of facial expressions. In Western contexts these are often turned sideways, as :-) to express a happy face; in East Asian contexts other conventions often portray a facial expression without turning, as ^-^. Rendering systems often recognize conventional emoticon sequences and display them as colorful or even animated glyphs in text. There is also a set of dedicated pictographic symbols—mostly representing different facial expressions—encoded as characters in the Unicode Standard. (See pictograph .) Encapsulated Text . (1) Plain text surrounded by formatting information. (2) Text recoded to pass through narrow transmission channels or to match communication protocols. Enclosing Mark . A nonspacing mark with the General Category of Enclosing Mark (Me). (See definition D54 in Section 3.6, Combination .) Enclosing marks are a subclass of nonspacing marks that surround a base character, rather than merely being placed over, under, or through it. Encoded Character . An association (or mapping) between an abstract character and a code point . (See definition D11 in Section 3.4, Characters and Encoding .) By itself, an abstract character has no numerical value, but the process of “encoding a character” associates a particular code point with a particular abstract character, thereby resulting in an “encoded character.” Encoding Form . (See character encoding form .) Encoding Scheme . (See character encoding scheme .) Equivalence . In the context of text processing, the process or result of establishing whether two text elements are identical in some respect. Equivalent Sequence . (See canonical equivalent .) Escape Sequence . A sequence of bytes that is used for code extension. The first byte in the sequence is escape (hex 1B). EUDC . Acronym for end-user defined character. A character defined by an end user, using a private-use code point, to represent a character missing in a particular character encoding. These are common in East Asian implementations. European Digits . Forms of decimal digits first used in Europe and now used worldwide. Historically, these digits were derived from the Arabic digits; they are sometimes called “Arabic numerals,” but this nomenclature leads to confusion with the real Arabic-Indic digits . Also called "Western digits" and "Latin digits." See Terminology for Digits for additional information on terminology related to digits. Extended Base . Any base character, or any standard Korean syllable block. (See definition D51a in Section 3.6, Combination .) Extended Combining Character Sequence . A maximal character sequence consisting of either an extended base followed by a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner ; or a sequence of one or more characters where each is a combining character, zero width joiner , or zero width non-joiner . Abbreviated as ECCS . (See definition D56a in Section 3.6, Combination .) Extended Grapheme Cluster . The text between extended grapheme cluster boundaries as specified by Unicode Standard Annex #29, "Unicode Text Segmentation." Abbreviated as EGC . (See definition D61 in Section 3.6, Combination .) F Fancy Text . (See rich text .) Fixed Position Class . A subset of the range of numeric values for combining classes—specifically, any value in the range 10..199. (See definition D105 in Section 3.11, Normalization Forms .) Floating ( diacritic, accent, mark ). (See nonspacing mark .) Folding . An operation that maps similar characters to a common target, such as uppercasing or lowercasing a string. Folding operations are most often used to temporarily ignore certain distinctions between characters. Font . A collection of glyphs used for the visual depiction of character data. A font is often associated with a set of parameters (for example, size, posture, weight, and serifness), which, when set to particular values, generate a collection of imagable glyphs. Format Character . A character that is inherently invisible but that has an effect on the surrounding characters. Format Code . Synonym for format character . Format Control Character . Synonym for format character . Formatted Text . (See rich text .) FSS-UTF . Acronym for File System Safe UCS Transformation Format , published by the X/Open Company Ltd., and intended for the UNIX environment. Now known as UTF-8 . Full Composition Exclusion . A Canonical Decomposable Character which has the property value Full_Composition_Exclusion=True. (Used in the definition of Unicode Normalization Forms.) (See definition D113 in Section 3.11, Normalization Forms .) Fullwidth . Characters of East Asian character sets whose glyph image extends across the entire character display cell. In legacy character sets, fullwidth characters are normally encoded in two or three bytes. The Japanese term for fullwidth characters is zenkaku . FVS . Acronym for Mongolian Free Variation Selector . G G11n . (See globalization .) GC . 1. Acronym for grapheme cluster . 2. Short name for the General_Category property, usually lowercased: gc. GCGID . Acronym for Graphic Character Global Identifier. These are listed in the IBM document Character Data Representation Architecture, Level 1, Registry SC09-1391 . General Category . Partition of the characters into major classes such as letters, punctuation, and symbols, and further subclasses for each of the major classes. (See Section 4.5, General Category .) Generative . Synonym for productive . Globalization . (1) The overall process for internationalization and localization of  software products. (2) a synonym for internationalization. Also known by the abbreviation "g11n". Note that the meaning of "globalization" which is relevant to software products should be distinguished from the more widespread use of "globalization" in the context of economics. (See internationalization , localization .) Glyph . (1) An abstract form that represents one or more glyph images. (2) A synonym for glyph image . In displaying Unicode character data, one or more glyphs may be selected to depict a particular character. These glyphs are selected by a rendering engine during composition and layout processing. (See also character .) Glyph Code . A numeric code that refers to a glyph. Usually, the glyphs contained in a font are referenced by their glyph code. Glyph codes may be local to a particular font; that is, a different font containing the same glyphs may use different codes. Glyph Identifier . Similar to a glyph code, a glyph identifier is a label used to refer to a glyph within a font. A font may employ both local and global glyph identifiers. Glyph Image . The actual, concrete image of a glyph representation having been rasterized or otherwise imaged onto some display surface. Glyph Metrics . A collection of properties that specify the relative size and positioning along with other features of a glyph. Grapheme . (1) A minimally distinctive unit of writing in the context of a particular writing system. For example, ‹b› and ‹d› are distinct graphemes in English writing systems because there exist distinct words like big and dig. Conversely, a lowercase italiform letter a and a lowercase Roman letter a are not distinct graphemes because no word is distinguished on the basis of these two different forms. (2) What a user thinks of as a character. Grapheme Base . A character with the property Grapheme_Base, or any standard Korean syllable block. (See definition D58 in Section 3.6, Combination .) Grapheme Cluster . The text between grapheme cluster boundaries as specified by Unicode Standard Annex #29, "Unicode Text Segmentation." (See definition D60 in Section 3.6, Combination .) A grapheme cluster represents a horizontally segmentable unit of text, consisting of some grapheme base (which may consist of a Korean syllable) together with any number of nonspacing marks applied to it. Grapheme Extender . A character with the property Grapheme_Extend. (See definition D59 in Section 3.6, Combination .) Grapheme extender characters consist of all nonspacing marks, zero width joiner , zero width non-joiner , and a small number of spacing marks. Graphic Character . A character with the General Category of Letter (L), Combining Mark (M), Number (N), Punctuation (P), Symbol (S), or Space Separator (Zs). (See definition D50 in Section 3.6. Combination .) Guillemet . Punctuation marks resembling small less-than and greater-than signs, used as quotation marks in French and other languages. (See “Language-Based Usage of Quotation Marks” in Section 6.2, General Punctuation .) H Halant . A preferred Hindi synonym for a virama . It literally means killer , referring to its function of killing the inherent vowel of a consonant letter. (See virama .) Half-Consonant Form . In the Devanagari script and certain other scripts of the Brahmi family of Indic scripts, a dead consonant may be depicted in the so-called half-form. This form is composed of the distinctive part of a consonant letter symbol without its vertical stem. It may be used to create conjunct forms that follow a horizontal layout pattern. Also known as half-form . Halfwidth . Characters of East Asian character sets whose glyph image occupies half of the character display cell. In legacy character sets, halfwidth characters are normally encoded in a single byte. The Japanese term for halfwidth characters is hankaku . Han Characters . Ideographic characters of Chinese origin. (See Section 18.1, Han .) Hangul . The name of the script used to write the Korean language. Hangul Syllable . (1) Any of the 11,172 encoded characters of the Hangul Syllables character block, U+AC00..U+D7A3. Also called a precomposed Hangul syllable to clearly distinguish it from a Korean syllable block. (2) Loosely speaking, a Korean syllable block . Hanja . The Korean name for Han characters; derived from the Chinese word hànzì . Hankaku . (See halfwidth .) Han Unification . The process of identifying Han characters that are in common among the writing systems of Chinese, Japanese, Korean, and Vietnamese. Hànzì . The Mandarin Chinese name for Han characters. Harakat . Marks used in the Arabic script to indicate vocalization with short vowels. A subtype of tashkil . Hasant . The Bangla name for halant . (See virama .) Higher-Level Protocol . Any agreement on the interpretation of Unicode characters that extends beyond the scope of this standard. Note that such an agreement need not be formally announced in data; it may be implicit in the context. (See definition D16 in Section 3.4, Characters and Encoding .) High-Surrogate Code Point . A Unicode code point in the range U+D800 to U+DBFF. (See definition D71 in Section 3.8, Surrogates .) High-Surrogate Code Unit . A 16-bit code unit in the range D800 16 to DBFF 16 , used in UTF-16 as the leading code unit of a surrogate pair. Also known as a leading surrogate . (See definition D72 in Section 3.8, Surrogates .) Hiragana (ひらがな). One of two standard syllabaries associated with the Japanese writing system. Hiragana syllables are typically used in the representation of native Japanese words and grammatical particles, or are used as a fallback representation of other words when the corresponding kanji is either difficult to remember or obscure. (See also katakana .) Horizontal Extension . This refers to the process of adding a new IRG source reference to an existing CJK unified ideograph, along with a new representative glyph for the code charts that shows how the character appears in its source. It does not involve encoding a new character, but rather just adding the source reference and new glyph to the code charts. HTML . HyperText Markup Language. A text description language related to SGML; it mixes text format markup with plain text content to describe formatted text. HTML is ubiquitous as the source language for Web pages on the Internet. Starting with HTML 4.0, the Unicode Standard functions as the reference character set for HTML content. (See also SGML .) I I18n . (See internationalization .) IANA . Acronym for Internet Assigned Numbers Authority. ICU . Acronym for International Components for Unicode, an Open Source set of C/C++ and Java libraries for Unicode and software internationalization support. For information, see https://icu.unicode.org/ Ideograph (or ideogram ). (1) Any symbol that primarily denotes an idea or concept in contrast to a sound or pronunciation—for example, ♻, which denotes the concept of recycling by a series of bent arrows. (2) A generic term for the unit of writing of a logosyllabic writing system. In this sense, ideograph (or ideogram) is not systematically distinguished from logograph (or logogram). (3) A term commonly used to refer specifically to Han characters, equivalent to the Chinese, Japanese, or Korean terms also sometimes used: hànzì , kanji , or hanja . (See logograph , pictograph , sinogram .) Ideographic Property . Informative property of characters that are ideographs. (See Section 4.10, Letters, Alphabetic, and Ideographic .) Ideographic Variation Sequence . A variation sequence registered in the Ideographic Variation Database . The registration of ideographic variation sequences is subject to the rules specified in Unicode Technical Standard #37, "Unicode Ideographic Variation Database." The base character for an ideographic variation sequence must be an ideographic character, and it makes use of a variation selector in the range U+E0100..U+E01EF. The term ideographic variation sequence is sometimes abbreviated as "IVS". IDN . (See Internationalized Domain Name .) IDNA (1) The IDNA2008 protocol for IDNs defined in RFCs 5891 , 5892 , 5893 and 5894 . The protocol categorizes characters (for example as PVALID or DISALLOWED) based on Unicode properties as described in RFC 5892 . (For the range of valid code points for each Unicode version, see the data file for the derived IDNA2008_Category property.) (2) The earlier IDNA2003 protocol. (See IDNA Compatibility Processing for differences between IDNA2003 and IDNA2008 .) IDNA Compatibility Processing . (See Unicode Technical Standard #46, "Unicode IDNA Compatibility Processing" .) IDNA2003 . (See IDNA (2).) IDNA2008 . (See IDNA (1).) IICore . A subset of common-use CJK unified ideographs, defined as the fixed collection 370 IICore in ISO/IEC 10646. This subset contains 9,810 ideographs and is intended for common use in East Asian contexts, particularly for small devices that cannot support the full range of CJK unified ideographs encoded in the Unicode Standard. Ijam . Diacritical marks applied to basic letter forms to derive new (usually consonant) letters for extended Arabic alphabets. For example, see the three dots below which appear in the letter peh: پ Ijam marks are not separately encoded as combining marks in the Unicode Standard, but instead are integral parts of each atomically encoded Arabic letter. Contrast tashkil . See also Section 9.2, Arabic . Ill-Formed Code Unit Sequence . A code unit sequence that does not follow the specification of a Unicode encoding form. (See definition D84 in Section 3.9, Unicode Encoding Forms .) Ill-Formed Code Unit Subsequence . A non-empty subsequence of a Unicode code unit sequence X which does not contain any code units which also belong to any minimal well-formed subsequence of X. (See definition D84a in Section 3.9, Unicode Encoding Forms .) IME . (See Input Method Editor .) In-Band . An in-band channel conveys information about text by embedding that information within the text itself, with special syntax to distinguish it. In-band information is encoded in the same character set as the text, and is interspersed with and carried along with the text data. Examples are XML and HTML markup. Independent Vowel . In Indic scripts, certain vowels are depicted using independent letter symbols that stand on their own. This is often true when a word starts with a vowel or a word consists of only a vowel. Indic Digits . Forms of decimal digits used in various Indic scripts (for example, Devanagari: U+0966, U+0967, U+0968, U+0969). Arabic digits (and, eventually, European digits) derive historically from these forms. See Terminology for Digits for additional information on terminology related to digits. Informative . Information in this standard that is not normative but that contributes to the correct use and implementation of the standard. Inherent Vowel . In writing systems based on a script in the Brahmi family of Indic scripts, a consonant letter symbol nor
2026-01-13T09:30:26
https://github.com/rubygems/bundler-site/blob/master/source/v4.0/whats_new.html.md
bundler-site/source/v4.0/whats_new.html.md at main · rubygems/bundler-site · GitHub Skip to content Navigation Menu Toggle navigation Sign in Appearance settings Platform AI CODE CREATION GitHub Copilot Write better code with AI GitHub Spark Build and deploy intelligent apps GitHub Models Manage and compare prompts MCP Registry New Integrate external tools DEVELOPER WORKFLOWS Actions Automate any workflow Codespaces Instant dev environments Issues Plan and track work Code Review Manage code changes APPLICATION SECURITY GitHub Advanced Security Find and fix vulnerabilities Code security Secure your code as you build Secret protection Stop leaks before they start EXPLORE Why GitHub Documentation Blog Changelog Marketplace View all features Solutions BY COMPANY SIZE Enterprises Small and medium teams Startups Nonprofits BY USE CASE App Modernization DevSecOps DevOps CI/CD View all use cases BY INDUSTRY Healthcare Financial services Manufacturing Government View all industries View all solutions Resources EXPLORE BY TOPIC AI Software Development DevOps Security View all topics EXPLORE BY TYPE Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills SUPPORT & SERVICES Documentation Customer support Community forum Trust center Partners Open Source COMMUNITY GitHub Sponsors Fund open source developers PROGRAMS Security Lab Maintainer Community Accelerator Archive Program REPOSITORIES Topics Trending Collections Enterprise ENTERPRISE SOLUTIONS Enterprise platform AI-powered developer platform AVAILABLE ADD-ONS GitHub Advanced Security Enterprise-grade security features Copilot for Business Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... --> Search Clear Search syntax tips Provide feedback --> We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your results more quickly --> Name Query To see all available qualifiers, see our documentation . Cancel Create saved search Sign in Sign up Appearance settings Resetting focus You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} rubygems / bundler-site Public Notifications You must be signed in to change notification settings Fork 214 Star 115 Code Issues 22 Pull requests 5 Actions Security Uh oh! There was an error while loading. Please reload this page . Insights Additional navigation options Code Issues Pull requests Actions Security Insights Footer © 2026 GitHub, Inc. Footer navigation Terms Privacy Security Status Community Docs Contact Manage cookies Do not share my personal information You can’t perform that action at this time.
2026-01-13T09:30:26
https://www.debian.org/international/Swedish/
Debian in Swedish Skip Quicknav Blog Micronews Planet Wiki Debian International / Debian in Swedish Debian in Swedish Welcome! The intention of these pages are to collect specific information interesting for Swedish speaking Debian users in Sweden, Finland and the whole world. If you have tips or ideas for improvement, or find anything wrong, please contact Andreas Rönnquist, gusnan@debian.org . Denna sida är också tillgänglig på svenska , och om din webbläsare varit korrekt konfigurerad hade du fått den versionen istället. Table of contents Here is an index of what is available on these pages: Mailing lists and other support Here you can find information about the mailing lists that might be of interest for Swedish Debian users, plus information about other ways of getting support. Swedish speaking contributors to the Debian Project A list of projects in Debian related to the Swedish language. We always need help, here you can find what projects suit you. Related resources Links that may be of interest for Swedish speaking Debian and Linux users. Debian dictionary A dictionary over how Debian specific terms are translated into Swedish, on these web pages and in other places, as well as some links to other related translation projects. Please also see our pages about Debian in Finnish , Norwegian and Danish . Back to the Debian Project homepage . This page is also available in the following languages: Select your language svenska How to set the default document language Home About Social Contract Code of Conduct Free Software Legal Info Help Debian Getting Debian Network install CD/USB ISO images Pure Blends Debian Packages Developers' Corner News Project News Events Documentation Release Info Debian Wiki Support Debian International Security Information Bug reports Mailing Lists Site map Search The Debian Blog Debian Micronews Debian Planet See our contact page to get in touch. Web site source code is available . Last Modified: Wed, Jan 7 03:53:35 UTC 2026   Last Built: Sat, Jan 10 23:35:17 UTC 2026 Copyright © 1997-2026 SPI and others; See license terms Debian is a registered trademark of Software in the Public Interest, Inc.
2026-01-13T09:30:26
https://www.debian.org/CD/http-ftp/#content
Downloading Debian USB/CD/DVD images via HTTP/FTP Skip Quicknav Blog Micronews Planet Wiki Debian installation media for USB, CD, DVD / Downloading Debian USB/CD/DVD images via HTTP/FTP Debian on CD FAQ Network Install Live images Buy CDs or DVDs Download Download via HTTP/FTP Download with Torrent Download with Jigdo Rsync Mirrors Verify Downloading Debian USB/CD/DVD images via HTTP/FTP The following Debian images are available for download: Official USB/CD/DVD images of the stable release Official USB/CD/DVD images of the testing distribution ( regenerated weekly ) See also: A complete list of debian-cd/ mirrors For network install images, see the network install page. For images of the testing release, see the Debian-Installer page . Official USB/CD/DVD images of the stable release To install Debian on a machine without an Internet connection, it's possible to use CD/USB images (700 MB each) or DVD/USB images (4.7 GB each). Download the first CD/USB or DVD/USB image file, write it using a USB/CD/DVD recorder, and then reboot from that. The first USB/CD/DVD disk contains all the files necessary to install a standard Debian system. CD/USB The following links point to image files which are up to 700 MB in size, making them suitable for writing to normal CD-R(W) media: amd64 arm64 armhf ppc64el riscv64 s390x DVD/USB The following links point to image files which are up to 4.7 GB in size, making them suitable for writing to normal DVD-R/DVD+R and similar media: amd64 arm64 armhf ppc64el riscv64 s390x source Be sure to have a look at the documentation before you install. If you read only one document before installing, read our Installation Howto , a quick walkthrough of the installation process. Other useful documentation includes: Installation Guide , the detailed installation instructions Debian-Installer Documentation , including the FAQ with common questions and answers Debian-Installer Errata , the list of known problems in the installer Registered mirrors of the debian-cd archive Note that some mirrors may not be up to date — the current release of the "stable" USB/CD/DVD images is 13.3.0 . If in doubt, use the primary CD image server in Sweden, Are you interested in offering the Debian CD images on your mirror? If yes, see the instructions on how to set up a CD image mirror . Argentina: debian.xfree.com.ar: HTTP Armenia: mirrors.asnet.am: HTTP Australia: debian.mirror.digitalpacific.com.au: HTTP Australia: mirror.overthewire.com.au: HTTP Austria: debian.anexia.at: HTTP Belarus: mirror.datacenter.by: HTTP Belgium: debian-mirror.behostings.net: HTTP Belgium: mirror.as35701.net: HTTP Brazil: debian.c3sl.ufpr.br: HTTP Brazil: debian.pop-sc.rnp.br: HTTP China: mirror.lzu.edu.cn: HTTP Croatia: debian.carnet.hr: HTTP Czech Republic: debian-cd.mirror.web4u.cz: HTTP Czech Republic: debian.nic.cz: HTTP Czech Republic: debian.superhosting.cz: HTTP Czech Republic: mirror.dkm.cz: HTTP Denmark: mirrors.dotsrc.org: HTTP Denmark: mirrors.rackhosting.com: HTTP Ecuador: mirror.cedia.org.ec: HTTP France: debian.obspm.fr: HTTP France: deb.syxpi.fr: HTTP France: ftp.crifo.org: HTTP France: miroir.univ-lorraine.fr: HTTP Georgia: debian.grena.ge: HTTP Germany: debian-cd.repulsive.eu: HTTP Germany: debian.inf.tu-dresden.de: HTTP Germany: debian.netcologne.de: HTTP Germany: ftp.fau.de: HTTP Germany: ftp.gwdg.de: HTTP Germany: ftp.halifax.rwth-aachen.de: HTTP Germany: ftp.hosteurope.de: HTTP Germany: ftp-stud.hs-esslingen.de: HTTP Germany: ftp.uni-hannover.de: HTTP Germany: ftp.uni-stuttgart.de: HTTP Germany: mirror.23m.com: HTTP Germany: mirror.checkdomain.de: HTTP Germany: mirror.de.leaseweb.net: HTTP Hong Kong: mirror.xtom.com.hk: HTTP Hungary: ftp.bme.hu: HTTP Indonesia: kartolo.sby.datautama.net.id: HTTP Israel: debian.interhost.co.il: HTTP Italy: debian.connesi.it: HTTP Italy: giano.com.dist.unige.it: HTTP Japan: ftp.jaist.ac.jp: HTTP Japan: ftp.nara.wide.ad.jp: HTTP Japan: ftp.riken.jp: HTTP Japan: ftp.yz.yamagata-u.ac.jp: HTTP Korea: ftp.kaist.ac.kr: HTTP Korea: ftp.lanet.kr: HTTP Korea: mirror.siwoo.org: HTTP Latvia: debian.koyanet.lv: HTTP Lithuania: debian.mirror.vu.lt: HTTP Luxembourg: debian.mirror.root.lu: HTTP Mexico: lidsol.fi-b.unam.mx: HTTP Netherlands: debian.snt.utwente.nl: HTTP Netherlands: mirror.duocast.net: HTTP Netherlands: mirror.nl.datapacket.com: HTTP Netherlands: mirror.nl.leaseweb.net: HTTP New Caledonia: debian.lagoon.nc: HTTP New Caledonia: debian.nautile.nc: HTTP Poland: ftp.icm.edu.pl: HTTP Portugal: debian.uevora.pt: HTTP Portugal: ftp.rnl.tecnico.ulisboa.pt: HTTP Portugal: mirrors.up.pt: HTTP Romania: mirrors.pidginhost.com: HTTP Russia: ftp.psn.ru: HTTP Russia: mirror.corbina.net: HTTP Russia: mirror.mephi.ru: HTTP Russia: mirror.truenetwork.ru: HTTP Saudi Arabia: mirror.maeen.sa: HTTP South Africa: debian.saix.net: HTTP South Africa: ftp.is.co.za: HTTP Spain: debian.uvigo.es: HTTP Spain: ftp.caliu.cat: HTTP Spain: ftp.cica.es: HTTP Spain: mirror.raiolanetworks.com: HTTP Sweden: cdimage.debian.org: HTTP Sweden: ftp.acc.umu.se: HTTP Switzerland: debian.ethz.ch: HTTP Taiwan: debian.cs.nycu.edu.tw: HTTP Taiwan: ftp.ncnu.edu.tw: HTTP Taiwan: ftp.tku.edu.tw: HTTP Taiwan: mirror.twds.com.tw: HTTP Ukraine: debian.netforce.hosting: HTTP Ukraine: debian.volia.net: HTTP United Kingdom: debian-iso.mirror.anlx.net: HTTP United Kingdom: ftp.ticklers.org: HTTP United Kingdom: mirrorservice.org: HTTP United States: debian.osuosl.org: HTTP United States: mirror.cogentco.com: HTTP United States: mirror.keystealth.org: HTTP United States: mirrors.bloomu.edu: HTTP United States: mirrors.iu13.net: HTTP United States: mirrors.lug.mtu.edu: HTTP United States: mirrors.ocf.berkeley.edu: HTTP United States: mirror.steadfast.net: HTTP United States: mirror.us.leaseweb.net: HTTP United States: mirror.us.mirhosting.net: HTTP debian_on_cd faq net_install buy jigdo http_ftp This page is also available in the following languages: Select your language català dansk español français Italiano magyar Nederlands polski Português slovenčina suomi svenska Türkçe Русский (Russkij) українська (ukrajins'ka) 中文(简) 中文(HK) 中文(繁) 日本語 (Nihongo) česky 한국어 (Korean) How to set the default document language English-language public mailing list for CDs/DVDs: Debian CD team < debian-cd@lists.debian.org > Home About Social Contract Code of Conduct Free Software Legal Info Help Debian Getting Debian Network install CD/USB ISO images Pure Blends Debian Packages Developers' Corner News Project News Events Documentation Release Info Debian Wiki Support Debian International Security Information Bug reports Mailing Lists Site map Search The Debian Blog Debian Micronews Debian Planet Last Modified: Wed, Dec 31 07:52:56 UTC 2025   Last Built: Tue, Jan 13 07:26:10 UTC 2026 Copyright © 1997-2026 SPI and others; See license terms Debian is a registered trademark of Software in the Public Interest, Inc.
2026-01-13T09:30:26
https://www.debian.org/international/catalan/#content
Debian -- Catalan Debian pages Skip Quicknav Blog Micronews Planet Wiki Debian International / Catalan Debian pages The Debian web pages in Catalan This web page contains useful information for users, developers and translators who speak Catalan. Debian mailing lists in Catalan Currently there are two Debian lists in Catalan: debian-user-catalan , a user list for speakers of Catalan. This list is used for discussing and solving problems with the use of the Debian system, and for any announcements that are useful for users (organization of meetings, etc). To subscribe to this list, please send a message to debian-user-catalan-request@lists.debian.org with subscribe <your_mail_address> in the message body (not in the subject), or use the web form to subscribe . To unsubscribe, send a message to the same address with unsubscribe <your_mail_address> in the message body, or use the web form to unsubscribe . debian-l10n-catalan , the coordination list of Debian's Catalan translation effort. Ongoing translations are organized and discussed on this list. To subscribe to this list, please send a message to debian-l10n-catalan-request@lists.debian.org with subscribe <your_mail_address> in the message body (not in the subject), or use the web form to subscribe . To unsubscribe, send a message to the same address with unsubscribe <your_mail_address> in the message body, or use the web form to unsubscribe . The Debian Catalan translation project This project aims to translate to Catalan the Debian web pages, the manuals and the Debian-specific tools and programs, like the installation system or dpkg. The group's coordinator is Jordi Mallach <jordi@debian.org>. The most direct way to contact the group is to write an email to our translation list , to which all the participating translators are subscribed. In the future you'll be able to find a glossary of Debian-specific terms that we have been compiling while we translated texts and software. Translation status This is a probably incomplete list of the work that has been done. Catalan support in the Debian installer. Debian 3.0 "woody" has been released with complete Catalan support in the install system. This includes the "dbootstrap" installer and "base-config", the Install Manual, Release Notes and other manuals. Coordination of the debian-l10n-catalan translation team. To smooth and speed the work we use a mail based automatic coordination system. You can see the current status of assigned translations on the debian-l10n-catalan translation team coordination website . Catalan support in various Debian tools. Debian 3.0 also shipped with Catalan support in the major Debian-specific tools, such as "dpkg", "debconf" and "modconf". Aside from these translated programs, Debian has Catalan support in many more applications, like GNOME or KDE, which are translated by non-Debian people. You can have a look at the general state of the Catalan translations of the applications included in Debian in the Central Debian translation statistics . Translation of debconf templates for various packages. Although we haven't made much progress in this area, we are trying to translate the debconf templates to Catalan. You can see the current status of the Catalan templates in the debconf templates translation statistics . Translation of the web pages on www.debian.org. Web pages are also being slowly translated. Currently, the most important web pages are already translated, but there are still many pending. You can see the status of this effort in the Debian website translation statistics . Back to the Debian Project homepage . This page is also available in the following languages: Select your language català How to set the default document language Home About Social Contract Code of Conduct Free Software Legal Info Help Debian Getting Debian Network install CD/USB ISO images Pure Blends Debian Packages Developers' Corner News Project News Events Documentation Release Info Debian Wiki Support Debian International Security Information Bug reports Mailing Lists Site map Search The Debian Blog Debian Micronews Debian Planet See our contact page to get in touch. Web site source code is available . Last Modified: Wed, Jan 7 03:53:35 UTC 2026   Last Built: Sat, Jan 10 23:35:20 UTC 2026 Copyright © 1997-2026 SPI and others; See license terms Debian is a registered trademark of Software in the Public Interest, Inc.
2026-01-13T09:30:26