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

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Text processing/Max licenses in use step by step in the 11l 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 11l programming language

Source code in the 11l programming language

V out = 0
V max_out = -1
[String] max_times
L(job) File(‘mlijobs.txt’).read_lines()
   out += I ‘OUT’ C job {1} E -1
   I out > max_out
      max_out = out
      max_times.clear()
   I out == max_out
      max_times.append(job.split(‘ ’)[3])

print(‘Maximum simultaneous license use is #. at the following times:’.format(max_out))
print(‘  ’max_times.join("\n  "))

  

You may also check:How to resolve the algorithm Empty program step by step in the 360 Assembly programming language
You may also check:How to resolve the algorithm Matrix transposition step by step in the J programming language
You may also check:How to resolve the algorithm Tonelli-Shanks algorithm step by step in the Haskell programming language
You may also check:How to resolve the algorithm 99 bottles of beer step by step in the C# programming language
You may also check:How to resolve the algorithm Prime decomposition step by step in the M2000 Interpreter programming language