|
|
Sponsored Content
Top Forums
Programming
Reading special characters while converting sequential file to line sequential
Post 302079437 by Rajeshsu on Monday 10th of July 2006 11:03:18 AM
07-10-2006
|
|
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Dear linux experts,
I'd like to ask for your support, I've read some posts in this forum about files comparison but haven't found what I'm looking for. I need to create a sequential script to compare row-by-row one file with 34 similar files but without success so far. This is what I get:
... (2 Replies)
Discussion started by: Gery
2 Replies
2. Shell Programming and Scripting
I'll try explain this as best I can. Let me know if it is not clear.
I have large text files that contain data as such:
143593502 09-08-20 09:02:13 xxxxxxxxxxx xxxxxxxxxxx 09-08-20 09:02:11 N line 1 test
line 2 test
line 3 test
143593503 09-08-20 09:02:13... (3 Replies)
Discussion started by: jesse
3 Replies
3. UNIX for Advanced & Expert Users
Hi.
I have a process that execute a Microfocus Cobol. This process read a large sequential file and update or insert in a table Oracle.
This process run smoothly in some ocasions but in a file whor have more than 400,000 registers, the cobol program doesn't finish read all the records,... (3 Replies)
Discussion started by: hornam
3 Replies
4. Shell Programming and Scripting
Hi
I have a file sequential way i.e. written in contineous mode and the Record Seperator is AM from which the record is seperated .Now to process I have to make line sequential,and more over record length is not same it varies as per the input address,
AM1234563 John Murray 24 Old streeet old... (5 Replies)
Discussion started by: vakharia Mahesh
5 Replies
5. Programming
Writing a Tool to simulate non-sequential disk I/O (simulate db file sequential read) in C POSIX
I have over the years come across the same issue a couple of times, and it normally is that the read speed on SAN is absolutely atrocious when doing non-sequential I/O to the disks. Problem being of... (7 Replies)
Discussion started by: vrghost
7 Replies
6. Hardware
what command check that?
Does it depend in the time it take to access the file? (1 Reply)
Discussion started by: programAngel
1 Replies
7. Shell Programming and Scripting
Hello,
This one has me a bit stumped. I have data the looks like,
M END
> <PREDICTION_ACCURACY>
PROBABLE
> <NO_OF_PARENTS>
3
> <CLOGP>
-13.373
> <SMILES>
OCC(O)C(OC1OC(CO)C(OC2OC(CO)C
> <MIMW>
1006.322419888 (3 Replies)
Discussion started by: LMHmedchem
3 Replies
8. Shell Programming and Scripting
Hi
I have a file like this:
Peter North
Mary
Peter North
Peter Borough
Mary
I need there to put 'X' (or anything) on a new line between the two lines where 'Peter' begins the line. There will be many matches to this string, but they will always begin with 'Peter'.
Ie, the resulting... (2 Replies)
Discussion started by: majormajormajor
2 Replies
9. Shell Programming and Scripting
Hello All,
I have two files with me file1.txt and file2.txt
file1.txt has:
333
222
111
file2.txt has
ccc
bbb
aaa
ccc is related to 333 only, bbb is related to 222 only and aaa is related to 111 only.
I have to get the values from each of the file and pass them in the URL... (3 Replies)
Discussion started by: ankur328
3 Replies
10. Shell Programming and Scripting
The awk below produces an output with the original header and only the matching lines (which is good), but the output where the original line numbering in the match found on is used. I can not figure out how to sequentially number the output instead of using the original.
I did try to add... (2 Replies)
Discussion started by: cmccabe
2 Replies
LEARN ABOUT DEBIAN
csr
csr(2rheolef) rheolef-6.1 csr(2rheolef) NAME
csr - compressed sparse row matrix (rheolef-6.1) SYNOPSYS
Distributed compressed sparse matrix container stored row by row. DESCRIPTION
Sparse matrix are compressed by rows. In distributed environment, the distribution follows the row distributor (see distributor(2)). ALGEBRA
Adding or substracting two matrices writes a+b and a-b, respectively, and multiplying a matrix by a scalar writes lambda*x. Thus, any lin- ear combination of sparse matrices is available. Matrix-vector product writes a*x where x is a vector (see vec(2)). LIMITATIONS
Some basic linear algebra is still under development: a.trans_mult(x) matrix transpose vector product, trans(a) matrix transpose, a*b matrix product. IMPLEMENTATION
template<class T> class csr<T,sequential> : public smart_pointer<csr_seq_rep<T> > { public: // typedefs: typedef csr_seq_rep<T> rep; typedef smart_pointer<rep> base; typedef typename rep::memory_type memory_type; typedef typename rep::size_type size_type; typedef typename rep::element_type element_type; typedef typename rep::iterator iterator; typedef typename rep::const_iterator const_iterator; typedef typename rep::data_iterator data_iterator; typedef typename rep::const_data_iterator const_data_iterator; // allocators/deallocators: csr() : base(new_macro(rep())) {} explicit csr(const asr<T,sequential>& a) : base(new_macro(rep(a.data()))) {} void resize (size_type loc_nrow1 = 0, size_type loc_ncol1 = 0, size_type loc_nnz1 = 0) { base::data().resize(loc_nrow1, loc_ncol1, loc_nnz1); } void resize (const distributor& row_ownership, const distributor& col_ownership, size_type nnz1 = 0) { base::data().resize(row_ownership, col_ownership, nnz1); } // allocators from initializer list (c++ 2011): #ifdef _RHEOLEF_HAVE_STD_INITIALIZER_LIST csr (const std::initializer_list<csr_concat_value<T,sequential> >& init_list); csr (const std::initializer_list<csr_concat_line<T,sequential> >& init_list); #endif // _RHEOLEF_HAVE_STD_INITIALIZER_LIST // accessors: // global sizes const distributor& row_ownership() const { return base::data().row_ownership(); } const distributor& col_ownership() const { return base::data().col_ownership(); } size_type dis_nrow () const { return row_ownership().dis_size(); } size_type dis_ncol () const { return col_ownership().dis_size(); } size_type dis_nnz () const { return base::data().nnz(); } bool is_symmetric() const { return base::data().is_symmetric(); } void set_symmetry (bool is_symm) { base::data().set_symmetry(is_symm); } size_type pattern_dimension() const { return base::data().pattern_dimension(); } void set_pattern_dimension(size_type dim){ base::data().set_pattern_dimension(dim); } // local sizes size_type nrow () const { return base::data().nrow(); } size_type ncol () const { return base::data().ncol(); } size_type nnz () const { return base::data().nnz(); } // range on local memory size_type row_first_index () const { return base::data().row_first_index(); } size_type row_last_index () const { return base::data().row_last_index(); } size_type col_first_index () const { return base::data().col_first_index(); } size_type col_last_index () const { return base::data().col_last_index(); } const_iterator begin() const { return base::data().begin(); } const_iterator end() const { return base::data().end(); } iterator begin_nonconst() { return base::data().begin(); } iterator end_nonconst() { return base::data().end(); } // accessors, only for distributed (for interface compatibility) size_type ext_nnz() const { return 0; } const_iterator ext_begin() const { return const_iterator(); } const_iterator ext_end() const { return const_iterator(); } size_type jext2dis_j (size_type jext) const { return 0; } // algebra: // y := a*x void mult (const vec<element_type,sequential>& x, vec<element_type,sequential>& y) const { base::data().mult (x,y); } vec<element_type,sequential> operator* (const vec<element_type,sequential>& x) const { vec<element_type,sequential> y (row_ownership(), element_type()); mult (x, y); return y; } void trans_mult (const vec<element_type,sequential>& x, vec<element_type,sequential>& y) const { base::data().trans_mult (x,y); } vec<element_type,sequential> trans_mult (const vec<element_type,sequential>& x) const { vec<element_type,sequential> y (col_ownership(), element_type()); trans_mult (x, y); return y; } // a+b, a-b csr<T,sequential> operator+ (const csr<T,sequential>& b) const; csr<T,sequential> operator- (const csr<T,sequential>& b) const; // lambda*a csr<T,sequential>& operator*= (const T& lambda) { base::data().operator*= (lambda); return *this; } // output: void dump (const std::string& name) const { base::data().dump(name); } }; // lambda*a template<class T> inline csr<T,sequential> operator* (const T& lambda, const csr<T,sequential>& a) { csr<T,sequential> b = a; b.operator*= (lambda); return b; } // -a template<class T> inline csr<T,sequential> operator- (const csr<T,sequential>& a) { return T(-1)*a; } // trans(a) template<class T> inline csr<T,sequential> trans (const csr<T,sequential>& a) { csr<T,sequential> b; a.data().build_transpose (b.data()); return b; } IMPLEMENTATION
template<class T> class csr<T,distributed> : public smart_pointer<csr_mpi_rep<T> > { public: // typedefs: typedef csr_mpi_rep<T> rep; typedef smart_pointer<rep> base; typedef typename rep::memory_type memory_type; typedef typename rep::size_type size_type; typedef typename rep::element_type element_type; typedef typename rep::iterator iterator; typedef typename rep::const_iterator const_iterator; typedef typename rep::data_iterator data_iterator; typedef typename rep::const_data_iterator const_data_iterator; // allocators/deallocators: csr() : base(new_macro(rep())) {} explicit csr(const asr<T,memory_type>& a) : base(new_macro(rep(a.data()))) {} void resize (const distributor& row_ownership, const distributor& col_ownership, size_type nnz1 = 0) { base::data().resize(row_ownership, col_ownership, nnz1); } // allocators from initializer list (c++ 2011): #ifdef _RHEOLEF_HAVE_STD_INITIALIZER_LIST csr (const std::initializer_list<csr_concat_value<T,distributed> >& init_list); csr (const std::initializer_list<csr_concat_line<T,distributed> >& init_list); #endif // _RHEOLEF_HAVE_STD_INITIALIZER_LIST // accessors: // global sizes const distributor& row_ownership() const { return base::data().row_ownership(); } const distributor& col_ownership() const { return base::data().col_ownership(); } size_type dis_nrow () const { return row_ownership().dis_size(); } size_type dis_ncol () const { return col_ownership().dis_size(); } size_type dis_nnz () const { return base::data().dis_nnz(); } bool is_symmetric() const { return base::data().is_symmetric(); } void set_symmetry (bool is_symm) { base::data().set_symmetry(is_symm); } size_type pattern_dimension() const { return base::data().pattern_dimension(); } void set_pattern_dimension(size_type dim){ base::data().set_pattern_dimension(dim); } // local sizes size_type nrow () const { return base::data().nrow(); } size_type ncol () const { return base::data().ncol(); } size_type nnz () const { return base::data().nnz(); } // range on local memory size_type row_first_index () const { return base::data().row_first_index(); } size_type row_last_index () const { return base::data().row_last_index(); } size_type col_first_index () const { return base::data().col_first_index(); } size_type col_last_index () const { return base::data().col_last_index(); } const_iterator begin() const { return base::data().begin(); } const_iterator end() const { return base::data().end(); } iterator begin_nonconst() { return base::data().begin(); } iterator end_nonconst() { return base::data().end(); } // accessors, only for distributed size_type ext_nnz() const { return base::data().ext_nnz(); } const_iterator ext_begin() const { return base::data().ext_begin(); } const_iterator ext_end() const { return base::data().ext_end(); } size_type jext2dis_j (size_type jext) const { return base::data().jext2dis_j(jext); } // algebra: // y := a*x void mult (const vec<element_type,distributed>& x, vec<element_type,distributed>& y) const { base::data().mult (x,y); } vec<element_type,distributed> operator* (const vec<element_type,distributed>& x) const { vec<element_type,distributed> y (row_ownership(), element_type()); mult (x, y); return y; } void trans_mult (const vec<element_type,distributed>& x, vec<element_type,distributed>& y) const { base::data().trans_mult (x,y); } vec<element_type,distributed> trans_mult (const vec<element_type,distributed>& x) const { vec<element_type,distributed> y (col_ownership(), element_type()); trans_mult (x, y); return y; } // a+b, a-b csr<T,distributed> operator+ (const csr<T,distributed>& b) const; csr<T,distributed> operator- (const csr<T,distributed>& b) const; // lambda*a csr<T,distributed>& operator*= (const T& lambda) { base::data().operator*= (lambda); return *this; } // output: void dump (const std::string& name) const { base::data().dump(name); } }; // lambda*a template<class T> inline csr<T,distributed> operator* (const T& lambda, const csr<T,distributed>& a) { csr<T,distributed> b = a; b.operator*= (lambda); return b; } // -a template<class T> inline csr<T,distributed> operator- (const csr<T,distributed>& a) { return T(-1)*a; } // trans(a) template<class T> inline csr<T,distributed> trans (const csr<T,distributed>& a) { csr<T,distributed> b; a.data().build_transpose (b.data()); return b; } SEE ALSO
distributor(2), vec(2) rheolef-6.1 rheolef-6.1 csr(2rheolef)