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
17045941_c0	17045941	lisp	0	Title: How to compare two functions for extensional equivalence, as in (λx.2x) == (λx.x+x)? Problem title: How to compare two functions for extensional equivalence, as in (λx.2x) == (λx.x+x)? Tags: lisp, clojure, functional-programming, haskell, lambda Problem: How to compare two functions for extensional equivalence...	How to compare two functions for extensional equivalence, as in (λx.2x) == (λx.x+x)? How to compare two functions for extensional equivalence, as in (λx.2x) == (λx.x+x)? lisp clojure functional-programming haskell lambda How How to compare two functions for extensional equivalence, as in (λx.2*x) == (λx.x+x)? Is ther...	[ -0.008056640625, 0.0185546875, 0.00421142578125, 0.0101318359375, -0.01470947265625, -0.0030975341796875, 0.00469970703125, -0.00051116943359375, -0.006744384765625, -0.01953125, 0.00787353515625, 0.0186767578125, 0.00640869140625, 0.009521484375, 0.009765625, -0.013916015625, -0.001...	[ 11249, 47, 69101, 6626, 32354, 100, 111938, 289, 224743, 3956, 5970, 425, 304, 1639, 69112, 1328, 400, 7008, 20450, 461, 107, 123309, 28966, 1556, 142508, 6492, 85, 3917, 28, 161789, 5608, 30646, 29568, 171259, 183234 ]	[ 0.06378173828125, 0.048248291015625, 0.2396240234375, 0.1353759765625, 0.19970703125, 0.0364990234375, 0.2294921875, 0.1204833984375, 0.211669921875, 0.055511474609375, 0.06109619140625, 0.1180419921875, 0.1119384765625, 0.11572265625, 0.19091796875, 0.1973876953125, 0.03140258789062...	embed
40672914_c0	40672914	lisp	0	Title: Built-in case insensitive string= Problem title: Built-in case insensitive string= Tags: lisp, common-lisp Problem: Built-in case insensitive string= I need to compare two strings ignoring the case for the assoc :test function. I know that I can easily write the function like so: (defun cistring= (str1 str2) (st...	Built-in case insensitive string= Built-in case insensitive string= lisp common-lisp Built-in str1 str2 Built-in case insensitive string= I need to compare two strings ignoring the case for the assoc :test function. I know that I can easily write the function like so: However I was wondering: Is there is a built-in cas...	[ -0.0029296875, -0.00738525390625, -0.0012359619140625, 0.0096435546875, -0.001129150390625, 0.007415771484375, 0.0322265625, 0.00665283203125, 0.01373291015625, 0.00933837890625, 0.00494384765625, -0.0018768310546875, -0.008056640625, 0.00970458984375, -0.003814697265625, -0.0079345703...	[ 667, 24908, 73, 7225, 23, 176302, 13, 79315, 1369, 400, 7008, 39210, 4086, 254, 7704, 304, 69101, 6626, 47438, 63927, 238, 6954, 32354, 72546, 33022, 1884, 221, 88303, 7413 ]	[ 0.031494140625, 0.0888671875, 0.1260986328125, 0.1798095703125, 0.1036376953125, 0.2156982421875, 0.1357421875, 0.22509765625, 0.1458740234375, 0.058746337890625, 0.1361083984375, 0.06591796875, 0.0210113525390625, 0.0980224609375, 0.1014404296875, 0.0288238525390625, 0.1719970703125...	embed
55092036_c0	55092036	lisp	0	Title: Join numbers with whitespace in Common Lisp? Problem title: Join numbers with whitespace in Common Lisp? Tags: common-lisp, lisp, whitespace Problem: Join numbers with whitespace in Common Lisp? Writing a simple loop for a Lisp program, I want my numbers to be printed with whitespace in between them, (loop for i...	Join numbers with whitespace in Common Lisp? Join numbers with whitespace in Common Lisp? common-lisp lisp whitespace 1 Join Common Lisp prin1 Join numbers with whitespace in Common Lisp? Writing a simple loop for a Lisp program, I want my numbers to be printed with whitespace in between them, prints: id like it to pri...	[ 0.00390625, 0.00131988525390625, -0.0130615234375, 0.01092529296875, -0.01275634765625, 0.0322265625, 0.006927490234375, 0.0247802734375, 0.0068359375, -0.0380859375, 0.00335693359375, -0.00897216796875, -0.029052734375, -0.01953125, -0.016357421875, 0.023681640625, 0.006744384765625...	[ 113053, 101935, 678, 35011, 65421, 23, 151301, 1261, 7008, 39210, 4086, 254, 400, 106, 2448, 418, 213185, 8781, 40956, 1528, 3444, 28412, 17721, 3447, 1884, 45767, 7413, 3004, 1916, 151107, 4358 ]	[ 0.207275390625, 0.19775390625, 0.06427001953125, 0.181640625, 0.256591796875, 0.035308837890625, 0.1485595703125, 0.1588134765625, 0.2099609375, 0.10125732421875, 0.09619140625, 0.138671875, 0.1156005859375, 0.051025390625, 0.143310546875, 0.0163116455078125, 0.053070068359375, 0.0...	embed
39127754_c0	39127754	lisp	0	Title: Making a plugin system in clojure Problem title: Making a plugin system in clojure Tags: clojure, java, jvm, lisp Problem: Making a plugin system in clojure I'd like to know if it's possible to and how to implement a module system. Here's example of how it works: I have some folder (e.g. modules ), this folder h...	Making a plugin system in clojure Making a plugin system in clojure clojure java jvm lisp Making Making a plugin system in clojure I'd like to know if it's possible to and how to implement a module system. Here's example of how it works: I have some folder (e.g. modules ), this folder has a bunch of clojure files that ...	[ -0.01171875, 0.01275634765625, -0.015869140625, 0.022216796875, -0.002960205078125, 0.027587890625, -0.0004634857177734375, -0.0020904541015625, 0.0027008056640625, -0.044189453125, -0.0225830078125, 0.0247802734375, 0.0002307891845703125, -0.0015716552734375, -0.00836181640625, -0.005...	[ 13676, 69993, 5426, 20450, 461, 107, 79, 330, 334, 39, 400, 7008, 23, 1884, 3714, 7722, 29479, 88996, 27781, 43240, 78303, 147306, 102158, 31255, 77336, 9351, 6835, 3355, 72367, 3934, 1632, 5303, 8560, 184750, 1295 ]	[ 0.0941162109375, 0.282958984375, 0.206787109375, 0.1461181640625, 0.182861328125, 0.1556396484375, 0.04412841796875, 0.115966796875, 0.033966064453125, 0.055572509765625, 0.032470703125, 0.143310546875, 0.01397705078125, 0.02685546875, 0.005401611328125, 0.1104736328125, 0.1414794921...	embed
4724_c0	4724	lisp	0	Title: Why should I learn Lisp? Problem title: Why should I learn Lisp? Tags: functional-programming, lisp Problem: Why should I learn Lisp? I really feel that I should learn Lisp and there are plenty of good resources out there to help me do it. I'm not put off by the complicated syntax, but where in "traditional comm...	Why should I learn Lisp? Why should I learn Lisp? functional-programming lisp Why Lisp Why should I learn Lisp? I really feel that I should learn Lisp and there are plenty of good resources out there to help me do it. I'm not put off by the complicated syntax, but where in "traditional commercial programming" would I f...	[ -0.002532958984375, 0.0162353515625, 0.01324462890625, 0.0089111328125, -0.0068359375, 0.0284423828125, -0.003021240234375, 0.01263427734375, 0.0198974609375, -0.044189453125, 0.0035552978515625, -0.0103759765625, 0.00531005859375, 0.0185546875, -0.00531005859375, 0.003997802734375, ...	[ 44084, 5608, 87, 30698, 1261, 7008, 123309, 28966, 214, 400, 6183, 12319, 87794, 4127, 65514, 4358, 96704, 6002, 86531, 209990, 60091, 56037, 449, 44677, 10422, 4527, 442, 64457, 59158, 46876, 200, 14155, 9007, 59121, 23 ]	[ 0.153564453125, 0.1566162109375, 0.05706787109375, 0.1629638671875, 0.206298828125, 0.2685546875, 0.14306640625, 0.1341552734375, 0.0230255126953125, 0.1484375, 0.05743408203125, 0.09405517578125, 0.0181121826171875, 0.005126953125, 0.076416015625, 0.043060302734375, 0.071044921875, ...	embed
8243813_c0	8243813	lisp	0	Title: Is there a way to extract all elements of a list in place Problem title: Is there a way to extract all elements of a list in place Tags: list, lisp, common-lisp Problem: Is there a way to extract all elements of a list in place Im looking for a way to extract all the elements of a list in common lisp. Like this ...	Is there a way to extract all elements of a list in place Is there a way to extract all elements of a list in place list lisp common-lisp Is there a way to extract all elements of a list in place Im looking for a way to extract all the elements of a list in common lisp. Like this Edit: The usage example I gave was not ...	[ -0.00015735626220703125, 0.004852294921875, 0.00311279296875, 0.01202392578125, -0.002349853515625, 0.0142822265625, 0.000118255615234375, -0.00124359130859375, 0.00634765625, -0.031494140625, 0.0130615234375, -0.006988525390625, -0.004608154296875, -0.00579833984375, -0.0157470703125, ...	[ 2071, 2685, 10, 3917, 47, 125663, 756, 80854, 111, 5303, 23, 3687, 400, 7008, 39210, 4086, 254, 16487, 70, 127689, 27781, 193844, 7722, 36356, 1810, 1884 ]	[ 0.010040283203125, 0.043365478515625, 0.05767822265625, 0.1270751953125, 0.08453369140625, 0.2486572265625, 0.158447265625, 0.200927734375, 0.10302734375, 0.22802734375, 0.04986572265625, 0.2161865234375, 0.1099853515625, 0.1865234375, 0.15576171875, 0.090087890625, 0.1429443359375, ...	embed
8599844_c0	8599844	lisp	0	Title: Is it possible / How to use racket in C++ Applications? Problem title: Is it possible / How to use racket in C++ Applications? Tags: racket, lisp, c%2B%2B Problem: Is it possible / How to use racket in C++ Applications? I heard that Racket could be embedded (maybe also with C++). http://docs.racket-lang.org/insi...	Is it possible / How to use racket in C++ Applications? Is it possible / How to use racket in C++ Applications? racket lisp c%2B%2B How Applications Is it possible / How to use racket in C++ Applications? I heard that Racket could be embedded (maybe also with C++). http://docs.racket-lang.org/inside/index.html http://d...	[ -0.0028076171875, 0.00537109375, -0.00024318695068359375, 0.0177001953125, 0.0037841796875, 0.0177001953125, 0.0242919921875, 0.000766754150390625, 0.004486083984375, -0.048583984375, 0.0177001953125, -0.033447265625, -0.01708984375, 0.03076171875, 0.006866455078125, -0.0157470703125, ...	[ 2071, 442, 7722, 248, 11249, 47, 4527, 673, 27853, 23, 313, 37223, 104921, 7, 400, 7008, 501, 49782, 2552, 5809, 55720, 69819, 678, 219, 3066, 38529, 8951, 3917, 11, 33209, 3642, 11675, 1295, 8781, 27781 ]	[ 0.040557861328125, 0.06414794921875, 0.1796875, 0.0204010009765625, 0.0921630859375, 0.01776123046875, 0.1568603515625, 0.1712646484375, 0.288330078125, 0.067138671875, 0.0994873046875, 0.2822265625, 0.1636962890625, 0.0227813720703125, 0.0550537109375, 0.1207275390625, 0.03259277343...	embed
6810720_c0	6810720	lisp	0	Title: Clojure presentation for beginners? Problem title: Clojure presentation for beginners? Tags: java, clojure, functional-programming, language-agnostic, lisp Problem: Clojure presentation for beginners? I need to make a presentation for beginners about the Clojure language. What are your suggestions on selecting t...	Clojure presentation for beginners? Clojure presentation for beginners? java clojure functional-programming language-agnostic lisp Clojure Clojure presentation for beginners? I need to make a presentation for beginners about the Clojure language. What are your suggestions on selecting topics on it? What are the points ...	[ 0.01043701171875, 0.0107421875, 0.0140380859375, 0.010498046875, -0.00433349609375, -0.008056640625, 0.02392578125, -0.01953125, 0, -0.00848388671875, -0.0137939453125, -0.005035400390625, -0.03173828125, 0.00958251953125, 0.00081634521484375, -0.01495361328125, -0.00848388671875, ...	[ 51053, 461, 107, 92252, 100, 9842, 43148, 79, 330, 20450, 123309, 28966, 46876, 2895, 400, 7008, 3871, 3249, 10, 157666, 36849, 28451, 442, 26847, 26698, 122446, 56037, 214709, 3299 ]	[ 0.176025390625, 0.21142578125, 0.1680908203125, 0.22119140625, 0.0777587890625, 0.133544921875, 0.1298828125, 0.10693359375, 0.154052734375, 0.1434326171875, 0.128173828125, 0.08306884765625, 0.17236328125, 0.1212158203125, 0.041168212890625, 0.12127685546875, 0.03466796875, 0.0501...	embed
20686005_c0	20686005	lisp	0	Title: Pushing in list Problem title: Pushing in list Tags: lisp Problem: Pushing in list What I want to do is to repeteadly take an element from a list and if it respects the condition,I'll append it to a new list and to keep the list format.How do I do the appending part? I'm getting the element with nth and I've tri...	Pushing in list Pushing in list lisp Pushing Pushing in list What I want to do is to repeteadly take an element from a list and if it respects the condition,I'll append it to a new list and to keep the list format.How do I do the appending part? I'm getting the element with nth and I've tried several variants of push b...	[ -0.00689697265625, 0.0164794921875, 0.0000591278076171875, 0.005218505859375, 0.0033111572265625, 0.026611328125, -0.006134033203125, 0.00958251953125, 0.012939453125, -0.0062255859375, 0.00823974609375, -0.015625, -0.016357421875, -0.013671875, -0.01611328125, 0.0030059814453125, 0....	[ 114405, 214, 23, 5303, 400, 7008, 3444, 54, 69495, 67, 712, 5646, 12830, 1295, 2174, 15072, 35431, 114689, 71, 3525, 13695, 9384, 81826, 1747, 96819, 2831, 20949, 678, 653, 927, 37842, 40368, 20117, 25944, 7440, 3509, 864, 10, 4958, 5036,...	[ 0.2490234375, 0.1541748046875, 0.1552734375, 0.2220458984375, 0.08648681640625, 0.1531982421875, 0.1004638671875, 0.03887939453125, 0.14892578125, 0.07855224609375, 0.071044921875, 0.1507568359375, 0.1468505859375, 0.1058349609375, 0.040435791015625, 0.1156005859375, 0.1572265625, ...	embed
5226767_c0	5226767	lisp	0	Title: Does anybody know a good documentation that compares different Scheme implementations? Problem title: Does anybody know a good documentation that compares different Scheme implementations? Tags: lisp, implementation, scheme, documentation Problem: Does anybody know a good documentation that compares different Sc...	Does anybody know a good documentation that compares different Scheme implementations? Does anybody know a good documentation that compares different Scheme implementations? lisp implementation scheme documentation Does Scheme Does anybody know a good documentation that compares different Scheme implementations? I am l...	[ 0.0024871826171875, 0.017822265625, 0.0205078125, 0.01300048828125, -0.00173187255859375, 0.00531005859375, 0.000911712646484375, -0.020751953125, 0.00726318359375, 0.01007080078125, 0.0277099609375, 0.0048828125, -0.0196533203125, 0.00171661376953125, 0.0091552734375, -0.0189208984375...	[ 37873, 3714, 4127, 209806, 69101, 7, 12921, 34702, 282, 208124, 400, 7008, 150370, 101790, 16487, 225490, 197527, 10000, 14495, 53513, 133, 35978, 149016, 21771, 32316 ]	[ 0.0516357421875, 0.08270263671875, 0.08990478515625, 0.247802734375, 0.18603515625, 0.027679443359375, 0.138916015625, 0.207763671875, 0.2266845703125, 0.18896484375, 0.12298583984375, 0.232177734375, 0.22216796875, 0.09661865234375, 0.04046630859375, 0.1859130859375, 0.25830078125, ...	embed
31821799_c0	31821799	lisp	0	Title: scbl exception Heap exhausted during garbage collection Problem title: scbl exception Heap exhausted during garbage collection Tags: lisp, sbcl, common-lisp Problem: scbl exception Heap exhausted during garbage collection Welcome to LDB, a low-level debugger for the Lisp runtime environment. ldb> Any suggestion?...	scbl exception Heap exhausted during garbage collection scbl exception Heap exhausted during garbage collection lisp sbcl common-lisp Heap Gen StaPg UbSta LaSta LUbSt Boxed Unboxed LUB Alloc Waste Trig GCs Mem-age Total Dynamic-space-size GC-INHIBIT GC-PENDING STOP-FOR-GC-PENDING SBCL Welcome LDB Lisp scbl exception He...	[ 0.01556396484375, 0.0252685546875, -0.01397705078125, -0.0115966796875, -0.01092529296875, 0.0013275146484375, -0.007476806640625, 0.0225830078125, -0.003570556640625, -0.014404296875, 0.008544921875, 0.00084686279296875, 0.006866455078125, 0.00445556640625, 0.0181884765625, -0.0096435...	[ 9023, 9030, 131527, 1529, 2631, 146353, 297, 20271, 3671, 402, 42486, 400, 7008, 275, 34937, 39210, 4086, 254, 15937, 6512, 42378, 37455, 27271, 11728, 32338, 6652, 5282, 67, 4699, 69657, 17443, 4588, 33867, 73327, 65421, 62539, 21159, 65441,...	[ 0.08685302734375, 0.220947265625, 0.2335205078125, 0.193603515625, 0.1597900390625, 0.2420654296875, 0.093505859375, 0.101806640625, 0.055206298828125, 0.1575927734375, 0.210205078125, 0.06414794921875, 0.186279296875, 0.05450439453125, 0.18212890625, 0.0711669921875, 0.0732421875, ...	embed
20933307_c0	20933307	lisp	0	Title: Lisp - "case" macro implementation Problem title: Lisp - "case" macro implementation Tags: macros, lisp Problem: Lisp - "case" macro implementation I'm wondering how the case macro works, but just expanding it is not enough. How does it generate the cond statement without knowing how many arg...	Lisp - "case" macro implementation Lisp - "case" macro implementation macros lisp Lisp Lisp - "case" macro implementation I'm wondering how the case macro works, but just expanding it is not enough. How does it generate the cond statement without knowing how many arguments there are? Does it use a l...	[ 0.012451171875, 0.0380859375, -0.0283203125, 0.00179290771484375, 0.00958251953125, 0.01507568359375, 0.00019359588623046875, 0.008056640625, -0.002197265625, -0.024658203125, 0.007781982421875, -0.00083160400390625, 0.0031585693359375, -0.0186767578125, 0.0047607421875, 0.00830078125,...	[ 1261, 7008, 58437, 111789, 208124, 400, 149016, 3642, 7225, 43240, 1284, 71062, 20174, 11249, 139392, 158, 71, 63805, 15490, 141956, 5941, 10750, 4527, 40956, 15400, 959, 7639, 1257, 11675, 83613, 2940, 21373, 26458 ]	[ 0.1363525390625, 0.2374267578125, 0.239501953125, 0.2078857421875, 0.1500244140625, 0.07061767578125, 0.0662841796875, 0.0240478515625, 0.2347412109375, 0.12646484375, 0.00897216796875, 0.1383056640625, 0.0294952392578125, 0.0260162353515625, 0.135498046875, 0.1392822265625, 0.141845...	embed
9310913_c0	9310913	lisp	0	Title: how to get two elements from a list each time in common-lisp? Problem title: how to get two elements from a list each time in common-lisp? Tags: lisp, common-lisp Problem: how to get two elements from a list each time in common-lisp? For ((1 2) (3 4) (5 6)) , you can use loop for (a b) in '((1 2) (3 4) (5 6)) to...	how to get two elements from a list each time in common-lisp? how to get two elements from a list each time in common-lisp? lisp common-lisp a how to get two elements from a list each time in common-lisp? For ((1 2) (3 4) (5 6)) , you can use loop for (a b) in '((1 2) (3 4) (5 6)) to get a = 1, b = 2 each time. But for...	[ 0.0023193359375, 0.0022430419921875, -0.0048828125, 0.0089111328125, 0.01055908203125, 0.0281982421875, -0.0087890625, 0.01031494140625, 0.0011138916015625, -0.03466796875, 0.019287109375, 0.01007080078125, 0.0000762939453125, -0.00439453125, -0.00543212890625, -0.0091552734375, -0.0...	[ 3642, 47, 2046, 6626, 80854, 1295, 5303, 12638, 1733, 39210, 4086, 254, 23, 400, 7008, 10, 1326, 41600, 4958, 6896, 13956, 11516, 35914, 4527, 40956, 100, 876, 242, 2203, 106, 116, 138, 9790, 1022, 98, 7569, 3284, 42, 787, 11522 ]	[ 0.08465576171875, 0.054290771484375, 0.172119140625, 0.226318359375, 0.229248046875, 0.1278076171875, 0.2236328125, 0.177734375, 0.2327880859375, 0.1810302734375, 0.11962890625, 0.202392578125, 0.050140380859375, 0.09295654296875, 0.2015380859375, 0.0594482421875, 0.00128173828125, ...	embed
6081921_c0	6081921	lisp	0	Title: How do I pass arguments to map in emacs lisp? Problem title: How do I pass arguments to map in emacs lisp? Tags: emacs, lisp, elisp Problem: How do I pass arguments to map in emacs lisp? I want to write a small function to add a value to a list. it looks like this: (defvar fares '(31.14 28.12 25.10 22.08 19.06 1...	How do I pass arguments to map in emacs lisp? How do I pass arguments to map in emacs lisp? emacs lisp elisp How How do I pass arguments to map in emacs lisp? I want to write a small function to add a value to a list. it looks like this: (defvar fares '(31.14 28.12 25.10 22.08 19.06 16.04 13.02 10)) (defun plus-extra (...	[ 0.004669189453125, 0.01226806640625, -0.004913330078125, -0.0361328125, -0.018798828125, 0.0238037109375, -0.007080078125, 0.01397705078125, 0.0103759765625, -0.02587890625, -0.01171875, -0.00762939453125, -0.0164794921875, 0.03271484375, -0.0123291015625, -0.0216064453125, -0.009826...	[ 11249, 87, 27875, 10750, 7, 47, 22288, 23, 352, 2263, 400, 7008, 15296, 54, 3444, 33022, 19336, 32354, 15190, 34292, 5303, 33342, 1884, 112, 420, 1961, 4889, 5016, 2592, 12511, 1530, 11653, 963, 8892, 8318, 6529, 9016, 6849, 7709, 5847, ...	[ 0.09234619140625, 0.0165252685546875, 0.1729736328125, 0.282470703125, 0.1280517578125, 0.13134765625, 0.22900390625, 0.0706787109375, 0.1065673828125, 0.1571044921875, 0.1424560546875, 0.2353515625, 0.112060546875, 0.001312255859375, 0.034027099609375, 0.0899658203125, 0.09436035156...	embed
5022753_c0	5022753	lisp	0	Title: How do I tell if a list contains NILs? Problem title: How do I tell if a list contains NILs? Tags: common-lisp, lisp Problem: How do I tell if a list contains NILs? I have the following list: (X O X O X NIL X NIL O) If I do (find 'x (X O X O X NIL X NIL O)) it returns X , so I know the list contains X . But If I...	How do I tell if a list contains NILs? How do I tell if a list contains NILs? common-lisp lisp How NILs NIL How do I tell if a list contains NILs? I have the following list: If I do (find 'x (X O X O X NIL X NIL O)) it returns X , so I know the list contains X . But If I do (find nil (X O X O X NIL X NIL O)) I get NIL ...	[ -0.0169677734375, -0.0006256103515625, 0.0213623046875, -0.0005950927734375, -0.0037078857421875, 0.01116943359375, 0.035888671875, -0.0003204345703125, 0.00341796875, 0.0166015625, -0.002655029296875, -0.00787353515625, -0.004486083984375, -0.01031494140625, 0.0177001953125, 0.0178222...	[ 11249, 54, 87, 14192, 2174, 5303, 70541, 541, 16444, 7, 10, 39210, 4086, 254, 400, 7008, 765, 25632, 4263, 111607, 425, 1542, 1193, 180, 30646, 3714, 17324, 2046, 91084, 9393, 831, 91, 959 ]	[ 0.052734375, 0.040557861328125, 0.044525146484375, 0.16796875, 0.106201171875, 0.23486328125, 0.164794921875, 0.1607666015625, 0.22265625, 0.137939453125, 0.016693115234375, 0.107177734375, 0.053741455078125, 0.08447265625, 0.06719970703125, 0.10009765625, 0.007781982421875, 0.0176...	embed
68703818_c1	68703818	lisp	1	list, atom by atom.(ie. "(set x (* 5 2))") I designed it as described above assuming that C provides a built-in type() or isinstance() function that I could use in the eval function - to the best of my knowledge, it doesn't. How would I mimic the function of Python's isinstance() in C, so that I can compare types of v...	list, atom by atom.(ie. "(set x (* 5 2))") I designed it as described above assuming that C provides a built-in type() or isinstance() function that I could use in the eval function - to the best of my knowledge, it doesn't. How would I mimic the function of Python's isinstance() in C, so that I can compare types of v...	[ 0.00156402587890625, 0.0140380859375, 0.0228271484375, 0.02685546875, 0.004241943359375, 0.01708984375, 0.015625, 0.0042724609375, 0.00970458984375, -0.008056640625, 0.000278472900390625, -0.01470947265625, 0.01361083984375, -0.024658203125, -0.01483154296875, 0.00885009765625, 0.000...	[ 5303, 34627, 390, 478, 3509, 1022, 75402, 190, 4958, 82775, 442, 151552, 66596, 313, 87344, 88303, 73, 10644, 132, 83, 116071, 32354, 4527, 28, 1405, 22027, 18, 11249, 2806, 324, 21068, 70, 145581, 23, 69101, 52895, 2292, 71, 6275, 1314, ...	[ 0.232666015625, 0.2039794921875, 0.1163330078125, 0.000518798828125, 0.1378173828125, 0.07666015625, 0.026092529296875, 0.0733642578125, 0.102294921875, 0.153564453125, 0.0185546875, 0.00225830078125, 0.04925537109375, 0.1859130859375, 0.07794189453125, 0.077880859375, 0.09130859375,...	embed
11748780_c0	11748780	lisp	0	Title: Is it possible something like lvalue of perl or setf of lisp in python? Problem title: Is it possible something like lvalue of perl or setf of lisp in python? Tags: lisp, lvalue, perl, python Problem: Is it possible something like lvalue of perl or setf of lisp in python? In lisp you can say: (setf (aref a 1) 5)...	Is it possible something like lvalue of perl or setf of lisp in python? Is it possible something like lvalue of perl or setf of lisp in python? lisp lvalue perl python Is it possible something like lvalue of perl or setf of lisp in python? In lisp you can say: In perl you can say: Is it possible something like this in ...	[ 0.01068115234375, 0.01611328125, 0.02587890625, -0.00148773193359375, -0.003173828125, -0.01373291015625, -0.01214599609375, -0.00445556640625, 0.01507568359375, -0.01446533203125, 0.0177001953125, 0.03466796875, 0.006927490234375, -0.0223388671875, -0.0020904541015625, -0.0361328125, ...	[ 7722, 9844, 1884, 96, 27494, 13, 117, 141, 5423, 420, 400, 7008, 23, 17198, 50828, 442, 111, 707, 5154, 360, 831, 2071, 903, 4527, 32354, 16750, 237, 30388, 95486, 41018 ]	[ 0.197998046875, 0.1019287109375, 0.1346435546875, 0.146240234375, 0.28125, 0.176025390625, 0.16015625, 0.2083740234375, 0.139892578125, 0.2093505859375, 0.14404296875, 0.2296142578125, 0.060150146484375, 0.10186767578125, 0.1651611328125, 0.08935546875, 0.0372314453125, 0.000274658...	embed
22876099_c1	22876099	lisp	1	h z t)))" Either works for me. What my current working grammar does is take (f x (g y (h z t))) and output "(f x (g y (h z t)))" While it is trivial to allow for just one newline character after every "Token" or "Tuple", I wish to accept the following as legal code: (f x (g y ( h z t) ) ) Code signals: Parser, Start, L...	h z t)))" Either works for me. What my current working grammar does is take (f x (g y (h z t))) and output "(f x (g y (h z t)))" While it is trivial to allow for just one newline character after every "Token" or "Tuple", I wish to accept the following as legal code: (f x (g y ( h z t) ) ) Code signals: Parser, Start, L...	[ 0.009033203125, 0.0115966796875, -0.020751953125, 0.032958984375, -0.01055908203125, 0.0211181640625, 0.00958251953125, 0.00010824203491210938, 0.0235595703125, -0.0118408203125, -0.0093994140625, 0.000263214111328125, -0.019775390625, 0.003265380859375, -0.013671875, 0.0115966796875, ...	[ 1096, 97, 808, 32149, 4565, 9319, 43240, 100, 163, 4865, 759, 43581, 20697, 122092, 147, 14602, 5646, 420, 1022, 177, 113, 127, 140992, 686, 63769, 1660, 1632, 3525, 2256, 62816, 7103, 11907, 7763, 1098, 707, 15665, 8705, 32599, 26946, 25...	[ 0.1241455078125, 0.1424560546875, 0.1842041015625, 0.1788330078125, 0.0256500244140625, 0.165771484375, 0.1177978515625, 0.067626953125, 0.07379150390625, 0.001953125, 0.0279998779296875, 0.104736328125, 0.1319580078125, 0.203857421875, 0.1483154296875, 0.0206756591796875, 0.10131835...	embed
9595519_c0	9595519	lisp	0	Title: Why is it necessary to put #' in some cases in Lisp? Problem title: Why is it necessary to put #' in some cases in Lisp? Tags: lisp, syntax Problem: Why is it necessary to put #' in some cases in Lisp? Possible Duplicate: What does # mean in LISP I am learning lisp, but one thing I do not understand is...	Why is it necessary to put #' in some cases in Lisp? Why is it necessary to put #' in some cases in Lisp? lisp syntax Why Lisp Why is it necessary to put #' in some cases in Lisp? I am learning lisp, but one thing I do not understand is why it is necessary for #' to be used. If a function with a specific name...	[ -0.0021820068359375, 0.024658203125, 0.00347900390625, -0.010009765625, 0.001678466796875, 0.01141357421875, -0.00052642822265625, 0.03076171875, 0.01123046875, -0.03466796875, 0.0020599365234375, 0.004241943359375, 0.007476806640625, -0.01708984375, 0.00341796875, 0.000637054443359375...	[ 44084, 83, 442, 63559, 3884, 468, 3768, 74, 3060, 50218, 23, 1261, 7008, 47, 54764, 400, 6002, 86531, 25, 28219, 15400, 100, 11814, 32354, 678, 29458, 9351, 32316, 5351, 6863, 10, 77336 ]	[ 0.122802734375, 0.029571533203125, 0.0290069580078125, 0.1759033203125, 0.10589599609375, 0.158203125, 0.122802734375, 0.0369873046875, 0.043853759765625, 0.08294677734375, 0.059539794921875, 0.1458740234375, 0.2139892578125, 0.0172576904296875, 0.012359619140625, 0.09423828125, 0.01...	embed
5833471_c1	5833471	lisp	1	the goal state. The graph I am using looks like this: (a (b 3) (c 1)) (b (a 3) (d 1)) I have a conversion function to make this work with the above BFS implementation, but now I need to turn this into Hill climbing using this graph format. I'm just not sure where to begin, and have been trying things to no avail. I kn...	the goal state. The graph I am using looks like this: (a (b 3) (c 1)) (b (a 3) (d 1)) I have a conversion function to make this work with the above BFS implementation, but now I need to turn this into Hill climbing using this graph format. I'm just not sure where to begin, and have been trying things to no avail. I kn...	[ 0.01708984375, 0.022705078125, 0.004791259765625, 0.0120849609375, -0.01507568359375, 0.018310546875, -0.0211181640625, -0.0301513671875, -0.00872802734375, -0.00592041015625, 0.0130615234375, -0.01153564453125, 0.00946044921875, -0.00018215179443359375, -0.0115966796875, -0.0157470703...	[ 70, 69236, 11341, 41382, 17368, 33342, 1884, 903, 275, 8439, 4879, 71, 142477, 32354, 4488, 36917, 335, 36381, 208124, 3871, 15504, 3934, 37639, 194637, 214, 9384, 959, 9077, 9842, 31577, 8966, 110, 15549, 71062, 944, 13388, 20903, 271, 112...	[ 0.039459228515625, 0.2744140625, 0.21142578125, 0.25341796875, 0.1234130859375, 0.1331787109375, 0.0755615234375, 0.052154541015625, 0.025482177734375, 0.1011962890625, 0.042999267578125, 0.06817626953125, 0.1666259765625, 0.1749267578125, 0.0594482421875, 0.012115478515625, 0.057434...	embed
25013390_c0	25013390	lisp	0	Title: creating assoc function in lisp that will find value from a-list Problem title: creating assoc function in lisp that will find value from a-list Tags: lisp, common-lisp Problem: creating assoc function in lisp that will find value from a-list How can i create an assoc function that can find value from a-list. Ca...	creating assoc function in lisp that will find value from a-list creating assoc function in lisp that will find value from a-list lisp common-lisp a-list creating assoc function in lisp that will find value from a-list How can i create an assoc function that can find value from a-list. Can anyone help me on this as i d...	[ 0.009033203125, 0.005218505859375, -0.01470947265625, -0.00360107421875, -0.0011749267578125, 0.00347900390625, 0.01190185546875, 0.0157470703125, 0.026123046875, -0.0322265625, -0.01202392578125, -0.00482177734375, -0.000949859619140625, -0.023681640625, 0, -0.00127410888671875, 0.0...	[ 105233, 63927, 238, 32354, 23, 400, 7008, 450, 1221, 7413, 34292, 1295, 10, 6562, 39210, 4086, 254, 9, 831, 17, 28282, 142, 35672, 4358, 903, 3642, 43240, 3525, 191147, 98363, 98441, 21771, 26484, 70 ]	[ 0.155517578125, 0.211669921875, 0.232421875, 0.2449951171875, 0.05841064453125, 0.1348876953125, 0.204833984375, 0.02899169921875, 0.0135498046875, 0.166259765625, 0.2276611328125, 0.1407470703125, 0.095703125, 0.251220703125, 0.10888671875, 0.1136474609375, 0.14794921875, 0.057403...	embed
40985457_c0	40985457	lisp	0	Title: Common Lisp: flush standard output Problem title: Common Lisp: flush standard output Tags: common-lisp, lisp, stdout Problem: Common Lisp: flush standard output Trying to learn lisp (and I guess emacs along with it). I was wondering how you would go about clearing the output and replacing it. Could be in a LISP ...	Common Lisp: flush standard output Common Lisp: flush standard output common-lisp lisp stdout Common Lisp sys.stdout.write sys.stdout.flush Common Lisp: flush standard output Trying to learn lisp (and I guess emacs along with it). I was wondering how you would go about clearing the output and replacing it. Could be in ...	[ 0.00299072265625, 0.0281982421875, -0.00634765625, -0.00396728515625, -0.036376953125, -0.0026702880859375, 0.01434326171875, -0.007537841796875, -0.00506591796875, 0.00335693359375, -0.0035858154296875, 0.0177001953125, -0.002197265625, -0.0026397705078125, -0.00653076171875, 0.000404...	[ 151301, 1261, 7008, 14838, 1495, 5570, 140992, 39210, 4086, 254, 400, 6138, 246, 1003, 954, 271, 18781, 18026, 30698, 352, 2263, 7, 149016, 1672, 34735, 214, 136, 133266, 442, 16970, 9434, 456, 2424, 373, 18234, 27255, 25632, 17198, 50828 ]	[ 0.1676025390625, 0.1766357421875, 0.1932373046875, 0.2247314453125, 0.1455078125, 0.199951171875, 0.2481689453125, 0.1456298828125, 0.1219482421875, 0.1495361328125, 0.1353759765625, 0.1029052734375, 0.0079345703125, 0.126708984375, 0.076904296875, 0.0999755859375, 0.00640869140625, ...	embed
28956010_c0	28956010	lisp	0	Title: SBCL Run Shell Command Problem title: SBCL Run Shell Command Tags: lisp, python, sbcl, shell, common-lisp Problem: SBCL Run Shell Command I've seen Executing a shell command from Common Lisp and its answers, but I'm still not sure whether SBCL provides a way execute shell commands from code. The SBCL Manual does...	SBCL Run Shell Command SBCL Run Shell Command lisp python sbcl shell common-lisp SBCL Run Shell Command SBCL Run Shell Command I've seen Executing a shell command from Common Lisp and its answers, but I'm still not sure whether SBCL provides a way execute shell commands from code. The SBCL Manual does support POSIX, bu...	[ 0.0086669921875, 0.01336669921875, 0.00131988525390625, 0.0224609375, -0.0002269744873046875, 0.021484375, 0.026611328125, -0.0184326171875, -0.0181884765625, -0.0069580078125, -0.0126953125, 0.04296875, -0.01092529296875, 0.0155029296875, -0.01483154296875, 0.00482177734375, -0.0063...	[ 90944, 37486, 28398, 108362, 123573, 400, 7008, 17198, 50828, 91, 275, 34937, 128019, 39210, 4086, 254, 51592, 211603, 75101, 1295, 151301, 1261, 35166, 7464, 9077, 87344, 3917, 71924, 18151, 111021, 8060, 54602, 21487, 156377, 4785, 77546, 173...	[ 0.1566162109375, 0.2340087890625, 0.09814453125, 0.2080078125, 0.241455078125, 0.0806884765625, 0.2166748046875, 0.04547119140625, 0.1112060546875, 0.0235137939453125, 0.096923828125, 0.2010498046875, 0.258056640625, 0.119873046875, 0.0865478515625, 0.1693115234375, 0.02093505859375,...	embed
7753858_c0	7753858	lisp	0	Title: Learning Lisp and artificial intelligence Problem title: Learning Lisp and artificial intelligence Tags: lisp, artificial-intelligence Problem: Learning Lisp and artificial intelligence This semester at college I have a course for Artificial Intelligence and we are studying Lisp. The problem is that I don't have...	Learning Lisp and artificial intelligence Learning Lisp and artificial intelligence lisp artificial-intelligence Learning Lisp Learning Lisp and artificial intelligence This semester at college I have a course for Artificial Intelligence and we are studying Lisp. The problem is that I don't have any functional programm...	[ 0.01287841796875, 0.0224609375, -0.006866455078125, 0.027099609375, -0.0184326171875, 0.0235595703125, -0.005340576171875, 0.009033203125, 0.0152587890625, -0.051513671875, 0.025390625, -0.01287841796875, -0.00830078125, 0.0203857421875, 0.0089111328125, -0.0054931640625, -0.01068115...	[ 114344, 1261, 7008, 136, 66733, 130687, 400, 49345, 99, 40466, 15411, 231996, 157075, 35187, 2967, 2301, 18, 2499, 123309, 56037, 449, 76615, 3714, 180, 20880, 156202, 74181, 47302, 67330, 4127, 42840, 2046, 163, 1257, 38352, 98 ]	[ 0.1468505859375, 0.2152099609375, 0.255859375, 0.09893798828125, 0.1533203125, 0.1910400390625, 0.153564453125, 0.0928955078125, 0.034576416015625, 0.152099609375, 0.0780029296875, 0.162109375, 0.188720703125, 0.0687255859375, 0.1253662109375, 0.029571533203125, 0.053070068359375, ...	embed
65588066_c0	65588066	lisp	0	Title: Applying append on mapcon in Lisp Problem title: Applying append on mapcon in Lisp Tags: common-lisp, functional-programming, map-function, lisp Problem: Applying append on mapcon in Lisp The Lisp function G is defined by: (defun g (l) (mapcon #'list l)) What is the result of evaluating the form (apply #'append ...	Applying append on mapcon in Lisp Applying append on mapcon in Lisp common-lisp functional-programming map-function lisp Applying Lisp Applying append on mapcon in Lisp I've seen that mapcon works with nconc and cdr , but the final answer will be (1 2 2 2) and I don't know how to properly explain it. Please help.	[ -0.0032806396484375, 0.00787353515625, 0.0216064453125, 0.0086669921875, -0.00244140625, 0.01031494140625, 0.00003838539123535156, 0.0164794921875, 0.01190185546875, -0.0157470703125, 0.0096435546875, -0.015869140625, -0.0186767578125, 0.0205078125, -0.0017852783203125, 0.004150390625,...	[ 5659, 538, 214, 114689, 71, 98, 22288, 2271, 23, 1261, 7008, 39210, 4086, 254, 123309, 28966, 137175, 400, 51592, 43240, 678, 653, 238, 136, 56329, 42, 2704, 35166, 2858, 116, 4958, 155965, 73342, 442, 4358 ]	[ 0.1357421875, 0.11492919921875, 0.0657958984375, 0.207763671875, 0.1905517578125, 0.1314697265625, 0.2100830078125, 0.26318359375, 0.07244873046875, 0.1680908203125, 0.2340087890625, 0.079345703125, 0.1085205078125, 0.171630859375, 0.13720703125, 0.07489013671875, 0.1353759765625, ...	embed
58424422_c2	58424422	lisp	2	:NAMED-LAMBDA ; ==> ; #'(SB-INT:NAMED-LAMBDA FIXNUMTEST ; (I J) ; (DECLARE (SB-C::TOP-LEVEL-FORM)) ; (DECLARE (TYPE FIXNUM I J)) ; (BLOCK FIXNUMTEST ; (LET* ((N #) (N+1 #)) ; (DECLARE (TYPE FIXNUM N N+1)) ; (/ 1.0d0 (THE FIXNUM #))))) ; ; note: doing float to pointer coercion (cost 13) to "<return value>" Code signals:...	:NAMED-LAMBDA ; ==> ; #'(SB-INT:NAMED-LAMBDA FIXNUMTEST ; (I J) ; (DECLARE (SB-C::TOP-LEVEL-FORM)) ; (DECLARE (TYPE FIXNUM I J)) ; (BLOCK FIXNUMTEST ; (LET* ((N #) (N+1 #)) ; (DECLARE (TYPE FIXNUM N N+1)) ; (/ 1.0d0 (THE FIXNUM #))))) ; ; note: doing float to pointer coercion (cost 13) to "<return value>" Code signals:...	[ 0.01165771484375, 0.015625, -0.0022735595703125, 0.006927490234375, 0.0169677734375, -0.00909423828125, 0.00186920166015625, -0.01397705078125, 0.009765625, 0.007110595703125, -0.002471923828125, -0.043701171875, 0.00101470947265625, -0.013671875, 0.02392578125, -0.0030975341796875, ...	[ 152, 182512, 397, 94202, 571, 6538, 2819, 69112, 468, 25, 36474, 59537, 563, 21487, 109020, 618, 21828, 568, 821, 8399, 37486, 9, 441, 70675, 15300, 51442, 98533, 27143, 21907, 87, 124448, 27089, 839, 21748, 541, 53855, 71, 2389, 120363, ...	[ 0.015960693359375, 0.1851806640625, 0.1220703125, 0.1318359375, 0.1029052734375, 0.174560546875, 0.0270233154296875, 0.09423828125, 0.04925537109375, 0.0143280029296875, 0.1224365234375, 0.1417236328125, 0.130126953125, 0.173583984375, 0.1824951171875, 0.1290283203125, 0.226684570312...	embed
1597355_c0	1597355	lisp	0	Title: Why are parenscript functions changed to all lowercase? Problem title: Why are parenscript functions changed to all lowercase? Tags: lisp, case Problem: Why are parenscript functions changed to all lowercase? When using parenscript if I execute (parenscript:ps (slot-value ($ "#mytextarea") 'selectionStart)) It p...	Why are parenscript functions changed to all lowercase? Why are parenscript functions changed to all lowercase? lisp case Why parenscript:ps Start Why are parenscript functions changed to all lowercase? When using parenscript if I execute It produces the javascript Note that selectionStart is now selectionstart . It lo...	[ -0.01129150390625, 0.00482177734375, 0.0023193359375, 0.001861572265625, -0.01458740234375, -0.01300048828125, 0.0244140625, -0.006866455078125, 0.002288818359375, 0.006561279296875, 0.018310546875, 0.02685546875, -0.015625, 0.0196533203125, 0.00927734375, -0.011962890625, 0.00259399...	[ 44084, 621, 366, 33, 32032, 32354, 98816, 47, 756, 92319, 58437, 400, 7008, 7225, 6423, 13794, 17368, 71924, 27489, 136951, 18622, 132216, 126597, 5036, 17137, 72856, 1407, 56, 159, 98, 13695, 10932 ]	[ 0.0975341796875, 0.01038360595703125, 0.11456298828125, 0.1258544921875, 0.263916015625, 0.2012939453125, 0.1439208984375, 0.0316162109375, 0.046600341796875, 0.1732177734375, 0.2021484375, 0.0506591796875, 0.129150390625, 0.155517578125, 0.121337890625, 0.1783447265625, 0.0528869628...	embed
42293624_c0	42293624	lisp	0	Title: How can I add a value stored in a variable to a list? Problem title: How can I add a value stored in a variable to a list? Tags: lisp Problem: How can I add a value stored in a variable to a list? For example: (setf s 2) s => 2 (setf list1 '(1 s 3 4)) list1 => (1 s 3 4) How do i get it to add the value stored in...	How can I add a value stored in a variable to a list? How can I add a value stored in a variable to a list? lisp How list1 How can I add a value stored in a variable to a list? For example: How do i get it to add the value stored in s to the list? For this example I would want to use s to generate a list (1 2 3 4) I ha...	[ 0.0098876953125, 0.02001953125, -0.01025390625, -0.006256103515625, -0.0009765625, 0.005126953125, -0.013916015625, 0.020263671875, 0.005340576171875, -0.037841796875, 0.0228271484375, 0.005340576171875, -0.01123046875, 0.00122833251953125, 0.0108642578125, 0.00762939453125, -0.00897...	[ 11249, 831, 87, 15190, 10, 34292, 4343, 71, 23, 77336, 47, 5303, 400, 7008, 418, 54, 2046, 91, 27781, 3444, 4527, 139392, 2858, 116, 138, 13956, 12877, 16454, 3642, 903, 26458 ]	[ 0.1197509765625, 0.1085205078125, 0.06597900390625, 0.1968994140625, 0.064697265625, 0.23681640625, 0.20068359375, 0.1038818359375, 0.112548828125, 0.26904296875, 0.128662109375, 0.2440185546875, 0.094482421875, 0.1732177734375, 0.0273590087890625, 0.03961181640625, 0.027938842773437...	embed
4657798_c0	4657798	lisp	0	Title: Copy/Yank entire Lisp form in Slime Problem title: Copy/Yank entire Lisp form in Slime Tags: emacs, lisp, slime Problem: Copy/Yank entire Lisp form in Slime Is there a way to copy/yank a whole a form in Slime/Emacs? For instance, if I have the following function: (myfunc (lst) (myotherfunc lst)) I'd like to yank...	Copy/Yank entire Lisp form in Slime Copy/Yank entire Lisp form in Slime emacs lisp slime Copy Yank Lisp Slime Copy/Yank entire Lisp form in Slime Is there a way to copy/yank a whole a form in Slime/Emacs? For instance, if I have the following function: I'd like to yank/copy: by issuing a keyboard shortcut when my curso...	[ -0.00084686279296875, 0.01434326171875, -0.0308837890625, 0.01055908203125, -0.031494140625, 0.0106201171875, 0.01165771484375, 0.020263671875, 0.0012664794921875, -0.0177001953125, 0.0233154296875, -0.010498046875, -0.038330078125, -0.006622314453125, 0.00384521484375, -0.002014160156...	[ 146930, 64, 72306, 92, 64194, 1261, 7008, 3173, 23, 82344, 13, 352, 2263, 400, 34264, 25970, 2685, 10, 3917, 47, 43658, 1643, 28271, 647, 35572, 25632, 32354, 1884, 151, 7570, 137366, 390, 1159, 149186, 16610, 19774, 3229, 13810, 42, 7343...	[ 0.229736328125, 0.06085205078125, 0.203857421875, 0.23876953125, 0.1817626953125, 0.1695556640625, 0.2332763671875, 0.26171875, 0.0947265625, 0.20263671875, 0.21484375, 0.04022216796875, 0.1138916015625, 0.09942626953125, 0.16943359375, 0.200439453125, 0.031585693359375, 0.05499267...	embed
8015766_c0	8015766	lisp	0	Title: Reading in a seqence from a text file in Common Lisp Problem title: Reading in a seqence from a text file in Common Lisp Tags: lisp, file Problem: Reading in a seqence from a text file in Common Lisp I want to read in a textfile and make it a sequence and pass it on. How do I do that? This is what I have so far:...	Reading in a seqence from a text file in Common Lisp Reading in a seqence from a text file in Common Lisp lisp file a Reading Common Lisp filename.txt Hello Reading in a seqence from a text file in Common Lisp I want to read in a textfile and make it a sequence and pass it on. How do I do that? This is what I have so f...	[ 0.02392578125, -0.00170135498046875, -0.003570556640625, 0.0302734375, 0.009765625, -0.01202392578125, 0.02001953125, 0.015869140625, -0.00836181640625, -0.0341796875, -0.01904296875, 0.0191650390625, -0.0302734375, -0.00174713134765625, 0.015869140625, -0.0078125, -0.0115966796875, ...	[ 104951, 23, 40, 864, 6620, 1295, 7986, 11435, 151301, 1261, 7008, 400, 10, 11627, 124326, 35378, 3444, 12301, 29822, 3249, 442, 944, 27875, 98, 11249, 54, 450, 765, 2060, 83, 1884, 903 ]	[ 0.2109375, 0.11328125, 0.0703125, 0.1151123046875, 0.13427734375, 0.09130859375, 0.1121826171875, 0.1617431640625, 0.149169921875, 0.1634521484375, 0.1629638671875, 0.12353515625, 0.00408935546875, 0.0977783203125, 0.2174072265625, 0.0635986328125, 0.06915283203125, 0.2110595703125...	embed
108169_c0	108169	lisp	0	Title: How do I take a slice of a list (A sublist) in scheme? Problem title: How do I take a slice of a list (A sublist) in scheme? Tags: scheme, lisp Problem: How do I take a slice of a list (A sublist) in scheme? Given a list, how would I select a new list, containing a slice of the original list (Given offset and nu...	How do I take a slice of a list (A sublist) in scheme? How do I take a slice of a list (A sublist) in scheme? scheme lisp How How do I take a slice of a list (A sublist) in scheme? Given a list, how would I select a new list, containing a slice of the original list (Given offset and number of elements) ? EDIT: Good sug...	[ -0.01312255859375, 0.01214599609375, 0.011962890625, 0.004638671875, -0.0242919921875, -0.01324462890625, -0.024169921875, 0.0074462890625, 0.01104736328125, -0.004791259765625, 0.0019989013671875, -0.020751953125, -0.02490234375, -0.0031585693359375, -0.015869140625, -0.021240234375, ...	[ 11249, 54, 87, 5646, 91, 13348, 111, 5303, 1614, 6562, 23, 150370, 284, 400, 7008, 10, 77878, 3642, 36849, 3525, 70541, 214, 7311, 5773, 3509, 14012, 80854, 157666, 58735, 22724, 20531, 144285, 29479, 38937, 1760 ]	[ 0.09771728515625, 0.043609619140625, 0.054443359375, 0.1866455078125, 0.1060791015625, 0.23583984375, 0.0958251953125, 0.2178955078125, 0.1981201171875, 0.25, 0.0701904296875, 0.25732421875, 0.04827880859375, 0.060394287109375, 0.1566162109375, 0.031768798828125, 0.0225067138671875, ...	embed
19756296_c0	19756296	lisp	0	Title: What's the difference between write, print, pprint, princ, and prin1? Problem title: What's the difference between write, print, pprint, princ, and prin1? Tags: printing, output, lisp, common-lisp Problem: What's the difference between write, print, pprint, princ, and prin1? I'm getting into some Lisp,...	What's the difference between write, print, pprint, princ, and prin1? What's the difference between write, print, pprint, princ, and prin1? printing output lisp common-lisp What prin1 What's the difference between write, print, pprint, princ, and prin1? I'm getting into some Lisp, and I've come across various...	[ -0.01904296875, -0.00022029876708984375, -0.01300048828125, 0.0281982421875, 0.00421142578125, 0.019775390625, 0.005645751953125, -0.0026092529296875, 0.00390625, 0.0198974609375, -0.000576019287109375, -0.0125732421875, 0.014892578125, 0.00031280517578125, -0.003082275390625, 0.003540...	[ 4865, 3768, 70, 60212, 17721, 33022, 28412, 915, 35662, 2448, 238, 136, 418, 1916, 140992, 400, 7008, 39210, 4086, 254, 1261, 12921, 32354, 108975, 20594, 5701, 13580, 47, 130250 ]	[ 0.024658203125, 0.04541015625, 0.062255859375, 0.205078125, 0.100830078125, 0.190185546875, 0.221923828125, 0.0760498046875, 0.2279052734375, 0.1954345703125, 0.113525390625, 0.01898193359375, 0.079833984375, 0.04840087890625, 0.140869140625, 0.06817626953125, 0.181396484375, 0.078...	embed
56862882_c0	56862882	lisp	0	Title: Built in Binary Conversion in Scheme/Lisp Problem title: Built in Binary Conversion in Scheme/Lisp Tags: lisp, scheme Problem: Built in Binary Conversion in Scheme/Lisp Is there a built in binary to decimal conversion function in Scheme? I've found the built in number->string conversion which can convert binary ...	Built in Binary Conversion in Scheme/Lisp Built in Binary Conversion in Scheme/Lisp lisp scheme Built Binary Conversion Scheme Lisp Built in Binary Conversion in Scheme/Lisp Is there a built in binary to decimal conversion function in Scheme? I've found the built in number->string conversion which can convert binary to...	[ -0.0072021484375, 0.021728515625, 0.0011138916015625, 0.0274658203125, -0.009033203125, 0.0220947265625, -0.03271484375, -0.01055908203125, 0.000335693359375, 0.0013580322265625, -0.005096435546875, -0.029541015625, -0.017578125, 0.00872802734375, 0.01519775390625, -0.0145263671875, ...	[ 667, 24908, 23, 54092, 1294, 1657, 46354, 34702, 282, 9506, 7008, 400, 150370, 1261, 2071, 2685, 10, 88303, 2394, 6635, 47, 32380, 2749, 142477, 32354, 14037, 14012, 103607, 91693, 831, 96760, 3173, 198274, 79315, 2606, 1297, 22027, 18, 675...	[ 0.0721435546875, 0.1300048828125, 0.1473388671875, 0.1890869140625, 0.139892578125, 0.06072998046875, 0.1409912109375, 0.153564453125, 0.1593017578125, 0.0601806640625, 0.1507568359375, 0.03216552734375, 0.129150390625, 0.0621337890625, 0.00897216796875, 0.03594970703125, 0.019348144...	embed
11821423_c0	11821423	lisp	0	Title: Why isn't let* the default let? Problem title: Why isn't let* the default let? Tags: lisp, emacs, elisp Problem: Why isn't let* the default let? As probably all experienced elispers have found at some point, code like is broken: (let ((a 3) (b 4) (c (+ a b))) c) One should use the let* form instead whe...	Why isn't let* the default let? Why isn't let* the default let? lisp emacs elisp Why Why isn't let* the default let? As probably all experienced elispers have found at some point, code like is broken: One should use the let* form instead when referring to a just-binded variable within the binding clauses. I j...	[ -0.002838134765625, 0.005462646484375, 0.00933837890625, 0.0018768310546875, -0.00506591796875, 0.00164794921875, -0.01177978515625, -0.0179443359375, 0.00323486328125, -0.013671875, -0.0029144287109375, -0.0059814453125, -0.00110626220703125, 0.031005859375, -0.004669189453125, -0.015...	[ 44084, 56112, 3768, 18, 2633, 1639, 70, 114977, 400, 7008, 2263, 15296, 164, 21777, 18151, 1884, 148431, 4527, 3173, 64457, 15005, 1660, 89817, 77336, 28032, 128239, 70731, 15400, 44691, 123166, 10512, 218873, 11343 ]	[ 0.1048583984375, 0.1077880859375, 0.040740966796875, 0.133544921875, 0.210205078125, 0.204345703125, 0.05413818359375, 0.25732421875, 0.0408935546875, 0.12158203125, 0.050506591796875, 0.0325927734375, 0.02374267578125, 0.06622314453125, 0.1302490234375, 0.04986572265625, 0.132568359...	embed
3887899_c0	3887899	lisp	0	Title: How to interpret full programs in Ready Lisp? Problem title: How to interpret full programs in Ready Lisp? Tags: installation, lisp, ready Problem: How to interpret full programs in Ready Lisp? I've just downloaded Ready Lisp and am playing around with the REPL. What I want to know is, how do I write a long prog...	How to interpret full programs in Ready Lisp? How to interpret full programs in Ready Lisp? installation lisp ready How Ready Lisp How to interpret full programs in Ready Lisp? I've just downloaded Ready Lisp and am playing around with the REPL. What I want to know is, how do I write a long program, interpret it and ge...	[ -0.0064697265625, 0.0062255859375, 0.00145721435546875, 0.0284423828125, -0.0263671875, 0.018798828125, 0.0240478515625, -0.006072998046875, -0.00457763671875, -0.0289306640625, -0.0010223388671875, -0.00848388671875, -0.03759765625, -0.010498046875, 0.01544189453125, -0.01397705078125...	[ 11249, 47, 29481, 4393, 103391, 23, 4764, 53, 1261, 7008, 59720, 400, 43542, 7026, 75169, 10932, 9069, 21130, 3714, 3642, 33022, 4989, 1528, 442, 2046, 140992, 27026, 34702, 282, 1884, 12877, 16454 ]	[ 0.090576171875, 0.066162109375, 0.262939453125, 0.1790771484375, 0.2310791015625, 0.0799560546875, 0.15966796875, 0.1480712890625, 0.1695556640625, 0.210205078125, 0.1253662109375, 0.112060546875, 0.1807861328125, 0.07373046875, 0.032470703125, 0.000762939453125, 0.07196044921875, ...	embed
12990296_c2	12990296	lisp	2	-in? x (car y)) (cond ((eq? (length y) 1) #f) (#t (is-in? x (cdr y))) ))) (#t #f) ) ) ) ) ) Update : What I want is to have a general function, which can tell you if some object is inside another object . I name entities object to emphasize that the function should work with any input values, simple or complicated like...	-in? x (car y)) (cond ((eq? (length y) 1) #f) (#t (is-in? x (cdr y))) ))) (#t #f) ) ) ) ) ) Update : What I want is to have a general function, which can tell you if some object is inside another object . I name entities object to emphasize that the function should work with any input values, simple or complicated like...	[ -0.011474609375, 0.0289306640625, 0.00186920166015625, 0.00021839141845703125, -0.00994873046875, 0.0206298828125, -0.0036468505859375, -0.005462646484375, 0.007598876953125, -0.036865234375, 0.00823974609375, -0.01361083984375, -0.00836181640625, -0.01409912109375, 0.005401611328125, ...	[ 20, 73, 32, 1022, 3284, 113, 2271, 71, 864, 23986, 927, 4879, 420, 18, 164, 7569, 32149, 4865, 3444, 47, 765, 4537, 32354, 831, 14192, 398, 2174, 3060, 36746, 83, 46132, 15700, 9351, 77630, 2449, 14612, 62539, 5608, 4488, 2499, 107730, ...	[ 0.055419921875, 0.29296875, 0.06689453125, 0.111572265625, 0.227783203125, 0.11083984375, 0.053497314453125, 0.0411376953125, 0.1146240234375, 0.0255279541015625, 0.003326416015625, 0.041107177734375, 0.078369140625, 0.031402587890625, 0.207763671875, 0.1422119140625, 0.0038757324218...	embed
24310928_c0	24310928	lisp	0	Title: LISP - what does CONS need to work? Problem title: LISP - what does CONS need to work? Tags: common-lisp, cons, environment, function, lisp Problem: LISP - what does CONS need to work? I had this question in an exam, how would you solve it? CONS is a fundamental Common Lisp function. Which functionality must the...	LISP - what does CONS need to work? LISP - what does CONS need to work? common-lisp cons environment function lisp LISP CONS LISP - what does CONS need to work? I had this question in an exam, how would you solve it? CONS is a fundamental Common Lisp function. Which functionality must the Common Lisp environment provid...	[ -0.000431060791015625, 0.0252685546875, 0.0015411376953125, 0.01409912109375, 0.000789642333984375, 0.0172119140625, -0.00933837890625, 0.0115966796875, 0.02294921875, -0.016845703125, 0.013427734375, -0.01483154296875, -0.01190185546875, 0.017822265625, -0.002227783203125, 0.011474609...	[ 16970, 9434, 20, 2367, 14602, 109022, 3871, 47, 4488, 39210, 4086, 254, 158, 7, 65998, 32354, 400, 7008, 9655, 42276, 3642, 86869, 83, 10, 20531, 151301, 1261, 130078, 123309, 2481, 8110, 22691, 3249, 442, 2806, 53383, 903, 18151, 15490, ...	[ 0.1727294921875, 0.25439453125, 0.029266357421875, 0.1566162109375, 0.1024169921875, 0.297607421875, 0.19580078125, 0.0833740234375, 0.1788330078125, 0.119140625, 0.1488037109375, 0.186279296875, 0.205322265625, 0.09954833984375, 0.18115234375, 0.19091796875, 0.143798828125, 0.2325...	embed
1838679_c0	1838679	lisp	0	Title: returning a lambda function in clisp, then evaluating it Problem title: returning a lambda function in clisp, then evaluating it Tags: common-lisp, lambda, lisp Problem: returning a lambda function in clisp, then evaluating it Suppose I have this wonderful function foo [92]> (defun foo () (lambda() 42)) FOO [93]...	returning a lambda function in clisp, then evaluating it returning a lambda function in clisp, then evaluating it common-lisp lambda lisp FOO LAMBDA NIL returning a lambda function in clisp, then evaluating it Suppose I have this wonderful function foo Now, suppose I want to actually use foo and return 42. How do I do ...	[ 0.0240478515625, 0.007232666015625, -0.00022029876708984375, -0.004302978515625, 0.00921630859375, 0.0036773681640625, 0.020263671875, 0.01806640625, -0.00107574462890625, -0.03271484375, -0.004150390625, -0.00653076171875, -0.00811767578125, -0.003387451171875, 0.004913330078125, -0.0...	[ 30646, 214, 21, 6492, 85, 32354, 23, 95701, 7008, 7068, 151575, 39210, 4086, 254, 400, 563, 30563, 3358, 12689, 6538, 541, 16444, 121691, 8364, 765, 903, 58867, 5775, 31, 139124, 3444, 20653, 4527, 136, 4828, 11249, 54, 26484, 26785, 6002...	[ 0.22265625, 0.039031982421875, 0.05450439453125, 0.1812744140625, 0.137451171875, 0.1949462890625, 0.0294342041015625, 0.1234130859375, 0.225341796875, 0.051666259765625, 0.161865234375, 0.08465576171875, 0.0675048828125, 0.1588134765625, 0.0721435546875, 0.0977783203125, 0.210815429...	embed
8163336_c0	8163336	lisp	0	Title: Why lists created with cons() and list() are shown differently? Problem title: Why lists created with cons() and list() are shown differently? Tags: lisp, list Problem: Why lists created with cons() and list() are shown differently? Why lists created with cons() and list() are shown differently despite the lists...	Why lists created with cons() and list() are shown differently? Why lists created with cons() and list() are shown differently? lisp list Why Why lists created with cons() and list() are shown differently? Why lists created with cons() and list() are shown differently despite the lists are equal? The first one shows it...	[ 0.004119873046875, 0.01141357421875, 0.0037994384765625, 0.007080078125, -0.0166015625, 0.005706787109375, -0.0093994140625, 0.0059814453125, 0.00054168701171875, 0.0157470703125, -0.00506591796875, -0.015869140625, 0.007110595703125, 0.0142822265625, -0.0223388671875, -0.018310546875,...	[ 44084, 5303, 7, 75935, 678, 158, 136, 132, 127887, 12921, 538, 400, 7008, 61518, 105950, 45831, 55769, 84797, 20633, 17932, 148, 64, 31, 64549, 80836, 5701, 1284 ]	[ 0.1151123046875, 0.23193359375, 0.1578369140625, 0.1138916015625, 0.07525634765625, 0.2164306640625, 0.10986328125, 0.05517578125, 0.151123046875, 0.1507568359375, 0.051483154296875, 0.0784912109375, 0.146484375, 0.044219970703125, 0.11328125, 0.0628662109375, 0.0863037109375, 0.10...	embed
54479461_c0	54479461	lisp	0	Title: Text replacement capability in clojure macros like C's #define Problem title: Text replacement capability in clojure macros like C's #define Tags: clojure, lisp, macros Problem: Text replacement capability in clojure macros like C's #define I want to write a macro (defmacro params [] 'a 'b 'c) that wil...	Text replacement capability in clojure macros like C's #define Text replacement capability in clojure macros like C's #define clojure lisp macros Text Text replacement capability in clojure macros like C's #define I want to write a macro that will be used in places like this If you see this could be easily do...	[ -0.0008392333984375, 0.01324462890625, -0.006378173828125, 0.0235595703125, -0.00946044921875, 0.01708984375, 0.0145263671875, -0.00457763671875, -0.000659942626953125, -0.0052490234375, -0.0128173828125, -0.0206298828125, -0.01043701171875, -0.0224609375, 0.0185546875, -0.017822265625...	[ 24129, 91995, 674, 3540, 41159, 20450, 461, 107, 111789, 313, 3768, 112, 64552, 400, 7008, 3444, 33022, 11814, 44677, 1884, 903, 1957, 5809, 72546, 16940, 7986, 30646, 238 ]	[ 0.207763671875, 0.21435546875, 0.0379638671875, 0.1396484375, 0.110595703125, 0.1300048828125, 0.154052734375, 0.0640869140625, 0.1888427734375, 0.14404296875, 0.043701171875, 0.0694580078125, 0.167724609375, 0.0677490234375, 0.1336669921875, 0.051666259765625, 0.060760498046875, 0...	embed
56351277_c1	56351277	lisp	1	DATA = NIL CLOSED = NIL DRAIN-READ-BUFFER = T ADDRESS = #<unbound slot> BUFFER = #S(FAST-IO:OUTPUT-BUFFER.. BUFFERINGP = NIL CONNECTED = T DIRECTION = :IN And the ADDRESS slot is surprisingly unbound... Has anybody encountered this problem? Code signals: How, Lisp, ADDRESS, Starting, as:tcp-server, as:write-socket-dat...	DATA = NIL CLOSED = NIL DRAIN-READ-BUFFER = T ADDRESS = #<unbound slot> BUFFER = #S(FAST-IO:OUTPUT-BUFFER.. BUFFERINGP = NIL CONNECTED = T DIRECTION = :IN And the ADDRESS slot is surprisingly unbound... Has anybody encountered this problem? Code signals: How, Lisp, ADDRESS, Starting, as:tcp-server, as:write-socket-dat...	[ 0.01336669921875, 0.033447265625, 0.0012664794921875, -0.015625, -0.00653076171875, 0.00958251953125, 0.017822265625, -0.0052490234375, -0.003936767578125, 0.0125732421875, -0.0023040771484375, -0.007171630859375, 0.01251220703125, 0.017822265625, 0.0123291015625, -0.00048828125, 0.0...	[ 391, 17758, 2203, 541, 16444, 92933, 17610, 28235, 48026, 41519, 15639, 919, 66804, 384, 19831, 23498, 64397, 309, 99091, 24897, 38209, 48963, 17780, 52001, 124599, 22013, 30110, 127674, 683, 14452, 91394, 66458, 233704, 40713, 8852, 83, 212615...	[ 0.058013916015625, 0.151611328125, 0.036102294921875, 0.14111328125, 0.16064453125, 0.15673828125, 0.06512451171875, 0.07635498046875, 0.0845947265625, 0.16162109375, 0.0279998779296875, 0.035186767578125, 0.2030029296875, 0.07366943359375, 0.050872802734375, 0.1466064453125, 0.17822...	embed
8475124_c0	8475124	lisp	0	Title: Negative infinity in Lisp Problem title: Negative infinity in Lisp Tags: fixnum, lisp Problem: Negative infinity in Lisp I'm looking for the standard way to represent negative infinity in Lisp. Is there a symblic value which is recognised by Lisp's arithmetic functions as less than all other numbers? Specificall...	Negative infinity in Lisp Negative infinity in Lisp fixnum lisp Negative Lisp Evaluates Negative infinity in Lisp I'm looking for the standard way to represent negative infinity in Lisp. Is there a symblic value which is recognised by Lisp's arithmetic functions as less than all other numbers? Specifically, I'm looking...	[ 0.005859375, -0.0087890625, 0.007293701171875, 0.00421142578125, -0.00689697265625, 0.0196533203125, 0.01318359375, -0.006256103515625, -0.000476837158203125, -0.0208740234375, -0.00689697265625, -0.0191650390625, 0.0029144287109375, 0.00165557861328125, 0.0196533203125, 0.013854980468...	[ 221717, 13, 54241, 53, 23, 1261, 7008, 30022, 2606, 400, 151228, 5570, 3917, 33636, 40907, 954, 6492, 9120, 34292, 75530, 8962, 32354, 40715, 101935, 27650, 33022, 25632 ]	[ 0.25244140625, 0.03826904296875, 0.1590576171875, 0.0777587890625, 0.05963134765625, 0.1612548828125, 0.2166748046875, 0.1175537109375, 0.11376953125, 0.1099853515625, 0.1058349609375, 0.1092529296875, 0.0148162841796875, 0.1295166015625, 0.235595703125, 0.046051025390625, 0.12280273...	embed
11218905_c0	11218905	lisp	0	Title: Is it possible to implement auto-currying to the Lisp-family languages? Problem title: Is it possible to implement auto-currying to the Lisp-family languages? Tags: lisp, clojure, common-lisp, scheme, currying Problem: Is it possible to implement auto-currying to the Lisp-family languages? That is, when you call...	Is it possible to implement auto-currying to the Lisp-family languages? Is it possible to implement auto-currying to the Lisp-family languages? lisp clojure common-lisp scheme currying Lisp-family Is it possible to implement auto-currying to the Lisp-family languages? That is, when you call a function with >1 arity wit...	[ 0.0130615234375, 0.01226806640625, 0.01129150390625, 0.000270843505859375, -0.0255126953125, 0.0242919921875, 0.0001850128173828125, -0.0047607421875, 0.0074462890625, -0.0206298828125, -0.004302978515625, -0.030517578125, -0.01348876953125, 0.004058837890625, -0.00885009765625, -0.028...	[ 7722, 29479, 1809, 64240, 38543, 47, 1261, 7008, 212122, 46876, 400, 20450, 461, 39210, 4086, 254, 150370, 198555, 214, 11782, 32354, 977, 418, 187, 2481, 678, 4734, 1632, 10750, 5608, 64457, 44116, 18499, 30646, 16750, 227204, 111789 ]	[ 0.166259765625, 0.15673828125, 0.2352294921875, 0.2156982421875, 0.188232421875, 0.0843505859375, 0.16064453125, 0.2083740234375, 0.1195068359375, 0.157470703125, 0.10565185546875, 0.056640625, 0.07080078125, 0.03814697265625, 0.1268310546875, 0.146728515625, 0.114501953125, 0.2653...	embed
16284820_c0	16284820	lisp	0	Title: how to programmatically create a regexp to match all the single char in a given string with elisp? Problem title: how to programmatically create a regexp to match all the single char in a given string with elisp? Tags: regex, lisp, emacs Problem: how to programmatically create a regexp to match all the single ch...	how to programmatically create a regexp to match all the single char in a given string with elisp? how to programmatically create a regexp to match all the single char in a given string with elisp? regex lisp emacs how to programmatically create a regexp to match all the single char in a given string with elisp? For ex...	[ -0.00799560546875, -0.0130615234375, -0.0203857421875, 0.0157470703125, -0.01220703125, 0.0225830078125, -0.006256103515625, 0.00701904296875, 0.0089111328125, -0.031494140625, -0.005523681640625, 0.006805419921875, -0.0126953125, 0.0034942626953125, -0.019287109375, -0.0101318359375, ...	[ 3642, 11720, 18, 71407, 28282, 6835, 83613, 14858, 756, 11001, 21441, 79315, 15296, 7008, 10, 47, 34475, 3355, 400, 352, 2263, 678, 1563, 71574, 4240, 177, 661, 831, 2055, 12638, 62816, 23, 2967, 5809, 5361, 124850, 5 ]	[ 0.05218505859375, 0.1622314453125, 0.0938720703125, 0.0653076171875, 0.16259765625, 0.1710205078125, 0.270751953125, 0.206787109375, 0.06585693359375, 0.1451416015625, 0.1732177734375, 0.207275390625, 0.107666015625, 0.2159423828125, 0.05755615234375, 0.012054443359375, 0.04077148437...	embed
42495198_c0	42495198	lisp	0	Title: How to push-back a vector in elisp Problem title: How to push-back a vector in elisp Tags: elisp, lisp Problem: How to push-back a vector in elisp I found some instructions to pushback with a vector using a function called vector-push , the problem is that I think it only works with common lisp. What if I want t...	How to push-back a vector in elisp How to push-back a vector in elisp elisp lisp How vector.push_back How to push-back a vector in elisp I found some instructions to pushback with a vector using a function called vector-push , the problem is that I think it only works with common lisp. What if I want to push to the bac...	[ 0.00799560546875, 0.040283203125, -0.0172119140625, 0.02001953125, -0.0028076171875, 0.020751953125, -0.007537841796875, -0.003326416015625, -0.000316619873046875, -0.037841796875, 0.007598876953125, 0.01104736328125, 0.00014400482177734375, 0.0030059814453125, -0.017333984375, -0.0131...	[ 11249, 47, 25944, 9, 12620, 173, 18770, 23, 15296, 7008, 10, 400, 7332, 127, 167934, 678, 32354, 2967, 4734, 43240, 39210, 3444, 4420, 16031, 313, 37223, 5154, 62766, 209806 ]	[ 0.0838623046875, 0.1473388671875, 0.2037353515625, 0.05242919921875, 0.272216796875, 0.19970703125, 0.240966796875, 0.0694580078125, 0.100341796875, 0.224365234375, 0.005157470703125, 0.0787353515625, 0.1611328125, 0.1513671875, 0.08612060546875, 0.099365234375, 0.1541748046875, 0....	embed
622785_c0	622785	lisp	0	Title: let vs def in clojure Problem title: let vs def in clojure Tags: lisp, let, function, clojure Problem: let vs def in clojure I want to make a local instance of a Java Scanner class in a clojure program. Why does this not work: ; gives me: count not supported on this type: Symbol (let s (new Scanner "a b c")) but...	let vs def in clojure let vs def in clojure lisp let function clojure Scanner Symbol let vs def in clojure I want to make a local instance of a Java Scanner class in a clojure program. Why does this not work: but it will let me create a global instance like this: I was under the impression that the only difference was ...	[ 0.0000743865966796875, 0.00299072265625, 0.000782012939453125, 0.028076171875, 0.0111083984375, 0.0118408203125, -0.01239013671875, 0.0162353515625, -0.006256103515625, -0.0096435546875, -0.01251220703125, -0.007354736328125, 0.0089111328125, 0.00836181640625, 0.01275634765625, -0.0092...	[ 2633, 20209, 8, 420, 20450, 461, 107, 23, 400, 7008, 32354, 65533, 1679, 131899, 3444, 3249, 4000, 110527, 41925, 18507, 1528, 44084, 14602, 959, 4488, 28282, 7964, 49128, 60212, 70820, 198371, 70, 17721, 136 ]	[ 0.23876953125, 0.16943359375, 0.1456298828125, 0.2034912109375, 0.13037109375, 0.140625, 0.09521484375, 0.0220184326171875, 0.050506591796875, 0.1475830078125, 0.11285400390625, 0.12359619140625, 0.130126953125, 0.163818359375, 0.02288818359375, 0.0199127197265625, 0.072509765625, ...	embed
19678906_c0	19678906	lisp	0	Title: How to modify this "make-matrix" function? Problem title: How to modify this "make-matrix" function? Tags: common-lisp, clisp, lisp Problem: How to modify this "make-matrix" function? Well, the flawed function is as follows: (defun make-matrix (n) (make-array (n n) :initial-element 0)) I want...	How to modify this "make-matrix" function? How to modify this "make-matrix" function? common-lisp clisp lisp How How to modify this "make-matrix" function? Well, the flawed function is as follows: I want to use functions like (make-matrix 8) to replace the longer (make-array '(8 8) :initial-element ...	[ -0.00872802734375, 0.0228271484375, 0.02392578125, -0.012451171875, 0.0185546875, -0.000125885009765625, -0.0098876953125, 0.02001953125, 0.00726318359375, -0.0228271484375, -0.01397705078125, -0.0179443359375, 0.004974365234375, -0.0233154296875, -0.0191650390625, -0.0137939453125, ...	[ 11249, 47, 2811, 40383, 903, 55898, 192, 87427, 41502, 32354, 39210, 4086, 254, 95701, 7008, 400, 9, 13034, 24243, 28960, 3444, 4527, 1884, 65034, 91995, 51713, 19305, 53, 1019, 943, 118, 62766, 757, 313, 67616, 683, 17378, 2685, 83, 10, ...	[ 0.09332275390625, 0.0297393798828125, 0.15185546875, 0.1536865234375, 0.0712890625, 0.1785888671875, 0.1461181640625, 0.2484130859375, 0.00213623046875, 0.20263671875, 0.14111328125, 0.08935546875, 0.1484375, 0.093017578125, 0.1632080078125, 0.0936279296875, 0.00360107421875, 0.132...	embed
36558678_c0	36558678	lisp	0	Title: Function in lisp that displays a list in a specific way Problem title: Function in lisp that displays a list in a specific way Tags: lisp, list Problem: Function in lisp that displays a list in a specific way I need to make a function in lisp that displays a list like this: (a b (c d) (e f g) h) -> (a b (c d) (e...	Function in lisp that displays a list in a specific way Function in lisp that displays a list in a specific way lisp list print1-lista Function in lisp that displays a list in a specific way I need to make a function in lisp that displays a list like this: So far i managed to make a function that displays a list like t...	[ 0.0024566650390625, 0.007415771484375, 0.00390625, 0.01422119140625, -0.00104522705078125, 0.01263427734375, -0.0068359375, -0.0037994384765625, -0.00579833984375, -0.026123046875, -0.0023040771484375, -0.02197265625, -0.0164794921875, -0.004547119140625, -0.0123291015625, 0.0101318359...	[ 28670, 10763, 23, 400, 7008, 450, 44116, 7, 5303, 29458, 3917, 28412, 20268, 16651, 10, 3871, 3249, 32354, 1884, 903, 2060, 145755 ]	[ 0.14208984375, 0.0728759765625, 0.0665283203125, 0.1343994140625, 0.2127685546875, 0.04034423828125, 0.1717529296875, 0.038543701171875, 0.2298583984375, 0.1611328125, 0.10626220703125, 0.1771240234375, 0.0986328125, 0.2381591796875, 0.0033206939697265625, 0.050872802734375, 0.020843...	embed
27307660_c0	27307660	lisp	0	Title: how to implement natural sort in common lisp? Problem title: how to implement natural sort in common lisp? Tags: lisp, common-lisp Problem: how to implement natural sort in common lisp? I tried to implement a natural sort: Break 21 [92]> (defparameter sss '("1.txt" "10.txt" "13.txt" "12.txt" "2.txt" "23.txt"))...	how to implement natural sort in common lisp? how to implement natural sort in common lisp? lisp common-lisp Break SSS how to implement natural sort in common lisp? I tried to implement a natural sort: Unfortunately, the code above does not work. Could someone help me to get a natural sort function?	[ 0.005523681640625, 0.004913330078125, -0.0026092529296875, 0.01190185546875, -0.0093994140625, -0.000946044921875, 0.000904083251953125, -0.01226806640625, 0.003875732421875, 0.0048828125, -0.0022430419921875, 0.0419921875, -0.021240234375, -0.006500244140625, 0.01458740234375, -0.0172...	[ 3642, 47, 29479, 6083, 12096, 23, 39210, 400, 7008, 4086, 254, 131904, 15268, 37842, 18151, 959, 4488, 32354 ]	[ 0.0523681640625, 0.0192718505859375, 0.1705322265625, 0.1787109375, 0.229736328125, 0.045745849609375, 0.150634765625, 0.11529541015625, 0.168701171875, 0.06842041015625, 0.1005859375, 0.08843994140625, 0.105224609375, 0.007350921630859375, 0.03570556640625, 0.0057525634765625, 0.023...	embed
36825871_c0	36825871	lisp	0	Title: Lparallel.queue thread-safe? Problem title: Lparallel.queue thread-safe? Tags: lisp, multithreading, queue, common-lisp, thread-safety Problem: Lparallel.queue thread-safe? I may not be looking in the correct location for the documentation of lparallel.queue , but can we assume that those queues are thread-safe ...	Lparallel.queue thread-safe? Lparallel.queue thread-safe? lisp multithreading queue common-lisp thread-safety Lparallel.queue Lparallel.queue thread-safe? I may not be looking in the correct location for the documentation of lparallel.queue , but can we assume that those queues are thread-safe and that the queues take ...	[ 0.0087890625, 0.00244140625, -0.012939453125, -0.0169677734375, -0.0098876953125, -0.019287109375, 0.026611328125, -0.021484375, -0.01214599609375, -0.0162353515625, 0.0007476806640625, 0.022216796875, 0.01043701171875, 0.0038909912109375, -0.0107421875, 0.0185546875, 0.0104370117187...	[ 339, 6276, 1229, 141, 944, 13388, 86997, 115840, 400, 7008, 3869, 65847, 41, 39210, 4086, 254, 939, 31913, 209806, 96, 5, 41591, 21049, 621, 9, 517, 56776, 214, 309, 21135, 61261, 38937, 12937 ]	[ 0.106201171875, 0.0989990234375, 0.1466064453125, 0.1148681640625, 0.125732421875, 0.1746826171875, 0.1893310546875, 0.192138671875, 0.062255859375, 0.134765625, 0.0806884765625, 0.102783203125, 0.139404296875, 0.046356201171875, 0.05279541015625, 0.1075439453125, 0.007720947265625, ...	embed
38507934_c0	38507934	lisp	0	Title: Alternative way to build a list until predicate is satisfied? Problem title: Alternative way to build a list until predicate is satisfied? Tags: racket, lisp Problem: Alternative way to build a list until predicate is satisfied? Here is my way of building a fibonacci sequence as a list whose values do not exceed...	Alternative way to build a list until predicate is satisfied? Alternative way to build a list until predicate is satisfied? racket lisp Alternative Alternative way to build a list until predicate is satisfied? Here is my way of building a fibonacci sequence as a list whose values do not exceed x : Is there another, may...	[ -0.0108642578125, 0.01446533203125, 0.000888824462890625, -0.0289306640625, -0.01104736328125, 0.0142822265625, 0.0106201171875, 0.0167236328125, 0.0164794921875, -0.032958984375, 0.0213623046875, 0.00201416015625, 0.0140380859375, 0.00141143798828125, 0.032470703125, 0.00482177734375,...	[ 103905, 3917, 45367, 5303, 24189, 1653, 2063, 67, 214521, 10, 673, 27853, 400, 7008, 83, 33976, 809, 20990, 52544, 40, 944, 3956, 237, 142424, 54, 959, 204839, 1022, 15700, 46622, 20594, 70751, 3066, 21, 3285, 54241 ]	[ 0.14013671875, 0.061309814453125, 0.18994140625, 0.2325439453125, 0.1258544921875, 0.1328125, 0.1705322265625, 0.078857421875, 0.1881103515625, 0.041168212890625, 0.0615234375, 0.1866455078125, 0.071533203125, 0.1658935546875, 0.032470703125, 0.15234375, 0.089111328125, 0.123779296...	embed
40455385_c0	40455385	lisp	0	Title: Using unit-testing for a procedure in Racket Problem title: Using unit-testing for a procedure in Racket Tags: lisp, dr.racket, unit-testing, racket Problem: Using unit-testing for a procedure in Racket If I call in Racket/Dr. Racket the following code: > add1 I get: #<procedure:add1> If I am using a library for...	Using unit-testing for a procedure in Racket Using unit-testing for a procedure in Racket lisp dr.racket unit-testing racket rackunit Using Racket add1 procedure:add1 dr.racket Using unit-testing for a procedure in Racket If I call in Racket/Dr. Racket the following code: I get: If I am using a library for unit-test ca...	[ -0.0164794921875, 0.019287109375, -0.01165771484375, 0.016357421875, -0.003936767578125, -0.0145263671875, -0.000698089599609375, -0.013916015625, -0.0084228515625, -0.034912109375, 0.0013275146484375, -0.00104522705078125, -0.005126953125, -0.0159912109375, 0.016845703125, -0.01434326...	[ 345, 25072, 6954, 214, 50491, 2552, 27853, 100, 7008, 3568, 219, 673, 28779, 6262, 217, 15190, 4028, 11782, 28928, 18151, 17368, 35773, 9790, 3034, 35782, 6002, 86531, 18499, 44084, 53383 ]	[ 0.023956298828125, 0.193603515625, 0.2327880859375, 0.1011962890625, 0.1468505859375, 0.10235595703125, 0.208740234375, 0.003662109375, 0.08551025390625, 0.046051025390625, 0.0712890625, 0.07208251953125, 0.1015625, 0.05120849609375, 0.189453125, 0.0540771484375, 0.054931640625, 0....	embed
31449110_c0	31449110	lisp	0	Title: LISP arithmetics implementation Problem title: LISP arithmetics implementation Tags: lisp, c, arithmetic-expressions Problem: LISP arithmetics implementation I'm making a toy lisp interpreter with D and I don't know the theory of Lisp very well. I was wondering if Lisp can implement basic arithmetic functions (+...	LISP arithmetics implementation LISP arithmetics implementation lisp c arithmetic-expressions LISP LISP arithmetics implementation I'm making a toy lisp interpreter with D and I don't know the theory of Lisp very well. I was wondering if Lisp can implement basic arithmetic functions (+, -, ×, ÷) by itself. Most Lisp/Sc...	[ 0.00040435791015625, 0.01544189453125, -0.00836181640625, 0.0113525390625, -0.00909423828125, 0.0174560546875, -0.00146484375, 0.01116943359375, -0.01324462890625, -0.0234375, 0.001922607421875, 0.002899169921875, -0.013671875, -0.00101470947265625, 0.01397705078125, -0.006011962890625...	[ 16970, 9434, 187, 8962, 282, 41637, 208124, 400, 7008, 501, 204629, 20662, 72713, 29481, 56, 678, 391, 3714, 154453, 1261, 149016, 831, 29479, 62822, 9523, 32354, 22183, 20, 34070, 83059, 68034, 17006, 25452, 12549, 220734, 88303, 313, 41925,...	[ 0.1549072265625, 0.2474365234375, 0.045623779296875, 0.166259765625, 0.1285400390625, 0.04510498046875, 0.1845703125, 0.1341552734375, 0.238525390625, 0.09747314453125, 0.153076171875, 0.01055908203125, 0.126953125, 0.1395263671875, 0.07379150390625, 0.03021240234375, 0.0906982421875...	embed
23303524_c0	23303524	lisp	0	Title: Why does this drop me into LDB in SBCL? Problem title: Why does this drop me into LDB in SBCL? Tags: sbcl, common-lisp, slime, lisp Problem: Why does this drop me into LDB in SBCL? This code drops me into the LDB in SBCL from SLIME but not the termial: (declaim (optimize debug)) ;; inhibit tail-call optimization...	Why does this drop me into LDB in SBCL? Why does this drop me into LDB in SBCL? sbcl common-lisp slime lisp Why LDB SBCL Why does this drop me into LDB in SBCL? This code drops me into the LDB in SBCL from SLIME but not the termial: Why does this crash SBCL from SLIME but not the terminal?	[ 0.01275634765625, 0.0155029296875, -0.0030975341796875, -0.0034027099609375, -0.03271484375, -0.007049560546875, -0.000591278076171875, 0.01025390625, 0.0027923583984375, -0.02783203125, 0.00653076171875, 0.005523681640625, 0.00408935546875, -0.00445556640625, 0.02490234375, 0.01434326...	[ 44084, 14602, 903, 36069, 163, 3934, 339, 39463, 23, 90944, 37486, 91, 275, 34937, 39210, 4086, 254, 34264, 13, 400, 7008, 18151, 7, 70, 1295, 42135, 66820, 959, 13579, 15403, 150631, 33949 ]	[ 0.10687255859375, 0.06634521484375, 0.05853271484375, 0.1439208984375, 0.045440673828125, 0.102783203125, 0.1158447265625, 0.240966796875, 0.06378173828125, 0.1468505859375, 0.24609375, 0.03448486328125, 0.0611572265625, 0.16845703125, 0.09954833984375, 0.0772705078125, 0.09875488281...	embed
28767387_c0	28767387	lisp	0	Title: Create an array of single-float from double-float in lisp? Problem title: Create an array of single-float from double-float in lisp? Tags: lisp, sbcl, common-lisp Problem: Create an array of single-float from double-float in lisp? When I try to create a single-float array like this, i get: (make-array 2 :element...	Create an array of single-float from double-float in lisp? Create an array of single-float from double-float in lisp? lisp sbcl common-lisp double-float Create SINGLE-FLOAT Create an array of single-float from double-float in lisp? When I try to create a single-float array like this, i get: , i get the following error:...	[ 0.0179443359375, 0.0198974609375, -0.018310546875, -0.0133056640625, -0.006317138671875, 0.01055908203125, -0.01409912109375, -0.0012664794921875, 0.006866455078125, 0.009521484375, -0.0225830078125, -0.03271484375, 0.001129150390625, -0.023681640625, -0.0089111328125, -0.0064697265625...	[ 151313, 10298, 53, 11001, 52347, 257, 1295, 41929, 400, 7008, 111, 23, 34937, 39210, 4086, 254, 72187, 126833, 919, 17014, 14609, 9790, 28282, 1884, 903, 17, 2046, 25632, 18499, 2685, 3917, 8781, 173, 18770 ]	[ 0.1285400390625, 0.1959228515625, 0.1705322265625, 0.1697998046875, 0.2283935546875, 0.1339111328125, 0.068115234375, 0.144775390625, 0.11572265625, 0.2154541015625, 0.0180511474609375, 0.0294952392578125, 0.07464599609375, 0.06939697265625, 0.06591796875, 0.1458740234375, 0.125, 0...	embed
47006222_c0	47006222	lisp	0	Title: LISP function which, given a number and a list, returns the first even number greater than n Problem title: LISP function which, given a number and a list, returns the first even number greater than n Tags: lisp, common-lisp Problem: LISP function which, given a number and a list, returns the first even number g...	LISP function which, given a number and a list, returns the first even number greater than n LISP function which, given a number and a list, returns the first even number greater than n lisp common-lisp LISP LISP function which, given a number and a list, returns the first even number greater than n I'm having trouble ...	[ -0.0177001953125, 0.0235595703125, 0.0030517578125, -0.0189208984375, 0.00151824951171875, 0.03125, 0.0067138671875, 0.0079345703125, -0.0024871826171875, -0.01611328125, 0.020263671875, -0.00083160400390625, -0.02099609375, -0.020751953125, 0.00799560546875, 0.0228271484375, -0.0111...	[ 16970, 9434, 32354, 3129, 34475, 14012, 136, 5303, 30646, 5117, 3853, 117396, 653, 3501, 400, 7008, 39210, 4086, 254, 63134, 90791, 18499, 13695, 6, 17324, 152 ]	[ 0.1466064453125, 0.253662109375, 0.195556640625, 0.0209197998046875, 0.08746337890625, 0.1427001953125, 0.070068359375, 0.1995849609375, 0.17431640625, 0.12274169921875, 0.221435546875, 0.10406494140625, 0.13037109375, 0.043212890625, 0.11773681640625, 0.2037353515625, 0.10009765625,...	embed
19968900_c0	19968900	lisp	0	Title: Why is elt not as common as car, cdr, first, rest? Problem title: Why is elt not as common as car, cdr, first, rest? Tags: common-lisp, lisp Problem: Why is elt not as common as car, cdr, first, rest? I see this a lot in examples I read in books and articles: (caddr something) Or the many variants of c***r com...	Why is elt not as common as car, cdr, first, rest? Why is elt not as common as car, cdr, first, rest? common-lisp lisp Why Why is elt not as common as car, cdr, first, rest? I see this a lot in examples I read in books and articles: (caddr something) Or the many variants of c***r commands. It seems a bit ridiculous t...	[ 0.01171875, -0.004913330078125, 0.004669189453125, -0.005035400390625, 0.0181884765625, 0.019287109375, 0.0003414154052734375, 0.0025634765625, 0.010009765625, -0.02099609375, 0.0025177001953125, -0.00958251953125, -0.0126953125, 0.002227783203125, -0.004302978515625, -0.0208740234375,...	[ 44084, 83, 88, 18, 959, 237, 39210, 2258, 42, 5117, 10588, 4086, 254, 400, 7008, 1957, 5915, 27781, 12301, 42840, 25426, 7569, 64113, 20117, 43047, 75101, 37202, 236873, 123019, 50065, 8966, 1810, 6704, 4958, 61353, 11814, 5045, 101805, 282...	[ 0.1373291015625, 0.083251953125, 0.110595703125, 0.2015380859375, 0.1368408203125, 0.08282470703125, 0.1795654296875, 0.1339111328125, 0.095458984375, 0.055084228515625, 0.1444091796875, 0.06817626953125, 0.146240234375, 0.05615234375, 0.1346435546875, 0.0167388916015625, 0.018768310...	embed
9284630_c0	9284630	lisp	0	Title: In clojure, map and stringify: make it simpler Problem title: In clojure, map and stringify: make it simpler Tags: lisp, clojure Problem: In clojure, map and stringify: make it simpler map and stringify I have this piece of clojure code: (def up (memfn toUpperCase)) (str "\n" (apply str (interpose "\n" (map up '...	In clojure, map and stringify: make it simpler In clojure, map and stringify: make it simpler lisp clojure In clojure, map and stringify: make it simpler map and stringify I have this piece of clojure code: The code does exactly what it is supposed to do: take a list of string, uppercase each one and envelop each one w...	[ -0.00909423828125, -0.005096435546875, 0.01129150390625, 0.01470947265625, -0.00579833984375, 0.01806640625, 0.015869140625, 0.006988525390625, 0.0142822265625, -0.01275634765625, -0.011474609375, -0.004058837890625, 0.0057373046875, 0.0166015625, -0.0025177001953125, -0.00445556640625...	[ 20450, 461, 107, 22288, 136, 79315, 40383, 3249, 442, 8781, 42, 400, 7008, 765, 903, 63847, 18151, 14602, 66161, 2367, 134598, 54, 5646, 5303, 1407, 56, 58437, 12638, 1632, 197118, 678, 41872, 19, 38893, 8108, 7103, 8110, 3917, 33022, 23,...	[ 0.143798828125, 0.1627197265625, 0.125732421875, 0.1793212890625, 0.07489013671875, 0.242919921875, 0.21337890625, 0.0714111328125, 0.0802001953125, 0.17626953125, 0.1143798828125, 0.08697509765625, 0.1572265625, 0.00543212890625, 0.062744140625, 0.04522705078125, 0.181396484375, 0...	embed
6694695_c0	6694695	lisp	0	Title: Most idiomatic way of replacing a list subsection in Lisp Problem title: Most idiomatic way of replacing a list subsection in Lisp Tags: lisp, common-lisp, list, replace Problem: Most idiomatic way of replacing a list subsection in Lisp What is the best way of replacing a specific subsequence of a list? Say I wa...	Most idiomatic way of replacing a list subsection in Lisp Most idiomatic way of replacing a list subsection in Lisp lisp common-lisp list replace Most Lisp HUNGRY Most idiomatic way of replacing a list subsection in Lisp What is the best way of replacing a specific subsequence of a list? Say I wanted to replace the sub...	[ -0.02392578125, 0.0286865234375, 0.01116943359375, 0.0032806396484375, -0.01025390625, 0.0107421875, -0.0118408203125, 0.00677490234375, 0.016357421875, 0.02392578125, 0.0130615234375, 0.021484375, 0.0067138671875, -0.00125885009765625, 0.002716064453125, -0.006683349609375, 0.012878...	[ 17006, 49666, 9523, 3917, 111, 456, 133266, 214, 5303, 1614, 7, 58994, 23, 1261, 7008, 400, 39210, 4086, 254, 91995, 19229, 34388, 2965, 29458, 184, 944, 36663, 39, 28, 678, 142, 17, 44057, 9149, 3293, 4552, 21373, 32354, 161740, 13 ]	[ 0.111572265625, 0.160888671875, 0.11370849609375, 0.0919189453125, 0.0182647705078125, 0.087158203125, 0.164306640625, 0.0555419921875, 0.2054443359375, 0.1405029296875, 0.121826171875, 0.1331787109375, 0.020751953125, 0.1529541015625, 0.2037353515625, 0.1182861328125, 0.095825195312...	embed
70964796_c0	70964796	lisp	0	Title: Lisp: How to write an if statement with multiple conditions? Problem title: Lisp: How to write an if statement with multiple conditions? Tags: lisp Problem: Lisp: How to write an if statement with multiple conditions? I understand how to write an if statement with an individual condition. For example: (if (> a 2...	Lisp: How to write an if statement with multiple conditions? Lisp: How to write an if statement with multiple conditions? lisp Lisp How Lisp: How to write an if statement with multiple conditions? I understand how to write an if statement with an individual condition. For example: However, after researching online, I f...	[ -0.00311279296875, 0.01513671875, -0.0233154296875, 0.034912109375, -0.009765625, 0.01092529296875, 0.015625, -0.00347900390625, -0.005889892578125, 0.0054931640625, -0.01263427734375, -0.01416015625, 0.005859375, 0.02294921875, -0.005096435546875, 0.0155029296875, -0.00885009765625,...	[ 1261, 7008, 12, 11249, 47, 33022, 142, 2174, 63805, 678, 48716, 27289, 400, 28219, 3642, 11651, 35431, 1118, 65514, 73342, 175199, 977, 387, 4426, 209 ]	[ 0.1368408203125, 0.2069091796875, 0.004337310791015625, 0.0743408203125, 0.016815185546875, 0.17333984375, 0.0426025390625, 0.2205810546875, 0.2298583984375, 0.09722900390625, 0.21240234375, 0.236572265625, 0.08038330078125, 0.05517578125, 0.053131103515625, 0.0966796875, 0.212402343...	embed
51118113_c0	51118113	lisp	0	Title: CLISP representation of a list Problem title: CLISP representation of a list Tags: common-lisp, lisp Problem: CLISP representation of a list I am experimenting with using substitute-if . Here I try to replace all values that are even in '((1) (2) (3) (4)) with '(0) [9]> (substitute-if '(0) #'evenp '((1) (2) (3) ...	CLISP representation of a list CLISP representation of a list common-lisp lisp CLISP CLISP representation of a list I am experimenting with using substitute-if . Here I try to replace all values that are even in '((1) (2) (3) (4)) with '(0) I am confused about the #1=(0) and #1 in the list. I expected it to return '((1...	[ -0.00823974609375, 0.0213623046875, 0.01165771484375, 0.0174560546875, -0.0035552978515625, 0.0277099609375, 0.00016498565673828125, 0.004058837890625, 0.014404296875, 0.031494140625, -0.00738525390625, 0.020263671875, -0.0033416748046875, 0.0106201171875, -0.00494384765625, 0.00607299...	[ 313, 67616, 683, 18811, 1363, 111, 5303, 39210, 4086, 254, 400, 7008, 10, 28007, 17368, 161740, 13, 9, 3190, 9790, 91995, 756, 142424, 3853, 23, 27750, 1737, 2788, 3971, 678, 177609, 55681, 41766, 1369, 136, 84751, 30646, 6649, 24658, 432...	[ 0.03076171875, 0.1728515625, 0.2095947265625, 0.2452392578125, 0.0193328857421875, 0.0167083740234375, 0.24072265625, 0.118408203125, 0.1126708984375, 0.1676025390625, 0.07232666015625, 0.181396484375, 0.000091552734375, 0.129150390625, 0.05694580078125, 0.190185546875, 0.07275390625...	embed
46986286_c1	46986286	lisp	1	T (cond ((null L) nil) ; p != nil, L = nil ((eq (car p), (car L)) ; p!= nil, L != nil (cons ((car L) (find_pattern (cdr p) (cdr L)))))) ) Without running this I already see some problems: If I find a partial-pattern match, I never return to the full pattern. So inputs such as '(a b c) '(d a b d a b c) would get the inc...	T (cond ((null L) nil) ; p != nil, L = nil ((eq (car p), (car L)) ; p!= nil, L != nil (cons ((car L) (find_pattern (cdr p) (cdr L)))))) ) Without running this I already see some problems: If I find a partial-pattern match, I never return to the full pattern. So inputs such as '(a b c) '(d a b d a b c) would get the inc...	[ -0.01953125, 0.0322265625, 0.0084228515625, -0.0036163330078125, 0.003692626953125, 0.01220703125, -0.0164794921875, -0.01507568359375, 0.0296630859375, -0.038330078125, 0.0167236328125, -0.0201416015625, 0.025390625, 0.0008392333984375, 0.005828857421875, 0.017822265625, 0.004943847...	[ 384, 2271, 71, 139550, 339, 17324, 2819, 915, 711, 2203, 60494, 864, 3284, 38, 25553, 111607, 4453, 22766, 7569, 167089, 177417, 51042, 903, 21771, 1957, 3060, 44402, 4263, 7413, 2878, 289, 9, 14858, 87, 8306, 30646, 47, 4393, 103510, 106...	[ 0.18408203125, 0.056854248046875, 0.04010009765625, 0.171875, 0.1239013671875, 0.1793212890625, 0.0156402587890625, 0.072021484375, 0.03704833984375, 0.062469482421875, 0.022247314453125, 0.126953125, 0.1434326171875, 0.03662109375, 0.13330078125, 0.1544189453125, 0.210693359375, 0...	embed
13326979_c1	13326979	lisp	1	from the prefix. Ideally, it would looks something like: for branch = (or (and branch (gethash c branch)) (puthash c (make-hash-table) trie)) ;; ^-----------------^------- cannot reference it here And that's why I have the silly first-time flag, which I could've avoided. Can I somehow use initially form, or maybe rest...	from the prefix. Ideally, it would looks something like: for branch = (or (and branch (gethash c branch)) (puthash c (make-hash-table) trie)) ;; ^-----------------^------- cannot reference it here And that's why I have the silly first-time flag, which I could've avoided. Can I somehow use initially form, or maybe rest...	[ 0.00897216796875, 0.03466796875, -0.01141357421875, -0.01318359375, -0.0106201171875, 0.002716064453125, 0.0113525390625, 0.0023345947265625, 0.023193359375, -0.02734375, 0.0032196044921875, 0.004241943359375, 0.01446533203125, 0.0244140625, 0.0086669921875, 0.025634765625, -0.034179...	[ 1295, 183114, 41143, 2806, 33342, 9844, 1884, 100, 32845, 206, 2203, 748, 2940, 3794, 126234, 501, 7077, 55898, 22819, 1927, 13, 53418, 91067, 765, 78, 12097, 5117, 6032, 49938, 5809, 272, 71864, 297, 209303, 4527, 61475, 3173, 137656, 3235...	[ 0.1988525390625, 0.27099609375, 0.1448974609375, 0.04541015625, 0.16748046875, 0.00848388671875, 0.033935546875, 0.10430908203125, 0.15234375, 0.1129150390625, 0.0736083984375, 0.06817626953125, 0.03887939453125, 0.058746337890625, 0.2086181640625, 0.047027587890625, 0.07855224609375...	embed
10008493_c0	10008493	lisp	0	Title: How to recover from LispCabinet error "the server directory is unsafe"? Problem title: How to recover from LispCabinet error "the server directory is unsafe"? Tags: emacs, lisp Problem: How to recover from LispCabinet error "the server directory is unsafe"? I installed LispCabinet and after t...	How to recover from LispCabinet error "the server directory is unsafe"? How to recover from LispCabinet error "the server directory is unsafe"? emacs lisp LispCabinet How How to recover from LispCabinet error "the server directory is unsafe"? I installed LispCabinet and after the first start it tell...	[ 0.004180908203125, 0.00128936767578125, 0.0052490234375, 0.0216064453125, -0.0267333984375, 0.0201416015625, -0.0030670166015625, 0.02392578125, -0.0137939453125, -0.0185546875, -0.004364013671875, 0.010498046875, -0.00180816650390625, 0.01611328125, 0.00089263916015625, -0.01867675781...	[ 11249, 192026, 1295, 1261, 7008, 441, 14508, 1179, 18499, 2347, 10723, 14364, 53, 83, 51, 115840, 41502, 352, 2263, 400, 47, 20600, 33, 56851, 936, 238, 12, 239469, 105548, 169057, 47677, 182867, 137989, 11883, 4439, 71, 64, 39642, 29459, ...	[ 0.05682373046875, 0.1995849609375, 0.09478759765625, 0.1649169921875, 0.202392578125, 0.0682373046875, 0.1861572265625, 0.18310546875, 0.1881103515625, 0.110107421875, 0.2415771484375, 0.178466796875, 0.12158203125, 0.1312255859375, 0.1290283203125, 0.2489013671875, 0.022171020507812...	embed
33028474_c0	33028474	lisp	0	Title: How can I recursively check if a list is sorted in Lisp? Problem title: How can I recursively check if a list is sorted in Lisp? Tags: lisp, common-lisp, recursion, list Problem: How can I recursively check if a list is sorted in Lisp? I want to write a recursive function that checks the list and either returns ...	How can I recursively check if a list is sorted in Lisp? How can I recursively check if a list is sorted in Lisp? lisp common-lisp recursion list How Lisp How can I recursively check if a list is sorted in Lisp? I want to write a recursive function that checks the list and either returns true if the list is in ascendin...	[ -0.0167236328125, 0.01611328125, 0.0235595703125, -0.000728607177734375, -0.01409912109375, 0.01495361328125, -0.0024566650390625, -0.00823974609375, -0.006378173828125, 0.0159912109375, 0.00177764892578125, 0.004730224609375, -0.0076904296875, -0.00125885009765625, 0.000553131103515625,...	[ 11249, 831, 195625, 5844, 538, 12765, 2174, 5303, 83, 17497, 71, 23, 1261, 7008, 87, 400, 39210, 4086, 254, 1830, 3444, 33022, 32354, 30646, 29568, 82800, 12989, 541, 16444, 120262, 201505, 7464, 3525 ]	[ 0.069091796875, 0.08349609375, 0.21728515625, 0.18017578125, 0.087646484375, 0.2342529296875, 0.1090087890625, 0.2269287109375, 0.06982421875, 0.234619140625, 0.15087890625, 0.0838623046875, 0.1737060546875, 0.24365234375, 0.02581787109375, 0.1102294921875, 0.06414794921875, 0.0830...	embed
18697105_c0	18697105	lisp	0	Title: 'cdadr' on nested data list in lisp Problem title: 'cdadr' on nested data list in lisp Tags: lisp, common-lisp Problem: 'cdadr' on nested data list in lisp While studying cons , cdr and car to handle lists I tried following : (cadr '('(1) '(2))) '(2) which gives the second item in the list as...	'cdadr' on nested data list in lisp 'cdadr' on nested data list in lisp lisp common-lisp 'cdadr' on nested data list in lisp While studying cons , cdr and car to handle lists I tried following : which gives the second item in the list as expected. Whereas following gives : How is data being concerte...	[ 0.005889892578125, 0.0301513671875, 0.002685546875, 0.0026702880859375, 0.01123046875, 0.045654296875, 0.0128173828125, -0.01251220703125, -0.00032806396484375, -0.01422119140625, -0.01483154296875, -0.01953125, -0.00104522705078125, 0.0157470703125, -0.009765625, -0.0047607421875, 0...	[ 3768, 12409, 42, 98, 8512, 71, 2053, 5303, 400, 7008, 39210, 4086, 254, 158, 56329, 2258, 34831, 37842, 25632, 76199, 17932, 35735, 23, 237, 84751, 11249, 8035, 20428, 47, 18151, 7464, 959, 68772, 18499, 151575, 242, 40970, 5608, 8337, 17...	[ 0.077880859375, 0.041534423828125, 0.1895751953125, 0.07452392578125, 0.1949462890625, 0.09210205078125, 0.1788330078125, 0.1871337890625, 0.1043701171875, 0.1995849609375, 0.118896484375, 0.10009765625, 0.166259765625, 0.111083984375, 0.06414794921875, 0.159423828125, 0.058471679687...	embed
13633124_c0	13633124	lisp	0	Title: Visualize s-expressions in real-time Problem title: Visualize s-expressions in real-time Tags: emacs, clojure, s-expression, lisp, code-visualization Problem: Visualize s-expressions in real-time I want to write Lisp/Scheme/Clojure code like this (map inc (range 0 5)) And have it visualized somewhat like this ma...	Visualize s-expressions in real-time Visualize s-expressions in real-time emacs clojure s-expression lisp code-visualization Visualize Visualize s-expressions in real-time I want to write Lisp/Scheme/Clojure code like this And have it visualized somewhat like this I want to see the tree change in real-time as I manipul...	[ 0.01287841796875, 0.0361328125, -0.02978515625, -0.011474609375, 0.00927734375, 0.0189208984375, -0.0172119140625, 0.0091552734375, -0.00518798828125, -0.00457763671875, 0.0027008056640625, 0.0203857421875, -0.0181884765625, 0.01123046875, 0.0213623046875, 0.0017852783203125, -0.0034...	[ 73372, 20650, 91, 204629, 7, 23, 2773, 6032, 9, 352, 2263, 20450, 461, 107, 400, 7008, 18151, 1824, 20605, 3444, 33022, 1261, 25452, 12549, 20219, 3408, 1884, 903, 21176, 208806, 1957, 53201, 15549, 45258, 125195, 1360, 90, 24209, 21334, ...	[ 0.2025146484375, 0.107177734375, 0.1419677734375, 0.2137451171875, 0.019622802734375, 0.0182342529296875, 0.1617431640625, 0.135498046875, 0.0211334228515625, 0.03564453125, 0.080810546875, 0.0885009765625, 0.102783203125, 0.049072265625, 0.06903076171875, 0.1566162109375, 0.17150878...	embed
13793031_c0	13793031	lisp	0	Title: position cursor in init rebinding macro Problem title: position cursor in init rebinding macro Tags: emacs, lisp Problem: position cursor in init rebinding macro I am trying to make a keyboard macro that prints a LaTeX macro and places the cursor inside it. For example, I have the following placed in my .emacs f...	position cursor in init rebinding macro position cursor in init rebinding macro emacs lisp C-c position cursor in init rebinding macro I am trying to make a keyboard macro that prints a LaTeX macro and places the cursor inside it. For example, I have the following placed in my .emacs file: I would like to set the curso...	[ -0.0166015625, 0.022216796875, -0.006683349609375, -0.0103759765625, 0.0029754638671875, -0.00604248046875, 0.00567626953125, -0.004852294921875, 0.00933837890625, -0.0108642578125, 0.0250244140625, -0.007415771484375, 0.0103759765625, -0.0177001953125, -0.004669189453125, -0.000114917...	[ 19069, 13810, 42, 23, 217, 456, 128239, 111789, 352, 2263, 7, 400, 7008, 313, 9, 238, 31577, 149186, 28412, 239, 10476, 1542, 44677, 46132, 25632, 158012, 5, 11883, 4439, 11435, 2806, 1884, 5423, 70, 9709, 538, 1620, 27853, 903, 10, 100...	[ 0.230712890625, 0.203125, 0.157958984375, 0.09173583984375, 0.1685791015625, 0.1168212890625, 0.219482421875, 0.2083740234375, 0.07177734375, 0.12744140625, 0.0789794921875, 0.0750732421875, 0.167724609375, 0.0384521484375, 0.01123809814453125, 0.0499267578125, 0.0265960693359375, ...	embed
19528196_c0	19528196	lisp	0	Title: a function in lisp called xtoy which returns a list from x to y Problem title: a function in lisp called xtoy which returns a list from x to y Tags: practical-common-lisp, lisp, common-lisp, ansi-common-lisp Problem: a function in lisp called xtoy which returns a list from x to y I am very new to lisp. I am tryi...	a function in lisp called xtoy which returns a list from x to y a function in lisp called xtoy which returns a list from x to y practical-common-lisp lisp common-lisp ansi-common-lisp x x2y a function in lisp called xtoy which returns a list from x to y I am very new to lisp. I am trying to write a function named x2y w...	[ 0.00836181640625, 0.005096435546875, 0.0152587890625, 0.00640869140625, -0.0034332275390625, 0.03271484375, 0.0042724609375, 0.00140380859375, 0.01025390625, 0.026611328125, 0.0093994140625, -0.01318359375, -0.00064849853515625, -0.0078125, 0.001708984375, -0.0115966796875, 0.0027618...	[ 32354, 23, 400, 7008, 35839, 1022, 188, 53, 30646, 10, 5303, 1295, 47, 113, 3129, 138155, 3796, 4086, 254, 39210, 172, 304, 7, 4552, 3525, 31577, 33022, 51776, 116, 10750, 136, 892, 26255, 4034, 3564, 99 ]	[ 0.2154541015625, 0.07171630859375, 0.1448974609375, 0.2352294921875, 0.06317138671875, 0.10626220703125, 0.201171875, 0.22900390625, 0.1690673828125, 0.03936767578125, 0.196044921875, 0.1256103515625, 0.1546630859375, 0.1824951171875, 0.0280609130859375, 0.1463623046875, 0.1035766601...	embed
16006167_c0	16006167	lisp	0	Title: scheme higher order func Problem title: scheme higher order func Tags: scheme, lisp, hash Problem: scheme higher order func Given the skeleton of a function: (define gen-hash-division-method (lambda (size))) as well as: (define hash-1 (gen-hash-division-method 701)) What I have coded: (define gen-hash-division-m...	scheme higher order func scheme higher order func scheme lisp hash hash-1 scheme higher order func Given the skeleton of a function: as well as: What I have coded: key(flip(w)) takes a list w and returns an integer. And call: I keep getting this error:	[ -0.0244140625, 0.02392578125, -0.010498046875, -0.01409912109375, -0.01385498046875, -0.012939453125, 0.0224609375, -0.0177001953125, -0.0032958984375, -0.0380859375, -0.01312255859375, 0.019775390625, 0.016845703125, -0.004638671875, 0.004638671875, -0.035888671875, 0.00653076171875...	[ 150370, 77546, 12989, 7477, 238, 400, 7008, 1556, 127, 5759, 182355, 191, 32354, 765, 18151, 22799, 132, 420, 21392, 434, 51776, 5303, 148, 30646, 7, 892, 1505, 11782, 13695, 20949, 903, 18499 ]	[ 0.240966796875, 0.144775390625, 0.1724853515625, 0.113037109375, 0.04718017578125, 0.0501708984375, 0.1541748046875, 0.12225341796875, 0.08587646484375, 0.09490966796875, 0.1748046875, 0.105712890625, 0.1844482421875, 0.0007801055908203125, 0.1507568359375, 0.2144775390625, 0.0070075...	embed
17163653_c0	17163653	lisp	0	Title: From Google Common Lisp Style Guide: "Avoid modifying local variables, try rebinding instead" meaning? Problem title: From Google Common Lisp Style Guide: "Avoid modifying local variables, try rebinding instead" meaning? Tags: common-lisp, lisp Problem: From Google Common Lisp Style Guide: "A...	From Google Common Lisp Style Guide: "Avoid modifying local variables, try rebinding instead" meaning? From Google Common Lisp Style Guide: "Avoid modifying local variables, try rebinding instead" meaning? common-lisp lisp Google Common Lisp Style Guide Avoid From Google Common Lisp Style Guide: "Av...	[ -0.033203125, 0.025634765625, -0.004913330078125, -0.008544921875, -0.0108642578125, 0.00927734375, 0.003631591796875, 0.0181884765625, -0.004486083984375, -0.00762939453125, 0.01019287109375, -0.01324462890625, 0.0281982421875, 0.01409912109375, 0.021240234375, 0.0213623046875, -0.0...	[ 1815, 151301, 1261, 7008, 57845, 44583, 45475, 48899, 2811, 151138, 4000, 77336, 9790, 456, 128239, 64457, 91084, 39210, 4086, 254, 400, 84361, 532, 29459, 149357 ]	[ 0.09686279296875, 0.08319091796875, 0.07574462890625, 0.106201171875, 0.1109619140625, 0.109375, 0.1295166015625, 0.1749267578125, 0.1134033203125, 0.1005859375, 0.1273193359375, 0.1912841796875, 0.1619873046875, 0.1746826171875, 0.27294921875, 0.1771240234375, 0.1412353515625, 0.0...	embed
35564847_c0	35564847	lisp	0	Title: How to pass a symbol as a keyword argument? Problem title: How to pass a symbol as a keyword argument? Tags: lisp, common-lisp Problem: How to pass a symbol as a keyword argument? I export a few symbols from a package and use them internally in a case statement. I'd like to pass one of the symbols (e.g. medium-s...	How to pass a symbol as a keyword argument? How to pass a symbol as a keyword argument? lisp common-lisp How How to pass a symbol as a keyword argument? I export a few symbols from a package and use them internally in a case statement. I'd like to pass one of the symbols (e.g. medium-size) as a keyword argument to a ge...	[ 0.002838134765625, -0.0023040771484375, 0.0167236328125, -0.03076171875, -0.0206298828125, -0.004974365234375, -0.0208740234375, -0.005218505859375, -0.004730224609375, 0.017578125, 0.0089111328125, -0.00933837890625, 0.0167236328125, 0.0145263671875, -0.01495361328125, 0.00830078125, ...	[ 11249, 47, 27875, 10, 26582, 237, 166117, 10750, 400, 7008, 39210, 4086, 254, 31255, 10846, 98169, 4527, 70796, 7225, 63805, 1884, 57646, 62539, 189534, 55300, 13606, 14012, 619, 186104, 7, 18499, 24658, 20531 ]	[ 0.0814208984375, 0.026702880859375, 0.1669921875, 0.0404052734375, 0.272705078125, 0.093017578125, 0.238525390625, 0.2626953125, 0.07275390625, 0.1751708984375, 0.0941162109375, 0.028045654296875, 0.131103515625, 0.1221923828125, 0.007476806640625, 0.1356201171875, 0.04620361328125, ...	embed
7539616_c0	7539616	lisp	0	Title: Scheme function that sum number u and list x u+x1+x2 Problem title: Scheme function that sum number u and list x u+x1+x2 Tags: tail-recursion, scheme, lisp Problem: Scheme function that sum number u and list x u+x1+x2 Im new to Scheme and trying to make function that is (in f u x), u is integer, x is a list and ...	Scheme function that sum number u and list x u+x1+x2 Scheme function that sum number u and list x u+x1+x2 tail-recursion scheme lisp Scheme Scheme function that sum number u and list x u+x1+x2 Im new to Scheme and trying to make function that is (in f u x), u is integer, x is a list and f binary function. The scheme ex...	[ -0.0120849609375, 0.026123046875, 0.020751953125, 0.0028228759765625, -0.00726318359375, 0.019287109375, -0.0172119140625, 0.00469970703125, 0.01361083984375, -0.03125, 0.0123291015625, -0.033447265625, -0.0002880096435546875, -0.004791259765625, 0.0203857421875, -0.0024871826171875, ...	[ 34702, 282, 32354, 450, 10554, 14012, 75, 136, 5303, 1022, 1328, 425, 304, 46741, 107, 48650, 1830, 150370, 400, 7008, 418, 3525, 31577, 73, 1238, 83, 892, 1505, 2394, 6635, 125195, 997, 138, 242, 116, 8439, 5608, 30646, 21748, 54651, 8...	[ 0.232666015625, 0.1734619140625, 0.2080078125, 0.041351318359375, 0.21484375, 0.177734375, 0.1558837890625, 0.09405517578125, 0.2010498046875, 0.07501220703125, 0.111083984375, 0.009613037109375, 0.1588134765625, 0.20849609375, 0.0249786376953125, 0.1578369140625, 0.044677734375, 0...	embed
53209247_c0	53209247	lisp	0	Title: Lisp/Intersection of Lists Problem title: Lisp/Intersection of Lists Tags: common-lisp, lisp, set-intersection Problem: Lisp/Intersection of Lists Hello i am trying to create a function in common-lisp that takes two lists, and output their intersections, assuming there is no repetition in each list without using...	Lisp/Intersection of Lists Lisp/Intersection of Lists common-lisp lisp set-intersection Lisp Intersection Lists lst_1 lst_2 Lisp/Intersection of Lists Hello i am trying to create a function in common-lisp that takes two lists, and output their intersections, assuming there is no repetition in each list without using in...	[ -0.0179443359375, 0.0037689208984375, 0.01287841796875, 0.01007080078125, -0.01373291015625, 0.0400390625, 0.00099945068359375, -0.002685546875, -0.00457763671875, -0.018310546875, 0.01025390625, 0.020263671875, -0.002227783203125, -0.0003871917724609375, -0.0009613037109375, 0.0037384...	[ 1261, 7008, 44851, 7, 58994, 111, 32036, 64, 39210, 4086, 254, 400, 5423, 10433, 5337, 271, 115187, 304, 35378, 31577, 28282, 32354, 51776, 6626, 5303, 140992, 2363, 1940, 66596, 110, 57346, 12638, 15490, 17368, 37202, 959, 20697, 4358 ]	[ 0.1468505859375, 0.22412109375, 0.11077880859375, 0.169921875, 0.1834716796875, 0.05511474609375, 0.222900390625, 0.031585693359375, 0.16455078125, 0.131103515625, 0.194091796875, 0.11798095703125, 0.137451171875, 0.14306640625, 0.1015625, 0.0023365020751953125, 0.025421142578125, ...	embed
19812506_c0	19812506	lisp	0	Title: How to `require` a file without printing out its top level expressions? Problem title: How to `require` a file without printing out its top level expressions? Tags: lisp, racket, scheme Problem: How to `require` a file without printing out its top level expressions? File a.rkt : #lang racket (provide f) (define ...	How to `require` a file without printing out its top level expressions? How to `require` a file without printing out its top level expressions? lisp racket scheme a.rkt How b.rkt How to `require` a file without printing out its top level expressions? File a.rkt : File b.rkt : Then when I run b.rkt , I will get f which ...	[ -0.000682830810546875, 0.004180908203125, -0.006988525390625, 0.0250244140625, -0.01953125, -0.006500244140625, 0.00701904296875, -0.008056640625, 0.003173828125, -0.004852294921875, -0.005462646484375, -0.0111083984375, -0.01312255859375, 0.0034027099609375, 0.007171630859375, -0.0214...	[ 11249, 47, 107, 3181, 11435, 15490, 2448, 1810, 2663, 17366, 125195, 1916, 400, 7008, 673, 27853, 150370, 10, 7190, 18, 876, 42724, 5, 11675, 2046, 1238, 3129, 2367, 3444, 209, 2843, 28412, 23, 9069, 21130, 2301, 831, 64209 ]	[ 0.063232421875, 0.0675048828125, 0.1702880859375, 0.206298828125, 0.210205078125, 0.149169921875, 0.0789794921875, 0.060150146484375, 0.0692138671875, 0.1142578125, 0.1461181640625, 0.02301025390625, 0.06829833984375, 0.1527099609375, 0.053985595703125, 0.1629638671875, 0.12646484375...	embed
21830480_c0	21830480	lisp	0	Title: Racket function flag arguments Problem title: Racket function flag arguments Tags: lisp, lambda, function, keyword-argument, racket Problem: Racket function flag arguments Racket guide introduces functions with keyword arguments: (define (F #:keyword argument) ...) When we use it, we need to associate certain va...	Racket function flag arguments Racket function flag arguments lisp lambda function keyword-argument racket Racket Racket function flag arguments Racket guide introduces functions with keyword arguments: When we use it, we need to associate certain value with the argument: But in the same guide there is an example of ke...	[ 0.0118408203125, 0.005950927734375, 0.00811767578125, -0.01123046875, -0.006103515625, 0.0120849609375, -0.00604248046875, 0.00921630859375, -0.01953125, 0.04150390625, 0.0159912109375, -0.019287109375, -0.009033203125, 0.003265380859375, 0.0238037109375, 0.00982666015625, 0.00872802...	[ 2552, 27853, 32354, 49938, 10750, 400, 7008, 6492, 85, 166117, 155937, 673, 17997, 65508, 4527, 3871, 30699, 34292, 678, 27781, 110, 7722, 28282, 5062, 77848, 70796, 60213 ]	[ 0.08770751953125, 0.195068359375, 0.164794921875, 0.2261962890625, 0.2430419921875, 0.050018310546875, 0.1317138671875, 0.09539794921875, 0.05523681640625, 0.2130126953125, 0.188232421875, 0.06390380859375, 0.1455078125, 0.04266357421875, 0.0225067138671875, 0.03204345703125, 0.12622...	embed
70753815_c0	70753815	lisp	0	Title: Lisp constants used in multiple places Problem title: Lisp constants used in multiple places Tags: constants, lisp Problem: Lisp constants used in multiple places There are some constants in my application that I want to use throughout the program. This is what I currently do: (defconst my-constant-alist '((my-f...	Lisp constants used in multiple places Lisp constants used in multiple places constants lisp Lisp Lisp constants used in multiple places There are some constants in my application that I want to use throughout the program. This is what I currently do: within the code I then use: However, since I use the constant in a c...	[ 0.01318359375, 0.019287109375, -0.01263427734375, -0.01123046875, 0.00141143798828125, -0.00146484375, 0.001129150390625, 0.007232666015625, -0.01226806640625, -0.03271484375, -0.0155029296875, 0.0118408203125, 0.00830078125, 0.022705078125, -0.0037689208984375, 0.01458740234375, -0....	[ 1261, 7008, 53697, 7, 11814, 23, 48716, 44677, 400, 3060, 38415, 3444, 4527, 87420, 1528, 82424, 28032, 18151, 33306, 24941, 1660, 14602, 959, 6713, 4127, 27650, 3917, 17368, 93403, 756, 645 ]	[ 0.1622314453125, 0.206787109375, 0.229248046875, 0.098388671875, 0.14892578125, 0.053680419921875, 0.19384765625, 0.1962890625, 0.1273193359375, 0.0079498291015625, 0.131103515625, 0.06646728515625, 0.1185302734375, 0.0859375, 0.1324462890625, 0.04150390625, 0.059295654296875, 0.10...	embed
3614048_c1	3614048	lisp	1	completely foreign to me. Anyone know what's going on here? If it helps, I'm running emacs 23 from within OS X's Terminal window. Edit: Sorry all, but I figured out a way around this. Apparently nXhtml automatically highlights all text for some reason, but you can turn this off using the following option: M-x customiz...	completely foreign to me. Anyone know what's going on here? If it helps, I'm running emacs 23 from within OS X's Terminal window. Edit: Sorry all, but I figured out a way around this. Apparently nXhtml automatically highlights all text for some reason, but you can turn this off using the following option: M-x customiz...	[ 0.00830078125, 0.0022735595703125, -0.00982666015625, -0.0244140625, -0.0076904296875, 0.04248046875, -0.0014190673828125, 0.0003509521484375, -0.0177001953125, 0.01007080078125, -0.0137939453125, 0.001861572265625, -0.00885009765625, -0.021484375, -0.006378173828125, -0.0289306640625,...	[ 64557, 110613, 3630, 3714, 7730, 3688, 112397, 51042, 352, 2263, 7, 1105, 1295, 28032, 11787, 1193, 124090, 76896, 90502, 756, 26366, 3917, 10932, 903, 99547, 653, 1542, 7693, 191082, 127308, 7986, 31635, 831, 15504, 5773, 35829, 276, 425, ...	[ 0.033843994140625, 0.08673095703125, 0.01373291015625, 0.083251953125, 0.01446533203125, 0.041107177734375, 0.055633544921875, 0.076904296875, 0.1241455078125, 0.1397705078125, 0.131103515625, 0.1773681640625, 0.0841064453125, 0.1177978515625, 0.1280517578125, 0.1204833984375, 0.1909...	embed
2234860_c0	2234860	lisp	0	Title: lisp filter out results from list not matching predicate Problem title: lisp filter out results from list not matching predicate Tags: filter, predicate, list, lisp, elisp Problem: lisp filter out results from list not matching predicate I am trying to learn lisp, using emacs dialect and I have a question. let u...	lisp filter out results from list not matching predicate lisp filter out results from list not matching predicate filter predicate list lisp elisp list lisp filter out results from list not matching predicate I am trying to learn lisp, using emacs dialect and I have a question. let us say list has some members, for whi...	[ 0.00701904296875, 0.0234375, 0.0003948211669921875, -0.0162353515625, -0.0115966796875, 0.01611328125, 0.01324462890625, 0.0264892578125, 0.007568359375, 0.01202392578125, 0.01055908203125, -0.000720977783203125, -0.0146484375, -0.008544921875, -0.0157470703125, 0.01019287109375, 0.0...	[ 400, 7008, 46312, 1810, 50339, 1295, 5303, 959, 14858, 214, 1653, 2063, 15296, 30698, 352, 2263, 7, 220734, 43032, 151575, 47, 98320, 28282, 3525, 15490, 62, 23, 339, 915, 284, 29568, 17198, 50828, 32354, 183234 ]	[ 0.139892578125, 0.199462890625, 0.236328125, 0.109619140625, 0.1868896484375, 0.1318359375, 0.20458984375, 0.142822265625, 0.1781005859375, 0.0841064453125, 0.1429443359375, 0.166748046875, 0.07257080078125, 0.024505615234375, 0.0179443359375, 0.051849365234375, 0.000762939453125, ...	embed
38793332_c0	38793332	lisp	0	Title: Association list in another association list Problem title: Association list in another association list Tags: common-lisp, lisp Problem: Association list in another association list Is there any way to make something in lisp that can do like an association list in another association list, I tried : (setq alist...	Association list in another association list Association list in another association list common-lisp lisp Association Maximum LIST Association list in another association list Is there any way to make something in lisp that can do like an association list in another association list, I tried : but it gives : and then ...	[ 0.01446533203125, 0.0213623046875, 0.0002918243408203125, 0.018310546875, 0.0030517578125, -0.00396728515625, -0.00933837890625, 0.0130615234375, 0.0087890625, -0.0294189453125, 0.01092529296875, -0.00469970703125, 0.002288818359375, 0.0181884765625, 0.0169677734375, -0.003189086914062...	[ 56187, 5303, 23, 15700, 125413, 39210, 4086, 254, 400, 7008, 46540, 316, 195977, 3917, 3249, 9844, 54, 1884, 37842, 76199, 903, 18499 ]	[ 0.176513671875, 0.1982421875, 0.0455322265625, 0.0950927734375, 0.1884765625, 0.0203399658203125, 0.05255126953125, 0.128662109375, 0.09234619140625, 0.1732177734375, 0.09454345703125, 0.03369140625, 0.1741943359375, 0.019134521484375, 0.0753173828125, 0.037200927734375, 0.0274963378...	embed
34678996_c0	34678996	lisp	0	Title: Use read-time conditionalization on several atoms Problem title: Use read-time conditionalization on several atoms Tags: lisp, common-lisp Problem: Use read-time conditionalization on several atoms I want to use Lisp's read-time conditionalization feature to merge two versions of my code, old and new. I have som...	Use read-time conditionalization on several atoms Use read-time conditionalization on several atoms lisp common-lisp Use Use read-time conditionalization on several atoms I want to use Lisp's read-time conditionalization feature to merge two versions of my code, old and new. I have something like: so the old version is...	[ -0.00933837890625, 0.0037078857421875, 0.0162353515625, -0.0019683837890625, 0.00872802734375, 0.01263427734375, 0.00238037109375, 0.004669189453125, 0.00714111328125, 0.0032806396484375, 0.006744384765625, 0.00179290771484375, 0.0159912109375, -0.0118408203125, 0.01348876953125, -0.01...	[ 36836, 12301, 6032, 35431, 289, 47691, 98, 40368, 34627, 400, 7008, 39210, 4086, 254, 3444, 4527, 1261, 9, 60213, 42564, 6626, 11389, 18151, 10332, 3525, 83, 3229, 61924, 3917, 32562, 903, 1286, 6333, 4734, 1632, 74918, 468, 1328, 54936 ]	[ 0.113525390625, 0.167724609375, 0.189697265625, 0.1998291015625, 0.1217041015625, 0.1290283203125, 0.0277099609375, 0.113037109375, 0.2030029296875, 0.0985107421875, 0.2322998046875, 0.1107177734375, 0.09033203125, 0.1396484375, 0.043701171875, 0.126953125, 0.1312255859375, 0.00335...	embed
23770363_c0	23770363	lisp	0	Title: Lisp associative list Problem title: Lisp associative list Tags: associative, lisp Problem: Lisp associative list (defun next () (defparameter sentences '( (1 . "Test 1") (2 . "Test 2"))) (let (sentence '(assoc 2 sentences)) ;This quote is needed, another program evaluates this. (format t "sentences:~%~a~%...	Lisp associative list Lisp associative list associative lisp Lisp Test Lisp associative list It gives output "sentences: ((1 . Test 1) (2 . Test 2)) sentence: NIL". Why doesn't it give (2 . Test 2) as the value of "sentence"? Thanks in advance. EDIT: added parentheses. The original program has matched parentheses.	[ 0.0152587890625, 0.0260009765625, -0.010498046875, 0.0257568359375, -0.007171630859375, -0.000797271728515625, 0.015869140625, 0.0218505859375, 0.012451171875, -0.023193359375, 0.03173828125, 0.018798828125, -0.022705078125, -0.0062255859375, 0.0157470703125, -0.000934600830078125, 0...	[ 1261, 7008, 166027, 272, 5303, 400, 8647, 76199, 140992, 12832, 69098, 41600, 4879, 4700, 4958, 149357, 541, 16444, 44084, 22027, 18, 8337, 237, 34292, 6620, 49129, 35412, 90, 1528, 14858 ]	[ 0.132080078125, 0.178955078125, 0.143310546875, 0.05548095703125, 0.1619873046875, 0.0953369140625, 0.208740234375, 0.046173095703125, 0.140380859375, 0.1224365234375, 0.1334228515625, 0.05133056640625, 0.043670654296875, 0.0736083984375, 0.10015869140625, 0.2041015625, 0.13305664062...	embed
16089809_c0	16089809	lisp	0	Title: What's the equivalent of constructors in CLOS? Problem title: What's the equivalent of constructors in CLOS? Tags: clos, common-lisp, lisp Problem: What's the equivalent of constructors in CLOS? How would you express the following Java code in Lisp? class Foo { private String s; public Foo(String s) { ...	What's the equivalent of constructors in CLOS? What's the equivalent of constructors in CLOS? clos common-lisp lisp What CLOS Foo this.s Bar Integer.toString What's the equivalent of constructors in CLOS? How would you express the following Java code in Lisp? In Lisp, is make-instance or initialize-instance t...	[ 0.01080322265625, 0.0255126953125, 0.00133514404296875, 0.03857421875, 0.0010528564453125, 0.005859375, 0.01458740234375, 0.0189208984375, 0.0103759765625, -0.0164794921875, -0.00144195556640625, -0.012451171875, 0.013427734375, 0.01129150390625, -0.00958251953125, -0.03271484375, 0....	[ 3768, 70, 183234, 111, 64549, 25251, 23, 313, 92933, 7, 20450, 39210, 4086, 254, 400, 7008, 9572, 31, 903, 3253, 44401, 188, 71713, 36510, 25632, 41925, 18151, 1261, 3249, 116071, 707, 61475, 20650, 748, 11782, 1601, 18507 ]	[ 0.06683349609375, 0.0260772705078125, 0.2071533203125, 0.035369873046875, 0.2152099609375, 0.2169189453125, 0.06817626953125, 0.05633544921875, 0.240234375, 0.102783203125, 0.1844482421875, 0.1041259765625, 0.0750732421875, 0.1397705078125, 0.0650634765625, 0.1854248046875, 0.1409912...	embed
26196699_c0	26196699	lisp	0	Title: Is LISP's code-as-data ideology basically the same thing as higher order functions? Problem title: Is LISP's code-as-data ideology basically the same thing as higher order functions? Tags: higher-order-functions, clojure, scala, lisp Problem: Is LISP's code-as-data ideology basically the same thing as ...	Is LISP's code-as-data ideology basically the same thing as higher order functions? Is LISP's code-as-data ideology basically the same thing as higher order functions? higher-order-functions clojure scala lisp LISP Is LISP's code-as-data ideology basically the same thing as higher order functions? So, I've be...	[ 0.020263671875, 0.00762939453125, -0.00885009765625, 0.0002346038818359375, 0.00439453125, 0.0113525390625, 0.015625, -0.015380859375, 0.0035858154296875, -0.034423828125, -0.017333984375, -0.01385498046875, -0.01458740234375, -0.0269775390625, -0.005523681640625, -0.01416015625, -0....	[ 16970, 9434, 3768, 18151, 162, 10135, 5415, 25443, 198343, 5701, 13580, 77546, 12989, 32354, 80596, 137175, 20450, 461, 107, 146232, 400, 7008, 2071, 237, 6528, 51515, 55681, 37202, 5915, 1884, 42856, 60212, 17721, 6626, 23755 ]	[ 0.1444091796875, 0.22314453125, 0.039520263671875, 0.2237548828125, 0.18115234375, 0.1837158203125, 0.183837890625, 0.1639404296875, 0.0875244140625, 0.102783203125, 0.059356689453125, 0.12939453125, 0.1873779296875, 0.181640625, 0.15966796875, 0.1575927734375, 0.1300048828125, 0.1...	embed
64727596_c0	64727596	lisp	0	Title: Read terminal argument and pass the function in lisp? Problem title: Read terminal argument and pass the function in lisp? Tags: clisp, common-lisp, lisp Problem: Read terminal argument and pass the function in lisp? (defun gppinterpreter (filename) (setq fileContent (read-a-file filename)) (write filecontent) )...	Read terminal argument and pass the function in lisp? Read terminal argument and pass the function in lisp? clisp common-lisp lisp Read Read terminal argument and pass the function in lisp? I compile this file in ubuntu clisp example.lisp I want to get the filename parameter directly from the terminal such as >> clisp ...	[ 0.0166015625, 0.0167236328125, -0.0133056640625, 0.0012054443359375, -0.0205078125, 0.007080078125, 0.022216796875, 0.0167236328125, -0.026611328125, -0.0272216796875, 0.0238037109375, 0.0028076171875, -0.02978515625, -0.000774383544921875, 0.00592041015625, -0.005889892578125, 0.010...	[ 4764, 33949, 10750, 136, 27875, 32354, 23, 400, 7008, 95701, 39210, 4086, 254, 9969, 1340, 11435, 198996, 27781, 3444, 2046, 11627, 171859, 105237, 1295, 75101, 20697, 706, 6366, 158288, 56 ]	[ 0.1962890625, 0.259521484375, 0.2237548828125, 0.0174407958984375, 0.130859375, 0.1480712890625, 0.05364990234375, 0.1270751953125, 0.2269287109375, 0.100341796875, 0.08087158203125, 0.0965576171875, 0.191650390625, 0.048675537109375, 0.01116943359375, 0.10064697265625, 0.07635498046...	embed
37956731_c0	37956731	lisp	0	Title: Stackoverflow in Common Lisp Mergesort Problem title: Stackoverflow in Common Lisp Mergesort Tags: list, lisp, mergesort, stack-overflow, common-lisp Problem: Stackoverflow in Common Lisp Mergesort (defun mergesort (alist low high) (when (< low high) (mergesort alist low (/ (+ low high) 2)) (mergesort alist (/ (...	Stackoverflow in Common Lisp Mergesort Stackoverflow in Common Lisp Mergesort list lisp mergesort stack-overflow common-lisp j Stackoverflow Common Lisp Mergesort Error Stack While TRUNCATE Stackoverflow in Common Lisp Mergesort I've written my first ever Common Lisp function and I'm having trouble tracking down where ...	[ 0.005767822265625, 0.0191650390625, 0.0155029296875, -0.0281982421875, 0.00567626953125, -0.005767822265625, -0.031005859375, 0.01214599609375, 0.0033416748046875, -0.000270843505859375, -0.0076904296875, 0.0230712890625, 0.0277099609375, -0.002532958984375, 0.01025390625, 0.0000567436...	[ 6512, 2594, 5465, 118664, 151301, 1261, 7008, 6035, 429, 62351, 23, 5303, 400, 42564, 177261, 39210, 4086, 254, 1647, 212059, 51404, 14107, 175560, 35746, 59121, 5117, 32354, 63134, 28560, 18499, 181653, 106443, 645, 98, 34292, 71924, 214, 18...	[ 0.153564453125, 0.15966796875, 0.1170654296875, 0.28125, 0.1614990234375, 0.1365966796875, 0.162109375, 0.1446533203125, 0.07635498046875, 0.1998291015625, 0.010345458984375, 0.0985107421875, 0.0718994140625, 0.1746826171875, 0.2247314453125, 0.1484375, 0.07916259765625, 0.11645507...	embed
16379657_c0	16379657	lisp	0	Title: Recursive range in Lisp adds a period? Problem title: Recursive range in Lisp adds a period? Tags: lisp, scheme Problem: Recursive range in Lisp adds a period? (define .. (lambda (start stop) (cond ((> (add1 start) stop) (quote ())) ((eq? (add1 start) stop) (sub1 stop)) (else (cons start (.. (add1 start) stop)))...	Recursive range in Lisp adds a period? Recursive range in Lisp adds a period? lisp scheme Recursive Lisp add1 sub1 Recursive range in Lisp adds a period? I have defined a simple range function. The intent is for Instead, a bizarre period is being added to my tuple and I have no idea why: I don't understand why this is ...	[ -0.00109100341796875, 0.03759765625, 0.0012359619140625, -0.0034942626953125, -0.02392578125, 0.011474609375, -0.0218505859375, -0.000324249267578125, -0.00823974609375, -0.001922607421875, 0.004791259765625, 0.005279541015625, -0.00286865234375, 0.002960205078125, 0.0224609375, -0.013...	[ 853, 48650, 5844, 37457, 1261, 7008, 15190, 14922, 23, 7, 10, 400, 150370, 418, 1614, 61924, 8781, 32354, 78091, 100, 175399, 184307, 8035, 49814, 47, 370, 8705, 6528, 15400, 28219, 123087, 4358 ]	[ 0.0236663818359375, 0.1827392578125, 0.08929443359375, 0.2093505859375, 0.13037109375, 0.2081298828125, 0.138671875, 0.251708984375, 0.0268096923828125, 0.017578125, 0.033172607421875, 0.0919189453125, 0.1468505859375, 0.026824951171875, 0.145263671875, 0.04437255859375, 0.0596008300...	embed
8052756_c0	8052756	lisp	0	Title: How to find the position of an atom in list Problem title: How to find the position of an atom in list Tags: lisp, common-lisp Problem: How to find the position of an atom in list I am trying to find the position of an atom in the list. (position-in-list 'a (a b c d e)) gives 0 (position-in-list 'b (a b c d e) )...	How to find the position of an atom in list How to find the position of an atom in list lisp common-lisp How How to find the position of an atom in list I am trying to find the position of an atom in the list. (position-in-list 'a (a b c d e)) gives 0 (position-in-list 'b (a b c d e) ) gives 1 (position-in-list 'Z(a b ...	[ -0.004974365234375, 0.01385498046875, 0.009033203125, 0.01141357421875, 0.0010833740234375, 0.0179443359375, 0.0238037109375, 0.000759124755859375, 0.0035247802734375, -0.017822265625, -0.004241943359375, -0.0167236328125, 0.01806640625, 0.019287109375, 0.003326416015625, 0.01165771484...	[ 11249, 47, 7413, 70, 19069, 111, 142, 34627, 23, 5303, 400, 7008, 39210, 4086, 254, 87, 31577, 40322, 73, 6562, 11, 876, 501, 104, 28, 76199, 757, 275, 106, 1511, 17324, 452, 18151, 4734, 30646, 615 ]	[ 0.072021484375, 0.058319091796875, 0.1339111328125, 0.0667724609375, 0.218017578125, 0.061767578125, 0.03662109375, 0.25146484375, 0.125, 0.2249755859375, 0.04901123046875, 0.129150390625, 0.0926513671875, 0.024383544921875, 0.079833984375, 0.00286865234375, 0.058197021484375, 0.17...	embed
67213946_c0	67213946	lisp	0	Title: How to set linux wallpaper using clx Problem title: How to set linux wallpaper using clx Tags: clx, common-lisp, lisp Problem: How to set linux wallpaper using clx I'm trying changing wallpaper using clx, but it do not work. What is wrong with my code? (ql:quickload :clx) (defpackage #:wm/uw (:use #:cl #:xlib)) ...	How to set linux wallpaper using clx How to set linux wallpaper using clx clx common-lisp lisp clx How ql:quickload How to set linux wallpaper using clx I'm trying changing wallpaper using clx, but it do not work. What is wrong with my code?	[ 0.015869140625, 0.01171875, 0.0067138671875, 0.01483154296875, -0.01239013671875, 0.00396728515625, 0.02197265625, -0.0123291015625, 0.0050048828125, 0.00006866455078125, 0.001678466796875, 0.0244140625, 0.01129150390625, 0.019287109375, -0.01611328125, -0.000019073486328125, 0.00015...	[ 11249, 47, 5423, 11508, 6077, 104195, 17368, 33139, 425, 39210, 4086, 254, 7008, 99247, 3181, 2594, 63033, 31577, 151134, 959, 4488, 44691, 18151 ]	[ 0.041290283203125, 0.07421875, 0.140625, 0.13134765625, 0.1343994140625, 0.244140625, 0.10784912109375, 0.14208984375, 0.2032470703125, 0.08544921875, 0.0194549560546875, 0.06280517578125, 0.07373046875, 0.1387939453125, 0.043426513671875, 0.03717041015625, 0.16796875, 0.0145111083...	embed
48363798_c0	48363798	lisp	0	Title: How are arguments passed into functions in Elisp? Problem title: How are arguments passed into functions in Elisp? Tags: elisp, lisp, parameter-passing Problem: How are arguments passed into functions in Elisp? Coming from a C++ background, I'm trying to figure out how arguments are passed into methods in Elisp....	How are arguments passed into functions in Elisp? How are arguments passed into functions in Elisp? elisp lisp parameter-passing How Elisp How are arguments passed into functions in Elisp? Coming from a C++ background, I'm trying to figure out how arguments are passed into methods in Elisp. While I acknowledge that may...	[ 0.0211181640625, 0.0224609375, -0.0133056640625, -0.01068115234375, 0.000514984130859375, 0.0155029296875, -0.007232666015625, 0.000701904296875, -0.01031494140625, 0.0128173828125, 0.004638671875, -0.007080078125, -0.01904296875, 0.0244140625, -0.01190185546875, -0.0126953125, 0.012...	[ 11249, 10750, 7, 115081, 3934, 32354, 23, 25318, 7008, 15296, 400, 171859, 13409, 621, 313, 37223, 76615, 26366, 3642, 150624, 2565, 12921, 20903, 6528, 452, 390, 91067, 34292, 37264, 55300, 68034, 11782 ]	[ 0.09814453125, 0.250244140625, 0.1126708984375, 0.1561279296875, 0.14990234375, 0.2021484375, 0.080810546875, 0.1505126953125, 0.247314453125, 0.1142578125, 0.1173095703125, 0.209228515625, 0.120849609375, 0.03143310546875, 0.0145111083984375, 0.18212890625, 0.041473388671875, 0.00...	embed
10450093_c0	10450093	lisp	0	Title: Creating a db in chicken scheme Problem title: Creating a db in chicken scheme Tags: chicken-scheme, scheme, lisp Problem: Creating a db in chicken scheme I would like to ask if it is possible to create a db in chicken scheme; something analogous to this: http://www.gigamonkeys.com/book/practical-a-simple-databa...	Creating a db in chicken scheme Creating a db in chicken scheme chicken-scheme scheme lisp Creating Creating a db in chicken scheme I would like to ask if it is possible to create a db in chicken scheme; something analogous to this: http://www.gigamonkeys.com/book/practical-a-simple-database.html If it is then what pre...	[ 0.0137939453125, 0.0142822265625, -0.0047607421875, 0.0167236328125, -0.00439453125, 0.0087890625, 0.00299072265625, -0.01324462890625, 0.01153564453125, -0.038818359375, 0.0040283203125, 0.0005950927734375, -0.005889892578125, -0.0201416015625, -0.0157470703125, -0.003509521484375, ...	[ 56781, 1916, 40041, 23, 143896, 150370, 10, 7560, 282, 400, 7008, 1884, 26458, 7722, 28282, 60223, 903, 3796, 19770, 14137, 14170, 70760, 191560, 10135, 37382, 1653, 2063, 12301, 86250, 100, 151117, 4527, 142, 56125, 34356, 33938, 14037, 6920...	[ 0.160400390625, 0.008392333984375, 0.2333984375, 0.09381103515625, 0.2469482421875, 0.247314453125, 0.0290069580078125, 0.176513671875, 0.1002197265625, 0.033660888671875, 0.1365966796875, 0.0218658447265625, 0.06854248046875, 0.1549072265625, 0.180908203125, 0.07513427734375, 0.0056...	embed
21865937_c0	21865937	lisp	0	Title: Prove LISP is not functional Problem title: Prove LISP is not functional Tags: procedural-programming, lisp, functional-programming Problem: Prove LISP is not functional I'm in a discussion with a colleague in which he argues LISP is functional and I argue it is not. While I concede that LISP programs can be wri...	Prove LISP is not functional Prove LISP is not functional procedural-programming lisp functional-programming Prove LISP Prove LISP is not functional I'm in a discussion with a colleague in which he argues LISP is functional and I argue it is not. While I concede that LISP programs can be written functionally, LISP is n...	[ 0.016357421875, 0.025390625, -0.0001773834228515625, 0.00726318359375, -0.016845703125, 0.01092529296875, -0.014404296875, -0.01318359375, -0.0106201171875, 0.007537841796875, -0.0118408203125, 0.013427734375, -0.01318359375, 0.0118408203125, 0.016357421875, 0.024658203125, 0.0003128...	[ 1250, 272, 16970, 9434, 83, 959, 123309, 59158, 28966, 400, 7008, 35107, 62975, 11, 6261, 187, 442, 93153, 103391, 831, 59121, 21286, 18822, 20625, 142508, 6982, 26808, 1679, 22691, 18151, 93, 58134, 7639 ]	[ 0.11328125, 0.04449462890625, 0.1492919921875, 0.2291259765625, 0.078369140625, 0.1392822265625, 0.189697265625, 0.1348876953125, 0.1177978515625, 0.1348876953125, 0.1842041015625, 0.052734375, 0.03497314453125, 0.020233154296875, 0.01318359375, 0.03955078125, 0.001861572265625, 0....	embed
58130107_c0	58130107	lisp	0	Title: Lisp Lambda function with IF clause Problem title: Lisp Lambda function with IF clause Tags: lambda, functional-programming, common-lisp, lisp Problem: Lisp Lambda function with IF clause I am trying to make a "Replace each occurence of x with y in list l" function with only mapcar and a lambda function. I guess...	Lisp Lambda function with IF clause Lisp Lambda function with IF clause lambda functional-programming common-lisp lisp Lisp Lambda Lisp Lambda function with IF clause I am trying to make a "Replace each occurence of x with y in list l" function with only mapcar and a lambda function. I guess that the lambda function wi...	[ -0.00921630859375, 0.01416015625, 0.00074005126953125, -0.004119873046875, -0.00311279296875, 0.005157470703125, 0.029296875, 0.0206298828125, -0.0028533935546875, 0.0211181640625, -0.0031280517578125, -0.01177978515625, -0.0203857421875, -0.004730224609375, 0.0146484375, 0.0205078125,...	[ 1261, 7008, 122930, 85, 32354, 678, 55449, 70731, 21, 6492, 123309, 28966, 39210, 4086, 254, 400, 13, 31577, 3249, 4332, 23935, 12638, 74918, 6620, 1022, 113, 23, 5303, 96, 4734, 22288, 3284, 12765, 2174, 42805, 105950, 425, 91995, 53, 22...	[ 0.1512451171875, 0.1971435546875, 0.199951171875, 0.1585693359375, 0.1925048828125, 0.1383056640625, 0.255615234375, 0.18408203125, 0.060791015625, 0.2115478515625, 0.1380615234375, 0.1036376953125, 0.06591796875, 0.1019287109375, 0.13720703125, 0.109130859375, 0.0197906494140625, ...	embed
32208568_c0	32208568	lisp	0	Title: What does '(list 1 2) means in Scheme? Problem title: What does '(list 1 2) means in Scheme? Tags: lisp, racket, scheme Problem: What does '(list 1 2) means in Scheme? I'm studying SICP and at the beginning of section 2.2.2 it gives the following code: (cons '(list 1 2) (list 3 4))) and says it constru...	What does '(list 1 2) means in Scheme? What does '(list 1 2) means in Scheme? lisp racket scheme What Scheme What does '(list 1 2) means in Scheme? I'm studying SICP and at the beginning of section 2.2.2 it gives the following code: (cons '(list 1 2) (list 3 4))) and says it constructs a list like ((1 2) 3 4)...	[ -0.00086212158203125, 0.026123046875, 0.001495361328125, 0.0166015625, -0.00323486328125, 0.017578125, -0.0029754638671875, 0.00156402587890625, 0.0030517578125, -0.021484375, -0.0027618408203125, -0.020751953125, 0.0019073486328125, -0.005401611328125, -0.021728515625, 0.0034027099609...	[ 4865, 14602, 54764, 3768, 6562, 106, 4958, 26950, 23, 34702, 282, 74, 400, 7008, 673, 27853, 150370, 242, 132, 198993, 70147, 18151, 25553, 138, 201, 64549, 5303, 1884, 41600, 13956, 10644, 3934, 1773, 12248, 2552, 27489, 33022, 54969, 1059...	[ 0.0584716796875, 0.076904296875, 0.0379638671875, 0.1416015625, 0.262939453125, 0.1207275390625, 0.2440185546875, 0.1571044921875, 0.086669921875, 0.2283935546875, 0.2059326171875, 0.04010009765625, 0.06915283203125, 0.1868896484375, 0.10888671875, 0.202392578125, 0.2261962890625, ...	embed
5045743_c0	5045743	lisp	0	Title: What method should I employ to extract keywords from a URL? Problem title: What method should I employ to extract keywords from a URL? Tags: c, lisp, python, seo Problem: What method should I employ to extract keywords from a URL? I am working on extraction of keywords. The system takes a URL as input and the ou...	What method should I employ to extract keywords from a URL? What method should I employ to extract keywords from a URL? c lisp python seo a What URL What method should I employ to extract keywords from a URL? I am working on extraction of keywords. The system takes a URL as input and the output is supposed to be keywor...	[ 0.0115966796875, 0.0098876953125, 0.00921630859375, 0.01177978515625, 0.005126953125, -0.005645751953125, -0.00125885009765625, 0.005889892578125, -0.0079345703125, -0.01904296875, -0.0240478515625, -0.03271484375, -0.0277099609375, 0.0113525390625, -0.0087890625, -0.002349853515625, ...	[ 4865, 55300, 5608, 87, 187016, 47, 125663, 166117, 7, 1295, 31862, 501, 400, 7008, 17198, 50828, 3750, 10, 20697, 4173, 10763, 111, 5426, 51776, 237, 107730, 140992, 134598, 28852, 10941, 179635, 4734, 90426, 289, 63920, 5036, 1884, 3714, 2...	[ 0.06207275390625, 0.1844482421875, 0.098876953125, 0.039794921875, 0.141845703125, 0.04486083984375, 0.223388671875, 0.26025390625, 0.127685546875, 0.1400146484375, 0.2418212890625, 0.03179931640625, 0.09906005859375, 0.1881103515625, 0.068603515625, 0.167236328125, 0.1619873046875, ...	embed
10467111_c2	10467111	lisp	2	UX VT ACCS PRODS (rest P) newP)))) (defun BuildRules (VT ACCS PRODS P) (BuildRules-AUX VT ACCS PRODS P nil)) (trace BuildRules-AUX) (trace BuildRules) (BuildRules VT (ACCESS P 'S) (PROD VT P)P) (defun SIMPL-AUX (VN VT P S ACCS PRODS) (setq ACCS (ACCESS P S)) (setq PRODS (PROD VT P)) (if Code signals: Lisp, De...	UX VT ACCS PRODS (rest P) newP)))) (defun BuildRules (VT ACCS PRODS P) (BuildRules-AUX VT ACCS PRODS P nil)) (trace BuildRules-AUX) (trace BuildRules) (BuildRules VT (ACCESS P 'S) (PROD VT P)P) (defun SIMPL-AUX (VN VT P S ACCS PRODS) (setq ACCS (ACCESS P S)) (setq PRODS (PROD VT P)) (if Code signals: Lisp, De...	[ -0.006683349609375, 0.0130615234375, 0.01409912109375, 0.040771484375, -0.006500244140625, 0.01495361328125, -0.01458740234375, 0.004241943359375, 0.018310546875, 0.009521484375, 0.0201416015625, 0.0016937255859375, 0.005035400390625, -0.0186767578125, 0.0037078857421875, 0.01708984375...	[ 71609, 86920, 12944, 19283, 10514, 13526, 56644, 436, 3525, 683, 80126, 112, 16498, 121137, 26951, 1577, 17324, 39989, 194695, 47970, 40288, 21130, 40711, 159, 3509, 15012, 864, 397, 3190, 28864, 26073, 1261, 7008, 88606, 449, 67227, 156906, ...	[ 0.287841796875, 0.275634765625, 0.150634765625, 0.2122802734375, 0.2222900390625, 0.1876220703125, 0.1806640625, 0.1328125, 0.1512451171875, 0.17431640625, 0.145263671875, 0.09814453125, 0.1446533203125, 0.1639404296875, 0.2213134765625, 0.178955078125, 0.1788330078125, 0.098876953...	embed
24924187_c0	24924187	lisp	0	Title: List object methods in Common Lisp (CLOS) Problem title: List object methods in Common Lisp (CLOS) Tags: lisp, common-lisp, oop, clos Problem: List object methods in Common Lisp (CLOS) Is there any way to get all methods defined for object and check if object responds to specified method? Looking for something l...	List object methods in Common Lisp (CLOS) List object methods in Common Lisp (CLOS) lisp common-lisp oop clos List Common Lisp CLOS method0 method1 List object methods in Common Lisp (CLOS) Is there any way to get all methods defined for object and check if object responds to specified method? Looking for something lik...	[ 0.00836181640625, 0.016845703125, 0.007232666015625, 0.0135498046875, -0.00885009765625, -0.00154876708984375, -0.00421142578125, 0.0146484375, 0.007415771484375, -0.032470703125, -0.0191650390625, -0.0218505859375, 0.004241943359375, -0.01092529296875, -0.00872802734375, -0.0277099609...	[ 32036, 36746, 150624, 23, 151301, 1261, 7008, 92933, 400, 39210, 4086, 254, 32500, 20450, 55300, 2389, 418, 441, 2499, 3917, 47, 2046, 756, 61924, 100, 136, 12765, 2174, 35644, 58735, 157268, 1884, 158189, 25, 3584, 31, 1928, 7352, 21922, ...	[ 0.18798828125, 0.2135009765625, 0.254150390625, 0.045166015625, 0.1485595703125, 0.1346435546875, 0.177978515625, 0.1846923828125, 0.07745361328125, 0.09344482421875, 0.065673828125, 0.1043701171875, 0.10455322265625, 0.128662109375, 0.2354736328125, 0.036865234375, 0.034576416015625...	embed
29196684_c0	29196684	lisp	0	Title: Invalid relative pathname error when compiling defsystem in slime with asdf3 Problem title: Invalid relative pathname error when compiling defsystem in slime with asdf3 Tags: lisp, slime, common-lisp, asdf Problem: Invalid relative pathname error when compiling defsystem in slime with asdf3 My SBCL is with ASDF3...	Invalid relative pathname error when compiling defsystem in slime with asdf3 Invalid relative pathname error when compiling defsystem in slime with asdf3 lisp slime common-lisp asdf Invalid asdf3 Invalid relative pathname error when compiling defsystem in slime with asdf3 My SBCL is with ASDF3. When I tried to compile ...	[ 0.00167083740234375, -0.004913330078125, 0.0152587890625, 0.01806640625, -0.020263671875, 0.00124359130859375, 0.00112152099609375, 0.00103759765625, -0.0126953125, 0.00408935546875, -0.0174560546875, -0.004791259765625, 0.005828857421875, 0.004669189453125, -0.0081787109375, 0.0049133...	[ 7013, 35845, 60875, 11627, 18499, 9969, 49725, 8, 420, 16751, 34264, 13, 237, 71, 363, 678, 400, 7008, 39210, 4086, 254, 90944, 37486, 6483, 38997, 37842, 1340, 125195, 1884, 903, 93002, 15400, 8834 ]	[ 0.151123046875, 0.200439453125, 0.1448974609375, 0.1883544921875, 0.1708984375, 0.09686279296875, 0.08050537109375, 0.12255859375, 0.1448974609375, 0.2113037109375, 0.154296875, 0.158935546875, 0.02911376953125, 0.03265380859375, 0.16064453125, 0.035736083984375, 0.038818359375, 0....	embed
3672256_c0	3672256	lisp	0	Title: Let: creating a temporary variable in Common Lisp Problem title: Let: creating a temporary variable in Common Lisp Tags: lisp, common-lisp Problem: Let: creating a temporary variable in Common Lisp Given a function: (defun foo (bar) (let ((baz bar)) (setf baz (+ baz 1))) I have been given to understand (perhaps ...	Let: creating a temporary variable in Common Lisp Let: creating a temporary variable in Common Lisp lisp common-lisp Common Lisp Let: creating a temporary variable in Common Lisp Given a function: I have been given to understand (perhaps incorrectly?) that baz becomes some sort of reference to bar, instead of being a t...	[ 0.016357421875, 0.0185546875, -0.0159912109375, 0.011962890625, 0.007568359375, -0.002410888671875, -0.0233154296875, 0.01092529296875, 0.0029449462890625, -0.0145263671875, 0.0111083984375, 0.03515625, 0.00860595703125, 0.027587890625, 0.0234375, -0.005584716796875, 0.00677490234375...	[ 10842, 105233, 142458, 53, 77336, 151301, 1261, 7008, 23, 400, 39210, 4086, 254, 77878, 32354, 34475, 28219, 29860, 214552, 16627, 24209, 91067, 1909, 64457, 29568, 43658, 2806, 1884, 54, 28282, 63284, 842, 2594, 1672, 115081, 756, 3444, 9342...	[ 0.1810302734375, 0.1884765625, 0.2120361328125, 0.0985107421875, 0.2763671875, 0.153564453125, 0.154296875, 0.181396484375, 0.03460693359375, 0.106201171875, 0.09747314453125, 0.09033203125, 0.1209716796875, 0.0233917236328125, 0.146728515625, 0.03118896484375, 0.0791015625, 0.0177...	embed
41639997_c0	41639997	lisp	0	Title: lisp function that doesn't evaluate his arguments Problem title: lisp function that doesn't evaluate his arguments Tags: lisp, operator-precedence Problem: lisp function that doesn't evaluate his arguments For my homework, I have a small List interpreter written in C with few functions already coded : ...	lisp function that doesn't evaluate his arguments lisp function that doesn't evaluate his arguments lisp operator-precedence lisp function that doesn't evaluate his arguments For my homework, I have a small List interpreter written in C with few functions already coded : set , cons , car , cdr and quote . And...	[ 0.0167236328125, 0.0228271484375, -0.004241943359375, 0.005950927734375, -0.003082275390625, 0.00102996826171875, 0.0152587890625, 0.0002346038818359375, 0.00122833251953125, -0.00982666015625, -0.00106048583984375, -0.022216796875, -0.00665283203125, -0.003509521484375, -0.0011062622070...	[ 400, 7008, 32354, 450, 22027, 3768, 18, 151575, 13, 1919, 10750, 39933, 4692, 37534, 6620, 5368, 18244, 32036, 29481, 56, 59121, 313, 10846, 21771, 18151, 5423, 158, 2258, 42, 66747, 15190, 305, 15700, 44126, 138, 219836, 15490, 55076, 864,...	[ 0.139404296875, 0.2127685546875, 0.2037353515625, 0.0142364501953125, 0.059478759765625, 0.024566650390625, 0.10791015625, 0.152099609375, 0.0166473388671875, 0.06756591796875, 0.1883544921875, 0.179443359375, 0.0318603515625, 0.1116943359375, 0.0204925537109375, 0.0029296875, 0.0778...	embed

17045941_c0

17045941

lisp

0

Title: How to compare two functions for extensional equivalence, as in (λx.2*x) == (λx.x+x)? Problem title: How to compare two functions for extensional equivalence, as in (λx.2*x) == (λx.x+x)? Tags: lisp, clojure, functional-programming, haskell, lambda Problem: How to compare two functions for extensional equivalence...

How to compare two functions for extensional equivalence, as in (λx.2*x) == (λx.x+x)? How to compare two functions for extensional equivalence, as in (λx.2*x) == (λx.x+x)? lisp clojure functional-programming haskell lambda How How to compare two functions for extensional equivalence, as in (λx.2*x) == (λx.x+x)? Is ther...

[ -0.008056640625, 0.0185546875, 0.00421142578125, 0.0101318359375, -0.01470947265625, -0.0030975341796875, 0.00469970703125, -0.00051116943359375, -0.006744384765625, -0.01953125, 0.00787353515625, 0.0186767578125, 0.00640869140625, 0.009521484375, 0.009765625, -0.013916015625, -0.001...

[ 11249, 47, 69101, 6626, 32354, 100, 111938, 289, 224743, 3956, 5970, 425, 304, 1639, 69112, 1328, 400, 7008, 20450, 461, 107, 123309, 28966, 1556, 142508, 6492, 85, 3917, 28, 161789, 5608, 30646, 29568, 171259, 183234 ]

[ 0.06378173828125, 0.048248291015625, 0.2396240234375, 0.1353759765625, 0.19970703125, 0.0364990234375, 0.2294921875, 0.1204833984375, 0.211669921875, 0.055511474609375, 0.06109619140625, 0.1180419921875, 0.1119384765625, 0.11572265625, 0.19091796875, 0.1973876953125, 0.03140258789062...

embed

40672914_c0

40672914

lisp

0

Title: Built-in case insensitive string= Problem title: Built-in case insensitive string= Tags: lisp, common-lisp Problem: Built-in case insensitive string= I need to compare two strings ignoring the case for the assoc :test function. I know that I can easily write the function like so: (defun cistring= (str1 str2) (st...

Built-in case insensitive string= Built-in case insensitive string= lisp common-lisp Built-in str1 str2 Built-in case insensitive string= I need to compare two strings ignoring the case for the assoc :test function. I know that I can easily write the function like so: However I was wondering: Is there is a built-in cas...

[ -0.0029296875, -0.00738525390625, -0.0012359619140625, 0.0096435546875, -0.001129150390625, 0.007415771484375, 0.0322265625, 0.00665283203125, 0.01373291015625, 0.00933837890625, 0.00494384765625, -0.0018768310546875, -0.008056640625, 0.00970458984375, -0.003814697265625, -0.0079345703...

[ 667, 24908, 73, 7225, 23, 176302, 13, 79315, 1369, 400, 7008, 39210, 4086, 254, 7704, 304, 69101, 6626, 47438, 63927, 238, 6954, 32354, 72546, 33022, 1884, 221, 88303, 7413 ]

[ 0.031494140625, 0.0888671875, 0.1260986328125, 0.1798095703125, 0.1036376953125, 0.2156982421875, 0.1357421875, 0.22509765625, 0.1458740234375, 0.058746337890625, 0.1361083984375, 0.06591796875, 0.0210113525390625, 0.0980224609375, 0.1014404296875, 0.0288238525390625, 0.1719970703125...

embed

55092036_c0

55092036

lisp

0

Title: Join numbers with whitespace in Common Lisp? Problem title: Join numbers with whitespace in Common Lisp? Tags: common-lisp, lisp, whitespace Problem: Join numbers with whitespace in Common Lisp? Writing a simple loop for a Lisp program, I want my numbers to be printed with whitespace in between them, (loop for i...

Join numbers with whitespace in Common Lisp? Join numbers with whitespace in Common Lisp? common-lisp lisp whitespace 1 Join Common Lisp prin1 Join numbers with whitespace in Common Lisp? Writing a simple loop for a Lisp program, I want my numbers to be printed with whitespace in between them, prints: id like it to pri...

[ 0.00390625, 0.00131988525390625, -0.0130615234375, 0.01092529296875, -0.01275634765625, 0.0322265625, 0.006927490234375, 0.0247802734375, 0.0068359375, -0.0380859375, 0.00335693359375, -0.00897216796875, -0.029052734375, -0.01953125, -0.016357421875, 0.023681640625, 0.006744384765625...

[ 113053, 101935, 678, 35011, 65421, 23, 151301, 1261, 7008, 39210, 4086, 254, 400, 106, 2448, 418, 213185, 8781, 40956, 1528, 3444, 28412, 17721, 3447, 1884, 45767, 7413, 3004, 1916, 151107, 4358 ]

[ 0.207275390625, 0.19775390625, 0.06427001953125, 0.181640625, 0.256591796875, 0.035308837890625, 0.1485595703125, 0.1588134765625, 0.2099609375, 0.10125732421875, 0.09619140625, 0.138671875, 0.1156005859375, 0.051025390625, 0.143310546875, 0.0163116455078125, 0.053070068359375, 0.0...

embed

39127754_c0

39127754

lisp

0

Title: Making a plugin system in clojure Problem title: Making a plugin system in clojure Tags: clojure, java, jvm, lisp Problem: Making a plugin system in clojure I'd like to know if it's possible to and how to implement a module system. Here's example of how it works: I have some folder (e.g. modules ), this folder h...

Making a plugin system in clojure Making a plugin system in clojure clojure java jvm lisp Making Making a plugin system in clojure I'd like to know if it's possible to and how to implement a module system. Here's example of how it works: I have some folder (e.g. modules ), this folder has a bunch of clojure files that ...

[ -0.01171875, 0.01275634765625, -0.015869140625, 0.022216796875, -0.002960205078125, 0.027587890625, -0.0004634857177734375, -0.0020904541015625, 0.0027008056640625, -0.044189453125, -0.0225830078125, 0.0247802734375, 0.0002307891845703125, -0.0015716552734375, -0.00836181640625, -0.005...

[ 13676, 69993, 5426, 20450, 461, 107, 79, 330, 334, 39, 400, 7008, 23, 1884, 3714, 7722, 29479, 88996, 27781, 43240, 78303, 147306, 102158, 31255, 77336, 9351, 6835, 3355, 72367, 3934, 1632, 5303, 8560, 184750, 1295 ]

[ 0.0941162109375, 0.282958984375, 0.206787109375, 0.1461181640625, 0.182861328125, 0.1556396484375, 0.04412841796875, 0.115966796875, 0.033966064453125, 0.055572509765625, 0.032470703125, 0.143310546875, 0.01397705078125, 0.02685546875, 0.005401611328125, 0.1104736328125, 0.1414794921...

embed

4724_c0

4724

lisp

0

Title: Why should I learn Lisp? Problem title: Why should I learn Lisp? Tags: functional-programming, lisp Problem: Why should I learn Lisp? I really feel that I should learn Lisp and there are plenty of good resources out there to help me do it. I'm not put off by the complicated syntax, but where in "traditional comm...

Why should I learn Lisp? Why should I learn Lisp? functional-programming lisp Why Lisp Why should I learn Lisp? I really feel that I should learn Lisp and there are plenty of good resources out there to help me do it. I'm not put off by the complicated syntax, but where in "traditional commercial programming" would I f...

[ -0.002532958984375, 0.0162353515625, 0.01324462890625, 0.0089111328125, -0.0068359375, 0.0284423828125, -0.003021240234375, 0.01263427734375, 0.0198974609375, -0.044189453125, 0.0035552978515625, -0.0103759765625, 0.00531005859375, 0.0185546875, -0.00531005859375, 0.003997802734375, ...

[ 44084, 5608, 87, 30698, 1261, 7008, 123309, 28966, 214, 400, 6183, 12319, 87794, 4127, 65514, 4358, 96704, 6002, 86531, 209990, 60091, 56037, 449, 44677, 10422, 4527, 442, 64457, 59158, 46876, 200, 14155, 9007, 59121, 23 ]

[ 0.153564453125, 0.1566162109375, 0.05706787109375, 0.1629638671875, 0.206298828125, 0.2685546875, 0.14306640625, 0.1341552734375, 0.0230255126953125, 0.1484375, 0.05743408203125, 0.09405517578125, 0.0181121826171875, 0.005126953125, 0.076416015625, 0.043060302734375, 0.071044921875, ...

embed

8243813_c0

8243813

lisp

0

Title: Is there a way to extract all elements of a list in place Problem title: Is there a way to extract all elements of a list in place Tags: list, lisp, common-lisp Problem: Is there a way to extract all elements of a list in place Im looking for a way to extract all the elements of a list in common lisp. Like this ...

Is there a way to extract all elements of a list in place Is there a way to extract all elements of a list in place list lisp common-lisp Is there a way to extract all elements of a list in place Im looking for a way to extract all the elements of a list in common lisp. Like this Edit: The usage example I gave was not ...

[ -0.00015735626220703125, 0.004852294921875, 0.00311279296875, 0.01202392578125, -0.002349853515625, 0.0142822265625, 0.000118255615234375, -0.00124359130859375, 0.00634765625, -0.031494140625, 0.0130615234375, -0.006988525390625, -0.004608154296875, -0.00579833984375, -0.0157470703125, ...

[ 2071, 2685, 10, 3917, 47, 125663, 756, 80854, 111, 5303, 23, 3687, 400, 7008, 39210, 4086, 254, 16487, 70, 127689, 27781, 193844, 7722, 36356, 1810, 1884 ]

[ 0.010040283203125, 0.043365478515625, 0.05767822265625, 0.1270751953125, 0.08453369140625, 0.2486572265625, 0.158447265625, 0.200927734375, 0.10302734375, 0.22802734375, 0.04986572265625, 0.2161865234375, 0.1099853515625, 0.1865234375, 0.15576171875, 0.090087890625, 0.1429443359375, ...

embed

8599844_c0

8599844

lisp

0

Title: Is it possible / How to use racket in C++ Applications? Problem title: Is it possible / How to use racket in C++ Applications? Tags: racket, lisp, c%2B%2B Problem: Is it possible / How to use racket in C++ Applications? I heard that Racket could be embedded (maybe also with C++). http://docs.racket-lang.org/insi...

Is it possible / How to use racket in C++ Applications? Is it possible / How to use racket in C++ Applications? racket lisp c%2B%2B How Applications Is it possible / How to use racket in C++ Applications? I heard that Racket could be embedded (maybe also with C++). http://docs.racket-lang.org/inside/index.html http://d...

[ -0.0028076171875, 0.00537109375, -0.00024318695068359375, 0.0177001953125, 0.0037841796875, 0.0177001953125, 0.0242919921875, 0.000766754150390625, 0.004486083984375, -0.048583984375, 0.0177001953125, -0.033447265625, -0.01708984375, 0.03076171875, 0.006866455078125, -0.0157470703125, ...

[ 2071, 442, 7722, 248, 11249, 47, 4527, 673, 27853, 23, 313, 37223, 104921, 7, 400, 7008, 501, 49782, 2552, 5809, 55720, 69819, 678, 219, 3066, 38529, 8951, 3917, 11, 33209, 3642, 11675, 1295, 8781, 27781 ]

[ 0.040557861328125, 0.06414794921875, 0.1796875, 0.0204010009765625, 0.0921630859375, 0.01776123046875, 0.1568603515625, 0.1712646484375, 0.288330078125, 0.067138671875, 0.0994873046875, 0.2822265625, 0.1636962890625, 0.0227813720703125, 0.0550537109375, 0.1207275390625, 0.03259277343...

embed

6810720_c0

6810720

lisp

0

Title: Clojure presentation for beginners? Problem title: Clojure presentation for beginners? Tags: java, clojure, functional-programming, language-agnostic, lisp Problem: Clojure presentation for beginners? I need to make a presentation for beginners about the Clojure language. What are your suggestions on selecting t...

Clojure presentation for beginners? Clojure presentation for beginners? java clojure functional-programming language-agnostic lisp Clojure Clojure presentation for beginners? I need to make a presentation for beginners about the Clojure language. What are your suggestions on selecting topics on it? What are the points ...

[ 0.01043701171875, 0.0107421875, 0.0140380859375, 0.010498046875, -0.00433349609375, -0.008056640625, 0.02392578125, -0.01953125, 0, -0.00848388671875, -0.0137939453125, -0.005035400390625, -0.03173828125, 0.00958251953125, 0.00081634521484375, -0.01495361328125, -0.00848388671875, ...

[ 51053, 461, 107, 92252, 100, 9842, 43148, 79, 330, 20450, 123309, 28966, 46876, 2895, 400, 7008, 3871, 3249, 10, 157666, 36849, 28451, 442, 26847, 26698, 122446, 56037, 214709, 3299 ]

[ 0.176025390625, 0.21142578125, 0.1680908203125, 0.22119140625, 0.0777587890625, 0.133544921875, 0.1298828125, 0.10693359375, 0.154052734375, 0.1434326171875, 0.128173828125, 0.08306884765625, 0.17236328125, 0.1212158203125, 0.041168212890625, 0.12127685546875, 0.03466796875, 0.0501...

embed

20686005_c0

20686005

lisp

0

Title: Pushing in list Problem title: Pushing in list Tags: lisp Problem: Pushing in list What I want to do is to repeteadly take an element from a list and if it respects the condition,I'll append it to a new list and to keep the list format.How do I do the appending part? I'm getting the element with nth and I've tri...

Pushing in list Pushing in list lisp Pushing Pushing in list What I want to do is to repeteadly take an element from a list and if it respects the condition,I'll append it to a new list and to keep the list format.How do I do the appending part? I'm getting the element with nth and I've tried several variants of push b...

[ -0.00689697265625, 0.0164794921875, 0.0000591278076171875, 0.005218505859375, 0.0033111572265625, 0.026611328125, -0.006134033203125, 0.00958251953125, 0.012939453125, -0.0062255859375, 0.00823974609375, -0.015625, -0.016357421875, -0.013671875, -0.01611328125, 0.0030059814453125, 0....

[ 114405, 214, 23, 5303, 400, 7008, 3444, 54, 69495, 67, 712, 5646, 12830, 1295, 2174, 15072, 35431, 114689, 71, 3525, 13695, 9384, 81826, 1747, 96819, 2831, 20949, 678, 653, 927, 37842, 40368, 20117, 25944, 7440, 3509, 864, 10, 4958, 5036,...

[ 0.2490234375, 0.1541748046875, 0.1552734375, 0.2220458984375, 0.08648681640625, 0.1531982421875, 0.1004638671875, 0.03887939453125, 0.14892578125, 0.07855224609375, 0.071044921875, 0.1507568359375, 0.1468505859375, 0.1058349609375, 0.040435791015625, 0.1156005859375, 0.1572265625, ...

embed

5226767_c0

5226767

lisp

0

Title: Does anybody know a good documentation that compares different Scheme implementations? Problem title: Does anybody know a good documentation that compares different Scheme implementations? Tags: lisp, implementation, scheme, documentation Problem: Does anybody know a good documentation that compares different Sc...

Does anybody know a good documentation that compares different Scheme implementations? Does anybody know a good documentation that compares different Scheme implementations? lisp implementation scheme documentation Does Scheme Does anybody know a good documentation that compares different Scheme implementations? I am l...

[ 0.0024871826171875, 0.017822265625, 0.0205078125, 0.01300048828125, -0.00173187255859375, 0.00531005859375, 0.000911712646484375, -0.020751953125, 0.00726318359375, 0.01007080078125, 0.0277099609375, 0.0048828125, -0.0196533203125, 0.00171661376953125, 0.0091552734375, -0.0189208984375...

[ 37873, 3714, 4127, 209806, 69101, 7, 12921, 34702, 282, 208124, 400, 7008, 150370, 101790, 16487, 225490, 197527, 10000, 14495, 53513, 133, 35978, 149016, 21771, 32316 ]

[ 0.0516357421875, 0.08270263671875, 0.08990478515625, 0.247802734375, 0.18603515625, 0.027679443359375, 0.138916015625, 0.207763671875, 0.2266845703125, 0.18896484375, 0.12298583984375, 0.232177734375, 0.22216796875, 0.09661865234375, 0.04046630859375, 0.1859130859375, 0.25830078125, ...

embed

31821799_c0

31821799

lisp

0

Title: scbl exception Heap exhausted during garbage collection Problem title: scbl exception Heap exhausted during garbage collection Tags: lisp, sbcl, common-lisp Problem: scbl exception Heap exhausted during garbage collection Welcome to LDB, a low-level debugger for the Lisp runtime environment. ldb> Any suggestion?...

scbl exception Heap exhausted during garbage collection scbl exception Heap exhausted during garbage collection lisp sbcl common-lisp Heap Gen StaPg UbSta LaSta LUbSt Boxed Unboxed LUB Alloc Waste Trig GCs Mem-age Total Dynamic-space-size GC-INHIBIT GC-PENDING STOP-FOR-GC-PENDING SBCL Welcome LDB Lisp scbl exception He...

[ 0.01556396484375, 0.0252685546875, -0.01397705078125, -0.0115966796875, -0.01092529296875, 0.0013275146484375, -0.007476806640625, 0.0225830078125, -0.003570556640625, -0.014404296875, 0.008544921875, 0.00084686279296875, 0.006866455078125, 0.00445556640625, 0.0181884765625, -0.0096435...

[ 9023, 9030, 131527, 1529, 2631, 146353, 297, 20271, 3671, 402, 42486, 400, 7008, 275, 34937, 39210, 4086, 254, 15937, 6512, 42378, 37455, 27271, 11728, 32338, 6652, 5282, 67, 4699, 69657, 17443, 4588, 33867, 73327, 65421, 62539, 21159, 65441,...

[ 0.08685302734375, 0.220947265625, 0.2335205078125, 0.193603515625, 0.1597900390625, 0.2420654296875, 0.093505859375, 0.101806640625, 0.055206298828125, 0.1575927734375, 0.210205078125, 0.06414794921875, 0.186279296875, 0.05450439453125, 0.18212890625, 0.0711669921875, 0.0732421875, ...

embed

20933307_c0

20933307

lisp

0

Title: Lisp - "case" macro implementation Problem title: Lisp - "case" macro implementation Tags: macros, lisp Problem: Lisp - "case" macro implementation I'm wondering how the case macro works, but just expanding it is not enough. How does it generate the cond statement without knowing how many arg...

Lisp - "case" macro implementation Lisp - "case" macro implementation macros lisp Lisp Lisp - "case" macro implementation I'm wondering how the case macro works, but just expanding it is not enough. How does it generate the cond statement without knowing how many arguments there are? Does it use a l...

[ 0.012451171875, 0.0380859375, -0.0283203125, 0.00179290771484375, 0.00958251953125, 0.01507568359375, 0.00019359588623046875, 0.008056640625, -0.002197265625, -0.024658203125, 0.007781982421875, -0.00083160400390625, 0.0031585693359375, -0.0186767578125, 0.0047607421875, 0.00830078125,...

[ 1261, 7008, 58437, 111789, 208124, 400, 149016, 3642, 7225, 43240, 1284, 71062, 20174, 11249, 139392, 158, 71, 63805, 15490, 141956, 5941, 10750, 4527, 40956, 15400, 959, 7639, 1257, 11675, 83613, 2940, 21373, 26458 ]

[ 0.1363525390625, 0.2374267578125, 0.239501953125, 0.2078857421875, 0.1500244140625, 0.07061767578125, 0.0662841796875, 0.0240478515625, 0.2347412109375, 0.12646484375, 0.00897216796875, 0.1383056640625, 0.0294952392578125, 0.0260162353515625, 0.135498046875, 0.1392822265625, 0.141845...

embed

9310913_c0

9310913

lisp

0

Title: how to get two elements from a list each time in common-lisp? Problem title: how to get two elements from a list each time in common-lisp? Tags: lisp, common-lisp Problem: how to get two elements from a list each time in common-lisp? For ((1 2) (3 4) (5 6)) , you can use loop for (a b) in '((1 2) (3 4) (5 6)) to...

how to get two elements from a list each time in common-lisp? how to get two elements from a list each time in common-lisp? lisp common-lisp a how to get two elements from a list each time in common-lisp? For ((1 2) (3 4) (5 6)) , you can use loop for (a b) in '((1 2) (3 4) (5 6)) to get a = 1, b = 2 each time. But for...

[ 0.0023193359375, 0.0022430419921875, -0.0048828125, 0.0089111328125, 0.01055908203125, 0.0281982421875, -0.0087890625, 0.01031494140625, 0.0011138916015625, -0.03466796875, 0.019287109375, 0.01007080078125, 0.0000762939453125, -0.00439453125, -0.00543212890625, -0.0091552734375, -0.0...

[ 3642, 47, 2046, 6626, 80854, 1295, 5303, 12638, 1733, 39210, 4086, 254, 23, 400, 7008, 10, 1326, 41600, 4958, 6896, 13956, 11516, 35914, 4527, 40956, 100, 876, 242, 2203, 106, 116, 138, 9790, 1022, 98, 7569, 3284, 42, 787, 11522 ]

[ 0.08465576171875, 0.054290771484375, 0.172119140625, 0.226318359375, 0.229248046875, 0.1278076171875, 0.2236328125, 0.177734375, 0.2327880859375, 0.1810302734375, 0.11962890625, 0.202392578125, 0.050140380859375, 0.09295654296875, 0.2015380859375, 0.0594482421875, 0.00128173828125, ...

embed

6081921_c0

6081921

lisp

0

Title: How do I pass arguments to map in emacs lisp? Problem title: How do I pass arguments to map in emacs lisp? Tags: emacs, lisp, elisp Problem: How do I pass arguments to map in emacs lisp? I want to write a small function to add a value to a list. it looks like this: (defvar fares '(31.14 28.12 25.10 22.08 19.06 1...

How do I pass arguments to map in emacs lisp? How do I pass arguments to map in emacs lisp? emacs lisp elisp How How do I pass arguments to map in emacs lisp? I want to write a small function to add a value to a list. it looks like this: (defvar fares '(31.14 28.12 25.10 22.08 19.06 16.04 13.02 10)) (defun plus-extra (...

[ 0.004669189453125, 0.01226806640625, -0.004913330078125, -0.0361328125, -0.018798828125, 0.0238037109375, -0.007080078125, 0.01397705078125, 0.0103759765625, -0.02587890625, -0.01171875, -0.00762939453125, -0.0164794921875, 0.03271484375, -0.0123291015625, -0.0216064453125, -0.009826...

[ 11249, 87, 27875, 10750, 7, 47, 22288, 23, 352, 2263, 400, 7008, 15296, 54, 3444, 33022, 19336, 32354, 15190, 34292, 5303, 33342, 1884, 112, 420, 1961, 4889, 5016, 2592, 12511, 1530, 11653, 963, 8892, 8318, 6529, 9016, 6849, 7709, 5847, ...

[ 0.09234619140625, 0.0165252685546875, 0.1729736328125, 0.282470703125, 0.1280517578125, 0.13134765625, 0.22900390625, 0.0706787109375, 0.1065673828125, 0.1571044921875, 0.1424560546875, 0.2353515625, 0.112060546875, 0.001312255859375, 0.034027099609375, 0.0899658203125, 0.09436035156...

embed

5022753_c0

5022753

lisp

0

Title: How do I tell if a list contains NILs? Problem title: How do I tell if a list contains NILs? Tags: common-lisp, lisp Problem: How do I tell if a list contains NILs? I have the following list: (X O X O X NIL X NIL O) If I do (find 'x (X O X O X NIL X NIL O)) it returns X , so I know the list contains X . But If I...

How do I tell if a list contains NILs? How do I tell if a list contains NILs? common-lisp lisp How NILs NIL How do I tell if a list contains NILs? I have the following list: If I do (find 'x (X O X O X NIL X NIL O)) it returns X , so I know the list contains X . But If I do (find nil (X O X O X NIL X NIL O)) I get NIL ...

[ -0.0169677734375, -0.0006256103515625, 0.0213623046875, -0.0005950927734375, -0.0037078857421875, 0.01116943359375, 0.035888671875, -0.0003204345703125, 0.00341796875, 0.0166015625, -0.002655029296875, -0.00787353515625, -0.004486083984375, -0.01031494140625, 0.0177001953125, 0.0178222...

[ 11249, 54, 87, 14192, 2174, 5303, 70541, 541, 16444, 7, 10, 39210, 4086, 254, 400, 7008, 765, 25632, 4263, 111607, 425, 1542, 1193, 180, 30646, 3714, 17324, 2046, 91084, 9393, 831, 91, 959 ]

[ 0.052734375, 0.040557861328125, 0.044525146484375, 0.16796875, 0.106201171875, 0.23486328125, 0.164794921875, 0.1607666015625, 0.22265625, 0.137939453125, 0.016693115234375, 0.107177734375, 0.053741455078125, 0.08447265625, 0.06719970703125, 0.10009765625, 0.007781982421875, 0.0176...

embed

68703818_c1

68703818

lisp

1

list, atom by atom.(ie. "(set x (* 5 2))") I designed it as described above assuming that C provides a built-in type() or isinstance() function that I could use in the eval function - to the best of my knowledge, it doesn't. How would I mimic the function of Python's isinstance() in C, so that I can compare types of v...

[ 0.00156402587890625, 0.0140380859375, 0.0228271484375, 0.02685546875, 0.004241943359375, 0.01708984375, 0.015625, 0.0042724609375, 0.00970458984375, -0.008056640625, 0.000278472900390625, -0.01470947265625, 0.01361083984375, -0.024658203125, -0.01483154296875, 0.00885009765625, 0.000...

[ 5303, 34627, 390, 478, 3509, 1022, 75402, 190, 4958, 82775, 442, 151552, 66596, 313, 87344, 88303, 73, 10644, 132, 83, 116071, 32354, 4527, 28, 1405, 22027, 18, 11249, 2806, 324, 21068, 70, 145581, 23, 69101, 52895, 2292, 71, 6275, 1314, ...

[ 0.232666015625, 0.2039794921875, 0.1163330078125, 0.000518798828125, 0.1378173828125, 0.07666015625, 0.026092529296875, 0.0733642578125, 0.102294921875, 0.153564453125, 0.0185546875, 0.00225830078125, 0.04925537109375, 0.1859130859375, 0.07794189453125, 0.077880859375, 0.09130859375,...

embed

11748780_c0

11748780

lisp

0

Title: Is it possible something like lvalue of perl or setf of lisp in python? Problem title: Is it possible something like lvalue of perl or setf of lisp in python? Tags: lisp, lvalue, perl, python Problem: Is it possible something like lvalue of perl or setf of lisp in python? In lisp you can say: (setf (aref a 1) 5)...

Is it possible something like lvalue of perl or setf of lisp in python? Is it possible something like lvalue of perl or setf of lisp in python? lisp lvalue perl python Is it possible something like lvalue of perl or setf of lisp in python? In lisp you can say: In perl you can say: Is it possible something like this in ...

[ 0.01068115234375, 0.01611328125, 0.02587890625, -0.00148773193359375, -0.003173828125, -0.01373291015625, -0.01214599609375, -0.00445556640625, 0.01507568359375, -0.01446533203125, 0.0177001953125, 0.03466796875, 0.006927490234375, -0.0223388671875, -0.0020904541015625, -0.0361328125, ...

[ 7722, 9844, 1884, 96, 27494, 13, 117, 141, 5423, 420, 400, 7008, 23, 17198, 50828, 442, 111, 707, 5154, 360, 831, 2071, 903, 4527, 32354, 16750, 237, 30388, 95486, 41018 ]

[ 0.197998046875, 0.1019287109375, 0.1346435546875, 0.146240234375, 0.28125, 0.176025390625, 0.16015625, 0.2083740234375, 0.139892578125, 0.2093505859375, 0.14404296875, 0.2296142578125, 0.060150146484375, 0.10186767578125, 0.1651611328125, 0.08935546875, 0.0372314453125, 0.000274658...

embed

22876099_c1

22876099

lisp

1

h z t)))" Either works for me. What my current working grammar does is take (f x (g y (h z t))) and output "(f x (g y (h z t)))" While it is trivial to allow for just one newline character after every "Token" or "Tuple", I wish to accept the following as legal code: (f x (g y ( h z t) ) ) Code signals: Parser, Start, L...

[ 0.009033203125, 0.0115966796875, -0.020751953125, 0.032958984375, -0.01055908203125, 0.0211181640625, 0.00958251953125, 0.00010824203491210938, 0.0235595703125, -0.0118408203125, -0.0093994140625, 0.000263214111328125, -0.019775390625, 0.003265380859375, -0.013671875, 0.0115966796875, ...

[ 1096, 97, 808, 32149, 4565, 9319, 43240, 100, 163, 4865, 759, 43581, 20697, 122092, 147, 14602, 5646, 420, 1022, 177, 113, 127, 140992, 686, 63769, 1660, 1632, 3525, 2256, 62816, 7103, 11907, 7763, 1098, 707, 15665, 8705, 32599, 26946, 25...

[ 0.1241455078125, 0.1424560546875, 0.1842041015625, 0.1788330078125, 0.0256500244140625, 0.165771484375, 0.1177978515625, 0.067626953125, 0.07379150390625, 0.001953125, 0.0279998779296875, 0.104736328125, 0.1319580078125, 0.203857421875, 0.1483154296875, 0.0206756591796875, 0.10131835...

embed

9595519_c0

9595519

lisp

0

Title: Why is it necessary to put #' in some cases in Lisp? Problem title: Why is it necessary to put #' in some cases in Lisp? Tags: lisp, syntax Problem: Why is it necessary to put #' in some cases in Lisp? Possible Duplicate: What does # mean in LISP I am learning lisp, but one thing I do not understand is...

Why is it necessary to put #' in some cases in Lisp? Why is it necessary to put #' in some cases in Lisp? lisp syntax Why Lisp Why is it necessary to put #' in some cases in Lisp? I am learning lisp, but one thing I do not understand is why it is necessary for #' to be used. If a function with a specific name...

[ -0.0021820068359375, 0.024658203125, 0.00347900390625, -0.010009765625, 0.001678466796875, 0.01141357421875, -0.00052642822265625, 0.03076171875, 0.01123046875, -0.03466796875, 0.0020599365234375, 0.004241943359375, 0.007476806640625, -0.01708984375, 0.00341796875, 0.000637054443359375...

[ 44084, 83, 442, 63559, 3884, 468, 3768, 74, 3060, 50218, 23, 1261, 7008, 47, 54764, 400, 6002, 86531, 25, 28219, 15400, 100, 11814, 32354, 678, 29458, 9351, 32316, 5351, 6863, 10, 77336 ]

[ 0.122802734375, 0.029571533203125, 0.0290069580078125, 0.1759033203125, 0.10589599609375, 0.158203125, 0.122802734375, 0.0369873046875, 0.043853759765625, 0.08294677734375, 0.059539794921875, 0.1458740234375, 0.2139892578125, 0.0172576904296875, 0.012359619140625, 0.09423828125, 0.01...

embed

5833471_c1

5833471

lisp

1

the goal state. The graph I am using looks like this: (a (b 3) (c 1)) (b (a 3) (d 1)) I have a conversion function to make this work with the above BFS implementation, but now I need to turn this into Hill climbing using this graph format. I'm just not sure where to begin, and have been trying things to no avail. I kn...

[ 0.01708984375, 0.022705078125, 0.004791259765625, 0.0120849609375, -0.01507568359375, 0.018310546875, -0.0211181640625, -0.0301513671875, -0.00872802734375, -0.00592041015625, 0.0130615234375, -0.01153564453125, 0.00946044921875, -0.00018215179443359375, -0.0115966796875, -0.0157470703...

[ 70, 69236, 11341, 41382, 17368, 33342, 1884, 903, 275, 8439, 4879, 71, 142477, 32354, 4488, 36917, 335, 36381, 208124, 3871, 15504, 3934, 37639, 194637, 214, 9384, 959, 9077, 9842, 31577, 8966, 110, 15549, 71062, 944, 13388, 20903, 271, 112...

[ 0.039459228515625, 0.2744140625, 0.21142578125, 0.25341796875, 0.1234130859375, 0.1331787109375, 0.0755615234375, 0.052154541015625, 0.025482177734375, 0.1011962890625, 0.042999267578125, 0.06817626953125, 0.1666259765625, 0.1749267578125, 0.0594482421875, 0.012115478515625, 0.057434...

embed

25013390_c0

25013390

lisp

0

Title: creating assoc function in lisp that will find value from a-list Problem title: creating assoc function in lisp that will find value from a-list Tags: lisp, common-lisp Problem: creating assoc function in lisp that will find value from a-list How can i create an assoc function that can find value from a-list. Ca...

creating assoc function in lisp that will find value from a-list creating assoc function in lisp that will find value from a-list lisp common-lisp a-list creating assoc function in lisp that will find value from a-list How can i create an assoc function that can find value from a-list. Can anyone help me on this as i d...

[ 0.009033203125, 0.005218505859375, -0.01470947265625, -0.00360107421875, -0.0011749267578125, 0.00347900390625, 0.01190185546875, 0.0157470703125, 0.026123046875, -0.0322265625, -0.01202392578125, -0.00482177734375, -0.000949859619140625, -0.023681640625, 0, -0.00127410888671875, 0.0...

[ 105233, 63927, 238, 32354, 23, 400, 7008, 450, 1221, 7413, 34292, 1295, 10, 6562, 39210, 4086, 254, 9, 831, 17, 28282, 142, 35672, 4358, 903, 3642, 43240, 3525, 191147, 98363, 98441, 21771, 26484, 70 ]

[ 0.155517578125, 0.211669921875, 0.232421875, 0.2449951171875, 0.05841064453125, 0.1348876953125, 0.204833984375, 0.02899169921875, 0.0135498046875, 0.166259765625, 0.2276611328125, 0.1407470703125, 0.095703125, 0.251220703125, 0.10888671875, 0.1136474609375, 0.14794921875, 0.057403...

embed

40985457_c0

40985457

lisp

0

Title: Common Lisp: flush standard output Problem title: Common Lisp: flush standard output Tags: common-lisp, lisp, stdout Problem: Common Lisp: flush standard output Trying to learn lisp (and I guess emacs along with it). I was wondering how you would go about clearing the output and replacing it. Could be in a LISP ...

Common Lisp: flush standard output Common Lisp: flush standard output common-lisp lisp stdout Common Lisp sys.stdout.write sys.stdout.flush Common Lisp: flush standard output Trying to learn lisp (and I guess emacs along with it). I was wondering how you would go about clearing the output and replacing it. Could be in ...

[ 0.00299072265625, 0.0281982421875, -0.00634765625, -0.00396728515625, -0.036376953125, -0.0026702880859375, 0.01434326171875, -0.007537841796875, -0.00506591796875, 0.00335693359375, -0.0035858154296875, 0.0177001953125, -0.002197265625, -0.0026397705078125, -0.00653076171875, 0.000404...

[ 151301, 1261, 7008, 14838, 1495, 5570, 140992, 39210, 4086, 254, 400, 6138, 246, 1003, 954, 271, 18781, 18026, 30698, 352, 2263, 7, 149016, 1672, 34735, 214, 136, 133266, 442, 16970, 9434, 456, 2424, 373, 18234, 27255, 25632, 17198, 50828 ]

[ 0.1676025390625, 0.1766357421875, 0.1932373046875, 0.2247314453125, 0.1455078125, 0.199951171875, 0.2481689453125, 0.1456298828125, 0.1219482421875, 0.1495361328125, 0.1353759765625, 0.1029052734375, 0.0079345703125, 0.126708984375, 0.076904296875, 0.0999755859375, 0.00640869140625, ...

embed

28956010_c0

28956010

lisp

0

Title: SBCL Run Shell Command Problem title: SBCL Run Shell Command Tags: lisp, python, sbcl, shell, common-lisp Problem: SBCL Run Shell Command I've seen Executing a shell command from Common Lisp and its answers, but I'm still not sure whether SBCL provides a way execute shell commands from code. The SBCL Manual does...

SBCL Run Shell Command SBCL Run Shell Command lisp python sbcl shell common-lisp SBCL Run Shell Command SBCL Run Shell Command I've seen Executing a shell command from Common Lisp and its answers, but I'm still not sure whether SBCL provides a way execute shell commands from code. The SBCL Manual does support POSIX, bu...

[ 0.0086669921875, 0.01336669921875, 0.00131988525390625, 0.0224609375, -0.0002269744873046875, 0.021484375, 0.026611328125, -0.0184326171875, -0.0181884765625, -0.0069580078125, -0.0126953125, 0.04296875, -0.01092529296875, 0.0155029296875, -0.01483154296875, 0.00482177734375, -0.0063...

[ 90944, 37486, 28398, 108362, 123573, 400, 7008, 17198, 50828, 91, 275, 34937, 128019, 39210, 4086, 254, 51592, 211603, 75101, 1295, 151301, 1261, 35166, 7464, 9077, 87344, 3917, 71924, 18151, 111021, 8060, 54602, 21487, 156377, 4785, 77546, 173...

[ 0.1566162109375, 0.2340087890625, 0.09814453125, 0.2080078125, 0.241455078125, 0.0806884765625, 0.2166748046875, 0.04547119140625, 0.1112060546875, 0.0235137939453125, 0.096923828125, 0.2010498046875, 0.258056640625, 0.119873046875, 0.0865478515625, 0.1693115234375, 0.02093505859375,...

embed

7753858_c0

7753858

lisp

0

Title: Learning Lisp and artificial intelligence Problem title: Learning Lisp and artificial intelligence Tags: lisp, artificial-intelligence Problem: Learning Lisp and artificial intelligence This semester at college I have a course for Artificial Intelligence and we are studying Lisp. The problem is that I don't have...

Learning Lisp and artificial intelligence Learning Lisp and artificial intelligence lisp artificial-intelligence Learning Lisp Learning Lisp and artificial intelligence This semester at college I have a course for Artificial Intelligence and we are studying Lisp. The problem is that I don't have any functional programm...

[ 0.01287841796875, 0.0224609375, -0.006866455078125, 0.027099609375, -0.0184326171875, 0.0235595703125, -0.005340576171875, 0.009033203125, 0.0152587890625, -0.051513671875, 0.025390625, -0.01287841796875, -0.00830078125, 0.0203857421875, 0.0089111328125, -0.0054931640625, -0.01068115...

[ 114344, 1261, 7008, 136, 66733, 130687, 400, 49345, 99, 40466, 15411, 231996, 157075, 35187, 2967, 2301, 18, 2499, 123309, 56037, 449, 76615, 3714, 180, 20880, 156202, 74181, 47302, 67330, 4127, 42840, 2046, 163, 1257, 38352, 98 ]

[ 0.1468505859375, 0.2152099609375, 0.255859375, 0.09893798828125, 0.1533203125, 0.1910400390625, 0.153564453125, 0.0928955078125, 0.034576416015625, 0.152099609375, 0.0780029296875, 0.162109375, 0.188720703125, 0.0687255859375, 0.1253662109375, 0.029571533203125, 0.053070068359375, ...

embed

65588066_c0

65588066

lisp

0

Title: Applying append on mapcon in Lisp Problem title: Applying append on mapcon in Lisp Tags: common-lisp, functional-programming, map-function, lisp Problem: Applying append on mapcon in Lisp The Lisp function G is defined by: (defun g (l) (mapcon #'list l)) What is the result of evaluating the form (apply #'append ...

Applying append on mapcon in Lisp Applying append on mapcon in Lisp common-lisp functional-programming map-function lisp Applying Lisp Applying append on mapcon in Lisp I've seen that mapcon works with nconc and cdr , but the final answer will be (1 2 2 2) and I don't know how to properly explain it. Please help.

[ -0.0032806396484375, 0.00787353515625, 0.0216064453125, 0.0086669921875, -0.00244140625, 0.01031494140625, 0.00003838539123535156, 0.0164794921875, 0.01190185546875, -0.0157470703125, 0.0096435546875, -0.015869140625, -0.0186767578125, 0.0205078125, -0.0017852783203125, 0.004150390625,...

[ 5659, 538, 214, 114689, 71, 98, 22288, 2271, 23, 1261, 7008, 39210, 4086, 254, 123309, 28966, 137175, 400, 51592, 43240, 678, 653, 238, 136, 56329, 42, 2704, 35166, 2858, 116, 4958, 155965, 73342, 442, 4358 ]

[ 0.1357421875, 0.11492919921875, 0.0657958984375, 0.207763671875, 0.1905517578125, 0.1314697265625, 0.2100830078125, 0.26318359375, 0.07244873046875, 0.1680908203125, 0.2340087890625, 0.079345703125, 0.1085205078125, 0.171630859375, 0.13720703125, 0.07489013671875, 0.1353759765625, ...

embed

58424422_c2

58424422

lisp

2

:NAMED-LAMBDA ; ==> ; #'(SB-INT:NAMED-LAMBDA FIXNUMTEST ; (I J) ; (DECLARE (SB-C::TOP-LEVEL-FORM)) ; (DECLARE (TYPE FIXNUM I J)) ; (BLOCK FIXNUMTEST ; (LET* ((N #) (N+1 #)) ; (DECLARE (TYPE FIXNUM N N+1)) ; (/ 1.0d0 (THE FIXNUM #))))) ; ; note: doing float to pointer coercion (cost 13) to "<return value>" Code signals:...

[ 0.01165771484375, 0.015625, -0.0022735595703125, 0.006927490234375, 0.0169677734375, -0.00909423828125, 0.00186920166015625, -0.01397705078125, 0.009765625, 0.007110595703125, -0.002471923828125, -0.043701171875, 0.00101470947265625, -0.013671875, 0.02392578125, -0.0030975341796875, ...

[ 152, 182512, 397, 94202, 571, 6538, 2819, 69112, 468, 25, 36474, 59537, 563, 21487, 109020, 618, 21828, 568, 821, 8399, 37486, 9, 441, 70675, 15300, 51442, 98533, 27143, 21907, 87, 124448, 27089, 839, 21748, 541, 53855, 71, 2389, 120363, ...

[ 0.015960693359375, 0.1851806640625, 0.1220703125, 0.1318359375, 0.1029052734375, 0.174560546875, 0.0270233154296875, 0.09423828125, 0.04925537109375, 0.0143280029296875, 0.1224365234375, 0.1417236328125, 0.130126953125, 0.173583984375, 0.1824951171875, 0.1290283203125, 0.226684570312...

embed

1597355_c0

1597355

lisp

0

Title: Why are parenscript functions changed to all lowercase? Problem title: Why are parenscript functions changed to all lowercase? Tags: lisp, case Problem: Why are parenscript functions changed to all lowercase? When using parenscript if I execute (parenscript:ps (slot-value ($ "#mytextarea") 'selectionStart)) It p...

Why are parenscript functions changed to all lowercase? Why are parenscript functions changed to all lowercase? lisp case Why parenscript:ps Start Why are parenscript functions changed to all lowercase? When using parenscript if I execute It produces the javascript Note that selectionStart is now selectionstart . It lo...

[ -0.01129150390625, 0.00482177734375, 0.0023193359375, 0.001861572265625, -0.01458740234375, -0.01300048828125, 0.0244140625, -0.006866455078125, 0.002288818359375, 0.006561279296875, 0.018310546875, 0.02685546875, -0.015625, 0.0196533203125, 0.00927734375, -0.011962890625, 0.00259399...

[ 44084, 621, 366, 33, 32032, 32354, 98816, 47, 756, 92319, 58437, 400, 7008, 7225, 6423, 13794, 17368, 71924, 27489, 136951, 18622, 132216, 126597, 5036, 17137, 72856, 1407, 56, 159, 98, 13695, 10932 ]

[ 0.0975341796875, 0.01038360595703125, 0.11456298828125, 0.1258544921875, 0.263916015625, 0.2012939453125, 0.1439208984375, 0.0316162109375, 0.046600341796875, 0.1732177734375, 0.2021484375, 0.0506591796875, 0.129150390625, 0.155517578125, 0.121337890625, 0.1783447265625, 0.0528869628...

embed

42293624_c0

42293624

lisp

0

Title: How can I add a value stored in a variable to a list? Problem title: How can I add a value stored in a variable to a list? Tags: lisp Problem: How can I add a value stored in a variable to a list? For example: (setf s 2) s => 2 (setf list1 '(1 s 3 4)) list1 => (1 s 3 4) How do i get it to add the value stored in...

How can I add a value stored in a variable to a list? How can I add a value stored in a variable to a list? lisp How list1 How can I add a value stored in a variable to a list? For example: How do i get it to add the value stored in s to the list? For this example I would want to use s to generate a list (1 2 3 4) I ha...

[ 0.0098876953125, 0.02001953125, -0.01025390625, -0.006256103515625, -0.0009765625, 0.005126953125, -0.013916015625, 0.020263671875, 0.005340576171875, -0.037841796875, 0.0228271484375, 0.005340576171875, -0.01123046875, 0.00122833251953125, 0.0108642578125, 0.00762939453125, -0.00897...

[ 11249, 831, 87, 15190, 10, 34292, 4343, 71, 23, 77336, 47, 5303, 400, 7008, 418, 54, 2046, 91, 27781, 3444, 4527, 139392, 2858, 116, 138, 13956, 12877, 16454, 3642, 903, 26458 ]

[ 0.1197509765625, 0.1085205078125, 0.06597900390625, 0.1968994140625, 0.064697265625, 0.23681640625, 0.20068359375, 0.1038818359375, 0.112548828125, 0.26904296875, 0.128662109375, 0.2440185546875, 0.094482421875, 0.1732177734375, 0.0273590087890625, 0.03961181640625, 0.027938842773437...

embed

4657798_c0

4657798

lisp

0

Title: Copy/Yank entire Lisp form in Slime Problem title: Copy/Yank entire Lisp form in Slime Tags: emacs, lisp, slime Problem: Copy/Yank entire Lisp form in Slime Is there a way to copy/yank a whole a form in Slime/Emacs? For instance, if I have the following function: (myfunc (lst) (myotherfunc lst)) I'd like to yank...

Copy/Yank entire Lisp form in Slime Copy/Yank entire Lisp form in Slime emacs lisp slime Copy Yank Lisp Slime Copy/Yank entire Lisp form in Slime Is there a way to copy/yank a whole a form in Slime/Emacs? For instance, if I have the following function: I'd like to yank/copy: by issuing a keyboard shortcut when my curso...

[ -0.00084686279296875, 0.01434326171875, -0.0308837890625, 0.01055908203125, -0.031494140625, 0.0106201171875, 0.01165771484375, 0.020263671875, 0.0012664794921875, -0.0177001953125, 0.0233154296875, -0.010498046875, -0.038330078125, -0.006622314453125, 0.00384521484375, -0.002014160156...

[ 146930, 64, 72306, 92, 64194, 1261, 7008, 3173, 23, 82344, 13, 352, 2263, 400, 34264, 25970, 2685, 10, 3917, 47, 43658, 1643, 28271, 647, 35572, 25632, 32354, 1884, 151, 7570, 137366, 390, 1159, 149186, 16610, 19774, 3229, 13810, 42, 7343...

[ 0.229736328125, 0.06085205078125, 0.203857421875, 0.23876953125, 0.1817626953125, 0.1695556640625, 0.2332763671875, 0.26171875, 0.0947265625, 0.20263671875, 0.21484375, 0.04022216796875, 0.1138916015625, 0.09942626953125, 0.16943359375, 0.200439453125, 0.031585693359375, 0.05499267...

embed

8015766_c0

8015766

lisp

0

Title: Reading in a seqence from a text file in Common Lisp Problem title: Reading in a seqence from a text file in Common Lisp Tags: lisp, file Problem: Reading in a seqence from a text file in Common Lisp I want to read in a textfile and make it a sequence and pass it on. How do I do that? This is what I have so far:...

Reading in a seqence from a text file in Common Lisp Reading in a seqence from a text file in Common Lisp lisp file a Reading Common Lisp filename.txt Hello Reading in a seqence from a text file in Common Lisp I want to read in a textfile and make it a sequence and pass it on. How do I do that? This is what I have so f...

[ 0.02392578125, -0.00170135498046875, -0.003570556640625, 0.0302734375, 0.009765625, -0.01202392578125, 0.02001953125, 0.015869140625, -0.00836181640625, -0.0341796875, -0.01904296875, 0.0191650390625, -0.0302734375, -0.00174713134765625, 0.015869140625, -0.0078125, -0.0115966796875, ...

[ 104951, 23, 40, 864, 6620, 1295, 7986, 11435, 151301, 1261, 7008, 400, 10, 11627, 124326, 35378, 3444, 12301, 29822, 3249, 442, 944, 27875, 98, 11249, 54, 450, 765, 2060, 83, 1884, 903 ]

[ 0.2109375, 0.11328125, 0.0703125, 0.1151123046875, 0.13427734375, 0.09130859375, 0.1121826171875, 0.1617431640625, 0.149169921875, 0.1634521484375, 0.1629638671875, 0.12353515625, 0.00408935546875, 0.0977783203125, 0.2174072265625, 0.0635986328125, 0.06915283203125, 0.2110595703125...

embed

108169_c0

108169

lisp

0

Title: How do I take a slice of a list (A sublist) in scheme? Problem title: How do I take a slice of a list (A sublist) in scheme? Tags: scheme, lisp Problem: How do I take a slice of a list (A sublist) in scheme? Given a list, how would I select a new list, containing a slice of the original list (Given offset and nu...

How do I take a slice of a list (A sublist) in scheme? How do I take a slice of a list (A sublist) in scheme? scheme lisp How How do I take a slice of a list (A sublist) in scheme? Given a list, how would I select a new list, containing a slice of the original list (Given offset and number of elements) ? EDIT: Good sug...

[ -0.01312255859375, 0.01214599609375, 0.011962890625, 0.004638671875, -0.0242919921875, -0.01324462890625, -0.024169921875, 0.0074462890625, 0.01104736328125, -0.004791259765625, 0.0019989013671875, -0.020751953125, -0.02490234375, -0.0031585693359375, -0.015869140625, -0.021240234375, ...

[ 11249, 54, 87, 5646, 91, 13348, 111, 5303, 1614, 6562, 23, 150370, 284, 400, 7008, 10, 77878, 3642, 36849, 3525, 70541, 214, 7311, 5773, 3509, 14012, 80854, 157666, 58735, 22724, 20531, 144285, 29479, 38937, 1760 ]

[ 0.09771728515625, 0.043609619140625, 0.054443359375, 0.1866455078125, 0.1060791015625, 0.23583984375, 0.0958251953125, 0.2178955078125, 0.1981201171875, 0.25, 0.0701904296875, 0.25732421875, 0.04827880859375, 0.060394287109375, 0.1566162109375, 0.031768798828125, 0.0225067138671875, ...

embed

19756296_c0

19756296

lisp

0

Title: What's the difference between write, print, pprint, princ, and prin1? Problem title: What's the difference between write, print, pprint, princ, and prin1? Tags: printing, output, lisp, common-lisp Problem: What's the difference between write, print, pprint, princ, and prin1? I'm getting into some Lisp,...

What's the difference between write, print, pprint, princ, and prin1? What's the difference between write, print, pprint, princ, and prin1? printing output lisp common-lisp What prin1 What's the difference between write, print, pprint, princ, and prin1? I'm getting into some Lisp, and I've come across various...

[ -0.01904296875, -0.00022029876708984375, -0.01300048828125, 0.0281982421875, 0.00421142578125, 0.019775390625, 0.005645751953125, -0.0026092529296875, 0.00390625, 0.0198974609375, -0.000576019287109375, -0.0125732421875, 0.014892578125, 0.00031280517578125, -0.003082275390625, 0.003540...

[ 4865, 3768, 70, 60212, 17721, 33022, 28412, 915, 35662, 2448, 238, 136, 418, 1916, 140992, 400, 7008, 39210, 4086, 254, 1261, 12921, 32354, 108975, 20594, 5701, 13580, 47, 130250 ]

[ 0.024658203125, 0.04541015625, 0.062255859375, 0.205078125, 0.100830078125, 0.190185546875, 0.221923828125, 0.0760498046875, 0.2279052734375, 0.1954345703125, 0.113525390625, 0.01898193359375, 0.079833984375, 0.04840087890625, 0.140869140625, 0.06817626953125, 0.181396484375, 0.078...

embed

56862882_c0

56862882

lisp

0

Title: Built in Binary Conversion in Scheme/Lisp Problem title: Built in Binary Conversion in Scheme/Lisp Tags: lisp, scheme Problem: Built in Binary Conversion in Scheme/Lisp Is there a built in binary to decimal conversion function in Scheme? I've found the built in number->string conversion which can convert binary ...

Built in Binary Conversion in Scheme/Lisp Built in Binary Conversion in Scheme/Lisp lisp scheme Built Binary Conversion Scheme Lisp Built in Binary Conversion in Scheme/Lisp Is there a built in binary to decimal conversion function in Scheme? I've found the built in number->string conversion which can convert binary to...

[ -0.0072021484375, 0.021728515625, 0.0011138916015625, 0.0274658203125, -0.009033203125, 0.0220947265625, -0.03271484375, -0.01055908203125, 0.000335693359375, 0.0013580322265625, -0.005096435546875, -0.029541015625, -0.017578125, 0.00872802734375, 0.01519775390625, -0.0145263671875, ...

[ 667, 24908, 23, 54092, 1294, 1657, 46354, 34702, 282, 9506, 7008, 400, 150370, 1261, 2071, 2685, 10, 88303, 2394, 6635, 47, 32380, 2749, 142477, 32354, 14037, 14012, 103607, 91693, 831, 96760, 3173, 198274, 79315, 2606, 1297, 22027, 18, 675...

[ 0.0721435546875, 0.1300048828125, 0.1473388671875, 0.1890869140625, 0.139892578125, 0.06072998046875, 0.1409912109375, 0.153564453125, 0.1593017578125, 0.0601806640625, 0.1507568359375, 0.03216552734375, 0.129150390625, 0.0621337890625, 0.00897216796875, 0.03594970703125, 0.019348144...

embed

11821423_c0

11821423

lisp

0

Title: Why isn't let* the default let? Problem title: Why isn't let* the default let? Tags: lisp, emacs, elisp Problem: Why isn't let* the default let? As probably all experienced elispers have found at some point, code like is broken: (let ((a 3) (b 4) (c (+ a b))) c) One should use the let* form instead whe...

Why isn't let* the default let? Why isn't let* the default let? lisp emacs elisp Why Why isn't let* the default let? As probably all experienced elispers have found at some point, code like is broken: One should use the let* form instead when referring to a just-binded variable within the binding clauses. I j...

[ -0.002838134765625, 0.005462646484375, 0.00933837890625, 0.0018768310546875, -0.00506591796875, 0.00164794921875, -0.01177978515625, -0.0179443359375, 0.00323486328125, -0.013671875, -0.0029144287109375, -0.0059814453125, -0.00110626220703125, 0.031005859375, -0.004669189453125, -0.015...

[ 44084, 56112, 3768, 18, 2633, 1639, 70, 114977, 400, 7008, 2263, 15296, 164, 21777, 18151, 1884, 148431, 4527, 3173, 64457, 15005, 1660, 89817, 77336, 28032, 128239, 70731, 15400, 44691, 123166, 10512, 218873, 11343 ]

[ 0.1048583984375, 0.1077880859375, 0.040740966796875, 0.133544921875, 0.210205078125, 0.204345703125, 0.05413818359375, 0.25732421875, 0.0408935546875, 0.12158203125, 0.050506591796875, 0.0325927734375, 0.02374267578125, 0.06622314453125, 0.1302490234375, 0.04986572265625, 0.132568359...

embed

3887899_c0

3887899

lisp

0

Title: How to interpret full programs in Ready Lisp? Problem title: How to interpret full programs in Ready Lisp? Tags: installation, lisp, ready Problem: How to interpret full programs in Ready Lisp? I've just downloaded Ready Lisp and am playing around with the REPL. What I want to know is, how do I write a long prog...

How to interpret full programs in Ready Lisp? How to interpret full programs in Ready Lisp? installation lisp ready How Ready Lisp How to interpret full programs in Ready Lisp? I've just downloaded Ready Lisp and am playing around with the REPL. What I want to know is, how do I write a long program, interpret it and ge...

[ -0.0064697265625, 0.0062255859375, 0.00145721435546875, 0.0284423828125, -0.0263671875, 0.018798828125, 0.0240478515625, -0.006072998046875, -0.00457763671875, -0.0289306640625, -0.0010223388671875, -0.00848388671875, -0.03759765625, -0.010498046875, 0.01544189453125, -0.01397705078125...

[ 11249, 47, 29481, 4393, 103391, 23, 4764, 53, 1261, 7008, 59720, 400, 43542, 7026, 75169, 10932, 9069, 21130, 3714, 3642, 33022, 4989, 1528, 442, 2046, 140992, 27026, 34702, 282, 1884, 12877, 16454 ]

[ 0.090576171875, 0.066162109375, 0.262939453125, 0.1790771484375, 0.2310791015625, 0.0799560546875, 0.15966796875, 0.1480712890625, 0.1695556640625, 0.210205078125, 0.1253662109375, 0.112060546875, 0.1807861328125, 0.07373046875, 0.032470703125, 0.000762939453125, 0.07196044921875, ...

embed

12990296_c2

12990296

lisp

2

-in? x (car y)) (cond ((eq? (length y) 1) #f) (#t (is-in? x (cdr y))) ))) (#t #f) ) ) ) ) ) Update : What I want is to have a general function, which can tell you if some object is inside another object . I name entities object to emphasize that the function should work with any input values, simple or complicated like...

[ -0.011474609375, 0.0289306640625, 0.00186920166015625, 0.00021839141845703125, -0.00994873046875, 0.0206298828125, -0.0036468505859375, -0.005462646484375, 0.007598876953125, -0.036865234375, 0.00823974609375, -0.01361083984375, -0.00836181640625, -0.01409912109375, 0.005401611328125, ...

[ 20, 73, 32, 1022, 3284, 113, 2271, 71, 864, 23986, 927, 4879, 420, 18, 164, 7569, 32149, 4865, 3444, 47, 765, 4537, 32354, 831, 14192, 398, 2174, 3060, 36746, 83, 46132, 15700, 9351, 77630, 2449, 14612, 62539, 5608, 4488, 2499, 107730, ...

[ 0.055419921875, 0.29296875, 0.06689453125, 0.111572265625, 0.227783203125, 0.11083984375, 0.053497314453125, 0.0411376953125, 0.1146240234375, 0.0255279541015625, 0.003326416015625, 0.041107177734375, 0.078369140625, 0.031402587890625, 0.207763671875, 0.1422119140625, 0.0038757324218...

embed

24310928_c0

24310928

lisp

0

Title: LISP - what does CONS need to work? Problem title: LISP - what does CONS need to work? Tags: common-lisp, cons, environment, function, lisp Problem: LISP - what does CONS need to work? I had this question in an exam, how would you solve it? CONS is a fundamental Common Lisp function. Which functionality must the...

LISP - what does CONS need to work? LISP - what does CONS need to work? common-lisp cons environment function lisp LISP CONS LISP - what does CONS need to work? I had this question in an exam, how would you solve it? CONS is a fundamental Common Lisp function. Which functionality must the Common Lisp environment provid...

[ -0.000431060791015625, 0.0252685546875, 0.0015411376953125, 0.01409912109375, 0.000789642333984375, 0.0172119140625, -0.00933837890625, 0.0115966796875, 0.02294921875, -0.016845703125, 0.013427734375, -0.01483154296875, -0.01190185546875, 0.017822265625, -0.002227783203125, 0.011474609...

[ 16970, 9434, 20, 2367, 14602, 109022, 3871, 47, 4488, 39210, 4086, 254, 158, 7, 65998, 32354, 400, 7008, 9655, 42276, 3642, 86869, 83, 10, 20531, 151301, 1261, 130078, 123309, 2481, 8110, 22691, 3249, 442, 2806, 53383, 903, 18151, 15490, ...

[ 0.1727294921875, 0.25439453125, 0.029266357421875, 0.1566162109375, 0.1024169921875, 0.297607421875, 0.19580078125, 0.0833740234375, 0.1788330078125, 0.119140625, 0.1488037109375, 0.186279296875, 0.205322265625, 0.09954833984375, 0.18115234375, 0.19091796875, 0.143798828125, 0.2325...

embed

1838679_c0

1838679

lisp

0

Title: returning a lambda function in clisp, then evaluating it Problem title: returning a lambda function in clisp, then evaluating it Tags: common-lisp, lambda, lisp Problem: returning a lambda function in clisp, then evaluating it Suppose I have this wonderful function foo [92]> (defun foo () (lambda() 42)) FOO [93]...

returning a lambda function in clisp, then evaluating it returning a lambda function in clisp, then evaluating it common-lisp lambda lisp FOO LAMBDA NIL returning a lambda function in clisp, then evaluating it Suppose I have this wonderful function foo Now, suppose I want to actually use foo and return 42. How do I do ...

[ 0.0240478515625, 0.007232666015625, -0.00022029876708984375, -0.004302978515625, 0.00921630859375, 0.0036773681640625, 0.020263671875, 0.01806640625, -0.00107574462890625, -0.03271484375, -0.004150390625, -0.00653076171875, -0.00811767578125, -0.003387451171875, 0.004913330078125, -0.0...

[ 30646, 214, 21, 6492, 85, 32354, 23, 95701, 7008, 7068, 151575, 39210, 4086, 254, 400, 563, 30563, 3358, 12689, 6538, 541, 16444, 121691, 8364, 765, 903, 58867, 5775, 31, 139124, 3444, 20653, 4527, 136, 4828, 11249, 54, 26484, 26785, 6002...

[ 0.22265625, 0.039031982421875, 0.05450439453125, 0.1812744140625, 0.137451171875, 0.1949462890625, 0.0294342041015625, 0.1234130859375, 0.225341796875, 0.051666259765625, 0.161865234375, 0.08465576171875, 0.0675048828125, 0.1588134765625, 0.0721435546875, 0.0977783203125, 0.210815429...

embed

8163336_c0

8163336

lisp

0

Title: Why lists created with cons() and list() are shown differently? Problem title: Why lists created with cons() and list() are shown differently? Tags: lisp, list Problem: Why lists created with cons() and list() are shown differently? Why lists created with cons() and list() are shown differently despite the lists...

Why lists created with cons() and list() are shown differently? Why lists created with cons() and list() are shown differently? lisp list Why Why lists created with cons() and list() are shown differently? Why lists created with cons() and list() are shown differently despite the lists are equal? The first one shows it...

[ 0.004119873046875, 0.01141357421875, 0.0037994384765625, 0.007080078125, -0.0166015625, 0.005706787109375, -0.0093994140625, 0.0059814453125, 0.00054168701171875, 0.0157470703125, -0.00506591796875, -0.015869140625, 0.007110595703125, 0.0142822265625, -0.0223388671875, -0.018310546875,...

[ 44084, 5303, 7, 75935, 678, 158, 136, 132, 127887, 12921, 538, 400, 7008, 61518, 105950, 45831, 55769, 84797, 20633, 17932, 148, 64, 31, 64549, 80836, 5701, 1284 ]

[ 0.1151123046875, 0.23193359375, 0.1578369140625, 0.1138916015625, 0.07525634765625, 0.2164306640625, 0.10986328125, 0.05517578125, 0.151123046875, 0.1507568359375, 0.051483154296875, 0.0784912109375, 0.146484375, 0.044219970703125, 0.11328125, 0.0628662109375, 0.0863037109375, 0.10...

embed

54479461_c0

54479461

lisp

0

Title: Text replacement capability in clojure macros like C's #define Problem title: Text replacement capability in clojure macros like C's #define Tags: clojure, lisp, macros Problem: Text replacement capability in clojure macros like C's #define I want to write a macro (defmacro params [] 'a 'b 'c) that wil...

Text replacement capability in clojure macros like C's #define Text replacement capability in clojure macros like C's #define clojure lisp macros Text Text replacement capability in clojure macros like C's #define I want to write a macro that will be used in places like this If you see this could be easily do...

[ -0.0008392333984375, 0.01324462890625, -0.006378173828125, 0.0235595703125, -0.00946044921875, 0.01708984375, 0.0145263671875, -0.00457763671875, -0.000659942626953125, -0.0052490234375, -0.0128173828125, -0.0206298828125, -0.01043701171875, -0.0224609375, 0.0185546875, -0.017822265625...

[ 24129, 91995, 674, 3540, 41159, 20450, 461, 107, 111789, 313, 3768, 112, 64552, 400, 7008, 3444, 33022, 11814, 44677, 1884, 903, 1957, 5809, 72546, 16940, 7986, 30646, 238 ]

[ 0.207763671875, 0.21435546875, 0.0379638671875, 0.1396484375, 0.110595703125, 0.1300048828125, 0.154052734375, 0.0640869140625, 0.1888427734375, 0.14404296875, 0.043701171875, 0.0694580078125, 0.167724609375, 0.0677490234375, 0.1336669921875, 0.051666259765625, 0.060760498046875, 0...

embed

56351277_c1

56351277

lisp

1

DATA = NIL CLOSED = NIL DRAIN-READ-BUFFER = T ADDRESS = #<unbound slot> BUFFER = #S(FAST-IO:OUTPUT-BUFFER.. BUFFERINGP = NIL CONNECTED = T DIRECTION = :IN And the ADDRESS slot is surprisingly unbound... Has anybody encountered this problem? Code signals: How, Lisp, ADDRESS, Starting, as:tcp-server, as:write-socket-dat...

[ 0.01336669921875, 0.033447265625, 0.0012664794921875, -0.015625, -0.00653076171875, 0.00958251953125, 0.017822265625, -0.0052490234375, -0.003936767578125, 0.0125732421875, -0.0023040771484375, -0.007171630859375, 0.01251220703125, 0.017822265625, 0.0123291015625, -0.00048828125, 0.0...

[ 391, 17758, 2203, 541, 16444, 92933, 17610, 28235, 48026, 41519, 15639, 919, 66804, 384, 19831, 23498, 64397, 309, 99091, 24897, 38209, 48963, 17780, 52001, 124599, 22013, 30110, 127674, 683, 14452, 91394, 66458, 233704, 40713, 8852, 83, 212615...

[ 0.058013916015625, 0.151611328125, 0.036102294921875, 0.14111328125, 0.16064453125, 0.15673828125, 0.06512451171875, 0.07635498046875, 0.0845947265625, 0.16162109375, 0.0279998779296875, 0.035186767578125, 0.2030029296875, 0.07366943359375, 0.050872802734375, 0.1466064453125, 0.17822...

embed

8475124_c0

8475124

lisp

0

Title: Negative infinity in Lisp Problem title: Negative infinity in Lisp Tags: fixnum, lisp Problem: Negative infinity in Lisp I'm looking for the standard way to represent negative infinity in Lisp. Is there a symblic value which is recognised by Lisp's arithmetic functions as less than all other numbers? Specificall...

Negative infinity in Lisp Negative infinity in Lisp fixnum lisp Negative Lisp Evaluates Negative infinity in Lisp I'm looking for the standard way to represent negative infinity in Lisp. Is there a symblic value which is recognised by Lisp's arithmetic functions as less than all other numbers? Specifically, I'm looking...

[ 0.005859375, -0.0087890625, 0.007293701171875, 0.00421142578125, -0.00689697265625, 0.0196533203125, 0.01318359375, -0.006256103515625, -0.000476837158203125, -0.0208740234375, -0.00689697265625, -0.0191650390625, 0.0029144287109375, 0.00165557861328125, 0.0196533203125, 0.013854980468...

[ 221717, 13, 54241, 53, 23, 1261, 7008, 30022, 2606, 400, 151228, 5570, 3917, 33636, 40907, 954, 6492, 9120, 34292, 75530, 8962, 32354, 40715, 101935, 27650, 33022, 25632 ]

[ 0.25244140625, 0.03826904296875, 0.1590576171875, 0.0777587890625, 0.05963134765625, 0.1612548828125, 0.2166748046875, 0.1175537109375, 0.11376953125, 0.1099853515625, 0.1058349609375, 0.1092529296875, 0.0148162841796875, 0.1295166015625, 0.235595703125, 0.046051025390625, 0.12280273...

embed

11218905_c0

11218905

lisp

0

Title: Is it possible to implement auto-currying to the Lisp-family languages? Problem title: Is it possible to implement auto-currying to the Lisp-family languages? Tags: lisp, clojure, common-lisp, scheme, currying Problem: Is it possible to implement auto-currying to the Lisp-family languages? That is, when you call...

Is it possible to implement auto-currying to the Lisp-family languages? Is it possible to implement auto-currying to the Lisp-family languages? lisp clojure common-lisp scheme currying Lisp-family Is it possible to implement auto-currying to the Lisp-family languages? That is, when you call a function with >1 arity wit...

[ 0.0130615234375, 0.01226806640625, 0.01129150390625, 0.000270843505859375, -0.0255126953125, 0.0242919921875, 0.0001850128173828125, -0.0047607421875, 0.0074462890625, -0.0206298828125, -0.004302978515625, -0.030517578125, -0.01348876953125, 0.004058837890625, -0.00885009765625, -0.028...

[ 7722, 29479, 1809, 64240, 38543, 47, 1261, 7008, 212122, 46876, 400, 20450, 461, 39210, 4086, 254, 150370, 198555, 214, 11782, 32354, 977, 418, 187, 2481, 678, 4734, 1632, 10750, 5608, 64457, 44116, 18499, 30646, 16750, 227204, 111789 ]

[ 0.166259765625, 0.15673828125, 0.2352294921875, 0.2156982421875, 0.188232421875, 0.0843505859375, 0.16064453125, 0.2083740234375, 0.1195068359375, 0.157470703125, 0.10565185546875, 0.056640625, 0.07080078125, 0.03814697265625, 0.1268310546875, 0.146728515625, 0.114501953125, 0.2653...

embed

16284820_c0

16284820

lisp

0

Title: how to programmatically create a regexp to match all the single char in a given string with elisp? Problem title: how to programmatically create a regexp to match all the single char in a given string with elisp? Tags: regex, lisp, emacs Problem: how to programmatically create a regexp to match all the single ch...

how to programmatically create a regexp to match all the single char in a given string with elisp? how to programmatically create a regexp to match all the single char in a given string with elisp? regex lisp emacs how to programmatically create a regexp to match all the single char in a given string with elisp? For ex...

[ -0.00799560546875, -0.0130615234375, -0.0203857421875, 0.0157470703125, -0.01220703125, 0.0225830078125, -0.006256103515625, 0.00701904296875, 0.0089111328125, -0.031494140625, -0.005523681640625, 0.006805419921875, -0.0126953125, 0.0034942626953125, -0.019287109375, -0.0101318359375, ...

[ 3642, 11720, 18, 71407, 28282, 6835, 83613, 14858, 756, 11001, 21441, 79315, 15296, 7008, 10, 47, 34475, 3355, 400, 352, 2263, 678, 1563, 71574, 4240, 177, 661, 831, 2055, 12638, 62816, 23, 2967, 5809, 5361, 124850, 5 ]

[ 0.05218505859375, 0.1622314453125, 0.0938720703125, 0.0653076171875, 0.16259765625, 0.1710205078125, 0.270751953125, 0.206787109375, 0.06585693359375, 0.1451416015625, 0.1732177734375, 0.207275390625, 0.107666015625, 0.2159423828125, 0.05755615234375, 0.012054443359375, 0.04077148437...

embed

42495198_c0

42495198

lisp

0

Title: How to push-back a vector in elisp Problem title: How to push-back a vector in elisp Tags: elisp, lisp Problem: How to push-back a vector in elisp I found some instructions to pushback with a vector using a function called vector-push , the problem is that I think it only works with common lisp. What if I want t...

How to push-back a vector in elisp How to push-back a vector in elisp elisp lisp How vector.push_back How to push-back a vector in elisp I found some instructions to pushback with a vector using a function called vector-push , the problem is that I think it only works with common lisp. What if I want to push to the bac...

[ 0.00799560546875, 0.040283203125, -0.0172119140625, 0.02001953125, -0.0028076171875, 0.020751953125, -0.007537841796875, -0.003326416015625, -0.000316619873046875, -0.037841796875, 0.007598876953125, 0.01104736328125, 0.00014400482177734375, 0.0030059814453125, -0.017333984375, -0.0131...

[ 11249, 47, 25944, 9, 12620, 173, 18770, 23, 15296, 7008, 10, 400, 7332, 127, 167934, 678, 32354, 2967, 4734, 43240, 39210, 3444, 4420, 16031, 313, 37223, 5154, 62766, 209806 ]

[ 0.0838623046875, 0.1473388671875, 0.2037353515625, 0.05242919921875, 0.272216796875, 0.19970703125, 0.240966796875, 0.0694580078125, 0.100341796875, 0.224365234375, 0.005157470703125, 0.0787353515625, 0.1611328125, 0.1513671875, 0.08612060546875, 0.099365234375, 0.1541748046875, 0....

embed

622785_c0

622785

lisp

0

Title: let vs def in clojure Problem title: let vs def in clojure Tags: lisp, let, function, clojure Problem: let vs def in clojure I want to make a local instance of a Java Scanner class in a clojure program. Why does this not work: ; gives me: count not supported on this type: Symbol (let s (new Scanner "a b c")) but...

let vs def in clojure let vs def in clojure lisp let function clojure Scanner Symbol let vs def in clojure I want to make a local instance of a Java Scanner class in a clojure program. Why does this not work: but it will let me create a global instance like this: I was under the impression that the only difference was ...

[ 0.0000743865966796875, 0.00299072265625, 0.000782012939453125, 0.028076171875, 0.0111083984375, 0.0118408203125, -0.01239013671875, 0.0162353515625, -0.006256103515625, -0.0096435546875, -0.01251220703125, -0.007354736328125, 0.0089111328125, 0.00836181640625, 0.01275634765625, -0.0092...

[ 2633, 20209, 8, 420, 20450, 461, 107, 23, 400, 7008, 32354, 65533, 1679, 131899, 3444, 3249, 4000, 110527, 41925, 18507, 1528, 44084, 14602, 959, 4488, 28282, 7964, 49128, 60212, 70820, 198371, 70, 17721, 136 ]

[ 0.23876953125, 0.16943359375, 0.1456298828125, 0.2034912109375, 0.13037109375, 0.140625, 0.09521484375, 0.0220184326171875, 0.050506591796875, 0.1475830078125, 0.11285400390625, 0.12359619140625, 0.130126953125, 0.163818359375, 0.02288818359375, 0.0199127197265625, 0.072509765625, ...

embed

19678906_c0

19678906

lisp

0

Title: How to modify this "make-matrix" function? Problem title: How to modify this "make-matrix" function? Tags: common-lisp, clisp, lisp Problem: How to modify this "make-matrix" function? Well, the flawed function is as follows: (defun make-matrix (n) (make-array (n n) :initial-element 0)) I want...

How to modify this "make-matrix" function? How to modify this "make-matrix" function? common-lisp clisp lisp How How to modify this "make-matrix" function? Well, the flawed function is as follows: I want to use functions like (make-matrix 8) to replace the longer (make-array '(8 8) :initial-element ...

[ -0.00872802734375, 0.0228271484375, 0.02392578125, -0.012451171875, 0.0185546875, -0.000125885009765625, -0.0098876953125, 0.02001953125, 0.00726318359375, -0.0228271484375, -0.01397705078125, -0.0179443359375, 0.004974365234375, -0.0233154296875, -0.0191650390625, -0.0137939453125, ...

[ 11249, 47, 2811, 40383, 903, 55898, 192, 87427, 41502, 32354, 39210, 4086, 254, 95701, 7008, 400, 9, 13034, 24243, 28960, 3444, 4527, 1884, 65034, 91995, 51713, 19305, 53, 1019, 943, 118, 62766, 757, 313, 67616, 683, 17378, 2685, 83, 10, ...

[ 0.09332275390625, 0.0297393798828125, 0.15185546875, 0.1536865234375, 0.0712890625, 0.1785888671875, 0.1461181640625, 0.2484130859375, 0.00213623046875, 0.20263671875, 0.14111328125, 0.08935546875, 0.1484375, 0.093017578125, 0.1632080078125, 0.0936279296875, 0.00360107421875, 0.132...

embed

36558678_c0

36558678

lisp

0

Title: Function in lisp that displays a list in a specific way Problem title: Function in lisp that displays a list in a specific way Tags: lisp, list Problem: Function in lisp that displays a list in a specific way I need to make a function in lisp that displays a list like this: (a b (c d) (e f g) h) -> (a b (c d) (e...

Function in lisp that displays a list in a specific way Function in lisp that displays a list in a specific way lisp list print1-lista Function in lisp that displays a list in a specific way I need to make a function in lisp that displays a list like this: So far i managed to make a function that displays a list like t...

[ 0.0024566650390625, 0.007415771484375, 0.00390625, 0.01422119140625, -0.00104522705078125, 0.01263427734375, -0.0068359375, -0.0037994384765625, -0.00579833984375, -0.026123046875, -0.0023040771484375, -0.02197265625, -0.0164794921875, -0.004547119140625, -0.0123291015625, 0.0101318359...

[ 28670, 10763, 23, 400, 7008, 450, 44116, 7, 5303, 29458, 3917, 28412, 20268, 16651, 10, 3871, 3249, 32354, 1884, 903, 2060, 145755 ]

[ 0.14208984375, 0.0728759765625, 0.0665283203125, 0.1343994140625, 0.2127685546875, 0.04034423828125, 0.1717529296875, 0.038543701171875, 0.2298583984375, 0.1611328125, 0.10626220703125, 0.1771240234375, 0.0986328125, 0.2381591796875, 0.0033206939697265625, 0.050872802734375, 0.020843...

embed

27307660_c0

27307660

lisp

0

Title: how to implement natural sort in common lisp? Problem title: how to implement natural sort in common lisp? Tags: lisp, common-lisp Problem: how to implement natural sort in common lisp? I tried to implement a natural sort: Break 21 [92]> (defparameter *sss* '("1.txt" "10.txt" "13.txt" "12.txt" "2.txt" "23.txt"))...

how to implement natural sort in common lisp? how to implement natural sort in common lisp? lisp common-lisp Break SSS how to implement natural sort in common lisp? I tried to implement a natural sort: Unfortunately, the code above does not work. Could someone help me to get a natural sort function?

[ 0.005523681640625, 0.004913330078125, -0.0026092529296875, 0.01190185546875, -0.0093994140625, -0.000946044921875, 0.000904083251953125, -0.01226806640625, 0.003875732421875, 0.0048828125, -0.0022430419921875, 0.0419921875, -0.021240234375, -0.006500244140625, 0.01458740234375, -0.0172...

[ 3642, 47, 29479, 6083, 12096, 23, 39210, 400, 7008, 4086, 254, 131904, 15268, 37842, 18151, 959, 4488, 32354 ]

[ 0.0523681640625, 0.0192718505859375, 0.1705322265625, 0.1787109375, 0.229736328125, 0.045745849609375, 0.150634765625, 0.11529541015625, 0.168701171875, 0.06842041015625, 0.1005859375, 0.08843994140625, 0.105224609375, 0.007350921630859375, 0.03570556640625, 0.0057525634765625, 0.023...

embed

36825871_c0

36825871

lisp

0

Title: Lparallel.queue thread-safe? Problem title: Lparallel.queue thread-safe? Tags: lisp, multithreading, queue, common-lisp, thread-safety Problem: Lparallel.queue thread-safe? I may not be looking in the correct location for the documentation of lparallel.queue , but can we assume that those queues are thread-safe ...

Lparallel.queue thread-safe? Lparallel.queue thread-safe? lisp multithreading queue common-lisp thread-safety Lparallel.queue Lparallel.queue thread-safe? I may not be looking in the correct location for the documentation of lparallel.queue , but can we assume that those queues are thread-safe and that the queues take ...

[ 0.0087890625, 0.00244140625, -0.012939453125, -0.0169677734375, -0.0098876953125, -0.019287109375, 0.026611328125, -0.021484375, -0.01214599609375, -0.0162353515625, 0.0007476806640625, 0.022216796875, 0.01043701171875, 0.0038909912109375, -0.0107421875, 0.0185546875, 0.0104370117187...

[ 339, 6276, 1229, 141, 944, 13388, 86997, 115840, 400, 7008, 3869, 65847, 41, 39210, 4086, 254, 939, 31913, 209806, 96, 5, 41591, 21049, 621, 9, 517, 56776, 214, 309, 21135, 61261, 38937, 12937 ]

[ 0.106201171875, 0.0989990234375, 0.1466064453125, 0.1148681640625, 0.125732421875, 0.1746826171875, 0.1893310546875, 0.192138671875, 0.062255859375, 0.134765625, 0.0806884765625, 0.102783203125, 0.139404296875, 0.046356201171875, 0.05279541015625, 0.1075439453125, 0.007720947265625, ...

embed

38507934_c0

38507934

lisp

0

Title: Alternative way to build a list until predicate is satisfied? Problem title: Alternative way to build a list until predicate is satisfied? Tags: racket, lisp Problem: Alternative way to build a list until predicate is satisfied? Here is my way of building a fibonacci sequence as a list whose values do not exceed...

Alternative way to build a list until predicate is satisfied? Alternative way to build a list until predicate is satisfied? racket lisp Alternative Alternative way to build a list until predicate is satisfied? Here is my way of building a fibonacci sequence as a list whose values do not exceed x : Is there another, may...

[ -0.0108642578125, 0.01446533203125, 0.000888824462890625, -0.0289306640625, -0.01104736328125, 0.0142822265625, 0.0106201171875, 0.0167236328125, 0.0164794921875, -0.032958984375, 0.0213623046875, 0.00201416015625, 0.0140380859375, 0.00141143798828125, 0.032470703125, 0.00482177734375,...

[ 103905, 3917, 45367, 5303, 24189, 1653, 2063, 67, 214521, 10, 673, 27853, 400, 7008, 83, 33976, 809, 20990, 52544, 40, 944, 3956, 237, 142424, 54, 959, 204839, 1022, 15700, 46622, 20594, 70751, 3066, 21, 3285, 54241 ]

[ 0.14013671875, 0.061309814453125, 0.18994140625, 0.2325439453125, 0.1258544921875, 0.1328125, 0.1705322265625, 0.078857421875, 0.1881103515625, 0.041168212890625, 0.0615234375, 0.1866455078125, 0.071533203125, 0.1658935546875, 0.032470703125, 0.15234375, 0.089111328125, 0.123779296...

embed

40455385_c0

40455385

lisp

0

Title: Using unit-testing for a procedure in Racket Problem title: Using unit-testing for a procedure in Racket Tags: lisp, dr.racket, unit-testing, racket Problem: Using unit-testing for a procedure in Racket If I call in Racket/Dr. Racket the following code: > add1 I get: #<procedure:add1> If I am using a library for...

Using unit-testing for a procedure in Racket Using unit-testing for a procedure in Racket lisp dr.racket unit-testing racket rackunit Using Racket add1 procedure:add1 dr.racket Using unit-testing for a procedure in Racket If I call in Racket/Dr. Racket the following code: I get: If I am using a library for unit-test ca...

[ -0.0164794921875, 0.019287109375, -0.01165771484375, 0.016357421875, -0.003936767578125, -0.0145263671875, -0.000698089599609375, -0.013916015625, -0.0084228515625, -0.034912109375, 0.0013275146484375, -0.00104522705078125, -0.005126953125, -0.0159912109375, 0.016845703125, -0.01434326...

[ 345, 25072, 6954, 214, 50491, 2552, 27853, 100, 7008, 3568, 219, 673, 28779, 6262, 217, 15190, 4028, 11782, 28928, 18151, 17368, 35773, 9790, 3034, 35782, 6002, 86531, 18499, 44084, 53383 ]

[ 0.023956298828125, 0.193603515625, 0.2327880859375, 0.1011962890625, 0.1468505859375, 0.10235595703125, 0.208740234375, 0.003662109375, 0.08551025390625, 0.046051025390625, 0.0712890625, 0.07208251953125, 0.1015625, 0.05120849609375, 0.189453125, 0.0540771484375, 0.054931640625, 0....

embed

31449110_c0

31449110

lisp

0

Title: LISP arithmetics implementation Problem title: LISP arithmetics implementation Tags: lisp, c, arithmetic-expressions Problem: LISP arithmetics implementation I'm making a toy lisp interpreter with D and I don't know the theory of Lisp very well. I was wondering if Lisp can implement basic arithmetic functions (+...

LISP arithmetics implementation LISP arithmetics implementation lisp c arithmetic-expressions LISP LISP arithmetics implementation I'm making a toy lisp interpreter with D and I don't know the theory of Lisp very well. I was wondering if Lisp can implement basic arithmetic functions (+, -, ×, ÷) by itself. Most Lisp/Sc...

[ 0.00040435791015625, 0.01544189453125, -0.00836181640625, 0.0113525390625, -0.00909423828125, 0.0174560546875, -0.00146484375, 0.01116943359375, -0.01324462890625, -0.0234375, 0.001922607421875, 0.002899169921875, -0.013671875, -0.00101470947265625, 0.01397705078125, -0.006011962890625...

[ 16970, 9434, 187, 8962, 282, 41637, 208124, 400, 7008, 501, 204629, 20662, 72713, 29481, 56, 678, 391, 3714, 154453, 1261, 149016, 831, 29479, 62822, 9523, 32354, 22183, 20, 34070, 83059, 68034, 17006, 25452, 12549, 220734, 88303, 313, 41925,...

[ 0.1549072265625, 0.2474365234375, 0.045623779296875, 0.166259765625, 0.1285400390625, 0.04510498046875, 0.1845703125, 0.1341552734375, 0.238525390625, 0.09747314453125, 0.153076171875, 0.01055908203125, 0.126953125, 0.1395263671875, 0.07379150390625, 0.03021240234375, 0.0906982421875...

embed

23303524_c0

23303524

lisp

0

Title: Why does this drop me into LDB in SBCL? Problem title: Why does this drop me into LDB in SBCL? Tags: sbcl, common-lisp, slime, lisp Problem: Why does this drop me into LDB in SBCL? This code drops me into the LDB in SBCL from SLIME but not the termial: (declaim (optimize debug)) ;; inhibit tail-call optimization...

Why does this drop me into LDB in SBCL? Why does this drop me into LDB in SBCL? sbcl common-lisp slime lisp Why LDB SBCL Why does this drop me into LDB in SBCL? This code drops me into the LDB in SBCL from SLIME but not the termial: Why does this crash SBCL from SLIME but not the terminal?

[ 0.01275634765625, 0.0155029296875, -0.0030975341796875, -0.0034027099609375, -0.03271484375, -0.007049560546875, -0.000591278076171875, 0.01025390625, 0.0027923583984375, -0.02783203125, 0.00653076171875, 0.005523681640625, 0.00408935546875, -0.00445556640625, 0.02490234375, 0.01434326...

[ 44084, 14602, 903, 36069, 163, 3934, 339, 39463, 23, 90944, 37486, 91, 275, 34937, 39210, 4086, 254, 34264, 13, 400, 7008, 18151, 7, 70, 1295, 42135, 66820, 959, 13579, 15403, 150631, 33949 ]

[ 0.10687255859375, 0.06634521484375, 0.05853271484375, 0.1439208984375, 0.045440673828125, 0.102783203125, 0.1158447265625, 0.240966796875, 0.06378173828125, 0.1468505859375, 0.24609375, 0.03448486328125, 0.0611572265625, 0.16845703125, 0.09954833984375, 0.0772705078125, 0.09875488281...

embed

28767387_c0

28767387

lisp

0

Title: Create an array of single-float from double-float in lisp? Problem title: Create an array of single-float from double-float in lisp? Tags: lisp, sbcl, common-lisp Problem: Create an array of single-float from double-float in lisp? When I try to create a single-float array like this, i get: (make-array 2 :element...

Create an array of single-float from double-float in lisp? Create an array of single-float from double-float in lisp? lisp sbcl common-lisp double-float Create SINGLE-FLOAT Create an array of single-float from double-float in lisp? When I try to create a single-float array like this, i get: , i get the following error:...

[ 0.0179443359375, 0.0198974609375, -0.018310546875, -0.0133056640625, -0.006317138671875, 0.01055908203125, -0.01409912109375, -0.0012664794921875, 0.006866455078125, 0.009521484375, -0.0225830078125, -0.03271484375, 0.001129150390625, -0.023681640625, -0.0089111328125, -0.0064697265625...

[ 151313, 10298, 53, 11001, 52347, 257, 1295, 41929, 400, 7008, 111, 23, 34937, 39210, 4086, 254, 72187, 126833, 919, 17014, 14609, 9790, 28282, 1884, 903, 17, 2046, 25632, 18499, 2685, 3917, 8781, 173, 18770 ]

[ 0.1285400390625, 0.1959228515625, 0.1705322265625, 0.1697998046875, 0.2283935546875, 0.1339111328125, 0.068115234375, 0.144775390625, 0.11572265625, 0.2154541015625, 0.0180511474609375, 0.0294952392578125, 0.07464599609375, 0.06939697265625, 0.06591796875, 0.1458740234375, 0.125, 0...

embed

47006222_c0

47006222

lisp

0

Title: LISP function which, given a number and a list, returns the first even number greater than n Problem title: LISP function which, given a number and a list, returns the first even number greater than n Tags: lisp, common-lisp Problem: LISP function which, given a number and a list, returns the first even number g...

LISP function which, given a number and a list, returns the first even number greater than n LISP function which, given a number and a list, returns the first even number greater than n lisp common-lisp LISP LISP function which, given a number and a list, returns the first even number greater than n I'm having trouble ...

[ -0.0177001953125, 0.0235595703125, 0.0030517578125, -0.0189208984375, 0.00151824951171875, 0.03125, 0.0067138671875, 0.0079345703125, -0.0024871826171875, -0.01611328125, 0.020263671875, -0.00083160400390625, -0.02099609375, -0.020751953125, 0.00799560546875, 0.0228271484375, -0.0111...

[ 16970, 9434, 32354, 3129, 34475, 14012, 136, 5303, 30646, 5117, 3853, 117396, 653, 3501, 400, 7008, 39210, 4086, 254, 63134, 90791, 18499, 13695, 6, 17324, 152 ]

[ 0.1466064453125, 0.253662109375, 0.195556640625, 0.0209197998046875, 0.08746337890625, 0.1427001953125, 0.070068359375, 0.1995849609375, 0.17431640625, 0.12274169921875, 0.221435546875, 0.10406494140625, 0.13037109375, 0.043212890625, 0.11773681640625, 0.2037353515625, 0.10009765625,...

embed

19968900_c0

19968900

lisp

0

Title: Why is elt not as common as car, cdr, first, rest? Problem title: Why is elt not as common as car, cdr, first, rest? Tags: common-lisp, lisp Problem: Why is elt not as common as car, cdr, first, rest? I see this a lot in examples I read in books and articles: (caddr *something*) Or the many variants of c***r com...

Why is elt not as common as car, cdr, first, rest? Why is elt not as common as car, cdr, first, rest? common-lisp lisp Why Why is elt not as common as car, cdr, first, rest? I see this a lot in examples I read in books and articles: (caddr *something*) Or the many variants of c***r commands. It seems a bit ridiculous t...

[ 0.01171875, -0.004913330078125, 0.004669189453125, -0.005035400390625, 0.0181884765625, 0.019287109375, 0.0003414154052734375, 0.0025634765625, 0.010009765625, -0.02099609375, 0.0025177001953125, -0.00958251953125, -0.0126953125, 0.002227783203125, -0.004302978515625, -0.0208740234375,...

[ 44084, 83, 88, 18, 959, 237, 39210, 2258, 42, 5117, 10588, 4086, 254, 400, 7008, 1957, 5915, 27781, 12301, 42840, 25426, 7569, 64113, 20117, 43047, 75101, 37202, 236873, 123019, 50065, 8966, 1810, 6704, 4958, 61353, 11814, 5045, 101805, 282...

[ 0.1373291015625, 0.083251953125, 0.110595703125, 0.2015380859375, 0.1368408203125, 0.08282470703125, 0.1795654296875, 0.1339111328125, 0.095458984375, 0.055084228515625, 0.1444091796875, 0.06817626953125, 0.146240234375, 0.05615234375, 0.1346435546875, 0.0167388916015625, 0.018768310...

embed

9284630_c0

9284630

lisp

0

Title: In clojure, map and stringify: make it simpler Problem title: In clojure, map and stringify: make it simpler Tags: lisp, clojure Problem: In clojure, map and stringify: make it simpler map and stringify I have this piece of clojure code: (def up (memfn toUpperCase)) (str "\n" (apply str (interpose "\n" (map up '...

In clojure, map and stringify: make it simpler In clojure, map and stringify: make it simpler lisp clojure In clojure, map and stringify: make it simpler map and stringify I have this piece of clojure code: The code does exactly what it is supposed to do: take a list of string, uppercase each one and envelop each one w...

[ -0.00909423828125, -0.005096435546875, 0.01129150390625, 0.01470947265625, -0.00579833984375, 0.01806640625, 0.015869140625, 0.006988525390625, 0.0142822265625, -0.01275634765625, -0.011474609375, -0.004058837890625, 0.0057373046875, 0.0166015625, -0.0025177001953125, -0.00445556640625...

[ 20450, 461, 107, 22288, 136, 79315, 40383, 3249, 442, 8781, 42, 400, 7008, 765, 903, 63847, 18151, 14602, 66161, 2367, 134598, 54, 5646, 5303, 1407, 56, 58437, 12638, 1632, 197118, 678, 41872, 19, 38893, 8108, 7103, 8110, 3917, 33022, 23,...

[ 0.143798828125, 0.1627197265625, 0.125732421875, 0.1793212890625, 0.07489013671875, 0.242919921875, 0.21337890625, 0.0714111328125, 0.0802001953125, 0.17626953125, 0.1143798828125, 0.08697509765625, 0.1572265625, 0.00543212890625, 0.062744140625, 0.04522705078125, 0.181396484375, 0...

embed

6694695_c0

6694695

lisp

0

Title: Most idiomatic way of replacing a list subsection in Lisp Problem title: Most idiomatic way of replacing a list subsection in Lisp Tags: lisp, common-lisp, list, replace Problem: Most idiomatic way of replacing a list subsection in Lisp What is the best way of replacing a specific subsequence of a list? Say I wa...

Most idiomatic way of replacing a list subsection in Lisp Most idiomatic way of replacing a list subsection in Lisp lisp common-lisp list replace Most Lisp HUNGRY Most idiomatic way of replacing a list subsection in Lisp What is the best way of replacing a specific subsequence of a list? Say I wanted to replace the sub...

[ -0.02392578125, 0.0286865234375, 0.01116943359375, 0.0032806396484375, -0.01025390625, 0.0107421875, -0.0118408203125, 0.00677490234375, 0.016357421875, 0.02392578125, 0.0130615234375, 0.021484375, 0.0067138671875, -0.00125885009765625, 0.002716064453125, -0.006683349609375, 0.012878...

[ 17006, 49666, 9523, 3917, 111, 456, 133266, 214, 5303, 1614, 7, 58994, 23, 1261, 7008, 400, 39210, 4086, 254, 91995, 19229, 34388, 2965, 29458, 184, 944, 36663, 39, 28, 678, 142, 17, 44057, 9149, 3293, 4552, 21373, 32354, 161740, 13 ]

[ 0.111572265625, 0.160888671875, 0.11370849609375, 0.0919189453125, 0.0182647705078125, 0.087158203125, 0.164306640625, 0.0555419921875, 0.2054443359375, 0.1405029296875, 0.121826171875, 0.1331787109375, 0.020751953125, 0.1529541015625, 0.2037353515625, 0.1182861328125, 0.095825195312...

embed

70964796_c0

70964796

lisp

0

Title: Lisp: How to write an if statement with multiple conditions? Problem title: Lisp: How to write an if statement with multiple conditions? Tags: lisp Problem: Lisp: How to write an if statement with multiple conditions? I understand how to write an if statement with an individual condition. For example: (if (> a 2...

Lisp: How to write an if statement with multiple conditions? Lisp: How to write an if statement with multiple conditions? lisp Lisp How Lisp: How to write an if statement with multiple conditions? I understand how to write an if statement with an individual condition. For example: However, after researching online, I f...

[ -0.00311279296875, 0.01513671875, -0.0233154296875, 0.034912109375, -0.009765625, 0.01092529296875, 0.015625, -0.00347900390625, -0.005889892578125, 0.0054931640625, -0.01263427734375, -0.01416015625, 0.005859375, 0.02294921875, -0.005096435546875, 0.0155029296875, -0.00885009765625,...

[ 1261, 7008, 12, 11249, 47, 33022, 142, 2174, 63805, 678, 48716, 27289, 400, 28219, 3642, 11651, 35431, 1118, 65514, 73342, 175199, 977, 387, 4426, 209 ]

[ 0.1368408203125, 0.2069091796875, 0.004337310791015625, 0.0743408203125, 0.016815185546875, 0.17333984375, 0.0426025390625, 0.2205810546875, 0.2298583984375, 0.09722900390625, 0.21240234375, 0.236572265625, 0.08038330078125, 0.05517578125, 0.053131103515625, 0.0966796875, 0.212402343...

embed

51118113_c0

51118113

lisp

0

Title: CLISP representation of a list Problem title: CLISP representation of a list Tags: common-lisp, lisp Problem: CLISP representation of a list I am experimenting with using substitute-if . Here I try to replace all values that are even in '((1) (2) (3) (4)) with '(0) [9]> (substitute-if '(0) #'evenp '((1) (2) (3) ...

CLISP representation of a list CLISP representation of a list common-lisp lisp CLISP CLISP representation of a list I am experimenting with using substitute-if . Here I try to replace all values that are even in '((1) (2) (3) (4)) with '(0) I am confused about the #1=(0) and #1 in the list. I expected it to return '((1...

[ -0.00823974609375, 0.0213623046875, 0.01165771484375, 0.0174560546875, -0.0035552978515625, 0.0277099609375, 0.00016498565673828125, 0.004058837890625, 0.014404296875, 0.031494140625, -0.00738525390625, 0.020263671875, -0.0033416748046875, 0.0106201171875, -0.00494384765625, 0.00607299...

[ 313, 67616, 683, 18811, 1363, 111, 5303, 39210, 4086, 254, 400, 7008, 10, 28007, 17368, 161740, 13, 9, 3190, 9790, 91995, 756, 142424, 3853, 23, 27750, 1737, 2788, 3971, 678, 177609, 55681, 41766, 1369, 136, 84751, 30646, 6649, 24658, 432...

[ 0.03076171875, 0.1728515625, 0.2095947265625, 0.2452392578125, 0.0193328857421875, 0.0167083740234375, 0.24072265625, 0.118408203125, 0.1126708984375, 0.1676025390625, 0.07232666015625, 0.181396484375, 0.000091552734375, 0.129150390625, 0.05694580078125, 0.190185546875, 0.07275390625...

embed

46986286_c1

46986286

lisp

1

T (cond ((null L) nil) ; p != nil, L = nil ((eq (car p), (car L)) ; p!= nil, L != nil (cons ((car L) (find_pattern (cdr p) (cdr L)))))) ) Without running this I already see some problems: If I find a partial-pattern match, I never return to the full pattern. So inputs such as '(a b c) '(d a b d a b c) would get the inc...

[ -0.01953125, 0.0322265625, 0.0084228515625, -0.0036163330078125, 0.003692626953125, 0.01220703125, -0.0164794921875, -0.01507568359375, 0.0296630859375, -0.038330078125, 0.0167236328125, -0.0201416015625, 0.025390625, 0.0008392333984375, 0.005828857421875, 0.017822265625, 0.004943847...

[ 384, 2271, 71, 139550, 339, 17324, 2819, 915, 711, 2203, 60494, 864, 3284, 38, 25553, 111607, 4453, 22766, 7569, 167089, 177417, 51042, 903, 21771, 1957, 3060, 44402, 4263, 7413, 2878, 289, 9, 14858, 87, 8306, 30646, 47, 4393, 103510, 106...

[ 0.18408203125, 0.056854248046875, 0.04010009765625, 0.171875, 0.1239013671875, 0.1793212890625, 0.0156402587890625, 0.072021484375, 0.03704833984375, 0.062469482421875, 0.022247314453125, 0.126953125, 0.1434326171875, 0.03662109375, 0.13330078125, 0.1544189453125, 0.210693359375, 0...

embed

13326979_c1

13326979

lisp

1

from the prefix. Ideally, it would looks something like: for branch = (or (and branch (gethash c branch)) (puthash c (make-hash-table) trie)) ;; ^-----------------^------- cannot reference it here And that's why I have the silly first-time flag, which I could've avoided. Can I somehow use initially form, or maybe rest...

[ 0.00897216796875, 0.03466796875, -0.01141357421875, -0.01318359375, -0.0106201171875, 0.002716064453125, 0.0113525390625, 0.0023345947265625, 0.023193359375, -0.02734375, 0.0032196044921875, 0.004241943359375, 0.01446533203125, 0.0244140625, 0.0086669921875, 0.025634765625, -0.034179...

[ 1295, 183114, 41143, 2806, 33342, 9844, 1884, 100, 32845, 206, 2203, 748, 2940, 3794, 126234, 501, 7077, 55898, 22819, 1927, 13, 53418, 91067, 765, 78, 12097, 5117, 6032, 49938, 5809, 272, 71864, 297, 209303, 4527, 61475, 3173, 137656, 3235...

[ 0.1988525390625, 0.27099609375, 0.1448974609375, 0.04541015625, 0.16748046875, 0.00848388671875, 0.033935546875, 0.10430908203125, 0.15234375, 0.1129150390625, 0.0736083984375, 0.06817626953125, 0.03887939453125, 0.058746337890625, 0.2086181640625, 0.047027587890625, 0.07855224609375...

embed

10008493_c0

10008493

lisp

0

Title: How to recover from LispCabinet error "the server directory is unsafe"? Problem title: How to recover from LispCabinet error "the server directory is unsafe"? Tags: emacs, lisp Problem: How to recover from LispCabinet error "the server directory is unsafe"? I installed LispCabinet and after t...

How to recover from LispCabinet error "the server directory is unsafe"? How to recover from LispCabinet error "the server directory is unsafe"? emacs lisp LispCabinet How How to recover from LispCabinet error "the server directory is unsafe"? I installed LispCabinet and after the first start it tell...

[ 0.004180908203125, 0.00128936767578125, 0.0052490234375, 0.0216064453125, -0.0267333984375, 0.0201416015625, -0.0030670166015625, 0.02392578125, -0.0137939453125, -0.0185546875, -0.004364013671875, 0.010498046875, -0.00180816650390625, 0.01611328125, 0.00089263916015625, -0.01867675781...

[ 11249, 192026, 1295, 1261, 7008, 441, 14508, 1179, 18499, 2347, 10723, 14364, 53, 83, 51, 115840, 41502, 352, 2263, 400, 47, 20600, 33, 56851, 936, 238, 12, 239469, 105548, 169057, 47677, 182867, 137989, 11883, 4439, 71, 64, 39642, 29459, ...

[ 0.05682373046875, 0.1995849609375, 0.09478759765625, 0.1649169921875, 0.202392578125, 0.0682373046875, 0.1861572265625, 0.18310546875, 0.1881103515625, 0.110107421875, 0.2415771484375, 0.178466796875, 0.12158203125, 0.1312255859375, 0.1290283203125, 0.2489013671875, 0.022171020507812...

embed

33028474_c0

33028474

lisp

0

Title: How can I recursively check if a list is sorted in Lisp? Problem title: How can I recursively check if a list is sorted in Lisp? Tags: lisp, common-lisp, recursion, list Problem: How can I recursively check if a list is sorted in Lisp? I want to write a recursive function that checks the list and either returns ...

How can I recursively check if a list is sorted in Lisp? How can I recursively check if a list is sorted in Lisp? lisp common-lisp recursion list How Lisp How can I recursively check if a list is sorted in Lisp? I want to write a recursive function that checks the list and either returns true if the list is in ascendin...

[ -0.0167236328125, 0.01611328125, 0.0235595703125, -0.000728607177734375, -0.01409912109375, 0.01495361328125, -0.0024566650390625, -0.00823974609375, -0.006378173828125, 0.0159912109375, 0.00177764892578125, 0.004730224609375, -0.0076904296875, -0.00125885009765625, 0.000553131103515625,...

[ 11249, 831, 195625, 5844, 538, 12765, 2174, 5303, 83, 17497, 71, 23, 1261, 7008, 87, 400, 39210, 4086, 254, 1830, 3444, 33022, 32354, 30646, 29568, 82800, 12989, 541, 16444, 120262, 201505, 7464, 3525 ]

[ 0.069091796875, 0.08349609375, 0.21728515625, 0.18017578125, 0.087646484375, 0.2342529296875, 0.1090087890625, 0.2269287109375, 0.06982421875, 0.234619140625, 0.15087890625, 0.0838623046875, 0.1737060546875, 0.24365234375, 0.02581787109375, 0.1102294921875, 0.06414794921875, 0.0830...

embed

18697105_c0

18697105

lisp

0

Title: 'cdadr' on nested data list in lisp Problem title: 'cdadr' on nested data list in lisp Tags: lisp, common-lisp Problem: 'cdadr' on nested data list in lisp While studying cons , cdr and car to handle lists I tried following : (cadr '('(1) '(2))) '(2) which gives the second item in the list as...

'cdadr' on nested data list in lisp 'cdadr' on nested data list in lisp lisp common-lisp 'cdadr' on nested data list in lisp While studying cons , cdr and car to handle lists I tried following : which gives the second item in the list as expected. Whereas following gives : How is data being concerte...

[ 0.005889892578125, 0.0301513671875, 0.002685546875, 0.0026702880859375, 0.01123046875, 0.045654296875, 0.0128173828125, -0.01251220703125, -0.00032806396484375, -0.01422119140625, -0.01483154296875, -0.01953125, -0.00104522705078125, 0.0157470703125, -0.009765625, -0.0047607421875, 0...

[ 3768, 12409, 42, 98, 8512, 71, 2053, 5303, 400, 7008, 39210, 4086, 254, 158, 56329, 2258, 34831, 37842, 25632, 76199, 17932, 35735, 23, 237, 84751, 11249, 8035, 20428, 47, 18151, 7464, 959, 68772, 18499, 151575, 242, 40970, 5608, 8337, 17...

[ 0.077880859375, 0.041534423828125, 0.1895751953125, 0.07452392578125, 0.1949462890625, 0.09210205078125, 0.1788330078125, 0.1871337890625, 0.1043701171875, 0.1995849609375, 0.118896484375, 0.10009765625, 0.166259765625, 0.111083984375, 0.06414794921875, 0.159423828125, 0.058471679687...

embed

13633124_c0

13633124

lisp

0

Title: Visualize s-expressions in real-time Problem title: Visualize s-expressions in real-time Tags: emacs, clojure, s-expression, lisp, code-visualization Problem: Visualize s-expressions in real-time I want to write Lisp/Scheme/Clojure code like this (map inc (range 0 5)) And have it visualized somewhat like this ma...

Visualize s-expressions in real-time Visualize s-expressions in real-time emacs clojure s-expression lisp code-visualization Visualize Visualize s-expressions in real-time I want to write Lisp/Scheme/Clojure code like this And have it visualized somewhat like this I want to see the tree change in real-time as I manipul...

[ 0.01287841796875, 0.0361328125, -0.02978515625, -0.011474609375, 0.00927734375, 0.0189208984375, -0.0172119140625, 0.0091552734375, -0.00518798828125, -0.00457763671875, 0.0027008056640625, 0.0203857421875, -0.0181884765625, 0.01123046875, 0.0213623046875, 0.0017852783203125, -0.0034...

[ 73372, 20650, 91, 204629, 7, 23, 2773, 6032, 9, 352, 2263, 20450, 461, 107, 400, 7008, 18151, 1824, 20605, 3444, 33022, 1261, 25452, 12549, 20219, 3408, 1884, 903, 21176, 208806, 1957, 53201, 15549, 45258, 125195, 1360, 90, 24209, 21334, ...

[ 0.2025146484375, 0.107177734375, 0.1419677734375, 0.2137451171875, 0.019622802734375, 0.0182342529296875, 0.1617431640625, 0.135498046875, 0.0211334228515625, 0.03564453125, 0.080810546875, 0.0885009765625, 0.102783203125, 0.049072265625, 0.06903076171875, 0.1566162109375, 0.17150878...

embed

13793031_c0

13793031

lisp

0

Title: position cursor in init rebinding macro Problem title: position cursor in init rebinding macro Tags: emacs, lisp Problem: position cursor in init rebinding macro I am trying to make a keyboard macro that prints a LaTeX macro and places the cursor inside it. For example, I have the following placed in my .emacs f...

position cursor in init rebinding macro position cursor in init rebinding macro emacs lisp C-c position cursor in init rebinding macro I am trying to make a keyboard macro that prints a LaTeX macro and places the cursor inside it. For example, I have the following placed in my .emacs file: I would like to set the curso...

[ -0.0166015625, 0.022216796875, -0.006683349609375, -0.0103759765625, 0.0029754638671875, -0.00604248046875, 0.00567626953125, -0.004852294921875, 0.00933837890625, -0.0108642578125, 0.0250244140625, -0.007415771484375, 0.0103759765625, -0.0177001953125, -0.004669189453125, -0.000114917...

[ 19069, 13810, 42, 23, 217, 456, 128239, 111789, 352, 2263, 7, 400, 7008, 313, 9, 238, 31577, 149186, 28412, 239, 10476, 1542, 44677, 46132, 25632, 158012, 5, 11883, 4439, 11435, 2806, 1884, 5423, 70, 9709, 538, 1620, 27853, 903, 10, 100...

[ 0.230712890625, 0.203125, 0.157958984375, 0.09173583984375, 0.1685791015625, 0.1168212890625, 0.219482421875, 0.2083740234375, 0.07177734375, 0.12744140625, 0.0789794921875, 0.0750732421875, 0.167724609375, 0.0384521484375, 0.01123809814453125, 0.0499267578125, 0.0265960693359375, ...

embed

19528196_c0

19528196

lisp

0

Title: a function in lisp called xtoy which returns a list from x to y Problem title: a function in lisp called xtoy which returns a list from x to y Tags: practical-common-lisp, lisp, common-lisp, ansi-common-lisp Problem: a function in lisp called xtoy which returns a list from x to y I am very new to lisp. I am tryi...

a function in lisp called xtoy which returns a list from x to y a function in lisp called xtoy which returns a list from x to y practical-common-lisp lisp common-lisp ansi-common-lisp x x2y a function in lisp called xtoy which returns a list from x to y I am very new to lisp. I am trying to write a function named x2y w...

[ 0.00836181640625, 0.005096435546875, 0.0152587890625, 0.00640869140625, -0.0034332275390625, 0.03271484375, 0.0042724609375, 0.00140380859375, 0.01025390625, 0.026611328125, 0.0093994140625, -0.01318359375, -0.00064849853515625, -0.0078125, 0.001708984375, -0.0115966796875, 0.0027618...

[ 32354, 23, 400, 7008, 35839, 1022, 188, 53, 30646, 10, 5303, 1295, 47, 113, 3129, 138155, 3796, 4086, 254, 39210, 172, 304, 7, 4552, 3525, 31577, 33022, 51776, 116, 10750, 136, 892, 26255, 4034, 3564, 99 ]

[ 0.2154541015625, 0.07171630859375, 0.1448974609375, 0.2352294921875, 0.06317138671875, 0.10626220703125, 0.201171875, 0.22900390625, 0.1690673828125, 0.03936767578125, 0.196044921875, 0.1256103515625, 0.1546630859375, 0.1824951171875, 0.0280609130859375, 0.1463623046875, 0.1035766601...

embed

16006167_c0

16006167

lisp

0

Title: scheme higher order func Problem title: scheme higher order func Tags: scheme, lisp, hash Problem: scheme higher order func Given the skeleton of a function: (define gen-hash-division-method (lambda (size))) as well as: (define hash-1 (gen-hash-division-method 701)) What I have coded: (define gen-hash-division-m...

scheme higher order func scheme higher order func scheme lisp hash hash-1 scheme higher order func Given the skeleton of a function: as well as: What I have coded: key(flip(w)) takes a list w and returns an integer. And call: I keep getting this error:

[ -0.0244140625, 0.02392578125, -0.010498046875, -0.01409912109375, -0.01385498046875, -0.012939453125, 0.0224609375, -0.0177001953125, -0.0032958984375, -0.0380859375, -0.01312255859375, 0.019775390625, 0.016845703125, -0.004638671875, 0.004638671875, -0.035888671875, 0.00653076171875...

[ 150370, 77546, 12989, 7477, 238, 400, 7008, 1556, 127, 5759, 182355, 191, 32354, 765, 18151, 22799, 132, 420, 21392, 434, 51776, 5303, 148, 30646, 7, 892, 1505, 11782, 13695, 20949, 903, 18499 ]

[ 0.240966796875, 0.144775390625, 0.1724853515625, 0.113037109375, 0.04718017578125, 0.0501708984375, 0.1541748046875, 0.12225341796875, 0.08587646484375, 0.09490966796875, 0.1748046875, 0.105712890625, 0.1844482421875, 0.0007801055908203125, 0.1507568359375, 0.2144775390625, 0.0070075...

embed

17163653_c0

17163653

lisp

0

Title: From Google Common Lisp Style Guide: "Avoid modifying local variables, try rebinding instead" meaning? Problem title: From Google Common Lisp Style Guide: "Avoid modifying local variables, try rebinding instead" meaning? Tags: common-lisp, lisp Problem: From Google Common Lisp Style Guide: "A...

From Google Common Lisp Style Guide: "Avoid modifying local variables, try rebinding instead" meaning? From Google Common Lisp Style Guide: "Avoid modifying local variables, try rebinding instead" meaning? common-lisp lisp Google Common Lisp Style Guide Avoid From Google Common Lisp Style Guide: "Av...

[ -0.033203125, 0.025634765625, -0.004913330078125, -0.008544921875, -0.0108642578125, 0.00927734375, 0.003631591796875, 0.0181884765625, -0.004486083984375, -0.00762939453125, 0.01019287109375, -0.01324462890625, 0.0281982421875, 0.01409912109375, 0.021240234375, 0.0213623046875, -0.0...

[ 1815, 151301, 1261, 7008, 57845, 44583, 45475, 48899, 2811, 151138, 4000, 77336, 9790, 456, 128239, 64457, 91084, 39210, 4086, 254, 400, 84361, 532, 29459, 149357 ]

[ 0.09686279296875, 0.08319091796875, 0.07574462890625, 0.106201171875, 0.1109619140625, 0.109375, 0.1295166015625, 0.1749267578125, 0.1134033203125, 0.1005859375, 0.1273193359375, 0.1912841796875, 0.1619873046875, 0.1746826171875, 0.27294921875, 0.1771240234375, 0.1412353515625, 0.0...

embed

35564847_c0

35564847

lisp

0

Title: How to pass a symbol as a keyword argument? Problem title: How to pass a symbol as a keyword argument? Tags: lisp, common-lisp Problem: How to pass a symbol as a keyword argument? I export a few symbols from a package and use them internally in a case statement. I'd like to pass one of the symbols (e.g. medium-s...

How to pass a symbol as a keyword argument? How to pass a symbol as a keyword argument? lisp common-lisp How How to pass a symbol as a keyword argument? I export a few symbols from a package and use them internally in a case statement. I'd like to pass one of the symbols (e.g. medium-size) as a keyword argument to a ge...

[ 0.002838134765625, -0.0023040771484375, 0.0167236328125, -0.03076171875, -0.0206298828125, -0.004974365234375, -0.0208740234375, -0.005218505859375, -0.004730224609375, 0.017578125, 0.0089111328125, -0.00933837890625, 0.0167236328125, 0.0145263671875, -0.01495361328125, 0.00830078125, ...

[ 11249, 47, 27875, 10, 26582, 237, 166117, 10750, 400, 7008, 39210, 4086, 254, 31255, 10846, 98169, 4527, 70796, 7225, 63805, 1884, 57646, 62539, 189534, 55300, 13606, 14012, 619, 186104, 7, 18499, 24658, 20531 ]

[ 0.0814208984375, 0.026702880859375, 0.1669921875, 0.0404052734375, 0.272705078125, 0.093017578125, 0.238525390625, 0.2626953125, 0.07275390625, 0.1751708984375, 0.0941162109375, 0.028045654296875, 0.131103515625, 0.1221923828125, 0.007476806640625, 0.1356201171875, 0.04620361328125, ...

embed

7539616_c0

7539616

lisp

0

Title: Scheme function that sum number u and list x u+x1+x2 Problem title: Scheme function that sum number u and list x u+x1+x2 Tags: tail-recursion, scheme, lisp Problem: Scheme function that sum number u and list x u+x1+x2 Im new to Scheme and trying to make function that is (in f u x), u is integer, x is a list and ...

Scheme function that sum number u and list x u+x1+x2 Scheme function that sum number u and list x u+x1+x2 tail-recursion scheme lisp Scheme Scheme function that sum number u and list x u+x1+x2 Im new to Scheme and trying to make function that is (in f u x), u is integer, x is a list and f binary function. The scheme ex...

[ -0.0120849609375, 0.026123046875, 0.020751953125, 0.0028228759765625, -0.00726318359375, 0.019287109375, -0.0172119140625, 0.00469970703125, 0.01361083984375, -0.03125, 0.0123291015625, -0.033447265625, -0.0002880096435546875, -0.004791259765625, 0.0203857421875, -0.0024871826171875, ...

[ 34702, 282, 32354, 450, 10554, 14012, 75, 136, 5303, 1022, 1328, 425, 304, 46741, 107, 48650, 1830, 150370, 400, 7008, 418, 3525, 31577, 73, 1238, 83, 892, 1505, 2394, 6635, 125195, 997, 138, 242, 116, 8439, 5608, 30646, 21748, 54651, 8...

[ 0.232666015625, 0.1734619140625, 0.2080078125, 0.041351318359375, 0.21484375, 0.177734375, 0.1558837890625, 0.09405517578125, 0.2010498046875, 0.07501220703125, 0.111083984375, 0.009613037109375, 0.1588134765625, 0.20849609375, 0.0249786376953125, 0.1578369140625, 0.044677734375, 0...

embed

53209247_c0

53209247

lisp

0

Title: Lisp/Intersection of Lists Problem title: Lisp/Intersection of Lists Tags: common-lisp, lisp, set-intersection Problem: Lisp/Intersection of Lists Hello i am trying to create a function in common-lisp that takes two lists, and output their intersections, assuming there is no repetition in each list without using...

Lisp/Intersection of Lists Lisp/Intersection of Lists common-lisp lisp set-intersection Lisp Intersection Lists lst_1 lst_2 Lisp/Intersection of Lists Hello i am trying to create a function in common-lisp that takes two lists, and output their intersections, assuming there is no repetition in each list without using in...

[ -0.0179443359375, 0.0037689208984375, 0.01287841796875, 0.01007080078125, -0.01373291015625, 0.0400390625, 0.00099945068359375, -0.002685546875, -0.00457763671875, -0.018310546875, 0.01025390625, 0.020263671875, -0.002227783203125, -0.0003871917724609375, -0.0009613037109375, 0.0037384...

[ 1261, 7008, 44851, 7, 58994, 111, 32036, 64, 39210, 4086, 254, 400, 5423, 10433, 5337, 271, 115187, 304, 35378, 31577, 28282, 32354, 51776, 6626, 5303, 140992, 2363, 1940, 66596, 110, 57346, 12638, 15490, 17368, 37202, 959, 20697, 4358 ]

[ 0.1468505859375, 0.22412109375, 0.11077880859375, 0.169921875, 0.1834716796875, 0.05511474609375, 0.222900390625, 0.031585693359375, 0.16455078125, 0.131103515625, 0.194091796875, 0.11798095703125, 0.137451171875, 0.14306640625, 0.1015625, 0.0023365020751953125, 0.025421142578125, ...

embed

19812506_c0

19812506

lisp

0

Title: How to `require` a file without printing out its top level expressions? Problem title: How to `require` a file without printing out its top level expressions? Tags: lisp, racket, scheme Problem: How to `require` a file without printing out its top level expressions? File a.rkt : #lang racket (provide f) (define ...

How to `require` a file without printing out its top level expressions? How to `require` a file without printing out its top level expressions? lisp racket scheme a.rkt How b.rkt How to `require` a file without printing out its top level expressions? File a.rkt : File b.rkt : Then when I run b.rkt , I will get f which ...

[ -0.000682830810546875, 0.004180908203125, -0.006988525390625, 0.0250244140625, -0.01953125, -0.006500244140625, 0.00701904296875, -0.008056640625, 0.003173828125, -0.004852294921875, -0.005462646484375, -0.0111083984375, -0.01312255859375, 0.0034027099609375, 0.007171630859375, -0.0214...

[ 11249, 47, 107, 3181, 11435, 15490, 2448, 1810, 2663, 17366, 125195, 1916, 400, 7008, 673, 27853, 150370, 10, 7190, 18, 876, 42724, 5, 11675, 2046, 1238, 3129, 2367, 3444, 209, 2843, 28412, 23, 9069, 21130, 2301, 831, 64209 ]

[ 0.063232421875, 0.0675048828125, 0.1702880859375, 0.206298828125, 0.210205078125, 0.149169921875, 0.0789794921875, 0.060150146484375, 0.0692138671875, 0.1142578125, 0.1461181640625, 0.02301025390625, 0.06829833984375, 0.1527099609375, 0.053985595703125, 0.1629638671875, 0.12646484375...

embed

21830480_c0

21830480

lisp

0

Title: Racket function flag arguments Problem title: Racket function flag arguments Tags: lisp, lambda, function, keyword-argument, racket Problem: Racket function flag arguments Racket guide introduces functions with keyword arguments: (define (F #:keyword argument) ...) When we use it, we need to associate certain va...

Racket function flag arguments Racket function flag arguments lisp lambda function keyword-argument racket Racket Racket function flag arguments Racket guide introduces functions with keyword arguments: When we use it, we need to associate certain value with the argument: But in the same guide there is an example of ke...

[ 0.0118408203125, 0.005950927734375, 0.00811767578125, -0.01123046875, -0.006103515625, 0.0120849609375, -0.00604248046875, 0.00921630859375, -0.01953125, 0.04150390625, 0.0159912109375, -0.019287109375, -0.009033203125, 0.003265380859375, 0.0238037109375, 0.00982666015625, 0.00872802...

[ 2552, 27853, 32354, 49938, 10750, 400, 7008, 6492, 85, 166117, 155937, 673, 17997, 65508, 4527, 3871, 30699, 34292, 678, 27781, 110, 7722, 28282, 5062, 77848, 70796, 60213 ]

[ 0.08770751953125, 0.195068359375, 0.164794921875, 0.2261962890625, 0.2430419921875, 0.050018310546875, 0.1317138671875, 0.09539794921875, 0.05523681640625, 0.2130126953125, 0.188232421875, 0.06390380859375, 0.1455078125, 0.04266357421875, 0.0225067138671875, 0.03204345703125, 0.12622...

embed

70753815_c0

70753815

lisp

0

Title: Lisp constants used in multiple places Problem title: Lisp constants used in multiple places Tags: constants, lisp Problem: Lisp constants used in multiple places There are some constants in my application that I want to use throughout the program. This is what I currently do: (defconst my-constant-alist '((my-f...

Lisp constants used in multiple places Lisp constants used in multiple places constants lisp Lisp Lisp constants used in multiple places There are some constants in my application that I want to use throughout the program. This is what I currently do: within the code I then use: However, since I use the constant in a c...

[ 0.01318359375, 0.019287109375, -0.01263427734375, -0.01123046875, 0.00141143798828125, -0.00146484375, 0.001129150390625, 0.007232666015625, -0.01226806640625, -0.03271484375, -0.0155029296875, 0.0118408203125, 0.00830078125, 0.022705078125, -0.0037689208984375, 0.01458740234375, -0....

[ 1261, 7008, 53697, 7, 11814, 23, 48716, 44677, 400, 3060, 38415, 3444, 4527, 87420, 1528, 82424, 28032, 18151, 33306, 24941, 1660, 14602, 959, 6713, 4127, 27650, 3917, 17368, 93403, 756, 645 ]

[ 0.1622314453125, 0.206787109375, 0.229248046875, 0.098388671875, 0.14892578125, 0.053680419921875, 0.19384765625, 0.1962890625, 0.1273193359375, 0.0079498291015625, 0.131103515625, 0.06646728515625, 0.1185302734375, 0.0859375, 0.1324462890625, 0.04150390625, 0.059295654296875, 0.10...

embed

3614048_c1

3614048

lisp

1

completely foreign to me. Anyone know what's going on here? If it helps, I'm running emacs 23 from within OS X's Terminal window. Edit: Sorry all, but I figured out a way around this. Apparently nXhtml automatically highlights all text for some reason, but you can turn this off using the following option: M-x customiz...

[ 0.00830078125, 0.0022735595703125, -0.00982666015625, -0.0244140625, -0.0076904296875, 0.04248046875, -0.0014190673828125, 0.0003509521484375, -0.0177001953125, 0.01007080078125, -0.0137939453125, 0.001861572265625, -0.00885009765625, -0.021484375, -0.006378173828125, -0.0289306640625,...

[ 64557, 110613, 3630, 3714, 7730, 3688, 112397, 51042, 352, 2263, 7, 1105, 1295, 28032, 11787, 1193, 124090, 76896, 90502, 756, 26366, 3917, 10932, 903, 99547, 653, 1542, 7693, 191082, 127308, 7986, 31635, 831, 15504, 5773, 35829, 276, 425, ...

[ 0.033843994140625, 0.08673095703125, 0.01373291015625, 0.083251953125, 0.01446533203125, 0.041107177734375, 0.055633544921875, 0.076904296875, 0.1241455078125, 0.1397705078125, 0.131103515625, 0.1773681640625, 0.0841064453125, 0.1177978515625, 0.1280517578125, 0.1204833984375, 0.1909...

embed

2234860_c0

2234860

lisp

0

Title: lisp filter out results from list not matching predicate Problem title: lisp filter out results from list not matching predicate Tags: filter, predicate, list, lisp, elisp Problem: lisp filter out results from list not matching predicate I am trying to learn lisp, using emacs dialect and I have a question. let u...

lisp filter out results from list not matching predicate lisp filter out results from list not matching predicate filter predicate list lisp elisp list lisp filter out results from list not matching predicate I am trying to learn lisp, using emacs dialect and I have a question. let us say list has some members, for whi...

[ 0.00701904296875, 0.0234375, 0.0003948211669921875, -0.0162353515625, -0.0115966796875, 0.01611328125, 0.01324462890625, 0.0264892578125, 0.007568359375, 0.01202392578125, 0.01055908203125, -0.000720977783203125, -0.0146484375, -0.008544921875, -0.0157470703125, 0.01019287109375, 0.0...

[ 400, 7008, 46312, 1810, 50339, 1295, 5303, 959, 14858, 214, 1653, 2063, 15296, 30698, 352, 2263, 7, 220734, 43032, 151575, 47, 98320, 28282, 3525, 15490, 62, 23, 339, 915, 284, 29568, 17198, 50828, 32354, 183234 ]

[ 0.139892578125, 0.199462890625, 0.236328125, 0.109619140625, 0.1868896484375, 0.1318359375, 0.20458984375, 0.142822265625, 0.1781005859375, 0.0841064453125, 0.1429443359375, 0.166748046875, 0.07257080078125, 0.024505615234375, 0.0179443359375, 0.051849365234375, 0.000762939453125, ...

embed

38793332_c0

38793332

lisp

0

Title: Association list in another association list Problem title: Association list in another association list Tags: common-lisp, lisp Problem: Association list in another association list Is there any way to make something in lisp that can do like an association list in another association list, I tried : (setq alist...

Association list in another association list Association list in another association list common-lisp lisp Association Maximum LIST Association list in another association list Is there any way to make something in lisp that can do like an association list in another association list, I tried : but it gives : and then ...

[ 0.01446533203125, 0.0213623046875, 0.0002918243408203125, 0.018310546875, 0.0030517578125, -0.00396728515625, -0.00933837890625, 0.0130615234375, 0.0087890625, -0.0294189453125, 0.01092529296875, -0.00469970703125, 0.002288818359375, 0.0181884765625, 0.0169677734375, -0.003189086914062...

[ 56187, 5303, 23, 15700, 125413, 39210, 4086, 254, 400, 7008, 46540, 316, 195977, 3917, 3249, 9844, 54, 1884, 37842, 76199, 903, 18499 ]

[ 0.176513671875, 0.1982421875, 0.0455322265625, 0.0950927734375, 0.1884765625, 0.0203399658203125, 0.05255126953125, 0.128662109375, 0.09234619140625, 0.1732177734375, 0.09454345703125, 0.03369140625, 0.1741943359375, 0.019134521484375, 0.0753173828125, 0.037200927734375, 0.0274963378...

embed

34678996_c0

34678996

lisp

0

Title: Use read-time conditionalization on several atoms Problem title: Use read-time conditionalization on several atoms Tags: lisp, common-lisp Problem: Use read-time conditionalization on several atoms I want to use Lisp's read-time conditionalization feature to merge two versions of my code, old and new. I have som...

Use read-time conditionalization on several atoms Use read-time conditionalization on several atoms lisp common-lisp Use Use read-time conditionalization on several atoms I want to use Lisp's read-time conditionalization feature to merge two versions of my code, old and new. I have something like: so the old version is...

[ -0.00933837890625, 0.0037078857421875, 0.0162353515625, -0.0019683837890625, 0.00872802734375, 0.01263427734375, 0.00238037109375, 0.004669189453125, 0.00714111328125, 0.0032806396484375, 0.006744384765625, 0.00179290771484375, 0.0159912109375, -0.0118408203125, 0.01348876953125, -0.01...

[ 36836, 12301, 6032, 35431, 289, 47691, 98, 40368, 34627, 400, 7008, 39210, 4086, 254, 3444, 4527, 1261, 9, 60213, 42564, 6626, 11389, 18151, 10332, 3525, 83, 3229, 61924, 3917, 32562, 903, 1286, 6333, 4734, 1632, 74918, 468, 1328, 54936 ]

[ 0.113525390625, 0.167724609375, 0.189697265625, 0.1998291015625, 0.1217041015625, 0.1290283203125, 0.0277099609375, 0.113037109375, 0.2030029296875, 0.0985107421875, 0.2322998046875, 0.1107177734375, 0.09033203125, 0.1396484375, 0.043701171875, 0.126953125, 0.1312255859375, 0.00335...

embed

23770363_c0

23770363

lisp

0

Title: Lisp associative list Problem title: Lisp associative list Tags: associative, lisp Problem: Lisp associative list (defun next () (defparameter *sentences* '( (1 . "Test 1") (2 . "Test 2"))) (let (sentence '(assoc 2 *sentences*)) ;This quote is needed, another program evaluates this. (format t "*sentences*:~%~a~%...

Lisp associative list Lisp associative list associative lisp Lisp Test Lisp associative list It gives output "*sentences*: ((1 . Test 1) (2 . Test 2)) sentence: NIL". Why doesn't it give (2 . Test 2) as the value of "sentence"? Thanks in advance. EDIT: added parentheses. The original program has matched parentheses.

[ 0.0152587890625, 0.0260009765625, -0.010498046875, 0.0257568359375, -0.007171630859375, -0.000797271728515625, 0.015869140625, 0.0218505859375, 0.012451171875, -0.023193359375, 0.03173828125, 0.018798828125, -0.022705078125, -0.0062255859375, 0.0157470703125, -0.000934600830078125, 0...

[ 1261, 7008, 166027, 272, 5303, 400, 8647, 76199, 140992, 12832, 69098, 41600, 4879, 4700, 4958, 149357, 541, 16444, 44084, 22027, 18, 8337, 237, 34292, 6620, 49129, 35412, 90, 1528, 14858 ]

[ 0.132080078125, 0.178955078125, 0.143310546875, 0.05548095703125, 0.1619873046875, 0.0953369140625, 0.208740234375, 0.046173095703125, 0.140380859375, 0.1224365234375, 0.1334228515625, 0.05133056640625, 0.043670654296875, 0.0736083984375, 0.10015869140625, 0.2041015625, 0.13305664062...

embed

16089809_c0

16089809

lisp

0

Title: What's the equivalent of constructors in CLOS? Problem title: What's the equivalent of constructors in CLOS? Tags: clos, common-lisp, lisp Problem: What's the equivalent of constructors in CLOS? How would you express the following Java code in Lisp? class Foo { private String s; public Foo(String s) { ...

What's the equivalent of constructors in CLOS? What's the equivalent of constructors in CLOS? clos common-lisp lisp What CLOS Foo this.s Bar Integer.toString What's the equivalent of constructors in CLOS? How would you express the following Java code in Lisp? In Lisp, is make-instance or initialize-instance t...

[ 0.01080322265625, 0.0255126953125, 0.00133514404296875, 0.03857421875, 0.0010528564453125, 0.005859375, 0.01458740234375, 0.0189208984375, 0.0103759765625, -0.0164794921875, -0.00144195556640625, -0.012451171875, 0.013427734375, 0.01129150390625, -0.00958251953125, -0.03271484375, 0....

[ 3768, 70, 183234, 111, 64549, 25251, 23, 313, 92933, 7, 20450, 39210, 4086, 254, 400, 7008, 9572, 31, 903, 3253, 44401, 188, 71713, 36510, 25632, 41925, 18151, 1261, 3249, 116071, 707, 61475, 20650, 748, 11782, 1601, 18507 ]

[ 0.06683349609375, 0.0260772705078125, 0.2071533203125, 0.035369873046875, 0.2152099609375, 0.2169189453125, 0.06817626953125, 0.05633544921875, 0.240234375, 0.102783203125, 0.1844482421875, 0.1041259765625, 0.0750732421875, 0.1397705078125, 0.0650634765625, 0.1854248046875, 0.1409912...

embed

26196699_c0

26196699

lisp

0

Title: Is LISP's code-as-data ideology basically the same thing as higher order functions? Problem title: Is LISP's code-as-data ideology basically the same thing as higher order functions? Tags: higher-order-functions, clojure, scala, lisp Problem: Is LISP's code-as-data ideology basically the same thing as ...

Is LISP's code-as-data ideology basically the same thing as higher order functions? Is LISP's code-as-data ideology basically the same thing as higher order functions? higher-order-functions clojure scala lisp LISP Is LISP's code-as-data ideology basically the same thing as higher order functions? So, I've be...

[ 0.020263671875, 0.00762939453125, -0.00885009765625, 0.0002346038818359375, 0.00439453125, 0.0113525390625, 0.015625, -0.015380859375, 0.0035858154296875, -0.034423828125, -0.017333984375, -0.01385498046875, -0.01458740234375, -0.0269775390625, -0.005523681640625, -0.01416015625, -0....

[ 16970, 9434, 3768, 18151, 162, 10135, 5415, 25443, 198343, 5701, 13580, 77546, 12989, 32354, 80596, 137175, 20450, 461, 107, 146232, 400, 7008, 2071, 237, 6528, 51515, 55681, 37202, 5915, 1884, 42856, 60212, 17721, 6626, 23755 ]

[ 0.1444091796875, 0.22314453125, 0.039520263671875, 0.2237548828125, 0.18115234375, 0.1837158203125, 0.183837890625, 0.1639404296875, 0.0875244140625, 0.102783203125, 0.059356689453125, 0.12939453125, 0.1873779296875, 0.181640625, 0.15966796875, 0.1575927734375, 0.1300048828125, 0.1...

embed

64727596_c0

64727596

lisp

0

Title: Read terminal argument and pass the function in lisp? Problem title: Read terminal argument and pass the function in lisp? Tags: clisp, common-lisp, lisp Problem: Read terminal argument and pass the function in lisp? (defun gppinterpreter (filename) (setq fileContent (read-a-file filename)) (write filecontent) )...

Read terminal argument and pass the function in lisp? Read terminal argument and pass the function in lisp? clisp common-lisp lisp Read Read terminal argument and pass the function in lisp? I compile this file in ubuntu clisp example.lisp I want to get the filename parameter directly from the terminal such as >> clisp ...

[ 0.0166015625, 0.0167236328125, -0.0133056640625, 0.0012054443359375, -0.0205078125, 0.007080078125, 0.022216796875, 0.0167236328125, -0.026611328125, -0.0272216796875, 0.0238037109375, 0.0028076171875, -0.02978515625, -0.000774383544921875, 0.00592041015625, -0.005889892578125, 0.010...

[ 4764, 33949, 10750, 136, 27875, 32354, 23, 400, 7008, 95701, 39210, 4086, 254, 9969, 1340, 11435, 198996, 27781, 3444, 2046, 11627, 171859, 105237, 1295, 75101, 20697, 706, 6366, 158288, 56 ]

[ 0.1962890625, 0.259521484375, 0.2237548828125, 0.0174407958984375, 0.130859375, 0.1480712890625, 0.05364990234375, 0.1270751953125, 0.2269287109375, 0.100341796875, 0.08087158203125, 0.0965576171875, 0.191650390625, 0.048675537109375, 0.01116943359375, 0.10064697265625, 0.07635498046...

embed

37956731_c0

37956731

lisp

0

Title: Stackoverflow in Common Lisp Mergesort Problem title: Stackoverflow in Common Lisp Mergesort Tags: list, lisp, mergesort, stack-overflow, common-lisp Problem: Stackoverflow in Common Lisp Mergesort (defun mergesort (alist low high) (when (< low high) (mergesort alist low (/ (+ low high) 2)) (mergesort alist (/ (...

Stackoverflow in Common Lisp Mergesort Stackoverflow in Common Lisp Mergesort list lisp mergesort stack-overflow common-lisp j Stackoverflow Common Lisp Mergesort Error Stack While TRUNCATE Stackoverflow in Common Lisp Mergesort I've written my first ever Common Lisp function and I'm having trouble tracking down where ...

[ 0.005767822265625, 0.0191650390625, 0.0155029296875, -0.0281982421875, 0.00567626953125, -0.005767822265625, -0.031005859375, 0.01214599609375, 0.0033416748046875, -0.000270843505859375, -0.0076904296875, 0.0230712890625, 0.0277099609375, -0.002532958984375, 0.01025390625, 0.0000567436...

[ 6512, 2594, 5465, 118664, 151301, 1261, 7008, 6035, 429, 62351, 23, 5303, 400, 42564, 177261, 39210, 4086, 254, 1647, 212059, 51404, 14107, 175560, 35746, 59121, 5117, 32354, 63134, 28560, 18499, 181653, 106443, 645, 98, 34292, 71924, 214, 18...

[ 0.153564453125, 0.15966796875, 0.1170654296875, 0.28125, 0.1614990234375, 0.1365966796875, 0.162109375, 0.1446533203125, 0.07635498046875, 0.1998291015625, 0.010345458984375, 0.0985107421875, 0.0718994140625, 0.1746826171875, 0.2247314453125, 0.1484375, 0.07916259765625, 0.11645507...

embed

16379657_c0

16379657

lisp

0

Title: Recursive range in Lisp adds a period? Problem title: Recursive range in Lisp adds a period? Tags: lisp, scheme Problem: Recursive range in Lisp adds a period? (define .. (lambda (start stop) (cond ((> (add1 start) stop) (quote ())) ((eq? (add1 start) stop) (sub1 stop)) (else (cons start (.. (add1 start) stop)))...

Recursive range in Lisp adds a period? Recursive range in Lisp adds a period? lisp scheme Recursive Lisp add1 sub1 Recursive range in Lisp adds a period? I have defined a simple range function. The intent is for Instead, a bizarre period is being added to my tuple and I have no idea why: I don't understand why this is ...

[ -0.00109100341796875, 0.03759765625, 0.0012359619140625, -0.0034942626953125, -0.02392578125, 0.011474609375, -0.0218505859375, -0.000324249267578125, -0.00823974609375, -0.001922607421875, 0.004791259765625, 0.005279541015625, -0.00286865234375, 0.002960205078125, 0.0224609375, -0.013...

[ 853, 48650, 5844, 37457, 1261, 7008, 15190, 14922, 23, 7, 10, 400, 150370, 418, 1614, 61924, 8781, 32354, 78091, 100, 175399, 184307, 8035, 49814, 47, 370, 8705, 6528, 15400, 28219, 123087, 4358 ]

[ 0.0236663818359375, 0.1827392578125, 0.08929443359375, 0.2093505859375, 0.13037109375, 0.2081298828125, 0.138671875, 0.251708984375, 0.0268096923828125, 0.017578125, 0.033172607421875, 0.0919189453125, 0.1468505859375, 0.026824951171875, 0.145263671875, 0.04437255859375, 0.0596008300...

embed

8052756_c0

8052756

lisp

0

Title: How to find the position of an atom in list Problem title: How to find the position of an atom in list Tags: lisp, common-lisp Problem: How to find the position of an atom in list I am trying to find the position of an atom in the list. (position-in-list 'a (a b c d e)) gives 0 (position-in-list 'b (a b c d e) )...

How to find the position of an atom in list How to find the position of an atom in list lisp common-lisp How How to find the position of an atom in list I am trying to find the position of an atom in the list. (position-in-list 'a (a b c d e)) gives 0 (position-in-list 'b (a b c d e) ) gives 1 (position-in-list 'Z(a b ...

[ -0.004974365234375, 0.01385498046875, 0.009033203125, 0.01141357421875, 0.0010833740234375, 0.0179443359375, 0.0238037109375, 0.000759124755859375, 0.0035247802734375, -0.017822265625, -0.004241943359375, -0.0167236328125, 0.01806640625, 0.019287109375, 0.003326416015625, 0.01165771484...

[ 11249, 47, 7413, 70, 19069, 111, 142, 34627, 23, 5303, 400, 7008, 39210, 4086, 254, 87, 31577, 40322, 73, 6562, 11, 876, 501, 104, 28, 76199, 757, 275, 106, 1511, 17324, 452, 18151, 4734, 30646, 615 ]

[ 0.072021484375, 0.058319091796875, 0.1339111328125, 0.0667724609375, 0.218017578125, 0.061767578125, 0.03662109375, 0.25146484375, 0.125, 0.2249755859375, 0.04901123046875, 0.129150390625, 0.0926513671875, 0.024383544921875, 0.079833984375, 0.00286865234375, 0.058197021484375, 0.17...

embed

67213946_c0

67213946

lisp

0

Title: How to set linux wallpaper using clx Problem title: How to set linux wallpaper using clx Tags: clx, common-lisp, lisp Problem: How to set linux wallpaper using clx I'm trying changing wallpaper using clx, but it do not work. What is wrong with my code? (ql:quickload :clx) (defpackage #:wm/uw (:use #:cl #:xlib)) ...

How to set linux wallpaper using clx How to set linux wallpaper using clx clx common-lisp lisp clx How ql:quickload How to set linux wallpaper using clx I'm trying changing wallpaper using clx, but it do not work. What is wrong with my code?

[ 0.015869140625, 0.01171875, 0.0067138671875, 0.01483154296875, -0.01239013671875, 0.00396728515625, 0.02197265625, -0.0123291015625, 0.0050048828125, 0.00006866455078125, 0.001678466796875, 0.0244140625, 0.01129150390625, 0.019287109375, -0.01611328125, -0.000019073486328125, 0.00015...

[ 11249, 47, 5423, 11508, 6077, 104195, 17368, 33139, 425, 39210, 4086, 254, 7008, 99247, 3181, 2594, 63033, 31577, 151134, 959, 4488, 44691, 18151 ]

[ 0.041290283203125, 0.07421875, 0.140625, 0.13134765625, 0.1343994140625, 0.244140625, 0.10784912109375, 0.14208984375, 0.2032470703125, 0.08544921875, 0.0194549560546875, 0.06280517578125, 0.07373046875, 0.1387939453125, 0.043426513671875, 0.03717041015625, 0.16796875, 0.0145111083...

embed

48363798_c0

48363798

lisp

0

Title: How are arguments passed into functions in Elisp? Problem title: How are arguments passed into functions in Elisp? Tags: elisp, lisp, parameter-passing Problem: How are arguments passed into functions in Elisp? Coming from a C++ background, I'm trying to figure out how arguments are passed into methods in Elisp....

How are arguments passed into functions in Elisp? How are arguments passed into functions in Elisp? elisp lisp parameter-passing How Elisp How are arguments passed into functions in Elisp? Coming from a C++ background, I'm trying to figure out how arguments are passed into methods in Elisp. While I acknowledge that may...

[ 0.0211181640625, 0.0224609375, -0.0133056640625, -0.01068115234375, 0.000514984130859375, 0.0155029296875, -0.007232666015625, 0.000701904296875, -0.01031494140625, 0.0128173828125, 0.004638671875, -0.007080078125, -0.01904296875, 0.0244140625, -0.01190185546875, -0.0126953125, 0.012...

[ 11249, 10750, 7, 115081, 3934, 32354, 23, 25318, 7008, 15296, 400, 171859, 13409, 621, 313, 37223, 76615, 26366, 3642, 150624, 2565, 12921, 20903, 6528, 452, 390, 91067, 34292, 37264, 55300, 68034, 11782 ]

[ 0.09814453125, 0.250244140625, 0.1126708984375, 0.1561279296875, 0.14990234375, 0.2021484375, 0.080810546875, 0.1505126953125, 0.247314453125, 0.1142578125, 0.1173095703125, 0.209228515625, 0.120849609375, 0.03143310546875, 0.0145111083984375, 0.18212890625, 0.041473388671875, 0.00...

embed

10450093_c0

10450093

lisp

0

Title: Creating a db in chicken scheme Problem title: Creating a db in chicken scheme Tags: chicken-scheme, scheme, lisp Problem: Creating a db in chicken scheme I would like to ask if it is possible to create a db in chicken scheme; something analogous to this: http://www.gigamonkeys.com/book/practical-a-simple-databa...

Creating a db in chicken scheme Creating a db in chicken scheme chicken-scheme scheme lisp Creating Creating a db in chicken scheme I would like to ask if it is possible to create a db in chicken scheme; something analogous to this: http://www.gigamonkeys.com/book/practical-a-simple-database.html If it is then what pre...

[ 0.0137939453125, 0.0142822265625, -0.0047607421875, 0.0167236328125, -0.00439453125, 0.0087890625, 0.00299072265625, -0.01324462890625, 0.01153564453125, -0.038818359375, 0.0040283203125, 0.0005950927734375, -0.005889892578125, -0.0201416015625, -0.0157470703125, -0.003509521484375, ...

[ 56781, 1916, 40041, 23, 143896, 150370, 10, 7560, 282, 400, 7008, 1884, 26458, 7722, 28282, 60223, 903, 3796, 19770, 14137, 14170, 70760, 191560, 10135, 37382, 1653, 2063, 12301, 86250, 100, 151117, 4527, 142, 56125, 34356, 33938, 14037, 6920...

[ 0.160400390625, 0.008392333984375, 0.2333984375, 0.09381103515625, 0.2469482421875, 0.247314453125, 0.0290069580078125, 0.176513671875, 0.1002197265625, 0.033660888671875, 0.1365966796875, 0.0218658447265625, 0.06854248046875, 0.1549072265625, 0.180908203125, 0.07513427734375, 0.0056...

embed

21865937_c0

21865937

lisp

0

Title: Prove LISP is not functional Problem title: Prove LISP is not functional Tags: procedural-programming, lisp, functional-programming Problem: Prove LISP is not functional I'm in a discussion with a colleague in which he argues LISP is functional and I argue it is not. While I concede that LISP programs can be wri...

Prove LISP is not functional Prove LISP is not functional procedural-programming lisp functional-programming Prove LISP Prove LISP is not functional I'm in a discussion with a colleague in which he argues LISP is functional and I argue it is not. While I concede that LISP programs can be written functionally, LISP is n...

[ 0.016357421875, 0.025390625, -0.0001773834228515625, 0.00726318359375, -0.016845703125, 0.01092529296875, -0.014404296875, -0.01318359375, -0.0106201171875, 0.007537841796875, -0.0118408203125, 0.013427734375, -0.01318359375, 0.0118408203125, 0.016357421875, 0.024658203125, 0.0003128...

[ 1250, 272, 16970, 9434, 83, 959, 123309, 59158, 28966, 400, 7008, 35107, 62975, 11, 6261, 187, 442, 93153, 103391, 831, 59121, 21286, 18822, 20625, 142508, 6982, 26808, 1679, 22691, 18151, 93, 58134, 7639 ]

[ 0.11328125, 0.04449462890625, 0.1492919921875, 0.2291259765625, 0.078369140625, 0.1392822265625, 0.189697265625, 0.1348876953125, 0.1177978515625, 0.1348876953125, 0.1842041015625, 0.052734375, 0.03497314453125, 0.020233154296875, 0.01318359375, 0.03955078125, 0.001861572265625, 0....

embed

58130107_c0

58130107

lisp

0

Title: Lisp Lambda function with IF clause Problem title: Lisp Lambda function with IF clause Tags: lambda, functional-programming, common-lisp, lisp Problem: Lisp Lambda function with IF clause I am trying to make a "Replace each occurence of x with y in list l" function with only mapcar and a lambda function. I guess...

Lisp Lambda function with IF clause Lisp Lambda function with IF clause lambda functional-programming common-lisp lisp Lisp Lambda Lisp Lambda function with IF clause I am trying to make a "Replace each occurence of x with y in list l" function with only mapcar and a lambda function. I guess that the lambda function wi...

[ -0.00921630859375, 0.01416015625, 0.00074005126953125, -0.004119873046875, -0.00311279296875, 0.005157470703125, 0.029296875, 0.0206298828125, -0.0028533935546875, 0.0211181640625, -0.0031280517578125, -0.01177978515625, -0.0203857421875, -0.004730224609375, 0.0146484375, 0.0205078125,...

[ 1261, 7008, 122930, 85, 32354, 678, 55449, 70731, 21, 6492, 123309, 28966, 39210, 4086, 254, 400, 13, 31577, 3249, 4332, 23935, 12638, 74918, 6620, 1022, 113, 23, 5303, 96, 4734, 22288, 3284, 12765, 2174, 42805, 105950, 425, 91995, 53, 22...

[ 0.1512451171875, 0.1971435546875, 0.199951171875, 0.1585693359375, 0.1925048828125, 0.1383056640625, 0.255615234375, 0.18408203125, 0.060791015625, 0.2115478515625, 0.1380615234375, 0.1036376953125, 0.06591796875, 0.1019287109375, 0.13720703125, 0.109130859375, 0.0197906494140625, ...

embed

32208568_c0

32208568

lisp

0

Title: What does '(list 1 2) means in Scheme? Problem title: What does '(list 1 2) means in Scheme? Tags: lisp, racket, scheme Problem: What does '(list 1 2) means in Scheme? I'm studying SICP and at the beginning of section 2.2.2 it gives the following code: (cons '(list 1 2) (list 3 4))) and says it constru...

What does '(list 1 2) means in Scheme? What does '(list 1 2) means in Scheme? lisp racket scheme What Scheme What does '(list 1 2) means in Scheme? I'm studying SICP and at the beginning of section 2.2.2 it gives the following code: (cons '(list 1 2) (list 3 4))) and says it constructs a list like ((1 2) 3 4)...

[ -0.00086212158203125, 0.026123046875, 0.001495361328125, 0.0166015625, -0.00323486328125, 0.017578125, -0.0029754638671875, 0.00156402587890625, 0.0030517578125, -0.021484375, -0.0027618408203125, -0.020751953125, 0.0019073486328125, -0.005401611328125, -0.021728515625, 0.0034027099609...

[ 4865, 14602, 54764, 3768, 6562, 106, 4958, 26950, 23, 34702, 282, 74, 400, 7008, 673, 27853, 150370, 242, 132, 198993, 70147, 18151, 25553, 138, 201, 64549, 5303, 1884, 41600, 13956, 10644, 3934, 1773, 12248, 2552, 27489, 33022, 54969, 1059...

[ 0.0584716796875, 0.076904296875, 0.0379638671875, 0.1416015625, 0.262939453125, 0.1207275390625, 0.2440185546875, 0.1571044921875, 0.086669921875, 0.2283935546875, 0.2059326171875, 0.04010009765625, 0.06915283203125, 0.1868896484375, 0.10888671875, 0.202392578125, 0.2261962890625, ...

embed

5045743_c0

5045743

lisp

0

Title: What method should I employ to extract keywords from a URL? Problem title: What method should I employ to extract keywords from a URL? Tags: c, lisp, python, seo Problem: What method should I employ to extract keywords from a URL? I am working on extraction of keywords. The system takes a URL as input and the ou...

What method should I employ to extract keywords from a URL? What method should I employ to extract keywords from a URL? c lisp python seo a What URL What method should I employ to extract keywords from a URL? I am working on extraction of keywords. The system takes a URL as input and the output is supposed to be keywor...

[ 0.0115966796875, 0.0098876953125, 0.00921630859375, 0.01177978515625, 0.005126953125, -0.005645751953125, -0.00125885009765625, 0.005889892578125, -0.0079345703125, -0.01904296875, -0.0240478515625, -0.03271484375, -0.0277099609375, 0.0113525390625, -0.0087890625, -0.002349853515625, ...

[ 4865, 55300, 5608, 87, 187016, 47, 125663, 166117, 7, 1295, 31862, 501, 400, 7008, 17198, 50828, 3750, 10, 20697, 4173, 10763, 111, 5426, 51776, 237, 107730, 140992, 134598, 28852, 10941, 179635, 4734, 90426, 289, 63920, 5036, 1884, 3714, 2...

[ 0.06207275390625, 0.1844482421875, 0.098876953125, 0.039794921875, 0.141845703125, 0.04486083984375, 0.223388671875, 0.26025390625, 0.127685546875, 0.1400146484375, 0.2418212890625, 0.03179931640625, 0.09906005859375, 0.1881103515625, 0.068603515625, 0.167236328125, 0.1619873046875, ...

embed

10467111_c2

10467111

lisp

2

UX VT ACCS PRODS (rest P) newP)))) (defun BuildRules (VT ACCS PRODS P) (BuildRules-AUX VT ACCS PRODS P nil)) (trace BuildRules-AUX) (trace BuildRules) (BuildRules *VT* (ACCESS *P* 'S) (PROD *VT* *P*)*P*) (defun SIMPL-AUX (VN VT P S ACCS PRODS) (setq ACCS (ACCESS P S)) (setq PRODS (PROD VT P)) (if Code signals: Lisp, De...

[ -0.006683349609375, 0.0130615234375, 0.01409912109375, 0.040771484375, -0.006500244140625, 0.01495361328125, -0.01458740234375, 0.004241943359375, 0.018310546875, 0.009521484375, 0.0201416015625, 0.0016937255859375, 0.005035400390625, -0.0186767578125, 0.0037078857421875, 0.01708984375...

[ 71609, 86920, 12944, 19283, 10514, 13526, 56644, 436, 3525, 683, 80126, 112, 16498, 121137, 26951, 1577, 17324, 39989, 194695, 47970, 40288, 21130, 40711, 159, 3509, 15012, 864, 397, 3190, 28864, 26073, 1261, 7008, 88606, 449, 67227, 156906, ...

[ 0.287841796875, 0.275634765625, 0.150634765625, 0.2122802734375, 0.2222900390625, 0.1876220703125, 0.1806640625, 0.1328125, 0.1512451171875, 0.17431640625, 0.145263671875, 0.09814453125, 0.1446533203125, 0.1639404296875, 0.2213134765625, 0.178955078125, 0.1788330078125, 0.098876953...

embed

24924187_c0

24924187

lisp

0

Title: List object methods in Common Lisp (CLOS) Problem title: List object methods in Common Lisp (CLOS) Tags: lisp, common-lisp, oop, clos Problem: List object methods in Common Lisp (CLOS) Is there any way to get all methods defined for object and check if object responds to specified method? Looking for something l...

List object methods in Common Lisp (CLOS) List object methods in Common Lisp (CLOS) lisp common-lisp oop clos List Common Lisp CLOS method0 method1 List object methods in Common Lisp (CLOS) Is there any way to get all methods defined for object and check if object responds to specified method? Looking for something lik...

[ 0.00836181640625, 0.016845703125, 0.007232666015625, 0.0135498046875, -0.00885009765625, -0.00154876708984375, -0.00421142578125, 0.0146484375, 0.007415771484375, -0.032470703125, -0.0191650390625, -0.0218505859375, 0.004241943359375, -0.01092529296875, -0.00872802734375, -0.0277099609...

[ 32036, 36746, 150624, 23, 151301, 1261, 7008, 92933, 400, 39210, 4086, 254, 32500, 20450, 55300, 2389, 418, 441, 2499, 3917, 47, 2046, 756, 61924, 100, 136, 12765, 2174, 35644, 58735, 157268, 1884, 158189, 25, 3584, 31, 1928, 7352, 21922, ...

[ 0.18798828125, 0.2135009765625, 0.254150390625, 0.045166015625, 0.1485595703125, 0.1346435546875, 0.177978515625, 0.1846923828125, 0.07745361328125, 0.09344482421875, 0.065673828125, 0.1043701171875, 0.10455322265625, 0.128662109375, 0.2354736328125, 0.036865234375, 0.034576416015625...

embed

29196684_c0

29196684

lisp

0

Title: Invalid relative pathname error when compiling defsystem in slime with asdf3 Problem title: Invalid relative pathname error when compiling defsystem in slime with asdf3 Tags: lisp, slime, common-lisp, asdf Problem: Invalid relative pathname error when compiling defsystem in slime with asdf3 My SBCL is with ASDF3...

Invalid relative pathname error when compiling defsystem in slime with asdf3 Invalid relative pathname error when compiling defsystem in slime with asdf3 lisp slime common-lisp asdf Invalid asdf3 Invalid relative pathname error when compiling defsystem in slime with asdf3 My SBCL is with ASDF3. When I tried to compile ...

[ 0.00167083740234375, -0.004913330078125, 0.0152587890625, 0.01806640625, -0.020263671875, 0.00124359130859375, 0.00112152099609375, 0.00103759765625, -0.0126953125, 0.00408935546875, -0.0174560546875, -0.004791259765625, 0.005828857421875, 0.004669189453125, -0.0081787109375, 0.0049133...

[ 7013, 35845, 60875, 11627, 18499, 9969, 49725, 8, 420, 16751, 34264, 13, 237, 71, 363, 678, 400, 7008, 39210, 4086, 254, 90944, 37486, 6483, 38997, 37842, 1340, 125195, 1884, 903, 93002, 15400, 8834 ]

[ 0.151123046875, 0.200439453125, 0.1448974609375, 0.1883544921875, 0.1708984375, 0.09686279296875, 0.08050537109375, 0.12255859375, 0.1448974609375, 0.2113037109375, 0.154296875, 0.158935546875, 0.02911376953125, 0.03265380859375, 0.16064453125, 0.035736083984375, 0.038818359375, 0....

embed

3672256_c0

3672256

lisp

0

Title: Let: creating a temporary variable in Common Lisp Problem title: Let: creating a temporary variable in Common Lisp Tags: lisp, common-lisp Problem: Let: creating a temporary variable in Common Lisp Given a function: (defun foo (bar) (let ((baz bar)) (setf baz (+ baz 1))) I have been given to understand (perhaps ...

Let: creating a temporary variable in Common Lisp Let: creating a temporary variable in Common Lisp lisp common-lisp Common Lisp Let: creating a temporary variable in Common Lisp Given a function: I have been given to understand (perhaps incorrectly?) that baz becomes some sort of reference to bar, instead of being a t...

[ 0.016357421875, 0.0185546875, -0.0159912109375, 0.011962890625, 0.007568359375, -0.002410888671875, -0.0233154296875, 0.01092529296875, 0.0029449462890625, -0.0145263671875, 0.0111083984375, 0.03515625, 0.00860595703125, 0.027587890625, 0.0234375, -0.005584716796875, 0.00677490234375...

[ 10842, 105233, 142458, 53, 77336, 151301, 1261, 7008, 23, 400, 39210, 4086, 254, 77878, 32354, 34475, 28219, 29860, 214552, 16627, 24209, 91067, 1909, 64457, 29568, 43658, 2806, 1884, 54, 28282, 63284, 842, 2594, 1672, 115081, 756, 3444, 9342...

[ 0.1810302734375, 0.1884765625, 0.2120361328125, 0.0985107421875, 0.2763671875, 0.153564453125, 0.154296875, 0.181396484375, 0.03460693359375, 0.106201171875, 0.09747314453125, 0.09033203125, 0.1209716796875, 0.0233917236328125, 0.146728515625, 0.03118896484375, 0.0791015625, 0.0177...

embed

41639997_c0

41639997

lisp

0

Title: lisp function that doesn't evaluate his arguments Problem title: lisp function that doesn't evaluate his arguments Tags: lisp, operator-precedence Problem: lisp function that doesn't evaluate his arguments For my homework, I have a small List interpreter written in C with few functions already coded : ...

lisp function that doesn't evaluate his arguments lisp function that doesn't evaluate his arguments lisp operator-precedence lisp function that doesn't evaluate his arguments For my homework, I have a small List interpreter written in C with few functions already coded : set , cons , car , cdr and quote . And...

[ 0.0167236328125, 0.0228271484375, -0.004241943359375, 0.005950927734375, -0.003082275390625, 0.00102996826171875, 0.0152587890625, 0.0002346038818359375, 0.00122833251953125, -0.00982666015625, -0.00106048583984375, -0.022216796875, -0.00665283203125, -0.003509521484375, -0.0011062622070...

[ 400, 7008, 32354, 450, 22027, 3768, 18, 151575, 13, 1919, 10750, 39933, 4692, 37534, 6620, 5368, 18244, 32036, 29481, 56, 59121, 313, 10846, 21771, 18151, 5423, 158, 2258, 42, 66747, 15190, 305, 15700, 44126, 138, 219836, 15490, 55076, 864,...

[ 0.139404296875, 0.2127685546875, 0.2037353515625, 0.0142364501953125, 0.059478759765625, 0.024566650390625, 0.10791015625, 0.152099609375, 0.0166473388671875, 0.06756591796875, 0.1883544921875, 0.179443359375, 0.0318603515625, 0.1116943359375, 0.0204925537109375, 0.0029296875, 0.0778...

embed