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
57349076_c0
57349076
lisp
0
Title: What is the difference between a symbol and its name? Problem title: What is the difference between a symbol and its name? Tags: scheme, lisp, racket Problem: What is the difference between a symbol and its name? In The Scheme Programming Language , the Scheme reader (invoked by get-datum and read) and the proce...
What is the difference between a symbol and its name? What is the difference between a symbol and its name? scheme lisp racket What What is the difference between a symbol and its name? In The Scheme Programming Language , What are the keys and values in the " internal symbol table "? Does "always return the same symbo...
[ 0.01031494140625, -0.00543212890625, 0.00927734375, 0.0185546875, -0.0194091796875, 0.00537109375, 0.01043701171875, 0.004669189453125, -0.0030975341796875, 0.0400390625, 0.005126953125, -0.00872802734375, -0.000591278076171875, 0.0107421875, -0.01708984375, 0.010498046875, -0.000598...
[ 4865, 83, 70, 60212, 17721, 10, 26582, 136, 6863, 9351, 150370, 400, 7008, 673, 27853, 34702, 282, 27958, 83658, 22799, 142424, 70796, 23180, 102966, 30646, 5701, 217684, 190647, 6626, 12921, 23755, 79315, 176726, 91693, 157167, 1495, 1295, 1...
[ 0.06134033203125, 0.029052734375, 0.0584716796875, 0.22705078125, 0.1444091796875, 0.057647705078125, 0.2841796875, 0.120849609375, 0.1214599609375, 0.207275390625, 0.1734619140625, 0.030853271484375, 0.128173828125, 0.02728271484375, 0.1402587890625, 0.110595703125, 0.1068115234375,...
embed
12333590_c0
12333590
lisp
0
Title: LISP local/global variable assignment Problem title: LISP local/global variable assignment Tags: common-lisp, lisp Problem: LISP local/global variable assignment If we define a function something like (defun foo(x) (setf x somevalue)) Is x defined as a local variable or global? using setf/q is setting the value ...
LISP local/global variable assignment LISP local/global variable assignment common-lisp lisp LISP LISP local/global variable assignment If we define a function something like Is x defined as a local variable or global? using setf/q is setting the value to be global. if it is global can anyone tell me how to define a lo...
[ 0.016357421875, 0.026123046875, -0.0076904296875, -0.007049560546875, 0.0032806396484375, -0.00148773193359375, -0.0220947265625, 0.0091552734375, 0.0035552978515625, 0.0023956298828125, 0.0185546875, 0.00830078125, 0.004669189453125, -0.0140380859375, 0.01806640625, 0.0118408203125, ...
[ 16970, 9434, 4000, 64, 156566, 77336, 95486, 674, 39210, 4086, 254, 400, 7008, 61924, 32354, 1022, 71, 237, 707, 7964, 17368, 5423, 420, 864, 53550, 34292, 47, 186, 14192, 3642, 10, 23, 3789, 2633, 27781, 68772, 107730, 5775, 31, 1884, ...
[ 0.14013671875, 0.2371826171875, 0.1822509765625, 0.0589599609375, 0.16259765625, 0.274658203125, 0.1929931640625, 0.0270843505859375, 0.0819091796875, 0.0947265625, 0.1480712890625, 0.13623046875, 0.207275390625, 0.193359375, 0.183837890625, 0.11376953125, 0.035430908203125, 0.0271...
embed
10819824_c0
10819824
lisp
0
Title: Emacs: Mode doesn't load on startup Problem title: Emacs: Mode doesn't load on startup Tags: emacs, ide, lisp, elisp, dot-emacs Problem: Emacs: Mode doesn't load on startup I'm using Emacs under Win64. I want to load a mode called gas-mode.el on startup. What I wrote: C-x C-f c:/Program Files (x86)/ema...
Emacs: Mode doesn't load on startup Emacs: Mode doesn't load on startup emacs ide lisp elisp dot-emacs Emacs Mode gas-mode.el C-x C-f Program Files x86 emacs-23.1 C-s C-c Restarting M-x C-j Emacs: Mode doesn't load on startup I'm using Emacs under Win64. I want to load a mode called gas-mode.el on startup. Wh...
[ 0.0155029296875, 0.0186767578125, -0.00860595703125, -0.013427734375, -0.0147705078125, 0.0179443359375, 0.0000629425048828125, 0.0252685546875, 0.01031494140625, -0.03076171875, 0.0111083984375, 0.0142822265625, -0.0252685546875, -0.004486083984375, -0.00518798828125, -0.0155029296875...
[ 85269, 4439, 12, 36024, 22027, 3768, 18, 72367, 98, 73882, 352, 2263, 5415, 400, 7008, 15296, 20633, 11883, 9060, 61170, 583, 425, 9, 420, 7663, 42724, 15276, 5428, 97109, 853, 17137, 276, 313, 170, 17368, 1379, 17686, 13307, 3444, 13736,...
[ 0.2255859375, 0.230224609375, 0.0323486328125, 0.2161865234375, 0.09423828125, 0.0701904296875, 0.1365966796875, 0.221923828125, 0.1197509765625, 0.244140625, 0.12744140625, 0.1727294921875, 0.1202392578125, 0.0430908203125, 0.115234375, 0.0413818359375, 0.042083740234375, 0.166259...
embed
63160315_c0
63160315
lisp
0
Title: Reference to an array element in lisp Problem title: Reference to an array element in lisp Tags: arrays, lisp, common-lisp Problem: Reference to an array element in lisp Is there a way in CommonLisp to store a "reference" or "pointer" to an array element which can be used to update that array element? In the put...
Reference to an array element in lisp Reference to an array element in lisp arrays lisp common-lisp Reference Reference to an array element in lisp Is there a way in CommonLisp to store a "reference" or "pointer" to an array element which can be used to update that array element? In the putmap function below can I call...
[ 0.0034942626953125, 0.01531982421875, 0.0086669921875, -0.001434326171875, 0.011962890625, -0.0045166015625, -0.00640869140625, 0.0198974609375, -0.00101470947265625, -0.017333984375, 0.0028076171875, 0.0234375, 0.006072998046875, 0.00421142578125, 0.0101318359375, -0.01287841796875, ...
[ 215996, 47, 10298, 53, 12830, 400, 7008, 23, 39210, 4086, 254, 3917, 151301, 9506, 4343, 239879, 38496, 56, 11814, 28350, 3884, 62346, 32354, 35064, 11782, 621, 420, 1660, 24145, 91067, 14432 ]
[ 0.2481689453125, 0.1395263671875, 0.157958984375, 0.087890625, 0.189208984375, 0.1265869140625, 0.2205810546875, 0.01293182373046875, 0.09674072265625, 0.09228515625, 0.154541015625, 0.06573486328125, 0.1368408203125, 0.156494140625, 0.1640625, 0.26611328125, 0.167724609375, 0.1346...
embed
19067632_c0
19067632
lisp
0
Title: Difference between LET and SETQ? Problem title: Difference between LET and SETQ? Tags: lisp, common-lisp Problem: Difference between LET and SETQ? I'm programming on Ubuntu using GCL. From the documentation on Common Lisp from various sources, I understand that let creates local variables, and setq sets the valu...
Difference between LET and SETQ? Difference between LET and SETQ? lisp common-lisp Difference SETQ add_using_setq add_using_let Difference between LET and SETQ? I'm programming on Ubuntu using GCL. From the documentation on Common Lisp from various sources, I understand that let creates local variables, and setq sets t...
[ 0.01177978515625, 0.0172119140625, 0.009521484375, 0.0194091796875, 0.0023040771484375, 0.0133056640625, -0.0133056640625, 0.00897216796875, 0.0087890625, -0.0157470703125, 0.00634765625, 0.00811767578125, 0.000530242919921875, 0.00787353515625, 0.0020904541015625, 0.00830078125, -0....
[ 803, 18234, 6620, 17721, 27089, 136, 128565, 2737, 400, 7008, 39210, 4086, 254, 15190, 223, 214, 3509, 864, 1974, 56037, 449, 98, 116890, 17368, 37486, 209806, 151301, 1261, 28219, 2633, 28282, 4000, 77336, 5423, 142424, 144573, 50218, 35064,...
[ 0.10546875, 0.1998291015625, 0.1165771484375, 0.1363525390625, 0.2705078125, 0.093505859375, 0.2154541015625, 0.2108154296875, 0.0780029296875, 0.1756591796875, 0.1116943359375, 0.0709228515625, 0.1273193359375, 0.1251220703125, 0.09619140625, 0.0048828125, 0.1580810546875, 0.21130...
embed
36927219_c0
36927219
lisp
0
Title: Reversing list with sublists and atoms in lisp Problem title: Reversing list with sublists and atoms in lisp Tags: scheme, lisp Problem: Reversing list with sublists and atoms in lisp I am new to a functional programming and trying to reverse a list in lisp. List consists of sublists and atoms. The function (rev...
Reversing list with sublists and atoms in lisp Reversing list with sublists and atoms in lisp scheme lisp Reversing Reversing list with sublists and atoms in lisp I am new to a functional programming and trying to reverse a list in lisp. List consists of sublists and atoms. The function (reverse-tree '((1 2) 5 6 (3))) ...
[ -0.00714111328125, 0.033447265625, -0.00019073486328125, -0.006011962890625, -0.00958251953125, 0.004608154296875, -0.002716064453125, 0.01165771484375, -0.013916015625, -0.01123046875, -0.00077056884765625, 0.0091552734375, 0.01287841796875, 0.01031494140625, 0.021484375, 0.0151367187...
[ 853, 7864, 214, 5303, 678, 1614, 6562, 136, 34627, 400, 7008, 150370, 3525, 123309, 56037, 31577, 39531, 184, 32036, 58055, 32354, 107, 37676, 62600, 4958, 190, 305, 2788, 5608, 30646, 69829, 4879, 43240, 150631, 90, 18499, 18264, 200265, 8...
[ 0.1009521484375, 0.2269287109375, 0.0143585205078125, 0.2327880859375, 0.0614013671875, 0.1956787109375, 0.2393798828125, 0.0296630859375, 0.195068359375, 0.1085205078125, 0.1744384765625, 0.1336669921875, 0.0035400390625, 0.0986328125, 0.080078125, 0.02386474609375, 0.218994140625, ...
embed
3981314_c0
3981314
lisp
0
Title: hacker news algorithm in php? Problem title: hacker news algorithm in php? Tags: ranking, algorithm, arc-lisp, lisp Problem: hacker news algorithm in php? This is the Hacker News ranking algorithm, which I think is a simple way of ranking things, espcially if users are voting on items, but I really dnt understan...
hacker news algorithm in php? hacker news algorithm in php? ranking algorithm arc-lisp lisp Votes Would hacker news algorithm in php? This is the Hacker News ranking algorithm, which I think is a simple way of ranking things, espcially if users are voting on items, but I really dnt understand this, can this be converte...
[ 0.005340576171875, 0.0162353515625, 0.006805419921875, -0.008544921875, -0.0032806396484375, 0.006561279296875, 0.006622314453125, 0.0045166015625, -0.0146484375, -0.035888671875, 0.00168609619140625, -0.0101318359375, -0.0057373046875, -0.00775146484375, 0.006378173828125, -0.01806640...
[ 114831, 7123, 234873, 23, 3958, 32, 77918, 46552, 4086, 254, 400, 7008, 5346, 1636, 154559, 52922, 56, 1833, 5351, 8781, 3917, 8966, 2174, 72095, 20875, 214, 98, 55769, 6183, 660, 28219, 831, 117176, 47, 47302, 89554 ]
[ 0.252197265625, 0.2197265625, 0.26220703125, 0.10906982421875, 0.2451171875, 0.0078582763671875, 0.2244873046875, 0.10162353515625, 0.05133056640625, 0.107421875, 0.052337646484375, 0.1204833984375, 0.15283203125, 0.09930419921875, 0.10418701171875, 0.1826171875, 0.144287109375, 0....
embed
45975769_c0
45975769
lisp
0
Title: Lisp tokenizer from character stream in Python Problem title: Lisp tokenizer from character stream in Python Tags: tokenize, lisp, parsing, python Problem: Lisp tokenizer from character stream in Python I enjoyed reading about Peter Norvig's cheap and cheerful Lisp interpreter here: http://norvig.com/lispy.html ...
Lisp tokenizer from character stream in Python Lisp tokenizer from character stream in Python tokenize lisp parsing python character a Lisp Python Convert chars.replace Generate Lisp tokenizer from character stream in Python I enjoyed reading about Peter Norvig's cheap and cheerful Lisp interpreter here: http://norvig....
[ 0.00830078125, 0.036376953125, -0.01422119140625, 0.0064697265625, 0.003692626953125, -0.0047607421875, 0.003143310546875, -0.00384521484375, -0.004058837890625, -0.0238037109375, 0.01025390625, -0.00089263916015625, -0.0245361328125, 0.004638671875, -0.00457763671875, 0.00274658203125...
[ 1261, 7008, 47, 1098, 52825, 1295, 62816, 75973, 145581, 20650, 400, 366, 17198, 50828, 11549, 21441, 107, 23935, 155370, 105945, 16454, 7948, 12876, 24299, 64720, 290, 29481, 56, 4086, 6493, 18151, 8781, 32354, 107730, 1884, 18781, 145823, 1...
[ 0.1993408203125, 0.22216796875, 0.1005859375, 0.1827392578125, 0.173095703125, 0.061767578125, 0.157470703125, 0.207275390625, 0.2496337890625, 0.0927734375, 0.1494140625, 0.087890625, 0.0789794921875, 0.114990234375, 0.118896484375, 0.133056640625, 0.002044677734375, 0.10369873046...
embed
21838405_c0
21838405
lisp
0
Title: How to return nothing with cons in scheme Problem title: How to return nothing with cons in scheme Tags: cons, lisp, list, scheme Problem: How to return nothing with cons in scheme I have a small issue with an assigned programming task in Scheme. We were given the task to make a function that returns only the va...
How to return nothing with cons in scheme How to return nothing with cons in scheme cons lisp list scheme How How to return nothing with cons in scheme I have a small issue with an assigned programming task in Scheme. We were given the task to make a function that returns only the values in a pair structure that meet t...
[ -0.0001544952392578125, 0.0211181640625, 0.0032501220703125, -0.00823974609375, 0.0091552734375, 0.01556396484375, -0.0115966796875, -0.00848388671875, -0.0028228759765625, -0.029296875, 0.0167236328125, 0.00072479248046875, -0.0027313232421875, 0.002716064453125, 0.0033111572265625, 0...
[ 11249, 30646, 33720, 678, 158, 7, 23, 150370, 400, 7008, 5303, 95486, 56037, 66211, 34702, 282, 32354, 4734, 142424, 80836, 45646, 23356, 96679, 2063, 176377, 29114, 112820, 184750, 18151, 2967, 37076, 56574, 91995, 34292, 87388, 104851, 160, ...
[ 0.046112060546875, 0.2142333984375, 0.1650390625, 0.1505126953125, 0.2020263671875, 0.12353515625, 0.060394287109375, 0.1983642578125, 0.049163818359375, 0.1363525390625, 0.1328125, 0.0186309814453125, 0.022003173828125, 0.05438232421875, 0.10357666015625, 0.10589599609375, 0.0793457...
embed
49460772_c0
49460772
lisp
0
Title: Using `qlot` from a Lisp REPL Problem title: Using `qlot` from a Lisp REPL Tags: lisp, common-lisp, quicklisp Problem: Using `qlot` from a Lisp REPL I'm interested in using the qlot library from inside of a Lisp image to manage multiple local instances of quicklisp . There doesn't seem to be any documentation on...
Using `qlot` from a Lisp REPL Using `qlot` from a Lisp REPL lisp common-lisp quicklisp a Using Lisp REPL qlot:with-local-quicklisp qlot:install qlot:quickload Component Condition ASDF FIND-SYSTEM:MISSING-COMPONENT ql:quickload Using `qlot` from a Lisp REPL I'm interested in using the qlot library from inside of a Lisp ...
[ -0.0111083984375, 0.009033203125, -0.006622314453125, -0.007110595703125, -0.040283203125, -0.000759124755859375, 0.00921630859375, -0.004638671875, 0.00714111328125, -0.0230712890625, -0.01513671875, -0.00107574462890625, 0.0027008056640625, -0.005584716796875, 0.0093994140625, -0.014...
[ 345, 6953, 864, 12631, 1295, 1261, 7008, 9069, 21130, 400, 39210, 4086, 254, 63773, 8096, 76228, 98908, 3181, 80383, 2594, 63033, 54137, 46347, 6483, 38997, 67227, 62428, 90420, 53695, 111848, 79347, 99247, 60892, 17368, 35773, 1294, 46132, 2...
[ 0.098388671875, 0.004547119140625, 0.09735107421875, 0.296875, 0.0946044921875, 0.1353759765625, 0.2066650390625, 0.06768798828125, 0.2333984375, 0.04998779296875, 0.0859375, 0.15625, 0.1722412109375, 0.12255859375, 0.1265869140625, 0.0302734375, 0.09808349609375, 0.07830810546875,...
embed
19412624_c0
19412624
lisp
0
Title: Pass multiple parameters function from other function with Clojure and readability issues Problem title: Pass multiple parameters function from other function with Clojure and readability issues Tags: clojure, sicp, lisp, functional-programming Problem: Pass multiple parameters function from other function with ...
Pass multiple parameters function from other function with Clojure and readability issues Pass multiple parameters function from other function with Clojure and readability issues clojure sicp lisp functional-programming other Pass Clojure Pass multiple parameters function from other function with Clojure and readabili...
[ -0.00189208984375, 0.0186767578125, -0.002349853515625, 0.007080078125, -0.0208740234375, -0.006103515625, 0.00738525390625, -0.01446533203125, -0.002593994140625, -0.01483154296875, 0.000530242919921875, -0.0017242431640625, -0.01214599609375, -0.0135498046875, 0.0023651123046875, 0.0...
[ 28872, 48716, 171859, 32354, 1295, 3789, 678, 51053, 461, 107, 12301, 41159, 37348, 20450, 26536, 254, 400, 7008, 123309, 28966, 31577, 30698, 56037, 449, 159, 198993, 3444, 4527, 220734, 1261, 4552, 69211, 18151, 93, 58134, 11030, 39116, 288...
[ 0.1611328125, 0.2083740234375, 0.23193359375, 0.1761474609375, 0.1199951171875, 0.115966796875, 0.07196044921875, 0.169677734375, 0.2080078125, 0.1629638671875, 0.1724853515625, 0.12548828125, 0.1234130859375, 0.1363525390625, 0.03790283203125, 0.1162109375, 0.05694580078125, 0.207...
embed
16381525_c0
16381525
lisp
0
Title: LISP: Pass variable/symbol into function without evaluating Problem title: LISP: Pass variable/symbol into function without evaluating Tags: variables, lisp Problem: LISP: Pass variable/symbol into function without evaluating I have a function and 2 variables that look something like: (setq A '(A B)) (setq B '(A...
LISP: Pass variable/symbol into function without evaluating LISP: Pass variable/symbol into function without evaluating variables lisp LISP Pass var1 var2 LISP: Pass variable/symbol into function without evaluating I have a function and 2 variables that look something like: My issue is that I want Lisp to compare the v...
[ 0.019287109375, 0.0107421875, 0.0028076171875, 0.001495361328125, -0.0230712890625, 0.0115966796875, 0.00482177734375, 0.0015106201171875, 0.0025787353515625, 0.005828857421875, 0.0224609375, 0.0240478515625, 0.007171630859375, 0.018798828125, -0.005523681640625, 0.0169677734375, -0....
[ 16970, 9434, 12, 28872, 77336, 176726, 3934, 32354, 15490, 151575, 64, 400, 7008, 285, 418, 304, 214, 136, 116, 6713, 1884, 31089, 3444, 1261, 47, 69101, 3076, 78787, 218500, 36917, 2806, 13, 563, 7842, 9127, 6637, 62, 711, 1369, 335, 2...
[ 0.189697265625, 0.244873046875, 0.041168212890625, 0.1708984375, 0.252685546875, 0.228515625, 0.1212158203125, 0.1864013671875, 0.1256103515625, 0.18994140625, 0.00469970703125, 0.15771484375, 0.22900390625, 0.147216796875, 0.060089111328125, 0.135986328125, 0.0020751953125, 0.0212...
embed
49356163_c0
49356163
lisp
0
Title: Null char returning from reading a file in Common Lisp Problem title: Null char returning from reading a file in Common Lisp Tags: unicode-string, common-lisp, file-io, lisp Problem: Null char returning from reading a file in Common Lisp I’m reading files and storing them as a string using this function: (defun ...
Null char returning from reading a file in Common Lisp Null char returning from reading a file in Common Lisp unicode-string common-lisp file-io lisp reading Common Lisp utf-8 CL-USER Null char returning from reading a file in Common Lisp I’m reading files and storing them as a string using this function: If the file h...
[ 0.021484375, 0.0028076171875, 0.00799560546875, 0.0045166015625, -0.0146484375, 0.005645751953125, 0.017578125, -0.0005950927734375, -0.01458740234375, 0.0018768310546875, 0.00665283203125, -0.013671875, -0.0234375, 0.005035400390625, 0.00994873046875, -0.0128173828125, 0.00421142578...
[ 1429, 1181, 21441, 30646, 1295, 16454, 11435, 151301, 1261, 7008, 23, 60347, 112, 91693, 39210, 4086, 254, 846, 400, 486, 420, 17376, 46323, 1062, 50184, 102158, 3082, 237, 79315, 32354, 4734, 125429, 10001, 124850, 2046, 10941, 84751, 2174, ...
[ 0.21435546875, 0.121826171875, 0.2137451171875, 0.1954345703125, 0.0396728515625, 0.1849365234375, 0.171630859375, 0.1722412109375, 0.1522216796875, 0.166259765625, 0.034393310546875, 0.1192626953125, 0.0926513671875, 0.127685546875, 0.121826171875, 0.10107421875, 0.12841796875, 0....
embed
43382503_c0
43382503
lisp
0
Title: convert strings in list to numbers in racket? Problem title: convert strings in list to numbers in racket? Tags: lisp, racket Problem: convert strings in list to numbers in racket? Calling all racket developers, I am a newbie to racket language and function languages in general. Long story short, I have a nested...
convert strings in list to numbers in racket? convert strings in list to numbers in racket? lisp racket BST convert strings in list to numbers in racket? Calling all racket developers, I am a newbie to racket language and function languages in general. Long story short, I have a nested list that contains numbers and st...
[ -0.0054931640625, 0.006561279296875, 0.00347900390625, -0.00518798828125, 0.0137939453125, 0.033447265625, -0.00634765625, -0.007537841796875, 0.00958251953125, 0.01239013671875, -0.0157470703125, -0.03955078125, 0.01318359375, 0.0059814453125, 0.004547119140625, -0.0106201171875, 0....
[ 96760, 79315, 7, 23, 5303, 47, 101935, 673, 27853, 400, 7008, 8545, 756, 106001, 9014, 46876, 32354, 16610, 8512, 71, 70541, 136, 3444, 80854, 1884, 138, 363, 106, 190, 758, 117176, 116, 76104, 5701, 115700, 54397, 18499, 56329, 42, 18264...
[ 0.1644287109375, 0.25927734375, 0.092529296875, 0.08453369140625, 0.21923828125, 0.122802734375, 0.2269287109375, 0.1060791015625, 0.22412109375, 0.043975830078125, 0.1258544921875, 0.11083984375, 0.000457763671875, 0.097900390625, 0.0672607421875, 0.08489990234375, 0.09735107421875,...
embed
69760909_c0
69760909
lisp
0
Title: Shuffling multi-dimensional array in Common LISP Problem title: Shuffling multi-dimensional array in Common LISP Tags: shuffle, lisp, common-lisp, arrays Problem: Shuffling multi-dimensional array in Common LISP I am trying to shuffle an (81 2 2) array, called patterns, in LISP. I used this code below, it compil...
Shuffling multi-dimensional array in Common LISP Shuffling multi-dimensional array in Common LISP shuffle lisp common-lisp arrays Shuffling Common LISP Shuffling multi-dimensional array in Common LISP I am trying to shuffle an (81 2 2) array, called patterns, in LISP. I used this code below, it compiles fine but when I...
[ 0.00274658203125, 0.0279541015625, -0.0037689208984375, 0.00148773193359375, -0.0201416015625, -0.0078125, -0.0174560546875, 0.0035400390625, 0.004669189453125, -0.005584716796875, 0.00909423828125, 0.0255126953125, 0.005401611328125, -0.001983642578125, -0.006561279296875, -0.00131988...
[ 13684, 4902, 2069, 6024, 157955, 10298, 53, 23, 151301, 16970, 9434, 170052, 400, 7008, 39210, 4086, 254, 31577, 13556, 116, 4958, 103510, 18151, 35064, 9969, 1340, 5885, 87, 9790, 11675, 903, 18499, 100308, 14755, 22479, 83, 51, 69723, 166...
[ 0.122802734375, 0.2000732421875, 0.059906005859375, 0.1099853515625, 0.1646728515625, 0.152099609375, 0.123779296875, 0.0199432373046875, 0.13818359375, 0.131103515625, 0.2137451171875, 0.25, 0.12158203125, 0.173583984375, 0.1263427734375, 0.12744140625, 0.16357421875, 0.0639648437...
embed
39438755_c0
39438755
lisp
0
Title: Learning LISP - Defining a stdev function Problem title: Learning LISP - Defining a stdev function Tags: lisp, common-lisp Problem: Learning LISP - Defining a stdev function I am very new to LISP (so forgive me for any dumb mistakes) and the first lab of the year states: Define a function, STDEV that will comput...
Learning LISP - Defining a stdev function Learning LISP - Defining a stdev function lisp common-lisp Learning LISP Defining STDEV Learning LISP - Defining a stdev function I am very new to LISP (so forgive me for any dumb mistakes) and the first lab of the year states: I wrote this code but I don't know why it refuses ...
[ -0.0040283203125, 0.004364013671875, 0.00311279296875, 0.0022430419921875, 0.0030517578125, 0.004547119140625, -0.0184326171875, 0.00677490234375, 0.001434326171875, -0.013671875, -0.0002689361572265625, -0.00616455078125, -0.00677490234375, 0.001373291015625, -0.0206298828125, 0.02221...
[ 114344, 16970, 9434, 88606, 6138, 18548, 32354, 400, 7008, 39210, 4086, 254, 16992, 170623, 4552, 3525, 96259, 6492, 121742, 5117, 60054, 6602, 117249, 54397, 903, 18151, 3714, 15400, 128120, 47, 4488, 98, 11675, 6032, 27489, 18499, 18822, 26...
[ 0.12158203125, 0.08526611328125, 0.1744384765625, 0.1611328125, 0.154296875, 0.264404296875, 0.1822509765625, 0.074951171875, 0.1248779296875, 0.07293701171875, 0.041412353515625, 0.09893798828125, 0.1226806640625, 0.2462158203125, 0.0254364013671875, 0.05426025390625, 0.025100708007...
embed
26858520_c0
26858520
lisp
0
Title: code throws me an error: Space is an illegal character after a colon. Problem title: code throws me an error: Space is an illegal character after a colon. Tags: lisp Problem: code throws me an error: Space is an illegal character after a colon. sort code, which is basically a translation i made from this one: in...
code throws me an error: Space is an illegal character after a colon. code throws me an error: Space is an illegal character after a colon. lisp 2 Space i-1 j-1 code throws me an error: Space is an illegal character after a colon. sort code, which is basically a translation i made from this one: and my translation to l...
[ -0.021240234375, 0.000576019287109375, -0.00164794921875, 0.0135498046875, -0.0107421875, -0.0035552978515625, -0.011962890625, -0.023193359375, -0.005523681640625, -0.007720947265625, 0.0159912109375, 0.008056640625, -0.00958251953125, -0.0284423828125, -0.0120849609375, 0.00378417968...
[ 18151, 104250, 163, 18499, 43045, 83, 85325, 62816, 7103, 46512, 142, 400, 7008, 116, 17, 5759, 1647, 12096, 153648, 26008, 212059, 12960, 16454, 468, 41872, 141012, 28219, 121742 ]
[ 0.17041015625, 0.095947265625, 0.0198974609375, 0.1397705078125, 0.26513671875, 0.0726318359375, 0.1907958984375, 0.1671142578125, 0.10546875, 0.207763671875, 0.0230865478515625, 0.05767822265625, 0.1593017578125, 0.09130859375, 0.012725830078125, 0.0755615234375, 0.06378173828125, ...
embed
10720905_c0
10720905
lisp
0
Title: elisp variable define. What's the function of slash in variable name like "defvar bh/organization-task-id" Problem title: elisp variable define. What's the function of slash in variable name like "defvar bh/organization-task-id" Tags: org-mode, lisp, emacs Problem: elisp variable de...
elisp variable define. What's the function of slash in variable name like "defvar bh/organization-task-id" elisp variable define. What's the function of slash in variable name like "defvar bh/organization-task-id" org-mode lisp emacs What eb155a82-92b2-4f25-a3c6-0304591af2f9 elisp variable...
[ 0.0206298828125, -0.00921630859375, -0.0026702880859375, -0.01507568359375, -0.0059814453125, 0.0087890625, -0.03271484375, 0.0125732421875, -0.003936767578125, -0.00193023681640625, -0.00604248046875, 0.0113525390625, -0.0120849609375, -0.0030670166015625, -0.0030975341796875, -0.0087...
[ 15296, 7008, 77336, 61924, 4865, 3768, 32354, 111, 91, 5544, 23, 9351, 112, 420, 1961, 14225, 53404, 1073, 92, 532, 30910, 61170, 400, 352, 2263, 119477, 12012, 12231, 2588, 12183, 1126, 35064, 1295, 96101, 36024, 43435, 14804, 16505, 360, ...
[ 0.121337890625, 0.23291015625, 0.281494140625, 0.1993408203125, 0.02886962890625, 0.03399658203125, 0.20068359375, 0.05401611328125, 0.08544921875, 0.2413330078125, 0.0384521484375, 0.135498046875, 0.06317138671875, 0.09698486328125, 0.19970703125, 0.1776123046875, 0.1617431640625, ...
embed
35122533_c0
35122533
lisp
0
Title: Truncating a list in (constrained) Racket Problem title: Truncating a list in (constrained) Racket Tags: scheme, racket, lisp Problem: Truncating a list in (constrained) Racket My question is really one of logic more than anything, the task is to truncate a list to a given length in racket. That is, given a list...
Truncating a list in (constrained) Racket Truncating a list in (constrained) Racket scheme racket lisp Truncating Racket Truncating a list in (constrained) Racket My question is really one of logic more than anything, the task is to truncate a list to a given length in racket. That is, given a list (A B C), and a given...
[ 0.00049591064453125, 0.0235595703125, 0.0123291015625, 0.01251220703125, 0.007171630859375, -0.01129150390625, -0.0189208984375, 0.004180908203125, -0.00360107421875, -0.0135498046875, -0.020751953125, -0.017333984375, -0.01055908203125, 0.00518798828125, 0.0184326171875, -0.0012283325...
[ 19419, 16336, 1916, 5303, 23, 2271, 9297, 122009, 2552, 27853, 150370, 673, 400, 7008, 9655, 6183, 62775, 66211, 14617, 19, 33478, 47, 34475, 140909, 335, 313, 116, 3444, 3525, 111, 158, 2816, 4288, 173072, 19882, 32354, 35064, 143033, 1733...
[ 0.1473388671875, 0.150390625, 0.0162506103515625, 0.2293701171875, 0.0634765625, 0.039154052734375, 0.120361328125, 0.10064697265625, 0.11328125, 0.2044677734375, 0.13232421875, 0.095703125, 0.04205322265625, 0.0885009765625, 0.0269622802734375, 0.00286865234375, 0.09027099609375, ...
embed
279696_c0
279696
lisp
0
Title: Beginner at Common Lisp: Macro Question For Defining Packages on the Fly Problem title: Beginner at Common Lisp: Macro Question For Defining Packages on the Fly Tags: common-lisp, lisp, macros Problem: Beginner at Common Lisp: Macro Question For Defining Packages on the Fly Still struggling to understand what be...
Beginner at Common Lisp: Macro Question For Defining Packages on the Fly Beginner at Common Lisp: Macro Question For Defining Packages on the Fly common-lisp lisp macros Beginner Common Lisp Macro Question Defining Packages Fly KEYWORD Beginner at Common Lisp: Macro Question For Defining Packages on the Fly Still strug...
[ 0.017822265625, -0.0026092529296875, 0.0218505859375, 0.001800537109375, -0.0019378662109375, 0.020263671875, 0.005035400390625, 0.0079345703125, -0.01025390625, 0.00726318359375, -0.005462646484375, -0.022705078125, 0.003814697265625, -0.0194091796875, -0.004913330078125, 0.0003662109...
[ 67053, 56, 99, 151301, 1261, 7008, 4727, 516, 68185, 1326, 88606, 449, 56607, 52467, 98, 70, 25066, 39210, 4086, 254, 400, 111789, 186104, 237875, 28219, 2965, 41361, 81887, 33022, 61924, 98169, 12403, 43240, 5885, 4734, 125195, 35782, 76367,...
[ 0.12158203125, 0.06951904296875, 0.0714111328125, 0.125244140625, 0.1298828125, 0.1409912109375, 0.0946044921875, 0.128173828125, 0.19384765625, 0.03387451171875, 0.17919921875, 0.030792236328125, 0.2308349609375, 0.0806884765625, 0.083740234375, 0.02691650390625, 0.1844482421875, ...
embed
28172357_c0
28172357
lisp
0
Title: Run an ABCL code that uses cl-cppre Problem title: Run an ABCL code that uses cl-cppre Tags: abcl, cl-ppcre, common-lisp, java, lisp Problem: Run an ABCL code that uses cl-cppre With reference to my previous question, Executing a lisp function from Java I was able to call lisp code from Java using ABCL. But the ...
Run an ABCL code that uses cl-cppre Run an ABCL code that uses cl-cppre abcl cl-ppcre common-lisp java lisp Run ABCL interpreter.eval asdf.lisp aima.asd defpackage.lisp aima.lisp Error Users Administrator.NUIG-1Z7HN12 edit-nets.lisp THREAD Debugger READER-ERROR CL-PPCRE AIMA Run an ABCL code that uses cl-cppre With ref...
[ 0.0004425048828125, -0.006805419921875, 0.007568359375, 0.03515625, -0.0201416015625, 0.0184326171875, 0.036865234375, 0.007537841796875, 0.0159912109375, -0.035888671875, -0.007080078125, 0.0262451171875, -0.0037689208984375, -0.0152587890625, 0.0157470703125, -0.0247802734375, 0.00...
[ 28398, 47457, 866, 18151, 450, 4527, 33139, 9, 121422, 4692, 1563, 34937, 6366, 7612, 39210, 4086, 254, 79, 330, 400, 7008, 29481, 56, 1405, 420, 10, 1352, 162, 71, 8, 29102, 5, 212059, 53400, 107185, 33261, 31343, 5759, 1511, 966, 7905...
[ 0.1337890625, 0.1629638671875, 0.1903076171875, 0.2069091796875, 0.019927978515625, 0.10247802734375, 0.1259765625, 0.067626953125, 0.1014404296875, 0.2308349609375, 0.04638671875, 0.1488037109375, 0.1298828125, 0.1937255859375, 0.084228515625, 0.10284423828125, 0.1629638671875, 0....
embed
16633436_c0
16633436
lisp
0
Title: Emacs Lisp map over a list of function names and call them all with the same arg Problem title: Emacs Lisp map over a list of function names and call them all with the same arg Tags: lisp, elisp Problem: Emacs Lisp map over a list of function names and call them all with the same arg I'm having trouble understan...
Emacs Lisp map over a list of function names and call them all with the same arg Emacs Lisp map over a list of function names and call them all with the same arg lisp elisp Emacs Lisp utf-8 Emacs Lisp map over a list of function names and call them all with the same arg I'm having trouble understanding the approach I n...
[ 0.005950927734375, -0.0037384033203125, 0.00872802734375, -0.00506591796875, -0.035888671875, 0.00189971923828125, -0.0025482177734375, 0.006866455078125, 0.0035552978515625, 0.002471923828125, -0.00101470947265625, -0.007293701171875, -0.005523681640625, 0.03759765625, -0.0218505859375,...
[ 85269, 4439, 1261, 7008, 22288, 645, 5303, 32354, 123055, 11782, 756, 678, 5701, 79459, 400, 15296, 420, 17376, 63134, 100094, 51515, 42822, 23, 23253, 17311, 10750, 41591, 4488, 143834, 28, 1405, 6275, 65183, 36846, 80934, 83, 2292, 71, 14...
[ 0.161376953125, 0.1566162109375, 0.1719970703125, 0.218994140625, 0.190673828125, 0.1773681640625, 0.1527099609375, 0.21142578125, 0.10748291015625, 0.1422119140625, 0.08856201171875, 0.0572509765625, 0.0816650390625, 0.1533203125, 0.1197509765625, 0.04107666015625, 0.031951904296875...
embed
9603512_c0
9603512
lisp
0
Title: running scheme from emacs Problem title: running scheme from emacs Tags: emacs, lisp, scheme Problem: running scheme from emacs I'm a newbie to LISP. I am attempting to invoke the scheme interpreter from within emacs (version 23 running on windows). I loaded the xscheme library by telling emacs to M-x load-libra...
running scheme from emacs running scheme from emacs emacs lisp scheme emacs M-x Output running scheme from emacs I'm a newbie to LISP. I am attempting to invoke the scheme interpreter from within emacs (version 23 running on windows). I loaded the xscheme library by telling emacs to M-x load-library and then entering x...
[ 0.00604248046875, 0.032958984375, -0.004241943359375, -0.00726318359375, -0.0179443359375, 0.01287841796875, 0.015380859375, -0.00640869140625, -0.01708984375, -0.0225830078125, 0.01007080078125, 0.004150390625, -0.00836181640625, -0.01336669921875, -0.00787353515625, -0.021484375, -...
[ 51042, 150370, 1295, 352, 2263, 7, 400, 7008, 276, 9, 425, 13538, 9014, 16970, 9434, 81887, 23253, 29481, 56, 28032, 46354, 1105, 54825, 72367, 1022, 7560, 282, 35773, 128219, 150, 2844, 105876, 7665, 123759, 11675, 75101, 11883, 4439, 7388...
[ 0.205078125, 0.25927734375, 0.1478271484375, 0.1298828125, 0.19384765625, 0.120361328125, 0.09686279296875, 0.1953125, 0.089599609375, 0.088134765625, 0.171630859375, 0.1336669921875, 0.089599609375, 0.09735107421875, 0.2049560546875, 0.07696533203125, 0.08538818359375, 0.159423828...
embed
26088861_c0
26088861
lisp
0
Title: Why does member function return nil Problem title: Why does member function return nil Tags: lisp Problem: Why does member function return nil I have a list: *DSTATES* = ( ( list1 ) ( list2 ) ( list3 ) ... ( listn ) ) And a list of state names, x = ( list ) *DSTATES* has ( (zero) (three two one) (two) (three zer...
Why does member function return nil Why does member function return nil lisp Why DSTATES list1 list2 list3 Looking Intermediate Why does member function return nil I have a list: And a list of state names, x = ( list ) *DSTATES* has ( (zero) (three two one) (two) (three zero) ) x has (two) . Here's my code: When I do (...
[ -0.0015716552734375, -0.002227783203125, 0.0267333984375, 0.000621795654296875, -0.018310546875, 0.01025390625, 0.00982666015625, -0.005706787109375, 0.007781982421875, 0.004913330078125, 0.0262451171875, 0.009765625, 0.0003070831298828125, 0.0106201171875, 0.00274658203125, -0.0098876...
[ 44084, 14602, 32786, 32354, 30646, 17324, 400, 7008, 391, 22565, 31273, 5303, 304, 363, 157268, 12333, 6, 11341, 123055, 1022, 397, 1556, 80510, 107, 6626, 1632, 55547, 45234, 18151, 864, 132, 11343, 65395, 29568, 150679, 40956, 7279, 35431, ...
[ 0.1278076171875, 0.038848876953125, 0.28662109375, 0.18701171875, 0.199951171875, 0.207763671875, 0.036773681640625, 0.126708984375, 0.025299072265625, 0.12744140625, 0.140869140625, 0.1583251953125, 0.0023193359375, 0.06689453125, 0.1173095703125, 0.096435546875, 0.0054931640625, ...
embed
13670571_c0
13670571
lisp
0
Title: Once compiled, can a program hypothetically run without ever calling eval? Problem title: Once compiled, can a program hypothetically run without ever calling eval? Tags: lisp, eval, macros, clojure Problem: Once compiled, can a program hypothetically run without ever calling eval? I'm in the process of learning...
Once compiled, can a program hypothetically run without ever calling eval? Once compiled, can a program hypothetically run without ever calling eval? lisp eval macros clojure Once Once compiled, can a program hypothetically run without ever calling eval? I'm in the process of learning how Clojure works and I'm wonderin...
[ -0.017333984375, 0.006500244140625, 0.01708984375, 0.005157470703125, -0.01300048828125, 0.01806640625, 0.0201416015625, -0.007049560546875, -0.00140380859375, -0.0301513671875, -0.015869140625, -0.00250244140625, -0.00390625, -0.013671875, -0.004730224609375, -0.005096435546875, 0.0...
[ 76556, 375, 5974, 297, 831, 1528, 170933, 18, 71407, 11675, 15490, 17669, 159029, 28, 1405, 400, 7008, 111789, 20450, 461, 107, 51053, 43240, 7722, 1261, 7, 6423, 220734, 4488, 9969, 1340, 2472, 964, 59725, 4527, 111, 121392, 8010, 4453, ...
[ 0.09814453125, 0.087158203125, 0.20654296875, 0.04876708984375, 0.093994140625, 0.1927490234375, 0.2052001953125, 0.111083984375, 0.054962158203125, 0.1326904296875, 0.1282958984375, 0.11669921875, 0.1539306640625, 0.1051025390625, 0.2734375, 0.0576171875, 0.1385498046875, 0.162109...
embed
58598863_c0
58598863
lisp
0
Title: Lisp recursive function to check for value in list not working Problem title: Lisp recursive function to check for value in list not working Tags: primitive, recursion, lisp Problem: Lisp recursive function to check for value in list not working I am working on a recursive function that takes a list and a value ...
Lisp recursive function to check for value in list not working Lisp recursive function to check for value in list not working primitive recursion lisp Lisp Lisp recursive function to check for value in list not working I am working on a recursive function that takes a list and a value ex: 'b '(a. b), and returns nil if...
[ -0.0206298828125, 0.03271484375, 0.00897216796875, 0.0169677734375, 0.0009307861328125, 0.0179443359375, -0.000125885009765625, -0.011474609375, -0.0023040771484375, 0.010986328125, 0.007537841796875, 0.0174560546875, -0.0030364990234375, -0.01495361328125, 0.0206298828125, 0.021728515...
[ 1261, 7008, 195625, 5844, 32354, 47, 12765, 100, 34292, 23, 5303, 959, 20697, 128489, 400, 51776, 275, 11, 876, 30646, 17324, 2174, 14037, 808, 31089, 13315, 2271, 71, 864, 62, 3284, 339, 175199, 35431, 3853, 7103, 60494, 5928, 49128, 435...
[ 0.150634765625, 0.19970703125, 0.2108154296875, 0.107666015625, 0.1820068359375, 0.0052490234375, 0.221923828125, 0.124755859375, 0.2181396484375, 0.094482421875, 0.204833984375, 0.10791015625, 0.198486328125, 0.1357421875, 0.0958251953125, 0.01385498046875, 0.05035400390625, 0.002...
embed
8296191_c0
8296191
lisp
0
Title: Serving dynamic webpages using Hunchentoot/html-template/Lisp Problem title: Serving dynamic webpages using Hunchentoot/html-template/Lisp Tags: hunchentoot, web-applications, lisp Problem: Serving dynamic webpages using Hunchentoot/html-template/Lisp The following code using Hunchentoot and html-template was al...
Serving dynamic webpages using Hunchentoot/html-template/Lisp Serving dynamic webpages using Hunchentoot/html-template/Lisp hunchentoot web-applications lisp Hunchentoot/html-template/Lisp Serving Hunchentoot Lisp ELEPHUND INTERFACE sign-up.tmpl Serving dynamic webpages using Hunchentoot/html-template/Lisp The followin...
[ 0.0177001953125, 0.005859375, 0.0034942626953125, -0.021240234375, -0.014404296875, 0.01220703125, -0.00579833984375, 0.003936767578125, 0.000059604644775390625, -0.06494140625, -0.0185546875, -0.05419921875, 0.00830078125, -0.0263671875, 0.037109375, -0.015380859375, 0.0003108978271...
[ 68546, 84079, 1467, 22469, 17368, 10453, 4834, 188, 818, 7693, 2982, 92558, 9506, 7008, 1926, 101687, 400, 1261, 27587, 34384, 59692, 919, 24092, 2037, 25632, 18151, 136, 190358, 21265, 116086, 42850, 11389, 42459, 74955, 44691, 35064, 41591, ...
[ 0.1517333984375, 0.221923828125, 0.0682373046875, 0.17333984375, 0.0712890625, 0.1341552734375, 0.141357421875, 0.1312255859375, 0.1754150390625, 0.1392822265625, 0.1204833984375, 0.137451171875, 0.096923828125, 0.14453125, 0.078369140625, 0.0697021484375, 0.05267333984375, 0.08795...
embed
40085801_c0
40085801
lisp
0
Title: procedures vs. built-in data Problem title: procedures vs. built-in data Tags: sicp, scheme, lisp Problem: procedures vs. built-in data I'm trying to understand the view that procedures and data are virtually the same in lisp. SICP says that: the values of numerals are the numbers that they name, the values of b...
procedures vs. built-in data procedures vs. built-in data sicp scheme lisp procedures vs. built-in data I'm trying to understand the view that procedures and data are virtually the same in lisp. SICP says that: the values of numerals are the numbers that they name, the values of built-in operators are the machine instr...
[ -0.005157470703125, 0.0013580322265625, 0.003173828125, 0.02197265625, 0.01055908203125, 0.0380859375, -0.01300048828125, 0.004180908203125, 0.00830078125, -0.03857421875, -0.007049560546875, -0.002044677734375, -0.01104736328125, -0.03173828125, 0.019775390625, -0.0029296875, 0.0126...
[ 50491, 7, 20209, 88303, 9, 73, 2053, 26536, 254, 150370, 400, 7008, 28219, 21455, 136, 20513, 5701, 159, 198993, 70, 142424, 111, 22542, 16765, 621, 101935, 9351, 39933, 36279, 188336, 40, 26513, 85358, 42518, 41018, 123055, 36746, 137272, ...
[ 0.271484375, 0.015289306640625, 0.1781005859375, 0.1795654296875, 0.010406494140625, 0.1434326171875, 0.1873779296875, 0.113037109375, 0.173095703125, 0.15087890625, 0.134033203125, 0.209228515625, 0.040985107421875, 0.0252685546875, 0.013275146484375, 0.0535888671875, 0.098205566406...
embed
17854261_c0
17854261
lisp
0
Title: lib names inside prefix lists must not contain periods Problem title: lib names inside prefix lists must not contain periods Tags: read-eval-print-loop, clojure, lisp Problem: lib names inside prefix lists must not contain periods I am learning clojure now, I wrote a file like this: ;; File ./mycode/myvoc.clj (n...
lib names inside prefix lists must not contain periods lib names inside prefix lists must not contain periods read-eval-print-loop clojure lisp java.lang.Exception read-eval-print-loop File myvoc.clj mycode.myvoc clojure.java.io java.io.File oc.clj:1 lib names inside prefix lists must not contain periods I am learning ...
[ -0.003753662109375, -0.0003814697265625, -0.006744384765625, 0.01806640625, -0.00823974609375, -0.0224609375, 0.006805419921875, 0.004486083984375, -0.0206298828125, -0.0224609375, 0.0027313232421875, -0.00396728515625, 0.0244140625, -0.0274658203125, 0.003082275390625, -0.026000976562...
[ 25474, 123055, 46132, 183114, 5303, 8110, 959, 70541, 14922, 12301, 13, 1405, 35662, 28354, 20450, 461, 107, 400, 7008, 79, 330, 3066, 63928, 42724, 759, 38965, 238, 21178, 40899, 1176, 24071, 846, 174350, 44043, 19721, 52080, 11435, 157176, ...
[ 0.191650390625, 0.146484375, 0.1195068359375, 0.2685546875, 0.18505859375, 0.069091796875, 0.10211181640625, 0.1246337890625, 0.25732421875, 0.123779296875, 0.02667236328125, 0.2071533203125, 0.1253662109375, 0.150390625, 0.1241455078125, 0.152587890625, 0.074462890625, 0.049896240...
embed
68206447_c0
68206447
lisp
0
Title: How can conditions be handled in GCL? Problem title: How can conditions be handled in GCL? Tags: ansi-common-lisp, condition-system, common-lisp, gnu-common-lisp, lisp Problem: How can conditions be handled in GCL? handler-case is key to handling conditions in Common Lisp, but GCL 2.6.12 on Ubuntu 18.04 consider...
How can conditions be handled in GCL? How can conditions be handled in GCL? ansi-common-lisp condition-system common-lisp gnu-common-lisp lisp How GCL Error UNDEFINED-FUNCTION NAME HANDLER-CASE Fast si::use-fast-links Signalled EVAL Broken Type Help How can conditions be handled in GCL? handler-case is key to handling ...
[ -0.004364013671875, 0.02294921875, -0.005950927734375, -0.0130615234375, -0.0023345947265625, -0.00732421875, 0.0074462890625, -0.01458740234375, -0.01055908203125, -0.0299072265625, 0.01373291015625, -0.01904296875, 0.010009765625, -0.001556396484375, 0.019775390625, 0.001251220703125...
[ 11249, 831, 27289, 34831, 71, 23, 527, 37486, 172, 277, 3796, 4086, 254, 35431, 16751, 39210, 104155, 400, 7008, 212059, 211210, 129525, 919, 175560, 182512, 116199, 20345, 441, 76783, 25290, 78, 39473, 10187, 144000, 61152, 13177, 1098, 6045...
[ 0.043365478515625, 0.05859375, 0.271240234375, 0.1954345703125, 0.069580078125, 0.07061767578125, 0.1234130859375, 0.255859375, 0.0745849609375, 0.04058837890625, 0.111328125, 0.10888671875, 0.1478271484375, 0.20166015625, 0.093017578125, 0.1092529296875, 0.111572265625, 0.08764648...
embed
4169566_c1
4169566
lisp
1
call)... I guess some kind of binding from let. (defun counter (possibleValues) (let ((var '(0 0 0 0 0 0 0 0 0 0))) (loop for i from 0 to (list-length possibleValues) do (loop for j in (cdr (nth i possibleValues)) do (loop for k in j do (incf (nth k var))))) var)) So I can run my list through the function and get some...
call)... I guess some kind of binding from let. (defun counter (possibleValues) (let ((var '(0 0 0 0 0 0 0 0 0 0))) (loop for i from 0 to (list-length possibleValues) do (loop for j in (cdr (nth i possibleValues)) do (loop for k in j do (incf (nth k var))))) var)) So I can run my list through the function and get some...
[ 0.0140380859375, 0.0155029296875, -0.0169677734375, 0.01123046875, -0.0004863739013671875, 0.0218505859375, -0.002166748046875, 0.0115966796875, 0.0086669921875, -0.0185546875, -0.0146484375, 0.0014495849609375, 0.016357421875, 0.02783203125, 0.016357421875, -0.00079345703125, -0.010...
[ 11782, 27, 57767, 128239, 1295, 2633, 5, 112, 16498, 105416, 7522, 55356, 42272, 21049, 1974, 1961, 2389, 757, 28354, 17, 47, 6562, 7722, 54, 1647, 7569, 927, 472, 23, 67466, 285, 11675, 5303, 8305, 32354, 2046, 22085, 382, 305, 138, 11...
[ 0.2371826171875, 0.0401611328125, 0.060211181640625, 0.2421875, 0.037109375, 0.2283935546875, 0.008636474609375, 0.08349609375, 0.16259765625, 0.2098388671875, 0.0963134765625, 0.1318359375, 0.1304931640625, 0.0850830078125, 0.2125244140625, 0.183349609375, 0.051239013671875, 0.117...
embed
58081417_c0
58081417
lisp
0
Title: Function outputs a list but returns nil Problem title: Function outputs a list but returns nil Tags: common-lisp, lisp, output, return, variable-assignment Problem: Function outputs a list but returns nil I call a function, which outputs a list, I want to use afterwards. I try to bind the function's output to a ...
Function outputs a list but returns nil Function outputs a list but returns nil common-lisp lisp output return variable-assignment NIL get_output Function outputs a list but returns nil I call a function, which outputs a list, I want to use afterwards. I try to bind the function's output to a variable, but instead of t...
[ 0.00274658203125, 0.0126953125, -0.0020904541015625, -0.01373291015625, 0.00714111328125, 0.01239013671875, 0.01336669921875, -0.005218505859375, 0.018310546875, -0.02294921875, 0.01251220703125, 0.00897216796875, 0.0108642578125, -0.01458740234375, -0.003662109375, 0.010009765625, -...
[ 28670, 10763, 140992, 5303, 1284, 30646, 17324, 39210, 4086, 254, 400, 7008, 77336, 31304, 541, 16444, 2046, 6056, 7077, 7, 11782, 32354, 4527, 19364, 9790, 68557, 47, 64457, 95486, 2256, 81, 161789, 12765, 160463, 864, 927, 39, 13, 1405, ...
[ 0.13427734375, 0.078857421875, 0.2078857421875, 0.2083740234375, 0.10504150390625, 0.1771240234375, 0.200927734375, 0.08447265625, 0.05548095703125, 0.1270751953125, 0.05804443359375, 0.164306640625, 0.189453125, 0.1495361328125, 0.1019287109375, 0.1815185546875, 0.0748291015625, 0...
embed
72470575_c0
72470575
lisp
0
Title: In Lisp, can you construct a `check-type` that throws an error if the value is not a hash-table with all integer keys and values? Problem title: In Lisp, can you construct a `check-type` that throws an error if the value is not a hash-table with all integer keys and values? Tags: common-lisp, lisp Problem: In Li...
In Lisp, can you construct a `check-type` that throws an error if the value is not a hash-table with all integer keys and values? In Lisp, can you construct a `check-type` that throws an error if the value is not a hash-table with all integer keys and values? common-lisp lisp Lisp In Lisp, can you construct a `check-ty...
[ -0.0166015625, 0.006988525390625, -0.0113525390625, -0.003570556640625, -0.0186767578125, 0.010986328125, -0.01611328125, -0.003753662109375, -0.0040283203125, -0.01220703125, -0.00799560546875, 0.00933837890625, 0.01409912109375, -0.010009765625, 0.01177978515625, 0.00982666015625, ...
[ 1261, 7008, 831, 64549, 78292, 9, 50986, 104250, 18499, 2174, 34292, 83, 959, 1556, 127, 22819, 892, 1505, 22799, 142424, 756, 39210, 4086, 254, 400, 678, 136, 32354, 3444, 63284, 19713, 115081, 621, 26255, 17368, 119140, 5303, 3917, 12765,...
[ 0.137939453125, 0.21923828125, 0.078369140625, 0.16455078125, 0.2283935546875, 0.059844970703125, 0.260009765625, 0.142822265625, 0.194580078125, 0.09466552734375, 0.14892578125, 0.06768798828125, 0.1417236328125, 0.10308837890625, 0.05145263671875, 0.176025390625, 0.1158447265625, ...
embed
16453497_c0
16453497
lisp
0
Title: Converting an s expression to a list in Scheme Problem title: Converting an s expression to a list in Scheme Tags: lisp, scheme, racket Problem: Converting an s expression to a list in Scheme If I have an s expression, for example '(1 2 (3) (4 (5)) 6 7), how would I convert that into a list like (1 2 3 4 5 6 7)?...
Converting an s expression to a list in Scheme Converting an s expression to a list in Scheme lisp scheme racket Converting Scheme Converting an s expression to a list in Scheme If I have an s expression, for example '(1 2 (3) (4 (5)) 6 7), how would I convert that into a list like (1 2 3 4 5 6 7)? I basically need to ...
[ -0.00775146484375, 0.0299072265625, -0.00469970703125, 0.01153564453125, 0.00238037109375, 0.00872802734375, -0.024658203125, 0.0011444091796875, -0.00183868408203125, -0.04052734375, 0.005279541015625, -0.01263427734375, -0.0157470703125, 0.007232666015625, 0.01080322265625, 0.0100097...
[ 1657, 814, 1916, 142, 91, 125195, 47, 10, 5303, 23, 34702, 282, 400, 7008, 150370, 673, 27853, 765, 242, 41600, 116, 2788, 9451, 5211, 305, 49413, 3642, 2806, 96760, 450, 3934, 1884, 2858, 138, 201, 190, 198343, 3871, 125663, 756, 111, ...
[ 0.0447998046875, 0.15380859375, 0.0250244140625, 0.039215087890625, 0.1724853515625, 0.280517578125, 0.0970458984375, 0.0782470703125, 0.26171875, 0.0765380859375, 0.216796875, 0.1656494140625, 0.062744140625, 0.1510009765625, 0.2066650390625, 0.052093505859375, 0.1846923828125, 0....
embed
38290078_c0
38290078
lisp
0
Title: case and quotation in scheme & racket Problem title: case and quotation in scheme & racket Tags: lisp, racket, scheme Problem: case and quotation in scheme & racket I was a bit surprised by this racket code printing nay when I expected yeah : (define five 5) (case 5 [(five) "yeah"] [else "nay"]) Looking ...
case and quotation in scheme & racket case and quotation in scheme & racket lisp racket scheme case and quotation in scheme & racket I was a bit surprised by this racket code printing nay when I expected yeah : Looking at the racket documentation for case makes it clearer: So it's about quotation. I'm pretty su...
[ -0.010009765625, 0.0208740234375, -0.00640869140625, 0.0023193359375, -0.0091552734375, -0.00958251953125, 0.01220703125, 0.020263671875, 0.006072998046875, -0.005523681640625, 0.005645751953125, -0.005889892578125, -0.01190185546875, -0.0172119140625, -0.00153350830078125, 0.012939453...
[ 7225, 136, 81732, 1363, 23, 150370, 619, 25133, 673, 27853, 400, 7008, 144285, 18151, 2448, 7630, 84751, 152725, 209806, 34735, 1672, 27689, 7, 6423, 831, 22113, 163, 28219, 38496, 111789, 48963, 167201, 87, 55681, 15400, 442, 98893, 111, 1...
[ 0.267333984375, 0.09283447265625, 0.2283935546875, 0.1407470703125, 0.06494140625, 0.185302734375, 0.06622314453125, 0.0650634765625, 0.0987548828125, 0.1712646484375, 0.109375, 0.135498046875, 0.0225067138671875, 0.176025390625, 0.08148193359375, 0.072021484375, 0.02069091796875, ...
embed
3022488_c0
3022488
lisp
0
Title: Why does using cons to create a pair of two lists produce a list and two elements? Problem title: Why does using cons to create a pair of two lists produce a list and two elements? Tags: scheme, racket, lisp Problem: Why does using cons to create a pair of two lists produce a list and two elements? I've started ...
Why does using cons to create a pair of two lists produce a list and two elements? Why does using cons to create a pair of two lists produce a list and two elements? scheme racket lisp cons Why Why does using cons to create a pair of two lists produce a list and two elements? I've started learning Scheme, for fun mostl...
[ 0.002685546875, 0.025634765625, -0.0014190673828125, 0.015380859375, 0.000652313232421875, 0.0279541015625, -0.0185546875, -0.00634765625, -0.004547119140625, -0.036376953125, 0.0130615234375, -0.03173828125, 0.0054931640625, 0.00384521484375, -0.01434326171875, -0.007293701171875, 0...
[ 44084, 17368, 158, 7, 28282, 80836, 6626, 5303, 27489, 136, 80854, 150370, 673, 27853, 400, 7008, 111, 52080, 34702, 282, 7477, 123309, 46876, 19667, 12301, 198993, 2258, 42, 27781, 678, 16750, 4958, 138, 13956, 10422, 41206, 7228, 1810, 68...
[ 0.118408203125, 0.1011962890625, 0.218994140625, 0.1514892578125, 0.1341552734375, 0.1700439453125, 0.1319580078125, 0.220947265625, 0.15771484375, 0.10205078125, 0.1556396484375, 0.17333984375, 0.051788330078125, 0.166748046875, 0.051666259765625, 0.135009765625, 0.0592041015625, ...
embed
41136717_c1
41136717
lisp
1
)) (require math/array) (define-syntax (my-array stx) (syntax-case stx () [(_ id) (let ([arr (build-array #(20 20) (lambda (ind) (let ([x (vector-ref ind 1)] [y (vector-ref ind 0)]) (list 'some-symbol x y (* x y)))))]) (with-syntax ([syn-arr (eval (read (open-input-string (string-append "#'" (format "~v" arr)))))]) #'(...
)) (require math/array) (define-syntax (my-array stx) (syntax-case stx () [(_ id) (let ([arr (build-array #(20 20) (lambda (ind) (let ([x (vector-ref ind 1)] [y (vector-ref ind 0)]) (list 'some-symbol x y (* x y)))))]) (with-syntax ([syn-arr (eval (read (open-input-string (string-append "#'" (format "~v" arr)))))]) #'(...
[ -0.007110595703125, 0.00469970703125, -0.0093994140625, 0.0021514892578125, -0.0002460479736328125, 0.013671875, 0.0010833740234375, 0.006683349609375, -0.005859375, -0.0172119140625, -0.00384521484375, 0.003997802734375, -0.0050048828125, -0.03662109375, 0.011474609375, -0.01635742187...
[ 78960, 3181, 48909, 64, 19305, 53, 112, 64552, 12654, 86531, 1176, 6138, 425, 58437, 3447, 1974, 147, 42, 177149, 468, 1549, 387, 6492, 85, 7250, 272, 18770, 29087, 2752, 4879, 757, 6562, 43452, 176726, 1022, 113, 80126, 76228, 1405, 3911...
[ 0.1221923828125, 0.10791015625, 0.1434326171875, 0.041290283203125, 0.146484375, 0.155029296875, 0.0289306640625, 0.13720703125, 0.156982421875, 0.2259521484375, 0.08837890625, 0.12353515625, 0.1640625, 0.0677490234375, 0.1131591796875, 0.05303955078125, 0.13037109375, 0.1488037109...
embed
72221010_c0
72221010
lisp
0
Title: Adding List items together while using provisional result Problem title: Adding List items together while using provisional result Tags: lisp, common-lisp Problem: Adding List items together while using provisional result I have the following list: ((a b) (c d) (e f)) and want to loop through it and combine the ...
Adding List items together while using provisional result Adding List items together while using provisional result lisp common-lisp provisional Adding List Adding List items together while using provisional result I have the following list: and want to loop through it and combine the list elements together. I also hav...
[ 0.00531005859375, 0.0230712890625, -0.002105712890625, 0.00823974609375, -0.0054931640625, 0.006561279296875, -0.003448486328125, 0.009765625, 0.020263671875, -0.0233154296875, 0.03076171875, 0.008056640625, 0.0074462890625, 0.0213623046875, 0.0103759765625, 0.004669189453125, 0.0239...
[ 62, 59725, 32036, 55769, 25842, 12960, 17368, 187454, 16750, 400, 7008, 39210, 4086, 254, 25632, 5303, 3444, 40956, 8305, 70163, 80854, 43240, 66161, 2967, 5117, 15190, 6626, 4527, 11737, 13, 1238, 442, 33022, 4173, 32354, 11782, 38895, 77336...
[ 0.1087646484375, 0.12158203125, 0.197265625, 0.17236328125, 0.2120361328125, 0.0682373046875, 0.1014404296875, 0.260009765625, 0.2061767578125, 0.08197021484375, 0.1727294921875, 0.09893798828125, 0.05218505859375, 0.12158203125, 0.03240966796875, 0.1622314453125, 0.07745361328125, ...
embed
26737008_c0
26737008
lisp
0
Title: once-only lisp macro, yet another implementation Problem title: once-only lisp macro, yet another implementation Tags: practical-common-lisp, macros, lisp, common-lisp Problem: once-only lisp macro, yet another implementation I am trying to learn Lisp from Peter Seibel's book "Practical Common Lisp". In chapter ...
once-only lisp macro, yet another implementation once-only lisp macro, yet another implementation practical-common-lisp macros lisp common-lisp once-only lisp macro, yet another implementation I am trying to learn Lisp from Peter Seibel's book "Practical Common Lisp". In chapter 8 : "Macros: Defining your own" , I came...
[ -0.01953125, 0.0162353515625, 0.0103759765625, -0.03466796875, 0.006500244140625, 0.0169677734375, 0.00083160400390625, 0.01611328125, 0.0252685546875, -0.033203125, -0.0023345947265625, 0.006378173828125, 0.01904296875, 0.00006103515625, 0.0286865234375, 0.021240234375, -0.016357421...
[ 24145, 191, 538, 400, 7008, 111789, 14373, 15700, 208124, 138155, 3796, 4086, 254, 39210, 30698, 1261, 7948, 35211, 4063, 12877, 50344, 49086, 151301, 139539, 382, 55450, 3666, 88606, 449, 10002, 36880, 103136, 37842, 29479, 60042, 54608, 26785...
[ 0.2017822265625, 0.1973876953125, 0.1695556640625, 0.1685791015625, 0.2156982421875, 0.2352294921875, 0.0684814453125, 0.06439208984375, 0.192626953125, 0.155517578125, 0.0782470703125, 0.120849609375, 0.1358642578125, 0.14697265625, 0.0362548828125, 0.15087890625, 0.049896240234375,...
embed
26164417_c0
26164417
lisp
0
Title: If a string in lisp is a vector, why can't I access the first element using svref? Problem title: If a string in lisp is a vector, why can't I access the first element using svref? Tags: lisp, common-lisp, vector Problem: If a string in lisp is a vector, why can't I access the first element using svref...
If a string in lisp is a vector, why can't I access the first element using svref? If a string in lisp is a vector, why can't I access the first element using svref? lisp common-lisp vector svref If a string in lisp is a vector, why can't I access the first element using svref? So, I'm trying to learn Lisp, a...
[ 0.00107574462890625, -0.006195068359375, -0.01513671875, 0.020263671875, -0.00089263916015625, -0.01171875, 0.0022125244140625, -0.0037078857421875, 0.000621795654296875, -0.030029296875, -0.00046539306640625, -0.0115966796875, 0.008056640625, 0.0118408203125, -0.02294921875, -0.011840...
[ 4263, 79315, 400, 7008, 83, 173, 18770, 15400, 831, 3768, 18, 17203, 5117, 12830, 17368, 12669, 29087, 39210, 4086, 254, 23, 30698, 1261, 2967, 80934, 2367, 10, 23351, 214, 16454, 14368, 9902, 151301, 10208, 147756, 12877, 1632, 157955, 692...
[ 0.0009765625, 0.2298583984375, 0.1317138671875, 0.198486328125, 0.1002197265625, 0.17919921875, 0.2069091796875, 0.08795166015625, 0.0728759765625, 0.037933349609375, 0.06036376953125, 0.178955078125, 0.1243896484375, 0.1717529296875, 0.061187744140625, 0.1190185546875, 0.25390625, ...
embed
20174176_c0
20174176
lisp
0
Title: Error in conditional (cond ...) script-fu Problem title: Error in conditional (cond ...) script-fu Tags: script-fu, gimp, lisp, scheme Problem: Error in conditional (cond ...) script-fu I'm trying to do a script-fu and I'm using a cond statement theoretically correct, but it always gives the error "Error: ( : 1)...
Error in conditional (cond ...) script-fu Error in conditional (cond ...) script-fu script-fu gimp lisp scheme Error Interactivo RUN-INTERACTIVE RUN-NONINTERACTIVE Image Filters PRUEBA Author Copyright Date SF-OPTION Interactive Error in conditional (cond ...) script-fu I'm trying to do a script-fu and I'm using a cond...
[ -0.0135498046875, 0.005126953125, -0.0101318359375, 0.015625, 0.00109100341796875, 0.0145263671875, 0.0220947265625, -0.0118408203125, -0.0150146484375, 0.00063323974609375, 0.01300048828125, -0.01007080078125, -0.011962890625, -0.006927490234375, 0.00885009765625, 0.01025390625, 0.0...
[ 212059, 23, 35431, 289, 2271, 71, 26499, 3125, 41810, 254, 400, 7008, 150370, 5337, 71234, 130747, 159318, 22710, 128896, 131683, 647, 8031, 61804, 4189, 59215, 20880, 71232, 153, 9, 31577, 17368, 158, 63805, 2264, 26785, 11343, 76199, 18499,...
[ 0.1829833984375, 0.104248046875, 0.2105712890625, 0.16455078125, 0.132568359375, 0.143798828125, 0.23095703125, 0.2047119140625, 0.0931396484375, 0.1015625, 0.032501220703125, 0.118408203125, 0.095703125, 0.08349609375, 0.07318115234375, 0.05682373046875, 0.03057861328125, 0.075195...
embed
18342729_c0
18342729
lisp
0
Title: passing a substring to a function Problem title: passing a substring to a function Tags: parsing, lisp, c%2B%2B Problem: passing a substring to a function I am working on building the LISP interpreter. The problem I am stuck at is where I need to send the entire substring to a function as soon as I encounter a "...
passing a substring to a function passing a substring to a function parsing lisp c%2B%2B Just word.size word.substr passing a substring to a function I am working on building the LISP interpreter. The problem I am stuck at is where I need to send the entire substring to a function as soon as I encounter a "(". For exam...
[ 0.016357421875, 0.01373291015625, 0.00518798828125, 0.02294921875, -0.022705078125, 0.01470947265625, 0.0162353515625, 0.0146484375, 0.0242919921875, -0.0301513671875, 0.000545501708984375, -0.0106201171875, 0.007659912109375, -0.00445556640625, -0.00058746337890625, -0.003494262695312...
[ 452, 6953, 1614, 91693, 47, 32354, 366, 400, 7008, 9563, 2565, 62539, 196842, 42, 20697, 33976, 16970, 9434, 29481, 56, 2967, 179933, 3871, 25379, 64194, 33662, 190647, 132, 87, 765, 27875, 13438, 9297, 74481, 140909, 4488, 4358, 944, 18151...
[ 0.1243896484375, 0.048797607421875, 0.217529296875, 0.271728515625, 0.151611328125, 0.2479248046875, 0.0972900390625, 0.0992431640625, 0.190673828125, 0.0196075439453125, 0.1402587890625, 0.1611328125, 0.084716796875, 0.125732421875, 0.01641845703125, 0.012603759765625, 0.08563232421...
embed
13485300_c0
13485300
lisp
0
Title: lisp parsing for 'not' Problem title: lisp parsing for 'not' Tags: recursion, parsing, lisp Problem: lisp parsing for 'not' (defun simplify (x) (if (and (not (null x)) (listp x)) (if (and (equal '(car x) '(cadr x)) (equal '(car x) 'not)) (simplify (cddr x)) (cons (car x) (simplify (cdr x))) )...
lisp parsing for 'not' lisp parsing for 'not' recursion parsing lisp lisp parsing for 'not' This lisp function is meant to take an expression as an argument then remove superfluous 'not's from it and return it. It checks if the argument is a non-empty list and returns nil if it isn't (base case). If...
[ -0.0091552734375, 0.0238037109375, 0.0155029296875, 0.0146484375, 0.003814697265625, 0.0301513671875, 0.0101318359375, -0.0203857421875, 0.00885009765625, 0.0184326171875, -0.013671875, -0.0196533203125, -0.0098876953125, 0.000453948974609375, 0.0087890625, 0.015625, -0.0057983398437...
[ 400, 7008, 366, 6953, 100, 3768, 10869, 195625, 1830, 32354, 131148, 5646, 125195, 237, 10750, 87388, 18026, 30646, 12765, 2174, 351, 33548, 5303, 17324, 18, 37382, 7225, 4263, 939, 2258, 425, 2203, 7569, 96391, 80836, 45367, 15044, 7158, 1...
[ 0.1519775390625, 0.2001953125, 0.1468505859375, 0.0445556640625, 0.08758544921875, 0.04779052734375, 0.2435302734375, 0.1761474609375, 0.0361328125, 0.0987548828125, 0.03875732421875, 0.039276123046875, 0.147705078125, 0.00225830078125, 0.18310546875, 0.073974609375, 0.1092529296875,...
embed
8056404_c0
8056404
lisp
0
Title: Is it possible to implement lisp "language" in Raku? Problem title: Is it possible to implement lisp "language" in Raku? Tags: lisp, raku Problem: Is it possible to implement lisp "language" in Raku? In here, interpretation of Hello $world per each quoting symbol I mean language . $world = "W...
Is it possible to implement lisp "language" in Raku? Is it possible to implement lisp "language" in Raku? lisp raku Raku Hello Hell emacs_func Emacs Lisp Is it possible to implement lisp "language" in Raku? In here, interpretation of Hello $world per each quoting symbol I mean language . So is Raku ...
[ 0.00421142578125, 0.0135498046875, 0.005767822265625, 0.04736328125, -0.0184326171875, 0.02685546875, -0.00113677978515625, 0.006378173828125, -0.004852294921875, -0.0167236328125, 0.003387451171875, 0.00897216796875, -0.01129150390625, 0.006134033203125, 0.005584716796875, 0.005889892...
[ 7722, 29479, 400, 7008, 196651, 23, 21010, 34, 673, 319, 35378, 43153, 352, 2263, 16498, 85269, 4439, 1261, 442, 206019, 3650, 32554, 12638, 9643, 1916, 26582, 29459, 46876, 113138, 20174, 19048, 32316, 22690 ]
[ 0.1624755859375, 0.17529296875, 0.1502685546875, 0.233642578125, 0.2359619140625, 0.08624267578125, 0.173583984375, 0.234375, 0.1085205078125, 0.162109375, 0.1767578125, 0.174072265625, 0.005523681640625, 0.0576171875, 0.0836181640625, 0.085205078125, 0.1036376953125, 0.13854980468...
embed
67714272_c1
67714272
lisp
1
be more than one word. They're actually stored in a database. Each Token can have: symbol, val, kind Symbol: Pretty format string to search for in sentence Value: The thing we want in the list Kind: An integer; number of args or code for other kinds KIND_CHOICES = [ (0, 'Argless Function'), (1, '1-Arg Function'), (2, ...
be more than one word. They're actually stored in a database. Each Token can have: symbol, val, kind Symbol: Pretty format string to search for in sentence Value: The thing we want in the list Kind: An integer; number of args or code for other kinds KIND_CHOICES = [ (0, 'Argless Function'), (1, '1-Arg Function'), (2, ...
[ -0.0038299560546875, -0.002838134765625, -0.00665283203125, 0.0155029296875, -0.01202392578125, -0.00457763671875, 0.0086669921875, -0.01165771484375, 0.0179443359375, -0.021484375, -0.01470947265625, -0.003326416015625, 0.00665283203125, 0.000743865966796875, -0.029541015625, 0.007690...
[ 186, 1286, 3501, 1632, 2565, 10660, 107, 20653, 4343, 71, 23, 10, 63399, 5, 98423, 717, 1098, 831, 765, 12, 26582, 3502, 8562, 131899, 197570, 9384, 79315, 33938, 100, 149357, 190060, 13580, 642, 3444, 5303, 27435, 892, 1505, 14012, 79459...
[ 0.2037353515625, 0.1522216796875, 0.132568359375, 0.1138916015625, 0.2283935546875, 0.0972900390625, 0.05975341796875, 0.091552734375, 0.1888427734375, 0.11376953125, 0.07427978515625, 0.005706787109375, 0.1988525390625, 0.002227783203125, 0.1328125, 0.25390625, 0.28759765625, 0.12...
embed
53346117_c0
53346117
lisp
0
Title: Taking groups of elements randomly in scheme Problem title: Taking groups of elements randomly in scheme Tags: lisp, functional-programming, scheme Problem: Taking groups of elements randomly in scheme How do I implement a program in Scheme taking the elements of a given list and returning a new list where the e...
Taking groups of elements randomly in scheme Taking groups of elements randomly in scheme lisp functional-programming scheme Taking Taking groups of elements randomly in scheme How do I implement a program in Scheme taking the elements of a given list and returning a new list where the elements are random gatherings of...
[ 0.001556396484375, 0.024658203125, 0.005279541015625, -0.00469970703125, -0.0218505859375, 0.01446533203125, -0.018310546875, -0.0228271484375, 0.01190185546875, -0.034423828125, 0.00909423828125, 0.0150146484375, -0.0005340576171875, -0.00031280517578125, -0.01434326171875, 0.01007080...
[ 2561, 214, 94407, 111, 80854, 96759, 538, 23, 150370, 400, 7008, 123309, 28966, 54, 87, 29479, 1528, 34702, 282, 35971, 34475, 5303, 136, 30646, 3525, 621, 914, 927, 27699, 96362, 2806, 1884, 4488, 100, 2499, 140909, 360, 7077, 28, 17, ...
[ 0.1778564453125, 0.05645751953125, 0.25390625, 0.0195159912109375, 0.2305908203125, 0.2164306640625, 0.1123046875, 0.08526611328125, 0.274169921875, 0.06134033203125, 0.1878662109375, 0.1236572265625, 0.1019287109375, 0.0230255126953125, 0.004241943359375, 0.19873046875, 0.1918945312...
embed
13634761_c0
13634761
lisp
0
Title: Overhand Shuffle with Clojure - almost Problem title: Overhand Shuffle with Clojure - almost Tags: clojure, functional-programming, lisp, shuffle Problem: Overhand Shuffle with Clojure - almost I'm trying to implement a Overhand Shuffle in Clojure as a bit of a learning exercise So I've got this code... (defn ov...
Overhand Shuffle with Clojure - almost Overhand Shuffle with Clojure - almost clojure functional-programming lisp shuffle Overhand Shuffle Clojure card_count _new_cards _rand_ceiling Overhand Shuffle with Clojure - almost I'm trying to implement a Overhand Shuffle in Clojure as a bit of a learning exercise So I've got ...
[ -0.00909423828125, 0.000782012939453125, -0.0014190673828125, -0.0022735595703125, -0.007415771484375, 0.0125732421875, -0.0162353515625, -0.0177001953125, 0.00787353515625, -0.03759765625, -0.0033416748046875, 0.015380859375, -0.0040283203125, 0.01220703125, 0.0113525390625, -0.012451...
[ 9578, 12336, 13684, 4902, 133, 678, 51053, 461, 107, 39555, 20450, 123309, 28966, 400, 7008, 170052, 20596, 71013, 54936, 38931, 37214, 329, 49725, 31577, 29479, 52080, 81979, 18151, 4552, 20903, 47, 20594, 2367, 3444, 119140, 35971, 5117, 46...
[ 0.1258544921875, 0.183837890625, 0.09515380859375, 0.1708984375, 0.11767578125, 0.036346435546875, 0.1026611328125, 0.141845703125, 0.1064453125, 0.146240234375, 0.071533203125, 0.116943359375, 0.08251953125, 0.0309600830078125, 0.109619140625, 0.22021484375, 0.1405029296875, 0.113...
embed
47129185_c0
47129185
lisp
0
Title: Creating a custom reverse of list Problem title: Creating a custom reverse of list Tags: common-lisp, lisp, clisp Problem: Creating a custom reverse of list I'm trying to create a custom reverse of list in Lisp. I'm pretty new to Lisp programming, and still struggling with syntax. This is my code so far (defun n...
Creating a custom reverse of list Creating a custom reverse of list common-lisp lisp clisp Creating Creating a custom reverse of list I'm trying to create a custom reverse of list in Lisp. I'm pretty new to Lisp programming, and still struggling with syntax. This is my code so far Here I'm taking two lists, and forming...
[ -0.009521484375, 0.033935546875, 0.0064697265625, -0.00189208984375, -0.019775390625, 0.01416015625, -0.00135040283203125, 0.0137939453125, 0.0196533203125, -0.017578125, 0.01190185546875, 0.0181884765625, 0.0186767578125, -0.009521484375, -0.00390625, 0.0048828125, 0.01220703125, ...
[ 56781, 114122, 39531, 184, 111, 5303, 39210, 4086, 254, 400, 7008, 95701, 31577, 28282, 1261, 56037, 237875, 86531, 18151, 2060, 35971, 6626, 3173, 69941, 96, 6953, 17203, 12830, 90825, 114689, 3525, 3332, 17368, 158, 2258, 42, 28350, 179459,...
[ 0.1455078125, 0.212646484375, 0.212158203125, 0.177734375, 0.1239013671875, 0.2091064453125, 0.08502197265625, 0.08660888671875, 0.1429443359375, 0.084716796875, 0.1943359375, 0.051422119140625, 0.056610107421875, 0.1302490234375, 0.1263427734375, 0.055328369140625, 0.030731201171875...
embed
27558813_c0
27558813
lisp
0
Title: Clojure's equivalent to Lisp's atom function Problem title: Clojure's equivalent to Lisp's atom function Tags: clojure, lisp Problem: Clojure's equivalent to Lisp's atom function I have this Lisp code, and I'm trying to convert it into Clojure code. (defun copy-tree (tr) (if (atom tr) tr (con...
Clojure's equivalent to Lisp's atom function Clojure's equivalent to Lisp's atom function clojure lisp Clojure Lisp clojure.lang.Counted clojure.lang.IPersistentCollection java.util.Collection java.util.Map Clojure's equivalent to Lisp's atom function I have this Lisp code, and I'm trying to convert...
[ -0.00396728515625, 0.030029296875, -0.006256103515625, 0.0029754638671875, -0.01104736328125, 0.0247802734375, 0.0002651214599609375, -0.0198974609375, -0.01031494140625, -0.034423828125, -0.005462646484375, -0.0081787109375, 0.00811767578125, -0.01190185546875, 0.014404296875, -0.0024...
[ 51053, 461, 107, 3768, 183234, 47, 1261, 7008, 34627, 32354, 20450, 400, 3066, 108210, 297, 1314, 6892, 78457, 133, 79, 330, 3675, 166179, 18151, 31577, 96760, 3934, 22027, 18, 765, 23, 4552, 12921, 91084, 2811, 40383, 28960, 17368, 44691, ...
[ 0.152099609375, 0.1981201171875, 0.16064453125, 0.0849609375, 0.19189453125, 0.04638671875, 0.1553955078125, 0.2138671875, 0.2099609375, 0.1700439453125, 0.1295166015625, 0.09814453125, 0.0950927734375, 0.1279296875, 0.046630859375, 0.029632568359375, 0.1737060546875, 0.02581787109...
embed
16221736_c0
16221736
lisp
0
Title: Functional Programming: persistent list that handles freq. item updates efficiently? Problem title: Functional Programming: persistent list that handles freq. item updates efficiently? Tags: immutability, lisp, functional-programming, clojure Problem: Functional Programming: persistent list that handles freq. it...
Functional Programming: persistent list that handles freq. item updates efficiently? Functional Programming: persistent list that handles freq. item updates efficiently? immutability lisp functional-programming clojure Functional Programming Functional Programming: persistent list that handles freq. item updates effici...
[ 0.00125885009765625, 0.0341796875, -0.01226806640625, -0.01031494140625, 0.01104736328125, 0.017822265625, -0.0022125244140625, -0.0029449462890625, -0.00946044921875, -0.00592041015625, 0.0240478515625, -0.00604248046875, 0.006011962890625, 0.006683349609375, 0.007080078125, 0.0127563...
[ 28670, 10763, 289, 27958, 214, 70560, 2517, 5303, 450, 34831, 12478, 864, 35735, 114419, 93766, 14311, 41159, 400, 7008, 123309, 28966, 20450, 461, 765, 55769, 17368, 2053, 45646, 1221, 3249, 103351, 47, 10135, 8035, 73197, 47041, 151107, 536...
[ 0.1328125, 0.1153564453125, 0.0172576904296875, 0.18994140625, 0.0860595703125, 0.231689453125, 0.1746826171875, 0.263671875, 0.0279998779296875, 0.1500244140625, 0.167724609375, 0.136474609375, 0.166015625, 0.2110595703125, 0.2049560546875, 0.140869140625, 0.048187255859375, 0.085...
embed
17621896_c0
17621896
lisp
0
Title: Execute multiple commands in LISP sequentially Problem title: Execute multiple commands in LISP sequentially Tags: autolisp, lisp, autocad, autocad-plugin, autodesk Problem: Execute multiple commands in LISP sequentially I am running an .arx application in AutoCAD. When we click on the customized tab in AutoCAD ...
Execute multiple commands in LISP sequentially Execute multiple commands in LISP sequentially autolisp lisp autocad autocad-plugin autodesk Execute LISP c:XYZ_program ABC XYZ.arx XYZ_program Execute multiple commands in LISP sequentially I am running an .arx application in AutoCAD. When we click on the customized tab i...
[ 0.0050048828125, 0.02001953125, -0.0244140625, 0.0308837890625, -0.01104736328125, 0.001953125, 0.0172119140625, -0.0089111328125, 0.01202392578125, -0.0263671875, 0.01202392578125, 0.026123046875, -0.016845703125, -0.015869140625, -0.007171630859375, -0.006622314453125, -0.008666992...
[ 211603, 48716, 75101, 7, 23, 16970, 9434, 243228, 1809, 4086, 254, 400, 7008, 25426, 145301, 133850, 1511, 18749, 47457, 147, 425, 51042, 38415, 4396, 85427, 18158, 178036, 20928, 127877, 1528, 2256, 32354, 71924, 11675, 8026, 35509, 107730, ...
[ 0.141845703125, 0.179443359375, 0.246826171875, 0.0242156982421875, 0.0198974609375, 0.1478271484375, 0.24755859375, 0.167724609375, 0.055999755859375, 0.100830078125, 0.1412353515625, 0.1138916015625, 0.1611328125, 0.1016845703125, 0.056884765625, 0.1103515625, 0.026947021484375, ...
embed
26459077_c0
26459077
lisp
0
Title: Why setq cuts my list Problem title: Why setq cuts my list Tags: common-lisp, lisp Problem: Why setq cuts my list As the title says, I'm trying to append items to a list called solution, below is the code: (defun add-solution (n) (let ((solution)) (do((current-node '() (next-state current-node n nil))) ((equal c...
Why setq cuts my list Why setq cuts my list common-lisp lisp Why Cur Solution Why setq cuts my list As the title says, I'm trying to append items to a list called solution, below is the code: Each time the new current-node is a something like: (1 7 8 14), (2 4 11 13), but when the loop returns it returns ((1) (2)).. Wh...
[ 0.005615234375, 0.017578125, 0.03271484375, 0.016845703125, -0.003082275390625, 0.0177001953125, -0.0140380859375, 0.004180908203125, 0.0213623046875, -0.0087890625, 0.005767822265625, 0.0024871826171875, -0.0263671875, -0.0111083984375, -0.02001953125, -0.0035247802734375, -0.003356...
[ 44084, 5423, 864, 314, 933, 759, 5303, 39210, 4086, 254, 400, 7008, 17065, 187895, 44759, 31577, 114689, 71, 55769, 47, 35839, 29806, 35064, 70, 18151, 98423, 1733, 3525, 43581, 157, 112, 83, 9844, 1884, 2858, 361, 382, 616, 4700, 201, ...
[ 0.13818359375, 0.213134765625, 0.257080078125, 0.2191162109375, 0.1319580078125, 0.09820556640625, 0.2496337890625, 0.14404296875, 0.07281494140625, 0.13330078125, 0.06591796875, 0.1422119140625, 0.185302734375, 0.204833984375, 0.016510009765625, 0.07904052734375, 0.111572265625, 0...
embed
20074380_c0
20074380
lisp
0
Title: CAR represent *right* subtree of a cons? Problem title: CAR represent *right* subtree of a cons? Tags: lisp, list, tree, common-lisp Problem: CAR represent *right* subtree of a cons? I am reading "ANSI Common Lisp" by Paul Graham, in $3.8 (page 40) it goes: "Conses can also be considered as binary trees, with th...
CAR represent *right* subtree of a cons? CAR represent *right* subtree of a cons? lisp list tree common-lisp CAR CAR represent *right* subtree of a cons? I am reading "ANSI Common Lisp" by Paul Graham, in $3.8 (page 40) it goes: "Conses can also be considered as binary trees, with the car representing the right subtree...
[ 0.037353515625, -0.000736236572265625, 0.018310546875, -0.0024871826171875, 0.01251220703125, 0.0208740234375, 0.00555419921875, 0.0021209716796875, 0.00634765625, -0.00010633468627929688, -0.01226806640625, -0.021728515625, 0.00020885467529296875, 0.01806640625, 0.0244140625, -0.01214...
[ 42476, 33636, 54969, 1614, 62600, 158, 7, 400, 7008, 5303, 53201, 39210, 4086, 254, 16454, 48789, 568, 151301, 1261, 10208, 147756, 3650, 135527, 11935, 5908, 90698, 237, 2394, 6635, 1360, 2258, 7108, 56329, 42, 25737, 136, 133, 2480, 11814...
[ 0.280029296875, 0.239990234375, 0.1834716796875, 0.1832275390625, 0.2119140625, 0.18359375, 0.1162109375, 0.0845947265625, 0.1529541015625, 0.16748046875, 0.1634521484375, 0.09149169921875, 0.096923828125, 0.1077880859375, 0.027740478515625, 0.057525634765625, 0.06280517578125, 0.0...
embed
27682698_c0
27682698
lisp
0
Title: logical operations not happening in sbcl lisp Problem title: logical operations not happening in sbcl lisp Tags: lisp, bit-manipulation, common-lisp Problem: logical operations not happening in sbcl lisp I want to make program to multiply two numbers by add and shift method. I have written this code in sbcl lisp...
logical operations not happening in sbcl lisp logical operations not happening in sbcl lisp lisp bit-manipulation common-lisp 0 num1 num2 Enter logical operations not happening in sbcl lisp I want to make program to multiply two numbers by add and shift method. I have written this code in sbcl lisp. but the value of re...
[ -0.004058837890625, 0.0106201171875, -0.004119873046875, 0.025146484375, -0.01171875, 0.01519775390625, 0.01312255859375, 0.00885009765625, -0.0137939453125, -0.007232666015625, 0.00335693359375, 0.0142822265625, -0.00180816650390625, -0.0107421875, 0.016357421875, -0.0047607421875, ...
[ 62775, 289, 41018, 7, 959, 123087, 23, 91, 275, 34937, 400, 7008, 4785, 9051, 254, 72403, 39210, 4086, 757, 13269, 418, 304, 60816, 3444, 3249, 1528, 6024, 62479, 6626, 101935, 15190, 136, 122925, 55300, 59121, 18151, 70, 34292, 3332, 356...
[ 0.2296142578125, 0.132568359375, 0.206298828125, 0.049713134765625, 0.1185302734375, 0.1461181640625, 0.07635498046875, 0.051116943359375, 0.0767822265625, 0.1710205078125, 0.10888671875, 0.2110595703125, 0.1109619140625, 0.060516357421875, 0.1708984375, 0.0198974609375, 0.1092529296...
embed
8174546_c0
8174546
lisp
0
Title: Returning parameter for Lisp function Problem title: Returning parameter for Lisp function Tags: return, function, lisp Problem: Returning parameter for Lisp function I'm trying to get this function to display the literal expr2 and expr1 as they are entered. The data that is entered is of the form (+ x y). (DEFU...
Returning parameter for Lisp function Returning parameter for Lisp function return function lisp Returning Lisp DEFUN COND ATOM EQL FIRST SECOND THIRD ERROR UNKNOWN expr1 expr2 LIST SETQ DERIV Returning parameter for Lisp function I'm trying to get this function to display the literal expr2 and expr1 as they are entere...
[ -0.0048828125, 0.0098876953125, -0.01324462890625, 0.00823974609375, 0.01220703125, 0.0272216796875, -0.001617431640625, 0.00011587142944335938, 0.00543212890625, -0.0238037109375, 0.007049560546875, 0.000659942626953125, -0.00830078125, -0.000644683837890625, -0.0017852783203125, 0.01...
[ 173340, 214, 171859, 1261, 7008, 32354, 100, 30646, 400, 202001, 14006, 14452, 397, 117032, 178102, 866, 94607, 40756, 151206, 110753, 14700, 42, 418, 304, 195977, 128565, 2737, 18044, 15583, 31577, 44116, 70, 15659, 289, 136, 237, 30957, 205...
[ 0.2293701171875, 0.051239013671875, 0.26318359375, 0.18017578125, 0.25439453125, 0.177490234375, 0.0160369873046875, 0.239990234375, 0.1485595703125, 0.0992431640625, 0.09197998046875, 0.042236328125, 0.041351318359375, 0.1270751953125, 0.06939697265625, 0.061431884765625, 0.02929687...
embed
60014817_c0
60014817
lisp
0
Title: Is there a function in Racket that returns a procedure's lambda-expression? Problem title: Is there a function in Racket that returns a procedure's lambda-expression? Tags: lisp, lambda, common-lisp, racket Problem: Is there a function in Racket that returns a procedure's lambda-expression? In one vari...
Is there a function in Racket that returns a procedure's lambda-expression? Is there a function in Racket that returns a procedure's lambda-expression? lisp lambda common-lisp racket Racket PROCEDURE LAMBDA Is there a function in Racket that returns a procedure's lambda-expression? In one variant of Common Li...
[ 0.005950927734375, 0.0186767578125, -0.0032196044921875, 0.0103759765625, -0.00689697265625, 0.00982666015625, 0.00555419921875, 0.008544921875, -0.0179443359375, -0.0294189453125, -0.0011138916015625, -0.00927734375, -0.00909423828125, -0.02490234375, 0.0166015625, 0.00799560546875, ...
[ 32354, 23, 2552, 27853, 30646, 7, 50491, 3768, 21, 6492, 85, 204629, 400, 7008, 39210, 4086, 254, 673, 10514, 10854, 397, 3358, 12689, 6538, 2685, 10, 20117, 151301, 1261, 23330, 37486, 44691, 143, 4163, 28412, 1810, 125195, 1902, 139392, ...
[ 0.2108154296875, 0.0816650390625, 0.121337890625, 0.22900390625, 0.155029296875, 0.04510498046875, 0.186279296875, 0.032806396484375, 0.0655517578125, 0.187744140625, 0.150146484375, 0.2064208984375, 0.049835205078125, 0.1619873046875, 0.027252197265625, 0.0285797119140625, 0.0878906...
embed
69545932_c0
69545932
lisp
0
Title: How to remove nil values from a list in LISP? Problem title: How to remove nil values from a list in LISP? Tags: common-lisp, depth-first-search, lisp Problem: How to remove nil values from a list in LISP? I have written a function DFS that traverses a search tree in a right-to-left, DFS order. For example, (DFS...
How to remove nil values from a list in LISP? How to remove nil values from a list in LISP? common-lisp depth-first-search lisp a How LISP Following NIL DFS Checks How to remove nil values from a list in LISP? I have written a function DFS that traverses a search tree in a right-to-left, DFS order. For example, (DFS '(...
[ 0.01141357421875, 0.029296875, 0.00384521484375, 0.0027618408203125, 0.00225830078125, 0.01397705078125, 0.0030059814453125, -0.004241943359375, -0.022216796875, -0.01239013671875, 0.01153564453125, -0.0185546875, -0.01141357421875, -0.003875732421875, 0.01123046875, 0.017578125, 0.0...
[ 11249, 47, 87388, 17324, 142424, 1295, 5303, 16970, 9434, 23, 39210, 4086, 254, 168867, 13448, 86250, 400, 7008, 77168, 541, 16444, 36381, 38679, 59121, 32354, 391, 37317, 33938, 53201, 7108, 2480, 12989, 38997, 294, 866, 241, 563, 384, 560...
[ 0.069091796875, 0.012786865234375, 0.203125, 0.251953125, 0.22021484375, 0.0955810546875, 0.21923828125, 0.1361083984375, 0.2484130859375, 0.046142578125, 0.0712890625, 0.10003662109375, 0.1883544921875, 0.1448974609375, 0.03375244140625, 0.1217041015625, 0.06842041015625, 0.129638...
embed
65748966_c0
65748966
lisp
0
Title: LISP sort list of lists by 2 arguments Problem title: LISP sort list of lists by 2 arguments Tags: sorting, arguments, key, lisp, list Problem: LISP sort list of lists by 2 arguments I have a list made out of lists (preorder-mst) like this: ((arc graph-id vertex-a vertex-b weight) (arc graph-id vertex-a vertex-b...
LISP sort list of lists by 2 arguments LISP sort list of lists by 2 arguments sorting arguments key lisp list LISP LISP sort list of lists by 2 arguments I have a list made out of lists (preorder-mst) like this: ((arc graph-id vertex-a vertex-b weight) (arc graph-id vertex-a vertex-b weight) ...) What I wanted to do wa...
[ 0.00970458984375, 0.019775390625, -0.013671875, 0.00787353515625, -0.009521484375, 0.0152587890625, -0.000698089599609375, 0.0037384033203125, -0.0002613067626953125, 0.01226806640625, 0.0186767578125, -0.00860595703125, -0.0106201171875, -0.0225830078125, -0.00848388671875, 0.00476074...
[ 16970, 9434, 12096, 5303, 111, 7, 390, 116, 10750, 22799, 400, 7008, 1810, 4692, 80596, 271, 147, 41382, 532, 493, 24371, 275, 57888, 36663, 1614, 6562, 105950, 11782, 32354, 80854, 62351, 479, 16082, 91693, 2606, 1297, 30646, 26785, 34292,...
[ 0.1092529296875, 0.180908203125, 0.2022705078125, 0.2137451171875, 0.0133056640625, 0.0340576171875, 0.036865234375, 0.157470703125, 0.2259521484375, 0.1173095703125, 0.080810546875, 0.1407470703125, 0.01275634765625, 0.07611083984375, 0.1710205078125, 0.04779052734375, 0.04232788085...
embed
15254040_c0
15254040
lisp
0
Title: lisp program to calculate the sum of n numbers Problem title: lisp program to calculate the sum of n numbers Tags: lisp Problem: lisp program to calculate the sum of n numbers (defun sum-n-numbers(n)(if(=n 1) 1 (+N(sum-n-numbers(-n 1))))) Edit 2: (defun sum-n-numbers(n) (if(=n 1) 1 (+N(sum-n-numbers(-n 1)) ) ) )...
lisp program to calculate the sum of n numbers lisp program to calculate the sum of n numbers lisp Error Call LAMBDA DECLARE SPECIAL:SOURCE LAMBDA-NAME SUM-N-NUMBERS BLOCK lisp program to calculate the sum of n numbers Edit 2: (defun sum-n-numbers(n) (if(=n 1) 1 (+N(sum-n-numbers(-n 1)) ) ) ) The above code runs but wh...
[ 0.004486083984375, 0.01953125, -0.01336669921875, -0.013671875, -0.005340576171875, 0.00860595703125, 0.003936767578125, 0.00830078125, 0.0115966796875, -0.01953125, -0.004974365234375, -0.031005859375, -0.00677490234375, -0.0118408203125, 0.0137939453125, 0.0177001953125, -0.0037231...
[ 400, 7008, 1528, 47, 74481, 10554, 111, 653, 101935, 67, 212059, 26265, 3358, 12689, 6538, 125508, 16271, 224343, 76234, 182512, 127944, 839, 109020, 24480, 124448, 605, 112, 16498, 9, 19, 2606, 1297, 3190, 4879, 106, 22183, 11832, 18151, 1...
[ 0.1666259765625, 0.244140625, 0.1763916015625, 0.0200042724609375, 0.1549072265625, 0.2354736328125, 0.0738525390625, 0.1395263671875, 0.1942138671875, 0.01361083984375, 0.1611328125, 0.1005859375, 0.03973388671875, 0.1318359375, 0.1337890625, 0.0235595703125, 0.07275390625, 0.0986...
embed
37316302_c0
37316302
lisp
0
Title: The concept of Self-Hosting Problem title: The concept of Self-Hosting Tags: lisp Problem: The concept of Self-Hosting So I'm developing a small programming language, and am trying to grasp around the concept of "Self-Hosting". Wikipedia states: The first self-hosting compiler (excluding assemblers) was written ...
The concept of Self-Hosting The concept of Self-Hosting lisp Self-Hosting The concept of Self-Hosting So I'm developing a small programming language, and am trying to grasp around the concept of "Self-Hosting". Wikipedia states: From this, I understand that someone had a Lisp interpreter, (lets say in Python). The Pyth...
[ 0.0361328125, 0.007049560546875, 0.0002231597900390625, 0.0218505859375, -0.0186767578125, 0.0162353515625, 0.0023193359375, -0.02099609375, 0.000637054443359375, -0.032470703125, -0.006988525390625, -0.0179443359375, -0.0223388671875, 0.00958251953125, 0.00714111328125, -0.01409912109...
[ 23755, 111, 55347, 9, 11193, 7, 1916, 400, 7008, 168698, 19336, 56037, 46876, 104475, 420, 8162, 28219, 1902, 1261, 29481, 145581, 1528, 12301, 103391, 13579, 8360, 4527, 49146, 6496, 87388, 81273, 11675, 3642, 14602, 24209, 19048, 47, 27980,...
[ 0.18408203125, 0.05126953125, 0.221435546875, 0.0814208984375, 0.214599609375, 0.1683349609375, 0.1734619140625, 0.1533203125, 0.212646484375, 0.0660400390625, 0.05670166015625, 0.07244873046875, 0.1322021484375, 0.1739501953125, 0.159423828125, 0.0921630859375, 0.0167236328125, 0....
embed
68319935_c0
68319935
lisp
0
Title: SICP Lisp/Scheme - recursive return value gets lost Problem title: SICP Lisp/Scheme - recursive return value gets lost Tags: sicp, scheme, recursion, list, lisp Problem: SICP Lisp/Scheme - recursive return value gets lost I'm writing a simple function that recursively checks if x (a list) is an element of remain...
SICP Lisp/Scheme - recursive return value gets lost SICP Lisp/Scheme - recursive return value gets lost sicp scheme recursion list lisp SICP Lisp Scheme was_seen SICP Lisp/Scheme - recursive return value gets lost I'm writing a simple function that recursively checks if x (a list) is an element of remaining (list of li...
[ -0.01239013671875, 0.033203125, 0.0047607421875, 0.00714111328125, -0.0240478515625, 0.01348876953125, 0.0184326171875, 0.0096435546875, 0.00885009765625, 0.005615234375, 0.0025482177734375, -0.0167236328125, -0.0050048828125, 0.01336669921875, 0.00084686279296875, -0.0033111572265625,...
[ 159, 198993, 1261, 7008, 25452, 12549, 195625, 5844, 30646, 34292, 62163, 72856, 26536, 254, 150370, 5303, 400, 34702, 509, 66079, 32562, 8781, 32354, 12765, 2174, 1022, 83, 12830, 111, 47143, 214, 6562, 47251, 468, 420, 1295, 75414, 840, 1...
[ 0.05218505859375, 0.19482421875, 0.095947265625, 0.1806640625, 0.1187744140625, 0.1474609375, 0.1865234375, 0.1546630859375, 0.25048828125, 0.21044921875, 0.043121337890625, 0.1895751953125, 0.0787353515625, 0.153564453125, 0.17041015625, 0.18408203125, 0.042510986328125, 0.1379394...
embed
7539732_c0
7539732
lisp
0
Title: Looking for references describing tail recursion optimization through exceptions Problem title: Looking for references describing tail recursion optimization through exceptions Tags: scheme, tail-call-optimization, lisp, interpreter, exception Problem: Looking for references describing tail recursion optimizatio...
Looking for references describing tail recursion optimization through exceptions Looking for references describing tail recursion optimization through exceptions scheme tail-call-optimization lisp interpreter exception Looking Looking for references describing tail recursion optimization through exceptions I have imple...
[ 0.024658203125, 0.050048828125, 0.000751495361328125, -0.006072998046875, -0.006805419921875, -0.01019287109375, -0.004150390625, -0.0096435546875, -0.016357421875, -0.02294921875, 0.0150146484375, -0.0179443359375, -0.0185546875, -0.00421142578125, 0.022705078125, -0.005340576171875, ...
[ 157268, 91067, 28852, 46741, 195625, 1830, 87235, 1363, 8305, 131527, 150370, 85763, 100433, 400, 7008, 29481, 56, 29479, 19336, 748, 433, 45226, 26484, 18151, 17198, 50828, 57, 68034, 5201, 62816, 48242, 136, 199849, 153941, 59875, 4086, 254, ...
[ 0.06341552734375, 0.1929931640625, 0.109130859375, 0.27783203125, 0.236328125, 0.10205078125, 0.23828125, 0.0380859375, 0.1278076171875, 0.269775390625, 0.1536865234375, 0.142822265625, 0.1923828125, 0.122314453125, 0.1671142578125, 0.188720703125, 0.0802001953125, 0.1212158203125,...
embed
33291228_c0
33291228
lisp
0
Title: Recursive split-list function LISP Problem title: Recursive split-list function LISP Tags: split, lisp, list, common-lisp, recursion Problem: Recursive split-list function LISP The split-list function takes a list and returns a list of two lists consisting of alternating elements of the input. I wrote the follow...
Recursive split-list function LISP Recursive split-list function LISP split lisp list common-lisp recursion Recursive LISP NIL SPLIT-LIST RETURNED Recursive split-list function LISP The split-list function takes a list and returns a list of two lists consisting of alternating elements of the input. I wrote the followin...
[ -0.01422119140625, 0.03076171875, -0.0032806396484375, -0.01422119140625, -0.0281982421875, 0.037353515625, -0.007110595703125, 0.01953125, 0.00958251953125, 0.005157470703125, 0.00714111328125, 0.00494384765625, -0.005096435546875, 0.018798828125, 0.0157470703125, 0.0296630859375, 0...
[ 853, 48650, 5844, 65450, 6562, 32354, 16970, 9434, 400, 7008, 5303, 39210, 4086, 254, 195625, 541, 16444, 12047, 107287, 195977, 56943, 9, 51776, 30646, 6626, 58055, 75939, 80854, 107730, 54397, 140992, 237, 84751, 70270, 14012, 5117, 106, 27...
[ 0.0242767333984375, 0.1939697265625, 0.091552734375, 0.2293701171875, 0.258544921875, 0.1795654296875, 0.131103515625, 0.22119140625, 0.084228515625, 0.1402587890625, 0.220947265625, 0.092041015625, 0.0765380859375, 0.121337890625, 0.213134765625, 0.06024169921875, 0.09649658203125, ...
embed
41316622_c0
41316622
lisp
0
Title: Generate random ASCII character Problem title: Generate random ASCII character Tags: random, lisp, ascii, scheme Problem: Generate random ASCII character I need to generate a random ASCII letter (upper or lowercase) or character (but not number) in scheme, and I was wondering what the appropriate way to do that ...
Generate random ASCII character Generate random ASCII character random lisp ascii scheme Generate ASCII Error Generate random ASCII character I need to generate a random ASCII letter (upper or lowercase) or character (but not number) in scheme, and I was wondering what the appropriate way to do that was. Currently I've...
[ 0.0031280517578125, 0.01385498046875, 0.0177001953125, -0.0025634765625, -0.005767822265625, 0.0093994140625, -0.0250244140625, -0.0284423828125, -0.027099609375, 0.020263671875, 0.01507568359375, -0.03271484375, -0.015869140625, 0.0166015625, -0.00066375732421875, -0.0029754638671875,...
[ 155370, 67, 96759, 125429, 10001, 62816, 400, 7008, 237, 26506, 150370, 212059, 87, 3871, 139392, 10, 31330, 34, 8079, 707, 92319, 58437, 8789, 959, 14012, 23, 149016, 95307, 3917, 47, 54, 450, 114063, 4163, 18151, 3129, 43240, 157, 18499, ...
[ 0.2005615234375, 0.107177734375, 0.228759765625, 0.1234130859375, 0.232666015625, 0.218505859375, 0.05169677734375, 0.131103515625, 0.0230255126953125, 0.1746826171875, 0.1845703125, 0.2021484375, 0.023284912109375, 0.1209716796875, 0.21435546875, 0.01043701171875, 0.1929931640625, ...
embed
53735604_c0
53735604
lisp
0
Title: Translating Python into Scheme/Racket Problem title: Translating Python into Scheme/Racket Tags: scheme, racket, python-2.7, lisp Problem: Translating Python into Scheme/Racket I'm currently trying to translate this python 2 code: import math def worstCaseArrayOfSize(n): if n == 1: return [1] else: top = worstCa...
Translating Python into Scheme/Racket Translating Python into Scheme/Racket scheme racket python-2.7 lisp math Translating Python Scheme Racket math.floor math.ceil python-2.7 Translating Python into Scheme/Racket I'm currently trying to translate this python 2 code: into racket/scheme code, and having a difficult time...
[ -0.01025390625, 0.0203857421875, -0.00811767578125, -0.029541015625, 0.0045166015625, 0.0037384033203125, -0.01025390625, -0.04150390625, -0.01007080078125, -0.017333984375, 0.00567626953125, -0.01031494140625, -0.003326416015625, -0.00885009765625, 0.00048065185546875, -0.028198242187...
[ 11062, 143, 1916, 145581, 3934, 34702, 282, 64, 12248, 27853, 150370, 673, 17198, 50828, 5428, 966, 400, 7008, 48909, 2552, 52347, 329, 379, 82424, 31577, 3900, 19309, 116, 18151, 7560, 34844, 1733, 2060, 7730, 44691, 25632, 18499 ]
[ 0.14013671875, 0.187255859375, 0.042022705078125, 0.2452392578125, 0.1363525390625, 0.1705322265625, 0.10345458984375, 0.024993896484375, 0.099609375, 0.1817626953125, 0.1871337890625, 0.0958251953125, 0.0853271484375, 0.1181640625, 0.03948974609375, 0.084228515625, 0.0211181640625, ...
embed
19529829_c0
19529829
lisp
0
Title: How to recursively reverse a list using only basic operations? Problem title: How to recursively reverse a list using only basic operations? Tags: lisp, scheme, recursion, list Problem: How to recursively reverse a list using only basic operations? I was wondering how to reverse a list using only basic operation...
How to recursively reverse a list using only basic operations? How to recursively reverse a list using only basic operations? lisp scheme recursion list only How How to recursively reverse a list using only basic operations? I was wondering how to reverse a list using only basic operations such as cons, first, rest, em...
[ -0.03759765625, 0.05224609375, -0.003021240234375, -0.000514984130859375, -0.0067138671875, -0.002960205078125, -0.0091552734375, 0.0194091796875, -0.00034332275390625, -0.017333984375, 0.005859375, -0.002593994140625, 0.015625, 0.00171661376953125, 0.0086669921875, 0.01031494140625, ...
[ 11249, 47, 195625, 5844, 538, 39531, 184, 5303, 17368, 4734, 62822, 41018, 10, 7, 400, 7008, 150370, 1830, 149016, 3642, 158, 5117, 10588, 201505, 4358, 32354, 183278, 22230, 107003, 51776, 1632, 107730, 7722, 228113, 3173, 21373, 202317, 136...
[ 0.091064453125, 0.0204620361328125, 0.218994140625, 0.175537109375, 0.0732421875, 0.2406005859375, 0.201904296875, 0.2301025390625, 0.072998046875, 0.1146240234375, 0.1785888671875, 0.185546875, 0.0272216796875, 0.0252227783203125, 0.091064453125, 0.187255859375, 0.166015625, 0.121...
embed
65994868_c1
65994868
lisp
1
(whose index is odd) you return its value. for example Revaluation (or 1 2 3) will return 1, revaluation (or-odd false (display 2) 3) will print 2 and return 3. 1) Implement the following procedures (must use the tag package): • The odd-or-make constructor, which receives a list of expressions as an argument • Selecto...
(whose index is odd) you return its value. for example Revaluation (or 1 2 3) will return 1, revaluation (or-odd false (display 2) 3) will print 2 and return 3. 1) Implement the following procedures (must use the tag package): • The odd-or-make constructor, which receives a list of expressions as an argument • Selecto...
[ -0.0166015625, 0.02392578125, -0.0011444091796875, 0.00066375732421875, -0.0087890625, 0.0272216796875, -0.01531982421875, 0.00555419921875, 0.02197265625, 0.01275634765625, 0.01495361328125, -0.010986328125, 0.00023174285888671875, -0.0023651123046875, -0.005218505859375, 0.0158691406...
[ 497, 63262, 83, 70270, 398, 30646, 6863, 34292, 27781, 853, 27494, 2320, 116, 8439, 1221, 106, 456, 748, 13606, 98320, 20706, 28412, 1031, 4879, 153941, 25632, 50491, 4527, 7909, 98169, 55898, 64549, 53299, 5303, 125195, 237, 10750, 51620, ...
[ 0.04046630859375, 0.2486572265625, 0.1136474609375, 0.28955078125, 0.000885009765625, 0.205078125, 0.06097412109375, 0.168212890625, 0.0355224609375, 0.054107666015625, 0.185302734375, 0.056243896484375, 0.062744140625, 0.090087890625, 0.0256195068359375, 0.0162200927734375, 0.066833...
embed
23055058_c0
23055058
lisp
0
Title: mapcar to two arguments Problem title: mapcar to two arguments Tags: common-lisp, lisp Problem: mapcar to two arguments I'm a newbie in lisp. I'm writing a recursive function to remove all occurrences of an element in a list. This is what I tried writing to remove only the occurrences as atoms in the list. (defu...
mapcar to two arguments mapcar to two arguments common-lisp lisp mapcar to two arguments I'm a newbie in lisp. I'm writing a recursive function to remove all occurrences of an element in a list. This is what I tried writing to remove only the occurrences as atoms in the list. Now, I've to modify it such that it also pr...
[ -0.013916015625, 0.02880859375, 0.0106201171875, 0.0196533203125, -0.01275634765625, 0.041015625, 0.01324462890625, 0.015625, 0.00885009765625, -0.04931640625, 0.000637054443359375, 0.0022125244140625, 0.0017242431640625, 0.00970458984375, 0.002166748046875, -0.0027313232421875, -0.0...
[ 22288, 3284, 47, 6626, 10750, 39210, 4086, 254, 400, 7008, 9014, 32562, 195625, 5844, 32354, 87388, 756, 74918, 42, 69098, 12830, 5303, 37842, 4734, 237, 34627, 2811, 40383, 9433, 80854, 1614, 6562, 84751, 1295, 86687, 49878, 510, 360, 7077...
[ 0.1871337890625, 0.281005859375, 0.102783203125, 0.162353515625, 0.229736328125, 0.0772705078125, 0.07159423828125, 0.130126953125, 0.1053466796875, 0.1826171875, 0.0743408203125, 0.0770263671875, 0.14404296875, 0.08917236328125, 0.1807861328125, 0.1552734375, 0.0728759765625, 0.10...
embed
53583457_c0
53583457
lisp
0
Title: Stream of fibonacci sequence in Scheme Problem title: Stream of fibonacci sequence in Scheme Tags: scheme, racket, lisp Problem: Stream of fibonacci sequence in Scheme I'm currently trying to understand the concept of streams in scheme. As an example I'm supposed to write a function fibonacci that returns fibona...
Stream of fibonacci sequence in Scheme Stream of fibonacci sequence in Scheme scheme racket lisp Stream Scheme Stream of fibonacci sequence in Scheme I'm currently trying to understand the concept of streams in scheme. As an example I'm supposed to write a function fibonacci that returns fibonacci numbers as a stream r...
[ -0.0020599365234375, 0.0247802734375, -0.019287109375, -0.015380859375, 0.00159454345703125, -0.00592041015625, 0.0012664794921875, -0.0238037109375, 0.0026397705078125, -0.04248046875, 0.004547119140625, -0.0185546875, -0.0086669921875, 0.031982421875, 0.0068359375, 0.0018157958984375...
[ 115061, 111, 809, 20990, 52544, 40, 944, 3956, 23, 34702, 282, 150370, 673, 27853, 400, 7008, 82424, 31577, 28219, 23755, 75973, 7, 27781, 134598, 33022, 32354, 30646, 101935, 237, 18811, 104851, 140992, 147152, 33342, 1884, 903, 12638, 12830...
[ 0.28564453125, 0.1182861328125, 0.13134765625, 0.154052734375, 0.193359375, 0.07244873046875, 0.154052734375, 0.057037353515625, 0.09735107421875, 0.1982421875, 0.1644287109375, 0.1973876953125, 0.03643798828125, 0.1473388671875, 0.0311431884765625, 0.1439208984375, 0.012359619140625...
embed
60161006_c0
60161006
lisp
0
Title: Scheme/Racket: How does this Honu lang create syntax without evaluation parentheses? Problem title: Scheme/Racket: How does this Honu lang create syntax without evaluation parentheses? Tags: scheme, syntax, evaluation, racket, lisp Problem: Scheme/Racket: How does this Honu lang create syntax without evaluation ...
Scheme/Racket: How does this Honu lang create syntax without evaluation parentheses? Scheme/Racket: How does this Honu lang create syntax without evaluation parentheses? scheme syntax evaluation racket lisp syntax/parse/define Scheme Racket How Honu Cond Form RUN WITHOUT PARENTHESES add1 Scheme/Racket: How does this Ho...
[ -0.01953125, 0.0294189453125, -0.017333984375, 0.0208740234375, -0.0068359375, 0.00122833251953125, 0.01458740234375, -0.0235595703125, -0.0108642578125, -0.0223388671875, -0.003204345703125, -0.013916015625, -0.032958984375, -0.029052734375, 0.004180908203125, -0.0023956298828125, 0...
[ 34702, 282, 12248, 27853, 11249, 903, 13015, 34, 1937, 28282, 6002, 86531, 15490, 219836, 49129, 35412, 90, 150370, 673, 400, 7008, 112, 64552, 2552, 1657, 71, 15236, 130747, 55766, 52001, 111422, 120363, 15190, 418, 75935, 678, 219, 3066, ...
[ 0.13671875, 0.119873046875, 0.09765625, 0.20068359375, 0.059844970703125, 0.04327392578125, 0.1646728515625, 0.222412109375, 0.1851806640625, 0.1060791015625, 0.1156005859375, 0.1751708984375, 0.1181640625, 0.1546630859375, 0.12060546875, 0.1251220703125, 0.04541015625, 0.124755859...
embed
61871041_c0
61871041
lisp
0
Title: Creating a graph representing square sum relations Problem title: Creating a graph representing square sum relations Tags: math, clojure, lisp Problem: Creating a graph representing square sum relations I'm trying to solve the square sum problem, more specifically creating a function that can help with the relat...
Creating a graph representing square sum relations Creating a graph representing square sum relations math clojure lisp Creating Creating a graph representing square sum relations I'm trying to solve the square sum problem, more specifically creating a function that can help with the relations. "the function should, gi...
[ -0.01953125, 0.01397705078125, 0.004180908203125, 0.009033203125, -0.01220703125, -0.0179443359375, -0.0216064453125, 0.0101318359375, 0.0130615234375, 0.0010833740234375, 0.0040283203125, 0.01129150390625, -0.01300048828125, -0.006439208984375, -0.00213623046875, 0.010986328125, -0....
[ 56781, 41382, 33636, 108047, 10554, 91582, 10, 48909, 20450, 461, 107, 400, 7008, 31577, 86869, 2967, 105233, 32354, 4358, 5608, 5423, 62, 892, 26255, 27489, 41911, 96853, 370, 8705, 876, 32920, 136, 23, 83, 14012, 36442, 32, 109921, 36766,...
[ 0.154052734375, 0.2486572265625, 0.17529296875, 0.2269287109375, 0.1810302734375, 0.1939697265625, 0.00372314453125, 0.057342529296875, 0.06396484375, 0.135986328125, 0.1033935546875, 0.047882080078125, 0.11181640625, 0.029388427734375, 0.064453125, 0.0921630859375, 0.110107421875, ...
embed
48513801_c0
48513801
lisp
0
Title: its about LISP program, common lisp Problem title: its about LISP program, common lisp Tags: lisp Problem: its about LISP program, common lisp can u pls help me guys, its a tutorial question given to us by our lecturer & we can't actually seem to crack it no matter how much we tried. plz help ; perform some type...
its about LISP program, common lisp its about LISP program, common lisp lisp LISP Acc its about LISP program, common lisp can u pls help me guys, its a tutorial question given to us by our lecturer & we can't actually seem to crack it no matter how much we tried. plz help For the function call (f '(1 2 3) 1) show the s...
[ 0.000698089599609375, 0.023681640625, 0.00112152099609375, 0.01129150390625, -0.0091552734375, 0.021240234375, 0.005828857421875, 0.00927734375, 0.007232666015625, -0.0299072265625, 0.0250244140625, -0.0269775390625, -0.00860595703125, -0.006439208984375, -0.00909423828125, 0.000827789...
[ 6863, 1672, 16970, 9434, 1528, 39210, 400, 7008, 29899, 831, 75, 6456, 4358, 51484, 57143, 9655, 34475, 59619, 18, 20653, 48903, 116546, 442, 37842, 130432, 32354, 11782, 420, 41600, 116, 8439, 7639, 944, 3190, 2499, 7228, 47, 1096, 2704, ...
[ 0.16748046875, 0.127685546875, 0.1590576171875, 0.2244873046875, 0.1719970703125, 0.1612548828125, 0.1348876953125, 0.172119140625, 0.165283203125, 0.01123046875, 0.007110595703125, 0.044158935546875, 0.0711669921875, 0.033782958984375, 0.1617431640625, 0.076416015625, 0.000152587890...
embed
20219289_c0
20219289
lisp
0
Title: Get HTTP headers as alist Problem title: Get HTTP headers as alist Tags: common-lisp, drakma, lisp Problem: Get HTTP headers as alist I want to get the redirect url of a HTTP-request using drakma. If I pass in " http://lisp.org/ ", I want " http://lisp.org/index.html " back. Looking at the docs, it looks like I ...
Get HTTP headers as alist Get HTTP headers as alist common-lisp drakma lisp Get HTTP drakma:http-request lisp.org Result PURI:URI index.html Get HTTP headers as alist I want to get the redirect url of a HTTP-request using drakma. If I pass in " http://lisp.org/ ", I want " http://lisp.org/index.html " back. Looking at ...
[ -0.0050048828125, 0.006378173828125, 0.0150146484375, 0.0189208984375, -0.010009765625, -0.002197265625, -0.01336669921875, 0.0091552734375, -0.01513671875, -0.02587890625, 0.01373291015625, 0.00139617919921875, -0.0196533203125, 0.00946044921875, 0.000324249267578125, -0.0132446289062...
[ 20779, 135913, 10336, 1314, 237, 10, 6562, 39210, 4086, 254, 3366, 192, 400, 7008, 5475, 107, 75616, 1478, 126684, 46492, 63262, 7693, 3444, 2046, 456, 80581, 25002, 27875, 23, 1621, 4711, 4420, 33342, 8337, 11675, 26008, 14361, 127887, 350...
[ 0.10137939453125, 0.23779296875, 0.1978759765625, 0.1942138671875, 0.11572265625, 0.0740966796875, 0.2353515625, 0.0911865234375, 0.1109619140625, 0.1722412109375, 0.117919921875, 0.207275390625, 0.08740234375, 0.1710205078125, 0.133056640625, 0.05474853515625, 0.1259765625, 0.1325...
embed
16810189_c0
16810189
lisp
0
Title: Lisp sort function Problem title: Lisp sort function Tags: lisp, common-lisp Problem: Lisp sort function I am trying to make a (somehow) delicate sorting function in Lisp. I know there is lambda operator that should make my work a lot easier, but I couldn't find anything helpful so I hope you can help me. As an ...
Lisp sort function Lisp sort function lisp common-lisp Lisp Lisp sort function I am trying to make a (somehow) delicate sorting function in Lisp. I know there is lambda operator that should make my work a lot easier, but I couldn't find anything helpful so I hope you can help me. As an input I have a nested list like t...
[ -0.0208740234375, 0.018798828125, 0.0031585693359375, -0.0211181640625, -0.0189208984375, 0.0108642578125, -0.0018157958984375, -0.000423431396484375, -0.001983642578125, 0.0033111572265625, 0.0042724609375, 0.0010528564453125, 0.0034027099609375, 0.005828857421875, -0.0205078125, -0.0...
[ 1261, 7008, 12096, 32354, 400, 39210, 4086, 254, 31577, 3249, 71110, 13, 214, 6492, 85, 39933, 4488, 5915, 99156, 98893, 15673, 4358, 107730, 8512, 71, 5303, 1884, 140992, 5608, 186, 1286, 29458, 5117, 12830, 1295, 36, 418, 154186, 304, 3...
[ 0.178955078125, 0.21728515625, 0.23046875, 0.1748046875, 0.1400146484375, 0.125732421875, 0.1197509765625, 0.159912109375, 0.069091796875, 0.01263427734375, 0.145263671875, 0.0936279296875, 0.0841064453125, 0.1258544921875, 0.094482421875, 0.2025146484375, 0.011077880859375, 0.0284...
embed
28133780_c0
28133780
lisp
0
Title: How can I load a propertylist from a file in common lisp? Problem title: How can I load a propertylist from a file in common lisp? Tags: lisp, common-lisp Problem: How can I load a propertylist from a file in common lisp? I have a text file containing a list of property lists. The content looks like the followin...
How can I load a propertylist from a file in common lisp? How can I load a propertylist from a file in common lisp? lisp common-lisp a How NOMBREMATERIA LENGUAJES IDMATERIA FIEC01552 CLASES NIL NOTAPROYECTOS HORASSEMESTRE NOTAEXAMENES NOTATAREAS CONTRIBUCION_TAREAS CONTRIBUCION_NOTAPROYECTO CONTRIBUCION_NOTAEXAMEN HERR...
[ 0.0269775390625, 0.006561279296875, 0.00848388671875, 0.0101318359375, -0.003326416015625, 0.00775146484375, -0.00054168701171875, -0.00164031982421875, 0.00604248046875, -0.02099609375, -0.00173187255859375, 0.015869140625, -0.01519775390625, -0.039794921875, -0.00189208984375, 0.0195...
[ 11249, 831, 72367, 57266, 6562, 1295, 11435, 39210, 400, 7008, 10, 4086, 254, 102298, 47512, 110935, 20004, 150230, 129636, 199420, 70171, 182421, 54496, 284, 190770, 126109, 158332, 7986, 5303, 10941, 33342, 1884, 25632, 442, 3934 ]
[ 0.046051025390625, 0.02978515625, 0.1978759765625, 0.1920166015625, 0.259765625, 0.072021484375, 0.1441650390625, 0.1402587890625, 0.10711669921875, 0.17822265625, 0.03759765625, 0.0804443359375, 0.115478515625, 0.002593994140625, 0.03472900390625, 0.038543701171875, 0.03717041015625...
embed
55857349_c1
55857349
lisp
1
function for each key that will return a value: input: (define input `((foo . 10) (bar . 20))) output: (begin (define (foo) 10) (define (bar) 20)) Can I write macro that will give such output if I use (macro input) ? Or the only option is (macro ((foo . 10) (bar . 20))) ? I can accept generic Scheme or Common LISP ans...
function for each key that will return a value: input: (define input `((foo . 10) (bar . 20))) output: (begin (define (foo) 10) (define (bar) 20)) Can I write macro that will give such output if I use (macro input) ? Or the only option is (macro ((foo . 10) (bar . 20))) ? I can accept generic Scheme or Common LISP ans...
[ -0.01611328125, 0.0032196044921875, -0.017822265625, -0.0164794921875, -0.0029296875, 0.0032806396484375, 0.01202392578125, -0.0021820068359375, 0.00022602081298828125, -0.0223388671875, -0.0032196044921875, 0.00537109375, 0.0084228515625, -0.01165771484375, 0.00030517578125, -0.005218...
[ 32354, 100, 12638, 22799, 1221, 30646, 34292, 107730, 112, 64552, 3584, 31, 209, 1299, 387, 140992, 6820, 4171, 33022, 111789, 8337, 6044, 4527, 192, 15322, 4734, 35829, 5, 26946, 189534, 34702, 282, 151301, 16970, 9434, 61924, 12654, 86531, ...
[ 0.2054443359375, 0.04541015625, 0.1431884765625, 0.2330322265625, 0.06707763671875, 0.2039794921875, 0.1875, 0.19921875, 0.053131103515625, 0.166748046875, 0.094482421875, 0.07177734375, 0.16357421875, 0.15234375, 0.15185546875, 0.197509765625, 0.045013427734375, 0.0711669921875, ...
embed
65175133_c0
65175133
lisp
0
Title: How would I write a function in Dr. Racket which consumes a list of 2 possible symbols and replaces them with something else? Problem title: How would I write a function in Dr. Racket which consumes a list of 2 possible symbols and replaces them with something else? Tags: racket, list, lisp Problem: How would I ...
How would I write a function in Dr. Racket which consumes a list of 2 possible symbols and replaces them with something else? How would I write a function in Dr. Racket which consumes a list of 2 possible symbols and replaces them with something else? racket list lisp How Racket How would I write a function in Dr. Rack...
[ -0.0279541015625, 0.01043701171875, 0.006561279296875, 0.02587890625, 0.0101318359375, 0.0223388671875, -0.0294189453125, 0.019775390625, 0.00567626953125, 0.03173828125, 0.00653076171875, -0.0203857421875, 0.010498046875, 0.00457763671875, -0.00421142578125, -0.00982666015625, -0.00...
[ 11249, 2806, 33022, 32354, 1773, 2552, 27853, 18588, 5303, 116, 7722, 26582, 91995, 678, 37076, 673, 400, 7008, 23, 238, 707, 334, 18151, 2060, 4263, 10644, 2646, 104851, 140992, 83, 175399, 44084, 903, 123087, 26785, 69307 ]
[ 0.077392578125, 0.0574951171875, 0.1810302734375, 0.193359375, 0.123291015625, 0.126953125, 0.212158203125, 0.181640625, 0.1385498046875, 0.13623046875, 0.13916015625, 0.2257080078125, 0.1529541015625, 0.0352783203125, 0.049896240234375, 0.0958251953125, 0.054290771484375, 0.139038...
embed
20510148_c0
20510148
lisp
0
Title: something not straightforward for me in CONDLET macro in OnLisp Problem title: something not straightforward for me in CONDLET macro in OnLisp Tags: common-lisp, lisp, macros Problem: something not straightforward for me in CONDLET macro in OnLisp I don't understand the purpose of the 1st LET in condlet-clause b...
something not straightforward for me in CONDLET macro in OnLisp something not straightforward for me in CONDLET macro in OnLisp common-lisp lisp macros CONDLET OnLisp something not straightforward for me in CONDLET macro in OnLisp I don't understand the purpose of the 1st LET in condlet-clause below. Is this necessary ...
[ -0.00482177734375, 0.015380859375, 0.0016326904296875, 0.0028839111328125, -0.00982666015625, 0.004486083984375, 0.0159912109375, -0.0086669921875, 0.003173828125, -0.0162353515625, -0.0235595703125, 0.017822265625, 0.00872802734375, 0.00141143798828125, 0.0224609375, -0.01220703125, ...
[ 9844, 959, 80560, 2472, 19364, 100, 163, 14452, 397, 27089, 111789, 2161, 9506, 7008, 39210, 4086, 254, 400, 18, 28219, 60042, 106, 271, 158, 71, 1974, 18347, 4032, 35064, 903, 63559, 61924, 29458, 34292, 3688, 159978, 4000, 77336, 64457, ...
[ 0.06402587890625, 0.05328369140625, 0.04437255859375, 0.07000732421875, 0.125244140625, 0.031494140625, 0.02362060546875, 0.10394287109375, 0.1317138671875, 0.2493896484375, 0.147705078125, 0.1671142578125, 0.1173095703125, 0.1617431640625, 0.0615234375, 0.03802490234375, 0.080993652...
embed
22306791_c0
22306791
lisp
0
Title: How do I access a class object stored in an array? Problem title: How do I access a class object stored in an array? Tags: lisp, common-lisp, arrays Problem: How do I access a class object stored in an array? So If I have a defclass object and I make an instance of it and place it inside an array. How do I get t...
How do I access a class object stored in an array? How do I access a class object stored in an array? lisp common-lisp arrays How How do I access a class object stored in an array? So If I have a defclass object and I make an instance of it and place it inside an array. How do I get the value of its slots inside the ar...
[ 0.00946044921875, 0.022705078125, 0.0037994384765625, -0.0042724609375, -0.0037689208984375, 0.009765625, -0.01141357421875, 0.0146484375, 0.006591796875, -0.022216796875, -0.022705078125, -0.0013580322265625, 0.00604248046875, -0.0101318359375, 0.003875732421875, -0.031005859375, -0...
[ 11249, 54, 87, 17203, 18507, 36746, 4343, 71, 23, 10298, 53, 142, 400, 7008, 39210, 4086, 254, 4778, 8, 420, 67413, 3249, 110527, 3687, 46132, 2046, 34292, 111, 6863, 121892, 37842, 100094, 3642, 83, 28412, 51, 39116, 3173, 51727, 808, ...
[ 0.07672119140625, 0.030792236328125, 0.01220703125, 0.21435546875, 0.235595703125, 0.190185546875, 0.16064453125, 0.072509765625, 0.114990234375, 0.167724609375, 0.1573486328125, 0.0218658447265625, 0.0826416015625, 0.1728515625, 0.09765625, 0.080322265625, 0.1610107421875, 0.08740...
embed
22481672_c0
22481672
lisp
0
Title: Connection sub-lists in LISP in one big list Problem title: Connection sub-lists in LISP in one big list Tags: recursion, lisp Problem: Connection sub-lists in LISP in one big list I am new to lisp and I am trying to code a function that will turn a list with sub-lists such as (1 2 (3 (4)) 5) in to a list like t...
Connection sub-lists in LISP in one big list Connection sub-lists in LISP in one big list recursion lisp Connection LISP Func1 CAR CDR CONS Connection sub-lists in LISP in one big list I am new to lisp and I am trying to code a function that will turn a list with sub-lists such as (1 2 (3 (4)) 5) in to a list like this...
[ -0.00531005859375, 0.029296875, 0.0126953125, 0.00010776519775390625, -0.00439453125, 0.02685546875, -0.007354736328125, 0.0021209716796875, 0.00061798095703125, -0.022216796875, 0.01397705078125, -0.0299072265625, -0.00146484375, -0.0020294189453125, 0.00457763671875, 0.00582885742187...
[ 62448, 1830, 1614, 6562, 7, 16970, 9434, 23, 1632, 6957, 5303, 195625, 400, 7008, 28670, 418, 42476, 23498, 109022, 31577, 18151, 32354, 15504, 116, 6896, 3971, 21162, 1884, 138, 201, 6528, 3642, 3884, 12989, 35431, 3714, 15549, 17932, 5117...
[ 0.16650390625, 0.0241546630859375, 0.21337890625, 0.2529296875, 0.0252227783203125, 0.1256103515625, 0.202880859375, 0.04638671875, 0.09307861328125, 0.0540771484375, 0.218505859375, 0.1483154296875, 0.0989990234375, 0.18115234375, 0.058868408203125, 0.0289154052734375, 0.15319824218...
embed
60678841_c0
60678841
lisp
0
Title: Simplifying a Racket function Problem title: Simplifying a Racket function Tags: racket, lisp Problem: Simplifying a Racket function I have the following function "change" which takes a certain amount of money to be paid, the size of the bill/coin used to pay, and returns a list with the number of "coins" ($50, ...
Simplifying a Racket function Simplifying a Racket function racket lisp Simplifying Racket Simplifying a Racket function I have the following function "change" which takes a certain amount of money to be paid, the size of the bill/coin used to pay, and returns a list with the number of "coins" ($50, $20 $10 $5 $2 and $...
[ -0.013427734375, -0.00469970703125, -0.002197265625, 0.0211181640625, 0.01214599609375, 0.01202392578125, -0.025390625, 0.003997802734375, 0.0125732421875, 0.00439453125, -0.006561279296875, -0.00726318359375, -0.0172119140625, -0.0008087158203125, 0.0137939453125, 0.00188446044921875,...
[ 55331, 141, 151138, 2552, 27853, 32354, 673, 400, 7008, 25632, 152028, 51776, 24233, 41170, 17265, 47, 72090, 13267, 54727, 587, 73, 11814, 8783, 30646, 5303, 14012, 5425, 2525, 1549, 168404, 147307, 78790, 38629, 2806, 53299, 7103, 21721, 12...
[ 0.1339111328125, 0.1536865234375, 0.1187744140625, 0.1568603515625, 0.259521484375, 0.2010498046875, 0.1329345703125, 0.088623046875, 0.1363525390625, 0.05035400390625, 0.294921875, 0.1173095703125, 0.043792724609375, 0.01171875, 0.10400390625, 0.000946044921875, 0.1588134765625, 0...
embed
33940339_c0
33940339
lisp
0
Title: LISP function always returning nil Problem title: LISP function always returning nil Tags: list, merge, lisp, insert, common-lisp Problem: LISP function always returning nil (defun insert (number lst) (let ((before nil)) (if (= (length lst) 0) (return-from insert (list number))) (loop for n from 0 to (1- (length...
LISP function always returning nil LISP function always returning nil list merge lisp insert common-lisp insert 0 LISP LISP function always returning nil So, I'm trying to insert a number sorted in the list. Forgive for my somehow bad LISP practice, I started learning not much time ago. I'm going through the list and i...
[ -0.020263671875, 0.00811767578125, 0.025146484375, 0.002532958984375, 0.0037994384765625, 0.01129150390625, -0.0126953125, -0.0279541015625, -0.00225830078125, -0.04150390625, 0.00433349609375, 0.000736236572265625, -0.032470703125, -0.01348876953125, 0.00567626953125, 0.0084228515625,...
[ 16970, 9434, 32354, 11343, 30646, 214, 17324, 5303, 42564, 400, 7008, 183540, 39210, 4086, 254, 31577, 14012, 17497, 71, 96259, 6494, 41361, 52080, 80854, 89700, 3444, 40715, 12830, 82424, 23, 114689, 25737, 271, 541, 16444, 25647, 15400, 742...
[ 0.13232421875, 0.228515625, 0.1719970703125, 0.1629638671875, 0.19091796875, 0.0491943359375, 0.2264404296875, 0.1263427734375, 0.1591796875, 0.1043701171875, 0.18994140625, 0.1903076171875, 0.1065673828125, 0.0882568359375, 0.1446533203125, 0.04522705078125, 0.1260986328125, 0.160...
embed
27252085_c0
27252085
lisp
0
Title: Apply a list of functions to a value Problem title: Apply a list of functions to a value Tags: lisp, functional-programming, clojure Problem: Apply a list of functions to a value I'm looking for something that is probably very well defined in Clojure (in the Lisp world at large in fact) but I don't have enough e...
Apply a list of functions to a value Apply a list of functions to a value lisp functional-programming clojure Apply Apply a list of functions to a value I'm looking for something that is probably very well defined in Clojure (in the Lisp world at large in fact) but I don't have enough experience or culture to get on th...
[ -0.00823974609375, 0.00897216796875, -0.01458740234375, 0.018310546875, 0.0015411376953125, 0.00177001953125, -0.004180908203125, 0.005096435546875, 0.018798828125, -0.041259765625, 0.01220703125, 0.026611328125, -0.013671875, 0.017578125, 0.00167083740234375, -0.0179443359375, -0.01...
[ 5659, 538, 5303, 111, 32354, 7, 47, 34292, 10, 400, 7008, 123309, 28966, 20450, 461, 107, 16487, 100, 31895, 61924, 51053, 1261, 8999, 21334, 16981, 29394, 28560, 1815, 98893, 2060, 17262, 8781, 3173, 13538, 50080, 4343, 173, 18770, 2773, ...
[ 0.208984375, 0.127685546875, 0.2003173828125, 0.07122802734375, 0.25, 0.123291015625, 0.1771240234375, 0.263916015625, 0.00372314453125, 0.086669921875, 0.1663818359375, 0.139892578125, 0.0958251953125, 0.1142578125, 0.1593017578125, 0.1214599609375, 0.058197021484375, 0.0188446044...
embed
7934943_c0
7934943
lisp
0
Title: lisp and writing a simple database Problem title: lisp and writing a simple database Tags: database, lisp Problem: lisp and writing a simple database can anyone help me write a simple database? [define database [list [new Album "The White Album" "The Beatles" "Rock"] [new Album "Collected" "Massive Attack" "Bris...
lisp and writing a simple database lisp and writing a simple database database lisp Album White Beatles Rock Collected Massive Attack Bristol Idlewild Outkast Soundtrack lisp and writing a simple database can anyone help me write a simple database? Writing accessors You can access the fields of an album object (call it...
[ 0.01312255859375, 0.026123046875, -0.0201416015625, 0.0247802734375, -0.00787353515625, 0.02099609375, 0.001251220703125, 0.01422119140625, 0.0020904541015625, -0.0047607421875, -0.0108642578125, 0.006988525390625, 0.00494384765625, 0.001495361328125, -0.005218505859375, 0.00341796875,...
[ 400, 7008, 136, 32562, 8781, 63399, 37340, 22392, 130904, 14434, 138521, 3010, 29888, 188515, 194510, 24799, 71908, 38472, 13538, 25911, 42413, 125728, 35672, 4358, 33022, 10, 213185, 17203, 25251, 831, 44457, 7156, 36746, 85763, 54433, 5440, 3...
[ 0.1435546875, 0.2332763671875, 0.0994873046875, 0.240966796875, 0.2421875, 0.277587890625, 0.1634521484375, 0.149658203125, 0.213134765625, 0.1602783203125, 0.1656494140625, 0.0699462890625, 0.08917236328125, 0.215087890625, 0.1571044921875, 0.050811767578125, 0.1153564453125, 0.20...
embed
29907440_c0
29907440
lisp
0
Title: Difference between CDR, CAR and REST, FIRST and possible implementation? Problem title: Difference between CDR, CAR and REST, FIRST and possible implementation? Tags: lisp, cdr, common-lisp, list Problem: Difference between CDR, CAR and REST, FIRST and possible implementation? I'm learning a little bit about fun...
Difference between CDR, CAR and REST, FIRST and possible implementation? Difference between CDR, CAR and REST, FIRST and possible implementation? lisp cdr common-lisp list Difference CDR CAR REST FIRST Difference between CDR, CAR and REST, FIRST and possible implementation? I'm learning a little bit about functional pr...
[ 0.01348876953125, 0.0145263671875, 0.00885009765625, 0.00124359130859375, -0.00006914138793945312, 0.020263671875, 0.00970458984375, 0.0026702880859375, -0.00009965896606445312, -0.0115966796875, 0.0034332275390625, -0.0111083984375, -0.0093994140625, 0.006500244140625, 0.000808715820312...
[ 803, 18234, 6620, 17721, 313, 23498, 42476, 136, 627, 21828, 133907, 8545, 7722, 208124, 400, 7008, 56329, 42, 39210, 4086, 254, 5303, 52080, 123309, 56037, 16970, 9434, 4527, 32354, 149766, 62548, 60212, 6626, 10554, 3642, 54, 155605, 29479,...
[ 0.088134765625, 0.2119140625, 0.1141357421875, 0.098876953125, 0.0751953125, 0.267578125, 0.250732421875, 0.062042236328125, 0.164794921875, 0.20361328125, 0.1480712890625, 0.1806640625, 0.1204833984375, 0.1751708984375, 0.08966064453125, 0.1514892578125, 0.06622314453125, 0.145996...
embed
55603339_c1
55603339
lisp
1
) (3 (7 9 10)), so on the next loop ;second loop (car *cur-level*) = (2 4 (5 (8 11)) 6) (cdr *cur-level*) = (3 (7 9 10)) This means that the tree essentially splits, and (2 4 (5 (8 11)) 6) is ignored. Also, on the same loop, (car cur-level) is not a single element, but a list. Meaning I would need to do: ;still second ...
) (3 (7 9 10)), so on the next loop ;second loop (car *cur-level*) = (2 4 (5 (8 11)) 6) (cdr *cur-level*) = (3 (7 9 10)) This means that the tree essentially splits, and (2 4 (5 (8 11)) 6) is ignored. Also, on the same loop, (car cur-level) is not a single element, but a list. Meaning I would need to do: ;still second ...
[ 0.0035400390625, 0.0205078125, 0.00445556640625, 0.013671875, 0.01422119140625, 0.024658203125, -0.0257568359375, -0.0023193359375, 0.000705718994140625, -0.0218505859375, 0.013427734375, -0.022705078125, -0.005645751953125, -0.00982666015625, -0.000293731689453125, -0.0155029296875, ...
[ 1388, 6896, 19107, 483, 209, 221, 98, 11737, 40956, 191633, 3284, 16820, 67919, 2203, 201, 11516, 17966, 534, 35914, 7569, 77518, 26950, 70, 53201, 85590, 65450, 7, 124962, 5701, 9709, 9, 83, 959, 11001, 12830, 5303, 89733, 17932, 116, 94...
[ 0.0008544921875, 0.1912841796875, 0.104736328125, 0.16162109375, 0.190673828125, 0.0144195556640625, 0.028839111328125, 0.10662841796875, 0.1904296875, 0.126220703125, 0.18896484375, 0.16015625, 0.2139892578125, 0.00885009765625, 0.1478271484375, 0.08819580078125, 0.0462646484375, ...
embed
47611082_c0
47611082
lisp
0
Title: Common-LISP - Subtraction Problem title: Common-LISP - Subtraction Tags: common-lisp, lisp Problem: Common-LISP - Subtraction I have this function: (defun test (variable) (cond ((null variable) nil) ((< (- 12 (other-function variable) 3) 0) 1) (t (- 12 (other-function variable) 3)) ) ) The idea is, if the result...
Common-LISP - Subtraction Common-LISP - Subtraction common-lisp lisp Common-LISP Subtraction Common-LISP - Subtraction I have this function: The idea is, if the result of the subtraction of 12 with the value of the function with 3 is less than 0, it returns 1. Else, it will just make the subtraction. The "other-functio...
[ -0.00994873046875, 0.0126953125, -0.00225830078125, 0.00726318359375, -0.01068115234375, -0.0031890869140625, 0.006805419921875, 0.004180908203125, 0.01202392578125, -0.0194091796875, -0.00640869140625, 0.00110626220703125, -0.01409912109375, 0.00128173828125, 0.016357421875, 0.0200195...
[ 151301, 67616, 683, 8273, 117474, 9, 39210, 4086, 254, 400, 7008, 20, 765, 903, 32354, 6528, 2174, 16750, 1614, 427, 34292, 678, 138, 83, 40715, 757, 30646, 615, 3249, 126340, 137175, 14012, 11675, 18244, 7, 4092, 13105, 15490, 5117, 3543...
[ 0.1568603515625, 0.1544189453125, 0.1773681640625, 0.1810302734375, 0.1732177734375, 0.0197296142578125, 0.09423828125, 0.07025146484375, 0.101318359375, 0.09893798828125, 0.149658203125, 0.005950927734375, 0.004058837890625, 0.0228424072265625, 0.1689453125, 0.0634765625, 0.03198242...
embed
10381438_c0
10381438
lisp
0
Title: LISP - removing an element from a list with nested lists Problem title: LISP - removing an element from a list with nested lists Tags: common-lisp, lisp Problem: LISP - removing an element from a list with nested lists I need to remove an element from a list which contain inner lists inside. The predefined eleme...
LISP - removing an element from a list with nested lists LISP - removing an element from a list with nested lists common-lisp lisp a LISP SETQ Created ELIMINA LISTP CAR CDR LISP - removing an element from a list with nested lists I need to remove an element from a list which contain inner lists inside. The predefined e...
[ -0.01519775390625, 0.041259765625, -0.0184326171875, 0.0169677734375, -0.00274658203125, 0.0216064453125, 0.005828857421875, -0.0020599365234375, 0.0096435546875, -0.0303955078125, 0.00714111328125, -0.002471923828125, -0.00494384765625, 0.00836181640625, 0.0020751953125, 0.00279235839...
[ 16970, 9434, 49146, 6496, 12830, 1295, 5303, 678, 8512, 71, 39210, 4086, 254, 400, 7008, 128565, 2737, 151313, 53692, 168392, 195977, 683, 42476, 23498, 87, 3871, 87388, 70541, 75414, 46132, 1653, 5983, 5608, 184750, 11907, 20697, 25632, 1815...
[ 0.1431884765625, 0.2354736328125, 0.130615234375, 0.0771484375, 0.1741943359375, 0.130615234375, 0.1993408203125, 0.1029052734375, 0.193359375, 0.130859375, 0.09320068359375, 0.113037109375, 0.164306640625, 0.1016845703125, 0.1700439453125, 0.08172607421875, 0.114990234375, 0.01741...
embed
59020952_c0
59020952
lisp
0
Title: Racket language output issue Problem title: Racket language output issue Tags: racket, scheme, lisp Problem: Racket language output issue I am working on an assignment in racket. It looks at a list, does a simple math calculation, then outputs the info from the list. Heres the function that does the outputting. ...
Racket language output issue Racket language output issue racket scheme lisp Racket CMSC201 Section CMSC341 CMSC331 CMSC471 Racket language output issue I am working on an assignment in racket. It looks at a list, does a simple math calculation, then outputs the info from the list. Heres the function that does the outp...
[ 0.0031890869140625, 0.0035247802734375, -0.0037689208984375, 0.0220947265625, -0.01611328125, 0.0019378662109375, -0.00482177734375, 0.010498046875, -0.01025390625, 0.014404296875, 0.01202392578125, -0.033447265625, 0.0111083984375, -0.00072479248046875, -0.006866455078125, -0.00482177...
[ 2552, 27853, 46876, 140992, 31089, 673, 150370, 400, 7008, 113268, 123885, 140978, 8894, 5016, 158222, 20697, 95486, 33342, 99, 5303, 8781, 48909, 74481, 3004, 32354, 468, 12, 3220, 134598, 3249, 9077, 101935, 7440, 39, 41206, 13527, 184, 982...
[ 0.1151123046875, 0.2293701171875, 0.1796875, 0.213134765625, 0.10205078125, 0.0867919921875, 0.112060546875, 0.009521484375, 0.05889892578125, 0.0726318359375, 0.10308837890625, 0.036651611328125, 0.08038330078125, 0.0777587890625, 0.100341796875, 0.03631591796875, 0.0953369140625, ...
embed
15726406_c0
15726406
lisp
0
Title: How do I rewrite (def) out of this Clojure code? Problem title: How do I rewrite (def) out of this Clojure code? Tags: clojure, state, functional-programming, lisp Problem: How do I rewrite (def) out of this Clojure code? I have written a game loop based on deWitter's game loop . However, I am unsure how to tran...
How do I rewrite (def) out of this Clojure code? How do I rewrite (def) out of this Clojure code? clojure state functional-programming lisp How Clojure beepboop.core Updating Displaying System How do I rewrite (def) out of this Clojure code? I have written a game loop based on deWitter's game loop . However, I am unsur...
[ -0.0024871826171875, 0.0130615234375, 0.0137939453125, 0.0028533935546875, 0.0164794921875, 0.0042724609375, -0.0103759765625, 0.006622314453125, -0.0030670166015625, -0.0089111328125, 0.000484466552734375, -0.009033203125, -0.027099609375, 0.01165771484375, 0.01239013671875, 0.0190429...
[ 11249, 54, 87, 456, 434, 18781, 112, 420, 1810, 111, 903, 51053, 461, 107, 18151, 20450, 11341, 123309, 28966, 400, 7008, 186, 4517, 837, 2146, 30854, 10091, 56464, 90045, 12353, 59121, 6712, 40956, 35509, 8, 36119, 3055, 3642, 12302, 47,...
[ 0.07537841796875, 0.0224456787109375, 0.01202392578125, 0.153076171875, 0.1612548828125, 0.1961669921875, 0.1427001953125, 0.174560546875, 0.183349609375, 0.118896484375, 0.0877685546875, 0.16796875, 0.17333984375, 0.1209716796875, 0.1900634765625, 0.1290283203125, 0.1329345703125, ...
embed
1903181_c1
1903181
lisp
1
jm (open woldacad "r")) (while (setq wwz (read-line wwjm)) (write-line wwz wwjm1)) (close wwjm) (close wwjm1)))) (setq lbz 0) (setq wwjqm (strcat dpath "acaddoc.lsp")) (if (setq wwjm (open wwjqm "r")) (progn (repeat 3 (read-line wwjm)) (setq wz (read-line wwjm)) (setq ab (atoi (substr wz 4 1))) (close wwjm) (if (> ab b...
jm (open woldacad "r")) (while (setq wwz (read-line wwjm)) (write-line wwz wwjm1)) (close wwjm) (close wwjm1)))) (setq lbz 0) (setq wwjqm (strcat dpath "acaddoc.lsp")) (if (setq wwjm (open wwjqm "r")) (progn (repeat 3 (read-line wwjm)) (setq wz (read-line wwjm)) (setq ab (atoi (substr wz 4 1))) (close wwjm) (if (> ab b...
[ -0.00537109375, 0.01214599609375, -0.0177001953125, 0.01251220703125, 0.005157470703125, 0.0206298828125, -0.00213623046875, 0.009033203125, 0.0068359375, 0.0137939453125, 0.02587890625, 0.0341796875, 0.002685546875, -0.0252685546875, 0.0033111572265625, -0.0303955078125, -0.00561523...
[ 14466, 15, 59636, 13924, 85, 25426, 42, 16, 204610, 3509, 864, 148, 434, 169, 39116, 2256, 18781, 17727, 155648, 80126, 275, 757, 39, 9297, 4460, 104, 128405, 11, 29713, 5, 7008, 18939, 3190, 75620, 19, 1081, 257, 138, 9, 1563, 2832, ...
[ 0.270751953125, 0.03192138671875, 0.1688232421875, 0.135986328125, 0.10791015625, 0.180419921875, 0.12939453125, 0.01251220703125, 0.2088623046875, 0.1378173828125, 0.1346435546875, 0.057464599609375, 0.110595703125, 0.1171875, 0.13330078125, 0.1563720703125, 0.10107421875, 0.08093...
embed
36511002_c0
36511002
lisp
0
Title: String Comparison in Common Lisp Problem title: String Comparison in Common Lisp Tags: common-lisp, functional-programming, lisp Problem: String Comparison in Common Lisp I am new to Common Lisp and Functional programming in general. I have a function lets call it "wordToNumber", I want it to check if the input ...
String Comparison in Common Lisp String Comparison in Common Lisp common-lisp functional-programming lisp wordToNumber Comparison Common Lisp String Comparison in Common Lisp I am new to Common Lisp and Functional programming in general. I have a function lets call it "wordToNumber", I want it to check if the input str...
[ -0.01470947265625, 0.0004062652587890625, -0.01220703125, 0.0155029296875, -0.002960205078125, 0.0125732421875, 0.0133056640625, 0.00168609619140625, 0.0098876953125, -0.004852294921875, 0.0057373046875, -0.007293701171875, 0.00262451171875, 0.003997802734375, -0.01080322265625, -0.003...
[ 23351, 214, 113307, 40514, 23, 151301, 1261, 7008, 39210, 4086, 254, 123309, 28966, 400, 2565, 7763, 18444, 26278, 3525, 28670, 10763, 56037, 32354, 47416, 3444, 12765, 2174, 107730, 79315, 83, 3630, 55547, 107, 22085, 15205, 4734, 30646, 106...
[ 0.2225341796875, 0.1326904296875, 0.1976318359375, 0.1337890625, 0.0175323486328125, 0.1553955078125, 0.158447265625, 0.1363525390625, 0.10076904296875, 0.0599365234375, 0.0806884765625, 0.1572265625, 0.1229248046875, 0.0821533203125, 0.1231689453125, 0.17822265625, 0.17138671875, ...
embed
27098434_c1
27098434
lisp
1
is gummy-bear machine that has 4 candies, the other is easter-egg machine that has 6 candies. The sample code looks like this: (defvar *gummy-bear* (candy-machine (generate-candy-supply 4))) (defvar *easter-egg* (candy-machine (generate-candy-supply 6))) Sample Run of this program looks like this: [1]> (load 'candy.li...
is gummy-bear machine that has 4 candies, the other is easter-egg machine that has 6 candies. The sample code looks like this: (defvar *gummy-bear* (candy-machine (generate-candy-supply 4))) (defvar *easter-egg* (candy-machine (generate-candy-supply 6))) Sample Run of this program looks like this: [1]> (load 'candy.li...
[ 0.0096435546875, 0.023681640625, -0.0038299560546875, 0.02880859375, 0.00128173828125, 0.0225830078125, -0.00946044921875, 0.017333984375, 0.00738525390625, -0.005218505859375, -0.0017852783203125, -0.03271484375, -0.006866455078125, -0.0289306640625, -0.000621795654296875, 0.008728027...
[ 83, 29204, 1176, 9, 372, 147, 36279, 450, 1556, 201, 831, 34204, 4, 3789, 8394, 1515, 13, 9815, 305, 121413, 18151, 33342, 1884, 903, 1961, 11752, 79647, 53, 103149, 48281, 67, 67565, 538, 32149, 11, 947, 33209, 28398, 1528, 63033, 4086...
[ 0.10235595703125, 0.168212890625, 0.1868896484375, 0.028411865234375, 0.1856689453125, 0.1917724609375, 0.213134765625, 0.036834716796875, 0.0882568359375, 0.1922607421875, 0.1854248046875, 0.1798095703125, 0.0032958984375, 0.1009521484375, 0.1070556640625, 0.1458740234375, 0.0716552...
embed
15029420_c1
15029420
lisp
1
1) (gl:color-material :front :ambient-and-diffuse) (gl:enable :light0 :light1 :lighting :cull-face :depth-test)) (defmethod glut:reshape ((window glut-teapot-window) width height) (gl:viewport 0 0 width height) (gl:matrix-mode :projection) (gl:load-identity) (glu:perspective 50 (/ width height) 0.5 20) (gl:matrix-mode ...
1) (gl:color-material :front :ambient-and-diffuse) (gl:enable :light0 :light1 :lighting :cull-face :depth-test)) (defmethod glut:reshape ((window glut-teapot-window) width height) (gl:viewport 0 0 width height) (gl:matrix-mode :projection) (gl:load-identity) (glu:perspective 50 (/ width height) 0.5 20) (gl:matrix-mode ...
[ -0.00141143798828125, 0.0162353515625, -0.00482177734375, -0.0283203125, -0.004913330078125, -0.00152587890625, -0.003143310546875, 0.0096435546875, -0.0093994140625, 0.0036163330078125, -0.00726318359375, -0.00213623046875, 0.0010223388671875, 0.0026397705078125, -0.01263427734375, 0....
[ 4879, 11016, 12, 46133, 39886, 20549, 149376, 2940, 152462, 4032, 33, 2886, 20016, 2389, 418, 177476, 1010, 1181, 40404, 168867, 6954, 112, 420, 1928, 7352, 167994, 105027, 53347, 9494, 24293, 9, 17615, 7804, 146984, 155955, 22751, 6982, 757,...
[ 0.138671875, 0.15966796875, 0.04803466796875, 0.16015625, 0.20361328125, 0.1722412109375, 0.1746826171875, 0.1051025390625, 0.10498046875, 0.0560302734375, 0.0261077880859375, 0.138671875, 0.1201171875, 0.0758056640625, 0.0300750732421875, 0.1424560546875, 0.09808349609375, 0.11560...
embed
20276398_c0
20276398
lisp
0
Title: Common Lisp; Paradigms of AI Programming examples not working Problem title: Common Lisp; Paradigms of AI Programming examples not working Tags: lisp, common-lisp Problem: Common Lisp; Paradigms of AI Programming examples not working I got Paradigms of Artificial Intelligence Programming because I've read tons o...
Common Lisp; Paradigms of AI Programming examples not working Common Lisp; Paradigms of AI Programming examples not working lisp common-lisp Common Lisp Paradigms Programming Common Lisp; Paradigms of AI Programming examples not working I got Paradigms of Artificial Intelligence Programming because I've read tons of go...
[ 0.0166015625, 0.0201416015625, 0.005889892578125, 0.018310546875, -0.0064697265625, 0.0079345703125, 0.0087890625, -0.0111083984375, -0.004913330078125, -0.03662109375, 0.007415771484375, -0.0174560546875, 0.0205078125, -0.00518798828125, 0.01251220703125, -0.01409912109375, 0.006896...
[ 151301, 1261, 7008, 74, 1720, 4803, 4432, 111, 38730, 27958, 214, 27781, 959, 20697, 400, 39210, 4086, 254, 4163, 231996, 157075, 12301, 124062, 4127, 98865, 11907, 18499, 37842, 17368, 90944, 37486, 136, 18244, 54825, 2861, 87, 31577, 33022,...
[ 0.1776123046875, 0.1895751953125, 0.2109375, 0.0804443359375, 0.1131591796875, 0.1702880859375, 0.080322265625, 0.13330078125, 0.178466796875, 0.165771484375, 0.0447998046875, 0.216064453125, 0.0816650390625, 0.1600341796875, 0.143310546875, 0.1136474609375, 0.141357421875, 0.17834...
embed
56626911_c0
56626911
lisp
0
Title: Writing packages for evaluating logic in Maxima Problem title: Writing packages for evaluating logic in Maxima Tags: common-lisp, lisp, maxima Problem: Writing packages for evaluating logic in Maxima I'm trying to work on some logical equivalence within Maxima and I want to write some custom packages for this. I...
Writing packages for evaluating logic in Maxima Writing packages for evaluating logic in Maxima common-lisp lisp maxima Writing Maxima Writing packages for evaluating logic in Maxima I'm trying to work on some logical equivalence within Maxima and I want to write some custom packages for this. I have experimented a bit...
[ 0.00579833984375, 0.01177978515625, 0.005523681640625, 0.032470703125, -0.01416015625, 0.0162353515625, 0.0194091796875, -0.009033203125, -0.009033203125, -0.021728515625, 0.0052490234375, 0.0299072265625, 0.0027008056640625, -0.021484375, 0.0152587890625, 0.0028076171875, -0.0114135...
[ 213185, 98169, 151575, 214, 62775, 23, 46540, 11, 39210, 4086, 254, 400, 7008, 122200, 4488, 224743, 28032, 33022, 114122, 28007, 55450, 9506, 100270, 1261, 5045, 37515, 4527, 32562, 17914, 1363, 748, 24927, 35572, 35388, 84751, 78, 2676, 116...
[ 0.1773681640625, 0.244873046875, 0.18505859375, 0.0237884521484375, 0.217041015625, 0.021881103515625, 0.219970703125, 0.1640625, 0.0682373046875, 0.1141357421875, 0.17138671875, 0.1072998046875, 0.189453125, 0.186767578125, 0.06689453125, 0.10174560546875, 0.018310546875, 0.106811...
embed
25463763_c0
25463763
lisp
0
Title: Any good way to declare unused variables in destructuring-bind? Problem title: Any good way to declare unused variables in destructuring-bind? Tags: lisp, destructuring, common-lisp, pattern-matching Problem: Any good way to declare unused variables in destructuring-bind? I can't figure, is there any way to put ...
Any good way to declare unused variables in destructuring-bind? Any good way to declare unused variables in destructuring-bind? lisp destructuring common-lisp pattern-matching Any _SNIPPET _TITLE _DESCRIPTION _RESOURCE-ID _VIDEO-ID Any good way to declare unused variables in destructuring-bind? I can't figure, is there...
[ -0.000789642333984375, 0.017333984375, 0.0024871826171875, -0.0167236328125, -0.019287109375, 0.0167236328125, -0.013916015625, -0.0084228515625, 0.006256103515625, 0.00640869140625, 0.001434326171875, -0.0169677734375, 0.0042724609375, 0.0213623046875, -0.005218505859375, 0.0144042968...
[ 4127, 159978, 51, 33740, 77336, 7, 8, 36716, 53089, 89817, 3917, 400, 7008, 39210, 254, 103510, 98753, 28541, 136607, 131514, 69193, 441, 132824, 76234, 27156, 26366, 3884, 1884, 101, 23, 72, 3066, 34292, 29458, 11907, 33022, 123166, 35483, ...
[ 0.029876708984375, 0.1749267578125, 0.09521484375, 0.193359375, 0.2178955078125, 0.047576904296875, 0.1051025390625, 0.1473388671875, 0.150390625, 0.22265625, 0.028472900390625, 0.031280517578125, 0.1341552734375, 0.0151519775390625, 0.095458984375, 0.141357421875, 0.09466552734375, ...
embed
56460389_c0
56460389
lisp
0
Title: In Common Lisp, Is there a performance difference between functions and macros? Problem title: In Common Lisp, Is there a performance difference between functions and macros? Tags: lisp, performance, common-lisp Problem: In Common Lisp, Is there a performance difference between functions and macros? Consider the...
In Common Lisp, Is there a performance difference between functions and macros? In Common Lisp, Is there a performance difference between functions and macros? lisp performance common-lisp Common Lisp CL-USER Evaluation CPU NIL In Common Lisp, Is there a performance difference between functions and macros? Consider the...
[ 0.014404296875, 0.00148773193359375, 0.0084228515625, -0.01043701171875, -0.01507568359375, 0.00787353515625, 0.00159454345703125, -0.015380859375, -0.002593994140625, -0.0263671875, 0.008056640625, 0.007659912109375, -0.006805419921875, -0.006103515625, 0.00390625, -0.0166015625, 0....
[ 360, 151301, 1261, 7008, 2071, 23718, 60212, 17721, 32354, 136, 111789, 7, 10, 400, 39210, 4086, 254, 46323, 1062, 50184, 151228, 86039, 16444, 2685, 80934, 84046, 100094, 16428, 592, 2806, 4271, 56, 3501, 83687, 18151, 14700, 66, 50339, 90...
[ 0.022857666015625, 0.1990966796875, 0.181884765625, 0.2291259765625, 0.015106201171875, 0.2421875, 0.2144775390625, 0.07635498046875, 0.24365234375, 0.0997314453125, 0.25341796875, 0.1041259765625, 0.0272064208984375, 0.11474609375, 0.105224609375, 0.07147216796875, 0.094970703125, ...
embed
10056482_c0
10056482
lisp
0
Title: Web service with Lisp Problem title: Web service with Lisp Tags: web-services, lisp, rest Problem: Web service with Lisp I'm curious about using Lisp to underpin a modern RESTful web service, but given the many variants and implementations, it's difficult to know where to begin. I am certain that there are peopl...
Web service with Lisp Web service with Lisp web-services lisp rest Web Lisp Web service with Lisp I'm curious about using Lisp to underpin a modern RESTful web service, but given the many variants and implementations, it's difficult to know where to begin. I am certain that there are people out there using Lisp for web...
[ -0.002166748046875, 0.03271484375, -0.00004744529724121094, -0.0086669921875, -0.01806640625, 0.02001953125, -0.012939453125, 0.007293701171875, 0.00213623046875, -0.0284423828125, 0.00457763671875, 0.001983642578125, 0.005950927734375, 0.00445556640625, 0.000850677490234375, 0.0032958...
[ 4002, 4516, 678, 1261, 7008, 1467, 22584, 400, 10588, 193844, 17368, 1379, 5128, 5744, 627, 21828, 7844, 5941, 20117, 208124, 34844, 3714, 7440, 9842, 3395, 100, 62548, 86685, 17582, 15969, 1884, 1286, 14947, 11374, 27060, 76, 60347, 112, 8...
[ 0.135009765625, 0.19677734375, 0.1116943359375, 0.22802734375, 0.28076171875, 0.1270751953125, 0.21044921875, 0.1737060546875, 0.2022705078125, 0.109130859375, 0.137451171875, 0.0787353515625, 0.1453857421875, 0.1392822265625, 0.0997314453125, 0.177001953125, 0.1571044921875, 0.029...
embed
60233884_c3
60233884
lisp
3
.0 - COPY-LIST 25 35 0.4 231 2.3 8935 89.4 - SB-KERNEL:SPECIFIER-TYPE 26 33 0.3 314 3.1 8968 89.7 - SB-INT:%INTERN 27 32 0.3 9146 91.5 9000 90.0 - CANDIDATE-NODES 28 31 0.3 31 0.3 9031 90.3 - Code signals: SBCL, symbol1, sybmol2, cpd-identifiers1, cpd-identifiers2, Total, Cumul, Count, Calls, LABELS, SB-IMPL::S, SUBST,...
.0 - COPY-LIST 25 35 0.4 231 2.3 8935 89.4 - SB-KERNEL:SPECIFIER-TYPE 26 33 0.3 314 3.1 8968 89.7 - SB-INT:%INTERN 27 32 0.3 9146 91.5 9000 90.0 - CANDIDATE-NODES 28 31 0.3 31 0.3 9031 90.3 - Code signals: SBCL, symbol1, sybmol2, cpd-identifiers1, cpd-identifiers2, Total, Cumul, Count, Calls, LABELS, SB-IMPL::S, SUBST,...
[ 0.010986328125, -0.007171630859375, -0.0040283203125, 0.0107421875, -0.002532958984375, -0.0098876953125, 0.01422119140625, 0.0135498046875, 0.0179443359375, 0.01104736328125, 0.00311279296875, -0.0137939453125, 0.00689697265625, -0.01422119140625, -0.0078125, -0.00750732421875, -0.0...
[ 6, 5, 2389, 20, 153003, 1723, 9, 195977, 714, 2273, 121254, 140911, 59811, 17853, 5843, 617, 90944, 34324, 120320, 12, 155775, 101868, 12501, 27143, 21907, 1381, 3912, 127089, 138, 2592, 45151, 16028, 382, 181191, 59537, 3949, 186096, 839, ...
[ 0.076416015625, 0.165771484375, 0.23046875, 0.152587890625, 0.215576171875, 0.1915283203125, 0.1109619140625, 0.2666015625, 0.172607421875, 0.1859130859375, 0.164794921875, 0.1790771484375, 0.14892578125, 0.2138671875, 0.209716796875, 0.146484375, 0.275390625, 0.193359375, 0.2275...
embed