Re:Advice on naming and structuring scholarLY commands

2018-06-18 Thread Flaming Hakama by Elaine
> I understand your concern with using "Mark" as the basis of the name, > since while this \editorialMark will often (or always?) include a mark that > appears on the page, it also contains musical alternatives, so it is not > merely a type of Mark. > > > Not *alternatives*, basically an individual

Re: Ties across voices

2018-06-18 Thread David Kastrup
"Phil Holmes" writes: > - Original Message - > From: "Carl Sorensen" > To: "Simon Albrecht" ; "Shachar Shemesh" > ; > Sent: Monday, June 18, 2018 4:52 PM > Subject: Re: Ties across voices > > >> >> >> On 6/17/18, 12:14 PM, "Simon Albrecht" wrote: >> >>On 16.06.2018 20:41, Shachar

Re: Ties across voices

2018-06-18 Thread Phil Holmes
- Original Message - From: "Carl Sorensen" To: "Simon Albrecht" ; "Shachar Shemesh" ; Sent: Monday, June 18, 2018 4:52 PM Subject: Re: Ties across voices On 6/17/18, 12:14 PM, "Simon Albrecht" wrote: On 16.06.2018 20:41, Shachar Shemesh wrote: > The Tie won't tie between

Re: Ties across voices

2018-06-18 Thread Carl Sorensen
On 6/17/18, 12:14 PM, "Simon Albrecht" wrote: On 16.06.2018 20:41, Shachar Shemesh wrote: > The Tie won't tie between the voices and the chord past the voices. It seems to work if you move the Tie_engraver from Voice to Staff level: I moved Tie_performer along, since

Re: Does \balloonText only work inside chords?

2018-06-18 Thread Urs Liska
Am 18.06.2018 um 14:17 schrieb David Kastrup: Urs Liska writes: ... ... 243: 13 [ly:book-process # #< Output_def> #< Output_def> "unknown"] In unknown file: ?: 14* [# #] ?: 15* [# # #] ?: 16* [# # # #] ERROR: In procedure symbol->string: ERROR: Wrong type argument in p

Re: Binary Search Tree in Scheme

2018-06-18 Thread Urs Liska
Am 18.06.2018 um 13:25 schrieb David Kastrup: Urs Liska writes: Oh my, it's less than a year that I learned and successfully completed programming assignments on all of these - and already it's so far away ... Of course I was aware that I'd actually need some regular practice to keep these

Re: Does \balloonText only work inside chords?

2018-06-18 Thread David Kastrup
Urs Liska writes: > Am 18.06.2018 um 11:56 schrieb Urs Liska: >> <... snip discussion of documentation...> >> >> 2) Additionally, it seems that \balloonText only works within >> chords, which seems sort-of strange to me >> >> Modified from an example in NR 1.7.2: >> >> \version "2.19.80" >> >> \n

Re: Does \balloonText only work inside chords?

2018-06-18 Thread Urs Liska
Am 18.06.2018 um 11:56 schrieb Urs Liska: <... snip discussion of documentation...> 2) Additionally, it seems that \balloonText only works within chords, which seems sort-of strange to me Modified from an example in NR 1.7.2: \version "2.19.80" \new Voice \with { \consists "Balloon_en

Re: Does \balloonText only work inside chords?

2018-06-18 Thread Urs Liska
Am 18.06.2018 um 12:31 schrieb David Kastrup: David Kastrup writes: Urs Liska writes: According to NR 1.7.2 \balloonText is "used like \tweak, typically within chords, to attach text to an individual note." I have two questions to this: The documentation is ridiculous. I don't remember

Re: Binary Search Tree in Scheme

2018-06-18 Thread David Kastrup
Urs Liska writes: > Oh my, it's less than a year that I learned and successfully completed > programming assignments on all of these - and already it's so far away > ... > Of course I was aware that I'd actually need some regular practice to > keep these things fresh and get to a more thorough un

Re: Binary Search Tree in Scheme

2018-06-18 Thread Urs Liska
Am 18.06.2018 um 11:41 schrieb Jan-Peter Voigt: Am 18.06.2018 um 11:16 schrieb Urs Liska: Am 18.06.2018 um 10:57 schrieb Jan-Peter Voigt: Hi Urs, there are self balancing trees like AVL or Red-Black, but I'd say implementation cost is quite for this purpose to sort n<1000 elements. I mi

Re: Binary Search Tree in Scheme

2018-06-18 Thread Urs Liska
Hi David, Am 18.06.2018 um 12:25 schrieb David Kastrup: Urs Liska writes: Hi all, as you know I'm currently reviewing the scholarLY package, not only for new features but also for its coding - which blatantly shows how it was initially done directly from within my learning curve ;-) One th

Re: Does \balloonText only work inside chords?

2018-06-18 Thread David Kastrup
David Kastrup writes: > Urs Liska writes: > >> According to NR 1.7.2 \balloonText is "used like \tweak, typically >> within chords, to attach text to an individual note." I have two >> questions to this: > > The documentation is ridiculous. I don't remember the details but > basically footnotes

Re: Does \balloonText only work inside chords?

2018-06-18 Thread David Kastrup
Urs Liska writes: > According to NR 1.7.2 \balloonText is "used like \tweak, typically > within chords, to attach text to an individual note." I have two > questions to this: The documentation is ridiculous. I don't remember the details but basically footnotes were previously done similar and r

Re: Binary Search Tree in Scheme

2018-06-18 Thread David Kastrup
Urs Liska writes: > Hi all, > > as you know I'm currently reviewing the scholarLY package, not only > for new features but also for its coding - which blatantly shows how > it was initially done directly from within my learning curve ;-) > > One thing I'd like to change is the storage/handling of

Does \balloonText only work inside chords?

2018-06-18 Thread Urs Liska
According to NR 1.7.2 \balloonText is "used like \tweak, typically within chords, to attach text to an individual note." I have two questions to this: 1) If it were used like \tweak it would affect the element *following after* the command, isn't it? But in 2. (from the NR) the balloon text

Re: Binary Search Tree in Scheme

2018-06-18 Thread Jan-Peter Voigt
Am 18.06.2018 um 11:16 schrieb Urs Liska: Am 18.06.2018 um 10:57 schrieb Jan-Peter Voigt: Hi Urs, there are self balancing trees like AVL or Red-Black, but I'd say implementation cost is quite for this purpose to sort n<1000 elements. I might be wrong, but I'd prefer the sort method. OK,

Re: Binary Search Tree in Scheme

2018-06-18 Thread Urs Liska
Am 18.06.2018 um 10:57 schrieb Jan-Peter Voigt: Hi Urs, there are self balancing trees like AVL or Red-Black, but I'd say implementation cost is quite for this purpose to sort n<1000 elements. I might be wrong, but I'd prefer the sort method. OK, this is why I ask. (I assume with "implemen

Re: Binary Search Tree in Scheme

2018-06-18 Thread Jan-Peter Voigt
Hi Urs, there are self balancing trees like AVL or Red-Black, but I'd say implementation cost is quite for this purpose to sort n<1000 elements. I might be wrong, but I'd prefer the sort method. The EE uses a tree that sorts by measure on the first level, by moment on second and then by the ed

Re: Advice on naming and structuring scholarLY commands

2018-06-18 Thread Urs Liska
Hi Elaine, I was off my PC over the weekend, so I'll only now reply to your post. Am 16.06.2018 um 03:21 schrieb Flaming Hakama by Elaine: -- Forwarded message - From: Urs Liska mailto:li...@openlilylib.org>> Date: Fri, 15 Jun 2018 09:28:05 +0200 Subject: Re: A

Binary Search Tree in Scheme

2018-06-18 Thread Urs Liska
Hi all, as you know I'm currently reviewing the scholarLY package, not only for new features but also for its coding - which blatantly shows how it was initially done directly from within my learning curve ;-) One thing I'd like to change is the storage/handling of annotations. The current i

Binary Search Tree in Scheme

2018-06-18 Thread Urs Liska
Hi all, as you know I'm currently reviewing the scholarLY package, not only for new features but also for its coding - which blatantly shows how it was initially done directly from within my learning curve ;-) One thing I'd like to change is the storage/handling of annotations. The current i