< Summary

Information
Class: LeetCode.Algorithms.DesignAnOrderedStream.DesignAnOrderedStreamArray
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\DesignAnOrderedStream\DesignAnOrderedStreamArray.cs
Line coverage
100%
Covered lines: 14
Uncovered lines: 0
Coverable lines: 14
Total lines: 47
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
.ctor(...)100%11100%
Insert(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\DesignAnOrderedStream\DesignAnOrderedStreamArray.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12namespace LeetCode.Algorithms.DesignAnOrderedStream;
 13
 14/// <inheritdoc />
 15public class DesignAnOrderedStreamArray : IDesignAnOrderedStream
 16{
 17    private readonly string?[] _stream;
 18    private int _pointer;
 19
 120    public DesignAnOrderedStreamArray(int n)
 121    {
 122        _stream = new string[n];
 123    }
 24
 25    /// <summary>
 26    ///     Time complexity - O(n)
 27    ///     Space complexity - O(n)
 28    /// </summary>
 29    /// <param name="idKey"></param>
 30    /// <param name="value"></param>
 31    /// <returns></returns>
 32    public IList<string?> Insert(int idKey, string value)
 533    {
 534        var result = new List<string?>();
 35
 536        _stream[idKey - 1] = value;
 37
 1038        while (_pointer < _stream.Length && _stream[_pointer] != null)
 539        {
 540            result.Add(_stream[_pointer]);
 41
 542            _pointer++;
 543        }
 44
 545        return result;
 546    }
 47}