出典:Wiktionary
出典:『Wiktionary』 (2026/03/18 19:17 UTC 版)
The noun is derived from Old French gist, a noun use of the third person singular indicative of gesir (“to lie down”) (modern French gésir; compare Anglo-Norman (cest) action gist (literally “(law) (this) action lies”)), from Latin iacēre, the present active infinitive of iaceō (“to lie down, lie prostrate, recline”), ultimately from Proto-Indo-European *(H)yeh₁- (“to throw”) (probably in the sense of something being thrown down).
The verb is derived from the noun.
The programming sense is a genericized trademark of GitHub Gist, introduced 2008.
gist (countable and uncountable, plural gists)
findOrCreate can be implemented as a before-hook on the service's get method. See this gist for an example of how to implement this in a before-hook.
gist (third-person singular simple present gists, present participle gisting, simple past and past participle gisted)
From 中期英語 giste, geste (“resting or stopping place, hostel, lodgings; food, refreshment; (figurative) seat of the soul”), from Old French giste (“resting place”) (modern French gîte (“lodging, shelter; self-catering holiday home”)), a noun use of the past participle form of gesir (“to lie down”): see etymology 1.
出典:Wikipedia
出典:『Wikipedia』 (2011/02/06 22:11 UTC 版)
In computing, GiST or Generalized Search Tree, is a data structure and API that can be used to build a variety of disk-based search trees. GiST is a generalization of the B+ tree, providing a concurrent and recoverable height-balanced search tree infrastructure without making any assumptions about the type of data being stored, or the queries being serviced. GiST can be used to easily implement a range of well-known indexes, including B+ trees, R-trees, hB-trees, RD-trees, and many others; it also allows for easy development of specialized indexes for new data types. It cannot be used directly to implement non-height-balanced trees such as quad trees or prefix trees (tries), though like prefix trees it does support compression, including lossy compression. GiST can be used for any data type that can be naturally ordered into a hierarchy of supersets. Not only is it extensible in terms of data type support and tree layout, it allows the extension writer to support any query predicates that they choose. The most widely-used GiST implementation is in the PostgreSQL relational database; it was also implemented in the Informix Universal Server, and as a standalone library, libgist.
![]()
名詞の変化形:
|