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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
28,686 | search.lsp | shlomif_Kevin-Atkinson-AI-Freecell-Solver-in-Lisp/code/search.lsp | ;; search.lsp - the actual code to play a game.
;; Copyright (C) 2001 by Kevin Atkinson <kevin_fc@atkinson.dhs.org>
;;
;; This program is free software; you can redistribute it and/or
;; modify it under the terms of the GNU General Public License,
;; version 2, as published by the Free Software Foundation.
;;
;; This p... | 6,083 | Common Lisp | .l | 181 | 28.044199 | 79 | 0.615438 | shlomif/Kevin-Atkinson-AI-Freecell-Solver-in-Lisp | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:36:04 AM (Europe/Amsterdam) | 57226aeaa355c25b14d15fdbc6bac1f224b191f41fc2c4f2a37514f707b32584 | 28,686 | [
-1
] |
28,687 | card.lsp | shlomif_Kevin-Atkinson-AI-Freecell-Solver-in-Lisp/code/card.lsp | ;; card.lsp -
;; Copyright (C) 2001 by Kevin Atkinson <kevin_fc@atkinson.dhs.org>
;;
;; 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 2 of the License, or
;; (at your option) an... | 6,249 | Common Lisp | .l | 196 | 27.857143 | 72 | 0.625706 | shlomif/Kevin-Atkinson-AI-Freecell-Solver-in-Lisp | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:36:04 AM (Europe/Amsterdam) | a3c1bd8b7ff228ee2e456feb5e3e85abd5947062403a481a46f9c99a75ab4bfb | 28,687 | [
-1
] |
28,688 | util.lsp | shlomif_Kevin-Atkinson-AI-Freecell-Solver-in-Lisp/code/util.lsp | ;; util.lsp - various utility functions
;; Copyright (C) 2001 by Kevin Atkinson <kevin_fc@atkinson.dhs.org>
;;
;; This program is free software; you can redistribute it and/or
;; modify it under the terms of the GNU General Public License,
;; version 2, as published by the Free Software Foundation.
;;
;; This program i... | 4,315 | Common Lisp | .l | 113 | 34.212389 | 78 | 0.665233 | shlomif/Kevin-Atkinson-AI-Freecell-Solver-in-Lisp | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:36:04 AM (Europe/Amsterdam) | d2f03067223bbcec875b042ec240039094b5e9a3814c1a361576b670c56f8995 | 28,688 | [
-1
] |
28,709 | package.lisp | wvxvw_agraph-client/src/openrdf/vocabulary/package.lisp | (in-package :cl)
(defpackage :openrdf.vocabulary (:use :cl :openrdf.model)
(:export :+ns+
:+duration+
:+datetime+
:time+
:+date+
:+gyearmonth+
:+gyear+
:+gmonthd... | 1,589 | Common Lisp | .lisp | 48 | 12.166667 | 57 | 0.268657 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 8a27eae4ad4818ea8b9718c58cfdd0c4f198a56662df54e5f0d2bc1136c79e0c | 28,709 | [
-1
] |
28,710 | xmlschema.lisp | wvxvw_agraph-client/src/openrdf/vocabulary/xmlschema.lisp | (in-package :openrdf.vocabulary)
(defparameter +ns+ "http://www.w3.org/2001/XMLSchema#")
(defparameter +duration+ (make-instance 'uri :namespace +ns+ :localname "duration"))
(defparameter +datetime+ (make-instance 'uri :namespace +ns+ :localname "dateTime"))
(defparameter time+ (make-instance 'uri :namespace +ns+ :loc... | 3,917 | Common Lisp | .lisp | 47 | 82.319149 | 106 | 0.745412 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | e5de40fff946f1b819f567d4462f57e67169f9f551d150073efb74aa12b2d782 | 28,710 | [
-1
] |
28,711 | queryresult.lisp | wvxvw_agraph-client/src/openrdf/query/queryresult.lisp | ;; -*- coding: utf-8 -*-
(in-package :openrdf.query)
(defstruct binding name value)
(defclass query-result () ())
(defclass graph-query-result (query-result repository-result) ())
;; TODO: This is begging to implement some container interface
(defclass tuple-query-result (query-result)
((variable-names :accessor... | 4,530 | Common Lisp | .lisp | 89 | 45.202247 | 83 | 0.697252 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | b77d81a95213aa94e68708da6c7ef47373ee88ce22ccdc6f778ba442565fc861 | 28,711 | [
-1
] |
28,712 | dataset.lisp | wvxvw_agraph-client/src/openrdf/query/dataset.lisp | ;; -*- coding: utf-8 -*-
(in-package :openrdf.query)
(defparameter all-contexts "ALL_CONTEXTS")
(defclass dataset ()
((contexts :initform nil :initarg :contexts :accessor dataset-contexts)
(default-graphs :initform (make-instance 'cl-containers:set-container)
:accessor dataset-default-graphs)
(named-gra... | 3,589 | Common Lisp | .lisp | 80 | 37.425 | 73 | 0.649785 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 2cd5c48051c8467f90baa1e7f46de95c5b7c8dc56a74c5a49a2f385010abd97a | 28,712 | [
-1
] |
28,713 | query.lisp | wvxvw_agraph-client/src/openrdf/query/query.lisp | ;; -*- coding: utf-8 -*-
(in-package :openrdf.query)
(defclass query-language ()
((registered-languages :initform nil
:accessor query-language-registered-languages :allocation :class)
(sparql :initform nil :accessor query-language-sparql :allocation :class)
(prolog :initform nil :accessor query-lang... | 6,653 | Common Lisp | .lisp | 134 | 39.052239 | 92 | 0.623634 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | b2ec5e60821864aaf10c84cedbfcd740145babfb96dbd22bbd0511b7579612dc | 28,713 | [
-1
] |
28,714 | package.lisp | wvxvw_agraph-client/src/openrdf/util/package.lisp | (in-package :cl)
(defpackage :openrdf.utils (:use :cl :iterate :cl-ppcre)
(:export :encode-ntriple-string
:local-name-index
:ensure-uri-string
:local-name
:namespace
:parse-uriref
:parse-nodeid
:parse-literal
:ensure-array))
| 315 | Common Lisp | .lisp | 11 | 19.454545 | 56 | 0.555921 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 0101a80cd827fd03f23fe1ac43bebaa9f1f731f1f684e8bf9f3e4e2889bc5db9 | 28,714 | [
-1
] |
28,715 | utils.lisp | wvxvw_agraph-client/src/openrdf/util/utils.lisp | ;; -*- coding: utf-8 -*-
(in-package :openrdf.utils)
(defun encode-ntriple-string (string)
(with-output-to-string (stream)
(iter
(for c :in-string string)
(princ
(case c
(#\Tab "\\t")
(#\Rubout "\\r")
(#\Newline "\\n")
(#\Space " ")
(#\" "\\\"")
(... | 2,187 | Common Lisp | .lisp | 59 | 31.271186 | 98 | 0.561702 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | b3ba5d78912b17cc33c4bb425aaaccec6250ed5456743be5dbf76dbcdff39c6e | 28,715 | [
-1
] |
28,716 | package.lisp | wvxvw_agraph-client/src/openrdf/model/package.lisp | (in-package :cl)
(defpackage :openrdf.model (:use :cl :local-time :iterate)
(:export :value
:resource
:uri
:bnode
:namespace
:ntriples
:value=
:get-uri
... | 418 | Common Lisp | .lisp | 13 | 14.076923 | 58 | 0.348148 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 02697638e39d8da63d861337e141322c3f7a4b25d99b22a9939b7e91fcbcdbf0 | 28,716 | [
-1
] |
28,717 | value.lisp | wvxvw_agraph-client/src/openrdf/model/value.lisp | ;; -*- coding: utf-8 -*-
(in-package :openrdf.model)
(defclass value () ())
(defclass resource (value) ())
;; All this string parsing nonsense looks bad, why not have
;; a uri struct to encode all parts?
(defclass uri (resource)
((value :initform nil :initarg :value
:accessor uri-value :type (or null st... | 2,487 | Common Lisp | .lisp | 53 | 43.396226 | 82 | 0.685691 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 700bc71335bae9a7c6fde45e8378b942892aa2f063fb0a7a8ac35b84cc560191 | 28,717 | [
-1
] |
28,718 | literal.lisp | wvxvw_agraph-client/src/openrdf/model/literal.lisp | ;; -*- coding: utf-8 -*-
(in-package :openrdf.model)
;; This is ugly, maybe there's some way to sidestep this with `eval-when'
(defun voc (symbol)
(symbol-value (find-symbol symbol :openrdf.vocabulary)))
(defun voc-uri (symbol)
(uri-value (symbol-value (find-symbol symbol :openrdf.vocabulary))))
(defun datatype... | 5,413 | Common Lisp | .lisp | 105 | 47.057143 | 82 | 0.693503 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | cc3d50facee975c044141e84037ad2e1444c4c90f84d81ebb359aefe42c93826 | 28,718 | [
-1
] |
28,719 | statement.lisp | wvxvw_agraph-client/src/openrdf/model/statement.lisp | ;; -*- coding: utf-8 -*-
(in-package :openrdf.model)
(defclass statement ()
((subject :initarg :subject :accessor statement-subject)
(predicate :initarg :predicate :accessor statement-predicate)
(object :initarg :object :accessor statement-object)
(context :initarg :context :accessor statement-context)
... | 2,954 | Common Lisp | .lisp | 63 | 42.111111 | 78 | 0.70713 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | f00682ccc3251a267e716a0a610b8bb8ab4052911b292278986863c552385ae5 | 28,719 | [
-1
] |
28,720 | valuefactory.lisp | wvxvw_agraph-client/src/openrdf/model/valuefactory.lisp | ;; -*- coding: utf-8 -*-
(in-package :openrdf.model)
;; this is that rare case, which calls for funcallable object
;; but let us not decide hastily, maybe we don't need this at all.
(defclass value-factory ()
((blank-node-amount :initform 10 :initarg :blank-node-amount
:accessor value-factory-blank-node-a... | 2,993 | Common Lisp | .lisp | 58 | 46.465517 | 83 | 0.71238 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 46b7f0e8b7f6d3f79dd49b5dbaee4539f40f567d8f5755d3a3331aa0df3177c9 | 28,720 | [
-1
] |
28,721 | test-client.lisp | wvxvw_agraph-client/tests/test-client.lisp | (in-package :agraph-client.test)
(in-suite :agraph-client.test)
(def-suite test-suite
:description "Minimal testing suite for agraph-client project.")
(defparameter *test-board*
(make-array
'(9 9)
:initial-contents
'((0 0 0 1 0 5 0 6 8)
(0 0 0 0 0 0 7 0 1)
(9 0 1 0 0 0 0 3 0)
(0 0 7 0 2... | 767 | Common Lisp | .lisp | 28 | 22.5 | 68 | 0.568707 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | de82e18cfd7ea74ed2cfb81d73f2c4c6be6ec4f490067dc0322ac3d1cc1b33fb | 28,721 | [
-1
] |
28,722 | suite.lisp | wvxvw_agraph-client/tests/suite.lisp | (in-package :agraph-client.test)
(eval-when (:compile-toplevel :load-toplevel :execute)
(unless (get-test :agraph-client)
(def-suite :agraph-client)))
(def-suite :agraph-client.test :in :agraph-client)
| 210 | Common Lisp | .lisp | 5 | 39.4 | 54 | 0.738916 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 3e8db3a9451329751dadf60f2fc51f5cc29070de6fdd2163ef7473fed702d1b7 | 28,722 | [
-1
] |
28,723 | agraph-client.asd | wvxvw_agraph-client/agraph-client.asd | (in-package :cl)
(defpackage agraph-client-asd (:use :cl :asdf))
(in-package :agraph-client-asd)
(defsystem agraph-client
:version "0.1"
:author "Oleg Sivokon <olegsivokon@gmail.com>,
derived from Python source written by Franz Inc.
<http://www.franz.com/agraph/allegrograph/>"
:license "EPL... | 2,979 | Common Lisp | .asd | 67 | 29.432836 | 77 | 0.489691 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 04552517956b431ee8072751eca006da886a15bc8dc280c82f9a709d1b1f75fb | 28,723 | [
-1
] |
28,728 | python-blankNodes3.rdf | wvxvw_agraph-client/tutorial/python-blankNodes3.rdf | <?xml version='1.0' encoding='ISO-8859-1'?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:dc = "http://purl.org/dc/elements/1.1/"
xmlns:foaf = "http://xmlns.com/foaf/0.1/">
<!-- Example 3: Two books, plus separate URI-identified Author. Show no duplicates. -->
<rdf:Description rdf:ab... | 834 | Common Lisp | .l | 17 | 45.352941 | 88 | 0.696406 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 88089f35414772a89098efdf19b65f836b5ce6bb795a97047443f9beae15ba1a | 28,728 | [
-1
] |
28,729 | python-kennedy.ntriples | wvxvw_agraph-client/tutorial/python-kennedy.ntriples | <http://www.franz.com/simple#person1> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.franz.com/simple#person> .
<http://www.franz.com/simple#person1> <http://www.franz.com/simple#first-name> "Joseph" .
<http://www.franz.com/simple#person1> <http://www.franz.com/simple#middle-initial> "Patrick" .
<http://... | 127,981 | Common Lisp | .l | 1,214 | 104.420923 | 137 | 0.724384 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | c2e5bf86546ac20e8ea347d7249579c121d8b703d7b3725b7eb9ad995d50f3ae | 28,729 | [
-1
] |
28,730 | python-lesmis.rdf | wvxvw_agraph-client/tutorial/python-lesmis.rdf | <?xml version='1.0' encoding='ISO-8859-1'?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:rdfs = "http://www.w3.org/2000/01/rdf-schema#"
xmlns:dc = "http://purl.org/dc/elements/1.1/"
xmlns:dcterms = "http://purl.org/dc/terms/"
xmlns:char = "http://www.franz.com/lesmis#">
<... | 61,219 | Common Lisp | .l | 1,254 | 45.660287 | 79 | 0.742234 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 3b10c58b10301556899c5c7c6b4011479c2fc4b0e328aa8d40bbad1bf420a63a | 28,730 | [
-1
] |
28,731 | python-blankNodes4.rdf | wvxvw_agraph-client/tutorial/python-blankNodes4.rdf | <?xml version='1.0' encoding='ISO-8859-1'?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:dc = "http://purl.org/dc/elements/1.1/"
xmlns:foaf = "http://xmlns.com/foaf/0.1/">
<!-- Example 2: Two books, use literal Author name, show no duplicates. -->
<rdf:Description rdf:about="http://w... | 641 | Common Lisp | .l | 14 | 42.142857 | 75 | 0.687702 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 10592b748361c09f83f0f16a3cb9b77c932e51d554e44695f366dd87377c17a8 | 28,731 | [
-1
] |
28,732 | python-tutorial-40.html | wvxvw_agraph-client/tutorial/python-tutorial-40.html | <html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1" >
<title>Python API Tutorial for AllegroGraph 4.2</title>
<style type="text/css">
.input { margin-left:4em; background-color:#ADDFFF;}
.output { margin-left:4em; background-color:#F1F1F1;}
.returnlink {font-size:small; font-w... | 243,984 | Common Lisp | .l | 2,046 | 116.835288 | 1,001 | 0.729918 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 199c9ac78588df20eeffee24dc121288b4388ac2be6774d639099b7fe98ed761 | 28,732 | [
-1
] |
28,733 | python-blankNodes2.rdf | wvxvw_agraph-client/tutorial/python-blankNodes2.rdf | <?xml version='1.0' encoding='ISO-8859-1'?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:dc = "http://purl.org/dc/elements/1.1/"
xmlns:foaf = "http://xmlns.com/foaf/0.1/">
<!-- Example 1: Two books, same author, anonymous nodes, show duplicate triples. -->
<rdf:Description rdf:about="... | 827 | Common Lisp | .l | 22 | 33.363636 | 84 | 0.664573 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 8329f2790f3c7dc8a2fd3bcc46ee6b7da0b6da5f3f4983bc64d42ac12a95107a | 28,733 | [
-1
] |
28,734 | python-blankNodes1.rdf | wvxvw_agraph-client/tutorial/python-blankNodes1.rdf | <?xml version='1.0' encoding='ISO-8859-1'?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:dc = "http://purl.org/dc/elements/1.1/"
xmlns:foaf = "http://xmlns.com/foaf/0.1/">
<!-- Example 1: Two books, same author, anonymous nodes, show duplicate triples. -->
<rdf:Description rdf:about="... | 719 | Common Lisp | .l | 18 | 36.222222 | 84 | 0.677746 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | a4ac944fad92cd14e74b5499d950a060772a88a1e29111ed9b0e6fa5f1d60fde | 28,734 | [
-1
] |
28,735 | python-rules.txt | wvxvw_agraph-client/tutorial/python-rules.txt | ;; Prolog rules that define relative relations
;; Assumes that the prefix 'rltv' is bound to a namespace
;; of your choice
(<-- (string-concat ?result ?string1 ?string2 ?string3)
(lisp ?result (string+ ?string1 ?string2 ?string3)))
(<-- (name ?person ?first ?last)
(q ?person !rltv:first-name ?first)
(q... | 2,424 | Common Lisp | .l | 85 | 24.188235 | 61 | 0.556134 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 83fa03c281de7089218774393781f9d898617247c2fb9dbb1d09c9129085be3c | 28,735 | [
-1
] |
28,736 | python-API-40.html | wvxvw_agraph-client/tutorial/python-API-40.html | <html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1" >
<title>Python API Tutorial for AllegroGraph 4.2</title>
<style type="text/css">
.input { margin-left:4em; background-color:#ADDFFF;}
.output { margin-left:4em; background-color:#F1F1F1;}
.returnlink {font-size:small; font-w... | 56,197 | Common Lisp | .l | 777 | 68.207207 | 725 | 0.720555 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 97a64b0782a871d66dfc652470b5c0a5cf23046430e9529bbdb0c3d0f384d619 | 28,736 | [
-1
] |
28,739 | relative_rules.txt | wvxvw_agraph-client/src/openrdf/tests/relative_rules.txt | ;; Prolog rules that define relative relations
;; Assumes that the prefix 'rltv' is bound to a namespace
;; of your choice
(<-- (string-concat ?result ?string1 ?string2 ?string3)
(lisp ?result (string+ ?string1 ?string2 ?string3)))
(<-- (name ?person (?first ?last))
(q ?person !rltv:first-name ?first)
... | 2,586 | Common Lisp | .l | 89 | 24.696629 | 61 | 0.559253 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 9af23c5cf2a39a96c5bf854297ac9750381291d9be852bc9429922c018827468 | 28,739 | [
-1
] |
28,740 | ssl-dir.sh | wvxvw_agraph-client/src/openrdf/tests/ssl-dir.sh | #!/bin/bash
dir=$( cd "$( dirname "$0" )" && pwd )
cacert="${dir}/ca.cert"
# Point this at the client certificate
testcert="${dir}/test.cert"
echo "${dir}"
db_dir="${dir}/certs.db"
p12=/tmp/$$.p12
mkdir -p $db_dir
certutil -d $db_dir "$@"-A -n FranzTestCA -i $cacert -t TC,,
openssl pkcs12 -export -in $testcert -n... | 416 | Common Lisp | .l | 14 | 28.071429 | 73 | 0.636364 | wvxvw/agraph-client | 0 | 0 | 0 | EPL-1.0 | 9/19/2024, 11:36:20 AM (Europe/Amsterdam) | 7abd6e85b96e59feb8856e308e6d1856a5d9155a7ae38f3d1f14810aa234c7da | 28,740 | [
-1
] |
28,768 | suite-test.lisp | rodrigow_wizard_adventure/suite-test.lisp | (load "lib/lisp-unit.lisp")
(use-package :lisp-unit)
;; loading test files
(load "test/wizard-test.lisp")
(run-tests)
| 120 | Common Lisp | .lisp | 5 | 22.6 | 30 | 0.734513 | rodrigow/wizard_adventure | 0 | 0 | 0 | LGPL-3.0 | 9/19/2024, 11:36:28 AM (Europe/Amsterdam) | c64f84d93299549a8fcfa0f2a2db13449281cafce42e0bb9219a5366a6121206 | 28,768 | [
-1
] |
28,769 | wizard-test.lisp | rodrigow_wizard_adventure/test/wizard-test.lisp | (load "source/wizard.lisp")
(define-test "should describe garden location"
(assert-equal '(YOU ARE IN A BEATIFUL GARDEN. THERE IS A WELL IN FRONT OF YOU.) (describe-location 'garden *nodes*)))
(define-test "should describe path to garden"
(assert-equal '(THERE IS A DOOR GOING WEST FROM HERE.) (describe-path '(ga... | 533 | Common Lisp | .lisp | 7 | 73.714286 | 140 | 0.743786 | rodrigow/wizard_adventure | 0 | 0 | 0 | LGPL-3.0 | 9/19/2024, 11:36:28 AM (Europe/Amsterdam) | bf47015220f9dca73ae00425e1fddb191b0f0479c53a4bfcd9c1e3c959e4551c | 28,769 | [
-1
] |
28,770 | wizard.lisp | rodrigow_wizard_adventure/source/wizard.lisp | (defparameter *nodes* '((living-room (you are in the living-room.
a wizard is snoring loudly on the couch.))
(garden (you are in a beatiful garden.
there is a well in front of you.))
(attic (you are in the attic.
there is a giant welding torch in the orner.))))
(defun describe-location (l... | 745 | Common Lisp | .lisp | 16 | 42.0625 | 73 | 0.690608 | rodrigow/wizard_adventure | 0 | 0 | 0 | LGPL-3.0 | 9/19/2024, 11:36:28 AM (Europe/Amsterdam) | 3de790f3f88786fbafe78504523a32cc0e5f801e9b5ec67d8dccaafce5e430f9 | 28,770 | [
-1
] |
28,789 | guess-number.lisp | nomikomu_LOLisp/src/guess-number.lisp | (defparameter *small* 1)
(defparameter *big* 100)
(defun guess-number ()
(ash (+ *small* *big*) -1))
(defun smaller ()
(setf *big* (1- (guess-number)))
(guess-number))
(defun bigger ()
(setf *small* (1+ (guess-number)))
(guess-number))
(defun start-over ()
(defparameter *small* 1)
(defpar... | 357 | Common Lisp | .lisp | 14 | 22.071429 | 38 | 0.615836 | nomikomu/LOLisp | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:36 AM (Europe/Amsterdam) | 956e52176c11fe0fd5f8bfadf094b0f6e6a78d558dc847253ec07f5635d27049 | 28,789 | [
-1
] |
28,790 | cheat-sheet.lisp | nomikomu_LOLisp/src/cheat-sheet.lisp | ;;;; Common Lisp - CHEAT SHEET
; i i i i i i i ooooo o ooooooo ooooo ooooo
; I I I I I I I 8 8 8 8 8 o 8 8
; I \ `+' / I 8 8 8 8 8 8
; \ `-+-' / 8 8 8 ooooo 8oooo
; `-__|__-' ... | 3,468 | Common Lisp | .lisp | 133 | 23.210526 | 66 | 0.555455 | nomikomu/LOLisp | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:36 AM (Europe/Amsterdam) | bbdde7482f12313f35eef72760ec12bd1b5703d2979a1c754148d1527ec0ac6e | 28,790 | [
-1
] |
28,791 | check-empty-list.lisp | nomikomu_LOLisp/src/check-empty-list.lisp | ; (check-empty-list nil)
; THE-LIST-IS-EMPTY
; (check-empty-list '(a b))
; THE-LIST-ISNT-EMPTY
(defun check-empty-list (list)
(if list
'the-list-isnt-empty
'the-list-is-empty)) | 183 | Common Lisp | .lisp | 8 | 21.125 | 30 | 0.701149 | nomikomu/LOLisp | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:36 AM (Europe/Amsterdam) | 2ef8a0b9349ea1709524f837191a2e118f29ca99f096a678a78da845e0aa42cc | 28,791 | [
-1
] |
28,792 | length-list.lisp | nomikomu_LOLisp/src/length-list.lisp | (defun length-list (list)
(if list
(1+ (length-list (cdr list)))
0)) | 74 | Common Lisp | .lisp | 4 | 16.25 | 31 | 0.619718 | nomikomu/LOLisp | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:36 AM (Europe/Amsterdam) | 874a8ad2525a88ad29678fa1f4e0d8a5c0f5d10dbccf9822d034df70366469c6 | 28,792 | [
-1
] |
28,793 | short-story.lisp | nomikomu_LOLisp/src/short-story.lisp | (defvar *arch-enemy* nil)
(defun pudding-eater-cond (person)
(cond ((eq person 'henry) (setf *arch-enemy* 'stupid-lisp-alien)
'(curse you lisp alien - you ate my pudding))
((eq person 'johnny) (setf *arch-enemy* 'useless-old-johnny)
'(i hope you choked on my pudding johnny))
(t ... | 714 | Common Lisp | .lisp | 14 | 42.642857 | 67 | 0.607703 | nomikomu/LOLisp | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:36 AM (Europe/Amsterdam) | 055e0a59160d519db2696c896d9a7624e7ef82f9a3c1cd21147701c21ee0a3c7 | 28,793 | [
-1
] |
28,794 | text-game.lisp | nomikomu_LOLisp/src/text-game.lisp | ; location nodes
(defparameter *nodes* '(
(living-room (you are in the living-room.
a wizard is snoring loudly on the couch.))
(garden (you are in a beautiful garden.
there is a well in front of you.))
(attic (you are in the attic.
there is a ... | 893 | Common Lisp | .lisp | 23 | 33.130435 | 67 | 0.643599 | nomikomu/LOLisp | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:36 AM (Europe/Amsterdam) | fd8b88092a0b2f74d5ba718718db5f0292aa681f9229df1a94adef0411d71f6e | 28,794 | [
-1
] |
28,816 | simplify.lisp | akiyeng2_symbolic-math/simplify.lisp | ;;;; Functions for handling symbolic manipulation
(defconstant e (exp 1) "Euler's Number")
(defconstant i #C(0 1) "Imaginary Number")
(defconstant π pi "PI")
(defun ^ (a b) (expt a b))
(defparameter *ops* nil)
(defun flatten (obj)
(do* ((result (list obj))
(node result))
((null node) (delete nil re... | 8,228 | Common Lisp | .lisp | 228 | 32.631579 | 92 | 0.585657 | akiyeng2/symbolic-math | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:45 AM (Europe/Amsterdam) | be2884538274a0e81b98dfff79a5bd44f7fa812f5364c8458b768dcc89a2b623 | 28,816 | [
-1
] |
28,817 | unit-circle.lisp | akiyeng2_symbolic-math/unit-circle.lisp | (defvar *unit-circle*
'(0 (:sin 0 :cos 1)
2 (:sin 1/2 :cos ((3 ^ 1/2) / 2))
3 (:sin ((2 ^ 1/2) / 2) :cos ((2 ^ 1/2) / 2))
4 (:sin ((3 ^ 1/2) / 2) :cos 1/2)
6 (:sin 1 :cos 0)
8 (:sin ((3 ^ 1/2) / 2) :cos -1/2)
9 (:sin ((2 ^ 1/2) / 2) :cos (- ((2 ^ 1/2) / 2)))
10 (:sin 1/2 :cos (- ((3 ^ 1/2)... | 664 | Common Lisp | .lisp | 17 | 34.352941 | 58 | 0.348297 | akiyeng2/symbolic-math | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:45 AM (Europe/Amsterdam) | 4e9fe2e6d9c5163e10ce0ed7280c6eca1098148983f38a49a1f74d9be0d052db | 28,817 | [
-1
] |
28,818 | delta.lisp | akiyeng2_symbolic-math/delta.lisp | ;;;; Derivatives
(defvar *delta-table* '((sin (cos x)) (cos (0 - (sin x)))
(tan (1 / ((cos x) ^ 2)))
(sinh (cosh x)) (cosh (sinh x))
(tanh (1 / ((cosh x) ^ 2)))
(asin (1 / ((1 - (x ^ 2)) ^ 1/2)))
(acos (0 - (1 / ((1 - (x ^ 2)) ^ 1/2))))
(atan (1 / (1 + (x ^ 2))))
(asinh (1 / ((1 + (x ^ 2)) ^ 1/2))... | 2,048 | Common Lisp | .lisp | 58 | 31.241379 | 57 | 0.542698 | akiyeng2/symbolic-math | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:45 AM (Europe/Amsterdam) | 6edb29312e02055b57ff05594efcc3099f2d02b9305bee0ab34926f503562fc2 | 28,818 | [
-1
] |
28,838 | ttf-flash.lisp | sgarciac_ttf-flash/ttf-flash.lisp | (in-package #:cl-user)
(defpackage #:ttf-flash
(:use #:cl #:gordon)
(:export
#:generate-flash-font
#:generate-flash-font-file
))
(in-package #:ttf-flash)
(defun glyph-to-swf-contours (glyph ratio)
(let ((contours '()
))
(labels ((x-trans (x) (floor (* x ratio)))
(y-trans (y) (* -... | 2,892 | Common Lisp | .lisp | 79 | 29.265823 | 148 | 0.593343 | sgarciac/ttf-flash | 0 | 0 | 0 | LGPL-2.1 | 9/19/2024, 11:36:45 AM (Europe/Amsterdam) | 07d029937848085675d0da9e2489079facdf9ed189a2d0af7aad6323c1348e5d | 28,838 | [
-1
] |
28,839 | ttf-flash.asd | sgarciac_ttf-flash/ttf-flash.asd | ;;; COPYRIGHT 2006 Sergio Garcia <sergio.garcia@gmail.com>
;;;
;;; This program is free software; you can redistribute it and/or modify
;;; it under the terms of the GNU Lesser General Public License as published by
;;; the Free Software Foundation; either version 2.1 of the License, or
;;; (at your option) any later v... | 1,020 | Common Lisp | .asd | 23 | 42.347826 | 79 | 0.73003 | sgarciac/ttf-flash | 0 | 0 | 0 | LGPL-2.1 | 9/19/2024, 11:36:45 AM (Europe/Amsterdam) | 664c3f13e3224db9ed926600043cf2ae061254fbd99a30d9d424e5d1ba1b8f8f | 28,839 | [
-1
] |
28,857 | power.lisp | aseeshr_LispTests/power.lisp | (defun power (X Y)
"Compute the power of (power B E)"
(if (<= Y 1)
X
(* X (power X (- Y 1))))) | 107 | Common Lisp | .lisp | 5 | 18 | 36 | 0.485437 | aseeshr/LispTests | 0 | 0 | 0 | LGPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | 7fbd5f06cfe604e73f8a41b060728733b6ba150f9eb0f4e129a6c257c5432994 | 28,857 | [
-1
] |
28,858 | triangular.lisp | aseeshr_LispTests/triangular.lisp | (defun triangular (N)
"Compute the triangular N"
(if (= N 1)
1
(+ N (triangular (- N 1))))) | 103 | Common Lisp | .lisp | 5 | 17.4 | 30 | 0.555556 | aseeshr/LispTests | 0 | 0 | 0 | LGPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | ebd9754528b14cc22612180167bfd51ef84e298d0d11afe3f3b1412b3057a5fd | 28,858 | [
-1
] |
28,859 | testing.lisp | aseeshr_LispTests/testing.lisp | ;;; testing.lisp
;;; by Philip Fong
;;;
;;; Introductory comments are preceded by ;;;
;;; Function headers are preceded by ";;"
;;; Inline comments are introduced by ";"
;;;
;;
;; Triple the value of a number
;;
(defun triple (X)
"Compute three times X." ;Inline comments can
(* 3 X)); be placed here.
;;
;; Negat... | 440 | Common Lisp | .lisp | 19 | 21.473684 | 64 | 0.666667 | aseeshr/LispTests | 0 | 0 | 0 | LGPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | bc084fe5bfa398e9de4847982e9218fd2b91bea80cc628b87ac9163425307d79 | 28,859 | [
-1
] |
28,860 | binomial.lisp | aseeshr_LispTests/binomial.lisp | (defun binomial (N R)
"Compute the binomial expansion"
(if (or (zerop R) (= R N))
1
(+ (binomial (- N 1) (- R 1))
(binomial (- N 1) R))))
(defun sumlist (L)
"A recursive implementation of sum function"
(if (null L)
0
(+ (first L) (sumlist (rest L))))) | 286 | Common Lisp | .lisp | 11 | 21.909091 | 46 | 0.56 | aseeshr/LispTests | 0 | 0 | 0 | LGPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | 1af89adad9c4cdb4e8c4669c813409834f572930c455c0886c5fcbaa64ffedd4 | 28,860 | [
-1
] |
28,861 | factorial.lisp | aseeshr_LispTests/factorial.lisp | (defun factorial (N)
"Compute the factorial of N."
(if (= N 1)
1
(* N (factorial (- N 1)))))
(defun sum (X Y)
"Compute the sum of X and Y"
(+ X Y))
(defun power (X Y)
"Compute the power of (power B E)"
(if (<= Y 1)
X
(* X (power X (- Y 1)))))
| 277 | Common Lisp | .lisp | 13 | 17.692308 | 36 | 0.521073 | aseeshr/LispTests | 0 | 0 | 0 | LGPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | dd2cef81296014ca93b284b148ac8e686b277aefa20a5d43ce1bfcb60a53c752 | 28,861 | [
-1
] |
28,867 | testing.fasl | aseeshr_LispTests/testing.fasl | #!/usr/bin/sbcl --script
# FASL
compiled from "testing.lisp"
using SBCL version 1.0.55.0.debian
ˇ X86N 1.0.55.0.debian2 (:GENCGC :SB-PACKAGE-LOCKS :SB-THREAD :SB-UNICODE)ùS B - I M P L % D E F U N ùC O M M O N - L I S P - U S E R T R I... | 2,341 | Common Lisp | .l | 9 | 258.666667 | 820 | 0.231462 | aseeshr/LispTests | 0 | 0 | 0 | LGPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | f0f8477703d08cf935bc306c7aa432b42fb70bde124a974e20949d2ab7c0042a | 28,867 | [
-1
] |
28,883 | package.lisp | inklesspen_alea/package.lisp | ;;;; package.lisp
(in-package "COMMON-LISP-USER")
(defpackage #:alea
(:use #:cl #:iterate)
(:import-from :alexandria :curry :compose)
(:export :launch))
| 161 | Common Lisp | .lisp | 6 | 24.5 | 44 | 0.679739 | inklesspen/alea | 0 | 0 | 1 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | 110ace8144b4451b2d66c000761ec27f7203601b66d31791265d84b75b52c000 | 28,883 | [
-1
] |
28,884 | cli.lisp | inklesspen_alea/cli.lisp | (in-package #:alea)
(defun launch-inner (nickname host port channel)
(let ((session (make-instance 'session
:session-name 'cli-session
:nickname nickname
:host host
:port (parse-integer por... | 588 | Common Lisp | .lisp | 14 | 27.428571 | 59 | 0.494755 | inklesspen/alea | 0 | 0 | 1 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | 00ff500fc196ff8e35ce327d40430f534163c80fa50ab949a4241b9c5e043780 | 28,884 | [
-1
] |
28,885 | parsing.lisp | inklesspen_alea/parsing.lisp | ;;;; parsing.lisp
(in-package #:alea)
;;; defrule does not share a namespace with functions or variables
(esrap:defrule whitespace (+ (or #\space #\tab #\newline))
(:constant nil))
(esrap:defrule alphanumeric (alphanumericp character))
(esrap:defrule word (+ alphanumeric)
(:function esrap:text))
(esrap:defrul... | 7,627 | Common Lisp | .lisp | 152 | 41.677632 | 104 | 0.616514 | inklesspen/alea | 0 | 0 | 1 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | a77352689668f5c7851596e9572d33cf7413561977cb6fe2a3c71553a8601469 | 28,885 | [
-1
] |
28,886 | tarot.lisp | inklesspen_alea/tarot.lisp | ;;;; tarot.lisp
(in-package #:alea)
(defparameter *tarot-cards*
#(
"The Fool" "The Magician" "The High Priestess" "The Empress" "The Emperor" "The Hierophant" "The Lovers" "The Chariot" "Justice" "The Hermit" "Wheel of Fortune" "Strength" "The Hanged Man" "Death" "Temperance" "The Devil" "The Tower" "The Star" ... | 1,901 | Common Lisp | .lisp | 12 | 155.166667 | 522 | 0.724284 | inklesspen/alea | 0 | 0 | 1 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | a09b4ad6e245554e130225c62f8a389bcb062dd910373e40a29e7c161858fb96 | 28,886 | [
-1
] |
28,887 | alea.lisp | inklesspen_alea/alea.lisp | ;;;; alea.lisp
(in-package #:alea)
;;; "alea" goes here. Hacks and glory await!
;;; sub-thread: define hooks, then read-message-loop on the connection
(defclass response ()
((session
:initarg :session
:initform (error "Must supply session")
:reader session)
(destination
:initarg :destination
... | 10,350 | Common Lisp | .lisp | 240 | 35.595833 | 266 | 0.650992 | inklesspen/alea | 0 | 0 | 1 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | 0c0e59a9f10861ac4cecd088dec10b3a3406213ff0e30f528413b9bad8b350cc | 28,887 | [
-1
] |
28,888 | alea.asd | inklesspen_alea/alea.asd | ;;;; alea.asd
(asdf:defsystem #:alea
:serial t
:description "Describe alea here"
:author "inklesspen"
:license "GPL"
:depends-on (#:cl-irc
#:alexandria
#:esrap
#:iterate)
:components ((:file "package")
(:file "context")
(:file "roll... | 450 | Common Lisp | .asd | 17 | 16.705882 | 35 | 0.454756 | inklesspen/alea | 0 | 0 | 1 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | d343f84245eda0f1c512e5433830e68c9d969f890d747d3b0ee8ac1af8efd192 | 28,888 | [
-1
] |
28,895 | Dockerfile | inklesspen_alea/Dockerfile | FROM buildpack-deps:jessie
RUN wget http://prdownloads.sourceforge.net/sbcl/sbcl-1.2.11-x86-64-linux-binary.tar.bz2 && tar xjf sbcl-1.2.11-x86-64-linux-binary.tar.bz2 && cd sbcl-1.2.11-x86-64-linux && sh install.sh
RUN wget https://beta.quicklisp.org/quicklisp.lisp
RUN sbcl --non-interactive --load quicklisp.lisp --ev... | 770 | Common Lisp | .l | 9 | 84.555556 | 188 | 0.730618 | inklesspen/alea | 0 | 0 | 1 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | 21d4d50d4548a045abfa8ff921a92e8a73e5c8db0e27af359a4c9830a828b879 | 28,895 | [
-1
] |
28,911 | all-pwgl-pmc-rules.lisp | cicerojones_CSP-voiceleading/all-pwgl-pmc-rules.lisp | (in-package :ccl)
;; l is the partial solution (including the current candidate) found
;; so far by the search-engine.
(*
(?if (apply #'< l)) ;note, the "less than" binary relation/operator on l, *not* rl
"Result in ascending order")
;TRY FOR INSTANCE ONE OF THESE: '4-1 '4-Z15A '4-27A
(*
(?IF (LET ((SUBSE... | 27,532 | Common Lisp | .lisp | 713 | 31.366059 | 123 | 0.466917 | cicerojones/CSP-voiceleading | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | 48b0c0a85817315c01e861e2f119a904da2ef6b4252aff7d532a09254613f77f | 28,911 | [
-1
] |
28,913 | testing-PMC-lone-tetrachord.pwgl | cicerojones_CSP-voiceleading/testing-PMC-lone-tetrachord.pwgl | (IN-PACKAGE :CCL)
;; this patch was saved with PWGL version 1.0 beta RC 18 (0.9.18-201)
(ASSERT-PATCH-SAVED-VERSION-NOT-NEWER-THAN (QUOTE ((0 9 18) 201)))
(LET ((WIN (MAKE-INSTANCE (QUOTE PWGL-PW-WINDOW) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-LISP-CODE-BOX) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-TEXT-... | 78,084 | Common Lisp | .l | 147 | 528.034014 | 44,946 | 0.705867 | cicerojones/CSP-voiceleading | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | 9dc552b2fb7c86f6be4e98c1d70aab063200b3cfedbaef64f959e364874bb7e3 | 28,913 | [
-1
] |
28,914 | scripting-72hexachords.pwgl | cicerojones_CSP-voiceleading/scripting-72hexachords.pwgl | (IN-PACKAGE :CCL)
;; this patch was saved with PWGL version 1.0 beta RC 18 (0.9.18-201)
(ASSERT-PATCH-SAVED-VERSION-NOT-NEWER-THAN (QUOTE ((0 9 18) 201)))
(LET ((WIN (MAKE-INSTANCE (QUOTE PWGL-PW-WINDOW) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE SCORE-EDITOR) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-SCORE-SUBBO... | 495,628 | Common Lisp | .l | 281 | 1,757.533808 | 373,502 | 0.691499 | cicerojones/CSP-voiceleading | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | 7e97bf17593b9076c361c948708a6641f4e2205582426c517ecdeb019aacf2a4 | 28,914 | [
-1
] |
28,915 | 72-down-to-two.pwgl | cicerojones_CSP-voiceleading/72-down-to-two.pwgl | (IN-PACKAGE :CCL)
;; this patch was saved with PWGL version 1.0 beta RC 18 (0.9.18-201)
(ASSERT-PATCH-SAVED-VERSION-NOT-NEWER-THAN (QUOTE ((0 9 18) 201)))
(LET ((WIN (MAKE-INSTANCE (QUOTE PWGL-PW-WINDOW) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-LISP-CODE-BOX) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-TEXT-... | 61,177 | Common Lisp | .l | 335 | 179.471642 | 11,493 | 0.716717 | cicerojones/CSP-voiceleading | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | e52be0ddb1b0abfaee528a6ea2f19e3d77c3b390b47c94cf0689e9d5b93a041c | 28,915 | [
-1
] |
28,916 | independent-study-draft3.pwgl | cicerojones_CSP-voiceleading/independent-study-draft3.pwgl | (IN-PACKAGE :CCL)
;; this patch was saved with PWGL version 1.0 beta RC 18 (0.9.18-201)
(ASSERT-PATCH-SAVED-VERSION-NOT-NEWER-THAN (QUOTE ((0 9 18) 201)))
(LET ((WIN (MAKE-INSTANCE (QUOTE PWGL-PW-WINDOW) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-LISP-CODE-BOX) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-TEXT-... | 206,956 | Common Lisp | .l | 271 | 757.575646 | 169,519 | 0.671891 | cicerojones/CSP-voiceleading | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | d8fc04e28cc19c653cda9b3344e4bea7d911a7b5fc81d3f5e39d724c245707e6 | 28,916 | [
-1
] |
28,917 | testing-PMC.pwgl | cicerojones_CSP-voiceleading/testing-PMC.pwgl | (IN-PACKAGE :CCL)
;; this patch was saved with PWGL version 1.0 beta RC 18 (0.9.18-201)
(ASSERT-PATCH-SAVED-VERSION-NOT-NEWER-THAN (QUOTE ((0 9 18) 201)))
(LET ((WIN (MAKE-INSTANCE (QUOTE PWGL-PW-WINDOW) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-LISP-CODE-BOX) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-TEXT-... | 194,466 | Common Lisp | .l | 612 | 315.30719 | 57,294 | 0.701788 | cicerojones/CSP-voiceleading | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | 4ba2ca819e091ad83a5c34ca43ad6c2eba48c50c137404c7c75eb0c4c497ce45 | 28,917 | [
-1
] |
28,918 | independent-study-draft2.pwgl | cicerojones_CSP-voiceleading/independent-study-draft2.pwgl | (IN-PACKAGE :CCL)
;; this patch was saved with PWGL version 1.0 beta RC 18 (0.9.18-201)
(ASSERT-PATCH-SAVED-VERSION-NOT-NEWER-THAN (QUOTE ((0 9 18) 201)))
(LET ((WIN (MAKE-INSTANCE (QUOTE PWGL-PW-WINDOW) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-LISP-CODE-BOX) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-TEXT-... | 160,381 | Common Lisp | .l | 699 | 227.084406 | 33,587 | 0.702816 | cicerojones/CSP-voiceleading | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | 79f8f806b8afa26155bd292575a9a7f824c0034de89ea65d6208e6fc8d8bfcb9 | 28,918 | [
-1
] |
28,919 | 72hexachords.pwgl | cicerojones_CSP-voiceleading/72hexachords.pwgl | (IN-PACKAGE :CCL)
;; this patch was saved with PWGL version 1.0 beta RC 18 (0.9.18-201)
(ASSERT-PATCH-SAVED-VERSION-NOT-NEWER-THAN (QUOTE ((0 9 18) 201)))
(LET ((WIN (MAKE-INSTANCE (QUOTE PWGL-PW-WINDOW) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-LISP-CODE-BOX) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-TEXT-... | 50,311 | Common Lisp | .l | 195 | 255.620513 | 25,723 | 0.716273 | cicerojones/CSP-voiceleading | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | f3020dbbc672a4e7c12d1b32fa8c2658f16f89194e91c9d6016c1745c0234a43 | 28,919 | [
-1
] |
28,921 | independent-study-draft.pwgl | cicerojones_CSP-voiceleading/independent-study-draft.pwgl | (IN-PACKAGE :CCL)
;; this patch was saved with PWGL version 1.0 beta RC 18 (0.9.18-201)
(ASSERT-PATCH-SAVED-VERSION-NOT-NEWER-THAN (QUOTE ((0 9 18) 201)))
(LET ((WIN (MAKE-INSTANCE (QUOTE PWGL-PW-WINDOW) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-LISP-CODE-BOX) :PWGL-SUBVIEWS (LIST (MAKE-INSTANCE (QUOTE PWGL-TEXT-... | 62,423 | Common Lisp | .l | 341 | 179.120235 | 11,408 | 0.707021 | cicerojones/CSP-voiceleading | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:36:53 AM (Europe/Amsterdam) | 030a22d073a04712e8c30436d5a2a93e9d3528b3e7ba4c2a69d7055f01e63a73 | 28,921 | [
-1
] |
28,936 | q10.lisp | improper4_99-lisp-problems/q10.lisp | ; Run-length encoding of a list.
; Use the result of problem P09 to implement the so-called run-length encoding data compression method.
; Consecutive duplicates of elements are encoded as lists (N E) where N is the number of duplicates of
; the element E.
;
; Example:
; * (encode '(a a a a b c c a a d e e e e))
... | 662 | Common Lisp | .lisp | 17 | 36.823529 | 104 | 0.643411 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | f8c0c779730e38c8e6672246c494ee75e2be4b45f5189d319a63f6fa5992b709 | 28,936 | [
-1
] |
28,937 | q31.lisp | improper4_99-lisp-problems/q31.lisp | ; (**) Determine whether a given integer number is prime.
; Example:
; * (is-prime 7)
; T
(defun is-prime (num)
) | 115 | Common Lisp | .lisp | 6 | 18 | 57 | 0.669725 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 27b7a79d396ba04dcdbbafb6fa6305e631c2523a374ac1ad4594a645dfe4ca50 | 28,937 | [
-1
] |
28,938 | q03.lisp | improper4_99-lisp-problems/q03.lisp | ;Find the K'th element of a list.
; The first element in the list is number 1.
; Example:
; * (element-at '(a b c d e) 3)
; C
(defun element-at (list idx)
(if (= idx 1)
(car list)
(element-at (cdr list) (- idx 1)))) | 221 | Common Lisp | .lisp | 9 | 23 | 44 | 0.632075 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 2993182c8b13cb734f4694a4db3279ebbc85ccc382295d5adc5ad0ee1c3405e5 | 28,938 | [
-1
] |
28,939 | q32.lisp | improper4_99-lisp-problems/q32.lisp | ; (**) Determine the greatest common divisor of two positive integer numbers.
; Use Euclid's algorithm.
; Example:
; * (gcd 36 63)
; 9
(defun my-gcd (p q)
(cond
((= p q) p)
((< p q) (my-gcd q p))
(t (my-gcd q (- p q))))) | 228 | Common Lisp | .lisp | 10 | 21.1 | 77 | 0.600917 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 5ef3b8e7ec9bc4c4bb8f416e74af41e360236bb615581d3dd9f67a2dc87ef700 | 28,939 | [
-1
] |
28,940 | q06.lisp | improper4_99-lisp-problems/q06.lisp | ; Find out whether a list is a palindrome.
; A palindrome can be read forward or backward; e.g. (x a m a x).
(defun palindromep (lst)
(equal lst (reverse lst))) | 162 | Common Lisp | .lisp | 4 | 39.25 | 65 | 0.71519 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 754f753c28bd6e855591502f5f78efe78b05717492306f1bc8226898fd261eae | 28,940 | [
-1
] |
28,941 | q08.lisp | improper4_99-lisp-problems/q08.lisp | ; (**) Eliminate consecutive duplicates of list elements.
; If a list contains repeated elements they should be replaced with a single copy of the element. The order of the elements should not be changed.
;
; Example:
; * (compress '(a a a a b c c a a d e e e e))
; (A B C A D E)
(defun compress (lst)
(labels ((recur ... | 475 | Common Lisp | .lisp | 13 | 34.307692 | 146 | 0.657952 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | f046046f47066b45eeb44aa3607412fe8769f6d5abccebc8c1dfcbbefe6a35c5 | 28,941 | [
-1
] |
28,942 | q04.lisp | improper4_99-lisp-problems/q04.lisp | ; Find the number of elements of a list.
(defun my-length (list)
(if (null list)
0
(+ 1 (my-length (cdr list))))) | 118 | Common Lisp | .lisp | 5 | 21.8 | 40 | 0.649123 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 7e6c48a4f7e9e18229eeb7abb584211209998612ce8ef9f4e3ad7010aa843b52 | 28,942 | [
-1
] |
28,943 | q14.lisp | improper4_99-lisp-problems/q14.lisp | ; Duplicate the elements of a list.
; Example:
; * (dupli '(a b c c d))
; (A A B B C C C C D D)
(defun dupli (lst)
(mapcan (lambda (item) (list item item)) lst)) | 163 | Common Lisp | .lisp | 6 | 26 | 47 | 0.624204 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 6dfc201031f0d7320f8a42465abe457377b971bb2c78c2ecaaa8c0ba57457d1d | 28,943 | [
-1
] |
28,944 | q07.lisp | improper4_99-lisp-problems/q07.lisp | ; (**) Flatten a nested list structure.
; Transform a list, possibly holding lists as elements into a `flat' list by replacing each list with its elements (recursively).
;
; Example:
; * (my-flatten '(a (b (c d) e)))
; (A B C D E)
;
; Hint: Use the predefined functions list and append.
(defun my-flatten (lst)
(if (nu... | 425 | Common Lisp | .lisp | 14 | 28.571429 | 129 | 0.676399 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | aa6eff0f4f22e7e0b29fa03106fcf509252696040108f239a6f6c0d8960a4cfe | 28,944 | [
-1
] |
28,945 | q15.lisp | improper4_99-lisp-problems/q15.lisp | ; (**) Replicate the elements of a list a given number of times.
; Example:
; * (repli '(a b c) 3)
; (A A A B B B C C C)
(defun repli (lst times)
(mapcan (lambda (item) (make-list times :initial-element item)) lst)) | 217 | Common Lisp | .lisp | 6 | 35 | 70 | 0.658768 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 12adeca86543859d19b116d8bea00e97cb9c51d6baaadf7d875f754c6c830677 | 28,945 | [
-1
] |
28,946 | q11.lisp | improper4_99-lisp-problems/q11.lisp | ; Modified run-length encoding.
; Modify the result of problem P10 in such a way that if an element has no duplicates it is
; simply copied into the result list. Only elements with duplicates are transferred as (N E) lists.
;
; Example:
; * (encode-modified '(a a a a b c c a a d e e e e))
; ((4 A) B (2 C) (2 A) D (4 E... | 490 | Common Lisp | .lisp | 13 | 32.384615 | 99 | 0.614256 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | a22d36ab21bc62f86af949c0d1411131e3118ef6117e6060a882d824d1265240 | 28,946 | [
-1
] |
28,947 | q34.lisp | improper4_99-lisp-problems/q34.lisp | ; (**) Calculate Euler's totient function phi(m).
; Euler's so-called totient function phi(m) is defined as the number
; of positive integers r (1 <= r < m) that are coprime to m.
;
; Example: m = 10: r = 1,3,7,9; thus phi(m) = 4. Note the special case: phi(1) = 1.
;
; * (totient-phi 10)
; 4
;
; Find o... | 654 | Common Lisp | .lisp | 15 | 42.333333 | 85 | 0.688088 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 483c69ebf3bcec7aebd2dc23da8707ee69820fdfc4776e9637eb922d1570dd36 | 28,947 | [
-1
] |
28,948 | q05.lisp | improper4_99-lisp-problems/q05.lisp |
; Reverse a list
(defun my-reverse-list (lst)
(let ((acc nil))
(dolist (elt lst)
(push elt acc))
acc))
| 114 | Common Lisp | .lisp | 6 | 16.166667 | 28 | 0.638095 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 91c7814937d213439e78a4a61a40ada5d3923a389ed722902e0190e52bebdc7a | 28,948 | [
-1
] |
28,949 | q01.lisp | improper4_99-lisp-problems/q01.lisp | ; Find the last box of a list.
; Example:
; * (my-last '(a b c d))
; (D)
(in-package :com.improper4.99-problems)
(defun my-last (list)
(if (null list)
nil
(if (null (cdr list))
list
(my-last (cdr list)))))
| 219 | Common Lisp | .lisp | 11 | 17.727273 | 39 | 0.621359 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 7acf040bbc7912a39e495c0310ea74c3b17bdec1e12b70bec45630f071b649ac | 28,949 | [
-1
] |
28,950 | q13.lisp | improper4_99-lisp-problems/q13.lisp | ; Run-length encoding of a list (direct solution).
; Implement the so-called run-length encoding data compression method directly.
; I.e. don't explicitly create the sublists containing the duplicates, as in problem P09,
; but only count them. As in problem P11, simplify the result list by replacing
; the singleton l... | 941 | Common Lisp | .lisp | 29 | 28.793103 | 90 | 0.636564 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | ecc11f151c91e33719dac35ef02132f1bfe1bce3e06399aec56db555d2f0883f | 28,950 | [
-1
] |
28,951 | q12.lisp | improper4_99-lisp-problems/q12.lisp | ; Decode a run-length encoded list.
; Given a run-length code list generated as specified in problem P11. Construct its uncompressed version.
(defun decode (lst)
(mapcan (lambda (x)
(if (atom x)
x
make-list (car x) :initial-element (second x)))
lst)) | 261 | Common Lisp | .lisp | 8 | 30.375 | 105 | 0.727273 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 63fea3bd572f08cd36400e40c5a2cf595c04055b16e75f32f42fe0e49fd0a04b | 28,951 | [
-1
] |
28,952 | q16.lisp | improper4_99-lisp-problems/q16.lisp | ; (**) Drop every N'th element from a list.
; Example:
; * (drop '(a b c d e f g h i k) 3)
; (A B D E G H K)
(defun drop (list n)
"returns result of dropping every nth element of list"
(loop
for elem in list
for i from 1
unless (= (mod i n) 0)
collect elem))
| 288 | Common Lisp | .lisp | 11 | 22.545455 | 56 | 0.594203 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 4763932f4deb5cd8ffeb243dc144d9924e9ff6dd1705c8001dec594da7d7f04c | 28,952 | [
-1
] |
28,953 | q17.lisp | improper4_99-lisp-problems/q17.lisp | ; (*) Split a list into two parts; the length of the first part is given.
;Do not use any predefined predicates.
;
; Example:
; * (split '(a b c d e f g h i k) 3)
; ( (A B C) (D E F G H I K))
(defun split (lst cnt)
(list (subseq lst 0 cnt)
(subseq lst cnt))) | 262 | Common Lisp | .lisp | 9 | 27.777778 | 73 | 0.636364 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | e32a45171b56047e81a534531d0a94b8488ec96530085b303a8e1981029f6279 | 28,953 | [
-1
] |
28,954 | q09.lisp | improper4_99-lisp-problems/q09.lisp | ; Pack consecutive duplicates of list elements into sublists.
; If a list contains repeated elements they should be placed in separate sublists.
;
; Example:
; * (pack '(a a a a b c c a a d e e e e))
; ((A A A A) (B) (C C) (A A) (D) (E E E E))
(defun pack (lst)
(labels ((group (x lst tmp)
(cond
((null lst) (lis... | 515 | Common Lisp | .lisp | 15 | 32 | 82 | 0.61245 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 2b39e2bfbd19fa0fad7d5b1221217704003d18907888495d59df5ebf9421d5e5 | 28,954 | [
-1
] |
28,955 | q18.lisp | improper4_99-lisp-problems/q18.lisp | ; (**) Extract a slice from a list.
; Given two indices, I and K, the slice is the list containing the elements between the I'th and K'th element of
; the original list (both limits included). Start counting the elements with 1.
;
; Example:
; * (slice '(a b c d e f g h i k) 3 7)
; (C D E F G)
(defun slice (lst start... | 357 | Common Lisp | .lisp | 9 | 38.333333 | 112 | 0.685879 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 80c0519ccbd277f3c2a209e831b6226496952d42b0f426a09596ac81880cf822 | 28,955 | [
-1
] |
28,956 | q02.lisp | improper4_99-lisp-problems/q02.lisp | ; Find the last but one box of a list.
; Example:
; * (my-but-last '(a b c d))
; (C D)
(in-package :com.improper4.99-problems)
(defun my-but-last (list)
(let ((relist (reverse list)))
(cond
((null relist) nil)
((<= (length relist) 2) list)
(t (list (second relist) (car relist))))))
| 293 | Common Lisp | .lisp | 11 | 24.727273 | 44 | 0.635714 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | dd0ae4ec199d6fee0b2761bd1af2aa6d63434ef19d1858f4ad5f05841c5059ac | 28,956 | [
-1
] |
28,957 | q33.lisp | improper4_99-lisp-problems/q33.lisp | ; (*) Determine whether two positive integer numbers are coprime.
; Two numbers are coprime if their greatest common divisor equals 1.
; Example:
; * (coprime 35 64)
; T
(defun coprime (p q)
(= 1 (gcd p q))) | 209 | Common Lisp | .lisp | 7 | 28.714286 | 68 | 0.717822 | improper4/99-lisp-problems | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 6c92294081263fcbb2b8c2e0b080d3812dffced7f67fc0ba142f88a5c1dbefdd | 28,957 | [
-1
] |
28,995 | eir.lisp | mpemer_eir/eir.lisp | (in-package :eir)
(defmacro seth (hash-table key value)
"Macro that does the semi-awkward (setf (gethash ... pattern"
`(setf (gethash ,key ,hash-table) ,value))
(defmacro def (name &body body)
"Macro that provides a shorter version of defparameter"
`(defparameter ,name ,@body))
| 287 | Common Lisp | .lisp | 7 | 38.857143 | 61 | 0.730216 | mpemer/eir | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 752ccb49c941cb59713de1af9d14158fcb6d06ea47a9afab7f3fdd7363c6a072 | 28,995 | [
-1
] |
28,996 | package.lisp | mpemer_eir/package.lisp | (in-package :cl)
(defpackage :mercury.model
(:use :cl :asdf
:postmodern
:simple-date
:iterate
:lisp-unit)
(:export :init :create-schema :drop-schema :recreate-schema
:create-market :read-market :read-markets :update-market :delete-market
:instrument :instrument-id
:create-instrument :read-instrum... | 2,273 | Common Lisp | .lisp | 69 | 29.202899 | 89 | 0.749658 | mpemer/eir | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | c8415ce7b53fe46129105e10afacfb0adcc97cee212d073e2a3f2a59cf67feeb | 28,996 | [
-1
] |
28,997 | test.lisp | mpemer_eir/test.lisp | (in-package :lisp-unit)
(defun run-eir-tests ()
"Runs the test suite for each package in the eir system"
(progn
(run-tests :all :eir)))
(setq *print-errors* t)
(run-eir-tests)
| 186 | Common Lisp | .lisp | 7 | 24.142857 | 58 | 0.694915 | mpemer/eir | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 2d273fdd213ec04d4349f330ba47c7832b2440b644f3b67d5b61c5176ad8cfcc | 28,997 | [
-1
] |
28,998 | eir.asd | mpemer_eir/eir.asd | (in-package :asdf)
(defsystem :eir
:name :eir
:version "0.0.0"
:maintainer "Marcus Pemer"
:author "Marcus Pemer"
:licence "GPLv2"
:description "Eir"
:long-description "Healing Common Lisp with red utilities and green extensions"
:depends-on (:lisp-unit)
:components ((:file "test" :depends-on ("eir"))... | 396 | Common Lisp | .asd | 13 | 26.769231 | 81 | 0.662304 | mpemer/eir | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | cf131034dc713c52a89dbd62189105de84b3685754fdbe5a65033f51bcc8158c | 28,998 | [
-1
] |
29,017 | champ.lisp | 1001nuits_timeline-explorer/champ.lisp | ;=============================HEADER====================================
; champ.lisp "Timeline explorer" v 1.1
; Copyleft 1001nuits (http://www.1001nuits.org - August 2010
;=======================================================================
(defpackage "TIMELINE-EXPLORER"
(:use "COMMON-LISP")
... | 6,808 | Common Lisp | .lisp | 131 | 39.740458 | 125 | 0.509774 | 1001nuits/timeline-explorer | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 10d5277abdb3fc688dc12757f3a491a92f883966078098a1593b2121622ba2e4 | 29,017 | [
177866
] |
29,034 | package.lisp | priyadarshan_glyphs/package.lisp | ;; Glyphs - Reducing verbosity in Common Lisp
;; Copyright (C) 2013 Matthew Carter
;;
;; 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) a... | 926 | Common Lisp | .lisp | 21 | 41.380952 | 72 | 0.719553 | priyadarshan/glyphs | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 8609e267335955f428ec744eb27e77a20aeccd94f439e83387f8f9b63b4849ae | 29,034 | [
-1
] |
29,035 | glyphs.lisp | priyadarshan_glyphs/glyphs.lisp | ;; Glyphs - Reducing verbosity in Common Lisp
;; Copyright (C) 2013 Matthew Carter
;;
;; 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) a... | 3,110 | Common Lisp | .lisp | 79 | 34.050633 | 72 | 0.626087 | priyadarshan/glyphs | 0 | 0 | 0 | GPL-3.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 3bc843976aa0aea6c5433f2c73d43b87cf45de8969a11184d0c651e9c545f293 | 29,035 | [
-1
] |
29,056 | functions.lsp | AndreaCimminoArriaga_ColoreadoDeGrafos/HGenetic Algorithm/functions.lsp | ;;| |;;
;;| ############################################################## |;;
;;| ##### Main and auxiliar functions ###### |;;
;;| ############################################################## |;;
;;| |;;
;;| ... | 24,823 | Common Lisp | .l | 401 | 58.236908 | 144 | 0.334609 | AndreaCimminoArriaga/ColoreadoDeGrafos | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 501794106c3505769a4fa5737424face5fff289e26d7cfd445e848c2ffc3ad99 | 29,056 | [
-1
] |
29,057 | graph_andalucia.txt | AndreaCimminoArriaga_ColoreadoDeGrafos/HGenetic Algorithm/graph_andalucia.txt | c File: graph_andalucia.txt
c
c SOURCE: Andrea Cimmino Arriaga
c DESCRIPTION: It's the andaluci's map translated to a graph.
c Nodes description:
c - CADIZ: 1
c - HUELVA: 2
c - SEVILLA: 3
c - CORDOBA: 4
c - MALAGA: 5
c - JAEN: 6
c - GRANADA: 7
c - ALMERIA: 8
p edge 8 246708
e 1 2... | 458 | Common Lisp | .l | 38 | 11.078947 | 61 | 0.627078 | AndreaCimminoArriaga/ColoreadoDeGrafos | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 492ba6bad654b34ebce6df05079daf29a93e5cc9fa87c43d0246f185629aab6e | 29,057 | [
-1
] |
29,058 | hgenetic_algorithm_improved.lsp | AndreaCimminoArriaga_ColoreadoDeGrafos/HGenetic Algorithm/hgenetic_algorithm_improved.lsp | ;;Importing data from file 'data.lsp'
(load "data.lsp")
;;.______________________________________________________________________________________________________________.;;
;;| |;;
;;| Initialice genetic algorithm parameters as described in the paper: |;;
;;|____________________... | 8,705 | Common Lisp | .l | 145 | 57.386207 | 201 | 0.329848 | AndreaCimminoArriaga/ColoreadoDeGrafos | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | c106ede0b6f617e49925654eca69731644213ad543deb05a8be00c3f51a5c78c | 29,058 | [
-1
] |
29,059 | data.lsp | AndreaCimminoArriaga_ColoreadoDeGrafos/HGenetic Algorithm/data.lsp | (defparameter *v* 10)
(defparameter *k* 2 )
(defparameter *matrix_adj* '( '(0 0 0 0 0 0 1 0 1 0) '(0 0 0 0 0 0 1 0 0 0) '(0 0 0 0 0 0 0 1 1 0) '(0 0 0 0 0 0 0 0 1 1) '(0 0 0 0 0 0 1 0 0 0) '(0 0 0 0 0 0 0 1 0 0) '(1 1 0 0 1 0 0 0 0 0) '(0 0 1 0 0 1 0 0 0 0) '(1 0 1 1 0 0 0 0 0 0) '(0 0 0 1 0 0 0 0 0 0) ) )
| 315 | Common Lisp | .l | 3 | 103 | 268 | 0.480769 | AndreaCimminoArriaga/ColoreadoDeGrafos | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | 8ffc7f615e9d4278fcd21a9f103d7f1be04952ffaacf27be90fc723609121267 | 29,059 | [
-1
] |
29,060 | hgenetic_algorithm.lsp | AndreaCimminoArriaga_ColoreadoDeGrafos/HGenetic Algorithm/hgenetic_algorithm.lsp | ;;Importing data from file 'data.lsp'
(load "data.lsp")
;;.______________________________________________________________________________________________________________.;;
;;| |;;
;;| Initialice genetic algorithm parameters as described in the paper: |;;
;;|____________________... | 8,920 | Common Lisp | .l | 153 | 55.352941 | 201 | 0.326266 | AndreaCimminoArriaga/ColoreadoDeGrafos | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | fdfd53b874f75c5fb3162e431dbaf1e32dc301dd8fceb16f45d93af203147187 | 29,060 | [
-1
] |
29,061 | functions.lsp | AndreaCimminoArriaga_ColoreadoDeGrafos/HGenetic Algorithm refined/functions.lsp | ;;| |;;
;;| ############################################################## |;;
;;| ##### Main and auxiliar functions ###### |;;
;;| ############################################################## |;;
;;| |;;
;;| ... | 30,652 | Common Lisp | .l | 517 | 55.317215 | 210 | 0.332377 | AndreaCimminoArriaga/ColoreadoDeGrafos | 0 | 0 | 0 | GPL-2.0 | 9/19/2024, 11:37:01 AM (Europe/Amsterdam) | ef2c33bae510738a478bb49ca054176e5084213ee99d2c0bbf9a2e53619f4165 | 29,061 | [
-1
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.