1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586

// Learn more about F# at http://fsharp.org

open System
open System.Text
open System.IO
open System.Collections.Generic
// open Opulos.Core.IO
open System.Diagnostics
open System.Security.Cryptography

(* Todo
- Exclusions by list
- Detect dups and dont count
- 

*)
    

(*
Things to gather
- list of all
    (filename, extension, year, month, day, day of week, linecount)
    or possibly (if not then recomputing fields many times)
    (filename,Date,linecount)

- all extensions and counts
- exclude things TODO
- all list of
   (filename, extension, year,month, day, day of week, linecount)
   -- for each month, count total lines and lines by filetype
   -- store as map[year*100+month,map[filetype,int]]

Nice graphs:
- code lines by month broken down into type and colored
- code total lines in pie by type
- code by day of week
- # code files of type lines per file over time
- # projects - each in own dir?
- make bar chart race
- total pic: 
     use SkiaSharp, Bar chart race in UL corner, total growth LL with progress, 
     Per month (or week) in UR, and about in LR
*)

// code extensions we care about
let sourceExtensions = [
        ".cxx";".c";".cpp";".h";".hpp";
        ".cs";".fs";".xaml"; 
        ".asm";".s";".py";".js";".go"; ".pas";
        ".rc";
        ".bat"; // too much noise
        ".m"; 
        // ".ma"; ".nb"; // far too many lines, generated
        "bas"
        ]

// sequence to lowercase
// replace '\' with '/'
let normalize (str:string list) = 
    [ for s in str do 
        let s1 = s.Replace("\\","/")
        yield s1.ToLower() 
    ]

// exclusions from above
let excludeSuffixes = ["g.i.cs"]
let excludeContains = normalize [
    "/boost/";
    "/boost_1_28_0/";
    "/boost_old/";
    "/buildprocesstemplates/";
    "/libjpeg/";
    "/libpng/";
    "/loki/";
    "/opengl/";
    "/zlib/";
    "/extfilesystem/";
    "/lemmings.net/";
    "/properties/";
    "/xsharp/";
    "/wolfsrc/src/";
    "/antigraingeometry/";
    "/keccakreferenceandoptimized/";
    "/golly-1.1-src/";
    "/poker-eval-129.0/";
    "/id3lib/";
    "/lua/";
    "/borlandc/";
    "/at2g3r38sourcecode/";
    "/fmt-master/";
    "/stockfish/";
    "/relacy/";
    "/stdmarkdown/";
    "/opengl line rendering/code/";
    "/pmars-0.9.2/";
    "/obj/";
    "/debug/";
    "/release/";
    "/properties/";
    "/prettycomments_integrationtests/";
    "/zlibnet/";
    // new
    "/zlib.net/";
    "/sourcesafedata/";
    "/winwolf3d/";
    "/fontmaker/bitmapfonts/";
    "/usbgadgetdriver/usb/";
    "/libf2c/";
    "/rfvdemo/";
    "/ez_lcd_wrapper/";
    "/liblz4/";
    "/google job interview/reservations_files/";
    "/lemc/arm9/";
    "/lemmingsds/lemmingsvc/";
    "/golly/";
    "/skein/nist/";
    "/externals/";
    ".acceptancetests/";
    "/adplug";
    "/dosbox";
    "/libxmp";
    "/relacy";
    "/gumstix/";
    "/spiffs/";
    "/meyers/";
    "/applewin/";
    "/tundra python";
    "/massivelyparallelvectorgraphics/";
    "/turbo55/oop_demo/";
    "/antlr";
    "/visualgdbcache/";
    "/packages/";
    "/include/config/";
    "/c/wolfsrc/";
    "/icsharpcode.texteditor/";
    "/amber";
    "/dr dobbs";
    "/myers/";
    "/cstuff/gems";
    "/cstuff/wolfsrc/";
    "/me/src/";
    "/sound/modplay/";
    "/sound/sbdox/";
    "/sound/voc/";
    "/gadgetdriverold/";
    "/e_dec96/graphics/src/";
    "/zork123/";
    "/tume/";
    "/fof/";
    "/png/";
    "/plytool/";
    "/shellcrypt/";
    "/adplay/";
    "/turboprg/";
    ]

// file paths to check
//let dirs =  [ "D:\Programming\Code2"]
let dirs = normalize [ 
    "D:\Programming\Code2"; 
    "D:\Programming\CSTUFF2"; 
    "C:\Users\Chris\OneDrive\Code"; 
    "C:\Users\Chris\Desktop"; 
    "D:\Hypnocube\Development\Code";
    "D:\CCLText"
    ]
//let dirs =  [ "D:\Programming\Code2\FlashAnalyzer" ; "C:\Users\Chris\OneDrive\Flash Code" ]

//let dirs = ["C:\Users\clomont\Documents\Code\DataScience";"C:\Users\clomont\Documents\Code\Math3D"]
//let dirs = ["C:\Users\clomont\Documents\Code\Qt"]
//let dirs = ["C:\Users\clomont\Desktop\CSTUFF2"]


// file sequence to extension
let extension (files:string list) = [ for f in files do yield Path.GetExtension f ]

// see if item has a suffix from a list
let hasSuffix (item:string) (suffixes: string list) = 
    List.exists (fun (suffix:string) -> item.EndsWith(suffix)) suffixes

let containsAny (item:string) (matches:string list) = 
    matches |> List.exists (fun m -> item.Contains(m))

// let only code through this filter that has no matched patterns
let codeOnly (files : string list) = 
    files 
        |> normalize 
        |> Seq.filter(fun fn -> List.contains (Path.GetExtension(fn)) sourceExtensions )
        |> Seq.filter(fun fn -> not (hasSuffix fn excludeSuffixes))
        |> Seq.filter(fun fn -> not (containsAny fn excludeContains))
        |> Seq.toList

// turn a sequence of directory names into files
let rec allFiles (dirs : string list) =
    if List.isEmpty dirs then List.empty else
        [ yield! dirs |> Seq.collect Directory.EnumerateFiles
          yield! dirs |> Seq.collect Directory.EnumerateDirectories |> Seq.toList |> allFiles ]


// DateTime GetLastFileModifiedFast(string dir)
// {
//     DateTime retval = DateTime.MinValue;
//     
//     FileData [] files = FastDirectoryEnumerator.GetFiles(dir);
//     for (int i=0; i<files.Length; i++)
//     {
//         if (files[i].LastWriteTime > retval)
//         {
//             retval = lastWriteTime;
//         }
//     }
//     
//     return retval;
// }

//let allFilesFast dirs = 
//    FastFileInfo.EnumerateFiles(Seq.head dirs, "*", SearchOption.AllDirectories)
//    if Seq.isEmpty dirs then Seq.empty else
//        seq { 
//            for d in dirs do
//                yield! FastFileInfo.EnumerateFiles(d, "*", SearchOption.AllDirectories)
//            }

    //FastFileInfo.EnumerateFiles(path, "*.*", SearchOption.AllDirectories)
    //FastDirectoryEnumerator.GetFiles


// get lowercase extensions and count them
// return sequence of string*int
let tallyLowercaseExtensions (files : string list) = files |> List.countBy (fun fn->Path.GetExtension fn) 

// length of file
let countLines filename = File.ReadAllLines(filename).Length

// print all items in sequence
let printSeq s = 
    let rec phelp s c =
        if Seq.isEmpty s then c
        else
            printfn "%A" (Seq.head s)
            phelp (Seq.tail s) (c+1)
    phelp s 0


(*********************************** various code sampling things **********************)

// list all files to output, return count
let listFiles files = 
    let count = printSeq files
    printfn "Count %A" count
    count

// tally items and output
let listTally s  = 
    let fastTally s : ((string*int) list) = 
        let d = new Dictionary<string,int>()
        s |> Seq.iter(fun t -> 
                                            if d.ContainsKey(t) then ignore()
                                            else d.Add(t,0)
                                            d.[t] <- d.[t] + 1
                                            )
        [ for (KeyValue(k,v)) in d do yield (k,v) ] |> List.sortBy (fun (k,v)-> (-v))

    // let t = s |> Seq.countBy (fun f->f) 
    let t = fastTally s
    let count = printSeq t
    printfn "Count %A" count
    count

// one record per file
type Record = 
    {
    filename : string
    extension : string
    date: DateTime
    hash : string

    //year : int
    //month : int
    //day : int
    //hour : int
    //weekday : DayOfWeek
    linecount : int
    }

type TimeStep = 
    | Daily
    | Weekly
    | Biweekly
    | Monthly
    | Bimonthly
    | Quarterly

let hashFile (md5:MD5) f = 
    let bytes = File.ReadAllBytes f
    (StringBuilder(), md5.ComputeHash(bytes)) ||> Array.fold (fun sb b -> sb.Append(b.ToString("x2"))) |> string

// convert files to seq of records
let toRecords s = 
    let md5 = MD5.Create()
    s |> List.map(fun f ->
        let date = File.GetLastWriteTime f
        let ext = Path.GetExtension f
        let hash = hashFile md5 f
        {filename = f; extension = ext; hash = hash; date = date; linecount = (countLines f)  }
        )

// allow date time iteration
type Span = Span of TimeSpan with
    static member (+) (d:DateTime, Span wrapper) = d + wrapper
    static member Zero = Span(new TimeSpan(0L))

// count lines by month, return count of all lines
// takes a sequence of all records
let computeLines recs timestep = 

//    // year and month encoded as 100*y+m
//    let encode (r:Record) = 
//        match timestep with
//        | Month -> 100*(100*r.year + r.month) + 15 // all on mid month
//        | Week  -> 100*(r.year + r.month) + (r.day/7)*7
//        | Day   -> 100*(r.year + r.month) + r.day
//        
//    let decode key = 
//        let y = key/10000
//        let m = (key%10000)/100
//        let d = key%100
//        (y,m,d)
//
//    printfn "Do min max"

    // get min and max
    //let rec minmax r (min,max) = 
    //    if Seq.isEmpty r then (min,max)
    //    else
    //        let v = encode (Seq.head r)
    //        minmax (Seq.tail r) (Math.Min(min,v), Math.Max(max,v))
    //let (min,max) = minmax recs (Int32.MaxValue, Int32.MinValue)

    // sorted file types that occur
    let types = recs |> List.map (fun r->r.extension) |> Set.ofList |> Set.toList |> List.sort
    let typeCount = List.length types
    printfn "Types %A" types

    // map from code type to name index
    let typemap = types |> List.mapi (fun i x -> x,i) |> Map.ofList

    // snap date to nearby value
    let snapDate (date:DateTime) = 
        let y,m,d = date.Year, date.Month, date.Day
        match timestep with 
        | Daily ->  new DateTime(y,m,d)
        | Weekly -> 
            // 1,8,15,22 
            let d2 = ((d-1)/7) * 7 + 1
            let d3 = if d2 > 22 then 22 else d2
            new DateTime(y,m,d3)
        | Biweekly ->
            // 1,15
            let d2 = ((d-1)/14) * 14 + 1
            let d3 = if d2 > 15 then 15 else d2
            new DateTime(y,m,d3)
        | Monthly -> 
            new DateTime(y,m,1)
        | Bimonthly ->
            // m = 1,3,5,7,11
            let m2 = ((m-1)/2)*2+1
            new DateTime(y,m2,1)
        | Quarterly ->
            // m = 1,4,7,10
            let m2 = ((m-1)/3)*3+1
            new DateTime(y,m2,1)

    // find first date
    let dates = recs |> Seq.map(fun r->r.date)
    let startDate = dates |> Seq.min
    let endDate   = dates |> Seq.max

    printfn "Date range %A to %A" startDate endDate

    printfn "Do array"

    let dayData = new Dictionary<DateTime,(int array)>()

    // populate
    let days = 
        seq {
            let mutable d = snapDate startDate
            let e = snapDate endDate
            while d < e do    
                yield d
                d <- d + TimeSpan.FromDays(1.0)
            yield e
        } |> Seq.toList

    printfn "Column count %A" days.Length

    for d in days do
        let snap = snapDate d
        if not (dayData.ContainsKey(snap)) then
            dayData.Add(snap, Array.create (types.Length) 0)

    printfn "Num entries %A" dayData.Keys.Count


    // add record to data
    let addTo (r:Record) = 
        let date = snapDate r.date
        let m = dayData.[date]
        let index = typemap.[r.extension]
        m.[index] <- m.[index] + r.linecount

    printfn "Do fill"
    for item in recs do
        addTo item

    // sorted data
    printfn "Do sort"
    let array = dayData |> Seq.sortBy(fun (KeyValue(k,v))->k) |> Seq.map(fun (KeyValue(k,v))->(k,v))

    printfn "Do output"

    // now output 
    use file = File.CreateText("Data.csv")
    
    // header and dates
    file.Write("Name,")
    array |> Seq.iter (fun (date,_) -> 
        let y,m,d = date.Year,date.Month,date.Day
        file.Write(String.Format("{0}/{1}/{2},",y,m,d))
        )
    file.WriteLine()

    for i in [0..types.Length-1] do
        let t = types.[i]
        file.Write(t+",")
        let mutable sum = 0
        array |> Seq.iter (fun (date,data) -> 
            let v = data.[i]
            sum <- sum + v
            file.Write(String.Format("{0},",sum))
            )
        file.WriteLine()

//    array |> Array.iteri (fun i (total,arr) -> 
//        let y,m,d = decode (i+min)
//
//        printf "%A-%A-%A %A: " y m d total
//        arr |> Array.iteri (fun j count ->
//            printf "%A=%A" types.[j] count
//            )
//        printfn ","
//        )

    file.Close()
    printfn "File written"

let timer = new Stopwatch();
let timeMsg msg = 
    printf msg
    printfn ": %A" timer.Elapsed

let time f = 
    let proc = Process.GetCurrentProcess()
    let cpu_time_stamp = proc.TotalProcessorTime
    let timer = new Stopwatch()
    timer.Start()
    try
        f()
    finally
        let cpu_time = (proc.TotalProcessorTime-cpu_time_stamp).TotalMilliseconds
        printfn "CPU time = %dms" (int64 cpu_time)
        printfn "Absolute time = %dms" timer.ElapsedMilliseconds

let rec loop n f x =
    if n > 0 then
        f x |> ignore
        loop (n-1) f x

let runit() = 

    timer.Start()

    printfn "Do files"
    let files = (allFiles dirs) |> Seq.toList
    timeMsg "files done"

    //printfn "Do files 2"
    //let f2 = allFilesFast dirs |> Seq.toList
    //timeMsg "files 2 done"

    //printfn "Sizes %A %A" files.Length f2.Length

    printfn "Do derived"
    let lowercaseFiles = files |> normalize   
    let lowercaseCodeFiles = lowercaseFiles |> codeOnly
    printfn "%A code files " lowercaseCodeFiles.Length

    let removed = lowercaseCodeFiles |> List.filter (fun fn -> containsAny fn excludeContains)
    for r in removed do 
        printfn "%A" r
    
    //ignore <| listFiles files 
    //ignore <| listFiles lowercaseFiles
    //ignore <| listFiles lowercaseCodeFiles

    // extension count of all 
    //ignore <| listTally (lowercaseFiles |> extension)

    // extension count of code
    //ignore <| listTally (lowercaseCodeFiles |> extension)


    printfn "Do recs"

    // (filename, extension, year, month, day, day of week, linecount)
    let mutable recs = lowercaseCodeFiles |> toRecords |> List.filter(fun r -> r.date.Year > 1989) |>  List.sortBy(fun r -> r.date)

    printfn "Rec from %A to %A " recs.[0].date recs.[recs.Length-1].date

    //for i in [0..10] do
    //    printfn "%A" recs.[i]

    let linesOfCode = recs |> List.sumBy(fun r-> r.linecount)
    printfn "Lines of code %A" linesOfCode

    // remove dups, dump again
    printfn "Removing dups"
    let mutable s = Set.empty
    let crecs = seq {
        for r in recs do
            if not (s.Contains r.hash) then
                yield r
                s <- s.Add(r.hash)
        } 
    
    recs <- crecs |> Seq.toList
    printfn "Lines of code %A" (recs |> List.sumBy(fun r->r.linecount))

    // dump files
    use f = File.CreateText("Files.txt")
    for c in recs do
        f.WriteLine(c.filename)
    f.Close()
    printfn "Files dumped"



    // ignore <| printSeq dat

    printfn "Do lines"

    // lines by month or day
    computeLines recs Bimonthly
    

    0 // return an integer exit code

let testit() = 
    ignore()
    let mutable c = 0
    let files = 
        seq {
        for f in File.ReadAllLines("exclude1Files.txt") do
            yield f
        } |> Seq.filter (fun f -> not (String.IsNullOrEmpty f))
        |> Seq.toList
        |> codeOnly
    printfn "Test files %A" files.Length

    for c in files do
        printfn "%A" c

//    let test = 
//        [
//        //"d:/programming/code2/buildprocesstemplates/defaulttemplate.11.1.xaml";
//        "d:/programming/cstuff2/boost_1_28_0/boost/any.hpp"
//        ] |> codeOnly 
//    ignore <| listFiles test


[<EntryPoint>]
let main argv =
    //testit()
    runit()
    0 // return an integer exit code