summaryrefslogtreecommitdiff
path: root/XMPFiles/source/FormatSupport/IFF/ChunkPath.cpp
blob: b399cd066669676d9765f88dbf7bf5ad8b29987c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
// =================================================================================================
// Copyright Adobe
// Copyright 2010 Adobe
// All Rights Reserved
//
// NOTICE: Adobe permits you to use, modify, and distribute this file in accordance with the terms
// of the Adobe license agreement accompanying it. 
// =================================================================================================

#include "XMPFiles/source/FormatSupport/IFF/ChunkPath.h"
#include "source/XMP_LibUtils.hpp"

#include <vector>

using namespace IFF_RIFF;

typedef std::vector<ChunkIdentifier>::size_type  ChunkSizeType;

//-----------------------------------------------------------------------------
// 
// ChunkPath::ChunkPath(...)
// 
// Purpose: ctor/dtor
// 
//-----------------------------------------------------------------------------

ChunkPath::ChunkPath( const ChunkIdentifier* path /*= NULL*/, XMP_Uns32 size /*=0*/ )
{
	if( path != NULL )
	{
		for( XMP_Uns32 i=0; i<size; i++ )
		{
			this->append( path[i] );
		}
	}
}

ChunkPath::ChunkPath( const ChunkPath& path )
{
	for( XMP_Int32 i=0; i<path.length(); i++ )
	{
		this->append( path.identifier(i) );
	}
}

ChunkPath::ChunkPath( const ChunkIdentifier& identifier )
{
	this->append( identifier );
}

ChunkPath::~ChunkPath()
{
	this->clear();
}


ChunkPath &	ChunkPath::operator=( const ChunkPath &rhs )
{
	for( XMP_Int32 i = 0; i < rhs.length(); i++ )
	{
		this->append( rhs.identifier(i) );
	}
	
	return *this;
}

//-----------------------------------------------------------------------------
// 
// ChunkPath::clear(...)
// 
// Purpose: Remove all ChunkIdentifier's from the path
// 
//-----------------------------------------------------------------------------

void ChunkPath::clear()
{
	mPath.clear();
}

//-----------------------------------------------------------------------------
// 
// ChunkPath::append(...)
// 
// Purpose: Append a ChunkIdentifier to the end of the path
// 
//-----------------------------------------------------------------------------

void ChunkPath::append( XMP_Uns32 id, XMP_Uns32 type /*= kType_NONE*/ )
{
	ChunkIdentifier ci;
	
	ci.id	 = id;
	ci.type = type;
	
	mPath.push_back(ci);
}


void ChunkPath::append( const ChunkIdentifier& identifier )
{
	mPath.push_back(identifier);
}


void ChunkPath::append( const ChunkIdentifier* path, XMP_Uns32 size )
{
	if( path != NULL )
	{
		for( XMP_Uns32 i=0; i < size; i++ )
		{
			this->append( path[i] );
		}
	}
}

//-----------------------------------------------------------------------------
// 
// ChunkPath::insert(...)
// 
// Purpose: Insert an identifier
// 
//-----------------------------------------------------------------------------

void ChunkPath::insert( const ChunkIdentifier& identifier, XMP_Uns32 pos /*= 0*/ )
{
	if( pos >= mPath.size() )
	{
		this->append( identifier );
	}
	else
	{
		mPath.insert( mPath.begin() + pos, identifier );
	}
}
	
//-----------------------------------------------------------------------------
// 
// ChunkPath::remove(...)
// 
// Purpose: Remove the endmost ChunkIdentifier from the path
// 
//-----------------------------------------------------------------------------

void ChunkPath::remove()
{
	mPath.pop_back();
}

//-----------------------------------------------------------------------------
// 
// ChunkPath::removeAt(...)
// 
// Purpose: Remove the ChunkIdentifier at the passed position in the path
// 
//-----------------------------------------------------------------------------

void ChunkPath::removeAt( XMP_Int32 pos )
{
	if( ! mPath.empty() && pos >= 0 && (ChunkSizeType)pos < mPath.size() )
	{
		mPath.erase( mPath.begin() + pos );
	}
	else
	{
		XMP_Throw( "Index out of range.", kXMPErr_BadIndex );
	}
}

//-----------------------------------------------------------------------------
// 
// ChunkPath::identifier(...)
// 
// Purpose: Return ChunkIdentifier at the passed position
// 
//-----------------------------------------------------------------------------

const ChunkIdentifier& ChunkPath::identifier( XMP_Int32 pos ) const
{
	return mPath.at(pos);
}

//-----------------------------------------------------------------------------
// 
// ChunkPath::length(...)
// 
// Purpose: Return the number of ChunkIdentifier's in the path
// 
//-----------------------------------------------------------------------------

XMP_Int32 ChunkPath::length() const
{
	return (XMP_Int32)mPath.size();
}

//-----------------------------------------------------------------------------
// 
// ChunkPath::match(...)
// 
// Purpose: Compare the passed ChunkPath with this path.
// 
//-----------------------------------------------------------------------------

ChunkPath::MatchResult ChunkPath::match( const ChunkPath& path ) const
{
	MatchResult ret			= kNoMatch;

	if( path.length() > 0 )
	{
		XMP_Int32 depth			= ( this->length() > path.length() ? path.length() : this->length() );
		XMP_Int32 matchCount	= 0;

		for( XMP_Int32 i=0; i<depth; i++ )
		{
			const ChunkIdentifier& id1 = this->identifier(i);
			const ChunkIdentifier& id2 = path.identifier(i);

			if( id1.id == id2.id )
			{
				if( i == this->length() - 1 && id1.type == kType_NONE )
				{
					matchCount++;
				}
				else if( id1.type == id2.type )
				{
					matchCount++;
				}
			}
			else
				break;
		}

		if( matchCount == depth )
		{
			ret = ( path.length() >= this->length() ? kFullMatch : kPartMatch );
		}
	}

	return ret;
}