Re: search for non-unique question

This WebDNA talk-list message is from

2001

It keeps the original formatting. numero = 40287
interpreted = N
texte = actually it can be up to 10k times 10k iterations :-)This search within search is the thing you need, Dale, however, I would puta max=1 in the INNER search, which would give you only one output fornicknames that are in there multiple times!Ciao,Peter----- Original Message -----From: Aaron Lynch To: WebCatalog Talk Sent: Sunday, November 25, 2001 11:39 AMSubject: Re: search for non-unique question> On a db with 10k records, wouldn't this be 20k searches? :)>>> On 11/24/01 8:59 PM, Marc@lsaproofing.com mashed the following keys :>> > This should work, although it is a nasty search as it will have tosearch> > the db 10,000 times less the blanks:> >> > [!]---------Search for all nicknames--------[/!]> > [Search db=your_users.db&nenicknamedata=findall&nenicknamedata=[blank]]> > [founditems]> > [!]---------Then take each nickname to research for numfound greaterthan> > one--------[/!]> > [Search> >db=your_users.db&eqnicknamedata=[nickname]&nicknamesort=1&nicknamesdir=as]> > [showif [numfound]>1]> > [founditems]> > [!]---------If more than one nickname is found it will display withinthe> > showif --------[/!]> > [nickname]
> > [/founditems]> > [/showif]> > [/search]> >> > [/founditems]> > [/search]> >> >> >> >> >> > On 11/24/01 3:54 AM, Dale Therio wrote:> >> >> WebCatalog 3.0.7 on Mac OS> >>> >> Hello,> >>> >> I have a database with about 10,000 records in it. I need to> >> do a search on a specific field (nickname) and find all> >> records that have more than one match.> >>> >> What I am doing is trying to take an existing field and> >> eventually make the value in that field a unique value, so in> >> order to do that I need to find all records where there is a> >> conflict and notify those users that they will need to change> >> their nickname.> >>> >> Got any ideas on how to construct such a search?> >>> >> Oh, and many of the records currently have this field blank, I> >> will deal with those users as a seperate case.> >>> >> Thanks for any suggestions.> >>> >> Dale> >>> >>> >> -------------------------------------------------------------> >> This message is sent to you because you are subscribed to> >> the mailing list .> >> To unsubscribe, E-mail to: > >> To switch to the DIGEST mode, E-mail to> >> > >> Web Archive of this list is at: http://search.smithmicro.com/> >> >> > -------------------------------------------------------------> > This message is sent to you because you are subscribed to> > the mailing list .> > To unsubscribe, E-mail to: > > To switch to the DIGEST mode, E-mail to> > > > Web Archive of this list is at: http://search.smithmicro.com/>>> -------------------------------------------------------------> This message is sent to you because you are subscribed to> the mailing list .> To unsubscribe, E-mail to: > To switch to the DIGEST mode, E-mail to> Web Archive of this list is at: http://search.smithmicro.com/>-------------------------------------------------------------This message is sent to you because you are subscribed to the mailing list .To unsubscribe, E-mail to: To switch to the DIGEST mode, E-mail to Web Archive of this list is at: http://search.smithmicro.com/ Associated Messages, from the most recent to the oldest:

Re: search for non-unique question (Brian Fries 2001) Re: search for non-unique question (Aaron Lynch 2001) Re: search for non-unique question (Brian Fries 2001) Re: search for non-unique question (Peter Werno 2001) Re: search for non-unique question (Dale Therio 2001) Re: search for non-unique question (Aaron Lynch 2001) Re: search for non-unique question (Marc@lsaproofing.com 2001) Re: search for non-unique question (Aaron Lynch 2001) search for non-unique question (Dale Therio 2001)

actually it can be up to 10k times 10k iterations :-)This search within search is the thing you need, Dale, however, I would puta max=1 in the INNER search, which would give you only one output fornicknames that are in there multiple times!Ciao,Peter----- Original Message -----From: Aaron Lynch To: WebCatalog Talk Sent: Sunday, November 25, 2001 11:39 AMSubject: Re: search for non-unique question> On a db with 10k records, wouldn't this be 20k searches? :)>>> On 11/24/01 8:59 PM, Marc@lsaproofing.com mashed the following keys :>> > This should work, although it is a nasty search as it will have tosearch> > the db 10,000 times less the blanks:> >> > [!]---------Search for all nicknames--------[/!]> > [Search db=your_users.db&nenicknamedata=findall&nenicknamedata=[blank]]> > [founditems]> > [!]---------Then take each nickname to research for numfound greaterthan> > one--------[/!]> > [Search> >db=your_users.db&eqnicknamedata=[nickname]&nicknamesort=1&nicknamesdir=as]> > [showif [numfound]>1]> > [founditems]> > [!]---------If more than one nickname is found it will display withinthe> > showif --------[/!]> > [nickname]
> > [/founditems]> > [/showif]> > [/search]> >> > [/founditems]> > [/search]> >> >> >> >> >> > On 11/24/01 3:54 AM, Dale Therio wrote:> >> >> WebCatalog 3.0.7 on Mac OS> >>> >> Hello,> >>> >> I have a database with about 10,000 records in it. I need to> >> do a search on a specific field (nickname) and find all> >> records that have more than one match.> >>> >> What I am doing is trying to take an existing field and> >> eventually make the value in that field a unique value, so in> >> order to do that I need to find all records where there is a> >> conflict and notify those users that they will need to change> >> their nickname.> >>> >> Got any ideas on how to construct such a search?> >>> >> Oh, and many of the records currently have this field blank, I> >> will deal with those users as a seperate case.> >>> >> Thanks for any suggestions.> >>> >> Dale> >>> >>> >> -------------------------------------------------------------> >> This message is sent to you because you are subscribed to> >> the mailing list .> >> To unsubscribe, E-mail to: > >> To switch to the DIGEST mode, E-mail to> >> > >> Web Archive of this list is at: http://search.smithmicro.com/> >> >> > -------------------------------------------------------------> > This message is sent to you because you are subscribed to> > the mailing list .> > To unsubscribe, E-mail to: > > To switch to the DIGEST mode, E-mail to> > > > Web Archive of this list is at: http://search.smithmicro.com/>>> -------------------------------------------------------------> This message is sent to you because you are subscribed to> the mailing list .> To unsubscribe, E-mail to: > To switch to the DIGEST mode, E-mail to> Web Archive of this list is at: http://search.smithmicro.com/>-------------------------------------------------------------This message is sent to you because you are subscribed to the mailing list .To unsubscribe, E-mail to: To switch to the DIGEST mode, E-mail to Web Archive of this list is at: http://search.smithmicro.com/ Peter Werno

DOWNLOAD WEBDNA NOW!

Top Articles:

Talk List

The WebDNA community talk-list is the best place to get some help: several hundred extremely proficient programmers with an excellent knowledge of WebDNA and an excellent spirit will deliver all the tips and tricks you can imagine...

Related Readings:

[WebDNA] [OT] Social Media Share Buttons (2013) check out page (SSL) *still* not loading on Netscape 4.0+ (1999) Signal Raised (1997) Running 2 two WebCatalog.acgi's (1996) 2.0 Info (1997) WebCat and WebTen 2.0 (1997) WebCat2b13MacPlugIn - [include] doesn't allow creator (1997) [orderfile Orders/[cart]] (2000) Ignoring [OrderFile] context (2005) Make sure I understand this??? (1997) Capturing the referring site (1999) F3 crashing server (1997) Handy Browser Counter Tip (1997) 4.5 to 5.0 question (2003) Using Applescript to process WebCatalog functions (1998) Webcat 2.0.1 date math bug -> Crash! (1997) [referrer] tag (1997) Webstar 1.3.1 PPC (1997) Snake Bites (1997) Searchable WebCat (etc.) Docs ? (1997)