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
13255731_c0	13255731	lisp	0	Title: tail-recursive function appending element to list Problem title: tail-recursive function appending element to list Tags: racket, scheme, tailrecursion-modulo-cons, tail-call-optimization, lisp Problem: tail-recursive function appending element to list i've seen several examples of implementing append an element ...	tail-recursive function appending element to list tail-recursive function appending element to list racket scheme tailrecursion-modulo-cons tail-call-optimization lisp tail-recursive function appending element to list i've seen several examples of implementing append an element to a list, but all are not using tail rec...	[ -0.0022430419921875, 0.0302734375, 0.008056640625, -0.00994873046875, 0.01531982421875, 0.007293701171875, -0.00872802734375, 0.0057373046875, -0.00038909912109375, -0.0289306640625, 0.007049560546875, -0.045654296875, -0.010986328125, 0.0106201171875, 0.017822265625, 0.012939453125, ...	[ 46741, 107, 48650, 5844, 32354, 1747, 96819, 12830, 47, 5303, 673, 27853, 150370, 1830, 83279, 31, 25553, 85763, 100433, 400, 7008, 51592, 27781, 29479, 114689, 71, 959, 17368, 195625, 6044, 123309, 20623 ]	[ 0.276123046875, 0.06842041015625, 0.1988525390625, 0.151123046875, 0.187744140625, 0.10955810546875, 0.1468505859375, 0.19384765625, 0.131591796875, 0.2109375, 0.019378662109375, 0.142822265625, 0.1314697265625, 0.09661865234375, 0.119873046875, 0.022796630859375, 0.05657958984375, ...	embed
11051415_c0	11051415	lisp	0	Title: Lisp - Convert symbol to string only if not already a string Problem title: Lisp - Convert symbol to string only if not already a string Tags: lisp, recursion, string, symbols Problem: Lisp - Convert symbol to string only if not already a string Is there a way to convert symbol to string only if it is not alread...	Lisp - Convert symbol to string only if not already a string Lisp - Convert symbol to string only if not already a string lisp recursion string symbols Lisp Convert Lisp - Convert symbol to string only if not already a string Is there a way to convert symbol to string only if it is not already a string in lisp? It shou...	[ -0.0213623046875, 0.006622314453125, -0.00225830078125, 0.0228271484375, -0.01806640625, 0.0208740234375, 0.000591278076171875, 0.00970458984375, -0.0107421875, 0.00823974609375, -0.005096435546875, -0.0240478515625, -0.00665283203125, 0.0390625, 0.0002918243408203125, 0.015869140625, ...	[ 1261, 7008, 1657, 11549, 26582, 47, 79315, 4734, 2174, 959, 21771, 400, 195625, 10, 3917, 96760, 23, 5608, 4488, 1884, 191, 538, 3190, 2271, 814, 186944 ]	[ 0.1705322265625, 0.2401123046875, 0.040069580078125, 0.1400146484375, 0.271240234375, 0.129638671875, 0.25830078125, 0.119140625, 0.09063720703125, 0.169921875, 0.162353515625, 0.154052734375, 0.1395263671875, 0.01580810546875, 0.09722900390625, 0.2080078125, 0.03765869140625, 0.01...	embed
28621739_c0	28621739	lisp	0	Title: What's the R equivalent of progn in lisp? Problem title: What's the R equivalent of progn in lisp? Tags: lisp, r Problem: What's the R equivalent of progn in lisp? In lisp there is syntax to execute several expressions in sequence within function arguments. Given R's lispy origins, I'm wondering is the...	What's the R equivalent of progn in lisp? What's the R equivalent of progn in lisp? lisp r What What's the R equivalent of progn in lisp? In lisp there is syntax to execute several expressions in sequence within function arguments. Given R's lispy origins, I'm wondering is there an equivalent feature in R? I'...	[ -0.004608154296875, 0.004547119140625, -0.01416015625, 0.0021514892578125, -0.01116943359375, 0.00457763671875, 0.00634765625, 0.00872802734375, 0.013427734375, -0.0096435546875, -0.017822265625, 0.02001953125, -0.0162353515625, -0.0230712890625, -0.02490234375, 0.005035400390625, -0...	[ 3768, 627, 183234, 67973, 19, 23, 400, 7008, 1690, 4865, 70, 6002, 86531, 71924, 40368, 125195, 40, 944, 28032, 32354, 10750, 7, 6493, 59665, 149016, 60213, 86898, 32562 ]	[ 0.02569580078125, 0.163818359375, 0.190673828125, 0.211181640625, 0.1925048828125, 0.0523681640625, 0.1142578125, 0.1824951171875, 0.146240234375, 0.004863739013671875, 0.00780487060546875, 0.039398193359375, 0.1534423828125, 0.1373291015625, 0.09210205078125, 0.190185546875, 0.00643...	embed
18105106_c0	18105106	lisp	0	Title: Turning list of atoms into a single list using recursion Problem title: Turning list of atoms into a single list using recursion Tags: recursion, lisp, list, scheme Problem: Turning list of atoms into a single list using recursion I'm looking for an answer that turns a list of atoms into a single list recursivel...	Turning list of atoms into a single list using recursion Turning list of atoms into a single list using recursion recursion lisp list scheme recursion Turning Turning list of atoms into a single list using recursion I'm looking for an answer that turns a list of atoms into a single list recursively. An example would be...	[ -0.005218505859375, 0.021728515625, 0.005767822265625, 0.026611328125, -0.00927734375, 0.0032806396484375, -0.00830078125, -0.0037689208984375, 0.007110595703125, -0.032958984375, 0.00408935546875, -0.00008249282836914062, 0.004852294921875, 0.002288818359375, -0.001953125, 0.014343261...	[ 4252, 592, 5303, 111, 34627, 7, 3934, 10, 11001, 17368, 195625, 1830, 400, 7008, 150370, 16487, 100, 35166, 450, 15504, 5844, 27781, 2806, 6562, 11, 275, 501, 71, 420, 706, 1096, 1238, 98893 ]	[ 0.1326904296875, 0.054351806640625, 0.26220703125, 0.0660400390625, 0.25341796875, 0.10369873046875, 0.1893310546875, 0.0511474609375, 0.1912841796875, 0.07635498046875, 0.258544921875, 0.1370849609375, 0.08160400390625, 0.1529541015625, 0.1673583984375, 0.0584716796875, 0.0103149414...	embed
42070694_c0	42070694	lisp	0	Title: What is the difference between :foo, ::foo, ::bar/foo, and :bar/foo in Clojure? Problem title: What is the difference between :foo, ::foo, ::bar/foo, and :bar/foo in Clojure? Tags: clojure, clojurescript, lisp, functional-programming Problem: What is the difference between :foo, ::foo, ::bar/foo, and :bar/foo in...	What is the difference between :foo, ::foo, ::bar/foo, and :bar/foo in Clojure? What is the difference between :foo, ::foo, ::bar/foo, and :bar/foo in Clojure? clojure clojurescript lisp functional-programming What Clojure What is the difference between :foo, ::foo, ::bar/foo, and :bar/foo in Clojure? I came across tho...	[ 0.0296630859375, -0.010009765625, -0.004669189453125, 0.01123046875, -0.0081787109375, -0.0000705718994140625, 0.0036163330078125, 0.0152587890625, -0.0108642578125, 0.03515625, 0.0030059814453125, -0.0166015625, 0.0150146484375, 0.024169921875, -0.0084228515625, -0.018798828125, -0....	[ 60212, 17721, 3584, 31, 1984, 1299, 64, 51053, 461, 107, 20450, 32032, 7008, 123309, 28966, 70, 152, 166117, 73342, 7 ]	[ 0.1766357421875, 0.0855712890625, 0.1944580078125, 0.1859130859375, 0.0517578125, 0.130126953125, 0.06475830078125, 0.1026611328125, 0.1395263671875, 0.1083984375, 0.0479736328125, 0.0533447265625, 0.03271484375, 0.04498291015625, 0.01605224609375, 0.0213470458984375, 0.0082702636718...	embed
53192980_c0	53192980	lisp	0	Title: How to use the mod function on LISPS using control structures Problem title: How to use the mod function on LISPS using control structures Tags: lisp, modulo, if-statement Problem: How to use the mod function on LISPS using control structures I am new to LISP, is there a way of using mod with control structures,...	How to use the mod function on LISPS using control structures How to use the mod function on LISPS using control structures lisp modulo if-statement control How LISPS How to use the mod function on LISPS using control structures I am new to LISP, is there a way of using mod with control structures, if statements. for i...	[ -0.01226806640625, 0.01318359375, -0.00848388671875, 0.01055908203125, 0.002288818359375, 0.014404296875, 0.027587890625, 0.0042724609375, -0.010009765625, -0.0224609375, 0.003753662109375, -0.0194091796875, 0.0106201171875, -0.00848388671875, 0.0245361328125, 0.00347900390625, -0.01...	[ 11249, 47, 4527, 2811, 32354, 98, 67616, 9059, 17368, 6226, 45646, 400, 7008, 140807, 2174, 61340, 674, 3525, 16970, 9434, 3917, 678, 63805, 19441, 3190, 13415, 201, 4958, 22183, 116, 9, 483, 125195, 30646, 757, 17324, 384 ]	[ 0.05462646484375, 0.0135955810546875, 0.1312255859375, 0.2196044921875, 0.1610107421875, 0.04302978515625, 0.1336669921875, 0.2103271484375, 0.0970458984375, 0.1781005859375, 0.1400146484375, 0.09552001953125, 0.1689453125, 0.20947265625, 0.1678466796875, 0.1358642578125, 0.009353637...	embed
31815835_c0	31815835	lisp	0	Title: how to check if the list is palindrome in lisp? Problem title: how to check if the list is palindrome in lisp? Tags: common-lisp, palindrome, lisp Problem: how to check if the list is palindrome in lisp? I want to test this list whether it's palindrome or not by comparing first element with last element , second...	how to check if the list is palindrome in lisp? how to check if the list is palindrome in lisp? common-lisp palindrome lisp how to check if the list is palindrome in lisp? I want to test this list whether it's palindrome or not by comparing first element with last element , second element with before the last element a...	[ -0.00927734375, -0.0036773681640625, 0.00067138671875, 0.01239013671875, -0.0152587890625, 0.015625, 0.0194091796875, 0.0020751953125, -0.0086669921875, -0.0037841796875, 0.0208740234375, 0.0030670166015625, 0.00640869140625, -0.0186767578125, -0.005584716796875, -0.0111083984375, -0...	[ 3642, 47, 12765, 2174, 5303, 83, 17923, 19, 102851, 23, 400, 7008, 39210, 4086, 254, 3034, 442, 37397, 12830, 4568, 8108 ]	[ 0.049591064453125, 0.043212890625, 0.1717529296875, 0.04937744140625, 0.1761474609375, 0.049713134765625, 0.149169921875, 0.059326171875, 0.209716796875, 0.045166015625, 0.091796875, 0.194580078125, 0.07049560546875, 0.08160400390625, 0.133056640625, 0.145751953125, 0.007793426513671...	embed
5415126_c0	5415126	lisp	0	Title: Newbie question: find CURL like functionality in Lisp Problem title: Newbie question: find CURL like functionality in Lisp Tags: lisp, package Problem: Newbie question: find CURL like functionality in Lisp I am a newbie in lisp trying to write a program to download a page content from the internet. I'm pretty su...	Newbie question: find CURL like functionality in Lisp Newbie question: find CURL like functionality in Lisp lisp package Newbie CURL Lisp Newbie question: find CURL like functionality in Lisp I am a newbie in lisp trying to write a program to download a page content from the internet. I'm pretty sure that there should ...	[ -0.003570556640625, 0.01422119140625, 0.0185546875, 0.02783203125, 0.00830078125, 0.012451171875, -0.0078125, 0.00009298324584960938, -0.01220703125, -0.0120849609375, 0.0216064453125, -0.0255126953125, 0.0012969970703125, 0.00396728515625, 0.006256103515625, -0.004913330078125, -0.0...	[ 2356, 9014, 9655, 7413, 313, 95538, 1884, 123309, 2481, 23, 1261, 7008, 400, 98169, 3525, 31577, 33022, 1528, 47, 7026, 9191, 10941, 1820, 9077, 5608, 6044, 4865, 14947, 2965, 60042 ]	[ 0.09381103515625, 0.1534423828125, 0.10302734375, 0.138916015625, 0.0963134765625, 0.29736328125, 0.1954345703125, 0.20556640625, 0.11895751953125, 0.06268310546875, 0.1778564453125, 0.251220703125, 0.1380615234375, 0.2183837890625, 0.064208984375, 0.0221405029296875, 0.0764770507812...	embed
2627038_c0	2627038	lisp	0	Title: Lisp-style quotation in HTML Problem title: Lisp-style quotation in HTML Tags: lisp, html Problem: Lisp-style quotation in HTML In Lisp, evaluating '(+ 1 2) produces '(+ 1 2), not 3. It seems that HTML doesn't support Lisp-style quotation so you can't say something like <quote><b>not bold</b></quote> in HTML and...	Lisp-style quotation in HTML Lisp-style quotation in HTML lisp html Lisp-style HTML Lisp-style quotation in HTML In Lisp, evaluating '(+ 1 2) produces '(+ 1 2), not 3. It seems that HTML doesn't support Lisp-style quotation so you can't say something like <quote><b>not bold</b></quote> in HTML and let it just produce <...	[ 0.0166015625, 0.038330078125, -0.000835418701171875, 0.007598876953125, -0.024169921875, -0.0078125, -0.01220703125, -0.00787353515625, 0.00185394287109375, -0.02392578125, -0.00775146484375, -0.0091552734375, -0.0086669921875, -0.0126953125, -0.00250244140625, 0.002288818359375, -0....	[ 1261, 7008, 40946, 81732, 1363, 19097, 400, 7693, 151575, 1328, 106, 4958, 27489, 959, 1031, 37202, 22027, 18, 8060, 831, 5154, 9844, 68726, 10869, 65665, 2633, 64457, 121392, 31635, 186768 ]	[ 0.1693115234375, 0.25634765625, 0.20361328125, 0.2105712890625, 0.0809326171875, 0.2548828125, 0.1219482421875, 0.1851806640625, 0.174560546875, 0.1717529296875, 0.08087158203125, 0.1676025390625, 0.17626953125, 0.12353515625, 0.1546630859375, 0.020416259765625, 0.061279296875, 0.0...	embed
68694156_c0	68694156	lisp	0	Title: Create consecutive sublists of given length from a list in LISP Problem title: Create consecutive sublists of given length from a list in LISP Tags: common-lisp, list, lisp, sublist Problem: Create consecutive sublists of given length from a list in LISP I have a list (1 2 3 4 5 6) and I would like to create all...	Create consecutive sublists of given length from a list in LISP Create consecutive sublists of given length from a list in LISP common-lisp list lisp sublist a Create LISP Create consecutive sublists of given length from a list in LISP I have a list (1 2 3 4 5 6) and I would like to create all possible lists of 4 atoms...	[ 0.007110595703125, 0.03173828125, 0.00811767578125, 0.021240234375, -0.01422119140625, 0.0185546875, -0.01263427734375, 0.01275634765625, 0.01708984375, -0.0177001953125, -0.00014495849609375, 0.01336669921875, 0.005401611328125, 0.0052490234375, -0.01287841796875, 0.019775390625, 0....	[ 151313, 148390, 13, 1614, 6562, 7, 34475, 140909, 1295, 5303, 16970, 9434, 111, 23, 39210, 4086, 254, 400, 7008, 765, 116, 138, 201, 190, 35914, 2806, 1884, 28282, 756, 7722, 34627, 27781, 16750, 13956, 21162, 86827, 2071, 903, 1261 ]	[ 0.122802734375, 0.2091064453125, 0.0838623046875, 0.215087890625, 0.269775390625, 0.0999755859375, 0.1082763671875, 0.1585693359375, 0.08123779296875, 0.2139892578125, 0.1390380859375, 0.2293701171875, 0.02972412109375, 0.03802490234375, 0.099853515625, 0.11181640625, 0.1593017578125...	embed
36895749_c0	36895749	lisp	0	Title: Reverse list in CLISP Problem title: Reverse list in CLISP Tags: lisp, functional-programming, common-lisp Problem: Reverse list in CLISP I'm trying to write my own function to reverse list in LISP. The problem is input (revert '(2 3 (4 5 (6)))) My code looks like this: (defun revert (l) (if (null l) nil (append...	Reverse list in CLISP Reverse list in CLISP lisp functional-programming common-lisp Reverse CLISP Reverse list in CLISP I'm trying to write my own function to reverse list in LISP. The problem is input My code looks like this: It returns instead of this: How can I fix it to work correctly?	[ -0.01171875, 0.02197265625, 0.007415771484375, 0.017822265625, -0.01129150390625, 0.01104736328125, -0.002838134765625, -0.00018310546875, 0.003326416015625, -0.01519775390625, 0.0025177001953125, 0.0211181640625, -0.007171630859375, 0.00390625, -0.0022430419921875, 0.01031494140625, ...	[ 853, 37676, 5303, 23, 313, 67616, 683, 400, 7008, 123309, 28966, 39210, 4086, 254, 31577, 33022, 10002, 32354, 39531, 184, 16970, 9434, 2967, 107730, 18151, 33342, 1884, 30646, 64457, 903, 30022, 4488, 26785 ]	[ 0.11004638671875, 0.2685546875, 0.244140625, 0.07562255859375, 0.048919677734375, 0.1490478515625, 0.19091796875, 0.072021484375, 0.1661376953125, 0.11962890625, 0.087158203125, 0.040863037109375, 0.0782470703125, 0.1402587890625, 0.039398193359375, 0.0877685546875, 0.0799560546875, ...	embed
39339353_c1	39339353	lisp	1	+ x) } subList match { case Nil => acc case List(x) :: xs => r(xs, r(List(x), List()) +: acc) case x :: xs => swap(x,xs) //case List(x) :: xs => } } r(lst, List()) } Instinctively, I think this is because I have no swap on the section "case List(x) :: xs" but I'm still struggling to fix it. More difficult, still, this ...	+ x) } subList match { case Nil => acc case List(x) :: xs => r(xs, r(List(x), List()) +: acc) case x :: xs => swap(x,xs) //case List(x) :: xs => } } r(lst, List()) } Instinctively, I think this is because I have no swap on the section "case List(x) :: xs" but I'm still struggling to fix it. More difficult, still, this ...	[ -0.01263427734375, 0.0242919921875, 0.013427734375, -0.01806640625, -0.01202392578125, 0.01324462890625, -0.01904296875, -0.0010986328125, 0.02392578125, 0.01611328125, 0.02978515625, -0.002532958984375, 0.0234375, 0.007659912109375, 0.004364013671875, 0.0015106201171875, 0.009460449...	[ 997, 1022, 51912, 1614, 154663, 14858, 7225, 77175, 44357, 50015, 32036, 425, 1984, 7, 1690, 202317, 58437, 271, 12729, 5351, 903, 765, 110, 40059, 7464, 237875, 30022, 34844, 36356, 46741, 9, 85763, 87235, 1363, 54, 4537, 29806, 28864, 260...	[ 0.1640625, 0.1331787109375, 0.009185791015625, 0.214111328125, 0.248779296875, 0.2269287109375, 0.1719970703125, 0.2467041015625, 0.02032470703125, 0.1412353515625, 0.2076416015625, 0.1240234375, 0.123779296875, 0.09735107421875, 0.059967041015625, 0.2548828125, 0.1708984375, 0.066...	embed
1778464_c0	1778464	lisp	0	Title: Common Lisp: Attach x recursively to list Problem title: Common Lisp: Attach x recursively to list Tags: list, lisp, common-lisp Problem: Common Lisp: Attach x recursively to list I'm trying to add, say, x to every element of a list. For example: (queue 3 '(1 2 3)) would give ((3 1) (3 2) (3 3)) The code below a...	Common Lisp: Attach x recursively to list Common Lisp: Attach x recursively to list list lisp common-lisp Common Lisp Attach Common Lisp: Attach x recursively to list I'm trying to add, say, x to every element of a list. For example: would give The code below apparently does not do what I want. Any hints please?	[ 0.0018157958984375, 0.0208740234375, 0.004425048828125, 0.0078125, -0.002471923828125, 0.00457763671875, 0.006591796875, 0.00714111328125, -0.005126953125, -0.0196533203125, 0.014404296875, -0.02294921875, 0.0069580078125, -0.00604248046875, -0.00168609619140625, -0.00457763671875, -...	[ 151301, 1261, 7008, 9208, 934, 1022, 195625, 5844, 538, 47, 5303, 400, 39210, 4086, 254, 31577, 15190, 11907, 12830, 2806, 8337, 18151, 35064, 198371, 959, 54, 3444, 5122, 22936 ]	[ 0.1513671875, 0.138916015625, 0.15625, 0.1336669921875, 0.180908203125, 0.15185546875, 0.1806640625, 0.12353515625, 0.007488250732421875, 0.10321044921875, 0.186767578125, 0.08538818359375, 0.106689453125, 0.07232666015625, 0.095947265625, 0.10125732421875, 0.13037109375, 0.1021118...	embed
55153604_c0	55153604	lisp	0	Title: Lisp interactive emacs multiplying incorrectly Problem title: Lisp interactive emacs multiplying incorrectly Tags: bignum, elisp, numbers, lisp, emacs Problem: Lisp interactive emacs multiplying incorrectly I'm running the following code on Emacs Lisp Interaction: (defun square (x) (* x x)) (square (square (squa...	Lisp interactive emacs multiplying incorrectly Lisp interactive emacs multiplying incorrectly bignum elisp numbers lisp emacs Lisp Lisp interactive emacs multiplying incorrectly I'm running the following code on Emacs Lisp Interaction: which is giving me 1114476179152563777 . However, the ((1001^2)^2)^2 is actually 100...	[ -0.02197265625, 0.00970458984375, 0.0166015625, -0.01214599609375, 0.0014190673828125, 0.0252685546875, -0.027587890625, 0.001678466796875, -0.0235595703125, -0.00933837890625, 0.000827789306640625, 0.01123046875, -0.01434326171875, 0.003265380859375, -0.004364013671875, -0.00759887695...	[ 1261, 7008, 212398, 352, 2263, 7, 6024, 62479, 214, 214552, 6957, 2606, 15296, 101935, 400, 538, 51042, 25632, 18151, 85269, 4439, 5337, 44713, 68772, 534, 2592, 162518, 156918, 1837, 2588, 15748, 102294, 33306, 70, 90980, 6746, 8353, 10461, ...	[ 0.14697265625, 0.220458984375, 0.1978759765625, 0.09564208984375, 0.1470947265625, 0.039886474609375, 0.10150146484375, 0.173095703125, 0.036163330078125, 0.195068359375, 0.07476806640625, 0.1842041015625, 0.07464599609375, 0.1285400390625, 0.11578369140625, 0.00279998779296875, 0.11...	embed
64481694_c0	64481694	lisp	0	Title: Reading numbers to array from string Problem title: Reading numbers to array from string Tags: common-lisp, lisp Problem: Reading numbers to array from string i create static array, suggest would good for finding numbers in string for array size (setf arr (make-array'(5))) (loop for i from 0 to 4 do (if (/= nil ...	Reading numbers to array from string Reading numbers to array from string common-lisp lisp string 0 Reading Reading numbers to array from string	[ -0.005584716796875, -0.00185394287109375, 0.006591796875, 0.0135498046875, -0.006439208984375, 0.017578125, 0.0159912109375, 0.01495361328125, 0.007476806640625, -0.0283203125, -0.00194549560546875, -0.028564453125, -0.0167236328125, -0.0038299560546875, 0.00872802734375, -0.0311279296...	[ 104951, 101935, 47, 10298, 53, 1295, 79315, 39210, 4086, 254, 400, 7008, 757 ]	[ 0.220947265625, 0.1915283203125, 0.080322265625, 0.1700439453125, 0.1451416015625, 0.1318359375, 0.2354736328125, 0.1207275390625, 0.0777587890625, 0.13330078125, 0.0938720703125, 0.159912109375, 0.11956787109375 ]	embed
24094191_c3	24094191	lisp	3	ROUND, LAMBDA, ASDF::PERFORM-PLAN, SB-C, WITH-COMPILATION-UNIT, SB-C::WITH-IT, LIST, ASDF:OPERATE, ASDF::CALL-WITH-SYSTEM-DEFINITIONS, CLOSURE, QUICKLISP-CLIENT::CALL-WITH-MACROEXPAND-PROGRESS, QUICKLISP-CLIENT::APPLY-LOAD-STRATEGY, QUICKLISP-CLIENT::AUTOLOAD-SYSTEM-AND-DEPENDENCIES, PROMPT, QL-IMPL-UTIL, CALL-WITH-QUI...	ROUND, LAMBDA, ASDF::PERFORM-PLAN, SB-C, WITH-COMPILATION-UNIT, SB-C::WITH-IT, LIST, ASDF:OPERATE, ASDF::CALL-WITH-SYSTEM-DEFINITIONS, CLOSURE, QUICKLISP-CLIENT::CALL-WITH-MACROEXPAND-PROGRESS, QUICKLISP-CLIENT::APPLY-LOAD-STRATEGY, QUICKLISP-CLIENT::AUTOLOAD-SYSTEM-AND-DEPENDENCIES, PROMPT, QL-IMPL-UTIL, CALL-WITH-QUI...	[ -0.000789642333984375, 0.0002803802490234375, -0.010498046875, 0.006500244140625, -0.005096435546875, -0.0081787109375, 0.01446533203125, 0.00098419189453125, 0.0242919921875, 0.00384521484375, -0.0146484375, 0.013671875, -0.006744384765625, -0.017578125, 0.00153350830078125, 0.0113525...	[ 19452, 34384, 4, 3358, 12689, 6538, 6483, 38997, 12, 30425, 98533, 184772, 90944, 9, 441, 55766, 23415, 16113, 146097, 84780, 65761, 618, 38969, 6371, 195977, 670, 35746, 66437, 62428, 90420, 202001, 25019, 92933, 142363, 167634, 9434, 10927, ...	[ 0.2098388671875, 0.259765625, 0.08551025390625, 0.087158203125, 0.2086181640625, 0.2308349609375, 0.166259765625, 0.31103515625, 0.0640869140625, 0.1136474609375, 0.279052734375, 0.24365234375, 0.1514892578125, 0.06756591796875, 0.12548828125, 0.048370361328125, 0.1180419921875, 0....	embed
68339753_c1	68339753	lisp	1	(cond ((whitespace-or-nil-p c) (return-from read-word (get-output-stream-string out))) ((not (digit-char-p c)) (go skip-til-next)) (t (go read-number)) ) read-simple-or-contracted-word (write-char c out) (setf c (read-char stream nil)) (cond ((whitespace-or-nil-p c) (return-from read-word (get-output-stream-string out...	(cond ((whitespace-or-nil-p c) (return-from read-word (get-output-stream-string out))) ((not (digit-char-p c)) (go skip-til-next)) (t (go read-number)) ) read-simple-or-contracted-word (write-char c out) (setf c (read-char stream nil)) (cond ((whitespace-or-nil-p c) (return-from read-word (get-output-stream-string out...	[ 0.01190185546875, -0.0146484375, 0.0184326171875, 0.00921630859375, -0.0111083984375, 0.01318359375, 0.01953125, 0.006805419921875, 0.00005340576171875, 0.0272216796875, 0.0101318359375, -0.041015625, -0.02783203125, 0.00640869140625, -0.01287841796875, 0.00811767578125, -0.020385742...	[ 2271, 71, 60494, 148477, 65421, 748, 17324, 254, 501, 65395, 19, 161063, 12301, 47416, 3794, 6056, 7077, 86429, 91693, 1810, 32149, 10869, 4803, 217, 9254, 519, 21658, 3675, 29062, 18, 2606, 191560, 184103, 297, 18781, 3509, 420, 39116, 759...	[ 0.07421875, 0.1063232421875, 0.018280029296875, 0.10626220703125, 0.2308349609375, 0.06671142578125, 0.14794921875, 0.024078369140625, 0.0712890625, 0.144775390625, 0.03717041015625, 0.04180908203125, 0.21630859375, 0.2071533203125, 0.0273590087890625, 0.06292724609375, 0.04537963867...	embed
30283253_c0	30283253	lisp	0	Title: Are Lisp lists always implemented as linked lists under the hood? Problem title: Are Lisp lists always implemented as linked lists under the hood? Tags: lisp, linked-list, cpu-cache Problem: Are Lisp lists always implemented as linked lists under the hood? Are Lisp lists always implemented as linked lists under ...	Are Lisp lists always implemented as linked lists under the hood? Are Lisp lists always implemented as linked lists under the hood? lisp linked-list cpu-cache Lisp Are Lisp lists always implemented as linked lists under the hood? Are Lisp lists always implemented as linked lists under the hood? Is this a problem as far...	[ 0.00811767578125, 0.0169677734375, 0.0002651214599609375, 0.00885009765625, -0.0081787109375, 0.0272216796875, 0.0111083984375, -0.0108642578125, 0.000553131103515625, -0.027099609375, -0.004974365234375, 0.0196533203125, 0.001373291015625, 0.01043701171875, -0.013427734375, 0.01239013...	[ 1261, 7008, 5303, 11343, 29479, 237, 3126, 297, 1379, 44462, 400, 6562, 1766, 408, 1430, 2967, 14543, 42, 377, 59207, 51347, 12282, 45646, 4358 ]	[ 0.18701171875, 0.248779296875, 0.253173828125, 0.1236572265625, 0.142822265625, 0.07379150390625, 0.16455078125, 0.04559326171875, 0.138427734375, 0.1470947265625, 0.1207275390625, 0.1624755859375, 0.098388671875, 0.06488037109375, 0.0791015625, 0.1099853515625, 0.0914306640625, 0....	embed
50539146_c0	50539146	lisp	0	Title: Quicklisp: Archive is the wrong size Problem title: Quicklisp: Archive is the wrong size Tags: lisp, common-lisp, quicklisp Problem: Quicklisp: Archive is the wrong size I'm trying to use the cl-heap library, but when I run (quicklisp:quickload 'cl-heap) it returns: The archive file "cl-heap-0.1.6.tgz" for "cl-h...	Quicklisp: Archive is the wrong size Quicklisp: Archive is the wrong size lisp common-lisp quicklisp Quicklisp Archive quicklisp:quickload cl-heap-0.1.6.tgz Quicklisp: Archive is the wrong size I'm trying to use the cl-heap library, but when I run it returns: What can I do to be able to run cl-heap?	[ -0.0057373046875, 0.01513671875, -0.0087890625, -0.00872802734375, -0.01239013671875, -0.0022735595703125, -0.0225830078125, 0.0244140625, 0.000728607177734375, 0.031494140625, 0.00823974609375, 0.00017070770263671875, 0.0177001953125, 0.0067138671875, 0.0205078125, -0.009033203125, ...	[ 89038, 4086, 254, 97291, 83, 70, 44691, 13267, 12, 400, 7008, 39210, 63773, 3181, 2594, 63033, 33139, 1106, 2631, 102014, 43652, 31577, 4527, 9, 35773, 1294, 11675, 30646, 831, 54, 19048 ]	[ 0.1094970703125, 0.1988525390625, 0.207275390625, 0.2379150390625, 0.061370849609375, 0.049560546875, 0.1820068359375, 0.2042236328125, 0.003971099853515625, 0.05029296875, 0.1768798828125, 0.08746337890625, 0.0565185546875, 0.034027099609375, 0.034271240234375, 0.171875, 0.123779296...	embed
42429575_c0	42429575	lisp	0	Title: true and false null values in lisp vs scheme Problem title: true and false null values in lisp vs scheme Tags: lisp, scheme Problem: true and false null values in lisp vs scheme I want to use the function in a scheme program im writing however im unsure ho to translate the T & Nil values within the function. Can...	true and false null values in lisp vs scheme true and false null values in lisp vs scheme lisp scheme NIL true and false null values in lisp vs scheme I want to use the function in a scheme program im writing however im unsure ho to translate the T & Nil values within the function. Can nil essentially be written as '()...	[ 0.001800537109375, 0.0106201171875, 0.0230712890625, -0.00066375732421875, -0.009033203125, 0.0130615234375, 0.017333984375, -0.00897216796875, -0.005401611328125, 0.01806640625, 0.006622314453125, -0.006744384765625, -0.0033111572265625, -0.01953125, -0.0184326171875, -0.0060119628906...	[ 29568, 136, 98320, 56574, 142424, 400, 7008, 20209, 150370, 23, 541, 16444, 3444, 4527, 32354, 1528, 32562, 566, 51646, 739, 3900, 19309, 384, 619, 77175, 28032, 4171, 17324, 85590, 59121, 237, 132 ]	[ 0.207275390625, 0.08331298828125, 0.23193359375, 0.2445068359375, 0.222412109375, 0.123046875, 0.2274169921875, 0.1658935546875, 0.2388916015625, 0.047332763671875, 0.08892822265625, 0.175048828125, 0.00885772705078125, 0.059661865234375, 0.146484375, 0.06866455078125, 0.049377441406...	embed
77780891_c2	77780891	lisp	2	.0 elev) en 1) (trans (list 1.0 0.0 elev) en 1) (trans (list 0.0 1.0 elev) en 1) ) (setq ucsFlag T) ) ) (setq obj (vlax-ename->vla-object Code signals: AutoLISP, Removing, c:FM_RM3, area1, area2, _undo, _begin, LWPOLYLINE, FM-RUIMTEDEFV, LAYER, _.LAYER, _New, Out, _offset, SetQ, ENTITY, EntLast, EntGet, SubSt, Cons, As...	.0 elev) en 1) (trans (list 1.0 0.0 elev) en 1) (trans (list 0.0 1.0 elev) en 1) ) (setq ucsFlag T) ) ) (setq obj (vlax-ename->vla-object Code signals: AutoLISP, Removing, c:FM_RM3, area1, area2, _undo, _begin, LWPOLYLINE, FM-RUIMTEDEFV, LAYER, _.LAYER, _New, Out, _offset, SetQ, ENTITY, EntLast, EntGet, SubSt, Cons, As...	[ -0.001007080078125, 0.02783203125, 0.00970458984375, -0.01190185546875, -0.0008392333984375, 0.00921630859375, 0.0023040771484375, 0.0115966796875, 0.0361328125, 0.0164794921875, 0.0228271484375, 0.00848388671875, 0.021484375, -0.02783203125, -0.008544921875, -0.0194091796875, 0.0119...	[ 5, 2389, 44971, 22, 4879, 30145, 6562, 53855, 89678, 16, 3509, 864, 50648, 7, 919, 3668, 384, 995, 170, 32019, 425, 13, 11627, 187694, 28864, 26073, 12, 4396, 67616, 683, 853, 432, 6496, 59370, 25656, 363, 16128, 418, 4, 304, 557, 682...	[ 0.0867919921875, 0.1568603515625, 0.2666015625, 0.16748046875, 0.1517333984375, 0.179931640625, 0.2100830078125, 0.1021728515625, 0.182861328125, 0.0123291015625, 0.101806640625, 0.0911865234375, 0.151611328125, 0.08642578125, 0.035614013671875, 0.25146484375, 0.11962890625, 0.0899...	embed
3772365_c0	3772365	lisp	0	Title: How to defun a function within a defun? Problem title: How to defun a function within a defun? Tags: common-lisp, lisp Problem: How to defun a function within a defun? For example, I pass the function name to another function (personal-function 'func-name '(attr1 attr2 ...)) and what I want to do is (defun perso...	How to defun a function within a defun? How to defun a function within a defun? common-lisp lisp How attr1 attr2 How to defun a function within a defun? For example, I pass the function name to another function and what I want to do is However, it said I can't defun with a symbol... What should I do?	[ -0.0067138671875, 0.0189208984375, -0.0030364990234375, 0.00811767578125, -0.0174560546875, 0.0213623046875, -0.00994873046875, -0.00066375732421875, 0.006561279296875, -0.01507568359375, -0.01373291015625, 0.017822265625, -0.015625, 0.033203125, 0.005950927734375, -0.00628662109375, ...	[ 11249, 47, 8, 16498, 32354, 28032, 10, 39210, 4086, 254, 400, 7008, 243, 42, 418, 304, 27875, 9351, 15700, 3444, 831, 18, 678, 26582 ]	[ 0.09857177734375, 0.067626953125, 0.1705322265625, 0.255615234375, 0.224609375, 0.181640625, 0.028045654296875, 0.0933837890625, 0.04669189453125, 0.08892822265625, 0.05120849609375, 0.12213134765625, 0.03973388671875, 0.039703369140625, 0.0208587646484375, 0.07806396484375, 0.102844...	embed
59428_c0	59428	lisp	0	Title: Which environment, IDE or interpreter to put in practice Scheme? Problem title: Which environment, IDE or interpreter to put in practice Scheme? Tags: ide, lisp, scheme, the-little-schemer Problem: Which environment, IDE or interpreter to put in practice Scheme? I've been making my way through The Little Schemer...	Which environment, IDE or interpreter to put in practice Scheme? Which environment, IDE or interpreter to put in practice Scheme? ide lisp scheme the-little-schemer Which IDE Scheme Which environment, IDE or interpreter to put in practice Scheme? I've been making my way through The Little Schemer and I was wondering wh...	[ 0.004608154296875, 0.01190185546875, -0.005340576171875, 0.02490234375, -0.0120849609375, 0.0010528564453125, 0.01312255859375, -0.0079345703125, 0.0034637451171875, -0.0069580078125, 0.00148773193359375, -0.00799560546875, -0.016845703125, 0.01104736328125, -0.005340576171875, -0.0000...	[ 130078, 65998, 4, 36497, 707, 29481, 56, 47, 3884, 23, 41361, 34702, 282, 32, 5415, 400, 7008, 150370, 70, 150, 46401, 7560, 1991, 3917, 8305, 581, 59784, 509, 149016, 2367, 2806, 2965, 4527, 3034, 18151, 741, 7565, 100, 35978 ]	[ 0.09283447265625, 0.2261962890625, 0.0316162109375, 0.2724609375, 0.07110595703125, 0.214599609375, 0.2012939453125, 0.1036376953125, 0.138671875, 0.1307373046875, 0.2529296875, 0.21435546875, 0.1705322265625, 0.016265869140625, 0.1817626953125, 0.10406494140625, 0.2012939453125, 0...	embed
3319427_c0	3319427	lisp	0	Title: How to display rationals as long lists of digits in Lisp? Problem title: How to display rationals as long lists of digits in Lisp? Tags: lisp, floating-point Problem: How to display rationals as long lists of digits in Lisp? I'm just starting to learn Lisp and was wondering how to display a rational as a decimal...	How to display rationals as long lists of digits in Lisp? How to display rationals as long lists of digits in Lisp? lisp floating-point How Lisp How to display rationals as long lists of digits in Lisp? I'm just starting to learn Lisp and was wondering how to display a rational as a decimal number with lots of digits. ...	[ 0.0181884765625, 0.0084228515625, -0.002532958984375, -0.02783203125, 0.01318359375, -0.003204345703125, 0.0147705078125, 0.003570556640625, -0.005218505859375, -0.00153350830078125, -0.0123291015625, -0.009521484375, -0.005828857421875, 0.003997802734375, 0.00799560546875, 0.009277343...	[ 11249, 44116, 168487, 7, 237, 4989, 5303, 153939, 23, 1261, 7008, 47, 400, 21917, 26518, 38496, 30698, 149016, 3642, 32380, 2749, 14012, 678, 71358, 4527, 52347, 1022, 7440, 382, 3444, 75281 ]	[ 0.063232421875, 0.172607421875, 0.2373046875, 0.0899658203125, 0.0732421875, 0.0821533203125, 0.158447265625, 0.15673828125, 0.0347900390625, 0.1505126953125, 0.213134765625, 0.009368896484375, 0.116943359375, 0.0987548828125, 0.0291595458984375, 0.08721923828125, 0.02911376953125, ...	embed
34804391_c2	34804391	lisp	2	0.5 (indep (arc artistry 3.0 0.4))) (define-node quantity 0.5 0.5 (indep (arc popularity 1.5 0.5))) (define-node correctness 0.5 0.5 (indep (arc elegance 1.0 0.7))) (define-node nutrition 0.6 0.6 (indep (arc popularity 1.1 0.7) (arc elegance 1.8 0.8))) (define-node hygiene 0.8 0.8 (indep (arc cleanliness 1.0 0.1))) (d...	0.5 (indep (arc artistry 3.0 0.4))) (define-node quantity 0.5 0.5 (indep (arc popularity 1.5 0.5))) (define-node correctness 0.5 0.5 (indep (arc elegance 1.0 0.7))) (define-node nutrition 0.6 0.6 (indep (arc popularity 1.1 0.7) (arc elegance 1.8 0.8))) (define-node hygiene 0.8 0.8 (indep (arc cleanliness 1.0 0.1))) (d...	[ -0.00848388671875, 0.0050048828125, -0.002044677734375, 0.0206298828125, 0.0036163330078125, 0.0296630859375, -0.00286865234375, -0.006256103515625, 0.0057373046875, 0.0096435546875, -0.002471923828125, -0.01226806640625, -0.0166015625, -0.026123046875, -0.0026397705078125, -0.01397705...	[ 81730, 5012, 254, 147, 238, 22104, 1294, 17596, 121254, 32149, 112, 64552, 157, 102134, 939, 15, 5700, 2481, 22410, 26785, 7432, 69443, 329, 53855, 134926, 150017, 122887, 38245, 79875, 132208, 99824, 6, 46622, 59801, 107754, 128512, 49558, 1...	[ 0.3056640625, 0.1500244140625, 0.176025390625, 0.1502685546875, 0.09564208984375, 0.1943359375, 0.1241455078125, 0.1669921875, 0.2020263671875, 0.048095703125, 0.1265869140625, 0.1959228515625, 0.16455078125, 0.1365966796875, 0.04412841796875, 0.021026611328125, 0.2222900390625, 0....	embed
35813139_c1	35813139	lisp	1	ROM-STRING "`(a b ,c)"))) ; ; caught STYLE-WARNING: ; The variable C is defined but never used. ; ; compilation unit finished ; caught 1 STYLE-WARNING condition ; Evaluation aborted on #<UNBOUND-VARIABLE C {1007A3B2F3}>. This means that EVAL didn't pick up the environment in which C is bound. PS. Interestingly enough, ...	ROM-STRING "`(a b ,c)"))) ; ; caught STYLE-WARNING: ; The variable C is defined but never used. ; ; compilation unit finished ; caught 1 STYLE-WARNING condition ; Evaluation aborted on #<UNBOUND-VARIABLE C {1007A3B2F3}>. This means that EVAL didn't pick up the environment in which C is bound. PS. Interestingly enough, ...	[ 0.0208740234375, 0.02392578125, -0.0087890625, 0.0218505859375, -0.008544921875, 0.0277099609375, 0.0169677734375, -0.0015869140625, 0.0108642578125, -0.018310546875, -0.02685546875, -0.0235595703125, 0.0033416748046875, -0.00958251953125, -0.0203857421875, 0.00048828125, -0.03125, ...	[ 85733, 9, 8545, 90345, 876, 238, 156892, 224170, 60873, 25795, 77336, 313, 83, 61924, 71, 1284, 8306, 11814, 98352, 25072, 122799, 35431, 151228, 64853, 297, 14006, 17398, 34384, 856, 20965, 183057, 966, 363, 26950, 241, 61152, 15935, 18, 3...	[ 0.28125, 0.04962158203125, 0.1236572265625, 0.2744140625, 0.05291748046875, 0.0625, 0.1495361328125, 0.203857421875, 0.09930419921875, 0.053131103515625, 0.281005859375, 0.1414794921875, 0.0003662109375, 0.190185546875, 0.012939453125, 0.09027099609375, 0.14013671875, 0.13732910156...	embed
40563725_c1	40563725	lisp	1	..." ; ] value. (let ((x)(y)(z)) (setq x 1) (setq x 2) (setq x 3) ) Strangely, Lisp does not seem to have a parallel to a JavaScript var/let/const; in the sense of the example above(Does it? I'm not very familiar with Lisp...). My question is; where are vars actually stored? They are not passed as arguments and they ar...	..." ; ] value. (let ((x)(y)(z)) (setq x 1) (setq x 2) (setq x 3) ) Strangely, Lisp does not seem to have a parallel to a JavaScript var/let/const; in the sense of the example above(Does it? I'm not very familiar with Lisp...). My question is; where are vars actually stored? They are not passed as arguments and they ar...	[ 0.01300048828125, 0.00506591796875, -0.031982421875, 0.006683349609375, -0.01495361328125, 0.028076171875, 0.00555419921875, 0.03271484375, 0.00823974609375, -0.001708984375, 0.00860595703125, 0.0164794921875, 0.006744384765625, 0.00482177734375, 0.0137939453125, 0.00933837890625, -0...	[ 153, 58, 2819, 34292, 1974, 53, 169, 3509, 864, 4958, 8439, 187791, 1261, 7008, 959, 48903, 95103, 17925, 285, 64, 25553, 18, 27781, 16031, 9655, 7440, 621, 7, 20653, 4343, 71, 10660, 115081, 10750, 143726, 159978, 171859, 1836, 8110, 174...	[ 0.030029296875, 0.022705078125, 0.000518798828125, 0.196044921875, 0.177490234375, 0.0020751953125, 0.030975341796875, 0.06353759765625, 0.122802734375, 0.006500244140625, 0.04931640625, 0.033111572265625, 0.15283203125, 0.2430419921875, 0.04473876953125, 0.023773193359375, 0.1912841...	embed
51982882_c0	51982882	lisp	0	Title: Unexpected eval result in CLISP Problem title: Unexpected eval result in CLISP Tags: common-lisp, eval, lisp Problem: Unexpected eval result in CLISP I run following code of CLISP, but the result looks strange to me. (setq a 'b) (setq b 'c) (setq c 'd) (setq d 8) (eval a) (eval c) (eval (eval a)) The output of l...	Unexpected eval result in CLISP Unexpected eval result in CLISP common-lisp eval lisp Unexpected CLISP Unexpected eval result in CLISP I run following code of CLISP, but the result looks strange to me. The output of last three line is: C 8 D How do I understand the output? How could last two line have different output?...	[ 0.0093994140625, 0.019775390625, 0.00823974609375, 0.019775390625, -0.006378173828125, 0.000560760498046875, 0.022216796875, 0.00885009765625, 0.008544921875, 0.0208740234375, -0.007537841796875, 0.0303955078125, 0.01123046875, 0.007598876953125, -0.022705078125, -0.00482177734375, 0...	[ 992, 83613, 13, 89829, 28, 1405, 16750, 313, 67616, 683, 39210, 4086, 254, 400, 7008, 11675, 25632, 18151, 33342, 114453, 140992, 4568, 17262, 13315, 83, 382, 391, 28219, 6626, 12921, 73342 ]	[ 0.0229339599609375, 0.08502197265625, 0.08587646484375, 0.0650634765625, 0.0411376953125, 0.2056884765625, 0.1368408203125, 0.10699462890625, 0.1553955078125, 0.2215576171875, 0.07476806640625, 0.113037109375, 0.1607666015625, 0.07281494140625, 0.1861572265625, 0.095947265625, 0.0462...	embed
27344364_c0	27344364	lisp	0	Title: Segmentation fault when trying to reverse a list Problem title: Segmentation fault when trying to reverse a list Tags: common-lisp, lisp Problem: Segmentation fault when trying to reverse a list I'm learning Common Lisp and I've been trying to write a function to reverse a list. This is the function but every ti...	Segmentation fault when trying to reverse a list Segmentation fault when trying to reverse a list common-lisp lisp Segmentation Segmentation fault when trying to reverse a list I'm learning Common Lisp and I've been trying to write a function to reverse a list. This is the function but every time I try to run it I get ...	[ -0.0089111328125, 0.0302734375, 0.0123291015625, 0.01092529296875, -0.00604248046875, 0.003143310546875, 0.01055908203125, 0.0322265625, -0.0020599365234375, -0.0128173828125, 0.00579833984375, 0.010009765625, 0.022216796875, 0.02587890625, 0.01385498046875, 0.00439453125, 0.01208496...	[ 38462, 674, 2320, 193857, 3229, 31577, 39531, 184, 5303, 39210, 4086, 254, 400, 7008, 52080, 151301, 1261, 33022, 32354, 11907, 1733, 9790, 11675, 2046, 294, 2507, 3036, 7136, 50886, 27919, 20051 ]	[ 0.21142578125, 0.19482421875, 0.09014892578125, 0.24560546875, 0.006500244140625, 0.1317138671875, 0.2059326171875, 0.1253662109375, 0.1846923828125, 0.0689697265625, 0.038665771484375, 0.083251953125, 0.03985595703125, 0.151123046875, 0.05218505859375, 0.11456298828125, 0.0933227539...	embed
47533553_c0	47533553	lisp	0	Title: Scheme pair construction Problem title: Scheme pair construction Tags: cdr, cons, lisp, list, scheme Problem: Scheme pair construction I am trying to understand pair construction and representation. Let's take a look at the following results: (length (cons '(a b) '(d e f))) => 4 Now let's switch the order: (leng...	Scheme pair construction Scheme pair construction cdr cons lisp list scheme Scheme Scheme pair construction I am trying to understand pair construction and representation. Let's take a look at the following results: Now let's switch the order: but Could you please explain the results above? What is the difference betwe...	[ 0.006622314453125, 0.039794921875, -0.005615234375, 0.0198974609375, -0.000850677490234375, 0.0208740234375, -0.024658203125, -0.0026092529296875, 0.008544921875, -0.033203125, 0.0017852783203125, -0.0303955078125, -0.0003490447998046875, -0.0020294189453125, -0.01190185546875, -0.0122...	[ 34702, 282, 80836, 50961, 56329, 42, 158, 7, 400, 7008, 5303, 150370, 28219, 18811, 50339, 101089, 12989, 73342, 36917, 70, 60212, 17721, 2258, 136 ]	[ 0.170166015625, 0.08697509765625, 0.25439453125, 0.171875, 0.0699462890625, 0.176025390625, 0.1405029296875, 0.016937255859375, 0.0241241455078125, 0.12939453125, 0.1158447265625, 0.2010498046875, 0.057159423828125, 0.1595458984375, 0.06134033203125, 0.055816650390625, 0.109375, 0....	embed
3000193_c0	3000193	lisp	0	Title: Lisp data security/validation Problem title: Lisp data security/validation Tags: validation, security, lisp Problem: Lisp data security/validation This is really just a conceptual question for me at this point. In Lisp, programs are data and data are programs. The REPL does exactly that - reads and then evaluate...	Lisp data security/validation Lisp data security/validation validation security lisp Lisp Lisp data security/validation This is really just a conceptual question for me at this point. In Lisp, programs are data and data are programs. The REPL does exactly that - reads and then evaluates. So how does one go about gettin...	[ 0.006011962890625, 0.032470703125, 0.00579833984375, 0.003082275390625, -0.010009765625, 0.0162353515625, 0.015625, 0.00946044921875, -0.0079345703125, -0.059326171875, 0.01177978515625, 0.004913330078125, 0.005615234375, 0.0062255859375, -0.007232666015625, -0.006927490234375, -0.00...	[ 1261, 7008, 2053, 48031, 7013, 85, 44622, 1363, 400, 6183, 228113, 9655, 99, 6275, 103391, 621, 136, 9069, 21130, 14602, 66161, 450, 12301, 7068, 151575, 90, 3642, 738, 1672, 20949, 107730, 1295, 70, 38937, 23, 111670, 3917, 79850, 442, 7...	[ 0.200927734375, 0.260009765625, 0.1654052734375, 0.2364501953125, 0.15966796875, 0.1573486328125, 0.2174072265625, 0.0225830078125, 0.157470703125, 0.0229949951171875, 0.10546875, 0.052764892578125, 0.0086517333984375, 0.0037517547607421875, 0.2078857421875, 0.1064453125, 0.003360748...	embed
5833033_c0	5833033	lisp	0	Title: In Lisp, code is data. What benefit does that provide? Problem title: In Lisp, code is data. What benefit does that provide? Tags: lisp Problem: In Lisp, code is data. What benefit does that provide? In Lisp, any program's code is actually a valid data structure. For example, this adds one and two together, but ...	In Lisp, code is data. What benefit does that provide? In Lisp, code is data. What benefit does that provide? lisp Lisp What In Lisp, code is data. What benefit does that provide? In Lisp, any program's code is actually a valid data structure. For example, this adds one and two together, but it's also a list of three i...	[ 0.01141357421875, 0.0224609375, 0.000682830810546875, 0.0291748046875, 0.00823974609375, 0.0242919921875, 0.01434326171875, 0.00921630859375, 0.0078125, -0.013916015625, -0.01202392578125, -0.02294921875, 0.00118255615234375, 0.0093994140625, -0.01806640625, 0.004119873046875, 0.0032...	[ 360, 1261, 7008, 18151, 83, 2053, 4865, 68073, 22691, 400, 2499, 1528, 20653, 10, 35604, 45646, 15190, 1632, 136, 6626, 25842, 5303, 17262, 55769, 2886, 69201, 27650, 46876 ]	[ 0.0765380859375, 0.18798828125, 0.249267578125, 0.30908203125, 0.1387939453125, 0.2203369140625, 0.060150146484375, 0.1915283203125, 0.11334228515625, 0.14306640625, 0.0472412109375, 0.1781005859375, 0.08477783203125, 0.023681640625, 0.1875, 0.193603515625, 0.1380615234375, 0.04724...	embed
12564587_c0	12564587	lisp	0	Title: lisp iterative function always returns nil Problem title: lisp iterative function always returns nil Tags: iteration, let, lisp Problem: lisp iterative function always returns nil this function is supposed to count the number of times that the element 'a' appears in a list, but is not working: (defun iter-a_coun...	lisp iterative function always returns nil lisp iterative function always returns nil iteration let lisp iter-a_count lisp iterative function always returns nil this function is supposed to count the number of times that the element 'a' appears in a list, but is not working: This function always returns nil. May I ask ...	[ -0.006805419921875, -0.016357421875, 0.005096435546875, 0.0167236328125, -0.01422119140625, 0.0224609375, 0.00555419921875, -0.000652313232421875, 0.00384521484375, -0.033447265625, -0.0078125, -0.02734375, -0.00148773193359375, 0.01171875, 0.003814697265625, -0.0030364990234375, 0.0...	[ 400, 7008, 17, 720, 45023, 32354, 11343, 30646, 17324, 2633, 71013, 7, 6, 134598, 54529, 14012, 20028, 12830, 11, 135179, 5303, 959, 20697, 26458, 44691 ]	[ 0.1278076171875, 0.193603515625, 0.0172576904296875, 0.1986083984375, 0.0919189453125, 0.142578125, 0.16796875, 0.189453125, 0.2115478515625, 0.06597900390625, 0.158203125, 0.00991058349609375, 0.0595703125, 0.0194549560546875, 0.1507568359375, 0.0460205078125, 0.1605224609375, 0.1...	embed
6417127_c0	6417127	lisp	0	Title: In Lisp and other functional languages, why is length not O(1) Problem title: In Lisp and other functional languages, why is length not O(1) Tags: language-implementation, lisp Problem: In Lisp and other functional languages, why is length not O(1) The list primitives in Lisp have the opperator length defined as...	In Lisp and other functional languages, why is length not O(1) In Lisp and other functional languages, why is length not O(1) language-implementation lisp Lisp In Lisp and other functional languages, why is length not O(1) The list primitives in Lisp have the opperator length defined as follows: Why can't implementers ...	[ 0.003143310546875, 0.051513671875, 0.0186767578125, 0.005401611328125, 0.0196533203125, -0.00738525390625, -0.0023956298828125, -0.000797271728515625, 0.004364013671875, -0.0517578125, -0.0030364990234375, -0.012451171875, -0.0045166015625, 0.004913330078125, 0, 0.018798828125, 0.016...	[ 1261, 7008, 123309, 46876, 15400, 83, 140909, 959, 180, 27750, 197648, 400, 5303, 128489, 2343, 56, 4597, 61924, 44084, 831, 18, 29479, 3249, 13, 375, 7077, 53697, 1733 ]	[ 0.1392822265625, 0.199951171875, 0.1324462890625, 0.10357666015625, 0.128173828125, 0.06402587890625, 0.236572265625, 0.12744140625, 0.150146484375, 0.0919189453125, 0.1417236328125, 0.08428955078125, 0.170166015625, 0.1690673828125, 0.1478271484375, 0.13623046875, 0.1641845703125, ...	embed
40837000_c0	40837000	lisp	0	Title: How to declare a function before its definition in common lisp? Problem title: How to declare a function before its definition in common lisp? Tags: lisp, common-lisp Problem: How to declare a function before its definition in common lisp? I will get an undefined function warning about f2 in SBCL with following ...	How to declare a function before its definition in common lisp? How to declare a function before its definition in common lisp? lisp common-lisp How How to declare a function before its definition in common lisp? I will get an undefined function warning about f2 in SBCL with following code sample. Is it possible that I...	[ 0.0181884765625, 0.01043701171875, -0.019287109375, 0.01153564453125, -0.02001953125, -0.007110595703125, -0.0022735595703125, 0.00970458984375, -0.00836181640625, -0.028564453125, 0.015625, 0.00933837890625, -0.000850677490234375, -0.0133056640625, 0.0247802734375, 0.0198974609375, ...	[ 11249, 47, 159978, 32354, 8108, 6863, 80934, 23, 39210, 400, 7008, 4086, 254, 10, 9232, 5983, 1631, 592, 1238, 304, 90944, 37486, 18151, 121413, 7722, 5117, 313, 71864, 1815 ]	[ 0.09246826171875, 0.06451416015625, 0.2449951171875, 0.222900390625, 0.18115234375, 0.021026611328125, 0.21923828125, 0.051055908203125, 0.1435546875, 0.12115478515625, 0.2021484375, 0.07586669921875, 0.1348876953125, 0.015167236328125, 0.05035400390625, 0.1453857421875, 0.0950927734...	embed
26616641_c0	26616641	lisp	0	Title: How does this code behave (function composition in funcall) Problem title: How does this code behave (function composition in funcall) Tags: common-lisp, lisp Problem: How does this code behave (function composition in funcall) I have the following function in lisp: (defun F(F) #'(lambda (n) (if (zerop n) (funca...	How does this code behave (function composition in funcall) How does this code behave (function composition in funcall) common-lisp lisp How How does this code behave (function composition in funcall) I have the following function in lisp: How does this code behaves if I call: I dont understand why the output is 4. Tha...	[ -0.00885009765625, -0.00146484375, -0.0010833740234375, 0.029296875, -0.0123291015625, 0.017822265625, 0.025390625, 0.01373291015625, -0.005126953125, -0.037841796875, 0.0032196044921875, 0.0023040771484375, 0.0036773681640625, 0.0281982421875, 0.015869140625, -0.015625, -0.000991821...	[ 11249, 14602, 903, 18151, 186, 68991, 137175, 166577, 7477, 85763, 39210, 4086, 254, 400, 7008, 70, 25632, 32354, 2174, 87, 11782, 13319, 28219, 15400, 140992, 83, 1398, 129745 ]	[ 0.07080078125, 0.085205078125, 0.0758056640625, 0.198486328125, 0.030181884765625, 0.148681640625, 0.1583251953125, 0.216552734375, 0.113037109375, 0.2474365234375, 0.1199951171875, 0.0797119140625, 0.137451171875, 0.099609375, 0.1676025390625, 0.0170135498046875, 0.0217132568359375,...	embed
14794609_c1	14794609	lisp	1	ole-gay (third fbf) var-for var-ex))) ((not) ;se trovo and or not semplicemente li riscrivo e continuo con la ricorsione (list (car fbf) (skole-gay (second fbf) var-for var-ex))) (otherwise ;; e' solo 1 proposizione, la ritorno fbf)) fbf)) at one point im doing (case (car fbf) ; where car of fbf = ?x and one of the cas...	ole-gay (third fbf) var-for var-ex))) ((not) ;se trovo and or not semplicemente li riscrivo e continuo con la ricorsione (list (car fbf) (skole-gay (second fbf) var-for var-ex))) (otherwise ;; e' solo 1 proposizione, la ritorno fbf)) fbf)) at one point im doing (case (car fbf) ; where car of fbf = ?x and one of the cas...	[ 0.0250244140625, 0.024169921875, -0.0069580078125, -0.01068115234375, -0.00360107421875, 0.0284423828125, -0.000946044921875, 0.000949859619140625, 0.0113525390625, -0.01153564453125, -0.0072021484375, -0.0255126953125, 0.00982666015625, 0.000644683837890625, -0.0108642578125, -0.01806...	[ 1942, 9, 31989, 95037, 71, 108642, 420, 285, 2472, 3355, 32149, 10869, 154733, 96695, 400, 46012, 42, 5777, 62005, 23306, 15009, 6562, 3284, 29897, 191633, 16, 2639, 106, 502, 86948, 21, 129331, 99, 1632, 6275, 566, 20594, 58437, 2258, 11...	[ 0.2078857421875, 0.01300048828125, 0.255859375, 0.1861572265625, 0.1102294921875, 0.1470947265625, 0.169921875, 0.2103271484375, 0.146484375, 0.1868896484375, 0.0408935546875, 0.1490478515625, 0.1839599609375, 0.040008544921875, 0.07958984375, 0.06890869140625, 0.1405029296875, 0.1...	embed
37269617_c0	37269617	lisp	0	Title: How to use clojure.tools.macro/name-with-attributes in ClojureScript? Problem title: How to use clojure.tools.macro/name-with-attributes in ClojureScript? Tags: clojurescript, clojure, lisp, macros Problem: How to use clojure.tools.macro/name-with-attributes in ClojureScript? I would like to give a name to a mac...	How to use clojure.tools.macro/name-with-attributes in ClojureScript? How to use clojure.tools.macro/name-with-attributes in ClojureScript? clojurescript clojure lisp macros How clojure.tools.macro ClojureScript How to use clojure.tools.macro/name-with-attributes in ClojureScript? I would like to give a name to a macro...	[ -0.0031280517578125, 0.01019287109375, -0.0238037109375, -0.006591796875, -0.004364013671875, 0.0068359375, -0.00396728515625, 0.01300048828125, -0.00592041015625, -0.0167236328125, -0.019775390625, -0.00421142578125, 0.0022125244140625, -0.000732421875, 0.006500244140625, -0.019287109...	[ 11249, 4527, 20450, 461, 107, 89110, 192, 15322, 11627, 76228, 257, 191145, 7, 23, 51053, 147845, 32032, 400, 7008, 111789, 1884, 8337, 9351, 47, 55300, 183234 ]	[ 0.051971435546875, 0.1143798828125, 0.1478271484375, 0.16162109375, 0.1455078125, 0.228759765625, 0.038330078125, 0.166748046875, 0.1710205078125, 0.208984375, 0.0290069580078125, 0.1832275390625, 0.017242431640625, 0.04345703125, 0.151611328125, 0.236328125, 0.177001953125, 0.0574...	embed
245677_c0	245677	lisp	0	Title: What are some things that you've used Scheme macros for? Problem title: What are some things that you've used Scheme macros for? Tags: scheme, racket, macros, lisp Problem: What are some things that you've used Scheme macros for? Many examples of macros seem to be about hiding lambdas, e.g. with-open-f...	What are some things that you've used Scheme macros for? What are some things that you've used Scheme macros for? scheme racket macros lisp What Scheme What are some things that you've used Scheme macros for? Many examples of macros seem to be about hiding lambdas, e.g. with-open-file in CL. I'm looking for s...	[ 0.009765625, 0.0157470703125, 0.01031494140625, 0.0037841796875, -0.0034637451171875, 0.01171875, -0.004974365234375, 0.0017547607421875, 0.010009765625, -0.0177001953125, -0.0166015625, -0.039306640625, -0.00927734375, -0.016357421875, -0.0002880096435546875, -0.0208740234375, 0.007...	[ 4865, 8966, 398, 3768, 272, 11814, 34702, 282, 111789, 7, 100, 3060, 150370, 673, 27853, 400, 7008, 621, 450, 27781, 1672, 1274, 6238, 21, 6492, 1124, 678, 59636, 29822, 46323, 1286, 188768, 4527, 436, 27026, 12319, 17368, 32354 ]	[ 0.072998046875, 0.1334228515625, 0.02044677734375, 0.02484130859375, 0.063720703125, 0.10394287109375, 0.2281494140625, 0.22412109375, 0.247314453125, 0.1290283203125, 0.1204833984375, 0.0372314453125, 0.234130859375, 0.01519775390625, 0.14892578125, 0.034393310546875, 0.143188476562...	embed
20881659_c0	20881659	lisp	0	Title: Sort a list according to another list in common lisp Problem title: Sort a list according to another list in common lisp Tags: sorting, lisp, common-lisp Problem: Sort a list according to another list in common lisp How would you sort list according to the order defined in another list sorter : list = ( (:value ...	Sort a list according to another list in common lisp Sort a list according to another list in common lisp sorting lisp common-lisp Sort Sort a list according to another list in common lisp How would you sort list according to the order defined in another list sorter : Resulting in: Thanks	[ 0.00360107421875, 0.016357421875, 0.004638671875, -0.003021240234375, -0.011474609375, -0.025146484375, -0.004425048828125, -0.01226806640625, 0.01409912109375, -0.0172119140625, -0.003936767578125, 0.022705078125, -0.00445556640625, 0.00421142578125, -0.0011444091796875, -0.0106811523...	[ 53666, 5303, 59499, 15700, 39210, 400, 7008, 12096, 214, 4086, 254, 10, 47, 23, 2806, 12989, 61924, 136666, 22362 ]	[ 0.2069091796875, 0.2064208984375, 0.06475830078125, 0.10650634765625, 0.1251220703125, 0.08111572265625, 0.11480712890625, 0.202880859375, 0.0268402099609375, 0.053741455078125, 0.0772705078125, 0.00815582275390625, 0.004253387451171875, 0.008453369140625, 0.025634765625, 0.1484375, ...	embed
9858030_c0	9858030	lisp	0	Title: Search and replace on variable name within S-Expression (lexical scope)? Problem title: Search and replace on variable name within S-Expression (lexical scope)? Tags: paredit, lisp, emacs, clojure, s-expression Problem: Search and replace on variable name within S-Expression (lexical scope)? Using emacs with Par...	Search and replace on variable name within S-Expression (lexical scope)? Search and replace on variable name within S-Expression (lexical scope)? paredit lisp emacs clojure s-expression Search S-Expression Search and replace on variable name within S-Expression (lexical scope)? Using emacs with Paredit enabled. How can...	[ -0.0108642578125, 0.0238037109375, -0.007354736328125, 0.0159912109375, -0.0111083984375, 0.0303955078125, -0.0032806396484375, 0.0264892578125, 0.013916015625, 0.000370025634765625, 0.020263671875, 0.02978515625, -0.00848388671875, -0.004974365234375, 0.021484375, 0.000827789306640625...	[ 33086, 136, 91995, 98, 77336, 9351, 28032, 159, 9, 178752, 1830, 74070, 21533, 70820, 366, 45082, 400, 7008, 352, 2263, 20450, 461, 107, 91, 204629, 345, 678, 2392, 225081, 11249, 831, 33938, 8305, 16970, 9434, 20219, 3408, 456, 11627, 18...	[ 0.2244873046875, 0.0809326171875, 0.208251953125, 0.101318359375, 0.250732421875, 0.1302490234375, 0.12255859375, 0.1676025390625, 0.031402587890625, 0.221923828125, 0.107666015625, 0.081787109375, 0.0848388671875, 0.142578125, 0.0477294921875, 0.217529296875, 0.0355224609375, 0.13...	embed
712905_c0	712905	lisp	0	Title: Loading libraries in Dr Scheme Problem title: Loading libraries in Dr Scheme Tags: scheme, sicp, lisp Problem: Loading libraries in Dr Scheme I am working through SICP using Dr Scheme. How do I load external libraries in Dr Scheme? Say I want to use Math library then how do I ask Dr Scheme to load the particular...	Loading libraries in Dr Scheme Loading libraries in Dr Scheme scheme sicp lisp Loading Scheme Loading libraries in Dr Scheme I am working through SICP using Dr Scheme. How do I load external libraries in Dr Scheme? Say I want to use Math library then how do I ask Dr Scheme to load the particular library? I tried with t...	[ -0.0074462890625, 0.0250244140625, -0.00946044921875, 0.01434326171875, -0.0103759765625, -0.0035858154296875, 0.00531005859375, 0.01483154296875, -0.00860595703125, -0.052734375, -0.00390625, -0.03466796875, -0.01434326171875, -0.01287841796875, 0.00885009765625, -0.03759765625, -0....	[ 228006, 35773, 10484, 1773, 34702, 282, 23, 150370, 26536, 254, 400, 7008, 20697, 159, 198993, 72367, 173591, 3444, 4527, 78804, 1294, 26458, 17311, 37842, 3181, 107, 5612, 125458, 5, 7, 25632, 18499, 91067, 47, 9232, 5983, 42485, 56, 64209...	[ 0.214599609375, 0.2120361328125, 0.12078857421875, 0.172607421875, 0.20849609375, 0.1561279296875, 0.0261383056640625, 0.1783447265625, 0.07568359375, 0.10760498046875, 0.046539306640625, 0.1490478515625, 0.032012939453125, 0.0245208740234375, 0.1873779296875, 0.188232421875, 0.14221...	embed
29413880_c0	29413880	lisp	0	Title: LISP: Find occurrences of each word in a sentence. Problem title: LISP: Find occurrences of each word in a sentence. Tags: lisp Problem: LISP: Find occurrences of each word in a sentence. Can someone please explain to me how I search for the occurrences of each word in a sentence, such as "the cat sat on the mat...	LISP: Find occurrences of each word in a sentence. LISP: Find occurrences of each word in a sentence. lisp LISP Find LISP: Find occurrences of each word in a sentence. Can someone please explain to me how I search for the occurrences of each word in a sentence, such as "the cat sat on the mat" in Common lisp ? The user...	[ 0.0069580078125, -0.0019073486328125, -0.011474609375, 0.0184326171875, -0.0031585693359375, 0.022705078125, 0.021728515625, 0.0089111328125, 0.01348876953125, -0.0361328125, -0.0072021484375, 0.007110595703125, 0.0172119140625, 0.0034027099609375, 0.00799560546875, 0.0235595703125, ...	[ 16970, 9434, 12, 26040, 74918, 42, 69098, 111, 12638, 2565, 23, 149357, 400, 7008, 73342, 3642, 33938, 100, 2347, 7515, 11736, 98, 70, 2589, 151301, 38937, 107730, 3674, 13315, 7986, 3535, 8110, 54529, 1295, 4358, 4034 ]	[ 0.1375732421875, 0.1939697265625, 0.009857177734375, 0.138427734375, 0.1597900390625, 0.136962890625, 0.1295166015625, 0.04351806640625, 0.09942626953125, 0.17578125, 0.0406494140625, 0.1732177734375, 0.1478271484375, 0.1798095703125, 0.0960693359375, 0.048797607421875, 0.18969726562...	embed
33801587_c0	33801587	lisp	0	Title: Is there any way to get a variable address in Common Lisp? Problem title: Is there any way to get a variable address in Common Lisp? Tags: xor-linkedlist, memory-address, lisp, common-lisp Problem: Is there any way to get a variable address in Common Lisp? I'm trying to implement XOR-linked lists on Common Lisp,...	Is there any way to get a variable address in Common Lisp? Is there any way to get a variable address in Common Lisp? xor-linkedlist memory-address lisp common-lisp Common Lisp Is there any way to get a variable address in Common Lisp? I'm trying to implement XOR-linked lists on Common Lisp, but i need to get an addres...	[ 0.01953125, 0.01116943359375, -0.0084228515625, 0.00860595703125, -0.00075531005859375, 0.029052734375, -0.000774383544921875, 0.01904296875, -0.0091552734375, -0.05712890625, 0.0087890625, 0.018310546875, 0.01263427734375, -0.0027313232421875, 0.01385498046875, 0.01092529296875, -0....	[ 2499, 3917, 2046, 10, 77336, 29823, 23, 151301, 1261, 7008, 2685, 47, 74706, 10187, 297, 6562, 98323, 712, 107421, 400, 39210, 4086, 254, 29479, 1193, 24638, 5303, 3871, 111, 51339, 4785, 90825, 41018, 21373, 50828, 3447, 132, 32354 ]	[ 0.05401611328125, 0.0833740234375, 0.111328125, 0.068359375, 0.288330078125, 0.2215576171875, 0.0552978515625, 0.1771240234375, 0.1513671875, 0.205810546875, 0.010894775390625, 0.03277587890625, 0.137451171875, 0.1265869140625, 0.035980224609375, 0.1395263671875, 0.1856689453125, 0...	embed
30467726_c0	30467726	lisp	0	Title: No-argument (and) returns t Problem title: No-argument (and) returns t Tags: clojure, lisp, scheme, common-lisp Problem: No-argument (and) returns t Both CL and Scheme define (and) to return t (or #t ) with no arguments. I'm trying to understand the rationale for this. My naive assumption is that an empty set is...	No-argument (and) returns t No-argument (and) returns t clojure lisp scheme common-lisp No-argument No-argument (and) returns t Both CL and Scheme define (and) to return t (or #t ) with no arguments. I'm trying to understand the rationale for this. My naive assumption is that an empty set is false, and passing in zero ...	[ 0.0120849609375, 0.01416015625, -0.01104736328125, 0.0021209716796875, -0.016357421875, 0.0191650390625, 0.0224609375, 0.0031585693359375, 0.0142822265625, 0.004913330078125, -0.006439208984375, -0.0198974609375, -0.0067138671875, 0.020751953125, 0.0010986328125, -0.00070953369140625, ...	[ 438, 155937, 2940, 30646, 808, 20450, 461, 107, 400, 7008, 150370, 39210, 4086, 254, 46323, 34702, 282, 61924, 468, 18, 678, 110, 10750, 28219, 168487, 237259, 201505, 5423, 98320, 452, 45234, 12319, 1884, 23, 33720, 29568, 101805, 62822, 1...	[ 0.134033203125, 0.291259765625, 0.1683349609375, 0.2064208984375, 0.15185546875, 0.0986328125, 0.1142578125, 0.06170654296875, 0.06170654296875, 0.15478515625, 0.152099609375, 0.042572021484375, 0.06317138671875, 0.13037109375, 0.1551513671875, 0.1363525390625, 0.12646484375, 0.127...	embed
12649926_c0	12649926	lisp	0	Title: subset sum - lisp Problem title: subset sum - lisp Tags: lisp, common-lisp Problem: subset sum - lisp I'm trying to write a subset sum problem in lisp. Example: (subsetsum '(1 2 3) 5) = (2 3) , (subsetsum '(1 5 3) 2) = nil . I can only use functions (atom x) (null x) (eq x y) (equal x y) (numberp x) (append x y)...	subset sum - lisp subset sum - lisp lisp common-lisp subset sum - lisp I'm trying to write a subset sum problem in lisp. Example: (subsetsum '(1 2 3) 5) = (2 3) , (subsetsum '(1 5 3) 2) = nil . I can only use functions Can I get any hint?	[ -0.01080322265625, 0.021484375, 0.031982421875, 0.00335693359375, -0.0264892578125, 0.01239013671875, 0.00213623046875, 0.01019287109375, 0.01104736328125, -0.01220703125, 0.0033111572265625, 0.0135498046875, 0.005706787109375, -0.010986328125, -0.0024871826171875, 0.0135498046875, 0...	[ 1614, 3509, 10554, 400, 7008, 39210, 4086, 254, 31577, 33022, 2967, 23, 89536, 8705, 22144, 11832, 116, 8439, 21162, 2203, 4700, 190, 4958, 6, 17324, 831, 4734, 4527, 32354, 5122 ]	[ 0.1988525390625, 0.2392578125, 0.2269287109375, 0.1318359375, 0.2249755859375, 0.12335205078125, 0.10260009765625, 0.145263671875, 0.07684326171875, 0.1138916015625, 0.20458984375, 0.03387451171875, 0.04364013671875, 0.009521484375, 0.1973876953125, 0.2476806640625, 0.07666015625, ...	embed
41222463_c0	41222463	lisp	0	Title: Minimum value of integer lisp Problem title: Minimum value of integer lisp Tags: lisp, common-lisp Problem: Minimum value of integer lisp I am tryin to retrieve the minimum value of integer in lisp. I found most-negative-fixnum variable that should represent the lowest possible number. whatever i try doing with ...	Minimum value of integer lisp Minimum value of integer lisp lisp common-lisp Minimum Minimum value of integer lisp I am tryin to retrieve the minimum value of integer in lisp. I found variable that should represent the lowest possible number. whatever i try doing with it is throws error Is there any specific way how to...	[ -0.0111083984375, 0.003631591796875, -0.001983642578125, -0.00023651123046875, -0.019287109375, 0.01123046875, 0.0294189453125, -0.00013446807861328125, 0.0001583099365234375, -0.03466796875, -0.01190185546875, -0.01239013671875, 0.0022430419921875, 0.0019989013671875, 0.03076171875, -...	[ 173858, 34292, 111, 892, 1505, 400, 7008, 39210, 4086, 254, 9790, 3996, 3134, 70, 15440, 23, 77336, 5608, 33636, 459, 25617, 7722, 14012, 104250, 18499, 29458, 3917, 3642, 47, 2046 ]	[ 0.21044921875, 0.1993408203125, 0.049591064453125, 0.1226806640625, 0.0986328125, 0.14013671875, 0.2042236328125, 0.09490966796875, 0.10357666015625, 0.1619873046875, 0.0029544830322265625, 0.059661865234375, 0.020904541015625, 0.06671142578125, 0.2066650390625, 0.052276611328125, 0....	embed
16432561_c0	16432561	lisp	0	Title: List difference function Problem title: List difference function Tags: list, lisp, ml, functional-programming Problem: List difference function Does any existing programming language, particularly in the Lisp or ML families, have a library function to calculate list difference in the sense of 'first until start ...	List difference function List difference function list lisp ml functional-programming List List difference function Does any existing programming language, particularly in the Lisp or ML families, have a library function to calculate list difference in the sense of 'first until start of second' - I'm not sure offhand w...	[ 0.00927734375, 0.00408935546875, -0.00506591796875, 0.018310546875, -0.00848388671875, 0.0172119140625, -0.005462646484375, 0.01324462890625, 0.01220703125, 0.00970458984375, 0.01348876953125, 0.002655029296875, -0.00194549560546875, 0.0194091796875, -0.0003070831298828125, -0.00601196...	[ 32036, 60212, 32354, 5303, 400, 7008, 7115, 123309, 28966, 101790, 2499, 144573, 56037, 449, 46876, 1261, 39456, 87143, 765, 10, 35773, 1294, 47, 74481, 67, 10422, 13448, 271, 24189, 4034, 111, 17932, 12336, 35839, 179635, 79315, 237, 124850,...	[ 0.259765625, 0.29736328125, 0.2066650390625, 0.259033203125, 0.08355712890625, 0.20263671875, 0.1265869140625, 0.1361083984375, 0.1065673828125, 0.0018091201782226562, 0.04986572265625, 0.11920166015625, 0.12646484375, 0.041656494140625, 0.1632080078125, 0.1192626953125, 0.1666259765...	embed
7099567_c0	7099567	lisp	0	Title: Remove even appearance of elements from list with Lisp or PROLOG Problem title: Remove even appearance of elements from list with Lisp or PROLOG Tags: prolog, lisp Problem: Remove even appearance of elements from list with Lisp or PROLOG I have to delete even appearance of element from list using LISP or PROLOG....	Remove even appearance of elements from list with Lisp or PROLOG Remove even appearance of elements from list with Lisp or PROLOG prolog lisp list Remove Lisp PROLOG Remove even appearance of elements from list with Lisp or PROLOG I have to delete even appearance of element from list using LISP or PROLOG. Here is some ...	[ -0.0086669921875, 0.044189453125, 0.00191497802734375, 0.007568359375, -0.01513671875, 0.0281982421875, -0.0022735595703125, 0.0096435546875, 0.00958251953125, -0.007537841796875, 0.017578125, -0.011962890625, -0.00946044921875, 0.0029754638671875, 0.004241943359375, 0.032470703125, ...	[ 181139, 3853, 170894, 111, 80854, 1295, 5303, 1261, 7008, 10514, 47510, 678, 502, 4867, 400, 707, 765, 154109, 12830, 17368, 16970, 9434, 27781, 107730, 104116, 116, 6896, 190, 2788, 201, 32149, 4958, 140992, 9451, 1737, 63667, 238, 47143, ...	[ 0.1392822265625, 0.19970703125, 0.1947021484375, 0.037872314453125, 0.166748046875, 0.10479736328125, 0.195556640625, 0.15087890625, 0.2115478515625, 0.1246337890625, 0.2174072265625, 0.03240966796875, 0.07330322265625, 0.1817626953125, 0.10809326171875, 0.0202178955078125, 0.0011796...	embed
32304332_c0	32304332	lisp	0	Title: Python-String to function in 'eval' Problem title: Python-String to function in 'eval' Tags: string, lisp, eval Problem: Python-String to function in 'eval' I'm trying to build a lisp interpreter in python using 'eval'. def FUNC(e1,*elements): print(e1) eval((input())) Its working for integer...	Python-String to function in 'eval' Python-String to function in 'eval' string lisp eval Python-String FUNC Python-String to function in 'eval' I'm trying to build a lisp interpreter in python using 'eval'. Its working for integers.But is there any way I can use this to input strings? eg: when I inp...	[ 0.007080078125, 0.01123046875, -0.006378173828125, 0.0137939453125, -0.0023040771484375, 0.0228271484375, 0.0205078125, -0.01092529296875, 0.0029144287109375, -0.0498046875, 0.003631591796875, -0.021484375, -0.0194091796875, 0.0162353515625, -0.01324462890625, -0.0078125, -0.00585937...	[ 145581, 9, 71713, 214, 47, 32354, 23, 3768, 13, 1405, 79315, 400, 7008, 28, 136258, 441, 31577, 45367, 29481, 56, 17198, 50828, 17368, 20697, 892, 26255, 3917, 4527, 903, 107730, 3229, 36917, 18151, 5608, 28412, 87, 2301, 18, 3444, 237, ...	[ 0.2471923828125, 0.0261383056640625, 0.2252197265625, 0.140380859375, 0.1158447265625, 0.2139892578125, 0.10693359375, 0.07171630859375, 0.09075927734375, 0.273681640625, 0.228759765625, 0.1201171875, 0.1993408203125, 0.09619140625, 0.1571044921875, 0.042877197265625, 0.0379638671875...	embed
32767155_c0	32767155	lisp	0	Title: Why does Setq work but not let? Problem title: Why does Setq work but not let? Tags: common-lisp, lisp Problem: Why does Setq work but not let? I'm following the syntax as it is in my book "The land of lisp" and the let version only returns nil when passed string. Whereas the "setq" version returns the reverse...	Why does Setq work but not let? Why does Setq work but not let? common-lisp lisp Why Setq Why does Setq work but not let? I'm following the syntax as it is in my book "The land of lisp" and the let version only returns nil when passed string. Whereas the "setq" version returns the reversed version of string .	[ -0.0123291015625, 0.001220703125, 0.01385498046875, 0.037841796875, -0.017822265625, 0.01068115234375, 0.0189208984375, 0.006988525390625, 0.0076904296875, 0.01068115234375, -0.004119873046875, 0.0247802734375, -0.006439208984375, 0.0068359375, 0.004486083984375, 0.0198974609375, 0.0...	[ 44084, 14602, 19943, 864, 4488, 1284, 959, 2633, 39210, 4086, 254, 400, 7008, 6002, 86531, 12877, 3551, 111, 11389, 4734, 30646, 7, 17324, 3229, 115081, 91693, 3509, 39531, 5281, 79315 ]	[ 0.1497802734375, 0.0880126953125, 0.2265625, 0.26171875, 0.1773681640625, 0.1529541015625, 0.1558837890625, 0.2242431640625, 0.10546875, 0.06207275390625, 0.1358642578125, 0.07049560546875, 0.1533203125, 0.0005040168762207031, 0.1170654296875, 0.0760498046875, 0.08111572265625, 0.0...	embed
19739527_c0	19739527	lisp	0	Title: How do I start Hunchentoot? Problem title: How do I start Hunchentoot? Tags: lisp, hunchentoot, common-lisp Problem: How do I start Hunchentoot? How do I start Hunchentoot on a project? I looked over Edi Weitz's guide and everything went smoothly until after installation. The listed tutorials were either broken ...	How do I start Hunchentoot? How do I start Hunchentoot? lisp hunchentoot common-lisp How Hunchentoot How do I start Hunchentoot? How do I start Hunchentoot on a project? I looked over Edi Weitz's guide and everything went smoothly until after installation. The listed tutorials were either broken or skimmed over actual ...	[ -0.002166748046875, 0.007232666015625, 0.00860595703125, 0.0089111328125, -0.01361083984375, -0.00201416015625, 0.00640869140625, -0.01318359375, -0.0086669921875, -0.0240478515625, -0.00555419921875, -0.0032806396484375, -0.007537841796875, 0.02001953125, 0.01556396484375, -0.02722167...	[ 11249, 54, 87, 4034, 10453, 4834, 188, 818, 400, 7008, 1926, 39210, 4086, 254, 98, 13452, 17156, 24374, 17997, 156100, 59720, 145870, 57143, 148431, 9851, 8561, 10723, 127689, 420, 11435, 20600, 42548, 117538, 63773, 5423, 257, 23180, 2046, ...	[ 0.070068359375, 0.043304443359375, 0.0260772705078125, 0.16552734375, 0.18310546875, 0.1912841796875, 0.1983642578125, 0.25244140625, 0.08563232421875, 0.138671875, 0.1552734375, 0.0966796875, 0.07525634765625, 0.1290283203125, 0.03900146484375, 0.099365234375, 0.08056640625, 0.089...	embed
40687700_c0	40687700	lisp	0	Title: In Scheme what's the difference between a number and an object? Problem title: In Scheme what's the difference between a number and an object? Tags: lisp Problem: In Scheme what's the difference between a number and an object? If in Scheme I have something like: one = 1 and the number 1. What would the...	In Scheme what's the difference between a number and an object? In Scheme what's the difference between a number and an object? lisp Scheme In Scheme what's the difference between a number and an object? If in Scheme I have something like: one = 1 and the number 1. What would the difference be between these t...	[ 0.00958251953125, 0.01275634765625, 0.00164794921875, 0.0145263671875, -0.011962890625, 0.008056640625, -0.01318359375, 0.0025634765625, 0.0142822265625, -0.01104736328125, -0.016357421875, -0.031494140625, -0.005279541015625, 0.01177978515625, -0.00823974609375, 0.00176239013671875, ...	[ 360, 34702, 282, 2367, 3768, 70, 60212, 17721, 14012, 136, 142, 36746, 400, 7008, 7, 10, 23, 765, 9844, 1632, 2203, 106, 615, 2806, 6626, 26582, 2843, 4879, 8966, 3065, 707, 28, 15901, 101935 ]	[ 0.0753173828125, 0.2349853515625, 0.219482421875, 0.07220458984375, 0.0699462890625, 0.1192626953125, 0.2379150390625, 0.143310546875, 0.254638671875, 0.1497802734375, 0.057861328125, 0.25634765625, 0.061065673828125, 0.1446533203125, 0.0174560546875, 0.04766845703125, 0.039215087890...	embed
28942009_c0	28942009	lisp	0	Title: combination of pair subsets from a list in lisp Problem title: combination of pair subsets from a list in lisp Tags: subset, list, lisp Problem: combination of pair subsets from a list in lisp How to create all possible pairs subsets from a list in conman lisp. For example the list A contain four elements list A...	combination of pair subsets from a list in lisp combination of pair subsets from a list in lisp subset list lisp a combination of pair subsets from a list in lisp How to create all possible pairs subsets from a list in conman lisp. For example the list A contain four elements Could someone please help me out to generat...	[ -0.004547119140625, 0.023193359375, -0.010009765625, 0.017822265625, -0.0123291015625, 0.02197265625, -0.0267333984375, -0.0079345703125, -0.0087890625, -0.0025482177734375, 0.004486083984375, 0.0091552734375, 0.0255126953125, -0.006500244140625, -0.022216796875, -0.005828857421875, ...	[ 162515, 111, 80836, 1614, 3509, 7, 1295, 5303, 23, 400, 7008, 47, 28282, 756, 7722, 158, 669, 62, 70541, 22759, 80854, 4358, 139392 ]	[ 0.226318359375, 0.037200927734375, 0.267822265625, 0.1932373046875, 0.23583984375, 0.07147216796875, 0.07135009765625, 0.20458984375, 0.070068359375, 0.1260986328125, 0.21435546875, 0.00945281982421875, 0.12213134765625, 0.06121826171875, 0.1326904296875, 0.05322265625, 0.11053466796...	embed
27756741_c0	27756741	lisp	0	Title: how return subarray in Lisp? Problem title: how return subarray in Lisp? Tags: arrays, common-lisp, lisp Problem: how return subarray in Lisp? Is there a way to extract a subarray from an array? That is, a function of three arguments (the array, start index, and end index) that returns the subarray from the spec...	how return subarray in Lisp? how return subarray in Lisp? arrays common-lisp lisp Lisp Arrays.copyOfRange how return subarray in Lisp? Is there a way to extract a subarray from an array? That is, a function of three arguments (the array, start index, and end index) that returns the subarray from the specified indices. ...	[ -0.006500244140625, 0.0004177093505859375, 0.0016632080078125, 0.013671875, -0.0250244140625, -0.0025787353515625, -0.00787353515625, 0.01416015625, 0.01348876953125, -0.00244140625, 0.01226806640625, 0.00469970703125, -0.000217437744140625, 0.01129150390625, 0.01953125, -0.02185058593...	[ 3642, 30646, 166, 88500, 53, 23, 1261, 7008, 32, 10298, 4778, 39210, 4086, 254, 400, 69253, 137366, 132887, 51459, 10, 3917, 47, 125663, 1295, 32354, 17262, 10750, 4034, 63262, 3564, 58735, 136044, 41925, 2965, 28601 ]	[ 0.11517333984375, 0.2230224609375, 0.1529541015625, 0.2109375, 0.2108154296875, 0.06298828125, 0.1697998046875, 0.235595703125, 0.00982666015625, 0.168212890625, 0.1385498046875, 0.08221435546875, 0.1077880859375, 0.16162109375, 0.109619140625, 0.149169921875, 0.04937744140625, 0.0...	embed
66848481_c0	66848481	lisp	0	Title: What's the meaning of `indistinguishable` in Emacs Lisp? Problem title: What's the meaning of `indistinguishable` in Emacs Lisp? Tags: elisp, emacs, lisp Problem: What's the meaning of `indistinguishable` in Emacs Lisp? I was reading the documentation of an Emacs Lisp function called eql : Return t if ...	What's the meaning of `indistinguishable` in Emacs Lisp? What's the meaning of `indistinguishable` in Emacs Lisp? elisp emacs lisp What Emacs Lisp What's the meaning of `indistinguishable` in Emacs Lisp? I was reading the documentation of an Emacs Lisp function called eql : What's the meaning of indistinguish...	[ 0.0089111328125, -0.00933837890625, -0.00238037109375, -0.0033416748046875, 0.00092315673828125, 0.03369140625, -0.0028076171875, 0.00579833984375, 0.0030364990234375, 0.003448486328125, -0.0009613037109375, 0.0042724609375, -0.0126953125, 0.0072021484375, -0.01397705078125, -0.0064697...	[ 4865, 3768, 70, 91084, 19904, 7, 34971, 4745, 2886, 23, 85269, 4439, 1261, 7008, 15296, 352, 2263, 400, 111, 209806, 32354, 28, 99247, 106985, 3688, 187136 ]	[ 0.050323486328125, 0.0751953125, 0.037994384765625, 0.1746826171875, 0.1263427734375, 0.0672607421875, 0.1767578125, 0.14306640625, 0.207763671875, 0.026641845703125, 0.155517578125, 0.158203125, 0.1390380859375, 0.1881103515625, 0.0209808349609375, 0.05303955078125, 0.08221435546875...	embed
19196463_c0	19196463	lisp	0	Title: Whats the difference between '((1 2)(3 4)) and '('(1 2 )'(3 4)) in lisp? Problem title: Whats the difference between '((1 2)(3 4)) and '('(1 2 )'(3 4)) in lisp? Tags: lisp, common-lisp Problem: Whats the difference between '((1 2)(3 4)) and '('(1 2 )'(3 4)) in lisp? The le...	Whats the difference between '((1 2)(3 4)) and '('(1 2 )'(3 4)) in lisp? Whats the difference between '((1 2)(3 4)) and '('(1 2 )'(3 4)) in lisp? lisp common-lisp Whats Whats the difference between '((1 2)(3 4)) and '('(1 2 )'(3 4)) in lisp? The length of is being show 2 while th...	[ 0.00909423828125, 0.0203857421875, -0.01544189453125, 0.023193359375, -0.0020599365234375, 0.0255126953125, 0.01416015625, 0.0196533203125, 0.028076171875, -0.0234375, -0.0125732421875, -0.021240234375, 0.00726318359375, 0.01025390625, -0.0146484375, 0.01263427734375, 0.0025939941406...	[ 60212, 17721, 3768, 41600, 4958, 86827, 13956, 136, 116, 400, 7008, 39210, 4086, 254, 70, 23, 140909, 111, 7639, 12960, 5701, 26785, 127887, 615, 5117, 125195, 20653, 33636 ]	[ 0.21240234375, 0.0906982421875, 0.1292724609375, 0.08837890625, 0.1683349609375, 0.1309814453125, 0.227294921875, 0.0791015625, 0.16162109375, 0.114990234375, 0.1866455078125, 0.0880126953125, 0.0865478515625, 0.11376953125, 0.01666259765625, 0.041259765625, 0.146240234375, 0.14355...	embed
4868375_c0	4868375	lisp	0	Title: Is there anything like Lisp's SLIME for Python/Django? Problem title: Is there anything like Lisp's SLIME for Python/Django? Tags: python, slime, lisp, django Problem: Is there anything like Lisp's SLIME for Python/Django? I know about the Django console and it's useful to an extent but it would be rea...	Is there anything like Lisp's SLIME for Python/Django? Is there anything like Lisp's SLIME for Python/Django? python slime lisp django Lisp SLIME Python Django Is there anything like Lisp's SLIME for Python/Django? I know about the Django console and it's useful to an extent but it would be really nice to be ...	[ 0.005218505859375, 0.01953125, -0.0101318359375, 0.003997802734375, -0.0250244140625, 0.007568359375, -0.0012664794921875, 0.0023040771484375, 0.00030517578125, -0.0294189453125, 0.01031494140625, -0.00058746337890625, -0.0072021484375, 0.0111083984375, 0.006866455078125, 0.00379943847...	[ 2071, 2685, 23937, 1884, 1261, 7008, 3768, 7, 42135, 66820, 100, 145581, 30630, 31, 397, 17198, 50828, 34264, 13, 400, 107473, 27803, 39424, 3714, 130250, 80234, 2806, 6183, 26267, 27211, 18151, 9803, 46844, 85269, 4439, 33493, 35782 ]	[ 0.00006103515625, 0.03167724609375, 0.10687255859375, 0.13623046875, 0.1802978515625, 0.2490234375, 0.051971435546875, 0.06982421875, 0.2197265625, 0.2880859375, 0.09405517578125, 0.270751953125, 0.139404296875, 0.181396484375, 0.0302734375, 0.08331298828125, 0.112060546875, 0.1918...	embed
26835587_c0	26835587	lisp	0	Title: LISP: Removing elements from list already existing in another Problem title: LISP: Removing elements from list already existing in another Tags: remove-if, project, list, lisp, duplicates Problem: LISP: Removing elements from list already existing in another Can anybody explain to me why this: (remove-if #'(lamb...	LISP: Removing elements from list already existing in another LISP: Removing elements from list already existing in another remove-if project list lisp duplicates list LISP Removing LISP: Removing elements from list already existing in another Can anybody explain to me why this: returns this: but this: returns this: ?	[ -0.01129150390625, 0.031494140625, -0.00616455078125, 0.03125, -0.0087890625, 0.0067138671875, 0.0257568359375, 0.0233154296875, 0.01458740234375, -0.022216796875, -0.01129150390625, 0.00823974609375, 0.0064697265625, -0.00323486328125, -0.007598876953125, -0.002685546875, -0.0014953...	[ 16970, 9434, 853, 432, 6496, 80854, 1295, 5303, 21771, 144573, 15700, 87388, 3190, 13452, 400, 7008, 171763, 1636, 23, 73342, 15400, 30646, 7, 903, 1284 ]	[ 0.1258544921875, 0.206787109375, 0.0294952392578125, 0.130859375, 0.0484619140625, 0.1492919921875, 0.088623046875, 0.1597900390625, 0.0994873046875, 0.171142578125, 0.06298828125, 0.1400146484375, 0.10107421875, 0.09466552734375, 0.1163330078125, 0.171630859375, 0.181884765625, 0....	embed
8145008_c0	8145008	lisp	0	Title: How to parse a string as a list structure? Problem title: How to parse a string as a list structure? Tags: common-lisp, lisp Problem: How to parse a string as a list structure? I have a string, which holds a a list structure like ((p X) (q (f X))) and I would really like to find a function that interprets/conver...	How to parse a string as a list structure? How to parse a string as a list structure? common-lisp lisp How How to parse a string as a list structure? I have a string, which holds a a list structure like ((p X) (q (f X))) and I would really like to find a function that interprets/converts this string as a list of lists ...	[ -0.0054931640625, 0.0096435546875, -0.017822265625, 0.019287109375, -0.0125732421875, 0.045654296875, 0.0036163330078125, -0.008544921875, -0.0004024505615234375, -0.026611328125, -0.0050048828125, -0.01043701171875, -0.01708984375, -0.0035858154296875, -0.01214599609375, 0.0166015625,...	[ 11249, 47, 366, 184, 79315, 237, 10, 5303, 45646, 39210, 4086, 254, 400, 7008, 16401, 1193, 864, 420, 6183, 1884, 7413, 32354, 29481, 11549, 6562, 30482, 11001, 12830, 10433, 19, 155648, 23, 26582 ]	[ 0.07891845703125, 0.05145263671875, 0.1717529296875, 0.158447265625, 0.26611328125, 0.1480712890625, 0.0938720703125, 0.22314453125, 0.26318359375, 0.1199951171875, 0.06842041015625, 0.1383056640625, 0.0721435546875, 0.1629638671875, 0.064208984375, 0.09161376953125, 0.095458984375, ...	embed
59635690_c0	59635690	lisp	0	Title: How to debug quickloaded library in sbcl Problem title: How to debug quickloaded library in sbcl Tags: sbcl, lisp, common-lisp Problem: How to debug quickloaded library in sbcl I’m running into the exact same problem as this question , and I was wondering: given that sbcl drops you into a debugger repl when this...	How to debug quickloaded library in sbcl How to debug quickloaded library in sbcl sbcl lisp common-lisp How How to debug quickloaded library in sbcl I’m running into the exact same problem as this question , and I was wondering: given that sbcl drops you into a debugger repl when this happens, what is the best way to g...	[ 0.004180908203125, 0.00244140625, -0.01348876953125, 0.000720977783203125, -0.023681640625, 0.0020599365234375, 0.008544921875, 0.023193359375, 0.005523681640625, -0.0303955078125, -0.0084228515625, -0.0206298828125, 0.00982666015625, -0.01031494140625, 0.0091552734375, -0.007415771484...	[ 11249, 47, 8, 85779, 63773, 63033, 297, 35773, 1294, 23, 91, 275, 34937, 400, 7008, 39210, 4086, 254, 36069, 3934, 978, 21407, 456, 2424, 2965, 63134, 105727, 65514, 10484, 59335, 26484, 157318 ]	[ 0.04833984375, 0.029815673828125, 0.13818359375, 0.248779296875, 0.1241455078125, 0.205810546875, 0.07080078125, 0.1612548828125, 0.100830078125, 0.041015625, 0.049407958984375, 0.07855224609375, 0.172119140625, 0.037750244140625, 0.13232421875, 0.110595703125, 0.041595458984375, 0...	embed
48484178_c0	48484178	lisp	0	Title: Guile scheme cond ERROR: Wrong type to apply: (1 2 3 4) Problem title: Guile scheme cond ERROR: Wrong type to apply: (1 2 3 4) Tags: scheme, list, lisp Problem: Guile scheme cond ERROR: Wrong type to apply: (1 2 3 4) I am playing with scheme and puzzled in to this crazy issue (define func((lambda N lst) (if(eq? ...	Guile scheme cond ERROR: Wrong type to apply: (1 2 3 4) Guile scheme cond ERROR: Wrong type to apply: (1 2 3 4) scheme list lisp Guile ERROR Wrong Guile scheme cond ERROR: Wrong type to apply: (1 2 3 4) I am playing with scheme and puzzled in to this crazy issue calling function got following error when I called functi...	[ -0.021240234375, 0.0157470703125, 0.007476806640625, 0.003448486328125, 0.0091552734375, 0.0155029296875, 0.0155029296875, 0.015625, -0.01202392578125, -0.0224609375, 0.004669189453125, -0.035888671875, -0.01904296875, -0.0201416015625, 0.00250244140625, -0.000152587890625, -0.001464...	[ 53513, 133, 150370, 158, 71, 151206, 24638, 601, 35133, 10644, 47, 59911, 138, 13956, 5303, 400, 7008, 75169, 104192, 116666, 31089, 159029, 32354, 25632, 18499, 3229, 35839 ]	[ 0.1851806640625, 0.2161865234375, 0.2247314453125, 0.1285400390625, 0.10205078125, 0.1527099609375, 0.12310791015625, 0.0108489990234375, 0.1314697265625, 0.17333984375, 0.009552001953125, 0.1268310546875, 0.0266265869140625, 0.10308837890625, 0.11199951171875, 0.04071044921875, 0.11...	embed
20139672_c0	20139672	lisp	0	Title: Is assoc just syntax sugar for find? Problem title: Is assoc just syntax sugar for find? Tags: lisp, common-lisp Problem: Is assoc just syntax sugar for find? CL-USER> mylist ((RED . 5) (RED . 4) (RED . 3) (BLUE . 5) (RED . 2) (BLUE . 4)) CL-USER> (assoc 'blue mylist) (BLUE . 5) CL-USER> (find 'blue mylist...	Is assoc just syntax sugar for find? Is assoc just syntax sugar for find? lisp common-lisp CL-USER RED BLUE Is assoc just syntax sugar for find? It would seem to me that assoc is just a particular case of find , is this true or am I missing some extra functionality from assoc that is not apparent here?	[ -0.0025482177734375, 0.00531005859375, 0.0093994140625, -0.01153564453125, -0.00830078125, 0.000591278076171875, 0.0123291015625, 0.0142822265625, 0.0177001953125, -0.0137939453125, 0.0078125, 0.007080078125, 0.00738525390625, -0.01483154296875, 0.000301361083984375, -0.00677490234375,...	[ 2071, 63927, 238, 1660, 6002, 86531, 101087, 100, 7413, 400, 7008, 39210, 4086, 254, 46323, 1062, 50184, 118790, 210851, 48903, 83, 17311, 7225, 111, 29568, 132283, 4173, 123309, 173676, 3688 ]	[ 0.01178741455078125, 0.201171875, 0.223388671875, 0.06927490234375, 0.1409912109375, 0.1856689453125, 0.2384033203125, 0.0643310546875, 0.2120361328125, 0.086669921875, 0.155029296875, 0.1278076171875, 0.061004638671875, 0.132080078125, 0.059356689453125, 0.100830078125, 0.0992431640...	embed
56112596_c0	56112596	lisp	0	Title: How to write macro expand in custom defined LISP in JavaScript Problem title: How to write macro expand in custom defined LISP in JavaScript Tags: macros, lisp, lisp-macros, javascript Problem: How to write macro expand in custom defined LISP in JavaScript Code signals: How, LISP, JavaScript, macro_expand, Pair,...	How to write macro expand in custom defined LISP in JavaScript How to write macro expand in custom defined LISP in JavaScript macros lisp lisp-macros javascript How LISP JavaScript macro_expand Pair node.car Symbol env.get Macro value.defmacro value.invoke node.cdr new_code code.toString new_code.toString new_code.car ...	[ 0.00970458984375, 0.0096435546875, -0.026611328125, 0.037841796875, -0.005523681640625, 0.0267333984375, -0.0029754638671875, 0.0211181640625, 0.011962890625, -0.028564453125, 0.0093994140625, -0.0179443359375, 0.0108642578125, -0.0177001953125, 0.01226806640625, -0.01416015625, 0.00...	[ 11249, 33022, 111789, 71062, 23, 114122, 61924, 16970, 9434, 17925, 400, 7008, 35572, 3666, 136951, 83613, 2940, 1342, 110, 112, 3284, 131899, 334, 3794, 4727, 516, 34292, 15322, 23253, 7569, 40899, 18151, 29713, 10588, 106357, 84079, 70820, ...	[ 0.0631103515625, 0.19189453125, 0.248046875, 0.290771484375, 0.050994873046875, 0.1500244140625, 0.17138671875, 0.15380859375, 0.2176513671875, 0.23828125, 0.1180419921875, 0.1715087890625, 0.026153564453125, 0.0809326171875, 0.17626953125, 0.1846923828125, 0.1778564453125, 0.06719...	embed
3526497_c0	3526497	lisp	0	Title: Scheme or Common Lisp? Problem title: Scheme or Common Lisp? Tags: scheme, programming-languages, lisp, common-lisp Problem: Scheme or Common Lisp? I am an intermediate programmer, and have decided to learn either common lisp or scheme. My question is simple, which one would you choose? I don't care much for the...	Scheme or Common Lisp? Scheme or Common Lisp? scheme programming-languages lisp common-lisp Scheme Common Lisp Scheme or Common Lisp? I am an intermediate programmer, and have decided to learn either common lisp or scheme. My question is simple, which one would you choose? I don't care much for the difficulty of the sy...	[ 0.01226806640625, 0.0242919921875, 0.00107574462890625, 0.02490234375, -0.0238037109375, -0.00689697265625, -0.01483154296875, -0.0019989013671875, 0.0079345703125, -0.0255126953125, 0.00897216796875, -0.004119873046875, -0.005859375, -0.002899169921875, -0.00634765625, -0.012878417968...	[ 34702, 282, 707, 151301, 1261, 7008, 32, 150370, 56037, 449, 196651, 400, 39210, 4086, 254, 81814, 2182, 77848, 68872, 30698, 40101, 9655, 8781, 3129, 1632, 2806, 398, 55076, 517, 34844, 6002, 86531, 14537, 71985, 46876, 208124 ]	[ 0.263427734375, 0.25341796875, 0.1236572265625, 0.2171630859375, 0.210693359375, 0.2388916015625, 0.0239715576171875, 0.289794921875, 0.12060546875, 0.03521728515625, 0.1275634765625, 0.1678466796875, 0.1798095703125, 0.1409912109375, 0.1607666015625, 0.07958984375, 0.0594482421875, ...	embed
35323798_c0	35323798	lisp	0	Title: Compute euclidean distance with mapcar and apply Problem title: Compute euclidean distance with mapcar and apply Tags: common-lisp, lisp Problem: Compute euclidean distance with mapcar and apply I am trying to create a function that computes this using apply and mapcar. I am stuck after using the first mapcar to...	Compute euclidean distance with mapcar and apply Compute euclidean distance with mapcar and apply common-lisp lisp Compute Compute euclidean distance with mapcar and apply I am trying to create a function that computes this using apply and mapcar. I am stuck after using the first mapcar to get all the differences of p-...	[ 0.003997802734375, 0.01202392578125, 0.015869140625, 0.005035400390625, -0.0103759765625, 0.0228271484375, 0.00079345703125, 0.011474609375, 0.00714111328125, -0.052734375, 0.0146484375, -0.006195068359375, 0.008056640625, -0.00174713134765625, -0.046142578125, -0.0146484375, 0.00521...	[ 159415, 13, 1175, 34937, 130265, 62488, 678, 22288, 3284, 136, 59911, 39210, 4086, 254, 400, 7008, 31577, 28282, 32354, 375, 7077, 17368, 179933, 5117, 2046, 756, 60212, 915, 9, 864, 23, 5303, 11249, 54, 87, 108047, 80854, 10554, 1257 ]	[ 0.1776123046875, 0.0762939453125, 0.06634521484375, 0.13037109375, 0.1702880859375, 0.244384765625, 0.103515625, 0.1728515625, 0.25927734375, 0.052337646484375, 0.220947265625, 0.1171875, 0.064697265625, 0.1326904296875, 0.0662841796875, 0.1463623046875, 0.034698486328125, 0.026977...	embed
21895659_c1	21895659	lisp	1	identify n number of initialize-instance methods per class and per any number of arguments. (defmethod initialize-instance :after ((f foo) &key) ()) but it is not clear to me how I can translate this to the vanilla example I gave above. And I feel like I could be barking up the wrong tree since this is part of MOP. Co...	identify n number of initialize-instance methods per class and per any number of arguments. (defmethod initialize-instance :after ((f foo) &key) ()) but it is not clear to me how I can translate this to the vanilla example I gave above. And I feel like I could be barking up the wrong tree since this is part of MOP. Co...	[ 0.019287109375, 0.01416015625, 0.0031890869140625, -0.000850677490234375, 0.00933837890625, 0.0032958984375, 0.0162353515625, -0.0076904296875, 0.036865234375, -0.005950927734375, -0.0264892578125, -0.032958984375, 0.0020599365234375, 0.021240234375, -0.01458740234375, -0.02392578125, ...	[ 135812, 653, 14012, 111, 61475, 20650, 73, 116071, 150624, 117, 18507, 10750, 112, 420, 1928, 7352, 46327, 60494, 5775, 31, 619, 19770, 34735, 3900, 19309, 47, 131, 2298, 27781, 36917, 12319, 5809, 1909, 6048, 70, 44691, 53201, 2831, 276, ...	[ 0.1771240234375, 0.062255859375, 0.1265869140625, 0.0517578125, 0.2264404296875, 0.1898193359375, 0.1317138671875, 0.2325439453125, 0.253173828125, 0.094970703125, 0.218994140625, 0.2083740234375, 0.03369140625, 0.1427001953125, 0.130859375, 0.15380859375, 0.159912109375, 0.0269317...	embed
8670207_c0	8670207	lisp	0	Title: when to quote symbol in Emacs Lisp Problem title: when to quote symbol in Emacs Lisp Tags: elisp, lisp, emacs Problem: when to quote symbol in Emacs Lisp I've beginning learning programming with Emacs Lisp. I'm so confused by symbol quotation. For example: (progn (setq a '(1 2)) (prin1 a) (add-to-list 'a 3) (pri...	when to quote symbol in Emacs Lisp when to quote symbol in Emacs Lisp elisp lisp emacs Emacs Lisp prin1 when to quote symbol in Emacs Lisp I've beginning learning programming with Emacs Lisp. I'm so confused by symbol quotation. For example: why the "add-to-list" function need a quoted symbol as its first argument, whi...	[ 0.011962890625, 0.00726318359375, 0.00157928466796875, 0.0113525390625, -0.031494140625, 0.010498046875, -0.00555419921875, 0.023193359375, -0.004241943359375, 0.003143310546875, -0.01239013671875, -0.003997802734375, -0.029052734375, 0.0106201171875, -0.01708984375, 0.006011962890625,...	[ 3229, 47, 66747, 26582, 23, 85269, 4439, 1261, 7008, 15296, 400, 352, 2263, 2448, 52080, 56037, 55681, 81732, 1363, 15400, 4028, 188, 6562, 32354, 3871, 71, 237, 5117, 10750, 3509, 3284, 136, 7332, 127, 110 ]	[ 0.1192626953125, 0.0531005859375, 0.261474609375, 0.264404296875, 0.0478515625, 0.1448974609375, 0.1455078125, 0.1265869140625, 0.2139892578125, 0.01239013671875, 0.058380126953125, 0.0169677734375, 0.04046630859375, 0.0689697265625, 0.00958251953125, 0.08099365234375, 0.052886962890...	embed
13723402_c0	13723402	lisp	0	Title: Counting numbers or characters in list in Scheme Problem title: Counting numbers or characters in list in Scheme Tags: scheme, list, lisp, counting Problem: Counting numbers or characters in list in Scheme does anyone know how to count all numbers or characters in list and print it in pair in this format: (numbe...	Counting numbers or characters in list in Scheme Counting numbers or characters in list in Scheme scheme list lisp counting Counting Scheme Counting numbers or characters in list in Scheme does anyone know how to count all numbers or characters in list and print it in pair in this format: (number . number_of_occurrence...	[ 0.001312255859375, 0.01007080078125, -0.0086669921875, 0.018798828125, 0.00567626953125, 0.0034637451171875, -0.0224609375, -0.017822265625, 0.005706787109375, -0.0206298828125, -0.0068359375, -0.037353515625, 0.0244140625, 0.020263671875, -0.0118408203125, -0.0322265625, -0.00311279...	[ 1311, 128396, 101935, 707, 124850, 23, 5303, 34702, 282, 150370, 400, 7008, 54529, 214, 35672, 3714, 3642, 47, 756, 28412, 442, 80836, 903, 9384, 2606, 1297, 5, 14012, 4390, 6652, 64240, 27781, 129745, 120592 ]	[ 0.153076171875, 0.199462890625, 0.22607421875, 0.07305908203125, 0.21875, 0.09259033203125, 0.22900390625, 0.1905517578125, 0.1861572265625, 0.2271728515625, 0.08099365234375, 0.15869140625, 0.240478515625, 0.03936767578125, 0.043212890625, 0.11297607421875, 0.09490966796875, 0.058...	embed
1960207_c0	1960207	lisp	0	Title: A list of functions Problem title: A list of functions Tags: lisp, scheme, functional-programming Problem: A list of functions Is there a way to make a list that holds functions? What I'm trying to do is, make a list of some arithmetic operators (+ - * /) so I can easily manipulate their order and apply them to ...	A list of functions A list of functions lisp scheme functional-programming A list of functions Is there a way to make a list that holds functions? What I'm trying to do is, make a list of some arithmetic operators (+ - * /) so I can easily manipulate their order and apply them to a list of numbers. So, if I have that l...	[ 0.00689697265625, 0.0038299560546875, 0.00168609619140625, -0.01123046875, -0.0079345703125, 0.002227783203125, -0.0037689208984375, -0.00640869140625, 0.001068115234375, -0.055419921875, -0.00167083740234375, -0.0242919921875, -0.00946044921875, 0.006591796875, -0.00872802734375, 0.00...	[ 62, 5303, 111, 32354, 7, 400, 7008, 150370, 123309, 28966, 2685, 10, 3917, 47, 3249, 450, 16401, 31577, 8962, 282, 9523, 39933, 22183, 20, 661, 248, 831, 72546, 45258, 12989, 59911, 101935, 765, 71, 4527, 1884, 903, 39, 95968, 77848, 11...	[ 0.0543212890625, 0.2685546875, 0.0968017578125, 0.263671875, 0.1241455078125, 0.084716796875, 0.173095703125, 0.1552734375, 0.161865234375, 0.1187744140625, 0.03851318359375, 0.0916748046875, 0.10284423828125, 0.01104736328125, 0.12060546875, 0.033843994140625, 0.1912841796875, 0.0...	embed
1007250_c0	1007250	lisp	0	Title: Which dialect of Lisp should I learn? Problem title: Which dialect of Lisp should I learn? Tags: lisp, dialect Problem: Which dialect of Lisp should I learn? I know there are a few different dialects of Lisp. Having decided that learning Lisp would be a new intellectual experience, I would like to know which Lis...	Which dialect of Lisp should I learn? Which dialect of Lisp should I learn? lisp dialect Which Lisp Which dialect of Lisp should I learn? I know there are a few different dialects of Lisp. Having decided that learning Lisp would be a new intellectual experience, I would like to know which Lisp dialect to learn, and why...	[ 0.013916015625, 0.004058837890625, 0.00927734375, 0.0233154296875, -0.01007080078125, 0.0034332275390625, 0, 0.0014495849609375, 0.0048828125, 0.01043701171875, -0.0011749267578125, -0.0299072265625, -0.00897216796875, 0.00799560546875, -0.003509521484375, 0.001678466796875, -0.01086...	[ 130078, 220734, 111, 1261, 7008, 5608, 87, 30698, 400, 10846, 12921, 52080, 91768, 16981, 1884, 3714, 3129, 47, 15400, 1286, 5700, 131801, 11522, 12937, 8060, 38280, 158, 903 ]	[ 0.1368408203125, 0.26611328125, 0.08447265625, 0.1953125, 0.23193359375, 0.151123046875, 0.07244873046875, 0.16259765625, 0.1553955078125, 0.022674560546875, 0.1007080078125, 0.1046142578125, 0.06207275390625, 0.065185546875, 0.00927734375, 0.006622314453125, 0.053131103515625, 0.0...	embed
71551767_c1	71551767	lisp	1	") (values hours minutes))))) (struct AM/PM 24HourClock (meridiem) #:transparent #:guard (lambda (hours minutes meridiem err_name) (if (not(and(and(number? hours)(> hours 0)(<= hours 12)(number? minutes)))) (error err_name "Hours must be between 1 and 12 : 0") (if [not (and(string? meridiem)(or (equal? meridiem "am") (...	") (values hours minutes))))) (struct AM/PM 24HourClock (meridiem) #:transparent #:guard (lambda (hours minutes meridiem err_name) (if (not(and(and(number? hours)(> hours 0)(<= hours 12)(number? minutes)))) (error err_name "Hours must be between 1 and 12 : 0") (if [not (and(string? meridiem)(or (equal? meridiem "am") (...	[ -0.00262451171875, 0.00555419921875, 0.0021209716796875, 0.009521484375, 0.0133056640625, -0.0019378662109375, -0.011962890625, -0.01611328125, 0.0155029296875, 0.0264892578125, 0.0025634765625, -0.01300048828125, 0.0242919921875, -0.0030517578125, 0.00174713134765625, -0.0002384185791...	[ 44, 16, 27494, 90, 21974, 14633, 80126, 36716, 9677, 64, 20266, 744, 11193, 474, 441, 21135, 30547, 428, 195, 30145, 99547, 32116, 6492, 85, 497, 12824, 15632, 72, 42, 11627, 3190, 10869, 2940, 2606, 2740, 757, 427, 1297, 188800, 8110, ...	[ 0.1136474609375, 0.065673828125, 0.186279296875, 0.07781982421875, 0.266845703125, 0.284423828125, 0.1485595703125, 0.212890625, 0.1561279296875, 0.1285400390625, 0.20166015625, 0.2032470703125, 0.198974609375, 0.1673583984375, 0.0831298828125, 0.24462890625, 0.1309814453125, 0.120...	embed
74071649_c3	74071649	lisp	3	FEKTIONSKRANKHEITEN, HEPATITIS-B, STAUPE, JAPANISCHE-ENZEPHALITIS, INFLUENZA, INFEKTIOESE-BURSITIS-DER-HUEHNER, EIGENSCHAFTEN, ADAPTOGEN, ANTIBAKTERIELL, ANTIHEPATOTOXISCH, ANTIVIRAL, KARDIOPROTEKTIV, DIURETIKUM, BLUTDRUCKSENKEND, IMMUNSTAERKER, VERBESSERN, BLUTKREISLAUF, IMMUNFUNKTION, VERRINGERN, VIRALEN-INFEKTIONEN,...	FEKTIONSKRANKHEITEN, HEPATITIS-B, STAUPE, JAPANISCHE-ENZEPHALITIS, INFLUENZA, INFEKTIOESE-BURSITIS-DER-HUEHNER, EIGENSCHAFTEN, ADAPTOGEN, ANTIBAKTERIELL, ANTIHEPATOTOXISCH, ANTIVIRAL, KARDIOPROTEKTIV, DIURETIKUM, BLUTDRUCKSENKEND, IMMUNSTAERKER, VERBESSERN, BLUTKREISLAUF, IMMUNFUNKTION, VERRINGERN, VIRALEN-INFEKTIONEN,...	[ 0.00035858154296875, -0.01116943359375, -0.0198974609375, -0.0018463134765625, 0.006744384765625, -0.00787353515625, -0.004791259765625, 0.00384521484375, 0.00396728515625, 0.0302734375, 0.00909423828125, 0.0037384033203125, -0.0211181640625, -0.00003814697265625, -0.00994873046875, -0...	[ 563, 15567, 165117, 30174, 74229, 31381, 21170, 4, 27544, 65135, 35522, 294, 571, 64174, 18409, 647, 226403, 9956, 48858, 11572, 19157, 54259, 20296, 80091, 5881, 919, 22335, 178317, 30018, 139980, 112045, 18044, 27204, 51675, 52952, 89190, 390...	[ 0.1239013671875, 0.1756591796875, 0.14501953125, 0.2071533203125, 0.102294921875, 0.0970458984375, 0.163330078125, 0.08660888671875, 0.1505126953125, 0.14453125, 0.1639404296875, 0.09405517578125, 0.1390380859375, 0.1444091796875, 0.1380615234375, 0.1324462890625, 0.1463623046875, ...	embed
41131196_c0	41131196	lisp	0	Title: LISP - sequence of integers Problem title: LISP - sequence of integers Tags: list, lisp Problem: LISP - sequence of integers Does exist a function in LISP for making a sequence of integers like (0 1 2 3) ? I found make-sequence , but I didn't find out how to make a sequence of integers. I tried make-list and not...	LISP - sequence of integers LISP - sequence of integers list lisp LISP LISP - sequence of integers Does exist a function in LISP for making a sequence of integers like (0 1 2 3) ? I found make-sequence , but I didn't find out how to make a sequence of integers. I tried make-list and nothing. I know that in Scheme exist...	[ 0.002777099609375, 0.0390625, -0.0162353515625, 0.010009765625, 0.00185394287109375, 0.02392578125, -0.0118408203125, 0.01519775390625, -0.00005245208740234375, -0.028564453125, -0.00848388671875, -0.00787353515625, -0.001800537109375, 0.025634765625, -0.003997802734375, -0.01068115234...	[ 16970, 9434, 40, 944, 3956, 892, 26255, 111, 5303, 400, 7008, 101790, 32316, 10, 32354, 23, 100, 20662, 1884, 22085, 106, 116, 8439, 14037, 3249, 184, 7413, 1810, 3642, 47, 37842, 6562, 33720, 34702, 282, 177149, 9, 190, 6492, 85, 425, ...	[ 0.1595458984375, 0.25537109375, 0.0928955078125, 0.1788330078125, 0.06884765625, 0.1790771484375, 0.1689453125, 0.053863525390625, 0.1639404296875, 0.1138916015625, 0.182373046875, 0.023223876953125, 0.1302490234375, 0.06005859375, 0.2259521484375, 0.0863037109375, 0.06414794921875, ...	embed
47884250_c0	47884250	lisp	0	Title: How to work with specific range of numbers in lists in scheme? Problem title: How to work with specific range of numbers in lists in scheme? Tags: racket, list, lisp, scheme Problem: How to work with specific range of numbers in lists in scheme? I'm learning scheme and I would like to know how to remove, for exa...	How to work with specific range of numbers in lists in scheme? How to work with specific range of numbers in lists in scheme? racket list lisp scheme How How to work with specific range of numbers in lists in scheme? I'm learning scheme and I would like to know how to remove, for example the negative numbers of a list ...	[ -0.025390625, 0.019287109375, -0.00262451171875, 0.0035858154296875, -0.0054931640625, 0.01007080078125, 0.0181884765625, 0.02783203125, 0.00445556640625, 0.009521484375, -0.0018463134765625, -0.004119873046875, -0.0181884765625, -0.006439208984375, -0.00119781494140625, 0.000503540039...	[ 11249, 47, 4488, 678, 29458, 37457, 101935, 23, 5303, 7, 150370, 673, 27853, 400, 7008, 52080, 1884, 3714, 3642, 87388, 40907, 111, 24491, 24189, 5036, 4163, 468, 64457, 49146, 6496, 18151 ]	[ 0.09173583984375, 0.051177978515625, 0.1534423828125, 0.135498046875, 0.185302734375, 0.188232421875, 0.191162109375, 0.0792236328125, 0.22216796875, 0.0933837890625, 0.2342529296875, 0.044830322265625, 0.1571044921875, 0.06689453125, 0.157958984375, 0.0269927978515625, 0.02661132812...	embed
67533882_c1	67533882	lisp	1	place-image cat1 (tock x) Y-cat1 BACKGROUND)])) #new version (define (render x) (cond [(< (tock x) RESTART-POINT) (place-image cat1 (tock x) Y-cat1 BACKGROUND)] [(>= (tock x) RESTART-POINT) (place-image cat1 (modulo(tock x)RESTART-POINT) Y-cat1 BACKGROUND)])) This runs the pic of a cat across the screen, but the cat ne...	place-image cat1 (tock x) Y-cat1 BACKGROUND)])) #new version (define (render x) (cond [(< (tock x) RESTART-POINT) (place-image cat1 (tock x) Y-cat1 BACKGROUND)] [(>= (tock x) RESTART-POINT) (place-image cat1 (modulo(tock x)RESTART-POINT) Y-cat1 BACKGROUND)])) This runs the pic of a cat across the screen, but the cat ne...	[ -0.01214599609375, 0.011962890625, -0.010009765625, -0.00057220458984375, 0.0218505859375, -0.0069580078125, -0.0074462890625, -0.01043701171875, 0.0035400390625, -0.0133056640625, -0.004486083984375, -0.005889892578125, -0.000476837158203125, -0.0078125, 0.0031280517578125, -0.0009460...	[ 3687, 37926, 7515, 418, 188, 2594, 1022, 990, 4460, 8678, 20572, 136498, 34384, 54936, 11389, 64552, 18280, 42, 2271, 71, 16093, 627, 21828, 47136, 9698, 59537, 23935, 83279, 34465, 37142, 3293, 127877, 70, 8834, 111, 36880, 49119, 1284, 83...	[ 0.1689453125, 0.20263671875, 0.236083984375, 0.098388671875, 0.0946044921875, 0.0772705078125, 0.1265869140625, 0.10791015625, 0.177734375, 0.088134765625, 0.0684814453125, 0.1343994140625, 0.08831787109375, 0.01788330078125, 0.08184814453125, 0.1016845703125, 0.107177734375, 0.036...	embed
13107051_c0	13107051	lisp	0	Title: Writing C code in Lisp Problem title: Writing C code in Lisp Tags: root, c, lisp Problem: Writing C code in Lisp Recently I have had to write code in C as the platform I am using for a project I am undertaking- namely root- uses a C/C++ command line interpreter (CINT). However, I want to remain coding in Lisp. I...	Writing C code in Lisp Writing C code in Lisp root c lisp Writing Lisp Writing C code in Lisp Recently I have had to write code in C as the platform I am using for a project I am undertaking- namely root- uses a C/C++ command line interpreter (CINT). However, I want to remain coding in Lisp. In 'ANSI Common Lisp' Graha...	[ 0.011474609375, 0.0223388671875, 0.002685546875, 0.0093994140625, -0.0050048828125, 0.00677490234375, 0.0087890625, -0.005828857421875, -0.0011138916015625, -0.0419921875, -0.01361083984375, 0.01171875, -0.0029144287109375, 0.005859375, 0.00057220458984375, 0.000240325927734375, -0.0...	[ 213185, 313, 18151, 23, 1261, 7008, 74855, 501, 400, 33022, 13651, 17368, 13452, 4527, 64, 37223, 75101, 13315, 29481, 56, 59537, 3444, 47, 47143, 552, 6238, 48789, 568, 151301, 147756, 831, 162515, 619, 16321, 11752, 29954, 7722, 1632, 54 ...	[ 0.14208984375, 0.170654296875, 0.2318115234375, 0.0743408203125, 0.177490234375, 0.232177734375, 0.189453125, 0.126220703125, 0.1383056640625, 0.1431884765625, 0.1168212890625, 0.0635986328125, 0.047637939453125, 0.0166778564453125, 0.0295867919921875, 0.139404296875, 0.10400390625, ...	embed
26902224_c0	26902224	lisp	0	Title: why `and` operator in scheme is not an built-in procedure Problem title: why `and` operator in scheme is not an built-in procedure Tags: lisp, scheme Problem: why `and` operator in scheme is not an built-in procedure I use chicken Scheme interpreter, and when I type not , it returns #<procedure (not x295)> , but...	why `and` operator in scheme is not an built-in procedure why `and` operator in scheme is not an built-in procedure lisp scheme x295 Error why `and` operator in scheme is not an built-in procedure I use chicken Scheme interpreter, and when I type not , it returns #<procedure (not x295)> , but when I tried and and or , ...	[ -0.003326416015625, 0.01129150390625, 0.017822265625, 0.0113525390625, -0.0157470703125, 0.0198974609375, -0.010009765625, -0.00909423828125, -0.0030975341796875, -0.015869140625, -0.01708984375, -0.035400390625, -0.00628662109375, -0.0240478515625, 0.0133056640625, -0.01043701171875, ...	[ 15400, 2940, 39933, 23, 150370, 83, 959, 88303, 73, 50491, 400, 7008, 304, 8821, 212059, 142, 143896, 34702, 282, 29481, 56, 10644, 30646, 232578, 10869, 1022, 108035, 87, 37842, 136, 707, 51, 99091, 77336, 10, 12921, 29568, 420, 151575 ]	[ 0.0931396484375, 0.2587890625, 0.25341796875, 0.05841064453125, 0.2210693359375, 0.0653076171875, 0.1527099609375, 0.1331787109375, 0.1246337890625, 0.2056884765625, 0.061981201171875, 0.1583251953125, 0.0654296875, 0.2064208984375, 0.1446533203125, 0.012237548828125, 0.166748046875,...	embed
17900996_c1	17900996	lisp	1	-bind (q r) (floor n m) (cons (nth q lst) (permute-b r (remove-nth q lst))) ) (NOTE: I may have mis-indented it, which may be affecting my lack of understanding) What I don't get about this is it looks to me as if there are 2 variables being multiply-bound (q & r), but only one value (floor n m) . Or is the other value...	-bind (q r) (floor n m) (cons (nth q lst) (permute-b r (remove-nth q lst))) ) (NOTE: I may have mis-indented it, which may be affecting my lack of understanding) What I don't get about this is it looks to me as if there are 2 variables being multiply-bound (q & r), but only one value (floor n m) . Or is the other value...	[ -0.032958984375, 0.031494140625, 0.0022430419921875, -0.0198974609375, -0.00146484375, 0.021240234375, 0.0003337860107421875, -0.018310546875, 0.0213623046875, -0.01068115234375, 0.0029144287109375, -0.004425048828125, 0.00811767578125, 0.006072998046875, -0.034912109375, -0.0066833496...	[ 20, 89817, 864, 1690, 52347, 748, 653, 347, 25553, 927, 8096, 271, 561, 67, 26973, 100094, 2301, 18, 2046, 903, 33342, 116, 77336, 8035, 6024, 62479, 99091, 619, 4734, 1632, 34292, 3789, 158, 7, 63805, 2685, 110, 14361, 64557, 48716, 27...	[ 0.0003662109375, 0.28759765625, 0.1517333984375, 0.1318359375, 0.1077880859375, 0.04473876953125, 0.03302001953125, 0.146484375, 0.1849365234375, 0.06396484375, 0.1265869140625, 0.0191802978515625, 0.1507568359375, 0.0137939453125, 0.0343017578125, 0.0176849365234375, 0.0018615722656...	embed
58628302_c1	58628302	lisp	1	;setCell Matrix Row Column Item (define (setCell Matrix Row Column Item) (if (= Row 1) (if (= Column 1) (helpMe Matrix Item) (cons (cons (car (car Matrix)) (setCell (cons (cdr (car Matrix)) ()) Row (- Column 1) Item)) (cdr Matrix)) ) (cons (car Matrix) (setCell (cdr Matrix) (- Row 1) Column Item)) ) ) (define (helpMe ...	;setCell Matrix Row Column Item (define (setCell Matrix Row Column Item) (if (= Row 1) (if (= Column 1) (helpMe Matrix Item) (cons (cons (car (car Matrix)) (setCell (cons (cdr (car Matrix)) ()) Row (- Column 1) Item)) (cdr Matrix)) ) (cons (car Matrix) (setCell (cdr Matrix) (- Row 1) Column Item)) ) ) (define (helpMe ...	[ -0.0244140625, 0.027099609375, 0.0274658203125, 0.0301513671875, 0.040283203125, -0.01409912109375, -0.0302734375, 0.003082275390625, 0.0031585693359375, 0.0262451171875, 0.002044677734375, -0.0040283203125, 0.00244140625, 0.004241943359375, -0.011474609375, -0.01031494140625, 0.0142...	[ 2819, 3509, 441, 6796, 194234, 96190, 233987, 78426, 112, 64552, 3190, 78690, 4879, 73866, 6696, 25553, 3284, 7569, 32149, 12501, 14255, 1052, 2740, 116, 77816, 201, 305, 65034, 23817, 190, 49413, 483, 757, 106, 1126, 138, 28864, 26073, 151...	[ 0.05072021484375, 0.2012939453125, 0.1209716796875, 0.2249755859375, 0.3017578125, 0.27001953125, 0.254150390625, 0.2459716796875, 0.0428466796875, 0.16845703125, 0.1109619140625, 0.0256805419921875, 0.0687255859375, 0.1663818359375, 0.2030029296875, 0.0966796875, 0.146728515625, 0...	embed
33331499_c0	33331499	lisp	0	Title: LISP:How to read numbers from user and store as a list Problem title: LISP:How to read numbers from user and store as a list Tags: common-lisp, lisp, list Problem: LISP:How to read numbers from user and store as a list I am new to lisp. I am trying to read numbers from user and want to store it as a list. For ex...	LISP:How to read numbers from user and store as a list LISP:How to read numbers from user and store as a list common-lisp lisp list user LISP:How LISP:How to read numbers from user and store as a list I am new to lisp. I am trying to read numbers from user and want to store it as a list. For example: if the user enters...	[ -0.015869140625, 0.0011138916015625, -0.0084228515625, -0.00016117095947265625, -0.01513671875, 0.04541015625, 0.0054931640625, 0.0028533935546875, 0.00506591796875, -0.059814453125, -0.0137939453125, -0.02294921875, -0.017578125, -0.001220703125, -0.0006103515625, 0.00286865234375, ...	[ 16970, 9434, 81826, 47, 12301, 101935, 1295, 38937, 136, 4343, 237, 5303, 10, 39210, 4086, 254, 400, 7008, 3525, 31577, 3444, 30957, 116, 138, 201, 190, 2806, 70541, 80854, 21162, 37842, 2500, 6191, 1505, 39116, 2256, 34002, 64688, 24243, ...	[ 0.1224365234375, 0.2232666015625, 0.05975341796875, 0.00927734375, 0.2445068359375, 0.233642578125, 0.1580810546875, 0.19482421875, 0.050750732421875, 0.1993408203125, 0.113525390625, 0.2314453125, 0.01373291015625, 0.083740234375, 0.09991455078125, 0.1663818359375, 0.1146240234375, ...	embed
4252306_c0	4252306	lisp	0	Title: SLIME on the console Problem title: SLIME on the console Tags: emacs, linux, lisp, slime Problem: SLIME on the console Does anyone have experience using SLIME on the console for Common Lisp? I'm trying to go through Practical Common Lisp but the commands in the book don't seem to work for the console version of ...	SLIME on the console SLIME on the console emacs linux lisp slime SLIME SLIME on the console Does anyone have experience using SLIME on the console for Common Lisp? I'm trying to go through Practical Common Lisp but the commands in the book don't seem to work for the console version of emacs/SLIME. I suppose my question...	[ -0.0028228759765625, -0.00048065185546875, -0.0062255859375, 0.00872802734375, -0.003570556640625, 0.0140380859375, 0.00390625, -0.005462646484375, 0.01519775390625, -0.0029754638671875, 0.0172119140625, -0.0036468505859375, -0.012451171875, 0.0028839111328125, -0.0002727508544921875, ...	[ 42135, 66820, 98, 70, 130250, 352, 2263, 7, 11508, 6077, 400, 7008, 34264, 13, 35672, 16981, 17368, 151301, 1261, 109613, 75101, 12877, 4488, 11389, 30508, 139124, 209806, 183037, 12921, 51515, 67896 ]	[ 0.2017822265625, 0.2646484375, 0.103759765625, 0.0177459716796875, 0.222412109375, 0.05950927734375, 0.1187744140625, 0.0986328125, 0.0728759765625, 0.07537841796875, 0.062744140625, 0.1773681640625, 0.1776123046875, 0.1500244140625, 0.006011962890625, 0.08837890625, 0.0595703125, ...	embed
26182893_c0	26182893	lisp	0	Title: Recursive function in lisp goes wrong Problem title: Recursive function in lisp goes wrong Tags: common-lisp, recursion, lisp Problem: Recursive function in lisp goes wrong I am trying to write a simple recursive program that prints the squares of numbers within certain bounds: (defun show-squares (i end) (if (>...	Recursive function in lisp goes wrong Recursive function in lisp goes wrong common-lisp recursion lisp Recursive SYSTEM::READ-EVAL-PRINT SHOW-SQUARES Recursive function in lisp goes wrong I am trying to write a simple recursive program that prints the squares of numbers within certain bounds: I get the error: *** - SYS...	[ -0.0159912109375, 0.0294189453125, 0.01361083984375, -0.015380859375, -0.0167236328125, 0.019287109375, -0.0054931640625, 0.006134033203125, -0.00469970703125, 0.006561279296875, 0.00689697265625, -0.02099609375, 0.0022735595703125, -0.006500244140625, 0.0235595703125, -0.0041198730468...	[ 853, 48650, 5844, 32354, 23, 400, 7008, 60899, 44691, 39210, 4086, 254, 195625, 55858, 90420, 41519, 397, 647, 61152, 17255, 59537, 18883, 54979, 120572, 31577, 33022, 8781, 1528, 28412, 108047, 111, 101935, 28032, 24233, 99091, 18499, 24428, ...	[ 0.0498046875, 0.20361328125, 0.145751953125, 0.16748046875, 0.021514892578125, 0.121826171875, 0.213623046875, 0.0982666015625, 0.218994140625, 0.0640869140625, 0.0777587890625, 0.156982421875, 0.190185546875, 0.09661865234375, 0.1492919921875, 0.117431640625, 0.05096435546875, 0.0...	embed
22723523_c0	22723523	lisp	0	Title: Lisp Error: Origin 9614327 is not in the stack of NIL Problem title: Lisp Error: Origin 9614327 is not in the stack of NIL Tags: emacs, lisp Problem: Lisp Error: Origin 9614327 is not in the stack of NIL I've been running into a rather strange error when I run my LISP code: Origin 9614327 is not in the stack of ...	Lisp Error: Origin 9614327 is not in the stack of NIL Lisp Error: Origin 9614327 is not in the stack of NIL emacs lisp Lisp Error Origin NIL Lisp Error: Origin 9614327 is not in the stack of NIL I've been running into a rather strange error when I run my LISP code: I'm running the code on Lispbox Emacs. When I try to l...	[ 0.0201416015625, 0.024169921875, -0.02197265625, -0.0025634765625, -0.01446533203125, -0.0022430419921875, 0.002197265625, 0.010009765625, -0.0081787109375, -0.0537109375, 0.000354766845703125, 0.00811767578125, -0.003021240234375, -0.00115966796875, 0.0115966796875, 0.0069580078125, ...	[ 1261, 7008, 212059, 119862, 13549, 139662, 3768, 83, 959, 23, 177261, 541, 16444, 111, 352, 2263, 400, 51042, 3934, 43257, 114453, 18499, 11675, 16970, 9434, 18151, 98, 11728, 85269, 4439, 9790, 6713, 144851, 4092, 13105, 313, 9, 238, 136, ...	[ 0.18115234375, 0.217529296875, 0.2056884765625, 0.2298583984375, 0.16796875, 0.1796875, 0.221435546875, 0.0185546875, 0.150146484375, 0.09375, 0.1881103515625, 0.0848388671875, 0.1744384765625, 0.058074951171875, 0.06634521484375, 0.09844970703125, 0.1173095703125, 0.1209716796875,...	embed
56921314_c0	56921314	lisp	0	Title: What (define (p) (p)) does? Problem title: What (define (p) (p)) does? Tags: scheme, lisp, sicp Problem: What (define (p) (p)) does? I'm reading the "Structure and interpretation of computer programs" 2nd edition in the exercise 1.5, I found a combination that I didn't understand what it does exactly (define (p)...	What (define (p) (p)) does? What (define (p) (p)) does? scheme lisp sicp What What (define (p) (p)) does? I'm reading the "Structure and interpretation of computer programs" 2nd edition in the exercise 1.5, I found a combination that I didn't understand what it does exactly (define (p) (p)) . When I called the procedur...	[ -0.0087890625, 0.0225830078125, -0.013671875, 0.0186767578125, -0.0047607421875, 0.01708984375, 0.006011962890625, 0.000621795654296875, -0.005096435546875, -0.03369140625, 0.0021820068359375, -0.01300048828125, -0.015380859375, -0.01336669921875, -0.00482177734375, 0.003265380859375, ...	[ 4865, 112, 64552, 254, 16, 14602, 150370, 400, 7008, 26536, 16454, 206019, 13909, 103391, 79737, 81979, 22410, 162515, 28219, 2367, 442, 66161, 35839, 50491, 13810, 42, 158927, 214, 11737, 13315, 81273, 33022, 23937, 3714, 41206, 61924, 390, ...	[ 0.1173095703125, 0.1298828125, 0.221923828125, 0.2213134765625, 0.12744140625, 0.1666259765625, 0.205322265625, 0.0894775390625, 0.1806640625, 0.09881591796875, 0.037109375, 0.09088134765625, 0.05645751953125, 0.1195068359375, 0.0426025390625, 0.08990478515625, 0.0645751953125, 0.1...	embed
22271615_c0	22271615	lisp	0	Title: Making lisp evaluator using C macros Problem title: Making lisp evaluator using C macros Tags: lisp, macros, scheme, c Problem: Making lisp evaluator using C macros I was reading chapters on C macros system and found that I can define some simple lisp-like evaluator. #define add(x,y) ((x)+(y)) #define mult(x,y) ...	Making lisp evaluator using C macros Making lisp evaluator using C macros lisp macros scheme c C Making Making lisp evaluator using C macros I was reading chapters on C macros system and found that I can define some simple lisp-like evaluator. Of course this is just a joke, but is there opportunity to make full scheme ...	[ 0.0036163330078125, 0.028564453125, -0.00180816650390625, 0.00750732421875, -0.0014801025390625, 0.0022430419921875, 0.01116943359375, -0.002838134765625, -0.00823974609375, -0.04931640625, -0.01068115234375, -0.01092529296875, 0.016845703125, -0.0225830078125, -0.0011444091796875, -0....	[ 13676, 400, 7008, 151575, 748, 17368, 313, 111789, 150370, 501, 214, 7, 16454, 139539, 5426, 831, 61924, 8781, 5062, 122122, 54591, 3249, 4393 ]	[ 0.08447265625, 0.148681640625, 0.20703125, 0.2021484375, 0.1600341796875, 0.0501708984375, 0.160888671875, 0.20703125, 0.1439208984375, 0.053680419921875, 0.01263427734375, 0.042633056640625, 0.0189666748046875, 0.003406524658203125, 0.11138916015625, 0.0140838623046875, 0.1244506835...	embed
16876949_c0	16876949	lisp	0	Title: Autocomplete parentheses in SLIME Problem title: Autocomplete parentheses in SLIME Tags: emacs, lisp, slime Problem: Autocomplete parentheses in SLIME I'm learning Common Lisp using SLIME. Is there a way to autocomplete parentheses so that when I type an open paren, a closed one is automatically added? I'm more ...	Autocomplete parentheses in SLIME Autocomplete parentheses in SLIME emacs lisp slime Autocomplete SLIME Autocomplete parentheses in SLIME I'm learning Common Lisp using SLIME. Is there a way to autocomplete parentheses so that when I type an open paren, a closed one is automatically added? I'm more of a vim guy, so in ...	[ -0.004150390625, 0.00836181640625, -0.01025390625, 0.004058837890625, -0.0277099609375, 0.03125, -0.005279541015625, 0.0184326171875, -0.0108642578125, -0.01116943359375, 0.0296630859375, -0.020263671875, -0.016357421875, 0.01416015625, -0.003448486328125, -0.02587890625, -0.01306152...	[ 4396, 277, 131801, 49129, 35412, 90, 23, 42135, 66820, 2263, 400, 7008, 34264, 13, 52080, 151301, 1261, 17368, 3917, 1809, 3229, 10644, 9803, 366, 33, 155738, 1632, 191082, 49814, 1286, 119916, 48948, 110534, 29671, 19437, 15190, 759, 13810, ...	[ 0.154296875, 0.086181640625, 0.177978515625, 0.1630859375, 0.195068359375, 0.09912109375, 0.028656005859375, 0.168701171875, 0.2396240234375, 0.01336669921875, 0.072998046875, 0.1490478515625, 0.1634521484375, 0.1328125, 0.06982421875, 0.10394287109375, 0.113037109375, 0.0437927246...	embed
20353946_c1	20353946	lisp	1	't directly mutated accidentally by whatever fn I choose (as would be the case with push-cdr which might be non-trivial in more complicated functions). Output: CL-USER> (defparameter g2 nil) G2 CL-USER> (set-global #'push-something 'g2 5) (5) CL-USER> g2 (5) CL-USER> (set-global #'push-cdr 'g2 99) (5 99) CL-U...	't directly mutated accidentally by whatever fn I choose (as would be the case with push-cdr which might be non-trivial in more complicated functions). Output: CL-USER> (defparameter g2 nil) G2 CL-USER> (set-global #'push-something 'g2 5) (5) CL-USER> g2 (5) CL-USER> (set-global #'push-cdr 'g2 99) (5 99) CL-U...	[ 0.0142822265625, 0.012451171875, 0.0024871826171875, 0.0025482177734375, 0.011474609375, 0.020263671875, -0.0050048828125, 0.003997802734375, 0.0189208984375, -0.0439453125, 0.00421142578125, 0.0025634765625, -0.005889892578125, -0.031494140625, 0.00885009765625, 0.01202392578125, -0...	[ 18, 105237, 31158, 297, 27998, 25958, 390, 89778, 14783, 87, 55076, 2806, 25944, 9, 7569, 13648, 186, 686, 96704, 32354, 13538, 7077, 46323, 1062, 50184, 2740, 112, 420, 6276, 29089, 177, 304, 1639, 17324, 724, 3509, 156566, 7332, 127, 64...	[ 0.1220703125, 0.1917724609375, 0.25732421875, 0.10400390625, 0.1943359375, 0.07916259765625, 0.0357666015625, 0.0887451171875, 0.1614990234375, 0.0047607421875, 0.114990234375, 0.010467529296875, 0.1865234375, 0.0401611328125, 0.1268310546875, 0.04388427734375, 0.0150299072265625, ...	embed
76291423_c1	76291423	lisp	1	i need your help to understand the process of getting to the result. Im new to lisp, we only studied very few lessons, we learned only mathematical things in lisp, "if", "cond", "labels", "and", "or", and how to write iterative functions. Could you please be able to explain me how this recursion deep down works please...	i need your help to understand the process of getting to the result. Im new to lisp, we only studied very few lessons, we learned only mathematical things in lisp, "if", "cond", "labels", "and", "or", and how to write iterative functions. Could you please be able to explain me how this recursion deep down works please...	[ -0.00616455078125, 0.005218505859375, -0.00567626953125, 0.0091552734375, 0.00653076171875, 0.02197265625, -0.00007915496826171875, 0.01068115234375, 0.005218505859375, -0.0230712890625, 0.0030670166015625, -0.016357421875, -0.00836181640625, 0.01239013671875, 0.0140380859375, 0.008056...	[ 17, 3871, 935, 4358, 28219, 9433, 111, 20949, 47, 16750, 3370, 3525, 400, 7008, 4734, 22282, 4552, 10846, 182417, 97384, 140363, 8966, 3190, 2271, 71, 152526, 2940, 748, 3642, 33022, 720, 45023, 32354, 73342, 903, 195625, 1830, 53894, 7565,...	[ 0.032867431640625, 0.135009765625, 0.012939453125, 0.1279296875, 0.1331787109375, 0.1341552734375, 0.050994873046875, 0.114990234375, 0.130859375, 0.1978759765625, 0.03961181640625, 0.033599853515625, 0.10552978515625, 0.2041015625, 0.013031005859375, 0.01800537109375, 0.00830078125,...	embed
57815561_c1	57815561	lisp	1	/Resources/app/static/<embedded>:14 Code signals: TypeError, Scheme, How, Script, Atom, Guile, Applications, Atom.app, Contents, Resources, Cannot, BufferedProcess.bufferStream, BufferedProcess.handleEvents, BufferedProcess.start, BufferedProcess, Runner.run, runner.js:32:28, Runtime.execute, runtime.js:78:17, HTMLElem...	/Resources/app/static/<embedded>:14 Code signals: TypeError, Scheme, How, Script, Atom, Guile, Applications, Atom.app, Contents, Resources, Cannot, BufferedProcess.bufferStream, BufferedProcess.handleEvents, BufferedProcess.start, BufferedProcess, Runner.run, runner.js:32:28, Runtime.execute, runtime.js:78:17, HTMLElem...	[ -0.01495361328125, 0.006561279296875, -0.0010223388671875, 0.01495361328125, -0.0130615234375, -0.0034332275390625, 0.00830078125, -0.0291748046875, -0.0027008056640625, -0.04052734375, 0.004669189453125, -0.03662109375, 0.00799560546875, 0.017333984375, 0.005157470703125, -0.024658203...	[ 248, 4332, 60427, 9007, 201939, 55720, 69819, 22635, 28864, 26073, 7, 12, 60457, 18468, 31611, 34702, 282, 11249, 84654, 69728, 53513, 133, 104921, 5, 70870, 152055, 4171, 10869, 18234, 297, 10752, 26531, 123759, 115061, 79628, 192134, 17137, ...	[ 0.08062744140625, 0.10888671875, 0.2203369140625, 0.1854248046875, 0.2008056640625, 0.19921875, 0.1563720703125, 0.228271484375, 0.2435302734375, 0.268310546875, 0.110107421875, 0.000152587890625, 0.1993408203125, 0.1356201171875, 0.1866455078125, 0.1334228515625, 0.1085205078125, ...	embed
15468205_c0	15468205	lisp	0	Title: is this function tail recursive? Problem title: is this function tail recursive? Tags: lisp, tail-recursion, scheme, racket Problem: is this function tail recursive? in racket , i define the following function and am wondering whether it is tail recursive : (define foo (λ (c m s1 s2) (if (< c m) (if (= (modulo m...	is this function tail recursive? is this function tail recursive? lisp tail-recursion scheme racket is this function tail recursive? in racket , i define the following function and am wondering whether it is tail recursive : my question is virtually like this, but i have to write something else to satisfy my post quali...	[ 0.00494384765625, 0.0103759765625, -0.000396728515625, -0.00101470947265625, 0.016357421875, -0.004425048828125, -0.01422119140625, -0.00153350830078125, 0.006439208984375, -0.01507568359375, 0.0194091796875, -0.0208740234375, -0.0081787109375, -0.005950927734375, 0.0294189453125, 0.00...	[ 83, 903, 32354, 46741, 195625, 5844, 400, 7008, 107, 48650, 1830, 150370, 673, 27853, 23, 61924, 25632, 149016, 36766, 442, 9655, 20513, 1884, 765, 33022, 37076, 40407, 1305, 31897, 5570, 3714, 7 ]	[ 0.08258056640625, 0.11383056640625, 0.222412109375, 0.282470703125, 0.243408203125, 0.177490234375, 0.087890625, 0.16552734375, 0.08392333984375, 0.18359375, 0.0941162109375, 0.168701171875, 0.08685302734375, 0.1837158203125, 0.0002218484878540039, 0.11767578125, 0.091796875, 0.031...	embed
64412323_c0	64412323	lisp	0	Title: string-trim does not work on global variable Problem title: string-trim does not work on global variable Tags: lisp, trim, string, common-lisp Problem: string-trim does not work on global variable Why string-trim does not work on global variable in Common Lisp? (defvar whitespaces '(#\Space #\Newline #\Backspa...	string-trim does not work on global variable string-trim does not work on global variable lisp trim string common-lisp Space Newline Backspace Tab Linefeed Page Rubout Hello World string-trim does not work on global variable Why string-trim does not work on global variable in Common Lisp?	[ 0.00970458984375, 0.0157470703125, -0.00445556640625, 0.0091552734375, -0.00811767578125, 0.000568389892578125, -0.0023193359375, 0.0286865234375, 0.0020904541015625, 0.0017547607421875, 0.00311279296875, -0.0014190673828125, 0.00116729736328125, -0.017333984375, 0.01104736328125, 0.00...	[ 79315, 3996, 39, 959, 4488, 98, 7964, 77336, 14602, 400, 7008, 85247, 39210, 4086, 254, 43045, 2356, 2256, 26828, 65421, 22193, 16777, 106095, 14231, 65787, 6056, 35378, 6661, 151301, 1261 ]	[ 0.250244140625, 0.221435546875, 0.1766357421875, 0.0968017578125, 0.13330078125, 0.055328369140625, 0.1602783203125, 0.2281494140625, 0.0102386474609375, 0.1016845703125, 0.1787109375, 0.225830078125, 0.078369140625, 0.0567626953125, 0.1180419921875, 0.1246337890625, 0.00709533691406...	embed
14690406_c0	14690406	lisp	0	Title: Why my auto-indentation emacs script doesn't work on .cu files Problem title: Why my auto-indentation emacs script doesn't work on .cu files Tags: lisp, emacs Problem: Why my auto-indentation emacs script doesn't work on .cu files I've just started to learn emacs. I used this Lisp script to indent my c...	Why my auto-indentation emacs script doesn't work on .cu files Why my auto-indentation emacs script doesn't work on .cu files lisp emacs Why Why my auto-indentation emacs script doesn't work on .cu files I've just started to learn emacs. I used this Lisp script to indent my c++ code in batch, but strangely it...	[ -0.001922607421875, -0.007568359375, -0.02392578125, -0.0035552978515625, -0.00147247314453125, 0.006439208984375, 0.00848388671875, 0.0181884765625, 0.0152587890625, -0.006927490234375, 0.00372314453125, -0.000774383544921875, -0.034912109375, 0.00775146484375, 0.006317138671875, -0.0...	[ 44084, 759, 1809, 21704, 22062, 352, 2263, 7, 26499, 22027, 3768, 18, 4488, 98, 1010, 102158, 400, 7008, 5, 30698, 1261, 18597, 37223, 18151, 1777, 114453, 456, 11627, 69130, 47, 6366, 77336, 143726, 5423, 11883, 4439, 9384, 1916, 91736, ...	[ 0.10028076171875, 0.00152587890625, 0.2000732421875, 0.178466796875, 0.1002197265625, 0.08984375, 0.153564453125, 0.0904541015625, 0.2056884765625, 0.065673828125, 0.025665283203125, 0.10150146484375, 0.121337890625, 0.01708984375, 0.2012939453125, 0.1436767578125, 0.05426025390625, ...	embed
69730757_c0	69730757	lisp	0	Title: Find max in lisp Problem title: Find max in lisp Tags: lisp Problem: Find max in lisp I am trying to do Recursive method to find max value in list. Can anyone explain where I made the mistake on this code and how to approach it next time. (defun f3 (i) (setq x (cond (> (car (I)) (cdr (car (I)))) (f3 (cdr (I)))))...	Find max in lisp Find max in lisp lisp max Find Find max in lisp I am trying to do Recursive method to find max value in list. Can anyone explain where I made the mistake on this code and how to approach it next time. also I tried this following method and didn't work: Thanks a lot for any help. I am coming from java i...	[ -0.015625, 0.021728515625, 0.0185546875, 0.003662109375, -0.0140380859375, 0.025146484375, 0.0087890625, 0.0235595703125, -0.00109100341796875, -0.00131988525390625, 0.004730224609375, -0.01220703125, -0.004669189453125, -0.0177001953125, 0.0234375, -0.0069580078125, 0.00390625, -0...	[ 26040, 18389, 23, 400, 7008, 31577, 48650, 5844, 55300, 7413, 34292, 5303, 73342, 7228, 121742, 18151, 51515, 37842, 4488, 4358, 79, 330 ]	[ 0.1199951171875, 0.220458984375, 0.09063720703125, 0.1387939453125, 0.210205078125, 0.0192108154296875, 0.11199951171875, 0.09161376953125, 0.0914306640625, 0.078369140625, 0.1578369140625, 0.1346435546875, 0.044158935546875, 0.00909423828125, 0.1015625, 0.06365966796875, 0.010879516...	embed
11414260_c0	11414260	lisp	0	Title: `A' is not of the expected type `REAL' Problem title: `A' is not of the expected type `REAL' Tags: lisp Problem: `A' is not of the expected type `REAL' The code below server to show the number of integer in a list. (defun isNum (N) (and (<= N 9) (>= N 0))) (defun count-numbers (list) (let ((c...	`A' is not of the expected type `REAL' `A' is not of the expected type `REAL' lisp REAL `A' is not of the expected type `REAL' The code below server to show the number of integer in a list. I get the error A' is not of the expected type REAL' when I run the command (count-numbers '(3 4 5 6 a 7 b) )	[ -0.006378173828125, -0.01416015625, -0.0010528564453125, 0.0069580078125, 0.0166015625, 0.0245361328125, -0.01422119140625, 0.0015716552734375, 0.01318359375, -0.000225067138671875, -0.015380859375, -0.041259765625, 0.01361083984375, 0.0064697265625, 0.01025390625, -0.01007080078125, ...	[ 284, 54764, 3768, 83, 959, 111, 84751, 10644, 41519, 866, 400, 7008, 88491, 70, 18151, 35064, 10723, 7639, 14012, 892, 1505, 23, 5303, 18499, 62, 25, 11675, 75101, 71013, 2606, 1297, 86827, 201, 190, 305, 10, 361, 876 ]	[ 0.177001953125, 0.0186004638671875, 0.14697265625, 0.10723876953125, 0.1844482421875, 0.1513671875, 0.1756591796875, 0.206787109375, 0.16552734375, 0.134033203125, 0.08892822265625, 0.1856689453125, 0.263671875, 0.04913330078125, 0.1383056640625, 0.1146240234375, 0.1600341796875, 0...	embed
20336237_c0	20336237	lisp	0	Title: check of the atom if it's the last element of the list in Scheme Problem title: check of the atom if it's the last element of the list in Scheme Tags: scheme, lisp Problem: check of the atom if it's the last element of the list in Scheme im trying to solve a question which is to check weather the eleme...	check of the atom if it's the last element of the list in Scheme check of the atom if it's the last element of the list in Scheme scheme lisp Scheme Define Cond check of the atom if it's the last element of the list in Scheme im trying to solve a question which is to check weather the element x is the last el...	[ -0.004669189453125, 0.032470703125, 0.002685546875, 0.01214599609375, -0.0125732421875, 0.01416015625, 0.01409912109375, -0.01202392578125, -0.007568359375, 0.00084686279296875, 0.0159912109375, -0.0277099609375, 0.00665283203125, -0.0062255859375, 0.004058837890625, 0.01446533203125, ...	[ 12765, 111, 34627, 2174, 442, 3768, 70, 4568, 12830, 5303, 23, 34702, 282, 150370, 400, 7008, 64552, 1657, 71, 566, 86869, 9655, 92949, 1022, 83, 9790, 5351, 44691, 4358 ]	[ 0.2186279296875, 0.145263671875, 0.246337890625, 0.0889892578125, 0.10052490234375, 0.087158203125, 0.048309326171875, 0.239501953125, 0.187744140625, 0.1868896484375, 0.059173583984375, 0.181884765625, 0.1583251953125, 0.2047119140625, 0.0491943359375, 0.1104736328125, 0.08990478515...	embed
71376802_c1	71376802	lisp	1	alist-get 'tag tr) (append (apply-partially untree '(alist-get 'children node)) nil ) )))) (funcall untree json-dom)) ) And got the following result. I don't know what I'm not doing right. (pp (fliptree)) ("html" (128 "\302\300\303\301\"\"\207" [(closure ((untree closure #4 (tr) (list (alist-get 'tag tr) (append (apply...	alist-get 'tag tr) (append (apply-partially untree '(alist-get 'children node)) nil ) )))) (funcall untree json-dom)) ) And got the following result. I don't know what I'm not doing right. (pp (fliptree)) ("html" (128 "\302\300\303\301\"\"\207" [(closure ((untree closure #4 (tr) (list (alist-get 'tag tr) (append (apply...	[ 0.00799560546875, 0.0059814453125, 0.0032806396484375, -0.02783203125, -0.0157470703125, -0.003448486328125, 0.009033203125, 0.00897216796875, 0.0126953125, -0.0302734375, -0.0167236328125, 0.005279541015625, -0.00958251953125, 0.0133056640625, 0.0159912109375, -0.00225830078125, 0.0...	[ 10, 6562, 3794, 6936, 4307, 9007, 3611, 538, 15866, 25958, 51, 62600, 11, 237052, 110, 112, 17324, 80126, 16498, 85763, 1647, 1681, 3815, 25632, 16750, 3714, 20594, 7108, 6366, 21392, 7693, 81764, 1197, 7739, 122367, 966, 170224, 309, 617, ...	[ 0.09619140625, 0.2210693359375, 0.1044921875, 0.181396484375, 0.194580078125, 0.06622314453125, 0.1173095703125, 0.04608154296875, 0.03253173828125, 0.053558349609375, 0.09393310546875, 0.25341796875, 0.033935546875, 0.163330078125, 0.0936279296875, 0.07086181640625, 0.120849609375, ...	embed
33020360_c1	33020360	lisp	1	in this case, but I can't substitute the hash table for a vector because the collatz sequence goes up about 50% of the time. After running the code, the hash table has some 2.5 million entries. Finally, and strangely, I managed to reproduce the bug while testing the syntax of a longish loop (a million iterations) that...	in this case, but I can't substitute the hash table for a vector because the collatz sequence goes up about 50% of the time. After running the code, the hash table has some 2.5 million entries. Finally, and strangely, I managed to reproduce the bug while testing the syntax of a longish loop (a million iterations) that...	[ -0.0037689208984375, 0.00016498565673828125, -0.01300048828125, 0.013916015625, -0.01104736328125, 0.0026397705078125, 0.00054168701171875, 0.0113525390625, 0.004180908203125, -0.02392578125, 0.0002307891845703125, 0.018310546875, 0.00286865234375, 0.037109375, 0.032958984375, -0.00162...	[ 903, 7225, 1284, 831, 18, 161740, 13, 1556, 127, 23180, 100, 173, 18770, 6637, 65780, 9136, 944, 3956, 60899, 1257, 1672, 9071, 111, 1733, 51042, 18151, 3060, 27804, 19879, 112820, 114453, 4, 145755, 42238, 54608, 134234, 6002, 86531, 4989,...	[ 0.047454833984375, 0.0677490234375, 0.037261962890625, 0.059295654296875, 0.044891357421875, 0.1485595703125, 0.022247314453125, 0.1910400390625, 0.162841796875, 0.2203369140625, 0.00177001953125, 0.1497802734375, 0.1748046875, 0.00634765625, 0.1099853515625, 0.1859130859375, 0.07171...	embed
1162989_c0	1162989	lisp	0	Title: What is the difference between procedure and #'procedure in Lisp/Clojure? Problem title: What is the difference between procedure and #'procedure in Lisp/Clojure? Tags: clojure, lisp Problem: What is the difference between procedure and #'procedure in Lisp/Clojure? What is the difference between the ev...	What is the difference between procedure and #'procedure in Lisp/Clojure? What is the difference between procedure and #'procedure in Lisp/Clojure? clojure lisp What Lisp Clojure core$double__4077 clojure.core$double__4077 clojure.core What is the difference between procedure and #'procedure in Lisp/Clojure? ...	[ 0.0169677734375, 0.009521484375, 0.0001163482666015625, 0.01373291015625, -0.0037384033203125, 0.022705078125, -0.0196533203125, 0.004058837890625, -0.00421142578125, -0.015869140625, -0.0172119140625, 0.004241943359375, -0.0169677734375, -0.0184326171875, 0.01068115234375, 0.016967773...	[ 70, 60212, 17721, 50491, 136, 3768, 232578, 1261, 7008, 64, 20219, 3408, 23, 441, 20450, 461, 107, 400, 4865, 51053, 56458, 21555, 2661, 2839, 14546, 30854, 83, 219836, 41929, 9506 ]	[ 0.0172882080078125, 0.185302734375, 0.1026611328125, 0.2279052734375, 0.083251953125, 0.0294952392578125, 0.218994140625, 0.1163330078125, 0.2049560546875, 0.05120849609375, 0.09674072265625, 0.1929931640625, 0.036102294921875, 0.002899169921875, 0.10748291015625, 0.1517333984375, 0....	embed
40162194_c1	40162194	lisp	1	count i)) (set! count (add1 count)) (loop)))) (loop))) Both codes, my implementation and the professor's code, reach the same results. But I am not sure if they have the same nature. Hence, I started to ask myself: was my implementation really imperative? Just using "set!" guaranties that? I still use parameters in my...	count i)) (set! count (add1 count)) (loop)))) (loop))) Both codes, my implementation and the professor's code, reach the same results. But I am not sure if they have the same nature. Hence, I started to ask myself: was my implementation really imperative? Just using "set!" guaranties that? I still use parameters in my...	[ 0.016357421875, 0.003997802734375, -0.003662109375, 0.0146484375, -0.0084228515625, 0.007354736328125, -0.0001621246337890625, 0.0029754638671875, 0.01141357421875, -0.052734375, 0.0196533203125, -0.006744384765625, -0.004119873046875, -0.00653076171875, 0.03564453125, -0.0140380859375...	[ 54529, 17, 3509, 38, 11, 4028, 418, 28354, 80126, 149766, 18151, 7, 759, 208124, 136, 70, 16030, 25, 58359, 5701, 50339, 959, 9077, 31425, 26458, 509, 6183, 222530, 13, 17368, 3890, 2497, 9369, 2449, 450, 7464, 4527, 171859, 119591, 53, ...	[ 0.2333984375, 0.15625, 0.218994140625, 0.1552734375, 0.0178070068359375, 0.1256103515625, 0.1151123046875, 0.1785888671875, 0.113525390625, 0.07330322265625, 0.2183837890625, 0.0227813720703125, 0.045928955078125, 0.223388671875, 0.0079345703125, 0.01129150390625, 0.2030029296875, ...	embed

13255731_c0

13255731

lisp

0

Title: tail-recursive function appending element to list Problem title: tail-recursive function appending element to list Tags: racket, scheme, tailrecursion-modulo-cons, tail-call-optimization, lisp Problem: tail-recursive function appending element to list i've seen several examples of implementing append an element ...

tail-recursive function appending element to list tail-recursive function appending element to list racket scheme tailrecursion-modulo-cons tail-call-optimization lisp tail-recursive function appending element to list i've seen several examples of implementing append an element to a list, but all are not using tail rec...

[ -0.0022430419921875, 0.0302734375, 0.008056640625, -0.00994873046875, 0.01531982421875, 0.007293701171875, -0.00872802734375, 0.0057373046875, -0.00038909912109375, -0.0289306640625, 0.007049560546875, -0.045654296875, -0.010986328125, 0.0106201171875, 0.017822265625, 0.012939453125, ...

[ 46741, 107, 48650, 5844, 32354, 1747, 96819, 12830, 47, 5303, 673, 27853, 150370, 1830, 83279, 31, 25553, 85763, 100433, 400, 7008, 51592, 27781, 29479, 114689, 71, 959, 17368, 195625, 6044, 123309, 20623 ]

[ 0.276123046875, 0.06842041015625, 0.1988525390625, 0.151123046875, 0.187744140625, 0.10955810546875, 0.1468505859375, 0.19384765625, 0.131591796875, 0.2109375, 0.019378662109375, 0.142822265625, 0.1314697265625, 0.09661865234375, 0.119873046875, 0.022796630859375, 0.05657958984375, ...

embed

11051415_c0

11051415

lisp

0

Title: Lisp - Convert symbol to string only if not already a string Problem title: Lisp - Convert symbol to string only if not already a string Tags: lisp, recursion, string, symbols Problem: Lisp - Convert symbol to string only if not already a string Is there a way to convert symbol to string only if it is not alread...

Lisp - Convert symbol to string only if not already a string Lisp - Convert symbol to string only if not already a string lisp recursion string symbols Lisp Convert Lisp - Convert symbol to string only if not already a string Is there a way to convert symbol to string only if it is not already a string in lisp? It shou...

[ -0.0213623046875, 0.006622314453125, -0.00225830078125, 0.0228271484375, -0.01806640625, 0.0208740234375, 0.000591278076171875, 0.00970458984375, -0.0107421875, 0.00823974609375, -0.005096435546875, -0.0240478515625, -0.00665283203125, 0.0390625, 0.0002918243408203125, 0.015869140625, ...

[ 1261, 7008, 1657, 11549, 26582, 47, 79315, 4734, 2174, 959, 21771, 400, 195625, 10, 3917, 96760, 23, 5608, 4488, 1884, 191, 538, 3190, 2271, 814, 186944 ]

[ 0.1705322265625, 0.2401123046875, 0.040069580078125, 0.1400146484375, 0.271240234375, 0.129638671875, 0.25830078125, 0.119140625, 0.09063720703125, 0.169921875, 0.162353515625, 0.154052734375, 0.1395263671875, 0.01580810546875, 0.09722900390625, 0.2080078125, 0.03765869140625, 0.01...

embed

28621739_c0

28621739

lisp

0

Title: What's the R equivalent of progn in lisp? Problem title: What's the R equivalent of progn in lisp? Tags: lisp, r Problem: What's the R equivalent of progn in lisp? In lisp there is syntax to execute several expressions in sequence within function arguments. Given R's lispy origins, I'm wondering is the...

What's the R equivalent of progn in lisp? What's the R equivalent of progn in lisp? lisp r What What's the R equivalent of progn in lisp? In lisp there is syntax to execute several expressions in sequence within function arguments. Given R's lispy origins, I'm wondering is there an equivalent feature in R? I'...

[ -0.004608154296875, 0.004547119140625, -0.01416015625, 0.0021514892578125, -0.01116943359375, 0.00457763671875, 0.00634765625, 0.00872802734375, 0.013427734375, -0.0096435546875, -0.017822265625, 0.02001953125, -0.0162353515625, -0.0230712890625, -0.02490234375, 0.005035400390625, -0...

[ 3768, 627, 183234, 67973, 19, 23, 400, 7008, 1690, 4865, 70, 6002, 86531, 71924, 40368, 125195, 40, 944, 28032, 32354, 10750, 7, 6493, 59665, 149016, 60213, 86898, 32562 ]

[ 0.02569580078125, 0.163818359375, 0.190673828125, 0.211181640625, 0.1925048828125, 0.0523681640625, 0.1142578125, 0.1824951171875, 0.146240234375, 0.004863739013671875, 0.00780487060546875, 0.039398193359375, 0.1534423828125, 0.1373291015625, 0.09210205078125, 0.190185546875, 0.00643...

embed

18105106_c0

18105106

lisp

0

Title: Turning list of atoms into a single list using recursion Problem title: Turning list of atoms into a single list using recursion Tags: recursion, lisp, list, scheme Problem: Turning list of atoms into a single list using recursion I'm looking for an answer that turns a list of atoms into a single list recursivel...

Turning list of atoms into a single list using recursion Turning list of atoms into a single list using recursion recursion lisp list scheme recursion Turning Turning list of atoms into a single list using recursion I'm looking for an answer that turns a list of atoms into a single list recursively. An example would be...

[ -0.005218505859375, 0.021728515625, 0.005767822265625, 0.026611328125, -0.00927734375, 0.0032806396484375, -0.00830078125, -0.0037689208984375, 0.007110595703125, -0.032958984375, 0.00408935546875, -0.00008249282836914062, 0.004852294921875, 0.002288818359375, -0.001953125, 0.014343261...

[ 4252, 592, 5303, 111, 34627, 7, 3934, 10, 11001, 17368, 195625, 1830, 400, 7008, 150370, 16487, 100, 35166, 450, 15504, 5844, 27781, 2806, 6562, 11, 275, 501, 71, 420, 706, 1096, 1238, 98893 ]

[ 0.1326904296875, 0.054351806640625, 0.26220703125, 0.0660400390625, 0.25341796875, 0.10369873046875, 0.1893310546875, 0.0511474609375, 0.1912841796875, 0.07635498046875, 0.258544921875, 0.1370849609375, 0.08160400390625, 0.1529541015625, 0.1673583984375, 0.0584716796875, 0.0103149414...

embed

42070694_c0

42070694

lisp

0

Title: What is the difference between :foo, ::foo, ::bar/foo, and :bar/foo in Clojure? Problem title: What is the difference between :foo, ::foo, ::bar/foo, and :bar/foo in Clojure? Tags: clojure, clojurescript, lisp, functional-programming Problem: What is the difference between :foo, ::foo, ::bar/foo, and :bar/foo in...

What is the difference between :foo, ::foo, ::bar/foo, and :bar/foo in Clojure? What is the difference between :foo, ::foo, ::bar/foo, and :bar/foo in Clojure? clojure clojurescript lisp functional-programming What Clojure What is the difference between :foo, ::foo, ::bar/foo, and :bar/foo in Clojure? I came across tho...

[ 0.0296630859375, -0.010009765625, -0.004669189453125, 0.01123046875, -0.0081787109375, -0.0000705718994140625, 0.0036163330078125, 0.0152587890625, -0.0108642578125, 0.03515625, 0.0030059814453125, -0.0166015625, 0.0150146484375, 0.024169921875, -0.0084228515625, -0.018798828125, -0....

[ 60212, 17721, 3584, 31, 1984, 1299, 64, 51053, 461, 107, 20450, 32032, 7008, 123309, 28966, 70, 152, 166117, 73342, 7 ]

[ 0.1766357421875, 0.0855712890625, 0.1944580078125, 0.1859130859375, 0.0517578125, 0.130126953125, 0.06475830078125, 0.1026611328125, 0.1395263671875, 0.1083984375, 0.0479736328125, 0.0533447265625, 0.03271484375, 0.04498291015625, 0.01605224609375, 0.0213470458984375, 0.0082702636718...

embed

53192980_c0

53192980

lisp

0

Title: How to use the mod function on LISPS using control structures Problem title: How to use the mod function on LISPS using control structures Tags: lisp, modulo, if-statement Problem: How to use the mod function on LISPS using control structures I am new to LISP, is there a way of using mod with control structures,...

How to use the mod function on LISPS using control structures How to use the mod function on LISPS using control structures lisp modulo if-statement control How LISPS How to use the mod function on LISPS using control structures I am new to LISP, is there a way of using mod with control structures, if statements. for i...

[ -0.01226806640625, 0.01318359375, -0.00848388671875, 0.01055908203125, 0.002288818359375, 0.014404296875, 0.027587890625, 0.0042724609375, -0.010009765625, -0.0224609375, 0.003753662109375, -0.0194091796875, 0.0106201171875, -0.00848388671875, 0.0245361328125, 0.00347900390625, -0.01...

[ 11249, 47, 4527, 2811, 32354, 98, 67616, 9059, 17368, 6226, 45646, 400, 7008, 140807, 2174, 61340, 674, 3525, 16970, 9434, 3917, 678, 63805, 19441, 3190, 13415, 201, 4958, 22183, 116, 9, 483, 125195, 30646, 757, 17324, 384 ]

[ 0.05462646484375, 0.0135955810546875, 0.1312255859375, 0.2196044921875, 0.1610107421875, 0.04302978515625, 0.1336669921875, 0.2103271484375, 0.0970458984375, 0.1781005859375, 0.1400146484375, 0.09552001953125, 0.1689453125, 0.20947265625, 0.1678466796875, 0.1358642578125, 0.009353637...

embed

31815835_c0

31815835

lisp

0

Title: how to check if the list is palindrome in lisp? Problem title: how to check if the list is palindrome in lisp? Tags: common-lisp, palindrome, lisp Problem: how to check if the list is palindrome in lisp? I want to test this list whether it's palindrome or not by comparing first element with last element , second...

how to check if the list is palindrome in lisp? how to check if the list is palindrome in lisp? common-lisp palindrome lisp how to check if the list is palindrome in lisp? I want to test this list whether it's palindrome or not by comparing first element with last element , second element with before the last element a...

[ -0.00927734375, -0.0036773681640625, 0.00067138671875, 0.01239013671875, -0.0152587890625, 0.015625, 0.0194091796875, 0.0020751953125, -0.0086669921875, -0.0037841796875, 0.0208740234375, 0.0030670166015625, 0.00640869140625, -0.0186767578125, -0.005584716796875, -0.0111083984375, -0...

[ 3642, 47, 12765, 2174, 5303, 83, 17923, 19, 102851, 23, 400, 7008, 39210, 4086, 254, 3034, 442, 37397, 12830, 4568, 8108 ]

[ 0.049591064453125, 0.043212890625, 0.1717529296875, 0.04937744140625, 0.1761474609375, 0.049713134765625, 0.149169921875, 0.059326171875, 0.209716796875, 0.045166015625, 0.091796875, 0.194580078125, 0.07049560546875, 0.08160400390625, 0.133056640625, 0.145751953125, 0.007793426513671...

embed

5415126_c0

5415126

lisp

0

Title: Newbie question: find CURL like functionality in Lisp Problem title: Newbie question: find CURL like functionality in Lisp Tags: lisp, package Problem: Newbie question: find CURL like functionality in Lisp I am a newbie in lisp trying to write a program to download a page content from the internet. I'm pretty su...

Newbie question: find CURL like functionality in Lisp Newbie question: find CURL like functionality in Lisp lisp package Newbie CURL Lisp Newbie question: find CURL like functionality in Lisp I am a newbie in lisp trying to write a program to download a page content from the internet. I'm pretty sure that there should ...

[ -0.003570556640625, 0.01422119140625, 0.0185546875, 0.02783203125, 0.00830078125, 0.012451171875, -0.0078125, 0.00009298324584960938, -0.01220703125, -0.0120849609375, 0.0216064453125, -0.0255126953125, 0.0012969970703125, 0.00396728515625, 0.006256103515625, -0.004913330078125, -0.0...

[ 2356, 9014, 9655, 7413, 313, 95538, 1884, 123309, 2481, 23, 1261, 7008, 400, 98169, 3525, 31577, 33022, 1528, 47, 7026, 9191, 10941, 1820, 9077, 5608, 6044, 4865, 14947, 2965, 60042 ]

[ 0.09381103515625, 0.1534423828125, 0.10302734375, 0.138916015625, 0.0963134765625, 0.29736328125, 0.1954345703125, 0.20556640625, 0.11895751953125, 0.06268310546875, 0.1778564453125, 0.251220703125, 0.1380615234375, 0.2183837890625, 0.064208984375, 0.0221405029296875, 0.0764770507812...

embed

2627038_c0

2627038

lisp

0

Title: Lisp-style quotation in HTML Problem title: Lisp-style quotation in HTML Tags: lisp, html Problem: Lisp-style quotation in HTML In Lisp, evaluating '(+ 1 2) produces '(+ 1 2), not 3. It seems that HTML doesn't support Lisp-style quotation so you can't say something like <quote><b>not bold</b></quote> in HTML and...

Lisp-style quotation in HTML Lisp-style quotation in HTML lisp html Lisp-style HTML Lisp-style quotation in HTML In Lisp, evaluating '(+ 1 2) produces '(+ 1 2), not 3. It seems that HTML doesn't support Lisp-style quotation so you can't say something like <quote><b>not bold</b></quote> in HTML and let it just produce <...

[ 0.0166015625, 0.038330078125, -0.000835418701171875, 0.007598876953125, -0.024169921875, -0.0078125, -0.01220703125, -0.00787353515625, 0.00185394287109375, -0.02392578125, -0.00775146484375, -0.0091552734375, -0.0086669921875, -0.0126953125, -0.00250244140625, 0.002288818359375, -0....

[ 1261, 7008, 40946, 81732, 1363, 19097, 400, 7693, 151575, 1328, 106, 4958, 27489, 959, 1031, 37202, 22027, 18, 8060, 831, 5154, 9844, 68726, 10869, 65665, 2633, 64457, 121392, 31635, 186768 ]

[ 0.1693115234375, 0.25634765625, 0.20361328125, 0.2105712890625, 0.0809326171875, 0.2548828125, 0.1219482421875, 0.1851806640625, 0.174560546875, 0.1717529296875, 0.08087158203125, 0.1676025390625, 0.17626953125, 0.12353515625, 0.1546630859375, 0.020416259765625, 0.061279296875, 0.0...

embed

68694156_c0

68694156

lisp

0

Title: Create consecutive sublists of given length from a list in LISP Problem title: Create consecutive sublists of given length from a list in LISP Tags: common-lisp, list, lisp, sublist Problem: Create consecutive sublists of given length from a list in LISP I have a list (1 2 3 4 5 6) and I would like to create all...

Create consecutive sublists of given length from a list in LISP Create consecutive sublists of given length from a list in LISP common-lisp list lisp sublist a Create LISP Create consecutive sublists of given length from a list in LISP I have a list (1 2 3 4 5 6) and I would like to create all possible lists of 4 atoms...

[ 0.007110595703125, 0.03173828125, 0.00811767578125, 0.021240234375, -0.01422119140625, 0.0185546875, -0.01263427734375, 0.01275634765625, 0.01708984375, -0.0177001953125, -0.00014495849609375, 0.01336669921875, 0.005401611328125, 0.0052490234375, -0.01287841796875, 0.019775390625, 0....

[ 151313, 148390, 13, 1614, 6562, 7, 34475, 140909, 1295, 5303, 16970, 9434, 111, 23, 39210, 4086, 254, 400, 7008, 765, 116, 138, 201, 190, 35914, 2806, 1884, 28282, 756, 7722, 34627, 27781, 16750, 13956, 21162, 86827, 2071, 903, 1261 ]

[ 0.122802734375, 0.2091064453125, 0.0838623046875, 0.215087890625, 0.269775390625, 0.0999755859375, 0.1082763671875, 0.1585693359375, 0.08123779296875, 0.2139892578125, 0.1390380859375, 0.2293701171875, 0.02972412109375, 0.03802490234375, 0.099853515625, 0.11181640625, 0.1593017578125...

embed

36895749_c0

36895749

lisp

0

Title: Reverse list in CLISP Problem title: Reverse list in CLISP Tags: lisp, functional-programming, common-lisp Problem: Reverse list in CLISP I'm trying to write my own function to reverse list in LISP. The problem is input (revert '(2 3 (4 5 (6)))) My code looks like this: (defun revert (l) (if (null l) nil (append...

Reverse list in CLISP Reverse list in CLISP lisp functional-programming common-lisp Reverse CLISP Reverse list in CLISP I'm trying to write my own function to reverse list in LISP. The problem is input My code looks like this: It returns instead of this: How can I fix it to work correctly?

[ -0.01171875, 0.02197265625, 0.007415771484375, 0.017822265625, -0.01129150390625, 0.01104736328125, -0.002838134765625, -0.00018310546875, 0.003326416015625, -0.01519775390625, 0.0025177001953125, 0.0211181640625, -0.007171630859375, 0.00390625, -0.0022430419921875, 0.01031494140625, ...

[ 853, 37676, 5303, 23, 313, 67616, 683, 400, 7008, 123309, 28966, 39210, 4086, 254, 31577, 33022, 10002, 32354, 39531, 184, 16970, 9434, 2967, 107730, 18151, 33342, 1884, 30646, 64457, 903, 30022, 4488, 26785 ]

[ 0.11004638671875, 0.2685546875, 0.244140625, 0.07562255859375, 0.048919677734375, 0.1490478515625, 0.19091796875, 0.072021484375, 0.1661376953125, 0.11962890625, 0.087158203125, 0.040863037109375, 0.0782470703125, 0.1402587890625, 0.039398193359375, 0.0877685546875, 0.0799560546875, ...

embed

39339353_c1

39339353

lisp

1

+ x) } subList match { case Nil => acc case List(x) :: xs => r(xs, r(List(x), List()) +: acc) case x :: xs => swap(x,xs) //case List(x) :: xs => } } r(lst, List()) } Instinctively, I think this is because I have no swap on the section "case List(x) :: xs" but I'm still struggling to fix it. More difficult, still, this ...

[ -0.01263427734375, 0.0242919921875, 0.013427734375, -0.01806640625, -0.01202392578125, 0.01324462890625, -0.01904296875, -0.0010986328125, 0.02392578125, 0.01611328125, 0.02978515625, -0.002532958984375, 0.0234375, 0.007659912109375, 0.004364013671875, 0.0015106201171875, 0.009460449...

[ 997, 1022, 51912, 1614, 154663, 14858, 7225, 77175, 44357, 50015, 32036, 425, 1984, 7, 1690, 202317, 58437, 271, 12729, 5351, 903, 765, 110, 40059, 7464, 237875, 30022, 34844, 36356, 46741, 9, 85763, 87235, 1363, 54, 4537, 29806, 28864, 260...

[ 0.1640625, 0.1331787109375, 0.009185791015625, 0.214111328125, 0.248779296875, 0.2269287109375, 0.1719970703125, 0.2467041015625, 0.02032470703125, 0.1412353515625, 0.2076416015625, 0.1240234375, 0.123779296875, 0.09735107421875, 0.059967041015625, 0.2548828125, 0.1708984375, 0.066...

embed

1778464_c0

1778464

lisp

0

Title: Common Lisp: Attach x recursively to list Problem title: Common Lisp: Attach x recursively to list Tags: list, lisp, common-lisp Problem: Common Lisp: Attach x recursively to list I'm trying to add, say, x to every element of a list. For example: (queue 3 '(1 2 3)) would give ((3 1) (3 2) (3 3)) The code below a...

Common Lisp: Attach x recursively to list Common Lisp: Attach x recursively to list list lisp common-lisp Common Lisp Attach Common Lisp: Attach x recursively to list I'm trying to add, say, x to every element of a list. For example: would give The code below apparently does not do what I want. Any hints please?

[ 0.0018157958984375, 0.0208740234375, 0.004425048828125, 0.0078125, -0.002471923828125, 0.00457763671875, 0.006591796875, 0.00714111328125, -0.005126953125, -0.0196533203125, 0.014404296875, -0.02294921875, 0.0069580078125, -0.00604248046875, -0.00168609619140625, -0.00457763671875, -...

[ 151301, 1261, 7008, 9208, 934, 1022, 195625, 5844, 538, 47, 5303, 400, 39210, 4086, 254, 31577, 15190, 11907, 12830, 2806, 8337, 18151, 35064, 198371, 959, 54, 3444, 5122, 22936 ]

[ 0.1513671875, 0.138916015625, 0.15625, 0.1336669921875, 0.180908203125, 0.15185546875, 0.1806640625, 0.12353515625, 0.007488250732421875, 0.10321044921875, 0.186767578125, 0.08538818359375, 0.106689453125, 0.07232666015625, 0.095947265625, 0.10125732421875, 0.13037109375, 0.1021118...

embed

55153604_c0

55153604

lisp

0

Title: Lisp interactive emacs multiplying incorrectly Problem title: Lisp interactive emacs multiplying incorrectly Tags: bignum, elisp, numbers, lisp, emacs Problem: Lisp interactive emacs multiplying incorrectly I'm running the following code on Emacs Lisp Interaction: (defun square (x) (* x x)) (square (square (squa...

Lisp interactive emacs multiplying incorrectly Lisp interactive emacs multiplying incorrectly bignum elisp numbers lisp emacs Lisp Lisp interactive emacs multiplying incorrectly I'm running the following code on Emacs Lisp Interaction: which is giving me 1114476179152563777 . However, the ((1001^2)^2)^2 is actually 100...

[ -0.02197265625, 0.00970458984375, 0.0166015625, -0.01214599609375, 0.0014190673828125, 0.0252685546875, -0.027587890625, 0.001678466796875, -0.0235595703125, -0.00933837890625, 0.000827789306640625, 0.01123046875, -0.01434326171875, 0.003265380859375, -0.004364013671875, -0.00759887695...

[ 1261, 7008, 212398, 352, 2263, 7, 6024, 62479, 214, 214552, 6957, 2606, 15296, 101935, 400, 538, 51042, 25632, 18151, 85269, 4439, 5337, 44713, 68772, 534, 2592, 162518, 156918, 1837, 2588, 15748, 102294, 33306, 70, 90980, 6746, 8353, 10461, ...

[ 0.14697265625, 0.220458984375, 0.1978759765625, 0.09564208984375, 0.1470947265625, 0.039886474609375, 0.10150146484375, 0.173095703125, 0.036163330078125, 0.195068359375, 0.07476806640625, 0.1842041015625, 0.07464599609375, 0.1285400390625, 0.11578369140625, 0.00279998779296875, 0.11...

embed

64481694_c0

64481694

lisp

0

Title: Reading numbers to array from string Problem title: Reading numbers to array from string Tags: common-lisp, lisp Problem: Reading numbers to array from string i create static array, suggest would good for finding numbers in string for array size (setf arr (make-array'(5))) (loop for i from 0 to 4 do (if (/= nil ...

Reading numbers to array from string Reading numbers to array from string common-lisp lisp string 0 Reading Reading numbers to array from string

[ -0.005584716796875, -0.00185394287109375, 0.006591796875, 0.0135498046875, -0.006439208984375, 0.017578125, 0.0159912109375, 0.01495361328125, 0.007476806640625, -0.0283203125, -0.00194549560546875, -0.028564453125, -0.0167236328125, -0.0038299560546875, 0.00872802734375, -0.0311279296...

[ 104951, 101935, 47, 10298, 53, 1295, 79315, 39210, 4086, 254, 400, 7008, 757 ]

[ 0.220947265625, 0.1915283203125, 0.080322265625, 0.1700439453125, 0.1451416015625, 0.1318359375, 0.2354736328125, 0.1207275390625, 0.0777587890625, 0.13330078125, 0.0938720703125, 0.159912109375, 0.11956787109375 ]

embed

24094191_c3

24094191

lisp

3

ROUND, LAMBDA, ASDF::PERFORM-PLAN, SB-C, WITH-COMPILATION-UNIT, SB-C::WITH-IT, LIST, ASDF:OPERATE, ASDF::CALL-WITH-SYSTEM-DEFINITIONS, CLOSURE, QUICKLISP-CLIENT::CALL-WITH-MACROEXPAND-PROGRESS, QUICKLISP-CLIENT::APPLY-LOAD-STRATEGY, QUICKLISP-CLIENT::AUTOLOAD-SYSTEM-AND-DEPENDENCIES, PROMPT, QL-IMPL-UTIL, CALL-WITH-QUI...

[ -0.000789642333984375, 0.0002803802490234375, -0.010498046875, 0.006500244140625, -0.005096435546875, -0.0081787109375, 0.01446533203125, 0.00098419189453125, 0.0242919921875, 0.00384521484375, -0.0146484375, 0.013671875, -0.006744384765625, -0.017578125, 0.00153350830078125, 0.0113525...

[ 19452, 34384, 4, 3358, 12689, 6538, 6483, 38997, 12, 30425, 98533, 184772, 90944, 9, 441, 55766, 23415, 16113, 146097, 84780, 65761, 618, 38969, 6371, 195977, 670, 35746, 66437, 62428, 90420, 202001, 25019, 92933, 142363, 167634, 9434, 10927, ...

[ 0.2098388671875, 0.259765625, 0.08551025390625, 0.087158203125, 0.2086181640625, 0.2308349609375, 0.166259765625, 0.31103515625, 0.0640869140625, 0.1136474609375, 0.279052734375, 0.24365234375, 0.1514892578125, 0.06756591796875, 0.12548828125, 0.048370361328125, 0.1180419921875, 0....

embed

68339753_c1

68339753

lisp

1

(cond ((whitespace-or-nil-p c) (return-from read-word (get-output-stream-string out))) ((not (digit-char-p c)) (go skip-til-next)) (t (go read-number)) ) read-simple-or-contracted-word (write-char c out) (setf c (read-char stream nil)) (cond ((whitespace-or-nil-p c) (return-from read-word (get-output-stream-string out...

[ 0.01190185546875, -0.0146484375, 0.0184326171875, 0.00921630859375, -0.0111083984375, 0.01318359375, 0.01953125, 0.006805419921875, 0.00005340576171875, 0.0272216796875, 0.0101318359375, -0.041015625, -0.02783203125, 0.00640869140625, -0.01287841796875, 0.00811767578125, -0.020385742...

[ 2271, 71, 60494, 148477, 65421, 748, 17324, 254, 501, 65395, 19, 161063, 12301, 47416, 3794, 6056, 7077, 86429, 91693, 1810, 32149, 10869, 4803, 217, 9254, 519, 21658, 3675, 29062, 18, 2606, 191560, 184103, 297, 18781, 3509, 420, 39116, 759...

[ 0.07421875, 0.1063232421875, 0.018280029296875, 0.10626220703125, 0.2308349609375, 0.06671142578125, 0.14794921875, 0.024078369140625, 0.0712890625, 0.144775390625, 0.03717041015625, 0.04180908203125, 0.21630859375, 0.2071533203125, 0.0273590087890625, 0.06292724609375, 0.04537963867...

embed

30283253_c0

30283253

lisp

0

Title: Are Lisp lists always implemented as linked lists under the hood? Problem title: Are Lisp lists always implemented as linked lists under the hood? Tags: lisp, linked-list, cpu-cache Problem: Are Lisp lists always implemented as linked lists under the hood? Are Lisp lists always implemented as linked lists under ...

Are Lisp lists always implemented as linked lists under the hood? Are Lisp lists always implemented as linked lists under the hood? lisp linked-list cpu-cache Lisp Are Lisp lists always implemented as linked lists under the hood? Are Lisp lists always implemented as linked lists under the hood? Is this a problem as far...

[ 0.00811767578125, 0.0169677734375, 0.0002651214599609375, 0.00885009765625, -0.0081787109375, 0.0272216796875, 0.0111083984375, -0.0108642578125, 0.000553131103515625, -0.027099609375, -0.004974365234375, 0.0196533203125, 0.001373291015625, 0.01043701171875, -0.013427734375, 0.01239013...

[ 1261, 7008, 5303, 11343, 29479, 237, 3126, 297, 1379, 44462, 400, 6562, 1766, 408, 1430, 2967, 14543, 42, 377, 59207, 51347, 12282, 45646, 4358 ]

[ 0.18701171875, 0.248779296875, 0.253173828125, 0.1236572265625, 0.142822265625, 0.07379150390625, 0.16455078125, 0.04559326171875, 0.138427734375, 0.1470947265625, 0.1207275390625, 0.1624755859375, 0.098388671875, 0.06488037109375, 0.0791015625, 0.1099853515625, 0.0914306640625, 0....

embed

50539146_c0

50539146

lisp

0

Title: Quicklisp: Archive is the wrong size Problem title: Quicklisp: Archive is the wrong size Tags: lisp, common-lisp, quicklisp Problem: Quicklisp: Archive is the wrong size I'm trying to use the cl-heap library, but when I run (quicklisp:quickload 'cl-heap) it returns: The archive file "cl-heap-0.1.6.tgz" for "cl-h...

Quicklisp: Archive is the wrong size Quicklisp: Archive is the wrong size lisp common-lisp quicklisp Quicklisp Archive quicklisp:quickload cl-heap-0.1.6.tgz Quicklisp: Archive is the wrong size I'm trying to use the cl-heap library, but when I run it returns: What can I do to be able to run cl-heap?

[ -0.0057373046875, 0.01513671875, -0.0087890625, -0.00872802734375, -0.01239013671875, -0.0022735595703125, -0.0225830078125, 0.0244140625, 0.000728607177734375, 0.031494140625, 0.00823974609375, 0.00017070770263671875, 0.0177001953125, 0.0067138671875, 0.0205078125, -0.009033203125, ...

[ 89038, 4086, 254, 97291, 83, 70, 44691, 13267, 12, 400, 7008, 39210, 63773, 3181, 2594, 63033, 33139, 1106, 2631, 102014, 43652, 31577, 4527, 9, 35773, 1294, 11675, 30646, 831, 54, 19048 ]

[ 0.1094970703125, 0.1988525390625, 0.207275390625, 0.2379150390625, 0.061370849609375, 0.049560546875, 0.1820068359375, 0.2042236328125, 0.003971099853515625, 0.05029296875, 0.1768798828125, 0.08746337890625, 0.0565185546875, 0.034027099609375, 0.034271240234375, 0.171875, 0.123779296...

embed

42429575_c0

42429575

lisp

0

Title: true and false null values in lisp vs scheme Problem title: true and false null values in lisp vs scheme Tags: lisp, scheme Problem: true and false null values in lisp vs scheme I want to use the function in a scheme program im writing however im unsure ho to translate the T & Nil values within the function. Can...

true and false null values in lisp vs scheme true and false null values in lisp vs scheme lisp scheme NIL true and false null values in lisp vs scheme I want to use the function in a scheme program im writing however im unsure ho to translate the T & Nil values within the function. Can nil essentially be written as '()...

[ 0.001800537109375, 0.0106201171875, 0.0230712890625, -0.00066375732421875, -0.009033203125, 0.0130615234375, 0.017333984375, -0.00897216796875, -0.005401611328125, 0.01806640625, 0.006622314453125, -0.006744384765625, -0.0033111572265625, -0.01953125, -0.0184326171875, -0.0060119628906...

[ 29568, 136, 98320, 56574, 142424, 400, 7008, 20209, 150370, 23, 541, 16444, 3444, 4527, 32354, 1528, 32562, 566, 51646, 739, 3900, 19309, 384, 619, 77175, 28032, 4171, 17324, 85590, 59121, 237, 132 ]

[ 0.207275390625, 0.08331298828125, 0.23193359375, 0.2445068359375, 0.222412109375, 0.123046875, 0.2274169921875, 0.1658935546875, 0.2388916015625, 0.047332763671875, 0.08892822265625, 0.175048828125, 0.00885772705078125, 0.059661865234375, 0.146484375, 0.06866455078125, 0.049377441406...

embed

77780891_c2

77780891

lisp

2

.0 elev) en 1) (trans (list 1.0 0.0 elev) en 1) (trans (list 0.0 1.0 elev) en 1) ) (setq ucsFlag T) ) ) (setq obj (vlax-ename->vla-object Code signals: AutoLISP, Removing, c:FM_RM3, area1, area2, _undo, _begin, LWPOLYLINE, FM-RUIMTEDEFV, LAYER, _.LAYER, _New, Out, _offset, SetQ, ENTITY, EntLast, EntGet, SubSt, Cons, As...

[ -0.001007080078125, 0.02783203125, 0.00970458984375, -0.01190185546875, -0.0008392333984375, 0.00921630859375, 0.0023040771484375, 0.0115966796875, 0.0361328125, 0.0164794921875, 0.0228271484375, 0.00848388671875, 0.021484375, -0.02783203125, -0.008544921875, -0.0194091796875, 0.0119...

[ 5, 2389, 44971, 22, 4879, 30145, 6562, 53855, 89678, 16, 3509, 864, 50648, 7, 919, 3668, 384, 995, 170, 32019, 425, 13, 11627, 187694, 28864, 26073, 12, 4396, 67616, 683, 853, 432, 6496, 59370, 25656, 363, 16128, 418, 4, 304, 557, 682...

[ 0.0867919921875, 0.1568603515625, 0.2666015625, 0.16748046875, 0.1517333984375, 0.179931640625, 0.2100830078125, 0.1021728515625, 0.182861328125, 0.0123291015625, 0.101806640625, 0.0911865234375, 0.151611328125, 0.08642578125, 0.035614013671875, 0.25146484375, 0.11962890625, 0.0899...

embed

3772365_c0

3772365

lisp

0

Title: How to defun a function within a defun? Problem title: How to defun a function within a defun? Tags: common-lisp, lisp Problem: How to defun a function within a defun? For example, I pass the function name to another function (personal-function 'func-name '(attr1 attr2 ...)) and what I want to do is (defun perso...

How to defun a function within a defun? How to defun a function within a defun? common-lisp lisp How attr1 attr2 How to defun a function within a defun? For example, I pass the function name to another function and what I want to do is However, it said I can't defun with a symbol... What should I do?

[ -0.0067138671875, 0.0189208984375, -0.0030364990234375, 0.00811767578125, -0.0174560546875, 0.0213623046875, -0.00994873046875, -0.00066375732421875, 0.006561279296875, -0.01507568359375, -0.01373291015625, 0.017822265625, -0.015625, 0.033203125, 0.005950927734375, -0.00628662109375, ...

[ 11249, 47, 8, 16498, 32354, 28032, 10, 39210, 4086, 254, 400, 7008, 243, 42, 418, 304, 27875, 9351, 15700, 3444, 831, 18, 678, 26582 ]

[ 0.09857177734375, 0.067626953125, 0.1705322265625, 0.255615234375, 0.224609375, 0.181640625, 0.028045654296875, 0.0933837890625, 0.04669189453125, 0.08892822265625, 0.05120849609375, 0.12213134765625, 0.03973388671875, 0.039703369140625, 0.0208587646484375, 0.07806396484375, 0.102844...

embed

59428_c0

59428

lisp

0

Title: Which environment, IDE or interpreter to put in practice Scheme? Problem title: Which environment, IDE or interpreter to put in practice Scheme? Tags: ide, lisp, scheme, the-little-schemer Problem: Which environment, IDE or interpreter to put in practice Scheme? I've been making my way through The Little Schemer...

Which environment, IDE or interpreter to put in practice Scheme? Which environment, IDE or interpreter to put in practice Scheme? ide lisp scheme the-little-schemer Which IDE Scheme Which environment, IDE or interpreter to put in practice Scheme? I've been making my way through The Little Schemer and I was wondering wh...

[ 0.004608154296875, 0.01190185546875, -0.005340576171875, 0.02490234375, -0.0120849609375, 0.0010528564453125, 0.01312255859375, -0.0079345703125, 0.0034637451171875, -0.0069580078125, 0.00148773193359375, -0.00799560546875, -0.016845703125, 0.01104736328125, -0.005340576171875, -0.0000...

[ 130078, 65998, 4, 36497, 707, 29481, 56, 47, 3884, 23, 41361, 34702, 282, 32, 5415, 400, 7008, 150370, 70, 150, 46401, 7560, 1991, 3917, 8305, 581, 59784, 509, 149016, 2367, 2806, 2965, 4527, 3034, 18151, 741, 7565, 100, 35978 ]

[ 0.09283447265625, 0.2261962890625, 0.0316162109375, 0.2724609375, 0.07110595703125, 0.214599609375, 0.2012939453125, 0.1036376953125, 0.138671875, 0.1307373046875, 0.2529296875, 0.21435546875, 0.1705322265625, 0.016265869140625, 0.1817626953125, 0.10406494140625, 0.2012939453125, 0...

embed

3319427_c0

3319427

lisp

0

Title: How to display rationals as long lists of digits in Lisp? Problem title: How to display rationals as long lists of digits in Lisp? Tags: lisp, floating-point Problem: How to display rationals as long lists of digits in Lisp? I'm just starting to learn Lisp and was wondering how to display a rational as a decimal...

How to display rationals as long lists of digits in Lisp? How to display rationals as long lists of digits in Lisp? lisp floating-point How Lisp How to display rationals as long lists of digits in Lisp? I'm just starting to learn Lisp and was wondering how to display a rational as a decimal number with lots of digits. ...

[ 0.0181884765625, 0.0084228515625, -0.002532958984375, -0.02783203125, 0.01318359375, -0.003204345703125, 0.0147705078125, 0.003570556640625, -0.005218505859375, -0.00153350830078125, -0.0123291015625, -0.009521484375, -0.005828857421875, 0.003997802734375, 0.00799560546875, 0.009277343...

[ 11249, 44116, 168487, 7, 237, 4989, 5303, 153939, 23, 1261, 7008, 47, 400, 21917, 26518, 38496, 30698, 149016, 3642, 32380, 2749, 14012, 678, 71358, 4527, 52347, 1022, 7440, 382, 3444, 75281 ]

[ 0.063232421875, 0.172607421875, 0.2373046875, 0.0899658203125, 0.0732421875, 0.0821533203125, 0.158447265625, 0.15673828125, 0.0347900390625, 0.1505126953125, 0.213134765625, 0.009368896484375, 0.116943359375, 0.0987548828125, 0.0291595458984375, 0.08721923828125, 0.02911376953125, ...

embed

34804391_c2

34804391

lisp

2

0.5 (indep (arc artistry 3.0 0.4))) (define-node quantity 0.5 0.5 (indep (arc popularity 1.5 0.5))) (define-node correctness 0.5 0.5 (indep (arc elegance 1.0 0.7))) (define-node nutrition 0.6 0.6 (indep (arc popularity 1.1 0.7) (arc elegance 1.8 0.8))) (define-node hygiene 0.8 0.8 (indep (arc cleanliness 1.0 0.1))) (d...

[ -0.00848388671875, 0.0050048828125, -0.002044677734375, 0.0206298828125, 0.0036163330078125, 0.0296630859375, -0.00286865234375, -0.006256103515625, 0.0057373046875, 0.0096435546875, -0.002471923828125, -0.01226806640625, -0.0166015625, -0.026123046875, -0.0026397705078125, -0.01397705...

[ 81730, 5012, 254, 147, 238, 22104, 1294, 17596, 121254, 32149, 112, 64552, 157, 102134, 939, 15, 5700, 2481, 22410, 26785, 7432, 69443, 329, 53855, 134926, 150017, 122887, 38245, 79875, 132208, 99824, 6, 46622, 59801, 107754, 128512, 49558, 1...

[ 0.3056640625, 0.1500244140625, 0.176025390625, 0.1502685546875, 0.09564208984375, 0.1943359375, 0.1241455078125, 0.1669921875, 0.2020263671875, 0.048095703125, 0.1265869140625, 0.1959228515625, 0.16455078125, 0.1365966796875, 0.04412841796875, 0.021026611328125, 0.2222900390625, 0....

embed

35813139_c1

35813139

lisp

1

ROM-STRING "`(a b ,c)"))) ; ; caught STYLE-WARNING: ; The variable C is defined but never used. ; ; compilation unit finished ; caught 1 STYLE-WARNING condition ; Evaluation aborted on #<UNBOUND-VARIABLE C {1007A3B2F3}>. This means that EVAL didn't pick up the environment in which C is bound. PS. Interestingly enough, ...

[ 0.0208740234375, 0.02392578125, -0.0087890625, 0.0218505859375, -0.008544921875, 0.0277099609375, 0.0169677734375, -0.0015869140625, 0.0108642578125, -0.018310546875, -0.02685546875, -0.0235595703125, 0.0033416748046875, -0.00958251953125, -0.0203857421875, 0.00048828125, -0.03125, ...

[ 85733, 9, 8545, 90345, 876, 238, 156892, 224170, 60873, 25795, 77336, 313, 83, 61924, 71, 1284, 8306, 11814, 98352, 25072, 122799, 35431, 151228, 64853, 297, 14006, 17398, 34384, 856, 20965, 183057, 966, 363, 26950, 241, 61152, 15935, 18, 3...

[ 0.28125, 0.04962158203125, 0.1236572265625, 0.2744140625, 0.05291748046875, 0.0625, 0.1495361328125, 0.203857421875, 0.09930419921875, 0.053131103515625, 0.281005859375, 0.1414794921875, 0.0003662109375, 0.190185546875, 0.012939453125, 0.09027099609375, 0.14013671875, 0.13732910156...

embed

40563725_c1

40563725

lisp

1

..." ; ] value. (let ((x)(y)(z)) (setq x 1) (setq x 2) (setq x 3) ) Strangely, Lisp does not seem to have a parallel to a JavaScript var/let/const; in the sense of the example above(Does it? I'm not very familiar with Lisp...). My question is; where are vars actually stored? They are not passed as arguments and they ar...

[ 0.01300048828125, 0.00506591796875, -0.031982421875, 0.006683349609375, -0.01495361328125, 0.028076171875, 0.00555419921875, 0.03271484375, 0.00823974609375, -0.001708984375, 0.00860595703125, 0.0164794921875, 0.006744384765625, 0.00482177734375, 0.0137939453125, 0.00933837890625, -0...

[ 153, 58, 2819, 34292, 1974, 53, 169, 3509, 864, 4958, 8439, 187791, 1261, 7008, 959, 48903, 95103, 17925, 285, 64, 25553, 18, 27781, 16031, 9655, 7440, 621, 7, 20653, 4343, 71, 10660, 115081, 10750, 143726, 159978, 171859, 1836, 8110, 174...

[ 0.030029296875, 0.022705078125, 0.000518798828125, 0.196044921875, 0.177490234375, 0.0020751953125, 0.030975341796875, 0.06353759765625, 0.122802734375, 0.006500244140625, 0.04931640625, 0.033111572265625, 0.15283203125, 0.2430419921875, 0.04473876953125, 0.023773193359375, 0.1912841...

embed

51982882_c0

51982882

lisp

0

Title: Unexpected eval result in CLISP Problem title: Unexpected eval result in CLISP Tags: common-lisp, eval, lisp Problem: Unexpected eval result in CLISP I run following code of CLISP, but the result looks strange to me. (setq a 'b) (setq b 'c) (setq c 'd) (setq d 8) (eval a) (eval c) (eval (eval a)) The output of l...

Unexpected eval result in CLISP Unexpected eval result in CLISP common-lisp eval lisp Unexpected CLISP Unexpected eval result in CLISP I run following code of CLISP, but the result looks strange to me. The output of last three line is: C 8 D How do I understand the output? How could last two line have different output?...

[ 0.0093994140625, 0.019775390625, 0.00823974609375, 0.019775390625, -0.006378173828125, 0.000560760498046875, 0.022216796875, 0.00885009765625, 0.008544921875, 0.0208740234375, -0.007537841796875, 0.0303955078125, 0.01123046875, 0.007598876953125, -0.022705078125, -0.00482177734375, 0...

[ 992, 83613, 13, 89829, 28, 1405, 16750, 313, 67616, 683, 39210, 4086, 254, 400, 7008, 11675, 25632, 18151, 33342, 114453, 140992, 4568, 17262, 13315, 83, 382, 391, 28219, 6626, 12921, 73342 ]

[ 0.0229339599609375, 0.08502197265625, 0.08587646484375, 0.0650634765625, 0.0411376953125, 0.2056884765625, 0.1368408203125, 0.10699462890625, 0.1553955078125, 0.2215576171875, 0.07476806640625, 0.113037109375, 0.1607666015625, 0.07281494140625, 0.1861572265625, 0.095947265625, 0.0462...

embed

27344364_c0

27344364

lisp

0

Title: Segmentation fault when trying to reverse a list Problem title: Segmentation fault when trying to reverse a list Tags: common-lisp, lisp Problem: Segmentation fault when trying to reverse a list I'm learning Common Lisp and I've been trying to write a function to reverse a list. This is the function but every ti...

Segmentation fault when trying to reverse a list Segmentation fault when trying to reverse a list common-lisp lisp Segmentation Segmentation fault when trying to reverse a list I'm learning Common Lisp and I've been trying to write a function to reverse a list. This is the function but every time I try to run it I get ...

[ -0.0089111328125, 0.0302734375, 0.0123291015625, 0.01092529296875, -0.00604248046875, 0.003143310546875, 0.01055908203125, 0.0322265625, -0.0020599365234375, -0.0128173828125, 0.00579833984375, 0.010009765625, 0.022216796875, 0.02587890625, 0.01385498046875, 0.00439453125, 0.01208496...

[ 38462, 674, 2320, 193857, 3229, 31577, 39531, 184, 5303, 39210, 4086, 254, 400, 7008, 52080, 151301, 1261, 33022, 32354, 11907, 1733, 9790, 11675, 2046, 294, 2507, 3036, 7136, 50886, 27919, 20051 ]

[ 0.21142578125, 0.19482421875, 0.09014892578125, 0.24560546875, 0.006500244140625, 0.1317138671875, 0.2059326171875, 0.1253662109375, 0.1846923828125, 0.0689697265625, 0.038665771484375, 0.083251953125, 0.03985595703125, 0.151123046875, 0.05218505859375, 0.11456298828125, 0.0933227539...

embed

47533553_c0

47533553

lisp

0

Title: Scheme pair construction Problem title: Scheme pair construction Tags: cdr, cons, lisp, list, scheme Problem: Scheme pair construction I am trying to understand pair construction and representation. Let's take a look at the following results: (length (cons '(a b) '(d e f))) => 4 Now let's switch the order: (leng...

Scheme pair construction Scheme pair construction cdr cons lisp list scheme Scheme Scheme pair construction I am trying to understand pair construction and representation. Let's take a look at the following results: Now let's switch the order: but Could you please explain the results above? What is the difference betwe...

[ 0.006622314453125, 0.039794921875, -0.005615234375, 0.0198974609375, -0.000850677490234375, 0.0208740234375, -0.024658203125, -0.0026092529296875, 0.008544921875, -0.033203125, 0.0017852783203125, -0.0303955078125, -0.0003490447998046875, -0.0020294189453125, -0.01190185546875, -0.0122...

[ 34702, 282, 80836, 50961, 56329, 42, 158, 7, 400, 7008, 5303, 150370, 28219, 18811, 50339, 101089, 12989, 73342, 36917, 70, 60212, 17721, 2258, 136 ]

[ 0.170166015625, 0.08697509765625, 0.25439453125, 0.171875, 0.0699462890625, 0.176025390625, 0.1405029296875, 0.016937255859375, 0.0241241455078125, 0.12939453125, 0.1158447265625, 0.2010498046875, 0.057159423828125, 0.1595458984375, 0.06134033203125, 0.055816650390625, 0.109375, 0....

embed

3000193_c0

3000193

lisp

0

Title: Lisp data security/validation Problem title: Lisp data security/validation Tags: validation, security, lisp Problem: Lisp data security/validation This is really just a conceptual question for me at this point. In Lisp, programs are data and data are programs. The REPL does exactly that - reads and then evaluate...

Lisp data security/validation Lisp data security/validation validation security lisp Lisp Lisp data security/validation This is really just a conceptual question for me at this point. In Lisp, programs are data and data are programs. The REPL does exactly that - reads and then evaluates. So how does one go about gettin...

[ 0.006011962890625, 0.032470703125, 0.00579833984375, 0.003082275390625, -0.010009765625, 0.0162353515625, 0.015625, 0.00946044921875, -0.0079345703125, -0.059326171875, 0.01177978515625, 0.004913330078125, 0.005615234375, 0.0062255859375, -0.007232666015625, -0.006927490234375, -0.00...

[ 1261, 7008, 2053, 48031, 7013, 85, 44622, 1363, 400, 6183, 228113, 9655, 99, 6275, 103391, 621, 136, 9069, 21130, 14602, 66161, 450, 12301, 7068, 151575, 90, 3642, 738, 1672, 20949, 107730, 1295, 70, 38937, 23, 111670, 3917, 79850, 442, 7...

[ 0.200927734375, 0.260009765625, 0.1654052734375, 0.2364501953125, 0.15966796875, 0.1573486328125, 0.2174072265625, 0.0225830078125, 0.157470703125, 0.0229949951171875, 0.10546875, 0.052764892578125, 0.0086517333984375, 0.0037517547607421875, 0.2078857421875, 0.1064453125, 0.003360748...

embed

5833033_c0

5833033

lisp

0

Title: In Lisp, code is data. What benefit does that provide? Problem title: In Lisp, code is data. What benefit does that provide? Tags: lisp Problem: In Lisp, code is data. What benefit does that provide? In Lisp, any program's code is actually a valid data structure. For example, this adds one and two together, but ...

In Lisp, code is data. What benefit does that provide? In Lisp, code is data. What benefit does that provide? lisp Lisp What In Lisp, code is data. What benefit does that provide? In Lisp, any program's code is actually a valid data structure. For example, this adds one and two together, but it's also a list of three i...

[ 0.01141357421875, 0.0224609375, 0.000682830810546875, 0.0291748046875, 0.00823974609375, 0.0242919921875, 0.01434326171875, 0.00921630859375, 0.0078125, -0.013916015625, -0.01202392578125, -0.02294921875, 0.00118255615234375, 0.0093994140625, -0.01806640625, 0.004119873046875, 0.0032...

[ 360, 1261, 7008, 18151, 83, 2053, 4865, 68073, 22691, 400, 2499, 1528, 20653, 10, 35604, 45646, 15190, 1632, 136, 6626, 25842, 5303, 17262, 55769, 2886, 69201, 27650, 46876 ]

[ 0.0765380859375, 0.18798828125, 0.249267578125, 0.30908203125, 0.1387939453125, 0.2203369140625, 0.060150146484375, 0.1915283203125, 0.11334228515625, 0.14306640625, 0.0472412109375, 0.1781005859375, 0.08477783203125, 0.023681640625, 0.1875, 0.193603515625, 0.1380615234375, 0.04724...

embed

12564587_c0

12564587

lisp

0

Title: lisp iterative function always returns nil Problem title: lisp iterative function always returns nil Tags: iteration, let, lisp Problem: lisp iterative function always returns nil this function is supposed to count the number of times that the element 'a' appears in a list, but is not working: (defun iter-a_coun...

lisp iterative function always returns nil lisp iterative function always returns nil iteration let lisp iter-a_count lisp iterative function always returns nil this function is supposed to count the number of times that the element 'a' appears in a list, but is not working: This function always returns nil. May I ask ...

[ -0.006805419921875, -0.016357421875, 0.005096435546875, 0.0167236328125, -0.01422119140625, 0.0224609375, 0.00555419921875, -0.000652313232421875, 0.00384521484375, -0.033447265625, -0.0078125, -0.02734375, -0.00148773193359375, 0.01171875, 0.003814697265625, -0.0030364990234375, 0.0...

[ 400, 7008, 17, 720, 45023, 32354, 11343, 30646, 17324, 2633, 71013, 7, 6, 134598, 54529, 14012, 20028, 12830, 11, 135179, 5303, 959, 20697, 26458, 44691 ]

[ 0.1278076171875, 0.193603515625, 0.0172576904296875, 0.1986083984375, 0.0919189453125, 0.142578125, 0.16796875, 0.189453125, 0.2115478515625, 0.06597900390625, 0.158203125, 0.00991058349609375, 0.0595703125, 0.0194549560546875, 0.1507568359375, 0.0460205078125, 0.1605224609375, 0.1...

embed

6417127_c0

6417127

lisp

0

Title: In Lisp and other functional languages, why is length not O(1) Problem title: In Lisp and other functional languages, why is length not O(1) Tags: language-implementation, lisp Problem: In Lisp and other functional languages, why is length not O(1) The list primitives in Lisp have the opperator length defined as...

In Lisp and other functional languages, why is length not O(1) In Lisp and other functional languages, why is length not O(1) language-implementation lisp Lisp In Lisp and other functional languages, why is length not O(1) The list primitives in Lisp have the opperator length defined as follows: Why can't implementers ...

[ 0.003143310546875, 0.051513671875, 0.0186767578125, 0.005401611328125, 0.0196533203125, -0.00738525390625, -0.0023956298828125, -0.000797271728515625, 0.004364013671875, -0.0517578125, -0.0030364990234375, -0.012451171875, -0.0045166015625, 0.004913330078125, 0, 0.018798828125, 0.016...

[ 1261, 7008, 123309, 46876, 15400, 83, 140909, 959, 180, 27750, 197648, 400, 5303, 128489, 2343, 56, 4597, 61924, 44084, 831, 18, 29479, 3249, 13, 375, 7077, 53697, 1733 ]

[ 0.1392822265625, 0.199951171875, 0.1324462890625, 0.10357666015625, 0.128173828125, 0.06402587890625, 0.236572265625, 0.12744140625, 0.150146484375, 0.0919189453125, 0.1417236328125, 0.08428955078125, 0.170166015625, 0.1690673828125, 0.1478271484375, 0.13623046875, 0.1641845703125, ...

embed

40837000_c0

40837000

lisp

0

Title: How to declare a function before its definition in common lisp? Problem title: How to declare a function before its definition in common lisp? Tags: lisp, common-lisp Problem: How to declare a function before its definition in common lisp? I will get an undefined function warning about f2 in SBCL with following ...

How to declare a function before its definition in common lisp? How to declare a function before its definition in common lisp? lisp common-lisp How How to declare a function before its definition in common lisp? I will get an undefined function warning about f2 in SBCL with following code sample. Is it possible that I...

[ 0.0181884765625, 0.01043701171875, -0.019287109375, 0.01153564453125, -0.02001953125, -0.007110595703125, -0.0022735595703125, 0.00970458984375, -0.00836181640625, -0.028564453125, 0.015625, 0.00933837890625, -0.000850677490234375, -0.0133056640625, 0.0247802734375, 0.0198974609375, ...

[ 11249, 47, 159978, 32354, 8108, 6863, 80934, 23, 39210, 400, 7008, 4086, 254, 10, 9232, 5983, 1631, 592, 1238, 304, 90944, 37486, 18151, 121413, 7722, 5117, 313, 71864, 1815 ]

[ 0.09246826171875, 0.06451416015625, 0.2449951171875, 0.222900390625, 0.18115234375, 0.021026611328125, 0.21923828125, 0.051055908203125, 0.1435546875, 0.12115478515625, 0.2021484375, 0.07586669921875, 0.1348876953125, 0.015167236328125, 0.05035400390625, 0.1453857421875, 0.0950927734...

embed

26616641_c0

26616641

lisp

0

Title: How does this code behave (function composition in funcall) Problem title: How does this code behave (function composition in funcall) Tags: common-lisp, lisp Problem: How does this code behave (function composition in funcall) I have the following function in lisp: (defun F(F) #'(lambda (n) (if (zerop n) (funca...

How does this code behave (function composition in funcall) How does this code behave (function composition in funcall) common-lisp lisp How How does this code behave (function composition in funcall) I have the following function in lisp: How does this code behaves if I call: I dont understand why the output is 4. Tha...

[ -0.00885009765625, -0.00146484375, -0.0010833740234375, 0.029296875, -0.0123291015625, 0.017822265625, 0.025390625, 0.01373291015625, -0.005126953125, -0.037841796875, 0.0032196044921875, 0.0023040771484375, 0.0036773681640625, 0.0281982421875, 0.015869140625, -0.015625, -0.000991821...

[ 11249, 14602, 903, 18151, 186, 68991, 137175, 166577, 7477, 85763, 39210, 4086, 254, 400, 7008, 70, 25632, 32354, 2174, 87, 11782, 13319, 28219, 15400, 140992, 83, 1398, 129745 ]

[ 0.07080078125, 0.085205078125, 0.0758056640625, 0.198486328125, 0.030181884765625, 0.148681640625, 0.1583251953125, 0.216552734375, 0.113037109375, 0.2474365234375, 0.1199951171875, 0.0797119140625, 0.137451171875, 0.099609375, 0.1676025390625, 0.0170135498046875, 0.0217132568359375,...

embed

14794609_c1

14794609

lisp

1

ole-gay (third fbf) var-for var-ex))) ((not) ;se trovo and or not semplicemente li riscrivo e continuo con la ricorsione (list (car fbf) (skole-gay (second fbf) var-for var-ex))) (otherwise ;; e' solo 1 proposizione, la ritorno fbf)) fbf)) at one point im doing (case (car fbf) ; where car of fbf = ?x and one of the cas...

[ 0.0250244140625, 0.024169921875, -0.0069580078125, -0.01068115234375, -0.00360107421875, 0.0284423828125, -0.000946044921875, 0.000949859619140625, 0.0113525390625, -0.01153564453125, -0.0072021484375, -0.0255126953125, 0.00982666015625, 0.000644683837890625, -0.0108642578125, -0.01806...

[ 1942, 9, 31989, 95037, 71, 108642, 420, 285, 2472, 3355, 32149, 10869, 154733, 96695, 400, 46012, 42, 5777, 62005, 23306, 15009, 6562, 3284, 29897, 191633, 16, 2639, 106, 502, 86948, 21, 129331, 99, 1632, 6275, 566, 20594, 58437, 2258, 11...

[ 0.2078857421875, 0.01300048828125, 0.255859375, 0.1861572265625, 0.1102294921875, 0.1470947265625, 0.169921875, 0.2103271484375, 0.146484375, 0.1868896484375, 0.0408935546875, 0.1490478515625, 0.1839599609375, 0.040008544921875, 0.07958984375, 0.06890869140625, 0.1405029296875, 0.1...

embed

37269617_c0

37269617

lisp

0

Title: How to use clojure.tools.macro/name-with-attributes in ClojureScript? Problem title: How to use clojure.tools.macro/name-with-attributes in ClojureScript? Tags: clojurescript, clojure, lisp, macros Problem: How to use clojure.tools.macro/name-with-attributes in ClojureScript? I would like to give a name to a mac...

How to use clojure.tools.macro/name-with-attributes in ClojureScript? How to use clojure.tools.macro/name-with-attributes in ClojureScript? clojurescript clojure lisp macros How clojure.tools.macro ClojureScript How to use clojure.tools.macro/name-with-attributes in ClojureScript? I would like to give a name to a macro...

[ -0.0031280517578125, 0.01019287109375, -0.0238037109375, -0.006591796875, -0.004364013671875, 0.0068359375, -0.00396728515625, 0.01300048828125, -0.00592041015625, -0.0167236328125, -0.019775390625, -0.00421142578125, 0.0022125244140625, -0.000732421875, 0.006500244140625, -0.019287109...

[ 11249, 4527, 20450, 461, 107, 89110, 192, 15322, 11627, 76228, 257, 191145, 7, 23, 51053, 147845, 32032, 400, 7008, 111789, 1884, 8337, 9351, 47, 55300, 183234 ]

[ 0.051971435546875, 0.1143798828125, 0.1478271484375, 0.16162109375, 0.1455078125, 0.228759765625, 0.038330078125, 0.166748046875, 0.1710205078125, 0.208984375, 0.0290069580078125, 0.1832275390625, 0.017242431640625, 0.04345703125, 0.151611328125, 0.236328125, 0.177001953125, 0.0574...

embed

245677_c0

245677

lisp

0

Title: What are some things that you've used Scheme macros for? Problem title: What are some things that you've used Scheme macros for? Tags: scheme, racket, macros, lisp Problem: What are some things that you've used Scheme macros for? Many examples of macros seem to be about hiding lambdas, e.g. with-open-f...

What are some things that you've used Scheme macros for? What are some things that you've used Scheme macros for? scheme racket macros lisp What Scheme What are some things that you've used Scheme macros for? Many examples of macros seem to be about hiding lambdas, e.g. with-open-file in CL. I'm looking for s...

[ 0.009765625, 0.0157470703125, 0.01031494140625, 0.0037841796875, -0.0034637451171875, 0.01171875, -0.004974365234375, 0.0017547607421875, 0.010009765625, -0.0177001953125, -0.0166015625, -0.039306640625, -0.00927734375, -0.016357421875, -0.0002880096435546875, -0.0208740234375, 0.007...

[ 4865, 8966, 398, 3768, 272, 11814, 34702, 282, 111789, 7, 100, 3060, 150370, 673, 27853, 400, 7008, 621, 450, 27781, 1672, 1274, 6238, 21, 6492, 1124, 678, 59636, 29822, 46323, 1286, 188768, 4527, 436, 27026, 12319, 17368, 32354 ]

[ 0.072998046875, 0.1334228515625, 0.02044677734375, 0.02484130859375, 0.063720703125, 0.10394287109375, 0.2281494140625, 0.22412109375, 0.247314453125, 0.1290283203125, 0.1204833984375, 0.0372314453125, 0.234130859375, 0.01519775390625, 0.14892578125, 0.034393310546875, 0.143188476562...

embed

20881659_c0

20881659

lisp

0

Title: Sort a list according to another list in common lisp Problem title: Sort a list according to another list in common lisp Tags: sorting, lisp, common-lisp Problem: Sort a list according to another list in common lisp How would you sort list according to the order defined in another list sorter : list = ( (:value ...

Sort a list according to another list in common lisp Sort a list according to another list in common lisp sorting lisp common-lisp Sort Sort a list according to another list in common lisp How would you sort list according to the order defined in another list sorter : Resulting in: Thanks

[ 0.00360107421875, 0.016357421875, 0.004638671875, -0.003021240234375, -0.011474609375, -0.025146484375, -0.004425048828125, -0.01226806640625, 0.01409912109375, -0.0172119140625, -0.003936767578125, 0.022705078125, -0.00445556640625, 0.00421142578125, -0.0011444091796875, -0.0106811523...

[ 53666, 5303, 59499, 15700, 39210, 400, 7008, 12096, 214, 4086, 254, 10, 47, 23, 2806, 12989, 61924, 136666, 22362 ]

[ 0.2069091796875, 0.2064208984375, 0.06475830078125, 0.10650634765625, 0.1251220703125, 0.08111572265625, 0.11480712890625, 0.202880859375, 0.0268402099609375, 0.053741455078125, 0.0772705078125, 0.00815582275390625, 0.004253387451171875, 0.008453369140625, 0.025634765625, 0.1484375, ...

embed

9858030_c0

9858030

lisp

0

Title: Search and replace on variable name within S-Expression (lexical scope)? Problem title: Search and replace on variable name within S-Expression (lexical scope)? Tags: paredit, lisp, emacs, clojure, s-expression Problem: Search and replace on variable name within S-Expression (lexical scope)? Using emacs with Par...

Search and replace on variable name within S-Expression (lexical scope)? Search and replace on variable name within S-Expression (lexical scope)? paredit lisp emacs clojure s-expression Search S-Expression Search and replace on variable name within S-Expression (lexical scope)? Using emacs with Paredit enabled. How can...

[ -0.0108642578125, 0.0238037109375, -0.007354736328125, 0.0159912109375, -0.0111083984375, 0.0303955078125, -0.0032806396484375, 0.0264892578125, 0.013916015625, 0.000370025634765625, 0.020263671875, 0.02978515625, -0.00848388671875, -0.004974365234375, 0.021484375, 0.000827789306640625...

[ 33086, 136, 91995, 98, 77336, 9351, 28032, 159, 9, 178752, 1830, 74070, 21533, 70820, 366, 45082, 400, 7008, 352, 2263, 20450, 461, 107, 91, 204629, 345, 678, 2392, 225081, 11249, 831, 33938, 8305, 16970, 9434, 20219, 3408, 456, 11627, 18...

[ 0.2244873046875, 0.0809326171875, 0.208251953125, 0.101318359375, 0.250732421875, 0.1302490234375, 0.12255859375, 0.1676025390625, 0.031402587890625, 0.221923828125, 0.107666015625, 0.081787109375, 0.0848388671875, 0.142578125, 0.0477294921875, 0.217529296875, 0.0355224609375, 0.13...

embed

712905_c0

712905

lisp

0

Title: Loading libraries in Dr Scheme Problem title: Loading libraries in Dr Scheme Tags: scheme, sicp, lisp Problem: Loading libraries in Dr Scheme I am working through SICP using Dr Scheme. How do I load external libraries in Dr Scheme? Say I want to use Math library then how do I ask Dr Scheme to load the particular...

Loading libraries in Dr Scheme Loading libraries in Dr Scheme scheme sicp lisp Loading Scheme Loading libraries in Dr Scheme I am working through SICP using Dr Scheme. How do I load external libraries in Dr Scheme? Say I want to use Math library then how do I ask Dr Scheme to load the particular library? I tried with t...

[ -0.0074462890625, 0.0250244140625, -0.00946044921875, 0.01434326171875, -0.0103759765625, -0.0035858154296875, 0.00531005859375, 0.01483154296875, -0.00860595703125, -0.052734375, -0.00390625, -0.03466796875, -0.01434326171875, -0.01287841796875, 0.00885009765625, -0.03759765625, -0....

[ 228006, 35773, 10484, 1773, 34702, 282, 23, 150370, 26536, 254, 400, 7008, 20697, 159, 198993, 72367, 173591, 3444, 4527, 78804, 1294, 26458, 17311, 37842, 3181, 107, 5612, 125458, 5, 7, 25632, 18499, 91067, 47, 9232, 5983, 42485, 56, 64209...

[ 0.214599609375, 0.2120361328125, 0.12078857421875, 0.172607421875, 0.20849609375, 0.1561279296875, 0.0261383056640625, 0.1783447265625, 0.07568359375, 0.10760498046875, 0.046539306640625, 0.1490478515625, 0.032012939453125, 0.0245208740234375, 0.1873779296875, 0.188232421875, 0.14221...

embed

29413880_c0

29413880

lisp

0

Title: LISP: Find occurrences of each word in a sentence. Problem title: LISP: Find occurrences of each word in a sentence. Tags: lisp Problem: LISP: Find occurrences of each word in a sentence. Can someone please explain to me how I search for the occurrences of each word in a sentence, such as "the cat sat on the mat...

LISP: Find occurrences of each word in a sentence. LISP: Find occurrences of each word in a sentence. lisp LISP Find LISP: Find occurrences of each word in a sentence. Can someone please explain to me how I search for the occurrences of each word in a sentence, such as "the cat sat on the mat" in Common lisp ? The user...

[ 0.0069580078125, -0.0019073486328125, -0.011474609375, 0.0184326171875, -0.0031585693359375, 0.022705078125, 0.021728515625, 0.0089111328125, 0.01348876953125, -0.0361328125, -0.0072021484375, 0.007110595703125, 0.0172119140625, 0.0034027099609375, 0.00799560546875, 0.0235595703125, ...

[ 16970, 9434, 12, 26040, 74918, 42, 69098, 111, 12638, 2565, 23, 149357, 400, 7008, 73342, 3642, 33938, 100, 2347, 7515, 11736, 98, 70, 2589, 151301, 38937, 107730, 3674, 13315, 7986, 3535, 8110, 54529, 1295, 4358, 4034 ]

[ 0.1375732421875, 0.1939697265625, 0.009857177734375, 0.138427734375, 0.1597900390625, 0.136962890625, 0.1295166015625, 0.04351806640625, 0.09942626953125, 0.17578125, 0.0406494140625, 0.1732177734375, 0.1478271484375, 0.1798095703125, 0.0960693359375, 0.048797607421875, 0.18969726562...

embed

33801587_c0

33801587

lisp

0

Title: Is there any way to get a variable address in Common Lisp? Problem title: Is there any way to get a variable address in Common Lisp? Tags: xor-linkedlist, memory-address, lisp, common-lisp Problem: Is there any way to get a variable address in Common Lisp? I'm trying to implement XOR-linked lists on Common Lisp,...

Is there any way to get a variable address in Common Lisp? Is there any way to get a variable address in Common Lisp? xor-linkedlist memory-address lisp common-lisp Common Lisp Is there any way to get a variable address in Common Lisp? I'm trying to implement XOR-linked lists on Common Lisp, but i need to get an addres...

[ 0.01953125, 0.01116943359375, -0.0084228515625, 0.00860595703125, -0.00075531005859375, 0.029052734375, -0.000774383544921875, 0.01904296875, -0.0091552734375, -0.05712890625, 0.0087890625, 0.018310546875, 0.01263427734375, -0.0027313232421875, 0.01385498046875, 0.01092529296875, -0....

[ 2499, 3917, 2046, 10, 77336, 29823, 23, 151301, 1261, 7008, 2685, 47, 74706, 10187, 297, 6562, 98323, 712, 107421, 400, 39210, 4086, 254, 29479, 1193, 24638, 5303, 3871, 111, 51339, 4785, 90825, 41018, 21373, 50828, 3447, 132, 32354 ]

[ 0.05401611328125, 0.0833740234375, 0.111328125, 0.068359375, 0.288330078125, 0.2215576171875, 0.0552978515625, 0.1771240234375, 0.1513671875, 0.205810546875, 0.010894775390625, 0.03277587890625, 0.137451171875, 0.1265869140625, 0.035980224609375, 0.1395263671875, 0.1856689453125, 0...

embed

30467726_c0

30467726

lisp

0

Title: No-argument (and) returns t Problem title: No-argument (and) returns t Tags: clojure, lisp, scheme, common-lisp Problem: No-argument (and) returns t Both CL and Scheme define (and) to return t (or #t ) with no arguments. I'm trying to understand the rationale for this. My naive assumption is that an empty set is...

No-argument (and) returns t No-argument (and) returns t clojure lisp scheme common-lisp No-argument No-argument (and) returns t Both CL and Scheme define (and) to return t (or #t ) with no arguments. I'm trying to understand the rationale for this. My naive assumption is that an empty set is false, and passing in zero ...

[ 0.0120849609375, 0.01416015625, -0.01104736328125, 0.0021209716796875, -0.016357421875, 0.0191650390625, 0.0224609375, 0.0031585693359375, 0.0142822265625, 0.004913330078125, -0.006439208984375, -0.0198974609375, -0.0067138671875, 0.020751953125, 0.0010986328125, -0.00070953369140625, ...

[ 438, 155937, 2940, 30646, 808, 20450, 461, 107, 400, 7008, 150370, 39210, 4086, 254, 46323, 34702, 282, 61924, 468, 18, 678, 110, 10750, 28219, 168487, 237259, 201505, 5423, 98320, 452, 45234, 12319, 1884, 23, 33720, 29568, 101805, 62822, 1...

[ 0.134033203125, 0.291259765625, 0.1683349609375, 0.2064208984375, 0.15185546875, 0.0986328125, 0.1142578125, 0.06170654296875, 0.06170654296875, 0.15478515625, 0.152099609375, 0.042572021484375, 0.06317138671875, 0.13037109375, 0.1551513671875, 0.1363525390625, 0.12646484375, 0.127...

embed

12649926_c0

12649926

lisp

0

Title: subset sum - lisp Problem title: subset sum - lisp Tags: lisp, common-lisp Problem: subset sum - lisp I'm trying to write a subset sum problem in lisp. Example: (subsetsum '(1 2 3) 5) = (2 3) , (subsetsum '(1 5 3) 2) = nil . I can only use functions (atom x) (null x) (eq x y) (equal x y) (numberp x) (append x y)...

subset sum - lisp subset sum - lisp lisp common-lisp subset sum - lisp I'm trying to write a subset sum problem in lisp. Example: (subsetsum '(1 2 3) 5) = (2 3) , (subsetsum '(1 5 3) 2) = nil . I can only use functions Can I get any hint?

[ -0.01080322265625, 0.021484375, 0.031982421875, 0.00335693359375, -0.0264892578125, 0.01239013671875, 0.00213623046875, 0.01019287109375, 0.01104736328125, -0.01220703125, 0.0033111572265625, 0.0135498046875, 0.005706787109375, -0.010986328125, -0.0024871826171875, 0.0135498046875, 0...

[ 1614, 3509, 10554, 400, 7008, 39210, 4086, 254, 31577, 33022, 2967, 23, 89536, 8705, 22144, 11832, 116, 8439, 21162, 2203, 4700, 190, 4958, 6, 17324, 831, 4734, 4527, 32354, 5122 ]

[ 0.1988525390625, 0.2392578125, 0.2269287109375, 0.1318359375, 0.2249755859375, 0.12335205078125, 0.10260009765625, 0.145263671875, 0.07684326171875, 0.1138916015625, 0.20458984375, 0.03387451171875, 0.04364013671875, 0.009521484375, 0.1973876953125, 0.2476806640625, 0.07666015625, ...

embed

41222463_c0

41222463

lisp

0

Title: Minimum value of integer lisp Problem title: Minimum value of integer lisp Tags: lisp, common-lisp Problem: Minimum value of integer lisp I am tryin to retrieve the minimum value of integer in lisp. I found most-negative-fixnum variable that should represent the lowest possible number. whatever i try doing with ...

Minimum value of integer lisp Minimum value of integer lisp lisp common-lisp Minimum Minimum value of integer lisp I am tryin to retrieve the minimum value of integer in lisp. I found variable that should represent the lowest possible number. whatever i try doing with it is throws error Is there any specific way how to...

[ -0.0111083984375, 0.003631591796875, -0.001983642578125, -0.00023651123046875, -0.019287109375, 0.01123046875, 0.0294189453125, -0.00013446807861328125, 0.0001583099365234375, -0.03466796875, -0.01190185546875, -0.01239013671875, 0.0022430419921875, 0.0019989013671875, 0.03076171875, -...

[ 173858, 34292, 111, 892, 1505, 400, 7008, 39210, 4086, 254, 9790, 3996, 3134, 70, 15440, 23, 77336, 5608, 33636, 459, 25617, 7722, 14012, 104250, 18499, 29458, 3917, 3642, 47, 2046 ]

[ 0.21044921875, 0.1993408203125, 0.049591064453125, 0.1226806640625, 0.0986328125, 0.14013671875, 0.2042236328125, 0.09490966796875, 0.10357666015625, 0.1619873046875, 0.0029544830322265625, 0.059661865234375, 0.020904541015625, 0.06671142578125, 0.2066650390625, 0.052276611328125, 0....

embed

16432561_c0

16432561

lisp

0

Title: List difference function Problem title: List difference function Tags: list, lisp, ml, functional-programming Problem: List difference function Does any existing programming language, particularly in the Lisp or ML families, have a library function to calculate list difference in the sense of 'first until start ...

List difference function List difference function list lisp ml functional-programming List List difference function Does any existing programming language, particularly in the Lisp or ML families, have a library function to calculate list difference in the sense of 'first until start of second' - I'm not sure offhand w...

[ 0.00927734375, 0.00408935546875, -0.00506591796875, 0.018310546875, -0.00848388671875, 0.0172119140625, -0.005462646484375, 0.01324462890625, 0.01220703125, 0.00970458984375, 0.01348876953125, 0.002655029296875, -0.00194549560546875, 0.0194091796875, -0.0003070831298828125, -0.00601196...

[ 32036, 60212, 32354, 5303, 400, 7008, 7115, 123309, 28966, 101790, 2499, 144573, 56037, 449, 46876, 1261, 39456, 87143, 765, 10, 35773, 1294, 47, 74481, 67, 10422, 13448, 271, 24189, 4034, 111, 17932, 12336, 35839, 179635, 79315, 237, 124850,...

[ 0.259765625, 0.29736328125, 0.2066650390625, 0.259033203125, 0.08355712890625, 0.20263671875, 0.1265869140625, 0.1361083984375, 0.1065673828125, 0.0018091201782226562, 0.04986572265625, 0.11920166015625, 0.12646484375, 0.041656494140625, 0.1632080078125, 0.1192626953125, 0.1666259765...

embed

7099567_c0

7099567

lisp

0

Title: Remove even appearance of elements from list with Lisp or PROLOG Problem title: Remove even appearance of elements from list with Lisp or PROLOG Tags: prolog, lisp Problem: Remove even appearance of elements from list with Lisp or PROLOG I have to delete even appearance of element from list using LISP or PROLOG....

Remove even appearance of elements from list with Lisp or PROLOG Remove even appearance of elements from list with Lisp or PROLOG prolog lisp list Remove Lisp PROLOG Remove even appearance of elements from list with Lisp or PROLOG I have to delete even appearance of element from list using LISP or PROLOG. Here is some ...

[ -0.0086669921875, 0.044189453125, 0.00191497802734375, 0.007568359375, -0.01513671875, 0.0281982421875, -0.0022735595703125, 0.0096435546875, 0.00958251953125, -0.007537841796875, 0.017578125, -0.011962890625, -0.00946044921875, 0.0029754638671875, 0.004241943359375, 0.032470703125, ...

[ 181139, 3853, 170894, 111, 80854, 1295, 5303, 1261, 7008, 10514, 47510, 678, 502, 4867, 400, 707, 765, 154109, 12830, 17368, 16970, 9434, 27781, 107730, 104116, 116, 6896, 190, 2788, 201, 32149, 4958, 140992, 9451, 1737, 63667, 238, 47143, ...

[ 0.1392822265625, 0.19970703125, 0.1947021484375, 0.037872314453125, 0.166748046875, 0.10479736328125, 0.195556640625, 0.15087890625, 0.2115478515625, 0.1246337890625, 0.2174072265625, 0.03240966796875, 0.07330322265625, 0.1817626953125, 0.10809326171875, 0.0202178955078125, 0.0011796...

embed

32304332_c0

32304332

lisp

0

Title: Python-String to function in 'eval' Problem title: Python-String to function in 'eval' Tags: string, lisp, eval Problem: Python-String to function in 'eval' I'm trying to build a lisp interpreter in python using 'eval'. def FUNC(e1,*elements): print(e1) eval((input())) Its working for integer...

Python-String to function in 'eval' Python-String to function in 'eval' string lisp eval Python-String FUNC Python-String to function in 'eval' I'm trying to build a lisp interpreter in python using 'eval'. Its working for integers.But is there any way I can use this to input strings? eg: when I inp...

[ 0.007080078125, 0.01123046875, -0.006378173828125, 0.0137939453125, -0.0023040771484375, 0.0228271484375, 0.0205078125, -0.01092529296875, 0.0029144287109375, -0.0498046875, 0.003631591796875, -0.021484375, -0.0194091796875, 0.0162353515625, -0.01324462890625, -0.0078125, -0.00585937...

[ 145581, 9, 71713, 214, 47, 32354, 23, 3768, 13, 1405, 79315, 400, 7008, 28, 136258, 441, 31577, 45367, 29481, 56, 17198, 50828, 17368, 20697, 892, 26255, 3917, 4527, 903, 107730, 3229, 36917, 18151, 5608, 28412, 87, 2301, 18, 3444, 237, ...

[ 0.2471923828125, 0.0261383056640625, 0.2252197265625, 0.140380859375, 0.1158447265625, 0.2139892578125, 0.10693359375, 0.07171630859375, 0.09075927734375, 0.273681640625, 0.228759765625, 0.1201171875, 0.1993408203125, 0.09619140625, 0.1571044921875, 0.042877197265625, 0.0379638671875...

embed

32767155_c0

32767155

lisp

0

Title: Why does Setq work but not let? Problem title: Why does Setq work but not let? Tags: common-lisp, lisp Problem: Why does Setq work but not let? I'm following the syntax as it is in my book "The land of lisp" and the let version only returns nil when passed *string*. Whereas the "setq" version returns the reverse...

Why does Setq work but not let? Why does Setq work but not let? common-lisp lisp Why Setq Why does Setq work but not let? I'm following the syntax as it is in my book "The land of lisp" and the let version only returns nil when passed *string*. Whereas the "setq" version returns the reversed version of string .

[ -0.0123291015625, 0.001220703125, 0.01385498046875, 0.037841796875, -0.017822265625, 0.01068115234375, 0.0189208984375, 0.006988525390625, 0.0076904296875, 0.01068115234375, -0.004119873046875, 0.0247802734375, -0.006439208984375, 0.0068359375, 0.004486083984375, 0.0198974609375, 0.0...

[ 44084, 14602, 19943, 864, 4488, 1284, 959, 2633, 39210, 4086, 254, 400, 7008, 6002, 86531, 12877, 3551, 111, 11389, 4734, 30646, 7, 17324, 3229, 115081, 91693, 3509, 39531, 5281, 79315 ]

[ 0.1497802734375, 0.0880126953125, 0.2265625, 0.26171875, 0.1773681640625, 0.1529541015625, 0.1558837890625, 0.2242431640625, 0.10546875, 0.06207275390625, 0.1358642578125, 0.07049560546875, 0.1533203125, 0.0005040168762207031, 0.1170654296875, 0.0760498046875, 0.08111572265625, 0.0...

embed

19739527_c0

19739527

lisp

0

Title: How do I start Hunchentoot? Problem title: How do I start Hunchentoot? Tags: lisp, hunchentoot, common-lisp Problem: How do I start Hunchentoot? How do I start Hunchentoot on a project? I looked over Edi Weitz's guide and everything went smoothly until after installation. The listed tutorials were either broken ...

How do I start Hunchentoot? How do I start Hunchentoot? lisp hunchentoot common-lisp How Hunchentoot How do I start Hunchentoot? How do I start Hunchentoot on a project? I looked over Edi Weitz's guide and everything went smoothly until after installation. The listed tutorials were either broken or skimmed over actual ...

[ -0.002166748046875, 0.007232666015625, 0.00860595703125, 0.0089111328125, -0.01361083984375, -0.00201416015625, 0.00640869140625, -0.01318359375, -0.0086669921875, -0.0240478515625, -0.00555419921875, -0.0032806396484375, -0.007537841796875, 0.02001953125, 0.01556396484375, -0.02722167...

[ 11249, 54, 87, 4034, 10453, 4834, 188, 818, 400, 7008, 1926, 39210, 4086, 254, 98, 13452, 17156, 24374, 17997, 156100, 59720, 145870, 57143, 148431, 9851, 8561, 10723, 127689, 420, 11435, 20600, 42548, 117538, 63773, 5423, 257, 23180, 2046, ...

[ 0.070068359375, 0.043304443359375, 0.0260772705078125, 0.16552734375, 0.18310546875, 0.1912841796875, 0.1983642578125, 0.25244140625, 0.08563232421875, 0.138671875, 0.1552734375, 0.0966796875, 0.07525634765625, 0.1290283203125, 0.03900146484375, 0.099365234375, 0.08056640625, 0.089...

embed

40687700_c0

40687700

lisp

0

Title: In Scheme what's the difference between a number and an object? Problem title: In Scheme what's the difference between a number and an object? Tags: lisp Problem: In Scheme what's the difference between a number and an object? If in Scheme I have something like: one = 1 and the number 1. What would the...

In Scheme what's the difference between a number and an object? In Scheme what's the difference between a number and an object? lisp Scheme In Scheme what's the difference between a number and an object? If in Scheme I have something like: one = 1 and the number 1. What would the difference be between these t...

[ 0.00958251953125, 0.01275634765625, 0.00164794921875, 0.0145263671875, -0.011962890625, 0.008056640625, -0.01318359375, 0.0025634765625, 0.0142822265625, -0.01104736328125, -0.016357421875, -0.031494140625, -0.005279541015625, 0.01177978515625, -0.00823974609375, 0.00176239013671875, ...

[ 360, 34702, 282, 2367, 3768, 70, 60212, 17721, 14012, 136, 142, 36746, 400, 7008, 7, 10, 23, 765, 9844, 1632, 2203, 106, 615, 2806, 6626, 26582, 2843, 4879, 8966, 3065, 707, 28, 15901, 101935 ]

[ 0.0753173828125, 0.2349853515625, 0.219482421875, 0.07220458984375, 0.0699462890625, 0.1192626953125, 0.2379150390625, 0.143310546875, 0.254638671875, 0.1497802734375, 0.057861328125, 0.25634765625, 0.061065673828125, 0.1446533203125, 0.0174560546875, 0.04766845703125, 0.039215087890...

embed

28942009_c0

28942009

lisp

0

Title: combination of pair subsets from a list in lisp Problem title: combination of pair subsets from a list in lisp Tags: subset, list, lisp Problem: combination of pair subsets from a list in lisp How to create all possible pairs subsets from a list in conman lisp. For example the list A contain four elements list A...

combination of pair subsets from a list in lisp combination of pair subsets from a list in lisp subset list lisp a combination of pair subsets from a list in lisp How to create all possible pairs subsets from a list in conman lisp. For example the list A contain four elements Could someone please help me out to generat...

[ -0.004547119140625, 0.023193359375, -0.010009765625, 0.017822265625, -0.0123291015625, 0.02197265625, -0.0267333984375, -0.0079345703125, -0.0087890625, -0.0025482177734375, 0.004486083984375, 0.0091552734375, 0.0255126953125, -0.006500244140625, -0.022216796875, -0.005828857421875, ...

[ 162515, 111, 80836, 1614, 3509, 7, 1295, 5303, 23, 400, 7008, 47, 28282, 756, 7722, 158, 669, 62, 70541, 22759, 80854, 4358, 139392 ]

[ 0.226318359375, 0.037200927734375, 0.267822265625, 0.1932373046875, 0.23583984375, 0.07147216796875, 0.07135009765625, 0.20458984375, 0.070068359375, 0.1260986328125, 0.21435546875, 0.00945281982421875, 0.12213134765625, 0.06121826171875, 0.1326904296875, 0.05322265625, 0.11053466796...

embed

27756741_c0

27756741

lisp

0

Title: how return subarray in Lisp? Problem title: how return subarray in Lisp? Tags: arrays, common-lisp, lisp Problem: how return subarray in Lisp? Is there a way to extract a subarray from an array? That is, a function of three arguments (the array, start index, and end index) that returns the subarray from the spec...

how return subarray in Lisp? how return subarray in Lisp? arrays common-lisp lisp Lisp Arrays.copyOfRange how return subarray in Lisp? Is there a way to extract a subarray from an array? That is, a function of three arguments (the array, start index, and end index) that returns the subarray from the specified indices. ...

[ -0.006500244140625, 0.0004177093505859375, 0.0016632080078125, 0.013671875, -0.0250244140625, -0.0025787353515625, -0.00787353515625, 0.01416015625, 0.01348876953125, -0.00244140625, 0.01226806640625, 0.00469970703125, -0.000217437744140625, 0.01129150390625, 0.01953125, -0.02185058593...

[ 3642, 30646, 166, 88500, 53, 23, 1261, 7008, 32, 10298, 4778, 39210, 4086, 254, 400, 69253, 137366, 132887, 51459, 10, 3917, 47, 125663, 1295, 32354, 17262, 10750, 4034, 63262, 3564, 58735, 136044, 41925, 2965, 28601 ]

[ 0.11517333984375, 0.2230224609375, 0.1529541015625, 0.2109375, 0.2108154296875, 0.06298828125, 0.1697998046875, 0.235595703125, 0.00982666015625, 0.168212890625, 0.1385498046875, 0.08221435546875, 0.1077880859375, 0.16162109375, 0.109619140625, 0.149169921875, 0.04937744140625, 0.0...

embed

66848481_c0

66848481

lisp

0

Title: What's the meaning of `indistinguishable` in Emacs Lisp? Problem title: What's the meaning of `indistinguishable` in Emacs Lisp? Tags: elisp, emacs, lisp Problem: What's the meaning of `indistinguishable` in Emacs Lisp? I was reading the documentation of an Emacs Lisp function called eql : Return t if ...

What's the meaning of `indistinguishable` in Emacs Lisp? What's the meaning of `indistinguishable` in Emacs Lisp? elisp emacs lisp What Emacs Lisp What's the meaning of `indistinguishable` in Emacs Lisp? I was reading the documentation of an Emacs Lisp function called eql : What's the meaning of indistinguish...

[ 0.0089111328125, -0.00933837890625, -0.00238037109375, -0.0033416748046875, 0.00092315673828125, 0.03369140625, -0.0028076171875, 0.00579833984375, 0.0030364990234375, 0.003448486328125, -0.0009613037109375, 0.0042724609375, -0.0126953125, 0.0072021484375, -0.01397705078125, -0.0064697...

[ 4865, 3768, 70, 91084, 19904, 7, 34971, 4745, 2886, 23, 85269, 4439, 1261, 7008, 15296, 352, 2263, 400, 111, 209806, 32354, 28, 99247, 106985, 3688, 187136 ]

[ 0.050323486328125, 0.0751953125, 0.037994384765625, 0.1746826171875, 0.1263427734375, 0.0672607421875, 0.1767578125, 0.14306640625, 0.207763671875, 0.026641845703125, 0.155517578125, 0.158203125, 0.1390380859375, 0.1881103515625, 0.0209808349609375, 0.05303955078125, 0.08221435546875...

embed

19196463_c0

19196463

lisp

0

Title: Whats the difference between '((1 2)(3 4)) and '('(1 2 )'(3 4)) in lisp? Problem title: Whats the difference between '((1 2)(3 4)) and '('(1 2 )'(3 4)) in lisp? Tags: lisp, common-lisp Problem: Whats the difference between '((1 2)(3 4)) and '('(1 2 )'(3 4)) in lisp? The le...

Whats the difference between '((1 2)(3 4)) and '('(1 2 )'(3 4)) in lisp? Whats the difference between '((1 2)(3 4)) and '('(1 2 )'(3 4)) in lisp? lisp common-lisp Whats Whats the difference between '((1 2)(3 4)) and '('(1 2 )'(3 4)) in lisp? The length of is being show 2 while th...

[ 0.00909423828125, 0.0203857421875, -0.01544189453125, 0.023193359375, -0.0020599365234375, 0.0255126953125, 0.01416015625, 0.0196533203125, 0.028076171875, -0.0234375, -0.0125732421875, -0.021240234375, 0.00726318359375, 0.01025390625, -0.0146484375, 0.01263427734375, 0.0025939941406...

[ 60212, 17721, 3768, 41600, 4958, 86827, 13956, 136, 116, 400, 7008, 39210, 4086, 254, 70, 23, 140909, 111, 7639, 12960, 5701, 26785, 127887, 615, 5117, 125195, 20653, 33636 ]

[ 0.21240234375, 0.0906982421875, 0.1292724609375, 0.08837890625, 0.1683349609375, 0.1309814453125, 0.227294921875, 0.0791015625, 0.16162109375, 0.114990234375, 0.1866455078125, 0.0880126953125, 0.0865478515625, 0.11376953125, 0.01666259765625, 0.041259765625, 0.146240234375, 0.14355...

embed

4868375_c0

4868375

lisp

0

Title: Is there anything like Lisp's SLIME for Python/Django? Problem title: Is there anything like Lisp's SLIME for Python/Django? Tags: python, slime, lisp, django Problem: Is there anything like Lisp's SLIME for Python/Django? I know about the Django console and it's useful to an extent but it would be rea...

Is there anything like Lisp's SLIME for Python/Django? Is there anything like Lisp's SLIME for Python/Django? python slime lisp django Lisp SLIME Python Django Is there anything like Lisp's SLIME for Python/Django? I know about the Django console and it's useful to an extent but it would be really nice to be ...

[ 0.005218505859375, 0.01953125, -0.0101318359375, 0.003997802734375, -0.0250244140625, 0.007568359375, -0.0012664794921875, 0.0023040771484375, 0.00030517578125, -0.0294189453125, 0.01031494140625, -0.00058746337890625, -0.0072021484375, 0.0111083984375, 0.006866455078125, 0.00379943847...

[ 2071, 2685, 23937, 1884, 1261, 7008, 3768, 7, 42135, 66820, 100, 145581, 30630, 31, 397, 17198, 50828, 34264, 13, 400, 107473, 27803, 39424, 3714, 130250, 80234, 2806, 6183, 26267, 27211, 18151, 9803, 46844, 85269, 4439, 33493, 35782 ]

[ 0.00006103515625, 0.03167724609375, 0.10687255859375, 0.13623046875, 0.1802978515625, 0.2490234375, 0.051971435546875, 0.06982421875, 0.2197265625, 0.2880859375, 0.09405517578125, 0.270751953125, 0.139404296875, 0.181396484375, 0.0302734375, 0.08331298828125, 0.112060546875, 0.1918...

embed

26835587_c0

26835587

lisp

0

Title: LISP: Removing elements from list already existing in another Problem title: LISP: Removing elements from list already existing in another Tags: remove-if, project, list, lisp, duplicates Problem: LISP: Removing elements from list already existing in another Can anybody explain to me why this: (remove-if #'(lamb...

LISP: Removing elements from list already existing in another LISP: Removing elements from list already existing in another remove-if project list lisp duplicates list LISP Removing LISP: Removing elements from list already existing in another Can anybody explain to me why this: returns this: but this: returns this: ?

[ -0.01129150390625, 0.031494140625, -0.00616455078125, 0.03125, -0.0087890625, 0.0067138671875, 0.0257568359375, 0.0233154296875, 0.01458740234375, -0.022216796875, -0.01129150390625, 0.00823974609375, 0.0064697265625, -0.00323486328125, -0.007598876953125, -0.002685546875, -0.0014953...

[ 16970, 9434, 853, 432, 6496, 80854, 1295, 5303, 21771, 144573, 15700, 87388, 3190, 13452, 400, 7008, 171763, 1636, 23, 73342, 15400, 30646, 7, 903, 1284 ]

[ 0.1258544921875, 0.206787109375, 0.0294952392578125, 0.130859375, 0.0484619140625, 0.1492919921875, 0.088623046875, 0.1597900390625, 0.0994873046875, 0.171142578125, 0.06298828125, 0.1400146484375, 0.10107421875, 0.09466552734375, 0.1163330078125, 0.171630859375, 0.181884765625, 0....

embed

8145008_c0

8145008

lisp

0

Title: How to parse a string as a list structure? Problem title: How to parse a string as a list structure? Tags: common-lisp, lisp Problem: How to parse a string as a list structure? I have a string, which holds a a list structure like ((p X) (q (f X))) and I would really like to find a function that interprets/conver...

How to parse a string as a list structure? How to parse a string as a list structure? common-lisp lisp How How to parse a string as a list structure? I have a string, which holds a a list structure like ((p X) (q (f X))) and I would really like to find a function that interprets/converts this string as a list of lists ...

[ -0.0054931640625, 0.0096435546875, -0.017822265625, 0.019287109375, -0.0125732421875, 0.045654296875, 0.0036163330078125, -0.008544921875, -0.0004024505615234375, -0.026611328125, -0.0050048828125, -0.01043701171875, -0.01708984375, -0.0035858154296875, -0.01214599609375, 0.0166015625,...

[ 11249, 47, 366, 184, 79315, 237, 10, 5303, 45646, 39210, 4086, 254, 400, 7008, 16401, 1193, 864, 420, 6183, 1884, 7413, 32354, 29481, 11549, 6562, 30482, 11001, 12830, 10433, 19, 155648, 23, 26582 ]

[ 0.07891845703125, 0.05145263671875, 0.1717529296875, 0.158447265625, 0.26611328125, 0.1480712890625, 0.0938720703125, 0.22314453125, 0.26318359375, 0.1199951171875, 0.06842041015625, 0.1383056640625, 0.0721435546875, 0.1629638671875, 0.064208984375, 0.09161376953125, 0.095458984375, ...

embed

59635690_c0

59635690

lisp

0

Title: How to debug quickloaded library in sbcl Problem title: How to debug quickloaded library in sbcl Tags: sbcl, lisp, common-lisp Problem: How to debug quickloaded library in sbcl I’m running into the exact same problem as this question , and I was wondering: given that sbcl drops you into a debugger repl when this...

How to debug quickloaded library in sbcl How to debug quickloaded library in sbcl sbcl lisp common-lisp How How to debug quickloaded library in sbcl I’m running into the exact same problem as this question , and I was wondering: given that sbcl drops you into a debugger repl when this happens, what is the best way to g...

[ 0.004180908203125, 0.00244140625, -0.01348876953125, 0.000720977783203125, -0.023681640625, 0.0020599365234375, 0.008544921875, 0.023193359375, 0.005523681640625, -0.0303955078125, -0.0084228515625, -0.0206298828125, 0.00982666015625, -0.01031494140625, 0.0091552734375, -0.007415771484...

[ 11249, 47, 8, 85779, 63773, 63033, 297, 35773, 1294, 23, 91, 275, 34937, 400, 7008, 39210, 4086, 254, 36069, 3934, 978, 21407, 456, 2424, 2965, 63134, 105727, 65514, 10484, 59335, 26484, 157318 ]

[ 0.04833984375, 0.029815673828125, 0.13818359375, 0.248779296875, 0.1241455078125, 0.205810546875, 0.07080078125, 0.1612548828125, 0.100830078125, 0.041015625, 0.049407958984375, 0.07855224609375, 0.172119140625, 0.037750244140625, 0.13232421875, 0.110595703125, 0.041595458984375, 0...

embed

48484178_c0

48484178

lisp

0

Title: Guile scheme cond ERROR: Wrong type to apply: (1 2 3 4) Problem title: Guile scheme cond ERROR: Wrong type to apply: (1 2 3 4) Tags: scheme, list, lisp Problem: Guile scheme cond ERROR: Wrong type to apply: (1 2 3 4) I am playing with scheme and puzzled in to this crazy issue (define func((lambda N lst) (if(eq? ...

Guile scheme cond ERROR: Wrong type to apply: (1 2 3 4) Guile scheme cond ERROR: Wrong type to apply: (1 2 3 4) scheme list lisp Guile ERROR Wrong Guile scheme cond ERROR: Wrong type to apply: (1 2 3 4) I am playing with scheme and puzzled in to this crazy issue calling function got following error when I called functi...

[ -0.021240234375, 0.0157470703125, 0.007476806640625, 0.003448486328125, 0.0091552734375, 0.0155029296875, 0.0155029296875, 0.015625, -0.01202392578125, -0.0224609375, 0.004669189453125, -0.035888671875, -0.01904296875, -0.0201416015625, 0.00250244140625, -0.000152587890625, -0.001464...

[ 53513, 133, 150370, 158, 71, 151206, 24638, 601, 35133, 10644, 47, 59911, 138, 13956, 5303, 400, 7008, 75169, 104192, 116666, 31089, 159029, 32354, 25632, 18499, 3229, 35839 ]

[ 0.1851806640625, 0.2161865234375, 0.2247314453125, 0.1285400390625, 0.10205078125, 0.1527099609375, 0.12310791015625, 0.0108489990234375, 0.1314697265625, 0.17333984375, 0.009552001953125, 0.1268310546875, 0.0266265869140625, 0.10308837890625, 0.11199951171875, 0.04071044921875, 0.11...

embed

20139672_c0

20139672

lisp

0

Title: Is assoc just syntax sugar for find? Problem title: Is assoc just syntax sugar for find? Tags: lisp, common-lisp Problem: Is assoc just syntax sugar for find? CL-USER> *mylist* ((RED . 5) (RED . 4) (RED . 3) (BLUE . 5) (RED . 2) (BLUE . 4)) CL-USER> (assoc 'blue *mylist*) (BLUE . 5) CL-USER> (find 'blue *mylist*...

Is assoc just syntax sugar for find? Is assoc just syntax sugar for find? lisp common-lisp CL-USER RED BLUE Is assoc just syntax sugar for find? It would seem to me that assoc is just a particular case of find , is this true or am I missing some extra functionality from assoc that is not apparent here?

[ -0.0025482177734375, 0.00531005859375, 0.0093994140625, -0.01153564453125, -0.00830078125, 0.000591278076171875, 0.0123291015625, 0.0142822265625, 0.0177001953125, -0.0137939453125, 0.0078125, 0.007080078125, 0.00738525390625, -0.01483154296875, 0.000301361083984375, -0.00677490234375,...

[ 2071, 63927, 238, 1660, 6002, 86531, 101087, 100, 7413, 400, 7008, 39210, 4086, 254, 46323, 1062, 50184, 118790, 210851, 48903, 83, 17311, 7225, 111, 29568, 132283, 4173, 123309, 173676, 3688 ]

[ 0.01178741455078125, 0.201171875, 0.223388671875, 0.06927490234375, 0.1409912109375, 0.1856689453125, 0.2384033203125, 0.0643310546875, 0.2120361328125, 0.086669921875, 0.155029296875, 0.1278076171875, 0.061004638671875, 0.132080078125, 0.059356689453125, 0.100830078125, 0.0992431640...

embed

56112596_c0

56112596

lisp

0

Title: How to write macro expand in custom defined LISP in JavaScript Problem title: How to write macro expand in custom defined LISP in JavaScript Tags: macros, lisp, lisp-macros, javascript Problem: How to write macro expand in custom defined LISP in JavaScript Code signals: How, LISP, JavaScript, macro_expand, Pair,...

How to write macro expand in custom defined LISP in JavaScript How to write macro expand in custom defined LISP in JavaScript macros lisp lisp-macros javascript How LISP JavaScript macro_expand Pair node.car Symbol env.get Macro value.defmacro value.invoke node.cdr new_code code.toString new_code.toString new_code.car ...

[ 0.00970458984375, 0.0096435546875, -0.026611328125, 0.037841796875, -0.005523681640625, 0.0267333984375, -0.0029754638671875, 0.0211181640625, 0.011962890625, -0.028564453125, 0.0093994140625, -0.0179443359375, 0.0108642578125, -0.0177001953125, 0.01226806640625, -0.01416015625, 0.00...

[ 11249, 33022, 111789, 71062, 23, 114122, 61924, 16970, 9434, 17925, 400, 7008, 35572, 3666, 136951, 83613, 2940, 1342, 110, 112, 3284, 131899, 334, 3794, 4727, 516, 34292, 15322, 23253, 7569, 40899, 18151, 29713, 10588, 106357, 84079, 70820, ...

[ 0.0631103515625, 0.19189453125, 0.248046875, 0.290771484375, 0.050994873046875, 0.1500244140625, 0.17138671875, 0.15380859375, 0.2176513671875, 0.23828125, 0.1180419921875, 0.1715087890625, 0.026153564453125, 0.0809326171875, 0.17626953125, 0.1846923828125, 0.1778564453125, 0.06719...

embed

3526497_c0

3526497

lisp

0

Title: Scheme or Common Lisp? Problem title: Scheme or Common Lisp? Tags: scheme, programming-languages, lisp, common-lisp Problem: Scheme or Common Lisp? I am an intermediate programmer, and have decided to learn either common lisp or scheme. My question is simple, which one would you choose? I don't care much for the...

Scheme or Common Lisp? Scheme or Common Lisp? scheme programming-languages lisp common-lisp Scheme Common Lisp Scheme or Common Lisp? I am an intermediate programmer, and have decided to learn either common lisp or scheme. My question is simple, which one would you choose? I don't care much for the difficulty of the sy...

[ 0.01226806640625, 0.0242919921875, 0.00107574462890625, 0.02490234375, -0.0238037109375, -0.00689697265625, -0.01483154296875, -0.0019989013671875, 0.0079345703125, -0.0255126953125, 0.00897216796875, -0.004119873046875, -0.005859375, -0.002899169921875, -0.00634765625, -0.012878417968...

[ 34702, 282, 707, 151301, 1261, 7008, 32, 150370, 56037, 449, 196651, 400, 39210, 4086, 254, 81814, 2182, 77848, 68872, 30698, 40101, 9655, 8781, 3129, 1632, 2806, 398, 55076, 517, 34844, 6002, 86531, 14537, 71985, 46876, 208124 ]

[ 0.263427734375, 0.25341796875, 0.1236572265625, 0.2171630859375, 0.210693359375, 0.2388916015625, 0.0239715576171875, 0.289794921875, 0.12060546875, 0.03521728515625, 0.1275634765625, 0.1678466796875, 0.1798095703125, 0.1409912109375, 0.1607666015625, 0.07958984375, 0.0594482421875, ...

embed

35323798_c0

35323798

lisp

0

Title: Compute euclidean distance with mapcar and apply Problem title: Compute euclidean distance with mapcar and apply Tags: common-lisp, lisp Problem: Compute euclidean distance with mapcar and apply I am trying to create a function that computes this using apply and mapcar. I am stuck after using the first mapcar to...

Compute euclidean distance with mapcar and apply Compute euclidean distance with mapcar and apply common-lisp lisp Compute Compute euclidean distance with mapcar and apply I am trying to create a function that computes this using apply and mapcar. I am stuck after using the first mapcar to get all the differences of p-...

[ 0.003997802734375, 0.01202392578125, 0.015869140625, 0.005035400390625, -0.0103759765625, 0.0228271484375, 0.00079345703125, 0.011474609375, 0.00714111328125, -0.052734375, 0.0146484375, -0.006195068359375, 0.008056640625, -0.00174713134765625, -0.046142578125, -0.0146484375, 0.00521...

[ 159415, 13, 1175, 34937, 130265, 62488, 678, 22288, 3284, 136, 59911, 39210, 4086, 254, 400, 7008, 31577, 28282, 32354, 375, 7077, 17368, 179933, 5117, 2046, 756, 60212, 915, 9, 864, 23, 5303, 11249, 54, 87, 108047, 80854, 10554, 1257 ]

[ 0.1776123046875, 0.0762939453125, 0.06634521484375, 0.13037109375, 0.1702880859375, 0.244384765625, 0.103515625, 0.1728515625, 0.25927734375, 0.052337646484375, 0.220947265625, 0.1171875, 0.064697265625, 0.1326904296875, 0.0662841796875, 0.1463623046875, 0.034698486328125, 0.026977...

embed

21895659_c1

21895659

lisp

1

identify n number of initialize-instance methods per class and per any number of arguments. (defmethod initialize-instance :after ((f foo) &key) ()) but it is not clear to me how I can translate this to the vanilla example I gave above. And I feel like I could be barking up the wrong tree since this is part of MOP. Co...

[ 0.019287109375, 0.01416015625, 0.0031890869140625, -0.000850677490234375, 0.00933837890625, 0.0032958984375, 0.0162353515625, -0.0076904296875, 0.036865234375, -0.005950927734375, -0.0264892578125, -0.032958984375, 0.0020599365234375, 0.021240234375, -0.01458740234375, -0.02392578125, ...

[ 135812, 653, 14012, 111, 61475, 20650, 73, 116071, 150624, 117, 18507, 10750, 112, 420, 1928, 7352, 46327, 60494, 5775, 31, 619, 19770, 34735, 3900, 19309, 47, 131, 2298, 27781, 36917, 12319, 5809, 1909, 6048, 70, 44691, 53201, 2831, 276, ...

[ 0.1771240234375, 0.062255859375, 0.1265869140625, 0.0517578125, 0.2264404296875, 0.1898193359375, 0.1317138671875, 0.2325439453125, 0.253173828125, 0.094970703125, 0.218994140625, 0.2083740234375, 0.03369140625, 0.1427001953125, 0.130859375, 0.15380859375, 0.159912109375, 0.0269317...

embed

8670207_c0

8670207

lisp

0

Title: when to quote symbol in Emacs Lisp Problem title: when to quote symbol in Emacs Lisp Tags: elisp, lisp, emacs Problem: when to quote symbol in Emacs Lisp I've beginning learning programming with Emacs Lisp. I'm so confused by symbol quotation. For example: (progn (setq a '(1 2)) (prin1 a) (add-to-list 'a 3) (pri...

when to quote symbol in Emacs Lisp when to quote symbol in Emacs Lisp elisp lisp emacs Emacs Lisp prin1 when to quote symbol in Emacs Lisp I've beginning learning programming with Emacs Lisp. I'm so confused by symbol quotation. For example: why the "add-to-list" function need a quoted symbol as its first argument, whi...

[ 0.011962890625, 0.00726318359375, 0.00157928466796875, 0.0113525390625, -0.031494140625, 0.010498046875, -0.00555419921875, 0.023193359375, -0.004241943359375, 0.003143310546875, -0.01239013671875, -0.003997802734375, -0.029052734375, 0.0106201171875, -0.01708984375, 0.006011962890625,...

[ 3229, 47, 66747, 26582, 23, 85269, 4439, 1261, 7008, 15296, 400, 352, 2263, 2448, 52080, 56037, 55681, 81732, 1363, 15400, 4028, 188, 6562, 32354, 3871, 71, 237, 5117, 10750, 3509, 3284, 136, 7332, 127, 110 ]

[ 0.1192626953125, 0.0531005859375, 0.261474609375, 0.264404296875, 0.0478515625, 0.1448974609375, 0.1455078125, 0.1265869140625, 0.2139892578125, 0.01239013671875, 0.058380126953125, 0.0169677734375, 0.04046630859375, 0.0689697265625, 0.00958251953125, 0.08099365234375, 0.052886962890...

embed

13723402_c0

13723402

lisp

0

Title: Counting numbers or characters in list in Scheme Problem title: Counting numbers or characters in list in Scheme Tags: scheme, list, lisp, counting Problem: Counting numbers or characters in list in Scheme does anyone know how to count all numbers or characters in list and print it in pair in this format: (numbe...

Counting numbers or characters in list in Scheme Counting numbers or characters in list in Scheme scheme list lisp counting Counting Scheme Counting numbers or characters in list in Scheme does anyone know how to count all numbers or characters in list and print it in pair in this format: (number . number_of_occurrence...

[ 0.001312255859375, 0.01007080078125, -0.0086669921875, 0.018798828125, 0.00567626953125, 0.0034637451171875, -0.0224609375, -0.017822265625, 0.005706787109375, -0.0206298828125, -0.0068359375, -0.037353515625, 0.0244140625, 0.020263671875, -0.0118408203125, -0.0322265625, -0.00311279...

[ 1311, 128396, 101935, 707, 124850, 23, 5303, 34702, 282, 150370, 400, 7008, 54529, 214, 35672, 3714, 3642, 47, 756, 28412, 442, 80836, 903, 9384, 2606, 1297, 5, 14012, 4390, 6652, 64240, 27781, 129745, 120592 ]

[ 0.153076171875, 0.199462890625, 0.22607421875, 0.07305908203125, 0.21875, 0.09259033203125, 0.22900390625, 0.1905517578125, 0.1861572265625, 0.2271728515625, 0.08099365234375, 0.15869140625, 0.240478515625, 0.03936767578125, 0.043212890625, 0.11297607421875, 0.09490966796875, 0.058...

embed

1960207_c0

1960207

lisp

0

Title: A list of functions Problem title: A list of functions Tags: lisp, scheme, functional-programming Problem: A list of functions Is there a way to make a list that holds functions? What I'm trying to do is, make a list of some arithmetic operators (+ - * /) so I can easily manipulate their order and apply them to ...

A list of functions A list of functions lisp scheme functional-programming A list of functions Is there a way to make a list that holds functions? What I'm trying to do is, make a list of some arithmetic operators (+ - * /) so I can easily manipulate their order and apply them to a list of numbers. So, if I have that l...

[ 0.00689697265625, 0.0038299560546875, 0.00168609619140625, -0.01123046875, -0.0079345703125, 0.002227783203125, -0.0037689208984375, -0.00640869140625, 0.001068115234375, -0.055419921875, -0.00167083740234375, -0.0242919921875, -0.00946044921875, 0.006591796875, -0.00872802734375, 0.00...

[ 62, 5303, 111, 32354, 7, 400, 7008, 150370, 123309, 28966, 2685, 10, 3917, 47, 3249, 450, 16401, 31577, 8962, 282, 9523, 39933, 22183, 20, 661, 248, 831, 72546, 45258, 12989, 59911, 101935, 765, 71, 4527, 1884, 903, 39, 95968, 77848, 11...

[ 0.0543212890625, 0.2685546875, 0.0968017578125, 0.263671875, 0.1241455078125, 0.084716796875, 0.173095703125, 0.1552734375, 0.161865234375, 0.1187744140625, 0.03851318359375, 0.0916748046875, 0.10284423828125, 0.01104736328125, 0.12060546875, 0.033843994140625, 0.1912841796875, 0.0...

embed

1007250_c0

1007250

lisp

0

Title: Which dialect of Lisp should I learn? Problem title: Which dialect of Lisp should I learn? Tags: lisp, dialect Problem: Which dialect of Lisp should I learn? I know there are a few different dialects of Lisp. Having decided that learning Lisp would be a new intellectual experience, I would like to know which Lis...

Which dialect of Lisp should I learn? Which dialect of Lisp should I learn? lisp dialect Which Lisp Which dialect of Lisp should I learn? I know there are a few different dialects of Lisp. Having decided that learning Lisp would be a new intellectual experience, I would like to know which Lisp dialect to learn, and why...

[ 0.013916015625, 0.004058837890625, 0.00927734375, 0.0233154296875, -0.01007080078125, 0.0034332275390625, 0, 0.0014495849609375, 0.0048828125, 0.01043701171875, -0.0011749267578125, -0.0299072265625, -0.00897216796875, 0.00799560546875, -0.003509521484375, 0.001678466796875, -0.01086...

[ 130078, 220734, 111, 1261, 7008, 5608, 87, 30698, 400, 10846, 12921, 52080, 91768, 16981, 1884, 3714, 3129, 47, 15400, 1286, 5700, 131801, 11522, 12937, 8060, 38280, 158, 903 ]

[ 0.1368408203125, 0.26611328125, 0.08447265625, 0.1953125, 0.23193359375, 0.151123046875, 0.07244873046875, 0.16259765625, 0.1553955078125, 0.022674560546875, 0.1007080078125, 0.1046142578125, 0.06207275390625, 0.065185546875, 0.00927734375, 0.006622314453125, 0.053131103515625, 0.0...

embed

71551767_c1

71551767

lisp

1

") (values hours minutes))))) (struct AM/PM 24HourClock (meridiem) #:transparent #:guard (lambda (hours minutes meridiem err_name) (if (not(and(and(number? hours)(> hours 0)(<= hours 12)(number? minutes)))) (error err_name "Hours must be between 1 and 12 : 0") (if [not (and(string? meridiem)(or (equal? meridiem "am") (...

[ -0.00262451171875, 0.00555419921875, 0.0021209716796875, 0.009521484375, 0.0133056640625, -0.0019378662109375, -0.011962890625, -0.01611328125, 0.0155029296875, 0.0264892578125, 0.0025634765625, -0.01300048828125, 0.0242919921875, -0.0030517578125, 0.00174713134765625, -0.0002384185791...

[ 44, 16, 27494, 90, 21974, 14633, 80126, 36716, 9677, 64, 20266, 744, 11193, 474, 441, 21135, 30547, 428, 195, 30145, 99547, 32116, 6492, 85, 497, 12824, 15632, 72, 42, 11627, 3190, 10869, 2940, 2606, 2740, 757, 427, 1297, 188800, 8110, ...

[ 0.1136474609375, 0.065673828125, 0.186279296875, 0.07781982421875, 0.266845703125, 0.284423828125, 0.1485595703125, 0.212890625, 0.1561279296875, 0.1285400390625, 0.20166015625, 0.2032470703125, 0.198974609375, 0.1673583984375, 0.0831298828125, 0.24462890625, 0.1309814453125, 0.120...

embed

74071649_c3

74071649

lisp

3

FEKTIONSKRANKHEITEN, HEPATITIS-B, STAUPE, JAPANISCHE-ENZEPHALITIS, INFLUENZA, INFEKTIOESE-BURSITIS-DER-HUEHNER, EIGENSCHAFTEN, ADAPTOGEN, ANTIBAKTERIELL, ANTIHEPATOTOXISCH, ANTIVIRAL, KARDIOPROTEKTIV, DIURETIKUM, BLUTDRUCKSENKEND, IMMUNSTAERKER, VERBESSERN, BLUTKREISLAUF, IMMUNFUNKTION, VERRINGERN, VIRALEN-INFEKTIONEN,...

[ 0.00035858154296875, -0.01116943359375, -0.0198974609375, -0.0018463134765625, 0.006744384765625, -0.00787353515625, -0.004791259765625, 0.00384521484375, 0.00396728515625, 0.0302734375, 0.00909423828125, 0.0037384033203125, -0.0211181640625, -0.00003814697265625, -0.00994873046875, -0...

[ 563, 15567, 165117, 30174, 74229, 31381, 21170, 4, 27544, 65135, 35522, 294, 571, 64174, 18409, 647, 226403, 9956, 48858, 11572, 19157, 54259, 20296, 80091, 5881, 919, 22335, 178317, 30018, 139980, 112045, 18044, 27204, 51675, 52952, 89190, 390...

[ 0.1239013671875, 0.1756591796875, 0.14501953125, 0.2071533203125, 0.102294921875, 0.0970458984375, 0.163330078125, 0.08660888671875, 0.1505126953125, 0.14453125, 0.1639404296875, 0.09405517578125, 0.1390380859375, 0.1444091796875, 0.1380615234375, 0.1324462890625, 0.1463623046875, ...

embed

41131196_c0

41131196

lisp

0

Title: LISP - sequence of integers Problem title: LISP - sequence of integers Tags: list, lisp Problem: LISP - sequence of integers Does exist a function in LISP for making a sequence of integers like (0 1 2 3) ? I found make-sequence , but I didn't find out how to make a sequence of integers. I tried make-list and not...

LISP - sequence of integers LISP - sequence of integers list lisp LISP LISP - sequence of integers Does exist a function in LISP for making a sequence of integers like (0 1 2 3) ? I found make-sequence , but I didn't find out how to make a sequence of integers. I tried make-list and nothing. I know that in Scheme exist...

[ 0.002777099609375, 0.0390625, -0.0162353515625, 0.010009765625, 0.00185394287109375, 0.02392578125, -0.0118408203125, 0.01519775390625, -0.00005245208740234375, -0.028564453125, -0.00848388671875, -0.00787353515625, -0.001800537109375, 0.025634765625, -0.003997802734375, -0.01068115234...

[ 16970, 9434, 40, 944, 3956, 892, 26255, 111, 5303, 400, 7008, 101790, 32316, 10, 32354, 23, 100, 20662, 1884, 22085, 106, 116, 8439, 14037, 3249, 184, 7413, 1810, 3642, 47, 37842, 6562, 33720, 34702, 282, 177149, 9, 190, 6492, 85, 425, ...

[ 0.1595458984375, 0.25537109375, 0.0928955078125, 0.1788330078125, 0.06884765625, 0.1790771484375, 0.1689453125, 0.053863525390625, 0.1639404296875, 0.1138916015625, 0.182373046875, 0.023223876953125, 0.1302490234375, 0.06005859375, 0.2259521484375, 0.0863037109375, 0.06414794921875, ...

embed

47884250_c0

47884250

lisp

0

Title: How to work with specific range of numbers in lists in scheme? Problem title: How to work with specific range of numbers in lists in scheme? Tags: racket, list, lisp, scheme Problem: How to work with specific range of numbers in lists in scheme? I'm learning scheme and I would like to know how to remove, for exa...

How to work with specific range of numbers in lists in scheme? How to work with specific range of numbers in lists in scheme? racket list lisp scheme How How to work with specific range of numbers in lists in scheme? I'm learning scheme and I would like to know how to remove, for example the negative numbers of a list ...

[ -0.025390625, 0.019287109375, -0.00262451171875, 0.0035858154296875, -0.0054931640625, 0.01007080078125, 0.0181884765625, 0.02783203125, 0.00445556640625, 0.009521484375, -0.0018463134765625, -0.004119873046875, -0.0181884765625, -0.006439208984375, -0.00119781494140625, 0.000503540039...

[ 11249, 47, 4488, 678, 29458, 37457, 101935, 23, 5303, 7, 150370, 673, 27853, 400, 7008, 52080, 1884, 3714, 3642, 87388, 40907, 111, 24491, 24189, 5036, 4163, 468, 64457, 49146, 6496, 18151 ]

[ 0.09173583984375, 0.051177978515625, 0.1534423828125, 0.135498046875, 0.185302734375, 0.188232421875, 0.191162109375, 0.0792236328125, 0.22216796875, 0.0933837890625, 0.2342529296875, 0.044830322265625, 0.1571044921875, 0.06689453125, 0.157958984375, 0.0269927978515625, 0.02661132812...

embed

67533882_c1

67533882

lisp

1

place-image cat1 (tock x) Y-cat1 BACKGROUND)])) #new version (define (render x) (cond [(< (tock x) RESTART-POINT) (place-image cat1 (tock x) Y-cat1 BACKGROUND)] [(>= (tock x) RESTART-POINT) (place-image cat1 (modulo(tock x)RESTART-POINT) Y-cat1 BACKGROUND)])) This runs the pic of a cat across the screen, but the cat ne...

[ -0.01214599609375, 0.011962890625, -0.010009765625, -0.00057220458984375, 0.0218505859375, -0.0069580078125, -0.0074462890625, -0.01043701171875, 0.0035400390625, -0.0133056640625, -0.004486083984375, -0.005889892578125, -0.000476837158203125, -0.0078125, 0.0031280517578125, -0.0009460...

[ 3687, 37926, 7515, 418, 188, 2594, 1022, 990, 4460, 8678, 20572, 136498, 34384, 54936, 11389, 64552, 18280, 42, 2271, 71, 16093, 627, 21828, 47136, 9698, 59537, 23935, 83279, 34465, 37142, 3293, 127877, 70, 8834, 111, 36880, 49119, 1284, 83...

[ 0.1689453125, 0.20263671875, 0.236083984375, 0.098388671875, 0.0946044921875, 0.0772705078125, 0.1265869140625, 0.10791015625, 0.177734375, 0.088134765625, 0.0684814453125, 0.1343994140625, 0.08831787109375, 0.01788330078125, 0.08184814453125, 0.1016845703125, 0.107177734375, 0.036...

embed

13107051_c0

13107051

lisp

0

Title: Writing C code in Lisp Problem title: Writing C code in Lisp Tags: root, c, lisp Problem: Writing C code in Lisp Recently I have had to write code in C as the platform I am using for a project I am undertaking- namely root- uses a C/C++ command line interpreter (CINT). However, I want to remain coding in Lisp. I...

Writing C code in Lisp Writing C code in Lisp root c lisp Writing Lisp Writing C code in Lisp Recently I have had to write code in C as the platform I am using for a project I am undertaking- namely root- uses a C/C++ command line interpreter (CINT). However, I want to remain coding in Lisp. In 'ANSI Common Lisp' Graha...

[ 0.011474609375, 0.0223388671875, 0.002685546875, 0.0093994140625, -0.0050048828125, 0.00677490234375, 0.0087890625, -0.005828857421875, -0.0011138916015625, -0.0419921875, -0.01361083984375, 0.01171875, -0.0029144287109375, 0.005859375, 0.00057220458984375, 0.000240325927734375, -0.0...

[ 213185, 313, 18151, 23, 1261, 7008, 74855, 501, 400, 33022, 13651, 17368, 13452, 4527, 64, 37223, 75101, 13315, 29481, 56, 59537, 3444, 47, 47143, 552, 6238, 48789, 568, 151301, 147756, 831, 162515, 619, 16321, 11752, 29954, 7722, 1632, 54 ...

[ 0.14208984375, 0.170654296875, 0.2318115234375, 0.0743408203125, 0.177490234375, 0.232177734375, 0.189453125, 0.126220703125, 0.1383056640625, 0.1431884765625, 0.1168212890625, 0.0635986328125, 0.047637939453125, 0.0166778564453125, 0.0295867919921875, 0.139404296875, 0.10400390625, ...

embed

26902224_c0

26902224

lisp

0

Title: why `and` operator in scheme is not an built-in procedure Problem title: why `and` operator in scheme is not an built-in procedure Tags: lisp, scheme Problem: why `and` operator in scheme is not an built-in procedure I use chicken Scheme interpreter, and when I type not , it returns #<procedure (not x295)> , but...

why `and` operator in scheme is not an built-in procedure why `and` operator in scheme is not an built-in procedure lisp scheme x295 Error why `and` operator in scheme is not an built-in procedure I use chicken Scheme interpreter, and when I type not , it returns #<procedure (not x295)> , but when I tried and and or , ...

[ -0.003326416015625, 0.01129150390625, 0.017822265625, 0.0113525390625, -0.0157470703125, 0.0198974609375, -0.010009765625, -0.00909423828125, -0.0030975341796875, -0.015869140625, -0.01708984375, -0.035400390625, -0.00628662109375, -0.0240478515625, 0.0133056640625, -0.01043701171875, ...

[ 15400, 2940, 39933, 23, 150370, 83, 959, 88303, 73, 50491, 400, 7008, 304, 8821, 212059, 142, 143896, 34702, 282, 29481, 56, 10644, 30646, 232578, 10869, 1022, 108035, 87, 37842, 136, 707, 51, 99091, 77336, 10, 12921, 29568, 420, 151575 ]

[ 0.0931396484375, 0.2587890625, 0.25341796875, 0.05841064453125, 0.2210693359375, 0.0653076171875, 0.1527099609375, 0.1331787109375, 0.1246337890625, 0.2056884765625, 0.061981201171875, 0.1583251953125, 0.0654296875, 0.2064208984375, 0.1446533203125, 0.012237548828125, 0.166748046875,...

embed

17900996_c1

17900996

lisp

1

-bind (q r) (floor n m) (cons (nth q lst) (permute-b r (remove-nth q lst))) ) (NOTE: I may have mis-indented it, which may be affecting my lack of understanding) What I don't get about this is it looks to me as if there are 2 variables being multiply-bound (q & r), but only one value (floor n m) . Or is the other value...

[ -0.032958984375, 0.031494140625, 0.0022430419921875, -0.0198974609375, -0.00146484375, 0.021240234375, 0.0003337860107421875, -0.018310546875, 0.0213623046875, -0.01068115234375, 0.0029144287109375, -0.004425048828125, 0.00811767578125, 0.006072998046875, -0.034912109375, -0.0066833496...

[ 20, 89817, 864, 1690, 52347, 748, 653, 347, 25553, 927, 8096, 271, 561, 67, 26973, 100094, 2301, 18, 2046, 903, 33342, 116, 77336, 8035, 6024, 62479, 99091, 619, 4734, 1632, 34292, 3789, 158, 7, 63805, 2685, 110, 14361, 64557, 48716, 27...

[ 0.0003662109375, 0.28759765625, 0.1517333984375, 0.1318359375, 0.1077880859375, 0.04473876953125, 0.03302001953125, 0.146484375, 0.1849365234375, 0.06396484375, 0.1265869140625, 0.0191802978515625, 0.1507568359375, 0.0137939453125, 0.0343017578125, 0.0176849365234375, 0.0018615722656...

embed

58628302_c1

58628302

lisp

1

;setCell Matrix Row Column Item (define (setCell Matrix Row Column Item) (if (= Row 1) (if (= Column 1) (helpMe Matrix Item) (cons (cons (car (car Matrix)) (setCell (cons (cdr (car Matrix)) ()) Row (- Column 1) Item)) (cdr Matrix)) ) (cons (car Matrix) (setCell (cdr Matrix) (- Row 1) Column Item)) ) ) (define (helpMe ...

[ -0.0244140625, 0.027099609375, 0.0274658203125, 0.0301513671875, 0.040283203125, -0.01409912109375, -0.0302734375, 0.003082275390625, 0.0031585693359375, 0.0262451171875, 0.002044677734375, -0.0040283203125, 0.00244140625, 0.004241943359375, -0.011474609375, -0.01031494140625, 0.0142...

[ 2819, 3509, 441, 6796, 194234, 96190, 233987, 78426, 112, 64552, 3190, 78690, 4879, 73866, 6696, 25553, 3284, 7569, 32149, 12501, 14255, 1052, 2740, 116, 77816, 201, 305, 65034, 23817, 190, 49413, 483, 757, 106, 1126, 138, 28864, 26073, 151...

[ 0.05072021484375, 0.2012939453125, 0.1209716796875, 0.2249755859375, 0.3017578125, 0.27001953125, 0.254150390625, 0.2459716796875, 0.0428466796875, 0.16845703125, 0.1109619140625, 0.0256805419921875, 0.0687255859375, 0.1663818359375, 0.2030029296875, 0.0966796875, 0.146728515625, 0...

embed

33331499_c0

33331499

lisp

0

Title: LISP:How to read numbers from user and store as a list Problem title: LISP:How to read numbers from user and store as a list Tags: common-lisp, lisp, list Problem: LISP:How to read numbers from user and store as a list I am new to lisp. I am trying to read numbers from user and want to store it as a list. For ex...

LISP:How to read numbers from user and store as a list LISP:How to read numbers from user and store as a list common-lisp lisp list user LISP:How LISP:How to read numbers from user and store as a list I am new to lisp. I am trying to read numbers from user and want to store it as a list. For example: if the user enters...

[ -0.015869140625, 0.0011138916015625, -0.0084228515625, -0.00016117095947265625, -0.01513671875, 0.04541015625, 0.0054931640625, 0.0028533935546875, 0.00506591796875, -0.059814453125, -0.0137939453125, -0.02294921875, -0.017578125, -0.001220703125, -0.0006103515625, 0.00286865234375, ...

[ 16970, 9434, 81826, 47, 12301, 101935, 1295, 38937, 136, 4343, 237, 5303, 10, 39210, 4086, 254, 400, 7008, 3525, 31577, 3444, 30957, 116, 138, 201, 190, 2806, 70541, 80854, 21162, 37842, 2500, 6191, 1505, 39116, 2256, 34002, 64688, 24243, ...

[ 0.1224365234375, 0.2232666015625, 0.05975341796875, 0.00927734375, 0.2445068359375, 0.233642578125, 0.1580810546875, 0.19482421875, 0.050750732421875, 0.1993408203125, 0.113525390625, 0.2314453125, 0.01373291015625, 0.083740234375, 0.09991455078125, 0.1663818359375, 0.1146240234375, ...

embed

4252306_c0

4252306

lisp

0

Title: SLIME on the console Problem title: SLIME on the console Tags: emacs, linux, lisp, slime Problem: SLIME on the console Does anyone have experience using SLIME on the console for Common Lisp? I'm trying to go through Practical Common Lisp but the commands in the book don't seem to work for the console version of ...

SLIME on the console SLIME on the console emacs linux lisp slime SLIME SLIME on the console Does anyone have experience using SLIME on the console for Common Lisp? I'm trying to go through Practical Common Lisp but the commands in the book don't seem to work for the console version of emacs/SLIME. I suppose my question...

[ -0.0028228759765625, -0.00048065185546875, -0.0062255859375, 0.00872802734375, -0.003570556640625, 0.0140380859375, 0.00390625, -0.005462646484375, 0.01519775390625, -0.0029754638671875, 0.0172119140625, -0.0036468505859375, -0.012451171875, 0.0028839111328125, -0.0002727508544921875, ...

[ 42135, 66820, 98, 70, 130250, 352, 2263, 7, 11508, 6077, 400, 7008, 34264, 13, 35672, 16981, 17368, 151301, 1261, 109613, 75101, 12877, 4488, 11389, 30508, 139124, 209806, 183037, 12921, 51515, 67896 ]

[ 0.2017822265625, 0.2646484375, 0.103759765625, 0.0177459716796875, 0.222412109375, 0.05950927734375, 0.1187744140625, 0.0986328125, 0.0728759765625, 0.07537841796875, 0.062744140625, 0.1773681640625, 0.1776123046875, 0.1500244140625, 0.006011962890625, 0.08837890625, 0.0595703125, ...

embed

26182893_c0

26182893

lisp

0

Title: Recursive function in lisp goes wrong Problem title: Recursive function in lisp goes wrong Tags: common-lisp, recursion, lisp Problem: Recursive function in lisp goes wrong I am trying to write a simple recursive program that prints the squares of numbers within certain bounds: (defun show-squares (i end) (if (>...

Recursive function in lisp goes wrong Recursive function in lisp goes wrong common-lisp recursion lisp Recursive SYSTEM::READ-EVAL-PRINT SHOW-SQUARES Recursive function in lisp goes wrong I am trying to write a simple recursive program that prints the squares of numbers within certain bounds: I get the error: *** - SYS...

[ -0.0159912109375, 0.0294189453125, 0.01361083984375, -0.015380859375, -0.0167236328125, 0.019287109375, -0.0054931640625, 0.006134033203125, -0.00469970703125, 0.006561279296875, 0.00689697265625, -0.02099609375, 0.0022735595703125, -0.006500244140625, 0.0235595703125, -0.0041198730468...

[ 853, 48650, 5844, 32354, 23, 400, 7008, 60899, 44691, 39210, 4086, 254, 195625, 55858, 90420, 41519, 397, 647, 61152, 17255, 59537, 18883, 54979, 120572, 31577, 33022, 8781, 1528, 28412, 108047, 111, 101935, 28032, 24233, 99091, 18499, 24428, ...

[ 0.0498046875, 0.20361328125, 0.145751953125, 0.16748046875, 0.021514892578125, 0.121826171875, 0.213623046875, 0.0982666015625, 0.218994140625, 0.0640869140625, 0.0777587890625, 0.156982421875, 0.190185546875, 0.09661865234375, 0.1492919921875, 0.117431640625, 0.05096435546875, 0.0...

embed

22723523_c0

22723523

lisp

0

Title: Lisp Error: Origin 9614327 is not in the stack of NIL Problem title: Lisp Error: Origin 9614327 is not in the stack of NIL Tags: emacs, lisp Problem: Lisp Error: Origin 9614327 is not in the stack of NIL I've been running into a rather strange error when I run my LISP code: Origin 9614327 is not in the stack of ...

Lisp Error: Origin 9614327 is not in the stack of NIL Lisp Error: Origin 9614327 is not in the stack of NIL emacs lisp Lisp Error Origin NIL Lisp Error: Origin 9614327 is not in the stack of NIL I've been running into a rather strange error when I run my LISP code: I'm running the code on Lispbox Emacs. When I try to l...

[ 0.0201416015625, 0.024169921875, -0.02197265625, -0.0025634765625, -0.01446533203125, -0.0022430419921875, 0.002197265625, 0.010009765625, -0.0081787109375, -0.0537109375, 0.000354766845703125, 0.00811767578125, -0.003021240234375, -0.00115966796875, 0.0115966796875, 0.0069580078125, ...

[ 1261, 7008, 212059, 119862, 13549, 139662, 3768, 83, 959, 23, 177261, 541, 16444, 111, 352, 2263, 400, 51042, 3934, 43257, 114453, 18499, 11675, 16970, 9434, 18151, 98, 11728, 85269, 4439, 9790, 6713, 144851, 4092, 13105, 313, 9, 238, 136, ...

[ 0.18115234375, 0.217529296875, 0.2056884765625, 0.2298583984375, 0.16796875, 0.1796875, 0.221435546875, 0.0185546875, 0.150146484375, 0.09375, 0.1881103515625, 0.0848388671875, 0.1744384765625, 0.058074951171875, 0.06634521484375, 0.09844970703125, 0.1173095703125, 0.1209716796875,...

embed

56921314_c0

56921314

lisp

0

Title: What (define (p) (p)) does? Problem title: What (define (p) (p)) does? Tags: scheme, lisp, sicp Problem: What (define (p) (p)) does? I'm reading the "Structure and interpretation of computer programs" 2nd edition in the exercise 1.5, I found a combination that I didn't understand what it does exactly (define (p)...

What (define (p) (p)) does? What (define (p) (p)) does? scheme lisp sicp What What (define (p) (p)) does? I'm reading the "Structure and interpretation of computer programs" 2nd edition in the exercise 1.5, I found a combination that I didn't understand what it does exactly (define (p) (p)) . When I called the procedur...

[ -0.0087890625, 0.0225830078125, -0.013671875, 0.0186767578125, -0.0047607421875, 0.01708984375, 0.006011962890625, 0.000621795654296875, -0.005096435546875, -0.03369140625, 0.0021820068359375, -0.01300048828125, -0.015380859375, -0.01336669921875, -0.00482177734375, 0.003265380859375, ...

[ 4865, 112, 64552, 254, 16, 14602, 150370, 400, 7008, 26536, 16454, 206019, 13909, 103391, 79737, 81979, 22410, 162515, 28219, 2367, 442, 66161, 35839, 50491, 13810, 42, 158927, 214, 11737, 13315, 81273, 33022, 23937, 3714, 41206, 61924, 390, ...

[ 0.1173095703125, 0.1298828125, 0.221923828125, 0.2213134765625, 0.12744140625, 0.1666259765625, 0.205322265625, 0.0894775390625, 0.1806640625, 0.09881591796875, 0.037109375, 0.09088134765625, 0.05645751953125, 0.1195068359375, 0.0426025390625, 0.08990478515625, 0.0645751953125, 0.1...

embed

22271615_c0

22271615

lisp

0

Title: Making lisp evaluator using C macros Problem title: Making lisp evaluator using C macros Tags: lisp, macros, scheme, c Problem: Making lisp evaluator using C macros I was reading chapters on C macros system and found that I can define some simple lisp-like evaluator. #define add(x,y) ((x)+(y)) #define mult(x,y) ...

Making lisp evaluator using C macros Making lisp evaluator using C macros lisp macros scheme c C Making Making lisp evaluator using C macros I was reading chapters on C macros system and found that I can define some simple lisp-like evaluator. Of course this is just a joke, but is there opportunity to make full scheme ...

[ 0.0036163330078125, 0.028564453125, -0.00180816650390625, 0.00750732421875, -0.0014801025390625, 0.0022430419921875, 0.01116943359375, -0.002838134765625, -0.00823974609375, -0.04931640625, -0.01068115234375, -0.01092529296875, 0.016845703125, -0.0225830078125, -0.0011444091796875, -0....

[ 13676, 400, 7008, 151575, 748, 17368, 313, 111789, 150370, 501, 214, 7, 16454, 139539, 5426, 831, 61924, 8781, 5062, 122122, 54591, 3249, 4393 ]

[ 0.08447265625, 0.148681640625, 0.20703125, 0.2021484375, 0.1600341796875, 0.0501708984375, 0.160888671875, 0.20703125, 0.1439208984375, 0.053680419921875, 0.01263427734375, 0.042633056640625, 0.0189666748046875, 0.003406524658203125, 0.11138916015625, 0.0140838623046875, 0.1244506835...

embed

16876949_c0

16876949

lisp

0

Title: Autocomplete parentheses in SLIME Problem title: Autocomplete parentheses in SLIME Tags: emacs, lisp, slime Problem: Autocomplete parentheses in SLIME I'm learning Common Lisp using SLIME. Is there a way to autocomplete parentheses so that when I type an open paren, a closed one is automatically added? I'm more ...

Autocomplete parentheses in SLIME Autocomplete parentheses in SLIME emacs lisp slime Autocomplete SLIME Autocomplete parentheses in SLIME I'm learning Common Lisp using SLIME. Is there a way to autocomplete parentheses so that when I type an open paren, a closed one is automatically added? I'm more of a vim guy, so in ...

[ -0.004150390625, 0.00836181640625, -0.01025390625, 0.004058837890625, -0.0277099609375, 0.03125, -0.005279541015625, 0.0184326171875, -0.0108642578125, -0.01116943359375, 0.0296630859375, -0.020263671875, -0.016357421875, 0.01416015625, -0.003448486328125, -0.02587890625, -0.01306152...

[ 4396, 277, 131801, 49129, 35412, 90, 23, 42135, 66820, 2263, 400, 7008, 34264, 13, 52080, 151301, 1261, 17368, 3917, 1809, 3229, 10644, 9803, 366, 33, 155738, 1632, 191082, 49814, 1286, 119916, 48948, 110534, 29671, 19437, 15190, 759, 13810, ...

[ 0.154296875, 0.086181640625, 0.177978515625, 0.1630859375, 0.195068359375, 0.09912109375, 0.028656005859375, 0.168701171875, 0.2396240234375, 0.01336669921875, 0.072998046875, 0.1490478515625, 0.1634521484375, 0.1328125, 0.06982421875, 0.10394287109375, 0.113037109375, 0.0437927246...

embed

20353946_c1

20353946

lisp

1

't directly mutated accidentally by whatever fn I choose (as would be the case with push-cdr which might be non-trivial in more complicated functions). Output: CL-USER> (defparameter *g2* nil) *G2* CL-USER> (set-global #'push-something '*g2* 5) (5) CL-USER> *g2* (5) CL-USER> (set-global #'push-cdr '*g2* 99) (5 99) CL-U...

[ 0.0142822265625, 0.012451171875, 0.0024871826171875, 0.0025482177734375, 0.011474609375, 0.020263671875, -0.0050048828125, 0.003997802734375, 0.0189208984375, -0.0439453125, 0.00421142578125, 0.0025634765625, -0.005889892578125, -0.031494140625, 0.00885009765625, 0.01202392578125, -0...

[ 18, 105237, 31158, 297, 27998, 25958, 390, 89778, 14783, 87, 55076, 2806, 25944, 9, 7569, 13648, 186, 686, 96704, 32354, 13538, 7077, 46323, 1062, 50184, 2740, 112, 420, 6276, 29089, 177, 304, 1639, 17324, 724, 3509, 156566, 7332, 127, 64...

[ 0.1220703125, 0.1917724609375, 0.25732421875, 0.10400390625, 0.1943359375, 0.07916259765625, 0.0357666015625, 0.0887451171875, 0.1614990234375, 0.0047607421875, 0.114990234375, 0.010467529296875, 0.1865234375, 0.0401611328125, 0.1268310546875, 0.04388427734375, 0.0150299072265625, ...

embed

76291423_c1

76291423

lisp

1

i need your help to understand the process of getting to the result. Im new to lisp, we only studied very few lessons, we learned only mathematical things in lisp, "if", "cond", "labels", "and", "or", and how to write iterative functions. Could you please be able to explain me how this recursion deep down works please...

[ -0.00616455078125, 0.005218505859375, -0.00567626953125, 0.0091552734375, 0.00653076171875, 0.02197265625, -0.00007915496826171875, 0.01068115234375, 0.005218505859375, -0.0230712890625, 0.0030670166015625, -0.016357421875, -0.00836181640625, 0.01239013671875, 0.0140380859375, 0.008056...

[ 17, 3871, 935, 4358, 28219, 9433, 111, 20949, 47, 16750, 3370, 3525, 400, 7008, 4734, 22282, 4552, 10846, 182417, 97384, 140363, 8966, 3190, 2271, 71, 152526, 2940, 748, 3642, 33022, 720, 45023, 32354, 73342, 903, 195625, 1830, 53894, 7565,...

[ 0.032867431640625, 0.135009765625, 0.012939453125, 0.1279296875, 0.1331787109375, 0.1341552734375, 0.050994873046875, 0.114990234375, 0.130859375, 0.1978759765625, 0.03961181640625, 0.033599853515625, 0.10552978515625, 0.2041015625, 0.013031005859375, 0.01800537109375, 0.00830078125,...

embed

57815561_c1

57815561

lisp

1

/Resources/app/static/<embedded>:14 Code signals: TypeError, Scheme, How, Script, Atom, Guile, Applications, Atom.app, Contents, Resources, Cannot, BufferedProcess.bufferStream, BufferedProcess.handleEvents, BufferedProcess.start, BufferedProcess, Runner.run, runner.js:32:28, Runtime.execute, runtime.js:78:17, HTMLElem...

[ -0.01495361328125, 0.006561279296875, -0.0010223388671875, 0.01495361328125, -0.0130615234375, -0.0034332275390625, 0.00830078125, -0.0291748046875, -0.0027008056640625, -0.04052734375, 0.004669189453125, -0.03662109375, 0.00799560546875, 0.017333984375, 0.005157470703125, -0.024658203...

[ 248, 4332, 60427, 9007, 201939, 55720, 69819, 22635, 28864, 26073, 7, 12, 60457, 18468, 31611, 34702, 282, 11249, 84654, 69728, 53513, 133, 104921, 5, 70870, 152055, 4171, 10869, 18234, 297, 10752, 26531, 123759, 115061, 79628, 192134, 17137, ...

[ 0.08062744140625, 0.10888671875, 0.2203369140625, 0.1854248046875, 0.2008056640625, 0.19921875, 0.1563720703125, 0.228271484375, 0.2435302734375, 0.268310546875, 0.110107421875, 0.000152587890625, 0.1993408203125, 0.1356201171875, 0.1866455078125, 0.1334228515625, 0.1085205078125, ...

embed

15468205_c0

15468205

lisp

0

Title: is this function tail recursive? Problem title: is this function tail recursive? Tags: lisp, tail-recursion, scheme, racket Problem: is this function tail recursive? in racket , i define the following function and am wondering whether it is tail recursive : (define foo (λ (c m s1 s2) (if (< c m) (if (= (modulo m...

is this function tail recursive? is this function tail recursive? lisp tail-recursion scheme racket is this function tail recursive? in racket , i define the following function and am wondering whether it is tail recursive : my question is virtually like this, but i have to write something else to satisfy my post quali...

[ 0.00494384765625, 0.0103759765625, -0.000396728515625, -0.00101470947265625, 0.016357421875, -0.004425048828125, -0.01422119140625, -0.00153350830078125, 0.006439208984375, -0.01507568359375, 0.0194091796875, -0.0208740234375, -0.0081787109375, -0.005950927734375, 0.0294189453125, 0.00...

[ 83, 903, 32354, 46741, 195625, 5844, 400, 7008, 107, 48650, 1830, 150370, 673, 27853, 23, 61924, 25632, 149016, 36766, 442, 9655, 20513, 1884, 765, 33022, 37076, 40407, 1305, 31897, 5570, 3714, 7 ]

[ 0.08258056640625, 0.11383056640625, 0.222412109375, 0.282470703125, 0.243408203125, 0.177490234375, 0.087890625, 0.16552734375, 0.08392333984375, 0.18359375, 0.0941162109375, 0.168701171875, 0.08685302734375, 0.1837158203125, 0.0002218484878540039, 0.11767578125, 0.091796875, 0.031...

embed

64412323_c0

64412323

lisp

0

Title: string-trim does not work on global variable Problem title: string-trim does not work on global variable Tags: lisp, trim, string, common-lisp Problem: string-trim does not work on global variable Why string-trim does not work on global variable in Common Lisp? (defvar *whitespaces* '(#\Space #\Newline #\Backspa...

string-trim does not work on global variable string-trim does not work on global variable lisp trim string common-lisp Space Newline Backspace Tab Linefeed Page Rubout Hello World string-trim does not work on global variable Why string-trim does not work on global variable in Common Lisp?

[ 0.00970458984375, 0.0157470703125, -0.00445556640625, 0.0091552734375, -0.00811767578125, 0.000568389892578125, -0.0023193359375, 0.0286865234375, 0.0020904541015625, 0.0017547607421875, 0.00311279296875, -0.0014190673828125, 0.00116729736328125, -0.017333984375, 0.01104736328125, 0.00...

[ 79315, 3996, 39, 959, 4488, 98, 7964, 77336, 14602, 400, 7008, 85247, 39210, 4086, 254, 43045, 2356, 2256, 26828, 65421, 22193, 16777, 106095, 14231, 65787, 6056, 35378, 6661, 151301, 1261 ]

[ 0.250244140625, 0.221435546875, 0.1766357421875, 0.0968017578125, 0.13330078125, 0.055328369140625, 0.1602783203125, 0.2281494140625, 0.0102386474609375, 0.1016845703125, 0.1787109375, 0.225830078125, 0.078369140625, 0.0567626953125, 0.1180419921875, 0.1246337890625, 0.00709533691406...

embed

14690406_c0

14690406

lisp

0

Title: Why my auto-indentation emacs script doesn't work on .cu files Problem title: Why my auto-indentation emacs script doesn't work on .cu files Tags: lisp, emacs Problem: Why my auto-indentation emacs script doesn't work on .cu files I've just started to learn emacs. I used this Lisp script to indent my c...

Why my auto-indentation emacs script doesn't work on .cu files Why my auto-indentation emacs script doesn't work on .cu files lisp emacs Why Why my auto-indentation emacs script doesn't work on .cu files I've just started to learn emacs. I used this Lisp script to indent my c++ code in batch, but strangely it...

[ -0.001922607421875, -0.007568359375, -0.02392578125, -0.0035552978515625, -0.00147247314453125, 0.006439208984375, 0.00848388671875, 0.0181884765625, 0.0152587890625, -0.006927490234375, 0.00372314453125, -0.000774383544921875, -0.034912109375, 0.00775146484375, 0.006317138671875, -0.0...

[ 44084, 759, 1809, 21704, 22062, 352, 2263, 7, 26499, 22027, 3768, 18, 4488, 98, 1010, 102158, 400, 7008, 5, 30698, 1261, 18597, 37223, 18151, 1777, 114453, 456, 11627, 69130, 47, 6366, 77336, 143726, 5423, 11883, 4439, 9384, 1916, 91736, ...

[ 0.10028076171875, 0.00152587890625, 0.2000732421875, 0.178466796875, 0.1002197265625, 0.08984375, 0.153564453125, 0.0904541015625, 0.2056884765625, 0.065673828125, 0.025665283203125, 0.10150146484375, 0.121337890625, 0.01708984375, 0.2012939453125, 0.1436767578125, 0.05426025390625, ...

embed

69730757_c0

69730757

lisp

0

Title: Find max in lisp Problem title: Find max in lisp Tags: lisp Problem: Find max in lisp I am trying to do Recursive method to find max value in list. Can anyone explain where I made the mistake on this code and how to approach it next time. (defun f3 (i) (setq x (cond (> (car (I)) (cdr (car (I)))) (f3 (cdr (I)))))...

Find max in lisp Find max in lisp lisp max Find Find max in lisp I am trying to do Recursive method to find max value in list. Can anyone explain where I made the mistake on this code and how to approach it next time. also I tried this following method and didn't work: Thanks a lot for any help. I am coming from java i...

[ -0.015625, 0.021728515625, 0.0185546875, 0.003662109375, -0.0140380859375, 0.025146484375, 0.0087890625, 0.0235595703125, -0.00109100341796875, -0.00131988525390625, 0.004730224609375, -0.01220703125, -0.004669189453125, -0.0177001953125, 0.0234375, -0.0069580078125, 0.00390625, -0...

[ 26040, 18389, 23, 400, 7008, 31577, 48650, 5844, 55300, 7413, 34292, 5303, 73342, 7228, 121742, 18151, 51515, 37842, 4488, 4358, 79, 330 ]

[ 0.1199951171875, 0.220458984375, 0.09063720703125, 0.1387939453125, 0.210205078125, 0.0192108154296875, 0.11199951171875, 0.09161376953125, 0.0914306640625, 0.078369140625, 0.1578369140625, 0.1346435546875, 0.044158935546875, 0.00909423828125, 0.1015625, 0.06365966796875, 0.010879516...

embed

11414260_c0

11414260

lisp

0

Title: `A' is not of the expected type `REAL' Problem title: `A' is not of the expected type `REAL' Tags: lisp Problem: `A' is not of the expected type `REAL' The code below server to show the number of integer in a list. (defun isNum (N) (and (<= N 9) (>= N 0))) (defun count-numbers (list) (let ((c...

`A' is not of the expected type `REAL' `A' is not of the expected type `REAL' lisp REAL `A' is not of the expected type `REAL' The code below server to show the number of integer in a list. I get the error A' is not of the expected type REAL' when I run the command (count-numbers '(3 4 5 6 a 7 b) )

[ -0.006378173828125, -0.01416015625, -0.0010528564453125, 0.0069580078125, 0.0166015625, 0.0245361328125, -0.01422119140625, 0.0015716552734375, 0.01318359375, -0.000225067138671875, -0.015380859375, -0.041259765625, 0.01361083984375, 0.0064697265625, 0.01025390625, -0.01007080078125, ...

[ 284, 54764, 3768, 83, 959, 111, 84751, 10644, 41519, 866, 400, 7008, 88491, 70, 18151, 35064, 10723, 7639, 14012, 892, 1505, 23, 5303, 18499, 62, 25, 11675, 75101, 71013, 2606, 1297, 86827, 201, 190, 305, 10, 361, 876 ]

[ 0.177001953125, 0.0186004638671875, 0.14697265625, 0.10723876953125, 0.1844482421875, 0.1513671875, 0.1756591796875, 0.206787109375, 0.16552734375, 0.134033203125, 0.08892822265625, 0.1856689453125, 0.263671875, 0.04913330078125, 0.1383056640625, 0.1146240234375, 0.1600341796875, 0...

embed

20336237_c0

20336237

lisp

0

Title: check of the atom if it's the last element of the list in Scheme Problem title: check of the atom if it's the last element of the list in Scheme Tags: scheme, lisp Problem: check of the atom if it's the last element of the list in Scheme im trying to solve a question which is to check weather the eleme...

check of the atom if it's the last element of the list in Scheme check of the atom if it's the last element of the list in Scheme scheme lisp Scheme Define Cond check of the atom if it's the last element of the list in Scheme im trying to solve a question which is to check weather the element x is the last el...

[ -0.004669189453125, 0.032470703125, 0.002685546875, 0.01214599609375, -0.0125732421875, 0.01416015625, 0.01409912109375, -0.01202392578125, -0.007568359375, 0.00084686279296875, 0.0159912109375, -0.0277099609375, 0.00665283203125, -0.0062255859375, 0.004058837890625, 0.01446533203125, ...

[ 12765, 111, 34627, 2174, 442, 3768, 70, 4568, 12830, 5303, 23, 34702, 282, 150370, 400, 7008, 64552, 1657, 71, 566, 86869, 9655, 92949, 1022, 83, 9790, 5351, 44691, 4358 ]

[ 0.2186279296875, 0.145263671875, 0.246337890625, 0.0889892578125, 0.10052490234375, 0.087158203125, 0.048309326171875, 0.239501953125, 0.187744140625, 0.1868896484375, 0.059173583984375, 0.181884765625, 0.1583251953125, 0.2047119140625, 0.0491943359375, 0.1104736328125, 0.08990478515...

embed

71376802_c1

71376802

lisp

1

alist-get 'tag tr) (append (apply-partially untree '(alist-get 'children node)) nil ) )))) (funcall untree json-dom)) ) And got the following result. I don't know what I'm not doing right. (pp (fliptree)) ("html" (128 "\302\300\303\301\"\"\207" [(closure ((untree closure #4 (tr) (list (alist-get 'tag tr) (append (apply...

[ 0.00799560546875, 0.0059814453125, 0.0032806396484375, -0.02783203125, -0.0157470703125, -0.003448486328125, 0.009033203125, 0.00897216796875, 0.0126953125, -0.0302734375, -0.0167236328125, 0.005279541015625, -0.00958251953125, 0.0133056640625, 0.0159912109375, -0.00225830078125, 0.0...

[ 10, 6562, 3794, 6936, 4307, 9007, 3611, 538, 15866, 25958, 51, 62600, 11, 237052, 110, 112, 17324, 80126, 16498, 85763, 1647, 1681, 3815, 25632, 16750, 3714, 20594, 7108, 6366, 21392, 7693, 81764, 1197, 7739, 122367, 966, 170224, 309, 617, ...

[ 0.09619140625, 0.2210693359375, 0.1044921875, 0.181396484375, 0.194580078125, 0.06622314453125, 0.1173095703125, 0.04608154296875, 0.03253173828125, 0.053558349609375, 0.09393310546875, 0.25341796875, 0.033935546875, 0.163330078125, 0.0936279296875, 0.07086181640625, 0.120849609375, ...

embed

33020360_c1

33020360

lisp

1

in this case, but I can't substitute the hash table for a vector because the collatz sequence goes up about 50% of the time. After running the code, the hash table has some 2.5 million entries. Finally, and strangely, I managed to reproduce the bug while testing the syntax of a longish loop (a million iterations) that...

[ -0.0037689208984375, 0.00016498565673828125, -0.01300048828125, 0.013916015625, -0.01104736328125, 0.0026397705078125, 0.00054168701171875, 0.0113525390625, 0.004180908203125, -0.02392578125, 0.0002307891845703125, 0.018310546875, 0.00286865234375, 0.037109375, 0.032958984375, -0.00162...

[ 903, 7225, 1284, 831, 18, 161740, 13, 1556, 127, 23180, 100, 173, 18770, 6637, 65780, 9136, 944, 3956, 60899, 1257, 1672, 9071, 111, 1733, 51042, 18151, 3060, 27804, 19879, 112820, 114453, 4, 145755, 42238, 54608, 134234, 6002, 86531, 4989,...

[ 0.047454833984375, 0.0677490234375, 0.037261962890625, 0.059295654296875, 0.044891357421875, 0.1485595703125, 0.022247314453125, 0.1910400390625, 0.162841796875, 0.2203369140625, 0.00177001953125, 0.1497802734375, 0.1748046875, 0.00634765625, 0.1099853515625, 0.1859130859375, 0.07171...

embed

1162989_c0

1162989

lisp

0

Title: What is the difference between procedure and #'procedure in Lisp/Clojure? Problem title: What is the difference between procedure and #'procedure in Lisp/Clojure? Tags: clojure, lisp Problem: What is the difference between procedure and #'procedure in Lisp/Clojure? What is the difference between the ev...

What is the difference between procedure and #'procedure in Lisp/Clojure? What is the difference between procedure and #'procedure in Lisp/Clojure? clojure lisp What Lisp Clojure core$double__4077 clojure.core$double__4077 clojure.core What is the difference between procedure and #'procedure in Lisp/Clojure? ...

[ 0.0169677734375, 0.009521484375, 0.0001163482666015625, 0.01373291015625, -0.0037384033203125, 0.022705078125, -0.0196533203125, 0.004058837890625, -0.00421142578125, -0.015869140625, -0.0172119140625, 0.004241943359375, -0.0169677734375, -0.0184326171875, 0.01068115234375, 0.016967773...

[ 70, 60212, 17721, 50491, 136, 3768, 232578, 1261, 7008, 64, 20219, 3408, 23, 441, 20450, 461, 107, 400, 4865, 51053, 56458, 21555, 2661, 2839, 14546, 30854, 83, 219836, 41929, 9506 ]

[ 0.0172882080078125, 0.185302734375, 0.1026611328125, 0.2279052734375, 0.083251953125, 0.0294952392578125, 0.218994140625, 0.1163330078125, 0.2049560546875, 0.05120849609375, 0.09674072265625, 0.1929931640625, 0.036102294921875, 0.002899169921875, 0.10748291015625, 0.1517333984375, 0....

embed

40162194_c1

40162194

lisp

1

count i)) (set! count (add1 count)) (loop)))) (loop))) Both codes, my implementation and the professor's code, reach the same results. But I am not sure if they have the same nature. Hence, I started to ask myself: was my implementation really imperative? Just using "set!" guaranties that? I still use parameters in my...

[ 0.016357421875, 0.003997802734375, -0.003662109375, 0.0146484375, -0.0084228515625, 0.007354736328125, -0.0001621246337890625, 0.0029754638671875, 0.01141357421875, -0.052734375, 0.0196533203125, -0.006744384765625, -0.004119873046875, -0.00653076171875, 0.03564453125, -0.0140380859375...

[ 54529, 17, 3509, 38, 11, 4028, 418, 28354, 80126, 149766, 18151, 7, 759, 208124, 136, 70, 16030, 25, 58359, 5701, 50339, 959, 9077, 31425, 26458, 509, 6183, 222530, 13, 17368, 3890, 2497, 9369, 2449, 450, 7464, 4527, 171859, 119591, 53, ...

[ 0.2333984375, 0.15625, 0.218994140625, 0.1552734375, 0.0178070068359375, 0.1256103515625, 0.1151123046875, 0.1785888671875, 0.113525390625, 0.07330322265625, 0.2183837890625, 0.0227813720703125, 0.045928955078125, 0.223388671875, 0.0079345703125, 0.01129150390625, 0.2030029296875, ...

embed