eForth is a small portable Forth design for a wide range of microprocessors. This is the first implementation for 8086.
As machine dependency is consolidated into 31 code words, moving eForth to other CPU s will be much less of a chore comparing to other Forth models.
graspForth is my humble attempt at a Forth-in-C that has the following goals:
GCC ......... to support all 32-bit micros that GCC cross-compiles to.
Relocatable . to be able to run in-place in either Flash or Ram.
Fast ........ to be "not much" slower than an assembly based native Forth.
Small ....... to fit-in approx 300 words in less than 25Kbytes on a 32-bit machine.
Portable .... to achieve a 5 minute port to a new 32bit micro-processor, or micro-controller.
Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.
這是sun公司的程序員考試書籍（英文版的pdf）
還有模擬考試安裝盤，和視頻！我將稍后發(fā)布！
READ THIS AGREEMENT CAREFULLY. IF YOU AGREE TO ALL THE TERMS AND CONDITIONS SET FORTH BELOW AND ARE WILLING TO BE LEGALLY BOUND BY THEM, PRESS THE I AGREE BUTTON TO CONTINUE WITH THE SETUP. IF YOU DO NOT AGREE TO SUCH TERMS AND CONDITIONS, PRESS THE I DON T AGREE BUTTON TO ABORT THE INSTALLATION.
This a two node test, requires a Coordinator
and an RFD. The coordinator and node simply
ping-pong a packet back and forth, and print
out the RSSI byte. The RFD waits before
bouncing it back, while the coordinator responds
immediately.
