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
87
|
# encoding: utf-8
# frozen_string_literal: true
module Mail
# Field List class provides an enhanced array that keeps a list of
# email fields in order. And allows you to insert new fields without
# having to worry about the order they will appear in.
class FieldList < Array
def has_field?(field_name)
any? { |f| f.responsible_for? field_name }
end
def get_field(field_name)
fields = select_fields(field_name)
case fields.size
when 0; nil
when 1; fields.first
else fields
end
end
def add_field(field)
if field.singular?
replace_field field
else
insert_field field
end
end
alias_method :<<, :add_field
def replace_field(field)
if first_offset = index { |f| f.responsible_for? field.name }
delete_field field.name
insert first_offset, field
else
insert_field field
end
end
# Insert the field in sorted order.
#
# Heavily based on bisect.insort from Python, which is:
# Copyright (C) 2001-2013 Python Software Foundation.
# Licensed under <http://docs.python.org/license.html>
# From <http://hg.python.org/cpython/file/2.7/Lib/bisect.py>
def insert_field(field)
lo, hi = 0, size
while lo < hi
mid = (lo + hi).div(2)
if field < self[mid]
hi = mid
else
lo = mid + 1
end
end
insert lo, field
end
def delete_field(name)
delete_if { |f| f.responsible_for? name }
end
def summary
map { |f| "<#{f.name}: #{f.value}>" }.join(", ")
end
private
def select_fields(field_name)
fields = select { |f| f.responsible_for? field_name }
if fields.size > 1 && singular?(field_name)
Array(fields.detect { |f| f.errors.size == 0 } || fields.first)
else
fields
end
end
def singular?(field_name)
if klass = Mail::Field.field_class_for(field_name)
klass.singular?
else
false
end
end
end
end
|
