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 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519
|
/*
KeePass Password Safe - The Open-Source Password Manager
Copyright (C) 2003-2021 Dominik Reichl <dominik.reichl@t-online.de>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Text;
using KeePassLib.Collections;
using KeePassLib.Delegates;
using KeePassLib.Interfaces;
using KeePassLib.Resources;
using KeePassLib.Utility;
namespace KeePassLib
{
/// <summary>
/// A group containing subgroups and entries.
/// </summary>
public sealed partial class PwGroup : ITimeLogger, IStructureItem, IDeepCloneable<PwGroup>
{
public const bool DefaultAutoTypeEnabled = true;
public const bool DefaultSearchingEnabled = true;
// In the tree view of Windows 10, the X coordinate is reset
// to 0 after 256 nested nodes
private const uint MaxDepth = 126; // Depth 126 = level 127 < 256/2
private PwObjectList<PwGroup> m_listGroups = new PwObjectList<PwGroup>();
private PwObjectList<PwEntry> m_listEntries = new PwObjectList<PwEntry>();
private PwGroup m_pParentGroup = null;
private DateTime m_tParentGroupLastMod = PwDefs.DtDefaultNow;
private PwUuid m_uuid = PwUuid.Zero;
private string m_strName = string.Empty;
private string m_strNotes = string.Empty;
private PwIcon m_pwIcon = PwIcon.Folder;
private PwUuid m_pwCustomIconID = PwUuid.Zero;
private DateTime m_tCreation = PwDefs.DtDefaultNow;
private DateTime m_tLastMod = PwDefs.DtDefaultNow;
private DateTime m_tLastAccess = PwDefs.DtDefaultNow;
private DateTime m_tExpire = PwDefs.DtDefaultNow;
private bool m_bExpires = false;
private ulong m_uUsageCount = 0;
private bool m_bIsExpanded = true;
private bool m_bVirtual = false;
private string m_strDefaultAutoTypeSequence = string.Empty;
private bool? m_bEnableAutoType = null;
private bool? m_bEnableSearching = null;
private PwUuid m_pwLastTopVisibleEntry = PwUuid.Zero;
private StringDictionaryEx m_dCustomData = new StringDictionaryEx();
/// <summary>
/// UUID of this group.
/// </summary>
public PwUuid Uuid
{
get { return m_uuid; }
set
{
if(value == null) { Debug.Assert(false); throw new ArgumentNullException("value"); }
m_uuid = value;
}
}
/// <summary>
/// The name of this group. Cannot be <c>null</c>.
/// </summary>
public string Name
{
get { return m_strName; }
set
{
if(value == null) { Debug.Assert(false); throw new ArgumentNullException("value"); }
m_strName = value;
}
}
/// <summary>
/// Comments about this group. Cannot be <c>null</c>.
/// </summary>
public string Notes
{
get { return m_strNotes; }
set
{
if(value == null) { Debug.Assert(false); throw new ArgumentNullException("value"); }
m_strNotes = value;
}
}
/// <summary>
/// Icon of the group.
/// </summary>
public PwIcon IconId
{
get { return m_pwIcon; }
set { m_pwIcon = value; }
}
/// <summary>
/// Get the custom icon ID. This value is 0, if no custom icon is
/// being used (i.e. the icon specified by the <c>IconID</c> property
/// should be displayed).
/// </summary>
public PwUuid CustomIconUuid
{
get { return m_pwCustomIconID; }
set
{
if(value == null) { Debug.Assert(false); throw new ArgumentNullException("value"); }
m_pwCustomIconID = value;
}
}
/// <summary>
/// Reference to the group to which this group belongs. May be <c>null</c>.
/// </summary>
public PwGroup ParentGroup
{
get { return m_pParentGroup; }
// Plugins: use the PwGroup.AddGroup method instead.
// Internal: check depth using CanAddGroup/CheckCanAddGroup.
internal set { Debug.Assert(value != this); m_pParentGroup = value; }
}
/// <summary>
/// The date/time when the location of the object was last changed.
/// </summary>
public DateTime LocationChanged
{
get { return m_tParentGroupLastMod; }
set { m_tParentGroupLastMod = value; }
}
/// <summary>
/// A flag that specifies if the group is shown as expanded or
/// collapsed in the user interface.
/// </summary>
public bool IsExpanded
{
get { return m_bIsExpanded; }
set { m_bIsExpanded = value; }
}
/// <summary>
/// The date/time when this group was created.
/// </summary>
public DateTime CreationTime
{
get { return m_tCreation; }
set { m_tCreation = value; }
}
/// <summary>
/// The date/time when this group was last modified.
/// </summary>
public DateTime LastModificationTime
{
get { return m_tLastMod; }
set { m_tLastMod = value; }
}
/// <summary>
/// The date/time when this group was last accessed (read).
/// </summary>
public DateTime LastAccessTime
{
get { return m_tLastAccess; }
set { m_tLastAccess = value; }
}
/// <summary>
/// The date/time when this group expires.
/// </summary>
public DateTime ExpiryTime
{
get { return m_tExpire; }
set { m_tExpire = value; }
}
/// <summary>
/// Flag that determines if the group expires.
/// </summary>
public bool Expires
{
get { return m_bExpires; }
set { m_bExpires = value; }
}
/// <summary>
/// Get or set the usage count of the group. To increase the usage
/// count by one, use the <c>Touch</c> function.
/// </summary>
public ulong UsageCount
{
get { return m_uUsageCount; }
set { m_uUsageCount = value; }
}
/// <summary>
/// Get a list of subgroups in this group.
/// </summary>
public PwObjectList<PwGroup> Groups
{
get { return m_listGroups; }
}
/// <summary>
/// Get a list of entries in this group.
/// </summary>
public PwObjectList<PwEntry> Entries
{
get { return m_listEntries; }
}
/// <summary>
/// A flag specifying whether this group is virtual or not. Virtual
/// groups can contain links to entries stored in other groups.
/// Note that this flag has to be interpreted and set by the calling
/// code; it won't prevent you from accessing and modifying the list
/// of entries in this group in any way.
/// </summary>
public bool IsVirtual
{
get { return m_bVirtual; }
set { m_bVirtual = value; }
}
/// <summary>
/// Default auto-type keystroke sequence for all entries in
/// this group. This property can be an empty string, which
/// means that the value should be inherited from the parent.
/// </summary>
public string DefaultAutoTypeSequence
{
get { return m_strDefaultAutoTypeSequence; }
set
{
if(value == null) { Debug.Assert(false); throw new ArgumentNullException("value"); }
m_strDefaultAutoTypeSequence = value;
}
}
public bool? EnableAutoType
{
get { return m_bEnableAutoType; }
set { m_bEnableAutoType = value; }
}
public bool? EnableSearching
{
get { return m_bEnableSearching; }
set { m_bEnableSearching = value; }
}
public PwUuid LastTopVisibleEntry
{
get { return m_pwLastTopVisibleEntry; }
set
{
if(value == null) { Debug.Assert(false); throw new ArgumentNullException("value"); }
m_pwLastTopVisibleEntry = value;
}
}
/// <summary>
/// Custom data container that can be used by plugins to store
/// own data in KeePass groups.
/// The data is stored in the encrypted part of encrypted
/// database files.
/// Use unique names for your items, e.g. "PluginName_ItemName".
/// </summary>
public StringDictionaryEx CustomData
{
get { return m_dCustomData; }
internal set
{
if(value == null) { Debug.Assert(false); throw new ArgumentNullException("value"); }
m_dCustomData = value;
}
}
public static EventHandler<ObjectTouchedEventArgs> GroupTouched;
public EventHandler<ObjectTouchedEventArgs> Touched;
/// <summary>
/// Construct a new, empty group.
/// </summary>
public PwGroup()
{
}
/// <summary>
/// Construct a new, empty group.
/// </summary>
/// <param name="bCreateNewUuid">Create a new UUID for this group.</param>
/// <param name="bSetTimes">Set creation, last access and last modification times to the current time.</param>
public PwGroup(bool bCreateNewUuid, bool bSetTimes)
{
if(bCreateNewUuid) m_uuid = new PwUuid(true);
if(bSetTimes)
{
DateTime dtNow = DateTime.UtcNow;
m_tCreation = dtNow;
m_tLastMod = dtNow;
m_tLastAccess = dtNow;
m_tParentGroupLastMod = dtNow;
}
}
/// <summary>
/// Construct a new group.
/// </summary>
/// <param name="bCreateNewUuid">Create a new UUID for this group.</param>
/// <param name="bSetTimes">Set creation, last access and last modification times to the current time.</param>
/// <param name="strName">Name of the new group.</param>
/// <param name="pwIcon">Icon of the new group.</param>
public PwGroup(bool bCreateNewUuid, bool bSetTimes, string strName, PwIcon pwIcon)
{
if(bCreateNewUuid) m_uuid = new PwUuid(true);
if(bSetTimes)
{
DateTime dtNow = DateTime.UtcNow;
m_tCreation = dtNow;
m_tLastMod = dtNow;
m_tLastAccess = dtNow;
m_tParentGroupLastMod = dtNow;
}
if(strName != null) m_strName = strName;
m_pwIcon = pwIcon;
}
#if DEBUG
// For display in debugger
public override string ToString()
{
return (@"PwGroup '" + m_strName + @"'");
}
#endif
/// <summary>
/// Deeply clone the current group. The returned group will be an exact
/// value copy of the current object (including UUID, etc.).
/// </summary>
/// <returns>Exact value copy of the current <c>PwGroup</c> object.</returns>
public PwGroup CloneDeep()
{
PwGroup pg = new PwGroup(false, false);
pg.m_uuid = m_uuid; // PwUuid is immutable
pg.m_listGroups = m_listGroups.CloneDeep();
pg.m_listEntries = m_listEntries.CloneDeep();
pg.TakeOwnership(true, true, false);
pg.m_pParentGroup = m_pParentGroup;
pg.m_tParentGroupLastMod = m_tParentGroupLastMod;
pg.m_strName = m_strName;
pg.m_strNotes = m_strNotes;
pg.m_pwIcon = m_pwIcon;
pg.m_pwCustomIconID = m_pwCustomIconID;
pg.m_tCreation = m_tCreation;
pg.m_tLastMod = m_tLastMod;
pg.m_tLastAccess = m_tLastAccess;
pg.m_tExpire = m_tExpire;
pg.m_bExpires = m_bExpires;
pg.m_uUsageCount = m_uUsageCount;
pg.m_bIsExpanded = m_bIsExpanded;
pg.m_bVirtual = m_bVirtual;
pg.m_strDefaultAutoTypeSequence = m_strDefaultAutoTypeSequence;
pg.m_bEnableAutoType = m_bEnableAutoType;
pg.m_bEnableSearching = m_bEnableSearching;
pg.m_pwLastTopVisibleEntry = m_pwLastTopVisibleEntry;
pg.m_dCustomData = m_dCustomData.CloneDeep();
return pg;
}
public PwGroup CloneStructure()
{
PwGroup pg = new PwGroup(false, false);
pg.m_uuid = m_uuid; // PwUuid is immutable
pg.m_tParentGroupLastMod = m_tParentGroupLastMod;
// Do not assign m_pParentGroup
foreach(PwGroup pgSub in m_listGroups)
pg.AddGroup(pgSub.CloneStructure(), true);
foreach(PwEntry peSub in m_listEntries)
pg.AddEntry(peSub.CloneStructure(), true);
return pg;
}
public bool EqualsGroup(PwGroup pg, PwCompareOptions pwOpt,
MemProtCmpMode mpCmpStr)
{
if(pg == null) { Debug.Assert(false); return false; }
bool bIgnoreLastAccess = ((pwOpt & PwCompareOptions.IgnoreLastAccess) !=
PwCompareOptions.None);
bool bIgnoreLastMod = ((pwOpt & PwCompareOptions.IgnoreLastMod) !=
PwCompareOptions.None);
if(!m_uuid.Equals(pg.m_uuid)) return false;
if((pwOpt & PwCompareOptions.IgnoreParentGroup) == PwCompareOptions.None)
{
if(m_pParentGroup != pg.m_pParentGroup) return false;
if(!bIgnoreLastMod && (m_tParentGroupLastMod != pg.m_tParentGroupLastMod))
return false;
}
if(m_strName != pg.m_strName) return false;
if(m_strNotes != pg.m_strNotes) return false;
if(m_pwIcon != pg.m_pwIcon) return false;
if(!m_pwCustomIconID.Equals(pg.m_pwCustomIconID)) return false;
if(m_tCreation != pg.m_tCreation) return false;
if(!bIgnoreLastMod && (m_tLastMod != pg.m_tLastMod)) return false;
if(!bIgnoreLastAccess && (m_tLastAccess != pg.m_tLastAccess)) return false;
if(m_tExpire != pg.m_tExpire) return false;
if(m_bExpires != pg.m_bExpires) return false;
if(!bIgnoreLastAccess && (m_uUsageCount != pg.m_uUsageCount)) return false;
// if(m_bIsExpanded != pg.m_bIsExpanded) return false;
if(m_strDefaultAutoTypeSequence != pg.m_strDefaultAutoTypeSequence) return false;
if(m_bEnableAutoType.HasValue != pg.m_bEnableAutoType.HasValue) return false;
if(m_bEnableAutoType.HasValue)
{
if(m_bEnableAutoType.Value != pg.m_bEnableAutoType.Value) return false;
}
if(m_bEnableSearching.HasValue != pg.m_bEnableSearching.HasValue) return false;
if(m_bEnableSearching.HasValue)
{
if(m_bEnableSearching.Value != pg.m_bEnableSearching.Value) return false;
}
if(!m_pwLastTopVisibleEntry.Equals(pg.m_pwLastTopVisibleEntry)) return false;
if(!m_dCustomData.Equals(pg.m_dCustomData)) return false;
if((pwOpt & PwCompareOptions.PropertiesOnly) == PwCompareOptions.None)
{
if(m_listEntries.UCount != pg.m_listEntries.UCount) return false;
for(uint u = 0; u < m_listEntries.UCount; ++u)
{
PwEntry peA = m_listEntries.GetAt(u);
PwEntry peB = pg.m_listEntries.GetAt(u);
if(!peA.EqualsEntry(peB, pwOpt, mpCmpStr)) return false;
}
if(m_listGroups.UCount != pg.m_listGroups.UCount) return false;
for(uint u = 0; u < m_listGroups.UCount; ++u)
{
PwGroup pgA = m_listGroups.GetAt(u);
PwGroup pgB = pg.m_listGroups.GetAt(u);
if(!pgA.EqualsGroup(pgB, pwOpt, mpCmpStr)) return false;
}
}
return true;
}
/// <summary>
/// Assign properties to the current group based on a template group.
/// </summary>
/// <param name="pgTemplate">Template group. Must not be <c>null</c>.</param>
/// <param name="bOnlyIfNewer">Only set the properties of the template group
/// if it is newer than the current one.</param>
/// <param name="bAssignLocationChanged">If <c>true</c>, the
/// <c>LocationChanged</c> property is copied, otherwise not.</param>
public void AssignProperties(PwGroup pgTemplate, bool bOnlyIfNewer,
bool bAssignLocationChanged)
{
Debug.Assert(pgTemplate != null); if(pgTemplate == null) throw new ArgumentNullException("pgTemplate");
if(bOnlyIfNewer && (TimeUtil.Compare(pgTemplate.m_tLastMod, m_tLastMod,
true) < 0))
return;
// Template UUID should be the same as the current one
Debug.Assert(m_uuid.Equals(pgTemplate.m_uuid));
m_uuid = pgTemplate.m_uuid;
if(bAssignLocationChanged)
m_tParentGroupLastMod = pgTemplate.m_tParentGroupLastMod;
m_strName = pgTemplate.m_strName;
m_strNotes = pgTemplate.m_strNotes;
m_pwIcon = pgTemplate.m_pwIcon;
m_pwCustomIconID = pgTemplate.m_pwCustomIconID;
m_tCreation = pgTemplate.m_tCreation;
m_tLastMod = pgTemplate.m_tLastMod;
m_tLastAccess = pgTemplate.m_tLastAccess;
m_tExpire = pgTemplate.m_tExpire;
m_bExpires = pgTemplate.m_bExpires;
m_uUsageCount = pgTemplate.m_uUsageCount;
m_strDefaultAutoTypeSequence = pgTemplate.m_strDefaultAutoTypeSequence;
m_bEnableAutoType = pgTemplate.m_bEnableAutoType;
m_bEnableSearching = pgTemplate.m_bEnableSearching;
m_pwLastTopVisibleEntry = pgTemplate.m_pwLastTopVisibleEntry;
m_dCustomData = pgTemplate.m_dCustomData.CloneDeep();
}
/// <summary>
/// Touch the group. This function updates the internal last access
/// time. If the <paramref name="bModified" /> parameter is <c>true</c>,
/// the last modification time gets updated, too.
/// </summary>
/// <param name="bModified">Modify last modification time.</param>
public void Touch(bool bModified)
{
Touch(bModified, true);
}
/// <summary>
/// Touch the group. This function updates the internal last access
/// time. If the <paramref name="bModified" /> parameter is <c>true</c>,
/// the last modification time gets updated, too.
/// </summary>
/// <param name="bModified">Modify last modification time.</param>
/// <param name="bTouchParents">If <c>true</c>, all parent objects
/// get touched, too.</param>
public void Touch(bool bModified, bool bTouchParents)
{
m_tLastAccess = DateTime.UtcNow;
++m_uUsageCount;
if(bModified) m_tLastMod = m_tLastAccess;
if(this.Touched != null)
this.Touched(this, new ObjectTouchedEventArgs(this,
bModified, bTouchParents));
if(PwGroup.GroupTouched != null)
PwGroup.GroupTouched(this, new ObjectTouchedEventArgs(this,
bModified, bTouchParents));
if(bTouchParents && (m_pParentGroup != null))
m_pParentGroup.Touch(bModified, true);
}
/// <summary>
/// Get number of groups and entries in the current group. This function
/// can also traverse through all subgroups and accumulate their counts
/// (recursive mode).
/// </summary>
/// <param name="bRecursive">If this parameter is <c>true</c>, all
/// subgroups and entries in subgroups will be counted and added to
/// the returned value. If it is <c>false</c>, only the number of
/// subgroups and entries of the current group is returned.</param>
/// <param name="uNumGroups">Number of subgroups.</param>
/// <param name="uNumEntries">Number of entries.</param>
public void GetCounts(bool bRecursive, out uint uNumGroups, out uint uNumEntries)
{
if(bRecursive)
{
uint uTotalGroups = m_listGroups.UCount;
uint uTotalEntries = m_listEntries.UCount;
uint uSubGroupCount, uSubEntryCount;
foreach(PwGroup pg in m_listGroups)
{
pg.GetCounts(true, out uSubGroupCount, out uSubEntryCount);
uTotalGroups += uSubGroupCount;
uTotalEntries += uSubEntryCount;
}
uNumGroups = uTotalGroups;
uNumEntries = uTotalEntries;
}
else // !bRecursive
{
uNumGroups = m_listGroups.UCount;
uNumEntries = m_listEntries.UCount;
}
}
public uint GetEntriesCount(bool bRecursive)
{
uint uGroups, uEntries;
GetCounts(bRecursive, out uGroups, out uEntries);
return uEntries;
}
/// <summary>
/// Traverse the group/entry tree in the current group. Various traversal
/// methods are available.
/// </summary>
/// <param name="tm">Specifies the traversal method.</param>
/// <param name="groupHandler">Function that performs an action on
/// the currently visited group (see <c>GroupHandler</c> for more).
/// This parameter may be <c>null</c>, in this case the tree is traversed but
/// you don't get notifications for each visited group.</param>
/// <param name="entryHandler">Function that performs an action on
/// the currently visited entry (see <c>EntryHandler</c> for more).
/// This parameter may be <c>null</c>.</param>
/// <returns>Returns <c>true</c> if all entries and groups have been
/// traversed. If the traversal has been canceled by one of the two
/// handlers, the return value is <c>false</c>.</returns>
public bool TraverseTree(TraversalMethod tm, GroupHandler groupHandler, EntryHandler entryHandler)
{
bool bRet = false;
switch(tm)
{
case TraversalMethod.None:
bRet = true;
break;
case TraversalMethod.PreOrder:
bRet = PreOrderTraverseTree(groupHandler, entryHandler);
break;
default:
Debug.Assert(false);
break;
}
return bRet;
}
private bool PreOrderTraverseTree(GroupHandler groupHandler, EntryHandler entryHandler)
{
if(entryHandler != null)
{
foreach(PwEntry pe in m_listEntries)
{
if(!entryHandler(pe)) return false;
}
}
foreach(PwGroup pg in m_listGroups)
{
if(groupHandler != null)
{
if(!groupHandler(pg)) return false;
}
if(!pg.PreOrderTraverseTree(groupHandler, entryHandler))
return false;
}
return true;
}
/// <summary>
/// Pack all groups into one flat linked list of references (recursively).
/// </summary>
/// <returns>Flat list of all groups.</returns>
public LinkedList<PwGroup> GetFlatGroupList()
{
LinkedList<PwGroup> list = new LinkedList<PwGroup>();
foreach(PwGroup pg in m_listGroups)
{
list.AddLast(pg);
if(pg.Groups.UCount != 0)
LinearizeGroupRecursive(list, pg, 1);
}
return list;
}
private void LinearizeGroupRecursive(LinkedList<PwGroup> list, PwGroup pg, ushort uLevel)
{
Debug.Assert(pg != null); if(pg == null) return;
foreach(PwGroup pwg in pg.Groups)
{
list.AddLast(pwg);
if(pwg.Groups.UCount != 0)
LinearizeGroupRecursive(list, pwg, (ushort)(uLevel + 1));
}
}
/// <summary>
/// Pack all entries into one flat linked list of references. Temporary
/// group IDs are assigned automatically.
/// </summary>
/// <param name="flatGroupList">A flat group list created by
/// <c>GetFlatGroupList</c>.</param>
/// <returns>Flat list of all entries.</returns>
public static LinkedList<PwEntry> GetFlatEntryList(LinkedList<PwGroup> flatGroupList)
{
Debug.Assert(flatGroupList != null); if(flatGroupList == null) return null;
LinkedList<PwEntry> list = new LinkedList<PwEntry>();
foreach(PwGroup pg in flatGroupList)
{
foreach(PwEntry pe in pg.Entries)
list.AddLast(pe);
}
return list;
}
/// <summary>
/// Enable protection of a specific string field type.
/// </summary>
/// <param name="strFieldName">Name of the string field to protect or unprotect.</param>
/// <param name="bEnable">Enable protection or not.</param>
/// <returns>Returns <c>true</c>, if the operation completed successfully,
/// otherwise <c>false</c>.</returns>
public bool EnableStringFieldProtection(string strFieldName, bool bEnable)
{
Debug.Assert(strFieldName != null);
EntryHandler eh = delegate(PwEntry pe)
{
// Enable protection of current string
pe.Strings.EnableProtection(strFieldName, bEnable);
// Do the same for all history items
foreach(PwEntry peHistory in pe.History)
{
peHistory.Strings.EnableProtection(strFieldName, bEnable);
}
return true;
};
return PreOrderTraverseTree(null, eh);
}
public List<string> BuildEntryTagsList()
{
return BuildEntryTagsList(false);
}
public List<string> BuildEntryTagsList(bool bSort)
{
List<string> vTags = new List<string>();
EntryHandler eh = delegate(PwEntry pe)
{
foreach(string strTag in pe.Tags)
{
bool bFound = false;
for(int i = 0; i < vTags.Count; ++i)
{
if(vTags[i].Equals(strTag, StrUtil.CaseIgnoreCmp))
{
bFound = true;
break;
}
}
if(!bFound) vTags.Add(strTag);
}
return true;
};
TraverseTree(TraversalMethod.PreOrder, null, eh);
if(bSort) vTags.Sort(StrUtil.CaseIgnoreComparer);
return vTags;
}
#if !KeePassLibSD
public IDictionary<string, uint> BuildEntryTagsDict(bool bSort)
{
IDictionary<string, uint> d;
if(!bSort) d = new Dictionary<string, uint>(StrUtil.CaseIgnoreComparer);
else d = new SortedDictionary<string, uint>(StrUtil.CaseIgnoreComparer);
EntryHandler eh = delegate(PwEntry pe)
{
foreach(string strTag in pe.Tags)
{
uint u;
if(d.TryGetValue(strTag, out u)) d[strTag] = u + 1;
else d[strTag] = 1;
}
return true;
};
TraverseTree(TraversalMethod.PreOrder, null, eh);
return d;
}
#endif
public void FindEntriesByTag(string strTag, PwObjectList<PwEntry> listStorage,
bool bSearchRecursive)
{
if(strTag == null) throw new ArgumentNullException("strTag");
if(strTag.Length == 0) return;
foreach(PwEntry pe in m_listEntries)
{
foreach(string strEntryTag in pe.Tags)
{
if(strEntryTag.Equals(strTag, StrUtil.CaseIgnoreCmp))
{
listStorage.Add(pe);
break;
}
}
}
if(bSearchRecursive)
{
foreach(PwGroup pg in m_listGroups)
pg.FindEntriesByTag(strTag, listStorage, true);
}
}
/// <summary>
/// Find a group.
/// </summary>
/// <param name="uuid">UUID identifying the group the caller is looking for.</param>
/// <param name="bSearchRecursive">If <c>true</c>, the search is recursive.</param>
/// <returns>Returns reference to found group, otherwise <c>null</c>.</returns>
public PwGroup FindGroup(PwUuid uuid, bool bSearchRecursive)
{
// Do not assert on PwUuid.Zero
if(m_uuid.Equals(uuid)) return this;
if(bSearchRecursive)
{
PwGroup pgRec;
foreach(PwGroup pg in m_listGroups)
{
pgRec = pg.FindGroup(uuid, true);
if(pgRec != null) return pgRec;
}
}
else // Not recursive
{
foreach(PwGroup pg in m_listGroups)
{
if(pg.m_uuid.Equals(uuid))
return pg;
}
}
return null;
}
/// <summary>
/// Find an object.
/// </summary>
/// <param name="uuid">UUID of the object to find.</param>
/// <param name="bRecursive">Specifies whether to search recursively.</param>
/// <param name="bEntries">If <c>null</c>, groups and entries are
/// searched. If <c>true</c>, only entries are searched. If <c>false</c>,
/// only groups are searched.</param>
/// <returns>Reference to the object, if found. Otherwise <c>null</c>.</returns>
public IStructureItem FindObject(PwUuid uuid, bool bRecursive,
bool? bEntries)
{
if(bEntries.HasValue)
{
if(bEntries.Value) return FindEntry(uuid, bRecursive);
else return FindGroup(uuid, bRecursive);
}
PwGroup pg = FindGroup(uuid, bRecursive);
if(pg != null) return pg;
return FindEntry(uuid, bRecursive);
}
/// <summary>
/// Try to find a subgroup and create it, if it doesn't exist yet.
/// </summary>
/// <param name="strName">Name of the subgroup.</param>
/// <param name="bCreateIfNotFound">If the group isn't found: create it.</param>
/// <returns>Returns a reference to the requested group or <c>null</c> if
/// it doesn't exist and shouldn't be created.</returns>
public PwGroup FindCreateGroup(string strName, bool bCreateIfNotFound)
{
Debug.Assert(strName != null); if(strName == null) throw new ArgumentNullException("strName");
foreach(PwGroup pg in m_listGroups)
{
if(pg.Name == strName) return pg;
}
if(!bCreateIfNotFound) return null;
PwGroup pgNew = new PwGroup(true, true, strName, PwIcon.Folder);
AddGroup(pgNew, true);
return pgNew;
}
/// <summary>
/// Find an entry.
/// </summary>
/// <param name="uuid">UUID identifying the entry the caller is looking for.</param>
/// <param name="bSearchRecursive">If <c>true</c>, the search is recursive.</param>
/// <returns>Returns reference to found entry, otherwise <c>null</c>.</returns>
public PwEntry FindEntry(PwUuid uuid, bool bSearchRecursive)
{
foreach(PwEntry pe in m_listEntries)
{
if(pe.Uuid.Equals(uuid)) return pe;
}
if(bSearchRecursive)
{
PwEntry peSub;
foreach(PwGroup pg in m_listGroups)
{
peSub = pg.FindEntry(uuid, true);
if(peSub != null) return peSub;
}
}
return null;
}
/// <summary>
/// Get the full path of a group.
/// </summary>
/// <returns>Full path of the group.</returns>
public string GetFullPath()
{
return GetFullPath(".", false);
}
/// <summary>
/// Get the full path of a group.
/// </summary>
/// <param name="strSeparator">String that separates the group
/// names.</param>
/// <param name="bIncludeTopMostGroup">Specifies whether the returned
/// path starts with the topmost group.</param>
/// <returns>Full path of the group.</returns>
public string GetFullPath(string strSeparator, bool bIncludeTopMostGroup)
{
Debug.Assert(strSeparator != null);
if(strSeparator == null) throw new ArgumentNullException("strSeparator");
string strPath = m_strName;
PwGroup pg = m_pParentGroup;
while(pg != null)
{
if(!bIncludeTopMostGroup && (pg.m_pParentGroup == null))
break;
strPath = pg.Name + strSeparator + strPath;
pg = pg.m_pParentGroup;
}
return strPath;
}
/// <summary>
/// Assign new UUIDs to groups and entries.
/// </summary>
/// <param name="bNewGroups">Create new UUIDs for subgroups.</param>
/// <param name="bNewEntries">Create new UUIDs for entries.</param>
/// <param name="bRecursive">Recursive tree traversal.</param>
public void CreateNewItemUuids(bool bNewGroups, bool bNewEntries, bool bRecursive)
{
if(bNewGroups)
{
foreach(PwGroup pg in m_listGroups)
pg.Uuid = new PwUuid(true);
}
if(bNewEntries)
{
foreach(PwEntry pe in m_listEntries)
pe.SetUuid(new PwUuid(true), true);
}
if(bRecursive)
{
foreach(PwGroup pg in m_listGroups)
pg.CreateNewItemUuids(bNewGroups, bNewEntries, true);
}
}
public void TakeOwnership(bool bTakeSubGroups, bool bTakeEntries, bool bRecursive)
{
if(bTakeSubGroups)
{
foreach(PwGroup pg in m_listGroups)
pg.ParentGroup = this;
}
if(bTakeEntries)
{
foreach(PwEntry pe in m_listEntries)
pe.ParentGroup = this;
}
if(bRecursive)
{
foreach(PwGroup pg in m_listGroups)
pg.TakeOwnership(bTakeSubGroups, bTakeEntries, true);
}
}
#if !KeePassLibSD
/// <summary>
/// Find/create a subtree of groups.
/// </summary>
/// <param name="strTree">Tree string.</param>
/// <param name="vSeparators">Separators that delimit groups in the
/// <c>strTree</c> parameter.</param>
public PwGroup FindCreateSubTree(string strTree, char[] vSeparators)
{
return FindCreateSubTree(strTree, vSeparators, true);
}
public PwGroup FindCreateSubTree(string strTree, char[] vSeparators,
bool bAllowCreate)
{
if(vSeparators == null) { Debug.Assert(false); vSeparators = new char[0]; }
string[] v = new string[vSeparators.Length];
for(int i = 0; i < vSeparators.Length; ++i)
v[i] = new string(vSeparators[i], 1);
return FindCreateSubTree(strTree, v, bAllowCreate);
}
public PwGroup FindCreateSubTree(string strTree, string[] vSeparators,
bool bAllowCreate)
{
Debug.Assert(strTree != null); if(strTree == null) return this;
if(strTree.Length == 0) return this;
string[] vGroups = strTree.Split(vSeparators, StringSplitOptions.None);
if((vGroups == null) || (vGroups.Length == 0)) return this;
PwGroup pgContainer = this;
for(int nGroup = 0; nGroup < vGroups.Length; ++nGroup)
{
if(string.IsNullOrEmpty(vGroups[nGroup])) continue;
bool bFound = false;
foreach(PwGroup pg in pgContainer.Groups)
{
if(pg.Name == vGroups[nGroup])
{
pgContainer = pg;
bFound = true;
break;
}
}
if(!bFound)
{
if(!bAllowCreate) return null;
PwGroup pg = new PwGroup(true, true, vGroups[nGroup], PwIcon.Folder);
pgContainer.AddGroup(pg, true);
pgContainer = pg;
}
}
return pgContainer;
}
#endif
/// <summary>
/// Get the depth of this group (i.e. the number of ancestors).
/// </summary>
/// <returns>Depth of this group.</returns>
public uint GetDepth()
{
PwGroup pg = m_pParentGroup;
uint d = 0;
while(pg != null)
{
pg = pg.m_pParentGroup;
++d;
}
return d;
}
private uint GetHeight()
{
if(m_listGroups.UCount == 0) return 0;
uint h = 0;
foreach(PwGroup pgSub in m_listGroups)
{
h = Math.Max(h, pgSub.GetHeight());
}
return (h + 1);
}
public string GetAutoTypeSequenceInherited()
{
if(m_strDefaultAutoTypeSequence.Length > 0)
return m_strDefaultAutoTypeSequence;
if(m_pParentGroup != null)
return m_pParentGroup.GetAutoTypeSequenceInherited();
return string.Empty;
}
public bool GetAutoTypeEnabledInherited()
{
if(m_bEnableAutoType.HasValue) return m_bEnableAutoType.Value;
if(m_pParentGroup != null)
return m_pParentGroup.GetAutoTypeEnabledInherited();
return DefaultAutoTypeEnabled;
}
public bool GetSearchingEnabledInherited()
{
if(m_bEnableSearching.HasValue) return m_bEnableSearching.Value;
if(m_pParentGroup != null)
return m_pParentGroup.GetSearchingEnabledInherited();
return DefaultSearchingEnabled;
}
/// <summary>
/// Get a list of subgroups (not including this one).
/// </summary>
/// <param name="bRecursive">If <c>true</c>, subgroups are added
/// recursively, i.e. all child groups are returned, too.</param>
/// <returns>List of subgroups. If <paramref name="bRecursive" /> is
/// <c>true</c>, it is guaranteed that subsubgroups appear after
/// subgroups.</returns>
public PwObjectList<PwGroup> GetGroups(bool bRecursive)
{
if(!bRecursive) return m_listGroups;
PwObjectList<PwGroup> list = m_listGroups.CloneShallow();
foreach(PwGroup pgSub in m_listGroups)
{
list.Add(pgSub.GetGroups(true));
}
return list;
}
public PwObjectList<PwEntry> GetEntries(bool bIncludeSubGroupEntries)
{
PwObjectList<PwEntry> l = new PwObjectList<PwEntry>();
GroupHandler gh = delegate(PwGroup pg)
{
l.Add(pg.Entries);
return true;
};
gh(this);
if(bIncludeSubGroupEntries)
PreOrderTraverseTree(gh, null);
Debug.Assert(l.UCount == GetEntriesCount(bIncludeSubGroupEntries));
return l;
}
/// <summary>
/// Get objects contained in this group.
/// </summary>
/// <param name="bRecursive">Specifies whether to search recursively.</param>
/// <param name="bEntries">If <c>null</c>, the returned list contains
/// groups and entries. If <c>true</c>, the returned list contains only
/// entries. If <c>false</c>, the returned list contains only groups.</param>
/// <returns>List of objects.</returns>
public List<IStructureItem> GetObjects(bool bRecursive, bool? bEntries)
{
List<IStructureItem> list = new List<IStructureItem>();
if(!bEntries.HasValue || !bEntries.Value)
{
PwObjectList<PwGroup> lGroups = GetGroups(bRecursive);
foreach(PwGroup pg in lGroups) list.Add(pg);
}
if(!bEntries.HasValue || bEntries.Value)
{
PwObjectList<PwEntry> lEntries = GetEntries(bRecursive);
foreach(PwEntry pe in lEntries) list.Add(pe);
}
return list;
}
public bool IsContainedIn(PwGroup pgContainer)
{
PwGroup pgCur = m_pParentGroup;
while(pgCur != null)
{
if(pgCur == pgContainer) return true;
pgCur = pgCur.m_pParentGroup;
}
return false;
}
/// <summary>
/// Add a subgroup to this group.
/// </summary>
/// <param name="subGroup">Group to be added. Must not be <c>null</c>.</param>
/// <param name="bTakeOwnership">If this parameter is <c>true</c>, the
/// parent group reference of the subgroup will be set to the current
/// group (i.e. the current group takes ownership of the subgroup).</param>
public void AddGroup(PwGroup subGroup, bool bTakeOwnership)
{
AddGroup(subGroup, bTakeOwnership, false);
}
/// <summary>
/// Add a subgroup to this group.
/// </summary>
/// <param name="subGroup">Group to be added. Must not be <c>null</c>.</param>
/// <param name="bTakeOwnership">If this parameter is <c>true</c>, the
/// parent group reference of the subgroup will be set to the current
/// group (i.e. the current group takes ownership of the subgroup).</param>
/// <param name="bUpdateLocationChangedOfSub">If <c>true</c>, the
/// <c>LocationChanged</c> property of the subgroup is updated.</param>
public void AddGroup(PwGroup subGroup, bool bTakeOwnership,
bool bUpdateLocationChangedOfSub)
{
if(subGroup == null) throw new ArgumentNullException("subGroup");
CheckCanAddGroup(subGroup);
m_listGroups.Add(subGroup);
if(bTakeOwnership) subGroup.ParentGroup = this;
if(bUpdateLocationChangedOfSub) subGroup.LocationChanged = DateTime.UtcNow;
}
internal bool CanAddGroup(PwGroup pgSub)
{
if(pgSub == null) { Debug.Assert(false); return false; }
uint dCur = GetDepth(), hSub = pgSub.GetHeight();
return ((dCur + hSub + 1) <= MaxDepth);
}
internal void CheckCanAddGroup(PwGroup pgSub)
{
if(!CanAddGroup(pgSub))
{
Debug.Assert(false);
throw new InvalidOperationException(KLRes.StructsTooDeep);
}
}
/// <summary>
/// Add an entry to this group.
/// </summary>
/// <param name="pe">Entry to be added. Must not be <c>null</c>.</param>
/// <param name="bTakeOwnership">If this parameter is <c>true</c>, the
/// parent group reference of the entry will be set to the current
/// group (i.e. the current group takes ownership of the entry).</param>
public void AddEntry(PwEntry pe, bool bTakeOwnership)
{
AddEntry(pe, bTakeOwnership, false);
}
/// <summary>
/// Add an entry to this group.
/// </summary>
/// <param name="pe">Entry to be added. Must not be <c>null</c>.</param>
/// <param name="bTakeOwnership">If this parameter is <c>true</c>, the
/// parent group reference of the entry will be set to the current
/// group (i.e. the current group takes ownership of the entry).</param>
/// <param name="bUpdateLocationChangedOfEntry">If <c>true</c>, the
/// <c>LocationChanged</c> property of the entry is updated.</param>
public void AddEntry(PwEntry pe, bool bTakeOwnership,
bool bUpdateLocationChangedOfEntry)
{
if(pe == null) throw new ArgumentNullException("pe");
m_listEntries.Add(pe);
// Do not remove the entry from its previous parent group,
// only assign it to the new one
if(bTakeOwnership) pe.ParentGroup = this;
if(bUpdateLocationChangedOfEntry) pe.LocationChanged = DateTime.UtcNow;
}
public void SortSubGroups(bool bRecursive)
{
m_listGroups.Sort(new PwGroupComparer());
if(bRecursive)
{
foreach(PwGroup pgSub in m_listGroups)
pgSub.SortSubGroups(true);
}
}
public void DeleteAllObjects(PwDatabase pdContext)
{
DateTime dtNow = DateTime.UtcNow;
foreach(PwEntry pe in m_listEntries)
{
PwDeletedObject pdo = new PwDeletedObject(pe.Uuid, dtNow);
pdContext.DeletedObjects.Add(pdo);
}
m_listEntries.Clear();
foreach(PwGroup pg in m_listGroups)
{
pg.DeleteAllObjects(pdContext);
PwDeletedObject pdo = new PwDeletedObject(pg.Uuid, dtNow);
pdContext.DeletedObjects.Add(pdo);
}
m_listGroups.Clear();
}
internal List<PwGroup> GetTopSearchSkippedGroups()
{
List<PwGroup> l = new List<PwGroup>();
if(!GetSearchingEnabledInherited()) l.Add(this);
else GetTopSearchSkippedGroupsRec(l);
return l;
}
private void GetTopSearchSkippedGroupsRec(List<PwGroup> l)
{
if(m_bEnableSearching.HasValue && !m_bEnableSearching.Value)
{
l.Add(this);
return;
}
else { Debug.Assert(GetSearchingEnabledInherited()); }
foreach(PwGroup pgSub in m_listGroups)
pgSub.GetTopSearchSkippedGroupsRec(l);
}
public void SetCreatedNow(bool bRecursive)
{
DateTime dt = DateTime.UtcNow;
m_tCreation = dt;
m_tLastAccess = dt;
if(!bRecursive) return;
GroupHandler gh = delegate(PwGroup pg)
{
pg.m_tCreation = dt;
pg.m_tLastAccess = dt;
return true;
};
EntryHandler eh = delegate(PwEntry pe)
{
pe.CreationTime = dt;
pe.LastAccessTime = dt;
return true;
};
TraverseTree(TraversalMethod.PreOrder, gh, eh);
}
public PwGroup Duplicate()
{
PwGroup pg = CloneDeep();
pg.Uuid = new PwUuid(true);
pg.CreateNewItemUuids(true, true, true);
pg.SetCreatedNow(true);
return pg;
}
internal string[] CollectEntryStrings(GFunc<PwEntry, string> f, bool bSort)
{
if(f == null) { Debug.Assert(false); return new string[0]; }
Dictionary<string, bool> d = new Dictionary<string, bool>();
EntryHandler eh = delegate(PwEntry pe)
{
string str = f(pe);
if(str != null) d[str] = true;
return true;
};
TraverseTree(TraversalMethod.PreOrder, null, eh);
string[] v = new string[d.Count];
if(d.Count != 0)
{
d.Keys.CopyTo(v, 0);
if(bSort) Array.Sort<string>(v, StrUtil.CaseIgnoreComparer);
}
return v;
}
internal string[] GetAutoTypeSequences(bool bWithStd)
{
try
{
Dictionary<string, bool> d = new Dictionary<string, bool>();
Action<string> fAdd = delegate(string str)
{
if(!string.IsNullOrEmpty(str)) d[str] = true;
};
if(bWithStd)
{
fAdd(PwDefs.DefaultAutoTypeSequence);
fAdd(PwDefs.DefaultAutoTypeSequenceTan);
}
GroupHandler gh = delegate(PwGroup pg)
{
fAdd(pg.DefaultAutoTypeSequence);
return true;
};
EntryHandler eh = delegate(PwEntry pe)
{
AutoTypeConfig c = pe.AutoType;
fAdd(c.DefaultSequence);
foreach(AutoTypeAssociation a in c.Associations)
{
fAdd(a.Sequence);
}
return true;
};
gh(this);
TraverseTree(TraversalMethod.PreOrder, gh, eh);
string[] v = new string[d.Count];
if(d.Count != 0)
{
d.Keys.CopyTo(v, 0);
Array.Sort<string>(v, StrUtil.CaseIgnoreComparer);
}
return v;
}
catch(Exception) { Debug.Assert(false); }
return new string[0];
}
}
public sealed class PwGroupComparer : IComparer<PwGroup>
{
public PwGroupComparer()
{
}
public int Compare(PwGroup a, PwGroup b)
{
return StrUtil.CompareNaturally(a.Name, b.Name);
}
}
}
|