rmget(wavethresh)
rmget()所属R语言包：wavethresh
Search for existing ipndacw matrices.
搜索现有的ipndacw矩阵。
译者：生物统计家园网 机器人LoveR
描述----------Description----------
Returns the integer corresponding to the smallest order ipndacw matrix of greater than or equal to order than the order, J requested.
返回到最小的顺序ipndacw矩阵，以大于或等于比的顺序相对应的整数，J要求。
Not really intended for user use.
不是真正用于用户使用。
用法----------Usage----------
rmget(requestJ, filter.number, family)
参数----------Arguments----------
参数：requestJ
A positive integer representing the order of the ipndacw matrix that is required.
一个正整数的顺序ipndacw矩阵所需要的。
参数：filter.number
The index number of the wavelet used to build the ipndacw matrix that is required.
该指数的小波用于构建ipndacw矩阵所需要的数量。
参数：family
The wavelet family used to build the ipndacw matrix that is required.
小波家庭用于构建ipndacw矩阵所需要的。
Details
详细信息----------Details----------
Some of the matrices computed by ipndacw take a long time to compute. Hence it is a good idea to store them and reuse them.
ipndacw需要很长的时间来计算的矩阵计算。因此，它是一个好主意，将它们存储和重用他们。
This function is asked to find an ipndacw matrix of a particular order, filter.number and family. The function steps through all of the directories in the search() list collecting names of all ipndacw matrices having the same filter.number and family characteristics. It then keeps any names where the order is larger than, or equal to, the requested order. This means that a suitable ipndacw matrix of the same or larger order is visible in one of the search() directories. The matrix name with the smallest order is selected and the order of the matrix is returned. The routine that called this function can then get() the matrix and either use it "as is" or extract the top-left hand corner of it if requestJ is less than the order returned by this function.
此功能是要找到一个ipndacw矩阵的一个特定的顺序，filter.number和家庭。该功能的步骤通过的所有目录中的search()收集的所有ipndacw矩阵具有相同的filter.number和家庭特征的名称列表。然后，它使任何名称的顺序是大于或等于要求的顺序。这意味着，一个合适的ipndacw矩阵的相同或更大的顺序search()目录中的一个是可见的。矩阵名称与最小order选择和矩阵的顺序返回。的例程调用该函数可以get()的矩阵，或者使用“是”或提取的顶部左上角的requestJ是小于这个函数返回的顺序。
If no such matrix, as described by the previous paragraph, exists then this function returns NULL.
的上段所描述的，如果没有这样的矩阵，那么这个函数返回NULL。
This function calls the subsidiary routine firstdot.
该函数调用子公司日常firstdot。
值----------Value----------
If a matrix of order larger than or equal to the requested order exists somewhere on the search path and the filter.number and family is as specified then its order is returned. If more than one such matrix exists then the order of the smallest one larger than or equal to the requested one is returned.
如果一个矩阵的阶数大于或等于要求的顺序存在于某个地方上的搜索路径和filter.number和family的指定，那么它的顺序返回。如果存在多于一个这样的矩阵，那么最小的一个大于或等于所请求的一个的顺序被返回。
If no such matrix exists the function returns NULL.
如果没有这样的矩阵，函数返回NULL。
RELEASE----------RELEASE----------
Version 3.9 Copyright Guy Nason 1998
版本3.9版权所有1998年盖利晨
（作者）----------Author(s)----------
G P Nason
参考文献----------References----------
<h3>See Also</h3> <code>firstdot</code>, <code>ipndacw</code>, <code>rmname</code>.
实例----------Examples----------
#[]
# Suppose there are no matrices in the search path.[假设在搜索路径中有没有矩阵。]
#[]
# Let's look for the matrix rm.4.1.DaubExPhase (Haar wavelet matrix of[让我们来看看的：矩阵rm.4.1.DaubExPhase（Haar小波矩阵]
# order 4)[4阶）]
#[]
rmget(requestJ=4, filter.number=1, family="DaubExPhase")
#NULL[NULL]
#[]
# I.e. a NULL return code. So there were no suitable matrices.[即一个空的返回码。因此，有没有合适的矩阵。]
#[]
#If we create two Haar ipndacw matrix of order 7 and 8[如果我们创建了两个哈尔ipndacw矩阵的阶7和8]
#[]
ipndacw(-7, filter.number=1, family="DaubExPhase")
ipndacw(-8, filter.number=1, family="DaubExPhase")
#[]
# Now let's repeat the earlier search[现在，让我们重复以前的搜索]
#[]
rmget(requestJ=4, filter.number=1, family="DaubExPhase")
#[1] 7[[1] 7]
#[]
# So, as we the smallest Haar ipndacw matrix available larger than[因此，在我们的最小的的哈尔ipndacw矩阵可大于]
# the requested order of 4 is "7".[4请求的顺序是“7”。]
#[]
转载请注明:出自 生物统计家园网(http://www.biostatistic.net)。
注：
注1：为了方便大家学习，本文档为生物统计家园网机器人LoveR翻译而成，仅供个人R语言学习参考使用，生物统计家园保留版权。
注2：由于是机器人自动翻译，难免有不准确之处，使用时仔细对照中、英文内容进行反复理解，可以帮助R语言的学习。
注3：如遇到不准确之处，请在本贴的后面进行回帖，我们会逐渐进行修订。
|
发表于 2012-10-1 18:16:46
