Array Refactoring: Difference between revisions
From ParaQ Wiki
Jump to navigationJump to search
m (→Recent Work) |
m (→Proposed Work) |
||
Line 19: | Line 19: | ||
== Proposed Work == | == Proposed Work == | ||
* | * Provide iterators, memory layout functionality in vtkDenseArray to support in-situ work. | ||
* | * Support vtkArray as attributes. Some different approaches: | ||
*# vtkArray derives from vtkAbstractArray. | |||
*#* Worst possible approach, there are methods in vtkAbstractArray (GetVoidPointer()) that are totally incompatible with sparse arrays. | |||
*# vtkArray and vtkAbstractArray remain apart. | |||
*# vtkAbstractArray derives from vtkArray. |
Revision as of 11:01, 8 April 2009
Overview
Now that we have N-Way Array Data Structures, it would be ideal if we could use them as attributes in data objects. This will likely involve some tricky work to somehow merge the vtkAbstractArray- and vtkArray- hierarchies.
Recent Work
- Added vtkArray::GetName() and vtkArray::SetName()
- vtkDenseArray memory management.
- vtkDenseArray::MemoryBlock
- vtkDenseArray::StaticMemoryBlock
- vtkDenseArray::HeapMemoryBlock
- vtkSparseICSArray
- Changes the way coordinates are stored, one contiguous array of coordinates per dimension, instead of a single contiguous array for all dimensions.
- Implements value sorting.
- Could probably replace the current vtkSparseArray implementation.
Proposed Work
- Provide iterators, memory layout functionality in vtkDenseArray to support in-situ work.
- Support vtkArray as attributes. Some different approaches:
- vtkArray derives from vtkAbstractArray.
- Worst possible approach, there are methods in vtkAbstractArray (GetVoidPointer()) that are totally incompatible with sparse arrays.
- vtkArray and vtkAbstractArray remain apart.
- vtkAbstractArray derives from vtkArray.
- vtkArray derives from vtkAbstractArray.