From: David B. <d.b...@ma...> - 2000-07-18 22:33:03
|
As a slight aside, is there any way to search an ou without searching sub-ou's ? ...ie a non-recursive or non-decending search? eg return all objects of type X in "ou=div,o=org" but not include objects from in "ou=dept, ou=div, o=org" ? David. At 05:01 PM 7/18/00 -0400, Jim Harle wrote: >If you know a branch in which to look, use that for the base instead of >pointing the base to the top of your tree. E.g., > base => "ou=dept, ou=div, o=org" >instead of > base => "o.org" > > --Jim Harle > US Naval Academy > > >On Tue, 18 Jul 2000, Graham Barr wrote: > >> ----- Forwarded message from Kaouass Rachid <rka...@br...> ----- >> >> Date: Mon, 17 Jul 2000 10:50:15 +0200 >> From: Kaouass Rachid <rka...@br...> >> X-Mailer: Mozilla 4.51 [en] (X11; I; FreeBSD 3.2-RELEASE i386) >> To: gb...@po... >> Subject: Net::LDAP >> >> Hi, >> >> I am an new developper in LDAP, but I don't understand one thing : >> Why does the search method look in all the tree, instead of I give her a >> branche where to look ? sorry my english is not perfect :) >> But I don't understand the fact Ldap look in all the tree for something >> ? >> >> Tanks :) >> -- >> Rachid Kaouass >> >> Yep! >> >> ----- End forwarded message ----- >> >> > > > > -------------------------------------------------------------------- David Bussenschutt Email: D.B...@ma... Senior Computing Support Officer & Systems Administrator/Programmer Location: Griffith University. Information Technology Services Brisbane Qld. Aust. (TEN bldg. rm 1.33) Ph:(07)38757079 -------------------------------------------------------------------- |