Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a225f40f1c38ecd4

Jump to content

Talk:ABC Software Metric

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 8 years ago by Megabeing in topic Untitled

Untitled

[edit]

I need to amend my previous statement about the edits made by 108.160.195.141. For some reason, I was temporarily confused about the B and C components of the ABC metric. The Wikipedia reviewer (108.160.195.141) was correct about the B (branch) count. The C component, not the B component, relates directly to the number of conditions in source code. Therefore, the C component, not the B component, is related to cyclomatic complexity.Megabeing (talk) 18:16, 27 January 2018 (UTC)Reply

The edits made by 108.160.195.141 on 21 Nov 2017 are inaccurate. The citation removed [1] states "People sometimes think that the ABC metric measures complexity, not size". This clearly means that "some [people] believe" that the ABC metric measures complexity. This position is easily verified by an Internet search of others' description of the metric.

The Wikipedia reviewer also claims that the ABC branch count bears no relationship to the cyclomatic complexity count. My understanding is that cyclomatic complexity is defined as the number of linearly independent paths within source code. By any analysis, the paths through source code is based on the number of branching statements, which is what the B component of the ABC metric measures. The Wikipedia article about cyclomatic complexity even says "McCabe showed that the cyclomatic complexity of any structured program with only one entrance point and one exit point is equal to the number of decision points (i.e., "if" statements or conditional loops) contained in that program plus one." One can argue about what should be considered a "branch" (condition), or whether the count should be adjusted for the "machine level" equivalent, etc. Hair-splitting aside, the foundations of cyclomatic complexity and the B component of the ABC metric are the same (i.e. paths created by logical branches). Megabeing (talk) 01:35, 26 January 2018 (UTC)Reply

The name of this topic is quite vague. A better name might be 'ABC metric' or 'ABC software metric'. This change would put ABC scores within a more meaningful context.

References

  1. Fitzpatrick, Jerry (2017). "Appendix A". Timeless Laws of Software Development. Software Renovation Corporation. ISBN 978-0999335604.