-
Notifications
You must be signed in to change notification settings - Fork 212
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[Help]: Custom Rules #545
Comments
I've looked all over for this and never found much, so here's what I've cobbled together on my own: You can mix and match the sample expressions in Expression Builder using "&&" (AND) and "!" (NOT) to create just about any custom search imaginable. Some examples: Example 1: I have two copies of the same series, but they were encoded in different resolutions/quality. I want to select everything that isn't the best quality for deletion.
will select everything that is not the largest file, does not have the highest bitrate, and is not the largest resolution. Example 2: I have a drive filled with folders that have duplicates within each folder, but not across multiple folders. I don't want to scan each folder individually, I'd rather scan the whole drive and then focus on the largest folders for dedup.
will select only items in folder_name (useful for not accidentally selecting results in a folder I wasn't focused on) that are not the largest file and do not have the highest bitrate. A couple other things to note:
Every search workflow will be dependent on your data set and your priorities, so it's impossible to list every potentially useful combination. But hopefully this gives you an idea on how to get started :) |
Hello i wanted to ask if there is somewhere a collection for custom rules that can i read up on. I want to define my own in the custom section. Howeveri am really not sure what the correct syntax is and what are the current capabilties and limitations are.
Help would be greatly appreicated. thanks :)
The text was updated successfully, but these errors were encountered: