Hi, On Mi, 2015-08-05 at 22:14 +0200, Steffen Hemer wrote: > thanks for your replies. So as the competition was on the weekend at > Hockenheimring, I know have time to figure it out til next year. It > really was a short-term idea and we were aware that we might not solve > it in time, although I got quite near. I started to define a new > question type which looks quite promising but have not finished yet.
Ah, well, then you probably want to look at the new class, it is quite neat (but incomplete and likely still buggy) ;-) > What's that new class about to be finished you were talking about? I > suppose it's somewhere in the repositories? Hm, ok, not going to explain it here (again). Let me point you to https://github.com/sdaps/sdaps-class and http://article.gmane.org/gmane.comp.statistics.sdaps/203 which contains quite a long summary. Right now I am again a bit active, and what I am working on is a class that emulates the old macros/environments but is based on the new code, as a kind of "compatibility" layer. This is a bit of a kludge, but will allow people to start using the code and test it. And it does contain some neat bug fixes too :) Though it will likely also removes some features (at least initially). Benjamin > Am 02.08.2015 um 13:32 schrieb Jérémie Lumbroso: > > Hello, > > > > Welcome to SDAPS! > > > > I thought I could complement Benjamin's response from my > > experience: - while the new class that Benjamin and some other > > people are working will make this extremely convenient; - for the > > moment, it is possible to hack the current package by using > > minipage, and hspaces; it would ugly, but it would work exactly as > > you want, and provide what you want. > > > > Does this sound good? > > > > Best, Jérémie. > > > > > > > > On Sun, Aug 2, 2015 at 1:27 PM, Benjamin Berg > > <[email protected] <mailto:[email protected]>> > > wrote: > > > > Hi, > > > > Sorry, that I did not reply earlier. > > > > On Do, 2015-07-30 at 14:23 +0200, Steffen Hemer wrote: > > > I have an urgent question: we want to use some OMR software to > > > evaluate the counting sheets (for hit cones and off-course during > > > race) and we came across SDAPS. But the first problem was how to > > > define and arrange the checkboxes. I tried to use a table to > > > arrange question (comparable to HTML) but I get whole lot of > > > errors. > > > > Hm, would need to play around it myself a bit. The trouble is, that > > the current class extensively uses tables in a way that break > > putting the questions themselves into tables. > > > > In general, there are a couple of valid approaches right now: * Use > > a multicol environment (i.e. columns of text, not a table) * > > Manually place the checkboxes, and emulate a (single) large > > question * Use the new class (maybe not that good of an idea, > > unless you like to get your hands dirty) > > > > Hm, I think there should be an example of manual creating questions > > and placing checkboxes somewhere … maybe have a look at: > > http://sdaps.org/FAQ#Is_it_possible_to_do_custom_layouts_in_LaTeX.3 > > F > > > > > and see if you can figure something out. If you still have questions, > > feel free to drop line. > > > > > Secondary I am yet unsure how it will work to count the marked > > > boxes but actually I haven't been that far. > > > > You would get a large CSV file, with a column for each checkbox > > indicating its state. If you do the second approach, you would > > probably create one "question" for each row. That means you get a > > large set of columns with headers in the form "_QUESTION_CHECKBOX" > > indicating row and column in your table. You should be able to add > > up the values using a script/tabular calculation software. > > > > > I will attach some source code and an example sheet. Maybe you > > > can give some helpful input and point me to the right direction. > > > Sorry for missing informations and feel free to complain about > > > it. I will be ready to provide more on this. > > > > Regards, Benjamin > > > > > >
signature.asc
Description: This is a digitally signed message part
