Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re: Way to predict Array Memory Size for returned LDAP Searches?

by g0n (Priest)
on Apr 04, 2006 at 10:36 UTC ( [id://541124]=note: print w/replies, xml ) Need Help??


in reply to Way to predict Array Memory Size for returned LDAP Searches?

To try and cover the overhead from the Net::LDAP::Entry objects I mocked this up:

use strict; use warnings; use Net::LDAP; use Net::LDAP::Entry; my @entrylist; for (1..500000) { my $entry = Net::LDAP::Entry->new(); $entry->dn("cn=name$_,ou=test,dc=test,dc=uk"); $entry->add(cn=>"name$_"); push @entrylist,$entry; print "$_\n"; } while (<STDIN>){}

which results in the process using 12MB on my (wintel) box. You might want to try it on linux.

--------------------------------------------------------------

"If there is such a phenomenon as absolute evil, it consists in treating another human being as a thing."
John Brunner, "The Shockwave Rider".

Can you spare 2 minutes to help with my research? If so, please click here

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://541124]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others chanting in the Monastery: (2)
As of 2024-04-26 01:27 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found