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

Source code in the clojure programming language

(defn delta [entry]
  (case (second (re-find #"\ (.*)\ @" entry))
    "IN " -1
    "OUT" 1
    (throw (Exception. (str "Invalid entry:" entry)))))

(defn t [entry]
  (second (re-find #"@\ (.*)\ f" entry)))

(let [entries (clojure.string/split (slurp "mlijobs.txt") #"\n")
      in-use (reductions + (map delta entries))
      m (apply max in-use)
      times (map #(nth (map t entries) %)
                 (keep-indexed #(when (= m %2) %1) in-use))]
  (println "Maximum simultaneous license use is" m "at the following times:")
  (map println times))


  

You may also check:How to resolve the algorithm Top rank per group step by step in the Swift programming language
You may also check:How to resolve the algorithm Benford's law step by step in the Sidef programming language
You may also check:How to resolve the algorithm Longest string challenge step by step in the Haskell programming language
You may also check:How to resolve the algorithm Sorting algorithms/Insertion sort step by step in the Factor programming language
You may also check:How to resolve the algorithm Bernstein basis polynomials step by step in the FreeBASIC programming language