s.k.GraphNode(object) : class documentation

A graph node describing a set of edges that should be directed to it.

Each edge is a connection for a particular naming context replica directed from another node in the forest to this node.

Method	__init__	Instantiate the graph node according to a DSA dn string
Method	__str__	Undocumented
Method	add_edge_from	Add an edge from the dsa to our graph nodes edge from list
Method	add_edges_from_connections	No summary
Method	add_connections_from_edges	For each edge directed to this graph node, ensure there is a corresponding nTDSConnection object in the dsa.
Method	has_sufficient_edges	Return True if we have met the maximum "from edges" criteria

def __init__(self, dsa_dnstr, max_node_edges):

Instantiate the graph node according to a DSA dn string

Parameters max_node_edges maximum number of edges that should ever be directed to the node

def __str__(self):

Undocumented

def add_edge_from(self, from_dsa_dnstr):

Add an edge from the dsa to our graph nodes edge from list

Parameters from_dsa_dnstr the dsa that the edge emanates from

def add_edges_from_connections(self, dsa):

For each nTDSConnection object associated with a particular: DSA, we test if it implies an edge to this graph node (i.e. the "fromServer" attribute). If it does then we add an edge from the server unless we are over the max edges for this graph node

Parameters dsa dsa with a dnstr equivalent to his graph node

def add_connections_from_edges(self, dsa):

For each edge directed to this graph node, ensure there is a corresponding nTDSConnection object in the dsa.

def has_sufficient_edges(self):

Return True if we have met the maximum "from edges" criteria

API Documentation for Samba, generated by pydoctor at 2011-12-08 20:23:28.