Class: Msgthr
- Inherits:
-
Object
- Object
- Msgthr
- Defined in:
- lib/msgthr.rb
Overview
Non-recursive, container-agnostic message threading.
Usage is typically:
-
use Msgthr.new to create a new object
-
use Msgthr#add! for every message you have
-
use Msgthr#thread! to perform threading and (optionally) sort
-
use Msgthr#walk_thread to iterate through the threaded tree
See 80x24.org/msgthr/README for more info You may email us publically at [email protected] Archives are at 80x24.org/msgthr-public/
Defined Under Namespace
Classes: Container
Constant Summary collapse
- StateError =
raised when methods are called in an unsupported order
Class.new(RuntimeError)
Instance Attribute Summary collapse
-
#rootset ⇒ Object
readonly
an Array of root (parent-less) messages, only populated after calling Msgthr#thread!.
Instance Method Summary collapse
-
#add(mid, refs, msg) ⇒ Object
Adds a message to prepare a Msgthr object for threading.
-
#clear ⇒ Object
Clear internal data structures to save memory and prepare for reuse.
-
#initialize ⇒ Msgthr
constructor
Initialize a Msgthr object.
-
#order! {|@rootset| ... } ⇒ Object
Calling this method is unnecessary since msgthr 1.1.0.
-
#thread! ⇒ Object
Performs threading on the messages and returns the rootset (set of message containers without parents).
-
#walk_thread ⇒ Object
non-recursively walk a set of messages after #thread! (and optionally, #order!).
Constructor Details
#initialize ⇒ Msgthr
Initialize a Msgthr object
26 27 28 29 30 |
# File 'lib/msgthr.rb', line 26 def initialize @id_table = {} @rootset = [] @state = :init # :init => :threaded => :ordered end |
Instance Attribute Details
#rootset ⇒ Object (readonly)
an Array of root (parent-less) messages, only populated after calling Msgthr#thread!
20 21 22 |
# File 'lib/msgthr.rb', line 20 def rootset @rootset end |
Instance Method Details
#add(mid, refs, msg) ⇒ Object
Adds a message to prepare a Msgthr object for threading.
-
midis a unique identifier for the message in a given thread. It is typically a String or Integer, but may be anything usable as a Hash key in Ruby. -
refsshould be an Array of unique identifiers belonging to ancestors of the current message. For mail and news messages, this is usually the parsed result of the “References:” header. Order should be oldest to newest in terms of ancestry, with the last element being the immediate parent of the given message.This is
nilfor messages with no parent (root messages). -
msgis an opaque object which typically contains a Mail or Tmail object for handling mail.
If mid is a String, it is recommended to freeze the string before calling this method to avoid wasting memory on hash keys. Likewise is true for any String objects in refs.
Adding a message could link 2 messages in Msgthr, by making one message a child of the other. It’s possible to have a callback called when a child is added by passing a block to this method. This block can access the child and parent messages. E.g.
msgthr.add(0, nil, '0')
msgthr.add(1, [0], '1') do |parent, child|
puts "#{parent.mid} -> #{child.mid}"
end
162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 |
# File 'lib/msgthr.rb', line 162 def add(mid, refs, msg) # :yields: parent, child @state == :init or raise StateError, "cannot add when already #@state" cur = @id_table[mid] ||= Msgthr::Container.new(mid) cur.msg = msg refs or return # n.b. centralized messaging systems (e.g. forums) do not need # multiple References:, only decentralized systems need it to # tolerate missing messages prev = nil refs.each do |ref| cont = @id_table[ref] ||= Msgthr::Container.new(ref) # link refs together in order implied, # but do not change existing links or loop if prev && !cont.parent && !cont.has_descendent(prev) prev.add_child(cont) yield(prev, cont) if block_given? end prev = cont end # set parent of this message to be the last element in refs if prev && !cur.has_descendent(prev) prev.add_child(cur) yield(prev, cur) if block_given? end end |
#clear ⇒ Object
Clear internal data structures to save memory and prepare for reuse
33 34 35 36 37 |
# File 'lib/msgthr.rb', line 33 def clear @rootset.clear @id_table.clear @state = :init end |
#order! {|@rootset| ... } ⇒ Object
Calling this method is unnecessary since msgthr 1.1.0. In previous releases, the #thread! did not support a block parameter for ordering. This method remains for compatibility.
77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 |
# File 'lib/msgthr.rb', line 77 def order! case @state when :init then raise StateError, "#thread! not called" when :ordered then raise StateError, "already #@state" # else @state == :threaded end yield @rootset @rootset.each do |cont| # this calls Msgthr::Container#order!, which is non-recursive cont.order! { |children| yield(children) } end @state = :ordered @rootset end |
#thread! ⇒ Object
Performs threading on the messages and returns the rootset (set of message containers without parents).
Call this only after all #add operations are complete.
If given an optional block, it will perform an in-place sort using the block parameter.
To thread and sort by unique mid identifiers for each container:
msgthr.thread! { |ary| ary.sort_by!(&:mid) }
If your opaque message pointer contains a time accessor which gives a Time object:
msgthr.thread! do |ary|
ary.sort_by! do |cont| # Msgthr::Container
cur = cont.topmost
cur ? cur.msg.time : Time.at(0)
end
end
Note, using Msgthr::Container#topmost is NOT necessary when accessing Msgthr::Container#mid, as any known missing messages (ghosts) will still have a mid. However, Msgthr::Container#topmost is necessary if accessing Msgthr::Container#msg.
65 66 67 68 69 70 71 72 |
# File 'lib/msgthr.rb', line 65 def thread! raise StateError, "already #@state" if @state != :init ret = @rootset @id_table.each_value { |cont| ret << cont if cont.parent.nil? }.clear @state = :threaded order! { |ary| yield(ary) } if block_given? ret end |
#walk_thread ⇒ Object
non-recursively walk a set of messages after #thread! (and optionally, #order!).
If you do not care about ordering, you may call this immediately after all #add operations are complete starting with msgthr 1.1.0
This takes a block and yields 3 elements to it: |level, container, index| for each message container.
-
levelis the current depth within the walk (non-negative Integer) -
containeris the Msgthr::Container object -
indexis the offset of the container within its level (starting at 0)
To display the subject of each message with indentation, assuming your msg pointer has a subject field:
msgthr.walk_thread do |level, container, index|
msg = container.msg
subject = msg ? msg.subject : "[missing: <#{container.mid}>]"
indent = ' ' * level
printf("#{indent} % 3d. %s\n", index, subject)
end
116 117 118 119 120 121 122 123 124 125 126 127 128 |
# File 'lib/msgthr.rb', line 116 def walk_thread thread! if @state == :init order! { |_| } if @state == :threaded i = -1 q = @rootset.map { |cont| [ 0, cont, i += 1 ] } while tmp = q.shift level, cont, idx = tmp yield(level, cont, idx) level += 1 i = -1 q = cont.children.map { |cld| [ level, cld, i += 1 ] }.concat(q) end end |