/*************************************************************************** * blitz/array/reduce.cc Array reductions. * * $Id: reduce.cc,v 1.2 2002/09/12 07:02:06 eric Exp $ * * Copyright (C) 1997-2001 Todd Veldhuizen <tveldhui@oonumerics.org> * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * Suggestions: blitz-dev@oonumerics.org * Bugs: blitz-bugs@oonumerics.org * * For more information, please see the Blitz++ Home Page: * http://oonumerics.org/blitz/ * *************************************************************************** * $Log: reduce.cc,v $ * Revision 1.2 2002/09/12 07:02:06 eric * major rewrite of weave. * * 0. * The underlying library code is significantly re-factored and simpler. There used to be a xxx_spec.py and xxx_info.py file for every group of type conversion classes. The spec file held the python code that handled the conversion and the info file had most of the C code templates that were generated. This proved pretty confusing in practice, so the two files have mostly been merged into the spec file. * * Also, there was quite a bit of code duplication running around. The re-factoring was able to trim the standard conversion code base (excluding blitz and accelerate stuff) by about 40%. This should be a huge maintainability and extensibility win. * * 1. * With multiple months of using Numeric arrays, I've found some of weave's "magic variable" names unwieldy and want to change them. The following are the old declarations for an array x of Float32 type: * * PyArrayObject* x = convert_to_numpy(...); * float* x_data = (float*) x->data; * int* _Nx = x->dimensions; * int* _Sx = x->strides; * int _Dx = x->nd; * * The new declaration looks like this: * * PyArrayObject* x_array = convert_to_numpy(...); * float* x = (float*) x->data; * int* Nx = x->dimensions; * int* Sx = x->strides; * int Dx = x->nd; * * This is obviously not backward compatible, and will break some code (including a lot of mine). It also makes inline() code more readable and natural to write. * * 2. * I've switched from CXX to Gordon McMillan's SCXX for list, tuples, and dictionaries. I like CXX pretty well, but its use of advanced C++ (templates, etc.) caused some portability problems. The SCXX library is similar to CXX but doesn't use templates at all. This, like (1) is not an * API compatible change and requires repairing existing code. * * I have also thought about boost python, but it also makes heavy use of templates. Moving to SCXX gets rid of almost all template usage for the standard type converters which should help portability. std::complex and std::string from the STL are the only templates left. Of course blitz still uses templates in a major way so weave.blitz will continue to be hard on compilers. * * I've actually considered scrapping the C++ classes for list, tuples, and * dictionaries, and just fall back to the standard Python C API because the classes are waaay slower than the raw API in many cases. They are also more convenient and less error prone in many cases, so I've decided to stick with them. The PyObject variable will always be made available for variable "x" under the name "py_x" for more speedy operations. You'll definitely want to use these for anything that needs to be speedy. * * 3. * strings are converted to std::string now. I found this to be the most useful type in for strings in my code. Py::String was used previously. * * 4. * There are a number of reference count "errors" in some of the less tested conversion codes such as instance, module, etc. I've cleaned most of these up. I put errors in quotes here because I'm actually not positive that objects passed into "inline" really need reference counting applied to them. The dictionaries passed in by inline() hold references to these objects so it doesn't seem that they could ever be garbage collected inadvertently. Variables used by ext_tools, though, definitely need the reference counting done. I don't think this is a major cost in speed, so it probably isn't worth getting rid of the ref count code. * * 5. * Unicode objects are now supported. This was necessary to support rendering Unicode strings in the freetype wrappers for Chaco. * * 6. * blitz++ was upgraded to the latest CVS. It compiles about twice as fast as the old blitz and looks like it supports a large number of compilers (though only gcc 2.95.3 is tested). Compile times now take about 9 seconds on my 850 MHz PIII laptop. * * Revision 1.3 2002/03/06 17:00:35 patricg * * TinyVector<int,rank> replaced by TinyVector<int,T_expr::rank> * * Revision 1.2 2001/01/25 00:25:55 tveldhui * Ensured that source files have cvs logs. * */ #ifndef BZ_ARRAYREDUCE_H #error <blitz/array/reduce.cc> must be included via <blitz/array/reduce.h> #endif BZ_NAMESPACE(blitz) template<class T_expr, class T_reduction> _bz_typename T_reduction::T_resulttype _bz_reduceWithIndexTraversal(T_expr expr, T_reduction reduction); template<class T_expr, class T_reduction> _bz_typename T_reduction::T_resulttype _bz_reduceWithStackTraversal(T_expr expr, T_reduction reduction); template<class T_expr, class T_reduction> _bz_typename T_reduction::T_resulttype _bz_ArrayExprFullReduce(T_expr expr, T_reduction reduction) { #ifdef BZ_TAU_PROFILING // Tau profiling code. Provide Tau with a pretty-printed version of // the expression. static string exprDescription; if (!exprDescription.length()) // faked static initializer { exprDescription = T_reduction::name(); exprDescription += "("; prettyPrintFormat format(_bz_true); // Terse mode on expr.prettyPrint(exprDescription, format); exprDescription += ")"; } TAU_PROFILE(" ", exprDescription, TAU_BLITZ); #endif // BZ_TAU_PROFILING return _bz_reduceWithIndexTraversal(expr, reduction); #ifdef BZ_NOT_IMPLEMENTED_FLAG if ((T_expr::numIndexPlaceholders > 0) || (T_reduction::needIndex)) { // The expression involves index placeholders, so have to // use index traversal rather than stack traversal. return reduceWithIndexTraversal(expr, reduction); } else { // Use a stack traversal return reduceWithStackTraversal(expr, reduction); } #endif } template<class T_expr, class T_reduction> _bz_typename T_reduction::T_resulttype _bz_reduceWithIndexTraversal(T_expr expr, T_reduction reduction) { // This is optimized assuming C-style arrays. reduction.reset(); const int rank = T_expr::rank; TinyVector<int,T_expr::rank> index, first, last; unsigned long count = 1; for (int i=0; i < rank; ++i) { index(i) = expr.lbound(i); first(i) = index(i); last(i) = expr.ubound(i) + 1; count *= last(i) - first(i); } const int maxRank = rank - 1; int lastlbound = expr.lbound(maxRank); int lastubound = expr.ubound(maxRank); int lastIndex = lastubound + 1; _bz_bool loopFlag = _bz_true; while(loopFlag) { for (index[maxRank] = lastlbound; index[maxRank] < lastIndex; ++index[maxRank]) { if (!reduction(expr(index), index[maxRank])) { loopFlag = _bz_false; break; } } int j = rank-2; for (; j >= 0; --j) { index(j+1) = first(j+1); ++index(j); if (index(j) != last(j)) break; } if (j < 0) break; } return reduction.result(count); } template<class T_expr, class T_reduction> _bz_typename T_reduction::T_resulttype _bz_reduceWithIndexVectorTraversal(T_expr expr, T_reduction reduction) { // This version is for reductions that require a vector // of index positions. reduction.reset(); const int rank = T_expr::rank; TinyVector<int,T_expr::rank> index, first, last; unsigned long count = 1; for (int i=0; i < rank; ++i) { index(i) = expr.lbound(i); first(i) = index(i); last(i) = expr.ubound(i) + 1; count *= last(i) - first(i); } const int maxRank = rank - 1; int lastlbound = expr.lbound(maxRank); int lastubound = expr.ubound(maxRank); int lastIndex = lastubound + 1; _bz_bool loopFlag = _bz_true; while(loopFlag) { for (index[maxRank] = lastlbound; index[maxRank] < lastIndex; ++index[maxRank]) { if (!reduction(expr(index), index)) { loopFlag = _bz_false; break; } } int j = rank-2; for (; j >= 0; --j) { index(j+1) = first(j+1); ++index(j); if (index(j) != last(j)) break; } if (j < 0) break; } return reduction.result(count); } BZ_NAMESPACE_END

Generated by Doxygen 1.6.0 Back to index