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
|
<?php
namespace EasyRdf;
/**
* EasyRdf
*
* LICENSE
*
* Copyright (c) 2013-2014 Nicholas J Humfrey. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
* 3. The name of the author 'Nicholas J Humfrey" 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.
*
* @package EasyRdf
* @copyright Copyright (c) 2013-2014 Nicholas J Humfrey
* @license https://www.opensource.org/licenses/bsd-license.php
*/
/**
* Sub-class of EasyRdf\Resource that represents an RDF container
* (rdf:Alt, rdf:Bag and rdf:Seq)
*
* This class can be used to iterate through a list of items.
*
* @package EasyRdf
* @link http://www.w3.org/TR/xmlschema-2/#date
* @copyright Copyright (c) 2013-2014 Nicholas J Humfrey
* @license https://www.opensource.org/licenses/bsd-license.php
*/
class Container extends Resource implements \ArrayAccess, \Countable, \SeekableIterator
{
private $position;
/** Create a new container - do not use this directly
*
* @ignore
*/
public function __construct($uri, $graph)
{
$this->position = 1;
parent::__construct($uri, $graph);
}
/** Seek to a specific position in the container
*
* The first item is postion 1
*
* @param integer $position The position in the container to seek to
*
* @throws \OutOfBoundsException
* @throws \InvalidArgumentException
*/
public function seek($position)
{
if (is_int($position) and $position > 0) {
if ($this->hasProperty('rdf:_'.$position)) {
$this->position = $position;
} else {
throw new \OutOfBoundsException(
"Unable to seek to position $position in the container"
);
}
} else {
throw new \InvalidArgumentException(
"Container position must be a positive integer"
);
}
}
/** Rewind the iterator back to the start of the container (item 1)
*
*/
public function rewind()
{
$this->position = 1;
}
/** Return the current item in the container
*
* @return mixed The current item
*/
public function current()
{
return $this->get('rdf:_'.$this->position);
}
/** Return the key / current position in the container
*
* @return int The current position
*/
public function key()
{
return $this->position;
}
/** Move forward to next item in the container
*
*/
public function next()
{
$this->position++;
}
/** Checks if current position is valid
*
* @return bool True if the current position is valid
*/
public function valid()
{
return $this->hasProperty('rdf:_'.$this->position);
}
/** Counts the number of items in the container
*
* Note that this is an slow method - it is more efficient to use
* the iterator interface, if you can.
*
* @return integer The number of items in the container
*/
public function count()
{
$pos = 1;
while ($this->hasProperty('rdf:_'.$pos)) {
$pos++;
}
return $pos - 1;
}
/** Append an item to the end of the container
*
* @param mixed $value The value to append
*
* @return integer The number of values appended (1 or 0)
*/
public function append($value)
{
// Find the end of the list
$pos = 1;
while ($this->hasProperty('rdf:_'.$pos)) {
$pos++;
}
// Add the item
return $this->add('rdf:_'.$pos, $value);
}
/** Array Access: check if a position exists in container using array syntax
*
* Example: isset($seq[2])
*/
public function offsetExists($offset)
{
if (is_int($offset) and $offset > 0) {
return $this->hasProperty('rdf:_'.$offset);
} else {
throw new \InvalidArgumentException(
"Container position must be a positive integer"
);
}
}
/** Array Access: get an item at a specified position in container using array syntax
*
* Example: $item = $seq[2];
*/
public function offsetGet($offset)
{
if (is_int($offset) and $offset > 0) {
return $this->get('rdf:_'.$offset);
} else {
throw new \InvalidArgumentException(
"Container position must be a positive integer"
);
}
}
/**
* Array Access: set an item at a positon in container using array syntax
*
* Example: $seq[2] = $item;
*
* Warning: creating gaps in the sequence will result in unexpected behavior
*/
public function offsetSet($offset, $value)
{
if (is_int($offset) and $offset > 0) {
return $this->set('rdf:_'.$offset, $value);
} elseif (is_null($offset)) {
return $this->append($value);
} else {
throw new \InvalidArgumentException(
"Container position must be a positive integer"
);
}
}
/**
* Array Access: delete an item at a specific postion using array syntax
*
* Example: unset($seq[2]);
*
* Warning: creating gaps in the sequence will result in unexpected behavior
*/
public function offsetUnset($offset)
{
if (is_int($offset) and $offset > 0) {
return $this->delete('rdf:_'.$offset);
} else {
throw new \InvalidArgumentException(
"Container position must be a positive integer"
);
}
}
}
|