id int64 0 45.1k | file_name stringlengths 4 68 | file_path stringlengths 14 193 | content stringlengths 32 9.62M | size int64 32 9.62M | language stringclasses 1
value | extension stringclasses 6
values | total_lines int64 1 136k | avg_line_length float64 3 903k | max_line_length int64 3 4.51M | alphanum_fraction float64 0 1 | repo_name stringclasses 779
values | repo_stars int64 0 882 | repo_forks int64 0 108 | repo_open_issues int64 0 90 | repo_license stringclasses 8
values | repo_extraction_date stringclasses 146
values | sha stringlengths 64 64 | __index_level_0__ int64 0 45.1k | exdup_ids_cmlisp_stkv2 listlengths 1 47 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
42,145 | seven.lisp | drvdputt_aoc-2022/src/seven.lisp | (load "file.lisp")
(load "string.lisp")
(defvar lines (read-default-input "seven"))
(defvar path "/")
;; use hash table compatible with strings as keys (need equal as the compare function)
(defvar dutable (make-hash-table :test 'equal))
(defun dutable/print (dutable)
(loop for k being each hash-key of dutable
do (p... | 2,734 | Common Lisp | .lisp | 85 | 28.341176 | 90 | 0.645849 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | f95b6a081041720c522a1ce5c0688fedc86c0d443418e67e286e579c834a48c7 | 42,145 | [
-1
] |
42,146 | string.lisp | drvdputt_aoc-2022/src/string.lisp | ;; find the first character of string 1, that also appears in string 2
(load "~/quicklisp/setup.lisp")
(ql:quickload :cl-ppcre)
(defun starts-with (s1 s2)
(and (>= (length s1) (length s2))
(string= (subseq s1 0 (length s2)) s2)))
(defun string-contains-char (s c)
(not (null (find c s))))
(defun count-char... | 1,831 | Common Lisp | .lisp | 61 | 26.688525 | 72 | 0.660785 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 5ba99e6415200cf0d6284154b2ca85b96faff01a2ebe1d0037f324e16166baae | 42,146 | [
-1
] |
42,153 | fifteen-example-input.txt | drvdputt_aoc-2022/src/fifteen-example-input.txt | Sensor at x=2, y=18: closest beacon is at x=-2, y=15
Sensor at x=9, y=16: closest beacon is at x=10, y=16
Sensor at x=13, y=2: closest beacon is at x=15, y=3
Sensor at x=12, y=14: closest beacon is at x=10, y=16
Sensor at x=10, y=20: closest beacon is at x=10, y=16
Sensor at x=14, y=17: closest beacon is at x=10, y=16
... | 738 | Common Lisp | .l | 14 | 51.714286 | 53 | 0.689227 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 48b80b1878aafb775d0239ea3483a8fa00ab68c4115d1fe8da7ad92464e69e18 | 42,153 | [
-1
] |
42,155 | ten-example-input.txt | drvdputt_aoc-2022/src/ten-example-input.txt | addx 15
addx -11
addx 6
addx -3
addx 5
addx -1
addx -8
addx 13
addx 4
noop
addx -1
addx 5
addx -1
addx 5
addx -1
addx 5
addx -1
addx 5
addx -1
addx -35
addx 1
addx 24
addx -19
addx 1
addx 16
addx -11
noop
noop
addx 21
addx -15
noop
noop
addx -3
addx 9
addx 1
addx -3
addx 8
addx 1
addx 5
noop
noop
noop
noop
noop
addx -3... | 980 | Common Lisp | .l | 146 | 5.712329 | 8 | 0.847722 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 77bf5e4abbac5ee5998eb102707d43ff695833db3513364d8acd441f5e28a4eb | 42,155 | [
-1
] |
42,158 | twentytwo-example-input.txt | drvdputt_aoc-2022/src/twentytwo-example-input.txt | ...#
.#..
#...
....
...#.......#
........#...
..#....#....
..........#.
...#....
.....#..
.#......
......#.
10R5L5R10L4R5L5
| 189 | Common Lisp | .l | 13 | 8.538462 | 16 | 0.085714 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 5d8e450f7f336b55956bf5d14fc8579fe528a38cf57f85ab9fbc7444dd5ad1dc | 42,158 | [
-1
] |
42,161 | five-example-input.txt | drvdputt_aoc-2022/src/five-example-input.txt | [D]
[N] [C]
[Z] [M] [P]
1 2 3
move 1 from 2 to 1
move 3 from 1 to 3
move 2 from 2 to 1
move 1 from 1 to 2
| 125 | Common Lisp | .l | 8 | 12.75 | 18 | 0.525862 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | f6d997c55b65110d52426f142ed20ea65c1b62c115f4032aed9aace56044e61e | 42,161 | [
-1
] |
42,164 | twelve-input.txt | drvdputt_aoc-2022/src/twelve-input.txt | abaaacccccccccaaaaaaccccccccccccccccaacccccccccccaacaaaaaaaaaaaaaaaaaccaaaaacccaaaaccccccccccccccccccccccccccccccccccccccccccccccccccccccccaaaaa
abaaacccccccccaaaaaacccccccccccccccaaaaccccccccccaaaaaaaacaaaaaaaaaaaccaaaaaaccaaaacccccccccccccccccccccccccccccccccccccccccccccccccccccccaaaaaa
abaaaccccccccccaaaaacccccccccc... | 5,945 | Common Lisp | .l | 41 | 144 | 144 | 1 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 5e4dedbf2a7e98335af138061a26fb9d7906856254d53807551e3de5c408d30b | 42,164 | [
-1
] |
42,165 | eleven-input.txt | drvdputt_aoc-2022/src/eleven-input.txt | Monkey 0:
Starting items: 89, 73, 66, 57, 64, 80
Operation: new = old * 3
Test: divisible by 13
If true: throw to monkey 6
If false: throw to monkey 2
Monkey 1:
Starting items: 83, 78, 81, 55, 81, 59, 69
Operation: new = old + 1
Test: divisible by 3
If true: throw to monkey 7
If false: thro... | 1,278 | Common Lisp | .l | 48 | 23.145833 | 48 | 0.672935 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 5c645578b7972b4ba030ec6d77a9ce783a7359bb521106f03e52519276afe434 | 42,165 | [
-1
] |
42,167 | twentyone-example-input.txt | drvdputt_aoc-2022/src/twentyone-example-input.txt | root: pppw + sjmn
dbpl: 5
cczh: sllz + lgvd
zczc: 2
ptdq: humn - dvpt
dvpt: 3
lfqf: 4
humn: 5
ljgn: 2
sjmn: drzm * dbpl
sllz: 4
pppw: cczh / lfqf
lgvd: ljgn * ptdq
drzm: hmdt - zczc
hmdt: 32
| 191 | Common Lisp | .l | 15 | 11.733333 | 17 | 0.710227 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | bd2b7a5ad2426297b514430ad36e312fe73312fbc63b58ba60ce85bc5a43f551 | 42,167 | [
-1
] |
42,172 | eighteen-example-input.txt | drvdputt_aoc-2022/src/eighteen-example-input.txt | 2,2,2
1,2,2
3,2,2
2,1,2
2,3,2
2,2,1
2,2,3
2,2,4
2,2,6
1,2,5
3,2,5
2,1,5
2,3,5
| 78 | Common Lisp | .l | 13 | 5 | 5 | 0.6 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 39b466721f296c742094589b84bcf0ca46e739614d547d43b1092395392c6c0d | 42,172 | [
-1
] |
42,174 | sixteen-example-input.txt | drvdputt_aoc-2022/src/sixteen-example-input.txt | Valve AA has flow rate=0; tunnels lead to valves DD, II, BB
Valve BB has flow rate=13; tunnels lead to valves CC, AA
Valve CC has flow rate=2; tunnels lead to valves DD, BB
Valve DD has flow rate=20; tunnels lead to valves CC, AA, EE
Valve EE has flow rate=3; tunnels lead to valves FF, DD
Valve FF has flow rate=0; tunn... | 562 | Common Lisp | .l | 10 | 55.2 | 60 | 0.764493 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 845384aa7c3d1c2df8e4e1dd57de2b7b30e7a4db743d7f31c8d7c4f29d90ba58 | 42,174 | [
-1
] |
42,178 | eleven-example-input.txt | drvdputt_aoc-2022/src/eleven-example-input.txt | Monkey 0:
Starting items: 79, 98
Operation: new = old * 19
Test: divisible by 23
If true: throw to monkey 2
If false: throw to monkey 3
Monkey 1:
Starting items: 54, 65, 75, 74
Operation: new = old + 6
Test: divisible by 19
If true: throw to monkey 2
If false: throw to monkey 0
Monkey 2:
... | 610 | Common Lisp | .l | 24 | 21.958333 | 32 | 0.684391 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | db28afb84c7ee2f0b4f26dd9feed58084687fd0ab215e7a625cfc3748d079366 | 42,178 | [
-1
] |
42,182 | nine-example-input.txt | drvdputt_aoc-2022/src/nine-example-input.txt | R 4
U 4
L 3
D 1
R 4
D 1
L 5
R 2
| 32 | Common Lisp | .l | 8 | 3 | 3 | 0.666667 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 19bfe6b1f8c6def3cc643dc5f2f7e62f7f8a4d656e41d15594e3e0ccea4b6f91 | 42,182 | [
-1
] |
42,183 | twentythree-larger-input.txt | drvdputt_aoc-2022/src/twentythree-larger-input.txt | ..............
..............
.......#......
.....###.#....
...#...#.#....
....#...##....
...#.###......
...##.#.##....
....#..#......
..............
..............
..............
| 180 | Common Lisp | .l | 12 | 14 | 14 | 0 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | ada95017568c51bbb0251460b6babf5cc066a7954ee0e0ea251b56f4d7938fe4 | 42,183 | [
-1
] |
42,186 | thirteen-example-input.txt | drvdputt_aoc-2022/src/thirteen-example-input.txt | [1,1,3,1,1]
[1,1,5,1,1]
[[1],[2,3,4]]
[[1],4]
[9]
[[8,7,6]]
[[4,4],4,4]
[[4,4],4,4,4]
[7,7,7,7]
[7,7,7]
[]
[3]
[[[]]]
[[]]
[1,[2,[3,[4,[5,6,7]]]],8,9]
[1,[2,[3,[4,[5,6,0]]]],8,9]
| 186 | Common Lisp | .l | 16 | 10.1875 | 27 | 0.337423 | drvdputt/aoc-2022 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 9bf0149b593d7372700ed4f50d4d1fdd552c5c99774ddcd16b633f5ae83dc539 | 42,186 | [
-1
] |
42,206 | day12.lisp | kodmkr_aoc22/day12.lisp | (in-package :day12)
(defun read-input (&optional (input-path "./example/day12"))
(with-open-file (s input-path)
(loop for line = (read-line s nil nil) while line
collect line)))
(defparameter *start* nil)
(defparameter *end* nil)
(defparameter *grid* nil)
(defparameter *preds* nil)
(defun process (ll... | 5,597 | Common Lisp | .lisp | 145 | 28.993103 | 93 | 0.508646 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 7ed5b2bb755c310e8a23d7353816d300dbe23861e7c5eb105a42d96e612ca6ee | 42,206 | [
-1
] |
42,207 | package.lisp | kodmkr_aoc22/package.lisp | ;;;; package.lisp
(defpackage #:aoc22
(:use #:cl))
(defpackage :day01
(:use :cl :arrow-macros))
(defpackage :day02
(:use :cl :arrow-macros))
(defpackage :day03
(:use :cl :arrow-macros))
(defpackage :day04
(:use :cl :arrow-macros))
(defpackage :day05
(:use :cl :arrow-macros))
(defpackage :day06
(:us... | 1,306 | Common Lisp | .lisp | 54 | 21.685185 | 39 | 0.685714 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 6d80f4421db291c97b0dbfaf31736bfbae3d008f6c5f478e9de9db6790fc6bc0 | 42,207 | [
-1
] |
42,208 | day21.lisp | kodmkr_aoc22/day21.lisp | (in-package :day21)
(defun processed (line)
(let* ((colon-pos (position #\: line))
(monkey-name (subseq line 0 colon-pos))
(opd1-start (+ colon-pos 2)))
(cond ((digit-char-p (char line opd1-start))
(list monkey-name (parse-integer (subseq line opd1-start))))
(t (let* ((op-p... | 4,972 | Common Lisp | .lisp | 127 | 27.070866 | 124 | 0.463051 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 5c47839336a7c99c16c967d83232d7a5fa86c77c70902b68e3c9041663d2d7c4 | 42,208 | [
-1
] |
42,209 | day05.lisp | kodmkr_aoc22/day05.lisp | (in-package :day05)
(defun read-input (&optional (input-path "./example/day05"))
(with-open-file (s input-path)
(let ((config (loop for line = (read-line s nil nil)
while (not (string= "" line))
collect line))
(instructions (loop for line = (read-line s n... | 2,961 | Common Lisp | .lisp | 69 | 32.115942 | 95 | 0.544225 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | e739e492eb402918e76b457f152b79f67aad7576af3194376819fcf156847c1a | 42,209 | [
-1
] |
42,210 | day03.lisp | kodmkr_aoc22/day03.lisp | (in-package :day03)
(defun read-input (&optional (input-path "./example/day03"))
(with-open-file (s input-path)
(loop for line = (read-line s nil nil) while line
collect line)))
(defun compartments (rucksack)
(let* ((l (length rucksack))
(compartment-size (floor l 2)))
(list (subseq ruc... | 1,408 | Common Lisp | .lisp | 35 | 34.342857 | 81 | 0.626647 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | f5f46be740010eb4f03fdde3a5e2ec16ad6282eb5d384d33f3261d55afc4e194 | 42,210 | [
-1
] |
42,211 | day13.lisp | kodmkr_aoc22/day13.lisp | (in-package :day13)
(defun read-input (&optional (input-path "./example/day13"))
(with-open-file (s input-path)
(loop with pairs
with curr
for line = (read-line s nil nil)
while line
if (string= "" line) do
(push (nreverse curr) pairs)
(setf curr ni... | 3,347 | Common Lisp | .lisp | 87 | 30.011494 | 88 | 0.431825 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 39932a5ac3bb9037f2b9568ed317d7f1540eae047f9474a5c575a8f16729a3d5 | 42,211 | [
-1
] |
42,212 | day04.lisp | kodmkr_aoc22/day04.lisp | (in-package :day04)
(defun processed (line)
(ppcre:register-groups-bind ((#'parse-integer r1s r1e r2s r2e))
("(\\d+)-(\\d+),(\\d+)-(\\d+)" line)
(list (list r1s r1e) (list r2s r2e))))
(defun read-input (&optional (input-path "./example/day04"))
(with-open-file (s input-path)
(loop for line = (read-l... | 1,117 | Common Lisp | .lisp | 32 | 29 | 65 | 0.569045 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 4d3dda142aa9be7b71a27a69dcc26964725f0f9f4e29ddaecef07287c7aab966 | 42,212 | [
-1
] |
42,213 | day01.lisp | kodmkr_aoc22/day01.lisp | (in-package :day01)
(defun read-input (input-string)
(with-open-file (s input-string)
(let ((res nil))
(loop with tmp
for line = (read-line s nil nil)
while line
if (string= line "") do
(push tmp res)
(setf tmp nil)
else do
... | 887 | Common Lisp | .lisp | 34 | 19.794118 | 54 | 0.526564 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 17673791719d0b97c6f6eb41f89f46240379958ca744399ecee6619f4ac2f815 | 42,213 | [
-1
] |
42,214 | day06.lisp | kodmkr_aoc22/day06.lisp | (in-package :day06)
(defun read-input (&optional (input-path "./example/day0601"))
(let ((s (alexandria:read-file-into-string input-path)))
s))
(defun process (signal &key (view-width 4))
(let ((len (length signal)))
(loop for i from 0 below (- len view-width)
for view = (make-array view-width :... | 814 | Common Lisp | .lisp | 20 | 34 | 70 | 0.6 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 9be753b5124530f9d1d0587f88853a01c47dc6aa59eb21dd860d34989eb3fe4a | 42,214 | [
-1
] |
42,215 | aoc22.lisp | kodmkr_aoc22/aoc22.lisp | ;;;; aoc22.lisp
(in-package #:aoc22)
(defun run (&key day sol)
"Runs the solution SOL{sol} in package DAY{day},
where `{day}` is a two digit number from 1 to 25 and
`{sol}` is either the number 1 or the number 2.
EXAMPLE.
(run 1 1) ; => causes DAY01:SOL1 to be run"
(funcall (find-symbol (format nil "SOL... | 362 | Common Lisp | .lisp | 9 | 37.444444 | 81 | 0.661891 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 284cec542286602110a75a827b89d3f5de57770114c5ec553c7ada4e7b6f36a1 | 42,215 | [
-1
] |
42,216 | day08.lisp | kodmkr_aoc22/day08.lisp | (in-package :day08)
(defun read-input (&optional (input-path "./example/day08"))
(with-open-file (s input-path)
(loop for line = (read-line s nil nil)
while line
collect (mapcar (lambda (c)
(- (char-code c) (char-code #\0)))
(coerce line '... | 3,056 | Common Lisp | .lisp | 71 | 29.971831 | 98 | 0.437059 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 00686a2239a85852db033fba4c6601848b93d68cdb3e5b3997cb89addca4c1e8 | 42,216 | [
-1
] |
42,217 | day09.lisp | kodmkr_aoc22/day09.lisp | (in-package :day09)
(defun map-dir (dir)
(alexandria:switch (dir :test #'char=)
(#\U #c(0 1))
(#\D #c(0 -1))
(#\L #c(-1 0))
(#\R #c(1 0))))
(defun extracted (line)
(ppcre:register-groups-bind (dir (#'parse-integer amount))
("(R|U|L|D) (\\d+)" line)
(list (map-dir (char dir 0)) amount)))
... | 1,908 | Common Lisp | .lisp | 60 | 25.85 | 65 | 0.500816 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 4bfedc1356cc3439be270e6d67443b34462ee335ea463cc1461fe5198f728c5c | 42,217 | [
-1
] |
42,218 | day07.lisp | kodmkr_aoc22/day07.lisp | (in-package :day07)
(defstruct node
(name "" :type string)
(size 0 :type integer)
(parent nil)
(children nil :type list))
(defun leaf-p (node)
(null (node-children node)))
(defun read-input (&optional (input-path "./example/day07"))
(with-open-file (s input-path)
(loop for line = (read-lin... | 2,725 | Common Lisp | .lisp | 61 | 32.786885 | 115 | 0.508845 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 1a2b11683369d3f3ffe294316187271b95e2ffd3537ec6f771b45ce7ccd80912 | 42,218 | [
-1
] |
42,219 | day02.lisp | kodmkr_aoc22/day02.lisp | (in-package :day02)
(defun read-input (input-string)
(with-open-file (s input-string)
(loop for line = (read-line s nil nil)
while line
collect (ppcre:split " " line))))
(defun check-round (opp me)
(alexandria:switch ((list opp me) :test #'equal)
('("A" "X") 3)
('("A" "Y") 6)
(... | 1,730 | Common Lisp | .lisp | 69 | 20.391304 | 61 | 0.466707 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 0da0b711a0f39fc7835aefcf6941428896f3b5249370036dda918c5448c9a602 | 42,219 | [
-1
] |
42,220 | day10.lisp | kodmkr_aoc22/day10.lisp | (in-package :day10)
(defclass instr ()
((name :initform "" :initarg :name :reader name)
(cycles :initform 0 :initarg :cycles :accessor cycles)
(operands :initform nil :initarg :operands :accessor operands)))
(defclass noop (instr)
((name :initform "noop")
(cycles :initform 1)))
(defclas... | 2,800 | Common Lisp | .lisp | 73 | 33.260274 | 86 | 0.613201 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 967da870099e6483d38f0d2b1b94769441cf701b36d193b1a2debbda93e357e0 | 42,220 | [
-1
] |
42,221 | aoc22.asd | kodmkr_aoc22/aoc22.asd | ;;;; aoc22.asd
(asdf:defsystem #:aoc22
:description "???"
:depends-on ("cl-ppcre"
"arrow-macros"
"alexandria"
"serapeum"
"anaphora"
"1am"
"vecto"
"bit-smasher")
:version "0.0.1"
:serial t
:components ((:f... | 1,145 | Common Lisp | .asd | 40 | 14.925 | 32 | 0.344828 | kodmkr/aoc22 | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 309be8e720323b71a7bf58a2dc6f3327220892765e71f0ece4691bff4c3c0a52 | 42,221 | [
-1
] |
42,252 | main.lisp | hraban_leetcode-1657-cl-nix/main.lisp | ;; Copyright © 2022 Hraban Luyat
;;
;; This program is free software: you can redistribute it and/or modify
;; it under the terms of the GNU Affero General Public License as published
;; by the Free Software Foundation, version 3 of the License.
;;
;; This program is distributed in the hope that it will be useful,
;;... | 1,304 | Common Lisp | .lisp | 32 | 36.09375 | 75 | 0.664562 | hraban/leetcode-1657-cl-nix | 0 | 0 | 0 | AGPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 2819e4ea7420c202ad6ce2b26f938fdae58b42d2f3dc883ef76ad63ef7f510da | 42,252 | [
-1
] |
42,253 | leetcode-1657.asd | hraban_leetcode-1657-cl-nix/leetcode-1657.asd | ;; Copyright © 2022 Hraban Luyat
;;
;; This program is free software: you can redistribute it and/or modify
;; it under the terms of the GNU Affero General Public License as published
;; by the Free Software Foundation, version 3 of the License.
;;
;; This program is distributed in the hope that it will be useful,
;;... | 961 | Common Lisp | .asd | 23 | 40 | 75 | 0.754274 | hraban/leetcode-1657-cl-nix | 0 | 0 | 0 | AGPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | ed3f48de101bbe7a1a269320f091103f5a64219727321e075064ac424d87d50f | 42,253 | [
-1
] |
42,255 | flake.lock | hraban_leetcode-1657-cl-nix/flake.lock | {
"nodes": {
"cl-nix-lite": {
"locked": {
"lastModified": 1699028934,
"narHash": "sha256-ISS78eMmKHpKqV5FlulK+XisNzKa9CGUMXIGQaYqZnY=",
"owner": "hraban",
"repo": "cl-nix-lite",
"rev": "7850aef6947b80bdf3fbb3b79dad729f937ec869",
"type": "github"
},
... | 1,894 | Common Lisp | .l | 75 | 17.853333 | 73 | 0.514568 | hraban/leetcode-1657-cl-nix | 0 | 0 | 0 | AGPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 961057b9a6aa51b9f0ca6029540525bb60e2d954ef72153aa005ade1cc3c0792 | 42,255 | [
-1
] |
42,257 | flake.nix | hraban_leetcode-1657-cl-nix/flake.nix | {
description = "leetcode-1657";
inputs = {
flake-utils.url = "github:numtide/flake-utils";
cl-nix-lite.url = "github:hraban/cl-nix-lite";
};
outputs = {
self, nixpkgs, cl-nix-lite, flake-utils
}:
flake-utils.lib.eachDefaultSystem (system:
let
pkgs = nixpkgs.legacyPackages.${syst... | 988 | Common Lisp | .l | 31 | 22.612903 | 84 | 0.556949 | hraban/leetcode-1657-cl-nix | 0 | 0 | 0 | AGPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 45bab57e1fb3e0670f2e5ecc58e18144551efdec163d45cced247aa9aaac473a | 42,257 | [
-1
] |
42,272 | combinemultichannels.lisp | brandflake11_combine-multi-channels/combinemultichannels.lisp | ;; combine-multi-audio-channels
;; This file Copyright (C) 2022 Brandon Hale
;; This program is free software: you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation, either version 3 of the License, or
;; (at your option) any later... | 3,358 | Common Lisp | .lisp | 68 | 47.323529 | 232 | 0.746177 | brandflake11/combine-multi-channels | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 0ee1cd759b303e622976b834d8be7827e0f4cec403bdaeff7fe004d94eac357c | 42,272 | [
-1
] |
42,273 | combine-multi-channels.asd | brandflake11_combine-multi-channels/combine-multi-channels.asd | ;; combine-multi-audio-channels
;; This file Copyright (C) 2022 Brandon Hale
;; This program is free software: you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation, either version 3 of the License, or
;; (at your option) any later... | 1,118 | Common Lisp | .asd | 21 | 51.47619 | 89 | 0.769442 | brandflake11/combine-multi-channels | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:06 AM (Europe/Amsterdam) | 23be3850f17d3b8f3111387aa1fec997f465cbf56e5b19dac28382ffb800da56 | 42,273 | [
-1
] |
42,292 | game.lsp | racciel_LispGameofLife/game.lsp | (setq *print-case* :capitalize)
(defun createArray(rows cols)
(make-array (list rows cols))
)
(defvar *numrows*)
(defvar *numcolumns*)
(defun start ()
(print "Enter the number of rows: ")
(setf *numrows* (read))
;;(setf *numrows* 50)
(print "Enter the number of columns: ")
;;(setf *num... | 3,218 | Common Lisp | .l | 108 | 19.175926 | 85 | 0.40695 | racciel/LispGameofLife | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 39af113bfbba288b4f86712914b087d7febb0caa49273800ba8ce46107b3e09d | 42,292 | [
-1
] |
42,308 | Hello.lisp | pswaff1_Introductory_LISP_Practice/Hello.lisp | ; Hello.lisp
;
; A LISP program that displays the message, "Hello, world!" to
; the command line
;
; NCU.edu
; School of Technology & Engineering
; TIM6110
;
; Author: Patrick Swafford
; Date: 15 January 2023
(defun main()
(setq message "Hello, world!")
(princ message)
)
(main) | 288 | Common Lisp | .lisp | 16 | 16.4375 | 62 | 0.719557 | pswaff1/Introductory_LISP_Practice | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 56cb07877914643ca052232091d68a433646272410705b06c81f86eae410ed7f | 42,308 | [
-1
] |
42,309 | Sentence_Reversinator.lisp | pswaff1_Introductory_LISP_Practice/Sentence_Reversinator.lisp | ; Sentence_Reversinator.lisp
;
; A LISP program that prompts the user for a sentence
; then displays the words in reverse order
;
; NCU.edu
; School of Technology & Engineering
; TIM6110
;
; Author: Patrick Swafford
; Date: 15 January 2023
(defun string-to-list (string)
(let ((len (length string)) ; Get the leng... | 1,583 | Common Lisp | .lisp | 32 | 43.59375 | 100 | 0.582041 | pswaff1/Introductory_LISP_Practice | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 87ecf6b2ed2cfe4c68e9ecd1e506edaaa742bd729282b71eb6fa262c431808ca | 42,309 | [
-1
] |
42,310 | CFTC.lisp | pswaff1_Introductory_LISP_Practice/CFTC.lisp | ; CFTC.lisp [convert_fahrenheit_to_celsius]
;
; A LISP program that prompts the user for a temperature in Fahrenheit,
; converts the temperature to Celsius, and displays the result to the
; screen.
;
; NCU.edu
; School of Technology & Engineering
; TIM6110
;
; Author: Patrick Swafford
; Date: 15 January 2023
(defun ma... | 517 | Common Lisp | .lisp | 20 | 23.8 | 71 | 0.719758 | pswaff1/Introductory_LISP_Practice | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | f8df63e5c5db92537d94fb0b1820c29471dea9444ec3ce781b4bb6ea85eb276a | 42,310 | [
-1
] |
42,329 | transport.lisp | ormf_cl-jack-transport/transport.lisp | ;;; This file was automatically generated by SWIG (http://www.swig.org).
;;; Version 3.0.12
;;;
;;; Do not make changes to this file unless you know what you are doing--modify
;;; the SWIG interface file instead.
(in-package :jack-transport)
;;;SWIG wrapper code starts here
(cl:defmacro defanonenum (cl:&body enums)
... | 3,838 | Common Lisp | .lisp | 87 | 33.183908 | 98 | 0.565567 | ormf/cl-jack-transport | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 33aef0a4e96624baca50bf87ca02fa5cd27b8a80971906a4695cec504d69f12c | 42,329 | [
-1
] |
42,330 | package.lisp | ormf_cl-jack-transport/package.lisp | ;;;; package.lisp
(defpackage #:jack-transport
(:use #:cl #:cffi)
(:export
#:CONNECT
#:DISCONNECT
#:RECONNECT
#:LOCATE
#:GET-POSITION
#:START
#:STOP
#:TRANSPORT-STATE
#:GET-FRAME-RATE
#:SET-TRANSPORT-RESPONDER
))
(in-package :jack-transport)
(define-foreign-library libjack
(:... | 506 | Common Lisp | .lisp | 22 | 19.318182 | 53 | 0.647679 | ormf/cl-jack-transport | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | a4d89f08b4bf1ec180a36f68ecfd33a4c027bdfe5d97258fe2c7172fb14d10a6 | 42,330 | [
-1
] |
42,331 | callbacks.lisp | ormf_cl-jack-transport/callbacks.lisp | ;;;
;;; callbacks.lisp
;;;
;;; callback mechanism for jack-transport.
;;;
;;; use #'set-transport-responder with the keywords :start, :stop or
;;; :sync to set responder functions of no arguments when the
;;; transport state is changed. These functions will be called in
;;; their own thread to avoid blocking of jack's... | 4,096 | Common Lisp | .lisp | 104 | 34.144231 | 81 | 0.629369 | ormf/cl-jack-transport | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | fe6c0cf6eebaf5ed0671ad1b22fb38bdbff6bf08e7bb35e5170949e38c000404 | 42,331 | [
-1
] |
42,332 | types.lisp | ormf_cl-jack-transport/types.lisp | ;;; This file was automatically generated by SWIG (http://www.swig.org).
;;; Version 3.0.12
;;;
;;; Do not make changes to this file unless you know what you are doing--modify
;;; the SWIG interface file instead.
(in-package :jack-transport)
;;;SWIG wrapper code starts here
(cl:defmacro defanonenum (cl:&body enums)
... | 5,437 | Common Lisp | .lisp | 157 | 27.847134 | 86 | 0.617098 | ormf/cl-jack-transport | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 41c7f76e2a4b123459ac062d24d195bfb88c3e5c57a58134d468d53a396280ce | 42,332 | [
-1
] |
42,333 | jack.lisp | ormf_cl-jack-transport/jack.lisp | ;;; This file was automatically generated by SWIG (http://www.swig.org).
;;; Version 3.0.12
;;;
;;; Do not make changes to this file unless you know what you are doing--modify
;;; the SWIG interface file instead.
(in-package :jack-transport)
;;;SWIG wrapper code starts here
(cl:defmacro defanonenum (cl:&body enums)
... | 12,482 | Common Lisp | .lisp | 318 | 34.342767 | 98 | 0.678272 | ormf/cl-jack-transport | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | f05cd63506774db5e079f65bfb2e1d2ad97a5f69af58994eb7cf401b0127c9b7 | 42,333 | [
-1
] |
42,334 | jack-transport.lisp | ormf_cl-jack-transport/jack-transport.lisp | ;;;
;;; jack-transport.lisp
;;;
;;; **********************************************************************
;;; Copyright (c) 2022 Orm Finnendahl <orm.finnendahl@selma.hfmdk-frankfurt.de>
;;;
;;; Revision history: See git repository.
;;;
;;; This program is free software; you can redistribute it and/or
;;; modify it un... | 4,878 | Common Lisp | .lisp | 108 | 37.351852 | 103 | 0.625315 | ormf/cl-jack-transport | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | ac0fe115dc786757c3145ead6592cde4f3f13e88553de99d99517c157779bfa3 | 42,334 | [
-1
] |
42,335 | examples.lisp | ormf_cl-jack-transport/examples.lisp | ;;;
;;; examples.lisp
;;;
;;; **********************************************************************
;;; Copyright (c) 2023 Orm Finnendahl <orm.finnendahl@selma.hfmdk-frankfurt.de>
;;;
;;; Revision history: See git repository.
;;;
;;; This program is free software; you can redistribute it and/or
;;; modify it under th... | 2,448 | Common Lisp | .lisp | 64 | 35.875 | 79 | 0.6847 | ormf/cl-jack-transport | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 68d43b3c1dd0e4eb04ea00060ad204a1dccd9e0691622d407ede00bebe56a010 | 42,335 | [
-1
] |
42,336 | cl-jack-transport.asd | ormf_cl-jack-transport/cl-jack-transport.asd | ;;;; cl-jack-transport.asd
(asdf:defsystem #:cl-jack-transport
:description "cffi bindings for jack_transport"
:author "Orm Finnendahl <orm.finnendahl@selma.hfmdk-frankfurt.de>"
:license "gpl 2.0 or later"
:version "0.0.1"
:depends-on (#:cffi #:bordeaux-threads #:orm-utils)
:serial t
:components ((:file... | 505 | Common Lisp | .asd | 14 | 28.642857 | 68 | 0.593878 | ormf/cl-jack-transport | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 58626931dc37007faa2ada59dd93c41fb4e8899802e62a0b09dbc555308cd081 | 42,336 | [
-1
] |
42,360 | simple-test.lisp | m-e-leypold_cl-simple-test/simple-test.lisp | ;;; * -- (C) 2022 M E Leypold ------------------------------------------------------------*- common-lisp -*-|
;;;
;;; de.m-e-leypold.cl-simple.test -- a simple testing framework for common lisp.
;;; Copyright (C) 2022 M E Leypold
;;;
;;; This program is free software: you can redistribute it and/or modify
;;; ... | 15,038 | Common Lisp | .lisp | 329 | 40.696049 | 110 | 0.642275 | m-e-leypold/cl-simple-test | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 9d1171fcfc2a2454f71277ba752c76648f9af0388f35fa36f2d0c4e7c891f852 | 42,360 | [
-1
] |
42,361 | tests.lisp | m-e-leypold_cl-simple-test/tests.lisp | ;;; ------------------------------------------------------------------------*- common-lisp -*-|
;;;
;;; de.m-e-leypold.cl-simple-test -- a simple testing framework for common lisp.
;;; Copyright (C) 2022 M E Leypold
;;;
;;; This program is free software: you can redistribute it and/or modify
;;; it under the t... | 20,765 | Common Lisp | .lisp | 528 | 34.191288 | 110 | 0.630705 | m-e-leypold/cl-simple-test | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 4c659629210eeeab06c68378202fce73b19bc2fd36a4e4086885fd72e25a04aa | 42,361 | [
-1
] |
42,362 | load.lisp | m-e-leypold_cl-simple-test/load.lisp | ;;; ------------------------------------------------------------------------*- common-lisp -*-|
;;;
;;; de.m-e-leypold.cl-simple.test -- a simple testing framework for common lisp.
;;; Copyright (C) 2022 M E Leypold
;;;
;;; This program is free software: you can redistribute it and/or modify
;;; it under th... | 1,536 | Common Lisp | .lisp | 31 | 48.193548 | 110 | 0.608117 | m-e-leypold/cl-simple-test | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 9d031ca527de31a05e1a5fcdc0d93a329b4be6a54f525f2792c10b4bffcf3a25 | 42,362 | [
-1
] |
42,363 | test.lisp | m-e-leypold_cl-simple-test/test.lisp | ;;; ------------------------------------------------------------------------*- common-lisp -*-|
;;;
;;; de.m-e-leypold.cl-simple.test -- a simple testing framework for common lisp.
;;; Copyright (C) 2022 M E Leypold
;;;
;;; This program is free software: you can redistribute it and/or modify
;;; it under the t... | 2,210 | Common Lisp | .lisp | 43 | 49.930233 | 110 | 0.535466 | m-e-leypold/cl-simple-test | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 24bc902a2eb42e74b3a2eb4c415d6be3c0529cd831b5402121d612d364bc0ba8 | 42,363 | [
-1
] |
42,364 | de.m-e-leypold.cl-simple-test.asd | m-e-leypold_cl-simple-test/de.m-e-leypold.cl-simple-test.asd | ;;; ------------------------------------------------------------------------*- common-lisp -*-|
;;;
;;; de.m-e-leypold.cl-simple-test -- a simple testing framework for common lisp.
;;; Copyright (C) 2022 M E Leypold
;;;
;;; This program is free software: you can redistribute it and/or modify
;;; it under th... | 2,355 | Common Lisp | .asd | 49 | 45.122449 | 95 | 0.647955 | m-e-leypold/cl-simple-test | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | f91d1c4e91c607494d8f0860d9e736c1e31818e532a0af63b8a3812643da55d6 | 42,364 | [
-1
] |
42,369 | Makefile | m-e-leypold_cl-simple-test/Makefile | #
# de.m-e-leypold.cl-simple-test - Simple test framework
# Copyright (C) 2022 M E Leypold
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (a... | 3,445 | Common Lisp | .l | 92 | 35.23913 | 116 | 0.689655 | m-e-leypold/cl-simple-test | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 4ed403dc14c27e1ee18596634118b8c0e91ff1116ef9d262b4ff35f28fc34268 | 42,369 | [
-1
] |
42,388 | 9.lisp | sarab97_euler/9.lisp | (defun find_prod (sum)
(loop for a from 1 to (1- (truncate (/ sum 3)))
do (loop for b from (1+ a) to (1- (/ (- sum a) 2))
do (let ((c (- sum a b)))
(when (and (> c b) (= (* c c) (+ (* a a) (* b b))))
(return-from find_prod (* a b c)))))))
(find_prod 1000)
| 276 | Common Lisp | .lisp | 7 | 35.571429 | 57 | 0.473881 | sarab97/euler | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 289c8325a3c6473ea8b2d3194c5f03c5fbc1518bb317ae04b751746058bebcb1 | 42,388 | [
-1
] |
42,389 | 10.lisp | sarab97_euler/10.lisp | ;; The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
;; Find the sum of all the primes below two million.
(defun sieve (maximum)
(loop :with maxi = (ash (1- maximum) -1)
:with stop = (ash (isqrt maximum) -1)
:with sieve = (make-array (1+ maxi) :element-type 'bit :initial-element 0)
:for i :from 1 :to maxi
... | 622 | Common Lisp | .lisp | 16 | 35.875 | 76 | 0.621891 | sarab97/euler | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 4f1fe0f0008eab922ca4008ac0d922fff65247a50201bd50b01004c56d95f029 | 42,389 | [
-1
] |
42,390 | 8.lisp | sarab97_euler/8.lisp | ;; The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.
;; 73167176531330624919225119674426574742355349194934
;; 96983520312774506326239578318016984801869478851843
;; 85861560789112949495459501737958331952853208805511
;; 1254069874715852386305071569... | 2,738 | Common Lisp | .lisp | 31 | 86.645161 | 1,021 | 0.886456 | sarab97/euler | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 5bf52d70ac61e9a255ae0189806f00de702812e54fd0c61c20d46911e3937189 | 42,390 | [
-1
] |
42,391 | 6.lisp | sarab97_euler/6.lisp | ;; The sum of the squares of the first ten natural numbers is,
;; $$1^2 + 2^2 + ... + 10^2 = 385$$
;; The square of the sum of the first ten natural numbers is,
;; $$(1 + 2 + ... + 10)^2 = 55^2 = 3025$$
;; Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is ... | 640 | Common Lisp | .lisp | 14 | 43.785714 | 137 | 0.634461 | sarab97/euler | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 8c6f1efe3cb61dd98b42f90cb71da732f14cf25d8bf5a24eae6fd2e2ba47e5ad | 42,391 | [
-1
] |
42,392 | 5.lisp | sarab97_euler/5.lisp | ;; 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
;; What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
(defun get_gcd (x y)
(if (= y 0)
x
(get_gcd y (mod x y))))
(defun get_lcm (x y)
(/ (* x y) (get_g... | 406 | Common Lisp | .lisp | 10 | 38.2 | 109 | 0.683673 | sarab97/euler | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 51302b2bd2551c79c8204cb49d439b03ac2488051d3e0c8acf68af12b70e5838 | 42,392 | [
-1
] |
42,393 | 1.lisp | sarab97_euler/1.lisp | ;; If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
;; Find the sum of all the multiples of 3 or 5 below 1000.
(let ((sum 0))
(loop for a from 1 to 999
if (or (= (mod a 3) 0) (= (mod a 5) 0))
do (incf sum a)
)
(print sum)
)... | 340 | Common Lisp | .lisp | 10 | 31.2 | 132 | 0.638037 | sarab97/euler | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 34fbfadbe217ba31489cd1137f8854b49ad40cfc90ab0aae31273b522e454be5 | 42,393 | [
-1
] |
42,394 | 4.lisp | sarab97_euler/4.lisp | ;; A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
;; Find the largest palindrome made from the product of two 3-digit numbers.
(defun is-palindrome (n)
(let ((original n)
(reverse 0))
(loop while (> n 0)
do (setq reverse (... | 844 | Common Lisp | .lisp | 34 | 21.852941 | 137 | 0.628109 | sarab97/euler | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 0950d97f7e90683735946cc01f95405e972d99dab7d43774e79a6a51e077d49b | 42,394 | [
-1
] |
42,395 | 3.lisp | sarab97_euler/3.lisp | ;; The prime factors of 13195 are 5, 7, 13 and 29.
;; What is the largest prime factor of the number 600851475143 ?
(defun largest-prime-factor (n)
(let ((result 2))
(loop for i from 2 to (floor (sqrt n)) do
(when (zerop (mod n i))
(loop while (zerop (mod n i)) do (setf n (/ n i)))
(setf result i)))
(if... | 395 | Common Lisp | .lisp | 11 | 33.181818 | 64 | 0.656992 | sarab97/euler | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | c0e276451a43b1ce60e45eb30bd938791cded8d34595ec2d538ce90b1e5b2a7e | 42,395 | [
-1
] |
42,396 | 2.lisp | sarab97_euler/2.lisp | ;; Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
;; 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
;; By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
... | 522 | Common Lisp | .lisp | 16 | 30.25 | 143 | 0.649402 | sarab97/euler | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 0ec61ef0683832cb93d7016c6612e1309461c4725d82fcdc8701ff54d910c296 | 42,396 | [
-1
] |
42,397 | 7.lisp | sarab97_euler/7.lisp | ;; By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
;; What is the 10 001st prime number?
(defun is-prime (n)
(loop for i from 2 to (floor (/ n 2))
if (= (mod n i) 0)
do (return-from is-prime 0)
)
1)
(let ((c 2)
(p 3))
(loop
(loop while (= (is-prim... | 442 | Common Lisp | .lisp | 19 | 20.263158 | 103 | 0.582339 | sarab97/euler | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | a08481a00752ba7f1bbeaa349325d75f70a58058d54c0e7c7c3b6d5acfe266b2 | 42,397 | [
-1
] |
42,423 | jsonparse.lisp | lucabrini_unimib-json-parser/Lisp/jsonparse.lisp | ;;;; -*- Mode: Lisp -*-
;;;; Luca Brini 879459
(defun jsonparse (json-string)
(let ((json-char-list
(remove-whitespaces (str-to-chr-list json-string))))
(or (jsonparse-array json-char-list)
(jsonparse-object json-char-list)
(error "Error: invalid JSON string"))))
;;; JSONPARSE ARRAY
;;; This... | 18,816 | Common Lisp | .lisp | 421 | 40.266033 | 71 | 0.681674 | lucabrini/unimib-json-parser | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | cd9126008faf4e652e6d057de479afc52e8beb8e5c5ca657704c50f4d7d30f21 | 42,423 | [
-1
] |
42,425 | jsonreverse.pl | lucabrini_unimib-json-parser/Prolog/jsonreverse.pl | %%%% -*- Mode: Prolog -*-
%%%% Luca Brini 879459
% JSONReverse
% Handling case where object is a jsonobj
jsonreverse(jsonobj(Members), AtomString) :-
jsonreverse_members(Members, IntermediateString),
concat_atom(['{', IntermediateString, '}'], AtomString),
!.
% Handling case where object is a jsonarray
js... | 2,189 | Common Lisp | .l | 53 | 38.264151 | 68 | 0.730047 | lucabrini/unimib-json-parser | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 8716e0bba2fdbd65cb22ab7c87f35c732031f0a6decf509e8e6565f21b7be351 | 42,425 | [
-1
] |
42,426 | test.pl | lucabrini_unimib-json-parser/Prolog/test.pl | %%%% -*- Mode: Prolog -*-
%%%% Luca Brini 879459
:- [jsonparse].
test_obj_vuoto :- jsonparse('{}', jsonobj([])).
test_array_vuoto :- jsonparse('[]', jsonarray([])).
test_two_pair_std :-
jsonparse('{
"nome" : "Arthur",
"cognome" : "Dent"
}', jsonobj([
("nome", "Arthur"),
("cognome",... | 5,218 | Common Lisp | .l | 162 | 26.154321 | 77 | 0.541003 | lucabrini/unimib-json-parser | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 9ac28b9afd1d344875b2878c94ca4845ca1a3d919eda59ea2304bf47f2c4367a | 42,426 | [
-1
] |
42,427 | jsonaccess.pl | lucabrini_unimib-json-parser/Prolog/jsonaccess.pl | %%%% -*- Mode: Prolog -*-
%%%% Luca Brini 879459
% JSONACCESS with Fields list
% Base case for fields list : One field in the list
jsonaccess(JSONObj, [Field | []], Result) :-
jsonaccess(JSONObj, Field, Result), !.
% Recursive case for fields list: Two o More fields in the list
jsonaccess(JSONObj, [Field | MoreFi... | 1,260 | Common Lisp | .l | 28 | 42.5 | 79 | 0.711491 | lucabrini/unimib-json-parser | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 4fc6d4d11e2c15c498246238284d9df832383a5ee7d53aa84cf2b42b701e5525 | 42,427 | [
-1
] |
42,428 | jsonparse.pl | lucabrini_unimib-json-parser/Prolog/jsonparse.pl | %%%% -*- Mode: Prolog -*-
%%%% Luca Brini 879459
:- [jsonaccess].
:- [jsonreverse].
jsonparse(JSONString, Object) :-
atomic(JSONString),
atom_chars(JSONString, JSONStringList),
phrase(grammar(Object), JSONStringList).
grammar(jsonobj([])) --> ['{'], whitespace, ['}'], !.
grammar(jsonobj(Members)) -->
... | 3,547 | Common Lisp | .l | 122 | 25.319672 | 70 | 0.580418 | lucabrini/unimib-json-parser | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 2f19717d2b1f559894704112ae2bfb59f7c5a8b1859236b9bb044c39e122b2c3 | 42,428 | [
-1
] |
42,444 | serve.lisp | kasimirmoilanen_byte-temple/serve.lisp | (ql:quickload :hunchentoot)
(ql:quickload :spinneret)
; On a unix system, the root seems to be the user's home directory.
(defparameter *path* "./path/to/file-directory/")
(defparameter *server* (make-instance 'hunchentoot:easy-acceptor
:port 33333
... | 896 | Common Lisp | .lisp | 23 | 28.782609 | 74 | 0.550808 | kasimirmoilanen/byte-temple | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:15 AM (Europe/Amsterdam) | 0b300852464323827e16857dfc1ffee5576f98d2df87155ff587df2b5139a012 | 42,444 | [
-1
] |
42,461 | random-string.lisp | Carht_lisp-scripts/random-string.lisp | ;; Generate random string in CL
(defparameter *characters*
(concatenate 'string
"abcdefghijklmnopqrstuvwxyz"
"ABCDEFGHIJKLMNOPQRSTUVWXYZ"
"0123456789"))
(defparameter *nums* "0123456789")
(defun random-element (lst)
(aref lst (random (length lst))))
(defun random-string (length-character... | 875 | Common Lisp | .lisp | 25 | 30.6 | 60 | 0.697509 | Carht/lisp-scripts | 0 | 0 | 2 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | b8524bcd2dc952239034139434016d73166cb0679fab1784440e5d78ce41ee53 | 42,461 | [
-1
] |
42,462 | clean-files.lisp | Carht_lisp-scripts/clean-files.lisp | (ql:quickload '(:osicat :uiop :cl-fad))
(defun directory-p (filepath)
"Is a directory?"
(if (cl-fad:directory-exists-p filepath)
t
nil))
(defparameter *dir* nil
"Path of files in a directory")
(defmacro clean-file (filepath)
"Create a process-info object and call the command shred for the file."
... | 1,622 | Common Lisp | .lisp | 46 | 30.804348 | 91 | 0.673899 | Carht/lisp-scripts | 0 | 0 | 2 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 8f44369cf477180ffa1cfdf8f345d4f46310744475e2164f340487319cf952e2 | 42,462 | [
-1
] |
42,463 | postgresql-conn.lisp | Carht_lisp-scripts/postgresql-conn.lisp | (ql:quickload "postmodern")
(use-package :postmodern)
(connect-toplevel "databasename" "username" "userpass" "hostip" :port 5454)
(query "SELECT column_name, data_type FROM information_schema.columns WHERE table_name = 'users';")
| 232 | Common Lisp | .lisp | 4 | 56.5 | 99 | 0.769912 | Carht/lisp-scripts | 0 | 0 | 2 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 0ebc9a89fa9f61dd575806f331de5ba2ae7d63549111877671a85264e5371e4b | 42,463 | [
-1
] |
42,464 | list-big-files.lisp | Carht_lisp-scripts/list-big-files.lisp | (ql:quickload '(:osicat :uiop :cl-fad))
(defparameter *dir* nil
"All file paths")
(defun size-file (filepath)
"For some `filepath' return the size."
(let ((stat (osicat-posix:stat filepath)))
(osicat-posix:stat-size stat)))
(defun directory-p (filepath)
"Is a directory?"
(if (cl-fad:directory-exists-p ... | 1,188 | Common Lisp | .lisp | 34 | 31.294118 | 90 | 0.673345 | Carht/lisp-scripts | 0 | 0 | 2 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | fe8fbd798b9ca089be32d202cd3180dda5feaa6756e73ff65342e62c516401fb | 42,464 | [
-1
] |
42,485 | flake.lock | carjorvaz_learning-lisp/flake.lock | {
"nodes": {
"flake-utils": {
"locked": {
"lastModified": 1667395993,
"narHash": "sha256-nuEHfE/LcWyuSWnS8t12N1wc105Qtau+/OdUAjtQ0rA=",
"owner": "numtide",
"repo": "flake-utils",
"rev": "5aed5285a952e0b949eb3ba02c12fa4fcfef535f",
"type": "github"
},
... | 992 | Common Lisp | .l | 42 | 16.619048 | 73 | 0.505263 | carjorvaz/learning-lisp | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | fe42476a746ed8009bed2a2367595dcf75138c1fcb9efa0556a6ca78fb0fcb6f | 42,485 | [
-1
] |
42,486 | flake.nix | carjorvaz_learning-lisp/flake.nix | # Enter the dev shell with: nix develop
{
inputs = {
nixpkgs.url = "github:nixos/nixpkgs";
flake-utils.url = "github:numtide/flake-utils";
};
outputs = { self, nixpkgs, flake-utils }:
flake-utils.lib.eachDefaultSystem (system:
let pkgs = nixpkgs.legacyPackages.${system};
in {
dev... | 441 | Common Lisp | .l | 15 | 24.133333 | 74 | 0.634434 | carjorvaz/learning-lisp | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 52be2a306a1363512a44548d0ef933abdffab75ded0c9889d267c495f2db9d20 | 42,486 | [
-1
] |
42,533 | enc-cp437.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/babel-20200925-git/src/enc-cp437.lisp | ;;;; -*- Mode: lisp; indent-tabs-mode: nil -*-
;;;
;;; enc-cp437.lisp --- Implementation of the IBM Code Page 437
;;;
;;; Copyright (C) 2020, Nicolas Hafner <shinmera@tymoon.eu>
;;;
;;; Permission is hereby granted, free of charge, to any person
;;; obtaining a copy of this software and associated documentation
;;; fi... | 6,563 | Common Lisp | .lisp | 202 | 25.188119 | 70 | 0.552549 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 8ee205b3b00cd225923ed17634e06e001d5da0165ed262058d65d1c19de6bc60 | 42,533 | [
428343
] |
42,537 | streams.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/babel-20200925-git/src/streams.lisp | ;;;; -*- Mode: lisp; indent-tabs-mode: nil -*-
;;;
;;; streams.lisp --- Conversions between strings and UB8 vectors.
;;;
;;; Copyright (c) 2005-2007, Dr. Edmund Weitz. All rights reserved.
;;; Copyright (c) 2008, Attila Lendvai. All rights reserved.
;;;
;;; Redistribution and use in source and binary forms, with or wit... | 18,470 | Common Lisp | .lisp | 391 | 40.01023 | 97 | 0.674097 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | c1aae9eb9fbbdaa998c8963cdbe457e719459591be2fc45c34f3e4ad370d19b0 | 42,537 | [
454181
] |
42,541 | tests.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/babel-20200925-git/tests/tests.lisp | ;;;; -*- Mode: lisp; indent-tabs-mode: nil -*-
;;;
;;; tests.lisp --- Unit and regression tests for Babel.
;;;
;;; Copyright (C) 2007-2009, Luis Oliveira <loliveira@common-lisp.net>
;;;
;;; Permission is hereby granted, free of charge, to any person
;;; obtaining a copy of this software and associated documentation
;;... | 44,012 | Common Lisp | .lisp | 806 | 46.926799 | 132 | 0.630905 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 5f318b167d6ffa5d39606706720a2ed37af9f57c57617fda301d99e7a461ee16 | 42,541 | [
177769
] |
42,545 | encoding.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/drakma-v2.0.9/encoding.lisp | ;;; -*- Mode: LISP; Syntax: COMMON-LISP; Package: DRAKMA; Base: 10 -*-
;;; $Header: /usr/local/cvsrep/drakma/read.lisp,v 1.17 2008/05/25 11:35:20 edi Exp $
;;; Copyright (c) 2006-2012, Dr. Edmund Weitz. All rights reserved.
;;; Redistribution and use in source and binary forms, with or without
;;; modification, are ... | 5,090 | Common Lisp | .lisp | 90 | 51.7 | 100 | 0.734497 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 049f9b7141aa1f7c6b361bdbe2b8be2c0a421052298bb1ed92d0ab43cd298fab | 42,545 | [
108278,
128803
] |
42,546 | util.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/drakma-v2.0.9/util.lisp | ;;; -*- Mode: LISP; Syntax: COMMON-LISP; Package: DRAKMA; Base: 10 -*-
;;; $Header: /usr/local/cvsrep/drakma/util.lisp,v 1.36 2008/05/30 11:30:45 edi Exp $
;;; Copyright (c) 2006-2012, Dr. Edmund Weitz. All rights reserved.
;;; Redistribution and use in source and binary forms, with or without
;;; modification, are ... | 16,298 | Common Lisp | .lisp | 320 | 42.328125 | 120 | 0.63219 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 3a55e70e0c29d94dfa3d8cf64f98acacb92aa439d76c5ae9220487e679bb28e6 | 42,546 | [
314232
] |
42,547 | specials.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/drakma-v2.0.9/specials.lisp | ;;; -*- Mode: LISP; Syntax: COMMON-LISP; Package: DRAKMA; Base: 10 -*-
;;; $Header: /usr/local/cvsrep/drakma/specials.lisp,v 1.19 2008/01/14 01:57:02 edi Exp $
;;; Copyright (c) 2006-2012, Dr. Edmund Weitz. All rights reserved.
;;; Redistribution and use in source and binary forms, with or without
;;; modification, ... | 9,775 | Common Lisp | .lisp | 244 | 34.270492 | 107 | 0.63735 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 11a852dcaf441405b83893110cfecfbbeeb4e241eb89ef7b5ad45f4bd9662959 | 42,547 | [
217392,
470223
] |
42,548 | read.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/drakma-v2.0.9/read.lisp | ;;; -*- Mode: LISP; Syntax: COMMON-LISP; Package: DRAKMA; Base: 10 -*-
;;; $Header: /usr/local/cvsrep/drakma/read.lisp,v 1.17 2008/05/25 11:35:20 edi Exp $
;;; Copyright (c) 2006-2012, Dr. Edmund Weitz. All rights reserved.
;;; Redistribution and use in source and binary forms, with or without
;;; modification, are ... | 6,213 | Common Lisp | .lisp | 110 | 48.209091 | 91 | 0.659826 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | cc2d69b8aeed7eb5493c01a1000ca87a6c74450090773e447093fe600e0c48f5 | 42,548 | [
108600,
280803
] |
42,549 | conditions.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/drakma-v2.0.9/conditions.lisp | ;;; -*- Mode: LISP; Syntax: COMMON-LISP; Package: ODD-STREAMS; Base: 10 -*-
;;; $Header: /usr/local/cvsrep/odd-streams/conditions.lisp,v 1.5 2007/12/31 01:08:45 edi Exp $
;;; Copyright (c) 2008-2012, Dr. Edmund Weitz. All rights reserved.
;;; Redistribution and use in source and binary forms, with or without
;;; mod... | 4,539 | Common Lisp | .lisp | 89 | 47.685393 | 94 | 0.758465 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 50a8ca227589b747269fdbfa4aff8217662aa7f566418b883cacefc8f4a68325 | 42,549 | [
193980,
420892
] |
42,550 | cookies.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/drakma-v2.0.9/cookies.lisp | ;;; -*- Mode: LISP; Syntax: COMMON-LISP; Package: DRAKMA; Base: 10 -*-
;;; $Header: /usr/local/cvsrep/drakma/cookies.lisp,v 1.15 2008/01/14 01:57:01 edi Exp $
;;; Copyright (c) 2006-2012, Dr. Edmund Weitz. All rights reserved.
;;; Redistribution and use in source and binary forms, with or without
;;; modification, a... | 15,585 | Common Lisp | .lisp | 301 | 43.76412 | 108 | 0.655335 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 4392696e255eddd2b8ef6e7dc4f227a07e3ab28579ed8daa9062839a5765c473 | 42,550 | [
124072,
368586
] |
42,551 | packages.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/drakma-v2.0.9/packages.lisp | ;;; -*- Mode: LISP; Syntax: COMMON-LISP; Package: CL-USER; Base: 10 -*-
;;; $Header: /usr/local/cvsrep/drakma/packages.lisp,v 1.22 2008/01/14 01:57:01 edi Exp $
;;; Copyright (c) 2006-2012, Dr. Edmund Weitz. All rights reserved.
;;; Redistribution and use in source and binary forms, with or without
;;; modification,... | 2,923 | Common Lisp | .lisp | 68 | 35.455882 | 88 | 0.642907 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | c05010b941d2f0310df7ae6b8d19ff92bb5a692c67f9e89a049d72f7e922c6c8 | 42,551 | [
57190,
296191
] |
42,552 | drakma-test.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/drakma-v2.0.9/test/drakma-test.lisp | ;;; -*- Mode: LISP; Syntax: COMMON-LISP; Package: CL-USER; Base: 10 -*-
;;; Copyright (c) 2013, Anton Vodonosov. All rights reserved.
;;; Redistribution and use in source and binary forms, with or without
;;; modification, are permitted provided that the following conditions
;;; are met:
;;; * Redistributions of ... | 6,175 | Common Lisp | .lisp | 124 | 44.806452 | 97 | 0.677173 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 54b503866449fa60cd3934a0f1300b7be0ab97520be88c88649ce4f6418522ed | 42,552 | [
327231
] |
42,553 | trivial-garbage.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/trivial-garbage-20211230-git/trivial-garbage.lisp | ;;;; -*- Mode: LISP; Syntax: ANSI-Common-lisp; Base: 10 -*-
;;;; The above modeline is required for Genera. Do not change.
;;
;;; trivial-garbage.lisp --- Trivial Garbage!
;;;
;;; This software is placed in the public domain by Luis Oliveira
;;; <loliveira@common-lisp.net> and is provided with absolutely no
;;; warrant... | 18,753 | Common Lisp | .lisp | 434 | 37.119816 | 105 | 0.668582 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 71223f0c6cb5b63a89b27485a8a42f65bb89e460bb6f968a4cbb8425757a2651 | 42,553 | [
-1
] |
42,554 | tests.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/trivial-garbage-20211230-git/tests.lisp | ;;;; -*- Mode: LISP; Syntax: ANSI-Common-lisp; Base: 10 -*-
;;;; The above modeline is required for Genera. Do not change.
;;;
;;; tests.lisp --- trivial-garbage tests.
;;;
;;; This software is placed in the public domain by Luis Oliveira
;;; <loliveira@common-lisp.net> and is provided with absolutely no
;;; warranty.
... | 4,381 | Common Lisp | .lisp | 128 | 29.648438 | 69 | 0.659489 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 6739c6b86ced91ad842cd2d9b9fd2746af7aebbf82a1a339c22e3d20cec5a74a | 42,554 | [
-1
] |
42,555 | release.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/trivial-garbage-20211230-git/release.lisp | #!/usr/bin/env clisp
;;;; -*- Mode: lisp; indent-tabs-mode: nil -*-
(defpackage :release-script (:use #:cl #:regexp))
(in-package :release-script)
;;;; Configuration ------------------------------------------------------------
(defparameter *project-name* "trivial-garbage")
(defparameter *asdf-file* (format nil "~A.... | 9,875 | Common Lisp | .lisp | 212 | 37.834906 | 86 | 0.578078 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 04a80929cf156b24167540519b28e211490ebac922b286bb6a5bfc0c531864fd | 42,555 | [
228841
] |
42,556 | gendocs.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/trivial-garbage-20211230-git/gendocs.lisp | (in-package :cl-user)
(asdf:load-system :atdoc)
(asdf:load-system :trivial-garbage)
(let* ((base (asdf:component-pathname (asdf:find-system :trivial-garbage)))
(output-directory (merge-pathnames "doc/" base))
(css-file (merge-pathnames "doc/index.css" base)))
(ensure-directories-exist output-directory... | 672 | Common Lisp | .lisp | 13 | 34.923077 | 75 | 0.537291 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | de8ce40cbd2df992da7071c17b5055d32ab95626203e30322b09f77f309034e6 | 42,556 | [
87919,
452885
] |
42,557 | package.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/alexandria-20220707-git/alexandria-1/package.lisp | (defpackage :alexandria
(:nicknames :alexandria.1.0.0 :alexandria-1)
(:use :cl)
#+sb-package-locks
(:lock t)
(:export
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; BLESSED
;;
;; Binding constructs
#:if-let
#:when-let
#:when-let*
;;;;;;;;;;;;;;;;;;;;;;;;;;;... | 5,238 | Common Lisp | .lisp | 243 | 17.588477 | 80 | 0.636036 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 62905e8f78fb57842b7b2c5da48034b060d63adcf38d7e57f349bffbdc8144cf | 42,557 | [
-1
] |
42,559 | io.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/alexandria-20220707-git/alexandria-1/io.lisp | ;; Copyright (c) 2002-2006, Edward Marco Baringer
;; All rights reserved.
(in-package :alexandria)
(defmacro with-open-file* ((stream filespec &key direction element-type
if-exists if-does-not-exist external-format)
&body body)
"Just like WITH-OPEN-FILE,... | 8,840 | Common Lisp | .lisp | 167 | 40 | 87 | 0.589859 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 1a7e1c813eb5876e743659b1ed6af403b01e1e7577126d12779a4c81ace8f072 | 42,559 | [
-1
] |
42,562 | sequences.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/alexandria-20220707-git/alexandria-1/sequences.lisp | (in-package :alexandria)
;; Make these inlinable by declaiming them INLINE here and some of them
;; NOTINLINE at the end of the file. Exclude functions that have a compiler
;; macro, because NOTINLINE is required to prevent compiler-macro expansion.
(declaim (inline copy-sequence sequence-of-length-p))
(defun sequenc... | 25,124 | Common Lisp | .lisp | 526 | 35.591255 | 100 | 0.57443 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 98322e42cdb7bba1c612669c6451862d41de5705cbc843b6e9b4651c4e091493 | 42,562 | [
-1
] |
42,563 | tests.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/alexandria-20220707-git/alexandria-1/tests.lisp | (in-package :cl-user)
(defpackage :alexandria/tests
(:use :cl :alexandria #+sbcl :sb-rt #-sbcl :rtest)
(:import-from #+sbcl :sb-rt #-sbcl :rtest
#:*compile-tests* #:*expected-failures*))
(in-package :alexandria/tests)
(defun run-tests (&key ((:compiled *compile-tests*)))
(do-tests))
(defun has... | 55,346 | Common Lisp | .lisp | 1,825 | 21.511233 | 231 | 0.500986 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 16e9990985f78e827885f7af0d3265110f46907a19a4f8537b40a3cdd729e80f | 42,563 | [
-1
] |
42,564 | control-flow.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/alexandria-20220707-git/alexandria-1/control-flow.lisp | (in-package :alexandria)
(defun extract-function-name (spec)
"Useful for macros that want to mimic the functional interface for functions
like #'eq and 'eq."
(if (and (consp spec)
(member (first spec) '(quote function)))
(second spec)
spec))
(defun generate-switch-body (whole object clauses... | 5,220 | Common Lisp | .lisp | 103 | 38.864078 | 107 | 0.587706 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | a994b1a96e17501d63b21f1ed32163b3d0c3c7581b4f5c4e4f6a98d3afc8dc07 | 42,564 | [
-1
] |
42,566 | numbers.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/alexandria-20220707-git/alexandria-1/numbers.lisp | (in-package :alexandria)
(declaim (inline clamp))
(defun clamp (number min max)
"Clamps the NUMBER into [min, max] range. Returns MIN if NUMBER is lesser then
MIN and MAX if NUMBER is greater then MAX, otherwise returns NUMBER."
(if (< number min)
min
(if (> number max)
max
number))... | 11,218 | Common Lisp | .lisp | 265 | 34.245283 | 83 | 0.580976 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 41cd9c7305cb931cce95eef81348022d963a4bdde3008fc8df7d26de76451c52 | 42,566 | [
203646
] |
42,567 | hash-tables.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/alexandria-20220707-git/alexandria-1/hash-tables.lisp | (in-package :alexandria)
(defmacro ensure-gethash (key hash-table &optional default)
"Like GETHASH, but if KEY is not found in the HASH-TABLE saves the DEFAULT
under key before returning it. Secondary return value is true if key was
already in the table."
(once-only (key hash-table)
(with-unique-names (value p... | 3,755 | Common Lisp | .lisp | 90 | 34.977778 | 83 | 0.657362 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 5956e0659b6e40081df02111e6f3450bc087bc0cb75ed501c2f3897adc59ee21 | 42,567 | [
191494
] |
42,569 | functions.lisp | NailykSturm_Info805-TP/src/Import/quicklisp/dists/quicklisp/software/alexandria-20220707-git/alexandria-1/functions.lisp | (in-package :alexandria)
;;; To propagate return type and allow the compiler to eliminate the IF when
;;; it is known if the argument is function or not.
(declaim (inline ensure-function))
(declaim (ftype (function (t) (values function &optional))
ensure-function))
(defun ensure-function (function-des... | 6,645 | Common Lisp | .lisp | 143 | 41.041958 | 78 | 0.687384 | NailykSturm/Info805-TP | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:51:23 AM (Europe/Amsterdam) | 05fc9a92246d8a1340c97e7006e37e07694a49a4a924dac8fc9785c07a734917 | 42,569 | [
394939
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.