public override int GetHashCode() { unchecked { int hashCode = 13; hashCode = (hashCode * 17) ^ TypeOfFileSearch.GetHashCode(); hashCode = (hashCode * 17) ^ FilePattern?.GetHashCode() ?? 5; hashCode = (hashCode * 17) ^ IgnoreFilePattern?.GetHashCode() ?? 5; hashCode = (hashCode * 17) ^ TypeOfSearch.GetHashCode(); hashCode = (hashCode * 17) ^ SearchFor?.GetHashCode() ?? 5; hashCode = (hashCode * 17) ^ ReplaceWith?.GetHashCode() ?? 5; hashCode = (hashCode * 17) ^ CaseSensitive.GetHashCode(); hashCode = (hashCode * 17) ^ WholeWord.GetHashCode(); hashCode = (hashCode * 17) ^ Multiline.GetHashCode(); hashCode = (hashCode * 17) ^ Singleline.GetHashCode(); hashCode = (hashCode * 17) ^ BooleanOperators.GetHashCode(); hashCode = (hashCode * 17) ^ IncludeSubfolders.GetHashCode(); hashCode = (hashCode * 17) ^ IncludeHidden.GetHashCode(); hashCode = (hashCode * 17) ^ IncludeBinary.GetHashCode(); hashCode = (hashCode * 17) ^ MaxSubfolderDepth.GetHashCode(); hashCode = (hashCode * 17) ^ UseGitignore.GetHashCode(); hashCode = (hashCode * 17) ^ SkipRemoteCloudStorageFiles.GetHashCode(); hashCode = (hashCode * 17) ^ IncludeArchive.GetHashCode(); hashCode = (hashCode * 17) ^ FollowSymlinks.GetHashCode(); hashCode = (hashCode * 17) ^ CodePage.GetHashCode(); hashCode = (hashCode * 17) ^ ApplyFileSourceFilters.GetHashCode(); hashCode = (hashCode * 17) ^ ApplyFilePropertyFilters.GetHashCode(); hashCode = (hashCode * 17) ^ ApplyContentSearchFilters.GetHashCode(); return(hashCode); } }
public override int GetHashCode() { unchecked { int hashCode = 13; hashCode = (hashCode * 17) ^ TypeOfFileSearch.GetHashCode(); hashCode = (hashCode * 17) ^ FileNames?.GetHashCode() ?? 5; hashCode = (hashCode * 17) ^ IgnoreFilePattern?.GetHashCode() ?? 5; hashCode = (hashCode * 17) ^ TypeOfSearch.GetHashCode(); hashCode = (hashCode * 17) ^ SearchPattern?.GetHashCode() ?? 5; hashCode = (hashCode * 17) ^ ReplacePattern?.GetHashCode() ?? 5; hashCode = (hashCode * 17) ^ CaseSensitive.GetHashCode(); hashCode = (hashCode * 17) ^ WholeWord.GetHashCode(); hashCode = (hashCode * 17) ^ Multiline.GetHashCode(); hashCode = (hashCode * 17) ^ Singleline.GetHashCode(); hashCode = (hashCode * 17) ^ BooleanOperators.GetHashCode(); hashCode = (hashCode * 17) ^ IncludeSubfolders.GetHashCode(); hashCode = (hashCode * 17) ^ IncludeHiddenFiles.GetHashCode(); hashCode = (hashCode * 17) ^ IncludeBinaryFiles.GetHashCode(); hashCode = (hashCode * 17) ^ MaxSubfolderDepth.GetHashCode(); hashCode = (hashCode * 17) ^ UseGitignore.GetHashCode(); hashCode = (hashCode * 17) ^ IncludeArchive.GetHashCode(); hashCode = (hashCode * 17) ^ FollowSymlinks.GetHashCode(); hashCode = (hashCode * 17) ^ CodePage.GetHashCode(); return(hashCode); } }
public void Equality_WhereToNumbers_ReturnTrue() { var booleanOperators = new BooleanOperators(); var result = booleanOperators.Equality(true, true); Assert.AreEqual(true, result); }
public void IsALessThanB_WhereTwoNumbers_ReturnTrue() { var booleanOperators = new BooleanOperators(); var result = booleanOperators.IsALessThanB(1, 2); Assert.AreEqual(true, result); }
public void XOR_WhereToNumbers_ReturnTrue() { var booleanOperators = new BooleanOperators(); var result = booleanOperators.XOR(true, false); Assert.AreEqual(true, result); }
public void AND_WhereToBooleans_ReturnTrue() { var booleanOperators = new BooleanOperators(); var result = booleanOperators.AND(true, true); Assert.AreEqual(true, result); }
private bool AddNodeCanExecute(BooleanOperators type) { if (SelectedFilterConfiguration != null) { return(true); } return(false); }
/// <summary> /// Get LINQ boolean operator representation /// </summary> /// <param name="operators">Boolean operator</param> /// <returns>LINQ boolean operator representation</returns> protected static string BooleanFilterOperatorToLinq(BooleanOperators operators) { switch (operators) { //case BooleanOperators.Not: // return " NOT "; case BooleanOperators.And: return(" AND "); case BooleanOperators.Or: return(" OR "); } return(String.Empty); }
private int GetSearchHash() { unchecked { int hashCode = 13; hashCode = (hashCode * 397) ^ SampleText?.GetHashCode() ?? 5; hashCode = (hashCode * 397) ^ SearchFor?.GetHashCode() ?? 5; hashCode = (hashCode * 397) ^ TypeOfSearch.GetHashCode(); hashCode = (hashCode * 397) ^ CaseSensitive.GetHashCode(); hashCode = (hashCode * 397) ^ WholeWord.GetHashCode(); hashCode = (hashCode * 397) ^ Multiline.GetHashCode(); hashCode = (hashCode * 397) ^ Singleline.GetHashCode(); hashCode = (hashCode * 397) ^ BooleanOperators.GetHashCode(); hashCode = (hashCode * 397) ^ HighlightCaptureGroups.GetHashCode(); return(hashCode); } }
private void AddNode(BooleanOperators type) { if (SelectedFilterConfiguration == null || SelectedExpression == null) { return; } if (SelectedExpression is BooleanOperatorNode && ((BooleanOperatorNode)SelectedExpression).Operator == type) { return; } ExpressionTreeElement left; ExpressionTreeElement right; if (type == BooleanOperators.Not) { left = SelectedExpression.Clone() as ExpressionTreeElement; right = null; } else { left = null; right = SelectedExpression.Clone() as ExpressionTreeElement; } var newNode = new BooleanOperatorNode(SelectedExpression.Parent, left, right, type); var replaceResult = SelectedFilterConfiguration.Conditions.FindAndReplace(SelectedExpression, newNode); if (!replaceResult) { Trace.WriteLine("Cant replace SelectedExpression"); } if (SelectedFilterConfiguration.Conditions.Root != null) { SelectedFilterConfiguration.Conditions.Root = SelectedFilterConfiguration.Conditions.Root.Clone() as ExpressionTreeNode; } }
/// <summary> /// Constructor with logical expression node /// </summary> /// <param name="boolOp">Logical operator</param> /// <param name="left">Left operand (child)</param> /// <param name="right">Right operand (child)</param> public ExpressionTree(BooleanOperators boolOp, ExpressionTreeElement left, ExpressionTreeElement right) : this(boolOp) { Root.Left = left; Root.Right = right; }
public BooleanOperatorNode(ExpressionTreeNode parent, ExpressionTreeElement left, ExpressionTreeElement right, BooleanOperators boolOp) : base(parent, left, right) { Operator = boolOp; }
public BooleanOperatorNode(ExpressionTreeNode parent, BooleanOperators boolOp) : this(parent, null, null, boolOp) { }
/// <summary> /// Creates a new instance of this class. /// </summary> /// <param name="left">Expression to the left of the <paramref name="opr"/> operator.</param> /// <param name="opr">Binary Boolean operator to apply to the given expressions.</param> /// <param name="right">Expression to the right of the <paramref name="opr"/> operator.</param> public Condition(IExpression left, BooleanOperators opr = BooleanOperators.None, IExpression right = null) { Left = left; Operator = opr; Right = right; }
/// <summary> /// Constructor with logical expression node /// </summary> /// <param name="boolOp">Logical operator</param> public ExpressionTree(BooleanOperators boolOp) { Root = new BooleanOperatorNode(null, boolOp); }