- Boost - lists.preview.boost.org

[units] c++11 features to speed up compilation times
by Oliver Esser 20 Mar '13

20 Mar '13

Hi, I was wondering if there was a policy for boost including C++11 features into the libraries. Obviously there might be many projects out there that do not (yet) have access to a compiler implementing the new standard or choosing not to use such a compiler. Anyways I was looking for a dimensional analysis library for compile time units checking and found Boost.Units to be quite slow at compile time even for the relatively small example code in the quickstart documentation. So I've written a bit of code that follows the approach of Boost.Units but uses C++11 features (constexpr, variadic templates, suffix operator, auto). It is not a complete library that I would use in a production environment, but it looks promising, since compilation times are about a factor 2-3 faster on my machine. It would be great if some of you could take a look. https://github.com/legento/units Maybe one could add an implementation like that to Boost.Units as a C++11 compiler detected feature to speed things up. Maybe I am totally wrong and it is some coincidence that this compiles faster on my platform. I did just minimalistic 'ok it seems to work' testing and was about as thorough with measurements. So see this as an implementation sketch. Regards Oliver

3 2

C++Now 2013 is full [ 53 days before the conference ]
by Marshall Clow 19 Mar '13

19 Mar '13

Whoa. In the immortal words of W.C. Fields, "I expected this, but not so soon" We've set up a wait list in case we get any cancellations. -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

1 0

Re: [boost] [range][iterator] contiguous iterators
by Stefan Strasser 19 Mar '13

19 Mar '13

From [boost-users]: Am 18.03.2013 16:06, schrieb Jeffrey Lee Hellrung, Jr.: > On Sat, Mar 16, 2013 at 7:42 AM, Stefan Strasser <strasser(a)uni-bremen.de > is there any way to generically determine at compiletime whether an > iterator or a boost range refers to contiguous memory? > > is_contiguous<T *>::value == true > is_contiguous<vector<T>::iterator>::value == true > is_contiguous<std::list<T>::iterator>::value == false > AFAIK, not presently, but this has been discussed quite a bit in several > past threads on the Boost developers list. Then I'd like to suggest this again to the maintainers of Boost.Iterator and Boost.Range. I'd also like to suggest another addition to Boost.Range: a RangeOutputIterator, i.e. an OutputIterator that doesn't only accept single values, but assignment of ranges: template<class RangeOutputIterator> ... (...RangeOutputIterator out){ *out=range; where range can be any Boost.Range. You can find an implementation of this concept here, in the form of an back insert iterator that can insert entire ranges into a vector: http://pastebin.com/9M5rPDh9 Using these two things together can make generic algorithms as efficient as is possible, e.g. if the container that is being written to is a vector and the value type is a POD, there's one call to std::memcpy. think e.g. about file or database operations like database.get(1024*1024,out); This is in my "namespace detail" right now and I'd be willing to help make it public and document it. Stefan

2 8

Idea for O(1) hash-table
by Rani Sharoni 19 Mar '13

19 Mar '13

Hi All, I hope that you will find the following idea interesting. I have been using hash-table with, AFAICT, unique implementation and I thought that it might be handy for boost. The hash table is O(1) *non-amortized* lookup via extremely balanced buckets (for example, max 6 entries per bucket). The implementation itself is absurdly simple ;-) The hash-table is basically variation of linear addressing using double-hashing hash-table with special re-insert strategy. Algorithm for linear addressing (easy to adjust for chained hashing): Consider a two dimensional N*K array – N buckets with up to K elements per bucket. Assume that the zero-key is marking an empty entry. Lookup(key): for (hash = key, I = 0 ; I < K ;++i) { hash = HASH(hash); // double-hashing if (A[hash % N][i] == key) return found; } return not-found; Insert(key): for (hash = key, I = 0 ; I < K ;++i) { hash = HASH(hash); // double-hashing if (A[hash % N][i] == 0) { A[hash % N][i] = key; return true; } } return false; The above insert is basically a bounded double-hashing and as-is it has a low utilization (a bit similar to bloom filter). For example, for 100K buckets and K=6 - insert will fail when the table has less than 50% utilization (i.e. fail to insert though most entries are empty). The trick is to perform “re-insert”: Pick some random element, key1, from failed insert phase, replace it with the new key, and (re) Insert(key1). Retrying up to, say, 12 rounds of re-insert improves the utilization, of N=100K/K=6, to ~97%! Table resize is done (if needed) when such repetitive re-insert fails. Altogether this implementation trade-off insert for fast lookup which is very appealing to caches (i.e. insert done in the expensive path - only after a cache miss). Just for comparison, hash-table using naïve liner probing (A[HASH(key)%N][i]) has only ~80% utilization even when using K=128 (i.e. deep buckets)! Such unbalanced behavior is also typical classical hash-tables with link-lists (chained-hashing) since statistically some buckets will outgrow the average. The performance of the classic double-hashing algorithm itself is quite poor when the table is highly utilize since many steps are required to find empty entries. Though this hash-table is general purposed it has some interesting properties: 1) O(1) non-amortized with very low chance for collisions (each key has its own unique “virtual” bucket). 2) Can be implemented on continuous memory without pointers and with excellent utilization 3) Allow wait free implementation of caches (i.e. no lock or even interlocked needed). 4) Allow caches on shared memory – corruption safe/hazard algorithm (assuming at least 64 bit keys). 5) Allow persistent using direct memory to file mapping (i.e. disk representation is same as in-memory one). 6) Average 50% LRU eviction for caches (i.e. on average entry half from the oldest is evicted) BTW – there is little chance for patenting this algorithm since I already published similar idea in the public domain ;-) Thanks, Rani

4 4

[math] Support for libquadmath/ __float128
by Claas 19 Mar '13

19 Mar '13

I have experimented with the quadmath library included with gcc and the boost::math::constants library and encountered several problems. - typeid is seemingly not supported for __float128, which requires an overload of nameof<__float128> - the stream extraction operator has to be provided for __float128 for string conversion to work - a specialisation of numeric_limits has to be provided. Is there an interest in incorporating __float128 into boost ? If so, would it be a good idea to specialise constants for __float128 as well, apart from float, double and long double? Regards Claas

6 19

Libaries accepted by not in Boost release yet - suitable for GSoC?
by Paul A. Bristow 19 Mar '13

19 Mar '13

I note there are some libraries that have been accepted but are not yet in a Boost release - and development seems to be stalled. This seems unfortunate - much effect from many people has gone into the whole process but we are not quite there yet - so a lot of work may be wasted? No doubt authors have other more pressing priorities J I spotted "Constrained value" and "endian" for example. Are any accepted but unfinished libraries suitable for Google Summer of Code students - with the task being to knock them into final shape? Is anyone willing to mentor these? Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

5 5

[local_function] End scope function name declaration makes code hard to read.
by Mostafa 18 Mar '13

18 Mar '13

(This is a feature request/inquiry.) I'm just now seriously starting to use local_function, and I'm finding that having to "visually parse" until the end of scope to determine the local function name makes the code much harder to read. Is it possible to declare the function name at the beginning of the scope? (I don't mind having to also register the function name at the end of the scope.) Something like: BLF2(add, (int), (int lhs, int rhs)) { return lhs + rhs; } BLF2_REGISTER(add); Having said, I don't see why needing an "ending macro" for the local function scope is a requirement (albeit my understanding of the library internals is limited to implementation annex of the documentation). Can't the start macro just expand to something like: //----------------------------- //Macro Generated Output Start. //----------------------------- //Local class definition. //Local class instance registration. //Out of class method definition starts here: inline void local_add::body(int& sum, const int& factor, const int& num) //----------------------------- //Macro Generated Output End. //----------------------------- //User generated content starts here: { return lhs + rhs; } Thanks, Mostafa

4 8

[docs] How to install boost documentation?
by Mostafa 18 Mar '13

18 Mar '13

I'm having a real hard time trying to figure out how to install boost documentation. Can't find any instructions on boost.org nor any on google. Am I missing something really obvious?

2 3

[gil] Pixel arithmetic operations.
by Harg Tholan 18 Mar '13

18 Mar '13

Hi, Has it ever been considered to overload arithmetic operators for "pixel"? In many situations it may be useful to add, sub or divide the value of two or more pixels. Thanks.

2 1

[gil] What is the status of the Gil extension numeric?
by Krzysztof Czainski 18 Mar '13

18 Mar '13

Hello, During my first steps wit Boost.Gil I bumped onto an example [1], that uses the numeric extension. For this extension, the the example [1] and a ling from Boost.Gil docs [4] point to [2], where I couldn't find any Gil extensions to download. Most Google links pointed to the same page, but I finally found [3]. So my questions are: a) Is there a plan to add the extension numeric to Boost? b) Is [3] the newest version? And could the Boost.Gil docs be updated to point to the right place? c) I corrected a few bugs in boost/gil/extension/numeric/sampler.hpp -- is this list the right place to discuss modifications to the numeric extension? Regards, Kris [1] http://www.boost.org/doc/libs/1_53_0/libs/gil/example/resize.cpp [2] http://opensource.adobe.com/gil [3] http://code.google.com/p/gil-contributions/ [4] http://www.boost.org/doc/libs/1_53_0/libs/gil/doc/index.html

1 0

[test] Any dependency on Boost.Test requires C++11 ?
by John Maddock 18 Mar '13

18 Mar '13

At present any test in Boost.Math that depends on Boost.Test fails for GCC prior to 4.5 because the build script for Boost.Test has: <toolset>gcc:<cxxflags>-std=gnu++0x Is this really required? It looks wrong headed to me: * We already have testers that test both C++03 and C++11 modes - so we don't need this to test C++11 support. * It's presence makes testing gcc in C++03 mode impossible if the library uses Boost.Test - so there may be C++03 breakages that we don't know about because of this. * As mentioned above, this is a hard error for GCC prior to 4.5, so those compilers can't be tested either. Can this be safely removed? Many thanks, John.

4 4

[boost.thread] Documentation code error
by Philip Bennefall 16 Mar '13

16 Mar '13

Hello, In the chapter about synchronization in the boost.thread documentation, where the hello world example with the bank account is being shown, I see a small problem in the class: int GetBalance() { mtx_.lock(); int b = balance_; mtx_.unlock(); return balance_; } I believe it should be: int GetBalance() { mtx_.lock(); int b = balance_; mtx_.unlock(); return b; } Kind regards, Philip Bennefall

1 0

Help in setupping regression tests on ARM
by Antony Polukhin 16 Mar '13

16 Mar '13

I've successfully run nests on x86, but on ARM I've got the following message: # Running Boost.Build tests Traceback (most recent call last): File "run.py", line 60, in <module> runner(root) File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 205, in __init__ self.main() File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 566, in main getattr(self,action_m)() File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 531, in command_regression self.command_test() File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 329, in command_test self.command_test_boost_build() File "/home/pi/boost_maintain/run_trunk/tools_regression_src/regression.py", line 369, in command_test_boost_build "boost/bin.v2/libs/any/test/any_test.test")); OSError: [Errno 2] No such file or directory: '/home/pi/boost_maintain/run_trunk/results/boost/bin.v2/libs/any/test/any_test.test' I try to run tests on RaspberryPi, it is armhf. Compilller is GCC-4.6.3, 25Gb of free space on SD card. It looks strange, that I see only a few folders in /home/pi/boost_maintain/run_trunk/results/boost/bin.v2/libs/ (there are only 6 folders) -- Best regards, Antony Polukhin

2 7

[detail][lightweight_test.hpp] Proposal to add BOOST_TEST_THROWS to boost/detail/lightweight_test.hpp
by Ion Gaztañaga 16 Mar '13

16 Mar '13

Hi, In my tests I use boost/detail/lightweight_test.hpp as it has nearly all I need to test my libraries with very little overhead. However I needed a simple utility to check if an expression throws an exception and I think it can be added to this header with very little code. See attached patch. Do you find this a good idea? Ok to commit? Best, Ion

4 8

comparing-the-c-standard-and-boost
by Neal Becker 15 Mar '13

15 Mar '13

http://slashdot.org/topic/bi/comparing-the-c-standard-and-boost/

1 0

[type_traits] Some traits are missing
by Antony Polukhin 15 Mar '13

15 Mar '13

Hi all, Equivalents of following traits are in C++11 Standard, but missing in Boost.TypeTraits library: has_nothrow_move_assign has_nothrow_move_constructor has_trivial_move_assign has_trivial_move_constructor Extremely naive implementation of those functions exist in Boost.Variant, so as a start we can use them. Or am I missing something and there is a reason, why those traits are not included in Boost.TypeTraits? -- Best regards, Antony Polukhin

3 6

Re: [boost] "Re: boost_svn_expor"
by DongInn Kim 15 Mar '13

15 Mar '13

Hi Rene, I am sorry for answering late. I did not know that I disabled receiving the boost mails. > It runs as part of the testing process if a tester has configured things to > not use the svn client directly. Disabling it causes some testers to stop > working. I don't know what the problem is with the cpu usage though as it > should be a rarely executed program as there are a small number of testers > and this would run only a small number of times in a day. > > On Wed, Mar 13, 2013 at 3:37 PM, DongInn Kim <dikim_at_[hidden]> wrote: > > I disabled the script /home/grafik/ > > www.boost.org/boost_svn_export_archive.sh for now. I have no idea what > > invokes the script but it seems that I could not find any troubles with the > > disabled script. > > > > Please let me know if you find anything wrong with the boost web services > > including the svn service. > > > > Regards, > > > > -- > > - DongInn > > > Can you tell me exactly what your test program does? It clearly invoked 4 or 5 apache processes which used almost all the resources. Does it create the 4 ~ 5 apache processes whenever you run the test program? Did you or your cronjob run it at that time? How could it run? Regards, -- - DongInn

2 1

Review Wizard Status Report for March 2013
by Ronald Garcia 14 Mar '13

14 Mar '13

============================================== Review Wizard Status Report for March 2013 ============================================== News ==== 1. Boost 1.52.0 Released. No New Libraries. 2. Boost 1.53.0 Released. New Libraries: Atomic, Coroutine, Lockfree, Multiprecision, Odeint. Open Issues =========== The following libraries have review managers, but have not yet been scheduled for review: * Range Extensions - added May 2012; review manager: Neil Groves. The following libraries have been reviewed and await reports from their review managers: * Predef - reviewed February 2012; review manager: Joel Falcou. The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * Constrained Value - accepted September 2010; author: Robert Kawulak. * GIL.IO - accepted January 2011; author: Christian Henning. * Contract - accepted September 2012; author: Lorenzo Caminiti. The following libraries have been accepted and submitted to SVN, but have not yet appeared in a release: * Type Traits Introspection - accepted August 2011; author: Edward Diener. * Type Erasure - accepted August 2012; author: Steven Watanabe The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Endian - accepted provisionally November 2011; author: Beman Dawes. * Log - accepted provisionally March 2010; author: Andrey Semashev. General Announcements ===================== As always, we need experienced review managers. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants, including library contributors, infrastructure contributors, and other mailing list participants with a substantial track record of constructive participation. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "rxg at cs dot cmu dot edu" and "phillips at pacific dot mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Pimpl (M) * Sorting (M) * Quaternions, Vectors, Matrices (M) * Variadic Macro Data (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Metaparse (M) * Range Extensions * Nowide (M) * Array (M) * TypeIndex (M) * STL Extensions (M) * Countertree (M) * Process (M) ``(M)`` marks libraries that need review managers. -------------------- Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: https://github.com/boost-vault/Miscellaneous/blob/master/Pimpl.zip :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: https://github.com/boost-vault/Sorting :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 2X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 70% faster than std::sort. string_sort is roughly 2X as fast as std::sort. Quaternions, Vectors, Matrices ------------------------------ :Author: Emil Dotchevski :Review Manager: Needed :Download: http://www.revergestudios.com/boost-qvm/ :Description: QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size. The library also defines vector and matrix data types, however it allows users to introduce their own types by specializing the q_traits, v_traits and m_traits templates. Variadic Macro Data ------------------- :Author: Edward Diener :Review Manager: Needed :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/variadic_macro_data/>`__ :Description: This library adds support and functionality for variadic macros to Boost as well as integrating variadic macros with the Boost PP library without changing the latter library in any way. Block Pointer ------------- :Author: Phil Bouchard :Review Manager: Needed :Download: https://svn.boost.org/svn/boost/sandbox/block_ptr/ :Description: Deterministic memory manager of constant complexity capable of handling cyclic collections. Singularity ----------- :Author: Ben Robinson :Review Manager: Needed :Download: https://github.com/cppmaven/Singularity :Description: The Singularity Design Pattern allows you to restrict any class to a single instance. Unlike the infamous Singleton, Singularity gives you direct control over the lifetime of the object, does not require you to grant global access to the object, nor does it limit you to the default constructor for that object. Extended Complex Numbers ------------------------ :Author: Matthieu Schaller :Review Manager: Needed :Download: http://code.google.com/p/cpp-imaginary-numbers/ :Description: The library is an extension of the std::complex class addressing two issues: 1. The standard does not guaranty the behaviour of the complex class if instantiated with types other than float/double/long double. 2. Some calculation where pure imaginary numbers (i.e. multiples of sqrt(-1)) appear are unnecessarily slowed down due to the lack of support for these numbers. The code I submit contains two interleaved classes boost::complex and boost::imaginary which can be instantiated with any type T provided T overloads the usual arithmetic operators and some basic (real) mathematical functions depending on which complex function will be used. It is thus an extended version of Thorsten Ottosen's n1869 proposal (http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1869.html) Metaparse --------- :Author: Abel Sinkovics :Review Manager: Needed :Download: http://abel.web.elte.hu/metaparse/metaparse.zip :Description: Metaparse is a library for constructing parsers parsing at compile-time based on template metaprogramming. The parsers built with the library take boost::mpl::strings as input and can produce - types - objects (types with public static members) - callable C++ functions (types with public static method) - template metafunction classes as output (based on the input being parsed). On compilers supporting constexpr the library provides the following syntactic sugar for writing the input of the parsers: BOOST_STRING("this is a string") The library can be used for implementing DSLs in C++, including DSLs making C++ template metaprogramming easier (see examples). Range Extensions ---------------- :Author: Akira Takahashi :Review Manager: Neil Groves :Download: https://github.com/faithandbrave/OvenToBoost :Description: This project adds some features of the Oven Range Library to Boost.Range. Features: - Additional Range Adaptors (taken, taken_while, dropped, dropped_while, elements, elements_key, memoized, outdirected) - Extensions for using Lambda (regular function, regular operator) - Infinite Range (iteration function) - and additional range utilities. Nowide ------ :Author: Artyom Beilis :Review Manager: Needed :Download: http://cppcms.com/files/nowide/ :Description: This library makes cross platform Unicode aware programming easier. It provides an implementation of standard C and C++ library functions, such that their inputs are UTF-8 aware on Windows without requiring to use Wide API. Array ----- :Author: Brian Smith :Review Manager: Needed :Download: https://github.com/BrianJSmith/Array :Description: The array class is a C++11 compatible implementation of static multidimensional arrays. TypeIndex --------- :Author: Antony Polukhin :Review Manager: Needed :Download: https://github.com/apolukhin/type_index :Description: TypeIndex is an extended C++11 type_index library, that * works with disabled RTTI * can store const-volatile-reference info about types (if user requested it) * has all the functionality of std::type_index * has portable across compilers and platforms functionality for getting demangled type names * works across modules/shared libraries * does not require C++11 to work STL Extensions -------------- :Author: Vadim Stadnik :Review Manager: Needed :Download: https://github.com/vstadnik/stl_ext_adv_review :Description: The proposed library [stl_ext_adv] offers augmented array based B+ trees and STL containers that support the interfaces of the C++03 sequences and associative containers. The library offers a number of extensions and performance improvements that are not available in C++03 and C++11 standard containers. Countertree ----------- :Author: Francisco Jose Tapia :Review Manager: Needed :Download: https://dl.dropbox.com/u/8437476/works/countertree_code_doc.zip :Description: This library is an implementation of a binary red-black counter tree. This tree have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators. COUNTERTREE This kind of trees have an additional counter in each leaf. This permit the access to the elements by the position, like in a vector. It is a random access container with random access iterators. With unordered information we have a vector with the same speed inserting and deleting in any position (O(log N)). With ordered information, we have the classes set, multiset, map and multimap, with identical interface than the STL classes, with the plus of access to the elements by position, like in a vector. The iterators are random access , and you can subtract them. SUBALLOCATOR The suballocator is a layer between the allocator and the data structures, compatible with any allocator with the STL definition. The suballocator replace to the allocator in the allocation of equal size elements. It provides speed, return the unused memory and decrease the memory used by the program and improve the cache performance due to the data locality improvement ( 30% of improvement of speed respect the std::allocator with GCC 4.7) Process ------- :Author: Boris Schaeling :Download: http://www.highscore.de/boost/process0.5/process.zip :Description: Boost.Process is a library to manage system processes. It can be used to: * create child processes * setup streams for child processes * communicate with child processes through streams (synchronously or asynchronously) * wait for processes to exit (synchronously or asynchronously) * terminate processes Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

1 0

Re: [boost] [support.osuosl.org #20948] Transition of Boost's bug tracking system
by DongInn Kim 14 Mar '13

14 Mar '13

Hi Olaf, Thanks for the update. I have never heard about transitioning from SVN to Git on the boost server machine. I am wondering how the transition could happen without the sysadmin's access though. To the boost group people, do you have any specific plan for this transition? Regards, -- - DongInn On Mar 14, 2013, at 12:04 PM, Olaf van der Spek <ml(a)vdspek.org> wrote: > Hi, > > AFAIK Boost is currently transitioning to Git for version control. I > hit some roadblocks when trying the conversions of Trac to Chili or > Redmine and thought it'd be better to wait until the transition to Git > is complete. > Simplest thing to do might be to move Trac without conversion to the > new host if the old server gets too old. > > Olaf > > On Wed, Mar 13, 2013 at 3:38 PM, DongInn Kim via RT <support(a)osuosl.org> wrote: >> Hi, >> >> What is the status of the transition of Boost's bug tracking system? The current server is quite old and my boss and I need to decide what to do pretty soon. >> >> Regards, >> >> -- >> - DongInn >> >> On Dec 11, 2012, at 8:28 PM, Olaf van der Spek via RT <support(a)osuosl.org> wrote: >> >>> On Wed, Dec 12, 2012 at 1:36 AM, Daniel Takamori via RT >>> <support(a)osuosl.org> wrote: >>>> Added your public key to your user account on boost.osuosl.org It should work >>>> now. >>> >>> Thanks. Given that I don't have a password, how do I use sudo? >>> >>> $ sudo -s >>> >>> We trust you have received the usual lecture from the local System >>> Administrator. It usually boils down to these three things: >>> >>> #1) Respect the privacy of others. >>> #2) Think before you type. >>> #3) With great power comes great responsibility. >>> >>> [sudo] password for boostadmin: >>> >>> $ passwd >>> Changing password for user boostadmin. >>> Changing password for boostadmin. >>> (current) UNIX password: >>> passwd: Authentication token manipulation error >>> $ >>> >>> >>> >>> >>> >>> -- >>> Olaf >>> >> >> > > > > -- > Olaf

1 0

[gil] IMC4 Pixel format
by Harg Tholan 14 Mar '13

14 Mar '13

Hey, I've been trying to find a definition for the IMC4<http://www.fourcc.org/yuv.php#IMC4>pixel format for GIL with no success, not even anything similar (planar pixel formats in which some of the channels are sub-sampled). I've spent many hours already trying to figure out how could I create such pixel format, and I am totally lost... The question is how can I specify that a pixel format is planar, and planes have different sizes due to sub-sampling!....I guess I'll have to override some operator[] operator++, operator-- Or to make a specialization of some classes. But how and where? planar_pixel_iterator? channel_iterator? I need some aid! please! Thanks is advance. H4rg.

3 4

[graph] Archetype's redundant members (Re: [graph]Direct Edge Access)
by Takatoshi Kondo 14 Mar '13

14 Mar '13

Hi Jeremiah, Thanks for your advice. I studied about archetypes. If I understood the minimal archetype requirements based on concepts correctly, some graph archetypes seems to have redundant members. In addition, vertex_list_graph_archetype::degree_size_type should inherit from incidence_graph_archetype. So, I wrote a patch. After applying the patch, all Boost.Graph tests passed. Could you check the patch? -- Takatoshi Kondo On Thu, Mar 7, 2013 at 4:41 PM, Jeremiah Willcock <jewillco(a)osl.iu.edu> wrote: > On Thu, 7 Mar 2013, Takatoshi Kondo wrote: > >> Hi Jeremiah, >> >> Thank you for your reply. I'm relieved that I understand correctly. I >> come up with a related question. >> I think that general graph algorithm developers should test two >> different things. >> >> One is concepts. If function my_algo() required >> VertexAndEdgeListGraphConcept for the parameter g, it should be >> checked as follows: >> >> #include <boost/graph/graph_concepts.hpp> >> >> template <typename Graph> >> void my_algo(Graph g) { >> BOOST_CONCEPT_ASSERT(( boost::VertexAndEdgeListGraphConcept<Graph> )); >> >> boost::edge(0, 1, g); // accidental invalid use ... Line A >> } >> >> But this test cannot detect out of concepts functions usage as Line A >> if class Graph accidentally provide them. >> So, these problems should be detected the following test: >> >> void my_algo_test() { >> typedef /* Only satisfies VertexAndListGraphConcept*/ Graph; // ... >> Line B >> Graph g; >> my_algo(g); >> } >> >> How do I define the type that is only satisfied specific concepts? > > > Those are called "archetypes" in the terminology of the Boost Concept Check > Library > (http://www.boost.org/doc/libs/1_53_0/libs/concept_check/concept_check.htm) > There is a set of them for Boost.Graph concepts in > <boost/graph/graph_archetypes.hpp>. They do not appear to have > documentation, but example uses include most files with the name pattern > *_cc.cpp in libs/graph/test (e.g., bfs_cc.cpp). > > > -- Jeremiah Willcock > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost

1 1

boost_svn_expor
by DongInn Kim 13 Mar '13

13 Mar '13

Hi, Can anyone tell me what boost_svn_expor does? I did not look up the program and who is running it yet but I thought someone in the boost group may already have answer for this. > [root@wowbagger dikim]# pstree 8271 > httpd─┬─59*[httpd] > └─httpd───boost_svn_expor─┬─boost_svn_expor─┬─boost_svn_expor───svn > │ ├─boost_svn_expor───boost_svn_expor > │ ├─bzip2 > │ ├─cut > │ ├─star───star > │ ├─tar───tar───bzip2 > │ └─tee > └─cat > [root@wowbagger dikim]# ps -ef | grep boost_svn > apache 23534 23510 0 15:40 ? 00:00:00 /bin/sh /home/grafik/www.boost.org/boost_svn_export_archive.sh trunk > apache 23543 23534 0 15:40 ? 00:00:00 /bin/sh /home/grafik/www.boost.org/boost_svn_export_archive.sh trunk > apache 23544 23543 0 15:40 ? 00:00:00 /bin/sh /home/grafik/www.boost.org/boost_svn_export_archive.sh trunk > apache 23552 23543 0 15:40 ? 00:00:00 /bin/sh /home/grafik/www.boost.org/boost_svn_export_archive.sh trunk > root 23809 23332 0 15:42 pts/1 00:00:00 grep boost_svn > [root@wowbagger dikim]# This program almost kills the boost server. Its loadaverage is > 30 now. :-( Regards, -- - DongInn

2 2

[spirit] hold_any invalid assignment to destructed object?
by Rob Desbois 13 Mar '13

13 Mar '13

Hi, The boost::spirit::hold_any implementation includes the following functions defined in the detail sub-namespace: // member of fxns<mpl::true_> specialisation, line 99 static void move(void* const* src, void** dest) { reinterpret_cast<T*>(dest)->~T(); *reinterpret_cast<T*>(dest) = *reinterpret_cast<T const*>(src); } // member of fxns<mpl::false_> specialisation, line 99 static void move(void* const* src, void** dest) { (*reinterpret_cast<T**>(dest))->~T(); **reinterpret_cast<T**>(dest) = **reinterpret_cast<T* const*>(src); } As I understand it, the object is destroyed _and then assigned to_; does it not need to be constructed at this point, i.e. have something like this (for the first specialisation): new (reinterpret_cast<T*>(dest)) T( *reinterpret_cast<T const*>(src) ); Thanks & apologies if I've misunderstood --rob <http://theotherbranch.wordpress.com/>

2 3

Meeting C++ 2013 - Call for Papers
by Jens Weller 12 Mar '13

12 Mar '13

Hello C++ & boost Community! Today, the 2nd Edition of the Meeting C++ conference has been announced! We will meet in Düsseldorf again at the 2nd November Weekend for two days full of C++! Call for Papers: http://www.meetingcpp.com/index.php/newsreader/items/call-for-papers-124.ht… Announcement with further Details on the conference: http://www.meetingcpp.com/index.php/newsreader/items/meeting-cpp-2013-annou… Talks about boost, C++11/14 are very welcome to the conference! kind regards, Jens Weller

1 0

[BGL] ticket 6780
by Fernando Vilas 12 Mar '13

12 Mar '13

Hi, I am still working on a few studies involving maximum adjacency search. How close is ticket 6780 to being accepted? The test cases for Stoer-Wagner now pass again on my computer. -- Thanks, Fernando Vilas fvilas(a)iname.com

1 0