# Global Metrics

path: .metrics.cognitive.sum
old: 0.0
new: 1.0
path: .metrics.cognitive.average
old: null
new: 0.3333333333333333
path: .metrics.nargs.sum
old: 0.0
new: 7.0
path: .metrics.nargs.average
old: null
new: 2.3333333333333335
path: .metrics.nom.functions
old: 0.0
new: 3.0
path: .metrics.nom.total
old: 0.0
new: 3.0
path: .metrics.loc.lloc
old: 0.0
new: 28.0
path: .metrics.loc.blank
old: 6.0
new: 12.0
path: .metrics.loc.cloc
old: 6.0
new: 8.0
path: .metrics.loc.sloc
old: 29.0
new: 73.0
path: .metrics.loc.ploc
old: 17.0
new: 53.0
path: .metrics.mi.mi_visual_studio
old: 53.70736421943717
new: 35.34056216929138
path: .metrics.mi.mi_original
old: 91.83959281523757
new: 60.43236130948826
path: .metrics.mi.mi_sei
old: 89.591857165313
new: 36.628603792328754
path: .metrics.cyclomatic.average
old: 1.0
new: 1.2
path: .metrics.cyclomatic.sum
old: 4.0
new: 6.0
path: .metrics.halstead.level
old: 0.3
new: 0.031111111111111107
path: .metrics.halstead.time
old: 17.626643157674092
new: 3681.258603334595
path: .metrics.halstead.volume
old: 95.1838730514401
new: 2061.504817867373
path: .metrics.halstead.bugs
old: 0.015506251502700836
new: 0.5458307101003125
path: .metrics.halstead.n1
old: 5.0
new: 18.0
path: .metrics.halstead.purity_ratio
old: 1.6055586194967049
new: 0.8639999478013454
path: .metrics.halstead.N1
old: 13.0
new: 199.0
path: .metrics.halstead.difficulty
old: 3.3333333333333335
new: 32.142857142857146
path: .metrics.halstead.N2
old: 12.0
new: 150.0
path: .metrics.halstead.n2
old: 9.0
new: 42.0
path: .metrics.halstead.length
old: 25.0
new: 349.0
path: .metrics.halstead.effort
old: 317.27957683813366
new: 66262.65486002271
path: .metrics.halstead.vocabulary
old: 14.0
new: 60.0
path: .metrics.halstead.estimated_program_length
old: 40.13896548741762
new: 301.5359817826695
path: .metrics.nexits.average
old: null
new: 0.3333333333333333
path: .metrics.nexits.sum
old: 0.0
new: 1.0

# Spaces Data

## Minimal test - lines (13, 26)

path: .spaces[0].metrics.nargs.sum
old: 0.0
new: 3.0
path: .spaces[0].metrics.nargs.average
old: null
new: 3.0
path: .spaces[0].metrics.cognitive.sum
old: 0.0
new: 1.0
path: .spaces[0].metrics.cognitive.average
old: null
new: 1.0
path: .spaces[0].metrics.nexits.average
old: null
new: 0.0
path: .spaces[0].metrics.cyclomatic.average
old: 1.0
new: 2.0
path: .spaces[0].metrics.cyclomatic.sum
old: 3.0
new: 2.0
path: .spaces[0].metrics.mi.mi_sei
old: 92.24357907135526
new: 64.36664180237676
path: .spaces[0].metrics.mi.mi_original
old: 103.10880364532592
new: 96.94623611473628
path: .spaces[0].metrics.mi.mi_visual_studio
old: 60.297545991418666
new: 56.693705330255135
path: .spaces[0].metrics.loc.lloc
old: 0.0
new: 4.0
path: .spaces[0].metrics.loc.sloc
old: 16.0
new: 14.0
path: .spaces[0].metrics.loc.ploc
old: 12.0
new: 11.0
path: .spaces[0].metrics.loc.cloc
old: 1.0
new: 0.0
path: .spaces[0].metrics.halstead.level
old: 0.3
new: 0.0735930735930736
path: .spaces[0].metrics.halstead.vocabulary
old: 11.0
new: 31.0
path: .spaces[0].metrics.halstead.n2
old: 6.0
new: 17.0
path: .spaces[0].metrics.halstead.time
old: 13.453345183589487
new: 284.2348706704313
path: .spaces[0].metrics.halstead.volume
old: 72.64806399138324
new: 376.5189195894025
path: .spaces[0].metrics.halstead.estimated_program_length
old: 27.11941547876375
new: 122.78983721006222
path: .spaces[0].metrics.halstead.length
old: 21.0
new: 76.0
path: .spaces[0].metrics.halstead.N1
old: 13.0
new: 43.0
path: .spaces[0].metrics.halstead.N2
old: 8.0
new: 33.0
path: .spaces[0].metrics.halstead.effort
old: 242.1602133046108
new: 5116.227672067764
path: .spaces[0].metrics.halstead.purity_ratio
old: 1.291400737083988
new: 1.6156557527639763
path: .spaces[0].metrics.halstead.bugs
old: 0.012950323152584048
new: 0.09897191804474072
path: .spaces[0].metrics.halstead.n1
old: 5.0
new: 14.0
path: .spaces[0].metrics.halstead.difficulty
old: 3.3333333333333335
new: 13.588235294117649
path: .spaces[0].metrics.nom.functions
old: 0.0
new: 1.0
path: .spaces[0].metrics.nom.total
old: 0.0
new: 1.0

### Code

    void CheckPopSequence(const nsTPriorityQueue& aQueue,
                          const T* aExpectedSequence,
                          const uint32_t aSequenceLength) {
      nsTPriorityQueue copy = aQueue.Clone();

      for (uint32_t i = 0; i < aSequenceLength; i++) {
        EXPECT_FALSE(copy.IsEmpty());

        T pop = copy.Pop();
        EXPECT_EQ(pop, aExpectedSequence[i]);
      }

      EXPECT_TRUE(copy.IsEmpty());
    }