NULL is returned */
CV_INLINE CvSetElem* cvGetSetElem( const CvSet* set_header, int idx )
{
- CvSetElem* elem = (CvSetElem*)cvGetSeqElem( (CvSeq*)set_header, idx );
+ CvSetElem* elem = (CvSetElem*)(void *)cvGetSeqElem( (CvSeq*)set_header, idx );
return elem && CV_IS_SET_ELEM( elem ) ? elem : 0;
}
{ return *(const _Tp*)((const uchar*)n + hdr->valueOffset); }
inline SparseMat::Node* SparseMat::node(size_t nidx)
-{ return (Node*)&hdr->pool[nidx]; }
+{ return (Node*)(void*)&hdr->pool[nidx]; }
inline const SparseMat::Node* SparseMat::node(size_t nidx) const
-{ return (const Node*)&hdr->pool[nidx]; }
+{ return (const Node*)(void*)&hdr->pool[nidx]; }
inline SparseMatIterator SparseMat::begin()
{ return SparseMatIterator(this); }
inline const SparseMat::Node* SparseMatConstIterator::node() const
{
return ptr && m && m->hdr ?
- (const SparseMat::Node*)(ptr - m->hdr->valueOffset) : 0;
+ (const SparseMat::Node*)(void*)(ptr - m->hdr->valueOffset) : 0;
}
inline SparseMatConstIterator SparseMatConstIterator::operator ++(int)
}
inline FileNode FileNodeIterator::operator *() const
-{ return FileNode(fs, (const CvFileNode*)reader.ptr); }
+{ return FileNode(fs, (const CvFileNode*)(void*)reader.ptr); }
inline FileNode FileNodeIterator::operator ->() const
-{ return FileNode(fs, (const CvFileNode*)reader.ptr); }
+{ return FileNode(fs, (const CvFileNode*)(void*)reader.ptr); }
template<typename _Tp> static inline FileNodeIterator& operator >> (FileNodeIterator& it, _Tp& value)
{ read( *it, value, _Tp()); return ++it; }
(unsigned)col < (unsigned)mat->cols );
if( type == CV_32FC1 )
- return ((float*)(mat->data.ptr + (size_t)mat->step*row))[col];
+ return ((float*)(void*)(mat->data.ptr + (size_t)mat->step*row))[col];
else
{
assert( type == CV_64FC1 );
- return ((double*)(mat->data.ptr + (size_t)mat->step*row))[col];
+ return ((double*)(void*)(mat->data.ptr + (size_t)mat->step*row))[col];
}
}
(unsigned)col < (unsigned)mat->cols );
if( type == CV_32FC1 )
- ((float*)(mat->data.ptr + (size_t)mat->step*row))[col] = (float)value;
+ ((float*)(void*)(mat->data.ptr + (size_t)mat->step*row))[col] = (float)value;
else
{
assert( type == CV_64FC1 );
- ((double*)(mat->data.ptr + (size_t)mat->step*row))[col] = (double)value;
+ ((double*)(void*)(mat->data.ptr + (size_t)mat->step*row))[col] = (double)value;
}
}
{
// no need to check if T is dividable by sizeof(size_t) like in the Hamming
// distance computation as we have a mask
- const size_t* feature_block_ptr = reinterpret_cast<const size_t*> (feature);
+ const size_t* feature_block_ptr = reinterpret_cast<const size_t*> ((const void*)feature);
// Figure out the subsignature of the feature
// Given the feature ABCDEF, and the mask 001011, the output will be