See carry-lookahead in All languages combined, or Wiktionary
{ "forms": [ { "form": "carry-lookaheads", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "carry-lookahead (plural carry-lookaheads)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ { "kind": "other", "name": "English entries with incorrect language header", "parents": [ "Entries with incorrect language header", "Entry maintenance" ], "source": "w" }, { "kind": "other", "name": "Pages with 1 entry", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with entries", "parents": [], "source": "w" }, { "kind": "topical", "langcode": "en", "name": "Programming", "orig": "en:Programming", "parents": [ "Computing", "Software engineering", "Technology", "Computer science", "Engineering", "Software", "All topics", "Sciences", "Applied sciences", "Media", "Fundamental", "Communication" ], "source": "w" } ], "examples": [ { "ref": "2004, Wayne Wolf, FPGA-Based System Design:", "text": "A simpler scheme is to connect the carry-ins and carry-outs of the units in a ripple chain. This approach is most common in chip design because the wiring for the carry-lookahead tree is hard to design and area-consuming.", "type": "quote" } ], "glosses": [ "A command that checks whether there will be a carry (bit or digit that is carried in an addition operation) for the current digit in an ongoing addition operation." ], "id": "en-carry-lookahead-en-noun-CGU5t5Ps", "links": [ [ "programming", "programming#Noun" ] ], "raw_glosses": [ "(programming) A command that checks whether there will be a carry (bit or digit that is carried in an addition operation) for the current digit in an ongoing addition operation." ], "topics": [ "computing", "engineering", "mathematics", "natural-sciences", "physical-sciences", "programming", "sciences" ] } ], "word": "carry-lookahead" }
{ "forms": [ { "form": "carry-lookaheads", "tags": [ "plural" ] } ], "head_templates": [ { "args": {}, "expansion": "carry-lookahead (plural carry-lookaheads)", "name": "en-noun" } ], "lang": "English", "lang_code": "en", "pos": "noun", "senses": [ { "categories": [ "English countable nouns", "English entries with incorrect language header", "English lemmas", "English multiword terms", "English nouns", "English terms with quotations", "Pages with 1 entry", "Pages with entries", "en:Programming" ], "examples": [ { "ref": "2004, Wayne Wolf, FPGA-Based System Design:", "text": "A simpler scheme is to connect the carry-ins and carry-outs of the units in a ripple chain. This approach is most common in chip design because the wiring for the carry-lookahead tree is hard to design and area-consuming.", "type": "quote" } ], "glosses": [ "A command that checks whether there will be a carry (bit or digit that is carried in an addition operation) for the current digit in an ongoing addition operation." ], "links": [ [ "programming", "programming#Noun" ] ], "raw_glosses": [ "(programming) A command that checks whether there will be a carry (bit or digit that is carried in an addition operation) for the current digit in an ongoing addition operation." ], "topics": [ "computing", "engineering", "mathematics", "natural-sciences", "physical-sciences", "programming", "sciences" ] } ], "word": "carry-lookahead" }
Download raw JSONL data for carry-lookahead meaning in English (1.4kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-01-13 from the enwiktionary dump dated 2025-01-01 using wiktextract (4ba5975 and 4ed51a5). 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.