July 2006 - Boost - lists.preview.boost.org

[Boost-bugs] [ boost-Support Requests-1518639 ] Support Request for Borland C++Builder 2006 ( BDS 2006)
by SourceForge.net 07 Jul '06

07 Jul '06

Support Requests item #1518639, was opened at 2006-07-07 12:07 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1518639&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: Building Boost Group: None Status: Open Resolution: None Priority: 5 Submitted By: Tobias Besch (allgaeu_tobias) Assigned to: Nobody/Anonymous (nobody) Summary: Support Request for Borland C++Builder 2006 ( BDS 2006) Initial Comment: I'd like to request support for the Borland C++Builder 2006 of the Borland Developer Studio 2006 (BDS 2006). ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1518639&group_… Using Tomcat but need to do more? Need to support web services, security? Get stuff done quickly with pre-integrated technology to make your job easier Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

UTF Ranges
by Sean Parent 07 Jul '06

07 Jul '06

On Jul 5, 2006, at 10:15 PM, boost-request(a)lists.boost.org wrote: > std::string s = get_some_utf_8_xml_data(); > > utf_range r = boost::find(utf_range(s), UL0x0000FEFF); > > assert(*r.begin().base() == U0xEF); Not sure why find would return a range - but so long as I can also use it with standard algorithms, and it generates efficient code I'm happy. Sean

2 1

[Boost-bugs] [ boost-Bugs-1518563 ] Shmem serious bugs
by SourceForge.net 07 Jul '06

07 Jul '06

Bugs item #1518563, was opened at 2006-07-07 01:08 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1518563&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: Shmem serious bugs Initial Comment: Hi, these are the 2 things I have found so far using the shmem lib. My understading is that this is not yet a boost library but it has been accepted to become one in the near future. Accept my apologies if I shouldnÂ´t had posted here. 1) If you try to use a node allocator with a fixed_named_shared_object it won't compile. Works fine for non fixed segments. 2) If you concatenate with the '+=' operator a boost::string with a NULL terminated str (char *) in a loop up to N times, you get bad_alloc sooner than if you do a single allocation of the same lenght of the N previous allocations. So concatenating is wasting memory somehow, as you can allocate longer strings with a single allocation than with N equivalent concatenations. Thanks. (bblasi at jblasi dot com) ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1518563&group_… Using Tomcat but need to do more? Need to support web services, security? Get stuff done quickly with pre-integrated technology to make your job easier Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

Boost regression notification (2006-07-05 [RC_1_34_0])
by Douglas Gregor 07 Jul '06

07 Jul '06

Boost Regression test failures Report time: 2006-07-05T11:03:50Z This report lists all regression test failures on release platforms. Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/i… 519 failures in 34 libraries algorithm/string (2) concept_check (1) conversion (1) filesystem (3) graph (6) integer (2) io (1) iostreams (60) iterator (1) lambda (2) math (5) mpl (20) numeric/conversion (4) numeric/interval (1) numeric/ublas (6) optional (2) parameter (33) pool (2) program_options (19) python (90) random (1) rational (5) serialization (117) signals (12) smart_ptr (1) spirit (12) test (8) thread (1) tr1 (77) type_traits (11) typeof (9) utility (2) utility/enable_if (1) wave (1) |algorithm/string| find: msvc-8.0 replace: vc-7_1-stlport |concept_check| class_concept_check_test: vc-7_1-stlport |conversion| lexical_cast_test: sun-5.8 |filesystem| fstream_test: sun-5.8 mbcopy: sun-5.8 wide_test: sun-5.8 |graph| adjacency_matrix_test: vc-7_0 bidir_remove_edge: vc-7_0 csr_graph_test: sun-5.8 graphviz_test: msvc-8.0 msvc-8.0 vc-7_1-stlport |integer| integer_traits_test: qcc-3.3.5_gpp qcc-3.3.5_gpp |io| ios_state_unit_test: gcc-4.1.0_linux_x86_64 |iostreams| array_test: vc-6_5 auto_close_test: sun-5.8 vc-6_5 buffer_size_test: sun-5.8 vc-6_5 bzip2_test: msvc-7.1 msvc-8.0 sun-5.8 code_converter_test: sun-5.8 vc-6_5 component_access_test: sun-5.8 vc-6_5 compose_test: borland-5_6_4 sun-5.8 vc-6_5 copy_test: vc-6_5 counter_test: sun-5.8 vc-6_5 direct_adapter_test: vc-6_5 example_test: vc-6_5 vc-6_5-stlport file_descriptor_test: vc-6_5 file_test: vc-6_5 filtering_stream_test: sun-5.8 vc-6_5 finite_state_filter_test: cw-9.4 sun-5.8 flush_test: sun-5.8 vc-6_5 gzip_test: msvc-7.1 msvc-8.0 sun-5.8 invert_test: vc-6_5 line_filter_test: sun-5.8 vc-6_5 mapped_file_test: vc-6_5 newline_test: sun-5.8 vc-6_5 null_test: vc-6_5 pipeline_test: sun-5.8 vc-6_5 positioning_test: vc-6_5 regex_filter_test: sun-5.8 vc-6_5 restrict_test: sun-5.8 vc-6_5 seekable_file_test: sun-5.8 vc-6_5 seekable_filter_test: sun-5.8 vc-6_5 stdio_filter_test: sun-5.8 vc-6_5 symmetric_filter_test: sun-5.8 vc-6_5 tee_test: sun-5.8 vc-6_5 wide_stream_test: sun-5.8 vc-6_5 zlib_test: msvc-7.1 msvc-8.0 |iterator| is_lvalue_iterator: sun-5.8 |lambda| extending_rt_traits: sun-5.8 operator_tests_simple: sun-5.8 |math| octonion_test: sun-5.8 quaternion_mult_incl_test: sun-5.8 quaternion_test: sun-5.8 vc-7_1-stlport special_functions_test: sun-5.8 |mpl| apply: gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc sun-5.8 count: sun-5.8 count_if: sun-5.8 equal: sun-5.8 erase: sun-5.8 find: sun-5.8 insert: sun-5.8 insert_range: sun-5.8 lambda_args: sun-5.8 multiset: gcc-3.4.5_linux_x86_64 gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc gcc-4_0_3_tru64 partition: sun-5.8 stable_partition: sun-5.8 vector_c: sun-5.8 |numeric/conversion| converter_test: borland-5_8_2 traits_test: borland-5_8_2 udt_example_0: borland-5_8_2 udt_support_test: borland-5_8_2 |numeric/interval| det: sun-5.8 |numeric/ublas| concepts: vc-7_1-stlport test1: vc-7_1-stlport test2: vc-7_1-stlport test4: vc-7_1-stlport test5: vc-7_1-stlport vc-7_1-stlport |optional| optional_test: sun-5.8 optional_test_ref: sun-5.8 |parameter| basics: borland-5_6_4 borland-5_8_2 sun-5.8 duplicates: borland-5_6_4 borland-5_8_2 earwicker: borland-5_6_4 borland-5_8_2 macros: borland-5_6_4 borland-5_8_2 sun-5.8 maybe: vc-6_5 vc-6_5-stlport vc-7_0 mpl: borland-5_6_4 borland-5_8_2 preprocessor: borland-5_6_4 borland-5_8_2 sun-5.8 vc-6_5 vc-6_5-stlport python-parameter-test: vc-6_5 vc-6_5-stlport vc-7_0 sfinae: borland-5_6_4 borland-5_8_2 vc-6_5-stlport singular: borland-5_6_4 borland-5_8_2 unnamed: borland-5_6_4 borland-5_8_2 unnamed_fail: vc-6_5 vc-6_5-stlport vc-7_0 |pool| test_pool_alloc: qcc-3.3.5_cpp qcc-3.3.5_cpp |program_options| cmdline_test: sun-5.8 cmdline_test_dll: cw-9.4 sun-5.8 options_description_test: sun-5.8 options_description_test_dll: cw-9.4 sun-5.8 parsers_test: sun-5.8 parsers_test_dll: cw-9.4 sun-5.8 positional_options_test: sun-5.8 positional_options_test_dll: cw-9.4 sun-5.8 unicode_test_dll: borland-5_8_2 cw-9.4 variable_map_test: sun-5.8 variable_map_test_dll: borland-5_8_2 cw-9.4 sun-5.8 winmain_dll: cw-9.4 |python| andreas_beyer: sun-5.8 args: sun-5.8 auto_ptr: sun-5.8 back_reference: sun-5.8 bases: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux sun-5.8 ben_scott1: sun-5.8 bienstman1: sun-5.8 bienstman2: sun-5.8 bienstman3: sun-5.8 borrowed: sun-5.8 callbacks: sun-5.8 const_argument: sun-5.8 crossmod_exception: sun-5.8 data_members: sun-5.8 defaults: sun-5.8 dict: sun-5.8 docstring: sun-5.8 enum: sun-5.8 exception_translator: sun-5.8 exec: cw-9.4 darwin-4.0.1 gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_gpp sun-5.8 extract: sun-5.8 implicit: sun-5.8 indirect_traits_test: sun-5.8 injected: sun-5.8 iterator: sun-5.8 keywords: sun-5.8 list: sun-5.8 long: sun-5.8 minimal: sun-5.8 multi_arg_constructor: sun-5.8 nested: sun-5.8 numpy: sun-5.8 object: sun-5.8 object_manager: sun-5.8 opaque: sun-5.8 operators: sun-5.8 pearu1: sun-5.8 pickle1: sun-5.8 pickle2: sun-5.8 pickle3: sun-5.8 pickle4: sun-5.8 pointee: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux sun-5.8 pointer_type_id_test: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux sun-5.8 pointer_vector: sun-5.8 polymorphism: sun-5.8 polymorphism2: sun-5.8 polymorphism2_auto_ptr: sun-5.8 properties: sun-5.8 raw_ctor: sun-5.8 return_arg: sun-5.8 select_arg_to_python_test: sun-5.8 select_from_python_test: darwin-4.0.1 qcc-3.3.5_cpp qcc-3.3.5_gpp sun-5.8 select_holder: sun-5.8 shared_ptr: sun-5.8 slice: sun-5.8 staticmethod: sun-5.8 stl_iterator: sun-5.8 str: sun-5.8 string_literal: sun-5.8 test_pointer_adoption: sun-5.8 try: sun-5.8 tuple: sun-5.8 upcast: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux sun-5.8 vector_indexing_suite: sun-5.8 virtual_functions: sun-5.8 voidptr: sun-5.8 wrapper_held_type: sun-5.8 |random| random_test: intel-linux-9.0 |rational| rational_test: borland-5_6_4 sun-5.8 vc-6_5 vc-6_5-stlport vc-7_0 |serialization| test_array_text_warchive_dll: msvc-8.0 test_array_xml_warchive_dll: msvc-8.0 test_binary_text_warchive_dll: msvc-8.0 test_binary_xml_warchive_dll: msvc-8.0 test_class_info_save_text_warchive_dll: msvc-8.0 test_class_info_save_xml_warchive_dll: msvc-8.0 test_codecvt_null: qcc-3.3.5_gpp qcc-3.3.5_gpp test_contained_class_text_warchive_dll: msvc-8.0 test_contained_class_xml_warchive_dll: msvc-8.0 test_cyclic_ptrs_text_warchive_dll: msvc-8.0 test_cyclic_ptrs_xml_warchive_dll: msvc-8.0 test_delete_pointer_text_warchive_dll: msvc-8.0 test_delete_pointer_xml_warchive_dll: msvc-8.0 test_demo_fast_archive: sun-5.8 test_demo_fast_archive_dll: sun-5.8 test_demo_portable_archive_dll: vc-6_5 test_deque_text_warchive_dll: msvc-8.0 test_deque_xml_warchive_dll: msvc-8.0 test_derived_class_ptr_text_warchive_dll: msvc-8.0 test_derived_class_ptr_xml_warchive_dll: msvc-8.0 test_derived_class_text_warchive_dll: msvc-8.0 test_derived_class_xml_warchive_dll: msvc-8.0 test_derived_text_warchive_dll: msvc-8.0 test_derived_xml_warchive_dll: msvc-8.0 test_diamond_text_warchive_dll: msvc-8.0 test_diamond_xml_warchive_dll: msvc-8.0 test_exported_text_warchive_dll: msvc-8.0 test_exported_xml_warchive_dll: msvc-8.0 test_list_ptrs_text_warchive_dll: msvc-8.0 test_list_ptrs_xml_warchive_dll: msvc-8.0 test_list_text_warchive_dll: msvc-8.0 test_list_xml_warchive_dll: msvc-8.0 test_map_text_warchive_dll: msvc-8.0 test_map_xml_warchive_dll: msvc-8.0 test_mi_text_warchive_dll: msvc-8.0 test_mi_xml_warchive_dll: msvc-8.0 test_multiple_ptrs_text_warchive_dll: msvc-8.0 test_multiple_ptrs_xml_warchive_dll: msvc-8.0 test_no_rtti_text_warchive_dll: msvc-8.0 test_no_rtti_xml_warchive_dll: msvc-8.0 test_non_default_ctor2_text_archive: qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_archive_dll: qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive: qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive_dll: msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_xml_warchive_dll: msvc-8.0 test_non_default_ctor_text_warchive_dll: msvc-8.0 test_non_default_ctor_xml_warchive_dll: msvc-8.0 test_non_intrusive_text_warchive_dll: msvc-8.0 test_non_intrusive_xml_warchive_dll: msvc-8.0 test_null_ptr_text_warchive_dll: msvc-8.0 test_null_ptr_xml_warchive_dll: msvc-8.0 test_nvp_text_warchive_dll: msvc-8.0 test_nvp_xml_warchive_dll: msvc-8.0 test_object_text_warchive_dll: msvc-8.0 test_object_xml_warchive_dll: msvc-8.0 test_optional_text_warchive_dll: msvc-8.0 test_optional_xml_warchive_dll: msvc-8.0 test_polymorphic_text_warchive_dll: msvc-8.0 test_polymorphic_xml_warchive_dll: msvc-8.0 test_primitive_text_warchive_dll: msvc-8.0 test_primitive_xml_warchive_dll: msvc-8.0 test_recursion_text_warchive_dll: msvc-8.0 test_recursion_xml_warchive_dll: msvc-8.0 test_registered_text_warchive_dll: msvc-8.0 test_registered_xml_warchive_dll: msvc-8.0 test_reset_object_address: vc-7_0 test_reset_object_address_dll: vc-7_0 test_set_text_warchive_dll: msvc-8.0 test_set_xml_warchive_dll: msvc-8.0 test_shared_ptr_132_binary_archive: sun-5.8 test_shared_ptr_132_binary_archive_dll: sun-5.8 test_shared_ptr_132_text_archive: sun-5.8 test_shared_ptr_132_text_archive_dll: sun-5.8 test_shared_ptr_132_text_warchive: sun-5.8 test_shared_ptr_132_text_warchive_dll: msvc-8.0 sun-5.8 test_shared_ptr_132_xml_archive: sun-5.8 test_shared_ptr_132_xml_archive_dll: sun-5.8 test_shared_ptr_132_xml_warchive: sun-5.8 test_shared_ptr_132_xml_warchive_dll: msvc-8.0 sun-5.8 test_shared_ptr_text_warchive_dll: msvc-8.0 test_shared_ptr_xml_warchive_dll: gcc-4.1.0_linux_x86_64 msvc-8.0 test_simple_class_binary_archive_dll: vc-6_5 test_simple_class_ptr_text_warchive_dll: msvc-8.0 test_simple_class_ptr_xml_warchive_dll: msvc-8.0 test_simple_class_text_archive_dll: vc-6_5 test_simple_class_text_warchive_dll: msvc-8.0 vc-6_5 test_simple_class_xml_archive_dll: vc-6_5 test_simple_class_xml_warchive_dll: msvc-8.0 vc-6_5 test_split_text_warchive_dll: msvc-8.0 test_split_xml_warchive_dll: msvc-8.0 test_tracking_text_warchive_dll: msvc-8.0 test_tracking_xml_warchive_dll: msvc-8.0 test_unregistered_text_warchive_dll: msvc-8.0 test_unregistered_xml_warchive_dll: msvc-8.0 test_utf8_codecvt: qcc-3.3.5_gpp qcc-3.3.5_gpp test_variant_text_warchive_dll: msvc-8.0 test_variant_xml_archive: borland-5_8_2 test_variant_xml_archive_dll: borland-5_8_2 test_variant_xml_warchive: borland-5_8_2 test_variant_xml_warchive_dll: borland-5_8_2 msvc-8.0 test_vector_text_archive: gcc-3.4.5_linux_x86_64 test_vector_text_archive_dll: gcc-3.4.5_linux_x86_64 test_vector_text_warchive_dll: msvc-8.0 test_vector_xml_warchive_dll: msvc-8.0 |signals| dead_slot_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp trackable_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp |smart_ptr| shared_ptr_delete_fail: sun-5.8 |spirit| bug_fixes: sun-5.8 bug_fixes_debug: sun-5.8 char_strings_test: sun-5.8 char_strings_test_debug: sun-5.8 epsilon_tests: sun-5.8 epsilon_tests_debug: sun-5.8 file_iterator_tests: sun-5.8 file_iterator_tests_debug: sun-5.8 if_p_as_parser_tests: sun-5.8 mix_and_match_trees: sun-5.8 scanner_value_type_tests: intel-linux-9.0 while_p_as_parser_tests: sun-5.8 |test| basic_cstring_test: sun-5.8 boost_check_equal_str: sun-5.8 foreach_test: sun-5.8 ifstream_line_iterator_test: sun-5.8 output_test_stream_test: sun-5.8 parameterized_test_test: vc-6_5 vc-6_5-stlport token_iterator_test: sun-5.8 |thread| test_thread: msvc-8.0 |tr1| run_complex_overloads: vc-7_0 run_random: sun-5.8 vc-7_0 std_run_complex_overloads: sun-5.8 vc-7_0 std_run_random: sun-5.8 vc-7_0 std_test_array: vc-7_0 std_test_array_tricky: vc-7_0 std_test_bind: darwin-4.0.1 sun-5.8 vc-7_0 std_test_complex: sun-5.8 vc-7_0 std_test_function: sun-5.8 vc-7_0 std_test_hash: qcc-3.3.5_gpp qcc-3.3.5_gpp sun-5.8 std_test_mem_fn: sun-5.8 std_test_random: sun-5.8 vc-7_0 std_test_reference_wrapper: sun-5.8 vc-7_0 std_test_regex: vc-7_0 std_test_result_of: sun-5.8 vc-7_0 std_test_shared_ptr: sun-5.8 vc-7_0 std_test_tuple: sun-5.8 vc-7_0 std_test_tuple_tricky: sun-5.8 vc-7_0 std_test_type_traits: sun-5.8 vc-7_0 test_array: vc-7_0 test_array_tricky: vc-7_0 test_bind: darwin-4.0.1 vc-7_0 test_boost: vc-7_1-stlport test_complex: vc-7_0 test_function: vc-7_0 test_hash: qcc-3.3.5_gpp qcc-3.3.5_gpp vc-7_1-stlport test_random: sun-5.8 vc-7_0 vc-7_1-stlport test_reference_wrapper: vc-7_0 test_regex: vc-7_0 vc-7_1-stlport test_result_of: vc-7_0 test_shared_ptr: vc-7_0 test_tuple: vc-7_0 test_tuple_tricky: vc-7_0 test_type_traits: sun-5.8 vc-7_0 tr1_aligned_storage_test: vc-7_0 tr1_extent_test: sun-5.8 tr1_is_abstract_test: sun-5.8 tr1_is_array_test: vc-7_0 tr1_is_const_test: vc-7_0 tr1_is_empty_test: sun-5.8 tr1_is_floating_point_test: vc-7_0 tr1_is_function_test: sun-5.8 tr1_is_integral_test: vc-7_0 tr1_is_member_func_test: sun-5.8 tr1_is_member_obj_test: sun-5.8 tr1_is_object_test: sun-5.8 tr1_is_reference_test: sun-5.8 vc-7_0 tr1_is_void_test: vc-7_0 tr1_is_volatile_test: vc-7_0 tr1_rank_test: sun-5.8 tr1_tricky_function_type_test: sun-5.8 vc-7_0 tr1_tricky_partial_spec_test: vc-7_0 |type_traits| decay_test: sun-5.8 extent_test: sun-5.8 is_abstract_test: sun-5.8 is_empty_test: sun-5.8 is_function_test: sun-5.8 is_member_func_test: sun-5.8 is_member_obj_test: sun-5.8 is_object_test: sun-5.8 is_reference_test: sun-5.8 rank_test: sun-5.8 tricky_function_type_test: sun-5.8 |typeof| function_binding_emulation: sun-5.8 function_binding_native: vc-6_5 vc-6_5-stlport vc-7_0 nested_typedef_emulation: cw-9.4 odr_no_uns: vc-6_5 vc-6_5-stlport vc-7_0 template_tpl_emulation: sun-5.8 |utility| addressof_test: sun-5.8 operators_test: gcc-3.4.5_linux_x86_64 |utility/enable_if| lazy: sun-5.8 |wave| test_re2c_lexer: sun-5.8

2 1

Comment on string / unicode discussion
by Sean Parent 07 Jul '06

07 Jul '06

I don't have enough time to delve deeply into this thread but I thought I'd make a few passing comments. Adobe has a fairly major string class problem (we joke that every project must have it's own string class - which is nearly true). There isn't such thing as a single type of string - there are _many_ purposes and you need to be able to handle things like language and style runs and large, large blocks of text with efficient edits, UI substations (which are aware of things like split negation and masculine/feminine forms), language based ordering, different encodings... We need another string class like a hole in the head. What we do need - are good standard algorithms which can be applied to any string class. I believe this is doable with the current iterator interface. I believe it's possible (meaning I've done some quick experiments) to define an input iterator (actually as strong as a non-mutating forward iterator) and output iterator, which do conversions. This means that you can define operations in terms of unicode encoding (though some operations such as ordering may still require a locale). Consider - to_lower(first, last, output) to_upper(first, last, output) such transformations can work with any encoding (you can uppercase UTF-8 into UTF-32). They can't work in-situ (but I don't think to_upper or to_lower really can work in-situ - certainly not in UTF-8 and probably not in UTF-16, and I believe there are some multi- character forms that even break in UTF-32...). It is possible though to wrap them with a replace function for in-place operations. The current std::find() will work with such iterator adapters to find single UTF-32 character (in any encoded sequence). Currently with ASL we're taking such an approach for localization strings (replacing an existing string class for localized strings at Adobe with a small set of functions and _any_ string class (any sequence of code units), including std::string, std::vector (or deque or list). You might take a look here for some ideas: <http:// opensource.adobe.com/group__asl__xstring.html>. Sean

6 15

Adobe Source Libraries, GIL, and Boost
by Sean Parent 07 Jul '06

07 Jul '06

Lubomir pointed me at the GIL thread on the list - and I wanted to make a few comments about how I see the relationship between Boost and ASL. The charter for Boost is to vet libraries for possible inclusion in the standard. The charter for ASL is to explore the use of generic and declarative techniques to develop large applications. Our goal is to replace 85% of the imperative code being developed with small declarative constructs. Certainly there is going to be some overlap between the two project and ASL makes _heavy_ use of Boost and borrows ideas from Boost quite freely. For parts of ASL, inclusion into Boost makes perfect sense - and we try to actively defer to Boost when a Boost library can meet our needs. Boost certainly has a significantly larger user base than ASL and far more active developers (anyone interested in helping out ASL???). I _really_ wish that I had enough time/resources on my team to take some parts of ASL and contribute them to Boost. However, my teams focus currently needs to stay on the higher level libraries (which I don't think are ready for Boost yet) and we simply can't afford the time to go through the submission process. But I'm 100% supportive of Lubomir's contribution of GIL (Lubomir is not on my team, and I'm thrilled that he can take the time for this submission to Boost - just I'm I'm thrilled that we were able to release it as part of ASL). GIL is a very significant piece of work. I will also support anyone who would like to borrow portions of ASL to contribute them to Boost. Some libraries that I think would be interesting to get into Boost with some comments about what I see as still needing to be done. --- Forest <http://opensource.adobe.com/group__asl__tutorials__forest.html> I've started to map the concepts from forest into the terminology of BGL <http://opensource.adobe.com/wiki/index.php/ Edge_Interface_For_Forest_Iterators>. There is also some work here about generic algorithms for node based iterators (see the undocumented code for reverse_append here <http:// opensource.adobe.com/reverse_8hpp-source.html>. With a bit more polish I think this could be a _really_ nice collections of node based algorithms and concepts, which could be applied to a single linked list and other pre-traversed structures such as forest. There are also some forest specific algorithms I'd like to see such as the rotate necessary for balancing AVL trees (any forest is a binary tree, and vice versa - see Knuth). Range Based Algorithms (using the boost range library) <http:// opensource.adobe.com/group__standard__extensions.html> I've just started busting these out into separate headers (along the boost style - for example adobe/algorithm/reverse.hpp) - for inclusion in Boost I'd like to see this complete. This would be pretty simple to incorporate into Boost (and they are quite handy!). CMath C99 compatibility <http://opensource.adobe.com/group__cmath.html> There are also some rounding modes which were missing - This seems like a pretty straight forward "grab". ZUIDs <http://opensource.adobe.com/classadobe_1_1zuid__t.html> I'd like to see some review of the platform dependent code which gathers entropy to ensure we're getting enough entropy. A short tutorial would be good. ZUIDs would be a good addition to the serialization library. md5 and SHA code <http://opensource.adobe.com/classadobe_1_1md5__t.html> <http://opensource.adobe.com/group__adobe__sha.html> Review and a short tutorial ONCE <http://opensource.adobe.com/group__adobe__once.html> The STATIC_INSTANCE stuff might be able to be removed - this was done for the Mac where static initializer on DLLs were getting executed on a thread after load so other functions in the compilation unit could be executed concurrently. That may have been fixed (I haven't tracked the issue) - this library would be a good addition to Boost threads. ThreadID <http://opensource.adobe.com/group__asl__thread__id.html> Another good addition to Boost threads. Final <http://opensource.adobe.com/group__adobe__final.html> I don't use inheritance much but this would be a nice addition to Boost utilities. Counter <http://opensource.adobe.com/classadobe_1_1counter__t.html> If boost would surface the lightweight mutex used in shared_ptr - this would go away. (This is a heavyweight one - as I'm counting on Boost providing a lightweight one in the future :-) ). value_t <http://opensource.adobe.com/classadobe_1_1value__t.html> I think there are some nice ideas here which could be stolen for boost::any - value_t also captures equality comparison, makes use of a variant to avoid heap allocations for some common types (I'm not sure but I think boost any does two heap allocations, and value_t never does more than one). regular_object <http://opensource.adobe.com/ classadobe_1_1regular__object.html> This is a generalization of value_t (and boost any) - the idea is to be able to parameters an "any" object by concept. Mat Marcus has been doing a fair amount of work with this library. Needs better docs and tutorial. dictionary_t, array_t, name_t <http://opensource.adobe.com/ group__asl__tutorials__dictionary__t.html> ASL using these heavily to communicate with the runtime languages - could be used as part of the Python bindings (we're currently looking at doing Lua bindings with them. dictionary_t needs a closed hash implementation - there is one in the /future/ directory in ASL inspired by the Lua table structure, I haven't had a chance to compare it in depth to the Google hash implementations. Copy-On-Write <http://opensource.adobe.com/ classadobe_1_1copy__on__write.html> This is a fairly polished library - I've done lots of experimenting with COW (I prefer the term copy-on-modify - but COM confuses everyone...) over the last 10 years or so. This is a nice, simple, and efficient implementations (but it does need a better counter - see above). XML Parser <http://opensource.adobe.com/ classadobe_1_1xml__parser__t.html> This is a subset of an XML parser developed for xstrings. In our upcoming .18 release it has been expanded to support more uses by Eric Berdahl and Foster Brereton. It is designed to be a very efficient parser which pareses in place, and allows for preorder and postorder handling of elements (allowing for inplace substitutions). Needs a fair amount of work still to be a general XML parser - but I'd like to see that happen. --- Wow - that's not a complete list (much longer than I set out to write - I forget how large of a library we've created!). If you're not aware of ASL - it's all released under the MIT license (making it fairly straight forward to get through a code audit). I'd be happy to help out anyone who has the time to prepare some of these libraries (or any other library from ASL) for inclusion in Boost - ASL would also benefit from such an effort. Sean

6 9

[asio][thread] a new model for boost::asio (coroutine)
by 李慧霸 07 Jul '06

07 Jul '06

I have used the recent boost::asio library in my small project, I found it very difficult to correctly write the asynchronous code. So I tried another approach ---- a Half-Sync/Half-Async, I found it much better. The basic idea is very simple, utilize the coroutines(also called light weight threads, or user level threads) to handle multiple connections simultaneously and collaboratively. This approach has the advantange of simplicity in the Synchronous IO model, as well as the high performance in the Asynchronous IO model. Unfortunately, there isn't any coroutine support in boost::thread, and I had to make my experiment with the fiber support in ms windows. So I suggest coroutine be support. The benefit isn't only confined to boost::asio, in fact, it's an important way to describe algorithm flow, and many dynamic languages, both old and new, are supporting this feature. -------------- lihuiba 2006-07-05

3 3

updated cvalarray
by Michael Tegtmeyer 06 Jul '06

06 Jul '06

I have updated the cvalarray tarball in the vault in response to comments. Changes include documentation fixes, minor bug fix, and additional test cases. See the changelog for specifics. Also in response to comments, I will add another document describing this particular implementation. Until then, highlights include: - expression templates for math operations - explicit assignment loop unrolling for small arrays - fundamental type recognition for memcpy for larger arrays Thanks for the comments. As I mentioned to some folks privately, I have no experience with VC++ so if anyone would care to try and compile a test case, I'd be grateful to hear about the experience. Thanks Mike

1 0

Is there interest for iterator based conversion library?
by Alexander A Potocki 06 Jul '06

06 Jul '06

Hi boost community! I would like to propose my iterator based conversion library. It allows declaring and using transformations by following way: std::wstring utf16string(L”some sequence to convert”); typedef cvt::encoder<wchar_t, char> coder_t; coder_t coder = cvt::utf16() >> cvt::utf8(); That piece of code declares converter from wchar_t to char sequences and then instantiate such converter by utf16 to utf8 transformation. Then that converter instance can be used by following way: typedef cvt::convert_input_iterator<coder_t, std::wstring::const_iterator > it_t; - declaration of input iterator std::string result; std::copy( it_t(coder, utf16string.begin(), utf16string.end()), it_t(coder, utf16string.end(), utf16string.end()), std::back_inserter(result) ); Now we have utf8 encoded string in result container. That’s all. Library contains implementation for following transformations/algorithms: utf7, utf8, utf16(be/le), utf32(be, le), Unicode simple folding, base64, rc5(cipher/decipher). Library allows creating pipeline converters, e.g.: typedef cvt::encoder<char, char> coder_t; // char to char sequence transformation coder_t coder = cvt::utf7() >> cvt::utf16() >> cvt::utf8() / cvt::int8() >> cvt::rc5<32,12,8>(key) / cvt::int8() >> cvt::base64(); That expression defines pipeline transformation. Utf7 encoded sequence transforms to utf16 encoded sequence, then to utf8 encoded, then performs rc5 cipher with specified key, then performs base64 encoding. Library can be found at http://sourceforge.net/projects/trotter-cvt/ Alexander Potocki

1 0

Re: [boost] Comment on string / unicode discussion
by Reece Dunn 06 Jul '06

06 Jul '06

Sean Parent wrote: > What we do need - are good standard algorithms which can be applied > to any string class. Agreed. This is where Boost.StringAlgorithms come in. What I am interested in is *efficient* codepage -> codepage conversion. For example, I may want to read a file in that is stored as 8-bit ASCII as UTF8. Likewise, I may want to take UTF8 data and save it as UTF16, MacRoman or some other encoding. What you need is an encoding -> UTF32 converter and a UTF32 -> encoding converter. Ideally, I would like each of these to be as efficient as possible. They should also be able to accept partial data. That is, if I am reading in a UTF8 file in blocks, it is possible to hit the middle of a character. This can be solved in a random access stream by seeking to the previous character, but this is not always possible. Consider: std::basic_ostringstream< uchar32_t > utf; utf.set_locale( utf8_to_utf32_cvt()); // not sure on exact code here std::string utf8 = some_utf8_data(); std::copy( utf8.begin(), utf8.end(), stream_inserter( utf )); The problem with this is that the stringstream type is uchar32_t, but has an *input* character type of char. The conversion mappings are of the form: n source characters -> m destination characters where these may be encoded byte sequences (e.g. UTF8), surrogate pairs (e.g. UTF16) or combining characters (e.g. a + umlaut). I am not sure how good locales are for this kind of functionality and also how good C++ streams are for this. However, it would be nice to have a stream interface (i.e. << and >>). - Reece _________________________________________________________________ Be one of the first to try Windows Live Mail. http://ideas.live.com/programpage.aspx?versionId=5d21c51a-b161-4314-9b0e-49…

2 1