Sha256: cc1b63871b9be705880777392a6b19a4266854ba7625b98ad48a2fad34c8f1b8
Contents?: true
Size: 1.63 KB
Versions: 135
Compression:
Stored size: 1.63 KB
Contents
#--
# Copyright:: Copyright (c) Chef Software Inc.
# License:: Apache License, Version 2.0
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
#
require_relative "lazy"
class Chef
class Decorator
# Lazy Array around Lazy Objects
#
# This makes access lazy through `#[]`. In order to implement #each we need to
# know how many items we have and what their indexes are, so we'd have to evaluate
# the proc which makes that impossible. You can call methods like #each and the
# decorator will forward the method, but item access will not be lazy.
#
# #at() and #fetch() are not implemented but technically could be.
#
# @example
# def foo
# puts "allocated"
# "value"
# end
#
# a = Chef::Decorator::LazyArray.new { [ foo ] }
#
# puts "started"
# a[0]
# puts "still lazy"
# puts a[0]
#
# outputs:
#
# started
# still lazy
# allocated
# value
#
# @since 12.10.x
class LazyArray < Lazy
def [](idx)
block = @block
Lazy.new { block.call[idx] }
end
end
end
end
Version data entries
135 entries across 135 versions & 1 rubygems