- Boost - lists.boost.org

Boost.Python proposed patch 1.31.0
by John Gerschwitz 11 Feb '04

11 Feb '04

It would appear numeric.cpp has some () missing. This means calls to functions such as nelements fail. The text "isaligned" replaced with "iscontiguous" in iscontiguous call. John Gerschwitz *** numeric.cpp.orig 2004-02-11 10:57:50.000000000 +1000 --- numeric.cpp 2004-02-11 11:00:33.000000000 +1000 *************** *** 226,247 **** bool array_base::isaligned() const { ! return extract<bool>(attr("isaligned")); } bool array_base::iscontiguous() const { ! return extract<bool>(attr("isaligned")); } long array_base::itemsize() const { ! return extract<long>(attr("itemsize")); } long array_base::nelements() const { ! return extract<long>(attr("nelements")); } object array_base::nonzero() const --- 226,247 ---- bool array_base::isaligned() const { ! return extract<bool>(attr("isaligned")()); } bool array_base::iscontiguous() const { ! return extract<bool>(attr("iscontiguous")()); } long array_base::itemsize() const { ! return extract<long>(attr("itemsize")()); } long array_base::nelements() const { ! return extract<long>(attr("nelements")()); } object array_base::nonzero() const

2 1

Re: [boost] Is anyone interested in dynamic multi array libarray
by RGProlog＠aol.com 11 Feb '04

11 Feb '04

Wrote garcia(a)cs.indiana.edu >Greetings, >I am trying to grok what it is you describe, but I am afraid I may be >missing something. Could you explain in what ways >dynamic_multi_array >differs from the arrays in the Boost.MultiArray library? >Thanks Thank you for your interest. The dynamic_multi_array arrays differ from the the arrays in the Boost.MultiArray library in the same way the arrays in the Boost.Dynamic Bitset library differ from the arrays in the std::bitset library; it is dynamic vs. static. Thus the rationale behind the Dynamic Multi Array library is similar to the rationale behind Boost.Dynamic Bitset library. It complimemts the Boost.MultiArray library. The way the Dynamic Multi Array library is implemented is different. The relationship between the components of the Dynamic Myltiarray library, for example, is different. While the coupling between multi_array and multi_array_ref the Boost.Dynamic Bitset library is almost the stongest possible, public inheritance, the relationship between dynamic_multi_array & dynamic_multi_array_ref is the weakest possible. The dynamic_multi_array_ref points to the data initialized and managed by the dynamic_multi_array and that's it. (for the details see documentation once it will become available on the vault.) There is a clear rationale behind this decision. The dynamic_multi_array component does not provide the capacity to hone in on its subviews; the dynamic_multi_array and the dynamic_subarray components do. The dynamic_multi_array is stricly an extension of std::vector into the multi dimensional enviroment. Thus a user who needs just that --- a strict extension of std::vector --- and wants to avoid the performance penalty the subview capacity would incur, he/she can use the the dynamic_multi_array component of the library alone. For those who want it all, though, the rest of the components will do the job. Also, the Dynamic Multi Array library does not define a subview type. Instead, at a meager price of a few numeric assignment, an existing dynamic_multi_array_ref object can be parametrized to act as any subview of the same dimension of the array object it references, and still retain its iterator interface. Also, the Dynamic Multi Array library does not define an analog of the Boost.MultiArray library index_gen facility. In analogy to std::vector whose objects can be both accessed and generated using a single integral type, the dynamic_multi_array object can be constructed and accessed using C++ arrays, boost::arrays, std::vector arrays or any other class that contains a contiguous block of integral data and has a random access interface. I did e-mail to you, and will e-mailt to anyone expressing interest in the Dynamic Multi Array library the library's code untill the day I will be able to put the code on the wault. ---Roman

1 0

Three questions about the new license
by Gennaro Prota 11 Feb '04

11 Feb '04

Sorry, if this has already been discussed before, but a) the new license text says: "The copyright notices in the Software and this entire statement, including the above license grant, this restriction and the following disclaimer, must be included in all copies of the Software". IIUC, "the Software" (with a capital 's') includes documentation. Am I right? b) IIUC again, the comments we are inserting into source files // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) are unnecessarily verbose (and potentially dangerous). One could simply say // Subject to the Boost Software License, Version 1.0. (See etc. etc.) That avoids repeating "use, modification and redistribution" which I'm not sure is everything one can do with the Software (I see for instance, that the license talks about "use, *reproduce*, *display*, distribute, execute, and transmit"). Are, legally speaking, "display" and "reproduce" something different from "use"? c) Suppose one wants to redistribute documentation only (for instance, documentation for one library). Is that allowed? The license seems to say that the docs can only _accompany_ the software (with a lowercase 's'). Genny.

2 3

Python 2.3
by Sebastian Henriksen 11 Feb '04

11 Feb '04

I cannot seem to get Boost.Python properly working with version 2.3. I define the root directory correctly, and the version as 2.3 but vc7.1 tries to link to python22.lib instead of python23.lib. How can I solve this? Thanks... --------------------------------- Do you Yahoo!? Yahoo! Finance: Get your refund fast by filing online

2 1

Questions about the new license
by Powell, Gary 11 Feb '04

11 Feb '04

I know this is pretty late in the process but also have a couple of questions: #1 I'd prefer that any software I contribute to boost remain "free", as in I don't want someone to add 20 lines of code to a library and then sell it. You can sell the compiled machine code but not the original or the modified source other than to cover duplication and distribution costs. #2 I have worked for a overly restrictive employer who was paranoid that anything anyone might do on their own time might be owned by the employee and not the employee. It would be extremely helpful if the license states clearly that derivatives cannot be owned. I'm all for a company like "Boost Consulting", I think they add plenty of value to the boost community and give back way more than they take from the free software. However greedy companies have been known to take free software, modify it and not return it to the public domain. There of course is no time limit and no way to prevent this from happening but it would be better if the copyright was a copy left. Also all that bit about the liability disclaimers, forget it, you can be sued for anything, at anytime, not withstanding the claim about the liability, it might as well not be there for all the good it will do us. On the other hand it does give us a leg up in the event of a lawsuit, "We claimed it was worthless your honor." Also one should be able to write a book about boost, use part of the documentation without a heap of trouble. But a bound reprint of the documentation is owned by???? In general I support this effort. Perhaps some clarifying statements in the FAQ would be enough to calm my fears. -Gary-

3 2

Copyright on bigint in sandbox
by Richard Peters 11 Feb '04

11 Feb '04

Hello, I'm working on a big integer library, and for outputting the value of the integer to a stream I would like to use the code in the bigint library in the sandbox. Unfortunately, the file containing the code (bigint.hpp) hasn't got a copyright notice. Could I have permission to use that code in my own big integer library? For what it's worth, I'm planning to submit my big integer library to boost eventually. thanks, Richard Peters

2 3

(no subject)
by mark.rodgers＠cadenza.co.nz 11 Feb '04

11 Feb '04

The message cannot be represented in 7-bit ASCII encoding and has been sent as a binary attachment.

1 0

RE: [boost] Re: Questions about the new license
by Glen Knowles 11 Feb '04

11 Feb '04

From: Powell, Gary [mailto:powellg@amazon.com] >>Boost licensing policy aside for a moment, the CPL is your friend. > >I agree. Or course that begs the question why have a special "boost" >license? (Although I understand that not all parties to boost are bound >by the laws of NY State and those of the US. And the USofA has not >signed up for the world court. > >What does it take to include a CPL? a copy of the full text? > >And would including both a CPL AND the boost text corrupt the code to >make it not boost acceptable? If you look at the faq for the CPL: http://www-106.ibm.com/developerworks/library/os-cplfaq.html Points 12 and 18 are problematic. Glen

2 1

Re: [BGL] Interest in a random-path algorithm.
by Cromwell Enage 11 Feb '04

11 Feb '04

> I would like to integrate that algorithm into > QuickGraph, a C# graph library. > <http://www.dotnetwiki.org> > > May I? You may do so. The LSP algorithm for acyclic digraphs (nothing more than a shortest-path algorithm on edges with negative weights) is freely available across the Internet. Cromwell Enage __________________________________ Do you Yahoo!? Yahoo! Finance: Get your refund fast by filing online. http://taxes.yahoo.com/filing.html

2 1

Is anyone interested in dynamic multi array libarray
by RGProlog＠aol.com 11 Feb '04

11 Feb '04

Is anyone interested in dynamic_multi_array template library that offers user intuitive convenience of use as well as capacity to hone in upon any specific subset of a multi-dimensional array? As an example of usage, a dynamic_multi_array object can be constructed and then resized and then reshaped like this: size_t arrayShape = { 3, 7, 15}; dynamic_multi_array<double, 3> A(arrayShape); boost::array<size_t, 3> anotherArrayShape = {{ 5, 4, 22}}; A.resize(anotherArrayShape); boost::array<size_t, 5> yetAnotherArrayShape = {{ 440, 1, 1, 0, 0}} ; A.reshape(yetAnotherArrayShape); size_t stillAnotherArrayShape[4] = { 22, 10, 2, 11}; A.reshape(stillAnotherArrayShape); The library’s design owes a lot to Andrei Alexandrescu’s ideas. It is based on the data_table helper class template defined as follows: template<typename X> class data_table { … protected: std::vector<X> data_table_ ;}; template<> <value_type> class data_table { … protected: value_type* data_table_ ;}; Then, a sequence of the table class instantiation types is recursively defined and then given a name that is shared in different dimensional contexts as follows: typedef data_table<value_type> data_table_01; ……………………………………………. typedef data_table< data_table_49 > data_table_50 ; class Int2Type<int> { typedef data_table_01 data_table; } …………………………………………… class Int2Type<> <50> { typedef data_table_50 data_table; } Being a recursive template class, the data_table is implemented in a concise code that is mostly about stating a few recursive rules and implementing some access operators and is totally dimension independent. This is the central feature of the design since the user level wrapper class template by virtue of exporting a dimension appropriate data_table instantiation that uses its shared name template <T, size_t i, Allocator> class dynamic_multi_array { ………………………………………. typedef …. class Int2Type <i>::data_table; } is also implemented in a way that hides all the implementation details, is concise and dimension independent, thus providing user with a great deal of flexibility, syntax safety, and, in case of a new user, a flat learning curve. This is a std::vector based design. The dynamic_multi_array template class, the library’s main component, extends, where appropriate, std::vector capacities, replicates its exception safety guarantees and has std::vector as its back end storage device. The library’s code, documentation including a short tutorial and a few key tests and will be posted in Dynamic Multi Array Folder on boost Files once the issue of available space will be resolved.

3 2