1995-03-17 16:07:09 +00:00
|
|
|
\section{Standard Module \sectcode{copy}}
|
1997-07-17 16:34:52 +00:00
|
|
|
\label{module-copy}
|
1995-02-15 15:53:08 +00:00
|
|
|
\stmodindex{copy}
|
1995-03-17 16:07:09 +00:00
|
|
|
\renewcommand{\indexsubitem}{(copy function)}
|
1995-02-15 15:53:08 +00:00
|
|
|
\ttindex{copy}
|
|
|
|
\ttindex{deepcopy}
|
|
|
|
|
|
|
|
This module provides generic (shallow and deep) copying operations.
|
|
|
|
|
|
|
|
Interface summary:
|
|
|
|
|
1997-07-17 16:34:52 +00:00
|
|
|
\bcode\begin{verbatim}
|
1995-02-15 15:53:08 +00:00
|
|
|
import copy
|
|
|
|
|
1995-03-13 10:03:32 +00:00
|
|
|
x = copy.copy(y) # make a shallow copy of y
|
|
|
|
x = copy.deepcopy(y) # make a deep copy of y
|
1997-07-17 16:34:52 +00:00
|
|
|
\end{verbatim}\ecode
|
|
|
|
%
|
1995-03-17 16:07:09 +00:00
|
|
|
For module specific errors, \code{copy.error} is raised.
|
1995-02-15 15:53:08 +00:00
|
|
|
|
|
|
|
The difference between shallow and deep copying is only relevant for
|
|
|
|
compound objects (objects that contain other objects, like lists or
|
|
|
|
class instances):
|
|
|
|
|
|
|
|
\begin{itemize}
|
|
|
|
|
|
|
|
\item
|
|
|
|
A {\em shallow copy} constructs a new compound object and then (to the
|
|
|
|
extent possible) inserts {\em references} into it to the objects found
|
|
|
|
in the original.
|
|
|
|
|
|
|
|
\item
|
|
|
|
A {\em deep copy} constructs a new compound object and then,
|
|
|
|
recursively, inserts {\em copies} into it of the objects found in the
|
|
|
|
original.
|
|
|
|
|
|
|
|
\end{itemize}
|
|
|
|
|
|
|
|
Two problems often exist with deep copy operations that don't exist
|
|
|
|
with shallow copy operations:
|
|
|
|
|
|
|
|
\begin{itemize}
|
|
|
|
|
|
|
|
\item
|
|
|
|
Recursive objects (compound objects that, directly or indirectly,
|
|
|
|
contain a reference to themselves) may cause a recursive loop.
|
|
|
|
|
|
|
|
\item
|
1995-03-13 10:03:32 +00:00
|
|
|
Because deep copy copies {\em everything} it may copy too much, e.g.\
|
1995-02-15 15:53:08 +00:00
|
|
|
administrative data structures that should be shared even between
|
|
|
|
copies.
|
|
|
|
|
|
|
|
\end{itemize}
|
|
|
|
|
|
|
|
Python's \code{deepcopy()} operation avoids these problems by:
|
|
|
|
|
|
|
|
\begin{itemize}
|
|
|
|
|
|
|
|
\item
|
|
|
|
keeping a table of objects already copied during the current
|
|
|
|
copying pass; and
|
|
|
|
|
|
|
|
\item
|
|
|
|
letting user-defined classes override the copying operation or the
|
|
|
|
set of components copied.
|
|
|
|
|
|
|
|
\end{itemize}
|
|
|
|
|
|
|
|
This version does not copy types like module, class, function, method,
|
|
|
|
nor stack trace, stack frame, nor file, socket, window, nor array, nor
|
|
|
|
any similar types.
|
|
|
|
|
|
|
|
Classes can use the same interfaces to control copying that they use
|
|
|
|
to control pickling: they can define methods called
|
|
|
|
\code{__getinitargs__()}, \code{__getstate__()} and
|
|
|
|
\code{__setstate__()}. See the description of module \code{pickle}
|
|
|
|
for information on these methods.
|
|
|
|
\stmodindex{pickle}
|
1995-03-17 16:07:09 +00:00
|
|
|
\renewcommand{\indexsubitem}{(copy protocol)}
|
1995-02-15 15:53:08 +00:00
|
|
|
\ttindex{__getinitargs__}
|
|
|
|
\ttindex{__getstate__}
|
|
|
|
\ttindex{__setstate__}
|