Boolean operators (and/or, etc.) in bridge spotlight search?

Anyone know if boolean operators are possible in Bridge's spotlight search field in the upper right?
I realize it's available through edit > find, and that smart collections can be saved, but looking for faster ways.
Would be much obliged for any help, thanks!

Similar Messages

Need sample code to do text search using boolean operators AND OR + -

I'm looking for an algorithm doing text searches in files
I need it to support AND OR + - keywords (for example "ejb AND peristence")
Does anyone knows where I cand find this kind of algorithm with the full source ?
Of course I can adapt C,C++ to Java.
In fact my target language is Serverside javascript (sorry) so I prefere rather low level solutions !
Any help will be grealy appreciated and the resulting code will be posted
here and on my website : http://www.tips4dev.com

Firstly, a little note to the technical solution: what you probably need the most is speed. I may sound strange, but personally I am convinced that if you could use system tools a naive algorithm:for i:=1 to m do
grep (word)
od; whose complexity is O(m.n), where m is the number of words to be processed and n somehow represents the cardinality of the text to-be-sought-through, so this naive algorithm would actually be in 99% of cases much faster than any implementation of the algorithm below, whose complexity is O(m+n), because the implementation of the grep routine (O(n)) would be optimized and m will be low (who queries 153 words at once?)
Anyway, you asked for an algorithm and you'll have it. It is quite elegant.
Aho, A.V. - Corasick, M.V.: Efficient String Matching - An Aid to Bibliographic Search, Communication of the ACM, 1975 (vol. 18), No. 6, pg. 333-340
[i]The task: let's have an alphabet X and a string x = d1d2...dn (d's are characters from X) and a set K = {y1, ... ym} of words, where yj = tj,1 ... tj,l(j) (t's are again characters from X).
Now we search for all <i, yp> where yp is the suffix of d1...di (occurences of the word yp in x)
(note: if you want to search for the whole words tj,1 and tj,l(j) must be blanks)
The idea of the algorithm is that we first somehow process words yp to construct a search machine and with this machine we will loop through X to search for occurrences of all the words at once.
Example:
K = {he, she, his, hers}
X = ushers
search machine M(Q - set of states, g - "step forward" function, f - "step back" function, out - reporting function):
(function g)
0 (initial state) h-> state 1 e-> state 2 r-> state 7 s-> state 8 ... for {he, hers}
state 1 i-> state 6 s-> state 7 ... for {his}
state 0 s-> state 3 h-> state 4 e-> state 5 e ... for {she, he}
And for all the characters is defined 0 x -> 0
Now, in
(function out)
state 2: report {he}
state 5: report {she, he}
state 7: report {his}
state 9: report {hers}
"Step back" function f for this particular set of word would be:
9 -> 3, 7 -> 3, 5 -> 2, 4 -> 1 otherwise the machine would return to the initial state 0
Processing of ushers will look like:
<0,0> u-stay in the state 0 <1,0> s-move to state 3 <2,3>, <3,4>, <4,5> state 5-report (he, she}, cannot move forward -> must step back (like if "he" was received) <4,2> r-move to state 8, <5,8>, <6,9>
Before we show how to construct the searching machine M (Q,g,f,out) let�s consider the algorithm how to use it:
Alg 1.begin
state:= 0;
for i = 1 to n do
//if cannot move forward, move back
while g(state, di) not defined do state:=f(state) od;
//move forward to a new state
state:=g(state, di);
//report all the words represented by the new state
for all y from out(state) do Report(i,y) od;
od
end.
Alg 2. � build of the �step forward� function g and an auxiliary function o that will be later used for the construction of outvar q:integer;
procedure Enter(T1�Tm);
begin
s:=0; j:=1;
//processing a prefix of a new word that is a prefix of an already processed word too
while j&ltm and g(s,Tj) defined do
s:=g(s,Tj); j:=j+1;
od;
while j&ltm do
q:=q+1; //a new state � global variable
define g(s,Tj) = q; //definition of a single step forward
s:=q;
j:=j+1;
od;
//the last state must be a state when at least the processed word is reported
define o(s) = [T1, � Tm];
end;
begin
q:=0; //initial state
for p:= 1 to k do Enter(yp) od;
for all d from the alphabet X do
if g(0,d) not defined then define g(0,d) = 0 fi
od
end. Alg 3. � build of the �step back� function f and the reporting function outcreate an empty queue
define f(0) = 0; out(0) = {} //an empty set � we expect words of the length 1 at least
for all d from X do
//process children of the initial state
s:=g(0,d);
if s!=0 then
define f(s) = 0; //1-character states, if we throw away the first character we return to the initial
define out(s):=o(s); //report 1-character words, if any
move s at the end of the queue
fi
od
while queue not empty do
r:= the first member of the queue; remove r from the queue;
for all d from X do //process all the children of r
if g(r,d) defined then
s:= g(r,d); //get a child of r
t:= f(r); //f(r) has already been defined
while g(t,d) not defined do t:=f(t) od;
//we found a state from which g(t,d) has sense
define f(s) = g(t,d);
define out(s) = o(s) UNION with out(f(s));
move s at the end of the queue;
fi
od
od
Processing of a query � normal forms
Until now we have solved the problem how to search for multiple words in a text at once. The algorithm returns not only not only whether a word was found or not, but also where exactly a word can be found � all the occurrences and their locations.
However, the initial task was slightly different: procession of a query like �X contains (y1 AND/OR y2 � yn)� In order to decide a question like that it might not be necessary to find all the occurrences of given words, actually not even an occurrence of all the words (e.g. word1 OR word2 is fulfilled as soon as either word1, or word2 is found).
Let�s suppose that a searching query is given in its disjunctive normal form (DNF):
A1 OR A2 OR ...Ak where each of Ax = B1 AND B2 AND ...Bkx and Byz is a statement �X contains yp�
Now, the query is successful whenever any of Ax is fulfilled.
(I don�t know how much you know about transformation of a logical formula to its disjunctive form � it is quite a famous algorithm and can be found in any textbook of logic or NP-completeness. I hope that evaluation of the formula, which is what happens in the procedure Report of the algorithm Alg. 1, is trivial.)

Can Spotlight Search Control iTunes?

I've been a Quicksilver user for many years and I've been giving Spotlight Search a try as my application launcher. So far so good, but I think I may have run into a snag. Quicksilver allowed me basic control over iTunes, such as Start and Stop, but it doesn't appear Spotlight Search offers that level of control. Unless I'm missing something.
Can anyone think of a way where Spotlight Search can control play/pause in iTunes?

I was having similar trouble using iTunes 7.4.1 (2). The 'Power Search' quick link off the main store page (Australia) was giving a pop up message that the store was busy, try again later, etc. This has been happening for the last couple of days. If I was further into the site, on a page displaying albums or similar, the Power Search worked just fine. Go figure.
You wanna know the scary part? Since I logged into the discussion pages to post this, I checked back and the link off the main page is now working as it should. They're watching me!!
Tinfoil hat time, me thinks. At least search is working again.

File not visible in Finder until spotlight search

Wierd.
I have been working on a Photoshop project all week. The project uses several jpg files and I have saved the psd's in the same folder. Toady when starting up PS, none of the psd files were in the folder - everything else for the project was. Baffeled and panicked, I did a spotlight search and found them.
Here's the wierd part. The psd files are in the folder they belong in! But I can't see them in the folder. PS also cannot "see" them if I try to open from within PS.
I can open the psd files direct after finding them with Spotlight. ***.

Change the Finder view mode; for example, from icon view to list view, or vice versa.

Spotlight Search for Reminders: Only references subject line, not Reminder Notes

Just shipped 20 large boxes from west cost to east coast, they're going to be sitting in the garage of where I'm staying for a month. Using the Reminders app, I created Reminder for each box, in the subject line the box number and tracking number. In the Notes field for each Reminder I entered the details of the box contents, thinking that I could later search for a particular item, find the Reminder for it and know what box it's in.
Wish I'd tested my theory as I've now discovered that while Reminders are searchable with Spotlight on my iOS devices, it only references the subject line -- Spotlight ignores Reminder comments. Bummer :-(

Hi benjitek,
Welcome to the Support Communities!
The article below may be able to help you with this issue.
Click on the link to see more details and screenshots.
iOS: Understanding Spotlight Search
http://support.apple.com/kb/ht3636
Cheers,
Judy

I am looking for an boolean and numeric expression evaluator. I want to be able to compare ( ,=, , or, not, and, nand, etc)and evaluate boolean/numeric expression.

I am looking for an boolean and numeric expression evaluator. I want to be able to compare (>,=, <, or, not, and, nand, etc)and evaluate boolean/numeric expression. Does anyone know if there is any code samples anywhere. If anyone has any input, I would greately appreciate it.

The problem is that I have to enter a string of that type (any random string), and the program should go and calculate the result for the whole stirng, by looking at which parts to calculate first (figuring out precedence), second, etc. This is like a calculator, you don't know what the user is going to enter next, so I can't just use the boolean palatte. I could use it if the equation was always of the form "a 'operator' b", where the operator is any logic or comparison operator. But that is not what I am trying to accomplish.
Can you do logic in the formula node? I think it only allows numeric values for inputs and outputs, it doesn't let you enter in and output booleans and stuff..does it?
Thanks,
Yuliya

XML Boolean Operators in fsiuser

Hi All,
We define BatchingByRecip batches in our fsiuser file, and we often write custom XPATH statements to use input data to send certain transactions to a certain recipient group. We've had good luck with very simple XPATH statements, such as:
Batch_Recip_Def = !/Transaction/Confirm/CompanyInfo[CompanyCode='0002'];"BatchGroup1";Client
However, we've recently had some requirements to add multiple conditions to these XPATH statements, and we haven't been able to get boolean operators to work. We're trying to do something like this:
Batch_Recip_Def = !/Transaction/Confirm/CompanyInfo[((CompanyCode= '0001' or CompanyCode = '0003'))];"MINNESOTA";Client
This seems like a reasonable requirement, but we haven't been able to get this to behave correctly. Has anyone been successful with something like this? Thanks for any help!

You can mix DAL usage with this sort of rule like this:
< BatchingByRecip >
Batch_Recip_Def = =DAL("My_Script"); ... ; ...
Basically, most places that accept a search mask of ?token or typically the xpath starting with ! will also accept the =DAL() or =GVM() type macro call. The "=" macro feature has a number of options like:
=(expression) returns the value of a DAL symbol represented by "expression"
=DAL(expression) returns the value of a DAL script named by "expression"
=GVM(expression) returns the value of a GVM symbol named by the expression
=@(expression) returns the value of a source field
So, in the DAL script you can do whatever you need to do - write a complex IF with as many XPATHs as you need connected with AND or OR, etc, and be sure to return "TRUE" if you want this batch.
Not sure how far back the equal sign macro feature goes, so if not in 11.3, my apologies in advance.

Implementing Boolean operators during find object for qualification

Hi Team
We would like to maintain requirements profiles for PD object (position,job etc.) in terms of qualifications (Q) using complicated boolean operators , for example :
((Q=English>4 OR (Q=French=5 and Q=Spanish>2)) OR (Q=German=6 and english<3) and Q=education # 2
The complicated boolean operators could be also : range,excluded from the range,equal,not equal,not exits.
We would like to execute the search for qualification ,profile matchup based on this complicated boolean requirments profile.
Is there any custom development or configuration to make this happen ?
Best Regards
Dror

Is this still true if the Collection generics elements are an interface type? For example, in the
code I sent earlier, I have:
/** The authorities granted to this account. */
private Set<Authority> authorities;
But Authority is an interface that is implemented by the DefaultAuthority class (maybe others
eventually). I was under the impression that in this situation, the metadata does have to provide
the actual type that will be in the collection.
But even if it works in Kodo, one of the requirements of my project is that the JDO implementation
be swapable with JPOX. When I started working on it, both Kodo and JPOX were at a much earlier stage
of implementing JDO 2, and if I recall correctly, JPOX required the implementation class (though I
don't know if it had to be fully qualified). I'm not sure that requirement has been removed from
JPOX yet, though I haven't checked in a while.
Thanks for your help with the default value settings though. Is there any place where I could have
found that behavior documented (Kodo docs, JDO2 spec, etc.)?
Mark
Abe White wrote:
p.s. You don't need to set the element-type in metadata if you're using
Java 5 generics; we can get the element type from the field declaration.
Also, when you do have to declare an element-type in metadata, you
don't need to fully qualify the class name if the element class is in
the same package as the field's owner (the current <package>), or in
java.util, java.math, java.lang.

Regular expressions with boolean connectives (AND, OR, NOT) in Java?

I'd like to use regular expression patterns that are made up of simple regex patterns connected via AND, OR, or NOT operators, in order to do some keyword-style pattern matching.
A pattern could look like this:
(.*Is there.*) && (.*library.*) && !((.*badword.*) || (^$))
Is there any Java regex library that allows these operators?
I know that in principle these operators should be available, since Regular languages are closed under union, intersection, and complement.

AND is implicit,
xy -- means x AND yThat's not what I need, though, since this is just
concatenation of a regex.
Thus, /xy/ would not match the string "a y a x",
because y precedes x.So it has to contain both x and y, but they could be
in any order?
You can't do that easily or generally.
"x.*y|y.*x" wouldll work here, but obviously
it will get ugly factorially fast as you add more
terms.You got that right: AND means the regex operands can appear in any order.
That's why I'm looking for some regex library that does all this ugly work for me. Again, from a theoretical point of view, it IS possible to express the described semantics of AND with regular expressions, although they will get rather obfuscated.
Unless somebody has done something similar in java (e.g., for C++, there's Ragel: http://www.cs.queensu.ca/~thurston/ragel/) , I will probably use some finite-state-machine libraries and compile the complex regex's into automata (which can be minimized using well-defined operations on FSMs).
>
You'd probably just be better off doing multiple
calls to matches() or whatever. Yes, that's another possibility, do the boolean operators in Java itself.
Of course, if you
really are just looking for literals, then you can
just use str.contains(a) && !str.contains(b) &&
(str.contains(c) || str.contains(d)). You don't
seem to need regex--at least not from your example.OK, bad example, I do have "real" regexp's in there :)

Mountain Lion Finder has no boolean operators? Where? When?

Mountain Lion Finder has no boolean operators? If so, where? If not, when? THANKS

Are you talking about the Find window?
If so, just add the criteria you want by clicking the + button. By default, they are Ands. If you want to Or them, or Negate them, hold down the option key and click on the + button.

Desktop is black and dock disappeared. I have to use spotlight search to open apps. How do i fix this?

My desktop is black and the dock is not on my screen. I have to use the spotlight search to open apps. When i log in guest user everything works fine. It's only my account. How can i fix this?

open spotlight and type the name of any folder. Select it. A finder window will open. Basically you just need a finder window. right click on the title of the window. You will get a dropdown menu. Select the name of your hard disk ( most probably "Macintosh HD") now you will see a folder named system alongside applications, users, library, etc. click on the system folder. Then click on the library folder which is the only folder that appears once you get inside system folder.
now scroll down and find CoreServices folder. Open it and then find dock.app and open it.

Before aggregation with boolean operators

Hi gurus,
does someone know if there is a way to force a bex formula, defined by a boolean operator, to be executed in "before aggregation" mode?
For example, let A and B two propositions, and KF1 and . We define the following formula key figure
<b>(A) * KF1 + (B) * KF2</b>
where (A) = 1 if A is true and (A) = 0 if A is false.
My question is: is there a way to force this formula to act before aggregation.
Thank you very much
Matteo

I cannot do that, because you can set "before aggregation" property only for KF that are built on basis KF. But I have to built my formula using boolean operators that are not basis KF.
That's why i cannote use "before aggregation" in the properties of my KF.
thank you
matteo

Writing formula with boolean operators

Hi,
I need to write a formula that will, for a key figure, recognize if the cell is blank and if so convert it to zero. So for example,
if (keyfig = ' ') , then (keyfig = '0')
How do I do this using the boolean operators supplied to us for writing formulas and calculated key figures????
Thank you!

Hello CM,
Have a look at this:
http://help.sap.com/saphelp_nw04/helpdata/en/23/17f13a2f160f28e10000000a114084/content.htm
Please, remember to use the search option on this forum, as I think that a lot of threads already mention this.
Hope it helps,

Spotlight searches using operators

Recently learned that Spotlight can use operators to search, eg. "album:albumname," etc., but I have found that "song:songname" doesn't work. I find it very taxing to have to remember either the album (or artist, which successfully searches) of every song on my Mac. Anyone know if there is an Automator/Terminal way to add this to Spotlight's searching parameters?

It seems that I (somehow) wasn't thinking at all when I posted this question. I now realize that only typing the name of the song will bring it up, so that part of my question is answered. Not sure how I overlooked something that monumental.
In regards to the larger question here, is there any way to add other operators to Spotlight search? I have found articles on 10.5 which claim that the ones that exist are in "/System/Library/Frameworks/CoreServices.framework/...," but that folder doesn't exist in 10.6.2. Has this been moved?
Message was edited by: The Incendiary

I really need emergency iphone help- please- it has gone into restoration mode and wont come out unless i click restore- if i do will i loose all my photos and videos etc? please help!!!

i recently plugged my iphone4 into my laptop to sync, when i plugged it in, itunes told me that i needed to update my software, so i clicked up date and walked awayfrom my computer leaving it to do the rest, but by the time i came back to my laptop 2-3 hours later i had realized that it has run out of charge and because of it my phone had gone into retoration mode- and the only way to fix it was to press restore. what do i do? do i click restore or will that take my phone back to factory settings as i have a tonne of photos and videos etc that i have not backed up yet?
what should i do anny coments or ideas please let me know!

The first step in the upgrade process is a backup.
Did iTunes not create a new backup when you first connected it?
You really should be syncing your device and copying pictures off of it on a regular basis.
Starting an upgrade without first syncing and copying the pictures off is not a bright idea.
At this point, you only option is to restore.
Also, in the future, ensure your laptop is plugged into external power before starting upgrades.

Boolean operators (and/or, etc.) in bridge spotlight search?

Similar Messages

Maybe you are looking for