1 : /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
2 : /* vim:set ts=2 sw=2 sts=2 et cindent: */
3 : /* ***** BEGIN LICENSE BLOCK *****
4 : * Version: MPL 1.1/GPL 2.0/LGPL 2.1
5 : *
6 : * The contents of this file are subject to the Mozilla Public License Version
7 : * 1.1 (the "License"); you may not use this file except in compliance with
8 : * the License. You may obtain a copy of the License at
9 : * http://www.mozilla.org/MPL/
10 : *
11 : * Software distributed under the License is distributed on an "AS IS" basis,
12 : * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
13 : * for the specific language governing rights and limitations under the
14 : * License.
15 : *
16 : * The Original Code is Mozilla.
17 : *
18 : * The Initial Developer of the Original Code is IBM Corporation.
19 : * Portions created by IBM Corporation are Copyright (C) 2003
20 : * IBM Corporation. All Rights Reserved.
21 : *
22 : * Contributor(s):
23 : * Darin Fisher <darin@meer.net>
24 : *
25 : * Alternatively, the contents of this file may be used under the terms of
26 : * either the GNU General Public License Version 2 or later (the "GPL"), or
27 : * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
28 : * in which case the provisions of the GPL or the LGPL are applicable instead
29 : * of those above. If you wish to allow use of your version of this file only
30 : * under the terms of either the GPL or the LGPL, and not to allow others to
31 : * use your version of this file under the terms of the MPL, indicate your
32 : * decision by deleting the provisions above and replace them with the notice
33 : * and other provisions required by the GPL or the LGPL. If you do not delete
34 : * the provisions above, a recipient may use your version of this file under
35 : * the terms of any one of the MPL, the GPL or the LGPL.
36 : *
37 : * ***** END LICENSE BLOCK ***** */
38 :
39 :
40 : /**
41 : * computes the aggregate string length
42 : */
43 :
44 : nsTSubstringTuple_CharT::size_type
45 902331 : nsTSubstringTuple_CharT::Length() const
46 : {
47 : PRUint32 len;
48 902331 : if (mHead)
49 63278 : len = mHead->Length();
50 : else
51 839053 : len = TO_SUBSTRING(mFragA).Length();
52 :
53 902331 : return len + TO_SUBSTRING(mFragB).Length();
54 : }
55 :
56 :
57 : /**
58 : * writes the aggregate string to the given buffer. bufLen is assumed
59 : * to be equal to or greater than the value returned by the Length()
60 : * method. the string written to |buf| is not null-terminated.
61 : */
62 :
63 : void
64 902331 : nsTSubstringTuple_CharT::WriteTo( char_type *buf, PRUint32 bufLen ) const
65 : {
66 902331 : const substring_type& b = TO_SUBSTRING(mFragB);
67 :
68 902331 : NS_ASSERTION(bufLen >= b.Length(), "buffer too small");
69 902331 : PRUint32 headLen = bufLen - b.Length();
70 902331 : if (mHead)
71 : {
72 63278 : mHead->WriteTo(buf, headLen);
73 : }
74 : else
75 : {
76 839053 : const substring_type& a = TO_SUBSTRING(mFragA);
77 :
78 839053 : NS_ASSERTION(a.Length() == headLen, "buffer incorrectly sized");
79 839053 : char_traits::copy(buf, a.Data(), a.Length());
80 : }
81 :
82 902331 : char_traits::copy(buf + headLen, b.Data(), b.Length());
83 :
84 : #if 0
85 : // we need to write out data into |buf|, ending at |buf+bufLen|. so our
86 : // data needs to precede |buf+bufLen| exactly. we trust that the buffer
87 : // was properly sized!
88 :
89 : const substring_type& b = TO_SUBSTRING(mFragB);
90 :
91 : NS_ASSERTION(bufLen >= b.Length(), "buffer is too small");
92 : char_traits::copy(buf + bufLen - b.Length(), b.Data(), b.Length());
93 :
94 : bufLen -= b.Length();
95 :
96 : if (mHead)
97 : {
98 : mHead->WriteTo(buf, bufLen);
99 : }
100 : else
101 : {
102 : const substring_type& a = TO_SUBSTRING(mFragA);
103 : NS_ASSERTION(bufLen == a.Length(), "buffer is too small");
104 : char_traits::copy(buf, a.Data(), a.Length());
105 : }
106 : #endif
107 902331 : }
108 :
109 :
110 : /**
111 : * returns true if this tuple is dependent on (i.e., overlapping with)
112 : * the given char sequence.
113 : */
114 :
115 : bool
116 902331 : nsTSubstringTuple_CharT::IsDependentOn( const char_type *start, const char_type *end ) const
117 : {
118 : // we start with the right-most fragment since it is faster to check.
119 :
120 902331 : if (TO_SUBSTRING(mFragB).IsDependentOn(start, end))
121 0 : return true;
122 :
123 902331 : if (mHead)
124 63278 : return mHead->IsDependentOn(start, end);
125 :
126 839053 : return TO_SUBSTRING(mFragA).IsDependentOn(start, end);
127 : }
|