⏾ Concept Map

Globbing ○

|↑| ❪✺❫ Programmatic Concepts ○ | Globbing ○ ⦍[[| ]]⦎
⮞ 🟣 𓂃𓂃𓂃
⮞ ➔ 𓂃𓂃𓂃
⮞ ⛛ 𓂃𓂃𓂃

⤷ ・・・ ・・・ ・・・

Entries

၊၊||၊|။

Globbing ○｜Definition｜1st｜20251119205401-00-⌔

Matching wildcards - Wikipedia

Matching wildcards

In computer science, an algorithm for matching wildcards (also known as globbing) is useful in comparing text strings that may contain wildcard syntax.1 Common uses of these algorithms include command-line interfaces, e.g. the Bourne shell2 or Microsoft Windows command-line3 or text editor or file manager, as well as the interfaces for some search engines4 and databases.5 Wildcard matching is a subset of the problem of matching regular expressions and string matching in general.6

Printed 2026-06-28.

(echo:: @ ᯤ)

Footnotes

  1. “Wildcard characters”. ScienceDirect. 2018. Archived from the original on 2018-05-27. Retrieved 2018-05-09. ↩

  2. Quigley, Ellie (2005). UNIX Shell Programming QuickStart. InformIT.com. ↩

  3. “MS-DOS and Windows Wildcard Characters”. Microsoft Developer Network Library. 31 May 2018. ↩

  4. “Apache Lucene - Query Parser Syntax”. Apache Lucene 2.9.4 Documentation. 2006. ↩

  5. “SQL Wildcards”. W3Schools. 2018. ↩

  6. Goyvaerts, Jan (2018). “Welcome to Regular-Expressions.info”. RegularExpressions.info. ↩

Link to original

⤷ ・・・・・・・・・

Fields

admin::|[[|⚐]],[[|⚐]],[[|⚐]],[[|⚐]],
withheld::|————
relation::|————
parent_::|————
parent::|↑| ❪✺❫ Programmatic Concepts ○ | Globbing ○ ⦍[[| ]]⦎