"cyclomatic complexity" meaning in All languages combined

See cyclomatic complexity on Wiktionary

Noun [English]

Forms: cyclomatic complexities [plural]
Head templates: {{en-noun|~}} cyclomatic complexity (countable and uncountable, plural cyclomatic complexities)
  1. (software engineering) A quantitative measure of the number of linearly independent paths (branches) through a program's source code which indicates the complexity of a program or a function. Tags: countable, uncountable Categories (topical): Software engineering Synonyms: McCabe's complexity Translations (quantitative measure): McCabe-Metrik [feminine] (German), zyklomatische Komplexität [feminine] (German), kompleksitas siklomatik (Indonesian)
    Sense id: en-cyclomatic_complexity-en-noun-ePtgmpdZ Categories (other): English entries with incorrect language header Topics: computing, engineering, mathematics, natural-sciences, physical-sciences, sciences, software

Download JSON data for cyclomatic complexity meaning in All languages combined (2.3kB)

{
  "forms": [
    {
      "form": "cyclomatic complexities",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "cyclomatic complexity (countable and uncountable, plural cyclomatic complexities)",
      "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": "topical",
          "langcode": "en",
          "name": "Software engineering",
          "orig": "en:Software engineering",
          "parents": [
            "Computer science",
            "Engineering",
            "Software",
            "Computing",
            "Sciences",
            "Applied sciences",
            "Technology",
            "Media",
            "All topics",
            "Communication",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2006, Linda M. Laird, M. Carol Brennan, Software Measurement and Estimation: A Practical Approach, John Wiley & Sons, page 61",
          "text": "Cyclomatic complexity to us seems to be more of a problem when maintaining and testing code, rather than when originally writing it. As the cyclomatic complexity increases, the difficulty of fixing the code increases.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A quantitative measure of the number of linearly independent paths (branches) through a program's source code which indicates the complexity of a program or a function."
      ],
      "id": "en-cyclomatic_complexity-en-noun-ePtgmpdZ",
      "links": [
        [
          "software engineering",
          "software engineering"
        ],
        [
          "branch",
          "branch"
        ],
        [
          "source code",
          "source code"
        ],
        [
          "complexity",
          "complexity"
        ],
        [
          "function",
          "function"
        ]
      ],
      "raw_glosses": [
        "(software engineering) A quantitative measure of the number of linearly independent paths (branches) through a program's source code which indicates the complexity of a program or a function."
      ],
      "synonyms": [
        {
          "word": "McCabe's complexity"
        }
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences",
        "software"
      ],
      "translations": [
        {
          "code": "de",
          "lang": "German",
          "sense": "quantitative measure",
          "tags": [
            "feminine"
          ],
          "word": "McCabe-Metrik"
        },
        {
          "code": "de",
          "lang": "German",
          "sense": "quantitative measure",
          "tags": [
            "feminine"
          ],
          "word": "zyklomatische Komplexität"
        },
        {
          "code": "id",
          "lang": "Indonesian",
          "sense": "quantitative measure",
          "word": "kompleksitas siklomatik"
        }
      ]
    }
  ],
  "word": "cyclomatic complexity"
}
{
  "forms": [
    {
      "form": "cyclomatic complexities",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "cyclomatic complexity (countable and uncountable, plural cyclomatic complexities)",
      "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",
        "English uncountable nouns",
        "en:Software engineering"
      ],
      "examples": [
        {
          "ref": "2006, Linda M. Laird, M. Carol Brennan, Software Measurement and Estimation: A Practical Approach, John Wiley & Sons, page 61",
          "text": "Cyclomatic complexity to us seems to be more of a problem when maintaining and testing code, rather than when originally writing it. As the cyclomatic complexity increases, the difficulty of fixing the code increases.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A quantitative measure of the number of linearly independent paths (branches) through a program's source code which indicates the complexity of a program or a function."
      ],
      "links": [
        [
          "software engineering",
          "software engineering"
        ],
        [
          "branch",
          "branch"
        ],
        [
          "source code",
          "source code"
        ],
        [
          "complexity",
          "complexity"
        ],
        [
          "function",
          "function"
        ]
      ],
      "raw_glosses": [
        "(software engineering) A quantitative measure of the number of linearly independent paths (branches) through a program's source code which indicates the complexity of a program or a function."
      ],
      "synonyms": [
        {
          "word": "McCabe's complexity"
        }
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences",
        "software"
      ]
    }
  ],
  "translations": [
    {
      "code": "de",
      "lang": "German",
      "sense": "quantitative measure",
      "tags": [
        "feminine"
      ],
      "word": "McCabe-Metrik"
    },
    {
      "code": "de",
      "lang": "German",
      "sense": "quantitative measure",
      "tags": [
        "feminine"
      ],
      "word": "zyklomatische Komplexität"
    },
    {
      "code": "id",
      "lang": "Indonesian",
      "sense": "quantitative measure",
      "word": "kompleksitas siklomatik"
    }
  ],
  "word": "cyclomatic complexity"
}

This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-05-16 from the enwiktionary dump dated 2024-05-02 using wiktextract (e268c0e and 304864d). 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.