Mo7art/Stack2Graph_VD_lisp · Datasets at Hugging Face

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
3172938_c0	3172938	lisp	0	Title: How to install/upgrade Lisp libraries on Debian Problem title: How to install/upgrade Lisp libraries on Debian Tags: debian, common-lisp, lisp, installation Problem: How to install/upgrade Lisp libraries on Debian I recently discovered that some of my favorite libraries have been removed from Debian, e.g., Hunch...	How to install/upgrade Lisp libraries on Debian How to install/upgrade Lisp libraries on Debian debian common-lisp lisp installation How Lisp Debian How to install/upgrade Lisp libraries on Debian I recently discovered that some of my favorite libraries have been removed from Debian, e.g., Hunchentoot : I've looked at ...	[ -0.0026702880859375, 0.0128173828125, -0.00077056884765625, -0.0048828125, -0.0213623046875, -0.0011444091796875, -0.00732421875, -0.011474609375, -0.00213623046875, 0.000446319580078125, 0.0033416748046875, -0.0048828125, 0.00555419921875, 0.00714111328125, 0.009765625, -0.0185546875,...	[ 11249, 47, 20600, 64, 2037, 44286, 1261, 7008, 35773, 10484, 98, 262, 62806, 8, 39210, 4086, 254, 400, 59720, 134053, 40304, 2809, 184750, 1295, 10453, 4834, 188, 818, 151301, 5570, 3917, 134598, 8961, 5036, 831, 6483, 38997, 80383, 184017,...	[ 0.08905029296875, 0.0153350830078125, 0.1680908203125, 0.022003173828125, 0.0977783203125, 0.1461181640625, 0.174072265625, 0.2354736328125, 0.1964111328125, 0.11181640625, 0.021453857421875, 0.1773681640625, 0.2147216796875, 0.122802734375, 0.0955810546875, 0.1373291015625, 0.126098...	embed
55668976_c0	55668976	lisp	0	Title: Why is my code getting stuck in a recursive call when a negative argument gets passed through? Problem title: Why is my code getting stuck in a recursive call when a negative argument gets passed through? Tags: recursion, math, scheme, lisp Problem: Why is my code getting stuck in a recursive call when a negativ...	Why is my code getting stuck in a recursive call when a negative argument gets passed through? Why is my code getting stuck in a recursive call when a negative argument gets passed through? recursion math scheme lisp Why Square1 Why is my code getting stuck in a recursive call when a negative argument gets passed throu...	[ -0.001739501953125, 0.00482177734375, 0.0074462890625, 0.000507354736328125, 0.006805419921875, -0.018798828125, 0.01361083984375, 0.0123291015625, -0.0081787109375, -0.003448486328125, 0.021484375, -0.0238037109375, -0.0277099609375, -0.01495361328125, 0.00885009765625, -0.01452636718...	[ 44084, 83, 18151, 20949, 179933, 23, 195625, 5844, 11782, 3229, 40907, 10750, 115081, 8305, 1830, 48909, 150370, 400, 7008, 68305, 418, 10, 62163, 31577, 29479, 50491, 34702, 282, 51776, 108047, 111, 14012, 15490, 127664, 26168, 8353, 304, 85...	[ 0.103271484375, 0.0264434814453125, 0.1998291015625, 0.060943603515625, 0.223876953125, 0.0653076171875, 0.20849609375, 0.1697998046875, 0.1790771484375, 0.041015625, 0.265380859375, 0.214111328125, 0.056365966796875, 0.12451171875, 0.047943115234375, 0.0814208984375, 0.1280517578125...	embed
65535370_c0	65535370	lisp	0	Title: Count occurrences in lisp Problem title: Count occurrences in lisp Tags: repl-printed-representation, lisp Problem: Count occurrences in lisp I'm trying to make a code in lisp to count occurrences of atoms in a list in lisp. The problem is the code works for all atoms except the atom () , which appears as NIL . ...	Count occurrences in lisp Count occurrences in lisp repl-printed-representation lisp Count NIL list_ Count occurrences in lisp I'm trying to make a code in lisp to count occurrences of atoms in a list in lisp. The problem is the code works for all atoms except the atom () , which appears as NIL . Example in the code: A...	[ 0.0015106201171875, 0.0234375, 0.010498046875, 0.007293701171875, -0.0035400390625, 0.007476806640625, 0.00494384765625, -0.00238037109375, 0.0015716552734375, -0.0262451171875, -0.0174560546875, -0.0098876953125, 0.03515625, 0.0081787109375, 0.01239013671875, -0.004913330078125, -0....	[ 108210, 74918, 42, 69098, 23, 400, 7008, 2424, 35662, 205913, 541, 16444, 5303, 454, 31577, 18151, 54529, 34627, 7, 2967, 43240, 100, 756, 40494, 15, 135179, 89536, 6528, 7639, 43257 ]	[ 0.1942138671875, 0.176025390625, 0.1558837890625, 0.10455322265625, 0.08038330078125, 0.12890625, 0.2080078125, 0.10272216796875, 0.039459228515625, 0.1466064453125, 0.0980224609375, 0.1927490234375, 0.1666259765625, 0.00036525726318359375, 0.01508331298828125, 0.1478271484375, 0.176...	embed
26196695_c0	26196695	lisp	0	Title: Problems with langutil in Common Lisp - how to tokenize a file Problem title: Problems with langutil in Common Lisp - how to tokenize a file Tags: tokenize, nlp, lisp, common-lisp Problem: Problems with langutil in Common Lisp - how to tokenize a file I've been trying to tokenize a string using the langutils lib...	Problems with langutil in Common Lisp - how to tokenize a file Problems with langutil in Common Lisp - how to tokenize a file tokenize nlp lisp common-lisp Problems Common Lisp cl-utilities:split-sequence Space hello.txt Hello John Doe LANGUTILS-TOKENIZE:TOKENIZE-FILE NIL HASH-TABLE Problems with langutil in Common Lis...	[ 0.013427734375, 0.009765625, -0.005401611328125, 0.0031890869140625, -0.02099609375, -0.005706787109375, 0.00372314453125, -0.001739501953125, -0.0233154296875, -0.0242919921875, 0.0084228515625, 0.01531982421875, -0.002838134765625, -0.0189208984375, 0.001861572265625, -0.001838684082...	[ 15649, 678, 1937, 34, 3675, 151301, 1261, 7008, 3642, 47, 1098, 20650, 11435, 26775, 400, 39210, 4086, 254, 33139, 87738, 4353, 944, 43045, 33600, 31, 124326, 35378, 4939, 984, 13, 73386, 93133, 19759, 72071, 67609, 19157, 919, 52099, 541, ...	[ 0.15576171875, 0.05572509765625, 0.08441162109375, 0.07220458984375, 0.1802978515625, 0.1844482421875, 0.1544189453125, 0.155029296875, 0.0439453125, 0.097900390625, 0.1883544921875, 0.10791015625, 0.1925048828125, 0.0860595703125, 0.054931640625, 0.09710693359375, 0.1151123046875, ...	embed
9306406_c0	9306406	lisp	0	Title: Generate Permutations of a List Problem title: Generate Permutations of a List Tags: scheme, permutation, lisp Problem: Generate Permutations of a List I'm writing a function that takes a list and returns a list of permutations of the argument. I know how to do it by using a function that removes an element and ...	Generate Permutations of a List Generate Permutations of a List scheme permutation lisp Generate Permutations List Generate Permutations of a List I'm writing a function that takes a list and returns a list of permutations of the argument. I know how to do it by using a function that removes an element and then recursi...	[ -0.004974365234375, 0.02001953125, 0.00689697265625, 0.0019073486328125, -0.01348876953125, 0.0260009765625, -0.049072265625, -0.0250244140625, -0.01007080078125, -0.052734375, -0.005859375, -0.01068115234375, 0.01904296875, 0.0045166015625, -0.00946044921875, 0.0201416015625, -0.004...	[ 155370, 67, 908, 14311, 21094, 111, 10, 32036, 150370, 117, 561, 22062, 400, 7008, 32562, 32354, 51776, 5303, 30646, 10750, 3714, 3642, 87388, 12830, 195625, 4527, 139392, 756, 2967, 3444, 25632, 183540, 35735, 3934, 11907, 7722, 31913, 1221,...	[ 0.223876953125, 0.10595703125, 0.1600341796875, 0.269287109375, 0.1611328125, 0.0928955078125, 0.0202789306640625, 0.225341796875, 0.1749267578125, 0.1658935546875, 0.211669921875, 0.0841064453125, 0.1085205078125, 0.17822265625, 0.102294921875, 0.1693115234375, 0.056640625, 0.2324...	embed
27468541_c0	27468541	lisp	0	Title: LISP binary trees - max depth Problem title: LISP binary trees - max depth Tags: tree, lisp, common-lisp Problem: LISP binary trees - max depth Using this way of representing trees: (A (B) (C (D) (E))) (which, from what I've seen I think it's the standard way, but I might be wrong). A / \ B C / \ D E I want to f...	LISP binary trees - max depth LISP binary trees - max depth tree lisp common-lisp LISP LISP binary trees - max depth Using this way of representing trees: (A (B) (C (D) (E))) (which, from what I've seen I think it's the standard way, but I might be wrong). I want to find the maximum depth and construct a list with the ...	[ 0.02783203125, 0.0272216796875, 0.005950927734375, 0.010009765625, 0.00213623046875, 0.03515625, -0.021728515625, 0.01055908203125, 0.0033721923828125, -0.042724609375, -0.00543212890625, -0.021728515625, 0.00125885009765625, 0.002716064453125, 0.01904296875, -0.001983642578125, 0.00...	[ 16970, 9434, 2394, 6635, 1360, 18389, 168867, 90, 53201, 400, 7008, 39210, 4086, 254, 903, 3917, 33636, 284, 571, 441, 397, 647, 5570, 13648, 44691, 3444, 7413, 38132, 64549, 5303, 110, 988, 1295, 74855, 47, 17366, 27781, 35166, 116, 98, ...	[ 0.118408203125, 0.203857421875, 0.166259765625, 0.08197021484375, 0.1925048828125, 0.203125, 0.3154296875, 0.03375244140625, 0.20654296875, 0.1141357421875, 0.174072265625, 0.10382080078125, 0.0924072265625, 0.1416015625, 0.007720947265625, 0.0498046875, 0.163330078125, 0.045989990...	embed
5382364_c0	5382364	lisp	0	Title: LISP: Help reading input stream (with spaces) into a list of characters Problem title: LISP: Help reading input stream (with spaces) into a list of characters Tags: lisp, common-lisp Problem: LISP: Help reading input stream (with spaces) into a list of characters I am attempting to write a program whereby I need...	LISP: Help reading input stream (with spaces) into a list of characters LISP: Help reading input stream (with spaces) into a list of characters lisp common-lisp LISP Help Space LISP: Help reading input stream (with spaces) into a list of characters I am attempting to write a program whereby I need to process a string c...	[ 0.00238037109375, -0.0004520416259765625, 0.00921630859375, 0.0079345703125, 0.00180816650390625, 0.0191650390625, 0.01470947265625, -0.0087890625, 0.00469970703125, -0.01806640625, 0.0172119140625, -0.0234375, -0.0205078125, -0.006378173828125, -0.00616455078125, 0.01031494140625, 0...	[ 16970, 9434, 12, 39527, 16454, 107730, 75973, 76228, 32628, 7, 16, 3934, 5303, 111, 124850, 400, 7008, 39210, 4086, 254, 43045, 81887, 33022, 10, 1528, 3871, 9433, 79315, 62816, 9, 1272, 9254, 2263, 720, 4, 26719, 35011, 65421, 186, 34475...	[ 0.15478515625, 0.243408203125, 0.045684814453125, 0.1484375, 0.1951904296875, 0.15673828125, 0.193359375, 0.049560546875, 0.210693359375, 0.005706787109375, 0.0968017578125, 0.05194091796875, 0.1475830078125, 0.00494384765625, 0.19091796875, 0.13330078125, 0.1929931640625, 0.103210...	embed
43270232_c0	43270232	lisp	0	Title: Step Eval Common Lisp Problem title: Step Eval Common Lisp Tags: common-lisp, lisp Problem: Step Eval Common Lisp I have been trying to find a method to do a "step" eval. Where I call the a function and it evaluates the most nested list for common lisp. For example: '(+ 2 (+ 3 4)) ; would eval to: '(+ 2 7) In th...	Step Eval Common Lisp Step Eval Common Lisp common-lisp lisp Step Eval Common Lisp Step Eval Common Lisp I have been trying to find a method to do a "step" eval. Where I call the a function and it evaluates the most nested list for common lisp. For example: In that example it just evaluated 3 + 4 and stopped right ther...	[ -0.0050048828125, 0.0159912109375, 0.004608154296875, 0.010498046875, -0.003448486328125, 0.0257568359375, 0.01513671875, -0.0203857421875, 0.0098876953125, -0.041748046875, -0.00689697265625, 0.006561279296875, 0.003509521484375, 0.004791259765625, 0.006591796875, -0.004486083984375, ...	[ 50478, 241, 1405, 151301, 1261, 7008, 39210, 4086, 254, 400, 31577, 7413, 55300, 54, 95528, 28, 11782, 32354, 151575, 2684, 8512, 71, 5303, 27781, 1660, 138, 997, 201, 118066, 2685, 959, 21342, 361, 3638, 3444, 18151, 15490, 28271, 9, 209...	[ 0.248779296875, 0.1243896484375, 0.256103515625, 0.1361083984375, 0.129150390625, 0.145263671875, 0.14208984375, 0.080322265625, 0.06793212890625, 0.1077880859375, 0.0047607421875, 0.0848388671875, 0.08587646484375, 0.0238800048828125, 0.263916015625, 0.127197265625, 0.01972961425781...	embed
77090618_c0	77090618	lisp	0	Title: What's the difference between (mymacro arg) and (eval (myfunc (quote arg))) Problem title: What's the difference between (mymacro arg) and (eval (myfunc (quote arg))) Tags: eval, lisp, macros Problem: What's the difference between (mymacro arg) and (eval (myfunc (quote arg))) The way I 'see' macros in ...	What's the difference between (mymacro arg) and (eval (myfunc (quote arg))) What's the difference between (mymacro arg) and (eval (myfunc (quote arg))) eval lisp macros What arg1 arg2 BODY ARG What's the difference between (mymacro arg) and (eval (myfunc (quote arg))) The way I 'see' macros in Lisp is the fol...	[ 0.0174560546875, 0.0225830078125, -0.007537841796875, -0.0025787353515625, -0.005645751953125, 0.00982666015625, 0.01708984375, -0.0062255859375, 0.01104736328125, -0.00004601478576660156, -0.012451171875, -0.0014190673828125, 0.0009765625, -0.012939453125, 0.0130615234375, -0.02233886...	[ 3768, 60212, 17721, 1176, 192, 15322, 79459, 136, 13, 1405, 16498, 238, 68726, 28, 400, 7008, 111789, 418, 304, 335, 181668, 48802, 70, 3917, 21231, 7, 1261, 217684, 1957, 11782, 19, 41591, 5701, 10461, 759, 32354, 14361, 66161, 100094, 2...	[ 0.03558349609375, 0.2017822265625, 0.07708740234375, 0.157958984375, 0.0712890625, 0.207275390625, 0.2264404296875, 0.074951171875, 0.08642578125, 0.260986328125, 0.210205078125, 0.07257080078125, 0.1318359375, 0.069091796875, 0.11376953125, 0.21240234375, 0.20166015625, 0.05261230...	embed
3817063_c0	3817063	lisp	0	Title: Struggling with common lisp libraries Problem title: Struggling with common lisp libraries Tags: common-lisp, scheme, lisp Problem: Struggling with common lisp libraries I've learned scheme and quickly mastered a lot of it, then did a project in it just fine. Literally took me days to finish. I'm now trying to l...	Struggling with common lisp libraries Struggling with common lisp libraries common-lisp scheme lisp Struggling Struggling with common lisp libraries I've learned scheme and quickly mastered a lot of it, then did a project in it just fine. Literally took me days to finish. I'm now trying to learn common lisp to get a fe...	[ -0.01470947265625, 0.0012664794921875, -0.0230712890625, 0.0062255859375, -0.0308837890625, 0.009033203125, -0.0098876953125, -0.004058837890625, 0.015380859375, -0.034912109375, -0.0177001953125, -0.0113525390625, -0.0047607421875, 0.02001953125, 0.0034332275390625, -0.0240478515625, ...	[ 63667, 9815, 2069, 678, 39210, 400, 7008, 35773, 4086, 254, 150370, 10484, 97384, 69405, 31347, 5915, 442, 13452, 5885, 135940, 34739, 13312, 67229, 31577, 30698, 12319, 6183, 237875, 237, 71, 420, 37202, 51359, 3642, 4527, 961, 4902, 2684, ...	[ 0.1322021484375, 0.117431640625, 0.06768798828125, 0.177490234375, 0.156982421875, 0.155517578125, 0.2005615234375, 0.216552734375, 0.143798828125, 0.170654296875, 0.2001953125, 0.1060791015625, 0.062408447265625, 0.04449462890625, 0.05657958984375, 0.0513916015625, 0.04876708984375,...	embed
52962046_c0	52962046	lisp	0	Title: Fill a list in a do loop returns the list empty Problem title: Fill a list in a do loop returns the list empty Tags: scheme, lisp, racket Problem: Fill a list in a do loop returns the list empty I'm learning Racket and I don't know why lst is always empty: #lang racket (define sort-asc-by-second (lambda (lst) (s...	Fill a list in a do loop returns the list empty Fill a list in a do loop returns the list empty scheme lisp racket Fill Fill a list in a do loop returns the list empty I'm learning Racket and I don't know why lst is always empty: I want to modify the lst list inside the do, but it doesn't. Do you know why lst is empty?...	[ 0.00897216796875, 0.0042724609375, 0.0032806396484375, 0.007568359375, -0.01318359375, 0.021728515625, -0.00095367431640625, -0.0064697265625, 0.00604248046875, 0.006805419921875, 0.01202392578125, -0.00933837890625, -0.0181884765625, -0.01153564453125, 0.01043701171875, 0.012756347656...	[ 140423, 5303, 23, 54, 40956, 30646, 201505, 150370, 400, 7008, 673, 27853, 52080, 2552, 3714, 15400, 96, 271, 83, 11343, 2811, 40383, 46132, 22027, 18, 3034, 167934 ]	[ 0.18896484375, 0.2034912109375, 0.050262451171875, 0.129638671875, 0.1876220703125, 0.123046875, 0.22216796875, 0.118896484375, 0.045074462890625, 0.11181640625, 0.07452392578125, 0.171875, 0.03924560546875, 0.058837890625, 0.0103759765625, 0.06585693359375, 0.04248046875, 0.134155...	embed
38992281_c1	38992281	lisp	1	attached at the end of this post Each car of the consed pair representing the content and the cdr representing the section - which will corresponding to a section, sub-section or a question etc., STEP-2: Finally I need to convert this into the following format - an alist - ((:QANDA . "Test") (:VERSION . "0.1") (:DATE ...	attached at the end of this post Each car of the consed pair representing the content and the cdr representing the section - which will corresponding to a section, sub-section or a question etc., STEP-2: Finally I need to convert this into the following format - an alist - ((:QANDA . "Test") (:VERSION . "0.1") (:DATE ...	[ -0.000782012939453125, 0.0230712890625, -0.01409912109375, 0.01519775390625, -0.0042724609375, 0.0181884765625, -0.0216064453125, 0.019775390625, 0.0036468505859375, -0.0211181640625, -0.0047607421875, 0.0244140625, 0.007232666015625, 0.0047607421875, -0.002044677734375, 0.007781982421...	[ 220642, 99, 70, 3564, 903, 1305, 98423, 2258, 111, 158, 5281, 80836, 33636, 10941, 136, 56329, 42, 214, 40059, 1221, 42518, 1614, 7, 58994, 707, 9655, 3021, 5, 4, 185567, 5428, 201106, 87, 3871, 47, 96760, 3934, 25632, 9384, 142, 10, ...	[ 0.164306640625, 0.01629638671875, 0.0145721435546875, 0.07080078125, 0.115234375, 0.042327880859375, 0.115234375, 0.2457275390625, 0.03631591796875, 0.1265869140625, 0.16259765625, 0.1800537109375, 0.1824951171875, 0.172607421875, 0.011505126953125, 0.109130859375, 0.1956787109375, ...	embed
3623101_c0	3623101	lisp	0	Title: How to extend emacs lisp mode with indentation changes and color changes Problem title: How to extend emacs lisp mode with indentation changes and color changes Tags: lisp, emacs, elisp Problem: How to extend emacs lisp mode with indentation changes and color changes Im making a DSL in lisp (basically what i thi...	How to extend emacs lisp mode with indentation changes and color changes How to extend emacs lisp mode with indentation changes and color changes lisp emacs elisp How goby.el Goby Major How to extend emacs lisp mode with indentation changes and color changes Im making a DSL in lisp (basically what i think is a nicer sy...	[ -0.000797271728515625, 0.0030670166015625, -0.0213623046875, 0.00518798828125, -0.00848388671875, 0.01263427734375, -0.010986328125, 0.01361083984375, -0.006988525390625, 0.00604248046875, 0.015869140625, 0.00872802734375, -0.0189208984375, 0.000018596649169921875, 0.0022735595703125, ...	[ 11249, 47, 65042, 352, 2263, 7, 400, 7008, 13736, 678, 18597, 22062, 65572, 136, 10576, 15296, 738, 1272, 583, 2016, 49953, 20662, 114479, 23, 10443, 86531, 5701, 12921, 58460, 110, 959, 162, 2633, 15549, 102158, 3564, 5, 519, 21543, 4086...	[ 0.076904296875, 0.0286712646484375, 0.220703125, 0.0819091796875, 0.1602783203125, 0.0994873046875, 0.137939453125, 0.198974609375, 0.1805419921875, 0.0595703125, 0.173095703125, 0.100830078125, 0.182861328125, 0.0369873046875, 0.13671875, 0.021240234375, 0.091064453125, 0.17675781...	embed
12779621_c0	12779621	lisp	0	Title: Are the video lectures worth watching if I plan to go through the whole SICP book Problem title: Are the video lectures worth watching if I plan to go through the whole SICP book Tags: scheme, lisp, sicp Problem: Are the video lectures worth watching if I plan to go through the whole SICP book After I began to f...	Are the video lectures worth watching if I plan to go through the whole SICP book Are the video lectures worth watching if I plan to go through the whole SICP book scheme lisp sicp SICP Are the video lectures worth watching if I plan to go through the whole SICP book After I began to follow the "Functional Programming ...	[ 0.01806640625, 0.01611328125, -0.01104736328125, -0.003814697265625, -0.0184326171875, -0.00421142578125, 0.004791259765625, -0.00848388671875, -0.00537109375, -0.0302734375, 0.0014190673828125, -0.0274658203125, 0.0004711151123046875, -0.01080322265625, -0.005859375, -0.00393676757812...	[ 1202, 59619, 7, 41965, 100244, 1774, 8305, 28271, 159, 198993, 12877, 150370, 400, 7008, 26536, 254, 97249, 10763, 27958, 79680, 23, 152653, 11, 15411, 219, 58269, 31986, 31, 128169, 76319, 191722, 67229, 81979, 15969, 24626, 4772, 113140, 16...	[ 0.2132568359375, 0.2110595703125, 0.031829833984375, 0.1363525390625, 0.1907958984375, 0.08599853515625, 0.0196685791015625, 0.0479736328125, 0.0855712890625, 0.18701171875, 0.1048583984375, 0.093505859375, 0.00048828125, 0.0670166015625, 0.04443359375, 0.046722412109375, 0.079345703...	embed
56853321_c0	56853321	lisp	0	Title: How to create a bidirectional binary stream in Common Lisp? Problem title: How to create a bidirectional binary stream in Common Lisp? Tags: lisp, common-lisp Problem: How to create a bidirectional binary stream in Common Lisp? I read How to create a binary stream (not a file) in Common Lisp? , and it describes ...	How to create a bidirectional binary stream in Common Lisp? How to create a bidirectional binary stream in Common Lisp? lisp common-lisp How Common Lisp flexi-streams:make-in-memory-input-stream flexi-streams:make-in-memory-output-stream lisp-binary:write-float lisp-binary:read-binary-type How to create a bidirectional...	[ -0.01190185546875, 0.023193359375, -0.01806640625, -0.004913330078125, 0.004241943359375, 0.00946044921875, 0.00885009765625, -0.0115966796875, 0.01312255859375, -0.01019287109375, 0.01129150390625, -0.005767822265625, 0.020263671875, 0.0198974609375, 0.01312255859375, -0.0025787353515...	[ 11249, 28282, 333, 80581, 110117, 2394, 6635, 75973, 151301, 1261, 7008, 47, 23, 400, 39210, 4086, 254, 44289, 14, 86429, 55898, 73, 109005, 53, 6056, 19155, 1294, 434, 18781, 52347, 39116, 50986, 10869, 11435, 3642, 1284, 959, 81887, 35978...	[ 0.059417724609375, 0.160400390625, 0.1807861328125, 0.1591796875, 0.093017578125, 0.187744140625, 0.141845703125, 0.2437744140625, 0.1754150390625, 0.1622314453125, 0.183349609375, 0.011871337890625, 0.04315185546875, 0.09716796875, 0.0989990234375, 0.0880126953125, 0.1104736328125, ...	embed
66130944_c0	66130944	lisp	0	Title: How to modify list inside a function Problem title: How to modify list inside a function Tags: lisp, common-lisp Problem: How to modify list inside a function (defun list-parser (list count) ...);;this function reads items by count from list and do some process to them. ;;i.e.convert items read from code to char...	How to modify list inside a function How to modify list inside a function lisp common-lisp list code How i.e.convert Also objtype-2 slot-1 objtype-1 slot-2 slot-3 slot-4 How to modify list inside a function How to let it work like this:(read-list just works like read-byte in some way: 1.return a value read(and parsed h...	[ 0.00286865234375, 0.018798828125, 0.0091552734375, 0.01129150390625, 0.0137939453125, 0.0026702880859375, -0.00946044921875, 0.01806640625, 0.0172119140625, -0.00162506103515625, -0.01190185546875, -0.0302734375, 0.020751953125, -0.00579833984375, 0.0098876953125, -0.01226806640625, ...	[ 11249, 47, 2811, 40383, 5303, 46132, 32354, 400, 7008, 39210, 4086, 254, 18151, 2271, 11549, 995, 170, 50986, 5428, 24897, 5759, 8316, 11565, 2633, 4488, 1884, 903, 39116, 6562, 43240, 12301, 61028, 65395, 10, 34292, 366, 5281, 3688, 152028...	[ 0.08038330078125, 0.06939697265625, 0.182373046875, 0.195068359375, 0.2548828125, 0.19921875, 0.2203369140625, 0.123779296875, 0.201171875, 0.137451171875, 0.1142578125, 0.18505859375, 0.13720703125, 0.0386962890625, 0.14892578125, 0.0989990234375, 0.0657958984375, 0.1724853515625,...	embed
63827368_c0	63827368	lisp	0	Title: Scheme: Iterative process to reconstruct a list in original order? Problem title: Scheme: Iterative process to reconstruct a list in original order? Tags: lisp, list, functional-programming, scheme, tail-call-optimization Problem: Scheme: Iterative process to reconstruct a list in original order? My question is:...	Scheme: Iterative process to reconstruct a list in original order? Scheme: Iterative process to reconstruct a list in original order? lisp list functional-programming scheme tail-call-optimization Scheme Iterative Scheme: Iterative process to reconstruct a list in original order? My question is: how to write a procedur...	[ 0.0037384033203125, 0.022216796875, 0.000946044921875, 0.031982421875, -0.0093994140625, 0.018310546875, -0.0017547607421875, -0.0096435546875, 0.00119781494140625, -0.01251220703125, 0.008056640625, -0.02392578125, 0.002899169921875, -0.0005645751953125, 0.005615234375, 0.019409179687...	[ 34702, 282, 87, 720, 45023, 9433, 47, 44188, 36716, 5303, 23, 7311, 12989, 400, 7008, 123309, 28966, 150370, 46741, 85763, 100433, 10, 3642, 33022, 50491, 95601, 64549, 959, 39531, 184, 27781, 8781, 17, 28282, 43658, 2967, 4743, 80854, 158,...	[ 0.1929931640625, 0.152099609375, 0.0775146484375, 0.2052001953125, 0.2032470703125, 0.1708984375, 0.047576904296875, 0.145263671875, 0.1881103515625, 0.238525390625, 0.1181640625, 0.1553955078125, 0.221435546875, 0.040771484375, 0.1114501953125, 0.0906982421875, 0.074462890625, 0.1...	embed
10347634_c0	10347634	lisp	0	Title: Universal Func<> type in c# Problem title: Universal Func<> type in c# Tags: c%23, functional-programming, lisp Problem: Universal Func<> type in c# I'm writing a small Lisp interpreter in C#, and it's basically working already. Currently I'm using an interface to represent functions: public interfac...	Universal Func<> type in c# Universal Func<> type in c# c%23 functional-programming lisp Universal Func LispFunction Apply ArrayList Lisp foo.GlobalEnvironment.AddFunction foo.Eval foo.Read Should Universal Func<> type in c# I'm writing a small Lisp interpreter in C#, and it's basically working already. Cur...	[ 0.007232666015625, 0.03369140625, 0.00072479248046875, -0.0205078125, -0.0247802734375, -0.011474609375, 0.005889892578125, -0.00433349609375, 0.00156402587890625, -0.02099609375, 0.0023040771484375, -0.040283203125, -0.01171875, -0.012939453125, 0.01483154296875, 0.007415771484375, ...	[ 53900, 28670, 238, 5386, 10644, 23, 501, 4904, 3742, 123309, 28966, 400, 7008, 1261, 97249, 10763, 5659, 69253, 154663, 5775, 31, 162080, 686, 1900, 4028, 1405, 31345, 151117, 32562, 19336, 29481, 56, 313, 198343, 20697, 21771, 17368, 101758,...	[ 0.2275390625, 0.2171630859375, 0.148681640625, 0.02874755859375, 0.22216796875, 0.1163330078125, 0.06622314453125, 0.218505859375, 0.050262451171875, 0.156494140625, 0.10174560546875, 0.1295166015625, 0.1856689453125, 0.159912109375, 0.1932373046875, 0.00201416015625, 0.0762329101562...	embed
56954725_c0	56954725	lisp	0	Title: Set and Reset of System Variables - AutoCAD LISP Problem title: Set and Reset of System Variables - AutoCAD LISP Tags: autocad-plugin, autocad, autolisp, lisp Problem: Set and Reset of System Variables - AutoCAD LISP I'm trying to make drawing wiring diagrams extremely easy in AutoCAD with next to no button pres...	Set and Reset of System Variables - AutoCAD LISP Set and Reset of System Variables - AutoCAD LISP autocad-plugin autocad autolisp lisp Set Reset System Variables AutoCAD LISP PLINE var1 C:wire Audio Video Comm Coax Control LAYER PAUSE NETWORK POWER Progn Set and Reset of System Variables - AutoCAD LISP I'm trying to ma...	[ -0.003631591796875, 0.0216064453125, -0.023193359375, 0.0111083984375, -0.017822265625, 0.0177001953125, -0.007781982421875, 0.00970458984375, 0.006439208984375, 0.016357421875, 0.004852294921875, 0.04052734375, -0.006439208984375, -0.0213623046875, -0.0093994140625, -0.00830078125, ...	[ 19943, 136, 9624, 126, 111, 12353, 111477, 13566, 4396, 85427, 16970, 9434, 1809, 25426, 145301, 4086, 254, 400, 7008, 436, 57339, 285, 418, 17084, 32134, 2692, 3288, 1311, 14263, 27131, 137990, 11107, 8574, 91227, 31577, 188304, 1439, 214, ...	[ 0.1856689453125, 0.10650634765625, 0.1640625, 0.137451171875, 0.081298828125, 0.1767578125, 0.2276611328125, 0.1732177734375, 0.10986328125, 0.2197265625, 0.1583251953125, 0.1976318359375, 0.064453125, 0.1405029296875, 0.10223388671875, 0.06988525390625, 0.106689453125, 0.101440429...	embed
1249991_c0	1249991	lisp	0	Title: Variable references in lisp Problem title: Variable references in lisp Tags: lisp, common-lisp Problem: Variable references in lisp Another newbie (Common) LISP question: Basically in most programming languages there's a mean for functions to receive references to variables instead of just values, that is, passi...	Variable references in lisp Variable references in lisp lisp common-lisp Variable Variable references in lisp Another newbie (Common) LISP question: Basically in most programming languages there's a mean for functions to receive references to variables instead of just values, that is, passing by reference instead of pa...	[ 0.022705078125, 0.0235595703125, -0.012451171875, 0.01470947265625, 0.01080322265625, -0.00152587890625, -0.02294921875, 0.0019683837890625, -0.007537841796875, -0.0286865234375, -0.005767822265625, 0.017333984375, 0.004669189453125, 0.0240478515625, 0.030517578125, 0.002838134765625, ...	[ 84572, 2886, 91067, 7, 400, 7008, 23, 39210, 4086, 254, 9014, 10770, 3796, 16970, 9434, 2684, 56037, 46876, 29459, 32354, 53299, 47, 77336, 64457, 142424, 452, 390, 34292, 134381, 33022, 51312, 1632, 2967, 4734, 43658, 177261, 959, 8561, 73...	[ 0.210205078125, 0.16357421875, 0.290771484375, 0.015106201171875, 0.15087890625, 0.1898193359375, 0.0648193359375, 0.114501953125, 0.1070556640625, 0.153076171875, 0.03765869140625, 0.004302978515625, 0.09423828125, 0.1297607421875, 0.1904296875, 0.0472412109375, 0.069580078125, 0....	embed
51110694_c0	51110694	lisp	0	Title: Setf function names Problem title: Setf function names Tags: setf, lisp, common-lisp Problem: Setf function names Reading this question got me thinking about what constitutes a valid car of an expression. Obviously, symbols and lambdas can be "called" using the usual syntax. According to the hyperspec , function...	Setf function names Setf function names setf lisp common-lisp Setf Don Setf function names Reading this question got me thinking about what constitutes a valid car of an expression. Obviously, symbols and lambdas can be "called" using the usual syntax. According to the hyperspec , So, theoretically, (setf some-name) is...	[ 0.022216796875, -0.00775146484375, 0.023193359375, 0.004241943359375, -0.0113525390625, -0.004608154296875, -0.00958251953125, 0.006439208984375, -0.01287841796875, 0.0032196044921875, -0.013427734375, 0.0113525390625, -0.017333984375, -0.005523681640625, 0.0019073486328125, -0.0037841...	[ 19943, 420, 32354, 123055, 5423, 400, 7008, 39210, 4086, 254, 7650, 47644, 11764, 35604, 2258, 111, 125195, 26582, 136, 21, 6492, 1124, 831, 85763, 297, 115723, 6002, 86531, 59058, 16711, 3790, 2264, 3509, 3060, 11627, 9351, 9790, 165132, 6...	[ 0.2177734375, 0.200927734375, 0.2496337890625, 0.1669921875, 0.1676025390625, 0.07470703125, 0.1640625, 0.1158447265625, 0.08062744140625, 0.157470703125, 0.09295654296875, 0.0169525146484375, 0.1016845703125, 0.18115234375, 0.243896484375, 0.08154296875, 0.22265625, 0.20361328125,...	embed
41530257_c0	41530257	lisp	0	Title: Checking circularity in lisp - same variable through recursive function Problem title: Checking circularity in lisp - same variable through recursive function Tags: common-lisp, circular-list, lisp Problem: Checking circularity in lisp - same variable through recursive function I'm trying to create a function th...	Checking circularity in lisp - same variable through recursive function Checking circularity in lisp - same variable through recursive function common-lisp circular-list lisp Checking circ2 Checking circularity in lisp - same variable through recursive function I'm trying to create a function that would test whether th...	[ -0.004058837890625, 0.000766754150390625, 0.00347900390625, 0.0263671875, -0.0025482177734375, -0.018310546875, 0.005645751953125, 0.02001953125, 0.01171875, -0.02001953125, -0.0206298828125, 0.00860595703125, -0.006439208984375, 0.0028839111328125, 0.015869140625, 0.01904296875, -0....	[ 38679, 214, 115339, 2481, 400, 7008, 5701, 77336, 195625, 5844, 32354, 39210, 4086, 254, 6562, 42154, 304, 31577, 28282, 3034, 36766, 5303, 83, 456, 17137, 6275, 86595, 13, 50339, 2174, 221419, 35735, 864, 5117, 1632, 125216, 136, 234873, 1...	[ 0.1717529296875, 0.0076904296875, 0.2548828125, 0.115234375, 0.0828857421875, 0.1717529296875, 0.08074951171875, 0.1646728515625, 0.146240234375, 0.0626220703125, 0.1312255859375, 0.051177978515625, 0.07415771484375, 0.137451171875, 0.1400146484375, 0.1146240234375, 0.03704833984375,...	embed
16496596_c0	16496596	lisp	0	Title: Common Lisp Loop Trouble Problem title: Common Lisp Loop Trouble Tags: common-lisp, lisp Problem: Common Lisp Loop Trouble I have some trouble fully understanding CL's Loop macro. This is my code for Project Euler Nr. 32: (defun number-to-list (nr) (map 'list #'digit-char-p (prin1-to-string nr))) (defun nine-dig...	Common Lisp Loop Trouble Common Lisp Loop Trouble common-lisp lisp 1 2 Common Lisp Loop Trouble prin1-to-string euler-32 Common Lisp Loop Trouble I have some trouble fully understanding CL's Loop macro. This is my code for Project Euler Nr. 32: Although this gives me the correct solution, my problem is with function "p...	[ 0.007293701171875, 0.00193023681640625, 0.000911712646484375, 0.0030517578125, -0.016845703125, 0.0179443359375, -0.004608154296875, -0.0001773834228515625, 0.013427734375, -0.02587890625, -0.0042724609375, 0.00555419921875, 0.004302978515625, 0.008544921875, -0.005462646484375, 0.0052...	[ 151301, 1261, 7008, 199694, 119671, 2661, 39210, 4086, 254, 400, 2448, 20268, 188, 91693, 1175, 603, 108760, 3060, 63134, 89554, 100094, 46323, 111789, 18151, 27331, 5177, 9308, 2789, 106073, 26785, 29806, 2967, 32354, 3180, 140915, 9, 6562, ...	[ 0.1683349609375, 0.1798095703125, 0.1767578125, 0.2022705078125, 0.1434326171875, 0.057952880859375, 0.1258544921875, 0.1192626953125, 0.125244140625, 0.1114501953125, 0.119384765625, 0.019500732421875, 0.095703125, 0.1767578125, 0.1131591796875, 0.1756591796875, 0.2080078125, 0.01...	embed
46637898_c0	46637898	lisp	0	Title: SBCL error: "binding stack exhausted" when running Maxima on Linux machine Problem title: SBCL error: "binding stack exhausted" when running Maxima on Linux machine Tags: lisp, linux, maxima, common-lisp, sbcl Problem: SBCL error: "binding stack exhausted" when running Maxima on Linux machine...	SBCL error: "binding stack exhausted" when running Maxima on Linux machine SBCL error: "binding stack exhausted" when running Maxima on Linux machine lisp linux maxima common-lisp sbcl SBCL Maxima Linux INFO Binding Lisp PROCEED CAUTION Automatically drop_caches max_map_count sb-ext:gc System Host X...	[ 0.01519775390625, 0.0247802734375, -0.01361083984375, 0.007598876953125, -0.000743865966796875, -0.0003528594970703125, 0.01202392578125, -0.00665283203125, 0.003997802734375, -0.0322265625, 0.002593994140625, -0.00634765625, 0.0052490234375, 0.00787353515625, 0.0186767578125, 0.013122...	[ 90944, 37486, 18499, 128239, 177261, 146353, 297, 51042, 46540, 11, 98, 29908, 36279, 3229, 400, 7008, 11508, 6077, 122200, 39210, 4086, 254, 275, 34937, 123552, 1843, 33770, 1261, 441, 20000, 51719, 36069, 59863, 18389, 62346, 71013, 91, 335...	[ 0.1710205078125, 0.2144775390625, 0.200439453125, 0.243408203125, 0.2261962890625, 0.2587890625, 0.1129150390625, 0.131591796875, 0.242431640625, 0.2373046875, 0.066650390625, 0.2154541015625, 0.150634765625, 0.006866455078125, 0.08544921875, 0.1793212890625, 0.0797119140625, 0.048...	embed
59654902_c0	59654902	lisp	0	Title: User-friendly wrappings for tail recursive functions Problem title: User-friendly wrappings for tail recursive functions Tags: recursion, sbcl, lisp Problem: User-friendly wrappings for tail recursive functions I am trying to learn common lisp. I'm familiar with tail recursion, but I'm unfamiliar with the idioma...	User-friendly wrappings for tail recursive functions User-friendly wrappings for tail recursive functions recursion sbcl lisp User-friendly User-friendly wrappings for tail recursive functions I am trying to learn common lisp. I'm familiar with tail recursion, but I'm unfamiliar with the idiomatic way to wrap a tail re...	[ 0.00994873046875, 0.01422119140625, 0.005096435546875, -0.007354736328125, 0.0003376007080078125, 0.0194091796875, 0.003692626953125, -0.018798828125, 0.00946044921875, -0.02294921875, 0.00872802734375, 0.00180816650390625, -0.0123291015625, 0.01708984375, 0.046875, 0.0067138671875, ...	[ 53400, 193701, 137565, 10366, 100, 46741, 195625, 5844, 32354, 1830, 275, 34937, 400, 7008, 31577, 30698, 39210, 16031, 69211, 49666, 9523, 3917, 11782, 56, 959, 765, 61475, 183278, 1290, 77336, 27781, 36663, 38937, 4734, 111240, 107730, 1916, ...	[ 0.15283203125, 0.210693359375, 0.2412109375, 0.136962890625, 0.038787841796875, 0.27294921875, 0.2440185546875, 0.1395263671875, 0.2056884765625, 0.0589599609375, 0.031036376953125, 0.1192626953125, 0.1143798828125, 0.1822509765625, 0.0133056640625, 0.05340576171875, 0.150390625, 0...	embed
69539016_c0	69539016	lisp	0	Title: running Common Lisp application on Kubernetes cluster Problem title: running Common Lisp application on Kubernetes cluster Tags: lisp, kubernetes, common-lisp Problem: running Common Lisp application on Kubernetes cluster I have deployed on prod 10+ java/js microservices in GKE, all is good, none use external vo...	running Common Lisp application on Kubernetes cluster running Common Lisp application on Kubernetes cluster lisp kubernetes common-lisp Common Lisp Kubernetes running Common Lisp application on Kubernetes cluster I have deployed on prod 10+ java/js microservices in GKE, all is good, none use external volumes, its a sim...	[ 0.01422119140625, 0.0191650390625, -0.0003604888916015625, -0.01068115234375, -0.0235595703125, -0.00049591064453125, 0.004119873046875, -0.000949859619140625, 0.004486083984375, -0.00010824203491210938, 0.0123291015625, -0.00072479248046875, 0.018310546875, 0.006591796875, 0.00836181640...	[ 51042, 151301, 1261, 7008, 38415, 98, 96305, 3196, 1636, 234737, 400, 228, 46690, 30621, 39210, 4086, 254, 8, 13158, 502, 71, 209, 1328, 79, 330, 28175, 11948, 22584, 527, 15283, 756, 4127, 4527, 173591, 21950, 6863, 8781, 9433, 137158, 1...	[ 0.1190185546875, 0.263671875, 0.2117919921875, 0.2469482421875, 0.2076416015625, 0.051666259765625, 0.12060546875, 0.123291015625, 0.14013671875, 0.220947265625, 0.1240234375, 0.03399658203125, 0.1087646484375, 0.083984375, 0.1529541015625, 0.159423828125, 0.1937255859375, 0.028854...	embed
41691669_c0	41691669	lisp	0	Title: Why Doesn't Clojure provide standard library after creating new namespace? Problem title: Why Doesn't Clojure provide standard library after creating new namespace? Tags: namespaces, lisp, clojure, clojurescript, functional-programming Problem: Why Doesn't Clojure provide standard library after creatin...	Why Doesn't Clojure provide standard library after creating new namespace? Why Doesn't Clojure provide standard library after creating new namespace? namespaces lisp clojure clojurescript functional-programming CompilerException java.lang.RuntimeException Why Doesn Clojure clojure.lang.Namespace Unable bynyps...	[ -0.01348876953125, 0.00286865234375, -0.0037841796875, 0.0206298828125, -0.0089111328125, 0.0081787109375, 0.006866455078125, -0.00653076171875, -0.0106201171875, -0.0255126953125, -0.002197265625, -0.021240234375, 0.0067138671875, -0.0164794921875, 0.00823974609375, -0.00946044921875,...	[ 44084, 18, 51053, 461, 107, 22691, 5570, 35773, 1294, 7103, 105233, 3525, 210716, 400, 7008, 20450, 32032, 123309, 28966, 15612, 34759, 63928, 79, 330, 3066, 101790, 163612, 65421, 992, 2886, 299, 6423, 28568, 3173, 21178, 2967, 18151, 34390,...	[ 0.07373046875, 0.07177734375, 0.15966796875, 0.1839599609375, 0.141845703125, 0.1158447265625, 0.1949462890625, 0.19921875, 0.1202392578125, 0.051727294921875, 0.10211181640625, 0.1221923828125, 0.251708984375, 0.0150146484375, 0.1063232421875, 0.1201171875, 0.099853515625, 0.08911...	embed
16258308_c1	16258308	lisp	1	that f can call to achieve self-recursion. f is expected to define and return an "inner" function which does the "real" operation. That inner function accepts argument a (or in the general case an argument list, but that can't be expressed in the traditional notation). The result of calling Y_letrec is a result of cal...	that f can call to achieve self-recursion. f is expected to define and return an "inner" function which does the "real" operation. That inner function accepts argument a (or in the general case an argument list, but that can't be expressed in the traditional notation). The result of calling Y_letrec is a result of cal...	[ 0.00311279296875, 0.00982666015625, 0.0242919921875, 0.0185546875, 0.01312255859375, 0.00897216796875, 0.01043701171875, -0.010009765625, 0.00176239013671875, -0.006988525390625, -0.004180908203125, 0.0133056640625, -0.0291748046875, 0.0181884765625, 0.034423828125, -0.005340576171875,...	[ 450, 1238, 831, 11782, 47, 69307, 15970, 107, 48650, 1830, 84751, 61924, 30646, 73, 1679, 32354, 14602, 30544, 41018, 75414, 26946, 10750, 10, 5303, 18, 36510, 89160, 110, 16750, 159029, 990, 454, 1974, 31688, 44136, 43542, 35839, 5423, 452...	[ 0.05255126953125, 0.200927734375, 0.11181640625, 0.1949462890625, 0.1065673828125, 0.1605224609375, 0.211669921875, 0.120361328125, 0.206787109375, 0.1265869140625, 0.152099609375, 0.1488037109375, 0.107421875, 0.1336669921875, 0.177490234375, 0.1910400390625, 0.06036376953125, 0.1...	embed
34125708_c0	34125708	lisp	0	Title: parameter evaluation of function call from a macro Problem title: parameter evaluation of function call from a macro Tags: lisp, common-lisp, clisp Problem: parameter evaluation of function call from a macro I have a function and one macro in which the function is called. And to see the difference, I trace the f...	parameter evaluation of function call from a macro parameter evaluation of function call from a macro lisp common-lisp clisp a Trace GEN-LISP NIL parameter evaluation of function call from a macro I have a function and one macro in which the function is called. And to see the difference, I trace the function and found ...	[ -0.00072479248046875, 0.025634765625, -0.005615234375, -0.011962890625, -0.014404296875, -0.0020904541015625, 0.01226806640625, -0.010986328125, -0.0076904296875, -0.032470703125, 0.000362396240234375, 0.004425048828125, -0.0162353515625, -0.0172119140625, -0.0006256103515625, -0.03344...	[ 171859, 219836, 32354, 11782, 1295, 111789, 400, 7008, 39210, 4086, 254, 95701, 4937, 329, 109141, 67616, 683, 541, 16444, 35839, 60212, 144851, 110, 105237, 15400, 70, 509, 959, 151575, 115081, 47, 96276, 16093, 361, 21162, 297, 17324, 9226,...	[ 0.253173828125, 0.2061767578125, 0.195068359375, 0.1895751953125, 0.137939453125, 0.2265625, 0.1279296875, 0.17919921875, 0.097412109375, 0.115478515625, 0.1552734375, 0.0654296875, 0.081298828125, 0.009063720703125, 0.121826171875, 0.10687255859375, 0.1231689453125, 0.052551269531...	embed
58890363_c0	58890363	lisp	0	Title: Why is package user not an environment in MIT Scheme 10.1? Problem title: Why is package user not an environment in MIT Scheme 10.1? Tags: lisp, mit-scheme, scheme Problem: Why is package user not an environment in MIT Scheme 10.1? Here is my MIT Scheme code: (display (name->package '(user))) (newline) (->enviro...	Why is package user not an environment in MIT Scheme 10.1? Why is package user not an environment in MIT Scheme 10.1? lisp mit-scheme scheme Why MIT Scheme foo.scm RESTART There Subproblem Compiled x2f xd8 x95ed10 You Type Why is package user not an environment in MIT Scheme 10.1? Here is my MIT Scheme code: This runs ...	[ 0.00701904296875, -0.01318359375, 0.0008544921875, 0.0286865234375, -0.018798828125, 0.017578125, -0.0010986328125, -0.00872802734375, -0.02001953125, -0.00439453125, 0.014892578125, 0.01806640625, -0.0006256103515625, -0.00103759765625, 0.0093994140625, -0.0240478515625, 0.006927490...	[ 44084, 83, 98169, 38937, 959, 142, 65998, 23, 78999, 34702, 282, 147546, 400, 7008, 491, 7560, 150370, 5775, 31, 3931, 627, 21828, 47136, 8622, 8273, 38953, 15612, 304, 420, 1019, 8821, 963, 60457, 18151, 127877, 5885, 64, 33261, 152590, ...	[ 0.1146240234375, 0.07794189453125, 0.254150390625, 0.25244140625, 0.17236328125, 0.1044921875, 0.2301025390625, 0.0626220703125, 0.217529296875, 0.2117919921875, 0.1771240234375, 0.2445068359375, 0.03533935546875, 0.1412353515625, 0.1778564453125, 0.1668701171875, 0.1881103515625, ...	embed
19849741_c1	19849741	lisp	1	"123 Not Real Blvd,") ("wine" "Some Wine Group" "777 S Does Not Exist Ave,"))) can not be converted to an SQL literal. [Condition of type SIMPLE-ERROR] Restarts: 0: [ABORT] Exit debugger, returning to top level. Backtrace: 0: ((SB-PCL::FAST-METHOD CL-POSTGRES:TO-SQL-STRING (T)) #<unavailable argument> #<unavailable ar...	"123 Not Real Blvd,") ("wine" "Some Wine Group" "777 S Does Not Exist Ave,"))) can not be converted to an SQL literal. [Condition of type SIMPLE-ERROR] Restarts: 0: [ABORT] Exit debugger, returning to top level. Backtrace: 0: ((SB-PCL::FAST-METHOD CL-POSTGRES:TO-SQL-STRING (T)) #<unavailable argument> #<unavailable ar...	[ 0.01348876953125, 0.01123046875, 0.0013885498046875, 0.01416015625, -0.0164794921875, 0.00958251953125, -0.0106201171875, 0.0027008056640625, -0.00958251953125, 0.00897216796875, 0.0203857421875, -0.01263427734375, -0.00173187255859375, -0.0201416015625, -0.02490234375, 0.0087890625, ...	[ 44, 48636, 11205, 5120, 335, 3723, 71, 18939, 9494, 13, 8912, 282, 120634, 10760, 102294, 159, 101790, 5443, 1419, 40168, 32149, 831, 959, 117176, 47, 142, 80866, 15659, 289, 428, 10644, 40288, 103084, 9, 12501, 14255, 49756, 67987, 757, ...	[ 0.0028076171875, 0.28125, 0.21728515625, 0.27880859375, 0.010772705078125, 0.126220703125, 0.07464599609375, 0.004425048828125, 0.1669921875, 0.1124267578125, 0.0184326171875, 0.053924560546875, 0.18603515625, 0.167724609375, 0.2261962890625, 0.1168212890625, 0.096435546875, 0.1196...	embed
20259845_c0	20259845	lisp	0	Title: Changing a program while it is running Problem title: Changing a program while it is running Tags: slime, read-eval-print-loop, common-lisp, emacs, lisp Problem: Changing a program while it is running Not sure if this is an emacs-SLIME issue or a CL issue or SBCL issue. I've heard it said that the interactive na...	Changing a program while it is running Changing a program while it is running slime read-eval-print-loop common-lisp emacs lisp Changing Changing a program while it is running Not sure if this is an emacs-SLIME issue or a CL issue or SBCL issue. I've heard it said that the interactive nature of Lisp allows for changing...	[ -0.0123291015625, 0.00836181640625, -0.000911712646484375, 0.002166748046875, 0.003143310546875, 0.01007080078125, 0.005584716796875, 0.01507568359375, 0.007080078125, -0.015625, -0.002593994140625, 0.019287109375, -0.039794921875, -0.006378173828125, 0.0234375, 0.004486083984375, 0....	[ 108193, 214, 1528, 12960, 442, 83, 51042, 34264, 13, 12301, 1405, 35662, 28354, 39210, 4086, 254, 352, 2263, 400, 7008, 7, 30508, 66820, 31089, 46323, 90944, 37486, 212398, 31425, 1261, 114864, 151134, 37842, 25632, 22466, 84797, 11435, 9969,...	[ 0.255615234375, 0.0457763671875, 0.2301025390625, 0.1778564453125, 0.0421142578125, 0.07684326171875, 0.226318359375, 0.1710205078125, 0.1483154296875, 0.1419677734375, 0.2156982421875, 0.1385498046875, 0.168701171875, 0.0797119140625, 0.10321044921875, 0.1483154296875, 0.06048583984...	embed
16181382_c0	16181382	lisp	0	Title: Persistent data structures: a persistent index? Problem title: Persistent data structures: a persistent index? Tags: javascript, lisp, functional-programming, data-structures Problem: Persistent data structures: a persistent index? Functional programming utilizes immutable data. When you modify something you rei...	Persistent data structures: a persistent index? Persistent data structures: a persistent index? javascript lisp functional-programming data-structures Persistent Persistent data structures: a persistent index? Functional programming utilizes immutable data. When you modify something you reinstantiate "the world" reusin...	[ 0.007537841796875, 0.0439453125, -0.00946044921875, -0.01019287109375, 0.01513671875, 0.01531982421875, 0.01373291015625, -0.005523681640625, 0.0137939453125, -0.0390625, 0.016845703125, -0.0030059814453125, -0.003936767578125, 0.01092529296875, -0.005767822265625, 0.00848388671875, ...	[ 57309, 2581, 18, 2053, 45646, 7, 12, 10, 70560, 2517, 63262, 32, 136951, 400, 7008, 123309, 28966, 137656, 28670, 10763, 56037, 449, 121876, 566, 561, 22819, 14847, 2811, 40383, 9844, 456, 143034, 101426, 8999, 223, 96362, 107032, 7722, 962...	[ 0.189453125, 0.1951904296875, 0.1275634765625, 0.18115234375, 0.2568359375, 0.039886474609375, 0.030609130859375, 0.090087890625, 0.2425537109375, 0.1781005859375, 0.281494140625, 0.01141357421875, 0.222412109375, 0.10302734375, 0.1832275390625, 0.147705078125, 0.1124267578125, 0.1...	embed
12990296_c1	12990296	lisp	1	- and using equal? function, somewhere inside recursive calls, we eventually get #t for both 1 and 2: 5. (is-in? '(2 3 4) '(1 2 3 4)) -> #t 6. (is-in? '(2 3 4) '(1 (2 3 4)) -> #t So how to get that kind of behaviour from 1? I want to have a function, which works with all different types of data. Here's my function, wh...	- and using equal? function, somewhere inside recursive calls, we eventually get #t for both 1 and 2: 5. (is-in? '(2 3 4) '(1 2 3 4)) -> #t 6. (is-in? '(2 3 4) '(1 (2 3 4)) -> #t So how to get that kind of behaviour from 1? I want to have a function, which works with all different types of data. Here's my function, wh...	[ -0.01513671875, 0.03759765625, -0.004425048828125, 0.005126953125, 0.005706787109375, 0.01483154296875, -0.00933837890625, -0.0048828125, 0.006317138671875, -0.0302734375, 0.01470947265625, 0.00031280517578125, 0.0093994140625, -0.00604248046875, 0.002685546875, 0.002716064453125, 0....	[ 136, 17368, 105950, 32, 32354, 174653, 46132, 195625, 5844, 11782, 7, 642, 155605, 2046, 468, 18, 100, 15044, 106, 15573, 1892, 164, 73, 54753, 138, 13956, 16, 2289, 41600, 3642, 450, 8562, 224833, 1295, 3444, 765, 43240, 678, 756, 12921,...	[ 0.086181640625, 0.1356201171875, 0.269287109375, 0.1904296875, 0.21435546875, 0.062255859375, 0.2230224609375, 0.188232421875, 0.1463623046875, 0.203125, 0.051605224609375, 0.001953125, 0.1004638671875, 0.12353515625, 0.111572265625, 0.1513671875, 0.021575927734375, 0.0377502441406...	embed
13537622_c0	13537622	lisp	0	Title: Lambda Calculus CONS Pair implementation with Lisp Problem title: Lambda Calculus CONS Pair implementation with Lisp Tags: lisp, lambda-calculus Problem: Lambda Calculus CONS Pair implementation with Lisp I'm trying to implement a Church Pair Lambda Calc. style with CLisp. According with Wikipedia: pair ≡ λx.λy....	Lambda Calculus CONS Pair implementation with Lisp Lambda Calculus CONS Pair implementation with Lisp lisp lambda-calculus Lambda Calculus CONS Pair Lisp FIRST SECOND church2int int2church FUNCALL Lambda Calculus CONS Pair implementation with Lisp I'm trying to implement a Church Pair Lambda Calc. style with CLisp. Acc...	[ 0.010009765625, 0.0140380859375, 0.007171630859375, 0.02099609375, -0.006591796875, 0.01025390625, -0.009033203125, 0.006744384765625, 0.0026092529296875, -0.030517578125, 0.01385498046875, 0.006683349609375, 0.0030059814453125, -0.0179443359375, 0.0218505859375, 0.00592041015625, -0...	[ 122930, 85, 212467, 223, 109022, 1342, 481, 208124, 678, 1261, 7008, 400, 6492, 6827, 94739, 133907, 77980, 106820, 304, 4288, 23, 18, 474, 136258, 441, 66437, 31577, 29479, 84084, 9113, 238, 20623, 164, 254, 8162, 2060, 18151, 8545, 136, ...	[ 0.19677734375, 0.1597900390625, 0.21630859375, 0.0562744140625, 0.1878662109375, 0.1793212890625, 0.1405029296875, 0.1619873046875, 0.052398681640625, 0.150390625, 0.2374267578125, 0.1124267578125, 0.1832275390625, 0.114990234375, 0.10400390625, 0.0655517578125, 0.07891845703125, 0...	embed
55408445_c1	55408445	lisp	1	{ term.error(e.message); }); }, { name: 'lisp', prompt: 'lips> ', enabled: false, greetings: false, keymap: { ENTER: function(e, original) { if (lips.balanced_parenthesis(this.get_command())) { original(); } else { var i = indent(this, 3, this.get_prompt().length); this.insert('\n' + (new Array(i + 1).join(' '))); } }...	{ term.error(e.message); }); }, { name: 'lisp', prompt: 'lips> ', enabled: false, greetings: false, keymap: { ENTER: function(e, original) { if (lips.balanced_parenthesis(this.get_command())) { original(); } else { var i = indent(this, 3, this.get_prompt().length); this.insert('\n' + (new Array(i + 1).join(' '))); } }...	[ -0.009033203125, 0.00156402587890625, -0.005035400390625, 0.026611328125, -0.025634765625, 0.0191650390625, 0.005340576171875, 0.00482177734375, -0.012451171875, -0.0206298828125, 0.013427734375, 0.00191497802734375, -0.007293701171875, 0.00445556640625, -0.00909423828125, 0.0138549804...	[ 13579, 188800, 13, 74157, 9351, 4086, 254, 105876, 95680, 225081, 98320, 3514, 126, 5180, 22799, 62346, 116563, 32354, 7311, 2174, 173212, 71, 99547, 160291, 100231, 3794, 277, 12018, 17, 18597, 18, 138, 903, 3454, 2676, 23986, 33657, 54936, ...	[ 0.170166015625, 0.1927490234375, 0.0811767578125, 0.1112060546875, 0.0243072509765625, 0.0948486328125, 0.1732177734375, 0.259521484375, 0.190185546875, 0.125, 0.0732421875, 0.0692138671875, 0.002838134765625, 0.0029296875, 0.098876953125, 0.171142578125, 0.222412109375, 0.17114257...	embed
69126175_c0	69126175	lisp	0	Title: Usefulness of let? Problem title: Usefulness of let? Tags: lisp Problem: Usefulness of let? Is the distinction between the 3 different let forms (as in Scheme's let, let*, and letrec) useful in practice? I am current in the midst of developing a lisp-style language that does current support all 3 forms, yet I ha...	Usefulness of let? Usefulness of let? lisp Usefulness Usefulness of let? Is the distinction between the 3 different let forms (as in Scheme's let, let*, and letrec) useful in practice? I am current in the midst of developing a lisp-style language that does current support all 3 forms, yet I have found: regular "let" is...	[ 0.005950927734375, 0.00799560546875, 0.016357421875, 0.00830078125, -0.00201416015625, 0.01116943359375, 0.00154876708984375, -0.00885009765625, 0.006256103515625, 0.0045166015625, -0.00811767578125, -0.0147705078125, 0.00921630859375, 0.00994873046875, 0.001739501953125, -0.0062561035...	[ 36836, 7844, 7432, 111, 2633, 400, 7008, 149067, 19, 17721, 138, 12921, 3173, 7, 34702, 282, 1639, 31688, 80234, 41361, 43581, 168698, 40946, 46876, 8060, 756, 20324, 1974, 83, 2684, 24500, 45964, 3900, 19309, 109312, 6492, 85, 167934, 1393...	[ 0.2003173828125, 0.1689453125, 0.088134765625, 0.1197509765625, 0.29296875, 0.1129150390625, 0.169677734375, 0.1549072265625, 0.042327880859375, 0.062744140625, 0.10552978515625, 0.1224365234375, 0.208984375, 0.07611083984375, 0.11376953125, 0.1236572265625, 0.1474609375, 0.2211914...	embed
23917060_c0	23917060	lisp	0	Title: Stack overflow with assoc and a function test Problem title: Stack overflow with assoc and a function test Tags: stack-overflow, lisp Problem: Stack overflow with assoc and a function test I wrote this function, that returns t if the arguments given match, else nil. (defun match (input-form pattern) (cond ((and ...	Stack overflow with assoc and a function test Stack overflow with assoc and a function test stack-overflow lisp Stack Eliza Stack overflow with assoc and a function test I wrote this function, that returns t if the arguments given match, else nil. When I do this : It works well and returns : ((bonjour *) bonjour) and (...	[ -0.001922607421875, 0.020751953125, -0.0107421875, 0.000701904296875, 0.0034027099609375, -0.029296875, 0.002410888671875, 0.0284423828125, 0.02294921875, -0.050537109375, 0.01904296875, -0.0064697265625, 0.000652313232421875, -0.0079345703125, 0.0267333984375, -0.005828857421875, 0....	[ 6512, 2594, 645, 118664, 678, 63927, 238, 136, 10, 32354, 3034, 177261, 5465, 400, 7008, 126443, 54397, 30646, 808, 2174, 10750, 34475, 14858, 37076, 17324, 43240, 5299, 8345, 100201, 661, 3948, 73395, 127, 13817, 103510, 6954, 468, 98753, ...	[ 0.1240234375, 0.0833740234375, 0.1090087890625, 0.20263671875, 0.043212890625, 0.142578125, 0.1629638671875, 0.049285888671875, 0.0175018310546875, 0.162353515625, 0.2060546875, 0.1434326171875, 0.07794189453125, 0.03997802734375, 0.139404296875, 0.2276611328125, 0.06402587890625, ...	embed
7366093_c0	7366093	lisp	0	Title: A prototyping language with the ability to be fast Problem title: A prototyping language with the ability to be fast Tags: artificial-intelligence, math, go, prototype, lisp Problem: A prototyping language with the ability to be fast as an engineering student with a strong mathemathical background, i dealing som...	A prototyping language with the ability to be fast A prototyping language with the ability to be fast artificial-intelligence math go prototype lisp A prototyping language with the ability to be fast as an engineering student with a strong mathemathical background, i dealing some problems like this at university: (nume...	[ 0.0250244140625, 0.0133056640625, 0.00897216796875, 0.00616455078125, -0.01031494140625, -0.018798828125, 0.0091552734375, -0.01123046875, -0.006683349609375, -0.018798828125, 0.006622314453125, -0.0242919921875, -0.019775390625, -0.0162353515625, -0.0034942626953125, 0.00823974609375,...	[ 62, 160469, 214, 46876, 678, 81273, 47, 186, 4271, 66733, 130687, 48909, 738, 13, 400, 7008, 237, 177907, 9836, 10, 37515, 140363, 927, 21533, 76615, 17, 184017, 44402, 1884, 903, 99, 152363, 2606, 16, 144814, 38730, 15649, 7, 66349, 2713...	[ 0.0582275390625, 0.315673828125, 0.1259765625, 0.256591796875, 0.068115234375, 0.197998046875, 0.050567626953125, 0.119384765625, 0.207275390625, 0.1220703125, 0.1129150390625, 0.1312255859375, 0.1365966796875, 0.1558837890625, 0.1083984375, 0.2388916015625, 0.01513671875, 0.094726...	embed
40452043_c0	40452043	lisp	0	Title: Unit-testing in Racket with objects Problem title: Unit-testing in Racket with objects Tags: unit-testing, lisp, racket, testing Problem: Unit-testing in Racket with objects I am trying to build the classic game "Snake" with Racket and Dr. Racket. I like using unit-tests to see if I am understanding the concepts...	Unit-testing in Racket with objects Unit-testing in Racket with objects unit-testing lisp racket testing rackunit Unit-testing Racket FAILURE Desktop cap-6.rkt Unit-testing in Racket with objects I am trying to build the classic game "Snake" with Racket and Dr. Racket. I like using unit-tests to see if I am understandi...	[ 0.00537109375, 0.0005645751953125, -0.0118408203125, 0.01806640625, 0.0027313232421875, -0.01116943359375, 0.00982666015625, 0.00188446044921875, -0.0033416748046875, 0.000888824462890625, 0.006072998046875, 0.0064697265625, 0.005706787109375, -0.01531982421875, 0.006134033203125, 0.00...	[ 46640, 6954, 2552, 27853, 678, 36746, 214, 23, 25072, 7008, 673, 134234, 28779, 217, 15491, 16444, 141423, 3540, 13545, 7190, 18, 31577, 45367, 70, 54704, 6712, 294, 1141, 13, 1773, 1884, 100094, 23755, 50155, 18151, 105233, 45646, 80934, 1...	[ 0.1888427734375, 0.221923828125, 0.0955810546875, 0.197265625, 0.067626953125, 0.1455078125, 0.005950927734375, 0.002410888671875, 0.1842041015625, 0.06951904296875, 0.0712890625, 0.1898193359375, 0.09027099609375, 0.1824951171875, 0.02734375, 0.01263427734375, 0.09521484375, 0.066...	embed
55158158_c0	55158158	lisp	0	Title: LISP - Program to search a specific function through its parameters Problem title: LISP - Program to search a specific function through its parameters Tags: common-lisp, function, lisp, parameter-list Problem: LISP - Program to search a specific function through its parameters For a course project I got to write...	LISP - Program to search a specific function through its parameters LISP - Program to search a specific function through its parameters common-lisp function lisp parameter-list LISP Program LISP - Program to search a specific function through its parameters For a course project I got to write a program in lisp. The pro...	[ 0.00665283203125, 0.0238037109375, -0.02294921875, 0.00084686279296875, -0.025146484375, 0.0181884765625, 0.02001953125, -0.0162353515625, -0.003509521484375, -0.0439453125, 0.0125732421875, -0.019287109375, -0.0167236328125, 0.000934600830078125, 0.010009765625, 0.00396728515625, 0....	[ 16970, 9434, 20, 7663, 47, 33938, 29458, 32354, 8305, 6863, 171859, 7, 39210, 4086, 254, 400, 7008, 6562, 15411, 13452, 33022, 1528, 23, 5608, 70541, 2684, 5526, 107730, 140992, 35829, 5117, 5303, 36746, 13448, 32786, 4488, 116, 12921, 4832...	[ 0.210205078125, 0.29345703125, 0.0335693359375, 0.21533203125, 0.05743408203125, 0.2315673828125, 0.1761474609375, 0.2183837890625, 0.1375732421875, 0.06524658203125, 0.24951171875, 0.0155181884765625, 0.1085205078125, 0.1749267578125, 0.2261962890625, 0.1826171875, 0.2403564453125, ...	embed
7074122_c0	7074122	lisp	0	Title: Possible to reset user environment in Scheme REPL? Problem title: Possible to reset user environment in Scheme REPL? Tags: reset, read-eval-print-loop, lisp, scheme Problem: Possible to reset user environment in Scheme REPL? Scheme newbie question- Is there a way for me to reset my current REPL environment (i.e....	Possible to reset user environment in Scheme REPL? Possible to reset user environment in Scheme REPL? reset read-eval-print-loop lisp scheme Possible Scheme REPL Possible to reset user environment in Scheme REPL? Scheme newbie question- Is there a way for me to reset my current REPL environment (i.e. the default user e...	[ -0.00860595703125, 0.0106201171875, -0.0005035400390625, 0.039794921875, -0.0201416015625, 0.0042724609375, 0.00909423828125, -0.0257568359375, -0.0126953125, -0.014404296875, 0.0006866455078125, 0.006866455078125, -0.015625, 0.01531982421875, 0.005218505859375, -0.002532958984375, 0...	[ 115861, 2661, 47, 168398, 38937, 65998, 23, 34702, 282, 9069, 21130, 12301, 13, 1405, 35662, 28354, 400, 7008, 150370, 9014, 3917, 43581, 114977, 15490, 569, 456, 17137, 1884, 148, 48672, 1810, 351, 96362, 61924, 21543, 17368, 165132, 95409, ...	[ 0.1162109375, 0.0850830078125, 0.059234619140625, 0.268798828125, 0.227783203125, 0.262451171875, 0.03558349609375, 0.1923828125, 0.1649169921875, 0.1484375, 0.271728515625, 0.1256103515625, 0.0098876953125, 0.1849365234375, 0.137939453125, 0.1922607421875, 0.0985107421875, 0.18676...	embed
26696127_c0	26696127	lisp	0	Title: How can I convert this recursive solution into an iterative one? Problem title: How can I convert this recursive solution into an iterative one? Tags: algorithm, elisp, lisp Problem: How can I convert this recursive solution into an iterative one? I have the following recursive function in Lisp (defun f (item tr...	How can I convert this recursive solution into an iterative one? How can I convert this recursive solution into an iterative one? algorithm elisp lisp How How can I convert this recursive solution into an iterative one? I have the following recursive function in Lisp This function receives a tree and an item to look fo...	[ 0.00628662109375, -0.005218505859375, -0.00099945068359375, -0.01312255859375, 0.00433349609375, 0.010498046875, -0.0157470703125, -0.01153564453125, -0.00160980224609375, -0.02880859375, 0.01239013671875, 0.0196533203125, -0.022705078125, -0.000545501708984375, 0.0096435546875, 0.0042...	[ 11249, 831, 87, 96760, 903, 195625, 5844, 29806, 3934, 142, 17, 720, 45023, 1632, 234873, 15296, 7008, 400, 25632, 32354, 23, 1261, 53299, 53201, 136, 35735, 47, 6713, 100, 6863, 168894, 31358, 4263, 83, 2258, 2499, 1614, 6562, 1221, 3064...	[ 0.09716796875, 0.080078125, 0.016845703125, 0.2059326171875, 0.0941162109375, 0.239013671875, 0.1566162109375, 0.2039794921875, 0.1383056640625, 0.06427001953125, 0.070068359375, 0.21630859375, 0.20654296875, 0.09765625, 0.181640625, 0.0777587890625, 0.25439453125, 0.1309814453125,...	embed
18811335_c0	18811335	lisp	0	Title: How to load external dependencies with quicklisp? Problem title: How to load external dependencies with quicklisp? Tags: clisp, common-lisp, emacs, lisp, quicklisp Problem: How to load external dependencies with quicklisp? Here is my code: (defpackage :com.yves.tests (:use :common-lisp)) (in-package :com.yves.te...	How to load external dependencies with quicklisp? How to load external dependencies with quicklisp? clisp common-lisp emacs lisp quicklisp usocket LOAD How com.yves.tests Condition SYSTEM::SIMPLE-FILE-ERROR CL-USER ql:quickload ASDF Loading Users clisp-2.49 How to load external dependencies with quicklisp? Here is my c...	[ 0.00439453125, 0.01904296875, 0.010498046875, -0.006134033203125, -0.011962890625, 0.031982421875, 0.00830078125, 0.012939453125, 0.000339508056640625, -0.026611328125, -0.01263427734375, -0.0021514892578125, -0.01904296875, -0.021484375, 0.00799560546875, -0.00848388671875, -0.01855...	[ 11249, 72367, 173591, 42548, 117538, 678, 63773, 4086, 254, 47, 95701, 7008, 39210, 352, 2263, 400, 5388, 27853, 22215, 375, 3132, 6954, 46347, 90420, 73434, 103084, 919, 52099, 12501, 14255, 46323, 1062, 50184, 99247, 3181, 2594, 63033, 6483...	[ 0.0611572265625, 0.204345703125, 0.2252197265625, 0.2266845703125, 0.1417236328125, 0.0836181640625, 0.1734619140625, 0.208740234375, 0.206298828125, 0.008575439453125, 0.107177734375, 0.1929931640625, 0.0814208984375, 0.03009033203125, 0.0780029296875, 0.092041015625, 0.012573242187...	embed
53032622_c0	53032622	lisp	0	Title: Recursive processing of list elements in LISP Problem title: Recursive processing of list elements in LISP Tags: recursion, list, lisp, functional-programming Problem: Recursive processing of list elements in LISP Here is a task: a list is given, some of the elements are also lists. It's nescessary to replace th...	Recursive processing of list elements in LISP Recursive processing of list elements in LISP recursion list lisp functional-programming Recursive LISP NIL Recursive processing of list elements in LISP Here is a task: a list is given, some of the elements are also lists. It's nescessary to replace the nested lists with t...	[ -0.0201416015625, 0.033447265625, 0.007354736328125, -0.0021514892578125, -0.007354736328125, 0.0322265625, -0.0087890625, 0.01397705078125, -0.005523681640625, -0.0012664794921875, 0.015869140625, -0.0152587890625, -0.002227783203125, 0.00087738037109375, 0.005279541015625, 0.02014160...	[ 853, 48650, 5844, 9433, 214, 5303, 80854, 16970, 9434, 195625, 1830, 400, 7008, 123309, 28966, 541, 16444, 66211, 34475, 3060, 2843, 4909, 26531, 6635, 91995, 8512, 71, 10554, 101935, 2174, 756, 3853, 17368, 49129, 14858, 35431, 7103, 167201,...	[ 0.07196044921875, 0.213134765625, 0.1480712890625, 0.1512451171875, 0.0687255859375, 0.187255859375, 0.1656494140625, 0.123291015625, 0.2061767578125, 0.215576171875, 0.1260986328125, 0.0865478515625, 0.1610107421875, 0.113037109375, 0.07470703125, 0.02642822265625, 0.0916748046875, ...	embed
3672243_c1	3672243	lisp	1	power. I'm pretty new to Python and am trying to see how decorators fit in. They seem a little looser in that a decorator can be a completely external function which yet has the ability to manipulate information within the calling information and even modifying the instance and class variables of the object called, an...	power. I'm pretty new to Python and am trying to see how decorators fit in. They seem a little looser in that a decorator can be a completely external function which yet has the ability to manipulate information within the calling information and even modifying the instance and class variables of the object called, an...	[ -0.007720947265625, -0.004791259765625, 0.0244140625, 0.0057373046875, 0.011474609375, 0.0191650390625, 0.0096435546875, -0.0017547607421875, 0.02685546875, 0.0033721923828125, -0.01953125, 0.01373291015625, -0.00848388671875, 0.0233154296875, 0.0079345703125, -0.0245361328125, -0.00...	[ 14537, 5, 28875, 3525, 145581, 31577, 3642, 65177, 22230, 11177, 23, 48903, 10176, 5078, 2189, 1290, 831, 186, 64557, 173591, 32354, 14373, 81273, 45258, 4677, 28032, 159029, 2811, 151138, 110527, 18507, 77336, 36746, 35839, 5037, 31486, 10932,...	[ 0.251708984375, 0.023162841796875, 0.00897216796875, 0.039947509765625, 0.2493896484375, 0.017181396484375, 0.023834228515625, 0.2880859375, 0.2421875, 0.16552734375, 0.1114501953125, 0.04010009765625, 0.03204345703125, 0.08624267578125, 0.06927490234375, 0.23095703125, 0.06188964843...	embed
5363393_c0	5363393	lisp	0	Title: Rewriting Wizard game of Land of Lisp in Clojure Problem title: Rewriting Wizard game of Land of Lisp in Clojure Tags: lisp, land-of-lisp, jvm, clojure Problem: Rewriting Wizard game of Land of Lisp in Clojure I'm trying to rewrite the Wizard game from "Land of Lisp" http://landoflisp.com/wizards_game.lisp (def ...	Rewriting Wizard game of Land of Lisp in Clojure Rewriting Wizard game of Land of Lisp in Clojure lisp land-of-lisp jvm clojure here Rewriting Wizard Land Lisp Clojure Rewriting Wizard game of Land of Lisp in Clojure I'm trying to rewrite the Wizard game from "Land of Lisp" http://landoflisp.com/wizards_game.lisp When ...	[ -0.013671875, 0.01953125, -0.027587890625, 0.0130615234375, -0.0013580322265625, 0.0018768310546875, 0.000152587890625, -0.009765625, -0.005645751953125, -0.02001953125, -0.004730224609375, -0.0113525390625, -0.0211181640625, 0.0108642578125, -0.00811767578125, -0.00946044921875, 0.0...	[ 853, 199332, 221479, 6712, 6557, 111, 1261, 7008, 23, 51053, 461, 107, 400, 3551, 4390, 4086, 254, 334, 39, 20450, 3688, 31577, 456, 434, 18781, 1295, 94646, 34446, 36361, 44239, 99397, 35311, 903, 131527, 87, 2301, 18, 765, 10, 7, 6493...	[ 0.1385498046875, 0.2410888671875, 0.1885986328125, 0.143310546875, 0.1524658203125, 0.16015625, 0.1844482421875, 0.2117919921875, 0.0253753662109375, 0.1234130859375, 0.148193359375, 0.052581787109375, 0.1168212890625, 0.124755859375, 0.1531982421875, 0.1124267578125, 0.1707763671875...	embed
55987913_c0	55987913	lisp	0	Title: "illegal terminating character after a colon: #\" in portacle, though no colons in code Problem title: "illegal terminating character after a colon: #\" in portacle, though no colons in code Tags: sbcl, lisp, common-lisp Problem: "illegal terminating character after a colon: #\" in portacle, ...	"illegal terminating character after a colon: #\" in portacle, though no colons in code "illegal terminating character after a colon: #\" in portacle, though no colons in code sbcl lisp common-lisp main.lisp:1:1 READ COMPILE-FILE Line Column File-Position Stream SB-INT:FORM-TRACKING-STREAM main.lisp...	[ 0.021240234375, 0.01251220703125, -0.0162353515625, 0.007080078125, -0.01348876953125, -0.0047607421875, 0.01434326171875, 0.0006103515625, 0.00494384765625, -0.01171875, -0.0036773681640625, -0.0125732421875, 0.01324462890625, -0.006195068359375, 0.00640869140625, -0.0013885498046875,...	[ 2186, 2870, 121011, 214, 62816, 7103, 46512, 468, 4898, 11030, 21208, 110, 7, 18151, 34937, 400, 7008, 39210, 4086, 254, 5201, 19721, 188300, 61898, 52099, 16777, 233987, 42724, 7192, 172, 115061, 90944, 59537, 98533, 37082, 441, 56564, 15612...	[ 0.115966796875, 0.148681640625, 0.2052001953125, 0.029754638671875, 0.1822509765625, 0.1197509765625, 0.2491455078125, 0.10699462890625, 0.16748046875, 0.18505859375, 0.08740234375, 0.116455078125, 0.0160064697265625, 0.17822265625, 0.09503173828125, 0.0579833984375, 0.110595703125, ...	embed
15760966_c0	15760966	lisp	0	Title: LISP: How can I test if two lists have the same elements? Problem title: LISP: How can I test if two lists have the same elements? Tags: equality, lisp, list Problem: LISP: How can I test if two lists have the same elements? I want to write a function that takes as parameters two lists and checks if every elemen...	LISP: How can I test if two lists have the same elements? LISP: How can I test if two lists have the same elements? equality lisp list LISP How CAR CDR LENGTH MEMBER NOT MAPCAR APPLY SETQ lst1 lst2 LISP: How can I test if two lists have the same elements? I want to write a function that takes as parameters two lists an...	[ -0.005859375, 0.032470703125, 0.005340576171875, 0.00457763671875, -0.0142822265625, 0.0244140625, -0.00138092041015625, -0.0052490234375, -0.003997802734375, -0.021728515625, -0.00244140625, 0.00567626953125, 0.01513671875, 0.005035400390625, -0.01348876953125, 0.001434326171875, 0....	[ 16970, 9434, 11249, 831, 3034, 2174, 6626, 5303, 7, 765, 5701, 80854, 28, 161789, 400, 7008, 42476, 23498, 339, 48262, 276, 108582, 86725, 105748, 80076, 66440, 128565, 2737, 304, 87, 3444, 33022, 32354, 171859, 12765, 11907, 12830, 5117, 9...	[ 0.1014404296875, 0.149658203125, 0.049407958984375, 0.06463623046875, 0.2371826171875, 0.09747314453125, 0.1453857421875, 0.220947265625, 0.0797119140625, 0.058746337890625, 0.187744140625, 0.1881103515625, 0.0217437744140625, 0.1456298828125, 0.0916748046875, 0.1424560546875, 0.1267...	embed
72603847_c0	72603847	lisp	0	Title: How to modify this AutoLISP code to count how many polylines are there grouped by the linetype? Problem title: How to modify this AutoLISP code to count how many polylines are there grouped by the linetype? Tags: grouping, lisp, autolisp, autocad Problem: How to modify this AutoLISP code to count how many polyli...	How to modify this AutoLISP code to count how many polylines are there grouped by the linetype? How to modify this AutoLISP code to count how many polylines are there grouped by the linetype? grouping lisp autolisp autocad How AutoLISP _:L-I POLYLINE NOT ByLayer How to modify this AutoLISP code to count how many polyli...	[ -0.0036468505859375, 0.0068359375, -0.0031890869140625, 0.019775390625, -0.028564453125, 0.000751495361328125, 0.0072021484375, 0.0030670166015625, 0.01446533203125, -0.00811767578125, -0.00836181640625, -0.01611328125, 0.032958984375, 0.01031494140625, -0.0198974609375, 0.011352539062...	[ 11249, 2811, 40383, 903, 4396, 67616, 683, 18151, 54529, 3642, 5941, 35874, 59801, 2685, 37769, 71, 390, 13315, 50986, 21115, 214, 400, 7008, 1809, 4086, 254, 25426, 866, 9, 568, 64353, 1723, 57339, 86725, 3311, 2729, 8889, 1884, 3714, 39...	[ 0.04241943359375, 0.1077880859375, 0.1123046875, 0.044097900390625, 0.173828125, 0.1197509765625, 0.19091796875, 0.1470947265625, 0.1629638671875, 0.040924072265625, 0.10693359375, 0.1893310546875, 0.2235107421875, 0.090087890625, 0.20849609375, 0.033477783203125, 0.05517578125, 0....	embed
9816225_c0	9816225	lisp	0	Title: Writing a Lisp macro with nested quasiquoting Problem title: Writing a Lisp macro with nested quasiquoting Tags: lisp, macros Problem: Writing a Lisp macro with nested quasiquoting I'm trying to write a Lisp macro that writes a bunch of macros, but I'm having problems generating macro code that uses the splice o...	Writing a Lisp macro with nested quasiquoting Writing a Lisp macro with nested quasiquoting lisp macros Writing Lisp XXX PROGN DEFMACRO DO-SOME-LIST KEY ARGS NAME OPERATION BODY WITH-GENSYMS LOOP-LIST BUILD-BIND SOME WHEN SOME-P WITH-SOME Writing a Lisp macro with nested quasiquoting I'm trying to write a Lisp macro th...	[ -0.00494384765625, 0.037353515625, -0.018310546875, -0.0242919921875, -0.0118408203125, 0.029052734375, 0.0040283203125, -0.01263427734375, 0.0140380859375, 0.004364013671875, 0.0007476806640625, -0.01324462890625, 0.00689697265625, 0.0064697265625, 0.000621795654296875, 0.005218505859...	[ 213185, 1261, 7008, 111789, 678, 8512, 71, 12404, 41502, 400, 44585, 10514, 88858, 1514, 59370, 15012, 14255, 6197, 195977, 186104, 13685, 34162, 182512, 205574, 181668, 55766, 23415, 39018, 62428, 20880, 22013, 16444, 571, 69283, 91245, 214, 3...	[ 0.121826171875, 0.1405029296875, 0.21142578125, 0.2252197265625, 0.038116455078125, 0.1898193359375, 0.0684814453125, 0.1968994140625, 0.1910400390625, 0.1041259765625, 0.121826171875, 0.06842041015625, 0.06591796875, 0.0989990234375, 0.0576171875, 0.0223846435546875, 0.0902709960937...	embed
35143900_c0	35143900	lisp	0	Title: How to correctly pass arguments on Common Lisp? Problem title: How to correctly pass arguments on Common Lisp? Tags: sbcl, common-lisp, lisp Problem: How to correctly pass arguments on Common Lisp? I'm currently reading Practical Common Lisp, and I decided to try and improve its first example ( simple database )...	How to correctly pass arguments on Common Lisp? How to correctly pass arguments on Common Lisp? sbcl common-lisp lisp How Common Lisp TITLE ARTIST RATING RIPPED How to correctly pass arguments on Common Lisp? I'm currently reading Practical Common Lisp, and I decided to try and improve its first example ( simple databa...	[ 0.0081787109375, 0.0341796875, 0.022705078125, -0.009521484375, -0.0130615234375, 0.024169921875, -0.00634765625, 0.00543212890625, 0.003448486328125, 0.006195068359375, 0.006622314453125, 0.00116729736328125, 0.00007772445678710938, -0.0118408203125, 0.0027618408203125, -0.00052261352...	[ 11249, 47, 26785, 538, 27875, 10750, 7, 98, 151301, 1261, 7008, 34937, 39210, 4086, 254, 400, 131514, 15300, 57161, 35602, 19400, 68151, 30976, 17487, 17610, 109613, 52295, 27781, 63399, 41361, 28350, 32354, 1286, 189534, 36849, 18151, 127877, ...	[ 0.0794677734375, 0.03924560546875, 0.169921875, 0.0260009765625, 0.1624755859375, 0.270263671875, 0.08123779296875, 0.0849609375, 0.2003173828125, 0.1651611328125, 0.180908203125, 0.087890625, 0.1085205078125, 0.059906005859375, 0.09967041015625, 0.06024169921875, 0.1256103515625, ...	embed
69731854_c0	69731854	lisp	0	Title: How does `map` behave that matrix multiplication fails in this example? Problem title: How does `map` behave that matrix multiplication fails in this example? Tags: lisp, matrix-multiplication, scheme Problem: How does `map` behave that matrix multiplication fails in this example? I am trying to make a function ...	How does `map` behave that matrix multiplication fails in this example? How does `map` behave that matrix multiplication fails in this example? lisp matrix-multiplication scheme How Map Dot How does `map` behave that matrix multiplication fails in this example? I am trying to make a function that does matrix-vector mul...	[ -0.01080322265625, 0.033447265625, -0.0047607421875, 0.000522613525390625, -0.02099609375, -0.01239013671875, -0.010986328125, 0.014404296875, -0.0084228515625, -0.0166015625, -0.00007486343383789062, 0.006195068359375, -0.0111083984375, 0.00494384765625, -0.041259765625, -0.0162353515...	[ 11249, 62346, 186, 68991, 50944, 127664, 35782, 7, 27781, 425, 400, 7008, 144227, 182867, 150370, 42719, 84929, 14602, 450, 1363, 903, 31577, 32354, 272, 18770, 55681, 50339, 18151, 61924, 7077, 20633, 38742, 6626, 22834, 22230, 30646, 84751, ...	[ 0.07989501953125, 0.2423095703125, 0.054595947265625, 0.1871337890625, 0.1749267578125, 0.184814453125, 0.234619140625, 0.1326904296875, 0.1822509765625, 0.06097412109375, 0.06787109375, 0.1685791015625, 0.0732421875, 0.06640625, 0.171875, 0.2371826171875, 0.2103271484375, 0.022323...	embed
42753900_c0	42753900	lisp	0	Title: Creating 2 files and writing to them different content from another file in Lisp Problem title: Creating 2 files and writing to them different content from another file in Lisp Tags: lisp, common-lisp, file, io Problem: Creating 2 files and writing to them different content from another file in Lisp I am trying ...	Creating 2 files and writing to them different content from another file in Lisp Creating 2 files and writing to them different content from another file in Lisp lisp common-lisp file io another Creating Lisp file_a fr_chars.txt file_B chars_1.txt file_C chars_2.txt HERE CHARS Creating 2 files and writing to them diffe...	[ 0.0101318359375, -0.00119781494140625, -0.01611328125, 0.02392578125, -0.007171630859375, 0.0125732421875, 0.00396728515625, -0.00482177734375, -0.0021820068359375, 0.0208740234375, 0.0045166015625, 0.01025390625, 0.0047607421875, 0.01239013671875, 0.0078125, -0.01519775390625, 0.006...	[ 56781, 116, 102158, 32562, 47, 2856, 12921, 10941, 1295, 15700, 11435, 1261, 7008, 400, 39210, 4086, 254, 22995, 11, 14119, 9254, 124326, 571, 21441, 441, 5442, 25087, 15396, 23, 31577, 33022, 170470, 209, 124519, 111, 1632, 10588, 18151, 2...	[ 0.120361328125, 0.1573486328125, 0.1796875, 0.1741943359375, 0.0975341796875, 0.049896240234375, 0.15478515625, 0.1585693359375, 0.0723876953125, 0.07012939453125, 0.1392822265625, 0.1468505859375, 0.1937255859375, 0.109375, 0.0780029296875, 0.09014892578125, 0.1256103515625, 0.086...	embed
30004801_c0	30004801	lisp	0	Title: Common Lisp - Writing a function that detects circular lists Problem title: Common Lisp - Writing a function that detects circular lists Tags: function, common-lisp, lisp, list, recursion Problem: Common Lisp - Writing a function that detects circular lists I have an assignment for my CS functional languages cla...	Common Lisp - Writing a function that detects circular lists Common Lisp - Writing a function that detects circular lists function common-lisp lisp list recursion Common Lisp Writing list1 list2 Common Lisp - Writing a function that detects circular lists I have an assignment for my CS functional languages class where ...	[ 0.002044677734375, 0.0091552734375, 0.0130615234375, 0.0218505859375, -0.00093841552734375, -0.000278472900390625, 0.0037384033203125, 0.011962890625, 0.003326416015625, -0.0084228515625, -0.00933837890625, 0.00494384765625, 0.00537109375, 0.0029144287109375, 0.01129150390625, 0.020263...	[ 151301, 1261, 7008, 213185, 32354, 96391, 115339, 5303, 39210, 4086, 254, 400, 195625, 304, 95486, 25841, 123309, 46876, 18507, 33022, 36766, 34475, 6863, 86595, 5844, 3714, 3642, 12765, 100, 2481, 7225, 34627, 158, 12008, 5701, 29823, 68034, ...	[ 0.163818359375, 0.149658203125, 0.1488037109375, 0.147705078125, 0.1845703125, 0.192626953125, 0.253173828125, 0.2083740234375, 0.1170654296875, 0.0927734375, 0.0931396484375, 0.08209228515625, 0.2027587890625, 0.1195068359375, 0.092529296875, 0.04998779296875, 0.0826416015625, 0.0...	embed
77516492_c0	77516492	lisp	0	Title: Calling a lambda function in a loop from a variable defined with `with` Problem title: Calling a lambda function in a loop from a variable defined with `with` Tags: lisp, common-lisp Problem: Calling a lambda function in a loop from a variable defined with `with` I have the following lisp code (defun sum (vec) "...	Calling a lambda function in a loop from a variable defined with `with` Calling a lambda function in a loop from a variable defined with `with` lisp common-lisp a Calling Summiert Elemente Vektors Hilfsfunktion Quadrieren Elements Berechnet Varianz some_func some_vector COMMON-LISP-USER::SOME_FUNC Condition UNDEFINED-F...	[ 0.01422119140625, 0.007568359375, -0.0146484375, -0.01318359375, -0.00109100341796875, -0.01287841796875, 0.00994873046875, 0.0034637451171875, 0.01483154296875, -0.0361328125, -0.000942230224609375, 0.000946044921875, -0.00506591796875, -0.00909423828125, 0.0225830078125, 0.0068969726...	[ 26265, 21, 6492, 85, 32354, 23, 40956, 1295, 77336, 61924, 678, 76228, 400, 7008, 39210, 4086, 254, 214, 36335, 39, 6280, 48325, 310, 50399, 199221, 64558, 83227, 4921, 206, 111477, 33957, 16498, 272, 18770, 82707, 67616, 683, 1062, 50184, ...	[ 0.1337890625, 0.06231689453125, 0.1983642578125, 0.1656494140625, 0.173828125, 0.026336669921875, 0.1915283203125, 0.06640625, 0.2166748046875, 0.1514892578125, 0.08563232421875, 0.22802734375, 0.088134765625, 0.1634521484375, 0.0770263671875, 0.06640625, 0.1435546875, 0.0285186767...	embed
31992317_c0	31992317	lisp	0	Title: Apparent 'eval' of quote symbol in CLISP Problem title: Apparent 'eval' of quote symbol in CLISP Tags: clisp, common-lisp, lisp Problem: Apparent 'eval' of quote symbol in CLISP Some output from the CLISP REPL: [1]> (list 'list 1 2 3) (LIST 1 2 3) [2]> (list 'list '(1 2 3)) (LIST (1 2 3)) [3]...	Apparent 'eval' of quote symbol in CLISP Apparent 'eval' of quote symbol in CLISP clisp common-lisp lisp Apparent CLISP LIST QUOTE Apparent 'eval' of quote symbol in CLISP Some output from the CLISP REPL: The first three, I understand exactly what's going on: The list function is passed a symbol ( '...	[ 0.01153564453125, 0.0201416015625, 0.011962890625, 0.0003509521484375, -0.015380859375, 0.00408935546875, 0.020751953125, -0.013916015625, 0.01385498046875, 0.0155029296875, -0.0126953125, -0.000904083251953125, 0.009765625, 0.01239013671875, -0.0301513671875, 0.02490234375, -0.00023...	[ 99547, 3768, 1405, 66747, 26582, 313, 67616, 683, 95701, 7008, 39210, 4086, 254, 400, 195977, 232856, 111, 23, 140992, 9069, 21130, 17262, 28219, 5303, 32354, 115081, 6562, 68726, 16750, 9842, 678, 22759, 927, 55681, 5908, 44084, 22027, 18, ...	[ 0.1724853515625, 0.055938720703125, 0.2037353515625, 0.266845703125, 0.2310791015625, 0.050506591796875, 0.15576171875, 0.1983642578125, 0.1107177734375, 0.17529296875, 0.06182861328125, 0.0811767578125, 0.139892578125, 0.048126220703125, 0.1942138671875, 0.276123046875, 0.0152893066...	embed
17312128_c0	17312128	lisp	0	Title: Using scheme/racket to return specific items from a list Problem title: Using scheme/racket to return specific items from a list Tags: lisp, scheme, racket Problem: Using scheme/racket to return specific items from a list What I would like to do is create a function that takes in a list of values and a list of c...	Using scheme/racket to return specific items from a list Using scheme/racket to return specific items from a list lisp scheme racket a Using Problem Done Using scheme/racket to return specific items from a list What I would like to do is create a function that takes in a list of values and a list of characters and coal...	[ -0.0189208984375, 0.0159912109375, 0.00148773193359375, 0.0245361328125, -0.0019683837890625, 0.0142822265625, -0.017822265625, -0.0030059814453125, -0.007415771484375, 0.0040283203125, 0.01007080078125, -0.0272216796875, -0.00677490234375, 0.003692626953125, -0.01348876953125, 0.00338...	[ 345, 6953, 150370, 64, 219, 27853, 30646, 29458, 55769, 1295, 5303, 47, 400, 7008, 673, 15649, 984, 1884, 54, 28282, 32354, 51776, 23, 111, 142424, 136, 124850, 5798, 1577, 329, 70, 42518, 214, 257, 28016, 58, 5351, 2806, 121392, 538, 3...	[ 0.115966796875, 0.0301513671875, 0.2484130859375, 0.030609130859375, 0.1170654296875, 0.242431640625, 0.2227783203125, 0.1744384765625, 0.194580078125, 0.129150390625, 0.20751953125, 0.009979248046875, 0.093017578125, 0.1954345703125, 0.1163330078125, 0.1668701171875, 0.0376892089843...	embed
51845973_c1	51845973	lisp	1	"blablabla" :type string) (z 1.8d0 :type double-float)) quickly hash the structure slots information using ( etypecase , subtypep ). EDIT: I want to hash lisp-structure TYPE SLOTS "string sint8 float array" to read the data correctly when received/sent. If I have a struct. st: (typecase st (structure-object (recursive...	"blablabla" :type string) (z 1.8d0 :type double-float)) quickly hash the structure slots information using ( etypecase , subtypep ). EDIT: I want to hash lisp-structure TYPE SLOTS "string sint8 float array" to read the data correctly when received/sent. If I have a struct. st: (typecase st (structure-object (recursive...	[ -0.0147705078125, 0.01092529296875, -0.00775146484375, -0.0047607421875, -0.006744384765625, 0.01385498046875, 0.00958251953125, -0.005218505859375, -0.00787353515625, 0.005584716796875, -0.01129150390625, -0.018798828125, 0.0098876953125, -0.01043701171875, 0.007537841796875, 0.005584...	[ 7119, 50986, 79315, 169, 79875, 2389, 41929, 52347, 257, 69405, 1556, 127, 45646, 121892, 4677, 17368, 28, 58437, 1614, 254, 3444, 400, 7008, 137656, 95267, 21907, 115447, 91693, 19638, 1019, 21917, 10298, 53, 12301, 2053, 26785, 75204, 12832...	[ 0.1865234375, 0.23046875, 0.1981201171875, 0.07293701171875, 0.1175537109375, 0.055908203125, 0.0361328125, 0.117919921875, 0.03790283203125, 0.140869140625, 0.169189453125, 0.17041015625, 0.25634765625, 0.2177734375, 0.1243896484375, 0.04168701171875, 0.02557373046875, 0.209960937...	embed
74578667_c0	74578667	lisp	0	Title: Is there a pattern for LOOP-like macro mini-languages? Problem title: Is there a pattern for LOOP-like macro mini-languages? Tags: common-lisp, lisp-macros, lisp, syntax-error Problem: Is there a pattern for LOOP-like macro mini-languages? I am attempting to answer the following exercise. Write a macro function ...	Is there a pattern for LOOP-like macro mini-languages? Is there a pattern for LOOP-like macro mini-languages? common-lisp lisp-macros lisp syntax-error LOOP-like Is there a pattern for LOOP-like macro mini-languages? I am attempting to answer the following exercise. My solution is the following: That works fine, but I'...	[ 0.01068115234375, 0.01361083984375, -0.00445556640625, 0.0103759765625, 0.0028839111328125, 0.00640869140625, 0.0196533203125, 0.0031890869140625, 0.0167236328125, -0.004364013671875, -0.00897216796875, -0.009033203125, -0.01806640625, -0.01214599609375, 0.0260009765625, 0.01611328125,...	[ 2071, 2685, 10, 103510, 100, 22215, 20880, 5062, 111789, 7665, 196651, 7, 39210, 4086, 254, 400, 7008, 35572, 3666, 6002, 86531, 188800, 81887, 35166, 81979, 29806, 43240, 5885, 112668, 214521, 110, 175199, 92733, 5557, 10750, 5809, 23937, 26...	[ 0.0151824951171875, 0.0582275390625, 0.0853271484375, 0.2471923828125, 0.05010986328125, 0.158935546875, 0.2388916015625, 0.2120361328125, 0.2257080078125, 0.21435546875, 0.19384765625, 0.04876708984375, 0.07550048828125, 0.0552978515625, 0.1337890625, 0.0701904296875, 0.138427734375...	embed
18966899_c0	18966899	lisp	0	Title: how to wrap forms with an already written outer form in paredit Problem title: how to wrap forms with an already written outer form in paredit Tags: paredit, emacs, lisp Problem: how to wrap forms with an already written outer form in paredit Suppose I have this code (hello world) (hi world) Then it comes to my ...	how to wrap forms with an already written outer form in paredit how to wrap forms with an already written outer form in paredit paredit emacs lisp how to wrap forms with an already written outer form in paredit Suppose I have this code Then it comes to my mind that I should wrap that with the following form: resulting ...	[ 0.0030059814453125, 0.038818359375, -0.0264892578125, 0.0026702880859375, -0.0084228515625, 0.0289306640625, 0.0033416748046875, 0.007080078125, 0.00689697265625, -0.038818359375, 0.00335693359375, 0.02294921875, -0.010009765625, 0.00167083740234375, 0.02783203125, -0.0184326171875, ...	[ 3642, 47, 137565, 3173, 7, 678, 142, 21771, 59121, 1810, 56, 23, 366, 45082, 352, 2263, 400, 7008, 18151, 56104, 54, 10366, 33022, 82940, 46485, 8108, 5429, 11, 48398, 24234, 313, 9, 19364, 10681, 83613, 186351, 8966, 67229, 154107, 37676...	[ 0.06158447265625, 0.0174407958984375, 0.2430419921875, 0.2474365234375, 0.07037353515625, 0.150634765625, 0.043121337890625, 0.1912841796875, 0.18359375, 0.17626953125, 0.171142578125, 0.013671875, 0.1187744140625, 0.2130126953125, 0.002777099609375, 0.0294952392578125, 0.00268554687...	embed
3793083_c0	3793083	lisp	0	Title: Scheme Code Analysis for Space vs. Time Problem title: Scheme Code Analysis for Space vs. Time Tags: scheme, lisp, complexity-theory, code-analysis Problem: Scheme Code Analysis for Space vs. Time I'm working my way through the online MIT lectures for the classic 6.001 course: The Structure and Interpretation of...	Scheme Code Analysis for Space vs. Time Scheme Code Analysis for Space vs. Time scheme lisp complexity-theory code-analysis Scheme Analysis Space Time i-2 i-1 Scheme Code Analysis for Space vs. Time I'm working my way through the online MIT lectures for the classic 6.001 course: The Structure and Interpretation of Comp...	[ 0.004913330078125, 0.02783203125, -0.00128936767578125, 0.00177764892578125, -0.00555419921875, -0.01092529296875, -0.0086669921875, -0.022216796875, 0.00482177734375, -0.024169921875, 0.014404296875, -0.0191650390625, -0.0091552734375, -0.00897216796875, -0.0015716552734375, 0.0067749...	[ 34702, 282, 28864, 114837, 100, 43045, 20209, 19055, 164, 150370, 400, 7008, 27140, 2481, 2347, 18151, 174976, 17, 5428, 5759, 20697, 70, 1118, 78999, 59619, 7, 54704, 2289, 34479, 15411, 63667, 238, 6644, 159838, 1363, 111, 40139, 7663, 25...	[ 0.20947265625, 0.1689453125, 0.2264404296875, 0.1744384765625, 0.0584716796875, 0.2208251953125, 0.140869140625, 0.181640625, 0.05218505859375, 0.2108154296875, 0.02777099609375, 0.124267578125, 0.1705322265625, 0.05169677734375, 0.011199951171875, 0.2191162109375, 0.1400146484375, ...	embed
79484725_c1	79484725	lisp	1	"LWPOLYLINE") (length (vl-remove-if-not '(lambda (x) (= (car x) 10)) ent))) ((= (cdr (assoc 0 ent)) "POLYLINE") (let ((count 0) (vertex (entnext ent))) (while (and vertex (= (cdr (assoc 0 (entget vertex))) "VERTEX")) (setq count (1+ count)) (setq vertex (entnext vertex))) count)) (t 0))) ;; Function to sort vertices i...	"LWPOLYLINE") (length (vl-remove-if-not '(lambda (x) (= (car x) 10)) ent))) ((= (cdr (assoc 0 ent)) "POLYLINE") (let ((count 0) (vertex (entnext ent))) (while (and vertex (= (cdr (assoc 0 (entget vertex))) "VERTEX")) (setq count (1+ count)) (setq vertex (entnext vertex))) count)) (t 0))) ;; Function to sort vertices i...	[ 0.006561279296875, 0.0174560546875, 0.00135040283203125, -0.003814697265625, -0.0146484375, 0.00421142578125, 0.0228271484375, -0.004150390625, 0.0035858154296875, -0.00628662109375, -0.0123291015625, -0.00872802734375, 0.005401611328125, -0.020751953125, -0.012451171875, 0.01135253906...	[ 866, 1456, 9698, 19917, 57339, 23986, 927, 50132, 26973, 272, 3190, 10869, 6492, 85, 425, 3284, 1022, 209, 18, 32149, 7569, 73395, 757, 44, 1974, 71013, 814, 24371, 2517, 29062, 204610, 493, 3794, 33255, 122691, 3509, 864, 54529, 1328, 86...	[ 0.031036376953125, 0.139404296875, 0.1376953125, 0.197265625, 0.30126953125, 0.0765380859375, 0.047821044921875, 0.1392822265625, 0.083740234375, 0.076171875, 0.0289154052734375, 0.0176544189453125, 0.1527099609375, 0.0732421875, 0.049713134765625, 0.1748046875, 0.055145263671875, ...	embed
26979529_c0	26979529	lisp	0	Title: Writing output to file. LISP Problem title: Writing output to file. LISP Tags: common-lisp, file-io, lisp, stream Problem: Writing output to file. LISP I've written a LISP-program, it writes some output data to the CommonLisp console via princ and write-line operators. How to redo it to it writes output data to ...	Writing output to file. LISP Writing output to file. LISP common-lisp file-io lisp stream Writing LISP koeff1 koeff2 line1 divisionByZeroKoef1 divisionByZeroKoef2 koeffHyp1 koeffHyp2 Writing output to file. LISP I've written a LISP-program, it writes some output data to the CommonLisp console via princ and write-line o...	[ 0.00408935546875, -0.004119873046875, 0.007110595703125, -0.0120849609375, -0.01239013671875, 0.00970458984375, 0.0020751953125, -0.00634765625, -0.00109100341796875, 0.023193359375, 0.0125732421875, -0.006622314453125, 0.0208740234375, -0.03125, 0.000293731689453125, 0.0230712890625, ...	[ 213185, 140992, 47, 11435, 16970, 9434, 39210, 4086, 254, 846, 400, 7008, 75973, 298, 68053, 418, 304, 13315, 91853, 1511, 4036, 4240, 60977, 59121, 18749, 33022, 2053, 151301, 9506, 130250, 1829, 2448, 238, 2256, 39933, 11249, 41313, 1528, ...	[ 0.202392578125, 0.2646484375, 0.175048828125, 0.2061767578125, 0.14599609375, 0.255126953125, 0.12060546875, 0.0926513671875, 0.162109375, 0.1461181640625, 0.1214599609375, 0.2122802734375, 0.158935546875, 0.02459716796875, 0.1519775390625, 0.009765625, 0.0625, 0.140869140625, 0....	embed
57300332_c0	57300332	lisp	0	Title: Why does counting up in recursive functions always require two parameters? Problem title: Why does counting up in recursive functions always require two parameters? Tags: scheme, recursion, lisp Problem: Why does counting up in recursive functions always require two parameters? I've written some simple loops wit...	Why does counting up in recursive functions always require two parameters? Why does counting up in recursive functions always require two parameters? scheme recursion lisp two 1 Why Why does counting up in recursive functions always require two parameters? I've written some simple loops with recursion and the loop macr...	[ -0.0029449462890625, 0.01336669921875, 0.007568359375, -0.00168609619140625, 0.009765625, 0.009765625, -0.000934600830078125, -0.01458740234375, 0.0181884765625, -0.02685546875, 0.00811767578125, -0.033447265625, 0.0098876953125, 0.019775390625, 0.01953125, -0.030029296875, -0.012939...	[ 44084, 54529, 214, 1257, 23, 195625, 5844, 32354, 11343, 64209, 6626, 171859, 7, 150370, 1830, 400, 7008, 14602, 8781, 40956, 111789, 15044, 1314, 27117, 7565, 27781, 28412, 158661, 35662, 5084, 21493, 43852, 42, 71013, 2037, 54241, 21286, 67...	[ 0.123046875, 0.182861328125, 0.0458984375, 0.1844482421875, 0.0198822021484375, 0.20654296875, 0.13232421875, 0.174072265625, 0.1243896484375, 0.1531982421875, 0.1929931640625, 0.2269287109375, 0.033935546875, 0.11376953125, 0.028961181640625, 0.01806640625, 0.08447265625, 0.015914...	embed
6098087_c0	6098087	lisp	0	Title: Simple Lisp Case statement question - problem comparing to nil Problem title: Simple Lisp Case statement question - problem comparing to nil Tags: functional-programming, case-statement, lisp Problem: Simple Lisp Case statement question - problem comparing to nil I'm trying to use a case statement to make some c...	Simple Lisp Case statement question - problem comparing to nil Simple Lisp Case statement question - problem comparing to nil functional-programming case-statement lisp Simple Lisp Case NIL Simple Lisp Case statement question - problem comparing to nil I'm trying to use a case statement to make some code more readable....	[ 0.0096435546875, 0.006378173828125, 0.00811767578125, -0.00167083740234375, -0.00015735626220703125, -0.00823974609375, 0.041015625, -0.015869140625, -0.005859375, 0.01080322265625, 0.00144195556640625, 0.0194091796875, -0.006378173828125, -0.01123046875, -0.0036773681640625, 0.0043945...	[ 60552, 1261, 7008, 43731, 63805, 9655, 2967, 37397, 214, 47, 17324, 123309, 28966, 7225, 61340, 400, 541, 16444, 31577, 18151, 1286, 12301, 2886, 4488, 237, 36549, 2174, 11343, 26946, 225490, 3853, 959, 29568, 17306, 15400, 123166, 74918, 277...	[ 0.1588134765625, 0.1575927734375, 0.195556640625, 0.218017578125, 0.2271728515625, 0.1427001953125, 0.176025390625, 0.212890625, 0.0304412841796875, 0.0859375, 0.2144775390625, 0.129638671875, 0.1014404296875, 0.2108154296875, 0.1600341796875, 0.10467529296875, 0.06903076171875, 0....	embed
40565458_c0	40565458	lisp	0	Title: Test if all elements of a list are different from each other Problem title: Test if all elements of a list are different from each other Tags: common-lisp, lisp Problem: Test if all elements of a list are different from each other I have a list of lists and want to test if all elements are different from each ot...	Test if all elements of a list are different from each other Test if all elements of a list are different from each other common-lisp lisp each 1 Test Test if all elements of a list are different from each other I have a list of lists and want to test if all elements are different from each other, i.e. equal should ret...	[ -0.0145263671875, -0.003997802734375, 0.006866455078125, -0.00897216796875, -0.01055908203125, -0.010986328125, 0.0269775390625, 0.00469970703125, -0.00174713134765625, 0.0072021484375, -0.0179443359375, 0.02587890625, 0.0234375, 0.012939453125, -0.016357421875, 0.02197265625, 0.0105...	[ 8647, 2174, 756, 80854, 111, 5303, 621, 12921, 1295, 12638, 3789, 39210, 4086, 254, 400, 7008, 106, 3444, 47, 3034, 105950, 5608, 30646, 17324, 162515, 17569, 34390, 109921, 161789, 208244, 40956, 64549, 5570, 1957, 3095, 195625, 32354, 28271...	[ 0.2012939453125, 0.11376953125, 0.1510009765625, 0.1910400390625, 0.0128173828125, 0.2110595703125, 0.075439453125, 0.225341796875, 0.1416015625, 0.10113525390625, 0.144287109375, 0.08306884765625, 0.050933837890625, 0.09234619140625, 0.046844482421875, 0.12548828125, 0.0352783203125...	embed
2060744_c0	2060744	lisp	0	Title: What are the benefits of letrec? Problem title: What are the benefits of letrec? Tags: functional-programming, letrec, lisp, racket, scheme Problem: What are the benefits of letrec? While reading "The Seasoned Schemer" I've begun to learn about letrec . I understand what it does (can be duplicated with a Y-Combi...	What are the benefits of letrec? What are the benefits of letrec? functional-programming letrec lisp racket scheme What What are the benefits of letrec? While reading "The Seasoned Schemer" I've begun to learn about letrec . I understand what it does (can be duplicated with a Y-Combinator) but the book is using it in l...	[ -0.01190185546875, 0.00799560546875, 0.02490234375, 0.02490234375, 0.01385498046875, -0.00927734375, -0.018310546875, -0.007720947265625, -0.0018157958984375, -0.007781982421875, -0.0169677734375, -0.0185546875, -0.0101318359375, -0.01068115234375, 0.003997802734375, -0.002593994140625...	[ 4865, 621, 70, 72382, 111, 2633, 31688, 123309, 28966, 400, 7008, 673, 27853, 150370, 16454, 3957, 85135, 297, 34702, 1991, 30698, 28219, 4398, 171763, 678, 990, 10770, 19155, 1290, 12877, 17368, 23414, 456, 64240, 21771, 61924, 104, 32354, ...	[ 0.0173492431640625, 0.0277252197265625, 0.047943115234375, 0.2020263671875, 0.09039306640625, 0.1700439453125, 0.2958984375, 0.1312255859375, 0.121337890625, 0.0693359375, 0.123291015625, 0.031646728515625, 0.1591796875, 0.142333984375, 0.05560302734375, 0.05084228515625, 0.193237304...	embed
21863997_c0	21863997	lisp	0	Title: Macro that generates macro form wrapped in let bound variables Problem title: Macro that generates macro form wrapped in let bound variables Tags: lisp, common-lisp, macros, quote Problem: Macro that generates macro form wrapped in let bound variables I've been trying to write a macro that generates, among other...	Macro that generates macro form wrapped in let bound variables Macro that generates macro form wrapped in let bound variables lisp common-lisp macros quote Macro Expands Macro that generates macro form wrapped in let bound variables I've been trying to write a macro that generates, among other things, a compiler macro ...	[ -0.004638671875, 0.020751953125, -0.0098876953125, -0.0021514892578125, 0.007415771484375, 0.01324462890625, 0.01495361328125, -0.0098876953125, -0.002197265625, -0.03759765625, -0.017333984375, 0.006072998046875, 0.0025634765625, 0.010009765625, 0.0164794921875, -0.018310546875, -0....	[ 4727, 516, 139392, 111789, 3173, 137565, 20051, 2633, 99091, 77336, 400, 7008, 39210, 4086, 254, 66747, 60075, 2940, 23, 31577, 33022, 9969, 34759, 5701, 9351, 20187, 18151, 179933, 3444, 1884, 903, 26366, 128239, 7, 11, 275, 31089, 10941, ...	[ 0.10455322265625, 0.1578369140625, 0.2032470703125, 0.222900390625, 0.2027587890625, 0.130126953125, 0.022216796875, 0.23388671875, 0.175537109375, 0.1846923828125, 0.05316162109375, 0.14306640625, 0.06158447265625, 0.00457763671875, 0.10565185546875, 0.16796875, 0.0467529296875, 0...	embed
10467111_c1	10467111	lisp	1	ING PROD ELEMENTS ;;; FINDING ACCESSIBLE ELEMENTS (defun ACCESS-STEP (P ACC) ;;(format t "Pacc = ~S~%" P) ;;(format t "ACC = ~S~%" ACC) (if (null P) ACC (if (member (first (first P)) ACC) (ACCESS-STEP (rest P) (union (rest (first P)) ACC)) (ACCESS-STEP (rest P) ACC)))) (defun ACCESS-AUX (P ACC oldLength) (if (= (length...	ING PROD ELEMENTS ;;; FINDING ACCESSIBLE ELEMENTS (defun ACCESS-STEP (P ACC) ;;(format t "Pacc = ~S~%" P) ;;(format t "ACC = ~S~%" ACC) (if (null P) ACC (if (member (first (first P)) ACC) (ACCESS-STEP (rest P) (union (rest (first P)) ACC)) (ACCESS-STEP (rest P) ACC)))) (defun ACCESS-AUX (P ACC oldLength) (if (= (length...	[ -0.01263427734375, 0.0208740234375, 0.0034027099609375, 0.029296875, -0.0019378662109375, 0.0045166015625, -0.017333984375, 0.002685546875, 0.015869140625, -0.00897216796875, 0.0069580078125, 0.01275634765625, 0.00689697265625, -0.02880859375, -0.000579833984375, 0.0181884765625, 0.0...	[ 77009, 10514, 397, 9780, 124661, 294, 157724, 67227, 156906, 12944, 194695, 568, 125149, 112, 16498, 9, 43865, 683, 62, 13709, 51727, 808, 8335, 10060, 6780, 3949, 436, 3190, 139550, 27417, 13448, 56644, 15, 87046, 80126, 71609, 10332, 449, ...	[ 0.24267578125, 0.20361328125, 0.1734619140625, 0.155029296875, 0.1802978515625, 0.1361083984375, 0.10595703125, 0.16259765625, 0.125, 0.172607421875, 0.25048828125, 0.15478515625, 0.1654052734375, 0.0810546875, 0.1273193359375, 0.0228424072265625, 0.173583984375, 0.09051513671875, ...	embed
4682576_c0	4682576	lisp	0	Title: Find the most nested list inside a list in Common Lisp Problem title: Find the most nested list inside a list in Common Lisp Tags: nested-lists, common-lisp, lisp Problem: Find the most nested list inside a list in Common Lisp I'm new to Common Lisp and functional programming, but I have a lot of experience in l...	Find the most nested list inside a list in Common Lisp Find the most nested list inside a list in Common Lisp nested-lists common-lisp lisp Find Common Lisp Find the most nested list inside a list in Common Lisp I'm new to Common Lisp and functional programming, but I have a lot of experience in languages like C, C++, ...	[ -0.00811767578125, 0.0177001953125, 0.000904083251953125, 0.0020599365234375, 0.00604248046875, 0.03759765625, -0.003509521484375, -0.007171630859375, -0.00250244140625, -0.03564453125, -0.0084228515625, -0.015625, -0.0019378662109375, 0.019287109375, 0.008544921875, 0.01068115234375, ...	[ 26040, 70, 2684, 8512, 71, 5303, 46132, 151301, 1261, 7008, 6562, 39210, 4086, 254, 400, 23, 123309, 56037, 16981, 46876, 37223, 4904, 41925, 63134, 90791, 107730, 2046, 6528, 49878, 510, 4734, 1632, 1614, 25737, 58755, 98441, 50478, 17366, ...	[ 0.124755859375, 0.04632568359375, 0.2030029296875, 0.25390625, 0.15576171875, 0.247802734375, 0.181884765625, 0.1851806640625, 0.158447265625, 0.15185546875, 0.160400390625, 0.09661865234375, 0.06805419921875, 0.080810546875, 0.06781005859375, 0.016693115234375, 0.09429931640625, 0...	embed
66244872_c0	66244872	lisp	0	Title: GISC exercise 11.22d: Why is this stateful? Problem title: GISC exercise 11.22d: Why is this stateful? Tags: common-lisp, lisp Problem: GISC exercise 11.22d: Why is this stateful? Exercise 11.22d of David Touretzky's "A Gentle Introduction to Symbolic Computation" states: "[...] Write a function COUNT-BASES that...	GISC exercise 11.22d: Why is this stateful? GISC exercise 11.22d: Why is this stateful? common-lisp lisp GISC Why COUNT-BASES STRAND GISC exercise 11.22d: Why is this stateful? Exercise 11.22d of David Touretzky's "A Gentle Introduction to Symbolic Computation" states: "[...] Write a function COUNT-BASES that counts th...	[ 0.00151824951171875, 0.004608154296875, 0.0084228515625, 0.0048828125, 0.0179443359375, 0.019775390625, 0.01025390625, -0.01251220703125, 0.01397705078125, -0.025146484375, -0.0096435546875, 0.0050048828125, 0.00007867813110351562, 0.033447265625, 0.00592041015625, 0.0098876953125, 0...	[ 42887, 14495, 81979, 4541, 4015, 71, 44084, 83, 903, 11341, 7844, 39210, 4086, 254, 400, 7008, 8244, 64163, 9, 8031, 65596, 46549, 45029, 155534, 6765, 11330, 41873, 44704, 44891, 131899, 159415, 32354, 54529, 14012, 51039, 12638, 10644, 23, ...	[ 0.138427734375, 0.1358642578125, 0.183837890625, 0.115234375, 0.1380615234375, 0.1141357421875, 0.1380615234375, 0.0435791015625, 0.06768798828125, 0.1634521484375, 0.193359375, 0.0892333984375, 0.03948974609375, 0.10888671875, 0.04937744140625, 0.11083984375, 0.096435546875, 0.165...	embed
1484335_c0	1484335	lisp	0	Title: In common-lisp, how do I modify part of a list parameter from within a function without changing the original list? Problem title: In common-lisp, how do I modify part of a list parameter from within a function without changing the original list? Tags: common-lisp, lisp, function, parameter-passing, pass-by-refe...	In common-lisp, how do I modify part of a list parameter from within a function without changing the original list? In common-lisp, how do I modify part of a list parameter from within a function without changing the original list? common-lisp lisp function parameter-passing pass-by-reference within In common-lisp, how...	[ -0.005645751953125, 0.02978515625, 0.0029754638671875, -0.002166748046875, -0.0184326171875, -0.011962890625, -0.00787353515625, -0.004425048828125, 0.002655029296875, 0.01129150390625, 0.003204345703125, 0.01446533203125, 0.0020599365234375, 0.009765625, 0.0264892578125, 0.00183868408...	[ 39210, 4086, 254, 3642, 2811, 40383, 2831, 5303, 171859, 1295, 28032, 32354, 15490, 151134, 7311, 400, 7008, 13409, 27875, 1272, 239879, 54, 31577, 47, 1261, 15549, 10941, 52490, 83, 27494, 29568, 28219, 18151, 43240, 84751, 11782, 6954, 2841...	[ 0.1458740234375, 0.1331787109375, 0.16845703125, 0.03912353515625, 0.1572265625, 0.148681640625, 0.10107421875, 0.188232421875, 0.1898193359375, 0.07672119140625, 0.1356201171875, 0.185546875, 0.089599609375, 0.0989990234375, 0.031829833984375, 0.1158447265625, 0.2276611328125, 0.0...	embed
15853642_c0	15853642	lisp	0	Title: C++ How do I bring this lisp function to compilable code? Problem title: C++ How do I bring this lisp function to compilable code? Tags: lisp, c%2B%2B Problem: C++ How do I bring this lisp function to compilable code? I have a huge lisp function that I want to use in my c++ application. This function was generat...	C++ How do I bring this lisp function to compilable code? C++ How do I bring this lisp function to compilable code? lisp c%2B%2B How prev_is_pause prev_prev_gender houses_from_month_start customer_numsegs customers_from_company_start prev_jobtype next_hairtype called_houses_from_month_end next_next_single month_numhous...	[ 0.01416015625, 0.00469970703125, -0.001373291015625, 0.005340576171875, 0.0001544952392578125, 0.0296630859375, -0.0096435546875, -0.01068115234375, -0.0035552978515625, -0.05615234375, -0.009033203125, -0.004180908203125, 0.0045166015625, -0.013427734375, 0.01806640625, 0.004302978515...	[ 313, 37223, 11249, 19095, 903, 400, 7008, 32354, 47, 98352, 2661, 18151, 501, 28468, 164, 149302, 4692, 334, 23200, 18276, 161063, 15477, 17137, 43373, 2606, 25398, 59463, 146365, 36791, 50986, 11737, 75512, 35839, 23923, 3611, 29062, 6953, 3...	[ 0.045928955078125, 0.2626953125, 0.0535888671875, 0.129638671875, 0.036895751953125, 0.18359375, 0.239013671875, 0.186279296875, 0.036651611328125, 0.2115478515625, 0.1282958984375, 0.1676025390625, 0.036407470703125, 0.2435302734375, 0.10748291015625, 0.2484130859375, 0.074829101562...	embed
30293205_c0	30293205	lisp	0	Title: lisp remove a the content of one list from another list Problem title: lisp remove a the content of one list from another list Tags: common-lisp, lisp Problem: lisp remove a the content of one list from another list I have a list of string like this called F: ("hello word i'am walid" "goodbye madame") => this li...	lisp remove a the content of one list from another list lisp remove a the content of one list from another list common-lisp lisp another start1 end1 start2 end2 lisp remove a the content of one list from another list I have a list of string like this called F: ("hello word i'am walid" "goodbye madame") => this list con...	[ -0.004913330078125, 0.01031494140625, -0.0174560546875, 0.022216796875, -0.031005859375, -0.001495361328125, 0.0247802734375, 0.005401611328125, 0.004058837890625, 0.0152587890625, 0.024169921875, -0.00040435791015625, -0.00054931640625, 0.007476806640625, -0.002166748046875, -0.000009...	[ 400, 7008, 87388, 10, 10941, 111, 1632, 5303, 1295, 15700, 39210, 4086, 254, 4034, 3564, 765, 79315, 1884, 563, 127, 13817, 2565, 17, 302, 13019, 71, 1272, 13, 25248, 282, 70541, 6626, 80854, 11782, 159, 903, 47416, 15695, 34153, 3444, ...	[ 0.156494140625, 0.2117919921875, 0.1995849609375, 0.040802001953125, 0.2193603515625, 0.0738525390625, 0.0806884765625, 0.2176513671875, 0.1243896484375, 0.0928955078125, 0.1007080078125, 0.1143798828125, 0.1689453125, 0.065673828125, 0.052978515625, 0.00347900390625, 0.1827392578125...	embed
51592401_c0	51592401	lisp	0	Title: Scheme/Racket: A function which separates a list into two lists of elements that match a certain predicate and those that don't match it Problem title: Scheme/Racket: A function which separates a list into two lists of elements that match a certain predicate and those that don't match it Tags: scheme, ...	Scheme/Racket: A function which separates a list into two lists of elements that match a certain predicate and those that don't match it Scheme/Racket: A function which separates a list into two lists of elements that match a certain predicate and those that don't match it scheme racket predicate list lisp Sc...	[ 0.007537841796875, 0.0277099609375, -0.00064849853515625, -0.01312255859375, -0.026611328125, 0.03515625, 0.0037384033203125, -0.0006561279296875, -0.0166015625, -0.018798828125, 0.00958251953125, -0.01092529296875, -0.0037994384765625, -0.01806640625, 0.000591278076171875, -0.00076293...	[ 34702, 282, 64, 12248, 27853, 12, 62, 32354, 3129, 84797, 7, 5303, 3934, 6626, 80854, 14858, 24233, 1653, 2063, 8382, 2301, 3768, 18, 136, 450, 150370, 673, 400, 7008, 2552, 1647, 55742, 133, 617, 123573, 32599, 28282, 23, 51776, 140992, ...	[ 0.241455078125, 0.2012939453125, 0.10662841796875, 0.1717529296875, 0.279296875, 0.021270751953125, 0.006622314453125, 0.2186279296875, 0.02740478515625, 0.2166748046875, 0.0802001953125, 0.222900390625, 0.1358642578125, 0.131591796875, 0.1656494140625, 0.21533203125, 0.0356140136718...	embed
23419350_c0	23419350	lisp	0	Title: Unicode error being thrown when trying to make rosserial module Problem title: Unicode error being thrown when trying to make rosserial module Tags: ros, unicode, python, lisp Problem: Unicode error being thrown when trying to make rosserial module ERROR: Unable to generate services for package 'rosserial_msgs':...	Unicode error being thrown when trying to make rosserial module Unicode error being thrown when trying to make rosserial module ros unicode python lisp RuntimeError SyntaxError TypeError rosserial_msgs/TopicInfo.msg genmsg.template_tools rosserial_msgs/Log.msg Unicode Generating Lisp rosserial_msgs TopicInfo.msg Traceb...	[ 0.014404296875, 0.006866455078125, -0.007354736328125, -0.01141357421875, -0.00775146484375, 0.005859375, 0.0140380859375, -0.00616455078125, -0.0137939453125, 0.000621795654296875, -0.01470947265625, -0.0595703125, 0.0164794921875, -0.0069580078125, -0.01611328125, -0.0118408203125, ...	[ 219778, 18499, 8035, 104250, 31577, 3249, 19429, 184, 51626, 88996, 60347, 112, 17198, 50828, 400, 7008, 28398, 6032, 18468, 19010, 60457, 4432, 9405, 77888, 93147, 9226, 177, 2982, 92558, 89110, 113972, 155370, 1261, 134912, 4937, 12620, 42724...	[ 0.2435302734375, 0.2122802734375, 0.0236968994140625, 0.1571044921875, 0.0750732421875, 0.06365966796875, 0.2271728515625, 0.104248046875, 0.1971435546875, 0.1617431640625, 0.1917724609375, 0.109130859375, 0.05841064453125, 0.0950927734375, 0.07855224609375, 0.1396484375, 0.031005859...	embed
67021976_c0	67021976	lisp	0	Title: How to check if two types are the same in Common Lisp? Problem title: How to check if two types are the same in Common Lisp? Tags: lisp, common-lisp Problem: How to check if two types are the same in Common Lisp? I'm learning Common Lisp and is now trying to replicate C++'s (boost's) lexical_cast<bool>(string) ....	How to check if two types are the same in Common Lisp? How to check if two types are the same in Common Lisp? lisp common-lisp How Common Lisp lexical_cast ret_type std::string std::is_same_v Otherwise DEFUN BOOLEAN WARNING ANSI Undefined How to check if two types are the same in Common Lisp? I'm learning Common Lisp a...	[ 0.000637054443359375, 0.00408935546875, 0.00872802734375, 0.01031494140625, -0.00897216796875, 0.0001220703125, -0.0037994384765625, 0.00567626953125, -0.01416015625, 0.00014400482177734375, 0.00177764892578125, -0.0006866455078125, -0.00110626220703125, -0.00848388671875, 0.000310897827...	[ 11249, 47, 12765, 2174, 6626, 52895, 621, 5701, 23, 151301, 1261, 7008, 400, 39210, 4086, 254, 75675, 21533, 55741, 10267, 50986, 6138, 71, 91693, 164, 40175, 334, 202001, 14006, 137142, 105621, 60873, 9902, 5983, 52080, 143126, 37223, 5510, ...	[ 0.04693603515625, 0.034637451171875, 0.1995849609375, 0.111083984375, 0.13818359375, 0.25341796875, 0.07525634765625, 0.1982421875, 0.076904296875, 0.171875, 0.1751708984375, 0.2003173828125, 0.10205078125, 0.1082763671875, 0.10211181640625, 0.126708984375, 0.0787353515625, 0.06164...	embed
1721716_c0	1721716	lisp	0	Title: Calculating the depth of a binary tree in LISP recursively Problem title: Calculating the depth of a binary tree in LISP recursively Tags: lisp, recursion, binary-tree Problem: Calculating the depth of a binary tree in LISP recursively I have the following binary tree A / \ B C / \ D E represented as a list in L...	Calculating the depth of a binary tree in LISP recursively Calculating the depth of a binary tree in LISP recursively lisp recursion binary-tree Calculating LISP Returns Calculating the depth of a binary tree in LISP recursively I have the following binary tree represented as a list in Lisp (A 2 B 0 C 2 D 0 E 0) where ...	[ 0.012939453125, 0.0267333984375, -0.007537841796875, 0.000926971435546875, 0.0032501220703125, 0.0244140625, -0.01251220703125, 0.0034637451171875, 0.005279541015625, -0.0230712890625, 0.007110595703125, -0.0283203125, -0.005035400390625, 0.01495361328125, 0.0225830078125, -0.011535644...	[ 212467, 26518, 70, 168867, 2394, 6635, 53201, 16970, 9434, 195625, 5844, 400, 7008, 62600, 173340, 111, 25632, 33636, 5303, 1261, 116, 757, 120820, 110, 123055, 101935, 14012, 29041, 22085, 106, 6626, 7413, 167375, 1295, 74855, 47, 2407, 3525...	[ 0.181884765625, 0.00616455078125, 0.036407470703125, 0.257568359375, 0.159423828125, 0.12939453125, 0.2198486328125, 0.1380615234375, 0.20166015625, 0.1983642578125, 0.1376953125, 0.111572265625, 0.2041015625, 0.1754150390625, 0.1876220703125, 0.03271484375, 0.06201171875, 0.137084...	embed
65463443_c0	65463443	lisp	0	Title: Maxima. Thread local storage exhausted Problem title: Maxima. Thread local storage exhausted Tags: sbcl, multithreading, common-lisp, lisp, maxima Problem: Maxima. Thread local storage exhausted I am writing mathematical modules for analysis problems. All files are compiled to .fasl. The sizes of these files are...	Maxima. Thread local storage exhausted Maxima. Thread local storage exhausted sbcl multithreading common-lisp lisp maxima Maxima Thread SBCL PRIMITIVE HALT Welcome LDB Maxima. Thread local storage exhausted I am writing mathematical modules for analysis problems. All files are compiled to .fasl. The sizes of these file...	[ 0.0201416015625, 0.0045166015625, -0.00823974609375, 0.025634765625, -0.00439453125, -0.00127410888671875, 0.0296630859375, 0.0189208984375, -0.006256103515625, -0.042236328125, -0.0023651123046875, 0.01470947265625, 0.0177001953125, -0.0125732421875, 0.0262451171875, 0.0108642578125, ...	[ 46540, 11, 136719, 4000, 132096, 146353, 297, 91, 275, 34937, 3869, 65847, 39210, 4086, 254, 400, 7008, 122200, 90944, 37486, 105029, 568, 169813, 94198, 91334, 339, 39463, 32562, 140363, 88996, 114137, 44402, 102158, 5974, 31773, 141, 13267, ...	[ 0.216064453125, 0.1910400390625, 0.2008056640625, 0.1658935546875, 0.2269287109375, 0.2347412109375, 0.06884765625, 0.0123291015625, 0.069580078125, 0.1466064453125, 0.067138671875, 0.1385498046875, 0.079833984375, 0.00372314453125, 0.084228515625, 0.00958251953125, 0.099853515625, ...	embed
36757970_c1	36757970	lisp	1	main) ...both of the new windows created "hang", and don't respond/redraw to keypress or mouse movements. I've tried to base this snippet on what I found in the SDL2 examples . I must be misunderstanding how to use the cl-sdl2 wrapper for the event loop, or something similar. Has anyone had success in using multiple wi...	main) ...both of the new windows created "hang", and don't respond/redraw to keypress or mouse movements. I've tried to base this snippet on what I found in the SDL2 examples . I must be misunderstanding how to use the cl-sdl2 wrapper for the event loop, or something similar. Has anyone had success in using multiple wi...	[ -0.00439453125, -0.0142822265625, -0.0031890869140625, -0.007659912109375, 0.0017852783203125, 0.0020904541015625, 0.00885009765625, -0.004150390625, 0.01519775390625, -0.0162353515625, -0.003326416015625, -0.019287109375, 0.021728515625, 0.006011962890625, 0.0048828125, -0.00029945373...	[ 5201, 837, 3525, 54825, 75935, 8467, 136, 2301, 18, 35644, 86905, 47, 22799, 11856, 114669, 112664, 3647, 159, 27502, 304, 27781, 24658, 144057, 4527, 33139, 7, 20469, 137565, 1264, 100, 19732, 40956, 35672, 36272, 17368, 48716, 678, 151301, ...	[ 0.07012939453125, 0.042083740234375, 0.1092529296875, 0.2020263671875, 0.125244140625, 0.233642578125, 0.0175933837890625, 0.0780029296875, 0.0989990234375, 0.16796875, 0.1875, 0.032806396484375, 0.0667724609375, 0.18505859375, 0.1114501953125, 0.146484375, 0.0570068359375, 0.05694...	embed
78964880_c0	78964880	lisp	0	Title: Is TRUNCASE a symbol that ever existed in a Lisp implementation? Problem title: Is TRUNCASE a symbol that ever existed in a Lisp implementation? Tags: lisp, common-lisp Problem: Is TRUNCASE a symbol that ever existed in a Lisp implementation? It appears that the Kate editor has a lot of xml files describing vari...	Is TRUNCASE a symbol that ever existed in a Lisp implementation? Is TRUNCASE a symbol that ever existed in a Lisp implementation? lisp common-lisp TRUNCASE Lisp commonlisp.xml Is TRUNCASE a symbol that ever existed in a Lisp implementation? It appears that the Kate editor has a lot of xml files describing various langu...	[ 0.00604248046875, 0.01190185546875, 0.01373291015625, -0.004638671875, -0.01361083984375, -0.00689697265625, -0.005615234375, -0.00096893310546875, -0.0059814453125, -0.00897216796875, 0.0037078857421875, 0.0107421875, -0.0081787109375, -0.0185546875, 0.00946044921875, 0.025146484375, ...	[ 2071, 14107, 175560, 76783, 10, 26582, 17669, 13835, 71, 1261, 7008, 208124, 400, 39210, 4086, 254, 131492, 37958, 30391, 5915, 102158, 28852, 67842, 46876, 127308, 60042, 756, 483, 19051, 5570, 151301, 77635, 56566, 17689, 177476, 20625, 14250...	[ 0.034637451171875, 0.183349609375, 0.2105712890625, 0.28955078125, 0.047149658203125, 0.264892578125, 0.1312255859375, 0.1802978515625, 0.05780029296875, 0.1988525390625, 0.2271728515625, 0.1798095703125, 0.1331787109375, 0.1339111328125, 0.1378173828125, 0.1943359375, 0.199584960937...	embed
14407812_c0	14407812	lisp	0	Title: Common Lisp return associations from alist as new list Problem title: Common Lisp return associations from alist as new list Tags: lisp, list, key-value-store, common-lisp Problem: Common Lisp return associations from alist as new list I have an assoc list as follows: (defparameter experts2 `( ;; direction (:d...	Common Lisp return associations from alist as new list Common Lisp return associations from alist as new list lisp list key-value-store common-lisp alist Common Lisp experts2 Common Lisp return associations from alist as new list I have an assoc list as follows: I am looking for a way, to extract the values from the ke...	[ 0.0162353515625, -0.01287841796875, -0.0157470703125, 0.01324462890625, -0.010986328125, 0.0247802734375, 0.00958251953125, 0.0186767578125, 0.01263427734375, -0.01251220703125, 0.005706787109375, 0.007171630859375, 0.009765625, -0.0012969970703125, -0.004241943359375, 0.013671875, 0...	[ 151301, 1261, 7008, 30646, 151747, 1295, 10, 6562, 237, 3525, 5303, 400, 22799, 27494, 45804, 39210, 4086, 254, 78688, 63927, 238, 28960, 16487, 3917, 125663, 142424, 3884, 3934, 1884, 157666, 4358, 180358 ]	[ 0.1427001953125, 0.15771484375, 0.1767578125, 0.1959228515625, 0.2376708984375, 0.0870361328125, 0.05230712890625, 0.215087890625, 0.06500244140625, 0.114990234375, 0.1873779296875, 0.0904541015625, 0.133056640625, 0.1270751953125, 0.155517578125, 0.118896484375, 0.09185791015625, ...	embed
49118309_c1	49118309	lisp	1	); } \| LPAREN COND s_expr s_expr s_expr RPAREN { $$ = condition($3, $4, $5); } \| LPAREN LPAREN LET let_list RPAREN s_expr RPAREN { $$ = let($4, $6); } \| QUIT { exit(0); } \| error { } ; let_list: let_elem { $$ = let_list($1, NULL); } \| let_list let_elem { $$ = let_list($2, $1); } ; let_elem: LPAREN TYPE SYMBOL s_expr RP...	); } \| LPAREN COND s_expr s_expr s_expr RPAREN { $$ = condition($3, $4, $5); } \| LPAREN LPAREN LET let_list RPAREN s_expr RPAREN { $$ = let($4, $6); } \| QUIT { exit(0); } \| error { } ; let_list: let_elem { $$ = let_list($1, NULL); } \| let_list let_elem { $$ = let_list($2, $1); } ; let_elem: LPAREN TYPE SYMBOL s_expr RP...	[ -0.0086669921875, 0.00101470947265625, -0.011474609375, 0.012451171875, -0.0255126953125, 0.0203857421875, -0.01031494140625, -0.00616455078125, 0.003509521484375, 0.005950927734375, 0.01116943359375, -0.00159454345703125, -0.0196533203125, -0.0205078125, 0.0019989013671875, 0.01879882...	[ 3142, 51912, 58745, 82080, 111422, 14452, 397, 91, 454, 83613, 42, 80026, 10666, 3650, 4369, 2203, 35431, 363, 617, 4, 147307, 27089, 2633, 6562, 910, 6, 142363, 82230, 177609, 18499, 27889, 18057, 304, 38629, 95267, 21907, 65311, 98335, 12...	[ 0.08056640625, 0.03619384765625, 0.06683349609375, 0.1622314453125, 0.30712890625, 0.1837158203125, 0.2001953125, 0.11669921875, 0.003326416015625, 0.1611328125, 0.1373291015625, 0.114013671875, 0.011474609375, 0.07000732421875, 0.060089111328125, 0.0869140625, 0.276123046875, 0.13...	embed
20424983_c0	20424983	lisp	0	Title: Conditionals in Elisp's cl-loop facility Problem title: Conditionals in Elisp's cl-loop facility Tags: continue, elisp, lisp, loops Problem: Conditionals in Elisp's cl-loop facility I'm trying to wrap my head around Elisp's cl-loop facility but can't seem to find a way to skip elements. Here's an artif...	Conditionals in Elisp's cl-loop facility Conditionals in Elisp's cl-loop facility continue elisp lisp loops Conditionals Elisp Expected Conditionals in Elisp's cl-loop facility I'm trying to wrap my head around Elisp's cl-loop facility but can't seem to find a way to skip elements. Here's an artificial exampl...	[ 0.012451171875, 0.030029296875, -0.0013580322265625, 0.02099609375, -0.02587890625, 0.029052734375, 0.030029296875, 0.0130615234375, 0.006378173828125, 0.0213623046875, 0.00726318359375, 0.005126953125, -0.020263671875, 0.0023345947265625, 0.005889892578125, 0.005096435546875, -0.008...	[ 46347, 43315, 25318, 7008, 3768, 33139, 28354, 178290, 21342, 15296, 400, 40956, 60075, 13, 31577, 137565, 10336, 831, 48903, 7413, 3917, 47, 21658, 80854, 66733, 27781, 58755, 1884, 645, 5303, 892, 26255, 3525, 756, 70270, 7311, 108047, 3853...	[ 0.16552734375, 0.1824951171875, 0.1171875, 0.2069091796875, 0.046051025390625, 0.156982421875, 0.2303466796875, 0.1787109375, 0.22265625, 0.06756591796875, 0.0400390625, 0.193115234375, 0.057647705078125, 0.112548828125, 0.001556396484375, 0.035491943359375, 0.0271453857421875, 0.0...	embed
57460975_c0	57460975	lisp	0	Title: How to get the cl-libusb library to load without '-no-pie' cc error in Lisp? Problem title: How to get the cl-libusb library to load without '-no-pie' cc error in Lisp? Tags: cc, sbcl, lisp, linux, common-lisp Problem: How to get the cl-libusb library to load without '-no-pie' cc error in Lis...	How to get the cl-libusb library to load without '-no-pie' cc error in Lisp? How to get the cl-libusb library to load without '-no-pie' cc error in Lisp? cc sbcl lisp linux common-lisp pathname How Lisp setup.lisp ql:quickload Load ASDF Loading sbcl-1.5.2-linux-x64 cffi_0.20.1 libffi-types__grovel-t...	[ -0.011962890625, 0.009521484375, -0.0155029296875, -0.01397705078125, -0.0234375, 0.0030975341796875, 0.00811767578125, -0.0142822265625, -0.000530242919921875, -0.0250244140625, -0.02099609375, -0.0113525390625, -0.0128173828125, -0.01397705078125, 0.011474609375, -0.0014495849609375,...	[ 11249, 2046, 33139, 141, 4284, 275, 35773, 1294, 72367, 15490, 3768, 157, 5066, 10060, 18499, 1261, 7008, 34937, 400, 11508, 6077, 39210, 4086, 254, 60875, 11627, 169581, 99247, 2594, 63033, 2091, 6483, 38997, 228006, 42876, 2397, 13307, 2450...	[ 0.03265380859375, 0.012298583984375, 0.138916015625, 0.09271240234375, 0.1702880859375, 0.1810302734375, 0.1790771484375, 0.03656005859375, 0.1878662109375, 0.09600830078125, 0.11279296875, 0.1334228515625, 0.219482421875, 0.1549072265625, 0.18603515625, 0.15478515625, 0.220825195312...	embed
19398258_c0	19398258	lisp	0	Title: How is Lisp Box emacs configured? Problem title: How is Lisp Box emacs configured? Tags: lisp, emacs Problem: How is Lisp Box emacs configured? I have 3 versions of emacs on my system: Emacs included by default with OS X avilable via Terminal The most recent version of Emacs installed as a separate standalone ap...	How is Lisp Box emacs configured? How is Lisp Box emacs configured? lisp emacs How Lisp Box How is Lisp Box emacs configured? I have 3 versions of emacs on my system: Emacs included by default with OS X avilable via Terminal The most recent version of Emacs installed as a separate standalone app, Emacs.app on OS X Lisp...	[ 0.0235595703125, 0.018798828125, -0.031982421875, -0.019287109375, -0.018310546875, 0.01385498046875, 0.00897216796875, 0.0113525390625, 0.01068115234375, 0.0213623046875, -0.002166748046875, 0.002227783203125, -0.022705078125, -0.00092315673828125, -0.00286865234375, -0.0042724609375,...	[ 11249, 83, 1261, 7008, 27271, 352, 2263, 7, 222495, 71, 400, 138, 11389, 5426, 85269, 4439, 99201, 114977, 678, 11787, 1193, 5115, 2886, 1829, 124090, 17309, 20600, 84797, 103723, 51684, 4027, 9007, 57134, 72977, 83184, 27211, 11883, 11435, ...	[ 0.0816650390625, 0.0333251953125, 0.1971435546875, 0.2493896484375, 0.2467041015625, 0.1004638671875, 0.1788330078125, 0.1085205078125, 0.1883544921875, 0.060546875, 0.1461181640625, 0.05169677734375, 0.1112060546875, 0.0162811279296875, 0.1820068359375, 0.2001953125, 0.1005859375, ...	embed
59458525_c0	59458525	lisp	0	Title: Undefined operator FUNCTION in form (FUNCTION (QUOTE A)) in nfa compiler Problem title: Undefined operator FUNCTION in form (FUNCTION (QUOTE A)) in nfa compiler Tags: common-lisp, lisp, nfa Problem: Undefined operator FUNCTION in form (FUNCTION (QUOTE A)) in nfa compiler I'm trying to write an epsilon-nfa compil...	Undefined operator FUNCTION in form (FUNCTION (QUOTE A)) in nfa compiler Undefined operator FUNCTION in form (FUNCTION (QUOTE A)) in nfa compiler common-lisp lisp nfa Undefined QUOTE ALL CREATE-NFA FUNCTIONS ALREADY DEFINED LATER RE1 REn basic-nfa-1 NFA-REGEXP-COMP Undefined operator FUNCTION in form (FUNCTION (QUOTE A...	[ 0.016357421875, 0.00010061264038085938, 0.0079345703125, 0.019287109375, 0.015380859375, 0.0067138671875, 0.0240478515625, 0.00836181640625, 0.00592041015625, -0.0224609375, -0.0166015625, -0.01495361328125, 0.0028076171875, 0.005401611328125, -0.00830078125, 0.00128936767578125, 0.0...	[ 79912, 5983, 297, 39933, 136258, 441, 23, 3173, 919, 175560, 232856, 62, 653, 1021, 9969, 34759, 39210, 4086, 254, 400, 7008, 175151, 839, 14676, 1514, 129525, 9069, 418, 19, 62822, 5759, 541, 153189, 26939, 683, 16113, 33022, 15759, 4759, ...	[ 0.126220703125, 0.2098388671875, 0.037506103515625, 0.26513671875, 0.1802978515625, 0.0965576171875, 0.07330322265625, 0.219970703125, 0.05377197265625, 0.159423828125, 0.2252197265625, 0.176025390625, 0.07061767578125, 0.1826171875, 0.134033203125, 0.1798095703125, 0.05438232421875,...	embed
28328559_c0	28328559	lisp	0	Title: Racket: N Queens solving by column Problem title: Racket: N Queens solving by column Tags: lisp, scheme, racket Problem: Racket: N Queens solving by column I'm new to Racket and as one of my first semi-complex programs I'm trying to solve the N queens problem by traversing linearly through column; so that the re...	Racket: N Queens solving by column Racket: N Queens solving by column lisp scheme racket Racket Queens Racket: N Queens solving by column I'm new to Racket and as one of my first semi-complex programs I'm trying to solve the N queens problem by traversing linearly through column; so that the result would be a list (2 4...	[ -0.01275634765625, 0.01373291015625, 0.021728515625, 0.0194091796875, 0.0029144287109375, 0.004730224609375, -0.00823974609375, 0.0027923583984375, -0.01434326171875, -0.037109375, 0.01239013671875, 0.023681640625, -0.0146484375, 0.0028076171875, -0.0263671875, -0.000064849853515625, ...	[ 2552, 27853, 541, 44109, 7, 3115, 390, 3365, 316, 12, 400, 7008, 150370, 673, 3525, 5117, 44974, 103391, 31577, 86869, 41, 1755, 2967, 37317, 192617, 8305, 16750, 5303, 4700, 201, 106, 8439, 116, 15555, 138, 4216, 927, 1528, 82424, 1884, ...	[ 0.1197509765625, 0.2052001953125, 0.1634521484375, 0.2305908203125, 0.0579833984375, 0.0880126953125, 0.03216552734375, 0.1405029296875, 0.1597900390625, 0.011077880859375, 0.044403076171875, 0.1185302734375, 0.13525390625, 0.09228515625, 0.0711669921875, 0.001983642578125, 0.0509033...	embed
60244547_c1	60244547	lisp	1	1 path2 target-node) (> (heuristic (first path1) target-node) (heuristic (first path2) target-node))) (defun best-first (start finish &optional (queue (list (list start)))) (cond ((endp queue) nil) ((equal finish (first (first queue))) (print (length (first queue))) (reverse (first queue))) (t (best-first start finish ...	1 path2 target-node) (> (heuristic (first path1) target-node) (heuristic (first path2) target-node))) (defun best-first (start finish &optional (queue (list (list start)))) (cond ((endp queue) nil) ((equal finish (first (first queue))) (print (length (first queue))) (reverse (first queue))) (t (best-first start finish ...	[ 0.0040283203125, 0.01141357421875, 0.00921630859375, 0.0191650390625, 0.00848388671875, -0.005615234375, -0.003814697265625, -0.0380859375, 0.004730224609375, -0.01080322265625, 0.00885009765625, 0.00738525390625, 0.005889892578125, 0.00004172325134277344, 0.001434326171875, -0.0267333...	[ 106, 60875, 304, 30388, 9, 157, 112, 2740, 1106, 474, 48242, 13448, 271, 17727, 10461, 32149, 16498, 2965, 17137, 67229, 109585, 944, 6562, 4034, 80126, 2271, 71, 3611, 254, 41, 17324, 71723, 35662, 23986, 107, 37676, 18, 32168, 62351, 51...	[ 0.1142578125, 0.236083984375, 0.1802978515625, 0.257080078125, 0.0233001708984375, 0.1610107421875, 0.129638671875, 0.0693359375, 0.05682373046875, 0.1607666015625, 0.19384765625, 0.114013671875, 0.043304443359375, 0.10009765625, 0.15283203125, 0.06689453125, 0.119140625, 0.0870361...	embed
40240929_c0	40240929	lisp	0	Title: NLP with Racket Problem title: NLP with Racket Tags: racket, nlp, lisp Problem: NLP with Racket I am studying NLP with Racket and Dr. Racket. I am working with this code: #lang racket (define english-1 '((Initial (1)) (Final (9)) (From 1 to 3 by NP) (From 1 to 2 by DET) (From 2 to 3 by N) (From 3 to 4 by BV) (Fr...	NLP with Racket NLP with Racket racket nlp lisp racket/trace NLP Racket english-1 Initial Final DET ADV ADJ MOD CNJ NLP with Racket I am studying NLP with Racket and Dr. Racket. I am working with this code: The code seems to be mostly fine. However, I keep getting a error messaging related to the recognize-move functio...	[ 0.00506591796875, 0.006317138671875, 0.004669189453125, 0.0439453125, 0.013427734375, -0.0038909912109375, -0.0029754638671875, -0.0031585693359375, 0.0025482177734375, -0.0224609375, 0.021728515625, -0.0087890625, -0.016357421875, -0.022216796875, 0.002471923828125, -0.006988525390625...	[ 541, 37352, 678, 2552, 27853, 673, 26775, 400, 7008, 39989, 175457, 5759, 1890, 27188, 105437, 48755, 100679, 98610, 91551, 35187, 1773, 20697, 18151, 37202, 153161, 5885, 33306, 13695, 18499, 115288, 9966, 62548, 125296, 9, 432, 272, 32354, ...	[ 0.059417724609375, 0.2236328125, 0.1259765625, 0.1170654296875, 0.230712890625, 0.09271240234375, 0.1495361328125, 0.0189208984375, 0.090087890625, 0.12841796875, 0.057647705078125, 0.052642822265625, 0.0300445556640625, 0.1329345703125, 0.14697265625, 0.10174560546875, 0.06976318359...	embed
29540779_c0	29540779	lisp	0	Title: Proper way to do a lisp program on lisp manipulaton Problem title: Proper way to do a lisp program on lisp manipulaton Tags: list, lisp Problem: Proper way to do a lisp program on lisp manipulaton Just writing a simple program to learn how to manipulate list. The external file has two column : bookname ISBN-no. ...	Proper way to do a lisp program on lisp manipulaton Proper way to do a lisp program on lisp manipulaton list lisp Proper How Read Bible History Prophecy Literature--Why Modern Readers Need Know Difference What Means Faith Today ISBN-13 Who Wrote Proper way to do a lisp program on lisp manipulaton Just writing a simple ...	[ -0.01513671875, 0.01275634765625, 0.007781982421875, 0.01708984375, -0.02978515625, 0.03564453125, 0.0076904296875, 0.0037384033203125, -0.002471923828125, -0.00138092041015625, 0.00994873046875, 0.0107421875, -0.0087890625, -0.0027008056640625, -0.00909423828125, -0.013671875, -0.00...	[ 1250, 1264, 3917, 54, 400, 7008, 1528, 98, 45258, 1507, 5303, 11249, 4764, 60313, 65786, 20133, 95935, 168754, 18799, 122636, 52889, 70829, 18234, 4865, 1215, 10133, 31567, 38396, 47475, 22820, 40469, 516, 32562, 8781, 30698, 3642, 67, 581, ...	[ 0.0869140625, 0.10888671875, 0.088134765625, 0.0679931640625, 0.170654296875, 0.2286376953125, 0.2393798828125, 0.09814453125, 0.2288818359375, 0.1182861328125, 0.1868896484375, 0.04144287109375, 0.158935546875, 0.150390625, 0.1171875, 0.1829833984375, 0.099609375, 0.02676391601562...	embed
35544606_c0	35544606	lisp	0	Title: Remove subsequence function (deep recursion) in Scheme using CPS Problem title: Remove subsequence function (deep recursion) in Scheme using CPS Tags: recursion, scheme, lisp Problem: Remove subsequence function (deep recursion) in Scheme using CPS removesub* takes a list of atoms and a general list. The first l...	Remove subsequence function (deep recursion) in Scheme using CPS Remove subsequence function (deep recursion) in Scheme using CPS recursion scheme lisp CPS Remove Scheme v2car v2cdr Remove subsequence function (deep recursion) in Scheme using CPS removesub* takes a list of atoms and a general list. The first list is a ...	[ 0.00124359130859375, 0.0269775390625, -0.006317138671875, 0.0235595703125, -0.00151824951171875, 0.0106201171875, -0.01470947265625, -0.01055908203125, -0.00128936767578125, 0.00145721435546875, 0.00732421875, -0.01507568359375, 0.003265380859375, 0.018798828125, 0.0169677734375, 0.004...	[ 181139, 1614, 184, 944, 3956, 32354, 123041, 195625, 1830, 34702, 282, 17368, 313, 9059, 23, 150370, 400, 7008, 81, 304, 3284, 7569, 87388, 22144, 1639, 51776, 5303, 34627, 4537, 5117, 17932, 55300, 5608, 30646, 74918, 184750, 876, 501, 10,...	[ 0.1973876953125, 0.174560546875, 0.17138671875, 0.16064453125, 0.08837890625, 0.1949462890625, 0.2130126953125, 0.2158203125, 0.1021728515625, 0.1595458984375, 0.1583251953125, 0.005462646484375, 0.040618896484375, 0.21484375, 0.02435302734375, 0.1414794921875, 0.00750732421875, 0....	embed
49499245_c0	49499245	lisp	0	Title: What are the rules behind the typical indenting conventions of lisp? Problem title: What are the rules behind the typical indenting conventions of lisp? Tags: indentation, emacs, lisp Problem: What are the rules behind the typical indenting conventions of lisp? Note to mods: Please note that this question is NOT...	What are the rules behind the typical indenting conventions of lisp? What are the rules behind the typical indenting conventions of lisp? indentation emacs lisp BEG What Delete END What are the rules behind the typical indenting conventions of lisp? Note to mods: Please note that this question is NOT AT ALL a question ...	[ -0.003509521484375, 0.01263427734375, -0.020263671875, -0.00335693359375, -0.00726318359375, 0.01312255859375, 0.00067901611328125, -0.0052490234375, 0.004669189453125, 0.01153564453125, 0.0096435546875, 0.006103515625, -0.0263671875, -0.006866455078125, 0.0017852783203125, -0.00210571...	[ 91736, 50155, 222201, 18597, 1916, 101805, 7, 400, 7008, 22062, 352, 2263, 9622, 724, 4865, 262, 46485, 39015, 2811, 90365, 43045, 35572, 114977, 15296, 44084, 18151, 3674, 1884, 903, 9384, 959, 20020, 2174, 1100, 254, 5701, 17366, 28219, 1...	[ 0.1480712890625, 0.113037109375, 0.1605224609375, 0.178955078125, 0.09814453125, 0.1728515625, 0.0849609375, 0.0992431640625, 0.2005615234375, 0.0631103515625, 0.011199951171875, 0.099853515625, 0.06549072265625, 0.07550048828125, 0.01409912109375, 0.00750732421875, 0.115966796875, ...	embed
79426935_c1	79426935	lisp	1	closed (list first-node))) (children (remove-existing (funcall generator first-node operators 'bfs) new-closed 'bfs)) (new-open (bfs-open (cdr open) children)) (solution-node (check-solution children objective)) ) (cond ((not (null solution-node)) solution-node) (t (setf open new-open) (setf closed new-closed) (bfs-go...	closed (list first-node))) (children (remove-existing (funcall generator first-node operators 'bfs) new-closed 'bfs)) (new-open (bfs-open (cdr open) children)) (solution-node (check-solution children objective)) ) (cond ((not (null solution-node)) solution-node) (t (setf open new-open) (setf closed new-closed) (bfs-go...	[ -0.0010986328125, 0.01275634765625, 0.006103515625, -0.00457763671875, 0.0081787109375, 0.0146484375, -0.0087890625, -0.007568359375, 0.01416015625, -0.030517578125, -0.0244140625, 0.003936767578125, 0.004547119140625, 0.0096435546875, -0.007537841796875, -0.040283203125, -0.01391601...	[ 155738, 6562, 5117, 157, 112, 32149, 237052, 26973, 272, 54376, 16498, 85763, 145823, 39933, 150598, 7, 3525, 155648, 54936, 59636, 7569, 9803, 20020, 166589, 78292, 151814, 2271, 139550, 29806, 3509, 420, 519, 876, 17447, 32354, 33342, 1884, ...	[ 0.2239990234375, 0.1766357421875, 0.1151123046875, 0.1766357421875, 0.1552734375, 0.0341796875, 0.247314453125, 0.1287841796875, 0.05364990234375, 0.13525390625, 0.1822509765625, 0.180908203125, 0.29931640625, 0.166259765625, 0.1064453125, 0.07318115234375, 0.049560546875, 0.144165...	embed
48489812_c0	48489812	lisp	0	Title: Generate combinations Problem title: Generate combinations Tags: common-lisp, lisp, list, loops, combinations Problem: Generate combinations I am trying to write a function in Lisp that generates all possible combinations of given keys and values. Here is an example input and output: Input: '((key1 . (v1 v2)) (k...	Generate combinations Generate combinations common-lisp lisp list loops combinations Generate Input key1 key2 Output key3 Generate combinations I am trying to write a function in Lisp that generates all possible combinations of given keys and values. Here is an example input and output: Currently, my function for doing...	[ -0.01708984375, 0.02734375, 0.004974365234375, -0.0235595703125, -0.00927734375, -0.006683349609375, -0.0185546875, -0.02099609375, 0.00506591796875, -0.0218505859375, 0.004608154296875, 0.035400390625, 0.0145263671875, 0.00335693359375, 0.003936767578125, 0.000820159912109375, -0.00...	[ 155370, 67, 162515, 39210, 4086, 254, 400, 7008, 5303, 40956, 360, 7077, 22799, 304, 13538, 363, 7, 31577, 33022, 32354, 1261, 139392, 756, 7722, 34475, 142424, 27781, 107730, 140992, 43240, 84751, 51713, 26785, 186104, 8512, 1614, 6562, 6713...	[ 0.206787109375, 0.04949951171875, 0.2578125, 0.078857421875, 0.07220458984375, 0.1331787109375, 0.08740234375, 0.189453125, 0.1279296875, 0.116943359375, 0.02490234375, 0.015838623046875, 0.14599609375, 0.053131103515625, 0.03485107421875, 0.10498046875, 0.03472900390625, 0.0242309...	embed
17602443_c0	17602443	lisp	0	Title: Loading and Unloading the .arx file with LISP Problem title: Loading and Unloading the .arx file with LISP Tags: autodesk, autocad, autolisp, lisp, visual-c%2B%2B Problem: Loading and Unloading the .arx file with LISP I have few .arx applications for AutoCAD. In these applications few are menu based and others a...	Loading and Unloading the .arx file with LISP Loading and Unloading the .arx file with LISP autodesk autocad autolisp lisp visual-c%2B%2B Loading Unloading LISP c:XYZ_program Example Folder XYZ.arx XYZ_program ads_queueexpr Loading and Unloading the .arx file with LISP I have few .arx applications for AutoCAD. In these...	[ 0.01043701171875, 0.023193359375, -0.01177978515625, 0.00185394287109375, -0.030029296875, 0.00372314453125, 0.021728515625, 0.0002384185791015625, -0.0023345947265625, -0.0291748046875, 0.01214599609375, 0.00250244140625, -0.0181884765625, -0.024658203125, 0.0069580078125, 0.004364013...	[ 228006, 136, 992, 63033, 5, 147, 425, 11435, 678, 16970, 9434, 1809, 133850, 25426, 4086, 254, 400, 7008, 21176, 143907, 1511, 18749, 89536, 30077, 606, 83613, 10846, 86685, 4396, 85427, 8026, 35509, 75101, 13315, 2091, 4027, 11675, 51, 384...	[ 0.1990966796875, 0.044189453125, 0.0833740234375, 0.2069091796875, 0.0301513671875, 0.1827392578125, 0.197998046875, 0.141845703125, 0.037750244140625, 0.1510009765625, 0.2236328125, 0.046600341796875, 0.14599609375, 0.12890625, 0.0904541015625, 0.133544921875, 0.1226806640625, 0.2...	embed
4546118_c0	4546118	lisp	0	Title: What's the idiomatic equivalent of C structs in Lisp? Problem title: What's the idiomatic equivalent of C structs in Lisp? Tags: struct, c, lisp, common-lisp Problem: What's the idiomatic equivalent of C structs in Lisp? In C-type languages, there is a strong emphasis on structs/records and objects fro...	What's the idiomatic equivalent of C structs in Lisp? What's the idiomatic equivalent of C structs in Lisp? struct c lisp common-lisp What Lisp What's the idiomatic equivalent of C structs in Lisp? In C-type languages, there is a strong emphasis on structs/records and objects from the very beginning and in ev...	[ 0.01025390625, 0.0286865234375, 0.00189971923828125, 0.00274658203125, 0.015380859375, 0.01422119140625, -0.00396728515625, -0.00022220611572265625, 0.0025634765625, -0.0279541015625, -0.01611328125, -0.003448486328125, 0.00286865234375, -0.006011962890625, 0.008544921875, 0.0147705078...	[ 3768, 49666, 9523, 183234, 313, 36716, 7, 23, 1261, 7008, 501, 400, 39210, 9, 4086, 254, 4865, 50986, 46876, 37515, 242661, 32271, 36746, 86595, 11907, 39864, 12877, 28484, 76519, 82775, 332, 91582, 3334, 209806, 15550, 37967, 8, 420, 8781,...	[ 0.0361328125, 0.1407470703125, 0.057220458984375, 0.154296875, 0.138916015625, 0.2230224609375, 0.057647705078125, 0.0113525390625, 0.178955078125, 0.22265625, 0.09002685546875, 0.12939453125, 0.109619140625, 0.003204345703125, 0.12548828125, 0.1480712890625, 0.05731201171875, 0.14...	embed
8371820_c0	8371820	lisp	0	Title: Order of (:before/:after) method invocation in CLOS? Problem title: Order of (:before/:after) method invocation in CLOS? Tags: clos, common-lisp, lisp Problem: Order of (:before/:after) method invocation in CLOS? I need some help understanding the order of execution for the following code. I create an instance o...	Order of (:before/:after) method invocation in CLOS? Order of (:before/:after) method invocation in CLOS? clos common-lisp lisp Order CLOS Cooking pie-1 COOKED APPLE Order of (:before/:after) method invocation in CLOS? I need some help understanding the order of execution for the following code. I create an instance of...	[ 0.010009765625, 0.0037078857421875, 0.00225830078125, 0.020263671875, 0.00138092041015625, 0.014404296875, -0.00042724609375, 0.0108642578125, 0.0052490234375, 0.004058837890625, -0.002960205078125, -0.02294921875, -0.0018157958984375, -0.00335693359375, -0.001190185546875, -0.02954101...	[ 81206, 111, 372, 89700, 64, 46327, 55300, 23, 202010, 92933, 32, 20450, 7, 39210, 4086, 254, 400, 7008, 79479, 2158, 5759, 8244, 9092, 17610, 66440, 15300, 313, 4358, 100094, 12989, 71924, 1830, 25632, 18151, 28282, 110527, 17368, 32354, 29...	[ 0.2054443359375, 0.1197509765625, 0.040130615234375, 0.1859130859375, 0.0699462890625, 0.21923828125, 0.217041015625, 0.05877685546875, 0.1900634765625, 0.242919921875, 0.006195068359375, 0.1572265625, 0.03912353515625, 0.079345703125, 0.0819091796875, 0.148681640625, 0.1236572265625...	embed
57561048_c0	57561048	lisp	0	Title: No more room for LISP objects error wxMaxima Problem title: No more room for LISP objects error wxMaxima Tags: performance, wxmaxima, lisp, heap-memory Problem: No more room for LISP objects error wxMaxima I am trying to solve a non-linear equation system with maxima. I use wxmaxima (17.05.0). The non-linear sys...	No more room for LISP objects error wxMaxima No more room for LISP objects error wxMaxima performance wxmaxima lisp heap-memory LISP eq1:mBA K10 RABm10 K11 RABm11 K12 RABm12 RABm7 RABm8 RABm9 M10 RAm10 M11 RAm11 M12 RAm12 RAm2 RAm3 RAm4 RAm5 RAm6 RAm7 RAm8 RAm9 RBm2 RBm3 RBm4 RBm5 RBm6 RBm10 RBm11 RBm12 RBm7 RBm8 RBm9 ...	[ -0.0206298828125, 0.030029296875, -0.0103759765625, -0.005401611328125, -0.0126953125, -0.003326416015625, -0.004852294921875, 0.0126953125, 0.00872802734375, -0.03125, 0.0106201171875, 0.0079345703125, -0.001953125, -0.0103759765625, 0.00921630859375, 0.01904296875, 0.00436401367187...	[ 438, 1286, 17155, 100, 16970, 9434, 36746, 18499, 148, 425, 71346, 1352, 23718, 24084, 400, 7008, 764, 2631, 109005, 864, 8031, 341, 963, 11040, 144787, 617, 31577, 86869, 351, 2256, 5490, 5426, 122200, 21067, 20806, 77495, 147, 4989, 59090...	[ 0.0836181640625, 0.1522216796875, 0.2342529296875, 0.09478759765625, 0.1278076171875, 0.2099609375, 0.1956787109375, 0.1436767578125, 0.0751953125, 0.1068115234375, 0.121826171875, 0.179443359375, 0.1400146484375, 0.103271484375, 0.09820556640625, 0.163330078125, 0.1259765625, 0.09...	embed

3172938_c0

3172938

lisp

0

Title: How to install/upgrade Lisp libraries on Debian Problem title: How to install/upgrade Lisp libraries on Debian Tags: debian, common-lisp, lisp, installation Problem: How to install/upgrade Lisp libraries on Debian I recently discovered that some of my favorite libraries have been removed from Debian, e.g., Hunch...

How to install/upgrade Lisp libraries on Debian How to install/upgrade Lisp libraries on Debian debian common-lisp lisp installation How Lisp Debian How to install/upgrade Lisp libraries on Debian I recently discovered that some of my favorite libraries have been removed from Debian, e.g., Hunchentoot : I've looked at ...

[ -0.0026702880859375, 0.0128173828125, -0.00077056884765625, -0.0048828125, -0.0213623046875, -0.0011444091796875, -0.00732421875, -0.011474609375, -0.00213623046875, 0.000446319580078125, 0.0033416748046875, -0.0048828125, 0.00555419921875, 0.00714111328125, 0.009765625, -0.0185546875,...

[ 11249, 47, 20600, 64, 2037, 44286, 1261, 7008, 35773, 10484, 98, 262, 62806, 8, 39210, 4086, 254, 400, 59720, 134053, 40304, 2809, 184750, 1295, 10453, 4834, 188, 818, 151301, 5570, 3917, 134598, 8961, 5036, 831, 6483, 38997, 80383, 184017,...

[ 0.08905029296875, 0.0153350830078125, 0.1680908203125, 0.022003173828125, 0.0977783203125, 0.1461181640625, 0.174072265625, 0.2354736328125, 0.1964111328125, 0.11181640625, 0.021453857421875, 0.1773681640625, 0.2147216796875, 0.122802734375, 0.0955810546875, 0.1373291015625, 0.126098...

embed

55668976_c0

55668976

lisp

0

Title: Why is my code getting stuck in a recursive call when a negative argument gets passed through? Problem title: Why is my code getting stuck in a recursive call when a negative argument gets passed through? Tags: recursion, math, scheme, lisp Problem: Why is my code getting stuck in a recursive call when a negativ...

Why is my code getting stuck in a recursive call when a negative argument gets passed through? Why is my code getting stuck in a recursive call when a negative argument gets passed through? recursion math scheme lisp Why Square1 Why is my code getting stuck in a recursive call when a negative argument gets passed throu...

[ -0.001739501953125, 0.00482177734375, 0.0074462890625, 0.000507354736328125, 0.006805419921875, -0.018798828125, 0.01361083984375, 0.0123291015625, -0.0081787109375, -0.003448486328125, 0.021484375, -0.0238037109375, -0.0277099609375, -0.01495361328125, 0.00885009765625, -0.01452636718...

[ 44084, 83, 18151, 20949, 179933, 23, 195625, 5844, 11782, 3229, 40907, 10750, 115081, 8305, 1830, 48909, 150370, 400, 7008, 68305, 418, 10, 62163, 31577, 29479, 50491, 34702, 282, 51776, 108047, 111, 14012, 15490, 127664, 26168, 8353, 304, 85...

[ 0.103271484375, 0.0264434814453125, 0.1998291015625, 0.060943603515625, 0.223876953125, 0.0653076171875, 0.20849609375, 0.1697998046875, 0.1790771484375, 0.041015625, 0.265380859375, 0.214111328125, 0.056365966796875, 0.12451171875, 0.047943115234375, 0.0814208984375, 0.1280517578125...

embed

65535370_c0

65535370

lisp

0

Title: Count occurrences in lisp Problem title: Count occurrences in lisp Tags: repl-printed-representation, lisp Problem: Count occurrences in lisp I'm trying to make a code in lisp to count occurrences of atoms in a list in lisp. The problem is the code works for all atoms except the atom () , which appears as NIL . ...

Count occurrences in lisp Count occurrences in lisp repl-printed-representation lisp Count NIL list_ Count occurrences in lisp I'm trying to make a code in lisp to count occurrences of atoms in a list in lisp. The problem is the code works for all atoms except the atom () , which appears as NIL . Example in the code: A...

[ 0.0015106201171875, 0.0234375, 0.010498046875, 0.007293701171875, -0.0035400390625, 0.007476806640625, 0.00494384765625, -0.00238037109375, 0.0015716552734375, -0.0262451171875, -0.0174560546875, -0.0098876953125, 0.03515625, 0.0081787109375, 0.01239013671875, -0.004913330078125, -0....

[ 108210, 74918, 42, 69098, 23, 400, 7008, 2424, 35662, 205913, 541, 16444, 5303, 454, 31577, 18151, 54529, 34627, 7, 2967, 43240, 100, 756, 40494, 15, 135179, 89536, 6528, 7639, 43257 ]

[ 0.1942138671875, 0.176025390625, 0.1558837890625, 0.10455322265625, 0.08038330078125, 0.12890625, 0.2080078125, 0.10272216796875, 0.039459228515625, 0.1466064453125, 0.0980224609375, 0.1927490234375, 0.1666259765625, 0.00036525726318359375, 0.01508331298828125, 0.1478271484375, 0.176...

embed

26196695_c0

26196695

lisp

0

Title: Problems with langutil in Common Lisp - how to tokenize a file Problem title: Problems with langutil in Common Lisp - how to tokenize a file Tags: tokenize, nlp, lisp, common-lisp Problem: Problems with langutil in Common Lisp - how to tokenize a file I've been trying to tokenize a string using the langutils lib...

Problems with langutil in Common Lisp - how to tokenize a file Problems with langutil in Common Lisp - how to tokenize a file tokenize nlp lisp common-lisp Problems Common Lisp cl-utilities:split-sequence Space hello.txt Hello John Doe LANGUTILS-TOKENIZE:TOKENIZE-FILE NIL HASH-TABLE Problems with langutil in Common Lis...

[ 0.013427734375, 0.009765625, -0.005401611328125, 0.0031890869140625, -0.02099609375, -0.005706787109375, 0.00372314453125, -0.001739501953125, -0.0233154296875, -0.0242919921875, 0.0084228515625, 0.01531982421875, -0.002838134765625, -0.0189208984375, 0.001861572265625, -0.001838684082...

[ 15649, 678, 1937, 34, 3675, 151301, 1261, 7008, 3642, 47, 1098, 20650, 11435, 26775, 400, 39210, 4086, 254, 33139, 87738, 4353, 944, 43045, 33600, 31, 124326, 35378, 4939, 984, 13, 73386, 93133, 19759, 72071, 67609, 19157, 919, 52099, 541, ...

[ 0.15576171875, 0.05572509765625, 0.08441162109375, 0.07220458984375, 0.1802978515625, 0.1844482421875, 0.1544189453125, 0.155029296875, 0.0439453125, 0.097900390625, 0.1883544921875, 0.10791015625, 0.1925048828125, 0.0860595703125, 0.054931640625, 0.09710693359375, 0.1151123046875, ...

embed

9306406_c0

9306406

lisp

0

Title: Generate Permutations of a List Problem title: Generate Permutations of a List Tags: scheme, permutation, lisp Problem: Generate Permutations of a List I'm writing a function that takes a list and returns a list of permutations of the argument. I know how to do it by using a function that removes an element and ...

Generate Permutations of a List Generate Permutations of a List scheme permutation lisp Generate Permutations List Generate Permutations of a List I'm writing a function that takes a list and returns a list of permutations of the argument. I know how to do it by using a function that removes an element and then recursi...

[ -0.004974365234375, 0.02001953125, 0.00689697265625, 0.0019073486328125, -0.01348876953125, 0.0260009765625, -0.049072265625, -0.0250244140625, -0.01007080078125, -0.052734375, -0.005859375, -0.01068115234375, 0.01904296875, 0.0045166015625, -0.00946044921875, 0.0201416015625, -0.004...

[ 155370, 67, 908, 14311, 21094, 111, 10, 32036, 150370, 117, 561, 22062, 400, 7008, 32562, 32354, 51776, 5303, 30646, 10750, 3714, 3642, 87388, 12830, 195625, 4527, 139392, 756, 2967, 3444, 25632, 183540, 35735, 3934, 11907, 7722, 31913, 1221,...

[ 0.223876953125, 0.10595703125, 0.1600341796875, 0.269287109375, 0.1611328125, 0.0928955078125, 0.0202789306640625, 0.225341796875, 0.1749267578125, 0.1658935546875, 0.211669921875, 0.0841064453125, 0.1085205078125, 0.17822265625, 0.102294921875, 0.1693115234375, 0.056640625, 0.2324...

embed

27468541_c0

27468541

lisp

0

Title: LISP binary trees - max depth Problem title: LISP binary trees - max depth Tags: tree, lisp, common-lisp Problem: LISP binary trees - max depth Using this way of representing trees: (A (B) (C (D) (E))) (which, from what I've seen I think it's the standard way, but I might be wrong). A / \ B C / \ D E I want to f...

LISP binary trees - max depth LISP binary trees - max depth tree lisp common-lisp LISP LISP binary trees - max depth Using this way of representing trees: (A (B) (C (D) (E))) (which, from what I've seen I think it's the standard way, but I might be wrong). I want to find the maximum depth and construct a list with the ...

[ 0.02783203125, 0.0272216796875, 0.005950927734375, 0.010009765625, 0.00213623046875, 0.03515625, -0.021728515625, 0.01055908203125, 0.0033721923828125, -0.042724609375, -0.00543212890625, -0.021728515625, 0.00125885009765625, 0.002716064453125, 0.01904296875, -0.001983642578125, 0.00...

[ 16970, 9434, 2394, 6635, 1360, 18389, 168867, 90, 53201, 400, 7008, 39210, 4086, 254, 903, 3917, 33636, 284, 571, 441, 397, 647, 5570, 13648, 44691, 3444, 7413, 38132, 64549, 5303, 110, 988, 1295, 74855, 47, 17366, 27781, 35166, 116, 98, ...

[ 0.118408203125, 0.203857421875, 0.166259765625, 0.08197021484375, 0.1925048828125, 0.203125, 0.3154296875, 0.03375244140625, 0.20654296875, 0.1141357421875, 0.174072265625, 0.10382080078125, 0.0924072265625, 0.1416015625, 0.007720947265625, 0.0498046875, 0.163330078125, 0.045989990...

embed

5382364_c0

5382364

lisp

0

Title: LISP: Help reading input stream (with spaces) into a list of characters Problem title: LISP: Help reading input stream (with spaces) into a list of characters Tags: lisp, common-lisp Problem: LISP: Help reading input stream (with spaces) into a list of characters I am attempting to write a program whereby I need...

LISP: Help reading input stream (with spaces) into a list of characters LISP: Help reading input stream (with spaces) into a list of characters lisp common-lisp LISP Help Space LISP: Help reading input stream (with spaces) into a list of characters I am attempting to write a program whereby I need to process a string c...

[ 0.00238037109375, -0.0004520416259765625, 0.00921630859375, 0.0079345703125, 0.00180816650390625, 0.0191650390625, 0.01470947265625, -0.0087890625, 0.00469970703125, -0.01806640625, 0.0172119140625, -0.0234375, -0.0205078125, -0.006378173828125, -0.00616455078125, 0.01031494140625, 0...

[ 16970, 9434, 12, 39527, 16454, 107730, 75973, 76228, 32628, 7, 16, 3934, 5303, 111, 124850, 400, 7008, 39210, 4086, 254, 43045, 81887, 33022, 10, 1528, 3871, 9433, 79315, 62816, 9, 1272, 9254, 2263, 720, 4, 26719, 35011, 65421, 186, 34475...

[ 0.15478515625, 0.243408203125, 0.045684814453125, 0.1484375, 0.1951904296875, 0.15673828125, 0.193359375, 0.049560546875, 0.210693359375, 0.005706787109375, 0.0968017578125, 0.05194091796875, 0.1475830078125, 0.00494384765625, 0.19091796875, 0.13330078125, 0.1929931640625, 0.103210...

embed

43270232_c0

43270232

lisp

0

Title: Step Eval Common Lisp Problem title: Step Eval Common Lisp Tags: common-lisp, lisp Problem: Step Eval Common Lisp I have been trying to find a method to do a "step" eval. Where I call the a function and it evaluates the most nested list for common lisp. For example: '(+ 2 (+ 3 4)) ; would eval to: '(+ 2 7) In th...

Step Eval Common Lisp Step Eval Common Lisp common-lisp lisp Step Eval Common Lisp Step Eval Common Lisp I have been trying to find a method to do a "step" eval. Where I call the a function and it evaluates the most nested list for common lisp. For example: In that example it just evaluated 3 + 4 and stopped right ther...

[ -0.0050048828125, 0.0159912109375, 0.004608154296875, 0.010498046875, -0.003448486328125, 0.0257568359375, 0.01513671875, -0.0203857421875, 0.0098876953125, -0.041748046875, -0.00689697265625, 0.006561279296875, 0.003509521484375, 0.004791259765625, 0.006591796875, -0.004486083984375, ...

[ 50478, 241, 1405, 151301, 1261, 7008, 39210, 4086, 254, 400, 31577, 7413, 55300, 54, 95528, 28, 11782, 32354, 151575, 2684, 8512, 71, 5303, 27781, 1660, 138, 997, 201, 118066, 2685, 959, 21342, 361, 3638, 3444, 18151, 15490, 28271, 9, 209...

[ 0.248779296875, 0.1243896484375, 0.256103515625, 0.1361083984375, 0.129150390625, 0.145263671875, 0.14208984375, 0.080322265625, 0.06793212890625, 0.1077880859375, 0.0047607421875, 0.0848388671875, 0.08587646484375, 0.0238800048828125, 0.263916015625, 0.127197265625, 0.01972961425781...

embed

77090618_c0

77090618

lisp

0

Title: What's the difference between (mymacro arg) and (eval (myfunc (quote arg))) Problem title: What's the difference between (mymacro arg) and (eval (myfunc (quote arg))) Tags: eval, lisp, macros Problem: What's the difference between (mymacro arg) and (eval (myfunc (quote arg))) The way I 'see' macros in ...

What's the difference between (mymacro arg) and (eval (myfunc (quote arg))) What's the difference between (mymacro arg) and (eval (myfunc (quote arg))) eval lisp macros What arg1 arg2 BODY ARG What's the difference between (mymacro arg) and (eval (myfunc (quote arg))) The way I 'see' macros in Lisp is the fol...

[ 0.0174560546875, 0.0225830078125, -0.007537841796875, -0.0025787353515625, -0.005645751953125, 0.00982666015625, 0.01708984375, -0.0062255859375, 0.01104736328125, -0.00004601478576660156, -0.012451171875, -0.0014190673828125, 0.0009765625, -0.012939453125, 0.0130615234375, -0.02233886...

[ 3768, 60212, 17721, 1176, 192, 15322, 79459, 136, 13, 1405, 16498, 238, 68726, 28, 400, 7008, 111789, 418, 304, 335, 181668, 48802, 70, 3917, 21231, 7, 1261, 217684, 1957, 11782, 19, 41591, 5701, 10461, 759, 32354, 14361, 66161, 100094, 2...

[ 0.03558349609375, 0.2017822265625, 0.07708740234375, 0.157958984375, 0.0712890625, 0.207275390625, 0.2264404296875, 0.074951171875, 0.08642578125, 0.260986328125, 0.210205078125, 0.07257080078125, 0.1318359375, 0.069091796875, 0.11376953125, 0.21240234375, 0.20166015625, 0.05261230...

embed

3817063_c0

3817063

lisp

0

Title: Struggling with common lisp libraries Problem title: Struggling with common lisp libraries Tags: common-lisp, scheme, lisp Problem: Struggling with common lisp libraries I've learned scheme and quickly mastered a lot of it, then did a project in it just fine. Literally took me days to finish. I'm now trying to l...

Struggling with common lisp libraries Struggling with common lisp libraries common-lisp scheme lisp Struggling Struggling with common lisp libraries I've learned scheme and quickly mastered a lot of it, then did a project in it just fine. Literally took me days to finish. I'm now trying to learn common lisp to get a fe...

[ -0.01470947265625, 0.0012664794921875, -0.0230712890625, 0.0062255859375, -0.0308837890625, 0.009033203125, -0.0098876953125, -0.004058837890625, 0.015380859375, -0.034912109375, -0.0177001953125, -0.0113525390625, -0.0047607421875, 0.02001953125, 0.0034332275390625, -0.0240478515625, ...

[ 63667, 9815, 2069, 678, 39210, 400, 7008, 35773, 4086, 254, 150370, 10484, 97384, 69405, 31347, 5915, 442, 13452, 5885, 135940, 34739, 13312, 67229, 31577, 30698, 12319, 6183, 237875, 237, 71, 420, 37202, 51359, 3642, 4527, 961, 4902, 2684, ...

[ 0.1322021484375, 0.117431640625, 0.06768798828125, 0.177490234375, 0.156982421875, 0.155517578125, 0.2005615234375, 0.216552734375, 0.143798828125, 0.170654296875, 0.2001953125, 0.1060791015625, 0.062408447265625, 0.04449462890625, 0.05657958984375, 0.0513916015625, 0.04876708984375,...

embed

52962046_c0

52962046

lisp

0

Title: Fill a list in a do loop returns the list empty Problem title: Fill a list in a do loop returns the list empty Tags: scheme, lisp, racket Problem: Fill a list in a do loop returns the list empty I'm learning Racket and I don't know why lst is always empty: #lang racket (define sort-asc-by-second (lambda (lst) (s...

Fill a list in a do loop returns the list empty Fill a list in a do loop returns the list empty scheme lisp racket Fill Fill a list in a do loop returns the list empty I'm learning Racket and I don't know why lst is always empty: I want to modify the lst list inside the do, but it doesn't. Do you know why lst is empty?...

[ 0.00897216796875, 0.0042724609375, 0.0032806396484375, 0.007568359375, -0.01318359375, 0.021728515625, -0.00095367431640625, -0.0064697265625, 0.00604248046875, 0.006805419921875, 0.01202392578125, -0.00933837890625, -0.0181884765625, -0.01153564453125, 0.01043701171875, 0.012756347656...

[ 140423, 5303, 23, 54, 40956, 30646, 201505, 150370, 400, 7008, 673, 27853, 52080, 2552, 3714, 15400, 96, 271, 83, 11343, 2811, 40383, 46132, 22027, 18, 3034, 167934 ]

[ 0.18896484375, 0.2034912109375, 0.050262451171875, 0.129638671875, 0.1876220703125, 0.123046875, 0.22216796875, 0.118896484375, 0.045074462890625, 0.11181640625, 0.07452392578125, 0.171875, 0.03924560546875, 0.058837890625, 0.0103759765625, 0.06585693359375, 0.04248046875, 0.134155...

embed

38992281_c1

38992281

lisp

1

attached at the end of this post Each car of the consed pair representing the content and the cdr representing the section - which will corresponding to a section, sub-section or a question etc., STEP-2: Finally I need to convert this into the following format - an alist - ((:QANDA . "Test") (:VERSION . "0.1") (:DATE ...

[ -0.000782012939453125, 0.0230712890625, -0.01409912109375, 0.01519775390625, -0.0042724609375, 0.0181884765625, -0.0216064453125, 0.019775390625, 0.0036468505859375, -0.0211181640625, -0.0047607421875, 0.0244140625, 0.007232666015625, 0.0047607421875, -0.002044677734375, 0.007781982421...

[ 220642, 99, 70, 3564, 903, 1305, 98423, 2258, 111, 158, 5281, 80836, 33636, 10941, 136, 56329, 42, 214, 40059, 1221, 42518, 1614, 7, 58994, 707, 9655, 3021, 5, 4, 185567, 5428, 201106, 87, 3871, 47, 96760, 3934, 25632, 9384, 142, 10, ...

[ 0.164306640625, 0.01629638671875, 0.0145721435546875, 0.07080078125, 0.115234375, 0.042327880859375, 0.115234375, 0.2457275390625, 0.03631591796875, 0.1265869140625, 0.16259765625, 0.1800537109375, 0.1824951171875, 0.172607421875, 0.011505126953125, 0.109130859375, 0.1956787109375, ...

embed

3623101_c0

3623101

lisp

0

Title: How to extend emacs lisp mode with indentation changes and color changes Problem title: How to extend emacs lisp mode with indentation changes and color changes Tags: lisp, emacs, elisp Problem: How to extend emacs lisp mode with indentation changes and color changes Im making a DSL in lisp (basically what i thi...

How to extend emacs lisp mode with indentation changes and color changes How to extend emacs lisp mode with indentation changes and color changes lisp emacs elisp How goby.el Goby Major How to extend emacs lisp mode with indentation changes and color changes Im making a DSL in lisp (basically what i think is a nicer sy...

[ -0.000797271728515625, 0.0030670166015625, -0.0213623046875, 0.00518798828125, -0.00848388671875, 0.01263427734375, -0.010986328125, 0.01361083984375, -0.006988525390625, 0.00604248046875, 0.015869140625, 0.00872802734375, -0.0189208984375, 0.000018596649169921875, 0.0022735595703125, ...

[ 11249, 47, 65042, 352, 2263, 7, 400, 7008, 13736, 678, 18597, 22062, 65572, 136, 10576, 15296, 738, 1272, 583, 2016, 49953, 20662, 114479, 23, 10443, 86531, 5701, 12921, 58460, 110, 959, 162, 2633, 15549, 102158, 3564, 5, 519, 21543, 4086...

[ 0.076904296875, 0.0286712646484375, 0.220703125, 0.0819091796875, 0.1602783203125, 0.0994873046875, 0.137939453125, 0.198974609375, 0.1805419921875, 0.0595703125, 0.173095703125, 0.100830078125, 0.182861328125, 0.0369873046875, 0.13671875, 0.021240234375, 0.091064453125, 0.17675781...

embed

12779621_c0

12779621

lisp

0

Title: Are the video lectures worth watching if I plan to go through the whole SICP book Problem title: Are the video lectures worth watching if I plan to go through the whole SICP book Tags: scheme, lisp, sicp Problem: Are the video lectures worth watching if I plan to go through the whole SICP book After I began to f...

Are the video lectures worth watching if I plan to go through the whole SICP book Are the video lectures worth watching if I plan to go through the whole SICP book scheme lisp sicp SICP Are the video lectures worth watching if I plan to go through the whole SICP book After I began to follow the "Functional Programming ...

[ 0.01806640625, 0.01611328125, -0.01104736328125, -0.003814697265625, -0.0184326171875, -0.00421142578125, 0.004791259765625, -0.00848388671875, -0.00537109375, -0.0302734375, 0.0014190673828125, -0.0274658203125, 0.0004711151123046875, -0.01080322265625, -0.005859375, -0.00393676757812...

[ 1202, 59619, 7, 41965, 100244, 1774, 8305, 28271, 159, 198993, 12877, 150370, 400, 7008, 26536, 254, 97249, 10763, 27958, 79680, 23, 152653, 11, 15411, 219, 58269, 31986, 31, 128169, 76319, 191722, 67229, 81979, 15969, 24626, 4772, 113140, 16...

[ 0.2132568359375, 0.2110595703125, 0.031829833984375, 0.1363525390625, 0.1907958984375, 0.08599853515625, 0.0196685791015625, 0.0479736328125, 0.0855712890625, 0.18701171875, 0.1048583984375, 0.093505859375, 0.00048828125, 0.0670166015625, 0.04443359375, 0.046722412109375, 0.079345703...

embed

56853321_c0

56853321

lisp

0

Title: How to create a bidirectional binary stream in Common Lisp? Problem title: How to create a bidirectional binary stream in Common Lisp? Tags: lisp, common-lisp Problem: How to create a bidirectional binary stream in Common Lisp? I read How to create a binary stream (not a file) in Common Lisp? , and it describes ...

How to create a bidirectional binary stream in Common Lisp? How to create a bidirectional binary stream in Common Lisp? lisp common-lisp How Common Lisp flexi-streams:make-in-memory-input-stream flexi-streams:make-in-memory-output-stream lisp-binary:write-float lisp-binary:read-binary-type How to create a bidirectional...

[ -0.01190185546875, 0.023193359375, -0.01806640625, -0.004913330078125, 0.004241943359375, 0.00946044921875, 0.00885009765625, -0.0115966796875, 0.01312255859375, -0.01019287109375, 0.01129150390625, -0.005767822265625, 0.020263671875, 0.0198974609375, 0.01312255859375, -0.0025787353515...

[ 11249, 28282, 333, 80581, 110117, 2394, 6635, 75973, 151301, 1261, 7008, 47, 23, 400, 39210, 4086, 254, 44289, 14, 86429, 55898, 73, 109005, 53, 6056, 19155, 1294, 434, 18781, 52347, 39116, 50986, 10869, 11435, 3642, 1284, 959, 81887, 35978...

[ 0.059417724609375, 0.160400390625, 0.1807861328125, 0.1591796875, 0.093017578125, 0.187744140625, 0.141845703125, 0.2437744140625, 0.1754150390625, 0.1622314453125, 0.183349609375, 0.011871337890625, 0.04315185546875, 0.09716796875, 0.0989990234375, 0.0880126953125, 0.1104736328125, ...

embed

66130944_c0

66130944

lisp

0

Title: How to modify list inside a function Problem title: How to modify list inside a function Tags: lisp, common-lisp Problem: How to modify list inside a function (defun list-parser (list count) ...);;this function reads items by count from list and do some process to them. ;;i.e.convert items read from code to char...

How to modify list inside a function How to modify list inside a function lisp common-lisp list code How i.e.convert Also objtype-2 slot-1 objtype-1 slot-2 slot-3 slot-4 How to modify list inside a function How to let it work like this:(read-list just works like read-byte in some way: 1.return a value read(and parsed h...

[ 0.00286865234375, 0.018798828125, 0.0091552734375, 0.01129150390625, 0.0137939453125, 0.0026702880859375, -0.00946044921875, 0.01806640625, 0.0172119140625, -0.00162506103515625, -0.01190185546875, -0.0302734375, 0.020751953125, -0.00579833984375, 0.0098876953125, -0.01226806640625, ...

[ 11249, 47, 2811, 40383, 5303, 46132, 32354, 400, 7008, 39210, 4086, 254, 18151, 2271, 11549, 995, 170, 50986, 5428, 24897, 5759, 8316, 11565, 2633, 4488, 1884, 903, 39116, 6562, 43240, 12301, 61028, 65395, 10, 34292, 366, 5281, 3688, 152028...

[ 0.08038330078125, 0.06939697265625, 0.182373046875, 0.195068359375, 0.2548828125, 0.19921875, 0.2203369140625, 0.123779296875, 0.201171875, 0.137451171875, 0.1142578125, 0.18505859375, 0.13720703125, 0.0386962890625, 0.14892578125, 0.0989990234375, 0.0657958984375, 0.1724853515625,...

embed

63827368_c0

63827368

lisp

0

Title: Scheme: Iterative process to reconstruct a list in original order? Problem title: Scheme: Iterative process to reconstruct a list in original order? Tags: lisp, list, functional-programming, scheme, tail-call-optimization Problem: Scheme: Iterative process to reconstruct a list in original order? My question is:...

Scheme: Iterative process to reconstruct a list in original order? Scheme: Iterative process to reconstruct a list in original order? lisp list functional-programming scheme tail-call-optimization Scheme Iterative Scheme: Iterative process to reconstruct a list in original order? My question is: how to write a procedur...

[ 0.0037384033203125, 0.022216796875, 0.000946044921875, 0.031982421875, -0.0093994140625, 0.018310546875, -0.0017547607421875, -0.0096435546875, 0.00119781494140625, -0.01251220703125, 0.008056640625, -0.02392578125, 0.002899169921875, -0.0005645751953125, 0.005615234375, 0.019409179687...

[ 34702, 282, 87, 720, 45023, 9433, 47, 44188, 36716, 5303, 23, 7311, 12989, 400, 7008, 123309, 28966, 150370, 46741, 85763, 100433, 10, 3642, 33022, 50491, 95601, 64549, 959, 39531, 184, 27781, 8781, 17, 28282, 43658, 2967, 4743, 80854, 158,...

[ 0.1929931640625, 0.152099609375, 0.0775146484375, 0.2052001953125, 0.2032470703125, 0.1708984375, 0.047576904296875, 0.145263671875, 0.1881103515625, 0.238525390625, 0.1181640625, 0.1553955078125, 0.221435546875, 0.040771484375, 0.1114501953125, 0.0906982421875, 0.074462890625, 0.1...

embed

10347634_c0

10347634

lisp

0

Title: Universal Func<> type in c# Problem title: Universal Func<> type in c# Tags: c%23, functional-programming, lisp Problem: Universal Func<> type in c# I'm writing a small Lisp interpreter in C#, and it's basically working already. Currently I'm using an interface to represent functions: public interfac...

Universal Func<> type in c# Universal Func<> type in c# c%23 functional-programming lisp Universal Func LispFunction Apply ArrayList Lisp foo.GlobalEnvironment.AddFunction foo.Eval foo.Read Should Universal Func<> type in c# I'm writing a small Lisp interpreter in C#, and it's basically working already. Cur...

[ 0.007232666015625, 0.03369140625, 0.00072479248046875, -0.0205078125, -0.0247802734375, -0.011474609375, 0.005889892578125, -0.00433349609375, 0.00156402587890625, -0.02099609375, 0.0023040771484375, -0.040283203125, -0.01171875, -0.012939453125, 0.01483154296875, 0.007415771484375, ...

[ 53900, 28670, 238, 5386, 10644, 23, 501, 4904, 3742, 123309, 28966, 400, 7008, 1261, 97249, 10763, 5659, 69253, 154663, 5775, 31, 162080, 686, 1900, 4028, 1405, 31345, 151117, 32562, 19336, 29481, 56, 313, 198343, 20697, 21771, 17368, 101758,...

[ 0.2275390625, 0.2171630859375, 0.148681640625, 0.02874755859375, 0.22216796875, 0.1163330078125, 0.06622314453125, 0.218505859375, 0.050262451171875, 0.156494140625, 0.10174560546875, 0.1295166015625, 0.1856689453125, 0.159912109375, 0.1932373046875, 0.00201416015625, 0.0762329101562...

embed

56954725_c0

56954725

lisp

0

Title: Set and Reset of System Variables - AutoCAD LISP Problem title: Set and Reset of System Variables - AutoCAD LISP Tags: autocad-plugin, autocad, autolisp, lisp Problem: Set and Reset of System Variables - AutoCAD LISP I'm trying to make drawing wiring diagrams extremely easy in AutoCAD with next to no button pres...

Set and Reset of System Variables - AutoCAD LISP Set and Reset of System Variables - AutoCAD LISP autocad-plugin autocad autolisp lisp Set Reset System Variables AutoCAD LISP PLINE var1 C:wire Audio Video Comm Coax Control LAYER PAUSE NETWORK POWER Progn Set and Reset of System Variables - AutoCAD LISP I'm trying to ma...

[ -0.003631591796875, 0.0216064453125, -0.023193359375, 0.0111083984375, -0.017822265625, 0.0177001953125, -0.007781982421875, 0.00970458984375, 0.006439208984375, 0.016357421875, 0.004852294921875, 0.04052734375, -0.006439208984375, -0.0213623046875, -0.0093994140625, -0.00830078125, ...

[ 19943, 136, 9624, 126, 111, 12353, 111477, 13566, 4396, 85427, 16970, 9434, 1809, 25426, 145301, 4086, 254, 400, 7008, 436, 57339, 285, 418, 17084, 32134, 2692, 3288, 1311, 14263, 27131, 137990, 11107, 8574, 91227, 31577, 188304, 1439, 214, ...

[ 0.1856689453125, 0.10650634765625, 0.1640625, 0.137451171875, 0.081298828125, 0.1767578125, 0.2276611328125, 0.1732177734375, 0.10986328125, 0.2197265625, 0.1583251953125, 0.1976318359375, 0.064453125, 0.1405029296875, 0.10223388671875, 0.06988525390625, 0.106689453125, 0.101440429...

embed

1249991_c0

1249991

lisp

0

Title: Variable references in lisp Problem title: Variable references in lisp Tags: lisp, common-lisp Problem: Variable references in lisp Another newbie (Common) LISP question: Basically in most programming languages there's a mean for functions to receive references to variables instead of just values, that is, passi...

Variable references in lisp Variable references in lisp lisp common-lisp Variable Variable references in lisp Another newbie (Common) LISP question: Basically in most programming languages there's a mean for functions to receive references to variables instead of just values, that is, passing by reference instead of pa...

[ 0.022705078125, 0.0235595703125, -0.012451171875, 0.01470947265625, 0.01080322265625, -0.00152587890625, -0.02294921875, 0.0019683837890625, -0.007537841796875, -0.0286865234375, -0.005767822265625, 0.017333984375, 0.004669189453125, 0.0240478515625, 0.030517578125, 0.002838134765625, ...

[ 84572, 2886, 91067, 7, 400, 7008, 23, 39210, 4086, 254, 9014, 10770, 3796, 16970, 9434, 2684, 56037, 46876, 29459, 32354, 53299, 47, 77336, 64457, 142424, 452, 390, 34292, 134381, 33022, 51312, 1632, 2967, 4734, 43658, 177261, 959, 8561, 73...

[ 0.210205078125, 0.16357421875, 0.290771484375, 0.015106201171875, 0.15087890625, 0.1898193359375, 0.0648193359375, 0.114501953125, 0.1070556640625, 0.153076171875, 0.03765869140625, 0.004302978515625, 0.09423828125, 0.1297607421875, 0.1904296875, 0.0472412109375, 0.069580078125, 0....

embed

51110694_c0

51110694

lisp

0

Title: Setf function names Problem title: Setf function names Tags: setf, lisp, common-lisp Problem: Setf function names Reading this question got me thinking about what constitutes a valid car of an expression. Obviously, symbols and lambdas can be "called" using the usual syntax. According to the hyperspec , function...

Setf function names Setf function names setf lisp common-lisp Setf Don Setf function names Reading this question got me thinking about what constitutes a valid car of an expression. Obviously, symbols and lambdas can be "called" using the usual syntax. According to the hyperspec , So, theoretically, (setf some-name) is...

[ 0.022216796875, -0.00775146484375, 0.023193359375, 0.004241943359375, -0.0113525390625, -0.004608154296875, -0.00958251953125, 0.006439208984375, -0.01287841796875, 0.0032196044921875, -0.013427734375, 0.0113525390625, -0.017333984375, -0.005523681640625, 0.0019073486328125, -0.0037841...

[ 19943, 420, 32354, 123055, 5423, 400, 7008, 39210, 4086, 254, 7650, 47644, 11764, 35604, 2258, 111, 125195, 26582, 136, 21, 6492, 1124, 831, 85763, 297, 115723, 6002, 86531, 59058, 16711, 3790, 2264, 3509, 3060, 11627, 9351, 9790, 165132, 6...

[ 0.2177734375, 0.200927734375, 0.2496337890625, 0.1669921875, 0.1676025390625, 0.07470703125, 0.1640625, 0.1158447265625, 0.08062744140625, 0.157470703125, 0.09295654296875, 0.0169525146484375, 0.1016845703125, 0.18115234375, 0.243896484375, 0.08154296875, 0.22265625, 0.20361328125,...

embed

41530257_c0

41530257

lisp

0

Title: Checking circularity in lisp - same variable through recursive function Problem title: Checking circularity in lisp - same variable through recursive function Tags: common-lisp, circular-list, lisp Problem: Checking circularity in lisp - same variable through recursive function I'm trying to create a function th...

Checking circularity in lisp - same variable through recursive function Checking circularity in lisp - same variable through recursive function common-lisp circular-list lisp Checking circ2 Checking circularity in lisp - same variable through recursive function I'm trying to create a function that would test whether th...

[ -0.004058837890625, 0.000766754150390625, 0.00347900390625, 0.0263671875, -0.0025482177734375, -0.018310546875, 0.005645751953125, 0.02001953125, 0.01171875, -0.02001953125, -0.0206298828125, 0.00860595703125, -0.006439208984375, 0.0028839111328125, 0.015869140625, 0.01904296875, -0....

[ 38679, 214, 115339, 2481, 400, 7008, 5701, 77336, 195625, 5844, 32354, 39210, 4086, 254, 6562, 42154, 304, 31577, 28282, 3034, 36766, 5303, 83, 456, 17137, 6275, 86595, 13, 50339, 2174, 221419, 35735, 864, 5117, 1632, 125216, 136, 234873, 1...

[ 0.1717529296875, 0.0076904296875, 0.2548828125, 0.115234375, 0.0828857421875, 0.1717529296875, 0.08074951171875, 0.1646728515625, 0.146240234375, 0.0626220703125, 0.1312255859375, 0.051177978515625, 0.07415771484375, 0.137451171875, 0.1400146484375, 0.1146240234375, 0.03704833984375,...

embed

16496596_c0

16496596

lisp

0

Title: Common Lisp Loop Trouble Problem title: Common Lisp Loop Trouble Tags: common-lisp, lisp Problem: Common Lisp Loop Trouble I have some trouble fully understanding CL's Loop macro. This is my code for Project Euler Nr. 32: (defun number-to-list (nr) (map 'list #'digit-char-p (prin1-to-string nr))) (defun nine-dig...

Common Lisp Loop Trouble Common Lisp Loop Trouble common-lisp lisp 1 2 Common Lisp Loop Trouble prin1-to-string euler-32 Common Lisp Loop Trouble I have some trouble fully understanding CL's Loop macro. This is my code for Project Euler Nr. 32: Although this gives me the correct solution, my problem is with function "p...

[ 0.007293701171875, 0.00193023681640625, 0.000911712646484375, 0.0030517578125, -0.016845703125, 0.0179443359375, -0.004608154296875, -0.0001773834228515625, 0.013427734375, -0.02587890625, -0.0042724609375, 0.00555419921875, 0.004302978515625, 0.008544921875, -0.005462646484375, 0.0052...

[ 151301, 1261, 7008, 199694, 119671, 2661, 39210, 4086, 254, 400, 2448, 20268, 188, 91693, 1175, 603, 108760, 3060, 63134, 89554, 100094, 46323, 111789, 18151, 27331, 5177, 9308, 2789, 106073, 26785, 29806, 2967, 32354, 3180, 140915, 9, 6562, ...

[ 0.1683349609375, 0.1798095703125, 0.1767578125, 0.2022705078125, 0.1434326171875, 0.057952880859375, 0.1258544921875, 0.1192626953125, 0.125244140625, 0.1114501953125, 0.119384765625, 0.019500732421875, 0.095703125, 0.1767578125, 0.1131591796875, 0.1756591796875, 0.2080078125, 0.01...

embed

46637898_c0

46637898

lisp

0

Title: SBCL error: "binding stack exhausted" when running Maxima on Linux machine Problem title: SBCL error: "binding stack exhausted" when running Maxima on Linux machine Tags: lisp, linux, maxima, common-lisp, sbcl Problem: SBCL error: "binding stack exhausted" when running Maxima on Linux machine...

SBCL error: "binding stack exhausted" when running Maxima on Linux machine SBCL error: "binding stack exhausted" when running Maxima on Linux machine lisp linux maxima common-lisp sbcl SBCL Maxima Linux INFO Binding Lisp PROCEED CAUTION Automatically drop_caches max_map_count sb-ext:gc System Host X...

[ 0.01519775390625, 0.0247802734375, -0.01361083984375, 0.007598876953125, -0.000743865966796875, -0.0003528594970703125, 0.01202392578125, -0.00665283203125, 0.003997802734375, -0.0322265625, 0.002593994140625, -0.00634765625, 0.0052490234375, 0.00787353515625, 0.0186767578125, 0.013122...

[ 90944, 37486, 18499, 128239, 177261, 146353, 297, 51042, 46540, 11, 98, 29908, 36279, 3229, 400, 7008, 11508, 6077, 122200, 39210, 4086, 254, 275, 34937, 123552, 1843, 33770, 1261, 441, 20000, 51719, 36069, 59863, 18389, 62346, 71013, 91, 335...

[ 0.1710205078125, 0.2144775390625, 0.200439453125, 0.243408203125, 0.2261962890625, 0.2587890625, 0.1129150390625, 0.131591796875, 0.242431640625, 0.2373046875, 0.066650390625, 0.2154541015625, 0.150634765625, 0.006866455078125, 0.08544921875, 0.1793212890625, 0.0797119140625, 0.048...

embed

59654902_c0

59654902

lisp

0

Title: User-friendly wrappings for tail recursive functions Problem title: User-friendly wrappings for tail recursive functions Tags: recursion, sbcl, lisp Problem: User-friendly wrappings for tail recursive functions I am trying to learn common lisp. I'm familiar with tail recursion, but I'm unfamiliar with the idioma...

User-friendly wrappings for tail recursive functions User-friendly wrappings for tail recursive functions recursion sbcl lisp User-friendly User-friendly wrappings for tail recursive functions I am trying to learn common lisp. I'm familiar with tail recursion, but I'm unfamiliar with the idiomatic way to wrap a tail re...

[ 0.00994873046875, 0.01422119140625, 0.005096435546875, -0.007354736328125, 0.0003376007080078125, 0.0194091796875, 0.003692626953125, -0.018798828125, 0.00946044921875, -0.02294921875, 0.00872802734375, 0.00180816650390625, -0.0123291015625, 0.01708984375, 0.046875, 0.0067138671875, ...

[ 53400, 193701, 137565, 10366, 100, 46741, 195625, 5844, 32354, 1830, 275, 34937, 400, 7008, 31577, 30698, 39210, 16031, 69211, 49666, 9523, 3917, 11782, 56, 959, 765, 61475, 183278, 1290, 77336, 27781, 36663, 38937, 4734, 111240, 107730, 1916, ...

[ 0.15283203125, 0.210693359375, 0.2412109375, 0.136962890625, 0.038787841796875, 0.27294921875, 0.2440185546875, 0.1395263671875, 0.2056884765625, 0.0589599609375, 0.031036376953125, 0.1192626953125, 0.1143798828125, 0.1822509765625, 0.0133056640625, 0.05340576171875, 0.150390625, 0...

embed

69539016_c0

69539016

lisp

0

Title: running Common Lisp application on Kubernetes cluster Problem title: running Common Lisp application on Kubernetes cluster Tags: lisp, kubernetes, common-lisp Problem: running Common Lisp application on Kubernetes cluster I have deployed on prod 10+ java/js microservices in GKE, all is good, none use external vo...

running Common Lisp application on Kubernetes cluster running Common Lisp application on Kubernetes cluster lisp kubernetes common-lisp Common Lisp Kubernetes running Common Lisp application on Kubernetes cluster I have deployed on prod 10+ java/js microservices in GKE, all is good, none use external volumes, its a sim...

[ 0.01422119140625, 0.0191650390625, -0.0003604888916015625, -0.01068115234375, -0.0235595703125, -0.00049591064453125, 0.004119873046875, -0.000949859619140625, 0.004486083984375, -0.00010824203491210938, 0.0123291015625, -0.00072479248046875, 0.018310546875, 0.006591796875, 0.00836181640...

[ 51042, 151301, 1261, 7008, 38415, 98, 96305, 3196, 1636, 234737, 400, 228, 46690, 30621, 39210, 4086, 254, 8, 13158, 502, 71, 209, 1328, 79, 330, 28175, 11948, 22584, 527, 15283, 756, 4127, 4527, 173591, 21950, 6863, 8781, 9433, 137158, 1...

[ 0.1190185546875, 0.263671875, 0.2117919921875, 0.2469482421875, 0.2076416015625, 0.051666259765625, 0.12060546875, 0.123291015625, 0.14013671875, 0.220947265625, 0.1240234375, 0.03399658203125, 0.1087646484375, 0.083984375, 0.1529541015625, 0.159423828125, 0.1937255859375, 0.028854...

embed

41691669_c0

41691669

lisp

0

Title: Why Doesn't Clojure provide standard library after creating new namespace? Problem title: Why Doesn't Clojure provide standard library after creating new namespace? Tags: namespaces, lisp, clojure, clojurescript, functional-programming Problem: Why Doesn't Clojure provide standard library after creatin...

Why Doesn't Clojure provide standard library after creating new namespace? Why Doesn't Clojure provide standard library after creating new namespace? namespaces lisp clojure clojurescript functional-programming CompilerException java.lang.RuntimeException Why Doesn Clojure clojure.lang.Namespace Unable bynyps...

[ -0.01348876953125, 0.00286865234375, -0.0037841796875, 0.0206298828125, -0.0089111328125, 0.0081787109375, 0.006866455078125, -0.00653076171875, -0.0106201171875, -0.0255126953125, -0.002197265625, -0.021240234375, 0.0067138671875, -0.0164794921875, 0.00823974609375, -0.00946044921875,...

[ 44084, 18, 51053, 461, 107, 22691, 5570, 35773, 1294, 7103, 105233, 3525, 210716, 400, 7008, 20450, 32032, 123309, 28966, 15612, 34759, 63928, 79, 330, 3066, 101790, 163612, 65421, 992, 2886, 299, 6423, 28568, 3173, 21178, 2967, 18151, 34390,...

[ 0.07373046875, 0.07177734375, 0.15966796875, 0.1839599609375, 0.141845703125, 0.1158447265625, 0.1949462890625, 0.19921875, 0.1202392578125, 0.051727294921875, 0.10211181640625, 0.1221923828125, 0.251708984375, 0.0150146484375, 0.1063232421875, 0.1201171875, 0.099853515625, 0.08911...

embed

16258308_c1

16258308

lisp

1

that f can call to achieve self-recursion. f is expected to define and return an "inner" function which does the "real" operation. That inner function accepts argument a (or in the general case an argument list, but that can't be expressed in the traditional notation). The result of calling Y_letrec is a result of cal...

[ 0.00311279296875, 0.00982666015625, 0.0242919921875, 0.0185546875, 0.01312255859375, 0.00897216796875, 0.01043701171875, -0.010009765625, 0.00176239013671875, -0.006988525390625, -0.004180908203125, 0.0133056640625, -0.0291748046875, 0.0181884765625, 0.034423828125, -0.005340576171875,...

[ 450, 1238, 831, 11782, 47, 69307, 15970, 107, 48650, 1830, 84751, 61924, 30646, 73, 1679, 32354, 14602, 30544, 41018, 75414, 26946, 10750, 10, 5303, 18, 36510, 89160, 110, 16750, 159029, 990, 454, 1974, 31688, 44136, 43542, 35839, 5423, 452...

[ 0.05255126953125, 0.200927734375, 0.11181640625, 0.1949462890625, 0.1065673828125, 0.1605224609375, 0.211669921875, 0.120361328125, 0.206787109375, 0.1265869140625, 0.152099609375, 0.1488037109375, 0.107421875, 0.1336669921875, 0.177490234375, 0.1910400390625, 0.06036376953125, 0.1...

embed

34125708_c0

34125708

lisp

0

Title: parameter evaluation of function call from a macro Problem title: parameter evaluation of function call from a macro Tags: lisp, common-lisp, clisp Problem: parameter evaluation of function call from a macro I have a function and one macro in which the function is called. And to see the difference, I trace the f...

parameter evaluation of function call from a macro parameter evaluation of function call from a macro lisp common-lisp clisp a Trace GEN-LISP NIL parameter evaluation of function call from a macro I have a function and one macro in which the function is called. And to see the difference, I trace the function and found ...

[ -0.00072479248046875, 0.025634765625, -0.005615234375, -0.011962890625, -0.014404296875, -0.0020904541015625, 0.01226806640625, -0.010986328125, -0.0076904296875, -0.032470703125, 0.000362396240234375, 0.004425048828125, -0.0162353515625, -0.0172119140625, -0.0006256103515625, -0.03344...

[ 171859, 219836, 32354, 11782, 1295, 111789, 400, 7008, 39210, 4086, 254, 95701, 4937, 329, 109141, 67616, 683, 541, 16444, 35839, 60212, 144851, 110, 105237, 15400, 70, 509, 959, 151575, 115081, 47, 96276, 16093, 361, 21162, 297, 17324, 9226,...

[ 0.253173828125, 0.2061767578125, 0.195068359375, 0.1895751953125, 0.137939453125, 0.2265625, 0.1279296875, 0.17919921875, 0.097412109375, 0.115478515625, 0.1552734375, 0.0654296875, 0.081298828125, 0.009063720703125, 0.121826171875, 0.10687255859375, 0.1231689453125, 0.052551269531...

embed

58890363_c0

58890363

lisp

0

Title: Why is package user not an environment in MIT Scheme 10.1? Problem title: Why is package user not an environment in MIT Scheme 10.1? Tags: lisp, mit-scheme, scheme Problem: Why is package user not an environment in MIT Scheme 10.1? Here is my MIT Scheme code: (display (name->package '(user))) (newline) (->enviro...

Why is package user not an environment in MIT Scheme 10.1? Why is package user not an environment in MIT Scheme 10.1? lisp mit-scheme scheme Why MIT Scheme foo.scm RESTART There Subproblem Compiled x2f xd8 x95ed10 You Type Why is package user not an environment in MIT Scheme 10.1? Here is my MIT Scheme code: This runs ...

[ 0.00701904296875, -0.01318359375, 0.0008544921875, 0.0286865234375, -0.018798828125, 0.017578125, -0.0010986328125, -0.00872802734375, -0.02001953125, -0.00439453125, 0.014892578125, 0.01806640625, -0.0006256103515625, -0.00103759765625, 0.0093994140625, -0.0240478515625, 0.006927490...

[ 44084, 83, 98169, 38937, 959, 142, 65998, 23, 78999, 34702, 282, 147546, 400, 7008, 491, 7560, 150370, 5775, 31, 3931, 627, 21828, 47136, 8622, 8273, 38953, 15612, 304, 420, 1019, 8821, 963, 60457, 18151, 127877, 5885, 64, 33261, 152590, ...

[ 0.1146240234375, 0.07794189453125, 0.254150390625, 0.25244140625, 0.17236328125, 0.1044921875, 0.2301025390625, 0.0626220703125, 0.217529296875, 0.2117919921875, 0.1771240234375, 0.2445068359375, 0.03533935546875, 0.1412353515625, 0.1778564453125, 0.1668701171875, 0.1881103515625, ...

embed

19849741_c1

19849741

lisp

1

"123 Not Real Blvd,") ("wine" "Some Wine Group" "777 S Does Not Exist Ave,"))) can not be converted to an SQL literal. [Condition of type SIMPLE-ERROR] Restarts: 0: [ABORT] Exit debugger, returning to top level. Backtrace: 0: ((SB-PCL::FAST-METHOD CL-POSTGRES:TO-SQL-STRING (T)) #<unavailable argument> #<unavailable ar...

[ 0.01348876953125, 0.01123046875, 0.0013885498046875, 0.01416015625, -0.0164794921875, 0.00958251953125, -0.0106201171875, 0.0027008056640625, -0.00958251953125, 0.00897216796875, 0.0203857421875, -0.01263427734375, -0.00173187255859375, -0.0201416015625, -0.02490234375, 0.0087890625, ...

[ 44, 48636, 11205, 5120, 335, 3723, 71, 18939, 9494, 13, 8912, 282, 120634, 10760, 102294, 159, 101790, 5443, 1419, 40168, 32149, 831, 959, 117176, 47, 142, 80866, 15659, 289, 428, 10644, 40288, 103084, 9, 12501, 14255, 49756, 67987, 757, ...

[ 0.0028076171875, 0.28125, 0.21728515625, 0.27880859375, 0.010772705078125, 0.126220703125, 0.07464599609375, 0.004425048828125, 0.1669921875, 0.1124267578125, 0.0184326171875, 0.053924560546875, 0.18603515625, 0.167724609375, 0.2261962890625, 0.1168212890625, 0.096435546875, 0.1196...

embed

20259845_c0

20259845

lisp

0

Title: Changing a program while it is running Problem title: Changing a program while it is running Tags: slime, read-eval-print-loop, common-lisp, emacs, lisp Problem: Changing a program while it is running Not sure if this is an emacs-SLIME issue or a CL issue or SBCL issue. I've heard it said that the interactive na...

Changing a program while it is running Changing a program while it is running slime read-eval-print-loop common-lisp emacs lisp Changing Changing a program while it is running Not sure if this is an emacs-SLIME issue or a CL issue or SBCL issue. I've heard it said that the interactive nature of Lisp allows for changing...

[ -0.0123291015625, 0.00836181640625, -0.000911712646484375, 0.002166748046875, 0.003143310546875, 0.01007080078125, 0.005584716796875, 0.01507568359375, 0.007080078125, -0.015625, -0.002593994140625, 0.019287109375, -0.039794921875, -0.006378173828125, 0.0234375, 0.004486083984375, 0....

[ 108193, 214, 1528, 12960, 442, 83, 51042, 34264, 13, 12301, 1405, 35662, 28354, 39210, 4086, 254, 352, 2263, 400, 7008, 7, 30508, 66820, 31089, 46323, 90944, 37486, 212398, 31425, 1261, 114864, 151134, 37842, 25632, 22466, 84797, 11435, 9969,...

[ 0.255615234375, 0.0457763671875, 0.2301025390625, 0.1778564453125, 0.0421142578125, 0.07684326171875, 0.226318359375, 0.1710205078125, 0.1483154296875, 0.1419677734375, 0.2156982421875, 0.1385498046875, 0.168701171875, 0.0797119140625, 0.10321044921875, 0.1483154296875, 0.06048583984...

embed

16181382_c0

16181382

lisp

0

Title: Persistent data structures: a persistent index? Problem title: Persistent data structures: a persistent index? Tags: javascript, lisp, functional-programming, data-structures Problem: Persistent data structures: a persistent index? Functional programming utilizes immutable data. When you modify something you rei...

Persistent data structures: a persistent index? Persistent data structures: a persistent index? javascript lisp functional-programming data-structures Persistent Persistent data structures: a persistent index? Functional programming utilizes immutable data. When you modify something you reinstantiate "the world" reusin...

[ 0.007537841796875, 0.0439453125, -0.00946044921875, -0.01019287109375, 0.01513671875, 0.01531982421875, 0.01373291015625, -0.005523681640625, 0.0137939453125, -0.0390625, 0.016845703125, -0.0030059814453125, -0.003936767578125, 0.01092529296875, -0.005767822265625, 0.00848388671875, ...

[ 57309, 2581, 18, 2053, 45646, 7, 12, 10, 70560, 2517, 63262, 32, 136951, 400, 7008, 123309, 28966, 137656, 28670, 10763, 56037, 449, 121876, 566, 561, 22819, 14847, 2811, 40383, 9844, 456, 143034, 101426, 8999, 223, 96362, 107032, 7722, 962...

[ 0.189453125, 0.1951904296875, 0.1275634765625, 0.18115234375, 0.2568359375, 0.039886474609375, 0.030609130859375, 0.090087890625, 0.2425537109375, 0.1781005859375, 0.281494140625, 0.01141357421875, 0.222412109375, 0.10302734375, 0.1832275390625, 0.147705078125, 0.1124267578125, 0.1...

embed

12990296_c1

12990296

lisp

1

- and using equal? function, somewhere inside recursive calls, we eventually get #t for both 1 and 2: 5. (is-in? '(2 3 4) '(1 2 3 4)) -> #t 6. (is-in? '(2 3 4) '(1 (2 3 4)) -> #t So how to get that kind of behaviour from 1? I want to have a function, which works with all different types of data. Here's my function, wh...

[ -0.01513671875, 0.03759765625, -0.004425048828125, 0.005126953125, 0.005706787109375, 0.01483154296875, -0.00933837890625, -0.0048828125, 0.006317138671875, -0.0302734375, 0.01470947265625, 0.00031280517578125, 0.0093994140625, -0.00604248046875, 0.002685546875, 0.002716064453125, 0....

[ 136, 17368, 105950, 32, 32354, 174653, 46132, 195625, 5844, 11782, 7, 642, 155605, 2046, 468, 18, 100, 15044, 106, 15573, 1892, 164, 73, 54753, 138, 13956, 16, 2289, 41600, 3642, 450, 8562, 224833, 1295, 3444, 765, 43240, 678, 756, 12921,...

[ 0.086181640625, 0.1356201171875, 0.269287109375, 0.1904296875, 0.21435546875, 0.062255859375, 0.2230224609375, 0.188232421875, 0.1463623046875, 0.203125, 0.051605224609375, 0.001953125, 0.1004638671875, 0.12353515625, 0.111572265625, 0.1513671875, 0.021575927734375, 0.0377502441406...

embed

13537622_c0

13537622

lisp

0

Title: Lambda Calculus CONS Pair implementation with Lisp Problem title: Lambda Calculus CONS Pair implementation with Lisp Tags: lisp, lambda-calculus Problem: Lambda Calculus CONS Pair implementation with Lisp I'm trying to implement a Church Pair Lambda Calc. style with CLisp. According with Wikipedia: pair ≡ λx.λy....

Lambda Calculus CONS Pair implementation with Lisp Lambda Calculus CONS Pair implementation with Lisp lisp lambda-calculus Lambda Calculus CONS Pair Lisp FIRST SECOND church2int int2church FUNCALL Lambda Calculus CONS Pair implementation with Lisp I'm trying to implement a Church Pair Lambda Calc. style with CLisp. Acc...

[ 0.010009765625, 0.0140380859375, 0.007171630859375, 0.02099609375, -0.006591796875, 0.01025390625, -0.009033203125, 0.006744384765625, 0.0026092529296875, -0.030517578125, 0.01385498046875, 0.006683349609375, 0.0030059814453125, -0.0179443359375, 0.0218505859375, 0.00592041015625, -0...

[ 122930, 85, 212467, 223, 109022, 1342, 481, 208124, 678, 1261, 7008, 400, 6492, 6827, 94739, 133907, 77980, 106820, 304, 4288, 23, 18, 474, 136258, 441, 66437, 31577, 29479, 84084, 9113, 238, 20623, 164, 254, 8162, 2060, 18151, 8545, 136, ...

[ 0.19677734375, 0.1597900390625, 0.21630859375, 0.0562744140625, 0.1878662109375, 0.1793212890625, 0.1405029296875, 0.1619873046875, 0.052398681640625, 0.150390625, 0.2374267578125, 0.1124267578125, 0.1832275390625, 0.114990234375, 0.10400390625, 0.0655517578125, 0.07891845703125, 0...

embed

55408445_c1

55408445

lisp

1

{ term.error(e.message); }); }, { name: 'lisp', prompt: 'lips> ', enabled: false, greetings: false, keymap: { ENTER: function(e, original) { if (lips.balanced_parenthesis(this.get_command())) { original(); } else { var i = indent(this, 3, this.get_prompt().length); this.insert('\n' + (new Array(i + 1).join(' '))); } }...

[ -0.009033203125, 0.00156402587890625, -0.005035400390625, 0.026611328125, -0.025634765625, 0.0191650390625, 0.005340576171875, 0.00482177734375, -0.012451171875, -0.0206298828125, 0.013427734375, 0.00191497802734375, -0.007293701171875, 0.00445556640625, -0.00909423828125, 0.0138549804...

[ 13579, 188800, 13, 74157, 9351, 4086, 254, 105876, 95680, 225081, 98320, 3514, 126, 5180, 22799, 62346, 116563, 32354, 7311, 2174, 173212, 71, 99547, 160291, 100231, 3794, 277, 12018, 17, 18597, 18, 138, 903, 3454, 2676, 23986, 33657, 54936, ...

[ 0.170166015625, 0.1927490234375, 0.0811767578125, 0.1112060546875, 0.0243072509765625, 0.0948486328125, 0.1732177734375, 0.259521484375, 0.190185546875, 0.125, 0.0732421875, 0.0692138671875, 0.002838134765625, 0.0029296875, 0.098876953125, 0.171142578125, 0.222412109375, 0.17114257...

embed

69126175_c0

69126175

lisp

0

Title: Usefulness of let? Problem title: Usefulness of let? Tags: lisp Problem: Usefulness of let? Is the distinction between the 3 different let forms (as in Scheme's let, let*, and letrec) useful in practice? I am current in the midst of developing a lisp-style language that does current support all 3 forms, yet I ha...

Usefulness of let? Usefulness of let? lisp Usefulness Usefulness of let? Is the distinction between the 3 different let forms (as in Scheme's let, let*, and letrec) useful in practice? I am current in the midst of developing a lisp-style language that does current support all 3 forms, yet I have found: regular "let" is...

[ 0.005950927734375, 0.00799560546875, 0.016357421875, 0.00830078125, -0.00201416015625, 0.01116943359375, 0.00154876708984375, -0.00885009765625, 0.006256103515625, 0.0045166015625, -0.00811767578125, -0.0147705078125, 0.00921630859375, 0.00994873046875, 0.001739501953125, -0.0062561035...

[ 36836, 7844, 7432, 111, 2633, 400, 7008, 149067, 19, 17721, 138, 12921, 3173, 7, 34702, 282, 1639, 31688, 80234, 41361, 43581, 168698, 40946, 46876, 8060, 756, 20324, 1974, 83, 2684, 24500, 45964, 3900, 19309, 109312, 6492, 85, 167934, 1393...

[ 0.2003173828125, 0.1689453125, 0.088134765625, 0.1197509765625, 0.29296875, 0.1129150390625, 0.169677734375, 0.1549072265625, 0.042327880859375, 0.062744140625, 0.10552978515625, 0.1224365234375, 0.208984375, 0.07611083984375, 0.11376953125, 0.1236572265625, 0.1474609375, 0.2211914...

embed

23917060_c0

23917060

lisp

0

Title: Stack overflow with assoc and a function test Problem title: Stack overflow with assoc and a function test Tags: stack-overflow, lisp Problem: Stack overflow with assoc and a function test I wrote this function, that returns t if the arguments given match, else nil. (defun match (input-form pattern) (cond ((and ...

Stack overflow with assoc and a function test Stack overflow with assoc and a function test stack-overflow lisp Stack Eliza Stack overflow with assoc and a function test I wrote this function, that returns t if the arguments given match, else nil. When I do this : It works well and returns : ((bonjour *) bonjour) and (...

[ -0.001922607421875, 0.020751953125, -0.0107421875, 0.000701904296875, 0.0034027099609375, -0.029296875, 0.002410888671875, 0.0284423828125, 0.02294921875, -0.050537109375, 0.01904296875, -0.0064697265625, 0.000652313232421875, -0.0079345703125, 0.0267333984375, -0.005828857421875, 0....

[ 6512, 2594, 645, 118664, 678, 63927, 238, 136, 10, 32354, 3034, 177261, 5465, 400, 7008, 126443, 54397, 30646, 808, 2174, 10750, 34475, 14858, 37076, 17324, 43240, 5299, 8345, 100201, 661, 3948, 73395, 127, 13817, 103510, 6954, 468, 98753, ...

[ 0.1240234375, 0.0833740234375, 0.1090087890625, 0.20263671875, 0.043212890625, 0.142578125, 0.1629638671875, 0.049285888671875, 0.0175018310546875, 0.162353515625, 0.2060546875, 0.1434326171875, 0.07794189453125, 0.03997802734375, 0.139404296875, 0.2276611328125, 0.06402587890625, ...

embed

7366093_c0

7366093

lisp

0

Title: A prototyping language with the ability to be fast Problem title: A prototyping language with the ability to be fast Tags: artificial-intelligence, math, go, prototype, lisp Problem: A prototyping language with the ability to be fast as an engineering student with a strong mathemathical background, i dealing som...

A prototyping language with the ability to be fast A prototyping language with the ability to be fast artificial-intelligence math go prototype lisp A prototyping language with the ability to be fast as an engineering student with a strong mathemathical background, i dealing some problems like this at university: (nume...

[ 0.0250244140625, 0.0133056640625, 0.00897216796875, 0.00616455078125, -0.01031494140625, -0.018798828125, 0.0091552734375, -0.01123046875, -0.006683349609375, -0.018798828125, 0.006622314453125, -0.0242919921875, -0.019775390625, -0.0162353515625, -0.0034942626953125, 0.00823974609375,...

[ 62, 160469, 214, 46876, 678, 81273, 47, 186, 4271, 66733, 130687, 48909, 738, 13, 400, 7008, 237, 177907, 9836, 10, 37515, 140363, 927, 21533, 76615, 17, 184017, 44402, 1884, 903, 99, 152363, 2606, 16, 144814, 38730, 15649, 7, 66349, 2713...

[ 0.0582275390625, 0.315673828125, 0.1259765625, 0.256591796875, 0.068115234375, 0.197998046875, 0.050567626953125, 0.119384765625, 0.207275390625, 0.1220703125, 0.1129150390625, 0.1312255859375, 0.1365966796875, 0.1558837890625, 0.1083984375, 0.2388916015625, 0.01513671875, 0.094726...

embed

40452043_c0

40452043

lisp

0

Title: Unit-testing in Racket with objects Problem title: Unit-testing in Racket with objects Tags: unit-testing, lisp, racket, testing Problem: Unit-testing in Racket with objects I am trying to build the classic game "Snake" with Racket and Dr. Racket. I like using unit-tests to see if I am understanding the concepts...

Unit-testing in Racket with objects Unit-testing in Racket with objects unit-testing lisp racket testing rackunit Unit-testing Racket FAILURE Desktop cap-6.rkt Unit-testing in Racket with objects I am trying to build the classic game "Snake" with Racket and Dr. Racket. I like using unit-tests to see if I am understandi...

[ 0.00537109375, 0.0005645751953125, -0.0118408203125, 0.01806640625, 0.0027313232421875, -0.01116943359375, 0.00982666015625, 0.00188446044921875, -0.0033416748046875, 0.000888824462890625, 0.006072998046875, 0.0064697265625, 0.005706787109375, -0.01531982421875, 0.006134033203125, 0.00...

[ 46640, 6954, 2552, 27853, 678, 36746, 214, 23, 25072, 7008, 673, 134234, 28779, 217, 15491, 16444, 141423, 3540, 13545, 7190, 18, 31577, 45367, 70, 54704, 6712, 294, 1141, 13, 1773, 1884, 100094, 23755, 50155, 18151, 105233, 45646, 80934, 1...

[ 0.1888427734375, 0.221923828125, 0.0955810546875, 0.197265625, 0.067626953125, 0.1455078125, 0.005950927734375, 0.002410888671875, 0.1842041015625, 0.06951904296875, 0.0712890625, 0.1898193359375, 0.09027099609375, 0.1824951171875, 0.02734375, 0.01263427734375, 0.09521484375, 0.066...

embed

55158158_c0

55158158

lisp

0

Title: LISP - Program to search a specific function through its parameters Problem title: LISP - Program to search a specific function through its parameters Tags: common-lisp, function, lisp, parameter-list Problem: LISP - Program to search a specific function through its parameters For a course project I got to write...

LISP - Program to search a specific function through its parameters LISP - Program to search a specific function through its parameters common-lisp function lisp parameter-list LISP Program LISP - Program to search a specific function through its parameters For a course project I got to write a program in lisp. The pro...

[ 0.00665283203125, 0.0238037109375, -0.02294921875, 0.00084686279296875, -0.025146484375, 0.0181884765625, 0.02001953125, -0.0162353515625, -0.003509521484375, -0.0439453125, 0.0125732421875, -0.019287109375, -0.0167236328125, 0.000934600830078125, 0.010009765625, 0.00396728515625, 0....

[ 16970, 9434, 20, 7663, 47, 33938, 29458, 32354, 8305, 6863, 171859, 7, 39210, 4086, 254, 400, 7008, 6562, 15411, 13452, 33022, 1528, 23, 5608, 70541, 2684, 5526, 107730, 140992, 35829, 5117, 5303, 36746, 13448, 32786, 4488, 116, 12921, 4832...

[ 0.210205078125, 0.29345703125, 0.0335693359375, 0.21533203125, 0.05743408203125, 0.2315673828125, 0.1761474609375, 0.2183837890625, 0.1375732421875, 0.06524658203125, 0.24951171875, 0.0155181884765625, 0.1085205078125, 0.1749267578125, 0.2261962890625, 0.1826171875, 0.2403564453125, ...

embed

7074122_c0

7074122

lisp

0

Title: Possible to reset user environment in Scheme REPL? Problem title: Possible to reset user environment in Scheme REPL? Tags: reset, read-eval-print-loop, lisp, scheme Problem: Possible to reset user environment in Scheme REPL? Scheme newbie question- Is there a way for me to reset my current REPL environment (i.e....

Possible to reset user environment in Scheme REPL? Possible to reset user environment in Scheme REPL? reset read-eval-print-loop lisp scheme Possible Scheme REPL Possible to reset user environment in Scheme REPL? Scheme newbie question- Is there a way for me to reset my current REPL environment (i.e. the default user e...

[ -0.00860595703125, 0.0106201171875, -0.0005035400390625, 0.039794921875, -0.0201416015625, 0.0042724609375, 0.00909423828125, -0.0257568359375, -0.0126953125, -0.014404296875, 0.0006866455078125, 0.006866455078125, -0.015625, 0.01531982421875, 0.005218505859375, -0.002532958984375, 0...

[ 115861, 2661, 47, 168398, 38937, 65998, 23, 34702, 282, 9069, 21130, 12301, 13, 1405, 35662, 28354, 400, 7008, 150370, 9014, 3917, 43581, 114977, 15490, 569, 456, 17137, 1884, 148, 48672, 1810, 351, 96362, 61924, 21543, 17368, 165132, 95409, ...

[ 0.1162109375, 0.0850830078125, 0.059234619140625, 0.268798828125, 0.227783203125, 0.262451171875, 0.03558349609375, 0.1923828125, 0.1649169921875, 0.1484375, 0.271728515625, 0.1256103515625, 0.0098876953125, 0.1849365234375, 0.137939453125, 0.1922607421875, 0.0985107421875, 0.18676...

embed

26696127_c0

26696127

lisp

0

Title: How can I convert this recursive solution into an iterative one? Problem title: How can I convert this recursive solution into an iterative one? Tags: algorithm, elisp, lisp Problem: How can I convert this recursive solution into an iterative one? I have the following recursive function in Lisp (defun f (item tr...

How can I convert this recursive solution into an iterative one? How can I convert this recursive solution into an iterative one? algorithm elisp lisp How How can I convert this recursive solution into an iterative one? I have the following recursive function in Lisp This function receives a tree and an item to look fo...

[ 0.00628662109375, -0.005218505859375, -0.00099945068359375, -0.01312255859375, 0.00433349609375, 0.010498046875, -0.0157470703125, -0.01153564453125, -0.00160980224609375, -0.02880859375, 0.01239013671875, 0.0196533203125, -0.022705078125, -0.000545501708984375, 0.0096435546875, 0.0042...

[ 11249, 831, 87, 96760, 903, 195625, 5844, 29806, 3934, 142, 17, 720, 45023, 1632, 234873, 15296, 7008, 400, 25632, 32354, 23, 1261, 53299, 53201, 136, 35735, 47, 6713, 100, 6863, 168894, 31358, 4263, 83, 2258, 2499, 1614, 6562, 1221, 3064...

[ 0.09716796875, 0.080078125, 0.016845703125, 0.2059326171875, 0.0941162109375, 0.239013671875, 0.1566162109375, 0.2039794921875, 0.1383056640625, 0.06427001953125, 0.070068359375, 0.21630859375, 0.20654296875, 0.09765625, 0.181640625, 0.0777587890625, 0.25439453125, 0.1309814453125,...

embed

18811335_c0

18811335

lisp

0

Title: How to load external dependencies with quicklisp? Problem title: How to load external dependencies with quicklisp? Tags: clisp, common-lisp, emacs, lisp, quicklisp Problem: How to load external dependencies with quicklisp? Here is my code: (defpackage :com.yves.tests (:use :common-lisp)) (in-package :com.yves.te...

How to load external dependencies with quicklisp? How to load external dependencies with quicklisp? clisp common-lisp emacs lisp quicklisp usocket LOAD How com.yves.tests Condition SYSTEM::SIMPLE-FILE-ERROR CL-USER ql:quickload ASDF Loading Users clisp-2.49 How to load external dependencies with quicklisp? Here is my c...

[ 0.00439453125, 0.01904296875, 0.010498046875, -0.006134033203125, -0.011962890625, 0.031982421875, 0.00830078125, 0.012939453125, 0.000339508056640625, -0.026611328125, -0.01263427734375, -0.0021514892578125, -0.01904296875, -0.021484375, 0.00799560546875, -0.00848388671875, -0.01855...

[ 11249, 72367, 173591, 42548, 117538, 678, 63773, 4086, 254, 47, 95701, 7008, 39210, 352, 2263, 400, 5388, 27853, 22215, 375, 3132, 6954, 46347, 90420, 73434, 103084, 919, 52099, 12501, 14255, 46323, 1062, 50184, 99247, 3181, 2594, 63033, 6483...

[ 0.0611572265625, 0.204345703125, 0.2252197265625, 0.2266845703125, 0.1417236328125, 0.0836181640625, 0.1734619140625, 0.208740234375, 0.206298828125, 0.008575439453125, 0.107177734375, 0.1929931640625, 0.0814208984375, 0.03009033203125, 0.0780029296875, 0.092041015625, 0.012573242187...

embed

53032622_c0

53032622

lisp

0

Title: Recursive processing of list elements in LISP Problem title: Recursive processing of list elements in LISP Tags: recursion, list, lisp, functional-programming Problem: Recursive processing of list elements in LISP Here is a task: a list is given, some of the elements are also lists. It's nescessary to replace th...

Recursive processing of list elements in LISP Recursive processing of list elements in LISP recursion list lisp functional-programming Recursive LISP NIL Recursive processing of list elements in LISP Here is a task: a list is given, some of the elements are also lists. It's nescessary to replace the nested lists with t...

[ -0.0201416015625, 0.033447265625, 0.007354736328125, -0.0021514892578125, -0.007354736328125, 0.0322265625, -0.0087890625, 0.01397705078125, -0.005523681640625, -0.0012664794921875, 0.015869140625, -0.0152587890625, -0.002227783203125, 0.00087738037109375, 0.005279541015625, 0.02014160...

[ 853, 48650, 5844, 9433, 214, 5303, 80854, 16970, 9434, 195625, 1830, 400, 7008, 123309, 28966, 541, 16444, 66211, 34475, 3060, 2843, 4909, 26531, 6635, 91995, 8512, 71, 10554, 101935, 2174, 756, 3853, 17368, 49129, 14858, 35431, 7103, 167201,...

[ 0.07196044921875, 0.213134765625, 0.1480712890625, 0.1512451171875, 0.0687255859375, 0.187255859375, 0.1656494140625, 0.123291015625, 0.2061767578125, 0.215576171875, 0.1260986328125, 0.0865478515625, 0.1610107421875, 0.113037109375, 0.07470703125, 0.02642822265625, 0.0916748046875, ...

embed

3672243_c1

3672243

lisp

1

power. I'm pretty new to Python and am trying to see how decorators fit in. They seem a little looser in that a decorator can be a completely external function which yet has the ability to manipulate information within the calling information and even modifying the instance and class variables of the object called, an...

[ -0.007720947265625, -0.004791259765625, 0.0244140625, 0.0057373046875, 0.011474609375, 0.0191650390625, 0.0096435546875, -0.0017547607421875, 0.02685546875, 0.0033721923828125, -0.01953125, 0.01373291015625, -0.00848388671875, 0.0233154296875, 0.0079345703125, -0.0245361328125, -0.00...

[ 14537, 5, 28875, 3525, 145581, 31577, 3642, 65177, 22230, 11177, 23, 48903, 10176, 5078, 2189, 1290, 831, 186, 64557, 173591, 32354, 14373, 81273, 45258, 4677, 28032, 159029, 2811, 151138, 110527, 18507, 77336, 36746, 35839, 5037, 31486, 10932,...

[ 0.251708984375, 0.023162841796875, 0.00897216796875, 0.039947509765625, 0.2493896484375, 0.017181396484375, 0.023834228515625, 0.2880859375, 0.2421875, 0.16552734375, 0.1114501953125, 0.04010009765625, 0.03204345703125, 0.08624267578125, 0.06927490234375, 0.23095703125, 0.06188964843...

embed

5363393_c0

5363393

lisp

0

Title: Rewriting Wizard game of Land of Lisp in Clojure Problem title: Rewriting Wizard game of Land of Lisp in Clojure Tags: lisp, land-of-lisp, jvm, clojure Problem: Rewriting Wizard game of Land of Lisp in Clojure I'm trying to rewrite the Wizard game from "Land of Lisp" http://landoflisp.com/wizards_game.lisp (def ...

Rewriting Wizard game of Land of Lisp in Clojure Rewriting Wizard game of Land of Lisp in Clojure lisp land-of-lisp jvm clojure here Rewriting Wizard Land Lisp Clojure Rewriting Wizard game of Land of Lisp in Clojure I'm trying to rewrite the Wizard game from "Land of Lisp" http://landoflisp.com/wizards_game.lisp When ...

[ -0.013671875, 0.01953125, -0.027587890625, 0.0130615234375, -0.0013580322265625, 0.0018768310546875, 0.000152587890625, -0.009765625, -0.005645751953125, -0.02001953125, -0.004730224609375, -0.0113525390625, -0.0211181640625, 0.0108642578125, -0.00811767578125, -0.00946044921875, 0.0...

[ 853, 199332, 221479, 6712, 6557, 111, 1261, 7008, 23, 51053, 461, 107, 400, 3551, 4390, 4086, 254, 334, 39, 20450, 3688, 31577, 456, 434, 18781, 1295, 94646, 34446, 36361, 44239, 99397, 35311, 903, 131527, 87, 2301, 18, 765, 10, 7, 6493...

[ 0.1385498046875, 0.2410888671875, 0.1885986328125, 0.143310546875, 0.1524658203125, 0.16015625, 0.1844482421875, 0.2117919921875, 0.0253753662109375, 0.1234130859375, 0.148193359375, 0.052581787109375, 0.1168212890625, 0.124755859375, 0.1531982421875, 0.1124267578125, 0.1707763671875...

embed

55987913_c0

55987913

lisp

0

Title: "illegal terminating character after a colon: #\" in portacle, though no colons in code Problem title: "illegal terminating character after a colon: #\" in portacle, though no colons in code Tags: sbcl, lisp, common-lisp Problem: "illegal terminating character after a colon: #\" in portacle, ...

"illegal terminating character after a colon: #\" in portacle, though no colons in code "illegal terminating character after a colon: #\" in portacle, though no colons in code sbcl lisp common-lisp main.lisp:1:1 READ COMPILE-FILE Line Column File-Position Stream SB-INT:FORM-TRACKING-STREAM main.lisp...

[ 0.021240234375, 0.01251220703125, -0.0162353515625, 0.007080078125, -0.01348876953125, -0.0047607421875, 0.01434326171875, 0.0006103515625, 0.00494384765625, -0.01171875, -0.0036773681640625, -0.0125732421875, 0.01324462890625, -0.006195068359375, 0.00640869140625, -0.0013885498046875,...

[ 2186, 2870, 121011, 214, 62816, 7103, 46512, 468, 4898, 11030, 21208, 110, 7, 18151, 34937, 400, 7008, 39210, 4086, 254, 5201, 19721, 188300, 61898, 52099, 16777, 233987, 42724, 7192, 172, 115061, 90944, 59537, 98533, 37082, 441, 56564, 15612...

[ 0.115966796875, 0.148681640625, 0.2052001953125, 0.029754638671875, 0.1822509765625, 0.1197509765625, 0.2491455078125, 0.10699462890625, 0.16748046875, 0.18505859375, 0.08740234375, 0.116455078125, 0.0160064697265625, 0.17822265625, 0.09503173828125, 0.0579833984375, 0.110595703125, ...

embed

15760966_c0

15760966

lisp

0

Title: LISP: How can I test if two lists have the same elements? Problem title: LISP: How can I test if two lists have the same elements? Tags: equality, lisp, list Problem: LISP: How can I test if two lists have the same elements? I want to write a function that takes as parameters two lists and checks if every elemen...

LISP: How can I test if two lists have the same elements? LISP: How can I test if two lists have the same elements? equality lisp list LISP How CAR CDR LENGTH MEMBER NOT MAPCAR APPLY SETQ lst1 lst2 LISP: How can I test if two lists have the same elements? I want to write a function that takes as parameters two lists an...

[ -0.005859375, 0.032470703125, 0.005340576171875, 0.00457763671875, -0.0142822265625, 0.0244140625, -0.00138092041015625, -0.0052490234375, -0.003997802734375, -0.021728515625, -0.00244140625, 0.00567626953125, 0.01513671875, 0.005035400390625, -0.01348876953125, 0.001434326171875, 0....

[ 16970, 9434, 11249, 831, 3034, 2174, 6626, 5303, 7, 765, 5701, 80854, 28, 161789, 400, 7008, 42476, 23498, 339, 48262, 276, 108582, 86725, 105748, 80076, 66440, 128565, 2737, 304, 87, 3444, 33022, 32354, 171859, 12765, 11907, 12830, 5117, 9...

[ 0.1014404296875, 0.149658203125, 0.049407958984375, 0.06463623046875, 0.2371826171875, 0.09747314453125, 0.1453857421875, 0.220947265625, 0.0797119140625, 0.058746337890625, 0.187744140625, 0.1881103515625, 0.0217437744140625, 0.1456298828125, 0.0916748046875, 0.1424560546875, 0.1267...

embed

72603847_c0

72603847

lisp

0

Title: How to modify this AutoLISP code to count how many polylines are there grouped by the linetype? Problem title: How to modify this AutoLISP code to count how many polylines are there grouped by the linetype? Tags: grouping, lisp, autolisp, autocad Problem: How to modify this AutoLISP code to count how many polyli...

How to modify this AutoLISP code to count how many polylines are there grouped by the linetype? How to modify this AutoLISP code to count how many polylines are there grouped by the linetype? grouping lisp autolisp autocad How AutoLISP _:L-I POLYLINE NOT ByLayer How to modify this AutoLISP code to count how many polyli...

[ -0.0036468505859375, 0.0068359375, -0.0031890869140625, 0.019775390625, -0.028564453125, 0.000751495361328125, 0.0072021484375, 0.0030670166015625, 0.01446533203125, -0.00811767578125, -0.00836181640625, -0.01611328125, 0.032958984375, 0.01031494140625, -0.0198974609375, 0.011352539062...

[ 11249, 2811, 40383, 903, 4396, 67616, 683, 18151, 54529, 3642, 5941, 35874, 59801, 2685, 37769, 71, 390, 13315, 50986, 21115, 214, 400, 7008, 1809, 4086, 254, 25426, 866, 9, 568, 64353, 1723, 57339, 86725, 3311, 2729, 8889, 1884, 3714, 39...

[ 0.04241943359375, 0.1077880859375, 0.1123046875, 0.044097900390625, 0.173828125, 0.1197509765625, 0.19091796875, 0.1470947265625, 0.1629638671875, 0.040924072265625, 0.10693359375, 0.1893310546875, 0.2235107421875, 0.090087890625, 0.20849609375, 0.033477783203125, 0.05517578125, 0....

embed

9816225_c0

9816225

lisp

0

Title: Writing a Lisp macro with nested quasiquoting Problem title: Writing a Lisp macro with nested quasiquoting Tags: lisp, macros Problem: Writing a Lisp macro with nested quasiquoting I'm trying to write a Lisp macro that writes a bunch of macros, but I'm having problems generating macro code that uses the splice o...

Writing a Lisp macro with nested quasiquoting Writing a Lisp macro with nested quasiquoting lisp macros Writing Lisp XXX PROGN DEFMACRO DO-SOME-LIST KEY ARGS NAME OPERATION BODY WITH-GENSYMS LOOP-LIST BUILD-BIND SOME WHEN SOME-P WITH-SOME Writing a Lisp macro with nested quasiquoting I'm trying to write a Lisp macro th...

[ -0.00494384765625, 0.037353515625, -0.018310546875, -0.0242919921875, -0.0118408203125, 0.029052734375, 0.0040283203125, -0.01263427734375, 0.0140380859375, 0.004364013671875, 0.0007476806640625, -0.01324462890625, 0.00689697265625, 0.0064697265625, 0.000621795654296875, 0.005218505859...

[ 213185, 1261, 7008, 111789, 678, 8512, 71, 12404, 41502, 400, 44585, 10514, 88858, 1514, 59370, 15012, 14255, 6197, 195977, 186104, 13685, 34162, 182512, 205574, 181668, 55766, 23415, 39018, 62428, 20880, 22013, 16444, 571, 69283, 91245, 214, 3...

[ 0.121826171875, 0.1405029296875, 0.21142578125, 0.2252197265625, 0.038116455078125, 0.1898193359375, 0.0684814453125, 0.1968994140625, 0.1910400390625, 0.1041259765625, 0.121826171875, 0.06842041015625, 0.06591796875, 0.0989990234375, 0.0576171875, 0.0223846435546875, 0.0902709960937...

embed

35143900_c0

35143900

lisp

0

Title: How to correctly pass arguments on Common Lisp? Problem title: How to correctly pass arguments on Common Lisp? Tags: sbcl, common-lisp, lisp Problem: How to correctly pass arguments on Common Lisp? I'm currently reading Practical Common Lisp, and I decided to try and improve its first example ( simple database )...

How to correctly pass arguments on Common Lisp? How to correctly pass arguments on Common Lisp? sbcl common-lisp lisp How Common Lisp TITLE ARTIST RATING RIPPED How to correctly pass arguments on Common Lisp? I'm currently reading Practical Common Lisp, and I decided to try and improve its first example ( simple databa...

[ 0.0081787109375, 0.0341796875, 0.022705078125, -0.009521484375, -0.0130615234375, 0.024169921875, -0.00634765625, 0.00543212890625, 0.003448486328125, 0.006195068359375, 0.006622314453125, 0.00116729736328125, 0.00007772445678710938, -0.0118408203125, 0.0027618408203125, -0.00052261352...

[ 11249, 47, 26785, 538, 27875, 10750, 7, 98, 151301, 1261, 7008, 34937, 39210, 4086, 254, 400, 131514, 15300, 57161, 35602, 19400, 68151, 30976, 17487, 17610, 109613, 52295, 27781, 63399, 41361, 28350, 32354, 1286, 189534, 36849, 18151, 127877, ...

[ 0.0794677734375, 0.03924560546875, 0.169921875, 0.0260009765625, 0.1624755859375, 0.270263671875, 0.08123779296875, 0.0849609375, 0.2003173828125, 0.1651611328125, 0.180908203125, 0.087890625, 0.1085205078125, 0.059906005859375, 0.09967041015625, 0.06024169921875, 0.1256103515625, ...

embed

69731854_c0

69731854

lisp

0

Title: How does `map` behave that matrix multiplication fails in this example? Problem title: How does `map` behave that matrix multiplication fails in this example? Tags: lisp, matrix-multiplication, scheme Problem: How does `map` behave that matrix multiplication fails in this example? I am trying to make a function ...

How does `map` behave that matrix multiplication fails in this example? How does `map` behave that matrix multiplication fails in this example? lisp matrix-multiplication scheme How Map Dot How does `map` behave that matrix multiplication fails in this example? I am trying to make a function that does matrix-vector mul...

[ -0.01080322265625, 0.033447265625, -0.0047607421875, 0.000522613525390625, -0.02099609375, -0.01239013671875, -0.010986328125, 0.014404296875, -0.0084228515625, -0.0166015625, -0.00007486343383789062, 0.006195068359375, -0.0111083984375, 0.00494384765625, -0.041259765625, -0.0162353515...

[ 11249, 62346, 186, 68991, 50944, 127664, 35782, 7, 27781, 425, 400, 7008, 144227, 182867, 150370, 42719, 84929, 14602, 450, 1363, 903, 31577, 32354, 272, 18770, 55681, 50339, 18151, 61924, 7077, 20633, 38742, 6626, 22834, 22230, 30646, 84751, ...

[ 0.07989501953125, 0.2423095703125, 0.054595947265625, 0.1871337890625, 0.1749267578125, 0.184814453125, 0.234619140625, 0.1326904296875, 0.1822509765625, 0.06097412109375, 0.06787109375, 0.1685791015625, 0.0732421875, 0.06640625, 0.171875, 0.2371826171875, 0.2103271484375, 0.022323...

embed

42753900_c0

42753900

lisp

0

Title: Creating 2 files and writing to them different content from another file in Lisp Problem title: Creating 2 files and writing to them different content from another file in Lisp Tags: lisp, common-lisp, file, io Problem: Creating 2 files and writing to them different content from another file in Lisp I am trying ...

Creating 2 files and writing to them different content from another file in Lisp Creating 2 files and writing to them different content from another file in Lisp lisp common-lisp file io another Creating Lisp file_a fr_chars.txt file_B chars_1.txt file_C chars_2.txt HERE CHARS Creating 2 files and writing to them diffe...

[ 0.0101318359375, -0.00119781494140625, -0.01611328125, 0.02392578125, -0.007171630859375, 0.0125732421875, 0.00396728515625, -0.00482177734375, -0.0021820068359375, 0.0208740234375, 0.0045166015625, 0.01025390625, 0.0047607421875, 0.01239013671875, 0.0078125, -0.01519775390625, 0.006...

[ 56781, 116, 102158, 32562, 47, 2856, 12921, 10941, 1295, 15700, 11435, 1261, 7008, 400, 39210, 4086, 254, 22995, 11, 14119, 9254, 124326, 571, 21441, 441, 5442, 25087, 15396, 23, 31577, 33022, 170470, 209, 124519, 111, 1632, 10588, 18151, 2...

[ 0.120361328125, 0.1573486328125, 0.1796875, 0.1741943359375, 0.0975341796875, 0.049896240234375, 0.15478515625, 0.1585693359375, 0.0723876953125, 0.07012939453125, 0.1392822265625, 0.1468505859375, 0.1937255859375, 0.109375, 0.0780029296875, 0.09014892578125, 0.1256103515625, 0.086...

embed

30004801_c0

30004801

lisp

0

Title: Common Lisp - Writing a function that detects circular lists Problem title: Common Lisp - Writing a function that detects circular lists Tags: function, common-lisp, lisp, list, recursion Problem: Common Lisp - Writing a function that detects circular lists I have an assignment for my CS functional languages cla...

Common Lisp - Writing a function that detects circular lists Common Lisp - Writing a function that detects circular lists function common-lisp lisp list recursion Common Lisp Writing list1 list2 Common Lisp - Writing a function that detects circular lists I have an assignment for my CS functional languages class where ...

[ 0.002044677734375, 0.0091552734375, 0.0130615234375, 0.0218505859375, -0.00093841552734375, -0.000278472900390625, 0.0037384033203125, 0.011962890625, 0.003326416015625, -0.0084228515625, -0.00933837890625, 0.00494384765625, 0.00537109375, 0.0029144287109375, 0.01129150390625, 0.020263...

[ 151301, 1261, 7008, 213185, 32354, 96391, 115339, 5303, 39210, 4086, 254, 400, 195625, 304, 95486, 25841, 123309, 46876, 18507, 33022, 36766, 34475, 6863, 86595, 5844, 3714, 3642, 12765, 100, 2481, 7225, 34627, 158, 12008, 5701, 29823, 68034, ...

[ 0.163818359375, 0.149658203125, 0.1488037109375, 0.147705078125, 0.1845703125, 0.192626953125, 0.253173828125, 0.2083740234375, 0.1170654296875, 0.0927734375, 0.0931396484375, 0.08209228515625, 0.2027587890625, 0.1195068359375, 0.092529296875, 0.04998779296875, 0.0826416015625, 0.0...

embed

77516492_c0

77516492

lisp

0

Title: Calling a lambda function in a loop from a variable defined with `with` Problem title: Calling a lambda function in a loop from a variable defined with `with` Tags: lisp, common-lisp Problem: Calling a lambda function in a loop from a variable defined with `with` I have the following lisp code (defun sum (vec) "...

Calling a lambda function in a loop from a variable defined with `with` Calling a lambda function in a loop from a variable defined with `with` lisp common-lisp a Calling Summiert Elemente Vektors Hilfsfunktion Quadrieren Elements Berechnet Varianz some_func some_vector COMMON-LISP-USER::SOME_FUNC Condition UNDEFINED-F...

[ 0.01422119140625, 0.007568359375, -0.0146484375, -0.01318359375, -0.00109100341796875, -0.01287841796875, 0.00994873046875, 0.0034637451171875, 0.01483154296875, -0.0361328125, -0.000942230224609375, 0.000946044921875, -0.00506591796875, -0.00909423828125, 0.0225830078125, 0.0068969726...

[ 26265, 21, 6492, 85, 32354, 23, 40956, 1295, 77336, 61924, 678, 76228, 400, 7008, 39210, 4086, 254, 214, 36335, 39, 6280, 48325, 310, 50399, 199221, 64558, 83227, 4921, 206, 111477, 33957, 16498, 272, 18770, 82707, 67616, 683, 1062, 50184, ...

[ 0.1337890625, 0.06231689453125, 0.1983642578125, 0.1656494140625, 0.173828125, 0.026336669921875, 0.1915283203125, 0.06640625, 0.2166748046875, 0.1514892578125, 0.08563232421875, 0.22802734375, 0.088134765625, 0.1634521484375, 0.0770263671875, 0.06640625, 0.1435546875, 0.0285186767...

embed

31992317_c0

31992317

lisp

0

Title: Apparent 'eval' of quote symbol in CLISP Problem title: Apparent 'eval' of quote symbol in CLISP Tags: clisp, common-lisp, lisp Problem: Apparent 'eval' of quote symbol in CLISP Some output from the CLISP REPL: [1]> (list 'list 1 2 3) (LIST 1 2 3) [2]> (list 'list '(1 2 3)) (LIST (1 2 3)) [3]...

Apparent 'eval' of quote symbol in CLISP Apparent 'eval' of quote symbol in CLISP clisp common-lisp lisp Apparent CLISP LIST QUOTE Apparent 'eval' of quote symbol in CLISP Some output from the CLISP REPL: The first three, I understand exactly what's going on: The list function is passed a symbol ( '...

[ 0.01153564453125, 0.0201416015625, 0.011962890625, 0.0003509521484375, -0.015380859375, 0.00408935546875, 0.020751953125, -0.013916015625, 0.01385498046875, 0.0155029296875, -0.0126953125, -0.000904083251953125, 0.009765625, 0.01239013671875, -0.0301513671875, 0.02490234375, -0.00023...

[ 99547, 3768, 1405, 66747, 26582, 313, 67616, 683, 95701, 7008, 39210, 4086, 254, 400, 195977, 232856, 111, 23, 140992, 9069, 21130, 17262, 28219, 5303, 32354, 115081, 6562, 68726, 16750, 9842, 678, 22759, 927, 55681, 5908, 44084, 22027, 18, ...

[ 0.1724853515625, 0.055938720703125, 0.2037353515625, 0.266845703125, 0.2310791015625, 0.050506591796875, 0.15576171875, 0.1983642578125, 0.1107177734375, 0.17529296875, 0.06182861328125, 0.0811767578125, 0.139892578125, 0.048126220703125, 0.1942138671875, 0.276123046875, 0.0152893066...

embed

17312128_c0

17312128

lisp

0

Title: Using scheme/racket to return specific items from a list Problem title: Using scheme/racket to return specific items from a list Tags: lisp, scheme, racket Problem: Using scheme/racket to return specific items from a list What I would like to do is create a function that takes in a list of values and a list of c...

Using scheme/racket to return specific items from a list Using scheme/racket to return specific items from a list lisp scheme racket a Using Problem Done Using scheme/racket to return specific items from a list What I would like to do is create a function that takes in a list of values and a list of characters and coal...

[ -0.0189208984375, 0.0159912109375, 0.00148773193359375, 0.0245361328125, -0.0019683837890625, 0.0142822265625, -0.017822265625, -0.0030059814453125, -0.007415771484375, 0.0040283203125, 0.01007080078125, -0.0272216796875, -0.00677490234375, 0.003692626953125, -0.01348876953125, 0.00338...

[ 345, 6953, 150370, 64, 219, 27853, 30646, 29458, 55769, 1295, 5303, 47, 400, 7008, 673, 15649, 984, 1884, 54, 28282, 32354, 51776, 23, 111, 142424, 136, 124850, 5798, 1577, 329, 70, 42518, 214, 257, 28016, 58, 5351, 2806, 121392, 538, 3...

[ 0.115966796875, 0.0301513671875, 0.2484130859375, 0.030609130859375, 0.1170654296875, 0.242431640625, 0.2227783203125, 0.1744384765625, 0.194580078125, 0.129150390625, 0.20751953125, 0.009979248046875, 0.093017578125, 0.1954345703125, 0.1163330078125, 0.1668701171875, 0.0376892089843...

embed

51845973_c1

51845973

lisp

1

"blablabla" :type string) (z 1.8d0 :type double-float)) quickly hash the structure slots information using ( etypecase , subtypep ). EDIT: I want to hash lisp-structure TYPE SLOTS "string sint8 float array" to read the data correctly when received/sent. If I have a struct. st: (typecase st (structure-object (recursive...

[ -0.0147705078125, 0.01092529296875, -0.00775146484375, -0.0047607421875, -0.006744384765625, 0.01385498046875, 0.00958251953125, -0.005218505859375, -0.00787353515625, 0.005584716796875, -0.01129150390625, -0.018798828125, 0.0098876953125, -0.01043701171875, 0.007537841796875, 0.005584...

[ 7119, 50986, 79315, 169, 79875, 2389, 41929, 52347, 257, 69405, 1556, 127, 45646, 121892, 4677, 17368, 28, 58437, 1614, 254, 3444, 400, 7008, 137656, 95267, 21907, 115447, 91693, 19638, 1019, 21917, 10298, 53, 12301, 2053, 26785, 75204, 12832...

[ 0.1865234375, 0.23046875, 0.1981201171875, 0.07293701171875, 0.1175537109375, 0.055908203125, 0.0361328125, 0.117919921875, 0.03790283203125, 0.140869140625, 0.169189453125, 0.17041015625, 0.25634765625, 0.2177734375, 0.1243896484375, 0.04168701171875, 0.02557373046875, 0.209960937...

embed

74578667_c0

74578667

lisp

0

Title: Is there a pattern for LOOP-like macro mini-languages? Problem title: Is there a pattern for LOOP-like macro mini-languages? Tags: common-lisp, lisp-macros, lisp, syntax-error Problem: Is there a pattern for LOOP-like macro mini-languages? I am attempting to answer the following exercise. Write a macro function ...

Is there a pattern for LOOP-like macro mini-languages? Is there a pattern for LOOP-like macro mini-languages? common-lisp lisp-macros lisp syntax-error LOOP-like Is there a pattern for LOOP-like macro mini-languages? I am attempting to answer the following exercise. My solution is the following: That works fine, but I'...

[ 0.01068115234375, 0.01361083984375, -0.00445556640625, 0.0103759765625, 0.0028839111328125, 0.00640869140625, 0.0196533203125, 0.0031890869140625, 0.0167236328125, -0.004364013671875, -0.00897216796875, -0.009033203125, -0.01806640625, -0.01214599609375, 0.0260009765625, 0.01611328125,...

[ 2071, 2685, 10, 103510, 100, 22215, 20880, 5062, 111789, 7665, 196651, 7, 39210, 4086, 254, 400, 7008, 35572, 3666, 6002, 86531, 188800, 81887, 35166, 81979, 29806, 43240, 5885, 112668, 214521, 110, 175199, 92733, 5557, 10750, 5809, 23937, 26...

[ 0.0151824951171875, 0.0582275390625, 0.0853271484375, 0.2471923828125, 0.05010986328125, 0.158935546875, 0.2388916015625, 0.2120361328125, 0.2257080078125, 0.21435546875, 0.19384765625, 0.04876708984375, 0.07550048828125, 0.0552978515625, 0.1337890625, 0.0701904296875, 0.138427734375...

embed

18966899_c0

18966899

lisp

0

Title: how to wrap forms with an already written outer form in paredit Problem title: how to wrap forms with an already written outer form in paredit Tags: paredit, emacs, lisp Problem: how to wrap forms with an already written outer form in paredit Suppose I have this code (hello world) (hi world) Then it comes to my ...

how to wrap forms with an already written outer form in paredit how to wrap forms with an already written outer form in paredit paredit emacs lisp how to wrap forms with an already written outer form in paredit Suppose I have this code Then it comes to my mind that I should wrap that with the following form: resulting ...

[ 0.0030059814453125, 0.038818359375, -0.0264892578125, 0.0026702880859375, -0.0084228515625, 0.0289306640625, 0.0033416748046875, 0.007080078125, 0.00689697265625, -0.038818359375, 0.00335693359375, 0.02294921875, -0.010009765625, 0.00167083740234375, 0.02783203125, -0.0184326171875, ...

[ 3642, 47, 137565, 3173, 7, 678, 142, 21771, 59121, 1810, 56, 23, 366, 45082, 352, 2263, 400, 7008, 18151, 56104, 54, 10366, 33022, 82940, 46485, 8108, 5429, 11, 48398, 24234, 313, 9, 19364, 10681, 83613, 186351, 8966, 67229, 154107, 37676...

[ 0.06158447265625, 0.0174407958984375, 0.2430419921875, 0.2474365234375, 0.07037353515625, 0.150634765625, 0.043121337890625, 0.1912841796875, 0.18359375, 0.17626953125, 0.171142578125, 0.013671875, 0.1187744140625, 0.2130126953125, 0.002777099609375, 0.0294952392578125, 0.00268554687...

embed

3793083_c0

3793083

lisp

0

Title: Scheme Code Analysis for Space vs. Time Problem title: Scheme Code Analysis for Space vs. Time Tags: scheme, lisp, complexity-theory, code-analysis Problem: Scheme Code Analysis for Space vs. Time I'm working my way through the online MIT lectures for the classic 6.001 course: The Structure and Interpretation of...

Scheme Code Analysis for Space vs. Time Scheme Code Analysis for Space vs. Time scheme lisp complexity-theory code-analysis Scheme Analysis Space Time i-2 i-1 Scheme Code Analysis for Space vs. Time I'm working my way through the online MIT lectures for the classic 6.001 course: The Structure and Interpretation of Comp...

[ 0.004913330078125, 0.02783203125, -0.00128936767578125, 0.00177764892578125, -0.00555419921875, -0.01092529296875, -0.0086669921875, -0.022216796875, 0.00482177734375, -0.024169921875, 0.014404296875, -0.0191650390625, -0.0091552734375, -0.00897216796875, -0.0015716552734375, 0.0067749...

[ 34702, 282, 28864, 114837, 100, 43045, 20209, 19055, 164, 150370, 400, 7008, 27140, 2481, 2347, 18151, 174976, 17, 5428, 5759, 20697, 70, 1118, 78999, 59619, 7, 54704, 2289, 34479, 15411, 63667, 238, 6644, 159838, 1363, 111, 40139, 7663, 25...

[ 0.20947265625, 0.1689453125, 0.2264404296875, 0.1744384765625, 0.0584716796875, 0.2208251953125, 0.140869140625, 0.181640625, 0.05218505859375, 0.2108154296875, 0.02777099609375, 0.124267578125, 0.1705322265625, 0.05169677734375, 0.011199951171875, 0.2191162109375, 0.1400146484375, ...

embed

79484725_c1

79484725

lisp

1

"LWPOLYLINE") (length (vl-remove-if-not '(lambda (x) (= (car x) 10)) ent))) ((= (cdr (assoc 0 ent)) "POLYLINE") (let ((count 0) (vertex (entnext ent))) (while (and vertex (= (cdr (assoc 0 (entget vertex))) "VERTEX")) (setq count (1+ count)) (setq vertex (entnext vertex))) count)) (t 0))) ;; Function to sort vertices i...

[ 0.006561279296875, 0.0174560546875, 0.00135040283203125, -0.003814697265625, -0.0146484375, 0.00421142578125, 0.0228271484375, -0.004150390625, 0.0035858154296875, -0.00628662109375, -0.0123291015625, -0.00872802734375, 0.005401611328125, -0.020751953125, -0.012451171875, 0.01135253906...

[ 866, 1456, 9698, 19917, 57339, 23986, 927, 50132, 26973, 272, 3190, 10869, 6492, 85, 425, 3284, 1022, 209, 18, 32149, 7569, 73395, 757, 44, 1974, 71013, 814, 24371, 2517, 29062, 204610, 493, 3794, 33255, 122691, 3509, 864, 54529, 1328, 86...

[ 0.031036376953125, 0.139404296875, 0.1376953125, 0.197265625, 0.30126953125, 0.0765380859375, 0.047821044921875, 0.1392822265625, 0.083740234375, 0.076171875, 0.0289154052734375, 0.0176544189453125, 0.1527099609375, 0.0732421875, 0.049713134765625, 0.1748046875, 0.055145263671875, ...

embed

26979529_c0

26979529

lisp

0

Title: Writing output to file. LISP Problem title: Writing output to file. LISP Tags: common-lisp, file-io, lisp, stream Problem: Writing output to file. LISP I've written a LISP-program, it writes some output data to the CommonLisp console via princ and write-line operators. How to redo it to it writes output data to ...

Writing output to file. LISP Writing output to file. LISP common-lisp file-io lisp stream Writing LISP koeff1 koeff2 line1 divisionByZeroKoef1 divisionByZeroKoef2 koeffHyp1 koeffHyp2 Writing output to file. LISP I've written a LISP-program, it writes some output data to the CommonLisp console via princ and write-line o...

[ 0.00408935546875, -0.004119873046875, 0.007110595703125, -0.0120849609375, -0.01239013671875, 0.00970458984375, 0.0020751953125, -0.00634765625, -0.00109100341796875, 0.023193359375, 0.0125732421875, -0.006622314453125, 0.0208740234375, -0.03125, 0.000293731689453125, 0.0230712890625, ...

[ 213185, 140992, 47, 11435, 16970, 9434, 39210, 4086, 254, 846, 400, 7008, 75973, 298, 68053, 418, 304, 13315, 91853, 1511, 4036, 4240, 60977, 59121, 18749, 33022, 2053, 151301, 9506, 130250, 1829, 2448, 238, 2256, 39933, 11249, 41313, 1528, ...

[ 0.202392578125, 0.2646484375, 0.175048828125, 0.2061767578125, 0.14599609375, 0.255126953125, 0.12060546875, 0.0926513671875, 0.162109375, 0.1461181640625, 0.1214599609375, 0.2122802734375, 0.158935546875, 0.02459716796875, 0.1519775390625, 0.009765625, 0.0625, 0.140869140625, 0....

embed

57300332_c0

57300332

lisp

0

Title: Why does counting up in recursive functions always require two parameters? Problem title: Why does counting up in recursive functions always require two parameters? Tags: scheme, recursion, lisp Problem: Why does counting up in recursive functions always require two parameters? I've written some simple loops wit...

Why does counting up in recursive functions always require two parameters? Why does counting up in recursive functions always require two parameters? scheme recursion lisp two 1 Why Why does counting up in recursive functions always require two parameters? I've written some simple loops with recursion and the loop macr...

[ -0.0029449462890625, 0.01336669921875, 0.007568359375, -0.00168609619140625, 0.009765625, 0.009765625, -0.000934600830078125, -0.01458740234375, 0.0181884765625, -0.02685546875, 0.00811767578125, -0.033447265625, 0.0098876953125, 0.019775390625, 0.01953125, -0.030029296875, -0.012939...

[ 44084, 54529, 214, 1257, 23, 195625, 5844, 32354, 11343, 64209, 6626, 171859, 7, 150370, 1830, 400, 7008, 14602, 8781, 40956, 111789, 15044, 1314, 27117, 7565, 27781, 28412, 158661, 35662, 5084, 21493, 43852, 42, 71013, 2037, 54241, 21286, 67...

[ 0.123046875, 0.182861328125, 0.0458984375, 0.1844482421875, 0.0198822021484375, 0.20654296875, 0.13232421875, 0.174072265625, 0.1243896484375, 0.1531982421875, 0.1929931640625, 0.2269287109375, 0.033935546875, 0.11376953125, 0.028961181640625, 0.01806640625, 0.08447265625, 0.015914...

embed

6098087_c0

6098087

lisp

0

Title: Simple Lisp Case statement question - problem comparing to nil Problem title: Simple Lisp Case statement question - problem comparing to nil Tags: functional-programming, case-statement, lisp Problem: Simple Lisp Case statement question - problem comparing to nil I'm trying to use a case statement to make some c...

Simple Lisp Case statement question - problem comparing to nil Simple Lisp Case statement question - problem comparing to nil functional-programming case-statement lisp Simple Lisp Case NIL Simple Lisp Case statement question - problem comparing to nil I'm trying to use a case statement to make some code more readable....

[ 0.0096435546875, 0.006378173828125, 0.00811767578125, -0.00167083740234375, -0.00015735626220703125, -0.00823974609375, 0.041015625, -0.015869140625, -0.005859375, 0.01080322265625, 0.00144195556640625, 0.0194091796875, -0.006378173828125, -0.01123046875, -0.0036773681640625, 0.0043945...

[ 60552, 1261, 7008, 43731, 63805, 9655, 2967, 37397, 214, 47, 17324, 123309, 28966, 7225, 61340, 400, 541, 16444, 31577, 18151, 1286, 12301, 2886, 4488, 237, 36549, 2174, 11343, 26946, 225490, 3853, 959, 29568, 17306, 15400, 123166, 74918, 277...

[ 0.1588134765625, 0.1575927734375, 0.195556640625, 0.218017578125, 0.2271728515625, 0.1427001953125, 0.176025390625, 0.212890625, 0.0304412841796875, 0.0859375, 0.2144775390625, 0.129638671875, 0.1014404296875, 0.2108154296875, 0.1600341796875, 0.10467529296875, 0.06903076171875, 0....

embed

40565458_c0

40565458

lisp

0

Title: Test if all elements of a list are different from each other Problem title: Test if all elements of a list are different from each other Tags: common-lisp, lisp Problem: Test if all elements of a list are different from each other I have a list of lists and want to test if all elements are different from each ot...

Test if all elements of a list are different from each other Test if all elements of a list are different from each other common-lisp lisp each 1 Test Test if all elements of a list are different from each other I have a list of lists and want to test if all elements are different from each other, i.e. equal should ret...

[ -0.0145263671875, -0.003997802734375, 0.006866455078125, -0.00897216796875, -0.01055908203125, -0.010986328125, 0.0269775390625, 0.00469970703125, -0.00174713134765625, 0.0072021484375, -0.0179443359375, 0.02587890625, 0.0234375, 0.012939453125, -0.016357421875, 0.02197265625, 0.0105...

[ 8647, 2174, 756, 80854, 111, 5303, 621, 12921, 1295, 12638, 3789, 39210, 4086, 254, 400, 7008, 106, 3444, 47, 3034, 105950, 5608, 30646, 17324, 162515, 17569, 34390, 109921, 161789, 208244, 40956, 64549, 5570, 1957, 3095, 195625, 32354, 28271...

[ 0.2012939453125, 0.11376953125, 0.1510009765625, 0.1910400390625, 0.0128173828125, 0.2110595703125, 0.075439453125, 0.225341796875, 0.1416015625, 0.10113525390625, 0.144287109375, 0.08306884765625, 0.050933837890625, 0.09234619140625, 0.046844482421875, 0.12548828125, 0.0352783203125...

embed

2060744_c0

2060744

lisp

0

Title: What are the benefits of letrec? Problem title: What are the benefits of letrec? Tags: functional-programming, letrec, lisp, racket, scheme Problem: What are the benefits of letrec? While reading "The Seasoned Schemer" I've begun to learn about letrec . I understand what it does (can be duplicated with a Y-Combi...

What are the benefits of letrec? What are the benefits of letrec? functional-programming letrec lisp racket scheme What What are the benefits of letrec? While reading "The Seasoned Schemer" I've begun to learn about letrec . I understand what it does (can be duplicated with a Y-Combinator) but the book is using it in l...

[ -0.01190185546875, 0.00799560546875, 0.02490234375, 0.02490234375, 0.01385498046875, -0.00927734375, -0.018310546875, -0.007720947265625, -0.0018157958984375, -0.007781982421875, -0.0169677734375, -0.0185546875, -0.0101318359375, -0.01068115234375, 0.003997802734375, -0.002593994140625...

[ 4865, 621, 70, 72382, 111, 2633, 31688, 123309, 28966, 400, 7008, 673, 27853, 150370, 16454, 3957, 85135, 297, 34702, 1991, 30698, 28219, 4398, 171763, 678, 990, 10770, 19155, 1290, 12877, 17368, 23414, 456, 64240, 21771, 61924, 104, 32354, ...

[ 0.0173492431640625, 0.0277252197265625, 0.047943115234375, 0.2020263671875, 0.09039306640625, 0.1700439453125, 0.2958984375, 0.1312255859375, 0.121337890625, 0.0693359375, 0.123291015625, 0.031646728515625, 0.1591796875, 0.142333984375, 0.05560302734375, 0.05084228515625, 0.193237304...

embed

21863997_c0

21863997

lisp

0

Title: Macro that generates macro form wrapped in let bound variables Problem title: Macro that generates macro form wrapped in let bound variables Tags: lisp, common-lisp, macros, quote Problem: Macro that generates macro form wrapped in let bound variables I've been trying to write a macro that generates, among other...

Macro that generates macro form wrapped in let bound variables Macro that generates macro form wrapped in let bound variables lisp common-lisp macros quote Macro Expands Macro that generates macro form wrapped in let bound variables I've been trying to write a macro that generates, among other things, a compiler macro ...

[ -0.004638671875, 0.020751953125, -0.0098876953125, -0.0021514892578125, 0.007415771484375, 0.01324462890625, 0.01495361328125, -0.0098876953125, -0.002197265625, -0.03759765625, -0.017333984375, 0.006072998046875, 0.0025634765625, 0.010009765625, 0.0164794921875, -0.018310546875, -0....

[ 4727, 516, 139392, 111789, 3173, 137565, 20051, 2633, 99091, 77336, 400, 7008, 39210, 4086, 254, 66747, 60075, 2940, 23, 31577, 33022, 9969, 34759, 5701, 9351, 20187, 18151, 179933, 3444, 1884, 903, 26366, 128239, 7, 11, 275, 31089, 10941, ...

[ 0.10455322265625, 0.1578369140625, 0.2032470703125, 0.222900390625, 0.2027587890625, 0.130126953125, 0.022216796875, 0.23388671875, 0.175537109375, 0.1846923828125, 0.05316162109375, 0.14306640625, 0.06158447265625, 0.00457763671875, 0.10565185546875, 0.16796875, 0.0467529296875, 0...

embed

10467111_c1

10467111

lisp

1

ING PROD ELEMENTS ;;; FINDING ACCESSIBLE ELEMENTS (defun ACCESS-STEP (P ACC) ;;(format t "Pacc = ~S~%" P) ;;(format t "ACC = ~S~%" ACC) (if (null P) ACC (if (member (first (first P)) ACC) (ACCESS-STEP (rest P) (union (rest (first P)) ACC)) (ACCESS-STEP (rest P) ACC)))) (defun ACCESS-AUX (P ACC oldLength) (if (= (length...

[ -0.01263427734375, 0.0208740234375, 0.0034027099609375, 0.029296875, -0.0019378662109375, 0.0045166015625, -0.017333984375, 0.002685546875, 0.015869140625, -0.00897216796875, 0.0069580078125, 0.01275634765625, 0.00689697265625, -0.02880859375, -0.000579833984375, 0.0181884765625, 0.0...

[ 77009, 10514, 397, 9780, 124661, 294, 157724, 67227, 156906, 12944, 194695, 568, 125149, 112, 16498, 9, 43865, 683, 62, 13709, 51727, 808, 8335, 10060, 6780, 3949, 436, 3190, 139550, 27417, 13448, 56644, 15, 87046, 80126, 71609, 10332, 449, ...

[ 0.24267578125, 0.20361328125, 0.1734619140625, 0.155029296875, 0.1802978515625, 0.1361083984375, 0.10595703125, 0.16259765625, 0.125, 0.172607421875, 0.25048828125, 0.15478515625, 0.1654052734375, 0.0810546875, 0.1273193359375, 0.0228424072265625, 0.173583984375, 0.09051513671875, ...

embed

4682576_c0

4682576

lisp

0

Title: Find the most nested list inside a list in Common Lisp Problem title: Find the most nested list inside a list in Common Lisp Tags: nested-lists, common-lisp, lisp Problem: Find the most nested list inside a list in Common Lisp I'm new to Common Lisp and functional programming, but I have a lot of experience in l...

Find the most nested list inside a list in Common Lisp Find the most nested list inside a list in Common Lisp nested-lists common-lisp lisp Find Common Lisp Find the most nested list inside a list in Common Lisp I'm new to Common Lisp and functional programming, but I have a lot of experience in languages like C, C++, ...

[ -0.00811767578125, 0.0177001953125, 0.000904083251953125, 0.0020599365234375, 0.00604248046875, 0.03759765625, -0.003509521484375, -0.007171630859375, -0.00250244140625, -0.03564453125, -0.0084228515625, -0.015625, -0.0019378662109375, 0.019287109375, 0.008544921875, 0.01068115234375, ...

[ 26040, 70, 2684, 8512, 71, 5303, 46132, 151301, 1261, 7008, 6562, 39210, 4086, 254, 400, 23, 123309, 56037, 16981, 46876, 37223, 4904, 41925, 63134, 90791, 107730, 2046, 6528, 49878, 510, 4734, 1632, 1614, 25737, 58755, 98441, 50478, 17366, ...

[ 0.124755859375, 0.04632568359375, 0.2030029296875, 0.25390625, 0.15576171875, 0.247802734375, 0.181884765625, 0.1851806640625, 0.158447265625, 0.15185546875, 0.160400390625, 0.09661865234375, 0.06805419921875, 0.080810546875, 0.06781005859375, 0.016693115234375, 0.09429931640625, 0...

embed

66244872_c0

66244872

lisp

0

Title: GISC exercise 11.22d: Why is this stateful? Problem title: GISC exercise 11.22d: Why is this stateful? Tags: common-lisp, lisp Problem: GISC exercise 11.22d: Why is this stateful? Exercise 11.22d of David Touretzky's "A Gentle Introduction to Symbolic Computation" states: "[...] Write a function COUNT-BASES that...

GISC exercise 11.22d: Why is this stateful? GISC exercise 11.22d: Why is this stateful? common-lisp lisp GISC Why COUNT-BASES STRAND GISC exercise 11.22d: Why is this stateful? Exercise 11.22d of David Touretzky's "A Gentle Introduction to Symbolic Computation" states: "[...] Write a function COUNT-BASES that counts th...

[ 0.00151824951171875, 0.004608154296875, 0.0084228515625, 0.0048828125, 0.0179443359375, 0.019775390625, 0.01025390625, -0.01251220703125, 0.01397705078125, -0.025146484375, -0.0096435546875, 0.0050048828125, 0.00007867813110351562, 0.033447265625, 0.00592041015625, 0.0098876953125, 0...

[ 42887, 14495, 81979, 4541, 4015, 71, 44084, 83, 903, 11341, 7844, 39210, 4086, 254, 400, 7008, 8244, 64163, 9, 8031, 65596, 46549, 45029, 155534, 6765, 11330, 41873, 44704, 44891, 131899, 159415, 32354, 54529, 14012, 51039, 12638, 10644, 23, ...

[ 0.138427734375, 0.1358642578125, 0.183837890625, 0.115234375, 0.1380615234375, 0.1141357421875, 0.1380615234375, 0.0435791015625, 0.06768798828125, 0.1634521484375, 0.193359375, 0.0892333984375, 0.03948974609375, 0.10888671875, 0.04937744140625, 0.11083984375, 0.096435546875, 0.165...

embed

1484335_c0

1484335

lisp

0

Title: In common-lisp, how do I modify part of a list parameter from within a function without changing the original list? Problem title: In common-lisp, how do I modify part of a list parameter from within a function without changing the original list? Tags: common-lisp, lisp, function, parameter-passing, pass-by-refe...

In common-lisp, how do I modify part of a list parameter from within a function without changing the original list? In common-lisp, how do I modify part of a list parameter from within a function without changing the original list? common-lisp lisp function parameter-passing pass-by-reference within In common-lisp, how...

[ -0.005645751953125, 0.02978515625, 0.0029754638671875, -0.002166748046875, -0.0184326171875, -0.011962890625, -0.00787353515625, -0.004425048828125, 0.002655029296875, 0.01129150390625, 0.003204345703125, 0.01446533203125, 0.0020599365234375, 0.009765625, 0.0264892578125, 0.00183868408...

[ 39210, 4086, 254, 3642, 2811, 40383, 2831, 5303, 171859, 1295, 28032, 32354, 15490, 151134, 7311, 400, 7008, 13409, 27875, 1272, 239879, 54, 31577, 47, 1261, 15549, 10941, 52490, 83, 27494, 29568, 28219, 18151, 43240, 84751, 11782, 6954, 2841...

[ 0.1458740234375, 0.1331787109375, 0.16845703125, 0.03912353515625, 0.1572265625, 0.148681640625, 0.10107421875, 0.188232421875, 0.1898193359375, 0.07672119140625, 0.1356201171875, 0.185546875, 0.089599609375, 0.0989990234375, 0.031829833984375, 0.1158447265625, 0.2276611328125, 0.0...

embed

15853642_c0

15853642

lisp

0

Title: C++ How do I bring this lisp function to compilable code? Problem title: C++ How do I bring this lisp function to compilable code? Tags: lisp, c%2B%2B Problem: C++ How do I bring this lisp function to compilable code? I have a huge lisp function that I want to use in my c++ application. This function was generat...

C++ How do I bring this lisp function to compilable code? C++ How do I bring this lisp function to compilable code? lisp c%2B%2B How prev_is_pause prev_prev_gender houses_from_month_start customer_numsegs customers_from_company_start prev_jobtype next_hairtype called_houses_from_month_end next_next_single month_numhous...

[ 0.01416015625, 0.00469970703125, -0.001373291015625, 0.005340576171875, 0.0001544952392578125, 0.0296630859375, -0.0096435546875, -0.01068115234375, -0.0035552978515625, -0.05615234375, -0.009033203125, -0.004180908203125, 0.0045166015625, -0.013427734375, 0.01806640625, 0.004302978515...

[ 313, 37223, 11249, 19095, 903, 400, 7008, 32354, 47, 98352, 2661, 18151, 501, 28468, 164, 149302, 4692, 334, 23200, 18276, 161063, 15477, 17137, 43373, 2606, 25398, 59463, 146365, 36791, 50986, 11737, 75512, 35839, 23923, 3611, 29062, 6953, 3...

[ 0.045928955078125, 0.2626953125, 0.0535888671875, 0.129638671875, 0.036895751953125, 0.18359375, 0.239013671875, 0.186279296875, 0.036651611328125, 0.2115478515625, 0.1282958984375, 0.1676025390625, 0.036407470703125, 0.2435302734375, 0.10748291015625, 0.2484130859375, 0.074829101562...

embed

30293205_c0

30293205

lisp

0

Title: lisp remove a the content of one list from another list Problem title: lisp remove a the content of one list from another list Tags: common-lisp, lisp Problem: lisp remove a the content of one list from another list I have a list of string like this called F: ("hello word i'am walid" "goodbye madame") => this li...

lisp remove a the content of one list from another list lisp remove a the content of one list from another list common-lisp lisp another start1 end1 start2 end2 lisp remove a the content of one list from another list I have a list of string like this called F: ("hello word i'am walid" "goodbye madame") => this list con...

[ -0.004913330078125, 0.01031494140625, -0.0174560546875, 0.022216796875, -0.031005859375, -0.001495361328125, 0.0247802734375, 0.005401611328125, 0.004058837890625, 0.0152587890625, 0.024169921875, -0.00040435791015625, -0.00054931640625, 0.007476806640625, -0.002166748046875, -0.000009...

[ 400, 7008, 87388, 10, 10941, 111, 1632, 5303, 1295, 15700, 39210, 4086, 254, 4034, 3564, 765, 79315, 1884, 563, 127, 13817, 2565, 17, 302, 13019, 71, 1272, 13, 25248, 282, 70541, 6626, 80854, 11782, 159, 903, 47416, 15695, 34153, 3444, ...

[ 0.156494140625, 0.2117919921875, 0.1995849609375, 0.040802001953125, 0.2193603515625, 0.0738525390625, 0.0806884765625, 0.2176513671875, 0.1243896484375, 0.0928955078125, 0.1007080078125, 0.1143798828125, 0.1689453125, 0.065673828125, 0.052978515625, 0.00347900390625, 0.1827392578125...

embed

51592401_c0

51592401

lisp

0

Title: Scheme/Racket: A function which separates a list into two lists of elements that match a certain predicate and those that don't match it Problem title: Scheme/Racket: A function which separates a list into two lists of elements that match a certain predicate and those that don't match it Tags: scheme, ...

Scheme/Racket: A function which separates a list into two lists of elements that match a certain predicate and those that don't match it Scheme/Racket: A function which separates a list into two lists of elements that match a certain predicate and those that don't match it scheme racket predicate list lisp Sc...

[ 0.007537841796875, 0.0277099609375, -0.00064849853515625, -0.01312255859375, -0.026611328125, 0.03515625, 0.0037384033203125, -0.0006561279296875, -0.0166015625, -0.018798828125, 0.00958251953125, -0.01092529296875, -0.0037994384765625, -0.01806640625, 0.000591278076171875, -0.00076293...

[ 34702, 282, 64, 12248, 27853, 12, 62, 32354, 3129, 84797, 7, 5303, 3934, 6626, 80854, 14858, 24233, 1653, 2063, 8382, 2301, 3768, 18, 136, 450, 150370, 673, 400, 7008, 2552, 1647, 55742, 133, 617, 123573, 32599, 28282, 23, 51776, 140992, ...

[ 0.241455078125, 0.2012939453125, 0.10662841796875, 0.1717529296875, 0.279296875, 0.021270751953125, 0.006622314453125, 0.2186279296875, 0.02740478515625, 0.2166748046875, 0.0802001953125, 0.222900390625, 0.1358642578125, 0.131591796875, 0.1656494140625, 0.21533203125, 0.0356140136718...

embed

23419350_c0

23419350

lisp

0

Title: Unicode error being thrown when trying to make rosserial module Problem title: Unicode error being thrown when trying to make rosserial module Tags: ros, unicode, python, lisp Problem: Unicode error being thrown when trying to make rosserial module ERROR: Unable to generate services for package 'rosserial_msgs':...

Unicode error being thrown when trying to make rosserial module Unicode error being thrown when trying to make rosserial module ros unicode python lisp RuntimeError SyntaxError TypeError rosserial_msgs/TopicInfo.msg genmsg.template_tools rosserial_msgs/Log.msg Unicode Generating Lisp rosserial_msgs TopicInfo.msg Traceb...

[ 0.014404296875, 0.006866455078125, -0.007354736328125, -0.01141357421875, -0.00775146484375, 0.005859375, 0.0140380859375, -0.00616455078125, -0.0137939453125, 0.000621795654296875, -0.01470947265625, -0.0595703125, 0.0164794921875, -0.0069580078125, -0.01611328125, -0.0118408203125, ...

[ 219778, 18499, 8035, 104250, 31577, 3249, 19429, 184, 51626, 88996, 60347, 112, 17198, 50828, 400, 7008, 28398, 6032, 18468, 19010, 60457, 4432, 9405, 77888, 93147, 9226, 177, 2982, 92558, 89110, 113972, 155370, 1261, 134912, 4937, 12620, 42724...

[ 0.2435302734375, 0.2122802734375, 0.0236968994140625, 0.1571044921875, 0.0750732421875, 0.06365966796875, 0.2271728515625, 0.104248046875, 0.1971435546875, 0.1617431640625, 0.1917724609375, 0.109130859375, 0.05841064453125, 0.0950927734375, 0.07855224609375, 0.1396484375, 0.031005859...

embed

67021976_c0

67021976

lisp

0

Title: How to check if two types are the same in Common Lisp? Problem title: How to check if two types are the same in Common Lisp? Tags: lisp, common-lisp Problem: How to check if two types are the same in Common Lisp? I'm learning Common Lisp and is now trying to replicate C++'s (boost's) lexical_cast<bool>(string) ....

How to check if two types are the same in Common Lisp? How to check if two types are the same in Common Lisp? lisp common-lisp How Common Lisp lexical_cast ret_type std::string std::is_same_v Otherwise DEFUN BOOLEAN WARNING ANSI Undefined How to check if two types are the same in Common Lisp? I'm learning Common Lisp a...

[ 0.000637054443359375, 0.00408935546875, 0.00872802734375, 0.01031494140625, -0.00897216796875, 0.0001220703125, -0.0037994384765625, 0.00567626953125, -0.01416015625, 0.00014400482177734375, 0.00177764892578125, -0.0006866455078125, -0.00110626220703125, -0.00848388671875, 0.000310897827...

[ 11249, 47, 12765, 2174, 6626, 52895, 621, 5701, 23, 151301, 1261, 7008, 400, 39210, 4086, 254, 75675, 21533, 55741, 10267, 50986, 6138, 71, 91693, 164, 40175, 334, 202001, 14006, 137142, 105621, 60873, 9902, 5983, 52080, 143126, 37223, 5510, ...

[ 0.04693603515625, 0.034637451171875, 0.1995849609375, 0.111083984375, 0.13818359375, 0.25341796875, 0.07525634765625, 0.1982421875, 0.076904296875, 0.171875, 0.1751708984375, 0.2003173828125, 0.10205078125, 0.1082763671875, 0.10211181640625, 0.126708984375, 0.0787353515625, 0.06164...

embed

1721716_c0

1721716

lisp

0

Title: Calculating the depth of a binary tree in LISP recursively Problem title: Calculating the depth of a binary tree in LISP recursively Tags: lisp, recursion, binary-tree Problem: Calculating the depth of a binary tree in LISP recursively I have the following binary tree A / \ B C / \ D E represented as a list in L...

Calculating the depth of a binary tree in LISP recursively Calculating the depth of a binary tree in LISP recursively lisp recursion binary-tree Calculating LISP Returns Calculating the depth of a binary tree in LISP recursively I have the following binary tree represented as a list in Lisp (A 2 B 0 C 2 D 0 E 0) where ...

[ 0.012939453125, 0.0267333984375, -0.007537841796875, 0.000926971435546875, 0.0032501220703125, 0.0244140625, -0.01251220703125, 0.0034637451171875, 0.005279541015625, -0.0230712890625, 0.007110595703125, -0.0283203125, -0.005035400390625, 0.01495361328125, 0.0225830078125, -0.011535644...

[ 212467, 26518, 70, 168867, 2394, 6635, 53201, 16970, 9434, 195625, 5844, 400, 7008, 62600, 173340, 111, 25632, 33636, 5303, 1261, 116, 757, 120820, 110, 123055, 101935, 14012, 29041, 22085, 106, 6626, 7413, 167375, 1295, 74855, 47, 2407, 3525...

[ 0.181884765625, 0.00616455078125, 0.036407470703125, 0.257568359375, 0.159423828125, 0.12939453125, 0.2198486328125, 0.1380615234375, 0.20166015625, 0.1983642578125, 0.1376953125, 0.111572265625, 0.2041015625, 0.1754150390625, 0.1876220703125, 0.03271484375, 0.06201171875, 0.137084...

embed

65463443_c0

65463443

lisp

0

Title: Maxima. Thread local storage exhausted Problem title: Maxima. Thread local storage exhausted Tags: sbcl, multithreading, common-lisp, lisp, maxima Problem: Maxima. Thread local storage exhausted I am writing mathematical modules for analysis problems. All files are compiled to .fasl. The sizes of these files are...

Maxima. Thread local storage exhausted Maxima. Thread local storage exhausted sbcl multithreading common-lisp lisp maxima Maxima Thread SBCL PRIMITIVE HALT Welcome LDB Maxima. Thread local storage exhausted I am writing mathematical modules for analysis problems. All files are compiled to .fasl. The sizes of these file...

[ 0.0201416015625, 0.0045166015625, -0.00823974609375, 0.025634765625, -0.00439453125, -0.00127410888671875, 0.0296630859375, 0.0189208984375, -0.006256103515625, -0.042236328125, -0.0023651123046875, 0.01470947265625, 0.0177001953125, -0.0125732421875, 0.0262451171875, 0.0108642578125, ...

[ 46540, 11, 136719, 4000, 132096, 146353, 297, 91, 275, 34937, 3869, 65847, 39210, 4086, 254, 400, 7008, 122200, 90944, 37486, 105029, 568, 169813, 94198, 91334, 339, 39463, 32562, 140363, 88996, 114137, 44402, 102158, 5974, 31773, 141, 13267, ...

[ 0.216064453125, 0.1910400390625, 0.2008056640625, 0.1658935546875, 0.2269287109375, 0.2347412109375, 0.06884765625, 0.0123291015625, 0.069580078125, 0.1466064453125, 0.067138671875, 0.1385498046875, 0.079833984375, 0.00372314453125, 0.084228515625, 0.00958251953125, 0.099853515625, ...

embed

36757970_c1

36757970

lisp

1

main) ...both of the new windows created "hang", and don't respond/redraw to keypress or mouse movements. I've tried to base this snippet on what I found in the SDL2 examples . I must be misunderstanding how to use the cl-sdl2 wrapper for the event loop, or something similar. Has anyone had success in using multiple wi...

[ -0.00439453125, -0.0142822265625, -0.0031890869140625, -0.007659912109375, 0.0017852783203125, 0.0020904541015625, 0.00885009765625, -0.004150390625, 0.01519775390625, -0.0162353515625, -0.003326416015625, -0.019287109375, 0.021728515625, 0.006011962890625, 0.0048828125, -0.00029945373...

[ 5201, 837, 3525, 54825, 75935, 8467, 136, 2301, 18, 35644, 86905, 47, 22799, 11856, 114669, 112664, 3647, 159, 27502, 304, 27781, 24658, 144057, 4527, 33139, 7, 20469, 137565, 1264, 100, 19732, 40956, 35672, 36272, 17368, 48716, 678, 151301, ...

[ 0.07012939453125, 0.042083740234375, 0.1092529296875, 0.2020263671875, 0.125244140625, 0.233642578125, 0.0175933837890625, 0.0780029296875, 0.0989990234375, 0.16796875, 0.1875, 0.032806396484375, 0.0667724609375, 0.18505859375, 0.1114501953125, 0.146484375, 0.0570068359375, 0.05694...

embed

78964880_c0

78964880

lisp

0

Title: Is TRUNCASE a symbol that ever existed in a Lisp implementation? Problem title: Is TRUNCASE a symbol that ever existed in a Lisp implementation? Tags: lisp, common-lisp Problem: Is TRUNCASE a symbol that ever existed in a Lisp implementation? It appears that the Kate editor has a lot of xml files describing vari...

Is TRUNCASE a symbol that ever existed in a Lisp implementation? Is TRUNCASE a symbol that ever existed in a Lisp implementation? lisp common-lisp TRUNCASE Lisp commonlisp.xml Is TRUNCASE a symbol that ever existed in a Lisp implementation? It appears that the Kate editor has a lot of xml files describing various langu...

[ 0.00604248046875, 0.01190185546875, 0.01373291015625, -0.004638671875, -0.01361083984375, -0.00689697265625, -0.005615234375, -0.00096893310546875, -0.0059814453125, -0.00897216796875, 0.0037078857421875, 0.0107421875, -0.0081787109375, -0.0185546875, 0.00946044921875, 0.025146484375, ...

[ 2071, 14107, 175560, 76783, 10, 26582, 17669, 13835, 71, 1261, 7008, 208124, 400, 39210, 4086, 254, 131492, 37958, 30391, 5915, 102158, 28852, 67842, 46876, 127308, 60042, 756, 483, 19051, 5570, 151301, 77635, 56566, 17689, 177476, 20625, 14250...

[ 0.034637451171875, 0.183349609375, 0.2105712890625, 0.28955078125, 0.047149658203125, 0.264892578125, 0.1312255859375, 0.1802978515625, 0.05780029296875, 0.1988525390625, 0.2271728515625, 0.1798095703125, 0.1331787109375, 0.1339111328125, 0.1378173828125, 0.1943359375, 0.199584960937...

embed

14407812_c0

14407812

lisp

0

Title: Common Lisp return associations from alist as new list Problem title: Common Lisp return associations from alist as new list Tags: lisp, list, key-value-store, common-lisp Problem: Common Lisp return associations from alist as new list I have an assoc list as follows: (defparameter *experts2* `( ;; direction (:d...

Common Lisp return associations from alist as new list Common Lisp return associations from alist as new list lisp list key-value-store common-lisp alist Common Lisp experts2 Common Lisp return associations from alist as new list I have an assoc list as follows: I am looking for a way, to extract the values from the ke...

[ 0.0162353515625, -0.01287841796875, -0.0157470703125, 0.01324462890625, -0.010986328125, 0.0247802734375, 0.00958251953125, 0.0186767578125, 0.01263427734375, -0.01251220703125, 0.005706787109375, 0.007171630859375, 0.009765625, -0.0012969970703125, -0.004241943359375, 0.013671875, 0...

[ 151301, 1261, 7008, 30646, 151747, 1295, 10, 6562, 237, 3525, 5303, 400, 22799, 27494, 45804, 39210, 4086, 254, 78688, 63927, 238, 28960, 16487, 3917, 125663, 142424, 3884, 3934, 1884, 157666, 4358, 180358 ]

[ 0.1427001953125, 0.15771484375, 0.1767578125, 0.1959228515625, 0.2376708984375, 0.0870361328125, 0.05230712890625, 0.215087890625, 0.06500244140625, 0.114990234375, 0.1873779296875, 0.0904541015625, 0.133056640625, 0.1270751953125, 0.155517578125, 0.118896484375, 0.09185791015625, ...

embed

49118309_c1

49118309

lisp

1

); } | LPAREN COND s_expr s_expr s_expr RPAREN { $$ = condition($3, $4, $5); } | LPAREN LPAREN LET let_list RPAREN s_expr RPAREN { $$ = let($4, $6); } | QUIT { exit(0); } | error { } ; let_list: let_elem { $$ = let_list($1, NULL); } | let_list let_elem { $$ = let_list($2, $1); } ; let_elem: LPAREN TYPE SYMBOL s_expr RP...

[ -0.0086669921875, 0.00101470947265625, -0.011474609375, 0.012451171875, -0.0255126953125, 0.0203857421875, -0.01031494140625, -0.00616455078125, 0.003509521484375, 0.005950927734375, 0.01116943359375, -0.00159454345703125, -0.0196533203125, -0.0205078125, 0.0019989013671875, 0.01879882...

[ 3142, 51912, 58745, 82080, 111422, 14452, 397, 91, 454, 83613, 42, 80026, 10666, 3650, 4369, 2203, 35431, 363, 617, 4, 147307, 27089, 2633, 6562, 910, 6, 142363, 82230, 177609, 18499, 27889, 18057, 304, 38629, 95267, 21907, 65311, 98335, 12...

[ 0.08056640625, 0.03619384765625, 0.06683349609375, 0.1622314453125, 0.30712890625, 0.1837158203125, 0.2001953125, 0.11669921875, 0.003326416015625, 0.1611328125, 0.1373291015625, 0.114013671875, 0.011474609375, 0.07000732421875, 0.060089111328125, 0.0869140625, 0.276123046875, 0.13...

embed

20424983_c0

20424983

lisp

0

Title: Conditionals in Elisp's cl-loop facility Problem title: Conditionals in Elisp's cl-loop facility Tags: continue, elisp, lisp, loops Problem: Conditionals in Elisp's cl-loop facility I'm trying to wrap my head around Elisp's cl-loop facility but can't seem to find a way to skip elements. Here's an artif...

Conditionals in Elisp's cl-loop facility Conditionals in Elisp's cl-loop facility continue elisp lisp loops Conditionals Elisp Expected Conditionals in Elisp's cl-loop facility I'm trying to wrap my head around Elisp's cl-loop facility but can't seem to find a way to skip elements. Here's an artificial exampl...

[ 0.012451171875, 0.030029296875, -0.0013580322265625, 0.02099609375, -0.02587890625, 0.029052734375, 0.030029296875, 0.0130615234375, 0.006378173828125, 0.0213623046875, 0.00726318359375, 0.005126953125, -0.020263671875, 0.0023345947265625, 0.005889892578125, 0.005096435546875, -0.008...

[ 46347, 43315, 25318, 7008, 3768, 33139, 28354, 178290, 21342, 15296, 400, 40956, 60075, 13, 31577, 137565, 10336, 831, 48903, 7413, 3917, 47, 21658, 80854, 66733, 27781, 58755, 1884, 645, 5303, 892, 26255, 3525, 756, 70270, 7311, 108047, 3853...

[ 0.16552734375, 0.1824951171875, 0.1171875, 0.2069091796875, 0.046051025390625, 0.156982421875, 0.2303466796875, 0.1787109375, 0.22265625, 0.06756591796875, 0.0400390625, 0.193115234375, 0.057647705078125, 0.112548828125, 0.001556396484375, 0.035491943359375, 0.0271453857421875, 0.0...

embed

57460975_c0

57460975

lisp

0

Title: How to get the cl-libusb library to load without '-no-pie' cc error in Lisp? Problem title: How to get the cl-libusb library to load without '-no-pie' cc error in Lisp? Tags: cc, sbcl, lisp, linux, common-lisp Problem: How to get the cl-libusb library to load without '-no-pie' cc error in Lis...

How to get the cl-libusb library to load without '-no-pie' cc error in Lisp? How to get the cl-libusb library to load without '-no-pie' cc error in Lisp? cc sbcl lisp linux common-lisp pathname How Lisp setup.lisp ql:quickload Load ASDF Loading sbcl-1.5.2-linux-x64 cffi_0.20.1 libffi-types__grovel-t...

[ -0.011962890625, 0.009521484375, -0.0155029296875, -0.01397705078125, -0.0234375, 0.0030975341796875, 0.00811767578125, -0.0142822265625, -0.000530242919921875, -0.0250244140625, -0.02099609375, -0.0113525390625, -0.0128173828125, -0.01397705078125, 0.011474609375, -0.0014495849609375,...

[ 11249, 2046, 33139, 141, 4284, 275, 35773, 1294, 72367, 15490, 3768, 157, 5066, 10060, 18499, 1261, 7008, 34937, 400, 11508, 6077, 39210, 4086, 254, 60875, 11627, 169581, 99247, 2594, 63033, 2091, 6483, 38997, 228006, 42876, 2397, 13307, 2450...

[ 0.03265380859375, 0.012298583984375, 0.138916015625, 0.09271240234375, 0.1702880859375, 0.1810302734375, 0.1790771484375, 0.03656005859375, 0.1878662109375, 0.09600830078125, 0.11279296875, 0.1334228515625, 0.219482421875, 0.1549072265625, 0.18603515625, 0.15478515625, 0.220825195312...

embed

19398258_c0

19398258

lisp

0

Title: How is Lisp Box emacs configured? Problem title: How is Lisp Box emacs configured? Tags: lisp, emacs Problem: How is Lisp Box emacs configured? I have 3 versions of emacs on my system: Emacs included by default with OS X avilable via Terminal The most recent version of Emacs installed as a separate standalone ap...

How is Lisp Box emacs configured? How is Lisp Box emacs configured? lisp emacs How Lisp Box How is Lisp Box emacs configured? I have 3 versions of emacs on my system: Emacs included by default with OS X avilable via Terminal The most recent version of Emacs installed as a separate standalone app, Emacs.app on OS X Lisp...

[ 0.0235595703125, 0.018798828125, -0.031982421875, -0.019287109375, -0.018310546875, 0.01385498046875, 0.00897216796875, 0.0113525390625, 0.01068115234375, 0.0213623046875, -0.002166748046875, 0.002227783203125, -0.022705078125, -0.00092315673828125, -0.00286865234375, -0.0042724609375,...

[ 11249, 83, 1261, 7008, 27271, 352, 2263, 7, 222495, 71, 400, 138, 11389, 5426, 85269, 4439, 99201, 114977, 678, 11787, 1193, 5115, 2886, 1829, 124090, 17309, 20600, 84797, 103723, 51684, 4027, 9007, 57134, 72977, 83184, 27211, 11883, 11435, ...

[ 0.0816650390625, 0.0333251953125, 0.1971435546875, 0.2493896484375, 0.2467041015625, 0.1004638671875, 0.1788330078125, 0.1085205078125, 0.1883544921875, 0.060546875, 0.1461181640625, 0.05169677734375, 0.1112060546875, 0.0162811279296875, 0.1820068359375, 0.2001953125, 0.1005859375, ...

embed

59458525_c0

59458525

lisp

0

Title: Undefined operator FUNCTION in form (FUNCTION (QUOTE A)) in nfa compiler Problem title: Undefined operator FUNCTION in form (FUNCTION (QUOTE A)) in nfa compiler Tags: common-lisp, lisp, nfa Problem: Undefined operator FUNCTION in form (FUNCTION (QUOTE A)) in nfa compiler I'm trying to write an epsilon-nfa compil...

Undefined operator FUNCTION in form (FUNCTION (QUOTE A)) in nfa compiler Undefined operator FUNCTION in form (FUNCTION (QUOTE A)) in nfa compiler common-lisp lisp nfa Undefined QUOTE ALL CREATE-NFA FUNCTIONS ALREADY DEFINED LATER RE1 REn basic-nfa-1 NFA-REGEXP-COMP Undefined operator FUNCTION in form (FUNCTION (QUOTE A...

[ 0.016357421875, 0.00010061264038085938, 0.0079345703125, 0.019287109375, 0.015380859375, 0.0067138671875, 0.0240478515625, 0.00836181640625, 0.00592041015625, -0.0224609375, -0.0166015625, -0.01495361328125, 0.0028076171875, 0.005401611328125, -0.00830078125, 0.00128936767578125, 0.0...

[ 79912, 5983, 297, 39933, 136258, 441, 23, 3173, 919, 175560, 232856, 62, 653, 1021, 9969, 34759, 39210, 4086, 254, 400, 7008, 175151, 839, 14676, 1514, 129525, 9069, 418, 19, 62822, 5759, 541, 153189, 26939, 683, 16113, 33022, 15759, 4759, ...

[ 0.126220703125, 0.2098388671875, 0.037506103515625, 0.26513671875, 0.1802978515625, 0.0965576171875, 0.07330322265625, 0.219970703125, 0.05377197265625, 0.159423828125, 0.2252197265625, 0.176025390625, 0.07061767578125, 0.1826171875, 0.134033203125, 0.1798095703125, 0.05438232421875,...

embed

28328559_c0

28328559

lisp

0

Title: Racket: N Queens solving by column Problem title: Racket: N Queens solving by column Tags: lisp, scheme, racket Problem: Racket: N Queens solving by column I'm new to Racket and as one of my first semi-complex programs I'm trying to solve the N queens problem by traversing linearly through column; so that the re...

Racket: N Queens solving by column Racket: N Queens solving by column lisp scheme racket Racket Queens Racket: N Queens solving by column I'm new to Racket and as one of my first semi-complex programs I'm trying to solve the N queens problem by traversing linearly through column; so that the result would be a list (2 4...

[ -0.01275634765625, 0.01373291015625, 0.021728515625, 0.0194091796875, 0.0029144287109375, 0.004730224609375, -0.00823974609375, 0.0027923583984375, -0.01434326171875, -0.037109375, 0.01239013671875, 0.023681640625, -0.0146484375, 0.0028076171875, -0.0263671875, -0.000064849853515625, ...

[ 2552, 27853, 541, 44109, 7, 3115, 390, 3365, 316, 12, 400, 7008, 150370, 673, 3525, 5117, 44974, 103391, 31577, 86869, 41, 1755, 2967, 37317, 192617, 8305, 16750, 5303, 4700, 201, 106, 8439, 116, 15555, 138, 4216, 927, 1528, 82424, 1884, ...

[ 0.1197509765625, 0.2052001953125, 0.1634521484375, 0.2305908203125, 0.0579833984375, 0.0880126953125, 0.03216552734375, 0.1405029296875, 0.1597900390625, 0.011077880859375, 0.044403076171875, 0.1185302734375, 0.13525390625, 0.09228515625, 0.0711669921875, 0.001983642578125, 0.0509033...

embed

60244547_c1

60244547

lisp

1

1 path2 target-node) (> (heuristic (first path1) target-node) (heuristic (first path2) target-node))) (defun best-first (start finish &optional (queue (list (list start)))) (cond ((endp queue) nil) ((equal finish (first (first queue))) (print (length (first queue))) (reverse (first queue))) (t (best-first start finish ...

[ 0.0040283203125, 0.01141357421875, 0.00921630859375, 0.0191650390625, 0.00848388671875, -0.005615234375, -0.003814697265625, -0.0380859375, 0.004730224609375, -0.01080322265625, 0.00885009765625, 0.00738525390625, 0.005889892578125, 0.00004172325134277344, 0.001434326171875, -0.0267333...

[ 106, 60875, 304, 30388, 9, 157, 112, 2740, 1106, 474, 48242, 13448, 271, 17727, 10461, 32149, 16498, 2965, 17137, 67229, 109585, 944, 6562, 4034, 80126, 2271, 71, 3611, 254, 41, 17324, 71723, 35662, 23986, 107, 37676, 18, 32168, 62351, 51...

[ 0.1142578125, 0.236083984375, 0.1802978515625, 0.257080078125, 0.0233001708984375, 0.1610107421875, 0.129638671875, 0.0693359375, 0.05682373046875, 0.1607666015625, 0.19384765625, 0.114013671875, 0.043304443359375, 0.10009765625, 0.15283203125, 0.06689453125, 0.119140625, 0.0870361...

embed

40240929_c0

40240929

lisp

0

Title: NLP with Racket Problem title: NLP with Racket Tags: racket, nlp, lisp Problem: NLP with Racket I am studying NLP with Racket and Dr. Racket. I am working with this code: #lang racket (define english-1 '((Initial (1)) (Final (9)) (From 1 to 3 by NP) (From 1 to 2 by DET) (From 2 to 3 by N) (From 3 to 4 by BV) (Fr...

NLP with Racket NLP with Racket racket nlp lisp racket/trace NLP Racket english-1 Initial Final DET ADV ADJ MOD CNJ NLP with Racket I am studying NLP with Racket and Dr. Racket. I am working with this code: The code seems to be mostly fine. However, I keep getting a error messaging related to the recognize-move functio...

[ 0.00506591796875, 0.006317138671875, 0.004669189453125, 0.0439453125, 0.013427734375, -0.0038909912109375, -0.0029754638671875, -0.0031585693359375, 0.0025482177734375, -0.0224609375, 0.021728515625, -0.0087890625, -0.016357421875, -0.022216796875, 0.002471923828125, -0.006988525390625...

[ 541, 37352, 678, 2552, 27853, 673, 26775, 400, 7008, 39989, 175457, 5759, 1890, 27188, 105437, 48755, 100679, 98610, 91551, 35187, 1773, 20697, 18151, 37202, 153161, 5885, 33306, 13695, 18499, 115288, 9966, 62548, 125296, 9, 432, 272, 32354, ...

[ 0.059417724609375, 0.2236328125, 0.1259765625, 0.1170654296875, 0.230712890625, 0.09271240234375, 0.1495361328125, 0.0189208984375, 0.090087890625, 0.12841796875, 0.057647705078125, 0.052642822265625, 0.0300445556640625, 0.1329345703125, 0.14697265625, 0.10174560546875, 0.06976318359...

embed

29540779_c0

29540779

lisp

0

Title: Proper way to do a lisp program on lisp manipulaton Problem title: Proper way to do a lisp program on lisp manipulaton Tags: list, lisp Problem: Proper way to do a lisp program on lisp manipulaton Just writing a simple program to learn how to manipulate list. The external file has two column : bookname ISBN-no. ...

Proper way to do a lisp program on lisp manipulaton Proper way to do a lisp program on lisp manipulaton list lisp Proper How Read Bible History Prophecy Literature--Why Modern Readers Need Know Difference What Means Faith Today ISBN-13 Who Wrote Proper way to do a lisp program on lisp manipulaton Just writing a simple ...

[ -0.01513671875, 0.01275634765625, 0.007781982421875, 0.01708984375, -0.02978515625, 0.03564453125, 0.0076904296875, 0.0037384033203125, -0.002471923828125, -0.00138092041015625, 0.00994873046875, 0.0107421875, -0.0087890625, -0.0027008056640625, -0.00909423828125, -0.013671875, -0.00...

[ 1250, 1264, 3917, 54, 400, 7008, 1528, 98, 45258, 1507, 5303, 11249, 4764, 60313, 65786, 20133, 95935, 168754, 18799, 122636, 52889, 70829, 18234, 4865, 1215, 10133, 31567, 38396, 47475, 22820, 40469, 516, 32562, 8781, 30698, 3642, 67, 581, ...

[ 0.0869140625, 0.10888671875, 0.088134765625, 0.0679931640625, 0.170654296875, 0.2286376953125, 0.2393798828125, 0.09814453125, 0.2288818359375, 0.1182861328125, 0.1868896484375, 0.04144287109375, 0.158935546875, 0.150390625, 0.1171875, 0.1829833984375, 0.099609375, 0.02676391601562...

embed

35544606_c0

35544606

lisp

0

Title: Remove subsequence function (deep recursion) in Scheme using CPS Problem title: Remove subsequence function (deep recursion) in Scheme using CPS Tags: recursion, scheme, lisp Problem: Remove subsequence function (deep recursion) in Scheme using CPS removesub* takes a list of atoms and a general list. The first l...

Remove subsequence function (deep recursion) in Scheme using CPS Remove subsequence function (deep recursion) in Scheme using CPS recursion scheme lisp CPS Remove Scheme v2car v2cdr Remove subsequence function (deep recursion) in Scheme using CPS removesub* takes a list of atoms and a general list. The first list is a ...

[ 0.00124359130859375, 0.0269775390625, -0.006317138671875, 0.0235595703125, -0.00151824951171875, 0.0106201171875, -0.01470947265625, -0.01055908203125, -0.00128936767578125, 0.00145721435546875, 0.00732421875, -0.01507568359375, 0.003265380859375, 0.018798828125, 0.0169677734375, 0.004...

[ 181139, 1614, 184, 944, 3956, 32354, 123041, 195625, 1830, 34702, 282, 17368, 313, 9059, 23, 150370, 400, 7008, 81, 304, 3284, 7569, 87388, 22144, 1639, 51776, 5303, 34627, 4537, 5117, 17932, 55300, 5608, 30646, 74918, 184750, 876, 501, 10,...

[ 0.1973876953125, 0.174560546875, 0.17138671875, 0.16064453125, 0.08837890625, 0.1949462890625, 0.2130126953125, 0.2158203125, 0.1021728515625, 0.1595458984375, 0.1583251953125, 0.005462646484375, 0.040618896484375, 0.21484375, 0.02435302734375, 0.1414794921875, 0.00750732421875, 0....

embed

49499245_c0

49499245

lisp

0

Title: What are the rules behind the typical indenting conventions of lisp? Problem title: What are the rules behind the typical indenting conventions of lisp? Tags: indentation, emacs, lisp Problem: What are the rules behind the typical indenting conventions of lisp? Note to mods: Please note that this question is NOT...

What are the rules behind the typical indenting conventions of lisp? What are the rules behind the typical indenting conventions of lisp? indentation emacs lisp BEG What Delete END What are the rules behind the typical indenting conventions of lisp? Note to mods: Please note that this question is NOT AT ALL a question ...

[ -0.003509521484375, 0.01263427734375, -0.020263671875, -0.00335693359375, -0.00726318359375, 0.01312255859375, 0.00067901611328125, -0.0052490234375, 0.004669189453125, 0.01153564453125, 0.0096435546875, 0.006103515625, -0.0263671875, -0.006866455078125, 0.0017852783203125, -0.00210571...

[ 91736, 50155, 222201, 18597, 1916, 101805, 7, 400, 7008, 22062, 352, 2263, 9622, 724, 4865, 262, 46485, 39015, 2811, 90365, 43045, 35572, 114977, 15296, 44084, 18151, 3674, 1884, 903, 9384, 959, 20020, 2174, 1100, 254, 5701, 17366, 28219, 1...

[ 0.1480712890625, 0.113037109375, 0.1605224609375, 0.178955078125, 0.09814453125, 0.1728515625, 0.0849609375, 0.0992431640625, 0.2005615234375, 0.0631103515625, 0.011199951171875, 0.099853515625, 0.06549072265625, 0.07550048828125, 0.01409912109375, 0.00750732421875, 0.115966796875, ...

embed

79426935_c1

79426935

lisp

1

closed (list first-node))) (children (remove-existing (funcall generator first-node operators 'bfs) new-closed 'bfs)) (new-open (bfs-open (cdr open) children)) (solution-node (check-solution children objective)) ) (cond ((not (null solution-node)) solution-node) (t (setf open new-open) (setf closed new-closed) (bfs-go...

[ -0.0010986328125, 0.01275634765625, 0.006103515625, -0.00457763671875, 0.0081787109375, 0.0146484375, -0.0087890625, -0.007568359375, 0.01416015625, -0.030517578125, -0.0244140625, 0.003936767578125, 0.004547119140625, 0.0096435546875, -0.007537841796875, -0.040283203125, -0.01391601...

[ 155738, 6562, 5117, 157, 112, 32149, 237052, 26973, 272, 54376, 16498, 85763, 145823, 39933, 150598, 7, 3525, 155648, 54936, 59636, 7569, 9803, 20020, 166589, 78292, 151814, 2271, 139550, 29806, 3509, 420, 519, 876, 17447, 32354, 33342, 1884, ...

[ 0.2239990234375, 0.1766357421875, 0.1151123046875, 0.1766357421875, 0.1552734375, 0.0341796875, 0.247314453125, 0.1287841796875, 0.05364990234375, 0.13525390625, 0.1822509765625, 0.180908203125, 0.29931640625, 0.166259765625, 0.1064453125, 0.07318115234375, 0.049560546875, 0.144165...

embed

48489812_c0

48489812

lisp

0

Title: Generate combinations Problem title: Generate combinations Tags: common-lisp, lisp, list, loops, combinations Problem: Generate combinations I am trying to write a function in Lisp that generates all possible combinations of given keys and values. Here is an example input and output: Input: '((key1 . (v1 v2)) (k...

Generate combinations Generate combinations common-lisp lisp list loops combinations Generate Input key1 key2 Output key3 Generate combinations I am trying to write a function in Lisp that generates all possible combinations of given keys and values. Here is an example input and output: Currently, my function for doing...

[ -0.01708984375, 0.02734375, 0.004974365234375, -0.0235595703125, -0.00927734375, -0.006683349609375, -0.0185546875, -0.02099609375, 0.00506591796875, -0.0218505859375, 0.004608154296875, 0.035400390625, 0.0145263671875, 0.00335693359375, 0.003936767578125, 0.000820159912109375, -0.00...

[ 155370, 67, 162515, 39210, 4086, 254, 400, 7008, 5303, 40956, 360, 7077, 22799, 304, 13538, 363, 7, 31577, 33022, 32354, 1261, 139392, 756, 7722, 34475, 142424, 27781, 107730, 140992, 43240, 84751, 51713, 26785, 186104, 8512, 1614, 6562, 6713...

[ 0.206787109375, 0.04949951171875, 0.2578125, 0.078857421875, 0.07220458984375, 0.1331787109375, 0.08740234375, 0.189453125, 0.1279296875, 0.116943359375, 0.02490234375, 0.015838623046875, 0.14599609375, 0.053131103515625, 0.03485107421875, 0.10498046875, 0.03472900390625, 0.0242309...

embed

17602443_c0

17602443

lisp

0

Title: Loading and Unloading the .arx file with LISP Problem title: Loading and Unloading the .arx file with LISP Tags: autodesk, autocad, autolisp, lisp, visual-c%2B%2B Problem: Loading and Unloading the .arx file with LISP I have few .arx applications for AutoCAD. In these applications few are menu based and others a...

Loading and Unloading the .arx file with LISP Loading and Unloading the .arx file with LISP autodesk autocad autolisp lisp visual-c%2B%2B Loading Unloading LISP c:XYZ_program Example Folder XYZ.arx XYZ_program ads_queueexpr Loading and Unloading the .arx file with LISP I have few .arx applications for AutoCAD. In these...

[ 0.01043701171875, 0.023193359375, -0.01177978515625, 0.00185394287109375, -0.030029296875, 0.00372314453125, 0.021728515625, 0.0002384185791015625, -0.0023345947265625, -0.0291748046875, 0.01214599609375, 0.00250244140625, -0.0181884765625, -0.024658203125, 0.0069580078125, 0.004364013...

[ 228006, 136, 992, 63033, 5, 147, 425, 11435, 678, 16970, 9434, 1809, 133850, 25426, 4086, 254, 400, 7008, 21176, 143907, 1511, 18749, 89536, 30077, 606, 83613, 10846, 86685, 4396, 85427, 8026, 35509, 75101, 13315, 2091, 4027, 11675, 51, 384...

[ 0.1990966796875, 0.044189453125, 0.0833740234375, 0.2069091796875, 0.0301513671875, 0.1827392578125, 0.197998046875, 0.141845703125, 0.037750244140625, 0.1510009765625, 0.2236328125, 0.046600341796875, 0.14599609375, 0.12890625, 0.0904541015625, 0.133544921875, 0.1226806640625, 0.2...

embed

4546118_c0

4546118

lisp

0

Title: What's the idiomatic equivalent of C structs in Lisp? Problem title: What's the idiomatic equivalent of C structs in Lisp? Tags: struct, c, lisp, common-lisp Problem: What's the idiomatic equivalent of C structs in Lisp? In C-type languages, there is a strong emphasis on structs/records and objects fro...

What's the idiomatic equivalent of C structs in Lisp? What's the idiomatic equivalent of C structs in Lisp? struct c lisp common-lisp What Lisp What's the idiomatic equivalent of C structs in Lisp? In C-type languages, there is a strong emphasis on structs/records and objects from the very beginning and in ev...

[ 0.01025390625, 0.0286865234375, 0.00189971923828125, 0.00274658203125, 0.015380859375, 0.01422119140625, -0.00396728515625, -0.00022220611572265625, 0.0025634765625, -0.0279541015625, -0.01611328125, -0.003448486328125, 0.00286865234375, -0.006011962890625, 0.008544921875, 0.0147705078...

[ 3768, 49666, 9523, 183234, 313, 36716, 7, 23, 1261, 7008, 501, 400, 39210, 9, 4086, 254, 4865, 50986, 46876, 37515, 242661, 32271, 36746, 86595, 11907, 39864, 12877, 28484, 76519, 82775, 332, 91582, 3334, 209806, 15550, 37967, 8, 420, 8781,...

[ 0.0361328125, 0.1407470703125, 0.057220458984375, 0.154296875, 0.138916015625, 0.2230224609375, 0.057647705078125, 0.0113525390625, 0.178955078125, 0.22265625, 0.09002685546875, 0.12939453125, 0.109619140625, 0.003204345703125, 0.12548828125, 0.1480712890625, 0.05731201171875, 0.14...

embed

8371820_c0

8371820

lisp

0

Title: Order of (:before/:after) method invocation in CLOS? Problem title: Order of (:before/:after) method invocation in CLOS? Tags: clos, common-lisp, lisp Problem: Order of (:before/:after) method invocation in CLOS? I need some help understanding the order of execution for the following code. I create an instance o...

Order of (:before/:after) method invocation in CLOS? Order of (:before/:after) method invocation in CLOS? clos common-lisp lisp Order CLOS Cooking pie-1 COOKED APPLE Order of (:before/:after) method invocation in CLOS? I need some help understanding the order of execution for the following code. I create an instance of...

[ 0.010009765625, 0.0037078857421875, 0.00225830078125, 0.020263671875, 0.00138092041015625, 0.014404296875, -0.00042724609375, 0.0108642578125, 0.0052490234375, 0.004058837890625, -0.002960205078125, -0.02294921875, -0.0018157958984375, -0.00335693359375, -0.001190185546875, -0.02954101...

[ 81206, 111, 372, 89700, 64, 46327, 55300, 23, 202010, 92933, 32, 20450, 7, 39210, 4086, 254, 400, 7008, 79479, 2158, 5759, 8244, 9092, 17610, 66440, 15300, 313, 4358, 100094, 12989, 71924, 1830, 25632, 18151, 28282, 110527, 17368, 32354, 29...

[ 0.2054443359375, 0.1197509765625, 0.040130615234375, 0.1859130859375, 0.0699462890625, 0.21923828125, 0.217041015625, 0.05877685546875, 0.1900634765625, 0.242919921875, 0.006195068359375, 0.1572265625, 0.03912353515625, 0.079345703125, 0.0819091796875, 0.148681640625, 0.1236572265625...

embed

57561048_c0

57561048

lisp

0

Title: No more room for LISP objects error wxMaxima Problem title: No more room for LISP objects error wxMaxima Tags: performance, wxmaxima, lisp, heap-memory Problem: No more room for LISP objects error wxMaxima I am trying to solve a non-linear equation system with maxima. I use wxmaxima (17.05.0). The non-linear sys...

No more room for LISP objects error wxMaxima No more room for LISP objects error wxMaxima performance wxmaxima lisp heap-memory LISP eq1:mBA K10 RABm10 K11 RABm11 K12 RABm12 RABm7 RABm8 RABm9 M10 RAm10 M11 RAm11 M12 RAm12 RAm2 RAm3 RAm4 RAm5 RAm6 RAm7 RAm8 RAm9 RBm2 RBm3 RBm4 RBm5 RBm6 RBm10 RBm11 RBm12 RBm7 RBm8 RBm9 ...

[ -0.0206298828125, 0.030029296875, -0.0103759765625, -0.005401611328125, -0.0126953125, -0.003326416015625, -0.004852294921875, 0.0126953125, 0.00872802734375, -0.03125, 0.0106201171875, 0.0079345703125, -0.001953125, -0.0103759765625, 0.00921630859375, 0.01904296875, 0.00436401367187...

[ 438, 1286, 17155, 100, 16970, 9434, 36746, 18499, 148, 425, 71346, 1352, 23718, 24084, 400, 7008, 764, 2631, 109005, 864, 8031, 341, 963, 11040, 144787, 617, 31577, 86869, 351, 2256, 5490, 5426, 122200, 21067, 20806, 77495, 147, 4989, 59090...

[ 0.0836181640625, 0.1522216796875, 0.2342529296875, 0.09478759765625, 0.1278076171875, 0.2099609375, 0.1956787109375, 0.1436767578125, 0.0751953125, 0.1068115234375, 0.121826171875, 0.179443359375, 0.1400146484375, 0.103271484375, 0.09820556640625, 0.163330078125, 0.1259765625, 0.09...

embed