Re: [boost] Boost boo-boos

2003-01-09 Thread Beman Dawes
At 09:53 AM 1/9/2003, William E. Kempf wrote:
>> From: Beman Dawes <[EMAIL PROTECTED]>
>>
>> I written a C++ program to inspect the Boost directory tree looking for 

>> various problems. The program is in CVS - see boost-root/tools/inspect.
>> It replaces a hodge-podge of scripts written in three or four other
>> languages, and should be much easier to maintain. It can be used by
>> developers to see if potential additions have problems.
>
>Great.  Have you, or can you, write some documentation on this?

I've already added boost-root/tools/inspect/index.html (in CVS for
a day or two now.)  It is pretty minimal, but the program is pretty 
minimal.  It takes no arguments and is pretty easy to run. A Jamfile is 
provided to build it.

I also added a "Tools" entry in the homepage left column, linking to an 
overall boost-root/tools index page, so that as tools get added there is a 
place for links to their documentation.

--Beman


___
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost


Re: [boost] Boost boo-boos

2003-01-09 Thread William E. Kempf
> From: Beman Dawes <[EMAIL PROTECTED]>
> 
> I written a C++ program to inspect the Boost directory tree looking for 
> various problems. The program is in CVS - see boost-root/tools/inspect. It 
> replaces a hodge-podge of scripts written in three or four other languages, 
> and should be much easier to maintain. It can be used by developers to see 
> if potential additions have problems.

Great.  Have you, or can you, write some documentation on this?
 


William E. Kempf
[EMAIL PROTECTED]

___
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost



[boost] Boost boo-boos

2003-01-09 Thread Beman Dawes
I written a C++ program to inspect the Boost directory tree looking for 
various problems. The program is in CVS - see boost-root/tools/inspect. It 
replaces a hodge-podge of scripts written in three or four other languages, 
and should be much easier to maintain. It can be used by developers to see 
if potential additions have problems.

See output below. Here are the counts:

4926 files scanned
390 directories scanned
305 problems reported

problem counts:
  60 files with tabs
  15 file names too long
  2 bookmarks with invalid characters
  85 invalid urls
  121 broken links
  22 unlinked files

I'd appreciate it if developers could fix any problems identified in their 
libraries.

Cheers,

--Beman

any
   libs/any/test.hpp: tabs in file

build
   tools/build/boost_build_v2.html: broken link: features_properties, 
broken link: link_compatibility, unlinked file
   tools/build/examples-v2/make/Jamfile: tabs in file
   tools/build/test/project-test1/dir2/Jamfile: tabs in file
   tools/build/test/test_system.html: unlinked file

concept_check
   libs/concept_check/stl_concept_covering.cpp: tabs in file

config
   libs/config/config.htm: broken link: user.hpp
   libs/config/test/boost_no_ded_typename.cxx: tabs in file

conversion
   libs/conversion/test.hpp: tabs in file

date_time
   boost/date_time/c_local_time_adjustor.hpp: tabs in file
   boost/date_time/wrapping_int.hpp: tabs in file
   libs/date_time/build/Jamfile: tabs in file
   libs/date_time/doc/class_greg_base_facet.html: unlinked file
   libs/date_time/example/gregorian/localization.cpp: tabs in file
   libs/date_time/test/gregorian/testdate_iterator.cpp: tabs in file

detail
   boost/detail/dynamic_bitset.hpp: tabs in file

dynamic_bitset
   boost/dynamic_bitset.hpp: tabs in file
   libs/dynamic_bitset/bitset_test.hpp: tabs in file
   libs/dynamic_bitset/dyn_bitset_unit_tests1.cpp: tabs in file

graph
   boost/graph/dijkstra_shortest_paths.hpp: tabs in file
   boost/graph/graph_as_tree.hpp: tabs in file
   boost/graph/johnson_all_pairs_shortest.hpp: tabs in file
   boost/graph/relax.hpp: tabs in file
   boost/graph/transitive_closure.hpp: tabs in file
   boost/graph/undirected_dfs.hpp: tabs in file
   libs/graph/build/Jamfile: tabs in file
   libs/graph/doc/Buffer.html: broken link: 
../../boost/pending/mutable_queue.hpp
   libs/graph/example/filtered_graph_edge_range.cpp: tabs in file
   libs/graph/example/graph_as_tree.cpp: tabs in file
   libs/graph/example/iohb.c: tabs in file
   libs/graph/example/undirected_dfs.cpp: tabs in file
   libs/graph/src/graphviz_parser.h: tabs in file
   libs/graph/test/adj_list_test.cpp: tabs in file
   libs/graph/test/bellman-test.cpp: tabs in file
   libs/graph/test/johnson-test.cpp: tabs in file

lambda
   boost/lambda/detail/member_ptr.hpp: tabs in file
   libs/lambda/doc/lambda_docs_as_one_file.html: unlinked file

libs
   libs: unlinked file

math
   libs/math/Jamfile: tabs in file

more
   more: unlinked file
   more/download.html: broken link: ../boost_all.tar.gz, broken link: 
../boost_all.zip
   more/writingdoc/design.html: broken link: template%5Coverview.html
   more/writingdoc/introduction.html: broken link: index.htm
   more/writingdoc/structure.html: broken link: index.htm

mpl
   boost/mpl/if.hpp: tabs in file
   boost/mpl/remove_if.hpp: tabs in file
   libs/mpl/doc/ref/Reference/advance.html: broken link: 
../Reference.html, invalid URL: ../../../../../\boost/mpl/advance.hpp

(many similar removed for brevity)

multi_array
   libs/multi_array/doc/reference.html: broken link: 
./iterator_categories.html#concept_RandomAccessTraversalIterator, broken 
link: ./iterator_categories.html#concept_ReadableIterator, broken link: 
./iterator_categories.html#concept_WritableIterator
   libs/multi_array/doc/user.html: broken link: 
../../array_traits/index.html

numeric
   boost/numeric/ublas/matrix_sparse.hpp: tabs in file
   boost/numeric/ublas/vector_sparse.hpp: tabs in file
   libs/numeric/ublas/Jamfile: tabs in file

pool
   boost/pool/detail/mutex.hpp: tabs in file

preprocessor
   libs/preprocessor/doc/blank.html: unlinked file
   libs/preprocessor/doc/headers.html: broken link: 
headers/wstringize.hpp.html
   libs/preprocessor/doc/headers/enum_params_with_a_default.hpp.html: 
filename > 31 chars
   libs/preprocessor/doc/headers/enum_params_with_defaults.hpp.html: 
filename > 31 chars
   libs/preprocessor/doc/headers/list/to_tuple.hpp.html: broken link: 
../../ref/to_tuple.html, broken link: ../../ref/to_tuple_r.html
   libs/preprocessor/doc/headers/repetition/enum_params_with_a_default.hpp.html: 
filename > 31 chars
   libs/preprocessor/doc/headers/repetition/enum_params_with_defaults.hpp.html: 
filename > 31 chars
   libs/preprocessor/doc/headers/repetition/enum_trailing_binary_params.hpp.html: 
filename > 31 chars
   libs/preprocessor/doc/ref.html: broken link: ref/wstringize.html
   libs/preprocessor/doc/ref/bool.html: broken link: bool.hpp
   libs/preprocessor/doc/ref/enum_trailing_binary_params.h