refactor (window): Lazy, Single-pass Evaluation of Window Properties and Efficient Rule Matching

[JustForFun88]

The PR is based on #1494.

This PR brings a major internal cleanup to window matching and rule evaluation. It not only minimizes code, but also removes wasteful allocations and short-circuits at the first failure during composite rule checks.

Main improvements

• Lazy evaluation of window properties:
  Previously, all Window properties (title, exe, class, path) were computed up front even if only one was actually needed by the rules. Now, each property is computed on demand—when the rule requires it—and never more than once per matching operation.
  For example, code like:

  if let (Ok(title), Ok(exe_name), Ok(class), Ok(path)) = (
      window.title(), window.exe(), window.class(), window.path()
  ) {
      should_float = should_act(&title, &exe_name, &class, &path, &floating_applications, &regex_identifiers).is_some();
  }

  is now:

  let should_float = window.matches_rules(
      &*FLOATING_APPLICATIONS.lock(),
      &REGEX_IDENTIFIERS.lock()
  );

• Elimination of unnecessary allocations for composite rules:
  Previously, evaluating MatchingRule::Composite collected all results in a Vec before checking if they were all true. Now, evaluation is fully short-circuiting and allocation-free:

  MatchingRule::Composite(identifiers) => identifiers
    .iter()
    .all(|identifier| matches_identifier(matching, identifier, regex_identifiers)),

• Smaller codebase. All boilerplate removed.