22:06:59trafaret1anybody can explain me how to organize such sytem [PC[lisp-environemnt]] ~~~~~[Tablets(Show evaluations)]?
22:07:12desvoxif its any help, what im doing to cause this is opening a video file thats stored in the path i gave to :document-root, in firefox, and when the video loads, i just skip around it until it breaks
22:13:44desvoxanyways aside from this, ive really liked working with hunchentoot
22:14:33desvoxa couple years ago i used to run a video server for me and my housemate, because we were only sattelite, we had a data limit during the daytime, and unlimited from 2AM-8AM
22:14:50desvoxso i scheduled transmission and youtube-dl stuff to download to the server in the free hours
22:15:07desvoxsaving us out precious 15GB a month during the day while still letting us watch stuff
22:15:29desvoxit was sooooo useful and easy to set up but sadly i lost the source code
22:16:08desvoxi didnt care about it enough and just dumped it all to /dev/null but now that im getting back into it, am thinking its kinda dumb and probably preventable
22:16:54ebrascapjb: Can I do the same but if only contain some bit?
22:20:38fortitudeebrasca: sounds like logbitp might be what you're looking for
22:23:40pjbebrasca: yeah, perhaps not. Also, you can consider ldb and mask-field.
22:24:06pjbBut the solution above with log* has one fewer calls.
22:25:15pjbbit-vectors don't have an advantage here, because the bit-* functions don't take a :start :end range :-(
22:25:30pjbSo you'd have to use subseq or a displaced bit-vector, and it won't be more efficient.
22:25:47pjb(unless your ranges are small, and your integers are big).
22:29:18aethI think you'd need something to be *very* large for bit vectors to be worth it.
22:30:42aethI don't think the line is even 64 in SBCL. In SBCL you can have (unsigned-byte 64) arrays and if you do a type declaration for the array it will know the size of the elements... So it's possible that for many uses of bits you could just have multiple ub 64s in parallel. This could work for 128, 256, etc.
22:34:00aethI'd say stylistically ub64s in parallel could work fine until 4 or so, so 256 elements. Macros, of course, means that you could do it based on what's optimal (which could change based on the implementation and even the version of the implementation)
22:35:17ebrascaHere is my result (= 2 (logand #b11111011111011111 feature-incompat))
22:35:27aethThis is, of course, assuming a 64-bit implementation that has specialized (unsigned-byte 64) arrays. It also requires you to do a type declaration if the creation of the object is done in a separate function (in which case type inference probably wouldn't work)
22:36:26ebrascaOnly give t if you only have feature +incompat-filetype+ ( 2 ) from ext.
22:40:42aethI personally wouldn't mix binary and base 10. I'd either use base 2 or base 16 when working with something that's supposed to be base 2 like integers-as-bits
4:32:23desvoxalso the first comment is "it looks like lisp!" and HAAAAAAAAA anyone who writes lisp anywhere near that needs to have their computers taken away