flat file structures
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 1705
Flat File Extractor 0.2.2
Flat File Extractor can be used for reading different flat file structures and printing them in different formats. more>>
Flat File Extractor can be used for reading different flat file structures and printing them in different formats. ffe is a command line tool developed in GNU/Linux environment and it is distributed under GNU General Public License 2 or later.
Main areas of use are:
- Extracting particular fields or records from a flat file
- Converting data from one format to an other, e.g. from CSV to fixed length
- Verifying a flat file structure
- Testing tool for flat file development
- Displaying flat file content in human readable form
Main features:
- Command-line tool
- Reads standard input and writes to standard output as default
- One input file can contain several types of records (lines)
- Fields in a flat file can be fixed length or separated
- Input file structure and output definitions are independent, meaning one output format can be used with several input files
- Input file structure and output format are freely configurable, they are not predefined
- Output can be formatted e.g. as: fixed length, separated, tokenized, XML, SQL,...
- ffe tries to guess the input format, user needs not to give it as a parameter
Enhancements:
- Configuration keyword const has been added
<<lessMain areas of use are:
- Extracting particular fields or records from a flat file
- Converting data from one format to an other, e.g. from CSV to fixed length
- Verifying a flat file structure
- Testing tool for flat file development
- Displaying flat file content in human readable form
Main features:
- Command-line tool
- Reads standard input and writes to standard output as default
- One input file can contain several types of records (lines)
- Fields in a flat file can be fixed length or separated
- Input file structure and output definitions are independent, meaning one output format can be used with several input files
- Input file structure and output format are freely configurable, they are not predefined
- Output can be formatted e.g. as: fixed length, separated, tokenized, XML, SQL,...
- ffe tries to guess the input format, user needs not to give it as a parameter
Enhancements:
- Configuration keyword const has been added
Download (0.23MB)
Added: 2007-05-30 License: GPL (GNU General Public License) Price:
882 downloads
XML::Structured 1.0
XML::Structured is a simple conversion API from XML to perl structures and back. more>>
XML::Structured is a simple conversion API from XML to perl structures and back.
SYNOPSIS
use XML::Structured;
$dtd = [
element =>
attribute1,
attribute2,
[],
element1,
[ element2 ],
[ element3 =>
...
],
[[ element4 =>
...
]],
];
$hashref = XMLin($dtd, $xmlstring);
$hashref = XMLinfile($dtd, $filename_or_glob);
$xmlstring = XMLout($dtd, $hashref);
The XML::Structured module provides a way to convert xml data into a predefined perl data structure and back to xml. Unlike with modules like XML::Simple it is an error if the xml data does not match the provided skeleton (the "dtd"). Another advantage is that the order of the attributes and elements is taken from the dtd when converting back to xml.
<<lessSYNOPSIS
use XML::Structured;
$dtd = [
element =>
attribute1,
attribute2,
[],
element1,
[ element2 ],
[ element3 =>
...
],
[[ element4 =>
...
]],
];
$hashref = XMLin($dtd, $xmlstring);
$hashref = XMLinfile($dtd, $filename_or_glob);
$xmlstring = XMLout($dtd, $hashref);
The XML::Structured module provides a way to convert xml data into a predefined perl data structure and back to xml. Unlike with modules like XML::Simple it is an error if the xml data does not match the provided skeleton (the "dtd"). Another advantage is that the order of the attributes and elements is taken from the dtd when converting back to xml.
Download (0.005MB)
Added: 2006-09-07 License: Perl Artistic License Price:
1142 downloads
Erwin Data Structures 2.1.58633
Erwin Data Structures is a library that is meant to be the ultimate data structure library for mixed usage of C and C++. more>>
Erwin Data Structures is a library that is meant to be the ultimate data structure library for mixed usage of C and C++.
Arbitrary key and value types are implemented by template files that dont use C++ templates, but are instantiated by a Perl script.
This way, mixed usage in C and C++ is possible. However, a C++ interface is generated to support the advantages of the C++ language. No templates, no void*.
Erwin contains a number of tools, too, all of them written in Perl. The following list shows the data structures and tools, together with some typical examples.
<<lessArbitrary key and value types are implemented by template files that dont use C++ templates, but are instantiated by a Perl script.
This way, mixed usage in C and C++ is possible. However, a C++ interface is generated to support the advantages of the C++ language. No templates, no void*.
Erwin contains a number of tools, too, all of them written in Perl. The following list shows the data structures and tools, together with some typical examples.
Download (0.67MB)
Added: 2007-02-09 License: Freely Distributable Price:
997 downloads
Memory Structures Library 4.0
Memory Structures Library (MemSL) is a complete data structures/collection classes library with memory tracing. more>>
Memory Structures Library (MemSL) is a complete data structures/collection classes library with memory tracing, memory debugging, entry/exit tracing, exception handling, definable memory handlers, built-in thread support, and much more.
The project supports single, double, and circular linked lists, AVL balanced and threaded binary trees, dynamic hashing tables, stacks, queues and dequeues (using arrays or linked lists), sets (Pascal implementation, with union, difference, intersection, etc.), bags, tables and dictionaries, priority heaps, priority search queue, and more.
<<lessThe project supports single, double, and circular linked lists, AVL balanced and threaded binary trees, dynamic hashing tables, stacks, queues and dequeues (using arrays or linked lists), sets (Pascal implementation, with union, difference, intersection, etc.), bags, tables and dictionaries, priority heaps, priority search queue, and more.
Download (0.82MB)
Added: 2007-07-04 License: GPL (GNU General Public License) Price:
846 downloads
Image::MetaData::JPEG::Structures 0.15
Image::MetaData::JPEG::Structures is a Perl module that describes the structure of a JPEG file. more>>
Image::MetaData::JPEG::Structures is a Perl module that describes the structure of a JPEG file; it is an appendix to the main manual page of the Image::MetaData::JPEG module, which the reader should refer to for further details and the general scope.
THE STRUCTURE OF JPEG PICTURES
The JPEG (Joint Photographic Experts Group) ISO standard is a lossy image compression mechanism developed before 1990, designed for compressing colour or gray-scale photo-realistic images (it performs poorly on line-art drawings). The JPEG mechanism is designed to exploit known limitations of the human eye, in particular the fact that colour changes are perceived less accurately than changes in brightness.
Note that although the "baseline" JPEG format is patent-free, there are patents associated with some optional features, namely arithmetic coding and hierarchical storage. For this reason, these optional features are never used on the Web (good job, patent fans ...). JPEG refers only to a class of compression algorithms, not to a specific file format. In order to produce files with embedded JPEG streams, a number of file format (semi-)standards have been adapted or devised, some of which are listed in the format section. The structure of a well formed JPEG file can be described by the following pseudo production rules (for sake of simplicity, some additional constraints between tables and SOF segments are neglected).
JPEG --> (SOI)(misc)*(image)?(EOI)
(image) --> (hierarch.)|(non-hier.)
(hierarch.) --> (DHP)(frame)+
(frame) --> (misc)*(EXP)?(non-hier.)
(non-hier.) --> (SOF)(scan)+
(scan) --> (misc)*(SOS)(data)*(ECS)(DNL)?
(data) --> (ECS)(RST)
(misc) --> (DQT)|(DHT)|(DAC)|(DRI)|(COM)|(APP)
(SOI) = Start Of Image
(EOI) = End Of Image
(SOF) = Start Of Frame header (10 types)
(SOS) = Start Of Scan header
(ECS) = Entropy Coded Segment (row data, not a real segment)
(DNL) = Define Number of Lines segment
(DHP) = Define Hierarchical P??? segment
(EXP) = EXPansion segment
(RST) = ReSTart segment (8 types)
(DQT) = Define Quantisation Table
(DHT) = Define Huffman coding Table
(DAC) = Define Arithmetic coding Table
(DRI) = Define Restart Interval
(COM) = COMment segment
(APP) = APPlication segment
This package does not check that a JPEG file is really correct; it accepts a looser syntax, were segments and ECS blocks are just contiguous (basically, because it does not need to display the image!). All meta-data information is concentrated in the (COM*) and (APP) Segments, exception made for some records in the (SOF*) segment (e.g. image dimensions).
Reference: B< "Digital compression and coding of continuous-tone still
images: requirements and guidelines", CCITT recommend. T.81, 1992,
The International Telegraph and Telephone Consultative Committee,
standard ISO/IEC IS 10918-1 or ITU-T Recommendation T.81 >.
Also: B< "The JPEG still picture compression standard", G.K.Wallace,
1991, IEEE Transactions on Consumer Electronics >.
<<lessTHE STRUCTURE OF JPEG PICTURES
The JPEG (Joint Photographic Experts Group) ISO standard is a lossy image compression mechanism developed before 1990, designed for compressing colour or gray-scale photo-realistic images (it performs poorly on line-art drawings). The JPEG mechanism is designed to exploit known limitations of the human eye, in particular the fact that colour changes are perceived less accurately than changes in brightness.
Note that although the "baseline" JPEG format is patent-free, there are patents associated with some optional features, namely arithmetic coding and hierarchical storage. For this reason, these optional features are never used on the Web (good job, patent fans ...). JPEG refers only to a class of compression algorithms, not to a specific file format. In order to produce files with embedded JPEG streams, a number of file format (semi-)standards have been adapted or devised, some of which are listed in the format section. The structure of a well formed JPEG file can be described by the following pseudo production rules (for sake of simplicity, some additional constraints between tables and SOF segments are neglected).
JPEG --> (SOI)(misc)*(image)?(EOI)
(image) --> (hierarch.)|(non-hier.)
(hierarch.) --> (DHP)(frame)+
(frame) --> (misc)*(EXP)?(non-hier.)
(non-hier.) --> (SOF)(scan)+
(scan) --> (misc)*(SOS)(data)*(ECS)(DNL)?
(data) --> (ECS)(RST)
(misc) --> (DQT)|(DHT)|(DAC)|(DRI)|(COM)|(APP)
(SOI) = Start Of Image
(EOI) = End Of Image
(SOF) = Start Of Frame header (10 types)
(SOS) = Start Of Scan header
(ECS) = Entropy Coded Segment (row data, not a real segment)
(DNL) = Define Number of Lines segment
(DHP) = Define Hierarchical P??? segment
(EXP) = EXPansion segment
(RST) = ReSTart segment (8 types)
(DQT) = Define Quantisation Table
(DHT) = Define Huffman coding Table
(DAC) = Define Arithmetic coding Table
(DRI) = Define Restart Interval
(COM) = COMment segment
(APP) = APPlication segment
This package does not check that a JPEG file is really correct; it accepts a looser syntax, were segments and ECS blocks are just contiguous (basically, because it does not need to display the image!). All meta-data information is concentrated in the (COM*) and (APP) Segments, exception made for some records in the (SOF*) segment (e.g. image dimensions).
Reference: B< "Digital compression and coding of continuous-tone still
images: requirements and guidelines", CCITT recommend. T.81, 1992,
The International Telegraph and Telephone Consultative Committee,
standard ISO/IEC IS 10918-1 or ITU-T Recommendation T.81 >.
Also: B< "The JPEG still picture compression standard", G.K.Wallace,
1991, IEEE Transactions on Consumer Electronics >.
Download (0.28MB)
Added: 2006-08-25 License: Perl Artistic License Price:
1160 downloads
Generic Data Structures Library 1.4-pl1
Generic Data Structures Library (GDSL) is a collection of routines for generic data structures manipulation. more>>
Generic Data Structures Library (GDSL) is a collection of routines for generic data structures manipulation.
Generic Data Structures Library is a portable and re-entrant library fully written from scratch in pure ANSI C. It is designed to offer for C programmers common data structures with powerful algorithms, and hidden implementation.
Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, and permutations.
GDSL provides a modern Applications Programming Interface (API) for C programmers, while allowing wrappers to be written for very high level languages.
The library covers the following data structures:
- Low-level doubly-linked nodes
- Low-level doubly-linked low-level lists
- Low level binary trees
- Low level binary search trees
- Binary search trees
- Red-black trees
- 2D arrays
- Hash tables
- Lists
- Queues
- Stacks
- Permutations
Enhancements:
- A bug that was introduced in gdsl_hash_insert in the previous release was fixed.
- A missing include in gdsl.h was fixed.
<<lessGeneric Data Structures Library is a portable and re-entrant library fully written from scratch in pure ANSI C. It is designed to offer for C programmers common data structures with powerful algorithms, and hidden implementation.
Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, and permutations.
GDSL provides a modern Applications Programming Interface (API) for C programmers, while allowing wrappers to be written for very high level languages.
The library covers the following data structures:
- Low-level doubly-linked nodes
- Low-level doubly-linked low-level lists
- Low level binary trees
- Low level binary search trees
- Binary search trees
- Red-black trees
- 2D arrays
- Hash tables
- Lists
- Queues
- Stacks
- Permutations
Enhancements:
- A bug that was introduced in gdsl_hash_insert in the previous release was fixed.
- A missing include in gdsl.h was fixed.
Download (1.3MB)
Added: 2006-07-07 License: GPL (GNU General Public License) Price:
1204 downloads
GraphViz::Data::Structure 0.15
GraphViz::Data::Structure can visualise data structures. more>>
GraphViz::Data::Structure can visualise data structures.
SYNOPSIS
use GraphViz::Data::Structure;
my $gvds = GraphViz:Data::Structure->new($data_structure);
print $gvds->graph()->as_png;
This module makes it easy to visualise data structures, even recursive or circular ones.
It is provided as an alternative to GraphViz::Data::Grapher. Differences:
GraphViz::Data::Structure handles structures of arbitrary depth and complexity, automatically following links using a standard graph traversal algorithm.
GraphViz::Data::Grapher creates graphics of indiividual substructures (arrays, scalars, hashes) which keep the substructure type and data together; GraphViz::Data::Structure does this by shape alone.
GraphViz::Data::Structure encapsulates object info (if any) directly into the node being used to represent the class.
GraphViz::Data::Grapher colors its graphs; GraphViz::Data::Structure doesnt by default.
GraphViz::Data:Structure can parse out globs and CODE references (almost as well as the debugger does).
<<lessSYNOPSIS
use GraphViz::Data::Structure;
my $gvds = GraphViz:Data::Structure->new($data_structure);
print $gvds->graph()->as_png;
This module makes it easy to visualise data structures, even recursive or circular ones.
It is provided as an alternative to GraphViz::Data::Grapher. Differences:
GraphViz::Data::Structure handles structures of arbitrary depth and complexity, automatically following links using a standard graph traversal algorithm.
GraphViz::Data::Grapher creates graphics of indiividual substructures (arrays, scalars, hashes) which keep the substructure type and data together; GraphViz::Data::Structure does this by shape alone.
GraphViz::Data::Structure encapsulates object info (if any) directly into the node being used to represent the class.
GraphViz::Data::Grapher colors its graphs; GraphViz::Data::Structure doesnt by default.
GraphViz::Data:Structure can parse out globs and CODE references (almost as well as the debugger does).
Download (0.040MB)
Added: 2006-08-01 License: Perl Artistic License Price:
1180 downloads
Xephyrus Data Structures Tag Library 1.5
Xephyrus Data Structures Tag Library is a tag library to provide access to common data-structures. more>>
Xephyrus Data Structures Tag Library provides an easy way to create and manipulate the contents of common Java data-structures such as maps and lists.
Enhancements:
- The library was polished up.
- Several improvements were made and a few bugs were fixed.
- This version is aimed at Java 5 and JSP 2.0.
<<lessEnhancements:
- The library was polished up.
- Several improvements were made and a few bugs were fixed.
- This version is aimed at Java 5 and JSP 2.0.
Download (0.021MB)
Added: 2005-10-13 License: BSD License Price:
1471 downloads
GNOME Structured File Library 1.14.5
The GNOME Structured File Library is a utility library for reading and writing structured file formats. more>>
GNOME Structured File Library is a utility library for reading and writing structured file formats. Support for MS OLE2 streams is complete, as is zip import.
There is also support for document metadata and some initial work on decompressing VBA streams in OLE files for future conversion to other languages.
This library replaces libole2 and is used in gnumeric, mrproject, abiword, libwv2, koffice. It is also part of the AAF format.
Enhancements:
- This release reverts jump to dynamic types, as they arent thread-safe.
- A compilation glitch on Windows has been fixed.
- Problems building without gconf macros installed are avoided.
- Configure breakage with --without-gnome has been fixed.
<<lessThere is also support for document metadata and some initial work on decompressing VBA streams in OLE files for future conversion to other languages.
This library replaces libole2 and is used in gnumeric, mrproject, abiword, libwv2, koffice. It is also part of the AAF format.
Enhancements:
- This release reverts jump to dynamic types, as they arent thread-safe.
- A compilation glitch on Windows has been fixed.
- Problems building without gconf macros installed are avoided.
- Configure breakage with --without-gnome has been fixed.
Download (0.70MB)
Added: 2007-07-17 License: LGPL (GNU Lesser General Public License) Price:
831 downloads
MKDoc::Text::Structured::Inline 0.83
MKDoc::Text::Structured::Inline is a Perl module to convert text to HTML without handling block-level tags. more>>
MKDoc::Text::Structured::Inline is a Perl module to convert text to HTML without handling block-level tags.
SYNOPSIS
my $text = some_structured_text();
my $this = MKDoc::Text::Structured::Inline::process ($text);
my $that = MKDoc::Text::Structured::Inline::process_entities_only ($text);
<<lessSYNOPSIS
my $text = some_structured_text();
my $this = MKDoc::Text::Structured::Inline::process ($text);
my $that = MKDoc::Text::Structured::Inline::process_entities_only ($text);
Download (0.014MB)
Added: 2006-08-24 License: Perl Artistic License Price:
1156 downloads
Struct::Compare 1.0.1
Struct::Compare is a recursive diff for perl structures. more>>
Struct::Compare is a recursive diff for perl structures.
SYNOPSIS
use Struct::Compare;
my $is_different = compare($ref1, $ref2);
Compares two values of any type and structure and returns true if they are the same. It does a deep comparison of the structures, so a hash of a hash of a whatever will be compared correctly.
This is especially useful for writing unit tests for your modules!
PUBLIC FUNCTIONS
$bool = compare($var1, $var2)
Recursively compares $var1 to $var2, returning false if either structure is different than the other at any point. If both are undefined, it returns true as well, because that is considered equal.
<<lessSYNOPSIS
use Struct::Compare;
my $is_different = compare($ref1, $ref2);
Compares two values of any type and structure and returns true if they are the same. It does a deep comparison of the structures, so a hash of a hash of a whatever will be compared correctly.
This is especially useful for writing unit tests for your modules!
PUBLIC FUNCTIONS
$bool = compare($var1, $var2)
Recursively compares $var1 to $var2, returning false if either structure is different than the other at any point. If both are undefined, it returns true as well, because that is considered equal.
Download (0.003MB)
Added: 2007-02-12 License: Perl Artistic License Price:
984 downloads
HTML::Tree::AboutTrees 3.21
HTML::Tree::AboutTrees is a article on tree-shaped data structures in Perl. more>>
HTML::Tree::AboutTrees is a article on tree-shaped data structures in Perl.
This an article, not a module.
The following article by Sean M. Burke first appeared in The Perl Journal #18 and is copyright 2000 The Perl Journal. It appears courtesy of Jon Orwant and The Perl Journal. This document may be distributed under the same terms as Perl itself.
<<lessThis an article, not a module.
The following article by Sean M. Burke first appeared in The Perl Journal #18 and is copyright 2000 The Perl Journal. It appears courtesy of Jon Orwant and The Perl Journal. This document may be distributed under the same terms as Perl itself.
Download (0.11MB)
Added: 2006-09-18 License: GPL (GNU General Public License) Price:
1132 downloads
Flat Assembler 1.67.21
Flat Assembler is an extremely fast and efficient x86 assembler. more>>
The flat assembler is a fast and efficient self-assembling 80x86 assembler for DOS, Windows, and Linux operating systems. Currently, it supports all 8086-80486/Pentium instructions with MMX, SSE, SSE2, SSE3, and 3DNow! extensions.
It can produce output in binary, MZ, PE, COFF, or ELF format. Flat Assembler includes the powerful but easy-to-use macroinstruction support, and does multiple passes to optimize the instruction codes for size. The flat assembler is entirely written in assembly language.
Enhancements:
- 32-bit relocations are now allowed in PE64 output format.
- EIP-relative addressing was added.
- The PLT operator was added for the ELF output format.
- SSSE3 (Supplemental SSE3) instructions were added.
- Some Win64 headers and examples were provided in the Windows package.
- The SYSRETQ mnemonic was added, and RDMSRQ/WRMSRQ/SYSEXITQ mnemonics were added for the 64-bit variants of respective instructions.
- R8L-R15L (Intel-style) aliases were added for R8B-R15B registers. Support for the AMD SVM technology instructions was added. Numerous bugs were fixed.
<<lessIt can produce output in binary, MZ, PE, COFF, or ELF format. Flat Assembler includes the powerful but easy-to-use macroinstruction support, and does multiple passes to optimize the instruction codes for size. The flat assembler is entirely written in assembly language.
Enhancements:
- 32-bit relocations are now allowed in PE64 output format.
- EIP-relative addressing was added.
- The PLT operator was added for the ELF output format.
- SSSE3 (Supplemental SSE3) instructions were added.
- Some Win64 headers and examples were provided in the Windows package.
- The SYSRETQ mnemonic was added, and RDMSRQ/WRMSRQ/SYSEXITQ mnemonics were added for the 64-bit variants of respective instructions.
- R8L-R15L (Intel-style) aliases were added for R8B-R15B registers. Support for the AMD SVM technology instructions was added. Numerous bugs were fixed.
Download (0.17MB)
Added: 2007-03-20 License: BSD License Price:
958 downloads
KLinkStatus 0.3.1
KLinkStatus is a KDE link checker. more>>
KLinkStatus is a KDE link checker. KLinkStatus project can be run as a standalone application or be embedded inside another application.
It supports HTTP, FTP, SSH (fish or SFTP), and file protocols, proxies, authentication, the HTML 4.0 and HTTP 1.1 standards, server-side includes, regular expressions for restrict which URLs are searched, the display of link results as they are checked, a tree-like view that reflects the file structure of the documents, a flat view, the ability to limit the search depth, and more
Main features:
- Support several protocols (allowing fast checking of local documents): http, ftp, ssh (fish or sftp) and file.
- Proxy support
- Allows authentication when checking restricted documents
- Supports the latest Web standards-- HTML 4.0, HTTP 1.1
- Server-Side Includes (SSI, aka SHTML) are supported and checked
- Regular expressions to restrict which URLs are searched
- Show link results as they are checked
- Tree like view (that reflects the file structure of the documents) or flat view
- Limit the search depth
- Fragment identifiers ("#" anchor links that point to a specific section in a document) are supported and checked
- Pause/Resume of checking session
- History of checked URLs
- Tabbed checking (allow multiple sessions at the same time)
- Filter checked links (good, broken, malformed and undetermined)
- Configurable number of simultaneous connections (performance tunning)
- Other configurable options like "check external links", "check parent folders", "timeout"
- Good integration with Quanta+
Enhancements:
- Some bugfixes and feature improvements were done.
<<lessIt supports HTTP, FTP, SSH (fish or SFTP), and file protocols, proxies, authentication, the HTML 4.0 and HTTP 1.1 standards, server-side includes, regular expressions for restrict which URLs are searched, the display of link results as they are checked, a tree-like view that reflects the file structure of the documents, a flat view, the ability to limit the search depth, and more
Main features:
- Support several protocols (allowing fast checking of local documents): http, ftp, ssh (fish or sftp) and file.
- Proxy support
- Allows authentication when checking restricted documents
- Supports the latest Web standards-- HTML 4.0, HTTP 1.1
- Server-Side Includes (SSI, aka SHTML) are supported and checked
- Regular expressions to restrict which URLs are searched
- Show link results as they are checked
- Tree like view (that reflects the file structure of the documents) or flat view
- Limit the search depth
- Fragment identifiers ("#" anchor links that point to a specific section in a document) are supported and checked
- Pause/Resume of checking session
- History of checked URLs
- Tabbed checking (allow multiple sessions at the same time)
- Filter checked links (good, broken, malformed and undetermined)
- Configurable number of simultaneous connections (performance tunning)
- Other configurable options like "check external links", "check parent folders", "timeout"
- Good integration with Quanta+
Enhancements:
- Some bugfixes and feature improvements were done.
Download (0.80MB)
Added: 2006-03-29 License: GPL (GNU General Public License) Price:
1304 downloads
Amarok Folder Icons 0.2
Amarok Folder Icons script will scan the current directory and sub directories for music, and set all the folder icons. more>>
Amarok has a built-in function for setting the icon for folders (the one that displays in Konqueror etc) to be the cover image for the album it contains. However, it only works if you let it recognize your music.
Amarok Folder Icons script will scan the current directory and sub directories for music, and set all the folder icons where it can determine that the folder contains tracks from just one album.
This works best if you store your albums in a flat structure e.g.
/path/to/your/music/artist name - album name/
Installation:
Copy the script to your main music directory, and make it executable:
At a terminal:
$ chmod +x make_amarok_folder_icons.py
Usage:
At a terminal:
$ cd /to/your/music/folder
$ ./make_amarok_folder_icons.py
<<lessAmarok Folder Icons script will scan the current directory and sub directories for music, and set all the folder icons where it can determine that the folder contains tracks from just one album.
This works best if you store your albums in a flat structure e.g.
/path/to/your/music/artist name - album name/
Installation:
Copy the script to your main music directory, and make it executable:
At a terminal:
$ chmod +x make_amarok_folder_icons.py
Usage:
At a terminal:
$ cd /to/your/music/folder
$ ./make_amarok_folder_icons.py
Download (0.006MB)
Added: 2007-07-24 License: Public Domain Price:
506 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above flat file structures search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed