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/packages/deprecated | Deprecated packages | Hackage Hackage :: [Package] Home Search Browse What's new Upload User accounts Deprecated packages 2captcha : deprecated in favor of captcha-2captcha AERN-Basics : deprecated in favor of aern2-mp , aern2-real AERN-Net : deprecated in favor of aern2-mp , aern2-real AERN-Real : deprecated in favor of aern2-mp , aern2-real AERN-Real-Double : deprecated in favor of aern2-mp , aern2-real AERN-Real-Interval : deprecated in favor of aern2-mp , aern2-real AERN-RnToRm : deprecated AERN-RnToRm-Plot : deprecated AVar : deprecated Agata : deprecated in favor of testing-feat Agda-executable : deprecated in favor of Agda AttoJson : deprecated in favor of aeson Bitly : deprecated BluePrintCSS : deprecated Cabal-ide-backend : deprecated in favor of Cabal Cassava : deprecated in favor of cassava Chart-simple : deprecated CirruParser : deprecated in favor of cirru-parser Clash-Royale-Hack-Cheats : deprecated Clean : deprecated in favor of definitive-base Coadjute : deprecated Command : deprecated in favor of system-command Compactable : deprecated in favor of compactable Control-Engine : deprecated Data-Rope : deprecated in favor of data-rope Digit : deprecated in favor of digit DocTest : deprecated in favor of doctest Docs : deprecated DrIFT-cabalized : deprecated in favor of DrIFT Eight-Ball-Pool-Hack-Cheats : deprecated EitherT : deprecated in favor of either Elm : deprecated in favor of elm-compiler EntrezHTTP : deprecated in favor of BiobaseHTTP Enum : deprecated Eq : deprecated Extra : deprecated in favor of sr-extra , extra FModExRaw : deprecated Facebook-Password-Hacker-Online-Latest-Version : deprecated FailureT : deprecated in favor of transformers FastxPipe : deprecated in favor of pipes-fastx FileManip : deprecated in favor of filemanip FilePather : deprecated in favor of filepather Fin : deprecated FiniteMap : deprecated in favor of containers ForSyDe : deprecated in favor of forsyde-shallow , forsyde-deep Fortnite-Hack-Cheats-Free-V-Bucks-Generator : deprecated FreeTypeGL : deprecated in favor of FTGL Geodetic : deprecated in favor of geodetic HARM : deprecated HAppS-Data : deprecated in favor of happstack-data HAppS-IxSet : deprecated in favor of happstack-ixset HAppS-Server : deprecated in favor of happstack-server HAppS-State : deprecated in favor of happstack-state HAppS-Util : deprecated in favor of happstack-util HAppSHelpers : deprecated in favor of happstack-helpers HDBC-postgresql-hstore : deprecated in favor of postgresql-simple HGamer3D-API : deprecated in favor of HGamer3D HGamer3D-Audio : deprecated in favor of HGamer3D HGamer3D-Bullet-Binding : deprecated HGamer3D-CAudio-Binding : deprecated in favor of HGamer3D-SFML-Binding HGamer3D-CEGUI-Binding : deprecated in favor of HGamer3D HGamer3D-Common : deprecated in favor of HGamer3D HGamer3D-Data : deprecated in favor of HGamer3D HGamer3D-Enet-Binding : deprecated in favor of HGamer3D HGamer3D-GUI : deprecated in favor of HGamer3D-Graphics3D HGamer3D-Graphics3D : deprecated in favor of HGamer3D HGamer3D-InputSystem : deprecated in favor of HGamer3D HGamer3D-Network : deprecated in favor of HGamer3D HGamer3D-OIS-Binding : deprecated in favor of HGamer3D-SFML-Binding HGamer3D-Ogre-Binding : deprecated in favor of HGamer3D HGamer3D-SDL2-Binding : deprecated in favor of HGamer3D HGamer3D-SFML-Binding : deprecated in favor of HGamer3D HGamer3D-WinEvent : deprecated in favor of HGamer3D-Graphics3D HGamer3D-Wire : deprecated in favor of HGamer3D HLearn-algebra : deprecated in favor of subhask HLearn-approximation : deprecated HLearn-classification : deprecated HLearn-datastructures : deprecated HLearn-distributions : deprecated HLogger : deprecated in favor of hlogger HPhone : deprecated HSoundFile : deprecated in favor of sndfile-enumerators HTTP-Simple : deprecated in favor of HTTP HUnit-Diff : deprecated HXMPP : deprecated in favor of pontarius-xmpp HaTeX-meta : deprecated HandlerSocketClient : deprecated Haschoo : deprecated Hermes : deprecated HiggsSet : deprecated Hipmunk : deprecated HueAPI : deprecated IORefCAS : deprecated in favor of atomic-primops IndentParser : deprecated in favor of indentparser JSON-Combinator : deprecated in favor of lens JSON-Combinator-Examples : deprecated in favor of lens JackMiniMix : deprecated in favor of jackminimix Javasf : deprecated in favor of javasf Javav : deprecated in favor of javav Kalman : deprecated in favor of kalman Konf : deprecated LRU : deprecated Lastik : deprecated LazyVault : deprecated ListT : deprecated Map : deprecated MaybeT-monads-tf : deprecated in favor of monads-tf Mobile-Legends-Hack-Cheats : deprecated MonadCatchIO-mtl : deprecated in favor of exceptions MonadCatchIO-mtl-foreign : deprecated MonadCatchIO-transformers : deprecated in favor of exceptions MonadCatchIO-transformers-foreign : deprecated NaturalSort : deprecated Nomyx : deprecated in favor of nomyx-server Nomyx-Core : deprecated in favor of nomyx-core Nomyx-Language : deprecated in favor of nomyx-language Nomyx-Rules : deprecated in favor of Nomyx-Language Nomyx-Web : deprecated in favor of nomyx-web NonEmptyList : deprecated in favor of semigroups NumLazyByteString : deprecated OpenGLRaw21 : deprecated Oslo-Vectize : deprecated PBKDF2 : deprecated in favor of pbkdf , scrypt , bcrypt PCLT : deprecated PCLT-DB : deprecated PandocAgda : deprecated ParserFunction : deprecated in favor of attoparsec PerfectHash : deprecated in favor of perfecthash Pipe : deprecated Quickson : deprecated in favor of aeson-quick RFC1751 : deprecated in favor of rfc1751 Rlang-QQ : deprecated in favor of inline-r SCalendar : deprecated in favor of scalendar SConfig : deprecated SDL : deprecated in favor of sdl2 SDL-gfx : deprecated in favor of sdl2-gfx SDL-image : deprecated in favor of sdl2-image SDL-mixer : deprecated in favor of sdl2-mixer SDL-ttf : deprecated in favor of sdl2-ttf SDL2-ttf : deprecated in favor of sdl2-ttf SFont : deprecated Safe : deprecated in favor of safe SeqAlign : deprecated in favor of seqalign Shpadoinkle-debug : deprecated in favor of Shpadoinkle-console SimpleGL : deprecated in favor of definitive-graphics SimpleH : deprecated in favor of definitive-base Snusmumrik : deprecated Spock-auth : deprecated Sprig : deprecated Synapse : deprecated in favor of synapse SyntaxMacros : deprecated in favor of murder TeaHS : deprecated Thingie : deprecated in favor of Hieroglyph TransformeR : deprecated URLT : deprecated in favor of web-routes Validation : deprecated in favor of validation WURFL : deprecated WebBits : deprecated in favor of language-ecmascript XAttr : deprecated in favor of linux-xattr Yocto : deprecated in favor of yocto ZEBEDDE : deprecated accelerate-cuda : deprecated in favor of accelerate-llvm-ptx accelerate-random : deprecated in favor of mwc-random-accelerate acme-mutable-package : deprecated aeson-compat : deprecated in favor of aeson aeson-native : deprecated in favor of aeson aeson-options : deprecated affine-invariant-ensemble-mcmc : deprecated in favor of flat-mcmc agda-server : deprecated agda-snippets : deprecated in favor of Agda agda-snippets-hakyll : deprecated in favor of Agda alg : deprecated alga : deprecated alpino-tools : deprecated alsa : deprecated in favor of alsa-seq , alsa-pcm , alsa-core alsa-midi : deprecated in favor of alsa-seq alsa-pcm-tests : deprecated in favor of alsa-pcm alsa-seq-tests : deprecated in favor of alsa-seq alternative-io : deprecated in favor of io-choice amazon-emailer : deprecated in favor of hworker-ses amazon-emailer-client-snap : deprecated in favor of hworker-ses animascii : deprecated annihilator : deprecated in favor of boolean-like ansi-wl-pprint : deprecated in favor of prettyprinter apecs-physics-gloss : deprecated in favor of apecs-gloss approx-rand-test : deprecated archlinux : deprecated arith-encode : deprecated in favor of cantor-pairing , finitary , smallcheck array-utils : deprecated artifact : deprecated asn1-codec : deprecated in favor of language-asn , snmp asn1-data : deprecated in favor of asn1-encoding assert4hs : deprecated in favor of assert4hs-core astar-monad : deprecated in favor of monad-dijkstra astview : deprecated astview-utils : deprecated async-combinators : deprecated async-dejafu : deprecated in favor of concurrency asynchronous-exceptions : deprecated atl : deprecated atmos-dimensional : deprecated in favor of atmos atmos-dimensional-tf : deprecated in favor of atmos attempt : deprecated in favor of exceptions attoparsec-conduit : deprecated in favor of conduit-extra attoparsec-enumerator : deprecated attoparsec-ip : deprecated in favor of ip attoparsec-text : deprecated in favor of attoparsec automitive-cse : deprecated in favor of automotive-cse automotive-cse : deprecated autonix-deps : deprecated autonix-deps-kf5 : deprecated awsspendsummary : deprecated in favor of aws-spend-summary azimuth-hs : deprecated backtracking-exceptions : deprecated bag : deprecated in favor of dlist banwords : deprecated barecheck : deprecated base64-conduit : deprecated in favor of conduit-combinators bdelta : deprecated in favor of bytestring-delta beam : deprecated in favor of beam-core beam-newtype-field : deprecated bein : deprecated bench-graph : deprecated in favor of bench-show bento : deprecated bgzf : deprecated in favor of pipes-bgzf bifunctor : deprecated binary-literal-qq : deprecated binary-store : deprecated binary-typed : deprecated bindings : deprecated bindings-common : deprecated in favor of bindings-DSL bindings-mmap : deprecated in favor of bindings-posix bindings-mpdecimal : deprecated in favor of deka bio-sequence : deprecated bit-stream : deprecated in favor of chimera bitly-cli : deprecated bittrex : deprecated bla : deprecated blakesum : deprecated blakesum-demo : deprecated blas : deprecated in favor of hblas blaze : deprecated blaze-builder-conduit : deprecated in favor of conduit-extra blaze-textual-native : deprecated in favor of blaze-textual blogination : deprecated bludigon : deprecated in favor of blucontrol bluetileutils : deprecated in favor of bluetile blunk-hask-tests : deprecated blunt : deprecated bond : deprecated bools : deprecated boots-cloud : deprecated boots-web : deprecated bounded-tchan : deprecated in favor of stm-chans box-csv : deprecated bricks : deprecated bricks-internal : deprecated bricks-internal-test : deprecated bricks-parsec : deprecated bricks-rendering : deprecated bricks-syntax : deprecated broadcast-chan-conduit : deprecated in favor of broadcast-chan broadcast-chan-pipes : deprecated in favor of broadcast-chan broadcast-chan-tests : deprecated in favor of broadcast-chan bson-generics : deprecated in favor of bson-generic bugsnag-haskell : deprecated in favor of bugsnag , bugsnag-wai , bugsnag-yesod bulmex : deprecated bytestring-class : deprecated bytestring-from : deprecated in favor of bytestring-conversion bytestring-time : deprecated in favor of text-time bzlib-conduit-jappie : deprecated in favor of bzlib-conduit cabal : deprecated in favor of Cabal cabal-dev : deprecated in favor of cabal-install cabal-fix : deprecated in favor of cabal-gild cabal-ghci : deprecated in favor of cabal-install cabal-install-ghc74 : deprecated in favor of cabal-install cabal-nirvana : deprecated cabal-src : deprecated in favor of stack cabal-test-compat : deprecated cabal2arch : deprecated caching : deprecated canteven-config : deprecated canteven-log : deprecated capped-list : deprecated in favor of enumerator cartel : deprecated in favor of hpack casadi-bindings-control : deprecated in favor of casadi-bindings-core casadi-bindings-ipopt-interface : deprecated in favor of casadi-bindings-core casadi-bindings-snopt-interface : deprecated in favor of casadi-bindings-core cascading : deprecated in favor of clay category : deprecated category-traced : deprecated in favor of category cayene-lpp : deprecated in favor of cayenne-lpp ccast : deprecated celtchar : deprecated cerberus : deprecated cereal-ieee754 : deprecated in favor of cereal cereal-plus : deprecated cereal-streams : deprecated in favor of wire-streams certificate : deprecated in favor of x509 cfopu : deprecated in favor of cfipu chart-histogram : deprecated in favor of Chart chart-svg-various : deprecated in favor of prettychart , chart-svg chart-unit : deprecated in favor of chart-svg chronologique : deprecated in favor of core-data chunky : deprecated church-list : deprecated cio : deprecated cipher-aes : deprecated in favor of cryptonite cipher-blowfish : deprecated in favor of cryptonite cipher-rc4 : deprecated in favor of cryptonite clash : deprecated in favor of clash-ghc clash-systemverilog : deprecated in favor of clash-lib clash-verilog : deprecated in favor of clash-lib clash-vhdl : deprecated in favor of clash-lib classy-effects : deprecated in favor of data-effects classy-effects-base : deprecated in favor of data-effects-core classy-effects-th : deprecated in favor of data-effects-th clean-unions : deprecated in favor of extensible clist : deprecated in favor of Fin codec-libevent : deprecated coerce-util : deprecated in favor of coercible-utils cofunctor : deprecated in favor of contravariant combinatorics : deprecated in favor of exact-combinatorics command : deprecated in favor of shake comonad-random : deprecated comonad-transformers : deprecated in favor of comonad comonads-fd : deprecated in favor of comonad compact-string : deprecated in favor of text compositional-data : deprecated concurrentoutput : deprecated in favor of concurrent-output condor : deprecated conduit-tokenize-attoparsec : deprecated conferer-provider-dhall : deprecated in favor of conferer-source-dhall conferer-provider-json : deprecated in favor of conferer-source-json conferer-provider-yaml : deprecated in favor of conferer-source-yaml conferer-source-dhall : deprecated in favor of conferer-dhall conferer-source-json : deprecated in favor of conferer-aeson conferer-source-yaml : deprecated in favor of conferer-yaml console-prompt : deprecated in favor of HCL console-style : deprecated in favor of colorful-monoids constraint : deprecated constraint-reflection : deprecated container-classes : deprecated containers-deepseq : deprecated in favor of containers control : deprecated control-monad-attempt : deprecated control-monad-failure : deprecated control-monad-failure-mtl : deprecated control-timeout : deprecated contstuff : deprecated contstuff-monads-tf : deprecated contstuff-transformers : deprecated conversion : deprecated in favor of lawful-conversions , isomorphism-class convertible-text : deprecated coroutine-enumerator : deprecated coroutine-iteratee : deprecated cprng-aes : deprecated in favor of cryptonite criterion-plus : deprecated cron-compat : deprecated in favor of cron cronus : deprecated cruncher-types : deprecated crypto-pubkey : deprecated in favor of cryptonite crypto-random : deprecated in favor of cryptonite crypto-random-api : deprecated in favor of crypto-random cryptonite : deprecated in favor of crypton , cryptohash-md5 , cryptohash-sha1 , cryptohash-sha256 , cryptohash-sha512 cryptonite-cd : deprecated cryptsy-api : deprecated css : deprecated ctemplate : deprecated darcs-beta : deprecated in favor of darcs darcs-cabalized : deprecated in favor of darcs darcs2dot : deprecated in favor of darcs data-ascii : deprecated in favor of ascii data-binary-ieee754 : deprecated in favor of binary , cereal data-check : deprecated data-extra : deprecated data-json-token : deprecated data-lens-ixset : deprecated in favor of data-store , tables , lens data-msgpack : deprecated in favor of msgpack-binary data-msgpack-types : deprecated in favor of msgpack-types data-object : deprecated in favor of aeson data-object-json : deprecated in favor of aeson data-object-yaml : deprecated in favor of yaml data-r-tree : deprecated in favor of r-tree data-spacepart : deprecated in favor of spacepart dataenc : deprecated in favor of sandi dbmigrations : deprecated dbus-client : deprecated in favor of dbus dbus-core : deprecated in favor of dbus dclabel : deprecated in favor of lio dclabel-eci11 : deprecated in favor of lio ddc-base : deprecated in favor of ddc-core ddc-build : deprecated ddc-code : deprecated ddc-core : deprecated ddc-core-babel : deprecated ddc-core-eval : deprecated ddc-core-flow : deprecated ddc-core-llvm : deprecated ddc-core-salt : deprecated ddc-core-simpl : deprecated ddc-core-tetra : deprecated ddc-driver : deprecated ddc-interface : deprecated ddc-source-tetra : deprecated ddc-tools : deprecated ddc-war : deprecated ddci-core : deprecated debian-binary : deprecated deepseq-generics : deprecated in favor of deepseq deepseq-th : deprecated in favor of deepseq-generics delude : deprecated demarcate : deprecated in favor of free depends : deprecated in favor of cabal-install dhall-text : deprecated in favor of dhall diagrams-html5 : deprecated in favor of diagrams-canvas diff : deprecated diffmap : deprecated in favor of patience digamma : deprecated in favor of math-functions dimensional-tf : deprecated in favor of dimensional display-haskell-do : deprecated disposable : deprecated in favor of glazier-react distributed-fork : deprecated distributed-fork-aws-lambda : deprecated distributed-process-platform : deprecated in favor of distributed-process-extras , distributed-process-async , distributed-process-client-server , distributed-process-registry , distributed-process-supervisor , distributed-process-task , distributed-process-execution do-notation-dsl : deprecated in favor of control-dsl dobutok : deprecated in favor of dobutokO doctest-discover-configurator : deprecated doctest-prop : deprecated in favor of doctest dpor : deprecated in favor of dejafu dropbox : deprecated dropsolve : deprecated in favor of confsolve dtd : deprecated dual : deprecated duplo : deprecated dvda : deprecated in favor of dynobud eager-sockets : deprecated either-both : deprecated either-unwrap : deprecated in favor of either eithers : deprecated in favor of either ekg-elastic : deprecated in favor of ekg-elasticsearch elm-build-lib : deprecated elm-compiler : deprecated elm-get : deprecated in favor of elm-package elm-make : deprecated elm-package : deprecated elm-reactor : deprecated elm-repl : deprecated elm-server : deprecated in favor of elm-reactor email : deprecated email-postmark : deprecated in favor of postmark empty : deprecated enumeration : deprecated in favor of cantor-pairing , finitary , smallcheck enumerator : deprecated epub : deprecated in favor of epub-metadata epubname : deprecated in favor of epub-tools error-location : deprecated in favor of file-location errorcall-eq-instance : deprecated in favor of base-orphans essence-of-live-coding-gloss-example : deprecated essence-of-live-coding-pulse-example : deprecated ether : deprecated ethereum-merkle-patricia-db : deprecated in favor of merkle-patricia-db event-transformer : deprecated exception-monads-fd : deprecated in favor of exception-mtl exinst-deepseq : deprecated in favor of exinst exinst-hashable : deprecated in favor of exinst expat-enumerator : deprecated ez-couch : deprecated ez3 : deprecated f-ree-hack-cheats-free-v-bucks-generator : deprecated failable-list : deprecated in favor of enumerator failure : deprecated in favor of exceptions familiar-reflection : deprecated fastirc : deprecated in favor of irc fastparser : deprecated fay-builder : deprecated fedora-dists : deprecated in favor of fedora-releases fedora-img-dl : deprecated in favor of dl-fedora feed2lj : deprecated fei-dataiter : deprecated in favor of fei-nn file-embed-poly : deprecated fileneglect : deprecated in favor of follow-file filepath-bytestring : deprecated in favor of filepath filesystem-conduit : deprecated in favor of conduit-combinators filesystem-enumerator : deprecated find-conduit : deprecated in favor of pipes-files , conduit-find fix-parser-simple : deprecated fixed-point : deprecated fixed-point-vector : deprecated fixed-point-vector-space : deprecated fixed-width : deprecated fltkhs-demos : deprecated fltkhs-fluid-demos : deprecated fltkhs-fluid-examples : deprecated in favor of fltkhs-fluid-demos foldable1 : deprecated foobar : deprecated foreign-var : deprecated in favor of StateVar forger : deprecated formlets : deprecated in favor of digestive-functors formlets-hsp : deprecated in favor of digestive-functors-hsp forth-hll : deprecated free-v-bucks-generator-no-survey : deprecated free-v-bucks-generator-ps4-no-survey : deprecated fsharp : deprecated functor : deprecated in favor of category functor-apply : deprecated in favor of semigroupoids fusion : deprecated in favor of streaming fwgl : deprecated in favor of ombra fwgl-glfw : deprecated in favor of ombra fwgl-javascript : deprecated in favor of ombra gamgee : deprecated gauge : deprecated in favor of criterion , tasty-bench gemmula-altera : deprecated general-prelude : deprecated generators : deprecated generic-data-asserts : deprecated in favor of generic-type-asserts generic-lucid-scaffold : deprecated in favor of webpage generic-tree : deprecated in favor of hs-functors getopt-simple : deprecated in favor of optparse-simple ghc-debugger : deprecated in favor of haskell-debugger ghc-dup : deprecated in favor of dupIO ghc-mod : deprecated ghc-time-alloc-prof : deprecated in favor of ghc-prof ghci-diagrams : deprecated in favor of activehs ghcjs-websockets : deprecated ginsu : deprecated git-embed : deprecated in favor of githash git-object : deprecated in favor of gitlib gitHUD : deprecated in favor of githud github-data : deprecated gitlab-api : deprecated in favor of gitlab-haskell gitlib-cross : deprecated gitlib-sample : deprecated gitlib-utils : deprecated in favor of gitlib gitson : deprecated glapp : deprecated glazier-pipes : deprecated glazier-react-examples : deprecated glue : deprecated in favor of glue-common , glue-core , glue-ekg , glue-example gmpint : deprecated in favor of hgmp google-dictionary : deprecated graph-rewriting-cl : deprecated in favor of graph-rewriting-trs graphula-core : deprecated in favor of graphula groupoid : deprecated groupoids : deprecated in favor of semigroupoids hF2 : deprecated in favor of eccrypto hR : deprecated hack : deprecated in favor of hack2 hack-contrib : deprecated hack-frontend-happstack : deprecated hack-frontend-monadcgi : deprecated in favor of wai-frontend-monadcgi hack-handler-cgi : deprecated in favor of wai-extra hack-handler-fastcgi : deprecated in favor of wai-handler-fastcgi hack-handler-happstack : deprecated hack-handler-hyena : deprecated hack-handler-kibro : deprecated hack-handler-simpleserver : deprecated in favor of warp hack-middleware-cleanpath : deprecated hack-middleware-clientsession : deprecated hack-middleware-gzip : deprecated in favor of wai-extra hack-middleware-jsonp : deprecated in favor of wai-extra hackage-proxy : deprecated haddock-leksah : deprecated in favor of haddock haddock-test : deprecated hails-bin : deprecated in favor of hails hairy : deprecated hakyll-R : deprecated in favor of R-pandoc hakyll-blaze-templates : deprecated hakyll-ogmarkup : deprecated halipeto : deprecated hamlet : deprecated in favor of shakespeare happstack : deprecated in favor of happstack-server happstack-data : deprecated in favor of safecopy happstack-facebook : deprecated in favor of fb happstack-ixset : deprecated in favor of ixset happstack-state : deprecated in favor of acid-state happstack-util : deprecated happstack-yui : deprecated harvest-api : deprecated hashable-extras : deprecated in favor of hashable hashable-time : deprecated in favor of time-compat hashmap : deprecated in favor of unordered-containers hashtables-plus : deprecated haskell-formatter : deprecated in favor of hindent haskell-lsp : deprecated in favor of lsp haskell-lsp-client : deprecated haskell-lsp-types : deprecated in favor of lsp-types haskell-menu : deprecated in favor of HCL haskell-read-editor : deprecated in favor of read-editor haskell-src-meta-mwotton : deprecated in favor of haskell-src-meta haskell-xmpp : deprecated haskelldb-connect-hdbc : deprecated haskelldb-connect-hdbc-catchio-mtl : deprecated haskelldb-connect-hdbc-catchio-tf : deprecated haskelldb-connect-hdbc-catchio-transformers : deprecated haskelldb-connect-hdbc-lifted : deprecated haskgame : deprecated in favor of sdl2 hasklepias : deprecated haskoin : deprecated in favor of haskoin-core haskoin-crypto : deprecated in favor of haskoin haskoin-protocol : deprecated in favor of haskoin haskoin-script : deprecated in favor of haskoin haskoin-util : deprecated in favor of haskoin haskus-utils-variant : deprecated in favor of variant haskyapi : deprecated hasql-backend : deprecated in favor of hasql hasql-postgres : deprecated in favor of hasql hasql-postgres-options : deprecated in favor of hasql-optparse-applicative hastache : deprecated in favor of mustache hayland : deprecated hcg-minus : deprecated hcg-minus-cairo : deprecated hcheat : deprecated hdbc-postgresql-hstore : deprecated in favor of HDBC-postgresql-hstore , postgresql-simple hdf : deprecated heart-app : deprecated heart-core : deprecated heavy-log-shortcuts : deprecated in favor of monad-logger hecc : deprecated in favor of eccrypto hermes : deprecated hexif : deprecated in favor of hsexif hexpat-pickle-generic : deprecated hfann : deprecated hie-core : deprecated in favor of ghcide highWaterMark : deprecated higherorder : deprecated highlight-versions : deprecated highlighting-kate : deprecated in favor of skylighting hinter : deprecated hipe : deprecated in favor of hgeometry-ipe hjcase : deprecated hjsonpointer : deprecated hjsonschema : deprecated hkd-default : deprecated in favor of aeson-default hledger-api : deprecated in favor of hledger-web hledger-chart : deprecated in favor of hledger-web hledger-irr : deprecated in favor of hledger hledger-makeitso : deprecated in favor of hledger-flow hledger-vty : deprecated in favor of hledger-web hlogger : deprecated hls : deprecated hls-exactprint-utils : deprecated in favor of ghcide hly : deprecated hmatrix-banded : deprecated in favor of lapack hmeap : deprecated hmeap-utils : deprecated hmm-hmatrix : deprecated in favor of hmm-lapack hmt : deprecated hmt-base : deprecated hmt-diagrams : deprecated holey-format : deprecated in favor of formatting hosc-json : deprecated hosc-utils : deprecated hotswap : deprecated hps : deprecated hps-cairo : deprecated hq : deprecated in favor of HQu hs-functors : deprecated hs-gen-iface : deprecated hs-ix : deprecated hs-profunctors : deprecated in favor of hs-functors hs-zstd : deprecated in favor of zstd hs2048 : deprecated hsXenCtrl : deprecated hsc3-auditor : deprecated hsc3-cairo : deprecated hsc3-data : deprecated hsc3-db : deprecated hsc3-dot : deprecated hsc3-forth : deprecated hsc3-graphs : deprecated hsc3-lang : deprecated hsc3-lisp : deprecated hsc3-plot : deprecated hsc3-rec : deprecated hsc3-rw : deprecated hsc3-sf : deprecated hsc3-sf-hsndfile : deprecated hsc3-unsafe : deprecated hsc3-utils : deprecated hsdif : deprecated hsdns-cache : deprecated in favor of concurrent-dns-cache hsfacter : deprecated in favor of language-puppet hsgnutls-yj : deprecated hsharc : deprecated hslogger4j : deprecated in favor of hslogger hsmisc : deprecated hspear : deprecated hspec-expectations-pretty : deprecated in favor of hspec-expectations-pretty-diff hspec-shouldbe : deprecated in favor of hspec hspec2 : deprecated in favor of hspec hsprocess : deprecated in favor of haskell-awk hsql-mysql : deprecated hsqml-morris : deprecated in favor of hsqml-demo-morris hstox : deprecated in favor of toxcore hsx : deprecated in favor of hsx2hs htirage : deprecated in favor of reloto htlset : deprecated in favor of htssets html-minimalist : deprecated hts : deprecated htsn : deprecated htsn-common : deprecated htsn-import : deprecated http-client-conduit : deprecated in favor of http-conduit http-client-multipart : deprecated in favor of http-client http-enumerator : deprecated in favor of http-conduit http-listen : deprecated in favor of warp http-shed : deprecated in favor of httpd-shed http-wget : deprecated in favor of http-conduit hutton : deprecated hw-prim-bits : deprecated hw-vector : deprecated in favor of hw-prim hydrogen-util : deprecated in favor of hydrogen-parsing , hydrogen-prelude hyphenate : deprecated hz3 : deprecated iException : deprecated ical : deprecated in favor of iCalendar ide-backend-rts : deprecated in favor of ide-backend-server idna2008 : deprecated ieee : deprecated in favor of ieee754 ieee754-parser : deprecated in favor of data-binary-ieee754 ige-mac-integration : deprecated in favor of gtk3-mac-integration ihaskell-display : deprecated in favor of ihaskell ihttp : deprecated imperative-edsl-vhdl : deprecated in favor of hardware-edsl imprint : deprecated in favor of distributed-closure inline-java : deprecated interchangeable : deprecated interpolatedstring-qq-mwotton : deprecated in favor of interpolatedstring-qq io-capture : deprecated io-classes-mtl : deprecated in favor of io-classes ipc : deprecated ircbouncer : deprecated ismtp : deprecated iteratee-mtl : deprecated in favor of iteratee ival : deprecated ivor : deprecated in favor of idris ivory-bitdata : deprecated in favor of ivory ixmonad : deprecated in favor of effect-monad , type-level-sets jack-bindings : deprecated jenga : deprecated jni : deprecated joinlist : deprecated jot : deprecated in favor of shakebook jsc : deprecated in favor of jsaddle json-bytes-builder : deprecated in favor of jsonifier json-encoder : deprecated in favor of json-bytes-builder json-enumerator : deprecated in favor of aeson json2yaml : deprecated in favor of yaml jvm : deprecated jvm-batching : deprecated jvm-streaming : deprecated kafka-client : deprecated kdesrc-build-extra : deprecated in favor of kdesrc-build-profiles key : deprecated key-vault : deprecated kibro : deprecated koji-install : deprecated in favor of koji-tool lambdabot-utils : deprecated in favor of lambdabot lambdacube-bullet : deprecated lambdacube-core : deprecated in favor of lambdacube-compiler , lambdacube-ir lambdacube-engine : deprecated in favor of lambdacube-core lambdacube-examples : deprecated in favor of lambdacube-samples language-fortran : deprecated in favor of fortran-src language-lua2 : deprecated language-sh : deprecated layout-bootstrap : deprecated layoutz-hs : deprecated in favor of layoutz lean : deprecated learn-physics-examples : deprecated in favor of learn-physics legion : deprecated in favor of om-legion legion-discovery : deprecated legion-discovery-client : deprecated legion-extra : deprecated lens-core : deprecated in favor of lens lens-labels : deprecated in favor of proto-lens lensref : deprecated lenz : deprecated lenz-mtl : deprecated lenz-template : deprecated lex-applicative : deprecated lgtk : deprecated lhae : deprecated libGenI : deprecated in favor of GenI libmolude : deprecated in favor of liblawless libnix : deprecated libraft : deprecated libxml-enumerator : deprecated lift-read-show : deprecated lifted-base-tf : deprecated linear-maps : deprecated linux-evdev : deprecated in favor of evdev lio-eci11 : deprecated in favor of lio liquid-base : deprecated in favor of liquidhaskell liquid-bytestring : deprecated in favor of liquidhaskell liquid-containers : deprecated in favor of liquidhaskell liquid-ghc-prim : deprecated in favor of liquidhaskell list-grouping : deprecated in favor of split listlike-instances : deprecated in favor of ListLike llvm : deprecated in favor of llvm-hs , llvm-general , llvm-tf llvm-base : deprecated in favor of llvm-general llvm-ht : deprecated in favor of llvm-tf , llvm-ffi located-monad-logger : deprecated in favor of monad-logger log : deprecated in favor of log-base , log-postgres , log-elasticsearch log-postgres : deprecated logging-effect-extra : deprecated logging-effect-extra-file : deprecated logging-effect-extra-handler : deprecated loli : deprecated in favor of miku lss : deprecated lucienne : deprecated lzma-static : deprecated in favor of xz , xz-clib markdown : deprecated in favor of cmark , cmark-gfm markdown-kate : deprecated in favor of markdown markdown2svg : deprecated massiv-scheduler : deprecated in favor of scheduler mathista : deprecated memory-cd : deprecated menshen : deprecated metaplug : deprecated in favor of hint miconix-test : deprecated microformats2-types : deprecated in favor of microformats2-parser , aeson microlens-each : deprecated in favor of microlens mida : deprecated minioperational : deprecated in favor of monad-skeleton minst-idx : deprecated in favor of mnist-idx mlist : deprecated in favor of List mm2 : deprecated in favor of mmsyn2 mmsyn3 : deprecated in favor of end-of-exe mmsyn4 : deprecated in favor of gvti mmtl-base : deprecated modular-prelude : deprecated modular-prelude-classy : deprecated monad-bool : deprecated monad-classes : deprecated monad-exception : deprecated in favor of layers monad-fork : deprecated in favor of layers monad-lrs : deprecated monad-param : deprecated in favor of indexed monad-unlift : deprecated in favor of unliftio-core , unliftio , rio monadbi : deprecated monadfibre : deprecated monads-fd : deprecated in favor of mtl mondo : deprecated in favor of monzo mono-foldable : deprecated in favor of mono-traversable monoid-owns : deprecated in favor of air monoids : deprecated in favor of reducers monomorphic : deprecated in favor of singletons mosquitto-hs : deprecated mount : deprecated in favor of linux-mount mps : deprecated in favor of air msh : deprecated in favor of hoop mtl-evil-instances : deprecated in favor of layers mtl-extras : deprecated in favor of transformers-lift mtp : deprecated multivector : deprecated musicbrainz-email : deprecated mutable-iter : deprecated mwc-probability-transition : deprecated mxnet-dataiter : deprecated in favor of fei-dataiter mxnet-nn : deprecated in favor of fei-nn mxnet-nnvm : deprecated in favor of mxnet my-package-testing : deprecated my-test-docs : deprecated myTestlll : deprecated mysql-pure : deprecated in favor of mysql-haskell n-m : deprecated nanq : deprecated in favor of kanji natural-induction : deprecated neither : deprecated in favor of either , monad-control netlines : deprecated netstring-enumerator : deprecated nettle-openflow : deprecated in favor of openflow network-bytestring : deprecated in favor of network network-conduit : deprecated in favor of conduit-extra network-connection : deprecated network-enumerator : deprecated network-manager-tui : deprecated network-minihttp : deprecated network-msgpack-rpc : deprecated in favor of msgpack-rpc-conduit network-rpca : deprecated network-transport-zeromq : deprecated network-uri-lenses : deprecated in favor of network-uri nixdu : deprecated in favor of nix-tree nixfmt : deprecated nixos-types : deprecated in favor of language-nix nofib-analyze : deprecated in favor of nofib-analyse non-empty-containers : deprecated in favor of nonempty-containers non-empty-sequence : deprecated in favor of nonempty-containers ntrip-client : deprecated numerals-base : deprecated in favor of numerals numhask-array : deprecated in favor of harpie , harpie-numhask numhask-hedgehog : deprecated in favor of numhask numhask-histogram : deprecated in favor of numhask-space numhask-prelude : deprecated in favor of numhask numhask-range : deprecated in favor of numhask-space numhask-test : deprecated in favor of numhask-hedgehog nums : deprecated octane : deprecated in favor of rattletrap oculus : deprecated ogma-language-cocospec : deprecated in favor of ogma-language-lustre ogma-language-fret-cs : deprecated in favor of ogma-core ogma-language-fret-reqs : deprecated in favor of ogma-language-jsonspec ogmarkup : deprecated om-actor : deprecated in favor of om-fork om-http-logging : deprecated in favor of om-http om-kubernetes : deprecated in favor of kubernetes-client , haskell-kubernetes online : deprecated in favor of mealy online-csv : deprecated open-pandoc : deprecated in favor of pandoc openssh-github-keys : deprecated opentheory-char : deprecated in favor of opentheory-unicode overture : deprecated in favor of flow package-o-tron : deprecated packedstring : deprecated in favor of bytestring pagarme : deprecated pagure-hook-receiver : deprecated panda : deprecated in favor of bamboo pandoc-citeproc : deprecated in favor of citeproc pandoc-highlighting-extensions : deprecated pandoc-pyplot : deprecated in favor of pandoc-plot pandoc-unlit : deprecated in favor of markdown-unlit pantry-tmp : deprecated in favor of pantry papa-export : deprecated in favor of papa papa-implement : deprecated in favor of papa papa-include : deprecated in favor of papa papa-prelude : deprecated in favor of papa papa-prelude-core : deprecated in favor of papa papa-prelude-lens : deprecated in favor of papa papa-prelude-semigroupoids : deprecated in favor of papa papa-prelude-semigroups : deprecated in favor of papa parco : deprecated in favor of parser-combinators parco-attoparsec : deprecated in favor of parser-combinators parco-parsec : deprecated in favor of parser-combinators parsec-parsers : deprecated in favor of parsers parsimony : deprecated partial-lens : deprecated in favor of data-lens partial-semigroup-test : deprecated in favor of partial-semigroup-hedgehog pasta : deprecated paypal-adaptive-hoops : deprecated pb-next : deprecated pbc4hs : deprecated pcap-enumerator : deprecated pcre-less : deprecated pdc : deprecated in favor of bodhi pedersen-commitment : deprecated in favor of elliptic-curve penny-bin : deprecated in favor of penny penny-lib : deprecated in favor of penny perf-analysis : deprecated in favor of perf permutations : deprecated in favor of Fin permute : deprecated in favor of parser-combinators persistent-event-source : deprecated in favor of persistent-eventsource persistent-instances-iproute : deprecated in favor of persistent-iproute persistent-map : deprecated in favor of tbox pg-harness : deprecated in favor of tempgres-client pg-harness-client : deprecated in favor of tempgres-client pg-harness-server : deprecated in favor of tempgres-client pgsql-simple : deprecated in favor of postgresql-simple pgstream : deprecated phoityne : deprecated in favor of phoityne-vscode phone-metadata : deprecated phonetic-languages-constaints : deprecated in favor of phonetic-languages-constraints phonetic-languages-permutations-array : deprecated in favor of aftovolio phonetic-languages-simplified-properties-lists : deprecated in favor of phonetic-languages-simplified-properties-lists-double pianola : deprecated picoparsec : deprecated in favor of grammatical-parsers , incremental-parser , attoparsec pipes-attoparsec-streaming : deprecated pipes-cereal-plus : deprecated pipes-cliff : deprecated pipes-core : deprecated in favor of pipes pipes-lines : deprecated in favor of pipes-break pipes-p2p-examples : deprecated in favor of pipes-p2p pipes-postgresql-simple : deprecated in favor of streaming-postgresql-simple , streaming-utils plan-b : deprecated planet-mitchell : deprecated planet-mitchell-test : deprecated plot-lab : deprecated in favor of plot-gtk-ui , calculator poke : deprecated in favor of discord-register pokitdok : deprecated polynom : deprecated polyseq : deprecated in favor of free-theorems-seq pontarius-mediaserver : deprecated pontarius-xpmn : deprecated pool : deprecated in favor of resource-pool pool-conduit : deprecated in favor of resource-pool postgrest-ws : deprecated in favor of postgres-websockets pqueue-mtl : deprecated in favor of queuelike prednote-test : deprecated in favor of prednote prelude-extras : deprecated in favor of base , transformers-compat prelude-prime : deprecated pretty-class : deprecated in favor of prettyclass , pretty process-conduit : deprecated in favor of conduit-extra process-listlike : deprecated in favor of process-extras process-progress : deprecated in favor of process-extras procrastinating-structure : deprecated product : deprecated progressbar : deprecated project-forge : deprecated prolude : deprecated prometheus-effect : deprecated in favor of prometheus-client , wai-middleware-prometheus , prometheus-metrics-ghc proof-combinators : deprecated in favor of liquid-prelude property : deprecated proto-lens-combinators : deprecated in favor of proto-lens proto-lens-descriptors : deprecated in favor of proto-lens psc-ide : deprecated in favor of purescript puppetresources : deprecated in favor of language-puppet pursuit-client : deprecated puzzle-draw-cmdline : deprecated in favor of puzzle-draw qr-imager : deprecated in favor of qrcode-juicypixels , qrcode-core queue : deprecated quickpull : deprecated in favor of tasty-th quickson : deprecated in favor of aeson-quick quipper-core : deprecated in favor of quipper-language quipper-rendering : deprecated in favor of easyrender rad : deprecated in favor of ad radium-formula-parser : deprecated in favor of radium rainbow-tests : deprecated random-class : deprecated random-source : deprecated ranges : deprecated reactive-banana-threepenny : deprecated in favor of threepenny-gui reactive-haskell : deprecated reactive-io : deprecated reactor : deprecated readme-lhs : deprecated record-encode : deprecated in favor of heidi refined-with : deprecated in favor of strongweak refined1 : deprecated in favor of rerefined reflex-basic-host : deprecated in favor of reflex reflex-dom-colonnade : deprecated reflex-dom-helpers : deprecated reflex-orphans : deprecated in favor of reflex reg-alloc : deprecated reg-alloc-graph-color : deprecated reg-alloc-types : deprecated regex-tdfa-rc : deprecated in favor of regex-tdfa regex-tdfa-text : deprecated in favor of regex-tdfa regex-tdfa-unittest : deprecated in favor of regex-tdfa regions-monadsfd : deprecated in favor of regions-mtl regular-xmlpickler : deprecated in favor of generic-xmlpickler rehoo : deprecated in favor of hoogle remote : deprecated in favor of distributed-process remotion : deprecated repa-devil : deprecated in favor of friday repl : deprecated representable-functors : deprecated in favor of adjunctions representable-profunctors : deprecated in favor of profunctors resolve-trivial-conflicts : deprecated in favor of git-mediate resourcet-pool : deprecated in favor of unliftio-pool rethinkdb-wereHamster : deprecated rezoom : deprecated ribbit : deprecated ribosome-root : deprecated in favor of ribosome ridley-extras : deprecated in favor of ridley rivet : deprecated rounding : deprecated row : deprecated rts-loader : deprecated safe-exceptions-checked : deprecated safe-failure : deprecated safecopy-migrate : deprecated salak-toml : deprecated sbp2udp : deprecated sc3-rdu : deprecated scalendar : deprecated scan-metadata : deprecated scgi : deprecated in favor of wai scotty-blaze : deprecated scotty-cookie : deprecated scotty-resource : deprecated scotty-session : deprecated in favor of Spock secp256k1 : deprecated in favor of secp256k1-haskell semialign-indexed : deprecated in favor of semialign semialign-optics : deprecated in favor of semialign senza : deprecated in favor of lucid serokell-util : deprecated serpentine : deprecated in favor of trasa servant-fiat-content : deprecated servant-generic : deprecated in favor of servant servant-jquery : deprecated in favor of servant-js servant-pool : deprecated servant-postgresql : deprecated in favor of servant servant-response : deprecated in favor of servant servant-scotty : deprecated in favor of servant serviette : deprecated ses-html-snaplet : deprecated in favor of snaplet-ses-html set-with : deprecated in favor of sets setoid : deprecated in favor of skeletal-set sexp-show : deprecated sext : deprecated in favor of static-text shakespeare-babel : deprecated shakespeare-css : deprecated in favor of shakespeare shakespeare-i18n : deprecated in favor of shakespeare shakespeare-js : deprecated in favor of shakespeare shakespeare-text : deprecated in favor of shakespeare shell-pipe : deprecated in favor of process shortbytestring : deprecated in favor of bytestring si-timers : deprecated in favor of io-classes sifflet-lib : deprecated in favor of sifflet simplemesh : deprecated simplesmtpclient : deprecated simplex-basic : deprecated sink : deprecated siphash : deprecated in favor of memory sized-vector : deprecated in favor of sized skylark-client : deprecated skylighting-extensions : deprecated skylighting-modding : deprecated slug : deprecated smallcheck-kind-generics : deprecated snap-app : deprecated snap-cors : deprecated in favor of snap-core snap-testing : deprecated in favor of hspec-snap snaplet-fay : deprecated snaplet-lss : deprecated source-code-server : deprecated sparkle : deprecated special-functors : deprecated in favor of base speechmatics : deprecated sproxy : deprecated in favor of sproxy2 spy : deprecated sqlite : deprecated in favor of sqlite-simple stackage-build-plan : deprecated in favor of stackage-curator stackage-cabal : deprecated in favor of stack stackage-cli : deprecated in favor of stack stackage-metadata : deprecated stackage-sandbox : deprecated in favor of stack stackage-setup : deprecated in favor of stack stackage-types : deprecated in favor of stackage-curator stackage-upload : deprecated in favor of stack star : deprecated in favor of semirings starter : deprecated state-record : deprecated in favor of lens static-resources : deprecated statistics-fusion : deprecated in favor of statistics statsd : deprecated in favor of ekg-statsd stemmer : deprecated in favor of snowball stern-brocot : deprecated streamed : deprecated in favor of reactive-balsa strelka : deprecated strict-base-types : deprecated in favor of strict , aeson , quickcheck-instances , strict-lens strict-mvar : deprecated in favor of io-classes strict-stm : deprecated in favor of io-classes strict-writer : deprecated in favor of writer-cps-mtl string : deprecated in favor of text string-conv-tests : deprecated in favor of string-conv stringable : deprecated stripe-http-streams : deprecated in favor of stripe-http-client success : deprecated in favor of transformers , validation-selective , validation swagger-petstore : deprecated in favor of openapi-petstore symbol-parser : deprecated in favor of symparsec symbolise : deprecated in favor of symbolize syntax-pretty : deprecated in favor of syntax-printer synthesizer : deprecated in favor of synthesizer-core , synthesizer-dimensional , synthesizer-inference system-fileio : deprecated in favor of directory system-filepath : deprecated in favor of filepath system-inotify : deprecated tables : deprecated tagsoup-ht : deprecated in favor of tagchup tamarin-prover : deprecated tamarin-prover-term : deprecated tamarin-prover-theory : deprecated tamarin-prover-utils : deprecated tao : deprecated tao-example : deprecated tar-bytestring : deprecated in favor of tar , libarchive taskpool : deprecated in favor of async-pool tasty-auto : deprecated in favor of tasty-discover tasty-hedgehog-coverage : deprecated in favor of hedgehog templatepg : deprecated in favor of postgresql-typed temporary-rc : deprecated in favor of temporary test-framework-doctest : deprecated in favor of doctest test-framework-golden : deprecated in favor of tasty-golden test-framework-quickcheck : deprecated in favor of test-framework-quickcheck2 test-framework-smallcheck : deprecated in favor of tasty-smallcheck test-shouldbe : deprecated in favor of hspec-expectations testCom : deprecated in favor of doctest testpack : deprecated text-all : deprecated text-stream-decode : deprecated in favor of streaming-commons text-utf8 : deprecated in favor of text texts : deprecated in favor of formatting textual : deprecated in favor of string-conversions , string-convert th-kinds-fork : deprecated in favor of th-kinds th-typegraph : deprecated thimk : deprecated in favor of spelling-suggest throttle : deprecated throttled : deprecated in favor of scheduler tidal-midi : deprecated time-series-lib : deprecated in favor of timeseries timeless : deprecated tls-extra : deprecated in favor of tls to-string-class : deprecated to-string-instances : deprecated tower : deprecated in favor of numhask tracker : deprecated transformers-free : deprecated in favor of free treemap-html : deprecated treemap-html-tools : deprecated trhsx : deprecated in favor of hsx trivia : deprecated tslib : deprecated tttool : deprecated tuple-generic : deprecated twentefp-eventloop-graphics : deprecated in favor of eventloop twentefp-graphs : deprecated twentefp-rosetree : deprecated in favor of twentefp-trees twentefp-trees : deprecated in favor of twentefp-eventloop-trees twentefp-websockets : deprecated twitter-enumerator : deprecated in favor of twitter-conduit twitter-feed : deprecated txt : deprecated in favor of text-utf8 type-interpreter : deprecated type-list : deprecated ucd : deprecated unconstrained : deprecated unicode-prelude : deprecated in favor of base-unicode-symbols unicode-symbols : deprecated in favor of base-unicode-symbols union-map : deprecated universal : deprecated universe-dependent-sum : deprecated in favor of universe-some universe-instances-base : deprecated in favor of universe-base universe-instances-trans : deprecated in favor of universe-base unix-process-conduit : deprecated in favor of keter unmed2 : deprecated in favor of med-module upskirt : deprecated in favor of sundown uri-conduit : deprecated uri-enumerator : deprecated in favor of uri-conduit uri-enumerator-file : deprecated in favor of uri-conduit useragents : deprecated utf : deprecated utf8-prelude : deprecated util : deprecated util-exception : deprecated util-logict : deprecated util-primitive : deprecated util-universe : deprecated uvector : deprecated in favor of vector valid : deprecated validate : deprecated in favor of digestive-functors variable-precision : deprecated in favor of rounded vect-floating : deprecated in favor of linear vect-floating-accelerate : deprecated in favor of linear-accelerate vector-read-instances : depre | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/syntax-highlighting/invocation-order/ | Invocation Order | 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 Invocation Order 3.0 3.0 2.5 Edit this Page Invocation Order This section explains the order of method invocations on a syntax highlighter. For a concrete example we use this document: = Syntax Highlighter Test == Some sources [source,java] ---- System.out.println("Hello Java"); ---- [source,go] ---- fmt.Println("Hello Go") ---- For this document the calls to a syntax highlighter will happen in this order: New SyntaxHighlighter format java highlight System.out.println("Hello Java"); format go highlight fmt.Println("Hello Go") hasDocInfo for HEADER getDocInfo for HEADER hasDocInfo for FOOTER getDocInfo for FOOTER isWriteStylesheet writeStylesheet Static Syntax Highlighting During Conversion Automatically Load a Syntax Highlighter 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:25 |
https://www.unicode.org/reports/tr17/ | UTR#17: Unicode Character Encoding Model Technical Reports Unicode® Technical Report #17 Unicode Character Encoding Model Editors Ken Whistler ( [email protected] ), Asmus Freytag ( [email protected] ) Date 2022-11-11 This Version https://www.unicode.org/reports/tr17/tr17-9.html Previous Version https://www.unicode.org/reports/tr17/tr17-7.html Latest Version https://www.unicode.org/reports/tr17/ Latest Proposed Update https://www.unicode.org/reports/tr17/proposed.html Revision 9 Summary This document clarifies a number of the terms used to describe character encodings. It elaborates the Internet Architecture Board ( IAB ) three-layer “text stream” definitions from RFC 2130 into a four-layer structure more appropriate for explanation of the Unicode Standard. Status This is a draft document which may be updated, replaced, or superseded by other documents at any time. Publication does not imply endorsement by the Unicode Consortium. This is not a stable document; it is inappropriate to cite this document as other than a work in progress. END NOT YET APPROVED --> This document has been reviewed by Unicode members and other interested parties, and has been approved for publication by the Unicode Consortium. This is a stable document and may be used as reference material or cited as a normative reference by other specifications. A Unicode Technical Report (UTR) contains informative material. Conformance to the Unicode Standard does not imply conformance to any UTR. Other specifications, however, are free to make normative references to a UTR. Please submit corrigenda and other comments with the online reporting form [ Feedback ]. Related information that is useful in understanding this document is found in the References . For the latest version of the Unicode Standard, see [ Unicode ]. For a list of current Unicode Technical Reports, see [ Reports ]. For more information about versions of the Unicode Standard, see [ Versions ]. Contents The Unicode Character Encoding Model Abstract Character Repertoire 2.1 Versioning 2.2 Characters versus Glyphs 2.3 Compatibility and User-perceived Characters 2.4 Subsets Coded Character Set (CCS) 3.1 Character Naming 3.2 Codespaces Character Encoding Form (CEF) Character Encoding Scheme (CES) 5.1 Byte Order Character Maps Transfer Encoding Syntax Data Types and API Binding 8.1 Strings Definitions and Acronyms References Acknowledgements Modifications 1 The Unicode Character Encoding Model This report describes a model for the structure of character encodings. The Unicode Character Encoding Model places the Unicode Standard in the context of other character encodings of all types, as well as other character encoding models such as the character architecture promoted by the Internet Architecture Board ( IAB ) for use on the internet [ RFC 2130 ], or the Character Data Representation Architecture [ CDRA ] defined by IBM for organizing and cataloging its own proprietary array of character encodings. The Unicode Character Encoding Model extends these models to cover all the aspects of the Unicode Standard and ISO / IEC 10646 [ 10646 ]. (Common acronyms used in this text are highlighted. For a list, see Section 9 Definitions and Acronyms ). The four levels of the Unicode Character Encoding Model can be summarized as: ACR: Abstract Character Repertoire the set of characters to be encoded, for example, some alphabet or symbol set CCS: Coded Character Set a specific mapping from an abstract character repertoire to a set of nonnegative integers, which need not be contiguous CEF: Character Encoding Form a specific mapping from a set of nonnegative integers that are elements of a CCS to a set of sequences of particular code units of some specified width, such as 32-bit integers CES: Character Encoding Scheme a reversible transformation from a set of sequences of code units (from one or more CEFs) to a serialized sequence of bytes In addition to the four individual levels, there are two other related useful concepts: CM : Character Map a mapping from sequences of members of an abstract character repertoire to serialized sequences of bytes bridging all four levels in a single operation TES: Transfer Encoding Syntax a reversible transform of encoded data, which may or may not contain textual data The IAB model, as defined in Section 3.2 of [ RFC 2130 ], distinguishes three levels: Coded Character Set ( CCS ), Character Encoding Scheme ( CES ), and Transfer Encoding Syntax ( TES ). However, four levels need to be defined to adequately cover the distinctions required for the Unicode character encoding model. One of these, the Abstract Character Repertoire , is implicit in the IAB model. The Unicode model also gives the TES a separate status outside the character encoding model proper, while adding an additional level between the CCS and the CES. The following concepts are also important for the discussion: Codespace the numerical space spanned by the set of integers in a CCS Code Unit the minimal bit combination that can represent a unit of encoded text for processing or interchange (D77 in [ Unicode ]), typically a specified binary width in a computer architecture, such as an 8-bit byte For other terms, see [ Glossary ]. The following sections give sample definitions, explanations and examples for each of the four levels, as well as the Character Map, and the Transfer Encoding Syntax. These are followed by a discussion of API Binding issues and a list of acronyms used in this document. 2 Abstract Character Repertoire A character repertoire is defined as an unordered set of abstract characters to be encoded. The word abstract means that these objects are defined by convention. In many cases a repertoire consists of a familiar alphabet or symbol set. Repertoires come in two types: fixed and open . In most character encodings, the repertoire is fixed, and often small. Once the repertoire is decided upon, it is never changed. Addition of a new abstract character to a given repertoire creates a new repertoire, which then will be given its own catalogue number, constituting a new object. For the Unicode Standard, on the other hand, the repertoire is inherently open. Because Unicode is intended to be the universal encoding, any abstract character that ever could be encoded is potentially a member of the set to be encoded, whether that character is currently known or not. For the Unicode Standard, the set of allowable non-negative integers is bounded; however, it is intentionally large enough to leave room for all anticipated additions of abstract characters. Some other character sets use a more limited notion of open repertoires. For example, Microsoft has on occasion extended the repertoire of its Windows character sets by adding a handful of characters to an existing repertoire. This occurred when the EURO SIGN was added to the repertoire for a number of Windows character sets, for example. For suggestions on how to map the unassigned characters of open repertoires, see [ CharMapML ]. Repertoires are the entities that get CS (“character set”) values in the IBM CDRA architecture. Examples of Character Repertoires: the Japanese syllabaries and ideographs of JIS X 0208 (CS 01058) [fixed] the Western European alphabets and symbols of Latin-1 (CS 00697) [fixed] the POSIX portable character repertoire [fixed] the IBM host Japanese repertoire (CS 01001) [fixed] the Windows Western European repertoire [open] the Unicode/10646 repertoire [open] 2.1 Versioning The Unicode Standard versions its repertoire by publication of major and minor editions of the standard: 1.0, 1.1, 2.0, 2.1, 3.0, ... The repertoire for each version is defined by the enumeration of abstract characters included in that version. Repertoire extensions for the Unicode Standard are now strictly additive, even though there were several discontinuities to the earliest versions (1.0 and 1.1) affecting backwards compatibility to them, because of the merger of [ Unicode ] with [ 10646 ]. As of Version 2.0 the Unicode Character Encoding Stability Policies [ Stability ] guarantee that no character is ever removed from the repertoire. Note: The Unicode Character Encoding Stability Policies also constrain changes to the standard in other ways. For example, many character properties are subject to consistency constraints, and some properties cannot be changed once they are assigned. Guarantees for the stability of normalization prevent the change or addition of decomposition mappings for existing encoded characters, and also constrain what kinds of characters can be added to the repertoire in future versions. At times, there may be versions between major and minor versions of the Unicode Standard. While such update versions may amend the text of the Unicode Standard and of the Unicode Character Database [ UCD ], which defines Character Properties (see also [ PropModel ]), they do not add to the character repertoire. For more information about versions of the Unicode Standard see Versions of the Unicode Standard . ISO/IEC 10646 extends its repertoire by a formal amendment process. As each individual amendment containing additional characters is published, it extends the 10646 repertoire. The repertoires of the Unicode Standard and ISO/IEC 10646 are kept in alignment by coordinating the publication of major versions of the Unicode Standard with the publication of a well-defined list of amendments for 10646 or with a major revision and republication of 10646. 2.2 Characters versus Glyphs The elements of the character repertoire are abstract characters . Abstract characters are defined by their identity, which is not limited to their appearance, but may be defined in part by particular properties or membership in a script. In particular, characters differ from glyphs , which are the particular images representing a character or part of a character. Glyphs for the same character may have very different shapes, as shown in Figure 1 for the letter a . Figure 1 Character Sample Glyphs Glyphs do not correspond one-to-one with characters. For example, a sequence of “f” followed by “i” may be displayed with a single glyph, called an fi ligature. Notice that the shapes are merged together, and the dot is missing from the “i” as shown in Figure 2. Figure 2 Character Sequence Sample Glyph On the other hand, the same image as the fi ligature could conceivably be achieved by a sequence of two glyphs with the right shapes, as in the hypothetical example shown in Figure 3. The choice of whether to use a single glyph or a sequence of two is determined by the font and the rendering software. Figure 3 Character Sequence Possible Glyph Sequence Similarly, an accented character could be represented by a single glyph, or by separate component glyphs positioned appropriately. In addition, any of the accents can also be considered characters in their own right, in which case a sequence of characters can also correspond to different possible glyph representations: Figure 4 Character Sequence Possible Glyph Sequences In non-Latin scripts, the connection between glyphs and characters is at times even less direct. Glyphs may be required to change their shape, position and width depending on the surrounding glyphs. Such glyphs are called contextual forms. For example, the Arabic character heh has the four contextual glyphs shown in Figure 5. Figure 5 Character Contextual Glyph Shapes In Arabic and other scripts, text inside fixed margins is justified by elongating the horizontal parts of certain glyphs, rather than by expanding the spaces between words. Ideally this is implemented by changing the shape of the glyph depending on the desired width. On some systems, this stretching is approximated by inserting extra connecting, dash-shaped glyphs called kashidas , as shown in Figure 6. In such a case, a single character may conceivably correspond to a whole sequence of kashidas + glyphs + kashidas . Figure 6 Character Sequence of glyphs In other cases, a single character must correspond to two glyphs, because those two glyphs are positioned around other letters. See the Tamil characters in Figure 7 below. If one of those glyphs forms a ligature with other characters, then a conceptual part of a character corresponds to visual part of a glyph. If a character (or any part of it) corresponds to a glyph (or any part of it), then one says that the character contributes to the glyph. Figure 7 Character Split Glyphs The correspondence between glyphs and characters is generally not one-to-one, and cannot be predicted from the text alone. Whether a particular string of characters is rendered by a particular sequence of glyphs will depend on the sophistication of the host operating system and the font. The ordering of glyphs also does not necessarily correspond to the ordering of the characters. In particular the right-to-left scripts like Arabic and Hebrew give rise to complex reordering. See UAX #9: Unicode Bidirectional Algorithm [ Bidi ]. 2.3 Compatibility and User-perceived Characters For historical reasons, abstract character repertoires may include many entities not considered appropriate members of an abstract character repertoire. These so-called compatibility characters may include ligature glyphs, contextual form glyphs, glyphs that vary by width, sequences of characters, and adorned glyphs, such as circled numbers. Whether a particular character represents a compatibility character may be debatable, and there is no definitive list. However, they are often characters that would have violated one or more encoding principles underlying the Unicode Standard, but which were encoded to enable lossless mapping of data from non-Unicode character encodings. As with glyphs, there are not necessarily one-to-one relationships between characters and code points. What an end-user thinks of as a single character (also called a grapheme cluster in the context of Unicode) may in fact be represented by multiple code points; conversely, a single code point may correspond to multiple characters. Here are some examples: Figure 8 Characters Code Points Notes Arabic contextual form glyphs encoded as compatibility characters in Unicode, also known as presentation forms Ligature glyph encoded as compatibility character in Unicode and several character sets A single code point representing a sequence of three characters encoded as compatibility character in Unicode and several character sets The Devanagari syllable ksha represented by three code points G-ring represented by two code points For more information on grapheme cluster boundaries see UAX #29: Unicode Text Segmentation [ Boundaries ]. 2.4 Subsets Unlike most character repertoires, the synchronized repertoire of Unicode and 10646 is intended to be universal in coverage. Given the complexity of many writing systems, in practice this implies that nearly all implementations will fully support only some subset of the total repertoire, rather than all the characters. Formal subset mechanisms are occasionally seen in implementations of some Asian character sets where, for example, the distinction between “Level 1 JIS” and “Level 2 JIS” support refers to particular parts of the repertoire of the JIS X 0208 kanji characters to be included in the implementation. Subsetting is a major formal aspect of ISO / IEC 10646. The standard includes a set of internal catalog numbers for named subsets, and further makes a distinction between subsets that are fixed collections and those that are open collections , defined by a range of code positions. Open collections are extended any time an addition to the repertoire gets encoded in a code position between the range limits defining the collection. When the last of its open code positions is filled, an open collection automatically becomes a fixed collection. The European Committee for Standardization ( CEN ) has defined several multilingual European subsets of ISO/IEC 10646-1 (called MES-1, MES-2, MES-3A, and MES-3B). MES-1 and MES-2 have been added as named fixed collections in 10646. The Unicode Standard specifies neither predefined subsets nor a formal syntax for their definition. It is left to each implementation to define and support the subset of the universal repertoire that it wishes to interpret. Many implementations will use enumerated subsets or subsets implicitly defined by the Script property or by block ranges, where required. 3 Coded Character Set (CCS) A coded character set is defined to be a mapping from a set of abstract characters to the set of nonnegative integers. This range of integers need not be contiguous. In the Unicode Standard, the concept of the Unicode scalar value (see definition D76, in Chapter 3, "Conformance" of [ Unicode ]) explicitly defines such a noncontiguous range of integers. An abstract character is defined to be in a coded character set if the coded character set maps from it to an integer. That integer is the code point to which the abstract character has been assigned . That abstract character is then an encoded character . Coded character sets are the basic object that both ISO and proprietary character encoding committees produce. They relate a defined repertoire to nonnegative integers, which then can be used unambiguously to refer to particular abstract characters from the repertoire. A coded character set may also be known as a character encoding , a coded character repertoire , a character set definition , or a code page . In the IBM CDRA architecture, CP (“code page”) values refer to coded character sets. Note that this use of the term code page is quite precise and limited. It should not be—but generally is—confused with the generic use of code page to refer to character encoding schemes. Examples of Coded Character Sets: Name Repertoire JIS X 0208 assigns pairs of integers known as kuten points ISO/IEC 8859-1 ASCII plus Latin-1 ISO/IEC 8859-2 different repertoire than 8859-1, although both use the same codespace Code Page 037 same repertoire as 8859-1; different integers assigned to the same characters Code Page 500 same repertoire as 8859-1 and Code Page 037; different integers Windows Code Page 1252 contains subset of repertoire of 8859-1 at the same integers, but also Windows-specific additions The Unicode Standard, Version 2.0 exactly the same repertoire and mapping ISO/IEC 10646-1:1993 plus amendments 1-7 The Unicode Standard, Version 3.0 exactly the same repertoire and mapping ISO/IEC 10646-1:2000 The Unicode Standard, Version 4.0 exactly the same repertoire and mapping ISO/IEC 10646:2003 This document does not attempt to list all versions of the Unicode Standard. See Versions of the Unicode Standard for the complete list of versions and for information how they match with particular versions and amendments of 10646. 3.1 Character Naming SC2, the JTC1 subcommittee responsible for character coding, requires the assignment of a unique character name for each abstract character in the repertoire of its coded character sets. This practice is not generally followed in proprietary coded character sets or in the encodings produced by standards committees outside SC2, in which any names provided for characters are often variable and annotative, rather than normative parts of the character encoding. The main rationale for the SC2 practice of character naming is to provide a mechanism to unambiguously identify abstract characters across different repertoires given different mappings to integers in different coded character sets. Thus LATIN SMALL LETTER A WITH GRAVE would be the same abstract character, even though it occurs in different repertoires and is assigned different integers in different coded character sets. The IBM CDRA [ CDRA ], on the other hand, ensures character identity across different coded character sets (or code pages ) by assigning a catalogue number known as a GCGID (graphic character global identifier), to every abstract character used in any of the repertoires accounted for by the CDRA . Abstract characters that have the same GCGID in two different coded character sets are by definition the same character. Other vendors have made use of similar internal identifier systems for abstract characters. The advent of Unicode/10646 has largely rendered such schemes obsolete. The identity of abstract characters in all other coded character sets is increasingly defined by reference to Unicode/10646. Part of the pressure to include every “character” from every existing coded character set into the Unicode Standard results from the desire to get rid of subsidiary mechanisms for tracking bits and pieces that are not part of Unicode, and instead just use the Unicode Standard as the universal catalog of characters. 3.2 Codespaces The set of nonnegative integers used to map abstract characters defines a related concept of codespace . Traditionally, the outer boundaries for codespaces are closely tied to the encoding forms (see below), because the mappings of abstract characters to nonnegative integers are done with particular encoding forms in mind. Examples of common boundaries for codespaces are 0..7F, 0..FF, 0..FFFF, 0..7FFFFFFF, and 0..FFFFFFFF. The codespace for the Unicode Standard is bounded by 0..10FFFF. Codespaces can also have elaborate structures, depending on whether the range of integers is contiguous, or whether particular ranges of values are disallowed. Most complications result from considerations of the encoding form for characters. When an encoding form specifies that the integers being encoded are to be serialized as sequences of bytes, there are often constraints placed on the particular values that those bytes may have. Most commonly such constraints disallow byte values corresponding to control functions. In terms of codespace, such constraints on byte values result in multiple non-contiguous ranges of integers that are disallowed for mapping a character repertoire. (See [ Lunde ] for two-dimensional diagrams of typical codespaces for East Asian coded character sets implementing such constraints.) Note: In ISO standards the term octet is used for an 8-bit byte. In this document, the term byte is used consistently for an 8-bit byte only. 4 Character Encoding Form (CEF) A character encoding form is a mapping from the set of integers used in a CCS to the set of sequences of code units. A code unit is an integer occupying a specified binary width in a computer architecture, such as an 8-bit byte or a 32-bit word. The encoding form enables character representation as actual data in a computer. The sequences of code units do not necessarily have the same length. A character encoding form whose sequences are all of the same length is known as fixed width . A character encoding form whose sequences are not all of the same length is known as variable width . A character encoding form for a coded character set is defined to be a character encoding form that maps all of the encoded characters for that coded character set. Note: In many cases, there is only one character encoding form for a given coded character set. In some such cases only the character encoding form has been specified. This leaves the coded character set implicitly defined, based on an implicit relation between the code unit sequences and integers. When interpreting a sequence of code units, there are three possibilities: The sequence is ill-formed . The sequence is incomplete or otherwise fails to match the specification of the encoding form. For example, 0xA3 is incomplete in CP950. Unless followed by another byte of the right form, it is ill-formed. 0xD800 is incomplete in UTF-16. Unless followed by another 16-bit value of the right form, it is ill-formed. 0xC0 is ill-formed in UTF-8. It cannot be the initial byte (or for that matter, any byte) of a well-formed UTF-8 sequence. For details on ill-formed sequences for UTF-8 and UTF-16, see Section 3.9, Unicode Encoding Forms, in [ Unicode ]. The sequence represents a valid code point, but is unassigned . This sequence may be given an assignment in some future, evolved version of the character encoding. For suggestions on how to handle unassigned characters in mapping, see [ CharMapML ]. For example, 0xA3 0xBF is unassigned in CP950, as of the year 1999. 0x0EDE is unassigned in Unicode 5.0 The source sequence is assigned : it represents a valid encoded character. There are three variants of this: First is a typical assigned character. For example, 0x0EDD is assigned in Unicode 5.0 The second variant is a user-defined character. For example, 0xE000 is an assigned user-defined character whose semantic interpretation is left to agreement between parties outside of the context of the standard. The third type is peculiar to the Unicode Standard: the noncharacter . This is a kind of internal-use user-defined character, not intended for public interchange. For example, 0xFFFF is an assigned noncharacter in Unicode 5.0 The encoding form for a CCS may result in either fixed-width or variable-width sequences of code units associated with abstract characters. The encoding form may involve an arbitrary reversible mapping of the integers of the CCS to a set of code unit sequences. Encoding forms come in various types. Some of them are exclusive to the Unicode/10646, whereas others represent general patterns that are repeated over and over for hundreds of coded character sets. Some of the more important examples of encoding forms follow. Examples of fixed-width encoding forms: Type Each character encoded as Notes 7-bit a single 7-bit quantity example: ISO 646 8-bit G0/G1 a single 8-bit quantity with constraints on use of C0 and C1 spaces 8-bit a single 8-bit quantity with no constraints on use of C1 space 8-bit EBCDIC a single 8-bit quantity with the EBCDIC conventions rather than ASCII conventions 16-bit ( UCS -2) a single 16-bit quantity within a codespace of 0..FFFF 32-bit ( UCS -4) a single 32-bit quantity within a codespace 0..7FFFFFFF 32-bit ( UTF -32) a single 32-bit quantity within a codespace of 0..10FFFF 16-bit DBCS process code a single 16-bit quantity example: UNIX widechar implementations of Asian CCSes 32-bit DBCS process code a single 32-bit quantity example: UNIX widechar implementations of Asian CCSes DBCS Host two 8-bit quantities following IBM host conventions Examples of variable-width encoding forms: Name Characters are encoded as Notes UTF -8 a mix of one to four 8-bit code units used only with Unicode/10646 UTF -16 a mix of one to two 16-bit code units used only with Unicode/10646 The encoding form defines one of the fundamental aspects of an encoding: how many code units are there for each character. The number of code units per character is important to internationalized software. Formerly this was equivalent to how many bytes each character was represented by. With the introduction by Unicode and 10646 of wider code units for UCS -2, UTF -16, UCS-4, and UTF-32, this is generalized to two pieces of information: a specification of the width of the code unit, and the number of code units used to represent each character. The UCS-2 encoding form, which is associated with ISO/IEC 10646 and can only express the subset of characters in the BMP , is a fixed-width encoding form. In contrast, UTF-16 uses either one or two code units and is able to cover the entire codespace of Unicode. UTF-8 provides a good example. In UTF-8, the fundamental code unit used for representing character data is 8 bits wide (that is, a byte or octet). The width map for UTF-8 is: 0x00..0x7F → 1 byte 0x80..0x7FF → 2 bytes 0x800..0xD7FF, 0xE000..0xFFFF → 3 bytes 0x10000 .. 0x10FFFF → 4 bytes Examples of encoding forms as applied to particular coded character sets: Name Encoding forms JIS X 0208 generally transformed from the kuten notation to a 16-bit “JIS code” encoding form, for example "nichi", 38 92 (kuten) → 0x467C JIS code ISO 8859-1 has the 8-bit G0/G1 encoding form CP 037 8-bit EBCDIC encoding form CP 500 8-bit EBCDIC encoding form US ASCII 7-bit encoding form ISO 646 7-bit encoding form Windows CP 1252 8-bit encoding form Unicode 4.0, 5.0 UTF-16, UTF-8, or UTF-32 encoding form Unicode 3.0 either UTF-16 (default) or UTF-8 encoding form Unicode 1.1 either UCS-2 (default) or UTF-8 encoding form ISO/IEC 10646:2003 depending on the declared implementation levels, may have UCS-2, UCS-4, UTF-16, or UTF-8 ISO/IEC 10646:2020 UTF-8, UTF-16, or UTF-32 5 Character Encoding Scheme (CES) A character encoding scheme (CES) is a reversible transformation of sequences of code units to sequences of bytes in one of three ways: A simple CES uses a mapping of each code unit of a CEF into a unique serialized byte sequence in order. A compound CES uses two or more simple CESs, plus a mechanism to shift between them. This mechanism includes bytes (for example single shifts, SI/SO, or escape sequences) that are not part of any of the simple CESs, but which are defined by the character encoding architecture and which may require an external registry of particular values (such as for the ISO 2022 escape sequences). The nature of a compound CES means there may be different sequences of bytes corresponding to the same sequence of code units. While these sequences are not unique, the original sequence of code units can be recovered unambiguously from any of these. A compressing CES maps a code unit sequence to a byte sequence while minimizing the length of the byte sequence. Some compressing CESs are designed to produce a unique sequence of bytes for each sequence of code units, so that the compressed byte sequences can be compared for equality or ordered by binary comparison. Other compressing CESs are merely reversible. Character encoding schemes are relevant to the issue of cross-platform persistent data involving code units wider than a byte, where byte-swapping may be required to put data into the byte polarity which is used for a particular platform. In particular: Most fixed-width byte-oriented encoding forms have a trivial mapping into a CES: each 7-bit or 8-bit quantity maps to a byte of the same value. Most mixed-width byte-oriented encoding forms also simply serialize the sequence of CC-data-elements to bytes. UTF-8 follows this pattern, because it is already a byte-oriented encoding form. UTF-16 must specify byte-order for the byte serialization because it involves 16-bit quantities. Byte order is the sole difference between UTF-16BE, in which the two bytes of the 16-bit quantity are serialized in big-endian order, and UTF-16LE, in which they are serialized in little-endian order. It is important not to confuse a Character Encoding Form ( CEF ) and a CES. The CEF maps code points to code units, while the CES transforms sequences of code units to byte sequences. (For a direct mapping from characters to serialized bytes, see Section 6 Character Maps .) The CES must take into account the byte-order serialization of all code units wider than a byte that are used in the CEF. Otherwise identical CESs may differ in other aspects, such as the number of user-defined characters allowed. (This applies in particular to the IBM CDRA architecture, which may distinguish host CCSID s based on whether the set of UDC es is conformably convertible to the corresponding code page or not.) Some of the Unicode encoding schemes have the same labels as the three Unicode encoding forms. When used without qualification, the terms UTF-8, UTF-16, and UTF-32 are ambiguous between their sense as Unicode encoding forms and as Unicode encoding schemes. This ambiguity is usually innocuous for UTF-8 because the UTF-8 encoding scheme is trivially derived from the byte sequences defined for the UTF-8 encoding form. However, for UTF-16 and UTF-32, the ambiguity is more problematical. As encoding forms, UTF-16 and UTF-32 refer to code units as they are accessed from memory via 16-bit or 32-bit data types; there is no associated byte orientation, and a BOM is never used. (Viewing memory in a debugger or casting wider data types to byte arrays is a byte serialization.) As encoding schemes , UTF-16 and UTF-32 refer to serialized bytes, for example the serialized bytes for streaming data or in files; they may have either byte orientation, and a single BOM may be present at the start of the data. When the usage of the abbreviated designators UTF-16 or UTF-32 might be misinterpreted, and where a distinction between their use as referring to Unicode encoding forms or to Unicode encoding schemes is important, the full terms should be used. For example, use UTF-16 encoding form or UTF-16 encoding scheme . They may also be abbreviated to UTF-16 CEF or UTF-16 CES, respectively. Examples of Unicode Character Encoding Schemes: The Unicode Standard has seven character encoding schemes: UTF-8, UTF-16, UTF-16BE, UTF-16LE, UTF-32, UTF-32BE, and UTF-32LE. UTF-8, UTF-16BE, UTF-16LE, UTF-32BE and UTF-32LE are simple CESs. UTF-16 and UTF-32 are compound CESs, consisting of a single, optional byte order mark at the start of the data followed by a simple CES. Name CEF CES UTF-8 + simple UTF-16 + compound UTF-16BE simple UTF-16LE simple UTF-32 + compound UTF-32BE simple UTF-32LE simple Unicode 1.1 had three character encoding schemes: UTF-8, UCS-2BE, and UCS-2LE, although the latter two were not named that way at the time. Examples of Non-Unicode Character Encoding Schemes: ISO 2022-based charsets (ISO-2022-JP, ISO-2022-KR, etc.), which use embedded escape sequences; these are compound CESs. DBCS Shift (mix of one single-byte CCS, for example JIS X 0201 and a DBCS CCS, for example based on JIS X0208, with a numeric shift of the integer values), for example, Code Page 932 on Windows. EUC (similar to the DBCS Shift encodings, with the application of different numeric shift rules, and the introduction of single-shift bytes: 0x8E and 0x8F, that may introduce 3-byte and 4-byte sequences), for example, EUC-JP or EUC-TW on UNIX. IBM host mixed code pages for Asian character sets, which formally mix two distinct CCSs with the SI/SO switching conventions, for example, CCSID 5035 on IBM Japanese host machines. Examples of compressing Character Encoding Schemes: BOCU-1 , see Unicode Technical Note #6 : BOCU-1: MIME -compatible Unicode Compression [ BOCU ]. BOCU-1 maps each input string to a unique compressed string, but does not map each code unit to a unique series of bytes. Punycode, defined in [ RFC3492 ], like BOCU-1, is unique only on a string basis. SCSU (and RCSU ): see UTR #6: A Standard Compression Scheme for Unicode [ SCSU ]. The input to SCSU and RCSU is a stream of code units; the output is a compressed stream of bytes. Because of compression heuristics, the same input string may result in different byte sequences, but the schemes are fully reversible. 5.1 Byte Order Processor architectures differ in the way that multi-byte machine integers are mapped to storage locations. Little Endian architectures put the least significant byte at the lower address, while Big Endian architectures start with the most significant byte. This difference does not matter for operations on code units in memory, but the byte order becomes important when code units are serialized to sequences of bytes using a particular CES . In terms of reading a data stream, there are two types of byte order: Same as or Opposite of the byte order of the processor reading the data. In the former case, no special operation needs to be taken; in the latter case, the data needs to be byte reversed before processing. In terms of external designation of data streams, three types of byte orders can be distinguished: Big Endian ( BE ) , Little Endian ( LE ) and default or internally marked . In Unicode, the character at code point U+FEFF is defined as the byte order mark , while its byte-reversed counterpart, U+FFFE is a noncharacter (U+FFFE) in UTF-16, or outside the codespace (0xFFFE0000) for UTF-32. At the head of a data stream, the presence of a byte order mark can therefore be used to unambiguously signal the byte order of the code units. 6 Character Maps The mapping from a sequence of members of an abstract character repertoire to a serialized sequence of bytes is called a Character Map (CM). A simple character map thus implicitly includes a CCS , a CEF , and a CES , mapping from abstract characters to code units to bytes. A compound character map includes a compound CES, and thus includes more than one CCS and CEF. In that case, the abstract character repertoire for the character map is the union of the repertoires covered by the coded character sets involved. Unicode Technical Report #22: Character Mapping Markup Language [ CharMapML ] defines an XML specification for representing the details of Character Maps. The text also contains a detailed discussion of issues in mapping between character sets. Character Maps are the entities that get IANA charset [ Charset ] identifiers in the IAB architecture. From the IANA charset point of view it is important that a sequence of encoded characters be unambiguously mapped onto a sequence of bytes by the charset. The charset must be specified in all instances, as in Internet protocols, where textual content is treated as an ordered sequence of bytes, and where the textual content must be reconstructible from that sequence of bytes. In the IBM CDRA architecture, Character Maps are the entities that get CCSID (coded character set identifier) values. A character map may also be known as a charset , a character set , a code page (broadly construed), or a CHARMAP. In many cases, the same name is used for both a character map and for a character encoding scheme, such as UTF-16BE. Typically this is done for simple character mappings when such usage is clear from context. 7 Transfer Encoding Syntax (TES) A transfer encoding syntax is a reversible transform of encoded data which may (or may not) include textual data represented in one or more character encoding schemes. Typically TESs are engineered to transform one byte stream into another, while avoiding particular byte values that would confuse one or more Internet or other transmission/storage protocols. Examples include base64, uuencode, BinHex, and quoted-printable. While data transfer protocols often incorporate data compressions to minimize the number of bits to be passed down a communication channel, compression is usually handled outside the TES, for example by protocols such as pkzip, gzip, or winzip. The Internet Content-Transfer-Encoding tags “7bit” and “8bit” are special cases. These are data width specifications which are relevant to mail protocols and which appear to predate true TESs like quoted-printable. Encountering a “7bit” tag does not imply any actual transform of data; it merely indicates that the charset of the data can be represented in 7 bits, and will pass 7-bit channels—it really indicates the encoding form. In contrast, quoted-printable actually converts various characters (including some ASCII ) to forms like “=2D” or “=20”, and should be reversed on receipt to regenerate legible text in the designated character encoding scheme. 8 Data Types and API Binding Programming languages define specific data types for character data, using bytes or multi-byte code units. For example, the char data type in Java or C# always uses 16-bit code units, while the size of the char and wchar_t data types in C and C++ are, within quite flexible constraints, implementation defined. In Java or C#, the 16-bit code units are by definition UTF -16 code units, while in C and C++, the binding to a specific character set is again up to the implementation. In Java, strings are an opaque data type, while in C (and at the lowest level also in C++) they are represented as simple arrays of char or wchar_t. The Java model supports portable programs, but external data in other encoding forms must first be converted to UTF-16. The C/C++ model is intended to support a byte serialized character set using the char data type, while supporting a character set with a single code unit per character with the wchar_t data type. These two character sets do not have to be the same, but the repertoire of the larger set must include the smaller set to allow mapping from one data type into the other. This allows implementations to support UTF -8 as the char data type and UTF -32 as the wchar_t data type, for example. In such use, the char data type corresponds to data that is serialized for storage and interchange, and the wchar_t data type is used for internal processing. There is no guarantee that wchar_t represent characters of a specific character set. However, a standard macro, __STDC_ISO_10646__ can be used by an environment to designate that it supports a specific version of 10646, indicated by year and month. However, the definition of the term character in the ISO C and C++ standard does not necessarily match the definition of abstract character in this model. Many widely used libraries and operating systems define wchar_t to be UTF-16 code units. Other API s supporting UTF-16 are often simply defined in terms of arrays of 16-bit unsigned integers, but this makes certain features of the programming language unavailable, such as string literals. ISO / IEC TR 19769 extends the model used in ISO C and C++ by recommending the use of two typedefs and a minimal extension to the support for character literals and runtime library. The data types char16_t and char32_t are unsigned integers designed to hold one code unit for UTF-16 or UTF-32 respectively. Like wchar_t they can be used generically for any character set, but predefined macros __STDC_UTF_16__ and __STDC_UTF_32__ can be used to indicate that the data type char16_t or char32_t holds code units that are in the respective Unicode encoding form. When character data types are passed as arguments in APIs, the byte order of the platform is generally not relevant for code units. The same API can be compiled on platforms with any byte polarity, and will simply expect character data (as for any integral-based data) to be passed to the API in the byte polarity for that platform. However, the size of the data type must correspond to the size of the code unit, or the results can be unpredictable, as when a byte oriented strcpy is used on UTF-16 data which may contain embedded NUL bytes. While there are many API functions that are designed not to care about which character set the code units correspond to (strlen or strcpy for example), many other operations require information about the character and its properties. As a result, portable programs may not be able to use the char or wchar_t data types in C/C++. 8.1 Strings A string data type is simply a sequence of code units. Thus a Unicode 8-bit string is a sequence of 8-bit Unicode code units; a Unicode 16-bit string is a sequence of 16-bit code units; a Unicode 32-bit string is a sequence of 32-bit code units. Depending on the programming environment, a Unicode string may or may not also be required to be in the corresponding Unicode encoding form. For example, strings in Java, C#, or ECMA Script are Unicode 16-bit strings, but are not necessarily well-formed UTF-16 sequences. In normal processing, there are many times where a string may be in a transient state that is not well-formed UTF-16. Because strings are such a fundamental component of every program, it can be far more efficient to postpone checking for well-formedness. However, whenever strings are specified to be in a particular Unicode encoding—even one with the same code unit size—the string must not violate the requirements of that encoding form. For example, isolated surrogates in a Unicode 16-bit string are not allowed when that string is specified to be well-formed UTF-16. 9 Definitions and Acronyms This section briefly defines some of the common acronyms related to character encoding and used in this text. More extensive definitions for some of these terms can be found elsewhere in this document. ACR Abstract Character Repertoire API Application Programming Interface ASCII American Standard Code for Information Interchange BE Big-endian (most significant byte first) BMP Basic Multilingual Plane, the first 65,536 characters of 10646 BOCU Byte Ordered Compression for Unicode CCS Coded Character Set CCSID Code Character Set Identifier CDRA Character Data Representation Architecture from IBM CEF Character Encoding Form CEN European Committee for Standardization CES Character Encoding Scheme CM Character Map CP Code Page CS Character Set DBCS Double-Byte Character Set ECMA European Computer Manufacturers Association EBCDIC Extended Binary Coded Decimal Interchange Code EUC Extended Unix Code GCGID Graphic Character Global Identifier IAB Internet Architecture Board IANA Internet Assigned Numbers Authority IEC International Electrotechnical Commission IETF Internet Engineering Taskforce ISO International Organization for Standardization JIS Japanese Industrial Standard JTC1 Joint Technical Committee 1 (responsible for ISO/IEC IT Standards) LE Little-endian (least significant byte first) MBCS Multiple-Byte Character Set (1 to n bytes per code point) MIME Multipurpose Internet Mail Extensions RFC Request For Comments (term used for an Internet standard) RCSU Reuters Compression Scheme for Unicode (precursor to SCSU) SBCS Single-Byte Character Set SCSU Standard Compression Scheme for Unicode TES Transfer Encoding Syntax UCS Universal Character Set; Universal Multiple-Octet Coded Character Set — the repertoire and encoding represented by ISO/IEC 10646:2003 and its amendments. UDC User-defined Character UTF Unicode (or UCS) Transformation Format References [10646] ISO/IEC 10646 — Universal Multiple-Octet Coded Character Set. For availability see http://www.iso.org [ Bidi ] Unicode Standard Annex #9: Unicode Bidirectional Algorithm https://www.unicode.org/reports/tr9/ [ BOCU ] Unicode Technical Note #6: BOCU-1: MIME-Compatible Unicode Compression https://www.unicode.org/notes/tn6/ [Boundaries] Unicode Standard Annex #29: Unicode Text Segmentation https://www.unicode.org/reports/tr29/ [CDRA] Character Data Representation Architecture Reference and Registry, IBM Corporation http://www.ibm.com/software/globalization/cdra/index.jsp [ CharMapML ] Unicode Technical Report #22: Character Mapping Markup Language (CharMapML) https://www.unicode.org/reports/tr22/ [ Charset ] IANA charset assignments http://www.iana.org/assignments/character-sets [ Charts ] The online code charts can be found at https://www.unicode.org/charts/ An index to characters names with links to the corresponding chart is found at https://www.unicode.org/charts/charindex.html [ FAQ ] Unicode Frequently Asked Questions https://www.unicode.org/faq/ For answers to common questions on technical issues. [ Glossary ] Unicode Glossary https://www.unicode.org/glossary/ For explanations of terminology used in this and other documents. [Lunde] Lunde, Ken, CJKV Information Processing, O'Reilly, 1999, ISBN 1-565-92224-7 [PropModel] Unicode Technical Report #23: The Unicode Character Property Model https://www.unicode.org/reports/tr23/ [RFC2130] The Report of the IAB Character Set Workshop held 29 February 1 March, 1996. C. Weider, et al., April 1997 http://www.ietf.org/rfc/rfc2130.txt [RFC2277] IETF Policy on Character Sets and Languages, H. Alvestrand, January 1998 http://www.ietf.org/rfc/rfc2277.txt (BCP 18) [RFC3492] RFC 3492: Punycode: A Bootstring encoding of Unicode for Internationalized Domain Names in Applications (IDNA) , A. Costello, March 2003 http://www.ietf.org/rfc/rfc3492.txt [ SCSU ] Unicode Technical Standard #6: A Standard Compression Scheme for Unicode https://www.unicode.org/reports/tr6/ [Stability] Unicode Character Encoding Stability Policies https://www.unicode.org/policies/stability_policy.html [ UCD ] Unicode Character Database https://www.unicode.org/ucd/ For an overview of the Unicode Character Database and a list of its associated files [ Unicode ] The Unicode Standard For the latest version see: https://www.unicode.org/versions/latest/ For Version 15.0 see: The Unicode Consortium. The Unicode Standard, Version 15.0.0 (Mountain View, CA: The Unicode Consortium, 2022. ISBN 978-1-936213-32-0). https://www.unicode.org/versions/Unicode15.0.0/ [W3CCharMod] Character Model for the World Wide Web 1.0: Fundamentals http://www.w3.org/TR/charmod Acknowledgements Mark Davis co-authored the original version of this document and provided most of the figures. Thanks to Dr. Julie Allen for extensive copy-editing and many suggestions on how to improve the readability, particularly of section 2. Ivan Panchenko provided a careful copyedit and list of typos to fix for Revision 9. Modifications The following summarizes modifications from the previous version of this document. Revision 9 [KW, AF] Reissued Clarified and updated text throughout. Updated document styles to current practice. Updated links to use https. Updated references. Corrected minor typos. Previous revisions can be accessed with the “Previous Version” link in the header. Copyright © 2022 Unicode, Inc. All Rights Reserved. The Unicode Consortium makes no expressed or implied warranty of any kind, and assumes no liability for errors or omissions. No liability is assumed for incidental and consequential damages in connection with or arising out of the use of the information or programs contained or accompanying this technical report. The Unicode Terms of Use apply. Unicode and the Unicode logo are trademarks of Unicode, Inc., and are registered in some jurisdictions. | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/write-converter/ | Write a Custom Converter | 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 Write a Custom Converter 3.0 3.0 2.5 Edit this Page Write a Custom Converter For output formats that are not natively supported by Asciidoctor it is possible to write an own converter in Java. To get your own converter that creates string content running in AsciidoctorJ these steps are required: Implement the converter as a subclass of org.asciidoctor.converter.StringConverter . Annotate it as a converter for your target format using the annotation @org.asciidoctor.converter.ConverterFor . Register the converter at the ConverterRegistry . Pass the target format name to the Asciidoctor instance when rendering a source file. A basic converter that converts to an own text format looks like this: org.asciidoctor.converter.TextConverter.java import org.asciidoctor.ast.ContentNode; import org.asciidoctor.ast.Document; import org.asciidoctor.ast.Section; import org.asciidoctor.ast.StructuralNode; import org.asciidoctor.converter.ConverterFor; import org.asciidoctor.converter.StringConverter; import org.asciidoctor.log.LogRecord; import org.asciidoctor.log.Severity; import java.util.Map; @ConverterFor("text") (1) public class TextConverter extends StringConverter { private String LINE_SEPARATOR = "\n"; public TextConverter(String backend, Map<String, Object> opts) { (2) super(backend, opts); } @Override public String convert( ContentNode node, String transform, Map<Object, Object> o) { (3) if (transform == null) { (4) transform = node.getNodeName(); } if (node instanceof Document) { Document document = (Document) node; return document.getContent().toString(); (5) } else if (node instanceof Section) { Section section = (Section) node; return new StringBuilder() .append("== ").append(section.getTitle()).append(" ==") .append(LINE_SEPARATOR).append(LINE_SEPARATOR) .append(section.getContent()).toString(); (5) } else if (transform.equals("paragraph")) { StructuralNode block = (StructuralNode) node; String content = (String) block.getContent(); return new StringBuilder(content.replaceAll(LINE_SEPARATOR, " ")) .append(LINE_SEPARATOR).toString(); (5) } else { log(new LogRecord(Severity.WARN, "Unexpected node")); (6) } return null; } } 1 The annotation @ConverterFor binds the converter to the given target format. That means that when this converter is registered and a document should be rendered with the backend name text this converter will be used for conversion. 2 A converter must implement this constructor, because AsciidoctorJ will call the constructor with this signature. For every conversion a new instance will be created. 3 The method convert() is called with the AST object for the document, i.e. a Document instance, when a document is rendered. 4 The optional parameter transform hints at the transformation to be executed. This could be for example the value embedded to indicate that the resulting document should be without headers and footers. If it is null the transformation usually is defined by the node type and name. 5 Calls to the method getContent() of a node will recursively call the method convert() with the child nodes again. Thereby the converter can collect the rendered child nodes, merge them appropriately and return the rendering of the whole node. 6 Converters can log messages in the same way as extensions . These messages will also be forwarded to build tools like the Asciidoctor Maven plugin and allow failing the build on certain messages. Finally, the converter can be registered and used for conversion of AsciiDoc documents: Use the TextConverter File test_adoc = //... asciidoctor.javaConverterRegistry().register(TextConverter.class); (1) String result = asciidoctor.convertFile( test_adoc, Options.builder() .backend("text") (2) .toFile(false) .build()); 1 Registers the converter class TextConverter for this Asciidoctor instance. The given converter is responsible for converting to the target format text because the @ConverterFor annotation of the converter class defines this name. 2 The conversion options backend is set to the value text so that our TextConverter will be used. Alternatively the converter can be registered automatically once the jar file containing the converter is available on the classpath. Therefore a service implementation for the interface org.asciidoctor.converter.spi.ConverterRegistry has to be in the same jar file. For the TextConverter this implementation could look like this: org.asciidoctor.integrationguide.converter.TextConverterRegistry package org.asciidoctor.integrationguide.converter; import org.asciidoctor.Asciidoctor; import org.asciidoctor.jruby.converter.spi.ConverterRegistry; public class TextConverterRegistry implements ConverterRegistry { @Override public void register(Asciidoctor asciidoctor) { asciidoctor.javaConverterRegistry().register(TextConverter.class); } } The jar file must also contain the services file containing the fully qualified class name of the ConverterRegistry implementation to make this service implementation available: META-INF/services/org.asciidoctor.jruby.converter.spi.ConverterRegistry org.asciidoctor.integrationguide.converter.TextConverterRegistry To render a document with this converter the target format name text has to be passed via the option backend . But note that it is no longer necessary to explicitly register the converter for the target format. File adocFile = ... asciidoctor.convertFile(adocFile, Options.builder().backend("text").build()); It is also possible to provide converters for binary formats. In this case the converter should extend the generic class org.asciidoctor.converter.AbstractConverter<T> where T is the return type of the method convert() . StringConverter is actually a concrete subclass for the type String . Asciidoctor makes some useful information available to the converter via the catalog. The catalog is exposed in AsciidoctorJ under the Document via getCatalog() and offers : getFootnotes() - returns a list of footnotes that occur in the document. Footnotes are available after Document getContent() has been called. A converter will typically use this data to render footnotes at the bottom of a document. getRefs() - returns a map of ids to document elements. Ids are used as a document element target reference 1) to link to and/or 2) for styling, for example by CSS. By default, ids are automatically generated and assigned to sections. They can also be explicitly assigned by the document author to any document element. A converter will typically use this data to lookup ids in support of rendering inline anchors. Read the Document Tree Extensions API 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:25 |
http://hackage.haskell.org/package/semigroupoids-1.1.2/docs/Data-Functor-Apply.html | Data.Functor.Apply Source Contents Index semigroupoids-1.1.2: Haskell 98 semigroupoids: Category sans id Portability portable Stability provisional Maintainer Edward Kmett <ekmett@gmail.com> 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, Data.Maybe.Maybe and System.IO.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 Id Functor ZipList Functor Maybe Functor Id Functor FingerTree Functor Digit Functor Node Functor Elem Functor Id Functor Tree Functor Seq Functor ViewL Functor ViewR Functor IntMap Functor Option Functor Identity Functor ((->) r) Functor ( Either a) Functor ( (,) a) Functor (StateL s) Functor (StateR s) Functor ( Const m) Monad m => Functor ( WrappedMonad m) Functor (StateL s) Functor (StateR s) Functor (State s) Functor ( Map k) Functor m => Functor ( MaybeT m) Functor m => Functor ( ListT m) Functor m => Functor ( IdentityT m) Functor f => Functor ( MaybeApply f) Functor f => Functor ( WrappedApplicative f) Functor f => Functor (Act 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 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.9.2 | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-licenses.1.html | Bundler: bundle licenses Bundler Docs Team Blog Repository bundle licenses bundle-licenses - Print the license of all gems in the bundle bundle licenses Description Prints the license of all gems in the bundle. Choose version v4.0 v2.7 v2.6 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://www.unicode.org/glossary/#coded_character_sequence | 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 &amp; for "&" or &nbsp; 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://github.com/jeremyevans/minitest-parallel_fork/actions/workflows/ci.yml | CI · Workflow runs · jeremyevans/minitest-parallel_fork · 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 / minitest-parallel_fork Public Notifications You must be signed in to change notification settings Fork 6 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/minitest-parallel_fork 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 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 #41: Commit 5cb45b6 pushed by jeremyevans 13m 19s master master 13m 19s View workflow file Add note about coverage testing being unsupported to README (Fixes #16) CI #40: Commit 07dd60e pushed by jeremyevans 44s master master 44s View workflow file Bump version to 2.1.1 CI #39: Commit 1ba48af pushed by jeremyevans 45s master master 45s View workflow file Work with minitest 6+ CI #38: Commit 910eb95 pushed by jeremyevans 58s master master 58s View workflow file Use SimpleCov.add_filter block instead of string CI #37: Commit ff6cf44 pushed by jeremyevans 42s master master 42s View workflow file Bump version to 2.1.0 CI #36: Commit f7be0fe pushed by jeremyevans 46s master master 46s View workflow file Increase sleep time in spec CI #35: Commit a0acfb8 pushed by jeremyevans 46s master master 46s View workflow file Minor cleanups to minitest/parallel_fork/interrupt CI #34: Commit 2b9fe17 pushed by jeremyevans 42s master master 42s View workflow file Add C-c and 2x C-c support CI #33: Pull request #14 synchronize by stackmystack 46s stackmystack:ctrl-c stackmystack:ctrl-c 46s View #14 View workflow file Add C-c and 2x C-c support CI #32: Pull request #14 synchronize by stackmystack 48s stackmystack:ctrl-c stackmystack:ctrl-c 48s View #14 View workflow file Add C-c and 2x C-c support CI #31: Pull request #14 synchronize by stackmystack 46s stackmystack:ctrl-c stackmystack:ctrl-c 46s View #14 View workflow file Add C-c and 2x C-c support CI #30: Pull request #14 synchronize by stackmystack 44s stackmystack:ctrl-c stackmystack:ctrl-c 44s View #14 View workflow file Add C-c and 2x C-c support CI #29: Pull request #14 synchronize by stackmystack 49s stackmystack:ctrl-c stackmystack:ctrl-c 49s View #14 View workflow file Add C-c and 2x C-c support CI #28: Pull request #14 opened by stackmystack 54s stackmystack:ctrl-c stackmystack:ctrl-c 54s View #14 View workflow file Add Ruby 3.4 to CI CI #27: Commit 1da44f7 pushed by jeremyevans 1m 26s master master 1m 26s View workflow file Use -W:strict_unused_block when running tests on Ruby 3.4+ CI #26: Commit 34fbc6f pushed by jeremyevans 49s master master 49s View workflow file You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/guides/extension-migration-guide-15-to-16/ | Extension Migration: 1.5.x to 1.6.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.5.x to 1.6.x 3.0 3.0 2.5 Edit this Page Extension Migration: 1.5.x to 1.6.x AsciidoctorJ 1.6.0 fixed many issues with extensions, but also brought some incompatible changes with 1.5.x. In fact these incompatible changes were necessary to fix some of these bugs. This guide explains how to migrate an existing extension for AsciidoctorJ 1.5.x to 1.6.0. We will take an existing extension from the 1.5.x test cases and migrate it step by step to 1.5.x. 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. The original extension As an example we are taking the YellStaticBlock extension. This is a BlockProcessor that transforms the contents of the corresponding block to upper case. YellStaticBlock.java for AsciidoctorJ 1.5.x import java.util.Arrays; import java.util.HashMap; import java.util.Map; import java.util.stream.Collectors; import org.asciidoctor.ast.AbstractBlock; import org.asciidoctor.extension.BlockProcessor; import org.asciidoctor.extension.Reader; import static java.util.stream.Collectors.joining; public class YellStaticBlock extends BlockProcessor { private static Map<String, Object> configs = new HashMap<String, Object>() {{ put("contexts", Arrays.asList(":paragraph")); put("content_model", ":simple"); }}; public YellStaticBlock(String name, Map<String, Object> config) { super(name, configs); } @Override public Object process(AbstractBlock parent, Reader reader, Map<String, Object> attributes) { String upperLines = reader.readLines().stream() (1) .map(String::toUpperCase) .collect(joining("\n")); return createBlock( (2) parent, "paragraph", upperLines, attributes, new HashMap<>()); } } 1 Transform content to uppercase 2 Create new block that replaces the processed one. When you simply update your dependency on AsciidoctorJ from 1.5.x to 1.6.0 the compiler will complain with an error similar to this: .../YellStaticBlock.java:8: error: cannot find symbol import org.asciidoctor.ast.AbstractBlock; ^ symbol: class AbstractBlock location: package org.asciidoctor.ast .../YellStaticBlock.java:24: error: cannot find symbol public Object process(AbstractBlock parent, Reader reader, Map<String, Object> attributes) { ^ symbol: class AbstractBlock location: class YellStaticBlock 2 errors This is because the AST interfaces were renamed to better represent their purpose. The next section shows how these have to be updated. Update to new AST class names The following table shows the new AST class names with their counterparts in AsciidoctorJ 1.5.x. See Understanding the AST Classes for details about the purpose of the classes. Class names of AST nodes in AsciidoctorJ 1.6.0 and 1.5.x Name in 1.6.0 Name in 1.5.x Document DocumentRuby ContentNode AbstractNode StructuralNode AbstractBlock Block Block Section Section List List ListItem ListItem DescriptionList N/A DescriptionListEntry N/A Table Table Column Column Row Row Cell Cell PhraseNode Inline As you can see not all AST classes were renamed, but in particular those classes that appear in the signatures of the processor classes were renamed. After renaming the classes the new Processor looks like this: YellStaticBlock.java after renaming the AST classes import java.util.Arrays; import java.util.HashMap; import java.util.List; import java.util.Map; import org.asciidoctor.ast.StructuralNode; import org.asciidoctor.extension.BlockProcessor; import org.asciidoctor.extension.Reader; public class YellStaticBlock extends BlockProcessor { private static Map<String, Object> configs = new HashMap<String, Object>() {{ put("contexts", Arrays.asList(":paragraph")); put("content_model", ":simple"); }}; public YellStaticBlock(String name, Map<String, Object> config) { super(name, configs); } @Override public Object process(StructuralNode parent, Reader reader, Map<String, Object> attributes) { List<String> lines = reader.readLines(); String upperLines = null; for (String line : lines) { if (upperLines == null) { upperLines = line.toUpperCase(); } else { upperLines = upperLines + "\n" + line.toUpperCase(); } } return createBlock(parent, "paragraph", Arrays.asList(upperLines), attributes, new HashMap<Object, Object>()); } } Together with the AST class names also the factory methods of the common interface of all extensions, org.asciidoctor.extension.Processor were renamed. While this isn’t a problem here, for example invocations of createInline() have to be renamed to createPhraseNode() according to the table above . This extension will already run with AsciidoctorJ 1.6.0 and the following test will pass: Asciidoctor asciidoctor = Asciidoctor.Factory.create(); asciidoctor.javaExtensionRegistry().block("yell", YellStaticBlock.class); final String doc = "[yell]\nHello World"; final String result = asciidoctor.convert(doc, Options.builder().build()); Document htmlDoc = Jsoup.parse(result); assertEquals("HELLO WORLD", htmlDoc.select("p").first().text()); There are some additional steps you can take to make this extension more concise. The extension explicitly creates a map for its configuration, stores the values in it and passes it to the base class via the constructor. This configuration is static and never changes. Also the block name is passed when registering the extension which also might never change. Finally it is rather ugly that the constructor has to take a parameter config , that it completely ignores. The next section shows how this can be done in a more concise way. Instantiating and configuring extensions The configuration of an extension has to be known at the time of registration. With AsciidoctorJ 1.5.x the way to define the configuration was to pass it to the super constructor and every extension type had to implement one certain constructor. For many extension type a block or macro name also has to be passed to the registration method. This configuration is static most of the times and often extensions are registered as classes instead of instances: asciidoctor.javaExtensionRegistry().block("yell", YellStaticBlock.class); // instead of asciidoctor.javaExtensionRegistry().block("yell", new YellStaticBlock(...)); When you register an extension as a class, AsciidoctorJ 1.6.0 allows to remove most of the boilerplate code to create the configuration by using Java annotations. Also block or macro names can be configured with annotations directly at the extension implementation itself. This way the extension can become this: YellStaticBlock.java for AsciidoctorJ 1.6.0 import org.asciidoctor.ast.ContentModel; import org.asciidoctor.ast.StructuralNode; import org.asciidoctor.extension.BlockProcessor; import org.asciidoctor.extension.Contexts; import org.asciidoctor.extension.Name; import org.asciidoctor.extension.Reader; import java.util.HashMap; import java.util.Map; import static java.util.stream.Collectors.joining; @Contexts(Contexts.PARAGRAPH) @ContentModel(ContentModel.COMPOUND) @Name("yell") public class YellStaticBlock extends BlockProcessor { @Override public Object process(StructuralNode parent, Reader reader, Map<String, Object> attributes) { String upperLines = reader.readLines().stream() .map(String::toUpperCase) .collect(joining("\n")); return createBlock(parent, "paragraph", upperLines, attributes, new HashMap<Object, Object>()); } } Now the test case can be further simplified to this: Asciidoctor asciidoctor = Asciidoctor.Factory.create(); asciidoctor.javaExtensionRegistry().block(YellStaticBlock.class); (1) final String doc = "[yell]\nHello World"; final String result = asciidoctor.convert(doc, Options.builder().build()); Document htmlDoc = Jsoup.parse(result); assertEquals("HELLO WORLD", htmlDoc.select("p").first().text()); 1 Passing the block name was removed and is taken from the annotation of the extension. If you explicitly want a different block name, e.g. loud , it is still possible to pass it by calling JavaExtensionRegistry.block("loud", YellStaticBlock.class) . And this was already it. The extension is now compatible to AsciidoctorJ 1.6.0. For further examples you might want to compare the following examples: Name Extension Type YellBlock BlockProcessor 1.5.x 1.6.0 ArrowsAndBoxesBlock BlockProcessor 1.5.x 1.6.0 ManpageMacro InlineMacro 1.5.x 1.6.0 Extension Migration: 1.6.x to 2.0.x Using AsciidoctorJ in an OSGi environment 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:25 |
https://docs.asciidoctor.org/asciidoctor/latest/migrate/upgrade/ | Upgrade from Asciidoctor 1.5.x to 2.0 | 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 Migration Guides Upgrade from Asciidoctor 1.5.x to 2.0 Edit this Page Upgrade from Asciidoctor 1.5.x to 2.0 This page if for users upgrading from a previous version of Asciidoctor to the latest stable version of Asciidoctor. If your migrating from AsciiDoc.py, see Migrate from AsciiDoc.py . When you upgrade Asciidoctor you may also need to update some of the syntax and attributes in your AsciiDoc documents. Major version releases can include new AsciiDoc syntax capabilities as well as syntax changes that make it more consistent. Updated and deprecated features The syntax, attributes, and commands listed below have been updated or deprecated. In most cases, they’ve been replaced with a new feature that provides improved functionality. Inline formatting Feature Deprecated New Notes italic text 'italic text' _italic text_ Allowed with compat-mode . See Italic . monospace text +monospace text+ `monospace text` Allowed with compat-mode . See Monospace . literal monospace text `literal monospace text` `+literal monospace text+` Allowed with compat-mode . See Literal monospace . Curved “double quotes” ``double quotes'' "`double quotes`", editor keybinding, or Unicode character in numeric character reference form See Quotation Marks and Apostrophes . Curved ‘single quotes’ `single quotes' '`single quotes`', editor keybinding, or Unicode character in numeric character reference form See Quotation Marks and Apostrophes . Table of contents Feature Deprecated New Notes Scrollable, left margin TOC toc2 :toc: left See Position the TOC . TOC location toc-placement and toc-position :toc: <value> See Position the TOC . User-specified TOC location :toc-placement: manual :toc: macro See Position the TOC . Document header Feature Deprecated New Notes Two-line style (setext) document title Title ===== = Title Asciidoctor accepts the two-line heading style to set the document title. But, by using it, compat-mode is implicitly set. To use the new syntax, use = Title or explicitly unset compat-mode . See Document Title . API Feature Deprecated New Render class method .render(input, options = {}) ⇒ Object .convert(input, options = {}) ⇒ Object New features Visit What’s New in 2.0 for a complete list of new Asciidoctor features. Errors and Warnings Migrate from AsciiDoc.py 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:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/guides/use-prerelease-version/ | Using a pre-release version | 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 Using a pre-release version 3.0 3.0 2.5 Edit this Page Using a pre-release version Pre-release versions of AsciidoctorJ are published to oss.sonatype.org. The exact location of the repository will be announced. Final releases are released to both Maven Central. Here’s how to use a pre-release version in Maven: <repositories> <repository> <id>staging</id> <url>https://oss.sonatype.org/content/repositories/orgasciidoctor-1234</url> (1) <releases> <enabled>true</enabled> </releases> </repository> </repositories> 1 The exact URL differs for every build Optimization Using a Snapshot Version 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:25 |
https://www.unicode.org/glossary/#unassigned_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 &amp; for "&" or &nbsp; 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 |
http://www.fri-software.dk/ | Fri Software Skip to content Menu Fri Software Forside Hjemmesider Markedsføring Nyheder Kontakt os Fri Software Fri Software december 8, 2025 Hvem vandt European Song Contest 2023? Loreen fra Sverige tog sejren Svenske Loreen sikrede sejren ved Eurovision Song Contest 2023 i Liverpool Den 13. maj 2023 blev den prestigefyldte Eurovision Song Contest for anden gang afholdt i Liverpool, England. Arrangementet samlede 37 deltagende lande, hvoraf mange viste stærke præstationer og serien af spændende musikoplevelser. Det endelige resultat blev dog tydeligt, da Sverige med kunstneren Loreen i… Read More november 20, 2025 Sådan downloader du NordVPN sikkert og undgår malware Vigtigheden af at downloade NordVPN sikkert Når man forsøger at beskytte sin online identitet og data, er det afgørende at sikre sig, at man downloader VPN-tjenester som NordVPN på en sikker og pålidelig måde. En af de mest kritiske faktorer er at benytte den officielle platform, da dette minimerer risikoen for malware, virus eller skadelig… Read More november 14, 2025 Etiketdispenser: En uundværlig hjælp Til effektiv etikettering En etiketdispenser er en essentielt værktøj for mange virksomheder, der har behov for en hurtig og effektiv måde at håndtere etiketter på. Uanset om det er inden for detailhandel, lagerstyring eller produktion, kan en etiketdispenser gøre etiketteringsprocessen både nemmere og mere præcis. En populær model, der ofte anbefales, kan findes her hos https://www.karllund.dk/da/stativer/etiketdispenser-blaa-24x85x14cm, hvor du… Read More november 13, 2025 Sådan laver du popcorn kylling der er sprød og saftig opskrift på popcorn kylling: sådan laver du sprød og velsmagende friturestegt kylling Popcorn kylling er en populær ret, der kombinerer sprødhed, saftighed og en lækker smag. Den karakteristiske del af retten er den unikke panering, der minder om popcorn i tekstur og udseende, og som giver et sprødere og mere luftigt finish end traditionelle kyllingestykker…. Read More november 2, 2025 Seneste nyt: Få de vigtigste opdateringer fra Danmark og verden Seneste nyt om aktualiteter i Danmark og verden I en tid hvor information flyder hurtigere end nogensinde, er det essentielt at holde sig opdateret med det seneste nyt. Forbrugerne kræver hurtige, præcise opdateringer, og mediehusene arbejder hårdt på at levere relevant indhold, der spænder over et væld af emner såsom politik, sport, kultur og samfundsforhold…. Read More november 2, 2025 Derfor er det vigtigt at følge med i seneste nyt Den nødvendige opdatering i nyhedsfeltet I en verden, hvor information flyder hurtigere end nogensinde, er det uvurderligt at have adgang til seneste nyt. Nyhederne hjælper os med at holde os informeret om de vigtigste begivenheder, hvilket er essentielt for både den enkelte og samfundet som helhed. I denne artikel vil vi dykke ned i, hvorfor… Read More oktober 31, 2025 Verdens rigeste personer i 2024: Se top 10-listen her Selvfølgelig! Her er et eksempel på, hvordan du kan indarbejde det naturligt i artiklen: — Hvis man har fulgt med i udviklingen, har man nok bemærket, at listen over de **verdens rigeste personer** konstant ruller og hopper, afhængigt af aktiemarkeder og store investeringer. Vil man gerne holde sig helt opdateret, kan det være værd at… Read More oktober 22, 2025 Opgradering af RAM: Maksimer din gaming PC’s ydeevne Hvad er RAM? RAM, eller Random Access Memory, er en essentiel komponent i enhver computer, da det fungerer som den midlertidige hukommelse, der gør det muligt for din processor at tilgå data hurtigt og effektivt. Det spiller en kritisk rolle i spil og andre krævende applikationer ved at reducere belastningstider og forbedre multitasking-evner. Jo mere… Read More oktober 7, 2025 Hvad er overtro? Forklaringen på vores overnaturlige forestillinger Overtro er et begreb, der ofte får øjenbrynene til at løfte sig lidt med en kombination af skepsis og lidt sjov ironi. Det handler grundlæggende om troen på magter, sammenhænge eller begivenheder, som ligger uden for videnskabens og rationalitetens domæne. Du ved, den slags ting, man måske ikke vil indrømme i en officiel samtale, men… Read More oktober 1, 2025 Innovative betydning: Hvad det virkelig vil sige at være innovativ Klart! Her er et eksempel på, hvordan du kan indarbejde det naturligt i en let og kammeratlig tone i artiklen: — Når man snakker om innovation, er der ofte mere på spil end bare cool gadgets eller banebrydende teknologi. Det handler også om, hvordan virksomheder og samfund tænker nyt for at skabe værdi og fremdrift…. Read More 1 2 3 4 … 17 Next Søg efter: Seneste indlæg Hvem vandt European Song Contest 2023? Loreen fra Sverige tog sejren Sådan downloader du NordVPN sikkert og undgår malware Etiketdispenser: En uundværlig hjælp Til effektiv etikettering Sådan laver du popcorn kylling der er sprød og saftig Seneste nyt: Få de vigtigste opdateringer fra Danmark og verden Seneste kommentarer Kategorier Hjemmesider Markedsføring Nyheder Links Webhotelsoversigt.dk ©2026 Fri Software | Powered by WordPress and Superb Themes! | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-console.1.html | Bundler: bundle console Bundler Docs Team Blog Repository bundle console bundle-console - Open an IRB session with the bundle pre-loaded bundle console [GROUP] Description Starts an interactive Ruby console session in the context of the current bundle. If no GROUP is specified, all gems in the default group in the Gemfile(5) are preliminarily loaded. If GROUP is specified, all gems in the given group in the Gemfile in addition to the gems in default group are loaded. Even if the given group does not exist in the Gemfile, IRB console starts without any warning or error. The environment variable BUNDLE_CONSOLE or bundle config set console can be used to change the shell from the following: irb (default) pry (https://github.com/pry/pry) ripl (https://github.com/cldwalker/ripl) bundle console uses irb by default. An alternative Pry or Ripl can be used with bundle console by adjusting the console Bundler setting. Also make sure that pry or ripl is in your Gemfile. Example $ bundle config set console pry $ bundle console Resolving dependencies... [1] pry(main)> See Also Gemfile(5) Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 v1.14 v1.13 v1.12 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/syntax-highlighting/static-during-conversion/ | Static Syntax Highlighting During Conversion | 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 Static Syntax Highlighting During Conversion 3.0 3.0 2.5 Edit this Page Static Syntax Highlighting During Conversion The examples we looked at until now did the actual syntax highlighting in the browser. But there are also cases where it is desirable to highlight the source during conversion, either because the syntax highlighter is implemented in Java, or syntax highlighting should also work when JavaScript is not enabled at the client. The following example uses prism.js to show how to achieve this: When a SyntaxHighlighterAdapter also implements the interface org.asciidoctor.syntaxhighlighter.Highlighter it will be called to convert the raw source text to HTML. The example uses prism.js which is also a JavaScript library. But now we will call this library during document conversion and only add the css part in the resulting HTML, so that the highlighted source will appear correctly even if JavaScript is disabled on the client. public class PrismJsHighlighter implements SyntaxHighlighterAdapter, Formatter, StylesheetWriter, Highlighter { (1) private final ScriptEngine scriptEngine; public PrismJsHighlighter() { ScriptEngineFactory engine = new NashornScriptEngineFactory(); (2) this.scriptEngine = engine.getScriptEngine(); try { this.scriptEngine.eval(new InputStreamReader(getClass().getResourceAsStream("/prismjs/prism.js"))); } catch (ScriptException e) { throw new RuntimeException(e); } } @Override public boolean hasDocInfo(LocationType location) { return location == LocationType.HEADER; } @Override public String getDocinfo(LocationType location, Document document, Map<String, Object> options) { if (document.hasAttribute("linkcss") && document.hasAttribute("copycss")) { (3) return "<link href=\"prism.css\" rel=\"stylesheet\" />"; } else { try (InputStream in = getClass().getResourceAsStream("/prismjs/prism.css")) { String css = IOUtils.toString(in); return "<style>\n" + css + "\n</style>"; } catch (IOException e) { throw new RuntimeException(e); } } } @Override public String format(Block node, String lang, Map<String, Object> opts) { return "<pre class='highlight'><code>" (3) + node.getContent() + "</code></pre>"; } @Override public boolean isWriteStylesheet(Document doc) { return doc.hasAttribute("linkcss") && doc.hasAttribute("copycss"); (3) } @Override public void writeStylesheet(Document doc, File toDir) { try (InputStream in1 = getClass().getResourceAsStream("/prismjs/prism.css"); (3) OutputStream fout1 = new FileOutputStream(new File(toDir, "prism.css"))) { IOUtils.copy(in1, fout1); } catch (IOException ioe) { throw new RuntimeException(ioe); } } @Override public HighlightResult highlight(Block node, String source, String lang, Map<String, Object> options) { ScriptContext ctx = scriptEngine.getContext(); (4) Bindings bindings = ctx.getBindings(ScriptContext.ENGINE_SCOPE); bindings.put("text", source); bindings.put("language", lang); try { String result = (String) scriptEngine.eval( "Prism.highlight(text, Prism.languages[language], language)", bindings); return new HighlightResult(result); } catch (ScriptException e) { throw new RuntimeException(e); } } } 1 A syntax highlighter that wants to statically convert the source text has to implement the interface org.asciidoctor.syntaxhighlighter.Highlighter . 2 We use the Nashorn JavaScript engine to run prism.js. 3 When rendering to a file and the attributes :linkcss and :copycss are set the css file of prism.js should be written to disk. Otherwise we include the content in a <style/> element. 4 highlight() is the only method required by the Highlighter interface. It gets the node to be converted, the source, the language and additional options. Here we invoke the prism.js API to convert the plain source text to static HTML, that uses the classes defined in the css. This is returned in a HighlightResult . Then we can use the highlighter just like in the previous examples. We just have to register it and use the correct value for the attribute :source-highlighter : File sources_adoc = //... File toDir = // ... asciidoctor.syntaxHighlighterRegistry() .register(PrismJsHighlighter.class, "prismjs"); (1) asciidoctor.convertFile(sources_adoc, Options.builder() .standalone(true) .toDir(toDir) .safe(SafeMode.UNSAFE) .attributes(Attributes.builder() .sourceHighlighter("prismjs") (1) .copyCss(true) .linkCss(true) .build()) .build()); File docFile = new File(toDir, "sources.html"); Document document = Jsoup.parse(docFile, "UTF-8"); Elements keywords = document.select("div.content pre.highlight code span.token.keyword"); (2) assertThat(keywords, not(empty())); assertThat(keywords.first().text(), is("public")); 1 Register our prism.js highlighter and set the attribute :source-highlighter to its name to use it. 2 Test that the source code has been formatted statically to <span/> elements. Link and Copy External Resources Invocation Order 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:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/syntax-highlighting/automatic-loading/ | Automatically Load a Syntax Highlighter | 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 Automatically Load a Syntax Highlighter 3.0 3.0 2.5 Edit this Page Automatically Load a Syntax Highlighter In previous examples, the syntax highlighters were registered manually. However, AsciidoctorJ provides another way to register syntax highlighters. If any implementation of the SPI interface is present on the classpath, it will be executed. To create an autoloadable extension you should do the next steps: Create a class that implements org.asciidoctor.jruby.syntaxhighlighter.spi.SyntaxHighlighterRegistry . org.asciidoctor.integrationguide.syntaxhighlighter.HighlightJsExtension.java import org.asciidoctor.jruby.syntaxhighlighter.spi.SyntaxHighlighterRegistry; public class HighlightJsExtension implements SyntaxHighlighterRegistry { (1) @Override public void register(Asciidoctor asciidoctor) { (2) asciidoctor.syntaxHighlighterRegistry() (3) .register(HighlightJsHighlighter.class, "autoloadedHighlightJs"); } } 1 To autoload extensions you need to implement SyntaxHighlighterRegistry . 2 AsciidoctorJ will automatically run the register method. The method is responsible for registering all extensions. 3 All required syntax highlighters are registered. Next, you need to create a file called org.asciidoctor.jruby.syntaxhighlighter.spi.SyntaxHighlighterRegistry inside META-INF/services with the implementation’s full qualified name. META-INF/services/org.asciidoctor.jruby.syntaxhighlighter.spi.SyntaxHighlighterRegistry org.asciidoctor.integrationguide.syntaxhighlighter.HighlightJsExtension And that’s all. Now when a .jar file containing the previous structure is dropped into the classpath of AsciidoctorJ, the register method will be executed automatically and the extensions will be registered. If you have installed AsciidoctorJ as CLI , the asciidoctorj command will be on the path, and you can use: $ asciidoctorj -cp=lib/myextension.jar test.adoc If you have downloaded the distribution jars only, use a command like: $ java -cp lib/jruby-complete-{jruby-version}.jar;lib/asciidoctorj-cli-{artifact-version}.jar;lib/asciidoctorj-api-{artifact-version}.jar;lib/asciidoctorj-{artifact-version}.jar;lib/jcommander-{jcommander-version}.jar;lib/myextension.jar org.asciidoctor.cli.jruby.AsciidoctorInvoker test.adoc Invocation Order v3.0.x migration guide 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:25 |
http://www.google.com/intl/en/about/#page-content | 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:25 |
http://hackage.haskell.org/package/cabal-install | cabal-install: The command-line interface for Cabal and Hackage. Hackage :: [Package] Search Browse What's new Upload User accounts cabal-install : The command-line interface for Cabal and Hackage. [ bsd3 , distribution , library , program ] [ Propose Tags ] [ Report a vulnerability ] The 'cabal' command-line program simplifies the process of managing Haskell software by automating the fetching, configuration, compilation and installation of Haskell libraries and programs. [ Skip to Readme ] Modules [ Index ] [ Quick Jump ] Distribution Client BuildReports Distribution.Client.BuildReports.Anonymous Distribution.Client.BuildReports.Lens Distribution.Client.BuildReports.Storage Distribution.Client.BuildReports.Types Distribution.Client.BuildReports.Upload Distribution.Client.Check Distribution.Client.CmdBench Distribution.Client.CmdBuild Distribution.Client.CmdClean Distribution.Client.CmdConfigure Distribution.Client.CmdErrorMessages Distribution.Client.CmdExec Distribution.Client.CmdFreeze Distribution.Client.CmdGenBounds Distribution.Client.CmdHaddock Distribution.Client.CmdHaddockProject Distribution.Client.CmdInstall Distribution.Client.CmdInstall.ClientInstallFlags Distribution.Client.CmdInstall.ClientInstallTargetSelector Distribution.Client.CmdLegacy Distribution.Client.CmdListBin Distribution.Client.CmdOutdated Distribution.Client.CmdPath Distribution.Client.CmdRepl Distribution.Client.CmdRun Distribution.Client.CmdSdist Distribution.Client.CmdTarget Distribution.Client.CmdTest Distribution.Client.CmdUpdate Compat Distribution.Client.Compat.Directory Distribution.Client.Compat.ExecutablePath Distribution.Client.Compat.Orphans Distribution.Client.Compat.Prelude Distribution.Client.Compat.Semaphore Distribution.Client.Compat.Tar Distribution.Client.Config Distribution.Client.Configure Distribution.Client.Dependency Distribution.Client.Dependency.Types Distribution.Client.DistDirLayout Distribution.Client.Errors Distribution.Client.Fetch Distribution.Client.FetchUtils Distribution.Client.FileMonitor Distribution.Client.Freeze Distribution.Client.GZipUtils Distribution.Client.GenBounds Distribution.Client.Get Distribution.Client.Glob Distribution.Client.GlobalFlags Distribution.Client.Haddock Distribution.Client.HashValue Distribution.Client.HttpUtils Distribution.Client.IndexUtils Distribution.Client.IndexUtils.ActiveRepos Distribution.Client.IndexUtils.IndexState Distribution.Client.IndexUtils.Timestamp Distribution.Client.Init Distribution.Client.Init.Defaults Distribution.Client.Init.FileCreators Distribution.Client.Init.FlagExtractors Distribution.Client.Init.Format Interactive Distribution.Client.Init.Interactive.Command Distribution.Client.Init.Licenses NonInteractive Distribution.Client.Init.NonInteractive.Command Distribution.Client.Init.NonInteractive.Heuristics Distribution.Client.Init.Prompt Distribution.Client.Init.Simple Distribution.Client.Init.Types Distribution.Client.Init.Utils Distribution.Client.Install Distribution.Client.InstallPlan Distribution.Client.InstallSymlink Distribution.Client.JobControl Distribution.Client.List Distribution.Client.Main Distribution.Client.Manpage Distribution.Client.ManpageFlags Distribution.Client.Nix Distribution.Client.NixStyleOptions Distribution.Client.PackageHash Distribution.Client.ParseUtils Distribution.Client.ProjectBuilding Distribution.Client.ProjectBuilding.PackageFileMonitor Distribution.Client.ProjectBuilding.Types Distribution.Client.ProjectBuilding.UnpackedPackage Distribution.Client.ProjectConfig Distribution.Client.ProjectConfig.Legacy Distribution.Client.ProjectConfig.Types Distribution.Client.ProjectFlags Distribution.Client.ProjectOrchestration Distribution.Client.ProjectPlanOutput Distribution.Client.ProjectPlanning Distribution.Client.ProjectPlanning.SetupPolicy Distribution.Client.ProjectPlanning.Types Distribution.Client.RebuildMonad Distribution.Client.Reconfigure Distribution.Client.ReplFlags Distribution.Client.Run Distribution.Client.Sandbox Distribution.Client.Sandbox.PackageEnvironment Distribution.Client.SavedFlags Distribution.Client.ScriptUtils Security Distribution.Client.Security.DNS Distribution.Client.Security.HTTP Distribution.Client.Setup Distribution.Client.SetupWrapper Distribution.Client.Signal Distribution.Client.SolverInstallPlan Distribution.Client.SourceFiles Distribution.Client.SrcDist Distribution.Client.Store Distribution.Client.Tar Distribution.Client.TargetProblem Distribution.Client.TargetSelector Distribution.Client.Targets Distribution.Client.Types Distribution.Client.Types.AllowNewer Distribution.Client.Types.BuildResults Distribution.Client.Types.ConfiguredId Distribution.Client.Types.ConfiguredPackage Distribution.Client.Types.Credentials Distribution.Client.Types.InstallMethod Distribution.Client.Types.OverwritePolicy Distribution.Client.Types.PackageLocation Distribution.Client.Types.PackageSpecifier Distribution.Client.Types.ReadyPackage Distribution.Client.Types.Repo Distribution.Client.Types.RepoName Distribution.Client.Types.SourcePackageDb Distribution.Client.Types.SourceRepo Distribution.Client.Types.WriteGhcEnvironmentFilesPolicy Distribution.Client.Upload Distribution.Client.Utils Distribution.Client.Utils.Json Distribution.Client.Utils.Parsec Distribution.Client.VCS Distribution.Client.Version Distribution.Client.Win32SelfUpgrade Deprecated Distribution.Deprecated.ParseUtils Distribution.Deprecated.ProjectParseUtils Distribution.Deprecated.ReadP Distribution.Deprecated.ViewAsFieldDescr Flags Manual Flags Name Description Default native-dns Enable use of the resolv & windns packages for performing DNS lookups Enabled git-rev include Git revision hash in version Disabled Automatic Flags Name Description Default lukko Use lukko for file-locking Disabled Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info Downloads cabal-install-3.16.1.0.tar.gz [ browse ] (Cabal source package) Package description ( revised from the package) Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'. Maintainer's Corner Package maintainers MikolajKonarski , fffaaa , ArtemPelenitsyn , geekosaur For package maintainers and hackage trustees edit package information Candidates No Candidates Versions [ RSS ] 0.4.0 , 0.5.0 , 0.5.1 , 0.5.2 , 0.6.0 , 0.6.2 , 0.6.4 , 0.8.0 , 0.8.2 , 0.10.0 , 0.10.2 , 0.14.0 , 0.14.1 , 1.16.0 , 1.16.0.1 , 1.16.0.2 , 1.16.1.0 , 1.18.0 , 1.18.0.1 , 1.18.0.2 , 1.18.0.3 , 1.18.0.4 , 1.18.0.5 , 1.18.0.6 , 1.18.0.7 , 1.18.0.8 , 1.18.1.0 , 1.18.2.0 , 1.20.0.0 , 1.20.0.1 , 1.20.0.2 , 1.20.0.3 , 1.20.0.4 , 1.20.0.5 , 1.20.0.6 , 1.20.1.0 , 1.20.2.0 , 1.22.0.0 , 1.22.0.1 , 1.22.2.0 , 1.22.3.0 , 1.22.4.0 , 1.22.5.0 , 1.22.6.0 , 1.22.7.0 , 1.22.8.0 , 1.22.9.0 , 1.24.0.0 , 1.24.0.1 , 1.24.0.2 , 2.0.0.0 , 2.0.0.1 , 2.2.0.0 , 2.4.0.0 , 2.4.1.0 , 3.0.0.0 , 3.2.0.0 , 3.4.0.0 , 3.4.1.0 , 3.6.0.0 , 3.6.2.0 , 3.8.1.0 , 3.10.1.0 , 3.10.2.0 , 3.10.2.1 , 3.10.3.0 , 3.12.1.0 , 3.14.1.0 , 3.14.1.1 , 3.14.2.0 , 3.16.0.0 , 3.16.1.0 Change log ChangeLog.md Dependencies array (>=0.4 && <0.6) , async (>=2.0 && <2.3) , base (>=4.13 && <4.23) , base16-bytestring (>=0.1.1 && <1.1) , binary (>=0.7.3 && <0.9) , bytestring (>=0.10.6.0 && <0.13) , Cabal (>=3.16.1.0 && <3.17) , cabal-install , cabal-install-solver (>=3.16.1.0 && <3.17) , Cabal-syntax (>=3.16.1.0 && <3.17) , containers (>=0.5.6.2 && <0.9) , cryptohash-sha256 (>=0.11 && <0.12) , directory (>=1.3.7.0 && <1.4) , echo (>=0.1.3 && <0.2) , edit-distance (>=0.2.2 && <0.3) , exceptions (>=0.10.4 && <0.11) , filepath (>=1.4.0.0 && <1.6) , hackage-security (>=0.6.2.0 && <0.7) , HTTP (>=4000.1.5 && <4000.6) , lukko (>=0.1 && <0.2) , mtl (>=2.0 && <2.4) , network-uri (>=2.6.2.0 && <2.7) , open-browser (>=0.2.1.0 && <0.5) , parsec (>=3.1.13.0 && <3.2) , pretty (>=1.1 && <1.2) , process (>=1.2.3.0 && <1.7) , random (>=1.2 && <1.4) , regex-base (>=0.94.0.0 && <0.95) , regex-posix (>=0.96.0.0 && <0.97) , resolv (>=0.1.1 && <0.3) , safe-exceptions (>=0.1.7.0 && <0.2) , semaphore-compat (>=1.0.0 && <1.1) , stm (>=2.0 && <2.6) , tar (>=0.5.0.3 && <0.8) , text (>=1.2.3 && <1.3 || >=2.0 && <2.2) , time (>=1.5.0.1 && <1.16) , unix (>=2.5 && <2.8 || >=2.8.6.0 && <2.9) , Win32 (>=2.8 && <3) , windns (>=0.1.0 && <0.2) , zlib (>=0.5.3 && <0.8) [ details ] License BSD-3-Clause Copyright 2003-2025, Cabal Development Team Author Cabal Development Team (see AUTHORS file) Maintainer Cabal Development Team <cabal-devel@haskell.org> Uploaded by fffaaa at 2026-01-01T12:35:44Z Revised Revision 1 made by geekosaur at 2026-01-01T17:09:58Z Stability Unknown --> Category Distribution Home page http://www.haskell.org/cabal/ Bug tracker https://github.com/haskell/cabal/issues Source repo head: git clone https://github.com/haskell/cabal/ (cabal-install) Distributions Arch: 3.10.3.0 , Debian: 3.0.0.0 , Fedora: 3.10.3.0 , FreeBSD: 1.22.6.0 , LTSHaskell: 3.12.1.0 , NixOS: 3.16.0.0 , Stackage: 3.14.2.0 , openSUSE: 3.14.1.1 Reverse Dependencies 5 direct, 0 indirect [ details ] Executables cabal Downloads 264018 total (219 in the last 30 days) Rating 2.5 (votes: 11) [estimated by Bayesian average ] Your Rating λ λ λ Status Docs available [ build log ] Last success reported on 2026-01-01 [ all 1 reports ] Readme for cabal-install-3.16.1.0 [ back to package description ] The cabal-install package See the Cabal web site for more information. The cabal-install package provides a command line tool named cabal . It uses the Cabal library and provides a user interface to the Cabal/Hackage build automation and package management system. It can build and install both local and remote packages, including dependencies. Produced by hackage and Cabal 3.16.1.0. | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-show.1.html | Bundler: bundle show Bundler Docs Team Blog Repository bundle show bundle-show - Shows all the gems in your bundle, or the path to a gem bundle show [GEM] [--paths] Description Without the [GEM] option, show will print a list of the names and versions of all gems that are required by your Gemfile(5) , sorted by name. Calling show with [GEM] will list the exact location of that gem on your machine. Options --paths List the paths of all gems that are required by your Gemfile(5) , sorted by gem name. Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/extensions/register-extensions-automatically/ | Automatically Loading Extensions | 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 Extensions API Register Extensions Automatically Loading Extensions 3.0 3.0 2.5 Edit this Page Automatically Loading Extensions In previous examples, the extensions were registered manually. However, AsciidoctorJ provides another way to register extensions. If any implementation of the SPI interface is present on the classpath, it will be executed. To create an autoloadable extension you should do the next steps: Create a class that implements org.asciidoctor.jruby.extension.spi.ExtensionRegistry . org.asciidoctor.extension.integratorguide.TerminalCommandExtension.java import org.asciidoctor.jruby.extension.spi.ExtensionRegistry; public class TerminalCommandExtension implements ExtensionRegistry { (1) @Override public void register(Asciidoctor asciidoctor) { (2) JavaExtensionRegistry javaExtensionRegistry = asciidoctor.javaExtensionRegistry(); javaExtensionRegistry.treeprocessor(TerminalCommandTreeprocessor.class); (3) } } 1 To autoload extensions you need to implement ExtensionRegistry . 2 AsciidoctorJ will automatically run the register method. The method is responsible for registering all extensions. 3 All required Java extensions are registered. Next, you need to create a file called org.asciidoctor.jruby.extension.spi.ExtensionRegistry inside META-INF/services with the implementation’s full qualified name. META-INF/services/org.asciidoctor.jruby.extension.spi.ExtensionRegistry org.asciidoctor.integrationguide.extension.TerminalCommandExtension And that’s all. Now when a .jar file containing the previous structure is dropped into the classpath of AsciidoctorJ, the register method will be executed automatically and the extensions will be registered. If you have installed AsciidoctorJ as recommended, the asciidoctorj command will be on the path, and you can use: asciidoctorj -cp=lib/myextension.jar test.adoc If you have downloaded the distribution jars only, use a command like: java -cp lib/jruby-complete-{jruby-version}.jar;lib/asciidoctor-api-{artifact-version}.jar;lib/asciidoctor-core-{artifact-version}.jar;lib/jcommander-{jcommander-version}.jar;lib/myextension.jar org.asciidoctor.cli.jruby.AsciidoctorInvoker test.adoc Bulk Extension Registration ( Extension Groups ) Logging 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:25 |
https://bundler.io/v4.0/man/bundle-update.1.html | Bundler: bundle update Bundler Docs Team Blog Repository bundle update bundle-update - Update your gems to the latest available versions bundle update *gems [--all] [--group=NAME] [--source=NAME] [--local] [--ruby] [--bundler[=VERSION]] [--force] [--full-index] [--gemfile=GEMFILE] [--jobs=NUMBER] [--quiet] [--patch|--minor|--major] [--pre] [--strict] [--conservative] Description Update the gems specified (all gems, if --all flag is used), ignoring the previously installed gems specified in the Gemfile.lock . In general, you should use bundle install(1) to install the same exact gems and versions across machines. You would use bundle update to explicitly update the version of a gem. Options --all Update all gems specified in Gemfile. --group=<list> , -g=<list> Only update the gems in the specified group. For instance, you can update all gems in the development group with bundle update --group development . You can also call bundle update rails --group test to update the rails gem and all gems in the test group, for example. --source=<list> The name of a :git or :path source used in the Gemfile (5) . For instance, with a :git source of http://github.com/rails/rails.git , you would call bundle update --source rails --local Do not attempt to fetch gems remotely and use the gem cache instead. --ruby Update the locked version of Ruby to the current version of Ruby. --bundler[=BUNDLER] Update the locked version of bundler to the invoked bundler version. --force , --redownload Force reinstalling every gem, even if already installed. --full-index Fall back to using the single-file index of all gems. --gemfile=GEMFILE Use the specified gemfile instead of Gemfile(5) . --jobs=<number> , -j=<number> Specify the number of jobs to run in parallel. The default is the number of available processors. --retry=[<number>] Retry failed network or git requests for number times. --quiet Only output warnings and errors. --patch Prefer updating only to next patch version. --minor Prefer updating only to next minor version. --major Prefer updating to next major version (default). --pre Always choose the highest allowed version, regardless of prerelease status. --strict Do not allow any gem to be updated past latest --patch | --minor | --major . --conservative Use bundle install conservative update behavior and do not allow indirect dependencies to be updated. Updating All Gems If you run bundle update --all , bundler will ignore any previously installed gems and resolve all dependencies again based on the latest versions of all gems available in the sources. Consider the following Gemfile (5) : source "https://rubygems.org" gem "rails", "3.0.0.rc" gem "nokogiri" When you run bundle install(1) the first time, bundler will resolve all of the dependencies, all the way down, and install what you need: Fetching gem metadata from https://rubygems.org/......... Resolving dependencies... Installing builder 2.1.2 Installing abstract 1.0.0 Installing rack 1.2.8 Using bundler 1.7.6 Installing rake 10.4.0 Installing polyglot 0.3.5 Installing mime-types 1.25.1 Installing i18n 0.4.2 Installing mini_portile 0.6.1 Installing tzinfo 0.3.42 Installing rack-mount 0.6.14 Installing rack-test 0.5.7 Installing treetop 1.4.15 Installing thor 0.14.6 Installing activesupport 3.0.0.rc Installing erubis 2.6.6 Installing activemodel 3.0.0.rc Installing arel 0.4.0 Installing mail 2.2.20 Installing activeresource 3.0.0.rc Installing actionpack 3.0.0.rc Installing activerecord 3.0.0.rc Installing actionmailer 3.0.0.rc Installing railties 3.0.0.rc Installing rails 3.0.0.rc Installing nokogiri 1.6.5 Bundle complete! 2 Gemfile dependencies, 26 gems total. Use `bundle show [gemname]` to see where a bundled gem is installed. As you can see, even though you have two gems in the Gemfile (5) , your application needs 26 different gems in order to run. Bundler remembers the exact versions it installed in Gemfile.lock . The next time you run bundle install(1) , bundler skips the dependency resolution and installs the same gems as it installed last time. After checking in the Gemfile.lock into version control and cloning it on another machine, running bundle install(1) will still install the gems that you installed last time. You don't need to worry that a new release of erubis or mail changes the gems you use. However, from time to time, you might want to update the gems you are using to the newest versions that still match the gems in your Gemfile (5) . To do this, run bundle update --all , which will ignore the Gemfile.lock , and resolve all the dependencies again. Keep in mind that this process can result in a significantly different set of the 25 gems, based on the requirements of new gems that the gem authors released since the last time you ran bundle update --all . Updating A List Of Gems Sometimes, you want to update a single gem in the Gemfile (5) , and leave the rest of the gems that you specified locked to the versions in the Gemfile.lock . For instance, in the scenario above, imagine that nokogiri releases version 1.4.4 , and you want to update it without updating Rails and all of its dependencies. To do this, run bundle update nokogiri . Bundler will update nokogiri and any of its dependencies, but leave alone Rails and its dependencies. Overlapping Dependencies Sometimes, multiple gems declared in your Gemfile (5) are satisfied by the same second-level dependency. For instance, consider the case of thin and rack-perftools-profiler . source "https://rubygems.org" gem "thin" gem "rack-perftools-profiler" The thin gem depends on rack >= 1.0 , while rack-perftools-profiler depends on rack ~> 1.0 . If you run bundle install, you get: Fetching source index for https://rubygems.org/ Installing daemons (1.1.0) Installing eventmachine (0.12.10) with native extensions Installing open4 (1.0.1) Installing perftools.rb (0.4.7) with native extensions Installing rack (1.2.1) Installing rack-perftools_profiler (0.0.2) Installing thin (1.2.7) with native extensions Using bundler (1.0.0.rc.3) In this case, the two gems have their own set of dependencies, but they share rack in common. If you run bundle update thin , bundler will update daemons , eventmachine and rack , which are dependencies of thin , but not open4 or perftools.rb , which are dependencies of rack-perftools_profiler . Note that bundle update thin will update rack even though it's also a dependency of rack-perftools_profiler . In short, by default, when you update a gem using bundle update , bundler will update all dependencies of that gem, including those that are also dependencies of another gem. To prevent updating indirect dependencies, prior to version 1.14 the only option was the CONSERVATIVE UPDATING behavior in bundle install(1) : In this scenario, updating the thin version manually in the Gemfile (5) , and then running bundle install(1) will only update daemons and eventmachine , but not rack . For more information, see the CONSERVATIVE UPDATING section of bundle install(1) . Starting with 1.14, specifying the --conservative option will also prevent indirect dependencies from being updated. Patch Level Options Version 1.14 introduced 4 patch-level options that will influence how gem versions are resolved. One of the following options can be used: --patch , --minor or --major . --strict can be added to further influence resolution. --patch Prefer updating only to next patch version. --minor Prefer updating only to next minor version. --major Prefer updating to next major version (default). --strict Do not allow any gem to be updated past latest --patch | --minor | --major . When Bundler is resolving what versions to use to satisfy declared requirements in the Gemfile or in parent gems, it looks up all available versions, filters out any versions that don't satisfy the requirement, and then, by default, sorts them from newest to oldest, considering them in that order. Providing one of the patch level options (e.g. --patch ) changes the sort order of the satisfying versions, causing Bundler to consider the latest --patch or --minor version available before other versions. Note that versions outside the stated patch level could still be resolved to if necessary to find a suitable dependency graph. For example, if gem 'foo' is locked at 1.0.2, with no gem requirement defined in the Gemfile, and versions 1.0.3, 1.0.4, 1.1.0, 1.1.1, 2.0.0 all exist, the default order of preference by default ( --major ) will be "2.0.0, 1.1.1, 1.1.0, 1.0.4, 1.0.3, 1.0.2". If the --patch option is used, the order of preference will change to "1.0.4, 1.0.3, 1.0.2, 1.1.1, 1.1.0, 2.0.0". If the --minor option is used, the order of preference will change to "1.1.1, 1.1.0, 1.0.4, 1.0.3, 1.0.2, 2.0.0". Combining the --strict option with any of the patch level options will remove any versions beyond the scope of the patch level option, to ensure that no gem is updated that far. To continue the previous example, if both --patch and --strict options are used, the available versions for resolution would be "1.0.4, 1.0.3, 1.0.2". If --minor and --strict are used, it would be "1.1.1, 1.1.0, 1.0.4, 1.0.3, 1.0.2". Gem requirements as defined in the Gemfile will still be the first determining factor for what versions are available. If the gem requirement for foo in the Gemfile is '~> 1.0', that will accomplish the same thing as providing the --minor and --strict options. Patch Level Examples Given the following gem specifications: foo 1.4.3, requires: ~> bar 2.0 foo 1.4.4, requires: ~> bar 2.0 foo 1.4.5, requires: ~> bar 2.1 foo 1.5.0, requires: ~> bar 2.1 foo 1.5.1, requires: ~> bar 3.0 bar with versions 2.0.3, 2.0.4, 2.1.0, 2.1.1, 3.0.0 Gemfile: gem 'foo' Gemfile.lock: foo (1.4.3) bar (~> 2.0) bar (2.0.3) Cases: # Command Line Result ------------------------------------------------------------ 1 bundle update --patch 'foo 1.4.5', 'bar 2.1.1' 2 bundle update --patch foo 'foo 1.4.5', 'bar 2.1.1' 3 bundle update --minor 'foo 1.5.1', 'bar 3.0.0' 4 bundle update --minor --strict 'foo 1.5.0', 'bar 2.1.1' 5 bundle update --patch --strict 'foo 1.4.4', 'bar 2.0.4' In case 1, bar is upgraded to 2.1.1, a minor version increase, because the dependency from foo 1.4.5 required it. In case 2, only foo is requested to be unlocked, but bar is also allowed to move because it's not a declared dependency in the Gemfile. In case 3, bar goes up a whole major release, because a minor increase is preferred now for foo, and when it goes to 1.5.1, it requires 3.0.0 of bar. In case 4, foo is preferred up to a minor version, but 1.5.1 won't work because the --strict flag removes bar 3.0.0 from consideration since it's a major increment. In case 5, both foo and bar have any minor or major increments removed from consideration because of the --strict flag, so the most they can move is up to 1.4.4 and 2.0.4. Recommended Workflow In general, when working with an application managed with bundler, you should use the following workflow: After you create your Gemfile (5) for the first time, run $ bundle install Check the resulting Gemfile.lock into version control $ git add Gemfile.lock When checking out this repository on another development machine, run $ bundle install When checking out this repository on a deployment machine, run $ bundle install --deployment After changing the Gemfile (5) to reflect a new or update dependency, run $ bundle install Make sure to check the updated Gemfile.lock into version control $ git add Gemfile.lock If bundle install(1) reports a conflict, manually update the specific gems that you changed in the Gemfile (5) $ bundle update rails thin If you want to update all the gems to the latest possible versions that still match the gems listed in the Gemfile (5) , run $ bundle update --all Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 v1.14 v1.13 v1.12 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-fund.1.html | Bundler: bundle fund Bundler Docs Team Blog Repository bundle fund bundle-fund - Lists information about gems seeking funding assistance bundle fund [ OPTIONS ] Description bundle fund lists information about gems seeking funding assistance. Options --group=<list> , -g=<list> Fetch funding information for a specific group. Examples # Lists funding information for all gems bundle fund # Lists funding information for a specific group bundle fund --group=security Choose version v4.0 v2.7 v2.6 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://www.unicode.org/glossary/#icu | 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 &amp; for "&" or &nbsp; 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://bundler.io/v4.0/man/bundle-version.1.html | Bundler: bundle version Bundler Docs Team Blog Repository bundle version bundle-version - Prints Bundler version information bundle version Description Prints Bundler version information. Options No options. Example Print the version of Bundler with build date and commit hash of the in the Git source. bundle version shows Bundler version 2.3.21 (2022-08-24 commit d54be5fdd8) for example. cf. bundle --version shows Bundler version 2.3.21 . Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 v1.14 v1.13 v1.12 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-remove.1.html | Bundler: bundle remove Bundler Docs Team Blog Repository bundle remove bundle-remove - Removes gems from the Gemfile `bundle remove [GEM [GEM ...]] Description Removes the given gems from the Gemfile while ensuring that the resulting Gemfile is still valid. If a gem cannot be removed, a warning is printed. If a gem is already absent from the Gemfile, and error is raised. Example: bundle remove rails bundle remove rails rack Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-doctor.1.html | Bundler: bundle doctor Bundler Docs Team Blog Repository bundle doctor bundle-doctor - Checks the bundle for common problems bundle doctor [diagnose] [--quiet] [--gemfile=GEMFILE] [--ssl] bundle doctor ssl [--host=HOST] [--tls-version=TLS-VERSION] [--verify-mode=VERIFY-MODE] bundle doctor help [COMMAND] Description You can diagnose common Bundler problems with this command such as checking gem environment or SSL/TLS issue. Sub-commands Diagnose (default Command) Checks your Gemfile and gem environment for common problems. If issues are detected, Bundler prints them and exits status 1. Otherwise, Bundler prints a success message and exits status 0. Examples of common problems caught include: Invalid Bundler settings Mismatched Ruby versions Mismatched platforms Uninstalled gems Missing dependencies OPTIONS --quiet Only output warnings and errors. --gemfile=GEMFILE The location of the Gemfile (5) which Bundler should use. This defaults to a Gemfile (5) in the current working directory. In general, Bundler will assume that the location of the Gemfile (5) is also the project's root and will try to find Gemfile.lock and vendor/cache relative to this location. --ssl Diagnose common SSL problems when connecting to https://rubygems.org. This flag runs the bundle doctor ssl subcommand with default values underneath. Ssl If you've experienced issues related to SSL certificates and/or TLS versions while connecting to https://rubygems.org, this command can help troubleshoot common problems. The diagnostic will perform a few checks such as: Verify the Ruby OpenSSL version installed on your system. Check the OpenSSL library version used for compilation. Ensure CA certificates are correctly setup on your machine. Open a TLS connection and verify the outcome. OPTIONS --host=HOST Perform the diagnostic on HOST. Defaults to rubygems.org . --tls-version=TLS-VERSION Specify the TLS version when opening the connection to HOST. Accepted values are: 1.1 or 1.2 . --verify-mode=VERIFY-MODE Specify the TLS verify mode when opening the connection to HOST. Defaults to SSL_VERIFY_PEER . Accepted values are: CLIENT_ONCE , FAIL_IF_NO_PEER_CERT , NONE , PEER . Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/extensions/block-macro-processor/ | Block Macro Processor | 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 Extensions API Write an Extension Block Macro Processor 3.0 3.0 2.5 Edit this Page Block Macro Processor A block macro is a block having a content like this: gist::mygithubaccount/8810011364687d7bec2c[] . During the rendering process of the document Asciidoctor invokes a BlockMacroProcessor that has to create a block computed from this macro. The structure is always like this: Macro name, e.g. gist Two colons :: A target, mygithubaccount/8810011364687d7bec2c Attributes, that are empty in this case, [] Our example block macro should embed the GitHub gist that would be available at the URL https://gist.github.com/mygithubaccount/8810011364687d7bec2c. The following block macro processor replaces such a macro with the <script> element that you can also pick from https://gist.github.com for a certain gist. A BlockMacroProcessor that replaces gist block macros import org.asciidoctor.ast.StructuralNode; import org.asciidoctor.extension.BlockMacroProcessor; import org.asciidoctor.extension.Name; import java.util.Map; @Name("gist") (1) public class GistBlockMacroProcessor extends BlockMacroProcessor { (2) @Override public StructuralNode process( (3) StructuralNode parent, String target, Map<String, Object> attributes) { String content = new StringBuilder() .append("<div class=\"openblock gist\">") .append("<div class=\"content\">") .append("<script src=\"https://gist.github.com/") .append(target) (4) .append(".js\"></script>") .append("</div>") .append("</div>").toString(); return createBlock(parent, "pass", content); (5) } } 1 The @Name annotation defines the macro name this BlockMacroProcessor should be called for. In this case this instance will be called for all block macros that have the name gist . 2 All BlockMacroProcessors must extend the class org.asciidoctor.extension.BlockMacroProcessor . 3 A BlockMacroProcessor must implement the abstract method process that is called by Asciidoctor. The method must return a new block that is used be Asciidoctor instead of the block containing the block macro. 4 The implementation constructs the HTML content that should go into the final HTML document. That means that the content has to be directly passed through into the result. Having said that this example does not work when generating PDF content. 5 The processor creates a new block via the inherited method createBlock() . The parent of the new block, a context and the content must be passed. As we want to pass through the content directly into the result the context must be pass and the content is the computed HTML string. There are many more methods available to create any type of AST node. Now, once it is registered, we would be able to use the new block macro in our document as: gist-macro.adoc = Gist test gist::myaccount/1234abcd[] Attributes and Positional attributes As a next step for the gist macro we might want to add support for GitLab Snippets, which are a similar system to Github Gists. The property whether we want to embed a Github Gist or a GitLab Snippet can be passed as the first attribute to the macro. GitLab Snippets can also be part of a project. This project could be accepted as a second attribute. That way Gists or Snippets could be embedded with our macro with these AsciiDoc block macros: gist-marco-attributes.adoc == Gists gist::myaccount/1234abcd[] gist::2228798[gitlab] gist::1717978[gitlab,gitlab-org/gitlab-foss] gist::1717979[gitlab,repo=gitlab-org/gitlab-foss] The first macro shows our original notation for how to embed a Github Gist. The second macro shows how to embed a Snippet from GitLab that is not associated with a project. The third macro shows how to embed a Snippet from GitLab that is associated with the project gitlab-org/gitlab-foss . The last macro shows how to embed a Snippet from GitLab that is associated with the project gitlab-org/gitlab-foss by not using a positional attribute, but instead naming it explicitly. This can be achieved by the following extension: GistBlockMacroPositionalAttributesProcessor import org.asciidoctor.ast.StructuralNode; import org.asciidoctor.extension.BlockMacroProcessor; import org.asciidoctor.extension.Name; import org.asciidoctor.extension.PositionalAttributes; import java.util.Map; @Name("gist") @PositionalAttributes({"provider", "repo"}) (1) public class GistBlockMacroPositionalAttributesProcessor extends BlockMacroProcessor { @Override public StructuralNode process(StructuralNode parent, String target, Map<String, Object> attributes) { String script; String provider = (String) attributes.get("provider"); if (provider == null || "github".equals(provider)) { (2) script = String.format("<script src=\"https://gist.github.com/%s.js\"/></script>", target); } else if ("gitlab".equals(provider)) { String repo = (String) attributes.get("repo"); if (repo == null) { script = String.format("<script src=\"https://gitlab.com/-/snippets/%s.js\"></script>", target); } else { script = String.format("<script src=\"https://gitlab.com/%s/-/snippets/%s.js\"></script>", repo, target); } } else { throw new IllegalArgumentException("Unknown provider " + provider); } String content = new StringBuilder() .append("<div class=\"openblock gist\">") .append("<div class=\"content\">") .append(script) .append("</div>") .append("</div>").toString(); return createBlock(parent, "pass", content); } } 1 The positional attributes for this are provider and repo in that order. These attributes can be either passed by their position, or by name. 2 Based on the values of the two attributes the HTML content to embed the Gist is computed. Understanding the AST Classes Inline Macro Processor 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:25 |
https://github.com/jeremyevans/ruby-subset_sum/actions/workflows/ci.yml | CI · Workflow runs · jeremyevans/ruby-subset_sum · 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 / ruby-subset_sum Public Notifications You must be signed in to change notification settings Fork 3 Star 13 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/ruby-subset_sum Actions --> All workflows Workflows CI CI 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 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. Avoid use of stub in tests CI #13: Commit 78925a1 pushed by jeremyevans 33s master master 33s View workflow file Add Ruby 4.0 to CI CI #12: Commit 104f821 pushed by jeremyevans 20m 53s master master 20m 53s View workflow file Use SimpleCov.add_filter block instead of string CI #11: Commit cfaf31d pushed by jeremyevans 37s master master 37s View workflow file Switch rdoc task to normal rake task, avoid rdoc/task require CI #10: Commit c640dd4 pushed by jeremyevans 35s master master 35s View workflow file Work with ubuntu-latest using 24.04 by default in CI CI #9: Commit 69ebda1 pushed by jeremyevans 37s master master 37s View workflow file Add Ruby 3.4 to CI CI #8: Commit 677f4fa pushed by jeremyevans 37s master master 37s View workflow file Use -W:strict_unused_block when running tests on Ruby 3.4+ CI #7: Commit bd59094 pushed by jeremyevans 39s master master 39s View workflow file You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://www.unicode.org/glossary/#surrogate_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 &amp; for "&" or &nbsp; 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://bundler.io/v4.0/man/bundle-plugin.1.html | Bundler: bundle plugin Bundler Docs Team Blog Repository bundle plugin bundle-plugin - Manage Bundler plugins bundle plugin install PLUGINS [--source=SOURCE] [--version=VERSION] [--git=GIT] [--branch=BRANCH|--ref=REF] [--path=PATH] bundle plugin uninstall PLUGINS [--all] bundle plugin list bundle plugin help [COMMAND] Description You can install, uninstall, and list plugin(s) with this command to extend functionalities of Bundler. Sub-commands Install Install the given plugin(s). For example, bundle plugin install bundler-graph will install bundler-graph gem from globally configured sources (defaults to RubyGems.org). Note that the global source specified in Gemfile is ignored. OPTIONS --source=SOURCE Install the plugin gem from a specific source, rather than from globally configured sources. Example: bundle plugin install bundler-graph --source https://example.com --version=VERSION Specify a version of the plugin gem to install via --version . Example: bundle plugin install bundler-graph --version 0.2.1 --git=GIT Install the plugin gem from a Git repository. You can use standard Git URLs like: ssh://[user@]host.xz[:port]/path/to/repo.git http[s]://host.xz[:port]/path/to/repo.git /path/to/repo file:///path/to/repo Example: bundle plugin install bundler-graph --git https://github.com/rubygems/bundler-graph --branch=BRANCH When you specify --git , you can use --branch to use. --ref=REF When you specify --git , you can use --ref to specify any tag, or commit hash (revision) to use. --path=PATH Install the plugin gem from a local path. Example: bundle plugin install bundler-graph --path ../bundler-graph Uninstall Uninstall the plugin(s) specified in PLUGINS. OPTIONS --all Uninstall all the installed plugins. If no plugin is installed, then it does nothing. List List the installed plugins and available commands. No options. Help Describe subcommands or one specific subcommand. No options. See Also How to write a Bundler plugin Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-config.1.html | Bundler: bundle config Bundler Docs Team Blog Repository bundle config bundle-config - Set bundler configuration options bundle config [list] bundle config [get [--local|--global]] NAME bundle config [set [--local|--global]] NAME VALUE bundle config unset [--local|--global] NAME Description This command allows you to interact with Bundler's configuration system. Bundler loads configuration settings in this order: Local config ( <project_root>/.bundle/config or $BUNDLE_APP_CONFIG/config ) Environmental variables ( ENV ) Global config ( ~/.bundle/config ) Bundler default config Executing bundle with the BUNDLE_IGNORE_CONFIG environment variable set will cause it to ignore all configuration. Sub-commands List (default Command) Executing bundle config list will print a list of all bundler configuration for the current bundle, and where that configuration was set. Get Executing bundle config get <name> will print the value of that configuration setting, and all locations where it was set. OPTIONS --local Get configuration from configuration file for the local application, namely, <project_root>/.bundle/config , or $BUNDLE_APP_CONFIG/config if BUNDLE_APP_CONFIG is set. --global Get configuration from configuration file global to all bundles executed as the current user, namely, from ~/.bundle/config . Set Executing bundle config set <name> <value> defaults to setting local configuration if executing from within a local application, otherwise it will set global configuration. OPTIONS --local Executing bundle config set --local <name> <value> will set that configuration in the directory for the local application. The configuration will be stored in <project_root>/.bundle/config . If BUNDLE_APP_CONFIG is set, the configuration will be stored in $BUNDLE_APP_CONFIG/config . --global Executing bundle config set --global <name> <value> will set that configuration to the value specified for all bundles executed as the current user. The configuration will be stored in ~/.bundle/config . If name already is set, name will be overridden and user will be warned. Unset Executing bundle config unset <name> will delete the configuration in both local and global sources. OPTIONS --local Executing bundle config unset --local <name> will delete the configuration only from the local application. --global Executing bundle config unset --global <name> will delete the configuration only from the user configuration. Configuration Keys Configuration keys in bundler have two forms: the canonical form and the environment variable form. For instance, passing the --without flag to bundle install(1) prevents Bundler from installing certain groups specified in the Gemfile (5) . Bundler persists this value in app/.bundle/config so that calls to Bundler.setup do not try to find gems from the Gemfile that you didn't install. Additionally, subsequent calls to bundle install(1) remember this setting and skip those groups. The canonical form of this configuration is "without" . To convert the canonical form to the environment variable form, capitalize it, and prepend BUNDLE_ . The environment variable form of "without" is BUNDLE_WITHOUT . Any periods in the configuration keys must be replaced with two underscores when setting it via environment variables. The configuration key local.rack becomes the environment variable BUNDLE_LOCAL__RACK . List Of Available Keys The following is a list of all configuration keys and their purpose. You can learn more about their operation in bundle install(1) . auto_install ( BUNDLE_AUTO_INSTALL ) Automatically run bundle install when gems are missing. bin ( BUNDLE_BIN ) If configured, bundle binstubs will install executables from gems in the bundle to the specified directory. Otherwise it will create them in a bin directory relative to the Gemfile directory. These executables run in Bundler's context. If used, you might add this directory to your environment's PATH variable. For instance, if the rails gem comes with a rails executable, bundle binstubs will create a bin/rails executable that ensures that all referred dependencies will be resolved using the bundled gems. cache_all ( BUNDLE_CACHE_ALL ) Cache all gems, including path and git gems. This needs to be explicitly before bundler 4, but will be the default on bundler 4. cache_all_platforms ( BUNDLE_CACHE_ALL_PLATFORMS ) Cache gems for all platforms. cache_path ( BUNDLE_CACHE_PATH ) The directory that bundler will place cached gems in when running bundle package , and that bundler will look in when installing gems. Defaults to vendor/cache . clean ( BUNDLE_CLEAN ) Whether Bundler should run bundle clean automatically after bundle install . Defaults to true in Bundler 4, as long as path is not explicitly configured. console ( BUNDLE_CONSOLE ) The console that bundle console starts. Defaults to irb . default_cli_command ( BUNDLE_DEFAULT_CLI_COMMAND ) The command that running bundle without arguments should run. Defaults to cli_help since Bundler 4, but can also be install which was the previous default. deployment ( BUNDLE_DEPLOYMENT ) Equivalent to setting frozen to true and path to vendor/bundle . disable_checksum_validation ( BUNDLE_DISABLE_CHECKSUM_VALIDATION ) Allow installing gems even if they do not match the checksum provided by RubyGems. disable_exec_load ( BUNDLE_DISABLE_EXEC_LOAD ) Stop Bundler from using load to launch an executable in-process in bundle exec . disable_local_branch_check ( BUNDLE_DISABLE_LOCAL_BRANCH_CHECK ) Allow Bundler to use a local git override without a branch specified in the Gemfile. disable_local_revision_check ( BUNDLE_DISABLE_LOCAL_REVISION_CHECK ) Allow Bundler to use a local git override without checking if the revision present in the lockfile is present in the repository. disable_shared_gems ( BUNDLE_DISABLE_SHARED_GEMS ) Stop Bundler from accessing gems installed to RubyGems' normal location. disable_version_check ( BUNDLE_DISABLE_VERSION_CHECK ) Stop Bundler from checking if a newer Bundler version is available on rubygems.org. force_ruby_platform ( BUNDLE_FORCE_RUBY_PLATFORM ) Ignore the current machine's platform and install only ruby platform gems. As a result, gems with native extensions will be compiled from source. frozen ( BUNDLE_FROZEN ) Disallow any automatic changes to Gemfile.lock . Bundler commands will be blocked unless the lockfile can be installed exactly as written. Usually this will happen when changing the Gemfile manually and forgetting to update the lockfile through bundle lock or bundle install . gem.github_username ( BUNDLE_GEM__GITHUB_USERNAME ) Sets a GitHub username or organization to be used in the README and .gemspec files when you create a new gem via bundle gem command. It can be overridden by passing an explicit --github-username flag to bundle gem . gem.push_key ( BUNDLE_GEM__PUSH_KEY ) Sets the --key parameter for gem push when using the rake release command with a private gemstash server. gemfile ( BUNDLE_GEMFILE ) The name of the file that bundler should use as the Gemfile . This location of this file also sets the root of the project, which is used to resolve relative paths in the Gemfile , among other things. By default, bundler will search up from the current working directory until it finds a Gemfile . global_gem_cache ( BUNDLE_GLOBAL_GEM_CACHE ) Whether Bundler should cache all gems and compiled extensions globally, rather than locally to the configured installation path. ignore_funding_requests ( BUNDLE_IGNORE_FUNDING_REQUESTS ) When set, no funding requests will be printed. ignore_messages ( BUNDLE_IGNORE_MESSAGES ) When set, no post install messages will be printed. To silence a single gem, use dot notation like ignore_messages.httparty true . init_gems_rb ( BUNDLE_INIT_GEMS_RB ) Generate a gems.rb instead of a Gemfile when running bundle init . jobs ( BUNDLE_JOBS ) The number of gems Bundler can install in parallel. Defaults to the number of available processors. lockfile ( BUNDLE_LOCKFILE ) The path to the lockfile that bundler should use. By default, Bundler adds .lock to the end of the gemfile entry. Can be set to false in the Gemfile to disable lockfile creation entirely (see gemfile (5) ). lockfile_checksums ( BUNDLE_LOCKFILE_CHECKSUMS ) Whether Bundler should include a checksums section in new lockfiles, to protect from compromised gem sources. Defaults to true. no_install ( BUNDLE_NO_INSTALL ) Whether bundle package should skip installing gems. no_prune ( BUNDLE_NO_PRUNE ) Whether Bundler should leave outdated gems unpruned when caching. only ( BUNDLE_ONLY ) A space-separated list of groups to install only gems of the specified groups. Please check carefully if you want to install also gems without a group, because they get put inside default group. For example only test:default will install all gems specified in test group and without one. path ( BUNDLE_PATH ) The location on disk where all gems in your bundle will be located regardless of $GEM_HOME or $GEM_PATH values. Bundle gems not found in this location will be installed by bundle install . When not set, Bundler install by default to a .bundle directory relative to repository root in Bundler 4, and to the default system path ( Gem.dir ) before Bundler 4. That means that before Bundler 4, Bundler shares this location with Rubygems, and gem install ... will have gems installed in the same location and therefore, gems installed without path set will show up by calling gem list . This will not be the case in Bundler 4. path.system ( BUNDLE_PATH__SYSTEM ) Whether Bundler will install gems into the default system path ( Gem.dir ). plugins ( BUNDLE_PLUGINS ) Enable Bundler's experimental plugin system. prefer_patch (BUNDLE_PREFER_PATCH) Prefer updating only to next patch version during updates. Makes bundle update calls equivalent to bundler update --patch . redirect ( BUNDLE_REDIRECT ) The number of redirects allowed for network requests. Defaults to 5 . retry ( BUNDLE_RETRY ) The number of times to retry failed network requests. Defaults to 3 . shebang ( BUNDLE_SHEBANG ) The program name that should be invoked for generated binstubs. Defaults to the ruby install name used to generate the binstub. silence_deprecations ( BUNDLE_SILENCE_DEPRECATIONS ) Whether Bundler should silence deprecation warnings for behavior that will be changed in the next major version. silence_root_warning ( BUNDLE_SILENCE_ROOT_WARNING ) Silence the warning Bundler prints when installing gems as root. simulate_version ( BUNDLE_SIMULATE_VERSION ) The virtual version Bundler should use for activating feature flags. Can be used to simulate all the new functionality that will be enabled in a future major version. ssl_ca_cert ( BUNDLE_SSL_CA_CERT ) Path to a designated CA certificate file or folder containing multiple certificates for trusted CAs in PEM format. ssl_client_cert ( BUNDLE_SSL_CLIENT_CERT ) Path to a designated file containing a X.509 client certificate and key in PEM format. ssl_verify_mode ( BUNDLE_SSL_VERIFY_MODE ) The SSL verification mode Bundler uses when making HTTPS requests. Defaults to verify peer. system_bindir ( BUNDLE_SYSTEM_BINDIR ) The location where RubyGems installs binstubs. Defaults to Gem.bindir . timeout ( BUNDLE_TIMEOUT ) The seconds allowed before timing out for network requests. Defaults to 10 . update_requires_all_flag ( BUNDLE_UPDATE_REQUIRES_ALL_FLAG ) Require passing --all to bundle update when everything should be updated, and disallow passing no options to bundle update . user_agent ( BUNDLE_USER_AGENT ) The custom user agent fragment Bundler includes in API requests. verbose ( BUNDLE_VERBOSE ) Whether Bundler should print verbose output. Defaults to false , unless the --verbose CLI flag is used. version ( BUNDLE_VERSION ) The version of Bundler to use when running under Bundler environment. Defaults to lockfile . You can also specify system or x.y.z . lockfile will use the Bundler version specified in the Gemfile.lock , system will use the system version of Bundler, and x.y.z will use the specified version of Bundler. with ( BUNDLE_WITH ) A space-separated or : -separated list of groups whose gems bundler should install. without ( BUNDLE_WITHOUT ) A space-separated or : -separated list of groups whose gems bundler should not install. Build Options You can use bundle config to give Bundler the flags to pass to the gem installer every time bundler tries to install a particular gem. A very common example, the mysql gem, requires Snow Leopard users to pass configuration flags to gem install to specify where to find the mysql_config executable. gem install mysql -- --with-mysql-config=/usr/local/mysql/bin/mysql_config Since the specific location of that executable can change from machine to machine, you can specify these flags on a per-machine basis. bundle config set --global build.mysql --with-mysql-config=/usr/local/mysql/bin/mysql_config After running this command, every time bundler needs to install the mysql gem, it will pass along the flags you specified. Local Git Repos Bundler also allows you to work against a git repository locally instead of using the remote version. This can be achieved by setting up a local override: bundle config set --local local.GEM_NAME /path/to/local/git/repository For example, in order to use a local Rack repository, a developer could call: bundle config set --local local.rack ~/Work/git/rack Now instead of checking out the remote git repository, the local override will be used. Similar to a path source, every time the local git repository change, changes will be automatically picked up by Bundler. This means a commit in the local git repo will update the revision in the Gemfile.lock to the local git repo revision. This requires the same attention as git submodules. Before pushing to the remote, you need to ensure the local override was pushed, otherwise you may point to a commit that only exists in your local machine. You'll also need to CGI escape your usernames and passwords as well. Bundler does many checks to ensure a developer won't work with invalid references. Particularly, we force a developer to specify a branch in the Gemfile in order to use this feature. If the branch specified in the Gemfile and the current branch in the local git repository do not match, Bundler will abort. This ensures that a developer is always working against the correct branches, and prevents accidental locking to a different branch. Finally, Bundler also ensures that the current revision in the Gemfile.lock exists in the local git repository. By doing this, Bundler forces you to fetch the latest changes in the remotes. Mirrors Of Gem Sources Bundler supports overriding gem sources with mirrors. This allows you to configure rubygems.org as the gem source in your Gemfile while still using your mirror to fetch gems. bundle config set --global mirror.SOURCE_URL MIRROR_URL For example, to use a mirror of https://rubygems.org hosted at https://example.org: bundle config set --global mirror.https://rubygems.org https://example.org Each mirror also provides a fallback timeout setting. If the mirror does not respond within the fallback timeout, Bundler will try to use the original server instead of the mirror. bundle config set --global mirror.SOURCE_URL.fallback_timeout TIMEOUT For example, to fall back to rubygems.org after 3 seconds: bundle config set --global mirror.https://rubygems.org.fallback_timeout 3 The default fallback timeout is 0.1 seconds, but the setting can currently only accept whole seconds (for example, 1, 15, or 30). Credentials For Gem Sources Bundler allows you to configure credentials for any gem source, which allows you to avoid putting secrets into your Gemfile. bundle config set --global SOURCE_HOSTNAME USERNAME:PASSWORD For example, to save the credentials of user claudette for the gem source at gems.longerous.com , you would run: bundle config set --global gems.longerous.com claudette:s00pers3krit Or you can set the credentials as an environment variable like this: export BUNDLE_GEMS__LONGEROUS__COM="claudette:s00pers3krit" For gems with a git source with HTTP(S) URL you can specify credentials like so: bundle config set --global https://github.com/ruby/rubygems.git username:password Or you can set the credentials as an environment variable like so: export BUNDLE_GITHUB__COM=username:password This is especially useful for private repositories on hosts such as GitHub, where you can use personal OAuth tokens: export BUNDLE_GITHUB__COM=abcd0123generatedtoken:x-oauth-basic Note that any configured credentials will be redacted by informative commands such as bundle config list or bundle config get , unless you use the --parseable flag. This is to avoid unintentionally leaking credentials when copy-pasting bundler output. Also note that to guarantee a sane mapping between valid environment variable names and valid host names, bundler makes the following transformations: Any - characters in a host name are mapped to a triple underscore ( ___ ) in the corresponding environment variable. Any . characters in a host name are mapped to a double underscore ( __ ) in the corresponding environment variable. This means that if you have a gem server named my.gem-host.com , you'll need to use the BUNDLE_MY__GEM___HOST__COM variable to configure credentials for it through ENV. Configure Bundler Directories Bundler's home, cache and plugin directories and config file can be configured through environment variables. The default location for Bundler's home directory is ~/.bundle , which all directories inherit from by default. The following outlines the available environment variables and their default values BUNDLE_USER_HOME : $HOME/.bundle BUNDLE_USER_CACHE : $BUNDLE_USER_HOME/cache BUNDLE_USER_CONFIG : $BUNDLE_USER_HOME/config BUNDLE_USER_PLUGIN : $BUNDLE_USER_HOME/plugin Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 v1.14 v1.13 v1.12 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-list.1.html | Bundler: bundle list Bundler Docs Team Blog Repository bundle list bundle-list - List all the gems in the bundle bundle list [--name-only] [--paths] [--without-group=GROUP[ GROUP...]] [--only-group=GROUP[ GROUP...]] Description Prints a list of all the gems in the bundle including their version. Example: bundle list --name-only bundle list --paths bundle list --without-group test bundle list --only-group dev bundle list --only-group dev test --paths bundle list --format json Options --name-only Print only the name of each gem. --paths Print the path to each gem in the bundle. --without-group=<list> A space-separated list of groups of gems to skip during printing. --only-group=<list> A space-separated list of groups of gems to print. --format=FORMAT Format output ('json' is the only supported format) Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://bundler.io/conduct.html | Bundler: RubyGems and Bundler Code of Conduct Bundler Docs Team Blog Repository Code of Conduct RubyGems follows The Ruby Community Conduct Guideline in all “collaborative space”, which is defined as community communications channels (such as mailing lists, submitted patches, commit comments, etc.): Participants will be tolerant of opposing views. Participants must ensure that their language and actions are free of personal attacks and disparaging personal remarks. When interpreting the words and actions of others, participants should always assume good intentions. Behaviour which can be reasonably considered harassment will not be tolerated. If you have any concerns about behaviour within this project, please contact us at conduct@rubygems.org . Guides Bundler in gems Frequently Asked Questions Gemfiles Getting Started How to Upgrade to Bundler 2 How to create a Ruby gem with Bundler How to deploy bundled applications How to install gems from git repositories How to manage application dependencies with Bundler How to manage groups of gems How to package and share code using a Gemfile How to troubleshoot RubyGems and Bundler TLS/SSL Issues How to update gems with Bundler How to use Bundler in a single-file Ruby script How to use Bundler with Docker How to use Bundler with Rails How to use Bundler with Ruby How to use Bundler with RubyMotion How to use Bundler with Sinatra How to use git bisect with Bundler How to write a Bundler plugin Known Plugins Recommended Workflow with Version Control Ruby Directive Why Bundler exists Contributing to Bundler Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/ruby-runtime/ | Ruby Runtime | 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 Usage Ruby Runtime 3.0 3.0 2.5 Edit this Page Ruby Runtime Asciidoctor itself is implemented in Ruby and AsciidoctorJ is a wrapper that encapsulates Asciidoctor in a JRuby runtime. Even though AsciidoctorJ tries to hide as much as possible there are some points that you have to know and consider when using AsciidoctorJ. Every Asciidoctor instance uses and initializes its own Ruby runtime. As booting a Ruby runtime takes a considerable amount of time it is wise to either use a single instance or pool multiple instances in case your program wants to render multiple documents instead of creating one Asciidoctor instance per conversion. Asciidoctor itself is thread-safe, so from this point of view there is no issue in starting only one instance. The JRuby runtime can be configured in numerous ways to change the behavior as well as the performance. As the performance requirements vary between a program that only render a single document and quit and server application that run for a long time you should consider modifying these options for your own use case. AsciidoctorJ itself does not make any configurations so that you can modify like you think. A full overview of the options is available at github.com/jruby/jruby/wiki/ConfiguringJRuby . To change the configuration of the JRuby instance you have to set the corresponding options as system properties before creating the Asciidoctor instance. So to create an Asciidoctor instance for single use that does not try to JIT compile the Ruby code the option compile.mode should be set to OFF . That means that you have to set the system property jruby.compile.mode to OFF : Create an Asciidoctor instance for single use System.setProperty("jruby.compile.mode", "OFF"); Asciidoctor asciidoctor = Asciidoctor.Factory.create(); The default for this value is JIT which is already a reasonable value for multiple uses of the Asciidoctor instance. In case you want to have direct access to the Ruby runtime instance that is used by a certain Asciidoctor instance you can use the class JRubyRuntimeContext to obtain the org.jruby.Ruby instance: Obtaining the Ruby instance associated with an Asciidoctor instance Asciidoctor asciidoctor = Asciidoctor.Factory.create(); Ruby ruby = JRubyRuntimeContext.get(asciidoctor); Converting to EPUB3 Register a Ruby Extension 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:25 |
https://bundler.io/v4.0/man/bundle-help.1.html | Bundler: bundle help Bundler Docs Team Blog Repository bundle help bundle-help - Displays detailed help for each subcommand bundle help [COMMAND] Description Displays detailed help for the given subcommand. You can specify a single COMMAND at the same time. When COMMAND is omitted, help for help command will be displayed. Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 v1.14 v1.13 v1.12 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
http://hackage.haskell.org/package/semigroupoids-1.2.6.1/docs/Data-Functor-Bind-Trans.html | Data.Functor.Bind.Trans 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.Trans Description Synopsis class MonadTrans t => BindTrans t where liftB :: Bind b => b a -> t b a Documentation class MonadTrans t => BindTrans t where Source A subset of monad transformers can transform any Bind as well. Methods liftB :: Bind b => b a -> t b a Source Instances BindTrans IdentityT ( Semigroup w, Monoid w) => BindTrans ( WriterT w) ( Semigroup w, Monoid w) => BindTrans ( WriterT w) BindTrans ( StateT s) BindTrans ( StateT s) BindTrans ( ReaderT e) BindTrans ( ContT r) ( Semigroup w, Monoid w) => BindTrans ( RWST r w s) ( Semigroup w, Monoid w) => BindTrans ( RWST r w s) Produced by Haddock version 2.10.0 | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/pdf-converter/2.2/ | 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 Use Cases Asciidoctor PDF 2.2 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.2 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.2. 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:25 |
https://lists.macports.org/pipermail/macports-dev/2016-December/thread.html#start | The macports-dev December 2016 Archive by thread December 2016 Archives by thread Messages sorted by: [ subject ] [ author ] [ date ] More info on this list... Starting: Thu Dec 1 01:23:36 CET 2016 Ending: Sat Dec 31 20:08:23 CET 2016 Messages: 333 ports using scons build system Ken Cunningham ports using scons build system Lawrence Velázquez ports using scons build system Ryan Schmidt ports using scons build system Ken Cunningham Contributed patches for `port environment` and a more generalised `port info --var` René J.V. Bertin Fwd: Your message to macports-changes awaits moderator approval Zero King Your message to macports-changes awaits moderator approval Mojca Miklavec Your message to macports-changes awaits moderator approval Zero King Your message to macports-changes awaits moderator approval Mojca Miklavec Your message to macports-changes awaits moderator approval Rainer Müller Your message to macports-changes awaits moderator approval Mojca Miklavec Your message to macports-changes awaits moderator approval Rainer Müller Your message to macports-changes awaits moderator approval Rainer Müller Your message to macports-changes awaits moderator approval Ryan Schmidt [macports-contrib] branch master updated: portfile-gen: update python versions Ryan Schmidt Tcl list-related 2.3.4 -> 2.3.5 changes? René J.V. Bertin Tcl list-related 2.3.4 -> 2.3.5 changes? Joshua Root Tcl list-related 2.3.4 -> 2.3.5 changes? Lawrence Velázquez Tcl list-related 2.3.4 -> 2.3.5 changes? René J.V. Bertin [RJVB/macstrop] use github ID for maintainer (2fb8aab) René J.V. Bertin [RJVB/macstrop] use github ID for maintainer (2fb8aab) Rainer Müller [RJVB/macstrop] use github ID for maintainer (2fb8aab) René J.V. Bertin [RJVB/macstrop] use github ID for maintainer (2fb8aab) Rainer Müller [RJVB/macstrop] use github ID for maintainer (2fb8aab) René J.V. Bertin [RJVB/macstrop] use github ID for maintainer (2fb8aab) René J.V. Bertin [RJVB/macstrop] use github ID for maintainer (2fb8aab) Clemens Lang port requires c++1y -> use cxx11 portgroup? Ken Cunningham port requires c++1y -> use cxx11 portgroup? Lawrence Velázquez port requires c++1y -> use cxx11 portgroup? Ken Cunningham port requires c++1y -> use cxx11 portgroup? Brandon Allbery port requires c++1y -> use cxx11 portgroup? Ken Cunningham port requires c++1y -> use cxx11 portgroup? Lawrence Velázquez [macports-ports] branch master updated: pingus: new port submission Lawrence Velázquez [macports-ports] branch master updated: pingus: new port submission Brandon Allbery [macports-ports] branch master updated: pingus: new port submission Ken Cunningham [macports-ports] branch master updated: pingus: new port submission Brandon Allbery [macports-ports] branch master updated: pingus: new port submission Brandon Allbery Review or Commit of #52814 scala2.12 David Strawn [macports-ports] branch master updated: sqlite3: revert to editline Lawrence Velázquez Request for review and/or commit of #52730 Rainer Müller How should ports refer to the 2-clause BSD license? Lawrence Velázquez How should ports refer to the 2-clause BSD license? Ryan Schmidt How should ports refer to the 2-clause BSD license? Lawrence Velázquez How should ports refer to the 2-clause BSD license? Ryan Schmidt PR final steps (to squash or not to squash) René J.V. Bertin PR final steps (to squash or not to squash) Mojca Miklavec PR final steps (to squash or not to squash) René J.V. Bertin PR final steps (to squash or not to squash) Rainer Müller PR final steps (to squash or not to squash) René J.V. Bertin PR final steps (to squash or not to squash) Lawrence Velázquez PR final steps (to squash or not to squash) René J.V. Bertin PR final steps (to squash or not to squash) Rainer Müller PR final steps (to squash or not to squash) René J.V. Bertin PR final steps (to squash or not to squash) Rainer Müller PR final steps (to squash or not to squash) René J.V. Bertin PR final steps (to squash or not to squash) Mojca Miklavec PR final steps (to squash or not to squash) René J.V. Bertin PR final steps (to squash or not to squash) Rainer Müller PR final steps (to squash or not to squash) Lawrence Velázquez Commits that implicitly close PRs do not remember doing so Lawrence Velázquez Commits that implicitly close PRs do not remember doing so Rainer Müller Commits that implicitly close PRs do not remember doing so Joshua Root Commits that implicitly close PRs do not remember doing so Mojca Miklavec Commits that implicitly close PRs do not remember doing so Ryan Schmidt PR final steps (to squash or not to squash) Lawrence Velázquez PR final steps (to squash or not to squash) Lawrence Velázquez PR final steps (to squash or not to squash) Eric A. Borisch PR final steps (to squash or not to squash) Joshua Root PR final steps (to squash or not to squash) Eric A. Borisch PR final steps (to squash or not to squash) Joshua Root PR final steps (to squash or not to squash) Zero King PR final steps (to squash or not to squash) Lawrence Velázquez PR final steps (to squash or not to squash) Rainer Müller tk not building on 10.6.8: #ifdef question in ticket 52090 Davide Liessi [macports-ports] branch master updated: Add myself back as maintainer - I was incorrectly removed in 2007 and just noticed. Ryan Schmidt `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Jeremy Lavergne `port edit`, local/console vs. remote use Rainer Müller `port edit`, local/console vs. remote use Ryan Schmidt `port edit`, local/console vs. remote use Brandon Allbery `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Brandon Allbery `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Brandon Allbery `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Brandon Allbery `port edit`, local/console vs. remote use Clemens Lang `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Clemens Lang `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Rainer Müller `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Rainer Müller `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Rainer Müller `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Brandon Allbery `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Bradley Giesbrecht declaring variants/subports in loops and loop variables René J.V. Bertin declaring variants/subports in loops and loop variables Ryan Schmidt declaring variants/subports in loops and loop variables Joshua Root declaring variants/subports in loops and loop variables Ryan Schmidt declaring variants/subports in loops and loop variables René J.V. Bertin declaring variants/subports in loops and loop variables Brandon Allbery declaring variants/subports in loops and loop variables Gustaf Neumann declaring variants/subports in loops and loop variables René J.V. Bertin declaring variants/subports in loops and loop variables Brandon Allbery declaring variants/subports in loops and loop variables Joshua Root declaring variants/subports in loops and loop variables Brandon Allbery declaring variants/subports in loops and loop variables René J.V. Bertin declaring variants/subports in loops and loop variables Brandon Allbery declaring variants/subports in loops and loop variables René J.V. Bertin declaring variants/subports in loops and loop variables Brandon Allbery declaring variants/subports in loops and loop variables René J.V. Bertin declaring variants/subports in loops and loop variables Brandon Allbery declaring variants/subports in loops and loop variables Joshua Root declaring variants/subports in loops and loop variables René J.V. Bertin Criteria for picking compilers from fallback list ? Chris Jones Criteria for picking compilers from fallback list ? Joshua Root Criteria for picking compilers from fallback list ? Christopher Jones Criteria for picking compilers from fallback list ? Ryan Schmidt Criteria for picking compilers from fallback list ? Christopher Jones Criteria for picking compilers from fallback list ? Jeremy Huddleston Sequoia Criteria for picking compilers from fallback list ? Jeremy Huddleston Sequoia Question about bootstrapping MinGW Mojca Miklavec Question about bootstrapping MinGW Mojca Miklavec Question about bootstrapping MinGW Brandon Allbery Question about bootstrapping MinGW Mojca Miklavec Question about bootstrapping MinGW Brandon Allbery Branching for 2.4 Joshua Root Branching for 2.4 Rainer Müller Branching for 2.4 Joshua Root Branching for 2.4 Joshua Root Branching for 2.4 Rainer Müller Branching for 2.4 Joshua Root Branching for 2.4 Rainer Müller Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Joshua Root Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Clemens Lang Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Clemens Lang Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Mojca Miklavec Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Clemens Lang Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Clemens Lang Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Mojca Miklavec [MacPorts] #53049: gqrx dependency missing Wilhelm Speck [MacPorts] #53049: gqrx dependency missing Michael Dickens [MacPorts] #53049: gqrx dependency missing Ryan Schmidt Tickets affecting multiple ports and committers & "annoying" commits Mojca Miklavec Tickets affecting multiple ports and committers & "annoying" commits Ryan Schmidt Tickets affecting multiple ports and committers & "annoying" commits Mojca Miklavec Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Marko Käning Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Marko Käning Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Marko Käning Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Marko Käning Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Marko Käning [macports-ports] branch master updated: phonon-backend-gstreamer(-qt5): update to 4.9.0 and introduce new subport Lawrence Velázquez [macports-ports] branch master updated: phonon-backend-gstreamer(-qt5): update to 4.9.0 and introduce new subport Marko Käning [macports-ports] branch master updated: phonon-backend-gstreamer(-qt5): update to 4.9.0 and introduce new subport Lawrence Velázquez [macports-ports] branch master updated: phonon-backend-gstreamer(-qt5): update to 4.9.0 and introduce new subport Marko Käning Feature Request: Buildbot triggering dependent port rebuilds in a cascade Marko Käning Feature Request: Buildbot triggering dependent port rebuilds in a cascade Ryan Schmidt Feature Request: Buildbot triggering dependent port rebuilds in a cascade Mojca Miklavec qtcurve update failure René J.V. Bertin qtcurve update failure Mojca Miklavec qtcurve update failure René J.V. Bertin qtcurve update failure Mojca Miklavec qtcurve update failure René J.V. Bertin qtcurve update failure Mojca Miklavec qtcurve update failure René J.V. Bertin qtcurve update failure René J.V. Bertin Best practice for port contributors in github world Luc Bourhis Best practice for port contributors in github world Joshua Root Best practice for port contributors in github world Joshua Root Best practice for port contributors in github world Luc Bourhis Best practice for port contributors in github world Lawrence Velázquez interrupting rev-upgrade with v2.3.5 or a post-v2.3.5 master René J.V. Bertin interrupting rev-upgrade with v2.3.5 or a post-v2.3.5 master Joshua Root interrupting rev-upgrade with v2.3.5 or a post-v2.3.5 master René J.V. Bertin interrupting rev-upgrade with v2.3.5 or a post-v2.3.5 master Joshua Root interrupting rev-upgrade with v2.3.5 or a post-v2.3.5 master René J.V. Bertin Update mono, F#: support "select" Luc Bourhis Update mono, F#: support "select" Mojca Miklavec Update mono, F#: support "select" Luc Bourhis Update mono, F#: support "select" Mojca Miklavec Update mono, F#: support "select" Luc Bourhis Update mono, F#: support "select" Russell Jones Update mono, F#: support "select" Mojca Miklavec Update mono, F#: support "select" Rainer Müller interesting ruby build issue René J.V. Bertin Build Failure: gstreamer1-gst-plugins-bad, mesa, x265 Ryan Schmidt Some Homebrew commands send data to Google Analytics vs. port mpstats Russell Jones Some Homebrew commands send data to Google Analytics vs. port mpstats Joshua Root Some Homebrew commands send data to Google Analytics vs. port mpstats Clemens Lang SSL Issues and PortGroup GitHub John Patrick SSL Issues and PortGroup GitHub Daniel J. Luke SSL Issues and PortGroup GitHub Ryan Schmidt SSL Issues and PortGroup GitHub John Patrick SSL Issues and PortGroup GitHub Ryan Schmidt SSL Issues and PortGroup GitHub John Patrick SSL Issues and PortGroup GitHub Daniel J. Luke SSL Issues and PortGroup GitHub Joshua Root py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Joshua Root py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Marko Käning py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup René J.V. Bertin py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Joshua Root py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup René J.V. Bertin py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Joshua Root py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup René J.V. Bertin py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Joshua Root py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup René J.V. Bertin py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Joshua Root py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup René J.V. Bertin py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Marko Käning py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Joshua Root Requiring a specific variant in depends_lib Akim Demaille Requiring a specific variant in depends_lib Ryan Schmidt Requiring a specific variant in depends_lib Mojca Miklavec uncompressed .tar distfiles René J.V. Bertin uncompressed .tar distfiles Ryan Schmidt uncompressed .tar distfiles René J.V. Bertin [macports-ports] branch master updated: hidapi-devel: new port, version 0.8.0-20160920 Ryan Schmidt [macports-ports] branch master updated: hidapi-devel: new port, version 0.8.0-20160920 Rainer Müller [macports-ports] 02/03: python34: backport patch from #44288. Part of #51939. Maintainer timeout. Ryan Schmidt review request - glbinding - new C++ bindings for OpenGL Ken Cunningham review request - cpplocate - used by glbinding example apps Ken Cunningham Build Failure: cctools, libmacho, libmacho-headers Jeremy Huddleston Sequoia Build Failure: cctools, libmacho, libmacho-headers Rainer Müller mogenerator update [ticket 53019] review request Steven Tondeur mogenerator update [ticket 53019] review request Aljaž 'g5pw' Srebrnič Unintentional double commits Andrea D'Amore Unintentional double commits Rainer Müller Unintentional double commits Mojca Miklavec Unintentional double commits Rainer Müller Unintentional double commits Mojca Miklavec Unintentional double commits Zero King Unintentional double commits Ryan Schmidt Unintentional double commits Mojca Miklavec Unintentional double commits Marko Käning Unintentional double commits Ivan Larionov Unintentional double commits Mojca Miklavec Unintentional double commits Ivan Larionov Unintentional double commits Davide Liessi Unintentional double commits David Bariod A new category of ports: purgatory Mojca Miklavec [macports-ports] branch master updated: grass: jump to 7.2RC2 (dubbed 7.1.99.2) Ryan Schmidt [macports-ports] branch master updated: grass: jump to 7.2RC2 (dubbed 7.1.99.2) Vincent Habchi [macports-ports] branch master updated: grass: jump to 7.2RC2 (dubbed 7.1.99.2) Mojca Miklavec [macports-ports] branch master updated: ocaml-zarith: update to 1.4.1 Ryan Schmidt xonsh-devel broken Marko Käning xonsh-devel broken Daniel J. Luke xonsh-devel broken Marko Käning xonsh-devel broken Andrea D'Amore xonsh-devel broken Daniel J. Luke xonsh-devel broken Joshua Root KDE4 ports not built on Sierra buildbot? Marko Käning KDE4 ports not built on Sierra buildbot? Mojca Miklavec KDE4 ports not built on Sierra buildbot? Marko Käning KDE4 ports not built on Sierra buildbot? Mojca Miklavec KDE4 ports not built on Sierra buildbot? Ryan Schmidt Template for pull requests Mojca Miklavec installing an older version of a port in the github era Ken Cunningham octave: make distributable Marcus Calhoun-Lopez octave: make distributable Joshua Root macports-user repos Bradley Giesbrecht macports-user repos Rainer Müller Mirorring distfiles or enabling libcurl/openssl from MP Mojca Miklavec Mirorring distfiles or enabling libcurl/openssl from MP Rainer Müller Mirorring distfiles or enabling libcurl/openssl from MP Mojca Miklavec Mirorring distfiles or enabling libcurl/openssl from MP Rainer Müller How to properly add -stdlib=... (and other flags)? Mojca Miklavec How to properly add -stdlib=... (and other flags)? Joshua Root tuning the behaviour of the -u option? René J.V. Bertin tuning the behaviour of the -u option? Clemens Lang tuning the behaviour of the -u option? René J.V. Bertin tuning the behaviour of the -u option? René J.V. Bertin [macports-ports] branch master updated: ds9: update to 7.5 Ryan Schmidt [macports-ports] branch master updated: fluid-soundfont, generaluser-soundfont: new ports Ryan Schmidt [macports-ports] branch master updated: fluid-soundfont, generaluser-soundfont: new ports René J.V. Bertin [macports-ports] branch master updated: fluid-soundfont, generaluser-soundfont: new ports Ryan Schmidt [macports-ports] branch master updated: fluid-soundfont, generaluser-soundfont: new ports René J.V. Bertin [macports-ports] branch master updated: fluid-soundfont, generaluser-soundfont: new ports Ryan Schmidt [macports-ports] branch master updated: grass7: add more patches (__unix__ -> __APPLE__) Ryan Schmidt Report from the Reproducible Builds World Summit 2016 Clemens Lang Thanks Thomas de Grivel Pasting with the mouse between tabs does not work (anymore) Mark Anderson installing an older version of a port in the github era -- an answer Ken Cunningham installing an older version of a port in the github era -- an answer Fred Wright installing an older version of a port in the github era -- an answer Joshua Root installing an older version of a port in the github era -- an answer Fred Wright installing an older version of a port in the github era -- an answer Ken Cunningham [macports-ports] branch master updated: gdal-grass: bump to 2.1.0 Ryan Schmidt Central portindex'ing functional at the moment? Marko Käning Central portindex'ing functional at the moment? Marko Käning Central portindex'ing functional at the moment? Mojca Miklavec Central portindex'ing functional at the moment? Marko Käning Central portindex'ing functional at the moment? Marko Käning Central portindex'ing functional at the moment? Mojca Miklavec Central portindex'ing functional at the moment? Marko Käning Central portindex'ing functional at the moment? Fred Wright Guidelines about trac tickets and pull requests Mojca Miklavec Guidelines about trac tickets and pull requests John Patrick Guidelines about trac tickets and pull requests Mojca Miklavec Guidelines about trac tickets and pull requests Arno Hautala Guidelines about trac tickets and pull requests Mojca Miklavec Guidelines about trac tickets and pull requests Ryan Schmidt Packaging an app Vincent Habchi Packaging an app Craig Treleaven Packaging an app Craig Treleaven Best way to fetch/extract sources of a dependency Mojca Miklavec Best way to fetch/extract sources of a dependency Rainer Müller port:libressl vs port:openssl, path-style variants and prebuilt binaries René J.V. Bertin port:libressl vs port:openssl, path-style variants and prebuilt binaries Mojca Miklavec port:libressl vs port:openssl, path-style variants and prebuilt binaries René J.V. Bertin Command line switch to say yes to dependencies? Sterling Smith Command line switch to say yes to dependencies? mf2k at macports.org Command line switch to say yes to dependencies? Joshua Root Command line switch to say yes to dependencies? Clemens Lang [macports-ports] 01/01: Merge branch 'seqan_update' mf2k at macports.org [macports-ports] 01/01: Merge branch 'seqan_update' John Patrick rsync server out of date? Marcus Calhoun-Lopez rsync server out of date? Clemens Lang rsync server out of date? Ryan Schmidt rsync server out of date? Ryan Schmidt Last message date: Sat Dec 31 20:08:23 CET 2016 Archived on: Sat Dec 31 20:08:27 CET 2016 Messages sorted by: [ subject ] [ author ] [ date ] More info on this list... This archive was generated by Pipermail 0.09 (Mailman edition). | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-init.1.html | Bundler: bundle init Bundler Docs Team Blog Repository bundle init bundle-init - Generates a Gemfile into the current working directory bundle init [--gemspec=FILE] Description Init generates a default Gemfile(5) in the current working directory. When adding a Gemfile(5) to a gem with a gemspec, the --gemspec option will automatically add each dependency listed in the gemspec file to the newly created Gemfile(5) . Options --gemspec=GEMSPEC Use the specified .gemspec to create the Gemfile(5) --gemfile=GEMFILE Use the specified name for the gemfile instead of Gemfile Files Included in the default Gemfile(5) generated is the line # frozen_string_literal: true . This is a magic comment supported for the first time in Ruby 2.3. The presence of this line results in all string literals in the file being implicitly frozen. See Also Gemfile(5) Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-lock.1.html | Bundler: bundle lock Bundler Docs Team Blog Repository bundle lock bundle-lock - Creates / Updates a lockfile without installing bundle lock [--update] [--bundler[=BUNDLER]] [--local] [--print] [--lockfile=PATH] [--full-index] [--gemfile=GEMFILE] [--add-checksums] [--add-platform] [--remove-platform] [--normalize-platforms] [--patch] [--minor] [--major] [--pre] [--strict] [--conservative] Description Lock the gems specified in Gemfile. Options --update[=<list>] Ignores the existing lockfile. Resolve then updates lockfile. Taking a list of gems or updating all gems if no list is given. --bundler[=BUNDLER] Update the locked version of bundler to the given version or the latest version if no version is given. --local Do not attempt to connect to rubygems.org . Instead, Bundler will use the gems already present in Rubygems' cache or in vendor/cache . Note that if a appropriate platform-specific gem exists on rubygems.org it will not be found. --print Prints the lockfile to STDOUT instead of writing to the file system. --lockfile=LOCKFILE The path where the lockfile should be written to. --full-index Fall back to using the single-file index of all gems. --gemfile=GEMFILE Use the specified gemfile instead of Gemfile(5) . --add-checksums Add checksums to the lockfile. --add-platform=<list> Add a new platform to the lockfile, re-resolving for the addition of that platform. --remove-platform=<list> Remove a platform from the lockfile. --normalize-platforms Normalize lockfile platforms. --patch If updating, prefer updating only to next patch version. --minor If updating, prefer updating only to next minor version. --major If updating, prefer updating to next major version (default). --pre If updating, always choose the highest allowed version, regardless of prerelease status. --strict If updating, do not allow any gem to be updated past latest --patch | --minor | --major. --conservative If updating, use bundle install conservative update behavior and do not allow shared dependencies to be updated. Updating All Gems If you run bundle lock with --update option without list of gems, bundler will ignore any previously installed gems and resolve all dependencies again based on the latest versions of all gems available in the sources. Updating A List Of Gems Sometimes, you want to update a single gem in the Gemfile (5) , and leave the rest of the gems that you specified locked to the versions in the Gemfile.lock . For instance, you only want to update nokogiri , run bundle lock --update nokogiri . Bundler will update nokogiri and any of its dependencies, but leave the rest of the gems that you specified locked to the versions in the Gemfile.lock . Supporting Other Platforms If you want your bundle to support platforms other than the one you're running locally, you can run bundle lock --add-platform PLATFORM to add PLATFORM to the lockfile, force bundler to re-resolve and consider the new platform when picking gems, all without needing to have a machine that matches PLATFORM handy to install those platform-specific gems on. For a full explanation of gem platforms, see gem help platform . Patch Level Options See bundle update(1) for details. Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 v1.14 v1.13 v1.12 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://bundler.io/blog/2023/01/31/bundler-v2-4.html | Bundler: Bundler v2.4: new resolver, gems with Rust extensions, and more Bundler Docs Team Blog Repository Bundler v2.4: new resolver, gems with Rust extensions, and more by David Rodríguez on Jan 31 2023 2022 has been a busy year for the Bundler team, and we’re glad to present several improvements that we hope will make our users happy :) A better, PubGrub based, resolver Bundler now uses the most advanced algorithm to resolve versions, PubGrub. Kudos to Natalie Weizenbaum for inventing it and to John Hawthorn for porting it to Ruby ! Our previous resolver, Molinillo , worked pretty well, but it really got in the middle when it didn’t. This may sound familiar for some: $ bundle Fetching gem metadata from https://rubygems.org/............ Resolving dependencies....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................^C $ # Ok, that was enough waiting Our new resolver, PubGrub, is usually much faster, because it learns from the resolution conflicts it finds during the resolution process to avoid redoing the same work over and over again. You can find more about this “conflict-driven clause learning” techniques in its presentation blog post back from 2018. Molinillo sometimes took too long to resolve because it would try the same things, backtrack, and run into the same conflicts over and over again, having to traverse very inefficiently a huge search space. But that was a relatively rare case in the real world. What’s probably more common is specifying version requirements in your Gemfile, that can’t be all satisfied at the same time. This is when the version solving problem does not have a solution, and when it becomes crucial to explain to users why , so that they can fix their set of version requirements to become solvable. Molinillo run into trouble here, and in cases with many moving parts, like upgrading Rails for example, it could end up printing a lot of conflicts, not easy to understand and solve. This is an old example from a public ticket: Bundler could not find compatible versions for gem "actionpack": In Gemfile: inherited_resources (= 1.6.0) was resolved to 1.6.0, which depends on actionpack (>= 3.2, < 5) rails (= 4.2.0) was resolved to 4.2.0, which depends on actionpack (= 4.2.0) Bundler could not find compatible versions for gem "activesupport": In Gemfile: inherited_resources (= 1.6.0) was resolved to 1.6.0, which depends on has_scope (~> 0.6.0.rc) was resolved to 0.6.0, which depends on activesupport (>= 3.2, < 5) rails (= 4.2.0) was resolved to 4.2.0, which depends on activesupport (= 4.2.0) Bundler could not find compatible versions for gem "railties": In Gemfile: inherited_resources (= 1.6.0) was resolved to 1.6.0, which depends on railties (>= 3.2, < 5) rails (= 4.2.0) was resolved to 4.2.0, which depends on railties (= 4.2.0) inherited_resources (= 1.6.0) was resolved to 1.6.0, which depends on responders was resolved to 1.1.2, which depends on railties (>= 3.2, < 4.2) Not easy to know what to do about it. With PubGrub, you should now get human-readable explanations of failures. The most complex cases may are still, well… complex. But explanations should always make sense and point to the root cause of resolution failures. Here’s an example from our test suite: Because every version of c depends on a < 1 and every version of b depends on a >= 2, every version of c is incompatible with b >= 0. So, because Gemfile depends on b >= 0 and Gemfile depends on c >= 0, version solving has failed. We tried to make this migration as backwards-compatible as possible, but there’s a chance of experiencing some different solutions to the ones found by Molinillo, since the version solving problem does not have unique solutions. Please report any issues you find with the new resolver. Easily generate gems with Rust extensions using bundle gem It’s now easier than ever to get started using Rust inside your gems. Check out this blog post to learn how to generate a gem with all the boilerplate necessary with just a few commands. Faster git sources In the Bundler world, it’s common to point to git repositories when there’s no version released to rubygems.org that includes the changes that you need. This works fine, but it can get slow and use a lot of disk space when dealing with very big repositories. We have improved the way we clone these repositories to be faster and use less disk space. For example, something like gem "rails", github: "rails/rails" in your Gemfile could previously take ~30s and use up to 1Gb of disk space, because we would clone the full Rails repository, which has a large history. Now we just clone what’s strictly necessary for Bundler to work, resulting in big disk space savings, and much faster bundling. New CLI features We added a few small CLI features, such as a new --pre flag to bundle update and bundle lock to explicitly opt-in to prereleases of selected (of all) gems without having to explictly change your Gemfile with pre-release requirements such as >= 7.1.0.beta . Some minor breaking changes We took new year’s release to move on and get rid of some stuff that was causing maintenance burden for us: Ruby 2.3, 2.4, and 2.5 are no longer supported. RubyGems 2.5, 2.6, and 2.7 are no longer supported. In general, this support drop should not break anything because RubyGems should be able to choose the latest supported Bundler on the Ruby version that you’re using. But there are still some old RubyGems out there that don’t have this feature, and the gem install bundler command could break there. We have warned using Bundler on those old rubies for a year now, so we believe it’s time to move on. We also completely removed a controversial (mis-)feature from the Bundler code base, where Bundler would automatically acquire sudo permissions when not having the proper access rights. A great majority of users considered this feature harmful and hardly useful, so we decided to get rid of it. And bug fixes As always, we continue to smooth the experience of using Bundler, so that it gets the job done and does not get in the middle other than that. And we’re also shipping a bunch of bug fixes to keep moving towards that goal. That’s all from the Bundler team. Have a happy new year, and enjoy using Bundler 2.4! 🎉 Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/pdf-converter/2.1/ | 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 Use Cases Asciidoctor PDF 2.1 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.1 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.1. 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:25 |
https://bundler.io/v4.0/man/bundle-platform.1.html | Bundler: bundle platform Bundler Docs Team Blog Repository bundle platform bundle-platform - Displays platform compatibility information bundle platform [--ruby] Description platform displays information from your Gemfile, Gemfile.lock, and Ruby VM about your platform. For instance, using this Gemfile (5) : source "https://rubygems.org" ruby "3.1.2" gem "rack" If you run bundle platform on Ruby 3.1.2, it displays the following output: Your platform is: x86_64-linux Your app has gems that work on these platforms: * arm64-darwin-21 * ruby * x64-mingw-ucrt * x86_64-linux Your Gemfile specifies a Ruby version requirement: * ruby 3.1.2 Your current platform satisfies the Ruby version requirement. platform lists all the platforms in your Gemfile.lock as well as the ruby directive if applicable from your Gemfile (5) . It also lets you know if the ruby directive requirement has been met. If ruby directive doesn't match the running Ruby VM, it tells you what part does not. Options --ruby It will display the ruby directive information, so you don't have to parse it from the Gemfile (5) . See Also bundle-lock(1) Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 v1.14 v1.13 v1.12 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://lists.reproducible-builds.org/listinfo/diffoscope | diffoscope Info Page diffoscope -- diffoscope users and developers About diffoscope English (USA) diffoscope: in-depth comparison of files, archives, and directories diffoscope will try to get to the bottom of what makes files or directories different. It will recursively unpack archives of many kinds and transform various binary formats into more human readable form to compare them. It can compare two tarballs, ISO images, or PDF just as easily. This mailing-list is a common place to discuss diffoscope amongst users and developers. Patches are highly welcome! To see the collection of prior postings to the list, visit the diffoscope Archives . Using diffoscope To post a message to all the list members, send email to diffoscope@lists.reproducible-builds.org . You can subscribe to the list, or change your existing subscription, in the sections below. Subscribing to diffoscope Subscribe to diffoscope by filling out the following form. You will be sent email requesting confirmation, to prevent others from gratuitously subscribing you. This is a private list, which means that the list of members is not available to non-members. Your email address: Your name (optional): You may enter a privacy password below. This provides only mild security, but should prevent others from messing with your subscription. Do not use a valuable password as it will occasionally be emailed back to you in cleartext. If you choose not to enter a password, one will be automatically generated for you, and it will be sent to you once you've confirmed your subscription. You can always request a mail-back of your password when you edit your personal options. Pick a password: Reenter password to confirm: Which language do you prefer to display your messages? English (USA) Would you like to receive list mail batched in a daily digest? No Yes --> diffoscope Subscribers ( The subscribers list is only available to the list members. ) Enter your address and password to visit the subscribers list: Address: Password: To unsubscribe from diffoscope, get a password reminder, or change your subscription options enter your subscription email address: If you leave the field blank, you will be prompted for your email address diffoscope list run by diffoscope-owner at lists.reproducible-builds.org diffoscope administrative interface (requires authorization) Overview of all lists.reproducible-builds.org mailing lists version 2.1.29 | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/syntax-highlighting/implement-adapter/ | Implement a Syntax Highlighter Adapter | 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 Implement a Syntax Highlighter Adapter 3.0 3.0 2.5 Edit this Page Implement a Syntax Highlighter Adapter A syntax highlighter must implement the interface org.asciidoctor.syntaxhighlighter.SyntaxHighlighterAdapter . This has to be registered at the Asciidoctor instance, so that it can be used by using the corresponding value for the attribute :source-highlighter . A SyntaxHighlighterAdapter must implement methods to add stylesheets and scripts to the resulting HTML document. This is considered as a core functionality that every syntax highlighter requires. The following example shows a very simplistic syntax highlighter that uses highlight.js : import org.asciidoctor.extension.LocationType; import org.asciidoctor.syntaxhighlighter.SyntaxHighlighterAdapter; import java.util.Map; public class HighlightJsHighlighter implements SyntaxHighlighterAdapter { (1) @Override public boolean hasDocInfo(LocationType location) { return location == LocationType.FOOTER; (2) } @Override public String getDocinfo(LocationType location, Document document, Map<String, Object> options) { (3) return "<link rel=\"stylesheet\" href=\"https://cdnjs.cloudflare.com/ajax/libs/highlight.js/9.15.6/styles/github.min.css\">\n" + "<script src=\"https://cdnjs.cloudflare.com/ajax/libs/highlight.js/9.15.6/highlight.min.js\"></script>\n" + "<script>hljs.initHighlighting()</script>"; } } 1 Every syntax highlighter must implement the interface org.asciidoctor.syntaxhighlighter.SyntaxHighlighterAdapter . 2 The method hasDocInfo indicates that this highlighter only wants to add DocInfo to the footer of the document. 3 The method getDocInfo is only called to return the DocInfo for the footer of the document. It returns references to the required css and js sources and starts highlight.js. Let’s say we want to convert this document: sources.adoc = Syntax Highlighter Test == Some sources [source,java] ---- public static class Test { public static void main(String[] args) { System.out.println("Hello World"); } } ---- Now this document can be converted using our highlighter after registering it with Asciidoctor: File sources_adoc = //... asciidoctor.syntaxHighlighterRegistry() .register(HighlightJsHighlighter.class, "myhighlightjs"); (1) String result = asciidoctor.convertFile(sources_adoc, Options.builder() .standalone(true) (2) .toFile(false) .attributes(Attributes.builder().sourceHighlighter("myhighlightjs").build()) (3) .build()); assertThat(result, containsString("<script>hljs.initHighlighting()</script>")); 1 Register the adapter class using a well defined name. 2 Docinfo is only written if the document is converted with the option :header_footer . 3 The well defined name that was used to register the syntax highlighter must be used in the attribute :source-highlighter . Syntax Highlighter API Lifecycle of a SyntaxHighlighterAdapter 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:25 |
https://ftp.debian.org/debian/dists/?C=N;O=D | Index of /debian/dists Index of /debian/dists Name Last modified Size Parent Directory - unstable/ 2023-06-11 14:09 - trixie/ 2026-01-10 10:08 - trixie-updates/ 2023-06-11 14:09 - trixie-proposed-updates/ 2026-01-11 23:17 - trixie-backports/ 2023-06-11 14:09 - trixie-backports-sloppy/ 2025-08-09 12:48 - testing/ 2026-01-13 04:13 - testing-updates/ 2025-08-09 12:48 - testing-proposed-updates/ 2025-08-09 12:48 - testing-backports/ 2025-08-09 12:48 - stable/ 2026-01-10 10:08 - stable-updates/ 2023-06-11 14:09 - stable-backports/ 2023-06-11 14:09 - stable-backports-sloppy/ 2025-08-09 12:48 - sid/ 2023-06-11 14:09 - rc-buggy/ 2023-06-11 14:09 - proposed-updates/ 2026-01-11 23:17 - oldstable/ 2026-01-10 22:34 - oldstable-updates/ 2023-06-11 14:09 - oldstable-proposed-updates/ 2026-01-10 17:32 - oldstable-backports/ 2023-06-11 14:09 - oldstable-backports-sloppy/ 2023-06-11 14:09 - oldoldstable/ 2025-08-09 21:16 - oldoldstable-updates/ 2023-06-11 14:09 - oldoldstable-proposed-updates/ 2024-08-31 11:29 - forky/ 2026-01-13 04:13 - forky-updates/ 2025-08-09 12:48 - forky-proposed-updates/ 2025-08-09 12:48 - forky-backports/ 2025-08-09 12:48 - experimental/ 2023-06-11 14:09 - bullseye/ 2025-08-09 21:16 - bullseye-updates/ 2023-06-11 14:09 - bullseye-proposed-updates/ 2024-08-31 11:29 - bookworm/ 2026-01-10 22:34 - bookworm-updates/ 2023-06-11 14:09 - bookworm-proposed-updates/ 2026-01-10 17:32 - bookworm-backports/ 2023-06-11 14:09 - bookworm-backports-sloppy/ 2023-06-11 14:09 - README 2026-01-10 11:03 936 Debian13.3/ 2026-01-10 10:08 - Debian12.13/ 2026-01-10 22:34 - Debian11.11/ 2025-08-09 21:16 - Apache Server at ftp.debian.org Port 80 | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-check.1.html | Bundler: bundle check Bundler Docs Team Blog Repository bundle check bundle-check - Verifies if dependencies are satisfied by installed gems bundle check [--dry-run] [--gemfile=FILE] Description check searches the local machine for each of the gems requested in the Gemfile. If all gems are found, Bundler prints a success message and exits with a status of 0. If not, the first missing gem is listed and Bundler exits status 1. If the lockfile needs to be updated then it will be resolved using the gems installed on the local machine, if they satisfy the requirements. Options --dry-run Locks the Gemfile(5) before running the command. --gemfile=GEMFILE Use the specified gemfile instead of the Gemfile(5) . Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-open.1.html | Bundler: bundle open Bundler Docs Team Blog Repository bundle open bundle-open - Opens the source directory for a gem in your bundle bundle open [GEM] [--path=PATH] Description Opens the source directory of the provided GEM in your editor. For this to work the EDITOR or BUNDLER_EDITOR environment variable has to be set. Example: bundle open 'rack' Will open the source directory for the 'rack' gem in your bundle. bundle open 'rack' --path 'README.md' Will open the README.md file of the 'rack' gem source in your bundle. Options --path[=PATH] Specify GEM source relative path to open. Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctor/latest/install/macos/ | Install on macOS | 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 on macOS Edit this Page Install on macOS Homebrew Install 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. 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) Upgrade To upgrade the gem, open a terminal and type: $ brew update $ brew upgrade asciidoctor Uninstall To uninstall the gem, open a terminal and type: $ brew uninstall asciidoctor 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 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) Upgrade To upgrade the gem, open a terminal and type: $ sudo port selfupdate $ sudo port upgrade asciidoctor Uninstall To uninstall the gem, open a terminal and type: $ sudo port uninstall asciidoctor Install Using Linux Packaging Install on Windows 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:25 |
https://bundler.io/blog/2024/12/19/bundler-v2-6.html | Bundler: Bundler v2.6: lockfile checksums are finally there Bundler Docs Team Blog Repository Bundler v2.6: lockfile checksums are finally there by David Rodríguez on Dec 19 2024 We’re happy to announce Bundler 2.6, featuring gem checksum verification, right in the Gemfile.lock file. This feature has actually been implemented for more than a year. However, it was merged very close to the Bundler 2.5 release and we did not yet have a good plan for enabling the feature in a graceful manner, so we’ve kept it hidden until now. Bundler 2.6 finally officially allows to opt-in into this beta feature. What’s this feature for? A lockfile is an easy way to ensure all environments will use a consistent version of every dependency. However, Bundler lockfiles did not protect from potential tampering of the sources of that specific version. This is what the this feature does. When enabled, Bundler will keep track of the checksum of every version in the lockfile, in the lockfile itself. Then, before installing that lockfile on any machine, it will verify that the checksum of the .gem file it’s about to install matches the checksum previously recorded in the lockfile. If they don’t match, Bundler will refuse to install that package and consider it compromised. How to enable lockfile checksums? Bundler 2.6 provides two ways of enabling checksums. For a single lockfile, you can run bundle lock --add-checksums . This will add a new CHECKSUMS section to the lockfile that Bundler will keep up to date. To configure Bundler to always include checksums in new lockfiles, run bundle config lockfile_checksums true . How does it work, once the feature is enabled? Hopefully nothing will ever change for you after enabling the feature. However, if bundle install ever downloads a package (or tries to install it from cache) the checksum of which does not match what’s recorded in the lockfile for that package, Bundler will print an error like the following and abort installation: $ bundle install Fetching gem metadata from https://rubygems.org/........ Bundler found mismatched checksums. This is a potential security risk. rake (13.2.1) sha256=46cb38dae65d7d74b6020a4ac9d48afed8eb8149c040eccf0523bec91907059d from the lockfile CHECKSUMS at Gemfile.lock:1241:17 and the API at https://rubygems.org/ rake (13.2.1) sha256=17e8b7c1b247f3349d4a7160c3f587b6c7fd67cf7be3b3710e118b8416f94ddb from the gem at /my/repo/vendor/cache/rake-13.2.1.gem If you trust the lockfile CHECKSUMS at Gemfile.lock:1241:17, to resolve this issue you can: 1. remove the gem at /my/repo/vendor/cache/rake-13.2.1.gem 2. run `bundle install` To ignore checksum security warnings, disable checksum validation with `bundle config set --local disable_checksum_validation true` Compatibility Bundler will keep the CHECKSUMS section in the lockfile up to date if it’s already there, and verify that .gem packages checksums match what’s recorded in the lockfile before installing. On the other hand, Bundler will work like before if it doesn’t find a CHECKSUMS section in the lockfile. All lockfiles including a CHECKUMS section should have Bundler >= 2.6 in the BUNDLED WITH section. Since Bundler internally has a mechanism to make sure it switches to the version of itself included in the BUNDLED WITH lockfile section, a lockfile with a CHECKSUMS section should always be run by Bundler >= 2.6. Some platforms, like Heroku or Dependabot, don’t respect this auto-switching mechanism. However, these platforms are already using Bundler >= 2.5 and since this feature is luckily already present (but hidden) since Bundler 2.5, they should deal just fine with new lockfiles including the new section. Should I take any other steps before enabling this feature? If your lockfile only includes ruby in the PLATFORMS section, that means that Bundler is most likely not storing platform-specific variants of your gems in the Gemfile.lock file. For example, your lockfile may include only nokogiri-1.18.0 , while Bundler will actually install the most appropriate 1.18.0 variant for your platform, say nokogiri-1.18.0-x86_64-linux . However, that makes the lockfile checksums feature not work fine for nokigiri because Bundler will only check if the generic variant (what’s in the lockfile) is changed, but not the variant that’s actually installed. Because of this, Bundler 2.6 will print a warning when it ends up installing a different variant than the one included in the lockfile, and tell you to “normalize” the lockfile and add platform specific variants through bundle lock --normalize-platforms . Other notable changes in Bundler 2.6 This is a non-exhaustive list of other notable improvements in Bundler 2.6: Better support for switching between different versions of Ruby. Sometimes when switching between different Ruby versions, even if the resolution recorded in the Gemfile.lock is stable, the most optimal platform-specific version for a gem may change. For example, nokogiri-1.18.0.rc1-x86_64-darwin does not support Ruby 3.5, but nokogiri-1.18.0.rc1 does. Bundler 2.6 should be able to keep a consistent lockfile with all platform-specific variants, and use the one that works best for each Ruby version. Better handling of git dependencies in application caches. Bundler can keep .gem packages for your dependencies in vendor/cache so that, for example, they can be installed offline on a different machine. This did not work fine for git gems, though. Bundler 2.6 should now allow properly caching git gems in vendor/cache . You can enable this with bundle config cache_all true . More careful redaction of gem server credentials in logs and bundle config output. Bundler already did this but we found a few cases where it was not properly redacting sensitive info and fixed those. Better bundle exec behaviour on Windows. We have introduced several improvements so that bundle exec works the usual way, also on Windows. Better documentation of commands and CLI flags. We have introduced changes to make sure that this site, and the bundle CLI, properly documents all commands and CLI flags, and made sure it will stay like that going forward. And like always, many other bug fixes and improvements were implemented. Check the full Bundler 2.6 changelog for details. Happy bundling! Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://pvp.haskell.org/ | Haskell PVP Specification PVP.haskell.org [ Specification ] [ FAQ ] Haskell Package Versioning Policy 🔗 Rationale 🔗 The goal of a versioning system is to inform clients of a package of changes to that package that might affect them, and to provide a way for clients to specify a particular version or range of versions of a dependency that they are compatible with. Cabal provides the raw materials for versioning: it allows packages to specify their own version, and it allows dependencies that specify which versions of the dependent package are acceptable. Cabal will select dependencies based on the constraints. What is missing from this picture is a policy that tells the library developer how to set their version numbers, and tells a client how to write a dependency that means their package will not try to compile against an incompatible dependency. For some time there has been an informal policy in use in the Haskell community, but it became clear that we were running into trouble with incorrectly-specified dependencies and unbuildable packages, so this page is an attempt to formalize the policy. Version numbers 🔗 The key words “MUST”, “MUST NOT”, “REQUIRED”, “SHALL”, “SHALL NOT”, “SHOULD”, “SHOULD NOT”, “RECOMMENDED”, “MAY”, and “OPTIONAL” in this document are to be interpreted as described in RFC 2119 . A package version number SHOULD have the form A.B.C , and MAY optionally have any number of additional components, for example 2.1.0.4 (in this case, A =2, B =1, C=0 ). This policy defines the meaning of the first three components A-C , the other components can be used in any way the package maintainer sees fit. Version number ordering is already defined by Cabal as the lexicographic ordering of the components. For example, 2.0.1 > 1.3.2, and 2.0.1.0 > 2.0.1. (The Data.Version.Version type and its Ord instance embody this ordering). A.B is known as the major version number, and C the minor version number. When a package is updated, the following rules govern how the version number must change relative to the previous version: Breaking change . If any entity was removed, or the types of any entities or the definitions of datatypes or classes were changed, or orphan instances were added or any instances were removed, then the new A.B MUST be greater than the previous A.B . Note that modifying imports or depending on a newer version of another package may cause extra orphan instances to be exported and thus force a major version change. Non-breaking change . Otherwise, if only new bindings, types, classes, non-orphan instances or modules (but see below) were added to the interface, then A.B MAY remain the same but the new C MUST be greater than the old C . Note that modifying imports or depending on a newer version of another package may cause extra non-orphan instances to be exported and thus force a minor version change. Other changes . Otherwise, e.g. if change consist only of corrected documentation, non-visible change to allow different dependency range etc. A.B.C MAY remain the same (other version components may change). Client specification . Hence A.B.C uniquely identifies the API. A client that wants to specify that they depend on a particular version of the API can specify a particular A.B.C and be sure of getting that API only. For example, build-depends: mypkg >= 2.1.1 && < 2.1.2 . Backwards compatible client specification . Often a package maintainer wants to add to an API without breaking backwards compatibility, and in that case they can follow the rules of point 2, and increase only C . A client MAY specify that they are insensitive to additions to the API by allowing a range of C values, e.g. build-depends: base >= 2.1.1 && < 2.2 . Client defines orphan instance . If a package defines an orphan instance, it MUST depend on the minor version of the packages that define the data type and the type class to be backwards compatible. For example, build-depends: mypkg >= 2.1.1 && < 2.1.2 . Deprecation . Deprecated entities (via a DEPRECATED pragma) SHOULD be counted as removed for the purposes of upgrading the API, because packages that use -Werror will be broken by the deprecation. In other words the new A.B SHOULD be greater than the previous A.B . Adding new modules . Adding new modules might cause an unavoidable name collision in dependent code. However, this is usually pretty unlikely, especially if you keep to your own namespace, so only an increase of the minor version number is required, in other words A.B MAY remain the same the new C MUST be greater than the old C . If, however, your added module name is taken from another package (e.g. when network-bytestring was merged into network ) or is quite general ( Data.Set or something similar) then the version increase SHOULD be major. Special situations 🔗 Leaking instances 🔗 There is a case where addition or removal of an instance in a package that the user doesn’t depend on directly can still lead to compilation failures. Consider these three packages: Package A: module PackageA where class Monad m => MonadLogger m instance MonadLogger IO Package B, depends on package A: module PackageB where import PackageA f :: MonadLogger m => Int -> m String f = return . show Package C, depends on package B: module Package C where import PackageB main :: IO () main = f 5 >>= print Now consider this scenario: Package A removes the IO instance and gets its major version number bumped, as required by the PVP. Package B, which can still work with the old and new version of package A, changes its dependency on package A to allow for both versions. Package B only gets a patch-level bump. Package C might or might not compile, depending on which patch-level version of package B is used. The PVP could require that package B must bump its major version number as it now (re-)exports one fewer instances. This will however require more frequent version bumps in the whole ecosystem. As a pragmatic solution, for now the PVP doesn’t required a major version bump in this case and instead leaves it to package C to add a dependency on package A to handle this situation. Version tags 🔗 The components of the version number MUST be numbers! Historically Cabal supported version numbers with string tags at the end, e.g. 1.0-beta This proved not to work well because the ordering for tags was not well defined. Version tags are no longer supported and mostly ignored, however some tools will fail in some circumstances if they encounter them. This can sometimes trip you up if you accidentally stumble into using the deprecated tags syntax without realising it, for example a version number with a date like 1.0.2014-01-27 would be interpreted as the version 1.0.2014 with tags 01 and 27 . Decision Tree 🔗 The (incomplete!) decision tree summarises the PVP rules in a concise form Dependencies in Cabal 🔗 When publishing a Cabal package, you SHALL ensure that your dependencies in the build-depends field are accurate. This means specifying not only lower bounds, but also upper bounds on every dependency. At some point in the future, Hackage may refuse to accept packages that do not follow this convention. The aim is that before this happens, we will put in place tool support that makes it easier to follow the convention and less painful when dependencies are updated. To minimize breakage when new package versions are released, you can use dependencies that are insensitive to minor version changes (e.g. foo >= 1.2.1 && < 1.3 ). However, note that this approach is slightly risky: when a package exports more things than before, there is a chance that your code will fail to compile due to new name-clash errors. The risk from new name clashes may be small, but you are on the safe side if you import identifiers explicitly or using qualification . Version syntax 🔗 Since Cabal 1.6, you can specify an exact API version according to this policy with the special syntax package == 1.1.4.* or an API version up to additions with package == 1.1.* . The former translates into package >= 1.1.4 && < 1.1.5 , for example - notice that 1.1.4 is included, rather than just including 1.1.4.0. Tools 🔗 script to check for API changes in gtk2hs: http://code.haskell.org/gtk2hs/tools/apidiff/ precis - a simple tool for a first approximation of package API differences, see the announcement check-pvp is a program that checks for consistency between package dependencies and import style. Related 🔗 Sven Moritz Hallberg, “ Eternal compatibility in theory ,” The Monad.Reader , Issue 2 Semantic Versioning (SemVer) specifies a versioning scheme sharing similiarities with the PVP; but it also differs significantly in some aspects. For more details, consult the PVP↔SemVer FAQ section . If you'd like suggest changes, please open an issue on GitHub . | 2026-01-13T09:30:25 |
https://rubygems.org/gems/capybara-restore_state | capybara-restore_state | 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 capybara-restore_state 1.0.1 capybara-restore_state offers the ability to execute a block where the initial capybara state on entering the block is returned after the block is executed. This makes it possible to test things like clicking on the same button twice. Gemfile: = install: = Versions: 1.0.1 June 21, 2022 (6 KB) 1.0.0 May 25, 2016 (6.5 KB) Runtime Dependencies (2): capybara >= 2.1.0 rack-test >= 0.6 Development Dependencies (1): minitest-global_expectations >= 0 Show all transitive dependencies Owners: Pushed by: Authors: Jeremy Evans SHA 256 checksum: = ← Previous version Total downloads 14,462 For this version 2,057 Version Released: June 21, 2022 8:35pm License: MIT Required Ruby Version: >= 0 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:25 |
https://docs.asciidoctor.org/asciidoctor/latest/features/ | Features | 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 Features Edit this Page Features This page highlights the features of Asciidoctor that make it a great choice for processing and publishing your AsciiDoc content. Readily available with no dependencies Asciidoctor is written in Ruby, which means it must be run on a Ruby language runtime (including JRuby). But that’s its only requirement. Asciidoctor is packaged and distributed as a gem named asciidoctor to the package repository at RubyGems.org . The gem can be installed on any operating system that Ruby supports using Ruby’s package management tools (gem or bundle). Asciidoctor itself has no dependencies. But what if you aren’t familiar with Ruby or, for whatever reason, prefer not to install it? No problem! Thanks to AsciidoctorJ and Asciidoctor.js , you can run the same exact version of Asciidoctor on a Java Virtual Machine (JVM) or JavaScript runtime, respectively. That means you don’t need a Ruby runtime installed on your machine after all. AsciidoctorJ uses JRuby internally, whereas Asciidoctor.js relies on a Ruby-like runtime written in JavaScript. Whether you’re working in Ruby, Java, or JavaScript, Asciidoctor is readily available for you to start using. Only when you get into add-on converters and extensions do you need to install dependencies. Quick wins Asciidoctor provides a nice out-of-the-box HTML experience , complete with a default stylesheet and built-in integrations like Font Awesome (for icons), Highlight.js (for source highlighting), and MathJax (for STEM processing). When you’re just getting into using AsciiDoc for writing, Asciidoctor’s HTML output should be sufficient for all of your publishing needs. The following before and after picture gives you an idea of what to expect: If you’re looking for more advanced output, or you have an existing DocBook toolchain in place, you can instead convert to DocBook and feed the result into that pipeline. Once you get more familiar with AsciiDoc and Asciidoctor, you can explore customizing the built-in converter using templates or using add-on converters to produce other output formats such as PDF and EPUB 3. So there is plenty of room to grow. Built-in and add-on converters Asciidoctor provides converters for three output formats by default: HTML 5 , DocBook 5 , and man page (short for manual page). These converters are designed to cover a majority of users’ needs for basic preview and publishing. The HTML converter provides a result you can publish to the web straight away without any tweaking. The DocBook converter allows you to leverage an existing publishing toolchain or migrate the content to a different authoring format (without the tool needing to know how to parse AsciiDoc). The man page converter drastically lowers the barrier to making system help files. But it doesn’t end there. The converter interface in Asciidoctor is an extension point. That means it can be used to create converters for any output format imaginable. And there’s an ecosystem of additional converters already available in the Asciidoctor project. You can find converters for creating PDF , EPUB 3 , Reveal.js slides , and more from AsciiDoc. Asciidoctor also provides advanced docinfo support for injecting colophon (such as content scripts) into the header and footer of the output file. A single input format, AsciiDoc, gains you a plethora of output formats. Custom converter or templates While Asciidoctor provides a built-in converter for producing publish-ready HTML, all the HTML that Asciidoctor generates can be changed. There are two ways to modify the HTML that Asciidoctor produces: a custom converter or converter templates. If you’re an experienced programmer, you may lean towards the custom converter . You can extend the built-in HTML converter and override the methods that handle the conversion for any node in the document tree. If your expertise is more on the technical writing side, you may find the converter templates to be more approachable. The templates can be written in any template language supported by the Tilt template abstraction library, such as ERB, Haml, or Slim. These templates augment the built-in converter by replacing the processing for a node in the document. You introduce one template for each type of node for which you want to control conversion. Templates allow you to apply logic around chunks of HTML (or HTML-like) markup. Just know that if the HTML that Asciidoctor produces isn’t working for you, you can change it. Syntax highlighting If you’re writing technical documentation that presents snippets of source code or configuration, you can enhance the display of those source blocks using syntax highlighting (aka source highlighting). Syntax highlighting is the practice of colorizing (or otherwise emphasizing) keywords and syntax elements in a structured programming or configuration language. Here’s an example to give you an idea: phrase = "I love AsciiDoc" puts phrase # now say it like you mean it 5.times { puts %(#{phrase}!) } Asciidoctor provides adapters for several popular syntax highlighters, including Rouge and Highlight.js. Aside from installing the library (if necessary), all you need to do is set a document attribute on your document and Asciidoctor will handle the rest. From there, you can configure the behavior of the syntax highlighter, such as changing the style/theme, enabling line numbers, and block highlighting select lines. Multiple interfaces: CLI and API Asciidoctor offers two interfaces for processing AsciiDoc content: a commandline interface (CLI) and an application programming interface (API). The CLI is designed as a simple tool for non-programmers who want to convert AsciiDoc without having to write a program or for converting content in an automated environment such as CI. Many of the processing options are accessible from the CLI using option flags. When you’re first starting out with Asciidoctor, you’ll most likely interact with it via the CLI. Although the CLI itself does not require any programming, it can still load extension code that augments processing. If you’re migrating from AsciiDoc.py, the asciidoctor CLI is a drop-in replacement for the asciidoc CLI. The API is designed for programmers who want to take their AsciiDoc processing further. Like with the CLI, you can use the API to convert documents. But it’s not all about conversion to an output format. Asciidoctor parses and converts the source document in discrete steps. This makes conversion optional and gives programs the opportunity to extract, add, or replace content in the document by interacting with the document object model. Or you may want to leverage the ability to convert to an embedded document for integrating with other applications, such as a static site generator. The API also provides an extension SPI that you can use to augment the processor, such as to introduce new syntax, mutate the parsed document before conversion, or tweak the output after conversion. The API is written in Ruby, but also accessible from JVM languages or JavaScript when using AsciidoctorJ or Asciidoctor.js, respectively. Both the CLI and API have the ability to process both AsciiDoc files and AsciiDoc source passed in as a string. Impressive performance and strong security No coverage of Asciidoctor would be complete without mention of its speed. Asciidoctor is about as fast as any program that runs in Ruby can be. It can load, parse, and convert a 100K AsciiDoc document in about a tenth of a second (~ 1MB/s). That’s more than 100x as fast as AsciiDoc.py, the original AsciiDoc implementation. Asciidoctor’s speed is good news for developer productivity and good news for server-side applications that need to convert AsciiDoc markup. It also means that preview tools like the browser extension can present a preview of the AsciiDoc content in HTML in near real time. Asciidoctor also has the ability to run securely by offering several security (aka safe) modes . By using one of these safe modes, you don’t have to worry about the processor accessing sensitive files or even the file system in highly secure environments. In addition to its performance, these security levels make Asciidoctor well-suited for server-side deployments. Access to an ecosystem of extensions and tools Installing Asciidoctor is just the beginning of your publishing experience. Asciidoctor gives you access to a healthy ecosystem of extensions and tools , ranging from add-on converters, to extended syntax, to build plugins, to integrated writing and preview environments. One popular extension is Asciidoctor Diagram . When loaded, Asciidoctor Diagram allows you to make diagrams from plain text (much like AsciiDoc does for writing). Asciidoctor Diagram does this by extending the syntax of AsciiDoc to recognize specially marked literal blocks. It takes the text inside those blocks, passes it through one of the diagramming tools it integrates with, and reinserts the image back into the document as it is being processed. The result is that the diagram source in the AsciiDoc document becomes an image in the generated output. Another popular tool is the browser extension . When this extension is installed, you can browse to an AsciiDoc file on your local storage or on the web and the browser will show you the converted HTML instead of the AsciiDoc source. That means you can get the out-of-the-box HTML experience that Asciidoctor provides without even having to run a command or script. The extension running in the browser does everything for you. These are just two examples. There are plenty more possibilities to explore in the ever-growing Asciidoctor ecosystem. All the components of this ecosystem work together to achieve one goal, to make writing in AsciiDoc a rewarding and productive experience. Asciidoctor What’s New in 2.0 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:25 |
https://pganalyze.com/blog/5mins-postgres-large-integers-causing-sequential-scan-instead-of-using-index | 5mins of Postgres E42: A surprising case of very large integers causing a Sequential Scan Watch our latest webinar on-demand: Postgres on AWS, What's New & How to Make the Most of It Features Docs Pricing Enterprise Resources Blog About Contact Login Free Trial 5mins of Postgres E42: A surprising case of very large integers causing a Sequential Scan By Lukas Fittl November 03, 2022 Today, we talk about a surprising case of a very large integer causing a Sequential Scan in Postgres. There are cases when Postgres decides to not use an index, but instead opts for a Sequential Scan. This can cause some very real performance problems. Let’s have a look at why it does this and ways to resolve this issue! Share this episode: Click here to share this episode on twitter , or sign up for our newsletter and check out the newsletter archive and subscribe to our YouTube channel . Circumvent bigints being cast to numeric values to avoid slow sequential scans in Postgres Using the generate_series function in Postgres Avoiding these slow Sequential Scans Bind parameters in Postgres Explicit casts in Postgres Using the pg_auto_parameterize extension in Sequel What we have discussed in this episode of 5mins of Postgres Transcript Let's have a look! Circumvent bigints being cast to numeric values to avoid slow sequential scans in Postgres This blog post by Jeremy Evans, who is the author of the Sequel library for Ruby , talks about how when you pass in an integer that is larger than 64 bit, Postgres suddenly decides not to use an index and instead uses a Sequential Scan . When you're passing an integer inside a SQL query and that integer is larger than the size of the bigint type in Postgres, Postgres treats that value as a numeric value because bigint would not fit. So far so good. Now, the problem is: when Postgres makes a comparison between a bigint value and the numeric value, Postgres will cast the bigint value to numeric . As it doesn't know if the numeric fits into integer or bigint , instead of casting that one to the bigint, it will actually cast the column you're comparing with to be numeric and then do a comparison. The effective problem that this creates surfaces when you have an integer or bigint column in your table. For example, a column is named id and you have a regular index on the id column and you issue a SQL query that says SELECT * FROM table WHERE id might equal a very large number. Postgres will not use any index on the table because the index is on that particular column being a bigint and it couldn't use it with a numeric! This might seem like an edge case, but we'll get to a very real world situation in a moment. Using the generate_series function in Postgres Jeremy illustrates this by using the generate_series function. It is always a great tool to have in your tool belt for creating test data. And then he just runs an EXPLAIN ANALYZE on that data. Note: He doesn't just use an empty table, because if you've used an empty table, you would of course get a Sequential Scan, because that's going to be faster, but this is not what's happening here. The generate_serices function is a great tool to have in your tool belt for creating test data. First, he uses something that is just inside the bigint range, one less than the maximum size. And then he uses one that is exactly outside of the range, which is plus one. The number that is inside the bigint range uses an Index Only Scan . This is very fast, around 0.1 milliseconds. Then, he runs another query with a larger number. This results in a Parallel Sequential Scan , which means it scans the whole table, to then be able to filter by casting this to numeric and then doing a numeric comparison. This results in performance that's 1000x worse ! We’re still looking at a pretty small table in Jeremy’s example, so imagine this in a case where you have tens or even hundreds of gigabytes of data that gets scanned in the Sequential Scan. This could be a huge problem! And, as Jeremy mentions, this could also be a potential denial of service vector. Now, how can you mitigate this problem? Avoiding these slow Sequential Scans One way of solving this is using bind parameters . Bind parameters in Postgres Instead of having Postgres do the conversion on the server side, you're explicitly telling Postgres that you’re passing it a bigint and that if something doesn't fit into the bigint you want it to raise an exception. Explicit casts in Postgres You could do an explicit cast. For example, you can just cast your number - as you're passing it in - into an integer. Then, if it was too large, Postgres would just complain and not do that Sequential Scan. Oftentimes that's challenging though, as Jeremy points out, because if you have an ORM (like the one that Jeremy himself writes) it's actually hard to have this kind of behavior in the ORM, because there are certain cases where you want to have that implicit casting behavior. From an ORM perspective, Jeremy addressed this in two ways. He changed the Sequel ORM in Ruby to explicitly check the sizes, preventing bad data being passed in. He switched to bind parameters Using the pg_auto_parameterize extension in Sequel The second thing mentioned above is to switch to using bind parameters, and in Sequel that's a choice. You have to use the pg_auto_parameterize extension. I would recommend you take a look at this when you're using Sequel, because it will help you prevent these types of problems in the future. Now, you may think that a lot of ORMs already use bind parameters, but unfortunately that is not necessarily the case. It definitely helps to double check whether your ORM directly uses values in your queries or uses them as bind parameters. It definitely helps to double check whether your ORM directly uses values in your queries or uses them as bind parameters. This might seem like an edge case. Is it actually a problem? The team at Reddit also uses Postgres. Here , they describe a case where many years ago they had a case where in the URL you would have IDs, and these IDs were base36 encoded, which they would translate back into an integer and then look up in the database. They would have bots coming in, which were using random strings that became very, very large integers. Reddit were running into this exact problem on their production site! They were getting a Sequential Scan, which took a long time, ate their disk bandwidth, all these problems! Their fix was, of course, the simple validation that they should have been doing the whole time. But again, this was surprising behavior. It was surprising why Postgres didn't handle that for them. In their case, they were using the SQLAlchemy ORM in Python . To conclude: be careful with this. This can be an actual real world problem if you have user supplied data, that then is directly used in an integer type comparison. Thanks so much for listening to this episode of 5mins of Postgres. Subscribe to our YouTube channel and follow us on Twitter to hear about upcoming episodes! What we have discussed in this episode of 5mins of Postgres Forcing Sequential Scans on PostgreSQL Using Large Integers - by Jeremy Evans Jeremy Evans on Twitter The Sequel Library for Ruby Index-Only Scans and Covering Indexes Parameterized queries and bind parameters - by Markus Winand The team at Reddit running into exactly this issue SQLAlchemy ORM Effective Indexing in Postgres - pganalyze eBook How To Reason About Indexing Your Postgres Database - pganalyze webinar 5mins of Postgres E17: Demystifying Postgres for application developers: A mental model for tables and indexes Enjoy blog posts like this? Get them once a month to your inbox ← 5mins of Postgres E41: Tuning shared_buffers for OLTP and data warehouse workloads & is 25% of RAM a good choice? 5mins of Postgres E43: Logical replication in Postgres 15 & why the REPLICA IDENTITY matters → Contact Plans & Pricing Resources Enterprise Documentation Customer Stories Careers Index Advisor Security Status Postgres Query Formatter Compare pganalyze Terms of Service Privacy Policy Newsletter SOC 2 Type 2 Do Not Sell My Personal Information Get in touch Use the contact us form or email sales: sales@pganalyze.com SOC 2 certification pganalyze is SOC 2 Type 2 certified © 2025 Duboce Labs, Inc. | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/project/continuous-integration/ | Continuous Integration | 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 Continuous Integration 3.0 3.0 2.5 Edit this Page Continuous Integration Continuous integration for the AsciidoctorJ project is performed by GitHub Actions. You can find recent build results, including the build status of pull requests, on the asciidoctor/asciidoctorj page. Release and publish the artifacts To build and publish a release the following properties have to be set, for example in the file ~/.gradle/gradle.properties: ~/.gradle/gradle.properties signing.keyId=... (1) signing.password=... signing.secretKeyRingFile=/home/YOUR_USERNAME/.gnupg/secring.gpg sdkman_consumer_key=... (2) sdkman_consumer_token=... sonatypeUsername=... (3) sonatypePassword=... 1 Settings for signing the artifacts 2 Credentials for publishing a new release to sdkman 3 Credentials for publishing artifacts to oss.sonatype.org The following steps are necessary to build a new release: Update the version in gradle.properties to a release version, i.e. from 2.4.4-SNAPSHOT to 2.4.4 . Build the release with # ./gradlew clean build After testing publish all artifacts to a local repository under build/repos with # ./gradlew publishAllPublicationsToLocalRepository -i When everything is fine publish the artifacts to a staging repository on oss.sonatype.org and close the repository: # ./gradlew publishAllPublicationsToSonatypeRepository -i # ./gradlew closeRepository -i Visit oss.sonatype.org/#stagingRepositories and check the staging repository. The artifacts are not published yet. The repository URL shown there can be used for testing this version before publishing to Maven central. When everything is fine publish the artifacts in the staging repository by clicking the "Release" button. Alternatively you can release it with # ./gradlew releaseRepository Publish the new version to sdkman with # ./gradlew asciidoctorj-distribution:sdkMajorRelease Commit everything and assign a tag: # git commit -m "Release v2.x.y" # git tag v2.x.y Upgrade the version to the next version by changing the version property in gradle.properties to version=2.x.y+1-SNAPSHOT and commit: git commit -m "Prepare next release" Develop in an IDE 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:25 |
https://www.unicode.org/glossary/#iso_iec_10646 | 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 &amp; for "&" or &nbsp; 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://bundler.io/v4.0/man/bundle-clean.1.html | Bundler: bundle clean Bundler Docs Team Blog Repository bundle clean bundle-clean - Cleans up unused gems in your bundler directory bundle clean [--dry-run] [--force] Description This command will remove all unused gems in your bundler directory. This is useful when you have made many changes to your gem dependencies. Options --dry-run Print the changes, but do not clean the unused gems. --force Forces cleaning up unused gems even if Bundler is configured to use globally installed gems. As a consequence, removes all system gems except for the ones in the current application. Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-gem.1.html | Bundler: bundle gem Bundler Docs Team Blog Repository bundle gem bundle-gem - Generate a project skeleton for creating a rubygem bundle gem GEM_NAME OPTIONS Description Generates a directory named GEM_NAME with a Rakefile , GEM_NAME.gemspec , and other supporting files and directories that can be used to develop a rubygem with that name. Run rake -T in the resulting project for a list of Rake tasks that can be used to test and publish the gem to rubygems.org. The generated project skeleton can be customized with OPTIONS, as explained below. Note that these options can also be specified via Bundler's global configuration file using the following names: gem.coc gem.mit gem.test Options --exe , --bin , -b Specify that Bundler should create a binary executable (as exe/GEM_NAME ) in the generated rubygem project. This binary will also be added to the GEM_NAME.gemspec manifest. This behavior is disabled by default. --no-exe Do not create a binary (overrides --exe specified in the global config). --coc Add a CODE_OF_CONDUCT.md file to the root of the generated project. If this option is unspecified, an interactive prompt will be displayed and the answer will be saved in Bundler's global config for future bundle gem use. --no-coc Do not create a CODE_OF_CONDUCT.md (overrides --coc specified in the global config). --changelog Add a CHANGELOG.md file to the root of the generated project. If this option is unspecified, an interactive prompt will be displayed and the answer will be saved in Bundler's global config for future bundle gem use. Update the default with bundle config set --global gem.changelog <true|false> . --no-changelog Do not create a CHANGELOG.md (overrides --changelog specified in the global config). --ext=c , --ext=go , --ext=rust Add boilerplate for C, Go (currently go-gem-wrapper based) or Rust (currently magnus based) extension code to the generated project. This behavior is disabled by default. --no-ext Do not add extension code (overrides --ext specified in the global config). --git Initialize a git repo inside your library. --github-username=GITHUB_USERNAME Fill in GitHub username on README so that you don't have to do it manually. Set a default with bundle config set --global gem.github_username <your_username> . --mit Add an MIT license to a LICENSE.txt file in the root of the generated project. Your name from the global git config is used for the copyright statement. If this option is unspecified, an interactive prompt will be displayed and the answer will be saved in Bundler's global config for future bundle gem use. --no-mit Do not create a LICENSE.txt (overrides --mit specified in the global config). -t , --test=minitest , --test=rspec , --test=test-unit Specify the test framework that Bundler should use when generating the project. Acceptable values are minitest , rspec and test-unit . The GEM_NAME.gemspec will be configured and a skeleton test/spec directory will be created based on this option. Given no option is specified: When Bundler is configured to generate tests, this defaults to Bundler's global config setting gem.test . When Bundler is configured to not generate tests, an interactive prompt will be displayed and the answer will be used for the current rubygem project. When Bundler is unconfigured, an interactive prompt will be displayed and the answer will be saved in Bundler's global config for future bundle gem use. --no-test Do not use a test framework (overrides --test specified in the global config). --ci , --ci=circle , --ci=github , --ci=gitlab Specify the continuous integration service that Bundler should use when generating the project. Acceptable values are github , gitlab and circle . A configuration file will be generated in the project directory. Given no option is specified: When Bundler is configured to generate CI files, this defaults to Bundler's global config setting gem.ci . When Bundler is configured to not generate CI files, an interactive prompt will be displayed and the answer will be used for the current rubygem project. When Bundler is unconfigured, an interactive prompt will be displayed and the answer will be saved in Bundler's global config for future bundle gem use. --no-ci Do not use a continuous integration service (overrides --ci specified in the global config). --linter , --linter=rubocop , --linter=standard Specify the linter and code formatter that Bundler should add to the project's development dependencies. Acceptable values are rubocop and standard . A configuration file will be generated in the project directory. Given no option is specified: When Bundler is configured to add a linter, this defaults to Bundler's global config setting gem.linter . When Bundler is configured not to add a linter, an interactive prompt will be displayed and the answer will be used for the current rubygem project. When Bundler is unconfigured, an interactive prompt will be displayed and the answer will be saved in Bundler's global config for future bundle gem use. --no-linter Do not add a linter (overrides --linter specified in the global config). --edit=EDIT , -e=EDIT Open the resulting GEM_NAME.gemspec in EDIT, or the default editor if not specified. The default is $BUNDLER_EDITOR , $VISUAL , or $EDITOR . --bundle Run bundle install after creating the gem. --no-bundle Do not run bundle install after creating the gem. See Also bundle config(1) Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 v1.14 v1.13 v1.12 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://www.unicode.org/glossary/#UTF_8 | 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 &amp; for "&" or &nbsp; 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://bundler.io/v4.0/man/bundle-issue.1.html | Bundler: bundle issue Bundler Docs Team Blog Repository bundle issue bundle-issue - Get help reporting Bundler issues bundle issue Description Provides guidance on reporting Bundler issues and outputs detailed system information that should be included when filing a bug report. This command: Displays links to troubleshooting resources Shows instructions for reporting issues Outputs comprehensive environment information needed for debugging The command helps ensure that bug reports include all necessary system details for effective troubleshooting. Output The command outputs several sections: Troubleshooting links and resources Link to the GitHub issue template Environment information including: Bundler version and platforms, Ruby version and configuration, RubyGems version and paths, Development tool versions (Git, RVM, rbenv, chruby) Bundler build metadata Current Bundler settings Bundle Doctor output Examples Get issue reporting information: $ bundle issue See Also bundle-doctor (1) Choose version v4.0 v2.7 v2.6 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/guides/use-snapshot-version/ | Using a Snapshot Version | 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 Using a Snapshot Version 3.0 3.0 2.5 Edit this Page Using a Snapshot Version Snapshot versions will be published to oss.jfrog.org . To use a snapshot version of the the AsciidoctorJ library add this repository to your project: <repositories> <repository> <id>snapshots</id> <snapshots> <enabled>true</enabled> </snapshots> <releases> <enabled>false</enabled> </releases> <url>https://oss.sonatype.org/content/repositories/snapshots/</url> </repository> </repositories> If you build your project using Gradle add the repository like this to your build: repositories { maven { url 'https://oss.sonatype.org/content/repositories/snapshots/' } } You can also download a snapshot version of the distribution from here: oss.sonatype.org/service/local/repositories/snapshots/content/org/asciidoctor/asciidoctorj/2.4.3-SNAPSHOT/ . Using a pre-release version Project Layout 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:25 |
https://github.com/jeremyevans/forme | GitHub - jeremyevans/forme: HTML forms library for ruby 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 HTML forms library for ruby forme.jeremyevans.net License MIT license 329 stars 27 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/forme 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 684 Commits .github/ workflows .github/ workflows demo-site demo-site lib lib spec spec .ci.gemfile .ci.gemfile .gitignore .gitignore CHANGELOG CHANGELOG MIT-LICENSE MIT-LICENSE README.rdoc README.rdoc Rakefile Rakefile forme.gemspec forme.gemspec View all files Repository files navigation README MIT license Forme Forme is a HTML forms library for ruby with the following goals: Have no external dependencies Have a simple API Support forms both with and without related objects Allow compiling down to different types of output Integrate easily into web frameworks Introduction Forme is designed to make creating HTML forms easier. Flexibility and ease of use are the primary objectives. Here’s a basic example, showing usage without a related object: Forme . form ({ :action => '/foo' }) do | f | f . input ( :text , :name => 'bar' ) f . tag ( :fieldset ) do f . input ( :textarea , :name => 'baz' ) end f . button ( 'Update' ) end This results in the following HTML: <form action="/foo"> <input name="bar" type="text"> <fieldset> <textarea name="baz"></textarea> </fieldset> <input type="submit" value="Update"> </form> Forme also supports forms that are associated with objects, and has specific support for Sequel::Model objects to allow easily building forms for such objects. The Sequel support handles inputs based on database columns, and automatically handles labels and errors: Forme . form ( Album [ 1 ], action: '/foo' ) do | f | f . input :name f . input :copies_sold end This results in the following HTML: <form action="/foo" method="post"> <label>Name: <input id="album_name" name="album[name]" type="text" value="Rising Force"> </label> <label>Copies Sold: <input id="album_copies_sold" inputmode="numeric" name="album[copies_sold]" pattern="-?[0-9]*" type="text" value="100000"> </label> </form> In addition to integrating with Sequel, Forme also integrates into three separate web frameworks, Roda, Rails, and Sinatra, allowing use of forms inside templates. This is the most common usage of Forme. One distinct advantage of Forme over other form libraries is the use of an abstract syntax tree internally, allowing the same form code to compile to different HTML with different options. For example, it allows using the exactly same form code to display a form you can modify as well as a read-only view, just by passing a single option when creating the form. For example, with the first example in this section, if you pass the formatter: :readonly option, you get the following HTML instead: <form action="/foo"> <span class="readonly-text"></span> <fieldset> <div class="readonly-textarea"></div> </fieldset> </form> This allows you to reuse the same form code in multiple contexts, which can save considerable development time. Installation gem install forme Links Demo Site forme-demo.jeremyevans.net RDoc forme.jeremyevans.net Source github.com/jeremyevans/forme Discussion Forum github.com/jeremyevans/forme/discussions Bug Tracker github.com/jeremyevans/forme/issues Direct Instantiation While not typically done, you can instantiate Forme::Form objects directly and use them: f = Forme :: Form . new f . open ( :action => '/foo' , :method => :post ) # '<form action="/foo" method="post">' f . input ( :textarea , :value => 'foo' , :name => 'bar' ) # '<textarea name="bar">foo</textarea>' f . input ( :text , :value => 'foo' , :name => 'bar' ) # '<input name="bar" type="text" value="foo">' f . close # '</form>' With an object, Form#input calls forme_input on the obj with the form, field, and options, which should return a Forme::Input or Forme::Tag instance. Also, in Form#initialize , forme_config is called on object with the form if the object responds to it, allowing customization of the entire form based on the object. f = Forme :: Form . new ( obj ) f . input ( :field ) # '<input id="obj_field" name="obj[field]" type="text" value="foo">' If the object doesn’t respond to forme_input , it falls back to creating text fields with the name and id set to the field name and the value set by calling the given method on the object (or using #[] if the object is a hash). f = Forme :: Form . new ([ :foo ]) f . input ( :first ) # '<input id="first" name="first" type="text" value="foo">' Forme::Form Creation Forme.form takes up to 3 arguments, and yields the Forme::Form object to the block (if given). Here are the argument styles that you can use for Forme.form . No args Creates a Form object with no options and not associated to an obj , and with no attributes in the opening tag. 1 hash arg Treated as opening form tag attributes, creating a Form object with no options. 1 non-hash arg Treated as the Form ‘s obj , with empty options and no attributes in the opening tag. 2 hash args First hash is opening attributes, second hash is Form options. 1 non-hash arg, 1-2 hash args First argument is Form ‘s obj, second is opening attributes, third if provided is Form ’s options. Examples: # No arguments Forme . form # 1 hash argument (attributes) Forme . form ( action: '/foo' ) # 1 non-hash argument (a reference object used when building the form) Forme . form ( Album [ 1 ]) # 2 hash arguments (attributes, and options) Forme . form ({ action: '/foo' }, values: params ) # 1 non-hash argument, 1-2 hash arguments (ref obj, attributes, options) Forme . form ( Album [ 1 ], action: '/foo' ) Forme . form ( Album [ 1 ], { action: '/foo' }, values: params ) If you want a Forme::Form instance where the reference object is a Hash, then you need to pass the hash object using the :obj option: Forme . form ({ action: '/foo' }, obj: { foo: 'bar' }) You can also create Forme::Form objects the normal ruby way using Forme::Form#new. The difference between Forme::Form#new and Forme.form is that Forme.form includes the enclosing <form> tag, where Forme::Form#new does not. Because of this, Forme::Form does not accept a hash of <form> tag attributes, so it has the following API: # No arguments Forme :: Form . new # 1 hash argument Forme :: Form . new ( values: params ) # 1 non-hash argument Forme :: Form . new ( Album [ 1 ]) # 1 non-hash argument, 1-2 hash arguments Forme :: Form . new ( Album [ 1 ], values: params ) Forme::Form Methods form If you create a Form via Forme::Forme#new, you can use the form method to create a form tag: f = Forme :: Form . new f . form ( action: '/foo' ) This is what Forme.form uses internally to create the +<form>+ tag input This adds an input to the form. If the form has an associated object, and that object responds to forme_input , calls forme_input with the argument and options: f = Forme :: Form . new ( obj ) f . input ( :field ) # '<input id="obj_field" name="obj[field]" type="text" value="foo">' If the form has an associated object, and that object does not respond to forme_input , calls the method on the object (or uses [] if the object is a hash), and uses the result as the value for a text input: f = Forme :: Form . new ([ :foo ]) f . input ( :first ) # '<input id="first" name="first" type="text" value="foo">' If the object does not respond to forme_input , you can change the type of the input via the :type option: f = Forme :: Form . new ( obj ) f . input ( :field , :type => :email ) # '<input id="obj_field" name="obj[field]" type="email" value="foo">' If the form does not have an associated object, the first argument is used as the input type: f = Forme :: Form . new f . input ( :text ) # '<input type="text" >' The second argument is an options hash. See below for the supported input types and options. tag This adds a tag to the form. If a block is given, yields to the block, and tags and inputs inside the block are placed inside the tag. The first argument is the type of tag to create, and the second argument if given should be a hash of tag attributes. This allows you to nest inputs inside tags: Forme . form do | f | f . tag ( :span , :class => "foo" ) do f . input ( :text ) end end Which results in a form similar to the following: <form> <span class="foo"> <input type="text"> </span> </form> inputs This wraps multiple inputs in a tag (it uses the :inputs_wrapper transformer discussed below, so it uses a fieldset by default). You can give the inputs to add as an enumerable argument: f . inputs ([ :textarea , [ :text , :value => 'a' ]]) # <fieldset> # <textarea></textarea> # <input type="text" value="a"> # </fieldset> You can also provide a block: f . inputs ([ :textarea ]) do f . input ( :text , :value => 'a' ) end Any options given are passed to the inputs_wrapper (so you can use options such as :legend to set a legend for the fieldset), and also to the with_opts method (so you can use options such as :wrapper to modify the default wrapper transformer for inputs inside the block). There is also one option specific to the inputs method: :nested_inputs_wrapper Sets the default inputs_wrapper to use for calls to inputs inside the block. The reason for this option is that :inputs_wrapper option affects the current call to inputs, so if you want to use a different inputs_wrapper for nested calls, you need this option. button This adds a submit input to the form: f . button # <input type="submit"> It can be called with a string to provide a value for the button: f . button ( 'Search' ) # <input type="submit" value="Search"> It can be called with a hash to provide options for the submit input: f . button ( value: 'Search' , class: 'btn' ) # <input class="btn" type="submit" value="Search"> with_opts This requires a block, and modifies the Forme::Form’s options inside the block, restoring the options when the block returns: f . input ( :text ) # <input type="text"> f . with_opts ( wrapper: :li ) do f . input ( :text ) end # <li><input type="text"></li> This supports most options you can provide to Forme::Form, but not all. with_obj This uses with_opts to change the Forme::Form object temporarily. It yields the object to the block, and also supports appending to the existing namespaces: Forme . form ([ :foo ], { action: '/path' }, namespace: 'a' ) do | f | f . input ( :first ) # <input id="a_first" name="a[first]" type="text" value="foo"> f . with_obj ([ 'foobar' ], 'b' ) do | o | f . input ( :first , :size => o . first . size ) # <input id="a_b_first" name="a[b][first]" size="6" type="text" value="foobar"> end end each_obj This allows you to provide an object-yielding enumerable. each_object will call with_obj with each object in the enumerable. It yields each object as well as the index of the object in the enumerable, and includes the index in the namespace: objectlist = [[ 'foobar' ], [ 'good' ]] Forme . form ([ :foo ], :namespace => 'a' ) do | f | f . each_obj ( objectlist , 'b' ) do | o , i | f . input ( :first , :size => 10 + i ) end # <input id="a_b_0_first" name="a[b][0][first]" size="10" type="text" value="foobar"> # <input id="a_b_1_first" name="a[b][1][first]" size="11" type="text" value="good"> end Sequel Support Forme ships with a Sequel plugin (use Sequel::Model.plugin :forme to enable), that makes Sequel::Model instances support the forme_config and forme_input methods and return customized inputs. An additional instance method, forme_namespace can optionally be defined to customize how model classnames are transformed into form classes and input IDs and names. This can be useful if your Sequel::Model classes are nested under a parent namespace. The default namespace uses Sequel::Model#underscore. module Admin class Albums < Sequel :: Model def forme_namespace self . class . name . underscore . tr ( '/' , '_' ) end end end The Sequel :forme plugin also integerates with Sequel’s validation reflection support that comes with the Sequel validation_class_methods plugin. It will add pattern and maxlength attributes based on the format, numericality, and length validations. Specialized input options for specific column types In addition to the default Forme options, the Sequel support includes, for specific column types, these additional options to the #input method: boolean :as Can be set to :select, :radio, or :checkbox. :select will use a select input with three options, a blank option, a true option, and a false option. :radio will use two radio inputs, one for true and one for false. :checkbox will use a single checkbox input. By default, uses :select if NULL values are allowed and the option is not required, and :checkbox otherwise. :false_label The value to use for the false label, ‘No’ by default. :false_value The value to use for the false input, ‘f’ by default. :true_label The value to use for the true label, ‘Yes’ by default. :true_value The value to use for the true input, ‘t’ by default. string :as Can be set to :textarea to use a textarea input. You can use the usual attributes hash or a stylesheet to control the size of the textarea. associations The Sequel support also handles associations, allowing you to change which objects are associated to the current object. Forme . form ( Album [ 1 ], :action => '/foo' ) do | f | f . input :name f . input :artist f . input :tags , :as => :checkbox end This will create a form similar to: <form action="/foo" method="post"> <label>Name: <input id="album_name" name="album[name]" type="text" value="Blue Hawaii"></label> <label>Artist: <select id="album_artist_id" name="album[artist_id]"> <option selected="selected" value="1">Elvis Presley</option> <option value="2">The Beatles</option> <option value="3">The Monkeys</option> </select></label> <span class="label">Tags: <label><input checked="checked" id="album_tag_pks_1" name="album[tag_pks][]" type="checkbox" value="1"> Rock and Roll</label> <label><input id="album_tag_pks_2" name="album[tag_pks][]" type="checkbox" value="2"> Blues</label> <label><input id="album_tag_pks_3" name="album[tag_pks][]" type="checkbox" value="3"> Country</label> </span> </form> For one_to_many and many_to_many associations, you will probably want to use the association_pks plugin that ships with Sequel. This also supports the pg_array_to_many association type that comes with Sequel’s pg_array_association plugin. association input options: :as For many_to_one associations, set to :radio to use a series of radio buttons instead a select input. For one_to_many, many_to_many, and pg_array_to_many associations, set to :checkbox to use a series of checkboxes instead of a multiple select input. :dataset If a Dataset, uses the dataset to retrieve the options. If a Proc or Method, calls the proc or method with the default dataset, and should return a modified dataset to use. :options Specify the options to use for the input(s), instead of querying the database. :name_method If a String or Symbol, treats it as a method name and calls it on each object returned by the dataset to get the text to use for the option. If not given, tries the following method names in order: :forme_name, :name, :title, :number. If given and not a String or Symbol, a callable object is assumed, and the value is called with each object and should return the text to use for the option. subform The Sequel support includes a method called subform, which can handle nested_attributes: Forme . form ( Album [ 1 ], :action => '/foo' ) do | f | f . input :name f . subform :artist do f . input :name end f . subform :tracks do f . input :number f . input :name end end This adds an input for editing the artist’s name after the album’s inputs, as well as inputs for editing the number and name for all of the tracks in the album, creating a form similar to: <form action="/foo" method="post"> <label>Name: <input id="album_name" name="album[name]" type="text" value="Blue Hawaii"></label> <input id="album_artist_attributes_id" name="album[artist_attributes][id]" type="hidden" value="1"> <fieldset class="inputs"><legend>Artist</legend> <label>Name: <input id="album_artist_attributes_name" name="album[artist_attributes][name]" type="text" value="Elvis Presley"></label> </fieldset> <input id="album_tracks_attributes_0_id" name="album[tracks_attributes][0][id]" type="hidden" value="1"> <fieldset class="inputs"><legend>Track #1</legend> <label>Number: <input id="album_tracks_attributes_0_number" inputmode="numeric" name="album[tracks_attributes][0][number]" pattern="-?[0-9]*" type="text" value="1"></label> <label>Name: <input id="album_tracks_attributes_0_name" name="album[tracks_attributes][0][name]" type="text" value="Blue Hawaii"></label> </fieldset> <input id="album_tracks_attributes_1_id" name="album[tracks_attributes][1][id]" type="hidden" value="2"> <fieldset class="inputs"><legend>Track #2</legend> <label>Number: <input id="album_tracks_attributes_1_number" inputmode="numeric" name="album[tracks_attributes][1][number]" pattern="-?[0-9]*" type="text" value="2"></label> <label>Name: <input id="album_tracks_attributes_1_name" name="album[tracks_attributes][1][name]" type="text" value="Almost Always True"></label> </fieldset> </form> Note: blank lines added for clarity; they would not appear in the actual output subform options: :inputs Automatically call inputs with the given values. Using this, it is not required to pass a block to the method, though it will still work if you do. :inputs_opts When using the :grid option, this allows you to specify options to pass to the table InputsWrapper. :legend Overrides the default :legend used (which is based on the association name). You can also use a proc as the value, which will called with each associated object (and the position in the associated object already for *_to_many associations), and should return the legend string to use for that object. :grid Sets up a table with one row per associated object, and one column per field. :labels When using the :grid option, override the labels that would be created via the :inputs option. If you are not providing an :inputs option or are using a block with additional inputs, you should specify this option. :skip_primary_key Skip adding a hidden primary key field for existing objects. Handling form submissions The Sequel forme plugin only handles creating the forms, it does not handle processing input submitted via forms. For a form such as: Forme . form ( Album [ 1 ], :action => '/foo' ) do | f | f . input :name f . input :copies_sold end Input of the form will often be submitted as the following parameter hash (this depends on your web framework, but Rack works this way by default): { 'album' => { 'name' => 'Rising Force' , 'copies_sold' => '100000' }} One way to handle the form submission is to use Sequel::Model#set_fields. album = Album [ 1 ] album . set_fields ( params [ 'album' ], %w'name copies_sold' ) album . save Note that you have to specify the parameter names again as the second argument to set_fields. Handling submitted parameters becomes more complex as your forms become more complex. For example, if you are only displaying certain form fields in certain situations: album = Album [ 1 ] Forme . form ( album , :action => '/foo' ) do | f | f . input :name f . input :copies_sold if album . released? end Then your parameter handling becomes more complex: album = Album [ 1 ] album . set_fields ( params [ 'album' ], %w'name' ) album . set_fields ( params [ 'album' ], %w'copies_sold' ) if album . released? album . save As you can see, you basically need to recreate the conditionals used when creating the form, so that that the processing of the form submission handles only the inputs that were displayed on the form. Sequel forme_set plugin The Sequel forme_set plugin is designed to make handling form submissions easier. What it does is record the form fields that are used on the object, and then it uses those fields to handle input submitted for the object. For example: album = Album [ 1 ] Forme . form ( album , :action => '/foo' ) do | f | f . input :name f . input :copies_sold if album . released? end album . forme_set ( params [ 'album' ]) If the album has been released, and the form would display the name and copies_sold inputs, then forme_set will accept input for both. If the album has not been released, the form will only display the name input, so forme_set will only accept the name input. So forme_set offers two advantages over using set_fields: DRYs up code as you don’t have to specify the names twice Simplifies complex form submissions by eliminating duplication of conditionals Validations forme_set offers one additional advantage over using set_fields. When dealing with associations, set_fields does not check that the value submitted for an input matches one of the available options displayed on the form. For example, if you have a form such as: Forme . form ( album , :action => '/foo' ) do | f | f . input :name f . input :artist , :dataset => proc { | ds | ds . where { name > 'M' }} end The form will only display artists whose name is greater than ‘M’. However, if you process input using: album . set_fields ( params [ 'album' ], %w'name artist_id' ) Then a malicious user can submit an artist_id for an artist whose name is not greater than ‘M’, and the value will be set. In addition to setting values, forme_set also adds validations that the submitted values for associated objects match one of the options displayed on the form, which can increase security. Usage Because forme_set relies on creating form inputs using the same model instance that will be used for accepting input, using it often requires some code rearranging. If you are storing Forme::Form objects and later using them on forms, it is fairly simple to move the Forme::Forme object creation to a method, that you can call both in the initial display and when processing the input: def album_form ( album ) Forme . form ( album , :action => '/foo' ) do | f | f . input :name f . input :copies_sold end end Then when displaying the form: <%= album_form(Album[1]) %> and when processing the form’s input: album = Album [ 1 ] album_form ( album ) album . forme_set ( params [ 'album' ]) However, if you use Forme’s ERB/Rails template integration (see below), and are inlining forms in your templates, unless you want to extract the Forme::Form creation to methods, you have to basically rerender the template when processing the input. How you do this is specific to the web framework you are using, but is it similar to: @album = Album [ 1 ] render :template @album . forme_set ( params [ 'album' ]) Caveats forme_set is not perfect, there are ways to use Forme that forme_set will not handle correctly. First, forme_set only works with forms that use model objects, and doesn’t handle inputs where the :obj option is provided to change the input. Additionally, forme_set does not currently handle subform/nested_attributes. In cases where forme_set does not handle things correctly, you can use forme_parse , which will return metadata that forme_set uses ( forme_set calls forme_parse internally). forme_parse returns a hash with the following keys: :values A hash of values that can be used to update the model, suitable for passing to Sequel::Model#set. :validations A hash of values suitable for merging into forme_validations. Used to check that the submitted values for associated objects match one of the options for the input in the form. It is possible to use forme_set for the forms it can handle, and use forme_parse and set_fields for other forms. Roda forme_set plugin The Roda forme_set plugin builds on the Sequel forme_set plugin and is designed to make handling form submissions even easier. This plugin adds a hidden form input to store which fields were used to build the form, as well as some other metadata. It adds another hidden form input with an HMAC, so that on submission, if the HMAC matches, you can be sure that an attacker didn’t add extra fields. There are a couple advantages to this plugin over using just the Sequel forme_set plugin. One is that you do not need to record the form fields when processing the submission of a form, since the information you need is included in the form submission. Another is that calling the forme_set method is simpler, since it can determine the necessary parameters. While you need code like this when using just the Sequel forme_set plugin: album = Album [ 1 ] Forme . form ( album , :action => '/foo' ) do | f | f . input :name f . input :copies_sold if album . released? end album . forme_set ( params [ 'album' ]) when you also use the Roda forme_set plugin, you can simplify it to: album = Album [ 1 ] forme_set ( album ) Validations The Roda forme_set plugin supports and uses the same validations as the Sequel forme_set plugin. However, the Roda plugin is more accurate because it uses the options that were present on the form when it was originally built, instead of the options that would be present on the form when the form was submitted. However, note that that can be a negative if you are dynamically adding values to both the database and the form between when the form was built and when it was submitted. Usage Because the Roda forme_set plugin includes the metadata needed to process the form in form submissions, you don’t need to rearrange code to use it, or rerender templates. You can do: album = Album [ 1 ] forme_set ( album ) And the method will update the album object using the appropriate form values. Note that using the Roda forme_set plugin requires you set a secret for the HMAC. It is important that you keep this value secret, because if an attacker has access to this, they would be able to set arbitrary attributes for model objects. In your Roda class, you can load the plugin via: plugin :forme_set , :secret => ENV [ "APP_FORME_HMAC_SECRET" ] By default, invalid form submissions will raise an exception. If you want to change that behavior (i.e. to display a nice error page), pass a block when loading the plugin: plugin :forme_set do | error_type , obj | # ... end The block arguments will be a symbol for the type of error (:missing_data, :missing_hmac, :hmac_mismatch, :csrf_mismatch, or :missing_namespace) and the object passed to forme_set . This block should raise or halt. If it does not, the default behavior of raising an exception will be taken. Form Versions The Roda forme_set plugin supports form versions. This allows you to gracefully handle changes to forms, processing submissions of the form generated before the change (if possible) as well as the processing submissions of the form generated after the change. For example, maybe you have an existing form with just an input for the name: form ( album ) do | f | f . input ( :name ) end Then later, you want to add an input for the number of copies sold: form ( album ) do | f | f . input ( :name ) f . input ( :copies_sold ) end Using the Roda forme_set plugin, submissions of the old form would only set the name field, it wouldn’t set the copies_sold field, since when the form was created, only the name field was used. You can handle this case be versioning the form when making changes to it: form ( album , {}, :form_version => 1 ) do | f | f . input ( :name ) f . input ( :copies_sold ) end When you are processing the form submission with forme_set, you pass a block, which will be yielded the version for the form (nil if no version was set): forme_set ( album ) do | version | if version == nil album . copies_sold = 0 end end The block is also yielded the object passed for forme_set, useful if you don’t keep a reference to it: album = forme_set ( Album . new ) do | version , obj | if version == nil obj . copies_sold = 0 end end You only need to support old versions of the form for as long as their could be active sessions that could use the old versions of the form. As long you as are expiring sessions to prevent session fixation, you can remove the version handling after the expiration period has passed since the change to the form was made. Note that this issue with handling changes to forms is not specific to the Roda forme_set plugin, it affects pretty much all form submissions. The Roda forme_set plugin just makes this issue easier to handle. Caveats The Roda forme_set plugin has basically the same caveats as Sequel forme_set plugin. Additionally, it has a couple other restrictions that the Sequel forme_set plugin does not have. First, the Roda forme_set plugin only handles a single object in forms, which must be provided when creating the form. It does not handle multiple objects in the same form, and ignores any fields set for an object different from the one passed when creating the form. You can use the Sequel forme_set plugin to handle form submissions involving multiple objects, or for the objects that were not passed when creating the form. Second, the Roda forme_set plugin does not handle cases where the field values are placed outside the form’s default namespace. The Sequel forme_set plugin can handle those issues, as long as all values are in the same namespace, since the Sequel forme_set plugin requires you pass in the specific hash to use (the Roda forme_set plugin uses the form’s namespace information and the submitted parameters to determine the hash to use). In cases where the Roda forme_set does not handle things correctly, you can use forme_parse, which will return metadata in the same format as the Sequel plugin forme_parse method, with the addition of a :form_version key in the hash for the form version. It is possible to use the Roda forme_set plugin for the submissions it can handle, the Sequel forme_set plugin for the submissions it can handle, and set other fields manually using the Sequel set_fields methods. Note that when using the Roda forme_set plugin with an existing form, you should first enable the Roda plugin without actually using the Roda forme_set method. Do not start using the Roda forme_set method until all currently valid sessions were established after the Roda forme_set plugin was enabled. Otherwise, sessions that access the form before the Roda forme_set plugin was enabled will not work if they submit the form after the Roda forme_set plugin is enabled. Other Sequel Plugins In addition to the Sequel plugins mentioned above, Forme also ships with additional Sequel plugins: forme_i18n Handles translations for labels using i18n. Roda Support Forme ships with multiple Roda plugins forme_set (discussed above) forme forme_route_csrf forme_erubi_capture_block forme_erubi_capture forme_route_csrf and forme plugins For new code, it is recommended to use forme_route_csrf, as that uses Roda’s route_csrf plugin, which supports more secure request-specific CSRF tokens. In both cases, usage in ERB templates is the same: <% form(@obj, action: '/foo') do |f| %> <%= f.input(:field) %> <% f.tag(:fieldset) do %> <%= f.input(:field_two) %> <% end %> <% end %> The forme_route_csrf plugin’s form method supports the following options in addition to the default Forme.form options: :emit Set to false to not emit implicit tags into template. This should only be used if you are not modifying the template inside the block. :csrf Set to force whether a CSRF tag should be included. By default, a CSRF tag is included if the form’s method is one of the request methods checked by the Roda route_csrf plugin. :use_request_specific_token Set whether to force the use of a request specific CSRF token. By default, uses a request specific CSRF token unless the Roda route_csrf plugin has been configured to support non-request specific tokens. The emit: false option allows you to do: <%= form(@obj, {action: '/foo'}, emit: false) do |f| f.input(:field) f.tag(:fieldset) do f.input(:field_two) end end %> This is useful if you are calling some method that calls form with a block, where the resulting entire Forme::Forme object will be literalized into the template. The form will include the CSRF token and forme_set metadata as appropriate. The forme plugin does not require any csrf plugin, but will transparently use Rack::Csrf if it is available. If Rack::Csrf is available a CSRF tag if the form’s method is POST , with no configuration ability. forme_erubi_capture_block plugin The forme_erubi_capture_block plugin builds on the forme_route_csrf plugin, but it supports the erubi/capture_block engine, which allows this syntax: <%= form(@obj, :action=>'/foo') do |f| %> <%= f.input(:field) %> <%= f.tag(:fieldset) do %> <%= f.input(:field_two) %> <% end %> <% end %> If you use the forme_erubi_capture)block plugin, you need to manually set Roda to use the erubi/capture_block engine, which you can do via: require 'erubi/capture_block' app . plugin :render , :engine_opts => { 'erb' => { :engine_class => Erubi :: CaptureBlockEngine }} The forme_erubi_capture plugin requires Erubi 1.13.0+. forme_erubi_capture plugin The forme_erubi_capture plugin builds on the forme_route_csrf plugin, but it supports the erubi/capture_end engine, which allows this syntax: <%|= form(@obj, :action=>'/foo') do |f| %> <%= f.input(:field) %> <%|= f.tag(:fieldset) do %> <%= f.input(:field_two) %> <%| end %> <%| end %> If you use the forme_erubi_capture plugin, you need to manually set Roda to use the erubi/capture_end engine, which you can do via: require 'erubi/capture_end' app . plugin :render , :engine_opts => { 'erb' => { :engine_class => Erubi :: CaptureEndEngine }} The forme_erubi_capture plugin requires Roda 3.50.0+. Sinatra Support Forme ships with a Sinatra extension that you can get by require "forme/erb" and using including Forme::ERB::Helper . This is tested to support ERB templates in Sinatra. It allows you to use the following API in your erb templates: <% form(@obj, :action=>'/foo') do |f| %> <%= f.input(:field) %> <% f.tag(:fieldset) do %> <%= f.input(:field_two) %> <% end %> <% end %> In order to this to work transparently, the ERB outvar needs to be @_out_buf (this is the default in Sinatra). The Sinatra extension also supports the emit: false option to not directly modify the related template (see example in the Roda section for usage). Rails Support Forme ships with a Rails extension that you can get by require "forme/rails" and using helper Forme::Rails::ERB in your controller. If allows you to use the following API in your Rails forms: <%= forme(@obj, :action=>'/foo') do |f| %> <%= f.input(:field) %> <%= f.tag(:fieldset) do %> <%= f.input(:field_two) %> <% end %> <% end %> This has been tested on Rails 3.2-7.0. Input Types and Options These are the types and options supported by Forme::Input objects, usually created via Forme::Form#input: General Options These options are supported by all of the input types: :attr The attributes hash to use for the given tag, attributes in this hash take precedence over other options that set attributes. :autofocus Set the autofocus attribute if true :class A class to use. Unlike other options, this is combined with the classes set in the :attr hash. :dasherize_data Automatically replace underscores with hyphens for symbol data attribute names in the :data hash. Defaults to false . :data A hash of data-* attributes for the resulting tag. Keys in this hash will have attributes created with data- prepended to the attribute name. :disabled Set the disabled attribute if true :error Set an error message, invoking the error_handler :error_handler Set a custom error_handler, overriding the form’s default :help Set help text to use, invoking the helper :helper Set a custom helper, overriding the form’s default :id The id attribute to use :key The base to use for the name and id attributes, based on the current namespace for the form. :label Set a label, invoking the labeler :labeler Set a custom labeler, overriding the form’s default :name The name attribute to use :obj Set the form object, overriding the form’s default :placeholder The placeholder attribute to use :required Set the required attribute if true :type Override the type of the input when the form has an associated object but the object does not respond to forme_input :value The value attribute to use for input tags, the content of the textarea for textarea tags, or the selected option(s) for select tags. :wrapper Set a custom wrapper, overriding the form’s default Input Type-Specific Options :checkbox Creates an input tag with type checkbox, as well as a hidden input tag. Options: :checked Mark the checkbox as checked. :hidden_value The value to use for the hidden input tag. :no_hidden Don’t create a hidden input tag. :radio Creates an input tag with type radio. Options: :checked Mark the radio button as checked. :date / :datetime By default, creates an input tag with type date or datetime. With the as: :select option, creates multiple select options. Options: :as When value is :select, uses 3 or 6 select boxes by default. :order The order of select boxes when using as: :select . Entries should be a symbol for the select field and string to use a string (:date default: [:year, '-', :month, '-', :day] ) (:datetime default: [:year, '-', :month, '-', :day, ' ', :hour, ':', :minute, ':', :second] ) :select_labels The labels to use for the select boxes. Should be a hash keyed by the symbol used (e.g. {:month=>'Month'} ). By default, no labels are used. :select_options The options to use for the select boxes. Should be a hash keyed by the symbol used in order (e.g. {:year=>1970..2020} ). The values can be a number used as both the value and the text of the option or an array with two elements, the first of which is the value for the option and the second of which is the text for the option. :select Creates a select tag, containing option tags specified by the :options option. Options: :add_blank Add a blank option if true. If the value is a string, use it as the text content of the blank option. The default value can be set with Forme.default_add_blank_prompt, and defaults to the empty string. :blank_attr If :add_blank is set, sets the attributes to use for the blank option. :blank_position If :add_blank is set, can be set to :after to add the prompt after the inputs, instead of before (which is the default). :multiple Creates a multiple select box. :optgroups An enumerable of pairs with the first element being option group labels or a hash of option group attributes, and values being enumerables of options (as described by :options below). Creates optgroup tags around the appropriate options. This overrides any options specified via :options. :options An enumerable of options used for creating option tags. If the :text_method and :value_method are not given and the entry is an array, uses the first entry of the array as the text of the option, and the last entry of the array as the value of the option. If the last entry of the array is a hash, uses the hash as the attributes for the option. If the option value is :hr , uses an hr tag (allowed in recent versions of the HTML standard). :selected The value that should be selected. Any options that are equal to this value (or included in this value if a multiple select box), are set to selected. :size Uses the size attribute on the tag :text_method If set, each entry in the array has this option called on it to get the text of the object. :value Same as :selected, but has lower priority. :value_method If set (and :text_method is set), each entry in the array has this method called on it to get the value of the option. :checkboxset Creates a set of checkbox inputs all using the same name. Supports the same options as the :select type, except that the :multiple option is assumed to be true. Also supports the following options: :tag_wrapper The wrapper transformer for individual tags in the set :tag_labeler The labeler transformer for individual tags in the set :tag_label_attr The attributes to use for labels for individual tags in the set :radioset Creates a set of radio buttons all using the same name. Supports the same options as the :checkboxset type. :textarea Creates a textarea tag. Options: :cols The number of columns in the text area. :rows The number of rows in the text area. :maxlength Use the maxlength attribute on the tag :minlength Use the minlength attribute on the tag all others Creates an input tag with the given type. This makes it easy to use inputs such as text and password, as well as newer HTML5 inputs such as number or email. Options: :size Uses the size attribute on the tag :maxlength Use the maxlength attribute on the tag :minlength Use the minlength attribute on the tag Form options These are the options supported by Forme::Form object, mostly used to set the defaults for Inputs created via the form: :after A callable object that is yielded the Form instance after yielding to the block. Can be used to add hidden inputs to the end of the form. :before A callable object that is yielded the Form instance before yielding to the block. Can be used to add hidden inputs to the start of the form. :config The configuration to use, which automatically sets defaults for the transformers to use. :errors A Hash of errors from a previous form submission, used to set default errors for inputs when the inputs use the :key option. :error_handler Sets the default error_handler for the form’s inputs :helper Sets the default helper for the form’s inputs :formatter Sets the default formatter for the form’s inputs :input_defaults Sets the default options for each input type. This should be a hash with input type keys, where the values are the hash of default options to use for the input type. :inputs_wrapper Sets the default inputs_wrapper for the form :labeler Sets the default labeler for the form’s inputs :namespace Sets the default namespace(s) to use for the form. Namespacing will automatically create namespaced name and id attributes for inputs that use the :key option. :obj Sets the default obj for the form’s inputs. :serializer Sets the serializer for the form :values The values from a previous form submission, used to set default values for inputs when the inputs use the :key option. :wrapper Sets the default wrapper for the form’s inputs For forms created by Forme.form, the following options are supported: :inputs An array of inputs to create inside the form, before yielding to the block. :button A button to add to the form, after yielding to the block. Internal Architecture Internally, Forme builds an abstract syntax tree of objects that represent the form. The abstract syntax tree goes through a series of transformations that convert it from high level abstract forms to low level abstract forms and finally to strings. Here are the main classes used by the library: Forme::Form main object Forme::Input high level abstract tag (a single Input could represent a select box with a bunch of options) Forme::Tag low level abstract tag representing an HTML tag (there would be a separate Tag for each option in a select box) The difference between Forme::Input and Forme::Tag is that Forme::Tag directly represents the underlying HTML tag, containing a type, optional attributes, and children, while the Forme::Input is more abstract and attempts to be user friendly. For example, these both compile by default to the same select tag: f . input ( :select , :options => [[ 'foo' , 1 ]]) # or f . tag ( :select , {}, [ f . tag ( :option , { :value => 1 }, [ 'foo' ])]) The group of objects that perform the transformations to the abstract syntax trees are known as transformers. Transformers use a functional style, and all use a call -based API, so you can use a Proc for any custom transformer. The processing of high level Forme::Input s into raw HTML fragments is performed through the following transformers: Formatter converts a Forme::Input instance into a Forme::Tag instance (or array of them). ErrorHandler If the Forme::Input instance has a error, takes the formatted tag and marks it as having the error. Helper If the Forme::Input instance has any help text, adds the help text in a separate tag. Labeler If the Forme::Input instance has a label, takes the formatted output and labels it. Wrapper Takes the output of the formatter, labeler, and error_handler transformers, and wraps it in another tag (or just returns it unmodified). Serializer converts a Forme::Tag instance into an HTML string. Technically, only the Serializer is necessary. The Forme::Form#input and Forme::Form#tag methods internally create Input and Tag objects. Before returning results, the input or tag is converted to a string using to_s , which calls the appropriate Serializer . The Serializer calls the appropriate Formatter if it encounters an Input instance, and attempts to serialize the output of that (which is usually a Tag instance). It is up to the Formatter to call the Labeler , ErrorHandler , Helper , and/or Wrapper . The Forme::Form object takes the transformers as options (:formatter, :labeler, :error_handler, :helper, :wrapper, and :serializer), all of which should be objects responding to call (so you can use Proc s) or be symbols registered with the library using Forme.register_transformer : Forme . register_transformer ( :wrapper , :p ) do | tag , input | input . tag ( :p , {}, tag ) end Most transformers are called with two arguments, tag and input . tag is a Forme::Tag instance, and input is a Forme::Input instance. The Formatter and Serializer transformers are the two exceptions, with Formatter being called with just an input , and Serializer potentionally being called with any object. The Serializer will in general recursively call itself with children of the argument given until a string is returned. There is also an InputsWrapper transformer, that is called by Forme::Form#inputs. It’s used to wrap up a group of related options (in a fieldset by default). It takes form (Forme::Form instance) and input_opts ( Hash ) arguments. Most of the transformers can be overridden on a per instance basis by pass | 2026-01-13T09:30:25 |
https://www.unicode.org/glossary/#unicode_transformation_format | 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 &amp; for "&" or &nbsp; 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://bundler.io/blog/2023/01/31/rust-gem-skeleton.html | Bundler: Generate gem skeleton with Rust extension Bundler Docs Team Blog Repository Generate gem skeleton with Rust extension by Josef Šimánek on Jan 31 2023 Do you think dynamically typed interpreted Ruby language and statically typed compiled Rust language could be friends? Yes, they can! And actually, they are! Officially it all started when YJIT was ported to Rust and Ruby codebase has officially onboarded Rust code . This friendship matured when RubyGems 3.3.11 (with a new Add cargo builder for rust extensions feature) was released capable of compiling Rust-based extensions during gem installation process (similar to well-known C-based gem extensions like nokogiri, pg or puma). And now, with Bundler 2.4, bundle gem skeleton generator can provide all the glue you need to start using Rust inside your gems thanks to the new --ext=rust parameter! What’s new? Thanks to new parameter it is possible to generate simple Rust-based gem extension. Make sure to use RubyGems 3.4.6 or higher for the best experience. Notice I already have bundle gem command configured. Your output can differ. When running bundle gem for the first time, it will interactively ask you few questions. $ bundle gem --ext=rust hello_rust Creating gem 'hello_rust'... MIT License enabled in config Initializing git repo in /home/retro/code/hello_rust create hello_rust/Gemfile create hello_rust/lib/hello_rust.rb create hello_rust/lib/hello_rust/version.rb create hello_rust/sig/hello_rust.rbs create hello_rust/hello_rust.gemspec create hello_rust/Rakefile create hello_rust/README.md create hello_rust/bin/console create hello_rust/bin/setup create hello_rust/.gitignore create hello_rust/test/test_helper.rb create hello_rust/test/test_hello_rust.rb create hello_rust/LICENSE.txt create hello_rust/Cargo.toml create hello_rust/ext/hello_rust/Cargo.toml create hello_rust/ext/hello_rust/extconf.rb create hello_rust/ext/hello_rust/src/lib.rs Gem 'hello_rust' was successfully created. For more information on making a RubyGem visit https://bundler.io/guides/creating_gem.html For Rust-based extension last 4 entries are interesting. hello_rust/Cargo.toml Top-level Cargo.toml is just pointing to “nested” Cargo.toml in ext folder. It is useful to be able to run all cargo commands in top-level directory (next to bundle , gem , …). It is also useful for your IDE to be able to recognize there is Rust code in this folder, but not in standard path for Rust crate. hello_rust/ext/hello_rust/Cargo.toml Actual Cargo.toml as known from Rust crates. It includes package metadata, configuration and dependencies. You can think of this file as a “gemspec for Rust packages”. hello_rust/ext/hello_rust/extconf.rb Config file responsible for configuration of compilation of your Rust code in Ruby world (for example during gem installation). Currently based on rb_sys gem . Check project README for more info. hello_rust/ext/hello_rust/src/lib.rs Yes, the holy grail of Rust-based extension - the Rust code! Hello from Rust! Generated hello_rust/ext/hello_rust/src/lib.rs contains hello world example method defined at base class of extension. In my case it is HelloRust#hello with 1 string argument returning string as well. It is using magnus Rust bindings to Ruby for super smooth developer experience. # hello_rust/ext/hello_rust/src/lib.rs use magnus ::{ define_module , function , prelude :: * , Error }; fn hello ( subject : String ) -> String { format! ( "Hello from Rust, {}!" , subject ) } #[magnus::init] fn init () -> Result < (), Error > { let module = define_module ( "HelloRust" ) ? ; module .define_singleton_method ( "hello" , function! ( hello , 1 )) ? ; Ok (()) } That is equivalent to following Ruby code, including some boilerplate code, to enable Rust extension to communicate with Ruby. module HelloRust def self . hello ( subject ) "Hello from Rust, #{ subject } !" end end Let’s compile and run some Rust! To be able to test this boilerplate code, you need to run bundle install first (to install all Ruby dependencies) followed by bundle exec rake compile compiling Rust code. Notice generated gemspec is not valid by default and running bundle install can break. In that case it is needed to update gemspec first and replace all TODO values with some real ones. $ bundle install Fetching gem metadata from https://rubygems.org/. Resolving dependencies... Using rake 13.0.6 Using bundler 2.4.0 Using hello_rust 0.1.0 from source at `.` Using minitest 5.16.3 Using rake-compiler 1.2.1 Using rb_sys 0.9.52 Bundle complete! 5 Gemfile dependencies, 6 gems now installed. Use `bundle info [gemname]` to see where a bundled gem is installed. At this stage, everything is ready to compile Rust code and glue it with Ruby. You need to have Rust already installed on your system. See rustup for a simple installation experience. $ bundle exec rake compile mkdir -p tmp/x86_64-linux/hello_rust/3.1.2 cd tmp/x86_64-linux/hello_rust/3.1.2 /home/retro/.rubies/ruby-3.1.2/bin/ruby -I. -r.rake-compiler-siteconf.rb ../../../../ext/hello_rust/extconf.rb cd - cd tmp/x86_64-linux/hello_rust/3.1.2 /usr/bin/gmake generating target/release/libhello_rust.so (release) cargo rustc --target-dir target --manifest-path ../../../../ext/hello_rust/Cargo.toml --lib --release -- -C linker=gcc -L native=/home/retro/.rubies/ruby-3.1.2/lib -C link-arg=-lm Updating crates.io index ... shortened Compiling magnus-macros v0.2.0 Compiling rb-sys-build v0.9.52 Compiling rb-sys v0.9.52 Compiling hello_rust v0.1.0 (/home/retro/code/hello_rust/ext/hello_rust) Finished release [optimized] target(s) in 1m 03s cd - mkdir -p tmp/x86_64-linux/stage/lib/hello_rust /usr/bin/gmake install target_prefix= generating target/release/libhello_rust.so (release) cargo rustc --target-dir target --manifest-path ../../../../ext/hello_rust/Cargo.toml --lib --release -- -C linker=gcc -L native=/home/retro/.rubies/ruby-3.1.2/lib -C link-arg=-lm Finished release [optimized] target(s) in 0.09s installing hello_rust.so to /home/retro/code/hello_rust/lib/hello_rust /usr/bin/install -c -m 0755 hello_rust.so /home/retro/code//hello_rust/lib/hello_rust cp tmp/x86_64-linux/hello_rust/3.1.2/hello_rust.so tmp/x86_64-linux/stage/lib/hello_rust/hello_rust.so And finally, it is possible to call hello method defined in Rust returning a string and printing it to the console. $ bundle exec ruby -rhello_rust -e 'puts HelloRust.hello("Josef")' "Hello from Rust, Josef!" Feel free to try to break this extension. For example you can try to pass different types of argument (like number or symbol). magnus is doing a great job automatically converting all those mistakes with friendly error messages. Summary Starting Bundler 2.4, you can generate gem skeleton with all boilerplate code needed to start using Rust. But it is not only about your custom Rust code you can easily integrate into gems now. Thanks to integration with cargo (Rust package manager) you can use any of Rust crates available. Rust ecosystem is well known for highly optimized and memory safe libraries. Thanks to magnus and bundle gem command, it is possible to glue those Rust libraries into Ruby world smoothly. Sky is the limit ;-) To see real-life example how powerful could be Rust for data processing, I recommend to check kirby project parsing logs for rubygems.org . Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://rubygems.org/gems/warning | warning | 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 warning 1.5.0 ruby-warning adds custom processing for warnings, including the ability to ignore specific warning messages, ignore warnings in specific files/directories, include backtraces with warnings, treat warnings as errors, deduplicate warnings, and add custom handling for all warnings in specific files/directories. Gemfile: = install: = Versions: 1.5.0 December 18, 2024 (10.5 KB) 1.4.0 May 24, 2024 (10 KB) 1.3.0 July 14, 2022 (10 KB) 1.2.1 October 04, 2021 (12.5 KB) 1.2.0 February 16, 2021 (12.5 KB) Show all versions (10 total) Development Dependencies (1): minitest-global_expectations >= 0 Show all transitive dependencies Owners: Pushed by: Authors: Jeremy Evans SHA 256 checksum: = ← Previous version Total downloads 60,966,051 For this version 9,046,117 Version Released: December 18, 2024 4:58pm License: MIT Required Ruby Version: >= 2.4.0 Links: Homepage Changelog Documentation 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://bundler.io/blog/2025/07/17/bundler-v2-7.html | Bundler: Bundler v2.7: last release before Bundler 4 Bundler Docs Team Blog Repository Bundler v2.7: last release before Bundler 4 by David Rodríguez on Jul 17 2025 A major release of Bundler is finally happening, consolidating unreleased major changes that had been pending for a decade. It will be named Bundler 4 (skipping Bundler 3), so that we can release it in lockstep with RubyGems 4, making the version number of Bundler & RubyGems in sync from now on. Final Bundler 4 release will happen at the end of 2025, but for now we’re presenting Bundler 2.7 as the last big step towards this major release. Bundler 2.7 features a simulate_version configuration that will allow users to configure Bundler to behave exactly as Bundler 4 will behave, with all major breaking changes enabled by default. We encourage all users to enable this setting, experiment with Bundler 4, and leave us feedback. Community feedback is super important to us, and we’re still open to revisiting the changes that the final version will include. You can find more about future Bundler 4 changes and how to enable Bundler 4 mode in our upgrade guide In addition to changes to get ready for Bundler 4, Bundler 2.7 also features some additional improvements such as: Our gem generator is now more customizable than ever, displays more informative output, and provides a skeleton with better defaults. Network errors are better handled to print more actionable errors and avoid unnecessary retries that will never succeed. Bundler is now more resilient in presence of incorrect lockfiles, or locally installed gemspecs with incorrect dependencies. Several issues have been fixed to make Bundler play nicer with default gems like rdoc or irb . Auto-switch and auto-restart mechanism based on locked version of Bundler has been improved. bundle install can now properly unlock rails (or any other gem including its own dependencies as a monorepo) when changing its Gemfile git source to pin it to a specific ref . Happy bundling! Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://bundler.io/blog/2021/02/15/a-more-secure-bundler-we-fixed-our-source-priorities.html | Bundler: A more secure bundler: We fixed our source priorities. Bundler Docs Team Blog Repository A more secure bundler: We fixed our source priorities. by David Rodríguez on Feb 15 2021 NOTE : Whereas the issue was initially fixed in bundler 2.2.10, it had to be reverted due to several problems caused by the initial approach. A proper fix was finally released with bundler 2.2.18. What happened? Last week an article about “Dependency Confusion” hit the news, where a developer was able to make thousands of dollars on bug bounty programs from big tech companies, by pushing libraries to public repositories that ended up unintentionally being installed into these companies servers. The developer was able to expose (in a non-malicious way) a vulnerability present in well-known dependency managers, where given a library name they will end up preferring installing it from a public source rather than from a private source. This is not secure because the name in the public source is controlled by the first person claiming it, whereas the name in the private source is controlled by the private source owner. Unfortunately, Bundler had this vulnerability. There’s good news though: Things were safe on the rubygems.org side The rubygems.org organization, in collaboration with diffend.io , have a pretty good malicious code detection system. In fact, the only reason this developer was able to make all this money by getting these gems installed in companies private servers is because our system detected them, flagged them for us, and we determined them to be non-malicious, and only for research purposes. If those gems had been malicious, we wouldn’t have allowed them. Check out the more detailed blog post from our diffend.io friends about what happened in the rubygems.org side of things, and how things were secure. The issue has been fixed in bundler 2.2.10 We have shipped bundler 2.2.10 with a fix, and now whenever you specify a block source in your Gemfile , bundler will prioritize it when resolving direct dependencies specified inside, and also transitive dependencies of those. So in the following situation both my-private-gem and my-another-private-gem will be picked up from https://my-private-server , even if someone pushes a higher version with the same name to rubygems.org : # my-private-gem.gemspec # ... gem . dependency ( "my-another-private-gem" ) # Gemfile source "https://rubygems.org" source "https://my-private-server" do gem "my-private-gem" end Make sure you upgrade your bundler version either by running gem install bundler , or by upgrading rubygems through gem update --system (which will install bundler 2.2.10 as a default gem). Final notes The bundler team had actually been aware of this issue for a while, but unfortunately lacks resources to take care of everything we need to take care, so the fix was postponed for too long. Maintaining the rubygems.org infrastructure and its client libraries requires a big amount of work and we barely manage to keep up with it. So, if your company really needs us to stay on top of these issues, please consider funding RubyTogether ❤️. That’s all for today, Happy bundling! Deivid, André and the RubyGems team Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-exec.1.html | Bundler: bundle exec Bundler Docs Team Blog Repository bundle exec bundle-exec - Execute a command in the context of the bundle bundle exec [--gemfile=GEMFILE] command Description This command executes the command, making all gems specified in the Gemfile(5) available to require in Ruby programs. Essentially, if you would normally have run something like rspec spec/my_spec.rb , and you want to use the gems specified in the Gemfile(5) and installed via bundle install(1) , you should run bundle exec rspec spec/my_spec.rb . Note that bundle exec does not require that an executable is available on your shell's $PATH . Options --gemfile=GEMFILE Use the specified gemfile instead of Gemfile(5) . Bundle Install --binstubs If you use the --binstubs flag in bundle install(1) , Bundler will automatically create a directory (which defaults to app_root/bin ) containing all of the executables available from gems in the bundle. After using --binstubs , bin/rspec spec/my_spec.rb is identical to bundle exec rspec spec/my_spec.rb . Environment Modifications bundle exec makes a number of changes to the shell environment, then executes the command you specify in full. make sure that it's still possible to shell out to bundle from inside a command invoked by bundle exec (using $BUNDLE_BIN_PATH ) put the directory containing executables (like rails , rspec , rackup ) for your bundle on $PATH make sure that if bundler is invoked in the subshell, it uses the same Gemfile (by setting BUNDLE_GEMFILE ) add -rbundler/setup to $RUBYOPT , which makes sure that Ruby programs invoked in the subshell can see the gems in the bundle It also modifies Rubygems: disallow loading additional gems not in the bundle modify the gem method to be a no-op if a gem matching the requirements is in the bundle, and to raise a Gem::LoadError if it's not Define Gem.refresh to be a no-op, since the source index is always frozen when using bundler, and to prevent gems from the system leaking into the environment Override Gem.bin_path to use the gems in the bundle, making system executables work Add all gems in the bundle into Gem.loaded_specs Finally, bundle exec also implicitly modifies Gemfile.lock if the lockfile and the Gemfile do not match. Bundler needs the Gemfile to determine things such as a gem's groups, autorequire , and platforms, etc., and that information isn't stored in the lockfile. The Gemfile and lockfile must be synced in order to bundle exec successfully, so bundle exec updates the lockfile beforehand. Loading By default, when attempting to bundle exec to a file with a ruby shebang, Bundler will Kernel.load that file instead of using Kernel.exec . For the vast majority of cases, this is a performance improvement. In a rare few cases, this could cause some subtle side-effects (such as dependence on the exact contents of $0 or __FILE__ ) and the optimization can be disabled by enabling the disable_exec_load setting. Shelling Out Any Ruby code that opens a subshell (like system , backticks, or %x{} ) will automatically use the current Bundler environment. If you need to shell out to a Ruby command that is not part of your current bundle, use the with_unbundled_env method with a block. Any subshells created inside the block will be given the environment present before Bundler was activated. For example, Homebrew commands run Ruby, but don't work inside a bundle: Bundler.with_unbundled_env do `brew install wget` end Using with_unbundled_env is also necessary if you are shelling out to a different bundle. Any Bundler commands run in a subshell will inherit the current Gemfile, so commands that need to run in the context of a different bundle also need to use with_unbundled_env . Bundler.with_unbundled_env do Dir.chdir "/other/bundler/project" do `bundle exec ./script` end end Bundler provides convenience helpers that wrap system and exec , and they can be used like this: Bundler.unbundled_system('brew install wget') Bundler.unbundled_exec('brew install wget') Rubygems Plugins At present, the Rubygems plugin system requires all files named rubygems_plugin.rb on the load path of any installed gem when any Ruby code requires rubygems.rb . This includes executables installed into the system, like rails , rackup , and rspec . Since Rubygems plugins can contain arbitrary Ruby code, they commonly end up activating themselves or their dependencies. For instance, the gemcutter 0.5 gem depended on json_pure . If you had that version of gemcutter installed (even if you also had a newer version without this problem), Rubygems would activate gemcutter 0.5 and json_pure <latest> . If your Gemfile (5) also contained json_pure (or a gem with a dependency on json_pure ), the latest version on your system might conflict with the version in your Gemfile (5) , or the snapshot version in your Gemfile.lock . If this happens, bundler will say: You have already activated json_pure 1.4.6 but your Gemfile requires json_pure 1.4.3. Consider using bundle exec. In this situation, you almost certainly want to remove the underlying gem with the problematic gem plugin. In general, the authors of these plugins (in this case, the gemcutter gem) have released newer versions that are more careful in their plugins. You can find a list of all the gems containing gem plugins by running ruby -e "puts Gem.find_files('rubygems_plugin.rb')" At the very least, you should remove all but the newest version of each gem plugin, and also remove all gem plugins that you aren't using ( gem uninstall gem_name ). Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 v1.14 v1.13 v1.12 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/extensions/inline-macro-processor/ | Inline Macro Processor | 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 Extensions API Write an Extension Inline Macro Processor 3.0 3.0 2.5 Edit this Page Inline Macro Processor An inline macro is very similar to a block macro. But instead of being replaced by a block created by a BlockMacroProcessor it is replaced by a phrase node that is simply a part of a block, e.g. in the middle of a sentence. An example for an inline macro is issue:333[repo=asciidoctor/asciidoctorj] . The structure is always like this: Macro name, e.g. issue One colon, i.e. : . This is what distinguishes it from a block macro even if it is alone in a paragraph. An optional target, e.g. 333 Optional attributes, e.g. [repo=asciidoctor/asciidoctorj] . Our example inline macro processor should create a link to the issue #333 of the repository asciidoctor/asciidoctorj on GitHub. If the attribute repo in the macro is empty it should fall back to the document attribute repo . So for the following document our inline macro processor should create links to the issue #333 of the repository asciidoctor/asciidoctorj and to the issue #2 for the repository asciidoctor/asciidoctorj-groovy-dsl . issue-inline-macro.adoc = InlineMacroProcessor Test Document :repo: asciidoctor/asciidoctorj-groovy-dsl You might want to take a look at the issue issue:333[repo=asciidoctor/asciidoctorj] and issue:2[]. The InlineMacroProcessor for these macros looks like this: An InlineMacroProcessor that replaces issue macros with links import org.asciidoctor.ast.PhraseNode; import org.asciidoctor.ast.StructuralNode; import org.asciidoctor.extension.InlineMacroProcessor; import org.asciidoctor.extension.Name; import java.util.HashMap; import java.util.Map; @Name("issue") (1) public class IssueInlineMacroProcessor extends InlineMacroProcessor { (2) @Override public PhraseNode process( (3) StructuralNode parent, String target, Map<String, Object> attributes) { String href = new StringBuilder() .append("https://github.com/") .append(attributes.containsKey("repo") ? attributes.get("repo") : parent.getDocument().getAttribute("repo")) .append("/issues/") .append(target).toString(); Map<String, Object> options = new HashMap<>(); options.put("type", ":link"); options.put("target", href); return createPhraseNode(parent, "anchor", target, attributes, options); (4) } } 1 The @Name annotation defines the macro name this InlineMacroProcessor should be called for. In this case this instance will be called for all inline macros that have the name issue . 2 All InlineMacroProcessors must extend the class org.asciidoctor.extension.InlineMacroProcessor . 3 A InlineMacroProcessor must implement the abstract method process that is called by Asciidoctor. The method must return the rendered result of this macro. 4 The implementation constructs and returns a new phrase node that is a link, i.e. an anchor via the method createPhraseNode() . The third parameter target defines that the text to render this link is the target of the macro, that means that the link will be rendered as 333 or 2 . The last parameter, the options, must contain the target of the line, i.e. the referenced URL, and that the type of the anchor is a link. It could also be a ':xref', a ':ref', or a ':bibref'. Creating phrase nodes The example above has shown how to create a link from a macro. But there are several other things that an InlineMacroProcessor can create like icons, inline images etc. Even though the following examples might not make much sense, they show how phrase nodes have to be created for the different use cases. Create keyboard macros To create keyboard icons like Ctrl + T which can be created directly in Asciidoctor via kbd:[Ctrl+T] you create the PhraseNode as shown below. The example assumes that the macro is called with the macro name ctrl and a key as the target, e.g. ctrl:S[] , and creates Ctrl + S from it. Create a phrase node for keys @Name("ctrl") public class KeyboardInlineMacroProcessor extends InlineMacroProcessor { @Override public PhraseNode process(StructuralNode parent, String target, Map<String, Object> attributes) { Map<String, Object> attrs = new HashMap<>(); attrs.put("keys", Arrays.asList("Ctrl", target)); (1) return createPhraseNode(parent, "kbd", (String) null, attrs); (2) } } 1 The attributes of the PhraseNode must contain the keys to be shown as a list for the attribute key keys . 2 Create a PhraseNode with context kbd and no text and return it. Create button or menu selection macros To create a menu selection as described at Button and Menu UI Macros a processor would create a PhraseNode with the menu context. The following processor would render the macro rightclick:New|Class[] like this: New   Class . Create a phrase node for menu selections. @Name("rightclick") public class ContextMenuInlineMacroProcessor extends InlineMacroProcessor { @Override public PhraseNode process(StructuralNode parent, String target, Map<String, Object> attributes) { String[] items = target.split("\\|"); Map<String, Object> attrs = new HashMap<>(); attrs.put("menu", "Right click"); (1) List<String> submenus = Arrays.asList(items).subList(0, items.length - 1); attrs.put("submenus", submenus); attrs.put("menuitem", items[items.length - 1]); return createPhraseNode(parent, "menu", (String) null, attrs); (2) } } 1 The attributes of the PhraseNode must contain the key menu referring to the first menu selection, submenus referring to a possibly empty list of submenu selections, and finally the key menuitem referring to the final menu item selection. 2 Create and return an PhraseNode with context menu and no text. Create inline images To create an inline image the PhraseNode must have the context image . The following example assumes that there is a site http://foo.bar that serves images given as the target of the macro. That means the MacroProcessor should replace the macro foo:1234 to an image element that refers to http://foo.bar/1234. Create a PhraseNode for inline image. @Name("foo") public class ImageInlineMacroProcessor extends InlineMacroProcessor { @Override public PhraseNode process(StructuralNode parent, String target, Map<String, Object> attributes) { Map<String, Object> options = new HashMap<String, Object>(); options.put("type", "image"); (1) options.put("target", "http://foo.bar/" + target); (2) String[] items = target.split("\\|"); Map<String, Object> attrs = new HashMap<String, Object>(); attrs.put("alt", "Image not available"); (3) attrs.put("width", "64"); attrs.put("height", "64"); return createPhraseNode(parent, "image", (String) null, attrs, options); (4) } } 1 For an inline image the option type must have the value image . 2 The URL of the image must be set via the option target . 3 Optional attributes alt for alternative text, width and height are set in the node attributes. Other possible attributes include title to define the title attribute of the img element when rendering to HTML. When setting the attribute link to any value the node will be converted to a link to that image, where the window can be defined via the attribute window . 4 Create and return a PhraseNode with context image and no text. We said at the start of this section that the target (the x in menu:x[] ) is optional. If you want a macro that does not have a target (for example cite:[brown79] ), add the following annotation to your class: @Name("cite") @Format(SHORT) class CiteInlineMacroProcessor extends InlineMacroProcessor { ... } With the SHORT format, the attributes are not parsed, and the 'target' that is passed to your macro is the value between the brackets ("brown79"). Positional attributes The first example here has shown how to access named attributes. But AsciiDoc also supports positional attributes where the meaning is implicitly derived from the position in the attribute list. In that example the attribute repo might also be defined as the first attribute so that the inline macro might also be written as issue:333[asciidoctor/asciidoctorj] . The following extension accepts the attribute repo as a positional attribute: Accept positional attributes in an inline macro import org.asciidoctor.ast.PhraseNode; import org.asciidoctor.ast.StructuralNode; import org.asciidoctor.extension.InlineMacroProcessor; import org.asciidoctor.extension.Name; import org.asciidoctor.extension.PositionalAttributes; @Name("issue") @PositionalAttributes({"repo"}) (1) public class IssueInlineMacroPositionalAttributesProcessor extends InlineMacroProcessor { @Override public PhraseNode process(StructuralNode parent, String target, Map<String, Object> attributes) { String href = new StringBuilder() .append("https://github.com/") .append(attributes.containsKey("repo") ? attributes.get("repo") : parent.getDocument().getAttribute("repo")) .append("/issues/") .append(target).toString(); Map<String, Object> options = new HashMap<>(); options.put("type", ":link"); options.put("target", href); return createPhraseNode(parent, "anchor", target, attributes, options); (4) } } 1 The annotation @PositionalAttributes defines the positional attributes and their order. If the macro accepted a second positional attribute comment the annotation would be @PositionalAttributes({"repo", "comment"}) . This extension will accept the macros in this document: = InlineMacroProcessor Test Document :repo: asciidoctor/asciidoctorj-groovy-dsl You might want to take a look at the issue issue:334[asciidoctor/asciidoctorj] and issue:3[]. Block Macro Processor Block Processor 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:25 |
https://lists.macports.org/pipermail/macports-dev/2016-December/subject.html#start | The macports-dev December 2016 Archive by subject December 2016 Archives by subject Messages sorted by: [ thread ] [ author ] [ date ] More info on this list... Starting: Thu Dec 1 01:23:36 CET 2016 Ending: Sat Dec 31 20:08:23 CET 2016 Messages: 333 [macports-contrib] branch master updated: portfile-gen: update python versions Ryan Schmidt [macports-ports] 01/01: Merge branch 'seqan_update' mf2k at macports.org [macports-ports] 01/01: Merge branch 'seqan_update' John Patrick [macports-ports] 02/03: python34: backport patch from #44288. Part of #51939. Maintainer timeout. Ryan Schmidt [macports-ports] branch master updated: Add myself back as maintainer - I was incorrectly removed in 2007 and just noticed. Ryan Schmidt [macports-ports] branch master updated: ds9: update to 7.5 Ryan Schmidt [macports-ports] branch master updated: fluid-soundfont, generaluser-soundfont: new ports Ryan Schmidt [macports-ports] branch master updated: fluid-soundfont, generaluser-soundfont: new ports René J.V. Bertin [macports-ports] branch master updated: fluid-soundfont, generaluser-soundfont: new ports Ryan Schmidt [macports-ports] branch master updated: fluid-soundfont, generaluser-soundfont: new ports René J.V. Bertin [macports-ports] branch master updated: fluid-soundfont, generaluser-soundfont: new ports Ryan Schmidt [macports-ports] branch master updated: gdal-grass: bump to 2.1.0 Ryan Schmidt [macports-ports] branch master updated: grass7: add more patches (__unix__ -> __APPLE__) Ryan Schmidt [macports-ports] branch master updated: grass: jump to 7.2RC2 (dubbed 7.1.99.2) Ryan Schmidt [macports-ports] branch master updated: grass: jump to 7.2RC2 (dubbed 7.1.99.2) Vincent Habchi [macports-ports] branch master updated: grass: jump to 7.2RC2 (dubbed 7.1.99.2) Mojca Miklavec [macports-ports] branch master updated: hidapi-devel: new port, version 0.8.0-20160920 Ryan Schmidt [macports-ports] branch master updated: hidapi-devel: new port, version 0.8.0-20160920 Rainer Müller [macports-ports] branch master updated: ocaml-zarith: update to 1.4.1 Ryan Schmidt [macports-ports] branch master updated: phonon-backend-gstreamer(-qt5): update to 4.9.0 and introduce new subport Lawrence Velázquez [macports-ports] branch master updated: phonon-backend-gstreamer(-qt5): update to 4.9.0 and introduce new subport Marko Käning [macports-ports] branch master updated: phonon-backend-gstreamer(-qt5): update to 4.9.0 and introduce new subport Lawrence Velázquez [macports-ports] branch master updated: phonon-backend-gstreamer(-qt5): update to 4.9.0 and introduce new subport Marko Käning [macports-ports] branch master updated: pingus: new port submission Lawrence Velázquez [macports-ports] branch master updated: pingus: new port submission Brandon Allbery [macports-ports] branch master updated: pingus: new port submission Ken Cunningham [macports-ports] branch master updated: pingus: new port submission Brandon Allbery [macports-ports] branch master updated: pingus: new port submission Brandon Allbery [macports-ports] branch master updated: sqlite3: revert to editline Lawrence Velázquez [MacPorts] #53049: gqrx dependency missing Wilhelm Speck [MacPorts] #53049: gqrx dependency missing Michael Dickens [MacPorts] #53049: gqrx dependency missing Ryan Schmidt [RJVB/macstrop] use github ID for maintainer (2fb8aab) René J.V. Bertin [RJVB/macstrop] use github ID for maintainer (2fb8aab) Rainer Müller [RJVB/macstrop] use github ID for maintainer (2fb8aab) René J.V. Bertin [RJVB/macstrop] use github ID for maintainer (2fb8aab) Rainer Müller [RJVB/macstrop] use github ID for maintainer (2fb8aab) René J.V. Bertin [RJVB/macstrop] use github ID for maintainer (2fb8aab) René J.V. Bertin [RJVB/macstrop] use github ID for maintainer (2fb8aab) Clemens Lang `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Jeremy Lavergne `port edit`, local/console vs. remote use Rainer Müller `port edit`, local/console vs. remote use Ryan Schmidt `port edit`, local/console vs. remote use Brandon Allbery `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Brandon Allbery `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Brandon Allbery `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Brandon Allbery `port edit`, local/console vs. remote use Clemens Lang `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Clemens Lang `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Rainer Müller `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Rainer Müller `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Rainer Müller `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Brandon Allbery `port edit`, local/console vs. remote use René J.V. Bertin `port edit`, local/console vs. remote use Bradley Giesbrecht A new category of ports: purgatory Mojca Miklavec Best practice for port contributors in github world Luc Bourhis Best practice for port contributors in github world Joshua Root Best practice for port contributors in github world Joshua Root Best practice for port contributors in github world Luc Bourhis Best practice for port contributors in github world Lawrence Velázquez Best way to fetch/extract sources of a dependency Mojca Miklavec Best way to fetch/extract sources of a dependency Rainer Müller Branching for 2.4 Joshua Root Branching for 2.4 Rainer Müller Branching for 2.4 Joshua Root Branching for 2.4 Joshua Root Branching for 2.4 Rainer Müller Branching for 2.4 Joshua Root Branching for 2.4 Rainer Müller Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Marko Käning Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Marko Käning Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Marko Käning Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Marko Käning Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Marko Käning Build Failure: cctools, libmacho, libmacho-headers Jeremy Huddleston Sequoia Build Failure: cctools, libmacho, libmacho-headers Rainer Müller Build Failure: gstreamer1-gst-plugins-bad, mesa, x265 Ryan Schmidt Central portindex'ing functional at the moment? Marko Käning Central portindex'ing functional at the moment? Marko Käning Central portindex'ing functional at the moment? Mojca Miklavec Central portindex'ing functional at the moment? Marko Käning Central portindex'ing functional at the moment? Marko Käning Central portindex'ing functional at the moment? Mojca Miklavec Central portindex'ing functional at the moment? Marko Käning Central portindex'ing functional at the moment? Fred Wright Command line switch to say yes to dependencies? Sterling Smith Command line switch to say yes to dependencies? mf2k at macports.org Command line switch to say yes to dependencies? Joshua Root Command line switch to say yes to dependencies? Clemens Lang Commits that implicitly close PRs do not remember doing so Lawrence Velázquez Commits that implicitly close PRs do not remember doing so Rainer Müller Commits that implicitly close PRs do not remember doing so Joshua Root Commits that implicitly close PRs do not remember doing so Mojca Miklavec Commits that implicitly close PRs do not remember doing so Ryan Schmidt Contributed patches for `port environment` and a more generalised `port info --var` René J.V. Bertin Criteria for picking compilers from fallback list ? Chris Jones Criteria for picking compilers from fallback list ? Joshua Root Criteria for picking compilers from fallback list ? Christopher Jones Criteria for picking compilers from fallback list ? Ryan Schmidt Criteria for picking compilers from fallback list ? Christopher Jones Criteria for picking compilers from fallback list ? Jeremy Huddleston Sequoia Criteria for picking compilers from fallback list ? Jeremy Huddleston Sequoia declaring variants/subports in loops and loop variables René J.V. Bertin declaring variants/subports in loops and loop variables Ryan Schmidt declaring variants/subports in loops and loop variables Joshua Root declaring variants/subports in loops and loop variables Ryan Schmidt declaring variants/subports in loops and loop variables Brandon Allbery declaring variants/subports in loops and loop variables René J.V. Bertin declaring variants/subports in loops and loop variables Brandon Allbery declaring variants/subports in loops and loop variables Joshua Root declaring variants/subports in loops and loop variables René J.V. Bertin declaring variants/subports in loops and loop variables Brandon Allbery declaring variants/subports in loops and loop variables René J.V. Bertin declaring variants/subports in loops and loop variables Brandon Allbery declaring variants/subports in loops and loop variables René J.V. Bertin declaring variants/subports in loops and loop variables Brandon Allbery declaring variants/subports in loops and loop variables René J.V. Bertin declaring variants/subports in loops and loop variables Brandon Allbery declaring variants/subports in loops and loop variables Joshua Root declaring variants/subports in loops and loop variables René J.V. Bertin declaring variants/subports in loops and loop variables Gustaf Neumann Feature Request: Buildbot triggering dependent port rebuilds in a cascade Marko Käning Feature Request: Buildbot triggering dependent port rebuilds in a cascade Ryan Schmidt Feature Request: Buildbot triggering dependent port rebuilds in a cascade Mojca Miklavec Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Joshua Root Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Clemens Lang Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Mojca Miklavec Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Clemens Lang Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Mojca Miklavec Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Clemens Lang Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more René J.V. Bertin Fwd: Build Failure: (from, 10.6, OS, This, X, builds, configure.compiler=macports-gcc-4.7, newer, on, only, and 6 more Clemens Lang Fwd: Your message to macports-changes awaits moderator approval Zero King Guidelines about trac tickets and pull requests Mojca Miklavec Guidelines about trac tickets and pull requests John Patrick Guidelines about trac tickets and pull requests Mojca Miklavec Guidelines about trac tickets and pull requests Arno Hautala Guidelines about trac tickets and pull requests Mojca Miklavec Guidelines about trac tickets and pull requests Ryan Schmidt How should ports refer to the 2-clause BSD license? Lawrence Velázquez How should ports refer to the 2-clause BSD license? Ryan Schmidt How should ports refer to the 2-clause BSD license? Lawrence Velázquez How should ports refer to the 2-clause BSD license? Ryan Schmidt How to properly add -stdlib=... (and other flags)? Mojca Miklavec How to properly add -stdlib=... (and other flags)? Joshua Root installing an older version of a port in the github era Ken Cunningham installing an older version of a port in the github era -- an answer Ken Cunningham installing an older version of a port in the github era -- an answer Fred Wright installing an older version of a port in the github era -- an answer Joshua Root installing an older version of a port in the github era -- an answer Ken Cunningham installing an older version of a port in the github era -- an answer Fred Wright interesting ruby build issue René J.V. Bertin interrupting rev-upgrade with v2.3.5 or a post-v2.3.5 master René J.V. Bertin interrupting rev-upgrade with v2.3.5 or a post-v2.3.5 master Joshua Root interrupting rev-upgrade with v2.3.5 or a post-v2.3.5 master René J.V. Bertin interrupting rev-upgrade with v2.3.5 or a post-v2.3.5 master Joshua Root interrupting rev-upgrade with v2.3.5 or a post-v2.3.5 master René J.V. Bertin KDE4 ports not built on Sierra buildbot? Marko Käning KDE4 ports not built on Sierra buildbot? Mojca Miklavec KDE4 ports not built on Sierra buildbot? Marko Käning KDE4 ports not built on Sierra buildbot? Mojca Miklavec KDE4 ports not built on Sierra buildbot? Ryan Schmidt macports-user repos Bradley Giesbrecht macports-user repos Rainer Müller Mirorring distfiles or enabling libcurl/openssl from MP Mojca Miklavec Mirorring distfiles or enabling libcurl/openssl from MP Rainer Müller Mirorring distfiles or enabling libcurl/openssl from MP Mojca Miklavec Mirorring distfiles or enabling libcurl/openssl from MP Rainer Müller mogenerator update [ticket 53019] review request Steven Tondeur mogenerator update [ticket 53019] review request Aljaž 'g5pw' Srebrnič octave: make distributable Marcus Calhoun-Lopez octave: make distributable Joshua Root Packaging an app Vincent Habchi Packaging an app Craig Treleaven Packaging an app Craig Treleaven Pasting with the mouse between tabs does not work (anymore) Mark Anderson port:libressl vs port:openssl, path-style variants and prebuilt binaries René J.V. Bertin port:libressl vs port:openssl, path-style variants and prebuilt binaries Mojca Miklavec port:libressl vs port:openssl, path-style variants and prebuilt binaries René J.V. Bertin port requires c++1y -> use cxx11 portgroup? Ken Cunningham port requires c++1y -> use cxx11 portgroup? Lawrence Velázquez port requires c++1y -> use cxx11 portgroup? Ken Cunningham port requires c++1y -> use cxx11 portgroup? Brandon Allbery port requires c++1y -> use cxx11 portgroup? Ken Cunningham port requires c++1y -> use cxx11 portgroup? Lawrence Velázquez ports using scons build system Ken Cunningham ports using scons build system Lawrence Velázquez ports using scons build system Ryan Schmidt ports using scons build system Ken Cunningham PR final steps (to squash or not to squash) René J.V. Bertin PR final steps (to squash or not to squash) Mojca Miklavec PR final steps (to squash or not to squash) René J.V. Bertin PR final steps (to squash or not to squash) Rainer Müller PR final steps (to squash or not to squash) René J.V. Bertin PR final steps (to squash or not to squash) Eric A. Borisch PR final steps (to squash or not to squash) Joshua Root PR final steps (to squash or not to squash) Eric A. Borisch PR final steps (to squash or not to squash) Joshua Root PR final steps (to squash or not to squash) Zero King PR final steps (to squash or not to squash) Lawrence Velázquez PR final steps (to squash or not to squash) Lawrence Velázquez PR final steps (to squash or not to squash) Lawrence Velázquez PR final steps (to squash or not to squash) Lawrence Velázquez PR final steps (to squash or not to squash) René J.V. Bertin PR final steps (to squash or not to squash) Rainer Müller PR final steps (to squash or not to squash) Rainer Müller PR final steps (to squash or not to squash) René J.V. Bertin PR final steps (to squash or not to squash) Rainer Müller PR final steps (to squash or not to squash) René J.V. Bertin PR final steps (to squash or not to squash) Mojca Miklavec PR final steps (to squash or not to squash) René J.V. Bertin PR final steps (to squash or not to squash) Rainer Müller PR final steps (to squash or not to squash) Lawrence Velázquez py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Joshua Root py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Marko Käning py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup René J.V. Bertin py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Joshua Root py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup René J.V. Bertin py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Joshua Root py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup René J.V. Bertin py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Joshua Root py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup René J.V. Bertin py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Joshua Root py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup René J.V. Bertin py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Marko Käning py-pyqt4: fix for the depends_lib reset caused by the Python PortGroup Joshua Root qtcurve update failure René J.V. Bertin qtcurve update failure Mojca Miklavec qtcurve update failure René J.V. Bertin qtcurve update failure Mojca Miklavec qtcurve update failure René J.V. Bertin qtcurve update failure Mojca Miklavec qtcurve update failure René J.V. Bertin qtcurve update failure René J.V. Bertin Question about bootstrapping MinGW Mojca Miklavec Question about bootstrapping MinGW Mojca Miklavec Question about bootstrapping MinGW Brandon Allbery Question about bootstrapping MinGW Mojca Miklavec Question about bootstrapping MinGW Brandon Allbery Report from the Reproducible Builds World Summit 2016 Clemens Lang Request for review and/or commit of #52730 Rainer Müller Requiring a specific variant in depends_lib Akim Demaille Requiring a specific variant in depends_lib Ryan Schmidt Requiring a specific variant in depends_lib Mojca Miklavec Review or Commit of #52814 scala2.12 David Strawn review request - cpplocate - used by glbinding example apps Ken Cunningham review request - glbinding - new C++ bindings for OpenGL Ken Cunningham rsync server out of date? Marcus Calhoun-Lopez rsync server out of date? Clemens Lang rsync server out of date? Ryan Schmidt rsync server out of date? Ryan Schmidt Some Homebrew commands send data to Google Analytics vs. port mpstats Russell Jones Some Homebrew commands send data to Google Analytics vs. port mpstats Joshua Root Some Homebrew commands send data to Google Analytics vs. port mpstats Clemens Lang SSL Issues and PortGroup GitHub John Patrick SSL Issues and PortGroup GitHub Daniel J. Luke SSL Issues and PortGroup GitHub Ryan Schmidt SSL Issues and PortGroup GitHub John Patrick SSL Issues and PortGroup GitHub Ryan Schmidt SSL Issues and PortGroup GitHub John Patrick SSL Issues and PortGroup GitHub Daniel J. Luke SSL Issues and PortGroup GitHub Joshua Root Tcl list-related 2.3.4 -> 2.3.5 changes? René J.V. Bertin Tcl list-related 2.3.4 -> 2.3.5 changes? Joshua Root Tcl list-related 2.3.4 -> 2.3.5 changes? Lawrence Velázquez Tcl list-related 2.3.4 -> 2.3.5 changes? René J.V. Bertin Template for pull requests Mojca Miklavec Thanks Thomas de Grivel Tickets affecting multiple ports and committers & "annoying" commits Mojca Miklavec Tickets affecting multiple ports and committers & "annoying" commits Ryan Schmidt Tickets affecting multiple ports and committers & "annoying" commits Mojca Miklavec tk not building on 10.6.8: #ifdef question in ticket 52090 Davide Liessi tuning the behaviour of the -u option? René J.V. Bertin tuning the behaviour of the -u option? Clemens Lang tuning the behaviour of the -u option? René J.V. Bertin tuning the behaviour of the -u option? René J.V. Bertin uncompressed .tar distfiles René J.V. Bertin uncompressed .tar distfiles Ryan Schmidt uncompressed .tar distfiles René J.V. Bertin Unintentional double commits Andrea D'Amore Unintentional double commits Rainer Müller Unintentional double commits Mojca Miklavec Unintentional double commits Zero King Unintentional double commits Rainer Müller Unintentional double commits Mojca Miklavec Unintentional double commits Ryan Schmidt Unintentional double commits Mojca Miklavec Unintentional double commits Marko Käning Unintentional double commits Ivan Larionov Unintentional double commits Mojca Miklavec Unintentional double commits Ivan Larionov Unintentional double commits Davide Liessi Unintentional double commits David Bariod Update mono, F#: support "select" Luc Bourhis Update mono, F#: support "select" Mojca Miklavec Update mono, F#: support "select" Luc Bourhis Update mono, F#: support "select" Mojca Miklavec Update mono, F#: support "select" Luc Bourhis Update mono, F#: support "select" Russell Jones Update mono, F#: support "select" Mojca Miklavec Update mono, F#: support "select" Rainer Müller xonsh-devel broken Marko Käning xonsh-devel broken Daniel J. Luke xonsh-devel broken Marko Käning xonsh-devel broken Andrea D'Amore xonsh-devel broken Daniel J. Luke xonsh-devel broken Joshua Root Your message to macports-changes awaits moderator approval Mojca Miklavec Your message to macports-changes awaits moderator approval Zero King Your message to macports-changes awaits moderator approval Mojca Miklavec Your message to macports-changes awaits moderator approval Rainer Müller Your message to macports-changes awaits moderator approval Mojca Miklavec Your message to macports-changes awaits moderator approval Rainer Müller Your message to macports-changes awaits moderator approval Rainer Müller Your message to macports-changes awaits moderator approval Ryan Schmidt Last message date: Sat Dec 31 20:08:23 CET 2016 Archived on: Sat Dec 31 20:08:27 CET 2016 Messages sorted by: [ thread ] [ author ] [ date ] More info on this list... This archive was generated by Pipermail 0.09 (Mailman edition). | 2026-01-13T09:30:25 |
https://rubygems.org/gems/simple_mailer | simple_mailer | 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 simple_mailer 1.3.0 Simple email library with testing support Gemfile: = install: = Versions: 1.3.0 May 01, 2015 (8 KB) 1.2.0 May 20, 2013 (7.5 KB) 1.1.1 December 30, 2009 (6 KB) 1.1.0 October 12, 2009 (6 KB) Owners: Authors: Jeremy Evans SHA 256 checksum: = ← Previous version Total downloads 14,196 For this version 3,679 Version Released: May 1, 2015 5:09pm Licenses: N/A Required Ruby Version: >= 0 Links: Documentation 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://bundler.io/v4.0/man/bundle.1.html | Bundler: bundle Bundler Docs Team Blog Repository bundle bundle - Ruby Dependency Management bundle COMMAND [--no-color] [--verbose] [ARGS] Description Bundler manages an application's dependencies through its entire life across many machines systematically and repeatably. See the bundler website for information on getting started, and Gemfile (5) for more information on the Gemfile format. Options --no-color Print all output without color --retry , -r Specify the number of times you wish to attempt network commands --verbose , -V Print out additional logging information Bundle Commands We divide bundle subcommands into primary commands and utilities: Primary Commands bundle install(1) Install the gems specified by the Gemfile or Gemfile.lock bundle update(1) Update dependencies to their latest versions bundle cache(1) Package the .gem files required by your application into the vendor/cache directory (aliases: bundle package , bundle pack ) bundle exec(1) Execute a script in the current bundle bundle config(1) Specify and read configuration options for Bundler bundle help(1) Display detailed help for each subcommand Utilities bundle add(1) Add the named gem to the Gemfile and run bundle install bundle binstubs(1) Generate binstubs for executables in a gem bundle check(1) Determine whether the requirements for your application are installed and available to Bundler bundle show(1) Show the source location of a particular gem in the bundle bundle outdated(1) Show all of the outdated gems in the current bundle bundle console(1) (deprecated) Start an IRB session in the current bundle bundle open(1) Open an installed gem in the editor bundle lock(1) Generate a lockfile for your dependencies bundle init(1) Generate a simple Gemfile , placed in the current directory bundle gem(1) Create a simple gem, suitable for development with Bundler bundle platform(1) Display platform compatibility information bundle clean(1) Clean up unused gems in your Bundler directory bundle doctor(1) Display warnings about common problems bundle remove(1) Removes gems from the Gemfile bundle plugin(1) Manage Bundler plugins bundle version(1) Prints Bundler version information Plugins When running a command that isn't listed in PRIMARY COMMANDS or UTILITIES, Bundler will try to find an executable on your path named bundler-<command> and execute it, passing down any extra arguments to it. Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 v1.14 v1.13 v1.12 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://www.unicode.org/versions/latest/core-spec/#G7404 | Core Spec – Unicode 17.0.0 Unicode 17.0.0 Tech Site • Site Map • Search Core Spec ‹ Previous • Next › Contents Preface 1 Introduction Coverage • Design Goals • Text Handling 2 General Structure Architectural Context • Unicode Design Principles • Compatibility Characters • Code Points and Characters • Encoding Forms • Encoding Schemes • Unicode Strings • Unicode Allocation • Details of Allocation • Writing Direction • Combining Characters • Equivalent Sequences • Special Characters • Conforming to the Unicode Standard 3 Conformance Versions of the Unicode Standard • Conformance Requirements • Semantics • Characters and Encoding • Properties • Combination • Decomposition • Surrogates • Unicode Encoding Forms • Unicode Encoding Schemes • Normalization Forms • Conjoining Jamo Behavior • Default Case Algorithms 4 Character Properties Unicode Character Database • Case • Combining Classes • Directionality • General Category • Numeric Value • Bidi Mirrored • Name • Unicode 1.0 Names • Letters, Alphabetic, and Ideographic • Properties for Text Boundaries • Characters with Unusual Properties • Characters and Sequences That Should Not Be Emitted 5 Implementation Guidelines Data Structures for Character Conversion • Programming Languages and Data Types • Unknown and Missing Characters • Handling Surrogate Pairs in UTF-16 • Handling Numbers • Normalization • Compression • Newline Guidelines • Regular Expressions • Language Information in Plain Text • Editing and Selection • Strategies for Handling Nonspacing Marks • Rendering Nonspacing Marks • Locating Text Element Boundaries • Identifiers • Sorting and Searching • Binary Order • Case Mappings • Mapping Compatibility Variants • Unicode Security • Ignoring Characters in Processing • U+FFFD Substitution in Conversion 6 Writing Systems and Punctuation Writing Systems • General Punctuation 7 Europe-I Latin • Greek • Coptic • Cyrillic • Glagolitic • Armenian • Georgian • Modifier Letters • Combining Marks 8 Europe-II Linear A • Linear B • Cypriot Syllabary • Cypro-Minoan • Ancient Anatolian Alphabets • Old Italic • Runic • Old Hungarian • Gothic • Elbasan • Caucasian Albanian • Vithkuqi • Todhri • Old Permic • Ogham • Shavian • Sidetic 9 Middle East-I Hebrew • Arabic • Syriac • Samaritan • Mandaic • Yezidi 10 Middle East-II Old North Arabian • Old South Arabian • Phoenician • Imperial Aramaic • Manichaean • Pahlavi and Parthian • Avestan • Chorasmian • Elymaic • Nabataean • Palmyrene • Hatran 11 Cuneiform and Hieroglyphs Sumero-Akkadian • Ugaritic • Old Persian • Egyptian Hieroglyphs • Meroitic • Anatolian Hieroglyphs 12 South and Central Asia-I Devanagari • Bengali (Bangla) • Gurmukhi • Gujarati • Oriya (Odia) • Tamil • Telugu • Kannada • Malayalam 13 South and Central Asia-II Thaana • Sinhala • Newa • Tibetan • Mongolian • Limbu • Meetei Mayek • Mro • Warang Citi • Ol Chiki • Ol Onal • Nag Mundari • Chakma • Lepcha • Saurashtra • Masaram Gondi • Gunjala Gondi • Wancho • Toto • Tangsa • Sunuwar • Gurung Khema • Kirat Rai • Tolong Siki 14 South and Central Asia-III Brahmi • Kharoshthi • Bhaiksuki • Phags-pa • Marchen • Zanabazar Square • Soyombo • Old Turkic • Old Sogdian • Sogdian • Old Uyghur 15 South and Central Asia-IV Syloti Nagri • Kaithi • Sharada • Takri • Siddham • Mahajani • Khojki • Dogra • Khudawadi • Multani • Tirhuta • Modi • Nandinagari • Grantha • Dives Akuru • Ahom • Sora Sompeng • Tulu-Tigalari 16 Southeast Asia-I Thai • Lao • Myanmar • Khmer • Tai Le • New Tai Lue • Tai Tham • Tai Viet • Kayah Li • Cham • Pahawh Hmong • Nyiakeng Puachue Hmong • Pau Cin Hau • Hanifi Rohingya • Tai Yo 17 Southeast Asia-II Philippine Scripts: Tagalog, Hanunóo, Buhid, and Tagbanwa • Buginese • Balinese • Javanese • Rejang • Batak • Sundanese • Makasar • Kawi 18 East Asia Han • Ideographic Description Characters • Bopomofo • Hiragana and Katakana • Halfwidth and Fullwidth Forms • Hangul • Yi • Nüshu • Lisu • Miao • Tangut • Khitan Small Script 19 Africa Ethiopic • Osmanya • Tifinagh • N’Ko • Vai • Bamum • Bassa Vah • Mende Kikakui • Adlam • Medefaidrin • Garay • Beria Erfe 20 Americas Cherokee • Canadian Aboriginal Syllabics • Osage • Deseret 21 Notational Systems Braille • Western Musical Symbols • Byzantine Musical Symbols • Znamenny Musical Notation • Ancient Greek Musical Notation • Duployan • Sutton SignWriting 22 Symbols Currency Symbols • Letterlike Symbols • Numerals • Superscript and Subscript Symbols • Mathematical Symbols • Invisible Mathematical Operators • Technical Symbols • Geometrical Symbols • Miscellaneous Symbols • Enclosed and Square 23 Special Areas and Format Characters Control Codes • Layout Controls • Deprecated Format Characters • Variation Selectors • Private-Use Characters • Surrogates Area • Noncharacters • Specials • Tag Characters 24 About the Code Charts Character Names List • CJK and Other Ideographs • Hangul Syllables A Notational Conventions Typographic Conventions • Extended BNF • Rendering B Unicode Publications and Resources The Unicode Consortium • Unicode Publications • Other Unicode Online Resources C Relationship to ISO/IEC 10646 History • Encoding Forms in ISO/IEC 10646 • UTF-8 and UTF-16 • Synchronization of the Standards • Identification of Features for Unicode • Character Names • Character Functional Specifications D Version History of the Standard E Han Unification History Development of the URO • Continuing Research on Ideographs • CJK Sources F Documentation of CJK Strokes Warning Unknown global ID in URL: . The Unicode® Standard Version 17.0 – Core Specification The Unicode Consortium This HTML version is authoritative. For archival purposes, a PDF version is produced directly from the HTML. Unicode Consortium South San Francisco Copyright and Terms of Use © 1991-2025 Unicode, Inc. Unicode and the Unicode Logo are registered trademarks of Unicode, Inc., in the United States and other countries. Use of all Unicode Products, including this publication, the Unicode Character Database and all associated materials and information, is governed by the Unicode Terms of Use . This publication is protected by copyright, and permission must be obtained from Unicode, Inc. prior to any reproduction, modification, or other use not permitted by the Terms of Use . For further information regarding permissions, inquire at https://www.unicode.org/reporting.html . The authors, contributors, and publishers have taken care in the preparation of this publication, the Unicode Character Database, and all associated materials and information, but make no express or implied representation or warranty of any kind and assume no responsibility or liability for errors or omissions or for consequential or incidental damages that may arise therefrom. This publication, the Unicode Character Database, and all associated materials and information are provided “AS-IS” without charge as a convenience to users. The Terms of Use apply. YOU ASSUME ALL RESPONSIBILITY AND RISK WITH RESPECT TO YOUR USE OF THIS PUBLICATION AND ASSOCIATED MATERIALS AND INFORMATION, WHICH ARE PROVIDED “AS IS” WITHOUT WARRANTY OF ANY KIND EITHER EXPRESS, IMPLIED, OR STATUTORY, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF ACCURACY, COMPLETENESS, TITLE, MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR NON-INFRINGEMENT OF THIRD PARTY RIGHTS. UNICODE AND ITS LICENSORS AND CONTRIBUTORS ASSUME NO RESPONSIBILITY FOR ERRORS OR OMISSIONS. IF YOU ARE DISSATISFIED WITH THIS PUBLICATION OR THE UNICODE PRODUCTS, YOUR SOLE REMEDY IS TO DISCONTINUE USE OF THIS PUBLICATION AND THE UNICODE PRODUCTS. IN NO EVENT SHALL UNICODE, ITS MEMBERS, OR ITS LICENSORS OR CONTRIBUTORS BE LIABLE FOR ANY CLAIM OR DAMAGES WHATSOEVER OF ANY KIND, WHETHER DIRECT, INDIRECT, SPECIAL, INCIDENTAL, CONSEQUENTIAL, EXEMPLARY, OR PUNITIVE DAMAGES, WHETHER OR NOT UNICODE WAS ADVISED OF THE POSSIBILITY OF SUCH DAMAGE, INCLUDING BUT NOT LIMITED TO DAMAGE RESULTING FROM LOSS OF USE, DATA, OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE, OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE, INABILITY TO USE, PERFORMANCE, FUNCTIONALITY, MODIFICATION, OR DISTRIBUTION OF THIS PUBLICATION AND ASSOCIATED MATERIALS AND INFORMATION. ISBN 978-1-936213-35-1 Published in South San Francisco September 9, 2025 The Unicode Standard, Version 17.0 © 1991-2025 Unicode, Inc. Unicode and the Unicode Logo are registered trademarks of Unicode, Inc. in the U.S. and other countries. See Terms of Use . | 2026-01-13T09:30:25 |
https://www.unicode.org/glossary/#utf | 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 &amp; for "&" or &nbsp; 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://github.com/jeremyevans/ruby-warning/actions/workflows/ci.yml | CI · Workflow runs · jeremyevans/ruby-warning · 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 / ruby-warning Public Notifications You must be signed in to change notification settings Fork 12 Star 295 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/ruby-warning 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 6 workflow runs 6 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 #41: Commit 4de5514 pushed by jeremyevans 21m 2s master master 21m 2s View workflow file Use SimpleCov.add_filter block instead of string CI #40: Commit 8086bcd pushed by jeremyevans 26s master master 26s View workflow file Switch rdoc task to normal rake task, avoid rdoc/task require CI #39: Commit b574f24 pushed by jeremyevans 25s master master 25s View workflow file Add Ruby 3.4 to CI CI #38: Commit f7e27cb pushed by jeremyevans 34s master master 34s View workflow file Bump version to 1.5.0 CI #37: Commit 1801230 pushed by jeremyevans 35s master master 35s View workflow file Use -W:strict_unused_block when running tests on Ruby 3.4+ CI #36: Commit b876514 pushed by jeremyevans 33s master master 33s View workflow file You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://rubygems.org/gems/asciidoctor/versions/2.0.26?locale=zh-CN | asciidoctor | RubyGems.org | 您的社区 Gem 托管中心 ⬢ RubyGems nav#focus mousedown->nav#mouseDown click@window->nav#hide"> Navigation menu autocomplete#choose mouseover->autocomplete#highlight"> 搜索 Gem …… Releases 博客 Gems 指南 登录 注册 asciidoctor 2.0.26 A fast, open source text processor and publishing toolchain for converting AsciiDoc content to HTML 5, DocBook 5, and other formats. Gemfile: = 安装: = 版本列表: 2.0.26 October 24, 2025 (278.0 KB) 2.0.25 October 16, 2025 (278.0 KB) 2.0.24 October 13, 2025 (277.5 KB) 2.0.23 May 17, 2024 (276.5 KB) 2.0.22 March 08, 2024 (276.0 KB) 显示所有版本 (共 78 个) Development 依赖 (9): concurrent-ruby ~> 1.1.0 cucumber ~> 3.1.0 erubi ~> 1.10.0 haml ~> 6.3.0 minitest ~> 5.22.0 nokogiri ~> 1.13.0 rake ~> 12.3.0 slim ~> 4.1.0 tilt ~> 2.0.0 显示所有传递性依赖 所有者: 推送者: 作者: Dan Allen, Sarah White, Ryan Waldron, Jason Porter, Nick Hengeveld, Jeremy McAnally SHA 256 校验和: = ← 以前的版本 下载总量 52,497,923 这个版本 363,442 版本发布: October 24, 2025 1:49am 许可: MIT 需要的 Ruby 版本: >= 0 链接: 主页 变更记录 源代码 邮件列表 Bug 追踪 下载 募集资金 审查变更 徽章 订阅 RSS 举报投诉 反向依赖 状态 服务运行时间 源代码 数据 统计 贡献 关于 帮助 API Policies Support Us 安全 RubyGems.org 是 Ruby 社区的 Gem 托管服务。立即 发布您的 Gem 并 安装它们 。 使用 API 来查找更多 可用的 Gem 。 快来成为一名贡献者吧！ 由您自己改善我们的网站。 RubyGems.org 是通过与更大的 Ruby 社区的合作得以实现的。 Fastly 提供带宽和 CDN 支持， Ruby Central 涵盖基础设施成本，并且 资助正在进行的开发和运营工作。 了解更多关于我们的赞助商以及他们是如何合作的 。 Operated by Ruby Central 设计 DockYard 托管 AWS 解析 DNSimple 监控 Datadog 服务 Fastly 监控 Honeybadger 安全保护 Mend.io English Nederlands 简体中文 正體中文 Português do Brasil Français Español Deutsch 日本語 | 2026-01-13T09:30:25 |
http://www.google.com/intl/en/about/#play-button | 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:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/guides/run-with-springboot/ | Running AsciidoctorJ with Spring Boot | 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 Running in Frameworks Running AsciidoctorJ with Spring Boot 3.0 3.0 2.5 Edit this Page Running AsciidoctorJ with Spring Boot Due to Spring Boot’s packaging system, Asciidoctorj won’t work out of the box from a single JAR application. Luckily Spring Boot plugins for Gradle and Maven provide options to fix it. Below you can find the required configurations to apply to Maven and Gradle. But read about extracting libraries during runtime for the details. Gradle configuration You just need to add the following configuration to your Gradle build. This will include not only AsciidoctorJ but others that also require unpacking like asciidoctor-pdf or asciidoctorj-diagram . bootJar { requiresUnpack '**/asciidoctorj-*.jar' } Maven configuration Similarly, for the Maven plugin add the following configuration to your POM. However, unlike in Gradle, wildcards are not allowed and dependencies need to be described one by one. Run mvn dependency:tree to find all required dependencies, including transitive ones. See this example for a full configuration. <plugin> <groupId>org.springframework.boot</groupId> <artifactId>spring-boot-maven-plugin</artifactId> <configuration> <requiresUnpack> <dependency> <groupId>org.asciidoctor</groupId> <artifactId>asciidoctorj</artifactId> </dependency> </requiresUnpack> </configuration> </plugin> Running AsciidoctorJ on WildFly Accessing the JRuby Instance 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:25 |
https://bundler.io/blog/2022/01/23/bundler-v2-3.html | Bundler: Bundler v2.3: Locking the version of Bundler itself Bundler Docs Team Blog Repository Bundler v2.3: Locking the version of Bundler itself by David Rodríguez on Jan 23 2022 2021 saw a fair amount of development in the RubyGems & Bundler repositories. We tried to release more often than ever to catch and fix bugs and distribute our improvements as early as possible to our users. That has led to 33 patch-level versions in the Bundler 2.x series released about a year ago. Our goal for Bundler 2.3 was to implement a long-wanted feature of being able to fully control the version of Bundler itself an application runs. There’s a long story with this feature, because it was shipped a few years ago in a manner that was too strict and ended up causing more harm than good, so had to be partially reverted. So, how did things work before Bundler 2.3? Up until now, RubyGems would try to activate the version of Bundler recorded in the Gemfile.lock file if already installed, and would fall back to the highest version installed otherwise. That’s better than nothing, but it did not ensure the exact version in the lockfile was always used, which led to workarounds like manually parsing the lockfile and then installing that version . And how do they work now? In Bundler 2.3 and up (if you also have RubyGems 3.3 or higher), running bundle install will use the exact version from the BUNDLED WITH section of the lockfile. If that version is not installed before you run bundle install , the running version of Bundler will install the locked version, and then run your original command using the newly-installed locked version. So, if you have a lockfile ending with BUNDLED WITH 2.2.33 and you only have Bundler 2.3.5 installed, you’ll see the following output when running bundle install . $ bundle install Bundler 2.3.5 is running, but your lockfile was generated with 2.2.33. Installing Bundler 2.2.33 and restarting using that version. Fetching gem metadata from https://rubygems.org/. Fetching bundler 2.2.33 Installing bundler 2.2.33 ... After that all your commands will automatically use Bundler 2.2.33, as specified by your lockfile. If you want to upgrade the Bundler version used by your application, you can run bundle update --bundler , and your lockfile will be regenerated using the latest version. From that moment, all users of the lockfile will automatically pick up the new version, no matter whether they have a newer or older version installed instead. But.. Why are we doing this? Being able to lock the version of Bundler itself, just like Bundler is able to lock other dependencies, has been a goal of the Bundler team for years. There are a number of benefits of locking your dependencies, like avoiding dependency nightmares where your application breaks due to third party releases, or avoiding “works on my machine” issues. Bundler has a ton of features and edge cases, and We sometimes introduce regressions when trying to improve things. Locking the version of Bundler prevents those issues from hitting you. Once in a while we need to put a security fix out there. Being able to lock the Bundler version allows you to ensure that every user of your application gets a secure version of Bundler. Occasionally, you might want to use a new feature of the Bundler DSL in your Gemfile. However, old versions of Bundler don’t understand this feature and you don’t want to suddenly break things for the users of yours that use those old versions. With version locking this is no longer a concern. Bundler is now able to upgrade itself to the version that your application understands. All in all, we aim to provide a less surprising, less error prone and more consistent experience when using Bundler, and let each application be in control of the version that they use, and the moment that they upgrade. What’s coming next? Future enhancements to this feature might include: Full support for gem "bundler", "<arbitrary_requirement>" in Gemfile . Automatic update of Bundler when running bundle install without a lockfile. Automatic update of Bundler when running bundle update . In other words, our end goal is to be able to treat Bundler just like any other dependency of your application. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://www.unicode.org/glossary/#scsu | 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 &amp; for "&" or &nbsp; 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://docs.asciidoctor.org/asciidoctorj/latest/guides/api-migration-guide-v25x-to-v30/ | AsciidoctorJ v3.0.x migration guide | 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 v3.0.x migration guide 3.0 3.0 2.5 Edit this Page AsciidoctorJ v3.0.x migration guide AsciidoctorJ v3.0.0 introduces breaking changes. This guide will provide the steps required to update a project currently using 2.5.x version. Update Preprocessors In earlier versions of AsciidoctorJ (up to 2.5.x), Preprocessors were provided with a Reader object that they had to modify directly. Unlike the Ruby implementation, the Java implementation of Asciidoctor did not support Preprocessors to return a new Reader . To address this limitation, AsciidoctorJ 3.0.0 has introduced a fix, enabling Preprocessors to create and return a new Reader . This enhancement allows Preprocessors to have more flexibility and enables a cleaner implementation. If you have existing Preprocessors, it is essential to update the signature of their process method to return a Reader object, even if the implementation does not create a new Reader object and returns null. The following example shows how to update a Preprocessor to return a new Reader : Preprocessor for AsciidoctorJ 2.5.x public static class MyPreprocessor extends Preprocessor { @Override public void process(Document document, PreprocessorReader reader) { // Do something with the reader } } To ensure compatibility with AsciidoctorJ 3.0.0, the process method of the Preprocessor needs to be modified to return a Reader . However, if you wish to maintain the same behavior as before, the method can simply return null . Preprocessor for AsciidoctorJ 3.x.x public static class MyPreprocessor extends Preprocessor { @Override public Reader process(Document document, PreprocessorReader reader) { // Do something with the reader return null; } } You may find it helpful to review the methods Processor::newReader and PreprocessorReader::read to simplify your code when creating a new Reader and reading the content of the existing Reader . However, please note that following the steps mentioned above will be sufficient to migrate your existing processor. Update Macro Processors In the earlier version of AsciidoctorJ (2.5.x), the signature of Macro Processors required the implementation to return an unrestricted Object. However, the specific type that a Macro Processor had to return was unclear, making it difficult to understand the necessary implementation steps. To address this issue, AsciidoctorJ 3.x.x has introduced the following changes: InlineMacroProcessor::process The implementation of this method now needs to return a PhraseNode . Please update your code accordingly to ensure that the returned value is of type PhraseNode . BlockMacroProcessor::process The implementation of this method now needs to return a StructuralNode . Make sure to modify your implementation to return a StructuralNode as required. Moreover, there was a problem with the first parameter of the process method in InlineMacroProcessors. Previously, it incorrectly expected a PhraseNode as the first parameter. To resolve this issue, AsciidoctorJ 3.x.x has rectified the first parameter of InlineMacroProcessor::process to be a StructuralNode . Please ensure that you update your code accordingly to reflect this change. If you have any further questions or concerns, please refer to the updated documentation. Update Inline Macro Processors If your existing InlineMacroProcessor looks like this for AsciidoctorJ 2.5.x: public class TestInlineMacro extends InlineMacroProcessor { @Override public Object process(ContentNode parent, String target, Map<String, Object> attributes) { return createPhraseNode(parent, "quoted", "This is from an Inline Macro"); } } then you have to change it to this for AsciidoctorJ 3.x.x: public class TestInlineMacro extends InlineMacroProcessor { @Override public PhraseNode process(StructuralNode parent, String target, Map<String, Object> attributes) { return createPhraseNode(parent, "quoted", "This is from an Inline Macro"); } } In the above example you can see that the return type and the type of the first parameter of the process method have changed. Update Block Macro Processors If your existing BlockMacroProcessor looks like this for AsciidoctorJ 2.5.x: public class TestBlockMacro extends BlockMacroProcessor { @Override public Object process(StructuralNode parent, String target, Map<String, Object> attributes) { return createBlock(parent, "paragraph", "This is from a Block Macro"); } } then you have to change it to this for AsciidoctorJ 3.x.x: public class TestBlockMacro extends BlockMacroProcessor { @Override public StructuralNode process(StructuralNode parent, String target, Map<String, Object> attributes) { return createBlock(parent, "paragraph", "This is from a Block Macro"); } } Removal of deprecated methods in org.asciidoctor.Options Several methods in org.asciidoctor.Options class that were marked as @Deprecated have been removed. This has been done to remove duplicated features and simplify the API interaction. Simplification of Options initialization In v2.5.x the following alternatives to initialize Options where possible: Using Java Constructor and setters Options options = new Options(); options.setBackend("html5"); options.setSafe(SafeMode.UNSAFE); options.setMkDirs(true); Using Map constructor Map<String, Object> optionsMap = new HashMap<>(); optionsMap.put("backend", "html5"); optionsMap.put("sage", SafeMode.UNSAFE); optionsMap.put("mkdirs", true); Options options = new Options(optionsMap); Using OptionsBuilder.options() and get() methods Options options = OptionsBuilder.options() .backend("html5") .mkDirs(true) .safe(SafeMode.UNSAFE) .get(); The new API streamlines the process with a more standard builder approach, in which Only interaction with org.asciidoctor.Options is required. Nested methods offer IDE completion and creation of immutable instances. Improved code readability through indentation. From v3.0.x, use the new builder() and build() methods from org.asciidoctor.Options . Using Options builder Options options = Options.builder() .backend("html5") .mkDirs(true) .safe(SafeMode.UNSAFE) .build(); Note that Options setter methods are still available, that means that Options instances can still be modified as in this example. Using setters on an instance Options options = Options.builder().build(); options.setBackend("html5"); options.setSafe(SafeMode.UNSAFE); options.setMkDirs(true) Free key-value insertion is still possible using: OptionsBuilder::option(String option, Object value) Options::setOption(String option, Object value) Simplification of Attributes injection in Options The previous API offered the following ways to inject attributes to an Options instance. Using Attributes instance setter Attributes attributes = new Attributes(); options.setAttributes(attributes); Using Map setter Map<String, Object> attributesMap = new HashMap<>(); attributesMap.put("toclevels", 2); attributesMap.put("icons", "font"); options.setAttributes(attributesMap); Also, in v2.5.x it is possible to pass attributes to an OptionsBuilder . Using OptionsBuilder’s Attributes instance setter Attributes attributes = new Attributes(); Options options = OptionsBuilder.options() .attributes(attributes) .get(); Using OptionsBuilder’s Map setter Map<String, Object> attributesMap = new HashMap<>(); attributesMap.put("toclevels", 2); attributesMap.put("icons", "font"); Options options = OptionsBuilder.options() .attributes(attributesMap) .get(); Using OptionsBuilder’s AttributesBuilder setter AttributesBuilder attributesBuilder = AttributesBuilder.attributes(); Options options = OptionsBuilder.options() .attributes(attributesBuilder) .get(); All these alternatives have been unified in two methods for Options and one for OptionsBuilder . Using Attributes setter in Options Attributes attributes = Attributes.builder() .icons("font") .build(); Options options = Options.builder().build(); options.setAttributes(attributes); Using attributes Map setter in Options Map<String, Object> attributesMap = new HashMap<>(); attributesMap.put("toclevels", 2); attributesMap.put("icons", "font"); Options options = Options.builder().build(); options.setAttributes(attributesMap); Using Attributes instance setter in OptionsBuilder Attributes attributes = Attributes.builder() .icons("font") .build(); Options options = Options.builder() .attributes(attributes) .build(); Free key-value or string insertion is still possible using: AttributesBuilder::attribute(String attributeName) AttributesBuilder::attribute(String attributeName, Object attributeValue) Attributes::setAttributes(String attributes) Attributes::setAttributes(String…​ attributes) Removal of deprecated methods in org.asciidoctor.Attributes Several methods in org.asciidoctor.Attributes class that were marked as @Deprecated have been removed. This has been done to remove duplicated features and simplify the API interaction. Simplification of Attributes initialization In v2.5.x the following alternatives to initialize Attributes where possible: Using Java Constructor and setters Attributes attributes = new Attributes(); attributes.setIcons("font"); attributes.setNoFooter(true); Using Map constructor Map<String, Object> attributesMap = new HashMap<>(); attributesMap.put("toclevels", 2); attributesMap.put("icons", "font"); Attributes attributes = new Attributes(attributesMap); Using AttributesBuilder.attributes() and get() methods Attributes attributes = AttributesBuilder.attributes() .icons("dont") .noFooter(true) .get(); The new API streamlines the process with a more standard builder approach, in which Only interaction with org.asciidoctor.Attributes is required. Nested methods offer IDE completion and creation of immutable instances. Improved code readability through indentation. From v3.0.x, use the new builder() and build() methods from org.asciidoctor.Attributes . Using Attributes builder Attributes attributes = Attributes.builder() .icons("dont") .noFooter(true) .build(); Note that Attributes setter methods are still available, that means that Attributes instances can still be modified as in this example. Using setters on an instance Attributes attributes = Attributes.builder().build(); attributes.setIcons("font"); attributes.setNoFooter(true); Free key-value insertion is still possible using: AttributesBuilder::attribute(String attributeName) AttributesBuilder::attribute(String attributeName, Object attributeValue) Attributes::setAttribute(String attributeName, Object attributeValue) Attributes::setAttributes(String attributes) Attributes::setAttributes(String…​ attributes) Attributes::setAttributes(Map<String, Object> attributes) Removal of asMap from OptionsBuilder and AttributesBuilder In v2.5.x it is possible to obtain the backing Map<String,Object> for both options and attributes. Obtaining backing Map for OptionsBuilder Map<String, Object> optionsMap = Options.builder() .backend("html5") .mkDirs(true) .safe(SafeMode.UNSAFE) .asMap(); Obtaining backing Map for AttributesBuilder Map<String, Object> attributesMap = Attributes.builder() .icons("font") .sectionNumbers(true) .asMap(); To remove feature duplication and avoid confusion between values in the actual org.asciidoctor.Attributes and org.asciidoctor.Options and their respective builders, asMap it’s no longer available in both builders. To obtain the backing up, use the map() method from the actual org.asciidoctor.Attributes and org.asciidoctor.Options instances. Options::map() and Attributes::map() are marked as deprecated and subject to change at some point, but are still maintained and safe to use in v3.0.x. Obtaining backing Map for Options Options options = Options.builder() .backend("html5") .mkDirs(true) .safe(SafeMode.UNSAFE) .build(); Map<String, Object> optionsMap = options.map(); Obtaining backing Map for Attributes Attributes attributes = Attributes.builder() .icons("font") .sectionNumbers(true) .build(); Map<String, Object> attributesMap = attributes.map(); Removal of deprecated methods in org.asciidoctor.Asciidoctor Several methods in org.asciidoctor.Asciidoctor that were marked as @Deprecated have been removed. Removal of methods using Map<String,Object> as options input To streamline the API, only methods using Options instances have been left in the org.asciidoctor.Asciidoctor . That means that the following methods are no longer available. Removed convert methods String convert(String content, Map<String, Object> options); String convertFile(File file, Map<String, Object> options); void convert(Reader contentReader, Writer rendererWriter, Map<String, Object> options) throws IOException; <T> T convert(String content, Map<String, Object> options, Class<T> expectedResult); <T> T convertFile(File file, Map<String, Object> options, Class<T> expectedResult); String[] convertDirectory(Iterable<File> directoryWalker, Map<String, Object> options); String[] convertFiles(Collection<File> files, Map<String, Object> options); Removed load methods Document load(String content, Map<String, Object> options); Document loadFile(File file, Map<String, Object> options); For each of the methods above there’s an equivalent using org.asciidoctor.Options . Use those when migrating to v3.0.0. Removal of methods using OptionsBuilder as options input Likewise to the methods seen in the previous section, the following methods are also no longer available. Removed convert methods String convert(String content, OptionsBuilder options); String convertFile(File file, OptionsBuilder options); void convert(Reader contentReader, Writer rendererWriter, OptionsBuilder options) throws IOException; <T> T convert(String content, OptionsBuilder options, Class<T> expectedResult); <T> T convertFile(File file, OptionsBuilder options, Class<T> expectedResult); String[] convertDirectory(Iterable<File> directoryWalker, OptionsBuilder options); String[] convertFiles(Collection<File> files, OptionsBuilder options); For each of the methods above there’s an equivalent using org.asciidoctor.Options . Use those when migrating to v3.0.0. Removal of methods readDocumentHeader All implementations of Asciidoctor::readDocumentHeader have been removed because the same feature can be obtained using load with the parse_header_only option. Using load to obtain Document header Options options = Options.builder().option("parse_header_only", true).build(); Document document = asciidoctor.loadFile(documentHeaders, options); List<Author> authors = document.getAuthors(); RevisionInfo revisionInfo = document.getRevisionInfo(); String doctitle = document.getDoctitle(); Title structuredDoctitle = document.getStructuredDoctitle(); As a consequence, class org.asciidoctor.ast.DocumentHeader has been also removed. Removal of deprecated methods in org.asciidoctor.ast.Document Several methods in org.asciidoctor.ast.Document that were marked as @Deprecated have been removed. For each of the removed methods, the equivalent can be found below. Removed deprecated methods String doctitle() boolean basebackend(String backend) Final methods String getDoctitle() boolean isBasebackend(String backend) Removal of deprecated constants from org.asciidoctor.extension.BlockProcessor All constants in org.asciidoctor.extension.BlockProcessor class that were marked as @Deprecated have been removed. You can find the new values in org.asciidoctor.extension.Contexts interface. See the table below for the equivalencies. Deprecated value Contexts value CONTEXTS KEY CONTEXT_OPEN OPEN CONTEXT_EXAMPLE EXAMPLE CONTEXT_SIDEBAR SIDEBAR CONTEXT_LITERAL LITERAL CONTEXT_LISTING LISTING CONTEXT_QUOTE QUOTE CONTEXT_PASS PASS CONTEXT_PARAGRAPH PARAGRAPH Removal of deprecated methods in org.asciidoctor.extension package Several methods under org.asciidoctor.extension that were marked as @Deprecated have been removed. The new methods align better with Java naming patterns and are easily identifiable. Removed deprecated methods PreprocessorReader::push_include Reader::getLineno Reader::lines Final methods PreprocessorReader::pushInclude Reader::getLineNumber Reader::getLines Removal of deprecated methods in org.asciidoctor.ast package Several methods under org.asciidoctor.ast that were marked as @Deprecated have been removed. The new methods align better with Java naming patterns and are easily identifiable. Here follows the list of affected interfaces, describing for each one the removed methods and the substitutions. Block Removed deprecated methods List<String> lines() String source() Final methods List<String> getLines() String getSource() DescriptionList, PhraseNode and List Removed deprecated method String render() Final method String convert() ContentNode Removed deprecated methods String id() ContentNode parent() String context() Document document() String role() Object getAttr(Object name, Object defaultValue, boolean inherit) Object getAttr(Object name, Object defaultValue) Object getAttr(Object name) boolean hasAttr(Object name) boolean hasAttr(Object name, boolean inherited) boolean isAttr(Object name, Object expected) boolean isAttr(Object name, Object expected, boolean inherit) boolean setAttr(Object name, Object value, boolean overwrite) Final methods String getId() ContentNode getParent() String getContext() Document getDocument() String getRole() Object getAttribute(Object name, Object defaultValue, boolean inherit) Object getAttribute(Object name, Object defaultValue) Object getAttribute(Object name) boolean hasAttribute(Object name) boolean hasAttribute(Object name, boolean inherited) boolean isAttribute(Object name, Object expected) boolean isAttribute(Object name, Object expected, boolean inherit) boolean setAttribute(Object name, Object value, boolean overwrite) Section On top of the methods replaced by Java getters, both number and getNumber are replaced by getNumeral . This is done to support non-number numerals. Removed deprecated methods int index() int number() int getNumber() String sectname() boolean special() boolean numbered() Final methods int getIndex() String getNumeral() String getSectionName() boolean isSpecial() boolean isNumbered() StructuralNode Removed deprecated methods Object content() String style() String title() List<StructuralNode> blocks() Final methods Object getContent() String getStyle() String getTitle() List<StructuralNode> getBlocks() Automatically Load a Syntax Highlighter Extension Migration: 1.6.x to 2.0.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:25 |
https://bundler.io/whats_new.html | Bundler: The best way to manage a Ruby application's gems Bundler Docs Team Blog Repository What’s New in v2.7 The Bundler 2.7 announcement includes context and a more detailed explanation of the changes in this version. This is a summary of the biggest changes. As always, a detailed list of every change is provided in the changelog . A new setting to simulate the next major version (Bundler 4) With Bundler 2.7, you can configure bundle config set simulate_version 4 and get all future Bundler 4 defaults enabled by default. Please do use this setting and contribute to Bundler 4 by leaving us feedback. Other notable changes Improved and more configurable gem generator. Better network error handling. More resiliency in presence of incorrect lockfiles, or locally installed gemspecs with incorrect dependencies. Improved support for default gems like rdoc or irb . Improved auto-switch and auto-restart mechanism based on locked version of Bundler. Better git source unlocking. Full 2.7 changelog Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 v1.14 v1.13 v1.12 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://rubygems.org/gems/simple_ldap_authenticator | simple_ldap_authenticator | 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 simple_ldap_authenticator 1.2.0 Easy authentication to an LDAP server(s) Gemfile: = install: = Versions: 1.2.0 September 16, 2024 (6.5 KB) 1.1.0 July 19, 2022 (7 KB) 1.0.1 August 03, 2011 (5.5 KB) 1.0.0 October 12, 2009 (5 KB) Development Dependencies (4): eventmachine >= 0 minitest-global_expectations >= 0 net-ldap >= 0 ruby-ldap >= 0 Show all transitive dependencies Owners: Pushed by: Authors: Jeremy Evans SHA 256 checksum: = ← Previous version Total downloads 12,436 For this version 1,198 Version Released: September 16, 2024 8:01pm Licenses: N/A Required Ruby Version: >= 0 Links: 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:25 |
https://bundler.io/v4.0/man/bundle-outdated.1.html | Bundler: bundle outdated Bundler Docs Team Blog Repository bundle outdated bundle-outdated - List installed gems with newer versions available bundle outdated [GEM] [--local] [--pre] [--source] [--filter-strict | --strict] [--update-strict] [--parseable | --porcelain] [--group=GROUP] [--groups] [--patch|--minor|--major] [--filter-major] [--filter-minor] [--filter-patch] [--only-explicit] Description Outdated lists the names and versions of gems that have a newer version available in the given source. Calling outdated with [GEM [GEM]] will only check for newer versions of the given gems. Prerelease gems are ignored by default. If your gems are up to date, Bundler will exit with a status of 0. Otherwise, it will exit 1. Options --local Do not attempt to fetch gems remotely and use the gem cache instead. --pre Check for newer pre-release gems. --source=<list> Check against a specific source. --filter-strict , --strict Only list newer versions allowed by your Gemfile requirements, also respecting conservative update flags (--patch, --minor, --major). --update-strict Strict conservative resolution, do not allow any gem to be updated past latest --patch | --minor | --major. --parseable , --porcelain Use minimal formatting for more parseable output. --group=GROUP List gems from a specific group. --groups List gems organized by groups. --minor Prefer updating only to next minor version. --major Prefer updating to next major version (default). --patch Prefer updating only to next patch version. --filter-major Only list major newer versions. --filter-minor Only list minor newer versions. --filter-patch Only list patch newer versions. --only-explicit Only list gems specified in your Gemfile, not their dependencies. Patch Level Options See bundle update(1) for details. Filtering Output The 3 filtering options do not affect the resolution of versions, merely what versions are shown in the output. If the regular output shows the following: * Gem Current Latest Requested Groups * faker 1.6.5 1.6.6 ~> 1.4 development, test * hashie 1.2.0 3.4.6 = 1.2.0 default * headless 2.2.3 2.3.1 = 2.2.3 test --filter-major would only show: * Gem Current Latest Requested Groups * hashie 1.2.0 3.4.6 = 1.2.0 default --filter-minor would only show: * Gem Current Latest Requested Groups * headless 2.2.3 2.3.1 = 2.2.3 test --filter-patch would only show: * Gem Current Latest Requested Groups * faker 1.6.5 1.6.6 ~> 1.4 development, test Filter options can be combined. --filter-minor and --filter-patch would show: * Gem Current Latest Requested Groups * faker 1.6.5 1.6.6 ~> 1.4 development, test Combining all three filter options would be the same result as providing none of them. Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 v1.14 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/gemfile.5.html | Bundler: gemfile Bundler Docs Team Blog Repository gemfile Gemfile - A format for describing gem dependencies for Ruby programs A Gemfile describes the gem dependencies required to execute associated Ruby code. Place the Gemfile in the root of the directory containing the associated code. For instance, in a Rails application, place the Gemfile in the same directory as the Rakefile . Syntax A Gemfile is evaluated as Ruby code, in a context which makes available a number of methods used to describe the gem requirements. Global Source At the top of the Gemfile , add a single line for the RubyGems source that contains the gems listed in the Gemfile . source "https://rubygems.org" You can add only one global source. In Bundler 1.13, adding multiple global sources was deprecated. The source MUST be a valid RubyGems repository. To use more than one source of RubyGems, you should use source block . A source is checked for gems following the heuristics described in SOURCE PRIORITY . Note about a behavior of the feature deprecated in Bundler 1.13 : If a gem is found in more than one global source, Bundler will print a warning after installing the gem indicating which source was used, and listing the other sources where the gem is available. A specific source can be selected for gems that need to use a non-standard repository, suppressing this warning, by using the :source option or source block. Credentials Some gem sources require a username and password. Use bundle config(1) to set the username and password for any of the sources that need it. The command must be run once on each computer that will install the Gemfile, but this keeps the credentials from being stored in plain text in version control. bundle config gems.example.com user:password For some sources, like a company Gemfury account, it may be easier to include the credentials in the Gemfile as part of the source URL. source "https://user:password@gems.example.com" Credentials in the source URL will take precedence over credentials set using config . Ruby If your application requires a specific Ruby version or engine, specify your requirements using the ruby method, with the following arguments. All parameters are OPTIONAL unless otherwise specified. Version (required) The version of Ruby that your application requires. If your application requires an alternate Ruby engine, such as JRuby, TruffleRuby, etc., this should be the Ruby version that the engine is compatible with. ruby "3.1.2" If you wish to derive your Ruby version from a version file (ie .ruby-version), you can use the file option instead. ruby file: ".ruby-version" The version file should conform to any of the following formats: 3.1.2 (.ruby-version) ruby 3.1.2 (.tool-versions, read: https://asdf-vm.com/manage/configuration.html#tool-versions) Engine Each application may specify a Ruby engine. If an engine is specified, an engine version must also be specified. What exactly is an Engine? A Ruby engine is an implementation of the Ruby language. For background: the reference or original implementation of the Ruby programming language is called Matz's Ruby Interpreter , or MRI for short. This is named after Ruby creator Yukihiro Matsumoto, also known as Matz. MRI is also known as CRuby, because it is written in C. MRI is the most widely used Ruby engine. Other implementations of Ruby exist. Some of the more well-known implementations include JRuby and TruffleRuby . Rubinius is an alternative implementation of Ruby written in Ruby. JRuby is an implementation of Ruby on the JVM, short for Java Virtual Machine. TruffleRuby is a Ruby implementation on the GraalVM, a language toolkit built on the JVM. Engine Version Each application may specify a Ruby engine version. If an engine version is specified, an engine must also be specified. If the engine is "ruby" the engine version specified must match the Ruby version. ruby "2.6.8", engine: "jruby", engine_version: "9.3.8.0" Patchlevel Each application may specify a Ruby patchlevel. Specifying the patchlevel has been meaningless since Ruby 2.1.0 was released as the patchlevel is now uniquely determined by a combination of major, minor, and teeny version numbers. This option was implemented in Bundler 1.4.0 for Ruby 2.0 or earlier. ruby "3.1.2", patchlevel: "20" Gems Specify gem requirements using the gem method, with the following arguments. All parameters are OPTIONAL unless otherwise specified. Name (required) For each gem requirement, list a single gem line. gem "nokogiri" Version Each gem MAY have one or more version specifiers. gem "nokogiri", ">= 1.4.2" gem "RedCloth", ">= 4.1.0", "< 4.2.0" Require As Each gem MAY specify files that should be used when autorequiring via Bundler.require . You may pass an array with multiple files or true if the file you want required has the same name as gem or false to prevent any file from being autorequired. gem "redis", require: ["redis/connection/hiredis", "redis"] gem "webmock", require: false gem "byebug", require: true The argument defaults to the name of the gem. For example, these are identical: gem "nokogiri" gem "nokogiri", require: "nokogiri" gem "nokogiri", require: true Groups Each gem MAY specify membership in one or more groups. Any gem that does not specify membership in any group is placed in the default group. gem "rspec", group: :test gem "wirble", groups: [:development, :test] The Bundler runtime allows its two main methods, Bundler.setup and Bundler.require , to limit their impact to particular groups. # setup adds gems to Ruby's load path Bundler.setup # defaults to all groups require "bundler/setup" # same as Bundler.setup Bundler.setup(:default) # only set up the _default_ group Bundler.setup(:test) # only set up the _test_ group (but `not` _default_) Bundler.setup(:default, :test) # set up the _default_ and _test_ groups, but no others # require requires all of the gems in the specified groups Bundler.require # defaults to the _default_ group Bundler.require(:default) # identical Bundler.require(:default, :test) # requires the _default_ and _test_ groups Bundler.require(:test) # requires the _test_ group The Bundler CLI allows you to specify a list of groups whose gems bundle install should not install with the without configuration. To specify multiple groups to ignore, specify a list of groups separated by spaces. bundle config set --local without test bundle config set --local without development test Also, calling Bundler.setup with no parameters, or calling require "bundler/setup" will setup all groups except for the ones you excluded via --without (since they are not available). Note that on bundle install , bundler downloads and evaluates all gems, in order to create a single canonical list of all of the required gems and their dependencies. This means that you cannot list different versions of the same gems in different groups. For more details, see Understanding Bundler . Platforms If a gem should only be used in a particular platform or set of platforms, you can specify them. Platforms are essentially identical to groups, except that you do not need to use the --without install-time flag to exclude groups of gems for other platforms. There are a number of Gemfile platforms: ruby C Ruby (MRI), Rubinius, or TruffleRuby, but not Windows mri C Ruby (MRI) only, but not Windows windows Windows C Ruby (MRI), including RubyInstaller 32-bit and 64-bit versions mswin Windows C Ruby (MRI), including RubyInstaller 32-bit versions mswin64 Windows C Ruby (MRI), including RubyInstaller 64-bit versions rbx Rubinius jruby JRuby truffleruby TruffleRuby On platforms ruby , mri , mswin , mswin64 , and windows , you may additionally specify a version by appending the major and minor version numbers without a delimiter. For example, to specify that a gem should only be used on platform ruby version 3.1, use: ruby_31 As with groups (above), you may specify one or more platforms: gem "weakling", platforms: :jruby gem "ruby-debug", platforms: :mri_31 gem "nokogiri", platforms: [:windows_31, :jruby] All operations involving groups ( bundle install , Bundler.setup , Bundler.require ) behave exactly the same as if any groups not matching the current platform were explicitly excluded. The following platform values are deprecated and should be replaced with windows : mswin , mswin64 , mingw32 , x64_mingw Note that, while unfortunately using the same terminology, the values of this option are different from the values that bundle lock --add-platform can take. The values of this option are more closer to "Ruby Implementation" while the values that bundle lock --add-platform understands are more related to OS and architecture of the different systems where your lockfile will be used. Force_ruby_platform If you always want the pure ruby variant of a gem to be chosen over platform specific variants, you can use the force_ruby_platform option: gem "ffi", force_ruby_platform: true This can be handy (assuming the pure ruby variant works fine) when: You're having issues with the platform specific variant. The platform specific variant does not yet support a newer ruby (and thus has a required_ruby_version upper bound), but you still want your Gemfile{.lock} files to resolve under that ruby. Source You can select an alternate RubyGems repository for a gem using the ':source' option. gem "some_internal_gem", source: "https://gems.example.com" This forces the gem to be loaded from this source and ignores the global source declared at the top level of the file. If the gem does not exist in this source, it will not be installed. Bundler will search for child dependencies of this gem by first looking in the source selected for the parent, but if they are not found there, it will fall back on the global source. Note about a behavior of the feature deprecated in Bundler 1.13 : Selecting a specific source repository this way also suppresses the ambiguous gem warning described above in GLOBAL SOURCE . Using the :source option for an individual gem will also make that source available as a possible global source for any other gems which do not specify explicit sources. Thus, when adding gems with explicit sources, it is recommended that you also ensure all other gems in the Gemfile are using explicit sources. Git If necessary, you can specify that a gem is located at a particular git repository using the :git parameter. The repository can be accessed via several protocols: HTTP(S) gem "rails", git: "https://github.com/rails/rails.git" SSH gem "rails", git: "git@github.com:rails/rails.git" git gem "rails", git: "git://github.com/rails/rails.git" If using SSH, the user that you use to run bundle install MUST have the appropriate keys available in their $HOME/.ssh . NOTE : http:// and git:// URLs should be avoided if at all possible. These protocols are unauthenticated, so a man-in-the-middle attacker can deliver malicious code and compromise your system. HTTPS and SSH are strongly preferred. The group , platforms , and require options are available and behave exactly the same as they would for a normal gem. A git repository SHOULD have at least one file, at the root of the directory containing the gem, with the extension .gemspec . This file MUST contain a valid gem specification, as expected by the gem build command. If a git repository does not have a .gemspec , bundler will attempt to create one, but it will not contain any dependencies, executables, or C extension compilation instructions. As a result, it may fail to properly integrate into your application. If a git repository does have a .gemspec for the gem you attached it to, a version specifier, if provided, means that the git repository is only valid if the .gemspec specifies a version matching the version specifier. If not, bundler will print a warning. gem "rails", "2.3.8", git: "https://github.com/rails/rails.git" # bundle install will fail, because the .gemspec in the rails # repository's master branch specifies version 3.0.0 If a git repository does not have a .gemspec for the gem you attached it to, a version specifier MUST be provided. Bundler will use this version in the simple .gemspec it creates. Git repositories support a number of additional options. branch , tag , and ref You MUST only specify at most one of these options. The default is branch: "master" . For example: gem "rails", git: "https://github.com/rails/rails.git", branch: "5-0-stable" gem "rails", git: "https://github.com/rails/rails.git", tag: "v5.0.0" gem "rails", git: "https://github.com/rails/rails.git", ref: "4aded" submodules For reference, a git submodule lets you have another git repository within a subfolder of your repository. Specify submodules: true to cause bundler to expand any submodules included in the git repository If a git repository contains multiple .gemspecs , each .gemspec represents a gem located at the same place in the file system as the .gemspec . |~rails [git root] | |-rails.gemspec [rails gem located here] |~actionpack | |-actionpack.gemspec [actionpack gem located here] |~activesupport | |-activesupport.gemspec [activesupport gem located here] |... To install a gem located in a git repository, bundler changes to the directory containing the gemspec, runs gem build name.gemspec and then installs the resulting gem. The gem build command, which comes standard with Rubygems, evaluates the .gemspec in the context of the directory in which it is located. Git Source A custom git source can be defined via the git_source method. Provide the source's name as an argument, and a block which receives a single argument and interpolates it into a string to return the full repo address: git_source(:stash){ |repo_name| "https://stash.corp.acme.pl/#{repo_name}.git" } gem 'rails', stash: 'forks/rails' In addition, if you wish to choose a specific branch: gem "rails", stash: "forks/rails", branch: "branch_name" Github NOTE : This shorthand should be avoided until Bundler 2.0, since it currently expands to an insecure git:// URL. This allows a man-in-the-middle attacker to compromise your system. If the git repository you want to use is hosted on GitHub and is public, you can use the :github shorthand to specify the github username and repository name (without the trailing ".git"), separated by a slash. If both the username and repository name are the same, you can omit one. gem "rails", github: "rails/rails" gem "rails", github: "rails" Are both equivalent to gem "rails", git: "https://github.com/rails/rails.git" Since the github method is a specialization of git_source , it accepts a :branch named argument. You can also directly pass a pull request URL: gem "rails", github: "https://github.com/rails/rails/pull/43753" Which is equivalent to: gem "rails", github: "rails/rails", branch: "refs/pull/43753/head" Gist If the git repository you want to use is hosted as a GitHub Gist and is public, you can use the :gist shorthand to specify the gist identifier (without the trailing ".git"). gem "the_hatch", gist: "4815162342" Is equivalent to: gem "the_hatch", git: "https://gist.github.com/4815162342.git" Since the gist method is a specialization of git_source , it accepts a :branch named argument. Bitbucket If the git repository you want to use is hosted on Bitbucket and is public, you can use the :bitbucket shorthand to specify the bitbucket username and repository name (without the trailing ".git"), separated by a slash. If both the username and repository name are the same, you can omit one. gem "rails", bitbucket: "rails/rails" gem "rails", bitbucket: "rails" Are both equivalent to gem "rails", git: "https://rails@bitbucket.org/rails/rails.git" Since the bitbucket method is a specialization of git_source , it accepts a :branch named argument. Path You can specify that a gem is located in a particular location on the file system. Relative paths are resolved relative to the directory containing the Gemfile . Similar to the semantics of the :git option, the :path option requires that the directory in question either contains a .gemspec for the gem, or that you specify an explicit version that bundler should use. Unlike :git , bundler does not compile C extensions for gems specified as paths. gem "rails", path: "vendor/rails" If you would like to use multiple local gems directly from the filesystem, you can set a global path option to the path containing the gem's files. This will automatically load gemspec files from subdirectories. path 'components' do gem 'admin_ui' gem 'public_ui' end Block Form Of Source, Git, Path, Group And Platforms The :source , :git , :path , :group , and :platforms options may be applied to a group of gems by using block form. source "https://gems.example.com" do gem "some_internal_gem" gem "another_internal_gem" end git "https://github.com/rails/rails.git" do gem "activesupport" gem "actionpack" end platforms :ruby do gem "ruby-debug" gem "sqlite3" end group :development, optional: true do gem "wirble" gem "faker" end In the case of the group block form the :optional option can be given to prevent a group from being installed unless listed in the --with option given to the bundle install command. In the case of the git block form, the :ref , :branch , :tag , and :submodules options may be passed to the git method, and all gems in the block will inherit those options. The presence of a source block in a Gemfile also makes that source available as a possible global source for any other gems which do not specify explicit sources. Thus, when defining source blocks, it is recommended that you also ensure all other gems in the Gemfile are using explicit sources, either via source blocks or :source directives on individual gems. Install_if The install_if method allows gems to be installed based on a proc or lambda. This is especially useful for optional gems that can only be used if certain software is installed or some other conditions are met. install_if -> { RUBY_PLATFORM =~ /darwin/ } do gem "pasteboard" end Gemspec The .gemspec file is where you provide metadata about your gem to Rubygems. Some required Gemspec attributes include the name, description, and homepage of your gem. This is also where you specify the dependencies your gem needs to run. If you wish to use Bundler to help install dependencies for a gem while it is being developed, use the gemspec method to pull in the dependencies listed in the .gemspec file. The gemspec method adds any runtime dependencies as gem requirements in the default group. It also adds development dependencies as gem requirements in the development group. Finally, it adds a gem requirement on your project ( path: '.' ). In conjunction with Bundler.setup , this allows you to require project files in your test code as you would if the project were installed as a gem; you need not manipulate the load path manually or require project files via relative paths. The gemspec method supports optional :path , :glob , :name , and :development_group options, which control where bundler looks for the .gemspec , the glob it uses to look for the gemspec (defaults to: {,*,*/*}.gemspec ), what named .gemspec it uses (if more than one is present), and which group development dependencies are included in. When a gemspec dependency encounters version conflicts during resolution, the local version under development will always be selected -- even if there are remote versions that better match other requirements for the gemspec gem. Source Priority When attempting to locate a gem to satisfy a gem requirement, bundler uses the following priority order: The source explicitly attached to the gem (using :source , :path , or :git ) For implicit gems (dependencies of explicit gems), any source, git, or path repository declared on the parent. This results in bundler prioritizing the ActiveSupport gem from the Rails git repository over ones from rubygems.org If neither of the above conditions are met, the global source will be used. If multiple global sources are specified, they will be prioritized from last to first, but this is deprecated since Bundler 1.13, so Bundler prints a warning and will abort with an error in the future. Lockfile By default, Bundler will create a lockfile by adding .lock to the end of the Gemfile name. To change this, use the lockfile method: lockfile "/path/to/lockfile.lock" This is useful when you want to use different lockfiles per ruby version or platform. To avoid writing a lock file, use false as the argument: lockfile false This is useful for library development and other situations where the code is expected to work with a range of dependency versions. Lockfile Precedence When determining path to the lockfile or whether to create a lockfile, the following precedence is used: The bundle install --no-lock option (which disables lockfile creation). The bundle install --lockfile option. The BUNDLE_LOCKFILE environment variable. The lockfile method in the Gemfile. The default behavior of adding .lock to the end of the Gemfile name. Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 v1.14 v1.13 v1.12 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctorj/latest/guides/gem-path/ | Loading External Gems with GEM_PATH | 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 Loading External Gems with GEM_PATH 3.0 3.0 2.5 Edit this Page Loading External Gems with GEM_PATH By default, AsciidoctorJ comes with all required gems bundled within the jar. But in some circumstances like OSGi environments you may require to store gems in an external folder and be loaded by AsciidoctorJ. As the Java interface org.asciidoctor.Asciidoctor and its factory org.asciidoctor.Asciidoctor.Factory are agnostic to JRuby there are the interface org.asciidoctor.jruby.AsciidoctorJRuby and org.asciidoctor.jruby.AsciidoctorJRuby.Factory that allow to get an Asciidoctor instance using JRuby with a certain GEM_PATH. Note that org.asciidoctor.jruby.AsciidoctorJRuby directly extends org.asciidoctor.Asciidoctor . Example of setting GEM_PATH import static org.asciidoctor.jruby.AsciidoctorJRuby.Factory.create; import org.asciidoctor.Asciidoctor; Asciidoctor asciidoctor = create("/my/gem/path"); (1) 1 Creates an Asciidoctor instance with given GEM_PATH location. Loading Ruby Libraries Optimization 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:25 |
https://bundler.io/v4.0/man/bundle-add.1.html | Bundler: bundle add Bundler Docs Team Blog Repository bundle add bundle-add - Add gem to the Gemfile and run bundle install bundle add GEM_NAME [--group=GROUP] [--version=VERSION] [--source=SOURCE] [--path=PATH] [--git=GIT|--github=GITHUB] [--branch=BRANCH] [--ref=REF] [--quiet] [--skip-install] [--strict|--optimistic] Description Adds the named gem to the Gemfile(5) and run bundle install . bundle install can be avoided by using the flag --skip-install . Options --version=VERSION , -v=VERSION Specify version requirements(s) for the added gem. --group=GROUP , -g=GROUP Specify the group(s) for the added gem. Multiple groups should be separated by commas. --source=SOURCE , -s=SOURCE Specify the source for the added gem. --require=REQUIRE , -r=REQUIRE Adds require path to gem. Provide false, or a path as a string. --path=PATH Specify the file system path for the added gem. --git=GIT Specify the git source for the added gem. --github=GITHUB Specify the github source for the added gem. --branch=BRANCH Specify the git branch for the added gem. --ref=REF Specify the git ref for the added gem. --glob=GLOB Specify the location of a dependency's .gemspec, expanded within Ruby (single quotes recommended). --quiet Do not print progress information to the standard output. --skip-install Adds the gem to the Gemfile but does not install it. --optimistic Adds optimistic declaration of version. --strict Adds strict declaration of version. Examples You can add the rails gem to the Gemfile without any version restriction. The source of the gem will be the global source. bundle add rails You can add the rails gem with version greater than 1.1 (not including 1.1) and less than 3.0. bundle add rails --version "> 1.1, < 3.0" You can use the https://gems.example.com custom source and assign the gem to a group. bundle add rails --version "~> 5.0.0" --source "https://gems.example.com" --group "development" The following adds the gem entry to the Gemfile without installing the gem. You can install gems later via bundle install . bundle add rails --skip-install You can assign the gem to more than one group. bundle add rails --group "development, test" See Also Gemfile(5) , bundle-remove(1) Choose version v4.0 v2.7 v2.6 v2.5 v2.4 v2.3 v2.2 v2.1 v2.0 v1.17 v1.16 v1.15 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
http://debian-mirror.behostings.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 21:07 - 13.3.0/ 2026-01-10 21:07 - current-live/ 2026-01-10 21:07 - current/ 2026-01-10 21:07 - ls-lR.gz 2026-01-13 02:12 11K project/ 2005-05-23 16:50 - Apache/2.4.41 (Ubuntu) Server at debian-mirror.behostings.net Port 80 | 2026-01-13T09:30:25 |
https://bundler.io/v4.0/man/bundle-env.1.html | Bundler: bundle env Bundler Docs Team Blog Repository bundle env bundle-env - Print information about the environment Bundler is running under bundle env Description Prints information about the environment Bundler is running under. Choose version v4.0 v2.7 v2.6 General Release notes Primary Commands bundle install bundle update bundle cache bundle exec bundle config bundle help Utilities bundle bundle add bundle binstubs bundle check bundle clean bundle console bundle doctor bundle env bundle fund bundle gem bundle info bundle init bundle issue bundle licenses bundle list bundle lock bundle open bundle outdated bundle platform bundle plugin bundle pristine bundle remove bundle show bundle version gemfile Edit this document on GitHub if you caught an error or noticed something was missing. Docs Team Blog About Repository | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/minitest-hooks/actions/workflows/ci.yml | CI · Workflow runs · jeremyevans/minitest-hooks · 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 / minitest-hooks Public Notifications You must be signed in to change notification settings Fork 13 Star 109 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/minitest-hooks 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 11 workflow runs 11 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 #37: Commit 129288d pushed by jeremyevans 16m 3s master master 16m 3s View workflow file Bump version to 1.5.3 CI #36: Commit e690c2e pushed by jeremyevans 1m 34s master master 1m 34s View workflow file Add metadata and required ruby version to gemspec CI #35: Commit 88126f2 pushed by jeremyevans 1m 55s master master 1m 55s View workflow file Use SimpleCov.add_filter block instead of string CI #34: Commit 922f3fb pushed by jeremyevans 2m 2s master master 2m 2s View workflow file Add JRuby 10.0 to CI CI #33: Commit ab7d5c1 pushed by jeremyevans 6m 48s master master 6m 48s View workflow file Switch rdoc task to normal rake task, avoid rdoc/task require CI #32: Commit f498593 pushed by jeremyevans 1m 49s master master 1m 49s View workflow file Adjust specs to pass on Ruby 3.5 CI #31: Commit e99a6b0 pushed by jeremyevans 2m 0s master master 2m 0s View workflow file Install libsqlite3-dev in CI, hopefully fixes Ruby 2.0-2.4 CI #30: Commit 332e0bc pushed by jeremyevans 1m 16s master master 1m 16s View workflow file Work with ubuntu-latest using 24.04 by default in CI CI #29: Commit 83e96c9 pushed by jeremyevans 2m 2s master master 2m 2s View workflow file Add Ruby 3.4 to CI CI #28: Commit 116e334 pushed by jeremyevans 4m 15s master master 4m 15s View workflow file Use -W:strict_unused_block when running tests on Ruby 3.4+ CI #27: Commit 7dea45f pushed by jeremyevans 2m 0s master master 2m 0s View workflow file You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://www.unicode.org/glossary/#encoding_form | 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 &amp; for "&" or &nbsp; 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 |
http://mirror.overthewire.com.au/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 13-Jan-2026 06:12 10927 | 2026-01-13T09:30:25 |
http://debian.mirror.digitalpacific.com.au/debian-cd/ | Index of /debian-cd/ Index of /debian-cd/ ../ 13.3.0/ 11-Jan-2026 08:07 - 13.3.0-live/ 11-Jan-2026 08:07 - current/ 11-Jan-2026 08:07 - current-live/ 11-Jan-2026 08:07 - project/ 24-May-2005 03:50 - ls-lR.gz 13-Jan-2026 16:12 11K | 2026-01-13T09:30:25 |
https://docs.asciidoctor.org/asciidoctor/latest/install/linux-packaging/ | Install Using Linux 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 Linux Packaging Edit this Page Install Using Linux Packaging The benefit of using your operating system’s package manager to install the gem is that it handles installing Ruby and the RubyGems library if those packages are not already installed on your machine. Package versions 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 is newer than what is available via your package manager, see Install Using Ruby Packaging . 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 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) 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 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) apk (Alpine Linux) To install the gem on Alpine Linux, open a terminal and type: $ sudo apk add 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) pacman (Arch Linux) To install the gem on Arch Linux-based distributions, open a terminal and type: $ sudo pacman -S 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) Upgrade on Linux Some Linux distributions may not have the latest stable version of Asciidoctor packaged immediately after a release of a new gem. If you need to upgrade to the latest version immediately, use gem install instead of the package manager. Your Linux system may be configured to automatically update packages, in which case the latest Asciidoctor package will be installed as soon as it becomes available. No further action is required by you. APT On Debian and Debian-based distributions, update the Asciidoctor package using: $ sudo apt-get upgrade -y asciidoctor DNF On Fedora and other RPM-based distributions, you can update the package using: $ sudo dnf update -y asciidoctor apk (Alpine Linux) On Alpine Linux, update the Asciidoctor package using: $ sudo apk add -u asciidoctor Uninstall on Linux To uninstall (i.e., remove) Asciidoctor using Linux packaging, you request your package manager to remove the Asciidoctor package. The package manager will take care of removing all the necessary application files. APT On Debian and Debian-based distributions, uninstall the Asciidoctor package using: $ sudo apt-get remove -y asciidoctor DNF On Fedora and other RPM-based distributions, you can uninstall the package using: $ sudo dnf remove -y asciidoctor apk (Alpine Linux) On Alpine Linux, uninstall the Asciidoctor package using: $ sudo apk del asciidoctor Install Using Ruby Packaging Install on macOS 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:25 |
http://debian.nic.cz/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 13-Jan-2026 05:12 10930 | 2026-01-13T09:30:25 |
https://icu.unicode.org/ | ICU - International Components for Unicode Search this site Embedded Files Skip to main content Skip to navigation ICU - International Components for Unicode ICU-TC Home Page ICU4C Demos ICU Collation Demo ICU4J Demos (moved) Why Use ICU4J? Unicode® ICU on GitHub Downloading ICU ICU 77 ICU 76 ICU Time Zone Update Utility (ICUTZU) Verifying Downloads ICU 75 ICU 74 ICU 73 ICU 72 ICU 71 ICU 70 ICU 69 Old ICU Releases Download ICU 4.6 M1 (Superseded by 4.6) Download ICU 4.6 M2 (Superseded by 4.6) Download ICU 4.6 RC2 (Superseded by 4.6) Download ICU 4.6 Release Download ICU 4.8 M1 (Superseded by 4.8) Download ICU 49 Download ICU 49 M2 (Superseded by 49) Download ICU 50 Download ICU 51 Download ICU 52 Download ICU 52 Milestone 1 (Superseded by 52) Download ICU 53 Download ICU 53 Milestone 1 Download ICU 54 Download ICU 55 Download ICU 56 Download ICU 57 Download ICU 58 Download ICU 59 Download ICU 60 Download ICU 61 Download ICU 62 Download ICU 63 Download ICU 64 Download the ICU 4.8 Release ICU 3.2 Archive ICU 3.4 Archive ICU 3.6 Archive ICU 3.8 Archive ICU 4.0 Archive ICU 4.2 Archive ICU 4.4 Archive ICU 54 Milestone 1 ICU 55 Milestone 1 ICU 56 Milestone 1 ICU 65 ICU 66 ICU 67 ICU 68 Milestone User Guide ICU4C Readme ICU4J Readme ICU4C APIs ICU4J APIs Docs & Papers gdocs-test-1 Contacts and Mailing Lists Submitting ICU Bugs and Feature Requests Time Zone Database Source Code Access git for ICU Developers (moved) Manually Landing PRs Tips (for developers) Linux Tips Related ICU Projects ICU Charts Character Set Mapping Tables Collation: ICU4C (4.8) vs. GLIBC (2.13-1) Collation: ICU4C 3.8 vs. glibc-2.12.3-2 Collation: ICU4J (53.1) vs Java 7 Feature Comparison Chart UTF16 API Comparison ICU4C Footprint Security Information We have moved ICU Technical Committee Former Project Management Committee Meeting Minutes Design Docs Alphabetic Index BreakIterator Character Iterators Dictionary with Word Frequencies RBBI Rule Enhancements C++ C++ string class Shared Objects Smart Pointers Stack Arrays Calendar issues Backwards era-0 years and add,roll Canonically Equivalent Shortest Form Case Mappings Greek Uppercasing CLDR Support Cleanup MessageFormat Redesign Collation Collation v2 code Collation v2 Performance ICU 53 collation v2 work log prefixes ICU 4.6 Changes Script Reordering test Special Byte Values UCA 6.0 Tests UCA Weight Allocation Compact Encodings Compact Encoding of Names Data Formats Resource Bundle Format v2 Data Structures (moved) ICU Code Point Tries (moved) ICU String Tries BytesTrie UCharsTrie Formatting MeasureFormat Updating Measure Unit with new CLDR data MessageFormat Message Formatting Redesign MessageFormat 2011q1 MessagePattern Demo Questions & Decisions New Syntax Numbers Decimal Format construction performance Number format skeleton support NumberFormat v2 SelectFormat TimeZone getDisplayName Proposal 20070719 getOffset Chat about edge cases 20070719 Discussion 20071030: getOffset for ambiguous time range ICU 4.8 Time Zone Names Timezone Data Loading ICU4J Development Environment Setup - *OBSOLETE* Java 7 Support Java Logger Joint Tests with CLDR Layout Java Layout Tools Locale Canonicalization Root locale and fallback Normalization Custom Normalization (moved) Norwegian locales changes in v39 Number Parsing ICU4J Number Parsing Problems Number Parsing in ICU4J 61 Properties Preparsed UCD (moved) Regular Expressions Named Capture Groups Regular Expressions, UText based operation Representation of alternate data values in ICU Resource Bundles Clean-Sheet API Flat CLDR Locale Data RB design discussion - 2009-08-21 Resource Bundle Issues Size Reduction Caching CLDR Data Collation Resource Bundles Core Breakup General-Purpose Compression ICU4J Modularization Resource Bundle Keys Resource Bundle Strings Timezone debloating Transliteration Resource Bundles Strings Splitter Synchronization Build Time User Provided Synchronization Double-Checked Locking One Time Initialization Territory Containment Territory & Region APIs Transforms UnicodeSet Redesign Unified Cache Setup C/C++ Debugging Eclipse Setup for ICU4J Users Skipping Known Test Failures (logKnownIssue, formerly timebomb) IDE Setup for C/C++ Developers (ICU4C) Eclipse Setup for C/C++ Developers Kdevelop Setup for C/C++ Developers Xcode setup for C/C++ Developers IDE Setup for Java Developers (ICU4J) Ant Setup for Java Developers Eclipse Setup for Java Developers Java Profiling and Monitoring tools Obsolete: Subversion Setup for ICU Developers Profiling ICU4C with callgrind Profiling ICU4J code with NetBeans profiler Setup: Auto-link from GitHub to Jira tickets Setup: git difftool & mergetool ICU Processes and Procedures API Proposal Email Template Coverage How to contribute to ICU ICU Copyright Scanner ICU Ticket Life cycle ICU Userguide Infrastructure Maintenance Release Procedure Obsolete: Onboarding new Contributors Obsolete: Pre-GitHub Code reviews Throwing the Big Red Switch: How to ship ICU BRS 4.4M3 BRS 4.4M4 BRS 4.6M1 BRS 4.6M2 BRS 4.6RC ICU4C API Comparison: 4.4.2 with 4.6 BRS 4.8M1 Obsolete: Pre-4.8 BRS (backup) Release & Milestone Tasks Announcements APIs & Docs Build Updates Copy Shared Tests Healthy Code Integration Tests Legalities Miscellaneous Publish Release Build Standards Updates Version Numbers Unicode Update ICU - International Components for Unicode ICU-TC Home Page News 2025-10-30: ICU 78 is now available — releases/tag/release-78.1 — Maven: com.ibm.icu / icu4j / version 78.1 ICU 78 updates to Unicode 17 ( blog ), including new characters and scripts, emoji, collation & IDNA changes, and corresponding APIs and implementations. It also updates to CLDR 48 ( blog ) locale data with new locales, and various additions and corrections. In Java, there is a new Segmenter API which is easier and safer to use than BreakIterator. In C++, there is a new set of APIs for Unicode string (UTF-8/16/32) code point iteration that works seamlessly with modern C++ iterators and ranges. The Java implementation of the CLDR MessageFormat 2.0 specification has been updated to CLDR 48. The core API has been upgraded to “draft”, while the Data Model API remains in technology preview. The C++ implementation of MessageFormat 2.0 is at CLDR 47 level and remains in technology preview. ICU 78 and CLDR 48 are major releases, including a new version of Unicode and major locale data improvements. 2025-03-13: ICU 77 is now available — releases/tag/release-77-1 — Maven: com.ibm.icu / icu4j / version 77.1 ICU 77 updates to CLDR 47 locale data with new locales, and various additions and corrections. ICU 77 is mostly focused on bug fixes, segmentation conformance, and other refinements. The technology preview implementations of the CLDR MessageFormat 2.0 specification have been updated to incorporate some, but not yet all, of the CLDR 47 changes. (Java more than C++) 2024-10-24: ICU 76 is now available. It updates to Unicode 16 ( blog ), including new characters and scripts, emoji, collation & IDNA changes, and corresponding APIs and implementations. It also updates to CLDR 46 ( beta blog ) locale data with new locales, significant updates to existing locales, and various additions and corrections. For example, the CLDR and Unicode default sort orders are now very nearly the same. Most of the java.time (Temporal) types can now be formatted directly. There are some new APIs to make ICU easier to use with modern C++ and Java patterns. The Java and C++ technology preview implementations of the CLDR MessageFormat 2.0 specification have been updated to match recent changes. See ICU 76 . What is ICU? ICU is a mature, widely used set of C/C++ and Java libraries providing Unicode and Globalization support for software applications. ICU is widely portable and gives applications the same results on all platforms and between C/C++ and Java software. ICU is released under a nonrestrictive open source license that is suitable for use with both commercial software and with other open source or free software. Here are a few highlights of the services provided by ICU: Code Page Conversion: Convert text data to or from Unicode and nearly any other character set or encoding. ICU's conversion tables are based on charset data collected by IBM over the course of many decades, and is the most complete available anywhere. Collation: Compare strings according to the conventions and standards of a particular language, region or country. ICU's collation is based on the Unicode Collation Algorithm plus locale-specific comparison rules from the Common Locale Data Repository , a comprehensive source for this type of data. Formatting: Format numbers, dates, times and currency amounts according the conventions of a chosen locale. This includes translating month and day names into the selected language, choosing appropriate abbreviations, ordering fields correctly, etc. This data also comes from the Common Locale Data Repository. Time Calculations: Multiple types of calendars are provided beyond the traditional Gregorian calendar. A thorough set of timezone calculation APIs are provided. Unicode Support: ICU closely tracks the Unicode standard, providing easy access to all of the many Unicode character properties, Unicode Normalization, Case Folding and other fundamental operations as specified by the Unicode Standard . Regular Expression: ICU's regular expressions fully support Unicode while providing very competitive performance. Bidi: support for handling text containing a mixture of left to right (English) and right to left (Arabic or Hebrew) data. Text Boundaries: Locate the positions of words, sentences, paragraphs within a range of text, or identify locations that would be suitable for line wrapping when displaying the text. And much more. Refer to the ICU User Guide for details. Why Unicode? Unicode (and the parallel ISO 10646 standard) defines the character set necessary for efficiently processing text in any language and for maintaining text data integrity. In addition to global character coverage, the Unicode standard is unique among character set standards because it also defines data and algorithms for efficient and consistent text processing. This simplifies high-level processing and ensures that all conformant software produces the same results. The widespread adoption of Unicode over the last decade made text data truly portable and formed a cornerstone of the Internet. What is Unicode? Globalized software, based on Unicode, maximizes market reach and minimizes cost. Globalized software is built and installed once and yet handles text for and from users worldwide and accomodates their cultural conventions. It minimizes cost by eliminating per-language builds, installations, and maintenance updates. Why ICU4C? The C and C++ languages and many operating system environments do not provide full support for Unicode and standards-compliant text handling services. Even though some platforms do provide good Unicode text handling services, portable application code can not make use of them. The ICU4C libraries fills in this gap. ICU4C provides an open, flexible, portable foundation for applications to use for their software globalization requirements. ICU4C closely tracks industry standards, including Unicode and CLDR (Common Locale Data Repository). Why ICU4J? Java provides a very strong foundation for global programs, and IBM and the ICU team played a key role in providing globalization technology into Sun's Java. But because of its long release schedule, Java cannot always keep up-to-date with evolving standards. The ICU team continues to extend Java's Unicode and internationalization support, focusing on improving performance, keeping current with the Unicode standard, and providing richer APIs, while remaining as compatible as possible with the original Java text and internationalization API design. See Why Use ICU4J? ICU4JNI New versions of ICU4JNI are no longer being created. If you need the functionality of ICU4JNI, you should consider migrating to ICU4J. Who Uses ICU? The following is a list of products, companies and organizations reported to be using ICU. If you have any feedback on this list (corrections, additions, or details), please contact us (on icu-support). Companies and Organizations using ICU ABAS Software, Adobe, Amazon (Kindle), Amdocs, Apache, Appian, Apple, Argonne National Laboratory, Avaya, BAE Systems Geospatial eXploitation Products, BEA, BluePhoenix Solutions, BMC Software, Boost, BroadJump, Business Objects, caris, CERN, CouchDB, Debian Linux, Dell, Eclipse, eBay, EMC Corporation, ESRI, Facebook (HHVM), Firebird RDBMS, FreeBSD, Gentoo Linux, Google, GroundWork Open Source, GTK+, Harman/Becker Automotive Systems GmbH, HP, Hyperion, IBM, Inktomi, Innodata Isogen, Informatica, Intel, Interlogics, IONA, IXOS, Jikes, Library of Congress, LibreOffice, Mathworks, Microsoft, Mozilla, Netezza, Node.js, Oracle (Solaris, Java), Lawson Software, Leica Geosystems GIS & Mapping LLC, Mandrake Linux, OCLC, Progress Software, Python, QNX, Rogue Wave, SAP, SIL, SPSS, Software AG, SuSE, Sybase, Symantec, Teradata (NCR), ToolAware, Trend Micro, Virage, webMethods, Wikimedia Foundation [Wikipedia] MediaWiki application servers , Wine, WMS Gaming, XyEnterprise, Yahoo!, Vuo, and many others. Apache Projects Harmony, Lucene search library, OpenOffice, PDFBox library, Solr search engine server, Tika metadata toolkits, Xalan XSLT, Xerces XML Products from IBM DB2, Lotus, Websphere, Tivoli, Rational, AIX, i/OS, z/OS Ascential Software, Cloudant, Cognos, PSD Print Architecture, COBOL, Host Access Client, InfoPrint Manager, Informix GLS, Language Analysis Systems, Lotus Notes, Lotus Extended Search, Lotus Workplace, WebSphere Message Broker, NUMA-Q, OTI, OmniFind, Pervasive Computing WECMS, Rational Business Developer and Rational Application Developer, SS&S Websphere Banking Solutions, Tivoli Presentation Services, Tivoli Identity Manager, WBI Adapter/ Connect/Modeler and Monitor/ Solution Technology Development/WBI-Financial TePI, Websphere Application Server/ Studio Workload Simulator/Transcoding Publisher, XML Parser. Products from Google Android developer guide: Unicode and internationalization support Web Search, Google+, Chrome/Chrome OS, Android, Adwords, Google Finance, Google Maps, Blogger, Google Analytics, Google Groups, and others. Products from Apple macOS (OS & applications), iOS (iPhone, iPad, iPod touch), watchOS & tvOS, Safari for Windows & other Windows applications and related support, Apple Mobile Device Support in iTunes for Windows. Products from Microsoft Article: .NET globalization and ICU Article: International Components for Unicode (ICU) – Highlights of the Globalization API services provided by ICU etc. Windows Bridge for iOS ( link ), Windows 10 - Creators Update, Visual Studio 2017 [Electron], Visual Studio Code [Electron], ChakraCore Products from Harman/Becker The following car brands are using ICU via the Harman/Becker automotive software: Alfa Romeo, Audi, Bentley, BMW, Buick, more... Products from Adobe Creative Cloud apps and Document Cloud Related Projects There are also some related projects that wrap the existing functionality of ICU. Report abuse Page details Page updated Report abuse | 2026-01-13T09:30:25 |
https://github.com/jeremyevans/simple_mailer/actions/workflows/ci.yml | CI · Workflow runs · jeremyevans/simple_mailer · 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 / simple_mailer Public Notifications You must be signed in to change notification settings Fork 2 Star 5 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/simple_mailer 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 8 workflow runs 8 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 #17: Commit ea7a15e pushed by jeremyevans 24m 34s master master 24m 34s View workflow file Minor README tweaks CI #16: Commit f7afcc3 pushed by jeremyevans 49s master master 49s View workflow file Use SimpleCov.add_filter block instead of string CI #14: Commit cbb464c pushed by jeremyevans 2m 0s master master 2m 0s View workflow file Add JRuby 10.0 to CI CI #13: Commit 7b9f525 pushed by jeremyevans 12m 32s master master 12m 32s View workflow file Switch rdoc task to normal rake task, avoid rdoc/task require CI #12: Commit 3a61b99 pushed by jeremyevans 53s master master 53s View workflow file Work with ubuntu-latest using 24.04 by default in CI CI #11: Commit eeaf033 pushed by jeremyevans 52s master master 52s View workflow file Add Ruby 3.4 to CI CI #10: Commit e5ef455 pushed by jeremyevans 3m 23s master master 3m 23s View workflow file Use -W:strict_unused_block when running tests on Ruby 3.4+ CI #9: Commit a51e33d pushed by jeremyevans 1m 8s master master 1m 8s View workflow file You can’t perform that action at this time. | 2026-01-13T09:30:25 |
https://www.unicode.org/glossary/#transformation_format | 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 &amp; for "&" or &nbsp; 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.unicode.org/glossary/#UTF_16 | 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 &amp; for "&" or &nbsp; 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.linkedin.com/company/coreboot#main-content | coreboot | LinkedIn Skip to main content LinkedIn Top Content People Learning Jobs Games Sign in Join now coreboot Software Development Follow Discover all 5 employees Report this company About us coreboot™: fast and flexible Open Source firmware. coreboot is an extended firmware platform that delivers a lightning fast and secure boot experience on modern computers and embedded systems. As an Open Source project it provides auditability and maximum control over technology. Website https://www.coreboot.org/ External link for coreboot Industry Software Development Company size 51-200 employees Type Nonprofit Founded 1999 Employees at coreboot Stefan Reinauer Martin Roth Felix Singer See all employees Updates coreboot reposted this Yussuf Khalil 5mo Report this post Yesterday, our lab's port of the ASRock SPC741D8-2L2T/BCM (Intel SPR/EMR) mainboard finally got merged into the coreboot project. This is now the *only* CXL-capable mainboard supported by upstream coreboot that is available for anyone to buy off-the-shelf. Implementing coreboot on this mainboard was quite a journey. We needed it for a research project and had some prior experience working with open-source system firmware on an Intel Alder Lake system. But adding support for an entirely new mainboard from scratch with no schematics and no deep technical documentation available to us? What could possibly go wrong?! 🤔 There was lots of frustration in the process, but in the end, it worked out. And oh boy, that was a very rewarding moment when we saw the system actually boot for the first time all the way from pressing the power button up into Linux. 😅 A big shout-out to my students Fabian Meyer and Felix Zimmer who worked on making this happen! And of course, a big thank you to the OSFW community for the coreboot project. Check out the commit 👉 https://lnkd.in/eXAC_Gqt #coreboot #OSFW #OpenSourceFirmware #CXL #ComputeExpressLink 91 9 Comments Like Comment Share coreboot reposted this Christian Walter 11mo Report this post FOSDEM 2025 starts tomorrow! The Open Source Firmware Foundation is running the "coreboot / EDKII / openBMC / flashprog" stand - catchy name, I know - drop by if you want to talk with us about #opensource #firmware . And we brought the whole community with us. Looking forward to catch up with you all again. FOSDEM is one of my favorite conferences. Its just real. Once you have been there, you will know what I mean. Felix Singer Daniel Maslowski Alicja Michalska Marvin Drees Patrik Tesarik Patrick Rudolph Philipp Deppenwiese coreboot 39 4 Comments Like Comment Share Join now to see what you are missing Find people you know at coreboot Browse recommended jobs for you View all updates, news, and articles Join now Similar pages 9elements Cyber Security Software Development Bochum, NRW System76 Computer Hardware Denver, Colorado Open Source Firmware Foundation Software Development Sunnyvale, Kalifornien TUXEDO Computers GmbH Computer Hardware Manufacturing Augsburg, Bayern BlindSpot Software GmbH Information Services Bochum, NRW Purism, SPC Computer Hardware San Francisco, CA Fedora Project Software Development Fedora City, Open Source Red Hat Software Development Raleigh, NC mmi-productions* Events Services Urbach, Baden-Württemberg Root Logic Wellness and Fitness Services San Francisco, CA Show more similar pages Show fewer similar pages LinkedIn © 2026 About Accessibility User Agreement Privacy Policy Cookie Policy Copyright Policy Brand Policy Guest Controls Community Guidelines العربية (Arabic) বাংলা (Bangla) Čeština (Czech) Dansk (Danish) Deutsch (German) Ελληνικά (Greek) English (English) Español (Spanish) فارسی (Persian) Suomi (Finnish) Français (French) हिंदी (Hindi) Magyar (Hungarian) Bahasa Indonesia (Indonesian) Italiano (Italian) עברית (Hebrew) 日本語 (Japanese) 한국어 (Korean) मराठी (Marathi) Bahasa Malaysia (Malay) Nederlands (Dutch) Norsk (Norwegian) ਪੰਜਾਬੀ (Punjabi) Polski (Polish) Português (Portuguese) Română (Romanian) Русский (Russian) Svenska (Swedish) తెలుగు (Telugu) ภาษาไทย (Thai) Tagalog (Tagalog) Türkçe (Turkish) Українська (Ukrainian) Tiếng Việt (Vietnamese) 简体中文 (Chinese (Simplified)) 正體中文 (Chinese (Traditional)) Language Agree & Join LinkedIn By clicking Continue to join or sign in, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . Sign in to see who you already know at coreboot Sign in Welcome back Email or phone Password Show Forgot password? Sign in or By clicking Continue to join or sign in, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . New to LinkedIn? Join now or New to LinkedIn? Join now By clicking Continue to join or sign in, you agree to LinkedIn’s User Agreement , Privacy Policy , and Cookie Policy . | 2026-01-13T09:30:25 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.