Boost logo

Boost :

From: AlisdairM (alisdair.meredith_at_[hidden])
Date: 2007-02-27 01:41:33


Note that almost half the licensing and copyright issues are coming out
of the MPL library, and are associated with .rst files.

If the problem that the copyright/license are genuinely missing, or
that the tool needs updating to understand rst format?

AlisdairM

Rene Rivera wrote:

> Problem counts:
> 654 files missing Boost license info or having wrong reference text
> 399 files missing copyright notice
>
> Summary:
> mpl (419)
>
> Details:
> L missing Boost license info, or wrong reference text
> C missing copyright notice

> > mpl|
> libs/mpl/doc/src/refmanual/
> ASSERT.rst: C L
> ASSERT_MSG.rst: C L
> ASSERT_NOT.rst: C L
> ASSERT_RELATION.rst: C L
> AUX_LAMBDA_SUPPORT.rst: C L
> Acknowledgements.rst: C L
> Algorithms-Iteration.rst: C L
> Algorithms-Querying.rst: C L
> Algorithms-Runtime.rst: C L
> Algorithms-Transformation.rst: C L
> Algorithms.rst: C L
> AssociativeSequence.rst: C L
> BackExtensibleSequence.rst: C L
> BidirectionalIterator.rst: C L
> BidirectionalSequence.rst: C L
> CFG_NO_HAS_XXX.rst: C L
> CFG_NO_PREPROCESSED.rst: C L
> Categorized.rst: C L
> Data.rst: C L
> ExtensibleAssociativeSeq.rst: C L
> ExtensibleSequence.rst: C L
> ForwardIterator.rst: C L
> ForwardSequence.rst: C L
> FrontExtensibleSequence.rst: C L
> HAS_XXX_TRAIT_DEF.rst: C L
> HAS_XXX_TRAIT_NAMED_DEF.rst: C L
> Inserter.rst: C L
> IntegralConstant.rst: C L
> IntegralSequenceWrapper.rst: C L
> Iterators-Concepts.rst: C L
> Iterators-Metafunctions.rst: C L
> Iterators.rst: C L
> LIMIT_LIST_SIZE.rst: C L
> LIMIT_MAP_SIZE.rst: C L
> LIMIT_METAFUNCTION_ARITY.rst: C L
> LIMIT_SET_SIZE.rst: C L
> LIMIT_UNROLLING.rst: C L
> LIMIT_VECTOR_SIZE.rst: C L
> LambdaExpression.rst: C L
> Macros-Asserts.rst: C L
> Macros-Configuration.rst: C L
> Macros.rst: C L
> Metafunction.rst: C L
> MetafunctionClass.rst: C L
> Metafunctions-Arithmetic.rst: C L
> Metafunctions-Bitwise.rst: C L
> Metafunctions-Comparisons.rst: C L
> Metafunctions-Composition.rst: C L
> Metafunctions-Conditional.rst: C L
> Metafunctions-Invocation.rst: C L
> Metafunctions-Logical.rst: C L
> Metafunctions-Trivial.rst: C L
> Metafunctions-Type.rst: C L
> Metafunctions.rst: C L
> NumericMetafunction.rst: C L
> PlaceholderExpression.rst: C L
> Placeholders.rst: C L
> RandomAccessIterator.rst: C L
> RandomAccessSequence.rst: C L
> ReversibleAlgorithm.rst: C L
> Sequences-Classes.rst: C L
> Sequences-Concepts.rst: C L
> Sequences-Intrinsic.rst: C L
> Sequences-Views.rst: C L
> Sequences.rst: C L
> TagDispatchedMetafunction.rst: C L
> TrivialMetafunction.rst: C L
> VariadicSequence.rst: C L
> accumulate.rst: C L
> advance.rst: C L
> always.rst: C L
> and_.rst: C L
> apply.rst: C L
> apply_wrap.rst: C L
> arg.rst: C L
> at.rst: C L
> at_c.rst: C L
> back.rst: C L
> back_inserter.rst: C L
> begin.rst: C L
> bind.rst: C L
> bitand_.rst: C L
> bitor_.rst: C L
> bitxor_.rst: C L
> bool_.rst: C L
> clear.rst: C L
> contains.rst: C L
> copy.rst: C L
> copy_if.rst: C L
> count.rst: C L
> count_if.rst: C L
> deque.rst: C L
> deref.rst: C L
> distance.rst: C L
> divides.rst: C L
> empty.rst: C L
> empty_base.rst: C L
> empty_sequence.rst: C L
> end.rst: C L
> equal.rst: C L
> equal_to.rst: C L
> erase.rst: C L
> erase_key.rst: C L
> eval_if.rst: C L
> eval_if_c.rst: C L
> filter_view.rst: C L
> find.rst: C L
> find_if.rst: C L
> fold.rst: C L
> for_each.rst: C L
> front.rst: C L
> front_inserter.rst: C L
> greater.rst: C L
> greater_equal.rst: C L
> has_key.rst: C L
> identity.rst: C L
> if_.rst: C L
> if_c.rst: C L
> inherit.rst: C L
> inherit_linearly.rst: C L
> insert.rst: C L
> insert_range.rst: C L
> inserter_.rst: C L
> int_.rst: C L
> integral_c.rst: C L
> is_sequence.rst: C L
> iter_fold.rst: C L
> iter_fold_if.rst: C L
> iterator_category.rst: C L
> iterator_range.rst: C L
> joint_view.rst: C L
> key_type.rst: C L
> lambda.rst: C L
> less.rst: C L
> less_equal.rst: C L
> list.rst: C L
> list_c.rst: C L
> long_.rst: C L
> lower_bound.rst: C L
> map.rst: C L
> max.rst: C L
> max_element.rst: C L
> min.rst: C L
> min_element.rst: C L
> minus.rst: C L
> modulus.rst: C L
> multiplies.rst: C L
> negate.rst: C L
> next.rst: C L
> not_.rst: C L
> not_equal_to.rst: C L
> numeric_cast.rst: C L
> or_.rst: C L
> order.rst: C L
> pair.rst: C L
> partition.rst: C L
> plus.rst: C L
> pop_back.rst: C L
> pop_front.rst: C L
> preface.rst: C L
> prior.rst: C L
> protect.rst: C L
> push_back.rst: C L
> push_front.rst: C L
> quote.rst: C L
> range_c.rst: C L
> refmanual.py: C L
> remove.rst: C L
> remove_if.rst: C L
> replace.rst: C L
> replace_if.rst: C L
> reverse.rst: C L
> reverse_copy.rst: C L
> reverse_copy_if.rst: C L
> reverse_fold.rst: C L
> reverse_iter_fold.rst: C L
> reverse_partition.rst: C L
> reverse_remove.rst: C L
> reverse_remove_if.rst: C L
> reverse_replace.rst: C L
> reverse_replace_if.rst: C L
> reverse_stable_partition.rst: C L
> reverse_transform.rst: C L
> reverse_unique.rst: C L
> sequence_tag.rst: C L
> set.rst: C L
> set_c.rst: C L
> shift_left.rst: C L
> shift_right.rst: C L
> single_view.rst: C L
> size.rst: C L
> size_t.rst: C L
> sizeof_.rst: C L
> sort.rst: C L
> stable_partition.rst: C L
> terminology.rst: C L
> times.rst: C L
> transform.rst: C L
> transform_view.rst: C L
> unique.rst: C L
> unpack_args.rst: C L
> upper_bound.rst: C L
> value_type.rst: C L
> vector.rst: C L
> vector_c.rst: C L
> void_.rst: C L
> zip_view.rst: C L
> libs/mpl/doc/
> style.css: L
> libs/mpl/example/fsm/
> README.txt: C L
> libs/mpl/test/
> Jamfile.v2: C L


Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk