How to resolve the algorithm Text processing/Max licenses in use step by step in the D programming language

Published on 12 May 2024 09:40 PM
#D

How to resolve the algorithm Text processing/Max licenses in use step by step in the D programming language

Table of Contents

Problem Statement

A company currently pays a fixed sum for the use of a particular licensed software package.   In determining if it has a good deal it decides to calculate its maximum use of the software from its license management log file. Assume the software's licensing daemon faithfully records a checkout event when a copy of the software starts and a checkin event when the software finishes to its log file. An example of checkout and checkin events are:

Save the 10,000 line log file from   here   into a local file, then write a program to scan the file extracting both the maximum licenses that were out at any time, and the time(s) at which this occurs. Mirror of log file available as a zip here (offsite mirror).

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Text processing/Max licenses in use step by step in the D programming language

Source code in the d programming language

void main() {
    import std.stdio;
    int nOut, maxOut = -1;
    string[] maxTimes;

    foreach (string job; lines(File("mlijobs.txt"))) {
        nOut += (job[8] == 'O') ? 1 : -1;
        if (nOut > maxOut) {
            maxOut = nOut;
            maxTimes = null;
        }
        if (nOut == maxOut)
            maxTimes ~= job[14 .. 33];
    }

    writefln("Maximum simultaneous license use is %d at" ~
             " the following times:\n%( %s\n%)", maxOut, maxTimes);
}


  

You may also check:How to resolve the algorithm Empty program step by step in the 6502 Assembly programming language
You may also check:How to resolve the algorithm Reverse a string step by step in the 8th programming language
You may also check:How to resolve the algorithm Sudoku step by step in the ERRE programming language
You may also check:How to resolve the algorithm String case step by step in the Befunge programming language
You may also check:How to resolve the algorithm Josephus problem step by step in the PowerShell programming language