text stringlengths 454 608k | url stringlengths 17 896 | dump stringclasses 91
values | source stringclasses 1
value | word_count int64 101 114k | flesch_reading_ease float64 50 104 |
|---|---|---|---|---|---|
I just published my first Vim plugin, import-js-from-history
Kaz Gosho
・1 min read
I am Vim lover, but I have never created nor published my Vim plugin.
This time I created my first plugin,
import-js-from-history.
What is
import-js-from-history
import-js-from-history helps write JS & TS
import statement.
It reads
import statement in all of git files, and suggest
import statement.
Why
I have been tired to write
import statement at the top of file. I have been repeated writing
import React from 'react' again and again.
When I used Visual Studio Code (VSCode), I was surprised that it can suggest
import when I type package name to be imported.
After going back to Vim (technically Neovim), I missed the feature. So I created the Vim plugin.
You might wonder why I don't use VScode.
Actually, I attempted to switch to VSCode. I installed major VSCode extensions, including
Visual Studio Vim. However, I couldn't accept some small different from Vim, such as I cannot use
zz in file explore.
Why not use other plugins
I know there are some Vim plugins to import js programmatically, but all of plugins I tried does not work well.
So I created this solution, as well as my Vim training.
When using
inputlist, the first item should be a prompt (like
"Choose import statement to add"or something). Otherwise hitting
<Esc>, or hitting
<Cr>without entering a number, will make
inputlistreturn
0- which will insert the first import from the list, even though the user probably thought it will cancel the action (the builtin prompt even says explicitly "
(empty cancels)"). If the first line is a prompt, not picking is the same as picking the prompt - which will do nothing.
Another advantage is that you can start the list from 1. Arrays start from 0, but as UI lists that start from 0 look weird...
While having the first item be the prompt is clearly the intention (it's even written in
:help inputlist), but it looks like this function was meant to be used with an hard-coded list and the API is not comfortable when you want a generated one. In my plugins I usually write a wrapper function which also does pagination if the list is too long. You can steal it if you want.
Thank you very much! I wanted to find the correct solution for user cancellation.
I will put 0 as cancel for the prompt. | https://dev.to/acro5piano/i-just-published-my-first-vim-plugin-import-js-from-history-3a4l | CC-MAIN-2020-16 | refinedweb | 418 | 72.76 |
Teams
Quilt Teams offer enhanced security, auditing, and privacy. Only team members can read and write data to and from the team. Teams are controlled by one or more admins who have access to a special web interface where they can audit data usage, add new members, and more.
Technically, a Quilt team is a dedicated, single-tenant registry with a private package namespace. Teams also feature their own web searchable catalog (accessible only to team members), similar to quiltdata.com.
To create your own Quilt team, contact us.
Command line API
Team members have access to the standard API with the following differences and additional features.
Differences in the Core API/disbl
quilt login
Authenticate to team registry:
quilt login TEAM
quilt build|push|install
Team users should prefix package handles with the team namespace:
quilt build|push|install TEAM:USER/PKG
quilt push visibility
quilt push --teammakes a package visible to everyone on your team
is currently disabled for team packages
quilt push --public
quilt access
To make a package visible to your entire team:
quilt access add TEAM:USER/PKG team
Public visibility is not yet supported for team packages.
Import and use data
from quilt.team.TEAM.USER import PKG
Admin features
quilt user list
List users and associated metadata for your team.
quilt user list TEAM
quilt user create
Add a team member.
quilt user create TEAM USERNAME EMAIL
quilt user disable
Disable a team member.
quilt user disable TEAM USERNAME
quilt user reset-password
Send a user a reset-password email.
quilt user reset-password TEAM USERNAME
quilt audit
Audit events relating to a user or package.
quilt audit USER_OR_PACKAGE | https://docs.quiltdata.com/teams.html | CC-MAIN-2018-22 | refinedweb | 276 | 53.92 |
webmethod within a jsp-filehansolo chui Mar 1, 2008 5:15 AM
packaging and deploying the following code works (i think so, because a wsdl is generated and i can access it).
package helloservice.endpoint;
import javax.jws.WebMethod;
import javax.jws.WebService;
import javax.ejb.Stateless;
i
@Stateless
@WebService
public class Hello {
private String message = new String("Hello, ");
@WebMethod
public String sayHello(String name) {
return message + name + ".";
}
}
Now i want to execute "sayHello" within a jsp-file, and i dont get it to work. how does it work ????
1. Re: webmethod within a jsp-filehansolo chui Mar 1, 2008 5:20 AM (in response to hansolo chui)
i forgot to say that the jsp is in an extra war-file
2. Re: webmethod within a jsp-filePeter Johnson Mar 3, 2008 11:16 AM (in response to hansolo chui)
Accessing a web method from a jsp (or servlet) is no different from accessing a web method from any other client. The JBossWS documentation contains the necessary steps for building a client.
3. Re: webmethod within a jsp-filehansolo chui Mar 7, 2008 5:59 AM (in response to hansolo chui)
now i got a standalone java-client working: void main(String[] args) {);
}
}
but when i copy the code into a new function and access it from within a jsp-file, i get errors. String say(String args) {
Hello port = service.getHelloPort();
String name;
if (args != null) {
name = args;
} else {
name = "No Name";
}
String response = port.sayHello(name);
return response;
}
}
ERROR [ServiceDelegateImpl] Cannot create proxy for SEI helloservice.endpoint.Hello from: vfsfile:/opt/jboss-5.0.0.Beta4/server/default/deploy/
11:51:14,647 ERROR [[jsp]] Servlet.service() for servlet jsp threw exception
java.lang.IllegalArgumentException: helloservice.endpoint.Hello is not an interface
i dont understand this error, since the standalone client does not complain about helloservice.endpoint.Hello being not an interface (and it is one !!)
4. Re: webmethod within a jsp-filePeter Johnson Mar 7, 2008 3:59 PM (in response to hansolo chui)
You never said you were using beta software! Looks like a classloader issue to me, and the classloader in 5.0 beta4 is very broke.
Using 5.0 beta 4, if I create the web service, then generate the WSDL, and then use wsconsume to generate the client stubs, there is always a stub whose name matches the name of the class that implements the web service. Then, when my servlet attempts to create the web service connection, I get the same "xxx is not an interface" exception. Apparently, web services is using the wrong classloader repository to look up the class - it is looking in the more global classloader repository which contains the web service implementation class, which of course, is not an interface. It should, instead, be using the classloader repository for the war file, in which case it will find the interface for which it is looking.
Interestingly enough, if I develop my web service using a top-down approach (wsdl first, then generate stubs, and implement based on those stubs) it works. That is because both the global classloader repository and the war classloader repository agree that the class in question is really an interface.
Let me try the top-down approach in 4.2.2, back in a second. It works. Hmm, let me try the bottom-up approach in 4.2.2. That works also. Moral of the story - when things don't work, if you are using a beta of the next version, fall back to a qualified, released version and try it there - it just might work. | https://developer.jboss.org/thread/39209 | CC-MAIN-2017-43 | refinedweb | 602 | 63.7 |
LaTeX::TOM - A module for parsing, analyzing, and manipulating LaTeX documents.
use LaTeX::TOM; $parser = LaTeX::TOM->new; $document = $parser->parseFile('mypaper.tex'); $latex = $document->toLaTeX; $specialnodes = $document->getNodesByCondition(sub { my $node = shift; return ( $node->getNodeType eq 'TEXT' && $node->getNodeText =~ /magic string/ ); }); $sections = $document->getNodesByCondition(sub { my $node = shift; return ( $node->getNodeType eq 'COMMAND' && $node->getCommandName =~ /section$/ ); }); $indexme = $document->getIndexableText; $document->print;
This module provides a parser which parses and interprets (though not fully) LaTeX documents and returns a tree-based representation of what it finds. This tree is a
LaTeX::TOM::Tree. The tree contains
LaTeX::TOM::Node nodes.
This module should be especially useful to anyone who wants to do processing of LaTeX documents that requires extraction of plain-text information, or altering of the plain-text components (or alternatively, the math-text components).
The parser recognizes 3 parameters upon creation by
LaTeX::TOM->new. The parameters, in order, are
Determines what happens when a parse error is encountered.
0 results in a warning.
1 results in a die.
2 results in silence. Note that particular groupings in LaTeX (i.e. newcommands and the like) contain invalid TeX or LaTeX, so you nearly always need this parameter to be
0 or
2 to completely parse the document.
This flag determines whether a scan for
\input and
\input-like commands is performed, and the resulting called files parsed and added to the parent parse tree.
0 means no,
1 means do it. Note that this will happen recursively if it is turned on. Also, bibliographies (.bbl files) are detected and included.
This flag determines whether (most) user-defined mappings are applied. This means
\defs,
\newcommands, and
\newenvironments. This is critical for properly analyzing the content of the document, as this must be phrased in terms of the semantics of the original TeX and LaTeX commands, not ad hoc user macros. So, for instance, do not expect plain-text extraction to work properly with this option off.
The parser returns a
LaTeX::TOM::Tree ($document in the SYNOPSIS).
Nodes may be of the following types:
TEXT nodes can be thought of as representing the plain-text portions of the LaTeX document. This includes math and anything else that is not a recognized TeX or LaTeX command, or user-defined command. In reality,
TEXT nodes contain commands that this parser does not yet recognize the semantics of.
A
COMMAND node represents a TeX command. It always has child nodes in a tree, though the tree might be empty if the command operates on zero parameters. An example of a command is
\textbf{blah}
This would parse into a
COMMAND node for
textbf, which would have a subtree containing the
TEXT node with text ``blah.''
Similarly, TeX environments parse into
ENVIRONMENT nodes, which have metadata about the environment, along with a subtree representing what is contained in the environment. For example,
\begin{equation} r = \frac{-b \pm \sqrt{b^2 - 4ac}}{2a} \end{equation}
Would parse into an
ENVIRONMENT node of the class ``equation'' with a child tree containing the result of parsing
``r = \frac{-b \pm \sqrt{b^2 - 4ac}}{2a}.''
A
GROUP is like an anonymous
COMMAND. Since you can put whatever you want in curly-braces (
{}) in TeX in order to make semantically isolated regions, this separation is preserved by the parser. A
GROUP is just the subtree of the parsed contents of plain curly-braces.
It is important to note that currently only the first
GROUP in a series of
GROUPs following a LaTeX command will actually be parsed into a
COMMAND node. The reason is that, for the initial purposes of this module, it was not necessary to recognize additional
GROUPs as additional parameters to the
COMMAND. However, this is something that this module really should do eventually. Currently if you want all the parameters to a multi-parametered command, you'll need to pick out all the following
GROUP nodes yourself.
Eventually this will become something like a list which is stored in the
COMMAND node, much like XML::DOM's treatment of attributes. These are, in a sense, apart from the rest of the document tree. Then
GROUP nodes will become much more rare.
A
COMMENT node is very similar to a
TEXT node, except it is specifically for lines beginning with
``%'' (the TeX comment delimeter) or the right-hand portion of a line that has
``%'' at some internal point.
As mentioned before, the Tree is the return result of a parse.
The tree is nothing more than an arrayref of Nodes, some of which may contain their own trees. This is useful knowledge at this point, since the user isn't provided with a full suite of convenient tree-modification methods. However, Trees do already have some very convenient methods, described in the next section.
Instantiate a new parser object.
In this section all of the methods for each of the components are listed and described.
The methods for the parser are:
Read in the contents of filename and parse them, returning a
LaTeX::TOM::Tree.
Parse the string string and return a
LaTeX::TOM::Tree.
This section contains methods for the Trees returned by the parser.
Duplicate a tree into new memory.
A debug print of the structure of the tree.
Returns an arrayref which is a list of strings representing the text of all
getNodePlainTextFlag = 1
TEXT nodes, in an inorder traversal.
A method like the above but which goes one step further; it cleans all of the returned text and concatenates it into a single string which one could consider having all of the standard information retrieval value for the document, making it useful for indexing.
Return a string representing the LaTeX encoded by the tree. This is especially useful to get a normal document again, after modifying nodes of the tree.
Return a list of
LaTeX::TOM::Nodes at the top level of the Tree.
Return an arrayref with all nodes of the tree. This "flattens" the tree.
Return an arrayref with all
COMMAND nodes in the tree which have a name matching name.
Return an arrayref with all
ENVIRONMENT nodes in the tree which have a class matching name.
This is a catch-all search method which can be used to pull out nodes that match pretty much any perl expression, without manually having to traverse the tree. code reference is a perl code reference which receives as its first argument the node of the tree that is currently scrutinized and is expected to return a boolean value. See the SYNOPSIS for examples.
Returns the first node of the tree. This is useful if you want to walk the tree yourself, starting with the first node.
This section contains the methods for nodes of the parsed Trees.
Returns the type, one of
TEXT,
COMMAND,
ENVIRONMENT,
GROUP, or
COMMENT, as described above.
Applicable for
TEXT or
COMMENT nodes; this returns the document text they contain. This is undef for other node types.
Set the node text, also for
TEXT and
COMMENT nodes.
Get the starting character position in the document of this node. For
TEXT and
COMMENT nodes, this will be where the text begins. For
ENVIRONMENT,
COMMAND, or
GROUP nodes, this will be the position of the last character of the opening identifier.
Same as above, but for last character. For
GROUP,
ENVIRONMENT, or
COMMAND nodes, this will be the first character of the closing identifier.
Same as getNodeStartingPosition, but for
GROUP,
ENVIRONMENT, or
COMMAND nodes, this returns the first character of the opening identifier.
Same as getNodeEndingPosition, but for
GROUP,
ENVIRONMENT, or
COMMAND nodes, this returns the last character of the closing identifier.
This applies to any node type. It is
1 if the node sets, or is contained within, a math mode region.
0 otherwise.
TEXT nodes which have this flag as
1 can be assumed to be the actual mathematics contained in the document.
This applies only to
TEXT nodes. It is
1 if the node is non-math and is visible (in other words, will end up being a part of the output document). One would only want to index
TEXT nodes with this property, for information retrieval purposes.
This applies only to
ENVIRONMENT nodes. Returns what class of environment the node represents (the
X in
\begin{X} and
\end{X}).
This applies only to
COMMAND nodes. Returns the name of the command (the
X in
\X{...}).
This applies only to
COMMAND,
ENVIRONMENT, and
GROUP nodes: it returns the
LaTeX::TOM::Tree which is ``under'' the calling node.
This applies only to
COMMAND,
ENVIRONMENT, and
GROUP nodes: it returns the first node from the first level of the child subtree.
Same as above, but for the last node of the first level.
Return the prior node on the same level of the tree.
Same as above, but for following node.
Get the parent node of this node in the tree.
This is an interesting function, and kind of a hack because of the way the parser makes the current tree. Basically it will give you the next sibling that is a
GROUP node, until it either hits the end of the tree level, a
TEXT node which doesn't match
/^\s*$/, or a
COMMAND node.
This is useful for finding all
GROUPed parameters after a
COMMAND node (see comments for
GROUP in the
COMPONENTS /
LaTeX::TOM::Node section). You can just have a while loop that calls this method until it gets
undef, and you'll know you've found all the parameters to a command.
Note: this may be bad, but
TEXT Nodes matching
/^\s*\[[0-9]+\]$/ (optional parameter groups) are treated as if they were 'blank'.
Due to the lack of tree-modification methods, currently this module is mostly useful for minor modifications to the parsed document, for instance, altering the text of
TEXT nodes but not deleting the nodes. Of course, the user can still do this by breaking abstraction and directly modifying the Tree.
Also note that the parsing is not complete. This module was not written with the intention of being able to produce output documents the way ``latex'' does. The intent was instead to be able to analyze and modify the document on a logical level with regards to the content; it doesn't care about the document formatting and outputting side of TeX/LaTeX.
There is much work still to be done. See the TODO list in the TOM.pm source.
Probably plenty. However, this module has performed fairly well on a set of ~1000 research publications from the Computing Research Repository, so I deemed it ``good enough'' to use for purposes similar to mine.
Please let the maintainer know of parser errors if you discover any.
Thanks to (in order of appearance) who have contributed valuable suggestions and patches:
Otakar Smrz Moritz Lenz James Bowlin Jesse S. Bangs
Written by Aaron Krowne <akrowne@vt.edu>
Maintained by Steven Schubiger <schubiger@cpan.org>
This program is free software; you may redistribute it and/or modify it under the same terms as Perl itself.
See | http://search.cpan.org/~schubiger/LaTeX-TOM-1.03_03/lib/LaTeX/TOM.pm | CC-MAIN-2017-09 | refinedweb | 1,846 | 64 |
.NET Controls: The Print Dialog Box
Introduction
Another operation users perform on a file is to print it. Printing is the ability to render, on paper, the result of a control's
content or the contents of various controls..
To provide the users with the ability to customize printing through the Print
dialog box, you can add a
PrintDialog object
from the Toolbox to your form. The PrintDialog control is implemented through
the PrintDialog class of the System.Windows.Forms namespace. To present
it to the user, you can call its ShowDialog() method.
The Document to Printing
In order to print, the Print dialog box must be given a document to print. This
means that you must first prepare a document prior to printing. To support this,
the .NET Framework provides the PrintDocument class. The PrintDocument
class is defined in the System.Drawing.Printing namespace. This class is
represented in the Toolbox by the PrintDocument button. Based on this, to
prepare a document for printing, you can either add a PrintDocument object to
your project or declare a variable of type PrintDocument. This is a small
but very useful class that you can use to fully prepare a document.
A document.
To actually print the document, you can call the PrintDocument.Print()
method. Its syntax is:
public void Print();
When this method is called, the printing process would start by firing the BeginPrint
event but this event occurs before the first page is printed. The BeginPrint
event is of type PrintEventArgs which doesn list sometimes this
this characteristic. If you are writing an application for a special company used clicks OK, a dialog box would come up, asking the user to
specify the location and a name for the new file that will be created: range of pages to print.
All these options are usually left up to the user. On the other hand, if you
want to specify the range of pages to print, you can use the PrinterSettings.FromPage
and the ToPage properties. If you
you or the user sets this number to value higher than 1, then the printed papers
can be collated or not. This is specified using the Collate check box. If you
want to programmatically collate the pages or not, change the Boolean value of
the Collate property. | http://www.functionx.com/vcnet/controls/print.htm | CC-MAIN-2015-40 | refinedweb | 384 | 63.29 |
A full-screen, console-based Python debugger
Project description.
Here’s a screenshot:
You may watch a screencast, too.
Features
- Syntax-highlighted source, the stack, breakpoints and variables are all visible at once and continuously updated. This helps you be more aware of what’s going on in your program. Variable displays can be expanded, collapsed and have various customization options.
- Simple, keyboard-based navigation using single keystrokes makes debugging quick and easy. PuDB understands cursor-keys and Vi shortcuts for navigation. Other keys are inspired by the corresponding pdb commands.
- Use search to find relevant source code, or use “m” to invoke the module browser that shows loaded modules, lets you load new ones and reload existing ones.
- Breakpoints can be set just by pointing at a source line and hitting “b” and then edited visually in the breakpoints window. Or hit “t” to run to the line under the cursor.
- Drop to a Python shell in the current environment by pressing “!”.
- PuDB places special emphasis on exception handling. A post-mortem mode makes it easy to retrace a crashing program’s last steps.
- IPython integration (see wiki)
- Should work with Python 2.4 and newer, including Python 3.
Installing
Install PuDB using the command:
pip install pudb
If you are using Python 2.5, PuDB version 2013.5.1 is the last version to support that version of Python. urwid 1.1.1 works with Python 2.5, newer versions do not.
Getting Started
To start debugging, simply insert:
from pudb import set_trace; set_trace()
A shorter alternative to this is:
import pudb; pu.db
Or, if pudb is already imported, just this will suffice:
pu.db
Insert either of these snippets).
Q: I killed PuDB and now my terminal is broken. How do I fix it?
A: Type the reset command (even if you cannot see what you are typing, it should work). If this happens on a regular basis, please report it as a bug.
Project details
Release history Release notifications
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages. | https://pypi.org/project/pudb/2015.1/ | CC-MAIN-2018-39 | refinedweb | 355 | 68.57 |
Experiences with Linux and more… an initiative by Geetu R. Vaswani. Knowledge not shared, benefits no one
If you use Eclipse IDE for Java development, you will find that there is a great GUI builder from Google, and it worked very well on previous releases of Ubuntu.
Unfortunately, Eclipse just freezes when you use Windows Builder on 64 bit Ubuntu 14.04 LTS. Several posts on the Internet suggest installing Oracle Java 7 . . . → Read More: Window Builder Pro hangs in Eclipse Luna on Ubuntu 14.04 LTS
Below code segment shows how to use a JDialog to refer to a parent frame. MyApp.java
public class MyApp { JDialog dialog; JFrame parentFrame; public static void main(String[] args) { MyApp app = new MyApp(); app.gui(); } public void gui() { //The parentFrame parentFrame = new JFrame(); parentFrame = setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); //The dialog dialog = . . . → Read More: How to make a form refer to the parent frame using a JDial.
At times, we need to show quick messages in a small window on screen to users in Java. Here is a quick way to do this.
import javax.swing.JOptionPane JOptionPane.showMessageDialog(null, “This is my Message Dialog”);
If you have a JTable in Java created with an AbstractTableModel, you can read the data from it, using following:
int rowCount = testTable.getRowCount(); for (int i = 0; i < rowCount; i++) { String mColumn1 = (String) testTable.getModel().getValueAt(i, 0); String mColumn2 = (String) testTable.getModel().getValueAt(i, 1); }
Alternatively, you could also try where the JTable . . . → Read More: Read data from a JTable created from AbstractTableModel
I created a small Java class to accept a date. However, when I tried to use it, I got a NullPointerException error. This post is just to illustrate how it was fixed.
1 public class DateForm { 2 JFormattedTextField txtMyDate; //This is a variable at class level 3 4 dateForm () { 5 JTextFormattedField txtMyDate . . . → Read More: Java program bug due to multiple declaration of variable in code and the fix
If
After a struggle, managed to figure out that the MessageFormat is not that complicated at all. All I wanted was to print a heading on each page of the JTable with the current date in it. The heading was to read “Report as on ” + today’s date.
Here is how I accomplished the task. . . . → Read More: How to print a date in the default JTable.print() header and setup the page
Many of us use a text editor to edit program code. The simplest and clean edit is GEdit on the Gnome desktop. However, if you are not on the Gnome desktop, you may miss it. You can use JEdit which is much more powerful, however, by default, it does not open multiple programs alongside each . . . → Read More: How to open multiple buffers in JEdit like in GEdit or Mousepad | http://www.askmeaboutlinux.com/?tag=java&paged=2 | CC-MAIN-2019-39 | refinedweb | 465 | 64.91 |
latest 1.1.864 | nixie project | matrix
Power it Up
This is the power related pins. The servo pins are in two banks. You can isolate 3 power sources.
The power can be attached to :
Jumper allow you to combine the power sources - so that you only need one power source to power everything. Sometimes with power isolation, you can protect or keep signals clean. The pins and jumpers allow you flexability.
Since I'll just be doing diagnostics and software, I'll be shorting the VL jumper and running it all on a single PSU 5V line.
The original configuration did not have a jumper on VS VL - so I added one. In the picture below, its the jumper with the red square around it.
Connect USB
Connect the usb cable. Its a FTDI chip at the core ... good old serial over usb.
Communication
It's all about communication. The ssc-32u has an interesting way to set the baud rate.
For a 180 degree servo:
Thank you Grog. An example for starting your servos on power up:
The below serial.write command will postion the servos on pins 0, 1, and 2 to the positions they should be to begin. This will initialise the servos and prep them for operation. Remember to change the position values to what your servos need to be set at.
serial = Runtime.start("serial","Serial")
serial.connect("/dev/ttyUSB0", 115200, 8, 1, 0)
serial.write("#0P800 #1P1500 #2P1100 \r")
Once the servos have been initialised and set to their starting positions, you can then give more detailed commands to the servo controller, such as speed or timing if commanding a group of servos on a single line.
This will help to prevent any major jumps in the servos that could possibly damage them.
# = pin/channel to which the servo is connected (0 - 31)
P = desired pulse width (position) (normally 500 to 2500) in microseconds
S = servo movement speed in microseconds per second
T = time in microseconds to travel from the current position to the desired position. This affects all servos in a group, so they all reach their desired positions at the same time. Handy for group movements such as walking.
\r = carriage return
PO = Position Offset - You have your servo attached and ready to go, but you find what should be center, e.g. 1500... is not exactly center... you can set the PO for that servo to center it at the beginning of your script and for the duration the controller is powered it will remember that to center that servo when the position 1500 is used, it should be offset be however many degrees, up to about 15 degrees.
References :
#file : Ssc32UsbServoController.py edit raw
import org.myrobotlab.service.Serial as Serial port = "COM12" ssc = runtime.start("ssc", "Ssc32UsbServoController") # connect to port with "default" 9600 # ssc.connect(port) # you can change baud rate with instructions here # # i changed my baud rate to 115200 ssc.connect(port, Serial.BAUD_115200) #grab serial if you want serial = ssc.getSerial() # make a servo servo = runtime.start("servo", "Servo") # set its pin servo.setPin(27) # attach a servo ! ssc.attach(servo) # servo.setVelocity(10) # move it around servo.moveTo(0) sleep(1) servo.moveTo(90) sleep(1) servo.moveTo(180) sleep(1) servo.moveTo(10) sleep(1) # disable it servo.disable() # try to move it - it wont move servo.moveTo(180) sleep(1) # re-enable it - it should move now servo.enable() servo.moveTo(10) sleep(1) servo.moveTo(160) # detach it ssc.detach(servo)
In the same
In the same idea...
Do you have that one Dom ?
Do you have that one Dom ?
No sorry. When i start
No sorry.
When i start InMoov, i would like use it.
But after reflection arduino was easier because well integrated MRL.
Dom.
Something else to order.
Something else to order. Thanks for sharing that link.
#!/usr/bin/python # Import
#!/usr/bin/python
# Import the Serial module
import serial;
EOL = "\r";
command = "";
# Set the SSC-32 port - e.g. "COM1:" for Windows, "/dev/ttyS0" for Linux
SSC32_Port = "/dev/ttyUSB0";
ServoOne = 0;
ServoOneStop = 1520;
ServoTwo = 1;
ServoTwoStop = 1525;
ServoThree = 2;
ServoThreeCenter = 1530;
ServoThreeMin = 2150;
ServoThreeMax = 900;
ServoFour = 3;
ServoFourCenter = 1430;
ServoFourMin = 500;
ServoFourMax = 1550;
# Reads single characters until a CR is read
def Response (port):
ich = "";
resp = "";
while (ich <> '\r'):
ich = port.read(1);
if (ich <> '\r'):
resp = resp + ich;
return resp;
# Wait for a servo move to be completed
def Wait_for_Servos (port):
ich = "";
while (ich <> "."):
Send_Command (port, "Q", True);
ich = port.read(1);
return;
# Send EOL to the SSC-32 to start a command executing
def Send_EOL (port):
result = port.write(EOL);
return result;
# Send a command to the SSC-32 with or without an EOL
def Send_Command (port, cmd, sendeol):
result = port.write (cmd);
if (sendeol):
Send_EOL (port);
return result;
# Open the port at configured Bps - defaults to 8N1
ssc32 = serial.Serial(SSC32_Port, 9600);
# Motors All Stop - Left = Ch0, Right = Ch1
command = "#" + str(ServoOne) + " P" + str(ServoOneStop) + " #" + str(ServoTwo) + " P" + str(ServoTwoStop);
Send_Command (ssc32, command, True);
Wait_for_Servos (ssc32);
# Home the PING Pan/Tilt Base
command = "#" + str(ServoThree) + " P" + str(ServoThreeCenter) + " #" + str(ServoFour) + " P" + str(ServoFourCenter);
Send_Command (ssc32, command, True);
Wait_for_Servos (ssc32);
# Send the version command
command = "ver";
Send_Command (ssc32, command, False);
Send_EOL (ssc32);
# Read the response
inp = Response(ssc32);
# Show what we got back
print inp;
command = "#" + str(ServoThree) + "P1900" + "#" + str(ServoFour) + "P1300 T5000"
Send_Command (ssc32, command, True);
Wait_for_Servos (ssc32);
# Close the port
ssc32.close(); | http://myrobotlab.org/service/Ssc32UsbServoController | CC-MAIN-2022-33 | refinedweb | 909 | 58.38 |
Hi java beginner here.
Im pretty sure there will be a simple solution to this. I am trying to
this is the task
2.1 Stone
Define a constructor for class Stone that reads input from the user and initialises the name and
weight fields according to the following I/O (bold text indicates sample user input):
Page 3
Programming Fundamentals (48023) Autumn 2013 Assignment 1
Enter stone name: Diamond
Enter stone weight: 12
here is my code
import java.util.Scanner;
public class Stone
{
String name;
int weight;
Stone()
{
Scanner keyboard = new Scanner(System.in);
System.out.print("Enter stone name: ");
String name = Global.keyboard.nextLine();
System.out.print("Enter stone weight: ");
int weight = Global.keyboard.nextInt();
//Global.keyboard.nextInt();
}
}
this is what i get when submitting to online marking system
% java TestMethods +Stone Diamond 12 @name @weight +Stone Gem 7 @name @weight
== Benchmark program's output == | == Your program's output ==
rand_seed = 24069 rand_seed = 24069
$ stone = new Stone() $ stone = new Stone()
Enter stone name: Diamond Enter stone name: Diamond
Enter stone weight: 12 Enter stone weight: 12
$ stone.name -> "Diamond" | $ stone.name -> null
$ stone.weight -> 12 | $ stone.weight -> 0
$ stone = new Stone() $ stone = new Stone()
Enter stone name: Gem | Enter stone name: Enter stone weight: Gem
Enter stone weight: 7 | java.util.InputMismatchException
$ stone.name -> "Gem" | at java.util.Scanner.throwFor(Scanner.java:840)
$ stone.weight -> 7 | at java.util.Scanner.next(Scanner.java:1461)
> at java.util.Scanner.nextInt(Scanner.java:2091)
> at java.util.Scanner.nextInt(Scanner.java:2050)
> at Scanner.nextInt(Scanner.java:57)
> at Stone.<init>(Stone.java:13)
> at sun.reflect.NativeConstructorAccessorImpl.newInsta nce0(Na
> at sun.reflect.NativeConstructorAccessorImpl.newInsta nce(Nat
> at sun.reflect.DelegatingConstructorAccessorImpl.newI nstance
> at java.lang.reflect.Constructor.newInstance(Construc tor.jav
> at Invoker.create(Invoker.java:23)
> at TestMethods.main(TestMethods.java:53)
The left column shows the correct output. The right column shows your own
program's output. Examine the sequence of steps line by line to see where
your program went wrong.
Between the two columns, you may find a marker symbol:
* The '|' symbol identifies lines that are different.
* The '<' symbol points to lines in the left column that are not in the right column.
* The '>' symbol points to lines in the right column that are not in the left column.
You can click on any error message highlighted in blue, and this will open up
a web page explaining the error message.
any ideas what i am doing wrong? | http://www.javaprogrammingforums.com/%20whats-wrong-my-code/26813-defining-constructor-scanner-printingthethread.html | CC-MAIN-2017-39 | refinedweb | 414 | 52.56 |
This is my 'recipe' for setting up a minecraft server on a raspberry pi. I used information I found in the following pages to setup my minecraft server,,,.
Setting up the Pi
I amend the Pi config through raspi-config to give it the most amount of memory and overclock it.
sudo raspi-config
Options:
- Overclock, Ok, Medium, Ok
- Advanced Options, Memory Split, Change to 16, Ok
Choose Yes to reboot
Static IP address
This isn't essential but I find it a lot easier to manage the minecraft pi server if its got a static IP address; its easier to connect to as the IP address never changes and if you want to make it public it makes port forwarding simpler too.
See this post for details on how to give your Raspberry Pi a static IP address.
Install Java
Java isn't installed on the Pi, so this is the first step:
cd ~
wget --no-check-certificate
mkdir -p /opt
sudo tar zxvf jdk-8-ea-b102-linux-arm-vfp-hflt-07_aug_2013.tar.gz -C /opt
wget --no-check-certificate
mkdir -p /opt
sudo tar zxvf jdk-8-ea-b102-linux-arm-vfp-hflt-07_aug_2013.tar.gz -C /opt
Check java is installed properly by running:
sudo /opt/jdk1.8.0/bin/java -version
If it hasn't returned an error, so far so good.
Install Minecraft Server
I installed the bukkit server variant, spigot, I found it to be the best for reliability and performance on the Pi.
Note (29/12/2014) - Unfortunately spigot is no longer available to directly download. The jar needs to be built yourself, instructions for doing so on a Windows or Linux PC are here.
mkdir minecraft_server
cd minecraft_server
wget
cd minecraft_server
wget
Run Minecraft Server
To run the minecraft server I create a bash script called start.sh:
nano start.sh
Cut and paste the following command into the start.sh file
/opt/jdk1.8.0/bin/java -Xms256M -Xmx496M -jar /home/pi/minecraft_server/spigot.jar nogui
Note - I never got the minecraft server working reliably on a 256 meg Raspberry Pi, you may have better results that me though, so if you have a 256 meg Pi use the following command instead of the one above.
/opt/jdk1.8.0/bin/java -Xms128M -Xmx256M -jar /home/pi/minecraft_server/spigot.jar nogui
Ctrl X to save
Make the script executable
chmod +x start.sh
Start-up the server
./start.sh
The first time the server runs it will install the server from the spigot.jar file and create the world. This is going to take a little while the first time, but the next time it starts up, it will be much quicker.
Once it has finished and displayed the message Done, stop the server so it be can configured.
To stop the server type the command:
stop
Configuring the Server
As part of the install process a file called server.properties will be created in the ~/minecraft-server directory, this holds the key configuration for how the server runs. See this page for full details on the server.properties configuration file.
The most important setting you need to change is the view-distance, when set to the default of 10, I found that the server was very unstable and prone to crashing.
nano server.properties
These are the common flags I change:
allow-flight=false - change to true if you want to allow users to fly
gamemode=0 - change to 1 if you want to have creative mode, rather than survival
max-players=20 - 20 maybe too much for the Pi to handle, I set a maximum of 5
spawn-monsters=true - set to false to turn off monsters
spawn-animals=true - set to false to turn off animals
view-distance=10 - this is the distance in chunks the player can see, I set this value to 4, to reduce load on the Pi
motd=A Minecraft Server - "message of the day", is displayed when people join the server
Ctrl X to save
In order to change the view-distance, you also need to modify the spigot.yml file:
nano spigot.yml
Scroll down till you find:
world-setting:
default:
view-distance: 10
default:
view-distance: 10
Modify this value to your new view-distance.
Ctrl X to save
Installing plugins
I use 2 plugins on my server, NoSpawnChunks to improve performance and Raspberry Juice which allows you to run programs created using the Minecraft: Pi Edition api on your Minecraft server.
cd ~/minecraft_server/plugins
wget
wget
wget
wget
Start up the Server
Its time to start up the server and give yourself 'op', making yourself the operator, you leave your server open if there is no operator
cd ~/minecraft_server
./start.sh
./start.sh
Once the server has started up and reported "Done", you can give yourself 'op' by typing the following command:
op <yourusername>
e.g. op martinohanlon (but don't give me op - I can't be trusted!)
Your done, your server is running, you can login from minecraft using the address <ipofyourpi>:25565
Using screen to Run the Server
One of the problems with this setup so far, is if you started up the server directly on the Pi, you now cant do anything else with it, or if you have started it up over SSH you can't disconnect otherwise the server will stop. I use a utility called 'screen' to open multiple terminal sessions, which you can 'detached' from and they keep on running even when you disconnect.
Install screen
sudo apt-get install screen
To use screen, just type:
screen
This opens a new terminal window in a terminal window, cool eh! Anything you run in this screen is separate from you main terminal, you can exit screen using the exit command, or you can detached the screen using Ctrl A, then D, which takes you back to your original terminal window but leaves the screen running.
See this page for a Tutorial on how to use screen.
You can then view all the detached screens by using the command:
screen -ls
Which will show you information like this:
There are screens on:
3158.pts-0.minepi (03/09/13 22:08:32) (Detached)
3064.pts-0.minepi (03/09/13 22:04:05) (Attached)
2 Sockets in /var/run/screen/S-pi.
3158.pts-0.minepi (03/09/13 22:08:32) (Detached)
3064.pts-0.minepi (03/09/13 22:04:05) (Attached)
2 Sockets in /var/run/screen/S-pi.
Showing there are 2 screens running at the moment, to reconnect to a screen type, screen -r <name of screen>:
screen -r 3064.pts-0.minepi
Open a new screen, run ~/minecraft-server/start.sh and use Ctrl A, then D to detach and your minecraft server will be running in the background
screen
~/minecraft-server/start.sh
Ctrl A, D
~/minecraft-server/start.sh
Ctrl A, D
Running Minecraft:Pi Edition programs
I setup my minecraft server originally to show people what you could do with the Minecraft: Pi edition's API, , even though the raspberry juice plugin doesn't support all of the API functions, you can run most of the same programs on your server as you would on the minecraft Pi edition. If you want to try it out, the minecraft clock I created works really well. Startup the server, download the code and run it.
sudo apt-get install git-core
cd ~
git clone
cd minecraft-clock
python minecraft-clock.py
cd ~
git clone
cd minecraft-clock
python minecraft-clock.py
I've gone on that server quite a lot... No one is ever on :(
O dear, pass on the address if ypu want that way people will be.
If you want me to run one of your programs on it just let me know.
My programs?? That would be cool... I don't know, but can you program plugins? Or is possible to make it so when you go onto a certain spot, it would start my arena game... I might re write it for that! Thanks :) I'll see what I can do.
Mind if you used my world? Cause the world your server has is kinda rough. This one is in the plains, and I made a "machine" that starts the program. You'll have to run the script first though.
World:
Script:
Thanks! When you press the button, it will randomly choose between the Arena game, and Dodgegame.
I see you generated a giant Raspberry Pi.
I did, I wrote a program which converts 3d models (obj files) into minecraft
I guess you made it so it runs that program in a loop.
Just had a look through your program Nicholas. Ill update the server at some point this week to run your program.
However, one piece of advice, comments in code are a great thing. They are really useful in describing why your code is doing what its doing, not only for other people, but for yourself looking back at why you did something. I really struggled to work out what your program was doing.
Okay, I've updated the file with high scores, and comments all over. :) You can use the same download link.
well check you out.. That is much better, thank you
i just tryed to join but it wouldn't let me. any help
Sorry dude, pi was momentarily off due to knackered power supply, back online now.
Thanks you for the tutorial. For some reason the minecraft pi application on the desktop can't find the pi minecraft server. Any suggestions?
Hi,
I would like to know if with this procedure I can connect the minecraft pi edition to the the spigot.jar server .
Thx!
No worry, spigot is a server for the full version of minecraft not the pi edition.
Martin, I'm getting an error when I try to check to see that the Java server is running properly using the following command line you included in your instructions:
sudo /opt/jdk1.8.0/bin/java -version
...btw, the error message is as follows
sudo: /opt/jdk1.8.0/bin/java: command not found
I suspect java hasnt been installed properly / at all, if your using a newer version of raspbian java may already be installed type "java -version" to see. Its an older version 1.7 but it should be ok.
This Happened to me, make sure you did -C when you ran tar otherwise it will be extracted to who knows where not /opt.
Thanks for the insight
JAVA is included in the new 2013-09-25-wheezy-raspbian.zip which gives me some headegg
The solution was to type: sudo java -Xms256M -Xmx496M -jar /home/pi/spigot.jar nogui
If anyone know how to make the Pi launch the ./Start.sh – when the Pi is restarting or booting – I would like your help :o)
I set up a server for my son. After 2 days of screwing with this I have a scheme that works. I am sure there is a better method, but this worked for me ....
Simple short answer: use -d -m options for screen.
Longer explanation: I put a script in /etc/init.d called mcstart.sh
It had the following code:
#!/bin/bash
sudo echo hello3 > /home/pi/debug.txt
screen -d -m /home/pi/mc.sh
The second line was debugging so I could look at the file 'debug.txt and see that my script had indeed run.
While in the /etc/init.d directory I did the following command, because my script was never being run.
sudo update-rc.d mcstart.sh defaults
Now in the /home/pi directory the file mc.sh had:
#!/bin/sh
cd /
sudo /opt/jdk1.8.0/bin/java -Xms256M -Xmx496M -jar /home/pi/spigot.jar nogui
For some reason if I was not in the root (aka / ) directory, the process would hang when dealing with the plugins. Why no clue. Is this the best, no, but it works and I can go onto something else, and my son can have fun. ... Oh wait now I have to configure the external access...
There is a tutorial for running a program at startup using init.d here
gzip: stdin: unexpected end of file
tar: Unexpected EOF in archive
tar: Unexpected EOF in archive
tar: Error is not recoverable: exiting now
This is what i get when i try to install java. Some please help me!
I suspect the java install file hasnt been downloaded properly / at all. Is you Pi connected to the internet? Try deleting the file with rm ~/zxvf jdk-8-ea-b102-linux-arm-vfp-hflt-07_aug_2013.tar.gz and starting "Install Java" again.
Alternatively if your using a recent version of raspbian you may already java installed, type "java -version", if it comes back with a version number, it is. Its an older version 1.7, rather than 1.8 but I doubt it will matter.
Thank you so much Martin!!!
Martin i got another error when trying to type ./start.sh it says this: Error: Unable to access jarfile /home/pi/spigot.jar
Please help me some one :(
Nevermind, i got my server up and running :)
I also get this error how do you resolve?
Hi Olly, Which error are you getting?
I am getting the error "Unable to access jarfile /home/pi/spigot.jar"
Thanks for prompt reply
Would you look at that! There was an error in my post.. It should have read:
/opt/jdk1.8.0/bin/java -Xms256M -Xmx496M -jar /home/pi/minecraft_server/spigot.jar nogui
Edit your start.sh file with nano to include the correct path of /home/pi/minecraft_server/spigot.jar rather than /home/pi/spigot.jar
wow i thought i was the only fool playing with this lol...
i've got a better startup script if you all would like it lol Place this in your /etc/init.d/ folder and make sure to sudo nano /etc/init.d/minecraft and change the MCPATH= (to your spigot.jar dir) also you can set your maxheap and minheap and lots more.... then you can use, sudo service minecraft start/stop/backup/update......read the log script for all it does...but note you will need to update the info for UPDATE and BACKUP if you want to use them..enjoy guys. also my server is kicker22004.no-ip.biz:25567 if it kicks you relog in...poor pi working hard lol
Now that java (1.7) is included in raspbian, any thoughts on which version is better for minecraft?
No thoughts on which would be better, sorry... Presumably there are some improvements in 1.8 over 1.7, BUT, I wouldn't worry about it.
Tried 1.8 (build 128) and that actually seems a little better
Good to know!
First, thank you for this. It really helped me get Minecraft working with our Pi. What we want to do is run a multiplayer server with Raspberry Juice so friends can come together to run scripts they have created in Python. I can't figure out how to give anyone else access to running scripts other than me SSH'd into our own pi. Is there a way? Please help - we are very confused! Thank you!
Multiple people can connect to the minecraft server and the raspberry juice plugin. Its pretty simple, when you create the connection to minecraft in your python program with mc = minecraft.Minecraft.create() just put the IP address of your server in i.e. mc = minecraft.Minecraft.create("192.168.1.99") where "192.168.1.99" is the address of your pi.
Thank you for this... I am further ahead, but still not quite there. I didn't realize you had to enter the server info in the code, so that is a huge help. I apologize but I am trying to figure this out to help a group of children who want to use this to learn to code Python.... Our setup is that we have a Pi, and Spigot with Raspberry Juice working and the server is running. What we hope to be able to do is connect with regular Windows PCs and run scripts on the Spigot server on the Pi. I do have Python 2 and have the tnt snake script ready to try with our IP/port, and the port is set to 4711 and is open.
Where I am stalled is if I am on a Windows computer with my saved .py script how do I run it to execute on the server? When I ran it here I got the following error:
import mcpi.minecraft as minecraft
ImportError: No module named mcpi.minecraft
This happens when it tries to import the minecraft.py module from the minecraft directory. Is there any way to accomplish this with the setup we have? It seems that we are missing a pretty big step somewhere... ?? Thank you again so much!
Hi,
You dont have to execute your script on the server, you can execute it from the PC, but you will need the mcpi folder which contains the minecraft.py file.
So on your PC, create your myprogram.py program in a folder which also has the mcpi folder in it.
When you call mc = minecraft.Minecraft.create()
use mc.minecraft.Minecraft.create("192.168.1.99")
passing the IP address of the Pi rather than "192.168.1.99". It might also be worth looking at RaspberryJuice1.3 which has an upgrade to allow multiplayer support so you can do
mc = minecraft.Minecraft.create("ipaddress", 4711, playername)
that way you can specify which player you want to use.
This comment has been removed by a blog administrator.
This comment has been removed by a blog administrator.
Hi, this is a great tutorial and I did pretty much everything step by step and my server works great for me. The problem is that whenever one of my friends try to find the server, they cant log on. Any ideas? Thanks
Are you friends accessing from outside your network, i.e. Over the internet?
Have you forwarded port 25565 on your router to point to your Pi?
Yes, they are trying to access outside of my network. I'm not sure what you mean by forwarding the port. Im pretty basic with my knowledge of programming and routers and that stuff. Thanks for replying so quickly!
In order for people to connect to your server over the internet you need to tell your router where to send the traffic, this is port forwarding, check put portforward.com they have guides for most routers.
You will also need to know your external ip address, this is the address you have on the internet, your router will also be able to tell you this, but if you google 'external ip address' it will come up.
When you have done this, you friends should be able to connect to externalip:25565.
Thanks so much, I will try it out and let you know
When I googled my external IP address, it came up like this:
2602:304:b3f3:6c49:85b4:6fd3:35b4:a14d
I also attempted to make the Pi's IP address static with the link you included earlier and now my computer wont connect through Putty
I have it setup successfully on my local network, but I can't get it where other people from other networks can join. I have a Belkin N150 router and a static IP on the Pi. I've gone into the router settings and enabled 25565 on both TCP UDP and added my Pi's static IP. I've tested the port and for TCP it says "Your port is open on another device." I've given some friends the IP (example: 192.168.2.8:25565) and they are unable to join. I'm baffled. I've also tried setting the server IP in the server.properties file on the Pi. I don't know what else to do. Please help.
Thanks
You need to give your friends your internet ip address, not the local ip address of your pi. When your friends connect they need the ip address that your router has on the internet, your router will then forward this traffic to the internal ip address of your pi. Hope that makes sense.
You might also want to sign up for a noip account or similar as your internet ip address changes from time to time see this link for info
whenever I try to get on to minecraft it just says'* failed to add service - already in use?' can you help?
Do you mean when you try and connect to the server from Minecraft you get the error? Its not one I've seen before. If you can offer any more information that might help.
I might be able to help... Where are you getting this? When you try to join the RPi server?
Don't worry Iv'e sorted it out, the memory split was to low but how do you actually get onto the server where do you type ':25565' do you type it into the terminal? please reply.
Load up Minecraft on your PC, go Multiplayer, pick Direct Connect and enter the IP address of your Pi + ":25565" e.g. 192.168.1.10:25565. You can find out the IP address of your Pi, by entering ifconfig in the terminal.
how do you get on multiplayer? it just says start game or join game on my start screen do i click join game?
This sets up a minecraft server for the pc version of minecraft not the pi version.
oh so i cant connect to other people with pi's is this only for if you want to connect your pi to a pc because I dont have Pc minecraft
i keep getting a screen saying permission denied help please
You should probably use 'sudo' before the command to run the server.
Some more information would be useful. What are you doing when you get 'permission denied'?
Nicholas is right tho, you could just be missing a sudo at the start of the command.
This comment has been removed by the author.
We have been running the Minecraft server (Spigot) on our pi for a while now. We would like to start programming with the API. Do we have to install Minecraft PI edition? Should I get a second memory card or just install along with the spigot server?
Thank you for all of hte information, videos etc. My 9 year old is really excited to start programming!
You should be able to install it on the same sd card, but you will have to the Memory Split on the Pi back to the default, as the Minecraft:Pi Edition will need the video memory to run.
Thank you. I managed to get it going. Now if only I could run it via SSH from my notebook. Haha.
This is an error I get when I start it :Error: Unable to access jarfile /home/pi/minecraft_server/spigot.jar
Did the spigot.jar file download properly? Have you looked in the /home/pi/minecraft_server directory? Is it in there?
ok it took me awhile to do it and i finally did it so im just trying to come up w an ip
This comment has been removed by the author.
nevermind of the ip its just that when i login to the server it gives me another error "Connection Lost Java read timed out" and when i check my rpi it says a bunch errors and ends the server. Help if you can.
What are the errors? Did you get the viewdistance in server.properties and spigot.yml? I found the server crashed if the view distance was too high.
I don't really know cause there are like 20 of em. I will check the veiw distance to make sure
Also when I try to restart instead it just stops the server.
please help am getting this error when trying to run the start file
./start.sh: 1: ./start.sh: /opt/jdk1.8.0/bin/java: not found
./start.sh: 2: ./start.sh: /home/pi/minecraft_server/spigot.jar: Permission denied
The error suggests java didnt download or extract properly. Re-run the Install Java commands and see if you get an errors.
I'm about to get a pi of my own, and I was wondering what the limitations are here. Do you think I could, say, create my own mobs and code them in, as well as my own items and their effects on the world? This would stimulate a loott of ideas haha.
Spigot seems to be unavailable now
I know, it has put something of a spanner in the works of Raspberry Pi hosted minecraft servers. If you look around though Im sure you will find a copy of spigot from other sources.
Can i use your instructions to create a setup whereby people with full minecraft and me wth the pi version can play together. Also can I use python scripts if this is possible?
Hi Bruce, unfortunately you cant mix editions of Minecraft. The PC version wont play with the Pi version, which wont play with the xbox version, etc. You can however use python scripts on the full version of minecraft if you use the RaspberryJuice plugin on either a Canarymod or Bukkit server.
When I run start.sh I get an error "invalid or corrupt jarfile .../spigot.jar
I've delted and downloaded a couple of times, checked start.sh file, etc. no joy.
Any thoughts?
Nevermind. I see that spigot is not available.
Spot on. I should up this post really!
You can get your hands on spigot you just need to build it yourself. If you have a Windows or Linux PC its pretty easy. See
I have a raspberry pi 2, How long is the buildtools supposed to take?
I must admit I don't know. I always use an i5 laptop it takes about 10 mins on that. I would say considerably longer.
==================
BUILD FAILURE
==================
So what do I do?
How would take the buildtools finished on my windows and export it to a raspberry pi running raspbian? I am confused!
I would post your build error on the spigot forums, they will be able to help you.
Hello! I'm following these instruction on a windows 7 computer and my goal is to run a minecraft server in which I can run python code and examples from "Adventures in Minecraft" for the kids in my Tech Lab. Anyway, I keep getting hung up on the instructions here, as they're written for Linux and the raspberry Pi. I would just like to suggest tips be written for those who are doing set up on Windows (and perhaps mac as well). For example, I just spent about 2.5 hours trying to translate the instructions in the "Run Minecraft Server" section above to instructions that would work for Windows. I learned a lot about scripts files! but didn't solve my problem. Finally, I just double-clicked on the spigot.jar file and away I went. Hints like this would make the directions a lot more accessible for noobs like me :)
Thanks for the great work! By the way, I'm documenting all of the hiccups I encounter as I try to do this in Windows and how to work around them. If this documentation would be useful to you, let me know.
Okay, it looks like I may have wanted a .bat file after all. It seems to run when it contains the following script: java -Xmx1024M -Xms1024M -jar spigot-1.8.3.jar
Hi Robin,
If your plan is to run a minecraft server on Windows it might be easier to use the 'adventures in minecraft' starter kit. There is a new one for Minecraft 1.8. Check out the forum -
You could either install and run this on every students pc, that way they would have there own world to code in.
Or if you wanted to have a single server where you all code (I wouldnt recommend it by the way, it almost always ends in chaos with everyone coding over each others stuff), each student would just need a copy of the MyAdventures folder to save their programs but when creating the connection to minecraft mc = minecraft.Minecraft.create() would need to use the IP address of the server in the 'create()' function i.e. mc = minecraft.Minecaft.create("ip.add.re.ss").
It might be worth creating a post in the "Adventures in minecraft" forum if you need help.
Hallo Martin,
probably it is wrong place to ask this question, but i would do it.
I am trying to get run Minecraft for linux on RaspPi2. I followed the way for JetsonTk () and I get even the start screen, but the buckground is still (the picture does not move) and I can't start the game.
My question: How do YOU think, is it possible to get run the full version of Minecraft on RaspPi2?
I have undertaken the same exercise and like you managed to get it to run, but I couldn't get past the main menu (see)
I just dont think the Pi 2 has anything like enough power to run the full minecraft client. You need a pretty big machines to run the latest versions of Minecraft.
Hallo Martin. Thank you for your efforts and the answer. I did this exercise on behalf of my son, now I wold try to inspire him to learn programing with Minecraft-Pi.
My best regards
Maksim
How do you add mods to the Raspberry Pi Minecraft server?
The same way you do for any Minecraft server, put them in the plugins folder. | https://www.stuffaboutcode.com/2013/09/raspberry-pi-setup-minecraft-server.html?showComment=1388853989925 | CC-MAIN-2019-18 | refinedweb | 5,002 | 82.34 |
strtok_r()
Break a string into tokens (reentrant)
Synopsis:
#include <string.h> char* strtok_r( char* s, const char* sep, char** lasts );
Arguments:
- s1
- NULL, or the string that you want to break into tokens; see below.
- s2
- A set of the characters that separate the tokens.
- lasts
- The address of a pointer to a character, which the function can use to store information necessary for it to continue scanning the same string.
Library:
libc
Use the -l c option to qcc to link against this library. This library is usually included automatically.
Description:
The function strtok_r() breaks the string s into a sequence of tokens, each of which is delimited by a character from the string pointed to by sep.
In the first call to strtok_r(), s must point to a null-terminated string, sep points to a null-terminated string of separator characters, and lasts is ignored. The strtok_r() function returns a pointer to the first character of the first token, writes a NULL character into s immediately following the returned token, and updates lasts.
In subsequent calls, s must be a NULL pointer and lasts must be unchanged from the previous call so that subsequent calls will move through the string s, returning successive tokens until no tokens remain. The separator string sep may be different from call to call. When no tokens remain in s, a NULL pointer is returned.
Returns:
A pointer to the token found, or NULL if no token was found. | https://developer.blackberry.com/playbook/native/reference/com.qnx.doc.neutrino.lib_ref/topic/s/strtok_r.html | CC-MAIN-2020-45 | refinedweb | 246 | 60.95 |
I have come across something that I think Xcode doesn’t like. While reading the chapter on numbers and making my Numbers command line app I made comments inside of the code which I can refer to easily if I want to remember the summary on numbers the code is as follows:
#include <stdio.h> #include <stdlib.h> #include <math.h> int main(int argc, const char * argv[]) { /*-------------------------- INTEGERS char a; - 8 bit integer short b; - usually 16 bit integer (depending on platform) int c; -usually 32 bit integer (depending on platform) long d; - 32 or 64 bit (depending on platform) long long e; - 64 bit If you use an 'int' integer %d prints an integer as a decimal %o prints an integer in Octal %x prints an integer in Hexadecimal %f returns a floating number If you use 'long' - Must add an l in your token %ld - long decimal %lo - long octal %lx - long hexadecimal If using 'unsigned long' %lu - prints an unsigned long integer */ printf(" 3 * 3 + 5 * 2 = %d\n", 3 * 3 + 5 * 2); printf("11 / 3.0 = %f\n", 11 / (float)3); /* Integer operations: + is addition - is subtraction / is integer devision, i.e. 11 / 3 = 3 (rounds to zero) % is modulo, returns the remainder, i.e. 11 % 3 = 2 If you want to return a floating decimal must divide the denominator using a cast operator. printf("11 / 3.0 = %f\n", 11 / (float)3); the (float) is the cast operator */ printf("The remainder of 11 / 3 is %d\n", 11 % 3); printf("The absolute value of -5 is %d\n", abs(-5)); /* Operator shorthand To increase a value by 1 we can use increment operator (++) int x = 5; x++; // now x is 6 To decrease a value by 1 we can use a decrement operator (--) int x = 5; x--; // x is now 4 If we want to increase x by more than one int = 5 x += 6 x is now 11, 5 + 6 Can read the previous line as "Assign x the value of x + 5" There is also -=, *=, /=, %= absolute value we have to use abs() and if the value is of a long we use labs() both of these functions are located in the stdlib.h */ //--------------------Floating Numbers------------------------------\\ /* floating numbers are decimals, can have various size: float g; //32 Bit double h; //64 Bit long double i; //128 Bit **Floating numbers are always signed** Common tokens are: %f - returns a standard decimal %e - returns a scientific notation Adding a value before f or e limits how many decimal places we want. Must include math.h if I want to use the math library. Trig, rounding, exponents, squares, cubes, ect... */ double y = 12345.6789; printf("y is %f\n",y); printf("y is %e\n", y); return 0; }
The problem I am encountering is Xcode won’t let me compile the code because it is reading my comments even though they have been clearly commented… It will only let me run the code if I put the ‘//’ on every line tat has some code. Is there something I’m missing or doing wrong? I have included a screen shot.
One more comment, its odd because it is only making the disruption in the Floating Numbers comments but not the Integer comments. | https://forums.bignerdranch.com/t/question-about-comments/2242 | CC-MAIN-2018-39 | refinedweb | 545 | 59.37 |
Getting started with XSLTC
Compiling XSLT
I often hear two major complaints about XSLT. The first is about its syntax, which takes a while to get used to. Coupled with its recursive nature, the chronological mind can have a hard time adjusting. In fairness, with XSLT editing tools and a bit of practice, the syntax problem can be resolved. The second complaint is on performance. A while ago I was involved in a portal project. The different boxes that make up the portal were each painted via an XSL transformation, as was the entire portal page. From the prototyping stage it became evident we had a performance problem at hand. We have been taking a variety of approaches to the problem including caching, using Java threads to distribute the transformations for each box, and experimenting with various XML and XSL parsers.
Most recently, we have been working with an XSLT compiler from Sun. Preview version 5 was released in March 2001. This tool turns an XSLT stylesheet into a Java class file called a translet. The translet can then be used in conjunction with an XML file to apply the transformations. Although the software is not in final release form, our initial results have been encouraging. Since the entire package is written in Java, it is quite portable across platforms. In fact, one of the examples is a translet converted to the Palm format to be executed within the KVM.
After you unpack the XSLTC download, move the BCEL jar file to the lib directory and add the bin directory to your path. You should also define a new environment variable called XSLT that is set to the installation directory of XSLTC. Now take your favorite XSLT file and enter the following:
xsltc foo.xsl
This should invoke either the xsltc.bat file (Windows) or the xsltc.sh (Unix). It will attempt to execute the class com.sun.xslt.compiler.XSLTC with the XSL file as its argument. After completion, you should see a file called foo.class in the same directory. You can compile directly into a jar file using the j option. This is the Translet file. You can now use the xslt command (also a batch file or a shell script) to apply the compiled XSLT file to an XML file as follows:
xslt foo.xml foo
This will cause the com.sun.xslt.runtime.DefaultRun class to be invoked, which takes an XML file and a Translet as arguments. While the XSLT compiler requires Java 2, to run the translet, you can use J2ME. Thats what the Palm sample application demonstrates.
Ideally you would want to use translets inside your Java application. All translets implement the interface com.sun.xslt.translet so you should start there. Youll see that the XML file is parsed into a DOM tree and then the transformation (specified by the translet) is applied to it (via the transform() method). The output is similar to a SAX event stream based on an implementation of com.sun.xslt.TransletOutputHandler.
XSLTC supports most of the XSLT specification. Some of the features that are not supported are namespace axis, pattern matching with id and key, and the ability to call nonstatic external Java methods. For projects struggling with XSLT performance, XSLTC may prove to be a viable option.
- Piroz Mohseni
Did you know...
The W3C has moved XML Schema to a Proposed Recommendation status via an announcement on March 16. The move is further indication of the stability of the current specification. All three parts of the specification are expected to be finalized paving the way for the long-awaited data-type validation for XML documents.
| http://www.developer.com/xml/article.php/721241/Getting-started-with-XSLTC.htm | CC-MAIN-2015-27 | refinedweb | 611 | 66.33 |
Description
Chardin.js is a jQuery plugin that creates a simple overlay to display instructions on existent elements. It is inspired by the recent Gmail new composer tour which I loved.
chardin.js alternatives and similar libraries
Based on the "Tours And Guides" category.
Alternatively, view chardin.js alternatives based on common mentions on social networks and blogs.
intro.js9.2 8.8 L2 chardin.js VS intro.jsLightweight, user-friendly onboarding tour library
driver.js8.2 1.7 chardin.js VS driver.jsA light-weight, no-dependency, vanilla JavaScript engine to drive the user's focus across the page
shepherd7.5 9.4 chardin.js VS shepherdGuide your users through a tour of your app
bootstrap-tour6.4 3.2 chardin.js VS bootstrap-tourQuick and easy product tours with Twitter Bootstrap Popovers
hopscotch6.2 0.0 L5 chardin.js VS hopscotchA framework to make it easy for developers to add product tours to their pages.
joyride4.1 0.0 L5 chardin.js VS joyridejQuery feature tour plugin.
pageguide3.3 0.0 chardin.js VS pageguideAn interactive guide for web page elements using jQuery and CSS3
tourist3.3 0.0 chardin.js VS touristSimple, flexible tours for your app
focusable3.2 0.0 L2 chardin.js VS focusable:flashlight: Set a spotlight focus on DOM element adding a overlay layer to the rest of the page
GuideChimp1.4 6.7 chardin.js VS GuideChimpCreate interactive guided product tours in minutes with the most non-technical friendly, lightweight and extendable library.
OPS - Build and Run Open Source Unikernels
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of chardin.js or a related project?
README
Chardin.js
Simple overlay instructions for your apps.
Or demo sequential stepping.
Chardin.js is a jQuery plugin that creates a simple overlay to display instructions on existent elements. It is inspired by the recent Gmail new composer tour which I loved.
Jean-Baptiste-Siméon Chardin
Installing
Simple! Fork this repo or download chardinjs.css and chardinjs.min.js and add the following assets to your HTML:
<link href="chardinjs.css" rel="stylesheet"> <script src="chardinjs.min.js"></script>
There's a
chardinjs-rails gem.
Adding data for the instructions
Add the instructions to your elements:
data-intro: Text to show with the instructions/tooltip.
data-position: (
left,
top,
right,
bottom), where to place the text with respect to the element.
In addition you can alter the relative position of the tooltip text by placing a colon and a percentage value (-100 to 100) after the position text, eg "top:-50".
This will slide the tooltip along the length or height of the element away from the centre.
If you want to increae the distance of the tooltip from the element, you can do it by placing a comma and a percentage value (100, 200, 300, 400 or 500) after the tooltip offset, eg "top:0,200". This will shift the tooltip to be twice farther away from the element than by default.
<img src="img/chardin.png" data-
You can also run Chardin in sequenced mode, where one element will be displayed at a time, moving on to the next with a mouse click (or automatically after a set delay).
Add
data-chardin-sequenced="true" entry to the body tag. Also add
data-chardin-auto="true" and
data-chardin-delay="100" for automatic movement through the elements. Delay is in milliseconds.
The default sequence is as loaded by the DOM, but this can be overridden using the tag
data-sequence with a number.
If no auto-traversal is set, clicking will move sequentially through the elements, clicking with the shift key down will move backwards through them.
<body data-
Running
Once you have your elements ready, initialise the library and assign it to a button that the user will click to show the overlay. The library will store an initialised object to the containing element's data set so you can start and stop it with whatever options you set.
$('body').chardinJs(); $('body').on('click', 'button[data-toggle="chardinjs"]', function (e) { e.preventDefault(); return ($('body').data('chardinJs')).toggle(); });
You can run it explicitly like so:
$('body').chardinJs('start')
If you would rather run ChardinJs confined to a particular container (instead of using the whole document) you can
change
body to some other selector.
$('.container').chardinJs('start')
You may also refresh instructions overlay any time to reflect whatever changes happened to the underlying page elements since the instructions overlay has been displayed.
var chardinOverlay = $('body').chardinJs('start'); ... chardinOverlay.refresh();
Options
The chardinJS constructor can take several options, eg:
$('body').chardinJs({ url: "/help/HelpOverlay.json" });
Options are:
- url: specifies a url that returns a json object containing text to show. This is useful to dynamically change the overlay, or to hold all your overlay text in one external file. The json file should contain a set of name-value pairs, the name will match the data-intro attribute if it begins with a '#'. The value contains the required text and an optional position. For conflicts between the data attributes and the json entries, the attribute takes precedence.
Example:
{ "#summary-btns": { "text": "buttons to interact with the displayed summary", "position": "left" }, "#search-btn": { "text": "expand this to filter the list of profiles" } }
This text will be shown against an element that has
data-intro='#summary-btns'. If the data-intro does not start with a #, then the value will be used as the text to display.
If no entry is present for a given element's data reference, then nothing will be displayed.
- attribute: changes the data attribute from data-intro to data-. Example:
Javascript $('body').chardinJs({ attribute: 'data-intro' });
Methods
.chardinJs('start')
Start ChardinJs in the selector.
.chardinJs('toggle')
Toggle ChardinJs.
.chardinJs('stop')
Make your best guess. That's right! Stops ChardinJs in the selector.
Events
'chardinJs:start'
Triggered when chardinJs is correctly started.
'chardinJs:stop'
Triggered when chardinJs is stopped.
'chardinJs:next'
Triggered when the sequential option moves to the next element
'chardinJs:previous'
Triggered when the sequential option moves to the previous element
Author
Contributors
- John Weir
- felipeclopes
- Bobby Jack
- Maxim Syabro
- nmeum
- printercu
- Max Loginov
- sudodoki
- Mickaël Gentil
- gbjbaanb
- dozyatom
Contributions
If you want to contribute, please:
- Fork the project.
- Make your feature addition or bug fix.
- Add yourself to the list of contributors in the README.md.
- Send me a pull requestardin.js README section above are relevant to that project's source code only. | https://js.libhunt.com/chardin-js-alternatives | CC-MAIN-2022-05 | refinedweb | 1,094 | 67.45 |
A Django WebHook handler for Phaxio.
Project description
Django Phaxio
Django WebHooks for Phaxio callbacks.
Installation
Simply install the latest stable package using the command
pip install django-phaxio
add 'django_phaxio', to INSTALLED_APPs in your settings.py
and add
path('phaxio/', include('django_phaxio.urls', namespace='phaxio')),
to your urlpatterns in your URL root configuration.
You will also need to set the Phaxio callback token for security.
PHAXIO_CALLBACK_TOKEN (required):
Callback token provided by Phaxio to verify the request origin.
See
Documentation
The latest documentation can be found at Read the Docs.
Contribution
Please read the Contributing Guide before you submit a pull request.
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
django-phaxio-4.0.0.tar.gz (13.5 kB view hashes) | https://pypi.org/project/django-phaxio/ | CC-MAIN-2022-27 | refinedweb | 139 | 53.27 |
11.4. Finding points of interest an image, points of interest are positions where there might be edges, corners, or interesting objects. For example, in a landscape picture, points of interest can be located near a house or a person. Detecting points of interest is useful in image recognition, computer vision, or medical imaging.
In this recipe, we will find points of interest in an image with scikit-image. This will allow us to crop an image around the subject of the picture, even when this subject is not in the center of the image.
How to do it...
1. Let's import the packages:
import numpy as np import matplotlib.pyplot as plt import skimage import skimage.feature as sf %matplotlib inline
2. We create a function to display a colored or grayscale image:
def show(img, cmap=None): cmap = cmap or plt.cm.gray fig, ax = plt.subplots(1, 1, figsize=(8, 6)) ax.imshow(img, cmap=cmap) ax.set_axis_off() return ax
3. We load an image:
img = plt.imread('' 'cookbook-2nd-data/blob/master/' 'child.png?raw=true')
show(img)
4. Let's find salient points in the image with the Harris corner method. The first step consists of computing the Harris corner measure response image with the
corner_harris() function (we will explain this measure in How it works...). This function requires a grayscale image, thus we select the first RGB component:
corners = sf.corner_harris(img[:, :, 0])
show(corners)
We see that the patterns in the child's coat are well detected by this algorithm.
5. The next step is to detect corners from this measure image, using the
corner_peaks() function:
peaks = sf.corner_peaks(corners)
ax = show(img) ax.plot(peaks[:, 1], peaks[:, 0], 'or', ms=4)
6. Finally, we create a box around the median position of the corner points to define our region of interest:
# The median defines the approximate position of # the corner points. ym, xm = np.median(peaks, axis=0) # The standard deviation gives an estimation # of the spread of the corner points. ys, xs = 2 * peaks.std(axis=0) xm, ym = int(xm), int(ym) xs, ys = int(xs), int(ys) show(img[ym - ys:ym + ys, xm - xs:xm + xs])
How it works...
Let's explain the method used in this recipe. The first step consists of computing the structure tensor (or Harris matrix) of the image:
Here, \(I(x, y)\) is the image, \(I_x\) and \(I_y\) are the partial derivatives, and the brackets denote the local spatial average around neighboring values.
This tensor associates a \((2,2)\) positive symmetric matrix at each point. This matrix is used to calculate a sort of autocorrelation of the image at each point.
Let \(\lambda\) and \(\mu\) be the two eigenvalues of this matrix (the matrix is diagonalizable because it is real and symmetric). Roughly, a corner is characterized by a large variation of the autocorrelation in all directions, or in large positive eigenvalues \(\lambda\) and \(\mu\). The corner measure image is defined as:
Here, \(k\) is a tunable parameter. \(M\) is large when there is a corner. Finally,
corner_peaks() finds corner points by looking at local maxima in the corner measure image.
There's more...
Here are a few references:
- A corner detection example with scikit-image available at
- An image processing tutorial with scikit-image available at
- Corner detection on Wikipedia, available at
- Structure tensor on Wikipedia, available at
- API reference of the skimage.feature module available at | https://ipython-books.github.io/114-finding-points-of-interest-in-an-image/ | CC-MAIN-2019-09 | refinedweb | 576 | 58.28 |
0-24v 3A Variable Power Supply using LM338
Batteries are generally used to power up the Electronic Circuit and Projects, as they are easily available and can be connected easily. But they drained off quickly and then we need new batteries, also these batteries cannot provide high current to drive a powerful motor. So to solve these problems, today we are designing our own Variable Power Supply which will provide Regulated DC voltage ranging from 0 to 24v with a maximum current up to 3 Amps.
For most of our Sensors and Motors we use voltage levels like 3.3V, 5V or 12V. But while the sensors requires current in milliamps, motors like servo motors or PMDC motors, which run on 12V or more, require a high current. So we are building here the Regulated Power Supply of 3A current with the Variable voltage between 0 to 24v. However in practical we got up to 22.2v of output.
Here the voltage level is controlled with help of a Potentiometer and voltage value is displayed on Liquid Crystal Display (LCD) which will be driven by an Arduino Nano. Also check out our previous Power supply circuits:
- 12v Battery Charger Circuit using LM317
- Variable Power Supply By Arduino Uno
- Cell Phone Charger Circuit
Materials Required:
- Transformer – 24V 3A
- Dot board
- LM338K High Current Voltage Regulator
- Diode Bridge 10A
- Arduino Nano
- LCD 16*2
- Resistor 1k and 220 ohms
- Capacitor 0.1uF and 0.001uF
- 7812 Voltage Regulator
- 5K variable Pot (Radio Pot)
- Berg stick (Female)
- Terminal Block
How it works:
A Regulated Power Supply (RPS) is one which converts your AC mains into DC and regulates it to our required voltage level. Our RPS uses a 24V 3A step down transformer which is rectified into DC using a diode bridge. This DC voltage is regulated to our required level by using LM338K and controlled by using a Potentiometer. The Arduino and LCD are powered by a low current rating Voltage regulator IC like 7812. I will explain the circuit step by step as we go through our project.
Connecting LCD with Arduino to Display Voltage Level:
Let’s start with the LCD display. If you are familiar with LCD interfacing with Arduino, you can skip this part and directly jump to next section and if you are new to Arduino and LCD, it won’t be a problem as I will guide you with codes and connections. Arduino is an ATMEL powered microcontroller kit which will help you in building projects easily. There are lots of variants available but we are using Arduino Nano since it is compact and easy to use on a dot board
Many people have faced issues in interfacing a LCD with Arduino, thats why we try this first so that it does not ruin our project in last minute. I have used the following to start with:
This Dot board will be used for our entire circuitry, it is recommended to use a female berg stick to fix the Arduino Nano so that it could be reused later. You can also verify the working using a breadboard (Recommended for beginners) before we proceed with our Dot board. There is a nice guide by AdaFruit for LCD, you can check it. The schematics for Arduino and LCD is given below. Arduino UNO is used here for schematics, but not to worry the Arduino NANO and UNO have the same pinouts and work the same.
Once the connection the done you can upload below code directly to check the LCD working. The header file for LCD is given by Arduino by default, do not use any explicit headers as they tend to give errors.
#include <LiquidCrystal.h> // initialize the library with the numbers of the interface pins LiquidCrystal lcd(7, 8, 9, 10, 11, 12); int a (a); }
This should get your LCD to work, but if you still face issues try the following:
1. Check you pins definition in the program.
2. Directly ground the 3rd pin (VEE) and 5th pin (RW) of your LCD.
3. Make sure you LCD pins are placed in the right order, some LCD’s have their pins is another direction.
Once the program works it should look something like this. If you have any problems let us know by comments. I have used the mini USB cable to power the Arduino for now, but later we will power it using a voltage regulator. I soldered them to the dot board like this
Our aim is to make this RPS easy to use and also keep the cost as low as possible, hence I have assembled it on a dot board, but if you can offered a Printed circuit board (PCB) it will be great since we are dealing with high currents.
Building 0-24v 3A Variable Power Supply Circuit:
Now that our Display is ready let us start with the other circuits. From now it is advisable to proceed with extra caution since we are dealing directly with AC mains and high current. Check for continuity using a multimeter every time before you power you circuit.
The transformer we use is a 24V 3A transformer, this will step down our voltage (220V in India) to 24V, and we directly give this to our bridge rectifier. The bridge rectifier should will give you (root 2 times the input voltage) 33.9V, but don’t be surprised if you get around 27 – 30 Volts. This is because of the Voltage drop across each diode in our bridge rectifier. Once we reach this stage we will solder it to our dot board and verify our output and use a terminal block so that we use it as a non regulated constant source if required.
Now let us control the output voltage by using a high current regulator like LM338K, this will be mostly available in metal body package, since it has to source high current. The schematics for variable voltage regulator are shown below.
The value of R1 and R2 has to be calculated using the above formulae to determine the output voltage. You can also calculate the resistor values using this LM317 resistor calculator. In our case we get R1 to be 110 ohms and R2 as 5K (POT).
Once our Regulated output is ready we just have to power up Arduino, to do this we will use a 7812 IC since the Arduino will only consume less current. The input Voltage of 7812 is our rectified 24v DC output from rectifier. The output of regulated 12V DC is given to the Vin pin of Arduino Nano. Do not use 7805 since the maximum input voltage of 7805 is only 24V whereas 7812 can withstand upto 24V. Also a heat sink is required for 7812 since the differential voltage is very high.
The complete circuit of this Variable Power Supply is shown below,
Follow the Schematics and solder you components accordingly. As shown in schematics the variable voltage of 1.5 to 24V is mapped to 0-4.5V by using potential divider circuit, since our Arduino can only read voltages from 0-5. This variable voltage is connected to pin A0 using which the output voltage of the RPS is measured. The final Code for the Arduino Nano is given below in Code Section. Also check the Demonstration Video at the end.
Once the soldering work is done and the code is uploaded to Arduino, our Regulated Power Supply is ready to use. We can use any load which works from 1.5 to 22V with a current rating of maximum 3A.
Point to be kept in mind:
1. Be careful while soldering the connections any mismatch or carelessness will easily fry your components.
2. Ordinary solders might not be able to withstand 3A, this will lead eventually melt your solder and cause short circuit. Use thick copper wires or use more lead while connecting the high current tracks as shown in the picture.
3. Any short circuit or weak soldering will easily burn your transformer windings; hence check for continuity before powering up the circuit. For additional safety a MCB or fuse on Input side can be used.
4. High current voltage regulators mostly come in metal can packages, while using them on dot board do not place components close to them as their body acts as the output of the rectified Voltage, further will result in ripples.
Also do not solder the wire to the metal can, instead use a small screw as shown in the picture given below. Solders don’t stick to its body, and heating results in damaging the Regulator permanently.
5. Do not skip any filter capacitors from the schematics, this will damage you Arduino.
6. Do not overload the transformer more than 3A, stop when you hear a hissing noise from the transformer. It is good to operate between the ranges of 0 – 2.5A.
7. Verify the output of your 7812 before you connect it to your Arduino, check for overheating during first trial. If heating occurs it means your Arduino is consuming more current, reduce the backlight of the LCD to solve this.
Read more: 0-24v 3A Variable Power Supply using LM338
JLCPCB – Prototype 10 PCBs for $2 + 2 days Lead Time
China’s Largest PCB Prototype Enterprise, 300,000+ Customers & 10,000+ Online Orders Per Day
Inside a huge PCB factory:
This Post / Project can also be found using search terms:
- 0-24v 3A transformer | https://duino4projects.com/0-24v-3a-variable-power-supply-using-lm338/ | CC-MAIN-2018-51 | refinedweb | 1,584 | 68.4 |
UTF8Encoding.GetBytes Method (String, Int32, Int32, Byte[], Int32), provided.
The following example uses the GetBytes method to encode a range of elements from a Unicode character array and store the encoded bytes in a range of elements in a byte array.
using System; using System.Text; class UTF8EncodingExample { public static void Main() {); Console.WriteLine( "{0} bytes used to encode characters.", bytesEncodedCount ); Console.Write("Encoded bytes: "); foreach (Byte b in bytes) { Console.Write("[{0}]", b); } Console.WriteLine(); } }
Available since 8
.NET Framework
Available since 1.1
Portable Class Library
Supported in: portable .NET platforms
Silverlight
Available since 2.0
Windows Phone Silverlight
Available since 7.0
Windows Phone
Available since 8.1 | https://msdn.microsoft.com/en-us/library/xsy6z64h(v=vs.110).aspx | CC-MAIN-2017-30 | refinedweb | 111 | 55.3 |
edocs Home > BEA AquaLogic Data Services Platform 3.0/3.2/3.01 Documentation
The XQuery Scripting Extension (XQSE) language is an XQuery extension that BEA has newly introduced in ALDSP 3. The availability of XQSE opens doors to many places one could not easily go to in previous releases of ALDSP, at least not without leaving XQuery and writing custom Java code. The purpose of this "how to" guide is to show its readers some of what's now possible in ALDSP thanks to XQSE. It is a companion to the more formal XQSE Language Reference.
In addition, this guide aims to provide its readers with insight into when, and why, XQSE should be used to write a given data service operation instead of writing it in XQuery (or Java). To that end, this guide is organized as a guided tour of a series of "typical XQSEs" — it presents a series of use cases to which XQSE is the answer, and it briefly explains how and why XQSE and its various features are "the right way" to address each of the use cases.
For readers' convenience and entertainment, all of the material presented here is also available as an importable ALDSP 3.0 data space project. Before reading further, you should import the project, as described below. The underlying relational data sources for the XQSE-How-To project are all prepackaged with ALDSP 3.0, so once you import it, you'll have everything that you will need to study our XQSEs and start making up some clever new XQSEs of your own.
Before proceeding any further, hopefully you've noticed the best part of the language: its name. If you haven't already figured it out, XQSE is properly pronounced "excuse", and XQSEs are "excuses". When your boss asks you if you've got those critical data services ready for him or her yet, you can now answer "Well, no, not yet, boss, but I've come up with some really good XQSEs!" Is this a great language, or what...?
The XQSE-How-To project is based on a relational database-based scenario involving the time-worn example of employees and departments. It involves three tables, including a pair of related tables EMP and DEPT from one hypothetical data source (drawn from the sample Pointbase JDBC data source dspSamplesDataSource) and a third table EMP2 from a second hypothetical data source (from the Pointbase JDBC data source dspSamplesDataSource1).
If you'd like to examine the project, you can download it from:
Save the project to a local directory and import the project.
The EMP/DEPT tables include information about who works for who, in which department, and earning how much. The management hierarchy sets the stage for showing how XQSE can help with ALDSP use cases requiring data-dependent recursion or iteration. EMP will also be used to show how XQSE can be used to check and enforce business rules on updates. The EMP2 table has much of the same information as EMP, but it represents the information in a somewhat different form — and hypothetically in a different geographical location as well — thereby setting the stage for showing how XQSE can help with transformation- and replication-related use cases. This will provide an opportunity to further show how XQSE can be used to express custom update-related logic, both for bulk updates and incremental updates, as well as showing a bit about exception handling in XQSE.
Shown below for reference are the DDL statements used to create and populate the three sample tables. All three live in one Pointbase database that is then presented to ALDSP via several different JDBC data sources (to provide a way to simulate a distributed database environment, as each JDBC data source is handled as a different relational data source by ALDSP).
CREATE SCHEMA EMP_DEMO;
CREATE TABLE EMP_DEMO.EMP (
EID VARCHAR(8) NOT NULL,
MID VARCHAR(8),
NAME VARCHAR(32) NOT NULL,
SALARY DECIMAL(10,2),
DEPTNO INTEGER );
ALTER TABLE EMP_DEMO.EMP ADD CONSTRAINT EMP_PK PRIMARY KEY (EID);
INSERT INTO EMP_DEMO.EMP ( EID, NAME, SALARY, DEPTNO ) VALUES( 'EMP1', 'Charlie Chairman', 1250000.00, 10 );
INSERT INTO EMP_DEMO.EMP ( EID, NAME, SALARY, DEPTNO, MID ) VALUES( 'EMP2', 'Dave Divisionhead', 275000.00, 10, 'EMP1' );
INSERT INTO EMP_DEMO.EMP ( EID, NAME, SALARY, DEPTNO, MID ) VALUES( 'EMP3', 'Suzy Supervisor', 250000.00, 10, 'EMP1' );
INSERT INTO EMP_DEMO.EMP ( EID, NAME, SALARY, DEPTNO, MID ) VALUES( 'EMP4', 'Denise Departmenthead', 180000.00, 20, 'EMP2' );
INSERT INTO EMP_DEMO.EMP ( EID, NAME, SALARY, DEPTNO, MID ) VALUES( 'EMP5', 'Alfred Architect', 175000.00, 20, 'EMP2' );
INSERT INTO EMP_DEMO.EMP ( EID, NAME, SALARY, DEPTNO, MID ) VALUES( 'EMP6', 'Larry Leafnode', 95000.00, 20, 'EMP3' );
INSERT INTO EMP_DEMO.EMP ( EID, NAME, SALARY, DEPTNO, MID ) VALUES( 'EMP7', 'Emily Engineer', 125000.00, 30, 'EMP3' );
INSERT INTO EMP_DEMO.EMP ( EID, NAME, SALARY, DEPTNO, MID ) VALUES( 'EMP8', 'Gregory Groupleader', 145000.00, 30, 'EMP4' );
INSERT INTO EMP_DEMO.EMP ( EID, NAME, SALARY, DEPTNO, MID ) VALUES( 'EMP9', 'Peter Peon', 79000.00, 30, 'EMP8' );
CREATE TABLE EMP_DEMO.EMP2 (
EmpId VARCHAR(8) NOT NULL,
FirstName VARCHAR(32),
LastName VARCHAR(32),
MgrName VARCHAR(32),
Dept INTEGER );
ALTER TABLE EMP_DEMO.EMP2 ADD CONSTRAINT EMP2_PK PRIMARY KEY (EmpId);
CREATE TABLE EMP_DEMO.DEPT (
DNO INTEGER NOT NULL,
DNAME VARCHAR(32) NOT NULL );
ALTER TABLE EMP_DEMO.DEPT ADD CONSTRAINT DEPT_PK PRIMARY KEY (DNO);
INSERT INTO EMP_DEMO.DEPT ( DNO, DNAME ) VALUES( 10, 'Administration' );
INSERT INTO EMP_DEMO.DEPT ( DNO, DNAME ) VALUES( 20, 'Engineering' );
INSERT INTO EMP_DEMO.DEPT ( DNO, DNAME ) VALUES( 30, 'Testing' );
ALTER TABLE EMP_DEMO.EMP ADD CONSTRAINT DEPT_FK FOREIGN KEY (DEPTNO) REFERENCES EMP_DEMO.DEPT;
If you browse through the XQSE-How-To project using Data Services Studio Project Explorer, you will see that all three of these tables have been imported into the sample project as physical data services of the relational variety. The model diagram below (RelationalSources.md in the XQSE how-to sample project) summarizes these three physical relationally-based data services as seen by ALDSP.
The following figure provides an overview of the XQSE How-To project's logical and physical data services and how they relate to one another. You will start off by creating a logical data service called Employee that provides a nice, cleaned-up view of the employee data from EMP (and potentially DEPT, though we will actually not use DEPT's content in this how-to). This data service will be used to illustrate several important read-only use cases where XQSE functions will nonetheless come to the rescue. The Employee data service will also be used to illustrate the use of XQSE to enforce business rules when data changes are being requested.
The next step will involve the creation of a library data service called EmployeeBackup. This data service illustrates how XQSE can help with a "lightweight ETL" use case; the main operation provided by this data service will, when called, do a batch-replication of data from Employee into EMP2.
Our final step will be to create another entity data service called ReplicatedEmployee. ReplicatedEmployee will show how XQSE can be used to customize update handling. This data service will use XQSE to keep the information in Employee and in EMP2 in sync.
While XQSE is very important for customizing updates, it is also very useful for certain classes of read-only use cases. This is why ALDSP 3.0 supports XQSE functions as well as procedures, and that's where to begin the informal study of how to develop good XQSEs. The examples for this part of the study will all center around the logical data service Employee.ds in the XQSE How-To sample project.
If you open the design view for the Employee data service, you will see the following:
The Employee data service is a simple logical data service that slightly transforms the relational EMP data to make it "look nicer" for subsequent use. Its primary read function is very simple as a result, as you will see if you examine the query map view of the getAll() function of the Employee data service:
Before we dive into the details of the various XQSE functions of interest, you should try to get a feel for the Employee data that we will be working with. Here's what the getAll() function will return when you run it using your copy of the sample project:
As you can see, the result is tabular, and it contains the employee ID, manager ID, employee name, salary, and department number for each of the employees of a small company. The CEO is the employee named Charlie Chairman, and you can tell that he's at the top of the food chain in the company because he has no manager. Who reports to who is encoded via the manager IDs in the database; Suzy Supervisor and Dave Divisionhead both report to Charlie, for example, as both have EMP1 (Charlie's employee ID) as their manager ID. Suzy's reports are Larry Leafnode and Emily Engineer, and so on. If you were to draw the full reporting tree including all of the employees, i.e., a tree with the employee IDs and names of everyone who reports either directly or indirectly to Charlie, you would end up with a picture like the following:
As you can see, this data is recursive in nature, making it challenging to deal with using just XQuery — particularly since ALDSP does not permit XQuery functions to be recursive. However, XQSE is more permissive in that regard. As you will soon see, dealing with this data is a perfect use case for XQSE, using either iteration or recursion. You can even use XQSE to generate a reporting tree like the one above!
Basically, when you come across use cases that would demand recursion in XQuery, you've come across a good use case for XQSE. If your use case requires only tail recursion, then you can approach it using either iteration or recursion in XQSE (depending on what you find more natural, i.e., depending on how your brain happens to be wired). If your use case involves full recursion, like the reporting tree example, then you can use recursion in XQSE to tackle your problem. Let's now look at the examples of such use cases that are provided in the XQSE How-To sample project.
XQSE functions and procedures can utilize constructs from both XQSE and XQuery. For the use cases that you are about to examine, it will be helpful to have functions that get an Employee instance based on either an employee ID or a manager ID. The following XQuery source shows the XQuery definition of the Employee DS getAll() function as well as the use of this function to create the two XQuery helper functions, getByEmployeeID and getByManagerID, that we want for the XQSE use cases here. Hopefully it will be readily apparent what these functions do and how they do it. All three are categorized as read operations for the Employee data service, as all three return zero or more instances of an Employee.
(::pragma function <f:function::)
declare function tns:getAll() as element(empl:Employee)* {
for $EMP in emp:EMP()
return
<empl:Employee>
<EmployeeID>{fn:data($EMP/EID)}</EmployeeID>
<ManagerID?>{fn:data($EMP/MID)}</ManagerID>
<Name>{fn:data($EMP/NAME)}</Name>
<Salary?>{fn:data($EMP/SALARY)}</Salary>
<DeptNo?>{fn:data($EMP/DEPTNO)}</DeptNo>
</empl:Employee>
};
(::pragma function <f:function::)
declare function tns:getByEmployeeID($id as xs:string?) as element(empl:Employee)* {
for $emp in tns:getAll()
where $id eq $emp/EmployeeID
return $emp
};
(::pragma function <f:function::)
declare function tns:getByManagerID($id as xs:string?) as element(empl:Employee)* {
for $emp in tns:getAll()
where $id eq $emp/ManagerID
return $emp
};
The first example to look at in the XQSE How-To sample project is the function distanceFromTop() in Employee.ds. The use case is simple: You know the employee ID for an employee, and you want to know how far down the corporate food chain that employee is — i.e., you want to know how far away a given employee is from the top of the company. Charlie Chairman's distanceFromTop is 0 — he's the CEO. For Suzy Supervisor, the answer is 1, as she's one step away from the top — she reports to Charlie — while for Emily Engineer, one of Suzy's reports, the answer is 2. You get the idea. But how can this be easily computed? With XQuery in ALDSP, this cannot be done, but with XQSE, it can. Open up the source view of Employee.ds for the distanceFromTop() function and you will see your first honest-to-goodness XQSE function:
(::pragma function <f:function::)
declare xqse function tns:distanceFromTop($id as xs:string?) as xs:integer? {
declare $mgrCnt as xs:integer := 0;
declare $curEmp as element(empl:Employee)? := tns:getByEmployeeID($id);
declare $mgrId as xs:string? := fn:data($curEmp/ManagerID);
if (fn:empty($curEmp)) then return value ();
while (fn:not(fn:empty($mgrId))) {
set $mgrCnt := $mgrCnt + 1;
set $curEmp := tns:getByEmployeeID($mgrId);
set $mgrId := fn:data($curEmp/ManagerID);
};
return value ($mgrCnt);
};
The function signature looks like an XQuery function, except with the modifier "xqse". The modifier tells ALDSP that this function's body will contain XQSE code, not just XQuery. It also tells ALDSP that this is a function, so it had better behave as such — having no side effects and so on.
The function body starts by declaring three variables — mgrCnt, initially 0, for keeping track of the distance we are from the top; curEmp, initially the employee whose ID we have, for keeping track of the current employee under consideration; and mgrId, which holds the manager ID of the current employee.
After defining and initializing these variables, the function uses an if-statement to immediately return the empty sequence (the XQuery and XQSE equivalent of a null) if there is no employee with the given ID. The function then uses a while-statement to walk from the current employee on up to the top of the corporate food chain. The while-loop will execute as long as the current employee is not yet the top employee, as indicated by the presence/absence of a manager ID.
In each iteration, one is added to the distance traveled, you set the new current employee to be the old current employee's manager, and you extract the manager ID from the new current employee. Once you fall out of the loop, you've made it to the top — and the distance you've covered is recorded in mgrCnt — so the mgrCnt value is returned and you're done. By using XQSE, you can solve what would have been a difficult or impossible problem for earlier versions of ALDSP in just a handful of lines of extended XQuery code. Neat, huh? At this point, you should make sure you understand what you have seen so far. Take a short break, study the code one more time if need be, and in the Data Services Studio switch to Test view. What's the distanceFromTop for Peter Peon? Does the answer make sense? If you're challenged by what you're seen so far, hand-execute the XQSE code and see why the answer for Peter turns out to be 4.
The distanceFromTop() function that you just saw used iteration to walk up the employee hierarchy, counting as it went. This is the most natural approach for many people. Another solution, however, would have been to use recursion: The distanceFromTop value for a given employee is zero if they are the CEO (i.e., if they have no manager), and it is simply their manager's distanceFromTop plus one otherwise. The XQSE function distanceFromTop2(), shown below and also provided in the Employee DS, solves the problem that way. This is an example of an XQSE function that employs tail recursion. Note the similarities between distanceFromTop2() and the previous XQSE function, distanceFromTop(). The key difference is that distanceFromTop2() doesn't loop - instead, it "repeats" its logic on the manager of the current employee by calling itself with the manager's employee ID.
(::pragma function <f:function::)
declare xqse function tns:distanceFromTop2($id as xs:string?) as xs:integer? {
declare $curEmp as element(empl:Employee)? := tns:getByEmployeeID($id);
declare $mgrId as xs:string? := fn:data($curEmp/ManagerID);
if (fn:empty($curEmp)) then return value ();
if (fn:not(fn:empty($mgrId))) then {
return value 1 + tns:distanceFromTop2($mgrId);
} else {
return value 0;
};
};
The next XQSE function use case is similar to the first, but it shows how the data-handling power of XQuery and XQSE can allow something richer to be computed. The premise for this use case is the same, we have an employee ID in hand — but this time, you want to know details — you want to know who's in the management chain of the employee. (If the employee does something you don't like, you want to know where you can turn! ). For this purpose, we define the management chain for an employee to be the sequence containing their information, their manager's information, and so on, until we reach the CEO's information.
The following XQSE code for the function managementChain(), available in the employee DS, computes this sequence. Structurally it is almost identical to distanceFromTop(). The main difference is that, instead of counting from zero, this function initializes the result sequence (empChain) to be the current employee and then keeps appending the new current employee to the end of the sequence as it loops its way up the management chain to the CEO.
(::pragma function <f:function::)
declare xqse function tns:managementChain($id as xs:string?) as element(empl:Employee)* {
declare $curEmp as element(empl:Employee)? := tns:getByEmployeeID($id);
declare $empChain as element(empl:Employee)* := $curEmp;
declare $mgrId as xs:string? := fn:data($curEmp/ManagerID);
while (fn:not(fn:empty($mgrId))) {
set $curEmp := tns:getByEmployeeID($mgrId);
set $empChain := ($empChain, $curEmp);
set $mgrId := fn:data($curEmp/ManagerID);
}
return value ($empChain);
};
If you understood distanceFromTop(), you will be able to quickly see how the logic for managementChain() works. Try running this XQSE function in the Test view. For Peter Peon, you should see:
Let's close our discussion of XQSE functions with one more use case, a "recursive grand finale". Suppose that we wanted to compute the reporting tree for a given employee, the kind of tree that we discussed and showed earlier in the introduction to XQSE functions.
The XQSE function reportingTree() in the Employee data service does exactly that (shown below). Notice how short and simple it is — XQSE can help you accomplish a lot with a small amount of code. Variable curEmp is the current employee, and variable reports is a list of the current employee's direct reports (obtained using the XQuery helper function that looks up employees by manager ID).
What should the current employee's reporting tree look like? That's easy — it should contain their ID and name plus the reporting tree for each of their reports. This is exactly how the XQSE solution below solves the problem, using recursion to express the "plus the ..." part of this logic. Notice that the sequence of reports' reporting trees is computing using a small XQuery — "for $rep in $reports return tns:reportingTree($rep/EmployeeID)" — which demonstrates how XQuery and XQSE combine naturally to solve real problems. The XQSE function call from XQuery is perfectly legal because, at the end of the day, an XQSE function is just a function, and ALDSP XQuery queries are permitted to call XQSE functions anywhere they can call a function. (Factoid: This use case became a part of the XQSE How-To project because, on one of the days while it was being developed, someone posted a use case just like this on ldblazers!)
(::pragma function <f:function::)
declare xqse function tns:reportingTree($id as xs:string?) as element(EmpTree)? {
declare $curEmp as element(empl:Employee)? := tns:getByEmployeeID($id);
declare $reports as element(empl:Employee)* := tns:getByManagerID($id);
declare $result as element(EmpTree)? :=
<EmpTree?>
<EmpID?>{fn:data($curEmp/EmployeeID)}</EmpID>
<EmpName?>{fn:data($curEmp/Name)}</EmpName>
<Reports?>{
for $rep in $reports return tns:reportingTree($rep/EmployeeID)
}</Reports>
</EmpTree>;
return value ($result);
};
Okay, you're off to a good start. You've seen how XQSE can be used to write functions, namely XQSE functions, that compute answers to use cases that were previously out of reach. In addition, you've now been exposed to a number of the features of the XQSE language including mutable variables, assignment statements, if-statements, and while-statements.
Now it's time to look at the "bread & butter" use cases for XQSE — namely, use cases where update customization is needed. Prior to ALDSP 3.0, most custom update use cases required Java programming. Now a large class of such use cases can be handled using ALDSP's new Update Map editor. And what about the ones that can't? That's where XQSE comes in. In ALDSP 3.0, you can use XQSE to write your own update logic by writing your own custom create, insert, and update procedures and/or by writing library procedures with side effects that the consumers of your data services can then call. Your update procedures can either be used instead of the system's auto-generated update logic or in conjunction with it (by taking control, adding your logic, and then ultimately calling the system's own routines from within the bodies of yours).
In this section of the XQSE How-To there are two representative examples involving update customization. The first will show how you can use XQSE to write your own procedures — much like a SQL stored procedure — with side effects. Applications can then be told about, and call, your new procedure. The other example will show how you can inject your own logic into the system's update automation machinery in order to enhance what happens when SDO-based updates are performed by client applications through ALDSP's Java or web service mediator APIs. Both of these examples are based on the Employee data service that we have been working with so far, so before going any further, let's look at the Update Map view for the Employee data service.
If you open the Update Map view of the Employee data service you will see the following:
This update map was generated in the usual ALDSP 3.0 way. (This How-To assumes familiarity with ALDSP's 3 update map functionality. If you aren't so familiar with update maps see Managing Update Maps in the Data Services Developer's Guide.
Managing Update Maps
As you can see, ALDSP had no trouble generating a complete set of update machinery for the Employee data service. The primary read function (designated to be the getAll() function) does nothing more than some simple name remapping, which is easily reverse-engineered by ALDSP's update lineage analysis. As a result, create(), update(), and delete() procedures were all auto-generated without a hitch for the Employee data service.
The Update Map view shows how data will move from an inserted, changed, or deleted Employee instance (shown on the right-hand side of the view) down to the underlying relationally-based EMP data service (on the left), as well as showing where the key returned by a create() call will come from (i.e., from the EID of EMP).
The following source code snippet shows the operation signatures and pragmas for the resulting system-provided update procedures. First, notice that procedures insert() and delete() are public, while update() has been changed to be a private operation of the Employee data service (discussed below). For the same soon-to-be-covered reason, insert() and delete() are flagged as being primary (i.e., the designated handlers for the automation that processes SDO updates) while update() is not (isPrimary = "false"). Notice also that all three functions are external and implemented by ALDSP's auto-update machinery (i.e., their implementation type is "updateTemplate").
(::pragma function <f:function
<nonCacheable/><implementation><updateTemplate/></implementation>
</f:function>::)
declare procedure tns:update($arg as changed-element(empl:Employee)*) as empty() external;
(::pragma function <f:function
<nonCacheable/><implementation><updateTemplate/></implementation>
</f:function>::)
declare procedure tns:create($arg as element(empl:Employee)*) as element(empl:Employee_KEY)* external;
(::pragma function <f:function
<nonCacheable/><implementation><updateTemplate/></implementation>
</f:function>::)
declare procedure tns:delete($arg as element(empl:Employee)*) as empty() external;
So far, so good — so what might you need to customize? Well, suppose that your client application developers want to be able to delete an Employee instance without having to fetch it from ALDSP first. Instead, they would like to be able to perform a "blind delete" operation based only on an employee ID. (I.e., no matter what data might be in the Employee instance at the moment — hence "blind" — they want the employee with that ID to be banished from the organization immediately.) We can meet this requirement by writing a library procedure in XQSE that looks up the employee with a given ID and then calls the system-generated delete operation. The following two-line procedure does exactly that:
(::pragma function <f:function::)
declare procedure tns:deleteByEmployeeID($id as xs:string?) as empty() {
declare $emp as element(empl:Employee)? := tns:getByEmployeeID($id);
tns:delete($emp);
};
Another common reason for customizing updates is the need to condition the updates on not violating an application's business rules. For example, suppose that the little company whose data you've been looking at has a corporate rule against big raises and big paycuts: it's a violation of corporate policy to change an employee's salary by more than 10% at a time. Let's see how you can easily enforce such a business rule using a few lines of XQSE.
First, you'll need a way to know whether or not an update is about to violate the 10% business rule. We can write a short boolean function in XQuery to do the required checking. For the 10% rule, the private function invalidSalary() in the Employee data service does this check. It takes as its argument an employee with changes — an instance of changed-element(Employee) — and it uses the ALDSP-provided node functions fn-bea:current-value() and fn-bea:old-value() to access the current and old values of the Employee instance that's being updated. By comparing the old and new salaries, it can detect attempts to violate the 10% rule and return true if the requested change is indeed invalid:
(::pragma function <f:function::)
declare function tns:invalidSalaryChange($emp as changed-element(empl:Employee)) as xs:boolean {
let $newSalary := fn:data(fn-bea:current-value($emp)/Salary)
let $oldSalary := fn:data(fn-bea:old-value($emp)/Salary)
return (100.0 * fn:abs($newSalary - $oldSalary) div $oldSalary) gt 10.0
};
Given the XQuery function that encodes the business rule, it is now easy to use XQSE to enforce the rule. The following XQSE function, updateChecked(), has the same signature as the system-generated update function — it takes a sequence of Employee instances with changes — but it only performs the requested updates if they are all legal.
To do this, it uses the XQSE iterate-statement to iterate over the incoming Employee instances. If any of them contain a salary change that's too great, it uses fn:error() to throw an exception. If all of the changes turn out to be permissable, it then calls the system-provided update() function on the list of changed Employee instances. Notice that updateChecked() is marked as primary and public, so it is this updateChecked() operation that applications will be able to see and that the system will call when processing updates.
(::pragma function <f:function::)
declare procedure tns:updateChecked($changedEmps as changed-element(empl:Employee)*) {
iterate $sourceEmp over $changedEmps {
if (tns:invalidSalaryChange($sourceEmp))
then fn:error(xs:QName("INVALID_SALARY_CHANGE"), ": Salary change exceeds the limit.", $sourceEmp);
};
tns:update($changedEmps);
};
Clear? This is a very important (and common) usage pattern for XQSE, so don't miss the punchline: To override ALDSP's auto-generated update handling logic using XQSE, you can make the system's routine(s) non-primary and instead use XQSE to write new primary create, update, and/or delete operations of your own. You can do all the work yourself in XQSE, or you can — like the example just examined — do whatever special processing you need to do and then turn the rest of the update back over to the system's routine for further processing. Most of the time you will probably want to do that, as it's better from a layered design standpoint. If you let the system finish the job, and someone later changes what it means to "finish the job" at the layer below, what you've done will still work. If you took over everything yourself, you may have to adapt your update logic later when other things change.
Another kind of update that is often of interest can be characterized as a "fully encapsulated update". A common pattern in the relational world is to forbid application developers from doing updates using SQL; instead, such mortals are restricted to using a set of approved stored procedures when updating the database. XQSE can be used to write server-side procedures that accomplish the same sort of thing in the SOA world.
As a simple example, the following XQSE procedure takes as arguments an employee id plus old and new department id values. Given these inputs, it locates the employee in the old department and then reassigns he or she to the new department. Reassignment is accomplished by changing the employee's department number using the function fn-bea:replace-value(). This function is one of three "mutator" functions (along with fn-bea:delete() and fn-bea:insert-into()) newly added in ALDSP 3.2. A mutator function takes as input a changed-element and returns a modified copy with further changes. In this case the modification is the replacement of the old department number value with the desired new value. Finally, in our example, the transfer procedure returns true if the transfer operation is successful and false otherwise.
(::pragma function <f:function::)
declare procedure tns:transfer($id as xs:string, $fromDeptNo as xs:int, $toDeptNo as xs:int) as xs:boolean {
declare $xferEmp as element(empl:Employee)? := tns:getByEmployeeID($id)[DeptNo eq $fromDeptNo];
if (fn:exists($xferEmp)) then {
declare $chgdEmp as changed-element(empl:Employee)? := fn-bea:changed-element($xferEmp);
set $chgdEmp := fn-bea:replace-value($chgdEmp, "DeptNo", $toDeptNo);
tns:update($chgdEmp);
return value fn:true();
} else {
return value fn:false();
};
};
Before proceeding, you should play around with Employee.ds in Data Services Studio. Try running its various data service operations, including the ones we've just covered. Use one of the read functions to read a set of employees that includes Peter Peon. See what happens if you try to double his salary. Ouch, not this year!
At this point, you've seen most of the features of XQSE in action, and you've seen its most common uses. You've seen how to use XQSE to write functions requiring complex, procedural logic; you've seen how to use XQSE to write side-effecting operations, i.e., procedures; and, you've seen how to use XQSE to write custom update logic to augment or replace system-provided updates. At this point you could even roll up your sleeves and write your own updates, deciding that update maps are for wimps, were you so inclined. Surely that must be it — there can't be more to XQSE than that, can there? In fact, there is! Read on...
A class of use case that has come up for data services from time to time is "lightweight ETL". An ETL (or extract, transform, load) system is an enterprise middleware software system that moves data from place to place, such as from operational systems into a data warehouse, usually transforming it from one format into another along the way. High-end ETL systems include features such as seriously high-speed data movement, parallelism, and checkpointing/restartability.
Of course, to paraphrase a popular movie quote, with great powers come great list prices — and some ALDSP customers have "small ETL" needs that they wish they could solve without having to buy yet another specialized software package. With XQSE, ALDSP 3 opens the door for using ALDSP for those use cases, i.e., for "lightweight ETL". In this section you will see how that can work. In your copy of the XQSE How-To sample project, you will find a library data service called EmployeeBackup that contains an example. If you open up the design view for EmployeeBackup.ds, you will see that there are three operations on this DS:
The first operation is another XQuery helper function. Again, XQuery is a part of XQSE, and you will often mix the two when solving your actual use cases, using XQuery whenever possible and XQSE when you need the extra power that it provides.
In this case, the XQuery helper function is transformToEMP2(), which takes an Employee instance as input and reshapes it as an instance of EMP2. This function does the "T" part of "ETL" — it transforms its input data into a desired form for use (e.g., loading) elsewhere. The XQuery source code for this function is shown below. Notice how it transforms the data — it parses the incoming name into the multiple parts required by the target, and it does a database lookup to convert the incoming manager ID into the manager name desired by the target. All quite simple, and all something you could tackle without having to make a bunch of excuses!
(::pragma function <f:function::)
declare function tns:transformToEMP2($emp as element(empl:Employee)?) as element(emp2:EMP2)? {
for $emp1 in $emp return
<emp2:EMP2>
<EmpId>{fn:data($emp1/EmployeeID)}</EmpId>
<FirstName>{fn:tokenize(fn:data($emp1/Name),' ')[1]}</FirstName>
<LastName>{fn:tokenize(fn:data($emp1/Name),' ')[2]}</LastName>
<MgrName>{fn:data(ens1:getByEmployeeID($emp1/ManagerID)/Name)}</MgrName>
<Dept>{fn:data($emp1/DeptNo)}</Dept>
</emp2:EMP2>
};
Given our little XQuery "T" helper function, we can use the iterate-statement feature of XQSE to do the "E" work — i.e., to extract the desired data from the source system. The same feature can drive the "L" work — the loading — as well. The following procedure, written in XQSE, copies all of the Employee instances from the Employee data service (using its getAll() function) and transforms and inserts them as it goes into the EMP2 DS. It also keeps and returns a count of the number of instances processed as it goes.
This is the second operation in EmployeeBackup.ds, and it is called copyAllToEMP2():
(::pragma function <f:function::)
declare procedure tns:copyAllToEMP2() as xs:integer {
declare $backupCnt as xs:integer := 0;
declare $emp2 as element(emp2:EMP2)?;
iterate $emp1 over ens1:getAll() {
set $emp2 := tns:transformToEMP2($emp1);
emp2:createEMP2($emp2);
set $backupCnt := $backupCnt + 1;
}
return value ($backupCnt);
};
Factoid: Because of the relatively simple nature of this iterate loop, this procedure will actually "stream process" the data. That is, given how it's written, it will extract, transform, and then load one datum at a time without needing to materialize all of the data at once. (Nothing fancy, but it will get the job done if the need is accurately characterized by the descriptor "lightweight". In this case, it is.)
The third and final operation in EmployeeBackup.ds is deleteAllEMP2(), which uses an XQSE iterate-statement to delete all of the instances in the EMP2 DS:
(::pragma function <f:function::)
declare procedure tns:deleteAllEMP2() as xs:integer{
declare $deleteCnt as xs:integer := 0;
iterate $emp2 over emp2:EMP2() {
emp2:deleteEMP2($emp2);
set $deleteCnt := $deleteCnt + 1;
}
return value ($deleteCnt);
};
This procedure is included simply so you can conveniently play (and then play some more) with this example data service using your copy of the XQSE How-To project. So play! First, use the Test view to explore Employee.ds and EMP2.ds. See what they contain, data-wise. The getAll() function of Employee will show you all the content there, and the EMP2() function of EMP2 will do likewise.
EMP2 is initially empty. Now run copyAllToEMP2 and look again. Voila! With ALDSP 3.0, our motto is "Satisfaction guaranteed, or double your data back!" EMP2 now contains appropriately transformed copies of all of the Employee data, as was our goal. Too good to be true? Run deleteAllEMP2, and EMP2 will be empty again. Now you can re-run copyAllToEMP2 and see it work again. That's lightweight ETL at work.
You're almost there! In the final use case, you'll take another look at the pattern of using XQSE to customize updates. You've already seen an example of how to do this, but it's an important enough pattern that it deserves a little extra attention. To make this use case more interesting, you'll also use it to illustrate a bit more about how exception-handling can be done in XQSE by using a try-statement.
In this use case, our goal will be to create a ReplicatedEmployee data service. This data service will be a "front" for the Employeee data service, but it will also keep the EMP2 data service in sync by sending any changes (creates, updates, or deletes) that it is notified of to both of those data services.
This use case illustrates how XQSE can be used to handle a simple data replication task in real-time rather than via the batch approach employed in the EmployeeBatch example. Note that both batch and incremental replication have their places in the world; our goal here is just to show that (and how!) XQSE can be used to help address such needs if you find yourself facing them in your own use cases.
If you open the ReplicatedEmployee data service and switch to its design view, you will see the following:
The first function, getAllFromPrimary(), is the primary read function for the ReplicatedEmployee DS. Its definition is exceedingly simple — it just retrieves the contents of the Employee data service for which this data service is a (very thin, in fact) front. Its definition in the Query Map view is the world's simplest graphical query:
The ReplicatedEmployee data service also has two other functions — getByEmployeeID, which is a simple query over the primary read function with an employee ID value as a parameter, and getAllFromSecondary, which is a library function that we have included so you can inspect the contents of EMP2 without having to switch back and forth between data services all the time in your copy of the XQSE How-To sample project. The resulting source code for all three functions is as follows, for reference:
(::pragma function <f:function::)
declare function tns:getAllFromPrimary() as element(empl:Employee)* {
for $Employee in emp1:getAll() return $Employee
};
(::pragma function <f:function::)
declare function tns:getByEmployeeID($id as xs:string?) as element(empl:Employee)? {
for $Employee in tns:getAllFromPrimary()
where $id eq $Employee/EmployeeID
return $Employee
};
(::pragma function <f:function::)
declare function tns:getAllFromSecondary() as element(emp2:EMP2)* {
for $EMP2 in emp2:EMP2() return $EMP2
};
In addition to these functions, the ReplicatedEmployee data service has six procedures — two create procedures, two update procedures, and two delete procedures. Three of these were generated by asking ALDSP for an update map with C/U/D procedures. These three are the ones you will find named createEmployee(), updateEmployee(), and deleteEmployee(). Their definitions in the source view are:
(::pragma function <f:function
<nonCacheable/><implementation><updateTemplate/></implementation>
</f:function>::)
declare procedure tns:updateEmployee($arg as changed-element(empl:Employee)*) as empty() external;
(::pragma function <f:function
<nonCacheable/><implementation><updateTemplate/></implementation>
</f:function>::)
declare procedure tns:createEmployee($arg as element(empl:Employee)*) as element(empl:ReplicatedEmployee_KEY)* external;
(::pragma function <f:function
<nonCacheable/><implementation><updateTemplate/></implementation>
</f:function>::)
declare procedure tns:deleteEmployee($arg as element(empl:Employee)*) as empty() external;
If you look at the Update Map view for the ReplicatedEmployee DS, you can see how these three procedures came to be and you can infer what they will actually do:
Since the primary read function for this data service reads only from the Employee data service, the system-provided update procedures only propagate changes to the Employee data service. ALDSP has no way of knowing that you want the changes sent to EMP2 as well, so you will have to override the system's update machinery to make that happen.
This leads us to the heart of our last use case — the XQSE procedures to accomplish exactly that. As we go, pay attention to the primary/non-primary and public/private annotations on the six update procedures. You will be using the same "trick" here that was used earlier. Namely, you can mark the system-generated procedures as being private and non-primary, use XQSE to write your own update procedures (which call the system-generated ones), and you can mark your new functions as being the public and primary update procedures. By doing so, your procedures become "the" update procedures as far as other consumers of this data service are concerned.
So how can you accomplish the desired replication job? Easy. The following source code shows how, with a little bit of XQSE, you can handle creates in a replicated manner.
This procedure iterates over the new Employee instances; for each one, it makes a copy (using our earlier transformation function) in the form required for EMP2. It then calls the system-generated createEmployee() procedure to create the new Employee instance and calls EMP2's createEMP2() procedure, passing it the transformed copy, to create the new EMP2 instance as well.
Note the use of try/catch here — each call is in an XQSE try-block, and if it fails, the exception is caught in the catch-block. The catch-block logic throws a new exception, indicating to the caller where the failure occurred (primary or secondary copy). Note also the use of fn:concat() to not lose the original cause of the problem.
(::pragma function <f:function::)
declare procedure tns:create($newEmps as element(empl:Employee)*) as element(empl:ReplicatedEmployee_KEY)* {
iterate $newEmp over $newEmps {
declare $newEmp2 as element(emp2:EMP2)? := bns:transformToEMP2($newEmp);
try { tns:createEmployee($newEmp); }
catch (* into $err, $msg, $obj) { fn:error(xs:QName("PRIMARY_CREATE_FAILURE"),
fn:concat("Create failed on primary copy due to: ", $err, $msg), $obj); };
try { emp2:createEMP2($newEmp2); }
catch (* into $err, $msg, $obj) { fn:error(xs:QName("SECONDARY_CREATE_FAILURE"),
fn:concat("Create failed on backup copy due to: ", $err, $msg), $obj); };
}
};
Clear? To help, in your copy of the XQSE How-To project, play around with this procedure in the test view. Try creating an Employee that already exists and see what happens. For extra credit, you can also play with the underlying Employee and EMP2 data services to cause a variety of failure scenerios. For example, you can manually create or delete an instance in one data service or the other, causing a ReplicatedEmployee create to have a primary key conflict on one, but not both, of the two data services. See if you can cause both primary and secondary create failure exceptions to occur.
To have have a full replication story, we have to replicate deletes as well as creates, of course. Not a problem — we simply need to invert what we just did in the previous procedure. The following XQSE procedure does just that. Again, it takes a sequence of Employee instances in and iterates over them one by one, making an EMP2 copy of each one and deleting instances from both underlying DSs by using deleteEmployee() on this data service and deleteEMP2() on the EMP2 DS. The same exception-handling pattern is used here as well.
(::pragma function <f:function::)
declare procedure tns:delete($oldEmps as element(empl:Employee)*) {
iterate $oldEmp over $oldEmps {
declare $oldEmp2 as element(emp2:EMP2)? := bns:transformToEMP2($oldEmp);
try { tns:deleteEmployee($oldEmp); }
catch (* into $err, $msg, $obj) { fn:error(xs:QName("PRIMARY_DELETE_FAILURE"),
fn:concat("Delete failed on primary copy due to: ", $err, $msg), $obj); };
try { emp2:deleteEMP2($oldEmp2); }
catch (* into $err, $msg, $obj) { fn:error(xs:QName("SECONDARY_DELETE_FAILURE"),
fn:concat("Delete failed on backup copy due to: ", $err, $msg), $obj); };
}
};
Again, stop and play, and again, for extra credit, see if you can cause both primary and delete failures by playing with the underlying data services as well.
Last but not least, of course, updates must be replicated as well. We saved the best for last, as updates (instances with changes) are the trickiest to handle, and you will need to think carefully about exactly what your own replication use cases (if/when you face them) need you to do with updates.
Here, you will use a similar pattern to the create/delete pattern above, but there's one key difference: As input, you get a list of changed Employee instances. There is no corresponding list of changed EMP2 instances, and in ALDSP 3.0 there was no straightforward way to compute one. In ALDSP 3.0, you would have had to treat the data services asymmetrically. There you would propagate the Employee updates to the Employee data service using the system-generated updateEmployee() procedure. The corresponding changes to EMP2 would be accomplished by first deleting the old version of each instance and then inserting its desired new version.
You can use the fn-bea:old-value() and fn-bea:current-value() functions to get at the desired versions and transform them, which is exactly what we do below:
(::pragma function <f:function::)
declare procedure tns:update();
emp2:deleteEMP2($oldEmp2);
emp2:createEMP2($newEmp2);
} catch (* into $err, $msg, $obj) { fn:error(xs:QName("SECONDARY_UPDATE_FAILURE"),
fn:concat("Update failed on backup copy due to: ", $err, $msg), $obj); };
};
};
Again, notice the use of try/catch to flag the reason for any failures. Using Test view, access some ReplicatedEmployee instances, edit them, and save the changes. For extra credit, try inducing failures of various kinds by playing around with the nature of your changes and the data in the underlying sources. Try making a salary change that's bigger than 10% — what happens? Why?
The addition of mutator functions in ALDSP 3.2 opens up another way to address the replicated update use case. Mutators offer a way to actually compute a list of the needed EMP2 changes. The following rewrite of the update() function, update32(), shows how this can be done. For each incoming changed employee, it first computes the corresponding old and new EMP2 values, just as update() did. However, rather than deleting the old and inserting the new — a heavy-handed and not necessarily efficient approach — update32() analyzes the differences (based on knowing the EMP2 schema) to figure out how to properly propagate each change. It then uses the appropriate mutator function to effect each change, resulting when done in a changed-element that has been changed only in the ways needed to account for the difference between the old and new EMP2 states. Note that, as shown in the XQSE code, this means figuring out whether each element of EMP2 was newly added, newly removed, has had its value changed, or was unchanged. After inspecting all elements of EMP2 in this manner, EMP2's update routine is called with the resulting changed entity instance.
(::pragma function <f:function::)
declare procedure tns:update32();
declare $chgdEmp2 as changed-element(emp2:EMP2)? := fn-bea:changed-element($oldEmp2);
(: figure out what's changed and note ONLY those changes in the backup copy :)
if (not($newEmp2/MgrName eq $oldEmp2/MgrName)) then {
if (fn:empty($oldEmp2/MgrName)) then {
set $chgdEmp2 := fn-bea:insert-into($chgdEmp2, ".", $newEmp2/MgrName);
} else if (fn:empty($newEmp2/MgrName)) then {
set $chgdEmp2 := fn-bea:delete($chgdEmp2, "MgrName");
} else {
set $chgdEmp2 := fn-bea:replace-value($chgdEmp2, "MgrName", fn:data($newEmp2/MgrName));
};
};
if (not($newEmp2/FirstName eq $oldEmp2/FirstName)) then {
if (fn:empty($oldEmp2/FirstName)) then {
set $chgdEmp2 := fn-bea:insert-into($chgdEmp2, ".", $newEmp2/FirstName);
} else if (fn:empty($newEmp2/FirstName)) then {
set $chgdEmp2 := fn-bea:delete($chgdEmp2, "FirstName");
} else {
set $chgdEmp2 := fn-bea:replace-value($chgdEmp2, "FirstName", $newEmp2/FirstName);
};
};
if (not ($newEmp2/LastName eq $oldEmp2/LastName)) then {
if (fn:empty($oldEmp2/LastName)) then {
set $chgdEmp2 := fn-bea:insert-into($chgdEmp2, ".", $newEmp2/LastName);
} else if (fn:empty($newEmp2/LastName)) then {
set $chgdEmp2 := fn-bea:delete($chgdEmp2, "LastName");
} else {
set $chgdEmp2 := fn-bea:replace-value($chgdEmp2, "LastName", $newEmp2/LastName);
};
};
if (not($newEmp2/Dept eq $oldEmp2/Dept)) then {
if (fn:empty($oldEmp2/Dept)) then {
set $chgdEmp2 := fn-bea:insert-into($chgdEmp2, ".", $newEmp2/Dept);
} else if (fn:empty($newEmp2/Dept)) then {
set $chgdEmp2 := fn-bea:delete($chgdEmp2, "Dept");
} else {
set $chgdEmp2 := fn-bea:replace-value($chgdEmp2, "Dept", $newEmp2/Dept);
};
};
emp2:updateEMP2($chgdEmp2);
} catch (* into $err, $msg, $obj) { fn:error(xs:QName("SECONDARY_UPDATE_FAILURE"),
fn:concat("Update failed on backup copy due to: ", $err, $msg), $obj); };
};
};
If you made it to here, you've read all the material, and tried all the suggested exercises, congratulations! You are now officially a "Master of XQSEs". Open up your resume, search for "Programming Languages", and add "XQSE" to the list. You won't see THAT on just anyone's resume!
With ALDSP 3.0, you can now use XQSE to accomplish all sorts of things: You can use XQSE to write some very interesting read functions that might have been much tougher in XQuery or possibly not even feasible. You can write procedures in XQSE that encapsulate side-effecting behaviors — things you want clients to do, but only through data service operations that you have written and tested and certified as being ready for prime-time.
You can even use XQSE to handle those pesky lightweight ETL tasks that you've faced in the past, this time without having to initiate a six-figure P.O. for yet another enterprise software tool.
Last, but by no means least, you can use XQSE in many different ways to customize updates — either by replacing or augmenting the system's automated update handling logic with your own XQSE code. And, no doubt, there are other possibilities as well — things we have yet to imagine (and perhaps would make us cringe if we did... ). Go forth and see what sorts of interesting new XQSEs you can come up with — and let us know how you like the language!
© BEA Systems | http://docs.oracle.com/cd/E13162_01/odsi/docs10gr3/dsp32wiki/How%20To%20Develop%20Good%20XQSEs.html | CC-MAIN-2016-07 | refinedweb | 8,390 | 50.87 |
You can click on the Google or Yahoo buttons to sign-in with these identity providers,
or you just type your identity uri and click on the little login button.
pylint treat lamba at class level different from a function
in python, they are the same, consider this code:
""" Test lambda in a class """
import pprint
class Test:
""" lambda needs Test instance as first argument """
lam = lambda self, icon: pprint.pprint([self, icon])
def test(self):
""" this works at least in python 2.4 through 2.7 """
self.lam("an icon")
if __name__ == "__main__":
Test().test()
In python (tested 2.4~2.7), Test().test and Test().lam are bound methods and thus Test().test() and Test().lam("anicon") are valid; while Test.test() and Test.lam() are invalid (need instance of Test as first argument).
Pylint doesn't seem to know this w.r.t. lambdas.
It seems Pylint think that lam = at class level is just a member variable, that is treats lam = lambda: ... same as if it was lam = 123.
I would be tempted to flag this usage of lambda as an abuse and poor style.
Ticket #76912 - latest update on 2011/09/23, created on 2011/09/23 by dimaqq@gmail.com
add comment
-
2011/09/23 09:07
I would be tempted to flag this usage of lambda as an abuse and poor style. | https://www.logilab.org/ticket/76912 | CC-MAIN-2017-13 | refinedweb | 229 | 85.69 |
STAT 19000: Project 2 — Spring 2022
Motivation: In Python it is very important to understand some of the data types in a little bit more depth than you would in R. Many of the data types in Python will seem very familiar. A
character in R is similar to a
str in Python. An
integer in R is an
int in Python. A
float in R is similar to a
float in Python. A
logical in R is similar to a
bool in Python. In addition to all of that, there are some very popular classes that are introduced in packages like
numpy and
pandas. On the other hand, there are some data types in Python like
tuples,
lists,
sets, and
dicts that diverge from R a little bit more. It is integral to understand some of these before jumping too far into everything.
Context: This is the second project introducing some basic data types, and demonstrating some familiar control flow concepts, all while digging right into a dataset.
Scope: dicts, sets, pandas, matplotlib
Dataset(s)
The following questions will use the following dataset(s):
/depot/datamine/data/noaa/2020_sample.csv
Questions
Question 1
In the previous project, we started to get a feel for how lists and tuples work. As a part of this, we had you use the
csv package to read in and process data. While this can certainly be useful, and is an efficient way to handle large amounts of data, it takes a lot of work to get the data in a format where you can use it.
As teased in the previous project, Python has a very popular package called
pandas that is popular to use for many data-related tasks. If you need to understand 1 thing about
pandas it would be that it provides 2 key data types that you can take advantage of: the
Series and the
DataFrame types. Each of those objects have a ton of built in attributes and methods. We will talk about this more in the future, but you can think of an attribute as a piece of data within the object. You can think of a method as a function closely associated with the object or class. Just know that the attributes and methods provide lots of powerful features!
Please read the fantastic and quick 10 minute introduction to
pandas here. We will be slowly introducing bits and pieces of this package throughout the semester. In addition, we will also start incorporating some plotting questions throughout the semester.
Read in the dataset:
/depot/datamine/data/noaa/2020_sample.csv using the
pandas package, and store it in a variable called
df.
Remember in the previous project how we had you print the first 10 values of a certain column? This time, use the
head method to print the first 10 rows of data from our dataset. Do you think it was easier or harder than doing something similar using the
csv package?
Code used to solve this problem.
Output from running the code.
View solution
Unresolved include directive in modules/current-projects/pages/19000-s2022-project02.adoc - include::book:projects:example$19000-s2022-project02-q02-sol.adoc[]
Question 2
Imagine going back and using the
csv package to first count the number of rows of data, and then count the number of columns. Seems like a lot of work for just getting a little bit of information about your data, right? Using
pandas this is much easier.
Use one of the attributes from your DataFrame in combination with f-strings to print the following:
There are 123 columns in the DataFrame! There are 321 rows in the DataFrame!
Code used to solve this problem.
Output from running the code.
Question 3
Dictionaries, often referred to as dicts, are really powerful. There are two primary ways to "get" information from a dict. One is to use the get method, the other is to use square brackets and strings. Test out the following to understand the differences between the two.
my_dict = {"fruits": ["apple", "orange", "pear"], "person": "John", "vegetables": ["carrots", "peas"]} # If "person" is indeed a key, they will function the same way my_dict["person"] my_dict.get("person") # If the key does not exist, like below, they will not # function the same way. my_dict.get("height") # Returns None when key doesn't exist print(my_dict.get("height")) # By printing, we can see None in this case my_dict["height"] # Throws a KeyError exception because the key, "height" doesn't exist
Under the hood, a dict is essentially a data structure called a hash table. Hash tables are a data structure with a useful set of properties. The time needed for searching, inserting, or removing a piece of data has a constant average lookup time. This means that no matter how big your hash table grows to be, inserting, searching, or deleting a piece of data will usually take about the same amount of time. (The worst case time increases linearly.) Dictionaries (dict) are used a lot, so it is worthwhile to understand them.
Dicts can also be useful to solve small tasks here and there. For example, what if we wanted to figure out how many times each of the unique
station_id value appears? Dicts are a great way to solve this! Use the provided code to extract a list of
station_id values from our DataFrame. Use the resulting list, a dict, and a loop to figure this out.
import pandas as pd station_ids = df["station_id"].dropna().tolist()
Code used to solve this problem.
Output from running the code.
Question 4
Sets are very useful! I’ve created a nearly identical copy of our dataset here:
/depot/datamine/data/noaa/2020_sampleB.csv. The "sampleB" dataset has one key difference — I’ve snuck in a fake row of data! There is 1 row in the new dataset that is not in the old — it can be identified by having a
station_id that doesn’t exist in the original dataset. Print the "intruder" row of data.
Code used to solve this problem.
Output from running the code.
Question 5
Run the following to see a very simple example of using
matplotlib.
import matplotlib.pyplot as plt # now you can use it, for example plt.plot([1,2,3,5],[5,6,7,8]) plt.show() plt.close()
There are a myriad of great examples and tutorials on how to use
matplotlib. With that being said, it takes a lot of practice to become comfortable creating graphics.
Read through the provided links and search online. Describe something you would like to plot from our dataset. Use any of the tools you’ve learned about to extract the data you want and create the described plot. Do your best to get creative, but know that expectations are low — this is (potentially) the very first time you are using
matplotlib and we are asking you do create something without guidance. Just do the best you can and post questions in Piazza if you get stuck! The "best" plot will get featured when we post solutions after grades are posted.
Code used to solve this problem.
Output from running the code. | https://the-examples-book.com/projects/current-projects/19000-s2022-project02 | CC-MAIN-2022-33 | refinedweb | 1,194 | 73.68 |
Anthony Longo1,792 Points
I know I'm doing something wrong.
I know I'm doing something wrong, I just don't know what. when I run this in workplace I get the right answer but when I try and check it, it says Bummer: didn't get the expected answer.
def combiner(*arg): num = [] stringL = [] strings = "" for item in arg: if isinstance(item,(int,float)): num.append(item) elif isinstance(item,str): stringL.append(item) for items in stringL: strings += items return str("{}{}".format(strings,sum(num)))
1 Answer
KRIS NIKOLAISENPro Student 51,734 Points
The challenge passes in a single list. By using *arg as a parameter you iterate the list as a whole instead of the items within the list. As such item is not an instance of int, float or string. It is an instance of a list. Remove the * so you just have
def combiner(arg):
You can test this in a workspace with a print statement
def combiner(*arg): # try both arg and *arg num = [] stringL = [] strings = "" for item in arg: print(item) # add this if isinstance(item,(int,float)): num.append(item) elif isinstance(item,str): stringL.append(item) elif isinstance(item, list): print("I'm a list") for items in stringL: strings += items return str("{}{}".format(strings,sum(num))) print(combiner(["apple", 5.2, "dog", 8]))
Son-Hai Nguyen1,655 Points
Son-Hai Nguyen1,655 Points
Really? I found this on the internet, and I thought it's pretty the same as what we're trying to do here
So, the challenge passed on a list technically because it was setup that way right? I mean in normal situation I'd to add in as
combiner("apple", 5.2, "dog", 8). The hard brackets feel a bit over-typo to me | https://teamtreehouse.com/community/i-know-im-doing-something-wrong | CC-MAIN-2019-51 | refinedweb | 299 | 75.2 |
a bit tricky. You can do this by using join method, by calling T1.join() from T2 and T2.join() from T3. In this case thread, T1 will finish first, followed by T2 and T3. In this Java multithreading tutorial, we will have a closer look on join method with a simple example. Idea is to illustrate how join method works in simple words. By the way from Java 5 onwards you can also use CountDownLatch and CyclicBarrier classes to implement scenarios like one thread is waiting for other threads to finish thread on which join has called die or wait at most specified millisecond for this thread to die.
/**
* Sample Java class to illustrate How to join two threads in Java.
* join() method allows you to serialize processing of two threads.
*/
public class Join {
If you look at above example, at output, it confirms this theory.
Important point on Thread.join method
Now we know How to use join method in Java, it’s time to see some important points about Thread.join() method.
1. Join is a final method in java.lang.Thread class and you cannot override it.
2) Join method
17 comments :
Nice article on join() method .If you provide more article or information with example on CountDown & Cyclic barrier classes then it would be very useful to us. Thanks
@Chiranjib, Thanks for liking this comment. By the way I do have couple of post on CountDownLatch and CyclicBarrier, You can check this and Ofcourse I will be keep sharing on this topic.
Given Q: “You have three threads T1, T2 and T3, How do you ensure that they finish in order T1, T2, T3 ?.
Given A: You can do this by using join method by calling T3.join() from T2 and T2.join() from T1.
Comment : In this case, won't the finishing order be T3, T2 and T1 rather T1, T2 and T3.
@Anonymous, You are absolutely correct. If we join in that sequence order would be T3, T2 and T1.
Correct answer should be T3.T2.T1 means T2.join() from T3 and T1.join() from T2. In this case T1 will finish first followed by T2 and T3.
That's a good question to ask. Can you share some use cases where join can be used ?
@Anonymous & Javin.. Please find the below code to achieve this...
package saxbean;
import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.Callable;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.Future;
public class ThreadOrdering {
static int NUM_THREADS = 3;
public static void main(String[] args) {
ExecutorService exec = Executors.newFixedThreadPool(NUM_THREADS);
class MyCallable implements Callable {
private final int threadnumber;
MyCallable(int threadnumber){
this.threadnumber = threadnumber;
}
public Integer call() {
System.out.println("Running thread #" + threadnumber);
return threadnumber;
}
}
List> callables =
new ArrayList>();
for(int i=1; i<=NUM_THREADS; i++) {
callables.add(new MyCallable(i));
}
try {
List> results =
exec.invokeAll(callables);
for(Future result: results) {
System.out.println("Got result of thread #" + result.get());
}
} catch (InterruptedException ex) {
ex.printStackTrace();
} catch (ExecutionException ex) {
ex.printStackTrace();
} finally {
exec.shutdownNow();
}
}
}
And finally the result that you will obtain..
Running thread #1
Running thread #3
Running thread #2
Got result of thread #1
Got result of thread #2
Got result of thread #3
At last I hope you guys want to achieve this same thing.
Create 3 threads but dont start them, then go as follows
t1.start();
t1.join();
t2.start();
t2.join();
t3.start();
Thread.join waits for a thread to terminate, so the order is guaranteed
I was reading this article and i fount it very useful. I have this task:
To start service D, service A and B need to be started
To stop service A, service B, D and C must be stopped first
Service B and C can be started in parallel immediately after A has started. Conversely, they can stop in parallel.
Do you have nay suggestions how can i solve it? I'm new in java so i don't know so much things but any advice, suggestions would be useful.
@ SARAL SAXENA
I have doubt on your code, re rewitten below
suppose we execute below code from main method
#1. t1.start();
#2. t1.join();
#3. t2.start();
#4. t2.join();
#5. t3.start();
#6. t3.join();
at #1 t1 started by main thread
at #2 main thread joined after t1, means main thread will wait for t1 to complete
at #3 t2 started by main thread
at #4 main thread joined after t2, means main thread will wait for t2 to complete
so up to line 4 main thread is waiting for both t1 and t2 to finish their execution
but
It doesn't mean that t2 waiting for t1 to complete, and same thing for line 5 and 6
at the end of line 6 main thread is waiting for t1, t2 and t3
So my question is how we can guaranty that t2 will execute after t1 and t3 will execute after t2 , because no where we its written like t3.join() from t2 and t2.join() from t1 ?
@Anonymous
Doesn't main thread wait for t1 to finish execution before it even starts t2? So if main starts one thread and waits for it to terminate before starting the next thread, how is the sequence not guaranteed?
This defeats the point of threading. Only 1 thread will be doing using work at any point in time.
This doesn't ensure that the threads complete execution in the required order, only that the execution results are fetched in that order. (Try printing the system time before returning in call()).
I would suggest that you stop confusing people and get your basics right.
public class HelloWorld implements Runnable{
public void run()
{
for(int i=0;i<=5;i++)
{
try{
Thread.sleep(1000);
System.out.println("I am from run() :" +i);
}catch(Exception e){System.out.println(e);}
}
}
public static void main(String []args){
HelloWorld h1=new HelloWorld();
Thread t1=new Thread(h1);
Thread t2=new Thread(h1);
Thread t3=new Thread(h1);
t1.setPriority(10);
t1.start();
try{
System.out.println("t1");
t1.join();
}catch(Exception e){System.out.println(e);}
t2.start();
try{
System.out.println("t2");
t2.join();
}catch(Exception e){System.out.println(e);}
t3.start();
try{
System.out.println("t3");
t3.join();
}catch(Exception e){System.out.println(e);}
System.out.println("I am from main()");
}
}? | http://javarevisited.blogspot.com/2013/02/how-to-join-multiple-threads-in-java-example-tutorial.html?showComment=1391527152145 | CC-MAIN-2016-18 | refinedweb | 1,080 | 67.96 |
java.lang.Object
Class
protected Object clone()
throws CloneNotSupportedException
Cloneable
DecimalFormat percent = new DecimalFormat ( "0%" ) ;
I can think of 6 possible ways: 1. call new ( ) which calls a constructor of a class 2. In a singleton class, call method named getInstance ( ) which returns a reference to a new single object the first time it is called. But, under the hood, it still calls the private constructor. Singleton is a pattern, meaning there is only one instance of the object. [ NB: on subsequent calls, getInstance ( ) returns the same singleton object, so the object is no longer "a newly created object". ] 3. Deserialize a object from data that is stored within a byte [ ] array, stored within a disk file, or has been received from some network prototocol ( for example, from a socket that uses TCP/IP protocol. ) . 4. Call a method which returns a created object. ( This might not be a fair answer, since the called method has to do 1, 2, or 3 internally ) . 5. Use reflection: 6. Use dynamic proxy object:
public boolean equals(Object obj)
Hashtable
hashCode()
// The key is to make sure that two equals objects have matching // hashCode ( ) s as well public boolean equals ( Object o ) { if ( o == null || ! ( o instanceof ThisClass ) ) { return false; } if ( aField != o.aField ) { // and so on return false; } // ASSERT o.hashCode ( ) == hashCode ( ) return true; }
public static boolean equals ( Collection c1, Collection c2 ) { boolean result = false; if ( c1.getClass ( ) != c2.getClass ( ) ) return false; Object [ ] o1 = ( Object [ ] ) c1.toArray ( new Object [ c1.size ( ) ] ) ; Object [ ] o2 = ( Object [ ] ) c2.toArray ( new Object [ c2.size ( ) ] ) ; result = equals ( o1, o2 ) ; return result; } public static boolean equals ( Object [ ] c1, Object [ ] c2 ) { if ( c1.length != c2.length ) { // could drop this check for fixed-length keys return false; } if ( c1 == c2 ) return true; if ( null == c1 || null == c2 ) return false; for ( int i = 0, len = c1.length; i < len; i++ ) { // could skip invariants if ( !equals ( c1 [ i ] ,c2 [ i ] ) ) { return false; } } return true; }
protected void finalize()
throws Throwable
Finalizers are unpredictable, often dangerous, and generally unnecessary. ... Finalizers have a few valid uses, which we'll cover later in this item, but as a rule of thumb, finalizers should be avoided. Further, System.gc and System.runFinalization may increase the odds of finalizers getting executed, but they don't guarantee it.
I suffered lots of OutOfMemory. What I finally figured out was that all the memory was sitting around waiting to be finalized. I had many threads creating garbage that needed to be finalized ( on a multi-processor server ) , and apparently on a single "low-priority" finalizer thread trying to clean up after the fact. My workaround consists of this code ( which I call each time my servlet is invoked ) : /** * A class to make the finalizer thread max priority. */ public static class finalizer_max { public void finalize ( ) { Thread.currentThread ( ) .setPriority ( Thread.MAX_PRIORITY ) ; } } /** * True if finalize already fixed. */ private static boolean finalize_fixed = false; /** * Fix the finalize problem. */ private synchronized static void fixFinalize ( ) { if ( !finalize_fixed ) { // Initialize the finalizer thread. We need to bump up the priority // to make sure stuff gets finalized finalizer_fixed = true; new finalizer_max ( ) ; System.gc ( ) ; System.runFinalization ( ) ; } }
public final Class<? extends Object> getClass()
import java.lang.*; import java.lang.reflect.* ; public class try1 { public static void main ( String [ ] args ) throws Exception { try1 t = new try1 ( ) ; t.processActions ( t ) ; } public void processActions ( Object obj ) throws Exception { Method m = obj.getClass ( ) .getMethod ( "systemOut",null ) ; m.invoke ( obj, new Object [ ] { } ) ; } public void systemOut ( ) { System.out.println ( "Hello" ) ; } }
There's a getClass ( ) method for getting the Class object of a given object, but this means you have to have an instance of the object first. But what if you just want to compare a Class variable to an existing class ( like instanceof but without having an instance ) or you want the Class object of a static class ( i.e. a class without instances ) ? There is a special language construct for getting the class object of a given class: < classname > .class. So, if we want the class object of, say, System: Class systemclass = System.class; The notation suggests that class is actually a public static field of Object, but this is not so. If you want the class field of an object, use getClass ( ) .
public int hashCode()
equals(java.lang.Object)
public final void notify()
wait()
notifyAll()
public final void notifyAll()
notify()
this class shows the difference between notify ( ) and notifyAll ( ) public class Test { public void go ( ) { Test test = new Test ( ) ; ( new Thread1 ( test ) ) .start ( ) ; ( new Thread2 ( test ) ) .start ( ) ; ( new Notifier ( test ) ) .start ( ) ; } class Thread1 extends Thread { Test t; Thread1 ( Test t ) { this.t = t; } public void run ( ) { try { t.wait ( 5000 ) ; } catch ( InterruptedException ie ) { } System.out.println ( "thread 1" ) ; } } class Thread2 extends Thread { Test t; Thread2 ( Test t ) { this.t = t; } public void run ( ) { try { t.wait ( 5000 ) ; } catch ( InterruptedException ie ) { } System.out.println ( "thread 2" ) ; } } class Notifier extends Thread { Test t; Notifier ( Test t ) { this.t = t; } public void run ( ) { synchronized ( t ) { t.notify ( ) ; } } } } If you call the go ( ) method, then only one thread will awake. If you put t.notifyAll ( ) , instead of t.notify ( ) then the 2 threads will awake
class Test2 { int a =0; public static void main ( String [ ] args ) { new Test2 ( ) .go ( ) ; } public void go ( ) { Test2 test = new Test2 ( ) ; ( new Thread1 ( test ) ) .start ( ) ; ( new Thread2 ( test ) ) .start ( ) ; ( new Notifier ( test ) ) .start ( ) ; } class Thread1 extends Thread { Test2 t; Thread1 ( Test2 t ) { this.t = t; } public void run ( ) { synchronized ( t ) { try { t.wait ( 5000 ) ; t.wait ( 5000 ) ; } catch ( InterruptedException ie ) { } t.a=1; System.out.println ( "thread 1"+t.a ) ; } } } class Thread2 extends Thread { Test2 t; Thread2 ( Test2 t ) { this.t = t; } public void run ( ) { synchronized ( t ) { try { t.wait ( 5000 ) ; } catch ( InterruptedException ie ) { } t.a=2; System.out.println ( "thread 2"+t.a ) ; } } } class Notifier extends Thread { Test2 t; Notifier ( Test2 t ) { synchronized ( t ) { this.t = t; } } public void run ( ) { synchronized ( t ) { t.notifyAll ( ) ; } } } } Hello just to say that wait ( ) methode need a synchronized block.
public Object()
/** * Illustrates fine-grained locking. */ //The explicit block is better than the standard implementation ( synchronizing all methods ) //because both methods can run concurrently, which reduces locking costs and //increases scalability. The caveat is that you can't have two threads invoking //the same method on the same object, which is the consistency we want to enforce. import java.util.Date; public class Person1 { private String name, surname; private Date birth, death; private final Object nameLock = new Object ( ) , dateLock = new Object ( ) ; /** * This setter can run asynchronously * with setDates ( ) . */ public void setNames ( String name, String surname ) { synchronized ( nameLock ) { this.name = name; this.surname = surname; } } /** * This setter can run asynchronously * with setNames ( ) . */ public void setDates ( Date birth, Date death ) { synchronized ( dateLock ) { this.birth = birth; this.death = death; } } }
public String toString()
public final class Tex3 { private boolean flag=false; public void sample ( ) { Inner in1=new Inner ( ) ; System.out.println ( "Sample \t"+in1 ) ; } public static void main ( String a [ ] ) { Tex3 e1=new Tex3 ( ) ; e1.sample ( ) ; } } class Inner { private boolean flag1=false; int i=555; public String toString ( ) { if ( flag1 ) return "true"+i; else return "false"+i; } }
public final void wait()
throws InterruptedException
java.lang.Object sync = new java.lang.Object ( ) ; synchronized ( sync ) { sync.wait ( ) ; }
public final void wait(long timeout)
throws InterruptedException
interrupted
Unlike sleep ( 1000 ) which puts thread aside for exactly one second. wait ( 1000 ) causes a wait of up to one second. A thread could stop waiting earlier if it receives the notify ( ) or notifyAll ( ) call.
public final void wait(long timeout,
int nanos)
throws InterruptedException
wait(long)
Java API By Example, From Geeks To Geeks. | Our Blog | Conditions of Use | About Us | | http://kickjava.com/1241.htm | CC-MAIN-2017-43 | refinedweb | 1,253 | 59.5 |
Hi, I have a questions about NVIDIA apex
I know NVIDIA apex package creates each process per gpu, like this
so, each process are referred as local_rank variable in my code
I want to save best accuracy from each process and i coding like below
When i Using 2 gpus
for epochs in range(0, args.epoch): train() test() ... save_best()
def save_best(): # 1'th gpu if args.local_rank == 0: is_best = test_acc > best_acc best_acc = max(test_acc, best_acc) if is_best: torch.save(...) # 2'th gpu if args.local_rank == 1: is_best = test_acc > best_acc best_acc = max(test_acc, best_acc) if is_best: torch.save(...)
After 1 epoch I can verify each accuracy
0’th gpu’s accuracy is 19.906, It is saved 0’th weight file
1’th gpu’s accuracy is 19.269, It is saved 1’th weight file
But, When i loading weight file and adapt to network, test accuracy is not equal to each result
I got 19.572(0’th file), 19.561(1’th file)
Surprisingly, When i using 1 gpu for training, the situation that i mentioned above is not happened(test accuracy while training is equal to accuracy which is loading from weight file)
I can’t understand why this situation is happened.
Any body can help? | https://discuss.pytorch.org/t/using-nvidia-apex-for-training-i-cannot-get-same-accuracy-after-training/95632/2 | CC-MAIN-2022-05 | refinedweb | 210 | 81.33 |
Proposed features/Piste Maps
From OpenStreetMap
This proposal is for a whole set of tags that are required to describe piste maps.
Last winter (2005/6) some experiments were performed to record tracks and tag piste maps. This proposal builds on that experience but takes into account the development of additional techniques (such as areas) that have been developed since then.
Tag prefix
Piste map specific tags will use the piste: namespace to avoid potential conflicts with similar tags used in other contexts (eg capacity, speed, classification).
Areas
- landuse=winter_sports
- name=name of resort or ski area (eg Espace Killy)
- natural=glacier to define the extent of a glacier
aerialway
Key:aerialway has already been accepted onto Map Features, but this proposal involves making the following changes to that key:
- Split 'gondola' off as a new value, distinct from 'cable_car'
- Remove 'drag_lift' value, since this is a type of surface lift, not an "aerialway"
- ...and additionally add 'pylon' and 'station' node value
The resulting set of values would be as follows:
Surface lifts
Lift attributes
The start and end nodes of a way tagged as a piste:lift are assumed to be a station. These nodes may have their elevation documented with ele=*
Railways
railway=incline for funiculars and other cable or rack driven railways which are not connected to a main line, as might exist at a ski area.
Pistes
A piste may be a route through a variety of different terrains. It might be a meadow or a mountain road or part of a glacier. Pistes may be defined as ways or as areas:
Additional tags for pistes:
- piste:difficulty=
Other
- ski school (building=yes, amenity=ski_school)
- ticket office (shop=ticket)
- mountain restaurant (amenity=restaurant, building=yes)
- viewpoint (tourism=viewpoint)
- mountain rescue (amenity=mountain_rescue)
- mountain hut/refuge (amenity=shelter)
- bobsled track (sport=bobsled))
namings "piste:"
- I would replace piste: which is too generic, by ski:, and alpine by downhill. Alpine would refer to alpine skiing, ski mountaineering, alpine touring or whatever you call climbing mountains in winter with ski. There are also at last two kinds of ski piste: ones that are prepared, marked, watched by ski patrol, you have to pay a fee, the others are generally only marked, but your on your own. This apply to both nordic and downhill ski. Additionnaly, you also have mountain route (in the Alps, Scandinavia,etc.) which are the standard route (usual path) to climb a summit, a pass, between two huts, etc. Gummibaerli 16:57, 15 December 2007 (UTC)
- Is there a situation where piste does not refer to a ski trail? --Hawke 13:19, 21 December 2007 (UTC)
- Us snowboarders use pistes as well - not just skiers, we don't like terms that contain the word ski (ski resort, ski run, ski lift, etc). It's too discriminatory. 80n 18:51, 4 January 2008 (UTC)
- To me piste means track, ground, strip, but I am not a native speaker. It's probably more specific in English than in most langages. Gummibaerli 12:28, 6 January 2008 (UTC)
- I think the idea is that the bit before the colon acts as a high-level seperator. If you're interested in rendering a a piste map, you might look for all tags with 'piste:' prefix. For more conventional maps you might ignore them. To split it by different piste types would make this less effective.
- I'm a bit undecided about whether this ':' namespacing is a good idea, but I found myself adopting it for my tagging of whitewater maps. It makes it clear that you're tagging something which is not necessarily of interest to people rendering a street map.
- ...and given that we're looking for an english word which encompasses all different types of skiing and snowboarding (being deliberately generic) we could use "snowsports", but "piste" is also reasonable choice I think. "piste" might mean track/ground/strip as a direct translation, but generally if someone says "piste" you're more or less always talking about skiing/snowboarding.
- -- Harry Wood 12:00, 2 April 2008 (BST)
Slope Difficulty Taggging
-)
Buildings
When you say man_made=building, you mean building=yes? (add some attributes) Ojw 21:55, 1 April 2008 (BST) | http://wiki.openstreetmap.org/index.php/Proposed_features/Piste_Maps | crawl-001 | refinedweb | 702 | 57.5 |
OPTIONS(4) BSD Programmer's Manual OPTIONS(4)
options - miscellaneous kernel configuration options
option ...
This manual page describes a number of miscellaneous kernel configuration options that may be specified in a kernel config file. See config(8) for information on how to configure and build kernels. Note: options are passed to the compile process as -D flags to the C compiler.
option COMPAT_LINUX On those architectures that support it, this enables binary compatibility with Linux ELF and a.out applications built for the same architecture. This option is supported on the i386 architecture. See compat_linux(8). This option also enables execution of ET_DYN binaries, such as ld- linux.so.2. option COMPAT_OPENBSD This enables binary compatibility with OpenBSD applications built for the same architecture. This option is available on all architectures. See compat_openbsd(8).
option DDB Compiles in a kernel debugger for diagnosing kernel problems. See ddb(4) for details. Note: not available on all architectures. option DDB_SAFE_CONSOLE Allows a break into the kernel debugger during boot. Useful when debug- ging problems that can cause init(8) to fail. option KGDB Compiles in a remote kernel debugger stub for diagnosing kernel problems using the "remote target" feature of gdb. See kgdb(7) for details. Note: not available on all architectures. makeoptions DEBUG="-g" The -g flag causes bsd.gdb to be built in addition to bsd. bsd.gdb is useful for debugging kernels and their crash dumps with gdb. Note that gdb(1)'s -k flag is obsolete and should not be used. Instead, a crash dump can be debugged by starting gdb(1) with the kernel name as an argu- ment (no core file) and then use the gdb(1) command "target kcore COREFILE". option DEBUG Turns on miscellaneous kernel debugging. Since options are turned into preprocessor defines (see above), option DEBUG is equivalent to doing a #define DEBUG throughout the kernel. Much of the kernel has #ifdef DEBUG conditional debugging code. Note that many parts of the kernel (typically device drivers) include their own #ifdef XXX_DEBUG conditionals instead. This option also turns on certain other options, notably option KMEMSTATS, which may decrease system performance. option DIAGNOSTIC Adds code to the kernel that does internal consistency checks. This code will cause the kernel to panic if corruption of internal data structures is detected. option SMALL_KERNEL Removes some optimizations from the kernel to reduce the size of the resulting kernel binary. This option can decrease system performance. option NO_PROPOLICE Do not compile the kernel with the propolice stack protection. See gcclocal(1) for more information about propolice. option GPROF Adds code to the kernel for kernel profiling with kgmon(8). makeoptions PROF="-pg" The -pg flag causes the kernel to be compiled with support for profiling. The option GPROF is required for the kernel compile to succeed. option KTRACE Adds hooks for the system call tracing facility, which allows users to watch the system call invocation behavior of processes. See ktrace(1) for details. option PTRACE Adds hooks for the process tracing facility, allowing a process to con- trol and observe another process. See ptrace(2) for details. option RAIDDEBUG Be verbose on what RAIDframe does. See raid(4) for details.
option FFS Includes code implementing the Berkeley Fast File System (FFS). Most machines need this if they are not running diskless. option EXT2FS Includes code implementing the Second Extended File System (EXT2FS). This is the most commonly used file system on the Linux operating system, and is provided here for compatibility. Some specific features of EXT2FS like the "behavior on errors" are not implemented. This file system can't be used with uid_t or gid_t values greater than 65535. Also, the filesystem will not function correctly on architectures with differing byte-orders. That is, a big-endian machine will not be able to read an ext2fs filesys- tem created on an i386 or other little-endian machine. See mount_ext2fs(8) for details. option MFS Include the memory file system (MFS). This file system stores files in swappable memory, and produces notable performance improvements when it is used as the file store for /tmp or similar mount points. See mount_mfs(8) for details. option NFSCLIENT Include the client side of the NFS (Network File System) remote file sharing protocol. Although the bulk of the code implementing NFS is ker- nel based, several user level daemons are needed for it to work. See mount_nfs(8) for details on NFS. option CD9660 Includes code for the ISO 9660 + Rock Ridge file system, which is the standard file system used on many CD-ROMs. It also supports Joliet exten- sions. See mount_cd9660(8) for details. option MSDOSFS Includes support for the MS-DOS FAT file system. The kernel also imple- ments the Windows 95 extensions which permit the use of longer, mixed- case file names. See mount_msdos(8) and fsck_msdos(8) for details. option NTFS Includes support for reading NTFS file systems. Experimental and read only. See mount_ntfs(8) for details. option FDESC Includes code for a file system which can be mounted on /dev/fd. This filesystem permits access to the per-process file descriptor space via special files in the file system. See mount_fdesc(8) for details. Note that this facility is redundant, and thus unneeded on most OpenBSD sys- tems, since the fd(4) pseudo-device driver already provides identical functionality. On most systems, instances of fd(4) are mknoded under /dev/fd/ and on /dev/stdin, /dev/stdout, and /dev/stderr. option KERNFS Includes code which permits the mounting of a special file system (nor- mally mounted on /kern) in which files representing various kernel vari- ables and parameters may be found. See mount_kernfs(8) for details. option NULLFS Includes code for a loopback file system. This permits portions of the file hierarchy to be re-mounted in other places. The code really exists to provide an example of a stackable file system layer. See mount_null(8) for details. option PORTAL Includes the (experimental) portal filesystem. This permits interesting tricks like opening TCP sockets by opening files in the file system. The portal file system is conventionally mounted on /p and is partially im- plemented by a special daemon. See mount_portal(8) for details. option PROCFS Includes code for a special file system (conventionally mounted on /proc) in which the process space becomes visible in the file system. Among oth- er things, the memory spaces of processes running on the system are visi- ble as files, and signals may be sent to processes by writing to ctl files in the procfs namespace. See mount_procfs(8) for details. option UMAPFS Includes a loopback file system in which user and group IDs may be remapped -- this can be useful when mounting alien file systems with dif- ferent uids and gids than the local system (eg, remote NFS). See mount_umap(8) for details. option UNION- able file system on top of the read-only file system. This filesystem is still experimental and is known to be somewhat unstable. See mount_union(8) for details.
option FFS_SOFTUPDATES Enables a scheme that uses partial ordering of buffer cache operations to allow metadata updates in FFS to happen asynchronously, increasing write performance significantly. Normally, the FFS filesystem writes metadata updates synchronously which exacts a performance penalty in favor of filesystem integrity. With soft updates, the performance of asynchronous writes is gained while retaining the safety of synchronous metadata up- dates. Soft updates must be enabled on a per-filesystem basis. See mount(8) for details. Processors with a small kernel address space, such as the sun4 and sun4c, do not have enough kernel memory to support soft updates. Attempts to use this option with these CPUs will cause a kernel hang or panic after a short period of use as the kernel will quickly run out of memory. This is not related to the amount of physical memory present in the machine -- it is a limitation of the CPU architecture itself. option BUFCACHEPERCENT=integer Percentage of RAM to use as a file system buffer. It defaults to 5. option. option QUOTA Enables kernel support for file system quotas. See quotaon(8), edquota(8), repquota(8), and quota(1) for details. Note that quotas only work on "ffs" file systems, although rpc.rquotad(8) permits them to be accessed over NFS. option FIFO Adds support for AT&T System V UNIX style FIFOs (i.e., "named pipes"). This option is recommended in almost all cases as many programs use these. option EXT2FS_SYSTEM_FLAGS This option changes the behavior of the APPEND and IMMUTABLE flags for a file on an EXT2FS filesystem. Without this option, the superuser or owner of the file can set and clear them. With this option, only the superuser can set them, and they can't be cleared if the securelevel is greater than 0. See also chflags(1). option UFS_EXTATTR This option enables Extended Attribute support for UFS filesystems. option UFS_EXTATTR_AUTOSTART This option causes Extended Attributes to be started and enabled when each UFS filesystem is mounted. The attribute storage is expected to be (relative to mount point) /.attribute/{system|user}/<attrname> option UFS_DIRHASH This option enables using an in memory hash table to speed lookups in large directories.
option PCIVERBOSE Makes the boot process more verbose for PCI peripherals (vendor names and other information is printed, etc.). option PCMCIAVERBOSE Makes the boot process more verbose for PCMCIA peripherals. option MACOBIOVERBOSE Makes the boot process more verbose for Mac OBIO peripherals. option APERTURE Provide in-kernel support for controlling VGA framebuffer mapping and PCI configuration registers by user-processes (such as an X Window System server). This option is supported on the alpha, i386, macppc, and sparc64 architectures. option LKM Enables support for loadable kernel modules. See lkm(4) for details. Note: This option is not yet available on all architectures. option CRYPTO Enables support for the kernel cryptographic framework. See crypto(9) for details. While not IP specific, this option is usually used in conjunc- tion with option IPSEC. option INSECURE Hardwires the kernel security level at -1. This means that the system al- ways runs in securelevel 0 mode, even when running multiuser. See init(8) for details on the implications of this. The kernel secure level may be manipulated by the superuser by altering the kern.securelevel sysctl variable. (It should be noted that the securelevel may only be lowered by a call from process ID 1, i.e., init(8).) See also sysctl(8) and sysctl(3). option CCDNBUF=integer The ccd(4) device driver uses "component buffers" to distribute I/O re- quests to the components of a concatenated disk. It keeps a freelist of buffer headers in order to reduce use of the kernel memory allocator. CCDNBUF is the number of buffer headers allocated on the freelist for each component buffer. It defaults to 8. option KMEMSTATS The kernel memory allocator, malloc(9), will keep statistics on its per- formance if this option is enabled. Unfortunately, this option therefore essentially disables MALLOC() and FREE() forms of the memory allocator, which are used to enhance the performance of certain critical sections of code in the kernel. This option therefore can lead to a significant de- crease in the performance of certain code in the kernel if enabled. Exam- ples of such code include the namei() routine, the ccd(4) driver, the ncr(4) driver, and much of the networking code. Note that this option is silently turned on by the DEBUG option. option BOOT_CONFIG Adds support for the -c boot option (User Kernel Config). Allows modifi- cation of kernel settings (e.g., device parameters) before booting the system. option RAID_AUTOCONFIG Adds support for auto-configuring the RAIDframe devices during the kernel initialization. See raid(4) and raidctl(8) for details. option UVM_SWAP_ENCRYPT Enables kernel support for encrypting pages that are written out to swap storage. Swap encryption prevents sensitive data from remaining on the disk even after the operating system has been shut down. This option should be turned on if cryptographic filesystems are used. The sysctl variable vm.swapencrypt.enable controls its behaviour. See sysctl(8) and sysctl(3) for details. option USER_PCICONF Enables the user level access to the PCI bus configuration space through ioctls on the /dev/pci device. It's used by the XFree86(1) server on some architectures. See pci(4) for details. option PCIAGP Enables ioctl(2) access to the AGP GART on the supported chipsets. It's used by the XFree86(1) server on some architectures. See vga(4) for de- tails. option INCLUDE_CONFIG_FILE Includes the configuration file given to config(8) in the kernel image. It can be recovered later by executing strings -n4 /bsd | sed -n 's/^=CF=//p'
option IPFORWARDING Enables IP routing behavior. With this option enabled, the machine will forward IP datagrams between its interfaces that are destined for other machines. Note that even without this option, the kernel will still for- ward some packets (such as source routed packets) -- removing IPFORWARDING is insufficient to stop all routing through a bastion host on a firewall -- source routing is controlled independently.. option MROUTING Includes support for IP multicast routers. INET should be set along with this. Multicast routing is controlled by the mrouted(8) daemon. option INET Includes support for the TCP/IP protocol stack. This option is currently required. See inet(4) for details. option INET6 Includes support for the IPv6 protocol stack. See inet6(4) for details. Unlike INET, INET6 enables multicast routing code as well. This option requires INET at this moment, but it should not. option ND6_DEBUG The option sets the default value of net.inet6.icmp6.nd6_debug to 1, for debugging IPv6 neighbor discovery protocol handling. See sysctl(3) for details. option IPX, IPXIP Include support for Internetwork Packet Exchange protocol commonly in use by Novell NetWare. option NETATALK Include kernel support for the AppleTalk family of protocols. This suite of supporting code is sometimes called netatalk support. option TCP_COMPAT_42 Use of this option is extremely discouraged, so it should not be enabled. If any other machines on the network require enabling this, it's recom- mended that they be disconnected from the network. will not respond. option TCP_SACK Turns on selective acknowledgements. Additional information about seg- ments already received can be transmitted back to the sender, thus indi- cating segments that have been lost and allowing for a swifter recovery. Both communication endpoints need to support SACK. The fallback behaviour is NewReno fast recovery phase, which allows one lost segment to be recovered per round trip time. When more than one segment has been dropped per window, the transmission can continue without waiting for a retransmission timeout. option TCP_FACK Turns on forward acknowledgements allowing a more precise estimate of outstanding data during the fast recovery phase by using SACK informa- tion. This option can only be used together with TCP_SACK. option TCP_ECN Turns on Explicit Congestion Notification (RFC 3168). ECN allows inter- mediate routers to use the Congestion Experienced codepoint in the IP header as an indication of congestion, and allows TCP to adjust the transmission rate using this signal. Both communication endpoints nego- tiate enabling ECN functionality at the TCP connection establishment. option TCP_SIGNATURE Turns on support for the TCP MD5 Signature option (RFC 2385). This is used by Internet backbone routers to provide per-packet authentication for the TCP packets used to communicate BGP routing information. You will also need a routing daemon that supports this option in order to actually use it. option PPP_FILTER This option turns on pcap(3) based filtering for ppp connections. This option is used by pppd(8) which needs to be compiled with PPP_FILTER de- fined (the current default). option PPP_BSDCOMP Enables BSD compressor for PPP connections. option PPP_DEFLATE This option is currently not supported in MirOS. option IPSEC This option enables IP security protocol support. See ipsec(4) for more details. option ENCDEBUG This option enables debugging information to be conditionally logged in case IPSEC encounters errors. The option IPSEC is required along with this option. Debug logging can be turned on/off through the use of the net.inet.ip.encdebug sysctl variable. If net.ipsec.encap.encdebug is 1, debug logging is on. See sysctl(8) and sysctl(3) for details. option KEY Enables PFKEYv2 (RFC 2367) support. While not IP specific, this option is usually used in conjunction with option IPSEC. option ALTQ Enables ALTQ (Alternate Queuing). See pfctl(8) and pf.conf(5) to set up the interface transmission rate and queueing disciplines. ALTQ_CBQ, ALTQ_RED, ALTQ_PRIQ and ALTQ_HFSC are enabled by default with option ALTQ in OpenBSD. See altq(9) for details on ALTQ. option ALTQ_RIO Enables ALTQ's RIO (RED with In/Out) module. The original RIO has 2 sets of RED parameters; one for in-profile packets and the other for out-of- profile packets. At the ingress of the network, profile meters tag pack- ets as IN or OUT based on contracted profiles for customers. Inside the network, IN packets receive preferential treatment by the RIO dropper. ALTQ/RIO has 3 drop precedence levels defined for the Assured Forwarding PHB of DiffServ (RFC 2597). option ALTQ_NOPCC Disables use of processor cycle counter (e.g., Pentium TSC on i386 and PCC on alpha) to measure time in ALTQ. This option should be defined for a non-Pentium i386 CPU which does not have TSC, SMP (per-CPU counters are not in sync), or power management which affects processor cycle counter.
option SCSITERSE Terser SCSI error messages. This omits the table for decoding ASC/ASCQ info, saving about 30KB. option SCSIDEBUG Enable printing of SCSI subsystem debugging info to the console. Each of SCSIDEBUG_LEVEL, SCSIDEBUG_BUSES, SCSIDEBUG_TARGETS and SCSIDEBUG_LUNS must have non-zero values for any debugging info to be printed. Only SCSI_DEBUG_LEVEL has a default value that is non-zero. option SCSIDEBUG_LEVEL=value Define which of the four levels of debugging info are printed. Each bit enables a level, and multiple levels are specified by setting multiple bits. 0x0010 (SDEV_DB1) SCSI commands, errors, and data 0x0020 (SDEV_DB2) routine flow 0x0040 (SDEV_DB3) routine internals 0x0080 (SDEV_DB4) miscellaneous addition debugging If SCSIDEBUG_LEVEL is undefined, a value of 0x0030 (SDEV_DB1|SDEV_DB2) is used. option SCSIDEBUG_BUSES=value Define which SCSI buses will print debug info. Each bit enables debugging info for the corresponding bus. e.g. a value of 0x1 enables debug info for bus 0. option SCSIDEBUG_TARGETS=value Define which SCSI targets will print debug info. Each bit enables debug- ging info for the corresponding target. option SCSIDEBUG_LUNS=value Define which SCSI luns will print debug info. Each bit enables debugging info for the corresponding lun. option SCSIFORCELUN_BUSES=value Define which SCSI buses will do full lun scanning. SCSIFORCELUN_TARGETS must also be set to a non-zero value for this option to take effect. Each bit enables a full lun scan for the corresponding SCSI bus. The lun scan normally terminates if identical INQUIRY data is seen for lun 0 and another lun, as this usually means the target cannot distinguish between different luns. But some devices (e.g. some external RAID devices) can legitimately supply identical INQUIRY data for several luns. option SCSIFORCELUN_TARGETS=value Define which SCSI targets will do full lun scanning. SCSIFORCELUN_BUSES must also be set to a non-zero value for this option to have any effect. Each bit enables a full lun scan for the corresponding target on the buses specified by SCSIFORCELUN_BUSES. VFORK_SHM Allows for evil things with vfork(2). Normally, doing anything else after a vfork than execve(2) family call or _exit(2) is undefined. With this option, the old-fashioned behaviour of the child and parent sharing the memory until the lock is released is restored. This will break on some arches. option SYSVSHM Includes support for AT&T System V UNIX style shared memory. See shmat(2), shmctl(2), shmdt(2), shmget(2). SEMMNI=value Number of semaphore identifiers (also called semaphore handles and sema- phore sets) available in the system. Default value is 10. The kernel al- locates memory for the control structures at startup, so arbitrarily large values should be avoided. option SEMMNS=value Maximum number of semaphores in all sets in the system. Default value is 60. option SEMMNU=value Maximum number of semaphore undo structures in the system. Default value is 30. option SEMUME=value Maximum number of per-process undo operation entries in the system. Sema- phore undo operations are invoked by the kernel when semop(2) is called with the SEM_UNDO flag and the process holding the semaphores terminates unexpectedly. Default value is 10.
option NKMEMPAGES=value option NKMEMPAGES_MIN=value option NKMEMPAGES_MAX=value Size of kernel malloc area in PAGE_SIZE-sized logical pages. This area is covered by the kernel submap kmem_map. The kernel attempts to auto-size this map based on the amount of physical memory in the system. provid- ed in the event the computed value is insufficient resulting in an "out of space in kmem_map" panic. option NBUF=value option BUFPAGES=value These options set the number of pages available for the buffer cache. Their default value is a machine dependent value, often calculated as between 5% and 10% of total available RAM. option DUMMY_NOPS This option is supported on the i386 architecture. When enabled, it speeds up interrupt processing by removing delays while accessing the in- terrupt controller. Care should be taken when using this option. option APM_NOPRINT This option is supported on the i386 architecture. When enabled, kernel messages regarding the status of the automatic power management system (APM) are suppressed. APM status can still be obtained using apm(8) and/or apmd(8). option "TIMEZONE=value" value indicates the timezone offset of hardware realtime clock device, in minutes, from UTC. It is useful when hardware realtime clock device is configured with local time, when dual-booting OpenBSD with other operat- ing systems on a single machine. For instance, if hardware realtime clock is set to Tokyo time, value should be -540 as Tokyo local time is 9 hours ahead of UTC. Double quotes are needed when specifying a negative value.
gcc-local(1), gdb(1), ktrace(1), quota(1), gettimeofday(2), i386_iopl(2), msgctl(2), msgget(2), msgrcv(2), msgsnd(2), ptrace(2), semctl(2), semget(2), semop(2), shmat(2), shmctl(2), shmdt(2), shmget(2), sysctl(3), ddb(4), inet(4), ipsec(4), iso(4), lkm(4), ns(4), pci(4), xf86(4), X(7), apm(8), apmd(8), config(8), edquota(8), init(8), mount_cd9660(8), mount_fdesc(8), mount_kernfs(8), mount_mfs(8), mount_msdos(8), mount_nfs(8), mount_null(8), mount_portal(8), mount_procfs(8), mount_umap(8), mount_union(8), mrouted(8), quotaon(8), rpc.rquotad(8), sysctl(8), altq(9)
The options man page first appeared in OpenBSD 2.3.
The INET option should not be required. MirOS BSD #10-current March 21, 2004. | http://mirbsd.mirsolutions.de/htman/sparc/man4/options.htm | crawl-003 | refinedweb | 3,805 | 50.12 |
Magic memoryview() style casting for Cython
A helper / hack to allow us to cast a mmap.mmap or other buffer to a Cython pointer of the correct type.
Cython is capable of casting a lot of things to a C pointer of the correct type, especially with the aid of memoryview. However, in Python 2, memoryview lacks the memoryview.cast method (so Cython won’t let us change the dimensions of the array). Further, both Python 2 and 3 require the memory map to be writable (making the pointer type const does not seem to help here either).
This class takes a (possibly read-only) memmap object, and produces a Python object with a __getbuffer__ method that returns The Right Thing. It pretends that the underlying buffer is writable to make Cython happy. If you give it a read-only buffer, and try to write to the result, then you will have a bad time.
When a Python object is cast by Cython to a pointer, it holds a reference to the underlying Python object in order to prevent the memory to which it refers being garbage collected. The MagicMemoryView in turn keeps a reference to the underlying data, so everything should behave as expected.
Usage:
from magicmemoryview import MagicMemoryView cdef double data[:, :, :] data = MagicMemoryView(source_buffer, (24, 12, 25), "d")
Download the file for your platform. If you're not sure which to choose, learn more about installing packages. | https://pypi.org/project/magicmemoryview/ | CC-MAIN-2017-26 | refinedweb | 239 | 61.87 |
There are several more models we will need to create before we can start even a basic game. Pokemon, Players, and the Game model itself are all a required part of the setup flow. Technically other data models will need to be created during setup as well, but at a minimum to get the game up and running we will need these three. In addition, each of these models will be provided with a factory class to help create and configure them.
Enums
Some of the fields held by our upcoming models use a special data type called an enum. There are placeholder scripts for each located in the Scripts/Enums directory, where each type has a file by the same name.
public enum Genders { Male, Female } public enum Poses { Front, Back }
I’ve shown both of the new enums we will need for this lesson here. Both are used when determining what picture to show to represent a Pokemon. Most of the Pokemon are gender neutral and will use the same picture regardless. Some have a “-F” or “-M” postfix on the sprite and in those cases I need some way to consistently know which one we want to load.
The pose comes into play when we want to specify whether we are looking at a Pokemon from the front or from the back. I use this in the setup screen as a sort of visual toggle on which Pokemon you have selected to be your buddy. The selected Pokemon will face you while the others face away. In addition, the battle screen has a sort of perspective to it as if you are the trainer standing behind your Pokemon and giving it orders. Because of this you will always see your Pokemon from behind, but will always see the opponent’s pokemon from the front.
Data Models
There are a handful of models to add in this lesson. There are already placeholder scripts for each located in the Scripts/Model directory, where each class has a file by the same name.
Unlike the models we created earlier, these models are not designed with an ECS architecture. There are pros and cons of both architectures, but in this case not using it can simplify some things, such as a nice bonus of being immediately serializable and visible within the Unity Inspector window. I could always create custom editor scripts to get my ECS models to appear, but it requires no extra work for these.
Pokemon
Update the script located at Scripts/Model/Pokemon.cs with the following:
using UnityEngine; using System; using ECS; [Serializable] public class Pokemon { public static readonly double[] multiplierPerLevel = new double[] { 0.094, 0.135137432, 0.16639787, 0.192650919, 0.21573247, 0.236572661, 0.25572005, 0.273530381, 0.29024988, 0.306057377, 0.3210876, 0.335445036, 0.34921268, 0.362457751, 0.37523559, 0.387592406, 0.39956728, 0.411193551, 0.42250001, 0.432926419, 0.44310755, 0.453059958, 0.46279839, 0.472336083, 0.48168495, 0.4908558, 0.49985844, 0.508701765, 0.51739395, 0.525942511, 0.53435433, 0.542635767, 0.55079269, 0.558830576, 0.56675452, 0.574569153, 0.58227891, 0.589887917, 0.59740001, 0.604818814, 0.61215729, 0.619399365, 0.62656713, 0.633644533, 0.64065295, 0.647576426, 0.65443563, 0.661214806, 0.667934, 0.674577537, 0.68116492, 0.687680648, 0.69414365, 0.700538673, 0.70688421, 0.713164996, 0.71939909, 0.725571552, 0.7317, 0.734741009, 0.73776948, 0.740785574, 0.74378943, 0.746781211, 0.74976104, 0.752729087, 0.75568551, 0.758630378, 0.76156384, 0.764486065, 0.76739717, 0.770297266, 0.7731865, 0.776064962, 0.77893275, 0.781790055, 0.78463697, 0.787473578, 0.79030001 }; public static int MaxLevel { get { return multiplierPerLevel.Length - 1; }} public const int MaxEnergy = 100; public Genders gender; public int entityID; public int fastMoveID; public int chargeMoveID; public int hitPoints; public int maxHitPoints; public int energy; public int level; public int attackIV; public int defenseIV; public int staminaIV; public string Name { get; set; } public Entity Entity { get; set; } public Move FastMove { get; set; } public Move ChargeMove { get; set; } public SpeciesStats Stats { get; set; } public Evolvable Evolvable { get; set; } public float HPRatio { get { return (float)hitPoints / (float)maxHitPoints; }} public float EnergyRatio { get { return (float)energy / (float)MaxEnergy; }} public float LevelRatio { get { return (float)level / (float)MaxLevel; }} public float CPM { get { return (float)multiplierPerLevel[level]; }} public float Attack { get { return (Stats.attack + attackIV) * CPM; } } public float Defense { get { return (Stats.defense + defenseIV) * CPM; }} public float Stamina { get { return (Stats.stamina + staminaIV) * CPM; }} public int CP { get { return Mathf.Max(10, Mathf.FloorToInt(Mathf.Sqrt(Attack * Attack * Defense * Stamina) / 10.0f)); }} }
Note that there is a “[Serializable]” tag on this class – I use this so that the class can be viewed in Unity Inspector windows. Ultimately the Flow Controller will hold a reference to an object hierarchy containing Pokemon, and this setting will make sure I can debug the values or even “cheat” by tinkering with values while debugging if desired.
Note that only the instance fields are actually going to be serialized. Other instance properties such as a Pokemon’s cached reference to its Entity, and calculated properties such as the “HPRatio” (hit point ratio) will be ignored. Furthermore the “static” and “const” fields and properties of a class will also not ever be serialized. Note that all of this is also true when serializing to JSON – which we will do later to persist our game.
The static array of values “multiplierPerLevel” is a multiplier used in combat calculations so that a level stat has an influence on the other stats. Ideally, I wouldn’t hard code these values into the class like this, but might instead provide some sort of asset that could be updated, perhaps even a settings URL that the app could hit for balance data. For now, this was the easiest way to get up and running. I found the table of values here which included both level and half level stats. I allowed this array to control the max level of a pokemon by its own array length. I found the max energy stat in a few places which I have already linked to in previous lessons. A lot of the other calculated properties, such as how to calculate the CP level I found here.
Player
Update the script located at Scripts/Model/Player.cs with the following:
using System.Collections.Generic; using System; [Serializable] public class Player { public string nickName; public int tileIndex; public int destinationTileIndex; public int pokeballs; public int revives; public int potions; public int candies; public List<Pokemon> pokemon = new List<Pokemon>(); public List<string> badges = new List<string>(); }
Hopefully each of these fields are pretty self explanatory. The “nickName” is set during the Setup flow where a player can choose to input a custom name or use the default, such as “Player 1” if they don’t provide a value. The “tileIndex” indicates the index on the board’s tiles of where the player is located. The “destinationTileIndex” is where the player is headed – for example, if the game has just begun and our player rolls a 3, then his current “tileIndex” will be 0 while his “destinationTileIndex” will be 3. I’ll use these values to determine whether or not the “Journey” flow has completed or not.
There are several stats for a rudimentary inventory system: “pokeballs”, “revives”, “potions”, and “candies” where each holds the count of that item that the player possesses. “Pokeballs” are needed to catch any wild pokemon you encounter, “revives” are needed to restore any pokemon which has been KO’d, “potions” restore pokemon hit points, and “candies” are used for evolution.
Finally there are two lists: “pokemon” and “badges”. The “pokemon” list is the list of pokemon that makes up the trainer’s team. You start with a single pokemon and can collect more by capturing them after a random encounter battle. The “badges” list holds the names of whatever gym types you have defeated. It starts out empty and grows as you gain victories. The name of the type of the gym is used to load the image of the badge from resources. The game system can also use the count of this list to determine if a player has won the game or not.
Game
Update the script located at Scripts/Model/Game.cs with the following:
using System.Collections.Generic; using System; using UnityEngine; [Serializable] public class Game { public List<Player> players; public int currentPlayerIndex; public Player CurrentPlayer { get { return players[currentPlayerIndex]; }} }
Note that a “Game” is marked as Serializable just like the “Player” and “Pokemon” are. This means that the entire hierarchy of data contained here can be displayed in the Unity Inspector window, and that it can also be serialized to or deserialized from JSON with a single call.
The game ties together all of the important information about a session of our app into one model. It holds everything which would be necessary to save and restore a game session later if necessary. Note that by design, I always save the game at the beginning of each player’s turn – this is a common pattern and can be seen in games such as “Mario Party”. This is easier than needing to be able to persist at “any” state and can also exclude things like a battle or its related models from needing to be saved.
If ALL of the data had been ported over to the ECS architecture, saving “anywhere” at “anytime” would be much simpler, but even then you might decide it is a better experience to save at special events like I am doing now anyway. For example, nothing in the battle screen currently indicates whose turn it is. If multiple players happened to have acquired the same pokemon, then it might be hard to remember whose battle was in progress once restoring a game. In contrast, when I save at the beginning of a turn, I can restore to the beginning of a turn where we get that nice handy alert window explicitly telling us whose turn it is now.
Factories
There are multiple common approaches to initializing an object. For some fields you can use an initializer at the same time you define the field. I used this in a few places, usually around any field that held a generic “List” because I like to be able to simply start adding objects to the list without having to remember to create it first. Other times you might want something a little more complex. For example I assign a random gender to Pokemon as well as random starting IV stats (I dont actually know what the IV stands for, but all the guides refer to it…) from 0 to 15. This could be accomplished by including a “constructor”, and that would be a perfectly fine approach.
In this project, I created something called “factory” classes that are responsible for creating instances and handling setup for me. One benefit of this approach is greater control. A constructor is always called (although you may have more than one constructor with overloaded parameters), but I am not obligated to use my factory’s creation method in any way. When I need new Pokemon to be generated, then I am happy to use a Factory to create them, but when loading a Pokemon from a save file, I dont need to go through the initial setup of picking a gender and random stats – I simply want to assign the ones that were already saved.
In addition, if the creation of an asset required knowledge of other resources that I didn’t want to have tightly coupled, then the factory can provide a nice way to separate that link. The model could still be easily reusable and the factory could be an optional extra bit which may or may not be reusable.
Another pattern is failable initializers. Perhaps you want to use a factory to attempt to create an instance of a class with certain parameters. If the parameters fall within invalid ranges, you might prefer to return “null” instead of an incomplete or malformed instance. Constructors wont allow this, but a factory method could. I’m not making use of any of these advanced features in this project, but I thought I would point them out just in case it helps you understand the value in this pattern.
There are a handful of factories to add in this lesson. There are already placeholder scripts for some of them located in the Scripts/Factory directory, where each factory has a file by the same name.
Pokemon Factory
You will need to create this script and then add the following:
using System.Collections; using System.Collections.Generic; using UnityEngine; using ECS; public static class PokemonFactory { public static Pokemon Create (Entity entity, int level = 0) { Pokemon pokemon = new Pokemon(); pokemon.gender = UnityEngine.Random.Range(0, 2) == 0 ? Genders.Male : Genders.Female; pokemon.attackIV = UnityEngine.Random.Range(0, 16); pokemon.defenseIV = UnityEngine.Random.Range(0, 16); pokemon.staminaIV = UnityEngine.Random.Range(0, 16); pokemon.SetEntity (entity); pokemon.SetMoves (); pokemon.SetLevel (level); pokemon.hitPoints = pokemon.maxHitPoints; return pokemon; } }
Here we create and return a Pokemon with some special setup going on. This function takes two arguments, an “Entity” and a second optional argument called “level”. Optional arguments use a default value (in this case ‘0’) if the method is called with that argument missing.
To assign the gender, we roll a random number – the Range method uses an exclusive upper bound which means that the number here will only be ‘0’ or ‘1’, so basically I have an equal chance of getting either gender. There are three ‘IV’ stats which are also randomly generated from ‘0’ to ’15’ (because like before ’16’ is an exclusive upper bound). These bonus stats allow a little variation even among the same type of Pokemon.
Then I start doing something that looks like I am calling instance methods on the Pokemon for “SetEntity”, “SetMoves”, and “SetLevel”. However, if you look at the Pokemon class there are no instance methods whatsoever. The methods here are some new extension methods and are defined in another class. In this case I created a separate class called the PokemonSystem for providing these functions – we will show that in a bit. Finally, after assigning the level (which will also adjust the max hit points based on the level), I update the hit points stat to be the same as the max hit points. The Pokemon is now fully configured and can be returned.
Player Factory
You will also need to create this script and then add the following:
using System.Collections; using System.Collections.Generic; using UnityEngine; public static class PlayerFactory { public static Player Create () { var player = new Player (); player.pokeballs = 5; player.revives = 1; player.potions = 1; return player; } }
This factory could have easily been implemented as a “constructor” on a player, or even using field initialization values. It is especially flexible because I am simply assigning constant values to each of the fields. It is always possible that I would need more control in the future, and I had already started using the factory pattern with some of my other classes, so I simply continued the pattern here. Beyond creating and returning a player instance, it also assigns default values to some of the player’s inventory. Feel free to tweak the starting values to your liking.
Game Factory
Update the script located at Scripts/Factory/GameFactory.cs with the following:
using System.Collections; using System.Collections.Generic; using UnityEngine; public static class GameFactory { public static Game Create (int playerCount) { Game game = new Game (); game.players = new List<Player> (playerCount); for (int i = 0; i < playerCount; ++i) { var player = PlayerFactory.Create (); game.players.Add (player); } return game; } public static Game Create (string json) { Game game = JsonUtility.FromJson<Game> (json); foreach (Player player in game.players) { foreach (Pokemon pokemon in player.pokemon) { pokemon.Restore (); } } return game; } }
This version makes the best use of the factory pattern so far. There are two approaches used to create the game instance, one is a new game created based on a player count, and the other is created based on previous saved game data. In order to fully restore a game, some additional setup work is required on the Pokemon, but currently the game model doesn’t have any coupling to that class. By keeping the setup in this factory class instead of as a constructor in the Game class, I can maintain a more loosely coupled project.
It is worth pointing out that one of the benefits of an ECS architecture is the ability to overcome the “impossible” problem of creating object hierarchies with object relationships already in place. If the Pokemon class was implemented using ECS I wouldn’t have to “Restore” these objects after instantiating them. In this case I want to cache the references to some of those database objects for later.
Systems
There is only one “system” to add in this lesson, and I am only providing a partial implementation which was necessary for the factory code to compile plus a couple methods we will need for the setup flow. There are already placeholder scripts for the systems as well. You will find them located in the Scripts/Systems directory, where each class has a file by the same name.
Pokemon System
Even though the Pokemon data model wasn’t implemented using the ECS architecture, I can still use some of the general concepts for it as well. I created a system specifically to operate on instances of this class. However, the way I implemented these methods as extensions makes it feel more like an MVC architecture anyway. I still don’t know how my peers would feel about this – I like it, but I am open for feedback.
using System.Collections; using System.Collections.Generic; using UnityEngine; using ECS; using SQLite4Unity3d; public static class PokemonSystem { public static void SetLevel (this Pokemon pokemon, int level) { pokemon.level = level; float start = (float)pokemon.Stats.stamina / 2f; float stop = pokemon.Stats.stamina; float value = EasingEquations.Linear (start, stop, pokemon.LevelRatio); pokemon.maxHitPoints = Mathf.RoundToInt(value); } public static void SetEntity (this Pokemon pokemon, Entity entity) { pokemon.Name = entity.label; pokemon.entityID = entity.id; pokemon.Entity = entity; pokemon.Stats = entity.GetSpeciesStats(); pokemon.Evolvable = entity.GetEvolvable(); } public static void SetMoves (this Pokemon pokemon) { List<Move> moves = pokemon.Entity.GetMoves(); List<Move> fastMoves = new List<Move>(); List<Move> chargeMoves = new List<Move>(); foreach (Move move in moves) { if (move.energy > 0) fastMoves.Add(move); else chargeMoves.Add(move); } if (fastMoves.Count == 0 || chargeMoves.Count == 0) { Debug.LogError("Missing moves"); return; } pokemon.FastMove = fastMoves[Random.Range(0, fastMoves.Count)]; pokemon.ChargeMove = chargeMoves[Random.Range(0, chargeMoves.Count)]; pokemon.fastMoveID = pokemon.FastMove.id; pokemon.chargeMoveID = pokemon.ChargeMove.id; } public static void Restore (this Pokemon pokemon) { var connection = DataController.instance.pokemonDatabase.connection; var entity = connection.Table<Entity> () .Where (x => x.id == pokemon.entityID) .FirstOrDefault(); pokemon.SetEntity (entity); pokemon.FastMove = connection.Table<Move> () .Where (x => x.id == pokemon.fastMoveID) .FirstOrDefault(); pokemon.ChargeMove = connection.Table<Move> () .Where (x => x.id == pokemon.chargeMoveID) .FirstOrDefault(); } public static Sprite GetAvatar (this Pokemon pokemon, Poses pose = Poses.Front) { return GetAvatar(pokemon.Entity, pokemon.gender, pose); } public static Sprite GetAvatar (Entity entity, Genders gender, Poses pose) { string file = entity.id.ToString("000"); string folder = pose == Poses.Front ? "PokemonFronts" : "PokemonBacks"; string fileName = string.Format("{0}/{1}", folder, file); Sprite sprite = Resources.Load<Sprite>(fileName); if (sprite == null) { string extension = gender == Genders.Male ? "-M" : "-F"; fileName = string.Format("{0}/{1}{2}", folder, file, extension); sprite = Resources.Load<Sprite>(fileName); } return sprite; } }
The “SetLevel” method does more than simply updating the “level” value itself. As a Pokemon experiences this growth, the max hit points stat will also be incremented. The code there may look a little complex, but what I am doing is using one of my “easing equations” from my animation library to interpolate between two values. In this case the “curve” is just a simple linear equation that goes from half of the Pokemon’s stamina stat, to the full value of the Pokemon’s stamina stat. The distance along that curve that I want to grab a value from is the percentage of the levels that can be obtained. In other words, a Pokemon’s max hit points will be equal to half its stamina when it is initially created with a level of ‘0’. When it reaches the max level, its hit points will be the same as its stamina stat.
Whenever I set the “Entity” of a Pokemon, you could think of it as if we are determining what prototype to use as the basis for creating it. I am referring to a reference from the the Pokemon database which is part of the earlier ECS architecture. I assign the “id” of the entity (which is serializable and from which I can restore the reference at a later date) as well as save the reference to the entity object itself. From the entity I can also get references to several of the “components” that I also want to cache at this point.
As I create or evolve a pokemon, I will pick a single fast move and charge move from among the potential moveset to assign. I do this by grabbing all of the moves, then looping through them and categorizing them based on whether they give you energy or take it away. Once they are sorted, I pick at random from the lists accordingly. Like before I assign the “id” of the move as well as the move itself, so that I can more easily save and restore the object later.
After we have loaded a saved game, there are some properties on a Pokemon that were not serialized and which will need to be reconnected. I use the “Restore” method for this. Using the id’s which we did save, it is pretty trivial to grab the references to the objects again and cache them for later use.
Finally, this system provides an easy way for us to associate a picture (the avatar) with a Pokemon. Generally, I will use an extension method on the Pokemon itself, because then we will always maintain the same gender setting. When a player is picking his buddy, I haven’t actually created the Pokemon yet, so I made this an overloaded method. During setup I will simply pass along the Entity and pre-determined pose and gender settings.
Summary
In this lesson we created three important data models which are required as part of a minimal setup for our game. In addition, we spent some time introducing the factory as an architectural pattern and then created factories for each of our new models. Finally I showed a couple of enums and a partial implementation of one of the systems which was used by a factory so that everything would at least compile.
Don’t forget that there is a repository for this project located here. Also, please remember that this repository is using placeholder (empty) assets so attempting to run the game from here is pretty pointless – you will need to follow along with all of the previous lessons first.
4 thoughts on “Unofficial Pokemon Board Game – Data Models”
Hey Jon, great work! Always a good read.
I like what you did with the Pokemon “System”, I think having the methods be extensions of the Pokemon class makes for cleaner code. I also think it’s a nice way to bridge the gap between the Pokemon data model and the entity systems. It’s hard to say whether or not that will cause any problems in the future, but, knowing the scope of this project, I doubt it will be problematic.
And as I understand it, the Pokemon class is more like an interface, sitting on top of the ECS information, right?
Thanks for the feedback Nathan, glad you also enjoyed the approach I took. I was thinking the same thing that it helped it feel more uniform with the other ECS code.
Regarding the Pokemon class, I suppose in some ways you could see it like an interface, but the specific collection of components and stats, etc is really just a more complex model that is unique to itself. It has more content and purpose than merely to provide access to the underlying components.
Hmm, I think I see now. I re-read the paragraph about SetEntity, and now I see that the ECS Pokemon data is prototypical (name, type, moves, etc), and the Pokemon class has the specifics for unique instances of Pokemon in the game.
Neat.
Yep, you’ve got it. | https://theliquidfire.com/2017/03/06/unofficial-pokemon-board-game-data-models/ | CC-MAIN-2021-10 | refinedweb | 4,108 | 53.21 |
Hello all,
Im fairly new to rigging and trying to learn the advance concepts. I tried creating a hand rig for FPS. The only issue I am facing now is that the joints connected to the IK handles are not moving when I try to move their parent joints. I have come across this issue a few times and I cant exactly figure why this is happening. Can someone explain me where I ve gone wrong or what am I missing in the basics when it comes to using IK handles efficiently.
Thank you So much
Are the joints constrained to something? Or possibly locked in rotation?
Are the joints that you circled supposed to be moving to the right, to follow the green box controls? Or did you move the hand and the controllers are not following? It is difficult to tell which direction you are moving in this static image.
ikHandles typically won't react to their parent's transformation. What you can do is constrain each to another node, and then parent those nodes to the hand. It's a little silly that it works this way, but such is life.
Thanks so much for responding. yes the joints are suppose to move with the box controls for the hand. the joints were suppose to follow the controls because they are constrained.
"ikHandles typically won't react to their parent's transformation" - I totally get this.
"What you can do is constrain each to another node, and then parent those nodes to the hand" - What do you mean by this though ? By nodes you mean groups ? (Do you want me to create null groups for the iK handles, add them to the groups and then constrain the groups to the controls.)
Thank you so much for responding.
Yes. Like this.
# This will wipe your scene
from maya import cmds
cmds.file(new=True, force=True)
arm = cmds.joint()
elbow = cmds.joint()
hand = cmds.joint()
cmds.move(0, -10, 0, elbow)
cmds.move(1, -20, 0, hand)
handle, effector = cmds.ikHandle(startJoint=arm, endEffector=hand)
group = cmds.group(empty=True)
controller = cmds.circle(name="control")
cmds.move(1, -20, 0, controller)
cmds.move(1, -20, 0, group)
cmds.parentConstraint(group, handle)
cmds.parent(group, controller)
Do you mind sharing your scene so we could take a indepth look in your outliner and how you hierachy your joints and controllers? Then it would be more straightforward to tell you whats wrong and how to solve problems
What i am guessing is that IK tend to not move with the parent control. SO you will need a follow group for the IK ctrls to follow FOR ETC the palm control | http://tech-artists.org/t/joints-connected-to-the-ik-handles-dont-move-with-their-parent-why-does-this-happen/9395 | CC-MAIN-2017-51 | refinedweb | 450 | 76.32 |
Take away the single quotes from around your case
conditions. The selection variable you are testing is a number, not a character.
The quotes mean the value tested is a character.
What was happening is no condition was being met, so the conversion variable was never set. This is why you always want to include the "default" condition in your switch, which would have caught the error:
default:
printf("switch value not found");
break;
Gary
General discussion
All Comments
Take away the single quotes from around your
Simple C Programming Question
/* cur_conv.c - Currency Conversion Program Version 1.1 */
/* Currency Conversion data as of 12/03/04 */
/* Source data provided by */
#include <stdio.h>
#define ARS 0.3356;
#define GBP 1.9434;
#define EUR 1.3453;
#define CHF 0.8841;
#define ZMK 0.0002;
/* Main Program */
int main (void)
{
float usd;
float conversion;
float newrate;
int selection;
printf("This program will convert foreign currency to US Dollars\n");
printf("\n");
printf("Argentine Peso\t(ARS) * 0.3356 = USD\n"); /* First conversion rate */
printf("British Pound\t(GBP) * 1.9434 = USD\n"); /* Second conversion rate */
printf("European Euro\t(EUR) * 1.3453 = USD\n"); /* Third conversion rate */
printf("Swiss Franc\t(CHF) * 0.8841 = USD\n"); /* Fourth conversion rate */
printf("Zambian Kwacha\t(ZMK) * 0.0002 = USD\n\n"); /* Fifth conversion rate */
printf("Enter currency of your choice:\t[1] ARS\t[4] CHF\n"); /* Tabs entered for readability */
printf("\t\t\t\t[2] GBP\t[5] ZMK\n");
printf("\t\t\t\t[3] EUR ");
scanf("%d", &selection);
switch (selection) /* switch statements section */
{
case '1' : conversion = ARS; break;
case '2' : conversion = GBP; break;
case '3' : conversion = EUR; break;
case '4' : conversion = CHF; break;
case '5' : conversion = ZMK; break;
}
printf("Enter the amount of foreign currency to be converted ");
scanf("%f",&usd);
newrate = conversion * usd;
printf("\n");
printf("That amount in US Dollars is: $ %.2f\n", newrate);
return 0;
}
This conversation is currently closed to new comments. | https://www.techrepublic.com/forums/discussions/simple-c-programming-question/ | CC-MAIN-2018-26 | refinedweb | 327 | 57.57 |
Object Use Color Property
On 23/03/2013 at 10:16, xxxxxxxx wrote:
I have script that changes the objects display color. First turning on the Use Color option with this code:
obj = doc.GetActiveObject() bc = obj.GetData() bc.SetLong(c4d.ID_BASEOBJECT_USECOLOR, 2) obj.SetData(bc)
It even prints the correct value when I print GetLong, but the object doesn't change?
On 23/03/2013 at 12:22, xxxxxxxx wrote:
We're supposed to use the Get&Set Parameters method as much as possible. And only use BaseContainers as a very last resort.
In Python. That means using a bracketed syntax like this:
import c4d def main() : obj = doc.GetActiveObject() obj[c4d.ID_BASEOBJECT_USECOLOR]=2 #Equivalent to SetParameter() in C++ c4d.EventAdd() if __name__=='__main__': main()
-ScottA
On 23/03/2013 at 12:56, xxxxxxxx wrote:
Thanks Scott! I was racking my brain over that simple problem. Still seems like the base container should have worked though.
On 24/03/2013 at 09:22, xxxxxxxx wrote:
BaseContainers don't work for everything. For example, you can't get the attributes of a light that way - you have to use Get/SetParameter.
On 24/03/2013 at 11:21, xxxxxxxx wrote:
Thanks spedler, I guess I'm not really sure why someone would use a BaseContainer then?
On 24/03/2013 at 11:39, xxxxxxxx wrote:
Most parameters are accessible and modifiable via the BaseContainer, but not all. Using the container
directly offers certain advantages in speed (especially when using the fixed-type setters and getters)
and usage (eg. merging containers).
-Niklas
On 24/03/2013 at 14:13, xxxxxxxx wrote:
The things we grab using Get&Set Parameters are set up to work that way by Maxon.
So it's considered a convenience.
Plus it's also considered a safer way to work. Since you're using code they set up for us to use.
The containers are there in case you want to be a mad scientist.
They let us create something brand new on our own that Maxon hasn't set up for us already.
-ScottA
On 24/03/2013 at 16:54, xxxxxxxx wrote:
Thanks for clarifying this confusing topic guys! Ill stick to the get/set. It really is much easier to work with. | https://plugincafe.maxon.net/topic/7056/7976_object-use-color-property | CC-MAIN-2019-22 | refinedweb | 378 | 67.15 |
I have mostly the entire program done but I am having a couple issues. I need to get titles of five movies from the user and store them in the proper member variable for each instance of the five movies at the end of the program. This is what I have so far. I also need to add / between the re-order date and some spaces between the first two parts.
#include <iostream> using namespace std; //Structure for each video information struct Video { string movieTitle; int numberCopies; string videoType; }; struct re_order_Date { int month; int day; int year; }; void get_Video(Video shows[], int number_of_shows); int main() { Video videoInfo; videoInfo.movieTitle = "Fight Club"; videoInfo.numberCopies = 15; videoInfo.videoType = "Mystery"; cout<<"The Title of the movie is: "<<videoInfo.movieTitle<<endl; cout<<"The number of copies are: "<<videoInfo.numberCopies<<endl; cout<<"The type of video is: "<<videoInfo.videoType<<endl; Video videoinfo2; re_order_Date reOrderDate; videoinfo2.movieTitle = "Requiem for a dream"; videoinfo2.numberCopies = 10; videoinfo2.videoType = "Drama"; reOrderDate.month = 05; reOrderDate.day = 17; reOrderDate.year = 2011; cout<<"The Title of the movie is: "<<videoinfo2.movieTitle<<endl; cout<<"The number of copies are: "<<videoinfo2.numberCopies<<endl; cout<<"The type of video is: "<<videoinfo2.videoType<<endl; cout<<"The re-order date of the movie is: "<<reOrderDate.month <<reOrderDate.day <<reOrderDate.year <<endl; Video allVideos[5]; void getVideo (Video shows[],int number_of_shows); { } | https://www.daniweb.com/programming/software-development/threads/322432/array-issues | CC-MAIN-2018-22 | refinedweb | 223 | 62.44 |
Using org-mode outside of Emacs - sort of
Posted August 11, 2014 at 08:22 PM | categories: orgmode, emacs | tags: | View Comments
Table of Contents
I recently posted about using Emacs for scripts ( ). Someone was probably wondering, why would you do that, when you could use shell, python or perl? A good reason is to write scripts that can access data or code inside an org-file! This would allow you to leverage the extensive support for org-mode in Emacs, without a user necessarily even needing to use Emacs. Let us consider some examples.
1 Extracting tables from an org-file
If tables are named in org-mode, it is possible to extract the contents. Here is a table:
Another table might look like
It would be convenient to have a command-line utility that could extract the data from that table with a syntax like:
extract-org-table tblname orgfile --format lisp|csv|tab
Here is one way to do it:
;; org-table tblname orgfile lisp|csv|tab (let ((tblname (pop command-line-args-left)) (org-file (pop command-line-args-left)) (format) (table) (content)) (when command-line-args-left (setq format (pop command-line-args-left))) (find-file org-file) (setq table (org-element-map (org-element-parse-buffer) 'table (lambda (element) (when (string= tblname (org-element-property :name element)) element)) nil ;info t )) ; first-match (unless table (error "no table found for %s" tblname)) (when table (goto-char (org-element-property :contents-begin table)) (let ((contents (org-table-to-lisp))) (if (string= format "lisp") (print contents) ;else (dolist (row contents) (unless (eq row 'hline) (cond ((string= format "csv") (princ (mapconcat 'identity row ","))) ((string= format "tab") (princ (mapconcat 'identity row "\t"))) (t (error "unsupported format: %s" format))) (princ "\n")))))))
Let us try it out. org-babel-tangle
./extract-org-table data-2 org-outside-emacs.org lisp
(("a" "b") ("1" "1") ("2" "8") ("3" "27"))
./extract-org-table data-1 org-outside-emacs.org csv
x,y 1,1 2,4 3,9
./extract-org-table data-2 org-outside-emacs.org tab
a b 1 1 2 8 3 27
That looks pretty reasonable, and you could even pipe the output to another classic unix command like cut to get a single column. Let us get the second column here.
./extract-org-table data-1 org-outside-emacs.org csv | cut -d , -f 2
y 1 4 9
That is starting to look like using data from an org-file, but outside of org. Of course, we are using org-mode, via emacs, but the point is a user might not have to know that, as long as a fairly recent Emacs and org-mode was installed on their system.
2 Running code in an org-file
It may be that there is code in an org-file that you might want to use, but for some reason choose not to cut and paste from the org-file to some script. Here is a simple code block:
import time with open('results.dat', 'w') as f: f.write(time.asctime())
To call this externally we have to find the block and then run it.
;; org-run blockname org-file ;; run a code block in an org file (let ((blockname (pop command-line-args-left)) (org-file (pop command-line-args-left)) (src)) (find-file org-file) (setq src (org-element-map (org-element-parse-buffer) 'src-block (lambda (element) (when (string= blockname (org-element-property :name element)) element)) nil ;info t )) ; first-match (when src (goto-char (org-element-property :begin src)) ;; since we start with a fresh emacs, we have to configure some things. (org-babel-do-load-languages 'org-babel-load-languages '((python . t))) (let ((org-confirm-babel-evaluate nil)) (org-babel-execute-src-block))))
./org-call.el python-block org-outside-emacs.org cat results.dat
Mon Aug 11 20:17:01 2014
That demonstrates it is possible to call source blocks, but this is pretty limited in capability. You can only call a block; we did not capture any output from the block, only its side effects, e.g. it changed a file that we can examine. We have limited capability to set data into the block, other than through files. It might be possible to hack up something that runs org-babel-execute-src-block with constructed arguments that enables something like a var to be passed in. That is beyond today's post. When I get around to it, here is a reminder of how it might be possible to feed stdin to an emacs script: .
Copyright (C) 2014 by John Kitchin. See the License for information about copying.
Org-mode version = 8.2.6 | http://kitchingroup.cheme.cmu.edu/blog/2014/08/11/Using-org-mode-outside-of-Emacs-sort-of/ | CC-MAIN-2020-05 | refinedweb | 785 | 61.77 |
Is there a way to install Mercurial on AIX 6.5 without root? I'm a physics student and am developing code on the IBM cluster in our college and don't have root privilege. Several weeks ago I decided to use Mercurial to help control my code. I've contacted the system manager, but he said "Mercurial falls in the category of unsupported software" on the AIX system and he cannot help me. I've tried to find a guide on the web for a long time, but don't have any luck. I'm only familiar with the very basic commands on Linux, and not familiar with the complicated make file in the source code. Could you give a step by step guide of how to build Mercurial from the source?
Update
The system has Python 2.6, but the Python installation seems incomplete. When I tried the answer by @grawity, I received error "Couldn't import standard bz2 (incomplete Python install)."
"Couldn't import standard bz2 (incomplete Python install)."
Update2
I tried to compile Python 2.6.8 without problem, but when I try
python setup.py install --user
I get the error
Traceback (most recent call last):
File "setup.py", line 56, in <module>
import os, subprocess, time
File "/home/mwu3/install_python/lib/python2.6/subprocess.py", line 416, in <module>
import fcntl
ImportError: No module named fcntl
Update3
I looked into the build log of Python, and actually it fails to build a lot packages, fcntl included:
Failed to find the necessary bits to build these modules:
_sqlite3 bsddb185 dl
imageop linuxaudiodev ossaudiodev
spwd sunaudiodev
To find the necessary bits, look in setup.py in detect_modules() for the module's name.
Failed to build these modules:
_bsddb _ctypes _curses
_curses_panel _tkinter fcntl
I use this to compile Python:
CC=gcc CXX=g++ ./configure --enable-shared
make
Update4
I try to compile Python with xlc:
CC=xlc_r OPT="-O2 -qmaxmem=70000" ./configure --without-computed-gotos --enable-shared
make
Also get the same error in update3.
Update5
I try to compile Python 2.7.3 with xlc also get error but fcntl and _bsddb are built successfully.
fcntl
_bsddb
Python build finished, but the necessary bits to build these modules were not found:
_bsddb _sqlite3 bsddb185
dl imageop linuxaudiodev
ossaudiodev spwd sunaudiodev
To find the necessary bits, look in setup.py in detect_modules() for the module's name.
Failed to build these modules:
_ctypes _curses _curses_panel
_tkinter
From the thread Running Mercurial on a Flash Drive? I get the impression that Mercurial is basically portable, as long as all the dependencies are installed.
It seems as though the entire package resides in one directory
(although I don't have the environment to test Mercurial).
I am not using AIX, but on Linux it is possible to simply extract the contents of an RPM
using :
cd my-dir;
rpm2cpio to-install.rpm | cpio -idv
For more info see
How To Extract an RPM Package Without Installing It (rpm extract command).
You would need to repeat this, or install from source, all the dependencies.
This would work if the installation of Mercurial is relatively simple and does not
require access to directories only accessible by root.
Download the Mercurial source tarball, extract it, and run:
It will be installed to ~/.local/lib/python2.6/, with the executable commands at ~/.local/bin/ – add the latter to your $PATH.
~/.local/lib/python2.6/
~/.local/bin/
You will need at least Python 2.6 for the "user base" directory, and gcc to compile some OS-specific modules.
gcc
By posting your answer, you agree to the privacy policy and terms of service.
asked
2 years ago
viewed
426 times
active | http://superuser.com/questions/567394/how-should-i-install-mercurial-on-aix-6-5-without-root-privilege | CC-MAIN-2015-18 | refinedweb | 618 | 56.66 |
Here's a useful little function: -- | Fork a thread, but wait for the main thread to perform a setup action -- using the child's 'ThreadID' before beginning work in the child thread. forkSetup :: (ThreadId -> IO (Maybe a, r)) -- ^ Setup action to be called before the thread begins working -> (a -> IO b) -- ^ What to do in the worker thread -> IO r forkSetup setup inner = mask $ \restore -> do mv <- newEmptyMVar tid <- forkIO $ join $ takeMVar mv (ma, r) <- setup tid `onException` putMVar mv (return ()) case ma of Nothing -> putMVar mv $ return () Just a -> putMVar mv $ restore $ inner a >> return () return r A question about 'mask': is it safe to use the 'restore' callback in a forked thread? Or might this be invalid in a future version of GHC? I'm aware that if forkSetup itself is called with exceptions masked, the child thread will also have exceptions masked. This seems reasonable, given that forkIO behaves the same way. Is a function like this available in some existing library? If not, where would be a good home for it? Thanks for the input! | http://www.haskell.org/pipermail/haskell-cafe/2012-July/102388.html | CC-MAIN-2014-35 | refinedweb | 179 | 66.07 |
I have made an array of strings and I am trying to group a string array into categories.
So far my code looks like this:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int
main(int argc, char *argv[]) {
char *results[] = {"Canada", "Cycling", "Canada", "Swimming", "India", "Swimming", "New Mexico",
"Cycling", "New Mexico", "Cycling", "New Mecico", "Swimming"};
int nelements, i, country_count;
nelements = sizeof(results) / sizeof(results[0]);
for (i = 0 ; i < nelements; i++) {
printf("%s\n", results[i]);
}
return 0;
}
Canada
Cycling
Canada
Swimming
India
Swimming
New Mexico
Cycling
New Mexico
Cycling
New Mexico
Swimming
Canada
Cycling 1
Swimming 1
India
Swimming 1
New Mexico
Cycling 2
Swimming 1
i+2
strcmp
I would use a struct (if you are not familiar, I always remind myself when needed with myStruct.c) and with two arrays as data members, like this:
#include <stdio.h> #include <stdlib.h> #include <string.h> #define COUNTRY_LENGTH 15 #define MAX_SPORTS 5 enum sport_name { CYCLING, SWIMMING }; typedef struct Record { char country[COUNTRY_LENGTH]; int sports[MAX_SPORTS]; } Record; // return index of 'country' in 'array' if the 'country' // is found inside 'array', else -1 int exists(char country[], Record* array, int size) { int i; for(i = 0; i < size; ++i) if(!strcmp(array[i].country, country)) return i; return -1; } int find_sport_index(char sport[]) { if(!strcmp(sport, "Cycling")) return CYCLING; if(!strcmp(sport, "Swimming")) return SWIMMING; printf("I couldn't find a sport index for %s\n!!! Do something...Undefined Behavior!", sport); return -1; } char* find_sport_string(int sport) { if(sport == CYCLING) return "Cycling"; if(sport == SWIMMING) return "Swimming"; printf("I couldn't find a sport string for sport index %d\n!!! Do something...", sport); return NULL; } int main(int argc, char *argv[]) { // you had a typo, New Mecico, I corrected it..Also you could have used a struct here... ;) char *results[] = {"Canada", "Cycling", "Canada", "Swimming", "India", "Swimming", "New Mexico", "Cycling", "New Mexico", "Cycling", "New Mexico", "Swimming"}; int nelements, i, j; nelements = sizeof(results) / sizeof(results[0]); const int records_size = nelements/2; Record record[records_size]; for(i = 0; i < records_size; i++) { for(j = 0; j < COUNTRY_LENGTH; j++) record[i].country[j] = 0; for(j = 0; j < MAX_SPORTS; j++) record[i].sports[j] = 0; } int country_index, records_count = 0; for(i = 0; i < nelements; ++i) { // results[i] is a country if(i % 2 == 0) { country_index = exists(results[i], record, records_size); if(country_index == -1) { country_index = records_count++; strcpy(record[country_index].country, results[i]); } } else { // result[i] is a sport record[country_index].sports[find_sport_index(results[i])]++; } } for(i = 0; i < records_size; ++i) { if(strlen(record[i].country)) { printf("%s\n", record[i].country); for(j = 0; j < MAX_SPORTS; j++) { if(record[i].sports[j] != 0) { printf(" %s %d\n", find_sport_string(j), record[i].sports[j]); } } } } return 0; }
Output:
C02QT2UBFVH6-lm:~ gsamaras$ ./a.out Canada Cycling 1 Swimming 1 India Swimming 1 New Mexico Cycling 2 Swimming 1
The idea is that:
Recordholds the records in the Olympics, with relevant sports.
Record.countryholds the name of the country (and I assume that it be 14 characters at max, +1 for the NULL terminator, thus I defined it as 15).
Record.sportsis an array with size
MAX_SPORTS- the size would be equal to all the sports in the Olympics, but I assumed it's 5. Every position of this array is a counter (of the medals every country got in a sport. For example,
Record.sports[1] = 2would indicate that this country has 2 medals in Swimming. But how I know it was Swimming? I decided apriori, as a programmer that the first counter is connected to Cycling, the second to Swimming and so on. I used an
enumto make that more readable, instead of using magic numbers. (Note: You could use a list instead an array, but that would be an overkill for that application. But if you want to do it for fun (and because a bit less memory), you can use our List (C)).
results[]in a strange way, since you should really have used a struct for that, but I worked with your code...So I needed an array of
Records, and its size should be equal to the number of the countries, i.e. the half of the size of
results[]. Notice that because you defined
results[]to contain implicit pairs of country-sport, a division by two is just enough to determine the size of the
Records array.
results[]to populate
record[], by using a counter named
iin the for-loop. When
iis even,
result[i]contains a country, else it contains a sport. I use the module operator (
%) to determine that easily.
record[], then I insert it, else I don't insert it again. In both cases I want to remember its index in
record[], so that in the next iteration, that we will process the sport, we will now at which position of
record[]we should look into and act accordingly. | https://codedump.io/share/iBf2pSRzzSfv/1/grouping-array-of-strings-c | CC-MAIN-2017-04 | refinedweb | 811 | 63.7 |
Object Signatures
Theoretically, if the return type were indeed included in a Java signature, you could have the following methods in the same class:
public double squareRoot (double value) public int squareRoot (double value)
These methods return different types. Even though the rest of the signature is identical, the Java language design does not allow overloaded methods to have different return types. The Java compiler will catch this and report an error. Even though the return types are different, the Java compiler will not allow methods with the same name and parameter list as long as there is a different return type. Thus, the signature for a Java method is effectively just the method name and its parameter list. That said, each signature must be uniquethat is what allows you to overload methods as in the example above.
The method signature that you will use for your example is:
public double squareRoot (double value)
Listing 2 shows what the code would look like if you used the java Math package to do the dirty work.
Listing 2: The Calculate Class
// Class Calculate public class Calculate { private double result; public double squareRoot(double value){ result = java.lang.Math.sqrt(value); return result; } }
Listing 3 shows the application that actually uses the squareRoot class.
Listing 3: The Application
class TestSQRT { public static void main(String args[]) { Calculate calc = new Calculate(); double result = calc.squareRoot(16); System.out.println("result = " + result); } }
When this application is executed, the results shown in Figure 4 are displayed. The calculation of the square root of 16 is obviously 4.
Figure 4
What you have done here is provide an object service that calculates the square root of a number. The important point here is the way the application uses the service: invoking a method by using its signature appropriately.
When developers create APIs, they are in effect creating a collection of signatures for programmers to utilize. Although the APIs are accessible to the programmers (these are the public interfaces), the code behind the so-called curtain is not accessibleit is not even viewable. So, when the programmer sees this API:
public double squareRoot(double value);
The programmer does not see this (the implementation):
result = java.lang.Math.sqrt(value);
The fact that the code is hidden is a major plus. There is a very real advantage in separating the interface from the implementation. Among other issues, if the programmer knew what the code looked like, it might actually influence some design decisions. Your goal is to make the interface as independent as possible from the implementation. Just consider what the programmer really needs to know when using the sqrt() method.
- Method Name
- Parameter List
- Return Value
This should look very familiarit is the signature. All the programmer wants to get from the sqrt() method is the correct answer; he/she does not really care how the answer is derived. Most likely, the majority of people would not even know how to calculate a square root by hand. Thus, you could change the implementation of our sqrt() method, and it WILL NOT require a change in the application. For example, you can create a square root with the following formula.
sqrt =exp( log(x)/2)
This formula can then be substituted for the original code in the Calculate class as seen in Listing 4.
Listing 4: The New Calculate Class
// Class Calculate public class Calculate { private double result; public double squareRoot(double value){ result = java.lang.Math.exp(java.lang.Math.log(value)/2); return result; } }
Focus on the fact that the code in Listing 2 and Listing 4 returns the exact same resultdespite the fact that the implementation is different. Yet, the interface is the same, and the result is the same. In both cases, you get the result of the method with this line of code.
double result = calc.squareRoot(16);
And, although you might not want to calculate the square root using the code in Listing 4, the fact that you can plug in a new (perhaps better) implementation without forcing a change in the user applications is a major benefit.
Recall the example of the relationship between the interface and the implementation that was presented in an earlier column. Figure 5 illustrates the scenario where you plug in an appliance to take advantage of the electricity coming out of the electric outlet. In Figure 5, the electricity is being produced by a conventional coal power plant. The coal power plant is the implementation. The electric outlet is the interface.
You, as a user of the electricity, do not care where the electricity is coming fromfor all you know the electric company could have purchased the power from another state. In fact, a nuclear power plant could be generating the electricity. Or, perhaps your power went out and a generator switched on. In any event, all you need to know to utilize the electricity is to have the proper interface.
Figure 5
Consider an application that connects to a database. If the interfaces in the application are dependent on the code in the implementation, any change to the code inside the method would perhaps force a change in the actual application. However, if you spend the time to design your system properly and separate the implementation from the interfaces, a change to the code should not effect the application, as the diagram shows in Figure 6.
Figure 6
Conclusion
In the database example above, if you are using an SQL Server database and put code in your application specific to SQL Server, then a change to, let's say, an Oracle database would require a change in the application code. The rule of thumb is to avoid putting code in a frontline application that is specific to any specific implementation.
At first, this may seem counterintuitivehow do you not put code for a SQL Server application in the actual application? The answer is to utilize the concept of wrappers. You can "wrap" any implementation specific code in an intermediate class that acts as a "buffer" of sorts. The application would then call methods (services) or the intermediate class, a kind-of middleware. In the next column, you will explore the concept of wrappers and how they improve your designs and how you can take advantage of wrappers to upgrade some legacy codeeven if the code is not object-oriented..
The material presented in these articles is based on material from the second edition of his book, The Object-Oriented Thought Process, 2nd edition. The Object-Oriented Thought Process is intended for anyone who needs to understand the basic object-oriented concepts before jumping into the code.
>. | http://www.developer.com/design/article.php/10925_3554246_2/Object-Signatures.htm | crawl-003 | refinedweb | 1,111 | 51.68 |
Button won't click when embedded in QWidget
- lisabeeren
hi, i'm trying to add a button defined in qml to an existing project, but when i click the button it does not respond (does not press down / provide any feedback that it has been clicked, and i don't think the event is fired either). i'm using Qt5.1 under OSX.
my qml is as follows:
@import QtQuick 2.1
import QtQuick.Controls 1.0
import QtQuick.Window 2.0
Rectangle {
width: 200
height: 200
Button { text: qsTr("Hello World") anchors.centerIn: parent }
}@
and i embed this as follows (as per this blog post "here": ):
@QQuickView *qqView = new QQuickView();
QWidget *container = QWidget::createWindowContainer(qqView, this);
container->setMinimumSize(200, 200);
container->setMaximumSize(400, 400);
container->setFocusPolicy(Qt::TabFocus);@
any tips on how to get this working?
with thanks | https://forum.qt.io/topic/29862/button-won-t-click-when-embedded-in-qwidget | CC-MAIN-2018-26 | refinedweb | 139 | 56.45 |
Streaming in ASP.NET Core SignalR
Streaming in ASP.NET Core SignalR
We take a look at how to stream data into an ASP.NET Core-based application using SignalR. Read on to learn more!
Join the DZone community and get the full member experience.Join For Free
In this post, we'll see how to stream the data in ASP.NET Core SignalR. With ASP.NET Core 2.1 released, SignalR now supports streaming content.
What Is a Stream?
Streaming or media streaming is a technique for transferring data so that it can be processed as a steady and continuous stream. - webopedia.com
When to Stream?
In the scenarios where the data will load with some latency from the server and we don't have.
Creating ASP.NET Core Application when the chunks of data are available.
Create a C# file in the project with the name as
StreamHub or whatever. It is better to add it in a Folder though.
Derive that from
Hub class and add a namespace in the file as.
public ChannelReader<int> DelayCounter(int delay) { var channel = Channel.CreateUnbounded<int>(); _ = WriteItems(channel.Writer, 20, delay); return channel.Reader; } private async Task WriteItems(ChannelWriter<int> writer, int count, int delay) { for (var i = 0; i < count; i++) { //For every 5 items streamed, add twice the delay if (i % 5 == 0) delay = delay * 2; await writer.WriteAsync(i); await Task.Delay(delay); } writer.TryComplete(); }
DelayCounteris our streaming method, this takes a delay parameter to specify from the client end.
WriteItemsis a private method and this returns a
Task.
- The last line in the
WriteItemsis
.TryComplete()on the stream says the stream is completed and is closed to the client.
Configuring SignalR in the Project
Head over to the
Startup class and locate
ConfigureServices method and add the following line at the end (skip this if you can configure yourself).
services.AddSignalR();
We also need to add a route for the signalR stream. Now, head over to the
Configuremethod in the Startup class and add the following.
app.UseSignalR(routes => { routes.MapHub<StreamHub>("/streamHub"); });
Add SignalR to the Client Library
This is to add the signalR js on the client side.
Launch Package Manager Console (PMC) from the Visual Studio and navigate to project folder with the following command
cd CodeRethinked.SignalRStreaming
Run
npm init to create a package.json file
Ignore the warnings. Install the signalR client library
npm install @aspnet/signalr
The npm install downloads the signalR client library to a subfolder under
node_modules folder.
Copy the signalR From node_modules
Copy the signalr.js file from the
<projectfolder>.
{ "version": "1.0", "defaultProvider": "cdnjs", "libraries": [ { "provider": "filesystem", "library": "node_modules/@aspnet/signalr/dist/browser/signalr.js", "destination": "wwwroot/lib/signalr" } ] }
Once you've saved libman.json our signalr.js will be available in the SignalR folder in lib.
HTML for Streaming
Copy the following HTML into
Index.chtml. For the purpose of the article, I'm removing the existing HTML in
Index.cshtml and adding the following.
@page @model IndexModel @{ ViewData["Title"] = "Home page"; } <div class="container"> <div class="row"> </div> <div class="row"> <div class="col-6"> </div> <div class="col-6"> <input type="button" id="streamButton" value="Start Streaming" /> </div> </div> <div class="row"> <div class="col-12"> <hr /> </div> </div> <div class="row"> <div class="col-6"> </div> <div class="col-6"> <ul id="messagesList"></ul> </div> </div> </div> <script src="~/lib/signalr/signalr.js"></script> <script src="~/js/signalrstream.js"></script>
Notice we have
signalrstream.js at the end. Let's add the js file to stream the content.
JavaScript Setup
Create a new
signalrstream.js file in
wwwroot\js folder. Add the following code into the .js file. connection = new signalR.HubConnectionBuilder() .withUrl("/streamHub") .build(); document.getElementById("streamButton").addEventListener("click", (event) => __awaiter(this, void 0, void 0, function* () { try {); }, }); } catch (e) { console.error(e.toString()); } event.preventDefault(); })); (() => __awaiter(this, void 0, void 0, function* () { try { yield connection.start(); } catch (e) { console.error(e.toString()); } }))();
As ASP.NET SignalR now uses ES6 features and not all browsers support ES6 features. So, in order for it to work in all browser, it is recommended to use transpilers such as babel.
Unlike traditional signalR, we now have different syntax for creating a connection.
var connection = new signalR.HubConnectionBuilder() .withUrl("/streamHub") .build();
And for regular signalR connections, we'll add listeners with
.on method but this is stream so we have stream method that accepts two arguments.
- Hub method name: Our hub name is
DelayCounter
- Arguments to the Hub method: In our case arguments is a delay between the streams.
connection.stream will have a subscribe method to subscribe for events. We'll wire up for next, complete and error events and display messages in the
messagesList element.); }, });
The code before/after the stream connection is related to async and starting a connection as soon as we hit the .js file.
Here is the output of the stream:
I've sixth item is streamed when it is available.
So, if you have a large amount of data to be sent to the client, then go for streaming instead of sending the data at once.
Source Code
The source code is available on GitHub. I've removed the
npm_modules from the solution to make the solution lightweight so install the npm modules with the following command and start the solution.
npm install
Conclusion
Streaming the content is not new but it is in signalR now and a great feature. Streaming will keep.
If you enjoyed this article and want to learn more about ASP.NET, check out this collection of tutorials and articles on all things ASP.NET.
Published at DZone with permission of Karthik Chintala . See the original article here.
Opinions expressed by DZone contributors are their own.
{{ parent.title || parent.header.title}}
{{ parent.tldr }}
{{ parent.linkDescription }}{{ parent.urlSource.name }} | https://dzone.com/articles/streaming-in-aspnet-core-signalr?utm_source=dzone&utm_medium=article&utm_campaign=asp.net-core-cluster | CC-MAIN-2020-34 | refinedweb | 975 | 60.31 |
), uses on 0.2.9 and earlier will not have to update there code when moving to 0.3.1 as they might have in 0.3.
version 0.3 (9-30-08):
-
-usion: soap/xml =>-fixes:
-
- full (5-8-08):
-
- Update the schema.py SchemaProperty loading sequence so that the schema is loaded in 3 steps:
-
- build the raw tree.
- resolve dependancies ensure (04-28-08):
- (04 perparation for type lookups that are fully qualified by namespace. Once completed, the prefixes on attribute values will not.
Eg: element with type=tns:something must be updated to be type=abc:something so then (03-06-08):
-
- Provides proper handling of wsdls that contain schema sections containing
- xsd schema imports: <import namespace="" schemaLocation=""?>. The referenced schemas are imported when a schemaLocation is specified.
- Raises exceptions for http status codes not already handled.
version-0.1.5( 02-21-08 ):
- Provides better logging in the modules get logger by hierarchal names.
- Refactored as needed to truely support other bindings.
- Add sax module which replaces ElementTree. This is faster, simpler and handles namespaces (prefixes) properly.
version-0.1.4 (12-21-07):
- Provides for service method parameters to be None.
- Add proper handling of method params that are lists of property objects.
version-0.1.3 (12-19-07):
-
- Fixes problem where nodes marked as a collection (maxOccurs > 1) not
- creating property objects with value=[] when mapped-in with < 2 values by the DocumentReader. Caused by missing the bindings.Document.ReplyHint.stripns() (which uses the DocumentReader.stripns()) conversion to DocumentReader.stripn() now returning a tuple (ns,tag) as of 0.1.2.
version-0.1. | https://bitbucket.org/saltycrane/suds/src | CC-MAIN-2017-51 | refinedweb | 272 | 52.05 |
Conversion between Traditional and Simplified Chinese using opencc
简繁体相互转换
dependencies: flutter_opencc: ^0.0.1
import 'package:flutter_opencc/flutter_opencc.dart'; String results; // Platform messages may fail, so we use a try/catch PlatformException. try { results = await FlutterOpencc.convert( """鼠标里面的硅二极管坏了，导致光标分辨率降低。 我们在老挝的服务器的硬盘需要使用互联网算法软件解决异步的问题。 为什么你在床里面睡着？""", ); } on PlatformException { results = 'Failed to convert.'; } print(results);
example/README.md
Demonstrates how to use the flutter_open_opencc: ^0.0.1
You can install packages from the command line:
with Flutter:
$ flutter packages get
Alternatively, your editor might support
flutter packages get.
Check the docs for your editor to learn more.
Now in your Dart code, you can use:
import 'package:flutter_opencc/flutter_opencc.dart';
We analyzed this package on May 17, 2019, and provided a score, details, and suggestions below. Analysis was completed with status completed using:
Detected platforms: Flutter
References Flutter, and has no conflicting libraries.
Package is pre-v0.1 release. (-10 points)
While nothing is inherently wrong with versions of
0.0.*, it might mean that the author is still experimenting with the general direction of the API. | https://pub.dev/packages/flutter_opencc/versions/0.0.1 | CC-MAIN-2019-22 | refinedweb | 171 | 51.95 |
CodePlexProject Hosting for Open Source Software
Hi,
Here's a typical object:
[JsonObject(MemberSerialization.OptOut)]
public class CaseDetail
{
public string Message { get; set; }
public bool Success { get; set; }
public long Total { get; set; }
public CaseItem Records { get; set; }
}
Is there a way to stipulate to use camelCase, via a class-level attribute, when the property names are converted into the JSON message?
I would like to be able to set camel casing options at the class-level too; but I don't think it is possible at the moment. I only know of one way to use camel casing and that is across the entire JsonSerializer instance (i.e. all objects will be serialized
in camel case), by setting the JsonSerializer's ContractResolver to the CamelCasePropertyNamesContractResolver, which is provided as part of the library.
Are you sure you want to delete this post? You will not be able to recover it later.
Are you sure you want to delete this thread? You will not be able to recover it later. | https://json.codeplex.com/discussions/242002 | CC-MAIN-2017-22 | refinedweb | 170 | 61.67 |
use strict; use warnings; package Text::Wrap; use warnings::register; BEGIN { require Exporter; *import = \&Exporter::import } our @EXPORT = qw( wrap fill ); our @EXPORT_OK = qw( $columns $break $huge ); our $ (to break before spaces or colons) or a pre-compiled regexp such as C<qr/[\s']/> (to break before spaces or apostrophes). The default is simply C<'\s'>; that is, words are terminated by spaces. (This means, among other things, that trailing punctuation such as full stops or commas stay with the word they are "attached" to.) Setting C<$Text::Wrap::break> to a regular expression that doesn't eat any characters (perhaps just a forward look-ahead assertion) will cause warnings. Beginner note: In example 2, above C<$columns> is imported into the local namespace, and set locally. In example 3, C<$Text::Wrap::columns> is set in its own namespace without importing it. C<Text::Wrap::wrap()> starts its work by expanding all the tabs in its input into spaces. The last thing it does it to turn spaces back into tabs. If you do not want tabs in your results, set C<$Text::Wrap::unexpand> to a false value. Likewise if you do not want to use 8-character tabstops, set C<$Text::Wrap::tabstop> to the number of characters you do want for your tabstops. If you want to separate your lines with something other than C<\n> then set C<$Text::Wrap::separator> to your preference. This replaces all newlines with C<$Text::Wrap::separator>. If you just want to preserve existing newlines but add new breaks with something else, set C<$Text::Wrap::separator2> instead. When words that are longer than C<$columns> are encountered, they are broken up. C<wrap()> adds a C<"\n"> at column C<$columns>. This behavior can be overridden by setting C<$huge> to 'die' or to 'overflow'. When set to 'die', large words will cause C<die()> to be called. When set to 'overflow', large words will be left intact. Historical notes: 'die' used to be the default value of C<$huge>. Now, 'wrap' is the default value. =head1 EXAMPLES" =head1 SEE ALSO For correct handling of East Asian half- and full-width characters, see L<Text::WrapI18N>. For more detailed controls: L<Text::Format>. =head1 AUTHOR David Muir Sharnoff <cpan@dave.sharnoff.org> with help from Tim Pierce and many many others. =head1 LICENSE. | https://web-stage.metacpan.org/release/ARISTOTLE/Text-Tabs+Wrap-2021.0814/source/lib.modern/Text/Wrap.pm | CC-MAIN-2022-05 | refinedweb | 395 | 65.42 |
SOA Made Real
May 18, 2005
In my previous
column I presented a style of writing WSDL files that, when followed, resulted in
reusable components and a nice service-oriented architecture. Pedants may complain
that I
was essentially proposing
rpc/literal rather than
doc/literal by
requiring that every request and response had a name determined algorithmically from
the
operation name. There are two responses to this: first, since you can have attributes
it's
not RPC; second, who cares?
In this column we'll actually build a web service using the style, as well as the examples, from the previous column. Again, we'll use Norm Walsh's where in the world service. For grins, we'll look at a C#/.NET client and a Python server.
Getting Started
The .NET stub generator is called, interestingly enough,
wsdl. The first step
is to stitch together the fragments from last time and build a single WSDL file that
we can
feed into the
wsdl program. The only thing missing is the schema definition. As
I first discussed in September of 2003, use the "Russian Doll" pattern, which eschews the XSD
type system for inlining definitions. Also, reuse structures based on element name,
not
type.
Looking at the
nearby operation, we see the following "calling
sequence":
nearby( xs:string userid, xs:string units = "mi", xs:decimal distance = 50.0)
This isn't a C++-like description, since either or both of
userid or
distance can be omitted. This description, using the above style, results in
the following schema declaration:
<xsd:element <xsd:complexType> <xsd:sequence> <xsd:element <!-- units defaults to "mi" --> <xsd:element <!-- distance defaults to "50" --> <xsd:element </xsd:sequence> </xsd:complexType> </xsd:element>
This is, admittedly, verbose, with nine lines of definition. The return value, which is an array of a complex type, is almost twice as long, and pretty heavy on the XSD-specific overhead:
>
Just looking at those first half-dozen lines is enough to make you think of the Monty
Python "spam" sketch. In defense, I can only point out that it's pretty
boilerplate, and that you can pull out the
landmark definition into its own
element declaration, and use the
ref attribute:
<xsd:element
Which method you use is a matter of taste. I typically inline the element if it's only used once.
Putting it all together, a complete WSDL can be found in listing 1.
Simple, elegant, unsupported
So if we feed our first WSDL into
wsdl, we get
Error: Unable to import binding '&COMPONENT;-binding' from namespace '&BASE;'. - Unable to import operation 'nearby-operation'. - The element '&BASE;:nearby' is missing.
It turns out that my nice little scheme to use DTD's and ENTITY declaration, so that
I only
have to write things like the namespace URI once, and so that I can make a skeleton
WSDL and
edit a few lines at the beginning before filling in the details...isn't supported.
In fact,
just having a DOCTYPE with a few entities (even if they're never used) gives the .NET
wsdl tools fits
I don't recall the WS-I profile saying you shouldn't use a DTD in a WSDL file.
So we have to edit the code from listing
1 and replace the entities with their values. If you do that,
wsdl does
the right thing, generating a C# client stub. The stub turns the "where in the
world" service into a class and each operation becomes a method, which is pretty
standard (although it's pretty nice when coupled with VisualStudio's auto-completion
features).
Since our operations all take a sequence,
wsdl also creates an object for each
input and output message. Putting them together, we can write code like this:
witw b = new witw(); b.Url = ""; @is i = new @is(); i.userid = "rsalz"; isresponse ir = b.isoperation(i);
Notice how you can change where the server is by setting the
Url property on
the binding,
b. Also note that
wsdl appends response or
operation to distinguish among request data, response value, and operation.
For those who don't know C#, the atsign is a token-level quoting character. In this
case
is is a C# keyword, so you have to write it as
@is. You will almost
definitely face this kind of issue when creating your own services -- no doubt you'll
end up
using an identifier that's a keyword in some language, somewhere. Hopefully the WSDL
toolkit(s) for the language in conflict will have a mapping mechanism. If not, or
if it's
too ugly (by some metric), you'll have to edit your service description. Using mixedCase
or
under_scores will probably avoid that kind of problem.
Messy, messy
Let's look at the
atlandmark operation. Its allows a user to specify that they
are at a particular landmark. (For example, is everyone in your dinner party over
at Fry's
Electronics?) The function definition is this:
atlandmark( xs:string userid, xs:string landmark)
But this is what you end up having to write as code:
atlandmark l = new atlandmark(); l.landmark = "Fry's Electronics"; l.userid = "rsalz"; b.atlandmarkoperation(l);
That's a hell of a lot more ugly than the obvious:
b.atlandmark("Fry's Electronics", "rsalz");
What happened? Unfortunately, it's fallout from the way I wrote the WSDL. Every operation has a single input parameter and a single output parameter. That means your language bindings have to create "objects", or at least containers, to hold what would be the bits of XML on the wire. That's kind of ugly, but it's the dirty little secret of SOA: your system will be better off, but you will have to write more code.
If we compile and run the code (available in listing 2), and capture what it sends, we'll see that things make sense (I pretty-printed the message; it was sent as a single long line):
<?xml version="1.0" encoding="utf-8"?> <soap:Envelope xmlns: <soap:Body> <atlandmark xmlns=""> <userid xmlns="">rsalz</userid> <landmark xmlns="">Tidepool</landmark> </atlandmark> </soap:Body> </soap:Envelope>
Sure enough, we're shipping around a clean bit of XML. Granted, there are spurious (and redundant) namespace declarations there, but that's a small nit. (Bonus points if you can figure out which attribute in the schema definition caused the innermost empty namespace declarations.) And look, it's SOAP 1.1!
Next time we'll look at the server and discuss the joys of method dispatch. | http://www.xml.com/pub/a/ws/2005/05/18/salz.html | CC-MAIN-2018-43 | refinedweb | 1,086 | 63.29 |
The isLicensed method is an optional method that can be used to check if a tool in a Python toolbox is licensed to execute. It can be used to restrict the tool from being run if the appropriate licenses and extensions required to run other geoprocessing tools used by the Python toolbox tool are not available.
If the isLicensed method returns False, the tool cannot be executed. If the method returns True or the method is not used, the tool can be executed.
def isLicensed(self): """Allow the tool to execute, only if the ArcGIS 3D Analyst extension is available.""" try: if arcpy.CheckExtension("3D") != "Available": raise Exception except Exception: return False # tool cannot be executed return True # tool can be executed | http://pro.arcgis.com/en/pro-app/arcpy/geoprocessing_and_python/controlling-license-behavior-in-a-python-toolbox.htm | CC-MAIN-2018-51 | refinedweb | 122 | 54.22 |
JAXB and xsd:include (common type libraries across multiple schemas)
Hello,
I have a question about using common type libraries across multiple schemas with JAXB.
The type library is itself a schema without any xsd:element's, only xsd:complexType's and xsd:simpleType's.
The type library is included in several schemas using xsd:include.
Is there any way to get the my type library schema to be generated to a seperate package for all "sub"-schemas to use.
I want to achieve reuse of the types in the type library over several schemas but not generate them into seperate packages.
How can this to be done?
Thanks in advance,
Norbert
I discovered my problem. When I restricted the ant
Thank you, kohsuke.
I'll try it later as you suggested.
Hi All,
I went through this thread to identify how to use a common schema. I'm having a common Message tag in a schema. I need to use it in two schemas. (All are using the same name spaces).
So first I generated the java classes for the Message schema shown above using; xjc -d C:\myproject -p com.my.xml.message Message.xsd
Then I tried to generate the java classes for the request.xsd which import the Message schema as follows.
When I tried to use xjc for this;
xjc -d C:\myproject -p com.my.xml.request Request.xsd
I get an error as,
parsing a schema...
[ERROR] src-resolve: Cannot resolve the name 'Message' to a(n) 'element declarat
ion' component.
line 9 of Request.xsd
Failed to parse a schema.
As I feel, I have to specify the place from where to find the generated classes for Message type which are used in the Request.xsd. But is there a way to do that?
Am I doing something wrong? Any ideas please.
Thanks in advance.
If all your schemas are using the same namespace. You shouldn't be importing it. Instead, you should be including it.
I noticed that you are probably trying to put classes from one namespace into more than one package. I don't think the current set of customization allow you to do this.
So probably the only option for you is to use XJC to generate code, then take the ownership and perhaps use IDE or something to move the classes around.
My basic requirement is to reuse a set of elements.
So could you tell me the way to achieve the reuse of the elements? As I'm reusing the types in the schema, I need to reuse the objects generated for those types.
The Message class generated from the message type has to be shared by all the other types like Request class, Response class.
Basically what I'm trying to do is to reuse the same set of classes inside many other classes (generated for different schemas).
Thanks in Advance for your comments.
It's quite OK to split the definitions into multiple schema documents. So with that respect you did the right thing.
The part that I believe you didn't get right is that.
Hi nkeaccept,
I have a similar requirement, so could you please let me know about the way to achieve the compilation of Sub-schemas and the Common library java files need to be in some other package
Thanks & Regards,
gopi
Hi there,
I have a problem with overture aws xsd files. There are two common xsd markets.xsd and types.xsd which are included by dtc_request.xsd and dtc_response. when I compile them, the types declared in markets.xsd and types.xsd cannot be generated with xjc.
Could you help me?
Thanks in advance.
That's the exact same problem discussed in this thread. What aspect of it would you like to know more?
Thank you for your reply!
At the begginning, I want to find a solution which doens? Could you give me some details about replacing xs:include with xs:import?
And at the end, I have to change to xmlbeans, there was no problem. But I hope to use sun's jaxb some day.
Message was edited by: bruni
I looked at
and
And I noticed that these two schemas use the same naemspace URI. This is different from the original problem discussed in this topic, which involves in having two schemas with different namespace URIs, which include the same schema document..
For now, to make those schemas compile, you can remove
compile them as:
$ xjc dtc_*.xsd
If this doesn't work, try the -nv option. And if you still have problems, please also post the error messages.
Thanks for the topic.
I have a problem with the suffix of element names in imported schema. When I use :
Is there any way to get all elements of imported schema to have the same suffix as those of importing shema ?
Thank you for your help!
I suspect that the issue you are experiencing is different from this topic.
I don't have a reference handy, but IIRC,
If so, it only takes effect per namespace.
The fact that you are importing a schema suggests that
you use at least 2 namespaces, and if so you need to
declare the
I'm thinking about writing a simple customization file
editor. I think that would forestall confustions like
this and improve productivity...
Thank you very much kohsuke!
Yes, I've used 2 namespaces. But if I declare the
[b]parsing a schema...
[ERROR] Multiple
line 7 of bindings.xml
[ERROR] Another
line 17 of bindings.xml
Failed to parse a schema.
[/b]
Thank you for your help.
PS. How can I upload my schema and binding files to forum? I can't find a way to do this.
You need one
You can't upload a file to a forum, but you can send them to us!
When you include the same schema document from many schemas by means of
Because of that difference, JAXB will not be able to take the advantage of their similarities.
Many schemas written in that way can be actually re-written so that you don't define multiple copies, so I suggest you look into that approach
(IOW, think of a way to
Hi,
thank you very much for your explanation.
By the way, I've following problem when I compile for example the two schemas "purchaseRequest.xsd" and "purchaseResponse.xsd" into same package "de.mycompany.eft" (with xjc in build.xml). No any error was logged at this time, but at the runtime subdirectory it seems to be only the last one (purchaseRespone overwrite the purchaseRequest stuff) valid for Marshaling/Unmarshaling?
Am I doing basically something not correct?
Norbert
If you run XJC twice to compile them, XJC won't notice that it's overwriting the files, so you may end up getting incorrect set of files at the end.
If you run XJC once and compiled two files at once, then XJC should recognize that and report an error.
Hi,
it is the point :-) ,
thank you very mach
Norbert
OK, I saw your schema.
The problem is that you are using The -package option of XJC (in the build script), and this causes all the schema components to be generated into this package.
Since your common type library is used in two namespaces, XJC tries to generate two copies of the similar (but different) classes. The -package option tells XJC to generate both into the same package, and hence the crash.
I agree that the error message is pretty cryptic,
as it says "FooBar class in line 123 of abc.xsd is colliding with FooBar class in line 123 of abc.xsd", but given the way the schemas are organized, this is somewhat unavoidable.
Given that in the common type library you are mostly defining types, not elements, it seems to me that you can probably redesign it so that you can import this type library, not include it.
Hi,
now I know what I've to do.
Thank you very, very much
Norbert
As I only recently managed to get this all working, here are some notes....
1. only do the globalBindings in the common.xsd
2. define the package name in each xsd, NOT in xjc
3. use xsd:import in all but common.xsd
4. make sure to set xmlns:common in the namespace declarations of all but common.xsd (assuming that common just does xmlns=)
5. compile all the xsds at the same time. the method I use for this (maven) is (editor: added space between 'ant:' and 'property' so it would quit showing it as a smiley face):
[code]
[/code]
You will notice there has always been a lot of questions on how to get this working on the forums. Usually, this turned out to be because we were compiling one xsd at a time or using xsd:include
Malachi
My doubts are –
Whenever I use xsd:import tag in the xsd importing the common.xsd, I need to provide the namespace attribute. Otherwise, the element in the Common xsd is not recognized.
If I provide a namespace attribute some value, I need to have same value set in the targetnamespace of the Common (Which is not recommended above).
If I provide namespace and Common’s targetnamespace same value, I am able to generate the java source files, but, while unmarshallinng a XML, the uri for the common xsd does not match with the XML resulting in unmarshalling exception.
Could you please provide me a resolution, if you have solved this.
> Whenever I use xsd:import tag in the xsd importing the common.xsd, I need to provide the namespace attribute.
No, you don't have to. What do you mean by
"Otherwise, the element in the Common xsd is not recognized"?
I think we need to see more details. Please feel free
to file it as an issue on
I am sending you my xsds on your mail ID. Whenever I run xjc on the same, I get this error -
[xjc] Compiling file:/D:/xsd/AccountInquir
yRequest.xsd
[xjc] [ERROR] undefined element declaration 'TXN_INFO'
[xjc] line 9 of AccountInquiryRequest.xsd
Please suggest some resolution to that.
I think my issue falls into this thread. I have a "master" xsd that xsd:includes several "child" xsds. Each child xsd xsd:includes the same common.xsd. I'm getting xxx already defined errors when running xjc on my master. What is the best strategy to handle this? | https://www.java.net/node/644180 | CC-MAIN-2015-18 | refinedweb | 1,752 | 75.2 |
Hi Mark Gibson, Do you develop this with egg ? throw Products namespace ? The zcml seems good. If you develop outside of the Products namespace don't forget to include your package in the site.zcml. You can verify this by making a mistake in the zcml and try to start zope.
Advertising
Does you content implements boring.interfaces.IBoring ? -- JeanMichel FRANCOIS Makina Corpus Le Friday 17 October 2008 05:51:34 Mark Gibson, vous avez écrit : > I created a simple content type. I can create an object, but I can't > call my view or edit form on it. If I try object/boring_editform or > object/index.html I get a Not Found error. Here's what I have in my > configure.zcml: > > --- > > <browser:editform > /> > > <browser:page > </browser:page> > --- > > What am I missing? > > Thanks, > Mark > > > _______________________________________________ > Zope maillist - Zope@zope.org > > ** No cross posts or HTML encoding! ** > (Related lists - > > )
_______________________________________________ Zope maillist - Zope@zope.org ** No cross posts or HTML encoding! ** (Related lists - ) | https://www.mail-archive.com/zope@zope.org/msg31407.html | CC-MAIN-2016-44 | refinedweb | 163 | 70.8 |
Sharing the goodness…
Beth Massi is a Senior Program Manager on the Visual Studio team at Microsoft and a community champion for business application developers. Learn more about Beth.
More videos »
With Visual Basic 9 and LINQ you can easily create XML from multiple data sources including relational data, other XML sources or any other queryable object. Since most modern systems interact with each other in some form of XML the possibilities are endless. SOAP, XAML, HTML, RSS can all be created easily with LINQ to XML in Visual Basic 9. For instance, what if we wanted to display all our customers in the Northwind database on a map generated by Microsoft Virtual Earth?
Virtual Earth allows you to pass it an RSS document of items specifying their latitude and longitude to easily map out multiple locations in the world. There are a couple different formats you can pass it and one is the GeoRSS standard. All we have to do is create this XML by obtaining the latitude and longitude from the addresses we have in our customers table and then pass this GeoRSS to Virtual Earth. We can grab the latitude and longitude of our customers in the United States using the service at. This service can return a set of coordinates from any US address in a variety of formats including REST-ful RDF. We can use this service in our LINQ query in order to create the GeoRSS from our customers table in the Northwind database.
Assuming you already have a connection in Server Explorer to Northwind (or another database with addresses will do), first add a new "LINQ to SQL classes" item to your project, name it Northwind.dbml and then drag the Customers table onto the designer from the Server Explorer. The next thing to do is to import the geo namespace at the top of our code file because we’ll be using it to return the location information in the geo namespace from the XML that is returned from the geocoder.us service.
Imports <xmlns:
Now we can write a query to create the GeoRSS for our customers. Since the Northwind database contains mostly fictitious addresses you can change the addresses to real locations or we can select just the customers living in Oregon (OR) since there are a couple valid addresses there.
Dim db As New NorthwindDataContext
Dim geoRSS = _
<rss xmlns:
<channel>
<title>Northwind Customer Locations</title>
<link></link>
<%= From Customer In db.Customers _
Let Desc = Customer.Address & ", " & Customer.City _
Let Address = Customer.Address & "," & Customer.PostalCode _
Where Customer.Country = "USA" AndAlso Customer.Region = "OR" _
Select <item>
<title><%= Customer.ContactName %></title>
<description><%= Desc %></description>
<%= GetGeoCode(Address).Descendants %>
</item> %>
</channel>
</rss>
In this query we’re building up the GeoRSS and calling a user defined function called GetGeoCode that accepts the address of the customer and returns the latitude and longitude. Also notice that we’re using the Let keyword in the query in order to create query variables for description and address which are being used as we build the <item> elements. The GetGeoCode function will return an XElement of the location if one was found. The Descendants method on the XElement is then called back up in the query in order to place just the <geo:lat> and <geo:long> nodes into the GeoRSS.
Function GetGeoCode(ByVal address As String) As XElement
Dim url = "" & Server.UrlEncode(address)
Try
Dim geo = XElement.Load(url)
Return <location>
<%= geo.<geo:Point>.<geo:long> %>
<%= geo.<geo:Point>.<geo:lat> %>
</location>
Catch ex As Exception
Return <location></location>
End Try
End Function
Now that we have the GeoRSS we can pass this to Virtual Earth to create our map. For example, we can just create a simple ASP.NET application and save the GeoRSS above to a session variable. The default page contains the JavaScript code we’re going to need to send the GeoRSS to Virtual Earth and a <div> section with the id=”myMap” that identifies the area to place the map on the page. Take a look at the Virtual Earth documentation for more information on the API.
<%@ Page Language="vb" AutoEventWireup="false"
CodeBehind="Default.aspx.vb" Inherits="NorthwindVirtualEarth._Default" %>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"">
<html xmlns="" >
<head runat="server">
<title>Northwind Customers on Virtual Earth</title>
<link href="style.css" rel="stylesheet" type="text/css" />
<script type="text/javascript"
src="">
</script>
<script type="text/javascript">
var map = null;
var layerid=1;
function GetMap()
{
map = new VEMap('myMap');
map.LoadMap();
var l = new VEShapeLayer();
var veLayerSpec = new VEShapeSourceSpecification(VEDataType.GeoRSS, "georss.aspx", l);
map.ImportShapeLayerData(veLayerSpec, null);
}
</script>
</head>
<body id="body" runat="server" >
<form id="form1" runat="server">
<h1>Northwind Customers on Virtual Earth</h1>
<div id='myMap' style="position: relative; width: 800px; height: 400px;">
<asp:Label</asp:Label>
</div>
</form>
</body>
</html>
The VB code-behind for the Default.aspx page simply checks to see if there were any <item> elements returned from our geoRSS query above and if so, dynamically adds the code to call the GetMap Javascript function in the onload event of the body.
If geoRSS...<item>.Count > 0 Then
Session("georss") = geoRSS
Me.body.Attributes.Add("onload", String.Format("GetMap()"))
Else
Me.lblStatus.Visible = True
Session("georss") = <rss></rss>
End If
Another page called GeoRss.aspx is just a blank page that simply returns the GeoRSS stored in the session variable that the JavaScript calls to get the content.
Public Partial Class GeoRSS
Inherits System.Web.UI.Page
Protected Sub Page_Load(ByVal sender As Object, ByVal e As System.EventArgs) Handles Me.Load
Dim georss As XElement = CType(Session("georss"), XElement)
Response.ContentType = "text/xml"
Response.Write(georss.ToString())
End Sub
End Class
The key takeaway here is that in one LINQ statement we queried over multiple data sources, the Northwind Database and the geocoder.us service, to create a single XML document that conformed to the GeoRSS standard and passed that to the Virtual Earth service to generate our map. As you can see, it's pretty easy to create XML, in this case RSS, from multiple sources with LINQ and Visual Basic 9. The code is attached.
And if you're interested in creating dynamic maps from your data using WPF, don't forget to check out Scott Wisniewski's DevCenter featured article Create Dynamic Maps with Visual Basic 9.0 and WPF.
Enjoy!
PingBack from
Pingback from
--rj
I was converting Beth Massi's VB example of doing XLINQ from Linq to SQL to create a geoRSS to use
Beth,
I wish I had found your - excellent, clearly explained, focused article about 4 or 5 hours ago .... would have saved me from chasing my tail around the web looking for articles on SS 2005 & V Earth
thanks a million
Thankyou for your example.
What about the rest of the world though?
I'm trying to construct a map based on Australian addresses. Do you know of a service that will allow me to do a reverse lookup in the same way?
Thanks again
Beth, I REALLY want to get ur sample running BUT I am stopped. It doesn't like the : 'NorthwindVirtualEarth._Default'.
I get the following error :
Server Error in '/NorthwindVirtualEarth' Application.
--------------------------------------------------------------------------------
Parser Error
Description: An error occurred during the parsing of a resource required to service this request. Please review the following specific parse error details and modify your source file appropriately.
Parser Error Message: Could not load type 'NorthwindVirtualEarth._Default'.
Source Error:
Line 1: <%@ Page Language="vb" AutoEventWireup="false"
Line 2: CodeBehind="Default.aspx.vb" Inherits="NorthwindVirtualEarth._Default" %>
Line 3:
Source File: /NorthwindVirtualEarth/Default.aspx Line: 1
Version Information: Microsoft .NET Framework Version:2.0.50727.1433; ASP.NET Version:2.0.50727.1433
Also the Imports System.Data.Linq cannot be found.
I am using Visual Studio, .net 3.5 framework.
Any help would really be APPRECIATED.
Paul Dykes
Hi PauleyHoyt,
I just downloaded and tested the attached sample here just fine. Are you sure you are running Visual Studio 2008? It sounds like either the target framework got changed or there is something wrong with your environment. Can you verify this?
-B
Beth, thank u VERY much for getting back. Yes I am using Visual Studio 2008. I am using .net 3.5 framework and I even tried .net 2.0 The show-stopper is the Error 3 on loading the NorthwindVirtualEarth._Default and there is also the same load Error 4 on .geoRss.
Note the parser error shows: "Version Information: Microsoft .NET Framework Version:2.0.50727.1433; ASP.NET Version:2.0.50727.1433 " YET the project properties shows Target Framework of .NET Framework 3.5 !!!! Don't understand this.
Any Ideas.
Thanks PauleyHoyt
Error 3 Could not load type 'NorthwindVirtualEarth._Default'. C:\Documents and Settings\Paul Dykes\My Documents\Visual Studio 2008\Projects\NorthwindVirtualEarth\Default.aspx 1
Error 4 Could not load type 'NorthwindVirtualEarth.GeoRSS'. C:\Documents and Settings\Paul Dykes\My Documents\Visual Studio 2008\Projects\NorthwindVirtualEarth\GeoRSS.aspx 1
Error 5 Type 'NorthwindDataContext' is not defined. C:\Documents and Settings\Paul Dykes\My Documents\Visual Studio 2008\Projects\NorthwindVirtualEarth\Default.aspx.vb 11 23 C:\...\NorthwindVirtualEarth\
I just finished my last talk of the conference on LINQ to XML and it was lots of fun as always. I've
Hi
I am trying the same with C# and VE 6.2. My georss.aspx return the rss file correctly if I run but when I give it in VEShapeSourceSpecification(VEDataType.GeoRSS, "georss.aspx", l); It says "Unable to load source file".
If I take the output of georss.aspx and save as xml and give the xml file name in the above function, map loads correctly with the points. Am I missing anything.
Thanks for the great article anyways.
Just ignore my question above, I was using XmlTextWriter in my georss.aspx and I had not mentioned the Response.ContentType = "text/xml";
reponse is now a real xml file and VE seems to understand it.
Now it works like a charm...
thanks a lot.
Hi, i am new to programing and currently learning by myself. It would be great if you could post this program on C# instead?
Thanks
Hi furball,
XML literals syntax is not supported in C#. You have use the LINQ to XML API directly. I'm not sure how you would translate this program but here's some info on the syntax:
HTH, | http://blogs.msdn.com/b/bethmassi/archive/2007/12/03/northwind-meets-virtual-earth-generate-ve-maps-with-linq.aspx | CC-MAIN-2014-35 | refinedweb | 1,743 | 58.18 |
2 Cool Things You Can Do with the Facebook Graph APIBy Shaumik Daityari
In December 2011, Facebook officially deprecated its REST API and launched the Graph API for public use. Since then, all new features have been added to the Graph API and Facebook has enabled users to perform loads of new things, some of which we will discuss today. In this post, we will be making a lot of requests to the Graph API, receiving JSON responses, and thereby manipulating them to get our desired results.
The Access Token
Most requests to the Graph API need an access token as a parameter. An access token is unique to the combination of a logged in user or page and the Facebook App that makes the request.
A token is associated with a Facebook app to handle the permissions that the user has granted to the app. This defines the resources that are accessible through the access token. Thus, a token provides temporary and secure access to Facebook. You can get an access token from the Graph Explorer. A token may or may not have an exipry time depending on whether they are short-term or long-term tokens. After the expiry of a short-term token, you need to re-authenticate the user and get a new token.
Contests Through Facebook Pages
In recent times, small and up-and-coming organizations have used Facebook pages effectively to promote their content. Yet, getting ‘likes’ and thus, increasing your reach, is a slow and steady process. Many turn to Facebook ads for this purpose. Many others, though, take a cheaper alternative — by organizing contests through their page.
The usual contest involves posting a photo or a paragraph on the page about an experience. The contest is judged on the basis of the number of ‘likes’ on the post or the photo. There’s also an extra condition for participating in the contest. For a ‘like’ to be valid, the user needs to like the page too. Facebook doesn’t have any built-in feature that tells you how many likes are common to your post and page. That makes judging the contests difficult.
Non-programmers would feel that the only way to judge the contest is by cross checking the number of likes manually. Fortunately, the Graph API helps us perform this action without much hassle.
Although I am going to perform the action through Python, the process remains the same for other languages. The important part is the target URLs that we send the requests to and the data we get from the received JSON.
A conceptually easy way to do this would be to get the list of likes on a post and the list of likes on a page and then compare them. However, there is no functionality in Facebook that gets the list of likes on a page as of now. We will use the reverse process to check whether each like on a post likes the page as well.
The following call checks whether a user likes a page or not. The detailed documentation is available here.
GET /{user-id}/likes/{page-id}
If the user likes the page, the JSON response contains
data about the page, but if the user doesn’t like the page, an empty
data is received. We use the following function to determine if a user likes a page or not.
def user_likes_page(user_id, page_id): """ Returns whether a user likes a page """ url = '' % (user_id, page_id) parameters = {'access_token': TOKEN} r = requests.get(url, params = parameters) result = json.loads(r.text) if result['data']: return True else: return False
The next step is to get the list of likes for a particular post and find out whether the users likes the page too. The following call gives us the list of likes for a post, provided we have proper access.
GET /{post-id}/likes/
Combining the two ideas, we make the following function to check how many likes in a post are common to the page too.
def get_common_likes(post_id, page_id): """ Returns the number of likes common to a post and the page """ count_likes = 0 url = '' % post_id parameters = {'access_token': TOKEN} r = requests.get(url, params = parameters) result = json.loads(r.text) for like in result['data']: if user_likes_page(int(like['id']), page_id): count_likes += 1 print 1 return count_likes
Mass Responding to Posts on Your Timeline
On your birthday, I am sure you get hundreds (if not thousands) of posts. Replying to each of them is tedious! Many people put up a status thanking everyone for their wishes, while others prefer to thank each one personally. Let us see how we can choose the personal option and do it in a short amount of time.
The call to get the feed for users or pages is as follows.
GET /{user-id}/feed
In case you want to get the posts on your timeline, you can replace
{user-id} with ‘me’, which makes the process look easier. To manipulate hundreds and thousands of posts, you would not be able to get them in a single page. You would need to go a step ahead and check the
next url in the JSON response.
The function that gets all the posts on your timeline is as follows.
def get_posts(): """ Returns the list of posts on my timeline """ parameters = {'access_token': TOKEN} r = requests.get('', params=parameters) result = json.loads(r.text) return result['data']
The next step is to publish comments on your timeline. The call that is used to perform this action is as follows.
POST /{object-id}/comments
The comment should be sent as a
message in the
POST request above. So, the function that we use to comment on posts is as follows.
def comment_on_posts(posts): """Comments on all posts""" for post in posts: url = '' % post['post_id'] message = 'Commenting through the Graph API' parameters = {'access_token': TOKEN, 'message': message} s = requests.post(url, data = parameters)
The scripts that I have used for both of these can be found on GitHub. In addition, you can take it one step further by making multiple API requests at the same time.
An Alternative Approach
Akshit Khurana, on Quora, discusses another approach to this through the use of Facebook Query Language (FQL). FQL is an SQL-like language that lets you query the data that you receive through the Graph API. There is a list of tables, each with its own list of columns that can be queried, thus helping you filter your data.
Conclusion
Facebook has been working hard since the launch of the Graph API and new features are being added to it frequently. If you plan to work on mobile or web applications that are linked to Facebook, the use of the Graph API is a must. Facebook also maintains extensive documentation, which explains in detail the features and variety of uses of the Graph API. | https://www.sitepoint.com/2-cool-things-can-facebook-graph-api/ | CC-MAIN-2017-34 | refinedweb | 1,149 | 70.73 |
xmind2testlinkxmind2testlink
With xmind2testlink, you will be able to convert xmind tests to testlink tests xml files. You should have python installed before running it. See also xmindparser.
Requirement: python 2.7 or 3.4 +
中文说明：xmind2testlink - 快速设计测试案例并导入TestLink，如果你的xmind中包含中文或者unicode，请使用Python 3.4+，谢谢。
Installation and quick startInstallation and quick start
The most easy to install xmind2testlink is using pip command:
pip install xmind2testlink -U
Now you are ready to convert an xmind to TestLink xml:
xmind2testlink /path/to/testcase.xmind Generated: testcase.xml # output json is also supported xmind2testlink /path/to/testcase.xmind -json Generated: testcase.json
To build your tools with this package, do it like this:
from xmind2testlink.xmind_parser import * from xmind2testlink.testlink_parser import * # do your stuff
Conversion RulesConversion Rules
Now xmind2testlink has been upgraded to v2, it supports 2 kinds of conversion.
v1 rulesv1 rules
For old users (xmind2testlink v1), your xmind looks like below structure.
The output:
Generally to say:
- The first sub topic => suite
- The sub topic of suite => test case title
- The sub topic of test case => test step
- The sub topic of test step => expected result
v2 rulesv2 rules
Latest update:
xmind2testlink will auto detect v1 and v2 rules by checking if descendants of testcase node (3rd level nodes)
still have priority maker. If yes, this file will be processed by v2 rule, else by v1 rule.
V2 xmind looks like this:
The output:
Rules:
- Mark root topic with a star marker, this means v2 xmind file. (no matter what color of star maker, optional)
- First sub topic => it is still converted to suite
- Test case title will be combined by sub topics, until:
- Child topic is marked with priority
- Current topic is end topic
By default, the title parts are connected by blank space, you can define the
connector by last char of root topic, like this.
Then the output will be changed to:
Note: only valid chars can be used as a
connector.
More detailMore detail
Notesfor a test suite =>
detailsin TestLink.
Notesfor a test case =>
summaryin TestLink.
preconditionsin TestLink.
Prioritymaker for a test case =>
importancein TestLink.
flag-greenmaker for a test case =>
execution typein TestLink.
- Sub topics for a test case will be treated as test steps.
- It is okay to design test step with action but without expected results.
- Use
!to ignore any test suite / test case / test step that you don't want to convert.
- Root topic will not be converted, just treat it as target suite node in TestLink.
- Free topic and notes will not be converted.
- Only the first sheet in xmind will be converted.
XmindZen UpdateXmindZen Update
Now
xmind2testlink support xmind zen files, remember one thing, you cannot add comments for a topic in xmind zen, so we cannot create preconditions for ZEN!
Download the sample xmind files:
Guide: Import into TestLinkGuide: Import into TestLink
Go to your TestLink website, import the xml into your target test suite step by step.
To avoid duplicates, you might want to Update date on Latest version.
Once you click on the Upload file button, all the tests will be imported as they listed in xmind.
The field mapping looks like below figure.
Advanced usageAdvanced usage
1. Use from browser1. Use from browser
A simple web page to host this feature also has been built in
web folder. To start the website, here is the command:
# clone this git repo ahead cd /path/to/xmind2testlink/web pip install -r requirements.txt -U python application.py * Running on (Press CTRL+C to quit) * Restarting with stat
Start a browser, then you will be able to convert xmind to TestLink via. I am not good at web design, but I am trying my best to provide a friendly interface :-)
If you wan to deploy this application to a web server, please checkout Flask Deployment.
3. Run in Docker3. Run in Docker
If you have docker installed, you just need 1 line code to run xmind2testlink.
docker run -d --name xmind2testlink --restart always -p 3000:5001 tobyqin/xmind2testlink
Now go to you will able to use xmind2testlink in browser.
Build and run your docker engine:
cd web docker build -t xmind2testlink:latest . docker run -d --name xmind2testlink --restart always -p 3000:5001 tobyqin/xmind2testlink
3. Batch on Windows3. Batch on Windows
It is okay to batch convert all xmind files in a folder, copy the
xmind2testlink_all.bat to your folder, then you will be able to convert all files by double clicking on it.
@echo off @echo off echo Batch xmind to testlink... python -m pip install xmind2testlink -U >NUL python -c "import glob, os;[os.system('xmind2testlink ""{}""'.format(f)) for f in glob.glob('*.xmind')]" echo OK! | https://libraries.io/pypi/xmind2testlink | CC-MAIN-2021-10 | refinedweb | 775 | 74.29 |
ROS melodic does it support Turtlebot2 ?
I installed Ubuntu 18.04 on my machine, and ROS melodic as well. How could I install the packages of Turtlebot 2 ?
I installed Ubuntu 18.04 on my machine, and ROS melodic as well. How could I install the packages of Turtlebot 2 ?
answered 2018-06-19 18:51:34 -0600
The turtlebot packages to support the TurtleBot2 have not yet been released into Melodic. Since melodic is an LTS release we expect to release the turtlebot packages there, but we have not finished testing as well as verifying that ll the dependencies are already ready. Look for an announcement in the TurtleBot Discourse Category
If you want to use 18.04 in the mean time before things are released you can always build it from source. There have not been many changes recently so likely it will just work out of the box. I'd suggest installing the core from debian packages and putting the turtlebot packages into a workspace.
There's a landing page for the TurtleBots here: which can hopefully get you started.
Thanks for this question, would also like to run full TurtleBot2 stack in melodic on Ubuntu 18.04. Managed to actually build all of that and while waiting for the TB2 to arrive, want to work with simulator. Very close, but depthimage_to_laserscan nodelet is somehow broken.
For the build this worked
$ cd ws-melodic $ wstool init src $ wstool merge -t src $ catkin_make
Running
$ roslaunch turtlebot_gazebo turtlebot_world.launch
almost works but getting
[ERROR] [1531744943.775336027, 0.200000000]: Failed to load nodelet [/depthimage_to_laserscan]
Seems that this nodelet is obsolete, superceded by other mechanism e.g. pointcloud-to-laserscan. Help apprec
Please start posting anonymously - your entry will be published after you log in or create a new account.
Asked: 2018-06-19 18:41:10 -0600
Seen: 5,110 times
Last updated: Jun 19 '18
How to solve E: Unable to correct problems, you have held broken packages.
Python namespace ignored in MoveIt
How to code user inputs and print messages?
Camera image only in rqt_image_view
moveit segfaults due to eigen
Is ROS Melodic developed enough to learn ROS as a beginner?
I am following ros ar track tutorial, but I have error while running localhost.
tf_broadcaster: fatal error: ros/ros.h: No such file or directory
xacro property names not recognised by roslaunch | https://answers.ros.org/question/294600/ros-melodic-does-it-support-turtlebot2/ | CC-MAIN-2019-51 | refinedweb | 395 | 74.49 |
Jon Camilleri wrote:Any idea how to add some object to my Vector?
Jon Camilleri wrote:As you might notice I'm trying to address what seems to be a common issue...a dynamically expanding array of objects, ideally of any type.
Mike Simmons wrote:. . . in the current millenium.
java IntArrayListDemo 123 234 345 456 567 678 789
Campbell Ritchie wrote:That roseindia demonstration was not really useful. It didn't tell you to declare your object by its interface. You would do better to declareList<List><Integer>> intList;
. . .
intList = new ArrayList<List><Integer>>();
. . .
intList.add(new ArrayList<Integer>());For some reason, which I don't know, I am getting >< when I typed <. Readers: please check for that error.
Anyway, why don't you declare the List to take int[] elements?import java.util.List;
import java.util.ArrayList;
public class IntArrayListDemo
{
private List<int[]> intList;
public static void main(String[] args)
{
new IntArrayListDemo(args).go();
}//end main
public IntArrayListDemo(String[] args)
{
intList = new ArrayList<int[]>();
int[] numbers = new int[args.length];
intList.add(numbers);
for (int i = 0; i < args.length; i++)
{
numbers[i] = Integer.parseInt(args[i]);
}
}//end constructor
private void go()
{
for (int[] numbers : intList)
{
System.out.printf("%n%s : ", numbers);
for (int i : numbers)
{
System.out.printf("%d ", i);
}//end inner for-each
}//end outer for-each
}//end go
}//end class
java IntArrayListDemo 123 234 345 456 567 678 789
And see for yourself what happens. | http://www.coderanch.com/t/445701/java/java/newbie-Vector-arrays-add | CC-MAIN-2014-10 | refinedweb | 240 | 61.53 |
Team Foundation Version Control (TFVC) has the most common functionalities for version control systems (e.g.:. SourceSafe, Source Gear, CVS, Subversion, etc.) like management of file versions, management of users and permissions associated with the source code, or creating branches inside a project. TFVC also introduces new features such as "shelving and unshelving changes", "Check-in policies", and "exclusive or shared check out" (more info: MSDN).
Working with TFVC, you will be involved in many tasks such as: managing workspaces, setting user permissions, looking for who leaves files locked, comparing files history, destroying version control files/folders from TFS, etc. Some of these features are only available through command-line, and because of this, at the end of the day, you may write a lot command lines. This is where the "Team Foundation Sidekicks" tool comes into play.
Searching in the web for a graphical tool to handle most of these common tasks mentioned above, I found a site which describes one of its products as "a suite of tools for Microsoft Team Foundation Server administrators and advanced users, providing a Graphical User Interface for administrative and advanced version control tasks in multi-user TFS environments". And, the best part about it is that it is a freeware suite, and it may be used for commercial or noncommercial purposes under this license.
So, I created a test project inside TFS, and I started to evaluate all the product features, see more info here. After a playing with it for a while, I found a lot of cool functionalities, but the one that caught my attention was a menu item labeled "Add Sidekick..". And, I thought, maybe I can write my own TFS sidekick and plug it into this tool.
Sometimes, I need to permanently delete files/folders from TFVC (destroy files/folders) due to disk space requirements; I remove projects that might be created for testing purposes, etc. This feature is only available through the command-line interface. It depends on how deep the files/folders are inside the project structure. I may end up writing a long path to achieve my objective. So, it would be great to have a file explorer (similar to Windows Explorer for file systems) that would allow me to destroy files/folders I don't need. Let's try to create a user friendly interface for "destroying" files/folders from TFVC.
The first thing you need to do is to download and install the Team Foundation Sidekick tool (Team Explorer 2005 or 2008 must be installed on a computer in order to run the application, see implementation notes). Once you have installed Team Explorer and Team Foundation Sidekick, you'll have the API for extending the Team Foundation Version Control features. The Team Foundation Sidekicks controls must inherit from the
BaseSidekickControl base class, and must also override the public
Image property in order to create a menu and toolbar items for your sidekick entrance point, and initialize the public
Name property to give a name to these"); } } } }
It is also recommended that we create a "
Controller" class derived from
TfsController in order to play safely with the connection and security contexts provided by the Team Foundation Sidekick application. In this class, we will write all the necessary methods to achieve our objectives.
namespace MySidekick.Controller { public class DestroyFilesAndFoldersController : TfsController { public DestroyFilesAndFoldersController(TfsController baseController) : base(baseController) { } } }
Then, we need to override the
Initialize method to create an instance of your controller class inside the
DestroyFilesAndFoldersViewControlClass each time we load the control into the main form by clicking the menu or the toolbar"); } } public override void Initialize(TfsController controller) { this._controller = new DestroyFilesAndFoldersController(controller); } } }
At this point, we only have to write the method that actually destroys the files/folders from TFVC. If we explore the
VersionControlServer class inside the Microsoft.TeamFoundation.VersionControl.Client assembly, we can see a method named
Destroy.
public Item[] Destroy(ItemSpec itemSpec, VersionSpec versionSpec, VersionSpec stopAt, DestroyFlags flags);
But, in the SDK Reference for Team Foundation Server, there is no information about the
Destroy method. Also, we can try to get information about the parameters passed to the method like
ItemSpec. All that we get is "This API supports the Team Foundation Server infrastructure and is not intended to be used directly from your code". All this lack of information makes sense because
Destroy is a very dangerous operation; so, we need to remove all possible ambiguity about which items will be destroyed. (Of course, we need to have Administrator rights in the project). Maybe, it is a good practice to destroy only those files we previously deleted from the project.
public ItemSpec(string item, RecursionType recursionType, int deletionId);
Here,
item is the full server path to the item or the folder to destroy (local file paths aren't allowed) and
deletionId is assigned to the file/folder.
Once we can create an instance of the
ItemSpec class:
public ItemSpec GetItemsSpec(string path, int deletionID) { return new ItemSpec( path, RecursionType.Full, deletionID); }
all we have to do is call the
Destroy method using the base class and fulfill all its parameters.
public void Destroy(string path, int deletionID) { base.VersionControl.Destroy(GetItemsSpec(path, deletionID), VersionSpec.Latest, null, DestroyFlags.None); }
More information about the
Destroy method is available here.
Then, we just need to compile the control to build the assembly that we will load into the Team Foundation Sidekick frame using the "Add Sidekick.." menu item.
And, as you can see in the image below, we have a new menu item labeled "Destroy Sidekick".
Clicking on it, we will see the following screen. And now, we only have to search for the files/folders that we want to remove, and press Delete in the keyboard.
That's all, I hope you enjoyed this article.
General
News
Question
Answer
Joke
Rant
Admin | http://www.codeproject.com/KB/DLL/MySidekicks.aspx | crawl-002 | refinedweb | 970 | 50.46 |
US5377191A - Network communication system - Google PatentsNetwork communication system Download PDF
Info
- Publication number
- US5377191AUS5377191A US07604696 US60469690A US5377191A US 5377191 A US5377191 A US 5377191A US 07604696 US07604696 US 07604696 US 60469690 A US60469690 A US 60469690A US 5377191 A US5377191 A US 5377191A
- Authority
- US
- Grant status
- Grant
- Patent type
-
- Prior art keywords
- gui
- user
- routine
- run
- routines
-
1. Field of the Invention
This invention relates to a network communication system for use in handling communications between access units which may comprise office automation systems, telex, teletex, facsimile, etc.
Abbreviations and acronyms used herein are listed at the end of the description. References to Data General are to Data General Corporation, the assignees of the present application.
2. Description of the Prior Art
There exist today many proprietary communications systems and various international standards relating to message handling and data transmission. Nevertheless there is no system in existence which will allow all kinds of access units to communicate freely with one another.
It is true that there do exist gateway systems, known commercially as Soft-Switch and Mailbus which are intended to allow interchange of messages between dissimilar systems. However these known systems are essentially suitable for use by private corporate and other large users because they utilize a proprietary message transfer protocol handled via a central processing system which converts from and to the message protocols employed by the various gateways. Moreover they are set up as complete systems in which each gateway has to know what other gateways there are on the system and what are the characteristics of the various gateways.
The known systems are neither intended for nor suitable for public services.
Another problem with which the invention is concerned arises in conjunction with computer operating systems (e.g. MS-DOS and UNIX) which are single threaded, i.e. they can handle only a single processing thread at a time. This leads to the result that routines frequently have to wait if the processing path comes to a halt while waiting for an external event. The routine is said to pend. Although other operating systems can handle multiple threads (e.g. AOS/VS) the system according to the invention is desirably not restricted to a particular operating system and should be capable of operating with single threaded operating systems. Some systems, e.g. UNIX can simulate multitasking by holding a plurality of copies of a program in memory and scheduling the allocation of the CPU to the different processes. However this is wasteful of memory resources. MS-DOS has no built-in facilities for achieving even this level of multi-tasking.
In a network communication system waiting for events occurs all the time, e.g. as transfers are effected across interfaces, and single threaded systems lead to inefficient usage of computer resources, for the reasons explained above.
The object of the present invention is to provide an improved system which will allow access units to utilize gateways or nodes in an unrestrained way, without any knowledge of the nature of the system or of the other gateways or nodes in the system.
The terms "node" and "gateway" are used interchangeably herein even although some nodes may not by strictest definition be gateways.
More specifically the improved system is intended to be utilizable by PTTs (postal, telegraph and telephone authorities) to provide gateways which may be accessed by the respective access units for transparent communication with access units connected to the same system or another system installed by a different PTT.
The improved system is equally suitable for use by other large users such as public and private corporations for example.
Another object of the invention is to avoid the need for routines to pend awaiting external results, even in a single threaded operating system. Such a routine will be called an unpended routine.
The network communication system according to the invention comprises a plurality of gateways or nodes for serving respective access units. For example, one node may serve a facsimile network, another node a telex network, other gateways a plurality of proprietary office automation systems such as CEO (Data General Corporation), DISOSS and PROFS (both IBM), etc.
The gateways or nodes are connected to communicate with each other via a standard message handling system, preferably the CCITT X400 Standard, hereby incorporated by reference. X400 exists in a 1984 version (denoted 1984 X400 herein) which has been implemented by many users. X400 also exists in a 1988 version (denoted 1988 X400 herein) and it is this system which is preferably employed as the "backbone" of the inventive network communication system. It is particularly advantageous that the invention can thus employ an accepted, international standard and not introduce yet another proprietary message handling system. However, since 1988 X400 is not yet widely implemented, it is particularly advantageous to provide as one of the gateways an X400 gateway, which can interface the "backbone" to the somewhat lower-specified 1984 X400.
Each gateway or node of the system according to the invention comprises a network interface providing access to the access unit or units served by that gateway. This is the external, user-specific interface of the gateway. Each gateway moreover comprises an external message transfer interface (MTI) for sending messages to and receiving messages from the standard message handling system, or backbone.
Internally each gateway comprises a software interface which is identical in all gateways and moreover matches the message transfer interface. A library of core routines provide communication between the message transfer interface and the software interface. This library contains the bulk of the gateway software and, since it is the same for all gateways, the invention avoids the heavy expense of developing a lot of software specific to each gateway.
Each gateway further comprises a library of specific routines individual to that gateway and which provide communication between the network interface and the software interface. These routines convert between the format and protocols of the network interface (which are specific to each gateway) on the one hand and the standardised format and protocols of the software interface on the other hand. These node-specific routines represent a much smaller part of the software of each gateway.
Examples of the functions performed by the core routines are as follows:
Assemble and transmit a packet of data to the backbone
Receive and disassemble a packet from the backbone
Look up destination address in a directory
Submit a document to a document format converter
All housekeeping function, such as logging and audit trail, accounting, error handling.
Examples of the functions performed by the specific routines are as follows:
Convert from/to the format specific to the network served by the gateway.
Convert between addresses within the network served by the gateway and within the host backbone.
The communications between the gateways or nodes on the standard message handling system are effected in protocol data units (PDU's). Each PDU comprises--see X--400--an envelope part and a message part. The envelope part includes data identifying the message originator and the message recipient but does not contain any data specific to the gateway serving the message recipient. In accordance with X400 1988, the envelope part, denoted P1, comprises primarily the originator, the destination, message priority and an indication of whether a delivery report is required. The message part, denoted P2, comprises a header, which repeats much of the P1 data and includes a subject title, a document type identifier and the main body of the message.
This is a highly significant feature of the invention because it enables any access unit to send a message to any other access unit without concerning itself in any way with the nature of the receiving gateway. Indeed the originator does not have to know that any gateways are involved. The system according to the invention is completely transparent to its users and can be installed by PTTs to enhance greatly their message handling capabilities in a way which requires no action on the part of end users. What is more the system does not have to be reconfigured when a gateway is added or removed. Of course, users have to know the addresses with which they wish to communicate but the fact that they are on various gateways does not have to be known. This is because the envelope part of each PDU does not contain any data specific to the gateway serving the message recipient. All messages simply go out onto the universal messaging backbone and a gateway which recognises a recipient address accepts the message.
A subsidiary problem resides in the existence of different document formats. There are various word-processing formats in common use, various file formats and formats specific to telex and teletex. Further features of the invention relieve an originating access unit of any need to worry about the format details of the message recipient (although common sense must naturally be employed--it is no use expecting a highly formatted word-processing file to be handled satisfactorily by a telex recipient). Document converters for format conversion are known in themselves and may be incorporated in the network communication system according to the invention.
The envelope part of any protocol data unit whose message part consist of a document (or part of a document) includes format information identifying the document format. The library of specific routines of each gateway includes routines which are responsive to received format information to submit the message part automatically to the document converter when the format information identifies an incompatible format. Gateways are thus free to transmit in any document format, without regard to the document formats acceptable to recipients, secure in the knowledge that, if conversion is necessary, it will be taken care of automatically.
Within the message handling system, such as 1988 X400, there will be a standard address structure comprising many parts for identifying message originators and recipients. Most network interfaces will employ different address formats of much more restricted range. It is accordingly preferred to provide at least one directory accessible to each gateway via the message handling system. The library routines include routines which submit data identifying the message originator and message recipient at an originating gateway to the directory or directories. This is used to determine identifying data in a standard form (in accordance with the message handling system) for inclusion in the envelope part of the PDU. Further routines submit the identifying data in the envelope part of a received PDU to the directory or directories in order to determine at least the message recipient in the form which is required by the network interface of the receiving gateway.
Preferably the system comprises a main directory unit holding a directory which is directly accessible by all the gateways on the message handling system. This directory may be in compliance with the CCITT X500 Standard. However one or more subsidiary directories may be held in directory units within individual gateways. Such a directory is indirectly accessible to other gateways via the message handling system and the holding gateway.
The invention further comprises, as part of the core routines, an interface which can operate with different operating systems (such as AOS/VS on an MV computer, MS-DOS on a PC and UNIX on an MV computer or other hardware). The interface is referred to as a General Unpended Interface, GUI. Under GUI, when a routine wishes to make a request of a service provider, specifically a GUI-conformant service provider (GCSP) the user calls the relevant routine but does not wish to wait for its completion. Rather, the user is informed when the routine is complete by way of a notification routine. In the meantime the user can carry on with other processing.
FIG. 1 illustrates the overall system,
FIG. 2 is a block diagram of the hardware of one gateway of the system,
FIG. 3 is a functional block diagram of one gateway of the system,
FIGS. 4 and 5 illustrate the transfer of a message between two different networks,
FIGS. 6 to 12 show the steps in handling a message in more detail,
FIG. 13 illustrates performance of two concurrent tasks under GUI (general unpended interface),
FIG. 14 shows a key to FIGS. 15, 16 and 17,
FIGS. 15 to 17 show the flow of routines under GUI,
FIG. 18 shows the structure of a GUI,
FIG. 19 shows a job queue structure for a GUI,
FIGS. 20 to 25 show various GUI data structures, and
FIGS. 26A and 26B show an example of usage of GUI within the communications server network.
This description is in four main sections:
I General system description
II Network communication
III General unpended interface
IV Abbreviations and acronyms
It is emphasised that the whole of the description is given by way example and the invention is not limited by any of the features disclosed, except insofar as defined by the appended claims. For example, GUI is described primarily in conjunction with a communications server system but it is not limited to this particular application. The GUI routines do not necessarily have the structure described. The organisation of the routines of the communications server system offers infinite possibilities for variation, and so on. Moreover the detailed coding of the routines and indeed the language in which they are coded are a matter of choice for the programmer implementing the invention within the context of particular hardware and for a particular application.
FIG. 1 shows a plurality of nodes or gateways 12 communicating with each other via a universal messaging backbone 15 using the 1988 X400 protocol and, at least in part, the X25 packet switched message transfer protocol (although each gateway may use other media for part of its communication path, e.g. land lines). FIG. 1 shows eight gateways by way of example; there is in principle no restriction on the number of gateways. Examples of the gateways are:
CEO gateway 12A for the Data General CEO office automation network 13A
SNADS gateway 12B for IBM DISOSS office automation network 13B
SNADS gateway 12C for IBM PROFS office automation network 13C
X400 gateway 12D for 1984 X400 communication with X400 network 13D
Fax/telex gateways 12E for communication with fax and telex networks 13E, F
Each gateway is connected to its network through a standard interface or access unit 14A-14F. For clarity, each gateway is shown dedicated to a single network and indeed such a configuration may well be adopted in practice, at least so far as some gateways are concerned. On the other hand, a single gateway may serve a plurality of different access units. FIG. 2 described below is a combined fax/telex (telefax) gateway and, as another example, a gateway may be both a CEO gateway and a fax/telex gateway. This requires the gateway to have both the necessary interfaces and also the necessary specific routines for each type of access unit.
The overall system in FIG. 1 is denoted Communications Server (CS) System 10. Each gateway 12 has an interface 15A denoted MTI for message transfer interface and these interfaces communicate via the 1988 X400 protocol as indicated by a `bus` 15B--which may be constituted physically by any form of communications links. The interfaces 15A and `bus` 15B constitute the messaging backbone 15. The `bus` 15B also provides communication with directory services 48 and a master document converter 46. These services, coupled with the messaging backbone 15 itself may be regarded as the host 10A of the communications server system 10.
The physical location of the master document converter 46 and the directory services 48 is immaterial. Structurally, each may comprise a database and a processing facility and each may thus be physically located in one of the gateways 12 or in a dedicated gateway. The master document converter 46 implements conversion routines, such as are well known per se in PC programs, as well as in more sophisticated applications software. The directory services 48 database may be, as already stated, in compliance with the CCITT X500 Standard, hereby incorporated by reference and provides standard database facilities for querying and searching directory entries as well as adding, amending and deleting entries.
FIG. 2 shows the overall hardware configuration of a typical gateway, which interfaces to a plurality of networks and devices. A combined telex/fax (telematic) gateway 13E,F is chosen as the illustrated example. It is assumed that a plurality of computers are required to handle the volume of processing and the embodiment shown comprises three Data General MV series mini-computers MV1, MV2, MV3, each with an associated disk drive D1, D2, D3 storing the respective computer programs. The computers are connected by a high speed LAN 16, such as a standard (thick) Ethernet LAN or an MRC bus carrying 400 Mb/s. The computers are further connected via a disk controller 18 to a bank of disk drives D4 to D8 (for example) constituting a disk farm 22 for molding the user data.
The computers are connected via a terminal switch 20 to a plurality of interfaces here shown as a telex interface 14F, a fax interface 14E and a printer interface 14P. The terminal switch 20 enables the various access units to share the computer resources and moreover enables two good computers to be used when one is down and generally makes it possible to use the resources in a flexible manner. In principle the invention does not require a plurality of computers and the way in which a plurality of computers is used forms no part of the invention. Briefly they will be handled in accordance with the known principles of multi-processor systems with one computer acting as master and assigning the activities of the others and controlling the terminal switch 20 and an X25 switch 32 so that the correct computer communicates with the correct interface for each input/output operation performed, also with provision for a different computer to take over as master under fault conditions. In a simpler system, there will be one computer and the terminal switch 20 will not be required.
Each computer moreover has a connection to the X25 switch 32 connected to a PDN (public data network) interface 34 and possibly also to a leased line 36, one use for which would be a direct connection to another gateway. The interface 34 implements the message transfer interface 15A of FIG. 1, forming part of the universal messaging backbone 15.
FIG. 3 is drawn as another block diagram but illustrates the configuration of a gateway in functional terms rather than hardware terms. If the gateway is again assumed by way of example to be a telematic gateway serving telex and fax, the actual telex and fax communications will be handled by standard items with which the present invention is not concerned, e.g. a Hasler telex unit and a PC with a fax card, such as a GammaFax CP/T card. These standard items communicate with a network interface 14 which acts as one port of the gateway and may comprise plural interfaces, as in FIG. 2. Similarly, the network interface 14 might be matched to a CEO network, a PROFS network, and so on. The message transfer interface 15A forms a second port communicating with the messaging backbone bus 15B.
The interfaces 14 and 15A are linked by a software interface 44 which is identical in all gateways. This interface 44 comprises a library of core routines which provide communication between the message transfer interlace 15A and the software interface 44. Although this core library could be and is always functionally equivalent to a single library it may, for convenience, be handled as a plurality of separately maintained libraries. In the present embodiment these comprise libraries denoted TOOLS, GUI, ART. GUI represents a General Unpended Interface and is fully described below. ART represents ASN.1 (ISO standard) Run Times library routines, i.e. routines for encoding data in a format in accordance with the ISO ASN.1 standard, hereby incorporated by reference. These routines are used by TOOLS to build PDUs, specifically 1988 X400 PDUs.
The non-specific software interface 44 is matched to the network interface 14 by a library of specific routines 45. The specific routines comprise the routines necessary at higher level to control the flow of messages, in accordance with the nature of the gateway which they serve. TOOLS on the other hand provides "tools" or services common to all gateways. More specifically TOOLS routines impose the X400 1988 format on the PDUs constructed by ART,send the messages, receive message confirmations, receive messages, send confirmations, handle the disk saves, submission to the directory service and to the document converter and may perform other functions required in common by the gateways
The gateway communicates via the messaging backbone 15 with the document converter 46 and with the main directory service 48. It may optionally include its own sub-directory library 49.
When a user on one network sends a message "A" via the corresponding gateway to a user on a different network via the gateway corresponding thereto, the network communication system 10 converts the message from the specific format of the source network, here assumed to be CEO, to the different specific format of the destination network, here assumed to be PROFS. FIG. 4 shows the CEO network 13A sending message "A" in CEO format to the system 10. Then (FIG. 5) the system 10 converts the message to PROFS (SNADS) format and sends it to the PROFS network 52.
This process typically involves address translation, handled by the directory service 48, protocol conversion, handled by the specific routines 45, and document format conversion handled by the document converter 46. A second example will now be described in more detail. In this example the scenario is that of a message arriving from an external 1984 X400 network (say one provided by a PTT) and leaving via a fax card into the telephone network.
FIG. 6: The X400 network 13D opens a connection to the 1984 X400 gateway 12D. It transfers the message from the PTT network to the X400 gateway 12D. The message is then saved on to disk, namely in the disk farm 22, as indicated at 58, (so that even if the system crashes, the message will not be lost).
The message is checked for validity and the addresses of the recipients are checked to ensure that the recipients are "within" the network communication system. These procedures are well known per se in communications networks. The message is then placed on a queue of messages to be processed further, indicated at 60. The message is acknowledged to the remote (PTT) system 13D.
FIG. 7: The message was received in 1984 X400 format and needs to be converted into 1988 X400 which is the internal format used by the system. Trace Information is added in accordance with conventional communications techniques. This information is used to track a message through all the systems which it traverses. It is used to detect looping messages (they pass through the same system twice). The message is then passed to TOOLS in the software interface 44.
FIG. 8: The recipients are looked up in the directory service 48 to see which gateways the message should be sent to. The originator is checked to see if he is allowed to use the network communication system. This use of the directory service is conventional per se.
The new copy of the message is stored away (62) and placed on the queues (64) for the other gateways.
FIG. 9: The message is now transferred to the peer TOOLS in the other gateway 10 (in this case Fax). This is done using what is referred to as a remote operation, meaning that a command (SUBMIT-- MESSAGE) and some data (in this case the message itself) is transferred. A sequence number is also sent over in order to prevent duplication of messages.
The message is thus now in TOOLS 44' of the FAX gateway 12E. In FIGS. 9 to 12 the elements of this gateway are distinguished by added primes.
FIG. 10: The message is stored again (72). The designation of the originator is converted (CONV. ORIG.) into human readable form for use as a CSID (the string that appears at the top of the fax page). More call barring checking is done to bar calls which are, according to the directory, not permitted to the addressed recipient from the call originator in question.
The message is handed to the specific software routines 45' of the fax gateway 12E. All action now takes place in the fax gateway 12E.
FIG. 11: The copies of the message are generated and stored (76) one per recipient and the dialled numbers are formed. The format of fax addresses that are passed around are 9 <country code> <national number>. This is converted into a sequence of digits to dial.
Each copy is now placed on a queue (78) to be sent when an outgoing line (fax card) becomes free.
It will be noted that the message is repeatedly saved to disk. This is not a serious overhead because the majority of the message is left on disc and the different "saves" are effected by constructing pointers to the stored message proper. There is some management to ensure that, when a copy is `deleted`, the stored message itself is not deleted until the last user releases it.
FIG. 12: For each copy of the message, the specific routines 45' wait until a fax card 82 becomes available, (signalled as an event), and then transfers the message via the fax network interlace unit 80 to the fax access unit, i.e. PC 82 with fax card. This is a specific example of when use will be made of GUES--generic unpended event-handler service--which is discussed in detail below.
There then takes place standard operations within the PC 82. The message (which is still in internal encoded form) is converted into text. The header is formatted with dates etc. in the local language. The message is then passed to the fax card. The fax card dials the number supplied and starts to transmit the message, converting from text into the black and white image as it goes. At the end of the call, the fax card returns the CSID (the called subscriber identification) to the PC. The fax gateway 12E is told the result of the transmission including the duration and the CSID.
Other operations may then take place on the fax gateway 12E. The message (which was still being stored) is retrieved to check if the originator requested any notifications on completion of the message (good or bad). The reports are generated and handed to TOOLS for transmission back to the originator. Accounting records are now recorded on disk for charging.
FIGS. 6 to 12 are concerned with the transmission of a message from the standard 1984 X400 network to a fax access unit. A message passing in the opposite direction will be handled in a complementary or inverse manner which will be apparent from the foregoing description.
This section consists of the following chapters:
Chapter 1: Introduction
Chapter 2: Environment
Chapter 3: The User's Model
Chapter 4: Functionality
Chapter 5: Examples of GUI Task Interactions
Chapter 6: GUI Timers (GUTS)
Chapter 7: GUI Event Handlers (GUES)
Chapter 8: GUI Specification
Chapter 9: GUTS Specification
Chapter 10: GUES Specification
Chapter 11: GUI Programming Example
Chapter 12: Internal Structure
Chapter 13: Data Structure Specification
Chapter 14: GUI and Communications Server System
Chapter 1 Introduction
1.1 Outline of GUI.
GUI provides generic mechanisms for handling Request/Response Interactions across an interface, external events, and timers. It also provides an environment in which applications can use unpended services in order to support multiple threads of processing on a single path. These mechanisms allow an entity to request a service (provided by GUI in the case of timers, or by another entity in other cases), and later be notified of its completion without pending while the service provider's routine fulfils the request. Hence the application can perform other useful processing, in parallel with the service provider's processing of the unpended request.
In a complex product such as a communication server system there are inevitably many separately designed modules, all providing service interfaces to their users and all of which must coexist peacefully. The traditional problem is that each module has its own set of rules and restrictions which its user must conform to and there may be incompatibilities between the requirements, which take much effort to resolve, when all the modules are put together, with a high risk of bugs being left in the system.
For example, a library which needs to wait for external events might traditionally have had a routine which the application must poll from time to time to see if anything had happened. This is perhaps tolerable with one library but with say a dozen libraries, a lot of time is going to be spent just polling them all. What is worse, traditional libraries tend to make exclusive use of shared resources, whose use must accordingly be carefully coordinated so that all the modules in the process can operate together. This would result in the modules working in isolation but not when they are integrated.
GUI solves these problems by taking charge of all resources (timers, signals and other external events) and providing services which all the various libraries can use in order to access the resources in harmony. Because GUI is the only direct user of the underlying resources, there are no problems with integrating the separate modules.
An additional benefit is that, because all external events arrive through GUI (and are then dispatched to the various modules) there is no need to poll all the libraries continually. In fact, in an application which is fully based on the principles of GUI, there is no polling at all, because GUI automatically waits for all possible external events whenever there are no jobs to run. This results in applications which use virtually no CPU time when they are not processing a message. This is certainly not true with many traditional application architectures.
In general terms, the way in which GUI works is as follows. Instead of programs being written as sequential code, with various calls and jumps, the main structure of an application makes requests of service providers, which schedule jobs or notifications onto queues.
Jobs or notifications may be categorised as follows:
Data returned by a service routine
Notification that an external event has occurred
Notification that an interval of time has elapsed
Inter-process communication (IPC), that is to say a message passed between two computer processes.
In principle there need only be one job queue but an application can set up multiple queues with different priorities and select the queues on to which it or service providers place jobs, as a means of controlling priority of execution of jobs. The application (user) calls a run routine gui-- run() when it is free for jobs to be run. Gui-- run() will then run scheduled jobs off the queues (a) in order of queue priority and (b) in first in first out order so Ear as each queue is concerned. Applications must not themselves pend. When an application is otherwise idle, it should call gui-- run(), with a pend option, whereby gui-- run() pends until a job is scheduled by an inter-process communication (IPC), an event-handler service, denoted GUES below, or a tinier service, denoted GUTS below. This assumes that, once idle, the process has nothing further to do until an IPC or external event arrives or a timer goes off. This is the situation which obtains with a communications server system where activity is initiated in response to events, such as "message coming in", "fax card ready" and so on, or at timed intervals. Such events are what might be termed hardware events, signalled by a change of logical state on a handshaking line, for example. IPCs can be regarded as software events.
Input events are represented by calls to user routines with specified parameters, which can indicate the event that occurred. These events are placed on the queues by calls to gui-- schedule() and picked up by the main task when it calls gui-- run(). External events are not the only things which can be scheduled with GUI. Unpended request completions are another obvious class of user routines which can be scheduled and any routine, whether library or user, running within the main task can schedule any general processing which it needs to do and this will get run some time later.
When an application is doing its own processing it must return to gui-- run() sufficiently frequently to avoid disruption of the system, e.g. by causing timer inaccuracy or affecting network usage or user response times. The application may be said then to poll GUI but it is important to recognise that it only has to poll the one "event handler", not many handlers as in the conventional approach.
The application main task allocates a queue, denoted by a queue identifier or quid, for each level of priority which it requires. When library routines are called they have to be told the quid onto which they must schedule their jobs. In general, external events will be given high priority quids while general internal processing (especially that involved in housekeeping and accounting operations) can be given low priority quids.
The structure of an ideal application can be expressed as the following outline of a main routine:
______________________________________main ()initialise self;initialise GUI;allocate quids, for required priorities;initialise all libraries;maybe schedule initial jobs and start any regular timers;do forevergui.sub.-- run(PEND)}______________________________________
The significance of the pend option for gui-- run will be explained below, section 4.1.4.
All of the external event processing and internal library processing gets done as scheduled jobs out of the call to gui-- run(). External events are being scheduled by GUES and in response to IPC's. Internal library processing gets scheduled either out of the initial unpended request routine or out of jobs run because of external events destined for internal service providers, denoted GCSP's below. In this ideal example, all of the application's own processing gets run as scheduled jobs. This requires the application to schedule the first job or jobs it needs to do before it calls gui-- run() and it can always schedule further jobs at later times. This structure has the advantages that the process automatically sleeps within gui-- run() when there is nothing to do and that the application code is integrated into the GUI mechanism. However the invention also optionally provides "wakeup" routines which enable a user routine to wake up pended gui-- run() and enable GUI to wake up an idle user loop, as explained below.
1.2 GUI and the operating system.
GUI makes it possible to write applications in such a way that they are portable between apparently incompatible operating systems such as VS and UNIX. What is said about UNIX applies in essence to MS-DOS, with the difference that MS-DOS uses real, hardware interrupts whereas UNIX uses software interrupts (signals). The fundamental difference between VS and UNIX is that VS processes are multi-threaded while UNIX processes are not. Under VS there can be multiple threads (VS tasks), all executing apparently concurrently within the same process address space. On the other hand, under UNIX there is only one thread running in a process, although it can host another interrupt-level path by the use of software interrupts. However VS does not have a documented mechanism for software interrupting the main task of user processing, in contrast to the UNIX routine kill(). Under VS an application uses a dedicated VS task to await external events.
In spite of these incompatibilities an application written within GUI can run under VS or UNIX, provided that the features particular to the two operating systems are not used. Thus no use must be made of VS multiple threads by the GUI user and no use should be made of UNIX interrupts. On the contrary, the application must be written with a single main task and interrupts or events must be handled by the event-handler services within the GUI framework.
In writing "server" applications, such as a network communications server, it is highly desirable to be able to process many items (messages) in parallel within a single process, since so much time is spent waiting for events, during which time efficient use of resources can be made by processing other messages. GUI provides an environment which can handle this requirement and which is the same regardless of the underlying operating system. Known application packages which use resources efficiently to process multiple messages are specific to one operating system. A specific example of how GUI is used within the communication server system described above is given in Chapter 14 of this description.
1.3 Terminology
GUI typically provides an interface between a library, written by one set of programmers to provide a service, and some user code, written by different programmers to make use of the service. Such library code which uses GUI is called a GUI-Conformant Service Provider (GCSP). The user code is called, simply, The User.
Throughout this description, routines provided by GUI will be indicated by names beginning "gui-- " (e.g. gui-- schedule). Routines provided by a GCSP will be indicated by names beginning "GCSP-- ", whilst routines written by a User will begin "user-- ".
Following is a list of terms used in this disclosure:
______________________________________Pend A routine pends if its processing path comes to a halt, whilst awaiting an external event. For example, many VS system calls cause the calling task to pend while the call is run on a VS path.Unpended A routine which does not pend while awaiting external events is said to be unpended.Task A thread of processing, which is logically separate from threads performing other processing.Main Task The main processing thread within a process.Path A thread of processing, which is physically separate from threads performing other processing. Paths may be Parallel, as in the case of multiple VS-Tasks, or Nested, as in the case of a base level path and an interrupt level path.VS-Task A path, in the above sense, which is a physically scheduled entity, created by a ?TASK system call, under the AOS/VS operating system.GCSP GUI Conformant Service Provider. A library which provides a service conforming to the GUI rules and formats.User Code which makes use of GUI, in order to request services of a GCSP.______________________________________
Chapter 2 Environment
2.1 Hardware and OS Environment
An aim of GUI is to provide an interface which is moderately independent of the OS and Hardware environment. This means it must work under AOS/VS on an MV, MS-DOS on a PC, and UNIX on an MV or other hardware, for example.
MS-DOS and UNIX are single-threaded. This description speaks of multiple tasks, with one or more main tasks, and some event wait tasks. In the MS-DOS and UNIX environments, this terminology equates to a Base Level "main task", and a set of Interrupt Level service routine "tasks". Although GUI allows a user to have several "main tasks", it should be noted that this feature is not available under MS-DOS or UNIX. It is recommended to have only one main task, even under AOS/VS, due to the possible requirement for a future port to another OS. The possibility of having multiple main tasks is intended to assist programmers who are converting existing multi-tasked programs to use GUI. Whatever the physical environment, GUI is constrained to run in a single address space. It does NOT provide an interface between entities running in separate address spaces, for example in two different VS or UNIX processes.
2.2 Language Bindings
For reasons of efficiency, (particularly on the PC) the standard GUI library is designed to be called with C calling conventions (i.e. call by value). GUI calls all user-supplied routines with this same convention.
Under AOS/VS, languages such as PL/I use a call-by-reference calling convention, called the External Calling Sequence (VS/ECS), which is incompatible with the C calling convention used by GUI. This means that GUI cannot be called directly from PL/I, and that PL/I routines cannot be scheduled using gui-- schedule().
If the need arises, a PL/I version of GUI could be implemented, by adding a thin layer of C code on each side of GUI. One layer would provide ECS-callable routines, which convert the parameters, and then call the standard GUI routines. The other layer of code would be required for any PL/I routine which needs to be gui-- scheduled(), and would consist of a C routine which is actually scheduled, and which then calls the PL/I notification routine with the modified parameter format.
Chapter 3 The User's Model
The model of a GUI user is an entity (some user-written code) which wishes to make requests of a Service Provider, in an unpended manner.
To make a request, the User calls a routine which specifies the service which it requires. Since the actions required to implement the request may be lengthy, the user does not want to wait for the completion there and then, but rather, wants to be told when it is complete. This is the basic concept of an unpended request.
The way in which the User is told of the request's completion, is by a user provided Notification routine being called, usually by GUI.
3.1 Unpended Request Example
Consider the following example, which is illustrated in FIG. 13. A User 130 wants to read a line of input from a keyboard, but does not want to pend if input is not yet available, nor repeatedly poll for the arrival of input. This functionality can be satisfied by an unpended request, provided by a GCSP.
The GCSP writer provides a Request routine 131, say "GCSP-- get-- line()", which takes as an argument the address of a User notification routine 137 to be called when the input is available. The Request routine initiates the service and then returns, without pending.
There are many ways in which the request may be initiated by the GCSP Request routine:
1) It may set up an interrupt handler, which saves the input character each time a keyboard interrupt comes in, until a line is available.
2) It may spawn a process which will do a pended read, and signal the main process when a line of input has been received.
3) It may spawn a task, which does a pended read, and calls the
Notification routine when the input is complete.
Whilst these are just some of the possibilities; (1) is typical for MS-DOS, (2) for UNIX, and (3) for VS.
Once the request routine has returned, the User can perform any further processing 132 it has to do but such further processing must include periodic calls to gui-- run(). There are now two separate threads of processing (or "tasks") established for this user: (i) the main task 133, and (if) the request processing task 134, which may be processing at interrupt level, in another process, or in a separate VS-style task. When the request task detects the completion of the request (i.e. when a line of input has been received as indicated at 135), it calls (136) gui-- schedule to place the User's Notification routine 137 on a quid, with the result of the request (a line of input). When gui-- run() is next called, as indicated at 138, the notification routine is taken off the quid and the user processing task has acquired the line of input which it requested.
It is convenient to say that the notification routine or job is put on to and taken off a quid. What is actually put on to the quid (even more precisely on to the queue identified by the quid) is the address of the notification routine and any arguments for this routine, as subsequently explained with reference to FIG. 24. In the case of FIG. 13, the arguments are characters of the input line.
Whilst all of this example can be achieved without GUI, other cases may not be so simple. In any case, GUI provides a framework which aids both the User-writer and the GCSP-writer in implementing such mechanisms, in a way independent of the operating system which is used.
Chapter 4 Functionality
This Chapter starts by describing the routines provided by GUI, in order to support an unpended environment. It then goes on to describe the routines required of a GCSP, and GCSP User, in order to support an unpended interface.
4.1 GUI Provided Routines
The library portion of GUI (as opposed to the Rules governing its usage), provides a mechanism for scheduling arbitrary user routines, for running at a later time. The generic term used for one of these scheduled routines, is a Job.
GUI provides a routine for queuing up Jobs (gui-- schedule), and a routine to be called when a user is ready to run these Jobs (gui-- run). For additional flexibility, GUI supports multiple queues of Jobs, which can have different priorities associated with them at allocation time.
4.1.1 GUI Initialisation Gui-- initialise ()
This routine takes no parameters. It should be called by each component (i.e. each GCSP and User), before any other GUI routine is called. GUI ignores all but the first initialisation.
4.1.2 Queue Allocation
As mentioned above, GUI provides multiple queues of scheduled Jobs. This enables Users to specify the relative priorities of Jobs, and to collect Jobs which form logical classes onto a queue which is separate from other logical classes. Each GUI queue has a QUeue IDentifier (QUID), which is assigned by GUI, when a queue is allocated:
gui-- allocate-- quid (priority, user-- wakeup, quid-- ptr)
The parameters to this call are as follows:
* priority--Specifies the priority for running Jobs off this queue, relative to other queues.
* user-- wakeup--Optionally specifies a user supplied routine, which GUI will call whenever there are Jobs available for running on this queue.
* quid-- ptr--GUI fills in this parameter, with the queue identifier which it assigns to this queue.
Each queue which is allocated has an Owner which is the path which allocated it.
Under VS, there could be multiple paths (VS-Tasks) capable of allocating GUI queues, although this is not recommended, for reasons of compatibility explained above. Under single-threaded operating systems, only the main thread is allowed to allocate queues (i.e. they may not be allocated from interrupt level).
Any path may schedule Jobs onto any queue, however, only the owner can run Jobs off that queue. This will be described further under the section on `gui-- run()`.
4.1.3 Job Scheduling
GUI provides a routine, which Users and GCSPs can call, in order to cause a specified routine to be called, with given arguments, and (for VS) on a particular task:
gui-- schedule (quid, routine, arg1, arg2, arg3, arg4) where the arguments are as follows:
* quid--The queue onto which `routine` should be scheduled.
* routine--A pointer to the routine which GUI should call.
* arg1 . . . arg4--Arguments with which to call `routine`.
This GUI routine does not pend, and as a result of this call, GUI will call `routine`, when the owner of the specified queue calls gui-- run. The routine will be called thus:
(*routine) (arg1, arg2, arg3, arg4, quid)
The `argN` parameters can each be big enough to contain a pointer (32 bits on an MV, 16 or 32 bits on a PC), however, GUI does not indirect through them. Hence the parameters may be used to pass either integers, or pointers, as required. In the latter case, the caller of gui-- schedule must ensure that the pointer remains valid, until the scheduled routine has actually been run. GUI will only copy the values of the arguments themselves between stacks, and not anything they might point to.
The `quid` identifies a particular GUI queue, onto which the Job should be scheduled. This provides control over the relative priorities of scheduled Jobs, and determines the sequence in which Jobs will be run when the owner calls gui-- run.
In a VS environment with multiple main tasks, the quid also provides control over which VS-Task the Job will be run on. Note, however, that this is not a recommended configuration
4.1.4 Running Jobs
In order for GUI to be able to run a Job which has been gui-- schedule'd, it must be able to gain control of the thread owning the queue onto which the Job was placed. For this purpose, GUI provides a routine which a user can call from a main thread, in order to run any Jobs which are scheduled on queues owned by that thread:
gui-- run (flag) where the arguments are as follows:
* flag--The flag says whether or not GUI should pend the thread, if there are no scheduled routines to run.
Jobs are selected, on a priority basis, from the queues owned by the calling path (see the description of `gui-- allocate-- quid()`). Within a single queue, Jobs are run in FIFO order.
If `flag` is set to NOPEND, then GUI will check for a routine to run, and return immediately if none is ready. If there are routines to run, then GUI will run one of them, and then return. The value returned from gui-- run() will indicate whether or not a job was run.
If `flag` is set to PEND, then GUI will pend the calling thread until there is a routine ready to run. After running any routines which become ready, GUI pends the caller once more.
4.1.5 Thread Control
Since, in the pended case, GUI would never return from gui-- run, another routine is provided which the User may call in order to force a thread to return, if necessary:
gui--.wakeup (quid)
This wakeup routine does not pend. Hence, it can be called from any path, including from a Job which is already running on the specified quid. This call will cause the path which owns the quid, to return from gui-- run at the first opportunity (i.e. immediately, if it is pended awaiting Jobs or when the current job completes, if one is being run). Using the pend/no-pend option of gui-- run, the User has the choice of either pending within GUI whenever it is idle, or else polling for notifications to run from its own idle loop.
As an additional option, in the case where the User prefers not to pend within gui-- run, it may supply a wakeup routine for GUI to call, whenever GUI requires control of a thread, in order to run a Job on a quid owned by that thread:
user-- wakeup (quid)
The address of this routine is specified as a parameter to gui-- allocate-- quid, for each quid allocated. This mechanism gives the user the option of not polling for notifications to run, but of being told when they are available. In this case, whenever GUI calls `user-- wakeup`, the User must call `gui-- run`, with the specified task, in the near future, i.e. as soon as it is in a position to do so.
Ideally GUI is programmed using only the gui-- schedule() and gui-- run() routines. However the optional wakeup routines can be valuable, since they enable Users with different tasking structures to use GUI in the way most convenient to their own requirements. For example gui-- wakeup() can be useful in implementing user interface programs, e.g. adding entries to the directory of the communications server system. Specifically, gui-- wakeup() may be called when returning from the GUI environment to a more conventional one (handling the user interface) when (in this example) a directory request completes.
4.2 GCSP Provided Routines
This section describes the routines which a GCSP must supply, in order to provide an unpended service across GUI.
A GCSP provides Request routines, to be called by the User, in order to initiate the services which the GCSP provides.
Each of these Request routines, must obey the following rules:
* It must not pend.
* It must arrange for a User-supplied Notification routine to be called when the request is complete.
To prevent problems of stack run-away, and to avoid the user's notification routine being called before the request routine returns, the GCSP must NOT call the notification routine directly from the request routine. It is permissible, however, for a GCSP to call the notification from one of its own routines, which it has previously scheduled.
* It must provide a mechanism by which the User can specify, if it so requires, onto which quid the Notification routine should be scheduled. These requirements can be satisfied, by the GCSP User specifying a Notification routine, to be called on completion of the unpended request, and a GUI quid, onto which the GCSP can schedule the notification.
In the case where the service provided by the GCSP is strictly of the Request/Response type, a typical Request routine may be of the following nature:
GCSP-- Request (Nfunc, quid, arg1, . . . argn). where the arguments are as follows:
* Nfunc--Pointer to the caller's Notification routine.
* quid--A GUI quid, onto which `Nfunc` will be scheduled.
* arg1 . . . argN--Additional arguments, specific to request.
If the GCSP so decides, then it may use any other mechanism it likes for specifying `Nfunc` and `quid` (e.g. they may be hard-coded, or decided at initialisation time). In particular, the interactions across the interface need not be strictly of the Request/Response nature, since the GCSP can, at any time, schedule any user routine to be called.
4.3 User Provided Routines
As indicated above, the User supplies Notification routines, for all requests it makes. These are the routines which will be called, in order to inform the user of a request's completion. At some time after the User calls the GCSP Request routine, either that routine, or else some other GCSP or GUI routine, will call the User's Notification routine (Nfunc, in the above example).
This Notification routine must obey the following rules:
* It must not pend.
* It must be prepared to be called on any path, unless it has arranged otherwise with the GCSP (e.g. by specifying a quid onto which the notification should be scheduled).
* It must not call gui-- run(). In order to prevent problems of stack run-away, calls to gui-- run may not be nested.
Considering the example Request routine above, where the GCSP uses GUI to schedule the User notification routine directly, that routine would be called thus:
(*Nfunc) (arg1, arg2, arg3, arg4, quid); where the arguments are as follows:
* arg1, . . . arg4--Arguments specific to Notification.
* quid--The GUI quid on which `Nfunc` is being called.
No use can be made of a return value from Nfunc, since it may not be called directly from the GCSP, nor on a stack which returns to the GCSP. Unless the User has arranged with the GCSP, for Nfunc to be called on a specific quid, it may be called on any path.
4.4 Queuing of Scheduled Notifications
On a per-quid basis, GUI guarantees to run any queued Jobs in the order in which they were scheduled. There is no sequencing enforced between separate quids. If there is a Job scheduled to run on a particular high priority quid, and the User calls gui-- run with the path which owns that quid, then GUI will run that Job. This will happen regardless of the fact that notifications may have been queued on other lower priority quids, or even on higher priority quids which are owned by another path, for longer.
Chapter 5 Examples Of Possible GUI Task Interactions
Any GUI user has one or more "main tasks", where a main task is defined to mean a path which does user processing, and is allowed to own GUI quids (i.e. it excludes event-wait-tasks and interrupt handlers) . Although a main task may perform lengthy operations, and even pend on operations such as disc I/O, it is not advisable for a main task to pend on a potentially infinite wait (e.g. pended, non-timed-out, terminal I/O). Failure to observe this advice may result in severe disruption of the entire GUI environment, since it may become impossible for GUI to `wake up` a main task, in order to run a notification.
As described in Section 4.1.5, there are two basic methods of thread control provided by GUI, supported by the `flag` on the call to gui-- run. This section describes possible uses of these mechanisms, and illustrates the inter-task relationships for each.
The two mechanisms are distinguished by the location of the idle "wait-point", either within GUI, or within the User.
5.1 Wait point within GUI
This mechanism is supported by two calls to GUI routines:
* gui-- run (pend);
* gui-- wakeup (quid);
The user calls gui-- run() on its main task thread, and with the pend option selected, when it is idle. When a Job becomes available, on a quid owned by the calling path, GUI will call the scheduled routine, from gui-- run.
If the user needs to regain control of its main task thread (either because another task of its own, or a GUI Notification call, has queued some work for it), then the user can call gui-- wakeup(), which will cause gui-- run to return to the main task as soon as possible.
If the user needs to control the threads of more than one main task in this way, then the `quid` argument can be used to uniquely identify the owning path.
FIGS. 15 and 16 illustrate the flow of control, and task interactions for this mechanism, using the conventions set out in FIG. 14. Thus FIG. 14 shows three different kinds of box used to denote GCSP routines, USER routines and GUI routines and the meanings of the left, right and down axes, namely CALL, RETURN and TIME respectively. Note that these figures, and the descriptions below, assume there is just one main task. The underlying mechanism is not affected by this assumption but it simplifies the discussion considerably.
Pended gui run, resulting in User Notification
FIG. 15 shows the use of the pended gui-- run() routine, resulting in GUI calling a GCSP notification routine, which has been scheduled to run on this task.
Proceeding from the top of the diagram downward, the user starts by doing some of its own processing on the main task thread 150. During user processing 151 the user makes a call 152 to a GCSP Request Routine, shown here as GCSP-- Request 153. This routine does some processing, perhaps initiating some activity, and then returns.
When the user is otherwise idle, it calls gui-- run() 155 with the pend option, i.e. gui-- run(pend), in order to give control of the main task thread to GUI.
Within gui-- run(), GUI checks for any notifications to run, and, assuming there are none, waits to be poked by either gui-- schedule, or gui-- wakeup. Some time later, a path 156 initiated by the GCSP receives an incoming event. Simple examples of events are "key pressed", "printer ready", "disk drive ready" and so on. Within the context of a communications server system other examples are "message coming in", "network ready", "network wishes to send" and so on. Alternatively the event may be an IPC. The path 156 handles the event (157) and, because of the GCSP request, knows that it now has a Notification to run on the main task. It therefore calls gui-- schedule 158, which queues up the routine to be run, and sends an inter-task message to the main task, which is still waiting inside gui-- run(). Having handed responsibility for the event to the main task, gui-- schedule returns to the GCSP event handler, which, it is then assumed, goes back to waiting for another event.
The main task now wakes up, within gui-- run, and seeing there is a notification to run on one of its owned quids, calls the GCSP Notification routine 159 for the scheduled call. Once the Notification returns, gui-- run() goes back to waiting to be poked again (155').
Pended gui run, interrupted by gui wakeup
FIG. 16 shows the use of gui-- run(pend) 160 in the main path, with the user of another path calling gui-- wakeup() in order to regain control of the main task thread.
Having called gui-- run() with the main task during an idle period, another path receives some event, the processing 161 of which requires the user to knock its main task off the pended gui-- run().
This other path, (which may be a GUI wait task executing a user notification routine, or else any another user path), calls gui-- wakeup() 162, causing GUI to release the main thread, and return from gui-- run(). The user is then free to do any processing 163 it likes on the main thread. When such processing is complete, and the User is idle, it calls gui-- run() 164 once again.
5.2 Wait point within User
This mechanism is implemented by a User-provided routine, and the gui-- run() routine, with the nopend option:
* user-- wakeup (quid);
* gui-- run (nopend);
The User can do anything it likes in its main task idle loop. The User can either poll gui-- run periodically, specifying that GUI should not pend if there are no calls scheduled, or it can wait for GUI to indicate that it wants control of a thread. The former alternative is what was illustrated in the example of FIG. 13. In the latter case, GUI will call the user-- wakeup() routine when it wants the owner of a quid to call gui-- run. The User must then call gui-- run() in the near future, in order to give control of the main thread to GUI. Typically, GUI will run a Job, and then return from gui-- run().
The `quid` argument allows for the control of more than one main thread. When GUI wants to run a scheduled Job on a given quid, it will call the user-- wakeup(), which was supplied when that quid was allocated. GUI will only run Jobs, on the thread of the main task which owns the quid, onto which the Job was scheduled.
Note, that although the user-- wakeup routine is considered here as a single named routine, the actual routine to call is specified as a parameter to the gui-- allocate-- quid() call. This allows the user to specify different wakeup routines for different GUI queues, which may be useful where there are multiple separate User entities, in a single process.
Unpended gui run, initiated by user wakeup
FIG. 17 illustrates the use of the unpended version of gui-- run and its interaction with the user-- wakeup() routine. It shows the user making a GCSP-- request() 170 on its main task thread, and then entering a notional idle loop 171 (so long as the main task has a means of periodically checking for user-- wakeup, there is no real need to have an explicit idle loop).
Some time later, an event arrives, which awakens a GCSP event handler 172 task. The task starts to service the event, and in this case discovers that there is a Completion Notification to run on the main task. It therefore calls gui-- schedule 173, which queues the Notification internally, and calls the user-- wakeup routine 174, for the quid in question.
This user-provided routine takes some action, which will cause its main task to call gui-- run. The exact form of this inter-task message is a user issue. The user-- wakeup routine then returns to the service routine, which in turn goes back to waiting for another event.
At some time in the near future, the user's main task picks up the inter-task message sent by user-- wakeup, and as a result, calls gui-- run() 175 in order to give control of the main task thread to GUI.
Within gui-- run(), GUI scans its queue of Jobs waiting to be run, until it finds one to run on a quid owned by the calling path. When it finds one, it calls the appropriate user Notification routine 176. When the Notification routine returns, GUI completes its internal processing, and then returns from gui-- run, handing control back to the user 177.
Chapter 6 GUI Timers
This chapter describes the Generic Unpended Timer Service (GUTS), which provides a mechanism for scheduling unpended timed events. Note, that this is not an integral part of the GUI environment. Rather, it is a GCSP, which happens to be supplied as part of the GUI library. An understanding of this particular service is not necessary in order to understand GUI itself. The Timer Service consists of a series of GUTS-provided Request routines, and a definition for a User-provided Notification routine. The following sections describe these routines.
6.1 GUTS Provided Routines
This section describes the routines provided by the GUTS, in order to start and cancel timers. A formal interface specification is given in Chapter 9.
6.1.1 guts-- start-- timer()
This routine is called to schedule a timer to go off, after a specified delay has elapsed. It conforms to the generalised GCSP Request routine format, as described in Section 4.1, and takes the following arguments:
* Nfunc--Pointer to the user's notification routine, to be called when the timer expires.
* quid--The GUI queue, onto which Nfunc should be scheduled. If the value NULL-- QUID is specified, then the notification will be called directly from the path which detects the expiration (this will be a separate task under VS, and an interrupt handler under UNIX or MS-DOS).
* delay--A positive delay, in seconds, relative to now.
* user-- ref--A user reference (typically a pointer to some user control block).
* timer-- name--A number, distinguishing this timer, to the user and GUTS.
* user-- arg1--An argument, for the user's benefit, which will be passed back on the call to the notification routine.
user-- arg2--Another user argument, as above.
An instance of a timer is uniquely identified by the user-reference/timer-name pair. For example, if the user is implementing some networking protocol, the `user-- ref` might be a pointer to a control block for a particular connection, and `timer-- name` might indicate the event being timed (e.g. connection-timeout, clear-timeout, etc.).
The `user ref` and `timer-- name`, will be specified as parameters to the user notification routine `Nfunc`, along with `user-- arg1`, and `user-- arg2`.
GUTS timers are one-off events. Once a timer has expired, and the user's notification routine has been scheduled, that timer no longer exists. If the user requires a timer to go off at regular intervals, a new timer should be started from the notification routine.
6.1.2 guts-- cancel-- timer()
This routine is called to cancel a previously started timer. It takes the following arguments:
* user ref--The user reference, specified on the call to guts-- start-- timer.
* timer name--The timer name, specified on the call to guts-- start-- timer.
* remain-- ptr--GUTS fills in this parameter with the number of seconds remaining before the timer would have gone off.
6.1.3 guts-- check-- timer()
This routine is called to check how much time remains before a timer will go off. It takes the same arguments as guts-- cancel-- timer(), but the timer is not cancelled.
6.2 User Provided Notification Routine
As shown above, the caller of guts-- start-- timer provides a notification routine, `Nfunc`, which will be called when the timer expires. If we call this routine `user-- timer-- expired`, then it will be called as follows:
user-- timer-- expired (user-- tel, timer-- name, user-- arg1, user-- arg2, quid) where the arguments are those specified on the original call to guts start timer.
6.3 Timer Accuracy
The accuracy of the Timer Service, will be such that timer expirations will be scheduled within +1 second of the intended time, when running on a normally loaded MV with no memory contention. However, since GUTS uses GUI for Notification scheduling, the exact time at which the Notification will be run, depends on the number of GUI notifications currently scheduled, and on how soon the User calls gui-- run.
Chapter 7 GUI Event Handlers
This chapter describes another GCSP, which may be included in the GUI library, namely the Generic Unpended Event-handler Service (GUES). Like the timer service, this service is not an integral part of GUI itself. It will be a frequent requirement for GCSP's to set up event handlers, in order to wait for the completions of actions which they initiate. Such handlers are environment-specific. Under AOS/VS, they may be VS-style tasks, whilst under UNIX, they will clearly not be.
For this reason, and since many Users may require the same services, GUI provides an event registration service, which attempts to hide the details of the wait tasks from the User. Clearly, the User will be aware of the environment, to the extent that it must tell GUI what sort of event to await, but this awareness is confined to the selection of a type of event on an interface call. There is no need for a User to know the details of spawned VS-style tasks, or of Interrupt Vectors, or whatever the underlying mechanism is.
Note that in the context of this service, a "User" may be a GUI User, or another GCSP. They are both just "Users", as far as the GUES is concerned.
GUES is available only under the AOS/VS and UNIX operating systems. The actions required on receipt of MS-DOS hardware interrupts are too specialised to be handled by a generic service such as GUES. MS-DOS programmers requiring this sort of functionality will write their own application-specific Interrupt Service Routines. From these ISR's, they can take whatever action is necessary to dismiss the interrupt, and call gui-- schedule () ill order to pass the event to the main part of the application.
7.1 GUES Provided Routines
In order to register an interest in a class of event, a GUI user calls the GUES routine:
gues-- subscribe()
This routine take the following arguments:
* quid--The quid on which Nfunc should be scheduled.
in-- pars--This structure contains an indication of the type of event being subscribed to, and any additional parameters required for that particular subscription (e.g. signal number).
out-- pars--GUI returns a subscription id, and any event specific information in this structure, type, etc.)
When GUES receives an incoming event, it scans its queue of subscriptions for that event, and schedules the notification routine of each. Note that there may well be more than one notification routine registered for a given event, particularly in the case of signals.
GUES will take the approach of calling all relevant notification routines, rather than allowing the notifications to accept or refuse an event. This is less prone to loss of events due to user error.
The following events will be amongst those available for registration:
* ?SIGNL's (in AOS/VS)
* Software interrupts (signal(2) in UNIX)
* Child process terminations.
* AOS/VS Connection Breaks (simulated as obituaries by GUES).
* Unix I/O readiness, as indicated by select(2).
The exact parameters required for each of these events, are specified in the GUES interface specification (Chapter 10).
7.2 User Provided Routines
The User of this service, must provide the notification routine Nfunc. If we call this routine `user-- event-- occurred`, then the call has the following form:
user-- event-- occurred (sub-- id, event-- type, udata, event-- param, quid) where the arguments are as follows:
* sub-- id--The subscription id returned by GUES on the gues-- subscribe call.
* event-- type--The type of event, as specified to gues-- subscribe ().
* udata--User data, as specified in in-- pars to gues-- subscribe ().
* event-- param--This argument conveys information specific to the event being notified. (e.g. For obituaries, it contains the PID and exit status of the terminated process.)
* quid--The GUI quid on which the notification is being run.
Again, the exact parameters for each event occurrence are specified in Chapter 10.
7.3 Event Concepts and Warnings
This section describes the concepts associated with each of the GUES event subscriptions, and warns about any restrictions implied by their use.
7.3.1 AOS/VS ?SIGNL Events
This subscription allows GUES users to be notified upon receipt of AOS/VS Fast IPCs (?SIGNL).
GUES establishes a single AOS/VS task to be shared by all ?SIGNL subscribers, which is dedicated to doing ?WTSIG calls. The Unique Task ID of this task is returned to each subscriber as output from the gues-- subscribe call, and can be used by an application as a parameter to a ?SIGNL system call.
By passing the ?WTSIG task UID to another process, this GUES service can be used to support a Fast IPC mechanism, with no direct data transfer. This is useful in conjunction with a shared memory scheme for data transfer, or in interfacing to unpended Kernel service such as ?QNET.
There are two problems associated with ?SIGNL events:
* Anyone can send a ?SIGNL to your process, without any validation being done.
* ?SIGNLs do not nest, so they may be lost if they are not processed fast enough.
The following precautions overcome these problems:
* Never assume that a ?SIGNL notification was intended for you. It may be for another GUES subscriber, or it may have been sent by the PMGR, or it may have been inadvertently sent by another process. A ?SIGNL notification should be used as an indication that some event may have occurred, and some other .leans used to find out if it actually has. For example, a queue may need scanning, or a flag checking.
* Don't assume that you will get a notification for every ?SIGNL sent.
Whenever a notification is received, all outstanding work should be checked (e.g. a complete queue scan done), rather than assuming that you will get one notification for each piece of work to be done.
GUES will, however, guarantee to give you another notification for any ?SIGNLs received after a notification starts to run, so there are no situations where work will be lost due to a ?SIGNL arriving during a notification.
7.3.2 Unix signal(2) Events
This subscription allows multiple GUES users to be notified upon receipt of Unix signal(2) events.
Each subscriber passes the signal number of interest into GUES, and GUES establishes a signal handler (using sigset(2)), for that signal. Various signals are of use to applications: the SIGUSR1 and SIGUSR2 signals can be used in a similar way to ?SIGNL under AOS/VS (as a Fast IPC mechanism), whilst other signals such as SIGPOLL are of use in interfacing to Kernel services.
The same warnings and precautions apply as for AOS/VS ?SIGNL events, above. Additionally, users should NOT define their own signal handlers, since these will interfere with the GUES handlers for ALL subscribers, with unpredictable results.
Users should also refrain from subscribing to SIGALRM signals, since GUTS uses this subscription internally to support its timer service. Applications should use GUTS timers instead.
7.3.3 Obituary Events
This subscription allows GUES users to be notified of child process terminations, and for AOS/VS, customer/server connection breaks. Each subscriber receives a notification for each obituary, which specifies the pid and exit status of the terminated process.
Under AOS/VS, GUES establishes a separate task to do repeated ?IREC's on the system port for termination messages (?SPTM). Users should not do their own ?IREC's on this port, since they will disrupt the GUES service. Under UNIX, GUES subscribes to its own signal(2) service, with a signal number of SIGCLD, in order to be notified of child terminations. When a notification is received, GUES does repeated wait3(2) calls with the WNOHANG option, to collect termination information for all expired children. Users should not call wait(2) or wait3(2) themselves, as this will disrupt the GUES service for all subscribers.
7.3.4 Unix Select(2) Events
This subscription allows UNIX users to be notified when an I/O condition exists on one of a specified set of file descriptors.
The Unix select(2) system call takes 3 bit array arguments, readfds[], writefds[], and exceptfds[]. Within each of these arrays, each bit represents a defined file descriptor. The readfds[] mask specifies file descriptors on which the caller is interested in doing read(2) calls, the writefds[] mask specifies those on which the caller is interested in doing write(2) calls, and the exceptfds[] mask specifies those on which the caller is interested in exception conditions.
The select(2) call returns information indicating which of the conditions specified in the input actually exist (i.e. which of the specified descriptors are ready for reading, writing, or have exceptions on them). The call can be made to pend until one of the specified conditions exist, or it can be polled.
GUES arranges for gui-- run() to call select(2) in a pended fashion, whenever there are no jobs to run from a pended gui-- run(). Also, an unpended gui-- run() will do a polled select(2) call whenever there are no jobs already queued within GUI.
Each subscriber to the GUES select service has a set of File Descriptor masks, which mimic the select(2) masks. The subscriber passes a pointer to his/her GUES-- SELECT-- MASK structure into gues-- subscribe, and GUES remembers it. The readfds[], writefds[], and exceptfds[] masks which GUES specifies to select(2) are then constructed by OR'ing together the masks of all the subscribers. Hence by manipulating bits in his/her GUES-- SELECT-- MASK, the subscriber can dynamically add or remove a given file descriptor from the set of files he/she is interested in being notified about.
Whenever a select(2) call indicates an I/O condition, GUES will schedule a single notification for each subscriber whose select mask specifies one or more of the descriptors with conditions on them. Only those subscribers whose masks show that they are currently interested in the files with conditions on them will receive a given notification.
The following warnings apply to users of this service:
* There may be more than one subscriber interested in a given file descriptor, so some care must be taken in handling the notification. For example, if two subscribers set their select masks to register an interest in a read being possible on STDIN, then when there is input available, they will each get their notification routine called. If the first subscriber reads all the available input from the notification routine, and then the second subscriber attempts a read, the read will pend, perhaps for ever!
When using a well known file descriptor (such as STDIN), it may be advisable to do a further polled select(2) call from the event notification, in order to check that the condition still exists.
* It is equally important that one of the notifications clears the I/O condition, or else that all the subscribers clear the offending bits in their select masks. In the above example, if neither notification reads the available input, and they both leave their select masks unaltered, then the process will go into a hard loop, because every time GUES calls select(2), it will show I/O possible, and the subscriber notifications will be scheduled again.
* If any of the subscriber select masks specify a file which is not currently open, then GUI will get an error from select(2), and will terminate the process. Subscribers must therefore be careful to amend their select masks whenever they close a file. Also, if a file is visible to multiple GUES subscribers, then anyone closing that file must define a mechanism for informing the other subscribers, so that they can amend their select masks also.
Note that GUES only does select(2) calls from the well defined points mentioned above. In particular, GUES can never make select(2) calls whilst a user notification is running (since there is only a single base level path), and so as long as the user's select mask is valid whenever gui-- run() is called (or returned to) no problem will arise.
Clearly, this subscription must be used with care but if so used it provides a powerful service.
Chapter 8 GUI Interface Specification
This Chapter is a functional description of the preferred form the GUI interface as a specific example.
gui-- initialise Initialises the GUI environment.
Format: gui-- initialise()
This routine must be called by each library, and by the main application, before any other GUI routine can be called.
gui-- allocate-- quid
Allocate a queue for job scheduling, and return its identifier.
Format: gui-- allocate-- quid (priority, user-- wakeup, quid)
Parameters:
priority Defines the relative priority of jobs scheduled onto this queue.
user-- wakeup If specified (non-NULL), this routine will be called by GUI, whenever a job is scheduled onto this quid.
quid GUI fills in this parameter with the Queue Identifier for the newly allocated queue.
This routine allocates an internal GUI queue, onto which jobs can be scheduled by gui-- schedule(). In order to run jobs off this queue, the user must call gui-- run(), on the same thread (VS-Task), which allocated it. If the `user-- wakeup` routine is specified, then this will be called whenever a job is scheduled, and on the thread which scheduled it. The user should then call gui-- run, on the thread which allocated the quid.
gui-- schedule
Schedule a job, to be run on a specific thread.
Format:
gui-- schedule (quid, routine, arg1, arg2, arg3, arg4)
Parameters:
quid The quid on which the job should be scheduled. This must be quid a quid returned from a previous call to gui-- allocate-- quid.
routine The address of the function, to which a call is being scheduled.
arg1-arg4 Arguments, with which the scheduled routines will be called.
Schedules a routine to be called on a particular quid. The routine will get called (with time specified arguments) when the user calls gui-- run from the thread which allocated the quid. GUI transparently passes the equivalent of four INT32s (arg1-arg4) to the scheduled routine. By agreement between the scheduling and scheduled routines, these parameters may be used to pass any number of parameters, each of any size, so long as the total space occupied by them is no greater than that used by four INT32s. Effectively, GUI copies four double-words of stack from the scheduler to the scheduled routine, and the interpretation of this block is left to the user.
gui-- run
Run previously scheduled routines.
Format:
gui-- run(flag)
Parameters:
flag Indicates whether the caller wants to wait if no jobs are ready to run. Set to PEND, or NOPEND.
This routine causes previously scheduled jobs to be run. Jobs are selected in priority order from the quids allocated by the calling task.
If GUI-- OPTION-- NOPEND is selected, GUI will return to the caller either after running one job, or if none are available.
If GUI-- OPTION-- PEND is selected, GUI will not return, until the user calls gui-- wakeup. It will sleep if no jobs are ready, and run them as they become available.
gui-- wakeup
Cause a pended gui-- run to return.
Format:
gui-- wakeup (quid)
Parameters:
quid Specifies that the thread which owns `quid`, is the one to be awoken.
The user calls this function in order to cause a thread which has called gui-- run with the pend option, to return when it finishes running the next job. The specified `quid` must be owned by the thread which is to be awoken.
If the thread is currently waiting for a job to run, then it will return immediately. If it is not currently within gui-- run() at all, then its next call to gui-- run() will return immediately.
A routine may also be provided to check that a quid is valid, without having to schedule a job onto it. This is useful for GCSPs, who can use it to check that the quid passed into a service request routine by a user is valid. This prevents the GCSP from discovering, later in its processing, that the quid is invalid, and not being able to tell the user.
The user will also provide user-- job Scheduled Routine for the calling sequence for jobs which the user gui-- schedule's, with the arguments specified when the job is scheduled with the call to gui-- schedule, and with the quid on which the job is scheduled. The user can use quid to re-schedule jobs onto the same quid, or on a call to gui-- wakeup if it wishes the thread on which it is running to return from gui-- run().
Chapter 9 GUTS Interface Specification
This Chapter provides a functional description of one example of a GUTS interface.
guts-- initialise Initialise the GUTS library.
This routine should be called by each component, before any other GUTS routine is called. All but the first initialisation is ignored by GUTS.
guts-- start-- timer GCSP Request Start a GUTS timer.
Format:
guts-- start-- timer (nfunc, quid, delay, uarg1, uarg2)
Parameters:
nfunc This is a user notification routine, which will be scheduled by GUTS when the timer expires.
quid This is the quid onto which `nfunc` will be scheduled when the timer expires.
delay The number of seconds which must elapse before the timer expires, and `nfunc` is scheduled by GUTS.
uarg1 This parameter is passed transparently back to the user on the notification routine.
uarg2 As uarg1.
This routine is called in order to start a once-off timer event. When the timer expires, in `delay` seconds, GUTS will schedule the user notification such that it is called from gui-- run(), thus: (*nfunc) (uarg1, uarg2, quid). Other parameters may be employed to uniquely identify a single timer.
A good way to ensure uniqueness between several entities using GUTS, is to use a pointer to a control block for a `user-- ref` parameter. So long as the control block remains allocated, no other entity can allocate memory at the same address and hence the `user-- ref` is unique. This approach also means that it is a simple matter to locate the operation which was being timed.
If a regularly repeating timer is required, a timer of the same (or different) name can be scheduled from the notification routine, each time the timer expires.
guts-- cancel-- timer
Cancel an outstanding timer.
Format:
guts-- cancel-- timer (identifiers, timeleft)
Parameters:
identifiers Identify the timer uniquely
timeleft If the timer is found, and successfully cancelled, GUTS returns the amount of time which remained before the timer would have expired.
This routine can be called to cancel an outstanding timer, which was previously started with guts-- start-- timer (). This is useful if, for example, the event being timed completes normally, or is aborted.
guts-- check-- timer
Check to see how long remains before a timer will expire.
Format:
guts-- check-- timer (identifiers, timeleft)
Parameters:
identifiers As above
timeleft GUTS returns the time remaining before expiration in this parameter.
This routine can be called in order to check how long is left to go before a specified timer will expire. This is useful for reporting information to management applications.
Chapter 10 GUES Interface Specification
This Chapter provides a functional description of one example of a GUES interface.
gues-- initialise() Initialise the GUES library.
This routine should be called by each component, before any other GUES routine is called. All but the first initialisation is ignored by GUES.
gues-- subscribe() GCSP Request
Ask to be told about a class of events.
Format:
gues-- subscribe (gui-- quid, in-- pars, out-- pars)
Parameters:
gui-- quid Specifies a GUI quid, on which the caller wishes to be notified of event receipt. The notification routine specified in `in-- pars` will be scheduled onto this quid each time the event is received.
in-- pars Input parameters for the registration. See example below.
out-- pars Output parameters for the registration. See example below.
A user calls this routine in order to register an interest in external events, such as AOS/VS Fast IPC's (?SIGNL), UNIX Software Interrupts (signals), or child process terminations (obituaries).
The `in-- pars` packet, contains the type of event, the address of a notification routine to be called on receipt of the specified event, plus any parameters specific to that event.
The `out-- pars` packet contains any information returned by GUES about the registered event.
Some examples of the form which these packets may take follow: Subscribe to VS ?SIGNL events Sues-- subscribe() call:
Input parameters:
typedef struct gues-- in-- pars
event-- type Set to the value GUES EVENT VS SIGNL.
nfunc This is the address of the user notification routine, to be called by GUES on receipt of the event.
udata User data, to be passed into `nfunc`.
Output Parameters:
typedef struct Sues-- out-- pars
sub-- id GUES returns an Identifier for this subscription.
wait-- task-- uid This member specifies the VS Unique Task ID of the internal GUES task which is being used to await the event. This is needed in order to ?SIGNL the task.
This event is available only under AOS/VS. On receipt of a Fast IPC, the caller's notification routine will be scheduled, such that it is called thus:
(*nfunc) (sub-- id, event-- type, udata, 0, gui-- quid);
The `gui-- quid` is the quid on which the notification is being run.
Use of parameters for Software Interrupt event subscriptions.
Input parameters:
typedef struct gues-- in-- pars
event-- type Set to the value GUES-- EVENT-- INT.
int-- num This is the "interrupt number", to which the caller wishes to subscribe. Under UNIX, this is a signal number (defined in signal.h).
nfunc This is the address of the user notification routine to be called by GUES on receipt of the event.
udata User data, to be passed into `nfunc`
Output Parameters:
typedef struct gues-- signl-- out-- pars
sub-- id GUES returns an Identifier for this subscription.
This subscription allows multiple entities within a process to be notified upon receipt of a signal, e.g. under UNIX.
On receipt of the specified interrupt, the caller's notification routine will be scheduled, such that it is called thus:
(*nfunc) (sub-- id, event-- type, udata, int-- num, gui-- quid);
The `gui-- quid` is the quid on which the notification is being run.
Use of parameters for subscriptions to child obits.
Input parameters:
typedef struct gues-- in-- pars
event-- type Set to the value GUES-- EVENT-- OBIT
nfunc This is the address of the user notification routine to be called by GUES on receipt of the event.
udata User data, to be passed into `nfunc`
Output Parameters:
typedef struct gues-- signl-- out-- pars
This subscription is supported under AOS/VS and UNIX. It allows one or more entities within a process to be notified upon termination of a child process. Upon termination of a child process (or of a partner in an AOS/VS Customer-Server relationship), the caller's notification routine will be scheduled, such that it is called thus:
(*nfunc) (sub-- id, GUES-- EVENT-- OBIT, udata, obit-- ptr, gui-- quid);
The `gui-- quid` is the quid on which the notification is being run, and `obit-- ptr` is a pointer to the following structure:
______________________________________USINT32 pid;USINT32 status;} GUES.sub.-- OBIT;______________________________________
pid This field contains the PID of the terminated process.
status This field indicates how the process terminated.
Under AOS/VS, it contains zero for a normal termination, or else an error code. This error code may be returned from the terminated process (via ?RETURN), or be supplied by GUES to represent an abnormal termination.
Under UNIX, `status` contains the exit status of the terminated child, as obtained from the wait3(2) system call, documented in UNIX.
Use of parameters for subscriptions to select(2) events.
Input parameters:
typedef struct gues-- select-- mask
typedef struct gues-- in-- pars
event-- type Set to the value GUES-- EVENT-- SELECT
select-- mask This field must contain a pointer to a GUES-- SELECT-- MASK structure. If this structure is dynamically allocated, then it must not be freed since GUES continues to access it for the duration of the process.
nfunc This is the address of the user notification routine, to be called by GUES on receipt of the event.
udata User data, to be passed into `nfunc`.
Output Parameters:
typedef struct gues-- out-- pars
sub-- id GUES returns an Identifier for this subscription.
This subscription allows multiple users to be notified of I/O conditions, as implemented by the select(2) system call. Each subscriber to this GUES service has a set of File Descriptor masks, which indicate which files the subscriber is interested in Read, Write and Exception conditions upon.
Whenever a select(2) call indicates an I/O condition, GUES will schedule a single notification for each subscriber whose select mask specifies one or more of the descriptors with conditions on them. Notifications will be scheduled such that thy are called thus:
(*nfunc) (sub-- id, GUES-- EVENT-- SELECT, udata, mask-- ptr,gui-- quid);
The `gui-- quid` is the quid on which the notification is being run, and `mask-- ptr` is a pointer to a GUES-- SELECT-- MASK containing the output from the select(2) call (i.e. it indicates which conditions are present on which files` descriptors).
user-- event-- received() User Notification
Calling sequence for event
Format:
void user-- event-- received (sub-- id, event-- type, udata, event-- param, gui-- quid)
Parameters:
sub-- id This is the Subscription ID, which was returned by GUES when the user subscribed to the event which is being notified.
event-- type This indicates the type of event which has arrived (GUES-- EVENT-- VS-- SIGNL, GUES-- EVENT-- INT, GUES-- EVENT-- OBIT, or GUES-- EVENT-- SELECT).
udata This is a user data parameter, which is passed transparently by GUES. It has the value specified by the user on the subscription.
event-- param The use of this parameter is dependent on the particular event type.
gui-- quid Specifies the GUI quid on which the notification is being run.
This routine gets called when an event which has previously been subscribed to is received. Note that the name of this routine is actually assigned by the user, and its address passed on the subscription call. The name `user-- event-- received()` is used simply for example.
Unlike GUTS timers, event subscriptions remain in force for the duration of the process invocation. There is no need to renew a subscription from the notification routine.
Chapter 11 GUI Programming Example
This Chapter shows the use of GUI to implement a simple GCSP, which provides an unpended read service. It also shows a simple User, which invokes the services of the GCSP, to perform unpended reads. The example is written in the `C` language, but is not intended as a complete program. Rather, it is intended to illustrate GUI usage. This example is specific to AOS/VS, since it uses a slave AOS/VS task to do pended I/O. This is not the way GUI should be used if UNIX portability is an issue, however, a more realistic example would be unnecessarily complex and less informative.
The example is also rather lax on error checking. Any real user of GUI should be sure to check return codes exhaustively, since the effects of failed GUI requests are likely to be serious and difficult to trace later on.
______________________________________GlobalsGUI.sub.-- QUID slave.sub.-- quid; /* Quid allocated to GCSP slave task*/GUI.sub.-- QUID user.sub.-- quid; /* Quid of user's main task */End GlobalsGCSP Code/* GCSP.sub.-- init()** Routine to be called by user, to initialise the GCSP.* Spawns a slave VS-Task, to do pended requests.*/GCSP.sub.--init () }extern GCSP.sub.-- slave ();mtask (GCSP.sub.-- slave, $STACK.sub.-- SIZE); /* start slave task */gui.sub.-- initialise/* GCSP.sub.-- slave ()** Runs as a slave VS-task. Just calls gui.sub.-- run, from where any* scheduled calls will be run.*/GCSP.sub.-- slave{gui.sub.-- allocate.sub.-- quid (1, NULL, &slave.sub.-- quid);while (TRUE){/* Run any routines the GCSP tells us to. */gui.sub.-- run (GUI.sub.-- OPTION.sub.-- PEND);}/* GCSP.sub.-- async.sub.-- read()** The unpended read Request routine. Builds an internal* representation of the request (understood within the* GCSP), and schedules it to run on the slave task.** The slave will call the users notification routine, when the* read is done.*/GCSP.sub.-- async.sub.-- read (Nfunc, quid, buff, fp, nbytes)void (*Nfunc) (); /* Users notification routine */GUI.sub.-- QUID quid; /* User quid to run notification on */char *buff; /* Buffer, to read into */FILE *fp; /* File descriptor to read from */INT32 nbytes; /* Number of bytes to read */{READ.sub.-- PKT *read.sub.-- pkt;extern slave.sub.-- read();/* Allocate an internal request packet, and fill in* parameters from our arguments. */read.sub.-- pkt = (READ.sub.-- PKT *) alloc (sizeof (READ.sub.-- PKT));read.sub.-- pkt->notification.sub.-- quid = quid;read.sub.-- pkt->notification.sub.-- routine = Nfunc;read.sub.-- pkt->fp = fp;read.sub.-- pkt->buff = buff;read.sub.-- pkt->nbytes = nbytes;/* Schedule the pended read to happen on our slave taskgui.sub.-- schedule (slave.sub.-- quid, slave.sub.-- read, read.sub.--pkt);/* ... and return */return (OK);}/* slave.sub.-- read()** This GCSP routine actually does the pended read.* It is run from gui.sub.-- run, on the slave task, when scheduled by* GCSP.sub.-- async.sub.-- read().*/slave.sub.-- read (read.sub.-- pkt)READ.sub.-- PKT *read.sub.-- pkt;{/* Do the pended read. */fread (read.sub.-- pkt->buff, read.sub.-- pkt->nbytes, 1, read.sub.--pkt->fp);/* Request done - schedule the notification back onto the* User's main task; passing the full data buffer back as* `argl` */gui.sub.-- schedule (read.sub.-- pkt->notification.sub.-- quid,read.sub.-- pkt->notification-routine,read.sub.-- pkt->buff)/* Free up the internal request packet */free (read.sub.-- pkt);return (OK);}End GCSP CodeUser Code/* The User's main routine. This simple example just issues* Unpended reads and waits for them to complete, until the* End-Of-File is reached.*/USER.sub.-- main ()}FILE *fp;char buff [$BUFF.sub.-- SIZE];extern USER.sub.-- read.sub.-- done ();/* Initialise the world. */gui.sub.-- initialiseGCSP.sub.-- init ();gui.sub.-- allocate.sub.-- quid (1, NULL, &user.sub.-- quid);fp = fopen ("testfile", "r");while (-feof (fp)){/* Make unpended request. */GCSP.sub.-- async.sub.-- read (USER.sub.-- read.sub.-- done, user.sub.--quid, buff, fp);/* In practice, the user would do some other processing* here. Also, there would probably be multiple requests* outstanding.* For simplicity in this example, we just wait for the* read to complete. */gui.sub.-- run (GUI.sub.-- OPTION.sub.-- PEND);}}/* USER.sub.-- read.sub.-- complete** The user's notification routine, called by GUI, from gui.sub.-- run,* when the request completes.* It does some processing of the received data, and then calls* gui.sub.-- wakeup(), so that when we return, the task will return* from gui.sub.-- run, enabling another request to be made. */USER.sub.-- read.sub.-- done (buff)char *buff(); /* This is `argl` */{process.sub.-- data (buff); /* Don't care what it does */gui.sub.-- wakeup (user.sub.-- quid);return (OK);{End User Code______________________________________
Chapter 12 Internal Structure
This Chapter represents the design of the AOS/VS version of GUI. The UNIX and MS-DOS versions can be as similar as possible, though there will be differences. At points in this specification where there are specific, evident, differences or issues, these will be noted by comments in square brackets, thus: [UNIX: Text of UNIX issue].
GUI has a very simple structure, illustrated in FIG. 18. GUI is represented by the heavy line block 180 consists merely of a set of queues, of which four are shown here, denoted Q1, Q2, Q3, Q4, containing Notifications waiting to be run. Queues are allocated by calls to `gui-- allocate-- quid()`. Notifications are placed on queues by calls to `gui-- schedule()`, and taken off queues by `gui-- run()`, as illustrated. FIG. 18 does not show the other GUI routines.
GUI forms the basis of the tasking and flow of control environment for the network communication system.
The User application 181 makes unpended requests of one or more GCSFs, two GCSPs 182 and 183 being illustrated. These GCSP's may, in turn, make requests of other GCSP's and GCSP 182 and GCSP 183 are shown communicating with each other over path 184 in the example of FIG. 18.
In the course of its processing, a GCSP may schedule routines to be called, in itself, in another GCSF, or in the User. This scheduling is indicated by the arrows 185 from the GCSP's to `gui-- schedule`, and results in a notification being put on to an internal GUI queue, to be picked up by `gui-- run`. Typically, the scheduling will be done from a separate VS-task awaiting external events. [UNIX/MS-DOS: From interrupt level.]
Scheduled routine calls get run when the User calls `gui-- run`. This is shown by the arrows 187 from the Queues Q1-Q4 into `gui-- run` and the arrow 188 from User 181 into gui-- run() . . . The scheduled calls may result in routines in the User 181, or within GCSPs 182, 183 being called, again as shown by arrows 186.
As previously noted, the User may need to schedule routines on to quids. This is shown by the connection 189.
Chapter 13 Data Structure Specification
Because of the transient, and runtime specific nature of GUI notifications, there is no need to preserve any information across process invocations. All of the GUI structures are therefore memory resident. There are no on-disk structures. In the following data structure pictures the sizes of various members (pointers in particular) are shown as they would be on the MV. These are not necessarily the same as on the PC.
13.1 The GUI Queues
The main data structures within GUI are the job queues. These form the only coupling between `gui-- schedule`, and `gui-- run`. The job queues are anchored off per-task headers, which are themselves on a linked list, anchored in a single Queue-descriptor. Hence there is only one global anchor, off which all GUI structures hang, directly or indirectly.
The entries on the job queues are Notification Control Blocks (NCB's), containing the information necessary for GUI to run the requested notifications, with the indicated parameters.
A typical arrangement is shown in FIG. 19. This example shows Job Queue lists for `N` owners (VS-tasks). [UNIX/MS-DOS: There is only one owner.]
Owner 1 has two `quids` Job Q1 and Job Q2 allocated, with two jobs scheduled onto the first of them, and none on the second. Owners 2 and N, each have one quid allocated, with no jobs scheduled.
All the lists are doubly-linked MV queues, so that the MV hardware queuing instructions can be used. These instructions are atomic, and eliminate the need for locks. [UNIX/MS-DOS: If the hardware in these environments does not provide similar instructions, then it may be necessary to disable interrupts for the duration of Enqueues and Dequeues.]
13.1.1 GUI-- ROOT Descriptor
This is the root anchor for all GUI queues. It has the structure shown in FIG. 20. The two members are pointers, which point to the First and Last Owner Queues. As with all MV queues, these members are both -1, if the Q is empty.
13.1.2 Per-owner list anchor
This structure is what is on the list anchored in GUI-- ROOT and is illustrated in FIG. 21. It contains `next` and `prey` pointers, an owner id, and a Q descriptor for the list of `quids` owned by that user. The Job Queues hanging off this anchor are sorted in priority order. There are also some fields used to control access to the Q by the owner.
The `owner` field identifies the Owner task of the Job Queues on this list. In order to avoid the overhead of system calls to discover the VS Task-ID, the Stack Base of the Owner task is used for this identification. This approach is in common with the DG Language Runtime Libraries, and therefore imposes no extra constraints.
The `mbox`, is an inter-task mailbox, on which the owner waits if he does a pended `gui-- run`, when there are no notifications scheduled on any of the owned job queues. The task will be awoken when another task does a `gui-- schedule`, or `gui-- wakeup`, on a `quid` owned by this task. VS inter-task system calls (?REC and ?XMT), will be used for this purpose. [UNIX/MS-DOS: The wakeup will be done from interrupt level. Spin locks will be used for MS-DOg, and a "select()" system call for UNIX.]
The `status` field contains various control bits, and is defined in FIG. 22. The `running` bit is set when GUI is running a notification for this Owner and is used to prevent nested calls to `gui-- run`. The `waiting` bit is used when the task is waiting on the `mbox`. The `wake-- up` bit is set in order to cause a running task to wake up after the currently running job. The `job-- scheduled` bit is set by gui-- schedule, whenever a job is scheduled. This closes the window which would otherwise exist, when a job gets scheduled whilst another VS-Task is searching for a job to run.
13.1.3 Job Queue Anchors
This structure is what the actual NCB's for a given `quid`, are anchored to. It is shown in FIG. 23 and contains the Job Q id `quid`, and its priority, plus the usual Q descriptor, for the NCB's.
13.1.4 Notification Control Blocks
These are the control blocks, which are queued onto the Job Q's. Each one represents a Notification which has been scheduled, and contains all the information required to run it.
These control blocks have the format shown in FIG. 24. The `next` and `prev` fields point to the next and previous NCB's on this Job Q. The other members are the parameters passed to `gui-- run()` and which will be passed to the notification routine, when it gets run.
It can be seen from this structure, that the memory requirement for each outstanding, scheduled notification, is 7 double words (28 bytes). It will be left to the GUI Users to ensure that memory is available for these blocks. If GUI cannot allocate an NCB when it needs one, it will return an error from `gui-- schedule()`.
13.2 Quid Table In order to speed-up access to the GUI Job Queues, there is a table, indexed by `quid`, which gives the location of the Job Q identified by `quid` Each entry in this table has the format shown in FIG. 25.
To avoid the need to lock the quid table, entries are written atomically. An unallocated quid will have the value NULL in the `job-- q-- ptr` field of its table entry. During allocation, this field will be filled in atomically, as the last stage of the allocation, at which point the quid becomes valid.
Again, to avoid the need for locks, the table can be a fixed size, of 256 entries. This imposes a limit on the number of available quids, of 256. A shared access scheme can alternatively be implemented, allowing shared read-only access of the quid table, but exclusive write access, so that the table can be grown when it becomes full.
Quids are allocated started at a value of 1, leaving the value 0 free as a special value (NULL-- QUID). Additionally, all negative values are invalid, and reserved for special meanings.
13.3 Within the context of the data structure described above by way of example, this Chapter concludes with a single example of the actions which may be taken by one of the GUI modules, namely procedure gui-- allocate-- quid (priority, user-- wakeup) begin
get the callers stack base;
search the owner Q chain for an anchor owned by this task;
if (owner anchor not found)
begin
allocate a new per-owner list anchor;
fill it in;
add it to tail of the owner Q chain;
end
allocate and init Job q anchor;
put allocated quid into Job Q anchor;
put user-- wakeup into Job Q anchor;
add Job Q to the owners Job Q chain, at a point determined by priority;
obtain the next available quid, and claim that slot in the quid table;
put pointers to the owner anchor, and Job Q, into the claimed slot;
return the quid just allocated;
end.
The module specifications for gui-- schedule, gui-- run, etc. can be analogously derived.
13.4 GUI Memory Management
GUI can have its own memory management scheme, consisting of a pool of memory blocks, of suitable sizes for the NCB's, Job Q's, and Owner Anchors. The aim of this scheme is to provide a more efficient allocation mechanism than the standard C runtimes, based on the knowledge that most of the memory required will be in blocks of the same size. However, the standard C functions `alloc` and `free` may be used.
Chapter 14: GUI and Communications Server System
FIGS. 26A, 26B illustrate the basic outline of the operations which result when a message is received from a network interface and needs to be sent to its destination. This is given purely as a simplified example in order to avoid obscurity arising from excessive detail. The notification that there is a message to send will come from the specific routines 45 (FIG. 3) in the form of an IPC from another server process. It is assumed that the software interface 44 is waiting within gui-- run(pend), as indicated at 262. At 264, the IPC comes in and puts a routine on a GUI quid. If the gateway is a CEO gateway 12A, for example, this will be a routine ceo-- msg-- rcvd() 266. Because the software interface is in gui-- run(pend), ceo-- msg-- rcvd() will be run and will schedule another routine, namely build-- PDU() 268 which will likewise be run. This routine is a TOOLS routine which implements functions well understood per se; it builds a PDU in X400 1988 format as used on the UMB, making use of ARTX400, by getting each field from the CEO message, converting it to the UMB format and adding it to the FDU being built. This can be done by a simple add item routine additem() which can be implemented conventionally, without going through the procedure of being gui-- scheduled and gui-- run, since ART routines do not do a lot of processing.
Ceo-- msg-- rcvd() also schedules a GCSP request TOOLS-- send() 270 which sends the message out on to the universal messaging backbone 15. TOOLS-- send() firstly performs internal processing 272 in which it goes through the recipient list for every recipient (there may be more than one in general) and makes a directory look-up for every recipient, as indicated at 274. The directory look-ups are handled by a separate directory server process, also running within gui-- run() 276, each look-up being initiated by an IPC 278 and the results being returned by IPCs 280. Directory completion is determined at 282 for each look-up in turn and then the message is submitted to GCSP request routine 284 (FIG. 26B) mti-- send(), which implements the actual sending over the UMB 15. The network connection is established at and the event "connected" 288 is signalled via the routine mti-- connected 290. TOOLS-- data-- access() 292 then gets the message data from disk and data send 294 takes place. This procedure is followed for all recipient gateways in turn.
For simplicity only the barest outline of the protocols followed in message transmission are here given. The Figures do not illustrate the data confirmation procedures, nor the saves to disk which take place at various stages, e.g. where indicated by asterisks. Moreover the Figures cannot bring out the real essence of GUI, since they appear to illustrate a conventional sequence of routines which could be implemented in the normal manner of linear programming languages. The routines must indeed implement a sequence of operations, which must follow the well established principles of data communication, but the significant point about the implementation in GUI is that the routines do not simply call each other in the correct sequence and pend until completion. Rather their notification routines or jobs are put on to the GUI quids by calls to gui-- schedule() and run by calls to gui-- run(), as explained above with reference to FIGS. 13 to 17.
What is more, in a real life situation, many messages will be handled simultaneously, being in different stages of handling from message to message. This is more or less impossible to illustrate meaningfully in a drawing but it can readily be understood that GUI, as described above is ideally suited to handle this situation, since all the different notification routines or jobs to be run are put on to the GUI quids and they all get run in turn as a result of the calls to gui-- run(). Also, in a communications server system, jobs have varying priorities and it is easy to implement the different priorities by the use of quids with different priorities.
______________________________________IV ABBREVIATIONS AND ACRONYMS______________________________________AOS/VS Data General operating system for its MV computersART ASN.1 Run Times - library routines, decode/encode between transfer and internal syntaxASN.1 Abstract syntax notation 1, international (ISO) standard for abstract definition of the representation of data typesAU Access unitC Programming languageCCITT International Telephone & Telegraph Consultative CommitteeCEO Data General office automation systemCS Communications serverCSID Called subscriber identifierDG Data General CorporationDISOSS IBM Office automation systemECS External calling sequenceGCSP GUI-conformant service providerGUES Generic unpended event-handler serviceGUI Generic unpended interfaceGUTS Generic unpended timer serviceID IdentifierIPC Inter-process communication - message passed between two processesI/O Input/outputIBM International Business Machines CorporationISO International standards organisationLAN Local area networkMRC Message-based reliable channel, standard 400 Mb/s busMTI Message transfer interfaceMS-DOS Standard operating system for PC'sMV Data General computers running AOS/VSNCB Notification control blockOS Operating system for a computerPAD Packet assembler/disassemblerPC Personal computer (IBM or clone)PDN Public data networkPDU Protocol data unit - information passed in single structured chunkPID Process identifierPROFS IBM Office automation systemPSTN Public switched telephone networkPTT Postal, telegraph & telephone administrationQ Abbreviation for QueueQUID Queue identifierRUA Remote used agentSNA Systems network architecture IBM networkSNADS IBM message protocolVS = AOS/VSX25 Packet switching protocolX400 CCITT standard for message handlingX500 CCITT standard for directory service______________________________________
Note that reference should be made to published manuals for an explanation of AOS/VS terminology.. | https://patents.google.com/patent/US5377191 | CC-MAIN-2018-17 | refinedweb | 19,296 | 59.43 |
Hi, I am having some problems with the REQUEST namespace/object. I understand that if I submit form data then it can be retrieved using the REQUEST object. I have looked at Chapter 7 (Advanced DTML) for support but I'm still no closer to success. I have a DTML method, which passes an unknown number of arguments with unknown names to another method. For example, <form action="display"> Name <input type="text" name="name1"><br> Age <input type="text" name="age1"><br> Name <input type="text" name="name2"><br> Age <input type="text" name="age2"><br> <input type="submit"> </form> I would like the display method to simply show each of the variable's names and values i.e. iterate through each variable in the REQUEST object. Maybe I've overlooked something in the Zope documentation but could someone supply a useful snippet of code to get me started? Thanks very much, - ) | https://www.mail-archive.com/zope@zope.org/msg13731.html | CC-MAIN-2016-50 | refinedweb | 153 | 62.88 |
This is the last preview of major new aspects in 0.9.x. Aspects presented in earlier previews were a redone command system, a new task model, and a new logging and I/O system called streams. This preview introduces the new multi-project incremental compilation, redesigned multi-project dependency management, and redesigned overall multi-project support, including better control over execution vs. classpath dependencies, support for external projects. If you only ever work on single projects, the new incremental compilation should still benefit you as well as the potential future support for remote projects.
Create a new project. Add project/Single.scala with these contents:
import sbt._
class Single(info: ProjectInfo) extends DefaultProject(info)
{
// haven't gotten to reading from build.properties yet
override def name = "single"
}
Create a couple of source files in the root directory (or src/main/scala if you prefer):
A.scala
object A
{
val x = 3
}
B.scala
object B
{
val x = A.x
}
You can see the B uses A and that the inferred type of B.x will be the type of A.x. Go ahead and startup sbt, load the project definition, and run an initial compilation:
$ xsbt shell
> loadp
> compile
Now change the value for A.x to be 5 instead of 3. sbt prior to 0.9 would recompile both A.scala and B.scala because it only knew that the file had changed, not what changed inside. Now, sbt recompiles the modified files and only recompiles dependencies if the public API changes. So, if you run another compile, sbt will only recompile A.scala. However, if you change A.x to be true instead of 5, you will notice that sbt recompiles A.scala, realizes it affects B.scala and recompiles that as well. Perhaps most usefully, this works across multiple projects as well.
Now, let's create a new project to demonstrate multi-project recompilation. Add project/Multi.scala:
import sbt._
class Multi(info: ProjectInfo) extends DefaultProject(info)
{
override def name = "root"
// unlike in 0.7.4, this only declares subA as an execution dependency
// That is, it is not placed on the classpath of the root project, but aggregate commands are executed on it.
// Also unlike 0.7.4, commands are not aggregate by default. This will be shown later.
val subA = project("a", "A", (i: ProjectInfo) => new DefaultProject { val info = i })
// so, to declare it as a classpath dependency, we say we want it as a 'compile' dependency
// with that, 'A' is compiled first and the result used on 'root's classpath.
val subADep = subA % "compile"
}
Let's create the same source files, but in separate projects. We'll put A.scala in the subproject and B.scala in the root project.
a/A.scala
Now, we execute compile for the initial compile (after starting up sbt and loading the project definition with loadp). Then, make the changes as before. Modify A.x to be 5 and note that B.scala is not recompiled. Modify A.x to be true and note that B.scala is recompiled.
You can list project with projects and move between them with project <name> (tab completion is not there yet).
The full details would comprise a long article, but here is a short summary.
sbt now inserts an additional compiler phase after typer that extracts the API of compiled classes as an immutable data structure that tries to correspond as closely as possible to the Scala specification, especially Ch. 3 on types. This data structure is persisted so that it can be used between jvm invocations. Additionally it is available as the output of the compile task. A later section shows one way this can be used from your project definition.
As before, sbt checks which sources are modified or are out of date because of changes to binary dependencies (jars). What is new is that dependencies on other projects are tracked by their source API instead of the last modified time of the binary (either a class file or a jar). So, sbt will check whether the API for a dependency has changed and if it has, invalidate the dependent source (schedule it for recompilation). The first compilation run is then performed on these modified or invalidated sources. Note that within the project, transitive dependencies are not recompiled at this time.
During this compilation the new API for the sources is determined and checked against the previous API. If the public API has changed, then transitive dependencies of the changed source are recompiled. Note that the steps of determining the changes and propagating the changes are separate. That is, sbt does not determine what additional files to recompile based on what changed, only that there were changes.
As sbt users probably know, sbt 0.7.4 auto-detects test classes during compilation. Because the API of sources is now extracted and available after compilation, this discovery is now done after compilation. In fact, you can fairly easily do your own discovery. The following example shows how to detect subclasses of the marker interface DiscoveryTest.
Add the following task definition to one of the project definitions above (and reload the project definition with loadp):
lazy val find = compile map { analysis =>
build.Build.discover(analysis, None, build.Auto.Subclass, "DiscoverTest")
}
You can restrict the results to modules by using Some(true) instead of None or to only classes with Some(false). You could detect annotations instead by using build.Auto.Annotation instead of build.Auto.Subclass. You can do more advanced processing, but you'd have to implement that yourself. The discover method is only for the relatively simple needs of test discovery.
Try it out by defining the marker interface, having one of the objects implement it (the object should be in the project defining find), and then running show find. (show will print the result of find. We could have also used a println in the definition of find if we wanted.)
object B extends DiscoverTest
trait DiscoverTest
External projects are fully supported in 0.9. There are no longer any restrictions with respect to location on the local filesystem. There is no longer the requirement that there be a single point of definition. That is, you can call project("sub") in multiple projects and sub will only be loaded once. The tradeoff is that project("sub") no longer loads and returns the Project instance immediately, but instead returns a descriptor that can later be used to obtain the Project instance. A bonus of this approach is that I believe it would be straightforward to add simple support for remote projects, like project("git://github.com/harrah/sbinary"). It would be more work to properly generalize it to allow arbitrary handlers, control updating the local copy, and so forth, but if you are interested in this, let me know and I'll try to point you in the right direction.
With that said, let's look at an example. We will add an additional sub project to our multi-project example. Because it is an external project, we need to make a full new project. Create this new project some other directory than the current project (this is not mandatory, it is just to demonstrate that it works outside of the project hierarchy). Add a project definition in this new project in project/External.scala:
import sbt._
class External(info: ProjectInfo) extends DefaultProject(info)
{
override def name = "external"
}
and a new source in E.scala (in the new project's root directory or in src/main/scala):
object E
{
val x = false
}
Change B.x from before to refer to E.x:
object B
{
val x = E.x
}
Add the dependency to MultiProject.scala:
val ext = project(new File("/path/to/external"))
val extDep = ext % "compile"
You can start sbt in the external project directory (xsbt shell), load the project definition (loadp), and run compile. Here you are working directly on this project. You can then exit out of sbt and head back to the original project directory, startup sbt, load the project definition, and run compile there. Now, you are working with the project as an external project.
Modify E to be
object E
{
val x = "a string"
}
Run compile. B.scala is recompiled again. Change E.x to return a different string. Note that E.scala is recompiled, but B.scala is not.
Note that the sbt.version setting for an external project is ignored. sbt should really check that it is the same or do something else more intelligent, but it doesn't. Also, I don't remember if cycles between projects are detected.
Issue #44 describes a design flaw in sbt's inter-project dependency management. Consider a project A that depends on a project B. B declares a dependency on library L version 1.0. A declares a dependency on L 1.0.1. What goes on the compile classpath for B? How about A? Assume conflicts are resolved by the newest version available, as is the default in Ivy. Then, B should compile against L 1.0 and A should compile against L 1.0.1 and B, but L 1.0 should not be on A's classpath. Both L 1.0 and L 1.0.1 are on A's classpath in sbt 0.7.4. This is fixed in 0.9, but required an overhaul of how sbt does dependency management.
Previously, each project's dependencies were resolved independently and for each configuration separately. That is, A's 'compile' dependencies would be resolved without B entering the picture. The dependencies were retrieved to lib_managed/compile for each project. When the 'compile' classpath was required for A, the jars in A's lib_managed/compile were combined with those in B's lib_managed/compile. Clearly, this gives rise to the issue mentioned previously.
The fix is to resolve A's dependencies with the information that B is a dependency of A. For various reasons, the current way of laying out lib_managed is no longer reasonable. The current implementation of update returns a map from a configuration to the list of dependency locations in the Ivy cache. There are many good reasons not to use dependencies out of the cache, but ease of implementation is no longer one of them. I expect to implement the option of retrieving to lib_managed, but it will not be in the same layout (because it is incorrect). It is, however, straightforward to get the locations of dependencies from the update task. Consider the following multi-project definition:
import sbt._
class DepDemo(info: ProjectInfo) extends DefaultProject(info)
{
override def name = "root"
val sub = project("sub", "Sub", new Sub(_))
val subDep = sub % "compile"
val ju = "junit" % "junit" % "4.4" % "compile"
class Sub(info: ProjectInfo) extends DefaultProject(info)
{
override def name = "sub"
val ju = "junit" % "junit" % "4.5" % "compile"
}
}
Start sbt, loadp, and run show update. You can see that the result of the update task is a mapping from configuration to dependency locations. Note that this does not include project dependencies; these are handled separately. You may have noticed from running compile that the compile task runs update first. It does this to get the mapping that update provides. Currently, update does a full run each time. However, the intention is for update to only run if the inputs have changed. sbt 0.9 provides much better mechanisms for implementing this behavior, which has been discussed before. If you are interested in implementing this feature, send an email to the mailing list.
This final section will highlight the refined semantics of project dependencies. Project dependencies are now separated into execution and classpath dependencies. If a project A has an execution dependency on project B, an aggregate task act in A has an implicit dependency on the act task in B (if it exists). An aggregate task is a task that can be executed across projects. In 0.9, tasks are not aggregate by default. This can be enabled by calling the implies method. For example:
import sbt._
class AggDemo(info: ProjectInfo) extends DefaultProject(info)
{
override def name = "root"
// declare an execution dependency on 'sub'
val sub = project("sub", "Sub", new Sub(_))
// make it an aggregate task
lazy val hiAgg = task { println("Hello 1") } implies;
// not an aggregate task
lazy val hiPlain = task { println("Hello 2") }
class Sub(info: ProjectInfo) extends DefaultProject(info)
{
lazy val hiAgg = task { println("Hello Sub 1") } implies;
lazy val hiPlain = task { println("Hello Sub 2") }
}
}
Start sbt, loadp, and run:
> hiAgg
Hello Sub 1
Hello 1
> hiPlain
Hello 2
> project Sub
> hiPlain
Hello Sub 2
The reason that aggregation is no longer the default is that now that tasks return values, you will usually explicitly map the output of dependent tasks that might have previously been implicit. For example, compile depends on the classpath tasks of the enclosing project's classpath dependencies. These will in turn depend on the compile task in their respective projects. So, there is no need for an implicit dependency between compile tasks.
As shown in the Dependency Management section, classpath project dependencies are project that are used in a project's classpath and are enabled by declaring the configuration mapping, which is usually "compile" for a compile dependency (it will also be available in tests and at runtime) or "test" to only use the dependency in test code. This latter use case was a bit more verbose and fragile in previous versions of sbt.
If you want only a classpath dependency and not an execution dependency, make the initial val private:
private val sub = project("sub", "Sub", new Sub(_))
val subDep = sub % "compile"
Tasks in sub will still get run when there are explicit dependencies on them, as for compile. If you run update, however, it will only update the current project.
This preview concludes the presentation of the major, open-ended, long-term architectural designs/redesigns that have come to fruition in 0.9. (The new task engine has been in progress for over a year and so has multi-project aggressive incremental recompilation with API extraction. Issue #44 has been pending for about a year as well.) With this, I believe 0.9.0 is almost ready. Rather than work until 0.9.0 is nearly a drop-in replacement for 0.7.4, I'd like to release it now (well, very soon) essentially with the features presented so far. The features for 0.9.1 will probably be 'test', 'console', and 'run'.
Beyond that, I have some ideas. However, I think now is a great time to get involved. Some people have inquired about this and I'd very much like to help people get involved and working on interesting projects. Certainly I can drive the 0.9.x experimental series to become the stable 0.10.0 release myself, but I think the result will be more interesting and useful with others building on the systems I have described so far. The next article you can expect to see is a discussion of some opportunities for working on sbt, including what needs to be done or could be done. | https://www.scala-sbt.org/0.7.7/docs/090p4tour.html | CC-MAIN-2018-43 | refinedweb | 2,533 | 57.98 |
Clean Control Flow in Elixir with Pattern Matching and Immutability
By Cristine Guadelupe
Learn how to use pattern matching instead of guard clauses to implement really clean control flow in Elixir.
One of the features that fascinate me most about Elixir is pattern matching. I always wonder if there is a way to solve what I need using it and I love exploring it. When you combine the beauty of pattern matching with the power of immutability some things almost seem magical but they are not! It is not my focus to cover everything about pattern matching and immutability but instead to demonstrate how we can use pattern matching instead of guard clauses to implement clean control flows in Elixir.
For this post we’ll focus on implementing logic for the tabletop game Battleship. The first rule we’ll implement is simple: a player cannot go twice in a row. One way to solve this is to track the last player that performed a move. With this information we now have two possibilities: If the player who is trying to make a move is the same as the last player who take action we will just ignore the move. Otherwise we can will compute the move.
Depending on our experience with Elixir we might reach for a conditional as the first solution, something like:
def maybe_move(player, last_player) do if player != last_player do player |> make_a_move() |> set_as_last_player() else :ignored end end
Or even pattern matching with guard clause
def maybe_move(player, last_player) when player == last_player do :ignored end def maybe_move(player, last_player) do player |> make_a_move() |> set_as_last_player() end
But it is possible to combine the pattern matching we already used in the guard clause solution with the power of immutability to come up with an even more alchemistic solution!
def maybe_move(last_player, last_player) do :ignored end def maybe_move(player, last_player) do player |> make_a_move() |> set_as_last_player() end
Wait a second, what have we done here?
We define the first version of the
maybe_move function to take in a first and second argument named
last_player. This means the function will only match if the player provided as a first argument matches the player provided as a second argument
Thanks to immutability, when we call both arguments by the same name Elixir will check if they are actually the same!
We could easily call both arguments player or even something like player_is_the_last_player. It doesn’t matter! The rule is just that if we want to ensure that there is equality, we call both arguments by the same name!
Ok, it’s time to play using our nice little code!
Let’s say we have
player1 and
player2,
player1 made the most recent move and therefore is our last_player and now
player2 will try to move!
So we will call the function
maybe_move(player2, player1) where
player2 is the player who wants to make a move and
player1 is our last_player
We have two
maybe_move functions both with arity 2, so Elixir will try to pattern match from top to bottom, i.e. the first function it will try to match will be
def maybe_move(last_player, last_player) do :ignored end
Our first argument is
player2 and Elixir will bind it with
last_player = player2 and since our second argument is also a
last_player, Elixir will use the
^ (pin operator) to check if the previous bind is valid for the second argument instead of trying to rebind it.
last_player = player2 ˆlast_player = player1
As player2 is different from player1, we will not have a valid pattern match and therefore Elixir will move on to try to match with the next function!
Our next match attempt!
def maybe_move(player, last_player) do player |> make_a_move() |> set_as_last_player() end
Now the behavior will be different, we are asking Elixir to match two different arguments. That is, to make a bind for each one.
player = player2 last_player = player1
With a valid match, our function will run! Player2 will make a move and then will be registered as our new
last_player!
What if player2 tries another move in a row?
Well, we will call our first
maybe_move function again and try a match. Player2 wants to make a move and is also
last_player, so we get the following call:
maybe_move(player2, player2)
Trying to match it with the first maybe_move function we get the following match:
def maybe_move(last_player, last_player) do :ignored end
last_player = player2 ˆlast_player = player2
Which is a valid match! And since our function just ignores the move attempt, nothing will happen until another player attempts a move! That’s it! We’ve learned how pattern matching and data immutability together can provide an elegant solution to control flows, another tool in our Elixir toolbox!
Resources
If want to learn more about Pattern Matching you can find amazing materiais here on ElixirSchool! | https://elixirschool.com/blog/clean-control-flow-in-elixir-with-pattern-matching-and-immutability | CC-MAIN-2022-27 | refinedweb | 797 | 56.69 |
environments.
Listing 3. Making a Copy of the Environment
// Get a reference to the main module. PyObject* main_module = PyImport_AddModule("__main__"); // Get the main module's dictionary // and make a copy of it. PyObject* main_dict = PyModule_GetDict(main_module); PyObject* main_dict_copy = PyDict_Copy(main_dict); // Execute two different files of // Python code in separate environments FILE* file_1 = fopen("file1.py", "r"); PyRun_File(file_1, "file1.py", Py_file_input, main_dict, main_dict); FILE* file_2 = fopen("file2.py", "r"); PyRun_File(file_2, "file2.py", Py_file_input, main_dict_copy, main_dict_copy);
I'll get into the details of how PyRun_File() works in a little bit, but if you look carefully at Listing 3, you should notice something interesting. When I call PyRun_File() to execute the files, the dictionary gets passed in twice. The reason for this is that Python code actually has two environmental contexts when it is executed. The first is the global context, which I've already talked about. The second context is the local context, which contains any locally defined variables or functions. In this case, those are the same, because the code being executed is top-level code. On the other hand, if you were to execute a function dynamically using multiple C-level calls, you might want to create a local context and use that instead of the global dictionary. For the most part though, it's generally safe to pass the global environment for both the global and local parameters.
At this point, I'm sure you've noticed the Py_DECREF() calls that popped up in the Listing 3 example. Those fun little guys are there for memory management purposes. Inside the interpreter, Python handles memory management automatically by keeping track of all references to memory transparent to the programmer. As soon as it determines that all references to a given chunk of memory have been released, it deallocates the no-longer needed chunk. This can be a problem when you start working on the C side though. Because C is not a memory-managed language, as soon as a Python data structure ends up referenced from C, all ability to track the references automatically is lost to Python. The C application can make as many copies of the reference that it wants, and hold on to it indefinitely without Python knowing anything about it.
The solution is to have C code that gets a reference to a Python object handle all of the reference counting manually. Generally, when a Python call hands an object out to a C program, it increments the reference count by one. The C code can then do what it likes with the object without worrying that it will be deleted out from under it. Then when the C program is done with the object, it is responsible for releasing its reference by making a call to Py_DECREF().
It's important, though, to remember when you copy a pointer within your C program that may outlast the pointer from which you're copying, you need to increment the reference count manually, by calling Py_INCREF(). For example, if you make a copy of a PyObject pointer to store inside an array, you'll probably want to call Py_INCREF() to ensure that the pointed-to object won't get garbage-collected after the original PyObject reference is decremented.
Now let's take a look at a slightly more useful example to see how Python can be embedded into a real program. If you take a look at Listing 4, you'll see a small program that allows the user to specify short expressions on the command line. The program then calculates the results of those expressions and displays them in the output. To add a little spice to the mix, the program also lets users specify a file of Python code that will be loaded before the expressions are executed. This way, the user can define functions that will be available to the command-line expressions.
Listing 4. A Simple Expression Calculator
#include <python2.3/Python.h> void process_expression(char* filename, int num, char** exp) { FILE* exp_file; // Initialize a global variable for // display of expression results PyRun_SimpleString("x = 0"); // Open and execute the file of // functions to be made available // to user expressions exp_file = fopen(filename, "r"); PyRun_SimpleFile(exp_file, exp); // Iterate through the expressions // and execute them while(num--) { PyRun_SimpleString(*exp++); PyRun_SimpleString("print x"); } } int main(int argc, char** argv) { Py_Initialize(); if(argc != 3) { printf("Usage: %s FILENAME EXPRESSION+\n"); return 1; } process_expression(argv[1], argc - 1, argv + 2); return 0; }
Two basic Python API functions are used in this program, PyRun_SimpleString() and PyRun_AnyFile(). You've seen PyRun_SimpleString() before. All it does is execute the given Python expression in the global environment. PyRun_SimpleFile() is similar to the PyRun_File() function that I discussed earlier, but it runs things in the global environment by default. Because everything is run in the global environment, the results of each executed expression or group of expressions will be available to those that are executed later.”. | https://www.linuxjournal.com/article/8497?page=0,2&quicktabs_1=0 | CC-MAIN-2018-22 | refinedweb | 824 | 51.28 |
Creating an Online Help System with JavaHelp and DocBook
Pages: 1, 2
DocBook XSL StyleSheets are a collection of stylesheets that allow you to transform your XML into PDF, HTML, and more importantly, JavaHelp format. This ability to derive JavaHelp and PDF from the same source is an extra bonus to us! With this approach, there is little added maintenance for delivering help in several formats to your users. This DocBook-xsl package is actually a set of stylesheets, so we also need an XSLT style engine to drive the transformations. We will be using the open source tool Saxon.
To get these tools:
CLASSPATH
For convenience you may set an environment variable, DOCBOOK_XSL_HOME, for DocBook, and you need to put saxon.jar in your CLASSPATH:
DOCBOOK_XSL_HOME
export DOCBOOK_XSL_HOME=/usr/local/DocBook-xsl-1.61.3
export CLASSPATH=$CLASSPATH:/usr/java/jar/saxon.jar
or, on Windows:
SET DOCBOOK_XSL_HOME=C:\local\DocBook-xsl-1.61.3
SET CLASSPATH=%CLASSPATH%;C:\java\jars\saxon.jar
Now that we have installed these libraries, we can use Saxon to generate our JavaHelp files from the DocBook markup (note that these commands should all be on one line):
java com.icl.saxon.StyleSheet example.xml
$DOCBOOK_XSL_HOME/javahelp/javahelp.xsl
java com.icl.saxon.StyleSheet example.xml
%DOCBOOK_XSL_HOME%\javahelp\javahelp.xsl
This will create the following output:
Writing ch01.html for chapter
Writing ch02.html for chapter
Writing ch03.html for chapter
Writing ch04.html for chapter(concepts)
Writing ch05s02.html for section
Writing ch05s03.html for section
Writing ch05s04.html for section
Writing ch05.html for chapter
Writing index.html for book
Writing jhelpset.hs
Writing jhelptoc.xml
Writing jhelpmap.jhm
Writing jhelpidx.xml
It seems a bit too easy, but we are really 90% complete. If we take a moment to think about the amount of time and effort we will save on creating and maintaining all of this HTML, we can see that it is worth the time of installing this toolchain. Examine the new files Saxon has created in a text editor. The files with the html extension are the contents of your help system, formatted in HTML 3.2 format. The reason for this older doctype is that JavaHelp displays these files with a JEditorPane, which can only handle 3.2 format. Swing's support for HTML is still maturing, but for most help systems, HTML 3.2 is adequate.
html
JEditorPane
As for the other files, jhelpmap.jhm is a mapping file between JavaHelp's internal naming system, and the URLs and anchor names of your content. These system names are called "mapIDs". The jhelptoc.xml file describes our table-of-contents tree as it appears in the Contents view of our online help.
jhelpidx.xml is a list of index terms and their corresponding mapIDs. Lastly, jhelpset.hs is our entry point from the JavaHelp framework point of view. This file references our map, TOC, index, and which search engine implementation to use.
mapIDs
Did someone say search? If you look in the current directory, you will see many new files. We need to index our HTML pages for our search engine. From the current directory, execute:
jhindexer.sh .
This creates a new directory called JavaHelpSearch, which contains all of the data files that the default search engine requires.
If you can't wait to see what your help files look like, JavaHelp has another demo called hsviewer.jar. Invoke it from the command line (again, all on one line):
java -jar $JAVAHELP_HOME/demos/bin/hsviewer.jar
-helpset /path/to/current/directory/jhelpset.hs
java -jar %JAVAHELP_HOME%\demos\bin\hsviewer.jar
-helpset C:\path\doc\test\jhelpset.hs
This brings up your help set in the JavaHelp viewer, as seen in Figure 2.
Figure 2. Screenshot of example help set FooMatic 5000
Easy huh? Let's wire up JavaHelp to our application. In the next section, we will add a new ActionListener that shows our help set when the user clicks on a menu item.
ActionListener
In terms of integrating up our online help, the most important file that has been created is jhelpset.hs. If you open this file in a text editor, you will see that it is an XML file that tells JavaHelp where to find various pieces of our help set, including jhelpmap.jhm. This map file contains mapID elements and locations, which are your various HTML documents.
mapID
The JavaHelp API has three main classes that you will be using to leverage the framework: javax.help.HelpSet, javax.help.HelpBroker, and javax.help.CSH.DisplayHelpFromSource. The HelpSet represents our content and metadata that we generated from our DocBook. A HelpBroker is responsible for determining what to show, based on a HelpSet and a given mapID (which is basically an atomic piece of help). CSH.DisplayHelpFromSource is a convenience class that implements the java.awt.event.ActionEventListener interface and sets the system into motion upon callback.
javax.help.HelpSet
javax.help.HelpBroker
javax.help.CSH.DisplayHelpFromSource
HelpSet
HelpBroker
CSH.DisplayHelpFromSource
java.awt.event.ActionEventListener
//import help classes
import javax.help.*;
import javax.swing.*;
import java.net.URL;
String hsName = "myHelpSet.hs";
//Somewhere in your class
try {
ClassLoader cl =
OurClass.class.getClassLoader();
URL hsURL = HelpSet.findHelpSet(cl,
hsName);
hs = new HelpSet(null, hsURL);
} catch (Exception ee) {
System.out.println ("HelpSet "+
hsName + " not found");
return;
}
hb = hs.createHelpBroker();
JMenu help = new JMenu("Help");
menuBar.add(help);
menu_help = new JMenuItem("Contents");
menu_help.addActionListener(
new CSH.DisplayHelpFromSource(hb) );
In this example, JavaHelp searches the classpath for a HelpSet called myHelpSet.hs. If it is found, a HelpBroker is created. From that, we can create the CSH.DisplayHelpFromSource, which is an ActionListener that can be added to a JMenuItem, in this case the "Contents" menu item in the "Help" menu.
myHelpSet.hs
JMenuItem
All of the files relating to your new help system should be distributed with your application.
If you .jar them up with your other resources, then a ClassLoader will be able to find and display the help set's pages, images, and data. JavaHelp is an add-on that your users may not have installed, so you will probably want to ship jh.jar and jsearch.jar with your application.
ClassLoader
For further examples, open up the Java source files that ship with JavaHelp under the demos/src directory.
We have learned the basic techniques and API involved with integrating a JavaHelp system into your Java application. This is a brief tutorial, but JavaHelp, Saxon, and DocBook-xsl all have documentation under their respective directories. If DocBook has piqued your curiosity, Norman Walsh's DocBook: The Definitive Guide is an excellent reference. I encourage you to experiment with more DocBook tags, or customize the JavaHelp XSL stylesheets to your liking.
Austin King
is a developer living and working in Seattle Washington, working with web applications, Open Source, and documentation. | http://www.onjava.com/pub/a/onjava/2003/10/15/javahelp_docbook.html?page=last&x-showcontent=text | CC-MAIN-2016-36 | refinedweb | 1,143 | 59.8 |
Walkthrough: Creating a RIA Services Solution
[WCF RIA Services Version 1 Service Pack 2 is compatible with either .NET framework 4 or .NET Framework 4.5, and with either Silverlight 4 or Silverlight 5.]
In this walkthrough, you create a WCF RIA Services application that retrieves data from the AdventureWorksLT database and then makes it available to a Silverlight client where it is presented. You access the data from the data source by creating entity classes that represent various database tables on the server in the middle tier and then you present it by creating a domain service that makes these middle tier entities accessible to the Silverlight client. This walkthrough serves as the starting point for many of the other walkthroughs in the RIA Services documentation.
This and the other walkthroughs presented in the set up a RIA Services solution
Create a new RIA Services project in Visual Studio 2010 by selecting File, New, and then Project.
The New Project dialog box appears.
Select the Silverlight Application template from Silverlight group of the Installed Templates and name the new project RIAServicesExample.
Click OK.
The New Silverlight Application dialog box appears.
Select the Enable WCF RIA Services check box near the bottom of the dialog box. Checking this box creates a RIA Services link between the client project and the server project.
Click OK to create the solution.
The solution contains two projects: a client project and a server project. The client project is named RIAServicesExample and it contains the Silverlight code that you use to create the presentation tier. The server project is named RIAServicesExample.Web and it contains the middle-tier code.
In this section, you will create the ADO.NET Entity classes that represent data from the AdventureWorksLT database. RIA Services works with a variety of data modeling classes and data sources. For more information on the options for accessing data with RIA Services, see the Data topic.
To make data available in the middle tier
In Solution Explorer, right-click the server project, RIAServicesExample.Web, select Add, and then select New Item.
The Add New Item dialog box appears.
In the list of categories, select Data and then select the ADO.NET Entity Data Model template.
Name the new file AdventureWorksModel.edmx and click Add.
The Entity Data Model Wizard appears.
In the Choose Model Contents screen, select Generate from database option and click Next.
In the Choose Your Data Connection screen, create a data connection to the database and click Next.
In the Choose Your Database Objects screen, select the Address, Customer, and CustomerAddress tables.
Confirm that the Include foreign key columns in the model check box is checked by default and click Finish.
Entity models are created for the tables.
Build (with the key combination Ctrl+Shift+B) the solution.
In this section, you will add a domain service to the middle-tier project. A domain service exposes the data entities and operations in the server project to the client project. You can add business logic to the domain service to manage how the client interacts with the data.
To create the domain service
Right-click the server project, select Add and New Item.
In the list of categories, select Web and then select the Domain Service Class template.
Name the class CustomerDomainService.cs (or CustomerDomainService.vb).
Click Add.
The Add New Domain Service Class dialog box appears.
Make sure that the Enable client access box is checked.
Select the Customer entity and then check the Enable Editing box for it.
Click OK.
The CustomerDomainService class is generated in a new CustomerDomainService.cs (or CustomerDomainService.vb) file.
Open this file. Notice that the file has the following characteristics:
The CustomerDomainService class derives from LinqToEntitiesDomainService<TContext> class, which is an abstract base class in the RIA Services framework. This base class was used automatically because the domain service exposes an ADO.NET Entity data class.
The generic base class is bound to the entity class that was created in previous steps by the AdventureWorksLTEntities of type ObjectContext in its generic parameter.
The CustomerDomainService class is marked with the EnableClientAccessAttribute attribute to indicate that it is visible to the client tier.
A query method named GetCustomers is generated. This method returns every item without any filtering or sorting.
Methods to insert, update, and delete customers from the records have been generated.
In other walkthroughs, you will be shown how to add business logic to the domain service. For this walkthrough, you will simply use the GetCustomers method generated by default.
Client proxy classes are generated when you built the solution. The RIA Services link that was established between the client project and the server project make this code generation possible. These client proxy classes provide access to the data from the client.
To see the generated client proxy classes
Build the solution.
When you build the solution, code is generated in the client project.
In Solution Explorer, select the RIAServicesExample client project and click the Show All Files icon at the top of the window.
Notice the Generated_Code folder contains a RIAServicesExample.Web.g.cs (or RIAServicesExample.Web.g.vb) file.
Open the code file in the Generated_Code folder.
Notice that the file has the following characteristics:
A WebContext class that derives from the WebContextBase class is generated.
A CustomerDomainContext class that derives from the DomainContext class is generated. This class has a method named GetCustomersQuery that corresponds to the query method created in the domain service.
A Customer class that derives from the Entity class is generated for the entity exposed by the domain service. The Customer entity class in the client project matches the Customer entity on the server.
To display the data in the Silverlight client
Open MainPage.xaml.
From the Toolbox on the left, drag a DataGrid control to within the Grid element in XAML view.
Dragging the DataGrid control from the Toolbox causes a namespace using System.Windows.Controls statement and a reference to a System.Windows.Controls.Data assembly to be added automatically.
Change the value of the AutoGeneratedColums to True, name the DataGrid element CustomerGrid, and adjust the height and width attributes as shown in the following XAML.
<UserControl xmlns: <Grid x: <my:DataGrid</my:DataGrid> </Grid> </UserControl>
Open the code-behind for MainPage.xaml.
Add using (C#) or Imports (Visual Basic) two statements: using RIAServicesExample.Web; and the using System.ServiceModel.DomainServices.Client;.
The RIAServicesExample.Web namespace is the namespace containing the generated code for the client project in the RIAServicesExample.Web.g.cs (or RIAServicesExample.Web.g.vb).
To instantiate the CustomerDomainContext, add the line of code private CustomerDomainContext _customerContext = new CustomerDomainContext(); in the MainPage class.;; } } }
Retrieve customer entities by calling the GetCustomersQuery method with LoadOperation<TEntity>: LoadOperation<Customer> loadOp = this._customerContext.Load(this._customerContext.GetCustomersQuery());.
Bind the entities loaded to the DataGrid with CustomerGrid.ItemsSource = loadOp.Entities;.
To summarize, the MainPage.xaml.cs file should now contain the following code:
//Namespaces added using RIAServicesExample.Web; using System.ServiceModel.DomainServices.Client;; } } }
Run (F5) the application.
You should see a data grid that is similar to the following.
This walkthrough has shown only the basic steps to create a project and retrieve unfiltered data from a domain service. Here are some suggestions for learning about additional capabilities:
Create customized query methods, such as queries that accept a parameter, which are typically used for filtering data. For more information, see Walkthrough: Adding Query Methods.
Add business logic to a domain service that contains update, insert, and delete methods and that manages the process for modifying the data. For more information, see How to: Add Business Logic to the Domain Service. | https://msdn.microsoft.com/en-us/library/ee707376(v=vs.91).aspx | CC-MAIN-2015-40 | refinedweb | 1,271 | 50.33 |
csPoly2DPool Class Reference
[Geometry utilities]
This is an object pool which holds objects of type csPoly2D. More...
#include <csgeom/polypool.h>
Detailed Description
This is an object pool which holds objects of type csPoly2D.
You can ask new instances from this pool. If needed it will allocate one for you but ideally it can give you one which was allocated earlier.
Definition at line 39 of file polypool.h.
Constructor & Destructor Documentation
Create an empty pool.
Definition at line 57 of file polypool.h.
Destroy pool and all objects in the pool.
Definition at line 61 of file polypool.h.
Member Function Documentation
Allocate a new object in the pool.
Definition at line 83 of file polypool.h.
Free an object and put it back in the pool.
Note that it is only legal to free objects which were allocated from the pool.
Definition at line 106 of file polypool.h.
The documentation for this class was generated from the following file:
- csgeom/polypool.h
Generated for Crystal Space 2.0 by doxygen 1.6.1 | http://www.crystalspace3d.org/docs/online/new0/classcsPoly2DPool.html | CC-MAIN-2015-18 | refinedweb | 176 | 61.73 |
Procedural Terrain With Java – part 2
So last time we got our Java application up and running with a scene displayed using the JMonkeyEngine (JME) game engine. This time, we’re going to extend that to generate some procedural terrain.
We are going to start with a
HeightProvider class that is used to provide us with heights of the terrain at a given point. Now, bear in mind we are aiming to ultimately have an infinite terrain to fly over, so we want our
HeightProvider to account for that.
In is simplest form, the
HeightProvider is an interface that has one method.
public interface HeightProvider { public float getHeight(float x, float y); }
A quick note here, I am using floats as that is the preferred type for JME, most likely since that is the preferred type of OpenGL.
So for this code, I’m going to create some little util methods on the interface so we can chain the implementations and create some useful features.
public interface HeightProvider { /** * Return the height of the map at a given x,y point. */ public float getHeight(float x, float y); /** * Scale out the x,y co-ords, i.e. spread the map out further */ public default HeightProvider scale(float scale) { return (x, y) -> this.getHeight(x * scale, y * scale); } /** * Multiply the height so we get taller points */ public default HeightProvider mul(float mul) { return (x, y) -> this.getHeight(x, y) * mul; } /** * Create a height provider based on the JME noise functions. */ public static HeightProvider noise() { return (x, y) -> ImprovedNoise.noise(x, y, 87); } }
This gives us a
HeightProvider instance on which we can call the
getHeight() method repeatedly and we should get the same value back. This is essential. We aren’t just returning random numbers, we are generating some pseudo random numbers, usually based on noise.
JME comes with some classes to help with specifying terrain using height map and terrain classes. You can see more about them here. We will use the
TerrainQuad class for now to help us get up and running.
We’re going to add one more method to our
HeightProvider to get it to produce an array of float heights for our map. This will allow us to use our
HeightProvider to generate he values for the
TerrainQuad.
public interface HeightProvider { ... public default float[] toFloats(float x, float y, int size) { final float[] heightData = new float[size * size]; for (int ix = 0; ix < size; ix++) { for (int iy = 0; iy < size; iy++) { heightData[(ix * size) + iy] = getHeight(x + ix, y + iy); } } return heightData; } ... }
We are assuming a square terrain tile is being used. The x and y coordinates that we pass in indicate the start point of the tile. Remember, this terrain could go on for miles. We plug this coordinate into the height provider to give us a height for that point which we store in the array.
Now we have our height provider in place, lets add some code to our main class to use it!
From our first example, we will keep our code to move the camera, add the light, and create the material. We will change the code to create the geometry and we may tweak the position of the camera a bit:
private static final int MAP_SIZE = 513; private static final int TILE_SIZE = 65; @Override public void simpleInitApp() { // set how fast WASD keys move us over the landscape. flyCam.setMoveSpeed(10); // move up, to the side and look at the origin getCamera().setLocation(new Vector3f(0, 12, 30));); final Material mat = new Material(assetManager, "Common/MatDefs/Light/Lighting.j3md"); }
So far so good, not too much different from before. Since we might have some hills, the camera has been moved up a bit, and pushed back through the screen so when we look at the origin we aren’t looking straight down. We also set the fly cam speed so we can move through our scene at a fairly fast pace.
Now to add the geometry. We want to create a new
TerrainQuad and assign it the float values from our height provider. For now we will keep it simple and not worry about tiling and LOD. I’ve added a couple of constants at the top to indicate the tile size and heightmap size we are using. These must be (2^n)+1 values (9,17,33,65,129,257,513) with the tile size usually being less. Again, JME docs on the
TerrainQuad can tell you all about that. On to the code!
final HeightProvider provider = HeightProvider.noise(); final float[] data = provider.toFloats(0, 0, MAP_SIZE); final TerrainQuad q = new TerrainQuad("terrain", TILE_SIZE, MAP_SIZE, data);
If you run this now, you are probably going to be pretty disappointed. No rolling hills and sweeping valleys, it just looks like the plains of Hoth:
So whats going on here, then. Well, 2 things are wrong with this. Our height provider is asked for values on integer steps, coordinates are requested of the form (0,0), (0,1), (0,2)….(1,0), (1,1), (1,2).
For this implementation, and I believe every Perlin Noise implementation, at the integer boundaries, the value is always zero. The other problem is that noise returns small values between -1 and 1 which is a really small height in our landscape.
However, those nice helper functions can fix this for us. We want to take our provider, then scale down the co-ordinates so rather than range from 0-513, they range from 0 a smaller number with interpolations in between. Change the provider constructor to the following:
final HeightProvider provider = HeightProvider.noise().scale(0.2f).mul(10);
This creates our noise provider, and then the scale method creates a new one based on that, which scales the values going into it, so if we called this provider with (47,24), those values would get scaled down to (2.35, 1.2) and those values would be passed into the noise function. Since they are not on integer boundaries, the noise function will return a non-zero value. Hurrah! However, this is still a really small value, and while you will see some hills, they will be very small. So, we want to multiply the returned height to create bigger peaks which we can do with the
mul method. That returns a provider that takes the value from the previous one and multiplies the value by 10. What do you get now?
I’ll wait here while you fly around for half an hour…..
You can play around with the
scale and
mul parameters, keeping them in the same proportion generates a similar landscape, it will just be scaled up or down proportionally. If you decrease just the scale it stretches the map out and the hills look shorter. Increase the
mul parameter and the hills will grow taller and shorter.
Also, as you ramp the values up and down, you find you go through your landscape faster or slower. You can change the flyCam speed to fix that.
Note that you only have 513 X 513 quads in this scene, so you can’t stretch the map out forever as the number of quads in the geometry will decrease and your hills will just end up a sharp triangle. You can always increase the MAP_SIZE, just remember to keep it as multiples of (2^n)+1.
In part 3, we will look at producing a better landscape using more complex height provider implementation and layered noise. | http://www.andygibson.net/blog/programming/procedural-terrain-with-java-part-2/ | CC-MAIN-2021-49 | refinedweb | 1,251 | 71.24 |
@dojo/loader@dojo/loader
This package provides a JavaScript AMD loader useful in applications running in either a web browser, node.js or nashorn.
@dojo/loader does not have any dependencies on a JavaScript framework.
NoteNote
We strongly recommend using the
@dojo/cli build tools for a Dojo 2 application over a runtime loader such as
@dojo/loader.
UsageUsage
To use
@dojo/loader, install the package:
npm install @dojo/loader
SupportSupport
FeaturesFeatures
Use a script tag to import the loader. This will make
require and
define available in the global namespace.
The loader can load both AMD and CJS formatted modules.
There is no need to use the Dojo 1.x method of requiring node modules via
dojo/node! plugin anymore.
How do I contribute?How do I contribute?
We appreciate your interest! Please see the Guidelines.
Licensing informationLicensing information
© 2004–2018 JS Foundation & contributors. New BSD license. | https://www.npmjs.com/package/@dojo/loader | CC-MAIN-2022-05 | refinedweb | 149 | 53.78 |
A pickleable wrapper for sharing NumPy ndarrays between processes using POSIX shared memory.
Project description
A pickleable wrapper for sharing NumPy ndarrays between processes using POSIX shared memory.
SharedNDArrays are designed to be sent over multiprocessing.Pipe and Queue without serializing or transmitting the underlying ndarray or buffer. While the associated file descriptor is closed when the SharedNDArray is garbage collected, the underlying buffer is not released when the process ends: you must manually call the unlink() method from the last process to use it.
Usage
from __future__ import print_function import multiprocessing as mp import numpy as np from shared_ndarray import SharedNDArray try: shm = SharedNDArray((4, 4)) shm.array[0, 0] = 1 p = mp.Process(target=lambda shm: print(shm.array), args=(shm,)) p.start() p.join() finally: shm.unlink()
This should print:
[[ 1. 0. 0. 0.] [ 0. 0. 0. 0.] [ 0. 0. 0. 0.] [ 0. 0. 0. 0.]]
There are also convenience methods to create a new SharedNDArray from an existing NumPy array:
arr = np.array([0, 0]) shm1 = SharedNDArray.copy(arr) shm2 = SharedNDArray.zeros_like(arr) shm1.unlink() shm2.unlink()
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages. | https://pypi.org/project/shared-ndarray/ | CC-MAIN-2020-50 | refinedweb | 210 | 51.04 |
Smart Contract Staking with FLOW
How to use FLOW for staking and delegation
Staking
This section describes the functionality of the core identity table and staking smart contract. It also gives instructions for how users with unlocked Flow tokens can interact with it to register as a node operator or delegator.
The transactions described in this document are contained in the
flow-core-contracts/transactions/idTableStaking/
directory. You can see the text of all the transactions used to interact with the smart contract there.
Terminology
If any of the definitions are confusing, you can find more detail in the contract docs below the terminology section.
Staker: Any user who has staked tokens for the Flow network. A node operator is a staker, and a delegator is a staker as well.
Node Operator: A user who operates a node for the Flow network. Each node operator has a unique
NodeStaker
object they store in their account to perform staking operations.
Delegator: A user who delegates tokens to a node operator and receives rewards for their staked tokens, minus a fee
taken by the node operator. Each delegator stores a unique
NodeDelegator object in their account
that allows them to perform staking operations.
Identity Table: The record of all the stakers in the network. The identity table keeps separate lists for the info about node operators and delegators, which track the following info:
Node Operators:
- Node ID: 32 byte identifier for the node. Usually a hash of the node public key.
- Role: Indicates what role the node operator is. (Collection, Consensus, Execution, Verification, Access)
- Networking Address: The address that the node operator uses for networking.
- Networking Key: The node operator public key for networking.
- Staking Key: The public key for the account that manages staking.
Delegators:
- id: The ID associated with a delegator. These IDs are assigned to delegators automatically by the staking contract and are only unique within an individual node operators' record.
- nodeID: The ID of the node operator a user delegates to.
Both:
-.
Epoch: The period of time between reward payments and changes in the identity table. (Initially a week).
Delegation Rewards Cut: The percentage of a delegator's rewards that the node operators take. Initially set to 10%.
Epoch Payout: The total amount of tokens paid in rewards at the end of an epoch. This value will change as the supply of FLOW changes..
- Collector Nodes: 250,000 FLOW
- Consensus Nodes: 500,000 FLOW
- Execution Nodes: 1,250,000 FLOW
- Verification Nodes: 135,000 FLOW
Smart Contract Summary
The Flow staking smart contract manages a record of stakers who have staked tokens for the network. Users who want to stake can register with the staking contract at any time, and their tokens will be locked for staking until they request to unstake them.
Before getting into the details of the contract, we need to discuss how time in Flow is organized. The operation of the Flow network is divided into epochs, which are week-long periods where various network maintenance operatios are performed. The schedule of each epoch is exactly the same, though individual actions that users take in relation to the network will be different.
Epoch Schedule:
- Start of Epoch: Generic metadata about the current epoch is updated and shared.
- Staking Auction: Stakers can perform any action they want to manage their stake, like initially registering, staking new tokens, unstaking tokens, or withdrawing rewards. This phase takes up the vast majority of time in the epoch.
- Remove Insufficiently Staked Nodes: All node operators who don't meet the minimum will be removed.
- Rewards Payout: Pay rewards to all the node operators staked in the current epoch.
- Move tokens between pools. (See the token pools section for the order of movements)
The
FlowIDTableStaking contract manages the identity table, and all of these phases.
Initially, control of these phases will be managed manually by the Flow Token Admin,
but control will eventually be completed decentralized and managed by the smart contracts
and democratically by all the stakers in the network.
Staking as a node operator
To stake for a node, you first need to generate your staking key, networking address, and networking key. Please consult the guide to read about how to do that.
To generate your node ID, simply hash your staking Key and submit that as the ID.
You then need to determine the role of node you'll be running (Collector, Consensus, Execution, Verification, or Access).
Once you have determined all of this information:
- Node role (Collector, Consensus, Execution, Verification, or Access)
- Node ID
- Networking Address
- Networking Key
- Staking Key
You are ready to submit a staking request.
To create and submit a regular staking request, the node operator calls the
addNodeInfo function,
providing all the node info, and the tokens that they want to stake.
This will register your node in the Flow node identity table and commit your tokens to stake during the next epoch. This also stores a special node operator object in your account that is used for staking, unstaking, and withdrawing rewards.
Once you have registered and have the special node object, you will be able to perform any of the valid staking options with it, assuming that you have the required amount of tokens for each operation.
If a node operator has delegators, they cannot withdraw their own tokens such that their own staked tokens would fall below the minimum requirement for that node type. This is enforced at the protocol level. If they have delegators and try to submit an unstaking transaction that would put their stake below the minimum, it will fail.
If they want to unstake below the minimum, they must unstake all of their tokens, which also unstakes all of the tokens that have been delegated to them.
Staking as a Delegator
Every staked node in the Flow network is eligible for delegation by any other user. The user only needs to know the node ID of the node they want to delegate to.
To register as a delegator, the delegator should submit the
idTableStaking/del_register_delegator
transaction, providing the id of the node operator they want to delegate to.
This transactions calls the
registerNewDelegator function and stores the
NodeDelegator object
in the user's account, which is what they use to perform staking operations.
Users should be able to get these IDs off-chain, directly from the node operators. Flow is also planning on listing node IDs in a public place.
The fee that node operators take from the rewards their delegators receive is 10%. A node operator cannot be delegated to unless the total tokens they have committed to stake are above the minimum requirement for their node types.
The delegation logic keeps track of the amount of tokens each delegator has delegated for the node operator. When rewards are paid, the node operator takes the 10% cut of the delegator's rewards and the delegators rewards are deposited in the delegator's reward pool.
Staking Operations available to All Stakers
Regardless of whether they are a node operator or delegator, a staker has access to all the same staking operations.
A staker can commit more tokens to stake for the next epoch at any time, and there are three different ways to do it.
- They can commit new tokens to stake by submitting the
stake_new_tokens.cdctransaction, which withdraws tokens from their account's flow token vault and commits them.
- They can commit tokens that are in their unstaked token pool, which holds the tokens that they have unstaked. Submit the
stake_unstaked_tokens.cdctransaction to move the tokens from the unstaked pool to the committed pool.
- They can commit tokens that are in their rewarded token pool, which holds the tokens you have been awarded. They submit the
stake_rewarded_tokens.cdctransaction to move the tokens from the rewards pool to the committed pool.
At anytime, a staker can also submit a request unstaking transaction which will move their tokens to the unstaking pool at the end of the current epoch. They will sit in this pool for one (1) additional epoch, at which point they will be moved to the unlocked tokens pool, where they are able to be freely withdrawn.
A staker can also withdraw their rewarded tokens at any time. These tokens are liquid and can be transferred on-chain if desired, or re-staked.
When a new epoch starts, if a staker has committed at least the minimum stake required, the tokens they have committed will be marked as staked and held in the protocol state. If a staker does not meet the minimum requirement, their committed tokens are moved to their unstaked pool, which they can withdraw from at any time.
Staking rewards are paid at the end of every epoch based on how many tokens
are in a users
tokensStaked pool. Every staker's rewards
are deposited to their rewarded tokens pool. They can be withdrawn
at any time by submitting the
withdraw_reward_tokens.cdc transaction.
This diagram shows a flow of actions for new node operators.
This diagram shows a flow of actions for a new delegator.
Token Pools
Each node operator has five token pools allocated to them:
- Committed Tokens: Tokens that are committed for the next epoch. They are automatically moved to the staked pool when the next epoch starts.
- Staked Tokens: Tokens that are staked by the node operator for the current epoch. They are only moved at the end of an epoch and if the staker has submitted an unstaking request.
- Unstaking Tokens: Tokens that have been unstaked, but are not free to withdraw until the following epoch.
- Unstaked Tokens: Tokens that are freely available to withdraw or re-stake. Unstaked tokens go to this pool.
- Rewarded Tokens: Tokens that are freely available to withdraw or re-stake. Rewards are paid and deposited to the rewarded Pool after each epoch.
At the end of every epoch, tokens are moved between pools in this order:
- All Committed Tokens will get moved either to the Staked Tokens pool, or to the Unstaked Tokens pool (depending on if the staked request has met the minimum stake requirements).
- All Committed Tokens get moved to staked Tokens pool.
- All unstaking tokens get moved to the unstaked tokens pool.
- All requested unstaking tokens get moved from the staked pool to the unstaking pool.
Rewards
Schedule
All rewards are automatically distributed via the staking smart contract to the reward pools associated with each node. Rewards are paid out according to the following schedule:
- Initial startup phase: no rewards
- Bootstrapping phase: rewards of 20% annualized
- After bootstrapping: rewards of 3.75% annually
Reward Payouts
Rewards are paid out at the end of each epoch (roughly a week) to the users that have tokens staked.
The paid rewards are proportional to the stake each node operator contributes to its node group. Node groups are assigned rewards based on their revenue ratio which is a coefficient assigned to them based on the security they contribute to the network. Please connect with the Flow team directly if you'd like to understand how these coefficients are derived.
A public paper will be shared in the future.
The reward payout on a per node basis is equal to:
Reward(n_node) = ((Tr) * (Tn)) * ((Sn) / (St))
where:
- Tr = Sum of all the rewards paid to all nodes per epoch.
- Tn = The node role's portion of total stake.
- Sn = Amount of FLOW Staked by the node for the current Epoch.
- St = Amount of FLOW staked by all the nodes of the selected node's type.
The rewards paid for the bootstrapping phase will be roughly 1.25 million FLOW per epoch (per week). This will sharply decrease in the months following the release.
Each node role's portion of total stake has been determined based on the amount of security they contribute to the network:
- Execution Nodes comprise 7.8% of total stake (TE= 0.078)
- Collection Nodes comprise 16.8% of total stake (TL= 0.168)
- Consensus Nodes comprise 51.8% of total stake (TS=0.518)
- Verification Nodes comprise 23.6% of total stake (TV=0.236)
At network launch, there will be no more than:
- 3 Execution Nodes
- 43 Consensus Nodes
- 29 Collection Nodes
- 73 Verification Nodes (100 when performance permits)
These numbers were chosen to ensure consistent returns for running a single node of any type. Over time, the number of nodes will increase to promote participation but we don't anticipate increasing the number of participating nodes by more than double in the first year of the network's operation.
Slashing
So, who gets slashed? Severe slashing on Flow only takes place in the most nefarious of attacks. The protocol reserves slashing for maintaining the security of the protocol rather than its liveness. You can find more details on the conditions under which a node is slashed in a different part of the docs.
While a node is in operation and during the unstaking period thereafter, the staked tokens are held by the staking smart contract..
Slashing is not handled by the staking contract at this point. It will be handled on a case by case basis. Once full epoch functionality is enabled, slashing will be handled by the protocol.
Getting Info from the Staking Contract
There are various ways to retreive information about the current state of the staking contract.
- Getting the list of proposed nodes for the next epoch:
FlowIDTableStaking.getProposedNodeIDs(): Returns an array of node IDs for proposed nodes.
Proposed nodes are nodes that have enough staked and committed for the next epoch to be above the minimum requirement.
You can see an example script for retreiving this info in
get_proposed_table.cdc.
- Get the list of all nodes that are currently staked:
FlowIDTableStaking.getStakedNodeIDs(): Returns an array of nodeIDs that are currently staked.
Staked nodes are nodes that currently have staked tokens above the minimum.
You can see an example script for retreiving this info in
get_current_table.cdc.
- Get the total committed balance of a node:
FlowIDTableStaking.getTotalCommittedBalance(_ nodeID: String): Returns the total committed balance for a node,
which is their total tokens staked + committed, plus all of the staked + committed tokens of all their delegators.
You can see an example script for retreiving this info in
[get_node_total_commitment.cdc]()
- Get all of the info associated with a single node staker:
FlowIDTableStaking.NodeInfo(nodeID: String): Returns a
NodeInfo struct with all of the metadata
associated with the specified node ID. You can see the
NodeInfo definition in the FlowIDTableStaking
smart contract.
You can see an example script for retreiving this info in
[get_node_info.cdc]()
- Get all the info associated with a single delegator:
FlowIDTableStaking.DelegatorInfo(nodeID: String, delegatorID: UInt32): Returns a
DelegatorInfo struct with all of the metadata
associated with the specified node ID and delegator ID. You can see the
NodeInfo definition in the FlowIDTableStaking
smart contract.
You can see an example script for retreiving this info in
[get_delegator_info.cdc]()
Staking Events
The staking contract emits various events whenever an important action occurs.
pub event NewNodeCreated(nodeID: String, role: UInt8, amountCommitted: UFix64) pub event TokensCommitted(nodeID: String, amount: UFix64) pub event TokensStaked(nodeID: String, amount: UFix64) pub event TokensUnstaking(nodeID: String, amount: UFix64) pub event NodeRemovedAndRefunded(nodeID: String, amount: UFix64) pub event RewardsPaid(nodeID: String, amount: UFix64) pub event UnstakedTokensWithdrawn(nodeID: String, amount: UFix64) pub event RewardTokensWithdrawn(nodeID: String, amount: UFix64) pub event NewDelegatorCutPercentage(newCutPercentage: UFix64) pub event NewDelegatorCreated(nodeID: String, delegatorID: UInt32) pub event DelegatorRewardsPaid(nodeID: String, delegatorID: UInt32, amount: UFix64) pub event DelegatorUnstakedTokensWithdrawn(nodeID: String, delegatorID: UInt32, amount: UFix64) pub event DelegatorRewardTokensWithdrawn(nodeID: String, delegatorID: UInt32, amount: UFix64)
Staking Transaction Examples
Create Staking Request
import FlowIDTableStaking from 0xIDENTITYTABLEADDRESS import FlowToken from 0xFLOWTOKENADDRESS // This transaction creates a new node struct object // and updates the proposed Identity Table transaction(id: String, role: UInt8, networkingAddress: String, networkingKey: String, stakingKey: String, amount: UFix64, cutPercentage: UFix64) { let flowTokenRef: &FlowToken.Vault prepare(acct: AuthAccount) { self.flowTokenRef = acct.borrow<&FlowToken.Vault>(from: /storage/flowTokenVault) ?? panic("Could not borrow reference to FLOW Vault") let nodeStaker <- FlowIDTableStaking.addNodeRecord(id: id, role: role, networkingAddress: networkingAddress, networkingKey: networkingKey, stakingKey: stakingKey, tokensCommitted: <-self.flowTokenRef.withdraw(amount: amount), cutPercentage: cutPercentage) if acct.borrow<&FlowIDTableStaking.NodeStaker>(from: FlowIDTableStaking.NodeStakerStoragePath) == nil { acct.save(<-nodeStaker, to: FlowIDTableStaking.NodeStakerStoragePath) } else { destroy nodeStaker } } }
Stake New Tokens.stakerRef.stakeNewTokens(<-self.flowTokenRef.withdraw(amount: amount)) } }
Request Stake Unstaking
import FlowIDTableStaking from 0xIDENTITYTABLEADDRESS transaction(amount: UFix64) { // Local variable for a reference to the Node object let stakerRef: &FlowIDTableStaking.NodeStaker prepare(acct: AuthAccount) { // borrow a reference to the node object self.stakerRef = acct.borrow<&FlowIDTableStaking.NodeStaker>(from: /storage/flowStaker) ?? panic("Could not borrow reference to node object") } execute { self.stakerRef.requestUnStaking(amount: amount) } }
Withdraw Rewards.flowTokenRef.deposit(from: <-self.stakerRef.withdrawRewardedTokens(amount: amount)) } }
The source code for the staking contract and more transactions can be found in the Flow Core Contracts Github Repository. | https://docs.onflow.org/token/staking/ | CC-MAIN-2020-45 | refinedweb | 2,800 | 54.83 |
0
I have set the textbox to public so that another form can access it but when i run it in debug mode with the following line it gives me exception so it doesn't store correct directory.
For example:
If I enter D:\newfolder it gives me D:\\newfolder. Why does it add the extra \.
Here's the exception:
An exception 'Microsoft.VisualStudio.Debugger.Runtime.CrossThreadMessagingException' occurred
Here's the line where the exception occurs.
Choose is a class in the same namespace as the method which contains this string.
The method is in a different class than the choose class.
txtbxTargetDir is the name of the textbox.
string targetPath = StaticFormInstances.choose.txtbxTargetDir.Text;
Edited by lotrsimp12345: n/a | https://www.daniweb.com/programming/software-development/threads/298054/why-can-t-i-correctly-access-text-in-textbox-in-another-form | CC-MAIN-2017-26 | refinedweb | 120 | 60.61 |
The short tale of an online scam
I'm moving places soon. I absolutely hate moving - but hey, it's like everything else in life: you push through. This time, there was a nice plot twist: someone tried to scam me online. This made things... interesting. Let's talk about it.
When it sounds too good to be true it's because...
As usual, like everyone in Denmark, I put up my old bed for sale in DBA.dk. It's the Danish version of Craigslist, I don't use it that much but has served useful in the past. After posting it, two days went by and nobody replied. But then I received an interesting WhatsApp message:
Check this link for screenshots of the whole conversation.
For those not fluent in Danish, "Dimitriy" (the name on his WhatsApp account) is telling me that he'll purchase the bed I'm selling. He also suggests that we should use a very convenient service by PostNord (the danish post company). This service supposedly arrives at my place, packages everything up, and brings it to him. Sounds super convenient. Right?
He has set everything up via PostNord so that I only have to confirm receiving the money by going to the link. He even sent me a link to where I can confirm everything. Now, my Danish is certainly lacking (e.g., non-existent) - but when someone sends me a link like:
My radar starts beeping - and yours should too. The page looks pretty nice - and perfectly emulates PostNord's website. It has my name and everything - looks pretty legit:
After clicking the big yellow button to "confirm the transaction", I'm brought (surprising!) to a page to input my credit card details. I decided to start filling all of the credit card forms while monitoring the
POST requests the website might be sending.
- First I'm asked to input a credit card number and last name
- It then asks for an expiration date and a CVC number
- Once that is done, it prompts the user to input his/her NemID username and password (e.g., the login solution used for most state services in Denmark - e.g., banks, digital post)
- And finally - it asks for a confirmation of my bank account's balance - just to ensure they retrieve the right amount.
If I had put all of this information correctly, Dimitriy would pretty much own me at this point.
You can check all of the web pages I went through in this repo.
Sending some surprises
I'm pretty well versioned in Python - I know it can serve me well when trying to get back at Dimitriy. While going through the forms in his scam website, I noticed a
POST request firing from my browser with the following information:
POST / HTTP/1.1 Host: postnord-dk.delivery-85367.icu User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:89.0) Gecko/20100101 Firefox/89.0 Accept: text/html,application/xhtml+xml,application/xml;q=0.9,image/webp,*/*;q=0.8 Accept-Language: en Accept-Encoding: gzip, deflate, br Content-Type: application/x-www-form-urlencoded Content-Length: 81 Origin: DNT: 1 Connection: keep-alive Referer: Cookie: ssupp.vid=viKziAQroXxx; ssupp.visits=1 Upgrade-Insecure-Requests: 1 Sec-GPC: 1 Body:card_number=5156+1542+2403+1977&page=nemidnotif&nemlogin=9999999&nempassword=1876
The last line of the snippet shows all the information Dimitriy would get straight from my browser. (e.g.,
card_number,
nemlogin,
nempassword)
In an attempt to add some confusion to his operation, I decided to create a little script. This little script would send him about 5000 different combinations of the above parameters in a completely random fashion. Fun.
My hope is that Dimitriy is storing the information about all his victims in the same database (or even spreadsheet). By sending him 5000 fake combinations of victim details, he'll have a hard time finding the actual victims. Yes, this could be a long shot - Dimitriy could have a more sophisticated setup, and I suspect he does.
But for the kicks, let's just use some python to piss him off:
import asyncio import concurrent.futures import requests import random # create some fake data URL = "" totals = 5000 card_numbers = [str(random.randint(5156000000000000, 9999999999999999)) for i in range(totals)] card_number_list = [f"{x[0:4]}+{x[4:8]}+{x[8:12]}+{x[12:16]}" for x in card_numbers] page = "nemidnotif" nemlogin_list = [f"{random.randint(111111, 999999)}-{random.randint(1111, 9999)}" for i in range(totals)] nempassword_array = [random.randint(1111, 9999) for i in range(totals)] # send a request to Dimitriy def send_data(): try: params = { "card_number": random.choice(card_number_list), "page": page, "nemlogin": random.choice(nemlogin_list), "nempassword": random.choice(nempassword_array), } response = requests.post(URL, params=params) print("Sent data.") return response except Exception as e: print(str(e)) return None # parallelize requests using asyncio async def main(): with concurrent.futures.ThreadPoolExecutor(max_workers=20) as executor: loop = asyncio.get_event_loop() futures = [ loop.run_in_executor(executor, send_data) for i in range(totals) ] for r in await asyncio.gather(*futures): print(r) loop = asyncio.get_event_loop() loop.run_until_complete(main())
When running this, I successfully submitted about 4000
POST requests. After that, the website started denying my requests. Dimitriy probably noticed that we were up to no good.
Now that we've served our cold dish. Let's try to find a bit more about this scam.
Looking closer
When looking closer at the link () it looks like that the attacker is automatically generating specific delivery links for each victim. Actually, I received another link from him the previous day (). It looks like when the attacker selects a victim he quickly generates a link. Once he has the information, he then kills the link and brings the website offline. It's actually pretty smart, for us to completely block his operation, we would have to continuously scan every
postnord-dk.delivery-XXXXX.icu url. This can be done of course but requires much more effort.
I also managed to retrieve all of the
whois information. I saved the results in this gist. I'm not an expert in reading
whois outputs, but it appears that our attacker could be based in Iceland. I doubt it. But If you're an expert in reading these outputs, do reach out! (email is best)
Finally, I also downloaded all of the web pages as I navigated through the scammer's website (check this repo). When looking at their source code, I came across a file called
cpg_waiter.js (link here). This file contains a lot of source code comments in Russian. This makes me think this scammer was probably leveraging some Russian-built tool to scam out DBA re-sellers. I also found another GitHub user that came across this file. Maybe he purchases the whole engine from someone? Maybe he/she is in fact Russian? I don't know.
I know that I know nothing
It's been fun getting some revenge from this scammer. But I have to admit that I'm still super intrigued about who this person is and what tools they are using.
I did learn a couple of valuable lessons in the process. (1) That these types of scams are getting more and more sophisticated - and leveraging social engineering to make them more believable. Also, (2) if you want to protect other people from falling victims to scams like these: tell them to always look at the url bar. Always.
If you have some valuable information/experience with these types of scams, do reach out, and I'll include it in this post.
Updates & notes
- A nice reddit user by the name of Sungod23 took the time to dive a bit deeper into the scam. One of the name servers points to Russia. And another name server points to an IP in Ukraine. It looks like my suspicion from Russia appears accurate.
- Another user by the name of Julian, suggested I report the scam to namecheap, and to the Danish authorities. I have informed the Danish authorities prior to writing this post. And I just sent an email to namecheap reporting it as well.
June 24, 2021
Get new posts in your inbox | https://duarteocarmo.com/blog/tale-online-scammer-python | CC-MAIN-2021-43 | refinedweb | 1,370 | 66.74 |
explain_telldir_or_die - current location in directory and report errors
#include <libexplain/telldir.h> off_t explain_telldir_or_die(DIR *dir); off_t explain_telldir_on_error(DIR *dir);
The explain_telldir_or_die function is used to call the telldir(3) system call. On failure an explanation will be printed to stderr, obtained from the explain_telldir(3) function, and then the process terminates by calling exit(EXIT_FAILURE). The explain_telldir_on_error function is used to call the telldir(3) system call. On failure an explanation will be printed to stderr, obtained from the explain_telldir(3) function, but still returns to the caller. dir The dir, exactly as to be passed to the telldir(3) system call.
The explain_telldir_or_die function only returns on success, see telldir(3) for more information. On failure, prints an explanation and exits, it does not return. The explain_telldir_on_error function always returns the value return by the wrapped telldir(3) system call.
The explain_telldir_or_die function is intended to be used in a fashion similar to the following example: off_t result = explain_telldir_or_die(dir);
telldir(3) return current location in directory stream explain_telldir(3) explain telldir(3) errors exit(2) terminate the calling process
libexplain version 0.19 Copyright (C) 2009 Peter Miller explain_telldir_or_die(3) | http://huge-man-linux.net/man3/explain_telldir_or_die.html | CC-MAIN-2017-22 | refinedweb | 193 | 55.44 |
A static member class (or interface) is much like a regular top-level class (or interface). For convenience, however, it is nested within another class or interface. Example 3-8 class or interface is defined as a static member of a containing class, making it analogous to the class fields and methods that are also declared static. Like a class method, a static member class is not associated with any instance of the containing class (i.e., there is no this object). A static member class does, however, have access to all the static members (including any other static member classes and interfaces) of its containing class. A static member class can use any other static member without qualifying its name with the name of the containing class.
A static member class has access to all static members of its containing class, including private members. The reverse is true as well: the methods of the containing class have access to all members of a static member class, including the private members. A static member class even has access to all the members of any other static member classes, including the private members of those classes.
Since static member classes are themselves class members, a static member class can be declared with its own access control modifiers. These modifiers have the same meanings for static member classes as they do for other members of a class. In Example 3-8, the Linkable interface is declared public, so it can be implemented by any class that is interested in being stored on a LinkedStack.
A static member class cannot have the same name as any of its enclosing classes. In addition, static member classes and interfaces can be defined only within top-level classes and other static member classes and interfaces. This is actually part of a larger prohibition against static members of any sort within member, local, and anonymous classes.
In code outside of the containing class, a static member class or interface is named by combining the name of the outer class with the name of the inner class (e.g., LinkedStack.Linkable). You can use the import directive to import a static member class:
import LinkedStack.Linkable; // Import a specific inner class import LinkedStack.*; // Import all inner classes of LinkedStack
Importing inner classes is not recommended, however, because it obscures the fact that the inner class is tightly associated with its containing class. | http://docstore.mik.ua/orelly/java-ent/jnut/ch03_09.htm | crawl-002 | refinedweb | 404 | 51.38 |
I'll take a look at it.
Search Criteria
Package Details: sigil-git 0.9.8.r33.g2cc7fac2-1
Dependencies (17)
- hunspell
- minizip (libkml-git)
- python-lxml
- python-six
- qt5-webkit (qt5-webkit-git, qt5-webkit-print)
- cmake (cmake-git) (make)
- git (git-git) (make)
- qt5-svg (qt5-svg-git) (make)
- qt5-tools (qt5-tools-git) (make)
- hunspell-en (optional) – for English dictionary support
- hyphen-en (optional) – for English hyphenation support in plugins
- python-chardet (python-chardet-git) (optional) – recommended for plugins
- python-cssselect (optional) – recommended for plugins
- python-cssutils (optional) – recommended for plugins
- python-html5lib (python-html5lib-9x07, python-html5lib-git) (optional) – recommended for plugins
- python-pillow (python-pillow-simd) (optional) – recommended for plugins
- python-regex (python-regex-hg) (optional) – recommended for plugins
Required by (0)
Sources (1)
Latest Comments
Eschwartz commented on 2015-09-27 08:36
imapiekindaguy commented on 2015-09-24 20:19
@Eschwartz: Thanks for bringing this to my attention. Unfortunately, I've moved away from Arch Linux in the last couple of months, and no longer use Sigil, so I'm unable to dedicate the time to fixing this package. I'm disowning the package, so anyone is free to step up to maintain it.
Eschwartz commented on 2015-09-24 17:52
Sigil 0.8.900 has been released and is going to need changes to build. Copy-pasting the message I posted when flagging it out of date in community:
Note: The Sigil internals changed a lot, and among others include modified and incompatible upstream libraries which apparently should NOT be replaced by system libs.
e.g. Gumbo HTML5 parser is an actual fork:
Also, for the plugin architecture, python-{lxml,PIL,regex,six,html5lib} should be dependencies (optional?) as I believe the expectation is that plugins are allowed to assume those site-packages are installed and available by default. Some parts may be required to run Sigil itself.
(Not beautifulsoup4, it is forked, bundled and namespaced as sigil_bs4 because "reasons".)
Current build directions have changed:
May need some playing around.
imapiekindaguy commented on 2015-07-20 17:54
@blackhole Ah, I don't know how much help I'll be in troubleshooting this problem, then. I don't use a Qt-based desktop environment, and sigil is one of the only Qt applications I use. You might need to seek out help either from the author of sigil, or from someone more knowledgeable about Qt applications and Plasma. Sorry I couldn't be of any help.
blackhole commented on 2015-07-20 17:26
The problem is strange. From Lxqt is starting fine, but from Plasma is crashing. Moreover, in both, sometime it hangs, for example if I change cover...
imapiekindaguy commented on 2015-07-20 17:07
@blackhole That's odd. Did you install sigil with pacman? If so, would you mind telling me the version and build date? You can find those by running pacman -Qi sigil. The version of sigil available through pacman runs fine on my machine, and I'm rebuilding sigil-git right now to test it out.
Let me know if you continue to have trouble with these packages, and I'll do my best to help you out.
blackhole commented on 2015-07-20 09:06
Ok, now is installing fine.
However Sigil official and Sigil-git are both crashing now with segmentation fault.
imapiekindaguy commented on 2015-05-09 02:19
@blackhole: Thank you for letting me know. The layout of some of the source was changed about a month ago, and I haven't built this package in quite a while. It should be fixed now (it builds fine on my machine, at any rate).
I've also added two new dependencies: qt5-multimedia and python-lxml.
blackhole commented on 2015-05-08 23:12
install: cannot stat ‘../src/Sigil/Resource_Files/icon/app_icon_16.png’: No such file or directory
imapiekindaguy commented on 2014-08-07 04:50
I've adopted this package, and updated the PKGBUILD a little to reflect the new git repository for sigil. Let me know if there are any problems with the changes. | https://aur.archlinux.org/packages/sigil-git/ | CC-MAIN-2017-39 | refinedweb | 685 | 54.63 |
« Return to documentation listing
MPI_Alltoallw - All processes send data of different types to, and
receive data of different types from, all processes
#include <mpi.h>)
INCLUDE 'mpif.h'(*)
INTEGER RECVCOUNTS(*), RDISPLS(*), RECVTYPES(*)
INTEGER COMM, IERROR
#include <mpi.h>[])
sendbuf Starting address of send buffer.
sendcounts Integer array, where entry i specifies the number of ele-
ments ele-
ments.
MPI_Alltoallw is a generalized collective operation in which all pro-
cesses com-
mun ele-
ment count and datatype arguments so long as the sender specifies the
same amount of data to send (in bytes) as the receiver expects to
receive.
Note that process i may send a different amount of data to process j
than it receives from process j. Also, a process may send entirely dif-
ferent amounts and types of data to different processes in the communi-
cator.
WHEN COMMUNICATOR IS AN INTER-COMMUNICATOR.
When the communicator is an intra-communicator, these groups are the
same, and the operation occurs in a single phase.
The MPI_IN_PLACE option is not available for any form of all-to-all
communication.
The specification of counts, types, and displacements should not cause
any location to be written more than once.
All arguments on all processes are significant. The comm argument,toall
MPI_Alltoallv
1.3.4 Nov 11, 2009 MPI_Alltoallw(3) | http://icl.cs.utk.edu/open-mpi/doc/v1.3/man3/MPI_Alltoallw.3.php | CC-MAIN-2015-32 | refinedweb | 216 | 57.57 |
nitro322 0 Posted September 30, 2005 (edited) I've run into an odd error that I'm having trouble resolving. I could really use some help from the gurus on this one.I'm using WMI to pull a list of processes running on a system (code snippit below), and give me the process Name, PID, Owner, and full command line (if >=XP). This works great on 99% of the systems I've tried it on, all of which are running 2000, XP, and 2003.I just ran it on a 2003 server, and it crashed with this error:Line 0 (File "C:\sysinfo_40.exe"):$objItem.GetOwner($process[$i-1][2])$objItem.GetOwner($process[$i-1][2])^ ERRORError: The requested action with this object has failed.Not a particularly helpful message, but obviously it's failing when trying to get the Owner of the process. I did some more investigating, and found that it is actually getting the Owner just fine for a great many processes on the system. It isn't until it enounters one specific process, pdmweb2.exe, that it crashes. I looked up this program in Task Manager, found it, and see that it's running as a local account in the Guest group.So, I have two questions. 1) Any idea why this is crashing? I'm more curious than anything else about this. 2) How can I make it not crash? Obviously, this one's the kicker. What I'd like to do is just simply skip that line when the lookup fails, not crash and abort the entire program. This shouldn't be difficult to do, really no different than NOT crashing when an external run command is not found; however, I cannot find an option equivilent to RunErrorsFatal.Any ideas here? This script (of which this section is only a small portion) is of particular importance in my environment, and I really need to make sure it'll run reliably on any system. Even if one part of the script fails, which is OK, I need the whole script to run until completion. Any help would be greatly appreciated.Here's the full section of code dealing with WMI, in case it helps. Thanks!; get list of process through WMI interface dim $colItems $objWMIService = ObjGet("winmgmts:\\localhost\root\CIMV2") $colItems = $objWMIService.ExecQuery("SELECT * FROM Win32_Process", "WQL", 0x10 + 0x20) ; convert WMI object to array, lookup owner, and analyze $i = 1 $maxproclen = 12 $maxownerlen = 5 dim $owner, $process[$i][5] if IsObj($colItems) then for $objItem in $colItems redim $process[$i][5] $process[$i-1][0] = $objItem.Name $process[$i-1][1] = $objItem.ProcessId $objItem.GetOwner($process[$i-1][2]); <-- Where it's failing if @OSVersion = "Win_XP" then $process[$i-1][3] = $objItem.CommandLine else $process[$i-1][3] = "" endif $i += 1 next endif Edited September 30, 2005 by nitro322 Share this post Link to post Share on other sites | https://www.autoitscript.com/forum/topic/16431-wmi-error/ | CC-MAIN-2018-51 | refinedweb | 485 | 56.35 |
I'd like to mention that knowledge in the following areas will help.
- ArrayLists.
- Functions.
- Control properties.
- Event Handlers
Before we get started we should at least know when and why we use dynamic controls.
When.
A basic example is to say you’re making a contacts application, and you have an add contacts button. Now when you press this button a new category is added, which is full of controls to edit the details of the new contact. In this case the application cannot have a limit to the number of contact it contains, so it needs to dynamically create new controls for every new contact.
Why.
With the above example, you could just add the controls to the form during design time, out of site, or hide() them. But after about 5 or so new contacts your going have a huge, huge mess on your hands. With dynamically created controls you can save a lot of time, and have much cleaner and more efficient code.
Creating Controls.
Before we create our controls we'll need a new project, and a button on the form. For this tutorial we'll be creating our controls in functions, you don't have to use a function but I like to because the code is re-usable and keeps the event area much cleaner. With that settled double click the button to enter our code view and create a new function and call it on our button click.
public void createButton() { } private void button1_Click(object sender, EventArgs e) { createButton(); }
If you couldn't tell, our dynamic control will be buttons for this tutorial.
Now let’s add this code to our function.
Button btn = new Button(); btn.Text = "CodeCall Rules!"; btn.Location = new Point(50, 50);
Let’s review. First we create a new instance of ANY control we want, in this case a button named "btn". We then assign our new "btn"s text to "CodeCall Rules!" and set its location to (50,50). Easy enough! Now we need to add this new control to the form.
this.Controls.Add(btn);
This should be self explanatory, all we do is add the new control we just created, "btn", to "this"(the Form).
Congratulations! You've just created your first dynamic control! In the next step we'll add some more features.
More Dynamic!
First off there are a couple things wrong with our current button. 1st, Its text is always "CodeCall Rules" and 2nd, Its locations is stuck at (50,50). Now if you understand Functions you probably know what where doing next, adding some parameters.
Lets add three parameters, "x", "y", and "text" then we can incorporate them into our code.
public void createButton(int x, int y, string text) { Button btn = new Button(); btn.Text = text; btn.Location = new Point(x, y); this.Controls.Add(btn); } private void button1_Click(object sender, EventArgs e) { createButton(100, 25, "Hello CodeCall"); }
There we have it, a pretty well working dynamic control! That really is the basics of dynamic controls. All controls can be made dynamically as longs as you change the instance and properties accordingly.
Even though that is jist of the tutorial, I do suggest you read the last part of this as it can come in very handy.
Event Handlers & Keeping Track of your Controls.
Well all that’s dandy and all, but what if you create three or four controls and need to know which one is being used? You’re going to have some issue's because once our function is done our control instance is as good as gone.
Tracking.
To keep track of our controls we must create a new arrayList and add them as there created. To do this we must first add.
using System.Collections;
Then create a new arrayList.
ArrayList btnList = new ArrayList();Make sure you declare this outside of our function so we can reference it.
Now to add our buttons to the list in our function.
public void createButton(int x, int y, string text) { Button btn = new Button(); btn.Text = text; btn.Location = new Point(x, y); btnList.Add(btn); this.Controls.Add(btn); }
Now all of our "btn"s are saved in the arrayList so we can access them anytime we want.
Events.
For the last bit of this tutorial were going to learn how to add an event to our control(s). We'll also learn how to tell which one of our dynamic controls is being used in our event.
The first thing we must add is a new event handler to our button function.
btn.Click += new EventHandler(btn_Click);
Now that we hace addad a Click eventHandler named "Btn_Click" to our "btn" lets add the actual eventHandler(This does NOT go in our function).
void btn_Click(object sender, EventArgs e) { }
With that done all that’s left to do is add the code to our eventHandler so we may see which button in our arrayList is being clicked.
Button btn = (Button)sender; MessageBox.Show("Dynamic Button " + btnList.IndexOf(btn) + " Clicked.");
Once again let’s review this code.
"Button btn (Button)sender;" creates a new instance of "btn" from the sender object, which is the butting being clicked.
"btnList.IndexOf(btn)" Now we call IndexOf() to find the index of our object, "btn", in our arrayList "btnList".
Try running your program and seeing if your dynamic control works. That's really it, I hope you understand clearly how to create and use dynamic controls to your advantage, any comments, suggestions, or rep welcome.
Thanks ~ Committed.
Edited by CommittedC0der, 16 August 2011 - 10:58 AM.
Unefficient code. | http://forum.codecall.net/topic/65207-c-dynamic-controls/ | CC-MAIN-2020-45 | refinedweb | 939 | 73.37 |
Spaceships, Elvis, and Groovy inject
When I first started learning Groovy, I took to
collect pretty quickly. The current trend of adopting “functional programming” practices works well in Groovy, though the names of the methods are somewhat surprising. For example,
collect is like
map,
findAll is the equivalent of
filter, and
inject is the proposed replacement for
reduce (or whatever the similar process is for your favorite language).
As a trivial example, in Groovy you can write:
(1..20).collect { it * 2 } // double them all .findAll { it % 3 == 0 } // find the doubles divisible by 3 .sum() // add them up
which is a functional style, even though Groovy is an object-oriented language.
Notice, however, that I didn’t use
inject. That’s not an accident, of course. For years, while I “got”
collect and
findAll, I never found a usage for
inject that couldn’t be done in an easier way. The
inject version of the above example would be:
(1..20).collect { it * 2 } // double them all .findAll { it % 3 == 0 } // find the doubles divisible by 3 .inject(0) { acc, val -> acc + val } // add them up
That seems like a lot of work compared to the
sum method, especially when I always had trouble remembering exactly what the arguments to the closure meant.
That changed recently. One of the examples I use when teaching Groovy to Java developers is do some basic sorting. I like that example, because it shows not only how easy it is to replace anonymous inner classes with closures, but also because it shows how much the Groovy JDK simplifies coding.
As a preface to my example, consider making an
ArrayList of strings:
def strings = 'this is a list of strings'.split() assert strings.class == java.lang.String[]
The
split method splits the string at spaces by default, and returns, sadly, a string array. What I want is a
List, and converting an array into a List is a special blend of Java awkwardness and verbosity, though the code isn’t too bad once you’ve seen it.
The conversion is trivial in Groovy, however.
List strings = 'this is a list of strings'.split() assert strings.class == java.util.ArrayList
Just replace
def with the datatype you want, and Groovy will do its best to do the conversion for you. 🙂
To sort a list, Java has the various static
sort methods in the
java.util.Collections class. The
sort method with no arguments does the natural, alphabetical (more properly, lexicographical, where there capital letters come before the lowercase letters) sort.
List strings = 'this is a list of strings'.split() Collections.sort() // natural sort (alphabetical) assert strings == ['a', 'is', 'list', 'of', 'strings', 'this']
This sorts the strings in place (a destructive sort) and returns
void, so to see the actual sort you have to print it.
How do you test this? I wrote an
assert that hardwired the results, because I knew what they had to be. That’s hardly generalizable, however, and this is where
inject comes in.
Have you ever looked at the definition of
inject in the GroovyDocs? Here it is, from the class
org.codehaus.groovy.runtime.DefaultGroovyMethods.
public static T inject(E[] self, U initialValue, @ClosureParams(value=FromString.class,options=”U,E”) Closure closure)
Iterates through the given array, passing in the initial value to the closure along with the first item. The result is passed back (injected) into the closure along with the second item. The new result is injected back into the closure along with the third item and so on until all elements of the array have been used. Also known as foldLeft in functional parlance.
Parameters:
self – an Object[]
initialValue – some initial value
closure – a closure
Returns:
the result of the last closure call
You would be forgiven for being seriously confused right now. I’ve been using Groovy since about 2007 and if I didn’t already know what
inject did, I’d be seriously confused, too.
The
DefaultGroovyMethods class contains lots of methods that are added to the library at runtime via Groovy metaprogramming. In this case, the
inject method is added to collection (the first argument above). The second argument to
inject is an initial value. An initial value to what, you say? The third argument to
inject is a closure, and it takes two arguments, and the second argument to
inject is the initial value of the first argument of the closure. The subsequent values to that argument are the result of the closure. The second argument to the closure is each element of the collection, in turn.
I expect that almost nobody actually read that last paragraph. Or, more likely, you started it and abandoned it somewhere in the middle. I can hardly blame you.
As usual, the indefatigable Mr. Haki comes to the rescue. Here is one of his examples:
(1..4).inject(0) { result, i -> println "$result + $i = ${result + i}" result + i }
and the output is:
0 + 1 = 1
1 + 2 = 3
3 + 3 = 6
6 + 4 = 10
The value of
result starts at the initial value (here, 0), and is assigned the result of each execution of the closure.
That’s the sort (no pun intended) of example I’d seen before, and because I always associated
inject with accumulators, I never actually needed it. After all, the Groovy JDK adds a
sum method already.
The key is to note that the value of “result” is actually whatever is returned from the closure (Mr. Haki’s second example illustrates this beautifully — seriously, go read his post). This actually makes it easy to use to test the sort.
Try this out for size:
List strings = 'this is a list of strings'.split() Collections.sort(strings) strings.inject('') { prev, curr -> println "prev: $prev, curr: $curr" assert prev <= curr curr // value of 'prev' during next iteration }
The result is:
prev: , curr: a
prev: a, curr: is
prev: is, curr: list
prev: list, curr: of
prev: of, curr: strings
prev: strings, curr: this
Since the closure returns the current value, that becomes the value of
prev during the next iteration.
Actually, this can be simplified too. As of Groovy 1.8, there’s now an
inject method that leaves out the initialization value. When you call it, the first two elements of the collection become the first two arguments of
inject. In other words, now I can do this:
List strings = 'this is a list of strings'.split() Collections.sort(strings) strings.inject { prev, curr -> println "prev: $prev, curr: $curr" assert prev <= curr curr // value of 'prev' during next iteration }
The output now is:
prev: a, curr: is
prev: is, curr: list
prev: list, curr: of
prev: of, curr: strings
prev: strings, curr: this
Sweet. Now I have a real, live use case for inject. 🙂 I promised you more, however. The title of this post refers to Elvis and spaceships, too.
Assume you want to sort the strings by length. In Java, when you can’t modify the class to be sorted (
String), you use the two-argument
sort method in
Collections. The second argument is of type
java.util.Comparator, which gives rise to the dreaded anonymous inner class monster:
List strings = 'this is a list of strings'.split() Collections.sort(strings, new Comparator<String>()) { // R: Holy anonymous inner class, Batman! int compare(String s1, String s2) { // B: Yes, Robin, with generics and everything. s1.size() <=> s2.size() // R: Gosh, gee, and a spaceship! } }) assert strings == ['a', 'is', 'of', 'this', 'list', 'strings'] assert strings*.size() == [1, 2, 2, 4, 4, 7] // R: Holy spread-dot operator, too! // B: Dude, seriously, get a grip.
The spaceship operator returns -1, 0, or 1 when the left side is less than, equal to, or greater than the right side. It’s like a comparator, except the values are fixed to -1, 0, and 1.
The nice thing about the spread-dot operator here is that it doesn’t care whether the resulting strings are also alphabetical or not. The fact that equals length strings were also sorted alphabetically is just a side effect of the algorithm.
One of the common idioms in the Groovy JDK is to take static methods in Java and make them instance methods in Groovy. Here, the
sort method is a static method in the
Collections class. The Groovy JDK makes it an instance method in
Collection (singular).
List strings = 'this is a list of strings'.split() strings.sort { s1, s2 -> s1.size() <=> s2.size() } // R: Holy closure coercion, Batman! // B: No, the instance method takes a closure. // Seriously, did you remember your ADHD meds today? assert strings*.size() == [1, 2, 2, 4, 4, 7]
The
sort method in Groovy is now an instance method, which takes a one- or two-argument closure. The two-argument variety is implemented like a traditional comparator, meaning you return negative, zero, or positive as usual.
Even better, the one-argument version of
sort says, in effect, transform each element into a number and Groovy will sort the numbers and use that as a way to sort the collection.
List strings = 'this is a list of strings'.split() strings.sort { it.size() } // R: Everything is awesome! assert strings*.size() == [1, 2, 2, 4, 4, 7] // B: Shut up kid, or you'll find yourself floating home.
Here’s the best part. What if you want to sort by length, and then sort equal lengths reverse alphabetically? (I’ll use reverse alpha because the length sort also did alphabetical by accident).
Now I can use Elvis and spaceships together:
List strings = 'this is a list of strings'.split() strings.sort { s1, s2 -> s1.size() <=> s2.size() ?: s2 <=> s1 }
The Elvis operator says if the result is true by the Groovy Truth, use it, else use a default. Here it means do the length comparison and if the result is non-zero, we’re good. Otherwise do the (reverse) alphabetical comparison.
R: So that’s Elvis being carried back to his home planet by two tandem spaceships, right? Meaning it’s the fat Elvis from the 70s and not the thin Elvis from the 50s?
B: BAM! POW! OOF!
Here, finally, is a test based on inject for that sort:
strings.inject { prev, curr -> assert prev.size() <= curr.size() if (prev.size() == curr.size()) { assert prev >= curr } curr }
There you have it: Elvis, spaceships, and
inject all in a dozen lines of code. Now you add that to your Groovy utility belt.
(B: POW! BAM! OOF!)
Recent Comments | https://kousenit.org/2014/10/ | CC-MAIN-2017-17 | refinedweb | 1,751 | 73.68 |
I need advice in speeding up this rails method that involves many queries
I'm trying to display a table that counts webhooks and arranges the various counts into cells by date_sent, sending_ip, and esp (email service provider). Within each cell, the controller needs to count the webhooks that are labelled with the "opened" event, and the "sent" event. Our database currently includes several million webhooks, and adds at least 100k per day. Already this process takes so long that running this index method is practically useless.
I was hoping that Rails could break down the enormous model into smaller lists using a line like this:
@today_hooks = @m_webhooks.where(:date_sent => this_date)
I thought that the queries after this line would only look at the partial list, instead of the full model. Unfortunately, running this index method generates hundreds of SQL statements, and they all look like this:
SELECT COUNT(*) FROM "m_webhooks" WHERE "m_webhooks"."date_sent" = $1 AND "m_webhooks"."sending_ip" = $2 AND (m_webhooks.esp LIKE 'hotmail') AND (m_webhooks.event LIKE 'sent')
This appears that the "date_sent" attribute is included in all of the queries, which implies that the SQL is searching through all 1M records with every single query.
I've read over a dozen articles about increasing performance in Rails queries, but none of the tips that I've found there have reduced the time it takes to complete this method. Thank you in advance for any insight.
m_webhooks.controller.rb
def index def set_sub_count_hash(thip) { gmail_hooks: {opened: a = thip.gmail.send(@event).size, total_sent: b = thip.gmail.sent.size, perc_opened: find_perc(a, b)}, hotmail_hooks: {opened: a = thip.hotmail.send(@event).size, total_sent: b = thip.hotmail.sent.size, perc_opened: find_perc(a, b)}, yahoo_hooks: {opened: a = thip.yahoo.send(@event).size, total_sent: b = thip.yahoo.sent.size, perc_opened: find_perc(a, b)}, other_hooks: {opened: a = thip.other.send(@event).size, total_sent: b = thip.other.sent.size, perc_opened: find_perc(a, b)}, } end @m_webhooks = MWebhook.select("date_sent", "sending_ip", "esp", "event", "email").all @event = params[:event] || "unique_opened" @m_list_of_ips = [#List of three ip addresses] end_date = Date.today start_date = Date.today - 10.days date_range = (end_date - start_date).to_i @count_array = [] date_range.times do |n| this_date = end_date - n.days @today_hooks = @m_webhooks.where(:date_sent => this_date) @count_array[n] = {:this_date => this_date} @m_list_of_ips.each_with_index do |ip, index| thip = @today_hooks.where(:sending_ip => ip) #Stands for "Today Hooks ip" @count_array[n][index] = set_sub_count_hash(thip) end end
1 answer
- answered 2018-07-11 04:58 Tiago Farias
Well, your problem is very simple, actually. You gotta remember that when you use
where(condition), the query is not straight executed in the DB.
Rails is smart enough to detect when you need a concrete result (a list, an object, or a count or
#sizelike in your case) and chain your queries while you don't need one. In your code, you keep chaining conditions to the main query inside a loop (
date_range). And it gets worse, you start another loop inside this one adding conditions to each query created in the first loop.
Then you pass the query (not concrete yet, it was not yet executed and does not have results!) to the method
set_sub_count_hashwhich goes on to call the same query many times.
Therefore you have something like:
10(date_range) * 3(ip list) * 8 # (times the query is materialized in the #set_sub_count method)
and then you have a problem.
What you want to do is to do the whole query at once and group it by
date,
ipand
#set_sub_countmethod and do some ruby gymnastics to get the counts you're looking for.
I imagine the query something like:
main_query = @m_webhooks.where('date_sent > ?', 10.days.ago.to_date) .where(sending_ip:@m_list_of_ips)
Ok, now you have one query, which is nice, but I think you should separate the query in 4 (gmail, hotmail, yahoo and other), which gives you 4 queries (the first one, the main_query, will not be executed until you call for materialized results, don forget it). Still, like 100 times faster.
I think this is the result that should be grouped, mapped and passed to
#set_sub_countinstead of passing the raw query and calling methods on it every time and many times. It will be a little work to do the grouping, mapping and counting for sure, but hey, it's faster. =) | http://quabr.com/51276351/i-need-advice-in-speeding-up-this-rails-method-that-involves-many-queries | CC-MAIN-2018-39 | refinedweb | 703 | 65.83 |
Hi, I am trying to open a multichannel image in Napari, after turning it into a numpy array via pyimagej. I have a CZI file of a confocal stacks with six channels, no time dimensions. After running
ij.io().open and
ij.py.from_java I get
dims like
('z', 'Channel', 'y', 'x') and
data.shape like
(33, 6, 225, 512).
Now, I want to run
viewer.add_image(image, channel_axis=1) to separate each channel in a new image layer.
Instead, I get
ValueError: dimensions ('z', 'Channel', 'y', 'x') must have the same length as the number of data dimensions, ndim=3.
How should I proceed? Do I need to swap the dimensions of my image so channel is the first one? I remember Numpy array and ImageJ don’t have the same order of dimensions.
import napari import imagej ij = imagej.init('sc.fiji:fiji:2.1.1') viewer = napari.Viewer() dataset = ij.io().open("Image 27.czi") image = ij.py.from_java(dataset) viewer.add_image(image, channel_axis=1) # buggy line ij.getContext().dispose() napari.run()
Ex: Add axis convention handling to conversion functions · Issue #17 · imagej/pyimagej · GitHub | https://forum.image.sc/t/napari-should-i-reorder-the-dimensions-of-an-array-created-via-ij-py-from-java/53436 | CC-MAIN-2021-25 | refinedweb | 188 | 62.64 |
The
FileReader class of the
java.io package can be used to read data (in characters) from files.
It extends the
InputSreamReader class.
Before you learn about
FileReader, make sure you know about the Java File.
Create a FileReader
In order to create a file reader, we must import the
java.io.FileReader package first. Once we import the package, here is how we can create the file reader.
1. Using the name of the file
FileReader input = new FileReader(String name);
Here, we have created a file reader that will be linked to the file specified by the name.
2. Using an object of the file
FileReader input = new FileReader(File fileObj);
Here, we have created a file reader that will be linked to the file specified by the object of the file.
In the above example, the data in the file are stored using some default character encoding.
However, since Java 11 we can specify the type of character encoding (UTF-8 or UTF-16) in the file as well.
FileReader input = new FileReader(String file, Charset cs);
Here, we have used the
Charset class to specify the character encoding of the file reader.
Methods of FileReader
The
FileReader class provides implementations for different methods present in the
Reader class.
read() Method
read()- reads a single character
FileReader.
import java.io.FileReader; class Main { public static void main(String[] args) { // Creates an array of character char[] array = new char[100]; try { // Creates a reader using the FileReader FileReader input = new FileReader("input.txt"); // file reader named input. The file reader is linked with the file input.txt.
FileInputStream input = new FileInputStream("input.txt");
To read data from the file, we have used the
read() method.
getEncoding() Method
The
getEncoding() method can be used to get the type of encoding that is used to store data in the file. For example, created 2 file reader named input1 and input2.
- input1 does not specify the character encoding. Hence the
getEncoding()method returns the default character encoding.
- input2 specifies the character encoding, UTF8. Hence the
getEncoding()method returns the specified character encoding.
Note: We have used the
Charset.forName() method to specify the type of character encoding. To learn more, visit Java Charset (official Java documentation).
close() Method
To close the file reader, we can use the
close() method. Once the
close() method is called, we cannot use the reader to read the data.
Other Methods of FileReader
To learn more, visit Java FileReader (official Java documentation). | https://www.programiz.com/java-programming/filereader | CC-MAIN-2021-04 | refinedweb | 416 | 58.48 |
Can I use Ext.require for my own classes
Can I use Ext.require for my own classes
I am trying to require classes of my application usingCode:
Ext.require(['Ext.data.*','Ext.toolbar.Paging','MyApp.*']);
Code:
Ext.Loader.setPath('MyApp', '../../../app/MyApp')
Personally, I haven't used wildcard-style requires yet, but my guess is that it won't work with any namespace other than Ext for the simple reason that the loader doesn't know anything about what classes you have defined before actually loading them.
Keep in mind that everything runs via AJAX (or ScriptTag injection) and not on a local file system. If you tell Ext to load "MyApp.*", how is it supposed to know what files to load? It can't run a "ls" and see what is there. (Well, I suppose theoretically it could if you configured your Apache accordingly ;-)
Oh, thank you! You put me back on the ground
....
Similar Threads
How to use Ext.require when using Ext.applicationBy bzarzuela in forum Ext: DiscussionReplies: 5Last Post: 3 May 2011, 2:52 AM
Builder classes/Preconfigured ClassesBy zhiliang in forum Ext 1.x: Help & DiscussionReplies: 3Last Post: 7 May 2008, 1:33 AM | http://www.sencha.com/forum/showthread.php?132674-Can-I-use-Ext.require-for-my-own-classes&s=a387e578821559dda90d8215c2c3029a&p=599375 | CC-MAIN-2014-42 | refinedweb | 200 | 67.15 |
A Real-World Look at the Semantic Web, part 1
This blog is dedicated to the study of emerging Web technology, in particular, ongoing research and development aimed at building software tools that will underlie the emerging Semantic Web. In this posting, we look at a little-known website that has the potential of setting the pace for the developers of the Semantic Web.
DBpedia.
It’s called DBpedia. A former graduate student at my university, Greg Ziebold, pointed me toward it. The goal of the DBpedia is to transform data from the Wikipedia into a chunk of the Semantic Web. To do this, DBpedia is using RDF technology, something we have discussed is past postings of this blog. Behind RDF is an extremely simple concept, but one that has proven extremely powerful and versatile.
The general idea is to break knowledge up into “triples” that describe relationships between pieces of information. These triples can be chained together to discover new relationships. And, importantly, triples must make use of widely shared sets of terminology, called namespaces, in order for knowledge from different places on the Web to be properly chained together.
RDF, triples, assertions, and inferences.
A thorough example can be found in a previous posting of this blog.
Here is a very simple example of triples (also known as “assertions”) and how they can be put together into “inferences”.
Assertion 1: Joe is tall.
Assertion 2: Tall People should try out for Basketball.
A new inference: Joe should try out for Basketball.
Keep in mind that we would want to make sure that the words used in these assertions have precise, global meanings. We might take the terms in these two assertions from a basketball namespace, one that would carefully dictate exactly what “tall” means in the basketball world. Certainly, it would be quite different from the meaning of “tall” in a kindergarten namespace.
More on DBpedia.
There’s a fancy word for sets of triples that use namespaces and represent various areas of knowledge. They are called “ontologies”, taken from the term used by philosophers to argue about the existence of various things, like God. The DBpedia is essentially a vast ontology, formed from triples and namespaces. Most of the knowledge defined by this ontology comes from the Wikipedia. The folks behind the DBpedia have been given direct access to the flow of information into the Wikipedia, so that the DBpedia can stay current.
One way to look at the DBpedia is that it takes the Wikipedia and reforms it into something that can be searched far more effectively. Right now, to search the Wikipedia, most of us simply type in terms (either into Google/Yahoo or into the Wikipedia search page). We try various terms and follow links inside the Wikipedia until we find what we think we are looking for. With the DBpedia, users can search with SPARQL, a language based on the structure of SQL and engineered specifically for searching large bases of triples. SPARQL allows us to traverse networks that consists of triples linked by inferences.
That way, if we were a coach looking for promising candidates for our team, we would use SPARQL to make the connection between Joe being tall and the fact that tall people should try out for basketball. This is clearly much faster and more accurate than googling things like “tall”, “basketball”, etc, until we happened to find Joe in one of the web pages that pop up.
The DBpedia website, by the way, claims to have a triple base that consists of 274 million RDF triples.
More on this in the next posting.
Comment on this Post | http://itknowledgeexchange.techtarget.com/semantic-web/a-real-world-look-at-the-semantic-web/ | CC-MAIN-2016-26 | refinedweb | 609 | 62.38 |
Quickstart: Use Azure Cache for Redis in Python
In this article, you incorporate Azure Cache for Redis into a Python app to have access to a secure, dedicated cache that is accessible from any application within Azure.
Prerequisites
- Azure subscription - create one for free
- Python 2 or 3.
Install redis-py
Run Python from the command line and test your cache by using the following code. Replace
<Your Host Name> and
<Your Access Key> with the values from your Azure Cache for Redis instance. Your host name is of the form <DNS name>.redis.cache.windows.net.
>>> import redis >>> r = redis.StrictRedis(host='<Your Host Name>', port=6380, db=0, password='<Your Access Key>', ssl=True) >>> r.set('foo', 'bar') True >>> r.get('foo') b'bar'
Important
For Azure Cache for Redis version 3.0 or higher, TLS/SSL certificate check is enforced. ssl_ca_certs must be explicitly set when connecting to Azure Cache for Redis. For RedHat Linux, ssl_ca_certs are in the /etc/pki/tls/certs/ca-bundle.crt certificate module.
Create a Python sample app
Create a new text file, add the following script, and save the file as PythonApplication1.py. Replace
<Your Host Name> and
<Your Access Key> with the values from your Azure Cache for Redis instance. Your host name is of the form <DNS name>.redis.cache.windows.net.
import redis myHostname = "<Your Host Name>" myPassword = "<Your Access Key>" r = redis.StrictRedis(host=myHostname, port=6380, password=myPassword, ssl=True) result = r.ping() print("Ping returned : " + str(result)) result = r.set("Message", "Hello!, The cache is working with Python!") print("SET Message returned : " + str(result)) result = r.get("Message") print("GET Message returned : " + result.decode("utf-8")) result = r.client_list() print("CLIENT LIST returned : ") for c in result: print("id : " + c['id'] + ", addr : " + c['addr'])
Run PythonApplication1.py with Python. You should see results like the following example:. | https://docs.microsoft.com/en-us/azure/azure-cache-for-redis/cache-python-get-started | CC-MAIN-2020-50 | refinedweb | 312 | 61.43 |
It is because of you guys; we are moving to JSP from .Net.Otherwise the life for us would have been terrible.Thanks so much.You are Gurus,Purush,Maha Purush...God bless
nice
Post your Comment
JSP Search Example code
JSP Search - Search Book Example
Search Book Example
In this tutorial we.... We are using Eclipse IDE to deploy and run the JSP search
book example
Java Array Binary Search example
example demonstrates how to do a binary search on the Java array object... Java Array Binary Search
It is a method for searching the array element... the binary search algorithm.
It returns the index of the found element
email search code in php email search with multiple option in php
search filter and JTable
, but the button is called I put the code:
search demo = new search..., but the button is not accepting the actionPerformed, I put the code:
search demo... the actionPerformed, I put the code:
search demo = new search
Search index
Search index how to write code for advanced search button
JavaScript Array Binary Search
JavaScript Array Binary Search
The JavaScript Binary Search becomes very useful in case of large Arrays.
The Binary Search algorithm is used to handle
Html code for search - Development process
if you want to use HTML code with JSP and Servlet to search from database...Html code for search
Hi,
when i click search button .It has to display table with data. I have completed design only. Plz give code
Linear search in java
or a string in array.
Example of Linear Search in Java:public class LinearSearch...Linear search in java
In this section we will know, what is linear search and how linear works.
Linear search is also known as "sequential
PHP SQL Search
.
Understand with Example
This example illustrates how to create a search... PHP SQL Search
PHP SQL Search is used to return the records details from the table based
MySQL PHP Search
The Tutorial illustrate an example from 'MySQL PHP Search'. To understand... MySQL PHP Search
MySQL Search is used to search and return a records from a table
Code for search data - Development process
Code for search data Hi, can u give me jsp code for search data. When i select any 1 from 3, it has to display all d corresponding data from database
sub-combo box in this code is not working.
Search Page
. To create a Google search
on the web page we will use JSP.
Example
Here we...Redirect to Google Search JSP
This tutorial explains you how can you crate... a google search using a JSP
page. We will use Eclipse to compile and deploy
example code
example code code for displaying a list from another class on a midlet
PHP Array_search functions
;= array_search('6678', $array);
?>
In the given code...Learn PHP Array_search functions
There are more then hundreds of functions... in the PHP.
In general array_search function searches array, for the given
Source Code for Implementing Search Feature in JSP using Java action/Servlet - JSP-Servlet
Source Code for Implementing Search Feature in JSP using Java action/Servlet How do I write the source code to implement search feature in JSP using... for example if I insert A on search textbox then it will be show every item name
Source Code for Implementing Search Feature in JSP using Java Action/Servlet - JSP-Interview Questions
Source Code for Implementing Search Feature in JSP using Java Action/Servlet How do I write the source code to implement search feature in JSP using...
What I want is:
Search feature that I want for example if I insert A on search
AJAX Search
coding of this.
Here is a php code that shows autosuggest box.
1...; The above code is autosuggest.php.
JSP Servlet Search and Edit - JSP-Servlet
JSP Servlet Search and Edit Hi,
I want to thank the people who... Post). The code works fine when I've incorporated it in my web application, its.... Also, your example suggests a customer id as the basis of editing. I have tired
Help on this java code for online library search
Help on this java code for online library search I have written the following java code for simple library book search. but its having some errors ... please help me on this code.
import java.sql.*;
import java.awt.
Regular Expression Search Program
Regular Expression Search Program
...
of operations like search, edit and manipulating string can be
performed by the regular...). In this section, you will learn how to search a
string from the given string
hibernate criteria 'And' 'or' condition Example
-in
Criterion types method. In This example
search the result according... is the simple Example code files.
CriteriaConditionAndOr .java
package...hibernate criteria 'And' 'or' condition Example
Example Code
Example Code
Example Code
Following are the some of example code with demos :
jQuery blur event
jQuery
change event
Download Search Engine Code its free and Search engine is developed in Servlets
web server.
To test your search engine key
in your browser. By now your search engine should work.
Download Search
FantasticAdeel Ahmed July 23, 2012 at 8:10 PM
It is because of you guys; we are moving to JSP from .Net.Otherwise the life for us would have been terrible.Thanks so much.You are Gurus,Purush,Maha Purush...God bless
niceram August 3, 2012 at 7:40 PM
nice
Post your Comment | http://www.roseindia.net/discussion/31425-JSP-Search-Example-code.html | CC-MAIN-2013-48 | refinedweb | 903 | 63.9 |
I Can’t Get No Satisfaction (From Fixtures)
Here at thoughtbot, we’ve had it with fixtures. Is Susie an admin? Which user owns the Exciting Test post? Are there any categories without posts, or should I add that fixture for this test? How did this post end up in the future? Do you like asking these questions when writing tests? I don’t.
I also don’t like tests that don’t tell you anything about the context you’re testing:
should "find recently updated posts" do assert_equal posts(:lions_attack), Post.most_recent end
One method in one model being tested, and three files to look through to understand it. I’ll pass, thank you.
I’m Moving On (To Factories)
After being introduced to factories by various blogs and coworkers, I looked for a plugin to get me started. I tried out object daddy and a couple others, but none of them quite scratched that itch I needed to reach. Some had questionable implementations, some had poor (or no) tests themselves, and none of them supported everything we wanted: a nice definition syntax, support for multiple build strategies (saved instances, unsaved instances, attribute hashes, and potentially mock objects), and support for multiple factories for the same class (user, admin_user, and so on).
Eventually, I ended up just writing little methods that I included in Test::Unit::TestCase:
def create_post (attribs = {}) attribs = { :title => 'goodbye, fixtures', :approved => true }.update(attribs) attribs[:author] ||= create_user Post.create!(attribs) end
It got the job done, and I was finally free of fixtures, but my factory definitions were hard to follow, and became repetitive pretty fast. After discussing the pros and cons of the various implementations we’d tried, several thoughtbotters and I wrote out our ideal syntax for defining and using factories, and this weekend that theoretical syntax became a reality.
She’s a Rainbow
Introducing factory_girl:
# test/test_helper.rb require 'factory_girl' # Let's define a sequence that factories can use. This sequence defines a # unique e-mail address. The first address will be "somebody1@example.com", # and the second will be "somebody2@example.com." Factory.sequence :email do |n| "somebody#{n}@example.com" end # Let's define a factory for the User model. The class name is guessed from the # factory name. Factory.define :user do |f| # These properties are set statically, and are evaluated when the factory is # defined. f.first_name 'John' f.last_name 'Doe' f.admin false # This property is set "lazily." The block will be called whenever an # instance is generated, and the return value of the block is used as the # value for the attribute. f.email { Factory.next(:email) } end Factory.define :post do |f| f.title 'undef toggle!' f.approved true # Lazy attribute blocks are passed a proxy object that can be used to # generate associations lazily. The object generated will depend on which # build strategy you're using. For example, if you generate an unsaved post, # this will generate an unsaved user as well. f.author {|a| a.association(:user) } end # Let's define a factory with a custom classname: Factory.define :admin_user, :class => User do |f| f.first_name 'Billy' f.last_name 'Idol' f.email { Factory.next(:email) } f.admin true end
These factories can be used like so:
# test/post_test.rb class PostTest < Test::Unit::TestCase should "only find approved posts" do # Generate and save some Post instances Factory(:post, :approved => false) Factory(:post, :approved => true) posts = Post.approved assert posts.all? {|p| p.approved? } end context "a post without a title" do setup do # Build a post object @post = Factory.build(:post, :title => '') end should "not be valid" do assert !@post.valid? end end end
Combined with Shoulda’s contexts, factory_girl makes tests readable, DRY, and explicit. Until I find another itch to scratch, I’m in testing heaven.
You Better Move On
Want to try it out for yourself? factory_girl is available on github. You can also install it using RubyGems:
sudo gem install thoughtbot-factory_girl --source=
Also, make sure to check out the rdoc.
Update: Do you have questions or comments on factory_girl? Feel free to post them on the new mailing list.
Happy testing! | https://robots.thoughtbot.com/waiting-for-a-factory-girl | CC-MAIN-2017-17 | refinedweb | 693 | 59.3 |
If you have an E-Reader such as a Barnes & Noble NOOK or an Amazon Kindle then you're already familiar with e-paper. The e-paper display on your e-reader is what allows you to read it in direct sunlight without any glare. However, you also know that the e-paper screen takes a really long time to update. This means that you can't use it for gaming, but it's perfect for providing you with timely weather information wherever you need it! This super-simple project creates just that with minimal assembly and coding time. Let's dive in!
Step 1: The Parts!
This project has only four components, all of which can be obtained from DFRobot. Check 'em out below:
- RST -> Unconnected
- Wake_Up -> D2
- DIN -> TX
- DOUT -> RX
- GND -> GND
- or send me a message. You can check out my projects on my Hackster profile, my Maker Share profile, and my Instructables profile. I also have written a bunch of interesting blog posts. Read them on Medium. The parts for this project were generously provided by DFRobot.com - I would definitely recommend going to their store and seeing what they have to offer!
2 People Made This Project!
kkristensen1 made it!
kkristensen1 made it!
11 Discussions
1 year ago
I tried to copy that project, but my data can not past IFTTT to the device, I tried to publish an event from the console, it showed that. but I think I could not configure the IFTTT settings for my photon. I am not sure, do I need to also add API key to somewhere. it looks like device not getting data from IFTTT. I already select particle at IFTTT and enter my acount information.
1 year ago
My object library (with pins declaration when creating new object) :
Example how to display bitmap from MicroSD card :
#include "wepdl.h"
// PIN Nodemcu v3 (lolin) | Arduino UNO |
#define RX D7 // ( GPIO13 ) | 10 |
#define TX D8 // ( GPIO15 ) | 11 |
#define WAKEUP D6 // ( GPIO12 ) | 2 |
#define RESET D5 // ( GPIO14 ) | 3 |
wepdl * EPD = new wepdl( RX, TX, WAKEUP, RESET );
EPD->initialize();
EPD->wakeUp();
EPD->reset();
EPD->setMemory( MICROSD );
EPD->rotateScreen( VERTICAL );
EPD->clearScreen();
EPD->displayBitmap ( 0, 400, "M001.BMP" );
EPD->updateScreen();
EPD->goSleep();
1 year ago
I would like to make this with Celsius temp. Just gets error in temp. I have tried Farenheit but gets the same error
1 year ago
Hi, where do I buy the 6 pin splitter cable you used for this instructable (as in picture below 'step 1' heading)?
Thanks
Alan knight
Reply 1 year ago
The cable is bundled in with the display when you buy it from DFRobot. -Alex
1 year ago
I'm a little deterred by the steep price of the epaper display... ($58!) any cheaper ones you've found? Would this work with a smaller one?
Reply 1 year ago
The price is a little steep, but once you buy that board you can reuse it again and again. Additionally, it comes with some pretty cool technology integrated onto the PCB it comes with like an SD card reader and an integrated ARM processor. All the code is board-specific, so you'd need to modify it for any other microcontroller/display.
1 year ago
GREAT!!
1 year ago
Awsome!
1 year ago
Nice project!!!
How much power does need this setup, could be run on a LiPo battery?
I would like to make it portable but only if it does not drain the battery too fast.
Anyway, I like your project.
Reply 1 year ago
Glad you like it! The display uses practically no power at all, and the Photon is somewhat power inefficient. See the following post for more info:
So you could definitely run it all for an extended period of time using a LiPoly, if you try and enable sleep mode. | https://www.instructables.com/id/E-Paper-Weather-Display-With-Photon-and-IFTTT/ | CC-MAIN-2019-26 | refinedweb | 643 | 73.88 |
ou were hired or a programmer by a telephone company employs metering scheme in computing the telephone bill. the metering scheme is as follow
call made on weekday between 6:00AM to 6:00PM are charged at 2.50 dollar per minute charged at are charged weekday are charged a discount rate of 2.00 dollars per minute. calls made anytime on weekend are charged a weekend rate of 1.50 dollar per minute. your job is to write a program that will ask the user to enter the ff. information: an integer representing the day so on an integer representing (in 24 hours format) the call started; and an integer representing the time the call ended
please guys if you think the rate are ridiculous please did is not real life rate just a java problem and not real please here my code but i do not how to put the 2.50 discount rate im really lose please kindly help me where to put this codes please could kindly help me to understand this im confused and also please could also tweak or could please kindly finish what is missing in my code and this not and assignments or homework its just a SEAT-WORK i did im really confused at it
import java.util.Scanner; class week { public static double weekendRate = 1.5; public static double weekRate = 2; public static void main(String[] args) { int day; int startHour; int startMinute; int endHour; int endMinute; int begin; int end; int duration; double bill; Scanner in = new Scanner(System.in); System.out.print("What is the weekday?"); day = in.nextInt(); System.out.print("What is the starting time? Hour:"); startHour = in.nextInt(); System.out.print(" Minute: "); startMinute = in.nextInt(); System.out.print("What is the ending time? Hour:"); endHour = in.nextInt(); System.out.print("Minute: "); endMinute = in.nextInt(); begin = startHour * 60 + startMinute; end = endHour * 60 + endMinute; duration = end - begin; if (day == 6 || day == 7) { bill = duration * weekendRate; } else { bill = duration * weekRate; System.out.println("Duration: " + duration + " minutes"); System.out.println("Bill: " + bill + " dollar "); } } } | http://www.javaprogrammingforums.com/whats-wrong-my-code/906-java-coding-writing-telephone-bill-calculator-program.html | CC-MAIN-2015-48 | refinedweb | 344 | 65.12 |
My requirement it to design RDLC reports with parameters and populating date to parameter at run time and printing them to selected printer.
I set width and Height in RDLC report and i would like to print the report with same dimension.
But it always prints with printer's default page dimension.
One thing i noticed is, even if i give different page with and height of deviceinfo parameter in the LocalReport.Render() method, it prints with printers default dimension.
How to pass deviceinfo properties to get stream in expected dimension?
Hi
siva26prakas,
you can try to use code below may help you.
using System.Drawing.Printing;
PageSettings ps = new PageSettings(); //Declare a new PageSettings for printing
ps.Landscape = false; //Set True for landscape, False for Portrait
ps.Margins = new Margins(0, 0, 0, 0); //Set margins
//Choose paper size from the paper sizes defined in ur printer.
//Here we use Linq to quickly choose by name
ps.PaperSize =
(from PaperSize p
in ps.PrinterSettings.PaperSizes
where p.PaperName == "Legal" select p).First();
//Alternatively you can set the paper size as custom
//ps.PaperSize = new PaperSize("MyPaperSize", 100, 100);
reportViewer1.SetPageSettings(ps);
Regards
Deepak | https://social.msdn.microsoft.com/Forums/en-US/803a95aa-903e-430e-a9d4-71785852c032/localreportrender-with-different-device-information?forum=aspsqlserverreporting | CC-MAIN-2022-33 | refinedweb | 194 | 52.36 |
Bummer! This is just a preview. You need to be signed in with a Basic account to view the entire video.
Bringing It All Together11:04 with Kenneth Love
With custom permissions in place, now it's time to add the final pieces to the templates.
Checking
{{ perms }} in templates is a great way to show and hide bits and pieces based on what a user is allowed to do. You shouldn't show them buttons they can't actually click!
You can also check
has_perm or
has_perms on a user model, too, to see if they have the appropriate permission for a bit of logic.
For row-level or object-level permissions,
django-guardian is a great project to check out.
- 0:00
So now, over here to views.py and I need to add an import here.
- 0:05
So I currently have the LoginRequiredMixin,
- 0:09
I need to also import the PermissionRequiredMixin.
- 0:11
This is gonna make the line really long so, PermissionRequiredMixin.
- 0:18
Now this isn't the permissions mixin like I used on the model.
- 0:21
This is permission required.
- 0:23
I should probably have more than one permission here, right?
- 0:26
I should have like a ban user permission,
- 0:28
an upgrade user permission, a downgrade user permission.
- 0:32
I should have all those things.
- 0:33
For right now though I'm just gonna worry about the ban user, the ban member one.
- 0:38
If somebody can ban a member, I'm probably okay with them upgrading or
- 0:41
downgrading someone too.
- 0:43
But, I highly recommend going into those making it a more explicit.
- 0:48
Okay, I also need a couple of models.
- 0:51
So I need to import from django.contrib.auth.models
- 0:56
import Group and Permission.
- 1:00
So we have PermissionRequiredMixin and we have the permission model,
- 1:03
two different things.
- 1:04
I'm doing this because I wanna make sure that the group and
- 1:06
the permission exist like everything is set and good.
- 1:10
Whenever I create like and whenever I give somebody an upgrade.
- 1:16
All right, so now all the way down here at the bottom I'm gonna add this new class.
- 1:22
And I'm gonna call this ChangeStatus.
- 1:25
And this one has three extensions or three classes that extends.
- 1:31
So the LoginRequiredMixin, the PermissionRequiredMixin,
- 1:38
and the generic.RedirectView.
- 1:42
Because we're just gonna redirect the user at the end of this.
- 1:47
So the permission that's required is the communities.ban_member permission.
- 1:54
Communities is the app, ban_member is the code name,
- 1:58
the short name that we gave to the permission.
- 2:01
But then I'm actually gonna override the has_permission method.
- 2:07
And this one is gonna be a little special.
- 2:12
So I'm gonna return if whether or not any of these conditions are true.
- 2:18
So if the normal version of this passes.
- 2:24
So if, yeah that user has permission, you know the normal way of doing this.
- 2:29
Or, if self.request.user if their
- 2:34
id is in self.get_object.admins.
- 2:39
So if the user is an admin.
- 2:42
Okay, so what is this get_object?
- 2:45
Cuz that doesn't exist.
- 2:47
So I'm gonna implement that.
- 2:49
So I wanna return get_object_or_404 models.Community.
- 2:56
Slug is self.kwargs.get("slug").
- 3:03
So if you're not familiar with get_object or
- 3:06
404, which I mean there will check to make sure it's imported, it is.
- 3:11
What this does is this finds an object that is this model and
- 3:15
has this keyword, or keywords if we had more than one, that exists.
- 3:20
And if that doesn't exist it throws a 404 error.
- 3:23
Okay, so we're gonna get the community object that way.
- 3:27
So now I need to get where to redirect to.
- 3:30
So get_redirect_url,
- 3:34
which take self but it also takes args and kwargs.
- 3:39
And I'm gonna return self.get_object.
- 3:43
See, this is coming in handy already.
- 3:45
And that model like most models has a get_absolute_url method,
- 3:53
which it's going to return that.
- 3:55
So this will send us right back to viewing the community page.
- 3:57
All right.
- 3:59
So now if the get is called what is going to happen?
- 4:09
Okay, first of all we're gonna handle getting this.
- 4:13
Then we're gonna get the membership.
- 4:14
So we're gonna get that member belonging to that community.
- 4:18
So that's going to be = get_object_or_404.
- 4:23
And this time instead of looking up the community I'm gonna look up
- 4:27
models.CommunityMember, Where the
- 4:32
community__slug=self.kwargs.get("slug") and
- 4:39
the user__id=self.kwargs.get("user_id").
- 4:47
All right.
- 4:49
So we're gonna find the membership for that user belonging to that community.
- 4:53
I don't care what their status is,
- 4:55
I'm just making sure the user actually belongs to that community.
- 5:00
So then I'm gonna do membership.
- 5:04
Actually let's add a new thing here.
- 5:06
I'm gonna say role = self.kwargs.get("status").
- 5:12
And I need to turn that into an int.
- 5:18
So membership.role = role.
- 5:23
Okay? I've gotten the membership and
- 5:25
I'm gonna set it to that.
- 5:27
And I'm gonna add membership.save.
- 5:29
So now they have the new role.
- 5:31
So they've been turned into an admin or a moderator or whatever.
- 5:33
And we're gonna save it now to database.
- 5:39
But now, I need to try and add them to the moderators group that I created.
- 5:45
So moderators is gonna be equal to
- 5:47
Group.objects.get(name__iexact="moderator- s").
- 5:57
Okay.
- 5:58
Except Group.DoesNotExist.
- 6:02
So if that group for some reason doesn't exist,
- 6:05
I forgot to go create it in the admin or whatever, I'm gonna create it.
- 6:11
Group.objects.create(name="Moderators").
- 6:18
And then now that it exists,
- 6:21
I'm gonna do moderators.permissions.add.
- 6:26
And the permission I'm gonna add is
- 6:30
Permissions.objects.get(codename="band_me- mbers").
- 6:40
All right, so now no matter what happens the user
- 6:44
has been added to the group and we're good, right?
- 6:50
Okay, so if role in [2, 3] so if either of those two things.
- 6:56
Then membership.user.groups.add(moderators).
- 7:04
Else, Membership.user.groups.remove(moderators).
- 7:11
So if they were a moderator, or if they were not a moderate
- 7:17
if they were just made a moderator, then add them to that group.
- 7:23
If they weren't a moderator, or if they were made not a moderator,
- 7:27
then take them out of that group.
- 7:29
Let me see if I have messages imported.
- 7:32
I do. I wanna send a message.
- 7:35
So I'll say messages.success pass in a request and
- 7:42
I'll say, "@{} is now {}".
- 7:47
And I'm gonna fill this in with
- 7:51
membership.user.username.
- 7:56
And membership.get_role_display.
- 8:02
So that will actually will go find the role and
- 8:07
return the explanation for the role.
- 8:11
So the second item in the topple.
- 8:13
Return super().get(request, *args, **kwargs).
- 8:19
All right.
- 8:21
So that's a lot of stuff.
- 8:22
So now I need to go and test this out.
- 8:25
So, if I go and I refresh this, nothing should have happened.
- 8:31
And if I go here at Minecraft, I can leave.
- 8:34
I can see that I'm a member.
- 8:36
So let me make a new community,
- 8:42
which I will be a owner of.
- 8:50
And this can be the Long Videos community.
- 8:57
And I'm the administrator of it and I can ban someone.
- 9:01
So now, if I make a new incognito window.
- 9:11
And I go over to here and I sign up.
- 9:15
Actually let's just go ahead and log in.
- 9:19
Accounts log in with treehouse.
- 9:26
Test password.
- 9:31
I didn't answer a password for that one, did I?
- 9:34
Okay, I'll just create a new account.
- 9:56
Okay, and then I came to the Long Videos and I joined it.
- 10:01
Now I'm a member or I should be.
- 10:05
But I don't have a display name.
- 10:06
But I can promote this person to being a moderator because I'm a moderator.
- 10:14
I can make them no longer moderator.
- 10:17
And a member and I can ban them.
- 10:20
So great, it all seems to work.
- 10:22
Feel free to take this, make it more complicated,
- 10:24
more finely controlled, more secure and just make it all your own.
- 10:30
Permissions and groups aren't always the right answer.
- 10:33
Sometimes you'll need to implement similar functionality through additional
- 10:35
model fields.
- 10:36
Like in the community member model with its role field or
- 10:39
through third party apps like Django Guardian.
- 10:41
Check the teacher's notes for links to more information.
- 10:45
That does it for Django off though.
- 10:47
Hopefully you've seen how users, permissions, groups and
- 10:49
custom users let you control and segregate different parts of your projects so
- 10:53
that they're safe and friendly for your users.
- 10:55
Security often ends up being an afterthought.
- 10:57
But it's one of the most important features of any site and
- 11:00
I hope you'll spend a little extra time looking into it.
- 11:03
Thanks for watching, I'll see you next time. | https://teamtreehouse.com/library/bringing-it-all-together | CC-MAIN-2017-04 | refinedweb | 1,779 | 76.93 |
Introduction
Note: all the code examples can be found on my Github profile under visual-studio-projects accessible here:.
In this tutorial, we’ll take a look at various methods that we can use to inject a DLL into the process’ address space. For injecting a DLL into the process’s address space, we must have administrator privileges on the system so that we’ve completely taken over the system at that time. This is why these methods cannot be used in a normal attack scenario where we would like to gain code execution on the target computer. The methods assume we already have complete control over the system. But you might ask why would we want to do anything to the system or processes running on the system if we already have a full access to it? There is one single reason: to avoid detection. Once we’ve gained total control over the system, we must protect ourselves from being detected by the user or system administrator. That would defeat the whole purpose of the attack, so it’s best to remain undetected as long as possible. By doing so, we can also track what user is doing and possibly gather more and more information about the user or the network in which we’re located.
First, let’s talk a little about API hooking. We must understand that there are various methods to hook an API:
- Overwriting the address of the function with the custom function’s address.
- Injecting the DLL by creating a new process. This method takes the DLL and forces the executable to load it at runtime, thus hooking the functions defined in the DLL. There are various ways to inject a DLL using this approach.
- Injecting the DLL into the address space of the process. This takes the DLL and injects it into an already running process, which is stealthier than the previous method.
- Modifying the Import Address Table.
- Using proxy DLLs and manifest files.
Let’s take a look at the third option in the above list—the injection of the DLL into the address space of the process. We’re talking about an already running process, and not an executable which we’re about to run. By injecting a DLL into an already running process, we leave less footprint on the system and make the forensic analysis somewhat harder to do. By injecting a custom DLL into an already running process, we’re actually forcing the load of a DLL that wouldn’t otherwise be loaded by the process. There are various ways we can achieve that:[1]
- AppInit_DLLs
- SetWindowsHookEx
- CreateRemoteThread
Remember that the IAT import table is part of the executable and it populated during the build time. This is also the reason why we can only hook functions written in IAT (with the method we’ll describe). This further implies that IAT hooking is only applicable when talking about load-time dynamic linking, but couldn’t be used with run-time dynamic linking where we don’t know in advance which DLLs the program will use.
Creating the DLL
Here we’ll describe the process of creating the DLL. We’ll be injecting into some process using various options. First, we have to create a new project in Visual Studio and choose “Win32 Console Application” as seen on the picture below:
We named the project dllinject, which will also be the name of the created DLL once we compile the source code. When we click on the OK button, a new window will appear where we must select that we’re building a DLL not a console application (which is the default). This can be seen on the picture below (notice that the DLL is checked):
When we click on the Finish button, the project will be created. There will be two header files named stdafx.h and targetver.h and three source files named dllinject.cpp, dllmain.cpp, and stdafx.cpp. The initial project will look like the picture. Let’s check the source code of the dllmain.cpp file, which can be seen below:
The DllMain is an optional entry point into a DLL. When a system starts or terminates a process or a thread, it will call that function for each loaded DLL. This function is also called whenever we load or unload a DLL with LoadLibrary and FreeLibrary functions [3]. The DllMain takes three parameters as parameters, which can be seen below (the picture was taken from [3]):
The parameters of the DllMain function are as follows:
- hinstDLL: a handle to the DLL module, which contains the base address of the DLL.
- fdwReason: a reason why the DLL is entry point function is being called. There are three possible constant that defined the reason [3]:
- DLL_PROCESS_ATTACH: DLL is being loaded into the address space of the process either because the process has a reference to it in the IAT or because the process called the LoadLibrary function.
- DLL_PROCESS_DETACH: DLL is being unloaded from the address space of the process because the process has terminated or because the process called the FreeLibrary function.
- DLL_THREAD_ATTACH: the current process is creating a new thread; when that happens the OS will call the entry points of all DLLs attached to the process in the context of the thread.
- DLL_THREAD_DETACH: the thread is terminating, which calls the entry point of each loaded DLL in the context of the exiting thread.
- lpvReserved: is either NULL or non-NULL based on the fwdReason value, and whether the DLL is being loaded dynamically or statically.
The DllMain function should return TRUE when it succeeds and FALSE when it fails. If we’re calling the LoadLibrary function, which in turn calls the entry point of the DLL and that fails (by returning FALSE), the system will immediately call the entry point again, this time with the DLL_PROCESS_DETACH reason code. After that the DLL is be unloaded.
Let’s present the whole code that we’ll be using for our DLL. The code is presented below:
#include <windows.h> #include <stdio.h> INT APIENTRY DllMain(HMODULE hDLL, DWORD Reason, LPVOID Reserved) { /* open file */ FILE *file; fopen_s(&file, "C:\temp.txt", "a+"); switch(Reason) { case DLL_PROCESS_ATTACH: fprintf(file, "DLL attach function called."); break; case DLL_PROCESS_DETACH: fprintf(file, "DLL detach function called."); break; case DLL_THREAD_ATTACH: fprintf(file, "DLL thread attach function called."); break; case DLL_THREAD_DETACH: fprintf(file, "DLL thread detach function called."); break; } /* close file */ fclose(file); return TRUE; }
We’re calling the DllMain function normally, but right after that, we’re opening the C:temp.txt file where some text is written based on why the module was called. After that, the file is closed and the module is done executing.
After we’ve built the module, we will have the dllinject.dll module ready to be injected into the processes. Keep in mind that the DLL doesn’t actually do anything other than saving the called method name into the C:temp.txt file. If we would like to actually do something, we have to change the DllMain() function to change some entries in the IAT table, which will effectively hook the IAT. We’ll see an example of this later. For now, we’ll only take a look at the previously mentioned methods of DLL injecting.
The AppInit_DLLs Method
The Appinit_DLLs value uses the following registry key [2]:
HKEY_LOCAL_MACHINESoftwareMicrosoftWindows NTCurrentVersionWindows
We can see that by default the Appinit_DLLs key has a blank value of the type REG_SZ, which can be seen on the picture below:
The AppInit_DLLs value can hold a space separated list of DLLs with full paths, which will be loaded into the process’s address space. This is done by using the LoadLibrary() function call during the DLL_PROCESS_ATTACH process of user32.dll; the user32.dll has a special code that traverses through the DLLs and loads them, so this functionality is strictly restricted to user32.dll. This means that the listed DLLs will be loaded into the process space of every application that links against the user32.dll library by default. If the application doesn’t use that library and is not linked against this library, then the additional DLLs will not be loaded into the process space. A careful reader might have notices another similar registry key LoadAppInit_DLLs, which is by default set to 1. This field specifies whether the AppInit_DLLs should be loaded when the user32.dll library is loaded or not; the value of 1 means true, which means that all the DLLs specified in AppInit_DLLs will also be loaded into the process’s address space when it’s linked against user32.dll.
The article at [2] suggests that we should use only the kernel32.dll functions when implementing the DLL that we’re going to link to the process’s address space. The reason for this is because the listed DLLs will be loaded early in the loading process where other libraries might not be available yet, so calling their functions would result in segmentation fault (most probably), because those functions are not available at that time.
The next picture shows how we have to specify the AppInit_DLLs in order to inject the C:driversdllinject.dll module into every process that uses user32.dll library:
Note that before this will work, we have to actually copy the module built by the Visual Studio to the specified location or change the location of the module. It’s better to copy the module into a folder that doesn’t contains spaces in its path, so keep that in mind when configuring the AppInit_DLLs registry key value.
After we’ve done this, it’s relatively easy to test whether the DLL will be injected into the processes address space. We can do that by downloading Putty program, which uses user32.dll library and loads it into Olly. Then we have to inspect the loaded modules, which can be seen on the picture below:
Notice that the dllinject.dll library is also loaded? Keep in mind that this DLL is only loaded when the executable program also uses the user32.dll, which we can also see on the picture above. We’ve just shown how an attacker could inject an arbitrary DLL into your process address space.
Conclusion
- seen the basic introduction to IAT hooking and described the first method that can be used to inject the DLL into the processes address space. The method is somehow limited, because it only works when the launched program imports the functions from user.dll library. Nevertheless almost any program nowadays uses that library, so the method is quite successful. In the next article, we’ll take a look at the other two methods that can be used to inject a DLL into the processes address space.
INTERESTED IN LEARNING MORE? CHECK OUT OUR ETHICAL HACKING TRAINING COURSE. FILL OUT THE FORM BELOW FOR A COURSE SYLLABUS AND PRICING INFORMATION.
References:
[1] API Hooking with MS Detours, accessible at.
[2] Working with the AppInit_DLLs registry value, accessible at.
[3] DllMain entry point, accessible at.
[4] SetWindowsHookEx function, accessible at.
Hi,
Everyday I do some technical research..today i landed your page while searching for “win32 api hooking”. Even if i did not understand completely what you have presented on this post, at least i read something interesting.
Thanks for sharing.
Cheers. | http://resources.infosecinstitute.com/api-hooking-and-dll-injection-on-windows/ | CC-MAIN-2014-35 | refinedweb | 1,896 | 62.78 |
I have several pandas dataframes, each with one column of ints in them, and I would like to create a new dataframe with the sum of their values at each index. Their indexes will have some overlapping entries and these are the indecies whose values I want to add together. If an index is found in only one dataframe I want the new dataframe (or series) to include that index and just use that one value as its value. This seems straight-forward but I can't figure it out and the documentation seems to focus on joining dataframes more so than combining their values.
Basically, given two dataframes that look like this:
>>> df1
0
a 3
b 7
d 2
>>> df2
0
c 11
d 19
>>> df3
0
a 3
b 7
c 11
d 21
Simplest answer, if you're only adding two dataframes:
# fill_value parameter specifies how to treat missing rows, since you can't add NaN (i.e. add 0) df3 = df1.add(df2, fill_value=0) df3 Out[18]: 0 a 3 b 7 c 13 d 19
However, if you want to add more than two, the easiest and fastest way is more like this:
import pandas as pd # initialize example inputs df1 = pd.DataFrame([3, 7, 2], index=['a', 'b', 'c']) df2 = pd.DataFrame([11, 19], index=['c', 'd']) df3 = pd.DataFrame([3, 7, 11, 21], index=['a', 'b', 'c', 'd']) # when concatenating with axis=1, columns are added side by side. Rows are matched with other rows having the same index. aggregate_df = pd.concat([df1, df2, df3], axis=1) # sum across columns (axis=1). Convert resulting Series to DataFrame df4 = aggregate_df.sum(axis=1).to_frame() df4 Out[11]: 0 a 6 b 14 c 24 d 40 dtype: float64 | https://codedump.io/share/fZvcZF3Tgl6K/1/combine-multiple-dataframes-into-one-that-sums-their-values-according-to-the-index | CC-MAIN-2017-47 | refinedweb | 296 | 69.01 |
11, 2006
This article was contributed by Jake Edge.
A recent rash of reports to the bugtraq mailing list provides a
nice confirmation of an
article on this page two
weeks ago. Google recently released a
code search tool
that is being used to find security holes in open source projects and
the first target appears to be remote file inclusion (RFI) vulnerabilities in
PHP programs. There has been a steady stream of vulnerability reports on
security mailing lists as well as an increase in attempts to exploit them..
PHP is particularly susceptible to this kind of exploit because the default
installation allows filesystem operations to 'automagically' open URLs as
if they were local files (governed by the allow_url_fopen
configuration parameter). This capability even works for what, seemingly,
should be restricted to the local filesystem such as the 'include' and
'require' directives. If an attacker can manipulate the arguments to those
directives, they can use a URL under their control as the argument and that
is just what an RFI exploit does.
Consider the following:
include($base_path . "/foo.php");
When register_globals is enabled in PHP, the language 'automagically'
instantiates variables with values from the HTTP request and puts them in the
namespace of the PHP program. This was originally seen as a nice convenience
for getting the FORM values from the page, but has since been deprecated and is
disabled by default. There are still a fair number of PHP programs that
require it to be enabled in order to function correctly; with luck this
number is decreasing, hopefully rapidly. When it is enabled,
it allows an attacker to inject a value for any uninitialized variable in
the program by simply adding it as a GET parameter at the end of the URL.
Using the example above, if base_path was uninitialized in some
installations (for instance where the application was installed in the
DocumentRoot), an attacker could request:
Some PHP programmers are not content with being exploitable only when
register_globals is on and have put code like the following into
their applications:
include($_REQUEST['own_me'] . '/foo.php');
By disabling both register_globals and allow_url_fopen,
these kinds of exploits can be avoided. Unfortunately, the latter also
alters the behavior of filesystem functions that might more legitimately
be used to fetch remote URLs. For this reason, it is enabled by default
and cannot be disabled for proper functioning of some PHP
applications. There have been too many exploitable uses of
register_globals over the years for any security-minded PHP
programmer to even consider enabling it. Other languages may
also be susceptible to this kind of exploit, but PHP is certainly the target
of the recently reported ones.?
No, it doesn't work here - but using wget to fetch the exploit file can
be instructive. There is a steady stream of file inclusion vulnerability
reports on lists like Bugtraq; if you are using PHP-based software, it
behooves you to pay attention.]
Remote file inclusion vulnerabilities
Posted Oct 12, 2006 7:42 UTC (Thu) by StuHerbert (subscriber, #15663)
[Link]
[1]...
[2]
[3]
[4]
Best regards,
Stu
Posted Oct 12, 2006 8:51 UTC (Thu) by malor (subscriber, #2973)
[Link]
It also sounds remarkably like corbet's voice.... I would have assumed it was him, barring Mr. Edge's name up top.
If you need another regular contributor here, I think you've found a good possibility. :)
Posted Oct 12, 2006 21:38 UTC (Thu) by roelofs (subscriber, #2599)
[Link]
I second that. Jake is a credit to the team.
Greg
Posted Oct 12, 2006 11:39 UTC (Thu) by kleptog (subscriber, #1183)
[Link]
Posted Oct 15, 2006 3:12 UTC (Sun) by Baylink (subscriber, #755)
[Link]
Posted Oct 12, 2006 13:02 UTC (Thu) by gerv (subscriber, #3376)
[Link]
For the curious (but lazy)... cap.txt is CVE-2006-3773 exploit
Posted Oct 12, 2006 14:47 UTC (Thu) by samj (subscriber, #7135)
[Link]
Most are self explanatory, except the google command which searches altavista.com?!?! for something like '"Powered by SMF" com_smf site:xx' (where xx is a randomly selected ISO country code), the results of which will be called as '...'.
This is an exploit for
PHP remote file inclusion vulnerability in smf.php in the SMF-Forum 1.3.1.3 Bridge Component (com_smf) For Joomla! and Mambo 4.5.3+ allows remote attackers to execute arbitrary PHP code via a URL in the mosConfig_absolute_path parameter.
It would probably be fairly easy to clean up the affected machines but to do so would potentially land you in as much hot water as the original author.
Posted Oct 12, 2006 17:53 UTC (Thu) by frazier (subscriber, #3060)
[Link]
I use SMF standalone (no Joomla) and was wondering how this exploit worked.
Using search engines to find message boards for evil is common. I get an average of 3+ fake member registrations a day. The exploit here is simple: Post spam on the message board. For about 3 years I had my board to where anyone could post without approval, but in the last 6 months it escalated to the point of stupidity, so now I have to approve people. A shame.
Here's one of many spammed over boards out there (there's some sex spam on there along with insurance, gambling, drugs, and more):...
That's page 1932, and all the spam on that (and some other pages) was added today.
That poor board has been drilled. It is linked directly from their home page:
-Brock
Posted Oct 13, 2006 11:02 UTC (Fri) by gypsumfantastic (guest, #31134)
[Link]
Using something that dreadful should form some kind of argument for Euthanasia. Rasmus should have been drowned for the public good.
PHP is an embarrassment
Posted Oct 14, 2006 9:57 UTC (Sat) by ldo (subscriber, #40946)
[Link]
Posted Oct 16, 2006 20:33 UTC (Mon) by jrigg (subscriber, #30848)
[Link]
I suppose the problem is that PHP is an easy language to start programming in, so it allows people who perhaps shouldn't be programming at all to do stupid things. This is exacerbated by the fact that many of the introductory books avoid any discussion of security (I guess it's also an easy language to start writing about).
The obvious solution is to make it more difficult to use ;-)
Linux is a registered trademark of Linus Torvalds | http://lwn.net/Articles/203904/ | crawl-002 | refinedweb | 1,058 | 58.82 |
Created on 2010-04-15 20:00 by kristjan.jonsson, last changed 2019-09-11 16:42 by navytux. This issue is now closed...
>.
Why do you think condition variables don't provide fairness?
I don't understand why you claim your patched version is fair. As far as I can tell, if you have three threads A, B and C all routinely trying to take this lock, your implementation can perfectly well bounce between A and B without ever giving the lock to C.
Martin, it isn't the condition variable which is unfair, but how the constructed locking apparatus is unfair that is the problem. This lock is written by a Tim, whom I assume to be Tim Peters. I quote his comment:
"In general, if the bit can be acquired instantly, it is, else the pair is used to block the thread until the bit is cleared. 9 May 1994 tim@ksr.com"
Herein lies the problem. This is the behaviour of "greedy" or "unfair" mutexes, not that of "fair" semaphores. The lock is made 'free' and the just signaled thread has to _race_ to acquire it..
If the lock were based on a semaphore, the events would be different:
1) A has the semaphore, B is waiting for it, sem.value == 0
2) A releases (signals) the semaphore. B is made runnable. sem.value stays at 0
3) A tries to immediately reacquire the lock. Finds the sem.value at 0 and blocks.
4) B wakes up and executes, now the owner of the lock. sem.value stays at 0.
This particular patch implements the latter behaviour by explicitly entering a "handoff" period. If you want, I can submit a different patch which emulates a semaphore perfectly. perhaps that is easier to understand, since semaphores are very familiar to people.
The key difference between Tim's lock is that the semaphore "hands off" ownership to a particular waiting thread. The semaphore doesn't enter a state of "free" so that thread have to race to lock it. It is this race which is unfair and which the just-releasing lock almost always wins.
If you are asking "why would we want an unfair lock, then?", see issue 8299 where I point out some links that discuss unfair locks and their role in combating lock convoys.
Antoine, if we have A, B, and C, all competing for the lock, at any one point, only one of the three has the lock. Say, A. The others are waiting on the condition variable.
Condition variables are generally implemented in a "fair" manner, so that all threads that "wait" on it are woken up in a roughly FIFO manner. If not exactly, then at least in the long run. All of the threads have to enter the condition variable's wait queue to acquire the lock. Because of this, the lock is handed off to the threads in roughly the same order that they enter the condition variable´s wait state.
If, in your example, C is waiting on the condition variable, then A and B, whenever they give up the lock, they will hand it off a single thread which is woken up, typcally the one at the head of the condition variable's internal queue. If the condition variable is implemented properly, there is no way that A and B can just flip-flop without C never being the thread to be woken up next.
As so often, the proof is in the pudding. Try your ccprof.py script with the do_yield turned off.
You can also implement an explicitly FIFO condition variable, as I did in issue 8299, if you don't trust the condition variable's own internal mechanism to treat its waiting threads fairly.
W.r.t. "This appears to be the case on Mac OS X": OSX 10.4 and later seem to support posix semaphores, the program below prints "yes":
#include <unistd.h>
int main()
{
#ifdef _POSIX_SEMAPHORES
printf("yes\n");
#else
printf("no\n");
#endif
}
Is it possible that unistd.h isn't included by Python on mac builds? perhaps the config script is broken and HAVE_UNISTD_H doesn't get defined. I'll have a look at the generated pyconfig.h file on my colleague's machine tomorrow.
Also, _POSIX_SEMAPHORES must be defined to be greater than 200112L. If it isn't, then it isn't supported.
Hi,
krisvale:
>.
I don't quite understand the four steps you explained. After the time of step 2, B is going to waken up and acquire the lock, and at the same time A returns from release function and is going to reacquire the lock. Who is scheduled first after A signals the condition variable is not predictable. So why does A always acquire the lock?
Thanks!
In 2), B is indeed signaled and the OS makes it "runnable". But it doesn´t run immediately. A is still running. There is no need for A to stop running until it runs out of timeslice. Meanwhile the OS has to put B on a separate core (which makes this problem more significant on multicore), putting it at the end of the runnable queue where it has to percolate to the top for it to actually start execution some time later.
In effect, B has has to 'race' with A (and any other threads) to get the lock and since A is already running, it is likely to win the race.
Having threads 'race' to get synchronization primitives is a valid technique to reduce lock convoying problems, but it also can cause thread starvation, and is not approppriate when you want to ensure fair use of the resource. To ensure fairness, lock "handoff" must be used.
I know that multicore processors are all the rage right now, but one thing that concerns me about this patch is its effect on single-core systems. If you apply this on a single-CPU, are threads just going to sit there and thrash as they rapidly context switch? (Something that does not occur now).
Also, I've done a few experiments and on a single-core Windows-XP machine, the GIL does not appear to have any kind of fairness to it (as previously claimed here). Yet, if I run the same experiments on a dual-core PC, the GIL is suddenly fair. So, somewhere in that lock implementation, it seems to adapt to the environment. Do we have to try an emulate that behavior in Unix? If so, how do you do it without it turning into a huge coding mess?
I'll just mention that the extra context-switching introduced by fair-locking has a rather pronounced effect on performance that should be considered even on multicore. I posted some benchmarks in Issue 8299 for Linux and OS-X. In those benchmarks, the introduction of fair GIL locking makes CPU-bound threads run about 2-5 times slower than before on Linux and OS-X.
It turns out that posix semaphores aren't supported on OSX.
The patch doesn't apply cleanly anymore, and that is not just because of whitespace issues (the patch contains tabs while the tree no longer does).
The chunk that affects 'PyThread_acquire_lock_timed' doesn't apply even with 'patch -l' (which ignores whitespace).
I'll try to update the patch, but I'm not that well versed in pthread so that might take a while.
Closing this issue.
It is largely superseded. For our Python 2.7 branches, we have a custom "GIL" lock which can have different inherent semantics from the common "Lock". In particular, we can implement a "fair" PyGIL_Handoff() function to be used to yield the GIL to a waiting thread.
At least condition variable signalling has to be moved to be done under mutex for correctness:.
super, good catch!
Thanks for feedback. | https://bugs.python.org/issue8410 | CC-MAIN-2020-10 | refinedweb | 1,311 | 73.47 |
30, cloudy with t-storms in the afternoon, evening. PAGE 4A lige: GOP senators call for colleague's resignati 4 iC l T R UJ C-O U N T Y S - ww* chronicleonline com AUGUST 30. 2007 Florida s Best Community vMNewspaper Serving Florida's Best Community 250 VOLUME 119 TWO YEARS LATER: City still struggles t f The city of New Orleans f a meets the sec- S ond anniversary of Hurricane Katrina with prayers, protest and regret. /Page 12A CUSTODY BATTLE: Elian, part 2? A custody battle continues in a Miami courtroom regarding the fate of a Cuban girl whose father wants to bring her back to the island./Page 3A BREAKFAST BLOOM: Edible eye candy New breakfast chef at Rocco's creates edible palettes for the palate./Page 1C CAREFUL WHERE YOU CUT: School zone An influential state legislator wants to protect funds for education./Page 3A OPINION: The idea of bringing a community pharmacy to Citrus County is a worthwhile endeavor that deserves the full support of the community. 0 6 EDITORIAL, PAGE 10A. GREECE FIRES: Under control Weather finally cooperates with Greek firefighters. Nearly 500,000 acres .were consumed. ,Page 12A Football fans Read up on all the plans and games for your favorite local teams./Friday WHAT'S ONLINE: Medical directory Go to Chronicleonline. @com and click to the Medical Directory to find a local doctor, med. ical news, and a medical glossary. Annie's Mailbox .... . . 5C Comics . .. . . . . . 6C Crossword ......... ... 5C Editorial . . . . . 10A Entertainment.. . . . ..6B Horoscope......... .. 6C Lottery Payouts ........ 6B Movies ......... . . . 6C Obituaries ........... 7A Stocks ............... 8A Three Sections I 1111151 lllll78112 1111 Ex-assistant fires back Tom Dick says county lodged false allegations, ruined his reputation; plans to seek retribution TERRY WITT terrywitt@chronicleonline.com Chronicle Former assistant county administra- tor Tom Dick wrote Wednesday he has, no choice now but to legally retaliate for the harm done to him by what he considers the "false, malicious and stig- matizing" allegations used by County Administrator June Fisher to fire him. In a written statement. Dick said he has exhausted his options as a former employee of the county to challenge his June 4 termination, but he will use the allegations lodged against him by Fisher as a foundation "for future legal another venue, but has indicated in actions" in another venue, previous interviews that a lawsuit "My reputation, character and good would be filed if his firing were allowed standing in this community to stand. have been severely damaged i For full Fisher said she fired Dick for and my future employment letter conduct unbecoming a public opportunities are certainly written by employee, failure to perform severely and possibly Tom Dick : job duties, insubordination and irreparably compromised. PAGE 10A violating the state's Sunshine Therefore, I have no choice Law. But Dick .wrote it had but to seek retribution in another, and more to do with his continuing certainly more just venue," Dick wrote. association with former administrator He did not say what he meant by Please see FIRES/Page 5A Co#zoZs 6WE4fTr Esmf SBRIAN LaPETER/Chronicle ABOVE: Gonzo, the African spur thigh tortoise, is back at his Pine Ridge home after enjoying a few days of freedom. He broke free from his fenced-in area and roamed throughout the area. Gonzo was spotted by Martine Hugel and returned after his owner, Barbara Kursch, found out where he was. BELOW- Hugel found the tortoise about a half-mile from his home. 100-plus pound CRISTY LOFTIS cloftis@chronicleonline.com Chronicle t's not uncommon to see signs for lost dogs and cats in local neighbor- hoods. but this month people in Pine Ridge were asked to help find Gonzo the 100-pound, African spur thigh tortoise. Gonzo and his owner Barbara Kursch moved to the area from Maryland in the spring. She said the tor- toise was happy in his new warmer climate and seemed content in the fenced back- yard area that he roamed each day. / But on Aug.3, Gonzo escaped his home. Kursch typically has the fence covered with black material to prevent Gonzo from seeing out. She figures when a part of the black cov- erinig tore, the normally com- placent tortoise had ideas of grandeur. "Once he saw the great out- doors, he shredded through the wires like they were paper towels," Kursch said. tortoise gone wild found, returned home week later She noticed him missing that Monday evening and took to the streets in search of her pet, making signs and walking for hours. A day later, she came across some neighbors who said they had seen him the night before, but simply took pictures and figured he was an amazing part of local wildlife. The tortoise had slipped right past them. On Wednesday. Kursch's hopes were lifted momentar- ily when someone called to say they had seen the tor- toise on a nearby street the day before but didn't see the signs for the lost tortoise until it was too late. Unknown to Kursch, Martine Hugel was driving home from work in Ocala on Tuesday when she spotted Gonzo trying to cross County Road 491, about a half mile from Kursch's house. With the help of a man who stopped to help her, Hugel put the tortoise in the trunk of her car and took him to a local veterinarian. "I never thought in a mil- lion years that he had a home," Hugel said. She figured that maybe Gonzo had been hit by a car because of large dents on his shell. She later found out the dents are just the way the tortoise's shell grew. Amazingly, Hugel has owned African spur thighs in the past, and had a friend who works with the Homosassa Springs Wildlife State Park that she con- vinced to take Gonzo. "We've had a couple of them too and, phew ... they're a lot more to handle than people think," Hugel said. Rumors of Hugel's find spread fast enough that by the end of the week, Kursch learned where Gonzo was. Now the tortoise is back home and Kursch couldn't be happier. "Since then, I have written his phone number on his back," Kursch said. Gonzo has lived with Kursch the past 10 years. Please see GONZO'S/Page 5A w %M i NK wwim I- cca 0 CD 0~ u C'E ~aca Sheriff's candidate accused of cheating couple Action against Eyes P I. license pending MIKE WRIGHT mwright@chronicleonline.com Chronicle A judge asked a defense attorney Wednesday to hurry along the case of his client, a candidate for Citrus County sheriff, who faces charges that he cheated a Homosassa couple out of more than $10,000. "Big" Mike Eyes, 65, ofHernando, was arrested in February on a felony' charge of common law cheat and a misdemeanor charge of violation of a private investigator's license. Eyes, 4 Republican candidate for sheriff ini the 2008 race, ran for the same office in 2004 as a no-party affiliation candidate and finished third, well-behind Democrat winner Jeff Dawsy According to court records, Violetta Werling hired Eyes to expunge her husband, Ronald's, criminal record from a 2005 court case. The Werlings said they paid Eyes on several occasions and that Eyes did not get the record sealed. Eyes was in court Wednesday on a status conference. His attorney, Milan "Bo" Samargya, said he was conducting depositions on several witnesses, and said the case was labor intensive. "There are a lot of documents," Samargya said. Circuit Judge Richard "Ric" Howard urged Samargya to finish the depositions. "It's getting a little bit of age to it," Howard said, referring to Eyes' case. After the brief hearing, Eyes said he had done nothing wrong, but at the advice of his attorney, declined Please see CANDIDATE/Page 5A BRIAN LaPETER/Chronicle Mike Eyes, right, with his attorney Bo Samargya, .attended a status hearing Wednesday before Judge Ric Howard. Political HIGH 94 LOW 74 2A No. 242 'm A T IIH. S D AY, t iJ,kJNI' Z)" 20,oc IRS orvF)CHOI Out with the old, in with the new MAI THbW BEtK/Cnronicle SSweetbay Supermarket president and CEO Shelley Broader meets and greets Sweetbay employees Wednesday morning at the - Crystal River Sweetbay store. She, along with dozens of senior managers, visited the newly converted store that changed Wednesday from Kash n' Karry to Sweetbay. More than 100 Sweetbay employees participated in a ribbon-cutting ceremony at the front of the store where the new store signage was revealed. The Crystal River location is the final store in the state of -Florida, 101 in all, to convert to the new brand of Sweetbay. The official grand opening of the new store will be this Saturday. County BRIEFS Commission adds third meeting The Citrus County Commission will add a third regular meeting to its monthly schedule beginning in November. The commission voted 4-0 Tuesday to add a meeting for land-use issues, such as zoning changes. Commissioners normally meet at 1 p.m. the second and fourth Tuesday of the month in Invemess. The additional land-use meeting likely will start at 4 or 5 p.m.; Chairman Dennis Damato said he would hope those meetings would- n't run past 9 p.m. Commissioners noticed recently that land-use issues are forcing their regular meetings to run upwards of seven or eight hours. A meeting earlier this month did not conclude until after 10 p.m. Adding the third meeting will allow public hearings and work- shops devoted solely to land-use issues, they said. Attend EDC barbecue, win Bucs tickets The county's biggest barbecue blast is planned for Thursday, Sept. 20, and attendees have the added opportunity to win four tick- ets to a Tampa Bay Buccaneers win- ner will have the opportunity to select which group of tickets they want from one of five of the upcoming Bucs games. Tickets to the barbecue are $30 per person and can be obtained by calling 795-2000. Toddler safe after drowning scare A 2-year-old girl escaped a pos- sible drowning Sunday after being found in local waters, according to the Citrus County Sheriffs Office. At about 4 p.m., emergency workers were called to a swimming area in Potts Preserve near Turner Camp Road. The girl was using flotation devices earlier in the day, but later took them off while playing by the bank, Sheriff's spokes- woman Gail Tiemey said. Her mother found in her in the water shortly after not breathing. Using CPR, the girl was revived and breathing before emergency work- ers arrived, but was flown by Bayflight helicopter to St. Joseph's hospital for checks, Tierney said. Dunnellon man files for commission seat A Dunnellon man filed paper- work Tuesday to run for Citrus County Commission. . Joseph E. Ward opened a cam- paign account with the Citrus County Supervisor of Elections to run as a Republican in the county commission District 5 race in 2008. Ward may now collect and spend money on the campaign. County establishes pet-friendly shelter Citrus County Department of Public Safety Animal Services Division, in cooperation with Citrus County Emergency Management, established a pet friendly shelter in the event of a disaster. The pet friendly shelter will be at the Lecanto Primary School, 3790 W. Educational Path, Lecanto. Citrus County Animal Services will coordinate the housing of pets at this shelter. The shelter will provide e DdlPLPUSA ADDITIONAL SRI Ii $100 OFF W *Does not include prior sales. Good for sales of $750 or more. Sn A719 S. Otis Avenue LECANTO 1.3 miles East of Hwy. 491 on Hwy, 44 Lecanto Marion Co. Toll Free 746-3312 622-9717 800-728-1948 Ifs mW SamS housing for animals for dogs up to 80 pounds; domestic cats, and birds. No exotics, reptiles or aggres-' sive animals will be accepted. Pet owners will be responsible for providing food, any pet medica- tions and care for their animals While housed at the shelter. For information, or to be a volunteer, call 726-7660. From staff reports LEND us YOUR ,A -R .,Vo Participants c 1u1IIIII0 CITRUS C6uNTY (FL) CHRONICLE LOCAL 2A TiiURSDAY. AliGtis-i- 30, 2007 it' L~iM,~ -, ~ K) (T~ I-i / ~ ~ \ '.-. 3A THURSDAY AUGUST 30, 2007 CITRUS COUNTY CHRONICLE Im of&" mo a ft - C w 4 qba m a- OEM MON AN am p-4 40 due -. 4D 4m G- qC-4- C aeft- qw 4m 4o -4 -MM- 40aw- awq a o- -- ---..f. -%-- -"W Mb - 0 4b. -, bno1-d - a - a - - %-a Ak - a- - 0 - a - -0 - a- - S.. 0 - * a a - a S * a- 0 0 - a - -~-- - a - a - 46. am - -- a - -~d PP.- -0 - a - - -- -m- 4m a 40M Mfip-w 0~~'o W - Q- a 4- . 4b 4ow -a---ma 4d~ a WAN-W- 0 .0 - ."Copyrighted Material.- - o-- Syndicated Content o - anow comm -.m olb O-M- N 140 fa am mvS 1b v o - - a - a fm-im -Ivm qw 4 a-. mw i.qb fto 0 --~0- SAailable from Commercial News Provides iAv-aiiat le from Commercial NewsProviderL coa a 4 on- p 1A -ame -t - of S atio n, 4W4 ch n- e l deop n t namp es n ase on pa 1A aging u e a r n or mther spokesw deic Part Still, sin Cit is Cor adnSewi SAn editorial on Page 10A of Wednesday's edition, "River Watch could be model for Kings 4M 40 -ts unteers, marine public service the county. Because of a reporter's error, a story on page 1C of of Wednesday's edition, "Follow the leader," contained incorrect information. Kindergartner Lauren Ely and teacher Heatheri McLeod are from Inverness Primary School ab Clarifications n mBecause of a reporter's description, a story on page IA of Sunday's edition, "Tech advances help deputies," con- tained unclear information. The Sheriffs Office's previous heli- copter, the MD500E, bought when Charies Dean was sheriff, was equipped with thermal son for purchasing the MD500E said Citrus County Sheriffs spokeswoman Gail Tierney. Still, the Eurocopter's thermal imag- o An editorial on Page 1OA of Wednesday's edition, "River Watch could be model forrKings Bay," needs clarification. The Citrus County Sheriffs Office works with six marine patrol vol- unteers, marine public service Primary School. - - m Mwa .m 0 q04M *A 0mom 0. a o 40 m *MOM a 4w0- e mp 4M w0 41m *0.D qom so Al imUdw a thm G -a 0 - - a- - a - -a 41b a a~.- limb. a. - -Gob. ob 4M.0- - - 4- a q- S 0 cm- ~-..w - doM14 .- -N kw- l- 4. - mm a M410.9- 0 411w- - - 4W soe a mp. "mom --"W 0 40D dm ft a- - 4w-m -,41W a -a- ap, oftaab.mw- q ___ --woo a damo -.om.l - a. ~ - - a YMCA would be popular locally, study says CRUSTY LOFTIS cloftis@chronicleonline.com Chronicle The message was clear if you build it, they will come. A group of people working to bring a YMCA to Citrus County learned the results of a market study that assessed the interest of residents in having a YMCA locally After surveying hun- dreds of people, YMCA offi- cials are confident a YMCA is needed: "The basic message is over- whelming," YMCA of the Suncoast district executive director Sue Ball said, "This YMCA will be very big." The study projected thou- sands of people would make use of the family-orientated, non-profit facility. Several months ago, commu- nity members began working to bring a YMCA facility to Citrus County. The first step was to raise about $25,000 for a mar- ket feasibility study At a dinner sponsored by Crystal Motor Co. owners Steve and Jewel Lamb at the Crystal River Toy Barn Tuesday night, a representative from Four Square Market Research explained the results. "There are literally thou- sands of people waiting for a YMCA," Li Li said. Here's what people want and what the study findings showed Citrus County can support: A 44,000-square foot facili- ty with two to three acres of athletic fields. An indoor heated pool with water playground and smaller lap pool. First-class fitness area with workout equipment and indoor track Babysitting, exercise class- es and teen programs. Lounge with snack bar.. Health care prevention programs. Li considers the best place for a facility would be in Lecanto, so that it would be in a central location. Rates could range between $20 to $55 a month, with special rates for lower-income families. The next steps are for the steering committee to continue their work and add more peo- ple to the committee to build momentum and for the YMCA of the Suncoast to send a pro- gram director to Citrus County to begin programs similar to the YMCA camp at Rock Crusher Canyon this summer. They also need to begin the capital development campaign and look for temporary facili- ties to use so that YMCA estab- lishes a physical presence in the community. "We are beyond excited about this," Suncoast YMCA CEO G. Scott Goyer said. He estimates the building will cost $10 million, which doesn't include land. "We need the entire commu- nity's support," Goyer said. For more information about bringing a YMCA to Citrus, e- mail Sue Ball at sball@sun- coastymca.org or call 688-9622. p. law - 0 -410 al -Eno - *4 - a -" a - - a 'a- a.. -a a p -.a - -. - a C040ba.- -a ~ a- aa 0 a. a - - - - 0~- C a- S.. - a - - a - 0 - - a a - 0 a - oft. m - - - a - - --d -.m 4b 9 * S - a - a - - - a - a- a- s-a- - -~0 - a a a-- - * 'a *- a- S - - - a. -'a o - -a - a a - - a - a - S 0 0 0 - oSe -- a a- - wmA w w Idw - Q o - .40 -- q . -doolm. - dl - w * CITRUS COUNTY (FL) CHRONICLE NASA Continued from Page 1A launch, along with motorcycle racing, parachuting and fire- fighting, A 1991 law directs NASA to come up with a policy for alcohol testing of employees as recom- mended inde- pendent panel, Air Force Col. Richard E. Bachman Jr., com- mander and dean of the U.S. Air Force School of Aerospace. Medicine, declined comment on the internal review through a military spokesman. O'Connor's review looked back 20 years and involved inter- views with 90 NASA officials, astronauts and flight surgeons. Twenty flight surgeons signed an e-mail to O'Connor saying they have never seen any drunken astronauts before a launch or training jet flight O'Connor looked through 40,134 government and contrac- tor reports of mishaps and prob- lems dating backthrough 1984- many of them anonymous and none of them involved alcohol or drug abuse by astronauts. I Both O'Connor and Griffin said in their decades of work in the space program they have never seen a NASA employee report for duty under the influ- ence of alcohol. ',The safety chief toured crew quarters at space centers in both Houston and Cape Canaveral, as the astronauts were in quaran- tine days before launch of the shuttle Endeavour earlier this month. "I saw one half-empty bottle of tequila in one of the cupboards," Citrus County Sheriff For the RECORD Associated Press NASA administrator Michael Griffin, right, listens as Bryan O'Connor, a former astronaut and shuttle accident investigator, speaks during a news conference Wednesday at NASA headquar- ters in Washington to announce that in a review released report, no evidence was found that astronauts were drunk or had been drinking heavily before any space launch. O'Connor wrote. He also said beer and wine are available from non-flying astronauts mak- ing booze runs. Still, beer and wine consump- tion alco- hol use or alcohol-induced impairment" "There are reasonable safe- guards in place to prevent an impaired crew member from ever boarding a spacecraft," O'Connor said at the news con- ference. The careful look at astronaut health issues grew out of the scandal earlier this year involv- ing astronaut Lisa Nowak, accused of the assault and attempted kidnapping of a romantic rival. The first report, by the inde- pendent panel in July, said: "Interviews with both flight sur- geons and astronauts identified some episodes of heavy use of alcohol by astronauts in the immediate preflight period, which has led to safety con- cerns." One instance involved a shut- tle astronaut that a colleague claimed had had too much to drink; the colleague alerted oth- ers only after the launch was delayed because of mechanical problems. O'Connor, using the clues in that report, focused on three missions between 1990 and 1995. He spoke to at least two astro- nauts on each of those missions and the astronaut chiefs at the time and no one verified the claims. Griffin arid O'Connor said they were convinced no such thing happened. O'Connor said the independent panel was convey- ing information given to them under the protection of anonymity. The panel would not reveal its sources, he said. DUI arrest Kathleen Mary Williams, 46, 8254 W. Homosassa Trail, Homosassa, at 12:19 a.m. Monday on a Citrus County warrant charge for driving under the influence. $500. Arrests Sterling Whittman McLamore Jr., 22, 5133 W. San Jose St., Tampa, at 4 a.m. Sunday on a charge of leaving the scene of an accident with property damage. According to an arrest report, a deputy came across a 2007 black Toyota SUV on its side and half sub- merged in water in Homosassa. Less than a mile away, the deputy found McLamore and another man walking. The SUV passenger said McLamore said he wanted to show him the vehicle's capabilities. The man said the vehicle entered the right of way and then crashed into a ditch. The two exited through a driv- er side window and decided to walk to their motel. McLamore was also cited for careless driving. Bond $250. Jeremy Dahling, 25, 2433 E. North St., Inverness, at 5:46 p.m. Sunday on a Citrus County warrant charge for violation of probation in reference to original felony charges relating to burglary, criminal mischief and second-degree arson. No bond. Konrad Stahl, 83, and Marie Stahl, 83, both of 709 Desoto Ave., Inverness, at 5:39 p.m. Sunday on a retail theft charge. According to an arrest report, the couple tried to take candy, bras and cortisone cream from a store. Bond $250 each. Ty Robert Bartholomew, 38, 5831 W. Meadowpark Lane, Crystal River, at 11:51 p.m. Sunday on a ,driving with a suspended/revoked license charge. Bond $500. David Brian Cave, Jr., 25, 1105 Fort Clark Blvd., 1112, Gainesville, at 3:02 a.m. Friday on a Citrus County warrant charge for possession of 20 grams or less of marijuana and pos- session of drug paraphernalia. Cave was arrested in Alachua County. He also was charged with' failure to appear in reference to a felony charge of driving with a suspended license and possession of drug para- phemalia. No bond. Anton Lee Smith, 19, 7781 HellerAve., Dunnellon, at 11:20 a.m. Monday on Citrus County warrant charges for two counts of burglary of a residence, fraud/illegal use of a credit card and petit theft. Smith was arrested while in the Marion County jail. Bond $10,000. Robert Emory Cheshire, 30, 41 Juniper Trail, Ocala, at 3:15 p.m. Friday on a Citrus County warrant charge for violation of probation in reference to conspiring to commit robbery. The arrest was made while Cheshire was in the Marion County jail. No bond. Thomas Jason Turner, 25, 9770 W. Arms Drive, Crystal River, at 11:30 a.m. Monday on a Pasco County warrant charge in reference to violation of probation for felony grand theft. No bond. Antonio Lee Dorman, 28, 18 S. Tyler St., Beverly Hills, at 2 p.m. Monday on a Citrus County warrant charge in reference to worthless checks. Bond $1,000. Terri Lynn Klein, 37, 222 N. Hebrides Point, Inverness, at 4:43 p.m. Monday on a Citrus County warrant charge in reference to fail- ure to appear for the felony charge of forgery. No bond. Nadine Jane Foley, 36, 4023 S. Rainbow Drive, Inverness, at 10:41 p.m. Monday on a. Citrus County warrant charge in reference to a worthless check. Bond $150. Jeromy Stephan Schiedenhelm, 23, 1823 S. Morring Drive, Inverness, at 1:28 a.m. Tuesday on a charge of pos- session of cocaine with intent to sell or deliver. He was originally pulled over because of a faulty tag light. Deputies found about 8 grams of cocaine during the course of the arrest. Bond $10,000. Also arrested was Bryce Oneil Parris, 24, 311 Mill St., Wildwood, at 1:28 a.m. Tuesday on a charge of possession of cocaine with intent to sell or deliv- er. Parris was in the passenger seat. Bond $10,000. Thomas Joseph Lowther, 34, 6029 S. Lima Ave., Homosassa, at 6:30 a.m. Tuesday on a Citrus County warrant charge for violation of probation in reference to an origi- nal charge of fraud. No bond. Crystal River Police DUI arrest E Jeremy Ryan Cates, 21, 9415 W. Wisconsin Court, Crystal River, at 3:18 a.m. Sunday on charges of driv- ing under the influence and violating restrictions placed on a driver license. According to an arrest report, Cates had fallen asleep in a Taco Bell drive- through lane. He failed field sobriety tests and had a blood alcohol con- centration level of 0.176 percent and 0.169 percent. The legal limit is 0.080 percent. Bond $750. Other arrest Surleta Reshell McMahon, 23, 451 N. Sams Point, Crystal River, at 7:39 p.m. Monday on charges of grand theft and credit card fraud. According to an arrest report, McMahon worked at a store and had used gift cards to illegally take about $800 worth of merchandise on sepa- rate occasions. Bond $2,500. State probation William Robert Peel, 42, 2850 N. CredeAve., Lot 43, Crystal River, at 10:06 a.m. Monday on a violation of probation charge. Peel was serv- ing one year of probation for felony charges of battery and driving with a suspended/revoked license. No bond. William Robert Post, 36, 4100 S. Spaniel Trail, Inverness, at 10:15 a.m. Monday on a violation of pro- bation charge. Post was serving five years of probation for grand theft. On Saturday, he was arrested for assault, which violated his proba- tion. No bond. Duane Terrell Holston, 34, 9330 Fort Gulf Island Trail 10, Crystal River, at 10:30 a.m. Monday on a charge of violation of probation. Holston was serving two years of community control in reference to burglary of a structure and trespass- ing. According to an arrest report, he was unsuccessful in a treatment program and officials found alcohol in his urine. No bond. inmin" -1-1C ITR LIS,."- C 0U NT Y I" as -Em 4ft GNM GEM G ftmmmm ftwdm qmmm qm 400 Qp 0 41M am - 0 ~ U -Copyrighted Material Syndicated Content "- ,.. available from Commercial News Providers mUxpjq 0*A ~j. -.. - ~ ~ - ~ -.- ~ai; ~: - - ~mw ~ ~ 0 0 S . a, 44moq 4o~fm 10W- -M 4 Imp-~ qb0 -S - 0 0 0 ~, 0 0 0 *0 - 0 6 -.~ 0 - 0 0~** 0 0 * * * . . * * K * S 0. m. - 0 - - 0- 6 S -~ 0 0 0 :~'~ -~ -Or. S m 0 ~ MOM-' qmo0v 0 : due 0. aim ="V Gww- GOP oz9 0 S I 4w age -H nONICL-lne.com Where to find us: -, Meadowcrest 44~ I office .. l BantHwy. 1624 N. orvell BryaHwy. Meadowrest Dunkenfield I Blvd., Crystal n Ave. -*-Cannondale Dr. River, FL 34429 A \ Meadowcrest N Blvd. 3 IInverness S Courthouse office Tompkins St. square U7 Cn 106 W. Main 44 d*jft I HURSDAY, AWGUST nU, .4VV / -^1"-- 111, k--/ E kAi TTAiTRSDAY- AuGUST 30. 2007 THURSDAY, AUGUST 30, 2007 A, CITRuS CouNTY (FL) CHRONICLE SIRER Chief Assistant County FIRES Attorney Michele Lieberman. Lieberman had contacted the Continued from Page 1A Attorney General's office by telephone and talked to an Richard Wesch, whom Fisher attorney who concurred with replaced, her belief that Dick's phone The administrative charges calls to commissioners amount- are based on Dick's decision to ed to polling the board. Polling contact county commissioners board members in a de facto by telephone during an April 30 meeting would be illegal. staff meeting. He managed to But Dick wrote that the reach three commissioners and record from the post-determina- asked them for their opinion tion hearing also includes about whether he should Fisher's stigmatizing and false release bid requests for financ- allegation that he had been ing the Emergency Operations under the influence of alcohol Center ahead of the May 8 coun- at work He wrote that Fisher ty commission meeting. He made the allegation in notes she failed to reach two other com- placed in his personnel file, and missioners. the allegation surfaced at the Fisher said she had told him post hearing. not to release the bids ahead of Dick wrote that Battista's the county commission meeting decision to uphold his- firing and his decision to do so violat- also ignored testimony by ed her orders, which was insub- Cathy Taylor, director of the ordination. She said he also county's office of management placed commissioners at risk of and budget, that he had not vio- violating the Sunshine Law by lated the county policy by making private calls to them in releasing the bid requests for the meeting. EOC financing ahead of the Dick wrote he was within his May 8 commission meeting. rights to make the calls as act- "One must again ask 'Why?'" ing county administrator Dick wrote. "The logical Fisher was out of town at the answer once again because time, and Dick he and was in charge of Administra- county govern- How can this tor Fisher (as ment in her well as two absence. The be considered commission- State Attorney ers) are investigated the such a grievous aligned in allegations their dislike against Dick and offense, as she of the former determined that ,, c o u nty the calls to com- now asserts? administra- missioners did tor, with not violate the Tom Dick whom I con- state's Sunshine in his letter regarding tinue to asso- Law. his firing be upheld. ciate .as a for- The Sunshine mer boss and Law prohibits two members of a publicly elected or appointed board from meeting behind closed doors to discuss public business that might come before them later. Dick's written statement on Wednesday was a response to Tuesday's report from County Administrator Robert Battista upholding Fisher's decision to fire him. Battista served as hearing officer in Fisher's place at a post-determination hearing where Dick appealed his termination., Fisher had stepped down as hearing officer when she was accused of being biased. But Dick said Battista wasn't objec- tive, either In his statement, Dick wrote that Battista had given Fisher legal advice from April 30 to May 14 as she formu- lated the allegations that led to his termination. Battista is chief legal counsel to the county commission and also advises Fisher on legal matters, but Dick wrote that his "direct involvement" in coun- seling Fisher while she authored the allegations- against him prevented Battista from rendering a fair and unbi- ased decision after the hearing. "Based upon his direct involvement, he could not real- istically be expected to render a fair and unbiased decision, as he would be compelled, in essence, to acknowledge that his suspicion that I had violated the Sunshine Law was unfounded. Nonetheless, I still retained a sliver of hope that the injustice imposed upon me Should be rectified," Dick wrote. Dick went on to write that the county should have been relieved to find out there was no Sunshine Law violation, but he said Fisher and Battista ignored the State Attorney's findings and placed more weight on the research done by longtime friend." Dick wrote that Battista refused to acknowledge in his report that political "currents" exist that led to his firing, and noted that he failed to call sen- ior staff members to support the allegation. Dick noted he didn't call senior staff members to testify to protect them from potential retaliation. During the hearing, Dick wrote it was revealed that two senior staff members, Nancy Williams and Susan Jackson, were removed from their positions because of their continuing communica- tions with Wesch. Dick wrote that Battista also ignored the fact that after he released the EOC bid requests, Fisher had plenty of time to recall the documents if she thought a violation of county policy had occurred, but Dick said she made no attempt to recall the bid documents and gave no credible explanation at the hearing about why she made no attempt to cancel the bid requests. "How can this be considered such a grievous offense, as she now asserts?" Dick wrote. Dick wrote that he believes Fisher and Battista believed the initial allegations, includ- ing the accusation that he was under the influence of alcohol at work, would have led to a quiet resignation. "Because these allegations did not lead to a resignation, they must now ignore evidence and logical conclusions to fos- ter their plan to remove me from my position," Dick wrote. "This was done under the guise of policy and statutory viola- tions, which are merely a pre- text to the real motive name- ly, because of my association with the former county admin- istrator, in violation of my con- stitutional rights under the First Amendment" r INSIDE 7c7 F SEARS Free 1 Hearing Aid Repairs -r. .I all makes and models' -oMc rpronly, must pre nopon Crystal River Mall omcr..nu.p.. pon 1 795-1484 Battery Sale i l- d-Paddock Mall, Ocala 89 237-1665 c ( Limft 2 packs) 90DAS OPAYENTS- NOINTEREST Masbm I - - 4 0041 4pqw4@ ob CANDIDATE Continued from Page 1A to say more. Samargya, coincidentally, was the prosecutor in the Werling criminal case and dropped the charges against Werling. He said he requested an informal opin- ion from the Florida Bar that allows him to now represent Eyes as his defense attorney. The case against Eyes began in April 2006. The Werlings told Citrus County Sheriff's Office investigators that they paid Eyes several thousand dollars over five months to hire attorneys who would expunge Ronald Werling's criminal record. They said Eyes continued to demand payments while showing noth- ing in return. Records show that Eyes paid Inverness attorney Mark Rodriguez $500 to expunge the records and that the paperwork was being processed. The Florida Department of Agriculture and Consumer Services also investigated Eyes regarding his private investiga- tor's license. It said that Eyes sent a-letter to the Werlings in June 2006 threatening to take them to court if they didn't pay $16,438. "It should be noted that none of the invoices (even combined) come to anywhere near that amount," the department report states. The state investigator reviewed the taped conversa- tion. It said Eyes told the Werlings he would lose his state license if he waived his fee. "It is apparent from the state- ments made by Eyes to the Werlings that he was attempting to use the Division of Licensing as leverage in attempt to collect more monies from them," the report states. Action against Eyes' private investigator license is pending, according to the Division of Licensing Web page. 0~~'~~PRESEWT~HIS COUPON* LOOK WHAT'S LURKING to the cashier and got IN THE GRASS ... AND LOOKING FOR A NEW HOME INSIDE YOUR DOG? any size package of Safe-GuardO canine Deworme CONSUM.MER Kra= Sofo od tto e ousCAN (oMnY mlbe p da o uftnkei Ctamynnot Z: =yM feni . UNSTOF ONE COUPON PER HOUSEHOLDS, ONE COUPON PER NUEQINEt 0 dmMLER.loooiotww W mum molo ed be shm m qaufegS(ANaYt -I Eghyddo 12/31/2007 CkS6760705 o 21784 47001 8 5.41 %: * 00* APY 8 month $10,000 minimum balance Great rate. Extra peace of mind. Double your Open World's 8-Month Certificate IDIC insurance, of Deposit (CD) and receive a VoIC terrific return on your money until Just ask. April 2008-guaranteed.. _^~- --', Institution Term APY WORLD 8 Months 5.41% SunTrust 6 Months 2.55% Bank of America 8 Months 2.74% AmSouth 6 Months 3.00% INSURED re 1GUM MAXMEO 07/OSA4 * Annual Percentage Yield (APY) and 5.27% interest rate are effective as of date of publication and may change thereafter. Penalty for early withdrawal. $10,000 minimum balance; $250,000 maximum per household. Personal accounts only. **APY comparison based on independent shopping survey of other institutions' term accounts' APYs as of 08/17/07. 2007 World Savings N4768-30FW GONZO'S ' Continued from Page 1A Each day, Gonzo starts "patrolling" the back yard around noon. He paces along the fence at a quick pace and searches for grassy patches-to munch on. Gonzo has a pronounced slope on his back and a couple of divots. Kursch calls him a funny tortoise. He likes to walk so he across her feet " and doesn't just like his fruits and vegetables wanted' unless they .'"0 are fresh. He to get eats about five an' pounds of food out and each day. Kale see the is his favorite. see Gonzo does sites. not fit the stereotype of a slow creature, but rather can Barbara get up to about Kursb c, 5 mph. about Gonzo's,. Gonzo is not escape. Kursch's only unusual pet She also has 'a blind iguana, a bearded drag- on and large birds. While the tortoise's fence is now much more secured, Kursch is considering getting Gonzo implanted with a pet microchip in the future. For now, Kursch's phone number is written on the shell: "Well, you know he was new in the area," Kursch said, "so. he just wanted to get out and see the sites." WEEKLY LINEUP See what local houses of worship plan to do for the week in the Religion sec- tion./Saturdays SOCKET WITH & SUPPLEMENT ON SCOOTERS OR POWER WHEELCHAIRS SIf You Qualify We Carry All Home Medical Equipment Including Hospital Beds & Wheelchairs' Quality Mobility,. Service Sales Rentals Repairs, 599 SE Suncoast Blvd., Crystal River 564-1414 Family Owned & Operated 1 C'mon, get a great rate. CGHARE CITRUS COUNTY (FL) CHRONICLE AA THTJR~DAY AUGUST 30. 2007 Gimus COUNTY (FL) CHRONICLE k IN k 4 f*Il l 61 t470 0.1011 The Five Star Edition of the Carrier InfinityM p - - COUPON - - - 1 Turn to the E I Atl . ''-- . "'" 1" , *-. :S 1 I I experts; . iU Jill ?:e I / r COUPON i / ,i 'uallnS , Coupon Has No Cash Value Coupon Has No Cash Value Not Valid With Any Other Offers I I Not Valid With Any Other Offers Exp. 8/31/07 CCC Exp. 8/31/07 CCC - m- m mm m m m mmmR m mm im- i f EST State License CFC57025 State License CAC0082, OF Trfi (t A Coniditioning Inc7 FACTORY AUTHORIZED : DEALER - Infinity is a trademark of Carrier Corporation. See Factory Authorized dealer 1 for details on offer, guarantees and qualifying equipment. Five Star Edition is optional. Offer ends 8131107. Homeowner occupants only. *Based on total Turn t(). II r 1 b 0I I op, I I I I I I 12 ...AR PART & ABO QUARNT- I -J 268 ) .." 345642-01 o the Experts. 352=621=0707 352=795=9685 Toll Freem 800=897=2335 m I GA THURSDAY, AUGUST 30, 2007 14 CiTRus Cowry (FL) CHRoNjcj.F ,:4 rl 10 T:J --J ;-m raid ll lw " *M **W-'-lSt? RTI US OUN ( ) Rkhard Je4il dis at homw g. -s n,1&M 9- - - - -~ - ....a - - a - .~. - ~ ~ - *- "Copyrighted Material - SyndicatedContent SAvailable from Commercial News Providers" * - b- mI.b - 4m- dm,.01110 41 -mpmm 4 -m -i om b p-w - 41W d- -MOMI ..- oom. qmm- .qlo 419 mom qw m 0 0m 1INO qwm 0 Sb 4w S : - - -_- - - a * .- Ium- b w --.Mqomm --0- - _ a di 4* - 4p a-01- -Nn m 40-o %mb" ebm 41 .4 400in.- - qm.Ij 00 w PW 0~ --- -- - in- ~ - 0 --0 S * 0' dab - - b . -. t-wom GOO 0- - '~ - S ~ - 'U'.. .0 'U Obituaries- -- 4bo i Carl Denver Morgan Jr., 88, o O Inverness, died Tuesday, Aug. dgft WED 28, 2007, at the Hospice Care 4 0^ Unit at Citrus memorial Hospital in Inverness. He was born Dec. 12, 1923, to Carl and Ruth (Stanbaugh) S Morgan in Altoona, Pa. He moved to the area in 1986 from Norwich, Conn. . He retired from General S Dynamics/Electric Boat in S ... Groton, Conn., as a senior .. designer. SHe served our country in . the U.S. Army . J1 during World . _. ... War II and was an MP in Africa and Sicily He was a member of St. SMargaret's Epioscopal Church in Inverness, where he was active as an usher, eucharist S. lay minister and member of the men's club. He was also a mem- ber of the Coffee Club Bowlers SIW at Parkview Lanes in Holder S and the Windemere Pinochle Group. His enjoyments in life were traveling cross-country on his motorcycle, painting and being an avid Boston Red Sox fan. Survivors include his wife of * ~ 10 years, Esther (Hathaway) S- Morgan; three sons, Carl III S- - and wife Linda, David, and Stephen and wife Mary; a *- daughter-in-law, Wanda; two -- stepsons, Peter and wife .- Angela Jones and Gary; a step- S .- daughter, Pamela Kirk; a S brother, Harold; 10 grandchil- Carolyn Blanton, 69 OCALA Carolyn L. Blanton, 69, for- merly of Citrus County, died Sunday, Aug. 26, 2007, at her residence under the care of Hospice of Marion County. She was born Sept 29, 1937, to George and Virginia Settle Sr. She came to Citrus County in 1991 from Tampa before moving to Ocala. She was employed as an office manager in a physician's office in Tampa for many years. She was Protestant She enjoyed acrylic painting, fishing and watching and col- lecting hummingbirds. She was preceded in death by her husband, James R. Blanton Sr. on Sept. 27, 1997, and one sister, Willie Ezell. Survivors include a son, Randal and wife Anita Kay of Gulfport, Miss.; a daughter, Donna and husband Tim Singletary of Valrico; a brother, George and wife Anita Settle of Goodlettsville, Tenn.; three grandchildren, Tiffany and husband William Dale, James and Haley Singletary; two great-grandchildren, Colt and Kaiden Dale; and niece and nephews Marie and Ron Johnson. Chas. E. Davis Funeral Home with Crematory, Inverness. Carl Morgan Jr., 83 INVERNESS VASCIMVI WOODWORKING "Family Tradition" For Over 75 Years ANTIQUE RESTORATION REHNISNG Custom Furniture and US 19 Homosassa 628-9010 Cabinetry Made to Order vasciminiwoodworking.com r dren; 13 great-grandchildren; and several nephews and nieces. Chas E. Davis Funeral Home with Crematory, Inverness. Helen Sikula, 88 BEVERLY HILLS Helen J. Sikula, 88, Beverly Hills, died Sunday, Aug. 26, 2007, in Lecanto. She was born to William and Mary (Habada) Alexa. She was a native of New York, N.Y, and came here 20 years ago from Westbury, Long Island, N.Y. She was a retired head cafeteria cook for the Jericho School System in Long Island, N.Y. She was a member of Our Lady of Grace Catholic Church, Council of Catholic Women, and Knights of Columbus Ladies Auxiliary She enjoyed crocheting, knitting and playing bingo. She was preceded in death by her brother, Edward Alexa. Survivors include her hus- band of 67 years, John A. Sikula of Beverly Hills; two daughters, Barbarann and her husband Gordon Tolomeo of Rochester, N.Y., and Lorraine and her husband George Kirkpatrick of Beverly Hills; five grandchil- .dren; five great-grandchil- dren, and several nephews and nieces. Fero Funeral Home with Crematory, Beverly Hills. Myrna Wirthman, 71 INVERNESS Myrna Loy Wirthman, 71, Inverness, died Sunday, Aug. 26, 2007, at Citrus Memorial Health System. She was born Oct 13,1935, to Ashford and Susan Rich. She was a native of Cayman Brac, Cayman Islands, British West Indies, and came to this area in 1972 from Long Island, N.Y. She was a teller for Citizen's Bank for more than 20 years. She enjoyed her dogs and loved to cook, especially for large family get-togethers. She was Baptist. She was preceded in death by a brother, Kelvin Rich; and a sister, Larise Dilbert. Survivors include her hus- band of 47 years, George Wirthman of Inverness; two sis- ters, Flo and husband Mario Suarez of Inverness, and Pauline and husband Joris Poldervart, Cayman Brac, Cayman Islands; and many nieces and nephews. Chas. E. Davis Funeral Home with Crematory, Inverness. Funeral NOTICES Helen Sikula. Funeral Services for Helen J. Sikula will be at 11 a.m., Wednesday, Sept 5, 2007, at Fero Funeral Home 5955 N. Lecanto Hwy., Beverly Hills. Deacon Jim Family Owned Service 6irickland Funeral Home and Crematory Since 1962 352-795-2678 1901 SE HwY. 19 CRYSTAL RIVER, FL 34423 ,rm ----tn -FREE ESTIMATES! CALL TODAY QUALITY S LI726-4457 I AND SHUIIRUKb- i7ll'SALI oumrs:monF i.0 -50 -in mem ONE CALL, --ONE PRICE Reach 82,000 Homes & Businesses Examples: Transportation $77.95 Real Estate $97.95 Call for details (352) 563-5966 720903 Classifieds Working For You Affordable Elegance Majestic, Heirlooms, Laurel, & Princess Only $499 Majestic Heirlooms Laurel Princess Affordable upgrades for your EXISTING entryway in about an hour with an EntryPointdoortransformation! SMatching Sidelights and Transoms Schlage locks and hardware Hundreds of design options available through our custom program. Visit our showroom and pick the perfect doorglass for your home!2N . Nd v&1 b ihmy Wwtiem. 10 aEN"RYPOINT YORDOORu OUR GLASS Perry's Custom Glass & Doors 352-726-6125 2780 N. Florida Ave. (Hemando Plaza) Hemando, FL 13797 Airport Transportation 637-5909 Services $172.68 THURSDAY, AUG UST 30, 2007 7A , C C TY FL CHRONICLE Kennedy will conduct services. Burial will be in Fero Memorial Gardens Cemetery under the direction of Fero Funeral Home. Visitation will be Tuesday, Sept. 4 from 1 to 3 p.m. and 5 to - 7 p.m. Carl Morgan Jr. Memorial 9 services will be conducted Saturday, Sept. 1 at 11 a.m. from St. Margaret's Episcopal Church with Friar-. Eugene Reuman officiating. Inurnment will follow at a later date at Florida',- National Cemetery. There-. will be no calling hours at the funeral home. In lieu of;. flowers, memorials are' requested to Hospice of; Citrus Co., PO Box 641270, Beverly Hills 34464. Death ELSEWHERE Elizabeith Hay, 80 SCIENTIST Elizabeth D. Hay, 80, a path- breaking scientist at Harvard Medical School who conducted influential research into cell behavior and the complex material that surrounds and supports the cells in tissues, died Aug. 20 at a hospice in Wayland, Mass. She had can- cer. In 1975, Hay became the first female chairman of a preclini- cal department at Harvard Medical School, what is now the cell biology department She held the chairmanship for 18 years, becoming a mentor to hundreds of junior scientists, and served as the first female president of several profes- sional biology organizations. Starting in the 1950s, Hay harnessed new techniques in high-resolution microscopes and radioactive imaging devices to better understand a cell's extracellular matrix, or ECM. Previously, when viewed by light microscopes, this "con- nective tissue" that surrounds the cell was thought to be an amorphous mass. Elizabeth Dexter Hay was born April i 2, 1927, in St. Augustine, Fla., and raised in Melbourne, Fla., where her father was a surgeon and her mother was a nurse. Her par- ents opened the first hospital and first operating theater in Melbourne in what had been an abandoned hotel. Survivors include a sister. From wire reports C2ua. E. LauL Funeral Home With Crematory HOWARD TERRIAN, JR. Services: Thurs.,(9/6) 3:00pm- Chapel WILLIAM DOMBEY Call for information CARL MORGAN Call for information CAROLYN BLANTON Private CremationArrangements MYRNA WIRTHMAN Private CremationArrangements 726-8323 714712 0 qm 3A THURSDAY, AUGUST 30, 2007 MOST ACTIVE ($1 OR MORE) Name Vol (00) Last Chg HomeDp 489848 36.55 +1.50 CntwdFn 442236 19.81 +.50 FordM 296826 7.72 +.21 EMCCp 293997 19.63 +.54 Citigrp 287971 46.95 +.81 GAINERS (S2 OR MORE) Name Last Chg %Chg NISGrp 3.81 +.60 +18.7 Dycom 28.02 +3.77 +15.5 ChinSAir 63.00 +6.96 +12.4 ResrceCap 12.28 +1.27 +11.5 JoAnnStrs 24.73 +2.49 +11.2 LOSERS ($2 OR MORE) Name Last Chg %Chg Amrep 32.70 -3.03 -8.5 PikeBEec 18.66 -1.55 -7.7 Metrogas 4.50 -.30 -6.3 MetroPCSn28.30 -1.63 -5.4 ChesUtl 30.65 -1.60 -5.0 DIARY Advanced Declined Unchanged Total issues New Highs New Lows Volume 2870 470 68 3,408 13 47 2,774,499,787 MOST ACTIVE (51 OR MORE) Name Vol (00) Last Chg SPDR 1873261 146.54 +2.82 iShR2K nya 688771 78.56 +2.01 SP Fnd 498071 33.52 +.40 SP Engy 273164 68.96 +2.21 PrUShQQQ 270738 44.92 -2.63 GAINERS ($2 OR MORE) Name Last Chg %Chg RegeneRx 2.00 +.34 +20.4 Simulations 12.68 +1.78 +16.3 ParaG&S n 2.55 +.35 +15.9 PetroRes 2.58 +.24 +10.3 vivi n 3.98 +.35 +9.6 LOSERS (S2 OR MORE) Name Last Chg %Chg LehJYenwt 4.46 -.72 -13.9 CmstTotR 13.87 -1.27 -8.4 PhrmAth 5.36 -.44 -7.6 BFC Fncl 3.20 -.26 -7.5 PrUShSem n54.63 -3.87 -6.6 DIARY Advanced Declined Unchanged Total issues New Highs New Lows Volume 829 375 90 1,294 17 21 586,488,317 MOST ACTiVE (S1 OR MORE) Name Vol (00) Last Chg PwShsQQQ1071684 48.08 +1.34 Intel 800398 25.09 +1.13 SunMicro 692497 5.17 +.11 Microsoft 405442 28.59 +.66 Apple Inc 400017 134.08 +7.26 GAINERS (S2 OR MORE) Name Last Chg %Chg Silverstar 2.28 +.68 +42.5 InnoCrd nh 2.70 +.77 +39.9 AthrGnc 2.08 +.52 +33.3 SupTech 7.18 +1.48 +26.0 21Cenwt07 2.93 +.57 +24.2 LOSERS (52 OR MORE) Name Last Chg %Chg SourceFrg 2.74 -.87 -24.1 PDLBio 18.80 -4.80 -20.3 Anaren 14.02 -3.15 -18.3 TriadGty 16.20 -2.80 -14.7 Alsus n 4.33 -.67 -134 DIARY Advanced Declined Unchanged Total issues New Highs New Lows Volume 2.293 690 136 3,119 20 66 1,621,445,375 Here are.the 825 most active stocks on the New York Stock Exchange, 765 most acbve on the Nasdaq National Market and 116 most active on the American Stock Exchange Stocks in bold are worth at least $5 and changed 5 percent or more In price Underlining for 50 most active L on NYSE and Nasdaq and 25 most active on Amex. Tables show name, price and net change, and one to two additional fields rotate through mtne week, as follows * Div:: Price stock was trading at when exchange closed for the day Chg: Loss or gain for the day. No change indicated by .. 01, v.- Lm Crt C .,rn i -z I C.A" % 1'I Stock Footnotes: co PE greater than 99 dd Istle has b en called tor redempllon tis PE t ,E ,, 1. C, I company d New E week loa. dd Loss in laet 1i; nm s Con-Canyorrny listle ,T I Ac Ul '; or, fl American Excriange's Emerging Coirrpany Markeptao g Divdand' and sar- ..:u, i . Ings I in Cana.n dollars h lemporarv airmpi from Nasdaq capital and surplus lhsiri: { ,.. .' Squa flcailn n Stocn was a raw Isau. in the lasi year Thna 5-wae&. high and Io tiguras date only from the beginning of trading p. Praterred tfocu, asue. p Pralieinciea p. Holder owes Installmeria of purchase prke q Cloiad-and rrulual tura u no PE calculat- ad ri Ri 1to buy securthat s apecified prks. a Stock ar spla try at leait 20 percenri nam L" a wlhifin shalast year wl Trades eill be nelled when the 5lok a issued ad Wren das- M AClE L I -11 tritiuled tl WWrnafMT, lldwing a purceB ofa t a s u T New s .2-weio hir,. un r Un, A..Z1 Including more fian ne sacuily., ] Coripany in bankri'uplft oi r1ce.brhrlp oi Ibelngp ,;, "" reoiarilaze under irn banKirupicy la Appears Ir. from oft tir name "/n. .. * Dividend Footnotes: a Extra onndoend ware paid but are rno Irn-ludd b Annual israle i--Jl plus oca o Uquldating dividerd. e Arrm,junt dslared or pari in last 12 morr ns. I - Current annual rate. which was ieiaased Oy most recnt af dend airnounr.rnan I Sum of drymenda paid alter Baora .Fnl no regular rsle. i -S um ot oidarita paid ithlyar yaal paa Moal recent dividend a as omfed or defense k Deldarad or paid ths yaai a cumulative .A C La m 24 I. issue with dividenas In sarera re m Currant annual rate whkn was decreased by most .6 cow. 2 ba recent dividend announcement. p Initial divilderd annual rle not known yield not .4; ,OW6' 5 .1 shown i Declared or paid in preceding 12 months plus arock dividend I PaId in e.cK , appromae cash value on -d r A ated Pr Sales figures are uno l. rume: Une Associated Preas, Sales figures are unofficiaL STOKSOFLOAINTRS Name Div AT&T Inrc 1.42 BIclAm 2.56 CapCryBk .70 Ctjgrp 2.16 Disney .31 EKcdak .50 EmoonMbl 1.40 FPL Grp 1.64 FiaRc,ck .60 ForM ... GenElec 1.12 GnMolr 1.00 HomeDp .90 iniel .45 IBM 1.60 Lowes .32- McDnidc 1.00 YId PE Last 3.5 20 40.20 +1.41 +12.4 5.1 11 50.55 +.89 -5.3 2.2 18 32.18 +1.13 -8.8 4.6 10 46.95 +.81 -15.7 .9 16 33.89 +.69 +1.1 1.9 18 26.95 +.64 +4.5 1.6 12 85.23 +2.23 +11.2 2.8 17 58.69 +1.84 +7.8 1.0 26 62.29 +.60 +44.7 ... ... 7.72 +.21 +2.8 2.9 19 38.71 +.66 +4.0 3.3 9 30.59 +1.41 -.4 2.5 14 36.55 +1.50 -9.0 1.8 26 25.09 +1.13 +23.9 1.4 18 114.57 +2.57 +17.9 1.1 15 30.15 +1.17 -3.2 2.0 29 49.19 +.55 +11.0 YTD DIv YId PE Last Chg %Chg Microsoft .40 1.4 20 28.59 +.66 -4.3 Motorola .20 1.2 30 16.47 +.30 -19.9 Penney .80 1.2 13 66.17 +3.26 -14.5 ProgrssEn2.44 5.3 18 46.10 +1.15 -6.1 RegionsFn1.44 4.6 11 31.44 +.56 -15.9 SearsHldgs ... ... 15 145.61 +5.38 -13.3 SprintNex .10 .5 ... 19.15 +.52 +1.4 TimeWam .25 1.3 12 18.81 +.43 -13.6 UniFirst .15 .4 39 41.34 +1.45 +7.6 VerizonCml.62 3.8 20 42.23 +.71 +13.4 Wachovia 2.56 5.3 10 48.49 +.55 -14.9 WalMart .88 2.0 15 44.19 +.79 -4.3 Walgrn .38 .8 22 44.84 +1.24 -2.3 52-Week Net % YTD 52-wk High Low Name Last Chg Chg % Chg % Chg 14,021.95 11,273.49 Dow Jones Industrials 13,289.29 +247.44 +1.90 +6.63 +16.75 5487.05 4,142.01 Dow Jones Transportation 4,837.42 +104.44 +2.21 +6.08 +13.27 537.12 421.87 Dow Jones Utilities 487.87 +10.86 +2.28 +6.81 +11.60 10.238.25 8,218.99 NYSE Composite 9,508.92 +219.43 +2.36 +4.05 +13.36 2.398.11 1,116.16 Amex Index 2,216.05 +38.91 +1.79 +7.76 +9.64 2724.74 '2,139.57 Nasdaq Composite 2,563.16 +62.52 +2.50 +6.12 +17.27 1.555.90 1,290.93 S&P500 1,463.76 +31.40 +2.19 +3.21 +12.23 856.48 699.14 Russell 2000 787.32 +19.49 +2.54 -.04 +9.26 15730.39 12,898.38 DJ Wilshire 5000 14,734.31 +308.68 +2.14 +3.34 +12.88 N OOr Tkr "Name Last Chg ABB ABB ULd 24.20 +.92 ACE ACEUd 57.80 +1.07 AES AESCorp 18.09 +.33 AFL AFLAC 53.60 +1.50 ATG AGLRes 39.45 +1.15 AKS AKSteel 38.02 +1.97 AMR AMR 24.16 +.80 ASA ASA Ltd 58.10 +.80 T AT&TInc 40.20 +1.41 AUO AU Option 14.40 +.05 AXA AXA 40.05 +1.08 ABT Abtiab 51.49 +.70 ANF AberFitc .0679 +2.06 ABY AbiicFg 2.00 +.03 ACN Accmenre 40.24 +.64 ADX AdamsEx 14.41 +28 AAP AdvAuto 35.32 +1.07 AMD AMD 12.30 +.64 ASX AdvSemi 4.94 +.11 ARO Aeropstis 21.04 +.46 AET Aetna 50.50 +.93 A Agilent 35.62 +.95 AEM Agnicog 42.98 +1.59 AHO Ahold 12.72 +.51 APD AkProd 88.38 +1.95 AM ArTran 10.44 +.39 AL Alcan 97.78 +.29 ALU AlcatlLuc 10.92 +25 AA Alcoa 36.39 +1.03 ATI AllegTch 96.40 +3.90 AGN AllMergans 59.87 +1.48 ALE Allete 42.43 +.75 AWF AlliBGIbHl 12.86 +29 ACG AlIBlnor 8.14 +.03 AB AlliBeom 80.97 +57 AW AIdWaste 12.75 +27 ALL Allstate 54.93 +.60 AT AItN 67.90 +.60 ANR AlphaNRs 18.79 +.80 ALO Alpharma 23.20 +29 MO Alias 69.80 +.73 ACH AlChInas 67.37 +5.47 ASK AmbacF 62.12 +25 AEE Anneren 50.74 +1.20 AGP Amneigrp 30.56 +.38 AMX AMoriL 59.18 +1.63 AEO AEagleOs 25.50 +1.02 AEP AEP 44.66 -.19 AXP AmExa 5814 +79 AFR AFndRT 7.99 +.37 AIG AmIntGplf 66.13 +.90 ASD AmSlands 35.97 +1.43 CSP AmSIP3 11.19 +.14 AMT AmTower 39.12 +.48 ACF Amedtdi 17.10 +.37 APU Amedrigas 35.15 +.60 AMP Amerdpdse 61,08 +227 ABC AmeriBng 4727 +.12 APC Anadarko 48.21 +.90 ADI AnalgDev 36.62 +1.09 BUD Anheusr 48.33 +.65 NLY Annaly 13.85 +.18 AOC AonCorp 43.74 +.9688 APA Apache 75.48 +1.87 AIV Aptlnv 43.25 +.25 ABI ApplBio 31.48 +.15 WTR AquaAm 23.39 +.38 ILA Aqula 4.00 +.18 MT ArcelorMi 64.50 +3.19 ACI ArcohCoal 29.33 +24 ADM ArchDan 32.91 +.82 ASN ArchsnSm 58.41 +.32 ARW ArrowB 40.80 +.12 ASH Asland 59.50 +.97 AEC AsdEstat 13.39 +.10 AF AstoriaaF 2620 +1.03 AZN AstraZen 48.58 +.98 ATO ATMOS 27.98 +.45 AN AutoNatn 19.33 +.47 ADP AutoData 46.3 +.29 AZO AutoZone 121.35 +5.75 AV Avaya 16.74 +.17 AVP Avon 34.11 .+.44 BBT BB&TCp 39.67 +.73 BHP BHPBIIILt 62.42 +2.71 BJS BJSvcs 24.63 +.68 BJ BiJsWhls 35.71 +1.47 BMC BMCSIt 30.38 +.67 BP BPPLC 66.25 +1.43 BRT BRT 19.95 +.10 BHI BakrHu 82.19 +2.50 BLL BallCp 51.68 +.88 BBV BcOBVArg 23.05 +.67 BBD BBradesa s24.08 +.934 rTU Bncoltau 41.71 +1.32 STD BcoSnCH 18.28 +.62 BAC BkofAm 50.55 +.89 BK BkNYMel 39.98 +28 BKS BanesNob 35.54 +.27 BRL BairPhm 50.02 -.13 ABX BanickG 31.80 +.98 BOL BauschL 6321 +.14 BAX Baxter 52.76 +1.09 BTE BaytexEg 17.24 +.47 BSC BearSt 107.10 -1.32 BE BearingPi 5.69 +.14 BZH BeaSrHmlf 9.87 +,99- BDX BectDck 77,55 +.25 BEY BestBuy 43.97 +.85 BIG BIot 28.91 +2.61 BDK Blac 85.44 +2.20 BKH BIkHlllsCp 41.54 +1.42 BRF BkFL08 14.55 BX Blacbns 22.98 -.06 HRB BSkcHR 19.50 +.66 BBI Blockdt, 4.56 -.04 BLU BlueChp 5.94 +.18 BA Boeing 96.90 +1.25 BGP Borders 14.94 +.14 SAM BostBeer U49.65 +3.54 BXP BostProp 06.42 +2.47 BSX BostonSl 1285 +28 EAT Brinkers 28.65 -.11 BMY BrMiySq 29.01 +.26 BAM BrddlAsgs34.65 +.81 BPO BiMddPrs 22.84 +34 BWS BrwnShoes22.29 +.71 BC Brunswick 24.96 +.46 BNI BuiNSF 79.14 +.48 CA CAInc 24.92 +.45 CBG CBRBis 28.91 +.19 S C 0BSB 31.16 +1.05 CHG CH Engy 47.20 +.88 Cl CIGNAs 51.18 +1.00 CIT CirGp 30.93 +.47 CMS CMSEng 16.24 +.49 CSS CSSInds 35.80 +13.99 CSX CSX 41.50 +.70 CVS CVSCare 37.36 +.79 COG CabotOs 32.73 +1.18 ELY CallGolf 16.53 +26 CCJ Camecogs39.02 +1.42 CAM Cameron 79.03 +3.53 CPB CampSp 37.04 +.03 CNQ CdnNRsg 67.00 +2.85 COF CapOne 65.04 +129 CSE CapiSrca 17.37 +.07 CMOpB CapM plB 12.18. -.01 CAH CardnalHh 69.46 +.23 KMX CanrMaxs 22.99 +.58 CCL Carnival 45.08 +.61 CAT CaWlepar 75.04 +.88 CE Celanese 34.59 +.79 CLS Ceesticg 5.58 +.21 CX Cemex 30.84 +.77 CIG CemrlgpfS 185 +.89 CC CircCity 10.94 +.37 CMC CmclMtls 28.45 +.74 CXW CorrctCps 24.70 +.20 CNP CenterPnt 16.49 +.30 CDL CbdlBr 4.23 +.10 CYH CmtyHIt 34.11 +.86 CFC CntwdFn 1981 +50 CTX Centex d28.59 +.44 C C0gm 4695 +.81 RIO CVRD 47,93 +289 COV Covkllen n 40,05 +.10 CTL CnhyTal 47.70 +1,07 CZN CtzComm 14.44 +.38 RIO p CVROpf 40,54 +2.73 CCI CrwnCstle 36.54 +.65 CHSB ChepE 10.96 +63 CCU CleaiChan 3.69 +.85 CS CompSdl If 55.70 +.59 CCK CrownHold23.77 +10 CKP Chcpt 2724 +.37 CCO ClearCh 24.02 +.49 CNW Con-Way 48.35 +1.63 CMI Curnminss111.66 +2.35 CEM Chemnturas 9.39 +.37 CLF ClevCllfs 73.37 +3A47 CAG ConAgra 25.47 +.43 CY CypSem 24,08 +.75 CHK ChesEng 3171 -17 CLX Clorox 60.05 +.43 COP ConocPhil 81.77 +2.96 CVX Chevron 8670 +240 COH Coach 41.88 +.42 CNO Conseco 14.03 +.12 CHS Chicos 1753 +.83 CCE CocaCE 23.86 +.11 CNX ConsolEngy40.18 +1.32 DNP DNPSelct 10.44 -.02 LFC ChlnaLfes 72.85 +4.17 KO CocaCI 53.51 +.25 ED ConEd 46.06 +.98 DPL DPL 26.49 +.45 CHL ChlnaMble 65.72 +458 CDE Coeur 3.39 +.14 STZ ConstellA 23.91 +.47 DH DR Horton 15.03 +.28 SNP ChlnaPet 10939 +724 CL ColgPal 66.48 +1.14 CEG ConstellEn 84.20 +1.27 DTE DTE 48.12 +152 CHU ChlnaUnl 18.68 +1.50 PSS Collctvd 24.85 +.99 CAL CtlAirB 30.35 +.82 DAI DaimlrC 87.61 +43.27 CB Chubb 50.95 +1.08 CNB ColBgp 2120 +.56 CVG Cnvrgys 17.02 -.10 DHR Danaher 7624 42.46 CHT ChungTel 17.32 +.97 CMA Comedca 56.46 +.52 CBE Coopers 50.54 +2.63 DRI Darden 40.95 +80 CBB ChindBe 4.85 +.10 CBH CmcBNJ 36.47 +1.30 GLW Coming 2369 +75 DF DeanFdss 26.60 -10 bE 'DeeO 131.48 +5.03 DLM DealMnte 10.98 +.08 DAL DetaAlrn 17:36 +.01 DT ODeutTael 18.63 +.49 DDR DevDv 5085 +1.50 DVN DevonE .7478 +1.53 DO DIaOtfs 103.18 +4.64 DKS D2Sprt 64.30 +200 DOS Dillards d2420 -.14 .DTV DlrecTV 23.386 +.93 DFS Discover n 23.33 +.62 DIS Disney 33.89 +.869 D DomRes 86.52 +.74 UFS Domtar gf 7.93 +18 RRD DonlleyRR 35.70 +.30 DOV Dover 48.60 +1.28 DOW DowChm 42.46 +-76 DD DuPont 48.70 +.58 DUK DukeEgys 1824 +.63 DRE DukeRity 33.44 +1.08 DY Dycom 28.02 +3.77 DyN gy 8.15 +29 EMC M 1963 +54 BME EMCORs 30.83 +.07 EOG EOGRes 66.72 +1.02 EXP EagleMal 37.70 +.82 EMN EasClhm 66.55 +1.41 EK EKodak 26.95 +.64 EV EatnVan 37.34 -.07 ECL Ecolab 41.44 +1.00 EIX EdisonInt 53.98 +1.86 AGE Edwards 83.05 +.73 EP EIPasoCp 16.00 +.49 ELN Elan 19.02 +.16 EDS EDS 22.95 +28 EQ Embarq 6125 +2.32 ERJ EBrsAero 4425 +2.68 EMR EmersnBs 48.25 +1.35 EDE EmpDist 23.10 +.50 EEP EnbrEPtrs 51.10 +.12 ECA EnCana 58.65 +124 ELE Endesa 54.59 +.58 NPO EnPro 41.82 -+1.33 ESV ENSCO 57.99 +1.3 ETR Entergy 102.92 +3.68 EFX Equifax 38.40 +.16 ENN Eqtylnn 2235 +.25 EQR EqtyRsd 39.36 +81 EL Estee.dr 41.63 +.35 ETH EthanAl 33.09 +1.47 EXC Exelon 71.19 +2.02 XOM EmxxonMbl 8523 +223 FPL FPLGrp 58.69 +1.84 P00 Faalrliyolr 28.31 +1.37 FDO F .yDlr 2.31 .+1.37 FNM FannleMlf 65.76 +2.19 FDX FedExCp 109.92 +2.14 FSS FedSlgnl 15.66 +.63 Fll Fedlnvst 34.51 +.59. FOP Ferelgs 22.75 +.47 FOE Farte 1959 +.41A FNF FKiNFn d17.93 +.06 FDC FrstDatas 32.73 +27 FF FstFlFd 12.56 +23 FHN Fsatorizon 29.69 +.83 FFA RFTrFd 1721 +.19 FE FirstErigy 61.22 +1.64 FRK FlRaRodk 6229 +.60 FLR Ruor 12339 +423 FMX FEMSAs 34.58 +50 FL FootLud 16.77 +.57 F FordM 772 +?1 FRX ForeoLab 37.51 +.75 FO FortuneBr 82.09 +1.72 FCL Fd oal 33.40 +.08 BEN Frankes 130.13 +4.71 FRE FredMac 63.25 +2.05 FCX FMCG 85.10 +3.06 FMT Fremontif 4.24 +.23 FBR FdedBR 4.56 +.16 FrO FronteOII 39.89 +229 FRO Frontline 46.13 +1.73 GMT GATX 43.33 +1.38 GAB GabelliET 9.32 +.16 GRX GabHthW 8.70 -.11 GUT GabUtil 9.38 -.01 GFA Gaisan 24.45 -.64 AJG Galaghr 29.56 +.05 GME GameStop s49.64 +322 GCI Gannett 47.73 +.63 GPS Gap. 18.67 +.60 GTW Gateway 187 +02 DNA Ganentch 73.56 +.58 BGC GnCable 56.57 +.57 GD GenDynam 7825 +1.80 GE GenElec 3871 +66 GGP GnGrlhPrp 47.92 +1.15 GIS GenMlls 56.54 +.38 GM GnMotr 3059 +141 GNW Genworth 29.31 +.69 GPU GaPw8-44 25.20 +.10 GNA Gerdaug 11.87 +.32 GGB Gecdau 22.74 +.89 GSK GlaxoSKIn 51.60 +.37 GSF GlbalSFe 69.20 +2.61 IKOSA MpdER IC A NO M l.91 4.02 SOLTSCTKE .GFI GoldFUd 14.97 +.53 GG Gxldcpg 23.27 +M3 GS GoldmanS 173.72 +2.77 GR Goodrich 62.91 +2.00 GT Goodyear 27.83 +.92 GTI Grfech 16.91 +.91 GVA GrsnteC 53.37 +2.77 GRP GantPrde 54.40 +2.03 GXP GthalnEn 28.39 +.602 GFF Gdffon 15.55 +.47 TV GpTelevisa 25.40 +1.04 GSH GuangRy 39.72 +1.65 HRP HRPTPrip 9.52 +20 HAL Haldbrin 33.71 +85 JHS HanJS 13.65 PDT HanPtDv2 10.62 +.09 HBI Hanestrd n 29.02 +.98 THG Hanovedlns 43.15 +1.06 HOG HadreyD 54.42 +1.33 HMY HamionyG 9.14 +.18 HET HairahE 85.50 +.50 HIG HartfdFn 88.78 +.91 HAS Hasbro 28.53 +.45 HE HawaifB 20.99 +.48 HOP HthCrPr 2922 +1.14 HCN HtICrRErIT 39.24 +1.14 HMA HIltMgts 6.82 +.04 HR HthcrRlty 24.16 +.59 HL HedaM 7.55 +.16 HNZ Heinz 44.83 +.56 OTE HellnTel 16.20 +20 HPC Hercules 20.93 +.39 HES Hess 59.35 +1.82 HPO HewletP 4842 +1.54 HIW HighwdPip 34.25 +1.33 HLT Hiton 45.50 +.16 HD HomeDp 3655 +150 HON HonWtIlntl 57.00 +1.41 HPT HospPT 38.49 +1.20 HST HostHodt 21.86 +.71 HOV HovnanE dO10.97 +.51 HUM Htynana 64.60 +.45 HUN- Huntsinam-. 25.60 +18 lAG IAMGId9g 6.78 -.03 IBN ICICI Bk 42.38 +.48 EWZ iShBrazil 59.34 +249 EWQ lShFrance 36.09 +1.13 EWH IShHK 18.06 +.61 EWJ iShJacan 1386 +13 EWY IShKor 63.12 +3.57 EWM iShMalv sita 11.12 +.32 EWS IShSIng 13.44 +.79 EWD iShSweden 34.38 +1.32 EWT iShTaiwan 15.62 +.57 FX IS hChtln25148.09 +739 IVV iShSP500 146.95 +2.97 EEM iShEmMkt 131.25 +800 EFA iShEAFE 77.61 +1.74 IYR iShREst 72.30 +1.85 IA iShDJBk(r 49.19 +.94 UR iShSPSmnl 68.41 +1.74 SR iSlar 35.10 +.57 rT IT7corp 64.79 +2.16 IDA IWacop 3229 +.54 lAR Idesi n 33.62 -.50 I1W ITW 57.66 +1.60 IMN Imation 28.87 +24 1MB Indymac 23.22 +.33 IPX Infineon 14.79 +.39 IR IngerRd 50.68 +1.59 IM IngrmM 19.36 +.10 TEG IntegrysE 50.75 +1.14 ICE IntcntlEx 139.62 +4.72 IBM IBM 114.57 +2.57 ICO IntlCoal 4.06 +.17 IGT InOGame 37.33 +1.56 IP IntPap 34.40 +.60 IPG Intepublic 10.79 +.0W IRM IronMtns 27.88 +.67 JPM JPMoraCh 44.13 +53 The remainder of the NYSE list- ings ana all the American Stock Exchange listings can be lound on the next page. To EOUTSTOK UD Tkr "Name Last Chg FAX AbdAsPac 5.91 +.06 AE AdmRsc 22.39 +.49 ADH Adherxg .35 +.09 ANX Adventrx 2.19 +.01 ANO Anooraqg 2.88 -.13 BMD BirchMtg 1.84 +.04 JCS CommSys 11.07 +.49 COR CortexPh 1.74 -.01 DVW CovadCm .77 +.04 KRY Crystalxg 2.86 +.05 DIA DJIADiam132.74 +225 DAR Darling 8.06 +21 DNN DenisnMgn 8.70 +36 GAVIWS GrbEllRwt d21 EIV EVInMu2 14.02 ... -.05 EGO EldorGldg 4.95 +.06 HAC/WS HarbAcqwt .30 ECF EllswthFd 8.80 .. 04 FPU FlaPUti 12.00 +.06 HA HawHold 3.45 ... FTK oteks 3727-1.05 DMX I-Trax 323 +.03 FTK Floteh 37.27 -1.05 ISO ISCOlitn .25 +.06 FRH FrdmAcqn 10.20 +.05 EWA ISAstanya 27.78 +.95 FRG FrontrDg 7.91 +.39 EWG IShGernya 3176 +.77 GRS GamGldg 8.12 +.04 EWW iShMexnya5699 +142 GSX GascoEngy 2.04 -.09 OEF iShSPl00cbo68.68+1.43 GoS GoldStrg 3.13 +,04 TLT ISh20TB 88.22 -.24 GW GreyWolf 663 +17 IEF iSh7-10TBu83.70 -.32 SHY iShi-3TB 81.05 -.10 IWP iSRMCGnyal 10.48+2.29 IBB iShNqBio 78.33 +1.58 ICF IShC&SRInya8&.62+1.94 IWD iSRIKVnya83.26 +1.53 IWF iSR1KGnya58.58 +1.15 IWB ISRuslKnya79.02 +1.56 IWN iSR2KVnya76.45 +191 IWO iSR2KG nya82.76 +2.10 IWM iShR2Knya7856 +201 IWV iSRus3Knya84.57 +1.63 INS IntelgSys 3.35 +.05 IOC InterOlg 34.00 +1.76 IMA Invemss 46.78 +.45 JKA JKAcquls 5.75 -.01 LMC LundlnMs 10.75 +.76 GDX MktVGold 36.96 +1.25 MZT Matritchh .13 -.01 MRM Menimac 10.10 +.09' MDF MetroHlth 2.04 +.01 MNG Miramar 4.21 +.02 NAK NDynMng 10.00 -.02 NTO NOriong 4.64 +.08 NXG NthgtMg 3.02 +.02 OIH OilSvHT 17647 +597 BQI Ollsandsg 5.13 +25 ONT On2Tech 1.30 PRZ PalnCare .20 +.04 PDO PionDril 12,06 +.16 PGJ PwShChlna27.47 +1.32 PBW PwSCInEn 20.44 +.42 PXJ PSOilSI 25.77 +.93 PHO PwSWI 20.70 +.57 PJB PSh Bank n 22.25 +.60 PRW ProPhrmh .35 -.01 SDS PrUShS&P 55.56 -2.09 DDM ProUltDow 90.55 +2.60 DXD PrUIShDow 51.30 -1.71 MZZ PrUShMC 56.26 -2.75 OLD ProUltQQQ94.79 +4.94 QID PrUShQQQ44.92 -2.6 SSO ProUlSP 88.02 +3.04 SRS PrUShREn103.63 -527 SKF PrUShFn n 83.55 -3.46 TWM ProUSR2Kn69.29 -4.00 QSC Questcor .58 -.02 RKH RegBkHT 147.22 +2.06 RTK Rentech 2.36 +.01 RTH RetailHT 100.55 +324 RSP RdxSPEW 48.58 +.91 XHB SoddHome 2431 +84 KBE SpdrKbwBk52.39 +.80 KCE SpdrKwWCM81.91 +.92 KIE SpdrKbwlnsd5523 +1.13 RWR SpdrWilRE 76.64 +1.81 KRE SpdrKbwRB44.72 +.83 XRT .. FR-l 39.68 +1.18 SA Se.u ua ..22.04 +.44- SMH SemiHTr 37.35 +1,07 SPY SPDR 14654 +2.82 MDY SPMid 15551 +3,16 XLB SPMatls 3890 +75 XLV SPHIthC 3424 +25 XLP SPCnSt 26.92 +23 XLY SPConsum36.78 +1.12 XLE SPEnry 68.96 +2.21 XLF SPFnd 3352 +40 XU SPInds 3907 +90 XLK SP.Tech 2576 +.60 XLU SPUUil 3875 +75 SUF SulphCo 5.75 +.25 TGB Taseko 3.85 +.08 TMY TrsmrEx 1.91 -.06 UXG US Goldn 5.90 +.07 UNG USNGFdn34.79 -1.57 USO USOilFd 55.55 +1.52 Vrl VangTSM 145.17 +2.83 VWO VangEmg 92.58 +4.18 Request stocks or mutual funds by writing the Chronicle, Attn: Stock Requests, 1624 N Meadowcrest Blvd.. Crystal River. FL 34429: or pnoning 563-5660. For stocks, include the name ot01 the stock, its market and its ticker symbol For mutual funds. list the parent company and the exact name of Ine fund. NASDAQ NATIONAL AR Tkr "Name Last Chg ACMR ACMoore 18.75 +1.03 ACIW AClWwde 25.32 +.59 ADCT ADCTelr 17.59 +.78 AMIS AMISHId 10.16 +.03 ASTSF ASETst 11.40 +.11 ASML ASMLH d 2925 +.99 ATS1 ATSMed 1.54 -.06 ASTM Aastrom 1.12 -.01 ACTG AcaclaTc 14.22 +2.16 AIXD AccesslT 6.08 -23 LEND AccHmell 6.23 +.39 ARAY Accurayn 13.40 +.30 ACGY Acergy 25.56 +1.11 ATVI Activisn 18.88 +.49 ACTU Actuate 6.99 +.12 ACUS Aouspihere dl.35 -.05 ACXM Acxiom 24.46 +.18 ARXT AdamsResp37.40 +.44 ADPT Adaptec 3.64 +.03 ADBE AdobeSy 4225 +138 ADLR Adol&Cp 3.73 +.03 ADTN Adian 28.37 +.60 AATi AdvATech 920 +27 AEIS AdvEnld 16.21 +.31 ADVNA AdvantaAs 22.88 +.87 ADVNB AdvanlaBs 25.95 +.69 AFFX Affymelrx 22.62 -.07 AKAM AkamalT 32.47 +.97 ALSK AlaskCom 13.72 +28 ALDA Aldia 16.65 +.08 ALXN Alexion 58.40 +2.39 ALGN AllgnTech 22.55 -.17 ALKS Alkerm 16.69 +.31 MDRX Allscripts 22.76 +.32 ALT1 AltalrNano 3.15 -.06 ALTR AlteraCplf 23.46 +.77 ALVR Alvarion 11.65 +23 AMZN Amazon 79,05 +2.83 AMED Amedisyss 37.88 +.63 ABMC AmerBio 1.05 +.04 ACAS AmCapSr 40.25 +1,08 ACUI ACmdlLnn 24,41 +.86 AMMD AmerMed 18.44 +24 ASEI ASdE u71.00 +3.02 AMSC AmSupr 18.18 +.65 ARGN Amign 15.92 -.18 AMGN Amroen 50.19 +1.18 AMKR AmkorTIf 11.55 +.19 AMLN Amnytn 48.45 +.44 ANAD Anadlgc 16.18 +.92 ALOG An ogic 69.18 +1.18 ANLY Analysts 1.60 ANEN Anaren d14.02 -3.15 ANDE Anisons 47.09 +1.95 ANDW Andrew 14.08 +.07 ANPI Anglotchg 5.74 +.06 AAUK AngloAm 27.66 +.76 ANSS Ansyss 32.31 +1.50 APOL ApoloGrp 58.87 +1.54 AINV Apollolnv 21.67 +.50 AAPL Apple Inc 134.08 +726 APPB Applebees 24.85 +21 AMAT AcDMall 20.71 +57 AMCC AMCC 281 +.08 ARQL ArOule 821 +.14 ACGL ArchCap 71.16 +2.75 ARNA ArenaPhm 13.30 +.35 ARCC AresCap 16.00 +.35 ARIA AriadP 4.75 +29 ARBA AnribaInc 8.71 +.10 ABFS AlkBest 35.74 +.69 ARMHY ArmHid 8.58 +29 ARRS Anis 14.85 +.47 ARRO Anwint 45.08 +.10 ARTG AfTecht 3.08 +.03 ARUN AruibaNetn 18.84 -.76 ASIA Asialnfo 8.10 +20 AZPN AspenTech 12.30 +.50 ASBC AsscdBanc 2826 +.58 ASYT AsyslTchl 5.60 +.14 AGIX At Gnc 2.08 +52 ATHR Atheros 29.43 +129 ATML Atmel 526 +.06 VOXX Audvox 10.57 +26 ADSK Autodesk 45.14 +1.11 AUXL Auxilum 19.80 +.41 AVNX Avanex 1.69 +.03 AVNR AvanirP 2.13 +25 AVCI AviciSys 10.02 +.48 AWRE Aware 4.75 -.04 AXCA AxcanPh 19.51 +.47 ACLS Axcets d4.67 +.15 BEAV BEAero 37.97 +1.12 BEAS BEASyslf 11.91 +.12 BIDU Baldu.om 206.53 +6.84 BLP BallasrdPw 4.47 +.14 BKUNA BnkUtd 16.65 +20 RATE Bankrale 36.35 -125 BARE BarEscn 23.99 +.36 BCON BeaconPw 1.79 +.16 BECN BeacnRig 11.26 +20 BBGI BeasleyB 727 +.11 BEBE BebeSrs 14.07 +.36 BBBY BedBath 3457 +1.74 BIVN Bloenvisn 5.42 BIB Biogenldc 62.856 +78 BMRN BioMarn 21.30 +.71 BMET Biomet 45.88 +.01 BIOM Biomira 1.05 +.02 BPUR Biopure .65 +.02 BCSI BueCoa 83.40 2.90 NILE BlueNile 8381 +4.66 BPHX BluPhoenx 14.89 +94 BOBE BobEvn 3325 +.80 BONT BonTon 25.96 +2.19 BKHM Bookham 2.67 -.06 BORL Borland d4.46 +.07. BPFH BosPm 27.07 +.40 CELL Brightpnt 11.63 +.46 BRCM Broadcom 3284 +59 BRCD BrcdeCm 681 +.05 BRKL BrkneB 12.50 +.17 BRKS BrooksAuto 14.01 +.49 BUCY Bucyrus 61.14 -.33 BWLD BuffWWs 35.09 +1.18 BOBJ BusnObj 42.48 +1.52 CCBL C-COR 11,68 +,27 CHINA CDCCpA 8.28 +.22 CDWC CDWCorp 85.84 +57 CHRW CHRobins 48.77 +1.18 CMGI CMGI 150 +02 CNET CNET d7.13 +.11 CSGS CSGSys 23.48 +.41 CTCI CTCom 31.48 +.01 CTCM CTC Media 22.87 +.51 CVTX CVThera 9.67 +.22 CVBF CVBFnd 11.87 +.27 CACH Cache Inc 16.10 +.33 CDNS Cadence 21.36 +.55 CALM Cal-Maine 19.07 +.688 CAMD CalMlcr 3.65 +.03 CPKI CalPizzas 19.99 +.39 CLZR Candela d7.38 -.32 CCBG CapCtyBk 32.18 +1.13 CPST CpstnTrb 1.10 CECO CareerEd 29.19 -.40 CKEC Carmike 16.00 +24 CRZO Carizo 38.86 +1.35 CARV CarverBcp 16.31 +.31 CMRG CasualMal d10.07 +.32 CELG Celgene 61.80 +1.90 CEGE CllGens 3.88 +.17 CYCL CeniCom 9.22 +.31 CEDC CentEuro 4325 +2.38 CENT CenGardns12.35 +.16 CENX CentAI 47.35 +2.37 CEPH Cephin 73.34 +.35 CPHD Cepheld 18.43 +.55 CRNT CeragonN 16.15 +.59 CERN Cemer 56.55 +1.11 CHAP Chaparrals85.31 -.04 CHIC CharlRsse 17.35 +.39 CHRS ChnnSh 921 +50 CHTR CharlCm 2.73 +.11 CHKP ChkPoint 23.36 +.47 CKFR ChkFree 46.00 +.10 CAKE Cheesecake24.93 +.18 PLCE ChildPlclf 2850 +.82 CBAK ChinaBAK 4.65 -.15 CMED ChinaMed 34.60 +2.10 CPSL ChinaPrecn 3.68 -.01 CSUN ChkaSunnd5.12 +.07 IMOS ChIpOS 6.31 +.06 CHRD Chordntis 14.34 +.22 CHDN ChhilD 4956 +1.14 CIEN ClenaCpra 38.42 +1.83 CINF CinnFn 42.57 +1.00 CTAS Cintas 35.93 +.56 CRUS COims 6.67 +29 CSCO Cismco 31.00 +59 CRBC CiizRep 17.72 +24 CTXS CitixSylf 35.71 +.04 CLHB CleanH 45.22 +.71 CLWR CleawirAn 21.44 -.35 CKSW ClickSt 5.09 +.07 CCOI CogentC 25.12 +.61 COGT Cogent 14.20 +.43 CGNX Cognex 18.24 +.49 CTSH CogTech 72.10 +225 COGN Cognosg 39.83 +.54 CWTR ColdwbCrk 17.39 +.40 CMRO Comarco 5.62 -.08 CMCSA Comcasts 2573 +81 CMCSK Comcsos 2550 +70 CVLT CommVltn 19.04 +.70 CBSS CompsBc 68.10 +1.14 CCRT Comp~rd 2125 +29 CPWR Compuwre 7.94 +A7 COGO Comlchr 16.85 -.01 CMTL Comtech 41.83 +.88 CCUR ConcCmr 1.34 -.04 CNXT Conexant 108 CNMD Conmed 28.61 +.19 COCO CorinthC 13.97 +.43 EXBD CorpExc 68.97 +1.83, CORS CorusBkshd13.49 -.39 COST Cosico 61.31 +2.31 CMOS CredSys 2.68 +.08 CREE Creemnc 24.55 +.49 CROX Crocss 59.14 +1.85 XTXI Crosslexs 31.87 +.96 CTRP Ctripcoms 41.78 +1.19 CBST CublstPh 22.95 +.20 CYMI Cym 39.44 +568 CYTR CyRx 3.54 +,18 CYTO Cytogen 1.00 CYTC Cytycf 42.60 +.48 DADE DadeBeh 75.34 +.14 DAKT Daklrotics 27.38 +,90 DANKY Danka .85 +.00 TRAK DealrTrk 37.51 +.09 DECK DeckOut 93.24 +3.16 DELL DellInctf 27,86 +,97 DFC DetlaFnd 5.67 +.22 DPTR DtPr 15.25 +.77 DNDN Dndreon 7.99 +.13 XRAY Dentsply 39.00 +.64 DRIV DigRiver 43.42 +.12 DISCA DlscHaldA 24.77 +.86 DSCO DiscvLabs 236 +.11 DESC DislEnSy .97 -.03 DCEL DobsonCmul2.60 +.05 DLTR DIIrTree 40.97 +2.10 DBAN DressBam 17.73 +.48 DRYS DryShlps 66.72 +56A.42 DVAX Dynvax 4.01 +.01 ETFC trade 1455 +21 EBAY eBay 3345 +.54 ECIL ECITel 9.27 +.08 EZEM EZEM 14.96 -.06 EGLE Eagleulk 26.16 +.96 ELNK ErthUnk 7,65 +31 EWBC ESIWstBp 35.93 +.14 ELON Echlo 26.00 +1.65 DISH EchoStar 41.68 +.89 ECLP Edosys 23.18 +.93 EBHI EdBauern 8.71 +20 EDUC EduDv 6,62 -.08 ESIO ElectSd 2326 +.70 EGLS EIcgIs 225 +.00 ERTS EleArts 5236 +.86 EMKR Emcorelf 950 +.85 ENCY EncyslveP 1.86 +.07 ENDP EndoPhrm 32.11 +.79 ENER EngyConv 27.0 -1.82 ENTG Entegris 9.19 +.15 EPIC EpieSft 1328 +.23 EQIX Equinib 88.65 +2.79 ERIC EricsnTI 36.42 +124 EURX Eurandn 12.88 +.36 EEFT Euronet 26.04 +.25 ESLR EvrgrSr 8.1 +.41 EXAR Exar 1327 +.58 EXEL Exeoxis 11.18 +.23 XIDE ExldeTc 6.71 +.03 EXPE Expediah 29.11 -.03 EXPD ExpdInti 4452 +1.27 ESRX ExpScrips 53.45 +.09 EXTR ExtimNet 3.44 +.12 EZPW Ezcorps 12.23 +.18 FFIV F5Netwks 3520 +.59 FEIC FEI'Co 27.35 -.12 FUR FLIRSys 4823 +1.24 FALC FalconStor 11.11 +.44 FAST Fastenal 45.65 +1.43 FTWR FiberTowrn 3.71 +.09 RTB FifthThird d3627 +.91 FNSR Finlsarl 3.82 +.16 NL FinLtine 5,55 +.16 FCFS FslCashFn 2125 +.14 FCTR FslOhader u29.74 +.56 FMBI FMidBc 34.59 +.82 FNFG FslNiagara 14.31 +.56 FSLR FtSolarn 95.79 +4.83 FMER FslMefit 1927 +.59 FIRSV sev 46.63 +.20 FLML FlamerlT 9.60 +.31 FLEX Flextm 1118 +38 FLOW FlowInt 8.43 +.01 FMCN FocusMdIf 4028 +1.55 FRPT ForcePron 17.12 -.22 FORM FormFac 44.20 +.51 FOSL FossilInc 33.21 +1.03 FWLT FosteWhl 114.65 +4.47 FDRY FoundryN 17.78 .+.52 FBTX FmkBTX 9.54 +.21 FRED Fredsino 10.82 +.21 FTBK FmlFntdl 25.66 +.63 FTEK FuelTech 27.79 +1.18 FCEL FualCell 8.19 +38 FULT FutonFnd 14.79 +.39 GFTO GFIGrp 72.17 +3,.57 GRMIN Gamin 100.96 +4.58 GMST Gemstar 6.13 +.27 GNSS GenesMcr 7.71 +.13 GNTX Gentex 19.78 +.80 GENZ Genzyme 60.61 +1.64 GERN GeronCp 7.15 +.16 GIGA GigaTr 2.27 +.20 GIGM GIgaMed 12.92 +.11 GILD GileadSds 36.05 +.3 GLBL Globtlnd 23.53 +.28 GOOG Google 51288 +6.48 GBBK GrtBay 28.15 +.15 GMCR GreenMIs 34.43 +22 GYMB Gymbree 39.68 +.73 HLTH HLTH 14.14 +.42 HMNF HMNFn 29.48 +23 HAIN HainCelest 29.03 +.08 HANS HansenNat 44.66 +1.60 HUT Hagmonic 859 +24 HAYZ Hayeslm 427 +.19 HLEX HIhExt 29.36 +26 HTLD HritndEx 15.47 +.65 HSII HedrkSti 46.86 +.75 HERO HercOffsh 26.50 +.36 HIBB Hibbett 24.89 +1.33 HOKU HokuSci 9.03 -.04 HOLX Hologic 52.49 +.79 HMIN Homielnnsn29.0 +1.40 HSOA HomeSol 3.04 +.02 HOFF HoriznOlf 16.62 +.24 HOTT HotTopic 8.46 +.38 HUBG HubGroup 33.00 +.84 HCBK HudsCity 1426 +.42 HGSI HumGen 8.93 +.35 JBHT HunUB 28.42 +.43 HBAN HuntBnk 1725 +25 HTCH HutchT 22.88 +.69 IACI lACInter 2722 +.37 IFLO I-Flow 18.05 +.01 ICON IconixBr 20.46 +.07 IKAN Ikanos d5.86 +.02 ILMN lllumioa 4723 +.85 IMAX lmax Corp 4.71 +.38 IMCL Imlone 33.11 +1.43 IMMR Immersn 14.84 +.63 BLUD Immucor 32.78 +.43 IMMU Imunmd 1.98 +.02 INPC InPhonic 2.95 +.05 INCY Incyte 5.82 +31 IDEV IndevusPh 6.96 +.05 INFN Infineran 18.04 +.88 INSP InfoSpess 14.39 -.07 IFOX Infsssing 18.58 +.05 INFA Informat 13.68 +.22 INFY nfosysT 47.00 +1.84 INVC nnoCrdnh 2.70 +.77 NSIT night 23.90 +.80 INSU nsitTc 16.29 +.53 INSM nsmedh .60 -.02 IDTI ntgDv 15.45 +.27 INTC ntel 25.09 +1,13 IDCC00 intleg 23.57 +.50 INAP interNAP 14.05 +.06 ISCA ntlSpdw 47.34 +.48 ISIL ntersl 32.91 +1.32 IWOV ntenwmnf 12.91 -.07 IVAC Intevac 15.91 +1.28 INT Intuit 27.12 +.49 ISRG IntSurg 215.58 +9.60 SWIM Investools 12.00 +.20 ISBC InvBncp 14.01 +.48 IVGN Inviegn 78.00 +1.04 ISLN Islonnysn 10.16 +.50 ISIS Isis 1227 +.31 TRI Itron 83.49 +.23 IVAN IvanhoeEn 1.81 +.03 JASO JASolarn 32.85 +2.96 JDSU JDSUnlrs 14.37 +.37 JKHY JackHenry 25.78 +.38 JMBA Jamba 6.71 +.03 JRCC JamesRhl 4.35 -.14 JBLU JeIBtue 9,36 +.14 JOSB JosptBnk 30.03 +201 JOYG JoyGb 42893 -1.89 JNPR JnorNtwk 32.61 +.33 KLAC KLATnc 58.20 +1,58 KNXA Kenexa 28.95 +25 KNSY KnseyN 24.14 +.19 NITE Knghtlap 13.76 +.67 KOMG Kornag 32.10 KLIC Kultcke 8.19 +.27 KYPH Kyphon 66.90 +.51 LCAV LPAVas 35.09 -.53 JADE LJIntllf 6.84 +.32 LKQX LKQCp 30.67 +.72 LYTS LSIInds 20.51 +.40 LTXX LTX 4.00 +.14 LRCX LamRsch 53.82 +1.32 LAMR LamarAdv 53.03 +.82 LSTR Landstar 42.71 +.67 LSCC Lattice 4.95 +29 LWSN LawsnSB 9.71 +.20 LAYN Layne 46.47 +1.90 LEAP LeapWirels 66.99 +.09 LVLT Levl3 4.94 +.09 LBTYA LibGlobA 39.55 +.41 LBTYK L bGobbC 38.32 +.50 LINTA UbtyMlntA 18.95 +28 LCAPA ULiMCapA111,62 +128 LIFC Ulecell 31.63 +1.00 LPNT UIfePtH d28.00 +.31 LGND UgandPhm 6.09 +.12 LLNW Umrelightn 8.13 -.14 LNCR Uncare 36.18 +.33 LLTC UnearTch 34.12 LQDT Liquidity 11.70 -27 LOCM Local.com 5.50 +.70 LNET L4odEnt 25.98 +.48 LOGI Logsech 28.76 +.79 LOOK LookSmat 2.62 -.02 LOOP LoopNet 19.27 +.42 LULU ilulamngn 33.49 +1.19 MAFB MAFBc 5351 +126 MCGC MCGCap 14.75 +.59 MDII MDIInc .87 -.06 MGEE MGE 33.12 +.86 MOGN MGIPhr 24.11 +.06 MIPS MIPSTech 7.79 +29 MKSI MKSB Inst 21.90 +.94 MRVC MRVCm 2.52 +.06 MTSC MTS 41.71 +1.46 MVSN Macrsn 23.10 +20 MCHX MarchxB 9.15 +20 MATK Maitek 27.05 +1.18 MRVL Marvelir 16.25 +.73 MATH MathStar dl.10 -.09 MATR MalriaH 24.81 +20 MTRX MatrixSv 18.76 +.50 MTSN Mattson 10.59 +.19 MXIM Maxim hl 30.05 +.66 MXWL MaxwlIT 11.80 -.39 MEDX Medarex 17.15 +.57 MCCC Mediacm 8.45 +.15 MDCI MedicActs 22.66 +.47 MDCO MediCo 16.40 +.59 MPEL MalcoPBLn 13.34 +.36 MEMY MemryPh 2.20 -.04 MENT MentGr 13.91 -.09 MMPI MerueloMn 6.18 +.16 MEOH Methanx 21.87 +.47 MCRL Micrel 10.78 +.52 MCHP Microchp 37.75 +.93 MCRS MIcrosSys 60.46 +4.95 MSCC MicroSemii 24.38 +.91 MSFT Microsoft 2559 +.66 MSTR MicroStr 68.34 -1.59 MVIS Micrvisn 4.80 +20 MLNM MillPhar 9.91 +25 MLHR MillerHer 2.836 +.98 MICC Millicomlnt 82.62 +3.40 MSON Misonbt 3.83 -23 MOLX Molex 26.10 +.63 MOLXA MolexA 24.78 +.46 MPWR MonPwSysu20.34 +.28 MNST MonstrWw 34.15 +124 MOVE MoveI nc 2.50 +.02 MOVI MovieGalh .39 -.02 MYGN MyriadGn 42,86 +1.53 NTGR N gear 29.20 +.98 NIHD NIIHldg 76.16 +1.02 NGEN Narnogen 1,05 +.01 NDAQ Nasdaq 32.36 +.48 NSTK Nastech 13.86 +.18 NAHC NatlH 10.00 +.17 NKTR NekltarTh 8.17 +.02 UEPS NetlUEPS 24.63 +.87 NETC NetServlc 14.68 +.72 NETL NetLoglc 29.08 +1.76 NTES Netease 1624 +.20 NFLX Nettlix 17.50 +.52 NTAP NetwkAp 28.39 +.70 NRMX Neurochg d2.33 -.01 NEXC NexCen 7.01 +.10 NHWK NIghtwkR 22.00 +1.13 NOBH NoblyH 17.75 +23 NDSN Nordson 49.80 +1.62 NTRS NorTrst 60.82 +126 NVTL NvtlWris 23.25 +.81 NVAX Novavax 322 +.19 NOVL Novell 6.79 +.14 NVLS Novlus 27.24 +.99 NOVN Noven d15.23 -.11 NUHC NuHoriz 9.08 -.12 NUAN NuanceCm 18.64 +.36 NTRI NutriSys 53.59 +3A9 NUVO Nuvelo 2.05 +.06 NVDA Nvldla 48.96 +2.63 ORLY OReilyA 35.32 +1.30 OSIP OSIPhim 34.18 +.52 OMTR Omniture 24.89 +.60 OVTi OmniVisn 19.54 +.16 OMRI OmrixBio 34.15 +.19 ASGN OnAssign 10.77 +.13 ONNN OnSmcnd 11.48 +.19 ONXX OnyxPh u38.74 +127 OTEX OpenTxl 20.08 +.58 OPWV OpnwvSy 4.64 +.13 OPSW Opsware u1420 +.05 OCPI OpIdCm 1.61 OXPS optXps 22.95 +.10 ORCL Oracle 20.13 +.77 OSUR OraSure 9.30 +.43 ORBC Orbcommn 9.05 +.51 OFIX Ortfx 48.15 +.65 OTTR OtterTall 36.91 +2.30 PDU PDLBlo 1830 -4.0 PFCB PFChng 33.96 +.38 PMCS PMCSra 7.45 +.26 PSSI PSSWrdd 17.89 +.66 PCAR Paccar 82.96 +3.08 PEIX PacEthan dil.39 -.03 PSUN PacSunwr d13.54 +.25 PKTR Packelr 7.52 +.12 PAET PaetecH n 12.13 +.35 PALM Palm Inc 15.15 +.38 PAAS PanASIv 2428 +.85 PNRA PaneraBrd 4321 +.41 PTRY Panty 33.86 +.96 PZZA Papalohns 25.98 -.52 PLLL ParPet 17.12 +.36 PMFC ParamTch 17.35 +.58 PTNR PrtnrCm 15.80 +.49 PDCO Patterson 36.77 -.15 PTEN PattUTI 21.52 +.64 PAYX Paychex 44.46 +1.08 PENN PnnNGm 58.59 PPCO Penwest 12.33 -.05 PBCT PeopUIdF 17.66 +.5 PSPT PeopleSup 12.22 -.40 PPHM Peregdrneh .87 PRGO Penigo 20.66 +.47 PETI) PetmDev 37.47 +1.33 PETM PetsMad 33.96 +.82 PFSW PFSweb 1.29 +.03 PPDI PharmPdl 35.50 +.34 PHRM Pharmion 38.44 +.54 PFWD PhaseFwd 17.74 +.19 PLAB Pholrn dl11.48 -.01 PONR PonmCos 34.99 +.05 PLUG PlugPower 2.49 -.03 POTP PolntTheri .06 -.01 PLCM Polycom 30.42 +1,35 PLMD Polymed u51.89 +.20 POOL PoolCorp d32,86 -.09 BPOP Popular 12.24 +.18 QQQQ PwShsQ 0048,08 +134 PWAV Powiwav 6.91 +21 POZN Pozen 10.00 +.19 PRST Presslek 6.28 -.13 TROW PriceTR 50.67 +1.79 PCLN priceline 78.60 +1.98 PGNX ProgPh 22.86 -.15 PGIC ProgGam 4.896 -.04 PSYS PsychSol 3629 +.59 QGEN QOAGEN 16.86 +28 QLTI QLT 590 -.10 QLGC Qlogic 12.56 +25 QCOM Qualcon 3892 +1,05 QTWW QuanFuel 1.16 -.04 QSFT QuestSfhO 14.69 +.32 QMAR QuintMari 16.46 +.49 RAMR RAMHIdgs 8.91 +.65 RCNI RCN 14.35 +.60 RFMD RFMIDO 592 +15 RACK RackSys 12.98 +.83 RADS RadntSys 15.13 -.26 ROIAK RadoOneD 3.63 +.03 RMBS Rambuslf 14.75 +.16 RARE RareHosp u37.70 +.04 RNWK RealNwk 6.04 +.04 REGN Regenm 19.16 +1.07 RCII RentACt 19.18 +.41 RJET RepubAr 19.56 +.57 RIMM RschMots 81.82 +4,62 RECN ResConn 29.896 +.07 RESP Respiron 46,52 -.76 RSTO RestHrd 3.50 +.04 RVBD Riverbed n 44.57 +1.41 ROSE RoseltaR 16.57 +.09 ROST RossStrs 27.12 +.54 RGLD RoyGId 26.88 +.68 RTEC Rudolph 12.68 +.46 RYAAY Ryanairs 40.34 +.99 SONE SlCorp 7.80 +.29 SBAO SBA Corn 31.60 +22 SBAC SBACom 31.69 +.02 SCOX SoOGip .50 -.01 SEIC SBInvs 2520 +.33 STEC STEC 7.62 +.10 SIVB SVBFnGp 50.49 +.09 SLXP SalixPhm 11.35 +.11 SAFM SanderFm 41.00 +1.80 SNDK SanDisk 53,54 +1,51 SANM Sanina 210 +.01 SNTS Santaus 2.47 -.08 SAPE Sapient 6.49 +21 SVNT SavienlPh 12.93 -.12 SWS Sawis 38.95 -69 SCHN Scinltzer 53.98 473 SCHW Schwab 1951 +44 SCRX SdelePh 23.02 +.52 SGMS SdcGami 34.64 +2.02 SHLD SearsHldgs145.61 4+.38 SCUR SecuraCmp 8.69 +28 SCSS SelCmfi 17.24 +.65 SIGI Selclnss 21.18 +.57 SMTC Semtech 1752 +1.67 SEPR Sepracor 28.74 +.41 SNDA Shanda 30.84 +24 SHFL ShullMstr 14.63 +.03 SFLY Shuttedltyn27.99 +1.89 SIRF SiRFTch 16,96 -.44 SWIR SleiraWr 21.78 +.37 SIGM Sogmsg u38.63 +1.38 SIAL IgAls 44.75 +.31 SIMG SImg 5.69 +.14 SLAB SinLab 34.88 +.75 SIMO SillnMotn 19.71 +1.16 SSTI' SSTf 3.10 +.07 SPIL Slnware 1.31 +.57 SSRI SifvStdg 2898 +1.02 SSTR SIvear 228 +.68 SINA Sina 40.87 +.74 SBGI Sinclar 12.27 +.56 SMDI Sirenza 15.47-. +.41 SIRI SfIusS 2.84 +05 SKYW SkyWest 24.90 +1.16 SWKS SkywksSol 746 -.03 SMSI SmithMIcro 14.49 +.30 SSCC Smurlna 10.53 +.08 SOHU Sohu.cm 31.37 +.32 SOLF Solartunn 10.73 +.56 SONC SoncCorp 21,59 -.53 SNIC Sol hcSlhI 7.58 +01 SNWL SncWall 8.44 +.03 SONO SonoSite 28.53 +.16 SONS Sonus 5.72 +.12 SMBC SouMoBc 14.78 -.31 LNUX SourceF d274 -87 TSFG SouthF 23.53 +.22 SPSN SpansonA 9.33 +21 SPAR SparWots 14.93 +.40 SPLS Stacles 2359 +.81 SBUX Stoitucks 2748 +,60 STLD StDynas 42.20 +.95 SMRT SteinMrt 8.54 +.13 STEM StemCells 2.19 +.01 SBIB SteriBcss 11.39 +.19 STSA SItFWA 25.67 +22 JAVA SunMWro 517 +11 STL SuOpla 13.04 +.31 SPWR SunPower6354 +328 SCON SuoTech u7.18 +1.48 SUPG SupeiGen 4.16 -.05 SUPR SupedorBc 9.48 +.13 DEEP SupOfshn 10.65 +52 SUSQ SusqBnc 19.47 +.45 SCIR Sycamore 3.95 +.05 SYMC ec 1866 +40 SYMM 4.96 +.05 SYNA Saps 4220 +.95 SNCR on 35.66 +.94 SNPS Synopsys 27.15 +35 SYNO Synovs u17.46 +266 BRLC SyntaxBrkil 622 +.09 TBS TBSlA 36.74 +1.75 AMTD TOAmerir 17.52 +.15 TFSL TFSFnn 11.58 +.10 THQI THQ 28.88 +.58 TOFT TOPTank 584 +27 TTMI TIMTch 11.67 +.97 TTWO TakeTwo 1535 +29 **pnm^ TARR Tarragn .93 -.01 TASR TASER 13.60 +.26 TECD TechDala 38.99 +.80 TKLC Tekelec 11.95 +27 TTEC TeleTech 29.32 -88 TLAB Telabs 1025 +14 TMRK Terremk 6.60 +.31 TSRA TasseraT 3625 +1.06 TTEK TetraTc 19.19 +.31 TEVA TevaPhrm 42.43 +1.00 TXRH TexRdhsA 1259 +.16 NCTY The9Ud 3652 -3,83 THRX Therance 30.10 -33 COMB 3Com 3.70 +.15 TIBX TiboS 7.68 +.18 Tw'C TWTele 21.70 +.75 TWVO TiVoInc 620 +.18 TRAD Tidtat 11.07 +.37 TZIX TiZeto 15.70 +.05 TGIC TriadGty d16.20 -2.0 TRMA TricoMar 3208 +.79 TRID TridenlMh 14.55 +.05 TPMB TrimbreNs 35.51 +.64 TQNT TriQuint 4.38 +24 TRLG TrueReiglf 17.53 -.12 TRST TrslNY 11.04 +20 TRMK Trusti 2839 +1.15 TUES TuesMm 10.50 -.01 UAUA UAL 4531 +1.51 UCBH UCBHHId 1636 +.08 USBE USBioEnn 10.34 +.17 USNA USANAH 38.86 -1.13 UTIW UTiWrldwd 22.14 +29 UTSI UTStcm 2.70 -.05 ULTR Ultpetin 16.40 +.57 UMPQ Umpqua- 21.53 +.54 UNR UtdNbIF 27.49 +.54 UNTD UtdOnnh 14.17 +27 USEG USEnr 4.52 -.02 UTHR UtdTirp 68.46 +.60 UFPI UnvFor 3722 +.35 URRE UianluRn 7.47 +A1 URBN UrbanOut 21.90 +.49 WTV VaMsA 7.83 +.02 VOLK VakieCick 20.09 +.66 VNOA VardaPhm 14.93 +.16 VSEA VaianSMsa 53.50 +.96 VDSI Vascota 30.98 +1.32 VRGY Verigy 25.83 +.58 VRSN Veisgn 31.86 +.79 VRT VerxIPh 37.66 +1.46 VMED VrgnMdah 23.70 +.45 VPHM VIroPhm 9.94 +.60 VPRT VistlaPt 33.68 +.75 VLCM Volcm 38.05 +.47 WRNC Wemaco 35AC +2.52 WCRX WameiChn18.51 +.63 WRES WarrenRs 1220 +.57 WFSL WashFed 26.55 +1.18 WBSN Websense 20.46 +.41 WERN WemerEnt 18.67 +.41 WSTL Westall 2.04 -.01 WTSLA WeOSeal 4.53 +.13 WINY WVitneyH 27.43 +.43 WFMI WholeFd 45.79 +1.03 OATS WildOat 18.63 +.13 WLSC WmsScots 27.30 -.06 WIND .WindRr 10.14 +.16 WINN WimnOin 21.61 -.56 WRLD WIdAccep 3021 +.17 WYNN Wynn 120.75 +2.95 XMSR XMSat 11.89 +29 XOMA XOMA 2.67 -.01 XLNX Xinx 25.48 +.67 YRCW YRCWwde 30.44 +59 YHOO Yahoo d255 +,03 2HNE ZhoneTch 120 ZION ZionBcp 72.19 +.16 ZOLT Zoliek 40.06+2.46 ZRAN Zoran 17.00 +.13 ZUMZ Zuriez 46.69 +1.97 ZGEN ZymoGen 12.17 +.40 Yesterday Pvs Day Australia 1.2263 1.2194 Brazil 1.9693 2.0005 Britain 2.0163 2.0072 Canada 1.0622 1.0628 China 7.5500 7.5565 Euro .7321 .7335 Honq Konq 7.8016 7.7995 Hunqary 188.08 189.57 India 40,970 40.980 Indnsia 9433.96 9433.96 Israel 4.1250 4.1378 Japan 115.47 114.56 Jordan .7095 .7085 Malaysia 3.5030 3.4940. Mexico 11.0886 11.1210 Pakistan 60.83 60.90 Poland 2.80 2.81 Russia 25.6417 25.7050 Singapore 1.5215 1.5254 Slovak Rep 24.75 24.81 So. Africa 7.1855 7.2831 So. Korea 941.62 939.85 Sweden 6.8696 6.8800 Switzerlnd 1.1998 1.1996 Taiwan 33.16 33.11 U.A.E. 3.6732 3.6726 Venzuel 2145.92 2145.92 British pound expressed in U.S. dollars. All others show dollar In foreign currency. Yesterday Pvs Day Prime Rate 8.25 8.25 Discount Rate 5.75 5.75 Federal Funds Rate 5.19 4.50 Treasuries 3-month 3.88 3.58 6-month 4.14 3.91 5-vear 4.27 4.31 10-vear 4.55 4.61 30-year 4.88 4.95 FUTURES Exch Contract Settle Chg Lt Sweet Crude NYMX Oct07 73.51 +1.78 Corn CBOT Dec 07 3401/4 -41/2 Wheat CBOT Dec 07 7581/2 +201/4 Soybeans CBOT Nov07 874V4 +2 Cattle CME Oct 07 98.05 +.45 Pork Bellies CME Feb08 91.57 +.57 Sugar (world) NYBT Mar 08 9.68 -.05 Orange Juice NYBT Jan 08 122.90 +.40 SPOT Yesterday Pvs Day Gold (troy oz., spot) $666.30 $659.10 Silver (troy oz., spot) $11.837 $11.546 Copper (pound) $3.3450 $3.22/0 NMER = New York Mercantile Exchange. CBOT = Chicago Board of Trade. CMER = Chicago Mercantile Exchange. NCSE = New York Cotton, Sugar & Cocoa Exchange. NCTN = New York Cotton Exchange. YTD Chg %Chg Name I CiTRus CouNTY (FL) CHRoNicLE S*rocles dis it I- -^^- I Crraus ouivrv ( ) naolvc 3-Yr. Name NAV Chg %Rtn AIM Investments A: BasValA p 37.56 +.78 4+36.9 ChartAp 1828 +.28 +39.3 Constp 28.19 +.73 +38.4 HYdAp 4.31 ... +21. InGrow 32.53 +.79 +97.5 SelEqtyr 21.11 +.43 +35.1 AIM Investments B: CapDvBt 17.79 +.37 +57.9 AIM Investor Cl: Energy 45.63 +126+134.5 SumrnitPp 14.09 +29 +48.7 Utliies 1833 +.48 +872 Advance Capital I: Balancp 19.03 +28 +29.8 RetInc 9.48 -.01 +11.8 Alger Funds B: SmCapGrt 6.50 +.13 +78.1 AllianceBem A: BalanAp 18.15 +22 +29.4 GbTchAp 72.66 +2.07 +50.6 InIV9lAp 2337 +,55 +94.4 SmCpGrA29.76 +.67 +53.2 AlllanceBernm Adv: ntValAdv 23.76 +.56 +96.3 LgCpGrAd22.53 +.55 +34.5 AllianceBem B: CopBdBp 11.81 -.02 +12.3 GbTchBt 64.53 +1.84 +47.0 GromtBt 26.94 +.66 +332 SCpGrBt 24.63 +34 +49.5 USGovtBp 6.75 ... +8.5 AlllanceBem C: SCpGrCt 24.72 +.55 +49.8 Allianz Funds A: NFJDvVit 17.66 +.40 +57.5 AllIanz Funds C: GrowthCt 12342 +.49 +47.0 TargelCt 20.85 +.45 +53.4 Amer Beacon Plan: LgCpPfn 23.76 +51 +64.4 Amer Century Adv: EqGropn25.91 +.56 +39.9 Amer Century Inv: Balanced n6.92 +21 +27.3 EqGroln 25.94 +.56 +41.0 Eqlrnn 8.80 +.16 +36.5 FLMuBndnlO.42 +.02 +7.8 Growai n 24.03 +.62 +353 Heritageln19.59 +.49+105.4 IncGron 33.6 +.70 +38.8 InlDiscrn 16.58 +.45+132.0 IntlGmoln 13.53 +.36 +80.9 UfeScin 5.62 +.0 8 +28.0 New0pprn7.67 +21 +59.1 OneChAgn13.69 +27 NS RealEslln 27.22 +.76 +61.1 Ultra n 29.32 +.73 +19.4 Valueinvn 7.71 +.14 +38.8 American Funds A: AmcpAp 21.43 +.42 +37.7 AMuttAp 30.60 +.60 +39.3 BalAp 19.70 +28 +29.6 BondAp 13.14 -.02 +13.5 CapWAp 19.42 ... +19.4 CaplBAp 63.76 +1.08 +53.7 CapWGAp45.11+1.02 +78.4 EupacAp 50.65 +1.06 +87.1 FdlnvAp 42.95 +.95 +62.6 GwthAp 35.44 +.76 +52.8 HITrAp 12.10 ... +24.4 IncoAp 20.61 +.30 +41.4 IntBdAp 13.41 -.01 +9.4 ICAAp 35.47 +.73 +44.2 NEooAp 28.77 +.67 +59.4 N PerA p 34.20 +.74 +85.0 NwWrklA 54.67 +1.30+117.5 SmCpA p 44.30 +1.05 +92.7 TxExAp 12.15 +.05 +9.9 WshAp 36.66 +.79 +39.4 American Funds B: BalBt 19.65 +28 +26.7 CaplBBt 63.76 +1.08 +502 CpWGrB 144.85 +1.01 +742 GrwthBt 34.17 +.74 +49.4 lInoBt 20.49 +30 +38.2 ICABt 35.27 +.72 +40.9 WashBIt 36.41 +.78 +362 Ariel Mutual Fds: Apprec 49.70 +1.01 +31.5 Are 54.70 +.94 +31.4 Artisan Funds: Iln 31.10 +.75 +85.3 tAdCap 34.95 +.79 +60.4 SMdCapV 21.31 +.45 +61.7 Baron Funds: Asset 62.77 +1.08 +64.4 Growth 52.47 +1.00 +57.0 Partners p 2425 +.51 +93.0 SmCap 23.97 +.42 +53.2 Bernstein Fds: InlOur 13.05 -.02 +11.8 DivMu 13.89 +.03 +7.4 TxMglntV 27.69 +.74 +75.9 IntVal2 27.30 +.73 +75.7 EmMkIs 45.14 +1.44+162.3 BlackRock A: AuroraA 27.97 +.61 +38.0 .f .i i GaiAW1,lfA2t +.20V.+54.1 HiYlnvA 7.83 ... +24.4 BlackRock B&C: GIAICt 18.33 19 +.19 +50.7 BlackRock i nsti: BaVII 32.65 +.71 +45.9 GIAlocr 19.49 20 +0 +55.3 Brandywine Fds: BheFdn 36.08 +1.03 +61.5 Binrdywnn38.63 +1.07 +68.7 Brihson'FundsY: HiYlYn 6.72 -.01 +19.5 CGM Funds: CapDvn 31.82 +.87 +96.4 Focusn 46.42 +1.89+124.1 Mun 31.59 +.87 +562 CRM Funds: MdCpVII 32.47 +.75 +62.5 Calamos Funds: Gr&lncAp 32.86 +.55 +39.5 GiwlhAp 60.05 +1.72 +462 GrowthCt 5651 +1.63 +43.0 Calvert Group: Incopx 16.58 -.08 +12.9 IntlEqAp 24.17 +.64 +71.6 Munlrtx 10.40 ... +62 SodaA p 30.66 +.34 +23.6 SocBdpx 15.81 -.07 +14.7 SocEqAp 38.84 +.88 +30.1 TxFUx 10.08 ... +2.8 TxFLgpx 16.03 +.02 +9.7 TxFVTx 15.40 ... +8.3 Causeway Intl: lnslntnlrrn20.87 +.52 +69.7 Clipper 90.88+1.70+22.5 Cohen & Steers: RLtyShrs 78.05 +1.96 +65.5 Columbia Class A: Acomr 30.55 +.64 +60.8 21CntryAt15.14 +29 +70.4 MarsGrA t2125 .47 +.47 39.5 Columbia Class Z: Acorn Z 31.34 +.65 +622 AcorlntZ 44.43 +1.02+123.7 IntEqZ 17.81 +.44 +78.3 LgCpErZ 28.54 +.62 +39.2 Credit Sulsse ABCD: ValueAt 19.50 +.38 +45.1 DFA Funds: USCorEq2n12.06 +26 NS DWS Scudder Cl A: ComimAp 25.30 +.403 +82.1 DiHiRA 5159 +1.02 +432 DWS Scudder CI S: CapGttr r 53.84 +1.14 +35.0 CorqPslnc 12.45 -.02 +11.6 EmMkln 11.78 +.03 +40.2 EmMkGrr 25.23 +.77+145.4 EroEq 39.54 +1.02 +89.8 GlbBdSr 9.73 -.01 +13.8 GroOpp 43.79 +.85 +84.3 GNYlIen 3520 +.73 +99.2 Gid&Pro 19.61 +.63 +85.4 GrolncS 21.9 +.48 +31.6 HiYldTx 12.63 +4.3 +15.6 IndApA 1095 +.83 +8.1 InUFdS 66.32+1.64 +86.2 LgCoGro 28.87 +,1 +335.2 LatAnrEq 67.66 +222+233.6 MgdMuni S85.91 +.03 +12.0 MATFS 13.956 +.04 +10.4 Davis Funds A: NWen A 39.77 +.76 +445 Davis Funds B: NYVenB 37.92 +.72 +415 Davls Funda C &Y: NYVenY 40.28 +76 +46.1 NYVenC 38.18 +.73 +41.5 Delaware Invest A: TrendAp 19.82 +.45 +44.8 TxUSAp 11.19 +.05 +11.0 Delaware Invest B: * DelchB 3.29 -.91 +262 SelGrBt 25.46 +.53 +42.6 Dimensional Fds: EmMktV 40.35 +1.46+202.1 IntSmVa n 22.40 +.42+107.5 USLgCo n 43.08 +`94 +39.4 USLgVa n 25.06 +.53 +52.0 USMeron15.62 +.34 +48.6 USSmnan21,53 +.50 +49.1 USSmVa 28.75 +.70 +63.6 IntlSmCon20.63 +.41 +96.0 EmgMkIn 30.77 +1.07+1512 Fixdn 1021 ... +11.1 IntVan 24,52 +.60+101.8 GIb5Fxlnrn0,89 +.01 +10A TMUSTgtV24.75 +.58 +652.1 TMIntVa 20.95 +.52+101.8 TMMIkwV 18.12 +.41 +58.1 2YGIFxdn10.47 ... +10.1 DFAREn 28.10 +.74 +58.7 Dodge&Cox: Ba Ced 87.44 +1.15 +36.9 Income 12.53 -.02 +11.9 ,IntStk 46.58+1.00 +93.6 Stock 154.55 +3.13 +53.5 Dreyfus: Ap-c 45.33 +.84 +32.8 Dreyf 10.57 +24 +38.6 Dr0OO0n 41.86 +.91 +37.8 SEngLd 33.76 +.82 432.1 FL Intr 12.72 +.03 +6.6 InsMut 17.37 ... 0.0 Dreyfus Founders: GrowthB 12.05 .. 0.0 GnrthFp 12.85 0.0 Dreyfus Premier: lvp 31.96 +,66 +45.1 LtdHYdAp 6.98 -.01 +17.9 StValAr 3333 +.70 +54.6 TchGroA 26.74 +.70 +34.0 Driehaus Funds: EMtaGr 46.54 +1.55+199.1 Eaton Vance Cl A: ChlnaAp 31.83 +.87+169.3 AMTFMBI 10.38 +12 +13.1 MuItCGrA 10.54 +.26 +74.2 InBosA 6.28 ... +24.5 LgCpVal 21.80 +.50 +56.8 NatMun 11.14 +.15 +18.6 SpEqtA 1521 +.33 +66.5 TradGvA 7.17 -.01 +10.9 Eaton Vance Cl B: FLMBI 10.66 +.09 +10.5 HIthSBt 12.32 +.20 +17.4 NaSMBI 11.13 +.14 +15.8 Eaton Vance Cl C: GovtCp 7.17 -.01 +8.6 NatlMCI 11.13 +.14 +15.8 Evergreen A: tAp 15.11 +.22 +36.5 Evergreen C: AstA1Ct 14.60 +21 +33.7 Evergreen I: CordI 10.33 -.02 +11.2 SIMunll 9.80 +.02 +6.8 Excelsior Funds: Energy 25.33 +.62+130.5 HiYleld p 4.57 ... +18.9 ValResIr 55.37 +1.36 +55.1 FPA Funds: NwInc 10.96 -.01 +10.8 Fairholme 31.51 +.49+63.8 Federated A: MtdGrStA 41.60 +.92 +61.6 KaufmAp 6.27 +.12 +64.8 MuSecA 10.22 +.05 +8.9 Federated B: StrncB 8.68 -.01 +18.5 Federated Instl: KaufimK 627 +.12 +64.4 Fidelity Adv FocT: EnergyT 48.89 +1.48+133.1 HItCarT 22.64 +.29 +34.2 Fidelity Advisor A: DiMnitAr 23.86 +.40 +71.8 Fidelity Advisor I: Divntin 24.24 +.40 +732 EqGdrn 62.01 +1.50 +41.7 EqInin 31.42 +.66 +43.2 InlBdln 10.65 -.02 +8.8 Fidelity Advisor T: BalancT 17.34 +.26 +30.2 DivlntTp 23.59 +.40 +70.5. DivGrTp 13.95 +.27 +31.1 DynCATp 19.35 +.45 +68.4 EqGrTp 58.39 +1.42 +39.4 EqInT 30.97 +.64 +41.0 GrOppT 38.33 +.86 +38.0 HilnAdTp 10.25 +.02 +36.2 InIBdT 10.64 -.01 +8.0 MIdCpTp 26.91 +.46 +60.6 MulncTp 12.55 +.04 +10.1 OvrseT 23.95 +.44 +70.7 STvrT 9.26 -.01 +7.9 Fidelity Freedom: FF2010n 14.85 +.16 +28.8 FF2015n 12.47 +.15 +33.8 FF2020n 15.82 +.23 +38.6 FF2025n 13.11 +.19 +40.5 FF2030n 16.41 +.30 +44.3 FF2035n 13.59 +.24 +45.4 FF2040n 9.71 +.18 +47.0 Fidelity Invest: AggrGrrn 21.95 +.52 +49.5 AMgr50n 16.52 +.15 +24.5 AMgr70n 17.02 +.23 +28.4 AMgr20rn12.71 +.03 +23.8 Balancn 20.49 +.31 +45.6 BlueChGrn47.16 +1.08 +26.7 CAMunn 12.01 +.06 +11.0 Canadan 57.72 +1.27+115.1 CapApn 28.75 +.68 +46.0 CapDevOn13.862 +.26 +40.8 Cplnc r n 8.72 +.03 +32.6 C naRgn30.50 +.86+108,. CngS n 488.46 +9.46 8+37,7 CTMunrn1111 +.03 +8.7 Contran 70.31 +1.47 +60.1 CnvScn 27.83 +.47 +50.2 DisEqn 30.50 +.71 +49.1 ODivinn 39.66 +.76 +82.5 OivStrOn 16.53 +.33 +44.1 DivGth n 33.21 +.66 +33.6 EmrMkn 29.16 +.80+191.4 Eqlincn 59.81 +1.32 +45.3 EQIIn 24.28 +52 +37.7 ECapAp 28.48 +.46 +98.8 Europe 40.89 +.69 +97.1 Exchn 343.66 +6.11 +47.0 Export n 24.61 +.61 +50.0 Fdeln 37.69 +.76 +39.9 Fifltyrn '?"5 ,.4 .i,Ir FnRf ii, ,, 0 "' -0i -1.1" FLMurn 11.19 +.03 +9.8 FdlOne n 30.68 +.53 +42.5 GNMAn 10.71 -.04 +11.5 Govtinc 10.09 -',:* .11 ' GroCon 76.41 -r .' ,. Grolncn 3fln N,: .?7 GMolnclln 1i :: -4 *.i0 'Iighlncr n 1 "+i ,.8? Indepnn 24.5u+ +.64 +.5 IntBdn 10.11 -.02 +9.1 IntGovn 10.05 -.02 +9.8 InDlotcn 40.95 .70 +.7 90.2 IntSCp rn 27.23 +.35 +99.6 InvGBn 7.18 -.02 +10.3 Japan n 17.19 +.22 +47.8 JpnSmn 11.94 +.14 +10.4 LatAmn 52.81 +1.90+250.1 LevCoSdt n32.83 +.78 +92.4 LowPrn 44.59 +.87 +55.0 Magelnn 92.18 +2.50 +34.8 MDMurn10.60 +.03 +9.0 MAMunn 11.59 +.04 +10.9 MIMunn 11.58 +.03 +9.8 MdCapn 30.37 +.68 +68.6 MNMunn11.10 +.03 +9.3 MtgSecn 10.59 -.03 +8.2 Munilncn 12.42 +.04 +11.2 NJMunrn11.27 +.04 +10.8 NwMIdrn 14.27 +.04 +35.6 NwlMiUn 31.33 +.65 +55.5 NYMunn 12.47 +.04 +10.1 OTCn 47.23 +1.10 +59.9 Oh Munn 11.29 +.03 +10.0 100Index 10.59 +.22 NS Ownea n 49.25 +1.07 +85.0 PcBasn 31.27 +.83+101.4 PAMunrn 10.57 +.02 +10.0 Puribn 20.43 +.28 +33.5 RealEn 31.54 +.87 +56.8 StIntMun 10.18 +.01 +6.8 STBFn 8.66 -.01 +8.1 SmCapindr 22.60 +.49 +59.8 SmrllCpSrnl9.24 +.35 +50.8 SEAsian 38.13 +1.34+202.1 SI klcn 29.72 +.62 +45.0 Stratincn 10.44 +.01 +21.9 .SflneRtr 9.85 +.03 NS TotalBdn 10.26 -.02 +12.0 Trend n 68.658 +1.76 +43.3 USBIn 10.75 -.03 +11.0 Ugilyyn 20.37 +.53 +80.7 ValStratn 34.09 +.75 +54.3 Value n 985.46 +2.07 +61.2 Wrldwn 21.86 +.47 +65.1 Fidelity Selects: Airn 50.68 +1.31 +81.8 Banning n 30.94 +.59 +14.9 Biotchn 65.20 +.87 +21.8 FBirnn 65.96 +.89 +28.9 Chem n 78.18 +1.80 +09.8 ConEqulpn 22.75 +351 +45.2 Compn 45.25 +1.40 -54.8 ConDisn 24.69 +.70 +33.1 ConStapn 62.46 +.87 +592 CsIHon 41.77 +1.31 +33.3 DPAern 89.05 +2.06 +812 Elecrn 40.60 +1.4 +61.7 Enrgyn 58.38 +1.77+147.0 EngSvn 90.55+3.45+168.3 Envirn 17.62 +.483 +39.3 FinSvn 110.65 +2.04 +28.7 Goldurn 33.50 +1.13 +69.7 Healthn 127.47 +1.61 +38.5 HomFn 48.20 +.95 -7.0 Irnsurn 6956 +1.16 +37.4 Leisrn 78.98 +1.29 +45.6 Material n 54.48 +1.35 +85.4 MedDIn 50.24 +.43 +81.0 MdEqSysn24.88 +.29 +39.1 Multrd n 43.30 +.98 +37.8 NtGasn 41.97 +`99+113.0 Papern 32.98 +.68 +12.8 Pharmen 11.33 +.14 +42.9 Retal n 50.85 +1.73 +39.4 Soflwrn 68.92 +1.33 +62.3 Tech n 76.68 +1.94 +52.2 Telcmn' 56.30 +1.22 +79.7 Transn 53.05 +1.09 +43.5 UlilGrn 58.97 +1.36 +75.7 Wireless n 8.73 +25 +89.3 Fidelity Spartan: Eqldxlnvn51.95 +1.13 +39.4 500lnxlnvr n101.76+220+39.4 Inllnxlnvn46.53 +.79 +78,9 TolMlnvmn41.26 +.89 +43.6 Fidelity Spart Adv: EqldxAdrn 51.95 +1.13 NS 500Adrn101.77 +2.20 NS TolMkIAdrn4127+.89 NS First Eagle: GIblA 47.83 +21 +63.7 OverseasA26.40 -.06 +73.3 First Investors A BIChpAp 24.70 +.51 +35.6 GloblAp 8.12 +.19 +55.5 GovtAp 10.64 -.02 +9.6 GrolnAp 16.38 +.36 +41.4 IncoA p 2.96 ... +15.6 MATFAp 11.42 +.04 +7.1 MITFAp 11.85 +.04 +7.4 MidCpAp 30.15 +.66 +48.3 NJTFAp 12.49 +.04 +7.5 NYTFAp 13.94 +.05 +7.1 PATFAp 12.52 +.03 +7.6 SpSitAp 23.88 +.54 +61.2 TxExAp 9.60 +.03 +6.8 TolRIAp 16.63 +.19 +28.8 ValueBp 8.00 +.16 +41.5 Firsthand Funds: GbTech 4.90 +.05 +44.1 TechVal 41.43 +,82 +62.4 Frank/remp Frnk A: A4USp 8.86 ... +10.1 ALTFAp 11.17 +.03 +10.0 AZTFAp 10.75 +.03 +11.0 Ballnvp' 66.66 +1.28 +60.8 CalnsAp 12.38 +.04 +12.3 I0OWToRED HEMUUA FN D ALE Here are me 1,000 biggest mutual funds listed on Nasdaq. Tables show the fund name, sell price or Net Asset Value (NAV) and daily net change, as well as one total return figure as follows: Tues: 4-wk total return (1%l Wed: 12-mo lotal return (`-.) Thu: 3-yr cumulative total return () Fri: 5-yr cumulauve total return (%) Name: Name of mutual fund and family. NAV: Net assel value. Chg: Net change in price-of NAV Total return: Percent change In NAV for the lime period snow, wilh dividends reinvested. If period longer than 1 year, return is cumula- live. Data based on NAVs reported to Lipper by 6 p.m. Eastern Footnotes: e Ex-capital gains distribution f Previous ay's quote n No-load fund. p Fund assets used to pay distribution costs r - Redemption fee or contingent daaened sales load may apply s - Stock dividend or spill. I Both p and r. x Ex-cash dividend NA - No Information available. NE Data in question. NN Fund does rot wisn-h o be tracked NS Fund did not exist at start date. Source: Uloer, Inc. end The Associated Press CAIntAp 11.29 +.03 +8.8 Legg Mason Ptrs B: CaITFAp 7.14 +.03 +14.0 CaplncBt 17.09 +.25 +32.7 CapGrA 12.71 +27 +28.7 LgCpGBt 22.87 +.42 +19.9 COTFAp 11.65 +.03 +11.5 Longledf Partners: CTTFAp 10.77 +.02 +11.8 Partners 36.57 +78 +43.7 CvtScAp 16.53 +.12 +37.4 InU 21.01 +.37 +56.8 DblTFA 11.65 +.04 +11.7 SmCap 33.05 +.73 +68.8 DynTchA 29.79 +.80 +38.9 Loomis Sayles: EqlncAp 22.07 +.46 +32.0 LSBondl 14.30 +.01 +31.1 FedIntp 11.21 +.04 +8.4 StrincC 14.80 +.02 +28.6 FedTFAp 11.82 +.04 +12.7 LSBondR 14.26 +.02 +30.1 FLTFAp 11.58 +.04 +11.7 StrlncA 14.74 +.02 +31.5 FoundAlp 14.10 +.22 +44.4 Lord Abbett A: GATFAp 11.80 +.03 +11.4 AffilAp 15.45 +.31 +38.7 GoldPrMA31.11 +.81 +96.0 BdDebAp 7.93 +.02 +21.8 GrwthAp 44.23 +.99 +46.8 MidCpAp 22.95 +.53 +47.7 HYTFAp 10.51 +.04 +15.4 MFS Funds A: IncomAp 2.67 +.02 +36.6 MITA 21.61 +.48 +44.3 InsTFAp 11.97 +.04 +11.1 MIGA 14.67 +.32 +33.3 NYlTFp 10.68 +.02 +6.9 HilnA 3.72 ... +19.9 LATFAp 11.28 +.03 +10.6 IntNwDA 29.04 +.65 +93.6 LMGvScA 9.95 ... +8.0 MFLA 9.80 +.03 +10.9 MDTFAp 11.36 +.05 +10.5 ToIRA 16.48 +.20 +29.4 MATFAp 11.56 +.04 +10.5 ValueA 27.94 +.59 +50.3 MITFAp 11.97 +.03 +11.5 MFS Funds B: MNInsA 11.80 +.03 +10.5 MIGBn 13.26 +.29 +30.8 MOTFAp 11.92 +.04 +11.6 GvScBn 9.42 -,01 +6.1 NJTFAp 11.82 +.04 +12.0 HiinBn 3.73 -.01 +17.5 NYInsAp 11.18 +.04 +9.5 MuhnBn 8.35 +.03 +9.2 NYTFAp 11.53 +.03 +11.2 TotRBn 16.47 +.20 +26.9 NCTFAp 11.92 +.03 +10.8 MFS Funds Instl: OhiolAp 12.26 +.04 +11.5 InllEqn 20.99 +.36 +78.3 ORTFAp 11.58 +.03 +11.9 MainStay Funds A: PATFAp 10.15 +.03 +11.3 HiYIdBA 6.25 ... +24.7 ReEScAp20.87 +.50 +27.2 MainStay Funds B: RisDvAp 36.50 +.71 +30.6 CapApBt 32.01 +.91 +30.3 SMCpGrA41.84 +.86 +53.3 ConvBt 15.90 +25 +34.1 USGovAp 6.39 -.01 +11.0 GovtBt 8.17 -.01 +7.2 UtlsAp 1422 +.34 +63.5 HYIdBBt 6.21 ... +21.8 VATFAp 11.50 +.03 +11.5 inftEqB 16.09 +.28 +65.6 FrankiTmp Frnk Adv: SmCGBp 15.42 +.41 +26.5 . IncmeAd 2.66 +.03 +37.4 ToIRtB t 19.32 +.30 +28.3 Frank/Temp Frnk B: Makrs & Power: 1 IncomeBt 2.66 +.02 +32.8 Growth 81.51 +1.86 +35.3 Frank/Temp Fmk C: Marsico Funds: FoundAlp 13.84 +.21 +41.6 Focusp 19.79 +.49 +42.8 IncomCt 2.68 +.02 +34.4 Growp 21.16 +.46 +38.5 Frank/Temp MtI A&B: Matthews Asian: BeacnA 17.09 +28 +52.3 Indiar 18.14 +.80 NS DiscA 32.57 +51 +76.6 PacTiger 27.52 +.69+122.9 QualfdAt 23.36 +32 +61.2 Mellon Funds: SharesA 26.65 +.40 +48.4 'InUFd 17.37 +33 +62.8 Frank/Temp Mtl C: Mellon Inst Funds: DiscCt1 32.21 +.51 +73.1 IntEqty 43.77 +.66 +882 SharesCt 26.26 +.39 +45.5 Midas Funds: Frank/Temp Temp A: MidasFd 424 +.10+1255 DvMklAp 30.83 +.69+124.5 Monetta Funds: ForgnAp 14.41 +33 +63.5 Moneftan 14.55 +.39 +-5.3 GIBdAp 11.15 +.03 +30.7 Morgan Stanley A: GrwhAp 25.96 +.50 +53.0 DivGhA 20.74 +.44 +312 IntxEM p 21.39 ... 0.0 Morgan Stanley B: WorkdAp 20.00 +.39 +61.1 DivGtB 20.88 +.43+31.5 Frank/TempTmrp Adv: GbDivB 16.44 +.37 +52.5 GnthAv 26.02 +.50 +54.2 StralB 20:58 +.30 +37.3 Frank/TempTmp B&C: MorganStanley Inst: DevMktC 30.06 +.67+119.9 EmMktn 33.76 +1.30+173.7 ForgnCp 14.14 +.32 +59.7 GIValEqAn20.98 +.46 +51.3 GrwthCp 25.21 +.48 +49.7 InlEqn 21.74 +.41 +61.4 GE Elfun S&S: Munder Funds A: ,S&SPM 48.87 0i114 6 .il.,-A .36 +47.7 GMO Trust I1l: I Mutual Seraies EmMkr' :"-1 '0 .178 8 i"': 17; -9 -N+53,7' For CiVl. 4 .s 1 ,ri I DiscZ 32.97 +452 +78.4 IntnrVi 36.08 +.82 +81.2 QualkdZ 23.54 +.33 +52.8 GMOTrustIV: SharosZ 26.88 +.40 +49.8 EmrMkIt 23.64 +.78+179.1 Neuberger&Berm Inv: Foreion H 4 6 sif. A I K. i 6.` 487 h'dll,'-li',n :.(1"1. V -' A Ii',lh -ff""ll f ,-',i 8 GMOTrust Vl Pa:'lr., 4 "., EmgMkis r23.66 +.78+179.6 Neuberger&Berm Tr: InfltndxPI 25.36 -.01 NS Genesis 5325 +1.07 +57.9. SlntCorEq 40.85 +1.02 NS Nicholas Group: USOtyEq 22.11 +.42 NS Hilncin 10.43 +.01 +17.6 Gabelli Funds: Nichn 56.27 +.88 +32.0 Asset 51.68 +1.02 +60.5 Northern Funds: Gateway Funds: .. SmCpldxnlO.77 +26 +45.9 2.6iow 2 m. : ,4 :.ei Technlyn 13.51 +39 4+33.2 Golaman Sachs A: Nlveen-Cl A: i-|,iM,s irA6. +3.9 HYMuBdp21.20 +.12-+17.5 MdCVAp 39.49 +1.01 +54.5 Oak Assoc Fds: Goldman Sachs Inst: Whi1OkSG n36.17 +.71 +16.9 HYMuni n 10.65 +.09 +152 Oakmark Funds I: MidCapV 39.89 +1.02 +56.4 Eqtylncrn27.50 +.30 +37.2 Sthrlnt 16.10 +.40 +84.6 Globalln 27.12 +.55 +772 Harbor Funds: IntlIrn 26.15 +.53 +79.5 Bond 11.60 -.01 +11.7 Oakmlarkrn468.23 +.95 +28,3 CapAplnst34.67 +.79 +36.6 Select rn 32.55 +.73 +28.0 Intlr 6827 +1.93+105.2 Old Mutual Adv Ih: Hartford Fds A: Tc&ComZn15.47 +.45 +61.7 CpAppA p40.66 +1.03 +66.0 Oppenhelmer A: DivGthAp22.20 +.46 +49.2 AMTFMu 9.35 +.09 +13.0 Hartford Fds C: AMTFrNY 12.40 +.11 +15.0 CapApCt 36.95 +.94 +62.6 CAMuniAp10.74 +.10 +19.2 Hartford Fds L: CapApAp 50.05 +1.24 +33.1 GiwOppL 33.66 +.84 +75.0 CaplncAp13.05 +.13 +31.7 Hartford HLS IA: ChmplncA p 9.09 ... +18.1 CapApp 55.98 +1.39 +71.5 DvMdktAp 47.43 +1.46+166.1 Div&Gr 24.11 +.51 +51.5 Discp 52.64 +1.24 +41.7 Advisers 23.47 +.31 4305 EquityA 11.83 +27 +46.5 Stock 54.70 +1.13 +41.1 GlobAp 76.26 +1.65 +67.2 TotRetBd 11.41 -.02 +11.7 GIbppA 38.98 +1.08 +90.8 Hartford HLS IB: Goldp 30.12 +1.09+126.3 CapAppp 55.58 +1.38 +70.2 IntBdAp 6.20 ... +35.9 Hennessy Funds: MnStFdA 42,91, +90 +400 CorGroll 28.08 +.86 NS MnStOAp15.53 +.33 +44.5 HollBalFdni6.98 +.25+21.8 MSSCAp 22.58 +.56 +55.7 Hotchkis &WIley: MidCapA 19.67 +.41 +38.5 LgCpVIAp24.52 +.48 +347 PAMuniAp 12,29 +.07 +19.4 MidCpVal 27.80 +.59 +405 S&MdCpVI40.42 +.85 +78.5 HussmnStrGr16.36+.06 StrInAp 4.31 ... +25.1 +21.0 USGvp 9.40 -.02 +11.1 ICON Fds: Oppenheimer B: Energy 38.10+1.23+121.6 AMTFMu 9.31 +.08 +10.3 Hlthcare 16.91 +.21 +9.8 AMTFrNY 12.40 +.10 +12.2 ISI Funds: CplnBt12.9 +.13 28.4 NoAmp 7.38 -.01 +16.2 ChmplncB 1.08 .2, +15.4 Ivy Funds: EqlyB 11.18 +25 +42.7 GINalRsAp35.57+1.15+126.3 StrIncB1 4.32 ...+21.9 A Cfse 16.3 Oppenhelm Quest: JPMorgan A Class: Bppene 13 +24 +24 MCpValp 26.51 +.61 46.7 QBppeA nhr19.03 +.24 +24.3 JPMorgan Select: UdNYAp 3.29 +.01 +12.7 IntEqn 38.85 +1.06 +68.1 LRoMudNYAp 173.29 +.01 +12.7 JPMorgan Sel Cs:. RcNtMuA 11.54 +.10 +21.8 lnfdAern28.73 +.68 +50.1 PIMCO Admin PIMS: Janusd TotRItAd 1023 -.01 +11.4 Balanced 25.43 +.28 +35.1 PIMCO lnatlPIMS: Contrarian 18.86 +.37 +993 lAsset 12.70 +.06 +23.1 Enterpr 53.05+1.06 +66.7 ComodRR 13.93 +.05 +25.9 FedrE 6.41 +.02 +1.7 DevLcMkrl10.89 +.07 NS FB 9.37 -.01 +11.0 Fllncr 10.06 +.02 +18.0 Fund 30.43 +.61 +36.2 HYId 9.46 ... +21.7 FundaEq 27.56 +.70 +53.4 LowDu 9.91 -.02 +96 GILUifeSci 22.04 +30 +36.2 ReaRlni 10,68 -.03 +10.8 Grech r 14.34 +.35 +8.4 TotRt 10.33 -.01 +12.2 Grnc 40.42 +1.01 +48.1 PIMCOFundsA: MdCpVal 25.22 +.51 +51.86 ReatAp 10.68 -.03 +9.3 Orion 11.73 +.25 +95.8 TItA 10.33 -.01 +10.6 Ovrseasr 51.67 +1.12+162.5 PIMCO Funds D: Research 28.2 +.66 +52.3 TRtnp 10.33 -.01 +11.1 ShTmBd 2.87 ... +8.9 PhonlixFunds A: Twenty 60.97+1.43 +61.1 BalanA 14.90 +.18+26.7 Ventur 67.97 +1.10 +73.6 CapGrA 16.55 +39 +19. WrIdWr 54.83 +1.16 +52.8 InClA 14.79 +.41 +75.5 Janus Adv S Shrs: Pioneer Funds A: Forty 34.56 +.79 +643 BondAp 9.06 -.02 +11.5 JennisonDryden A: EurSelEqA42.77 +.95 +72.9 BlendA 20.08 +.44 +52.6 GrwthAp 14.72 +.32 +38.2 HiYIdAp 5.57 -.01 +20.7 IntValA 26.23. +.63 +77.3 InsuredA 10.45 +.05 +8.,0 MdCpGrA 16.51 +.34 +39.2 UtilityA 15.55 +.35+119.1 PionFdAp50.17 +1.08 +44.7 JennlsonDryden B: TxFreAp 11.06 0 +9.7 GrowthB, 15.44 +.35 +31.7 ValueAp 17.70 +.42 +41.1 HiYldBt 5.56 -.01 +19.0 Pioneer Funds B: InsuredB 10.47 +.05 +7.3 HwIdBt 11.14 +.05 +23.4 JohnHancock A: Pioneer Funds C: BondAp 14.64 -.02 +11.5 HiYldCt 11.25 +.06 +23.5 ClassacVlp 27.45 +.55 +39.8 Price Funds Adv: RgBkA 35.05 +465 +162 Eqthep 29.83 +60 +41.4 ShinAp 6.48 -.01 +18.3 Goro.hpn33.14 +.69. +43.5 John Hancock B: PrIce Funds: SIrncB 6.48 -.01 +15.9 Balancen 21.80 +429 .+35.9 John Hancock CIl1: BICipn 38.40 +.88 +38.5 LSAggr 15.50 +.35 NS CABondn10.71 +.03 +10.8 LSBalanoc 14.69 +20 NS CapAppn 21.45 +29 +40.3 LSGndh 15.31 +27 NS DivGron 26.37 +.55 +40.4 JulIus Baer Funds: EmEup 33.82 +.45+185.0 IntlEqlr 46.99 +.84+106.1 EmMklSn37.99+1.17+173.2 IntlEqA 45.95 +.82+104.5 EqIncn 29.90 +.60 +42.2 IntEqlllr 16.17 +.31 NS Eqlndexn39.34 +.85 +38.4 KeelSmCpp27.52+.69+79.1 Europen 21.69 +.50 +832 LSWalEqn19.35 +.41+53.4 GNMAn 9.32 -.02 +11.2 Lazard InatI: Growthn 33.44 +.69+44.5 EmgMkilt 23.39 +.60+171.4 Gr&inn 22.48 +.50 +36.1 Legg Mason: Fd HIthSdcin 28.51 +.46 +652.7 OpporTrt 19.53 +.48 +49.3 HiYieldn 6.81 ... +22.4 Splnvp 39.05 +.89 +44.6 IntBondn 9.61 -.01 +15.4 ValTrp 70.27 +1.41 +27.0 intDisn 52.20 +1.06+113,8 Legg Mason Instl: InOStkn 17.63 +,39 +68.8 ValTrlnst 78.78 +1.57 +30.9 Japann 1044 +.03 +33.2 Legg Meeason Ptra A: LatAmn 45.28 +1.47+284.1 AgGrAp 113.45 +2.32 +33.3 MDSirIn 5.11 .. +6.0 ApprAp. 16.06 +29 +353 MDBondnl10.29 +.04 +9.5 HilncAt 6.56 -.01 +20.4 MidCapn 60.75 +1,23 +1.8 inAICGAp 14.73 3 .963 MCapVaIn26.08 +.53 +62.7 .L.gCpGAp24,63 .48 ,a.i NAmern'34.13 +.76 +35.4 MgMuAp 15.41 +.04 +13.5 NAsian 18.79 +.74+177.1 NewEran55.05 +1.66+113.8 N Horizn 34.45 +.69 +53.2 NIncn 8.85 -.02 +12.2 NYBondn 11.00 +.04 +10.1 PSincn 16.29 +.15 +29.7 RealEstn 22.03 +.53 +65.4 R2010n 16.54 +.21 +37.1 R2015n 12.92 +.18 +40.2 R2020n 18.15 +.29 +43.3 R2025n 13.47 +.24 +46.0 R2030n 19.50 +.36 +48.9 SdTecn 23.42 +.55 +42.8 ShIBd n 4.69 ... +10.0 SmCpStkn35.09 +.77 +47.8 SmCapValn42.29 +,83 +52.8 SpecGrn 21.53 +.46 +54.1 Speclnn 12.09 +.02 +20.1 TFIncn 9.73 +.04 +10.9 TxFrHn 11.56 +.04 +14.9 TxFrSI n 5.30 +.01 +6.6 USTIntn 5.32 -.02 +8.8 USTLgn 11.34 -.04 +12.6 VABondn11.29 +.05 +9.6 Valuen 27.98 +.60 +47.5 Principal Inv: DiscLCInst 16.69 +.38 +40.5 LgGrIN 8.60 +.20 +47.8 Putnam Funds A: AmGvAp 8.98 +.01 +9.8 AZTE 8.96 +.02 +9.4 Convp 20.08 +.23 +33.6 DIscGr 21.87 +.43 +45.8 DvrlnAp 9.85 +.03 +18.3 EqlnAp 18.25 +.39 +46.4 EuEq 31.59 +.76 +88.9 GeoAp 18.14 +.23 +27.7 GIbEqtyp 11.96 +.32 +64.6 GrInAp 19.82 +.38 +32.1 HlthAp 58.35 +.66 +27.6 HiYdAp 7.80 ... +22.0 HYAdAp 6.06 ... +25.1 IncmAp 6.73 ... +11.5 IntlEqp 33.03 +.71 +78.6 InlGrlnp 16.52 +.36 +81.6 InvAp 14.90 +.31 +35.2 NJTxAp 9.04 +.03 +10.6 NwOpAp 50.56 +1.25 +41.2 OTCAp 9.97 +.19 +60.3 PATE 8.90 +.03 +9.9 TxExAp 8.54 +.02 +10.1 TFInAp 14.48 +.04 +8.8 TFHYA 12.60 +.04 +15.3 USGvAp 13.12 +.01 +11.3 UIlA p 14.53 +.36 +69.0 VslaAp 11.52 +.29 +44.5 VoyAp 18.38 +.36 +22.3 Putnam Funds B: CapAprt 20.49 +.42 +33.2 DiscGr 19.89 +.39 +42.6 DvilnB1 9.77 +.03 +15.6 Eqlnct 18.06 +.38 +43.1 EuEq 30,4 9 +.74 +84.6 GeoBt 17.97 +.23 +24.8 GIbEqt 10.87 +.29 +61.0 GINtRst 32.46 +.95+112.1 GrTnBt 19.49 +.37 +29.2 thBlt 51.54 +.58 +24.7 HiYwdBI 7.77 .,. +19.5 HYAdBt 5.97 .. +22.4 IncmrBt 1 .69 ... +9.1 IntGrln 1 16.19 +.36 +77.7 InlNop1t 17.06 +.36 +82.0 InvBt 13.57 +.29 +32.2 NJTxBt 9.03 +.03 +9.5 NwOpBt 44.77 +1.10 +38.0 NwValp 19.01 +.39 +34.6 OTCPB 8.69 +.17 +56.9 T.ALAt 8.55 +.03 +8.2 iFHI ,. 12.6Z,. +,04 .413.1 rl-.I 14.50, +.04., +6.7 BJ:l.2n 13.05 +.01 +8,8 Ut1lB3 14.44 +.35 +65.1 VistaBt 9.91 +.25 +41.2 VoyBt- 15.88 +.31 +19.6 RS Funds: CoreEqA 40.37 +.82 +42.6 IntGrA 19.85 +.58 +75.7 .RSPart 34.18 +.57 +47.9 Value 27.97 +.54 +63.4 Rainier Inv Mgt: SrhMCap 42.67 +1.04'+88.9 RIverSource A: BalanceA 11.23 +.14 +30.4 DEI 13.78 +.32 +70.2 DvOppA 9.37 +.20 +57.6 Growth 32.77 +.56 +37.6 HiYdTEA 4.25 +.02 +8.3 LgCpEqp 6.07 +.12 +35.9 MCpGrA 11.77 +.27 +39.1 MIdCpVip 9.67 +.23 +75.6 Royce Funds: iLwPrSkSvr 17.09 +.40 +50.8 MicroCapl 17.94 +.28 +65.7 PennMulr 12.00 +.28 +56.3 Premierlr 19.39 +.44 +59.9 TotRellr 14.18 +.29 +462 VIPOISv 14.89 +.34 +72.2 Russell Funds S: DivEq 50.98 +1.16 +44.7 InllSec 80.61 +1.76 +78.0 MStratlBd 10.24 -.02 +10.7 QuantEqS41.37 +.84 +36.8 Rydex Advisor: OTCn 12.42 +.35 +37.8 SEI Portfolios: CoreFxAnlO.13 -.02 +10.4 IntlEqAn 15.06 +.30 +76.3 LgCGroAn22.41 +.49 +33.0 LgCValAn23.17 +.49 +47.7 TxMgLCn 14.02 +.31 440.4 SSgA Funds: EmgMkt 28.15 +.88+173.5 InllSlock 14.46 +.32 +89,5 STI Classic: LCpVIEqA 15.61 +.33 +46.0 LCGrSIkAp12.86 +.31 +22.9 LCGrSIkCp11.95 +.29 +20.7 SalLCSIkCt 26.89 +.62 +24.5 SelLCpSIkl 29.16 +.68 +28.3 Schwab Funds: HOltCare 16.20 +.21 +57.6 10001nvr 43.08 +.92 +41.1 1000Sel 43.10 +.92 +41.7 S&P Inv 22.80 +.49, +38.7 S&PSel 22.90 -.04 +39.4 S&PlnstS111.68 +.25 +39.7 SmCplnv 24.11 +.59 +49.6 YIdPIsSI 9.42 -.01 .+11.1 Selected Funds: AmShD 47.54 +.93 +44.2 AmShSp 47.43 +.92 +42.9 Selligman Group: ComunAt 37.06 +.91 +75.9 FrontrAt 14.24 +.33 +47.3 FrontrDt 12.06 +.27 +43.9 GIbSmA 17.85 +.32 +69.7 GIbTchIA 17.88 +.44 +68.7 HYdBAp 3.25 ... +17.8 Sentinel Group: ComSAp 35.03 +.73 +44.1. Sequoia n158.81 +2.38+31.7 Sit Funds: LrgCpGr 43.53 +.96 +45.4 SoundSh 40.27 +.93+45.4 St FarmAssoc: Gwth 60.57 +1,25 +42.9 Stratton Funds: Dividend 32.15 +.91 +38.3 Multi-Cap 42.61 +.88 446.9 SmCap 48.95 +1.10 +55.9 SunAmerica Funds: USGvBt 9.21 -.01 +7.9 FLgCpAp 19.39 +.50 +21.4 Tamarack Funds: EnlSmCp 31.26 +.61 +39.6 Value 41.07 +91 +34.7 Templeton Instilt: EmMSp 22.57 +.53+127.1 ForEqS 28.89 +.53 +91.2 Third Avenue Fds: In lr 23.45 +.37 +73.2 RIEstVIr 3223 +.63 +57.4 Value 61.63 +1.15 +57.9 Thomburg Fds: IntValAp 33.41 +52+102.8 IntValuel 34.07 +.54+105.4 Thrlvent Fds A: HiYld 4.94 ... +20.8 Income 8.44 -.02 +10.7 LgCpStk 29.21 +.62 +34.5 TA INDEX A: TempGIbAp31.87+.76 +49.2 TrCHYBp 8.97 -.01 +18.5 TAFlxlnp 9.09 -.01 +9.9 Turner Funds: SmlCpGrn3097 +.87 +52.7 Tweedy Browne: GlobVal 33.14 +.05 +82.1 UBS Funds Cl A: GiobAllJot 14.58 +.18 +39.3 UMB Scout Funds: Intl 35.41 +.45+85.2 US Global Investors: AJlAm 27.29 +.87 +51.3 GIbRs 16.64 +.48+169.3 GOdShr 14.00 +.29+107.6 USChina 13.64 +.73+151.1 1.n a, Chy SAW . ~us - a.. rA. %. ~v -.r. a 3, ~ ..., '~1 4 WldPrcMn 25.22 +.47+131.0 USAA Group: AgvGt 34.99 +.81 +38.0 CA8d 10.58 +.07 +10.2 CmstStr 27.53 +.50 +37.5 GNMA 9:48 -.02 +11.4 GrTxStr 14.25 +.19 +31.3 Gnwth 16.07 +.40 +36.2 Gr&Inc 19.24 +42 +38.8 IncStk 16.76 +34 +38.2 Incox 11.99 -.07 +12.0 Intl 28.40 +.51 +76.3 NYBd 11.55 +.06 +9.9 PrecMM 27.01 +.73+111.4 SciTech 12.76 +.32 +55.4 ShtTBnd 8.86 -.01 +11.1 SmCpStk 15.38 +36 +53.2 TxEII 12.78 +.05 +9.2 TxELT 13.32 +.06 +10.0 TxESh 10.51 +.01 +7.6 VABd 11.05 +.05 +8.1 WklGr 20.90 +.38 +61.2 VALIC: MdCpldx 24.89 +.59 +51.6 Stkldx 38.20 +.83 +38.3 Value Line Fd: LrgCon 23.42 +.57 +53.9 Van Kamp Funds A: CATFAp 17.49 +.12 +7.0 CmstlAp 19.45 +.34 +39.6 CpBdAp 6.46 -.01 +11.3 EqlncAp 9.26 +.12 +37.2 Exch 466.91+10.38 +45.9 GdrnAp 22.50 +.42 +47.2 HarbAp 16.03 +.16 +26.3 HiYldA 10.37 -.01 +17.5 HYMuAp 10.62 +.05 +19.0 InTFAp 17.36 +.13 +6.2 MunlAp 14.03 +.07 +8.8 PATFAp 16.53 +.08 +8.5 StrMunlnc'12.74 +.07 +15.9 US MtgeA 13.13 -.03 +10.7 UtilAp 23.58 +.55 +68.1 Van Kamp Funds B: EnterpBt 13.70 +.32 +34.1 EqincBt 9.09 +.11 +34.1 HYMuBI 10.62 +.05 +16.3 MuIlB 14.01 +.07 +6.4 PATFBt 16.48 +.08 +6.1 StrGwtU 38.58 +1.05 +30.7 StrMunlnc 12.74 +.08 +13.5 USMtge 13.07 -.03 +7.8 UIlB 23.45 +.55 +64.3 Vanguard Admiral: CAITAdmrnlO.76 +.03 +8.1 CpOpAdI n9258 +2.41 +63.7 Energy n 138.16+4.03+137.7 EuroAdmin91.39+2.56 +89.8 ExplAdmln73.30 +1.60 +50.6 ExtdAdm n40.6 +.89 +56.1 500Admlnl35.22+2.93 +39.5 GNMAAdn1O.16 -.02 +13.1 GrolncAdn59.91 +1.36 +38.4 GnwAdmn31.68 +.71 +352 HthCrn 62.74 +.69 +42.2 HiYdCpn 5.94 -.01 +17.0 InlProAd n23.39 -.05 NS ITBdAdmlnO.23 -.01 +11.6 nlGrAdm n82.00+2.22 +84.0 ITAdmIn 13.05 +.04 +8.9 ITGrAdmn 9.64 -.02 +12.0 UdTrAdp n 10.67 +.01 +7.3 MCpAdml n94.77+2.12 +62.8 MuHYAdmn10.4 +.04 +11.9 PrCaprn786.69+1.76 +48.8 STsyAdmilnlO.40 ... +10.8 STBdAdmln9.96 -.01 +10.1 ShtTrAdn 15.58 ... +7.9 STIGrAdn 10.56 -.01 +12.0 SmnCAdm n33.71 +.80 +61.8 TxMCaprn 70.94+1.52 +44.3 TloBAdmn 9.95 -.01 +11.9 TStkAdm n35.36 +.77 +43.5 Va.dmln 27.02 +.56 +49.8 WellslAdm n53.59 +.36 +25.0 WenlnAdm n5823+.78 +40.9 Windsor n 63.66 +1.37 +44.7 WdsrlAdn64.26 +1.30 +49.5 Vanguard Fds: AssetAn 29.82 +.51 +39.4 CALTn 11.31 +.07 +10.4 CapOppn 40.05+1.04 +63.3 Convrtn 14.19 +.17 +35.0 DivdGron 15.13 +29 +43.0 Energyn 73.54 +2.15+137.2 Eqlnen 26.17 +55 +452. Expirn 78.65 +1.71 +492. FLLTn 11.34 +.04 +9.7 GNMAn 10.16 -.02 +12.8 GtobEqn 24.91 +.65 +79.0 Grolnn 36.68 +.83 +37.7 GrthEqn 12.05 +.31 +41.3 HYCorpn 5.94 -.01 +16.5 HhCren 148.58 +1.64 +41.9 InflaPron 11.91 -.03 +11.5 IntJExpIrn 22.53 +.49+105.0 IntlGrn 25.74 +.70 +82.9 IntlVaIn 43.29 +1.12 +88.1 flGraden 9.64 -.02 +11.6 ITTsryn 10.90 -.02 +11.5 UfeConn 17.03 +.16 +27.8 UfeGron 24,86 +.48 +45.0 Ufelncn 14.16 +.07 +19.8 feModn 21.05 +.30 +36.2 LTIGraden 8.88 -.02 +12.9 LT"sryn 11.03 -.02 +15.1 Morgn 20.36 +.48 +48,1 MuHYn 10.48 +.04 +11.7 MulnsLgn 12.21 +.06 +10.1 Mulnl0n 13.05 +.04 +8.7 MuLtdn 10.67 +.01 +7.0 MuLongn 10.93 +.05 +10.0 MuShrtn 15.58 ... +7.7 NJLTn 11.50 +,05 +10.1 NYLTn 10.93 +.05 +9.4 OHLTIEnIl.67 +.04 +9.7 PALTn 11.01 +.05 +9.7 Pre Mllrn30.77+1.02+162.4 PrmcpCornl3,37 +.29 NS Pnncprn 73.83 +1.69 +48.1 SelValurn21.61 +.43 +54.4 STARn 21.64 +.29 +37.2 STIGradenlO.56 -.01 +11.6 STFedn 10.35 -.01 +10.5 StratEqn 2422 +.55 +52.4 TglRe2025n13.68 +.24 +35.6 TgtRe2015 n13.04 +.19 +31.0 TgtRe2035 n14.58+.29 +42.3 USGron 19.17 +.44 +33.4 USValuen 14.94 +.32 +36.0 Wellslyn 22.12 +.15 +24.7 Welltnn 33.71 +.45 +40.4 Wndsrn 18.86 +.40 +44.2 Wndslln 36.20 +.73 +49.0 Vanguard Idx Fds: 500 n 135.20 +2.93 +39.2 Balancedn21.91 +.27 +30.1 DovMkln 13.39 +.33 +79.6 EMkIn 28.97 +95+156.6 Europe n 38.88 +1.09 +89.3 Extend n 40.40 +.89 +55.5 Growth n 31.67 +71 4+34.7 ITBrndn 10.23 -.01 +11.4 LgCaplxn 26.45 +.57 +42.1 MidCap n 20.87 +.46 +62.3 Pacicn 12.84 +.22 +60.1 REITrn 22.49 +.60 +672 SmCapsn 33.67 +.79 +61.3 SmlCpGthnl9.89 +.44 +57.8 SmlCpVIn 16.72 +.42 +44.8 STBndn 9.96 -.01 +9.9 TolBndn 9.95 -.01 +11.6 Tolllntln 19.18 +.51 +988.8 TotStkn 35.35 +.77 +43.1 Value n 27.01 +.56 +49. Vanguard Instl Fds: Ballnst n 21.92 +28 +30.6 DvMklnst n1328 +.32 +80.3 Eurolnstln 38.95 +1.09 +90.0 Exin n 40.48 +.89 +56.3 Grwthlstn31.08 +.71 +35.3 Inslldxn 134.19 +2.91 +39.7 InsPIn 134.20 +2.91 +39.8 TomBdlx3n50.17 -.08 +11.9 InsTSPIustn31.88 +.69 +43.0 MidCplst n20.95 +.47 +3. SCInsnl 33.73 +.79 +52.0 TEIstn 9.95 -.01 +12.0 TSInsln 35.30 +.76 +43.6 Valuelstn 27.02 +.56 +49.9 Vantagepoint Fds: Growth 10.12 +21 +32.9 Victory Funds: ODivnStA 1920 +.40 445.4 WM Blair Mti Fds: InlGthIr 30.683 +.85 +97.7 Weaddell & Reed Adv: CorelnvA 6.59 +.17 +512. Wasatch: SmCpGr 38.09 +.79 +41.6 Weltz Funds: Value 36.70 +.81 +26.0 Wells Fargo Adv: CmSlkZ 22.02 +.47 +64.5 Opptylnv 43.65 +.80 +43.3 SCApVaIZ p 33.789+.79 +68.4 Western Asset: CorePlus 10.16 -.03 +13.7 Core 10.98 -.03 +112 - -O. e - -Alm.-4b ft dip W i - mI e - - 0 S - - 0 0 - - "- -- "Copyrighted Material - S. Syndicated Content n Available from Commercial News Providers" * b- -ap -4b -..m m m qm ammm am 4 d-.-- - w3 - -3 _ -~ 0. - - ~- * -- 0. - - -. 0. * - -- - 0. -~- S I -~ MuquiEo m off&h4MmuIrn -0@ ~-*. - ~ ~ a . -r - - - 0. ~- -~ - ~- - -3 - - ~K. .-....E 0. -~ - - ~. *. 0. 0. ~3 -~ -~ 0. - - S.- m .a - S ~- m 0. - 0 -~~- - -~ - S. e - - ~ - - 40o smw . W* -doom .NNW 0. -~ a - - - e -~ --- - YRCOUI1YTHEIING aviDitchieldSince 1982 Audioprosthologist WE SERVICE ALL MAKES & MODELS Call today for yourFREE No Obligation Hearing Exam Se Habla EspanIl BEVERLY HILLS 746"1133 I NWYRKSTOKEXHNG Tkr Name Last Chg JBL Jabil 22,00 +.64 JNS JanusCap 27.40 +1.32 JNJ JohnJn 6186 +61 JCI JohnsnCtl 111.43 +4.80 JNY JonesApp 18.52 +.20 KBH KB Home 29.33 +.81 KBR KBR Incn 32.75 +.51 KFN KKRFncl 15.46 +.16 KDN Kaydon 51.25 +.60 K Kog 54.48 +.89 KWD Kellwood d19.89 -.37 KEY Keycorp 33.65 +.73 KMB KImbClk 69.36 +.87 KIM Kinco 40.92 +1.52 KMP KindME 50.12 +.12 KG KingPhrm 15.61 +.53 KGC Kinross g 11.62 +.47 KSS Kohls 57.75 +1.37 KB Kookmin 78,26 +1.76 KFT Kraft 31.92 +.14 KKD KrispKrm 6.76 +.20 KR Kr oer 26.17 +.55 LDK LD Soln 46.30 +2.02 LRT LLERy 1.33 +.04 LSI LSICorp 6.85 +.48 LTC LTCPrp 22.05 +.59 LZB LaZBoy 9.72 +.36 LG Ladede 32.71 +.87 LVS LVSands 101.21 +3.60 LM LeggMason 86.40 +1.22 LEH LehmanBr 5443 +15 LEN LennarA d28.10 +.87 LUK LeucNat 44.40 +.54 LEV Levitt d2.17 +.10 LXK Lenark 37.35 +.66 ASG LbtyASG 5.65 +.02 LLY Ulyi 56.32 +.22 LTD Limited 22.99 +.78 LNC LincNat 60.85 +1.62 LNN Undsay 38.57 +1.04 LIZ IJzCaib 34.39 +.89 LMT LockhdM 99.71 +1.92 LTR Loews 47.05 +1.03 LPX LaPac 18.31 -.05 LOW Lowes 30.15 +117 LUM Luminentif 1.64 +.03 LYO Lyondell 45.70 +.34 MTB M&TBk 106.60 +3.19 MBI MBIA 57.22 +.70 MDU MDURes 27.09 +1.24 WFR MEMC 58.69 +1.28 MF MF GloblIn 26.90 +.20 MCR MCR 8.40 +.08 MTG MGIC 31.58 -.71 MGM MGMMir 82.90 +.50 M Macys 31.69 +1.84 MAD Madeco 13.05 +.17 MGA Magnalg 89.01 +3.12 HCR ManorCare 63.10 +.28 MAN Manpwl 70.97 -1.10 MFC Manulifgs 38.47 +.99 MRO Marathons 53.70 +3.08 MAR MarnItA 42.96 +.50 MMC MarshM 26.33 +.31 Ml Marshlls 44.03 +1.13 MSO MStewrt 12.77 +.31 MVL MarvelE 22.30 +.27 MAS Masco 25.87 +.86 MEE MasseyEn 19.74 +.61 MA MasterCrd 133.42 +1.30 MSC MatedalScl 9.85 +.50 MAT Mattel 22.06 +.63 MDR McDermInt 90.98 +3,56 MCD McDnids 49.19 +.55 MHP McGrwH 49.79 +.56 MCK McKesson 58.25 -.05 MFE McAfee lf 35.60 +2.12 MHS MedcoHith 85.58 +.47 MRX Medlcid 30.64 +1.58 MDT Medalic 53.14 +.17 MRK Merck 49.92 +.71 MER MerrilLyn 7311 +111 MET MetlUfe 63.91 +.65 PCS MetroPCSn28.30 -1.63 MU MicronT 11.24 +.24 MAA MIdAApt 48.03 +2.30 MDS Midas 20.36 +.56 MIL Mlllpore 70.28 +1.21 MIR Mirant 38.81 +.42 MTU MItsuUFJ 9.65 +.17 MBT MoblueTel 63.68 +2.80 TAP MolsCoorsB88.25 +1.80 MON Monsanto 67.77 +2,31 MCO Moodys 46.04 +1.21 MS Morgotan 61.21 +44 MSF MSEmMkt 27.19 +1.10 MOS MosaicIlf 40.00 +1.21 MOT Motorola 16.47 +,30 MWABMuellrBn d11.16 -.05 MUR MurphO 60.32 +2.42 MYL MylanLab 15.18 +.22 NCR NCRCp 49.25 +.56 NRG NRGEgys 38.23 +.53 NYX NYSEEur 73.07 +2.00 NBR Nabors 29.87 +.71 NLC NalcoHId 27.07 +1.46 NCC NatCity 27.28 +.33 NFG NatFuGas 44.35 +1.24 NGG NatGrid 73.80 +1.29 NOV NOilVarco 122.76 +5.18 NSM NatSemi 25.90 +.42 NVT Navteq 59.87 +1.68 HYB NewAm 1.94 +.04 NJR NJRscs 49.90 +.90 NWY NY&Co 6.50 +.09 NYB NYCmtyB 17.60 +.46 NYT NYTimes 21.72 +.37 NCT Neweste 16.25 +.35 NWL NewellRub 25.72 +.22 NFX NewfldExp 42.79 +.51 NEM NewmtM 41.68 +.61 NR NwpkRsIf 5.51 +.30 NWS/ANewsCpA 20.43 +.43 NWS NewsCpB 21.85 +.48 NXY Nexen gs 27.40 +.05 NI NiSource 18.89 +.24 GAS Nicor 41.74 +1.03 NKE NikeBwi 55.46 +1.93 NDN 99 Cents 12.21 +.95 NE NobleCps 51.16 +2.00 NOK NoklaCp u32.18 +2.17 JWN Nordstrm 48.16 +1.40 NSC NorfikSo 51.57 +1.36 NT Nqrtel trs d17.60 +.08 NU NoestUt 28.03 +.29 NOC NorthropG 76.93 +.95 NVS Novartis 52.75 +.55 NST NSTAR 32.69 +.31 NUE Nucor 52.78 +1.56 NQF NvFL 13.18 +.14 NHI NvIMO 14.15 +.18 JPC NvMulSI&G 12.07 +.14 JPS NuvQPf2 12.64 +.14 OGE OGEEngy 33.39 +1.32 OXY OcciPet 56.24 +1.56 ODP OffcDpt 24.53 +.65 ORI OldRepub 18.22 +.12 OLN Olin 2127 +.85 OCR Omncre 32.67 +.28 OMC Omnicms 50.27 +.60 OKS ONEOK Pt 83.50 +.24 OSK OshkoshT 55.65 +1.72 PCG PG&ECp 44.58 +1.18 PMI PMIGrp 30.22 +.77 PNC PNC 70.72 +1.71 PNM PNMRes 23.80 +1.14 PKX POSCO 150.64 +12.08 PPG PPG 73.39 +2.11 PPL PPLCorp 48.02 +1.66 PKG PackAmer 25.70 +.90 PTV Paciv 28.78 +.62 PKD ParkDdr 7.89 +.21 BTU PeabdyE 42.10 +1.40 PGH Pengnrthg 17.20 +.04 PVR PennVaRs 27.92 +.53 JCP Penney 68.17 +326 PBY PepBoy 15.87 +.99 PEP PepsiCo 68.19 +.68 PAS PepsiAmer 29.15 +.12 PBT Prmian 13.79 +.36 PTR PetChina 146.20 +6.81 HK Petrohawk 14.83 +.50 PBR/APetrbrsAs 50.44 +2.39 PBR Petrobrss 58.89 +2.11 PFE Pfizer 2467 +.20 PNY PiedNG 26.53 +.91 PPC PilgrimsPr 38.45 +.77 RCS PimcoStrat 9.80 +.02 PXD PioNtd 41.05 +.91 PBI PitnyBw 44.49 +.80 PXP PlainsEx 37.99 +.88 PCL PlumCrk 41.40 +1.07 PPP PogoPd 49.88 +.65 Pil Polaris 47.65 +.87 RL Polo RL 75.07 +1.85 PPS PostPrp 39.55 +.78 POT Potash s 85.69 +2.71 PX Praxair 75.08 +1.04 PCP PrecCastptI33.29 +1.66 PDE Pridelntl 35.01 +.61 PFG PrinFnd 55.90 +1.70 PG ProctGam 65.12 +.42 PGN ProgrssEn 48.10 +1.15 PGR PrgCp d20.49 -.02 PLD PFoLogis 58.29 +2.00 PHY ProsHiln 2.96 +.04 PVX ProvETg 11.40 +.17 PRU Prudent 89.84 +3.63 PEG PSEG 85.87 +4.12 PS PugetEngy 23.56 +.52 PHM PueH 16.57 +.58 PYM PHYM 7.04 +.08 PGM PIGM 9.48 +.09 PPT PPrIT 6.27 +.03 NX Quanex 43.30 +1.13 PWR QuantaSvc 26.67 +1.42 DGX QstDiag 55.04 +.90 STR Questars 49.42 +1.57 ZQK Qulksllw 13.29 +.75 Q QwestCm 900 +18 RAS RAITFin 8.01 -.17 RPM RPM 22.58 +.42 RDN Radian 17.92 -.56 RSH RadioShk 22.87 +.67 RAH Ralcorp 61.86 +3,48 RRC RangeRs 35,99 +1.07 RJF RJamesFn 32.98 +1.42 RYN Rayonier 42.07 +.79 RTN Raylheon 59.45 +2.23 O Rltylnoo 27.21 +.99 RHT RedHat 19.12 +.45 RGC RegalEnt 22.15 +.58 RF RegionsFn 31.44 +.56 RRI ReliantEn- 25.38 +.85 REP Repsol 35.65 +.96 RVI RetailVent 11.56 +.36 REV Revlon 1.15 +.02 RAI ReynldAm 65.67 +1.54 RAD RiteAid 5.08 +.08 ROH RoHaas 56.58 +1.00 RDC Rowan 38.35 +1.30 RCL RytCarb 37.55 +.03 RDS/A RoyDOShllA 75.49 +1.89 RVT Royce 19.90 +51 RVTpBRoyce pB 23.39 -.30 RYL Ryland 28.81 +.56 SAI SAICn 18.11 +.35 SAP SAPAG 53.21 +1.63 SCG SCANA 38.48 +1.03 SKM SK1Tcm 27.11 +.27 SLM SLMCp 49.67 +.68 STM STMicro 16.88 +.56 SWY Safeway 32.03 +1.13 JOE StJoe 31.50 +1.00 STJ SUJude 43.89 +.67 SKS Saks 15.70 -.30 SJT SJuanB 31.95 +.43 SNY Sanofi 40.38 +.90 SLE SaraLee 16.63 +.42 SGP Scher= P 30.15 +.52 SLB SctmEg 95.72 +4.41 SSP Scripps 41.24 +1.23 STX SeaqateT 25.39 +.93 SEE SealAirs 26.21 +.43 SRE SempraEn 54.87 +1.27 SXT Senslent 27.75 +1.62 SHW Sheiwin 68.54 +1.13 SID SIderNac 54.40 +3,19 SRP SierrPac 15.30 +.31 SLW SilvWhtng 10.93 +.30 SPG SimonProp 91.04 +3.14 SKX Skechers 19.62 +.44 AOS SmithAO 48.33 +.68 Sll SmithIln 64.06 +2.55 SLR Solectm 383 +12 BID Sothebys 43.51 +1.99 SJI SoJerInd 34.08 +.83 SO SouthnCo 35.64 +.52 PCU SthnCopp s102.77 +3.89 LUV SwstAidr 15.29 +.29 SWN SwstnEngy 36.12 +.13 SOV SovrgnBcp 18.18 +.80 SE SpectraEn 23.18 +.86 S SOrintNex 1915 +52 SPF StdPac 9.26 +.66 SXI Standex 24.90 +.70 HOT StardMH 59.86 +1.27 STT StateStr 61.00 -.16 STN StationCas 86.60 +.50 STE Steris 28.14 +.63 GLD sTGold 66.07 +.48 SYK S er 66.75 +1.00 RGR SturmRug ,18.57 +.38 SPH SubPpne 46.46 +1.04 SUI SunCmts 28.00 +.47 SU Suncorg 86.18 +1.23 SUN Suneco 71.30 +2.88 STP Suntech 34.58 +1.23 STI SunTrst 78.55 +1.40 SVU Supvalu 41.92 +123 SNV Synovus 27.72 +.65 SYY Sysco 33.85 +1.11 TCB TCF Fnd 25.01 +.73 TE TECO 15.90 +.46 TJX TJX 30.23 +.79 TXU TXU Corp 66.83 +.64 TSM TaiwSemi 9.73 +.33 TLM TalismEgs 17.21 +.57 TGT Target 63.93 +2.80 THE TelNorL 20.99 +.40 TZT TeIcNZ 24.40 +1.35 TMX TelMexL 34.41 +.55 TIN Templeln 54.74 +1.11 TPX TempurP 28.97 +1.66 TS Tenars 47.36 +2.19 THC TenetHIth d3.40 +,06 TPP Teppoo 40.25 +.14 TER Teradyn 15.12 +.56 TEX Terex 76.94 +1.44 TRA Terra 24.48 +.83 TNH TerraNitro 92.43 +4.13 TSO Tesoros 48.94 +1.14 TTI TetaTech 19.52 +.60 TXN TexInst 3429 +87 TXT Textrons 56.79 +2.04 TGX Theragen 4.18 -.10 TMO ThermoFis 53.62 +2.14 TNB ThmBet 54,86 +1.15 TMA Thombg 11.16 +.24 MMM 3MCo 88.76 +1.14 TOW Tlder 65.17 +1.78 TIF Tiffany 48.12 +2.04 TWC TW Cablen36.16 +1.16 TWX TimeWam 1881 +.43 TKR Timken 34.30 +.96 TIE TitanMet 30.89 +.92 TOD ToddShp u23.13 +.18 TOL TollBros 21.54 +.48 TRU TorchEn u9.05 +.18 TMK Trchmrk 62.03 +1.55 TD TorDBkg 67.94 +1.27 TOT TotalSA 73.28 +2.11 TSS TotalSys 27.93 +.46 RIG Transocn 103.85 +4.00 TRV Travelers 52.04 +2.06 TG Tredgar 17.93 +.62 TY TriConl 23.64 +.30 TRB Tribune 27.38 -.48 TSL TrinaSoln 43.15 +3.58 TRN Trinity 36.87 +1.79 *TRX Tronox d9.99 -.09 TEL TycoBecn 35.36 +.24 TYC TycolntIn 43.48 +.80 TSN Tyson 21.26 +.44 UBS UBSAG 52.51 +.73 UDR UDR 24.57 +.66 UIL UIL Hold 30.74 +1.33 USU USEC 13.54 +.27 UST USTInc 48.93 -.53 UPL UltraPg 53.18 +.13 UBB UUniao 107.17 +2.65 UNF UniFirst 41.34 +1.45 UNP UnionPac 109.93 +3.11 UIS Unisys 7.39 +.27 UMC UtdMicro 3.17 +.12 UPS UPS B 76.08 +.74 URI UldRentals 32.33 +.29 USB USBancrp 32.31 +.51 X USSteel 90.16 +2.58 UTX UtdTech 74.35 +2.35 UNH UtdhlthGp 48.69 +.06 UNM UnumGrp 24.73 +1.00 VRX ValeantPh 16.01 +.39 VLO ValeroE 68.16 +2.14 WR VKSrInc 7.95 -.10 VAR VarianMed 40.75 +21 WC Vectren 27.51 +.56 VTR Ventas 36.98 +1.35 VE VeolaEnv 75.15 +3.23 VZ VerizonCm 42.23 +.71 VIAB ViacomB 38.81 +1.23 VIP VImpelCs 23.16 +1.59 VSH Vishay 13.08 +.43 VC Visteon 5.42 +.32 VIV VivoPart 4.59 +.22 VMW VMwaren 68.20 -1.58 VOD Vodafone 32.12 +1.15 VNO Vomado 103.65 +3.09 WCI WCICmts 8.62 +.33 WNC Wabash 12.80 +.25 WBC WABCOn 45.02 +.33 WB Wachovia 4849 +55 WMT WalMart 44,19 +79 WAG Walgm 44.84 +1.24 WLT WaJterlnds 24.55 +1.07 WM WAMuI 3664 +83 WMI WsteMInce 37.57 +1.28 WPI WatsnPh 29.73 -08 WFT WeaNdIdnt 56.58 +2.24 WRI WeinRIt 39.40 +1.28 WL.M Wellmn 2.23 +.05 WLP WellPoint 79.15 +1.15 WFC WellsFaro 35.98 +78 WEN Wendyss 32.91 +.22 WR WestarEn 24.48 +.65 EDF WAEMInc2 12.62 +.23 MHY WstAMgdHi 6.12 +.04 WIW WAstlnfOpp1l.45 +.03 WDC WDIgitI8f 23.00 +1.58 4 WU WstnUnn 19.14 +.24 WY Weyerh 67.63 +2.69 WHR Whdpl 95.44 +2.41 WTU WilmCS 949 +.19 WMB WmsCos 31.36 +1.28 WSM WmsSon 32.70 +3.13 WIN Windstnm 14.03 +.59 q WGO Winnbgo 26.80 +.44 WEC WiscEn 43.8 +1.30 WOR Worthgtn 21.19 +.77 WWY Wrgley 58.30 +1.04 WYE Wyeth 47.08 +.52 WYN Wyndham 31.24 +.90 XTO XTO Engy 53.43 +.95 1 XEL XcelEngy 20.76 +.69 "' XRX Xerox 16.94 +.46 AUY Yamanag 10.68 +.71 YUM. YumBrdss 32.34 +.07 ZLC ZaweCp 20.81 +.45 ZMH Zmmer 77.72 +1.64 ZTR ZweigTl 4.75 +.04 - . e - 0b.. - In'Il ,n I 1.%9 1) 850-1. I J.l CenterState -,1,132) A Bank Ph.-:,- w) .. "All th bank you'll ever need" 5.45% mr* 9 -Mo. CD *Annual percentage yield based on monthly compounding, 5,00S minimum deposit required. Subject to substantial penalty on early withdrawal Rates may change without notice. APY offered through August 31, 2007. THURSDAY, AUGUST 30, 2007 9A2 BUSINESS C FL C Its 4 IOA THURSDAY AUGUST 30, 2007 ronicleonline.com -] ~7T.Z~ ~-~-J iL iL 4~LJ~L -s "It is medicine, not scenery, for which a sick man must go searching." Seneca the Younger C TRUS COUNTY CHRONICLE EDITORIAL BOARD Gerry Mull BEST MEDICINE Community pharmacy a good idea News that three county tive office on the second floor of organizations are work- the courthouse. The card saves ing to secure financing its users an average of 20 percent for a community pharmacy is off the retail price of commonly welcome. John Marmish, THE I executive director of the United Way of United W Citrus County, says foragra large populations of a corn people live on fixed phar incomes and sacri- fice things like food OUR 01 or electricity in Offers order to pay for alterna essential medicines those w that they couldn't help I afford otherwise. prescr In a country as rich and powerful YOUR OPIt as the United .:rronicieo States, it is upset- commenirt a ting to hear resi- Ch'ronc dents being forced to make quality-of-life choices that cause them to go hungry or swelter in their homes without air conditioning in order to pay for medicines. Responsible government and bus-inesses--have recognized a need and have developed pro- grams to help and this program would offer yet another alterna- tive for those who cannot afford their medications. In September 2006, the Citrus County Commission launched its free prescription drug card pro- gram. Cards are available at the county's libraries, health depart- ment, senior centers, the Lecanto Government Building and in the county commission administra- ThInk you very much S0o In response to Harry Cooper's letter to the edi- tor, dated Aug. 22, in response to somebody else's letter, I just want to say to him, thank you, sir, very much for myself and my family. I appreciate your letter to the editor. 5 We support you 100 per- 563. cent in your ideas. Texas connection The only similarities between the Vietnam war and the Iraq war is they both had a Texan in the White House trying to run the war and both didn't know what they're were doing. Cleaning investment In response to the Sound Off with people complaining about the fire- fighters wasting water washing their fire trucks. Apparently, you never had enough intestinal fortitude to become a firefighter or you would know why fire trucks and equipment are cleaned. No. 1, you are talking about an investment of $350,000 to $500,000. When you go to a fire, there are contaminants in the air that get on the truck and the equip- ment that can possibly mess them up. You are keeping that investment clean. That's taxpayers' money. Unless you know what you are talk- ing about, check into the total pic- ture before sounding off. Stop screaming It would be so nice if that man who screams his lungs out at the Devil Rays games in St. Pete would stay home some time and watch it If n ]r b i 2 b -i prescribed drugs. SSUE: Wal-Mart has been offering $4, ay applies 30-day generic pre- it to build scriptions on select- munity ed medications for macy. more than a year in Florida and Publix PINION: started a free pre- another scription program tive for this month for ho need seven popular Buying medications. options. But even with these programs, NION: Go ,,.: some residents are mine.. or: to still unable to bout today 's afford their medica- esdtorl tions, which is why this new program deserves community support. Officials with United Way of Citrus County, Citrus County Support Services and the Citrus County Health Department are working to secure $300,000 to build a community pharmacy. The community pharmacy would charge their medicines at the wholesale price, plus an additional $4. A wide variety of medicines would be available in stock or within a few days of placing an order, providing peo- ple with a wider range of help. The idea of bringing a commu- nity pharmacy to Citrus County is a worthwhile endeavor that deserves the full support of the community. ^ on television so we can hear the announcer. This is disgusting. Ban pit bulls Michael Vick said that they confiscated 60 dogs. But now the SPCA says 20 that it will have to put to sleep about 55 of these 05 animals, because they 059 were raised to be aggres- sive. So, they are killing the dogs anyway. I think they should make the pit bull dogs illegal. Mow the weeds I was just wondering how they can spend millions of dollars on U.S. 41, south of Inverness, and then cannot mow the weeds that are three feet high. I think they should mow the weeds very soon. Motorcycle speeding I was in Inverness about 7 p.m. on Thursday, and I see this kid on this motorcycle running all through the city at about 140 miles per hour. I am not kidding, really that fast. These deputies are just follow- ing him around without lights on, they are not doing anything. The kid stops in the intersection, and gives them hand gestures, and they don't do anything. I flagged one of the deputies over and asked him how come they are not stopping this kind of insane driving? I was told that their supervisor told them they don't chase motorcycles in Citrus County. This is crazy! These people are going to get somebody killed. Sheriff's office needs to get some guts and go after these people. 'My reputation has bee] Response to Aug. 28, 2007, Post-Determination Findings by Robert Battista. N eedless to say, and although the out- come was expected, I am extremely disappoint- ed with Mr Battista's deter- mination. However, as stat- - ed, I am not surprised. After all, as County Administrator June Fisher testified, Mr. Tom Battista was involved very GUI early in this process and, in COL fact, even provided legal advice to Fisher from April 30 to May 14 when the allegations against me were being formulated! Based upon his direct involvement, he could not realistically be expected to render a fair and unbiased decision, as he would be compelled, in essence, to acknowledge that his suspicion that I had violated the Sunshine Law was unfounded. Nonetheless, I still retained a sliver of hope that the injustice imposed upon me would be rectified. Mr. Battista's determination con- cludes any administrative remedies afforded by the county, and I will now consult with my attorneys on our next course of legal action. The record creat- ed at the post-determination includ- ing the findings by the State Attorney's Office, which cleared me, as well as the stigmatizing allegation in Administrator Fisher's notes in my public personnel file, which falsely and maliciously accused me of being under the influ- ence of alcohol on the job will form the foundation for future legal actions. My reputation, character and good standing in this community have been severely damaged, and my future employment opportunities are compro- mised. Therefore, I have no choice but to seek retribution in another, and cer- tainly more just, venue. The record speaks for itself. Specifically, rather than Administrator Fisher and Mr. Battista acknowledging that their suspicions were in error, they have ignored the legal analysis that no Sunshine Law violation occurred by Mark Simpson, a 17-year veteran in the State Attorney's Office, which was also ratified and endorsed by the State Attorney himself, Brad King, in a subse- quent letter offered into evidence. Rather, Administrator Fisher and Mr. Battista placed more weight on the hur- *4 Available Dick EST UMN ried research of Mr. Battista's Assistant County Attorney. One must ask why the county was not pleased, even relieved, by the State Attorney's finding? The logi- cal answer because he and Administrator Fisher (as well as two commission- ers) are aligned in their dis- like of the former county administrator, with whom I continue to associate as a former boss and longtime friend. Mr Battista's decision has also ignored the testimony of Cathy Taylor, the finance/OMB director, who testified on my behalf and supported that no administrative regulation was violated, even though she authored the administrative regulation I am charged with violating. Rather, he places more weight on the opinion of Administrator Fisher, an 8-month employee. One must again ask "Why?" The logical answer once again because he and Administrator Fisher are aligned in their dislike of theformer county administrator, with whom I continue to associate. Mr. Battista discounts that political "currents" existed that led to this termi- nation, citing that I could have called senior staff members as witnesses to support this allegation. I chose not to involve these individuals at this time, to protect them from potential retaliation. After all, they are still employed by the county and must work with Administrator Fisher, County Attorney Battista and all of the commissioners. His findings are silent to Administrator Fisher's testimony that other county employees, such as were revealed dur- ing the hearing, such as Nancy Williams, former assistant to our past county administrator, and Susan Jackson, were both removed from their positions because of their continuing communications with the former coun- ty administrator Why? Moreover, the purpose of the post-determination hearing was to address and defend the charges levied against me, rather than advocating my free association claim under the First Amendment. Mr. Battista acknowledges that, as the appointed acting administrator, I was empowered to make decisions neces- sary to respond to "emergencies and n damaged' time-sensitive issues," but felt I should have contacted Administrator Fisher Mr. Battista ignores that I did communi- cate my actions to Administrator Fisher, that very same evening, in the manner in which I was advised to do so by" Administrator Fisher (via e-mail). Mr. Battista's determination is myste-, riously silent to the fact that' Administrator Fisher admitted she had3 ample time to correct the allegedb Administrative Regulation violations' when she returned to the office (which r was only one day after the RFP was : issued and before the board meeting, allowing the RFP to be recalled and still go before the board on May 8). However, with no credible explanation proffered during the hearing, she admitted she took no action to do so. How, then, can this be considered such a grievous offense, as she now asserts? The questions raised herein clearly lend themselves to the implication that Mr. Battista's post-determination find-; ings were nothing more than a foregone conclusion. The facts neither support the allegations nor a basis for my firing,. despite their desire for my termination. I firmly believe Administrator Fisher and Mr. Battista felt the initial allega- tions, including the baseless reference to me allegedly being under the influ-. ence, would lead to a quiet resignation. Because these allegations did not lead I, to a resignation, they must now ignore i evidence and logical conclusions to fos- r. ter their plan to remove me from my . position. This was done under the guise of policy and statutory violations, which are merely a pretext to the real motive namely, because of my association with the former County Administrator, in violation of my Constitutional rights under the First Amendment. I have placed my faith in the Lord and know my family and I will endure this hardship. However, I still miss my job, I miss my former co-workers who now fear for their jobs if they are seen asso- ciating with me, but most of all, I miss the opportunity to complete my career i goal of serving the residents of Citrus, County for a minimum of 30 years. Ii Tom Dick is the former assistant county administrator. He worked for the county for 25 years and had his : termination upheld-Tuhesdayby - County Attorney lRobeifBatti'sta. "Copyrighted MaterialS. 4, Syndicated Content from Commercial News Providers", -4 CFCC's promise for the future T his year, Central Florida Community ~ College has celebrated 4 its 50th Anniversary with the slogan "Pride in our Past ... Promise for the Future." I ( thank the community for - helping us commemorate this significant milestone. \ The past few months have been exciting for us as we M& recognized our founders, Cha reconnected with many Da alumni, celebrated the GU accomplishments of our fac- COL ulty and staff, and, most importantly, the thousands of students who have attended CFCC. While celebrating the past has been appropriate, it is time for us to focus on the next 50 years our "promise for the future." Planning for the future is a difficult task, perhaps more challenging than that taken on by those who helped to create Central Florida Junior College 50 years ago. When no college existed, it took vision and courage to create one. We were very pleased to be able to open the Citrus Campus in 1996. Fifty years later, the college aspires to create a new vision for the future. aS iL L - CFCC today is a mature, comprehensive center of learning with facilities in three counties and a sig- nificant student enroll- ment. The college enrolls Nearly 18,000 students annually in credit and non-credit programs, and offers a wide array of pro- grams and services. The rules R. institution is a significant sance part of the cultural, social IEST and economic life of the .UMN region, an oasis where the community can quench its thirst for learning and its desire to determine how best to pro- tect and enhance our quality of life. The college faculty and staff are presently engaged in thinking about our "promise for the future," about where we should focus our attention for the next 50 years. I invite the com- munity to join us in this endeavor. What does the community think CFCC should promise for the future? What do you want to see for the future of the Citrus Campus? Some of the questions and promises we are thinking about include: M What should we promise about access to the college? What programs will we offer? How should we be accountable " about the learning we provide? How should we assure the most efficient use of public funds? What should be our role in pro- moting economic, social and cultural development? It is not easy to see the future, but we think it is important for us to make a public statement about the college's role in shaping that future. I invite you to send your ideas and comments about the "promise for the future" of CFCC. You may do so by vis-, iting our Web site at and clicking on a special link called "Promise for the Future." You may ' make comments directly on that site or you may send your comments to: Promise for the Future, Central Florida Community College, 3001 S.W College Road, Ocala, FL 34474-4415. Thank you again for 50 years of great support. Join us to plan the next 50 years. Charles R. Dassance is the president of Central Florida Community College.. . ('r',rrc CnUUVIYTNJV /L1 CuunKIVIWX INAIN-HRSA, UUS.0,207 FBI inv Atigang utrin of bomb bm t, b 1 4o 4ow- o ii 4w 041mosat 4 f am 4 m 4 obON * 41- uws ow40000 - qU~ o 9004NWal owao dip 40010 f s UMdo- MMM -d qfw- 41 04p4 Obd~ 4 dt0 40 - o- -o 4 0 oq 4w' 0 am si ob 9omp 4owto aw umt *moU mom * 4M W- -40 o- *ampl Ab 4@M*4b-M 4b 4b MW b mM 41011 ..4 eMMMU imb mo vqb - '114 4w4 M40MSM *MUM tomm -b - C - - U- .. "Copyrighted Material - - Syndicated Content- S-Available from Commercial News Providers" 41b40w - D - a - SUMMER S UMMER- 5P iJ IESU ERSMMRSUM5 SINCE 1926 *NO INTEREST FOR 24 MONTHS OR 10% OFF "i ON PURCHASES OF 30" & LARGER BIG SCREEN TVs 10% OFF CANNOT BE USED WITH 24-MONTH FINANCING. CASH. CHECK, CREDIT CARD, OR OTHER FINANCING PLANS AVAILABLE. Not applicable to prior sale. Cannot be combined with any Rex coupon. Financing is subject to credit approval Financing Is provided by CttlFinannlal Retail Services Division of ChiCorp Trust Bank, IDo. Offer applies to purchases of 30" and larger big screen TVs made through September 1, 2007. Minimum monthly payments required at 1124- of amount financed for no Interest to be enlarged during pro- motional period. If account not paid In full by expiration of promotion- al period, standard rates and charges apply Standard rate 23.99% APR. Default rate 26.99% APR. Minimum monthly finance charge S.50. Offer Is valid for individuals. not businesses. Other financing plans available. See store for complete details. EXPIRES 911107. PLASMA HDTVs HITACHI 42" WIDESCREEN PLASMA HDTV WITH PictureMasterT HD IV VIDEO PROCESSOR, 3 HDMIT INPUTS & TABLETOP STAND 1099 -111 After $9--* 10% 0ff 9 HITACHI 50" PLASMA HDTV....1999-200=t1799* After 10o of MAGNAVOX 50" WIDESCREEN PLASMA HDTV WITH DOLBY5 DIGITALDTS, HDMIP INPUT, COMPONENT HD -. INPUTS, SMART PICTURE & SMART SOUND S1666 -167 |--,MI. ,off 1499* LCD HDTVs 32" WIDESCREEN LCD HDTV WITH 1366x768 RESOLUTION, 1200:1 CONTRAST RATIO, SURROUND SOUND '666 & HDMI INPUT -67 After s.,9 0% off599 26" LCD HDTV.........*499 MAGNAVOX 42" WIDESCREEN LCD HDTV WITH ATSC/QAM TUNER, VIRTUAL DOLBY --- SURROUND, HDMIT- m MAG IV -.c INPUT, MULTIPLE AV INPUTS, $1110 SMART PICTURE & SOUND i f ,O s999 OODanbyj ROPER EXTRA LARGE 2.5 CU. FT. CAPACITY WASHER W/4 CYCLES & 3 WATER LEVEL SELECTIONS - Spreckle Porcelain Ba l Per- rrmanent Presa cyclEI-Hea. Duty Cycle s 1 9 #RTM4100IOSQ *2 v AVANTI 5.3 CU. FT. COMPACT CHEST FREEZER * Adjustable Thermosai Remoir. able Storage Basrsi fa3st Freeze Switch Ea y To CiRan interior I NCF142 Ti 1 16.5 CU. FT. REFRIG.-FREEZER WITH GALLON DOOR STORAGE S2 Siloing S ief ss, Tmin Wnite Crispers Siall, Conasn-r 110W6ts cDairy AAA Door 16359 DANBY 1.7 CU. FT. COMPACT REFRIGERATOR, IDEAL FOR OFFICE, DORM., DEN OR COTTAGE SRev.arstl.ls Door mHlrmge Ilr.A,,r3.)d Hanal5 Larao toila i Doo:rDesign. r.-,aer $7 CO rpanmep l cr, C l i( n 1 0 , -- -10* f 6al9 In Rooo t,% !19 4-PIECE FRIGIDAIRE KITCHEN ARAI.NCE-CLEAflANCEPCLEARNCE CLEAffb NC E, L.'IUFt'lAfVE'- CM Eli FfANC.Em AIR CONDITIONERS AMANA 5,200 BTU ULTRA QUIET AIR CONDITIONER WITH 2-SPEED FAN AND TOP DISCHARGE AIRFLOW * Easy Access WaShable Filter SEnvlroCleanm Cool Easy To Install Mounting Kit. #ACA057F --- * 9.7 EER 89 09w , -- AMANA 10,000 BTU A/C WITH 3-SPEED FAN, UV AIR SANITIZER, DIGITAL TIME & TEMP. DISPLAY & ELECTRONIC REMOTE - 24-Hour OnOfT Tlmer Ultra Quiet Opemthon Top Discharge Airflow. #AC106R 229 ,o0miumm29 AMANA 6,000 BTU AIR CONDITIONER WITH UV AIR SANITIZER, DIGITAL TIME & TEMPERATURE A DISPLAY AND ELECTRONIC REMOTE '14u IACB065R 97 EER AMANA 12,000 BTU AIR CONDITIONER WITH 3-SPEED FAN, UV AIR SANITIZER, DIGITAL TIME & TEMP. DISPLAY AND ELECTRONIC REMOTE p2iM #ACD125R 98 EER VIDEO COMBOS S y TOSHIBA 14" FLAT SCREEN t* TV/DVD PLAYER COMBO WITH DIGITAL PICTURE ZOOM, DOLBY& DIGITAL/ B DTS, JPEG VIEWER .-I TOSHIBA TOSHIBA 24" TVIDVD COMBO......6249 SAMSUNG 32" WIDESCREEN LCD HDTV WITH 3000:1 CONTRAST RATIO, 170/170 VIEWING ANGLES, SRS TruSurround XTm, PIP & 2 HDMIm INPUTS $999 -100 er s899,* 10% o SHARP 46" WIDESCREEN 1080p AQUOS LCD HDTV WITH 176011760 VIEWING ANGLES, 10,000:1 CONTRAST RATIO, ISHAIP -- 2 HDMI" INPUTS & TABLE 2199 STAND -220 19 0Attr 1979* SHARP 52" 1080p LCD HDTV....s2999-300=$2699* Afer 10% Off AUDIO HI-FI IM I SOOW i SONY 500-WATT 5.1 CHANNEL ANV RECEIVER WITH DOLBY> DIGITAL/EX, DOLBYt PRO LOGIC II DECODING, HDMITm PASS-THROUGH & DIGITAL CINEMA SOUND _ eSTR.DG510 189 JVC 5.1 CHANNEL PROGRESSIVE SCAN 5-DVD/CD HOME THEATER SYSTEM WiOMNI-DIRECTIONAL SURROUND SPEAKERS PLUS SUBWOOFER & DOLBY11 DIGITAUDTSIPRO LOGIC II DECODERS SJ-gW JVC MICRO COMPONENT SHELF SYSTEM WITH 5-CD CHANGER, MP3 PLAYBACK WITH ID3 TAG, 2-WAY BASS REFLEX SPEAKERS & USB S d AUDIO INPUT aUXG50 H29 !R MICROWAVES MAGIC CHEF 0.7 CU. FT. 700W MICROWAVE OVEN WITH IN__-i ONE TOUCH COOKING, VtCh- 10 VARIABLE POWER LEVELS, AUTO DEFROST AND TURNTABLE MCB7OW J * FRIGIDAIRE 1.5 CU. FT. OVER-THE-RANGE MICROWAVE OVEN WITH 950-WATTS, 11 VARIABLE POWER LEVELS, ONE-TOUCH COOKING, POPCORN SENSOR & 14" GLASS TURNTABLE aF MV.156DS FRIGIDAIRE ELECTRIC RANGE WITH SUPER CAPACITY 5.3 CU. FT. SELF-CLEANING OVEN & ELECTRONIC OVEN CONTROLS * Black Glass Ovcn Door Storage DraAer Ciorro- Boils Wiln Cups nFEF352FW FRIGIDAIRE 18.2 CU. FT. REFRIGERATOR-FREEZER WITH GALLON DOOR STORAGE * 2 Saloing Snelves 2 Clear Crispers. 1 Wlth Humairy Conlroi Clear Dairy Door #FRT8B5HW FRIGIDAIRE BUILT-IN DISHWASHER W/5-LEVEL PRECISION WASH SYSTEMS, BIG TUB"T DESIGN & 10006 FILTERED WASH WATER * UilraQuiel iI" Insulation Package Energy StarE Com- pliant Stainieas Steel Food Disposer .* \ariaoie Delay Stan SFDBIO50RES I VVICD CHANGING, . 2Oow TOTAL SYSTEM M POWVEk- OUR RAINCHECK POLICY: Occasionally Due To Unexpected Demand Caused By Our Low Prices Or Delayed Supplier Shipments We Run Out of Advertised SpecialE. Should This Occur, Upon Request We ,Iii Gladly Issue You A Rainciteck. No Dealers Please. We Reserve The Rignr To Limit Quantties. * Not Responsiole For Typograpncal Errors. Correction Notices For Errors In This Advertisement Will Be Postea In Our Stores. This Advertisement Includes Many Reductions, Special Purchases And Items At Our Everyday Low Price. 084 PROJECTION TVs HITACHI 57" WIDESCREEN PROJECTION TV WITH HD S CAPABILITY, SPLIT SCREEN PIP, AUTO CONVERGENCE S1099 J L"^ ~ & HDMI"A INPUT .-1 -110 HITACHI[ Afer * HITACHI 10% Off 989 HITACHI 65" PROJ. TV.... .. .. .. 1444-145= 1299 Aftr 0r.s Of SONY 50" WIDESCREEN LCD PROJECTION HDTV - WITH 3 LCD TECHNOLOGY, SRS TruSurroundtm XT & 2 HDMITm INPUTS After S11 9 ,... -- 10% Oft 1 -- SONY. SONY 42" PROJ. TV......s999-100=1899* After 10 Of COLOR TVs SAMSUNG 27" DynaFlatrv SlimFit"T HDTV WITH SRS TruSurround XT, 20-WATT SPEAKERS & 2 HDMI - INPUTS 379 E .. *r ".... ., SONY 36" FD TRINITRON WEGAT FLAT SCREEN DIGITAL TV WITH ATSC DIGITAL TUNER, DOLBY DIGITAL $555 & SPEED -56 SURF . After s499* 10% off SONY 27" WEGA-' TV......s349 SONY 34" 16:9 WIDESCREEN FD. TRINITRON WEGAT XBR FLAT SCREEN HDTV WITH ATSC DIGITAL TUNER, DOLBY DIGITAL AND HDMIT INPUT '666 -67 10e, 599* 10% Off F DVD PLAYERS ITOSHIBA| 1 TOSHIBA PROGRESSIVE SCAN DVD PLAYER WITH ColorStream, WMA/MP3 PLAYBACK, JPEG VIEWER, DOLBY DIGITAL/DTS, DivX PLAYBACK & REMOTE $4 DVD PLAYER/4-HEAD STEREO VCR COMBO WITH PROGRESSIVE SCAN AND DVD Video, DVD-R/RW, CD-R/RW, Audio CD, MP3 PLAYBACK 188 CAMCORDERS JVC SUPER VHS & VHS ET - CAMCORDER WITH 25x OPTICAL/1000x DIGITAL , HYPER ZOOM, 320k . PIXEL CCD AND 2.5" LCD MONITOR [$179 Bvci 7: CAR STEREOS .1W' p3 pLAYBACJK I Am's 60-WATTS PEAK POWER AM/FMICD/MP3 RECEIVER WITH DETACHABLEs FACEPLATE, PRESET EQ $49 & POSITIVE BLUE LCD vPMPi 4 DEHUMIDIFIERS WHIRLPOOL 25-PINT DEHUMIDIFIER WITH ADJUSTABLE HUMIDISTAT - Energy Star Con-pliant AccuDry " System EZ-Emptyr- Bucket Bucket Full indicator Light Direct Drain Hose Connection tAD25BSR 9 9 ...ri -.. . f.I U 4 01 N [ROA] 1----T1 | CRYSTAL RIVER MALL BTATE ROAD A4 CRYSTAL RIVER 2061 NW HWY. 19 AI 7 5li IVh l r i J l.' ll .ll hl u. 795-3400 BUSINESSES, CONTRACTORS OR SCHOOLS CALL: 1-800-528-9739 SUNDAY 12pm-6pm DAILY lOam-Bpm ... I.J ~ ~ ~ ~ ~ ~ ~ ~ " 1.1, 1J .B --------- ^ I a 1 CiTRus CouN7y (FL) CHRONICLU f, THURSDAY, AUGUST 30, 2007 IIA NATION f 'l: . 11 IF V*O 12A THURSDAY AUGUST 30, 2007 Nation & Worl CITRUS COUNTY CHRONICLE eln -e I o ,, ahr, r -a - a a 40PIM4mom lla p0 nom eq a m mmS a NII 4 11uw, S 41 llb 40 44 dMIM . .-.. - AF S.- .. ,. .. .... .... a-- .N a.k.. a. a - City marks t rm's annivrrMW * ........... 4M- V es -'Availabl S W - *- a. - Militia must , .... .........u... hn m . ders" -ims a 4000 e e1a=aPem mMa a e 1a a eQwNNlw Mmo lomllw 40 a am, a .omn a a a 4a am*q wmMo owMa A aw bw Am ao f f r omf41. t w (en a jh. -d1 0a4 aumme loe S .on inee** -~ ~".O a - a a" -~ '-~ a -a 4a--a .* ... U- .me -~.- me ~"- ~1~. -..- "'".me e -- a-a We1 .. r - WA - , "_. amuh a - a4 --ae0 a - a * .1m 4100b q-" -Mas -a-f a amb wmmommm . a am a. -sa - k -.&~wm- m- r 41 as m a. 4wm -6 - ftO FInu w nmhr p JihtxtJcr iri fw in -mav $4" nsu .... -:: a.. ..ah - mi- - a ~="""' =l= :J= ==:::= m **i&: * Football/2B * MLB/3B * TV Schedule/4B N Outdoors/5B * Entertainment/6B ,4 B THURSDAY AUGUST 30, 2007 Williams sisters advance at U.S. Open I-, "Copyrighted Material -Syndicated Content - Available from Commercial News Providers- - -,^ Jiel t - -0ho -~xm -40. u--w -.map 4*mm Girls volleyball preview Seventh Heaven County volleyball teams trying to reach promised land ofplayoffi JONATHAN DEUTSCHMAN jdeutschman@chronicleonline.com Chronicle Seven Rivers may be a small school, but for the last few years it's been home to one very large volley- ball talent Unfortunately for the Lady Warriors' opponents, Rachael Capra still has one year left, and she no doubt plans to make the most of it. "Whenever you get someone like Capra on your team, that's huge." said head coach Tim Bonwman - "She's kind of what we're building around." If Seven Rivers .can carry over some of last year's momentum, that likely won't hurt. In 2006, the Lady Warriors finished 22-7 and made it all the way to the Elite Eight in the state Class 1A tournament. But Bowman isn't satisfied. He wants the district, the region and anoth- er shot at the state title. "I really think getting to the Final Four is a legitimate goal," he said. "Anyt thing but... would be a disappointment" Bowman was optimistic that the talent in this year's unit can over- come the main problem facinrig Lady Warriors teams of the recent past: finding their biggest playmaker in handcuffs. "Before, when teams would shut .6 " Capra down, we didn't have an answer," he said. "This year we have a lot of options." When asked about the general outlook for the 2007 season. Bowman didn't hesitate before offering his assessment. "Really good which is something we've come to expect." Though Seven Rivers has deliv- ered on their expections in recent years, the other local schools have high hopes as well. Experience will be the key w ord for the Lady 'Canes this season. Alice Christian is entering her- second year as Citrus High's head coach, and will be mentoring a lot of familiar faces. The Lady 'Canes only lost two players Rachel Fults and Jackie White to graduation, and will have eight seniors on their team at tipoff. Please see VOLLEY/Page 2B Seven Rivers senior Rachael Capra (1) will lead the Warriors in their pursuit of another playoff berth. lp-. ummOEN*0s li- am-b e 4 an n a Gqo- om - NEN Of- ab6 n amo -f "Copyrighted Material Syndicated Content: Available from Commercial News Providers" ( 19 ,T6. gear up fir Rank ,g~E Ifa F Chronicle File Photo w m Alk.- 2" 2B THURSDAY, UGUST 30, 2007 inn""-IAT Cms oLn (L CANLL LSU, Bu m j Idl - J - S WIV how-- SEC w~ - a aa.... Sb : ": S'"' ' OW aom ...: iqemli. k~pl '=.f ::. -e a t a ". .. Q .. w- A a s 0 . *. * - filg 4he 4 MMAMb aomIda40- "S0qu a o& p *6 m" amo-6 so a mflkw at - a4M am ip f0 l 2 40e =...' ... .M..=.. e. "" - "Copyrighted Material K.. Syndicated Content - a. 'Available from Commercial News.Rroviders'ACC Damr A mnpi "r . --- a aOW S 4. S . .. ., .. a 4."* *.. '0'-< h~mae4amb 4 6om i w- .n 441W b w a i.. .. .,,. . . , N::::...-. a .... a' .-, r * , SK . o .e a. :'r ik 9.-". .-. a . a - Aft 0 ' .5...- ..... MR I.". " i.=. =. '***... f .i. ". .: .. ..... a - S. 'U .- *1W 9 ~~-" r NW- .4 * 9 ~- -a. 9 9 a-. 'N 'a. mm a m- ,. rF " NN-e aw e m a* b0 -4w a 4 W qm d ........... -0 4 wo 4001 MM~MW O a '4m .0Ma a .m NAP dow ma.. - 9K **A - a. .===. ,. .mp N. .... a-a il>>i,...i. m. m. I"-N I" S " 1t ... i* ,,,- .. -, ,,.. *" k- a*-- I,. W-'0l ' " .<* - .- ..: --..0 ... .* ,.. ... ". . ' E- aMI .... ala. 4"lm -y '9e::: CKlN . I-. .. 'V -/ 1 a m *- .a ..... t-==W// *** =B. *lllli .= a. =.. 4" allll" O ,* " a.. "-. t- - VOLLEY Continued from Page 1B Citrus will be looking to improve on a mediocre 2006 season, when they went 7-12. The bevy of skilled hands and a few fiery newcomers may jumpstart things. Crystal River took a momen- tous blow in the offseason, los- ing the fearsome Brandy Worlton to graduation and a Division 1 scholarship. The Lady Pirates were the No. 2 seed in district play in 2006 and will have to rely on some green- er players to match that status this season. "We've pulled up about six girls from J.V," said coach Meryl Weber. "We're a young team." Lecanto was 14-11 in 2006 and advanced to the regional quarterfinal. Seven Rivers Lady Warriors 2006 record: 22-7. Coach info: Tim Bowman is in his third year as head coach. Key losses: The Lady Warriors lost four seniors, but Bowman did- n't think that will prove a major blow. "They all played somewhat of a role on our team," he said, "but they weren't the big-time players on our team." Key returns: Rachael Capra, Carolyn Allen, Kenzie Rowda, Gabby Perone. Key newcomers: Maddy Burich. "We haven't pulled up any freshman," said Bowman. "We'll see how the season goes first." Strengths: Experience. "Five of my spots are returning players," said Bowman. "I'm really solid." Weaknesses: "We've got to block better," said Bowman. Outlook: Bowman hopes to repeat last year's success and then some, and he thinks he has the tal- I really think getting to the Final Four is a legitimate goal. Anything but...would be a disappointment. Tim Bowman Seven Rivers volleyball coach said of his team. ent to do it with. "On paper, I really like our team," he said. Citrus Lady Hurricanes 2006 record: 7-12. Coach info: Alice Christian is in her third year on the Lady 'Canes coaching staff. She was an assis- tant coach for most of the 2005 season and last year was her first full season as head coach. Key losses: Rachel Fults and Jackie White were the only seniors the Lady 'Canes lost. Key returns: Courtney Spafford, Sarah Keller, Katie Young, Chelsea Atkinson, Brittany North, Caitlyn Reader, Jessie Keasling and Kelsey Keating all seniors. Key newcomers: Tamika Eatman, Jillian Messer, Devon Miller. Strengths: "All around we're pretty good," said Christian. "We have a pretty strong front line and good outside hitters ... Keating is a setter from last year, so she's a lit- tle experienced." Weaknesses: "Husting to get to the ball. They gotta move," said Christian. Outlook: 'They're looking pretty good at practice," said Christian. "My girls have an awesome atti- tude ... they all gel very nicely. We'll see what happens." Crystal River Lady Pirates 2006 record: 20-6. Coach info: Meryl Weber is in her second year as head coach. Key losses: Megan Hirsch, Brandy Worlton, Danielle Carver, Ashley Clark, Serena Jasper. Key returners: Cassidy Rash, Lauren DeCoste, Alexis Harrell. Key newcomers: Kaylah Hall, Becca Reynolds, Brittany Dehoff, Alyssa Daniel, Alyssa Ruane. Strengths: "They're all diverse," Weber said of her players. "We have a strong back row. The girls all have awesome personality." Weaknesses: Youth and inexpe- rience. Weber said last year's team had worked together for four straight years, and this year's team is still getting comfortable with each other. "It's just learning how to work together," she said, "getting the confidence that the other person is going to be there." Also, the Lady Pirates aren't quite as imposing as they used to be. "We lost two girls that are 6-3," Weber said. Outlook: '"We're going to take one game at a time," said Weber. "It's a regrowth year. We have skill, it's just getting it to click." Thursday's match against Lecanto has some significance as Hall is a former Lady Panther. Lecanto Lady Panthers Coach info: Freddie Bullock. 2006 record: 14-11. 1. .. ..'. .' .t ., ., 2' t "; 'H i t i j "I (r4f' N .* - ,'R a a- .a ..=== >, -w n0MMd~m s-~a -m . - as.II- "UH~ a- .9 .t .... a***> .**" .. -:: 9* mm Mab Smmnagem g am aI -mm amm m41b a qa m a. ms I -.a ok a == *= 9- =m 2B THURSDAY, AUGUST 30, 2007 Cmus CouNTY (FL) CHRoNicLE F] FOOTBALL . ... ...... i:. 'Jtb ... I .m. , = .. .=...===. I"- "** *::::-:xd88iMK::- ,:::. i i. IN. . .- o wl ":: .... >M=i..h .W' I t, f. "T"I"*. RTI US COUNTJY1 ( )L, HR E lLWYat-- -- -- - - Central Division Pct GB L10 .568 7-3 V .534 4% 4-6 .504 8% 5-5 .450 15% z-5-5 Y .432 18 3-7 Home 41-26 34-31 35-30 31-36 29-37 Away 34-31 37-31 32-36 28-36 28-38 Intr 9-9 Los Angeles 14-4 Seattle 11-7 Oakland 10-8 Texas 4-14 W L 79 54 73 58 66 69 59 72 West Division Pct GB L10 .594 z-7-3 .557 5 z-4-6 .489 14 z-5-5 .450 19 z-6-4 New York Philadelphia Atlanta Florida Washington S Wild Card Glance American League W L Pct GB Seattle 73 58 .557 - New York 74 59 .556 - Detroit 71 62 .534 3 G .National League W L Pct GB San Diego 72 59 .550 - Philadelphia 70 62 .530 2% Los Angeles 70 63 .526 3 AMERICAN LEAGUE C Wednesday's Games Oakland 5, Toronto 4, 11 innings L.A. Angels 8, Seattle 2 N.Y. Yankees 4, Boston 3 Cleveland 4, Minnesota 3 Kansas City 5, Detroit 0 STampa Bay 5, Baltimore 4,12 innings* ; Chicago White Sox at Texas, late Today's Games 31I Boston (Schilling 8-5) at N.Y. Yankees (Wang 15-6), 1:05 p.m. Detroit (Bonderman 10-7) at Kansas City (Nunez 2-1), 2:10 p.m. Seattle (Ramirez 8-4) at Cleveland (Laffey 2-1), 7:05 p.m. Tampa Bay (Kazmir 10-8) at Baltimore (Guthrie 7-4), 7:05 p.m. Chicago White Sox (Danks 6-12) at Texas (Millwood 8-11), 8:35 p.m. Friday's Games Kansas City at Minnesota, 2:10 p.m., 1st game Kansas City at Minnesota, 8:10 p.m., 2nd game Baltimore at Boston, 7:05 p.m. Tampa Bay at N.Y. Yankees, 7:05 p.m. Chicago White Sox at Cleveland, 7:05 p.m. Seattle at Toronto, 7:07 p.m. Detroit at Oakland, 10:05 p.m. Texas at L.A. Angels, 10:05 p.m. NATIONAL LEAGUE Wednesday's Games L.A. Dodgers 10, Washington 9,12 innings Colorado 8, San Francisco 0 Atlanta 7, Florida 4 Cincinnati 8, Pittsburgh 0 Philadelphia 3, N.Y. Mets 2 Milwaukee 6, Chicago Cubs 1 Houston 7, St. Louis 0 Arizona at San Diego, late Today's Games N.Y. Mets (O.Hernandez 9-4) at Philadelphia (Lohse 7-12), 1:05 p.m. St. Louis (Pineiro 4-2) at Houston (Albers 3-6), 2:05 p.m. Cincinnaip iBehlle i at P.niCuioh IMoms 8-81 7 05 pm MilwauKee IParra 0-1 1 Cnicag. Cur , SiLlhy 13-7) 805pm Anzona iDay's 11. III al San D'ego i youngg 9-41 10 05pm 1 Friday s Games Houison at Chcago Cuts 2 20 prT, Philadelphia at Floriaa 7 05 pm San Francisco at Wah.rngon 7 0~, p m N Y Mets 3 Atllanma. 7 35 p m P'ttsburgh at MIwaukee 8 05 p.m.` Cincinnati at S Lou- 8 10 p m. ,, Colrado al A zona. 41 p ni SL A Dooge~s al San Dego 10:05 p.m. MLB Leaders AMERICAN LEAGUE BATTING-MOiaorez Detroi. .356; ISuzuki Seattlae 50 Poianco Detroi. 3.11 F.gg.ns Los Angeles 335 P,,ada New Yonr 333. VGue,e're,, L.. Ange A32"/: -Loweir Boston: W2 I RUNS-ARodriguez New YorK, 121; Granderson, Detroit, 99; Sizemore, Cleveland, 99; MOrdonez, Detroit, 99; BAbreu, New York, 98; Sheffield, Detroit, 97; ISuzuki, Seattle, 95; DOrtiz, Boston, 95. RBI-ARodriguez, New York, 124; MOrdonez, Detroit, 116; VGuerrero, Los Angeles, 108; Momeau, Minnesota, 95; THunter, Minnesota, 94; VMartinez, Cleveland, 93; Lowell, Boston, 93.. SHITS-ISuzuki, Seattle, 192; MOrdonez, Detroit, 177; Jeter, New York, 169; SOCabrera, Los Angeles, 166; Rios, Toronto, 163; Polanco, Detroit, 161; VGuerrero, LosAhgeles; 161. *A DOUBLES-VGuerrero, Los Angeles,. 44; MOrdonez, Detroit, 43; DOrtiz, Boston, 40; THunter, Minnesota, 38; AHill, Toronto, 37; BRoberts, Baltimore, 37; Rios, Toronto, 36; VWells, Toronto, 36; Posada, New York, 36. TRIPLES-Granderson, Detroit, 21; Crawford, Tampa Bay, 9; Iwamura, Tampa Bay, 8; MeCabrera, New York, 8; CGuillen, Detroit, 8; Cano, New York, 7; Teahen, Kansas City, 7; Crisp, Boston, 7; MByrd, Texas, 7; ISuzuki, Seattle, 7. HOME RUNS-ARodriguez; New York, 44; CPena, Tampa Bay, 31; Morneau, Minnesota, 29; Konerko, Chicago, 27; THunter, Minnesota, 26; Dye, Chicago, 26; DOrtiz, Boston, 25; MOrdonez, Detroit, 25. STOLEN BASES-Crawford, Tampa Bay, 42; BRoberts, Baltimore, 39; ISuzuki, Seattle, 36; CPatterson, Baltimore, 36; Figgins, Los Angeles, 34; Sizemore, Cleveland, 29; JLugo, Boston, 28. PITCHING (13 Decisions)-Verlander, Detroit, 14-5, .737, 3.77; Haren, Oakland, 14-5, .737, 2.72; Beckett, Boston, 16-6, .727, 3.29; Bedard, Baltimore, 13-5, .722, 3.16; Byrd, Cleveland, 13-5, .722, 4.43; Wang, New York, 15-6, .714, 3.95; KEscobar, Los Angeles, 15-6, .714, 2.77. STRIKEOUTS-Bedard, Baltimore, 221; JoSantana, Minnesota, 200; Kazmir, Tampa Bay, 189; Sabathia, Cleveland, 176; Matsuzaka, Boston, 174; Shields, Tampa Bay, 162; Beckett, Boston, 158. SAVES-Borowski, Cleveland, 39; Putz, Seattle, 37; Jenks, Chicago, 36; FrRodriguez, Los Angeles, 33; TJones, Detroit, 33; Papelbon, Boston, 30; Nathan, Minnesota, 28. NATIONAL LEAGUE BATTING-Utley, Philadelphia, .337; DYoung, Washington, .337; Holliday, Colorado, .336; Renteria, Atlanta, .336; CJones, Atlanta, .332; HaRamirez, Florida, .331; Pujols, St. Louis, .321. RUNS-Rollins, Philadelphia, '114; HaRamirez, Florida, 102; JBReyes, New York, 99; Uggla, Florida, 91; Wright, New York, 90; BPhillips, Cincinnati, 90; Holliday, Colorado, 89. RBI-Howard, Philadelphia, 108; Holliday, S. Colorado, 105; CaLee, Houston, 103; Fielder, Milwaukee, 97; MiCabrera, Tm Florida, 92; Atkins, Colorado, 91; Dunn, Cincinnati, 91. HITS-Holliday, Colorado, 177; n, HaRamirez, Florida, 174; Rollins, Philadelphia, 167; JBReyes, New York, 1-'. 165; Francoeur, Atlanta, 159; Pierre, Los' - Angeles, 159; CaLee, Houston, 158. DOUBLES-Holliday, Colorado, 44; Uggla, Florida, 42; Utley, Philadelphia, 42; a HaRamirez, Florida, 38; Church, Washington, 37; AdGonzalez, San Diego, 37; CaLee; Houston, 37. TRIPLES-Rollins, Philadelphia, 15; JBReyes, New York, 11; Johnson, Atlanta, 10; Amezaga, Florida, 9; Harris, Atlanta, 8; S 6 are tied with 7. HOME RUNS-Fielder, Milwaukee, 39; Dunn, Cincinnati, 36; Howard, Philadelphia, 35; MiCabrera, Florida, 30; Pujols, St. Louis, 30; Griffey Jr., Cincinnati, 29; CBYoung, Arizona, 28. STOLEN BASES-JBReyes, New York, 71; ,; Pierre, Los Angeles, 52; HaRamirez, Florida, 42; Bymes, Arizona, 38;. Victorino, Philadelphia, 34; Wright, New York, 29; Taveras, Colorado, 29; KMatsul, Colorado, 29. PITCHING (13 Decisions)-Harang, S Cincinnati, 14-3, .824, 3.51; Penny, Los Angeles, 14-4, .778, 2.88; Peavy, San Diego, 15-5, .750, 2.18; Hamels, Philadelphia, 14-5, .737, 3.50; BSheets, Milwaukee, 11-4, .733, 3.30; THudson, Atlanta, 15-6, .714, 3.23; CVargas, Milwaukee, 10-4, .714, 5.13. STRIKEOUTS--Peavy, Sah Diego, 197; Harang, Cincinnati, 174; Webb, Arizona, 170; Hamels, Philadelphia, 156; Smoltz, Atlanta, 155; RHIII, Chicago, 154; Snell, Pittsburgh, 151. East Division GB L10 z-4-6 3 5-5 5 z-4-6 16 2-8 16 z-3-7 Home 35-30 38-29 34-31 28-40 31-34 Away 38-29 32-33 35-34 30-36 27-42 Chicago Milwaukee St. Louis Cincinnati Pittsburgh Houston Central Division Pct GB L10 Str .511 z-5-5 L-1 .500 1% z-4-6 W-1 .496 2 6-4 L-1 .459 7 7-3 W-1 .447 8% z-7-3 L-1 .444 9 3-7 W-1 Home 34-32 40-25 34-29 33-33 31-37 35-33 Away 33-32 26-41 30-36 28-39 28-36 24-41 Arizona San Diego Los Angeles Colorado San Francisco -'" 4 44 11me * -* - yrC e a-ra C t W 4IGD ga a404 0OA 00a m am 410NO V *lm0m C b Copyrighted Material0.= SndicatedContent--- v- -00 mw Available from Commer-cial News C -a -* 4b O9iftb 4D 4w ao 4baw so ,iimob 400 4v 4 0Ma STAMPA BAY BALTIMORE ab rhbi ab.rhbi pf ~npw 40. Ows 400in O - C Cow 0M m C in C4D wmw -4 40 40Mow Cif i40 qww -b GN Cb41w in C C Cdm4m b-4 41MMM1 4no mw - - CC C 4WD4wmv 4110 amqin 4Cftolw 4 UND -0oti4 q 4 A ob l ow ooe C 4 e domm qw 4w ,_m _w C0 C in i-n4b 4 41 min w- .0 i Al w ob4994w -4w ___ C*C i 400i CC qu nt uoC t *1s 0 i 4in=0n BOSTON JLugo ss Pedroia 2b DOrtiz dh Lowell 3b Yukilis lb JDrew rf Varitek c Crisp cf Hinske If ab rhbi NEW YORK 4 00 0 Damon If 3 00 0 Jeterss 4 11 1 BAbreu rf 4 110 ARod 3b 3 11 2 Matsui dh 3 01 0 Posada c 1 00 0-.Giambi lb 4 000 APhllps lb 3 000 Cano,2b MeCbr cf ab r h bi 50.12 402 0 4010 4 1 2 1 4020 3 1 2 0 301 0 1 000 3 1 00 4 1 3 1 Totals 293 4 3 Totals 35 414 4. Boston 000 001 020- 3 New York 030 000 10x- 4 E -E-Beckett (1). DP-Boston 1. LOB- Boston 8, New York 9. 2B-Jeter (31). 3B- Matsui (2). HR-DOrtiz (25), Youkilis (14), ARodriguez (44). CS-Pedroia (1), MeCabrera (5). S-Pedroia.. IP H RERBBSO Boston Beckett L,16-6 62-3 13 4 4 1 6 Lopez 0 1. 00 1 0 Timlin 11-3 0 0.0 0 0 New York ClemensW, -5 6, 2 1 15 2 LVizcaino I, '1 0'.0 0 1 1 Farnsworth 2-3 2 2 2 1 1 .-_PeraS 1.. s3 0 0 0 0. 0 ' Lopez pitched oe 2 baters in the th HBP-by Clemens (Pedroia) WP- Beckett. Umpires-Home, Mark Carjson; First, Angel Hernandez; Second, Ted Barrett; Third, Derryl Cousins. T-3:26. A-54,986 (56,937). lwmra3b 601 0 BRbrts2b 5 1 1 1 Crwfrd If 7 120 CPttson cf 6 0 1 1 CPenalb 501 1 Mrkkisrf 5 0 1 0 Uptoncf 621 0 Tejada ss 4 020 DYong rf 5 12 0 Millar lb 5 1 20 BHarrs 2b 6 022 Huff dh 4 1 22 Gomesdh 4000 Bynum dh 0 000 JoWlsn ss 1 000 Mora 3b 4 0 0 0 Norton ph 0 00 0 RaHrdzc 5 0 1 0 JGzmn ss 2 11 0 Redmn p 0 0 0 0 Nvarro c 5 02 2 Payton If 4 1 1 0 Totals 47512 5 Totals 42 411 4 Tampa Bay 100. 000 021 001- 5 Baltimore 002 002 000 000- 4 E-Tejada (12), Mora. (9). DP-Tampa Bay 1. LOB-Tampa Bay 16, Baltimore 8. 2B-Crawford (31), BHarris (31). 3B- BRoberts (5). HR-Huff (14). SB-Crawford (43), Gomes (8), JoWilson (6). S-Iwamura, Paytdn. SF-Navarro. IP H RERBBSO Tampa Bay Shields 8 10 4 4 2 6 Wheeler 1 0 0 0 0 1 BalfourW,1-0 2 0 0 0 2 4 ReyesS,21 1 1 0 0 1 0 Baltimore Trachsel 6 5 1 1 4 3 JWalker 1 0 0 0 0 1 Bradford 1-3 2 2 0 1 0 DBaez 12-3 2 1 1 2 1 RBellL,3-3 2 3 1 0 1 2 Birkins 1 0 0 0 0 '2 RBell pitched to 2 batters in the 12th. WP-Trachsel. Umpires-Home, Tim McClelland; First, Paul Schrieber; Second, Fieldin Culbreth; Third, Marty Foster. T-4:09. A-16,944 (48,290). Pro0 MINNESOTA CLEVELAND ab rhbi ab r hbi Casilla2b 4 03 0 Szmorecf 3 1 1 0 Bscherph 1 00 0 ACberass 4 1 22 Bartlettss 2 00 0 Hafnerdh 4 0 0 0 THntercf 4 00 1 VMrtnzc 4 1 1 1 Mrneaulb 3 00 0Garkob 4 0 1 0 Cddyer rf 4 11 0 Gutirrz rf 4 1 20 RoWhtedh 311 1 Lofton If 3 01 1 Rdmndc 4 021 Gomez2b 3.02 0 Tyner If 4 120 Blake 3b 3 0 0 0 Punto 3b 4 00 0 Totals 333 9 3 Totals 32 410 4 Minnesota 000 011 010- 3 Cleveland 400 000 00x- 4 DP-Minnesota 1, Cleveland 3. LOB- Minnesota 7, Cleveland 5. 2B-Casilla (4), RoWhite (3), Gutierrez 2 (9). 3B-Cuddyer (5). HR-ACabrera (2), VMartinez (21). SB-Casilla (9). CS-Sizemore (9). IP H RERBBSO Minnesota JoSantana L,14-106 10 4 4 1 2 JRincon 2 0 0 0 0 1 Cleveland Sabathia W,15-7 6 7 2 2 2 2 Lewis 1 0 0 0 0 0 RBetancourt 1 1 1 1 0 2 -Borowski S,39 1 1 -0 0 0 -0 HBP-by Sabathia (RoWhite), by Sabathia (Bartlett). Umpires-Home, Hunter Wendelstedt; First, Sam Holbrook; Second, Randy Marsh; Third, Bob Davidson. T-2:54. A-27,303 (43,415). -- -- -Nyi ed aermi P -0dn 0 11- coma" -.-, N .g C0M 4 104 4D 4 b - i -- Avalabefft-naSyndcated"Contentws " 1OM 40 40 4ft 9M 40 O ft -"Available from Commercial News Prrv - __ en&C4 in '"dm -wo 4w4oo &*aC 40 mm m b ai ab 4D C 0 4 m@4Cob0Cm 41 C ATLANTA FLORIDA ab rhbi ab r hbi YEscbrss 3 32 1 HaRmz ss 5 1 1 0 Diazlf 5 23 3 Uggla 2b 3 1 1 1 Mahay p 0 000 MiCbr 3b 2 0 0 1 RSrano p 0000 Jacobs 1 b 3 0 1 0 CJones 3b 4100 Wood 1b 1 0 0 0 Txeira Ib 402 1 WInhm If 2 0 0 0 Frncurrf 5 02 1 Hrmidp rf 4 1 2 0 AJones cf 4020 Tranor c 4 0 0 1 Wdwrd 2b 2 100 De aza cf 4 0 0 0 CMIIr c 5 01 1 Willis p 2 1 '1 1 Carlyle p 3 00 0 Grdner p 0 0 0 0 Moylanp 0 00 0 Linden ph 1 0 0 0 Thrmn ph 1 01 0 Barone p 0 0 0 0' Acosta p 0 000 Amzga ph 1 0 00 Harris If 1 00 0 Totals 37713 7 Totals 32 4 6 4 Atlanta 112 102 000- 7 Florida 111 001 000- 4 LOB-Atlanta 11, Florida 6. 2B-Diaz (19), AJones 2 (25), Jacobs (18), Hermida (23). 3B-HaRamirez (6). HR-YEscobar (3), Diaz 2 (12), Uggla (27), Willis (2). SF- MiCabrera. IP H RERBBSO Atlanta Carlyle W,8-5 5 4 3 3 3 6 Moylan 1 1 1 0 0 0 Acosta 1 0 0 0 1 2 Mahay 2-3 1 0 0 0 1 RSorianoS,6 11-3 0 0 0 0 2 Florida Willis L,8-14 51-3 8 6 6 4 4 Gardner 12-3 4 1 1 1 1 Barone 2 1 0 0 1 0 HBP-by Barone (AJones), by Willis (YEscobar). WP-Willis, Barone. PB- CMiller. Umpires-Home, Mike Everitt; First, Dana DeMuth; Second, Kerwin Danley; Third, Doug Eddings. T-2:52. A-12,633 (36,331). dme" 11C 1 0 MILWAUKEE CHICAGO ab rhbi ab r hbi Weeks2b 2210 ASrano if 5 01 0 Gross rf 511 1 Theriotss 4 01 0 Turnbwp 0000 DeLee lb 4 0 1 0 FCderop 0000 ARmrz3b 2 00 1 Fildr lb 4 22 0 CFoyd rf 4 01 0 Braun 3b 4 112 DeRosa2b 4 0 1 0 BShse p 0000 JJones cf 3 0 2 0 McCIng p 0000 Kendall c 4 01 0 BHallcf 1 00 0 CZmrop 2 1 1 0 Jenkins If 5 01 2 Eyre p 0 0 0 0 CHartcf 403 1 Murtonph 1 00 0 JEstdac 4010 Woodp 0 0 0 0 Cunsellss 401 0 Wuertzp 0 0 0 0 BShets p 200 0 Ward ph 1 0 0 0 Dillon ph 1 00 0 Hardy ss 1 00 0 Totals 37611 6 Totals 34 1 9 1 Milwaukee 000 110 400-- 6 Chicago 001 000 000- 1 E-Theriot (10), Kendall (3). DP- Milwaukee 1, Chicago 1. LOB-Milwaukee 8, Chicago 9. 2B-Gross (6), Fielder (32), Braun (20), DeRosa (24). 3B-CHart (7). SB-CHart (20), Theriot (23), DeLee (6),. JJones (6). SF-ARamirez. IP H RERBBSO Milwaukee BSheetsW,11-4 6 BShouse McClung Turnbow 1 FCordero 1 Chicago CZmro L,14-11 61 Eyre 2 Wood 1 Wuertz 1 6 1 1 2-3 2 0 0 1-3 0 0 0 0 0 0 1 0 0 1-3 9 6 5 1 6 2-3 20 0 0 0 0 0 0 1 2 0 0 0 0 0 HBP-by CZambrano (Weeks 2). WP- Turnbow. Umpires-Home, Gerry Davis; First, Brian Gorman; Second, Paul Nauert; Third, Rob Drake. T-2:47. A-40,512 (41,160). C 4 4=041 -aw44 4 o mm N-0 C p- o NEW YORK PHILA ab rhbi ab r hbi JBRyes ss 3 01 0 Rollins ss 4 1 2 1 LCstillo 2b 4 00 0 Iguchi 2b 3 0 1 0 Wright 3b 3 12 1 Burrell If 3 1 1 2 Beltran cf 4 120 Gordon p 0 00 0 Aloulf 4 01 0 BMyersp 0 0 0 0 CDIgdo lb 4 02 1 Howard lb 4 0 1 0 LDucac 3 01 0 Rwandcf 4 00 0 Chavez pr 0 000 Werth rf 3 0 1 0 MIldge rf 2 00 0 Ruiz c 2 0 0 0 MrAnd ph 1 01 0 Nunez 3b 2 0 0 0 OIPrez p 2 00 0 Moyerp 1 1 0 0 Conine ph 1 00 0 Helms ph. 1,0 0 00 JSosa p 0 00 0 Rmero p 0 0 00 ShGrenph 1 00 0Vctmorf 0 0 00 Totals 32210 2 Totals 27 3 6 3 New York 100 100 000- 2 Philadelphia 200 010 00x- 3 DP-Philadelphia 3. LOB-New York 7, Philadelphia 7. 2B-Beltran (29), Howard (22). HR-Wright (24), Rollins (24), Burrell (22). CS-JBReyes 2 (17), Iguchi (1). S- Ruiz. SF-Burrell. IP H RERBBSO New York OIPerez L,12-9 6 5 3 3 5 10 JSosa 2 1 0 0 0 1 Philadelphia Moyer W,12-10 6 8 2 2 2 4 Romero 1 0 0 0 1 0 Gordon 1 0 0 0 1 0 BMyersS,13 1 2 0 0 0 1 Umpires-Home, Ed Rapuano; First, Ed Hickox; Second, C.B. Bucknor; Third, Joe West. T-2:50. A-43,150 (43,647). as in 0 4.4 4 -4 vu qC 4mOWN- a - C0 f 40 b C 4m 0 4 -p 0 ST. LOUIS Eckstin ss Ankiel rf Pujols lb Edmnd cf Flors p Tguchi ph Duncan If YMolna c GBnntt c Ryan 3b' KWells p TJhnsn p Ludwck rf Miles 2b HOUSTON ab rh.bi 4 00 0 Pence cf 4 02 0 Biggio2b 4 01 0 Qualls p 3 00 0 Brntltt ph 0 00 0 TreMIIr p 1 00 0 Brkmn lb 4 00 0 CaLee If 3 00 0 Loretta ss 0 00 0 Scott rf 3 00 0 Wggntn 3b 2 01 0Asmus c 0 00 0 Oswalt p 1 00 0 Burke 2b 3 02 0 ab r h bi 4 021 4 210 0000 1 00 1 0000 5 1 32 4 021 4 010 3 1 1 1 4 1 1 0 3 21 0 3 0 1 1 0000 Totals 320 6 0 Totals 35 713 7 St. Louis 000 000 000- 0 Houston 121 000 12x- 7 E-Ryan (6). DP-St. Louis 3, Houston 1. LOB-St. Louis 5, Houston 8. 2B-Miles (14), Biggio (28), Berkman (17), Loretta (21). 3B-Ausmus (2). HR-Berkman (25), Scott (15). SB-Berkman (6). IP H RERBBSO St. Louis KWells L,6-15 TJohnson Flores 1u...f__ 9 5 5 2 3 2 0 0 0 0 2 2 2 2 0 22220 Houstuonl OswaltW,14-6 7 4 0 0 0 9 Quails 1 1 0 0 0 1 TreMiller 1 1 0 0 .0 1 KWells pitched to 1 batter in the 7th. WP-KWells, TJohnson, Flores. Umpires-Home, Tim Tschida; First, Jim Joyce; Second, Jim Wolf; Third, James Hoye. T-2:43. A-33,422 (40,976). West Division L Pct GB L10 59 .556 z-4-6 59 .550 1 7-3 63 .526 4 z-7-3 65 .511 6 5-5 73 .455 13% z-7-3 Home 40-26 37-29 37-32 39-26 33-35 Away 34-33 35-30 33-31 29-39 28-38 400 m- ro Csm -4w~tp4 w *1so4s~ mm 4b- 4-M - w* ___ 4D -oft .qwm vid rs". 4w - LOS ANGELES SEATTLE S ab rhbi ab r bi -o am eoC40 41D 4 ab rhb abrhb Mathws cf OCbera ss VGrero rf GAndsn If Izturis 3b Modes dh Ktchm lb Kndrck 2b Mathis c 5 11 0 ISuzuki cf 5 22 0 Vidro dh 5 22 1 JGillen rf 5 14 1 IbanezlIf 5 11 1 Beltre 3b 5 03 1 Brssrd lb 4 00 2 Jhjima c 4 02 1 JoLpez 2b 5 12 1 YBtcrt ss 4000 4010 4 100 4010 4 0 1 0 3 01 1 3 01 0 3010 3010 3 0 1 0 Totals 43817 8 Totals 31 2 7 2 Los Angeles 200 110 022- 8 Seattle 010 100 000- 2 E-Mathis (3). LOB-Los Angeles 10, Seattle 3. 2B-GAnderson (26), Morales (7). HR-VGuerrero (22), Mathis (2). SB- Beltre (13). SF-Beltre. IP H RERBBSO Los Angeles JdWeaverW,10-68 7 2 1 0 5 Bootcheck 1 0 0 0 0 2 Seattle FHmdzL,10-7 '7 13 6 6 0 3 Sherrill 0 0 0 0 0 0 RiWhite 12-3 4 2 2 0 2 Roland-Smith 1-3 0 0 0 2 0 " FHernahdez pitched to 3 batters in the 8th, Sherrill pitched to 1 batter in the 8th. WP-FHemandez 2. Umpires-Home, Bruce Dreckman; First, Jerry Meals; Second, Gary Darling; Third, Larry Poncino. T-2:31. A---46,047 (47,447). b4D-4 iaw:"r 40 ftCONO IIIIIIIN a 0 QIn* *. Ila eeC11iii **40NOag ma 4 . in 11111M 4 - iders' = WASHINGTON LOS ANGELES Logan cf FLopez ss Zmrmn 3b Keams rf Church If Jimnz 2b Fick lb Rivera p Flores c Hill p Ayala p Colome p Rauch p DYong ph Schrdr p Batista ph CCrdro p Schndr lb ab rhbi 5 02 3 Furcal ss 6210 -Pierre cf 5 01 1 Kemp rf 5 21 0 JKent2b 5 14 1 LGnzlz If 6 02 1 Seanezp 6 22 2 Beimel p 0 00 0 RMrtnz ph 5 23 1 Brxtn p 2 00 0 Saito p 0 00 0 Sabnz ph 0 00 0 Prctr p 0 00 0 Stults ph 1 00 0 Martin c 0 00 0 Loney lb 1 00 0 Hlnbm 3b 0 00 0 Penny p 0 00 0 MaSwy ph Hndrck p Ethier If Totals 47916 9 Totals 47101410 Washington 041 012 100 000- 9 Los Angeles 020 105 100 001- 10 Two outs when winning run scored. E-FLopez (16). DP-Los Angeles 3. LOB-Washington 7, Los Angeles 8. 2B- Church (37), Flores (6), JKent 2 (33), Martin (29), Loney (11). HR-Fick (1), Kemp (9), Martin (17), Hillenbrand (1). SB-FLopez (22). CS-Logan (4), Martin (7). S-Hill, RMartinez. SF-Hillenbrand. IP H RERBBSO Washington Hill 51-3 7 7 6 1 4 Ayala 2-3 42 2 0 1 Colome 2-3 0 0 0 0 1 Rauch 1-3 0 0 0 0 0 Schroder 2 0 0 0 1 2 CCordero 2 1 0 0 1 0 Rivera L,4-5 2-3 2 1 1 1 1 Los Angeles Penny 5 8 6 6 2 1 Hendrickson 1 3 2 2 0 1 Seanez 1-3 0 1 1 0 0 Beimel 2-3 2 0 0 0 0 Broxton 1 1 0 0 0 1 Saito 1 1 0 0 0 2 Proctor W,3-0 3 1 0 0 1 0 HBP-by Seanez (Keams). Umpires-Home, Dale Scott; First, Ron Kulpa; Second, Paul Emmel; Third, Dan lassogna. T-4:05. A-41,913 (56,000). Boston New York Toronto Baltimore Tampa Bay East Division GB L10 6-4 6 z-5-5 13 4-6 21 1-9 27 6-4 Home 40-23 43-24 39-27 30-36 31-38 Away 40-30 31-35 28-39 28-37 22-42 Intr 12-6 10-8 10-8 6-12 7-11 Cleveland Detroit Minnesota Kansas City Chicago Home Away 44-20 35-34 41-27 32-31 34-34 32-35 35-31 24-41 THURSDAY, AUGUST 30, 2007 3B NIIA'F4:3R ILF-A-C-UE HASEBALIL Cr.Q nirf FtL, CrH)/nN/IT al.) I I r 4B THURSDAY. AUGUST 30. 2007 SPORTS CITRUS COUNTY (FL) CHRONICLE On the AIRWAVES TODAY'S SPORTS SENIOR BASEBALL 2 p.m. (ESPN2) Senior League Final Teams TBA. (Taped) MAJOR LEAGUE BASEBALL 7 p.m. (FSNFL) Tampa Bay Devil Rays at Baltimore Orioles. 8 p.m. (WGN) Milwaukee Brewers at Chicago Cubs. WOMEN BASKETBALL 10 p.m. (ESPN2) WNBA Western Conference Final Game 1 - Phoenix Mercury at San Antonio Silver Stars. INTERNATIONAL BASKETBALL 10 p.m. (FSNFL) FIBAAmericas Championship Brazil vs. Uruguay. (Same-day Tape) 12 a.m. (ESPN2) FIBAAmericas Championship -Argentina vs. United States. BOXING 9 p.m. (VERSUS) Efren Hinojosa vs. Miguel Angel Huerta. For the vacant NABF lightweight title. COLLEGE FOOTBALL 7 p.m. (ESPN2) Tulsa at Louisiana-Monroe. 8 p.m. (ESPN) LSU at Mississippi State. NFL 8 p.m. (8 NBC) (9, 20 ABC) Preseason: Houston Texans at Tampa Bay Buccaneers. GOLF 10 a.m. (GOLF) European PGA: Johnnie Walker Championship at Gleneagles First Round. 1 p.m. (GOLF) LPGA: State Farm Classic First Round. TENNIS 11 a.m. (USA) U.S. Open Second Round. 7 p.m. (USA) U.S. Open Second Round. 2 a.m. (USA) U.S. Open -Match of the Day (Taped). TRACK AND FIELD 7 p.m. (VERSUS) IAAF World Championships (Taped). p Prep CALENDAR TODAY'S PREP SPORTS BOYS GOLF 3:30 p.m. Citrus at Oak Hall 4 p.m. Crystal River at Seven Rivers GIRLS GOLF 3:30 p.m. Lecanto at South Sumter 3:30 p.m. Hernando at Citrus 3:30 p.m. Central at Crystal River SWIMMING 4:30 p.m. Crystal River at Pasco VOLLEYBALL 6 p.m. Seven Rivers at Meadowbrook Academy 7 p.m. North Marion at Citrus 7 p.m. Dunnellon at Crystal River 7 p.m. Lecanto at South. Sumter - O- a -OW- "~_Copyright( Syndicate( SAvailable from Comme G"f- low l-t =g- -40. MINOM- U 'M b 0 ap- m -M *-lap4- 0 ftw QUM~- M0 6* *maa 6 OGE- -41 *ag 4 -w MMabwf I 40 **a ob 1- -w -Q ted Material ed Content P i " ercial News Providers" BASEBALL Wednesday's MLB Boxes Royals 5, Tigers 0 DETROIT KANSAS CITY ab rhbi ab r hbi Grndsn cf 3000 DJesus cf 2 1 00 Raburn cf 0 000 EGrmn 3b 4 1 1 1 Planco 2b 4 020 Gload ib 0 00 0 Thmes If 4 01 0 Grdzln 2b 4 1 3 1 MOrdzdh 4 00 0 Butler dh 3 1 0 0 CGillen ss 4 00 0 Brown rf 4 1 1 0 IRdrgz c 4000 Gordon lb 4 02 1 Caseyl 1b 4020 TPenass 4 012 TPerez rf 3 02 0 Gthrght If 3 0 0 0 Inge 3b 3 00 0 LaRue c 1 0 0 0 Totals 330 7 0 Totals 29 5 8 5 Detroit 000 000 000- 0 Kansas City 500 000 00x- 5 DP-Detroit 2, Kansas City 1. LOB- Detroit 9, Kansas City 5. 2B-TPerez 2 (3), Grudzielanek (28), Gordon (29). 3B- EGerman (6). IP H RERBBSO Detroit Miller L,5-5 2-3 5 5 5 2 1 Miner 4 2 0 0 1 2 Byrdak 11-3 0 0 0 0 1 Rodney 1 0 0 0 0 1 Seay 1 1 0 0 0 1 Kansas City Greinke 4 5 0 0 0 5 BraunW,2-0 22-3 2 0 0 1 3 Gobble 0 0 0 0 1 0 RiskeS,4 21-3 0 0 0 1 1 Gobble pitched to 1 batter in the 7th. HBP-by Miller (Butler), by Miller (DeJesus). PB-IRodriguez. Balk- Greinke. Umpires-Home, Eric Cooper; First, Andy Fletcher; Second, Mike Reilly; Third, Jeff Kellogg. T-2:56. A-11,628 (40,785). Athletics 5, Blue Jays 4, 11 innings TORONTO OAKLAND ab rhbi .VWellsc of 400 0 Jhnson If 6 00 0 Rios rf 4 12 1 Thmasdh 4 01 0 Glaus 3b 3 00 0 AHill 2b 5 11 1 Ovrbay lb 5 11 1 Zaun c 3 01 0 Thgpen c 0 00 0 JMcDId ss 3 0.0 0 Stairs ph 1 11 1 Olmedoss 1 00 0 Ellis 2b Swisher rf Cust If ShStwrt If Piazza dh DJnson lb Scutaro ss Hnnhn 3b Bowen c DVnon cf ab r h bi 5 01 0 4 1 00 4 1 1 0 1 000 5 1 2 1 4 100 5 1 3 11 4 01 1 2 01 2 3 000 Totals 394 7 4 Totals 37 5 9 5 Toronto 000 110 002 00- 4 Oakland 202 000 000 01- 5 Two outs when winning run scored. DP-Toronto 3, Oakland 1. LOB- Toronto 10, Oakland 6. 2B-Scutaro 2 (11). HR-Rios (21), AHill (14), Overbay (9), Stairs (17). SB-Rios (13). IP H RERBBSO Toronto Halladay 9 7 4 4 6 4 FrasorL,1-4 ,.12-3 1 1 1 0 3 Downs 0 1 0 0 0 0 Oakland DiNardo 5 4 2 2 4 2 Casilla 2 0 0 0 1 0 Embree 1 0 0 0 0 1 Street 1 2 2 2 0 2 RLugoW,5-0 2 1 0 0 3 0 Downs pitched to 1 batter in the 11th. Umpires-Home, Marvin Hudson; First, Ed Montague; Second, Jerry Layne; Third, Bill Miller. T-3:14. A-16,015 (34,077). Reds 8, Pirates 0 CINCINNATI PITTSBURGH ab rhbi ab r hbi Hmlton cf 321 1 McLth cf 3 000 AIGnzlz ss 4132 JBtsta 3b 4 0 0 0 Grf Jr. rf 4 11 3 FSnchz2b 2 0 0 0 BPhllps 2b 5 12 1 Castillo 2b 1 0 0 0 Dunn If 4 11 0 LaRche lb 3 0 0 0 Ellison If 1 00 0 Snchezp 0 0 0 0 JaVltin c Httberg lb EEcrcn 3b Harang p 5 13 1 Nady rf 5 12 0 Bay If 5 02 0 Palino c 3 00 0 Izturis ss 3000 3 000 2 000 Yuman p 0 0 0 0 Phelps lb 1 0 0 0 Snell p 1 0 0 0 Kata ss 2 01 0 Totals 39815 8 Totals 28 0 2 0 Cincinnati 300 022 100- 8 Pittsburgh 000 000 000- 0 E-JBautista (14). DP-Cincinnati 1, Pittsburgh 1. LOB-Cincinnati 9, Pittsburgh 2. 28-JaValentin (16), EEncarnacion (18), Bay (23). HR-Griffey Jr. (29), BPhillips (26). SB-McLouth (14). CS-BPhillips (8). SF-Hamilton, AIGonzalez. IP H RERBBSO Cincinnati Harang W,14-3 9 2 0 0 1 8 Pittsburgh Snell L,8-11 51-3 10 7 7 2 4 Youman 12-3 4 1 1 0 0 Sanchez 2 1 0 0 0 2 HBP-by Youman (Harang). Umpires-Home, Chris Guccione; First, John Hirschbeck; Second, Laz Diaz; Third, Mike DiMuro. T-2:28. A-14;191 (38,496). Rockies 8, Giants 0 COLORADO SAN FRAN KMtsui 21 Tlowzki s Hlliday If Helton lb Atkins 3b Spbrgh cf Hawpe rf Innetta c Francis p Totals Colorado San Fran ab rhbi ab r hbi b 414 0 RDavis cf 4 0 20 s 3 100 Ortmrlb 4 0 1 0 3 11 2 Winn rf 4 01 0 4 11 0 Bonds If 2 0 0 0 5224 Frndsn ss 2 0 0 0 S 4 00 0 Drham2b 3 01 0 5 11 1 Auriliass 3 00 0 4 12 1 Feliz 3b 3 0 0-0 5 02 0 Rdrgezc 3 0 1 0 Lowry p 1 0 0 0 Misch p 0 000 Vizquel ph 1 0 0 0 Atchsn p 0 000 Walkerp 0 000 BMolna ph 1 0 0 0 Tschnr p 0 0 0 0 37813 8 Totals 31 0 6 0 023 200 100- 8 Icisco 000 000 000- 0 DP-Colorado 2, .San Francisco 2. LOB-Colorado 10, San Francisco 5. 2B- KMatsui 2 (19). HR-Atkins 2 (20), Hawpe (25), lannetta (3). SB-KMatsui (29), Tulowitzki (7), Durham (8). S-Tulowitzki. IP H RERBBSO Colorado Francis W, 14-6 San Francisco Lowry L,14-8 Misch Atchison Walker Taschner 6 0 0 1 3 Lowry pitched to 2 batters in the 4th. Umpires-Home, Tony Randazzo; First, Charlie Reliford; Second, Greg Gibson; Third, Larry Vanover. T-2:33. A-38,397 (41,777). SHARE YOUR THOUGHTS Follow the instructions on today's Opinion page to send a letter to the edi- tor. Letters must be no longer than 350 words. and writers will be limit- ed to three letters per month. WV S"Copyrighted Material - Syndicated Content . Available from Commercial News Providers" - 0 - S - q 0 - - q a -0 - * -- - * n a. a - U 40 - low 0 ~ - -- -0- 4 * Friends of Chassahowitzka o National Wildlife Refuge Complex n Maonotee Mosters~ o ~Qlf Tournanien Qs Tq/o11u 124 &SUPPOrbL w)I/an,&ai" "fL~i //" pe [ Thur e S S0,207 SFour Person Teams SScramle Formati *Net Divisions GREENSOUTH SUMMER Equipment... Inc. TCTORSUMMER Equipment, Inc. TRACTOR SALE! The end of summer savings are hot. Choose from HUNDREDS of tractors in stock. $8,999*1 2305 Tractor 24HP 4WD Automatic transmission $9, 495- a 790 2WD Tractor 27 gross HP 3-cylinder diesel engine 24 PTO HP Optional 4WD model shown Jr $12,999 5103 Tractor Limited quantities - available 45-50HP Optional 4WD OPTIONAL lull OPEN UNTIL 4PM ON SATURDAY! OCALA, FL 2157 NE JACKSONVILLE ROAD ...(352) 351-2383 GAINESVILLE, FL 9120 NW 13TH STREET. .... (352)367-2532 CHIEFLAND, FL 107 SOUTHWEST 4TH AVENUE (352) 493-4121 - HASTINGS, FL 100 SOUTH DANCY STREET. ................(904) 692-1538 STORE HOURS ORANGE PARK, FL 611 BLANDING BLVD. .. (904)272-2272 M-F 7 IJoa-56opm TALLAHASSEE, FL 2890 INDUSTRIAL PLAZA DRIVE ...... (850) 877-5522 sat 73o0am- 40pm THOMASVILLE, GA 12793 US HWY 19 S .... .... (2291226-4881 s.umCsed CAIRO, GA 2025 US HWY 84 EAST ... ...... (229) 377-3383 geensouthc 721336 GREENSOUTH Equipment, Inc. JOHN D--tn Nothing Runs Like A Deere- 'Offer ends 9/15i/07. Prices and model availability may vary by dealer. Some restrictions apply; other special rates and terms may be available, so see your dealer for details and other financing options. Available at participating dealers. "Offer ends 9/1507?, to approved credit on John Deere Credit Installment Plan. Up to 10% down payment may be required. Only on new 5003 and 5005 Series Tractors in Dealer Inventory. Model 5103s with serial numbers loss than 013651, Model 5203s with serial numbers less than 005564. Model 5303's with serial numbers less than 007753, Model 5403's with serial numbers less than 000735, 5005 Series (all serial numborsi, excluding 5603 Models. John Deere's green and yellow color scheme, the leaping deer symbol, and JOHN DEERE are trademarks of Deere & Company. Not responsible for typographical or artwork errors. John GSE3xl0030CCC Deere dealerreservesthe righttoacorrecterrors atpointofsale,. ,A IEqlOparun der it - - - a- IL& at the Plantation Inn & Golf Resort Crystal River, Florida / . For more information P iTAT NN" call, 563-2480 %Tekts-,ew 9:00 a.m. Shotgun Start Entry Fee: $50 per player Includes: Golf, Cart, Prizes, and Lunch! Entry Deadine: 9/13/07. b ITW Teltheatre 352-237-4144 SW 60th Avenue, across from the Airport Admission $1 11 AM daily except Tuesday o 5B THURSDAY AUGUST 30, 2007 CITRUS COUNTY CHRONICLE Mars won't affect redfish staging I want to dispel an urban myth, and also bring you up to date on some snook information, but I first want to ask your indulgence while I do a lit- tle second-hand bragging. One of our grandsons received a letter last week from the Boy Scouts of America head- quarters, informing him he has met all the requirements and is now an Eagle Scout We are all, as I'm sure those of you with experience with scouting will understand, quite proud of him. He was raised in the outdoors, of course, as were his father and his aunts, and I have a short anecdote that illustrates how this can pay off. He'll be attending Palm Beach Atlantic University on a baseball scholarship, and because of that had to report a week earlier than other freshmen, so our son took him over last week. As soon as Billy had taken care of all the registration requirements and met R.G. S with the coaches, he and TIG our son went on a little scouting trip for places LIN he could fish without a boat They did find a nice seawall close to the school (which is on the Intracoastal Waterway), and fished a while, catching and releasing a few crevalle jacks. I suspect not too many evenings will pass before Billy's on that seawall, looking for snook in the shadows. I don't know how many college freshmen make finding places to fish such an early priority, but it sure is a relief to know that's what's on his mind, and I'm certain our son and daughter-in-law share that feeling. Raising kids to fish and hunt does pay off. OK, on to the urban myth. As you know if you read this column regular- ly, the red drum have started to school, staging for the offshore I I Honeymoon Express to do a little spawning. This staging starts around the full moon in August (which was, two days ago), peaks during the September moon and runs as late as November some years. The myth has to do with the planet Mars, alleging various things, depending on the ver- sion, such as Mars will be closer to Earth than ever before, it will appear as bright as a full moon and will affect the tides. No. All this was supposed to happen Aug. 27, and it did four years ago. On Aug. 27, 2003, Mars entered into what is. known as a "perihelic opposition," coming to within 35 million miles of Earth. No big deal, hap- pens every 15 to 17 years. In any event, the moon, which does affect tides (causes them, in fact), is a quarter of a million miles chmidt away. There's no way Mars .HT at 35 million miles would have any effect on tides. ES Oh, and you might as well prepare yourself for another round of scare e-mails, because Mars will get close to Earth again in December of this year, but "close," this time, will be 55 million miles. "Bottom line," in the vernacular? No, it won't affect redfish staging. Speaking of which, they're certain-' ly doing just that right now. Large schools of large fish, fattening up for their offshore adventure in romance. In fact, the biggest prob- lem anglers targeting reds are hav- ing right now is getting fish small enough to fit in the slot. . In last week's redfish tournament out of Twin Rivers Marina, contest- ants reported catching as many as 40 to 50 reds to find two fish to enter, and first and second place were separated l3 GMSHMInUmIF-...i' it.T ronlel Captain Bear Smith, left, and Dr. Sam Williams took first place in the recent Twin Rivers Marina tournament. by a mere .05 pounds. While it doesn't reach the propor- tions of a myth, a commonly-held belief is that snook aren't found north of Tampa Bay. Of course, those of us who live in Citrus County know better. Snook, while hardly abun- dant, are regularly taken in this area as far north as Yankeetown. So, in case you do hook one, here are the latest rules for common snook (the only one in these parts). The season reopens Sept. 1, just two days off, with a new one-fish bag limit and a new slot of 28 to 33 inches in the Gulf (32 on the Atlantic side). Remember, too, that measuring snook has also changed, and it's now the total length, not the fork length. In addition, the season no longer runs for half of December, closing December 1 here, and reopening on March 1. (December 15 to February 1 on the east coast.) New rules also allow anglers to have more than one cast net aboard while fishing for' snook. The extra snook stamp (two: bucks) is still required if you want to keep a snook, in addition to a saltwa-, ter license. Tight Lines to you. R.G. Schmidt, Chronicle outdoors columnist, can be reached at Schmidt@isgroup.net Double catches at Twin Rivers Marina Tournament RG SCHMIDT/For the Chronicle Captain George Pulham, left, and partner Jason Pawelczyk with two redfish just 0.05 pounds lighter than the winners at the Twin Rivers Marina Tournament. Pulham and Pawelczyk's haul was'good enough for second place. Note to fishermen * The Chronicle encourages fishing clubs to send in their tournament results for publication in the Outdoors section. Information should be lim- ited to first-, second- and third-place finishers, as well as the angler who catches the largest tish in the tournament. For more information, contact the sports department at 563-3261 or sports@chronicleonline.com I. To submit sports notes to the Chronicle sports department, e-mail them to sports@chronicleon- line.com or call 563-3261 for more information. Chassahowitzka Crystal River High/Low THURS 7 41 a.m. 30o 7:58 p m High/Low 3-29 a m 6:02 a.m. 12:51 a.m. 341 p.m 6:19 p:m. 1:03p.m. WED 2:11 a.m. 7:30 a.m. 12:32 a.m. / 12:00 p.m. 10:17 p.m. 10:21 a.m. Homosassa High/Low 6:51 a.m. 7:08 p.m. 4:52 a.m. 1:21 a.m. 6:29 a.m. 7:39 p.m. 11:10 a.m. 9:16p.m. Withlacoochee High/Low 2:28 a.m. 3:49 a.m. 10:51 a.m. 2:40 p.m. 4:06 p.m. 11:11 p.m. 8:07 a.m. 4:01 a.m. 6:28 a.m. 1:23 a.m. 7:17 a.m. 3:00 a.m. 4:15 a.m. 11:36 a.m. 8:47 p.m. 4:26 p.m. 7:08 p.m. 1:48 p.m. 7:57 p.m. 3:25 p.m. 4:55 p.m. 11:44 p.m. 8:36 a.m. 4:34 a.m. 6:57 a.m. 1:56 a.m. 7:46 a.m. 3:33 a.m. 4:44 a.m. 12:24 p.m. 9:41 p.m. .5:14 p.m. 8:02 p.m. 2:36 p.m. 8:51 p.m. 4:13 p.m. 5:49 p.m. 9:10 a.m. 5:07 a.m.. 7:31 a.m. 2:29 a.m. 8:20 a.m. 4:06 a.m. 5:18 a.m. 12:17 a.m. 10:44 p.m. 6:08 p.m. 9:05 p.m. 3:30 p.m. 9:54.p.m. 5:07 p.m. 6:52 p.m. 1:18 p.m. 9:50 a.m 542am 811am 3.04 a.m 900 am 441 am 5-58 am 1252am 7.13 p.m 1028pm 4:35 prm. 11.17 p.m 612pm 8.15pm 223prm. 12:07 a.m. 6:23 a.m. 9:04 a.m. 3:45 a.m. 9:53 a.m. 5:22 a.m. 6:51 a.m. 1:33 a.m. 10:43 a.m. 8:38 p.m. 6:00 p.m. 7:37 p.m. 10:19 p.mr. 3:48 p.m. 8:08 a.m. 2:40 a.m. -- 5:27 p.m. Tide readings taken from mouths of rivers Snook season reopens Saturday with changes The statewide harvest season for snook reopens Sept. 1, and, anglers should note several new snook regulations are in effect. The Florida Fish and Wildlife Conservation Commission recent- ly changed snook bag and size limits and harvest seasons to help protect and preserve snook stocks in Florida There is now a one-fish daily bag limit per person statewide for snook and a slot limit of 28-32 inches total length in Atlantic waters and a 28-33 inches total length limit in Florida's Gulf, Everglades National Park and Monroe County waters. In addition, the snook harvest season will close on Dec. 1 in the Gulf, Everglades and Monroe County and will reopen March 1. In the Atlantic, the season will close on Dec. 15 and reopen Feb. 1. New rules also allow anglers to carry more than one cast net aboard a vessel while fishing for snook. These rule changes are to pro- vide additional protection for Florida's valuable. snook popula- tions, which are considered to be fairly healthy on .the state's Atlantic and Gulf coasts. The reduction in harvest is necessary to help achieve the Commission's management goal for shook and sustain and improve the fishery for the future. Licensed saltwater anglers must purchase a $2 permit to harvest snook. Snatch-hooking and spear- ing snook are prohibited, and it is illegal to buy or sell snook. These snook regulations also apply in federal waters. Navigation class offered at Homosassa Auxiliary U.S. Coast Guard Homosassa Auxiliary 15-04 will a Navigation class starting in September with eight sessions over an eight-week period. This class will give enough information and knowledge to be able to return to port safely. The exact date will be announced soon. If interested in either class or want more information, contact FSO offli- cer Jack Spariing at 476-8271 or e- mail him at sparkman3664@earth- link.net. The Auxiliary is actively assists the U.S. Coast Guard with promoting homeland security, public instruction' of safe boating, vessel safety exams, safety patrols and many other activi-, ties. Flotilla 15-04 is always looking - for dedicated persons with interest in the above endeavors to join. Anyone interest in joining Homosassa Flotilla 15-04 is encouraged to contact Ned. Barry 249-1042 or e-mail at nedberry@tampabay.com. G.P.S. Class at West Citrus Community Center Barry Schwartz will conduct a GP.S. workshop from 5:30 to 7 p.m.' ihe fourth Tuesday every month, at the West Citrus Community Center, 8940 W. Veterans Drive, Homosassa. Topics to be covered are: what is the Global. Positioning System and how does it work; understand-ing the GP.S. displays; using/creating routes, tracks, charts, way points, data fields, WAAS & tide sta-tions; the best ways to navigate while fish- ing or kayaking in our coastal waters, etc. Cost is $10 per workshop. Seating is limited. For information or to register, call 795-3831. BN T S W. t. I a0 Tr aI^tiCysaRie (3256 06 Your Road Service At Seam Sea Tow. Yellow. The color boater's trust . BOAT TOWING, SOFT UNGROUNDINGS, UIEL DELIVERIES, JUMP STARTS S- - - -iRH- - - 'LONELOW RATE A Yea (352) 795-2236 7,,,,,,75, <,37 Outdoors BRIEFS dl CITR US. C 0 U N Y Tide charts 6B THURSDAY AUGUST 30, 2007 CITRUS COUNTY CHRONICLE weP R 4a nqst ateo d mo49w-f Turn of phrase kwb o" na 0 wP O Nrf (n MratbrW i-cid [had Florida LOTTERIES Here are the winning numbers selected Wednesday in the Florida Lottery: .0, ,- ,eq// S a gam 4* ,-aUI . S.. ... a - "Copyrighted Material .... .. ... i.. Syndicated Content Available from Commercial News Providers HoIntws ida. Life after pop ardom ,___ 4 "0 JW to-W qpa = wowS owort .: ::::: .........::: N~h MMIauii , bobGNMN CASH 3 0-2-2 PLAY 4 5-2-3-1 . LOTTO 1-2-15-16-42-44 FANTASY 5 1-6-12-18-22 TUESDAY, AUGUST 28 Cash 3:3 7-8 Play4:0-4-6-7 Fantasy 5: 9 18 23 28 33 5-of-5 2 winners $110,712.31 4-of-5 309 $115.50 3-of-5 9,211 $10.50 Mega Money: 8 31 35 43 Mega Ball: 1 4-of-4 MB No winner 4-of-4 6 $3,756 3-of-4 MB 42 $1,173 3-of-4 1,309 $112 2-of-4 MB 1,935 $53.50 2-of-4 41,244 $4 1-of-4 MB 17,132 $6 MONDAY, AUGUST 27 Cash 3:0 0 -- 9 Play 4:0 0- 0 5 8 Fantasy 5:11 12 19 22 35 5-of-5 No winner 4-of-5 278 $890.50 3-of-5 9,519 $10 INSIDE THE NUMBERS To verify the accuracy of winning lottery numbers, players should double-check the numbers printed above with numbers officially posted by the Florida Lottery. On the Web, go to .corn; by telephone, call (850) 487.7777. U>!* i. i l - *^ i -* :" =-. a11 a 1i a ' ,,1 - o * a a m em.mi k np 4m *...o emaaouiiumm o .* be ".,M 'a .- -..U - a. *-. o a - a a - ~ a Ye .... S w ." < m him 'l, a m , 40 eeM -mw 40 go . -W -u w a - a '"-A - a a baa IP 1: lop REMEMBER WHEN * For more local history, visit the Remember When page of ChronicleOnline.com. q.u5mits -F *-* * nmmiu -, Slnmi, n - E = rid= Im V- ia : r flf-ii *' SWSS- St. .:: aHi ta %,nt k6 Red or white Ron Drinkhouse covers red and white wine basics. PAGE 2C C THURSDAY AUGUST 30, 2007 1 patte for the palate Brian Dew is the new breakfast chef at Rocco's. Julianne Munn OVER EASY Breakfast blooms at Rocco's with edible, eye-opening eye candy JULIANNE MUNN bonnyblu@earthlink.net Chronicle 11 meals are special at 4 Rocco's Pizza & Cafe in the SCrystal Springs Shopping SPlaza, but breakfast was recent- ly elevated to heavenly heights under the direction of Chef Brian Dew. Breakfast diners at the popular Italian eatery on State Road 44 just west of Meadowcrest in Crystal River can thank Dew's French grand- mother, Lauretta Paridis, for some of the upscale dishes on the morning menu, including delicate crepes filled with cream cheese, dappled with a creamy lemon sauce, and topped with strawber- ries or fruit of choice. You can also have champagne and orange juice Mimosas with your breakfast treat, De%% said, as well as other specialties such as waffle with seasonal fruit and whipped cream and hot oatmeal laced with raisins and served with brown sugar, butter and milk More traditional breakfast items are also avail- able, including French toast, a variety of three- egg omelets such as Florentine with fresh spinach and feta cheese), and Southern (with home fries folded inside and then topped with sausage gravy), and bacon, sausage, and ham with eggs. Also on the menu: Eggs Benedict and corned beef hash and eggs. And the best part of the new breakfast sce- nario is that the menu will move with Rocco's this fall when owners Joe and Daisy Salimeni relocate their restaurant to larger quarters in the new Bella Vista shopping plaza just east of the present site. The Salimenis own the new plaza. "The specialty breakfasts are really catching on," Dew said, "we're even getting reservations for Sunday breakfasts now and special re- quests are welcome" I'm Joe Salimeni said he moved to New York from trying Sicily about 35 years ago k and came to Citrus to keep it County 12 years ago. In New York City, he o% ned healthy. a pizzeria. three delis and Everything is two bakeries, so it's no -verylin 15 i surprise that he claims fresh and his menu is "authentic fresh and Old World" -fare cooked to But it's not just Italian sandwiches, subs and order. pizza that has customers returning to Rocco's. They also chow down on Brian Dew the abundant entrees, about his newly created including Chicken Milan- breakfast dishes. ese, Veal Sorrentino, Zuppa Di Pesce (shrimp, clams and mussels over linguini), and all sorts of pasta dishes, to name some of the extensive items. Desserts vary from cannoli to tiramisu to cheesecake and assorted cakes and pies. Dew has worked for Salimeni off and on for about five years, but has presently been at the restaurant with "Chef Joey," the night chef, for about a year. Dew's enthusiasm for his newly created break- fast dishes is unlimited when he describes his excitement in replicating his family's treasured recipes. "I'm trying to keep it healthy. Everything is fresh and cooked to order," he said. "I started BRIAN LaPETERiCr,,or,acl Breakfast crepes part of the new morning fare at Rocco's Pizza & Cafe in Crystal River. cooking when I was 10 years old, working after" school in my aunt Patricia's Greek restaurant in Virginia." Early training for Dew's role as a chef was at Holiday Inns in Athens, Ga.., and Virginia Beach, Va and in the Atlanta suburb of Buckhead. But he said he has worked at upscale restaurant all along the Atlantic coast. Breakfast specials at Rocco's range from $1.95 for an egg and cheese sandwich to $5.95 for three generous crepes. Full dinner meals at the restau- rant start at $9.95 for Stuffed Shells to $17.95 for such dishes as Shrimp Scampi. You can get an Eggplant Parmigiana Panini for $7.95 and a large Sicilian Supreme Pizza for $19.95. Soups, salads and other items round out the huge menu. Breakfast at Rocco's "'Authentic Brooklyn Style Fine Italian Cuisine" is served weekdays from 7 a.m. to 11 a.m. and Sundays from 7 a.m. to 1 p.m. Lunch is served daily from 11 a.m. to 3 p.m. and dinner from 4 to 9:30 p.m. For information and for carryout orders, call 563-0442. Here are some family recipes shared by Chef Dew for readers of Flair for Food: Belgium Beef Stew li 2 pounds boneless stew beef B 1/4 pound diced bacon S 1 tablespoon margarine N 20 small (baby) onions I 1 large clove of garlic, minced 2 tablespoons flour 2 teaspoons salt 0 1/4 teaspoon pepper 5 1 12-ounce can beer I 1 tablespoon lemon juice Pour boiling water over bacon; -let stand 1 minute. Drain. Put bacon and margarine in skil- let and cook until limp and transparent Add onions and garlic; cook, stirring frequently. Add stew beef and brown meat Stir in 2 tablespoons flour, salt, pepper and beer. Bring to a boil. Reduce heat and simmer 11/2 hours. Add more beer if necessary. Add salt and pepper to taste. Remove and stir in lemon juice. Please see .' /Page 3C Fete with Florida specialty W" ith the final long weekend of summer coming up, it was a pleasure to receive a lot of good seafood recipes and a bit of history about the Labor Day holiday from the state of -Florida. Without further ado. here is some terrific dining advice from the Florida Department of Agriculture and Con- s u m e r Service. Florida has When the first more Labor Day celebra- seafood tion took place 125 processing years ago plants in New York City, than any the focus was pri- other marily on recogniz- State. ing the hard work and dedi- cation of carpenters and machinists. Now, on the first Monday each September, we acknowledge and celebrate the toils of a much wider vari- ety of occupations. Not only do the fruits of our labor allow us to be a nation of self-support- ing individuals, we are also contributing to our nation's economic well-being. Florida's commercial fish- ing and aquaculture industry is no exception. Florida ranks among the top 12 states in fresh commercial seafood pro- duction, with an average har- vest of more than 90 million pounds with a dockside value of more than $165 million in 2005. Florida fishermen catch more than 90 percent of the nation's supply of grouper, pompano, mullet, stone crab, pink shrimp, spiny lobsters, and Spanish mackerel. The state boasts a fishing industry that provides more than 200 million seafood dinners annu- ally Florida has more seafood processing plants than any other state. Florida producers sold $74.9 million of aquaculture prod- ucts in 2005. The value of Florida's aquaculture sales ranks seventh in the nation. What this means is that while we take the day off to salute ourselves and the rest of the nation's workers on Labor Please see EASY/Page 3C .*' ,.*, ~ - ~,'- ,. 2C THURSDAY, AUGUST 30, 2007 FLAIR FOR FOOD CirOUS COUNTY (FL) CHRONICLE Red or white Th S sinde 40b -.No 40b .won -* ..Now.--W 0 'D '-.Bob O~m- 'aa 1. -a 411, -GN 'a-f d -dm Me p. -do=- a- -amm e-.40 me me -MM -'a 'doo a 'aa.- --go 4-O- MO.- p m b- .40 am .- oow - 4-- - - OWN, - .0do a me -~ ~-. 'a a a - a 'a .me - -a - a - a - a.. - * a - - a a - a- a a. -..~ C - 'a a-.. - a a - lisp Now a - 4b EN OW ahw- - ft 4ow -a ~ a quo'a a---. Material a''a 0 a S 0 - a - O - -~ - - 'a 'a- - --a- Itm M Ia Syndicated Content nal sunny day -- Av ailable fro-m-Commrinercial News Providerss' out Gom 4m 'Na - m-db- ---wam=- - a -qm p -d 404 - -. -- a qm o a -1MeM b-ow W- -- a --dM- 0 - 0 ft'a- ' -m=- 44 - MeNu o o i -b oweqme ' ..=Nowam ma 41 a ___*qm - - 40MNN D IW us qft 'aso mw .mlo *0me - 'a 'Ab 'a .0 % a mom -- 'a 'a - - w m 40 a -w a OMeS [hi~t~rw~f rsforkmsprits 40- ae-- a me am OW 0-ame - 4b- 4b 41000 4ba 'ad -d -o Ooaaa 'a. now- 44aw mwe - a -d-- *AIM elk 10* 4 -.O 1 4h '- 'a a ' -mo agea "W4 - me AP*OW OW 'a m a ' ~ ~ 4ba ' _ 4b 'am 4wMa * mmom ow mo- mo pdo 'a - -a- -w 44o 'am- 'a odbq a. . q b 4 w -Ea 4 b mowaw-ft 'mw wo a a- 'a a me 'a --m me . 0e 'a' ow. 'aft a me 'a 'a 'a m a a -p tam a a -um_ e 'a m 'a mb 'aOb m.N dome& o-o mm e 40 dame 0 me0- 4b meOEM 'a 'a -m Am do- 'a me -1b'a 'a 4m- wom"M " 'a -0 *- mm me 'a4b- mme 0 4me o amp-o 'Al 'a m e a am dw- 'a ______ me 'a -*4'b Me a-m *0me somom"mm m e 'aMil a- -, upobam -a 41m. OM WN e fto - dim 10 a %mmoa 0 a. o w.--C 'asm a w 40 am ap .00 a Mm'm a 041 - m-4b MM -MENEW 'as maoo aaME,- one 0-4up __ w "No --Mo -WN - mopme Mn* a 40 V-ftm oo* omm 'a-0 WMP o4oe 1 -MMMEE-N -.MEO% ON-aw mooe 1M-c 'a 'a a -mamom a1 a Nio D -4 *o .-mEw 4 '-.om -4 lights out Power outages are common this time of year. If you lose power, be sure to review these guidelines before throwing away refrigerated and frozen foods. * If refrigerator and freezer doors stay closed, most refrigerated foods will keep about 4 hours. Frozen foods will remain frozen at least 24 hours (a full freezer, 48). * Discard refrigerated perishable foods stored at more than 40F for over four hours. * Do not refreeze foods that have thawed completely. * If frozen foods still have ice crystals, they may be refrozen. * Never taste a food to determine its safety. * When in doubt, throw it out! Publix. WHERE SHOPPING IS A PLEASURE.' a- me 4m -'a -- . em 'aw ~ a I I4 'a 'a- 'a a 'a Oa ~ - 'a -a - -'a me'a a - 'a - a- a - Now long C- a - a- 'a a-- - - - - a- - 0- me me- 'a a- a a qwwe - MMIS0 %- a-- ma a- . - -40 41b a. no a. dl- 'd .a- qN-m 'a- 4D A5. Al xLSOFTHE W WITHWuOOCHe SItMTE TPAIL Sunday, October 7, 2007 on the Withlacoochee State Trai A A3 Withlacoochee State Trail. SIGN UP EARLY! ( dAm- 41b ..Io a - - -db ftwo -41b-- 4b.' WAW AM'a 44- do a-a1b -W OP- t-- wam- me o - 0.0 'a- 'a- - a-- --opyrighted E-i"Copyrghted Sp AL 41P * . ko. FLAIR FOR FOOD THURSDAY, AUGUST 30, 2007 3C - Swef - 41111W - -Rw"s, .- q- ___-.0 NE -.m 4% - o"40moos - .~ -~ 0 - * "Copyrighted Material a 4D- --- -Syndicated Content Available from Commercial News Providers' qmm mm m &do 4101.-- q- Q 0 " -44 --soft ~ - - .1 - - - w0--Ww .- S qwdm .q -e m ~ b m 0 sm one 4 0 -WbW % j~w up - - - -C - 0 -o. - EASY Continued from Page Ic Day, we can also enjoy many Florida seafood and aquacul- ture species available at our local markets. To help you plan for your celebration, here are some recipes developed by the FDACS: Grilled Shrimp with Orange Barbecue Sauce 1 1/2 pounds wild Florida white, pink or royal red shrimp, peeled and deveined 1/2 teaspoon salt 1/4 teaspoon pepper -.i 1/2 cup Florida orange .... juice il 1/2 cup catsup i 2 tablespoons Florida lime juice 1 tablespoon instant PALATE Continued from Page 1C Spicy Meat Pie 2 pounds ground beef A 3/4 cup chopped onion .... .3 cubes beef bouillon 1 package George Washington seasoning (found with soups in supermarkets do not substitute) N 1/2 teaspoon pepper 3 tablespoons cornstarch 1/2 cup water Pastry for two-crust pie (see following recipe for Dew's homemade) *M_ a Go * .. M aw 't tm 0 -ftp Homemade Pie Dough (For Spicy Meat Pie and Raisin Squares) 8 6 cups sifted King Arthur September 29 Old Courthouse. Register early, save $5. SFor more information call 637-2475 .7. rO 7 minced onion 1 tablespoon soy sauce Cheese grits (optional) Thread shrimp on 10-inch skewers. Sprinkle with salt and pepper. Set aside. In a small saucepan, combine orange juice, catsup, lime juice, onion, and soy sauce; heat until bub- bly. Brush shrimp with sauce and grill 6 to 8 inches over medium coals for 3 to 4 min- utes. Turn, baste and cook an additional 3 to 4 minutes. Serve with cheese grits, if desired. Yield: 4 servings. Florida Clams Casino 3 4 slices lean bacon, chopped fine 1/2 cup Florida onion, chopped M 1 large Florida garlic clove, minced 1/2 cup Florida red bell pepper, finely diced flour 1 pound lard 3 teaspoons salt 1/4 stick (about 2 tablespoons) margarine M 1 cup cold water Sift flour and salt and add margarine and lard and work into flour until it looks like oat- meal. Then add 1 cup of cold water and mix with hand blender until it forms a ball. Roll on floured board. There should be enough for three pies or a large pan of raisin squares (recipe follows). Leftover dough can be frozen for later use. Raisin Squares *S D4 ap '^.a-' 'QBP * . -a -1oo * a~ * - * ~ * ~ ~.- - * -~ - 1/2 cup Florida green bell pepper, finely diced 1/4 teaspoon dried oregano, crumbled E 1 tablespoon olive oil 1 teaspoon wine vinegar 1 tablespoon Parmesan cheese, freshly grated 0 12 middle neck roll pan filled with a layer Boil water and then add raisins. Boil for 5 minutes. Remove from stove. Mix sugar, salt, and cornstarch together and add to raisin mix. Mix well and add lemon juice and rum. Mix well again. Let stand until cool. Roll pie dough in a 13-x 9- x 5/8-inch pan (or jelly roll pan). Add raisin mixture. Dot with butter or margarine. Put sec- ond crust on top and brush with milk Pick with a fork to vent Bake in 450-degree oven for 15 minutes, then at 375 degrees for 20 to 30 minutes or until brown. "I will donate my S ..p..ers to NIE when :go out of town." Call_563-5655 -Donate Your Papers. t That Easy! e 0 Newspapers In / Education (NIE) -i y /L/iteracy Program of The ^ Citrus County Chronicle i provides FREE B newspapers to classrooms as a S'- supplemental teaching tool. For more information about NIE, call 563-5655 of rock salt to balance the shells, arrange clam meat on the reserved shells. Top each clam with the bell pepper mix- ture. Bake in a preheated 400- degree oven for 12 to 15 min- utes until cooked through. Serve clams on a platter lined with a layer of rock salt Note: Bell pepper mixture may be made 1 day in advance and kept covered and chilled. Yield: 2 servings as an appetiz- er. Herb-seared Mahi-mahi 4 5- to-7-ounce Florida mahi-mahi fillets *1 Salt and pepper to taste 1 bunch Florida flat leaf parsley, finely chopped 1 sprig fresh Florida rosemary, finely chopped 1 small bunch-fres.t -- - Florida thyme, finely (~I I\ _ / 5JOju'~1. chopped E 2 tablespoons olive oil Season fillets with salt and pepper. Mix together chopped herbs and press onto tops of fil- lets. Heat oil in a large saute pan on medium-high heat; add fillets herb-side down. Saute for 3 to 5 minutes on each side until cooked through. Yield: 4 servings. Lobster Carambola Citrus Salad 1 cup Florida orange juice 2 tablespoons Florida honey 1/4 cup canola oil 0 1 teaspoon salt 4 medium Florida carambolas (star fruit), sliced 1 cup Florida orange sectionis__--- 1 cup Florida pink REVIEW BOARD THURSDAY September 6, 2007, at 9:00 AM Lecanto Government Building 3600 West Sovereign Path SRoom.166 Lecanto, Florida 34461 JOHN JAMES BARD, CHAIR MILES BLODGETT, 1ST VICE CHAIR RAYMOND HUGHES, 2ND VICE-CHAIR WILLIAM GARVIN C ZANA ENNIS (ALTERNATE) DI A. CALL TO ORDER B. INVOCATION C. PLEDGE OF ALLEGIANCE D. APPROVAL OF MINUTES August 16, 2007 E. APPLICATIONS PUBLIC HEARING ATLAS AMENDMENT (AA) LAND DEVELOPMENT CODE 1. AA-06-04 Acklev/Nature's Campground grapefruit sections 1 pound Florida cooked lobster tail meat, sliced N 1 cup canned black beans, rinsed and drained Florida salad greens, chilled For dressing, bring orange juice to a boil in a saucepan, reducing liquid by 1/2. Cool in a small bowl. Whisk in the orange juice, honey, oil, and salt Set aside. On individual plates, arrange carambola slices, orange and grapefruit sections, lobster and black beans on salad greens. Drizzle with orange salad dressing and serve. Yield: 4 servings. Julianne Munn is food editor for the Citrus County Chronicle. Her e-mail address is bonnyblu@earthlinknet WALTER PRUSS DWIGHT HOOPER -- JAMES KELLNER HUCK DIXON (SCHOOL BD) AVID LANGER (ALTERNATE) REQUEST: To amend the master plan of development for Nature's Campground, an existing recreational vehicle park. LOCATION: Section 29. Township 19 South, Range 17 East. Further described as AK1140421, which property address is 10359 W. Halls River Road (Homosassa Area). Legal description available in file.), which property address is 10973 S. Lecanto Highway, Lecanto, FL. STAFF CONTACT: MargaretA. Beake, AIA, AICP, Senior Planner PLAT VACATION (PV) LAND DEVELOPMENT CODE PV-07-01 Stillwell/Nash REQUEST: To vacate the "park" title of John's Park, lying within the plat of Highlands Trailer Park, as recorded in Plat Book 2, Pages 132 and 132A, public records of Citrus County, Florida. STAFF CONTACT: Joanna L. Coutu, AIA, AICP, Principal Planner PUBLIC HEARING COMPREHENSIVE PLAN AMENDMENTS/ATLAS AMENDMENTS CPA/AA-06-21 Avis Craig/Villages of Citrus Hills REQUEST: This request is to amend approximately 127 acres from various land use districts (GNC, MDR, PSO,. LOCATION: Section 33, Township 18 South, Range 18 East, more particularly described as Parcels 21100 and part of 22100; together with Section 34, Township 18 South, Ranae 18 East. more particularly described as Parcel 33000; and Section 04, Township 19 South, Range 18 East, more particularly described as a part of Parcel 11110; and Section 03. Township 19 South, Range 18 East. more particularly described as Parcels 41420 and 44000; all being situated in Citrus County, Florida. The subject properties are located east of CR 491 in the Lecanto Area. STAFF CONTACT- Jenette B..Collins, AICP, Assistant Director,_Community Development PUBLIC HEARING DEVIATION (D) D-06-01 Craig/Village of Citrus Hills REQUEST: A Notice Of Proposed Change to the master development plan for The Villages of Citrus Hills DRI, and that the proposal does not constitute a substantial deviation pursuant to Chapter 380.06(19), FloridaStatutes. LOCATION: Sections 23. 24 25.,26, 33 34, and 35. Township 18 South, Range 18 East and Sections 03. and 04, Township 19 South. Ranae 18 East -More specifically described as The Villages of Citrus Hills, Development of Regional Impact,, Ranae 18 East, and Parcels 41420 and 44000 lying in Section 03. Township 19 South. Range 18 East, all being situated in Citrus County, Florida. A complete Legal Description is included as part of the submitted application on file in the Department of Development Services. (Hernando and Lecanto Areas). STAFF RECOMMENDATION: APPROVAL WITH CONDITIONS STAFF CONTACT: Jenette B. Collins, AICP, Assistant Director, Community Development. 71947 154-0830 THCRN CITRUS COUNTY PLANNING AND DEVELOPMENT EVERY TUESDAY SAVE $$ IAL-A-D Cmus Coupin- (F,!,,' Cr-rzoiviai.., ovw ..mlP jjljj m on E 4C THURSDAY AUGUST 30, 2007 News NOTES Flotilla 15-01 moves meeting date U.S. Coast Guard Auxiliary, Crystal River Flotilla 15-01 will meet at 6:30 p.m. Sept. 10 at 148 N.E. Fifth St. (one and one- half blocks east of Citrus Avenue near Crystal Paradise restaurant). This is a general monthly meeting usually held on the first Monday each month Labor Day necessitat- ed the change for September only. Guests are welcome to just visit or to consider joining our ranks in support of U.S. Coast Guard missions. Call Bob Bauman at 726-3427 or e-mail rjbalb@gowebco.com for more information. Art group to resume weekly classes The Beverly Hills Art Group will resume painting classes Thursday, Sept. 6. Classes are from 9:30 a.m. to 12:30 p.m. every Thursday at the Community Building on Civic Circle. Classes are open to every- one. Beginners and would-be artists are welcome. The monthly membership meeting will be at the Central Ridge Library at 1 p.m. Monday, Sept. 17. All members are urged to attend. Nonmembers are welcome. Call Alice at 746-5731. Bowling league welcomes players The "1 p.m. 'Senior Men's Thursday Jackpot League" is open to all bowlers at an age of 50 years and older. The cost is $10 weekly and payable only on the weeks that are bowled. It is a handicap format with weekly prizes awarded for single games and high three-game totals. Tentative starting date is Thursday, Sept. 6. Men interest- ed may call Charles Baldi at 382-5019 or Neffer's Lanes at 628-3552. Gardeners to explore South African flowers On Thursday, Sept. 6, the meeting of the Citrus Garden Club will feature a program on the Flowers of South Africa. A social time begins at 9 a.m. with the business meeting starting at 9:30. Following a short break, the program will start at around 10:45. The meetings are in the Whispering Pines Park Recreation Building. Questions about the club or its activities should be directed to club presi- dent, Judy Morris, at 341-0954. Youth bowling league registering Beverly Hills Youth Bowling League, sponsored in part by Coca-Cola, begins at 9:15 a.m. Saturday, Sept. 8, at Beverly Hills Bowl. Late registration is still available. League bowling is open to youths age 4 to 22. Fees are $7 weekly, with one-time registra- tion fee of $12.50. Call Debbie McNall at 527- 0514. Pet SPOTLIGHT NFL fan How book sales happen Year-round process starts at Book House Special to the Chronicle Where do those books, CDs, DVDs, cassettes and puzzles come from? How are they sorted, packed and priced? How do they get to the audito- rium and who arranges them so conveniently? Those who have attended the Friends of the Library semi-annual sales may have wondered how it all happens, what goes on behind the scenes. The year-round process begins at the Book House in the Historic Hernando Community School. There, Friends of the Citrus County Library System (FOCCLS) gather every Tuesday and Thursday morning to sort, price and pack the many donated books and -related materials into hundreds of banana boxes. The donations come from the community and from partner libraries. To promote the fundraiser, the publicity committee dis- tributes bookmarks and flyers with dates and times of the sale. Short articles and fea- tures in local media and an Internet ad placed with Booksalefinder.com, high- light particular treasures in MARY O8HS/Special to the Chronicle Friends of the Citrus County Library Book House volunteers, wearing their sunny FOCCLS T-shirts, celebrate the growing stacks of banana boxes packed with quality books, CDs, DVDs and puzzles. The pace accelerates as the Friends prepare for the big Fall Book Sale fundraiser, which runs from Oct. 5 to 9 at the Citrus County Auditorium. From left are: Judy Rose, Joyce Kirschner, Kathe Echlin, Mike Quigley, Sylvia Wilson, Jackie Dean, Gene Musselman, Julie Asbury, Jean Racine, Lynne Boele, Carol Berger, Ellen Giallonardo, Carol Hamilton, Jim Echlin, Sue Haderer and Ann Treanor. the up-coming sale. Dealers are notified and volunteers speak at local club meetings and TV shows to discuss spe- cial features of the sale. Telephone committees con- tact Friends in the three part- ner groups, Coastal, Central Ridge and Lakes to secure the more than 100 volunteers it takes to put on this five day sale. Volunteers work Todi FOCCL raise $226,5 Citrus ( library in three or'four hour shifts as cashiers, prices, greeters and floaters. Several also work the two days of set-up preceding the sale. Two days before the open- ing night of the sale, Keep It Safe Movers arrive early in the morning with a large mov- ing van and strong helpers to haul 800 or so ate, packed banana boxes to the Cit- S has rus County Audi- torium. At the ;ed auditorium the boxes are un- 00 for loaded with the help of the Citrus County High School AFJROTC and ries. taken to labeled tables that have been set-up with the help of the Inverness -Rotary Club. The books are sorted into more than 40 categories of non-fiction and ,fiction cate- gories. Friends volunteers work the next two days, fine- tuning the arrangement and pricing of books and other materials. On Friday, excitement and energy mount as the time for the evening- Preview event draws near. The volunteers check in to the auditorium, receive instructions and report to their posts. At 5 o'clock the doors open, and the patrons rush in. End of story? No. For five days, volunteers continue to sort, price, bag and carry out books for patrons. On the last day of the sale, along with their regular duties, volun- teers begin to cube empty banana boxes for the trip back to book house. : On Tuesday afternoon, at the close of the sale, remain- ing books are boxed and given to charities or sold to dealers. The tables are taken down with the help of the CHS AFJROTC. And order is restored to the auditorium. For a few days, the Friends rest on their laurels, taking pride in the success of the sale and the monies raised for Citrus County libraries. Then it's back to work at the Book House as the year- round process begins again. To date, FOCCLS has raised $226,500 for Citrus County libraries. The next big sale will be Oct. 5 to 9. The Friends welcome oth- ers to join in this rewarding service to the community. Yankeetown-Inglis Woman's Club to begin new season Special to the Chronicle The Yankeetown-Inglis Woman's Club will begin its 2007-08 season Tuesday, at which time the thrift shop will open. Thrift shop hours will be from 10 a.m. to 1 p.m. Tuesday and Friday and noon to 3 p.m. Wednesday. The first regular meeting of the club will be at 1:30 p.m. Wednesday at the clubhouse at 5 56th St., Yankeetown, Bingo will resume at 7 p.m. Thursday. Proceeds from the Thrift Shop and special activities help support various community proj- ects and pay for the maintenance and upkeep of the A.E Knotts Library, which the club owns. Proceeds from bingo fund scholarships for local students; eight students received $500 scholar- ships this past year. The club made some improvements this sum- Proceeds from bingo fund scholarships for local students; eight students received scholarships this past year. mer by creating a handicapped, wheel chair accessible bathroom, installing new window treatments and reorganizing the kitchen. Anyone interested in contributing to the efforts of the club is invited to attend the first regular meeting. For information, call President Eleanor Berkley at 447-3899 or First Vice President Leslie Dasch at 447-2700. Eye on Special to the Chronicle Crystal River Users Group will offer a class in Adobe Photoshop Elements from 9:30 to noon Tuesdays, Sept. 4, 11, 18 and 25 at the Central Citrus Community Center taught by Jim O'Donnell. Cost is $25. Adobe Photoshop Elements is an image editing program that can fix most common problems that occur when using a digital camera or scan- ning a photograph. You can modify, improve, change digi- tal images; merge selected parts of images; change or cor- rect colors; straighten and/or crop images; and use a host of other creative features. The class will use the Windows-based program. Stu- dents should have basic com- puter skills for this class. A free 30-day trial version is available * WHAT: Adobe Photoshop Elements class. WHEN: 9:30 a.m. to noon Tuesday, Sept. 4, 11, 18 and 25. WHERE: Central Citrus Community Center. COST: $25. GET INFO: Call Anita at 527-3188 or Barbara at 628-5644 from 9 a.m. to 8 p.m. Monday through Friday. by download (v. 5.0) from Adobe Systems for those who do not yet own this software. Partici- pants may bring laptops to class if they wish. For more information or to register, call Anita at 527-3188 or Barbara at 628-5644 from 9 a.m. to 8 p.m. Monday through Friday. CRHS preschool taking enrollments Special to the Chronicle Angle, 7 years old, is a Lhasa apso. She loves football and watches television with her owners, Helen and Eugene DuBose, of Inverness. * Because of an editor's error the owners' last name was mis- spelled in Wednesday's edition. Special to the Chronicle Treasure Chest Preschool at Crystal River High School is accepting enrollment for the 2007-08 school year. Children must be 4 years old before Sept 1. The program will start Tuesday. The preschool operates Monday through Thursdays, 9:15 a.m. to 11:45 a.m., accord- ing to the Citrus County School calendar. The cost of the program is $30 per month. Enrollment is on a first-come basis and is lim- ited to 18 children. Treasure Chest Preschool is an integral part of the Early Childhood Education .program at Crystal River High School. This program is designed to prepare high school students for employment or advanced training in the early childhood industry through observation and supervised work experi- ence with the young children in Treasure Chest Preschool. For more information or to enroll your child, call Dana Fields at 795-5224 or 795-4641. DUANE FINCH/Special to the Chronicle This bald eagle Is at the Homosassa Springs Wildlife State Park. The bird has a bad wing from an Injury. Duane Finch, of Floral City, said that the eagle looked him straight in the eye, so he took many pictures. *. pl News notes tend to run one week prior to the date of an event. Publication on a specific day cannot be guaranteed. * Expect notes to run no more than twice. CRUG to give class in Adobe's Elements CITRUS COUNTY (rL,) CHRONICLE THURSDAY EVENING AUGUST 30, 2007 C: ComcastCitrus B: Bright House D: Comcast,Dunnellon 1: Comcast, Inglis c B D I 6:00 6:30 7:00 7:30 8:00 8:30 9:00 9:30 10:00110:30 11:00 11:30 MH News (N) NBC News Entertainme Access My Name Is 30 Rock '14, The Office Scrubs '14' ER "I Don't" (In Stereo) News (N) Tonight ,19 19 19 127 nt Hollywood Earl'14, D' B9 1295 '14, D' 98818 '14, L' U 8818 9804566 Show ,WEDU1 BBC World Business The NewsHour With Jim A Gulf Suncoast Antiques Roadshow 'G' America at a Crossroads These Kids Mean FBS' U 3 3 News 'G' Rpt. Lehrer [ 9301 Coast Bus [ 5585 (In Stereo) 'PG' 8672 Business (N) 'G' 9 VWUFT 5 BBC News Business The NewsHour With Jim Gator Beat 96498 The This Old House Hour These Kids Mean Monty Tavis Smiley PBS1 8 5 5 5 8479 Rpt. Lehrer (N) 70450 'G' 9076634 Business (N) 'G' [9 Python 25011 WFiA News (N) NBC News Bucs Bonus Show 63160 NFL Preseason Football Houston Texans at Tampa Bay Buccaneers. From News (N) Tonight B 8 8 8 8 1189 Raymond James Stadium in Tampa, Fla. (Live) 238837 5604491 Show WFTm News (N) ABC WId Jeopardy! Bucs Pre- NFL Preseason Football Houston Texans at Tampa Bay Buccaneers. From News(N) Nightline 10 20 20 20 5301 News 'G' [ 3214 Game Raymond James Stadium in Tampa, Fla. (Live) 892059 1422108 21917419 T ffSP = News(N) Evening Wheel of Jeopardyl Big Brother 8 One must CSI: Crime Scene Without a Trace "At Rest" News (N) Late Show CBS 10 10 10 10 3943 News Fortune 'G' 'G'M 31739 leave. 27382 Investigation '14, D,S,V '14, V [ 17905 1413450 wTvT m News (N) 9 88030 The Bernie King of the Are You Smarter Than a Don't Forget the Lyrics! News (N) c[ 59905 News M*A*S*H FOX ri ( 13 13 Mac Show Hill 'PG L' 5th Grader? 'PG' 69382 'PG' [ 56818 7383081 'PG' 1 News (N) ABC Wid Entertainme Inside Ugly Betty "Petra-Gate" Grey's Anatomy '14, D' Men in Trees "History News (N) Nightline 3 11 11 27301 News nt Edition 'PG' '14' 90 14450 c9 9050699 Lessons" 'PG, S' 7887276 10844769 S "w2 Richard and Lindsay Dr. Giving Hope Van Impe Gods News Life Today Worship The 700 Club 'PG' 9 Christians & Purpose for N 2 2 2 2 Roberts 'G' c 2157030 Lindstrom Pres 'G' 7473943 Center 9997127 Jews Life 'G' WFTS, News (N) ABC Wid Inside The Insider Ugly Betty "Petra-Gate" Grey's Anatomy '14, D' Men in Trees "History News (N) Nightline ABC 11 11 61635 News Edition 'PG' 87721 '14' c9 26504 c 5341108 Lessons" 'PG, S' B 2086653 41053671 (W1MORj 2 Will & Grace Frasier 'PG' Still Access Movie: "The Avengers" (1998) Ralph Fiennes, Will & Grace Frasier 'PQ Still Access "- 12 12 '14' 85924 Standing Hollywood Uma Thurman. BB 45382 '14' D'15276 Standing Hollywood Judge Mathis (In Stereo) Every- Seinfeld Movie: **1 "S.WA.T." (2003) Samuel L. Jackson. A Los Scrubs '14' Seinfeld Sex and the MNT 6-j 6 6 6 6 'PG' N 6875160 Raymond 'PQ D' Angeles SWAT team must protect a criminal. 5493585 2410127 'PG' City '14, 2WACX Variety 3547 The 700 Club'PG' E Tim Gilligan Variety 9568 Word of The Faith Mark The Gospel Claud Bowers 33276 TBN 21 21' 21 239011 6011 Excellence Show Chironna Truth 'G' WTOG The Malcolm in The Friends 'PG' Smallville "Nemesis" (In Supernatural (In Stereo) The King of The King of According to According to M *E 4" 4 4 4 Simpsons the Middle Simpsons 9 7301 Stereo) 'PG' cc 67924 '14, D,L,V BB 47160 Queens Queens Jim 'PG, D' Jim 'PQ L' SiWYKE News Franklin County Community Market Slice of Movie 51943 News 19479 County F M 16 16 16 16 127382 Realty Court Theatre Place Citrus Court W OGX Seinfeld King of the The The Are You Smarter Than a Don't Forget the Lyricsl News (In Stereo) B9 Seinfeld That'70s F 13 13 'PQ D' Hill 'P, L' Simpsons Simpsons 5th Grader? 'PG' 21108 'PG' B 34672 44059 'PG' 15059 Show 'PG, WVEA ,1 Noticias 62 Noticiero Yo Amo a Juan Amar sin Limites 908011 Destilando Amor 995547 Aqul y Ahora 998634 Noticias 62 Noticiero S 15 15 15 15 (N) 202214 Univisi6n Querend6n 9363 N) 269634 Univisi6n Diagnosis Murder "No Designing Designing Mama's Mama's Who's the Who's the The Wonder The Wonder aid Christy 17 Good Deed 'PGL'59160 Wo me en 'PGW Fami y'PG'jFam av'PG' Boss 'P ?'PG' Years'P Year'P'PG' Prooram. La Bi 54 48 54 54 Col Case Files'PG'' CSI: Miami ree FaI" SIl:iamieair" Te First 4 )' ansasCity A(N) Kansas ity WAT'14' S 54 48 54 54 219363 '14, V' B 523943 '14, V B 509363 529127 '14' c9 522214 39 930479 AM 55 44 ,55 Movie: *k* "Marked for Death" Movie: *-* "Die Hard With a Vengeance" (1995, Action) Mad Men A rift forms. (N) Mad Men A rift forms. 55 64 55 55 (1990, Action) 711092 Bruce Willis, Jeremy Irons. 102301 982672 309585 i 523552 52 The Crocodile Hunter 'G' The Most Fooled by Jane Goodall's Return to Jane Goodall's Heroes Animal Planet Heroes The Most Fooled by S52 35 52 5 2126160 Extreme 'G' Nature 'G' Gombe 'G' 9976634 'G' [ 9996498 Phoenix 'G' 3 9999585 Extreme 'G' Nature 'G' BA Top Chef 'Guilty Top Chef "Restaurant Top Chef "Second Welcome to the Parker Welcome to the Parker. Top Chef "Second AV ) 74 Pleasures" '14' (9 189924 Wars- '14' [ 717721 Helping" '14' 9 733769 '14' [ 713905 (N) '14' 9 7 6092 Helping" '14' C 893740 27 61 27 27 Movie: **i "The Scrubs '14' Scrubs '14' Daily Show Colbert Reno 9111 ISouth Park South Park Mind of Daily Show Colbert ( 2761 2 27 Jerk" 11450 57653 83566 Report 'PG'25030 I'MA, L' 'MA'31214 Mencia'14, Report S98 45 98 98 Top 20 Countdown (N) (In Celebrity Celebrity 2007 CMT Music Awards In Stereo) 853301 The 2007 Miss America Pageant (In ) 98 45 98 98 tereo) 981818 Bull Riding Bull Riding Stereo) 445585 T 956 9 9 f, c Beauty-Alive EW1N Daily Mass: Our Lady of Life on the Rock 'G' Parable The Holy Back Stage The Pure Web of Faith 'G' 5266276 Gallery 'G' the Angels 'G' 1379856 1355276 9796189 IRosary I 'G' Life'G' F 29 52 29 29 8 Simple 8 Simple Grounded Grounded Movie: *** "My Girl" (1991, Drama) Anna Chlumsky, Whose The 700 Club 'PG' 9 Rules'PG' Rules'PG' for Life '14' for Life '14, Macaulay Culkin, Dan Aykroyd. 9 993740 ; Line? 127943 F n i 30 60 30 30 Movie: *% "Godzilla" (1998, Science Fiction) Movie: *** "Independence Day" (1996) Will Smith, pill Pullman, Jeff Movie: "Independence S, 30 60 30 30 Matthew Broderick,'Jean Reno. 8216214 Goldblum. Earthlings vs. evil aliens in 15-mile-wide ships. 2907818 Day" 2921498 I 23 23 23 Look What I Small Space If Walls House Designed to IBuy Me 'G' Divine Color House House Over Your Don't Sweat [HGTV 23 7 23 23 Did! 'G' Could Hunters'G' Sell'G' 11505721 Design 'G' Correction Hunters'G' Hunters 'G' Head 'G' It 'G' 51 25 c 51 o 51 Modern Marvels 'G' 9 Modern Marvels "Desert Super Tools "Ship" 'PG' Boneyard Hurricane Dogfights "No Room for Human Weapon 7367189 Tech" 'G' 1344160 30 1360108 Katrina. 'PG' 9 1373672 Error" 'PG' 1383059 Pankration. 'PG' 9 ( 24 38 24 24 Reba 'PG' Reba 'PG' Still Still Reba 'PG, L' Reba 'PG' Movie: ** 'White Oleander" (2002) Alison Will & Grace Will & Grace 2 338837 329189 Standing Standing 615498 694905 Lohman, Robin Wright Penn. c9 816063 '14' '14' ICK 28 36 28 28 o Zoey 101 Ned's Fairly Jimmy Drake & SpongeBob Home Fresh Fresh Fresh Fresh Fresh N I 28 36 28 28 'Y7' 892450 School OddParents Neutron Josh 'Y7' c9 Videos Prince Prince Prince Prince Prince f 31 59 31 31 Stargate SG-1 Osiris Movie: "Megasnake" (2007, Suspense) Michael Who Wants to Be a Destination Truth (In Who Wants to Be a goes to war 'PG, V Shanks, Siri Baruc. 2961837 Superhero? 1567672 Stereo) cc 1577059 Superhero? 2950721 I -t 37 43 37 37 CSI: Crime Scene CSI: Crime Scene CSI: Crime Scene TNA iMPACTI (N) (In UFC Unleashed '14' UFC Unleashed '14' S3 4 7 I7 investigation 'PQ L,V Investigation 'PQ L,V Investigation '14, D,L,S,V Stereo) '14, D,L,V M 845943 262856 49 23 49 49 Friends '14, Movie: *** "Ocean's Eleven" (2001, Comedy-Drama) World's Funniest Movie: *** "Ocean's Eleven" (2001) George S' 792011 George Clooney, Matt Damon, Andy Garcia. 9 628924 Commercials (N) '14' Clooney, Matt Damon. c 80586699 53_ "Spite Movie:. * "The Cameraman" Movie: "Steamboat Bill, Movie: * * "The General" Movie: ** "College" (1927, T 53 Marriage" (1928, Comedy) 6508905 Jr."4642127 (1927)'Buster Keaton. 1069189 IComedy) Buster Keaton. 'PG' Cash Cab Cash Cab MythBusters "Superhero Dirty Jobs "Alligator Egg Lobster Wars (N) 'P, L' Wildcatters Techniques Dirty Jobs Barrel making. S 53 345353'G' 801108 'G' 885160 Hour" 'PG' 505547 Collector" '14, L' 514295 534059 for finding oil. 'PQ L' '14, L' c9 938011 50465050 0 Property Ladder 'G' Monster Garage 'PG' BB American Hot Rod "59 American Chopper (N) Hard Shine A 1934 Ford American Chopper 'PG' 536818 5 831740 Corvette 2" (N) 'PG' 'PG' 837924 pickup. 'PG' 830011 257924 48 33 48 48 Law & Order Law & Order "Bait" 'PG' Law & Order "Merger" Law & Order "Married Law & Order "Hands Saving Grace 'MA, L,S,V' 'C) 48 33 48 48 ompetence" 'PQ, L' 9 (DVS) 839382 '14, D' B9 (DVS) 848030 With Children" '14' Free" '14' 838653 c9 255566 9 54A 9 Into Alaska With Jeff Into Alaska With Jeff More Las Vegas FAQs More Las Vegas Do's and Vegas Cheaters Exposed More Las Vegas FAQs S 9 54 9 9 Corwin 'PG' c 2979818. Corwin 'PG' 9 1035473 'PG' 5730081 Don'ts 'PG' 5635437 'PG' 9 2485914 'PG' 4041295 3275 3232 Little House on the Andy Griffith Andy Griffith The Cosby The Cosby The IThe Sanford and Sanford and M*A*S*H M*A*S*H S32 75 32 32 Prairie 'G' 9 2151856 Show 'G' Show 'PG' Jeffersons Jeffersons Son 'PG'. Son 'PG' 'PG' 'PG' 47324747 Law & Order: Special U.S. Open Tennis Second Round. From the USTA National Tennis Center in Flushing Meadows, N.Y Law & Order: Criminal 47 32 47 4 Victims Unit '14'873585 (Live) 523634 Intent '14' 561363 W N 181818 18 Funniest Funniest America's Funniest Home MLB Baseball Milwaukee Brewers at Chicago Cubs. From Wrigley Field in WGN News Scrubs'14' ( 18 18 18 1 ets Pets Videos 'PG' 711547 Chicaqo. (In Stereo Live) 9 461127 1173498 THURSDAY EVENING AUGUST 30, 2007 c: Comcastitrus B: Bright House D: ComcastDunnellon 1: Comcast, Inglis C BD I 6:00 6:30 7:00 7:30 8:00 8:30 9:00 9:30 10:00 10:30 11:00 11:301 DSZ 46 4 4 Zack & Cody Zack & Cody Hannah Zack & Cody Movie: "UpUp andAwary"(2000) That's So That's So Life With Zack & Cody Hannah S 46 40 46 46 Montana 'G' Michael J. Pagan. 'G' 871653 Raven 'G' Raven 'G' Derek'G' Montana'G' A o 68 13 3 M*A*S*H M*A*S*H M*A*S*H M*A*S*H Walker, Texas Ranger 'PQ Movie: "McBride: The Doctor Is Out.. Really Out" Murder, She Wrote (In S39 68 39 39 PG' 3756672 'PG' 3747924 'PG' 4788363 'PG' 3743108 V 9 9992672 (2005) John Larroquette. 'PG' [ 9902059 Stereo) 'G' 9[ 2151301 H Movie: ** 'Take the Lead" (2006) Antonio Movie: *** "16 Blocks" (2006) Bruce Rush Hour 3 Bob Saget: That Ain't Real Sex 23 (In Stereo) Banderas, Rob Brown. (In Stereo) 1 973924 Willis. c9 3045276 Right 'MA' c 964276 'MA, L,S' [ 381189 AX : '"The Movie: ** 'The Break-Up" (2006) Movie: *** "48 HRS."(1982, Action) Nick Noite, Movie: **** "Pan's Labyrinth" (2006, Fantasy) Marine" Vince Vaughn. 3E 3395924 Eddie Murphy. (In Stereo)g 19929295 Sergi L6pez. 9 321672 97 66 97 97 Newport The Real The Real The Real The Hills IThe Hills. The Hills IThe Hills Celebrity Rap Superstar MTV Cribs Priciest Pads S 97 66 Harb. World 'PG' World 'PG' World 'PG' 'PG' 600566 'PG' 612301 'PG' 323030 I'PG' 418672 111635 Countdown 71 Naked Science 'G' Air Emergency "Falling Spies, Lies and the Spies, Lies and the Spies, Lies and the Spies, ULies and the 71 7081585 From the Sky 'PG' Superbomb (N) 8138295 Superbomb (N) 8158059 Superbomb (N) 'PG, V Superbomb 7309818 S 6 Movie: **** Movie: *** 'Tobruk" (1967, War) Rock Hudson, Movie: ** "Lone Wolf McQuade" (1983) Chuck Movie: ** "Chain PEX) 62 "Spartacus"73933586 George Peppard. 3922224382 Norris, David Carradine. 0 63798769 Reaction"7948943 43 42 43 43 MadiMoney 1189011 On the Money 5728160 Fast Money 5744108 AmenGreed: Scams, e Bidea With Donny Mad Money 4974491 fNiN 40 29 40,40 Lou Dobbs Tonight B9 The Situation Room Open Mike 176059 Lary King Live 'PG' [ Anderson Cooper 360 'PG' 9 423479 ....... u855189 150011 156295 25 25 World's Wildest Police Cops '14, V Co s'PG, V American. American Bounty Girls Miami (N) Forensic Forensic LA Forensics Hollywood Videos'PG'B 1181479 1196450 98 6419 Jail Jail 5742740 Files'PG' IFiles'14, V '14' Heat (N)'14' 443 I 444 Sp44 ecial Report (Live) 30 The Fox Report With The O'Reilly Factor (Live) Hannity & Colmes (Live) On the Record With Greta The O'Reilly Factor (FNJ 44 37 44 4438450 Shepard Smith 30 cc 1549276 BB 1552740 Van Susteren 2952189 M ,42 41 42 42 ,) Tucker 4241924 Hardball 9 1569030 Countdown With Keith MSNBC News Live Death in the Hollywood MSNBC Special 2958363 (, SNBC ",)"42 ,41 '42 42 Olbermann 1545450 ,1565214 Hills 1568301 S7' 3 2733 i33 porsCenter(Live) College Football Live College Football LSU at Mississippi State. (Live) 9 960672 SportsCenter (Live) c[ 1 33 27 33 3 t 691943 (Live) 963547 C 312059 ESPN2 34 28 34 34 NASCAR Football Live College Football Tulsa at Louisiana-Monroe. (Live) 3 7103905 WNBA Basketball Conference Final Game 1 Teams I. .. Now 0 TBA. (Live) 3f 2426108 FSNFL 3 -Q 3c In Focus on Rays on MLB Baseball Tampa Bay Devil Rays at Baltimore Orioles. From Oriole Park at Basketball FIBAAmericas Championship Teams 35 39 FSN Deck (Live) Camden Yards in Baltimore. (Live) 353634 TBA. From Las Vegas. 633295 67 Greg LPGA Gof S-ate Farm Classic -First Round. From Springfield, I. 9 5390382 Fore Inventors Only Fore Inventors Only 19th Hole GLFm 67 Norman: 8 228943 1758450 3155943 f36 31 Flor3i3da SaFlatwater IFlorida Fishing Report (Live) 825672 Sport Sprtsman Saltwater Fins & Skins Ship Shape Florida Fishing Report Sport 3p. E Fishing Adv. Joumal['G' TV 520740 he PlusCode nun grarh. annel numbers using the Viewfinder. This VCR user's manual. your VCR Plus+ sys- nufacturer. wp.m -RON% m --.l 4wI 400 -"a- -- . d- dub so -uo-4W --M P u a a --- do. - 41. 40-41 p ---.b Nomovll 4000- 41b.- O 49 qb - fte 0 --"po -Nw .w U F bd & 'YvYY' ''A'. '-A o -e .~ ~- U'w - -~ - -~ - - * * U' U' ~ U' - - - -* ~ ~- - U' - ~ m. -U - - S - - a U *0 - o - - S - U' U' -~ - - 0 - ~ - - U' - S - __ - 0 0 - -SQ - U'- ~- - S - ~- ~- ______ U' U' ~ U" - - U'- - = - U- ~ ___ - - "U' ~ U' U' - - ~- U' ~ - ~- ~- '~.. U'- 7F C * * * I *0' * S 0 mm"-w00 0 w- 1M- -am- Ua- - dam lob 4- w 0 - S -0 o - -.. .- 0. q- d- ~- 40 G- 4. - S mob o 0 - -. 0~ 'm~' UfeldlMpt (Copyrighted Material .. - Dt-. --' --.- Syndicated Content3 _- . -z-' Available from Commercial News Providers"' a n 0 4 0 O * _____ ______ U' ~- m - - U' 0' 'U' - U' ~- m-.~ U' - - - ~. - . 0 U'- - U' - - m U' U' SQ -~ - -M -40 oom- 4 MW -ow-glo ~Go- GN - AD 40 wo ..oMM qQ10 ---Mop dMw-ft db 00 qodib ..M W U'M dw oww- demos qw- -w o-v dme oo -- O- nwoo ** -U 0 ---a w-om U' - qw 10 U...- 41b 411000- s s -.o 4b do- dft ftm 4-- MIMI q0- 0. dm-*No-00 S Usome m- mlm 4w m doU -B -~ -40 - U. -..a -.NM UG U S111-f qU 4w 40M- U' d &.--am U' 5. U' ww dm- U --.-w- -00-- "M-qUmw- - m m &--' lo --- Oiq* try o~S "- U -" U- - S - 5 'U U' ~ 'SQ S U' - -~ U. m $I U THURSDAY, AUGUST 30, 2007 SC I...... I~r ENTERTAINMENT o or CImRUS COUNmY (FL) CHRON4E C"Ma Td c 6C THURSDAY, AUGUST 30, 2007 .4 a b 6 0 -of L-ow so quo apI W_.- "Copyrighted Materialt 1 Sndicated Co New " -. Available from Commercial News Providers" Am~a mm 1** ~ w Li - S ~ %.1 -~mbd, - 40 mp d- m0 OP uq 9 k= iq t-i 7r, Lw 6'* 0940 *Opp Of0 I Ilop 4I 4 4 VW. ir .5 .64 * 4 L o w 4 was Q 0 _____w r 'I *' S Tm'~~ 4wI. OW. .: - 4 . "Rush Hour 3" (PG-13) 2 p.m., 4:50 p.m., 7:10 p.m., 9:35 p.m. Digital. "Underdog" (PG) 1 p.m., 4 p.m., 7 p.m., 9:40 p.m. "The Bourne Ultimatum" (PG-13) 1:30 p.m., 4:20 p.m., 7:15 p.m., 10:30 p.m. Digital. Visit for area movie listings and enter- tainment information. Mall 9; 564-6864 "Balls of Fury" (PG-13) 1:15 p.m, 4:10 p.m., 7:55 p.m, 10:05 p.m. "Resurrecting The Champ" (PG-13) 1:35 p.m., 4:30 p.m., 7:50 p.m., 10:20 p.m. Digital. Times subject to change; call ahead. I 6 - as- -om a 'I 1* a a ~ 6' -4 '4 I *00 0. So ego 060 @0 6 0. C e.g ego 0 00 eg. *. 0 0 e 0g.0 -o 0 0 * 0* * 0 * * 0 *0 4b- ON.* w 'a -IM EW Im ~ MP 8m IN r Q . Vaila ,.b - abmm - q-w Odo ao * qlmd 0 40 itVl dn0 40 0 4 dom o oft 04D a 4 Today's MOVIES 12, qo 0 IL damp 0 w 0~ ~m m r SO *e 0 * 0 S.C a dW. op -or iolow QW Mqoc I (~T A'5~T~T~Th~ THURSDAY, AUGUST 30. 2007 7C CrIwrUs CO rlNYv f(FL) CHRONICLE Chron icle To place an ad, call 563-5966 Classifieds In Print and Online All The Time Fax,(32) 63-6651 Tll ree (88) 52-3401 Eail clssiied~chonileolin~co I ebste:wwwchrniceonineco * ~~~~~C Child* 55 S. S S .Care5 g e09S C= GenerEal- -a-t-tm S j"Copyrighted Material t ^ Syndicated Content Available from Commercial News Providers" _ l ATTRACTIVE LADY Caring, sense of humor seeks a gentleman I L casual drinker okay, No drugs. Please Call Dennis, (352) 628-1775 Homosassa Seeking to meet a tall active gentleman in late 60's to enjoy good" times & have fun. No smoking or drinking. Please send letter to: i' Blind Box 1368P 1624 N. Meadowcrest Blvd. Crystal River, FI S 34429 SWCF blonde, loves art & outdoors. Like to find a Christian gentleman friend. 30+ Reply Blind Box 1366-P c/o Citrus L County Chronicle, 106 W. Main St., Inverness, FL 34450 WM BIKER 54, 6'1" 190 LBS. Blonde hair, blue eyes, not bad looking. Seeks attractive biker lady 40 to 54 years old. 100 to 1201bs. (352) 817-5833 ,---_-- RENTAL FINDER 1 y rentalfinder.com $$CASH WE BUY TODAY Cars, Trucks, Vans rt FREE Removal Metal, Junk Vehicles, No title . OK 352-476-4392 Andy Tax Deductible Receiot $$CASH PAID$$ Wanted Vehicles Dead or Alive, Dale's Auto Parts 352-628-4144 TOP DOLLAR I For Junk Cars $ (352) 201-1052 $ $$$ ATTENTION $$$ I WANT YOUR JUNK VEHICLES. CALL LISA Before you call anyone else. (352) 302-2553 CASH PAID. No title ok $$ CASH PAID $$ Having Code Enforcement problems w/ Junk vehicles in your yard? (352) 860-2545 Your World S. Clarsiljed. I I PAID FOR I Unwanted 352-220-0687 BLACK LAB, 10 mos. Female, To Good Home. Great w/kids. Relocating. 352-564-1121 COMMUNITY SERVICE The Path Shelter is available for people who need to serve their community service. (352) 560-6163 or (352) 746-9084 Leave Message DOG Med. Sized Mixed Breed payed, 8mo., wall shots, black & white. Free to good home. (352) 795-1069 *FREE REMOVAL OF. ATV's, bikes, cars, jet skis mowers, golf carts. We sell ATV parts 628-2084 FREE REMOVAL Of unwanted hsehold. & Garage Sale Items. Call (352) 476-8949 Free Removal Scrap Metal, Appl.'s. A/C, Mowers, motors, etc. Brian (352) 302-9480 LOVEABLE 2 yr. Tiger Cat, neutered, healthy, clean, all extras, good home only. Call Kelly (352) 270-9003 $ $ CASH PAID $ $ Junk Cars, Trucks, Vans No Title OK, Call J.W. (352) 228-9645 Black Lab, Male Puppy Missing as of 8/28 red collar w/ paw prints Connell Hgts. area (352) 563-0656 CAT, Black & Grey, neutered male, Harrison Grove, St Hwy 48, Bushnell Rd. (352) 726-1154 Cat, white w/ red markings, near Forest Ridge across from school (352) 527-3556 Lost Black Lab/Mix male, Please Call (352) 746-4408 LOST CAT Brown Tabby w/pink collar "Sophie" Inverness Highlands 352-419-4147 LOST CAT Grey & white male. Declawed Last seen in Pine Ridge (352) 464-1401 cell (352) 464-1399 2 DOGS Golden Retriever/Irish Setter?? Blk & Wht. Pit/Hound Mix. Lecanto area. (352) 628-3623 4 Truck Hold Downs New, (352) 726-9378 Chihuahua, mix puppy, tan & black found on Charles Street, Inverness, (352) 637-2698 Found Dog, large Tan & white, neu- tered, male w/ color, Inglis/on Vicki (352) 400-6268 FOUND SURVEYOR'S TRIPOD on Independence, across from Arlington Intersection, Inverness Call to Identity (352) 637-0560 GOLDEN RETRIEVER Vic. Dunnellon, off 488 8/26 (352) 489-4879 MID-SIZE DOG Female. Near Istachatta. 8/24. Call to ID (352) 799-8868 DIVORCES I BANKRUPTCY I *Name Change S Child Support *Wills I We Come To You 637-4022.795-5999. | RENTAL FINDeER i rentafnder.com SOD SOD SOD BANG'S LANDSCAPING Sod, Trees, Shrubs (352) 341-3032 rescued aet corn View available pets on our webslte or call (352) 795-9550 Need help rehoming a pet call us Adoptive homes available for small dogs Requested donations are tax deductible Pet Adootions Saturday, Sept. 1, 10am 12pmr Brentwood HealthCenter RT. 486, Lecanto a3 1"Sa "Copyrighted Material - i ~Syndicated Content Available from Commercial News Providers" ft% www hofspha.org. or stop by our offices at 1149 N C6nant Ave. Corner of 44 and Conant. Look for the big white building with the bright paw prints. -C= FULL BODY DEEP TISSUE MASSAGE & AROMATHERAPY by Terri (352) 628-1036 HAIRCARE In your home by Licensed Hairdresser Curts/Perms/Wash/Style Call Gall 352-422-6315 a and read 1,000's of Items sold everyday using the Chronicle classified. Call today and we'll help you get rid of your unwanted stuff. (352) 563-5966 (352) 726-1441 4 DAY Carrlbbean Cruise, June 2008 Call Now for Group Rates (352) 476-1973 Chronicle Website home's Wvalue wwwnauDirectory n print and online. Our search engine Will link customers directly to your site. Chronicle Website rectoryIn Print +and online = One Price $51.95 (3 lines of copy for 30 days) Header and Website Address Call Today: (352) 563-5966 CAR SALES wheels.com Free Sample www getfitsample coam NEWSPAPERS onllne.com Real Estate Information CountyHomelnfo.com REAL ESTATE homefront.com RENTALS rentallinder.com Seeking Investors * EnergvStarHomesBv SOUND OFF NOW hushaboom.com YQOUR voice heard NOW HIRING CDA QUALIFIED TEACHERS "ALL ABOUT KIDS PRESCHOOL" (352) 201-2770 ADMIN ASSISTANT Knowledge in: Job track- ing, invoicing & accounts recievable. Quickbooks exp. a plus. Fax resume to 352-344-5336 OFFICE ASSISTANT W/Property Mngmnt duties. 25-30hrs/wk. 352-422-6129 OFFICE PERSON Auto Parts exp. a must. Office exp. necessary. Apply All Prestige Auto (352) 795-7000 SECRETARY Full Time Position for a fast paced Insurance Office. Looking for Someone who has computer skills and knowledge with Spread Sheets. Must be able to multi task and must have Customer Service Skills. Please call Heather at 1-352-726-7722 for Interview or fax resume to 352-726-6813 enaarsoal LPN (3:45pm 12:15am) second shift Third shift l oanto, Fl 34461 To apply via Internet WWW. correctlions CNA's If you are ready to brighten up your career, join our caring, dedicated-231 1/Cell 422-3656 Fast Growing Compounding * Pharmacy seeking Medical Technician Must have 2-4yrs of college or Experience in medical (Including RN/LPN) or scientific field. Will train Salary Range: $12-$15/hr. FL Licensed Pharmacist Part-time 2 to 3 days a week. Will Train. Great Benefits Both Positions: Health Insurance Paid time Off No weekends or holidays Fax Resume to: 352-341-2626 HOME HEALTH AGENCY SEEKING *RN FT/PT Position RN & LPN PER DIEM *PHYSICAL/ OCCUPATIONAL THERAPIST *CNA/HH AIDE Competitive Pay (352) 746-2549 Apply in person @ ADVOCATE HOME HEALTHCARE 2653 N. Lecanto Hwy., Lecanto 34461 OR FAX RESUME TO: (352) 746-2952 Uc# HHA299991842 HOUSEKEEPING FLOOR TECHNICIAN CRHR, a long term. care facility, Is looking for F/T & P/T person. Must have'attention to detail & be at least 18 years of age, ability to lift, carry, push, pull, bend, reach, grasp, & move a minimum of 50 Ibs., walk & stand continuously throughout the work day. Must be able to speak, read, write and understand English. Experience as floor tech and/or use/maintenance of floor care equipment a plus. Must be able to work Independently and as part of a team. Needs patience, tact, enthusiasm, & have a positive attitude toward the elderly and disabled. Crystal River Health and Rehab Center 136 NE 12th Ave. Crystal River, FL 34429 (352) 795-5044 HR/ Connie DFWP/EOE LPN For Dr's ofc. Hoam Sprngs. Gd. sal. & ben, Fax resume to 1-866-277-8462 or call 1-800-573-0123 I"--- ---I LPN/RN 11-7 Shift Looking for Experienced Nurse Leaders to Join our Great Teami We offer excellent S benefits: *'401K/Health/Dental/I Vision *Vacation/Sick Time I Apply in person Arbor Trail Rehab 611 Turner Camp Rd Inverness, FL EOE S--- -- m *AAA*AAAA NOW HIRING Experienced, Caring & Dependable CNA's/HHA's Hourly & Uve-in, Flexible schedules offered. $10.00/hr. CALL LOVING CARE A* A A RN, LPN, CNA, CMA NEEDED ALL STAR A* Professional Staffing Services 352-560-6210 RN/LPN CNA/HHA'S New competitive pay rates. Call Interim Health Care (352) 637-3111 Teaching Is rewarding RN w/BSN or MSN Previous exp. in nursing Instruction. Evening schedule w/some days. Fax Resume to: (352) 245-0276 or Call (352) 245-4119 URGENT CARE/ FAMILY PRACTICE Seeking Exp. Front Office Personnel FT Must be cheerful, good with patients. Hours. 8am 5 pm Call (352) 522-0094 or Fax Resume To: (352) 522-0098 CRT THERAPIST Provides short-term in-home mental health as- sessment and therapeutic svcs. to at-risk families in HemW. MainSLt. Leesburg or online at DFWP/EOE ALL POSITIONS *Drivers *Servers *Cooks *Shift Managers Apply n person at: PIZZA HUT of HOMOSASSA" Cafeteria in Crystal River now hiring CASHIER/PREP Work/serving position. PT 30-35 hrs. Mon-Fri. Must be able to lift 50 lbs. Please fax resume or application Info to 352-563-4646 or e-mail to salesbells catering.com Riverside Crabhouse Now Hiring FOOD & BEVERAGE MGR Apply In Person 5297 S. Cherokee Way, Homosassa or E-MAIL maria@riverside resorts.com SERVERS Needed Please apply at: 505 E Hartford St. Hernando or Call (352) 746-6855 $$ GOT CASH $$ Earn great money by setting appts. for busy local company. Call Steve: 352-628-0187 FURNITURE RETAIL SALES Apply in person Easy Living Furniture 4100W. Gulf to Lk. Hwy., Lecanto Sales Professionals Fast growing National Corporation Is ac- cepting applications from confident sales professionals to add to its staff of account executives. We 'provide a structured, successful sales train- ing program which will aid in taking your sales career to the next level. We also consider entry level sales candidates who survive our Interview process, Call 352-569-9402 for appointment. Realtors Wanted Small productive office. Pleasant working cond., Good commission split In- terviews confidential. (352) 795-9123 AUTO GLASS ,INSTALLER Auto glass installer wanted Company ve- hicle, must have own tools. Excellent pay pro- dram. At least 5 years exp. Call CMM Glass - Corp. 1-866-439-5020 DELIVERY DRIVER Building Supply Co. Looking for exp'd Building Supply Delivery Driver w/Class A or B . CDL. Heavy lifting required. Mon Fri 7AM 5PM Paid vacation, holidays, Insurance & 401 K lic. req'd. Competitive pay. Apply in, person only Mon.-Fri. 8-4. Morgan Electric 967 N. Suncoast Blvd. Crystal River No Phone Calls DFWP HANDYMAN/POOL MECHANIC " Full time, salary, benefits Call between, 10a-4p (352) 344-4861. TRUCK MAINTENANCE & SERVICE For Local Trucking Co. Heavy experience a plus. 6 pm. 4am. Apply In person. See Steve @ SMG TRUCKING 6844 N. Citrus Ave. CRYSTAL RIVER EOE CABLE TV TECHNICIAN Candidate should posses strong technical ability In all areas of CATV. Experience in High Speed Internet and Digital Cable Installation and troubleshooting. On-call duty req. and valid FL drivers license with good driving record. Apply At: DECCA at Oak Run 7ml oft 1-75 on SR 200 Applications Accepted 8am-12noon Mon-Fri, Call for more info(352) 854-6557 DECCA Is a Drug Free Work Place EOE $$ GOT CASH $$ Earn great money by setting appts. for busy local company. Call Steve @ 352-628-0187 AUTOMOTIVE PAINT STORE Inside sales, FT, previous exp. a plus. Inverness. Benefits. (727) 639-4977 DELI PERSON & CASHIER Experienced only. 352-527-9013 EXPERIENCED WRECKER DRIVER Weekends a must. Must live in area. Apply in person at: Ed's Auto & Towing 4610 Florida Ave. Inverness > NO CRYBABIESI F/T MAINTENANCE Apply at Best Western Citrus Hills Lodge No PHONE CALLS!! F/T POOL CLEANING Medical, vac. & benefits avail. (352) 637-1904 Flower Shop Needs DELIVERY DRIVER Must have valid D. L. & good driving record. Flower Time (352) 527-7111 MAINTENANCE Exp. Maintenance person needed, must be hard working dependable and have a valid dri. lic. 40 hr. work wk, benefits, pd. vac. pay based on exp. Apply In Person @ SUN COUNTRY HOMES 1710 S Suncoast Blvd MAINTENANCE Position Part time Candidate must be physically strong hard worker w/ drivers lic. Indoor/ Outdoor work Fax Resume to: 352-795-7879 MAINTENANCE/ HANDYMAN POOL TECH HOUSEKEEPING LAUNDRY PERSON Able to handle multi-task, in upscale Country Club Comm. Apply In Person: 240 W. Fenway Drive Hernando Must have at least 5 Yrs. Recent Exp. In Florida Lawncare Desire to work & valid Dri. Uc. Good starting Pay. Paid Vacations (352) 228-7472 O -- OPPORTUNITIES FOR A NEW CAREER! Stanley Steemer Will train, FT, benefits. Must have FL Driver's lic. and be at least 21yrs of age. Drug Free. Apply at 911 Eden Dr., Inv. P/T SECURITY OFFICERS Class D Security Ucense required. Local. Starting Rate $7.60/hr. 352-726-1551 Ext. 1313, call between 7a-2:30p Mon-Frl. SEWING Some one to help in the manufacture of seat cushions. Minimum skills required. 352-637-0645 Leave message Small Boat Manufacturing Co Inglis Area. Fiberglass lamination, gelcoat & grinding. Exp. pref'd. 352-447-1330 WALLY'S QP Looking For EXPERIENCED AUTO DETAILER Apply In Person: 806 NE US HWY 19 Crystal River camrn extra income after taking course Flexible schedules, convenient locations. Courses start in Sept. Call 877-766-1829 Liberty Tax Service Fee for books. *-i PAYROLL CLERK Process Time/attendance, maintain records for weekly payroll. Previous payroll exp. req'd. Must have knowledge of computers incl. Excel, Word. Resumes: resumes@atlantic net or Box 1365M c/o Citrus Publishing 1624 N Meadowcrest Blvd. Crystal River Fl. 34429 EOE. 6 Station Beauty Salon US Hwy 41 S.. Inverness $25K John Hoffmelster, Coldwell Banker,. Next Generation 352-476-7236/382-2700 Established Lawn Service 23 yrs. 1990 Dump Truck, All lawn equip, make your money back in less 2 than incls. 70 ac- count too Much equip to list. Established 1984 Asking $100k (352) 637-6718 ALL STEEL BUILDINGS 25x25x7 (2:12 Pitch) 1- 9x7 garage door. 2 vents, 4" concrete slab INSTALLED-S15 995 25x30x9 (3:12 Pitch) Roof Overhang 2-9x7 garage doors, 2 vents, entry door, 4" concrete slab INSTALLED- $16495 Many Sizes Avail. We Custom Build We Are The Factory Fl. Engineered Plans Meets or Exceeds Florida Wind Code METAL STRUCTURES LLC.COM 1-866-624-9100 metalstructuresllc corn THuRsDAY, AUGusT 30. 2007 7C DECLASSIFIED 8C TsHURSDAY Ai 1938 GIBSON GUITAR Good Condition. Make me an offer I can't refuse. Nothing under $1,500 consid- ered. (352) 344-5168 ANTIQUE VICTROLA Exc. Working Cond. Includes some records. $300 (352) 628-4210 WANTED: QUALITY ANTIQUE French, German, Bisque Dolls for 9/15 Doll Auction. 637-9588 www. dudleysauctlon.com CITRUS COUNTY (FL) CHRONICLE CLASSIFIED NORMAN ROCKWELL Limited Edition Ridgeway Grandfather Clock w/Westminster Chimes. $1,500 (352) 637-0184 SPOON COLLECTION 1933 Chicago World's Fair w/spoon holder. Will break up or sell for $1500. (352) 860-1649 Collectioprsove Your world first. Every Day Cii.)Ni 1.E 811 MT Ii Q RRIVF R Hot tub 2 yrs.old, soft tub, 4 seater, 110 V, steps & drink holder, hy- dro therapy jets, $1,500. Joe (347) 512-6126 HOT TUB BRAND NEW Loaded Waterfall, led lights, hydro-therapy jets, cup holders, 110V, Balboa digital control system, with 5yr. warranty.$1795 Free delivery & set up. (352) 291-1731 NEVER USEDI SEATS 51 3 hp.., extra jets. Light, lounger. Under warranty. New- $4,395/Sacdfrice $2 195 (352) 287-9266 Over 3 000 Homes and Properties listed at homefront.com IM-1 3-ton A/C $350 (352) 564-0578, 13 SEER, FROM $475. 352-400-4945 Camping gear, 2 tents and 1 camper kitchen, like new, $300. (352) 637-6588 CARRIER HEAT PUMP/AC 212 Ton; New blower mtr. Good Cond. $200 (352) 628-4210 GE Gas Stove self cleaning, natural gas or propane, good shape $40. (352) 476-7556 GE STOVE, elec. white. Exc. cond. Dunnellon. $125. (352) 489-2890 REFRIGERATOR $140 (352) 382-5661 REFRIGERATOR Black & S.S. 25.5 Cu. Ft. Side by Side Whirlpool Gold Conquest w/crushed & cubed ice & water purifica- tion syst. 16 mos. old. Purchased for $1,200/ Sell $800 (352)628-3539 REFRIGERATOR Kenmore 27 cu. ft. Side by Side. White. W/Refreshment door. Water & Ice. $400 (352) 637-6310 Iv. mess. Refrigerator, 25.5 cu.ff. white double door, Icemaker needs work, asking $150 (352) 527-3348 Refrigerator, Whirlpool side by side freezer 25-2/10 cufft., water & Ice on door, built in filtration system. $400. BBQ grill, charbroll, (comm) with side burner, $150. Both exc. cond. (352) 637-6952 TAPPAN GAS STOVE, electronic ignition, perfect cond., $100 (352) 637-4453 Washer & Dryer $265/ set. Great cond. Best Guarant, Free delivery & setup (352) 835-1175 Antique & Collect. AUCTION SAT. SEPT. 1 Preview: Noon SALE: 5 PM Super Labor Day Weekend Auction 4000 S. Hwy. 41 INVERNESS 100+pcs. antique furn., sterling, art, Jewelry, vintage light- Ing. oriental, tin toys. Huge Sale- see web: dudleysauctlon.com (352) 637-9588 AB1667 AU2246 12%BP 2%Disc ca/ck -A AIR COMPRESSOR 4000 Pro $125; RYOBI 10" TABLE SAW on Stand. 3 mos. old. $135 (352) 621-0300 Glass', Cin\, Your world lfir',5. EA trq DasA C I RON I .6ta CRAFTSMAN 81/4" Radial Saw + 3 DRAWER Cabinet Exc. Cond. $400 (352) 637-2838 HITACHI Miter saw, like new, $100; (352) 726-9183 27" RCA Color TV, older, accepts cable. $70; VCR, Magnavox, $45. Both work. (352) 746-9076 52" HD RCA TV, with en- tertainment center and DVD player. $600/OBO COFFEE TBL & 2 END TBLS. It. oak $40. (352) 527-4122 SONY 1000 WATT DVD HOME THEATRE SYSTEM In a sealed box. $200 (352) 382-1191 FIREPLACE New Adobolite Chimenea type w/18' chimney pipe kit. Use insider orn lanai. Paid $4500 will sell for $2800. 352-344-4811 2 CORNER COMPUTER STATIONS Large $55. Small $30. Never used. (352) 637-1894 15" LCD MONITOR NEC, built in stereo speakers & 4 port USB Hub, $99. (352) 795-0098, days (352) 795-2820, eve Citrus County Computer Doctors Repairs In-Home or Pick-Up, Delivery, avail. Free quote, 344-4839 Computer Pro, Lw FIt Rt. In-House Networking, virus, Spyware & morel 352-794-3114/586-7799 DIESTLER COMPUTERS Internet service, New & Used systems, parts & upgrades. Visa/ MCard 637-5469 hf GATEWAY PENTIUM III windows 2000/office 17" monitor, keyboard and mouse $150. (352) 228-2745 FORKLIFT Air Tire, Diesel. In Homosassa. $4,500. Phone (813) 478-5270 MASSEY FERGUSON 1540, 2007,Tractor & Box Blade w/top tilt. < than 200 hrs. $15,900 (352) 795-9010 MF40 LOADER TRACTOR W/ BOXBLADE $4500. (352) 726-1473 8 PC. PATIO SET w/Tea Cart $550 (352) 613-4891 OVAL GLASSTOP TABLE W/2 swivel/rocker chairs, 2 reg. chairs, new cond. Paid $1050 Asking $500. (352) AI 1..4llflA 6A, A.1jA1I 3 Pc Sectional w/ 4 recliners, abstract, beige/green/brown print. $800. (352) 465-6002 4 Pc. Bedroom Set Pickled white, oak queen/dbl $250. 9 Pc. Bedroom Uttle girls, painted incl. bed bread & curtains - $175. (352) 637-6046 A/C Tune up w/ Free permanent filter + Termite/Pest Control Insp. Uc & Boned Only $44.95 for both. (352) 628-5700 caco36870 ----- - I ADVERTISE YOUR BUSINESS IN THE SERVICE DIRECTORY TODAY! $$$$$$$$$$$$$$$$$$ Its Less than Pennies per day per household. $$ $$$$$$$$$$$$$$ IF WE DON'T HAVE YOUR BUSINESS CATEGORY. JUST ASK. WE CAN GET IT FOR YOUII! CALL TODAY (352) 563-5966 "DEBRIS HAULING" & Misc. Clean-Up, Tree Service & Demos 352.447-3713/232-2898 55' BUCKET TRUCK 20% off mention of this ad. Lic. & Ins. (352) 344-2696 A FORDABLE, I HAULING CLEANUP, I I PROMPT SERVICE Trash. Trees, Brush, Appl. Furn, Const, I I Debris & Garages 352-697-1126 16--- ml All Tractor/Dirt Service Land Clear, Tree Serv., Bushhog,'Driveways & Hauling 302-6955 DOUBLE J STUMP GRINDING, Mowing, Hauling,Cleanup, Mulch, Dirt. 302-8852 D's Landscape & Expert Tree Personalized design. Stump Grinding & Bobcat work. Fill/rock & Sod: 352-563-0272 FREE CONSULTATION To hurricane ready your trees. Prof. Arborist, Action Tree 726-9724 Joseys Landscaping Lawns, Trees, Pavers Clean-up, Sod, dump truck. (352) 556-8553 R WRIGHT TREE SERVICE, tree removal, stump grind, trim, Ins.& Uc #0256879 352-341-6827 A TREE SURGEON Uc. & Computer Pro, Lw Fit Rt. In-House Networking, virus, Spyware & more! 352-794-3114/586-7799 Carpet :C= afff- *'Chris Satchell Painting & Wallcovering.AII work fully coated. 30 yrs. Exp. Exc. Ref. Ins. ULc#001721 352-795-6533/464-1397 smolll 24/7 Lic3008 352-341-1440 All Phaze Construction Quality painting & re- pairs. Faux fin. #0255709 352-586-1026637-3632lck Uc./Ins. (352) 726-9998 POPCORN CEILINGS PAINTED Free Estimates (800) 942-3738 RUDY'S PAINTING* Int./Ext., Free Estimate Pressure Washing, Lic. 24/7, (352) 476-9013 Willlie's Painting & Pressure Cleaning Great RatesI Uc. & Ins. 527-9088 or 634-2407 Affordable Boat Maint. & Repair, Mechanical, Electrical, Custom Rig. John (352) 746-4521 DOCKS, SEAWALLS, Boat Lifts, Boat Houses, New, Re decks, Repair & Styrofoam Replace. Lic.CBC060275. Ins. (352) 302-1236 10-- TOP HAT AIRPORT SERV. .- Aug-Sept. Special Tampa Int. $75 max. 2 ,people. (352) 628-4927 BATHTUB REGLAZING Old tubs & ugly ceramic tile is restored to new cond. All colors FREE ESTIMATES FREE P.U. & DELIVERY Furniture & Cornices 628-5595 COMPASSIONATE PERSONAL CAREGIVER With References. Call (352) 613-0078 -Windows & Doors -Storm Shutters -Board-Up Service -Resident/Commercial CRC 1326431 (352) 746-9613 -W CA v nrls atcnell painting & Wallcoverlng.AII work fully coated. 30 yrs. Exp. Exc. Ref. Ins. Llc#001721 352-795-6533/464-1397 Hauter & Clark Handyman & More Home, Office & Floor Cleaning, Lawn Serv. Pressure Washing, (352) 860-0911 EXP. HOUSEKEEPER Call for est. Will clean any day of wk. Monica 352-795-7905 Spiffy Window Cleaners Special Introductory offer 20% Discount lIc. & Ins. (352) 503-3558 * The Window Man * Beats any Est. by 10% Com./resld., Uc. & Ins. OJUNTE RTOS Re-laminate or replace Additions-Kitchens Bathrooms Decks, DJM Constructors Inc. Uc. & Ins. CBC 058484- (352) 344-1620 All Home Improvement With Craftmen Builders Remodeling, Garages, Decks, Frame & Trim No Job Too Smalli 427-2766 #CRC057657 ROGERS Construction New Homes,Addiltons Florida Rooms. 637-4373 CRC1326872 FL RESCREEN 352-563-0104/257-1011 I panel or camp cage Family owned & oper'd Screen rms,Carports, vinyl & acrylic windows, roof overs & storm panels, garage screen doors, siding, soffit fascia, LUc#2708 (352) 628-0562 CALL STELLAR BLUE for all Int/Ext. painting needs Lc. & Ins FREE EST (352) 586-2996 Ultra Seal Coatings Specializing in roof and concrete sealing Vinyl & Stucco Sealing Pressure Washing Designer Driveways Pool Decks Summer Special Roof cleaned 145. 1... 352-628-1027 Boulerle ei-g All of Citrus County Bouierice~s & SUPPLY INC. Family Owned & Operated NEW ROOFS REROOFS REPAIRS FREE ESTIMATES I . .. . $ 100 OFF COPLT ROOFI A# 1 L&L HOUSEHOLD REPAIRS & PAINTING No lob too small[ 24/7 Uc3008 352-341-1440. Uic./Ins. 341-3300 ROLAND'S * PRESSURE CLEANING Mobiles, houses & roofs Driveways w/surface cleaner. No streaks 24 yrs. Uc. 352-726-3878 Willle's Painting & Pressure Cleaning #1 A+TECHNOLOGIES All home repairs. Also Phone, Cable, Lan & Plasma TV's Installed. Pressure wash & Gutters Lic.5863 (352) 746-0141 1 Call does it AII llNoib too sm. SERV All types of fencing, General home repairs, Int/Ext. painting FREE Est., 10% off any Job. lIc # 99990257151 & Ins. (352) 201-0658 A# 1 L&L HOUSEHOLD REPAIRS & PAINTING No job too smallI 24/7 Uc3008 352-341-1440 SAAFFORDABLE, I HAULING CLEANUP, I PROMPT SERVICE STrash, Trees, Brush Appl. Furn, Const, I SDebris & Garages | 352-697-1126 --m-- m m l ALL AMERICAN HANDYMAN Free Est. Affordable & Reliable Llc.34770 (352)427-2588 Handyman Wayne Lic 34151, 352-795-9708 Cell 352-257-3514 NATURE COAST HOME REPAIR & MAINT. INC. Offering a full range of services. Llc.2776/lns. (352) 628-4282 Visa/MC STAYLER AC & HEATING, INC. Uc. & Ins. CACO 58704 352-628-6300 Poe's Sewer & Drain Cleaning, We unstop toilets, sinks, bathtubs, 24/hr serv 352-302-7189 "DEBRIS HAULING" & Misc. Clean-Up, Tree Service & Demos 352.447-3713/232-2898 r AFFORDABLE, I HAULING CLEANUP, I PROMPT SERVICE i Trash, Trees, Brush, Appl. Furn, Const, I I Debris & Garages I 352-697-1126 A-I Hauling cleanup, garage clean outs, trash turn. & apple. Misc. Mark (352) 344-2094 All of Citrus Hauling/ Moving Items delivered, clean ups.Everything from A to Z 628-6790 C.J.'S TRUCK/TRAILERS Furn., appl, trash, brush, Low $$$/Professional Prompt 7 day service 726-2264/201-1422 Furn. Moving / Hauling Dependable & Exp. CALL LARRY 352-270-3589, 726-7022 WE MOVE SHEDS 266-5903 All kinds of fences JAMES LYNCH FENCE Free estimates. (352) 527-3431 ROCKY'S FENCING Working In Citrus County for 25 yrs. Free Estimate, Lic. & Ins., 352 422-7279 YARD VAC Dethatching Lawns Vacuum Leaves & Thatch, Tree Trimming (352) 637-3810 or (352) 287-0393 FREE ESTIMATE Licensed & Insured 25 Years In County DOTSON Construction Free Est., Res./Comm. 25 yrs. in Central FL. Our FENCES BY DALLAS own crews! Specializing Lic./Ins (352) 795-1110 In additions, flaming, 3rd GENERATION SERV trim, & decks. All types of fencing, Uc. #CRC1326910 General home repairs, (352) 726-1708 Int/Ext. painting FREEs .F t.RN, 10% off any job. lic it BA # 99990257151 & Ins. (352) 201-0658Bh - A 5 STAR COMPANY Go Owens Fencing All types.Free estimates Comm/Res. 628-4002 BARNYARD II FENCING We do It ALLI Big or Sm.I Serving Citrus Co. Since Additions, BA & Kitch., 1973. Free Estimates Drywall,Crown molding, (352) 726-9260 Demo. CRC1326431 (362) 726-9260 (352) 746-9613 GARY JOE ROSEBERRY Fence Company Specializing in vinyl (352) 621-0929 CERAMIC TILE INSTALLER Bathroom remodeling, i Roofing 1 handicap bathrooms. Lic/Ins. #2441 795-7241 #1 in Service CUTTING EDGE Ceramic Hise Roofing Tile. Lic. #2713, Insured. New cost. reroofs & Showers Firs Counters p.re pr ... l...k Etc. (352) 422-2019 (352) 344-2442 John Gordon Roofing Reas. Rates. Free est. Proud to Serve You. ccc 1325492. ROCKMONSTERS, INC. 795-7003/800-233-5358 St. Cert. Metal/Drywall RE-ROOFS & REPAIRS Contractor. Repairs, Reasonable Rates!! Texture, Additions, Exp'd, Lic. CCC1327843 Homeowners, Builders Erik (352) 628-2557 Free est. (352) 220-9016 I Lic.#SCC131149747 Wall & Ceiling Repairs Drywall, Texturing, Tile Painting, Framing. 35yrs 344-1952 CBC058263 All Tractor/Dirt Service 92CBC058263 Land Clear, Tree Serv., Bushhog, Driveways & Hauling 302-6955 Concrete Slabs, Pavers Remove & Haul Debris FILL, ROCK, CLAY, ETC. Demolit. 352-746-9613 All types of Dirt Service Lic# CRC1326431 Call Mike 352-564-1411 CONCRETE WORK. Mobile 239-470-0572 Sidewalks, Driveways AFFORDABLE Top soil, Patios, slabs. Free est. fill, mulch,rock. Tractor Lic. 2000. Ins. 795-4798 work. No job too small. ROB'S MASONRY 352-302-7325 341-2019 & CONCRETE Slabs, ALL AROUND TRACTOR driveways & tear outs Landclearing, Hauling, Lic.1476 726-6554 Site Prep, Driveways. Lic. & Ins. 795-5755 All Tractor/Dirt Service Land Clear, Tree Serv., Bushhog, Driveways Additions-Kitchens & Hauling 302-6955 Bathrooms Decks, FLIPS TRUCK & TRACTOR, Woodfloors Ceramic Landclearing, Truck & DJM Constructors Inc. Tractor work. House Lic. & Ins. CBC 058484 Pads, Rock, Sand, Clay, (352) 344-1620 Mulch & Topsoil. ALL AMERICAN (352) 382-2253 HANDYMAN Free Est. Affordable & Reliable Lic.34770 (352)427-2588 HARBOR KEY DEV. LLC Lic. CGC 004432 Ins Custom Luxury Homes ALL AROUND TRACTOR Add-on & Remodeling Landcleafing, Hauling, Res. & Commercial Site Prep, Driveways. Industrial Warehouse Lic. & Ins. 795-5755 New Steel Buildings All Tractor/Dirt Service Steel BIdg. Repairs Land Clear, Tree Serv,, Thermal Roof Coatings Bushhog, Driveways Area Rep (352)628-4391 & Hauling 302-6955 New & Re-Roofs Flat & Low Pitch Roof Repairs Commercial Residential Shingle Metal Built Up Roof Torchdown Shakes C. - XF ast sa I -t is or (352) 628-2557 Lucksroof.com Roof Inspections Available Drug Free Workplace State Certified Lic. #CCC1327843 M.H. Demolition & Salvage. Land clearing, tree brush removal (352) 634-0329 *SUNSHINE OF CITRUS* Clearing/Stone Drvwys /Top Soil/ Fill Dirt. (352) 302-6436 YOU ARE MY SUNSHINE TRACTOR SERVICE Tree/Debris Removal Driveways/Demolition Line Rock/Fill Dirt Sr. Disc. 352-302-4686 TURTLE ACRES Bushhog, Grading, Stumpgrinding, Removal No job too small. (352) 422-2114 D's Landscape & Expert Tree Svce Personalized design. Stump Grinding & Bobcat work. Fill/rock & Sod: 352-563-0272 Joseys Landscaping Lawns, Trees. Pavers Clean-up, Sod, dump truck. (352) 556-8553 SOD SOD SOD* BANG'S LANDSCAPING Sod, Trees, Shrubs (352) 341-3032 "El Cheapo" cuts $10 up Beat any Price. We do it All. Call 352-563-9824 Or 352-228-7320 A TROPICAL LAWN Family owned & oper. Satisfaction Guaran. 352-257-9132/257-1930 C & R LANDSCAPING Lawn Maintenance clean ups Mulching, We Show Up 352-503-5295, 503-5082 Coon, Robert Lawn Service FREE ESTIMATES (352) 563-0376 LAWN SERVICE We do re-sodding and patching. Free Estimate 795-4798. Steve's Lawn Service Mowing & Trimming Clean up, Lic. & Ins. (352) 797-3166 POOL BOY SERVICES Aqua guard, Epoxy, Coatings, Acrylic Decking. Uc./Ins. 352-464-3967 POOL LINERSI * A 15 Yrs. Exp. Call for free estimate *(352) 591-3641 I POOL REPAIRS? Comm. & Res., & Leak detection, lic. 2819, 352-503-3778, 302-6060 Areq Rep (352)628-4391 METAL BUILDINGS Pump houses, carports, etc. Very reasonable! Fred (352) 464-3146 WE MOVE SHEDS 352-637-6607 MR CITRUS COUNTY REALTY ALAN NUSSO 3.9% Listings INVESTORS BUYERS AGENT COMMERCIAL SALES (352) 422-6956 ANUSSO.COM 0 RAINDANCER 0 6" Seamless Gutter Best Job Availablell Lic. & Ins. 352-860-0714 1=.=-.---=1 ALL EXTERIOR ALUMINUM Quality Price! S6" Seamless Gutters Lic & Ins 621-0881 MUSIC TEACHER VIOUN Base, Guitar. Elec. Guitar, Drums. Wed- dings 352-422-5291 NEED A NEW DOOR? Pre-Hung Door units New Const. or remod. ENTRY POINT by Perry's Lic. 2598(352)726-6125 END OF SUMMER SPECIAL ANY ROOF CLEANED Upto $30 3,000 sq ft Suncoast --Exterior Restoration Service Inc. 877-601-5050 352-489-5265 CC 0 U N T C' NIC .9 .1 Services for People Who Want Results In Print and Online Daily - I^ r' ii i i i i i i i_______ 71 18 (352) 628-5079 (352) 628-7445 w I ALUMINUM PI :1 N CITRUS COUNTY (FL) CHRONICLE ^^ "Copyrighted Material SyndicatedContent Available from Commercial News Providers" \ "s-NW OEMam4fw- d 4 4 9 PC. LIVING RM. SET Good Cond. $250; YOUTH BED White Heavy Plastic. Good Cond. $40 (352) 628-4210 9 PC. WHITE WICKER BEDROOM SET Exc. Cond. $675 (352) 634-0977 PRE OWNED FURNITURE Unbeatable Prices NU 2 U FURNITURE Homosassa 621-7788 All Leather Sofa, as new, top quality, chestnut brown, basset, 89" Long, perf. cond. for office or home must sell $1,250. obo (352) 212-3508 Antique Armoire unique carved, Rosewood? w/3 doors center door has original glass excel cond. $1,500. (352) 344-4811 Antiques Collectibles & Estate Auction 1st & 3rd Tues. 6pm (previews 10-5:45) Starting Sept. 4th Huge Furniture Liquidation Fenton/Dep/EAPG Glass, China, Antiques Art Collectibles, Silver, Coins + 2much21ist Details on Web or call PROF APP & LIQ 10%bp 6% tax MC/VI/Cash/App Ck AU1593/AB1131 811 HWY 19/CR RIVER charliefudge com 352-795-2061 BEDROOM SET, KING SZ. Very nice complete set, Inc. exc. mattress' & box springs. $900 PATIO TABLE, $35 (352) 628-4031 BEDS *: BEDS BEDS The factory outlet store! For TOP National Brands Fr.5(%/70% off Retail *Tv't$1194 Full-$159 Queen $199 / King $249 Please call 795-6006 BRASS HEADBOARD Polished Brass King Size- $60 (352) 628-1669 BROYHILL SOFA & CHAIR $350 (352) 527-4910 China Cabinet, - Thomasville, lighted,, cherry wood, great cond. $700. Curio Cab. lighted, cherry wood, great cond. $200. (352) 628-5949 CITRUS HOME DECOR @ Homosassa Regional, Consianment, like new furniture (352) 621-3326 COUCH & LOVESEAT navy blue leather, wall hugger w/2 recliners on each. $600; RECLINER Maroon, wall hugger, $100. (352) 527-4122 CURIO CABINET $250 HIDE-A BED SOFA Floral Print, Exc. Cond. $175(352) 613-4891 DINETTE SET French Prov. Antique wht. 48" Round table, w 24" leaf pedestal table, 4 chairs like new $195. obo 352-382-7865, DINING ROOM SET Table w/6 chairs & Ig. China Hutch $500; BREAKFAST DINETTE w/4 Rocker Chairs $75 (352)637-0184, ENTERTAINMENT CENTER for Big Scrn TV 6ft. H $200. DINING RM. 8 up- holstered chairs, table extends to 7' $250. both Wht wash wood. (352) 527-9876 Entertainment Center Ought wood. 102"L Glass Doors on Side Must Seel $395 Negotiable (352) 746-5168 ENTERTAINMENT CENTER Wood & Glass w/bookshelves. Asking $150 (352) 628-5011 Ethan Allen Dream Rocker, overstuffed cream, brocade, so comfortable, $950. new. sacrifice $200.. (352) 634-0196 FURNITURE Leather reclining taupe loveseat $250, Iron King head & foot board $300 352-586-4650 GIRL'S DRESSER & DESK, $100 both, Multi Color Comforter for Full size girl's bed, & purple bed skirt. $50. (352) 341-1963 Restonic, (Patricia model) memory foam mattress, boxsprings & frame, exc. cond $650 obo (352) 341-6920 Large burgundy sofa & matching chair, $400 Also country style oak dining table, 6 chairs, like new, Orig. $1,900 sell for $800 352-560-3743 Leather Recllner Chair, deep blue, excel. cond. 6 mos. old $850. obo, Must Sell. (352) 212-3508 LG. COUCH Multi-Colored Good Cond. $75 (352) 621-7916 LIVING ROOM SET Cloth Sofa, 3 tables (Coffee, sofa table, & end table- white wash) $400obo (352) 419-0125 LIVING ROOM SET Gorgeous Like New Coordinating SOFA, Uphol. CHAIR & FLOOR LAMP. $300/all Or Split. (352)746-3277 Liviving Room. Set sofa, chair, 2 end tables, 1 coffee table, good cond. $300. (352) 746-7098 Mattress-King Spring-Air, deluxe pillow top, gently used, $400. obo (352) 382-5030 PATIO SET 45" glasstop table w/4 chairs, 2 years old. Exc. cond. $85. 352-560-7433 Preowned Mattress Sets from Twin $30; Full $40 Qn $50; Kg $75. 628-0808 QUEEN SIZE BED Brand New Box & Springs "Pillow-Top" w/lighted hdbrd $700 (352) 795-2754 r RENTAL FINDER rentalfinder com L --. ROLL TOP DESK 28"Wx45"H, 3 drawers, good cond. $85. (352) 382-4651 Single Platform Bed $50. Air Hockey Table $150 (352) 637-6046 Solid Wood Ashley Coffee & End Tables, like new, $350. (352) 270-3573 Total Living Rm. couch/sofa bed, loveseat, 2 lamps 3 ta- bles, like new $400. obo (352) 726-2428 CHAR-GRILL SMOKER W/COVER $100 (352) 613-4891 Craftsman 15V2 HP Riding Mower 46" cut, starts & runs good. $350. (352) 613-4702 Craftsman Riding Mower 42" 16 H, B & S, $450.John Deere, 42" $450. (352) 362-7832 *FREE REMOVAL OF. ATV's, bikes, cars, Jet skis mowers, golf carts. We sell ATV parts 628-2084 Mower & Equipment Repair Quick Service, Pick up & Delivery, Don Mead 400-1483 -U MULCH 5-6 yd. loads. $95 Delivered anywhere Citrus Co. Also gravel hauled, $75 + Materials. 352-563-9979/400-0150 CITRUS SPRINGS Inside Sale Fri. 9-3 Entrtnmnt cntr. Sailing Shp. Model over 3' wide Dishes, Lamps, etc. 352-465-1863 for direc. CRYSTAL RIVER Thurs. Fri. & Sat., 8a-5p Hs. Hid, baby, clothing, auto, glasswre collect., something for everyone 834 N. Pompeo Ave. INVERNESS Fri. 31st, Sat.lst, 8a-2p Something for Everyone 9435 E. NEWMAN DRIVE INVERNESS Garage Sale. Fri. Sat. Sun. Mon. 8am-3pm Rain/Shine, Indoors. Tools, Pwr/hand; furniture, household; tapes & books 705 Champlain Ave. INVERNESS Huge moving sale All goes, Thurs. Fri. Sat. 1105 Woodcrest Ave. Lots of furn., computer, house- hold, clothes, tools, wnrk hanc.h, misc. BRIDAL GOWN BRAND NEW Never worn, Mori Lee SCollections, wht. sz 18 Inc. headpiece, $1500/ obo. (352) 464-0619 280' CHAIN LINK FENCE Post & Gates. Cash & Carry $750. (352) 527-4910 AIRLESS PAINT SPRAYER SprayTech 1620. Like New! $190; FRIGIDAIRE WASHER Commercial, Coin Operated. $300 (352) 302-9951 Approx 140 COOK- BOOKS, $100. CRAFT PATTERNS & BOOKS $50. FOR SALE. CALL (352) 746-6687 or 302-1449 BEAUTIFUL GARDEN TUB complete with faucets and base, sacrifice, $150. (352) 637-5656 (352) 201-0696 Carpet, Heavy Cut Pile Used, In great cond. Beige. 33sq. yds. Installation avail. $195. (352) 341-4449 CHILD'S PLAYHOUSE 5x7, NEW, WOOD Scandinavian. Loft, dutch door, Scrn. windows. $400 (352) 522-0580 BROTHERS 1227 fax machine, $75 (352) 527-3348 Christmas dinnerware, service for 8,.In box, never used, $100 Train phone, whistles like train, $50 (352) 527-3348 FRIDGE Clean.& Cold $60; CORNER Entertainment Center Drk. Wood $30 (352) 634-0893 METAL DETECTOR Garrett GTAX 1000 Top of the Llnel Detects all metals & more. $300 (352) 527-9498 OAK PEDESTAL DINETTE W/4 Windsor Chairs, $250; TOYOTA TACOMA TOOLBOX, New $125. 352-860-0018 or 352-634-0425, Iv. msg. OLDER RECORDS 40'S -80'S $1/ea. or all for $85. 8MM MOVIE CAMERA w/case, collectors item. $20. (352) 746-9076 Pine Dinette Set. w/4 Chairs $100. 27" Magn0avox TV. $50. (352) 270-3641 PRE LABOR DAY SALE THE BATTERY MEDICS Golf cart battery sets 6V &8V $200 Reg $245. Incl. del installation & 1 yr Free Replacement Warranty Contact Mark @ 727-375-6111 Racing Go Cart, many extras, $900. Ford 306 Cyl., $400. Trailer Axles. Chevrolet Reese Hitch (352) 302-1781 RADIO CONTROLLED HELICOPTER Comes w/radlo & instruction book. $750 (352) 560-4289 SOD. A4, VARIETIES Bahla,$80 pallet, St Augustine, $150 pallet. Install & Del. Avail. 352-302-3363 Stainless Steel KITCHEN ISLAND on casters. $300; CRAFTSMAN POWER WASHER 5.5 HP $150 S SFamily/Youth Events Land, Storage Racks, Containers. Folding Tables. Event Tents, Bus, SBox Truck. Please call: Brian (352) 220-0576 TOSHIBA PDR 3310 DIGITAL CAMERA 3.2 rp, 3X Zoom. Movie function avail. All Accessories. $75 Orig. Owner 527-9860 COPIER, & MISC. ITEMS Details; (352) 382-7354 ELECTRIC WHEELCHAIR Incl. battery & charger, $550. GEL MATTRESS, hospital size. $100. (352) 628-1408 BUYING US COINS Beating all Written offense. Top $$$ Paid (352) 228-7676 Lowery PIano 1964, w/ Dehumidifier,. med. wood tone; storage bench incl, good cond. $650. obo (352) 621-5588. PIANO FOR SALE Beautiful high back antique piano. Lovely tone. $400. Call (352)503-3139 Pro-Form 515 S, Crosswalk Tread mill, Like new. $500. (321) 273-0412 TOTAL GYM Home workout gym $150 (352) 726-9183 FRANCHI Black LAW 12 Shotgun $425; FRANCHI SemI Auto . 12 ga. Shotgun $375 (352) 697-1200 -iSport i 4blaHHR^ *FREE REMOVAL OF. ATV's, bikes, cars, jet skis mowers, golf carts, We sell ATV parts 628-2084 GLOCK Model 22 40 Caliber Pistol $475 (352) 697-1200 GOLF BAGS (2) 1BLK. Leather, 1 Fabric. Exc. cond. $25 (352) 586-9222 PRE LABOR DAY SALE THE BATTERY MEDICS Golf cart battery sets 6V &8V $200 Reg $245 Incl. del Installation & 1 yr Free Replacement Warranty Contact Mark @ 727-375-6111 YAMAHA '97 Gas Golf Cart, 4strk. runs great $1200. 352-795-4770 6 X 12 TRAILER w/sides. Good Cond. $425 OBO (352) 302-9951 4X8 '05 UTILITY WORK. TRAILER, all metal, w/HD Werner Ladders, all in exc. cond. $575. (352) 726-3010 6'X1O' HEAVY DUTY UTILITY TRAILER '04 35001b axle Good condition $625. (352) 422-0201 UTILITY TRAILER 4 x 6 w/gate, like new. $375 firm. days (352) 201-2798 after 5pm 344-4131 Utility Trailer 4X10, good tires, new lights. Asking $250. UTILITY T7R9AI Certified Bassett Crib, beautiful, white wood, sleigh style, practically new used 2 times, crib mattress free w/ crib $200. Also Amy Coe vintage girl bedding $35. (352) 634-0196 BUYING US COINS Beating all Written offers. Top $$$$ Paid (352) 228-7676 -gCT Replace Your Home Nowl We pay CASH for your old home. Call NOWI(727) 967-4230 WANTED: QUALITY ANTIQUE French, German, Bisque Dolls for Sept. 15 Doll Auction. Call 637-9588 ASAP For Info www. A, Julleauin.frnn .rnm 1 yellow female, Health Certs & shots $250. .352-422-4675 AKC REG. MINI SCHNAUZER 9wks. old female. Salt/pepper. $400 (352) 228-0282 DACHSHUNDS Mini- Designer Pups 8 wks,, AKC, H/C, Multi- Colors, $350 (352) 228-1906 IRISH SETTER PUP AKC, 1 male left, beautiful, love children. HC. First $275. (352) 726-0133 LAB PUPPIES, Registered Choc. & Black. Health Cert. & Shots. Parents on Premises $300 (352) 746-0221 LOSA/PIEAK POO PUPPIES Born July 1st. Parents on premises. Adorable Call Pat (352) 489-4465 ApartdmentforRent $302/Mo! 5BR/2BA HUD Home! (5% down 20 years ( 8% apr) More Homes Available from $199/ Mo! For listings call (800)366-9783 Ext 5669, BusinessOpportunities A.LL ( ASII C.ND1D ROUTEi DoI '.u amrn 1,iu day? 30 Machines, Free Catntly All fer $9,995. (888)629.9968 BO2000033. CALL US: We will not. be undersold! I he demand for children's nouoonan lk rrntals is HJUGE! Exclusive territory 23K req'd Go to wwamantinflateas.coi or call (866)711-JUMP for more details. Only serious candidates will be consid- ered. FRANCHISE OPPORTUNITY. Fastest growing Tax -l -,i .t, it Ilj ri)!, lutdu,hL.-, w.tl Cars For Sale I'Pult Impuunid romi NAlr't lio .du t i0 1 Stn ' 92 Nissan Maxinma Direct T'rallers: 125 in stock; Enclosed 6xt2$41895, 7xl6-M$3195, 8x20o$4495, 8x280$5395; 10-Ton Gooseneck Equipment 8x254$5895, 8x30=$6495, 8x40-$8995; Dumps 6x10.03295, 7x14,$4995, All types trailers avail- able, Full Service, EZ Financing. Call (866)687- 4322. Hell Wantled DRIVERS: CALL TODAY! Great Bonus Oppor- tunity! 36-43cpm/$S.20pim SO Lease NEW Trucks CDL-A + 3 rnos OTR (800)635-8669. International Cultural Exchange Represen- tative: Earn supplemental income placing and supervising high school exchange students. Volun- teer host families also needed. Promote world peace (866)GO-AFICE or wvw.aficepoJ Driver-BYNUM TRANSPORT- needs qualified drivers for Central Florida- Local & National OTR positions. Food grade tanker, no hazrmat, no pumps, great benefits, competitive pay, new equipment. (866)GO-BYNUM. Need 2 years experience.n. Drivers Regional Auto Transport S11004/wk 100% Co, Paid Benefits. Paid Training! I yr, OTR req'd. Call John @ Waggoners (912)571-9668. www heartlandcxprcs. com, Earn Up to $550 WEEKLY Helping the govern- ment PT' No Experience, Call Today!! (800)488- 2921 Ask for Department LS. CLASSIFIED MALTI-POO tiny little furballs, sweet & love able, home raised, HC, 1st shot, $350/400 (352) 564-2775 MASTIFF, English Mate, AKC, 15 mos. Big Boned Beautyl Pick of the litter MUSTSELLI $800 (352) 621-0848 MINIATURE PONY Part ARABIAN, mare,. 7mo. old. very gentle. & sweet $450. obo (352) 795-7513 PUG PUPPIES AKC & CKC Cert., Health Cert. 1 male, 1 female. Starting @ $500 (352) 464-1109 ROTTWEILER Male, 14 mos. AKC, in tact, beautiful dog. Pick of litter. MUST.SELLI $500 (352) 621-0848 15 YR. OLD TENN. WALKER MARE Very dark Bay, $600/ (352) 628-3456 PIGS FOR SALE 352-503-3228 3 mo. old Boar female goats, pure bred, no papers. 2-yr old Black male Jerrsy Wooly, $20. Red female rex rabbit, $10. (352) 563-1643, leave message CR/HERNANDO 2/1 CH/A, $400-$500 1st, last, sec. No pets (352) 564-0578 CRYSTAL RIVER 2/1 Scrn prch. $475; NO PETSII (352) 563-2293 DUNNELLON/488 L 2/2 Extra Cleani $550/mo. No Pets, (352) 795-6970 East Lecanto 2/1 $500. mo. 1st, Ist. sec. no pets 352-634-5581 HERNANDO '07, DW, 3/2, carport, fenced, yd. maint. incl. no pets/smoking, $735. mo. + $1,000 sec. (352) 344-3864 HOMOSASSA 2/1.5 Private lot. No pets. $525/mo + 1stla, sec (352) 628-5696 HOMOSASSA 3/2 1 '/ Ac, FP, dishwasher, new apple. $600/mo. Avail. 9/1 727-858-5889 INGLIS Homes Available from $375. Northwood Est. (352) 447-2759 INVERNESS 2/1 On Water, 5 mi. from town $500. 1st last $200 sec. credit check ,. (3.52).697-1359 Homelmprovement wV ftED' 10 HONiMEl I. sho- Oft Our Nc. Lifetime Exterior Paint. Call Now to see if your home qualifies. (800)96L8547. (Lic.#CBC01011I) HomesFor Rent .1BR,2B.A .j --lasure .'.I'-.01UD' Only Sl\v9Q Mo! -, dosii 20 .ears ;.. 8;. npr Buy, 5/BR $3021 Mo! For listings (800)366-9783 Ext 5798. flnrdable 4BRIZBl\ S16.100! Only SIg9.Mo' . IIUD Ilurnv, 5%. doi.N ?U ij.ani, I ..a ,iir for kcal lslinng. call (r'lll t Never Rent Againt! Buy, 5BR/2BA $38,000! Only $302/Mo! 3/BR $11,000! 5% down 20 years 8%. HUD Homes Available! For listings (800)366-9783 Ext 5796. HomsesForSale Investors Palm Harbor Modular Homes From $53 sq It finished on your lot, Free color brochures Call John Lyons (863)860-3062. .Instruction *\MLRI( V'S DRI% ING ACADEMY!! Sian uro driving career today! Offering courses in CDL At Low tuition feel Many payment options! No reg- istration feel (888)899-5910 info,@amnericasdrivingacadenmy.con. Miscellaneous DIVORCE$275-$3S0*COVERS children, etc. Only one signat.ie rquiird! *Excludes govt. fe st Call weekdays (t,0u.42.2.ii. ext.600. (8am-6pTm) Alta Divorce, LLC. Established 1977. AIRLINES ARE HIRING Train for high paying Aviation Maintenance Career. FAA approved pro- gram. Financial aid if qualified Job placement assistance. CALL Aviation Institute of Mainte- nance (888)349.5387. ATTEND COLLEGE ONLINE from home. Medi- cal. business, paralegal, computers, criminal justice. Job placement assistance. Financial aid and conm- puter provided if qualified. Call (866)858-2121. www OnlineTidewaterTech com. PetSupplies Stamp Out ITCHAMACALLrISI Shampoo with Happy JackV Paracide II & ItchNOMorec Apply Skin Balm q>. At farm & feed stores. Real Estate BEAUTIFUL N. CAROLINA. ESCAPETOBEAU- TIFUL WESTERN NORTH CAROLINA MTS FREE Color Brochure & Information MOUNTAIN PROPERTIES with Spectacular views, Homes. Cabins, Creeks, & Investment acreage. CHERO- KEE MOUNTAIN GMAC REAL ESTATE... cherokeemountainrealty.cnto Call for free bro- chure (800)841-5868. LIMITED TIME OFFER 100% FINANCING-Gated Lakefront Community of the NC Blue Ridge Mins. 90 miles of Shoreline start $99,000. Call Now (800)709-LAKIE. 1ST TIME OFFERED Colorado Mountain Ranch. 35 ACRES S39,900. Priced for Quick Sale. Over- looking a majestic lake, beautifully treed. 360 degree mountain views, adjacent to national forest. EZ Terms. (866)353-4807. So. Colorado Ranch Sale 35 Acres- $39,900 Spectacular Rocky Mountain Views Year round access, clec/ tele included. Come for the weekend, stay for a lifetime. Excellent financing available w/ low down payment. Call Red Creek Land Co, today! (866)696-5263 x 2682, (Week of August 20, 2007) Great Financing 5BR 3BA- Designer Kitchen, Delivered and set up $73,900. /2 and 1 Acre Land & Home Packages MOVE IN NOWI 6 Homes Set Up All Sizes- All Prices SUN COUNTRY HOMES 1710 S Suricoast blvd. 352-794-7308 INVERNESS 2/2 66'X14' LR, DR, KIT, W/D $6,500 OBO 352-287-1887 Ask for Mechelle .INVERNESS 55+ Lakefront park Exciting oppt'y, Tor 2BR Mobiles. Scr. porches, apple water incl. 'Fishing piers. $7,000-$15,000. Leeson's 352-476-4964 OAK POND ESTATES 55+ comm. 3/2 carprt, shed. Partially furn. Very Nice! $45,000 (352) 637-4837 RENTAL FINDER rentalfinder com "FIXER-UPPERI" 2-Mobles for $75K Both 2/1 Single wides. Nice half acre lots- 1-needs work-1-ready to go r.10, eporole?/Crpt. SW Exc. Cond. CHA, ceiling fans, scrnd 12 X 20 porch. Dbl. corner lot on paved street. $53K obo 352-503-6061/628-7480 S3/2 SW on Two V/ 3/2, 1/4 Ac. Crystal Rvr Near Bic. Prk, New roof, well, septic, Handyman Spec. $55K OBO. Con- tract negot. No owner finan,(352) 302-5535 Crystal River 2/2 SW on 1/2 acre, Fla rm, scr. porch, new carpet, stove, 10x14 workshop Last on dead end, by owner, $49,900 (813) 792-1355 HEATHERWOOD 2.5 Horse-Ready Acres, 1300 sf, 1996 DW, completely remodeled /upgraded 24x36 Barn, fenced, cross-fenced, easy ride to St. Forest. $175,000. (352)726-1975 (352) 634-4295 LAND & HOME 2 Acre Lot with 2000 sq. ft., 3/2 Home Garage, concrete driveway & walkways, carport. Beautiful Mmist See 10% down No closing cost $948.90/mo WAC Call 352-621-9182 NORRIS1. I. KFIRONvr I.AFOI I E1 TE. 1 FN. NESSEB; New Gated Development, Fantastic Views, Deep Water, Utilities, Boat Launch, Near Golf Course, One Hour North of Knoxville, 4 22 .si-11e-r-n- ii (800)362- 4225. North Carolina Cool Mountain Air, Views & Streams, Homes, Cabins & Acreage. FREE BRO- CHURE (800)642-5333. Realty Of Murphy 317 Peachtree St. Murphy, N.C. 28906. &r qity9ftWrphy corn, Move to the Smoky Mountains 3/4-3 acre tracts starting at $79,900. 15 min from Pigeon Forge Gadinburg, Low taxes Low crime. Majestic Moun- tain Views (888)215-5611 xlOl Chattanooga Mountains Spectacular River views 800+/- Acres Trade for income producing Real Estate or $3,500! acre Higgenbotham Anduct. ntl Ltd Inc. FL Lie #AU305/AIs58 (800)257-4161 higifunbothamn con. ARIZONA LAND LIQUIDATION! Near Tucson, Football Field Sized Lots. SO Down/SO Interest, S159/Month ($18,995 total). FREE INFORMA- TION. Money Back Guarantee! (800)682-6103 Op#lO. NC: Best buy in mountains! Two acres with spectacular view, paved road, gated, housesite in, owner financing. Bryson City, $65,000, $13,000 down. Call owner! (800)810-1590, wwwv,wildcatknob.com. OWN WESTERN NC MOUNTAIN LAND Spec- tacular property with panoramic views, minutes to Ashevillol 40+ acres of conservation area, miles of nature trails, 10 minutes to hospital, shopping & dining. Acreage from S129,990. Owner (866)800- 4561. VIRGINIA MOUNTAINS my dream rustic 2- story log cabin on 13 acres with barn, pastures, woods, creek, adjoins Jeffe'son National Forest with miles and miles of trails, have to sell $389,500 owner (866)789-8535, AFFORDABLE LAKE PROPERTIES On pristine 34,000 acre Norris Lake Over 800 miles of wooded shoreline Four Seasons- Call (888)291-5253 Or visit Lakeside Realty com. Coastal Georgia Land Liquidation! 20 to 40+ acres from $99,900 to $169,900. Beautiful timber, potential to subdivide. Pay no closing costs for limited time. Excellent financing, Call Now! (800)898-4409, x 1333. Unbelievable LAND SALE! Saturday, September 15th. 20 acres only $29,900. SAVE $10,000. Plus, NO closing costs. Subdivision potential! Big moun- tain acreage, spectacular views. I mile to Nicklaus designed golf course. Near Tennessee River & rec- reation lake. Excellent financing. Call now (866)999-2290, x 1426, SOUTHERNCOLORADO5 Acre HomesiteS59,900 GRANDOPENINGSALESEPTEMBER I5TH& 16TH. Gatedcommunity,undergroundutilities1,100acresofopen space,spectacularmountain views, Greatprimary/second- aryhome. Recreationtgalore! CallTodayfbrappointment! (866)696-5263 X 2563. NeartheBllueRldge Parkwayn VA,5 actractsw/views andcreekfrontage.S49,OOOLaMgertractsavailablc.Climances Creek Realty www chancescreekralty corn, Roofing METAL ROOFING. SAVE $SS buy direct from manufacturer. 20 colors in stock with all accesso- ries. Quick turn around. Delivery Available.. (352)498-0778 Toll free (888)393-0335 code 24. wwwv GlitCoastStpply com, AtNVrnT..iNCMI. r.',*IE. o0 r . THURSDAY, AUGUST 30. 2007 9C "Copyrighted Material '* Syndicated Content O"- Available from Commercial News Providers" :, Frank & Sally wereleft r'speechless at the great f 7 results they received Citrus County Chronicle Classifieds Out with the Old... In wth the New! Call Today to Place Your Classified Ad & Turn Your Old Items Into Cash! , (352) 563.5966 . ft1- 9 IO 4w 401 4ahOmi4o a, INVERNESS 2/2 Neat & Clean Newer SW, $650. mo. + dep. 352-860-1335/464-7650 INVERNESS 55+ Lakefront park Exciting oppt'y, 1or 2BR Mobiles for rent. Screen porches, appl., water Incl. Fishing piers. Beautiful trees $350 and up. Leeson's 352-476-4964 LECANTO 2/1 Clean, quiet. $500/mo. $300 elec.dep.$400 sec. dep.(352) 746-6687 (352) 302-1449 RENTALS! $400-550/MO Newly dec, Hernando/ Inverness area, DW 2/1, SW 2/2, SW 1/1 1st, Ist, sec 813-468-0049 6 BDRM HUD $54,000! Only $429/mol 5% dwh. 20yrs. at 8%. For listings 800-366-9783 Ext 9845 3/2 $214/mo HUD Home 5% down 20yrs at 8%apr. For listings call 800-366-9783 Ext 5704 4/2 HERNANDO DW '00. Exc. cond. wrkshp. $100,000 Keller Williams Realty Call Debbie Fields (352) 637-1500 ADULT PARKS RENT OR OWN LOT New 38R, 2BA Skyline Home; 2" Drywall Porch, Carport MOVE IN TODAY SUN COUNTRY HOMES 1710 S Suncoast blvd. 352-794-7308 BUY AT INVOICE New Jacobsen triple wide 2-100 sq. ft. Must sell, was $119,900. Now only $103A26 only at Taylor Made Homes Call 352-621-9182 CITRUS COUNTY (FL) CHRONICLE HOMO5A5SA 2/'X OB- 3/2 Over 1,836 SF. on 1/2 Ac, All new well, Septic, Power & Impact Fee Pd. Owner Fin. Avail. (352) 746-5918 MUST SEEII 2,200 Sq. Ft. of Living, 2.85 Acres, Paved Road, Fenced, 2 Car Carport, Pool. (352) 746-5912 or (352)400-6357 No Money Downi 2/1 FIXER UPPER Inglls 2/1 Fixer Upper Large Deck. $5.500 352-220-839 2/1.5 Nicely Furnished In 55+ Park, Exc. Cond. W/D, Dw, Fl. Rm.'+ Scrn. Rm, laundry, shed + carport. $22,500 (603) 491-0431 55+ Pk. ALL LIKE NEW 1700sq. ft. Price dropped 10K to $57,900 352-697-1788/563-6695 BIG PINE ACRES, 55+ 2/1/Carport Screened Porch, Shed, 2 ACs, W/D, Sm. Pet OK, Part furn. $9,800 obo (352) 270-9323 DUNNELLON 2/2/CRPT. 55+ Comm., Hot Tub, Many Appl. $87,600 Margaret Baker, EXIT REALTY (352) 422-0877 FOREST VIEW ESTATES Great Loc. Pools, clbhs. & more. Move-In ready, comp. furn. 2/2 DW, wheelchair. acc.shed & sprklr. $53,900. (352) 563-6428/ 352-563-1297 FORREST VIEW EST. 55+ 2/2, LR, DR, open kitch. w/great room to scrnd prch. Shed. Part. furn. $64,550 TOO MANY NEWS to istl 563-2526 WALDEN WOODS 2003 DW, 3/2, vinyl Fl. Rm., new berber Carpet. $62,500 (352) 382-2356 cm or Rent CHASSAHOWIIZ Finan.10% Down Or Rent 2/2's @ $600 mo Onr/Agnt 352-382-1000 r "RENTAL FINDER N rentalfinder com CRYSTAL RIVER 3/2 $475/mo + Sec.& App No Pets HOMOSASSA 2/1 1 Ac, $450/mo. + Sec., +,App. No Pets HOMOSASSA 2/1 $425/mo. + Sec. + App. No Pets Don Crlgger Real Estate (352) 746-4056 INVERNESS 2bd/2 1/2ba F/L/Sec $725 Jon 786-525-6515 LECANTO 3/2/2 $1,175/mo + Sec.& App SHOQME No Pets Don Crigger Real Estate (352) 746-4056 Property Management & Investment Group, Inc. Licensed R.E. Broker > Property & Comm. Assoc. Mgmt. Is our only Business > Res.& Vac. Rental Specialists > Condo & Home owner Assoc. Mgmt. Rabble Anderson LCAM, Realtor 352-628-5600 Info@proaertv managmentgroup. I RENTAL FINDER , | rentalflnder.com ----ma mmm mi CRYSTAL RIVER 1 & 2 BR, W/S/G Incl. $600 (352) 212-7740 CRYSTAL RIVER Newly Renovated 1 bedroom efflclencies w/fully equip, kitchens. No contracts necessary. Next to park/ Kings Bay Starting @ $35 a day for a week or more. (Includes all utilities & Full Service (352)586-1813 FLORAL CITY Lakefront 1BR, Wkly/Mo No Pets. (352) 344-1025 HERNANDO Studio Apt., $125. wk, 352-637-6531, 476-2917 3/2/2 Rent-to-Own New Home Citrus Spgs. Low Down, Easy Terms Danny (352)875-5645 CRYSTAL RIVER & HOMOSASSA Apartments Avail. | ONE MONTH FREE I (352) 795-2626 I L ---- m- e Crystal Palms Apts. 1 & 2 Bdrm Ist Mo. FREEI Crystal River. 634-0595 CRYSTAL RIVER 1 BR, laundry/premises. $500 mo.+ sec. deposit. 352-465-2985 CRYSTAL RIVER 2/1/ 828 5th NE Ave. Nice, CHA, $600/mo + Sec. 352-586-5335 727-341-2955 CRYSTAL RIVER Seven Rivers Apts. 1 & 2 bedrooms, clean, quiet. ClOse to mall & hospital. Complete laundry facilities. No application fees. (352) 795-1588 Equal Housing Opportunity HERNANDO 2/1 Very clean, $525/mo. Sec. dep. 352-527-7842 Invern./Homosassa Apartments Available 352-628-4282 INVERNESS 1/1 WATERFRONT, Utll. Incl. $495/mo.(352) 341-3131 INVERNESS 2/1 $520/mo, 352-302-3911 INVERNESS 2/1 No Pets. Scrnd. Prch & Carport. 923 Turner Camp Rd. $500/mo. + $500 dep.352-860-2026 INVERNESS 2/1, After renovation, water, trash, Incl. $625., 1st & Sec. Dep. Req. (352) 266-1916, Steve Camp. remod, & spacious, all apple. Inc. Prvt. parking & ent. $1,075/ mo. lst/Ist/$500 sec. No smokina/oets. Crystal Palms Apts. 1& 2 BdrmstMo.FREEI Crystal River. 634-0595 HERNANDO HWY 486 1,500 SQ. FT. OFFICE $1,125/mo. + TAX 1-800-557-4044 Industrial 3 Phase Building, Inglis,brlor ll,lst fir. furn. Near pool. $114,500 $1,000mo 352-249-3155 CITRUS HILLS 2BR, 2/2 BA Townhouse Furnished $800/mo. 352-697-0801 CITRUS HILLS Meadow View Villa 2/2/1 Fully turn. Pool, (352) 586-0427 INVERNESS 2/2 Unfurn, W/D, no smoke/ ets, $750. mo. Ist. last 350. sec. 352-302-8231 352-621-4973 INVERNESS 2/2 W/D, New carpet, appl.'s, comm. pool. garb. Incl. $750.mo. 1st, Ist. $500. sec. (352) 746-4611 INVERNESS 3/2/1, Moorings, $900. 2/2/1, Landings $800. Judy B Spake, LLC Shawn (727) 204-5912 PRITCHARD ISLAND 2/2 $150K, $800/mo. Dock, Comm. Pool 352-237-7436/812-3213 CRYSTAL RIVER 3/1 $800/mo. 1st/sec. (352)464-3522 INVERNESS 1/1 Furnished,Water & gas. $650 mo, Dep. & 1st mo rent. (352) 726-6515 LECANTO 2/2 Large, NEWI No pets $675/mo. 352-228-0525 6 BDRM HUD $54,0001 Only $429 CONDOS, HOUSES SEAS, MONTHLY Furn & Unfurn. Heated pool. All newll 352-302-1370 DUNNELLON 3/2/Crpt, Quiet Historic District, carpet, big bright kitch., storage. Redecoratedl Spotless! 1mm. Occ. $795mo. 527-3953 or (352) 427-7644 FLORAL CITY NEWER 3/2/2, open lakefront. $1000 mo. LARGE FM. RM. 2/2 fenced yard, $750/mo. No smoking or pets. (352) 344-2500 HOMOSASSA 3/2/1, sun. rm., $1,300. mo. (352) 628-7120 HOMOSASSA Upgraded 3/2 Enjoy Access to Comm. Amen. & Pool. 55+ $950/mo. 2/2/1 Furn. Villa SMW $900/mo. 3/2/2 Fully Furnished w/Pool. SMW, $1,350 Coldwell Banker, Next Generation Realty (352) 382-2700 .. M oil e- o ..s.. ... a... ,2z UBKANiU new homes starting @ $800/month w/ move-in discounts avail. Many homes pet friendly. aActlon Prop Mgt-UcRE Broker 386-931-6607 or 866-220-1146 Rental.ne BEV. HILLS 2/1.5/1 Fl. rm. Fncd bkyrd. Strg. shed.$650+dep. 352-795-8770/563-0964 BEVERLY HILLS' 1/l/crpt. Glass Rm. Clean & Cony, Area $550 (352) 746-3700 BEVERLY HILLS 10 N.Desoto 2/1 $650.mo 8 N.Fllmore 1/1 $625.mo CRYSTAL RIVER 9 N.Candle 2/1 $550.mo INVERNESS 237 N.Croft 2/2 $750.mo 352-637-2973 BEVERLY HILLS 18 N. Osceola, 2/1/2/1 & carport. New inside $725 mo. Ist., Ist, dep. & 33 Murray St. 2/1V2. Ig shed & fence $600. mo. 1st. last. dep. 352-795-3000 BEVERLY HILLS 2/1/1 90 S J KellnerNo S/P Yard Care $775/mo 352-422-1024 BEVERLY HILLS 2/1/1 Cleanly $695/mo. + Ownr/Agt 352-228-3731 BEVERLY HILLS 2/1/1 W/D, CHA, Fl Rm.,$650. 352-382-1344/422-2242 BEVERLY HILLS 2/1/1, Remodeled, AC Fl. Rm. (352) 382-3525 BEVERLY HILLS 2/1/Iy2, 32 N. DeSoto, Central Air, LR, FR, Kit, newly tiled. BRS, new berber carpet. Storage shed. $675/mo. (352) 249-3228 BEVERLY HILLS 2/1Y1 Lg. FR. Immacu- latel 430 S. Washington. $665 mo. 1st, last, sec. No Pets. (863) 647-2950. Beverly Hills 2/2/1 Lg. fl. rm. $725./mo. + C/H/A 23 S. Harrison St. 727-463-1804 Beverly Hills 2/2/1 Very clean & spacious. $725/mo. 1st, last & sec. 104 S Fillmore St. (352) 302-9544 BEVERLY HILLS 3/1 WQWI Scrn Rm., strg. rm. Lawn care Incl, Ref. Req'd $650/mo, 352-302-3319 BEVERLY HILLS Great Homes for Rent or Sale (954) 536-0353 BEVERLY HILLS Lg. 2/2/1 Fam. Rm., Scrn. Rm. Appl. Good Area. Move-In Cond. $725 (352) 746-3700 BEVERLY HILS 2 Bed w/Fl. Rm. $750 2 Bed Remod. $675, I1 Bed $625. 352-422-7794 BLACK DIAMOND 3/2/2 Bermuda Dunes. $1100/mo 647-504-6025 CIT. SPRGS 4/2/2 $1,000. MOVES YOU IN $1,000. MO. ALL FEES WAVED (352) 597-3693 fre.g (609) 457-9349 CITRUS SPRINGS 9320 N. Santos, Nice 2/1, carport, new Ber- ber, no pets, $595. + util. & sec. (352) 628-0033 CITRUS SPRINGS Many Available $825.- $875. mo. 2 -4 wks FREE Rent If Qualify. (352) 795-9123 Charlotte G Realty & Investment LLC CITRUS SPRINGS Santos Dr. 1/1, $550. + sec. CHA, scrn. rms., w/ W/D, super clean 352-489-2266, 489-4940 RENTAL FINDER rentalfinder.com Rentals COUNTYWIDEI GREAT AMERICAN REALTY Call:352-422-6129 or see ALL ofat cornm Sep. Gar. $650/mo+ dep/util 2/2 park like Ac's, $1,050. FURN. APT. 2/1 CRYS. RVR $525. (352) 795-2204 1[OC TI-ITt1t.rSAV AiTitTTU T 30. 2007 CITRUS SPRINGS Rent or Lease Option. 4/2/2, 2,200 sf. (352) 746-1636 CR/Hom 2/1 $465; 2/2 $535; 3/2 $675/$760 220-2447 or 212-2051 CRYSTAL RIVER 2/2/1, fam. rm., water, gar. & pest, Incl. $850. + sec. (352)464-2716 CRYSTAL RIVER 3/2/1; Near CR Schools $850.mo. 352-795-7928 CRYSTAL RIVER 3/2/1, Pets, negot. $775. mo. Call for Info (352) 795-5126 DUNNELLON 3/2/Crpt, Quiet Historic District, carpet, big bright kitch., storage. Redecorated! Spotless Imm. Occ. $795mo. 527-3953 or (352) 427-7644 DUNNELLON RAINBOW LAKE EST. 2/2/ Cement block house, carport, 12 x 24 storage bldg. on 1 acre. $700 mo. 1st, last sec. No pets 352-489-1977 FLORAL CITY New 2/1, FP, W/D, Dock, Canal Front, Near park. $800/mo, Please Call: (352) 341-3330 For more Info. or visit the web at: citrusvlllages rentals.com HERNANDO 3/2/2 Pool E. Getty Ln. $1,100 1st + SD 352-697-1907 HOMOSASSA 2/1 CHA, No pets $575. Ist/last/sec 628-4210 HOMOSASSA 2/1, furn. or unfurn. Immaculate, no pets, $800,mo. 305-619-0282 HOMOSASSA 3/2, on 1 Acre, C/A, W/D, nice neigh- borhood, $750/mo., $1,500. move (954) 294-0531 HOMOSASSA 3/2/2 Almost new; Neat, quiet S/D between Homosassa & Lecanto. $825 (352) 382-1373 INVERNESS 2/1/1, nice yard., $625/ mo., Water pd. 2014A Milton (321) 412-2469 INVERNESS 2/2/1 HIghlands, scrn porch, $750/mo (813) 973-7237 INVERNESS 3/2/2 Clean, fenced yard. $750 mo. 352-637-0765 INVERNESS 3/2/2 Lake Area, $820/mo. (352) 341-1142 INVERNESS 3/2/2 Like Newl $850 mo. KIm (352) 634-0297 INVERNESS 55+ Lakefront park Exciting oppt'y, 1or 2BR Mobiles for rent. Screen porches, apple water ncl. Fishing piers. Beautiful trees. $350 and up. Leeson's 352-476-4964 INVERNESS POOL On Golf Course, large 3/2/2, No Pets. $850. mo. 908-322-6529 NO CREDIT CHECKII RENT TO OWN 352-484-0866 visit Jademisslon.com PINE RIDGE 4/3 Pool on 1.25 acres. $1500 mo. 1st & secu- rity. (352) 634-2373 SMW UPSCALE 2/2/2 SALE/ LEASE, scm. lanal $900. mo 352-592-9811 Crystal River 3/2 Oceanfront, ceramic tile, $950/Mo. (863) 446-0950 after 7p CRYSTAL RIVER Spacious 2/2 condo. Beautiful waterfront view w/dock. Recently updated, partially furnished. Pool, tennis cts., cable TV. $900/mo (414) 690-6337 INGLIS 2/2, House, CHA, W/D hookup $750 mo+ 1st, last &dep.water & garb. 14185 W. River Rd 352-447-5244 Cell 352-613-0103 INVERNESS 2/2 Wtfrnt Gospel Is. w/shd. $650/mo. 352-201-1222 PRITCHARD ISLAND 2/2 $150K, $800/mo. Dock, Comm, Pool 352-237-7436/812-3213 INVERNESS Pool, $150 wkly. Incl. util. (352) 726-6186 after 7 3/2/2 Rent-to-Own New Home Citrus Spgs. Low Down, Easy Terms Danny (352)875-5645 CITRUS SPRINGS Rent or Lease Option. 4/2/2, 2,200 sf. (352) 746-1636 Homosassa Sprngs. 3/2 newly remod. DW on fenced acre. No pets. $775/mo + $775 sec. 5051 Grand Circle Ter. 352-816-0010 Owner Finance, Citrus Springs 3/2/1 Fum.,Cbl TV, Kitch. Prlv. $90 wk. (362)628-8244 CONDOS, HOUSES SEAS, MONTHLY Fum & Unfurn. Heated pool. All newll 352-302-1370 HOMAS. 2/1, MH Util. Incl. Nice clean, quiet park. short/long term. $695 (352) 628-9759 HOMAS. 2/1, MH Util. Inn. Nice clean, aulet SEAS, MONTHLY Fumr & Unfurn. Heated pool. All newll 352-302-1370 Kings Bay Crystal River 1 mo. at a time Rentals Furn. 1/1 Apt. Sleeps 4. $1000/mo. Includes boat slip. 386-462-3486 RENTAL FINDER 1 | rentalflnder.com PUBLISHER'S NOTICE: All real estate. advertising In thls newspaper Is subject to Fair Housing Act whlch. rThisANNUSSO 3.9% Listings INVESTORS BUYERS AGENT COMMERCIAL SALES (352) 422-6956 ANUSSO.COMSF. $527K or Lease @ $12/SF T. Paduano C21, JW Morton (352)212-1446 INVESTORS Palm Harbor Modular Homes from $53 sf. Finished on your lot. 3 Color brochures. Call John Lyons 863-860-3062 THRIVING FEED STORE GNC Comm. Property, 5,000 sf, metal big. Main rd. crnr loc., Loading Dock. $675K Don Crigger Real Estate CONSTRUCTION 3/2/2 1,404 sq. ft. Living. + $1,500 In CC. Greg Younger, Coldwell Banker Ist Choice. (352)220-9188 3/2/2 Rent-to-Own New Home Citrus Spgs. Low Down, Easy Terms Donny (352)875-5645 3/2/2, 1.23 Ac. REDUCED TO $282,000 '07 New, Upgrades 2,372 LIv./3.269 Tot. SF. A REAL GEMI 2/2/2 Hardwood firs thru-out, Fl. rm. Appli's like new. Custom cabinets, oversized lot near Gulf Crs. Anxious to sell at $149,900. 352-464-2094 BEAUTIFUL NEW 4/2/2 2,235 SFLA. CT, Ig. Lanai, SALE OR RENT $1200 mo 407-468-2179 BUILDER LIUQUIDATIONI 3/2/2 Was $195,990 Now $155,990 + Upto $6K C.C. Greg Younger, Coldwell Banker 1st Choice. (352)220-9188 BUILDER LIUQUIDATIONI $174,900 Norm Overfleld 352-586-8620 Keller Williams Realty SPOTLESS 2 BDRM. 2BA HOME 2 car gar, caged In-ground pool, situated on 2.5 ac. landscaped estate. Fenced for horses and spotted w/mature oaks. Everything new. If you are looking this- is a must see! (VACANT - MOVE TODAY) Asking $269K Contact D Crawford for details. (352) 212-7613 2/1/1 CHARMER 1600 sf. Uv. GREAT LOCATION Nice 3/2/2 home, split fir plan. Off Golfvlew Dr. $139K Crldland & , rldland GMAC, Don Verity (352) 804-7836 STILT HOMES Molular Stilt Homes 140 mph. zoning. We build, sell, deliver- We do it all Eliminate builder mark-up. Call the factory. John Lyons 800-622-2832 xt. 210 M 5248 N BRONCO 4/3 pool home on 1.25 acres. $3,000 towards closing costs. $273,500 (352) 634-2375 3/2.5/2 POOL HOME UPDATED EVERYTHING FSBO, Adj. to Golf Course, Crnr Lot, Gas FP, Irr. Well, Granite, Huge Shed. Must Seel myhome4sale.net $299K (352) 746-1175 3/2/2 POOL HOME 2237 sq.ft living space. Backs to Black Diamond 3186 W Birds Nest Dr. MLS#315839 352-586-1558 CALL NOWI $289,700 BETTY MORTON dishwasher, washer dryer hookup 1 car gar, with opener, screen/ vinyl enclosed porch. (352) 341-2771for info Uc.# CBC059685 INVERNESS-LITTLE JOHN 3/1/1, On1 Acre + $122,000. WESTON PROPERTY LLC (352) 746-1110 Lakefront Stilt Home Drastically Reduced 3/2/2 car carport, was $204k Now $160,000 Barb Malz, 212-2439 Keller Williams Realty *55 per addltlUOnal lne (Somie Rertrlctions ,May apple) WINDERMERE VILLA Pristine/original model 2/2/1, $155K FSBO (352)726-8503 20 Years Experience 2.8% Commission Re*ty5lect (352) 795-1555 FIXER UPPER These homes need work.' Free Computerized list of properties Free Recorded Message 1-800-597-5259- tyhomelnfo.com ID# 1048 ERA American Realty & Investments 3/2/21/2 HOME $279,900 (352) 464-3383 S305 o NO CREDIT CHECKII RENT'TO OWN 352-484-0866 visit jademlsslon.com 3/2/2 CRYSTAL GLEN Elegant Home 2,577 sf. Orlg.$224,900/NOW $179,900 Ron Egnot Ist Choice Coldwell Bnkr, 352-287-9219 4/3.5/2 TOTAL LUXURY 10 Ac. Too many extras to list $749,500 Charlene & Peggy, EXIT REALTY (352) 464-4179 nuHoffmaniii, Keler villiUams 7102 Smith Ter., HOLDER 3/2/2 on 1.3 ACRES Borders State Park ForSaleByOwner.com, Listing # 21030419 , $229,900, 352-465-5233 i 3/2 $214/mo HUD Home 5% down 20yrs at 8%apr. For listings call 800-366-9783 Ext 5704 BONNIE PETERSON Realtor, GRI Your SATISFACTION Is Mv Future! 1 (352) 586-6921 or(352)795-9123 Charlotte G Realty & Investments LLC *Home Finder* *Home Finder* *Home Finder* L'kn'A'i' t T4 I I 1 .1:M4l k'ATt ] u11 Citrus Ridge Realty 3521 N. Lecanto Hwy. Beverly Hills, FL 34465 713077 1-888-789-7100 BONNIE PETERSON Realtor, GRI Your SATISFACTION Is M Future! I bulit home, featuring stacked stone In/out, gas FP, gourmet kit, granite & all wood cabinets, 10' ceilings, alarm & sprinkler sys. 2 built-in 220 gal saltwtr fish aquariums. 2 story barn, 2 car detached garage. Too many extras to lstll $449,000 Owner/Agent call for appt. 352-302-2300 REDUCEDII 4/3/2, Built 2006, Crystal Glen $267.000 Seller will pay all closing cost. Call for Info. FSBO (352) 527-1177 3/2/2 TERRA VISTA VILLA By Owner Spacious 2,583 sf. AC, Huge Lot on the park. $170K under replacement. Must Sell this monthly $397,000 352-228-2044 CAMBRIDGE GREENS 3/2/2 New Constr. For Sale by Owner Go to hlllshome.com CUSTOM BUILT 2005 5/4/3-3400 living 4700 overall Great for large family Pool/spa. No brokers 440k Citrus Hills 352-302-4200 FOR SALE BY OWNER 1049W 8. Malz, (352) 212-2439 Keller Williams Realty REDUCED TO $200,000 BEAUTIFUL 3/2/2 Golf Crs. Home, New AC, roof & carpet. Nicely landscaped, clean, updated. 954-309-4262 N ROWN M-1 UTTTEravril PRi- mB^ 3/2 SW on Two V2 AC Lots. Scm porch. BY OWNER, $44,500 1592 S Lookout Pt 2 blocks off US19 352-503-4142 n I Mifti I I .-- - - I I aft . CLASSIFIES 3/1/1 @1129.900 YOU GET MORE HERE 3/2/2 on 2 LOTS New roof, paint, kitch., $169,000 OLD HOMOSASSA lamln. firs. Shed, fncd. Brand new 2100 SQ.FT CB, bonus rm,, FP, yd. FL.Rm(352)302-7778 3/2 custom home, Sunroom, $185K 3/2/1Gospl is. $169,900 Many Upgrades. You Jack Randall >1,800 s.f. Fl. Rm., Scrnd Will Want To Look (352) 212-7740 Porch, Util, Big. on Here 1st 917-804-4300 3/2/2 POOL HOME approx. 3/4 Ac. Room '- "-. S Lots of News! Full bar to build pool or add. '' @ Solar Htd, Scrnd. Pooli home on Inc. adj. lot. $169,900 Harley Hough, (352) 726-3481 EXIT Realty Leaders ' 3/2/2 Foxwood Home 352-400-0051 New paint & carpet. 4989 S Hummingbird D M 1620 S. Windmere Pt. Ji6 K 352-257-2646 B BANK movhhg. FORECLOSURES 1/1 COUNTRY SETTING FREE list of RV Parking, Concrete Foreclosure slab in back. Eat-In kit. properties $49,900. 352-860-2075 Receive a FREE 2/2 CHAIN OF LAKES computerized Entire house refinishedl on print out. Newly remod. kitch.,, , Free Recorded dock, & covered L Message boat slip. $5175K f4 1-800-597-5259 352-726-4775/563-1848 H www,freecitruscoun- 3/2 CORNER LOT--5 tyhominfo.com C/H/A,'new roof & AC- ID# 1042 in 2004. Country setting. ERA American Laundry rm, ranch style T Realty & Carpet/tile, ceiling fans- Investments $149,900. 3528602075 New 3BR/28A 1408 s.f. 3/2/1 Zan Mar Village tile floors, gar. 560 s.f. Beautiful Bargain 3/2/2 Charming & Peacefull 9'6" elevation, city New root, fireplace, tile, Lots of upgrades, FP, water, paved St. Cor- 25X25 LR, Immac. cond. hardwood. 115.925 ner lot, room for RV, 2100SF. 100% FIN. John Malsel III Exit Owner fin. $189,000 $176K, (352) 586-7685 Realty(352) 302-5351 628-2703 BUY OWNER T.P.A.61665 Beautiful 3BR, 2BA BETTY MORTON home on 1 acre, corner lot overlooking Floral City lake, asking $250,000 For details 2/2/1 Golf Course Villa (352) 464-5433 + Carport, Deadend, GREAT HOME ON I AC.I All new paint. Scrn. Rm. 2/2/2, new, roof, renov. Move-in I $120K OBO, In 2004. Open floor, Kathy Santo,Coldwell w/split plan $179,900 Banker (352) 228-7991 Terrl Hartman Crossland mr wa Realty (352)726-6644 BRAND NEW & MUST SELL! STUNNING Lic. Real Estate Agent 4-5/2.5 All new apple FSBO 4/3/3+ Bonus 20 Years Experience Above ground pool. 3238 sq. ft. All the 2.8 O% Excellent Housel $250K upgrades, Ig. gour- Commission (352) 637-3253 met kitchen, granite, t center island & stain- less apple. Lg. screen ReIi; Iec Ipool. Selling under .Wemftf=>Iw apprasided value at. (352) 795-1555 $414,900 view at 1 AC MOL 3/2 greatflihomes comrn CHARMING 2BR/2BATH 20 X 30 det. Garage. or call 813 967-7192 HIGHLANDS, corner lot, Close to Power Plant. Great deal, circular driveway, $89,900 (352) 302-9351 won't last prequallifled only 3/2/1 /2 Connell Must See. $124,900 (352) 201-1663 Hghts.$139,900 (352) 302-6025 ( 24/2/2, 2,100 SF. $154K *Beautifully remodeled. LEASE / PURCHASE 7 New oak cabs, wood SELLER FINANCE NEW floors, timberline roof, 3/2/2 Many Upgrades, FOR SALE BY OWNER fireplace, 2 mn, from over 2300SFL, LG rooms, 28D, 2BA, LR, DR, water. (352) 688-8040 form, DR, great rm, Kitchen range with ex- gourmet kitchen. Dan haust hood, disposal, BElY MORTON gourmet kitchen.lliDan - 4/2/2 Was $220,990 Now $185,990 + Up to $6K C.C. Greg Younger, Coldwell Banker Ist Choice. (362)220-9188 CITRUS COUNTY (FL) CHRONICLE 6 BDRM HUD $54,0001 Only $429/mol 5% dwn. 20yrs. at 8%. For listings 800-366-9783 Ext 9845 BUYING OR SELLING? CALL ME FOR RESULTS! Call Me PHYLLIS STRICKLAND (352) 613-3503 Keller Williams Realty CRYSTAL RIVER, V2 Ac. Beautiful New 2 Story Cape Cod! 5/2V2/2V/2 Wood Floors, Great Neighborhood. Over 2,800 Sf.(352) 746-5918 HOME FOR SALE . On Your Lot, $110,900. S 3/2/1 w/ Laundry Atklnson Construction 352-637-4138 Uc.# CBC059685 Lk Rousseau Area, 3/2 FP, w/ 2 garages, carport, shed, 2V ac, beautiful parklike sett- ing w/Ig. oak trees. 9701 Northcutt Ave. S$190,000 352-795-4770 NEW Model, Cypress Log Cabin 3/2, FP, Award WinnelI 1 Ac. $364500 352-422-0294 Reduced $55,000. 10 acres 3/2 DW, 1850 sf fenced w/ stalls, MUST SELLI $ 175 000. #63204, (352) 613-0232 SELL YOUR HOME! Place a Chronicle Clarsstd od 6 lines, 30 days $51.95* Coil * 726-1441 5I 63-5966 Non-Refindable Private Party Only .5 per addtid lIth (Some Restrictions May apply) Vic McDonald (352) 637-6200 E-4 RIDE GOETHE 10.9 Ac.l Fully fncd, barn12 X 12 stalls + paddock 2/2 MH Gorgeous hill-top views $215K Well< mkt.l 352-239-7788/465-2427 r--l $285,000 352-795-4932 VILLA, LG. 2/2/1 Small gated community w/pool, just off SR200 Asking $145,000. Jayne Ward Own/agt 352-274-1594 6 BDRM HUD S54,000! Only $429/mo! 5% dwn. 20yrs. at 8%. For listings 800-366-9783 Ext 9845 3/2 $214/mo HUD Home 5% down 20yrs at 8%apr. For listings call 800-366-9783 Ext 5704 2/2 CITRUS HILLS Greenbriar f1,1st fir. furn. Near pool. $114,500, $1,000mo 352-249-3155 PRITCHARD ISLAND 2/2 $150K, $800/mo. Dock, Comm. Pool 352-237-7436/812-3213 REDUCED TO $200,000 BEAUTIFUL 3/2/2 Golf Crs. Home, New AC, roof & carpet. Nicely landscaped, clean, updated. 954-309-4262 rMMMI. 3.7 PINE RIDGE CORNER Acreage Priced To Sell' Seller says sell! #315342, T. Paduano, C21 JW Morton 352- 212-1446 5.63 Majestic Acreagel By Duval Is. public boat ramp w/pub water & barn stall. Elite New Home Site! $249K #313843, T. Paduano, C21352- 212-1446 3/2 SW on Two 2 AC Lots. Scrn porch. BY OWNER, $44,500 1592 S Lookout Pt 2 blocks off US19 352-503-4142 Beautiful 5 Wooded Ac. Homes Only Area. Awaiting your home & horsesS! $135,000 Sharon Levins. Rhema Realty (352) 228-1301 BEAUTIFUL PINE RIDGE ESTATES 6 acres mol corner lot $300,000 621-3471 or 302-7351 FARMS & WATER FRONT www. crossland Crossland Realty Inc. Since 1989 (352) 726-6644 Lecanto, Centrally Located, 2 cleared .52 ac. lots. Desirable neighborhood, paved roads, city water, huge oak trees, corner lot, $35,000. Interior lot, $32,500. W Laurel St. Owner Agent 352-302-2300 Vacant/Undeveloped Land 5 Acres, MOL, Citrus Hills Mini Farms, $130,000. principal only Colleen (727) 244-4863 1 1/4 ACRE In Crystal Manor, Lot 23, Block 15, Unit 1, Surveyed, Asking $69,900. (352) 795-1531 4 CITRUS SPRINGS RESIDENTIAL LOTS Adjacent Lots 0 23 Acres each 3028, 3038, & 3046 Marie Dr. & 9516 N. Emellia Ave. 1/4 ml. from Citrus Springs Golf & Country Club. Total: $40K/all For Details: Edward (561) 337-4266 COME IN, Don't Miss Our Exclusive CHECK OUT 3rd Annual In-House Boat Show OUR BOATS Weeres, The Original Family Pontoon. AND ,-. A New.Weeres... Pontoon Boat, S E Motor& Trailer SA I.ENDED Valued At THROUGH SUN., ValuedAt SEPT. 2 $17,289 Come see why we are the Largest Pontoon Boat Dealer In Floridal Over 50 Boats In Stockll mHONICALE CL-ASSiuIF-IDS CRYSTAL SHORES 2/3 den. Dock, boat slip. on 2 lots, porch w/ vinyl windows, overlook gor- geous lagoon min. to gulf, excel, cond, D 352-795-7593 LET OUR OFFICE GUIDE YOU! Plantation Realty. Inc 1352) 795-0784 Cell 422-7925 Lisa VanDeboe Broker (R)/Owner See all of the listings In Citrus County at realtvinc.com PRITCHARD ISLAND 2/2 $S 150K, $800/mo. Dock, Comm. Pool 352-237-7436/812-3213 SOUTHERN ELEGANCE 05, 3/3/3+, 2.33 Ac. 2,241 LivSF, $323K #308410 T. Paduano C21, JWMorton (352) 212-1446 1-15 HOUSES WANTED Cash or Terms John (352) 228-7523 wwwFastFloridaHouse WE BUY HOUSES CaSh........Fast 352-637-2973 Ihomesold.comr -32g1214 13,7 I~T:,11 Isib:LK'C trailer. $1,200 mi. 454 Chev. eng. new Pwr, everything, loaded (352) 726-0121 tires, awning, exhaust. $8,500bo. 352-601-5111 KEYWEST 1520 $95 (352) 344-8409 COUNTRY SIDE MOTORS A "REEL" STEAL ROCKWOOD Extra Clean Used Cars, 2"R' w/ trailer '94, 23 1'h ft., class A, Trucks & Motorcycles. 2005 15' w/ trailer generator, roof AC, RV's, Boats. Jetskils. ALL THE UPGRADES!!! Chevy 19k m. $16,900. Consignment Wanted. (too many to mention). (352) 564-7935Deasign a Has less than 100 hours. (352) 564-7935 Detailing avail Just asking what is .www countryside owed. call 400-5520 motorscorocorn (352) 746-7883 Nature Coast Marine New, Used & Brokerage AIRSTREAM 20' DESPERATELY NEEDED We Pay Cash for 1965 MODEL, 80% CAR DONATIONS Clean Used Boats refinished. $3500 For Battered Women www BoatSuoer (352) 422-7907 in our County. Cw te u Aristocrat PLEASE HELP US. 352 794-0094 14 ft., Travel Trailer, MARITIME MINI352 STRIES for Information Call (352) 795-9621 Nature Coast Marine $895. (352) 344-1613 (352) 795-0324 New, Used & 228-3285 FORD Crown Vic LX Brokerage Catalina Low miles. 56K. We Pay Cash for '99, 31 ft., Coachman Immaculatel See NOW Clean Used Boats super clean, everything @. www BoatSuDer in good running cond., shutterfly.com Center.4m lots of upgrades. $9,500 Password: crownvic 352 794-0094 Call (352) 527-8444 $6,590 obo 637-6046 9MMOY SIPC .omeeTo eler I A WHEEL OF A DEAL 5 lines for only $37.95!* *2 weeks In the *2 weeks QOnnel .Featured in Tues. "WhAel" Section! Call Today (352) 726-3983 or (352) 563-5966 For details. '$5 per additional line Some Rostrictions tviuy Apply CHEAP CHEAP! KEYWEST 172" COLEMAN POPUP CHEAP CHEAP! KEYWEST 17' '89, Air, refrig, stereo, PINE RIDGE 1993 85HP Yamaha, exc. cond. $1,800/obo 1 Ac. Treed Lot in alum. fit on trlr. Many (352) 489-9736 or area of beautiful extras. Exc. cond. $4650 (352) 422-2874 homes! $59.900 (352) 422-0201 352-746-6161 FLAGSTAFF F Nure Coast Marin 1990, Popup. AC, stove, V CITRUS LOTS BELOW | sales & service | retf. microwave, awn- MARKET Sales & Service I reat cond. $1 Ru500. Present this Ad for ing, t cond.,$1,500. letsgolandllc com | 10% Off on all 352) 795-0206 800-840-4310 Parts & Service I BUY RV'S REDUCED TO $24KI 1590 US 19, Travel Trailers, 5th Inverness 0.46 Ac.. i Homosassa wheels etc. Call Glenn Oaksl MUST SELL! Brlnga 352-794-0094 (352) 302-0778 alloffer 305-219-8247 LJ --- J KEYSTONE 32' Terra Vista Golf Course Bunkhouse .53 Ac. on Redsox. 2005. 32 ft. Bunkhouse Prime for new home!v with master Sleeps 8, #313888, $99K microwave. Very nice N T. Paduano, C21 and clean. Value $20K 352- 212-1446 Sell for $15K OBO *Call 941-626-3951 PROWLER REGAL Si '05, 39', alum. frame l const. fully loaded, 2 Ig BEST DEAL ON WATER NEW T-TOPS & sidouts. 2 qu. sz. bdrms. $ Halls River, 2 WF Lots, CUDDY CABIN S17,500 (352) 634-4439 side by side, deep TOPS T RV DONATIONS TI canal. Parklike setting. Super Closeout Salel TV DNuctlbIefor Cleared & ready to Won't Last LongI Tax Deductible for build. $89,900. ea. Call for Pricing Appraised Value build. $89,900. ea. Call for Pricing Maritime Ministries Owner/agent Mon-Fri. 9am-5pm Maritime Ministries-9621 (352) 302-2300 (352) 527-3555 T (352) 795-9621 1 1994,150 Mercury w/Trailer. Ready to fish! $6,500 OBO r EN (352) 465-7209 4.2 L. JEEP Engine RENTAL FINDER (Carb.) w/Trans. PONTOON 18' (Auto or Manuel) 6 rentalfinder com With trailer. '00 40HP Comp. w/transfer case. L motor. All In great $1,200 shape. $3500/ obo. (352) 212-1114 (352) Chevy 350 engine PONTOON BOAT seized, complete 20', 50 hp engine w/350 Turbo In Good Shapel transmission, 1962, IFR equipped. $6,500 OBO $75. Super Tips, Strobes, Cus- (561) 762-7058 (352) 795-0848 tom Cabin Cover, New Paint & Interior 2e r E LIFT GATE For Truck Total time 3740. Engine I od since remanufacture I rentalfinder.com (352) 62 Exc. Cond. $1,000982 1323. Runs & Flies as L L Nen(352)621-0982 smooth as silk. $35,000 SAILBOAT 17' Neon (352) 637-5073 CoPac safe '97, runs well, w/AC Skvbabes@ Com-Pac, Sm. safe for parts only netsiania.net family cruiser. Shoal first $450. Firm. Draft (18 ) Keel. New 4 (352) 228-9547 F strk. Yamaha, 2.5 0/B, Tire Rims, 18" TSW trir., extras. Exc. Cond. 6 spoke rims w/tires, List $28K. Asking $2,900 lug nuts & wheel locks BOAT MOTOR (352) 563-0022 incl. recently 1996, Mercury, 40hp, SEA PRO 21' balanced. $600.obo blown piston, all 1998, Center Console, (352) 621-5588 controls tilt & trim, 150hp Yamaha, $10,000 TRUCK TOPPER complete $100.' (352) 795-2537 Iv. mess. 74 X 60 Good Shape (352) 795-0848 SEA RAY 18' $65; TRUCK TOOLBOX Boat Trailer '99 Bowrider w/trailer, Alum. Dia. Plate5S Galvanized, 14' 115 Mer, OB, Tilt & Like New! $75/Pd. $225 new tires, Trim, Extras, $8,900 OBO. (352) 560-7595 n $300. (352) 628-9056 (352) 382-0468 SEAHUNT '03 17' l O/B MOTORS CC CG approved 0ha FOR SALE All Sizes 70HP Nissan motor, (352) 564-1324 trailer, $9,000 A must $$CASH PAID$$ see!! (352) 400-0165 Wanted Vehicles Yamaha SA Dead or Alive, '05, Jet Foot, for 70-100 SEARS HD Dale's Auto Parts HP, w/ less than 30 hrs. 14' Aluminum 352-628-4144 $1,200. (352) 726-2420 $400 or trade for a I-- -.. or (305) 393-0466 Ghenoe. $ $ $ $ $ $ (352) 795-3764 | TOP DOLLAR STARCRAFT For Junk Cars '98, Bowrider, 18'10"V-6 $(352)201-1052Ih 2,1996 SeaDoos, only. $11,500 obo. CASH BUYER-No Junk 2, 1996 SeaDoos, (352) 206-5894 for Trucks, Vans & Cars w/ trailer, runs good, ALarry's Auto Sales minor work w/Fuel lines SUNDANCE SKIFF Hwy 19 S. Crystal River on both, $2000.0BO. 16', Center Console, Since 1973 564-8333 (352)464-3246 F.F., Uvewell, 40 hp Merc. mtr., bimini top, 0' CENTURY 2280 trr. Mint Cond. $6,500 1996 Bay with 150 (352) 382-5404 Yamaha. Exc. Cond., THUNDERCRAFT VHF, FFinder, GPS, 16FT, '89 Bowrlder, OMC Stereo, Custom Seat, I/O, new carpet & seats .FREE REMOVAL OF. Alum Trailer. $12000. like new, garage kept ATV's, bikes, cars, Jet skis Call 407-376-4269 $2800obo 352-270-3641 mowers, golf carts. We Vectra Deck Boat sell ATV parts 628-2084 '06, Like new, seats 8, 90HP. loaded, $22k Sell $16K obo 16' PONTOON (352) 795-6895 2003 Sylvan 16' w/02 Wanted: Boats in Need :1 40hp 4-stroke and 02 of Repair, also motors '02 DODGE NEON SXT galv trailer. Bimini and trailers, CashPaid Bi C CD. Loaded $5,995 top,trolling motor, (352) 212-6497 99 HONDA CIVIC EX livewell, depth finder, Auto,SunrsofLoaded.$7,995 much more. VERY NICE '02TOWN & COUNTRY VAN $8950. 212-5179 vtDualk Loaded $7,995 Area's Largest l6J0I Selection of A WHEEL OF Clean Used Boats THREE RIVERS A DEAL A WHEEL OF MARINE 5 lines for only A DEAL $37.951 5 lines for only S2 weeks In the 5 lisf only Chronicle $37.95!* 1 .2 weeks Onlinel .2 weeks in the (352) 563-5510 .Featured in Tues. ChronicleT "Wheels" Sectionl .2 weeks Onlinel Ca Today *Featured in Tues. ********** (352) 726-3983 "Wheel"Sectionl AREAS LARGEST or (352) 563-5966 (352) 726-3983 SELECTION For details. (352) 726-3983 O'5 per additional line or (352) 563-5966 OF PONTOONS Some Restrictions For details. & DECK BOATS May Apply *5 per additional line Crystal River Some Restrictions Marine yG May Apply (352) 795-2597 ALL SAVE AUTO RV SALE AFFORDABLE CARS BOAT DONATIONS 100+ Clean I BOAT DONATIONS b Dependable Cars Tax Deductible @ Y FROM $450- DOWN I appraised value 30 MIN E-Z CREDIT when donated to a COMO RV I 1675USE-HWY 19 I 43 year old HOMOSASSA non-reporting Al I 352-563-2003 I 501-C-3 Charity. CryStal ** -. l A (352) 795-9621 A Chevrolet 2004, Sr. owned. 67K mi. Carolina Skiff '95 good cond., $8,500 CC 17' w/newly rebuilt Call before 9pm 55HP Suzuki, gd. trailer Hwy. 19- (352) 382-2420 $4500. (352) 212-7651 Crystal River BUICK LESABRE CRESTLINER 16' A 3. 1 LIMITED 2003 25HP Elect. Start, UQ. I 23,500 mi., $12900 Ex. trolling mtr, lites, cond. 352-795-5675 bilge, live well, galv trir, to BUICK PARK AVE 2 yrs old, like new. Paid 1996, Loaded! Runs 6000 sell $3,950 call Sept 9 & drives great! 232K 302-5784 -18 All Hwy ml. $2,495 obo FISHER 352-422-1282 352-637-3550/228-1420 14' Jon Boat, 2000, CADILLAC DEVILLE 25H Yamaha, trir.. elec. DAMON 32' 1997 96 A/C blows cold, 91k motor, depth recorder, w/SLIDE, new tires/ miles. $2495.00. call $2,600. (352)408-1271 brakes $23,500/obo 352-613-5869 GRADY WHITE 22' (352) 628-0699, after 6 GRADYor (352) 344-4400 Cddillac EIDorado Cuddy, 200hp Evinrude, '92, custom paint, new SS prop, New Bimlnl, GULF STREAM tires/rims, keyless entry. Alum. Trlr Only $8.000 1990, 32 ft., 63k ml., new AC, Ithr, Nice audio sys. FEIRM(352) 447-1244 AC, floor & 4 new tires. $3600/bo 352-746-6370 HURRICANE 22' (352) 382-5259 CHEVY CORVETTE '94, Fun Deck, fishing, '99, 76K mi, heads up changing rm. 115 hp HR ADMIRAL 36' display, 2 roof panels, Johnson. New bottom '02 2 slides. 1.5 baths, white. It gray leather paint, $7,500 obo 11,500 miles. Exc. Cond. $19,700 (352) 563-1327 $57,500 352-382-3094 JON BOAT 14' (352) 382-0017 CHRYSLER 15 hp Johnson, PACE ARROW 34' '02, PT Cruiser, Lmtd., w/trolling motor & Sips 7,2 roof airs 56.600 edition, only 49k ml. ORD TAURUS 1993 ery clean inside & out. uns good. 107K, Asking $975 352-628-5378 FORD Taurus '99, pwr. everything, new tires, battery/ brakes $2,300. Floral City (305)304-1096 Lincoln Towncar '97, Jack Nicklaus version, Orig. Owner. Fantastic Condition! New battery. Like new Michellin tires. $5,800 (352) 860-2725 Lincoln Towncar'98 nature Series, 74K ml, loaded, beautiful. Wht. Ithr. all pwr, CD plyr. 7900/bo 352-445-0507 MERC. COUGAR 01, black, V-6, full pwr, 63,000 mi. $6995/obo 352-212-7168 MERCURY SABLE '96 Wagon. 3.0, V-6, Clean, good cond. $1000/obo (352) 746-3837 MITSUBICHI Spyder Eclipse '01, Convt., 5 spd. Tint, Wht/Tan Top, OK, Immaculatel Grgd $14,500 (352) 382-0005 MUSTANG RED '01 15,000 ml. 1 owner, loaded, $9,900. (352) 212-5628 NISSAN SENTRA '05, auto, AC, PW. PL, CC, CD, 35K mi. Very :lean, garaged, $9,850 352-634-3921 NISSAN SENTRA 2004, Rebuilt. 27K ml., auto, AC $7,500 (352) 527-2464 SATURN SC1 '99 3 dr, 4 cyl. auto. 127K mI. Cold AC, Runs/drives perfect. $2550 (352)453-6870 TOYOTA '87, Celica, GTS, very clean, needs minor work, $800. obo (352) 212-2067 TOYOTA CAMRY LE '96, Exc. Cond./All pwr., Mntc. Rcds., Grgd. $3,500 (352) 422-5685 TOYOTA PRIUS 2007 Silver, NEW 1,300 miles: $25,450 (352)422-0294 VOLVO '86 240 DL Wagon, 175k ml., $500. (352) 746-2488 Your Donation of A Vehicle Supports Single, Homeless Mothers & Is Tax Deductible Donate your vehicle TO THE PATH (Rescue Mission for Men Women & Children) at (352) 527-6500 $5001 Police Impounds For sale Cars from $500! For listings call 1-800-366-9813 ext 7374 DODGE '97, SLT, Laramime, ext. cab., diesel,70k mi., $12,000. (352) 795-9339 DODGE DAKOTA '96, w/topper. Good Cond. $2,700 obo (352) 527-4590 DODGE RAM '96 1500 Club Cab, $3,800/obo Rebuilt Engine & Trans.Runs gd. 352-465-2087/697-2357 FORD '94, F150, 4WD, runs & looks good, 300 6Cyl., 5 XL'95 Ext. cab.300, 6cyl. 5spd, 'Air, clean, $2500 obo. (352) 795-7757 or (352) 697-9563 FORD F-350 '99 V-10. gas, 4X2 Super Cab, loaded! I 13,700 ml. $6,500 (352) 503-3571 FORD RANGER 2004, 27K mi., Auto, AC, V-6. Exc. Exc. Cond. $10K obo (352) 527-2464 GMC SONOMA 2002 Ext. cab, V6 auto, ps pw pb 27000ml. exc. cond. asking $11,500 352-464-1413 JEEP '91, Comanche, 6 cyl. 5 spd. bedliner & topper good cond. $2,000. (352) 601-2774 NISSAN FRONTIER '04 88,000 mi. Original Owner, Very Clean & dependable, 26+ mpg $9,200. (352) 697-0147 TOYOTA '94. Pickup, 4 cyl., 5 spd. looks & runs good, $2,200. (352) 302-2258 After 5, weekdays $5001 Police Impounds For salel Cars from $5001 For listings call 1-800-366-9813 ext 7374 2 HARLEY'S '97 Road King 28K mi. burgundy/silver stocked '01 1200 Sportster cus- tom, 18,250 mi. Bur- gundy & dark burgundy.Lowered w/forward controls (352) 583-4338 2005 SCOOTER 150miles,$ 1700 Daielm scooter brand New; hardly used. Very sharp Scooter 50cc call 352-249-0815 not after 8:00 pm A WHEEL OF A DEAL 5 lines for only .$37.95!* *2 weeks In the *2 weeks Qnlinel *Featured in Tues. "Wheels" Sectioni Call Today (352) 726-3983 or (352) 563-5966 For details. 'S5 per additional line Some Restrictions May Apply *FREE REMOVAL OF. ATV's, bikes, cars, Jet skis mowers, golf carts. We sell ATV parts 628-2084 GOLDWING SE 1990, Honda, 72K ml. like new, Pearl white, $6,000 a must see. Crystal River cell 772-528-6130 HARLEY CHOPPER '71 Old School Iron Head. Everything redonel A steal @ $5,500 352-308-2570/586-1917 HARLEY DAVIDSON 2002 Heritage Softail, Gar. kept. Lots of acc. Barely ridden. Like new! Sacrifice $13,900 (352) 302-0555 HONDA Goldwing '76, GL 1000 Exc. Cond. Many extras. $2,995 (352) 621-0982 HONDA VALKYRIE '98. 1 adult owner, .7500 mi. Just serviced. Loaded. Abolutely like newl $7,900. 352-634-4685 HONDA VTX 1300 2006, Custom, Black, Wndshld. Saddlebags, Back Rest, Like New! $7,000obo 220-2374 HONDA VTX 1800 R, black, 2003, 15k mi. adult driven, absolute perf. cond. windshield, light bar, hyper charger, engine guards etc. etc. call for full list of accessories $7,500 352-228-9514 LONGBO SCOOTER '05,6 mos. old. 150CC, Up to 65 Mph Showroom Cond. $1,295 obo 436-4132 SUZUKI BANDIT 1200 2003, 5k MI. Exc. cond. $3650 (352) 465-4574 SUZUKI BLVD C50 2005, 6000 miles, windshield, factory custom paint, saddle bags, gel seat,lilght bar, 50 M.P.G.. Beautiful cruiser $6,200 352-634-0430 YAMAHA 1989. 1100, cc, good cond., mellow yellow color, $1,600 firm (352) 560-3883 YAMAHA '85, Venture Royal, exc. cond., new tires, 37K ml. Asking $2,200 obo (352) 621-0927 CHEVY TRAIL BLAZER 2003 42000K, One owner ,V6. Dark Green W/Grey cloth Interior. & towing pkg $12,000 OBO. 352-726-9881 DODGE DURANGO 1999. 4x4. 80K mi., loaded, dual air & exhaust, exc. cond. $8,900 (352) 344-0505 FORD EXPLORER '98 XLT, V8, all pwr, extras, tow pkg. New tires, 1 owner, 97K, Runs great. $4950. (352) 628-5341 GMC SUBURBAN '99, leather, all options, full chrome pkg, cust. wheels/tires, hi ml. pert. maint. exc. cond. $7,000 (352) 422-3661 MERCURY 03, MOUNTAINEER, 4dr 83,500 ml, new tires, like new, $11,700. OBO (352) 503-6076 (352) 464-3322 $5001 Police Impounds For sale! Cars from $500! For listings call 1-800-366-9813 ext 7374 A WHEEL OF A DEAL 5 lines for only $37.951* *2 weeks in the *2 weeks Onlinel *Featured In Tues. "Wheels" SectionI Call Today (352) 726-3983 or (352) 563-5966 For details. *$5 per additional line Some Restrictions May Apply CHEVROLET 2500 '04, LT Silverado HD, XCab, Long Bed, 4 X 4 Duramax Diesel, 46K, Loaded] $21.900 (352) 489-7689 DODGE RAM 1500 2003, Heml. Quad cab, 75K mi.,$11,900 (352) 228-7033 FORD EXPLORER 1995 4x4 Limited, 223,000 miles, White, gray interior. $2,745. 352-382-3094 $5001 Police Impounds For sale! Cars from $500! For listings call 1-800-366-9813 ext 7374 CHEVROLET '93 G-20 van, Mark 11I, V-6 auto., AC PW PL new parts tires, $2,250 (352) 344-5003 CHEVY '01, Astro, IS, 4.3L eng., wheelchair lift, in the side door, 36k mi., $8,000. (352) 527-4247 CHEVY '77, 1-Ton, Box Van V8, automatic. AC good tires, $1,800. or trade for boat & motor. 228-2745 CHEVY STEP VAN '73, Good Cond. $1,995 (352) 621-0982 CHEVY STEP VAN '78. C30 Series. Good Work Truck $500 (352) 621-0982 CHEVY VENTURE 1999, synthetic oil, new brakes, dual ac, pwr door, red color $3300. 352-564-1390 moo%- INEEMOMMOMMESM.F- Hughey Lee, Jr. Notice to Creditors PUBUC NOTICE IN THE CIRCUIT COURT Mon.- Sat. 9 am- 6 p 24535 SR 40, Astor, FL Sun. Noon 6 pm VISIT OUR WEB SITE AT 5 9 i 352-759-3655 S a A Poord by Hond, May n b Engo F o.oou HodsUd.pdooa ara pro d.u wa a O o .o ,b to g MAtid offtow Crn'alio EywTwA,- A oa roo. by Hood. / .000. oubo.,0. 0i-- m I CHEVROLET 1980, 4x4, step side, built 350, 9" lift, 35 swampers, I ton running gear, runs & drives great$1900.0BO (352) 795-0848 CHEVY '1/2 TON PU '71, short wheel base, great shape, 350 auto. Edelbrock carb. Intake headers, 17" whis & tires Illness forces sale.$5850. 352-726-1711 Days 637-6519 after 6 I FrKEE KCIVIMVVAL Wr- ATV's, bikes, cars, jet skis mowers, golf carts. We sell ATV parts 628-2084 SUZUKI V Twin 2004, Twin Peaks 700. Mud Life Tires, wench, ITP rims + 4 Factory Tires. $5,500obo 352-341-4478 YAMAHA '97 Gas Golf Cart, 4strk. runs great $1200. 352-795-4770 L-U 2HlARLEY'S 1973 VW BEETLE Partly restored; This car WILL Be Sold to the best offer. (352) 527-1269 (352) 400-5369 '67 CHEVELLE SS396 Blue ext. black interior. Trophy Winning Classic! $15,000 (352) 422-1153 '82 CADILLAC Biarrltz Pristine, classic, collectible 9,137 orlg. miles. Black w/red leather Int. S.S. roof, custom made spoke wheels, new Redline tires. All rec. Incl. orig. invoice. $12.500 ml. Irans, rebuilt w/new converter. AC, Tilt whl, stereo, Rear end Nova 10bolt w/drum brakes, $9,000 paint job, $25,000 (352) 637-3810 $5001 Police Impounds For sale! Cars from $500! For listings call I orlnn AAM nQ 1.+ 1P7Q7A 14Y9-083 I0l T, 2007-CP-400 Estate Gordon E. Herndon Notice to Creditors PUBLIC NOTICE IN THE CIRCUIT COURT FOR THE FIFTH JUDICIAL CIRCUIT IN AND FOR CITRUS COUNTY, FLORIDA Case No.: 2007-CP-400 N RE: ESTATE OF CORDON E. HERNDON, Deceased. NOTICE TO CREDITORS The administration of he estate of Gordon E. Herndon, deceased, whose date of death was August 28, 2006 and whose social security number Is XXX-XX-8008. Is pending In the Circuit Court for Citrus County. lorida, Probate Division, the address of which Is 110 North Apopka Ave- nue, Inverness, .Florida 34450. The names and addresses of the personal representative and the personal representative's attorney are set forth be- All creditors of the de- cedent and other persons having -claims or de- mnands against decedent's estate on whom a copy of this no- tice PE- RIODS SET FORTH IN SEC- TION 23, 2007. Personal Representative: /s/ Lance L. Herndon 3655 W, Anthem Way Ste. A109. PMB #405 Phoenix,AZ 85086 Attorney for Personal Representative: My Florida Probate. P.A. /s/ Dawn Ellis, for the firm Attorney for Personal Representative Florida Bar No. 0091979 P.O. Box 952 Floral City, Florida 34436-0952 Telephone: (352) 726-5444 Published two (2) times in Citrus County Chronicle. August 23 and 30. 2007. 150-0830 THCRN 2007-CP-604 Estate Patricia A. Lolly Notice to Creditors Summary Adminstration PUBLIC NOTICE IN THE CIRCUIT COURT FOR CITRUS COUNTY, FLORIDA PROBATE DIVISION File No.: 2007-CP-604 IN RE: ESTATE OF PATRICIA A. LOLLY Deceased. NOTICE TO CREDITORS (Summary Administration) TO ALL PERSONS HAVING CLAIMS OR DEMANDS AGAINST THE ABOVE ES- TATE: You are hereby noti- fied that an Order of Sum- mary Administration has been entered In the es- tate of PATRICIA A. LOLLY, deceased, File Number 2007-CP-604, by the Qir- cult Court for Citrus County, Florida, Probate Division, the address of which is Clerk of the Cir- cuit Court, 110 N. Apopka Ave., Inverness, FL 34450; that the decedent's date of death was November 24. 1999; that the total value of the estate Is 'SO and that the names and addresses of those to whom it has been as- signed by such order are: RICHARD E. LOLLY 8216 W. So.Hampton Ct. Homosassa, FL 34448 ALL INTERESTED PERSONS ARE NOTIFIED THAT: All creditors of the es- tate of the decedent and persons having claims or demands against the estate of the decedent other than those for whom a provision for full payment was made in the Order of Summary Ad- ministration August 23. 2007. Person Giving Notice: /s/ Richard E. Lolly 8216 W. So.Hampton Ct. Homosassa, FL 32648 Attorney for Person Giving Notice: ROBERT S. CHRISTENSEN Attorney Florida Bar No. 0075272 PO Box 415 Homosassa Springs, FL 34447 Telephone: (352) 382-7934 Fax: (352) 382-7936 Published two (2) times In Citrus County Chronicle August 23 and 30, 2007. 151-0830 THCRN 2007-CP-630 Estate Floral City, FL Phone: 352-637-1141 Vehicle Information: 1996 Chevrolet VIN Number: 1GCEC14W81Z106830 Interested parties should contact Carter's Auto Recycling at 352-637-1141 /s/ Marge Carter, Owner Published one (1) time In Citrus County Chronicle, August 30, 2007. 157-0830 THCRN CARTER'S AUTO RECYCLING PUBLIC NOTICE AUCTION The following vehicle will be sold at public auction, per FL Stat. 713.78, com- mencing at 9:00 AM on September 14. 2007, at Carter's Auto Recycling, 8795 South Florida Ave., Floral City. Florida: Auction date: 9/14/2007 Location: Carter's Auto Recycling 8795 South Florida Ave. CnIRus COUNTY (FL) CHRONICLE, 12C THURSDAY, AUGUST 30. 2007 FOR CITRUS COUNTY, (352)746-6683 FLORIDA PROBATE DIVISION Published two (2) times In FILE NO. 2007-CP-630 Citrus County Chronicle, August 30 and September IN RE: ESTATE OF 6, 2007. HUGHEY LEE, JR. 161-0906 THCRN DECEASED. Keepit Safe Storage PUBLIC NOTICE NOTICE TO CREDITORS This Is to nolir, Anthony The administration of Donadio rnma re entire the 'estate of Hughey Lee, cor.enr. ,' ,our -ociage: Jr., deceased, whose oi 1 miio- c.-,rigr.ea to date of death was May auction If payment in full S17,-2007. Is pending in the is not received by 4:00 Circuit Court for Citrus P.M. on September 11, County, Florida, Probate 2007, at Keepit Safe Stor- Division, the address of, age & Moving Center. -which Is 110 North 5050 Norvell Bryant High- Apopka Ave., Inverness, way, Crystal River, FL,- Florida 34450. The names and addresses of thI per- /s/ Amy Kellner sonal representative and Keepit Safe Stg. & Mvg. the personal (352)746-6683 representative's attorney are set forth below. Published two (2) times In -All creditors of the de- Citrus County Chronicle, . cedent and other persons August 30 abd September having claims or de- 6,,2007. mands against 162-0906 THCRN' decedent's estate on KeepitfSfe Storage whom a copy of this no- PUBLIC NOTICE twice Is required to be served must file their This Is to notify Proyat Enos claims with this court that the entire contents of WITHIN. THE LATER OF 3 your storage lot .,.il -MONTHS AFTER THE TIME consigned to auctior. II OF THE FIRST PUBLICATION payment In full Is not re- -. OF THIS NOTICE OR 30 celved by 400 P.M. on .DAYS AFTER THE DCAiE OF Septfember' 11, 2007. at, SERVICE OF THA CE:, O Keepit Safe Storage .&' THIS NOTICE ON THEM. Moving Center, 5050 All other creditors of Norvell Bryant Highway, the decedent and other Crystal River, FL persons having claims or Crystal River FL. demands against /s/ Amy Kellner decedent's estate must Keepit Safe Stg. & Mvg. file their claims with this (352)p6-6683 court WITHIN 3 MONTHS (352)746-6653 AFTER THE DATE OF THEI Published two (2) times In FIRST PUBLICATION OF THIS Citrus County Chronicle, ALL NOTICE LAIMS NOT August 30 and 'September ALL. CLAIMS NOT SO 6, 2007. FILED WILL BE FOREVER 6.00T7 CN BARRED. 2 163-0906 THCRN NOTWITHSTANDING THE 2007-CP-684 Estate of TIME PERIOD SET FORTH Sheflo A. Digman ABOVE, ANY CLAIM FILED Notice to Creditors TWO (2) YEARS OR MORE PUBLIC NOTICE AFTER THE DECEDENT'S DATE OF DEATH IS IN THE CIRCUIT COURT BARRED, FOR CITRUS COUNTY, The date of the first FLORIDA publication of this Notice PROBATE DIVISION is August 23, 2007. File No. 2007-CP-684 Division Probate Personal Representative: /s/ Heather Fox IN RE: ESTATE OF 7309 La Tour Drive SHEILA A. DIGMAN , Sacramento, CA 95842 Deceased. , -Attorney for Personal NOTICE TO CREDITORS Reps/Joh Neon, Esq. The administration of, Florida Bar No.: 0727032 the estate of SHEILA A.: Slaymaker and Nelson, DIGMAN, -deceased, PA. whose date of death was 221A Hi:l',.,A, 4J4 We:I I .ril 10 21n07, is pending r,,r..rs F.'Inaa i. i I, r, inr. Ci, h:ul Court for Clt- Telephone:-(352) 726-6129 rus County. Florida, Pro- Fax: (352) 726-0223 bate Division: the address of which Is 110 N. Apopka Published two (2) times In Avenue, Inverness; FL Citrus County Chronicle 34450. The names and August 23 and 30, 2007. addresses of the personal 152-0830 THCRN representative and the 2007-CP-667 Estate personal representative's Sarah K. Austin attorney are set forth be- Notice to Creditors 511 crdltcr, -f-th-lde PUBLIC NOTICE O r.T FIRT I IN .-i,-H1 ,l il Ci .:t, f ,. .Fl h ,i , a HE I'hsII-NCH TIIL N i, r..: * ,1...3, cl 1 : 'r l i. . . p Baf l.i i.. 11., i : r S serve Turrl [lie Irinoh S FILE NO. 2007-CP-667 claims with this court IDN RCE:TATE O WITHIN THE LATER OF 3 IN RE: ESTATE OF 'MONTHS AFTER THE TIME S ARAH K AUSTIN, ., OF THE FIRST PUBLICATION-. a/ka Sarah Katnryn OF THS NOTICE OR 30 /Ausfin, DAYS AFTER THE DATE OF, *a/k/a KathrynS. Austin, SERVICE OF A COPY OF a/k/a Kathryn Sarvis THIS NOTICE ON THEM. Austin, All other, creditors of a/k/a KthryiN n Sarah the decedent and other Ausln A persons having claims, or a,'ka Kathryn Austin. demands against a/k/a Kathy Ausin. decedent's estate. must a/k/a K S Austin file their claims with this .-ao m court. WITHIN 3 MONTHS NOTICE TO CREDITORS AFTER THE DATE OF THE NOTICE TO CREDITORS rT PIB I -TIr. OF THI (Intestate- i ICr'.- .- ... *' Fi.orio ,.i.l,',r, .i LL' : L-.r1F I Jc-rTFILED T ohe ad, 3Irl.h l,.'.,, 0.I re r ~- 1 [MHE. iE.,l PEs DE : .estate of SARAH K. H di - A jrlrn a/k/a -pAroaH 3 9. .i-C THE FL .'Ie '1 ARVIS A US11N ALL.HrN AUSTIN, PESON A.'torn foTE WILL BE RE NT I ARVIS AuSiN. e NOTWITHSTANDING Sa/k/a KATHRYN. SARAH., THE TIME PERIODS SET AUSTIN; a/k/a '-THIl, rI FORTH ABOVE, ANY SIi.-i.T .l,, / AUSTIN. CLAIM FILED TWO- ,(2) A r F ac'ed e a Y, AUSTIN. YEARS OR- MORE AFTER daecea.. File Number. THE DECEDENT'S DATE OF ,P.C" Is pending In DEATH IS BARRED. m cn u Court for Citrus The date of first publl- Sounty, Florida, Probate cation of this'Notice Is Divison, the address of catugusot30, ie2007. Which Is 110 North August 3007. Apopka Avenue, Inver- Personal Representative: ness, Florida 34450. The Pers l Representative names and addresses of Pat ..Pric3i ME Crg g the personal representa- 57/WPailiveraRd tive and the personal _5WHa 151R representative's attorney Homosassa, FL 34448 a.re set forth below. ALL INTERESTED PERSONS Attorney for Personal ALL INTERESTHTD PRSON' -Representative: ARE NOTIFIED THAT.: /s/John S. CIardy III Fiorida'Bar No. 123129 All creditors of the dece- Floridr Clardy Law Frm PA deedent -and other persons PORBoxS2410 having claims or de- Crystal River, FL mands against 34423-2410 decedent's estate Includ- Telephone: (352) 795-2946 Ing unmatured, contIn-(352) 795-2946 gent or unlquidated Published two (2) times in claims, on whom a copy Citrus County Chronicle, of this notice is served August 30 and September must file their claims within 6, 2007. this court WITHIN, THE LATER OF THREE MONTHS 164-0906 THCRN AFTER THE DATE OF THE 2007-CP-731 Estate of FIRST PUBUCATION OF THIS CarlA. PaAm-ero NOTICE OR THIRTY (30) Notice to Creditors DAYS AFTER THE DATE OF PUBLIC NOTICE SERVICE OF A COPY O OF THIS NOTICE ON THEM. IN THE CIRCUIT COURT All other creditors of the FLORIDA , decedent and persons PROBATE DIVISION having claims or de- File No. 2007-CP-731 mands against t Division Probate decedent's estate, includ- be Ing unmatured, cantin- IN RE: ESTATE OF gent or unliquldated CARL A. PALMIERO claims must file their Deceased. claims with this Court w 1. WITHIN THREE (3) MONTHS NOTICE TO CREDITORS AFTER THE DATE OF SERV- T ICE OF A COPY OF THIS The administration of NOTICE ON THEM. the estate of CARL A. PALMIERO, deceased, All other creditors of the' whose 'date of death was. deceden't and persons October 9, 2005, is pend- having claims or de- Ing Inthe Circuit Court for mands against the Citrus County, Florida, Pro- .dece-dent's estate must bate Division; the address file their claims with this of which Is 110 N. Apopka .. - court WITHIN / THREE Avenue. Inverness. FL -MONTHS AFTER THE 'DATE 34450. The names and OF THE FIRST PUBUCATION addresses of the personal OF THIS NOTICE representative and the personal representative's A. LL CLAIMS NOT SO FILED' attorney are set forth be- WILL BE FOREVER BARRED. i,', -. -Ii .:l.'rc.3r. of the de-' *-. Frr,, aare c.l me Ilr1 OuDii. r ee,',T ard other persons, :.-iirr, 'l Ir or IC l.e I: r".Ing cl.ms or de- August23.,2007. msnd., against August2 acar, estate on -Personal Representative: whom a copy of this no- /s/ Gwendelyn Austin twice Is required to be Russell served must file their -e G. '_ 3uI'Io'Lak, H clalm-; ,..Iththhi .--...jrt SON. H AFTER 'THE ilh'E Arrne,r.e, Icr P r,.nal OF THE FIp1 PLiBLCiC. ,,i: respre..s.-r.r.e OF THIS NOTICE OR 30 /s/ Daniel J. Snow, DAYS AFTER THE DATE OF DANIEL J. SNOW, ESQUIRE SERVICE OF A COPY OF Florida Bar No.: 0794820 THIS NOTICE ON THEM. 203 Courthouse.Square All other creditors of Inverness, FL34450 the decedent and other Telephone: (352) 726-9111 persons having claims or Facsimile: (352) 726-2144 demands against decedent's estate must Published two (2) times In file their claims with this Citrus County Chronicle court WITHIN 3 MONTHS August 23 and 30, 2007 AFTER THE DATE OF THE FIRST PUBLICATION OF THIS 160-0906THCRN rrNOTiCE . S' -KeepitSofe Storage LL CLL ii r FILED ,'" PUBUC NOTICE WITHIN IHE lIME PERIODS TIN Ge r ,,'Gone SET FOr. ill III .ECii,;rj S mo n 1' rTi ir, Gene 733.702 OF THE FLORIDA Simontes Iof'your storage PROBATE CODE WILL BE contents of your storage FOREVER BARRED. lot will be consigned to NOTWITHSTANDING auction nf payme Infu THE TIME PERIODS SET Is not receivedd by 4:00 FORTH ABOVE, ANY P.M. on September 11 'R FILED TWO (2) ag7 KeepMoving Cnter,- YEARS OR MORE AFTER .. -0 Moving Centerr: THE .DECEDENT'S DATE OF Nar.ii, Br,ar,t High- DEATH IS BARRED. ... .. r,siairi.sr FL. The date of first publP /s/ Amy Kellner cation of this Notice Is K epit Safe Stg. & Mvg. August 30, 2007. Personal Representative: /s/ Patricia J, Palmlero *4335 N. Saddle Drive Beverly Hills, FL 34465 Attorney for Personal Representative: /s/ John S. Clardy III Florida Bar No. 123129 .rnali Clardf La FiJ,. PA PO B6 o24 10 'Crystl River, FL : -34423-2410' i * Telephone: (352) 795-2946 Published two (2) times In Citrus County Chronicle, August 30 and'September 6,2007. 165-0906 THCRN 2007-CP-743 Estate of Warren N. Smith I : Notice to Creditors PUBLIC NOTICE IN THE CIRCUIT COURT FOR CITRUS COUNTY, - FLORIDA , PROBATE DIVISION' File r,: 2.. I' -.-' .J3 D I.:.'r. Fr.:r, i IN RE: ESTATE OF WARREN N. SMITH Deceased. NOTICE TO CREDITORS " The administration of the estate of WARREN N. SMITH, deceased, whose date of death was June 7, 2007, Is pending in the Circuit Court for Citrus County, Florida, Probate Division; the address of which Is 110 N. Apopka Avenue, Inverness, FL 34450. The. .names l.,h' addresses of the persoriql 'EP.ICE ..OF A COPY OF rHir. NUilCE ON THEM. All other creditors of the decedent and other persons having claims or demands against decedent's estate must file Itheir claims with this court WITHIN 3 MONTHS AFTER THE DATE .OF THE FIRST PUBLICATION OF THIS NOTICE. ., ALL CLAIMS NOT FILED WITHIN iHE. TME PERIODS SEi FOPrrH August 30, 2007. ,. F r ..-. 'o i p i:.' Er : .' ljil. . j. J r.n 1.j.0, III PO Box 2410 -.-Crystal River, FL 34423-2410 < .:.rr.- .:..' i '-[..:.,-'3i r< a.e.eraarii - I.;hr,, : Clara III fic.'ra 0, b':. i.. 2 -Crider Clardy Law Firm PA PO Box 2410 Crystal River, FL. 34423-2410 -Telephone: (352) 795-2946 Published two (2) times In Citrus County Chronicle, August 30 and September 6, 2007. 736-0905 W-TUCRN 'Citrus County Fleet Management PUBLIC NOTICE The Citrus County Board of County Commissioners WillI be-selling surplus property and equipment via the"- Internet" at govdeals.com from August 15, 2007 to September 5, 2007. Published seven (7) times, consecutively, starting 'A.ugu.i i' Ir.rough Sep- il-.rl.r 5 2,. J 159-0830 THCRN Citrus County Tourist Development Council PUBLIC NOTICE PUBLIC NOTICE NOTICE IS HEREBY GIVEN that the CITRUS COUNTY TOURIST DEVELOPMENT COUNCIL will hold a regular business meeting Wednesday Seatember 5 2007 at 9-00 a m at the Lecanto Government Building 3600 W Sovereign Path Room 166 Lecanto FL 34461 Any person desiring further Information. regarding this meeting may contact the Executive Offices of the Board of County Commissioners, 110 N. Apopka Ave- nue, Inverness, Florida. 34450 (352) 341-6560. -r,, 5.c...-. .q jirir'. l, .: .3'.- i 3': ;- T T,,",: djli.;.r. .l i,. T I r,.j 'ii ,,g O j.."- ,ic 3 j i. III ,':, i O. r i.,:,1 Ii' 31,,i Ti.rI ;r,.:,ul. .,ri I a Ir.o Cc u -.,j -.T.,ir.I.[iC.lr L'ni;: 00 NT -ppka Aeriue, iR;.o'ri^02.lWerrieadA-rna rr e I r. n u i .u )I r. or r. r :. ;pee.:hI i'lmp. ;01. uh:, iri- CIr, t-.-ono,-,-i- :i.,2 I " -:5'i DENNIS DAMATO, CHAIRMAN BOARD OF COUNTY COMMISSIONERS OF CITRUS COUNTY, FLORIDA NOTICE TO THE PUBLIC -.., cr.,r.. .ro ae,:ia ioo o on-- al ,. d -:1.i.Iu r. Ir 1..I r :. e' r i .-.g.3 B ,, ..irr, r e, :pec. .: I r,, rn, ,3Ti .- r..l -,.3 ai ir.i, ,T.e nrhg .-.III -i.c - cc'i" o ..ri ir.e i:c .dic -g-. ona ir01 .u.:r, iir-, :.:. ,',.,,, -,'. -, I.:. p,.I-JM iIr.ol a j rOathi ,.r co.i of "r,. r.-,.: 3ir.g I; m oo.- i'hl cr, rac.,ra l.-:1j1 e -Il- S T,.r,, 3r, .a ,l3 r, -- Jc.L.r .r.i.:r. rr.c jc.pE, .I : i t be r Published one (1) time in the Citrus County Chronicle. Auaust 30 2007 ,. i fu .nosa'WcV/a;,r;. -. .-, Deu'cn Sov ili n e p at S.:,rste A -,i *,:r. aui, d cora .,:urie .. PUBLIC NOTICE IN THE CIRCUIT COURI. .. . Delendanl(s) " NOTICE OF RE-SCHEpULED FORECLOSURE SALE NOTICE IS HEREBY GIVEN pursuant to an Order Re- scheduling Foreclosure Sale dated August 20, 2007 and entered In Case No. 2007-CA-12 of the Circuit Court of the FIFTI- Ju.j.:ll Cir.cuit Ir. n and f.:,r CITPI.I County, Flor- Ida wl-t's'.-. DEui;Mt-HE .l, 14rI'-r-L TRUST COM- ,PANY, r. inu'iE ,'. r.C,-:,. N .'4rArJLE, ABS CAPITAL I INC. TRUST 2003-HE3, is the Plailntiff, PUBUC, RECORDS OF CITRUS COUNTY, FLORIDA A/K/A 813 GREENLEAF AVENUE, INVERNESS, FL 34450 22, 2007. Betty Strifler Clerk of the Circuit Court (COURT SEAL) By: Judy Ramsey Deputy Clerk Put.iis.i-,1.i r..-:. .. '' ,iT ir. i-, ,iirrus County _hronicle: i,.J l 0 and i..:,plurnr., o 0l: " U ;,, 218'.o ,D. rjn .C:o ..i_,r.ac.i.r.r, 170-0906 THCRN 2007-CA-1110 Suntrust Bank, Vs. John Corrado. Notice f Sale PUBLIC NOTICE IN THE CIRCUIT COURT OF THE FIFTH JUDICIAL CIRCUIT, IN AND FOR CITRUS COUNTY, FLORIDA CASE NO, 2007-CA-1110 SUNTRUST BANK, Plaintiff. vs. JOHN CORRRADO, an Individual; et al., property owner as of the date of the ULis Pendeens must file a claim within sixty (60) days after the sale. The legal description of the property be- ing sold is described herein: LOT 33 IN AN UNRECORDED SUBDIVISON AND BEING MORE PARTICULARLY DESCRIBED AS FOLLOWS: THE NORTH 11940 MIndy Point, Homosassa, Florida 34446 Dated: August 22, 2007. 921-0830 TU/W/THCRN CITRUS COUNTY SCHOOL BOARD PUBLIC NOTICE The Citrus County School Board will accept sealed bids for: BID# 2008-19 COSMETOLOGY SUPPLIES Bid specifications may be obtained on the CCSB Ven- dorBId website; Automated Vendor Application & Bid- der Notification System: www vendorbld net/citrus/ Sandra "Sam" Himmel Superintendent, Citrus County School Board Published three (3) times in the Citrus County Chronicle August 28, 29 and 30, 2007. 158-0830 THCRN Citrus County Board of County Commissioners PUBLIC NOTICE NOTICE OF HEARING ON ORDINANCE The public is hereby notified that the Board of County Commissioners of Citrus County, Florida, Intends to conduct a public hearing to consider an ordinance entitled: AN ORDINANCE OF CITRUS COUNTY, FLORIDA, AMEND- ING CHAPTER 102 OF THE CITRUS COUNTY CODE BY AMENDING SECTION 102-3; MINIMUM STANDARDS AND CONSTRUCTION SPECIFICATIONS; BY AMENDING SEC- TION 1Q2-138, METERS; PROVIDING FOR SEVERABILITY; PROVIDING FOR INCLUSION IN THE CODE; PERTAINING TO MODIFICATIONS THAT MAY ARISE FROM CONSIDERA- TION AT PUBLIC HEARING; AND PROVIDING FOR AN EF- FECTIVE DATE. in the Board of County Commissioners' Meeting Room,. Citrus County Courthouse, 110 North Apopka Avenue, Inverness, Florida on the 11th day of September, 2007, .at 2:15- pairment should contact the County Administrator's Of- fice, 110 North Apopka Avenue, Inverness, Florida 34450, (352) 341-6560, at least two days before the meeting. If you are hearing or speech- ImpqIred, use the TDD telephone (352) 341-6580. DENNIS DAMATO CHAIRMAN BOARD OF COUNTY COMMISSIONERS OF CITRUS COUNTY, FLORIDA u,.H'ii r,. one (1) time In the Citrus County Chronicle u). a,",.j 1 2007. 169-0906 THCRN l- ..-001256 Ernestine Cookson Revocable Trust Vs. Robert A. Keough, Notice of Sale -- -- PUBLIC NOTICE IN THE CIRCUIT COURT OF THE FIFTH JUDICIAL CIRCUIT ,OF FLORIDA, IN AND FOR CITRUS COUNTY S Case No.: 09-2007-CA-001256 EFirNsii EL COO.SON REVOCABLE TRUST DaTEd L-uG~.-i J 1993 PLAINTIFF, -vs- ROBERTA. KEOUGH, TAMMY R. KEOUGH and CITRUS COUNTY, FLORIDA, b. _-;__O.... NOTICE OF SALE NOTICE IS HEREBY GIVEN pursuant to an Order of Final Judgment of Foreclosure dated August 22, 2007, en- tered in Civil Case No. 09-2007-CA-00J256 be6t bidder for cash in the Jury Assembly Room of the CI'rur C.,ujr,r, .Courthouse, 110 N. Apopka Avenue, In- ,.rre.. FL 544j", at 11:00 a.m. on September 20, 2007, the following described property as set forth In said Final Judgment, to-wit:(I1)(a), FLORIDA STATUES. Dated at Inverness, Florida, this 22 day of August, 2007. Betty Strifier Clerk of the Circuit Court Citrus County, Florida By: /s/ Judy Ramsey Deputy Clerk, IF YOU ARE A PERSON WITH A DISABILITY Chronicle on August 30 and September 6,2007. 155-0920 THCRN DIssolution of Marriage Ericka L RlchwlneDISSOLUTION OF MARRIAGE TO: Adolfo Ramon Perez, Jr. last known address: Unknown YOU ARE NOTIFIED that an action has been tiled against you and that you are required to serve a copy .pg...tour writter) defenses,,if ar., 50. Il on. trc.Ka .Wee ' RlchwIne Perez whose addre':. IC., B.:., 1061 Bunr,- nell, FL 33513 on or before October 1, 2007, and file the rriglnal with the clerk of this Court at 110 N. Apopka e-..je Inverness, FL 34450, before service on Petl-" tton- f C BETTY STRIFLER CLERK OF THE CIRCUIT COURT By: /s/ L. Johnson Deputy Clerk Published four (4) times In the Citrus County Chronicle - August 30, September 6, 13 and 20, 2007. 922-0831 W/TH/F CRN CITRUS COUNTY SCHOOL BOARD PUBLIC NOTICE The Citrus County School Board will accept sealed bids for: BID# 2008-20 ROOFTOP & SPLIT SYSTEM AIR CONDITIONING UNITS Bid specifications may be obtained on the CCSB VendorBid website: Automated Vendor Application & Bidder Notification System: www vendorbld net/citrus/ Sandra "Sam' Himmel Superintendent, Citrus County School Board Published three (3) times in the Citrus County Chronicle August 29, 30 and 31,2007. 167-0906 THCRN 09 2007 CA 001656 U.S,Bank National Assoc. Vs Cole Mallett, et al, Notice of Foreclosure Sale PUBLET;, T10 N. Apopk6 Avenu,. Fn- verness, FL 34450 within 2 working days of your receipt of this notice, i ,ou ae- r.eaing :,r Voice Impaired call 0E.Jer a rr.i; 2.r.a a.j ory -ugu. jo -,.V BETTY STRIFLER Clerk of the Circuit Court By: /s/ Judy Ramsey S'. . Deputy Clerk Published two (2) times in the Citrus County Chronicle, ,August-30 and September 6,2007.- 134-0830 THCRN 2007-CC-2572 Betty Strifler, Vs. Thomas Rledllnger and T. Richard Hogin, Notice of Action- Constructive Service PUBLIC NOTICE IN THE CIRCUIT COURT OF THE FIFTH JUDICIAL CIRCUIT IN AND FOR CITRUS COUNTY, FLORIDA CASE NO. 2007-CC-2572 BETTY STRIFLER, CLERK OF CIRCUIT COURT, Plaintiff, -vs- THOMAS RIEbINGEfR'aid T. RICHARD+HAGIN, Defendants. NOTICE OF ACTION ' CONSTRUCTIVE SERVICE TO: THOMAS RIEDLINGER, if alive and If deceased, his unknown heirs, devisees, grantees, assignees, creditors, llenors and Trustees and all parties claiming Interest by, through, under of against him, and all parties having or claiming to have any right, title or Interest In the property herein described. Address Unknown YOU ARE NOTIFIED that an action for interpleader has been flied against you and you are required to serve a copy of your written defenses, If any, to it on. GLEN C. ABBOTT, ESQ., Plaintiff's Attorney, whose ad- dress is Post Office Box 2019, Crystal .River, Florida 34423, on or before Sept. 10, 2007, and flie the original with the Clerk of this court either before service on Plaintiff's At- torney or Immediately thereafter: otherwise a default will be entered against you for the relief demanded In the complaint or petition. WITNESS my hand and seal of this Court on the 2nd day of August, 2007. BETTY STRIFLER Clerk Of Courts (COURT SEAL) By /s/ M. Evans ... -Deputy-ClerO Published four (4) times In the Citrus County Chronicle, August 9, 16,.23 and 30, 2007. 168-0906 THCRN 09-2007-CA-1721 HSBC Bank USA Vs. Woleta Castro Notice of Sale PUBLIC NOTICE IN THE CIRCUIT COURT Electronic Registraton Systems, Inc. as nominee for Novastar Mortgage, Inc.; HSBC Bank USA, N.A,, as trustee on behalf of ACE Securities Corp. Home Equity Loan Trust and for the reg- istered holders of ACE Securities Corp. Home Equity L.o,', iju.i r iI.-. t.:,. HV.: ,.et Backed Pass-Throughlo- leta Castro are defendantss, I will sell to the hlgest- 5mr oi4io-wn. -. .., , '".'..<.:. , LOT 156-0830 THCRN CITY OF INVERNESS PUBLIC NOTICE Notice is hereby given that pursuant to Section 166.045 Florida Statute, the City of Inverness will hold a Public Hearing at 5:30 p.m. on October 2, 2007, In the Council Chamber located at 212 West Main Street to deter- mine If the city should exercise Its option to purchase the property located at 201 N. Mill Avenue and 203 N. Mill Avenue, Inverness, Florida and described as: Lot 7, Block 122, less the North 13ft; and Lot 8, Block 122. and the North 13ft of Lot 7, of the Town of Inverness, A/K/A City of Inverness, a subdivision according to the Plat thereof recorded In Plat Book 1., Page 36, of the Public Records of Citrus County, Florida. which record Includes the testimony and evidence upon which the appeal Is to be based. CITY OF INVERNESS Deborah J. Davis City Clerk Published one (1) time In the Citrus County Chronicle, August 30, 2007. 171-0906 THCRN 07-CA-1542Accredited Home Lenders, Inc. Vs. John P. Zore et al.Notice of Foreclosure Sale. PUBLIC NOTICE IN THE CIRCUIT COURT OF THE FIFTH JUDICIAL CIRCUIT OF FLORIDA IN AND FOR CITRUS COUNTY CASE NO. 07-CA-1542 ACCREDITED HOME LENDERS, INC. A CALIFORNIA CORPORATION, Plaintiff, vs. JOHN PZOREAKA UVING, 1.1 i1s pendens must file a claim within 60 days - after-thesale. ... ..... .... BETTY STRIFLER As Clerk of the Court By: /s/Judy Ramsey As Deputy Clerk Dated this 22nd day of August, 2007. IMPORTANT In accordance with the Americans with Disabilities Act, persons needing a reasonabJe accommodation to',. participate in this proceeding should, no later than*' seven (7) days prior, contact the Clerk of the Court's'. disability coordinator at 352-637-9853, 110 N. APOPKA . AVE, INVERNESS, FL 34450-4299. If hearing Impaired.,1 contact (TDD) via Florida Relay System. Published two (2) times in the Citrus County Chronicle, August 30 and September 6, 2007. 166-0906 THCRN 2006-CA-5566 Clftifinancial Mortg. Co: Vs. Pearl R. Leffler, et al Notice of Foreclosure Sale PUBLIC NOTICE IN THE CIRCUIT COURT OF THE FIFTH JUDICIAL CiRCUIT IN AND FOR CITRUS COUNTYFL; A.M., on the 20th day of September, 2007, the follow- ing described property as set forth In said Fnal UNE 18 Us Penidens must file a claim within sixty (60) days after the sale. WITNESS MY HAND and the seal of this Court on August 21,2007. Betty Strifler Clerk of the Circult Court (COURT SEAL) By: Judy Ramsey Deputy Clerk Published two (2) times In the Citrus County Chronicle August 30 and September 6, 2007 F06020419 ASSOCIATES-CONV-B-tiaw CTRus COUNTY (FL) CHRONICLE tmm m m THURSDAY, AUGUST 30, 2007 13C K,-, SUMMER SELL-DOWN AMERICAS #1WARAT IFOR NLY-I OVER 200 CARS, TRUCKS. UANS & SUU's for PFENIES ON THE DOLLAR ,NW THRU LA Citrus Residents can n select from ouer 50 new SuzukI Forenza's and Reno's tor onDiv MI.fmil I fm) I '7H hi" / I III ti/il I/mo m~'~Im 95BROS. SUZUKI il mwI.L N15 SUNCOAST BLVD. o CRYSTAL RIVER, FL Wyo ife! P" OFTBI MAY O B OWE NovsV iOTHEROFEROR Al iETMCE 6D% OFF FROM OMUMIL&LRP 00 NMI(.USUPER IINTII PAYMENT 15TM FMLPAY4EN OTE~OW MCMON THE WICLS PiNAlICE CONTRACT MSlWB BY THEDEALER FORMTiEFltST DMONMINTHSIiTEFOR OF ACASH DOICQJNTARFERT)IAT THE NDMtv Rt4PA18 TSEGAL TO THE AMOXJU SHN * ON THE FPIMCE CONTRACT FORI THE RUIAJIR OF THE TOEi&PR AMOUNT FIIAJCED. AND TERMIIOF LOAN WILLJJMBY Til EWI4C.E pURCmASEO PEr"SMOE AND OTHER IAClUASpRl&MpaFP CERyTFIOATEA:aLENE R WLDEFERAME FV4AL pRAppROftAOLAIN3T SEM DEALER FOR DEAILS LOAN AWFONL IS5MSSW TO UNW1JM ISCEW REOWEIEAMES AND) REOINRED K CASH DOM AWNFRTiSI,916 PER M" TPAYMENT BASED ONhSELECT IE4IM1UTH 32 CASHH DOMN OR TRADE EOITY PLUS 10, TAGANDD "EEALLERFEE B EAIESJIAO J dENATTAB10QCAER PWIChIABER LA LPFRALL, RAJEBAIM PROV4 WWI SCJT TO Cla ATIhORWTT NOTICE NOWL*IEMd WMD4NEXT EMW WTH PAPROEO CREDIT SEE DEAL.ER FOR DETAUl i ~ ~ 14C THURSDAY, AUGUST 30, 2007 CITRus COUNTY (FL) CHRONIC$ R T 2008 VERSA FREE 24 HOUR RECORDED MESSAGE WITH INFORMATION AND SPECIALPRICING ON THIS VEHICLE 800-325-1415 EXT. 801 CD PLAYER AIR CONDITIONING POWER STEERING 12,888 HE TENT 2008 TITAN "CREW CAB" AUTOMATIC V-8 4 DOORS I POi sW 9,8 I SSAGCE rmN - AND SPECl P RIG4 : ON THIS VEI1CLE 800 6.-1415 EXT. 602 WER WINDOWS 38 .-r A E 24 HOUR RECORDED O'T MEAOE WTH INFORMATION S AND SPECIALPRICINO /1(-I ON THIS VEHIOLE 800-325-141B EXT, 810 2005 ALTIMA 1~944 1I1O EKT. _i, '"L ND 6 0&B5141 EXT oi '2 05I E 1 U U - s17,888 J-.--,' FRE "4 HOUR RECORDED iAO WT INFORMATION / I ON THlIE VHIE ii 800-a5-141B exT B16 FREE 84 HOUR RECORDED -i MEBSAGE WITH INFORMATION - W AND SPICIALpRICING S ON THIB VEHICLE -J 000-32-1416 EXT. 817 FREE I4 HDUR RECORDED MESSAgE WITH INFORMATION I/ l( IU\ ANDEPECIALPRICING ON THIS VEHICLE SS0-8-1418 EXT B '1 4888 824HOUR 218 EXT 81 Me AE 8PECIALRICIN ON THIS VEHICLE I- o800-32S-1415EXT.813 2001 MAXIMA 2000 FRONTII MAXIM1 FREE 24 HOUR RECORDED MESSAGE WITH INFORMATION (/ Lf II AND 8PECIALPRIOING ON THIS VEHICLE 60042B-141B EXT. B19 $8,888 FREE 4 HOUR RECORDED SMEAGE WITH INFORMATION 6 MS O AND PHISALERICINE ,'- ON rHIG VEHICLE --= 800-38-1415 EXT 8a0 LMIN aEATION (jj.RUOINIV FIND OUT EXACTLY WHAT YOUR CAR IS WORTH, NO MATTER WHERE YOU PLAN TO BUY! CALL THE INSTANT APPRAISAL LINE... IT'S FREE! 800-3 2-3008 OCALA NISSAN Ii . Contact Us | Permissions | Preferences | Technical Aspects | Statistics | Internal | Privacy Policy © 2004 - 2010 University of Florida George A. Smathers Libraries.All rights reserved. Acceptable Use, Copyright, and Disclaimer Statement Last updated October 10, 2010 - - mvs | http://ufdc.ufl.edu/UF00028315/00990 | CC-MAIN-2019-22 | refinedweb | 69,812 | 78.85 |
Scroll down to the script below, click on any sentence (including terminal blocks!) to jump to that spot in the video!Cool, got it!
Course: Question and Answer Day: March 27th, 2013 Tutorial
From Philipp Rieber
Hi, I’m using swiftmailer’s file spooling and I’m flushing the queue every minute using a cron task:app/console swiftmailer:spool:send --env=prod > /dev/null 2>>app/logs/error.log
Due to SMTP errors like “554 Message rejected: Address blacklisted” or “554 Message rejected: Email address is not verified” some message files remain in the spool directory and swiftmailer tries to send them over and over again following the “recovery-timeout” setting of the command (default = 15 minutes).
The problem is that a single exception during the sending process cancels the whole command.? Do I need an additional command to remove old “xxx.message.sending” files, e.g by wrapping and extending the swiftmailer:spool:send command?
Currently I remove the old files manually from time to time and according to Google I’m the only one having this issue ;-)
Thank you!
Woh, tough question! So, let’s see what we can do. First, let’s me give everyone else a little background by building a test project. Even if you’re not having this issue, we’re going to learn quite a bit about spooling and some lower-level parts of Swift Mailer. Philipp, you can skip down to the answer, or suggested approach for this difficult problem ;).
First, configure Swift Mailer to send emails in some way, and tell it to use a “file” spool. If you haven’t seen this before, we have a cookbook article on it at Symfony.com called, well, How to Spool Emails:
# app/config/config.yml swiftmailer: transport: %mailer_transport% host: %mailer_host% username: %mailer_user% password: %mailer_password% spool: { type: file }
By default, most of the swiftmailer configuration is stored in the app/config/parameters.yml file, so make sure you update your settings there.
File spooling is really easy, and kinda neat. Whenever you tell Swiftmailer to send an email, it actually doesn’t. Instead it stores it in a file and waits for you to run a Symfony task that actually sends the email. The obvious advantage is that the experience for your end-user is much faster.
Let’s use a small script I’ve created that loads up a bunch of spooled messages for us. This bootstraps Symfony and lets me write any Symfony code I want in it. It’s a quick and dirty way to create a spot where we can execute some code that needs Symfony and is something we cover in our Starting in Symfony2 series:
<?php // load_emails.php require __DIR__.'/vendor/autoload.php'; use Symfony\Component\HttpFoundation\Request; $loader = require_once __DIR__.'/app/bootstrap.php.cache'; require_once __DIR__.'/app/AppKernel.php'; $kernel = new AppKernel('prod', true); $request = Request::createFromGlobals(); $kernel->boot(); $container = $kernel->getContainer(); $container->enterScope('request'); $container->set('request', $request); /* end bootstrap */ /** @var $mailer \Swift_Mailer */ $mailer = $container->get('mailer'); $message = \Swift_Message::newInstance() ->setSubject('Testing Spooling!') ->setFrom('[email protected]') ->setTo('[email protected]') ->setBody('Hallo emails!') ; for ($i = 0; $i < 10; $i++) { $mailer->send($message); }
The script sends 10 email messages. Behind the scenes, I’ll also add a little bit of code to the core os Swift Mailer so that my SMTP server appears to fail about every 5 sends. This will fake STMP sending errors:
// vendor/swiftmailer/swiftmailer/lib/classes/Swift/Transport/AbstractSmtpTransport.php // ... protected function _assertResponseCode($response, $wanted) { list($code) = sscanf($response, '%3d'); if (rand(1, 5) == 5 && in_array(250, $wanted)) { $code = 554; } // ... the rest of the function }
Run this script from the command line to queue the 10 messages:
php load_emails.php
Tip
The script runs in the prod environment to be more realistic (since your site typically runs in the prod environment). So, be sure to clear your prod cache before trying any of this:
php app/console cache:clear --env=prod
You won’t see anything visually, and no emails were sent, but if you look in the cache directory, you should see a swiftmailer directory with a single file for each spooled message:
ls -la app/cache/prod/swiftmailer/spool
0Mo4LSRwTj.message
This is how the file spool works: each message is given a random filename and its contents are a serialized version of the Swift_Message.
To actually send these emails, use the swiftmailer:spool:send command.
php app/console swiftmailer:spool:send --env=prod --message-limit=10
Under normal conditions, this would find the first 10 files in the spool directory, unserialize each file’s contents and then send it. In fact, behind the scenes, each file is suffixed with .sending the moment before it is sent, and then deleted afterwards if everything went ok. If you watched your spool directory closely, you could see this while it’s sending:
0Mo4LSRwTj.message.sending
Normally you don’t really care about this... until your emails start to fail.
As Philipp mentioned, when you run the swiftmailer:spool:send command and one email fails, it will blow up! That’s actually not that big of a problem initially: as soon as any email is sent successfully, its spool file is deleted, which avoids duplicate sending, even if another email send blows up later. The email that failed remains in its “sending” state, meaning it has the .sending suffix:
0Mo4LSRwTj.message.sending
When you re-run the command, that .sending file is skipped, and the other nine files in the spool are sent.
So then, what happens to the email that failed? Does Swift Mailer every try to send it again? In fact, it does! And this is where the problems start. When you run the command, there is an optional --recover-timeout option, which defaults to 900, or 15 minutes. This option means that if a file has been in the .sending state for 15 minutes, the suffix should be removed and we should try re-sending it. This is really smart, because it means that if your SMTP server has a temporary failure, the email will just send later.
But sometimes, an email fails to send for a permanent reason, like 554 Message rejected: Address blacklisted. No matter how many times you try to re-send that email, it will probably never work. It will fail, wait fifteen minutes, fail again, then repeat endlessly. Even if these happen every now and then, after awhile you’ll get a spool/ directory that’s full of failures:
0Mo4LSRwTj.message.sending 30MJF9qOP7.message.sending BLxbfA_cKs.message.sending BaW2_ZzpAE.message.sending CgyPxTQ59E.message.sending Fw_Bux5LUh.message.sending GsDgqNHc89.message.sending IDbFa9CCtB.message.sending LEw9Xe.EZY.message.sending RKbbDMVKu9.message.sending
These are just annoying at first, since after fifteen minutes, each is re-tried, which causes your script to fail and no other emails to be sent. If you’re running the script often enough, it’s no big deal.
So back to Philipp’s question:?
Let’s walk through this: imagine you have 15 files that are failing. One-by-one, these become eligible to be re-tried. Our script, which runs every minute, tries one, then fails. A minute later it tries another, then another, etc, etc. After fifteen minutes it hasn’t actually sent any emails - it’s only failed to re-send these. To make matters worse, the first failed email is ready to be re-tried again, so the cycle continues.
This is actually a really interesting, but challenging issue. At the core is the fact that Swift Mailer can’t tell the difference between a mail that should be re-tried, and one that will fail forever. To make matters worse, there’s no possible way to configure the file spool to stop trying after a few attempts and delete the mail. This seems like a shortcoming in the spool itself, but for now, let’s work around it!
In my opinion, the best solution is create a separate task that handles these failures by trying them once more, then deleting them finally. Let’s start with the skeleton for the command:
namespace KnpU\QADayBundle\Command; use Symfony\Bundle\FrameworkBundle\Command\ContainerAwareCommand; use Symfony\Component\Console\Input\InputInterface; use Symfony\Component\Console\Output\OutputInterface; class ClearFailedSpoolCommand extends ContainerAwareCommand { protected function configure() { $this ->setName('swiftmailer:spool:clear-failures') ->setDescription('Clears failures from the spool') ; } protected function execute(InputInterface $input, OutputInterface $output) { } }
The goal of the command will be to find all .loading files, try them once again, then delete the spool file. This will use a few parts of Swift Mailer and its integration with Symfony that are deep enough that you’ll need to be more careful when you upgrade. For example, the fact that the failed spools are suffixed with .sending is really a detail that we’re not supposed to care about, but we’ll take advantage of it.
To start, grab the real transport from the service container and make sure it’s started:
/** @var $transport \Swift_Transport */ $transport = $this->getContainer()->get('swiftmailer.transport.real'); if (!$transport->isStarted()) { $transport->start(); }
The “transport” used by the mailer service is the file spool, which means when you send through it, it actually just spools. Symfony stores your real transport - whether that be SMTP or something else - as a service called swiftmailer.transport.real.
Next, let’s find all the spooled files. This takes advantage of the swiftmailer.spool.file.path parameter, which contains the directory where the spool files live. This parameter is used when the Swift_FileSpool is instantiated. We’ll also use the Finder component to really make this shine:
// ... $spoolPath = $this->getContainer()->getParameter('swiftmailer.spool.file.path'); $finder = Finder::create()->in($spoolPath)->name('*.sending'); foreach ($finder as $failedFile) { // ... }
Finally, fill in the loop:
// ... foreach ($finder as $failedFile) { // rename the file, so no other process tries to find it $tmpFilename = $failedFile.'.finalretry'; rename($failedFile, $tmpFilename); /** @var $message \Swift_Message */ $message = unserialize(file_get_contents($tmpFilename)); $output->writeln(sprintf( 'Retrying <info>%s</info> to <info>%s</info>', $message->getSubject(), implode(', ', array_keys($message->getTo())) )); try { $transport->send($message); $output->writeln('Sent!'); } catch (\Swift_TransportException $e) { $output->writeln('<error>Send failed - deleting spooled message</error>'); } // delete the file, either because it sent, or because it failed unlink($tmpFilename); }
Woh! Let’s walk through this using 4 friendly bullet points:
1) We rename the spool file to prevent any other process from sending this file while we try;
2) The contents of the spool file are a serialized \Swift_Message object, which we an unserialize to get it back;
4) Whether the message sends or fails, we delete the spool file to clean it out.
And that’s it! Now, set the command to run on some interval. If these messages tend to start to be a problem after an hour, run this hourly. If it’s an uncommon issue, run it daily:
php app/console swiftmailer:spool:clear-failures --env=prod
With a good mixture of failures and success, the output will look something like this:
Retrying Testing Spooling! to [email protected] Sent! Retrying Testing Spooling! to [email protected] Send failed - deleting spooled message Retrying Testing Spooling! to [email protected] Sent! Retrying Testing Spooling! to [email protected] Send failed - deleting spooled message
There are countless other approaches you could take, but I prefer this one because it prevents you from needing to override any core code. The point is that, one way or another, you’re on your own when you solve this. With some refactoring of Swift_FileSpool, it should be possible to set a max retry limit per mail, but that’s not the case right now.
Still, file spooling is great. If you’re concerned about delivering emails to your users without slowing down their experience, this is a very easy way to accomplish that. | https://symfonycasts.com/screencast/question-answer-day/swiftmailer-spooling | CC-MAIN-2019-22 | refinedweb | 1,961 | 56.05 |
Trying the simple task of converting a df to a csv, then saving it locally to a specific path. I’ll censor the file name with “…” because I’m not sure about the privacy policy.
I checked many topics and I still run into errors, so I’ll detail all the steps I went through, with the output:
Attempt #1:
import pandas as pd file_name = "" df = pd.read_csv(file_name) path = r'D:PROJECTSDATA_SCIENCEUDEMY_DataAnalysisBootcamp' df.to_csv(path, 'myDataFrame.csv')
TypeError: “delimiter” must be a 1-character string
Attempt #2: After searching about “delimiter” issues, I discovered it was linked to the sep argument, so I used a solution from this link to set a proper separator and encoding.
import pandas as pd file_name = "" df = pd.read_csv(file_name) path = r'D:PROJECTSDATA_SCIENCEUDEMY_DataAnalysisBootcamp' df.to_csv(path, "myDataFrame.csv", sep=b't', encoding='utf-8')
TypeError: to_csv() got multiple values for argument ‘sep’
After playing with different arguments, it seems like my code use ‘myDataFrame.csv’ as the sep argument because when I remove it the code does not return error, but no file is create at the specified path, or anywhere (I checked the desktop, my documents, default “downloads” file).
I checked the documentation pandas.DataFrame.to_csv and I didn’t find a parameter that would allow me to set a specific name to the csv I want to locally create. I’ve been running in circles trying things that lead me to the same errors, without finding a way to save anything locally.
Even the simple code below does not create any csv, and I really don’t understand why:
import pandas as pd file_name = "" df = pd.read_csv(file_name) df.to_csv("myDataFrame.csv")
I just want to simply save a dataframe into a csv, give it a name, and specify the path to where this csv is saved on my hard drive.
Answer
You receive the error because you are delivering to many values. The path and the file name must be provided in one string:
path = r'D:PROJECTSDATA_SCIENCEUDEMY_DataAnalysisBootcamp' df.to_csv(path +'/myDataFrame.csv')
This saves your file at the path you like. However, the file of your last attempt should be saved at the root of your PYTHONPATH. Make sure to check on that. The file must exist. | https://www.tutorialguruji.com/python/pandas-to_csv-cant-save-a-named-csv-into-a-specific-path/ | CC-MAIN-2021-39 | refinedweb | 378 | 54.22 |
Automate Gherkin tests
Create automated tests from your ALM Octane Gherkin tests, add them to an automation project, then run them in your CI server builds.
Note: ALM Octane supports Cucumber-jvm 4.2-4.8.1 and 1.2.
Gherkin automation process
The following components are involved in automating Gherkin tests:
There are several different flows, depending on the stage of development and your role.
Admin Flow
This is a one-time flow for admins:
Developer Customization Flow
This is a one-time flow for developers:
Single Test Automation Flow
This is a single test automation flow that can be configured for each test run:
Prerequisites
Ensure the Application Automation Tools plugin is installed and configured on the CI server. For details, see Install and configure the ALM Octane CI plugin on your CI server.
Ensure that your automation project is set up as a Cucumber project.
Create and download the Gherkin test
To work with a Gherkin test in your IDE, you must create the test.
To create and download the test:
In ALM Octane, if necessary create and add scenarios to your Gherkin test. For details, see Create Gherkin tests.
In the Scripts tab of the test, click the Download script
button.
The script is downloaded as a .feature file.
Note: ALM Octane uses the Test ID tag to map the automation results. DO NOT DELETE the Test ID tag!
Add the .feature file to your automation project.
Configure octane-cucumber-jvm in your project
To generate a Cucumber-based test results file that the CI server sends to ALM Octane, add the octane-cucumber-jvm library to your automation project.
The octane-cucumber-jvm library is supported for use on Java environments only.
In your project, add this dependency in your POM file:
<dependencies> <dependency> <groupId>com.hpe.alm.octane</groupId> <artifactId>octane-cucumber-jvm</artifactId> <version>15.1.0</version> </dependency> </dependencies>
Add the OctaneGherkinFormatter plugin to the CucumberOptions of each test class, and provide a unique result file path:
package feature.manualRunner; import cucumber.api.CucumberOptions; import org.junit.runner.RunWith; @RunWith(Cucumber.class) @CucumberOptions(plugin="com.hpe.alm.octane.OctaneGherkinFormatter:gherkin-results/ManualRunnerTest_OctaneGherkinResults.xml", features="src/test/resources/feature/manualRunner") public class ManualRunnerTest{ }
In your project, add this dependency in your POM file:
<dependencies> <dependency> <groupId>com.hpe.alm.octane</groupId> <artifactId>octane-cucumber-jvm</artifactId> <version>12.55.7</version> </dependency> </dependencies>
Enter a <version> tag based on the version of ALM Octane you are using:
In your JUnit Runner .java file, import the Octane Cucumber runner class:
import com.hpe.alm.octane.OctaneCucumber;
In the JUnit Runner .java file, change the cucumber.class to OctaneCucumber.class:
package feature.manualRunner; import com.hpe.alm.octane.OctaneCucumber; import cucumber.api.CucumberOptions; import org.junit.runner.RunWith; @RunWith(OctaneCucumber.class) @CucumberOptions(features="src/test/resources/feature/manualRunner") public class ManualRunnerTest{ }
Create a build job in your CI
In your build job configuration, add a build step that runs the test.
If required by your CI, add a post-build step to copy the test results to the job folder. For example, in Jenkins, add an ALM Octane Cucumber test reporter step from the actions section.
Note: If you add an ALM Octane Cucumber test reporter step, the CI server sends only the Gherkin test results to Octane. Test results from other automated tests are not sent as part of the build.
The post-build action instructs the CI to copy the test results XML files from the path specified in the post-build actions to the job build folder. From this build folder, the results are copied to ALM Octane.
During the test run in the CI server, the OctaneCucumber runner generates a run results report called <test name>_OctaneGherkinResults.xml in a dedicated folder called gherkin_results.
Note: If you are using the octane-cucumber-jvm library version 12.53.19 and earlier, the file name of the results is called OctaneGherkinResults.xml.
If the post-build Cucumber test report step fails, the CI server fails the entire build.
Add the build job to a pipeline
Ensure that your build project or build job that runs the test is included in an ALM Octane pipeline. When you run the pipeline, your CI generates the test results. The Application Automation Tools plugin reads the results file and sends the details to ALM Octane.
For details on creating and working with pipelines, see Create and configure pipelines.
Run the pipeline
To send the results to ALM Octane, you must run the corresponding pipeline.
To run the pipeline:
In ALM Octane or in the CI server, run the pipeline.
ALM Octane links the test results to the original Gherkin tests. ALM Octane uses the Test ID tags found at the top of the .feature file and the test script in ALM Octane ALM Octane assigns the test using these criteria:
If the test already exists in ALM Octane and the Test ID tag is included in the .feature file, ALM Octane does the mapping by the Test ID tag.
If the Test ID tag is not included in the .feature file, ALM Octane does the mapping by the .feature script path.
If the test does not exist in ALM Octane, the system creates a new test in ALM Octane and maps the results to it.
Analyze the results in ALM Octane.
Troubleshooting
This section contains troubleshooting suggestions for issues relating to running automated Gherkin tests.
I ran the automated test but I cannot see it in ALM Octane
- Check your code. Make sure that you are using right syntax: Cucumber does not always indicate syntax errors. Run your test locally.
If you were able to run the test locally, check that an XML was generated.
Check that your POM file is defined properly and includes the octane-cucumber-jvm library along with the correct version and make sure that OctaneCucumber is defined as the runner in your test class. For details, see Configure octane-cucumber-jvm in your project. If both POM file and test class have been updated properly and an XML is not generated, contact your ALM Octane support representative.
- If the test runs locally, check that the test ran in your CI tool. Make sure the Application Automation Tools plugin is installed and configured on the CI server. For details, see Install and configure the ALM Octane CI plugin on your CI server.
Check the job's console to make sure the post build action found the XML. You can see it in the job console log:
Micro Focus Octane Cucumber test reporter: Got result file content
Micro Focus Octane Cucumber test reporter: Result file copied to …
Check the plugin logs. They should display:
Successfully pushed test results of build [<build name>#<build number>]
Check the server logs for errors. XSD validation errors are common.
I ran the test x times, but instead of seeing x runs in ALM Octane under a single test, I see X tests with one run each
Check that the test script in the .feature file includes the test ID (TID) generated by ALM Octane. The test ID is required for mapping automation results. If the TID is missing, download the test script and implement it again.
Next steps: | https://admhelp.microfocus.com/octane/en/15.1.20/Online/Content/UserGuide/how_automate_gherkin.htm | CC-MAIN-2020-40 | refinedweb | 1,210 | 57.27 |
Closed Bug 1262744 Opened 4 years ago Closed 4 years ago
Add HTML5 <!DOCTYPE> declaration to Math
ML tests
Categories
(Core :: MathML, defect)
Tracking
()
mozilla48
People
(Reporter: fredw, Assigned: aeriklawson, Mentored)
References
(Depends on 1 open bug)
Details
(Whiteboard: [lang=html][good first bug])
Attachments
(1 file, 1 obsolete file)
While importing some Mozilla MathML tests into WebKit, a reviewer asked me to use the HTML5 <!DOCTYPE> declaration for all new tests. It seems that we miss it for some of our tests like mpadded, movablelimits etc
Hey, I'm new here. Can I take this one?
Hi Andrew, welcome. Sure, I'm assigning you the bug. The tests to changes are located there: If you need any help, do not hesitate to ask. Thanks.
Assignee: nobody → aeriklawson
Thanks for the patch. Note that it is incorrect to do that for XHTML tests, since they follow a different XML syntax. Unless one of this test explicitly check support for MathML in XHTML, I guess it is safe to convert them to the HTML5 syntax (them you must remove namespace prefix, can remove xmlns attributes etc). However, that can be done in a follow-up bug. When you feel your patch is ready, follow the instructions there to get your patch reviewed:
Okay, I just left out the declaration from the XHTML tests in this new one.
Comment on attachment 8741430 [details] [diff] [review] Add '<!DOCTYPE html>' declaration to all MathML HTML tests (excludes XHTML) Review of attachment 8741430 [details] [diff] [review]: ----------------------------------------------------------------- Thanks, that looks good to me.
Attachment #8741430 - Flags: review?(fred.wang) → review+
Cool. Does this need to go to the try server now? I don't believe I have permissions for that.
I submitted Please check the result and set checkin-needed if everything is ok. (If you don't have editbugs privilege, see)
Status: NEW → RESOLVED
Closed: 4 years ago
Resolution: --- → FIXED
Target Milestone: --- → mozilla48 | https://bugzilla.mozilla.org/show_bug.cgi?id=1262744 | CC-MAIN-2020-34 | refinedweb | 318 | 73.47 |
Originally published in my blog::
- There are a lot of existing tutorials about it
- There are a lot of tools to get started with a single click like
Nuxtand
vue-cliwith
typescriptplugin
- We already have
wemake-vue-templatewhere every bit of setup that I going to talk about is already covered
Component typings
The first broken expectation when you start to work with
Vue and
typescript and after you have already typed your class components is that
<template> and
<style> tags are still not typed. Let me show you an example:
<template> <h1 : Hello, {{ usr }}! </h1> </template> <script lang="ts"> import Vue from 'vue' import Component from 'vue-class-component' import { Prop } from 'vue-property-decorator' @Component({}) export default class HelloComponent extends Vue { @Prop() user!: string } </script> <style module> .header { /* ... */ } </style>-modules is also covered by several external tools:
The main idea of these tools is to fetch
css-modules<number> =<CommentType[]> { //[]`: comments = typedStore.comments }<CommentType[]> { //<typeof Comment>
What do we do here?
- We define an instance of
ts.typewith fields that we need to be checked in runtime when we receive a response from server
- We define a static type to be used in annotation without any extra boilerplate
And later we can use it our
api calls:
import * as ts from 'io-ts' import * as tPromise from 'io-ts-promise' public async fetchComments (): Promise<CommentType[]> {<Vue>all the way
- Partially apply it to the most important components with the biggest amount of tests and update it regularly
- Use
anyas a fallback
Conclusion
The average level of
typescript support in
Vue ecosystem increased over the last couple of years:
Nuxtfirstly introduced
nuxt-tsand now ships
tsbuilds by default
Vue@3will have improved
typescriptsupport
-.
Posted on by:
wemake.services
Very good article 🙌
I will try
vuex-simplein my next project 😄
Great article !
Although I am new in this area I like the VueJs + Typescript idea!
But according to github.com/vuejs/rfcs/blob/functio... , the next VueJs movement will be toward function API. Does it mean that the Typescript ( official support and plugin) will be deprecated (some day)
If you add authentication and a sample APP this will be invaluable
I guess, that might be a good idea! I generally use
nuxt-auth.
It involves like 3 steps to get the fully working login. Check it out!
Interesting. I'll check that.
We did this in our apps, using a combination of the router and vuex - the router took care of checking if the user has an auth token and if it's expired or still valid and redirects automatically to the login (passing a return page as param), vuex stores the authentication token, then all API calls automatically add the token to every request. | https://dev.to/wemake-services/really-typing-vue-6j2 | CC-MAIN-2020-40 | refinedweb | 455 | 57.2 |
This year's competition will once again be to write Java programs
that play the game of Robocraft. Robocraft is a realtime strategy
game in which teams of robots battle each other head-to-head. There
are some important differences between Robocraft and the traditional
realtime strategy games you may be familiar with:
The screenshot below is an example of a graphical view of a
Robocraft match. A Robocraft match is between two teams of robots
which compete on a Robocraft map, trying to accomplish some objective.
This year's objective is to capture the opposing team's flag and bring
it together with your own. As can be seen in the below image, the
Robocraft world consists of varying terrain types, and a team consists
of four different types of robots: Sentries, Falcons, Bombers, and
Tanks. The robots are autonomous and controlled by software that you
write. The remainder of this document will describe in detail the
physics of the Robocraft world and how to write a player.
Map. The Robocraft world is laid out on a grid of squares, each
defined by a pair of integer coordinates. The "map" is a finite
rectangular set of squares. Each square on the map is given a type of
"terrain", which may be land or water. On top of the terrain sit
GameObjects, each of which is either on the ground or in the air. A
square may contain at most one ground object and at most one air
object. Objects may not leave the map, and water terrain does not
permit ground objects. All squares within the map permit air
objects. The GameObjects that you will deal with are Mines and the
various types of Robot.
Rounds. Rounds are Robocraft's unit of time, defined in terms
of bytecodes executed by a player (see the RoboVM section). In short, a player may perform a
limited amount of computation during a single round.
Energon. Energon is the universal life-force in the world of
Robocraft. Every robot has a supply of energon, and when a robot's
energon supply falls to 0 or below, the robot "dies" and is removed
from the game at the end of the round, unless its energon becomes
positive before that time. Not only do robots need energon to
survive, but energon is also used as a resource, required to perform
certain actions, such as spawning new robots or communicating.
The Robocraft software contains a virtual machine called the
RoboVM. It is the RoboVM that runs your compiled Java code during the
game, and not your system's Java implementation. Compiled Java code
(found in class files) consists of instructions called bytecodes, and
the bytecodes that make up your player program are interpreted one by
one by the RoboVM. This means that the RoboVM has complete control
over the execution of your program. It also means that the only
classes and language features accessible to your player are those
explicitly supported by the RoboVM.
Execution. Each round, each robot's player is run for a
certain number of bytecodes; the number is fixed for each kind of
robot. At the end of the round, the state of the Robocraft world is
updated. Then the next round begins and each player runs for another
round's worth of bytecodes. Thus "time" in the Robocraft world is
defined in terms of bytecodes executed. From the point of view of the
player, however, the program runs continuously. The only
evidence of changing rounds is that queries of the outside world
return information that is only true for the duration of the current
round. Furthermore, a round may end after any bytecode, even in the
middle of evaluating an expression in your code. Individual bytecodes
are simple instructions such as "subtract" or "get field", and Java
statements are made up of many bytecodes. See Writing a Player for more on the implications of
this.
When an ability is said to "end the current round", this is
equivalent to saying that the ability uses up as many bytecodes as are
left in the current round.
Each robot essentially runs its own virtual machine, walled off
from those of the other robots. Static fields are per-robot, for
example. The only communication between robots is through broadcasting
messages (which will be discussed later).
Libraries. The RoboVM loads its own runtime libraries,
which contain independent but compatible implementations of most
classes in the packages java.lang and
java.util (but not subpackages of these), as well as
java.io.PrintStream for output. Other standard Java
library classes are not supported and are not accessible to your
player, even if it compiles successfully with references to
them. Notably, file access, reflection, threads, and date utilities
are not supported. Also, the synchronized keyword and
native code are not supported by the RoboVM.
java.lang
java.util
java.io.PrintStream
synchronized
Note that since almost all of the classes in java.lang
and java.util are written in Java, methods of these
classes take up bytecodes in the same way as methods that you write.
The RoboVM Java libraries are compatible with JDK 1.4 except for
the absence of certain classes and methods. The following classes are
absent:
java.lang.ClassLoader
java.lang.Compiler
java.lang.InheritableThreadLocal
java.lang.Package
java.lang.Process
java.lang.Runnable
java.lang.RuntimePermission
java.lang.SecurityManager
java.lang.Thread
java.lang.ThreadDeath
java.lang.ThreadGroup
java.lang.ThreadLocal
java.util.Calendar
java.util.Currency
java.util.Date
java.util.EventListener
java.util.EventListenerProxy
java.util.EventObject
java.util.GregorianCalendar
java.util.ListResourceBundle
java.util.MissingResourceException
java.util.Properties
java.util.PropertyPermission
java.util.PropertyPermissionCollection
java.util.PropertyResourceBundle
java.util.ResourceBundle
java.util.SimpleTimeZone
java.util.TimeZone
java.util.Timer
java.util.TimerTask
java.util.WeakHashMap
The following classes support only a subset of JDK 1.4:
print
println
java.lang.Class
toString
getName
forName
java.lang.Object
notify
notifyAll
wait
java.lang.System
currentTimeMillis
arraycopy
identityHashCode
exit
System.out
System.err
System.in
You will control four types of robots which vary greatly in their
abilities. Some are ground robots, which can only traverse land, and
some are air robots that can fly over water. Some can attack only
ground robots, and some can attack only air robots. Additionally,
robots vary in properties such as sensor and attack ranges, speed,
and strength.
Robots are instances of GameObject. See the javadocs for detailed information about the
accessor methods for GameObjects and Robots. This section describes
the abilities that robots have.
Abilities. All abilities are accessed through method calls
in AbstractRobotPlayer
(which you will extend). There are three different kinds of
abilities:
AbstractRobotPlayer
ActionType
ActionType.IDLE
Now we shall describe some key robot abilities. For a complete
description of the ability methods, please refer to the javadocs. For the numerical values of ranges,
action durations, etc., see Robot
Characteristics.
Direction. Each robot is facing in a specific Direction
at any given time. Robot players can change their direction with
calls to the setDirection
active ability. A robot's current direction is important for many
active abilities and actions.
Direction
setDirection
Movement. Robots can moveForward
and moveBackward,
relative to the Direction
they are currently facing. Moving is an action ability. Different
robots move at different speeds. Any ground robot may move into any
square whose TerrainType
permits ground objects and which is not already occupied by another
ground object. Air robots can move into any square that is within the
bounds of the map and is not occupied by another air robot. A single
movement action moves a robot to the adjacent square in front or
behind. Note that moving in a diagonal direction
takes sqrt(2) times longer than moving in an orthogonal
direction, rounded to the nearest integer.
moveForward
moveBackward
TerrainType
sqrt(2)
Movement completes as soon as it is initiated, like all actions,
but for the purposes of animation it is drawn as if the robot moves
smoothly over the duration of the action. In other words, once a robot
begins to move towards an adjacent square on the screen, it is already
there for the purposes of the game.
Sensors. Robots use their sensors to inspect the world around
them. Methods that access current information about the world require
that the target GameObject or map square fall within the range of the
calling robot's sensor equipment. This equipment varies between kinds
of robots. Sensor ranges are sectors (pie-slices) of a circle centered
at the robot's location. The sectors are symmetric with respect to
the robot's direction. See Appendix
E for graphical depictions of different units' sensor ranges.
Flags. Any robot may query the location of its own team's flag
at any time, using senseTeamFlag().
The robot carrying your team's flag can additionally sense the
location of the enemy team's flag, using senseEnemyFlag().
When a robot that is carrying a flag dies, the flag is immediately
dropped into that robot's location.
senseTeamFlag()
senseEnemyFlag()
Yielding. Yielding is an active ability that simply ends the
current round. When your program has nothing better to do, it should
yield
instead of wasting bytecodes. Yielding when possible helps Robocraft
run smoothly, and to encourage this, we award a small bonus of energon
to a robot every time it yields. See
GameConstants.YIELD_ENERGON_BONUS in Appendix C.
yield
GameConstants.YIELD_ENERGON_BONUS
Attacking. Attacking is an action ability. A robot chooses a
map square to attack, which must be within the robot's attack range,
and if there is a robot at that location, that robot will have its
energon level decreased by the strength of the attack. Different
robots attack with different strengths and different attack ranges.
Attack ranges are defined in a manner similar to sensor ranges
(i.e. parameterized by the radius and angle of a sector). Moreover,
there are two types of attacks: a robot may attackGround
or attackAir.
In a ground attack, only ground robots at the attacked location can be
harmed. Similarly, only air robots can be harmed during an air
attack. Not all robots can attack both air and ground. As with the
movement action, attacks affect the state of the world immediately,
and then occupy the attacking robot for a number of rounds. Finally,
moving robots have damage dealt to them decreased by a factor
of GameConstants.MOVING_DAMAGE_REDUCTION
attackGround
attackAir
GameConstants.MOVING_DAMAGE_REDUCTION
Radio Communication. Robots communicate by broadcasting
messages. A message is an instance of class Message,
and contains an array of integers, an array of Strings, and an array
of MapLocations. When a robot broadcasts a message using the active
ability broadcastMessage,
the message is added to the message queue of each robot within the
sender's communication range. Communication ranges are always
circular. The receiving robots may use the passive ability getNextMessage
to retrieve the next message from their queue. This method returns
null if there are no messages waiting. There is no other way to
determine if there are messages in the queue, or how many there are.
broadcastMessage
getNextMessage
Any field of a Message instance may be null, and any element of
an array may be null. Messages are essentially "cloned" when broadcast
or received, so a single Message instance may be received, mutated,
transmitted, mutated, and transmitted again.
There is no limit to the size of messages or capacity of message
queues, but sending a message requires an amount of energon that
depends on the size of the message in bytes. Each integer element
takes 4 bytes; each MapLocation takes 8 bytes, whether null or not;
and each String element takes up a number of bytes equal to the
length, with a minimum of 4 whether null or not. A null field of a
Message (i.e. no array at all) takes 0 bytes. Sending a message
requires GameConstants.BROADCAST_FIXED_COST in energon,
plus GameConstants.BROADCAST_COST_PER_BYTE energon per
byte. See Appendix C.
GameConstants.BROADCAST_FIXED_COST
GameConstants.BROADCAST_COST_PER_BYTE
Energon. Energon is the universal resource of the Robocraft
world. Robots need energon to live and also to use certain
abilities. A robot's energon may be temporarily negative (see
Abilities and Timing).
All robots start with a fixed energon level, and can gain or lose
energon over time. Every round that a robot is alive, it receives a
bonus of GameConstants.ROUND_ENERGON_BONUS. If a robot
calls yield() before the round is up, it is rewarded an
additional GameConstants.YIELD_ENERGON_BONUS. However,
once a robot has reached its fullEnergon level, it no
longer recieves either of these bonuses. (See the section on Robot
Characteristics below).
GameConstants.ROUND_ENERGON_BONUS
yield()
fullEnergon
Robots can transfer energon between themselves using transferEnergon
and may exceed their fullEnergon level through a
transfer. Note that through transfers, a Robot may not exceed its
maxEnergon level. A robot can therefore never, under any
circumstances, have an energon level greater
than maxEnergon for that Robot.
transferEnergon
maxEnergon
Spawning. If a robot has enough energon, it may spawn a new
robot in the square directly in front of it, by using the spawn
action. Robots can only spawn when the square in front of them is
empty and of a terrain type traversable by the child. An air robot
can spawn any type of air robot, and a ground robot can spawn any type
of ground robot. Some robots may need to get energon transfers so
that they are above fullEnergon in order to spawn certain
types. Child robots initially face in a random direction. They are
always on the same team as their parents.
spawn
The amount of energon required to spawn each robot is given in Appendix B. Once a robot makes a call
to spawn, the child robot appears immediately on the map
in front of the parent and starts with that robot
type's startEnergon amount of energon. The parent is
then engaged in ActionType.SPAWNING for some number of
rounds, while the child is engaged in
ActionType.WAKING for a certain number of rounds.
startEnergon
ActionType.SPAWNING
ActionType.WAKING
Each team may have a maximum total
of GameConstants.TEAM_TOTAL_LIMIT robots on the map at
any given time. Also, each team may have a maximum
of GameConstants.ROBOT_TYPE_LIMIT of any one robot type.
GameConstants.TEAM_TOTAL_LIMIT
GameConstants.ROBOT_TYPE_LIMIT
Laying Mines. Sentry robots have the special ability to lay
energon land mines. A sentry can lay a mine into the square directly
in front of it using the layMine
method. The sentry may choose the amount of energon used, subject to
minimum and maximum constraints (see Appendix
C below).
layMine
A mine may only be laid on a land square that does not contain a
robot or flag. If a mine is laid into a square already containing a
mine, the energon in the existing mine increases by the amount
requested to be laid (as though there were two mines in the same
square). Mines are generally undetectable; the exception is that a
robot carrying a flag can sense a mine in the square in front of
it.
When a ground robot moves into a square containing a mine, the
mine is triggered, and explodes shortly thereafter. When a mine explodes:
Abilities and Timing. During each game round, the existing
robots are run sequentially, roughly in their order of creation. All
active abilities and actions take effect immediately, even before the
remaining robots of the round are run. This means that a movement
action, for example, will not fail due to a "conflict" with another
robot. If the robot can move forward, and does so before the end of
the round, the movement will succeed. In the case of attacking, though
the damage is done immediately, a robot that goes into negative energon
is not removed until the end of the game round, i.e. after all
robots have been run for the round. Thus a robot could theoretically
be attacked, go into negative energon, pick up more energon and live
within the same round.
For the most part, the order in which robots are run during a round
should have a minimal impact on gameplay. For most purposes all that
matters is that between two consecutive rounds of a robot's execution,
each other robot runs for one round's worth of bytecodes and
abilities. The fact that robots do not die immediately after a fatal
blow gives a very slight advantage to "newer" robots on offense, but
this is expected to be negligible.
Your player program must reside in a Java package named
teamXXX, where XXX is your three-digit team
number, with leading zeros included. You may have
whatever subpackages you like. You must define
teamXXX.RobotPlayer, which extends
robocraft.player.AbstractRobotPlayer. Whenever a new
robot is created, your RobotPlayer class is instantiated
by the game using a constructor with no arguments, and then the game
calls your run() method. If this method ever finishes or
terminates with an exception, the robot dies and is removed from the
game. You are encouraged to wrap your code in loops and exception
handlers so that this does not happen.
teamXXX
teamXXX.RobotPlayer
robocraft.player.AbstractRobotPlayer
RobotPlayer
run()
Your RobotPlayer inherits the methods used to perform
active abilities and actions. It also has access to
getRobot, which returns a Robot object
representing the calling robot. For your convenience,
AbstractRobotPlayer has methods for accessing the
properties of the player robot, such as getLocation(),
which is equivalent to getRobot().getLocation(), except
that the former is specified to not throw an exception.
AbstractRobotPlayer implements the
GameConstants interface, which means that the names of
game constants can be used as if they are fields of your class. You
may define other subclasses of AbstractRobotPlayer
besides RobotPlayer in your package, and instantiate and
run them.
getRobot
Robot
getLocation()
getRobot().getLocation()
GameConstants
If you defined classes in your package called
SentryPlayer and FalconPlayer that extend
AbstractRobotPlayer, then the following might be the code
of teamXXX.RobotPlayer:
SentryPlayer
FalconPlayer
package team999;
import robocraft.common.*;
import robocraft.player.*;
public class RobotPlayer extends AbstractRobotPlayer {
AbstractRobotPlayer player;
public RobotPlayer() {
if (getType() == RobotType.SENTRY) {
player = new SentryPlayer();
}
else if (getType() == RobotType.FALCON) {
player = new FalconPlayer();
}
//...
}
public void run() {
player.run();
}
}
And here is a possible implementation of
a SentryPlayer that spins in a circle, laying mines when
it has enough energon:
package team999;
import robocraft.common.*;
import robocraft.player.*;
public class SentryPlayer extends AbstractRobotPlayer {
public SentryPlayer() {
}
public void run() {
while (true) {
try {
while(getEnergonLevel() < MIN_MINE_POWER)
yield();
while (isActive())
yield();
layMine(MIN_MINE_POWER);
while (isActive())
yield();
setDirection(getDirection().rotateRight());
}
catch (GameActionException e) {
System.out.println("GAE: "+e.getMessage());
}
}
}
}
Although we do not necessarily recommend this as a winning
strategy.
As mentioned before, each robot runs the player program
independently, and no information is shared between the robots'
programs except for information that arrives in broadcast
messages.
Once a robot begins running your player program, the program
retains control as long as the robot exists. Time passes as the
bytecodes of your program are executed, but this is not directly
detectable except through interactions with the world. (See the RoboVM section.) It means, however, that
you have to be prepared for the current round to end and the state of
the world to change at any time. For example, if an object shows up on
your robot's sensors and you then ask for the object's location, the
object could theoretically now be out of sensor range, if a round has
ended between the sensor reading and the location request, and in this
case an exception will be thrown. Similarly, if a Robot has recently
died then abilities referencing that robot will fail. A square seen to
be unoccupied may become occupied before you have a chance to move
into it. These possibilities are unavoidable, as all computation takes
a certain number of bytecodes and only so many bytecodes fit in a
round.
One way to deal with this is to minimize the number of bytecodes
you execute in a round. Actions and active abilities, including
yield, end the current round, meaning that subsequent
code is executed at the beginning of a new round. You could then try
to make it likely that another action or active ability will be used
before a round's worth of bytecodes have been executed. In any case,
you will probably want to write your player efficiently because it
only has so much time to "think". The Clock class
provides a way to identify the current round and thus detect when a
new round has begun, as well as to discover how many bytecodes have
been executed during the current round and thus how many remain.
Clock
One point to keep in mind regarding efficiency is that
concatenating Strings, numbers and Objects takes up many bytecodes,
because the classes String and StringBuffer are written in Java. When
constructing debug messages to send to System.out, for
example, you may wish to pass each piece of the message to the
appropriate System.out.print(...) method rather than
using the + concatenation operator. The print commands
themselves are native and consume minimal numbers of
bytecodes. Alternatively, see the "Debugging" section below for a way
to print debug information without consuming bytecodes.
System.out.print(...)
+
GameActionExceptions. There will very likely be times,
however, when a round does end at some unpredictable place in the
middle of your code. Therefore you must write your player defensively
and handle GameActionExceptions judiciously. GameActionExceptions are
thrown whenever an ability cannot be performed. This is often due to
the changing state of the world. In this case it is usually better not
to try to address and recover from the different kinds of
GameActionExceptions individually, but to be prepared for any ability
to fail and to make sure that this has as little effect as possible on
the control flow of your program. This means catching
GameActionExceptions close to where they may be thrown.
GameActionExceptions may also be thrown by abilities as a result of
faulty program logic as opposed to uncertainty about the world. For
example, a robot may neglect to make sure it has enough energon before
trying to spawn a new robot. These kinds of exceptions should be
preventable through good programming, and if one is thrown it may
indicate a bug in your program. You may wish to re-throw such
GameActionExceptions when caught, based on their error code, so that
they are not ignored. This re-throwing could even be abstracted into a
function called at the beginning of catch blocks.
catch
Since most GameActionExceptions are avoidable through programming
logic or careful scheduling, there will be a minimal energon charge
subtracted from your robot whenever it causes an exception to be
thrown. This penalty value is defined
in GameConstants.EXCEPTION_ENERGON_COST, and should not
be signficant unless you are sloppy about avoiding exceptions and
cause many to be thrown.
GameConstants.EXCEPTION_ENERGON_COST
Debugging. Any output that your robots print
to System.out or System.err is directed to
the output and error streams of the Robocraft engine, prefixed with
information about the robot. This is very useful for debugging, but it
can take many bytecodes to generate useful debugging output.
For this reason, the RoboVM
robocraft.debugMethodsEnabled is set to true,
however, the methods are executed normally except that they do not
count against your robot's bytecodesPerRound limit.
(See the Software page for more information
about properties.) Code that prepares the arguments to such a method
may consume bytecodes, but the body of the method and any methods that
it invokes are not counted.
debug_
void
robocraft.debugMethodsEnabled
true
bytecodesPerRound
Heap Space. Please keep your memory usage reasonable. If one
of your robots uses more than 3 megabytes of memory during a match, we
reserve the right to kill that robot or disqualify your team from that
match.
Robocraft matches are between two teams at a time. Each team begins
with a Sentry and a Falcon, each with their RobotType's
startEnergon
amount of energon. The sentry will start out carrying its team's
flag, and the falcon will be positioned directly above it. The
orientations of the robots will be random. The teams will start in
opposite corners of the map.
RobotType
Objective. The primary objective during a match is to capture
the opposing team's flag and bring it together with your own. As soon
as a single ground robot carrying one flag picks up the other flag
(thus holding both flags at once), the game is over and that robot's
team wins.
If many rounds elapse and neither team has captured both flags, then
the match enters overtime, and the world begins to shrink inward from
the outer edges. Specifically,
every GameConstants.ROUNDS_PER_SHRINK rounds, the outer
border of the map will disappear, and any object in a border square
will explode. This will continue until either flag explodes, in which
case that flag's team loses. If a robot explodes while carrying a
flag, the flag will explode in the next round.
GameConstants.ROUNDS_PER_SHRINK
If both flags explode in the same round during a shrink, then the
winning team is the team that made the most total calls to
the yield() method. If these counts are equal, the team
with the highest total energon possessed by robots at the start of
overtime wins. In the unlikely event that this still produces a tie,
the 6.370 chairmen will provide an additional criterion, such as a
rematch on a new map.
You may detect that the map has begun shrinking using the isMapShrinking
passive ability. If this returns true, you might want to move your
flag away from the edge of the map. The shrinking of the map is not
otherwise observable by a robot.
isMapShrinking
MapLocation Coordinates. As an extra challenge, the coordinates
of MapLocations on tournament maps are not based on the (0,0) origin.
Instead, the coordinates are shifted; the upper-left corner of the map
might be location (38282,1022101) (to pick two random numbers). Thus
you cannot use absolute map locations to infer the boundaries of the
map.
The coordinate system is oriented such that x-coordinates increase to
the right ("east") and y-coordinates increase going down ("south").
Map Properties. Maps will generally consist of large, connected
areas of land terrain, separated from other areas by thin lines of
water. In general, all of the land areas will be fairly
well-connected, but there will be at least 4 "dead-ends" on the map.
Each team starts in an opposite corner area, and the entire map will
be symmetrical enough not to favor either team. Please refer to these
examples that embody the spirit of such maps:
In addition to the above, maps will specifically have the following
properties:
We have done our best to test and balance the properties of the
Robocraft world. Inevitably, however, we will need to make
adjustments in the interest of having a fair competition that allows a
variety of creative strategies. We will endeavor to keep these
changes to a minimum, and release them as early as possible.
getTerrainType
senseNearbyGroundRobots
senseNearbyAirRobots
senseMineAhead
getGroundRobotAtLocation
getAirRobotAtLocation
getFlagTeam
senseTeamFlag
senseEnemyFlag
getUnitCount
pickupFlag
depositFlag
rt.moveDelayOrthogonal()
rt.moveDelayDiagonal()
rt.attackDelay()
rt.mineDelay()
rt.spawnDelay()
rt.wakeDelay()
Robot Comparison Chart
Please help yourself to some javadocs.
In Sensor Range
In Attack Range
In Sensor & Attack Ranges | http://ocw.mit.edu/ans7870/6/6.370/contestants/spec/index.htm | CC-MAIN-2015-18 | refinedweb | 4,544 | 55.54 |
Unit testing is considered an essential part of software development. Through unit testing, we can evaluate each code component, find out how well it performs, and determine how well it reacts to valid or invalid input. A regression suite of unit tests is also an excellent way of detecting unexpected changes in a code base caused by refactoring or writing new code.
In this article, I examine the mechanisms of unit testing in Python, starting with the unittest module and its key classes. I examine tests individually and in suites, and I discuss how to facilitate their construction and use. Readers should have a working knowledge of Python. The sample test code requires Python 2.5 or later.
The unittest Module
The unittest module started life as the third-party module PyUnit. PyUnit was a Python port of JUnit, the Java unit testing framework. Designed by Steve Purcell, PyUnit became an official Python module starting with version 2.5.
Figure 1: Core classes in unittest.
As Figure 1 shows, there are five key classes in the unittest module. The
TestCase class holds the test routines and provides hooks for preparing each routine and for cleaning up after. The
TestSuite class serves as a collection container. It can hold multiple
TestCase objects and multiple
TestSuite objects.
The
TestLoader class loads test cases and suites defined locally or from an external file. It emits a
TestSuite object that holds those cases and suites. The
TextTestRunner class provides a standard platform to run the tests. The
TestResults class provides a standard container for the test results.
Out of these five classes, only
TestCase must be subclassed. The other four classes can also be subclassed, but they are generally used as is.
Preparing a Test Case
Figure 2 shows the structure of the
TestCase class. In it are three sets of methods that are used most often in designing the tests. In the first set are the pre- and post-test hooks. The
setUp() method fires before each test routine, the
tearDown() after the routine. Override these methods when you create a custom test case.
Figure 2: The structure of a TestCase class.
The second pair of methods control test execution. Both methods take a message string as input, and both abort an ongoing test. But the
skipTest() method cancels the current test, while the
fail() method fails it explicitly.
The third set of methods help identify the test. The method
id() returns a string containing the name of the
TestCase object and of the test routine. And the method
shortDescription() returns the
docstr comment at the start of each test routine. If the routine has no such comment,
shortDescription() returns a
None.
Listing One shows the sample bare bones test case
FooTest.
FooTest has two test routines:
testA() and
testB(). Both routines get the required argument of
self. Both have a
docstr comment for a first line.
Listing One: Code to show the sequence of unit test execution.
#!/usr/bin/python import unittest class FooTest(unittest.TestCase): """Sample test case""" # preparing to test def setUp(self): """ Setting up for the test """ print "FooTest:setUp_:begin" ## do something... print "FooTest:setUp_:end" # ending the test def tearDown(self): """Cleaning up after the test""" print "FooTest:tearDown_:begin" ## do something... print "FooTest:tearDown_:end" # test routine A def testA(self): """Test routine A""" print "FooTest:testA" # test routine B def testB(self): """Test routine B""" print "FooTest:testB"
Figure 3 shows how
FooTest behaves when executed.
Figure 3: FooTest behavior.
Note the same
setUp() and
tearDown() methods run before and after each test routine. So how do you let
setUp() and
tearDown() know which routine is being run? You must first identify the routine by calling
shortDescription() or
id() (See Listing Two). Then use an
if-else block to route to the appropriate code. In the sample snippet,
FooTest calls
shortDescription() to get the routine's
docstr comment, then runs the prep and clean-up code for that routine.
Listing Two: Using test descriptions.
import unittest class FooTest(unittest.TestCase): """Sample test case""" # preparing to test def setUp(self): """ Setting up for the test """ print "FooTest:setUp_:begin" testName = self.shortDescription() if (testName == "Test routine A"): print "setting up for test A" elif (testName == "Test routine B"): print "setting up for test B" else: print "UNKNOWN TEST ROUTINE" print "FooTest:setUp_:end" # ending the test def tearDown(self): """Cleaning up after the test""" print "FooTest:tearDown_:begin" testName = self.shortDescription() if (testName == "Test routine A"): print "cleaning up after test A" elif (testName == "Test routine B"): print "cleaning up after test B" else: print "UNKNOWN TEST ROUTINE" print "FooTest:tearDown_:end" # see Listing One...
Designing a Test Routine
Each test routine must have the prefix "test" in its name. Without that prefix, the routine will not run. To perform a test, the test routine should use an
assert method. An
assert method gets one or more test arguments and an optional assert message. When a test fails, the
assert halts the routine and sends the error message to
stdout.
There are three sets of
assert methods. In the first set (Table 1) are the basic Boolean asserts, which fire on a
True or
False result.
Table 1: Basic asserts in unittest.
To check for just a
True or
False, use
assertTrue() or
assertFalse(), as in Listing Three:
Listing Three: Checking for True or False.
self.assertTrue(argState, "foobar() gave back a False") # -- fires when the instance method foobar() returns a True self.assertFalse(argState) # -- fires when foobar() returns a False # Notice this one does not supply an assert message
To check whether two arguments are the same, use
assertEqual() and
assertNotEqual() as in Listing Four. These last two
asserts check the arguments' values, as well as their data types.
Listing Four: Checking arguments.
argFoo = "narf" argBar = "zort" self.assertEqual(argFoo, argBar, "These are not the same") # -- this assert will fail self.assertNotEqual(argFoo, argBar, "These are the same") # -- this assert will succeed argFoo = 123 argBar = "123" self.assertEqual(argFoo, argBar, "These are not the same") # -- this assert will fail
To check if the arguments are the same objects, use
assertIs() and
assertIsNot(). Like
assertEqual() and
assertNotEqual(), these two
asserts examine both argument values and type. To check if an argument is an instance of a specific class, use
assertIsInstance() and
assertIsNotInstance() as in Listing Five.
Listing Five: Checking if an argument is an instance of a specific class.
argFoo = Bar() # checking against class Bar self.assertIsInstance(argFoo, Bar, "The object is not an instance of class Bar") # -- this assert will succeed # checking against class Foo self.assertIsNotInstance(argFoo, Foo, "The object is an instance of class Foo") # -- this assert will fail
Both
asserts get a class name as a second argument. Both behave similarly to the library function
isInstance(). Finally, to check for a
nil, use
assertIsNone() and
assertIsNotNone().
The second set of
asserts are comparative (see Table 2).
Table 2: The comparative assertions. | http://www.drdobbs.com/testing/unit-testing-with-python/240165163?cid=SBX_ddj_related_mostpopular__Other_windows&itc=SBX_ddj_related_mostpopular__Other_windows | CC-MAIN-2015-32 | refinedweb | 1,159 | 66.23 |
OpenVC 2.4.5, eclipse CDT Juno, MinGW error 0xc0000005
On Windows 7 64 bit, AMD processor, I installed OpenVC 2.4.5, with eclipse CDT Juno and MinGW, everything to the latest update. Previously eclipse CDT and MinGW compiled 100+ source files without problems. They even compile this
#include <opencv2/core/core.hpp> #include <opencv2/highgui/highgui.hpp> #include <opencv2/opencv.hpp> #include <iostream> using namespace std; int main() { IplImage* img1 = cvLoadImage("lenna.png"); cvShowImage("MyWindow1", img1); cv::Mat img2; cv::imread("lenna.png", CV_LOAD_IMAGE_COLOR); cv::namedWindow("MyWindow2", CV_WINDOW_AUTOSIZE); cv::imshow("MyWindow2", img2); cvWaitKey(0); return 0; }
small OpenCV source file, but when I try to Run it then it brakes with notorious
"The application was unable to start correctly (0xc0000005). Click OK to close the application."
What might be wrong and what would be solution to this problem?
- OpenCV (PreCompiled) is unzipped to "C:\OpenCV245PC\ (README, index.rst and CMakeLists.txt are there with all subfolders)
- Windows System PATH is set to C:\OpenCV245PC\build\x86\mingw\bin
- Eclipse GCC C++ Compiler, Include paths (-I) is set to "C:\OpenCV245PC\build\include"
- Eclipse MinGW C++ Linker, Library search path (-L) is set to: "C:\OpenCV245PC\build\x86\mingw\lib"
- Eclipse MinGW C++ Linker, Libraries (-l) are set to: opencv_calib3d245 opencv_contrib245 opencv_core245 opencv_features2d245 opencv_flann245 opencv_gpu245 opencv_highgui245 opencv_imgproc245 opencv_legacy245 opencv_ml245 opencv_nonfree245 opencv_objdetect245 opencv_photo245 opencv_stitching245 opencv_video245 opencv_videostab245
"On Windows 7 64 bit, AMD proc..." < -- > "Windows System PATH is set to C:\OpenCV245PC\build\x86\mingw\bin"
can it be, you're compiling a 64bit exe, and link to the 32bit libs/dlls ?
also, if your opencv version is 2.4.5, you'd have all libs like opencv_nonfree245 (not 240), right ?
No, I'm not compiling binaries - they are precompiled. I tried both x64 and x86 it's the same. As for opencv_nonfree245 (not 240), you are right - but I just posted wrong from my notes (copy & paste) because I also tried for seevral other (older versions) - but for the question i ask all libs were correct: such as opencv_nonfree245 - I will edit my post, to avoid confusion. | https://answers.opencv.org/question/15939/openvc-245-eclipse-cdt-juno-mingw-error-0xc0000005/?answer=15978 | CC-MAIN-2021-49 | refinedweb | 347 | 64.91 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.