Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
张重言
rails
提交
49846f85
R
rails
项目概览
张重言
/
rails
通知
1
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
R
rails
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
提交
49846f85
编写于
5月 14, 2008
作者:
J
Joshua Peek
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Create a seperate file for ActiveSupport::OrderedHash.
上级
7708650f
变更
5
隐藏空白更改
内联
并排
Showing
5 changed file
with
89 addition
and
88 deletion
+89
-88
activesupport/lib/active_support.rb
activesupport/lib/active_support.rb
+1
-0
activesupport/lib/active_support/ordered_hash.rb
activesupport/lib/active_support/ordered_hash.rb
+43
-0
activesupport/lib/active_support/ordered_options.rb
activesupport/lib/active_support/ordered_options.rb
+0
-44
activesupport/test/ordered_hash_test.rb
activesupport/test/ordered_hash_test.rb
+45
-0
activesupport/test/ordered_options_test.rb
activesupport/test/ordered_options_test.rb
+0
-44
未找到文件。
activesupport/lib/active_support.rb
浏览文件 @
49846f85
...
@@ -39,6 +39,7 @@
...
@@ -39,6 +39,7 @@
require
'active_support/dependencies'
require
'active_support/dependencies'
require
'active_support/deprecation'
require
'active_support/deprecation'
require
'active_support/ordered_hash'
require
'active_support/ordered_options'
require
'active_support/ordered_options'
require
'active_support/option_merger'
require
'active_support/option_merger'
...
...
activesupport/lib/active_support/ordered_hash.rb
0 → 100644
浏览文件 @
49846f85
# OrderedHash is namespaced to prevent conflicts with other implementations
module
ActiveSupport
# Hash is ordered in Ruby 1.9!
if
RUBY_VERSION
>=
'1.9'
OrderedHash
=
::
Hash
else
class
OrderedHash
<
Array
#:nodoc:
def
[]=
(
key
,
value
)
if
pair
=
assoc
(
key
)
pair
.
pop
pair
<<
value
else
self
<<
[
key
,
value
]
end
end
def
[]
(
key
)
pair
=
assoc
(
key
)
pair
?
pair
.
last
:
nil
end
def
delete
(
key
)
pair
=
assoc
(
key
)
pair
?
array_index
=
index
(
pair
)
:
nil
array_index
?
delete_at
(
array_index
).
last
:
nil
end
def
keys
collect
{
|
key
,
value
|
key
}
end
def
values
collect
{
|
key
,
value
|
value
}
end
def
to_hash
returning
({})
do
|
hash
|
each
{
|
array
|
hash
[
array
[
0
]]
=
array
[
1
]
}
end
end
end
end
end
activesupport/lib/active_support/ordered_options.rb
浏览文件 @
49846f85
# OrderedHash is namespaced to prevent conflicts with other implementations
module
ActiveSupport
# Hash is ordered in Ruby 1.9!
if
RUBY_VERSION
>=
'1.9'
OrderedHash
=
::
Hash
else
class
OrderedHash
<
Array
#:nodoc:
def
[]=
(
key
,
value
)
if
pair
=
assoc
(
key
)
pair
.
pop
pair
<<
value
else
self
<<
[
key
,
value
]
end
end
def
[]
(
key
)
pair
=
assoc
(
key
)
pair
?
pair
.
last
:
nil
end
def
delete
(
key
)
pair
=
assoc
(
key
)
pair
?
array_index
=
index
(
pair
)
:
nil
array_index
?
delete_at
(
array_index
).
last
:
nil
end
def
keys
collect
{
|
key
,
value
|
key
}
end
def
values
collect
{
|
key
,
value
|
value
}
end
def
to_hash
returning
({})
do
|
hash
|
each
{
|
array
|
hash
[
array
[
0
]]
=
array
[
1
]
}
end
end
end
end
end
class
OrderedOptions
<
ActiveSupport
::
OrderedHash
#:nodoc:
class
OrderedOptions
<
ActiveSupport
::
OrderedHash
#:nodoc:
def
[]=
(
key
,
value
)
def
[]=
(
key
,
value
)
super
(
key
.
to_sym
,
value
)
super
(
key
.
to_sym
,
value
)
...
...
activesupport/test/ordered_hash_test.rb
0 → 100644
浏览文件 @
49846f85
require
'abstract_unit'
class
OrderedHashTest
<
Test
::
Unit
::
TestCase
def
setup
@keys
=
%w( blue green red pink orange )
@values
=
%w( 000099 009900 aa0000 cc0066 cc6633 )
@ordered_hash
=
ActiveSupport
::
OrderedHash
.
new
@keys
.
each_with_index
do
|
key
,
index
|
@ordered_hash
[
key
]
=
@values
[
index
]
end
end
def
test_order
assert_equal
@keys
,
@ordered_hash
.
keys
assert_equal
@values
,
@ordered_hash
.
values
end
def
test_access
assert
@keys
.
zip
(
@values
).
all?
{
|
k
,
v
|
@ordered_hash
[
k
]
==
v
}
end
def
test_assignment
key
,
value
=
'purple'
,
'5422a8'
@ordered_hash
[
key
]
=
value
assert_equal
@keys
.
length
+
1
,
@ordered_hash
.
length
assert_equal
key
,
@ordered_hash
.
keys
.
last
assert_equal
value
,
@ordered_hash
.
values
.
last
assert_equal
value
,
@ordered_hash
[
key
]
end
def
test_delete
key
,
value
=
'white'
,
'ffffff'
bad_key
=
'black'
@ordered_hash
[
key
]
=
value
assert_equal
@keys
.
length
+
1
,
@ordered_hash
.
length
assert_equal
value
,
@ordered_hash
.
delete
(
key
)
assert_equal
@keys
.
length
,
@ordered_hash
.
length
assert_nil
@ordered_hash
.
delete
(
bad_key
)
end
end
activesupport/test/ordered_options_test.rb
浏览文件 @
49846f85
require
'abstract_unit'
require
'abstract_unit'
class
OrderedHashTest
<
Test
::
Unit
::
TestCase
def
setup
@keys
=
%w( blue green red pink orange )
@values
=
%w( 000099 009900 aa0000 cc0066 cc6633 )
@ordered_hash
=
ActiveSupport
::
OrderedHash
.
new
@keys
.
each_with_index
do
|
key
,
index
|
@ordered_hash
[
key
]
=
@values
[
index
]
end
end
def
test_order
assert_equal
@keys
,
@ordered_hash
.
keys
assert_equal
@values
,
@ordered_hash
.
values
end
def
test_access
assert
@keys
.
zip
(
@values
).
all?
{
|
k
,
v
|
@ordered_hash
[
k
]
==
v
}
end
def
test_assignment
key
,
value
=
'purple'
,
'5422a8'
@ordered_hash
[
key
]
=
value
assert_equal
@keys
.
length
+
1
,
@ordered_hash
.
length
assert_equal
key
,
@ordered_hash
.
keys
.
last
assert_equal
value
,
@ordered_hash
.
values
.
last
assert_equal
value
,
@ordered_hash
[
key
]
end
def
test_delete
key
,
value
=
'white'
,
'ffffff'
bad_key
=
'black'
@ordered_hash
[
key
]
=
value
assert_equal
@keys
.
length
+
1
,
@ordered_hash
.
length
assert_equal
value
,
@ordered_hash
.
delete
(
key
)
assert_equal
@keys
.
length
,
@ordered_hash
.
length
assert_nil
@ordered_hash
.
delete
(
bad_key
)
end
end
class
OrderedOptionsTest
<
Test
::
Unit
::
TestCase
class
OrderedOptionsTest
<
Test
::
Unit
::
TestCase
def
test_usage
def
test_usage
a
=
OrderedOptions
.
new
a
=
OrderedOptions
.
new
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录