Terje Slettebø <
tslettebo@...> writes:
>>From: "Anthony Williams" <
anthony_w.geo@...>
>
>> Does the boost concept checking library support overloading on concepts,
> so
>> you can have one implementation of an algorithm for random access
> iterators,
>> and another for bidirectional iterators, for example?
>
> As someone was pointed out in another posting, you can't use BCCL for this,
> since the checks fail with a compile error if a concept doesn't match.
> However, if you're able to define compile-time traits performing the concept
> check, then you _can_ overload on concepts, using enable_if. See the Concept
> Traits Library
> (
http://web.archive.org/web/20050428001254/http://neoscientists.org/~tschwin> ger/boostdev/concept_traits/libs/concept_traits/doc/) for an approach to
> this.
Thanks. That's essentially what I was trying to do. I'll see if there's
anything in there I can use.
Anthony
--
Anthony Williams | Just Software Solutions Ltd
Custom Software Development |
http://www.justsoftwaresolutions.co.ukRegistered in England, Company Number 5478976.
Registered Office: 15 Carrallack Mews, St Just, Cornwall, TR19 7UL
_______________________________________________
Unsubscribe & other changes:
http://lists.boost.org/mailman/listinfo.cgi/boost