chunk_id
large_stringlengths
7
11
question_id
large_stringlengths
4
8
language
large_stringclasses
1 value
chunk_index
int64
0
5
chunk_text
large_stringlengths
148
2.58k
sparse_text
large_stringlengths
96
3.09k
dense_vector
listlengths
3.58k
3.58k
sparse_indices
listlengths
9
249
sparse_values
listlengths
9
249
export_source
large_stringclasses
1 value
74468042_c2
74468042
lisp
2
_dialog, unload_dialog, Title, Update, Block, Revision, boxed_column, Column_TitleBoxes, Client, Client_Box, Row, Name, Row_Client_Name, txt_Client_Name, edit_box, edbx_Client_Name, Location, Row_Client_Loc, txt_Client_Loc, edbx_Client_Loc, Job, Job_Box, Row_Job_Name, txt_Job_Name, edbx_Job_Name, Number, Row_Job_Number...
_dialog, unload_dialog, Title, Update, Block, Revision, boxed_column, Column_TitleBoxes, Client, Client_Box, Row, Name, Row_Client_Name, txt_Client_Name, edit_box, edbx_Client_Name, Location, Row_Client_Loc, txt_Client_Loc, edbx_Client_Loc, Job, Job_Box, Row_Job_Name, txt_Job_Name, edbx_Job_Name, Number, Row_Job_Number...
[ 0.0035858154296875, 0.0245361328125, 0.01495361328125, 0.024658203125, 0.00848388671875, -0.00933837890625, 0.01422119140625, 0.0072021484375, 0.0223388671875, 0.01055908203125, -0.01068115234375, 0.006866455078125, -0.01092529296875, -0.0140380859375, -0.01806640625, 0.004119873046875...
[ 101, 3390, 4867, 4, 51, 63033, 48962, 28641, 80231, 853, 25826, 16530, 297, 8447, 316, 19, 233987, 454, 16734, 17991, 72295, 90, 91732, 96190, 15757, 150, 2517, 163612, 124326, 27211, 11728, 2223, 275, 425, 90788, 15363, 32664, 194802, 1033...
[ 0.10101318359375, 0.147216796875, 0.20263671875, 0.049560546875, 0.13037109375, 0.2373046875, 0.214599609375, 0.197509765625, 0.221435546875, 0.07769775390625, 0.210693359375, 0.1932373046875, 0.14599609375, 0.155029296875, 0.158203125, 0.047393798828125, 0.208251953125, 0.01251220...
embed
6268275_c0
6268275
lisp
0
Title: Why apply is so important for lisp evaluator? Problem title: Why apply is so important for lisp evaluator? Tags: lisp, sicp Problem: Why apply is so important for lisp evaluator? I have read chapter 4 of SICP, and just found that the first section lists the most important functions for implementing a evaluator, ...
Why apply is so important for lisp evaluator? Why apply is so important for lisp evaluator? lisp sicp Why Why apply is so important for lisp evaluator? I have read chapter 4 of SICP, and just found that the first section lists the most important functions for implementing a evaluator, eval and apply , I understand that...
[ 0.015869140625, 0.017578125, 0.019775390625, 0.004241943359375, -0.006317138671875, -0.0024566650390625, 0.0093994140625, 0.01300048828125, 0.001251220703125, -0.0213623046875, 0.0177001953125, -0.0244140625, -0.0166015625, -0.0016326904296875, 0.007354736328125, -0.02001953125, -0.0...
[ 44084, 59911, 83, 221, 5526, 100, 400, 7008, 151575, 748, 26536, 254, 12301, 139539, 201, 159, 198993, 40059, 5303, 2684, 32354, 29479, 28, 1405, 136, 28219, 4552, 15400, 46876, 112668, 110, 23, 74181, 90502, 44691, 2685, 22936, 124962 ]
[ 0.15234375, 0.28515625, 0.101318359375, 0.1171875, 0.2091064453125, 0.0821533203125, 0.1343994140625, 0.211181640625, 0.1949462890625, 0.1561279296875, 0.0899658203125, 0.16064453125, 0.039947509765625, 0.039093017578125, 0.0621337890625, 0.034515380859375, 0.181884765625, 0.046112...
embed
6462825_c1
6462825
lisp
1
> Type :? for other options. 1 > (print-xml '(p "Interesting stuff at " ((a href "http://slashdot.org") "SlashDot"))) is copied from http://common-lisp.net/project/s-xml/ . The rest examples are running fine. What's wrong with this "print-xml"? Thanks. Code signals: Lisp, Welcome, Clozure, Common, Version, dev-r14406M...
> Type :? for other options. 1 > (print-xml '(p "Interesting stuff at " ((a href "http://slashdot.org") "SlashDot"))) is copied from http://common-lisp.net/project/s-xml/ . The rest examples are running fine. What's wrong with this "print-xml"? Thanks. Code signals: Lisp, Welcome, Clozure, Common, Version, dev-r14406M...
[ -0.00494384765625, 0.031982421875, 0.00885009765625, -0.006103515625, 0.00653076171875, 0.007110595703125, 0.006500244140625, -0.0281982421875, 0.0004482269287109375, -0.01806640625, -0.007171630859375, -0.0050048828125, -0.0106201171875, -0.0174560546875, 0.0155029296875, -0.007385253...
[ 60457, 152, 32, 3789, 50717, 106, 35662, 9, 131492, 254, 44851, 525, 214, 41884, 99, 77867, 7, 5544, 15464, 1478, 294, 8331, 18, 83, 71200, 71, 1295, 277, 3796, 4086, 1179, 95322, 10588, 27781, 51042, 5885, 44691, 903, 28864, 26073, 126...
[ 0.2320556640625, 0.1229248046875, 0.07403564453125, 0.03656005859375, 0.18115234375, 0.01629638671875, 0.218017578125, 0.0180511474609375, 0.279052734375, 0.15087890625, 0.135986328125, 0.151123046875, 0.1497802734375, 0.17822265625, 0.0616455078125, 0.04693603515625, 0.0558166503906...
embed
35316752_c2
35316752
lisp
2
of code to perform multiplication (print "Enter two numbers to be multiplied") (finish-output nil) (defvar num1) (defvar num2) (defvar a) (setq num1 (read)) (setq num2 (read)) (setq a (bin num1 ())) (defvar cnt) (setq cnt (integer-length num1)) (print cnt) (dotimes (i (- 63 cnt)) (push 0 a) ) (print "First number in b...
of code to perform multiplication (print "Enter two numbers to be multiplied") (finish-output nil) (defvar num1) (defvar num2) (defvar a) (setq num1 (read)) (setq num2 (read)) (setq a (bin num1 ())) (defvar cnt) (setq cnt (integer-length num1)) (print cnt) (dotimes (i (- 63 cnt)) (push 0 a) ) (print "First number in b...
[ -0.02197265625, -0.00750732421875, -0.00335693359375, 0.034912109375, 0.0042724609375, 0.031494140625, 0.00994873046875, -0.0106201171875, 0.004547119140625, -0.01708984375, -0.00872802734375, 0.0177001953125, -0.01153564453125, -0.006439208984375, 0.01275634765625, -0.01531982421875, ...
[ 111, 18151, 47, 51339, 127664, 1363, 35662, 155581, 6626, 101935, 186, 118126, 297, 5983, 4745, 6056, 17324, 112, 420, 1961, 13269, 17727, 10461, 10, 3509, 864, 39116, 304, 15, 7568, 418, 660, 6191, 23986, 246, 70141, 14, 9, 12069, 501, ...
[ 0.081787109375, 0.2119140625, 0.0947265625, 0.1497802734375, 0.236572265625, 0.093994140625, 0.126708984375, 0.1624755859375, 0.095458984375, 0.1212158203125, 0.032073974609375, 0.1978759765625, 0.07037353515625, 0.04376220703125, 0.037994384765625, 0.05108642578125, 0.1273193359375,...
embed
8272999_c0
8272999
lisp
0
Title: getopt library won't load Problem title: getopt library won't load Tags: clisp, lisp Problem: getopt library won't load [76]> (asdf:oos 'asdf:load-op 'getopt) ; loading system definition from getopt.asd into # ;; Loading file getopt.asd ... ; registering # as GETOPT ; registering # as GETOPT-TESTS * - ...
getopt library won't load getopt library won't load clisp lisp getopt library won't load [76]> (asdf:oos 'asdf:load-op 'getopt) ; loading system definition from getopt.asd into # ;; Loading file getopt.asd ... ; registering # as GETOPT ; registering # as GETOPT-TESTS * - Program stack overflow. RESET I don't ...
[ 0.003082275390625, 0.01544189453125, 0.00433349609375, -0.0167236328125, -0.0233154296875, -0.0072021484375, 0.01422119140625, -0.01422119140625, -0.00262451171875, -0.0255126953125, -0.0185546875, -0.0152587890625, -0.00616455078125, -0.0101318359375, -0.0185546875, -0.002273559570312...
[ 2046, 2146, 18, 35773, 1294, 23742, 3768, 72367, 95701, 7008, 400, 11835, 420, 31, 232, 63033, 429, 13784, 5426, 80934, 162, 71, 3934, 468, 228006, 11435, 68067, 237, 527, 123732, 22693, 31273, 12763, 661, 7663, 177261, 645, 118664, 9069, ...
[ 0.1395263671875, 0.2135009765625, 0.16552734375, 0.1689453125, 0.0679931640625, 0.06103515625, 0.072265625, 0.18896484375, 0.1009521484375, 0.1693115234375, 0.0850830078125, 0.140380859375, 0.0631103515625, 0.015594482421875, 0.0946044921875, 0.09930419921875, 0.0799560546875, 0.10...
embed
60260_c0
60260
lisp
0
Title: My first Lisp macro; is it leaky? Problem title: My first Lisp macro; is it leaky? Tags: lisp, macros Problem: My first Lisp macro; is it leaky? I've been working through Practical Common Lisp and as an exercise decided to write a macro to determine if a number is a multiple of another number: (defmacro multp (v...
My first Lisp macro; is it leaky? My first Lisp macro; is it leaky? lisp macros Lisp My first Lisp macro; is it leaky? I've been working through Practical Common Lisp and as an exercise decided to write a macro to determine if a number is a multiple of another number: (defmacro multp (value factor) `(= (rem ,value ,fac...
[ -0.015869140625, 0.0159912109375, 0.0146484375, 0.004669189453125, 0.005523681640625, 0.030029296875, 0.00909423828125, -0.004425048828125, -0.004180908203125, -0.03369140625, -0.013916015625, 0.01806640625, 0.01251220703125, -0.0031890869140625, 0.00579833984375, 0.00408935546875, -...
[ 2646, 5117, 1261, 7008, 111789, 74, 83, 95, 11, 1002, 442, 400, 20697, 109613, 151301, 81979, 68872, 33022, 83324, 2174, 14012, 48716, 15700, 112, 420, 15322, 3869, 254, 27494, 31461, 7328, 144810, 757, 81944, 1112, 209, 151575, 29568, 2179...
[ 0.06964111328125, 0.1680908203125, 0.1632080078125, 0.2232666015625, 0.243408203125, 0.0318603515625, 0.040618896484375, 0.189697265625, 0.179931640625, 0.225830078125, 0.039276123046875, 0.1171875, 0.004730224609375, 0.04150390625, 0.05224609375, 0.0236968994140625, 0.00445556640625...
embed
33106135_c0
33106135
lisp
0
Title: Is there way to run MIT scheme interpreter under emacs on Windows? Problem title: Is there way to run MIT scheme interpreter under emacs on Windows? Tags: emacs, lisp, mit-scheme, scheme Problem: Is there way to run MIT scheme interpreter under emacs on Windows? I am a newbie for Lisp, and trying to run MIT sche...
Is there way to run MIT scheme interpreter under emacs on Windows? Is there way to run MIT scheme interpreter under emacs on Windows? emacs lisp mit-scheme scheme MIT Windows Is there way to run MIT scheme interpreter under emacs on Windows? I am a newbie for Lisp, and trying to run MIT scheme interpreter under emacs o...
[ 0.0093994140625, 0.01416015625, 0.004791259765625, 0.0025634765625, -0.0277099609375, 0.0108642578125, 0.015625, -0.0062255859375, -0.012939453125, -0.025634765625, 0.00506591796875, 0.021728515625, -0.0076904296875, -0.021240234375, 0.00213623046875, -0.0098876953125, -0.00897216796...
[ 2071, 2685, 3917, 47, 11675, 78999, 150370, 29481, 56, 1379, 352, 2263, 7, 98, 3773, 400, 7008, 491, 7560, 282, 9014, 1261, 31577, 69201, 1434, 15246, 23662, 100599, 9146, 8194, 508, 17137, 214, 104155, 155247, 4007, 32195 ]
[ 0.02960205078125, 0.0357666015625, 0.10595703125, 0.041473388671875, 0.1541748046875, 0.2386474609375, 0.22265625, 0.215576171875, 0.1881103515625, 0.1810302734375, 0.110107421875, 0.161865234375, 0.15966796875, 0.1114501953125, 0.203369140625, 0.06732177734375, 0.19482421875, 0.15...
embed
9455667_c0
9455667
lisp
0
Title: Emacs inferior-lisp get result of evaluation Problem title: Emacs inferior-lisp get result of evaluation Tags: emacs, lisp, elisp Problem: Emacs inferior-lisp get result of evaluation I am sending regions from my current buffer to inferior-lisp buffer using, (lisp-eval-string sexpr-str) What I would like to do i...
Emacs inferior-lisp get result of evaluation Emacs inferior-lisp get result of evaluation emacs lisp elisp Emacs Emacs inferior-lisp get result of evaluation I am sending regions from my current buffer to inferior-lisp buffer using, What I would like to do is get the result back. I have tried saving point before and af...
[ 0.0010833740234375, 0.01318359375, -0.00677490234375, 0.004547119140625, -0.0263671875, 0.021728515625, 0.0150146484375, -0.007537841796875, -0.01153564453125, -0.0283203125, 0.0216064453125, -0.00121307373046875, -0.01080322265625, -0.007293701171875, 0.00168609619140625, 0.0024871826...
[ 85269, 4439, 44157, 4086, 254, 2046, 16750, 111, 219836, 352, 2263, 400, 7008, 15296, 135834, 10776, 1295, 43581, 373, 18234, 47, 17368, 1884, 4420, 37842, 57, 6496, 6275, 8108, 7103, 28, 1405, 11782, 45367, 79315, 3871, 15190, 8, 5259, 1...
[ 0.1458740234375, 0.153076171875, 0.2440185546875, 0.109375, 0.17822265625, 0.09722900390625, 0.2056884765625, 0.1177978515625, 0.2470703125, 0.0743408203125, 0.1029052734375, 0.0965576171875, 0.1563720703125, 0.05975341796875, 0.0960693359375, 0.162109375, 0.030364990234375, 0.0860...
embed
58900859_c0
58900859
lisp
0
Title: how to change drracket splash screen to the valentine one Problem title: how to change drracket splash screen to the valentine one Tags: racket, lisp Problem: how to change drracket splash screen to the valentine one I want to make the default splash screen for DrRacket the special one they use for valentine. On...
how to change drracket splash screen to the valentine one how to change drracket splash screen to the valentine one racket lisp how to change drracket splash screen to the valentine one I want to make the default splash screen for DrRacket the special one they use for valentine. One way to have it on your screen is to ...
[ -0.011962890625, 0.018310546875, -0.01544189453125, 0.01556396484375, 0.00074005126953125, 0.001129150390625, -0.0142822265625, 0.005828857421875, -0.0164794921875, -0.00017833709716796875, 0.00653076171875, -0.000037670135498046875, 0.00653076171875, -0.0091552734375, 0.0126953125, -0...
[ 3642, 47, 15549, 3568, 219, 27853, 91, 182785, 49119, 85540, 1212, 1632, 673, 400, 7008, 70, 3444, 3249, 114977, 100, 1773, 12248, 5361, 4527, 3917, 765, 1733, 13909, 616, 22482, 3884, 442, 237, 7413, 201939, 128468 ]
[ 0.06585693359375, 0.09228515625, 0.204833984375, 0.0782470703125, 0.10186767578125, 0.2352294921875, 0.08056640625, 0.231201171875, 0.2242431640625, 0.16845703125, 0.1256103515625, 0.1197509765625, 0.0916748046875, 0.020172119140625, 0.0809326171875, 0.0133056640625, 0.04779052734375...
embed
37869336_c1
37869336
lisp
1
COMMON-LISP"> 2. Value: "unbound" 3. Function: #<CLOSURE (:SPECIAL LET) {10013DC6AB}> 4. Plist: (SB-WALKER::WALKER-TEMPLATE SB-WALKER::WALK-LET) What do the following lisp primitives/special forms/special operators/functions mean? let, flet progn car cdr acc setq, setf incf (write more in the comments so we can make a ...
COMMON-LISP"> 2. Value: "unbound" 3. Function: #<CLOSURE (:SPECIAL LET) {10013DC6AB}> 4. Plist: (SB-WALKER::WALKER-TEMPLATE SB-WALKER::WALK-LET) What do the following lisp primitives/special forms/special operators/functions mean? let, flet progn car cdr acc setq, setf incf (write more in the comments so we can make a ...
[ 0.004241943359375, 0.01287841796875, -0.006500244140625, -0.006378173828125, -0.0096435546875, 0.017333984375, 0.0003528594970703125, -0.01177978515625, 0.0034942626953125, 0.004119873046875, -0.020751953125, 0.0050048828125, 0.0031890869140625, 0.01373291015625, 0.0078125, 0.016967773...
[ 31436, 82707, 67616, 683, 70902, 787, 190060, 309, 99091, 1031, 28670, 10763, 468, 92933, 155775, 568, 7842, 27089, 2681, 11040, 1398, 436, 6562, 36474, 135824, 34324, 21130, 35746, 90944, 25632, 400, 7008, 128489, 90, 146981, 3173, 39933, 13...
[ 0.0982666015625, 0.195068359375, 0.1619873046875, 0.20556640625, 0.0231781005859375, 0.0238494873046875, 0.2091064453125, 0.03558349609375, 0.20849609375, 0.008544921875, 0.13720703125, 0.073486328125, 0.00482177734375, 0.0938720703125, 0.109130859375, 0.0736083984375, 0.068664550781...
embed
6165836_c0
6165836
lisp
0
Title: In LISP how to inspect free variables in a closure? Problem title: In LISP how to inspect free variables in a closure? Tags: scope, lisp, lexical-scope, closures Problem: In LISP how to inspect free variables in a closure? In lisp I can bind free variables bound in a closure like this... (let ((x 1) (y 2) (z 3))...
In LISP how to inspect free variables in a closure? In LISP how to inspect free variables in a closure? scope lisp lexical-scope closures LISP In LISP how to inspect free variables in a closure? In lisp I can bind free variables bound in a closure like this... results in ... What I want to know is if it is possible to ...
[ 0.0130615234375, 0.019775390625, -0.00762939453125, 0.004669189453125, -0.0064697265625, 0.00921630859375, -0.00885009765625, 0.0301513671875, 0.004180908203125, -0.005218505859375, -0.003875732421875, 0.005950927734375, 0.01434326171875, 0.01287841796875, 0.0184326171875, 0.0222167968...
[ 16970, 9434, 3642, 134071, 4092, 77336, 7, 23, 170224, 360, 70820, 400, 7008, 75675, 21533, 47, 831, 68557, 99091, 1884, 903, 50339, 7722, 84079 ]
[ 0.11322021484375, 0.2012939453125, 0.050872802734375, 0.261474609375, 0.1802978515625, 0.232666015625, 0.047027587890625, 0.017242431640625, 0.206787109375, 0.0152740478515625, 0.134765625, 0.1033935546875, 0.178466796875, 0.0477294921875, 0.0477294921875, 0.014984130859375, 0.000955...
embed
4641802_c0
4641802
lisp
0
Title: SDRAW is not working in my computer Problem title: SDRAW is not working in my computer Tags: lisp Problem: SDRAW is not working in my computer i have installed clisp in my ubuntu machine. I am trying to use sdraw to display the cons structure. But this SDRAW is not working in my computer.I tried to use the examp...
SDRAW is not working in my computer SDRAW is not working in my computer lisp SDRAW EVAL SDRAW is not working in my computer i have installed clisp in my ubuntu machine. I am trying to use sdraw to display the cons structure. But this SDRAW is not working in my computer.I tried to use the examples given in the book A ge...
[ 0.003387451171875, 0.01519775390625, -0.005126953125, 0.000492095947265625, -0.018310546875, 0.021728515625, 0.007568359375, -0.00909423828125, -0.0205078125, -0.006500244140625, 0.0166015625, -0.00823974609375, 0.0244140625, -0.016845703125, -0.005126953125, -0.0146484375, -0.001998...
[ 21864, 118324, 83, 959, 20697, 23, 759, 13909, 400, 7008, 241, 61152, 20600, 95701, 198996, 36279, 4527, 91, 86905, 44116, 158, 7, 45646, 27781, 21507, 128201, 181135, 2886, 4488, 25632, 75101 ]
[ 0.0848388671875, 0.301025390625, 0.04803466796875, 0.10333251953125, 0.1512451171875, 0.094482421875, 0.048309326171875, 0.154296875, 0.063720703125, 0.1903076171875, 0.0709228515625, 0.23681640625, 0.0823974609375, 0.039703369140625, 0.1231689453125, 0.027801513671875, 0.02684020996...
embed
11783022_c0
11783022
lisp
0
Title: Common Lisp: compilation vs evaluation Problem title: Common Lisp: compilation vs evaluation Tags: sbcl, lisp, functional-programming, common-lisp Problem: Common Lisp: compilation vs evaluation On Emacs + Slime with sbcl, once I define a function (or more) in a file I have two choices: Evaluation : e.g. with C-...
Common Lisp: compilation vs evaluation Common Lisp: compilation vs evaluation sbcl lisp functional-programming common-lisp Common Lisp Common Lisp: compilation vs evaluation On Emacs + Slime with sbcl, once I define a function (or more) in a file I have two choices: Evaluation : e.g. with C-M-x eval-defun Compilation :...
[ 0.0225830078125, 0.00958251953125, 0.00537109375, 0.005279541015625, -0.01275634765625, 0.006500244140625, 0.00189208984375, 0.001495361328125, -0.007415771484375, 0.0003681182861328125, -0.021484375, 0.008544921875, 0.0096435546875, 0.01104736328125, 0.006103515625, 0.0021514892578125...
[ 151301, 1261, 7008, 98352, 1363, 20209, 219836, 91, 275, 34937, 400, 123309, 28966, 39210, 4086, 254, 85269, 4439, 997, 82344, 13, 61924, 32354, 1286, 11435, 6626, 44126, 151228, 678, 313, 594, 425, 28, 1405, 112, 16498, 15612, 14, 57860, ...
[ 0.1878662109375, 0.157470703125, 0.1956787109375, 0.259765625, 0.0931396484375, 0.1761474609375, 0.279541015625, 0.0531005859375, 0.115478515625, 0.169677734375, 0.0992431640625, 0.150634765625, 0.0814208984375, 0.126953125, 0.09796142578125, 0.1060791015625, 0.1383056640625, 0.147...
embed
17258211_c0
17258211
lisp
0
Title: Scheme (Lazy Racket) an infinite list of natural numbers Problem title: Scheme (Lazy Racket) an infinite list of natural numbers Tags: racket, scheme, infinite, lazy-evaluation, lisp Problem: Scheme (Lazy Racket) an infinite list of natural numbers I think that Lazy Racket should be useful for handling infinite ...
Scheme (Lazy Racket) an infinite list of natural numbers Scheme (Lazy Racket) an infinite list of natural numbers racket scheme infinite lazy-evaluation lisp Scheme Lazy Racket Scheme (Lazy Racket) an infinite list of natural numbers I think that Lazy Racket should be useful for handling infinite lists. According to th...
[ 0.0162353515625, 0.0194091796875, -0.01104736328125, 0.01483154296875, 0.00035858154296875, 0.01190185546875, 0.00921630859375, -0.0164794921875, 0.00183868408203125, -0.046630859375, 0.003448486328125, -0.0189208984375, -0.00897216796875, 0.019775390625, 0.0172119140625, 0.01300048828...
[ 34702, 282, 2729, 3285, 2552, 27853, 142, 54241, 13, 5303, 6083, 101935, 673, 150370, 21, 159258, 400, 7008, 239, 5351, 5608, 80234, 45064, 8162, 809, 16145, 3698, 20990, 52544, 831, 61924, 237 ]
[ 0.1939697265625, 0.1492919921875, 0.1220703125, 0.2147216796875, 0.1441650390625, 0.2244873046875, 0.041015625, 0.181396484375, 0.0889892578125, 0.213134765625, 0.1937255859375, 0.156494140625, 0.0904541015625, 0.2022705078125, 0.10736083984375, 0.1429443359375, 0.058502197265625, ...
embed
34342537_c0
34342537
lisp
0
Title: List without nil in result Lisp Problem title: List without nil in result Lisp Tags: lisp Problem: List without nil in result Lisp I have to delete all occurences of an element in a list from all levels. My code is: (defun sterge(e l) (cond ((and (atom l) (equal e l)) nil) ((atom l) (list l)) (t (append (apply #...
List without nil in result Lisp List without nil in result Lisp lisp List Lisp NIL List without nil in result Lisp I have to delete all occurences of an element in a list from all levels. My code is: When I give: it shows me the output: How to delete that nil?? Thank you.
[ -0.000804901123046875, 0.0179443359375, -0.00139617919921875, -0.00897216796875, 0.003021240234375, 0.0052490234375, 0.0064697265625, -0.00567626953125, -0.00010585784912109375, -0.00421142578125, -0.00408935546875, -0.0089111328125, -0.01141357421875, -0.000009417533874511719, 0.0054321...
[ 32036, 15490, 17324, 23, 16750, 1261, 7008, 400, 541, 16444, 765, 47, 154109, 756, 74918, 69098, 12830, 5303, 1295, 90926, 18151, 8337, 45831, 140992, 11249, 450, 5 ]
[ 0.2025146484375, 0.16162109375, 0.215576171875, 0.068115234375, 0.2137451171875, 0.12139892578125, 0.204345703125, 0.062744140625, 0.09619140625, 0.17529296875, 0.037689208984375, 0.0577392578125, 0.2322998046875, 0.08782958984375, 0.1585693359375, 0.115478515625, 0.1507568359375, ...
embed
15281010_c2
15281010
lisp
2
isp.emacs...done, GNU, Emacs, C-h, C-a, ilcompat...done, comint-ipc...done, cltl2...done, ilisp-def...done, ilisp-sym...done, ilisp-inp...done, ilisp-ind...done, ilisp-prc...done, ilisp-val...done, ilisp-out...done, ilisp-mov...done, ilisp-key...done, ilisp-prn...done, ilisp-low...done, ilisp-doc...done, ilisp-ext...do...
isp.emacs...done, GNU, Emacs, C-h, C-a, ilcompat...done, comint-ipc...done, cltl2...done, ilisp-def...done, ilisp-sym...done, ilisp-inp...done, ilisp-ind...done, ilisp-prc...done, ilisp-val...done, ilisp-out...done, ilisp-mov...done, ilisp-key...done, ilisp-prn...done, ilisp-low...done, ilisp-doc...done, ilisp-ext...do...
[ 0.00518798828125, -0.005279541015625, 0.0017242431640625, 0.006591796875, -0.0177001953125, 0.04052734375, -0.0113525390625, 0.0038604736328125, 0.00439453125, 0.00750732421875, 0.021484375, 0.01348876953125, -0.01708984375, 0.008056640625, -0.00122833251953125, -0.004669189453125, -...
[ 83, 254, 5, 11883, 4439, 27, 64007, 4, 165132, 85269, 313, 9, 127, 11, 211, 277, 4453, 375, 4288, 14, 57095, 501, 1277, 141, 304, 1499, 7008, 112, 420, 4650, 73, 7250, 10287, 238, 1405, 6056, 30464, 19770, 19, 17336, 29713, 3355, 18...
[ 0.1644287109375, 0.296630859375, 0.19580078125, 0.1939697265625, 0.25439453125, 0.091552734375, 0.2071533203125, 0.0963134765625, 0.260009765625, 0.2210693359375, 0.1142578125, 0.08154296875, 0.1212158203125, 0.1234130859375, 0.1517333984375, 0.115234375, 0.2218017578125, 0.1083984...
embed
71529703_c0
71529703
lisp
0
Title: lisp list with even position elements Problem title: lisp list with even position elements Tags: lisp Problem: lisp list with even position elements I am trying to get a list from the list given as parameter that has only elements at even positions. So if I have '(a b c d e f) I should get '(a c e). I also want ...
lisp list with even position elements lisp list with even position elements lisp POZPAR NIL lisp list with even position elements I am trying to get a list from the list given as parameter that has only elements at even positions. So if I have '(a b c d e f) I should get '(a c e). I also want to do it iteratively with ...
[ -0.0186767578125, 0.01708984375, 0.005615234375, -0.00750732421875, -0.01171875, 0.052734375, -0.00093841552734375, 0.006072998046875, -0.0020751953125, -0.01495361328125, 0.01251220703125, -0.0242919921875, 0.007049560546875, -0.0201416015625, -0.0074462890625, 0.03271484375, -0.003...
[ 400, 7008, 5303, 678, 3853, 19069, 80854, 34839, 60436, 541, 16444, 31577, 2046, 1295, 34475, 171859, 1556, 4734, 99, 7, 765, 876, 501, 104, 28, 1238, 5608, 11, 3444, 720, 45023, 54, 1957, 44691, 18151, 17324 ]
[ 0.1231689453125, 0.1959228515625, 0.203857421875, 0.06463623046875, 0.2032470703125, 0.216064453125, 0.1988525390625, 0.0819091796875, 0.2156982421875, 0.06805419921875, 0.134521484375, 0.06622314453125, 0.09149169921875, 0.0810546875, 0.0234527587890625, 0.161865234375, 0.0118331909...
embed
11660077_c0
11660077
lisp
0
Title: Identify C++ style comments with asm-mode in Emacs Lisp Problem title: Identify C++ style comments with asm-mode in Emacs Lisp Tags: emacs, lisp, comments, assembly Problem: Identify C++ style comments with asm-mode in Emacs Lisp In Emacs, how do I tweak the lisp file(s) to identify C++ style comments in asm-mod...
Identify C++ style comments with asm-mode in Emacs Lisp Identify C++ style comments with asm-mode in Emacs Lisp emacs lisp comments assembly Identify Emacs Lisp Identify C++ style comments with asm-mode in Emacs Lisp In Emacs, how do I tweak the lisp file(s) to identify C++ style comments in asm-mode? I have a compiler...
[ 0.00823974609375, -0.002899169921875, -0.001800537109375, 0.00933837890625, -0.0040283203125, 0.02734375, -0.0086669921875, 0.0228271484375, 0.0030670166015625, -0.00494384765625, -0.000484466552734375, 0.013671875, 0.010986328125, -0.0027313232421875, -0.0019683837890625, -0.005737304...
[ 71257, 40383, 313, 37223, 20623, 24626, 678, 237, 39, 61170, 85269, 4439, 1261, 7008, 23, 352, 2263, 400, 89845, 3642, 77488, 13, 344, 11435, 135812, 9969, 34759, 8, 18151, 1884, 7, 6868, 214, 7639, 7839, 7986, 137565, 248, 1639, 661, 1...
[ 0.1771240234375, 0.06671142578125, 0.044525146484375, 0.22705078125, 0.1824951171875, 0.23046875, 0.048187255859375, 0.0958251953125, 0.1875, 0.1456298828125, 0.1517333984375, 0.1826171875, 0.1319580078125, 0.2103271484375, 0.0271148681640625, 0.0787353515625, 0.123779296875, 0.122...
embed
248180_c0
248180
lisp
0
Title: Lisp DO variable syntax reasoning Problem title: Lisp DO variable syntax reasoning Tags: syntax, lisp, let, do-loops Problem: Lisp DO variable syntax reasoning In Peter Seibel's Practical Common Lisp , he gives this example: (do ((nums nil) (i 1 (1+ i))) ((> i 10) (nreverse nums)) (push i nums)) I can see how it...
Lisp DO variable syntax reasoning Lisp DO variable syntax reasoning syntax lisp let do-loops Lisp Lisp DO variable syntax reasoning In Peter Seibel's Practical Common Lisp , he gives this example: I can see how it works, using nums inside the loop but not giving it a step-form. Why would you put nums in the variable-de...
[ 0.01190185546875, 0.02294921875, -0.019775390625, 0.0157470703125, -0.01806640625, 0.02734375, -0.00469970703125, 0.00823974609375, 0.005462646484375, -0.021728515625, 0.006134033203125, 0.00836181640625, -0.033203125, -0.01104736328125, 0.0159912109375, 0.01458740234375, -0.01391601...
[ 1261, 7008, 6197, 77336, 6002, 86531, 31635, 400, 2633, 54, 28354, 7948, 35211, 4063, 109613, 151301, 27781, 831, 1957, 43240, 17368, 13269, 46132, 40956, 1284, 959, 68772, 29954, 5037, 44084, 3884, 7, 23, 49919, 43257, 3501, 4127, 2046, 14...
[ 0.1304931640625, 0.2086181640625, 0.173583984375, 0.276611328125, 0.10546875, 0.1412353515625, 0.16650390625, 0.103271484375, 0.1385498046875, 0.1103515625, 0.1981201171875, 0.09136962890625, 0.0753173828125, 0.1922607421875, 0.07958984375, 0.059112548828125, 0.10076904296875, 0.02...
embed
19995803_c0
19995803
lisp
0
Title: Lisp issues on Mac os Problem title: Lisp issues on Mac os Tags: lisp, eclipse Problem: Lisp issues on Mac os I've been interested in learning lisp and rather than suck it up and trying emacs (I haven't figured that out yet), I've installed Dandelion for Eclipse. I can't get my simple Lisp code to run (* 2 3) I ...
Lisp issues on Mac os Lisp issues on Mac os lisp eclipse java.net.ConnectException Lisp Mac Error Connection Lisp issues on Mac os I've been interested in learning lisp and rather than suck it up and trying emacs (I haven't figured that out yet), I've installed Dandelion for Eclipse. I can't get my simple Lisp code to ...
[ -0.00823974609375, 0.044677734375, 0.003387451171875, 0.01519775390625, -0.0286865234375, 0.013671875, 0.001129150390625, -0.006072998046875, -0.000171661376953125, -0.02099609375, -0.00640869140625, -0.018310546875, 0.002288818359375, 0.001434326171875, 0.000621795654296875, -0.024780...
[ 1261, 7008, 37348, 98, 4727, 362, 400, 106371, 184, 79, 330, 1179, 235603, 19279, 63928, 212059, 62448, 60892, 52080, 31577, 2263, 20600, 2290, 1743, 1830, 234962, 831, 18, 2046, 8781, 18151, 47, 11675, 4265, 1062, 2189, 150011, 3863, 13415...
[ 0.198974609375, 0.2406005859375, 0.1912841796875, 0.0247802734375, 0.1746826171875, 0.10357666015625, 0.1356201171875, 0.165283203125, 0.07501220703125, 0.05181884765625, 0.1412353515625, 0.07757568359375, 0.1312255859375, 0.0186920166015625, 0.0849609375, 0.1448974609375, 0.15454101...
embed
46856492_c0
46856492
lisp
0
Title: Optimize Lisp recursive random walk Problem title: Optimize Lisp recursive random walk Tags: recursion, lisp, optimization, clisp Problem: Optimize Lisp recursive random walk This function results in stack overflow for more than about 2000 steps, is there any way I can easily optimize it to use less memory? (def...
Optimize Lisp recursive random walk Optimize Lisp recursive random walk recursion lisp optimization clisp Optimize Lisp Optimize Lisp recursive random walk This function results in stack overflow for more than about 2000 steps, is there any way I can easily optimize it to use less memory?
[ -0.0028076171875, 0.0208740234375, 0.0030517578125, -0.00634765625, -0.00799560546875, 0.007293701171875, -0.0157470703125, -0.01513671875, -0.023193359375, -0.037109375, 0.0186767578125, 0.01080322265625, -0.0047607421875, 0.01348876953125, 0.006439208984375, 0.01123046875, 0.002151...
[ 43938, 20650, 1261, 7008, 195625, 5844, 96759, 35691, 400, 87235, 95701, 32354, 50339, 177261, 645, 118664, 1286, 3576, 98441, 3917, 72546, 15572, 442, 4527, 40715, 98323 ]
[ 0.1583251953125, 0.1104736328125, 0.156005859375, 0.2369384765625, 0.166015625, 0.0902099609375, 0.1483154296875, 0.203857421875, 0.1336669921875, 0.172607421875, 0.03302001953125, 0.1607666015625, 0.08740234375, 0.1524658203125, 0.10980224609375, 0.234130859375, 0.01129150390625, ...
embed
9103918_c1
9103918
lisp
1
")) )) (defun lmg-moves (I) (list (+ 9 I) (- 9 I) )) 2. (defvar *currentRock* 9) (defvar *iterator* 3) (defun gift (N G) (setq *iterator* (+ *iterator* 1)) ;; (breadth-search *currentRock* G #'LMG) ) (defun LMG (a) (+ a (-(* *iterator* 2) 1)) ) As can be seen above, the general idea is to simply apply a breadth-search ...
")) )) (defun lmg-moves (I) (list (+ 9 I) (- 9 I) )) 2. (defvar *currentRock* 9) (defvar *iterator* 3) (defun gift (N G) (setq *iterator* (+ *iterator* 1)) ;; (breadth-search *currentRock* G #'LMG) ) (defun LMG (a) (+ a (-(* *iterator* 2) 1)) ) As can be seen above, the general idea is to simply apply a breadth-search ...
[ -0.031494140625, 0.041748046875, 0.00299072265625, 0.00921630859375, -0.0107421875, 0.01611328125, -0.0084228515625, 0.01556396484375, 0.02099609375, -0.047607421875, -0.00185394287109375, 0.01190185546875, 0.0103759765625, 0.00183868408203125, -0.0181884765625, -0.006317138671875, -...
[ 44, 16, 78960, 112, 16498, 96, 10035, 9, 432, 3132, 568, 6562, 22183, 483, 87, 787, 420, 1961, 163812, 122232, 77816, 16840, 4597, 8439, 18466, 527, 3509, 864, 4134, 712, 927, 86250, 37150, 724, 339, 34926, 11, 4537, 6528, 83, 42856, ...
[ 0.053314208984375, 0.033905029296875, 0.05938720703125, 0.1083984375, 0.1614990234375, 0.044708251953125, 0.1962890625, 0.0794677734375, 0.169677734375, 0.1815185546875, 0.06024169921875, 0.17529296875, 0.1256103515625, 0.148681640625, 0.05712890625, 0.04412841796875, 0.0575866699218...
embed
9608810_c0
9608810
lisp
0
Title: Does Mac OS X come with a Lisp environment built in with Emacs? Problem title: Does Mac OS X come with a Lisp environment built in with Emacs? Tags: macos, ide, common-lisp, lisp Problem: Does Mac OS X come with a Lisp environment built in with Emacs? I have been trying to find an environment that does not invol...
Does Mac OS X come with a Lisp environment built in with Emacs? Does Mac OS X come with a Lisp environment built in with Emacs? macos ide common-lisp lisp Does Mac Lisp Emacs Does Mac OS X come with a Lisp environment built in with Emacs? I have been trying to find an environment that does not involve installing anythi...
[ 0.00628662109375, 0.01153564453125, -0.0157470703125, 0.02587890625, -0.00555419921875, 0.037353515625, -0.0040283203125, 0.01031494140625, -0.010009765625, -0.021728515625, 0.0133056640625, 0.0016632080078125, -0.006805419921875, -0.0032806396484375, 0.00335693359375, -0.011474609375,...
[ 101790, 4727, 11787, 1193, 1380, 678, 1261, 7008, 65998, 88303, 23, 85269, 4439, 291, 7840, 5415, 39210, 4086, 254, 400, 10, 31577, 7413, 20600, 19138, 100, 959, 17368, 5368, 18244, 2174, 442, 14602, 765, 4527, 28032 ]
[ 0.087158203125, 0.1563720703125, 0.1405029296875, 0.123779296875, 0.0989990234375, 0.10888671875, 0.1953125, 0.26708984375, 0.209228515625, 0.122314453125, 0.130126953125, 0.1954345703125, 0.2249755859375, 0.0028076171875, 0.08343505859375, 0.09625244140625, 0.076904296875, 0.13708...
embed
14683101_c0
14683101
lisp
0
Title: Incomplete output in Lisp&#x27;s list, # given with list&#x27;s deepness over four Problem title: Incomplete output in Lisp&#x27;s list, # given with list&#x27;s deepness over four Tags: lispworks, lisp, hashtag, list, common-lisp Problem: Incomplete output in Lisp's list, # given with list's deepness over four ...
Incomplete output in Lisp&#x27;s list, # given with list&#x27;s deepness over four Incomplete output in Lisp&#x27;s list, # given with list&#x27;s deepness over four lispworks lisp hashtag list common-lisp Incomplete Lisp CL-USER Incomplete output in Lisp's list, # given with list's deepness over four I'm using Lispwor...
[ 0.0133056640625, 0.015380859375, -0.01483154296875, 0.0064697265625, -0.002044677734375, -0.0028228759765625, 0.00080108642578125, 0.0002765655517578125, 0.0115966796875, -0.00653076171875, 0.008544921875, -0.036376953125, 0.0162353515625, 0.0157470703125, 0.01165771484375, -0.00622558...
[ 360, 277, 131801, 140992, 1261, 7008, 3768, 5303, 34475, 53894, 7432, 645, 22759, 23, 400, 18244, 180154, 39210, 4086, 254, 46323, 1062, 50184, 17368, 10696, 13452, 10176, 63134, 44632, 56, 76199, 678, 77546, 27781, 29786 ]
[ 0.043731689453125, 0.1123046875, 0.177490234375, 0.2257080078125, 0.154296875, 0.22314453125, 0.0745849609375, 0.21240234375, 0.044677734375, 0.18408203125, 0.1009521484375, 0.0535888671875, 0.1556396484375, 0.0152587890625, 0.109619140625, 0.192138671875, 0.2401123046875, 0.101440...
embed
384419_c0
384419
lisp
0
Title: LISP Displaying binary tree level by level Problem title: LISP Displaying binary tree level by level Tags: binary-tree, lisp Problem: LISP Displaying binary tree level by level I have a list that looks like (A (B (C D)) (E (F))) which represents this tree: A / \ B E / \ / C D F How do I print it as (A B E C D F)...
LISP Displaying binary tree level by level LISP Displaying binary tree level by level binary-tree lisp LISP Displaying NIL LISP Displaying binary tree level by level I have a list that looks like (A (B (C D)) (E (F))) which represents this tree: How do I print it as (A B E C D F) ? This is as far as I managed: But it p...
[ 0.0247802734375, 0.0126953125, -0.0135498046875, -0.000507354736328125, 0.01129150390625, 0.0205078125, -0.0166015625, -0.00750732421875, -0.0113525390625, -0.0390625, 0.00506591796875, -0.0185546875, -0.0068359375, 0.00848388671875, -0.00341796875, 0.0159912109375, 0.003265380859375...
[ 16970, 9434, 90045, 2394, 6635, 53201, 17366, 390, 62600, 400, 7008, 541, 16444, 10, 5303, 33342, 1884, 284, 571, 391, 647, 919, 33636, 903, 11249, 28412, 442, 237, 335, 563, 2060, 145755, 3525, 151301, 1543, 32354, 5608, 11814, 20016 ]
[ 0.1275634765625, 0.198974609375, 0.1204833984375, 0.1495361328125, 0.07537841796875, 0.1966552734375, 0.2186279296875, 0.031036376953125, 0.16650390625, 0.092529296875, 0.14453125, 0.03857421875, 0.09552001953125, 0.013916015625, 0.1890869140625, 0.12451171875, 0.07769775390625, 0....
embed
2750421_c0
2750421
lisp
0
Title: What type of lambda calculus would Lisp loosely be an example of? Problem title: What type of lambda calculus would Lisp loosely be an example of? Tags: lambda-calculus, lisp, type-theory Problem: What type of lambda calculus would Lisp loosely be an example of? I'm trying to get a better grip on how types come ...
What type of lambda calculus would Lisp loosely be an example of? What type of lambda calculus would Lisp loosely be an example of? lambda-calculus lisp type-theory What Lisp What type of lambda calculus would Lisp loosely be an example of? I'm trying to get a better grip on how types come into play in lambda calculus....
[ 0.02783203125, 0.012451171875, 0.005615234375, 0.0013275146484375, -0.0031280517578125, -0.006134033203125, 0.015625, 0.00634765625, -0.006134033203125, 0.007354736328125, -0.011474609375, -0.032470703125, -0.0017852783203125, -0.01129150390625, -0.01708984375, 0.0177001953125, -0.00...
[ 10644, 21, 6492, 85, 44805, 223, 1261, 7008, 1428, 27781, 2806, 6827, 94739, 400, 2347, 30675, 4865, 5078, 52895, 11301, 154453, 84079, 46876, 42518, 51, 50986, 242554 ]
[ 0.1744384765625, 0.018768310546875, 0.1282958984375, 0.0885009765625, 0.184326171875, 0.1307373046875, 0.1536865234375, 0.2318115234375, 0.06353759765625, 0.1502685546875, 0.01910400390625, 0.08477783203125, 0.09552001953125, 0.10748291015625, 0.04266357421875, 0.0285797119140625, 0....
embed
63878830_c0
63878830
lisp
0
Title: In Lisp/Racket/Scheme how is it possible to have an argument named `list`? Problem title: In Lisp/Racket/Scheme how is it possible to have an argument named `list`? Tags: scheme, racket, lisp, function-call, arguments Problem: In Lisp/Racket/Scheme how is it possible to have an argument named `list`? Isn’t list ...
In Lisp/Racket/Scheme how is it possible to have an argument named `list`? In Lisp/Racket/Scheme how is it possible to have an argument named `list`? scheme racket lisp function-call arguments Lisp Racket Scheme In Lisp/Racket/Scheme how is it possible to have an argument named `list`? Isn’t list a keyword to create a ...
[ 0.0157470703125, 0.031494140625, 0.000919342041015625, -0.00006723403930664062, -0.007232666015625, 0.01123046875, 0.005828857421875, 0.00122833251953125, -0.0079345703125, 0.010498046875, 0.00567626953125, -0.0224609375, 0.002349853515625, 0.01123046875, 0.000522613525390625, -0.00236...
[ 1261, 7008, 12248, 27853, 25452, 12549, 3642, 7722, 765, 10750, 24, 4806, 6562, 150370, 673, 400, 32354, 85763, 2552, 34702, 142, 5303, 166117, 28282, 3525, 23, 14373, 35839, 2684, 56037, 46876, 41925, 37223, 53418, 11814, 123055, 5361, 31635...
[ 0.1485595703125, 0.2210693359375, 0.044097900390625, 0.1429443359375, 0.119384765625, 0.1346435546875, 0.05255126953125, 0.1409912109375, 0.099609375, 0.289794921875, 0.0887451171875, 0.030731201171875, 0.2578125, 0.1268310546875, 0.0278472900390625, 0.0924072265625, 0.07568359375, ...
embed
11407544_c0
11407544
lisp
0
Title: Listing source dependencies Problem title: Listing source dependencies Tags: java, lisp, python Problem: Listing source dependencies What is the degree of source code dependency that can be resolved by examining at the source code for the following programming languages -- Java, Python and Lisp. For example, can...
Listing source dependencies Listing source dependencies java lisp python Listing Listing source dependencies What is the degree of source code dependency that can be resolved by examining at the source code for the following programming languages -- Java, Python and Lisp. For example, can I say for sure by looking at a...
[ 0.0135498046875, 0.0167236328125, 0.003936767578125, 0.00836181640625, -0.004974365234375, 0.006378173828125, -0.0245361328125, 0.004974365234375, 0.0135498046875, -0.008544921875, -0.0059814453125, -0.043212890625, -0.01080322265625, 0.037109375, 0.0025634765625, 0.006439208984375, ...
[ 32036, 214, 31344, 42548, 117538, 79, 330, 400, 7008, 17198, 50828, 79385, 18151, 27771, 831, 103608, 42276, 14653, 99, 100, 25632, 56037, 449, 46876, 41925, 4, 145581, 136, 1261, 5154, 9077, 16487, 42486, 102158, 756, 60270, 63805, 23, 119...
[ 0.1976318359375, 0.09429931640625, 0.22314453125, 0.2457275390625, 0.1629638671875, 0.08233642578125, 0.1304931640625, 0.09765625, 0.225830078125, 0.0802001953125, 0.1470947265625, 0.1337890625, 0.1768798828125, 0.12255859375, 0.0498046875, 0.174560546875, 0.1324462890625, 0.083129...
embed
21634982_c0
21634982
lisp
0
Title: How to get a list of all builtins? Problem title: How to get a list of all builtins? Tags: lisp, common-lisp Problem: How to get a list of all builtins? Learning Lisp from Practical Common Lisp I'm constantly coming across new builtin form s (please correct me if haven't used the right terminology). The latest o...
How to get a list of all builtins? How to get a list of all builtins? lisp common-lisp How __builtins__ How to get a list of all builtins? Learning Lisp from Practical Common Lisp I'm constantly coming across new builtin form s (please correct me if haven't used the right terminology). The latest one was 'character . S...
[ -0.001617431640625, -0.0059814453125, 0.0167236328125, 0.020751953125, -0.01019287109375, 0.0341796875, 0.01470947265625, 0.008544921875, 0.00116729736328125, -0.034912109375, 0.023681640625, -0.01470947265625, -0.00130462646484375, -0.01544189453125, -0.009765625, 0.0032196044921875, ...
[ 11249, 2046, 10, 5303, 111, 756, 88303, 5425, 47, 400, 7008, 39210, 4086, 254, 978, 24908, 114344, 1261, 109613, 151301, 178308, 36880, 73, 3173, 91, 9254, 2263, 720, 75101, 70, 9851, 8305, 3687, 145581, 5402, 132, 6069 ]
[ 0.055419921875, 0.1029052734375, 0.04425048828125, 0.184814453125, 0.08758544921875, 0.142822265625, 0.208251953125, 0.2056884765625, 0.005279541015625, 0.0943603515625, 0.1785888671875, 0.1063232421875, 0.0821533203125, 0.1094970703125, 0.0654296875, 0.123779296875, 0.06085205078125...
embed
7066604_c1
7066604
lisp
1
-lambda-list ,@(if body body `(if (and ,@(mapcar (lambda (e) (car e)) funspec-list)) (call-next-method))))) But problem is that it will overwrite the (defmethod gname :after (s (g group)) ...) (If it has any, I can verify it if it has one or not,) But I want it to work for any object whether it has that method to overw...
-lambda-list ,@(if body body `(if (and ,@(mapcar (lambda (e) (car e)) funspec-list)) (call-next-method))))) But problem is that it will overwrite the (defmethod gname :after (s (g group)) ...) (If it has any, I can verify it if it has one or not,) But I want it to work for any object whether it has that method to overw...
[ 0.00811767578125, 0.022216796875, 0.00191497802734375, 0.01177978515625, 0.001922607421875, 0.00909423828125, -0.003387451171875, 0.01953125, 0.00823974609375, -0.0166015625, -0.003509521484375, -0.0184326171875, 0.0010528564453125, 0.015625, 0.00148773193359375, -0.0169677734375, 0....
[ 20, 143, 6492, 85, 6562, 981, 3190, 14361, 2940, 62346, 3284, 13, 28, 7477, 16711, 85763, 86, 29062, 1928, 7352, 80126, 2967, 442, 1221, 645, 434, 18781, 112, 420, 706, 11627, 46327, 7, 177, 21115, 1556, 493, 40383, 3444, 4488, 2499, ...
[ 0.0153961181640625, 0.09197998046875, 0.21337890625, 0.1409912109375, 0.259521484375, 0.064697265625, 0.10748291015625, 0.161865234375, 0.0263214111328125, 0.06378173828125, 0.12158203125, 0.045806884765625, 0.051483154296875, 0.1365966796875, 0.1546630859375, 0.121337890625, 0.01263...
embed
39822470_c0
39822470
lisp
0
Title: multiplying list of items by a certain number &#x27;x&#x27; Problem title: multiplying list of items by a certain number &#x27;x&#x27; Tags: scheme, racket, multiplication, lisp, cdr Problem: multiplying list of items by a certain number 'x' How would you write a procedure that multiplies each element of the lis...
multiplying list of items by a certain number &#x27;x&#x27; multiplying list of items by a certain number &#x27;x&#x27; scheme racket multiplication lisp cdr multiplying list of items by a certain number 'x' How would you write a procedure that multiplies each element of the list with a given number (x).If I give a lis...
[ -0.01324462890625, 0.0174560546875, 0.01068115234375, 0.00799560546875, -0.01055908203125, 0.036865234375, -0.01031494140625, 0.009521484375, 0.004852294921875, -0.038330078125, -0.005157470703125, -0.033203125, -0.006072998046875, 0.005828857421875, -0.0062255859375, 0.0133056640625, ...
[ 6024, 62479, 214, 5303, 55769, 390, 24233, 14012, 3768, 425, 150370, 673, 27853, 127664, 400, 7008, 56329, 42, 111, 11249, 2806, 33022, 50491, 118126, 90, 12638, 12830, 678, 34475, 8337, 41600, 116, 8439, 136, 1022, 76067, 5608, 30646, 6896...
[ 0.15478515625, 0.1881103515625, 0.023590087890625, 0.2080078125, 0.1959228515625, 0.059844970703125, 0.06414794921875, 0.1790771484375, 0.08673095703125, 0.1298828125, 0.1556396484375, 0.04833984375, 0.180908203125, 0.1749267578125, 0.0673828125, 0.1307373046875, 0.005126953125, 0....
embed
2205121_c0
2205121
lisp
0
Title: emacs programmatically change window size Problem title: emacs programmatically change window size Tags: lisp, window, size, emacs, buffer Problem: emacs programmatically change window size I would like to implement automatic collapse of compilation buffer to small size (but not close at a delete windows), such ...
emacs programmatically change window size emacs programmatically change window size lisp window size emacs buffer emacs programmatically change window size I would like to implement automatic collapse of compilation buffer to small size (but not close at a delete windows), such that upon successful compilation to windo...
[ 0.0009613037109375, 0.00799560546875, 0.016845703125, -0.00616455078125, -0.0267333984375, 0.0047607421875, -0.008544921875, -0.017333984375, 0.001617431640625, 0.006591796875, 0.006622314453125, 0.015625, -0.01177978515625, -0.0091552734375, 0.0084228515625, -0.0169677734375, -0.002...
[ 352, 2263, 7, 11720, 18, 71407, 15549, 76896, 13267, 400, 7008, 373, 18234, 2806, 1884, 29479, 101038, 3365, 127966, 98352, 47, 19336, 8789, 959, 20903, 154109, 54825, 54799, 65771, 90978, 3678, 15440, 2046, 123759, 56, 7612, 30646, 831, 75...
[ 0.1339111328125, 0.1572265625, 0.0853271484375, 0.1964111328125, 0.0806884765625, 0.0277557373046875, 0.170166015625, 0.185791015625, 0.182861328125, 0.119140625, 0.1837158203125, 0.084228515625, 0.1678466796875, 0.0173187255859375, 0.064453125, 0.0882568359375, 0.159423828125, 0.1...
embed
3636980_c1
3636980
lisp
1
with-standard-io-syntax (print *db* out)))) (defun loadDB (fileName) (with-open-file (in fileName) (with-standard-io-syntax (setf *db* (read in))))) (defun select (selectorFn) (remove-if-not selectorFn *db*)) (defun artistSelector (artist) #'(lambda (cd) (equal (getf cd :artist) artist))) And query the 'database' using...
with-standard-io-syntax (print *db* out)))) (defun loadDB (fileName) (with-open-file (in fileName) (with-standard-io-syntax (setf *db* (read in))))) (defun select (selectorFn) (remove-if-not selectorFn *db*)) (defun artistSelector (artist) #'(lambda (cd) (equal (getf cd :artist) artist))) And query the 'database' using...
[ 0.01373291015625, 0.0059814453125, 0.01025390625, 0.0125732421875, -0.022216796875, 0.01220703125, 0.004852294921875, 0.00531005859375, 0.0123291015625, -0.01263427734375, -0.0208740234375, -0.00482177734375, -0.0103759765625, -0.021728515625, -0.006622314453125, -0.00738525390625, -...
[ 678, 66589, 846, 12654, 86531, 35662, 48073, 1810, 80126, 112, 16498, 72367, 39463, 29822, 163612, 76228, 59636, 11435, 3509, 420, 39116, 23, 36849, 184, 187075, 19, 26973, 3190, 10869, 40, 22104, 4233, 3960, 1419, 6492, 85, 71574, 71723, 3...
[ 0.1385498046875, 0.211669921875, 0.2255859375, 0.131591796875, 0.15966796875, 0.1427001953125, 0.10504150390625, 0.0721435546875, 0.006195068359375, 0.0830078125, 0.140625, 0.14111328125, 0.18212890625, 0.0869140625, 0.1177978515625, 0.07080078125, 0.1229248046875, 0.09002685546875...
embed
8616562_c0
8616562
lisp
0
Title: Lisp initialize variable with list Problem title: Lisp initialize variable with list Tags: lisp Problem: Lisp initialize variable with list I'm learning Lisp. I'm implementing solution to some relatively simple problem. I'm thinking of list that represents initial state of problem like this ((0 1) (2 3) (5 4)) I...
Lisp initialize variable with list Lisp initialize variable with list lisp Lisp Lisp initialize variable with list I'm learning Lisp. I'm implementing solution to some relatively simple problem. I'm thinking of list that represents initial state of problem like this I want to create variable and assign that list to it....
[ 0.0157470703125, 0.01019287109375, -0.002777099609375, 0.0118408203125, -0.006866455078125, 0.01055908203125, -0.007659912109375, 0.0030364990234375, -0.01129150390625, -0.005859375, 0.006317138671875, -0.000759124755859375, 0.006561279296875, 0.0196533203125, -0.009521484375, 0.008544...
[ 1261, 7008, 61475, 20650, 77336, 678, 5303, 400, 52080, 29479, 29806, 35845, 8781, 2967, 47644, 33636, 11341, 3444, 28282, 95486, 47, 37842, 23742, 18, 9969, 1340, 43240, 5792, 4989, 11522, 3917 ]
[ 0.1397705078125, 0.19091796875, 0.1829833984375, 0.062225341796875, 0.2734375, 0.13232421875, 0.236572265625, 0.1136474609375, 0.043243408203125, 0.0743408203125, 0.062744140625, 0.0226593017578125, 0.0614013671875, 0.1385498046875, 0.055755615234375, 0.122802734375, 0.118408203125, ...
embed
50474355_c0
50474355
lisp
0
Title: Lisp - Split Recursive Problem title: Lisp - Split Recursive Tags: lisp, recursion, common-lisp Problem: Lisp - Split Recursive I was trying to make a recursive function to split a list into two lists according the number of elements one wants. Ex: (split 3 '(1 3 5 7 9)) ((1 3 5) (7 9)) (split 7 '(1 3 5 7 9)) ((...
Lisp - Split Recursive Lisp - Split Recursive lisp recursion common-lisp Lisp Split Recursive Lisp - Split Recursive I was trying to make a recursive function to split a list into two lists according the number of elements one wants. My code is like this: I don't find a way to join the first list elements and return th...
[ -0.015625, 0.0257568359375, 0.000186920166015625, 0.001312255859375, -0.0206298828125, 0.0279541015625, -0.0126953125, 0.0203857421875, 0.01513671875, -0.004730224609375, 0.0025787353515625, -0.01495361328125, -0.0142822265625, 0.0103759765625, 0.0191650390625, 0.0086669921875, 0.004...
[ 1261, 7008, 46474, 853, 48650, 5844, 400, 195625, 1830, 39210, 4086, 254, 31577, 32354, 65450, 5303, 3934, 6626, 59499, 14012, 80854, 86171, 18151, 7413, 3917, 33284, 5117, 30646, 17932 ]
[ 0.11614990234375, 0.18115234375, 0.2044677734375, 0.0198211669921875, 0.1566162109375, 0.1334228515625, 0.0904541015625, 0.1884765625, 0.026824951171875, 0.08245849609375, 0.0601806640625, 0.1329345703125, 0.050811767578125, 0.1322021484375, 0.209228515625, 0.1617431640625, 0.0927124...
embed
41599987_c0
41599987
lisp
0
Title: Substitutions in Common Lisp Problem title: Substitutions in Common Lisp Tags: lisp, common-lisp Problem: Substitutions in Common Lisp I’m trying to write a function with two arguments of this type: substitutions (list_one, list_two) list_one has always this form (letters can change according to the input): (1 (...
Substitutions in Common Lisp Substitutions in Common Lisp lisp common-lisp Substitutions Common Lisp list_one list_two Substitutions in Common Lisp I’m trying to write a function with two arguments of this type: list_one has always this form (letters can change according to the input): list_two has always this form (nu...
[ -0.004364013671875, 0.016845703125, 0.00640869140625, 0.0230712890625, 0.00732421875, 0.0213623046875, -0.011962890625, 0.0235595703125, 0.01239013671875, 0.0022735595703125, -0.00531005859375, 0.00762939453125, -0.00112152099609375, 0.0216064453125, -0.0118408203125, -0.00384521484375...
[ 8273, 13480, 5256, 23, 151301, 1261, 7008, 400, 39210, 4086, 254, 5303, 3630, 55547, 31577, 33022, 32354, 6626, 10750, 10644, 1556, 11343, 903, 3173, 63049, 831, 15549, 59499, 107730, 2606, 1297, 3444, 161740, 13, 3917, 4358 ]
[ 0.1524658203125, 0.21142578125, 0.0504150390625, 0.06707763671875, 0.161865234375, 0.1573486328125, 0.1739501953125, 0.1134033203125, 0.1318359375, 0.0943603515625, 0.1273193359375, 0.1861572265625, 0.1705322265625, 0.2369384765625, 0.0343017578125, 0.0308380126953125, 0.143920898437...
embed
3487417_c0
3487417
lisp
0
Title: What is it about a single namespace that leads to unhygienic macros? (in LISP) Problem title: What is it about a single namespace that leads to unhygienic macros? (in LISP) Tags: lisp, hygiene, clojure, macros, scheme Problem: What is it about a single namespace that leads to unhygienic macros? (in LISP) Some cl...
What is it about a single namespace that leads to unhygienic macros? (in LISP) What is it about a single namespace that leads to unhygienic macros? (in LISP) lisp hygiene clojure macros scheme What LISP What is it about a single namespace that leads to unhygienic macros? (in LISP) Some claim that a single namespace in ...
[ -0.00634765625, 0.0223388671875, 0.01123046875, 0.01806640625, -0.006439208984375, 0.0277099609375, 0.00982666015625, -0.0078125, -0.0002536773681640625, -0.0159912109375, -0.005218505859375, -0.003143310546875, -0.007476806640625, -0.0247802734375, -0.01190185546875, -0.00364685058593...
[ 1672, 11001, 210716, 37105, 51, 3038, 16857, 6402, 111789, 7, 16970, 9434, 442, 400, 7008, 99824, 13, 20450, 461, 107, 150370, 4865, 63043, 12303, 7560, 735, 1151, 20583, 4650, 43721, 19441, 87758, 48716 ]
[ 0.02093505859375, 0.1915283203125, 0.3046875, 0.10345458984375, 0.0989990234375, 0.1376953125, 0.174560546875, 0.1029052734375, 0.2059326171875, 0.07666015625, 0.153076171875, 0.25146484375, 0.009185791015625, 0.1298828125, 0.1846923828125, 0.276123046875, 0.09552001953125, 0.07989...
embed
5981116_c0
5981116
lisp
0
Title: Lisp language beginner details Problem title: Lisp language beginner details Tags: artificial-intelligence, lisp Problem: Lisp language beginner details I wish to learn Lisp as I am going towards Artificial Intelligence (AI). Can somebody share some good book names of tutorials which covers good amount of Lisp d...
Lisp language beginner details Lisp language beginner details artificial-intelligence lisp Lisp Lisp language beginner details I wish to learn Lisp as I am going towards Artificial Intelligence (AI). Can somebody share some good book names of tutorials which covers good amount of Lisp details? Just googling it, but did...
[ 0.0277099609375, 0.0244140625, 0.007598876953125, 0.0205078125, -0.00927734375, 0.000286102294921875, 0.0035552978515625, -0.00537109375, 0.007171630859375, -0.033447265625, 0.0203857421875, -0.0029144287109375, -0.002197265625, -0.001007080078125, 0.004638671875, -0.000690460205078125...
[ 1261, 7008, 46876, 9842, 1679, 41653, 66733, 130687, 400, 87, 32599, 47, 30698, 237, 7730, 98186, 231996, 157075, 11388, 4171, 176256, 12008, 4127, 12877, 123055, 57143, 29256, 41170, 1663, 18, 22443, 10975, 56065, 56037, 449, 5, 17777, 642, ...
[ 0.223876953125, 0.284912109375, 0.2142333984375, 0.1488037109375, 0.1024169921875, 0.1954345703125, 0.151123046875, 0.1461181640625, 0.1866455078125, 0.015899658203125, 0.1171875, 0.029388427734375, 0.1468505859375, 0.00286865234375, 0.010772705078125, 0.087646484375, 0.1510009765625...
embed
12810641_c1
12810641
lisp
1
(cond (empty? coll) nil (= 0 i) nil :else (cons (subseq-by-nth coll 0 n) (partition-by-nth (rest coll) n (dec i)))))) I'm not completely happy with the partition-by-nth function having multiple arity simply for the recursion, but couldn't see another way. This seems to work just fine with all the test cases. Is this a...
(cond (empty? coll) nil (= 0 i) nil :else (cons (subseq-by-nth coll 0 n) (partition-by-nth (rest coll) n (dec i)))))) I'm not completely happy with the partition-by-nth function having multiple arity simply for the recursion, but couldn't see another way. This seems to work just fine with all the test cases. Is this a...
[ -0.0191650390625, 0.00098419189453125, 0.0013885498046875, -0.006011962890625, -0.013916015625, 0.0020294189453125, 0.00150299072265625, -0.0196533203125, -0.003631591796875, 0.00897216796875, 0.00093841552734375, -0.0010528564453125, -0.003936767578125, -0.017822265625, -0.0074157714843...
[ 2271, 71, 33548, 939, 122907, 17324, 78690, 757, 17, 5557, 25553, 22144, 184, 864, 1272, 19, 927, 653, 15866, 1363, 56644, 50718, 167089, 959, 64557, 17723, 2878, 32354, 19441, 48716, 187, 2481, 42856, 100, 195625, 1830, 3917, 4488, 5885, ...
[ 0.0694580078125, 0.095947265625, 0.10198974609375, 0.096435546875, 0.1595458984375, 0.2005615234375, 0.03912353515625, 0.099365234375, 0.08343505859375, 0.074951171875, 0.1602783203125, 0.060760498046875, 0.06787109375, 0.0743408203125, 0.1168212890625, 0.0975341796875, 0.140625, 0...
embed
18949435_c0
18949435
lisp
0
Title: Calling a function whose arguments should be structure instances Problem title: Calling a function whose arguments should be structure instances Tags: common-lisp, clisp, lisp Problem: Calling a function whose arguments should be structure instances Given the following code, what would by the syntax for calling ...
Calling a function whose arguments should be structure instances Calling a function whose arguments should be structure instances common-lisp clisp lisp Calling point1 point2 Calling a function whose arguments should be structure instances Given the following code, what would by the syntax for calling the function dist...
[ 0.0162353515625, -0.004852294921875, 0.000675201416015625, -0.01287841796875, 0.00592041015625, 0.006622314453125, 0.00860595703125, 0.0045166015625, 0.0052490234375, -0.03515625, -0.0017242431640625, -0.00142669677734375, 0.0027618408203125, -0.0206298828125, 0.006988525390625, -0.000...
[ 26265, 214, 32354, 124901, 10750, 7, 5608, 45646, 110527, 186, 39210, 4086, 254, 95701, 7008, 400, 6275, 418, 304, 18151, 2806, 6002, 86531, 159029, 45, 271 ]
[ 0.1651611328125, 0.056610107421875, 0.20849609375, 0.07293701171875, 0.228759765625, 0.021087646484375, 0.09881591796875, 0.2281494140625, 0.21142578125, 0.00795745849609375, 0.08416748046875, 0.065673828125, 0.143310546875, 0.04705810546875, 0.169189453125, 0.065673828125, 0.1203613...
embed
3437103_c0
3437103
lisp
0
Title: Is it possible to implement coroutines using only LISP primitives? Problem title: Is it possible to implement coroutines using only LISP primitives? Tags: coroutine, continuation-passing, lisp, scheme Problem: Is it possible to implement coroutines using only LISP primitives? First, I'm a LISP newbie. What I wan...
Is it possible to implement coroutines using only LISP primitives? Is it possible to implement coroutines using only LISP primitives? coroutine continuation-passing lisp scheme only LISP Is it possible to implement coroutines using only LISP primitives? First, I'm a LISP newbie. What I want to get is a cooperative micr...
[ 0.00360107421875, 0.0284423828125, -0.005157470703125, 0.00146484375, -0.003570556640625, -0.0026702880859375, 0.0189208984375, 0.006622314453125, -0.0030364990234375, -0.040283203125, -0.01434326171875, 0.00347900390625, 0.00107574462890625, 0.00970458984375, 0.01458740234375, 0.01379...
[ 7722, 29479, 88909, 48635, 90, 17368, 4734, 16970, 9434, 128489, 34, 10325, 9454, 1363, 13409, 400, 7008, 150370, 9014, 3444, 2046, 57476, 11948, 39116, 214, 60213, 21647, 34702, 282, 8060, 208124, 1543, 5256, 15190 ]
[ 0.18505859375, 0.2015380859375, 0.145263671875, 0.242919921875, 0.1480712890625, 0.0909423828125, 0.090576171875, 0.1121826171875, 0.2012939453125, 0.16259765625, 0.0830078125, 0.2286376953125, 0.1837158203125, 0.0241851806640625, 0.09637451171875, 0.0882568359375, 0.1337890625, 0....
embed
36572113_c1
36572113
lisp
1
a list of coordinates of length n. Use repeatedly to generate an in nite sequence of coord calls; use take on the result to take the rst n results. is-hit? - takes a list containing one dart's coordinates and returns whether that dart falls inside our quarter-circle. Hint: calculate the distance from the origin to the...
a list of coordinates of length n. Use repeatedly to generate an in nite sequence of coord calls; use take on the result to take the rst n results. is-hit? - takes a list containing one dart's coordinates and returns whether that dart falls inside our quarter-circle. Hint: calculate the distance from the origin to the...
[ 0.0040283203125, 0.007781982421875, 0.011962890625, -0.0101318359375, -0.01214599609375, 0.01019287109375, 0.02978515625, -0.00002968311309814453, -0.013916015625, -0.021484375, -0.0179443359375, 0.01611328125, -0.00872802734375, -0.004180908203125, -0.01348876953125, -0.008056640625, ...
[ 10, 5303, 176866, 90, 140909, 653, 36836, 119140, 139392, 23, 300, 67, 944, 552, 6651, 11782, 5646, 98, 16750, 30541, 50339, 5, 83, 9, 11400, 32, 51776, 70541, 1632, 1011, 18, 30646, 36766, 123867, 46132, 2446, 128274, 82063, 133, 19895, ...
[ 0.009979248046875, 0.16357421875, 0.267822265625, 0.1220703125, 0.1268310546875, 0.10235595703125, 0.03497314453125, 0.064697265625, 0.09600830078125, 0.03857421875, 0.055938720703125, 0.1370849609375, 0.0377197265625, 0.1402587890625, 0.2509765625, 0.15869140625, 0.09033203125, 0....
embed
53969963_c1
53969963
lisp
1
) value) ((setf (nth (- value 100) mem) addendo) (setf (+ acc addendo) newacc)))) When i compile and load the following errors appear: **++++Error in One-Instruction Trying to bind a non symbol, (state:ACC acc :PC pc :MEM mem :IN in :OUT out :FLAG flag) and same happens for the "do-add". So it's wrong the way i pass st...
) value) ((setf (nth (- value 100) mem) addendo) (setf (+ acc addendo) newacc)))) When i compile and load the following errors appear: **++++Error in One-Instruction Trying to bind a non symbol, (state:ACC acc :PC pc :MEM mem :IN in :OUT out :FLAG flag) and same happens for the "do-add". So it's wrong the way i pass st...
[ -0.01043701171875, -0.0216064453125, -0.00090789794921875, 0.0247802734375, -0.0123291015625, 0.0235595703125, -0.017578125, 0.00933837890625, 0.017578125, -0.02392578125, 0.01251220703125, 0.005859375, -0.0145263671875, 0.0087890625, 0.00823974609375, -0.00909423828125, 0.0024566650...
[ 1388, 34292, 60494, 3509, 420, 19, 927, 9, 805, 7199, 15190, 4017, 16, 22183, 50015, 3525, 10060, 80126, 17, 9969, 1340, 72367, 25632, 18499, 108975, 16459, 1328, 86409, 18468, 31611, 23, 6561, 4153, 36716, 1830, 40858, 68557, 351, 26582, ...
[ 0.033294677734375, 0.2012939453125, 0.068115234375, 0.12890625, 0.175537109375, 0.005096435546875, 0.115966796875, 0.084716796875, 0.169921875, 0.1937255859375, 0.1331787109375, 0.2470703125, 0.00921630859375, 0.09033203125, 0.11962890625, 0.10076904296875, 0.1090087890625, 0.04544...
embed
43333961_c0
43333961
lisp
0
Title: How to store lispbuilder-sdl:colors in a list? Problem title: How to store lispbuilder-sdl:colors in a list? Tags: sdl, lisp, common-lisp Problem: How to store lispbuilder-sdl:colors in a list? I trying to store two colors in list: (defparameter *colist* '(sdl:*black* sdl:*red*)) Printing sdl:color will return c...
How to store lispbuilder-sdl:colors in a list? How to store lispbuilder-sdl:colors in a list? sdl lisp common-lisp How lispbuilder-sdl:colors LISPBUILDER-SDL:COLOR LISPBUILDER-SDL BLACK How to store lispbuilder-sdl:colors in a list? I trying to store two colors in list: Printing sdl:color will return color in sbcl cons...
[ 0.004302978515625, -0.01611328125, -0.007171630859375, 0.013916015625, -0.00592041015625, 0.015869140625, -0.01116943359375, 0.0303955078125, -0.016357421875, -0.002777099609375, -0.0008392333984375, -0.00946044921875, 0.012451171875, 0.000774383544921875, -0.004180908203125, -0.006072...
[ 11249, 47, 4343, 400, 7008, 177149, 56, 7, 20469, 12, 46133, 23, 5303, 91, 39210, 4086, 254, 16970, 9434, 15639, 16444, 18044, 294, 27502, 9688, 52533, 210920, 31577, 6626, 104988, 39754, 30646, 10576, 275, 34937, 130250, 28412, 1295, 12921...
[ 0.06689453125, 0.041168212890625, 0.2061767578125, 0.09765625, 0.1541748046875, 0.194091796875, 0.103515625, 0.03570556640625, 0.175048828125, 0.045318603515625, 0.2305908203125, 0.066162109375, 0.2027587890625, 0.03399658203125, 0.090576171875, 0.054656982421875, 0.1358642578125, ...
embed
14930091_c0
14930091
lisp
0
Title: Macro for more than 1 line of code Problem title: Macro for more than 1 line of code Tags: lisp, common-lisp Problem: Macro for more than 1 line of code I'm learning the macro system of Common Lisp and suddenly found a problem (defun hello () (format t "hello ~%")) (defun world () (format t "world ~%")) (defmacr...
Macro for more than 1 line of code Macro for more than 1 line of code lisp common-lisp Macro call-2-func func1 func2 macroexpand-1 WORLD Macro for more than 1 line of code I'm learning the macro system of Common Lisp and suddenly found a problem Well. Why can't I generate 2 LoC from only one macro? How can I work aroun...
[ 0.0123291015625, -0.0010223388671875, -0.00958251953125, 0.039794921875, 0.0029449462890625, 0.022705078125, 0.00677490234375, -0.01080322265625, 0.01153564453125, -0.046142578125, -0.013671875, -0.01104736328125, 0.005462646484375, -0.00830078125, -0.0126953125, -0.025390625, -0.006...
[ 4727, 516, 100, 1286, 3501, 106, 13315, 18151, 400, 7008, 39210, 4086, 254, 11782, 5428, 16498, 7477, 304, 111789, 83613, 2940, 5759, 99972, 111, 52080, 5426, 151301, 1261, 2967, 44084, 831, 18, 139392, 116, 2091, 441, 1295, 4734, 1632, 4...
[ 0.157470703125, 0.2073974609375, 0.09381103515625, 0.1160888671875, 0.0867919921875, 0.116455078125, 0.151123046875, 0.1844482421875, 0.0975341796875, 0.2022705078125, 0.1146240234375, 0.0767822265625, 0.154296875, 0.09735107421875, 0.126220703125, 0.0963134765625, 0.07330322265625, ...
embed
25606066_c0
25606066
lisp
0
Title: How to reverse the order of elements of a list in Scheme Problem title: How to reverse the order of elements of a list in Scheme Tags: racket, scheme, lisp Problem: How to reverse the order of elements of a list in Scheme I got a function to reverse the order of the elements in a list, such as (define (rvsl sequ...
How to reverse the order of elements of a list in Scheme How to reverse the order of elements of a list in Scheme racket scheme lisp How Scheme How to reverse the order of elements of a list in Scheme I got a function to reverse the order of the elements in a list, such as However, when I ran it in DrRacket with the in...
[ -0.0286865234375, 0.037109375, -0.00860595703125, 0.01434326171875, 0.000728607177734375, 0.00494384765625, -0.0152587890625, 0.0054931640625, 0.00885009765625, -0.0230712890625, 0.002105712890625, -0.0030517578125, -0.00007152557373046875, -0.004486083984375, 0.00311279296875, -0.0020...
[ 11249, 47, 39531, 184, 70, 12989, 111, 80854, 5303, 23, 34702, 282, 673, 27853, 150370, 400, 7008, 32354, 13028, 1773, 12248, 107730, 30745, 903, 25647, 86869 ]
[ 0.1029052734375, 0.0684814453125, 0.221435546875, 0.182373046875, 0.0660400390625, 0.235107421875, 0.077392578125, 0.192626953125, 0.201904296875, 0.0655517578125, 0.1678466796875, 0.17919921875, 0.0936279296875, 0.197265625, 0.206787109375, 0.056365966796875, 0.1456298828125, 0.11...
embed
5691342_c0
5691342
lisp
0
Title: What is the fastest scheme implementation? Problem title: What is the fastest scheme implementation? Tags: lisp, scheme Problem: What is the fastest scheme implementation? Obviously, that will depend on what you want to do: numerical analysis, threading, databases, etc. I've seen the benchmarks; Larceny and Bigl...
What is the fastest scheme implementation? What is the fastest scheme implementation? lisp scheme What What is the fastest scheme implementation? Obviously, that will depend on what you want to do: numerical analysis, threading, databases, etc. I've seen the benchmarks; Larceny and Bigloo seem to come up ahead. Is ther...
[ 0.005462646484375, -0.006134033203125, 0.009521484375, 0.001617431640625, -0.0084228515625, -0.01055908203125, 0.007415771484375, -0.01019287109375, -0.01177978515625, -0.007720947265625, 0.00701904296875, -0.0031280517578125, -0.02197265625, -0.00341796875, -0.007080078125, -0.0051269...
[ 4865, 83, 70, 4271, 525, 150370, 208124, 400, 7008, 1221, 56566, 3444, 54744, 114137, 86997, 214, 63399, 51592, 240057, 37910, 299, 136, 14195, 47673, 48903, 47, 1380, 1257, 99255, 34702, 282, 51339, 28875, 5299, 40368, 12921, 28282, 18151, ...
[ 0.040863037109375, 0.0677490234375, 0.101318359375, 0.2037353515625, 0.1851806640625, 0.26611328125, 0.2491455078125, 0.1009521484375, 0.197265625, 0.004364013671875, 0.0606689453125, 0.0258331298828125, 0.054931640625, 0.1373291015625, 0.1026611328125, 0.0108642578125, 0.07653808593...
embed
38300721_c0
38300721
lisp
0
Title: What does this Lisp code do? Problem title: What does this Lisp code do? Tags: lisp, common-lisp Problem: What does this Lisp code do? There are a large number of web site which praise Lisp but I came across this page https://matthias.benkard.de/journal/110 which has this code: ((lambda([])((lambda(|| |()| |(| |...
What does this Lisp code do? What does this Lisp code do? lisp common-lisp What Lisp What does this Lisp code do? There are a large number of web site which praise Lisp but I came across this page https://matthias.benkard.de/journal/110 which has this code: What does this code do? I am reluctant to try this code myself...
[ 0.0091552734375, 0.0272216796875, -0.016357421875, 0.01104736328125, -0.01446533203125, 0.0225830078125, -0.00457763671875, 0.018798828125, 0.0003833770751953125, -0.027099609375, -0.015625, -0.0186767578125, -0.0118408203125, 0.007537841796875, 0.004150390625, -0.000560760498046875, ...
[ 4865, 14602, 903, 1261, 7008, 18151, 54, 400, 39210, 4086, 254, 21334, 14012, 1467, 1764, 1645, 3075, 36880, 9191, 162, 1153, 71, 112, 188131, 36053, 52081, 18211, 9790, 141956, 2367, 20653, 93192, 59121, 7071, 36917, 23937, 756 ]
[ 0.108642578125, 0.12060546875, 0.112060546875, 0.180908203125, 0.229736328125, 0.218017578125, 0.13671875, 0.13671875, 0.144775390625, 0.1363525390625, 0.1693115234375, 0.009063720703125, 0.0197906494140625, 0.000457763671875, 0.01336669921875, 0.0872802734375, 0.068115234375, 0.03...
embed
36518387_c0
36518387
lisp
0
Title: Lisp using And in a Cond statement Problem title: Lisp using And in a Cond statement Tags: lisp Problem: Lisp using And in a Cond statement having a little trouble correctly using "cond" in conjunction with "and" in one of my functions: (cond (and (find 'hello actionsems) (find 'formal actionsems)) (print "Chatt...
Lisp using And in a Cond statement Lisp using And in a Cond statement lisp And Lisp Cond Chatterbot Hello Hey Lisp using And in a Cond statement having a little trouble correctly using "cond" in conjunction with "and" in one of my functions: I am told that I am "attempting to take unbound variable "AND". Could someone ...
[ -0.013427734375, 0.02587890625, -0.01611328125, 0.0274658203125, 0.00372314453125, 0.020751953125, 0.0203857421875, 0.01446533203125, -0.01177978515625, 0.00194549560546875, -0.00156402587890625, -0.0269775390625, -0.0029296875, -0.003143310546875, 0.0286865234375, 0.0223388671875, -...
[ 1261, 7008, 17368, 3493, 23, 1657, 71, 63805, 10, 400, 720, 9190, 10176, 63134, 26785, 2271, 17043, 2940, 32354, 30745, 34224, 1916, 5646, 51, 99091, 77336, 45029, 86531, 121742 ]
[ 0.137939453125, 0.17236328125, 0.059295654296875, 0.23828125, 0.0518798828125, 0.1702880859375, 0.161376953125, 0.1605224609375, 0.00009435415267944336, 0.0902099609375, 0.0005288124084472656, 0.095703125, 0.0129241943359375, 0.035858154296875, 0.03582763671875, 0.1451416015625, 0.06...
embed
12996307_c0
12996307
lisp
0
Title: working with lisp functions Problem title: working with lisp functions Tags: lisp, functional-programming, common-lisp Problem: working with lisp functions I am trying to write a function that returns a list of atoms in a list,lets say i have a list which has both atoms and a list in it and when I run the functi...
working with lisp functions working with lisp functions lisp functional-programming common-lisp ATOM working with lisp functions I am trying to write a function that returns a list of atoms in a list,lets say i have a list which has both atoms and a list in it and when I run the function it should return a list of atom...
[ 0.00933837890625, 0.0029144287109375, 0.01519775390625, 0.010986328125, -0.00970458984375, 0.03271484375, 0.0028076171875, 0.01275634765625, -0.00994873046875, -0.02587890625, 0.0177001953125, -0.01171875, -0.004669189453125, 0.0027008056640625, 0.0184326171875, 0.0206298828125, -0.0...
[ 20697, 678, 400, 7008, 32354, 123309, 28966, 39210, 4086, 254, 117032, 31577, 33022, 30646, 5303, 34627, 7, 23, 1974, 15044, 136, 3229, 11675, 5608, 46132, 3444, 9790, 2174, 10750, 16750, 29568, 25647, 1672, 83266, 91067 ]
[ 0.1109619140625, 0.137939453125, 0.1292724609375, 0.223876953125, 0.2017822265625, 0.117919921875, 0.1004638671875, 0.0579833984375, 0.09771728515625, 0.185302734375, 0.20263671875, 0.112060546875, 0.1502685546875, 0.14453125, 0.163330078125, 0.2122802734375, 0.055419921875, 0.0001...
embed
29934035_c0
29934035
lisp
0
Title: Returning from a function inside when statement Problem title: Returning from a function inside when statement Tags: lisp, racket, scheme Problem: Returning from a function inside when statement All I'm trying to do is use a when statement to return a value :( I want the functionality of: if(x) return y And I'm ...
Returning from a function inside when statement Returning from a function inside when statement lisp racket scheme a Returning Returning from a function inside when statement All I'm trying to do is use a when statement to return a value :( I want the functionality of: And I'm trying to use: But the when statement is n...
[ -0.0098876953125, 0.01611328125, -0.01043701171875, -0.008544921875, 0.008056640625, -0.0089111328125, 0.00885009765625, 0.019287109375, -0.0021820068359375, -0.01025390625, 0.01116943359375, -0.0091552734375, -0.026123046875, -0.007415771484375, 0.01055908203125, -0.003265380859375, ...
[ 173340, 214, 1295, 32354, 46132, 3229, 63805, 10, 400, 7008, 673, 27853, 150370, 31577, 4527, 47, 30646, 34292, 31124, 3444, 123309, 12, 959, 151575, 3917, 82230, 113, 256, 7520, 2258, 98, 11737, 13315, 110608, 16487, 2174, 5557, 46389, 169...
[ 0.255615234375, 0.1011962890625, 0.1956787109375, 0.198486328125, 0.2080078125, 0.2242431640625, 0.253662109375, 0.007110595703125, 0.084716796875, 0.1600341796875, 0.086669921875, 0.2041015625, 0.1807861328125, 0.06787109375, 0.09002685546875, 0.034637451171875, 0.2177734375, 0.17...
embed
3811448_c0
3811448
lisp
0
Title: Can call-with-current-continuation be implemented only with lambdas and closures? Problem title: Can call-with-current-continuation be implemented only with lambdas and closures? Tags: scheme, lisp, continuations, computer-science, callcc Problem: Can call-with-current-continuation be implemented only with lambd...
Can call-with-current-continuation be implemented only with lambdas and closures? Can call-with-current-continuation be implemented only with lambdas and closures? scheme lisp continuations computer-science callcc Can Can call-with-current-continuation be implemented only with lambdas and closures? Does anyone know if ...
[ -0.0157470703125, 0.0189208984375, 0.01519775390625, -0.00390625, -0.0108642578125, -0.01324462890625, 0.0067138671875, -0.01068115234375, -0.00897216796875, -0.06689453125, -0.015625, -0.0135498046875, -0.017333984375, 0.009033203125, 0.02197265625, -0.0096435546875, -0.009643554687...
[ 4171, 11782, 76228, 163812, 133891, 2320, 29479, 4734, 678, 21, 6492, 1124, 136, 170224, 150370, 400, 7008, 9454, 13909, 175201, 10060, 297, 3714, 2174, 64, 831, 1660, 206735, 7, 1528, 86608, 131527, 18, 54, 5351, 1829, 25647 ]
[ 0.07470703125, 0.261474609375, 0.2205810546875, 0.248291015625, 0.2314453125, 0.1097412109375, 0.2176513671875, 0.105712890625, 0.1234130859375, 0.1116943359375, 0.220947265625, 0.183349609375, 0.123779296875, 0.2276611328125, 0.124755859375, 0.0380859375, 0.1219482421875, 0.203369...
embed
39958648_c0
39958648
lisp
0
Title: what does it mean a language is a dialect of LISP? Problem title: what does it mean a language is a dialect of LISP? Tags: lisp, clojure Problem: what does it mean a language is a dialect of LISP? There are Clojure, Scheme, etc. which are dialects of LISP, you can find a lot more at this SO question on which dia...
what does it mean a language is a dialect of LISP? what does it mean a language is a dialect of LISP? lisp clojure LISP what does it mean a language is a dialect of LISP? There are Clojure, Scheme, etc. which are dialects of LISP, you can find a lot more at this SO question on which dialect is the best . My question is...
[ 0.015869140625, 0.01104736328125, -0.00022411346435546875, 0.0164794921875, 0.0020294189453125, 0.01043701171875, 0.009521484375, 0.012939453125, 0.007232666015625, 0.00408935546875, -0.00469970703125, -0.010986328125, -0.0185546875, -0.001739501953125, 0.0021209716796875, 0.0052795410...
[ 2367, 29459, 46876, 83, 10, 220734, 111, 16970, 9434, 400, 7008, 20450, 461, 107, 14602, 442, 51053, 34702, 282, 15969, 2965, 62822, 83658, 1884, 313, 37223, 41925, 17925, 47302, 12008, 21373, 6002, 86531, 12921, 8705, 11782, 9804, 180052, ...
[ 0.05242919921875, 0.14794921875, 0.23193359375, 0.122802734375, 0.0894775390625, 0.28759765625, 0.11083984375, 0.1812744140625, 0.24072265625, 0.1402587890625, 0.1981201171875, 0.118896484375, 0.132080078125, 0.1513671875, 0.0509033203125, 0.073486328125, 0.1126708984375, 0.1179199...
embed
18701802_c0
18701802
lisp
0
Title: if: Bad syntax error (Scheme programming) Problem title: if: Bad syntax error (Scheme programming) Tags: lisp, racket, scheme Problem: if: Bad syntax error (Scheme programming) (define generalized-triangular (lambda (input n) (if (= n 1) 1 (+ (input n) (generalized-triangular (- n 1)))))) This program is designe...
if: Bad syntax error (Scheme programming) if: Bad syntax error (Scheme programming) lisp racket scheme Bad Scheme if: Bad syntax error (Scheme programming) This program is designed to take a number and a function as inputs and do the following.. An example input would be: The Error message:
[ -0.0198974609375, 0.032470703125, -0.01068115234375, 0.006988525390625, 0.01507568359375, 0.01141357421875, 0.00665283203125, 0.01129150390625, -0.0081787109375, -0.021240234375, -0.00628662109375, -0.0186767578125, -0.0245361328125, -0.004364013671875, 0.01220703125, 0.01507568359375,...
[ 2174, 12745, 6002, 86531, 18499, 25452, 12549, 56037, 449, 400, 7008, 673, 27853, 150370, 34702, 282, 12, 15, 3293, 1528, 83, 82775, 47, 5646, 14012, 136, 32354, 237, 107730, 54, 25632, 27781, 2806, 581, 212059, 26008 ]
[ 0.1590576171875, 0.218994140625, 0.1761474609375, 0.244873046875, 0.2447509765625, 0.1722412109375, 0.196044921875, 0.18701171875, 0.11614990234375, 0.0845947265625, 0.1839599609375, 0.09075927734375, 0.1988525390625, 0.2308349609375, 0.231201171875, 0.1767578125, 0.0113525390625, ...
embed
9407403_c0
9407403
lisp
0
Title: merging and extracting lists Problem title: merging and extracting lists Tags: lisp, scheme Problem: merging and extracting lists I'm writing a function that merges two lists. If one of the list's item is a list, I need to extract it too. list1:'(1 (2 3 4) 5 6)) list2: '(7 (8 9) 10 (11)) output: (1 2 3 4 5 6 7 8...
merging and extracting lists merging and extracting lists lisp scheme list1 list2 lis1 lis2 merging and extracting lists I'm writing a function that merges two lists. If one of the list's item is a list, I need to extract it too. I tried to solve it by my code doesn't work. What is the problem?
[ 0.006256103515625, 0.0439453125, -0.0032501220703125, 0.015625, -0.00274658203125, 0.0194091796875, -0.012451171875, 0.0172119140625, -0.000789642333984375, -0.006988525390625, 0.00836181640625, -0.010009765625, 0.017333984375, 0.01611328125, -0.00762939453125, 0.00009822845458984375, ...
[ 1143, 9966, 136, 125663, 214, 5303, 400, 7008, 150370, 418, 304, 7, 32562, 32354, 42564, 6626, 4263, 1632, 35735, 83, 3871, 47, 442, 5792, 37842, 86869, 18151, 18, 4488, 2967 ]
[ 0.1956787109375, 0.119140625, 0.099365234375, 0.23779296875, 0.0689697265625, 0.2342529296875, 0.1090087890625, 0.16015625, 0.1636962890625, 0.009857177734375, 0.1141357421875, 0.041717529296875, 0.1080322265625, 0.144287109375, 0.226806640625, 0.101806640625, 0.03094482421875, 0.0...
embed
27034233_c0
27034233
lisp
0
Title: emacs slime can not connect to swank Problem title: emacs slime can not connect to swank Tags: emacs, common-lisp, lisp, slime Problem: emacs slime can not connect to swank After I type M-x:slime-connect with emacs on windows7-64,and enter host and port: host:127.0.0.1 / port:4005 . It shows the error: Connectin...
emacs slime can not connect to swank emacs slime can not connect to swank emacs common-lisp lisp slime M-x:slime-connect host:127.0.0.1 port:4005 Connecting Swank SLIME Lisp emacs slime can not connect to swank After I type M-x:slime-connect with emacs on windows7-64,and enter host and port: host:127.0.0.1 / port:4005 ...
[ 0.0040283203125, 0.0283203125, -0.02001953125, -0.01123046875, -0.02587890625, -0.0118408203125, -0.0220947265625, -0.001983642578125, -0.0028228759765625, -0.02685546875, 0.0087890625, -0.0201416015625, -0.0020599365234375, 0.00135040283203125, -0.005279541015625, -0.01165771484375, ...
[ 352, 2263, 7, 34264, 13, 831, 959, 37067, 47, 68062, 7570, 39210, 4086, 254, 400, 7008, 276, 9, 425, 64617, 135457, 27980, 20927, 129884, 102014, 11469, 22932, 8194, 62448, 138087, 92, 42135, 66820, 1261, 10644, 678, 54825, 50775, 13307, ...
[ 0.11376953125, 0.15673828125, 0.0845947265625, 0.1944580078125, 0.1907958984375, 0.056793212890625, 0.1019287109375, 0.228759765625, 0.101806640625, 0.13427734375, 0.2215576171875, 0.05792236328125, 0.0665283203125, 0.09405517578125, 0.0810546875, 0.1513671875, 0.07659912109375, 0....
embed
67910822_c0
67910822
lisp
0
Title: Proper way to pass a boolean function Problem title: Proper way to pass a boolean function Tags: lisp, racket, scheme Problem: Proper way to pass a boolean function I thought to see if something was "true" in scheme I could do the following: (lambda (x) (= x #t))) However, that gives me some sort of error, and I...
Proper way to pass a boolean function Proper way to pass a boolean function lisp racket scheme Proper Proper way to pass a boolean function I thought to see if something was "true" in scheme I could do the following: However, that gives me some sort of error, and I fell back to use something like the following which wo...
[ -0.00112152099609375, 0.0267333984375, 0.006561279296875, -0.025390625, -0.00909423828125, -0.0017852783203125, 0.01239013671875, -0.01495361328125, -0.0069580078125, -0.0145263671875, 0.00830078125, -0.0014190673828125, -0.0281982421875, -0.005096435546875, 0.00872802734375, 0.0045166...
[ 1250, 1264, 3917, 27875, 337, 31, 34677, 32354, 47, 400, 7008, 673, 27853, 150370, 17569, 1957, 2174, 9774, 13, 25632, 18499, 4420, 4527, 43240, 20903, 271, 83, 618, 882, 17198, 50828, 15400, 22027, 18, 20594, 9844, 201, 468, 4488, 54744,...
[ 0.0889892578125, 0.0889892578125, 0.112548828125, 0.15087890625, 0.087158203125, 0.1583251953125, 0.259765625, 0.2215576171875, 0.0120849609375, 0.07440185546875, 0.157958984375, 0.0823974609375, 0.1883544921875, 0.1986083984375, 0.0123291015625, 0.0621337890625, 0.0215606689453125, ...
embed
32031431_c2
32031431
lisp
2
4) (ON 'D 'C) (ON 'C 'B) (ON 'B 'A)) ((TOWER 'D 'C ^LEFT '0 ^RIGHT '2 ^BOTTOM '4 ^TOP '8) (TOWER 'C 'B ^LEFT '0 ^RIGHT '2 ^BOTTOM '2 ^TOP '6) (TOWER 'B 'A ^LEFT '0 ^RIGHT '2 ^BOTTOM '0 ^TOP '4) (ON 'D 'C) (ON 'C 'B) (ON 'B 'A)) ((TOWER 'D 'C ^LEFT '0 ^RIGHT '2 ^BOTTOM '4 ^TOP '8) (TOWER 'C 'B ^LEFT '0 ^RIGHT '2 ^BOTTOM...
4) (ON 'D 'C) (ON 'C 'B) (ON 'B 'A)) ((TOWER 'D 'C ^LEFT '0 ^RIGHT '2 ^BOTTOM '4 ^TOP '8) (TOWER 'C 'B ^LEFT '0 ^RIGHT '2 ^BOTTOM '2 ^TOP '6) (TOWER 'B 'A ^LEFT '0 ^RIGHT '2 ^BOTTOM '0 ^TOP '4) (ON 'D 'C) (ON 'C 'B) (ON 'B 'A)) ((TOWER 'D 'C ^LEFT '0 ^RIGHT '2 ^BOTTOM '4 ^TOP '8) (TOWER 'C 'B ^LEFT '0 ^RIGHT '2 ^BOTTOM...
[ -0.0189208984375, 0.0179443359375, 0.013916015625, 0.008056640625, -0.01123046875, -0.0093994140625, -0.00946044921875, 0.00567626953125, 0.01318359375, 0.0203857421875, 0.01055908203125, -0.02294921875, -0.00994873046875, 0.009033203125, 0.000946044921875, 0.007720947265625, -0.0146...
[ 13956, 15513, 397, 441, 571, 284, 8727, 91227, 25217, 2389, 167177, 18544, 304, 141197, 117032, 617, 70675, 50490, 59690, 29557, 9384, 8951, 60877, 5608, 4527, 2046, 155965, 3674, 140992, 70, 18151, 17368, 51727, 75973, 2306, 2420, 32271, 679...
[ 0.1859130859375, 0.21923828125, 0.13037109375, 0.1243896484375, 0.1014404296875, 0.09521484375, 0.09405517578125, 0.157958984375, 0.0892333984375, 0.09307861328125, 0.06793212890625, 0.01300048828125, 0.013946533203125, 0.059844970703125, 0.107666015625, 0.1151123046875, 0.1005859375...
embed
8782531_c0
8782531
lisp
0
Title: How can I navigate text in a terminal lisp-scheme interpreter? Problem title: How can I navigate text in a terminal lisp-scheme interpreter? Tags: terminal, linux, lisp, scheme Problem: How can I navigate text in a terminal lisp-scheme interpreter? When I run the Scheme interpreter in my terminal [Ubuntu 10.04],...
How can I navigate text in a terminal lisp-scheme interpreter? How can I navigate text in a terminal lisp-scheme interpreter? terminal linux lisp scheme How How can I navigate text in a terminal lisp-scheme interpreter? When I run the Scheme interpreter in my terminal [Ubuntu 10.04], I can't seem to navigate through te...
[ 0.005767822265625, 0.015625, -0.0054931640625, 0.00494384765625, -0.01495361328125, -0.0152587890625, 0.027587890625, -0.00148773193359375, -0.01324462890625, -0.0194091796875, 0.0050048828125, -0.0152587890625, -0.01708984375, -0.0218505859375, -0.01953125, -0.0018463134765625, -0.0...
[ 11249, 831, 56136, 67, 7986, 23, 33949, 400, 7008, 7560, 282, 29481, 56, 87, 11508, 6077, 150370, 11675, 34702, 79249, 34, 4068, 7709, 48903, 8305, 8110, 154109, 50986, 26818, 121742, 3917, 15490, 41361, 2480, 7108, 1257, 7565, 8337, 163, ...
[ 0.047698974609375, 0.0574951171875, 0.2230224609375, 0.1280517578125, 0.206298828125, 0.05731201171875, 0.22705078125, 0.1317138671875, 0.2083740234375, 0.15771484375, 0.1580810546875, 0.191162109375, 0.1226806640625, 0.008087158203125, 0.06341552734375, 0.0767822265625, 0.2048339843...
embed
34049488_c0
34049488
lisp
0
Title: Why does SBCL print Sublis like this? Problem title: Why does SBCL print Sublis like this? Tags: sbcl, lisp, common-lisp Problem: Why does SBCL print Sublis like this? So the function: (defun royal-we () (sublis '((i . we)) '(if I learn lisp I will be pleased))) The output in SBCL is printed this way: (IF WE LEA...
Why does SBCL print Sublis like this? Why does SBCL print Sublis like this? sbcl lisp common-lisp Why SBCL Sublis LEARN LISP WILL PLEASED VIOLETS BLUE Why does SBCL print Sublis like this? So the function: The output in SBCL is printed this way: Yet the example one: gives the output Why is SBCL printing the atoms of th...
[ -0.004180908203125, -0.00109100341796875, 0.0108642578125, 0.00946044921875, -0.0238037109375, 0.029052734375, -0.00061798095703125, 0.031005859375, 0.0025177001953125, 0.031982421875, 0.00537109375, 0.01708984375, 0.01324462890625, 0.000019311904907226562, -0.00726318359375, 0.0054016...
[ 44084, 90944, 37486, 28412, 8273, 4086, 1884, 903, 275, 34937, 400, 7008, 39210, 254, 110376, 50456, 16970, 9434, 57912, 119089, 5947, 71621, 12763, 210851, 14602, 32354, 140992, 23, 3917, 63519, 27781, 76199, 2448, 1916, 34627, 5303, 12921, ...
[ 0.1085205078125, 0.1280517578125, 0.202880859375, 0.178466796875, 0.1826171875, 0.2205810546875, 0.128173828125, 0.13330078125, 0.06927490234375, 0.156982421875, 0.06317138671875, 0.14990234375, 0.0943603515625, 0.1328125, 0.1353759765625, 0.0760498046875, 0.083251953125, 0.1700439...
embed
17429816_c0
17429816
lisp
0
Title: Why does print-circle default to nil? Problem title: Why does print-circle default to nil? Tags: printing, lisp, common-lisp Problem: Why does print-circle default to nil? CLHS says An attempt to print a circular structure with *print-circle* set to nil may lead to looping behavior and failure to terminate. And ...
Why does print-circle default to nil? Why does print-circle default to nil? printing lisp common-lisp Why Why does print-circle default to nil? CLHS says And then there's this: Why does this Lisp macro as a whole work, even though each piece doesn't work? Apparently, having *print-circle* set to nil leads to surprises....
[ -0.00347900390625, -0.004608154296875, 0.0177001953125, 0.01104736328125, -0.012939453125, 0.0137939453125, 0.01202392578125, -0.024169921875, 0.01068115234375, 0.0262451171875, -0.006195068359375, 0.01019287109375, 0.004150390625, 0.01123046875, -0.006927490234375, 0.006134033203125, ...
[ 44084, 28412, 82063, 133, 114977, 47, 17324, 2448, 400, 7008, 39210, 4086, 254, 38131, 1261, 111789, 28271, 4488, 12638, 63847, 22027, 18, 35662, 5423, 55640, 390, 5941, 76519, 44691, 808, 7964, 18151 ]
[ 0.1324462890625, 0.199951171875, 0.194580078125, 0.136962890625, 0.221923828125, 0.0714111328125, 0.21337890625, 0.13037109375, 0.0928955078125, 0.2109375, 0.08734130859375, 0.07470703125, 0.1436767578125, 0.05413818359375, 0.119384765625, 0.1317138671875, 0.05303955078125, 0.07739...
embed
56227886_c0
56227886
lisp
0
Title: Does any Lisp allow mutually recursive macros? Problem title: Does any Lisp allow mutually recursive macros? Tags: common-lisp, lisp, macros Problem: Does any Lisp allow mutually recursive macros? In Common Lisp, a macro definition must have been seen before the first use. This allows a macro to refer to itself,...
Does any Lisp allow mutually recursive macros? Does any Lisp allow mutually recursive macros? common-lisp lisp macros Does Lisp Does any Lisp allow mutually recursive macros? In Common Lisp, a macro definition must have been seen before the first use. This allows a macro to refer to itself, but does not allow two macro...
[ 0.006195068359375, 0.01019287109375, 0.0225830078125, 0.0115966796875, -0.0103759765625, 0.015869140625, -0.006256103515625, 0.0140380859375, 0.007049560546875, -0.00128173828125, 0.0026702880859375, -0.004058837890625, -0.006744384765625, -0.00087738037109375, 0.0213623046875, -0.0096...
[ 101790, 2499, 1261, 7008, 63769, 199849, 538, 195625, 5844, 111789, 7, 39210, 4086, 254, 400, 151301, 80934, 8110, 51592, 8108, 4527, 114864, 15005, 68034, 6626, 12638, 3789, 185190, 161549, 28219, 5426, 99156, 29479, 208124, 14449, 46876, 831,...
[ 0.0518798828125, 0.07757568359375, 0.1644287109375, 0.2197265625, 0.1358642578125, 0.170654296875, 0.078857421875, 0.1982421875, 0.1116943359375, 0.2315673828125, 0.0931396484375, 0.1141357421875, 0.1173095703125, 0.14697265625, 0.112548828125, 0.154541015625, 0.1490478515625, 0.04...
embed
11291428_c0
11291428
lisp
0
Title: slime-connect not working Problem title: slime-connect not working Tags: lisp, slime, emacs, common-lisp Problem: slime-connect not working I am an Emacs and Common Lisp novice. I have successfully installed SLIME in my Emacs, but I am unable to run it. Alt + x slime-connect gives the following options, acceptin...
slime-connect not working slime-connect not working lisp slime emacs common-lisp Host Port Connecting Swank SLIME Lisp slime-connect not working I am an Emacs and Common Lisp novice. I have successfully installed SLIME in my Emacs, but I am unable to run it. Alt + x slime-connect gives the following options, accepting ...
[ 0.007476806640625, 0.0235595703125, -0.0087890625, -0.006378173828125, -0.0242919921875, 0.001983642578125, -0.026123046875, -0.004791259765625, -0.002593994140625, -0.0076904296875, 0.0026397705078125, -0.0028076171875, -0.017333984375, 0.0008392333984375, -0.01904296875, -0.013183593...
[ 34264, 13, 135457, 959, 20697, 400, 7008, 352, 2263, 39210, 4086, 254, 100932, 13791, 62448, 138087, 92, 42135, 66820, 1261, 85269, 4439, 151301, 95968, 65771, 20600, 297, 51, 2886, 11675, 442, 10544, 997, 1022, 9, 25632, 50717, 26946, 1849...
[ 0.203125, 0.16943359375, 0.2509765625, 0.0916748046875, 0.16064453125, 0.098388671875, 0.1717529296875, 0.01690673828125, 0.07586669921875, 0.039459228515625, 0.041748046875, 0.10784912109375, 0.08233642578125, 0.0828857421875, 0.1661376953125, 0.08917236328125, 0.10955810546875, 0...
embed
20195831_c1
20195831
lisp
1
v lst) , fn is the first element in the list, so lisp may be able to use this position information to treat it as a function...but it's not. So certainly I missed something here. The 4th line in the recursive call of myreduce : what kind of fn be passed to the recursive call to myreduce ? '+ or + , or something else? ...
v lst) , fn is the first element in the list, so lisp may be able to use this position information to treat it as a function...but it's not. So certainly I missed something here. The 4th line in the recursive call of myreduce : what kind of fn be passed to the recursive call to myreduce ? '+ or + , or something else? ...
[ -0.020263671875, 0.005340576171875, 0.006866455078125, 0.01611328125, -0.0184326171875, 0.006195068359375, -0.00848388671875, 0.0018768310546875, 0.000732421875, -0.057373046875, -0.0012359619140625, -0.00421142578125, -0.0017242431640625, -0.01165771484375, -0.008544921875, -0.0109863...
[ 81, 271, 14783, 83, 70, 5117, 12830, 5303, 400, 7008, 1543, 19048, 4527, 19069, 4677, 85689, 32354, 959, 68782, 156304, 201, 927, 13315, 195625, 5844, 11782, 759, 107, 106357, 8562, 186, 115081, 47, 242, 1328, 707, 997, 20531, 107419, 371...
[ 0.150634765625, 0.09478759765625, 0.2049560546875, 0.0390625, 0.0186920166015625, 0.118896484375, 0.1634521484375, 0.1697998046875, 0.1160888671875, 0.2374267578125, 0.02374267578125, 0.012359619140625, 0.031280517578125, 0.225341796875, 0.1153564453125, 0.055877685546875, 0.14257812...
embed
33680426_c0
33680426
lisp
0
Title: How do I append values in order to an existing list using only cons? Problem title: How do I append values in order to an existing list using only cons? Tags: cons, lisp, common-lisp Problem: How do I append values in order to an existing list using only cons? In lisp I am trying to append values in order to a l...
How do I append values in order to an existing list using only cons? How do I append values in order to an existing list using only cons? cons lisp common-lisp only How NIL Result How do I append values in order to an existing list using only cons? In lisp I am trying to append values in order to a list using only the ...
[ 0.00142669677734375, 0.023681640625, 0.006500244140625, -0.0014801025390625, 0.007476806640625, 0.0166015625, -0.01904296875, 0.015869140625, 0.016357421875, -0.037109375, -0.0034942626953125, -0.0230712890625, 0.003173828125, -0.004608154296875, -0.001190185546875, -0.002349853515625,...
[ 11249, 114689, 71, 142424, 12989, 47, 144573, 5303, 17368, 4734, 158, 7, 54, 400, 7008, 39210, 4086, 254, 541, 16444, 126684, 87, 360, 31577, 62822, 32354, 5423, 864, 2258, 42, 28282, 4420, 19364, 3642, 25944 ]
[ 0.07061767578125, 0.183349609375, 0.1387939453125, 0.225830078125, 0.1837158203125, 0.085205078125, 0.1888427734375, 0.1973876953125, 0.0556640625, 0.1412353515625, 0.1959228515625, 0.15380859375, 0.0194244384765625, 0.09783935546875, 0.1904296875, 0.101318359375, 0.07012939453125, ...
embed
14656435_c0
14656435
lisp
0
Title: Mergesort in Scheme Problem title: Mergesort in Scheme Tags: scheme, lisp Problem: Mergesort in Scheme I'm writing mergesort in Scheme and I'm curious as to why this won't work... Here is the implementation I expect to work, but doesn't: (define (mergesort op l) (cond ((null? l) l) ((null? (cdr l)) l) (else (mer...
Mergesort in Scheme Mergesort in Scheme scheme lisp Mergesort Scheme Mergesort in Scheme I'm writing mergesort in Scheme and I'm curious as to why this won't work... Here is the implementation I expect to work, but doesn't: And here is the 'proper' implementation. Why must I (cons (car l) (list)) before trying to merge...
[ -0.00848388671875, 0.0218505859375, 0.0220947265625, -0.0198974609375, -0.001708984375, -0.003173828125, -0.041015625, -0.0208740234375, -0.00860595703125, -0.027099609375, -0.0076904296875, 0.005462646484375, 0.00982666015625, -0.009033203125, 0.00848388671875, -0.010986328125, -0.0...
[ 6035, 429, 62351, 23, 34702, 282, 150370, 400, 7008, 32562, 42564, 193844, 15400, 903, 23742, 18, 4488, 208124, 41206, 1284, 22027, 36290, 56, 44084, 8110, 25553, 3284, 96, 6562, 8108, 31577, 678, 195625, 1830 ]
[ 0.1712646484375, 0.12286376953125, 0.29443359375, 0.06170654296875, 0.18994140625, 0.164794921875, 0.1973876953125, 0.053375244140625, 0.1339111328125, 0.0941162109375, 0.21044921875, 0.03277587890625, 0.08404541015625, 0.023162841796875, 0.08880615234375, 0.093994140625, 0.110229492...
embed
2892565_c0
2892565
lisp
0
Title: How to write (simple) macro? Problem title: How to write (simple) macro? Tags: clos, common-lisp, macros, lisp Problem: How to write (simple) macro? I need to write a macro (with-hooks (monster method who what) &body body) for a game I'm writing. Monster is a CLOS object, method and who are strings and what is a...
How to write (simple) macro? How to write (simple) macro? clos common-lisp macros lisp How How to write (simple) macro? I need to write a macro (with-hooks (monster method who what) &body body) for a game I'm writing. Monster is a CLOS object, method and who are strings and what is a function (#' notation). The macroex...
[ -0.0164794921875, 0.01416015625, -0.0262451171875, 0.00390625, 0.0076904296875, 0.01416015625, -0.00005507469177246094, -0.005767822265625, 0.00011444091796875, -0.04541015625, -0.01361083984375, -0.017333984375, -0.00665283203125, 0.00445556640625, 0.002471923828125, -0.036376953125, ...
[ 11249, 47, 33022, 191560, 16, 111789, 20450, 7, 39210, 4086, 254, 400, 7008, 3871, 76228, 497, 43042, 3796, 1515, 55300, 2750, 2367, 619, 37873, 14361, 100, 6712, 32562, 89715, 83, 313, 92933, 36746, 136, 79315, 32354, 4904, 25, 110, 8361...
[ 0.0914306640625, 0.04193115234375, 0.2078857421875, 0.2265625, 0.04083251953125, 0.279296875, 0.1558837890625, 0.0723876953125, 0.1007080078125, 0.05462646484375, 0.1217041015625, 0.06402587890625, 0.157958984375, 0.058258056640625, 0.0693359375, 0.0736083984375, 0.151123046875, 0....
embed
53365577_c0
53365577
lisp
0
Title: Computing functions over multiple lists Problem title: Computing functions over multiple lists Tags: common-lisp, lisp Problem: Computing functions over multiple lists I need to produce a list containing the averages of a lists of lists where the number of sub-lists could vary. So given the input list: ((l1a l1b...
Computing functions over multiple lists Computing functions over multiple lists common-lisp lisp Computing l1a l1b l1c l2a l2b l2c l3a l3b l3c Computing functions over multiple lists I need to produce a list containing the averages of a lists of lists where the number of sub-lists could vary. So given the input list: t...
[ 0.00927734375, -0.00032806396484375, 0.0020599365234375, 0.00262451171875, -0.01263427734375, 0.022216796875, 0.02783203125, 0.003997802734375, 0.0164794921875, -0.0303955078125, -0.006622314453125, -0.0021514892578125, 0.0191650390625, 0.0208740234375, -0.0186767578125, 0.001678466796...
[ 159415, 214, 32354, 645, 48716, 5303, 39210, 4086, 254, 400, 7008, 7, 3871, 27489, 70541, 83080, 14012, 1614, 6562, 5809, 285, 53, 34475, 107730, 140992, 2806, 186, 6183, 27650, 3917, 54, 903, 23, 3714, 4034, 67660, 225876, 75204 ]
[ 0.188720703125, 0.035186767578125, 0.2042236328125, 0.1728515625, 0.2030029296875, 0.2313232421875, 0.08721923828125, 0.0750732421875, 0.1348876953125, 0.1416015625, 0.2095947265625, 0.060638427734375, 0.106201171875, 0.1236572265625, 0.06304931640625, 0.239013671875, 0.0531005859375...
embed
15738901_c0
15738901
lisp
0
Title: How can I make a Racket reader macro to transform any instance of one character into two other characters? Problem title: How can I make a Racket reader macro to transform any instance of one character into two other characters? Tags: racket, scheme, lisp Problem: How can I make a Racket reader macro to transfor...
How can I make a Racket reader macro to transform any instance of one character into two other characters? How can I make a Racket reader macro to transform any instance of one character into two other characters? racket scheme lisp How Racket How can I make a Racket reader macro to transform any instance of one charac...
[ 0.006927490234375, 0.021484375, 0.0174560546875, 0.01458740234375, 0.0052490234375, 0.01092529296875, -0.0194091796875, -0.00994873046875, -0.0145263671875, 0.014892578125, 0.003875732421875, -0.021484375, -0.001129150390625, -0.02294921875, 0.01202392578125, -0.0235595703125, 0.0089...
[ 11249, 831, 3249, 2552, 27853, 155255, 111789, 27198, 2499, 110527, 1632, 62816, 3934, 6626, 3789, 124850, 47, 673, 150370, 400, 7008, 87, 10, 111, 183037, 3871, 58745, 41872, 16454, 209806, 111531, 72856, 73342, 28219, 6397, 3642, 33022, 604...
[ 0.079833984375, 0.0657958984375, 0.10052490234375, 0.1473388671875, 0.248779296875, 0.27001953125, 0.2408447265625, 0.20947265625, 0.065185546875, 0.1939697265625, 0.0816650390625, 0.178955078125, 0.1236572265625, 0.1737060546875, 0.1099853515625, 0.191650390625, 0.04437255859375, ...
embed
23060285_c0
23060285
lisp
0
Title: How to avoid NIL from getting added to the list? Problem title: How to avoid NIL from getting added to the list? Tags: lisp Problem: How to avoid NIL from getting added to the list? I'm a newbie in lisp. I've written a flatten function in lisp. (defun flatten (list) (cond ((null list) nil) ((atom (first list)) (...
How to avoid NIL from getting added to the list? How to avoid NIL from getting added to the list? lisp getting How NIL How to avoid NIL from getting added to the list? I'm a newbie in lisp. I've written a flatten function in lisp. INPUT- (flatten '(a () b (c d))) Expected OUTPUT- (a b c d) My OUTPUT- (a nil b c d) What...
[ -0.01171875, 0.01141357421875, 0.0225830078125, -0.00160980224609375, -0.0035400390625, 0.01275634765625, 0.0211181640625, 0.016357421875, -0.0108642578125, -0.01373291015625, 0.0126953125, -0.0157470703125, -0.01019287109375, -0.0155029296875, -0.000579833984375, 0.006195068359375, ...
[ 11249, 71864, 541, 16444, 1295, 20949, 49814, 47, 5303, 400, 7008, 9014, 59121, 49878, 510, 32354, 5881, 124599, 150632, 876, 104, 60075, 52001, 17324, 5608, 134598, 11001, 195625, 5844 ]
[ 0.1053466796875, 0.2222900390625, 0.153076171875, 0.236572265625, 0.101806640625, 0.10540771484375, 0.1666259765625, 0.05133056640625, 0.1842041015625, 0.114990234375, 0.2078857421875, 0.0985107421875, 0.0670166015625, 0.1453857421875, 0.166748046875, 0.15478515625, 0.087646484375, ...
embed
1351956_c0
1351956
lisp
0
Title: Read macros: what do you use them for? Problem title: Read macros: what do you use them for? Tags: lisp, reader-macro Problem: Read macros: what do you use them for? I'm trying to get a feel for the parts of Lisp that I haven't used very much up to now. Read macros have caught my attention at the moment. There i...
Read macros: what do you use them for? Read macros: what do you use them for? lisp reader-macro Read Read macros: what do you use them for? I'm trying to get a feel for the parts of Lisp that I haven't used very much up to now. Read macros have caught my attention at the moment. There isn't a huge amount of info about ...
[ 0.01123046875, 0.01019287109375, 0.012939453125, -0.00408935546875, 0.0021820068359375, 0.02880859375, -0.00830078125, 0.00567626953125, -0.01220703125, -0.0223388671875, 0.00177764892578125, -0.0283203125, -0.00250244140625, -0.01190185546875, 0.0157470703125, -0.0218505859375, -0.0...
[ 4764, 111789, 7, 12, 2367, 54, 398, 4527, 2856, 100, 400, 7008, 155255, 192, 15322, 31577, 12319, 63920, 1261, 11814, 5045, 156892, 35743, 3095, 3004, 2363, 4358, 678, 27781, 4488, 44402, 51515, 226829, 141956, 11764, 4127, 6494, 12301 ]
[ 0.26953125, 0.25732421875, 0.157470703125, 0.0302581787109375, 0.1268310546875, 0.05389404296875, 0.049560546875, 0.1590576171875, 0.12109375, 0.1656494140625, 0.1229248046875, 0.19482421875, 0.2493896484375, 0.07537841796875, 0.16552734375, 0.01434326171875, 0.08251953125, 0.03298...
embed
69703679_c0
69703679
lisp
0
Title: How to generate random numbers in [0 ... 1.0] in Common Lisp Problem title: How to generate random numbers in [0 ... 1.0] in Common Lisp Tags: probability, lisp, random Problem: How to generate random numbers in [0 ... 1.0] in Common Lisp My understanding of Common Lisp pseudorandom number generation is that (ra...
How to generate random numbers in [0 ... 1.0] in Common Lisp How to generate random numbers in [0 ... 1.0] in Common Lisp probability lisp random How Common Lisp How to generate random numbers in [0 ... 1.0] in Common Lisp My understanding of Common Lisp pseudorandom number generation is that (random 1.0) will generate...
[ 0.0032958984375, 0.01165771484375, 0.005340576171875, -0.035400390625, 0.007354736328125, 0.006683349609375, 0.00726318359375, -0.012939453125, -0.0037384033203125, -0.038330078125, 0.0026092529296875, 0.0238037109375, -0.018310546875, -0.00506591796875, 0.028076171875, -0.001953125, ...
[ 11249, 47, 139392, 96759, 101935, 23, 2389, 153, 53855, 151301, 1261, 7008, 37242, 400, 100094, 74189, 46258, 39, 14012, 58093, 1221, 175921, 81113, 40715, 615, 2806, 1884, 2046, 1257, 188, 55128, 903, 7722, 57767, 5809, 28288, 79385, 22619, ...
[ 0.1002197265625, 0.0748291015625, 0.2259521484375, 0.2119140625, 0.2066650390625, 0.092041015625, 0.1273193359375, 0.08404541015625, 0.2059326171875, 0.1536865234375, 0.1600341796875, 0.1883544921875, 0.137451171875, 0.1080322265625, 0.07275390625, 0.1549072265625, 0.18359375, 0.13...
embed
67680068_c0
67680068
lisp
0
Title: Shorthand for car and cdr Problem title: Shorthand for car and cdr Tags: sicp, scheme, lisp Problem: Shorthand for car and cdr I'm trying to car/cdr to get a particular element in a list: (define x7 '(1 3 (5 7) 9)) ; The cdr (3 (5 7) 9) ; The cddr ((5 7) 9) ; The caddr (5 7) ; The cdaddr (7) I've been able to ge...
Shorthand for car and cdr Shorthand for car and cdr sicp scheme lisp Shorthand Shorthand for car and cdr I'm trying to car/cdr to get a particular element in a list: I've been able to get that far down, however, if I then do car on the result it works, but if I add another a into the short-hand form, I get an error: Do...
[ -0.000362396240234375, 0.03564453125, 0.01275634765625, 0.006805419921875, -0.001739501953125, 0.010986328125, 0.01104736328125, 0.017333984375, 0.01300048828125, -0.00836181640625, -0.01361083984375, -0.011962890625, -0.01397705078125, 0.0086669921875, -0.0025482177734375, -0.00112915...
[ 82990, 12336, 100, 2258, 136, 56329, 42, 26536, 254, 150370, 400, 7008, 31577, 47, 7569, 2046, 17311, 12830, 5303, 19048, 2060, 7565, 54, 98, 70, 16750, 43240, 15190, 15700, 10, 3934, 16610, 3173, 18499, 4734, 738, 1257, 43606, 21441, 955...
[ 0.153564453125, 0.2198486328125, 0.050933837890625, 0.200439453125, 0.0986328125, 0.041351318359375, 0.149169921875, 0.0731201171875, 0.1541748046875, 0.1632080078125, 0.06805419921875, 0.1761474609375, 0.049957275390625, 0.0101165771484375, 0.1695556640625, 0.049530029296875, 0.0354...
embed
34580328_c1
34580328
lisp
1
whitespace between tokens is stored in the resultant syntax object. Suppose I write a macro named ->, which takes a syntax object (scheme style macro), and whitespace? is a predicate identifying whitespace syntax objects (define-macro (-> stx) (let* ((stxl (syntax-object->list stx)) (obj (car stxl)) (let proc ((res em...
whitespace between tokens is stored in the resultant syntax object. Suppose I write a macro named ->, which takes a syntax object (scheme style macro), and whitespace? is a predicate identifying whitespace syntax objects (define-macro (-> stx) (let* ((stxl (syntax-object->list stx)) (obj (car stxl)) (let proc ((res em...
[ -0.0031890869140625, 0.005462646484375, 0.003509521484375, 0.0250244140625, -0.003997802734375, 0.016845703125, -0.00201416015625, -0.0062255859375, -0.00732421875, -0.007232666015625, 0.00012969970703125, -0.004364013671875, -0.0223388671875, -0.036376953125, -0.00116729736328125, -0....
[ 35011, 65421, 17721, 47, 84694, 83, 4343, 71, 23, 31805, 660, 6002, 86531, 36746, 33022, 111789, 33079, 51776, 7560, 282, 20623, 32, 1653, 2063, 67, 135812, 64552, 15322, 103607, 6138, 425, 1974, 1639, 92595, 12654, 187694, 6562, 3522, 170,...
[ 0.224365234375, 0.302001953125, 0.2265625, 0.16015625, 0.268798828125, 0.07135009765625, 0.1834716796875, 0.1014404296875, 0.06365966796875, 0.151123046875, 0.027069091796875, 0.12255859375, 0.2052001953125, 0.19091796875, 0.09698486328125, 0.2196044921875, 0.148681640625, 0.042694...
embed
29756288_c0
29756288
lisp
0
Title: Examples of non-trivial fexpr usage Problem title: Examples of non-trivial fexpr usage Tags: lisp Problem: Examples of non-trivial fexpr usage I'm looking for (real world) uses of fexprs, where they are used in a way different to what can be accomplished with lazy evaluation. Most examples that I could find use ...
Examples of non-trivial fexpr usage Examples of non-trivial fexpr usage lisp Examples Examples of non-trivial fexpr usage I'm looking for (real world) uses of fexprs, where they are used in a way different to what can be accomplished with lazy evaluation. Most examples that I could find use fexprs only to implement con...
[ 0.0130615234375, 0.005340576171875, 0.0004711151123046875, -0.0240478515625, 0.01177978515625, 0.0150146484375, 0.021240234375, 0.01080322265625, 0.0233154296875, -0.019287109375, 0.007171630859375, -0.003509521484375, -0.00182342529296875, 0.01470947265625, 0.0234375, 0.025146484375, ...
[ 89536, 99726, 351, 3996, 686, 289, 1238, 83613, 42, 127689, 400, 7008, 16487, 30544, 8999, 4527, 4295, 11814, 3917, 12921, 163846, 21, 3285, 219836, 27781, 29479, 35431, 16610, 61404, 2940, 41271, 27494, 2182, 5117, 10750, 98320, 151575, 1793...
[ 0.125244140625, 0.03485107421875, 0.1300048828125, 0.033172607421875, 0.07012939453125, 0.05877685546875, 0.0897216796875, 0.1256103515625, 0.193115234375, 0.1470947265625, 0.085693359375, 0.134765625, 0.005645751953125, 0.0635986328125, 0.064208984375, 0.11865234375, 0.202880859375,...
embed
64096911_c0
64096911
lisp
0
Title: Why am I getting the error: cond: expected a clause with a question and an answer Problem title: Why am I getting the error: cond: expected a clause with a question and an answer Tags: racket, scheme, if-statement, lisp Problem: Why am I getting the error: cond: expected a clause with a question and an answer Wh...
Why am I getting the error: cond: expected a clause with a question and an answer Why am I getting the error: cond: expected a clause with a question and an answer racket scheme if-statement lisp Why Why am I getting the error: cond: expected a clause with a question and an answer Why am I getting the error: cond: expe...
[ -0.006622314453125, 0.0179443359375, -0.01171875, 0.0164794921875, 0.006866455078125, 0.0147705078125, 0.0262451171875, 0.019775390625, 0.002777099609375, -0.00823974609375, 0.00115966796875, -0.0235595703125, -0.0101318359375, -0.0223388671875, -0.01446533203125, 0.0107421875, -0.00...
[ 44084, 444, 20949, 18499, 158, 71, 12, 84751, 70731, 13, 678, 9655, 136, 35166, 87, 10, 142, 673, 27853, 150370, 2174, 61340, 400, 7008, 14037, 4734, 1632, 2831, 44691, 55970, 660, 24491, 40907, 14012 ]
[ 0.0697021484375, 0.0145263671875, 0.0167694091796875, 0.1627197265625, 0.129638671875, 0.121826171875, 0.02752685546875, 0.1871337890625, 0.2020263671875, 0.12060546875, 0.140625, 0.2098388671875, 0.1387939453125, 0.1689453125, 0.00091552734375, 0.0219268798828125, 0.0120849609375, ...
embed
46517001_c0
46517001
lisp
0
Title: Learning LISP. Why does NIL print out after end of function using if statement Problem title: Learning LISP. Why does NIL print out after end of function using if statement Tags: clisp, common-lisp, lisp Problem: Learning LISP. Why does NIL print out after end of function using if statement Hi newbie here trying...
Learning LISP. Why does NIL print out after end of function using if statement Learning LISP. Why does NIL print out after end of function using if statement clisp common-lisp lisp if Learning LISP Why NIL Learning LISP. Why does NIL print out after end of function using if statement Hi newbie here trying to learn lisp...
[ 0.003326416015625, 0.0181884765625, 0.006622314453125, 0.0050048828125, -0.00537109375, 0.0189208984375, 0.0208740234375, 0.0069580078125, -0.0166015625, 0.0166015625, 0.00146484375, -0.0054931640625, -0.01611328125, -0.0211181640625, 0.009033203125, 0.02001953125, -0.003799438476562...
[ 114344, 16970, 9434, 44084, 14602, 541, 16444, 28412, 1810, 7103, 3564, 111, 32354, 17368, 2174, 63805, 95701, 7008, 39210, 4086, 254, 400, 9014, 31577, 30698, 566, 15400, 7, 99, 140992, 3917, 47, 959, 5423, 26785, 16750 ]
[ 0.1435546875, 0.1376953125, 0.1934814453125, 0.1378173828125, 0.001434326171875, 0.1365966796875, 0.201904296875, 0.162841796875, 0.11376953125, 0.1268310546875, 0.15478515625, 0.08514404296875, 0.14697265625, 0.049591064453125, 0.2254638671875, 0.18017578125, 0.06219482421875, 0.1...
embed
29209970_c0
29209970
lisp
0
Title: &quot;Paradigms of AI Programming&quot; Can I run examples from this book in Racket programming language Problem title: &quot;Paradigms of AI Programming&quot; Can I run examples from this book in Racket programming language Tags: racket, lisp, clojure, artificial-intelligence Problem: "Paradigms of AI Programmi...
&quot;Paradigms of AI Programming&quot; Can I run examples from this book in Racket programming language &quot;Paradigms of AI Programming&quot; Can I run examples from this book in Racket programming language racket lisp clojure artificial-intelligence this Paradigms Programming Can Racket "Paradigms of AI Programming...
[ 0.007110595703125, 0.0079345703125, 0.0184326171875, 0.050537109375, -0.00170135498046875, 0.0133056640625, 0.005706787109375, -0.01043701171875, -0.0047607421875, -0.0277099609375, -0.000766754150390625, -0.0103759765625, 0.000629425048828125, -0.00286865234375, -0.000553131103515625, ...
[ 55292, 4803, 4432, 111, 38730, 27958, 214, 4171, 87, 11675, 27781, 7, 1295, 903, 12877, 2552, 27853, 56037, 46876, 673, 400, 7008, 20450, 461, 107, 66733, 130687, 1720, 163629, 62673, 11107, 10931, 20255, 51053, 55076 ]
[ 0.08636474609375, 0.1512451171875, 0.0682373046875, 0.0726318359375, 0.171630859375, 0.1583251953125, 0.0254669189453125, 0.08721923828125, 0.011138916015625, 0.1102294921875, 0.17626953125, 0.0390625, 0.052001953125, 0.0732421875, 0.1258544921875, 0.109619140625, 0.18310546875, 0....
embed
57137668_c0
57137668
lisp
0
Title: How to sort a list in lisp? Problem title: How to sort a list in lisp? Tags: lisp, list, autolisp, autocad, sorting Problem: How to sort a list in lisp? I have a list in lisp like this: ( ((5 6) (2 7)) ((5 4) (2 9)) ((1 8) (7 7)) ) I want to sort it by all these conditions: Just by first elemens: (5 6) , (5 4) ,...
How to sort a list in lisp? How to sort a list in lisp? lisp list autolisp autocad sorting How How to sort a list in lisp? I have a list in lisp like this: I want to sort it by all these conditions: Just by first elemens: (5 6) , (5 4) , (1 8) In these elements, first sort by x and then by y: (1 8) (5 4) (5 6) At the e...
[ 0.00201416015625, 0.014404296875, -0.00119781494140625, -0.005584716796875, -0.033203125, 0.005401611328125, 0.006011962890625, 0.0052490234375, -0.0126953125, 0.003143310546875, 0.00592041015625, 0.010009765625, -0.0057373046875, -0.0089111328125, -0.0084228515625, 0.0012054443359375,...
[ 11249, 47, 12096, 10, 5303, 23, 400, 7008, 32, 1809, 4086, 254, 25426, 214, 1884, 3444, 442, 390, 27289, 5117, 111410, 11516, 35914, 13956, 65034, 80854, 1022, 113, 3564, 17497, 36917, 17932, 12830, 1614, 14179, 10325, 22936 ]
[ 0.120849609375, 0.08349609375, 0.243408203125, 0.044464111328125, 0.24169921875, 0.1163330078125, 0.158203125, 0.2509765625, 0.010345458984375, 0.0963134765625, 0.07373046875, 0.1591796875, 0.138671875, 0.012786865234375, 0.0139923095703125, 0.0653076171875, 0.0029296875, 0.0401306...
embed
56472748_c0
56472748
lisp
0
Title: How to implement continuations in dynamic language like JavaScript? Problem title: How to implement continuations in dynamic language like JavaScript? Tags: javascript, callcc, scheme, continuations, lisp Problem: How to implement continuations in dynamic language like JavaScript? Code signals: How, JavaScript, ...
How to implement continuations in dynamic language like JavaScript? How to implement continuations in dynamic language like JavaScript? javascript callcc scheme continuations lisp How JavaScript dynamic_scope Pair node.car arg.bind args.push node.haveCycles node.cdr eval_args code.clone macro.invoke value.data global_e...
[ 0.00007772445678710938, 0.0184326171875, 0.00189208984375, -0.000598907470703125, 0.006866455078125, 0.0048828125, 0.005645751953125, -0.020263671875, 0.004119873046875, -0.043701171875, -0.044189453125, 0.00396728515625, -0.0286865234375, 0.005126953125, 0.030517578125, 0.006408691406...
[ 11249, 29479, 9454, 5256, 23, 84079, 46876, 1884, 17925, 136951, 11782, 10060, 150370, 400, 7008, 70820, 1342, 110, 112, 3284, 79459, 89817, 7332, 68991, 151612, 7569, 1405, 61477, 18151, 63499, 111789, 23253, 34292, 10135, 7964, 334, 131899, ...
[ 0.06805419921875, 0.2039794921875, 0.26953125, 0.186279296875, 0.057647705078125, 0.21435546875, 0.158203125, 0.08740234375, 0.24462890625, 0.2239990234375, 0.1712646484375, 0.1317138671875, 0.16015625, 0.1171875, 0.15966796875, 0.199462890625, 0.061279296875, 0.0897216796875, 0....
embed
11705998_c0
11705998
lisp
0
Title: Clojure: &quot;=&quot; compares values in collections, why cannot it compare two lists in this case? Problem title: Clojure: &quot;=&quot; compares values in collections, why cannot it compare two lists in this case? Tags: clojure, lisp Problem: Clojure: "=" compares values in collections, why cannot it compare ...
Clojure: &quot;=&quot; compares values in collections, why cannot it compare two lists in this case? Clojure: &quot;=&quot; compares values in collections, why cannot it compare two lists in this case? clojure lisp Clojure Clojure: "=" compares values in collections, why cannot it compare two lists in this case? See th...
[ 0.00897216796875, 0.030029296875, -0.00531005859375, 0.00653076171875, -0.00921630859375, 0.004974365234375, 0.005950927734375, -0.0125732421875, -0.00335693359375, 0.00299072265625, 0.003448486328125, 0.0169677734375, 0.00677490234375, 0.0118408203125, -0.006866455078125, -0.027832031...
[ 51053, 461, 107, 12, 41502, 1369, 1230, 69101, 142424, 23, 42486, 7, 15400, 53418, 6626, 5303, 7225, 903, 20450, 400, 7008, 44, 22422, 27781, 44084, 4568, 959, 4488, 96760, 173, 18770 ]
[ 0.1239013671875, 0.1583251953125, 0.152587890625, 0.022430419921875, 0.0966796875, 0.134765625, 0.0248870849609375, 0.2099609375, 0.15771484375, 0.046722412109375, 0.182373046875, 0.0231475830078125, 0.1009521484375, 0.135009765625, 0.091796875, 0.196044921875, 0.114990234375, 0.02...
embed
41774420_c0
41774420
lisp
0
Title: Why do some lisps put the function name outside of the argument list in a function definition? Problem title: Why do some lisps put the function name outside of the argument list in a function definition? Tags: racket, scheme, clojure, common-lisp, lisp Problem: Why do some lisps put the function name outside of...
Why do some lisps put the function name outside of the argument list in a function definition? Why do some lisps put the function name outside of the argument list in a function definition? racket scheme clojure common-lisp lisp Why arg1 arg2 Why do some lisps put the function name outside of the argument list in a fun...
[ 0.0322265625, 0.015625, -0.0169677734375, 0.00927734375, -0.01953125, 0.0123291015625, 0.006866455078125, 0.01226806640625, 0.00421142578125, 0.015625, 0.01068115234375, -0.0291748046875, -0.027099609375, -0.0084228515625, 0.007293701171875, -0.007415771484375, 0.01312255859375, -0...
[ 44084, 400, 7, 6423, 3884, 32354, 9351, 50782, 10750, 5303, 80934, 3060, 673, 27853, 150370, 20450, 461, 107, 39210, 4086, 254, 7008, 79459, 418, 304, 111, 54, 7560, 282, 14602, 3055, 1286, 10422, 6002, 86531, 23, 202010, 21373, 31635, 36...
[ 0.1226806640625, 0.116943359375, 0.048828125, 0.13671875, 0.03680419921875, 0.20361328125, 0.139404296875, 0.14990234375, 0.214111328125, 0.14208984375, 0.2127685546875, 0.0162506103515625, 0.050323486328125, 0.175537109375, 0.13916015625, 0.0875244140625, 0.1153564453125, 0.101684...
embed
27781507_c0
27781507
lisp
0
Title: what is difference between (define (add x y) (+ x y)) and (define add (lambda (x y) (+ x y)))? Problem title: what is difference between (define (add x y) (+ x y)) and (define add (lambda (x y) (+ x y)))? Tags: sicp, scheme, lisp Problem: what is difference between (define (add x y) (+ x y)) and (define add (lam...
what is difference between (define (add x y) (+ x y)) and (define add (lambda (x y) (+ x y)))? what is difference between (define (add x y) (+ x y)) and (define add (lambda (x y) (+ x y)))? sicp scheme lisp what is difference between (define (add x y) (+ x y)) and (define add (lambda (x y) (+ x y)))? I am now writing a...
[ 0.00347900390625, 0.0198974609375, 0.001251220703125, 0.0274658203125, 0.005645751953125, 0.00148773193359375, 0.01458740234375, 0.0184326171875, -0.00005459785461425781, -0.0203857421875, 0.01806640625, -0.033203125, -0.020263671875, -0.0220947265625, 0.01300048828125, 0.0074462890625...
[ 60212, 17721, 112, 64552, 4028, 1022, 113, 22183, 15190, 143, 6492, 85, 136, 26536, 254, 150370, 400, 7008, 11, 29481, 37223, 61924, 21, 71062, 297, 7, 6493, 6626, 125195, 3871, 23468, 151575 ]
[ 0.2034912109375, 0.122314453125, 0.07318115234375, 0.2037353515625, 0.15185546875, 0.040374755859375, 0.133056640625, 0.1522216796875, 0.203369140625, 0.026214599609375, 0.1754150390625, 0.16796875, 0.08392333984375, 0.0615234375, 0.129150390625, 0.1544189453125, 0.0721435546875, 0...
embed
52628273_c0
52628273
lisp
0
Title: Using easy-ssl-acceptor in LispWorks Problem title: Using easy-ssl-acceptor in LispWorks Tags: common-lisp, ssl, hunchentoot, lispworks, lisp Problem: Using easy-ssl-acceptor in LispWorks I want to use Hunchentoot's easy-ssl-acceptor in LispWorks. However, I see that this class of acceptor has the following feat...
Using easy-ssl-acceptor in LispWorks Using easy-ssl-acceptor in LispWorks common-lisp ssl hunchentoot lispworks lisp Using LispWorks Using easy-ssl-acceptor in LispWorks I want to use Hunchentoot's easy-ssl-acceptor in LispWorks. However, I see that this class of acceptor has the following feature syntax #-:hunchentoot...
[ -0.002166748046875, 0.0238037109375, -0.001312255859375, 0.0174560546875, -0.0245361328125, -0.00128173828125, 0.006195068359375, 0.00714111328125, -0.005340576171875, -0.01043701171875, -0.005950927734375, -0.0096435546875, 0.012451171875, 0.0218505859375, 0.0201416015625, -0.01989746...
[ 345, 23468, 7, 24861, 92140, 254, 1290, 1261, 7008, 108259, 23, 39210, 4086, 91, 1926, 4834, 188, 818, 400, 18244, 4527, 10453, 903, 18507, 26946, 748, 60213, 6002, 86531, 15288, 157, 160463, 13379, 88981, 30891, 5303, 53418, 2967, 44084, ...
[ 0.07220458984375, 0.1937255859375, 0.07666015625, 0.25244140625, 0.1396484375, 0.1507568359375, 0.13818359375, 0.15234375, 0.156005859375, 0.2197265625, 0.036346435546875, 0.0806884765625, 0.1131591796875, 0.045654296875, 0.0943603515625, 0.1817626953125, 0.127197265625, 0.19604492...
embed
6351475_c0
6351475
lisp
0
Title: variable trouble in lisp Problem title: variable trouble in lisp Tags: common-lisp, lisp, variables Problem: variable trouble in lisp I'm writing a program in Common Lisp in which I need a function with this basic outline: (defun example (initial-state modify mod-list) (loop for modification in mod-list collecti...
variable trouble in lisp variable trouble in lisp common-lisp lisp variables variable trouble in lisp I'm writing a program in Common Lisp in which I need a function with this basic outline: The problem is that I need initial-state to be the same every time it is passed to modify , but modify can be destructive. I woul...
[ 0.006011962890625, 0.023681640625, 0.003387451171875, -0.00494384765625, -0.002777099609375, -0.0019989013671875, -0.0032501220703125, 0.0018768310546875, 0.01019287109375, -0.0361328125, 0.0093994140625, 0.00860595703125, 0.01416015625, 0.0115966796875, 0.0250244140625, -0.00946044921...
[ 77336, 63134, 23, 400, 7008, 39210, 4086, 254, 32562, 1528, 151301, 1261, 3871, 32354, 62822, 1810, 2256, 2967, 61475, 61340, 47, 186, 5701, 11907, 1733, 115081, 2811, 40383, 1284, 831, 8, 36716, 5844, 43658, 237259, 10644, 2053, 3249, 5338...
[ 0.288818359375, 0.2147216796875, 0.06744384765625, 0.1361083984375, 0.2186279296875, 0.1138916015625, 0.08392333984375, 0.1446533203125, 0.072265625, 0.1195068359375, 0.1251220703125, 0.149169921875, 0.1182861328125, 0.1248779296875, 0.06103515625, 0.0047607421875, 0.08544921875, 0...
embed
25696063_c0
25696063
lisp
0
Title: Lambda in Racket Explained Problem title: Lambda in Racket Explained Tags: lisp, racket, lambda, scheme Problem: Lambda in Racket Explained I am trying to understand lambda use in racket and I am still unclear. I get that they are unnamed (anonymous) functions but why is that good? I need to access my functions ...
Lambda in Racket Explained Lambda in Racket Explained lisp racket lambda scheme Lambda Racket Explained add27 Lambda in Racket Explained I am trying to understand lambda use in racket and I am still unclear. I get that they are unnamed (anonymous) functions but why is that good? I need to access my functions from other...
[ -0.00017642974853515625, 0.02783203125, -0.0024871826171875, 0.013671875, 0.00848388671875, 0.01019287109375, 0.026123046875, -0.003662109375, -0.0003814697265625, -0.0198974609375, 0.013671875, -0.038330078125, -0.01806640625, -0.00185394287109375, 0.01513671875, -0.00390625, -0.003...
[ 122930, 85, 23, 2552, 27853, 60075, 16442, 297, 400, 7008, 673, 21, 6492, 150370, 15190, 3768, 28219, 4527, 119488, 85589, 4806, 66, 45757, 32354, 15400, 83, 450, 4127, 17203, 11782, 2856, 73342, 19336, 1528, 35064, 17368, 11522 ]
[ 0.2061767578125, 0.1907958984375, 0.047882080078125, 0.1292724609375, 0.2235107421875, 0.031585693359375, 0.1055908203125, 0.013885498046875, 0.04254150390625, 0.1143798828125, 0.1162109375, 0.07073974609375, 0.200439453125, 0.1085205078125, 0.094970703125, 0.1866455078125, 0.0388183...
embed
12510086_c0
12510086
lisp
0
Title: Lisp code - how to run this example Problem title: Lisp code - how to run this example Tags: lisp Problem: Lisp code - how to run this example This comes from an interview for a sysadmin position. During the test, I discovered a cookie. It contained a message that was base64 encoded, next it was uuencoded, next ...
Lisp code - how to run this example Lisp code - how to run this example lisp x Lisp caaa..r cd..r Lisp code - how to run this example This comes from an interview for a sysadmin position. During the test, I discovered a cookie. It contained a message that was base64 encoded, next it was uuencoded, next was bzip, and la...
[ 0.006256103515625, 0.032470703125, 0.001861572265625, 0.0322265625, -0.0130615234375, 0.0303955078125, -0.00145721435546875, 0.02294921875, 0.00518798828125, -0.023193359375, -0.00994873046875, -0.01416015625, 0.003570556640625, 0.0186767578125, -0.0040283203125, -0.01031494140625, 0...
[ 1261, 7008, 18151, 3642, 47, 11675, 903, 27781, 400, 1022, 377, 11, 42, 56329, 33683, 954, 135087, 19069, 3034, 134053, 9332, 70541, 26008, 3647, 13307, 22, 40899, 2051, 66332, 11737, 876, 50836, 4568, 706, 8, 277, 11856, 25632, 5351, 442...
[ 0.192138671875, 0.25244140625, 0.2275390625, 0.1170654296875, 0.083984375, 0.201904296875, 0.1171875, 0.244140625, 0.162109375, 0.1015625, 0.05902099609375, 0.06646728515625, 0.07928466796875, 0.0555419921875, 0.046905517578125, 0.044036865234375, 0.1170654296875, 0.020736694335937...
embed
386854_c0
386854
lisp
0
Title: How do you type lisp efficiently, with so many parentheses? Problem title: How do you type lisp efficiently, with so many parentheses? Tags: emacs, lisp, scheme, touch-typing Problem: How do you type lisp efficiently, with so many parentheses? I try to keep my fingers on home row as much as possible. Typing all ...
How do you type lisp efficiently, with so many parentheses? How do you type lisp efficiently, with so many parentheses? emacs lisp scheme touch-typing How How do you type lisp efficiently, with so many parentheses? I try to keep my fingers on home row as much as possible. Typing all the parentheses makes me move away f...
[ -0.01019287109375, 0.01055908203125, -0.009765625, -0.01806640625, -0.031005859375, 0.003509521484375, -0.005828857421875, 0.002044677734375, -0.01202392578125, -0.017578125, 0.018798828125, -0.04248046875, -0.003692626953125, -0.00531005859375, -0.025634765625, -0.0135498046875, -0....
[ 11249, 54, 10644, 400, 7008, 93766, 538, 678, 221, 5941, 49129, 35412, 90, 352, 2263, 7, 150370, 23996, 46280, 398, 9790, 13695, 51287, 98, 5368, 15555, 5045, 7722, 33417, 756, 25813, 16065, 2685, 44075, 4527, 85269, 4439, 31089, 104577, ...
[ 0.0733642578125, 0.0283355712890625, 0.229736328125, 0.151123046875, 0.194091796875, 0.1990966796875, 0.035491943359375, 0.07354736328125, 0.07940673828125, 0.114501953125, 0.16357421875, 0.190185546875, 0.0863037109375, 0.052947998046875, 0.0909423828125, 0.03009033203125, 0.1085205...
embed
42236597_c0
42236597
lisp
0
Title: How to save append return in Lisp variable? Problem title: How to save append return in Lisp variable? Tags: lisp, common-lisp Problem: How to save append return in Lisp variable? (defun test(n x) (let* (d (append (list n) x))) (if (= n 0) d (test (- n 1) d))) So this is a basic test function I'm writing in lisp...
How to save append return in Lisp variable? How to save append return in Lisp variable? lisp common-lisp How Lisp NIL How to save append return in Lisp variable? So this is a basic test function I'm writing in lisp. The function is supposed to take a number(n) and a list(x) in and appends every number between n and 0 t...
[ -0.00872802734375, 0.0185546875, 0.01177978515625, 0.005950927734375, 0.01165771484375, 0.02880859375, 0.00885009765625, 0.0196533203125, 0.0220947265625, 0.001617431640625, 0.00677490234375, -0.017333984375, -0.00787353515625, 0.00738525390625, 0.023681640625, 0.00159454345703125, 0...
[ 11249, 30098, 114689, 71, 30646, 23, 1261, 7008, 77336, 47, 400, 39210, 4086, 254, 16444, 62822, 3034, 32354, 32562, 134598, 5646, 14012, 19, 5303, 425, 6468, 11907, 17721, 653, 757, 176377, 11675, 17378, 3642, 4343, 11782, 3934 ]
[ 0.07086181640625, 0.197509765625, 0.221435546875, 0.1805419921875, 0.291748046875, 0.0509033203125, 0.1519775390625, 0.2088623046875, 0.24072265625, 0.030914306640625, 0.10272216796875, 0.0799560546875, 0.078857421875, 0.1485595703125, 0.0908203125, 0.08660888671875, 0.1214599609375,...
embed
9791891_c0
9791891
lisp
0
Title: Elisp ido mode with history for a list fo symbols Problem title: Elisp ido mode with history for a list fo symbols Tags: lisp, elisp, ido, history, emacs Problem: Elisp ido mode with history for a list fo symbols I have a finite list of symbols and I want to make an ido based user interface to select among them,...
Elisp ido mode with history for a list fo symbols Elisp ido mode with history for a list fo symbols lisp elisp ido history emacs Elisp What Elisp ido mode with history for a list fo symbols I have a finite list of symbols and I want to make an ido based user interface to select among them, but i also want this to be ab...
[ -0.0185546875, -0.0206298828125, 0.002685546875, 0.0087890625, 0.01080322265625, 0.01470947265625, -0.00057220458984375, 0.031982421875, 0.006134033203125, -0.01263427734375, -0.0086669921875, -0.01171875, -0.00151824951171875, 0.004852294921875, 0.006591796875, -0.0019378662109375, ...
[ 25318, 7008, 17, 246, 13736, 678, 32692, 100, 5303, 5775, 26582, 400, 15296, 2263, 94418, 3444, 35509, 38937, 101758, 36849, 54940, 19048, 37629, 1257, 903, 26866, 5941, 20028, 55076, 50997, 104988, 48903, 1380, 5701, 12989, 1919, 18, 47143, ...
[ 0.1202392578125, 0.2197265625, 0.0985107421875, 0.22265625, 0.1832275390625, 0.0504150390625, 0.1734619140625, 0.0107421875, 0.1588134765625, 0.098876953125, 0.1978759765625, 0.068115234375, 0.041595458984375, 0.031219482421875, 0.1019287109375, 0.042755126953125, 0.0650634765625, ...
embed
20719463_c0
20719463
lisp
0
Title: Can I use the function &quot;get&quot; with an assoc list? Problem title: Can I use the function &quot;get&quot; with an assoc list? Tags: common-lisp, lisp Problem: Can I use the function "get" with an assoc list? I have the following code: (setq months '((january 1) (february 2) ...)) Can I use get to use this...
Can I use the function &quot;get&quot; with an assoc list? Can I use the function &quot;get&quot; with an assoc list? common-lisp lisp Can Can I use the function "get" with an assoc list? I have the following code: Can I use get to use this list as a map (with keys and values) Like: and get the result: 1 Is it possible...
[ -0.00579833984375, 0.005462646484375, 0.02001953125, -0.022705078125, -0.018310546875, -0.0341796875, 0.005035400390625, 0.01123046875, 0.0125732421875, -0.03466796875, 0.01483154296875, 0.03662109375, -0.0040283203125, -0.02685546875, 0.003387451171875, 0.00848388671875, -0.02099609...
[ 4171, 87, 4527, 32354, 3794, 41502, 678, 63927, 238, 5303, 1230, 39210, 4086, 254, 400, 7008, 142, 18151, 2046, 903, 237, 22288, 76228, 22799, 142424, 16750, 7722, 54, 23, 1261, 143726, 53550, 183871, 151301, 220734 ]
[ 0.0880126953125, 0.021148681640625, 0.115234375, 0.16845703125, 0.2425537109375, 0.0032958984375, 0.1396484375, 0.1383056640625, 0.1414794921875, 0.2093505859375, 0.0292205810546875, 0.059295654296875, 0.074951171875, 0.10040283203125, 0.0750732421875, 0.19970703125, 0.01939392089843...
embed
38961519_c0
38961519
lisp
0
Title: How to describe and implement and interface in common lisp Problem title: How to describe and implement and interface in common lisp Tags: common-lisp, lisp, clos Problem: How to describe and implement and interface in common lisp I am implementing a graph data structure that will store arbitrary objects as vert...
How to describe and implement and interface in common lisp How to describe and implement and interface in common lisp common-lisp lisp clos How Vertex How to describe and implement and interface in common lisp I am implementing a graph data structure that will store arbitrary objects as vertices. I want to define an in...
[ 0.0081787109375, 0.0107421875, -0.005584716796875, 0.00133514404296875, 0.0074462890625, 0.00921630859375, 0.010009765625, 0.025634765625, 0.00897216796875, -0.018798828125, 0.00140380859375, -0.0277099609375, -0.01055908203125, 0.004150390625, -0.00927734375, 0.0230712890625, -0.002...
[ 11249, 98363, 136, 29479, 101758, 23, 39210, 400, 7008, 47, 4086, 254, 20450, 7, 1446, 24371, 41382, 2053, 45646, 4343, 61799, 36746, 95378, 5170, 3444, 61924, 20949, 22799, 756, 831, 102678, 13648, 4527, 46876, 79, 330, 19908, 224833 ]
[ 0.098388671875, 0.222412109375, 0.106201171875, 0.256103515625, 0.284912109375, 0.05413818359375, 0.1861572265625, 0.14599609375, 0.220458984375, 0.0178680419921875, 0.116943359375, 0.1419677734375, 0.170166015625, 0.0599365234375, 0.10357666015625, 0.1593017578125, 0.144775390625, ...
embed
8632075_c0
8632075
lisp
0
Title: LISP How can I associate a lambda function to a name/symbol to call it later? Problem title: LISP How can I associate a lambda function to a name/symbol to call it later? Tags: lisp, lambda Problem: LISP How can I associate a lambda function to a name/symbol to call it later? As the title says I want to give my ...
LISP How can I associate a lambda function to a name/symbol to call it later? LISP How can I associate a lambda function to a name/symbol to call it later? lisp lambda LISP How LISP How can I associate a lambda function to a name/symbol to call it later? As the title says I want to give my lambda function a name to cal...
[ 0.01043701171875, 0.018310546875, 0.00018405914306640625, 0.0126953125, -0.0159912109375, 0.0042724609375, 0.021484375, 0.0113525390625, 0.003997802734375, -0.036865234375, -0.0030670166015625, -0.0296630859375, 0.00390625, 0.00958251953125, -0.0081787109375, -0.0038909912109375, -0....
[ 16970, 9434, 11249, 831, 87, 30699, 67, 21, 6492, 85, 32354, 47, 9351, 176726, 11782, 14432, 400, 7008, 442, 3444, 8337, 23, 18151, 77336, 8110, 1884, 903, 7477, 15390, 11627, 83, 70541 ]
[ 0.119873046875, 0.2188720703125, 0.04388427734375, 0.0675048828125, 0.03192138671875, 0.203857421875, 0.122314453125, 0.0888671875, 0.203125, 0.1982421875, 0.2181396484375, 0.1092529296875, 0.1522216796875, 0.2021484375, 0.16552734375, 0.079833984375, 0.10089111328125, 0.1627197265...
embed
66167158_c0
66167158
lisp
0
Title: Running LISP code via CLISP on Linux (Ubuntu WSL) Problem title: Running LISP code via CLISP on Linux (Ubuntu WSL) Tags: lisp, clisp, common-lisp, linux, windows-subsystem-for-linux Problem: Running LISP code via CLISP on Linux (Ubuntu WSL) I am new to LISP and was wondering how to correctly run a simple lisp pr...
Running LISP code via CLISP on Linux (Ubuntu WSL) Running LISP code via CLISP on Linux (Ubuntu WSL) lisp clisp common-lisp linux windows-subsystem-for-linux Running LISP CLISP Linux Ubuntu WSL Running LISP code via CLISP on Linux (Ubuntu WSL) I am new to LISP and was wondering how to correctly run a simple lisp program...
[ 0.005615234375, 0.01312255859375, -0.0014190673828125, 0.0089111328125, -0.00994873046875, 0.01611328125, 0.0284423828125, -0.01953125, 0.0111083984375, -0.0079345703125, 0.00897216796875, 0.0118408203125, -0.0062255859375, 0.00119781494140625, -0.0108642578125, -0.01068115234375, 0....
[ 28398, 16970, 9434, 18151, 1829, 313, 67616, 683, 98, 29908, 79249, 34, 601, 30508, 400, 7008, 95701, 39210, 4086, 254, 11508, 54825, 22144, 16751, 2397, 6077, 116890, 3525, 26785, 11675, 8781, 1528, 11435, 4288, 24084, 112, 16498, 23, 18, ...
[ 0.116455078125, 0.15869140625, 0.271240234375, 0.1729736328125, 0.0732421875, 0.0626220703125, 0.1746826171875, 0.215576171875, 0.0565185546875, 0.235595703125, 0.0675048828125, 0.093017578125, 0.08160400390625, 0.1973876953125, 0.1541748046875, 0.2159423828125, 0.1396484375, 0.068...
embed
43568164_c0
43568164
lisp
0
Title: Scheme Match all given values in a list before returning true Problem title: Scheme Match all given values in a list before returning true Tags: scheme, lisp, racket Problem: Scheme Match all given values in a list before returning true I have a problem in my function where I'm only able to match 1 element in a ...
Scheme Match all given values in a list before returning true Scheme Match all given values in a list before returning true scheme lisp racket Scheme Match Scheme Match all given values in a list before returning true I have a problem in my function where I'm only able to match 1 element in a list, as soon as it hits t...
[ 0.0011444091796875, 0.0235595703125, -0.03076171875, 0.0133056640625, -0.006072998046875, 0.004974365234375, -0.0027923583984375, -0.005615234375, 0.00982666015625, 0.01513671875, 0.0172119140625, -0.00732421875, 0.015380859375, -0.00323486328125, 0.00055694580078125, 0.000442504882812...
[ 34702, 282, 67407, 756, 34475, 142424, 23, 5303, 8108, 30646, 29568, 150370, 400, 7008, 673, 27853, 214, 2967, 32354, 4734, 19048, 47, 14858, 106, 12830, 10, 33662, 5962, 5117, 50339, 18, 3444, 70, 1022, 418, 159019, 10078, 101655, 15044, ...
[ 0.216552734375, 0.132568359375, 0.29150390625, 0.154052734375, 0.1124267578125, 0.173095703125, 0.0792236328125, 0.207763671875, 0.13037109375, 0.1806640625, 0.188720703125, 0.2236328125, 0.08026123046875, 0.1566162109375, 0.0782470703125, 0.1849365234375, 0.0192413330078125, 0.117...
embed
10018815_c0
10018815
lisp
0
Title: Registering click events for emacs lisp Problem title: Registering click events for emacs lisp Tags: emacs, lisp Problem: Registering click events for emacs lisp I want to register a click event and do actions based on the position , window ..etc. This site, http://www.gnu.org/software/emacs/manual/html_node/eli...
Registering click events for emacs lisp Registering click events for emacs lisp emacs lisp Registering www.gnu.org html_node Click-Events.html mouse-1 Registering click events for emacs lisp I want to register a click event and do actions based on the position , window ..etc. This site, http://www.gnu.org/software/emac...
[ 0.002349853515625, 0.00799560546875, -0.0089111328125, -0.0242919921875, -0.01324462890625, 0.00689697265625, -0.0027618408203125, -0.01287841796875, -0.0003948211669921875, -0.05029296875, -0.0022735595703125, -0.000972747802734375, -0.0172119140625, -0.0130615234375, -0.003662109375, ...
[ 131423, 214, 18158, 47353, 100, 352, 2263, 7, 400, 7008, 104155, 1478, 7693, 157, 112, 21138, 192134, 114669, 5759, 3444, 68067, 19732, 54, 61972, 35509, 19069, 76896, 111879, 1764, 155247, 11883, 4439, 669, 20605, 28967, 254, 181671, 45831, ...
[ 0.21630859375, 0.02398681640625, 0.252197265625, 0.2252197265625, 0.0716552734375, 0.09906005859375, 0.1453857421875, 0.0908203125, 0.1253662109375, 0.192138671875, 0.1591796875, 0.09259033203125, 0.11767578125, 0.095458984375, 0.023162841796875, 0.215576171875, 0.1871337890625, 0....
embed
23312290_c0
23312290
lisp
0
Title: LISP Can anyone explain me this cond example? Problem title: LISP Can anyone explain me this cond example? Tags: lisp Problem: LISP Can anyone explain me this cond example? (defun Left (state) (setq new_place (- (second state) 1)) (cond ((endp state) NIL) ((= (first state) 1) NIL) (T (> (second state) 1) (list s...
LISP Can anyone explain me this cond example? LISP Can anyone explain me this cond example? lisp LISP Can Left new_place NIL LISP Can anyone explain me this cond example? I cannot understand this line ((endp state) NIL) that NIL drives me crazy whats the purpose of it ? i understand endp state will result True or NIL. ...
[ -0.0146484375, 0.01275634765625, 0.00439453125, 0.0012054443359375, -0.01953125, 0.0125732421875, 0.0206298828125, 0.019775390625, 0.00095367431640625, 0.006866455078125, 0.015380859375, -0.002227783203125, -0.00958251953125, -0.005340576171875, -0.0107421875, 0.01507568359375, 0.023...
[ 16970, 9434, 35672, 73342, 163, 903, 158, 71, 27781, 400, 7008, 4171, 636, 2480, 3525, 23935, 541, 16444, 53418, 28219, 13315, 3611, 254, 11341, 22648, 7, 116666, 60042, 3564, 16750, 87599, 50339, 1221, 765, 618, 26785, 63805 ]
[ 0.117919921875, 0.210205078125, 0.01519775390625, 0.09814453125, 0.0232086181640625, 0.042083740234375, 0.0950927734375, 0.0843505859375, 0.1759033203125, 0.103515625, 0.1815185546875, 0.06396484375, 0.031402587890625, 0.1240234375, 0.10321044921875, 0.17529296875, 0.1181640625, 0....
embed
5135815_c0
5135815
lisp
0
Title: How to find the median of list in scheme Problem title: How to find the median of list in scheme Tags: computer-science, scheme, lisp, median Problem: How to find the median of list in scheme I am new to Scheme and I am using Dr.Racket to try to find the median of the list. For example, (median 2 1 3) should ret...
How to find the median of list in scheme How to find the median of list in scheme computer-science scheme lisp median How r6rs Enter How to find the median of list in scheme I am new to Scheme and I am using Dr.Racket to try to find the median of the list. For example, (median 2 1 3) should return 2 and (median 1 1 5 5...
[ -0.0260009765625, 0.01165771484375, 0.0233154296875, -0.0023040771484375, -0.0023956298828125, 0.005157470703125, 0.0001697540283203125, -0.0006561279296875, -0.0244140625, -0.0185546875, -0.01055908203125, -0.02783203125, -0.01953125, -0.01385498046875, 0.004364013671875, -0.006835937...
[ 11249, 47, 7413, 70, 2450, 19, 111, 5303, 23, 150370, 13909, 175201, 400, 7008, 1690, 910, 4295, 60816, 3525, 34702, 282, 17368, 1773, 12248, 27853, 9790, 12333, 116, 106, 8439, 5608, 30646, 190, 27804, 627, 305, 18912, 29458, 107003, 452...
[ 0.07427978515625, 0.014801025390625, 0.1265869140625, 0.06500244140625, 0.231689453125, 0.197021484375, 0.111328125, 0.2281494140625, 0.08868408203125, 0.25341796875, 0.0745849609375, 0.1019287109375, 0.05059814453125, 0.124755859375, 0.0157470703125, 0.0780029296875, 0.113037109375,...
embed
45684839_c0
45684839
lisp
0
Title: What is the equivalent of Let Over Lambda in Scala? Problem title: What is the equivalent of Let Over Lambda in Scala? Tags: closures, scala, lisp Problem: What is the equivalent of Let Over Lambda in Scala? I am trying to adapt "Land of Lisp" to Scala and I got stuck with the elegant way LISP can support memoiz...
What is the equivalent of Let Over Lambda in Scala? What is the equivalent of Let Over Lambda in Scala? closures scala lisp What Over Lambda Scala What is the equivalent of Let Over Lambda in Scala? I am trying to adapt "Land of Lisp" to Scala and I got stuck with the elegant way LISP can support memoization by using t...
[ 0.0269775390625, 0.01220703125, -0.01483154296875, 0.0103759765625, 0.0101318359375, -0.00738525390625, 0.00787353515625, 0.0101318359375, -0.0030364990234375, -0.0400390625, -0.016845703125, -0.01446533203125, 0.01092529296875, 0.0245361328125, 0.05517578125, -0.006744384765625, -0....
[ 4865, 183234, 10842, 9578, 122930, 85, 23, 152653, 11, 170224, 146232, 400, 7008, 39908, 94646, 111, 1261, 179933, 27650, 16970, 9434, 8060, 163, 432, 47691, 54704, 645, 103510, 27781, 105416, 2806, 903, 6713, 130078, 11522, 152132 ]
[ 0.0638427734375, 0.163330078125, 0.14599609375, 0.20947265625, 0.1878662109375, 0.1705322265625, 0.048187255859375, 0.21923828125, 0.146240234375, 0.1561279296875, 0.2044677734375, 0.083740234375, 0.17138671875, 0.0577392578125, 0.08984375, 0.1051025390625, 0.112548828125, 0.015762...
embed
4632461_c0
4632461
lisp
0
Title: Do property lists in Common Lisp refer to some global state? Problem title: Do property lists in Common Lisp refer to some global state? Tags: common-lisp, lisp, sbcl Problem: Do property lists in Common Lisp refer to some global state? The code below has z as a local variable, yet it behaves as if it is a globa...
Do property lists in Common Lisp refer to some global state? Do property lists in Common Lisp refer to some global state? common-lisp lisp sbcl Common Lisp STUFF Do property lists in Common Lisp refer to some global state? The code below has z as a local variable, yet it behaves as if it is a global: I would expect the...
[ 0.007659912109375, 0.01019287109375, 0.0005950927734375, 0.00020122528076171875, -0.0162353515625, 0.01324462890625, -0.001434326171875, 0.000904083251953125, 0.016357421875, -0.00799560546875, 0.0167236328125, 0.041748046875, -0.0025787353515625, -0.005584716796875, 0.0181884765625, 0...
[ 984, 57266, 5303, 7, 151301, 1261, 7008, 15005, 7964, 11341, 23, 3060, 39210, 4086, 254, 400, 275, 34937, 94432, 30110, 47, 18151, 35064, 1556, 97, 237, 4000, 77336, 14373, 186, 68991, 2174, 83, 10, 2806, 41206, 70, 140992, 1284, 51042, ...
[ 0.038177490234375, 0.23388671875, 0.2437744140625, 0.09307861328125, 0.177001953125, 0.13818359375, 0.196044921875, 0.1358642578125, 0.1678466796875, 0.158935546875, 0.0204925537109375, 0.0118255615234375, 0.114990234375, 0.08984375, 0.1318359375, 0.08477783203125, 0.06878662109375, ...
embed