File: IdentifierCaps.pas

package info (click to toggle)
lazarus 4.0%2Bdfsg-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 275,760 kB
  • sloc: pascal: 2,341,904; xml: 509,420; makefile: 348,726; cpp: 93,608; sh: 3,387; java: 609; perl: 297; sql: 222; ansic: 137
file content (269 lines) | stat: -rw-r--r-- 8,706 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
unit IdentifierCaps;

{(*}
(*------------------------------------------------------------------------------
 Delphi Code formatter source code

The Original Code is IdentifierCaps, released June 2005.
The Initial Developer of the Original Code is Anthony Steele.
Portions created by Anthony Steele are Copyright (C) 1999-2008 Anthony Steele.
All Rights Reserved.
Contributor(s): Anthony Steele.

The contents of this file are subject to the Mozilla Public License Version 1.1
(the "License"). you may not use this file except in compliance with the License.
You may obtain a copy of the License at http://www.mozilla.org/NPL/

Software distributed under the License is distributed on an "AS IS" basis,
WITHOUT WARRANTY OF ANY KIND, either express or implied.
See the License for the specific language governing rights and limitations
under the License.

Alternatively, the contents of this file may be used under the terms of
the GNU General Public License Version 2 or later (the "GPL") 
See http://www.gnu.org/licenses/gpl.html
------------------------------------------------------------------------------*)
{*)}

{ AFS 30 December 2002
    - fix capitalisation on specified words
}
{$mode delphi}

interface

uses
  SysUtils,
  SwitchableVisitor, SourceToken, AvgLvlTree;

type
  TIdentifierCaps = class(TSwitchableVisitor)
  private
    fiIdentifierCount: integer;
    fiNonIdentifierCount: integer;
    lsLastChange: string;
    TreeIdentifiers: TAvgLvlTree;
    TreeNotIdentifiers: TAvgLvlTree;
  protected
    function EnabledVisitSourceToken(const pcNode: TObject): boolean; override;
    // use the first ocurrence (declaration) of the identifier in the source as normalized capitalisation.
    function TreeGetNormalizedIdentifierCapitalisation(ATree:TAvgLvlTree; Aidentifier:string):string;
    procedure UpdateToken(AToken: TSourceToken; AValue:string);
  public
    constructor Create; override;
    destructor Destroy; override;

    function IsIncludedInSettings: boolean; override;
    { return true if you want the message logged}
    function FinalSummary(out psMessage: string): boolean; override;
  end;

implementation

uses
  { local }
  Tokens, ParseTreeNodeType,
  JcfSettings, FormatFlags, TokenUtils, jcfbaseConsts;


type
  TTreeNodeData = class
    lsIdentifier: string;
    lsIdentifierLowerCase: string;
  end;

function CompareTreeNodesCaseSensitive(Data1, Data2: Pointer): integer;
begin
  Result:=CompareStr(TTreeNodeData(Data1).lsIdentifierLowerCase,TTreeNodeData(Data2).lsIdentifierLowerCase);
end;

function CompareIdentifierTreeNodeCaseSensitive(AIdentifier, AData: Pointer): integer;
begin
  Result:=CompareStr(string(AIdentifier),TTreeNodeData(AData).lsIdentifierLowerCase);
end;

function TIdentifierCaps.TreeGetNormalizedIdentifierCapitalisation(ATree:TAvgLvlTree; AIdentifier:string):string;
var
  Node:TAvgLvlTreeNode;
  NodeData: TTreeNodeData;
  lsLower: string;
begin
  result := '';
  lsLower := LowerCase(AIdentifier);
  Node:=ATree.FindKey(Pointer(lsLower),@CompareIdentifierTreeNodeCaseSensitive);
  if Node <> nil then
    Result:= TTreeNodeData(Node.Data).lsIdentifier
  else
  begin
    result := AIdentifier;
    NodeData := TTreeNodeData.Create;
    NodeData.lsIdentifier := AIdentifier;
    NodeData.lsIdentifierLowerCase := lsLower;
    ATree.Add(NodeData);
  end;
end;

function Excluded(const pt: TSourceToken): boolean;
begin
  Result := False;

  { directives in context are excluded }
  if IsDirectiveInContext(pt) then
    exit(True);

  // asm has other rules
  if pt.HasParentNode(nAsm) then
    exit(True);

  { built in types that are actually being used as types are excluded
    eg.
    // this use of 'integer' is definitly the type
    var li: integer;

    // this use is definitely not
    function Integer(const ps: string): integer;

    // this use is ambigous
    li := Integer(SomeVar);

   user defined types are things that we often *want* to set a specific caps on
   so they are not excluded }
   if (not FormattingSettings.Caps.NotIdentifiersNormalizeCapitalisation) and
     (pt.TokenType in BuiltInTypes) and (pt.HasParentNode(nType)) then
     exit(True);
end;


{ TIdentifierCaps }

constructor TIdentifierCaps.Create;
begin
  inherited;
  fiIdentifierCount  := 0;
  fiNonIdentifierCount := 0;

  lsLastChange := '';
  FormatFlags  := FormatFlags + [eCapsSpecificWord];
  TreeIdentifiers := TAvgLvlTree.Create(@CompareTreeNodesCaseSensitive);
  TreeNotIdentifiers := TAvgLvlTree.Create(@CompareTreeNodesCaseSensitive);
end;

destructor TIdentifierCaps.Destroy;
begin
  TreeIdentifiers.FreeAndClear; // free nodes and objects
  TreeIdentifiers.Free;
  TreeNotIdentifiers.FreeAndClear; // free nodes and objects
  TreeNotIdentifiers.Free;
  inherited Destroy;
end;

function TIdentifierCaps.FinalSummary(out psMessage: string): boolean;
begin
  Result := False;
  psMessage := '';


  if (fiIdentifierCount > 0) then
  begin
    Result := True;
    if fiIdentifierCount = 1 then
      psMessage := Format(lisMsgOneChangeWasMade, [lisMsgIdentifierCaps, lsLastChange])
    else
      psMessage := Format(lisMsgChangesWhereMade, [lisMsgIdentifierCaps, fiIdentifierCount]);
  end;

  if (fiNonIdentifierCount > 0) then
  begin
    Result := True;
    if psMessage <> '' then
      psMessage := psMessage + '.   ';

    if fiNonIdentifierCount = 1 then
      psMessage := psMessage + Format(lisMsgOneChangeWasMade, [lisMsgNonIdentifierCaps, lsLastChange])
    else
      psMessage := psMessage + Format(lisMsgChangesWhereMade, [lisMsgNonIdentifierCaps, fiNonIdentifierCount]);
  end;

end;

procedure TIdentifierCaps.UpdateToken(AToken: TSourceToken; AValue:string);
begin
  if AnsiCompareStr(AToken.SourceCode, AValue) <> 0 then
  begin
    lsLastChange := Format(lisMsgTo, [AToken.SourceCode, AValue]);
    AToken.SourceCode := AValue;
    Inc(fiNonIdentifierCount);
  end;
end;

function TIdentifierCaps.EnabledVisitSourceToken(const pcNode: TObject): boolean;
const
  NEITHER_NOR = [ttReturn, ttComment, ttWhiteSpace, ttConditionalCompilationRemoved, ttNumber, ttQuotedLiteralString];
var
  lcSourceToken: TSourceToken;
  lcTreeNonIdentifiers: TAvgLvlTree;
begin
  Result := False;

  lcSourceToken := TSourceToken(pcNode);

  { these tokens are common and/or long,
   but are not capitalisable text at all, don't waste time on them }
  if lcSourceToken.TokenType in NEITHER_NOR then
    exit;

  if Excluded(lcSourceToken) then
    exit;

  if FormattingSettings.Caps.NormalizeCapitalisationOneNamespace then
    lcTreeNonIdentifiers := TreeIdentifiers
  else
    lcTreeNonIdentifiers := TreeNotIdentifiers;

  if lcSourceToken.HasParentNode(nIdentifier, 2) then
  begin
    // it's an identifier
    if FormattingSettings.IdentifierCaps.Enabled then
    begin
      if FormattingSettings.IdentifierCaps.HasWord(lcSourceToken.SourceCode) then
        UpdateToken(lcSourceToken, FormattingSettings.IdentifierCaps.CapitaliseWord(lcSourceToken.SourceCode))
      else
      begin
        if FormattingSettings.Caps.Enabled and FormattingSettings.Caps.IdentifiersNormalizeCapitalisation then
          UpdateToken(lcSourceToken, TreeGetNormalizedIdentifierCapitalisation(TreeIdentifiers, lcSourceToken.SourceCode));
      end;
    end
    else
    begin
      if FormattingSettings.Caps.Enabled and FormattingSettings.Caps.IdentifiersNormalizeCapitalisation then
        UpdateToken(lcSourceToken, TreeGetNormalizedIdentifierCapitalisation(TreeIdentifiers, lcSourceToken.SourceCode));
    end;
  end
  else
  begin
    // it's not an identifier 
    if FormattingSettings.NotIdentifierCaps.Enabled then
    begin
      if FormattingSettings.NotIdentifierCaps.HasWord(lcSourceToken.SourceCode) then
        UpdateToken(lcSourceToken, FormattingSettings.NotIdentifierCaps.CapitaliseWord(lcSourceToken.SourceCode))
      else
      begin
        if FormattingSettings.Caps.Enabled and FormattingSettings.Caps.NotIdentifiersNormalizeCapitalisation then
          UpdateToken(lcSourceToken, TreeGetNormalizedIdentifierCapitalisation(lcTreeNonIdentifiers, lcSourceToken.SourceCode));
      end;
    end
    else
    begin
      if FormattingSettings.Caps.Enabled and FormattingSettings.Caps.NotIdentifiersNormalizeCapitalisation then
        UpdateToken(lcSourceToken, TreeGetNormalizedIdentifierCapitalisation(lcTreeNonIdentifiers, lcSourceToken.SourceCode));
    end;
  end;
end;

function TIdentifierCaps.IsIncludedInSettings: boolean;
begin
  Result := FormattingSettings.IdentifierCaps.Enabled or FormattingSettings.NotIdentifierCaps.Enabled or
    (FormattingSettings.Caps.Enabled and (FormattingSettings.Caps.IdentifiersNormalizeCapitalisation or FormattingSettings.Caps.NotIdentifiersNormalizeCapitalisation));
end;

end.