nerdcruft/libcruft-util
1
0
Fork 0
Code Issues Releases Activity

whitespace

Browse Source
This commit is contained in:
Danny Robson 2014-05-20 13:44:27 +10:00
parent 61634286d3
commit 304ddbfedd
3 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
hash/sha1.cpp
View File

@ -5,12 +5,12 @@
* terms of the GNU General Public License as published by the Free Software * terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later * Foundation, either version 3 of the License, or (at your option) any later
* version. * version.
* *
* libgim is distributed in the hope that it will be useful, but WITHOUT ANY * libgim is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
* details. * details.
* *
* You should have received a copy of the GNU General Public License * You should have received a copy of the GNU General Public License
* along with libgim. If not, see <http://www.gnu.org/licenses/>. * along with libgim. If not, see <http://www.gnu.org/licenses/>.
* *
@ -100,7 +100,7 @@ SHA1::update (const uint8_t *data, size_t size) {
// Copy the data into the remaining available buffer slots // Copy the data into the remaining available buffer slots
const size_t offset = total % BLOCK_BYTES; const size_t offset = total % BLOCK_BYTES;
const size_t chunk = std::min (BLOCK_BYTES - offset, size); const size_t chunk = std::min (BLOCK_BYTES - offset, size);
std::copy (data, data + chunk, c + offset); std::copy (data, data + chunk, c + offset);
total += chunk; total += chunk;

4
noise/fractal.cpp
View File

@ -5,12 +5,12 @@
* terms of the GNU General Public License as published by the Free Software * terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later * Foundation, either version 3 of the License, or (at your option) any later
* version. * version.
* *
* libgim is distributed in the hope that it will be useful, but WITHOUT ANY * libgim is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
* details. * details.
* *
* You should have received a copy of the GNU General Public License * You should have received a copy of the GNU General Public License
* along with libgim. If not, see <http://www.gnu.org/licenses/>. * along with libgim. If not, see <http://www.gnu.org/licenses/>.
* *

4
pool.ipp
View File

@ -52,7 +52,7 @@ namespace util {
CHECK_EQ (doomed_count, m_capacity); CHECK_EQ (doomed_count, m_capacity);
operator delete (m_head); operator delete (m_head);
} }
template <typename T> template <typename T>
unsigned int unsigned int
@ -69,7 +69,7 @@ namespace util {
node *newnext = m_next->_chain; node *newnext = m_next->_chain;
T *data = (T*)&m_next->_data; T *data = (T*)&m_next->_data;
try { try {
new (data) T (args...); new (data) T (args...);
} catch (...) { } catch (...) {