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
59657321_c0
59657321
lisp
0
Title: lisp: the variable MARKEDIT is unbound Problem title: lisp: the variable MARKEDIT is unbound Tags: lisp, sbcl, common-lisp Problem: lisp: the variable MARKEDIT is unbound This is probably a simple fix, but I'm trying to walk through the MarkEdit example in the Ceramic tutorial , and I'm having trouble getting th...
lisp: the variable MARKEDIT is unbound lisp: the variable MARKEDIT is unbound lisp sbcl common-lisp MARKEDIT ql:quickload ceramic.bundler:bundle markedit.asd ceramic.bundler lisp: the variable MARKEDIT is unbound This is probably a simple fix, but I'm trying to walk through the MarkEdit example in the Ceramic tutorial ...
[ 0.0155029296875, 0.00162506103515625, -0.01031494140625, -0.0001964569091796875, -0.01165771484375, 0.0145263671875, 0.01263427734375, 0.0115966796875, 0.00396728515625, -0.0167236328125, -0.01043701171875, -0.00286865234375, 0.0135498046875, 0.00628662109375, 0.00921630859375, 0.00025...
[ 400, 7008, 77336, 125662, 66973, 618, 83, 51, 99091, 34937, 39210, 4086, 254, 99247, 3181, 63033, 161259, 28025, 603, 133, 94419, 217, 162, 71, 30022, 7880, 125270, 27781, 8759, 11, 21068, 57143, 63134, 20949, 102158, 45367, 43701, 28282, 5...
[ 0.1207275390625, 0.210693359375, 0.250732421875, 0.117431640625, 0.1756591796875, 0.1473388671875, 0.0439453125, 0.073974609375, 0.210693359375, 0.046844482421875, 0.058074951171875, 0.0670166015625, 0.149169921875, 0.049041748046875, 0.004638671875, 0.1822509765625, 0.2001953125, ...
embed
29548243_c0
29548243
lisp
0
Title: evaluate the car of a list as a function in lisp Problem title: evaluate the car of a list as a function in lisp Tags: lisp, common-lisp Problem: evaluate the car of a list as a function in lisp I am doing my homework and I need some help. I don't want you to do it for me just give me some guidance. What we need...
evaluate the car of a list as a function in lisp evaluate the car of a list as a function in lisp lisp common-lisp evaluate the car of a list as a function in lisp I am doing my homework and I need some help. I don't want you to do it for me just give me some guidance. What we need to do is write a function that takes ...
[ 0.004852294921875, 0.000484466552734375, 0.0172119140625, 0.0211181640625, 0.01312255859375, 0.0142822265625, 0.01300048828125, 0.0106201171875, 0.01080322265625, -0.058837890625, -0.015869140625, -0.0008697509765625, -0.0047607421875, -0.00689697265625, -0.013916015625, -0.01586914062...
[ 151575, 13, 2258, 111, 5303, 237, 32354, 23, 400, 7008, 39210, 4086, 254, 10, 759, 5368, 18244, 3871, 4358, 196219, 33022, 51776, 6626, 101935, 39933, 59121, 89160, 110, 22062, 6896, 997, 4958, 11180, 19388, 5701, 183114, 22183, 138, 5211, ...
[ 0.2149658203125, 0.0231781005859375, 0.23876953125, 0.08740234375, 0.2225341796875, 0.08453369140625, 0.230224609375, 0.03790283203125, 0.129150390625, 0.2001953125, 0.0809326171875, 0.0977783203125, 0.152587890625, 0.0069580078125, 0.0171356201171875, 0.04254150390625, 0.14880371093...
embed
37034911_c0
37034911
lisp
0
Title: Racket: take: contract violation Problem title: Racket: take: contract violation Tags: stream, functional-programming, lisp, racket Problem: Racket: take: contract violation I am using racket v6.5 repl on linux and trying to run example of take function from the stream tutorial https://docs.racket-lang.org/funct...
Racket: take: contract violation Racket: take: contract violation stream functional-programming lisp racket Racket Rec g1827317 Boxof Pairof Integer stream.rkt:41:7 list.rkt:151:0 misc.rkt:87:7 Racket: take: contract violation I am using racket v6.5 repl on linux and trying to run example of take function from the stre...
[ 0.00225830078125, 0.01220703125, -0.0018310546875, 0.00139617919921875, 0.00787353515625, 0.0108642578125, -0.0087890625, 0.0108642578125, -0.00113677978515625, -0.012939453125, 0.023681640625, -0.032470703125, 0.0021820068359375, 0.01513671875, 0.015380859375, -0.01080322265625, 0.0...
[ 2552, 27853, 5646, 12, 18264, 200265, 75973, 123309, 28966, 400, 7008, 673, 48224, 1819, 3768, 2489, 27271, 4390, 1342, 481, 44401, 7190, 18, 31982, 966, 5303, 135224, 53861, 1239, 19308, 17368, 81, 136473, 456, 2424, 11508, 6077, 31577, 11...
[ 0.13818359375, 0.25244140625, 0.2135009765625, 0.032958984375, 0.2271728515625, 0.25732421875, 0.2076416015625, 0.167724609375, 0.116455078125, 0.022430419921875, 0.116455078125, 0.1212158203125, 0.0770263671875, 0.010101318359375, 0.0091552734375, 0.058837890625, 0.142333984375, 0...
embed
42429827_c1
42429827
lisp
1
(aref sieve-numbers n) is nil if (+ 3 n n) is prime ;removed is the number of values in the sieve-numbers array that have been chopped off the front (defun sieve-knock (sieve-numbers n) "knock out the n'th value, then recurse with a sieve-numbers array that is missing the first n elements until (length sieve-numbers) ...
(aref sieve-numbers n) is nil if (+ 3 n n) is prime ;removed is the number of values in the sieve-numbers array that have been chopped off the front (defun sieve-knock (sieve-numbers n) "knock out the n'th value, then recurse with a sieve-numbers array that is missing the first n elements until (length sieve-numbers) ...
[ -0.0159912109375, 0.036865234375, 0.005218505859375, 0.00653076171875, -0.01177978515625, -0.00077056884765625, -0.001434326171875, 0.0040283203125, -0.005157470703125, 0.0228271484375, 0.011962890625, 0.0101318359375, -0.00518798828125, 0.0020599365234375, 0.0036163330078125, -0.01257...
[ 15, 11, 29087, 78, 3134, 2606, 1297, 7, 653, 83, 17324, 2174, 22183, 138, 20809, 2819, 26973, 4126, 14012, 142424, 10298, 53, 765, 2809, 681, 48398, 5773, 12912, 112, 16498, 9, 92, 157, 2594, 172, 44, 1810, 927, 34292, 195625, 13, 132...
[ 0.0295257568359375, 0.03216552734375, 0.255126953125, 0.18798828125, 0.29345703125, 0.2156982421875, 0.21484375, 0.021331787109375, 0.170166015625, 0.07916259765625, 0.218505859375, 0.05804443359375, 0.139892578125, 0.146240234375, 0.2393798828125, 0.019989013671875, 0.2093505859375,...
embed
38579435_c0
38579435
lisp
0
Title: Expanding macros inside dolist Problem title: Expanding macros inside dolist Tags: lisp, eval, macros, function, emacs Problem: Expanding macros inside dolist How can I expand a macro that adds symbols to the obarray (here defun ) inside another loop macro like a dolist ? For example, (defmacro make-cmd (cmd &op...
Expanding macros inside dolist Expanding macros inside dolist lisp eval macros function emacs Expanding Some Called fn-f1 fn-f2 Expanding macros inside dolist How can I expand a macro that adds symbols to the obarray (here defun ) inside another loop macro like a dolist ? For example, I would like to be able to just re...
[ 0.01165771484375, -0.0084228515625, -0.00909423828125, 0.02099609375, -0.0234375, 0.0294189453125, 0.004302978515625, 0.00982666015625, 0.003997802734375, -0.0133056640625, -0.0155029296875, -0.00958251953125, 0.003265380859375, -0.01025390625, -0.006103515625, -0.0245361328125, -0.0...
[ 60075, 11, 33770, 111789, 7, 46132, 54, 6562, 400, 7008, 28, 1405, 32354, 352, 2263, 26265, 14783, 420, 418, 304, 831, 71062, 15190, 26582, 47, 36, 88500, 53, 35593, 8, 16498, 15700, 40956, 1884, 19048, 64209, 9969, 645, 123055, 39210, ...
[ 0.1102294921875, 0.1220703125, 0.0631103515625, 0.2333984375, 0.07275390625, 0.1607666015625, 0.1488037109375, 0.253662109375, 0.079833984375, 0.1728515625, 0.014251708984375, 0.198974609375, 0.1368408203125, 0.0233154296875, 0.09912109375, 0.013824462890625, 0.097900390625, 0.0673...
embed
15765143_c0
15765143
lisp
0
Title: LISP - Modify String Problem title: LISP - Modify String Tags: common-lisp, lisp, string Problem: LISP - Modify String I have to write a program that changes a string's vowels, consonants and other symbols into C, V respectively 0. I've done this but I wonder if there is a more efficient and elegant way to do it...
LISP - Modify String LISP - Modify String common-lisp lisp string LISP Modify LISP - Modify String I have to write a program that changes a string's vowels, consonants and other symbols into C, V respectively 0. I've done this but I wonder if there is a more efficient and elegant way to do it. Would appreciate input. M...
[ -0.01055908203125, -0.0025177001953125, -0.016357421875, 0.032470703125, -0.0027618408203125, 0.0021514892578125, -0.01092529296875, -0.0030670166015625, 0.01318359375, 0.0234375, -0.00927734375, -0.0091552734375, 0.009033203125, 0.002716064453125, -0.02685546875, 0.0017547607421875, ...
[ 16970, 9434, 20, 16269, 40383, 23351, 214, 39210, 4086, 254, 400, 7008, 79315, 87, 765, 33022, 1528, 65572, 2244, 8420, 158, 1681, 10840, 26582, 3934, 313, 4, 310, 107013, 757, 32195, 1286, 93766, 27650, 3917, 77947, 107730, 1884, 3249, 4...
[ 0.1595458984375, 0.2406005859375, 0.040771484375, 0.1802978515625, 0.182861328125, 0.22265625, 0.0833740234375, 0.13525390625, 0.132080078125, 0.1807861328125, 0.1453857421875, 0.1895751953125, 0.26513671875, 0.004058837890625, 0.0408935546875, 0.1220703125, 0.1741943359375, 0.2182...
embed
6403697_c0
6403697
lisp
0
Title: What are "not so well defined problems" that LISP is supposed to solve? Problem title: What are "not so well defined problems" that LISP is supposed to solve? Tags: lisp Problem: What are "not so well defined problems" that LISP is supposed to solve? Most people agree that LISP helps to solve...
What are "not so well defined problems" that LISP is supposed to solve? What are "not so well defined problems" that LISP is supposed to solve? lisp What LISP What are "not so well defined problems" that LISP is supposed to solve? Most people agree that LISP helps to solve problems that are not well...
[ 0.01031494140625, 0.01416015625, 0.005859375, 0.022705078125, -0.0211181640625, 0.0274658203125, 0.003936767578125, -0.002288818359375, 0.015625, 0.0201416015625, 0.008544921875, 0.0012359619140625, -0.0137939453125, 0.035888671875, -0.0023040771484375, 0.014404296875, 0.005004882812...
[ 4865, 10869, 221, 5299, 61924, 71, 44402, 16970, 9434, 83, 134598, 86869, 400, 7008, 621, 450, 47, 53520, 112397, 959, 89554, 217064, 86595, 13452, 122116, 13648, 117414, 3714, 2967, 31577, 106001, 18831, 12741, 77758, 19686, 9433, 46876, 413...
[ 0.0894775390625, 0.1573486328125, 0.12646484375, 0.1251220703125, 0.2213134765625, 0.093017578125, 0.20166015625, 0.1861572265625, 0.278564453125, 0.017669677734375, 0.14111328125, 0.16064453125, 0.1580810546875, 0.2366943359375, 0.0166473388671875, 0.00433349609375, 0.04757690429687...
embed
65153166_c0
65153166
lisp
0
Title: Issue with extra nils in quicksort result Problem title: Issue with extra nils in quicksort result Tags: common-lisp, lisp, quicksort Problem: Issue with extra nils in quicksort result I'm new to lisp, and am writing code for quicksort. I am almost done, although the output is giving me some trouble. This is cur...
Issue with extra nils in quicksort result Issue with extra nils in quicksort result common-lisp lisp quicksort Issue NIL Issue with extra nils in quicksort result I'm new to lisp, and am writing code for quicksort. I am almost done, although the output is giving me some trouble. This is currently what I have: This work...
[ 0.00421142578125, 0.01324462890625, 0.011962890625, -0.038330078125, -0.022705078125, 0.006988525390625, 0.0091552734375, -0.0152587890625, -0.010498046875, 0.017333984375, -0.0081787109375, 0.016845703125, 0.009521484375, -0.00927734375, -0.0068359375, -0.007293701171875, -0.0076904...
[ 223317, 678, 4173, 300, 8080, 23, 63773, 62351, 16750, 39210, 4086, 254, 400, 7008, 541, 16444, 3525, 32562, 18151, 39555, 16940, 140992, 63134, 82424, 43240, 1284, 33342, 1884, 903, 7440, 136, 14922, 49129, 35412, 38162, 1295, 30022, 67660, ...
[ 0.14404296875, 0.04461669921875, 0.1773681640625, 0.1580810546875, 0.200927734375, 0.040374755859375, 0.15185546875, 0.2484130859375, 0.189453125, 0.08905029296875, 0.07403564453125, 0.1285400390625, 0.07733154296875, 0.1505126953125, 0.1102294921875, 0.16943359375, 0.018310546875, ...
embed
40118526_c0
40118526
lisp
0
Title: Building the filter built-in function with Racket Problem title: Building the filter built-in function with Racket Tags: racket, sicp, lisp, functional-programming, filter Problem: Building the filter built-in function with Racket I am trying to build filter (a built-in function) using Racket just as a matter of...
Building the filter built-in function with Racket Building the filter built-in function with Racket racket sicp lisp functional-programming filter Building Racket lista-1 lista-2 Building the filter built-in function with Racket I am trying to build filter (a built-in function) using Racket just as a matter of practice...
[ -0.01409912109375, 0.0242919921875, -0.0078125, 0.00112152099609375, -0.00543212890625, 0.0208740234375, -0.0145263671875, 0.0034027099609375, 0.01092529296875, -0.01055908203125, 0.00457763671875, -0.0147705078125, -0.01220703125, -0.01275634765625, -0.004608154296875, 0.0038604736328...
[ 104919, 46312, 88303, 73, 32354, 678, 2552, 27853, 673, 26536, 254, 7008, 123309, 28966, 5875, 5428, 31577, 45367, 17368, 41361, 75935, 25632, 18151, 10846, 109921, 13606, 2953, 26301, 2606, 1297, 78292, 9, 137175, 140992, 26785, 13648, 86681, ...
[ 0.1309814453125, 0.246826171875, 0.1522216796875, 0.138427734375, 0.1405029296875, 0.0753173828125, 0.1361083984375, 0.244873046875, 0.10888671875, 0.001678466796875, 0.070556640625, 0.0889892578125, 0.0802001953125, 0.060089111328125, 0.148193359375, 0.0250701904296875, 0.0138244628...
embed
27647214_c0
27647214
lisp
0
Title: Lisp: why did `eval` lose favor after lexical scoping was introduced? Problem title: Lisp: why did `eval` lose favor after lexical scoping was introduced? Tags: eval, lisp Problem: Lisp: why did `eval` lose favor after lexical scoping was introduced? Just came across a quote from Peter Norvig in Paradigms in AI ...
Lisp: why did `eval` lose favor after lexical scoping was introduced? Lisp: why did `eval` lose favor after lexical scoping was introduced? eval lisp Lisp Lisp: why did `eval` lose favor after lexical scoping was introduced? Just came across a quote from Peter Norvig in Paradigms in AI Programing: There are considerati...
[ 0.011474609375, 0.029052734375, 0.015625, 0.0147705078125, -0.00860595703125, -0.0096435546875, 0.00933837890625, 0.01007080078125, 0.00897216796875, -0.0194091796875, 0.002593994140625, -0.0033111572265625, -0.005828857421875, -0.0157470703125, 0.01025390625, -0.00165557861328125, -...
[ 1261, 7008, 15400, 13, 1405, 388, 10862, 7103, 75675, 21533, 44679, 214, 65508, 28, 400, 6777, 66747, 7948, 24299, 4803, 38730, 7663, 177229, 959, 4127, 6528, 60892, 182809, 84079, 146981, 77336, 39864, 162466, 39210, 13373, 28016, 8108 ]
[ 0.127685546875, 0.1651611328125, 0.1129150390625, 0.0904541015625, 0.2939453125, 0.12744140625, 0.2025146484375, 0.06134033203125, 0.132080078125, 0.1822509765625, 0.1453857421875, 0.058502197265625, 0.0640869140625, 0.1129150390625, 0.1138916015625, 0.009674072265625, 0.041168212890...
embed
67934577_c0
67934577
lisp
0
Title: Common Lisp: Any way to avoid defvar or defparameter? Problem title: Common Lisp: Any way to avoid defvar or defparameter? Tags: lisp, sbcl, common-lisp Problem: Common Lisp: Any way to avoid defvar or defparameter? I'm using SBCL 2.0.1.debian and Paul Graham's ANSI Common Lisp to learn Lisp. Right in Chapter 2 ...
Common Lisp: Any way to avoid defvar or defparameter? Common Lisp: Any way to avoid defvar or defparameter? lisp sbcl common-lisp Common Lisp Any Common Lisp: Any way to avoid defvar or defparameter? I'm using SBCL 2.0.1.debian and Paul Graham's ANSI Common Lisp to learn Lisp. Right in Chapter 2 though, I'm realizing t...
[ 0.00335693359375, 0.00823974609375, -0.00165557861328125, 0.004302978515625, -0.0162353515625, 0.0014495849609375, -0.0023040771484375, 0.0240478515625, 0.007598876953125, -0.0230712890625, 0.01153564453125, -0.00811767578125, 0.0052490234375, 0.00604248046875, 0.0023193359375, 0.01171...
[ 151301, 1261, 7008, 12, 28541, 3917, 71864, 8, 420, 1961, 707, 6276, 29089, 400, 275, 34937, 39210, 4086, 254, 47, 17368, 90944, 37486, 16655, 22892, 112, 62806, 10208, 147756, 14368, 9902, 30698, 117615, 116, 14823, 53418, 4527, 5423, 1884...
[ 0.1883544921875, 0.1732177734375, 0.2286376953125, 0.006317138671875, 0.05328369140625, 0.0865478515625, 0.235595703125, 0.2015380859375, 0.192138671875, 0.270263671875, 0.0921630859375, 0.1680908203125, 0.178955078125, 0.1058349609375, 0.04315185546875, 0.1351318359375, 0.1373291015...
embed
73963225_c0
73963225
lisp
0
Title: How to pass a variable and a list in a lisp function Problem title: How to pass a variable and a list in a lisp function Tags: lisp, common-lisp Problem: How to pass a variable and a list in a lisp function Apologies if this is a beginner question. Harsh comments are welcome. I am learning LISP and got a snippet...
How to pass a variable and a list in a lisp function How to pass a variable and a list in a lisp function lisp common-lisp How Output How to pass a variable and a list in a lisp function Apologies if this is a beginner question. Harsh comments are welcome. I am learning LISP and got a snippet like the below. It checks ...
[ 0.00433349609375, 0.03369140625, 0.006072998046875, -0.0211181640625, 0.006378173828125, 0.017578125, -0.003814697265625, 0.00799560546875, 0.00531005859375, -0.01220703125, 0.0157470703125, -0.015625, -0.00052642822265625, -0.006866455078125, 0.00836181640625, 0.007171630859375, 0.0...
[ 11249, 27875, 10, 77336, 136, 5303, 23, 400, 7008, 32354, 39210, 4086, 254, 13538, 18709, 1950, 16970, 9434, 35064, 12765, 53697, 34292, 30646, 80854, 117396, 3642, 46132, 195625, 5844, 2811, 40383, 64457, 452, 190, 16487 ]
[ 0.0618896484375, 0.1756591796875, 0.0214385986328125, 0.2919921875, 0.134765625, 0.214599609375, 0.0234375, 0.1396484375, 0.2086181640625, 0.1678466796875, 0.07373046875, 0.06884765625, 0.123779296875, 0.055511474609375, 0.010162353515625, 0.011260986328125, 0.0859375, 0.1793212890...
embed
43210505_c0
43210505
lisp
0
Title: Elisp: How to push-back to a list Problem title: Elisp: How to push-back to a list Tags: elisp, lisp Problem: Elisp: How to push-back to a list Is there a way to push-back to a list in elisp? The closest thing I found was (add-to-list 'myList myValue t) ;; t tells it to put to back of the list The problem, howev...
Elisp: How to push-back to a list Elisp: How to push-back to a list elisp lisp Elisp How List Elisp: How to push-back to a list Is there a way to push-back to a list in elisp? The closest thing I found was The problem, however, is that add-to-list enforces uniqueness. The other alternative is (push 'myList myVal) but t...
[ 0.012451171875, 0.04541015625, 0.009033203125, 0.00124359130859375, -0.00506591796875, 0.01953125, 0.004119873046875, 0.007354736328125, 0.0201416015625, -0.0262451171875, 0.00921630859375, 0.0048828125, 0.00311279296875, -0.0030670166015625, -0.0211181640625, -0.00933837890625, -0.0...
[ 25318, 7008, 11249, 47, 25944, 9, 12620, 10, 5303, 15296, 400, 32036, 3917, 23, 20903, 2967, 15190, 188, 6562, 22, 50930, 36998, 7432, 30700, 7332, 1176, 154663, 759, 42272, 831, 4734, 12912, 37842, 17368, 25553, 30646, 79786, 6002, 86531, ...
[ 0.1181640625, 0.24560546875, 0.1119384765625, 0.20166015625, 0.2181396484375, 0.06640625, 0.285400390625, 0.0290069580078125, 0.2418212890625, 0.1107177734375, 0.03863525390625, 0.197021484375, 0.1102294921875, 0.0257568359375, 0.068603515625, 0.1142578125, 0.1397705078125, 0.18237...
embed
66316906_c0
66316906
lisp
0
Title: Giving Variable The Same Name As Command Crashes App Problem title: Giving Variable The Same Name As Command Crashes App Tags: lisp, autolisp Problem: Giving Variable The Same Name As Command Crashes App I found a rather strange behavior in autoLISP where when you access a variable, (setq L 1) , that has the sam...
Giving Variable The Same Name As Command Crashes App Giving Variable The Same Name As Command Crashes App lisp autolisp Giving Variable Same Name Command Crashes App Giving Variable The Same Name As Command Crashes App I found a rather strange behavior in autoLISP where when you access a variable, (setq L 1) , that has...
[ 0.0034332275390625, 0.0047607421875, -0.007781982421875, -0.0045166015625, 0.006866455078125, 0.0230712890625, -0.0031280517578125, 0.029052734375, -0.0164794921875, -0.0228271484375, 0.00811767578125, 0.013916015625, 0.01904296875, -0.0020599365234375, -0.0003070831298828125, 0.001472...
[ 5174, 6496, 84572, 2886, 581, 99908, 15757, 1301, 123573, 34156, 35412, 5659, 400, 7008, 1809, 4086, 254, 43257, 114453, 123166, 67616, 683, 17203, 77336, 3509, 864, 339, 4879, 5701, 9351, 441, 712, 55109, 11782, 13315, 75101, 903, 150631, ...
[ 0.0809326171875, 0.0217132568359375, 0.20556640625, 0.1524658203125, 0.006744384765625, 0.172607421875, 0.16796875, 0.0823974609375, 0.2208251953125, 0.171142578125, 0.1707763671875, 0.1842041015625, 0.08740234375, 0.175048828125, 0.14599609375, 0.1099853515625, 0.1192626953125, 0....
embed
65468203_c0
65468203
lisp
0
Title: Weird "EVAL: undefined function T" error in Common LISP Problem title: Weird "EVAL: undefined function T" error in Common LISP Tags: eval, undefined-function, lisp, common-lisp Problem: Weird "EVAL: undefined function T" error in Common LISP I'm writing a function in Common Lisp, but I'm gett...
Weird "EVAL: undefined function T" error in Common LISP Weird "EVAL: undefined function T" error in Common LISP eval undefined-function lisp common-lisp Weird EVAL Common LISP MOST-POSITIVE-DOUBLE-FLOAT Weird "EVAL: undefined function T" error in Common LISP I'm writing a function in Common Lisp, bu...
[ 0.005126953125, 0.0174560546875, 0.003173828125, -0.0048828125, -0.01300048828125, -0.0289306640625, 0.0072021484375, 0.016357421875, -0.0007171630859375, -0.047119140625, 0.00823974609375, 0.00628662109375, 0.02490234375, -0.0218505859375, 0.0068359375, 0.00860595703125, 0.001129150...
[ 1401, 82249, 647, 61152, 9232, 5983, 297, 32354, 384, 1230, 41502, 18499, 151301, 16970, 9434, 28, 1405, 137175, 400, 7008, 39210, 4086, 254, 241, 34274, 91383, 568, 32616, 125149, 17014, 23, 32562, 1261, 9969, 34759, 58359, 3794, 126234, 6...
[ 0.009368896484375, 0.154052734375, 0.0809326171875, 0.265625, 0.13134765625, 0.2060546875, 0.030548095703125, 0.18408203125, 0.2071533203125, 0.007293701171875, 0.004608154296875, 0.2183837890625, 0.15966796875, 0.134765625, 0.1829833984375, 0.05377197265625, 0.22607421875, 0.16845...
embed
962101_c0
962101
lisp
0
Title: how do I get CLSQL to look for mysql.h in non-standard directory? Problem title: how do I get CLSQL to look for mysql.h in non-standard directory? Tags: lisp, sql Problem: how do I get CLSQL to look for mysql.h in non-standard directory? in the error log: CLSQL is doing: gcc -I /usr/local/include/mysql -I /usr/i...
how do I get CLSQL to look for mysql.h in non-standard directory? how do I get CLSQL to look for mysql.h in non-standard directory? lisp sql -fPIC CLSQL mysql.h clsql_mysql.c clsql_mysql.o how do I get CLSQL to look for mysql.h in non-standard directory? in the error log: CLSQL is doing: and gets error: clsql_mysql.c:3...
[ 0.0018768310546875, 0.01513671875, 0.00836181640625, -0.000347137451171875, -0.01348876953125, 0.0269775390625, -0.0264892578125, 0.00494384765625, -0.01434326171875, -0.031494140625, 0.01019287109375, -0.00946044921875, -0.0208740234375, -0.020263671875, -0.01251220703125, -0.00582885...
[ 3642, 2046, 46323, 158897, 47, 6713, 100, 759, 7, 99247, 5, 127, 351, 66589, 14364, 53, 23, 400, 7008, 126091, 33139, 74277, 238, 31, 18499, 12684, 20594, 30197, 23988, 438, 6044, 11435, 707, 147306, 313, 6637, 18, 26698, 10336, 56, 344...
[ 0.0246734619140625, 0.0765380859375, 0.179443359375, 0.28173828125, 0.02203369140625, 0.1153564453125, 0.1112060546875, 0.1331787109375, 0.0667724609375, 0.2266845703125, 0.0194549560546875, 0.2374267578125, 0.12890625, 0.1903076171875, 0.1190185546875, 0.075927734375, 0.053588867187...
embed
17759178_c0
17759178
lisp
0
Title: Why is "else" a special symbol in scheme? Can it be defined as a procedure? Problem title: Why is "else" a special symbol in scheme? Can it be defined as a procedure? Tags: lisp, scheme Problem: Why is "else" a special symbol in scheme? Can it be defined as a procedure? I started learning Sch...
Why is "else" a special symbol in scheme? Can it be defined as a procedure? Why is "else" a special symbol in scheme? Can it be defined as a procedure? lisp scheme Why Can Why is "else" a special symbol in scheme? Can it be defined as a procedure? I started learning Scheme recently by reading SICP. ...
[ 0.000652313232421875, 0.00830078125, 0.00872802734375, -0.01129150390625, 0.0118408203125, 0.00110626220703125, -0.006378173828125, 0.0150146484375, -0.01092529296875, -0.0016632080078125, 0.004150390625, -0.00885009765625, -0.0135498046875, -0.0145263671875, -0.00028228759765625, 0.01...
[ 44084, 83, 5557, 41502, 5361, 26582, 23, 150370, 4171, 61924, 50491, 400, 7008, 10, 237, 52080, 34702, 282, 198993, 35431, 17368, 37076, 28032, 158, 71, 146981, 3173, 29481, 56, 20314, 93002, 1672, 15400, 959, 11476, 491, 7560, 10644, 4879,...
[ 0.1553955078125, 0.056488037109375, 0.2578125, 0.0697021484375, 0.19970703125, 0.246826171875, 0.06500244140625, 0.2186279296875, 0.085693359375, 0.1654052734375, 0.19921875, 0.054779052734375, 0.1536865234375, 0.053009033203125, 0.02099609375, 0.020751953125, 0.1324462890625, 0.11...
embed
7279721_c0
7279721
lisp
0
Title: Running Emacs ispell command doesn't ask confirmation to save to private dictionary Problem title: Running Emacs ispell command doesn't ask confirmation to save to private dictionary Tags: lisp, aspell, ispell, emacs Problem: Running Emacs ispell command doesn't ask confirmation to save to private dict...
Running Emacs ispell command doesn't ask confirmation to save to private dictionary Running Emacs ispell command doesn't ask confirmation to save to private dictionary lisp aspell ispell emacs Running Emacs Running Emacs ispell command doesn't ask confirmation to save to private dictionary Everytime I run isp...
[ -0.01422119140625, 0.0252685546875, 0.004547119140625, 0.01123046875, -0.014892578125, 0.0361328125, -0.00689697265625, -0.0081787109375, -0.0169677734375, -0.004638671875, 0.0194091796875, 0.016845703125, -0.0308837890625, 0.0238037109375, 0.00341796875, -0.00927734375, 0.0112304687...
[ 28398, 85269, 4439, 83, 117515, 75101, 3768, 18, 26458, 169935, 30098, 47, 14375, 45, 10763, 400, 7008, 237, 352, 2263, 6635, 6032, 11675, 123759, 15190, 8966, 3444, 959, 3564, 15504, 5773, 191082, 5609, 20537, 3357, 51, 10015, 4842, 1379, ...
[ 0.072021484375, 0.1673583984375, 0.161376953125, 0.131591796875, 0.280517578125, 0.17138671875, 0.038055419921875, 0.0638427734375, 0.1461181640625, 0.228515625, 0.2109375, 0.08258056640625, 0.18359375, 0.052734375, 0.1248779296875, 0.0423583984375, 0.13720703125, 0.015106201171875...
embed
44247858_c0
44247858
lisp
0
Title: Deep reverse function in Lisp Problem title: Deep reverse function in Lisp Tags: lisp, common-lisp Problem: Deep reverse function in Lisp I want to write a deep reverse function in Lisp, with only relying on the original reverse function that Lisp provides, and some other common things. I think it is kind of eas...
Deep reverse function in Lisp Deep reverse function in Lisp lisp common-lisp Deep Lisp Deep reverse function in Lisp I want to write a deep reverse function in Lisp, with only relying on the original reverse function that Lisp provides, and some other common things. I think it is kind of easier to do it using a map, su...
[ -0.00183868408203125, 0.041748046875, 0.00811767578125, 0.0052490234375, -0.00439453125, 0.01300048828125, 0.00104522705078125, 0.0050048828125, 0.0172119140625, -0.023681640625, 0.0081787109375, 0.01153564453125, 0.01171875, 0.033935546875, 0.0152587890625, 0.0172119140625, 0.008056...
[ 62723, 39531, 184, 32354, 23, 1261, 7008, 400, 39210, 4086, 254, 3444, 33022, 53894, 538, 7311, 87344, 8966, 99156, 17368, 22288, 50961, 41884, 2174, 114689, 71, 56574, 17324, 5303, 34627, 158, 2258, 42, 62822, 1632, 17366, 3642, 69307, 294...
[ 0.186279296875, 0.279052734375, 0.207275390625, 0.17626953125, 0.0626220703125, 0.1754150390625, 0.2357177734375, 0.121826171875, 0.100341796875, 0.1065673828125, 0.1456298828125, 0.0709228515625, 0.1337890625, 0.2037353515625, 0.129638671875, 0.0643310546875, 0.0723876953125, 0.02...
embed
36349117_c0
36349117
lisp
0
Title: Trying to return list of values at even positions in current list Problem title: Trying to return list of values at even positions in current list Tags: common-lisp, lisp Problem: Trying to return list of values at even positions in current list The goal here is to pass a list to the function and have it return ...
Trying to return list of values at even positions in current list Trying to return list of values at even positions in current list common-lisp lisp Trying Trying to return list of values at even positions in current list The goal here is to pass a list to the function and have it return a list with the values at the e...
[ -0.031982421875, 0.031982421875, 0.00653076171875, -0.016845703125, 0.00848388671875, 0.0272216796875, 0.0263671875, 0.01214599609375, 0.0057373046875, -0.00714111328125, 0.0101318359375, -0.00384521484375, 0.005462646484375, 0.00029754638671875, 0.0034027099609375, 0.03564453125, 0....
[ 40858, 30646, 5303, 142424, 99, 3853, 19069, 43581, 39210, 4086, 254, 400, 7008, 69236, 3688, 83, 27875, 32354, 765, 678, 7, 96362, 26301, 116, 8439, 1737, 77681, 75935, 4, 49903, 4734, 20697, 3229, 30957, 186142, 757, 707, 106, 64457, 11...
[ 0.140869140625, 0.204833984375, 0.2132568359375, 0.186279296875, 0.06439208984375, 0.208984375, 0.1845703125, 0.1219482421875, 0.1390380859375, 0.09246826171875, 0.142578125, 0.093017578125, 0.1766357421875, 0.16357421875, 0.041595458984375, 0.0261993408203125, 0.10498046875, 0.184...
embed
54791233_c0
54791233
lisp
0
Title: Loading Packages in a Progn in Common Lisp Problem title: Loading Packages in a Progn in Common Lisp Tags: common-lisp, lisp Problem: Loading Packages in a Progn in Common Lisp Restart actions (select using :continue): 0: Return NIL 1: Return to Top Level (an "abort" restart). 2: Abort entirely from this (lisp) ...
Loading Packages in a Progn in Common Lisp Loading Packages in a Progn in Common Lisp common-lisp lisp continue this Loading Packages Progn Common Lisp asdf.lisp Loaded ASDF emacs.d sly-20180708.712 Added SLYNK CENTRAL-REGISTRY asdf:load-system slynk:create-server Created Set USE-DEDICATED-OUTPUT-STREAM NIL Error Resta...
[ -0.00170135498046875, -0.011474609375, -0.00738525390625, 0.01324462890625, -0.028564453125, 0.01397705078125, 0.0010986328125, 0.00439453125, 0.00555419921875, -0.037353515625, 0.003143310546875, 0.01025390625, -0.032958984375, -0.018798828125, 0.00439453125, 0.007354736328125, -0.0...
[ 228006, 56607, 52467, 23, 1250, 177, 19, 151301, 1261, 7008, 39210, 4086, 254, 400, 21342, 420, 2091, 712, 6483, 38997, 2263, 538, 9672, 105619, 210257, 159, 19917, 25035, 119292, 217674, 63033, 16751, 91, 12536, 92, 7612, 39642, 151313, 19...
[ 0.266845703125, 0.263916015625, 0.0462646484375, 0.037109375, 0.1072998046875, 0.1107177734375, 0.0765380859375, 0.190185546875, 0.1636962890625, 0.196044921875, 0.1185302734375, 0.111572265625, 0.1259765625, 0.0931396484375, 0.04052734375, 0.1031494140625, 0.04083251953125, 0.0430...
embed
7356894_c0
7356894
lisp
0
Title: Problems with Nth in common lisp Problem title: Problems with Nth in common lisp Tags: clisp, lisp, common-lisp Problem: Problems with Nth in common lisp I'm trying to write a function that can calculate GPA. Now I can do limited calculation(only 3 ),but I stuck on how to calculate more , without using loop or r...
Problems with Nth in common lisp Problems with Nth in common lisp clisp lisp common-lisp Problems Nth Glist Clist Problems with Nth in common lisp I'm trying to write a function that can calculate GPA. Now I can do limited calculation(only 3 ),but I stuck on how to calculate more , without using loop or recursion (that...
[ -0.0123291015625, -0.002685546875, 0.02197265625, -0.008544921875, 0.0027618408203125, 0.0004024505615234375, 0.0179443359375, 0.01214599609375, 0.01513671875, -0.00836181640625, 0.01007080078125, -0.0296630859375, -0.0111083984375, -0.015380859375, -0.0269775390625, -0.00604248046875,...
[ 15649, 678, 541, 927, 23, 39210, 400, 7008, 95701, 4086, 254, 527, 6562, 313, 31577, 33022, 32354, 74481, 67, 12236, 831, 84046, 1363, 191, 138, 179933, 3642, 1286, 15490, 17368, 40956, 195625, 64209, 28368, 14700, 3611, 653, 19, 29459, 6...
[ 0.1580810546875, 0.0635986328125, 0.167236328125, 0.2568359375, 0.045654296875, 0.1641845703125, 0.1397705078125, 0.199462890625, 0.095947265625, 0.1072998046875, 0.1490478515625, 0.1326904296875, 0.292724609375, 0.0545654296875, 0.032745361328125, 0.0899658203125, 0.1956787109375, ...
embed
12359318_c2
12359318
lisp
2
.55.0-abb03f9-no-threads-darwin-x86/swank-rpc.fasl" ; loading #P"/Users/guillaume/.slime/fasl/2012-09-04/sbcl-1.0.55.0-abb03f9-no-threads-darwin-x86/swank.fasl" WARNING: These Swank interfaces are unimplemented: (DISASSEMBLE-FRAME INTERRUPT-THREAD RECEIVE-IF SLDB-BREAK-AT-START SLDB-BREAK-ON-RETURN SPAWN) ;; Swank star...
.55.0-abb03f9-no-threads-darwin-x86/swank-rpc.fasl" ; loading #P"/Users/guillaume/.slime/fasl/2012-09-04/sbcl-1.0.55.0-abb03f9-no-threads-darwin-x86/swank.fasl" WARNING: These Swank interfaces are unimplemented: (DISASSEMBLE-FRAME INTERRUPT-THREAD RECEIVE-IF SLDB-BREAK-AT-START SLDB-BREAK-ON-RETURN SPAWN) ;; Swank star...
[ -0.0030364990234375, -0.000171661376953125, -0.01116943359375, 0.0115966796875, -0.0283203125, 0.003173828125, -0.00433349609375, 0.0245361328125, 0.00152587890625, -0.02490234375, -0.00096893310546875, -0.00616455078125, -0.006072998046875, -0.004180908203125, 0.0006561279296875, -0.0...
[ 5, 758, 187461, 9513, 1126, 157, 39116, 1506, 9494, 425, 15276, 7, 3206, 92, 57095, 31773, 141, 2819, 72367, 214, 683, 1062, 1314, 64, 2298, 15537, 64617, 13, 30268, 38118, 7709, 275, 34937, 93645, 9, 60873, 25795, 32255, 138087, 101758, ...
[ 0.039337158203125, 0.11279296875, 0.2154541015625, 0.010589599609375, 0.1097412109375, 0.10687255859375, 0.1541748046875, 0.029632568359375, 0.1827392578125, 0.0262603759765625, 0.253662109375, 0.06756591796875, 0.205810546875, 0.27783203125, 0.1341552734375, 0.0992431640625, 0.14465...
embed
74329238_c0
74329238
lisp
0
Title: Return values with indexes from list in AutoLisp Problem title: Return values with indexes from list in AutoLisp Tags: lisp, autolisp Problem: Return values with indexes from list in AutoLisp I am trying to create a new list by taking values from the user. Then I want to display the values in this list along wit...
Return values with indexes from list in AutoLisp Return values with indexes from list in AutoLisp lisp autolisp list AutoLisp How CreateList Enter SUBR VL-POSITION Return values with indexes from list in AutoLisp I am trying to create a new list by taking values from the user. Then I want to display the values in this ...
[ -0.01123046875, 0.0028533935546875, -0.00811767578125, 0.01025390625, -0.0257568359375, 0.0228271484375, 0.0230712890625, 0.0135498046875, 0.00982666015625, -0.00897216796875, 0.010498046875, -0.01385498046875, -0.00848388671875, 0.005035400390625, -0.00982666015625, 0.0019989013671875...
[ 173340, 142424, 678, 63262, 90, 1295, 5303, 4396, 9506, 7008, 400, 1809, 4086, 254, 151313, 154663, 60816, 111231, 1052, 92414, 91383, 568, 31577, 28282, 3525, 35971, 38937, 3444, 44116, 23, 33233, 27781, 190, 617, 363, 304, 140992, 186, 75...
[ 0.2080078125, 0.2218017578125, 0.1173095703125, 0.2017822265625, 0.143798828125, 0.1392822265625, 0.1947021484375, 0.1661376953125, 0.135986328125, 0.1981201171875, 0.044281005859375, 0.09326171875, 0.06683349609375, 0.1510009765625, 0.1162109375, 0.1907958984375, 0.119384765625, 0...
embed
43465299_c0
43465299
lisp
0
Title: Return List using recursion with Racket Problem title: Return List using recursion with Racket Tags: binary-search-tree, lisp, racket, recursion Problem: Return List using recursion with Racket I am trying to return a list (BST, a binary search tree) from a method that has double recursion. I am trying to implem...
Return List using recursion with Racket Return List using recursion with Racket binary-search-tree lisp racket recursion recursion List Racket BST Return List using recursion with Racket I am trying to return a list (BST, a binary search tree) from a method that has double recursion. I am trying to implement it as foll...
[ -0.005218505859375, 0.0162353515625, -0.00567626953125, -0.0198974609375, 0.0228271484375, 0.01806640625, -0.0067138671875, -0.0113525390625, -0.00933837890625, -0.02294921875, -0.0118408203125, -0.0341796875, -0.0031890869140625, 0.0162353515625, 0.00958251953125, 0.00994873046875, ...
[ 173340, 32036, 17368, 195625, 1830, 678, 2552, 27853, 2394, 6635, 86250, 62600, 400, 7008, 673, 335, 8545, 31577, 30646, 5303, 571, 33938, 53201, 16, 55300, 41929, 29479, 28960, 35839, 10176, 93, 58134, 18151, 37842, 176377, 128258, 16750, 56...
[ 0.255859375, 0.2354736328125, 0.05419921875, 0.2486572265625, 0.13818359375, 0.10101318359375, 0.13916015625, 0.23388671875, 0.1395263671875, 0.07330322265625, 0.1380615234375, 0.175048828125, 0.039581298828125, 0.126220703125, 0.11083984375, 0.041259765625, 0.172607421875, 0.05813...
embed
10304726_c0
10304726
lisp
0
Title: how to merge two strings ordered alphabetically, using recursion Problem title: how to merge two strings ordered alphabetically, using recursion Tags: recursion, merge, lisp, common-lisp Problem: how to merge two strings ordered alphabetically, using recursion I am learning Lisp. I have implemented a Common Lisp...
how to merge two strings ordered alphabetically, using recursion how to merge two strings ordered alphabetically, using recursion recursion merge lisp common-lisp recursion how to merge two strings ordered alphabetically, using recursion I am learning Lisp. I have implemented a Common Lisp function that merges two stri...
[ 0.0152587890625, 0.0042724609375, 0.007415771484375, 0.005218505859375, 0.01055908203125, 0.00396728515625, 0.0047607421875, 0.00408935546875, 0.01300048828125, 0.01104736328125, 0.01153564453125, -0.0223388671875, 0.01483154296875, 0.0159912109375, 0.0213623046875, -0.0194091796875, ...
[ 3642, 47, 42564, 6626, 79315, 7, 12989, 297, 229231, 71407, 17368, 195625, 1830, 400, 7008, 39210, 4086, 254, 52080, 1261, 29479, 151301, 32354, 18151, 44691, 26366, 42856, 3444, 107730, 10, 606, 420, 136, 876, 32834, 16750, 140992, 1563, 1...
[ 0.085693359375, 0.05950927734375, 0.260986328125, 0.17138671875, 0.244384765625, 0.0511474609375, 0.2052001953125, 0.07373046875, 0.1763916015625, 0.1175537109375, 0.0826416015625, 0.216552734375, 0.1297607421875, 0.10125732421875, 0.168701171875, 0.112548828125, 0.07110595703125, ...
embed
38020481_c0
38020481
lisp
0
Title: Alternative to mapcar lisp Problem title: Alternative to mapcar lisp Tags: lisp, powerset Problem: Alternative to mapcar lisp I need to write a recursive function for powerset, but I can't use mapcar, loop. This is my code so far: (defun parts (L) (cond ((null L)'(nil)) (T (let ((PXs (parts (cdr L)))) (append PX...
Alternative to mapcar lisp Alternative to mapcar lisp lisp powerset Alternative PXs NIL Alternative to mapcar lisp I need to write a recursive function for powerset, but I can't use mapcar, loop. This is my code so far: But the result for (parts ('1 2 3)) is: I found this method And the result for (powerset('1 2 3)) is...
[ -0.0008697509765625, 0.02294921875, 0.0135498046875, -0.0084228515625, -0.0216064453125, 0.006072998046875, 0.003875732421875, 0.00101470947265625, 0.01116943359375, -0.02294921875, -0.0068359375, 0.02490234375, -0.007568359375, 0.021484375, -0.005859375, 0.01214599609375, 0.01806640...
[ 103905, 47, 22288, 3284, 400, 7008, 14537, 3509, 436, 1542, 541, 16444, 3871, 33022, 195625, 5844, 32354, 831, 18, 4527, 40956, 18151, 2060, 16750, 17365, 116, 8439, 14037, 903, 55300, 62783, 53418, 2967, 30700 ]
[ 0.1602783203125, 0.042724609375, 0.197998046875, 0.2822265625, 0.13330078125, 0.2044677734375, 0.163330078125, 0.1937255859375, 0.035858154296875, 0.152099609375, 0.039093017578125, 0.1353759765625, 0.019500732421875, 0.06915283203125, 0.162353515625, 0.10595703125, 0.1641845703125, ...
embed
20212880_c0
20212880
lisp
0
Title: I want to make a Lisp implementation in Java. How many functions do I need to define in Java at a maximum? Problem title: I want to make a Lisp implementation in Java. How many functions do I need to define in Java at a maximum? Tags: function, lisp, java, interpreter, eval Problem: I want to make a Lisp impleme...
I want to make a Lisp implementation in Java. How many functions do I need to define in Java at a maximum? I want to make a Lisp implementation in Java. How many functions do I need to define in Java at a maximum? function lisp java interpreter eval Lisp Java How I want to make a Lisp implementation in Java. How many f...
[ -0.0001468658447265625, 0.017578125, 0.011962890625, 0.0205078125, -0.015380859375, 0.0194091796875, 0.01495361328125, 0.006134033203125, 0.0006866455078125, -0.0255126953125, -0.00823974609375, -0.01611328125, -0.0341796875, 0.0181884765625, -0.0014190673828125, 0.00469970703125, -0...
[ 87, 3444, 3249, 1261, 7008, 208124, 23, 41925, 11249, 5941, 32354, 3871, 61924, 99, 10, 38132, 47, 400, 79, 330, 29481, 56, 28, 1405, 4734, 43606, 2773, 44841, 29479, 23937, 46876, 68034, 26785, 163504, 1771, 20187, 19336, 8781, 4171, 678...
[ 0.004913330078125, 0.07684326171875, 0.042999267578125, 0.2049560546875, 0.260986328125, 0.1751708984375, 0.09808349609375, 0.260009765625, 0.05670166015625, 0.1263427734375, 0.254638671875, 0.135986328125, 0.22216796875, 0.091064453125, 0.0271148681640625, 0.1959228515625, 0.0033264...
embed
37654062_c0
37654062
lisp
0
Title: java.lang.ClassCastException: java.lang.Long cannot be cast to clojure.lang.IFn Problem title: java.lang.ClassCastException: java.lang.Long cannot be cast to clojure.lang.IFn Tags: clojure, java, lisp Problem: java.lang.ClassCastException: java.lang.Long cannot be cast to clojure.lang.IFn this is my first questi...
java.lang.ClassCastException: java.lang.Long cannot be cast to clojure.lang.IFn java.lang.ClassCastException: java.lang.Long cannot be cast to clojure.lang.IFn clojure java lisp java.lang.ClassCastException java.lang.Long clojure.lang.IFn lon1 lon2 sandbox7750 java.lang.ClassCastException: java.lang.Long cannot be cast...
[ -0.00518798828125, 0.019287109375, 0.0030059814453125, 0.004150390625, 0.0123291015625, 0.007537841796875, 0.005126953125, 0.006103515625, -0.003753662109375, -0.033935546875, -0.01708984375, 0.0091552734375, -0.00799560546875, 0.0011138916015625, 0.01507568359375, -0.01043701171875, ...
[ 79, 330, 3066, 140803, 174830, 63928, 866, 4021, 53418, 37702, 47, 20450, 461, 107, 29836, 19, 400, 7008, 4759, 418, 304, 19096, 11728, 14546, 2525, 186, 56037, 42564, 32354, 3034, 18151, 9790, 63499, 18499, 44759, 11853, 28864, 15649 ]
[ 0.1036376953125, 0.20166015625, 0.1351318359375, 0.175048828125, 0.16162109375, 0.12451171875, 0.0970458984375, 0.201904296875, 0.1328125, 0.1953125, 0.122314453125, 0.1282958984375, 0.1697998046875, 0.1422119140625, 0.1273193359375, 0.09735107421875, 0.0203399658203125, 0.12915039...
embed
59025192_c0
59025192
lisp
0
Title: `or...equal`? clause and list membership check not returning the same results? Problem title: `or...equal`? clause and list membership check not returning the same results? Tags: lisp, racket Problem: `or...equal`? clause and list membership check not returning the same results? I am working through the Beautifu...
`or...equal`? clause and list membership check not returning the same results? `or...equal`? clause and list membership check not returning the same results? lisp racket or...equal `or...equal`? clause and list membership check not returning the same results? I am working through the Beautiful Racket stacker tutorial a...
[ -0.00250244140625, 0.0032196044921875, 0.00072479248046875, 0.0003223419189453125, -0.01953125, 0.006561279296875, 0.0159912109375, -0.00787353515625, 0.01202392578125, 0.00506591796875, -0.000926971435546875, -0.008056640625, 0.0185546875, -0.007568359375, -0.021728515625, -0.00071716...
[ 748, 27, 13, 71723, 70731, 5303, 209274, 12765, 959, 30646, 5701, 50339, 400, 7008, 673, 27853, 707, 168941, 2552, 177261, 56, 57143, 552, 71062, 25632, 4785, 18151, 43240, 1957, 125195, 5351, 46622, 1257, 18, 4488, 756, 450, 158, 71, 328...
[ 0.14990234375, 0.01678466796875, 0.013641357421875, 0.192138671875, 0.131103515625, 0.1666259765625, 0.2122802734375, 0.2056884765625, 0.04132080078125, 0.0882568359375, 0.0491943359375, 0.09912109375, 0.02874755859375, 0.1263427734375, 0.0518798828125, 0.16796875, 0.0625, 0.159423...
embed
65400440_c0
65400440
lisp
0
Title: Generating permutations in Lisp withous map functions Problem title: Generating permutations in Lisp withous map functions Tags: lisp, algorithm, functional-programming, recursion Problem: Generating permutations in Lisp withous map functions I want to generate in Lisp the list of all permutations of a set. This...
Generating permutations in Lisp withous map functions Generating permutations in Lisp withous map functions lisp algorithm functional-programming recursion Generating Lisp Generating permutations in Lisp withous map functions I want to generate in Lisp the list of all permutations of a set. This is what I tried: And fr...
[ -0.01220703125, 0.034912109375, 0.0059814453125, -0.005889892578125, -0.0181884765625, 0.01171875, -0.056884765625, -0.0216064453125, -0.00634765625, -0.048095703125, -0.009521484375, 0.01397705078125, 0.008056640625, 0.0179443359375, -0.0086669921875, 0.00799560546875, -0.0061950683...
[ 155370, 117, 14311, 21094, 1261, 7008, 678, 10821, 22288, 32354, 400, 234873, 123309, 28966, 195625, 23, 3444, 139392, 70, 5303, 756, 5423, 37842, 831, 18, 3249, 2704, 1884, 903, 4127, 51515 ]
[ 0.1593017578125, 0.132080078125, 0.2283935546875, 0.12060546875, 0.1612548828125, 0.2222900390625, 0.0806884765625, 0.111572265625, 0.09942626953125, 0.141357421875, 0.12042236328125, 0.117431640625, 0.0938720703125, 0.051177978515625, 0.08465576171875, 0.036956787109375, 0.060302734...
embed
45318715_c0
45318715
lisp
0
Title: scheme, sicp, solution 3.19, procedure with infinite loop works in case it is provided as argument Problem title: scheme, sicp, solution 3.19, procedure with infinite loop works in case it is provided as argument Tags: lisp, sicp, scheme Problem: scheme, sicp, solution 3.19, procedure with infinite loop works in...
scheme, sicp, solution 3.19, procedure with infinite loop works in case it is provided as argument scheme, sicp, solution 3.19, procedure with infinite loop works in case it is provided as argument lisp sicp scheme scheme, sicp, solution 3.19, procedure with infinite loop works in case it is provided as argument could ...
[ 0.007293701171875, 0.0079345703125, -0.008544921875, 0.00171661376953125, -0.00555419921875, 0.00714111328125, -0.00067901611328125, 0.0004119873046875, 0.01031494140625, -0.033203125, 0.0084228515625, 0.018798828125, -0.004150390625, 0.00020122528076171875, 0.0113525390625, 0.01647949...
[ 150370, 26536, 254, 29806, 1031, 2947, 50491, 678, 54241, 13, 40956, 43240, 7225, 442, 62952, 237, 10750, 23, 400, 7008, 4358, 17306, 41274, 7722, 81979, 236209, 5303, 105823, 34475, 4527, 28, 864, 32, 47, 12765, 2174, 70541, 87344, 29568, ...
[ 0.21826171875, 0.0994873046875, 0.146484375, 0.12451171875, 0.0968017578125, 0.1884765625, 0.237548828125, 0.07421875, 0.1412353515625, 0.08087158203125, 0.2362060546875, 0.1527099609375, 0.08062744140625, 0.0020751953125, 0.1182861328125, 0.07220458984375, 0.2607421875, 0.01171875...
embed
4626613_c0
4626613
lisp
0
Title: Slime: frame-source-location not implemented / is my sldb Backtrace output normal? Problem title: Slime: frame-source-location not implemented / is my sldb Backtrace output normal? Tags: lisp, slime, common-lisp Problem: Slime: frame-source-location not implemented / is my sldb Backtrace output normal? I'm debug...
Slime: frame-source-location not implemented / is my sldb Backtrace output normal? Slime: frame-source-location not implemented / is my sldb Backtrace output normal? lisp slime common-lisp Slime Backtrace Slime: frame-source-location not implemented / is my sldb Backtrace output normal? I'm debugging my (Common) Lisp c...
[ 0.0233154296875, 0.03759765625, -0.0157470703125, 0.001068115234375, -0.01806640625, 0.0244140625, 0.02685546875, 0.01422119140625, -0.01318359375, -0.0179443359375, 0.01434326171875, 0.0166015625, 0.006317138671875, -0.0228271484375, 0.01708984375, -0.00860595703125, -0.019287109375...
[ 82344, 13, 123789, 60427, 87632, 959, 29479, 20505, 48073, 26828, 39989, 140992, 3638, 400, 7008, 34264, 39210, 4086, 254, 83, 8, 978, 10770, 3796, 1261, 18151, 146543, 95701, 21407, 139392, 831, 5962, 334, 5646, 47, 31344, 2499, 84751, 132...
[ 0.1627197265625, 0.2021484375, 0.19384765625, 0.2088623046875, 0.1741943359375, 0.09210205078125, 0.157470703125, 0.0633544921875, 0.1630859375, 0.1322021484375, 0.2193603515625, 0.1795654296875, 0.1485595703125, 0.041839599609375, 0.178955078125, 0.121337890625, 0.0843505859375, 0...
embed
45538149_c1
45538149
lisp
1
car working-list hash)))) (remhash (car working-list) hash) (pop working-list)) (incf number-of-trees)) number-of-trees)) I don't want to iterate over keys, I want to get just one. NOTES: Thank you all for responding. I am directing these comments to you. An editor changed my question, adding the word "randomly". I don...
car working-list hash)))) (remhash (car working-list) hash) (pop working-list)) (incf number-of-trees)) number-of-trees)) I don't want to iterate over keys, I want to get just one. NOTES: Thank you all for responding. I am directing these comments to you. An editor changed my question, adding the word "randomly". I don...
[ -0.00543212890625, -0.01092529296875, 0.00860595703125, -0.00579833984375, 0.010009765625, -0.00130462646484375, 0.0081787109375, -0.0264892578125, -0.007415771484375, -0.0238037109375, -0.0032958984375, 0.01513671875, 0.00189971923828125, 0.0223388671875, 0.01129150390625, -0.00500488...
[ 2258, 20697, 9, 6562, 1556, 127, 80126, 7328, 126234, 3284, 33554, 67466, 14012, 2921, 90, 18, 3444, 8560, 645, 22799, 7, 47, 2046, 1660, 1632, 35644, 30391, 98816, 154107, 2565, 46258, 39, 538, 517, 96759, 57553, 112, 16498, 2499, 19770,...
[ 0.203369140625, 0.22509765625, 0.08367919921875, 0.2431640625, 0.18115234375, 0.1678466796875, 0.0989990234375, 0.11767578125, 0.2156982421875, 0.1790771484375, 0.1641845703125, 0.0950927734375, 0.0308990478515625, 0.136962890625, 0.011138916015625, 0.0107421875, 0.101318359375, 0....
embed
32389739_c0
32389739
lisp
0
Title: Gettin ZeroMQ working with LISP in Windows Problem title: Gettin ZeroMQ working with LISP in Windows Tags: common-lisp, zeromq, lisp Problem: Gettin ZeroMQ working with LISP in Windows Has anyone gotten ZeroMQ working with LISP in Windows? I'm using LispBox 0.7 I have installed ZeroMQ . (ql:quickload "zeromq") U...
Gettin ZeroMQ working with LISP in Windows Gettin ZeroMQ working with LISP in Windows common-lisp zeromq lisp Gettin ZeroMQ LISP Windows LispBox ql:quickload Unable Error libzmq.dll Condition CFFI:LOAD-FOREIGN-LIBRARY-ERROR libzmq-v120-mt-gd-4_0_4.dll Win32 Gettin ZeroMQ working with LISP in Windows Has anyone gotten Z...
[ 0.0084228515625, -0.00543212890625, -0.003662109375, 0.016357421875, -0.0185546875, 0.00726318359375, 0.0096435546875, -0.00144195556640625, -0.01373291015625, -0.0302734375, -0.0172119140625, 0.007080078125, 0.0022735595703125, -0.01214599609375, -0.00390625, 0.01025390625, -0.01000...
[ 20779, 2311, 83947, 594, 2737, 20697, 678, 16970, 9434, 23, 3773, 39210, 4086, 254, 45234, 39, 864, 400, 7008, 1261, 72295, 99247, 3181, 2594, 63033, 992, 2886, 212059, 25474, 169, 1181, 46347, 73754, 22724, 17014, 151657, 53176, 14255, 334...
[ 0.10546875, 0.1934814453125, 0.2109375, 0.144775390625, 0.22998046875, 0.13427734375, 0.14453125, 0.1446533203125, 0.2431640625, 0.086669921875, 0.176513671875, 0.0682373046875, 0.09918212890625, 0.134765625, 0.1221923828125, 0.08941650390625, 0.1756591796875, 0.1134033203125, 0....
embed
59079208_c0
59079208
lisp
0
Title: Basic LISP recursive replacement of substring Problem title: Basic LISP recursive replacement of substring Tags: common-lisp, lisp, replace Problem: Basic LISP recursive replacement of substring I'm trying to replace any occurrences of a given string in a list with "X", using basic LISP commands (e.g. no mapcar ...
Basic LISP recursive replacement of substring Basic LISP recursive replacement of substring common-lisp lisp replace Basic LISP NIL Basic LISP recursive replacement of substring I'm trying to replace any occurrences of a given string in a list with "X", using basic LISP commands (e.g. no mapcar ) in a recursive functio...
[ -0.0123291015625, 0.016357421875, 0.007354736328125, 0.0284423828125, -0.022705078125, 0.0164794921875, 0.00469970703125, 0.012939453125, 0.00677490234375, 0.033447265625, 0.01214599609375, 0.006988525390625, 0.001739501953125, -0.0228271484375, 0.0074462890625, 0.01422119140625, 0.0...
[ 91692, 16970, 9434, 195625, 5844, 91995, 674, 1614, 91693, 39210, 4086, 254, 400, 7008, 541, 16444, 31577, 2499, 74918, 42, 69098, 34475, 79315, 23, 5303, 678, 1542, 62822, 75101, 110, 22288, 3284, 32354, 959, 4488, 11782, 26973, 272, 22829...
[ 0.1600341796875, 0.145263671875, 0.2003173828125, 0.2235107421875, 0.10064697265625, 0.20361328125, 0.009521484375, 0.193115234375, 0.212158203125, 0.10302734375, 0.1004638671875, 0.1522216796875, 0.111083984375, 0.177001953125, 0.1005859375, 0.174560546875, 0.08111572265625, 0.029...
embed
12456479_c1
12456479
lisp
1
lexical-binding: t ;; End: This solution works, but it feels clunky because the new special form is non-standard, doesn't highlight properly, can't be stepped into under edebug , and generally draws attention to itself. Is there a better way? EDIT Two examples of ideas for smarter (not necessarily good) solutions that...
lexical-binding: t ;; End: This solution works, but it feels clunky because the new special form is non-standard, doesn't highlight properly, can't be stepped into under edebug , and generally draws attention to itself. Is there a better way? EDIT Two examples of ideas for smarter (not necessarily good) solutions that...
[ 0.003875732421875, 0.004791259765625, -0.0087890625, -0.01318359375, 0.0004215240478515625, 0.036865234375, -0.01806640625, 0.025634765625, -0.002899169921875, -0.025146484375, 0, 0.0260009765625, -0.009521484375, 0.0185546875, 0.01446533203125, -0.0155029296875, -0.0096435546875, ...
[ 75675, 21533, 128239, 808, 2819, 74, 18878, 29806, 43240, 12319, 29786, 29188, 3525, 5361, 3173, 351, 66589, 127308, 155965, 1379, 28, 112, 85779, 137567, 123840, 35743, 68034, 11522, 3917, 27781, 25647, 18775, 56, 4127, 51347, 63769, 18151, ...
[ 0.1927490234375, 0.227783203125, 0.271240234375, 0.154052734375, 0.06689453125, 0.04022216796875, 0.13232421875, 0.12158203125, 0.116455078125, 0.1292724609375, 0.06195068359375, 0.133056640625, 0.0703125, 0.1827392578125, 0.2127685546875, 0.008148193359375, 0.1702880859375, 0.1721...
embed
5628733_c1
5628733
lisp
1
needed some method to hold count and names of variables presented in equation. Because they will be passed to symbolic derivator ie (diff '(* (+ 40 v1) u2 ...) 'v1)) I came with an idea, maybe wrong, to make them reachable by index to define them as a list '(v 1) '(v 2) '(v 3). To make them evaluable I added to begini...
needed some method to hold count and names of variables presented in equation. Because they will be passed to symbolic derivator ie (diff '(* (+ 40 v1) u2 ...) 'v1)) I came with an idea, maybe wrong, to make them reachable by index to define them as a list '(v 1) '(v 2) '(v 3). To make them evaluable I added to begini...
[ 0.0036773681640625, -0.00098419189453125, -0.0185546875, 0.006561279296875, 0.004608154296875, 0.000736236572265625, 0.00714111328125, 0.00104522705078125, 0.0026702880859375, -0.0155029296875, -0.0023345947265625, -0.004791259765625, 0.02783203125, 0.0181884765625, -0.0128173828125, -...
[ 44841, 3060, 55300, 47, 16401, 54529, 136, 123055, 111, 77336, 7, 8121, 28, 5490, 2320, 115081, 128201, 30057, 1290, 13, 152462, 22183, 1112, 81, 17727, 75, 304, 334, 6528, 51139, 44691, 2856, 58359, 2886, 390, 63262, 61924, 5303, 4879, 4...
[ 0.0731201171875, 0.00653076171875, 0.1368408203125, 0.042083740234375, 0.23193359375, 0.1876220703125, 0.05511474609375, 0.13134765625, 0.00897216796875, 0.2724609375, 0.048309326171875, 0.13427734375, 0.018463134765625, 0.1768798828125, 0.004974365234375, 0.0458984375, 0.18811035156...
embed
55421258_c0
55421258
lisp
0
Title: Unused Lexical Variable Problem title: Unused Lexical Variable Tags: common-lisp, lisp Problem: Unused Lexical Variable Just started learning lisp. I have no idea why I am getting these errors or even what they mean. I am simply trying to code an approximation of pi using the Gregory-Leibniz series, here is the ...
Unused Lexical Variable Unused Lexical Variable common-lisp lisp 0 Unused Lexical Variable Unused Lexical Variable Just started learning lisp. I have no idea why I am getting these errors or even what they mean. I am simply trying to code an approximation of pi using the Gregory-Leibniz series, here is the code. I have...
[ -0.004425048828125, 0.00170135498046875, 0.0034027099609375, 0.002410888671875, -0.017822265625, 0.0152587890625, 0.0093994140625, 0.002044677734375, 0.015625, 0.001251220703125, -0.0086669921875, -0.00823974609375, 0.0011749267578125, -0.00628662109375, 0.006378173828125, 0.0228271484...
[ 992, 33740, 172522, 6827, 84572, 2886, 39210, 4086, 254, 400, 7008, 757, 26859, 52080, 6528, 15400, 20949, 6097, 18499, 29459, 31577, 18151, 35707, 53950, 2147, 139256, 53, 2566, 16523, 36549, 37842, 17368, 5423, 864, 8, 420, 1961, 2633, 64...
[ 0.1259765625, 0.2099609375, 0.157958984375, 0.1279296875, 0.18896484375, 0.0711669921875, 0.06866455078125, 0.109375, 0.155029296875, 0.121337890625, 0.19775390625, 0.0694580078125, 0.018707275390625, 0.09619140625, 0.03863525390625, 0.045684814453125, 0.00347900390625, 0.000671386...
embed
16260062_c0
16260062
lisp
0
Title: Lisp list and expression Problem title: Lisp list and expression Tags: list, lisp, expression Problem: Lisp list and expression Recently, I was reading article "Root Of Lisp" from Paul Graham.I encountered some questions.From the book, it defines expression as two :1.atom;2.list, while list is consisted of zero ...
Lisp list and expression Lisp list and expression list lisp expression Lisp Lisp list and expression Recently, I was reading article "Root Of Lisp" from Paul Graham.I encountered some questions.From the book, it defines expression as two :1.atom;2.list, while list is consisted of zero or many expressions.Then it sayes ...
[ 0.018798828125, 0.01708984375, 0.01141357421875, 0.03076171875, 0.003662109375, 0.0223388671875, 0.013427734375, 0.01336669921875, 0, -0.006195068359375, -0.0098876953125, -0.0189208984375, 0.00836181640625, 0.00439453125, -0.00885009765625, 0.003631591796875, -0.001220703125, 0.00...
[ 1261, 7008, 5303, 136, 125195, 400, 16454, 5582, 12724, 818, 6619, 10208, 147756, 17582, 12877, 61924, 237, 6626, 5928, 5442, 6562, 35060, 45234, 5941, 831, 151575, 11299, 44402, 4171, 11907, 142, 5117, 12830, 39933, 34627, 1771, 2258, 30646,...
[ 0.1707763671875, 0.2310791015625, 0.251708984375, 0.069091796875, 0.302490234375, 0.09112548828125, 0.072021484375, 0.03143310546875, 0.0838623046875, 0.08502197265625, 0.1513671875, 0.0821533203125, 0.15771484375, 0.0299072265625, 0.10260009765625, 0.1448974609375, 0.0687255859375, ...
embed
8875608_c0
8875608
lisp
0
Title: regexp matching "not preceded by, unless followed by" Problem title: regexp matching "not preceded by, unless followed by" Tags: regex, perl, lisp Problem: regexp matching "not preceded by, unless followed by" Example input string: (F1 (F2 X (Y) Z) (F3 A B) What i want to match: \w+ that is n...
regexp matching "not preceded by, unless followed by" regexp matching "not preceded by, unless followed by" regex perl lisp regexp matching "not preceded by, unless followed by" Example input string: What i want to match: \w+ that is not preceded by a ( unless also followed by ) In this case: X , Y ...
[ 0.0018463134765625, 0.001708984375, -0.01806640625, 0.0264892578125, -0.020751953125, 0.01129150390625, 0.021484375, 0.01422119140625, 0.00872802734375, -0.007659912109375, 0.0003833770751953125, -0.008544921875, 0.00156402587890625, -0.0184326171875, 0.001312255859375, -0.004608154296...
[ 6835, 83613, 14858, 214, 10869, 107671, 297, 390, 117934, 134629, 41502, 3355, 117, 141, 400, 7008, 89536, 107730, 79315, 3444, 41872, 434, 1328, 959, 10, 7225, 1193, 990, 567, 62, 335, 142458, 67688, 100, 5036, 3714, 37348, 248, 35011, 6...
[ 0.1309814453125, 0.25439453125, 0.220703125, 0.0677490234375, 0.1751708984375, 0.1641845703125, 0.093994140625, 0.2071533203125, 0.173828125, 0.10986328125, 0.05322265625, 0.1334228515625, 0.09130859375, 0.08380126953125, 0.054351806640625, 0.1229248046875, 0.025726318359375, 0.108...
embed
73357950_c1
73357950
lisp
1
initialise-and-execute (bindings initialiser &rest callback-actions) (let ((unwrapped-bindings (map 'list (lambda (binding) (car binding)) bindings))) `(lexical-let ,unwrapped-bindings (,initialiser (quote ,(map 'list (lambda (binding) (list (cadr binding) `(lambda (val) (setq ,(car binding) val)))) bindings)) (lambda...
initialise-and-execute (bindings initialiser &rest callback-actions) (let ((unwrapped-bindings (map 'list (lambda (binding) (car binding)) bindings))) `(lexical-let ,unwrapped-bindings (,initialiser (quote ,(map 'list (lambda (binding) (list (cadr binding) `(lambda (val) (setq ,(car binding) val)))) bindings)) (lambda...
[ 0.004852294921875, 0.0120849609375, -0.005584716796875, -0.004486083984375, -0.0045166015625, 0.00982666015625, 0.0277099609375, -0.009521484375, 0.029541015625, -0.013916015625, -0.01483154296875, 0.02880859375, -0.00164794921875, 0.01092529296875, 0.0098876953125, 0.01385498046875, ...
[ 61475, 3075, 2940, 46480, 85691, 128239, 20995, 619, 56644, 11782, 12620, 44713, 1974, 309, 5429, 11, 48398, 62346, 6562, 6492, 85, 3284, 74070, 21533, 943, 118, 10836, 56, 68726, 1405, 3509, 864, 3502, 85763, 8110, 139392, 14012, 21, 1124,...
[ 0.238525390625, 0.17041015625, 0.1298828125, 0.179931640625, 0.2220458984375, 0.20849609375, 0.1595458984375, 0.0170745849609375, 0.1832275390625, 0.1749267578125, 0.248291015625, 0.1595458984375, 0.1043701171875, 0.019683837890625, 0.043701171875, 0.006866455078125, 0.02548217773437...
embed
6499388_c0
6499388
lisp
0
Title: How can I make a string with expandable keywords in Scheme? Problem title: How can I make a string with expandable keywords in Scheme? Tags: gimp, script-fu, lisp, scheme Problem: How can I make a string with expandable keywords in Scheme? I'm writing a GIMP script to export layers to files. I want to provide a ...
How can I make a string with expandable keywords in Scheme? How can I make a string with expandable keywords in Scheme? gimp script-fu lisp scheme How Scheme l.png layer_export_name string.gsub How can I make a string with expandable keywords in Scheme? I'm writing a GIMP script to export layers to files. I want to pro...
[ 0.0096435546875, 0.0081787109375, -0.00286865234375, 0.042236328125, -0.01214599609375, 0.017822265625, 0.019775390625, 0.01287841796875, 0.00970458984375, 0.0159912109375, 0.0283203125, -0.00982666015625, -0.00093841552734375, -0.00909423828125, -0.0032958984375, 0.0037078857421875, ...
[ 11249, 831, 3249, 79315, 678, 71062, 2886, 166117, 7, 23, 34702, 282, 87, 41810, 254, 26499, 3125, 400, 7008, 150370, 96, 128468, 135355, 180758, 11627, 22144, 32562, 527, 169937, 31255, 47, 102158, 3444, 22691, 38937, 16711, 27430, 44457, ...
[ 0.049530029296875, 0.053924560546875, 0.127197265625, 0.27685546875, 0.079833984375, 0.2227783203125, 0.1676025390625, 0.2705078125, 0.09521484375, 0.06640625, 0.18505859375, 0.1798095703125, 0.01873779296875, 0.1341552734375, 0.1143798828125, 0.156005859375, 0.1173095703125, 0.042...
embed
23100310_c0
23100310
lisp
0
Title: Simple IO instructions on "read" command for new lisp user Problem title: Simple IO instructions on "read" command for new lisp user Tags: io, lisp Problem: Simple IO instructions on "read" command for new lisp user I am a new lisp user. I have been trying to figure out how to use the lisp re...
Simple IO instructions on "read" command for new lisp user Simple IO instructions on "read" command for new lisp user io lisp Simple Enter Simple IO instructions on "read" command for new lisp user I am a new lisp user. I have been trying to figure out how to use the lisp read command for about an h...
[ -0.00347900390625, -0.0031280517578125, -0.0003337860107421875, 0.0341796875, -0.01531982421875, 0.0240478515625, 0.01025390625, 0.0025177001953125, -0.0146484375, -0.0311279296875, 0.0257568359375, -0.04150390625, -0.01416015625, 0.00872802734375, 0.020751953125, -0.0244140625, -0.0...
[ 60552, 17780, 167934, 39116, 75101, 100, 3525, 400, 7008, 38937, 22995, 60816, 31577, 26366, 4527, 12301, 56816, 1663, 27781, 2809, 51, 226534, 77681, 104250, 8420, 4552, 8781, 32354, 1221, 26946, 116, 107730, 15190, 2856, 2965, 81887, 37842, ...
[ 0.1685791015625, 0.1851806640625, 0.1812744140625, 0.254150390625, 0.189453125, 0.0186004638671875, 0.100830078125, 0.1666259765625, 0.208984375, 0.1134033203125, 0.2015380859375, 0.156982421875, 0.017730712890625, 0.05157470703125, 0.0867919921875, 0.258056640625, 0.052276611328125,...
embed
8513892_c1
8513892
lisp
1
this solution. Instead of [1] having to learn how to tell vim to indent particular functions properly, and [2] writing the code that does this explicitly for each language extension that I define, and [3] updating that code every time I add a new language construct. Instead I leverage slimv to do the formatting for me...
this solution. Instead of [1] having to learn how to tell vim to indent particular functions properly, and [2] writing the code that does this explicitly for each language extension that I define, and [3] updating that code every time I add a new language construct. Instead I leverage slimv to do the formatting for me...
[ -0.00007581710815429688, 0.004302978515625, 0.020751953125, 0.01251220703125, -0.0093994140625, 0.029052734375, -0.01025390625, 0.00616455078125, 0.0067138671875, -0.0189208984375, 0.0244140625, -0.0107421875, -0.0164794921875, -0.01336669921875, 0, -0.024658203125, -0.009521484375, ...
[ 903, 29806, 175399, 30698, 14192, 119916, 18597, 18, 17311, 32354, 155965, 32562, 18151, 143726, 12638, 46876, 111938, 61924, 1257, 56464, 15190, 3525, 64549, 21962, 4588, 34264, 334, 54, 9384, 1916, 133, 147, 111789, 21771, 72367, 400, 7008, ...
[ 0.116943359375, 0.173583984375, 0.08648681640625, 0.03497314453125, 0.0924072265625, 0.26416015625, 0.1981201171875, 0.174560546875, 0.1136474609375, 0.19384765625, 0.132568359375, 0.06982421875, 0.16748046875, 0.082763671875, 0.0498046875, 0.19287109375, 0.222900390625, 0.19738769...
embed
54970916_c0
54970916
lisp
0
Title: Scheme Programming Language Support with Manjaro Arm? Problem title: Scheme Programming Language Support with Manjaro Arm? Tags: emacs, raspberry-pi, scheme, lisp, archlinux-arm Problem: Scheme Programming Language Support with Manjaro Arm? I am trying out Manjaro Arm on my Raspberry Pi 3, but surprisingly find ...
Scheme Programming Language Support with Manjaro Arm? Scheme Programming Language Support with Manjaro Arm? emacs raspberry-pi scheme lisp archlinux-arm Scheme Programming Language Support Manjaro Arm Scheme Programming Language Support with Manjaro Arm? I am trying out Manjaro Arm on my Raspberry Pi 3, but surprisingl...
[ 0.00185394287109375, 0.029541015625, -0.00616455078125, 0.012451171875, -0.0283203125, -0.005767822265625, 0.003173828125, -0.007293701171875, -0.017822265625, 0.003875732421875, 0.00408935546875, -0.0172119140625, -0.01336669921875, -0.0185546875, -0.0087890625, -0.015380859375, -0....
[ 34702, 282, 27958, 214, 83658, 58832, 678, 1572, 145, 516, 33119, 352, 2263, 61375, 53623, 1434, 150370, 400, 7008, 187, 206, 2397, 6077, 56859, 31577, 1810, 225291, 3065, 138, 4, 212615, 538, 7413, 4734, 53513, 133, 237, 70, 279, 2886, ...
[ 0.221923828125, 0.2076416015625, 0.1864013671875, 0.041015625, 0.1990966796875, 0.2462158203125, 0.1129150390625, 0.115966796875, 0.161865234375, 0.2509765625, 0.28466796875, 0.0185089111328125, 0.0640869140625, 0.06292724609375, 0.1617431640625, 0.136962890625, 0.2413330078125, 0....
embed
719130_c0
719130
lisp
0
Title: Is it possible to deploy a Common Lisp (or other dialect) desktop application for several platforms? Problem title: Is it possible to deploy a Common Lisp (or other dialect) desktop application for several platforms? Tags: lisp, graphics, deployment, common-lisp Problem: Is it possible to deploy a Common Lisp (o...
Is it possible to deploy a Common Lisp (or other dialect) desktop application for several platforms? Is it possible to deploy a Common Lisp (or other dialect) desktop application for several platforms? lisp graphics deployment common-lisp Common Lisp Is it possible to deploy a Common Lisp (or other dialect) desktop app...
[ 0.00970458984375, 0.0111083984375, 0.000362396240234375, 0.00579833984375, -0.01519775390625, -0.002197265625, 0.0257568359375, -0.0224609375, 0.00872802734375, -0.0005645751953125, 0.006866455078125, -0.006866455078125, 0.0106201171875, 0.00811767578125, -0.00653076171875, 0.011108398...
[ 2071, 442, 7722, 47, 8, 13158, 53, 151301, 1261, 7008, 3789, 220734, 86983, 38415, 100, 40368, 13651, 7, 400, 48461, 39210, 4086, 254, 10, 1884, 85493, 23, 5809, 4727, 3773, 29908, 224588, 51359, 46876, 41143, 2806, 9969, 1340, 18151, 452...
[ 0.07177734375, 0.060455322265625, 0.1927490234375, 0.030731201171875, 0.1361083984375, 0.2083740234375, 0.1182861328125, 0.211181640625, 0.180419921875, 0.211669921875, 0.062255859375, 0.247314453125, 0.2222900390625, 0.2120361328125, 0.08880615234375, 0.1851806640625, 0.214477539062...
embed
32960068_c0
32960068
lisp
0
Title: Rewrite loop as a mapcar Problem title: Rewrite loop as a mapcar Tags: common-lisp, macros, lisp Problem: Rewrite loop as a mapcar Looking at Practical Common Lisp , we're looking at a simple automated unit test framework. We're trying to write a macro to be used as such: (check (= (+ 1 2) 3) (= (- 1 4) 9)) This...
Rewrite loop as a mapcar Rewrite loop as a mapcar common-lisp macros lisp Rewrite form-1 FAIL Rewrite loop as a mapcar Looking at Practical Common Lisp , we're looking at a simple automated unit test framework. We're trying to write a macro to be used as such: This should expand to something using a previously defined ...
[ -0.0002231597900390625, -0.0001373291015625, -0.0078125, 0.01397705078125, -0.0205078125, 0.006195068359375, 0.0159912109375, 0.015625, 0.0115966796875, -0.01904296875, 0.00750732421875, 0.00098419189453125, -0.02685546875, 0.0040283203125, 0.00811767578125, -0.0089111328125, 0.00939...
[ 853, 434, 18781, 40956, 237, 22288, 3284, 10, 39210, 4086, 254, 111789, 400, 7008, 3173, 5759, 15491, 16444, 109613, 151301, 1261, 8781, 11408, 25072, 3034, 170846, 31577, 33022, 11814, 6044, 5608, 71062, 9844, 198395, 61924, 32354, 13416, 21...
[ 0.1116943359375, 0.162353515625, 0.197509765625, 0.2442626953125, 0.0574951171875, 0.1727294921875, 0.2529296875, 0.007781982421875, 0.09210205078125, 0.081787109375, 0.107666015625, 0.18603515625, 0.0826416015625, 0.1475830078125, 0.148193359375, 0.04888916015625, 0.1427001953125, ...
embed
59960241_c0
59960241
lisp
0
Title: Will a procedure be considered as a predicate, <p> , when the special form cond is missing the key word else? Problem title: Will a procedure be considered as a predicate, <p> , when the special form cond is missing the key word else? Tags: lisp, scheme, racket Problem: Will a procedure be considered...
Will a procedure be considered as a predicate, <p> , when the special form cond is missing the key word else? Will a procedure be considered as a predicate, <p> , when the special form cond is missing the key word else? lisp scheme racket Will Will a procedure be considered as a predicate, , when the specia...
[ -0.0203857421875, 0.00811767578125, -0.00482177734375, 0.00823974609375, -0.0028839111328125, 0.0308837890625, 0.015625, 0.0048828125, -0.00020885467529296875, -0.01361083984375, 0.0179443359375, -0.019287109375, -0.0164794921875, -0.0291748046875, 0.01470947265625, 0.0074462890625, ...
[ 20255, 50491, 90698, 237, 1653, 2063, 67, 1277, 1230, 5386, 3229, 5361, 3173, 158, 71, 132283, 22799, 2565, 37076, 400, 7008, 150370, 673, 27853, 83, 27998, 100, 9904, 25632, 125195, 114453, 16750, 2055, 7, 4879, 959, 22183, 116, 805, 177...
[ 0.05120849609375, 0.2440185546875, 0.111083984375, 0.0183868408203125, 0.193603515625, 0.2373046875, 0.125244140625, 0.000946044921875, 0.0418701171875, 0.092529296875, 0.0300750732421875, 0.13818359375, 0.1954345703125, 0.15478515625, 0.129150390625, 0.1494140625, 0.1043701171875, ...
embed
64376900_c1
64376900
lisp
1
USER> (binparse:read-value primitives::'u1 *testfile*) ; succeeds CL-USER> (binparse:read-value primitives::u1 *testfile*) ; fails, unbound variable U1 CL-USER> (binparse:read-value 'u1 *testfile*); fails, class-not-found u1 PRIMITIVES> (read-value 'u1 *testfile*) ; succeeds However, I can't figure out how to export 'u...
USER> (binparse:read-value primitives::'u1 *testfile*) ; succeeds CL-USER> (binparse:read-value primitives::u1 *testfile*) ; fails, unbound variable U1 CL-USER> (binparse:read-value 'u1 *testfile*); fails, class-not-found u1 PRIMITIVES> (read-value 'u1 *testfile*) ; succeeds However, I can't figure out how to export 'u...
[ 0.00726318359375, -0.000957489013671875, 0.020263671875, 0.006866455078125, 0.0034027099609375, 0.0235595703125, 0.000949859619140625, -0.014892578125, 0.00616455078125, 0.00787353515625, 0.017333984375, -0.006622314453125, 0.00592041015625, -0.00823974609375, 0.002716064453125, 0.0007...
[ 345, 50184, 2740, 7568, 2500, 184, 39116, 27494, 128489, 90, 34, 418, 6954, 29822, 214493, 46323, 1062, 35782, 51, 99091, 77336, 9, 18507, 10869, 151645, 75, 105029, 35522, 113077, 26366, 3642, 31255, 242, 3789, 26582, 11814, 55300, 58735, ...
[ 0.14306640625, 0.1748046875, 0.0826416015625, 0.09033203125, 0.1224365234375, 0.08984375, 0.126220703125, 0.1429443359375, 0.2607421875, 0.148681640625, 0.1748046875, 0.1746826171875, 0.10528564453125, 0.1634521484375, 0.1387939453125, 0.095703125, 0.1279296875, 0.154052734375, 0...
embed
52524493_c0
52524493
lisp
0
Title: How to pass a racket object's field id as a function argument Problem title: How to pass a racket object's field id as a function argument Tags: racket, object, lisp Problem: How to pass a racket object's field id as a function argument I have the example object (define test-class% (class object% (supe...
How to pass a racket object's field id as a function argument How to pass a racket object's field id as a function argument racket object lisp How test-field2 How to pass a racket object's field id as a function argument I have the example object Later on I have the code: Which results in the error: 3.rkt:154...
[ 0.002899169921875, 0.000415802001953125, -0.00982666015625, 0.0022735595703125, 0.014404296875, -0.00543212890625, 0.0015411376953125, -0.0030059814453125, 0.005645751953125, -0.02294921875, 0.003662109375, 0.00732421875, -0.00640869140625, -0.0164794921875, 0.01495361328125, -0.022216...
[ 11249, 27875, 673, 27853, 36746, 3768, 44457, 3447, 237, 32354, 10750, 400, 7008, 3034, 28394, 304, 10, 27781, 18151, 18499, 18, 9285, 33529, 51, 99091, 42485, 56, 88996, 3444, 5423, 10135, 1556, 5252, 831, 17203, 86997, 30312, 10932, 16384...
[ 0.0457763671875, 0.1605224609375, 0.0992431640625, 0.2109375, 0.182861328125, 0.0767822265625, 0.23583984375, 0.2183837890625, 0.078857421875, 0.198974609375, 0.2191162109375, 0.04925537109375, 0.10211181640625, 0.1671142578125, 0.1922607421875, 0.09100341796875, 0.0151824951171875, ...
embed
5959656_c0
5959656
lisp
0
Title: Multiple arguments to mapcar Problem title: Multiple arguments to mapcar Tags: common-lisp, lisp, functional-programming, closures Problem: Multiple arguments to mapcar I'm sure this is a very beginner question in lisp, as I am just learning the language. I have a function in clisp called count. It counts the nu...
Multiple arguments to mapcar Multiple arguments to mapcar common-lisp lisp functional-programming closures Multiple Multiple arguments to mapcar I'm sure this is a very beginner question in lisp, as I am just learning the language. I have a function in clisp called count. It counts the number of times a given atom appe...
[ 0.00408935546875, -0.0003070831298828125, -0.0003566741943359375, -0.00701904296875, -0.0001506805419921875, 0.0267333984375, 0.0177001953125, 0.00799560546875, 0.0101318359375, -0.035888671875, -0.01483154296875, -0.0361328125, 0.011962890625, 0.035400390625, -0.01263427734375, -0.021...
[ 19335, 8705, 10750, 47, 22288, 3284, 7, 39210, 4086, 254, 400, 7008, 123309, 28966, 170224, 52080, 46876, 32354, 95701, 54529, 14012, 20028, 34627, 135179, 5303, 1884, 19048, 11782, 48716, 678, 12921, 171859, 1284, 5701, 33938, 284, 571, 441,...
[ 0.1890869140625, 0.15087890625, 0.2685546875, 0.052642822265625, 0.17578125, 0.2242431640625, 0.01312255859375, 0.0265350341796875, 0.053497314453125, 0.1083984375, 0.09393310546875, 0.189208984375, 0.054962158203125, 0.0291900634765625, 0.117431640625, 0.001953125, 0.017959594726562...
embed
33950782_c0
33950782
lisp
0
Title: Structure of lisp projects Problem title: Structure of lisp projects Tags: maxima, allegro, common-lisp, lisp Problem: Structure of lisp projects When I use Eclipse or Visual Studio or Xcode, structure of the project gets created automatically and one can get started immediately. Now I am trying to create a proj...
Structure of lisp projects Structure of lisp projects maxima allegro common-lisp lisp Structure Structure of lisp projects When I use Eclipse or Visual Studio or Xcode, structure of the project gets created automatically and one can get started immediately. Now I am trying to create a project on Allegro CL express edit...
[ 0.018310546875, 0.007415771484375, -0.01324462890625, 0.031494140625, -0.0225830078125, 0.01312255859375, 0.03466796875, -0.00933837890625, 0.0201416015625, 0.001678466796875, -0.00086212158203125, 0.0072021484375, 0.0024871826171875, 0.017822265625, 0.0223388671875, 0.0005226135253906...
[ 63667, 238, 6644, 400, 7008, 77635, 122200, 747, 8407, 39210, 4086, 254, 111, 4527, 234962, 73372, 22968, 40899, 45646, 13452, 75935, 191082, 26859, 109312, 31577, 28282, 4344, 46323, 36510, 79737, 43799, 756, 102158, 11675, 98169, 18499, 18822...
[ 0.20654296875, 0.130859375, 0.03369140625, 0.1414794921875, 0.2249755859375, 0.2230224609375, 0.1767578125, 0.084716796875, 0.2276611328125, 0.08648681640625, 0.116943359375, 0.174072265625, 0.002105712890625, 0.03363037109375, 0.1490478515625, 0.077392578125, 0.085205078125, 0.163...
embed
6385918_c0
6385918
lisp
0
Title: How can I improve performance on my clojure sieve of eratosthenes algorithm? Problem title: How can I improve performance on my clojure sieve of eratosthenes algorithm? Tags: lisp, sieve-of-eratosthenes, clojure Problem: How can I improve performance on my clojure sieve of eratosthenes algorithm? I'm learning cl...
How can I improve performance on my clojure sieve of eratosthenes algorithm? How can I improve performance on my clojure sieve of eratosthenes algorithm? lisp sieve-of-eratosthenes clojure How How can I improve performance on my clojure sieve of eratosthenes algorithm? I'm learning clojure by going through project eule...
[ -0.017822265625, 0.0177001953125, 0.0076904296875, -0.0003662109375, -0.0026397705078125, -0.00885009765625, -0.01019287109375, -0.010986328125, 0.00396728515625, -0.043701171875, 0.0262451171875, 0.0062255859375, -0.00396728515625, -0.0184326171875, 0.0128173828125, 0.0177001953125, ...
[ 11249, 831, 52295, 23718, 759, 20450, 461, 107, 78, 3134, 111, 8457, 232, 2347, 1444, 234873, 98, 400, 7008, 4390, 13164, 87, 52080, 13452, 1175, 603, 20697, 2967, 209, 111607, 10554, 756, 20809, 14012, 35064, 6626, 19879, 29479, 28875, 1...
[ 0.08868408203125, 0.0770263671875, 0.216796875, 0.2296142578125, 0.022125244140625, 0.121826171875, 0.1597900390625, 0.125244140625, 0.106201171875, 0.16943359375, 0.05181884765625, 0.117919921875, 0.0748291015625, 0.1485595703125, 0.09368896484375, 0.2137451171875, 0.0242919921875, ...
embed
45227_c0
45227
lisp
0
Title: List operations in Lisp Problem title: List operations in Lisp Tags: lisp, list, functional-programming Problem: List operations in Lisp I have been searching everywhere for the following functionality in Lisp, and have gotten nowhere: find the index of something in a list. example: (index-of item InThisList) re...
List operations in Lisp List operations in Lisp lisp list functional-programming the List Lisp InThisList AtThisIndex ItemAtThisIndex List operations in Lisp I have been searching everywhere for the following functionality in Lisp, and have gotten nowhere: find the index of something in a list. example: replace somethi...
[ -0.002777099609375, 0.021484375, -0.00147247314453125, 0.00135040283203125, -0.006561279296875, 0.010986328125, -0.0047607421875, 0.0024261474609375, 0.0167236328125, -0.016845703125, 0.00836181640625, -0.00604248046875, -0.00189971923828125, 0.00897216796875, 0.00799560546875, 0.01483...
[ 32036, 41018, 23, 1261, 7008, 7, 400, 5303, 123309, 28966, 360, 73243, 154663, 1913, 4153, 39659, 78426, 28848, 157318, 219743, 25632, 2481, 136913, 7413, 63262, 111, 9844, 27781, 91995, 29458, 13162, 30646, 35735, 1071, 6048, 10002, 32354, 1...
[ 0.212890625, 0.2254638671875, 0.05145263671875, 0.165771484375, 0.2327880859375, 0.0178375244140625, 0.139892578125, 0.1932373046875, 0.1728515625, 0.1395263671875, 0.0570068359375, 0.122802734375, 0.167724609375, 0.095947265625, 0.0167083740234375, 0.153076171875, 0.1370849609375, ...
embed
9873521_c0
9873521
lisp
0
Title: What are the differences between Bigloo and ECL from an embedding standpoint? Problem title: What are the differences between Bigloo and ECL from an embedding standpoint? Tags: c%2B%2B, scheme, lisp, ecl, bigloo Problem: What are the differences between Bigloo and ECL from an embedding standpoint? I've been look...
What are the differences between Bigloo and ECL from an embedding standpoint? What are the differences between Bigloo and ECL from an embedding standpoint? c%2B%2B scheme lisp ecl bigloo an What Bigloo ECL What are the differences between Bigloo and ECL from an embedding standpoint? I've been looking to embed Lisp in s...
[ 0.01214599609375, -0.005615234375, -0.00457763671875, 0.0128173828125, 0.0028228759765625, -0.00180816650390625, 0.01080322265625, -0.0004024505615234375, 0.01116943359375, -0.01080322265625, 0.029052734375, -0.0390625, -0.0028228759765625, 0.00732421875, -0.010009765625, 0.00033378601...
[ 60212, 7, 17721, 14195, 47673, 136, 241, 37486, 1295, 55720, 59725, 9157, 38496, 142, 501, 150370, 400, 7008, 28, 34937, 6957, 4865, 352, 13482, 1261, 37223, 18151, 32964, 50717, 60892, 34702, 3796, 104951, 8060, 4552, 21373, 60213, 83, 282...
[ 0.216796875, 0.07635498046875, 0.0809326171875, 0.1842041015625, 0.285888671875, 0.06982421875, 0.1090087890625, 0.24169921875, 0.032501220703125, 0.1727294921875, 0.105224609375, 0.06597900390625, 0.10174560546875, 0.0548095703125, 0.003509521484375, 0.158447265625, 0.0987548828125,...
embed
11596853_c1
11596853
lisp
1
fail to specify which sockets caused it to return). In the situation where no client has spoken in a little while, and third client disconnects, there doesn't seem to be a good way of finding that out and closing that specific socket connection. I'd have to read them in sequence, except that since read blocks on no in...
fail to specify which sockets caused it to return). In the situation where no client has spoken in a little while, and third client disconnects, there doesn't seem to be a good way of finding that out and closing that specific socket connection. I'd have to read them in sequence, except that since read blocks on no in...
[ 0.004364013671875, 0.0225830078125, 0.0013427734375, 0.0036163330078125, -0.00994873046875, -0.01068115234375, -0.0093994140625, -0.00701904296875, 0.0003986358642578125, -0.008544921875, 0.009521484375, -0.0224609375, -0.01190185546875, 0.00714111328125, -0.0034942626953125, -0.031494...
[ 35782, 40140, 18929, 221, 27853, 143434, 442, 47, 30646, 16648, 110, 23282, 1556, 113091, 19, 10176, 12960, 50960, 2837, 135457, 90791, 1810, 20450, 6953, 29458, 94878, 12301, 944, 46389, 107730, 86997, 40485, 6626, 19802, 15044, 9325, 26008, ...
[ 0.179931640625, 0.1463623046875, 0.07568359375, 0.0806884765625, 0.22607421875, 0.120849609375, 0.0775146484375, 0.1162109375, 0.218994140625, 0.026947021484375, 0.084716796875, 0.212890625, 0.06207275390625, 0.1864013671875, 0.1043701171875, 0.07354736328125, 0.1025390625, 0.18566...
embed
28353464_c0
28353464
lisp
0
Title: Read-line from socket-stream in lisp Problem title: Read-line from socket-stream in lisp Tags: tcp, usocket, sockets, lisp, common-lisp Problem: Read-line from socket-stream in lisp I am working on a TCP client in lisp, and am having difficulties reading/printing the socket-stream correctly. When the client send...
Read-line from socket-stream in lisp Read-line from socket-stream in lisp tcp usocket sockets lisp common-lisp socket-stream Read-line usocket:socket-stream usocket:socket-connect _IP_ _PORT_ Read-line from socket-stream in lisp I am working on a TCP client in lisp, and am having difficulties reading/printing the socke...
[ -0.0133056640625, 0.01220703125, 0.01275634765625, -0.006439208984375, 0.01153564453125, -0.00067901611328125, 0.00994873046875, -0.006378173828125, -0.01068115234375, -0.01092529296875, 0.0133056640625, -0.01611328125, 0.00079345703125, -0.01177978515625, 0.002197265625, -0.0079345703...
[ 4764, 2256, 1295, 221, 27853, 86429, 23, 400, 7008, 121422, 39210, 4086, 254, 991, 135457, 10931, 91599, 20697, 17854, 23282, 34844, 16454, 35662, 26785, 25379, 2053, 10723, 53299, 57553, 33022, 6138, 246, 1003, 43240, 31089, 2448, 1916, 1863...
[ 0.223876953125, 0.2137451171875, 0.0791015625, 0.094970703125, 0.1871337890625, 0.2445068359375, 0.02801513671875, 0.13720703125, 0.2301025390625, 0.06964111328125, 0.03179931640625, 0.0631103515625, 0.1778564453125, 0.042999267578125, 0.11376953125, 0.047515869140625, 0.14111328125,...
embed
8713585_c0
8713585
lisp
0
Title: Is there anything like Python's `if __name__ == "__main__":` stuff in Common Lisp Problem title: Is there anything like Python's `if __name__ == "__main__":` stuff in Common Lisp Tags: common-lisp, lisp Problem: Is there anything like Python's `if __name__ == "__main__":` stuff in C...
Is there anything like Python's `if __name__ == "__main__":` stuff in Common Lisp Is there anything like Python's `if __name__ == "__main__":` stuff in Common Lisp common-lisp lisp Python __name__ __main__ Common Lisp Is there anything like Python's `if __name__ == "__main__":` stuff in Co...
[ 0.019287109375, 0.01116943359375, 0.0206298828125, 0.036865234375, -0.026123046875, 0.00109100341796875, 0.0299072265625, -0.0025177001953125, -0.01019287109375, -0.0019683837890625, -0.0035247802734375, 0.02001953125, -0.0023040771484375, 0.004730224609375, 0.004852294921875, -0.00111...
[ 2071, 2685, 23937, 1884, 145581, 3768, 3190, 5953, 11627, 14005, 69112, 24931, 41884, 23, 151301, 1261, 7008, 39210, 4086, 254, 400, 12, 54397, 6626, 32354, 84797, 102158, 11435, 62, 335, 5201, 1528, 18151, 3034, 11782, 72367, 55300, 105237, ...
[ 0.0237579345703125, 0.055084228515625, 0.1038818359375, 0.1414794921875, 0.20947265625, 0.0745849609375, 0.2105712890625, 0.060272216796875, 0.114501953125, 0.10577392578125, 0.121826171875, 0.160400390625, 0.176025390625, 0.08001708984375, 0.1868896484375, 0.1876220703125, 0.1700439...
embed
36808789_c1
36808789
lisp
1
make-part-deriv-1 (hypothesis) (lambda (test-set) (let ((m (length test-set))) (float (/ (reduce #'+ (mapcar (lambda(elem)(- (funcall hypothesis (car elem)) (cadr elem))) test-set)) m))))) (defun make-part-deriv-2 (hypothesis) (lambda (test-set) (let ((m (length test-set))) (float (/ (reduce #'+ (mapcar (lambda(elem)(...
make-part-deriv-1 (hypothesis) (lambda (test-set) (let ((m (length test-set))) (float (/ (reduce #'+ (mapcar (lambda(elem)(- (funcall hypothesis (car elem)) (cadr elem))) test-set)) m))))) (defun make-part-deriv-2 (hypothesis) (lambda (test-set) (let ((m (length test-set))) (float (/ (reduce #'+ (mapcar (lambda(elem)(...
[ 0.0184326171875, 0.01708984375, -0.0018768310546875, -0.021728515625, -0.000827789306640625, 0.0167236328125, -0.001007080078125, 0.0029754638671875, 0.02490234375, -0.033203125, -0.01141357421875, 0.0050048828125, 0.0091552734375, -0.02197265625, -0.002593994140625, -0.0120849609375, ...
[ 3249, 17365, 820, 4371, 5759, 3038, 7804, 160291, 143, 6492, 85, 6954, 3509, 1974, 39, 23986, 3034, 52347, 257, 64, 107, 106357, 468, 1328, 62346, 3284, 27889, 16498, 85763, 170933, 6023, 88, 195, 25426, 42, 347, 80126, 112, 5428, 88746, ...
[ 0.1630859375, 0.254150390625, 0.1614990234375, 0.1710205078125, 0.1661376953125, 0.102294921875, 0.1881103515625, 0.189208984375, 0.0150604248046875, 0.1759033203125, 0.103271484375, 0.153564453125, 0.1507568359375, 0.0919189453125, 0.06494140625, 0.0579833984375, 0.1802978515625, ...
embed
57561048_c1
57561048
lisp
1
expensive-optimizations -falign-functions=4 -D_WIN32 -DENABLE_UNICODE -I/usr/local/include -DDYNAMIC_FFI -I. -L/usr/local/lib -lintl /usr/local/lib/libreadline.dll.a -L/usr/local/lib -ltermcap /usr/local/lib/libavcall.a /usr/local/lib/libcallback.a -luser32 -lws2_32 -lole32 -loleaut32 -luuid -liconv -L/usr/local/lib -l...
solutions for further calculations. Here are the missing infos about my system. wxMaxima version: 17.05.0 Maxima version: 5.40.0 Maxima build date: 2017-06-01 18:54:32 Host type: x86_64-w64-mingw32 System type: gcc -mno-cygwin -g -O2 -W -Wswitch -Wcomment -Wpointer-arith -Wimplicit -Wreturn-type -Wmissing-declarations...
[ 0.00113677978515625, -0.00994873046875, -0.0167236328125, -0.0012664794921875, -0.01397705078125, -0.002685546875, 0.00994873046875, 0.01806640625, 0.006591796875, 0.00390625, 0.0050048828125, 0.01104736328125, 0.0098876953125, -0.0174560546875, -0.012451171875, -0.01239013671875, -0...
[ 51347, 100, 53333, 74481, 5256, 11853, 70, 132283, 3004, 7, 1672, 759, 5426, 5, 148, 425, 71346, 1352, 11389, 12, 729, 20806, 2389, 46540, 11, 1892, 617, 99929, 45367, 5622, 505, 44037, 100932, 10644, 1022, 15276, 13307, 434, 14578, 6460,...
[ 0.18505859375, 0.00592041015625, 0.10693359375, 0.254150390625, 0.1142578125, 0.0248260498046875, 0.017425537109375, 0.218994140625, 0.169921875, 0.052490234375, 0.07183837890625, 0.09051513671875, 0.176513671875, 0.000152587890625, 0.1339111328125, 0.171630859375, 0.14794921875, 0...
embed
37193689_c0
37193689
lisp
0
Title: lisp last element functional form Problem title: lisp last element functional form Tags: lisp Problem: lisp last element functional form Hey guys I need help with lisp function. I am supposed to create: (myLast L) Evaluates to the last element of list L. eg. (myLast ‘(p a e g)) → g I cant use all of the predefin...
lisp last element functional form lisp last element functional form lisp Error MYHW4.LISP EVAL Backtrace Broken SYSTEM::GCL-TOP-LEVEL lisp last element functional form Hey guys I need help with lisp function. I am supposed to create: (myLast L) Evaluates to the last element of list L. eg. (myLast ‘(p a e g)) → g I cant...
[ -0.0079345703125, 0.0341796875, -0.0028228759765625, -0.015869140625, -0.0086669921875, 0.017822265625, 0.00090789794921875, -0.0035247802734375, -0.0181884765625, -0.043212890625, 0.01806640625, -0.01123046875, 0.0067138671875, -0.01104736328125, 0.000629425048828125, 0.02099609375, ...
[ 400, 7008, 4568, 12830, 123309, 3173, 212059, 141404, 1456, 617, 67616, 683, 241, 61152, 26828, 39989, 13177, 1098, 55858, 90420, 37486, 70675, 15300, 51442, 51484, 3871, 4358, 32354, 134598, 28282, 1176, 2729, 271, 339, 151228, 1636, 5303, 2...
[ 0.14111328125, 0.2064208984375, 0.2344970703125, 0.1800537109375, 0.209716796875, 0.2181396484375, 0.1527099609375, 0.03289794921875, 0.0382080078125, 0.1224365234375, 0.127197265625, 0.1845703125, 0.0986328125, 0.2066650390625, 0.068603515625, 0.1829833984375, 0.112060546875, 0.07...
embed
79221228_c0
79221228
lisp
0
Title: If - loop issues in Common Lisp Problem title: If - loop issues in Common Lisp Tags: loops, lisp, if-statement, common-lisp Problem: If - loop issues in Common Lisp I'm having some troubles with Common Lisp. I want to do a code to find how many times the values of a list are over or under two limits. I want to d...
If - loop issues in Common Lisp If - loop issues in Common Lisp loops lisp if-statement common-lisp Common Lisp Error LOOP ELEMENT LOWER ELEMEN UPPER If - loop issues in Common Lisp I'm having some troubles with Common Lisp. I want to do a code to find how many times the values of a list are over or under two limits. I...
[ -0.005401611328125, -0.013427734375, 0.004669189453125, 0.01190185546875, 0.0123291015625, 0.01202392578125, 0.0186767578125, 0.0135498046875, 0.0172119140625, 0.01031494140625, 0.021240234375, -0.01092529296875, 0.003997802734375, -0.0021209716796875, 0.036865234375, 0.0089111328125, ...
[ 4263, 40956, 37348, 151301, 1261, 7008, 400, 2174, 61340, 39210, 4086, 254, 212059, 22215, 20880, 9780, 124661, 91227, 27587, 28751, 27560, 30425, 63134, 18151, 7413, 3642, 5941, 20028, 142424, 5303, 621, 645, 707, 1379, 6626, 17475, 54, 5211...
[ 0.2117919921875, 0.2322998046875, 0.1678466796875, 0.1947021484375, 0.1572265625, 0.193603515625, 0.0911865234375, 0.1624755859375, 0.09503173828125, 0.1339111328125, 0.0947265625, 0.12255859375, 0.1490478515625, 0.1025390625, 0.10003662109375, 0.08868408203125, 0.06982421875, 0.06...
embed
67854202_c1
67854202
lisp
1
; while(str[pos] != '\"') { temp[pos] = str[pos]; pos++; } current->blob = malloc(256 * sizeof(char)); current->blob = (char*) &temp; current->type = string; } else if(isdigit(str[0])){ char temp[256]; int pos = 0; while(str[pos] != ' ') { temp[pos] = str[pos]; pos++; } int tmp = atoi(temp); current->blob = (int*) &tmp...
; while(str[pos] != '\"') { temp[pos] = str[pos]; pos++; } current->blob = malloc(256 * sizeof(char)); current->blob = (char*) &temp; current->type = string; } else if(isdigit(str[0])){ char temp[256]; int pos = 0; while(str[pos] != ' ') { temp[pos] = str[pos]; pos++; } int tmp = atoi(temp); current->blob = (int*) &tmp...
[ 0.00189971923828125, 0.0191650390625, 0.00262451171875, 0.03564453125, -0.01385498046875, 0.0303955078125, 0.01556396484375, 0.009765625, -0.0019378662109375, 0.02001953125, 0.00836181640625, -0.03271484375, 0.016357421875, -0.0235595703125, -0.0064697265625, 0.0146484375, 0.01440429...
[ 2819, 12960, 9297, 7522, 711, 41872, 20805, 7704, 3864, 37223, 43581, 103607, 12986, 275, 960, 55043, 127892, 13267, 9254, 34224, 50986, 79315, 2174, 164, 4803, 217, 2389, 21441, 23, 18, 757, 808, 2676, 10, 25758, 4288, 892, 1505, 30646, ...
[ 0.04296875, 0.1611328125, 0.1602783203125, 0.1629638671875, 0.022857666015625, 0.052154541015625, 0.1590576171875, 0.1231689453125, 0.12353515625, 0.1182861328125, 0.22509765625, 0.012115478515625, 0.21875, 0.1951904296875, 0.082275390625, 0.1781005859375, 0.2034912109375, 0.094909...
embed
2149727_c0
2149727
lisp
0
Title: Are there open source Common Lisp COM wrappers? Problem title: Are there open source Common Lisp COM wrappers? Tags: com, winapi, common-lisp, lisp Problem: Are there open source Common Lisp COM wrappers? I have an application that is written in SBCL and is deployed as an executable on Windows. The need has aris...
Are there open source Common Lisp COM wrappers? Are there open source Common Lisp COM wrappers? com winapi common-lisp lisp Common Lisp COM Are there open source Common Lisp COM wrappers? I have an application that is written in SBCL and is deployed as an executable on Windows. The need has arisen for it to interact wi...
[ -0.00238037109375, 0.005340576171875, 0.00433349609375, 0.007659912109375, -0.017578125, 0.01043701171875, -0.0126953125, -0.017822265625, 0.006622314453125, -0.017822265625, 0.007232666015625, 0.0164794921875, 0.0198974609375, -0.0027618408203125, 0.0152587890625, 0.0028228759765625, ...
[ 15901, 2685, 9803, 31344, 151301, 1261, 7008, 31436, 137565, 21777, 375, 19916, 40897, 39210, 4086, 254, 400, 38415, 59121, 90944, 37486, 13158, 71924, 3773, 3871, 78974, 30326, 1829, 391, 8399, 3714, 8781, 69405, 44841, 19336, 76104, 313, 35...
[ 0.032470703125, 0.0926513671875, 0.1505126953125, 0.1890869140625, 0.2149658203125, 0.197509765625, 0.226806640625, 0.2410888671875, 0.2216796875, 0.2086181640625, 0.19580078125, 0.05877685546875, 0.1649169921875, 0.146728515625, 0.14013671875, 0.161865234375, 0.1383056640625, 0.12...
embed
56204166_c0
56204166
lisp
0
Title: How can I append two lists together? Scheme Problem title: How can I append two lists together? Scheme Tags: append, lisp, list, racket, scheme Problem: How can I append two lists together? Scheme I need help merging two lists together. My goal is to replace "a" with "abc" . I've already done a counter etc but s...
How can I append two lists together? Scheme How can I append two lists together? Scheme append lisp list racket scheme How Scheme Kein Text start1 How can I append two lists together? Scheme I need help merging two lists together. My goal is to replace "a" with "abc" . I've already done a counter etc but somehow I can'...
[ 0.006805419921875, 0.008544921875, 0.00103759765625, 0.034423828125, 0.002288818359375, 0.02587890625, 0.0155029296875, -0.0027923583984375, 0.024658203125, -0.00628662109375, 0.0155029296875, -0.006622314453125, -0.0113525390625, 0.0103759765625, 0.01519775390625, -0.01019287109375, ...
[ 11249, 831, 87, 114689, 71, 6626, 5303, 7, 25842, 34702, 282, 400, 7008, 673, 27853, 150370, 123381, 24129, 4034, 418, 3871, 4358, 1143, 9966, 69236, 91995, 11, 678, 2055, 238, 105416, 18, 6097, 6562, 201505, 3525, 15190, 1286, 1620, 2967...
[ 0.1109619140625, 0.099853515625, 0.0251922607421875, 0.2012939453125, 0.1583251953125, 0.193603515625, 0.264404296875, 0.105712890625, 0.252197265625, 0.1563720703125, 0.0792236328125, 0.055328369140625, 0.134765625, 0.048095703125, 0.16064453125, 0.20947265625, 0.1175537109375, 0....
embed
62460523_c0
62460523
lisp
0
Title: Can a tail recursive function still get stack overflow? Problem title: Can a tail recursive function still get stack overflow? Tags: common-lisp, tail-recursion, lisp Problem: Can a tail recursive function still get stack overflow? I've been solving some challenges at codesignal.com using C-Lisp to learn it and ...
Can a tail recursive function still get stack overflow? Can a tail recursive function still get stack overflow? common-lisp tail-recursion lisp Can Can a tail recursive function still get stack overflow? I've been solving some challenges at codesignal.com using C-Lisp to learn it and I've been avoiding using loops to m...
[ 0.010498046875, 0.0189208984375, 0.0126953125, 0.00029754638671875, -0.0068359375, -0.0029296875, -0.0234375, -0.004302978515625, 0.0078125, -0.020751953125, 0.0037384033203125, -0.01239013671875, 0.0047607421875, -0.0034637451171875, 0.0390625, 0.0022125244140625, 0.007415771484375,...
[ 4171, 46741, 195625, 5844, 32354, 7464, 2046, 177261, 645, 118664, 39210, 4086, 254, 107, 48650, 1830, 400, 7008, 127125, 18151, 165992, 313, 9506, 30698, 71864, 40956, 20623, 66801, 75939, 214, 294, 10321, 10298, 10, 21334, 30646, 6562, 1183...
[ 0.07623291015625, 0.26123046875, 0.21533203125, 0.1417236328125, 0.1824951171875, 0.158447265625, 0.07537841796875, 0.1796875, 0.127197265625, 0.279052734375, 0.06298828125, 0.0615234375, 0.131103515625, 0.029998779296875, 0.1658935546875, 0.0218353271484375, 0.0816650390625, 0.135...
embed
52019144_c0
52019144
lisp
0
Title: Scheme (Kawa) - How to force macro expansion inside another macro Problem title: Scheme (Kawa) - How to force macro expansion inside another macro Tags: lisp, kawa, scheme, macros Problem: Scheme (Kawa) - How to force macro expansion inside another macro I want to make a macro, that when used in class definition...
Scheme (Kawa) - How to force macro expansion inside another macro Scheme (Kawa) - How to force macro expansion inside another macro lisp kawa scheme macros Scheme Kawa How java.util.List Scheme (Kawa) - How to force macro expansion inside another macro I want to make a macro, that when used in class definition creates ...
[ 0.01019287109375, 0.023681640625, -0.0155029296875, 0.021728515625, -0.00147247314453125, 0.0159912109375, -0.002777099609375, -0.0025634765625, -0.015869140625, -0.0032196044921875, 0.0108642578125, -0.0184326171875, -0.01251220703125, 0.005523681640625, 0.001861572265625, -0.03295898...
[ 34702, 282, 605, 7978, 11249, 37772, 111789, 14700, 66, 6889, 46132, 15700, 400, 7008, 57710, 150370, 105221, 79, 330, 3675, 154663, 3444, 3249, 11814, 18507, 80934, 28282, 44457, 3835, 88685, 8668, 959, 71062, 214, 3789, 67413, 27781, 61924,...
[ 0.15087890625, 0.122802734375, 0.049713134765625, 0.18359375, 0.0640869140625, 0.216064453125, 0.2247314453125, 0.109130859375, 0.1646728515625, 0.08917236328125, 0.1680908203125, 0.117919921875, 0.018646240234375, 0.10205078125, 0.169921875, 0.161865234375, 0.166748046875, 0.07812...
embed
46473092_c0
46473092
lisp
0
Title: Why does this program return a list of atoms? Problem title: Why does this program return a list of atoms? Tags: common-lisp, lisp Problem: Why does this program return a list of atoms? So I am learning Lisp at school and one of the programs I have to create is one that duplicates the functionality of remove-if-...
Why does this program return a list of atoms? Why does this program return a list of atoms? common-lisp lisp Why Why does this program return a list of atoms? So I am learning Lisp at school and one of the programs I have to create is one that duplicates the functionality of remove-if-not by using mapcan. I have create...
[ 0.003387451171875, 0.002685546875, 0.002410888671875, 0.0216064453125, -0.01239013671875, 0.0177001953125, 0.0223388671875, 0.017333984375, -0.0031585693359375, -0.0264892578125, 0.01068115234375, -0.015869140625, 0.0098876953125, 0.0072021484375, -0.001800537109375, 0.0052490234375, ...
[ 44084, 14602, 903, 1528, 30646, 10, 5303, 111, 34627, 7, 39210, 4086, 254, 400, 7008, 52080, 1261, 10696, 103391, 28282, 171763, 123309, 87388, 3190, 10869, 17368, 22288, 4398, 75935, 43240, 26785, 18, 28219, 140992, 11675, 8439, 100094, 2980...
[ 0.17919921875, 0.0810546875, 0.104736328125, 0.2061767578125, 0.2279052734375, 0.06500244140625, 0.1885986328125, 0.0809326171875, 0.2359619140625, 0.0924072265625, 0.1357421875, 0.1134033203125, 0.1597900390625, 0.10546875, 0.18115234375, 0.0196075439453125, 0.1080322265625, 0.083...
embed
20776389_c0
20776389
lisp
0
Title: Lisp code is not responsive Problem title: Lisp code is not responsive Tags: primes, lisp, common-lisp, clisp Problem: Lisp code is not responsive Spoiler alert: this is the answer to number 7 on Project Euler. I'm learning Lisp and I was using compileonline.com to run my code. It was running out of memory on a ...
Lisp code is not responsive Lisp code is not responsive primes lisp common-lisp clisp current Lisp Lisp code is not responsive Spoiler alert: this is the answer to number 7 on Project Euler. I'm learning Lisp and I was using compileonline.com to run my code. It was running out of memory on a simple program though, so I...
[ 0.004974365234375, 0.02001953125, 0.0126953125, 0.006988525390625, 0.00714111328125, 0.00933837890625, 0.01470947265625, -0.01043701171875, -0.010009765625, -0.045166015625, 0.0093994140625, -0.007415771484375, -0.002197265625, 0.0010223388671875, 0.00579833984375, 0.021240234375, 0....
[ 1261, 7008, 18151, 83, 959, 226874, 20809, 400, 39210, 4086, 254, 95701, 43581, 110342, 35166, 361, 27331, 5177, 603, 52080, 17368, 9969, 1340, 25607, 277, 11675, 51042, 1810, 98323, 8781, 1528, 101089, 86983, 11389, 3853, 14192, 15400, 221, ...
[ 0.1788330078125, 0.2371826171875, 0.2261962890625, 0.059234619140625, 0.1402587890625, 0.260009765625, 0.1580810546875, 0.143310546875, 0.117919921875, 0.1390380859375, 0.1610107421875, 0.0897216796875, 0.1390380859375, 0.036163330078125, 0.0087890625, 0.0118408203125, 0.042205810546...
embed
68203393_c0
68203393
lisp
0
Title: Equivalent of getters/accessors in Common Lisp Problem title: Equivalent of getters/accessors in Common Lisp Tags: clisp, common-lisp, getter, lisp, accessor Problem: Equivalent of getters/accessors in Common Lisp I am writing a program where each time I access the value of a boolean, no matter how it's accesed,...
Equivalent of getters/accessors in Common Lisp Equivalent of getters/accessors in Common Lisp clisp common-lisp getter lisp accessor getval Equivalent Common Lisp a_private NIL Equivalent of getters/accessors in Common Lisp I am writing a program where each time I access the value of a boolean, no matter how it's acces...
[ -0.0018310546875, 0.020263671875, 0.0224609375, -0.005584716796875, 0.0034332275390625, 0.01422119140625, -0.0002422332763671875, 0.0025177001953125, 0.00102996826171875, -0.007049560546875, 0.000396728515625, 0.058349609375, -0.0022735595703125, -0.0126953125, 0.0189208984375, -0.0037...
[ 145666, 85540, 111, 2046, 23962, 64, 108176, 4295, 151301, 1261, 7008, 23, 95701, 39210, 4086, 254, 720, 400, 97841, 42, 1405, 10, 158559, 541, 16444, 32562, 1528, 12638, 1733, 17203, 34292, 337, 31, 34677, 66236, 131983, 2448, 180, 20880, ...
[ 0.09033203125, 0.1474609375, 0.0265045166015625, 0.18212890625, 0.217041015625, 0.027679443359375, 0.2076416015625, 0.157470703125, 0.1810302734375, 0.1585693359375, 0.2037353515625, 0.009307861328125, 0.06903076171875, 0.171875, 0.13232421875, 0.08587646484375, 0.1326904296875, 0....
embed
9062043_c0
9062043
lisp
0
Title: Why do we need `nil`? Problem title: Why do we need `nil`? Tags: scheme, s-expression, lisp Problem: Why do we need `nil`? I do not see why we need nil [1] when to cons a sequence (so-called proper list) of items. It seems to me we can achieve the same goal by using the so-called improper list ( cons -ed pairs w...
Why do we need `nil`? Why do we need `nil`? scheme s-expression lisp Why NIL Why do we need `nil`? I do not see why we need nil [1] when to cons a sequence (so-called proper list) of items. It seems to me we can achieve the same goal by using the so-called improper list ( cons -ed pairs without an ending nil ) alone. S...
[ 0.0106201171875, 0.0263671875, 0.0172119140625, -0.0030059814453125, -0.004638671875, 0.0125732421875, -0.0047607421875, 0.0008697509765625, 0.01336669921875, -0.01043701171875, 0.01470947265625, -0.0101318359375, -0.01397705078125, 0.002166748046875, -0.0019073486328125, -0.0071411132...
[ 44084, 54, 642, 3871, 17324, 1135, 150370, 91, 204629, 400, 7008, 541, 16444, 9473, 959, 1957, 15400, 3229, 47, 158, 7, 40, 944, 3956, 27798, 5303, 55769, 37202, 831, 69307, 5701, 69236, 17368, 60418, 1264, 297, 80836, 15490, 86658, 75447...
[ 0.1700439453125, 0.060546875, 0.1015625, 0.20947265625, 0.286376953125, 0.0428466796875, 0.1734619140625, 0.09600830078125, 0.209228515625, 0.119873046875, 0.1817626953125, 0.1796875, 0.2430419921875, 0.032470703125, 0.055755615234375, 0.083251953125, 0.1304931640625, 0.04711914062...
embed
14719817_c0
14719817
lisp
0
Title: In list, how can I make modifications to a list through a function which takes the list as a parameter? Problem title: In list, how can I make modifications to a list through a function which takes the list as a parameter? Tags: lisp, list, pass-by-value, common-lisp Problem: In list, how can I make modification...
In list, how can I make modifications to a list through a function which takes the list as a parameter? In list, how can I make modifications to a list through a function which takes the list as a parameter? lisp list pass-by-value common-lisp In list, how can I make modifications to a list through a function which tak...
[ 0.006988525390625, 0.0218505859375, 0.0205078125, 0.001373291015625, -0.00286865234375, 0.0155029296875, -0.019287109375, 0.0093994140625, 0.0181884765625, -0.00213623046875, -0.002288818359375, 0.02001953125, 0.01416015625, -0.025146484375, -0.00213623046875, 0.00150299072265625, 0....
[ 360, 5303, 3642, 831, 3249, 129344, 7, 47, 8305, 32354, 51776, 237, 171859, 10, 400, 7008, 27875, 1272, 27494, 39210, 4086, 254, 87, 32562, 1528, 1261, 3884, 80854, 1295, 6626, 3934, 3525, 1632, 18151, 140992, 83, 11343, 17324, 9790, 4527...
[ 0.0400390625, 0.23876953125, 0.0626220703125, 0.07379150390625, 0.12744140625, 0.25390625, 0.173583984375, 0.143310546875, 0.0989990234375, 0.2265625, 0.08453369140625, 0.0965576171875, 0.2286376953125, 0.04083251953125, 0.0853271484375, 0.2222900390625, 0.104736328125, 0.100952148...
embed
27426613_c0
27426613
lisp
0
Title: Apply function recursively across 2 lists in Common Lisp Problem title: Apply function recursively across 2 lists in Common Lisp Tags: common-lisp, recursion, list, lisp, function Problem: Apply function recursively across 2 lists in Common Lisp I have a function written in common LISP that multiplies the first ...
Apply function recursively across 2 lists in Common Lisp Apply function recursively across 2 lists in Common Lisp common-lisp recursion list lisp function Apply Common Lisp t1p1 t1p2 rem1 rem2 Apply function recursively across 2 lists in Common Lisp I have a function written in common LISP that multiplies the first ter...
[ -0.009765625, 0.033447265625, 0.007049560546875, 0.002105712890625, -0.00189208984375, 0.0294189453125, 0.005462646484375, -0.00177764892578125, 0.0120849609375, -0.050048828125, 0.0220947265625, 0.003936767578125, 0.005157470703125, -0.0106201171875, 0.0030670166015625, 0.002243041992...
[ 5659, 538, 32354, 195625, 5844, 36880, 116, 5303, 151301, 1261, 7008, 39210, 4086, 254, 1830, 400, 418, 304, 14194, 59121, 16970, 9434, 118126, 5117, 13579, 35874, 1687, 15403, 43240, 66161, 3444, 915, 136, 13, 8305, 15044, 1632, 4989, 756,...
[ 0.1806640625, 0.12158203125, 0.1898193359375, 0.23291015625, 0.1375732421875, 0.210205078125, 0.16552734375, 0.2091064453125, 0.1474609375, 0.1544189453125, 0.1751708984375, 0.123046875, 0.09320068359375, 0.11474609375, 0.0986328125, 0.0863037109375, 0.04168701171875, 0.10607910156...
embed
60982103_c0
60982103
lisp
0
Title: Longest subset of numbers in Scheme Problem title: Longest subset of numbers in Scheme Tags: lisp, functional-programming, racket, scheme Problem: Longest subset of numbers in Scheme I'm new to learning scheme so I have a few questions. So I am writing a program that looks within a given list and returns the lon...
Longest subset of numbers in Scheme Longest subset of numbers in Scheme lisp functional-programming racket scheme Longest Scheme i.e Longest subset of numbers in Scheme I'm new to learning scheme so I have a few questions. So I am writing a program that looks within a given list and returns the longest subset of identi...
[ 0.004669189453125, 0.03173828125, 0.00567626953125, 0.001922607421875, -0.013671875, 0.003631591796875, 0.0076904296875, 0.002166748046875, 0.01397705078125, -0.0177001953125, -0.00018405914306640625, 0.0147705078125, -0.006317138671875, 0.00616455078125, 0.0052490234375, 0.00964355468...
[ 14407, 525, 1614, 3509, 101935, 23, 34702, 282, 400, 7008, 123309, 28966, 673, 27853, 150370, 3525, 52080, 10846, 32562, 1528, 33342, 28032, 34475, 5303, 30646, 4989, 31943, 6827, 82424, 19441, 37348, 195625, 5844, 2831, 2967, 7413, 6626, 450...
[ 0.160888671875, 0.1636962890625, 0.1876220703125, 0.1934814453125, 0.210205078125, 0.06591796875, 0.1900634765625, 0.1611328125, 0.054901123046875, 0.1536865234375, 0.1080322265625, 0.08575439453125, 0.0421142578125, 0.1695556640625, 0.186767578125, 0.030548095703125, 0.1220703125, ...
embed
28275392_c0
28275392
lisp
0
Title: Is it possible to do dependent types in Shen? Problem title: Is it possible to do dependent types in Shen? Tags: shen, dependent-type, lisp, types Problem: Is it possible to do dependent types in Shen? We see the benefits of Dependent Types in a paper written by Ana Bove and Peter Dybjer : Dependent types are ty...
Is it possible to do dependent types in Shen? Is it possible to do dependent types in Shen? shen dependent-type lisp types Shen Is it possible to do dependent types in Shen? We see the benefits of Dependent Types in a paper written by Ana Bove and Peter Dybjer : We also see the benefits on Cedric's blog : The Shen lang...
[ -0.005126953125, 0.0274658203125, -0.00787353515625, 0.01397705078125, -0.00811767578125, -0.006805419921875, -0.02001953125, 0.00714111328125, -0.0164794921875, -0.037353515625, -0.0038299560546875, -0.00162506103515625, -0.010498046875, 0.004638671875, -0.003204345703125, 0.014343261...
[ 7722, 54, 108750, 52895, 23, 4687, 19, 47, 2412, 50986, 400, 7008, 72382, 262, 26885, 660, 60457, 7, 5710, 272, 7948, 4227, 12259, 46876, 175961, 10644, 5426, 6868, 98363, 4252, 214, 131801, 2071 ]
[ 0.1630859375, 0.0875244140625, 0.2275390625, 0.2490234375, 0.07958984375, 0.1776123046875, 0.1671142578125, 0.019866943359375, 0.119873046875, 0.1539306640625, 0.0731201171875, 0.0977783203125, 0.1346435546875, 0.1021728515625, 0.154052734375, 0.109130859375, 0.2298583984375, 0.017...
embed
53324225_c0
53324225
lisp
0
Title: How to generate a list of lambdas in scheme? Problem title: How to generate a list of lambdas in scheme? Tags: lisp, scheme Problem: How to generate a list of lambdas in scheme? I am trying to make a procedure which takes a list of lambdas, and uses the return value of these lambdas. In order to create and popul...
How to generate a list of lambdas in scheme? How to generate a list of lambdas in scheme? lisp scheme How How to generate a list of lambdas in scheme? I am trying to make a procedure which takes a list of lambdas, and uses the return value of these lambdas. In order to create and populate this list, I made the procedur...
[ 0.000865936279296875, 0.0255126953125, -0.0191650390625, -0.01513671875, -0.0048828125, 0.005859375, -0.0196533203125, 0.0031280517578125, 0.00311279296875, -0.050537109375, -0.01361083984375, -0.029296875, -0.00046539306640625, -0.00299072265625, 0.0172119140625, -0.011962890625, 0....
[ 11249, 47, 139392, 5303, 111, 21, 6492, 1124, 23, 150370, 400, 7008, 10, 31577, 3249, 50491, 51776, 4527, 30646, 34292, 28282, 27623, 7228, 237, 10750, 101935, 1295, 24189, 116, 20441, 7311, 387, 6562, 4390, 2606, 1297, 30482, 5173, 543, ...
[ 0.088623046875, 0.0236968994140625, 0.24755859375, 0.22119140625, 0.07586669921875, 0.1287841796875, 0.2113037109375, 0.1983642578125, 0.09332275390625, 0.2484130859375, 0.0770263671875, 0.169189453125, 0.0404052734375, 0.0283660888671875, 0.0201416015625, 0.14990234375, 0.0462036132...
embed
31924895_c1
31924895
lisp
1
brot (+ z2r cr) (+ z2c cc) cr cc (- i 1))))) (define (linspace i w) (/ (- i (/ w 2)) (/ w 4))) (define (brot-grid w h n) (dotimes (i w) (dotimes (j h) (let ((x (linspace i w)) (y (linspace j h))) (brot 0 0 x y n))) (newline))) (brot-grid 40 80 20) (I hope the code block is not too clustery, it was hard to strip it to s...
brot (+ z2r cr) (+ z2c cc) cr cc (- i 1))))) (define (linspace i w) (/ (- i (/ w 2)) (/ w 4))) (define (brot-grid w h n) (dotimes (i w) (dotimes (j h) (let ((x (linspace i w)) (y (linspace j h))) (brot 0 0 x y n))) (newline))) (brot-grid 40 80 20) (I hope the code block is not too clustery, it was hard to strip it to s...
[ -0.037353515625, -0.00830078125, 0.0007781982421875, -0.0002193450927734375, -0.0267333984375, -0.00665283203125, 0.0018157958984375, -0.014404296875, 0.005584716796875, -0.01025390625, 0.003997802734375, -0.025634765625, -0.01300048828125, -0.019287109375, -0.0252685546875, 0.00370788...
[ 7155, 18, 22183, 97, 304, 42, 8374, 10060, 9, 17, 4879, 80126, 64552, 2397, 65421, 148, 64, 4958, 201, 6369, 120067, 246, 70141, 1096, 1974, 53, 757, 54936, 2256, 1112, 2248, 387, 18151, 46389, 234737, 8781, 34702, 282, 136, 151301, 126...
[ 0.2130126953125, 0.246337890625, 0.1339111328125, 0.0655517578125, 0.1064453125, 0.0726318359375, 0.1005859375, 0.0618896484375, 0.0226287841796875, 0.0362548828125, 0.00103759765625, 0.0230712890625, 0.07177734375, 0.05706787109375, 0.1619873046875, 0.06805419921875, 0.0079345703125...
embed
63744811_c0
63744811
lisp
0
Title: How to simulate collecting in nested loop for Problem title: How to simulate collecting in nested loop for Tags: common-lisp, lisp Problem: How to simulate collecting in nested loop for I want to create a list of pairs (a . b) with 1 < a < b <= n up to n , e.g. n = 5 : ((2 . 3) (2 . 4) (3 . 4) (2 . 5) (3 . 5) (4...
How to simulate collecting in nested loop for How to simulate collecting in nested loop for common-lisp lisp 3 2 How NIL How to simulate collecting in nested loop for I want to create a list of pairs (a . b) with 1 < a < b <= n up to n , e.g. n = 5 : (The order of the pairs is not critical.) I came up with the code but...
[ 0.00124359130859375, 0.0206298828125, 0.0115966796875, 0.0101318359375, -0.00090789794921875, 0.0255126953125, -0.0108642578125, -0.00714111328125, 0.00421142578125, -0.024169921875, 0.023681640625, 0.005157470703125, 0.018798828125, -0.008544921875, 0.01416015625, -0.005615234375, -...
[ 11249, 40226, 67, 43799, 214, 23, 8512, 71, 40956, 100, 47, 39210, 4086, 254, 400, 7008, 138, 541, 16444, 3444, 28282, 5303, 80836, 876, 678, 106, 4426, 653, 1257, 190, 12989, 130306, 18151, 18, 36663, 158661, 5701, 37842, 16750, 959, 7...
[ 0.05419921875, 0.269775390625, 0.101806640625, 0.236572265625, 0.119140625, 0.079833984375, 0.2427978515625, 0.1409912109375, 0.2222900390625, 0.1231689453125, 0.00286865234375, 0.13623046875, 0.0955810546875, 0.12060546875, 0.08709716796875, 0.1424560546875, 0.02587890625, 0.03048...
embed
77107122_c0
77107122
lisp
0
Title: Trouble Running Lisp Script in Emacs with SBCL Problem title: Trouble Running Lisp Script in Emacs with SBCL Tags: lisp, sbcl, slime, emacs, common-lisp Problem: Trouble Running Lisp Script in Emacs with SBCL I'm encountering an issue when trying to run a Lisp script in Emacs with SBCL. I have the following dire...
Trouble Running Lisp Script in Emacs with SBCL Trouble Running Lisp Script in Emacs with SBCL lisp sbcl slime emacs common-lisp Trouble Running Lisp Script Emacs SBCL x86-64 q1.lisp hello.lisp Hello Trouble Running Lisp Script in Emacs with SBCL I'm encountering an issue when trying to run a Lisp script in Emacs with S...
[ 0.01123046875, 0.0078125, -0.0135498046875, 0.00439453125, -0.0361328125, 0.0069580078125, -0.0023651123046875, 0.0033416748046875, -0.01483154296875, -0.01025390625, 0.000701904296875, 0.0081787109375, -0.003662109375, 0.0186767578125, -0.004425048828125, -0.003570556640625, -0.0003...
[ 119671, 2661, 28398, 1261, 7008, 84654, 23, 85269, 4439, 678, 90944, 37486, 400, 275, 34937, 34264, 13, 352, 2263, 39210, 4086, 254, 15276, 13307, 418, 33600, 31, 35378, 190647, 31089, 31577, 11675, 26499, 765, 25632, 14364, 45646, 72367, 1...
[ 0.1434326171875, 0.0723876953125, 0.1331787109375, 0.1712646484375, 0.25048828125, 0.2388916015625, 0.046722412109375, 0.181396484375, 0.195068359375, 0.121337890625, 0.1387939453125, 0.1890869140625, 0.07708740234375, 0.032745361328125, 0.138916015625, 0.1151123046875, 0.06555175781...
embed
71618311_c1
71618311
lisp
1
idently stepped right in to solve the mystery atop Skelen Manor.")) here is my entire code (define A '("Confidently stepped right in to solve the mystery atop Skelen Manor.")) (define b '( "Ran away due to my fear of death and the boredom of the paperwork after the matter")) (define line1 '("Walking away from the polic...
idently stepped right in to solve the mystery atop Skelen Manor.")) here is my entire code (define A '("Confidently stepped right in to solve the mystery atop Skelen Manor.")) (define b '( "Ran away due to my fear of death and the boredom of the paperwork after the matter")) (define line1 '("Walking away from the polic...
[ -0.01708984375, -0.0030517578125, 0.010986328125, 0.031005859375, -0.00022220611572265625, 0.0211181640625, 0.0003814697265625, 0.0216064453125, 0.00946044921875, 0.0028839111328125, -0.00110626220703125, 0.0015716552734375, -0.004150390625, -0.0018768310546875, 0.01385498046875, 0.019...
[ 60460, 538, 2288, 48398, 7108, 23, 86869, 236209, 13784, 56901, 1977, 1572, 748, 18939, 3688, 83, 759, 64194, 18151, 112, 64552, 62, 420, 52128, 876, 126525, 16065, 4743, 30783, 47219, 136355, 15122, 18244, 7103, 26866, 13315, 418, 97207, 3...
[ 0.11279296875, 0.042266845703125, 0.08245849609375, 0.0880126953125, 0.103515625, 0.115234375, 0.1695556640625, 0.1953125, 0.14013671875, 0.1629638671875, 0.2022705078125, 0.07958984375, 0.1270751953125, 0.007781982421875, 0.051971435546875, 0.04425048828125, 0.0755615234375, 0.148...
embed
42035379_c0
42035379
lisp
0
Title: how are functions defined in the lisp dialect used in the little lisper 1974 edition Problem title: how are functions defined in the lisp dialect used in the little lisper 1974 edition Tags: common-lisp, lisp, sbcl Problem: how are functions defined in the lisp dialect used in the little lisper 1974 edition The ...
how are functions defined in the lisp dialect used in the little lisper 1974 edition how are functions defined in the lisp dialect used in the little lisper 1974 edition common-lisp lisp sbcl ISLAT LAMBDA COND ATOM CAR CDR how are functions defined in the lisp dialect used in the little lisper 1974 edition The first fu...
[ 0.008544921875, 0.005767822265625, -0.0091552734375, -0.0037994384765625, -0.01904296875, -0.005096435546875, 0.0164794921875, -0.00506591796875, 0.000720977783203125, -0.0185546875, 0.00189971923828125, -0.02099609375, -0.03515625, -0.0118408203125, 0.0108642578125, 0.017822265625, ...
[ 3642, 32354, 7, 61924, 71, 400, 7008, 220734, 11814, 10176, 20595, 27898, 79737, 39210, 4086, 254, 275, 34937, 15744, 38705, 12689, 6538, 14452, 397, 117032, 42476, 23498, 23, 5117, 80934, 59784, 1261, 135179, 28960, 3293, 6713, 27798, 11675,...
[ 0.0340576171875, 0.287841796875, 0.125732421875, 0.2222900390625, 0.0716552734375, 0.146728515625, 0.2161865234375, 0.199951171875, 0.1170654296875, 0.1307373046875, 0.2098388671875, 0.194091796875, 0.10546875, 0.06658935546875, 0.0986328125, 0.1258544921875, 0.0360107421875, 0.131...
embed
49848994_c0
49848994
lisp
0
Title: How to generate all the permutations of elements in a list one at a time in Lisp? Problem title: How to generate all the permutations of elements in a list one at a time in Lisp? Tags: permutation, list, lisp, generator, common-lisp Problem: How to generate all the permutations of elements in a list one at a tim...
How to generate all the permutations of elements in a list one at a time in Lisp? How to generate all the permutations of elements in a list one at a time in Lisp? permutation list lisp generator common-lisp How Lisp How to generate all the permutations of elements in a list one at a time in Lisp? I already have the co...
[ 0.01202392578125, 0.03125, 0.004730224609375, -0.004180908203125, -0.00060272216796875, 0.01434326171875, -0.0228271484375, -0.0108642578125, -0.0003795623779296875, -0.04443359375, -0.0021209716796875, 0.02294921875, 0.01214599609375, 0.00628662109375, -0.00160980224609375, 0.01708984...
[ 11249, 47, 139392, 756, 70, 117, 14311, 21094, 80854, 5303, 1632, 10, 1733, 23, 1261, 7008, 561, 22062, 400, 145823, 39210, 4086, 254, 111, 21771, 18151, 45258, 37317, 38516, 106750, 135587, 13695, 3917, 11782, 12765, 14858, 3871, 32354, 30...
[ 0.076416015625, 0.0673828125, 0.237548828125, 0.1405029296875, 0.05059814453125, 0.15380859375, 0.242431640625, 0.1541748046875, 0.188232421875, 0.1947021484375, 0.1121826171875, 0.0229949951171875, 0.16845703125, 0.07305908203125, 0.160400390625, 0.2205810546875, 0.16845703125, 0....
embed
55757698_c0
55757698
lisp
0
Title: How to write a function in a Lisp. Compile that Lisp file. and then run that Lisp program Problem title: How to write a function in a Lisp. Compile that Lisp file. and then run that Lisp program Tags: lisp Problem: How to write a function in a Lisp. Compile that Lisp file. and then run that Lisp program Write, c...
How to write a function in a Lisp. Compile that Lisp file. and then run that Lisp program How to write a function in a Lisp. Compile that Lisp file. and then run that Lisp program lisp How Lisp Compile How to write a function in a Lisp. Compile that Lisp file. and then run that Lisp program Write, compile, and test a f...
[ 0.01531982421875, 0.0078125, -0.021728515625, 0.020263671875, -0.003570556640625, 0.005523681640625, 0.0191650390625, 0.00555419921875, 0.00689697265625, -0.01519775390625, -0.01531982421875, -0.00970458984375, -0.01031494140625, 0.01239013671875, 0.01361083984375, 0.004364013671875, ...
[ 11249, 47, 33022, 32354, 23, 1261, 7008, 15612, 1340, 11435, 11675, 1528, 10, 400, 601, 18781, 9969, 3034, 7477, 151301, 51776, 5303, 54529, 3622, 24491, 892, 26255, 32036, 71924, 4086, 254, 70541, 98352, 27875, 50339, 16750, 181653, 134234, ...
[ 0.067626953125, 0.013458251953125, 0.2398681640625, 0.23291015625, 0.08642578125, 0.1915283203125, 0.251953125, 0.1796875, 0.1641845703125, 0.132568359375, 0.1240234375, 0.1041259765625, 0.0272369384765625, 0.1153564453125, 0.062744140625, 0.0648193359375, 0.1253662109375, 0.163330...
embed
7803561_c0
7803561
lisp
0
Title: How to parse a list of words according to a simplified grammar? Problem title: How to parse a list of words according to a simplified grammar? Tags: nlp, algorithm, haskell, lisp Problem: How to parse a list of words according to a simplified grammar? Just to clarify, this isn't homework. I've been asked for hel...
How to parse a list of words according to a simplified grammar? How to parse a list of words according to a simplified grammar? nlp algorithm haskell lisp How Det Adj How to parse a list of words according to a simplified grammar? Just to clarify, this isn't homework. I've been asked for help on this and am unable to d...
[ 0.000217437744140625, 0.0185546875, -0.00469970703125, 0.03515625, -0.00830078125, 0.0169677734375, -0.00616455078125, 0.0140380859375, 0.00469970703125, -0.0054931640625, 0.005767822265625, -0.0115966796875, -0.01153564453125, -0.0034027099609375, -0.005950927734375, 0.021240234375, ...
[ 11249, 366, 184, 5303, 34153, 59499, 112892, 1029, 122092, 147, 26775, 234873, 1556, 142508, 400, 7008, 579, 3145, 170, 47, 10, 111, 17306, 18244, 4358, 51, 2886, 38694, 86869, 133196, 14941, 149357, 1884, 903, 87, 33938, 40368, 21974, 6183...
[ 0.1190185546875, 0.1995849609375, 0.1412353515625, 0.2135009765625, 0.2125244140625, 0.091796875, 0.2342529296875, 0.165283203125, 0.2021484375, 0.148193359375, 0.1429443359375, 0.1488037109375, 0.0899658203125, 0.2415771484375, 0.0858154296875, 0.1845703125, 0.1925048828125, 0.000...
embed
33605255_c0
33605255
lisp
0
Title: CLOS: Use a slot value to initialize another slot Problem title: CLOS: Use a slot value to initialize another slot Tags: common-lisp, clos, lisp Problem: CLOS: Use a slot value to initialize another slot I am pretty new to using CLOS. Here, I wrote one possible way of defining a Queue using CLOS: (defclass Queue...
CLOS: Use a slot value to initialize another slot CLOS: Use a slot value to initialize another slot common-lisp clos lisp CLOS Use Queue Provide DEFAULT-ELEMENTS QUEUE-SIZE CLOS: Use a slot value to initialize another slot I am pretty new to using CLOS. Here, I wrote one possible way of defining a Queue using CLOS: As ...
[ 0.01055908203125, 0.0177001953125, 0.0107421875, 0.002197265625, -0.0086669921875, -0.024169921875, 0.0064697265625, -0.0152587890625, 0.0098876953125, 0.00274658203125, -0.014404296875, -0.003387451171875, 0.01019287109375, -0.008056640625, -0.006011962890625, 0.00775146484375, -0.0...
[ 313, 92933, 12, 36836, 24897, 34292, 61475, 20650, 15700, 39210, 4086, 254, 20450, 7, 400, 7008, 5813, 13388, 123089, 1514, 14676, 82643, 27587, 33827, 21389, 37066, 9902, 3525, 17368, 13204, 4527, 41, 62539, 3249, 10298, 53, 23, 80854, 104...
[ 0.06866455078125, 0.2459716796875, 0.027069091796875, 0.10369873046875, 0.2178955078125, 0.170654296875, 0.1529541015625, 0.08935546875, 0.05047607421875, 0.085693359375, 0.0244140625, 0.08258056640625, 0.164794921875, 0.007354736328125, 0.0192718505859375, 0.089111328125, 0.14611816...
embed
309440_c0
309440
lisp
0
Title: Lisp In A Box - Why is it starting a server? Problem title: Lisp In A Box - Why is it starting a server? Tags: lisp, emacs, slime, lisp-in-a-box Problem: Lisp In A Box - Why is it starting a server? I've decided to get back into LISP (haven't used it since my AI classes) to get more comfortable with functional p...
Lisp In A Box - Why is it starting a server? Lisp In A Box - Why is it starting a server? lisp emacs slime lisp-in-a-box Lisp Box Why Lisp In A Box - Why is it starting a server? I've decided to get back into LISP (haven't used it since my AI classes) to get more comfortable with functional programming in general, so I...
[ 0.01556396484375, 0.0142822265625, -0.00836181640625, 0.004058837890625, -0.0283203125, 0.01434326171875, -0.010986328125, 0.0029754638671875, 0.01397705078125, -0.003936767578125, 0.00836181640625, 0.006561279296875, -0.01385498046875, 0.0130615234375, 0.0047607421875, -0.003677368164...
[ 1261, 7008, 360, 62, 27271, 44084, 83, 442, 72134, 10, 10723, 400, 352, 2263, 34264, 13, 73, 11, 11728, 4420, 3934, 16970, 9434, 11814, 38730, 61112, 104577, 123309, 56037, 7026, 18507, 32497, 678, 67616, 683, 136, 85269, 4439, 11675, 486...
[ 0.1590576171875, 0.2073974609375, 0.1783447265625, 0.10748291015625, 0.2291259765625, 0.165283203125, 0.047393798828125, 0.026519775390625, 0.1783447265625, 0.06072998046875, 0.2177734375, 0.1185302734375, 0.011810302734375, 0.08612060546875, 0.16845703125, 0.1392822265625, 0.0839843...
embed
51323052_c0
51323052
lisp
0
Title: Common Lisp - Get docstring from methods AND functions? Problem title: Common Lisp - Get docstring from methods AND functions? Tags: common-lisp, lisp, sbcl Problem: Common Lisp - Get docstring from methods AND functions? This is a follow up to this previously asked question about the documentation function, whi...
Common Lisp - Get docstring from methods AND functions? Common Lisp - Get docstring from methods AND functions? common-lisp lisp sbcl methods Common Lisp Get Common Lisp - Get docstring from methods AND functions? This is a follow up to this previously asked question about the documentation function, which apparently d...
[ 0.020751953125, 0.01611328125, -0.000904083251953125, -0.0003871917724609375, -0.020263671875, 0.019775390625, -0.007598876953125, 0.0025787353515625, -0.00482177734375, -0.04150390625, 0.005340576171875, -0.00010824203491210938, -0.01055908203125, -0.02099609375, -0.0096435546875, 0.0...
[ 151301, 1261, 7008, 20779, 51584, 91693, 1295, 150624, 48762, 32354, 39210, 4086, 254, 400, 91, 275, 34937, 209806, 150185, 3917, 84079, 2046, 111, 15322, 33172, 55300, 90944, 37486, 2060, 117432, 11627, 137175, 62163, 20324, 41591, 111789, 959...
[ 0.182861328125, 0.1649169921875, 0.2022705078125, 0.1143798828125, 0.214111328125, 0.291748046875, 0.107666015625, 0.2032470703125, 0.1492919921875, 0.18505859375, 0.125732421875, 0.1124267578125, 0.1436767578125, 0.1160888671875, 0.007080078125, 0.059234619140625, 0.1229248046875, ...
embed
4894522_c0
4894522
lisp
0
Title: in emacs-lisp, how do I correctly use replace-regexp-in-string? Problem title: in emacs-lisp, how do I correctly use replace-regexp-in-string? Tags: lisp, emacs, regex Problem: in emacs-lisp, how do I correctly use replace-regexp-in-string? Given a string, I want to replace all links within it with the link's de...
in emacs-lisp, how do I correctly use replace-regexp-in-string? in emacs-lisp, how do I correctly use replace-regexp-in-string? lisp emacs regex in emacs-lisp, how do I correctly use replace-regexp-in-string? Given a string, I want to replace all links within it with the link's description. For example, given I would l...
[ -0.0137939453125, -0.00130462646484375, -0.02392578125, 0.01336669921875, -0.00384521484375, 0.02783203125, -0.00153350830078125, 0.01336669921875, 0.0130615234375, -0.0272216796875, -0.009033203125, 0.00213623046875, -0.0361328125, -0.0036773681640625, 0.0037078857421875, -0.000010430...
[ 352, 2263, 7, 4086, 254, 3642, 26785, 4527, 91995, 10901, 83613, 73, 91693, 400, 7008, 6835, 3355, 23, 77878, 79315, 3444, 756, 22317, 28032, 678, 3126, 76811, 1884, 30646, 11814, 456, 177149, 56, 64549, 32354, 175399, 133266, 64194, 944, ...
[ 0.051513671875, 0.1190185546875, 0.07781982421875, 0.05792236328125, 0.1484375, 0.052276611328125, 0.1121826171875, 0.1173095703125, 0.2265625, 0.1485595703125, 0.270751953125, 0.1053466796875, 0.2198486328125, 0.06591796875, 0.173583984375, 0.13818359375, 0.1636962890625, 0.013061...
embed
75547785_c1
75547785
lisp
1
(condition) (debugger *debug-level-1* 1710 host "Service Not Available" (format nil "~a" condition))) (:no-error (value) (debugger *debug-level-3* "Return from Web Service:" rtn-msg))) (debugger *debug-level-1* 1700 "Service " host port "CANNOT BE OPENED"))) rtn-msg)) The service is something like this: http://xxxxxx-...
(condition) (debugger *debug-level-1* 1710 host "Service Not Available" (format nil "~a" condition))) (:no-error (value) (debugger *debug-level-3* "Return from Web Service:" rtn-msg))) (debugger *debug-level-1* 1700 "Service " host port "CANNOT BE OPENED"))) rtn-msg)) The service is something like this: http://xxxxxx-...
[ -0.00811767578125, 0.0115966796875, -0.01141357421875, -0.0296630859375, 0.033203125, -0.0130615234375, 0.001983642578125, 0.002410888671875, 0.00124359130859375, -0.00689697265625, 0.01123046875, -0.0048828125, 0.0146484375, 0.00043487548828125, 0.01495361328125, -0.00982666015625, ...
[ 126940, 112, 978, 21407, 85779, 67919, 5759, 729, 963, 27980, 121979, 11205, 238204, 51727, 17324, 11, 35431, 157, 188800, 27494, 8316, 987, 1295, 4002, 12349, 3198, 19, 71792, 11469, 188324, 180, 65441, 4516, 9844, 1884, 903, 1621, 1517, 1...
[ 0.196044921875, 0.097900390625, 0.143798828125, 0.06414794921875, 0.1904296875, 0.1119384765625, 0.0196685791015625, 0.119140625, 0.196533203125, 0.1439208984375, 0.182861328125, 0.1099853515625, 0.1959228515625, 0.165771484375, 0.1566162109375, 0.05511474609375, 0.1988525390625, 0...
embed
20187823_c0
20187823
lisp
0
Title: How do I define a function that creates a function alias? Problem title: How do I define a function that creates a function alias? Tags: common-lisp, lisp, sbcl Problem: How do I define a function that creates a function alias? The Lisp forum thread Define macro alias? has an example of creating function alias u...
How do I define a function that creates a function alias? How do I define a function that creates a function alias? common-lisp lisp sbcl How COMMON-LISP-USER::ZERO How do I define a function that creates a function alias? The Lisp forum thread Define macro alias? has an example of creating function alias using a form ...
[ -0.002532958984375, 0.00286865234375, -0.0004291534423828125, -0.003448486328125, 0.000499725341796875, 0.0169677734375, 0.00933837890625, 0.0220947265625, -0.01129150390625, 0.0281982421875, 0.022705078125, 0.01446533203125, 0.00113677978515625, -0.01177978515625, 0.017333984375, 0.00...
[ 61924, 32354, 450, 28282, 7, 10, 55109, 39210, 4086, 254, 400, 7008, 34937, 31436, 82707, 67616, 683, 1062, 50184, 60481, 670, 87, 1261, 4738, 86997, 64552, 111789, 142, 27781, 105233, 3173, 3293, 43240, 5885, 20662, 45234, 32, 35604, 1653,...
[ 0.197265625, 0.23583984375, 0.041259765625, 0.1871337890625, 0.0389404296875, 0.0247039794921875, 0.296142578125, 0.110107421875, 0.06463623046875, 0.1280517578125, 0.067138671875, 0.1903076171875, 0.060577392578125, 0.042083740234375, 0.1160888671875, 0.0953369140625, 0.163330078125...
embed
28473621_c0
28473621
lisp
0
Title: Can CONS objects be used as a key to a hash table? Problem title: Can CONS objects be used as a key to a hash table? Tags: common-lisp, gnu-common-lisp, lisp Problem: Can CONS objects be used as a key to a hash table? I've been playing with LISP lately, and I want to attempted to optimize a terribly inefficient ...
Can CONS objects be used as a key to a hash table? Can CONS objects be used as a key to a hash table? common-lisp gnu-common-lisp lisp Can CONS LIST NIL Can CONS objects be used as a key to a hash table? I've been playing with LISP lately, and I want to attempted to optimize a terribly inefficient recursive function by...
[ -0.000514984130859375, 0.0027313232421875, 0.01300048828125, -0.0106201171875, -0.007568359375, -0.00177001953125, -0.010498046875, 0.0030059814453125, -0.003326416015625, -0.0186767578125, -0.0020294189453125, 0.00860595703125, 0.0067138671875, 0.006683349609375, -0.0091552734375, -0....
[ 4171, 109022, 36746, 11814, 237, 22799, 47, 1556, 127, 23180, 7, 10, 39210, 4086, 254, 104155, 3796, 400, 7008, 195977, 541, 16444, 186, 75169, 16970, 9434, 37838, 15572, 24500, 195625, 32354, 377, 59207, 140992, 127877, 12638, 162515, 171859...
[ 0.0853271484375, 0.263427734375, 0.1884765625, 0.1282958984375, 0.0904541015625, 0.2177734375, 0.0888671875, 0.1575927734375, 0.130615234375, 0.194091796875, 0.159423828125, 0.044708251953125, 0.0860595703125, 0.06951904296875, 0.1536865234375, 0.1148681640625, 0.058837890625, 0.07...
embed
27891288_c0
27891288
lisp
0
Title: How can I read and edit the contents of a file.txt in lisp Problem title: How can I read and edit the contents of a file.txt in lisp Tags: lisp, common-lisp, clisp Problem: How can I read and edit the contents of a file.txt in lisp I have this txt : (FIEC01552 LENGUAJES DE PROGRAMACION 40) (FIEC06411 COMPUTACION...
How can I read and edit the contents of a file.txt in lisp How can I read and edit the contents of a file.txt in lisp lisp common-lisp clisp How file.txt FIEC01552 LENGUAJES PROGRAMACION FIEC06411 COMPUTACION SOCIEDAD FIEC03459 INTELIGENCIA ARTIFICIAL ICM01974 ECUACIONES ICM00604 ALGEBRA CALCULO INTEGRAL materias.txt H...
[ -0.000705718994140625, -0.000408172607421875, 0.00531005859375, 0.0152587890625, 0.00897216796875, -0.00885009765625, -0.0012054443359375, 0.0198974609375, -0.00958251953125, -0.0152587890625, -0.000431060791015625, 0.00860595703125, -0.0189208984375, -0.0240478515625, 0.021484375, 0.0...
[ 11249, 831, 12301, 136, 27211, 10941, 7, 11435, 5, 124326, 23, 400, 7008, 87, 39210, 4086, 254, 95701, 150230, 20004, 59677, 170290, 52786, 165889, 164056, 7709, 11679, 17295, 36663, 27169, 6713, 1884, 3095, 18151, 34196, 54825, 13452 ]
[ 0.047576904296875, 0.086181640625, 0.222412109375, 0.141357421875, 0.21484375, 0.1693115234375, 0.0589599609375, 0.17626953125, 0.03460693359375, 0.26953125, 0.065673828125, 0.1138916015625, 0.1925048828125, 0.0175018310546875, 0.0787353515625, 0.0657958984375, 0.1212158203125, 0.0...
embed
19471269_c0
19471269
lisp
0
Title: “car: contract violation expected: pair?” while inserting into a tree Problem title: “car: contract violation expected: pair?” while inserting into a tree Tags: scheme, racket, lisp, binary-search-tree Problem: “car: contract violation expected: pair?” while inserting into a tree Write a procedure called insert-...
“car: contract violation expected: pair?” while inserting into a tree “car: contract violation expected: pair?” while inserting into a tree scheme racket lisp binary-search-tree “car: contract violation expected: pair?” while inserting into a tree This is my code: I keep getting the error: Why do I keep getting this er...
[ 0.00927734375, 0.009765625, -0.0079345703125, -0.01251220703125, -0.01251220703125, 0.0162353515625, -0.04443359375, -0.031494140625, -0.0059814453125, -0.0244140625, 0.0076904296875, -0.0255126953125, 0.0035400390625, -0.00142669677734375, 0.0133056640625, 0.01275634765625, 0.013305...
[ 3284, 12, 18264, 200265, 84751, 80836, 12960, 183540, 3934, 53201, 150370, 673, 27853, 400, 7008, 2394, 6635, 86250, 62600, 18151, 13695, 20949, 18499, 44084, 903 ]
[ 0.1778564453125, 0.061920166015625, 0.19677734375, 0.2470703125, 0.207763671875, 0.2283935546875, 0.041778564453125, 0.1995849609375, 0.073974609375, 0.188720703125, 0.126953125, 0.0296173095703125, 0.1756591796875, 0.06951904296875, 0.1627197265625, 0.10552978515625, 0.075439453125,...
embed
20433164_c0
20433164
lisp
0
Title: Producing a list of Lucas numbers in decreasing order (using let) Problem title: Producing a list of Lucas numbers in decreasing order (using let) Tags: scheme, lisp, fibonacci, let Problem: Producing a list of Lucas numbers in decreasing order (using let) Lucas numbers are similar to Fib numbers except it start...
Producing a list of Lucas numbers in decreasing order (using let) Producing a list of Lucas numbers in decreasing order (using let) scheme lisp fibonacci let let Producing Lucas Producing a list of Lucas numbers in decreasing order (using let) Lucas numbers are similar to Fib numbers except it starts with a 2 instead o...
[ -0.003021240234375, 0.0164794921875, -0.00286865234375, 0.01708984375, -0.01055908203125, 0.00921630859375, 0.0030670166015625, -0.005859375, -0.002899169921875, -0.01300048828125, -0.006988525390625, -0.0023345947265625, -0.0027313232421875, 0.00970458984375, 0.005126953125, -0.000560...
[ 103687, 214, 5303, 74814, 101935, 23, 8, 7612, 162, 12989, 223, 2633, 150370, 400, 7008, 809, 20990, 52544, 21373, 47, 3698, 275, 40494, 4034, 678, 10, 116, 64457, 13806, 3444, 33022, 32354, 27489, 36549, 24189, 653, 927, 12830, 54397, 14...
[ 0.1990966796875, 0.0640869140625, 0.1964111328125, 0.289794921875, 0.195068359375, 0.03912353515625, 0.1319580078125, 0.1463623046875, 0.0919189453125, 0.1629638671875, 0.05511474609375, 0.2303466796875, 0.156982421875, 0.06329345703125, 0.15576171875, 0.0838623046875, 0.118896484375...
embed
48489812_c1
48489812
lisp
1
1 . V2) (KEY2 . V5)) ((KEY1 . V3) (KEY2 . V5))) However, for longer input, the output is no longer correct! > (generate-selectors '((key1 . (v1 v2 v3)) (key2 . (v4 v5)) (key3 . (v6)))) (((KEY1 . V1) ((KEY2 . V4) (KEY3 . V6))) ((KEY1 . V2) ((KEY2 . V4) (KEY3 . V6))) ((KEY1 . V3) ((KEY2 . V4) (KEY3 . V6))) ((KEY1 . V1) (...
1 . V2) (KEY2 . V5)) ((KEY1 . V3) (KEY2 . V5))) However, for longer input, the output is no longer correct! > (generate-selectors '((key1 . (v1 v2 v3)) (key2 . (v4 v5)) (key3 . (v6)))) (((KEY1 . V1) ((KEY2 . V4) (KEY3 . V6))) ((KEY1 . V2) ((KEY2 . V4) (KEY3 . V6))) ((KEY1 . V3) ((KEY2 . V4) (KEY3 . V6))) ((KEY1 . V1) (...
[ -0.0179443359375, 0.02099609375, 0.00634765625, -0.0172119140625, -0.01708984375, 0.003082275390625, -0.030029296875, -0.0057373046875, 0.00616455078125, 0.00628662109375, 0.00701904296875, 0.0159912109375, 0.00531005859375, 0.007537841796875, -0.0179443359375, 0.00787353515625, 0.00...
[ 106, 310, 10461, 186104, 304, 43317, 418, 21320, 758, 33306, 51713, 107730, 140992, 83, 110, 26785, 38, 48281, 67, 184, 187075, 19770, 334, 81, 617, 363, 910, 17727, 8512, 15700, 1614, 6562, 5608, 6713, 1884, 59690, 216806, 903, 139392, 3...
[ 0.030670166015625, 0.127197265625, 0.13232421875, 0.1766357421875, 0.115478515625, 0.1434326171875, 0.07769775390625, 0.09832763671875, 0.0931396484375, 0.0275421142578125, 0.150390625, 0.1827392578125, 0.2158203125, 0.03277587890625, 0.0300445556640625, 0.1728515625, 0.0105285644531...
embed
64604688_c1
64604688
lisp
1
x , that is the number of iterations required would change based on the size of the number. Here is my python equivalent proving that: In [33]: sqrt(2) 1 1.5 1.4166666666666665 achieved 1.4142156862745097 in 3 iterations In [35]: sqrt(1024) 1 512.5 257.2490243902439 130.61480157022683 69.22732405448895 42.009585631008...
x , that is the number of iterations required would change based on the size of the number. Here is my python equivalent proving that: In [33]: sqrt(2) 1 1.5 1.4166666666666665 achieved 1.4142156862745097 in 3 iterations In [35]: sqrt(1024) 1 512.5 257.2490243902439 130.61480157022683 69.22732405448895 42.009585631008...
[ -0.00347900390625, 0.00811767578125, -0.01116943359375, -0.002685546875, 0.02685546875, -0.00823974609375, -0.0113525390625, -0.0169677734375, -0.006866455078125, -0.02197265625, 0.0208740234375, -0.0159912109375, -0.020263671875, 0.01153564453125, -0.01190185546875, 0.01470947265625, ...
[ 1022, 450, 83, 14012, 17, 720, 21094, 56065, 2806, 15549, 35509, 98, 13267, 17198, 50828, 183234, 502, 226429, 91, 864, 3198, 40970, 106, 22410, 48733, 156215, 77622, 170686, 69307, 71, 152837, 178475, 3768, 60450, 14773, 23, 138, 238737, 9...
[ 0.190673828125, 0.001251220703125, 0.0216522216796875, 0.16259765625, 0.0794677734375, 0.255126953125, 0.1202392578125, 0.1707763671875, 0.02783203125, 0.1700439453125, 0.1004638671875, 0.0161285400390625, 0.13916015625, 0.06439208984375, 0.1402587890625, 0.07958984375, 0.03182983398...
embed
46885389_c0
46885389
lisp
0
Title: Find sublist with given sum Problem title: Find sublist with given sum Tags: list, lisp Problem: Find sublist with given sum Given a list L=(M,A1,A2,...,An) . Find sublist if they exist L1=(Ai,Ai+1,...,Ai+k), i+k<=N, i>=1, for which M=Ai+Ai+1+...Ai+k For example 1: L=(12 1 3 -16 5 7 8 2 2), M=12 Result: L=((1 3 ...
Find sublist with given sum Find sublist with given sum list lisp Find YES list1 lst1 ilst1 lst2 ilst2 Find sublist with given sum Given a list L=(M,A1,A2,...,An) . Find sublist if they exist L1=(Ai,Ai+1,...,Ai+k), i+k<=N, i>=1, for which M=Ai+Ai+1+...Ai+k For example 1: L=(12 1 3 -16 5 7 8 2 2), M=12 Result: L=((1 3 -...
[ -0.0107421875, 0.01409912109375, 0.0208740234375, 0.0013275146484375, -0.0172119140625, 0.00933837890625, -0.003814697265625, 0.0191650390625, 0.0262451171875, -0.024169921875, 0.0198974609375, 0.0172119140625, 0.00787353515625, -0.0126953125, -0.0030670166015625, 0.022705078125, 0.0...
[ 26040, 1614, 6562, 678, 34475, 10554, 5303, 400, 7008, 990, 6706, 418, 96, 271, 211, 304, 77878, 339, 1369, 594, 284, 7251, 2174, 1836, 32316, 58559, 21748, 1328, 92, 17, 839, 33000, 276, 27781, 134186, 138, 13528, 1530, 126684, 60978, ...
[ 0.15576171875, 0.273193359375, 0.315673828125, 0.185791015625, 0.19091796875, 0.255126953125, 0.24609375, 0.177734375, 0.260498046875, 0.1390380859375, 0.138671875, 0.0782470703125, 0.000244140625, 0.0758056640625, 0.05426025390625, 0.07586669921875, 0.07098388671875, 0.11547851562...
embed
73159681_c0
73159681
lisp
0
Title: What will be preferred way to share data between game engine and plugin? Problem title: What will be preferred way to share data between game engine and plugin? Tags: memory-management, c%2B%2B, game-engine, interop, lisp Problem: What will be preferred way to share data between game engine and plugin? I'm a beg...
What will be preferred way to share data between game engine and plugin? What will be preferred way to share data between game engine and plugin? memory-management c%2B%2B game-engine interop lisp What What will be preferred way to share data between game engine and plugin? I'm a beginner programmer ( I know scripting ...
[ 0.00109100341796875, 0.0230712890625, 0.000408172607421875, -0.0072021484375, -0.023193359375, -0.0022735595703125, -0.00665283203125, 0.0233154296875, 0.004119873046875, -0.0108642578125, -0.004974365234375, 0.010986328125, 0.01177978515625, 0.01123046875, 0.010009765625, 0.0112304687...
[ 4865, 1221, 186, 12601, 2822, 3917, 12008, 2053, 17721, 6712, 87907, 136, 69993, 47, 98323, 87140, 128897, 1940, 2146, 400, 7008, 9842, 1679, 77848, 3714, 26499, 62822, 37223, 17368, 992, 30544, 91384, 1212, 758, 3444, 28350, 77336, 46132, ...
[ 0.0775146484375, 0.0645751953125, 0.0142822265625, 0.166015625, 0.11962890625, 0.10546875, 0.2347412109375, 0.2034912109375, 0.15234375, 0.1806640625, 0.2381591796875, 0.1229248046875, 0.29345703125, 0.0276336669921875, 0.1865234375, 0.167236328125, 0.1817626953125, 0.07958984375, ...
embed
52680863_c0
52680863
lisp
0
Title: Lisp recursive mergesort with ascending order? Problem title: Lisp recursive mergesort with ascending order? Tags: syntax, mergesort, list, lisp, common-lisp Problem: Lisp recursive mergesort with ascending order? I'm currently trying to write a program that takes two lists of numbers assumed to already be in as...
Lisp recursive mergesort with ascending order? Lisp recursive mergesort with ascending order? syntax mergesort list lisp common-lisp Lisp MERGESORT NLIST1 NLIST2 Lisp recursive mergesort with ascending order? I'm currently trying to write a program that takes two lists of numbers assumed to already be in ascending orde...
[ 0.0032958984375, 0.0133056640625, 0.0111083984375, -0.0111083984375, 0.00058746337890625, 0.0157470703125, -0.00958251953125, 0.010986328125, -0.007415771484375, 0.017822265625, 0.016845703125, 0.004180908203125, 0.009521484375, -0.0076904296875, 0.0091552734375, -0.0179443359375, -0...
[ 1261, 7008, 195625, 5844, 42564, 62351, 678, 82800, 214, 12989, 32, 6002, 86531, 5303, 400, 39210, 4086, 254, 61983, 92315, 105259, 541, 195977, 418, 304, 82424, 31577, 33022, 1528, 51776, 6626, 101935, 41591, 21771, 23, 2060, 32354, 47, 13...
[ 0.1727294921875, 0.2364501953125, 0.2144775390625, 0.126220703125, 0.21826171875, 0.2322998046875, 0.06585693359375, 0.1785888671875, 0.06158447265625, 0.1920166015625, 0.00408935546875, 0.061767578125, 0.185302734375, 0.1829833984375, 0.1361083984375, 0.10540771484375, 0.13464355468...
embed