diff options
| author | Johnny Willemsen <jwillemsen@remedy.nl> | 2012-02-27 08:11:54 +0000 |
|---|---|---|
| committer | Johnny Willemsen <jwillemsen@remedy.nl> | 2012-02-27 08:11:54 +0000 |
| commit | 7a80972705acae5e1062bc84bcb8b1cafb9b87e9 (patch) | |
| tree | ce4d7829ceda87f495bd4927067bcf6ce7e1487a /ACE/ace/Compression | |
| parent | 19aac194359730f8675501136b5fc661a08011c0 (diff) | |
| download | ATCD-7a80972705acae5e1062bc84bcb8b1cafb9b87e9.tar.gz | |
Mon Feb 27 08:11:06 UTC 2012 Johnny Willemsen <jwillemsen@remedy.nl>
* ace/Compression/rle/RLECompressor.h:
Doxygen fix
* ace/Compression/rle/RLECompressor.cpp:
Fixed gcc warning
Diffstat (limited to 'ACE/ace/Compression')
| -rw-r--r-- | ACE/ace/Compression/rle/RLECompressor.cpp | 2 | ||||
| -rw-r--r-- | ACE/ace/Compression/rle/RLECompressor.h | 6 |
2 files changed, 4 insertions, 4 deletions
diff --git a/ACE/ace/Compression/rle/RLECompressor.cpp b/ACE/ace/Compression/rle/RLECompressor.cpp index 019687c1ae1..b3cca8c2513 100644 --- a/ACE/ace/Compression/rle/RLECompressor.cpp +++ b/ACE/ace/Compression/rle/RLECompressor.cpp @@ -69,7 +69,7 @@ ACE_RLECompressor::compress( const void *in_ptr, case 128: if (++out_index >= max_out_len) { - return -1; // Output Exhausted + return ACE_UINT64(-1); // Output Exhausted } out_p[out_base = out_index] = 0; dup_count = run_count = 0; diff --git a/ACE/ace/Compression/rle/RLECompressor.h b/ACE/ace/Compression/rle/RLECompressor.h index 72d1c25658a..ce99f784db9 100644 --- a/ACE/ace/Compression/rle/RLECompressor.h +++ b/ACE/ace/Compression/rle/RLECompressor.h @@ -18,17 +18,17 @@ * images such as icons, line drawings, and animations. It is not useful * with files that don't have many runs as it could slightly increase the * output size. - * ALGORITHM: This algorithm is an optimised version of the traditional + * ALGORITHM: This algorithm is an optimized version of the traditional * RLE algorithm in that it behaves better with very few runs. * * With a run of a character where that run is >= 3 this is * replaced with the repeat indicator 0X80 and then the repeat count OR'd * over this ident. This repeat count is therefore has a maximum value - * of 127 (0x7F) which is to be interpreted as the next charater repeated + * of 127 (0x7F) which is to be interpreted as the next character repeated * another 'repeat count' times (i.e. a maximum of 128 characters can be * represented in any single dupal). if the repeat ident is not present * then the count is to be interpreted as a copy of the next repeat count - * charaters + 1. + * characters + 1. * * EXAMPLE: the following arbitary string of 67 bytes:- * WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWBWWWWWWWWWWWWWW |