I agree that relying on the rendering order for incremental disambiguation is
not a great solution.
Note that there is one situation where we have something similar, which is the
<substitute> element, that tries each child in order. In a way, that might be a
saner solution, if not as flexible. For more complex situations, the <if
disambiguate="true"> would have to be quite high up in the rendering tree, and
would look something like this:
<if disambiguate="true">
<text macro="disambiguate1" />
<text macro="disambiguate2" />
<text macro="disambiguate3" />
<text macro="disambiguate4" />
</if>
<else>
<text macro="normal" />
</else>
Charles
On Apr 18, 2013, at 1:33 PM, Frank Bennett <[email protected]> wrote:
> On Thu, Apr 18, 2013 at 6:48 PM, andrea rossato <[email protected]>
> wrote:
>> Frank Bennett <[email protected]> writes:
>>
>>> I've implemented incremental application of disambiguate="true" in
>>> citeproc-js (release 1.0.451). There is a test for it here:
>>>
>>> https://bitbucket.org/bdarcus/citeproc-test/src/tip/processor-tests/humans/disambiguate_IncrementalExtraText.txt?at=default
>>
>>
>> Actually I'm not sure I like this approach because I find it a bit
>> confusing. If "disambiguate" is "true" then it should always evaluate to
>> "true" and so both the title and the edition should be printed. The
>> example is not confusing because all the disambiguate conditionals are
>> grouped together. When coded in macros their order of occurrence may be
>> more difficult to understand and predict, thus becoming a source of
>> possible bugs.
>>
>> I understand that my perception may be due to different coding cultures
>> -- Haskell is a purely functional language and the value of a variable
>> is not going to change depending on the context --, still I wanted to
>> share my perspective.
>>
>> Andrea
>
> No, you're right. This adds elements incrementally from the
> first-occurring to the last (in rendering order), and it would be good
> to have more control over the sequence. That would involve some
> changes to the specification, but could be done.
>
> Shall I move that test out of the suite, pending further discussion of
> the approach? There's no urgency, and it would be good to explore the
> possibilities further.
>
>>
>> ------------------------------------------------------------------------------
>> Precog is a next-generation analytics platform capable of advanced
>> analytics on semi-structured data. The platform includes APIs for building
>> apps and a phenomenal toolset for data science. Developers can use
>> our toolset for easy data analysis & visualization. Get a free account!
>> http://www2.precog.com/precogplatform/slashdotnewsletter
>> _______________________________________________
>> xbiblio-devel mailing list
>> [email protected]
>> https://lists.sourceforge.net/lists/listinfo/xbiblio-devel
>
> ------------------------------------------------------------------------------
> Precog is a next-generation analytics platform capable of advanced
> analytics on semi-structured data. The platform includes APIs for building
> apps and a phenomenal toolset for data science. Developers can use
> our toolset for easy data analysis & visualization. Get a free account!
> http://www2.precog.com/precogplatform/slashdotnewsletter
> _______________________________________________
> xbiblio-devel mailing list
> [email protected]
> https://lists.sourceforge.net/lists/listinfo/xbiblio-devel
--
Charles Parnot
[email protected]
twitter: @cparnot
http://mekentosj.com
------------------------------------------------------------------------------
Precog is a next-generation analytics platform capable of advanced
analytics on semi-structured data. The platform includes APIs for building
apps and a phenomenal toolset for data science. Developers can use
our toolset for easy data analysis & visualization. Get a free account!
http://www2.precog.com/precogplatform/slashdotnewsletter
_______________________________________________
xbiblio-devel mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/xbiblio-devel
