1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
module ActiveLdap
module Acts
module Tree
def self.included(base)
base.class_eval do
extend(ClassMethods)
association_accessor(:children) do |target|
Association::Children.new(target, {})
end
end
end
module ClassMethods
def root(options={})
find(:first, options.merge(:scope => :base))
end
end
# Returns list of ancestors, starting from parent until root.
#
# subchild1.ancestors # => [child1, root]
def ancestors
node, nodes = self, []
nodes << node = node.parent while node.parent
nodes
end
# Returns the root node of the tree.
def root
node = self
node = node.parent while node.parent
node
end
# Returns all siblings of the current node.
#
# subchild1.siblings # => [subchild2]
def siblings
self_and_siblings - [self]
end
# Returns all siblings and a reference to the current node.
#
# subchild1.self_and_siblings # => [subchild1, subchild2]
def self_and_siblings
parent ? parent.children : [self]
end
def parent
if base == self.class.base
nil
else
find(:first, :base => base, :scope => :base)
end
end
def parent=(entry)
if entry.is_a?(String) or entry.is_a?(DN)
base = entry.to_s
elsif entry.respond_to?(:dn)
base = entry.dn.to_s
if entry.respond_to?(:clear_association_cache)
entry.clear_association_cache
end
else
message = _("parent must be an entry or parent DN: %s") % entry.inspect
raise ArgumentError, message
end
unless new_entry?
begin
self.class.modify_rdn_entry(dn, "#{dn_attribute}=#{id}",
true, base,
:connection => connection)
rescue NotImplemented
self.class.delete_entry(dn, :connection => connection)
@new_entry = true
end
end
self.dn = "#{dn_attribute}=#{id},#{base}"
save if new_entry?
end
end
end
end
|
