Show
Ignore:
Timestamp:
04/30/08 15:20:07 (17 years ago)
Author:
smidl
Message:

drobnosti a dokumentace

Files:
1 modified

Legend:

Unmodified
Added
Removed
  • doc/latex/classbilinfn.tex

    r33 r91  
    11\section{bilinfn Class Reference} 
    22\label{classbilinfn}\index{bilinfn@{bilinfn}} 
    3 Class representing function \$f(x,u) = Ax+Bu\$.   
     3Class representing function $f(x,u) = Ax+Bu$.   
    44 
    55 
     
    1010\begin{center} 
    1111\leavevmode 
    12 \includegraphics[width=47pt]{classbilinfn__inherit__graph} 
     12\includegraphics[width=44pt]{classbilinfn__inherit__graph} 
    1313\end{center} 
    1414\end{figure} 
     
    2525vec {\bf eval} (const vec \&x0, const vec \&u0)\label{classbilinfn_e36a16e72e7f9fedf3cb18d2d5505a24} 
    2626 
    27 \begin{CompactList}\small\item\em Evaluates \$f(x0,u0)\$. \item\end{CompactList}\item  
     27\begin{CompactList}\small\item\em Evaluates $f(x0,u0)$. \item\end{CompactList}\item  
    2828{\bf bilinfn} (const {\bf RV} \&rvx0, const {\bf RV} \&rvu0)\label{classbilinfn_af9f36282730d910a41b95f4d1fb8221} 
    2929 
     
    3838vec {\bf eval} (const vec \&cond)\label{classdiffbifn_ad7673e16aa1a046b131b24c731c4632} 
    3939 
    40 \begin{CompactList}\small\item\em Evaluates \$f(x0,u0)\$ (VS: Do we really need common eval? ). \item\end{CompactList}\item  
     40\begin{CompactList}\small\item\em Evaluates $f(x0,u0)$ (VS: Do we really need common eval? ). \item\end{CompactList}\item  
    4141int {\bf \_\-dimx} () const \label{classdiffbifn_436de7a7301ea9eac7d6081b893bbf57} 
    4242 
     
    6969 
    7070\subsection{Detailed Description} 
    71 Class representing function \$f(x,u) = Ax+Bu\$.  
     71Class representing function $f(x,u) = Ax+Bu$.  
    7272 
    7373\subsection{Member Function Documentation} 
    74 \index{bilinfn@{bilinfn}!dfdx_cond@{dfdx\_\-cond}} 
    75 \index{dfdx_cond@{dfdx\_\-cond}!bilinfn@{bilinfn}} 
    76 \subsubsection{\setlength{\rightskip}{0pt plus 5cm}void bilinfn::dfdx\_\-cond (const vec \& {\em x0}, const vec \& {\em u0}, mat \& {\em A}, bool {\em full})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classbilinfn_79c022de8dbe2b054bb9cc49345f3ef5} 
     74\index{bilinfn@{bilinfn}!dfdx\_\-cond@{dfdx\_\-cond}} 
     75\index{dfdx\_\-cond@{dfdx\_\-cond}!bilinfn@{bilinfn}} 
     76\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void bilinfn::dfdx\_\-cond (const vec \& {\em x0}, \/  const vec \& {\em u0}, \/  mat \& {\em A}, \/ bool {\em full})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classbilinfn_79c022de8dbe2b054bb9cc49345f3ef5} 
    7777 
    7878 
     
    8282\item[Parameters:] 
    8383\begin{description} 
    84 \item[{\em full}]denotes that even unchanged entries are to be rewritten. When, false only the changed elements are computed. \item[{\em x0}]numeric value of \$x\$, \item[{\em u0}]numeric value of \$u\$ \item[{\em A}]a place where the result will be stored. \end{description} 
     84\item[{\em full}]denotes that even unchanged entries are to be rewritten. When, false only the changed elements are computed. \item[{\em x0}]numeric value of $x$, \item[{\em u0}]numeric value of $u$ \item[{\em A}]a place where the result will be stored. \end{description} 
    8585\end{Desc} 
    8686 
    8787 
    88 Reimplemented from {\bf diffbifn} \doxyref{}{p.}{classdiffbifn_6d217a02d4fa13931258d4bebdd0feb4}.\index{bilinfn@{bilinfn}!dfdu_cond@{dfdu\_\-cond}} 
    89 \index{dfdu_cond@{dfdu\_\-cond}!bilinfn@{bilinfn}} 
    90 \subsubsection{\setlength{\rightskip}{0pt plus 5cm}void bilinfn::dfdu\_\-cond (const vec \& {\em x0}, const vec \& {\em u0}, mat \& {\em A}, bool {\em full} = {\tt true})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classbilinfn_90f2b15612b14883d6ed2b0e295cb82b} 
     88Reimplemented from {\bf diffbifn} \doxyref{}{p.}{classdiffbifn_6d217a02d4fa13931258d4bebdd0feb4}.\index{bilinfn@{bilinfn}!dfdu\_\-cond@{dfdu\_\-cond}} 
     89\index{dfdu\_\-cond@{dfdu\_\-cond}!bilinfn@{bilinfn}} 
     90\subsubsection{\setlength{\rightskip}{0pt plus 5cm}void bilinfn::dfdu\_\-cond (const vec \& {\em x0}, \/  const vec \& {\em u0}, \/  mat \& {\em A}, \/ bool {\em full} = {\tt true})\hspace{0.3cm}{\tt  [inline, virtual]}}\label{classbilinfn_90f2b15612b14883d6ed2b0e295cb82b} 
    9191 
    9292 
     
    9696\item[Parameters:] 
    9797\begin{description} 
    98 \item[{\em full}]denotes that even unchanged entries are to be rewritten. When, false only the changed elements are computed. \item[{\em x0}]numeric value of \$x\$, \item[{\em u0}]numeric value of \$u\$ \item[{\em A}]a place where the result will be stored. \end{description} 
     98\item[{\em full}]denotes that even unchanged entries are to be rewritten. When, false only the changed elements are computed. \item[{\em x0}]numeric value of $x$, \item[{\em u0}]numeric value of $u$ \item[{\em A}]a place where the result will be stored. \end{description} 
    9999\end{Desc} 
    100100