|
1 /* |
|
2 * Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies). |
|
3 * All rights reserved. |
|
4 * |
|
5 * Redistribution and use in source and binary forms, with or without |
|
6 * modification, are permitted provided that the following conditions are met: |
|
7 * |
|
8 * - Redistributions of source code must retain the above copyright notice, |
|
9 * this list of conditions and the following disclaimer. |
|
10 * - Redistributions in binary form must reproduce the above copyright notice, |
|
11 * this list of conditions and the following disclaimer in the documentation |
|
12 * and/or other materials provided with the distribution. |
|
13 * - Neither the name of Nokia Corporation nor the names of its contributors |
|
14 * may be used to endorse or promote products derived from this software |
|
15 * without specific prior written permission. |
|
16 * |
|
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
|
18 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
|
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
|
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
|
21 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
|
22 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
|
23 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
|
24 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
|
25 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
|
26 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|
27 * POSSIBILITY OF SUCH DAMAGE. |
|
28 * |
|
29 * Initial Contributors: |
|
30 * Nokia Corporation - initial contribution. |
|
31 * |
|
32 * Contributors: |
|
33 * |
|
34 * Description: |
|
35 * |
|
36 */ |
|
37 |
|
38 using System; |
|
39 using System.Collections.Generic; |
|
40 using System.Text; |
|
41 using SymbianUtils.RawItems; |
|
42 using HeapLib.Statistics; |
|
43 |
|
44 namespace HeapLib.Cells.Descriptors.Implementations.Ascii |
|
45 { |
|
46 internal class DesAsciiAlgorithmBase : DescriptorAlgorithmBase |
|
47 { |
|
48 #region Constructors & destructor |
|
49 public DesAsciiAlgorithmBase( HeapStatistics aStats ) |
|
50 : base( aStats ) |
|
51 { |
|
52 } |
|
53 #endregion |
|
54 |
|
55 #region Internal constants |
|
56 protected const int KDescriptorRawItemOffsetEBufC = KDescriptorRawItemOffsetAfterLengthAndType + 1; // Allows for [Type+Length] + MaxLength |
|
57 #endregion |
|
58 |
|
59 #region Internal methods |
|
60 protected string ConvertToText( int aLengthInUnicodeChars ) |
|
61 { |
|
62 return ConvertToText( aLengthInUnicodeChars, KDescriptorRawItemOffsetAfterLengthAndType ); |
|
63 } |
|
64 |
|
65 protected string ConvertToText( int aLengthInAsciiChars, int aStartRawItemIndex ) |
|
66 { |
|
67 StringBuilder text = new StringBuilder(); |
|
68 for ( int i = aStartRawItemIndex; i < RawItems.Count && i < Math.Min( aLengthInAsciiChars, DescriptorAlgorithmBase.KDescriptorTextMaxLength ); i++ ) |
|
69 { |
|
70 RawItem item = RawItems[ i ]; |
|
71 // |
|
72 text.Append( item.OriginalCharacterisedData ); |
|
73 } |
|
74 // |
|
75 string ret = text.ToString(); |
|
76 if ( ret.Length > aLengthInAsciiChars ) |
|
77 { |
|
78 ret = ret.Substring( 0, aLengthInAsciiChars ); |
|
79 } |
|
80 return ret; |
|
81 } |
|
82 |
|
83 protected int PrintableCharacterCount( int aMaxNumberOfAsciiBytesToProcess, out bool aAllBytesWereAsciiCharacters ) |
|
84 { |
|
85 return PrintableCharacterCount( aMaxNumberOfAsciiBytesToProcess, KDescriptorRawItemOffsetAfterLengthAndType, out aAllBytesWereAsciiCharacters ); |
|
86 } |
|
87 |
|
88 protected int PrintableCharacterCount( int aMaxNumberOfAsciiBytesToProcess, int aStartRawItemIndex, out bool aAllBytesWereAsciiCharacters ) |
|
89 { |
|
90 int printableCharCount = 0; |
|
91 int bytesRemaining = aMaxNumberOfAsciiBytesToProcess; |
|
92 |
|
93 for ( int i = aStartRawItemIndex; i < RawItems.Count && bytesRemaining > 0; i++ ) |
|
94 { |
|
95 RawItem item = RawItems[ i ]; |
|
96 byte[] data = item.DataArray; |
|
97 // |
|
98 for ( int j = 0; j < data.Length && bytesRemaining > 0; j++ ) |
|
99 { |
|
100 byte b = data[ j ]; |
|
101 bool byteIsPrint = IsPrintableAsciiCharacter( b ); |
|
102 if ( byteIsPrint ) |
|
103 { |
|
104 ++printableCharCount; |
|
105 } |
|
106 --bytesRemaining; |
|
107 } |
|
108 } |
|
109 // |
|
110 aAllBytesWereAsciiCharacters = ( aMaxNumberOfAsciiBytesToProcess == printableCharCount ); |
|
111 return printableCharCount; |
|
112 } |
|
113 |
|
114 protected static bool IsPrintableAsciiCharacter( byte aByte ) |
|
115 { |
|
116 bool ret = false; |
|
117 // |
|
118 if ( aByte >= 32 /*SPACE*/ && aByte < 127 /*DEL*/ || aByte == 0x0D /*CR*/ || aByte == 0x0A /*LF*/ || aByte == 0x09 /*TAB*/ ) |
|
119 { |
|
120 ret = true; |
|
121 } |
|
122 // |
|
123 return ret; |
|
124 } |
|
125 #endregion |
|
126 } |
|
127 } |