See Barton-Nackman trick on Wiktionary
{
"etymology_text": "The technique was introduced by John Barton and Lee Nackman.",
"forms": [
{
"form": "the Barton-Nackman trick",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Barton-Nackman trick",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Programming",
"orig": "en:Programming",
"parents": [],
"source": "w"
}
],
"glosses": [
"A form of restricted template expansion in C++, characterized by an in-class friend function definition appearing in the base class template component of the curiously recurring template pattern."
],
"id": "en-Barton-Nackman_trick-en-name-b4bl4C3i",
"links": [
[
"programming",
"programming#Noun"
],
[
"restricted",
"restricted"
],
[
"template",
"template"
],
[
"expansion",
"expansion"
],
[
"C++",
"C++"
],
[
"class",
"class"
],
[
"friend",
"friend"
],
[
"function",
"function"
],
[
"definition",
"definition"
],
[
"base class",
"base class"
],
[
"curiously recurring template pattern",
"curiously recurring template pattern"
]
],
"raw_glosses": [
"(programming) A form of restricted template expansion in C++, characterized by an in-class friend function definition appearing in the base class template component of the curiously recurring template pattern."
],
"topics": [
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"programming",
"sciences"
]
}
],
"word": "Barton-Nackman trick"
}
{
"etymology_text": "The technique was introduced by John Barton and Lee Nackman.",
"forms": [
{
"form": "the Barton-Nackman trick",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Barton-Nackman trick",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Programming"
],
"glosses": [
"A form of restricted template expansion in C++, characterized by an in-class friend function definition appearing in the base class template component of the curiously recurring template pattern."
],
"links": [
[
"programming",
"programming#Noun"
],
[
"restricted",
"restricted"
],
[
"template",
"template"
],
[
"expansion",
"expansion"
],
[
"C++",
"C++"
],
[
"class",
"class"
],
[
"friend",
"friend"
],
[
"function",
"function"
],
[
"definition",
"definition"
],
[
"base class",
"base class"
],
[
"curiously recurring template pattern",
"curiously recurring template pattern"
]
],
"raw_glosses": [
"(programming) A form of restricted template expansion in C++, characterized by an in-class friend function definition appearing in the base class template component of the curiously recurring template pattern."
],
"topics": [
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"programming",
"sciences"
]
}
],
"word": "Barton-Nackman trick"
}
Download raw JSONL data for Barton-Nackman trick meaning in All languages combined (1.5kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-05-27 from the enwiktionary dump dated 2025-05-20 using wiktextract (a4e883e and f1c2b61). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.