A client for the SmartREST protocol from Cumulocity.

Dependencies:   SmartRest

Fork of MbedSmartRest by Vincent Wochnik

Committer:
vwochnik
Date:
Thu Jan 23 14:36:46 2014 +0000
Revision:
0:f76673e7f275
initial commit, only abstraction

Who changed what in which revision?

UserRevisionLine numberNew contents of line
vwochnik 0:f76673e7f275 1 /*
vwochnik 0:f76673e7f275 2 * Aggregator.cpp
vwochnik 0:f76673e7f275 3 *
vwochnik 0:f76673e7f275 4 * Created on: Nov 1, 2013
vwochnik 0:f76673e7f275 5 * * Authors: Vincent Wochnik <v.wochnik@gmail.com>
vwochnik 0:f76673e7f275 6 *
vwochnik 0:f76673e7f275 7 * Copyright (c) 2013 Cumulocity GmbH
vwochnik 0:f76673e7f275 8 *
vwochnik 0:f76673e7f275 9 * Permission is hereby granted, free of charge, to any person obtaining
vwochnik 0:f76673e7f275 10 * a copy of this software and associated documentation files (the
vwochnik 0:f76673e7f275 11 * "Software"), to deal in the Software without restriction, including
vwochnik 0:f76673e7f275 12 * without limitation the rights to use, copy, modify, merge, publish,
vwochnik 0:f76673e7f275 13 * distribute, sublicense, and/or sell copies of the Software, and to
vwochnik 0:f76673e7f275 14 * permit persons to whom the Software is furnished to do so, subject to
vwochnik 0:f76673e7f275 15 * the following conditions:
vwochnik 0:f76673e7f275 16 *
vwochnik 0:f76673e7f275 17 * The above copyright notice and this permission notice shall be
vwochnik 0:f76673e7f275 18 * included in all copies or substantial portions of the Software.
vwochnik 0:f76673e7f275 19 *
vwochnik 0:f76673e7f275 20 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
vwochnik 0:f76673e7f275 21 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
vwochnik 0:f76673e7f275 22 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
vwochnik 0:f76673e7f275 23 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
vwochnik 0:f76673e7f275 24 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
vwochnik 0:f76673e7f275 25 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
vwochnik 0:f76673e7f275 26 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
vwochnik 0:f76673e7f275 27 */
vwochnik 0:f76673e7f275 28
vwochnik 0:f76673e7f275 29 #include "Aggregator.h"
vwochnik 0:f76673e7f275 30 #include <stdlib.h>
vwochnik 0:f76673e7f275 31
vwochnik 0:f76673e7f275 32 #ifndef AGGREGATOR_FIXED_SIZE
vwochnik 0:f76673e7f275 33 Aggregator::Aggregator(size_t capacity, bool growing, bool copy)
vwochnik 0:f76673e7f275 34 {
vwochnik 0:f76673e7f275 35 _alloc = copy;
vwochnik 0:f76673e7f275 36 _growing = growing;
vwochnik 0:f76673e7f275 37 _initial = _capacity = capacity;
vwochnik 0:f76673e7f275 38 _list = (DataGenerator**)malloc(_capacity*sizeof(DataGenerator*));
vwochnik 0:f76673e7f275 39 _length = 0;
vwochnik 0:f76673e7f275 40 }
vwochnik 0:f76673e7f275 41 #else
vwochnik 0:f76673e7f275 42 Aggregator::Aggregator(bool copy)
vwochnik 0:f76673e7f275 43 {
vwochnik 0:f76673e7f275 44 _alloc = copy;
vwochnik 0:f76673e7f275 45 _length = 0;
vwochnik 0:f76673e7f275 46 }
vwochnik 0:f76673e7f275 47 #endif
vwochnik 0:f76673e7f275 48
vwochnik 0:f76673e7f275 49 Aggregator::~Aggregator()
vwochnik 0:f76673e7f275 50 {
vwochnik 0:f76673e7f275 51 if (_alloc) {
vwochnik 0:f76673e7f275 52 for (size_t n = 0; n < _length; n++)
vwochnik 0:f76673e7f275 53 delete _list[n];
vwochnik 0:f76673e7f275 54 }
vwochnik 0:f76673e7f275 55 #ifndef AGGREGATOR_FIXED_SIZE
vwochnik 0:f76673e7f275 56 free(_list);
vwochnik 0:f76673e7f275 57 #endif
vwochnik 0:f76673e7f275 58 }
vwochnik 0:f76673e7f275 59
vwochnik 0:f76673e7f275 60 bool Aggregator::add(DataGenerator& generator)
vwochnik 0:f76673e7f275 61 {
vwochnik 0:f76673e7f275 62 if (this == &generator)
vwochnik 0:f76673e7f275 63 return false;
vwochnik 0:f76673e7f275 64 #ifndef AGGREGATOR_FIXED_SIZE
vwochnik 0:f76673e7f275 65 if (_length == _capacity) {
vwochnik 0:f76673e7f275 66 if (!_growing)
vwochnik 0:f76673e7f275 67 return false;
vwochnik 0:f76673e7f275 68
vwochnik 0:f76673e7f275 69 size_t capacity = _capacity + AGGREGATOR_MEMORY_INCREMENT;
vwochnik 0:f76673e7f275 70 DataGenerator **list = (DataGenerator**)realloc(_list,
vwochnik 0:f76673e7f275 71 capacity*sizeof(DataGenerator*));
vwochnik 0:f76673e7f275 72 if (list == NULL)
vwochnik 0:f76673e7f275 73 return false;
vwochnik 0:f76673e7f275 74 _list = list;
vwochnik 0:f76673e7f275 75 _capacity = capacity;
vwochnik 0:f76673e7f275 76 }
vwochnik 0:f76673e7f275 77 #else
vwochnik 0:f76673e7f275 78 if (_length == AGGREGATOR_FIXED_SIZE)
vwochnik 0:f76673e7f275 79 return false;
vwochnik 0:f76673e7f275 80 #endif
vwochnik 0:f76673e7f275 81
vwochnik 0:f76673e7f275 82 if (_alloc) {
vwochnik 0:f76673e7f275 83 DataGenerator *copy = generator.copy();
vwochnik 0:f76673e7f275 84 if (copy == NULL)
vwochnik 0:f76673e7f275 85 return false;
vwochnik 0:f76673e7f275 86 _list[_length++] = copy;
vwochnik 0:f76673e7f275 87 } else {
vwochnik 0:f76673e7f275 88 _list[_length++] = &generator;
vwochnik 0:f76673e7f275 89 }
vwochnik 0:f76673e7f275 90 return true;
vwochnik 0:f76673e7f275 91 }
vwochnik 0:f76673e7f275 92
vwochnik 0:f76673e7f275 93 void Aggregator::clear()
vwochnik 0:f76673e7f275 94 {
vwochnik 0:f76673e7f275 95 if (_alloc) {
vwochnik 0:f76673e7f275 96 for (size_t n = 0; n < _length; n++)
vwochnik 0:f76673e7f275 97 delete _list[n];
vwochnik 0:f76673e7f275 98 }
vwochnik 0:f76673e7f275 99 _length = 0;
vwochnik 0:f76673e7f275 100
vwochnik 0:f76673e7f275 101 #ifndef AGGREGATOR_FIXED_SIZE
vwochnik 0:f76673e7f275 102 if (_growing) {
vwochnik 0:f76673e7f275 103 DataGenerator **list = (DataGenerator**)realloc(_list,
vwochnik 0:f76673e7f275 104 _initial*sizeof(DataGenerator*));
vwochnik 0:f76673e7f275 105 if (list == NULL)
vwochnik 0:f76673e7f275 106 return;
vwochnik 0:f76673e7f275 107 _list = list;
vwochnik 0:f76673e7f275 108 _capacity = _initial;
vwochnik 0:f76673e7f275 109 }
vwochnik 0:f76673e7f275 110 #endif
vwochnik 0:f76673e7f275 111 }
vwochnik 0:f76673e7f275 112
vwochnik 0:f76673e7f275 113 size_t Aggregator::length()
vwochnik 0:f76673e7f275 114 {
vwochnik 0:f76673e7f275 115 return _length;
vwochnik 0:f76673e7f275 116 }
vwochnik 0:f76673e7f275 117
vwochnik 0:f76673e7f275 118 bool Aggregator::full()
vwochnik 0:f76673e7f275 119 {
vwochnik 0:f76673e7f275 120 #ifndef AGGREGATOR_FIXED_SIZE
vwochnik 0:f76673e7f275 121 return (_growing) ? false : (_length == _capacity);
vwochnik 0:f76673e7f275 122 #else
vwochnik 0:f76673e7f275 123 return (_length == AGGREGATOR_FIXED_SIZE);
vwochnik 0:f76673e7f275 124 #endif
vwochnik 0:f76673e7f275 125 }
vwochnik 0:f76673e7f275 126
vwochnik 0:f76673e7f275 127 size_t Aggregator::capacity()
vwochnik 0:f76673e7f275 128 {
vwochnik 0:f76673e7f275 129 #ifndef AGGREGATOR_FIXED_SIZE
vwochnik 0:f76673e7f275 130 return (_growing) ? 0 : _capacity;
vwochnik 0:f76673e7f275 131 #else
vwochnik 0:f76673e7f275 132 return AGGREGATOR_FIXED_SIZE;
vwochnik 0:f76673e7f275 133 #endif
vwochnik 0:f76673e7f275 134 }
vwochnik 0:f76673e7f275 135
vwochnik 0:f76673e7f275 136 size_t Aggregator::writeTo(AbstractDataSink& sink) const
vwochnik 0:f76673e7f275 137 {
vwochnik 0:f76673e7f275 138 size_t len = 0;
vwochnik 0:f76673e7f275 139 for (size_t n = 0; n < _length; n++)
vwochnik 0:f76673e7f275 140 len += _list[n]->writeTo(sink);
vwochnik 0:f76673e7f275 141 return len;
vwochnik 0:f76673e7f275 142 }
vwochnik 0:f76673e7f275 143
vwochnik 0:f76673e7f275 144 size_t Aggregator::writtenLength() const
vwochnik 0:f76673e7f275 145 {
vwochnik 0:f76673e7f275 146 size_t len = 0;
vwochnik 0:f76673e7f275 147 for (size_t n = 0; n < _length; n++)
vwochnik 0:f76673e7f275 148 len += _list[n]->writtenLength();
vwochnik 0:f76673e7f275 149 return len;
vwochnik 0:f76673e7f275 150 }
vwochnik 0:f76673e7f275 151
vwochnik 0:f76673e7f275 152 DataGenerator* Aggregator::copy() const
vwochnik 0:f76673e7f275 153 {
vwochnik 0:f76673e7f275 154 #ifndef AGGREGATOR_FIXED_SIZE
vwochnik 0:f76673e7f275 155 Aggregator *copy = new Aggregator(_length, _growing, true);
vwochnik 0:f76673e7f275 156 #else
vwochnik 0:f76673e7f275 157 Aggregator *copy = new Aggregator(true);
vwochnik 0:f76673e7f275 158 #endif
vwochnik 0:f76673e7f275 159 for (size_t n = 0; n < _length; n++)
vwochnik 0:f76673e7f275 160 copy->add(*_list[n]);
vwochnik 0:f76673e7f275 161 return copy;
vwochnik 0:f76673e7f275 162 }
vwochnik 0:f76673e7f275 163