def seq_to_cell(self):
'''
Given an iterable of known length, produce a cell array.
This is not done recursively. We would need to check for
recursive structure in that case.
'''
size = (1, len(self))
cell = mx.create_cell_array(size, wrap=True)
i = 0
for item in self:
cell[i] = item
i += 1
return cell
def seq_to_cell(self):
'''
Given an iterable of known length, produce a cell array.
This is not done recursively. We would need to check for
recursive structure in that case.
'''
size = (1, len(self))
cell = mx.create_cell_array(size, wrap=True)
i = 0
for item in self:
cell[i] = item
i += 1
return cell
def __init__(self, dims=(1,1), mxpointer=None):
if mxpointer is None:
mxpointer = mx.create_cell_array(dims)
super(cell, self).__init__(mxpointer=mxpointer)
def bare_cell(dims):
return mx.create_cell_array(dims, wrap=False)
