mirror of https://github.com/opencv/opencv.git
Open Source Computer Vision Library
https://opencv.org/
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
226 lines
4.7 KiB
226 lines
4.7 KiB
/////////////////////////////////////////////////////////////////////////// |
|
// |
|
// Copyright (c) 2002, Industrial Light & Magic, a division of Lucas |
|
// Digital Ltd. LLC |
|
// |
|
// All rights reserved. |
|
// |
|
// Redistribution and use in source and binary forms, with or without |
|
// modification, are permitted provided that the following conditions are |
|
// met: |
|
// * Redistributions of source code must retain the above copyright |
|
// notice, this list of conditions and the following disclaimer. |
|
// * Redistributions in binary form must reproduce the above |
|
// copyright notice, this list of conditions and the following disclaimer |
|
// in the documentation and/or other materials provided with the |
|
// distribution. |
|
// * Neither the name of Industrial Light & Magic nor the names of |
|
// its contributors may be used to endorse or promote products derived |
|
// from this software without specific prior written permission. |
|
// |
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
// |
|
/////////////////////////////////////////////////////////////////////////// |
|
|
|
|
|
|
|
//----------------------------------------------------------------------------- |
|
// |
|
// class Slice |
|
// class FrameBuffer |
|
// |
|
//----------------------------------------------------------------------------- |
|
|
|
#include <ImfFrameBuffer.h> |
|
#include "Iex.h" |
|
|
|
|
|
using namespace std; |
|
|
|
namespace Imf { |
|
|
|
Slice::Slice (PixelType t, |
|
char *b, |
|
size_t xst, |
|
size_t yst, |
|
int xsm, |
|
int ysm, |
|
double fv, |
|
bool xtc, |
|
bool ytc) |
|
: |
|
type (t), |
|
base (b), |
|
xStride (xst), |
|
yStride (yst), |
|
xSampling (xsm), |
|
ySampling (ysm), |
|
fillValue (fv), |
|
xTileCoords (xtc), |
|
yTileCoords (ytc) |
|
{ |
|
// empty |
|
} |
|
|
|
|
|
void |
|
FrameBuffer::insert (const char name[], const Slice &slice) |
|
{ |
|
if (name[0] == 0) |
|
{ |
|
THROW (Iex::ArgExc, |
|
"Frame buffer slice name cannot be an empty string."); |
|
} |
|
|
|
_map[name] = slice; |
|
} |
|
|
|
|
|
void |
|
FrameBuffer::insert (const string &name, const Slice &slice) |
|
{ |
|
insert (name.c_str(), slice); |
|
} |
|
|
|
|
|
Slice & |
|
FrameBuffer::operator [] (const char name[]) |
|
{ |
|
SliceMap::iterator i = _map.find (name); |
|
|
|
if (i == _map.end()) |
|
{ |
|
THROW (Iex::ArgExc, |
|
"Cannot find frame buffer slice \"" << name << "\"."); |
|
} |
|
|
|
return i->second; |
|
} |
|
|
|
|
|
const Slice & |
|
FrameBuffer::operator [] (const char name[]) const |
|
{ |
|
SliceMap::const_iterator i = _map.find (name); |
|
|
|
if (i == _map.end()) |
|
{ |
|
THROW (Iex::ArgExc, |
|
"Cannot find frame buffer slice \"" << name << "\"."); |
|
} |
|
|
|
return i->second; |
|
} |
|
|
|
|
|
Slice & |
|
FrameBuffer::operator [] (const string &name) |
|
{ |
|
return this->operator[] (name.c_str()); |
|
} |
|
|
|
|
|
const Slice & |
|
FrameBuffer::operator [] (const string &name) const |
|
{ |
|
return this->operator[] (name.c_str()); |
|
} |
|
|
|
|
|
Slice * |
|
FrameBuffer::findSlice (const char name[]) |
|
{ |
|
SliceMap::iterator i = _map.find (name); |
|
return (i == _map.end())? 0: &i->second; |
|
} |
|
|
|
|
|
const Slice * |
|
FrameBuffer::findSlice (const char name[]) const |
|
{ |
|
SliceMap::const_iterator i = _map.find (name); |
|
return (i == _map.end())? 0: &i->second; |
|
} |
|
|
|
|
|
Slice * |
|
FrameBuffer::findSlice (const string &name) |
|
{ |
|
return findSlice (name.c_str()); |
|
} |
|
|
|
|
|
const Slice * |
|
FrameBuffer::findSlice (const string &name) const |
|
{ |
|
return findSlice (name.c_str()); |
|
} |
|
|
|
|
|
FrameBuffer::Iterator |
|
FrameBuffer::begin () |
|
{ |
|
return _map.begin(); |
|
} |
|
|
|
|
|
FrameBuffer::ConstIterator |
|
FrameBuffer::begin () const |
|
{ |
|
return _map.begin(); |
|
} |
|
|
|
|
|
FrameBuffer::Iterator |
|
FrameBuffer::end () |
|
{ |
|
return _map.end(); |
|
} |
|
|
|
|
|
FrameBuffer::ConstIterator |
|
FrameBuffer::end () const |
|
{ |
|
return _map.end(); |
|
} |
|
|
|
|
|
FrameBuffer::Iterator |
|
FrameBuffer::find (const char name[]) |
|
{ |
|
return _map.find (name); |
|
} |
|
|
|
|
|
FrameBuffer::ConstIterator |
|
FrameBuffer::find (const char name[]) const |
|
{ |
|
return _map.find (name); |
|
} |
|
|
|
|
|
FrameBuffer::Iterator |
|
FrameBuffer::find (const string &name) |
|
{ |
|
return find (name.c_str()); |
|
} |
|
|
|
|
|
FrameBuffer::ConstIterator |
|
FrameBuffer::find (const string &name) const |
|
{ |
|
return find (name.c_str()); |
|
} |
|
|
|
|
|
} // namespace Imf
|
|
|