freenode/#lisp - IRC Chatlog
Search
6:00:33
fiddlerwoaroof
elderK: as a general rule you ask your question and if anyone can think of anything to say you might get a flameware out of it
6:01:59
aeth
fiddlerwoaroof: Everyone knows that the only valid programming style is my style and the only valuable problems to solve are the problems I find interesting!
6:02:17
aeth
fiddlerwoaroof: Also, the only editor one should use is the editor I use (well, at least the Lisp community doesn't have a debate there)
6:24:00
fiddlerwoaroof
I use VS Code almost exclusively for JS because I haven't been able to find a good emacs setup for react that works with aggressive-indent-mode
6:28:13
elderK
fiddlerwoaroof: Thing is, well, iono. I wish I had someone to talk about the idea with. I know what I want to do, hell, I even know the expansion I want. But every way I do it feels nasty in some way.
6:28:45
elderK
:P I'm surprised Alexandria doesn't a have function that like, creates a lot with N of whatever you specify.
6:29:09
aeth
*mentioning... for some reason my n key hasn't registered all of the n's today. Not reason why an i also got dropped
7:14:39
LdBeth
What's the (probably terminal) setting to let lisp eval a form immediately after parenthesis pair up without send return?
7:28:07
pillton
I think you would have to use read-preserving-whitespace and a terminal setting. See chapter 17.3 of The GNU C Library.
8:57:17
elderK
I've been working on a system that'll allow me to do, like, the kind of work I wanna do.
8:57:52
elderK
I've been working on "binary structures" for most of the day today. It winds up being a much more uh, detailed, problem than it first appears. Taking a peek at other such systems, many sidestep some tough stuff.
8:58:21
elderK
Or doing most of their stuff by way of type info at runtime, rather than actually generating efficient "readers" with the important stuff baked i n
8:58:41
elderK
Of course, you also want to be able to have structures in structures, or arrays of structures in structures :P
8:59:13
elderK
And be able to correctly parse them. Conceptually, it winds up pretty straight forward. But, I have not yet been able to implement it in a way I feel happy with.
9:00:07
elderK
I erased what (little) I wrote for define-binary-structure. Instead, I just wound up documenting the core ideas.
9:00:22
jackdaniel
actually no, minimal cases which illustrate the problem which are well formated increase likehood of someone looking at them
9:00:45
jackdaniel
brettgilio: also it is the minimum level of politeness to prepare clean example if you request help/review
9:01:49
jackdaniel
and people who count on approachable people will lose big because non-approachable (yet kind) experts won't bother to look at that
9:04:41
jackdaniel
(and I understand your point of view - it is very kind one, hard to criticize it, I've just provided argumentation, that "dirtier the better" may wrong headed if you think about consequences)
9:06:48
elderK
Well, I'd like to discuss the design as it were, but I'd prefer to do that in private with someone. I came here earlier hoping to chat with someone about it all but I was shot down for it.
9:08:07
_death
elderK: the issues you talk about are both about design and implementation.. in this case, I suggest you figure out the right syntax describing the binary structures, sketching a simple implementation and leave the efficiency issues for later
9:08:53
elderK
_death: I know /exactly/ what I want to generate. That hasn't been the problem. The problem has simply been that each implementation I've written to do what I want to do, feels horrible :P So, I have cycled over and over trying to do it differently, do it better.
9:09:31
elderK
I'm happy with the simpler parts of my system so far. Just, structures, atm are the interesting thing. Mostly because I want to allow stuff as mentioned earlier.
9:11:29
elderK
_death: I have been. And for the most part, everyone here has been extremely useful. I appreciate it.
9:24:59
fiddlerwoaroof
elderK: fwiw, if you already know what the generated code should look like, you should build up your higher-level interface incrementally
12:40:20
jmercouris
eg. instead of make-hash-table only allowing eql equal and equalp, I could pass my-special-equal, that compares the two objects
12:41:45
shka__
jmercouris: well, there is trivial-hashtable that allows you to use implementation hashtable with your own comparator function
12:45:11
shka__
i have my own library called cl-data-structures with HAMT implementation so you can also use that
12:48:41
gypsydave5
here's the project if that's any help: https://gitlab.common-lisp.net/parenscript/parenscript
12:50:11
gypsydave5
I don't see what I'm doing wrong that's the difference between the two commands - I've tried a few variations on the 'parenscript.tests' name - is there some subsystem syntax or detail that I'm missing)
12:53:42
gypsydave5
sorry - I should have said - I've been using (asdf:load-system ...) not (asdf:load ...)
12:56:45
gypsydave5
So (load "parenscript.tests.asd") comes up with a compiled program error, illegal function call
12:57:02
jackdaniel
(asdf:load-asd "parenscript.asd") ; to be ASDF3-conforming (asdf since version 3 says, that it is best to leave (in-package asdf-user) at the beginning, so load won't do)
12:57:40
jackdaniel
I personally always put (in-package asdf-user) to allow cl:load, but not all developers do that
13:00:10
jackdaniel
that confirms, that this "asd" file doesn't have (in-package asdf) or (in-package asdf-user) at the top
13:00:25
jackdaniel
gypsydave5: correct way of loading it would be (asdf:load-asd "file.asd") without changing package in your repl
13:00:58
jackdaniel
in principle asdf may introduce its own reader at some point and load simply won't cut it (even from asdf package)
13:02:32
jackdaniel
I wouldn't be very suprised, if one day defsystem will start to expand to (progn (unless *load-asd* (error "boo")) (do-defsystem …)) ;-)
13:05:16
gypsydave5
jackdaniel: just wondering why the first system load worked - (asdf:load-system "parenscript") - and the second didn't. I can't see what the significant difference is between the two.
13:07:41
gypsydave5
So ASDF already _knew_ about the parenscript system, but not about the parenscript.tests system
13:10:37
jackdaniel
thodg: why should it be patched? parenscript.test is defined in its own file parenscript.test.asd, so it conforms to asdf requirements
13:12:09
jackdaniel
try (ql:quickload 'parenscript.test) ; (if you have QL) - that will fetch dependencies for you
13:14:43
gypsydave5
OK - I am now less stupid than 20 minutes ago - success. Thanks jackdaniel and thodg!