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
19709228_c0
19709228
lisp
0
Title: defparameter vs defun for passing functions around Problem title: defparameter vs defun for passing functions around Tags: lisp, common-lisp Problem: defparameter vs defun for passing functions around So I can do this: (defparameter *some-function* ... ; returns lambda later or this: (defun some-function ... Wit...
defparameter vs defun for passing functions around defparameter vs defun for passing functions around lisp common-lisp defparameter vs defun for passing functions around So I can do this: (defparameter *some-function* ... ; returns lambda later or this: (defun some-function ... With either, I can use funcall : (funcall...
[ 0.00775146484375, 0.01519775390625, 0.004302978515625, 0.0032958984375, -0.0068359375, -0.0228271484375, 0.00830078125, -0.0101318359375, 0.0196533203125, -0.015869140625, 0.00775146484375, -0.004180908203125, -0.00160980224609375, 0.007171630859375, 0.006683349609375, -0.0055541992187...
[ 8, 420, 6276, 29089, 20209, 16498, 100, 452, 6953, 32354, 10932, 400, 7008, 39210, 4086, 254, 831, 54, 903, 112, 43452, 137175, 1639, 30646, 21, 6492, 85, 14432, 707, 3060, 17106, 40101, 4527, 7477, 85763, 11389, 53418, 87344, 99156, 6135...
[ 0.1776123046875, 0.1710205078125, 0.1890869140625, 0.1844482421875, 0.1405029296875, 0.2489013671875, 0.012847900390625, 0.1029052734375, 0.058868408203125, 0.1650390625, 0.167236328125, 0.1060791015625, 0.19677734375, 0.0841064453125, 0.08770751953125, 0.1646728515625, 0.06414794921...
embed
6048061_c0
6048061
lisp
0
Title: how to use a keyboard macro in a lisp function until it fails Problem title: how to use a keyboard macro in a lisp function until it fails Tags: emacs, lisp Problem: how to use a keyboard macro in a lisp function until it fails right now I have a keyboard macro defined and named, and i want to make a lisp functi...
how to use a keyboard macro in a lisp function until it fails how to use a keyboard macro in a lisp function until it fails emacs lisp Keyboard C-x how to use a keyboard macro in a lisp function until it fails right now I have a keyboard macro defined and named, and i want to make a lisp function which goes to the top ...
[ -0.004730224609375, 0.01434326171875, -0.00775146484375, -0.0087890625, -0.00494384765625, 0.0478515625, 0.004119873046875, -0.0007171630859375, 0.0027008056640625, -0.0341796875, 0.006866455078125, -0.004791259765625, -0.01031494140625, -0.0125732421875, 0.017578125, -0.033203125, -...
[ 3642, 47, 4527, 149186, 111789, 23, 400, 7008, 32354, 24189, 35782, 352, 2263, 227247, 313, 425, 10, 7, 7108, 5036, 61924, 4806, 3444, 3249, 60899, 2663, 373, 18234, 14602, 2367, 11883, 4439 ]
[ 0.0635986328125, 0.05377197265625, 0.1607666015625, 0.22314453125, 0.2276611328125, 0.08453369140625, 0.122802734375, 0.2003173828125, 0.1749267578125, 0.1524658203125, 0.194091796875, 0.0200042724609375, 0.06707763671875, 0.1800537109375, 0.0153350830078125, 0.07635498046875, 0.0091...
embed
37534842_c0
37534842
lisp
0
Title: How do I structure this lisp macro? Problem title: How do I structure this lisp macro? Tags: macros, lisp, common-lisp Problem: How do I structure this lisp macro? I'm working through l99 for lisp to learn lisp. This is from here , and I wish to apply macros just for practice, to write all the ((x) (x (evaluate-...
How do I structure this lisp macro? How do I structure this lisp macro? macros lisp common-lisp How Evaluates Returns Invalid How do I structure this lisp macro? I'm working through l99 for lisp to learn lisp. This is from here , and I wish to apply macros just for practice, to write all the ((x) (x (evaluate-boolean l...
[ -0.0137939453125, 0.02197265625, 0.006683349609375, -0.001495361328125, 0.013671875, 0.0380859375, 0.013671875, -0.004241943359375, 0.000583648681640625, 0.01611328125, -0.0233154296875, -0.010986328125, 0.00970458984375, -0.01214599609375, -0.001434326171875, -0.005462646484375, -0....
[ 11249, 54, 45646, 903, 400, 7008, 111789, 87, 39210, 4086, 254, 151228, 1636, 173340, 360, 7013, 5046, 32599, 59911, 41361, 33022, 756, 425, 159258, 67, 142484, 5073, 25737, 128239, 7108, 678, 37842, 18499, 13416, 132283, 77336, 29479, 8, 4...
[ 0.0972900390625, 0.03253173828125, 0.237060546875, 0.0947265625, 0.1434326171875, 0.196533203125, 0.224853515625, 0.0159759521484375, 0.103515625, 0.1046142578125, 0.143310546875, 0.195556640625, 0.094970703125, 0.20751953125, 0.03271484375, 0.161865234375, 0.20068359375, 0.0304260...
embed
43388131_c0
43388131
lisp
0
Title: Whats 'T' at the end in SBCL Problem title: Whats 'T' at the end in SBCL Tags: output, lisp, common-lisp Problem: Whats 'T' at the end in SBCL I am new at SBCL programming and I ran a simple Addition program: (defvar a) (defvar b) (defvar c) (defvar d) (write-line "Enter A:") (setf a (read)) ...
Whats 'T' at the end in SBCL Whats 'T' at the end in SBCL output lisp common-lisp Whats SBCL Enter lisp_calculator.lisp Whats 'T' at the end in SBCL I am new at SBCL programming and I ran a simple Addition program: Output: That 'T' is no any trouble to me but i am just curious. I was thinking to mak...
[ 0.0225830078125, 0.0113525390625, -0.00567626953125, 0.0008697509765625, -0.0162353515625, 0.004974365234375, 0.0225830078125, 0.023193359375, -0.0115966796875, -0.04345703125, 0.006011962890625, -0.0027618408203125, -0.010498046875, 0.00799560546875, -0.01025390625, -0.001022338867187...
[ 4865, 7, 3768, 618, 99, 3564, 23, 90944, 37486, 140992, 400, 7008, 39210, 4086, 254, 60816, 6827, 16735, 1290, 3525, 56037, 13028, 8781, 29117, 14, 1528, 13538, 7077, 9925, 63134, 193844, 47644, 6024, 86997, 95103, 8962, 41018, 67616, 683, ...
[ 0.09283447265625, 0.04827880859375, 0.08203125, 0.240234375, 0.0848388671875, 0.184814453125, 0.07403564453125, 0.1429443359375, 0.2493896484375, 0.171875, 0.08123779296875, 0.177978515625, 0.0908203125, 0.062255859375, 0.1551513671875, 0.1221923828125, 0.080322265625, 0.1105957031...
embed
79130435_c1
79130435
lisp
1
But the Logo point of view is that it’s easier for a beginning programmer to understand first-class expressions than to understand special forms and thunks. IMHO the above means "first-class expression" (e.g. WHILE ...... ) means some expression which is only evaluated partly , i.e. lazy evaluation. Q: As this wikiped...
But the Logo point of view is that it’s easier for a beginning programmer to understand first-class expressions than to understand special forms and thunks. IMHO the above means "first-class expression" (e.g. WHILE ...... ) means some expression which is only evaluated partly , i.e. lazy evaluation. Q: As this wikiped...
[ 0.0106201171875, -0.003631591796875, 0.0081787109375, 0.004913330078125, 0.00689697265625, 0.0091552734375, 0.0079345703125, 0.00118255615234375, 0.017578125, 0.0111083984375, 0.00885009765625, 0.007781982421875, -0.020751953125, -0.005401611328125, 0.0198974609375, -0.014892578125, ...
[ 4966, 70, 36684, 6275, 21455, 99156, 86595, 77848, 28219, 5117, 67413, 125195, 5361, 3173, 136, 4911, 19, 1224, 17933, 36917, 26950, 13448, 271, 9, 601, 841, 52099, 30147, 4734, 151575, 2831, 21, 3285, 219836, 2396, 7168, 23972, 130367, 323...
[ 0.0667724609375, 0.015594482421875, 0.19921875, 0.001312255859375, 0.06170654296875, 0.07537841796875, 0.0270843505859375, 0.188720703125, 0.1063232421875, 0.1812744140625, 0.281982421875, 0.288330078125, 0.1051025390625, 0.1578369140625, 0.0333251953125, 0.1029052734375, 0.077636718...
embed
39882572_c1
39882572
lisp
1
x (nth i y) ) do (return-from THREAT? t) ) ) *The vertical and horizontal functions work fine as I have commented out diagonal and checked the two. I receive the error message not at compilation but when running my code: VALUES-LIST: A proper list must not end with 1 which I suspect is a problem in my diagonal functio...
x (nth i y) ) do (return-from THREAT? t) ) ) *The vertical and horizontal functions work fine as I have commented out diagonal and checked the two. I receive the error message not at compilation but when running my code: VALUES-LIST: A proper list must not end with 1 which I suspect is a problem in my diagonal functio...
[ -0.00115203857421875, 0.0162353515625, 0.003082275390625, -0.00872802734375, -0.01361083984375, -0.0004367828369140625, 0.01611328125, 0.0164794921875, 0.005828857421875, -0.00799560546875, 0.0189208984375, 0.000762939453125, -0.0220947265625, -0.001953125, 0.00811767578125, -0.0022125...
[ 1022, 19, 927, 17, 113, 54, 65395, 161063, 12232, 41519, 618, 32, 808, 79259, 136, 124001, 32354, 7, 4488, 5885, 6868, 207997, 12765, 6626, 53299, 18499, 26008, 959, 98352, 1363, 51042, 18151, 310, 89994, 6706, 9, 195977, 27798, 5303, 811...
[ 0.09027099609375, 0.038055419921875, 0.12451171875, 0.06927490234375, 0.111572265625, 0.106201171875, 0.1278076171875, 0.0882568359375, 0.1602783203125, 0.27685546875, 0.18994140625, 0.005157470703125, 0.08551025390625, 0.20654296875, 0.0293121337890625, 0.197265625, 0.2091064453125,...
embed
27261369_c0
27261369
lisp
0
Title: Can someone explain me the following example? Problem title: Can someone explain me the following example? Tags: lisp, functional-programming, clojure, algorithm Problem: Can someone explain me the following example? Well I'm new in clojure and I was reviewing the literature of the function mapcat in ( http://cl...
Can someone explain me the following example? Can someone explain me the following example? lisp functional-programming clojure algorithm Can Can someone explain me the following example? Well I'm new in clojure and I was reviewing the literature of the function mapcat in ( http://clojuredocs.org/clojure.core/mapcat ) ...
[ 0.019287109375, -0.015625, -0.0196533203125, -0.001617431640625, -0.01611328125, 0.003936767578125, -0.00140380859375, 0.00726318359375, 0.002593994140625, -0.0164794921875, -0.0034027099609375, -0.00823974609375, 0.00189208984375, 0.01708984375, -0.0146484375, -0.01239013671875, -0....
[ 4171, 22008, 73342, 163, 25632, 27781, 400, 7008, 123309, 28966, 20450, 461, 107, 234873, 3525, 163136, 32354, 22288, 4460, 63499, 4439, 30854, 62346, 121413, 28219, 55681, 3642, 14602, 22799, 136, 142424, 4488, 9077, 66161, 34292, 472, 304, ...
[ 0.004486083984375, 0.0128173828125, 0.154052734375, 0.047149658203125, 0.0933837890625, 0.193603515625, 0.08251953125, 0.18212890625, 0.138427734375, 0.1036376953125, 0.11181640625, 0.1302490234375, 0.1085205078125, 0.1778564453125, 0.0284576416015625, 0.02978515625, 0.1422119140625,...
embed
64815766_c1
64815766
lisp
1
) ;if element from list equals node ;;if element from list is less than node then call make-tree function and add element to left side ((< x (entry tree)) (make-tree (entry tree) (add x(left tree)) (right tree))) ;;if element from list is greater than node then call make-tree function and add element to right side ((> ...
) ;if element from list equals node ;;if element from list is less than node then call make-tree function and add element to left side ((< x (entry tree)) (make-tree (entry tree) (add x(left tree)) (right tree))) ;;if element from list is greater than node then call make-tree function and add element to right side ((> ...
[ 0.01080322265625, 0.0206298828125, -0.000946044921875, 0.004119873046875, 0.015380859375, 0.02734375, -0.00013065338134765625, -0.004180908203125, 0.0023651123046875, -0.0169677734375, -0.01904296875, -0.04248046875, 0.01171875, 0.00543212890625, 0.018310546875, -0.0037384033203125, ...
[ 1388, 3190, 12830, 1295, 5303, 105950, 110, 112, 40715, 3501, 11782, 3249, 9, 62600, 32354, 15190, 47, 25737, 5609, 16093, 1022, 15123, 53201, 55898, 4028, 2480, 54969, 117396, 7108, 16498, 275, 62766, 5584, 28282, 2394, 6635, 246, 6562, 42...
[ 0.0067138671875, 0.0697021484375, 0.13623046875, 0.0928955078125, 0.195068359375, 0.1356201171875, 0.14453125, 0.1463623046875, 0.138916015625, 0.061004638671875, 0.0897216796875, 0.1363525390625, 0.00421142578125, 0.272705078125, 0.1383056640625, 0.1390380859375, 0.03021240234375, ...
embed
41770863_c0
41770863
lisp
0
Title: elisp: number can&#x27;t get greater than (expt 2 60)? Problem title: elisp: number can&#x27;t get greater than (expt 2 60)? Tags: integer-overflow, lisp, elisp Problem: elisp: number can't get greater than (expt 2 60)? In a previous post, someone shows that you can express any number in elisp because it switchs...
elisp: number can&#x27;t get greater than (expt 2 60)? elisp: number can&#x27;t get greater than (expt 2 60)? integer-overflow lisp elisp long_max elisp: number can't get greater than (expt 2 60)? In a previous post, someone shows that you can express any number in elisp because it switchs over to big_nums automaticall...
[ 0.01007080078125, 0.00396728515625, 0.00958251953125, -0.0164794921875, 0.0162353515625, 0.008056640625, -0.0128173828125, 0.023681640625, 0.011962890625, 0.006988525390625, -0.009521484375, -0.010009765625, -0.01171875, -0.01434326171875, 0.0322265625, 0.00152587890625, -0.003509521...
[ 15296, 7008, 14012, 831, 3768, 18, 2046, 117396, 3501, 83613, 116, 1496, 12, 892, 1505, 5465, 118664, 400, 4989, 24084, 36510, 2499, 23, 101089, 645, 6957, 2606, 191082, 11782, 3509, 864, 11716, 10031, 4865, 76199, 101935, 3126, 2789, 84453...
[ 0.1312255859375, 0.2408447265625, 0.166259765625, 0.1124267578125, 0.086181640625, 0.1041259765625, 0.08807373046875, 0.1395263671875, 0.030853271484375, 0.1427001953125, 0.040557861328125, 0.232177734375, 0.003173828125, 0.1373291015625, 0.1124267578125, 0.04449462890625, 0.19482421...
embed
562255_c0
562255
lisp
0
Title: How to include &quot;port&quot; package under CLISP in Ubuntu Problem title: How to include &quot;port&quot; package under CLISP in Ubuntu Tags: ubuntu, require, package, clocc, lisp Problem: How to include "port" package under CLISP in Ubuntu I'm trying to follow this tutorial: http://cl-cookbook.sourceforge.ne...
How to include &quot;port&quot; package under CLISP in Ubuntu How to include &quot;port&quot; package under CLISP in Ubuntu ubuntu require package clocc lisp port package How CLISP Ubuntu clc:clc-require INTERN STRUCTURE-KCONSTRUCTOR SYSTEM How to include "port" package under CLISP in Ubuntu I'm trying to follow this t...
[ 0.0034332275390625, 0.0164794921875, 0.005401611328125, -0.0087890625, -0.007598876953125, -0.003753662109375, 0.01312255859375, -0.003997802734375, -0.0020294189453125, -0.0145263671875, 0.0159912109375, -0.0194091796875, -0.00107574462890625, 0.001617431640625, -0.01373291015625, -0....
[ 11249, 26698, 6982, 98169, 1379, 313, 67616, 683, 23, 116890, 198996, 64209, 20450, 10060, 400, 7008, 11469, 33139, 238, 32838, 3181, 59692, 46549, 49503, 94539, 27010, 55858, 57143, 34937, 14137, 27853, 20697, 29102, 4488, 5809, 14037, 98816, ...
[ 0.021484375, 0.16015625, 0.22705078125, 0.21826171875, 0.129638671875, 0.08251953125, 0.175537109375, 0.2276611328125, 0.0521240234375, 0.161865234375, 0.1158447265625, 0.1072998046875, 0.0823974609375, 0.0787353515625, 0.07177734375, 0.1796875, 0.182861328125, 0.01025390625, 0.0...
embed
29379436_c0
29379436
lisp
0
Title: symbolic expression stream I/O Problem title: symbolic expression stream I/O Tags: lisp, common-lisp, s-expression Problem: symbolic expression stream I/O In Common Lisp, how can one read & write symbolic expressions from/to streams? For example, I might want to write an anonymous function to file and then read ...
symbolic expression stream I/O symbolic expression stream I/O lisp common-lisp s-expression sexp-io.lisp Try Documents Lisp Concurrency sexp.lisp Anonymous x3020018F950F Error Reader BASIC-FILE-CHARACTER-INPUT-STREAM Users UTF-8 x3020018F559D While CCL::SIGNAL-READER-ERROR Listener symbolic expression stream I/O In Com...
[ 0.0054931640625, 0.0186767578125, -0.0037841796875, -0.00555419921875, -0.005523681640625, -0.00482177734375, 0.0089111328125, 0.0059814453125, -0.0191650390625, -0.01495361328125, 0.00457763671875, 0.00897216796875, 0.0184326171875, 0.0184326171875, 0.038330078125, -0.00457763671875, ...
[ 128201, 238, 125195, 75973, 87, 64, 670, 400, 7008, 39210, 4086, 254, 91, 204629, 1100, 846, 40858, 43101, 1261, 64240, 180585, 1197, 5955, 1819, 149390, 919, 212059, 122636, 96971, 52099, 126349, 124599, 56564, 53400, 30992, 17376, 160443, 3...
[ 0.271240234375, 0.1226806640625, 0.25048828125, 0.2359619140625, 0.049163818359375, 0.1685791015625, 0.149658203125, 0.0921630859375, 0.2274169921875, 0.114501953125, 0.09625244140625, 0.131591796875, 0.027984619140625, 0.1910400390625, 0.05523681640625, 0.1016845703125, 0.0781860351...
embed
16503042_c0
16503042
lisp
0
Title: How to implement a Stack in LISP language Problem title: How to implement a Stack in LISP language Tags: stack, lisp, implementation Problem: How to implement a Stack in LISP language I am still learning Lisp language and I need to understand how to implement a stack with Lisp (Need push-pop-peek functions.). In...
How to implement a Stack in LISP language How to implement a Stack in LISP language stack lisp implementation How Stack LISP How to implement a Stack in LISP language I am still learning Lisp language and I need to understand how to implement a stack with Lisp (Need push-pop-peek functions.). In addition I have found t...
[ 0.0028076171875, 0.0250244140625, -0.0107421875, 0.02880859375, -0.019775390625, 0.0113525390625, 0.0028228759765625, 0.0146484375, 0.00048065185546875, -0.015869140625, 0.0123291015625, 0.0238037109375, -0.006683349609375, -0.00250244140625, 0.004608154296875, 0.01611328125, -0.0104...
[ 11249, 29479, 6512, 2594, 23, 16970, 9434, 46876, 47, 10, 177261, 400, 7008, 208124, 7464, 52080, 1261, 28219, 3642, 678, 6433, 297, 25944, 33554, 1081, 343, 32354, 14037, 18151, 157318, 4358, 9077, 20697, 155965 ]
[ 0.05419921875, 0.2447509765625, 0.210205078125, 0.2425537109375, 0.046356201171875, 0.166015625, 0.221923828125, 0.1610107421875, 0.017608642578125, 0.044525146484375, 0.2271728515625, 0.1597900390625, 0.2188720703125, 0.2076416015625, 0.0251922607421875, 0.034912109375, 0.1579589843...
embed
12634330_c0
12634330
lisp
0
Title: Transient classes in CLOS Problem title: Transient classes in CLOS Tags: lisp, garbage-collection, common-lisp, clos Problem: Transient classes in CLOS Is there any standard way to create a transient class in CLOS; that is, a class which can be GC'd after all its instances are dead? In SBCL, I tried (setf test (...
Transient classes in CLOS Transient classes in CLOS lisp garbage-collection common-lisp clos Transient CLOS Transient classes in CLOS Is there any standard way to create a transient class in CLOS; that is, a class which can be GC'd after all its instances are dead? In SBCL, I tried (setf test (defclass #:foo () ())) , ...
[ 0.01055908203125, 0.0233154296875, 0.01080322265625, 0.004119873046875, -0.0164794921875, -0.0179443359375, -0.006683349609375, 0.000743865966796875, -0.00811767578125, 0.01019287109375, -0.00506591796875, 0.0162353515625, -0.01251220703125, 0.006927490234375, -0.000545501708984375, 0....
[ 11062, 18750, 61112, 23, 313, 92933, 400, 7008, 3671, 402, 429, 196352, 39210, 4086, 254, 20450, 7, 2071, 2685, 2499, 5570, 3917, 28282, 3900, 18507, 831, 186, 69657, 25, 71, 7103, 756, 6863, 110527, 621, 103494, 90944, 37486, 37842, 3509...
[ 0.1756591796875, 0.218017578125, 0.281982421875, 0.091552734375, 0.0673828125, 0.252197265625, 0.0765380859375, 0.1497802734375, 0.0108642578125, 0.144287109375, 0.0294189453125, 0.1337890625, 0.08795166015625, 0.05950927734375, 0.1282958984375, 0.18505859375, 0.0308990478515625, 0...
embed
57013120_c0
57013120
lisp
0
Title: Recursion in Common Lisp, pushing values, and the Fibonacci Sequence Problem title: Recursion in Common Lisp, pushing values, and the Fibonacci Sequence Tags: recursion, lisp, fibonacci, common-lisp, clisp Problem: Recursion in Common Lisp, pushing values, and the Fibonacci Sequence This is not a homework assign...
Recursion in Common Lisp, pushing values, and the Fibonacci Sequence Recursion in Common Lisp, pushing values, and the Fibonacci Sequence recursion lisp fibonacci common-lisp clisp Recursion Common Lisp Fibonacci Sequence Recursion in Common Lisp, pushing values, and the Fibonacci Sequence This is not a homework assign...
[ 0.00994873046875, 0.018310546875, -0.001556396484375, -0.00106048583984375, -0.01495361328125, 0.0206298828125, 0.003936767578125, -0.02001953125, 0.004852294921875, -0.0262451171875, -0.00189971923828125, -0.015625, -0.0172119140625, -0.01409912109375, 0.01422119140625, 0.011901855468...
[ 165428, 42, 6889, 23, 151301, 1261, 7008, 25944, 214, 142424, 136, 3698, 20990, 52544, 503, 944, 3956, 195625, 1830, 400, 809, 39210, 4086, 254, 95701, 959, 18244, 95486, 25632, 18151, 32233, 83613, 111468, 86669, 15400, 32354, 14602, 30646, ...
[ 0.153076171875, 0.16162109375, 0.125732421875, 0.0548095703125, 0.181396484375, 0.15283203125, 0.1971435546875, 0.144287109375, 0.04498291015625, 0.2015380859375, 0.001953125, 0.1016845703125, 0.1224365234375, 0.166015625, 0.044769287109375, 0.1268310546875, 0.064208984375, 0.22106...
embed
70829608_c0
70829608
lisp
0
Title: Prog can&#x27;t run on page 113 of &lt;&lt;Lisp in small pieces&gt;&gt; Problem title: Prog can&#x27;t run on page 113 of &lt;&lt;Lisp in small pieces&gt;&gt; Tags: lisp, scheme Problem: Prog can't run on page 113 of < > The code from page 113 of Lisp in small pieces seems can't run on r5rs environment of racket...
Prog can&#x27;t run on page 113 of &lt;&lt;Lisp in small pieces&gt;&gt; Prog can&#x27;t run on page 113 of &lt;&lt;Lisp in small pieces&gt;&gt; lisp scheme Prog Lisp Hemo Nemo Prog can't run on page 113 of < > The code from page 113 of Lisp in small pieces seems can't run on r5rs environment of racket: and: both got er...
[ 0.0027923583984375, 0.01611328125, -0.005401611328125, 0.01806640625, -0.00653076171875, -0.00012874603271484375, -0.01080322265625, -0.00183868408203125, -0.0004863739013671875, -0.05078125, 0.010498046875, 0.007659912109375, 0.0020751953125, -0.0224609375, 0.0157470703125, -0.0192871...
[ 1250, 177, 831, 3768, 18, 11675, 9191, 49508, 9506, 7008, 23, 19336, 126371, 400, 150370, 1261, 14313, 31, 73479, 98, 18151, 37202, 1690, 758, 4295, 65998, 673, 27853, 18499, 70, 903, 12877, 44691, 4527, 61924 ]
[ 0.2110595703125, 0.171142578125, 0.1119384765625, 0.0257720947265625, 0.113037109375, 0.1650390625, 0.1243896484375, 0.21142578125, 0.1348876953125, 0.2216796875, 0.0992431640625, 0.11669921875, 0.1444091796875, 0.1156005859375, 0.17236328125, 0.15234375, 0.130615234375, 0.13330078...
embed
4927567_c0
4927567
lisp
0
Title: Calling functions by name at runtime Problem title: Calling functions by name at runtime Tags: lisp, common-lisp Problem: Calling functions by name at runtime I realize that a function can be referenced using #'PRINT to reference the PRINT function. If we have a list S where the first element is 'PRINT , can we ...
Calling functions by name at runtime Calling functions by name at runtime lisp common-lisp Calling Calling functions by name at runtime I realize that a function can be referenced using #'PRINT to reference the PRINT function. If we have a list S where the first element is 'PRINT , can we reference this using #(car S) ...
[ -0.0030670166015625, 0.0081787109375, 0.019287109375, 0.021728515625, 0.00335693359375, 0.003814697265625, -0.004119873046875, 0.019775390625, 0.003692626953125, -0.028076171875, -0.00897216796875, 0.00396728515625, -0.018798828125, 0.0072021484375, 0.00567626953125, -0.004730224609375...
[ 26265, 214, 32354, 7, 390, 9351, 99, 11675, 6032, 400, 7008, 39210, 4086, 254, 92154, 831, 91067, 71, 17368, 468, 17255, 59537, 10865, 5303, 159, 5117, 12830, 3284, 16487, 80854, 34627, 123055, 114063, 9969, 6743, 116, 85398, 10994, 363, ...
[ 0.17724609375, 0.08111572265625, 0.2457275390625, 0.042755126953125, 0.0882568359375, 0.2095947265625, 0.125732421875, 0.1417236328125, 0.18994140625, 0.08551025390625, 0.189208984375, 0.1024169921875, 0.05517578125, 0.15234375, 0.0582275390625, 0.072265625, 0.2491455078125, 0.0120...
embed
34043236_c0
34043236
lisp
0
Title: Sort Polynomial based on Symbol and Exponent Problem title: Sort Polynomial based on Symbol and Exponent Tags: polynomial-math, lisp, common-lisp, clisp Problem: Sort Polynomial based on Symbol and Exponent I'm writing writing polynomial arithmetic in lisp, and currently working on addition. I need help sorting ...
Sort Polynomial based on Symbol and Exponent Sort Polynomial based on Symbol and Exponent polynomial-math lisp common-lisp clisp Sort Polynomial Symbol Exponent Sort Polynomial based on Symbol and Exponent I'm writing writing polynomial arithmetic in lisp, and currently working on addition. I need help sorting a polyno...
[ 0.010986328125, 0.0174560546875, 0.0026092529296875, 0.00012159347534179688, -0.035888671875, 0.01214599609375, 0.0234375, -0.005462646484375, -0.00445556640625, -0.003448486328125, 0.01324462890625, 0.0235595703125, 0.00982666015625, 0.0050048828125, -0.0244140625, 0.01458740234375, ...
[ 53666, 63306, 1687, 15403, 35509, 131899, 136, 5443, 54137, 35874, 125458, 400, 7008, 39210, 4086, 254, 95701, 32562, 8962, 20697, 66044, 4358, 12096, 214, 390, 1119, 26582, 33636, 32354, 3871, 196219, 34475, 13579, 2806, 3444, 176377, 221, 4...
[ 0.213623046875, 0.1893310546875, 0.18505859375, 0.1566162109375, 0.080322265625, 0.251220703125, 0.0738525390625, 0.1036376953125, 0.2086181640625, 0.167236328125, 0.0394287109375, 0.0711669921875, 0.1705322265625, 0.056640625, 0.041748046875, 0.12451171875, 0.036163330078125, 0.03...
embed
75580723_c0
75580723
lisp
0
Title: Combine 2 lists without repetition in lisp Problem title: Combine 2 lists without repetition in lisp Tags: lisp, common-lisp Problem: Combine 2 lists without repetition in lisp I just started studying lisp and it became a problem, I went through a bunch of options, I don't even know which one to attach. It sound...
Combine 2 lists without repetition in lisp Combine 2 lists without repetition in lisp lisp common-lisp Combine Combine 2 lists without repetition in lisp I just started studying lisp and it became a problem, I went through a bunch of options, I don't even know which one to attach. It sounds like this : write a function...
[ -0.028564453125, 0.045166015625, 0.006866455078125, 0.01043701171875, -0.0247802734375, 0.0162353515625, 0.00836181640625, 0.00665283203125, 0.004241943359375, -0.009765625, 0.0025482177734375, 0.0093994140625, 0.030517578125, -0.00421142578125, -0.00445556640625, 0.0159912109375, -0...
[ 106935, 86, 116, 5303, 15490, 57346, 23, 400, 7008, 39210, 4086, 254, 35187, 2967, 50717, 243, 934, 102678, 33022, 32354, 70163, 7, 13146, 138, 201, 21162, 9451, 305, 361, 65034, 5443, 217, 62822, 123309, 831, 11814, 40956, 39933, 8951, 1...
[ 0.2359619140625, 0.0966796875, 0.19580078125, 0.2548828125, 0.1522216796875, 0.2322998046875, 0.1630859375, 0.145263671875, 0.1925048828125, 0.1082763671875, 0.1168212890625, 0.1690673828125, 0.01220703125, 0.041839599609375, 0.0640869140625, 0.0618896484375, 0.108642578125, 0.0761...
embed
64904835_c1
64904835
lisp
1
(check-expect (powerset '(1 2 3)) (list '(1 2 3) '(2 3) '(1 3) '(3) '(1 2) '(2) '(1) '())) This code runs and produces a correct result, but, as you can see, I still rely on an external helper function, combine , and I have no idea how to convert that into a lambda since to my knowledge, the Y-combinator only works wi...
(check-expect (powerset '(1 2 3)) (list '(1 2 3) '(2 3) '(1 3) '(3) '(1 2) '(2) '(1) '())) This code runs and produces a correct result, but, as you can see, I still rely on an external helper function, combine , and I have no idea how to convert that into a lambda since to my knowledge, the Y-combinator only works wi...
[ 0.00909423828125, 0.0152587890625, 0.005706787109375, 0.0093994140625, 0.002593994140625, 0.0164794921875, -0.0062255859375, -0.007354736328125, 0.002410888671875, -0.031005859375, -0.015380859375, 0.005584716796875, 0.0076904296875, 0.0011749267578125, -0.0086669921875, 0.012329101562...
[ 78292, 83613, 24762, 62783, 3509, 116, 8439, 6562, 41600, 54753, 69829, 4958, 40970, 27750, 18151, 127877, 27489, 26785, 16750, 456, 538, 173591, 4358, 56, 32354, 70163, 110, 6528, 3642, 96760, 3934, 21, 6492, 85, 51359, 990, 277, 19155, 12...
[ 0.1947021484375, 0.2032470703125, 0.23779296875, 0.1837158203125, 0.23828125, 0.0780029296875, 0.1011962890625, 0.1593017578125, 0.01043701171875, 0.006591796875, 0.000885009765625, 0.063720703125, 0.0108642578125, 0.013458251953125, 0.1796875, 0.07830810546875, 0.0570068359375, 0....
embed
54127398_c1
54127398
lisp
1
(framebuffer) to start drawing void BeginDrawing(void) { currentTime = GetTime(); // Number of elapsed seconds since InitTimer() updateTime = currentTime - previousTime; previousTime = currentTime; rlLoadIdentity(); // Reset current matrix (MODELVIEW) rlMultMatrixf(MatrixToFloat(downscaleView)); // If downscale requir...
(framebuffer) to start drawing void BeginDrawing(void) { currentTime = GetTime(); // Number of elapsed seconds since InitTimer() updateTime = currentTime - previousTime; previousTime = currentTime; rlLoadIdentity(); // Reset current matrix (MODELVIEW) rlMultMatrixf(MatrixToFloat(downscaleView)); // If downscale requir...
[ -0.01531982421875, -0.008544921875, -0.003387451171875, 0.0036163330078125, -0.0024566650390625, -0.00823974609375, 0.0260009765625, -0.0230712890625, 0.009765625, -0.023681640625, 0.00592041015625, -0.021728515625, 0.004425048828125, -0.0152587890625, -0.002227783203125, -0.0249023437...
[ 160328, 123759, 56, 47, 4034, 188304, 2292, 71, 121427, 397, 219, 14775, 965, 532, 43581, 70059, 20779, 103332, 127966, 94131, 16792, 360, 217, 42, 28350, 96362, 54123, 15363, 37379, 9624, 126, 50944, 12013, 62507, 204148, 50657, 87427, 420, ...
[ 0.1627197265625, 0.2120361328125, 0.1151123046875, 0.009185791015625, 0.182373046875, 0.23193359375, 0.2216796875, 0.0103759765625, 0.224365234375, 0.03814697265625, 0.123291015625, 0.184814453125, 0.18017578125, 0.1610107421875, 0.1878662109375, 0.1851806640625, 0.038726806640625, ...
embed
7052963_c1
7052963
lisp
1
are just plain nasty due to the lack of expressiveness. Despite this, I can generally always work out what's going on without reading the documentation -- Which can't be said about custom DSLs in the slightest. Maybe DSL proponents argue that you should always read API documentation. I disagree, but I also digress. Bu...
are just plain nasty due to the lack of expressiveness. Despite this, I can generally always work out what's going on without reading the documentation -- Which can't be said about custom DSLs in the slightest. Maybe DSL proponents argue that you should always read API documentation. I disagree, but I also digress. Bu...
[ 0.007598876953125, 0.00008440017700195312, 0.01019287109375, -0.012451171875, -0.00848388671875, 0.0223388671875, 0.0000705718994140625, -0.002288818359375, -0.01239013671875, 0.007232666015625, 0.0014190673828125, -0.0263671875, -0.0166015625, 0.0030670166015625, 0, 0.0034332275390625...
[ 621, 111719, 24, 8946, 4743, 92635, 36510, 5844, 7432, 61518, 831, 137567, 11343, 4488, 1810, 15490, 16454, 209806, 114122, 114479, 7, 20016, 58008, 16037, 187, 5608, 12301, 61687, 217573, 6713, 6957, 46876, 3095, 313, 4904, 136, 41925, 11098...
[ 0.07025146484375, 0.0732421875, 0.13134765625, 0.179931640625, 0.01861572265625, 0.117919921875, 0.096435546875, 0.08465576171875, 0.008209228515625, 0.00335693359375, 0.0209503173828125, 0.029998779296875, 0.053497314453125, 0.07415771484375, 0.0292510986328125, 0.01483154296875, 0....
embed
76016762_c0
76016762
lisp
0
Title: Does `mapcan` really use `nconc`? Problem title: Does `mapcan` really use `nconc`? Tags: common-lisp, lisp Problem: Does `mapcan` really use `nconc`? According to Common Lisp HyperSpec (CLHS) , mapcan uses nconc to combine its results into a list. CLHS also says that (mapcon f x1 ... xn) == (apply #'nconc (mapli...
Does `mapcan` really use `nconc`? Does `mapcan` really use `nconc`? common-lisp lisp 0 Does Does `mapcan` really use `nconc`? According to Common Lisp HyperSpec (CLHS) , mapcan uses nconc to combine its results into a list. CLHS also says that So I've been concerned about the ramifications of using apply where call-arg...
[ -0.00341796875, 0.0038909912109375, 0.0211181640625, 0.020263671875, -0.0283203125, -0.001708984375, -0.0004520416259765625, 0.0167236328125, 0.01226806640625, -0.05126953125, 0.0152587890625, -0.0322265625, 0.007415771484375, 0.0162353515625, 0.00738525390625, -0.0166015625, 0.01110...
[ 62346, 4398, 6183, 4527, 19, 2271, 238, 39210, 4086, 254, 400, 7008, 151301, 1261, 92179, 47107, 37486, 38131, 22288, 653, 70163, 50339, 5303, 46323, 142837, 13969, 41274, 17368, 59911, 11782, 155937, 93343, 27226, 831, 836, 108259, 13330, 65...
[ 0.1539306640625, 0.2125244140625, 0.1368408203125, 0.1553955078125, 0.1285400390625, 0.1693115234375, 0.16650390625, 0.059356689453125, 0.03704833984375, 0.070068359375, 0.03729248046875, 0.1317138671875, 0.0836181640625, 0.09027099609375, 0.0968017578125, 0.1351318359375, 0.00463867...
embed
34862373_c0
34862373
lisp
0
Title: Playing a sine-wave signal using rsound Problem title: Playing a sine-wave signal using rsound Tags: audio, lisp, racket Problem: Playing a sine-wave signal using rsound I wrote this code after reading the rsound documentation in Racket: #lang racket (provide (all-defined-out)) (require rsound) (define (sunet) (...
Playing a sine-wave signal using rsound Playing a sine-wave signal using rsound audio lisp racket rsound Playing Playing a sine-wave signal using rsound I wrote this code after reading the rsound documentation in Racket: I used the "sine-wave" function on a 880 Hz frequency and stored it into the function "sunet". Then...
[ -0.01239013671875, 0.0166015625, -0.014892578125, 0.00836181640625, -0.0074462890625, 0.0035400390625, 0.00080108642578125, -0.01043701171875, 0.001312255859375, -0.050048828125, 0.002685546875, -0.0244140625, -0.0157470703125, 0.004547119140625, -0.0050048828125, -0.0228271484375, 0...
[ 11356, 6634, 634, 272, 26073, 1690, 165207, 17368, 18215, 400, 7008, 673, 27853, 18151, 209806, 2552, 11814, 14186, 9, 32354, 111056, 50183, 12478, 944, 4343, 6548, 126, 190659, 165992, 20706, 11301, 237, 45730, 18499, 2071, 18, 10, 56112, ...
[ 0.156494140625, 0.2052001953125, 0.1822509765625, 0.135498046875, 0.189697265625, 0.1097412109375, 0.2247314453125, 0.01397705078125, 0.0965576171875, 0.030303955078125, 0.10430908203125, 0.046600341796875, 0.15673828125, 0.055206298828125, 0.00189208984375, 0.035064697265625, 0.0215...
embed
15485833_c0
15485833
lisp
0
Title: Emacs lisp evaluate variable in alist Problem title: Emacs lisp evaluate variable in alist Tags: lisp, emacs, elisp Problem: Emacs lisp evaluate variable in alist This is a follow-up question to Emacs Lisp: evaluate variable in alist .. I am trying to set default-frame-alist in my .emacs file. Consider, e.g. (se...
Emacs lisp evaluate variable in alist Emacs lisp evaluate variable in alist lisp emacs elisp Emacs Emacs lisp evaluate variable in alist This is a follow-up question to Emacs Lisp: evaluate variable in alist .. I am trying to set default-frame-alist in my .emacs file. Consider, e.g. (I have omitted some values) This wo...
[ 0.002288818359375, 0.005950927734375, -0.007232666015625, -0.005615234375, -0.006561279296875, 0.01025390625, -0.006591796875, 0.0146484375, -0.0096435546875, 0.00848388671875, 0.005523681640625, 0.0205078125, 0.016357421875, -0.00457763671875, -0.01165771484375, -0.01043701171875, -...
[ 85269, 4439, 400, 7008, 151575, 13, 77336, 23, 10, 6562, 352, 2263, 1261, 31577, 5423, 114977, 160328, 11, 11883, 11435, 137399, 171, 217, 142424, 43240, 5885, 3444, 155955, 59499, 15700, 4343, 892, 1505, 34292, 836, 759, 1106, 22553, 11249...
[ 0.1268310546875, 0.1544189453125, 0.111328125, 0.181884765625, 0.1995849609375, 0.0587158203125, 0.268310546875, 0.0709228515625, 0.086669921875, 0.2186279296875, 0.03778076171875, 0.0657958984375, 0.10662841796875, 0.021331787109375, 0.1400146484375, 0.2392578125, 0.1949462890625, ...
embed
39182672_c0
39182672
lisp
0
Title: Newton&#x27;s square root method in Scheme or Common Lisp Problem title: Newton&#x27;s square root method in Scheme or Common Lisp Tags: common-lisp, lisp, scheme Problem: Newton's square root method in Scheme or Common Lisp I am not able to figure out the error in this program. This is the Scheme version. I tri...
Newton&#x27;s square root method in Scheme or Common Lisp Newton&#x27;s square root method in Scheme or Common Lisp common-lisp lisp scheme Newton Scheme Common Lisp sqrt1 Newton's square root method in Scheme or Common Lisp I am not able to figure out the error in this program. This is the Scheme version. I tried Comm...
[ -0.001617431640625, 0.00384521484375, 0.0089111328125, -0.006103515625, 0.00439453125, 0.007293701171875, -0.005889892578125, -0.0081787109375, -0.004241943359375, -0.02197265625, 0.00555419921875, -0.003448486328125, -0.01239013671875, -0.02783203125, -0.0072021484375, -0.008178710937...
[ 145076, 54764, 3768, 108047, 74855, 55300, 23, 34702, 282, 707, 151301, 1261, 7008, 39210, 4086, 254, 400, 150370, 864, 3198, 418, 25, 7, 959, 19048, 26366, 1810, 70, 18499, 903, 1528, 3293, 83, 11389, 37842, 15044, 13695, 51042, 15490, 2...
[ 0.26220703125, 0.0055999755859375, 0.11395263671875, 0.1907958984375, 0.2354736328125, 0.2247314453125, 0.08837890625, 0.1927490234375, 0.18212890625, 0.106201171875, 0.169677734375, 0.1370849609375, 0.19580078125, 0.12200927734375, 0.07916259765625, 0.1085205078125, 0.0809326171875,...
embed
30792696_c0
30792696
lisp
0
Title: Read next line when loading file in Common Lisp Problem title: Read next line when loading file in Common Lisp Tags: load, stdin, lisp, common-lisp Problem: Read next line when loading file in Common Lisp I have a file, test.lisp that is essentially this: (load (compile-file "init.lisp")) (my-funcA 2 3) (my-func...
Read next line when loading file in Common Lisp Read next line when loading file in Common Lisp load stdin lisp common-lisp Read Common Lisp init.lisp Read next line when loading file in Common Lisp I have a file, test.lisp that is essentially this: Inside the init.lisp file i would like to be able to read the lines (m...
[ 0.0140380859375, -0.011962890625, 0.009033203125, 0.0167236328125, -0.011474609375, -0.00177764892578125, 0.031494140625, 0.0030059814453125, -0.000400543212890625, -0.049560546875, -0.00909423828125, 0.005126953125, -0.01953125, -0.0267333984375, 0.005889892578125, -0.007415771484375,...
[ 4764, 11737, 13315, 3229, 72367, 214, 11435, 151301, 1261, 7008, 23, 6138, 3035, 400, 39210, 4086, 254, 217, 3034, 85590, 187040, 1884, 19048, 12301, 124519, 1176, 16498, 284, 8439, 571, 201, 21162, 54, 41884, 678, 903, 7722, 37842, 4527, ...
[ 0.2091064453125, 0.165771484375, 0.156005859375, 0.038421630859375, 0.16162109375, 0.07086181640625, 0.153076171875, 0.1673583984375, 0.148681640625, 0.1883544921875, 0.0640869140625, 0.081298828125, 0.0794677734375, 0.106689453125, 0.1304931640625, 0.1373291015625, 0.1767578125, 0...
embed
71729665_c0
71729665
lisp
0
Title: lisp iterative or recursive? Problem title: lisp iterative or recursive? Tags: recursion, lisp, iteration Problem: lisp iterative or recursive? Given: (cont-frac (lambda (i) 1.0) (lambda (i) 1.0) k), d and k is a function themselves. Solutions -iterative: (define (cont-frac-iter n d k) (define (iter i result) (i...
lisp iterative or recursive? lisp iterative or recursive? recursion lisp iteration Given Solutions sub1 lisp iterative or recursive? Question: given solutions are correct, both recursive and iterative approach have same outcome , but why the recursive solution count as recursive? what is the difference between them bot...
[ -0.0191650390625, -0.0035400390625, 0.000308990478515625, -0.015869140625, -0.00762939453125, 0.00384521484375, -0.005157470703125, -0.00518798828125, -0.00830078125, -0.03564453125, -0.01446533203125, -0.0255126953125, -0.0079345703125, -0.01446533203125, 0.018798828125, 0.00013446807...
[ 400, 7008, 17, 720, 45023, 707, 195625, 5844, 32, 1830, 2320, 77878, 19, 109339, 1614, 34475, 51347, 26785, 15044, 136, 51515, 5701, 184345, 15400, 29806, 54529, 237, 60212, 17721 ]
[ 0.135986328125, 0.222412109375, 0.0643310546875, 0.2208251953125, 0.21630859375, 0.0994873046875, 0.205078125, 0.203125, 0.0215606689453125, 0.07342529296875, 0.0185699462890625, 0.07904052734375, 0.0237884521484375, 0.145751953125, 0.07672119140625, 0.07855224609375, 0.156494140625,...
embed
58604313_c0
58604313
lisp
0
Title: How can I convert char to symbol in common lisp? Problem title: How can I convert char to symbol in common lisp? Tags: common-lisp, lisp, list Problem: How can I convert char to symbol in common lisp? Total lisp beginner here. I'm wondering how to convert a character to symbol. Simply what I want is convert #\a ...
How can I convert char to symbol in common lisp? How can I convert char to symbol in common lisp? common-lisp lisp list How How can I convert char to symbol in common lisp? Total lisp beginner here. I'm wondering how to convert a character to symbol. Simply what I want is convert #\a to a Here what I have done so far: ...
[ 0.004852294921875, -0.012451171875, 0.00041961669921875, 0.0026702880859375, -0.01251220703125, 0.01904296875, -0.012451171875, 0.0186767578125, -0.009033203125, 0.00066375732421875, -0.004974365234375, -0.0111083984375, -0.004302978515625, 0.0179443359375, -0.021240234375, -0.00848388...
[ 11249, 831, 87, 96760, 21441, 47, 26582, 23, 39210, 400, 7008, 4086, 254, 5303, 33867, 9842, 1679, 149016, 3642, 62816, 3444, 468, 41872, 11, 10, 11853, 2060, 43240, 20653, 15190, 1381, 27289, 63049, 229231, 18151, 32354, 4904, 127, 28, 9...
[ 0.0810546875, 0.0633544921875, 0.042510986328125, 0.16259765625, 0.229736328125, 0.11376953125, 0.271484375, 0.074462890625, 0.1790771484375, 0.1331787109375, 0.164306640625, 0.110107421875, 0.107666015625, 0.1309814453125, 0.0221710205078125, 0.010986328125, 0.010223388671875, 0.0...
embed
37213306_c0
37213306
lisp
0
Title: How to wrap Exception in Clojure Macro? Problem title: How to wrap Exception in Clojure Macro? Tags: clojure, functional-programming, lisp, macros Problem: How to wrap Exception in Clojure Macro? I would like to wrap exception which has been thrown by system or user(does not matter) and force it to return some v...
How to wrap Exception in Clojure Macro? How to wrap Exception in Clojure Macro? clojure functional-programming lisp macros RuntimeException How Exception Clojure Macro Throwable Try clojure-brave-and-true.core eval2219 form-init6122238559239237921.clj:1 How to wrap Exception in Clojure Macro? I would like to wrap excep...
[ -0.002471923828125, 0.0289306640625, -0.001800537109375, -0.0224609375, 0.00102996826171875, -0.0003490447998046875, 0.007537841796875, -0.01092529296875, -0.0098876953125, -0.033203125, -0.01251220703125, -0.0042724609375, -0.0218505859375, -0.006317138671875, 0.0289306640625, -0.0354...
[ 11249, 137565, 5443, 63928, 51053, 461, 107, 4727, 516, 20450, 123309, 28966, 400, 7008, 111789, 28398, 6032, 19279, 6003, 15555, 2886, 40858, 2844, 2940, 9774, 30854, 1405, 2947, 3173, 217, 104342, 141520, 3117, 21178, 23, 1884, 47, 131527, ...
[ 0.028106689453125, 0.249755859375, 0.1590576171875, 0.2783203125, 0.13916015625, 0.1656494140625, 0.1104736328125, 0.092529296875, 0.1754150390625, 0.10546875, 0.1036376953125, 0.036346435546875, 0.011810302734375, 0.1048583984375, 0.19580078125, 0.04364013671875, 0.0858154296875, ...
embed
5689375_c1
5689375
lisp
1
say " return nil in all cases but a list under these conditions. If two list items met the condition, they would be appended otherwise it should just return the list from the previous recursion level. [EDITED] to provide additional information. My original function that works just fine for breaking apart and rebuildin...
say " return nil in all cases but a list under these conditions. If two list items met the condition, they would be appended otherwise it should just return the list from the previous recursion level. [EDITED] to provide additional information. My original function that works just fine for breaking apart and rebuildin...
[ -0.0164794921875, 0.01611328125, 0.00098419189453125, 0.005615234375, 0.00113677978515625, 0.0201416015625, -0.006988525390625, 0.000553131103515625, 0.01507568359375, 0.01611328125, 0.02783203125, -0.023193359375, 0.00396728515625, 0.0194091796875, 0.01177978515625, 0.006134033203125,...
[ 5154, 44, 30646, 17324, 756, 50218, 5303, 1379, 6097, 27289, 6626, 55769, 435, 35431, 114689, 48141, 96362, 195625, 1830, 17366, 7311, 32354, 43240, 1660, 5885, 116987, 34955, 136, 456, 146049, 112, 16498, 65450, 3957, 19, 4332, 177149, 15466...
[ 0.13818359375, 0.0270843505859375, 0.1859130859375, 0.19775390625, 0.06146240234375, 0.1026611328125, 0.153564453125, 0.05035400390625, 0.012664794921875, 0.1044921875, 0.0540771484375, 0.091552734375, 0.07177734375, 0.13525390625, 0.128662109375, 0.0697021484375, 0.026123046875, 0...
embed
33367492_c0
33367492
lisp
0
Title: Finding the diagonals of square matrix made from lists Problem title: Finding the diagonals of square matrix made from lists Tags: scheme, recursion, matrix, lisp Problem: Finding the diagonals of square matrix made from lists I am currently trying to define a function that takes a list of lists, models that lis...
Finding the diagonals of square matrix made from lists Finding the diagonals of square matrix made from lists scheme recursion matrix lisp lists Finding Finding the diagonals of square matrix made from lists I am currently trying to define a function that takes a list of lists, models that list as a square matrix and r...
[ -0.01422119140625, 0.021484375, -0.003082275390625, -0.00921630859375, -0.0128173828125, 0.01531982421875, -0.013427734375, 0.031494140625, 0.00005340576171875, -0.03125, 0.0155029296875, -0.0181884765625, -0.022705078125, 0.003173828125, -0.0034637451171875, 0.009765625, -0.00350952...
[ 26040, 207997, 7, 111, 108047, 50944, 425, 7228, 1295, 5303, 150370, 195625, 1830, 400, 7008, 70, 82424, 31577, 61924, 32354, 51776, 115774, 237, 30646, 107730, 876, 501, 71, 28, 1238, 177, 1096, 17, 76199, 11, 6528, 3115, 6496, 1865, 456...
[ 0.1256103515625, 0.253662109375, 0.1246337890625, 0.050506591796875, 0.17041015625, 0.1907958984375, 0.06561279296875, 0.0906982421875, 0.1124267578125, 0.2266845703125, 0.1695556640625, 0.13232421875, 0.007415771484375, 0.03179931640625, 0.10675048828125, 0.0032958984375, 0.01025390...
embed
25234257_c0
25234257
lisp
0
Title: Removing from nested lists Problem title: Removing from nested lists Tags: common-lisp, lisp Problem: Removing from nested lists I've got a homework assignment that has stumped me! I have to create a function goo(A L) that will remove every A in L and it has to work on nested lists also. Here's what I've got so ...
Removing from nested lists Removing from nested lists common-lisp lisp nested Removing Removing from nested lists I've got a homework assignment that has stumped me! I have to create a function goo(A L) that will remove every A in L and it has to work on nested lists also. Here's what I've got so far This function retu...
[ -0.018798828125, 0.02880859375, 0.0128173828125, 0.0111083984375, -0.005462646484375, 0.0108642578125, 0.024658203125, -0.00555419921875, 0.0023956298828125, -0.0159912109375, 0.00823974609375, -0.0262451171875, 0.01300048828125, 0.01513671875, -0.0120849609375, -0.00811767578125, 0....
[ 853, 432, 6496, 1295, 8512, 71, 5303, 39210, 4086, 254, 400, 7008, 7, 5368, 18244, 95486, 674, 48708, 20051, 765, 28282, 32354, 738, 31, 132, 284, 339, 1221, 87388, 11907, 62, 23, 4488, 98, 4163, 2060, 3293, 30646, 87599, 110, 26866, ...
[ 0.037811279296875, 0.184326171875, 0.0869140625, 0.151123046875, 0.271728515625, 0.1829833984375, 0.2406005859375, 0.125732421875, 0.0867919921875, 0.123046875, 0.079833984375, 0.1361083984375, 0.012786865234375, 0.03131103515625, 0.0924072265625, 0.0970458984375, 0.03790283203125, ...
embed
39048561_c0
39048561
lisp
0
Title: Issues when write `loop ... collect` in macro Problem title: Issues when write `loop ... collect` in macro Tags: macros, clisp, common-lisp, lisp Problem: Issues when write `loop ... collect` in macro guys. Today I want to write sigma macro to calculate the sum from the flexible expression input. The code below ...
Issues when write `loop ... collect` in macro Issues when write `loop ... collect` in macro macros clisp common-lisp lisp Issues macroexpand-1 Issues when write `loop ... collect` in macro guys. Today I want to write sigma macro to calculate the sum from the flexible expression input. The code below is I written this a...
[ 0.0311279296875, 0.002960205078125, -0.00008106231689453125, 0.01043701171875, -0.018798828125, 0.01806640625, 0.01104736328125, 0.00909423828125, -0.00762939453125, -0.0301513671875, -0.0037689208984375, 0.01055908203125, 0.006805419921875, -0.006378173828125, 0.015625, -0.02722167968...
[ 223317, 33022, 28354, 153, 43799, 111789, 23, 95701, 7008, 39210, 4086, 254, 400, 83613, 2940, 5759, 3229, 51484, 3444, 1144, 192, 74481, 10554, 1295, 110677, 125195, 107730, 18151, 35064, 59121, 157109, 14602, 959, 4488, 28960, 60042, 43240, ...
[ 0.159912109375, 0.15087890625, 0.2459716796875, 0.1300048828125, 0.29736328125, 0.2125244140625, 0.049957275390625, 0.040313720703125, 0.145263671875, 0.0733642578125, 0.01019287109375, 0.113525390625, 0.0168304443359375, 0.07470703125, 0.09649658203125, 0.05047607421875, 0.007751464...
embed
8616514_c0
8616514
lisp
0
Title: Scheme - dynamic scope and infinte loop Problem title: Scheme - dynamic scope and infinte loop Tags: lisp, scheme, scope Problem: Scheme - dynamic scope and infinte loop I read a book about scheme, and it has the next example: (define map (lambda (f s) (if (null? s) '() (cons (f (car s)) (map f (cdr s))))) (map ...
Scheme - dynamic scope and infinte loop Scheme - dynamic scope and infinte loop lisp scheme scope Scheme Scheme - dynamic scope and infinte loop I read a book about scheme, and it has the next example: It say that in dynamic scope, we will enter to infinite loop. But why? As I understood, After we apply the application...
[ 0.020751953125, 0.0162353515625, 0.01129150390625, 0.01116943359375, -0.00732421875, -0.00897216796875, -0.001617431640625, 0.0252685546875, 0.004119873046875, -0.033935546875, 0.01019287109375, 0.0023956298828125, -0.0203857421875, -0.0037689208984375, 0.041015625, 0.010009765625, 0...
[ 34702, 282, 84079, 70820, 136, 34128, 6191, 40956, 400, 7008, 150370, 12301, 12877, 11737, 27781, 23, 642, 1221, 30957, 47, 54241, 13, 15400, 217064, 24372, 59911, 38415, 54410, 22288, 678, 91, 1369, 11, 876, 501, 104, 100, 5117, 11675, 1...
[ 0.1968994140625, 0.1485595703125, 0.22802734375, 0.2347412109375, 0.06298828125, 0.09674072265625, 0.10693359375, 0.246826171875, 0.0462646484375, 0.1324462890625, 0.1878662109375, 0.059967041015625, 0.067138671875, 0.013214111328125, 0.09814453125, 0.02728271484375, 0.02210998535156...
embed
11322922_c1
11322922
lisp
1
to have only a single address space (without the virtual layer)? Since we have GC and no pointer, should it be safe to operate on physical memory without breaking it (since having only 1 single space is a lot less complicated)? EDIT: I ask this because it is said that one of the advantage of Lisp is single address spa...
to have only a single address space (without the virtual layer)? Since we have GC and no pointer, should it be safe to operate on physical memory without breaking it (since having only 1 single space is a lot less complicated)? EDIT: I ask this because it is said that one of the advantage of Lisp is single address spa...
[ 0.00860595703125, 0.00830078125, 0.0038604736328125, 0.022216796875, -0.0150146484375, 0.0028228759765625, -0.00146484375, 0.0029449462890625, -0.0123291015625, -0.0322265625, 0.0272216796875, 0.00958251953125, -0.0059814453125, 0.00007152557373046875, -0.01348876953125, -0.00454711914...
[ 47, 765, 4734, 11001, 29823, 32628, 6056, 20513, 135355, 69657, 110, 6275, 56, 5608, 46002, 160404, 98, 72761, 98323, 15490, 116987, 19441, 106, 5915, 40715, 96704, 26458, 92940, 1261, 7008, 46876, 215543, 65998, 84797, 66211, 119488, 71, 943...
[ 0.002716064453125, 0.042755126953125, 0.08734130859375, 0.1749267578125, 0.19677734375, 0.2186279296875, 0.0247039794921875, 0.15869140625, 0.1646728515625, 0.19384765625, 0.0721435546875, 0.1732177734375, 0.1033935546875, 0.01092529296875, 0.186279296875, 0.1580810546875, 0.08251953...
embed
51005795_c0
51005795
lisp
0
Title: Lisp - How to call a function within another function? Problem title: Lisp - How to call a function within another function? Tags: autocad, autolisp, lisp Problem: Lisp - How to call a function within another function? I am trying to call the following function: (defun c:Add () (setq a (getint "Enter a number to...
Lisp - How to call a function within another function? Lisp - How to call a function within another function? autocad autolisp lisp Lisp How c:Add Enter LOOPER c:Adder Lisp - How to call a function within another function? I am trying to call the following function: Inside this LOOPER function: Like this: How do I get ...
[ 0.000946044921875, 0.0145263671875, -0.002349853515625, 0.014404296875, 0.001617431640625, 0.0191650390625, 0.03076171875, -0.0022430419921875, 0.0233154296875, -0.037353515625, -0.003143310546875, -0.0042724609375, -0.0390625, -0.01312255859375, 0.03076171875, -0.01220703125, -0.016...
[ 1261, 7008, 11249, 47, 11782, 32354, 28032, 15700, 1809, 25426, 4086, 254, 400, 4028, 60816, 339, 30563, 30425, 22409, 820, 31577, 25632, 187040, 903, 2046, 10932, 7477, 238, 9232, 5983 ]
[ 0.169189453125, 0.261962890625, 0.09576416015625, 0.0791015625, 0.20751953125, 0.2188720703125, 0.192626953125, 0.10272216796875, 0.08062744140625, 0.150390625, 0.091064453125, 0.1473388671875, 0.10504150390625, 0.07220458984375, 0.1693115234375, 0.07171630859375, 0.117431640625, 0...
embed
18948204_c0
18948204
lisp
0
Title: Checking for Proper Subsets Problem title: Checking for Proper Subsets Tags: common-lisp, lisp, subset Problem: Checking for Proper Subsets I need a function that can check if a list a is a proper subset of a list b . My code so far is: (defun proper-subset (a b) (cond (( or (null b)(null b)) nil) ((equal a b) n...
Checking for Proper Subsets Checking for Proper Subsets common-lisp lisp subset Checking Proper Subsets Checking for Proper Subsets I need a function that can check if a list a is a proper subset of a list b . My code so far is: find checks that each element of a is in b . I know the null arguments need some work as we...
[ -0.0015869140625, 0.0019989013671875, 0.017333984375, 0.007171630859375, -0.0281982421875, 0.0164794921875, -0.00018978118896484375, -0.0181884765625, 0.01141357421875, 0.0191650390625, 0.0020751953125, 0.006988525390625, 0.00994873046875, 0.000270843505859375, -0.004425048828125, -0.0...
[ 38679, 214, 100, 1250, 1264, 8273, 3509, 39210, 4086, 254, 400, 7008, 1614, 3871, 32354, 12765, 2174, 5303, 10, 83, 27798, 111, 876, 18151, 2060, 7413, 450, 12638, 12830, 23, 56574, 10750, 26366, 83324, 3229, 11907, 14037, 136, 1556, 1570...
[ 0.1929931640625, 0.0154266357421875, 0.1175537109375, 0.136962890625, 0.192626953125, 0.191162109375, 0.2279052734375, 0.103271484375, 0.055938720703125, 0.1099853515625, 0.06732177734375, 0.143310546875, 0.1822509765625, 0.07940673828125, 0.1595458984375, 0.21142578125, 0.0794677734...
embed
13673250_c0
13673250
lisp
0
Title: lisp reduce heap (array vs list) Problem title: lisp reduce heap (array vs list) Tags: arrays, heap-memory, lisp, list, memory Problem: lisp reduce heap (array vs list) I made a program in lisp that is increasing the heap way too fast. The problem should be one of two thing but I'm not sire which one is making t...
lisp reduce heap (array vs list) lisp reduce heap (array vs list) arrays heap-memory lisp list memory lisp reduce heap (array vs list) I made a program in lisp that is increasing the heap way too fast. The problem should be one of two thing but I'm not sire which one is making the heap grow so fast. One of them is a li...
[ -0.0052490234375, 0.005584716796875, -0.0234375, 0.01275634765625, -0.00811767578125, -0.0029296875, -0.01226806640625, 0.0023040771484375, 0.01080322265625, -0.0201416015625, 0.023193359375, -0.00555419921875, 0.0302734375, -0.01092529296875, -0.0022430419921875, -0.017822265625, 0....
[ 400, 7008, 34390, 764, 2631, 19305, 53, 20209, 5303, 10298, 4778, 109005, 98323, 7228, 1528, 118055, 5792, 4271, 2967, 6626, 13580, 20662, 55993, 221, 423, 19069, 12638, 45646, 201, 44457, 112992, 4734, 19336, 101935, 116, 71, 1837, 11907, ...
[ 0.1400146484375, 0.202392578125, 0.2646484375, 0.1754150390625, 0.178955078125, 0.123779296875, 0.1170654296875, 0.1341552734375, 0.208740234375, 0.1102294921875, 0.0880126953125, 0.141357421875, 0.1956787109375, 0.0242767333984375, 0.1533203125, 0.152099609375, 0.0841064453125, 0....
embed
79008334_c0
79008334
lisp
0
Title: How does recursive tail optimization work? Problem title: How does recursive tail optimization work? Tags: assembly, tail-call-optimization, scheme, lisp, common-lisp Problem: How does recursive tail optimization work? How does recursive tail call optimization work in regards to what is placed/removed from the c...
How does recursive tail optimization work? How does recursive tail optimization work? assembly tail-call-optimization scheme lisp common-lisp How How does recursive tail optimization work? How does recursive tail call optimization work in regards to what is placed/removed from the call stack? Specifically for LISP like...
[ 0.0074462890625, 0.0238037109375, -0.00019931793212890625, 0.0361328125, -0.0164794921875, -0.00933837890625, -0.01708984375, -0.027587890625, -0.006744384765625, 0.0103759765625, 0.010986328125, -0.0201416015625, -0.0026092529296875, -0.004974365234375, 0.0264892578125, -0.01354980468...
[ 11249, 14602, 195625, 5844, 46741, 87235, 1363, 4488, 89845, 38526, 85763, 100433, 47691, 150370, 400, 7008, 39210, 4086, 254, 11782, 158012, 26973, 1295, 177261, 16970, 9434, 1884, 46876, 149201, 17366, 98893, 7639, 49726, 4034, 66596, 159029, ...
[ 0.08599853515625, 0.0743408203125, 0.216796875, 0.15576171875, 0.26416015625, 0.1953125, 0.09002685546875, 0.1536865234375, 0.1151123046875, 0.0574951171875, 0.1793212890625, 0.12841796875, 0.06298828125, 0.0946044921875, 0.08392333984375, 0.1678466796875, 0.1019287109375, 0.062805...
embed
2382082_c0
2382082
lisp
0
Title: Inheritance classes in Scheme Problem title: Inheritance classes in Scheme Tags: scheme, lisp, inheritance Problem: Inheritance classes in Scheme Now I research OOP-part of Scheme. I can define class in Scheme like this: (define (create-queue) (let ((mpty #t) (the-list '())) (define (enque value) (set! the-list ...
Inheritance classes in Scheme Inheritance classes in Scheme scheme lisp inheritance Inheritance Scheme Inheritance classes in Scheme Now I research OOP-part of Scheme. I can define class in Scheme like this: (Example from css.freetonik.com ) Can I implement class inheritance in Scheme?
[ 0.00762939453125, 0.029052734375, -0.0189208984375, 0.0286865234375, -0.004486083984375, -0.0213623046875, 0.00083160400390625, -0.0111083984375, -0.01129150390625, -0.0201416015625, -0.0164794921875, -0.017333984375, -0.004608154296875, -0.0069580078125, -0.0174560546875, -0.006317138...
[ 360, 3334, 217, 7154, 61112, 23, 34702, 282, 150370, 400, 7008, 25188, 180, 20880, 17365, 831, 61924, 18507, 1884, 903, 11, 20763, 32087, 188, 1881, 4171, 29479 ]
[ 0.060028076171875, 0.1778564453125, 0.140380859375, 0.1182861328125, 0.259521484375, 0.1026611328125, 0.1929931640625, 0.185546875, 0.2359619140625, 0.05511474609375, 0.1524658203125, 0.06201171875, 0.0254058837890625, 0.146484375, 0.047515869140625, 0.0183868408203125, 0.15112304687...
embed
7367361_c1
7367361
lisp
1
UFFI") '(("CLSQL-SYS" "ESCAPED" "UNESCAPED" "COMBINE-DATABASE-IDENTIFIERS" "ESCAPED-DATABASE-IDENTIFIER" "UNESCAPED-DATABASE-IDENTIFIER" "DATABASE-IDENTIFIER" "%SEQUENCE-NAME-TO-TABLE" "%TABLE-NAME-TO-SEQUENCE-NAME")) 'NIL '("MYSQL-DATABASE") '("CLSQL-MYSQL") 'NIL ...) caught ERROR: (during compile-time-too processing)...
UFFI") '(("CLSQL-SYS" "ESCAPED" "UNESCAPED" "COMBINE-DATABASE-IDENTIFIERS" "ESCAPED-DATABASE-IDENTIFIER" "UNESCAPED-DATABASE-IDENTIFIER" "DATABASE-IDENTIFIER" "%SEQUENCE-NAME-TO-TABLE" "%TABLE-NAME-TO-SEQUENCE-NAME")) 'NIL '("MYSQL-DATABASE") '("CLSQL-MYSQL") 'NIL ...) caught ERROR: (during compile-time-too processing)...
[ 0.01251220703125, 0.01165771484375, 0.0062255859375, 0.00201416015625, 0.0023956298828125, 0.023193359375, 0.005859375, 0.002197265625, -0.01043701171875, 0.016845703125, 0.007598876953125, -0.0155029296875, 0.019287109375, -0.0037384033203125, -0.00689697265625, -0.007415771484375, ...
[ 38209, 22724, 18939, 37486, 158897, 9, 294, 26947, 6706, 136629, 17610, 85146, 14495, 120321, 397, 16113, 571, 25585, 49068, 208585, 101868, 102361, 182512, 618, 183057, 7787, 866, 58, 73543, 153, 156892, 151206, 24638, 3020, 9969, 1340, 6032, ...
[ 0.1922607421875, 0.27880859375, 0.04156494140625, 0.190185546875, 0.255615234375, 0.031951904296875, 0.0855712890625, 0.1793212890625, 0.12939453125, 0.25537109375, 0.2349853515625, 0.095703125, 0.1234130859375, 0.1353759765625, 0.0048828125, 0.0032958984375, 0.1298828125, 0.063293...
embed
22154535_c0
22154535
lisp
0
Title: &quot;How to apply Red to compile-time optimization of this Lisp code?&quot; Problem title: &quot;How to apply Red to compile-time optimization of this Lisp code?&quot; Tags: red-lang, lisp, compiler-optimization Problem: "How to apply Red to compile-time optimization of this Lisp code?" This is a pattern of opt...
&quot;How to apply Red to compile-time optimization of this Lisp code?&quot; &quot;How to apply Red to compile-time optimization of this Lisp code?&quot; red-lang lisp compiler-optimization How Red Lisp "How to apply Red to compile-time optimization of this Lisp code?" This is a pattern of optimization in Lisp code tha...
[ -0.004913330078125, 0.00921630859375, -0.002593994140625, 0.0181884765625, -0.0147705078125, 0.0111083984375, -0.01611328125, -0.0025634765625, -0.000919342041015625, -0.0233154296875, -0.0035858154296875, -0.01318359375, 0.01904296875, -0.0054931640625, 0.016357421875, -0.000911712646...
[ 81826, 59911, 6096, 9969, 1340, 6032, 87235, 1363, 903, 1261, 7008, 18151, 47, 4842, 3066, 400, 34759, 100433, 47691, 11249, 103510, 3444, 69307, 36510, 7722, 208124, 46876, 17366, 6044, 5361, 1108, 11322, 31344, 101038 ]
[ 0.06597900390625, 0.1080322265625, 0.2230224609375, 0.1295166015625, 0.0963134765625, 0.12158203125, 0.1727294921875, 0.03839111328125, 0.041534423828125, 0.1409912109375, 0.1822509765625, 0.1536865234375, 0.00140380859375, 0.1583251953125, 0.0965576171875, 0.1112060546875, 0.1001586...
embed
28554572_c0
28554572
lisp
0
Title: LISP: Reversing a List in LISP using RPLACA/RPLACD/NCONC Problem title: LISP: Reversing a List in LISP using RPLACA/RPLACD/NCONC Tags: land-of-lisp, lisp Problem: LISP: Reversing a List in LISP using RPLACA/RPLACD/NCONC So I'm trying to make a function takes in a list and reverses in place it but I'm not sure ho...
LISP: Reversing a List in LISP using RPLACA/RPLACD/NCONC LISP: Reversing a List in LISP using RPLACA/RPLACD/NCONC land-of-lisp lisp RPLACA/RPLACD/NCONC LISP Reversing List RPLACA RPLACD NCONC NONC LISP: Reversing a List in LISP using RPLACA/RPLACD/NCONC So I'm trying to make a function takes in a list and reverses in p...
[ -0.0111083984375, 0.0390625, -0.00018024444580078125, 0.04345703125, -0.001495361328125, 0.0185546875, -0.00189208984375, 0.0142822265625, 0.018798828125, -0.01470947265625, -0.00250244140625, 0.01177978515625, -0.006317138671875, -0.00457763671875, -0.005218505859375, 0.01434326171875...
[ 16970, 9434, 853, 7864, 214, 32036, 23, 17368, 627, 21130, 85955, 1052, 149643, 16069, 839, 77980, 441, 3551, 4390, 4086, 254, 400, 7008, 541, 79325, 31577, 32354, 51776, 5303, 136, 39531, 5908, 3687, 9077, 3642, 4527, 248, 5701, 13580, 1...
[ 0.121826171875, 0.215576171875, 0.086181640625, 0.210693359375, 0.0418701171875, 0.185546875, 0.16552734375, 0.05841064453125, 0.08837890625, 0.1632080078125, 0.2000732421875, 0.04736328125, 0.1334228515625, 0.175537109375, 0.0335693359375, 0.0909423828125, 0.1297607421875, 0.09527...
embed
61300653_c0
61300653
lisp
0
Title: Common Lisp - Function which return an element appears n times in a list Problem title: Common Lisp - Function which return an element appears n times in a list Tags: lisp, common-lisp Problem: Common Lisp - Function which return an element appears n times in a list I'm trying to write a function which return an...
Common Lisp - Function which return an element appears n times in a list Common Lisp - Function which return an element appears n times in a list lisp common-lisp Common Lisp Common Lisp - Function which return an element appears n times in a list I'm trying to write a function which return an element appears n times i...
[ 0.01397705078125, -0.003692626953125, -0.004241943359375, -0.0002040863037109375, 0.01611328125, 0.01263427734375, 0.007049560546875, -0.003692626953125, 0.007171630859375, -0.03857421875, -0.006866455078125, -0.0228271484375, 0.0086669921875, 0.016845703125, -0.0069580078125, 0.011718...
[ 151301, 1261, 7008, 28670, 10763, 3129, 30646, 12830, 135179, 653, 20028, 23, 5303, 400, 39210, 4086, 254, 31577, 33022, 32354, 142, 10, 1884, 3509, 864, 271, 242, 11, 876, 501, 7, 4966, 3229, 2685, 6626, 748, 1286, 5701, 1733, 4734, 51...
[ 0.1842041015625, 0.1719970703125, 0.2115478515625, 0.18115234375, 0.09283447265625, 0.05487060546875, 0.222900390625, 0.205322265625, 0.2000732421875, 0.176513671875, 0.26708984375, 0.0765380859375, 0.2230224609375, 0.1026611328125, 0.125732421875, 0.09283447265625, 0.1259765625, 0...
embed
33947038_c0
33947038
lisp
0
Title: showing a distinct list of specific atoms in a list in lisp Problem title: showing a distinct list of specific atoms in a list in lisp Tags: common-lisp, boolean-expression, lisp Problem: showing a distinct list of specific atoms in a list in lisp I am modeling boolean expressions as lisp lists like this : '(NOT...
showing a distinct list of specific atoms in a list in lisp showing a distinct list of specific atoms in a list in lisp common-lisp boolean-expression lisp Append showing a distinct list of specific atoms in a list in lisp I am modeling boolean expressions as lisp lists like this : '(NOT (AND 0 (OR B C))) I need to wri...
[ 0.00167083740234375, 0.0130615234375, 0.0026702880859375, -0.0084228515625, 0.00299072265625, 0.0174560546875, -0.002532958984375, 0.0145263671875, -0.00136566162109375, -0.00592041015625, -0.00836181640625, -0.0240478515625, 0.029296875, -0.00079345703125, -0.0128173828125, 0.02026367...
[ 141377, 117781, 5303, 29458, 34627, 7, 23, 400, 7008, 39210, 4086, 254, 31, 34677, 204629, 5659, 3611, 3299, 125195, 8575, 618, 45029, 757, 24638, 335, 313, 3871, 33022, 32354, 44116, 77336, 191642, 621, 26818, 40494, 153939, 48762, 33172, ...
[ 0.1407470703125, 0.201904296875, 0.1878662109375, 0.2003173828125, 0.213134765625, 0.04290771484375, 0.066162109375, 0.12548828125, 0.198486328125, 0.06463623046875, 0.1136474609375, 0.1734619140625, 0.061004638671875, 0.1671142578125, 0.162353515625, 0.0386962890625, 0.0339050292968...
embed
79448778_c1
79448778
lisp
1
3}> Wait… what?! Now, back in chapter 9, the book had me make a hash table with (defparameter x (make-hash-table)) and then add an entry to it with (setf (gethash 'yup x) '25) , so that’s why the global value of x is set to a hash table with one entry. But why is SBCL using the global value of x, here, when CLISP uses ...
3}> Wait… what?! Now, back in chapter 9, the book had me make a hash table with (defparameter x (make-hash-table)) and then add an entry to it with (setf (gethash 'yup x) '25) , so that’s why the global value of x is set to a hash table with one entry. But why is SBCL using the global value of x, here, when CLISP uses ...
[ -0.00665283203125, -0.0003108978271484375, -0.006195068359375, 0.00092315673828125, -0.006683349609375, 0, 0.0242919921875, 0.0106201171875, 0.0238037109375, -0.006561279296875, -0.003692626953125, 0.0018463134765625, -0.003936767578125, 0.01483154296875, 0.031494140625, 0.007629394531...
[ 138, 175254, 2367, 4730, 139539, 483, 12877, 1902, 3249, 1556, 127, 23180, 678, 112, 420, 6276, 29089, 1022, 126234, 22819, 15190, 42805, 3509, 3794, 2037, 88942, 15400, 7964, 34292, 5423, 47, 1632, 90944, 37486, 17368, 111, 313, 67616, 683...
[ 0.03631591796875, 0.120849609375, 0.04083251953125, 0.047210693359375, 0.09765625, 0.1363525390625, 0.10162353515625, 0.0438232421875, 0.021575927734375, 0.1668701171875, 0.126220703125, 0.2222900390625, 0.02069091796875, 0.03125, 0.1314697265625, 0.077392578125, 0.1180419921875, 0...
embed
51863448_c0
51863448
lisp
0
Title: Common Lisp - Function that builds, from a list of numbers, the list of more, smaller or equal to a given number Problem title: Common Lisp - Function that builds, from a list of numbers, the list of more, smaller or equal to a given number Tags: common-lisp, function, lisp Problem: Common Lisp - Function that b...
Common Lisp - Function that builds, from a list of numbers, the list of more, smaller or equal to a given number Common Lisp - Function that builds, from a list of numbers, the list of more, smaller or equal to a given number common-lisp function lisp a Common Lisp Common Lisp - Function that builds, from a list of num...
[ -0.018310546875, -0.007293701171875, 0.0228271484375, -0.0009918212890625, -0.003662109375, 0.0087890625, -0.0032958984375, -0.00396728515625, 0.00848388671875, -0.00653076171875, 0.0152587890625, -0.01611328125, 0.000797271728515625, 0.00390625, -0.001434326171875, 0.01214599609375, ...
[ 151301, 1261, 7008, 20, 28670, 10763, 450, 45367, 7, 1295, 5303, 101935, 70, 1286, 164917, 105950, 34475, 14012, 111, 707, 39210, 4086, 254, 32354, 400, 10, 63134, 903, 2806, 1884, 30646, 44157, 100, 6777, 2060, 4966, 13695, 175399, 18025 ]
[ 0.2362060546875, 0.2325439453125, 0.274658203125, 0.0814208984375, 0.19384765625, 0.1220703125, 0.045501708984375, 0.2015380859375, 0.04266357421875, 0.10302734375, 0.18798828125, 0.144775390625, 0.004791259765625, 0.1336669921875, 0.13427734375, 0.100341796875, 0.06658935546875, 0...
embed
46596045_c0
46596045
lisp
0
Title: Check if element is in a tree Problem title: Check if element is in a tree Tags: lisp Problem: Check if element is in a tree I need to write a function in Lisp that checks if an element N is in a tree TREE. (defun TREE-CONTAINS (N TREE) (cond ((equal TREE nil) nil) ((listp (CAR TREE)) (or (TREE-CONTAINS(N (CAR T...
Check if element is in a tree Check if element is in a tree lisp Check TREE-CONTAINS TREE CAR CDR Check if element is in a tree I need to write a function in Lisp that checks if an element N is in a tree TREE. For example, (TREE-CONTAINS (1 ((1 2 3) 4 5))) will return true. But I keep getting an error that says "Undefi...
[ -0.0048828125, 0.015869140625, -0.001708984375, -0.00738525390625, -0.000850677490234375, 0.03369140625, 0.0029144287109375, -0.0224609375, -0.0208740234375, -0.031005859375, -0.0013275146484375, -0.006561279296875, -0.01409912109375, -0.005950927734375, 0.01123046875, 0.00527954101562...
[ 38679, 2174, 12830, 83, 23, 53201, 10, 400, 7008, 93681, 647, 108369, 48026, 42476, 23498, 3871, 33022, 32354, 1261, 12765, 541, 56564, 8439, 201, 190, 30646, 29568, 13695, 18499, 1067, 5983, 35839, 678, 10750, 54753, 3034, 18151, 27781, 29...
[ 0.1458740234375, 0.123779296875, 0.1937255859375, 0.0943603515625, 0.1790771484375, 0.280029296875, 0.044525146484375, 0.10125732421875, 0.194580078125, 0.2088623046875, 0.057373046875, 0.1011962890625, 0.1405029296875, 0.1466064453125, 0.1114501953125, 0.005615234375, 0.046325683593...
embed
3548169_c0
3548169
lisp
0
Title: Equivalent of &#x27;lein swank&#x27; to other Lisp/Scheme implementations with emacs/slime Problem title: Equivalent of &#x27;lein swank&#x27; to other Lisp/Scheme implementations with emacs/slime Tags: clojure, leiningen, lisp, slime, swank Problem: Equivalent of 'lein swank' to other Lisp/Scheme implementation...
Equivalent of &#x27;lein swank&#x27; to other Lisp/Scheme implementations with emacs/slime Equivalent of &#x27;lein swank&#x27; to other Lisp/Scheme implementations with emacs/slime clojure leiningen lisp slime swank Equivalent Lisp Scheme Equivalent of 'lein swank' to other Lisp/Scheme implementations with emacs/slime...
[ -0.00616455078125, 0.028076171875, -0.00909423828125, 0.0001811981201171875, -0.02734375, -0.002471923828125, -0.00054931640625, 0.0026397705078125, 0.020263671875, -0.033935546875, -0.00653076171875, -0.00421142578125, -0.0079345703125, -0.0079345703125, -0.005645751953125, -0.0036926...
[ 145666, 85540, 3768, 38149, 68062, 7570, 3789, 1261, 7008, 25452, 12549, 208124, 352, 2263, 64617, 13, 20450, 461, 4302, 5828, 400, 34264, 34702, 47, 17368, 552, 51053, 107, 14037, 28875, 80234, 37067, 10723, 22691, 183234, 54613, 4527, 594, ...
[ 0.0816650390625, 0.0921630859375, 0.052276611328125, 0.2274169921875, 0.1478271484375, 0.2034912109375, 0.0760498046875, 0.1396484375, 0.1875, 0.0596923828125, 0.090087890625, 0.166748046875, 0.040802001953125, 0.094482421875, 0.1436767578125, 0.1552734375, 0.0986328125, 0.15966796...
embed
79193000_c1
79193000
lisp
1
PL evaluation request. 1: [ABORT] Return to sly-db level 1. 2: [RETRY] Retry SLY mREPL evaluation request. 3: [*ABORT] Return to SLY's top level. 4: [ABORT] abort thread (#<THREAD tid=15104 "sly-channel-1-mrepl-remote-1" RUNNING {1100BC0003}>) Backtrace: 0: (SB-WALKER::GET-WALKER-TEMPLATE (N N) ((N N))) 1: ((LAMBDA NIL...
PL evaluation request. 1: [ABORT] Return to sly-db level 1. 2: [RETRY] Retry SLY mREPL evaluation request. 3: [*ABORT] Return to SLY's top level. 4: [ABORT] abort thread (#<THREAD tid=15104 "sly-channel-1-mrepl-remote-1" RUNNING {1100BC0003}>) Backtrace: 0: (SB-WALKER::GET-WALKER-TEMPLATE (N N) ((N N))) 1: ((LAMBDA NIL...
[ -0.006317138671875, 0.024658203125, -0.00506591796875, -0.01806640625, -0.0211181640625, 0.006256103515625, 0.01544189453125, -0.029541015625, 0.00109100341796875, -0.02685546875, -0.0062255859375, -0.004425048828125, 0.0027313232421875, -0.01556396484375, 0.0260009765625, -0.008666992...
[ 33106, 219836, 50336, 11040, 105259, 173340, 47, 91, 538, 48073, 17366, 615, 41116, 34388, 15123, 159, 19917, 165547, 866, 2663, 27959, 64853, 86997, 2936, 66947, 7, 17032, 8876, 2424, 26973, 5759, 130747, 3559, 363, 26828, 39989, 757, 36474,...
[ 0.1927490234375, 0.2044677734375, 0.1646728515625, 0.06597900390625, 0.1468505859375, 0.09375, 0.0153350830078125, 0.032562255859375, 0.1859130859375, 0.10693359375, 0.1593017578125, 0.019775390625, 0.005157470703125, 0.01031494140625, 0.028778076171875, 0.055908203125, 0.20251464843...
embed
32923276_c1
32923276
lisp
1
suddens of life. Next - using macros to create algorithms independent on data passed to them. This conception makes sense, but does it really need macros? For example most of scripting languages support of passing functions by reference - that means you can create abstract function which will accept data and data-proc...
suddens of life. Next - using macros to create algorithms independent on data passed to them. This conception makes sense, but does it really need macros? For example most of scripting languages support of passing functions by reference - that means you can create abstract function which will accept data and data-proc...
[ -0.01544189453125, 0.01318359375, 0.005126953125, -0.006500244140625, -0.004302978515625, 0.0283203125, 0.01104736328125, 0.00909423828125, -0.02099609375, -0.0142822265625, -0.0167236328125, -0.03955078125, 0.0035247802734375, -0.006378173828125, 0.033447265625, -0.025146484375, 0.0...
[ 8932, 34609, 111, 6897, 4997, 17368, 111789, 7, 28282, 234873, 41371, 98, 2053, 115081, 47, 145520, 10422, 6183, 3871, 2684, 26499, 214, 46876, 8060, 452, 6953, 32354, 91067, 164789, 26946, 63923, 10750, 10846, 44841, 52895, 27875, 16610, 400...
[ 0.131103515625, 0.133056640625, 0.101318359375, 0.147216796875, 0.012298583984375, 0.0867919921875, 0.24365234375, 0.135009765625, 0.0855712890625, 0.246826171875, 0.0999755859375, 0.0267181396484375, 0.1153564453125, 0.1029052734375, 0.005279541015625, 0.070556640625, 0.057678222656...
embed
16019891_c0
16019891
lisp
0
Title: LISP dynamic functions? Problem title: LISP dynamic functions? Tags: common-lisp, lisp Problem: LISP dynamic functions? I'm trying to teach myself some LISP and while I understand most of it, I have trouble grasping the eval function. I know that it does it for us already and that it's not good to use (so I hear...
LISP dynamic functions? LISP dynamic functions? common-lisp lisp LISP Enter Summing LISP dynamic functions? I'm trying to teach myself some LISP and while I understand most of it, I have trouble grasping the eval function. I know that it does it for us already and that it's not good to use (so I hear), but how would I ...
[ -0.002105712890625, 0.01129150390625, 0.0142822265625, 0.011962890625, -0.01513671875, 0.0281982421875, 0.01129150390625, 0.00311279296875, -0.0031890869140625, -0.036376953125, 0.006622314453125, -0.0108642578125, -0.029296875, -0.0032501220703125, 0.015869140625, 0.005889892578125, ...
[ 16970, 9434, 84079, 32354, 7, 39210, 4086, 254, 400, 7008, 60816, 1832, 58838, 31577, 94957, 28219, 63134, 27689, 10366, 28, 1405, 14602, 21771, 959, 4127, 4527, 36802, 3642, 2806, 3249, 1660, 15190, 2060, 81887, 201950, 4358 ]
[ 0.122802734375, 0.223876953125, 0.2147216796875, 0.187255859375, 0.070068359375, 0.0841064453125, 0.06982421875, 0.1263427734375, 0.093505859375, 0.14892578125, 0.1126708984375, 0.149658203125, 0.1495361328125, 0.04205322265625, 0.050537109375, 0.035369873046875, 0.04974365234375, ...
embed
192602_c0
192602
lisp
0
Title: Are there documented, organized collections of libraries for Common Lisp? Problem title: Are there documented, organized collections of libraries for Common Lisp? Tags: common-lisp, documentation-generation, lisp Problem: Are there documented, organized collections of libraries for Common Lisp? I am a college st...
Are there documented, organized collections of libraries for Common Lisp? Are there documented, organized collections of libraries for Common Lisp? common-lisp documentation-generation lisp Common Lisp Are there documented, organized collections of libraries for Common Lisp? I am a college student at a school that teac...
[ 0.0123291015625, 0.02685546875, -0.0037841796875, 0.000293731689453125, -0.013427734375, 0.01123046875, -0.01031494140625, -0.01531982421875, -0.00079345703125, -0.006072998046875, 0.0038909912109375, 0.0072021484375, 0.005157470703125, 0.009033203125, -0.000804901123046875, -0.0255126...
[ 15901, 2685, 12937, 5808, 297, 42486, 7, 35773, 10484, 100, 151301, 1261, 7008, 39210, 4086, 254, 209806, 48281, 400, 111, 40466, 9836, 10696, 94957, 23, 41925, 37515, 26847, 32233, 25225, 21334, 80234, 53702, 1829, 8331, 238, 1294, 14768, ...
[ 0.0170440673828125, 0.07244873046875, 0.2010498046875, 0.2147216796875, 0.05792236328125, 0.216064453125, 0.0821533203125, 0.252685546875, 0.2012939453125, 0.08349609375, 0.2119140625, 0.19140625, 0.2125244140625, 0.1220703125, 0.1300048828125, 0.1204833984375, 0.18798828125, 0.122...
embed
71924967_c0
71924967
lisp
0
Title: How can i create a list just using cons and empty list? Racket Problem title: How can i create a list just using cons and empty list? Racket Tags: scheme, racket, list, lisp Problem: How can i create a list just using cons and empty list? Racket Hi have been asked as to build the following lists,just by using co...
How can i create a list just using cons and empty list? Racket How can i create a list just using cons and empty list? Racket scheme racket list lisp cons How Racket How can i create a list just using cons and empty list? Racket Hi have been asked as to build the following lists,just by using cons and the empty list.I ...
[ -0.004608154296875, 0.0322265625, -0.00860595703125, 0.018310546875, 0.010498046875, 0.0216064453125, -0.028076171875, 0.00153350830078125, -0.00604248046875, -0.035400390625, 0.01080322265625, -0.0498046875, 0.0093994140625, 0.01177978515625, 0.006622314453125, 0.0208740234375, 0.00...
[ 11249, 17, 28282, 5303, 1660, 17368, 158, 7, 136, 201505, 2552, 27853, 831, 150370, 673, 400, 7008, 45367, 25632, 20314, 81887, 37842, 5117, 25553, 138, 201, 93544, 30646, 9620, 674, 18499, 73342, 59911, 56065, 50339 ]
[ 0.0145111083984375, 0.042205810546875, 0.1505126953125, 0.219970703125, 0.04364013671875, 0.07354736328125, 0.2149658203125, 0.093994140625, 0.07501220703125, 0.1695556640625, 0.087646484375, 0.1591796875, 0.021026611328125, 0.1163330078125, 0.072998046875, 0.011199951171875, 0.08276...
embed
5282734_c0
5282734
lisp
0
Title: Besides First Class Functions and Lexical Scoping, what does JavaScript share with Scheme implementations? Problem title: Besides First Class Functions and Lexical Scoping, what does JavaScript share with Scheme implementations? Tags: scheme, lisp, functional-programming, javascript, programming-languages Proble...
Besides First Class Functions and Lexical Scoping, what does JavaScript share with Scheme implementations? Besides First Class Functions and Lexical Scoping, what does JavaScript share with Scheme implementations? scheme lisp functional-programming javascript programming-languages Besides First Functions Lexical Scopin...
[ 0.000732421875, 0.0322265625, -0.00762939453125, -0.00008678436279296875, -0.01806640625, -0.012939453125, -0.00075531005859375, 0.0257568359375, 0.01019287109375, -0.0247802734375, 0.0093994140625, 0.01348876953125, -0.0162353515625, 0.009033203125, -0.0021514892578125, 0.005310058593...
[ 23972, 35014, 28670, 10763, 172522, 6827, 182783, 214, 2367, 17925, 12008, 678, 34702, 282, 208124, 150370, 400, 7008, 123309, 28966, 136951, 56037, 196651, 32195, 15400, 120469, 32491, 13534, 13695, 37397, 47, 64977, 179140, 51517, 5117, 18507, ...
[ 0.09649658203125, 0.15771484375, 0.158935546875, 0.10302734375, 0.1361083984375, 0.1234130859375, 0.1717529296875, 0.079833984375, 0.05157470703125, 0.2939453125, 0.1685791015625, 0.09912109375, 0.2296142578125, 0.2154541015625, 0.1805419921875, 0.2213134765625, 0.0819091796875, 0....
embed
23059908_c0
23059908
lisp
0
Title: Side-effect vs non-destructive in lisp Problem title: Side-effect vs non-destructive in lisp Tags: lisp, haskell Problem: Side-effect vs non-destructive in lisp For example in Mathematica programs to generate a new list for every operation performed on list is dramatically faster than in place manipulations in l...
Side-effect vs non-destructive in lisp Side-effect vs non-destructive in lisp lisp haskell Side-effect Mathematica Haskell Side-effect vs non-destructive in lisp For example in Mathematica programs to generate a new list for every operation performed on list is dramatically faster than in place manipulations in list(sa...
[ 0.0025177001953125, 0.03271484375, 0.00101470947265625, -0.00023937225341796875, -0.012451171875, 0.00830078125, -0.0125732421875, 0.020263671875, 0.00164794921875, -0.000621795654296875, 0.019287109375, -0.0181884765625, 0.01214599609375, -0.01116943359375, 0.005767822265625, 0.005798...
[ 24383, 171760, 20209, 351, 112, 36716, 5844, 400, 7008, 23, 1556, 142508, 123426, 88875, 20625, 103391, 139392, 3525, 5303, 11907, 41018, 51339, 155034, 4271, 3687, 45258, 114689, 36069, 76199, 114977, 87344, 135094, 105233, 1733, 218873, 55681, ...
[ 0.164306640625, 0.271240234375, 0.099609375, 0.1529541015625, 0.063232421875, 0.1707763671875, 0.1055908203125, 0.1431884765625, 0.2186279296875, 0.0215301513671875, 0.1260986328125, 0.260009765625, 0.064453125, 0.164794921875, 0.1270751953125, 0.1226806640625, 0.0977783203125, 0.0...
embed
24370500_c0
24370500
lisp
0
Title: Replace elements in nested quoted lists adds new elements? Problem title: Replace elements in nested quoted lists adds new elements? Tags: lisp, common-lisp Problem: Replace elements in nested quoted lists adds new elements? I have a nested list, and I am trying to non-destructively replace all its elements (ins...
Replace elements in nested quoted lists adds new elements? Replace elements in nested quoted lists adds new elements? lisp common-lisp Replace Replaces Replace elements in nested quoted lists adds new elements? I have a nested list, and I am trying to non-destructively replace all its elements (inside the nested list a...
[ -0.017578125, 0.025390625, 0.0004482269287109375, 0.00244140625, -0.0172119140625, 0.0172119140625, -0.0076904296875, -0.007354736328125, 0.0238037109375, 0.01080322265625, 0.00494384765625, 0.009521484375, 0.000431060791015625, 0.0118408203125, 0.0068359375, 0.0031890869140625, 0.03...
[ 853, 23935, 80854, 23, 8512, 71, 66747, 5303, 15190, 3525, 400, 7008, 39210, 4086, 254, 7, 31577, 351, 36716, 91995, 756, 8752, 107730, 69307, 37842, 25632, 9790, 140992, 2046, 44691 ]
[ 0.068359375, 0.176025390625, 0.1746826171875, 0.040191650390625, 0.1900634765625, 0.108642578125, 0.1571044921875, 0.1671142578125, 0.14990234375, 0.10504150390625, 0.042877197265625, 0.154296875, 0.1246337890625, 0.05615234375, 0.14794921875, 0.0276641845703125, 0.051055908203125, ...
embed
7939129_c0
7939129
lisp
0
Title: Common Lisp: Why does this function cause infinite recursion? Problem title: Common Lisp: Why does this function cause infinite recursion? Tags: lisp, infinite-loop, common-lisp Problem: Common Lisp: Why does this function cause infinite recursion? I am trying to write a function (lnn; list-not-nil) similar to l...
Common Lisp: Why does this function cause infinite recursion? Common Lisp: Why does this function cause infinite recursion? lisp infinite-loop common-lisp Common Lisp Why NIL Common Lisp: Why does this function cause infinite recursion? I am trying to write a function (lnn; list-not-nil) similar to list that only appen...
[ -0.0196533203125, 0.013916015625, 0.0206298828125, -0.015869140625, -0.01171875, 0.01129150390625, 0.01470947265625, -0.0303955078125, 0.006011962890625, -0.021240234375, -0.00408935546875, -0.0029449462890625, 0.005645751953125, 0.0068359375, 0.0208740234375, 0.0113525390625, 0.0383...
[ 151301, 1261, 7008, 44084, 14602, 903, 32354, 22304, 54241, 13, 195625, 1830, 400, 28354, 39210, 4086, 254, 541, 16444, 31577, 33022, 141, 10713, 5303, 10869, 17324, 21373, 4734, 114689, 6468, 142424, 621, 959, 18151, 2060, 31635, 113660, 98,...
[ 0.1705322265625, 0.1563720703125, 0.1793212890625, 0.1708984375, 0.0662841796875, 0.08203125, 0.1805419921875, 0.1678466796875, 0.169921875, 0.087646484375, 0.21435546875, 0.134765625, 0.0914306640625, 0.1644287109375, 0.10443115234375, 0.052398681640625, 0.085693359375, 0.08630371...
embed
44433763_c0
44433763
lisp
0
Title: Emacs: Wrong number of arguments when trying to run an interactive function Problem title: Emacs: Wrong number of arguments when trying to run an interactive function Tags: lisp, emacs, elisp Problem: Emacs: Wrong number of arguments when trying to run an interactive function I am trying to create a command that...
Emacs: Wrong number of arguments when trying to run an interactive function Emacs: Wrong number of arguments when trying to run an interactive function lisp emacs elisp Emacs Wrong C-u C-x TAB M-x Emacs: Wrong number of arguments when trying to run an interactive function I am trying to create a command that will inden...
[ -0.00110626220703125, 0.0032196044921875, 0.00653076171875, -0.012939453125, -0.0177001953125, 0.021240234375, -0.01446533203125, 0.016357421875, 0.00653076171875, -0.022705078125, 0.006256103515625, -0.01165771484375, -0.0098876953125, 0.0186767578125, 0.007110595703125, -0.0071716308...
[ 85269, 4439, 601, 35133, 14012, 10750, 7, 31577, 11675, 212398, 32354, 3229, 400, 7008, 352, 2263, 15296, 313, 9, 34, 425, 131545, 276, 28282, 75101, 1221, 18597, 18, 133291, 10776, 390, 201, 32628, 95307, 7783, 571, 10, 16610, 19774, 495...
[ 0.1927490234375, 0.2108154296875, 0.012969970703125, 0.1641845703125, 0.1480712890625, 0.2578125, 0.08154296875, 0.1358642578125, 0.1033935546875, 0.1993408203125, 0.171630859375, 0.0411376953125, 0.0823974609375, 0.151611328125, 0.0980224609375, 0.1072998046875, 0.046630859375, 0....
embed
29638007_c0
29638007
lisp
0
Title: Indentation of Lisp code Problem title: Indentation of Lisp code Tags: common-lisp, lisp Problem: Indentation of Lisp code I have written some Lisp code, and it works, but I am not sure how to indent it properly. Basically I have a global variable and three functions: (setf my-hand '((3 hearts) (5 clubs) (2 diam...
Indentation of Lisp code Indentation of Lisp code common-lisp lisp Indentation Lisp Indentation of Lisp code I have written some Lisp code, and it works, but I am not sure how to indent it properly. Basically I have a global variable and three functions: I'm fine with the global variable and the functions rank and suit...
[ 0.0037078857421875, 0.00173187255859375, -0.0224609375, 0.006103515625, -0.003997802734375, -0.006988525390625, -0.0022735595703125, -0.01263427734375, 0.00921630859375, -0.025390625, -0.0037078857421875, 0.006683349609375, -0.0247802734375, 0.002044677734375, 0.00555419921875, -0.0002...
[ 360, 555, 22062, 111, 1261, 7008, 18151, 39210, 4086, 254, 400, 59121, 43240, 9077, 3642, 18597, 18, 442, 155965, 7964, 77336, 17262, 32354, 5885, 30648, 60813, 54529, 9, 68879, 137565, 6863, 14361, 48322, 28288, 7108, 5122 ]
[ 0.05615234375, 0.1600341796875, 0.10723876953125, 0.0290069580078125, 0.1455078125, 0.2056884765625, 0.192138671875, 0.0771484375, 0.104248046875, 0.1319580078125, 0.118408203125, 0.059295654296875, 0.043060302734375, 0.03814697265625, 0.02130126953125, 0.201171875, 0.147705078125, ...
embed
6955544_c0
6955544
lisp
0
Title: How to overcome the lack of local variable for emacs lisp closure Problem title: How to overcome the lack of local variable for emacs lisp closure Tags: dynamic-scope, common-lisp, lisp, elisp, emacs Problem: How to overcome the lack of local variable for emacs lisp closure I'm now studying Emacs Lisp from the r...
How to overcome the lack of local variable for emacs lisp closure How to overcome the lack of local variable for emacs lisp closure dynamic-scope common-lisp lisp elisp emacs How How to overcome the lack of local variable for emacs lisp closure I'm now studying Emacs Lisp from the reference manual and Common Lisp from ...
[ 0.0189208984375, 0.0205078125, -0.007568359375, 0.00726318359375, 0.0008392333984375, 0.01409912109375, -0.0228271484375, 0.029052734375, 0.0019378662109375, -0.048095703125, -0.01275634765625, 0.01409912109375, -0.0036468505859375, 0.0208740234375, 0.034912109375, 0.007781982421875, ...
[ 11249, 645, 45738, 92635, 111, 4000, 77336, 352, 2263, 7, 400, 7008, 170224, 84079, 70820, 39210, 4086, 254, 15296, 85269, 4439, 1261, 91067, 23009, 151301, 16970, 9434, 27432, 12877, 32354, 23742, 18, 4488, 23, 128239, 123166, 7722, 29479, ...
[ 0.0543212890625, 0.1282958984375, 0.1683349609375, 0.2005615234375, 0.02935791015625, 0.16748046875, 0.28076171875, 0.09234619140625, 0.136962890625, 0.060546875, 0.146484375, 0.198486328125, 0.2073974609375, 0.1668701171875, 0.139892578125, 0.06439208984375, 0.0689697265625, 0.084...
embed
3146771_c0
3146771
lisp
0
Title: Building Lisp/Scheme-like parse tree with flex/bison Problem title: Building Lisp/Scheme-like parse tree with flex/bison Tags: bison, flex-lexer, lisp, parsing, s-expression Problem: Building Lisp/Scheme-like parse tree with flex/bison I was trying to parse simple Lisp/scheme-like code E.g. (func a (b c d) ) and...
Building Lisp/Scheme-like parse tree with flex/bison Building Lisp/Scheme-like parse tree with flex/bison bison flex-lexer lisp parsing s-expression Building Lisp Scheme-like E.g Building Lisp/Scheme-like parse tree with flex/bison I was trying to parse simple Lisp/scheme-like code and build a tree from it, I could do ...
[ 0.0087890625, 0.0419921875, -0.03564453125, 0.01513671875, -0.036376953125, 0.0189208984375, -0.011474609375, -0.00102996826171875, -0.01287841796875, -0.00628662109375, 0.01434326171875, -0.0035400390625, -0.0133056640625, 0.0003509521484375, 0.0025634765625, 0.00113677978515625, -0...
[ 104919, 1261, 7008, 25452, 12549, 5062, 366, 184, 53201, 678, 44289, 6454, 191, 2464, 74070, 56, 400, 91, 204629, 34702, 282, 8781, 7560, 18151, 45367, 1295, 6953, 23, 313, 15490, 30646, 47, 84694, 33976, 195625, 122092, 147, 7440, 15190, ...
[ 0.12255859375, 0.149658203125, 0.1961669921875, 0.096923828125, 0.114990234375, 0.11962890625, 0.126220703125, 0.050445556640625, 0.1943359375, 0.001129150390625, 0.2147216796875, 0.1097412109375, 0.13720703125, 0.107666015625, 0.10382080078125, 0.1270751953125, 0.121826171875, 0.0...
embed
43437752_c0
43437752
lisp
0
Title: Concatenate List of Characters Recursively in Common LISP Problem title: Concatenate List of Characters Recursively in Common LISP Tags: lisp, encryption, concatenation, common-lisp, recursion Problem: Concatenate List of Characters Recursively in Common LISP So I'm attempting to implement a Caesar cipher in LIS...
Concatenate List of Characters Recursively in Common LISP Concatenate List of Characters Recursively in Common LISP lisp encryption concatenation common-lisp recursion Concatenate List Characters Recursively Common LISP Concatenate List of Characters Recursively in Common LISP So I'm attempting to implement a Caesar ci...
[ 0.00701904296875, -0.00531005859375, -0.0022125244140625, 0.01019287109375, -0.00787353515625, -0.005523681640625, 0.019775390625, 0.002410888671875, 0.003326416015625, -0.00927734375, 0.0084228515625, -0.021240234375, -0.01104736328125, 0.01123046875, -0.01287841796875, -0.00527954101...
[ 1657, 33478, 76, 67, 32036, 21656, 2263, 23962, 48650, 5844, 151301, 16970, 9434, 400, 7008, 136791, 158, 4460, 33, 39210, 4086, 254, 195625, 81887, 29479, 64914, 1059, 94266, 62822, 123309, 20697, 2967, 30646, 5303, 124850, 159029, 91693, 98...
[ 0.050537109375, 0.17822265625, 0.125, 0.0919189453125, 0.1578369140625, 0.05694580078125, 0.09197998046875, 0.027099609375, 0.12158203125, 0.0855712890625, 0.10345458984375, 0.1141357421875, 0.20654296875, 0.0972900390625, 0.152587890625, 0.1656494140625, 0.076416015625, 0.13793945...
embed
56039686_c0
56039686
lisp
0
Title: What is the rule for nested quasiquote processing in Clojure? Problem title: What is the rule for nested quasiquote processing in Clojure? Tags: lisp, clojure, macros, quasiquotes Problem: What is the rule for nested quasiquote processing in Clojure? What is nested quasiquote processing rule in Clojure? I am wri...
What is the rule for nested quasiquote processing in Clojure? What is the rule for nested quasiquote processing in Clojure? lisp clojure macros quasiquotes What Clojure What is the rule for nested quasiquote processing in Clojure? What is nested quasiquote processing rule in Clojure? I am writing a Lisp variant where s...
[ -0.008056640625, 0.029296875, -0.0047607421875, 0.0230712890625, -0.0087890625, 0.026611328125, 0.0087890625, -0.01287841796875, -0.0020904541015625, 0.0179443359375, 0.0015106201171875, -0.02587890625, 0.004486083984375, 0.0081787109375, -0.0120849609375, 0.00177764892578125, 0.0046...
[ 79986, 8512, 71, 12404, 68726, 9433, 214, 51053, 461, 107, 400, 7008, 20450, 111789, 70, 100, 32562, 1261, 20117, 26582, 99824, 8913, 29038, 53, 4806, 11001, 17366, 1809, 4650, 4909, 1916, 23, 1771, 4537, 71062 ]
[ 0.1759033203125, 0.2215576171875, 0.1124267578125, 0.2061767578125, 0.236083984375, 0.11767578125, 0.0277252197265625, 0.1312255859375, 0.169677734375, 0.1517333984375, 0.06292724609375, 0.1646728515625, 0.114990234375, 0.1123046875, 0.020782470703125, 0.002960205078125, 0.0491943359...
embed
661490_c0
661490
lisp
0
Title: elisp functions as parameters and as return value Problem title: elisp functions as parameters and as return value Tags: elisp, lisp Problem: elisp functions as parameters and as return value I have the following code (defun avg-damp(f) #'(lambda(x) (/ (+ (funcall f x) x) 2.0))) A call (funcall (avg-damp #'(lamb...
elisp functions as parameters and as return value elisp functions as parameters and as return value elisp lisp Debugger eval-last-sexp-1 elisp functions as parameters and as return value I have the following code A call returns 55.0 (the correct value) in SBCL but crashes with the following stack in emacs lisp How can ...
[ -0.0086669921875, 0.010986328125, 0.00982666015625, -0.006622314453125, -0.00872802734375, 0.0279541015625, 0.0028076171875, 0.00347900390625, -0.007415771484375, -0.03662109375, 0.006256103515625, -0.0001220703125, -0.01092529296875, 0.009765625, 0.0068359375, -0.0128173828125, -0.0...
[ 15296, 7008, 32354, 237, 171859, 136, 30646, 34292, 400, 262, 978, 21407, 28, 1405, 19777, 83613, 5759, 25632, 18151, 11782, 190, 187461, 26785, 90944, 37486, 1284, 150631, 678, 177261, 352, 2263, 7, 3249, 4488, 85269, 4439 ]
[ 0.1505126953125, 0.26708984375, 0.2010498046875, 0.08551025390625, 0.23193359375, 0.07806396484375, 0.22314453125, 0.1431884765625, 0.11993408203125, 0.097900390625, 0.14892578125, 0.11846923828125, 0.04132080078125, 0.189208984375, 0.1544189453125, 0.2022705078125, 0.07452392578125,...
embed
23408016_c0
23408016
lisp
0
Title: Interchangeable Conditionals Problem title: Interchangeable Conditionals Tags: lisp, common-lisp Problem: Interchangeable Conditionals Today i am reading the book "A Gentle Introduction to Symbolic Computation", and i got to the exercise 4.29. Here how it sounds like: "Write versions of LOGICAL-AND using IF and ...
Interchangeable Conditionals Interchangeable Conditionals lisp common-lisp Interchangeable Conditionals Interchangeable Conditionals Today i am reading the book "A Gentle Introduction to Symbolic Computation", and i got to the exercise 4.29. Here how it sounds like: "Write versions of LOGICAL-AND using IF and COND inst...
[ -0.00058746337890625, 0.003448486328125, 0.00677490234375, 0.041748046875, 0.0096435546875, -0.0019683837890625, -0.012451171875, 0.001373291015625, -0.01080322265625, -0.00909423828125, -0.018798828125, 0.00848388671875, -0.006072998046875, 0.01251220703125, 0.01953125, 0.016357421875...
[ 5337, 152028, 2886, 46347, 43315, 400, 7008, 39210, 4086, 254, 16454, 131899, 159415, 81979, 1398, 4235, 442, 102678, 1456, 18781, 11389, 22215, 18027, 141029, 9, 45029, 17368, 55449, 136, 14452, 397, 64457, 48762, 61924, 7986, 678, 158, 71, ...
[ 0.07574462890625, 0.1990966796875, 0.123046875, 0.22509765625, 0.16748046875, 0.1068115234375, 0.155517578125, 0.1351318359375, 0.0955810546875, 0.177734375, 0.01605224609375, 0.0823974609375, 0.07244873046875, 0.10107421875, 0.005950927734375, 0.103271484375, 0.040191650390625, 0....
embed
56744443_c0
56744443
lisp
0
Title: What is the name of mathematical object similar to a graph, but with different kind of edges? Problem title: What is the name of mathematical object similar to a graph, but with different kind of edges? Tags: s-expression, racket, lisp, graph-theory, discrete-mathematics Problem: What is the name of mathematical...
What is the name of mathematical object similar to a graph, but with different kind of edges? What is the name of mathematical object similar to a graph, but with different kind of edges? s-expression racket lisp graph-theory discrete-mathematics What What is the name of mathematical object similar to a graph, but with...
[ -0.0025177001953125, 0.01708984375, -0.0157470703125, 0.01141357421875, 0.002349853515625, 0.021240234375, -0.02392578125, 0.029296875, -0.002685546875, -0.01446533203125, 0.0084228515625, -0.025390625, -0.003448486328125, -0.004180908203125, 0.015380859375, 0.02001953125, -0.0054626...
[ 9351, 111, 291, 140363, 70760, 36746, 21373, 47, 41382, 1284, 678, 12921, 8562, 121303, 7, 91, 204629, 673, 27853, 400, 7008, 2347, 30675, 81604, 13, 10, 3299, 3530, 34610, 33120, 38750, 17368, 2552, 125296, 4527, 24233, 66211, 3332, 195, ...
[ 0.1441650390625, 0.040679931640625, 0.071044921875, 0.1622314453125, 0.158447265625, 0.233154296875, 0.189453125, 0.076416015625, 0.255615234375, 0.1103515625, 0.100341796875, 0.181396484375, 0.150634765625, 0.2391357421875, 0.043701171875, 0.1240234375, 0.22900390625, 0.0693969726...
embed
19419518_c0
19419518
lisp
0
Title: Might this permanently and accidentally overwrite the compiler&#x27;s own functionality? Problem title: Might this permanently and accidentally overwrite the compiler&#x27;s own functionality? Tags: common-lisp, ccl, lisp Problem: Might this permanently and accidentally overwrite the compiler's own functionality...
Might this permanently and accidentally overwrite the compiler&#x27;s own functionality? Might this permanently and accidentally overwrite the compiler&#x27;s own functionality? common-lisp ccl lisp Might MAKE-LIST Clozure Condition SIMPLE-ERROR Restarts CONTINUE Replace Might this permanently and accidentally overwrit...
[ 0.01007080078125, 0.0185546875, -0.0036468505859375, 0.0101318359375, 0.00193023681640625, 0.003387451171875, 0.0052490234375, 0.004302978515625, 0.0201416015625, -0.0211181640625, -0.01611328125, -0.002105712890625, 0.020263671875, 0.015869140625, 0.0390625, -0.000797271728515625, -...
[ 22553, 903, 28123, 136, 27998, 645, 434, 18781, 9969, 34759, 3768, 10002, 123309, 2481, 39210, 4086, 254, 34937, 400, 7008, 43711, 647, 195977, 51053, 1667, 107, 46347, 40288, 103084, 14255, 49756, 67987, 54390, 37066, 23935, 32562, 32354, 35...
[ 0.153076171875, 0.135986328125, 0.1729736328125, 0.054351806640625, 0.176513671875, 0.09307861328125, 0.12939453125, 0.08575439453125, 0.1553955078125, 0.1943359375, 0.03216552734375, 0.13818359375, 0.169677734375, 0.04779052734375, 0.08551025390625, 0.037841796875, 0.13037109375, ...
embed
12591432_c0
12591432
lisp
0
Title: Dribble is producing empty output files Problem title: Dribble is producing empty output files Tags: lisp, common-lisp, clisp Problem: Dribble is producing empty output files I need to create an output file for a program in lisp, but I cannot get dribble to properly record my output. I'm using lispbox and my buf...
Dribble is producing empty output files Dribble is producing empty output files lisp common-lisp clisp Dribble output.txt Calls NIL Dribble is producing empty output files I need to create an output file for a program in lisp, but I cannot get dribble to properly record my output. I'm using lispbox and my buffer looks ...
[ 0.00750732421875, -0.0028533935546875, -0.00457763671875, 0.00921630859375, -0.041748046875, 0.03271484375, 0.0166015625, -0.011962890625, -0.0155029296875, 0.0269775390625, -0.0034637451171875, 0.007415771484375, -0.0191650390625, -0.003997802734375, 0.006439208984375, -0.008728027343...
[ 1773, 14, 73163, 27024, 201505, 140992, 102158, 400, 7008, 39210, 4086, 254, 95701, 124326, 26265, 541, 16444, 83, 214, 3871, 28282, 11435, 1528, 53418, 2046, 82332, 155965, 17164, 11728, 373, 18234, 33342, 1884, 9790, 765, 757, 390, 1636, ...
[ 0.128173828125, 0.1494140625, 0.269287109375, 0.1439208984375, 0.2091064453125, 0.19287109375, 0.1553955078125, 0.0948486328125, 0.170166015625, 0.08050537109375, 0.051727294921875, 0.0946044921875, 0.030517578125, 0.1953125, 0.152099609375, 0.037353515625, 0.098388671875, 0.003326...
embed
37252052_c0
37252052
lisp
0
Title: Display value of a global variable in a message Problem title: Display value of a global variable in a message Tags: lisp, common-lisp Problem: Display value of a global variable in a message I am having what I believe to be a syntax issue in Common Lisp. I have a global variable, *LOC* , I can set its initial v...
Display value of a global variable in a message Display value of a global variable in a message lisp common-lisp Display LOC UPSTAIRSP UPSTAIRS DOWNSTAIRS Display value of a global variable in a message I am having what I believe to be a syntax issue in Common Lisp. I have a global variable, *LOC* , I can set its initi...
[ -0.0033416748046875, 0.0177001953125, -0.013916015625, 0.012939453125, 0.033935546875, 0.0181884765625, 0.003509521484375, 0.01470947265625, 0.01171875, -0.005157470703125, 0.0162353515625, -0.0009002685546875, -0.0067138671875, -0.02099609375, 0.020263671875, 0.02734375, 0, -0.008...
[ 90045, 34292, 111, 7964, 77336, 23, 26008, 400, 7008, 39210, 4086, 254, 124448, 27560, 22565, 14688, 9434, 127623, 90259, 15396, 6197, 108049, 19441, 18822, 6002, 86531, 31089, 151301, 1261, 765, 1639, 831, 5423, 61475, 15549, 43240, 5885, 97...
[ 0.2015380859375, 0.2100830078125, 0.047119140625, 0.171142578125, 0.26171875, 0.06329345703125, 0.180908203125, 0.0987548828125, 0.2049560546875, 0.103515625, 0.07318115234375, 0.1259765625, 0.2127685546875, 0.07861328125, 0.1044921875, 0.08795166015625, 0.09375, 0.109375, 0.2049...
embed
78657486_c0
78657486
lisp
0
Title: Interlisp Medley: LITATOM &#x27;streams&#x27; no longer supported Problem title: Interlisp Medley: LITATOM &#x27;streams&#x27; no longer supported Tags: interlisp, io, iostream, lisp Problem: Interlisp Medley: LITATOM 'streams' no longer supported I am trying to print string text to file in interlisp medley. Her...
Interlisp Medley: LITATOM &#x27;streams&#x27; no longer supported Interlisp Medley: LITATOM &#x27;streams&#x27; no longer supported interlisp io iostream lisp Interlisp Medley LITATOM OUTPUT SETQ OUT OPENSTREAM output.TEDIT PRIN1 OPENFILE Interlisp Medley: LITATOM 'streams' no longer supported I am trying to print stri...
[ 0.004150390625, 0.0238037109375, -0.0047607421875, 0.0157470703125, 0.0028076171875, 0.00567626953125, -0.0016632080078125, 0.00537109375, -0.0140380859375, 0.00738525390625, 0.030029296875, -0.0107421875, 0.016845703125, -0.0107421875, 0.020751953125, 0.004241943359375, -0.002059936...
[ 5337, 4086, 254, 2888, 4293, 339, 19430, 117032, 3768, 86429, 110, 51713, 8060, 1940, 22995, 400, 7008, 52001, 128565, 2737, 28023, 56564, 140992, 66458, 6371, 29852, 65441, 919, 297, 31577, 28412, 79315, 7986, 11435, 23, 128, 18151, 6056, ...
[ 0.1656494140625, 0.1539306640625, 0.18017578125, 0.16064453125, 0.216552734375, 0.0888671875, 0.10284423828125, 0.2120361328125, 0.0292205810546875, 0.1961669921875, 0.04388427734375, 0.120361328125, 0.2041015625, 0.153564453125, 0.08905029296875, 0.064453125, 0.1204833984375, 0.04...
embed
2348884_c0
2348884
lisp
0
Title: Suggestions for algorithmic analysis of Lisp programs? Problem title: Suggestions for algorithmic analysis of Lisp programs? Tags: algorithm, common-lisp, lisp Problem: Suggestions for algorithmic analysis of Lisp programs? Which operations in Common Lisp programs are to be considered sufficiently primitive so a...
Suggestions for algorithmic analysis of Lisp programs? Suggestions for algorithmic analysis of Lisp programs? algorithm common-lisp lisp Suggestions Lisp Suggestions for algorithmic analysis of Lisp programs? Which operations in Common Lisp programs are to be considered sufficiently primitive so as to count for a singl...
[ -0.01507568359375, 0.0235595703125, 0.0091552734375, 0.00531005859375, -0.004180908203125, 0.01373291015625, 0.007171630859375, -0.01153564453125, 0.000492095947265625, -0.03271484375, -0.007476806640625, 0.01031494140625, -0.021728515625, 0.002960205078125, -0.009765625, -0.0125732421...
[ 104235, 141933, 100, 234873, 1771, 114137, 1261, 7008, 103391, 7, 39210, 4086, 254, 400, 41018, 151301, 90698, 129980, 128489, 13, 54529, 11001, 95528, 38134, 5744, 6423, 285, 53, 208124, 8962, 282, 9523, 678, 19336, 892, 26255, 2806, 29954, ...
[ 0.095703125, 0.1612548828125, 0.03839111328125, 0.24169921875, 0.1123046875, 0.1988525390625, 0.194091796875, 0.2489013671875, 0.1788330078125, 0.13427734375, 0.1341552734375, 0.17919921875, 0.192138671875, 0.1634521484375, 0.176025390625, 0.1585693359375, 0.06268310546875, 0.10668...
embed
77048584_c1
77048584
lisp
1
return #t , but eval-or requires apostrophes on the call site: (or (begin (display "1") (= 5 5)) (begin (display "2") (= 5 6))) (define eval-or (lambda (a b) (if (eval a) #t (eval b)))) (eval-or '(begin (display "1") (= 5 5)) '(begin (display "2") (= 5 6))) I am not acquainted with the niceties of eval , but I do know...
return #t , but eval-or requires apostrophes on the call site: (or (begin (display "1") (= 5 5)) (begin (display "2") (= 5 6))) (define eval-or (lambda (a b) (if (eval a) #t (eval b)))) (eval-or '(begin (display "1") (= 5 5)) '(begin (display "2") (= 5 6))) I am not acquainted with the niceties of eval , but I do know...
[ -0.0030059814453125, 0.02880859375, 0.010498046875, -0.005035400390625, -0.00616455078125, 0.0017852783203125, 0.0159912109375, 0.006683349609375, -0.0137939453125, -0.01416015625, -0.00823974609375, 0.01611328125, -0.0157470703125, -0.0048828125, 0.000583648681640625, -0.0054321289062...
[ 30646, 468, 18, 1284, 28, 1405, 748, 144570, 6885, 6639, 20133, 7, 11782, 1764, 6820, 20706, 190, 21162, 304, 305, 64552, 6492, 85, 876, 3190, 13, 10, 80126, 54639, 26267, 2449, 86687, 75675, 21533, 70820, 95134, 49814, 5361, 64549, 34702...
[ 0.1832275390625, 0.0782470703125, 0.12255859375, 0.01666259765625, 0.07879638671875, 0.321044921875, 0.223388671875, 0.1656494140625, 0.0633544921875, 0.15966796875, 0.178466796875, 0.043853759765625, 0.190185546875, 0.1090087890625, 0.0780029296875, 0.0670166015625, 0.0484619140625,...
embed
42183275_c0
42183275
lisp
0
Title: Error: Lambda list with dots are only allowed in macros, not here : LIST? Problem title: Error: Lambda list with dots are only allowed in macros, not here : LIST? Tags: clisp, common-lisp, lisp Problem: Error: Lambda list with dots are only allowed in macros, not here : LIST? I am writing a function called flatt...
Error: Lambda list with dots are only allowed in macros, not here : LIST? Error: Lambda list with dots are only allowed in macros, not here : LIST? clisp common-lisp lisp Error Lambda LIST Error: Lambda list with dots are only allowed in macros, not here : LIST? I am writing a function called flatten that is supposed t...
[ -0.0019989013671875, 0.02490234375, 0.00262451171875, 0.002471923828125, -0.00274658203125, 0.012451171875, 0.00188446044921875, 0.0047607421875, -0.0089111328125, 0.0045166015625, -0.012939453125, -0.0242919921875, -0.00811767578125, -0.013916015625, 0.0002994537353515625, 0.005035400...
[ 212059, 122930, 85, 5303, 678, 54, 933, 4734, 107003, 23, 111789, 7, 959, 3688, 195977, 95701, 7008, 39210, 4086, 254, 400, 32562, 32354, 49878, 510, 5646, 55720, 30646, 112892, 11389, 9790, 71924, 18499, 2729, 6492, 621, 157666, 166996, 31...
[ 0.178955078125, 0.2081298828125, 0.1878662109375, 0.2396240234375, 0.125, 0.2236328125, 0.184326171875, 0.11376953125, 0.189208984375, 0.09808349609375, 0.1832275390625, 0.0076904296875, 0.1351318359375, 0.185546875, 0.23193359375, 0.053985595703125, 0.160888671875, 0.08740234375, ...
embed
1626567_c0
1626567
lisp
0
Title: Common Lisp: Beginner&#x27;s trouble with funcall Problem title: Common Lisp: Beginner&#x27;s trouble with funcall Tags: lisp, common-lisp Problem: Common Lisp: Beginner's trouble with funcall I'm trying to pass a function as an argument and call that function within another function. A piece of my code looks li...
Common Lisp: Beginner&#x27;s trouble with funcall Common Lisp: Beginner&#x27;s trouble with funcall lisp common-lisp Common Lisp Beginner Common Lisp: Beginner's trouble with funcall I'm trying to pass a function as an argument and call that function within another function. A piece of my code looks like this: strategy...
[ 0.0037689208984375, 0.00189971923828125, 0.013671875, 0.01422119140625, 0.003082275390625, 0.002593994140625, 0.01007080078125, -0.0093994140625, -0.01080322265625, -0.0257568359375, 0.0036468505859375, 0.02783203125, -0.017822265625, 0.0166015625, 0.0064697265625, 0.000056982040405273...
[ 151301, 1261, 7008, 67053, 56, 3768, 63134, 678, 7477, 85763, 400, 39210, 4086, 254, 31577, 27875, 32354, 237, 10750, 11782, 28032, 15700, 18151, 33342, 113857, 115081, 26582, 33636, 6626, 157955, 5303, 46258, 39, 151895, 3432, 13695, 18499, ...
[ 0.135009765625, 0.1326904296875, 0.164794921875, 0.074951171875, 0.03338623046875, 0.0533447265625, 0.1607666015625, 0.016082763671875, 0.1304931640625, 0.250244140625, 0.07464599609375, 0.0838623046875, 0.06488037109375, 0.0718994140625, 0.07293701171875, 0.13671875, 0.173095703125,...
embed
60163122_c0
60163122
lisp
0
Title: Creating a Lisp alias with defalias or new function? Problem title: Creating a Lisp alias with defalias or new function? Tags: elisp, lisp, function, alias Problem: Creating a Lisp alias with defalias or new function? I want mylist to have the same functionality as list . In most Lisps (I'm on Emacs Lisp) I can ...
Creating a Lisp alias with defalias or new function? Creating a Lisp alias with defalias or new function? elisp lisp function alias Creating Lisp Creating a Lisp alias with defalias or new function? I want mylist to have the same functionality as list . In most Lisps (I'm on Emacs Lisp) I can simply write But if I want...
[ -0.00022029876708984375, 0.0184326171875, 0.000621795654296875, 0.00138092041015625, 0.002197265625, 0.02001953125, -0.000720977783203125, 0.0240478515625, -0.0078125, -0.001678466796875, 0.0019378662109375, 0.0001125335693359375, 0.00064849853515625, 0.01312255859375, -0.001144409179687...
[ 56781, 1916, 1261, 7008, 55109, 678, 8, 8710, 16378, 3525, 32354, 10, 15296, 400, 3444, 759, 6562, 5701, 123309, 237, 5303, 7, 6423, 85269, 4439, 831, 42856, 33022, 10002, 28007, 18151, 181653, 23, 15400, 8781, 29806, 1022, 46132, 2258, 1...
[ 0.145263671875, 0.03326416015625, 0.1920166015625, 0.2384033203125, 0.254638671875, 0.058837890625, 0.1585693359375, 0.1541748046875, 0.1788330078125, 0.05389404296875, 0.18359375, 0.015350341796875, 0.1007080078125, 0.170166015625, 0.06365966796875, 0.1474609375, 0.25537109375, 0....
embed
60356211_c2
60356211
lisp
2
2: sum(((q^3*subst([x=(q*%pi*Φ)],Χ))/(((i1/2)^2+Φ^2*q^2)^2))*Λ2, q, 1, j)$; Ζ4: sum(((q^3*subst([x=(q*%pi*Φ)],Χ))/(((i1/2)^2+Φ^2*q^2)^2))*Λ4, q, 1, j)$; a0: float(1/(b/2)*integrate(0, y, -(b/2), -h1/2)+1/b*integrate(sig, y, -h1/2, h1/2)+1/(b/2)*integrate(0, y, h1/2, (b/2)))$; aq: float(1/(b/2)*integrate(0*cos(q*y*%pi/(...
2: sum(((q^3*subst([x=(q*%pi*Φ)],Χ))/(((i1/2)^2+Φ^2*q^2)^2))*Λ2, q, 1, j)$; Ζ4: sum(((q^3*subst([x=(q*%pi*Φ)],Χ))/(((i1/2)^2+Φ^2*q^2)^2))*Λ4, q, 1, j)$; a0: float(1/(b/2)*integrate(0, y, -(b/2), -h1/2)+1/b*integrate(sig, y, -h1/2, h1/2)+1/(b/2)*integrate(0, y, h1/2, (b/2)))$; aq: float(1/(b/2)*integrate(0*cos(q*y*%pi/(...
[ -0.0213623046875, -0.0184326171875, -0.01043701171875, -0.00341796875, -0.007720947265625, -0.0103759765625, 0.0081787109375, 0.01336669921875, 0.0272216796875, 0.005584716796875, -0.0086669921875, -0.001678466796875, 0.00162506103515625, -0.044677734375, -0.0166015625, 0.006103515625,...
[ 15573, 10554, 128258, 864, 8353, 363, 1639, 196842, 425, 1369, 1434, 33393, 16, 268, 18137, 64, 14, 118551, 304, 1328, 10461, 30072, 8096, 106, 1647, 74, 23496, 617, 12, 132, 10, 2389, 21917, 257, 41600, 275, 12477, 100743, 67, 4, 113, ...
[ 0.234619140625, 0.278076171875, 0.05902099609375, 0.2005615234375, 0.0938720703125, 0.1861572265625, 0.0279083251953125, 0.2039794921875, 0.126220703125, 0.0287322998046875, 0.196044921875, 0.1304931640625, 0.0271759033203125, 0.0277862548828125, 0.1285400390625, 0.027587890625, 0.03...
embed
35904366_c1
35904366
lisp
1
current 1))) (setf current (- current 1)))) (setf unsorted (+ unsorted 1)))) (printlist)) (defun swap (from to) (setf tmpmake (get (nth to exotic-cars) 'make)) (setf tmpmodel (get (nth to exotic-cars) 'model)) (setf tmpcost (get (nth to exotic-cars) 'cost)) (setf (get (nth to exotic-cars) 'make) (get (nth from exotic-...
current 1))) (setf current (- current 1)))) (setf unsorted (+ unsorted 1)))) (printlist)) (defun swap (from to) (setf tmpmake (get (nth to exotic-cars) 'make)) (setf tmpmodel (get (nth to exotic-cars) 'model)) (setf tmpcost (get (nth to exotic-cars) 'cost)) (setf (get (nth to exotic-cars) 'make) (get (nth from exotic-...
[ -0.007080078125, 0.01806640625, 0.00469970703125, -0.0185546875, -0.00141143798828125, 0.00118255615234375, 0.0020904541015625, 0.0022430419921875, 0.007659912109375, 0.00070953369140625, -0.01904296875, 0.01470947265625, -0.003692626953125, -0.0022125244140625, -0.0186767578125, -0.02...
[ 43581, 106, 32149, 3509, 420, 9, 80126, 51, 62351, 297, 22183, 35662, 6562, 112, 16498, 202317, 161063, 47, 808, 2676, 55898, 3794, 927, 188768, 3284, 51734, 587, 271, 1295, 1140, 21493, 28864, 26073, 12, 125195, 27, 124409, 159, 183300, ...
[ 0.262939453125, 0.0677490234375, 0.142333984375, 0.1722412109375, 0.1856689453125, 0.1162109375, 0.118408203125, 0.06573486328125, 0.2052001953125, 0.1080322265625, 0.1253662109375, 0.1201171875, 0.2034912109375, 0.1051025390625, 0.157958984375, 0.2264404296875, 0.128662109375, 0.2...
embed
77894461_c0
77894461
lisp
0
Title: lisp macro expansion: not of type LIST error Problem title: lisp macro expansion: not of type LIST error Tags: macros, list, common-lisp, lisp Problem: lisp macro expansion: not of type LIST error I have a macro that reads a file that's formatted like this: (H2O 50) (O2 50) ... macro looks like this: (defmacro r...
lisp macro expansion: not of type LIST error lisp macro expansion: not of type LIST error macros list common-lisp lisp LIST syminput_0.txt H2O USEDMOLLIST lisp macro expansion: not of type LIST error I have a macro that reads a file that's formatted like this: (H2O 50) (O2 50) ... macro looks like this: When I run comm...
[ 0.018310546875, 0.0035552978515625, -0.000759124755859375, 0.01446533203125, -0.006256103515625, 0.033447265625, 0.01116943359375, 0.0166015625, 0.0096435546875, 0.0135498046875, 0.0004520416259765625, -0.032470703125, 0.01806640625, -0.028564453125, -0.005706787109375, -0.006561279296...
[ 400, 7008, 111789, 14700, 66, 6889, 959, 111, 10644, 195977, 18499, 5303, 39210, 4086, 254, 954, 1249, 7077, 2389, 124326, 572, 304, 670, 78441, 122080, 35602, 12301, 11435, 9384, 1884, 841, 836, 33342, 903, 11675, 75101, 60075, 24762, 214 ...
[ 0.131591796875, 0.2095947265625, 0.211181640625, 0.0843505859375, 0.1409912109375, 0.039154052734375, 0.14111328125, 0.1016845703125, 0.1573486328125, 0.2235107421875, 0.208984375, 0.084228515625, 0.0782470703125, 0.1070556640625, 0.166748046875, 0.036712646484375, 0.053070068359375,...
embed
70968625_c0
70968625
lisp
0
Title: Unable to use function passed in as parameter? Problem title: Unable to use function passed in as parameter? Tags: lisp, common-lisp Problem: Unable to use function passed in as parameter? I am trying to use a function ( secondaryFunction or secondaryFunction2 ) passed in as a parameter to primaryFunction . Howe...
Unable to use function passed in as parameter? Unable to use function passed in as parameter? lisp common-lisp Unable secondaryFunction2 param1 param2 NIL Unable to use function passed in as parameter? I am trying to use a function ( secondaryFunction or secondaryFunction2 ) passed in as a parameter to primaryFunction ...
[ -0.004486083984375, 0.0263671875, 0.01055908203125, 0.004638671875, -0.01007080078125, 0, 0.00010156631469726562, -0.0101318359375, -0.01068115234375, -0.0262451171875, 0.0031585693359375, -0.00579833984375, -0.0125732421875, -0.00130462646484375, 0.01806640625, -0.007476806640625, 0...
[ 992, 2886, 4527, 32354, 115081, 23, 237, 171859, 400, 7008, 39210, 4086, 254, 37526, 1294, 97249, 10763, 304, 121, 39, 418, 541, 16444, 31577, 10, 47, 158978, 11675, 18151, 35064, 25632, 18499, 37202, 114453, 87, 17569, 123019, 149307 ]
[ 0.043853759765625, 0.1724853515625, 0.1329345703125, 0.21240234375, 0.1903076171875, 0.209716796875, 0.1146240234375, 0.250244140625, 0.098388671875, 0.1761474609375, 0.116455078125, 0.0731201171875, 0.1444091796875, 0.17431640625, 0.0797119140625, 0.1632080078125, 0.10693359375, 0...
embed
26256706_c0
26256706
lisp
0
Title: How to return from a recursive LISP function? Problem title: How to return from a recursive LISP function? Tags: recursion, lisp Problem: How to return from a recursive LISP function? I am a new lisp programmer and I am trying to create my first recursive lisp function to return the larger of two lists. Every ti...
How to return from a recursive LISP function? How to return from a recursive LISP function? recursion lisp a How LISP How to return from a recursive LISP function? I am a new lisp programmer and I am trying to create my first recursive lisp function to return the larger of two lists. Every time I run the function it se...
[ 0.002410888671875, 0.03271484375, -0.005340576171875, 0.004852294921875, -0.004302978515625, 0.01263427734375, -0.00494384765625, 0.0162353515625, 0.0034637451171875, -0.00982666015625, 0.0230712890625, -0.0050048828125, -0.0164794921875, 0.00555419921875, 0.0189208984375, -0.000488281...
[ 11249, 47, 30646, 1295, 195625, 5844, 16970, 9434, 32354, 1830, 400, 7008, 10, 3525, 77848, 31577, 28282, 5117, 150679, 6626, 5303, 87769, 1733, 11675, 37202, 150631, 57767, 3647, 7225, 435, 18151, 4488, 15044, 5701, 140909, 20697, 69307, 129...
[ 0.11328125, 0.06158447265625, 0.2734375, 0.1810302734375, 0.2177734375, 0.14990234375, 0.1253662109375, 0.204345703125, 0.1820068359375, 0.09234619140625, 0.10986328125, 0.1695556640625, 0.019805908203125, 0.015716552734375, 0.1165771484375, 0.01483154296875, 0.005035400390625, 0.0...
embed
35160265_c0
35160265
lisp
0
Title: Writing followed by reading of *standard-input* Common Lisp Problem title: Writing followed by reading of *standard-input* Common Lisp Tags: fifo, common-lisp, stream, lisp Problem: Writing followed by reading of *standard-input* Common Lisp This is a very simple question. I am trying to solve the HackerRank que...
Writing followed by reading of *standard-input* Common Lisp Writing followed by reading of *standard-input* Common Lisp fifo common-lisp stream lisp Writing Common Lisp Writing followed by reading of *standard-input* Common Lisp This is a very simple question. I am trying to solve the HackerRank questions but don't ful...
[ -0.004302978515625, 0.0026092529296875, -0.0169677734375, -0.00182342529296875, -0.00836181640625, -0.0128173828125, -0.00408935546875, -0.0135498046875, -0.0093994140625, -0.034423828125, 0.00396728515625, 0.00787353515625, 0.009765625, -0.0096435546875, 0.00421142578125, -0.019409179...
[ 213185, 134629, 16454, 111, 66589, 73, 7077, 151301, 1261, 7008, 809, 3584, 39210, 4086, 254, 75973, 400, 8781, 86869, 52922, 56, 126525, 92, 17582, 28219, 3642, 831, 33022, 47, 9, 11675, 18151, 13909, 26458, 10554, 10298, 140909, 839, 3646...
[ 0.1968994140625, 0.0947265625, 0.1983642578125, 0.00286865234375, 0.25927734375, 0.151123046875, 0.2369384765625, 0.1063232421875, 0.1212158203125, 0.1240234375, 0.017730712890625, 0.083984375, 0.03924560546875, 0.057952880859375, 0.033233642578125, 0.10546875, 0.05755615234375, 0....
embed
28287511_c0
28287511
lisp
0
Title: (Lisp) Can i make this more efficient? Problem title: (Lisp) Can i make this more efficient? Tags: recursion, performance, lisp, common-lisp Problem: (Lisp) Can i make this more efficient? Doing a count the change style problem and i wrote this recursive in lisp, i was wondering if anyone had any tips for making...
(Lisp) Can i make this more efficient? (Lisp) Can i make this more efficient? recursion performance lisp common-lisp Lisp Can (Lisp) Can i make this more efficient? Doing a count the change style problem and i wrote this recursive in lisp, i was wondering if anyone had any tips for making this more efficient? if the nu...
[ -0.0211181640625, 0.0211181640625, -0.0029296875, 0.00982666015625, -0.0167236328125, -0.003204345703125, -0.01483154296875, 0.01416015625, 0.000522613525390625, -0.014404296875, -0.0120849609375, -0.00180816650390625, 0.01708984375, 0.0155029296875, 0.0023651123046875, 0.0087890625, ...
[ 9506, 7008, 4171, 17, 3249, 903, 1286, 93766, 195625, 1830, 23718, 400, 39210, 4086, 254, 1261, 54529, 70, 15549, 20623, 2967, 54397, 5844, 23, 149016, 6305, 20662, 101935, 2046, 5792, 6957, 4034, 36356, 51776, 1672, 138, 14633, 9969, 6743,...
[ 0.1212158203125, 0.20166015625, 0.128662109375, 0.06439208984375, 0.0931396484375, 0.10205078125, 0.1409912109375, 0.2266845703125, 0.1927490234375, 0.08056640625, 0.1456298828125, 0.1273193359375, 0.07861328125, 0.112060546875, 0.1492919921875, 0.138671875, 0.181396484375, 0.03500...
embed
24546761_c0
24546761
lisp
0
Title: Rebind cursor movement in emacs Problem title: Rebind cursor movement in emacs Tags: lisp, emacs Problem: Rebind cursor movement in emacs i am actually trying to customize my emacs keys for cursor movement. And what i want to archive is that when i enter M-+ or M-- that the cursor either moves to the end of line...
Rebind cursor movement in emacs Rebind cursor movement in emacs lisp emacs Rebind C-k C-i Rebind cursor movement in emacs i am actually trying to customize my emacs keys for cursor movement. And what i want to archive is that when i enter M-+ or M-- that the cursor either moves to the end of line or to the beginning. A...
[ -0.03369140625, 0.0245361328125, -0.007476806640625, -0.01043701171875, -0.004302978515625, 0.01300048828125, -0.007568359375, 0.0301513671875, -0.00165557861328125, 0.0216064453125, -0.004425048828125, -0.00177001953125, -0.0087890625, -0.00799560546875, -0.0194091796875, 0.0058898925...
[ 853, 89817, 13810, 42, 112664, 23, 352, 2263, 7, 400, 7008, 313, 9, 92, 14, 31577, 178036, 13, 22799, 100, 3444, 147488, 3229, 30957, 276, 1328, 707, 40101, 25813, 3564, 13315, 86595, 169581, 4420, 19364, 6276, 41382, 136, 40225, 17569, ...
[ 0.15478515625, 0.25048828125, 0.183349609375, 0.16015625, 0.20751953125, 0.0537109375, 0.129150390625, 0.1630859375, 0.121826171875, 0.05291748046875, 0.1573486328125, 0.1158447265625, 0.120361328125, 0.1190185546875, 0.151123046875, 0.031158447265625, 0.1588134765625, 0.0316772460...
embed
42603751_c0
42603751
lisp
0
Title: How to set an element in a multi-dimensional array in elisp Problem title: How to set an element in a multi-dimensional array in elisp Tags: lisp, elisp, vector Problem: How to set an element in a multi-dimensional array in elisp I am working with someone using elisp and we have been struggling to use multi-dime...
How to set an element in a multi-dimensional array in elisp How to set an element in a multi-dimensional array in elisp lisp elisp vector How How to set an element in a multi-dimensional array in elisp I am working with someone using elisp and we have been struggling to use multi-dimensional arrays. The problem is that...
[ 0.0034637451171875, 0.0228271484375, 0.00335693359375, 0, -0.002349853515625, -0.0057373046875, -0.015869140625, -0.00396728515625, 0.00299072265625, -0.0147705078125, 0.00775146484375, 0.01513671875, -0.010498046875, 0.0003452301025390625, -0.02001953125, -0.02685546875, -0.00234985...
[ 11249, 5423, 12830, 23, 6024, 157955, 10298, 53, 15296, 7008, 47, 400, 173, 18770, 20697, 237875, 4778, 2967, 34292, 17368, 3564, 1884, 3444, 151301, 1261, 8060, 10932, 185397, 4488, 4734, 1632, 22834, 22230 ]
[ 0.069091796875, 0.2052001953125, 0.2333984375, 0.0762939453125, 0.1546630859375, 0.176513671875, 0.1614990234375, 0.116455078125, 0.1080322265625, 0.19287109375, 0.0087890625, 0.09112548828125, 0.1610107421875, 0.191650390625, 0.01318359375, 0.037567138671875, 0.031341552734375, 0....
embed
30316041_c0
30316041
lisp
0
Title: Finding biggest K numbers from a list in Scheme Problem title: Finding biggest K numbers from a list in Scheme Tags: scheme, lisp Problem: Finding biggest K numbers from a list in Scheme I have an list of objects in scheme. Each object is associated with a confidence value that can be calculated at runtime. I wa...
Finding biggest K numbers from a list in Scheme Finding biggest K numbers from a list in Scheme scheme lisp a Finding Scheme WordPair1 WordPair2 Finding biggest K numbers from a list in Scheme I have an list of objects in scheme. Each object is associated with a confidence value that can be calculated at runtime. I wan...
[ 0.015380859375, 0.00106048583984375, 0.00640869140625, -0.01226806640625, -0.004852294921875, -0.00017452239990234375, 0.0027008056640625, -0.0169677734375, 0.0057373046875, -0.01953125, 0.0194091796875, -0.0233154296875, -0.006195068359375, -0.026611328125, -0.0059814453125, -0.014282...
[ 26040, 129058, 341, 101935, 1295, 5303, 23, 34702, 282, 150370, 400, 7008, 214, 22543, 8335, 481, 304, 36746, 137272, 159454, 34292, 74481, 11675, 6032, 3444, 7413, 2663, 836, 6044, 167375, 89536, 164805, 10461, 96759, 12989, 59121, 32354, 30...
[ 0.1190185546875, 0.194091796875, 0.1953125, 0.220703125, 0.08392333984375, 0.19189453125, 0.049163818359375, 0.1881103515625, 0.14306640625, 0.2198486328125, 0.035552978515625, 0.14794921875, 0.059844970703125, 0.1121826171875, 0.1455078125, 0.1019287109375, 0.044097900390625, 0.21...
embed
46901947_c0
46901947
lisp
0
Title: Appending a list to display in a text-field% in Racket Problem title: Appending a list to display in a text-field% in Racket Tags: scheme, racket, list, lisp Problem: Appending a list to display in a text-field% in Racket I have a function that receives a list of strings, named "derivedSentences" that needs to b...
Appending a list to display in a text-field% in Racket Appending a list to display in a text-field% in Racket scheme racket list lisp Appending Racket Appending a list to display in a text-field% in Racket I have a function that receives a list of strings, named "derivedSentences" that needs to be displayed in a text-f...
[ 0.0177001953125, 0.007110595703125, -0.0016021728515625, 0.03515625, 0.01190185546875, -0.007568359375, 0.01513671875, 0.01104736328125, 0.0152587890625, -0.0042724609375, 0.01422119140625, -0.045654296875, -0.00193023681640625, -0.00933837890625, 0.0098876953125, -0.000545501708984375...
[ 5787, 96819, 5303, 44116, 7986, 28394, 3949, 2552, 27853, 150370, 673, 400, 7008, 23, 32354, 53299, 79315, 820, 14, 4126, 294, 2517, 69098, 27117, 12638, 1733, 40956, 91995, 198395, 46132, 4734, 4568, 127887, 7639, 29954, 1272, 95528, 178308,...
[ 0.1138916015625, 0.1361083984375, 0.226806640625, 0.1614990234375, 0.173583984375, 0.1751708984375, 0.10198974609375, 0.108154296875, 0.1998291015625, 0.1494140625, 0.08111572265625, 0.045379638671875, 0.1015625, 0.014801025390625, 0.138427734375, 0.011260986328125, 0.19189453125, ...
embed
9729549_c0
9729549
lisp
0
Title: Why do we need funcall in Lisp? Problem title: Why do we need funcall in Lisp? Tags: common-lisp, lisp, funcall Problem: Why do we need funcall in Lisp? Why do we have to use funcall to call higher order functions in Common Lisp? For example, why do we have to use: (defun foo (test-func args) (funcall test-func ...
Why do we need funcall in Lisp? Why do we need funcall in Lisp? common-lisp lisp funcall Why Lisp func.invoke Why do we need funcall in Lisp? Why do we have to use funcall to call higher order functions in Common Lisp? For example, why do we have to use: instead of the simpler: Coming from a procedural background, I'm ...
[ -0.0030364990234375, 0.007720947265625, 0.008056640625, 0.0213623046875, -0.0007171630859375, -0.00433349609375, 0.004241943359375, -0.004547119140625, 0.0025177001953125, -0.03759765625, 0.006378173828125, 0.0054931640625, -0.026123046875, 0.0150146484375, 0.01336669921875, -0.0116577...
[ 44084, 642, 3871, 7477, 85763, 23, 1261, 7008, 54, 39210, 4086, 254, 400, 238, 73, 23253, 13, 765, 47, 4527, 11782, 77546, 12989, 32354, 151301, 15400, 64457, 8781, 42, 59158, 76615, 4785, 144285, 46876, 1286, 11814, 145581, 4904, 149067, ...
[ 0.1405029296875, 0.035430908203125, 0.1578369140625, 0.1893310546875, 0.28271484375, 0.0828857421875, 0.177001953125, 0.2376708984375, 0.0272979736328125, 0.089111328125, 0.1221923828125, 0.1488037109375, 0.109375, 0.103515625, 0.039764404296875, 0.161376953125, 0.073486328125, 0.0...
embed
74363520_c0
74363520
lisp
0
Title: I wish to change the format of the numbers contained in a list Common Lisp Allegro Problem title: I wish to change the format of the numbers contained in a list Common Lisp Allegro Tags: common-lisp, lisp, floating-point, formatting Problem: I wish to change the format of the numbers contained in a list Common L...
I wish to change the format of the numbers contained in a list Common Lisp Allegro I wish to change the format of the numbers contained in a list Common Lisp Allegro common-lisp lisp floating-point formatting Common Lisp Allegro I wish to change the format of the numbers contained in a list Common Lisp Allegro I have l...
[ -0.01531982421875, 0.0027313232421875, 0.00051116943359375, 0.01531982421875, 0.02587890625, 0.01324462890625, 0.00933837890625, 0.0155029296875, 0.0184326171875, 0.033447265625, -0.00433349609375, -0.00750732421875, -0.00140380859375, 0.017578125, 0.0081787109375, -0.00927734375, 0....
[ 87, 32599, 47, 15549, 9384, 101935, 70541, 5303, 151301, 1261, 7008, 4344, 8407, 23, 39210, 4086, 254, 400, 21917, 26518, 38496, 765, 678, 5792, 5941, 32380, 67553, 1884, 456, 126940, 151134, 80854, 242, 615, 3742, 96060, 131564, 10945, 423...
[ 0.0189361572265625, 0.1204833984375, 0.0482177734375, 0.2252197265625, 0.267333984375, 0.21240234375, 0.1400146484375, 0.216552734375, 0.1246337890625, 0.1197509765625, 0.156005859375, 0.1268310546875, 0.1971435546875, 0.0267791748046875, 0.099365234375, 0.060791015625, 0.09545898437...
embed
9286318_c0
9286318
lisp
0
Title: Why choose Lisp for a project? Problem title: Why choose Lisp for a project? Tags: lisp, functional-programming Problem: Why choose Lisp for a project? I am seeking concrete and unique features that Lisp (any dialect) offers to a project, compared to the other primarily functional languages. For example, Haskell...
Why choose Lisp for a project? Why choose Lisp for a project? lisp functional-programming Why Lisp Why choose Lisp for a project? I am seeking concrete and unique features that Lisp (any dialect) offers to a project, compared to the other primarily functional languages. For example, Haskell offers lazy-evaluation, puri...
[ -0.01080322265625, 0.01409912109375, 0.013916015625, 0.00433349609375, -0.0152587890625, -0.0162353515625, 0.00116729736328125, 0.00689697265625, 0.01495361328125, 0.008056640625, 0.005706787109375, -0.0166015625, 0.00153350830078125, 0.01434326171875, -0.01171875, 0.004486083984375, ...
[ 44084, 55076, 1261, 7008, 100, 13452, 400, 123309, 28966, 214, 191618, 122776, 36998, 66139, 4848, 220734, 64600, 154186, 102917, 46876, 20625, 142508, 21, 3285, 159258, 7398, 2481, 10644, 16751, 112397, 45367, 1286, 26785, 103391, 1004, 3066, ...
[ 0.133544921875, 0.1346435546875, 0.221923828125, 0.26513671875, 0.0809326171875, 0.1705322265625, 0.1649169921875, 0.1680908203125, 0.133544921875, 0.0269622802734375, 0.0469970703125, 0.08056640625, 0.11181640625, 0.123046875, 0.0233917236328125, 0.201171875, 0.0994873046875, 0.04...
embed
29685613_c0
29685613
lisp
0
Title: List Generation in Lisp Problem title: List Generation in Lisp Tags: lisp, sbcl, list, heap-memory Problem: List Generation in Lisp Why do people say lists come for free in Lisp? If I run this code (let ((acc '())) (do ((i 1 (incf i))) ((= i 100)) (do ((j 0 (incf j))) ((= j 100)) (do ((k 0 (incf k))) ((= k 100))...
List Generation in Lisp List Generation in Lisp lisp sbcl list heap-memory List Generation Lisp List Generation in Lisp Why do people say lists come for free in Lisp? If I run this code I get a heap exhausted error in SBCL. I'm not very familiar with how Lisp works under the hood, but I need to generate a list of very ...
[ -0.003082275390625, 0.0322265625, -0.0245361328125, 0.007415771484375, -0.00677490234375, 0.01275634765625, -0.0191650390625, 0.0032501220703125, 0.01025390625, -0.03125, 0.01287841796875, -0.00162506103515625, 0.01495361328125, 0.011474609375, -0.01226806640625, 0.004302978515625, 0...
[ 32036, 83479, 1261, 7008, 23, 400, 275, 34937, 5303, 764, 2631, 109005, 44084, 3395, 5154, 7, 1380, 100, 4092, 11675, 18151, 146353, 18499, 90944, 37486, 16031, 43240, 1379, 44462, 3871, 139392, 4552, 5941, 3917, 15490, 1810, 32628 ]
[ 0.2191162109375, 0.1973876953125, 0.15966796875, 0.2349853515625, 0.05096435546875, 0.10888671875, 0.0161895751953125, 0.1331787109375, 0.233154296875, 0.1297607421875, 0.1365966796875, 0.14111328125, 0.035675048828125, 0.0077972412109375, 0.047027587890625, 0.08172607421875, 0.11297...
embed
723881_c0
723881
lisp
0
Title: How to enforce maximum line length in Emacs? Problem title: How to enforce maximum line length in Emacs? Tags: lisp, emacs, code-formatting Problem: How to enforce maximum line length in Emacs? In Emacs, how can I enforce a maximum line length of, say, 80 characters? I want it to insert proper line breaks in my ...
How to enforce maximum line length in Emacs? How to enforce maximum line length in Emacs? lisp emacs code-formatting How Emacs LongNameType PrettyLong AlsoLong How to enforce maximum line length in Emacs? In Emacs, how can I enforce a maximum line length of, say, 80 characters? I want it to insert proper line breaks in...
[ -0.00469970703125, 0.00677490234375, 0.0164794921875, -0.002349853515625, -0.0125732421875, 0.0181884765625, -0.0081787109375, 0.0181884765625, 0.003814697265625, -0.0205078125, -0.00982666015625, -0.00445556640625, -0.0281982421875, -0.003326416015625, 0.004791259765625, -0.0230712890...
[ 11249, 47, 22, 50930, 38132, 13315, 140909, 23, 85269, 4439, 400, 7008, 352, 2263, 7, 18151, 51727, 14407, 163612, 196707, 197570, 866, 4021, 22376, 360, 3642, 831, 10, 111, 5154, 2248, 124850, 3444, 183540, 27798, 36356, 26292, 9, 6276, ...
[ 0.080078125, 0.038421630859375, 0.1229248046875, 0.22802734375, 0.2288818359375, 0.2330322265625, 0.2213134765625, 0.0721435546875, 0.21337890625, 0.2286376953125, 0.0628662109375, 0.1678466796875, 0.1280517578125, 0.14306640625, 0.0491943359375, 0.1700439453125, 0.078369140625, 0....
embed
10471423_c0
10471423
lisp
0
Title: statistics packages for Common Lisp Problem title: statistics packages for Common Lisp Tags: common-lisp, lisp, r, statistics Problem: statistics packages for Common Lisp I have been looking for some good statistics package for Common Lisp, that should be both stable and efficient. There is lhstats , but it does...
statistics packages for Common Lisp statistics packages for Common Lisp common-lisp lisp r statistics Common Lisp statistics packages for Common Lisp I have been looking for some good statistics package for Common Lisp, that should be both stable and efficient. There is lhstats , but it doesn't have much documentation ...
[ 0.026611328125, 0.008544921875, 0.0185546875, -0.009765625, -0.015380859375, 0.017578125, 0.0089111328125, -0.01397705078125, 0.00119781494140625, -0.01483154296875, 0.0140380859375, 0.0125732421875, 0.005889892578125, 0.00244140625, 0.01434326171875, 0.006927490234375, -0.0186767578...
[ 80835, 7, 98169, 100, 151301, 1261, 7008, 39210, 4086, 254, 400, 1690, 4127, 5608, 144142, 93766, 96, 127, 17346, 5045, 209806, 82424, 76104, 12601, 2822, 3917, 56037, 449, 23, 90944, 37486, 16487, 175961, 32354, 48301, 5490, 3299, 74413, 1...
[ 0.2442626953125, 0.1065673828125, 0.2408447265625, 0.06072998046875, 0.1932373046875, 0.1905517578125, 0.1739501953125, 0.1077880859375, 0.1036376953125, 0.0826416015625, 0.099365234375, 0.13671875, 0.025543212890625, 0.001678466796875, 0.1361083984375, 0.1121826171875, 0.00482177734...
embed
24945251_c0
24945251
lisp
0
Title: Scheme filters - &quot;wrong value to apply: #f&quot; Problem title: Scheme filters - &quot;wrong value to apply: #f&quot; Tags: conditional-statements, scheme, filter, lisp, list Problem: Scheme filters - "wrong value to apply: #f" I'm trying to filter out a list based off of a predicate I wrote myself, but whe...
Scheme filters - &quot;wrong value to apply: #f&quot; Scheme filters - &quot;wrong value to apply: #f&quot; conditional-statements scheme filter lisp list Scheme ERROR Wrong Predicate Scheme filters - "wrong value to apply: #f" I'm trying to filter out a list based off of a predicate I wrote myself, but when I run the ...
[ -0.0074462890625, 0.013916015625, -0.015625, -0.00164031982421875, -0.01708984375, 0.0174560546875, 0.0169677734375, 0.0048828125, -0.0086669921875, 0.031005859375, 0.00183868408203125, -0.0086669921875, -0.01470947265625, -0.0245361328125, 0.0035247802734375, 0.01397705078125, 0.023...
[ 34702, 282, 46312, 7, 434, 35133, 34292, 47, 59911, 420, 35431, 289, 61340, 150370, 400, 7008, 5303, 151206, 24638, 7145, 2063, 67, 468, 31577, 1810, 35509, 5773, 1653, 87, 54397, 35978, 1284, 11675, 70, 2046, 18151, 111, 903, 83, 759, ...
[ 0.18798828125, 0.15673828125, 0.252685546875, 0.0465087890625, 0.041015625, 0.1973876953125, 0.2061767578125, 0.042388916015625, 0.1824951171875, 0.148681640625, 0.11181640625, 0.037506103515625, 0.10546875, 0.1983642578125, 0.035308837890625, 0.10107421875, 0.1710205078125, 0.1197...
embed
19160931_c0
19160931
lisp
0
Title: Difference between &#x27;(()) and (cons null null) Problem title: Difference between &#x27;(()) and (cons null null) Tags: scheme, lisp Problem: Difference between '(()) and (cons null null) I am confused about the difference between '(()) and (cons null null) in scheme. The code below show that b and c are comp...
Difference between &#x27;(()) and (cons null null) Difference between &#x27;(()) and (cons null null) scheme lisp Difference dup2 Difference between '(()) and (cons null null) I am confused about the difference between '(()) and (cons null null) in scheme. The code below show that b and c are completely the same thing....
[ 0.00921630859375, 0.0244140625, 0.00482177734375, 0.0205078125, 0.00014781951904296875, 0.027099609375, -0.0084228515625, -0.00726318359375, 0.02197265625, -0.009033203125, -0.0166015625, -0.0087890625, 0.00958251953125, -0.001800537109375, -0.00604248046875, 0.005706787109375, 0.009...
[ 803, 18234, 6620, 17721, 54764, 3768, 74, 132, 136, 15, 25553, 56574, 150370, 400, 7008, 115, 254, 304, 242, 55681, 5281, 60212, 18151, 35064, 7639, 876, 501, 621, 64557, 5701, 13580, 11814, 64457, 84572, 2886, 12921, 28007, 28219 ]
[ 0.1046142578125, 0.2193603515625, 0.090087890625, 0.140869140625, 0.071533203125, 0.13916015625, 0.0701904296875, 0.2008056640625, 0.1103515625, 0.07275390625, 0.2166748046875, 0.27734375, 0.214599609375, 0.1002197265625, 0.1793212890625, 0.2122802734375, 0.2000732421875, 0.2186279...
embed
4235817_c0
4235817
lisp
0
Title: Lisp Format Procedure Problem title: Lisp Format Procedure Tags: integer, format, lisp, list Problem: Lisp Format Procedure Im starting to program in Lisp and having an hard time with the Format function. My objective is to print a list of integer sublists as N integers for line. For example: '((1 2 3) (4 5 6) (...
Lisp Format Procedure Lisp Format Procedure integer format lisp list Lisp Format Procedure Lisp Format Procedure Im starting to program in Lisp and having an hard time with the Format function. My objective is to print a list of integer sublists as N integers for line. For example: '((1 2 3) (4 5 6) (7 8 9)) should be ...
[ -0.0291748046875, 0.012451171875, 0.00592041015625, 0.00885009765625, -0.017578125, 0.014892578125, 0.00860595703125, 0.0198974609375, -0.003936767578125, 0.004241943359375, 0.00616455078125, -0.0213623046875, -0.01177978515625, -0.005401611328125, 0.00543212890625, 0.0159912109375, ...
[ 1261, 7008, 60972, 170470, 892, 1505, 9384, 400, 5303, 3370, 72134, 1528, 7941, 1733, 32354, 151814, 28412, 1614, 6562, 237, 541, 26255, 100, 13315, 27781, 242, 41600, 116, 8439, 9451, 190, 35914, 19107, 382, 77816, 5608, 106, 138, 201, 3...
[ 0.1856689453125, 0.2318115234375, 0.313232421875, 0.2071533203125, 0.160888671875, 0.10565185546875, 0.278564453125, 0.159912109375, 0.206298828125, 0.0149383544921875, 0.0280609130859375, 0.1214599609375, 0.06964111328125, 0.0789794921875, 0.1466064453125, 0.16552734375, 0.183227539...
embed
74134357_c0
74134357
lisp
0
Title: Nested lists in Lisp comparison Problem title: Nested lists in Lisp comparison Tags: lisp Problem: Nested lists in Lisp comparison I have a function that can produce a list of n-element sublists from a list of elements but I am stuck in filtering out elements that are just permutations of each other. For example...
Nested lists in Lisp comparison Nested lists in Lisp comparison lisp Nested Lisp Nested lists in Lisp comparison I have a function that can produce a list of n-element sublists from a list of elements but I am stuck in filtering out elements that are just permutations of each other. For example, f(A,B) -> ((A, B) (B,A)...
[ -0.0155029296875, 0.02490234375, 0.002685546875, 0.00096893310546875, -0.0035858154296875, 0.022216796875, -0.01019287109375, -0.00104522705078125, 0.00445556640625, -0.0084228515625, -0.002716064453125, 0.0220947265625, 0.0242919921875, 0.0118408203125, -0.030517578125, 0.014404296875...
[ 28701, 71, 5303, 1261, 7008, 225490, 23, 400, 32354, 831, 27489, 653, 62766, 1614, 6562, 1295, 80854, 179933, 46312, 214, 1810, 1660, 117, 14311, 21094, 12638, 3789, 1238, 571, 33079, 335, 284, 2046, 3444, 4, 16792, 561, 22062, 2685, 10, ...
[ 0.25537109375, 0.1339111328125, 0.228271484375, 0.167724609375, 0.2161865234375, 0.2259521484375, 0.017822265625, 0.136962890625, 0.1834716796875, 0.0291900634765625, 0.0714111328125, 0.0638427734375, 0.15185546875, 0.1533203125, 0.1973876953125, 0.0147705078125, 0.159423828125, 0....
embed
78162793_c0
78162793
lisp
0
Title: Scheme Question - How can I check if there are a list of pairs Problem title: Scheme Question - How can I check if there are a list of pairs Tags: lisp, racket, scheme Problem: Scheme Question - How can I check if there are a list of pairs So I need to write code on scheme that checks if there is a list of pairs...
Scheme Question - How can I check if there are a list of pairs Scheme Question - How can I check if there are a list of pairs lisp racket scheme Scheme Question How Scheme Question - How can I check if there are a list of pairs So I need to write code on scheme that checks if there is a list of pairs? Any ideas on wher...
[ -0.0191650390625, 0.037353515625, -0.00677490234375, 0.0130615234375, -0.0029449462890625, 0.03369140625, -0.015625, -0.0279541015625, -0.01141357421875, -0.0283203125, -0.000331878662109375, -0.0233154296875, -0.0010833740234375, -0.016357421875, -0.00775146484375, 0.01287841796875, ...
[ 34702, 282, 68185, 11249, 831, 12765, 2174, 2685, 621, 10, 5303, 111, 80836, 400, 7008, 673, 27853, 150370, 7, 33022, 18151, 26859, 6528, 26785, 3714, 44691, 18499, 4390, 109637, 187, 2481, 1239, 98753, 84751, 14012, 10750, 959, 14858, 3447...
[ 0.1715087890625, 0.1339111328125, 0.140869140625, 0.032440185546875, 0.04754638671875, 0.223388671875, 0.09521484375, 0.077392578125, 0.0792236328125, 0.05810546875, 0.2138671875, 0.1285400390625, 0.265380859375, 0.0589599609375, 0.153076171875, 0.04608154296875, 0.18017578125, 0.2...
embed
65026336_c0
65026336
lisp
0
Title: EVAL: undefined function. Function as a param in Common LISP Problem title: EVAL: undefined function. Function as a param in Common LISP Tags: lisp, function-call, common-lisp Problem: EVAL: undefined function. Function as a param in Common LISP Starting to learn LISP and wrote two simple programs, which uses fu...
EVAL: undefined function. Function as a param in Common LISP EVAL: undefined function. Function as a param in Common LISP lisp function-call common-lisp EVAL Common LISP f123 some1 EVAL: undefined function. Function as a param in Common LISP Starting to learn LISP and wrote two simple programs, which uses functions as ...
[ 0.0026397705078125, 0.012451171875, 0.0081787109375, 0.0035247802734375, -0.008056640625, 0.016845703125, 0.01312255859375, -0.0022430419921875, -0.0020751953125, -0.034423828125, 0.01507568359375, -0.01214599609375, 0.006591796875, -0.007598876953125, 0.00823974609375, -0.0087890625, ...
[ 241, 61152, 12, 9232, 5983, 297, 32354, 5, 28670, 10763, 237, 10, 121, 39, 23, 151301, 16970, 9434, 400, 7008, 85763, 39210, 4086, 254, 1238, 48636, 3060, 418, 30698, 54397, 6626, 8781, 103391, 4527, 4432, 5117, 17932, 15044, 111, 1528, ...
[ 0.1385498046875, 0.33203125, 0.0574951171875, 0.138427734375, 0.207275390625, 0.119873046875, 0.2210693359375, 0.0069580078125, 0.1854248046875, 0.0985107421875, 0.1416015625, 0.0247955322265625, 0.1798095703125, 0.1630859375, 0.0228424072265625, 0.1636962890625, 0.154296875, 0.214...
embed
64377466_c1
64377466
lisp
1
1 jmp end_3 false_2: push 1 # push argument to - push [rbp + 16] # push argument to - call minus add rsp, 16 # discard 2 local arguments push rax # result of - call factorial add rsp, 8 # discard 1 local argument push rax # result of factorial push [rbp + 16] # push argument to * call multiply add rsp, 16 # discard 2 ...
1 jmp end_3 false_2: push 1 # push argument to - push [rbp + 16] # push argument to - call minus add rsp, 16 # discard 2 local arguments push rax # result of - call factorial add rsp, 8 # discard 1 local argument push rax # result of factorial push [rbp + 16] # push argument to * call multiply add rsp, 16 # discard 2 ...
[ -0.00469970703125, 0.035400390625, 0.01287841796875, 0.0255126953125, -0.0196533203125, 0.0013427734375, 0.01397705078125, 0.01092529296875, -0.00836181640625, 0.0013580322265625, 0.00787353515625, -0.0013427734375, 0.0113525390625, -0.0032501220703125, 0.007415771484375, -0.0166015625...
[ 106, 1647, 2676, 3564, 363, 98320, 304, 25944, 468, 10750, 47, 13471, 254, 997, 611, 11782, 26948, 15190, 1690, 7008, 17116, 5861, 116, 4000, 673, 425, 16750, 31461, 15403, 382, 6024, 62479, 30464, 7426, 10267, 10135, 1022, 91526, 757, 15...
[ 0.0394287109375, 0.125, 0.261474609375, 0.1541748046875, 0.177490234375, 0.21044921875, 0.11083984375, 0.2130126953125, 0.03778076171875, 0.232177734375, 0.0848388671875, 0.10699462890625, 0.1234130859375, 0.06683349609375, 0.1444091796875, 0.1280517578125, 0.2298583984375, 0.08715...
embed