Changeset 5 for trunk/UKConfig.pas

Timestamp:

May 1, 2014, 11:31:03 PM (10 years ago)

Author:

chronos

Message:

• Added: Compare form to show differences between two linux versions.
• Added: Faster binary search through TConfigMenu tree.
• Added: Some actions icons.

File:

• trunk/UKConfig.pas (modified) (8 diffs)

trunk/UKConfig.pas

@@ -41 +41 @@
     procedure LoadTreeNode(Node: TTreeNode; Options: TLoadTreeOptions = []); virtual;
     procedure LoadStats(List: TStrings); virtual;
+    procedure GetNodes(List: TStrings); virtual;
     procedure SaveToList(List: TStrings); virtual;
-    procedure PrepareMoveList(var List: TObjectMoves); virtual;
+    procedure PrepareMoveList(Lookup: TStringList; var List: TObjectMoves); virtual;
+    function GetCount: Integer; virtual;
     function GetTopNode: TMenuNode; virtual;
     function FindNode(ID: string): TMenuNode; virtual;
@@ -63 +65 @@
     TopNode: TMenuNode;
     BaseDir: string;
+    procedure PrepareMoveList(var List: TObjectMoves);
+    procedure CompareStringLists(List1, List2: TStringList; Missing1,
+      Missing2: TStrings);
     procedure LoadFromDir(Dir: string; Arch: string);
     property OnLog: TOnLogEvent read FOnLog write FOnLog;
@@ -133 +138 @@
 end;
 
+procedure TMenuNode.GetNodes(List: TStrings);
+var
+  I: Integer;
+begin
+  if ID <> '' then List.AddObject(ID, Self);
+  for I := 0 to Items.Count - 1 do
+  with TMenuNode(Items[I]) do begin
+    GetNodes(List);
+  end;
+end;
+
 procedure TMenuNode.SaveToList(List: TStrings);
 var
@@ -144 +160 @@
 end;
 
-procedure TMenuNode.PrepareMoveList(var List: TObjectMoves);
+procedure TMenuNode.PrepareMoveList(Lookup: TStringList; var List: TObjectMoves);
 var
   I: Integer;
   Node: TMenuNode;
   NewMove: TObjectMove;
+  Index: Integer;
 begin
   if Depends.Count > 0 then begin
-    Node := GetTopNode.FindNode(Depends[0]);
+    Index := Lookup.IndexOf(Depends[0]);
+    if Index <> -1 then Node := TMenuNode(Lookup.Objects[Index])
+      else Node := nil;
     if Assigned(Node) and (Parent <> Node) then begin
       NewMove.Source := Self;
@@ -160 +179 @@
   end else
   if Condition <> '' then begin
-    Node := GetTopNode.FindNode(Condition);
+    Index := Lookup.IndexOf(Condition);
+    if Index <> -1 then Node := TMenuNode(Lookup.Objects[Index])
+      else Node := nil;
     if Assigned(Node) and (Parent <> Node) then begin
       NewMove.Source := Self;
@@ -171 +192 @@
   while I < Items.Count do
   with TMenuNode(Items[I]) do begin
-    PrepareMoveList(List);
+    PrepareMoveList(Lookup, List);
     Inc(I);
+  end;
+end;
+
+function TMenuNode.GetCount: Integer;
+var
+  I: Integer;
+begin
+  Result := 1;
+  for I := 0 to Items.Count - 1 do
+  with TMenuNode(Items[I]) do begin
+    Result := Result + GetCount;
   end;
 end;
@@ -460 +492 @@
 end;
 
+procedure TConfigMenu.PrepareMoveList(var List: TObjectMoves);
+var
+  Lookup: TStringList;
+begin
+  try
+    Lookup := TStringList.Create;
+    Lookup.OwnsObjects := False;
+    TopNode.GetNodes(Lookup);
+    Lookup.Sorted := True;
+    TopNode.PrepareMoveList(Lookup, List);
+  finally
+    Lookup.Free;
+  end;
+end;
+
+procedure TConfigMenu.CompareStringLists(List1, List2: TStringList;
+  Missing1, Missing2: TStrings);
+var
+  I: Integer;
+  J: Integer;
+begin
+  List1.Sort;
+  List2.Sort;
+  I := 0;
+  J := 0;
+  while (I < List1.Count) and (J < List2.Count) do
+  begin
+    if List1[I] < List2[J] then
+    begin
+      Missing2.Add(List1[I]);
+      Inc(I);
+    end
+    else if List1[I] > List2[J] then
+    begin
+      Missing1.Add(List2[J]);
+      Inc(J);
+    end
+    else
+    begin
+      Inc(I);
+      Inc(J);
+    end;
+  end;
+  for I := I to List1.Count - 1 do
+    Missing2.Add(List1[I]);
+  for J := J to List2.Count - 1 do
+    Missing1.Add(List2[J]);
+end;
+
 procedure TConfigMenu.LoadFromDir(Dir: string; Arch: string);
 var
@@ -473 +554 @@
   ParseFile(BaseDir + DirectorySeparator + 'Kconfig');
 
-  TopNode.PrepareMoveList(Moves);
+  PrepareMoveList(Moves);
   for I := 0 to Length(Moves) - 1 do
   with Moves[I] do begin