volume.app 1.1a
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 9
Volume.app 1.1a
Volume.app is a small graphical software utility enabling quick and convenient control of a computers audio volume level. more>>
Volume.app is a small graphical software utility enabling quick and convenient control of a computers audio volume level. Volume.app is intended for use on Linux/Unix systems in conjunction with an X window manager that supports dockable applications ("dockapps") such as AfterStep, BlackBox, or Window Maker.
It is a refinement of an idea that first appeared in Timecops WMix: a user interface comprising a "knob" that can be interactively "turned" by clicking and dragging the mouse. I found this approach quite appealing, both from an aesthetic viewpoint, and (more importantly) from a user-interface perspective.
A handful of other dockapp volume control programs are out there, and I have tried many of them. An interface element present in most of these is some form of "slider" as the primary means of adjusting the volume. (A fictitious example may be seen at right). To my dismay, with this kind of interface, volume adjustments tended to be large and abrupt. Because the slider was so small, raising or lowering the volume "just a bit" required extremely careful control of the mouse-- a slip of the hand had the potential to spike the volume to full blast. (I have a set of Altec-Lansing ACS48 speakers which make this a rather unpleasant experience). This approach left much to be desired.
I longed for an alternative, and upon playing with WMix (pictured at left) I had found it. The knob was genius in that it provided a means of graphically adjusting the volume, as a slider would, without tying itself directly to the motion of the mouse. The basic mode of usage is identical: you click on the thing and drag the mouse up or down. However, with the knob, the range of motion need not be confined to the postage-stamp-sized area of the dockapp. The mouse travel needed to cover the entire range of volume settings can be made longer, on the order of the full height of the screen-- almost like a much larger, easier-to-use slider. No longer were precise movements needed to make volume adjustments!
Still, I found WMixs interface to be a bit busy (never was a fan of tiny little buttons) and the all-important knob was yet a rather small target to find with the mouse. So, I grabbed a copy of the WMix source code, and rebuilt it into a dockapp that had a much larger knob as its sole interface element. I dubbed it Volume.app, and have placed it here for the benefit of everyone.
<<lessIt is a refinement of an idea that first appeared in Timecops WMix: a user interface comprising a "knob" that can be interactively "turned" by clicking and dragging the mouse. I found this approach quite appealing, both from an aesthetic viewpoint, and (more importantly) from a user-interface perspective.
A handful of other dockapp volume control programs are out there, and I have tried many of them. An interface element present in most of these is some form of "slider" as the primary means of adjusting the volume. (A fictitious example may be seen at right). To my dismay, with this kind of interface, volume adjustments tended to be large and abrupt. Because the slider was so small, raising or lowering the volume "just a bit" required extremely careful control of the mouse-- a slip of the hand had the potential to spike the volume to full blast. (I have a set of Altec-Lansing ACS48 speakers which make this a rather unpleasant experience). This approach left much to be desired.
I longed for an alternative, and upon playing with WMix (pictured at left) I had found it. The knob was genius in that it provided a means of graphically adjusting the volume, as a slider would, without tying itself directly to the motion of the mouse. The basic mode of usage is identical: you click on the thing and drag the mouse up or down. However, with the knob, the range of motion need not be confined to the postage-stamp-sized area of the dockapp. The mouse travel needed to cover the entire range of volume settings can be made longer, on the order of the full height of the screen-- almost like a much larger, easier-to-use slider. No longer were precise movements needed to make volume adjustments!
Still, I found WMixs interface to be a bit busy (never was a fan of tiny little buttons) and the all-important knob was yet a rather small target to find with the mouse. So, I grabbed a copy of the WMix source code, and rebuilt it into a dockapp that had a much larger knob as its sole interface element. I dubbed it Volume.app, and have placed it here for the benefit of everyone.
Download (0.025MB)
Added: 2006-10-03 License: GPL (GNU General Public License) Price:
1128 downloads
EasiLiX 1.1a
The EasiLiX distribution provides a text-based, menu-driven interface for configuring services. more>>
EasiLiX is a Linux integrated software that makes easy and secure for using and administering Linux operating system and other services.
- EasiLiX makes easier,
- EasiLiX makes more simple,
- EasiLiX makes more secure,
- EasiLiX makes more stable,
- EasiLiX makes more reliable,
<<less- EasiLiX makes easier,
- EasiLiX makes more simple,
- EasiLiX makes more secure,
- EasiLiX makes more stable,
- EasiLiX makes more reliable,
Download (348MB)
Added: 2005-04-06 License: GPL (GNU General Public License) Price:
1665 downloads
Calcc 0.1.1a
Calcc is a useful command-line calculator (32/64 bit numbers) which supports multiple input and output formats. more>>
Calcc is a useful command-line calculator (32/64 bit numbers) which supports multiple input and output formats (hex, decimal, octal, base4, binary, string and IPv4/v6 addresses, base64, percentage, time), parenthesis and the following operators: complement, not, shift, rotate, xor, and, or, power, root, byte and bit swapping, multiplication, division, modulus, addition and substraction.
Can be used also like a quick and easy to use numbers converter.
I have decided to write this program for requirement (Im lost without a command-line calculator) just because after many time and searches on Internet I have never found something similar supporting what I needed.
It is specific for people which use C and assembly and need a fast and simple way for computing particular calculations often used in these programming languages but its also perfect for who wants to do 1+2 without reading a boring manual and without using tons of different programs for converting and reconverting inputs and outputs from a format to another one.
The program supports different types of input formats (default is decimal) and are recognized through a character before each number:
0x = hexadecimal example: 0x41
$ = hexadecimal example: $41
h = hexadecimal example: h41
o = octal example: o101
b = binary example: b1000001
i = IP address (v4 or v6) example: i1.2.3.4 or 1.2.3.4
or 1.2.3.4.5.6
q = base_four example: q1001
t = time hh:mm:ss example: t12:34:53
if you use t0 will be get the current system time
c = percentage example: 200 - c10 (its like 200 - 10%)
200 = c10 (returns the 10%)
must be specified ever at right of the operation
= decimal (default) example: 65
All the input types are case insensitive, so 0x7a is the same of 0X7A.
IP addresses (both ipv4 and ipv6 supported) are automatically recognized also without specifying the i char, if the program finds at least 3 dots in a number considers it an IP address.
Enhancements:
- Localtime was substituted with gmtime (UTC time visualization).
<<lessCan be used also like a quick and easy to use numbers converter.
I have decided to write this program for requirement (Im lost without a command-line calculator) just because after many time and searches on Internet I have never found something similar supporting what I needed.
It is specific for people which use C and assembly and need a fast and simple way for computing particular calculations often used in these programming languages but its also perfect for who wants to do 1+2 without reading a boring manual and without using tons of different programs for converting and reconverting inputs and outputs from a format to another one.
The program supports different types of input formats (default is decimal) and are recognized through a character before each number:
0x = hexadecimal example: 0x41
$ = hexadecimal example: $41
h = hexadecimal example: h41
o = octal example: o101
b = binary example: b1000001
i = IP address (v4 or v6) example: i1.2.3.4 or 1.2.3.4
or 1.2.3.4.5.6
q = base_four example: q1001
t = time hh:mm:ss example: t12:34:53
if you use t0 will be get the current system time
c = percentage example: 200 - c10 (its like 200 - 10%)
200 = c10 (returns the 10%)
must be specified ever at right of the operation
= decimal (default) example: 65
All the input types are case insensitive, so 0x7a is the same of 0X7A.
IP addresses (both ipv4 and ipv6 supported) are automatically recognized also without specifying the i char, if the program finds at least 3 dots in a number considers it an IP address.
Enhancements:
- Localtime was substituted with gmtime (UTC time visualization).
Download (0.034MB)
Added: 2006-04-18 License: GPL (GNU General Public License) Price:
1284 downloads
Tecnoupman 0.1.1a
Tecnoupman project is a manager/monitor for the UPS Tecnoware Adv. more>>
Tecnoupman project is a manager/monitor for the UPS Tecnoware Adv. Tecnoware (FIRENZE), only supplies a payment proprietary cable and software.
So, even if the UPS is equipped of RS-232 interface its not possible, without spent a lot of money, to manage the UPS directly from the PC.
Ive tried several times to contact the Tecnoware (firenze), but ive obtained zero support and zero technical infos about the UPSes and the cables pinouts. The cable, in fact, is a non standard one.
USAGE:
After that youve compiled the sources, and connected the UPS to Serial Port, youre ready to use the manager/monitor. Tupsmand is the core of the system. It can monitor and manage the power and the shutdown of the server/ups.
Youve to startup the daemon using a command like:
revolution#tupsmand /etc/tupsmand.conf
after startup, tupsmandll daemonize monitoring all the parameters from the
UPS. All paramters for the startup, must be specified in the config file:
tupsman.conf, like this format:
DEBUGL=1<<less
So, even if the UPS is equipped of RS-232 interface its not possible, without spent a lot of money, to manage the UPS directly from the PC.
Ive tried several times to contact the Tecnoware (firenze), but ive obtained zero support and zero technical infos about the UPSes and the cables pinouts. The cable, in fact, is a non standard one.
USAGE:
After that youve compiled the sources, and connected the UPS to Serial Port, youre ready to use the manager/monitor. Tupsmand is the core of the system. It can monitor and manage the power and the shutdown of the server/ups.
Youve to startup the daemon using a command like:
revolution#tupsmand /etc/tupsmand.conf
after startup, tupsmandll daemonize monitoring all the parameters from the
UPS. All paramters for the startup, must be specified in the config file:
tupsman.conf, like this format:
DEBUGL=1<<less
Download (0.028MB)
Added: 2007-02-20 License: GPL (GNU General Public License) Price:
976 downloads
The Wonder Shaper 1.1a
The Wonder Shaper is a very special network shaper script with a lot of features. more>>
The Wonder Shaper is a very special network shaper script with a lot of features. Works on Linux 2.4 & higher.
Goals
I attempted to create the holy grail:
* Maintain low latency for interfactive traffic at all times.
This means that downloading or uploading files should not disturb SSH or even telnet. These are the most important things, even 200ms latency is sluggish to work over.
* Allow surfing at reasonable speeds while up or downloading
Even though http is bulk traffic, other traffic should not drown it out too much.
* Make sure uploads dont harm downloads, and the other way around
This is a much observed phenomenon where upstream traffic simply destroys download speed. It turns out that all this is possible, at the cost of a tiny bit of bandwidth. The reason that uploads, downloads and ssh hurt eachother is the presence of large queues in many domestic access devices like cable or DSL modems.
Why it doesnt work well by default
ISPs know that they are benchmarked solely on how fast people can download. Besides available bandwidth, download speed is influenced heavily by packet loss, which seriously hampers TCP/IP performance. Large queues can help prevent packetloss, and speed up downloads. So ISPs configure large queues.
These large queues however damage interactivity. A keystroke must first travel the upstream queue, which may be seconds (!) long and go to your remote host. It is then displayed, which leads to a packet coming back, which must then traverse the downstream queue, located at your ISP, before it appears on your screen.
This HOWTO teaches you how to mangle and process the queue in many ways, but sadly, not all queues are accessible to us. The queue over at the ISP is completely off-limits, whereas the upstream queue probably lives inside your cable modem or DSL device. You may or may not be able to configure it. Most probably not.
So, what next? As we cant control either of those queues, they must be eliminated, and moved to your Linux router. Luckily this is possible.
Limit upload speed somewhat
By limiting our upload speed to slightly less than the truly available rate, no queues are built up in our modem. The queue is now moved to Linux.
Limit download speed
This is slightly trickier as we cant really influence how fast the internet ships us data. We can however drop packets that are coming in too fast, which causes TCP/IP to slow down to just the rate we want. Because we dont want to drop traffic unnecessarily, we configure a burst size we allow at higher speed.
Now, once we have done this, we have eliminated the downstream queue totally (except for short bursts), and gain the ability to manage the upstream queue with all the power Linux offers.
Let interactive traffic skip the queue
What remains to be done is to make sure interactive traffic jumps to the front of the upstream queue. To make sure that uploads dont hurt downloads, we also move ACK packets to the front of the queue. This is what normally causes the huge slowdown observed when generating bulk traffic both ways. The ACKnowledgements for downstream traffic must compete with upstream traffic, and get delayed in the process.
We also move other small packets to the front of the queue - this helps operating systems which do not set TOS bits, like everything from Microsoft.
Allow the user to specify low priority traffic (new in 1.1!)
Sometimes you may notice low priority OUTGOING traffic slowing down important traffic. In that case, the following options may help you:
NOPRIOHOSTSRC
Set this to hosts or netmasks in your network that should have low priority
NOPRIOHOSTDST
Set this to hosts or netmasks on the internet that should have low priority
NOPRIOPORTSRC
Set this to source ports that should have low priority. If you have an unimportant webserver on your traffic, set this to 80
NOPRIOPORTDST
Set this to destination ports that should have low priority.
See the start of wshaper and wshaper.htb
Results
If we do all this we get the following measurements using an excellent ADSL connection from xs4all in the Netherlands:
Baseline latency:
round-trip min/avg/max = 14.4/17.1/21.7 ms
Without traffic conditioner, while downloading:
round-trip min/avg/max = 560.9/573.6/586.4 ms
Without traffic conditioner, while uploading:
round-trip min/avg/max = 2041.4/2332.1/2427.6 ms
With conditioner, during 220kbit/s upload:
round-trip min/avg/max = 15.7/51.8/79.9 ms
With conditioner, during 850kbit/s download:
round-trip min/avg/max = 20.4/46.9/74.0 ms
When uploading, downloads proceed at ~80% of the available speed. Uploads at around 90%. Latency then jumps to 850 ms, still figuring out why.
What you can expect from this script depends a lot on your actual uplink speed. When uploading at full speed, there will always be a single packet ahead of your keystroke. That is the lower limit to the latency you can achieve - divide your MTU by your upstream speed to calculate. Typical values will be somewhat higher than that. Lower your MTU for better effects!
A small table:
Uplink speed | Expected latency due to upload
--------------------------------------------------
32 | 234ms
64 | 117ms
128 | 58ms
256 | 29ms
So to calculate your effective latency, take a baseline measurement (ping on an unloaded link), and look up the number in the table, and add it. That is about the best you can expect. This number comes from a calculation that assumes that your upstream keystroke will have at most half a full sized packet ahead of it.
This boils down to:
mtu * 0.5 * 10
-------------- + baseline_latency
kbit
The factor 10 is not quite correct but works well in practice.
Your kernel
If you run a recent distribution, everything should be ok. You need 2.4 with QoS options turned on.
If you compile your own kernel, it must have some options enabled. Most notably, in the Networking Options menu, QoS and/or Fair Queueing, turn at least CBQ, PRIO, SFQ, Ingress, Traffic Policing, QoS support, Rate Estimator, QoS classifier, U32 classifier, fwmark classifier.
In practice, I (and most distributions) just turn on everything.
The scripts
The script comes in two versions, one which works on standard kernels and is implemented using CBQ. The other one uses the excellent HTB qdisc which is not in the default kernel. The CBQ version is more tested than the HTB one!
See wshaper and wshaper.htb.
Tuning
These scripts need to know the real rate of your ISP connection. This is hard to determine upfront as different ISPs use different kinds of bits it appears. People report success using the following technique:
Estimate both your upstream and downstream at half the rate your ISP specifies. Now verify if the script is functioning - check interactivity while uploading and while downloading. This should deliver the latency as calculated above. If not, check if the script executed without errors.
Now slowly increase the upstream & downstream numbers in the script until the latency comes back. This way you can find optimum values for your connection. If you are happy, please report to me so I can make a list of numbers that work well. Please let me know which ISP you use and the name of your subscription, and its reputed specifications, so I can list you here and save others the trouble.
Installation
If you dial in, you can copy the script to /etc/ppp/ip-up.d and it will be run at each connect.
If you want to remove the shaper from an interface, run wshaper stop. To see status information, run wshaper status.
KNOWN PROBLEMS
If you get errors, add an -x to the first line, as follows:
#!/bin/bash -x
And retry. This will show you which line gives an error. Before contacting me, make sure that you are running a recent version of iproute!
Recent versions can be found at your Linux distributor, or if you prefer compiling, here:
ftp://ftp.inr.ac.ru/ip-routing/iproute2-current.tar.gz
<<lessGoals
I attempted to create the holy grail:
* Maintain low latency for interfactive traffic at all times.
This means that downloading or uploading files should not disturb SSH or even telnet. These are the most important things, even 200ms latency is sluggish to work over.
* Allow surfing at reasonable speeds while up or downloading
Even though http is bulk traffic, other traffic should not drown it out too much.
* Make sure uploads dont harm downloads, and the other way around
This is a much observed phenomenon where upstream traffic simply destroys download speed. It turns out that all this is possible, at the cost of a tiny bit of bandwidth. The reason that uploads, downloads and ssh hurt eachother is the presence of large queues in many domestic access devices like cable or DSL modems.
Why it doesnt work well by default
ISPs know that they are benchmarked solely on how fast people can download. Besides available bandwidth, download speed is influenced heavily by packet loss, which seriously hampers TCP/IP performance. Large queues can help prevent packetloss, and speed up downloads. So ISPs configure large queues.
These large queues however damage interactivity. A keystroke must first travel the upstream queue, which may be seconds (!) long and go to your remote host. It is then displayed, which leads to a packet coming back, which must then traverse the downstream queue, located at your ISP, before it appears on your screen.
This HOWTO teaches you how to mangle and process the queue in many ways, but sadly, not all queues are accessible to us. The queue over at the ISP is completely off-limits, whereas the upstream queue probably lives inside your cable modem or DSL device. You may or may not be able to configure it. Most probably not.
So, what next? As we cant control either of those queues, they must be eliminated, and moved to your Linux router. Luckily this is possible.
Limit upload speed somewhat
By limiting our upload speed to slightly less than the truly available rate, no queues are built up in our modem. The queue is now moved to Linux.
Limit download speed
This is slightly trickier as we cant really influence how fast the internet ships us data. We can however drop packets that are coming in too fast, which causes TCP/IP to slow down to just the rate we want. Because we dont want to drop traffic unnecessarily, we configure a burst size we allow at higher speed.
Now, once we have done this, we have eliminated the downstream queue totally (except for short bursts), and gain the ability to manage the upstream queue with all the power Linux offers.
Let interactive traffic skip the queue
What remains to be done is to make sure interactive traffic jumps to the front of the upstream queue. To make sure that uploads dont hurt downloads, we also move ACK packets to the front of the queue. This is what normally causes the huge slowdown observed when generating bulk traffic both ways. The ACKnowledgements for downstream traffic must compete with upstream traffic, and get delayed in the process.
We also move other small packets to the front of the queue - this helps operating systems which do not set TOS bits, like everything from Microsoft.
Allow the user to specify low priority traffic (new in 1.1!)
Sometimes you may notice low priority OUTGOING traffic slowing down important traffic. In that case, the following options may help you:
NOPRIOHOSTSRC
Set this to hosts or netmasks in your network that should have low priority
NOPRIOHOSTDST
Set this to hosts or netmasks on the internet that should have low priority
NOPRIOPORTSRC
Set this to source ports that should have low priority. If you have an unimportant webserver on your traffic, set this to 80
NOPRIOPORTDST
Set this to destination ports that should have low priority.
See the start of wshaper and wshaper.htb
Results
If we do all this we get the following measurements using an excellent ADSL connection from xs4all in the Netherlands:
Baseline latency:
round-trip min/avg/max = 14.4/17.1/21.7 ms
Without traffic conditioner, while downloading:
round-trip min/avg/max = 560.9/573.6/586.4 ms
Without traffic conditioner, while uploading:
round-trip min/avg/max = 2041.4/2332.1/2427.6 ms
With conditioner, during 220kbit/s upload:
round-trip min/avg/max = 15.7/51.8/79.9 ms
With conditioner, during 850kbit/s download:
round-trip min/avg/max = 20.4/46.9/74.0 ms
When uploading, downloads proceed at ~80% of the available speed. Uploads at around 90%. Latency then jumps to 850 ms, still figuring out why.
What you can expect from this script depends a lot on your actual uplink speed. When uploading at full speed, there will always be a single packet ahead of your keystroke. That is the lower limit to the latency you can achieve - divide your MTU by your upstream speed to calculate. Typical values will be somewhat higher than that. Lower your MTU for better effects!
A small table:
Uplink speed | Expected latency due to upload
--------------------------------------------------
32 | 234ms
64 | 117ms
128 | 58ms
256 | 29ms
So to calculate your effective latency, take a baseline measurement (ping on an unloaded link), and look up the number in the table, and add it. That is about the best you can expect. This number comes from a calculation that assumes that your upstream keystroke will have at most half a full sized packet ahead of it.
This boils down to:
mtu * 0.5 * 10
-------------- + baseline_latency
kbit
The factor 10 is not quite correct but works well in practice.
Your kernel
If you run a recent distribution, everything should be ok. You need 2.4 with QoS options turned on.
If you compile your own kernel, it must have some options enabled. Most notably, in the Networking Options menu, QoS and/or Fair Queueing, turn at least CBQ, PRIO, SFQ, Ingress, Traffic Policing, QoS support, Rate Estimator, QoS classifier, U32 classifier, fwmark classifier.
In practice, I (and most distributions) just turn on everything.
The scripts
The script comes in two versions, one which works on standard kernels and is implemented using CBQ. The other one uses the excellent HTB qdisc which is not in the default kernel. The CBQ version is more tested than the HTB one!
See wshaper and wshaper.htb.
Tuning
These scripts need to know the real rate of your ISP connection. This is hard to determine upfront as different ISPs use different kinds of bits it appears. People report success using the following technique:
Estimate both your upstream and downstream at half the rate your ISP specifies. Now verify if the script is functioning - check interactivity while uploading and while downloading. This should deliver the latency as calculated above. If not, check if the script executed without errors.
Now slowly increase the upstream & downstream numbers in the script until the latency comes back. This way you can find optimum values for your connection. If you are happy, please report to me so I can make a list of numbers that work well. Please let me know which ISP you use and the name of your subscription, and its reputed specifications, so I can list you here and save others the trouble.
Installation
If you dial in, you can copy the script to /etc/ppp/ip-up.d and it will be run at each connect.
If you want to remove the shaper from an interface, run wshaper stop. To see status information, run wshaper status.
KNOWN PROBLEMS
If you get errors, add an -x to the first line, as follows:
#!/bin/bash -x
And retry. This will show you which line gives an error. Before contacting me, make sure that you are running a recent version of iproute!
Recent versions can be found at your Linux distributor, or if you prefer compiling, here:
ftp://ftp.inr.ac.ru/ip-routing/iproute2-current.tar.gz
Download (MB)
Added: 2007-02-13 License: GPL (GNU General Public License) Price:
994 downloads
PHPWebCalendar 4.1.1a
PHPWebCalendar is an events calendar written in PHP, no suprises there. more>>
PHPWebCalendar is an events calendar written in PHP, no suprises there. PHPWebCalendar project has quite a long history and a number of different versions (branches), we have the first one, which was complete and intended to be for general use.
Version 2 was focusing on making it more user-friendly and easier to install/manage. This was half complete and abandoned. In version 3 (while working on the other versions) my aim was to make it a XUL application, this was rather quickly abandoned with no code released. Version 4, codenamed Boxy (to try to stop all this confusion over version 3 etc) is a complete re-write, from scratch.
It is being re-written because the first versions were just learning projects and were written rather poorly. Now that i have learned from my mistakes i can make everything work together a lot better and add a lot better features.
Enhancements:
- Fixed a typo in the login process
- Regular users can now delete thier own events
- Fixed a little bug in calendar.php, if the user is changing the month and the date gets messed up it is able to recover and go back to today
<<lessVersion 2 was focusing on making it more user-friendly and easier to install/manage. This was half complete and abandoned. In version 3 (while working on the other versions) my aim was to make it a XUL application, this was rather quickly abandoned with no code released. Version 4, codenamed Boxy (to try to stop all this confusion over version 3 etc) is a complete re-write, from scratch.
It is being re-written because the first versions were just learning projects and were written rather poorly. Now that i have learned from my mistakes i can make everything work together a lot better and add a lot better features.
Enhancements:
- Fixed a typo in the login process
- Regular users can now delete thier own events
- Fixed a little bug in calendar.php, if the user is changing the month and the date gets messed up it is able to recover and go back to today
Download (MB)
Added: 2007-05-10 License: GPL (GNU General Public License) Price:
899 downloads
libConfig++ 1.1a
libConfig++ is a portable and flexible C++ library for reading configuration files which were written in C style syntax. more>>
libConfig++ is a library made in C++ for reading configuration files which were written in C style syntax.
These are the main points of this project:
- This project allows you to write simple but powerful configuration files and use their in you C++ projects.
- The sintax of configuration file is like C++, that is why it is wellknown for you.
- The sintax parser is written with help of lex and bison. Thats why you can easy change the sintax if you want.
- The library is portable to any unix OS and Windows.
- There is easy using and safe interface to setup your program variables from config. - Type control is made during compilation. This helps to avoid some invisible errors in sources.
- You can define your own types and the library will control this when you setup variables from config file.
- The library allows using multifile configuration. Token "#include" allows to include one config file into other.
Enhancements:
- New syntax was added for section descriptions.
- Minor API changes were made.
<<lessThese are the main points of this project:
- This project allows you to write simple but powerful configuration files and use their in you C++ projects.
- The sintax of configuration file is like C++, that is why it is wellknown for you.
- The sintax parser is written with help of lex and bison. Thats why you can easy change the sintax if you want.
- The library is portable to any unix OS and Windows.
- There is easy using and safe interface to setup your program variables from config. - Type control is made during compilation. This helps to avoid some invisible errors in sources.
- You can define your own types and the library will control this when you setup variables from config file.
- The library allows using multifile configuration. Token "#include" allows to include one config file into other.
Enhancements:
- New syntax was added for section descriptions.
- Minor API changes were made.
Download (0.31MB)
Added: 2007-04-20 License: LGPL (GNU Lesser General Public License) Price:
918 downloads
Sort::Versions 1.5
Sort::Versions is a Perl 5 module for sorting of revision-like numbers. more>>
Sort::Versions is a Perl 5 module for sorting of revision-like numbers.
SYNOPSIS
use Sort::Versions;
@l = sort { versioncmp($a, $b) } qw( 1.2 1.2.0 1.2a.0 1.2.a 1.a 02.a );
...
use Sort::Versions;
print lower if versioncmp(1.2, 1.2a) == -1;
...
use Sort::Versions;
%h = (1 => d, 2 => c, 3 => b, 4 => a);
@h = sort { versioncmp($h{$a}, $h{$b}) } keys %h;
Sort::Versions allows easy sorting of mixed non-numeric and numeric strings, like the version numbers that many shared library systems and revision control packages use. This is quite useful if you are trying to deal with shared libraries. It can also be applied to applications that intersperse variable-width numeric fields within text. Other applications can undoubtedly be found.
For an explanation of the algorithm, its simplest to look at these examples:
1.1 < 1.2
1.1a < 1.2
1.1 < 1.1.1
1.1 < 1.1a
1.1.a < 1.1a
1 < a
a < b
1 < 2
1.1-3 < 1.1-4
1.1-5 < 1.1.6
More precisely (but less comprehensibly), the two strings are treated as subunits delimited by periods or hyphens. Each subunit can contain any number of groups of digits or non-digits. If digit groups are being compared on both sides, a numeric comparison is used, otherwise a ASCII ordering is used. A group or subgroup with more units will win if all comparisons are equal. A period binds digit groups together more tightly than a hyphen.
Some packages use a different style of version numbering: a simple real number written as a decimal. Sort::Versions has limited support for this style: when comparing two subunits which are both digit groups, if either subunit has a leading zero, then both are treated like digits after a decimal point. So for example:
0002 < 1
1.06 < 1.5
This wont always work, because there wont always be a leading zero in real-number style version numbers. There is no way for Sort::Versions to know which style was intended. But a lot of the time it will do the right thing. If you are making up version numbers, the style with (possibly) more than one dot is the style to use.
USAGE
The function versioncmp() takes two arguments and compares them like cmp. With perl 5.6 or later, you can also use this function directly in sorting:
@l = sort versioncmp qw(1.1 1.2 1.0.3);
The function versions() can be used directly as a sort function even on perl 5.005 and earlier, but its use is deprecated.
<<lessSYNOPSIS
use Sort::Versions;
@l = sort { versioncmp($a, $b) } qw( 1.2 1.2.0 1.2a.0 1.2.a 1.a 02.a );
...
use Sort::Versions;
print lower if versioncmp(1.2, 1.2a) == -1;
...
use Sort::Versions;
%h = (1 => d, 2 => c, 3 => b, 4 => a);
@h = sort { versioncmp($h{$a}, $h{$b}) } keys %h;
Sort::Versions allows easy sorting of mixed non-numeric and numeric strings, like the version numbers that many shared library systems and revision control packages use. This is quite useful if you are trying to deal with shared libraries. It can also be applied to applications that intersperse variable-width numeric fields within text. Other applications can undoubtedly be found.
For an explanation of the algorithm, its simplest to look at these examples:
1.1 < 1.2
1.1a < 1.2
1.1 < 1.1.1
1.1 < 1.1a
1.1.a < 1.1a
1 < a
a < b
1 < 2
1.1-3 < 1.1-4
1.1-5 < 1.1.6
More precisely (but less comprehensibly), the two strings are treated as subunits delimited by periods or hyphens. Each subunit can contain any number of groups of digits or non-digits. If digit groups are being compared on both sides, a numeric comparison is used, otherwise a ASCII ordering is used. A group or subgroup with more units will win if all comparisons are equal. A period binds digit groups together more tightly than a hyphen.
Some packages use a different style of version numbering: a simple real number written as a decimal. Sort::Versions has limited support for this style: when comparing two subunits which are both digit groups, if either subunit has a leading zero, then both are treated like digits after a decimal point. So for example:
0002 < 1
1.06 < 1.5
This wont always work, because there wont always be a leading zero in real-number style version numbers. There is no way for Sort::Versions to know which style was intended. But a lot of the time it will do the right thing. If you are making up version numbers, the style with (possibly) more than one dot is the style to use.
USAGE
The function versioncmp() takes two arguments and compares them like cmp. With perl 5.6 or later, you can also use this function directly in sorting:
@l = sort versioncmp qw(1.1 1.2 1.0.3);
The function versions() can be used directly as a sort function even on perl 5.005 and earlier, but its use is deprecated.
Download (0.005MB)
Added: 2007-05-22 License: Perl Artistic License Price:
885 downloads
Avi2yuv 0.9.7
avi2yuv is a program to convert AVIs into the YUV format for input of the Berkeley mpeg_encoder. more>>
avi2yuv is a program to convert AVIs into the YUV format for input of the Berkeley mpeg_encoder. Alternatively you can use mpeg2encode by the MPEG Software Simulation Group or save the frames as single files (YUV or BMP).
The following AVI compression algorithms are supported:
MJPG created by the cards listened in section 4) (e.g. FAST FPS60)
DIB uncompressed 16, 24 or 32 bit
YVU9 Indeo RAW
Y41P Hauppauge WinTV format
The following output formats are supported:
YUV into single files (one per frame)
YUV to stdout for direct input to mpeg_encode
BMP into single truecolor files (one per frame)
The following audio output formats are supported:
PCM raw audio data
WAV audio data with WAVE header
vi2yuv is known to work with the following hardware and software:
Intel based hardware with 32 bit compiler (LSB byte order is expected)
Videocards:
FAST FPS60
FAST Movie Machine II with MJPEG extention (should work)
FAST AV Master
MIRO DC10/DC20/DC30
Matrox Rainbow Runner Studio
AVIs created with the FAST FPS60 and edited with Adobe Premiere LE 4.0.
Uncompressed 16, 24 and 32 bit AVIs created with Adobe Premiere LE 4.0.
YVU9 AVIs created with Adobe Premiere LE 4.0.
Y41P AVIs recorded with a Bt848 card (e.g. Hauppauge WinTV PCI)
Software:
Linux 1.2.13 or 2.0.33
Berkeley MPEG encoder Version 1.5b
mpeg2encode Version 1.1a
Version 3.9t of musicin
MPLEX 1.1
mpeg2encode does also work under DOS if compiled with DJGPP (tested with
version 2.5.7). It should also work with every 32 bit compiler (e.g. emx under OS/2).
avi2yuv will only work with mpeg_encode if the pipe is 8 bit clean (depends
on the compiler and the OS). It should work under DOS if compiled with DJGPP
but youll need a lot of disk space as the output of avi2yuv will be temporarely saved to disk as DOS isnt a multitasking OS (not tested).
<<lessThe following AVI compression algorithms are supported:
MJPG created by the cards listened in section 4) (e.g. FAST FPS60)
DIB uncompressed 16, 24 or 32 bit
YVU9 Indeo RAW
Y41P Hauppauge WinTV format
The following output formats are supported:
YUV into single files (one per frame)
YUV to stdout for direct input to mpeg_encode
BMP into single truecolor files (one per frame)
The following audio output formats are supported:
PCM raw audio data
WAV audio data with WAVE header
vi2yuv is known to work with the following hardware and software:
Intel based hardware with 32 bit compiler (LSB byte order is expected)
Videocards:
FAST FPS60
FAST Movie Machine II with MJPEG extention (should work)
FAST AV Master
MIRO DC10/DC20/DC30
Matrox Rainbow Runner Studio
AVIs created with the FAST FPS60 and edited with Adobe Premiere LE 4.0.
Uncompressed 16, 24 and 32 bit AVIs created with Adobe Premiere LE 4.0.
YVU9 AVIs created with Adobe Premiere LE 4.0.
Y41P AVIs recorded with a Bt848 card (e.g. Hauppauge WinTV PCI)
Software:
Linux 1.2.13 or 2.0.33
Berkeley MPEG encoder Version 1.5b
mpeg2encode Version 1.1a
Version 3.9t of musicin
MPLEX 1.1
mpeg2encode does also work under DOS if compiled with DJGPP (tested with
version 2.5.7). It should also work with every 32 bit compiler (e.g. emx under OS/2).
avi2yuv will only work with mpeg_encode if the pipe is 8 bit clean (depends
on the compiler and the OS). It should work under DOS if compiled with DJGPP
but youll need a lot of disk space as the output of avi2yuv will be temporarely saved to disk as DOS isnt a multitasking OS (not tested).
Download (0.048MB)
Added: 2006-07-18 License: GPL (GNU General Public License) Price:
697 downloads
Secleted [ 0 ] software to compare
- Page: 1 of 1
- 1
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above volume.app 1.1a 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
