:D i have a slight problem and would appreciate if someone could clarify the confusion.. i use find alot and so far i have done ok.. but it just struck me a couple of days ago that I am not quite sure what the difference between the modification time and the change time as in ctime and mtime and... (3 Replies)
...what am i doing wrong??
I need to find all files older than 30 days and delete but I can't get it to pull details for ANY + times. The file below has a time stamp which is older than 1 day, however if I try and select it using any of the -time flags it just doesn't see it. (the same thing... (1 Reply)
Hi,
I've some files of some past days and everyday some new files are also getting added to the same.
Now how can i use mtime to get the files of the current date i.e if i want the files of 25th feb 2009 and if im finding the files on 25th 12:10 am then i should only get the files after... (4 Replies)
Hi
I've made some test with perl script to learn more about mtime...
So, my question is :
Why the mtime from findfind /usr/local/sbin -ctime -1 -mtime -1 \( -name "*.log" -o -name "*.gz" \) -print are not the same as mtime from unix/linux in ls -ltr or in stat() function in perl : stat -... (2 Replies)
Dear all,
i am trying to find all files created one day before, for example 26 October, and i am using this command:
find . -type f -daystart -mtime 1
This command in fact lists all files created on 26 October, but the files between midnight 00:00 26 Oct and 01:00 26 Oct, does not shown... (4 Replies)
Discussion started by: arrals_vl
4 Replies
LEARN ABOUT CENTOS
slasdt
slasdt.f(3) LAPACK slasdt.f(3)NAME
slasdt.f -
SYNOPSIS
Functions/Subroutines
subroutine slasdt (N, LVL, ND, INODE, NDIML, NDIMR, MSUB)
SLASDT creates a tree of subproblems for bidiagonal divide and conquer. Used by sbdsdc.
Function/Subroutine Documentation
subroutine slasdt (integerN, integerLVL, integerND, integer, dimension( * )INODE, integer, dimension( * )NDIML, integer, dimension( * )NDIMR,
integerMSUB)
SLASDT creates a tree of subproblems for bidiagonal divide and conquer. Used by sbdsdc.
Purpose:
SLASDT creates a tree of subproblems for bidiagonal divide and
conquer.
Parameters:
N
N is INTEGER
On entry, the number of diagonal elements of the
bidiagonal matrix.
LVL
LVL is INTEGER
On exit, the number of levels on the computation tree.
ND
ND is INTEGER
On exit, the number of nodes on the tree.
INODE
INODE is INTEGER array, dimension ( N )
On exit, centers of subproblems.
NDIML
NDIML is INTEGER array, dimension ( N )
On exit, row dimensions of left children.
NDIMR
NDIMR is INTEGER array, dimension ( N )
On exit, row dimensions of right children.
MSUB
MSUB is INTEGER
On entry, the maximum row dimension each subproblem at the
bottom of the tree can be of.
Author:
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
Date:
September 2012
Contributors:
Ming Gu and Huan Ren, Computer Science Division, University of California at Berkeley, USA
Definition at line 106 of file slasdt.f.
Author
Generated automatically by Doxygen for LAPACK from the source code.
Version 3.4.2 Tue Sep 25 2012 slasdt.f(3)