Today (Saturday) We will make some minor tuning adjustments to MySQL.

You may experience 2 up to 10 seconds "glitch time" when we restart MySQL. We expect to make these adjustments around 1AM Eastern Daylight Saving Time (EDT) US.


From little Acorns big trees grow...


Login or Register to Reply

 
Thread Tools Search this Thread
# 1  
From little Acorns big trees grow...

Hi all...

This is mainly for Corona688: Do yo remember your translation of a DFT into AWK code?
Well it reached 130 dls inside the first 14 days, but take a look at it now.


Aminet - dev/gcc/DFT-FFT.awk.txt
These 4 Users Gave Thanks to wisecracker For This Post:
Login or Register to Reply

|
Thread Tools Search this Thread
Search this Thread:
Advanced Search

More UNIX and Linux Forum Topics You Might Find Helpful
2-4 trees in C
bashuser2
i am trying to write a program in order to learn how to work with trees and especially 2-4 trees. the general idea is that each node is represented by 4 cells and 5 pointers? (maybe 2 arrays then? ) let's suppose that we insert simply int numbers in all cells. firstly we initialize the root...... Programming
2
Programming
How to view a big file(143M big)
chenhao_no1
1 . Thanks everyone who read the post first. 2 . I have a log file which size is 143M , I can not use vi open it .I can not use xedit open it too. How to view it ? If I want to view 200-300 ,how can I implement it 3 . Thanks... UNIX for Dummies Questions & Answers
3
UNIX for Dummies Questions & Answers
fifo(n) 																   fifo(n)

__________________________________________________________________________________________________________________________________________________

NAME
fifo - Create and manipulate u-turn fifo channels
SYNOPSIS
package require Tcl package require memchan fifo _________________________________________________________________
DESCRIPTION
fifo creates a stream-oriented in-memory channel and returns its handle. There is no restriction on the ultimate size of the channel, it will always grow as much as is necessary to accomodate the data written into it. In contrast to the channels generated by memchan a channel created here effectively represents an U-turn. All data written into it can be read out, but only in the same order. This also means that a fifo channel is not seekable. The channels created here can be transfered between interpreters in the same thread and between threads, but only as a whole. It is not possible to use them to create a bi- or unidirectional connection between two interpreters. Memory channels created by fifo provide two read-only options which can be queried via the standard fconfigure command. These are -length The value of this option is the number of bytes currently stored in the queried memory channel. -allocated The value of this option is the number of bytes currently allocated by the queried memory channel. This number is at least as big as the value of -length. As the channels generated by fifo grow as necessary they are always writable. This means that a writable fileevent-handler will fire con- tinuously. The channels are also readable if they contain more than zero bytes. Under this conditions a readable fileevent-handler will fire continu- ously.
NOTES
One possible application of memory channels created by memchan or fifo is as temporay storage device to collect data coming in over a pipe or a socket. If part of the processing of the incoming data is to read and process header bytes or similar fifo are easier to use as they do not require seeking back and forth to switch between the assimilation of headers at the beginning and writing new data at the end.
SEE ALSO
fifo2, memchan, null
KEYWORDS
channel, fifo, i/o, in-memory channel, memchan, stream
COPYRIGHT
Copyright (c) 1996-2003 Andreas Kupries <andreas_kupries@users.sourceforge.net> Memory channels 2.1 fifo(n)

Featured Tech Videos