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 |
|---|---|---|---|---|---|
It's not the same without you
Join the community to find out what other Atlassian users are discussing, debating and creating.
I'm using Jamie's wonderful script runner but I'm not a coder and can't seem to get by the nulpointerexception.
So far I have this:
def urgency = getCustomFieldValue("Urgency")
def complexity = getCustomFieldValue("Complexity")
def need = getCustomFieldValue("Need")
def effort = getCustomFieldValue("Effort")
def result = (effort * complexity) / (urgency * need)
return result
Those 4 custom fields are all numeric and so is my script field (as well as the template and searcher are all set up as numeric).
I guess I need some sort of test to ensure that all of those numbers are not null before trying to do the calculation or else return null?
Can someone give me the code I need? Thanks...
Does the error only happen when one of them is zero? You also need to handle the case of them being zero, as well as null.
Try something like the following, if it doesn't work can you post the stack trace...
def urgency = getCustomFieldValue("Urgency") ?: 0 def complexity = getCustomFieldValue("Complexity") ?: 0 def need = getCustomFieldValue("Need") ?: 0 def effort = getCustomFieldValue("Effort") ?: 0 if (urgency > 0 && need > 0) { return (effort * complexity) / (urgency * need) } else { return 0 // or some very high number }
Hi,
Well it didn't blow up so that's a positive step forward. But it calculated 0 where it should have calculated 2.25 for the test issue. effort = 3, complexity =3 , urgency =2, need =2
;-)
Hrmmm... are the names exactly as you have them above?
Ah...yes, one of the field names was not a duplicate of another type of field, so I have modified and it works like a charm! Thanks very, very much Jam. | https://community.atlassian.com/t5/Jira-questions/Help-with-syntax-for-scripted-field/qaq-p/301503 | CC-MAIN-2018-30 | refinedweb | 295 | 56.66 |
Definitions for the poll() function. More...
#include <sys/cdefs.h>
#include <sys/types.h>
Go to the source code of this file.
Definitions for the poll() function.
This file contains the definitions needed for using the poll() function, as directed by the POSIX 2008 standard (aka The Open Group Base Specifications Issue 7). Currently the functionality defined herein only works for sockets, and that is likely how it will stay for some time.
The poll() function works quite similarly to the select() function that it is quite likely that you'd be more familiar with.
Type representing a number of file descriptors.
Poll a group of file descriptors for activity.
This function will poll a group of file descriptors to check for the events specified on them. The function shall block for the specified period of time (in milliseconds) waiting for an event to occur. The function shall return as soon as at least one fd matches the events specified (or one of the error conditions), or when timeout expires. | http://cadcdev.sourceforge.net/docs/kos-2.0.0/poll_8h.html | CC-MAIN-2017-13 | refinedweb | 170 | 65.93 |
It's connection-based, no expression. so, amazingly fast!
How to install
1. Put this script in a script folder like here.
C:\Users\user\Documents\maya\2018\scripts
2. Run lines below in python tab.
import soft_ik_maya_ui_no
reload(soft_ik_maya_ui_no)
soft_ik_maya_ui_no
Before execute it, there are several requirements.
- Joints should be X axis down. (3rd joint doesn't matter)
- IkHandle shouldn't have point-constraint or parent-constraint. (Pole vector constraint is OK)
How to use
- Set string in a text box. This is going to be prefix for new locaters.
- Select a ikHandle and a object that is going to point-constrain the ikHandle. (maybe a curve for controler, maybe a locater for position offset )
- Push the button.
- You can find a attribute "Soft IK dist" on the constrain-object you selected. Set value.
How to delete
- Delete "xxx_SoftIK_Aim" locater and below.
- Delete "Soft_IK_dist" attribute.
You can see how it works in Andy Nicholas's original blog post. Thank you so much for sharing, Andy!
Please use the Feature Requests to give me ideas.
Please use the Support Forum if you have any questions or problems.
Please rate and review in the Review section. | https://ec2-34-231-130-161.compute-1.amazonaws.com/maya/script/soft-ik-like-xsi-for-maya | CC-MAIN-2022-40 | refinedweb | 195 | 70.8 |
#include<ioostream> #include<iomanip> using namespace std; int main () { //Variables float sum; //input of grades from the user float average; //calculated result float first_grade //student's first grade float second_grade //student's secoond grade float third_grade //student's third grade float drop_grade //student's drop grade float final_grade //student's final grade const int NUMBERS = 3; //Program Purpose cout << "This programe will determine the final grade of your History tests. You can\n" << "drop your lowest test grade. So it will add together the highest of the first\n" << "two grades and the third grade."<< endl << endl; //Prompt the user for the first grade cout << "\n Please enter the first test grade: "; cin.sync(); cin.clear(); cin >> first_grade; //Prompt the user for the second grade cout << "\n Please enter the second grade: "; cin.sync(); cin.clear(); cin >> second_grade; //Prompt the user for the third grade cout << "\n Please enter the second grade: "; cin.sync(); cin.clear(); cin >> third_grade; //Ask the user which grade they would like to drop cout << "\n Which grade would you like to drop: "; cin.sync(); cin.clear(); cin >> drop_grade; //Display the sum cout << "The final grade is" << final_grade << endl << endl; return 0; }
*** MOD EDIT: Added code tags. Please
This post has been edited by JackOfAllTrades: 15 October 2009 - 05:15 AM | http://www.dreamincode.net/forums/topic/132088-student-grade-calculator/ | CC-MAIN-2016-50 | refinedweb | 215 | 66.17 |
Download data from Drupal using Python
Project description
This python 3 module will help you to extract data from a Drupal 7 or 8 web site. This data can be later used for archiving or for migration to another CMS, such as Wagtail.
Motivation
Drupal is an open source CMS, written in PHP. It has a long history and many followers. A large number of web sites run on Drupal and there is a substantial development community. The product is extendable, there are plenty of useful modules available to enhance functionality of Drupal web sites.
Over the years there has been a number of major releases of Drupal. At the time of writing the most recent is Drupal 8. In the past migration from one major version to another was done in-place. However, in order to move from an earlier version to 8, the user must follow a process of migration, involving creating a basic deployment of Drupal 8 first and then using additional tools to copy the data from the old web site to the new. While this should work in theory, the reality seems a bit different.
I own a few very straightforward Drupal 7 web sites. They use a number of modules from the standard repository, but no custom code. The vast majority of the content are simple stories. Nonetheless, the migration was rather ugly - a lot of content didn’t make it over. What did, looked rather puny and definitely didn’t match the look and feel of my old web sites. Blocks were missing. In short, the result needed a lot of extra work to make it right.
I decided to revert to the old Drupal 7 deployment, which was, admittedly, easy, thanks to the fact that the migration did involve a fresh instance of Drupal. This was the short term fix. Given the effort of migration, I decided to move all my web sites to Django + Wagtail, which would give me much more freedom in managing my data and, hopefully, will prove a good long term solution. To be fair, Drupal has lasted me more than 10 years, so it wasn’t a bad journey overall. But I do hate to code in PHP, so getting rid of it for good fills my heart with joy.
To achieve this move from Drupal to Django I need to extract the data from the former in some readable format. Luckily, there are simple export facilities built into the CMS. This Python package uses them in order to download the data. There is a generic API to handle each downloaded object, such as node, comment, vocabulary term etc, or to simply dump everything as JSON into files. The task of shaping this extracted data into something suitable for Django or any other target you might have in mind is entirely yours.
Usage
Python support
Only Python 3 is supported at the moment. Let Python 2 die in quiet dignity!
Drupal support
Currently Drupal 7 and 8 are supported. In theory this module could work with previous versions of Drupal and it might work with some future ones as well. Your mileage can vary.
Installation
This package is available on PyPi. Simply use pip to install (assuming you are running in a Python 3 virtual environment):
pip install drupal_download
On a Drupal web site
First, you must enable a JSON-based REST API in Drupal. Naturally, both 7 and 8 will have different ways to achieve this (evil laughter!).
Make the relevant configuration changes and take node of the APIs endpoints. Make sure you configure the desired authentication controls. At the moment, the module supports these methods:
- Anonymous - no authentication is needed. This also means that anyone can access you endpoint and download the data
- HTTP Basic - the standard basic authentication
- Session - cookie-driven authentication, the same in fact, that you use when accessing a Drupal site interactively
NB: I very strongly recommend using HTTPS for all these communications. If you don’t have an SSL certificate yet and can’t afford one, get one for free from Letsencrypt.
Drupal 8
While the same services module has a version for Drupal 8, it doesn’t work. It looks like a port job abandoned in the middle. However, Drupal 8 includes a support for RESTful APIs in the core. Naturally, it works a bit differently from the services module. In particular, services exposes an index view of, say, nodes. This view contains only the bare bones information about each node. It also has a link to the view with the full details, which the module follows. Drupal 8 RESTful API on the other hand can export all the fields in the main view. Read more about it here. Note, that the half cooked Drupal 8 services port causes the built in RESTful API to break somehow, if enabled. For faster downloads you are advised to use larger page sizes in the view configuration.
In a script
You can use the API from this module directly, in this manner:
def data_callback(obj): # process the data dl = Drupal7DadaDownloader("", "john", "123", AuthType.CookieSession, data_callback) dl.load_data()
From the command line
Alternatively, there is a simple command line tool shipped with this module. You can invoke it like this:
python3 -m download_drupal --help
This will display some help information. Calling it like this:
python3 -m download_drupal -b --username jane --password secret --auth-type CookieSession -o example_node.json --drupal-version 7
will download all nodes from a Drupal 7 website.
Project details
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/drupal-download/ | CC-MAIN-2021-04 | refinedweb | 940 | 64.3 |
news.digitalmars.com - digitalmars.DDec 31 2012 Cent/UCent as library types (6)
Dec 31 2012 How to correctly handle immutable ranges (7)
Dec 30 2012 push rights for deimos repos (3)
Dec 30 2012 DList -- removing an element (1)
Dec 30 2012 ref is unsafe (68)
Dec 29 2012 Python-like slicing and handling UTF-8 strings as a bonus (9)
Dec 29 2012 identifier full name (3)
Dec 28 2012 Social comments integrated with dlang.org (54)
Dec 28 2012 Ranges longer than size_t.max (33)
Dec 28 2012 DMD build (26)
Dec 28 2012 Private default arguments? (16)
Dec 27 2012 std.bitmanip improvements (14)
Dec 26 2012 nothrow in druntime win32 C bindings (24)
Dec 26 2012 migration guides (1)
Dec 26 2012 What's up with the windows headers? (38)
Dec 26 2012 8505 (24)
Dec 26 2012 D issue system sucks? (4)
Dec 26 2012 Parsing error (3)
Dec 26 2012 DMD didn't support extern(C++) struct function in windows dmd2.061 (1)
Dec 25 2012 Learning Haskell makes you a better programmer? (51)
Dec 25 2012 Smart pointers instead of GC? (311)
Dec 24 2012 auto ref and non-templated functions (33)
Dec 24 2012 Some pre-conditions at compile-time (reprise) (3)
Dec 24 2012 OT: Beware of Xmas and New Years Day (2)
Dec 24 2012 Windows x64 C-Runtime (1)
Dec 23 2012 final switch traps and improvements (4)
Dec 23 2012 moving away from changelog.dd? (42)
Dec 23 2012 auto in library functions (16)
Dec 23 2012 Inline D in Javascript (11)
Dec 23 2012 D "Swing" (40)
Dec 23 2012 new or no? (4)
Dec 23 2012 Segmentation fault (3)
Dec 22 2012 64 bit linker issues (3)
Dec 20 2012 [your code here] (1)
Dec 20 2012 About Go, D module naming (109)
Dec 20 2012 Range.init does not imply Range.empty==true (1)
Dec 20 2012 labeled block stement. (2)
Dec 19 2012 More range woes: std.array.save is invalid (15)
Dec 19 2012 Heap corruption in reading struct fields in ctor (1)
Dec 19 2012 The impoliteness of overriding methods (2)
Dec 19 2012 A thought about garbage collection (16)
Dec 19 2012 proposition to std.range: SortedRange.indexOf(value) (5)
Dec 19 2012 D as a Unity3D language (5)
Dec 18 2012 add phobos module std.halffloat ? (22)
Dec 18 2012 UDAs and templates (1)
Dec 18 2012 Javascript bytecode (76)
Dec 18 2012 UDA tuple flattening (2)
Dec 18 2012 Should compilers take advantage (abuse) of the new UDA syntax that has (27)
Dec 18 2012 DMD under 64-bit Windows 7 HOWTO (14)
Dec 18 2012 D's Greatest Bugbear (11)
Dec 18 2012 Paid support (1)
Dec 17 2012 Full Fledged Properties (4)
Dec 17 2012 Value ranges from contracts? (1)
Dec 17 2012 Troubles with user defined subtypes (1)
Dec 17 2012 Timsort vs some others (20)
Dec 17 2012 UDA: getAttributes does not play well with topleof (8)
Dec 17 2012 Curl and redirects (7)
Dec 17 2012 __traits(compiles, ...) returns true for syntactic garbage and for (11)
Dec 17 2012 explicit castable to bool for predicate restraints? (6)
Dec 16 2012 Integer semantic in D, what are the tradeoff ? Do we have numbers ? (7)
Dec 15 2012 Voldemort structs no longer work? (19)
Dec 15 2012 Compilation strategy (19)
Dec 15 2012 Quick and dirty Benchmark of std.parallelism.reduce with gdc 4.6.3 (1)
Dec 14 2012 Invalid trainling code unit (5)
Dec 14 2012 Significant GC performance penalty (23)
Dec 13 2012 Custom Memory Allocation and reaps (3)
Dec 13 2012 DList - Various Comments/Questions (3)
Dec 13 2012 SCons D tool: need help with building static library (2)
Dec 13 2012 Regression in type inference of array of delegates (1)
Dec 13 2012 Should alias this support implicit construction in function calls and (5)
Dec 12 2012 No bounds checking for dynamic arrays at compile time? (35)
Dec 12 2012 ModuleInfo.unitTest cannot be called twice (4)
Dec 12 2012 Forward reference not working in nested functions (5)
Dec 12 2012 Unit tests not run when linking with Tango (4)
Dec 11 2012 Nested Structs (19)
Dec 11 2012 For a Safeint (2)
Dec 11 2012 OT (partially): about promotion of integers (106)
Dec 11 2012 Is there any reason why arithmetic operation on shorts and bytes (39)
Dec 11 2012 RE: simpledisplay (3)
Dec 10 2012 [wiki] Contributing to D (1)
Dec 10 2012 Array Slices and Interior Pointers (20)
Dec 10 2012 Next focus: PROCESS (163)
Dec 09 2012 dlang.org Library Reference (83)
Dec 09 2012: it's official (9)
Dec 09 2012 Moving towards D2 2.061 (and D1 1.076) (139)
Dec 09 2012 struct in class feature (4)
Dec 09 2012 rtInfo issue (5)
Dec 09 2012 proposal for general dup function (22)
Dec 08 2012 Officially moving to MediaWiki? (17)
Dec 08 2012 casting objects is not working across dll boundaries (1)
Dec 07 2012 Status of wxD? (3)
Dec 07 2012 Concern about dmd memory usage on win32 (33)
Dec 07 2012 Problem with const correctness (13)
Dec 07 2012 the Disruptor framework vs The Complexities of Concurrency (25)
Dec 06 2012 opDispatch to template members (10)
Dec 06 2012 Input Range addition to associative arrays (13)
Dec 06 2012 New std.process revival (22)
Dec 06 2012 ctRegex vs. Regex vs. plain string (3)
Dec 06 2012 Building dmd from source guid (11)
Dec 06 2012 Doubt about alias this (2)
Dec 05 2012 Getting the source range (1)
Dec 05 2012 Better forum (80)
Dec 05 2012 Better forum (33)
Dec 05 2012 misoverloading (2)
Dec 05 2012 wrapping functions with variadic-parameter wrappers (9)
Dec 05 2012 Where are the template members? (5)
Dec 05 2012 Experimental Phobos modules? (18)
Dec 04 2012 Reproducing autotester failures (1)
Dec 04 2012 named field struct initialization (2)
Dec 04 2012 etruytiupi (1)
Dec 03 2012 Should Druntime and Phobos be built with -gs ? (6)
Dec 03 2012 D plugin for IntelliJ IDEA? (7)
Dec 02 2012 Bug or logic error in if with auto? (8)
Dec 01 2012 Need help with debugging Segfault (7)
Dec 01 2012 Deterministic replay engine (1)
Dec 01 2012 D-based internships in the UK (3)
Nov 30 2012 Garbage Collector (11)
Nov 30 2012 Deprecated Library Functions / Methods (57)
Nov 30 2012 Strange struct/atomicLoad behaviour (3)
Nov 30 2012 typeid() broken for interfaces? (47)
Nov 29 2012 D Stable Proposal (32)
Nov 29 2012 True value semantics for class or struct? (2)
Nov 29 2012 mixin templates with name parameter (3)
Nov 29 2012 arrays of const, postblit and RefCounted (6)
Nov 28 2012 Fixing cyclic import static construction problems (64)
Nov 28 2012 UDA + Pegged AST Hack (13)
Nov 28 2012 code review and continuous integration (gerrit+jenkins) (2)
Nov 27 2012 [RFC] semantics of containers of const (1)
Nov 27 2012 Breaking D2 language/spec changes with D1 being discontinued in a (108)
Nov 27 2012 Bikeshedding alert: Pragma naming convention (6)
Nov 27 2012 Unified handling of basic and user-defined type proposal (8)
Nov 26 2012 The future of UDAs. (7)
Nov 26 2012 Errors compiling DSSS (96)
Nov 26 2012 Help! (61)
Nov 26 2012 2 problems I can't get my head around (3)
Nov 25 2012 [RFC] Modules for processes manipulation (3)
Nov 25 2012 [RFC] Modules for template programming proposal (3)
Nov 25 2012 "foreach(i, dchar c; s)" vs "decode" (10)
Nov 25 2012 How multithreading works in hardware using D ==AND== difference b/w (13)
Nov 25 2012 Time to kill T() as (sometimes) working T.init alias ? (81)
Nov 25 2012 Feature request: Make "in" blocks part of the public interface (3)
Nov 24 2012 WinAPI and druntime [was: WinAPI for druntime and OpenGL for deimos] (4)
Nov 24 2012 std.signals2 status (1)
Nov 23 2012 ICE when breaking outer loop from switch statement (2)
Nov 23 2012 compiler for ubuntu x86-64 (5)
Nov 23 2012 DLLs and friends (8)
Nov 23 2012 externally imposed conditional compilation (13)
Nov 23 2012 WinAPI for druntime and OpenGL for deimos. (3)
Nov 23 2012 Array reverse (6)
Nov 22 2012 Your review matters. (1)
Nov 21 2012 dmd demangling (7)
Nov 21 2012 Ranges usages (8)
Nov 21 2012 Talk proposal (kinda): D Programming in D (Or: Writing idiomatic D (5)
Nov 21 2012 Array Operations: a[] + b[] etc. (26)
Nov 21 2012 DConf 2013 suggestion (6)
Nov 21 2012 Behavior of strings with invalid unicode... (4)
Nov 20 2012 Google Fight - D vs Go (3)
Nov 20 2012 DConf 2013 on kickstarter.com: we made it! (6)
Nov 20 2012 __gshared implicitly convertible to shared? (3)
Nov 19 2012 Downloadable spec for D version 2 (6)
Nov 19 2012 About Boost.SIMD (2)
Nov 19 2012 Is there interest in a std.http? (20)
Nov 19 2012 Multidimensional array operator overloading (6)
Nov 19 2012 Bret Victor - Inventing on Principle (14)
Nov 19 2012 foreach on const(V[K]) (5)
Nov 19 2012 The annoying D build system (9)
Nov 18 2012 split dmd frontend into separate project (5)
Nov 18 2012 property needed or not needed? (144)
Nov 18 2012 Bulding latest DMD and associated projects from github master (22)
Nov 18 2012 popFrontExactly? (13)
Nov 18 2012 [OT][Parsing] Parsing with Pictures (1)
Nov 18 2012 half datatype? (35)
Nov 18 2012 D Bugzilla: Products, Components and default assignees (1)
Nov 17 2012 Should core.sync.mutex.Mutex, core.sync.condition.Condition, (12)
Nov 17 2012 Seeking research papers on D (16)
Nov 17 2012 Length of fixed size arrays (7)
Nov 17 2012 ConstCPP (3)
Nov 16 2012 Custom checkers for Clang Static Analyzer [partially OT] (1)
Nov 16 2012 copying a struct containing a struct (7)
Nov 16 2012 Deprecation in core.sys.posix.termios (5)
Nov 16 2012 Request for "indexOf" undeprecation. (12)
Nov 15 2012 Delegate bug? (1)
Nov 15 2012 A simple question (38)
Nov 15 2012 Verified documentation comments (7)
Nov 15 2012 A working way to improve the "shared" situation (4)
Nov 15 2012 D is awesome (3)
Nov 14 2012 [RFC] A huge problem with Github diff (16)
Nov 14 2012 missing link to .mobi file (2)
Nov 14 2012 dlang.org: library reference (3)
Nov 14 2012 What's the deal with __thread? (11)
Nov 13 2012 function overload on full signature? (28)
Nov 13 2012 Growing a Language (32)
Nov 13 2012 postblit, const(T) copy, dealing with structs (3)
Nov 13 2012 iota with custom boundary conditions (7)
Nov 12 2012 I'm back (127)
Nov 12 2012 dmd: ../ztc/aa.c:423: void AArray::rehash_x(aaA*, aaA**, size_t): (2)
Nov 12 2012 hashed array? (40)
Nov 12 2012 Compiler bug? (alias sth this; and std.signals) (13)
Nov 11 2012 error help (3)
Nov 11 2012 alias this to a template function (8)
Nov 11 2012 Something needs to happen with shared, and soon. (223)
Nov 11 2012 Is instantiabilty of templated types decidable? (13)
Nov 11 2012 GDC is this a bug or a feature? (2)
Nov 11 2012 Undefined identifier WIN32_FILE_ATTRIBUTE_DATA (16)
Nov 10 2012 precise gc? (8)
Nov 10 2012 Lenses-like in D (1)
Nov 10 2012 Binary compatibility on Linux (39)
Nov 10 2012 [OT] Ubuntu 12.10 guest in VirtualBox completely broken (25)
Nov 09 2012 std.net.curl problem (5)
Nov 09 2012 Settling rvalue to (const) ref parameter binding once and for all (3)
Nov 09 2012 Pyd thread (9)
Nov 09 2012 Immutable and unique in C# (33)
Nov 09 2012 PVS-Studio on DMD (2)
Nov 09 2012 D Linking library behaviour (5)
Nov 08 2012 Issue 8340: dmd backend bug (2)
Nov 08 2012 Regarding opCast(bool) class method (3)
Nov 08 2012 New language name proposal (11)
Nov 08 2012 Walter should start a Seattle D interest group (5)
Nov 08 2012 Getting rid of dynamic polymorphism and classes (28)
Nov 07 2012 UDAs - Restrict to User Defined Types? (47)
Nov 07 2012 [RFC] Fix `object.destroy` problem (5)
Nov 07 2012 a small study of "deprecate" (10)
Nov 07 2012 [RFC] Add an operator for ranges to D. Pros and cons? (11)
Nov 06 2012 Struct-nested structs (1)
Nov 06 2012 One old problem with associative arrays (4)
Nov 06 2012 deprecate deprecated? (52)
Nov 06 2012 [ ArgumentList ] vs. ( ArgumentList ) (138)
Nov 06 2012 Proposal to deprecate "retro.source" (6)
Nov 06 2012 dcollections (4)
Nov 06 2012 DSource server issues (1)
Nov 06 2012 Proposal for "Classic DList" (CDList) (3)
Nov 05 2012 How do you remove/insert elements in a dynamic array without (20)
Nov 05 2012 How do you remove/insert elements in a dynamic array without (1)
Nov 05 2012 DConf 2013 to be recorded (13)
Nov 05 2012 Pegged Master - Semantic Actions - dmd 2.060 (1)
Nov 05 2012 std.signals2 proposal (19)
Nov 05 2012 C++ to catch up? (31)
Nov 04 2012 Why does std.variant not have a tag? (8)
Nov 04 2012 Generic and fundamental language design issue (17)
Nov 04 2012 D vs C++ metaprogramming: why are c++ templates inherently slow (3)
Nov 04 2012 version(deprecated)? (10)
Nov 04 2012 Request some guidance regarding I/O (1)
Nov 03 2012 Slicing static arrays should be system (11)
Nov 03 2012 CTFE, std.move & immutable (3)
Nov 03 2012 [OT] D mentioned in Channel 9 TypeScript/Dart interview (5)
Nov 03 2012 News and problems about foreach loops (5)
Nov 02 2012 Simple implementation of __FUNCTION (23)
Nov 02 2012 D vs C++11 (61)
Nov 02 2012 To take a part in development (4)
Nov 02 2012 OT: NAND to Tetris (2)
Nov 02 2012 'with' bug? (23)
Nov 01 2012 Scaling Scala Vs Java (12)
Nov 01 2012 mixin functions (4)
Nov 01 2012 D is a cool language! (6)
Oct 31 2012 Deimos submission - Nanopb (9)
Oct 31 2012 OSX Installer (3)
Oct 31 2012 Procedure for submitting a new Deimos project? (3)
Oct 31 2012 How do you copy a const struct to a mutable? (2)
Oct 31 2012 A little Py Vs C++ (66)
Oct 31 2012 D2 auto tester is hung on specific unittest (1)
Oct 30 2012 Transience of .front in input vs. forward ranges (84)
Oct 30 2012 [OT] .NET is compiled to native code in Windows Phone 8 (11)
Oct 30 2012 Status of Decimal Floating Point Module (1)
Oct 30 2012 What is the use case for this weird switch mecanism (21)
Oct 30 2012 opDollar questions (2)
Oct 29 2012 Has anyone built DStep for Win? (2)
Oct 29 2012 Imports with versions (10)
Oct 29 2012 DMD on Haiku? (17)
Oct 29 2012 Command Line Order + Linker Errors (6)
Oct 29 2012 Decimal Floating Point types. (9)
Oct 29 2012 Kickstarter and Conference (3)
Oct 29 2012 "isDroppable" range trait for slicing to end (27)
Oct 28 2012 Can't use a C++ class from a DLL (8)
Oct 28 2012 Equality of ForwardRanges (4)
Oct 28 2012 To avoid some linking errors (61)
Oct 28 2012 The D wiki engine must be replaced (14)
Oct 27 2012 Array in array (4)
Oct 27 2012 assert(false, "...") doesn't terminate program?! (1)
Oct 27 2012 [GtkD] Error 1: Previous Definition Different : __Dmain (7)
Oct 26 2012 automatic mixin in classes (5)
Oct 26 2012 Another day in the ordeal of cartesianProduct (23)
Oct 26 2012 rawCopy, rawTransfer, rawFind ? (2)
Oct 26 2012 Developing operating systems in GC enabled languages (1)
Oct 25 2012 dlang.org slow? (10)
Oct 25 2012 Travis CI - Continuous Integration Testing Server (20)
Oct 24 2012 conv.to for enums (1)
Oct 24 2012 static and non-static version of the one function (3)
Oct 24 2012 Why D is annoying =P (87)
Oct 24 2012 Invite Distributions to the D-Conf! (1)
Oct 24 2012 [just talk] what if implicitly typed literals were disallowed (12)
Oct 24 2012 On D development (5)
Oct 24 2012 Passing static arrays to C (13)
Oct 23 2012 Very simple SIMD programming (28)
Oct 23 2012 Uri class and parser (54)
Oct 23 2012 Structs, Speed and refs. (4)
Oct 22 2012 [proposal] version statements with multiple arguments. (9)
Oct 22 2012 SCons and gdc (3)
Oct 22 2012 DConf 2013 on kickstarter.com: we're live! (65)
Oct 22 2012 splitter semantics (2)
Oct 22 2012 Normal/Gaussian random number generation for D (22)
Oct 22 2012 Download link on digitalmars.com outdated (1)
Oct 22 2012 Mac OS installer (33)
Oct 22 2012 Mixin replacement for switch...case? (12)
Oct 22 2012 dmd -run and command line argument order (3)
Oct 21 2012 Why does std.string.splitLines return an array? (5)
Oct 21 2012 A small bug database (1)
Oct 21 2012 [RFC] ColorD (82)
Oct 21 2012 printing Throwables in druntime (2)
Oct 21 2012 Is there any way to create something like this? (5)
Oct 20 2012 New std.process? (12)
Oct 20 2012 Error message for lookups went anwful since 2.059 (2)
Oct 20 2012 Using std.net.curl on Ubuntu 12.04 32bit - linker errors (2)
Oct 20 2012 Anyone have D protobuf? (7)
Oct 19 2012 Array of structs construction (9)
Oct 19 2012 private is non-virtual: Stuck in C++-thinking? (10)
Oct 19 2012 Request for Help: D tool for SCons (2)
Oct 18 2012 What about std.lockfree ? (4)
Oct 17 2012 Const ref and rvalues again... (106)
Oct 17 2012 Bits rotations (8)
Oct 17 2012 Regarding hex strings (48)
Oct 17 2012 Optimizing out unnecessary allocations (6)
Oct 17 2012 isInfinite isInadequate (26)
Oct 17 2012 "is" bug with inout type + voldemort ? (1)
Oct 17 2012 Shared keyword and the GC? (36)
Oct 16 2012 Export statement? (2)
Oct 16 2012 make install; where do .di files go? (4)
Oct 16 2012 More range woes: composed ranges are unsafe to return from functions (1)
Oct 15 2012 Tricky semantics of ranges & potentially numerous Phobos bugs (15)
Oct 15 2012 alias A = B; syntax (27)
Oct 15 2012 More D & Rust (14)
Oct 15 2012 SList!(Tuple!int) == error? (2)
Oct 15 2012 Cartesian product of infinite ranges, round 2 (2)
Oct 15 2012 Strange Loop 2012 (5)
Oct 15 2012 Add these to Phobos? (13)
Oct 15 2012 SEH in DMD2.059 (1)
Oct 15 2012 Account on ARM/Debian (29)
Oct 15 2012 Important packages (2)
Oct 15 2012 Import improvement (40)
Oct 15 2012 48 hour game jam (32)
Oct 15 2012 D interface for C library problems (8)
Oct 14 2012 D seems interesting, but... (78)
Oct 14 2012 OPTLINK is missing files when I try to include debugging info into (5)
Oct 14 2012 More purity in Rust (1)
Oct 14 2012 Making TypeInfo.next() return a const(TypeInfo) was a bad idea (6)
Oct 14 2012 Why splitter() doesn't work? (11)
Oct 14 2012 Recommened way to iterate on a narrow string (2)
Oct 13 2012 Mysterious OPTLINK crash on Win7 x64 (3)
Oct 13 2012 RFC: Pinning interface for the GC (11)
Oct 13 2012 Feature request: enum init shouldn't create a new enumeration (12)
Oct 12 2012 toStringz for UTF-16 (7)
Oct 12 2012 Bug in countUntil? (4)
Oct 12 2012 Explicit TCE (14)
Oct 12 2012 BNF grammar for D? (9)
Oct 11 2012 delegate opCall? (1)
Oct 11 2012 Re: dlibgit sample - concurrency issues (1)
Oct 11 2012 Which build tool to package for Debian? (1)
Oct 11 2012 Debugging experience on Mac OS X (3)
Oct 10 2012 Tips for debugging EXC_BAD_ACCESS (10)
Oct 10 2012 List of reserved words (26)
Oct 10 2012 Emacs D Mode (9)
Oct 10 2012 GC statistics (9)
Oct 10 2012 DIP20: Volatile read/write intrinsics (13)
Oct 10 2012 GC is reclaiming live objects (4)
Oct 10 2012 Gathering info for D/Embedded presentation (7)
Oct 10 2012 Error messages for newbies survey (4)
Oct 10 2012 std.digest: can we get rid of start() functions? (8)
Oct 10 2012 #pragma comment (lib, ...) (82)
Oct 09 2012 Thoughts on tuple indexing syntax... (1)
Oct 09 2012 std.algorithm.map + std.algorithm.joiner = broken forward range (3)
Oct 09 2012 /usr/src/d/phobos/std/range.d(4590): Error: variable upper used (3)
Oct 09 2012 Any interest in libgit bindings? (17)
Oct 09 2012 next_permutation and cartesian product for ranges? (22)
Oct 09 2012 rvalue arguments passable as const references (3)
Oct 08 2012 Avoiding some template bloat? (3)
Oct 08 2012 What is the case against a struct post-blit default constructor? (50)
Oct 08 2012 Windows DLLs and TLS (32)
Oct 07 2012 object states (5)
Oct 07 2012 Struct polymorphism? (5)
Oct 07 2012 DMD 2.060 (7)
Oct 06 2012 When will we have std.log? (9)
Oct 06 2012 opCall/ctor partially sorted out (7)
Oct 06 2012 Preliminary submission - std.rational and std.typelist (38)
Oct 06 2012 The sorry state of the D stack? (50)
Oct 05 2012 Running test suites under Windows 7 (5)
Oct 05 2012 OutputRange should be infinite? (16)
Oct 05 2012 FYI: Custom Search using digitalmars (11)
Oct 05 2012 Implicit instantiation of parameterless templates (13)
Oct 04 2012 Unsafe variadic arguments -> array assignment (2)
Oct 04 2012 Module self-imports (5)
Oct 04 2012 Feature request: extending comma operator's functionality (29)
Oct 04 2012 std.concurrency and fibers (18)
Oct 04 2012 "instanceOf" trait for conditional implementations (10)
Oct 04 2012 parse and skipWhite (2)
Oct 04 2012 T.init and disable this (18)
Oct 03 2012 D3 suggestion: rename "range" to "sequence" (17)
Oct 03 2012 Will the D GC be awesome? (41)
Oct 03 2012 Debian packages for D libraries (6)
Oct 03 2012 SHA-3 is KECCAK (28)
Oct 02 2012 How do I run DMD unittests on win32? (7)
Oct 02 2012 Is it possible to tag pull requests? (4)
Oct 02 2012 std.intrinsic? (3)
Oct 02 2012 openMP (16)
Oct 02 2012 zero-terminated strings, string literals, etc (2)
Oct 02 2012 "IndexType" for ranges (24)
Oct 02 2012 Setting defaults to variadic template args (6)
Oct 02 2012 Proposal: clean up semantics of array literals vs string literals (16)
Oct 01 2012 std.lexer? (3)
Oct 01 2012 __ctfe (6)
Oct 01 2012 qtD (28)
Oct 01 2012 RFC: DConf 2013 (21)
Oct 01 2012 [OT] Gibberish webpages (3)
Oct 01 2012 A study on immutability usage (10)
Sep 30 2012 It seems pure ain't so pure after all (52)
Sep 29 2012 Getting started with D - Phobos documentation sucks (45)
Sep 28 2012 Idea: Introduce zero-terminated string specifier (53)
Sep 28 2012 I have a feature request: "Named enum scope inference" (28)
Sep 28 2012 I think we need to standardize where D headers are to be installed (3)
Sep 27 2012 Dangling if (1)
Sep 27 2012 Rust and D (40)
Sep 27 2012 HMAC-SHA1 (4)
Sep 26 2012 dynamic library building and loading (68)
Sep 26 2012 since LDC install command is listed for Fedora... (1)
Sep 26 2012 std.math.frexp wrong on ARM (3)
Sep 26 2012 Visual D fails to build after Windows updates (3)
Sep 26 2012 Visula D fails to build after Windows updates (3)
Sep 26 2012 How to get publicity for D. (4)
Sep 26 2012 switch using a variable that can cast to both integer and string (5)
Sep 25 2012 Order of evaluation - aka hidden undefined behaviours. (30)
Sep 25 2012 Ch-ch-changes (19)
Sep 25 2012 Should this be flagged as a warning? (9)
Sep 25 2012 implicit conversion from bool to char, is it really necessary ? (8)
Sep 25 2012 Is flags enum needed in Phobos? (23)
Sep 25 2012 Function prototype + definition in the same file (26)
Sep 25 2012 std.range should support recursion (Was: One-line FFT, nice!) (13)
Sep 24 2012 Should this be flagged as a warning? (1)
Sep 24 2012 C# wish list (2)
Sep 24 2012 Neat: UFCS for integer dot operator suffix (7)
Sep 23 2012 DIP19: Remove comma operator from D and provision better syntactic (165)
Sep 23 2012 Re: ref, safety, (5)
Sep 23 2012 GetStockObject -- symbol undefined error (2)
Sep 23 2012 [OT] C# scores again for game development (6)
Sep 22 2012 2.060 deb package on Linux Mint 13 (8)
Sep 22 2012 It's always something (5)
Sep 21 2012 GC.malloc problems with the DMD (1)
Sep 20 2012 GDC Explorer - an online disassembler for D (16)
Sep 20 2012 CTFE calling a template: Error: expression ... is not a valid (7)
Sep 20 2012 Infer function template parameters (19)
Sep 20 2012 LDC blacklisted in Ubuntu (38)
Sep 20 2012 Extending unittests [proposal] [Proof Of Concept] (41)
Sep 20 2012 Weird Link Error (7)
Sep 20 2012 From APL (2)
Sep 19 2012 dlang.org went down momentarily? (1)
Sep 19 2012 Why do not have `0o` prefix for octal numbers? (5)
Sep 19 2012 D operator overloading. Why that way? (3)
Sep 19 2012 no-arg constructor for structs (again) (19)
Sep 18 2012 Reference semantic ranges and algorithms (and std.random) (20)
Sep 17 2012 Review of Andrei's std.benchmark (71)
Sep 17 2012 Struct problems (2)
Sep 17 2012 std.benchmark redux (5)
Sep 17 2012 built-in array ptrEnd (13)
Sep 17 2012 A partial template application literal syntax (5)
Sep 17 2012 int[][] better type match than int[] for int[]?! (3)
Sep 17 2012 About default parameters in variadic templates (3)
Sep 16 2012 Zero-width space (U+200B) on dlang.org navigation panel (2)
Sep 16 2012 Regression in 2.060 - corruption when lambda closes over foreach (4)
Sep 16 2012 totally satisfied :D (159)
Sep 16 2012 array.sort - What algorithm is being used here? (6)
Sep 16 2012 SpanMode uses incorrect terminology (breadth) (19)
Sep 15 2012 Importing dwmapi.dll (3)
Sep 15 2012 d lang on cluster HPC/OpenMPI solution? (1)
Sep 15 2012 References in D (127)
Sep 14 2012 classes structs (13)
Sep 14 2012 [Win32] Remotely execute functions of a D program (11)
Sep 14 2012 Memory leak - only with large data set (4)
Sep 14 2012 std.net.curl: Bad timeout defaults (6)
Sep 13 2012 Whether it is possible to produce PURELY statically linked program in (2)
Sep 13 2012 Whether it is possible to produce PURELY statically linked program in (2)
Sep 12 2012 Possible Bug? (2)
Sep 12 2012 BIg semantic issues with SList & DList (3)
Sep 12 2012 DMD in distribute of linux (6)
Sep 12 2012 std.lifetime? (3)
Sep 11 2012 Is anyone able to contribute a Solaris machine to the auto tester (2)
Sep 10 2012 Wrong code gen / missing warning / my mistake? (5)
Sep 10 2012 Dlist (and SList) splice operations (1)
Sep 09 2012 Allow auto in function parameters with default arguments? (5)
Sep 09 2012 [OT] Keeping algorithm and optimisations separated (4)
Sep 09 2012 Eliminate redundancy of dup/idup (22)
Sep 09 2012 new A().b() currently requires extra brackets/parentheses (16)
Sep 08 2012 One-line FFT, nice! (11)
Sep 07 2012 Status on Precise GC (17)
Sep 07 2012 Would like to see ref and out required for function calls (64)
Sep 07 2012 std.hash, when? (6)
Sep 06 2012 About the future Rust GC (2)
Sep 06 2012 core.simd 3 operand instructions? (6)
Sep 05 2012 What are the differences between these forms of function-like (9)
Sep 05 2012 Shouldn't c_long and c_ulong be library typedefs? (5)
Sep 05 2012 Building LDC from source (20)
Sep 05 2012 Phobos Help Request: Aliases and CTFE (1)
Sep 05 2012 Breaking out of multiple loops (10)
Sep 05 2012 LDC (22)
Sep 05 2012 Deserializing const fields (6)
Sep 04 2012 scope for array parameters (16)
Sep 03 2012 pointers, functions, and uniform call syntax (43)
Sep 03 2012 D and SCons (2)
Sep 02 2012 runtime eval / mixin inside a D shell or debugging session (2)
Sep 02 2012 Trouble creating a formatted assert wrapper (20)
Sep 02 2012 handful and interval (69)
Sep 02 2012 version(assert) (3)
Sep 02 2012 I won't be for the pull requests review today (2)
Sep 01 2012 std.boxer (2)
Sep 01 2012 Embedded non-assignable containers (3)
Sep 01 2012 Forum bug ? (1)
Aug 31 2012 DIP18: Non-GC threads (36)
Aug 31 2012 Is anyone working on a new std.variant? (4)
Aug 30 2012 Can DMD be built with g++? (4)
Aug 30 2012 D-style mixins in C# (2)
Aug 30 2012 alias this (5)
Aug 29 2012 Vote for std.digest: ACCEPTED! (4)
Aug 29 2012 Extending UFCS (5)
Aug 28 2012 Why can't we make reference variables? (42)
Aug 28 2012 Some lazy code to D (7)
Aug 28 2012 ARM? (6)
Aug 28 2012 Cross-compilation (3)
Aug 26 2012 Function pointers/delegates default args were stealth removed? (120)
Aug 26 2012 staticIndexOf is incredibly slow and memory intensive (3)
Aug 25 2012 best practices tutorial needed (for function signature, class vs (8)
Aug 25 2012 bug with std.range.zip? range with opEquals(const) const not allowed (7)
Aug 24 2012 D-etractions A real world programmers view on D (91)
Aug 24 2012 Openings For Freshers (1)
Aug 23 2012 Consistency, Templates, Constructors, and D3 (38)
Aug 23 2012 Phobos unittest failure on single-core machines (4)
Aug 23 2012 Non-virtual private struct inheritance (3)
Aug 23 2012 Formatted read consumes input (20)
Aug 22 2012 profiler issues: time overflows, conversion to seconds, gui/html (5)
Aug 22 2012 More on vectorized comparisons (11)
Aug 22 2012 Ascii matters (14)
Aug 22 2012 [GSOC] New unicode module beta, with Grapheme support! (7)
Aug 22 2012 Vote for the new std.hash (oops, std.digest) (36)
Aug 21 2012 On Static If and more (1)
Aug 21 2012 Who have to close fixed issue?! (3)
Aug 21 2012 Null references (21)
Aug 21 2012 D language book errata + chapter 13. SharedList code listing confusion (3)
Aug 21 2012 D language book errata + chapter 13. SharedList code listing confusion (3)
Aug 20 2012 Typedef keyword (2)
Aug 20 2012 Failed unittest (3)
Aug 19 2012 Dynamic loading, (12)
Aug 19 2012 Contribution to the D Programming Language (6)
Aug 19 2012 trait for (ddoc)-comments (17)
Aug 19 2012 Interfacing to C++ / Fltk (2)
Aug 17 2012 Koka language (1)
Aug 17 2012 cast oddities - void* <-> AA (5)
Aug 17 2012 D license (4)
Aug 17 2012 dmd source code newsgroup? (4)
Aug 16 2012 How feasible to wrap Nvidia Toolkit for CUDA Programming (5)
Aug 16 2012 What guarantees does D 'const' provide, compared to C++? (75)
Aug 16 2012 QtD lisence (14)
Aug 16 2012 Fragile ABI (47)
Aug 16 2012 DMD 2.060 OSX Installer: Error 404 (2)
Aug 15 2012 D language as script through JVM (13)
Aug 14 2012 Unions destructors and GC precision (8)
Aug 13 2012 bug with auto or what? (2)
Aug 13 2012 Broken NVI support (5)
Aug 13 2012 DMD diagnostic - any way to remove identical lines from final dmd (11)
Aug 12 2012 A C++ interpreter (25)
Aug 12 2012 D for Suneido (6)
Aug 12 2012 DFL (9)
Aug 12 2012 Why won't this compile using DMD? (6)
Aug 11 2012 Do infinite bidirectional ranges make any sense? (2)
Aug 11 2012 Exception programming difficult (48)
Aug 11 2012 finish function for output ranges (16)
Aug 11 2012 Modulo Bug? (22)
Aug 10 2012 Strange fallout changing modules (2)
Aug 10 2012 MPI Concurrency library update? (7)
Aug 10 2012 Access template parameters at runtime (18)
Aug 10 2012 Example of Rust code (36)
Aug 09 2012 Module Paths (5)
Aug 09 2012 D Thrift library errors in 2.060 (3)
Aug 09 2012 Which D features to emphasize for academic review article (78)
Aug 08 2012 Anyone tried wrapping DMD with Swig? (3)
Aug 08 2012 std.algorithm countUniq pull request (1)
Aug 08 2012 Timer and Event class (3)
Aug 08 2012 Re: D Lexer (3)
Aug 08 2012 Can not overload template method function with const. Bug? (7)
Aug 07 2012 The review of std.hash package (111)
Aug 06 2012 Ubuntu 12.04 and DMD 2.060 (15)
Aug 06 2012 Believe couple of open bugs are fixed in v2.060, stuck on another (2)
Aug 06 2012 Renamed import for current module (1)
Aug 06 2012 Functional programming in D and some reflexion on the () optionality. (30)
Aug 06 2012 Why no implicit cast operators? (7)
Aug 06 2012 std.hash: Ready for review (review manager needed) (2)
Aug 04 2012 core.simd woes (82)
Aug 04 2012 Fast Hashing (1)
Aug 04 2012 enums and std.traits (11)
Aug 04 2012 Unable to compile on Windows 7 64bit (2)
Aug 04 2012 property (50)
Aug 04 2012 DMD 2.060 problems (4)
Aug 03 2012 Templates and stringof... (10)
Aug 03 2012 wc example (2)
Aug 03 2012 Discuss 2.060 on Reddit (2)
Aug 03 2012 Let's not make invariants const (33)
Aug 03 2012 Release items (9)
Aug 02 2012 Is D Language mature for MMORPG Client ? (58)
Aug 02 2012 OT: Editors (3)
Aug 02 2012 Suggestion for future betas: Packages (5)
Aug 02 2012 Why do you decode ? (Seriously) (6)
Aug 01 2012 dlang google summary (7)
Aug 01 2012 std.d.lexer requirements (193)
Aug 01 2012 What would need to be done to get sdc.lexer to std.lexer quality? (21)
Aug 01 2012 Timers: setInterval and setTimeout (2)
Aug 01 2012 "Scheduled" for deprecation keyword (3)
Aug 01 2012 json and ddoc (10)
Aug 01 2012 containers, iteration, and removal (8)
Jul 31 2012 Allocating Executable Memory (14)
Jul 31 2012 OT: phobos name (14)
Jul 30 2012 Different results for uniform random number generation between D (4)
Jul 30 2012 UTF8 + SIMD = win (13)
Jul 30 2012 AA iteration of keys and values (1)
Jul 30 2012 Incomprehensible compiler errors (81)
Jul 30 2012 One against binary searches (11)
Jul 29 2012 A successful Git branching model (6)
Jul 29 2012 D language and .NET platform (25)
Jul 29 2012 yield iteration (8)
Jul 29 2012 OpenACC (1)
Jul 29 2012 std.variant benchmark (26)
Jul 28 2012 Review Queue: Should We Start Reviews Again? (13)
Jul 28 2012 Pull tester (10)
Jul 27 2012 enhancing forum features: 1click upvote, sorting, 1click duplicate etc (6)
Jul 27 2012 trusted considered harmful (40)
Jul 27 2012 Type safety + auto = win! (4)
Jul 27 2012 [Deimos] =?UTF-8?B?4oCTIGxpYm5vdGlmeSBiaW5kaW5ncw==?= (7)
Jul 27 2012 linking druntime in when C calls D and C implements main() (4)
Jul 27 2012 interfaces and such (6)
Jul 26 2012 Creating a shared library under Linux? (7)
Jul 26 2012 Impressed (184)
Jul 26 2012 D support in Exuberant Ctags 5.8 for Windows (22)
Jul 26 2012 Variable interpolation in strings (4)
Jul 26 2012 Inherited mutability, freeze, thaw and more in Rust (2)
Jul 26 2012 Can you do this in D? (33)
Jul 25 2012 I just have to say that string mixins rock (3)
Jul 25 2012 temporary files - what is the resolution? (7)
Jul 25 2012 Built-in array ops (1)
Jul 25 2012 Multi-threaded GUI (18)
Jul 25 2012 phobos breakage... why? (16)
Jul 25 2012 Struct no-arg constructor? (7)
Jul 24 2012 Help me! (5)
Jul 24 2012 [OT] Good^H^H^H^HAcceptable NG/email client? (12)
Jul 24 2012 Rank The D Programming Language (7)
Jul 24 2012 What is the compilation model of D? (25)
Jul 24 2012 Take and website (10)
Jul 24 2012 std.net.curl - HTTP.Method.options - perform() (3)
Jul 24 2012 Study: build times for D programs (66)
Jul 23 2012 dmd: template.c:5540: Identifier* (3)
Jul 23 2012 DMD 2.1.0? (13)
Jul 23 2012 feature request: with(var decl) {} (10)
Jul 23 2012 Random sampling next steps (2)
Jul 23 2012 Getting a template parameter list (6)
Jul 23 2012 Troubles with immutable arrays (4)
Jul 23 2012 of "Conditional Implementation" vs "Assertive Input Validation" (18)
Jul 22 2012 Rewrite rules? (1)
Jul 22 2012 Computed gotos on Reddit (56)
Jul 22 2012 std.loader; depreciated and removed for 2.060 (2)
Jul 22 2012 How to write OS in D? (3)
Jul 22 2012 improving std.array.array (4)
Jul 22 2012 getting to know dmd and druntime (1)
Jul 21 2012 Incorrect warning: use '{ }' for an empty statement, not a ';' (3)
Jul 21 2012 Time for std.reflection (45)
Jul 21 2012 Optional name mangling (31)
Jul 21 2012 =?utf-8?B?VGhlcmUgaXMgbm90aGluZyBjb29sZXIgdGhhbiBhIG1hY3ItIEVycuKApiA=?= (2)
Jul 20 2012 OSCON 2012 notes (44)
Jul 20 2012 Semantics of postfix ops for classes (3)
Jul 20 2012 std.random and mersenne twister (19)
Jul 19 2012 Preview LLVM Deimos bindings (15)
Jul 19 2012 #d_lang ----> #dlang on Twitter? (10)
Jul 19 2012 Object Pool (1)
Jul 19 2012 Just where has this language gone wrong? (97)
Jul 18 2012 DMD stuck at semantic analyze (1)
Jul 18 2012 Formal request to remove "put(OutRange, RangeOfElements)" (5)
Jul 18 2012 Random sampling in D -- blog post (4)
Jul 18 2012 Initialization of std.typecons.RefCounted objects (10)
Jul 18 2012 Re-thinking D's modules (29)
Jul 17 2012 Octal Literals (16)
Jul 17 2012 reference to 'self' inside a function (37)
Jul 17 2012 Definition of "OutputRange" insuficient (4)
Jul 16 2012 K&R-style variadic functions (41)
Jul 16 2012 Why doesn't to!MyEnumType(42) work (7)
Jul 16 2012 Need runtime reflection? (9)
Jul 16 2012 review queue status (6)
Jul 16 2012 std.algorithm imporvments (6)
Jul 16 2012 Progress on std.container (4)
Jul 15 2012 Creator of ZeroMQ and AMQP comments on error handling (7)
Jul 15 2012 Closed source D libraries (6)
Jul 14 2012 Hiatus, Improving Participation in D Development (7)
Jul 14 2012 D front-end in D for D (25)
Jul 13 2012 Some guidance on writing a Deimos C library interface (10)
Jul 13 2012 FYI: Ceylon (11)
Jul 13 2012 Array index slicing (2)
Jul 13 2012 No D->C++, right? (5)
Jul 13 2012 nested class inheritance (60)
Jul 13 2012 Undefined and other traps (1)
Jul 12 2012 Move semantics for D (23)
Jul 12 2012 D versionning (149)
Jul 12 2012 Counterproposal for extending static members and constructors (16)
Jul 11 2012 All right, all right! Interim decision regarding qualified Object (132)
Jul 11 2012 Supported Architectures? (5)
Jul 11 2012 just an idea (!! operator) (39)
Jul 11 2012 opApply not called for foeach(container) (19)
Jul 11 2012 Build DMD + druntime + phobos on Windows using MVCC (5)
Jul 11 2012 Structs, the most buggiest language feature? (6)
Jul 10 2012 How can I properly import functions from gcx in object.di? (4)
Jul 10 2012 Range's opSlice(/**/) function (3)
Jul 09 2012 Why is std.algorithm so complicated to use? (137)
Jul 09 2012 proper code introspection (1)
Jul 09 2012 Exquisite code samples (10)
Jul 09 2012 should a thread print exceptions? (1)
Jul 08 2012 Congratulations to the D Team! (174)
Jul 08 2012 simplifying the changelog (5)
Jul 08 2012 Rust updates (66)
Jul 08 2012 LLVM Kaleidoscope tutorial to D (6)
Jul 08 2012 Direct access to struct construction, copying and destruction (12)
Jul 08 2012 lldb support for D programming language (3)
Jul 08 2012 wanna learn more about programming (2)
Jul 08 2012 X header like functionality (3)
Jul 07 2012 A lexical change (a breaking change, but trivial to fix) (17)
Jul 07 2012 Intermediate arrays (4)
Jul 07 2012 Crashing with style (1)
Jul 06 2012 Link to deimos from the homepage? (2)
Jul 06 2012 Does a mongodb binding exists? (9)
Jul 05 2012 Editable and runnable code sample on dlang.org by Damian Ziemba (nazriel) (41)
Jul 05 2012 Let's stop parser Hell (251)
Jul 04 2012 A delegate problem, create delegation in loop (7)
Jul 04 2012 dfmt - D source code formatter (19)
Jul 04 2012 std.hash: More questions (4)
Jul 04 2012 More Front End Vector Support (5)
Jul 04 2012 Pure functions and pointers (yes, again) (4)
Jul 03 2012 Proposal: takeFront and takeBack (34)
Jul 03 2012 D SFML2 derelict (3)
Jul 03 2012 D2 Library Porters (25)
Jul 02 2012 foreach and retro (10)
Jul 02 2012 foreach ref very broken: fails to call front(val) (23)
Jul 02 2012 Forum for language feature requests? (4)
Jul 02 2012 Remove std.algorithm.completeSort. (7)
Jul 02 2012 dmd 2.060 ignoring ref for Array arguments (1)
Jul 02 2012 Excesive use of opIndex* in std.container.Array (and Ranges in (2)
Jul 01 2012 d language Bye (5)
Jul 01 2012 Any progress in std.database? (4)
Jun 30 2012 std.string.format results in run-time exception (1)
Jun 30 2012 Creating a Sub-view of a non - RA (hasSlicing) range. (16)
Jun 30 2012 std.algorithm.splitter defect: isTerminator version does not return (3)
Jun 30 2012 StructType.init and StructType() cause a allocation (4)
Jun 29 2012 '<' and '>' are "matching delimiters"? (3)
Jun 29 2012 Inferred return types (7)
Jun 29 2012 Douglas Crockford on JavaScript and bad styles (2)
Jun 28 2012 LLVM IR influence on compiler debugging (58)
Jun 27 2012 D in the cloud with cassandra ? (8)
Jun 27 2012 Why type specialization is defined differently than is expression (15)
Jun 27 2012 standard ranges (44)
Jun 27 2012 package management (5)
Jun 27 2012 D pull request test badge (4)
Jun 27 2012 Productions users (15)
Jun 26 2012 std.uuid vote results - accepted! (6)
Jun 26 2012 What does D define for circular dependencies (6)
Jun 26 2012 'Auto can only be used for template function arguments' what? (20)
Jun 26 2012 pure and custom new / delete (13)
Jun 26 2012 const ref in opAssign (9)
Jun 25 2012 Is this statement in still true? (12)
Jun 25 2012 Narrow Windows Borders with SDL and D (7)
Jun 25 2012 range.size() should be long, right? (9)
Jun 25 2012 Get rid of isInfinite()? (16)
Jun 25 2012 Partial classes (17)
Jun 25 2012 dlang.org live examples (21)
Jun 25 2012 An idea to avoid a narrow class of bugs (9)
Jun 25 2012 return table from local resource (5)
Jun 25 2012 GWAN webserver allowing dynamic pages in D (28)
Jun 24 2012 disable this propgates through reference (2)
Jun 24 2012 New hash API: Update (27)
Jun 24 2012 New std.process and 2.060 (2)
Jun 24 2012 dlang.org pull requests (2)
Jun 23 2012 How do I submit documentation... (12)
Jun 23 2012 Phobos: Arbitrary delimiter variants of (std.string) stripLeft and (4)
Jun 23 2012 D runtime in os x dylib (13)
Jun 23 2012 std.string.format (8)
Jun 23 2012 Allow folding code with vim (2)
Jun 23 2012 Question about Template (5)
Jun 23 2012 Made a Rage-Comic about D (14)
Jun 22 2012 parameter type tuple or alias for std.traits templates ? (7)
Jun 22 2012 D at C++Now 2012 (5)
Jun 22 2012 std.typelist (11)
Jun 22 2012 std.hash design (10)
Jun 21 2012 Linking with DMD (7)
Jun 21 2012 Raw binary(to work without OS) in D (78)
Jun 21 2012 LinkedList and Deque API in DCollections (9)
Jun 21 2012 csvReader read file byLine()? (13)
Jun 21 2012 code academy (1)
Jun 21 2012 Handling of compiler patches (6)
Jun 20 2012 Nullable types (6)
Jun 20 2012 Add := digraph to D (29)
Jun 19 2012 DMD and Solaris (10)
Jun 19 2012 GDC review process. (104)
Jun 19 2012 FWIW: results of cppcheck on dmd sources (11)
Jun 19 2012 Vote for std.uuid (21)
Jun 19 2012 for() with 4 arguments to allow postcondition (7)
Jun 18 2012 Clang-based service architecture (2)
Jun 18 2012 A currying function (8)
Jun 18 2012 Just because it's not dmd, don't mean you have to shy away from (1)
Jun 18 2012 Shared objects? (6)
Jun 18 2012 Primary Ranges of Containers (1)
Jun 17 2012 How to break const (125)
Jun 17 2012 getcwd behaves inconsistent? (8)
Jun 17 2012 D in your browser? possible? (8)
Jun 17 2012 UFCS call and regular call behaves differently with alias parameter (3)
Jun 16 2012 Making uniform function call syntax more complete a feature (12)
Jun 16 2012 DMD + msvc (25)
Jun 16 2012 Member pointers in D! (1)
Jun 16 2012 How about a "static foreach"? (5)
Jun 16 2012 Pointers to functions (!= "function pointers") should be disallowed (3)
Jun 16 2012 Issue 7965 - Invalid outer function scope pointer in some cases (5)
Jun 16 2012 Proposal to add 'Elements of Programming' Concepts to std.traits (32)
Jun 15 2012 Language feature suggestions: This and Super (3)
Jun 15 2012 Freelists and clear/emplace (9)
Jun 15 2012 Versioned std.exception.bailOut()? (11)
Jun 15 2012 equality operators on types (22)
Jun 15 2012 Embeding DSLs into standard programming languages (link) (2)
Jun 13 2012 "static" UFCS (24)
Jun 13 2012 RefRange (4)
Jun 12 2012 Template Interface (5)
Jun 12 2012 RandomSample with specified random number generator (1)
Jun 12 2012 AST files instead of DI interface files for faster compilation and (54)
Jun 12 2012 Struct type value as template parameter (1)
Jun 11 2012 Some programming mistakes (2)
Jun 10 2012 Porting VisualD to Windows 8 and Visual Studio 11 (25)
Jun 09 2012 Mersenne Twister Seeding and UUIDs (16)
Jun 09 2012 static array literal syntax request: auto x=[1,2,3]S; (36)
Jun 09 2012 Review: std.uuid (43)
Jun 09 2012 Segmented Ranges? (7)
Jun 09 2012 Code layout for range-intensive D code (14)
Jun 08 2012 Review Queue (10)
Jun 08 2012 "Verification Corner" videos, contract programming (7)
Jun 07 2012 align number (10)
Jun 07 2012 valid uses of shared (41)
Jun 07 2012 Rational numbers in D (21)
Jun 07 2012 C++Now! 2012 slides (24)
Jun 07 2012 toImpl deprecated, use opCast instead? (1)
Jun 06 2012 Better casts? (2)
Jun 06 2012 Are programs/OSes written in D more secure than programs written in (17)
Jun 06 2012 should pure functions accept/deal with shared data? (27)
Jun 06 2012 x86_64 ABI description (1)
Jun 06 2012 mutable reference > pointer (5)
Jun 05 2012 Test for array literal arguments? (4)
Jun 05 2012 Casts, overflows and demonstrations (1)
Jun 05 2012 foreach over pointer to range (8)
Jun 05 2012 Implicit type conversions with data loss (10)
Jun 05 2012 Windows 2000 support (30)
Jun 05 2012 meta namespace aka Issue 3702 (2)
Jun 04 2012 Add compile time mutable variable type (5)
Jun 04 2012 Increment / Decrement Operator Behavior (15)
Jun 04 2012 [ offtopic ] About the "C++ Compilation Speed" article on DrDobbs (3)
Jun 04 2012 Same _exact_ code in C and D give different results =?UTF-8?B?4oCU?= (11)
Jun 04 2012 More synchronized ideas (10)
Jun 04 2012 Making generalized Trie type in D (36)
Jun 03 2012 Phobos pull 613 (2)
Jun 03 2012 RE: synchronized (this[.classinfo]) in druntime and phobos (2)
Jun 03 2012 non-instance accessibility of immutable instance variables with initializers (4)
Jun 02 2012 opCaret to complement opDollar when specifying slices (9)
Jun 02 2012 DMD does not allow stringof on function alias of a function that (2)
Jun 02 2012 Donations (20)
Jun 02 2012 SetTimer function not found? (10)
Jun 01 2012 Efficient framebuffer? (3)
Jun 01 2012 AST Macros? (1)
May 31 2012 Website (6)
May 31 2012 wrapping C++ templates to D templates (via SWIG) (1)
May 31 2012 [Proposal] Additional operator overloadings for multidimentional (13)
May 31 2012 wrapping C++ templates to D templates (via SWIG) (1)
May 31 2012 Calling an alias for a Class method in another scope (1)
May 31 2012 Easiest way to get GUI (5)
May 31 2012 Is the address-of operator (&) really needed? (35)
May 30 2012 Where is naming convention? (11)
May 30 2012 Need is expression to match Variadic Template Class Type (2)
May 30 2012 Compile-time evaluation lost in alias this (11)
May 29 2012 GC don't work well (3)
May 29 2012 OAuth libraries (2)
May 29 2012 Ddoc and manifest constants (5)
May 29 2012 [draft, proposal] Virtual template functions (4)
May 29 2012 CTFE slower than expected (15)
May 28 2012 synchronized (this[.classinfo]) in druntime and phobos (260)
May 28 2012 DMD on OSX Lion (3)
May 27 2012 [Inline assembler] Lack of documentation (1)
May 27 2012 Wrong enum comparisons (17)
May 27 2012 Two Scala annotations (17)
May 27 2012 Which template is recommended. (2)
May 26 2012 Compiling Data into a D Executable (8)
May 26 2012 Add CTFE execute function (12)
May 26 2012 ColorD (7)
May 26 2012 dbuilder, pakage manager, dget (10)
May 25 2012 clear() and UFCS (51)
May 24 2012 Pointer semantics in CTFE (30)
May 24 2012 Live code analysis in DCT (9)
May 24 2012 Destructor nonsense on dlang.org (64)
May 24 2012 C linkage is fun (4)
May 24 2012 Exception/Error division in D (127)
May 23 2012 dget - getting code from github (42)
May 23 2012 tuple of ranges - findSplit (2)
May 23 2012 Pegged and DMD Compilation Memory (8)
May 23 2012 Sparse matrix solver libraries (7)
May 23 2012 Does D have "structural sharing" of immutable collections? (30)
May 22 2012 forcing weak purity (41)
May 22 2012 Purity of some GC functions (1)
May 22 2012 D is a dragon, or why D matters for Bioinformatics (3)
May 22 2012 Not auto-vectorization (4)
May 22 2012 Who said that Node.js scales ? (12)
May 22 2012 Let's schedule WinAPI ASCII functions for deprecation! (26)
May 22 2012 why D matters for Bioinformatics (12)
May 22 2012 DCT use cases - draft (30)
May 22 2012 Is the D community lacking development tools? (36)
May 21 2012 GitHub for Windows (101)
May 21 2012 template alias args (1)
May 20 2012 Yet another const problem... (10)
May 20 2012 Interested in being abreast of the GSoC 2012 projects? Here's how (25)
May 20 2012 newsgroup archive stale (3)
May 20 2012 Small collections optimizations (1)
May 19 2012 dmd link mystery on linux (4)
May 19 2012 Lazy evaluation of function arguments in D (21)
May 19 2012 Possible bug in the D compiler w.r.t x86_64 ABI calling convention (8)
May 18 2012 Setting up a new FreeBSD32 autotester? (1)
May 18 2012 Setting up a new FreeBSD32 autotester? (1)
May 18 2012 Method pointers are *function* pointers?? Or delegates?? (23)
May 18 2012 memset_s (1)
May 18 2012 [OT] Windows users: Are you happy with git? (51)
May 17 2012 D versus C#/.NET module systems (1)
May 17 2012 Posix vs. Windows (48)
May 17 2012 alias 'this' with opCall? (3)
May 17 2012 AliasTuples, rather than Records, to return multiple values (8)
May 17 2012 stream interfaces - with ranges (39)
May 17 2012 Return type inference (8)
May 17 2012 Would it be possible (and useful) to introduce declarations like `auto (5)
May 17 2012 Do not write object file? (4)
May 17 2012 News server load becoming more and more an issue (9)
May 17 2012 isInputRange instead of isForwardRange for std.algorithm.fill (3)
May 16 2012 Can't run 'masm386' (16)
May 16 2012 Standard struct constructors for the heap? (6)
May 16 2012 Should range foreach be iterating over an implicit copy? (18)
May 16 2012 2D (or higher) equivalent of ranges? (1)
May 16 2012 DFL? (10)
May 16 2012 Memory reordering explained by example (4)
May 15 2012 enums extension (7)
May 15 2012 scope(exit) without exception handling? (26)
May 15 2012 input completion system (4)
May 15 2012 MBCS character code support (12)
May 15 2012 How to mov EAX, &func? (13)
May 15 2012 very strange segmentation fault interfacing a GSL-function (1)
May 15 2012 SSE and AVX with D (6)
May 15 2012 Windows application manifests (12)
May 15 2012 Array!bool and size_t (3)
May 14 2012 UFCS on forward reference (10)
May 14 2012 Request for Review: DI Generation Improvements (1)
May 14 2012 Request for Review: DI Generation Improvements (28)
May 14 2012 New Traits (17)
May 14 2012 Should reduce take range as first argument? (10)
May 14 2012 Consuming shared streams - scratchspace (1)
May 14 2012 logical const idea - scratchspace (9)
May 14 2012 DUDA (11)
May 14 2012 Is dsource .org completely deserted? (29)
May 14 2012 Web servers in D (6)
May 14 2012 arrays: if(null == [ ]) (85)
May 13 2012 Killing equals_t (8)
May 13 2012 deprecating std.stream, std.cstream, std.socketstream (65)
May 13 2012 bitfields VS pure nothrow (4)
May 13 2012 using d dll/lib with msvc program (10)
May 13 2012 Getting the const-correctness of Object sorted once and for all (96)
May 13 2012 noreturn? (13)
May 13 2012 The future of the WindowsAPI bindings project (4)
May 13 2012 pid thread (2)
May 12 2012 Cool features of the D language (3)
May 12 2012 import std.socket (3)
May 12 2012 XOMB operating system (20)
May 12 2012 Global invariants? (2)
May 12 2012 UnixSocket (3)
May 12 2012 WinAPI grossly lacking in core.c.windows.windows (8)
May 12 2012 Memoize and protected functions (3)
May 11 2012 Compiler crash I can't pin down (3)
May 11 2012 How to contribute on github? (8)
May 11 2012 [OT] GitHub down? (11)
May 11 2012 Why isn't purity & co. inferred for all functions? (11)
May 11 2012 D dropped in favour of C# for PSP emulator (188)
May 11 2012 Should opIndex completely override alias this? (13)
May 11 2012 path planning implementations? (13)
May 11 2012 SCons, Linking and D (5)
May 10 2012 Property assignment problem (11)
May 10 2012 Bug report severity (8)
May 10 2012 D tools strategy (1)
May 10 2012 SCons D support (5)
May 09 2012 Temporary static arrays on stack get corrupted with dmd -m64 (1)
May 09 2012 Optional parameters referring to previous parameters? (20)
May 09 2012 CTFE and DI: The Crossroads of D (128)
May 09 2012 Please help with GC exception! (7)
May 09 2012 Constraints (29)
May 09 2012 GDMD (11)
May 09 2012 "is" operator for structures? (18)
May 09 2012 inconsistent compile-time reflection (2)
May 08 2012 Lack of open source shown as negative part of D on Dr. Dobbs (101)
May 08 2012 Future of D style variadic fuctions (12)
May 08 2012 dmd from git segfaulting when used with wrong version of druntime (9)
May 08 2012 Behaviour of alias this changed (5)
May 08 2012 Messing storage classes and type qualifier is a pain (1)
May 08 2012 LibEvent, signals or communication between threads (8)
May 07 2012 ZeroBUGS debugger for D (9)
May 07 2012 -wi on default? (14)
May 07 2012 UFCS and operator overloading (6)
May 07 2012 Why not all statement are expressions ? (18)
May 07 2012 run-time stack-based allocation (24)
May 06 2012 Properties don't behave like variables? (30)
May 06 2012 "R" suffix for reals (18)
May 06 2012 Defining a custom *constructor* (not initializer!) (44)
May 06 2012 DDoc ignores mixins (2)
May 06 2012 Escaping control in formatting (again) (4)
May 05 2012 [Feature Request] Adding to D lang "set" built-in (14)
May 05 2012 What should array() return for const/immutable ElementTypes? (6)
May 05 2012 Static versus dynamic binding of in contracts again - trying to set (6)
May 04 2012 Why typedef's shouldn't have been removed :( (61)
May 04 2012 Integer overflow and underflow semantics (24)
May 04 2012 opAssign and const? (2)
May 04 2012 Genode (1)
May 04 2012 Different random output for Phobos and Boost (1)
May 04 2012 wxWidget s/ wxD reloaded, stand still, stalled, dead ? (1)
May 04 2012 True disposable objects (add "Finalized!" assertion) (7)
May 04 2012 mixin templates and classes (1)
May 04 2012 allMembers (8)
May 04 2012 nginx reverse proxy for vibe tutorial (9)
May 04 2012 Return by 'ref' problems... (30)
May 03 2012 Destroying structs without a typeinfo object (7)
May 03 2012 Array type inference (2)
May 03 2012 GSOC Linker project (81)
May 03 2012 virtual method pointer (29)
May 03 2012 scope ref const(T) --> error?! (8)
May 03 2012 Feature !request into std.algorithm (1)
May 03 2012 Class methods in D? (24)
May 03 2012 Pure memoization, and more (3)
May 03 2012 Growing pains (36)
May 03 2012 From Ada 2012 (11)
May 03 2012 Windows batch file to compile D code (7)
May 03 2012 How to modify an element in a range/collection using its member (4)
May 02 2012 Const/Shared/Immutable anomalies in D that should be fixed (11)
May 02 2012 Oddness with C binding (3)
May 01 2012 D3 is potentially damaging (14)
May 01 2012 LDC and the Debian Repository (7)
May 01 2012 luajit-ffi (30)
May 01 2012 An observation (11)
Apr 29 2012 [Q]STM with Strict ordering for Grid applications (1)
Apr 29 2012 lazy is broken, but we have delegates (3)
Apr 28 2012 Shared with no type in Druntime. (10)
Apr 28 2012 Wasn't someone trying to work on a C backend for DMD? (10)
Apr 28 2012 System signals (11)
Apr 28 2012 Does D have too many features? (547)
Apr 28 2012 has sqlserver2000 for d2 lib package? (1)
Apr 28 2012 Designing a consistent language is *very* hard (29)
Apr 27 2012 generic indexOf() for arrays ? (5)
Apr 27 2012 (Non)Abstract Funcs, Linker Errors, and Wild Goose Chases (4)
Apr 27 2012 John-Carmack quotes the D programming language (9)
Apr 26 2012 Static method conflicts with non-static method? (15)
Apr 26 2012 export extern (C) void Fun Error (6)
Apr 26 2012 MPI bindings revisited (2)
Apr 26 2012 Cross module version specs (14)
Apr 26 2012 Cairo Deimos bindings (21)
Apr 25 2012 What to do about default function arguments (45)
Apr 25 2012 Convert a delegate to a function (i.e. make a thunk) (11)
Apr 25 2012 Compiling DMD for the iPhone simulator (7)
Apr 25 2012 This shouldn't happen (15)
Apr 25 2012 dmd doesn't work, rdmd --build-only does (3)
Apr 25 2012 Internal working of struct dtors (1)
Apr 25 2012 What is this error?! (3)
Apr 25 2012 Sharing memory with C, ref counting, best practises? (2)
Apr 24 2012 Random distributions in Phobos (5)
Apr 24 2012 ICE on latest git dmd when introspecting a class that contains a (1)
Apr 24 2012 ^^ limitation (9)
Apr 24 2012 Is it possible to build DMD using Windows SDK? (9)
Apr 24 2012 [OT] Programming Bacterial Cells (3)
Apr 24 2012 How can D become adopted at my company? (52)
Apr 24 2012 Can we kill the D calling convention already? (26)
Apr 23 2012 About Blender bugs (1)
Apr 23 2012 Notice/Warning on narrowStrings .length (30)
Apr 23 2012 Escaping control in formatting (9)
Apr 22 2012 GC + malloc/free = deadlock (9)
Apr 22 2012 Alias Expressions (6)
Apr 22 2012 D to C converter? (2)
Apr 22 2012 Voldemort command structures (3)
Apr 21 2012 version 8.52 & console app code size (2)
Apr 21 2012 GTK and D (8)
Apr 21 2012 Recursive aliases? (6)
Apr 21 2012 Deterministic life-time storage type (9)
Apr 21 2012 comma operator causes hard to spot bugs (24)
Apr 20 2012 Remove docs on 'new' and 'delete'? (3)
Apr 20 2012 Methods require no parantheses (4)
Apr 20 2012 immutable, static, __gshared, TLS, and compile time allocation (6)
Apr 20 2012 Is this a bug? (2)
Apr 20 2012 Predefined 'release' version? (6)
Apr 20 2012 Sharing your openGL Shader struct (3)
Apr 20 2012 Partial classes & forward declarations (10)
Apr 20 2012 Closed development with Trello? (18)
Apr 19 2012 Random D geekout (31)
Apr 19 2012 Docs: Section on local variables (16)
Apr 19 2012 [off-topic] Sony releases PS Vita SDK (59)
Apr 19 2012 UFCS Documentation (1)
Apr 19 2012 Let's give a honor to dead giants! (31)
Apr 19 2012 UFCS in the presence of alias this (8)
Apr 18 2012 repro cases for optlink crashes (2)
Apr 18 2012 Disallow (dis)equality with FP.nan/FP.init literals (6)
Apr 18 2012 Beauty of D (1)
Apr 18 2012 Objects on message queues of spawned processes (6)
Apr 18 2012 Windows: Throwing Exceptions from Fibers in D2.059: Access Violation (40)
Apr 18 2012 posix.mak broken in latest git phobos (1)
Apr 18 2012 static vs non-static method overloading (3)
Apr 18 2012 Is the use of .di depreceated ? (6)
Apr 17 2012 [your code here] (3)
Apr 17 2012 GC API: What can change for precise scanning? (14)
Apr 17 2012 template+alias as an object's "namespace" (12)
Apr 17 2012 AA key conversion woes (10)
Apr 17 2012 Just a thought... (3)
Apr 17 2012 Polymorphic catcalls (9)
Apr 16 2012 Shared libraries under linux (6)
Apr 16 2012 D scored well in the Google CodeJam Qualification Round (13)
Apr 16 2012 Cheaper compile-time tests (3)
Apr 16 2012 Problem with dmd2.059.zip (2)
Apr 16 2012 Language Subsets (5)
Apr 15 2012 compiler support added for precise GC (86)
Apr 15 2012 Orphan ranges (12)
Apr 15 2012 Usage of Exceptions in std.xml (8)
Apr 15 2012 --inline (4)
Apr 15 2012 HTTP4D embedded http provider (3)
Apr 14 2012 Why is complex being deprecated again? (33)
Apr 14 2012 Random sampling in Phobos (9)
Apr 13 2012 Provide immutable attribute for first-class citizens and namespaces? (5)
Apr 13 2012 Definitive list of storage classes (5)
Apr 13 2012 D Compiler as a Library (75)
Apr 12 2012 Measuring the page generation of the forum (15)
Apr 12 2012 Tuple unpacking at the called function (1)
Apr 12 2012 Where is the runtime memory overhead from? (3)
Apr 11 2012 An idea to improve eponymous templates (20)
Apr 11 2012 foreach and filter (13)
Apr 11 2012 std.file (3)
Apr 11 2012 std.algorithms filter and string[] (5)
Apr 11 2012 What about x64 windows? (13)
Apr 11 2012 D fuse binding (1)
Apr 10 2012 dmd's linking order (18)
Apr 10 2012 core.stdc in docs? (4)
Apr 10 2012 Is anyone hacking on druntime in a widespread fashion at the moment? (16)
Apr 10 2012 Producing nicer template errors in D libraries (9)
Apr 10 2012 Export ? (19)
Apr 10 2012 MD5, SHA1, SHA256, CRC32 (9)
Apr 10 2012 Starting with D(2) (6)
Apr 10 2012 More mentors needed (8)
Apr 10 2012 Cod generation for different targets ( x386, x486 etc ) (5)
Apr 10 2012 Object arrays in D (19)
Apr 09 2012 Dictonaries benchmark (4)
Apr 09 2012 The new std.process? (15)
Apr 09 2012 The Downfall of Imperative Programming (38)
Apr 09 2012 Can't assign to static array in ctor? (11)
Apr 09 2012 Windows 8 Metro support (28)
Apr 08 2012 deimos libX11 not compiling (1)
Apr 08 2012 Foreach Closures? (34)
Apr 08 2012 x32-abi + D = fat pointers? (2)
Apr 08 2012 Encodings (2)
Apr 08 2012 Is the code for std.database online ? (1)
Apr 08 2012 malloc in core.memory.GC (12)
Apr 08 2012 Hitchikers Guide to Porting Phobos / D Runtime to other architectures (78)
Apr 08 2012 Documentation improvements (2)
Apr 08 2012 A modest proposal: eliminate template code bloat (31)
Apr 08 2012 readonly storage class (11)
Apr 08 2012 Shared library in D on Linux (28)
Apr 07 2012 Small Buffer Optimization for string and friends (54)
Apr 07 2012 std.benchmark ready for review. Manager sought after (58)
Apr 07 2012 Precise GC (35)
Apr 07 2012 a pretty exciting result for parallel D lang rmd following defrag by (12)
Apr 07 2012 More ddoc complaints (5)
Apr 07 2012 TickDuration.to's second template parameter (10)
Apr 07 2012 openssl example for D (3)
Apr 07 2012 D and Heterogeneous Computing (9)
Apr 06 2012 Goldie Parser Generator. Haxe language definition. (2)
Apr 06 2012 Discussion on Go and D (56)
Apr 06 2012 uploading with curl (9)
Apr 06 2012 custom attribute proposal (yeah, another one) (76)
Apr 06 2012 how to "include" the module file like C ? (3)
Apr 05 2012 Standard Library (Phobos) Garbage Collection (2)
Apr 05 2012 IDE Support for D (13)
Apr 05 2012 D projects list (21)
Apr 05 2012 benchmark dict list and string, D vs python vs lua (3)
Apr 05 2012 rpm spec for rhel and fedora (4)
Apr 05 2012 Mascot for D (21)
Apr 05 2012 Re: Spec (5)
Apr 05 2012 Slices and GC (5)
Apr 05 2012 Custom attributes (again) (125)
Apr 05 2012 Unicode, graphemes and D (5)
Apr 05 2012 DMD compiler switch to set default extern() linkage? (11)
Apr 03 2012 Cross-references in generated ddoc (15)
Apr 03 2012 [OT] Just curious: What's this algorithm's name? (6)
Apr 03 2012 DMD asserts using delegate and type inference (6)
Apr 03 2012 How to set up Derelict? (3)
Apr 02 2012 Nested functions should be exempt from sequential visibility rules (27)
Apr 02 2012 Annoying module name / typename conflict (3)
Apr 02 2012 Mono-D GSoC proposal, hopefully the last thread about it (6)
Apr 02 2012 Why does D change operator precedence according to C/C++ ? (8)
Apr 02 2012 Dirrlicht & C. (2)
Apr 01 2012 Keeping imports clean (5)
Apr 01 2012 Compiler development (8)
Apr 01 2012 traits getProtection (27)
Apr 01 2012 Deimos - ODE bindings (11)
Mar 31 2012 TypeInfo of arrays of basic types. (2)
Mar 31 2012 problem compiling with optimizations enabled (4)
Mar 31 2012 Transfering CTFE classes to runtime (1)
Mar 31 2012 D for a Qt developer (13)
Mar 31 2012 Creating a shared library in D : undefined symbol: _deh_beg (4)
Mar 31 2012 Return a class instance as a pointer (8)
Mar 30 2012 rdmd (2)
Mar 30 2012 Nested function bug? (5)
Mar 30 2012 DIP16: Transparently substitute module with package (103)
Mar 30 2012 structs, tids, and concurrency. (2)
Mar 29 2012 Alternative /hipster/ syntaxes for D (8)
Mar 28 2012 git dmd broken for posix? (2)
Mar 27 2012 Documentation Layout (20)
Mar 27 2012 Annoyances with traits (10)
Mar 27 2012 std.containers - WAT (4)
Mar 27 2012 GSoC 2012 Proposal: Continued Work on a D Linear Algebra library (1)
Mar 27 2012 AA getLValue (2)
Mar 27 2012 immutable method not callable using argument types () - doesn't make (8)
Mar 27 2012 immutable method not callable using argument types () - doesn't make (3)
Mar 26 2012 Problem passing objects between threads (1)
Mar 26 2012 regex direct support for sse4 intrinsics (17)
Mar 26 2012 Issue 3789, stucts equality (12)
Mar 26 2012 Issue with module destructor order (6)
Mar 25 2012 Poll of the week - How long have you been in the D world? (17)
Mar 25 2012 Something wrong with dmd's -c command? (1)
Mar 25 2012 Getting around the non-virtuality of templates (9)
Mar 25 2012 BitC, Rust, dog food and more (18)
Mar 25 2012 std.ffi? (2)
Mar 25 2012 reading formatted strings: readf("%s", &stringvar) (18)
Mar 25 2012 Use tango.core.Atomic.atomicLoad and atomicStore from Tango (6)
Mar 25 2012 How to use D for cross platform development? (33)
Mar 24 2012 Regex performance (15)
Mar 24 2012 What about Uri class? (2)
Mar 24 2012 BufferedInputRange revisited (1)
Mar 24 2012 Array ops give sharing violation under Windows 7 64 bit? (33)
Mar 24 2012 Instantiate the template class method (1)
Mar 24 2012 Using D for Soft Synth development (4)
Mar 24 2012 GSoC: interested in participating (1)
Mar 23 2012 When do you use templates instead of CTFE? (6)
Mar 23 2012 Re: New hash (1)
Mar 23 2012 Implicit conversions for AA keys (23)
Mar 23 2012 parallel optimizations based on number of memory controllers vs cpus (3)
Mar 22 2012 Why CTFE I/O would be awesome: No-Build-Tool Custom Build Steps (3)
Mar 22 2012 Windows Socket Timeout (4)
Mar 22 2012 Workaround for Issue 6906 (2)
Mar 22 2012 D + Arduino (2)
Mar 22 2012 Proposal: __traits(code, ...) and/or .codeof (18)
Mar 21 2012 Wrong lowering for a[b][c]++ (10)
Mar 21 2012 Re: MessagePack (1)
Mar 21 2012 I do a really bad job as marketer (3)
Mar 20 2012 What about putting array.empty in object.d? (30)
Mar 20 2012 public MessageBox (22)
Mar 20 2012 Three Unlikely Successful Features of D (101)
Mar 20 2012 "Forward reference" eror message improvement? (3)
Mar 20 2012 Official deprecation dates, -property (3)
Mar 20 2012 String mixin syntax sugar (11)
Mar 19 2012 getHash inconsistency (10)
Mar 19 2012 Premake support for D (3)
Mar 19 2012 Mono-D GSoC - Mentor needed (22)
Mar 19 2012 DMD Deadlocks (5)
Mar 19 2012 Keyword arguments / Named parameters library implementation (9)
Mar 18 2012 CTFE bug causes null check to pass on null pointers (Issue 7602) (14)
Mar 18 2012 some regex vs std.ascii vs handcode times (14)
Mar 18 2012 opEquals/opCmp returning other types (18)
Mar 18 2012 Implicit integer casting (4)
Mar 18 2012 page size in druntime is a mess (5)
Mar 18 2012 null allowing safe code to do unsafe stuff. (11)
Mar 17 2012 Array operation a1 + a2 not implemented! (2)
Mar 17 2012 Issue 7670 (7)
Mar 17 2012 virtual-by-default rant (77)
Mar 17 2012 force inline/not-inline (40)
Mar 17 2012 Understanding Templates: why can't anybody do it? (57)
Mar 17 2012 confused about pure functions (4)
Mar 17 2012 BlockingTextWriter? (2)
Mar 16 2012 Immutable static arrays (4)
Mar 16 2012 Something wrong with win32 dmd 2.059head? (4)
Mar 16 2012 Scala macros (3)
Mar 16 2012 Thrift bindings for D review? (1)
Mar 16 2012 OpenBSD port of dmd? (46)
Mar 16 2012 Proposal: user defined attributes (168)
Mar 16 2012 Ideas for Phobos. (7)
Mar 15 2012 "Improve this page" (3)
Mar 15 2012 Interesting Memory Optimization (25)
Mar 15 2012 A small const problem (4)
Mar 15 2012 Changing the name of the language? (25)
Mar 15 2012 Unified toHash() for all native types (4)
Mar 15 2012 Inconsistent hashing schemes for various typeinfos (1)
Mar 15 2012 std.simd (16)
Mar 15 2012 Current state of Allocator design (4)
Mar 15 2012 Issue 5689 (6)
Mar 15 2012 Having trouble setting up libcurl on Windows 7 (6)
Mar 15 2012 Dynamic language (59)
Mar 14 2012 Idea for D Conference talk (1)
Mar 14 2012 Container templates and constancy of elements (5)
Mar 14 2012 Implicit string lit conversion to wstring/dstring (20)
Mar 13 2012 AA reference semantics (3)
Mar 13 2012 Dmitry on Regular expressions (1)
Mar 13 2012 A thread-safe weak reference implementation (5)
Mar 13 2012 Replacing AA's in druntime (58)
Mar 13 2012 Wanted: 128 bit integers (16)
Mar 13 2012 Fortran DLL and D (11)
Mar 13 2012 [draft] New std.regex walkthrough (13)
Mar 13 2012 Negative integer modulo/division (4)
Mar 13 2012 [video] A better way to program (8)
Mar 13 2012 Turning a SIGSEGV into a regular function call under Linux, allowing (39)
Mar 12 2012 Regarding implementing a stable sort for Phobos (23)
Mar 12 2012 "" is down (3)
Mar 12 2012 Calling D from C (13)
Mar 11 2012 How about colors and terminal graphics in std.format? (44)
Mar 11 2012 Compressed class references? (3)
Mar 11 2012 toHash => pure, nothrow, const, safe (86)
Mar 11 2012 D support in Thrift needs your reviews! (5)
Mar 11 2012 Romans, rubies and the D (8)
Mar 11 2012 EBNF grammar for D? (12)
Mar 11 2012 override and trusted (3)
Mar 11 2012 Idea: A library non-OOP "dispatch!()()" (3)
Mar 10 2012 Optimize away immediately-called delegate literals? (11)
Mar 10 2012 Has Tomasz's (h3r3tic's) OpenGL font rendering code been ported to (15)
Mar 10 2012 DDoc and logically structured HTML (17)
Mar 10 2012 Feq questions about the D language (30)
Mar 09 2012 forum.dlang.org thread lovers suggested change (10)
Mar 09 2012 covariance of 'out' parameters is crucial for polymorphism and (2)
Mar 09 2012 Breaking backwards compatiblity (200)
Mar 09 2012 Can getHash be made pure? (10)
Mar 09 2012 Annotations or custom attributes (26)
Mar 08 2012 Initializing a static array (2)
Mar 08 2012 Creating dynamic arrays of known size (2)
Mar 08 2012 Sort for forward ranges (1)
Mar 08 2012 Signal and Slots (1)
Mar 08 2012 Multiple return values... (2)
Mar 08 2012 dlang.org Articles without Authors (1)
Mar 08 2012 Thread on GO at hacker news (3)
Mar 08 2012 Random access range (3)
Mar 08 2012 Phoronix Compiler Testing (1)
Mar 07 2012 AA implementation question (5)
Mar 06 2012 Extend vector ops to boolean operators? (13)
Mar 06 2012 Arbitrary abbreviations in phobos considered ridiculous (365)
Mar 05 2012 NNTP rules, news.digitalmars.com sucks (10)
Mar 05 2012 Missing information on how to compile DMD (7)
Mar 05 2012 [Feature Request] Forwardable as Ruby does (5)
Mar 04 2012 The state of contract programming in D (6)
Mar 04 2012 [RFC] replaceInto (7)
Mar 04 2012 Remainder wat (16)
Mar 04 2012 Automatic minimally sized SELECT clauses in SQL using D templates. (3)
Mar 04 2012 std.zlib uncompress issue (3)
Mar 04 2012 D Changelog is messed up. (9)
Mar 04 2012 Any plans to fix this? (3)
Mar 04 2012 A better way to manage discussions? (8)
Mar 03 2012 Where did the specification ebook go? (4)
Mar 03 2012 Is it bad for object.di to depend on core.exception? (13)
Mar 03 2012 Fixing the SortedRange (6)
Mar 02 2012 AssociativeArray.opIndex (8)
Mar 02 2012 Whats up with the domains? (3)
Mar 02 2012 opBinary!"in" and opIndex for AA's (issue 5030) (1)
Mar 02 2012 Extending UFCS to templates (3)
Mar 02 2012 Mac Installer - Can't find druntime/import and phobos/src after (9)
Mar 02 2012 dmd2059 ?! (3)
Mar 02 2012 Terribly slow rawWrite is a major problem (1)
Mar 02 2012 D Wiki - Why is it in such shambles? (13)
Mar 02 2012 GC-safe memory copying for D (4)
Mar 02 2012 Julia: a language for technical computing (2)
Mar 02 2012 GSoC 2012 - already applied? (5)
Mar 01 2012 dereferencing null (171)
Mar 01 2012 CORBA in D (7)
Mar 01 2012 Tuples citizenship (27)
Mar 01 2012 std.format.doFormat and std.format.formattedWrite (2)
Mar 01 2012 Poll of the week: main OS and compiler (35)
Feb 29 2012 Can someone decipher this moon speak for me? (abi - calling (6)
Feb 29 2012 package and virtual (15)
Feb 29 2012 Reminder: Less than a week left on std.log review! (1)
Feb 29 2012 [druntime] TypeInfo.getHash problems (6)
Feb 29 2012 Type inference for delegates/lambdas as regular parameters? (4)
Feb 29 2012 Outputting generated .di files to correct module structure (7)
Feb 29 2012 Thoughts about in contract inheritance (12)
Feb 28 2012 [OT] A Note on Lazy Pure Functional Programming (2)
Feb 27 2012 Lexer and parser generators using CTFE (87)
Feb 27 2012 Compile-time Ducks (1)
Feb 27 2012 Need help locating AA bug (3)
Feb 27 2012 in not working with enum'd AA (5)
Feb 26 2012 Unittest compiling into file with main. (1)
Feb 26 2012 Curl on Windows (17)
Feb 26 2012 define in contract according to the caller, not the callee. (4)
Feb 26 2012 [RFC] Ini parser (7)
Feb 26 2012 Pseudo Members (3)
Feb 26 2012 Ring 0 in D (3)
Feb 26 2012 foreach by value iteration (12)
Feb 25 2012 Compile Time D Expression Parser? (21)
Feb 25 2012 Calling Kernel32 functions from D (5)
Feb 25 2012 State of Mango (11)
Feb 25 2012 Return value of std.process.system (1)
Feb 25 2012 John Carmack applauds D's pure attribute (73)
Feb 24 2012 Conclusions of the exception discussion (27)
Feb 24 2012 Resolving issues on the bugtracker (1)
Feb 23 2012 Floating point failures on x64 (7)
Feb 23 2012 re: PyD (5)
Feb 23 2012 Unable to post via forum web interface. (1)
Feb 23 2012 ARM targetting cross-toolchain with GDC (33)
Feb 23 2012 FP in D (today) (5)
Feb 23 2012 Setting a deadline for setting up shared ? (6)
Feb 22 2012 Rvalue forwarding (3)
Feb 22 2012 wxd does not build (3)
Feb 22 2012 DustMite updated (24)
Feb 22 2012 dmd -c behaviour doesn't take account of packages. (30)
Feb 22 2012 [RFC]Proposal for better garbage collection (27)
Feb 22 2012 PyD abandoned? (2)
Feb 22 2012 GitHub pull requests made easy (7)
Feb 22 2012 [RFC] ini parser (2)
Feb 22 2012 how to resolve "object-relational impedance mismatch" using D (3)
Feb 21 2012 Has anyone tried DMD on Mac OS X Mountain Lion (1)
Feb 21 2012 Custom calling conventions (27)
Feb 21 2012 no matching function for call to =?windows-1252?Q?=91Type=3A=3Ad?= (3)
Feb 20 2012 Questions about windows support (111)
Feb 20 2012 Static cast template (3)
Feb 19 2012 Safe navigation operator (9)
Feb 19 2012 std.collection lets rename it into std,ridiculous. (45)
Feb 19 2012 Seas of errors from DMD (5)
Feb 19 2012 Ideas from Clang (6)
Feb 19 2012 D autocomplete (1)
Feb 19 2012 size_t + ptrdiff_t (83)
Feb 19 2012 inout and function/delegate parameters (30)
Feb 19 2012 DxUnit (1)
Feb 19 2012 Howto build a repo case for a ICE? (19)
Feb 18 2012 empty arrays and cast(bool): WAT (24)
Feb 18 2012 Type deduction using switch case (7)
Feb 18 2012 ddoc changes (5)
Feb 18 2012 The Right Approach to Exceptions (573)
Feb 18 2012 Postgresql bindings for D2? (2)
Feb 18 2012 Improve anchors for ddoc (dlang.org) (12)
Feb 18 2012 structs, ~this(), this(this) and reference counting (9)
Feb 17 2012 multi_index (8)
Feb 17 2012 Associative arrays - non-intuitive 'in' semantics (7)
Feb 17 2012 When are associative arrays meant to throw a RangeError? (32)
Feb 17 2012 A file reading benchmark (12)
Feb 17 2012 [your code here] (12)
Feb 17 2012 [your code here] (12)
Feb 17 2012 [your code here] (5)
Feb 17 2012 dtors in shared structs fail to compile (1)
Feb 17 2012 Immutability, problems with debugging (2)
Feb 16 2012 Language idea - simple thread spawning (2)
Feb 16 2012 Why is there no or or and ? (70)
Feb 16 2012 Inheritance of purity (123)
Feb 16 2012 Two cases showing imperfection of the const system (16)
Feb 16 2012 [RFC] Ini parser (15)
Feb 16 2012 D Compiler port Android (2)
Feb 16 2012 The website structure (2)
Feb 16 2012 Object.opEquals, opCmp, toHash (24)
Feb 15 2012 const ref and rvalues (14)
Feb 15 2012 GDC bug: link error with cross-module templated AA member function (2)
Feb 14 2012 VisualD Console WIndow Disappears (5)
Feb 13 2012 More specific instantiations (8)
Feb 13 2012 D reviews (was: Review of std.log) (1)
Feb 13 2012 Review of Jose Armando Garcia Sancio's std.log (183)
Feb 13 2012 Disabling copy constructor in shared structs (1)
Feb 13 2012 The One-Letter Nested Function - a sample article for some kind of (23)
Feb 12 2012 newbie -- how to build module? (16)
Feb 12 2012 newbie - hey walter, improvement potentials for installer (18)
Feb 12 2012 Programming for std.log (11)
Feb 12 2012 basic types and alias (6)
Feb 12 2012 Changeing return type of struct.toString() (11)
Feb 12 2012 visibility vs. accessibility of protected symbols (27)
Feb 12 2012 -m64 doesn't work? (9)
Feb 11 2012 Thoughts about deprecation (3)
Feb 11 2012 More lexer questions (11)
Feb 11 2012 Octal-like integer literals (13)
Feb 11 2012 [your code here] (6)
Feb 10 2012 Bug? taskPool.map() with bufSize and writeln() gets stuck (5)
Feb 10 2012 Underscores in floating literals (2)
Feb 10 2012 D- (87)
Feb 10 2012 postblit constructor not called on slice copy (2)
Feb 09 2012 Named parameters workaround (1)
Feb 09 2012 Formating output of retro (4)
Feb 09 2012 RedMonk rankings (3)
Feb 09 2012 Message passing between threads: Java 4 times faster than D (32)
Feb 08 2012 Mac OS X 10.5 support (24)
Feb 08 2012 std.regex performance (11)
Feb 08 2012 regex get names (2)
Feb 07 2012 Output to console from DerivedThread class strange (2)
Feb 07 2012 How to save RAM in D programs (on zero initialized buffers): Reloaded (26)
Feb 06 2012 Should C functions automatically be nothrow? (9)
Feb 06 2012 assumeSafeAppend and purity (11)
Feb 06 2012 Front-end tools, Coccinelle and acceleration (1)
Feb 06 2012 Possible to pass a member function to spawn? (4)
Feb 06 2012 Link to D 2.0 language spec ebook is broken (2)
Feb 06 2012 std.xml and Adam D Ruppe's dom module (39)
Feb 05 2012 [OT] I ported Empire to D2 and made it cross platform. (18)
Feb 05 2012 Damn C++ and damn D! (18)
Feb 04 2012 Emacs D mode needs love (1)
Feb 04 2012 Doxygen (1)
Feb 04 2012 std.simd module (16)
Feb 04 2012 The Win32 HANDLE type under D2 (5)
Feb 04 2012 [your code here] (16)
Feb 04 2012 is there something like an compilefarm for the dmd windows/linx and (2)
Feb 03 2012 dmd Lexer and Parser in D (16)
Feb 03 2012 Opinion of February 2012 (37)
Feb 03 2012 Function template arg promotion (5)
Feb 03 2012 opCmp (5)
Feb 03 2012 is it a bug? protection attributes on interfaces/abstracts have no (11)
Feb 03 2012 Deimos projects for Clang and Ruby (13)
Feb 03 2012 Gdc & avr (38)
Feb 02 2012 what is a usage pattern for "static" in an interface? (22)
Feb 02 2012 libphobos.so libdruntime.so (24)
Feb 02 2012 Java memory efficiency and column-oriented data (7)
Feb 02 2012 Unique vs. shared return values (6)
Feb 02 2012 std.uuid is ready for review (26)
Feb 02 2012 FOSDEM (3)
Feb 02 2012 Deprecated language features (28)
Feb 01 2012 druntime vs phobos (5)
Feb 01 2012 Thoughts about private aliases now working (6)
Feb 01 2012 State of formatted input (2)
Feb 01 2012 [xmlp] the recent garbage collector performance improvements (45)
Jan 31 2012 phobos unittests not passing with dmd built by clang (14)
Jan 30 2012 Dlang.org needs a "Getting Started" page (11)
Jan 30 2012 Parallel prefix algos & D (1)
Jan 30 2012 [OT] Corona vs Marmalade vs ...? (3)
Jan 30 2012 unittest ddoc. (10)
Jan 30 2012 Compile time filesystem access? (19)
Jan 30 2012 Why not allow people to submit name:url associations for dman? (4)
Jan 29 2012 state of the pull autotester (8)
Jan 29 2012 Higher abstraction level for calling C functions (8)
Jan 29 2012 dmd2 (15)
Jan 29 2012 Constancy of invariants (5)
Jan 29 2012 Issues with linker map file (6)
Jan 29 2012 Strict aliasing in D (20)
Jan 29 2012 Should export be stripped by the .di generator? (8)
Jan 29 2012 indent style for D (83)
Jan 28 2012 killer App for D? (was: State of D on iOS/Android) (25)
Jan 28 2012 cent and ucent? (44)
Jan 28 2012 CTFE attribute (15)
Jan 28 2012 [your code here] (11)
Jan 28 2012 State of D on iOS/Android? (18)
Jan 27 2012 Tutorial on D ranges now on reddit (4)
Jan 27 2012 weak linking (3)
Jan 27 2012 simultaneous multiple key sorting algorithm (24)
Jan 27 2012 Secure memory support (2)
Jan 26 2012 Alternative template instantiation syntax (8)
Jan 26 2012 strong enums: why implicit conversion to basetype? (24)
Jan 25 2012 enum scope (45)
Jan 24 2012 Windows API and druntime/Phobos (28)
Jan 25 2012 MS extend C++ significantly for Windows8... and Andrei got name drop (30)
Jan 24 2012 Deimos: Request for repository for libFLAC (1)
Jan 25 2012 automated C++ binding generation.. Booost D, NO , Not us. SIMD is (84)
Jan 24 2012 using enums for flags (16)
Jan 24 2012 FFT in D (using SIMD) and benchmarks (15)
Jan 24 2012 dmd makefile dependencies (8)
Jan 24 2012 public aliases to private/package symbols (24)
Jan 24 2012 WAT ! Or nonsense that we should avoid in D. (5)
Jan 23 2012 DMD 2.056 linked from Digital Mars website (1)
Jan 23 2012 Can't the dmd source files finally get a proper C++ file extension? (10)
Jan 23 2012 A modest proposal (26)
Jan 23 2012 Ranges and indexes with foreach (12)
Jan 23 2012 Is SIMD template (4)
Jan 23 2012 D for the web? (27)
Jan 22 2012 HELP! DMD Asserts while generating DI files. (6)
Jan 22 2012 [OT] "The Condescending UI" (was: Do we need Win95/98/Me support?) (78)
Jan 22 2012 Do we need Win95/98/Me support? (58)
Jan 22 2012 Aliasing of template results (14)
Jan 22 2012 Inline Assembler rox (2)
Jan 21 2012 Apparently unsigned types really are necessary (48)
Jan 21 2012 foreach on interval index by ref increment (13)
Jan 21 2012 Planning to migrate SDWF to Unicode (1)
Jan 21 2012 Re: [OT] destroy all software (was Programming language WATs) (4)
Jan 21 2012 Can gc_stats be exposed through core.memory? (3)
Jan 21 2012 isize_t? (35)
Jan 21 2012 D1, D2 and the future of libraries (11)
Jan 21 2012 binding tool for C libs (10)
Jan 20 2012 Bug tracking and assigned to (10)
Jan 20 2012 [OT] Programming language WATs (73)
Jan 20 2012 wxWidgets good news (26)
Jan 19 2012 Github and Bugzilla Integration (4)
Jan 19 2012 64Bit compatibility warnings (22)
Jan 19 2012 Invariant and pre/post-conditions order (21)
Jan 19 2012 C++ pimpl (22)
Jan 19 2012 Message-Passing (35)
Jan 19 2012 Redistribution of snn.lib? (5)
Jan 19 2012 Why the Standard Library (22)
Jan 18 2012 ref const array error (10)
Jan 18 2012 Module of assumeUnique (7)
Jan 18 2012 Whiley mentions D (3)
Jan 18 2012 DM linker vs GCC linker? (14)
Jan 17 2012 std.math conflicts with std.mathspecial (8)
Jan 16 2012 byKey and byValue: properties or methods? (143)
Jan 16 2012 Replacing version( Win32 ) with version( Windows ) (2)
Jan 16 2012 byKey and byValue (2)
Jan 16 2012 Limitation with current regex API (14)
Jan 15 2012 new std.process and "Win/DMC runtime issues"? (3)
Jan 15 2012 __declspec(dllexport) (3)
Jan 15 2012 version() (8)
Jan 15 2012 [your code here] (9)
Jan 15 2012 Call site 'ref' (45)
Jan 15 2012 Intrusive Makefile for d-programming-language.org (5)
Jan 14 2012 SIMD benchmark (70)
Jan 14 2012 dmd 2.057 64bit produces broken binaries (1)
Jan 14 2012 GCC depen issue on linux (7)
Jan 14 2012 New ISO C standard - C11 nad D2 (2)
Jan 13 2012 Clarification on testsuite 'runnable/testmath.d' (6)
Jan 13 2012 Big kudos to Walter and Sean (1)
Jan 13 2012 Pow operator precedence (39)
Jan 13 2012 start on SIMD documentation (59)
Jan 12 2012 [OT] Anyone w/ svn->git experience and advice? (20)
Jan 12 2012 Igor Stepanov's runtime reflection patch (6)
Jan 12 2012 Andrei's castle located (3)
Jan 12 2012 wxC & wxD (aka: let's work together with wxhaskell project) (4)
Jan 12 2012 No parenthesis for assert? (8)
Jan 11 2012 Biggest Issue with D - Definition and Versioning (120)
Jan 11 2012 A few bugs connected to structs (7)
Jan 10 2012 Ref local variables? (13)
Jan 10 2012 Vector performance (16)
Jan 09 2012 Row mismatch in CSV (4)
Jan 08 2012 plans for interfacing to C++ (17)
Jan 08 2012 compact library for creating window + OpenGL context + input (11)
Jan 08 2012 Switching from Ruby to C++ for games (10)
Jan 08 2012 D syntax highlighing support for debugging in CGDB (7)
Jan 08 2012 Strange Runtime Error - Static Arrays (5)
Jan 07 2012 Discussion about D at a C++ forum (50)
Jan 07 2012 Struct array assign? (1)
Jan 07 2012 Runtime version statement (9)
Jan 07 2012 [OT] Previously: DMD - Windows -> C# in gamedev (40)
Jan 06 2012 Compiling in std.regex affecting performance (1)
Jan 06 2012 Welcome to the Jungle (article about the future of parallel computing) (15)
Jan 06 2012 Automatic binding generation (9)
Jan 06 2012 DMD - Windows (79)
Jan 06 2012 Cool tricks with D (3)
Jan 06 2012 D and SCons (2)
Jan 05 2012 SIMD support... (154)
Jan 05 2012 x64 call instruction E8 00 00 00 00? (4)
Jan 05 2012 Compiler for multiple languages, including D (13)
Jan 04 2012 simple OpenGL app (3)
Jan 04 2012 Specialization - Major hole in the spec? (16)
Jan 04 2012 CURL question on ubuntuforums.org (17)
Jan 03 2012 Multiple return values (1)
Jan 03 2012 Properties (2)
Jan 03 2012 Nightly builds (2)
Jan 03 2012 ACCU and D (16)
Jan 02 2012 Incompatible libphobos2.a? (6)
Jan 02 2012 Vim syntax file for the D programming language (8)
Jan 02 2012 D Feed Feature request : Message SuperDan ification (1)
Jan 02 2012 Ideas for runtime loading of shared libraries. (41)
Jan 02 2012 Names of C functions exported from a dll (4)
Jan 02 2012 dmd testsuite naming scheme (9)
Jan 02 2012 Discussion on D at archlinux.org (2)
Jan 02 2012 std.math.abs(int.min) == int.min? (1)
Jan 01 2012 Better distinguishing reference and value in the syntax? (7)
Jan 01 2012 Can anyone reproduce this? (11)
Jan 01 2012 A small style tip (4)
Jan 01 2012 How mutable is immutable? (9)
Dec 31 2011 Happy New Year in 2012.... (35)
Dec 31 2011 Database developer's gentle view on D. (14)
Other years:
2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 | http://www.digitalmars.com/d/archives/digitalmars/D/index2012.html | CC-MAIN-2016-50 | refinedweb | 15,301 | 63.93 |
The aim of this coursework is to code a Python 3 module
stocktrader that allows the user to load historical financial data and to simulate the buying and selling of shares on the stock market. Shares represent a fraction of ownership in a company and the total of all shares form the stock of that company. Shares can be bought and sold on the stock market at a price that varies daily. A reasonable investor aims to buy cheap shares and sells them when the price is higher. The actions of buying and selling shares are referred to as transactions. Transactions usually incur transaction fees, but we will not consider these in this project.
The Python knowledge contained in the lecture notes is essentially sufficient to complete this project. While you are allowed to consult the web for getting ideas about how to solve a specific problem, the most straightforward solution may already be in the lecture notes. You are also allowed to use online sources, but you must clearly indicate copy-and-pasted code like so:
# the following 3 lines follow a similar code on # as retrieved on 24/04/2018
This project is the equivalent of a standard exam and it counts 70% towards your final mark. Consequently, the standard examination rules apply to this project.
Once your Python module is submitted via the Blackboard system, it will undergo plagiarism tests:
There are several factors that enter the assessment:
The coursework can be completed and submitted as a single Python module named
stocktrader.py. The submission is via Blackboard and the strict deadline is Thursday, May 10th, at 1pm. You can resubmit your coursework as often as you like, but only the last submission counts. Submissions after the deadline will not be accepted.
Download the coursework.zip file and unzip the folder to a convenient location on your computer (e.g., your Desktop). The folder already contains a template for your
stocktrader.py module. Your whole coursework project can be completed using this module. You "only" need to replace the TODO comments with the actual code. Make sure that all code is contained in functions so your module "does not do anything" when it is imported into another Python program.
Module template:
""" stocktrader -- A Python module for virtual stock trading TODO: Add a description of the module... Also fill out the personal fields below. Full name: Peter Pan StudentId: 123456 Email: [email protected] """ class TransactionError(Exception): pass class DateError(Exception): pass stocks = {} portfolio = {} transactions = [] def normaliseDate(s): # TODO # TODO: All other functions from the tasks go here def main(): # Test your functions here # the following allows your module to be run as a program if __name__ == '__main__' or __name__ == 'builtins': main()
CSV data:
The coursework folder also contains the files
portfolio0.csv and
portfolio.csv in the same location as the
stocktrader.py file.
In the subfolder
stockdata you will find ten CSV files containing historic stock prices of different companies.
The module
stocktrader uses three essential data structures as explained below.
stocksdictionary¶
The dictionary
stocks stores historic financial data that your module can work with. The data for
stocks is located in the
stockdata subfolder, with each file of the form
SYMBOL.csv corresponding to a particular company. Every entry in the
stocks dictionary is a key-value pair. Each key is a string corresponding to a symbol and the value is again a dictionary.
The dictionaries in
stocks contain key-value pairs where the key (a string) corresponds to a date in the form
YYYY-MM-DDand the value is a list of floating point numbers
[ Open, High, Low, Close ] corresponding to the prices of a stock at that particular date.
Here is an excerpt of a valid stocks dictionary containing data for the symbol
EZJ (easyJet plc) and
SKY (Sky plc):
stocks = { 'EZJ' : { '2012-01-03' : [435.273010, 435.273010, 425.050995, 434.835999], '2012-01-04' : [434.618011, 434.618011, 423.273010, 428.072998], '2012-01-05' : [430.472992, 430.472992, 417.273010, 418.364014], ... }, 'SKY' : { '2012-01-03' : [751.000000, 755.500000, 731.500000, 742.000000], '2012-01-04' : [740.000000, 741.125000, 718.000000, 730.000000], '2012-01-05' : [733.500000, 735.500000, 719.500000, 721.000000], ... }, }
The interpretation of this data at an example is as follows: on the 4rd of January 2012 the price of a Sky share ranged between £718.00 (the "low") and £741.125 (the "high").
portfoliodictionary¶
portfolio is a dictionary that represents our capital at a given date. Our capital is the combination of cash and the shares that you hold. The keys in
portfolio are strings
date,
cash, and arbitrarily many symbols. The respective values are the date of the last transaction performed on the portfolio in the form
YYYY-MM-DD, the cash amount as a floating point number, and the integer number of shares held for each symbol.
Here's an example of a valid portfolio dictionary:
portfolio = { 'date' : '2013-11-27', 'cash' : 12400.45, 'EZJ' : 10 }
The interpretation of this is as follows: on the 27th of November 2013 we have £12,400.45 in cash and we own 10 shares of easyJet. We could now look up in the
stocks dictionary that the low price of easyJet on that day is £1426.00. Hence, if we sold all 10 easyJet shares on this day, we'd have £12,400.45 + 10 x £1426.00 = £26,660.45 of cash and no more
EZJ shares. In this case the
portfolio dictionary would only have two keys,
date and
cash.
transactionslist¶
transactions is a list of dictionaries, with each dictionary corresponding to a buy/sell transaction on our portfolio. Here is an example of a valid transactions list:
transactions = [ { 'date' : '2013-08-11', 'symbol' : 'SKY', 'volume' : -5 }, { 'date' : '2013-08-21', 'symbol' : 'EZJ', 'volume' : 10 } ]
The interpretation of this is as follows: on 11th of August 2013 we sold 5 shares of Sky (because
volume is negative), and on the 21st of August 2013 we bought 10 shares of easyJet (because
volume is positive). The value of
volume is always an integer, and the
date values are chronological: while there can be two or more neighboring list entries in
transactions having the same date, the following ones can never have an earlier date. This makes sense as the time order of transactions is important.
normaliseDate(s)¶
Write a function
normaliseDate(s) which takes as input a string
s and returns a date string of the form
YYYY-MM-DD. The function should accept the following input formats:
YYYY-MM-DD,
YYYY/MM/DD and
DD.MM.YYYY, where
DD and
MM are integers with one or two digits (the day and/or month can be given with or without a leading
0), and
YYYY is a four-digit integer. The function converts all of these formats to
YYYY-MM-DD.
If the conversion of the format fails (i.e., it is not exactly in any of the formats specified above), the function raises a
DateError exception.
Note that this function is only about conversion of formats, and there is no need to check whether the date
YYYY-MM-DD actually exists.
Example: Both
normaliseDate('08.5.2012') and
normaliseDate('2012/05/8') should return the string
2012-05-08, while
normaliseDate('8.5.212') should raise a
DateError exception.
loadStock(symbol)¶
Write a function
loadStock(symbol) which takes as input a string
symbol and loads the historic stock data from the corresponding CSV file (in the
stockdata subdirectory) into the dictionary
stocks. The function does not need to return anything as the dictionary
stocks is in the outer namespace and therefore accessible to the function.
The CSV files in the
stockdata subdirectory are of the following format:
Date,Open,High,Low,Close,AdjClose,Volume, where
Dateis in any of the formats accepted by the function
normaliseDate(), and all other entries are floating point numbers corresponding to prices and trading volumes. Note that only the first values are relevant for filling the
stocksdictionary and
AdjClose,Volumecan be ignored.
If the file given by
symbol cannot be opened (as it is not found), a
FileNotFoundError exception should be raised.
If a line in the CSV file is of an invalid format, a
ValueError exception should be raised.
Example:
loadStock('EZJ') should load the easyJet data from the file
stockdata/EZJ.csv into the dictionary
stocks, whereas
loadStock('XYZ') should raise a
FileNotFoundError exception.
loadPortfolio(fname)¶
Write a function
loadPortfolio(fname) which takes a input a string
fname corresponding to the name of a CSV file in the same directory as
stocktrader.py. The function loads the data from the file and assigns them to the
portfolio dictionary, with all entries of the form described above (including the date!).
Make sure that
portfolio is emptied before new data is loaded into it, and that the list
transactions is emptied as well.
The function does not need to return anything as the dictionary
portfolio is in the outer namespace and therefore accessible to the function. If no filename is provided, the name
portfolio.csv should be assumed.
As the
loadPortfolio(fname) function goes through the list of shares in the CSV file, it should use the function
loadStock(symbol) from Task 2 to load the historic stock data for each
symbol it encounters.
A valid portfolio CSV file is of the following form:
normaliseDate()
symbol,volume. Here,
symbolis the symbol of a stock and
volumeis an integer corresponding to the number of shares.
Here is an example of a portfolio.csv file:
2012/1/16 20000 SKY,5 EZJ,8
If the file specified by
fname cannot be opened (as it is not found), a
FileNotFoundError exception should be raised.
If a line in the file is of an invalid format, a
ValueError exception should be raised.
Example:
loadPortfolio() should empty the dictionary
portfolio and the list
transactions, and then load the data from portfolio.csv into the dictionary
portfolio, as well as the corresponding stock data into the dictionary
stocks.
valuatePortfolio(date, verbose)¶
Write a function
valuatePortfolio(date, verbose) with two named parameters
date and
verbose. The function valuates the portfolio at a given date and returns a floating point number corresponding to its total value. The parameter
date is any string accepted by the
normaliseDate() function and when it is not provided, the date of the
portfolio is used. The parameter
verbose is a Boolean value which is
False by default. When the function is called with
verbose=True it should still return the total value of the portfolio but also print to the console a table of all capital with the current low prices of all shares, as well as the total value.
Example: With the
portfolio.csv example given in Task 3, a call to
valuatePortfolio('2012-2-6') should return the floating point number
27465.372072.... When
valuatePortfolio('2012-2-6', True) is called, it should also print a table like this:
Your portfolio on 2012-02-06: [* share values based on the lowest price on 2012-02-06] Capital type | Volume | Val/Unit* | Value in £* -----------------------+--------+-----------+------------- Cash | 1 | 20000.00 | 20000.00 Shares of SKY | 5 | 686.50 | 3432.50 Shares of EZJ | 8 | 504.11 | 4032.87 -----------------------+--------+-----------+------------- TOTAL VALUE 27465.37
Note 1: For the valuation we use the low prices of Sky and easyJet on
date, in this case the 6th of February 2012. This is to be on the safe side: if we were selling the shares on that day, we would at least get those prices.
Note 2: A call to
valuatePortfolio(date) should raise
DateError exceptions in two cases:
When
date is earlier than the date of the portfolio, there might have been transactions afterwards and we no longer know what was the value back then. For example,
valuatePortfolio('2012-1-3') should fail if the portfolio is already dated
2012-02-06.
When
date is not a trading day (e.g., a bank holiday or weekend) the CSV files will not contain any price for it and hence we cannot look up the values of shares. For example,
valuatePortfolio('2012-2-12') should fail for that reason.
addTransaction(trans, verbose)¶
Write a function
addTransaction(trans, verbose) which takes as input a dictionary
trans corresponding to a buy/sell transaction on our portfolio and an optional Boolean variable
verbose (which is
False by default). The dictionary
trans has three items as follows:
datewhose value is any string accepted by the function normaliseDate()
symbolwhose value is a string corresponding to the symbol of a stock
volumewhose value is an integer corresponding to the number of shares to buy or sell.
Example: Here are two valid transaction dictionaries, the first one for selling 5 shares of Sky on 12th of August 2013, and the second for buying 10 shares of easyJet on the 21st of August 2013.
{ 'date' : '2013-08-12', 'symbol' : 'SKY', 'volume' : -5 }, { 'date' : '21.08.2013', 'symbol' : 'EZJ', 'volume' : 10 }
A call to the
addTransaction(trans) function should
portfoliovalue for
cash
portfolioto the date of the transaction
transto the list
transactions.
To be on the safe side, we always assume to sell at the daily low price and buy at the daily high price.
The
addTransaction(trans) function does not need to return any values as both
portfolio and
transactions are available in the outer namespace and therefore accessible to the function.
If the optional Boolean parameter
verbose=True the function should print to the console an informative statement about the performed transaction.
Example: The call
addTransaction({ 'date':'2013-08-12', 'symbol':'SKY', 'volume':-5 }, True)
should print something like
> 2013-08-12: Sold 5 shares of SKY for a total of £4182.50 Available cash: £24182.50
Exceptions: The function
addTransaction(trans) may fail for several reasons, in which case both
portfolio and
transactions should remain unchanged and the appropriate exception should be raised:
dateof the transaction is earlier than the date of the portfolio, a
DateErrorexception should be raised (i.e., one cannot insert any transactions prior to the last one)
symbolvalue of the transaction is not listed in the stocks dictionary, a
ValueErrorexception should be raised
volumeis such that we either do not have enough cash to perform a buying transaction or we do not have enough (or none at all) shares to perform a selling transaction, a
TransactionErrorexception should be raised.
When you arrive here, it's time to take a break and test your code extensively. You should now be able to use your module to load portfolio and stock data files into your computers memory, print the value of your portfolio, and perform buying and selling transactions. For example, if you create a
test_stocktrader.py file (or use the one in the coursework.zip folder) the following code should now work:
import stocktrader as s s.loadPortfolio() val1 = s.valuatePortfolio(verbose=True) trans = { 'date':'2013-08-12', 'symbol':'SKY', 'volume':-5 } s.addTransaction(trans,verbose=True) val2 = s.valuatePortfolio(verbose=True) print("Hurray, we have increased our portfolio value by £{:.2f}!".format(val2-val1))
The console output should be something like this:
Your portfolio on 2012-01-16: [* share values based on the lowest price on 2012-01-16] Capital type | Volume | Val/Unit* | Value in £* -----------------------+--------+-----------+------------- Cash | 1 | 20000.00 | 20000.00 Shares of SKY | 5 | 677.50 | 3387.50 Shares of EZJ | 8 | 429.93 | 3439.42 -----------------------+--------+-----------+------------- TOTAL VALUE 26826.92 > 2013-08-12: Sold 5 shares of SKY for a total of £4182.50 Available cash: £24182.50 Your portfolio on 2013-08-12: [* share values based on the lowest price on 2013-08-12] Capital type | Volume | Val/Unit* | Value in £* -----------------------+--------+-----------+------------- Cash | 1 | 24182.50 | 24182.50 Shares of EZJ | 8 | 1327.35 | 10618.80 -----------------------+--------+-----------+------------- TOTAL VALUE 34801.30 Hurray, we have increased our portfolio value by £7974.38!
Before moving on to the final tasks, make sure that all the functions of Tasks 1-5 work as expected, that all calculations are correct, and that the appropriate exceptions are raised whenever a problem occurs. The following tasks will rely on these core functions.
savePortfolio(fname)¶
Write a function
savePortfolio(fname) that saves the current dictionary
portfolio to a CSV file with name
fname (a string). The file should be saved in the same directory as the
stocktrader.py module. If no filename is provided, the name
portfolio.csv should be assumed.
The function does not need to return anything.
Example:
savePortfolio('portfolio1.csv') should store the values of the
portfolio in the file
portfolio1.csv.
sellAll(date, verbose)¶
Write a function
sellAll(date, verbose) that sells all shares in the portfolio on a particular date. Here,
date is an optional string of any format accepted by the function
normaliseDate() and
verbose is an optional Boolean variable which is
False by default. If
verbose=True all selling transactions are printed to the console. If
date is not provided, the date of the portfolio is assumed for the sell out.
Note: You should be able to use a simple loop with the function
addTransaction(trans, verbose) for this task.
loadAllStocks()¶
Write a function
loadAllStocks() which loads all historic stock data from the stockdata subdirectory into the dictionary
stocks. The function does not need to return anything as the dictionary
stocks is in the outer namespace and therefore accessible to the function.
If the loading of one of the files in the stockdata subdirectory fails, this file should simply be ignored. The coursework.zip folder contains an invalid file
invalidcsv/PPB.csv which you can use for testing this.
Note: You should be able to use a simple loop with the function
loadStock(symbol) for this task. You may want to use the
os module for getting a list of all files in a directory.
tradeStrategy1(verbose)¶
Write a function
tradeStrategy1(verbose) that goes through all trading days in the dictionary
stocks and buys and sells shares automatically. The strategy is as follows:
stock(whichever is later)
jwe will only consider buying new shares on the following trading day,
j+1.
Assume that
j is the index of the current trading day, then we will find the stock to buy as follows:
For each stock
s available in
stocks evaluate the quotient
Q_buy(s,j) = 10*H(s,j) / (H(s,j) + H(s,j-1) + H(s,j-2) + ... + H(s,j-9))
where
H(s,j) is the high price of stock
s at the
j-th trading day. Note that
Q_buy(s,j) is large when the high price of stock
s on trading day
j is large compared the average of all previous ten high prices (including the current). This means we might enter a phase of price recovery.
Find the maximal quotient
Q_buy(s,j) among all stocks
s and buy a largest possible volume
v of the corresponding stock on trading day
j. (It might not be possible to buy any as there might not be enough cash left; in this case do nothing on trading day
j and move to the next. If two or more stocks have exactly the same quotient, take the one whose symbol comes first in lexicographical order.)
Note that, as usual, our buying decision is based on the high price.
If we have automatically bought
v shares of a stock
s on trading day
j, then from trading day
k = j+1 onwards we will consider selling all of it as follows:
On trading day
k = j+1, j+2, ... calculate the quotient
Q_sell(k) = L(s,k) / H(s,j),
where
L(s,k) corresponds to the low price of stock
s on trading day
k. This quotient is high if the current low value of the stock is large compared to the high value to which we bought it.
Sell all
v shares of
s on day
k if
Q_sell(k) < 0.7 (we already lost at least 30%, let's get rid of these shares!) or if
Q_sell(k) > 1.3 (we made a profit of at least 30%, time to cash in!).
Notes:
stocksdictionary:
You can assume that all loaded stocks in theYou can assume that all loaded stocks in the
lst = [ '2012-01-03', '2012-01-04', ..., '2018-03-13' ]
stocksdictionary can be traded on exactly the same days, and that there is at least one stock in that dictionary.
addTransaction(trans, verbose)function from Task 5. The
verboseparameter of
tradeStrategy1(verbose)can just be handed over to
addTransaction(trans, verbose).
Example: The following code loads a portfolio of £20,000 cash (and no shares) on the 1st of January 2012, runs the
tradeStrategy1(verbose=True) until the end of available data, and valuates the portfolio on the 13th of March 2018.
s.loadPortfolio('portfolio0.csv') s.loadAllStocks() s.valuatePortfolio(verbose=True) s.tradeStrategy1(verbose=True) s.valuatePortfolio('2018-03-13', verbose=True)
The console output is as follows:
Your portfolio on 2012-01-01: [* share values based on the lowest price on 2012-01-01] Capital type | Volume | Val/Unit* | Value in £* -----------------------+--------+-----------+------------- Cash | 1 | 20000.00 | 20000.00 -----------------------+--------+-----------+------------- TOTAL VALUE 20000.00 > 2012-01-16: Bought 29 shares of PRU for a total of £19517.00 Remaining cash: £483.00 > 2012-11-21: Sold 29 shares of PRU for a total of £25520.00 Available cash: £26003.00 > 2012-11-22: Bought 37 shares of EZJ for a total of £25696.50 Remaining cash: £306.50 > 2013-01-25: Sold 37 shares of EZJ for a total of £33633.00 Available cash: £33939.50 > 2013-01-28: Bought 35 shares of EZJ for a total of £33103.00 Remaining cash: £836.50 > 2013-05-21: Sold 35 shares of EZJ for a total of £43120.00 Available cash: £43956.50 > 2013-05-22: Bought 34 shares of EZJ for a total of £43905.22 Remaining cash: £51.28 > 2014-01-22: Sold 34 shares of EZJ for a total of £58208.00 Available cash: £58259.28 > 2014-01-23: Bought 18 shares of BATS for a total of £57456.00 Remaining cash: £803.28 > 2016-04-08: Sold 18 shares of BATS for a total of £74853.00 Available cash: £75656.28 > 2016-04-11: Bought 68 shares of SMIN for a total of £75140.00 Remaining cash: £516.28 > 2016-09-29: Sold 68 shares of SMIN for a total of £98532.00 Available cash: £99048.28 > 2016-09-30: Bought 108 shares of SKY for a total of £98594.49 Remaining cash: £453.79 > 2018-02-27: Sold 108 shares of SKY for a total of £140400.00 Available cash: £140853.79 > 2018-02-28: Bought 104 shares of SKY for a total of £140192.00 Remaining cash: £661.79 Your portfolio on 2018-03-13: [* share values based on the lowest price on 2018-03-13] Capital type | Volume | Val/Unit* | Value in £* -----------------------+--------+-----------+------------- Cash | 1 | 661.79 | 661.79 Shares of SKY | 104 | 1316.00 | 136864.00 -----------------------+--------+-----------+------------- TOTAL VALUE 137525.79
Not bad! In a bit more than six years we have multiplied our initial investment of £20,000 by a factor of almost seven. I am now quitting my job as a lecturer, but promise to still mark your coursework in my new house on the Cayman Islands...
tradeStrategy2(verbose)¶
When you modify the start date of your portfolio, or remove some of the stocks from the available data, you will see that
tradeStrategy1() is not very robust and we've just been lucky to make so much profit. Also, it is kind of strange that we repeatedly sell and then immediately buy the same stock. This doesn't seem to make much sense. In some cases, this strategy results in big loses.
Can you write your own
tradeStrategy2(verbose) function that performs better?
The conditions are as follows:
tradeStrategy2(verbose)should only perform transactions via the function
addTransaction(trans,verbose)
tradeStrategy2(verbose)itself should not modify the dictionaries
portfolio,
stocksand neither the list
transactions
tradeStrategy2(verbose)should work on all valid
stockand
portfoliodictionaries, with different companies than the provided ones and over different time ranges
[ Open, High, Low, Close ]available up to that day (i.e., no information from the future is used for making decisions); no other (external) data should be used
tradeStrategy2(verbose)can (and probably should) "diversify" to reduce the risk, which means that any time it can decide to have shares of more than one stock in the portfolio, or no shares at all
tradeStrategy2(verbose)is not restricted to a single buying or selling transaction per day, and even allowed to buy and sell shares of a stock on the same day (which would however incur a loss because buying is at the daily high price, and selling at the low price)
tradeStrategy2(verbose)should not use any "randomness", i.e., two calls to the function with exactly the same data should result in an indentical list of transactions
tradeStrategy2(verbose)should run reasonably fast, not longer than a couple of seconds on the provided data.
Industry sponsor: Sabisu is a Manchester-based software company that provide an operational and project intelligence platform for oil & gas and petrochemicals customers (including global leaders like Shell and Sabic). Much of Sabisu's work is related to time series and they use Python for the analytics. Sabisu have a long-standing collaboration with our School of Mathematics and the University in general.
End of coursework. | http://nbviewer.jupyter.org/url/personalpages.manchester.ac.uk/staff/stefan.guettel/py/coursework2018.ipynb | CC-MAIN-2018-26 | refinedweb | 4,241 | 63.19 |
In the simple case where high card always wins one optimal strategy that Bessie can take is to always answer FJ's plays with her lowest card that is still higher than FJ's card (or her lowest card in the case she can't beat FJ). This works because if we can take something we should; otherwise the best that the card we didn't end up using can gain us is 1 trick so there can be no net gain.
This strategy informs the more complicated scenario where we switch from high card wins to low card wins at some point. In this case we should always allocate our highest cards to the section where high card wins and are lowest cards to the latter section. Then this reduces to the simpler case.
To solve this problem where we need to determine the best switch point we can make use a segment tree data structure that will enable us to solve the online version of the simple case. We will be able to insert a card for each player and determine the max score Bessie could achieve. Using this data structure we can determine how many points Bessie will get from the high card wins and low card wins part of each game and output the switch point that yields the highest overall score.
Building this data structure can be done by tracking for each segment in the tree the number of available cards in this segment that Bessie could play over lower cards, the number of coverable cards that FJ has played in this segment that haven't been covered, and the number of points we can score in this segment. Combining two segments is then done by summing the points and awarding points based on the min of coverables on the left and coverers on the right. The other fields are updated similarly (see comb() in my code below). The rest is a standard segment tree implementation.
#include <iostream> #include <vector> #include <cstdio> #include <algorithm> #include <cstring> #include <algorithm> using namespace std; #define MAXN (1 << 17) struct node { int covers; int coverables; int points; }; node comb(node x, node y) { node r; int ep = min(x.coverables, y.covers); r.points = x.points + y.points + ep; r.covers = x.covers + y.covers - ep; r.coverables = x.coverables + y.coverables - ep; return r; } node H[MAXN * 2]; void fix(int x) { while (x != 1) { x /= 2; H[x] = comb(H[x * 2 + 0], H[x * 2 + 1]); } } vector<int> solve(const vector<int>& A, const vector<int>& B) { int N = A.size(); vector<int> R(N + 1); memset(H, 0, sizeof(H)); for (int i = 0; i < N; i++) { H[MAXN + B[i]].covers = 1; H[MAXN + A[i]].coverables = 1; fix(MAXN + B[i]); fix(MAXN + A[i]); R[i + 1] = H[1].points; } return R; }; } vector<int> B; for (int i = 2 * N - 1; i >= 0; i--) { if (!used[i]) { B.push_back(i); } } vector<int> r0 = solve(A, B); reverse(A.begin(), A.end()); reverse(B.begin(), B.end()); for (int i = 0; i < N; i++) { A[i] = 2 * N - 1 - A[i]; B[i] = 2 * N - 1 - B[i]; } vector<int> r1 = solve(A, B); int res = 0; for (int i = 0; i <= N; i++) { res = max(res, r0[i] + r1[N - i]); } cout << res << endl; return 0; }
Many other participants submitted alternative solutions to this problem that were quite insightful. For example, here is a solution from Avichal Goel:
Part 1: Insert all of Bessie's cards into a set. Iterate through all of Elsie's cards, and remove the lowest card that is greater than Elsie's current card (or nothing if you can't beat it). Keep track of the number of points, or "cards beaten so far" in a prefix array.
Part 2: Replace all of Bessie's cards (I used a 2nd set). Iterate through Elsie's cards in reverse order, beating each of her cards with your greatest card that is still lower than Elsie's card. Keep track of points earned in a separate suffix array
Part 3: Loop through the possible times that Bessie can switch, and store the greatest prefix[i]+suffix[i+1].
The reasoning for why this "greedy" solution works is as follows. Let's assume that some card is used twice (in both Part 1 and Part 2, since we did replace all the cards in between those steps). Since Bessie and Elsie have the same number of cards, if Bessie used one of her cards twice, then there must be some other card which she did not use at all. Since every card has a distinct value, the unused card must either be greater than or less than the card which was used twice. If the unused card is greater than the card which was used twice, replace it before Bessie switches the rules (use it instead of the duplicate card). Otherwise, use it after Bessie switches the rules instead of the duplicate card. In either case, Bessie will still earn the same number of points as before. | http://usaco.org/current/data/sol_cardgame_platinum_dec15.html | CC-MAIN-2018-17 | refinedweb | 857 | 74.93 |
.
The
functools library contains many items that allow you
to make the most out of lambda functions. A common example
is the
reduce function. We'll show a demonstration below.
from functools import reduce numbers = [1, 2, 3, 4, 5] # sum via reduce reduce(lambda x, y: x + y, numbers) # prod via reduce reduce(lambda x, y: x * y, numbers)
Note that
reduce tells us what we are doing while the
lambda function tells us how we are doing it.
Feedback? See an issue? Something unclear? Feel free to mention it here.
If you want to be kept up to date, consider getting the newsletter. | https://calmcode.io/lambda/reduce.html | CC-MAIN-2020-34 | refinedweb | 105 | 73.58 |
hey all,
i'm trying to get all content of a webpage using python and trying to put them all into a file.
Here is my code:
import urllib data = urllib.urlopen('').read() #print data //if i ignore the rest part of this code the code is just working awesome...its printing the content of index.html f = open('somefile.html','w') //that i have already created. for lines in data.read(): print lines f.write(lines) #f.writelines('data') f.close()
I'm getting following errors:
Traceback (most recent call last): File "C:/Python24/showpage.py", line 5, in -toplevel- for lines in data.read(): AttributeError: 'str' object has no attribute 'read'
i'm using windows and Python 2.4. | https://www.daniweb.com/programming/software-development/threads/349267/problem-with-urllib | CC-MAIN-2018-39 | refinedweb | 121 | 70.7 |
If you are binding some data source in grid view which having any field type of Boolean then Grid View Rendered it as “Checkbox” . But sometime we may required to display either Yes/ No or “1/0” instead of Checked/ Unchecked Text Box. Here is an quick tip which described how you can override the checkbox to your required value in GridView RowDataBound events.
Let’s consider you have a simple class “Student” with some student records.
public class Student { public int Roll { get; set; } public string Name { get; set; } public bool Status { get; set; } } protected void Page_Load(object sender, EventArgs e) { List<Student> students = new List<Student>(); students.Add(new Student { Roll = 1, Name = "Abhijit", Status=true}); students.Add(new Student {Roll=2,Name="Manish",Status=false}); students.Add(new Student { Roll = 3, Name = "Atul", Status = true }); GridView2.DataSource = students; GridView2.DataBind(); }
Now if you run the application you will get below out put Which is the default behavior of GridView
Now Change the binding during on RowDataBound of GridView
/// <summary> /// Handles the RowDataBound event of the GridView2 control. /// </summary> /// <param name="sender">The source of the event.</param> /// <param name="e">The <see cref="System.Web.UI.WebControls.GridViewRowEventArgs"/> instance containing the event data.</param>"; } } }
Now if you run the application, your output will be looks like below.
Instead of 1/0 you can use “Yes/No” or whatever value you want instead of Checkbox.
\
Pingback: How to Display “Yes” or “No” Instead of Checkbox while binding Boolean value with GridView « Dot Net
Pingback: 5 Very Useful Tips on ASP,NET GridView | http://dailydotnettips.com/2011/01/19/how-to-display-yes-or-no-instead-of-checkbox-while-binding-boolean-value-with-gridview/ | CC-MAIN-2014-15 | refinedweb | 264 | 65.32 |
Playing around with GenFu
Jürgen Gutsch - 27 January, 2016:
Setup the project
I created a new ASP.NET Core 1 web application (without the authentication stuff) and added
"GenFu": "1.0.4" to the dependencies in the project.json.; } }
Using GenFu.
Just type
A.Defaults or
GenFu.Defaults to get a list of constants to see what data are already included in GenFu.
public class WebAddressFiller : PropertyFiller<string> { public WebAddressFiller() : base( new[] { "object" }, new[] { "website", "web", "webaddress" }) { } public override object GetValue(object instance) { var domain = Domains.DomainName(); return $".{domain}"; } }. group:);
This is not really much code to automatically generate test data for your test or the dummy data of your mock-up. Just a bit of configuration which can be placed somewhere in a central place.
I think ...
... GenFu becomes my favorite library to create test and dummy data. I like the way GenFu generates well looking random dummy data. GenFu is really easy to use and to extend. | https://asp.net-hacker.rocks/2016/01/27/playing-around-with-GenFu.html | CC-MAIN-2021-49 | refinedweb | 159 | 50.43 |
On April 26, 2019 5:21:40 PM GMT+02:00, Christian Brauner <christian@brauner.io> wrote:>On Fri, Apr 26, 2019 at 10:23:37AM -0400, Joel Fernandes wrote:>> On Fri, Apr 26, 2019 at 12:24:04AM +0200, Christian Brauner wrote:>> > On Thu, Apr 25, 2019 at 03:00:09PM -0400, Joel Fernandes (Google)>wrote:>> > >.>> > >> > Thanks for the patch!>> > >> > Ok, let me be a little bit anal.>> > Please start the commit message with what this patch does and then>add>> >> The subject title is "Add polling support to pidfd", but ok I should>write a>> better commit message.>>Yeah, it's really just that we should really just have a simple>paragraph that expresses this makes the codebase do X.>>> >> > the justification why. You just say the "pidfd-poll" approach. You>can>> > probably assume that CLONE_PIDFD is available for this patch. So>> > something like:>> > >> > "This patch makes pidfds pollable. Specifically, it allows>listeners to>> > be informed when the process the pidfd referes to exits. This patch>only>> > introduces the ability to poll thread-group leaders since pidfds>> > currently can only reference those...">> > >> > Then justify the use-case and then go into implementation details.>> > That's usually how I would think about this:>> > - Change the codebase to do X>> > - Why do we need X>> > - Are there any technical details worth mentioning in the commit>message>> > (- Are there any controversial points that people stumbled upon but>that>> > have been settled sufficiently.)>> >> Generally the "how" in the patch should be in the code, but ok.>>That's why I said: technical details that are worth mentioning.>Sometimes you have controversial bits that are obviously to be>understood in the code but it still might be worth explaining why one>had to do it this way. Like say what we did for the pidfd_send_signal()>thing where we explained why O_PATH is disallowed.>>> >> I changed the first 3 paragraphs of the changelog to the following,>is that>> better? :>> >> Android low memory killer (LMK) needs to know when a process dies>once>> it is sent the kill signal. It does so by checking for the existence>of>> /proc/pid which is both racy and slow. For example, if a PID is>reused>> between when LMK sends a kill signal and checks for existence of the>> PID, since the wrong PID is now possibly checked for existence.>> >> This patch adds polling support to pidfd. Using the polling support,>LMK>> will be able to get notified when a process exists in race-free and>fast>> way, and allows the LMK to do other things (such as by polling on>other>> fds) while awaiting the process being killed to die.>> >> For notification to polling processes, we follow the same existing>> mechanism in the kernel used when the parent of the task group is to>be>> notified of a child's death (do_notify_parent). This is precisely>when>> the tasks waiting on a poll of pidfd are also awakened in this patch.>> >> > >.>> > >> > > >> > > It prevents a situation where a PID is reused between when LMK>sends a>> > > kill signal and checks for existence of the PID, since the wrong>PID is>> > > now possibly checked for existence.>> > > >> > > In this patch, we follow the same existing mechanism in the>kernel used>> > > when the parent of the task group is to be notified>(do_notify_parent).>> > > This is when the tasks waiting on a poll of pidfd are also>awakened.>> > > >> > > We have decided to include the waitqueue in struct pid for the>following>> > > reasons:>> > > 1. The wait queue has to survive for the lifetime of the poll.>Including>> > > it in task_struct would not be option in this case because the>task can>> > > be reaped and destroyed before the poll returns.>> > > >> > > 2. By including the struct pid for the waitqueue means that>during>> > > de_thread(), the new thread group leader automatically gets the>new>> > > waitqueue/pid even though its task_struct is different.>> > > >> > > Appropriate test cases are added in the second patch to provide>coverage>> > > of all the cases the patch is handling.>> > > >> > > Andy had a similar patch [1] in the past which was a good>reference>> > > however this patch tries to handle different situations properly>related>> > > to thread group existence, and how/where it notifies. And also>solves>> > > other bugs (waitqueue lifetime). Daniel had a similar patch [2]>> > > recently which this patch supercedes.>> > > >> > > [1]>> > > [2]>>> > > >> > > Cc: luto@amacapital.net>> > > Cc: rostedt@goodmis.org>> > > Cc: dancol@google.com>> > > Cc: sspatil@google.com>> > > Cc: christian@brauner.io>> > > Cc: jannh@google.com>> > > Cc: surenb@google.com>> > > Cc: timmurray@google.com>> > > Cc: Jonathan Kowalski <bl0pbl33p@gmail.com>>> > > Cc: torvalds@linux-foundation.org>> > > Cc: kernel-team@android.com>> > >> > These should all be in the form:>> > >> > Cc: Firstname Lastname <email@address.com>>> >> If this bothers you too much, I can also just remove the CC list from>the>> changelog here, and include it in my invocation of git-send-email>instead..>> but I have seen commits in the tree that don't follow this rule.>>Yeah, but they should. There are people with multiple emails over the>years and they might not necessarily contain their first and last>name. And I don't want to have to mailmap them or sm. Having their>names>in there just makes it easier. Also, every single other DCO-*related*>line follows:>>Random J Developer <random@developer.example.org>>>This should too. If others are sloppy and allow this, fine. No reason>we>should.>>> >> > >> > There are people missing from the Cc that really should be there...>> >> If you look at the CC list of the email, people in the>get_maintainer.pl>> script were also added. I did run get_maintainer.pl and checkpatch.>But ok, I>> will add the folks you are suggesting as well. Thanks.>>get_maintainer.pl is not the last word. >>> >> > Even though he usually doesn't respond that often, please Cc Al on>this.>> > If he responds it's usually rather important.>> >> No issues on that, but I am wondering if he should also be in>MAINTAINERS>> file somewhere such that get_maintainer.pl does pick him up. I added>him.>>It's often not about someone being a maintainer but whether or not they>have valuable input.>>"[...] This tag documents that potentially interested parties have been>included in the discussion.">>> >> > Oleg has reviewed your RFC patch quite substantially and given>valuable>> > feedback and has an opinion on this thing and is best acquainted>with>> > the exit code. So please add him to the Cc of the commit message in>the>> > appropriate form and also add him to the Cc of the thread.>> >> Done.>>Thanks!>>> >> > Probably also want linux-api for good measure since a lot of people>are>> > subscribed that would care about pollable pidfds. I'd also add Kees>> > since he had some interest in this work and David (Howells).>> >> Done, I added all of them and CC will go out to them next time.>Thanks.>>Cool. That really wasn't a "you've done this wrong". It's rather really>just to make sure that everyone who might catch a big f*ck up on our>part has had a chance to tell us so. :)>>> >> > >> > > Co-developed-by: Daniel Colascione <dancol@google.com>>> > >> > Every CDB needs to give a SOB as well.>> >> Ok, done. thanks.>>Fwiw, I only learned this recently too.>>> >> > >> > > Signed-off-by: Joel Fernandes (Google) <joel@joelfernandes.org>>> > > >> > > --->> > > >> > > RFC -> v1:>> > > * Based on CLONE_PIDFD patches:>> > > * Updated selftests.>> > > * Renamed poll wake function to do_notify_pidfd.>> > > * Removed depending on EXIT flags>> > > * Removed POLLERR flag since semantics are controversial and>> > > we don't have usecases for it right now (later we can add if>there's>> > > a need for it).>> > > >> > > include/linux/pid.h | 3 +++>> > > kernel/fork.c | 33 +++++++++++++++++++++++++++++++++>> > > kernel/pid.c | 2 ++>> > > kernel/signal.c | 14 ++++++++++++++>> > > 4 files changed, 52 insertions(+)>> > > >> > > diff --git a/include/linux/pid.h b/include/linux/pid.h>> > > index 3c8ef5a199ca..1484db6ca8d1 100644>> > > --- a/include/linux/pid.h>> > > +++ b/include/linux/pid.h>> > > @@ -3,6 +3,7 @@>> > > #define _LINUX_PID_H>> > > >> > > #include <linux/rculist.h>>> > > +#include <linux/wait.h>>> > > >> > > enum pid_type>> > > {>> > > @@ -60,6 +61,8 @@ struct pid>> > > unsigned int level;>> > > /* lists of tasks that use this pid */>> > > struct hlist_head tasks[PIDTYPE_MAX];>> > > + /* wait queue for pidfd notifications */>> > > + wait_queue_head_t wait_pidfd;>> > > struct rcu_head rcu;>> > > struct upid numbers[1];>> > > };>> > > diff --git a/kernel/fork.c b/kernel/fork.c>> > > index 5525837ed80e..fb3b614f6456 100644>> > > --- a/kernel/fork.c>> > > +++ b/kernel/fork.c>> > > @@ -1685,8 +1685,41 @@ static void pidfd_show_fdinfo(struct>seq_file *m, struct file *f)>> > > }>> > > #endif>> > > >> > > +static unsigned int pidfd_poll(struct file *file, struct>poll_table_struct *pts)>> > > +{>> > > + struct task_struct *task;>> > > + struct pid *pid;>> > > + int poll_flags = 0;>> > > +>> > > + /*>> > > + *);>> > > + pid = file->private_data;>> > > + task = pid_task(pid, PIDTYPE_PID);>> > > + WARN_ON_ONCE(task && !thread_group_leader(task));>> > > +>> > > + if (!task || (task->exit_state && thread_group_empty(task)))>> > > + poll_flags = POLLIN | POLLRDNORM;>> > >> > So we block until the thread-group is empty? Hm, the thread-group>leader>> > remains in zombie state until all threads are gone. Should probably>just>> > be a short comment somewhere that callers are only informed about a>> > whole thread-group exit and not about when the thread-group leader>has>> > actually exited.>> >> Ok, I'll add a comment.>> >> > I would like the ability to extend this interface in the future to>allow>> > for actually reading data from the pidfd on EPOLLIN.>> > POSIX specifies that POLLIN and POLLRDNORM are set even if the>> > message to be read is zero. So one cheap way of doing this would>> > probably be to do a 0 read/ioctl. That wouldn't hurt your very>limited>> > usecase and people could test whether the read returned non-0 data>and>> > if so they know this interface got extended. If we never extend it>here>> > it won't matter.>> >> I am a bit confused. What specific changes to this patch are you>proposing?>> This patch makes poll block until the process exits. In the future,>we can>> make it unblock for a other reasons as well, that's fine with me. I>don't see>> how this patch prevents such extensions.>>I guess I should've asked the following:>What happens right now, when you get EPOLLIN on the pidfd and you and>out of ignorance you do:>>read(pidfd, ...)I guess it returns EINVAL which is fine.So you can ignore that comment.>>> >> > > + if (!poll_flags)>> > > + poll_wait(file, &pid->wait_pidfd, pts);>> > > +>> > > + read_unlock(&tasklist_lock);>> > > +>> > > + return poll_flags;>> > > +}>> > >> > >> > > +>> > > +>> > > const struct file_operations pidfd_fops = {>> > > .release = pidfd_release,>> > > + .poll = pidfd_poll,>> > > #ifdef CONFIG_PROC_FS>> > > .show_fdinfo = pidfd_show_fdinfo,>> > > #endif>> > > diff --git a/kernel/pid.c b/kernel/pid.c>> > > index 20881598bdfa..5c90c239242f 100644>> > > --- a/kernel/pid.c>> > > +++ b/kernel/pid.c>> > > @@ -214,6 +214,8 @@ struct pid *alloc_pid(struct pid_namespace>*ns)>> > > for (type = 0; type < PIDTYPE_MAX; ++type)>> > > INIT_HLIST_HEAD(&pid->tasks[type]);>> > > >> > > + init_waitqueue_head(&pid->wait_pidfd);>> > > +>> > > upid = pid->numbers + ns->level;>> > > spin_lock_irq(&pidmap_lock);>> > > if (!(ns->pid_allocated & PIDNS_ADDING))>> > > diff --git a/kernel/signal.c b/kernel/signal.c>> > > index 1581140f2d99..16e7718316e5 100644>> > > --- a/kernel/signal.c>> > > +++ b/kernel/signal.c>> > > @@ -1800,6 +1800,17 @@ int send_sigqueue(struct sigqueue *q,>struct pid *pid, enum pid_type type)>> > > return ret;>> > > }>> > > >> > > +static void do_notify_pidfd(struct task_struct *task)>> > >> > Maybe a short command that this helper can only be called when we>know>> > that task is a thread-group leader wouldn't hurt so there's no>confusion>> > later.>> >> Ok, will do.>> >> thanks,>> >> - Joel>> | https://lkml.org/lkml/2019/4/26/692 | CC-MAIN-2019-47 | refinedweb | 1,846 | 67.35 |
Set or get flags affecting operation on a visual
Name
ggiSetFlags, ggiGetFlags, ggiAddFlags, ggiRemoveFlags : Set or get flags affecting operation on a visual
Synopsis
#include <ggi/ggi.h> int ggiSetFlags(ggi_visual_t vis, uint32_t flags); uint32_t))
Description
ggiSetFlags sets the specified flags (bitwise OR'd together) on a visual..
It is recommended to set the flags before setting a mode, i.e. right after ggiOpen(3).
Return Value
ggiSetFlags, ggiAddFlags, and ggiRemoveFlags returns the current flags. This can be used by the curious to check whether a flag is being silently ignored as per above.
Synchronous and Asynchronous drawing modes
Some */
Tidy buffer mode
Some.. | http://www.ggi-project.org/documentation/libggi/current/ggiSetFlags.3.html | crawl-001 | refinedweb | 104 | 57.27 |
matching component of this project. In the next post, we'll show how to use the Channel API to deliver results to the client, a web interface administrators can use to view the data. Since even a straightforward implementation of a tool like this will be fairly complex, we'll be leaving out any features that don't contribute to demonstrating the Prospective Search and Channel APIs - but I'll always note as much when doing so.
The core of the Prospective Search API is a set of 3 functions: subscribe, which establishes a persistent subscription, unsubscribe, which removes a subscription, and match, which takes a document and matches it against all the searches registered for it. There's a few key concepts central to these functions, which it helps to understand before getting started:
- A document class is a type of document. Documents in a class share a set of properties and value types in common. The Prospective Search API uses Datastore model classes as document classes, so every document is an instance of a db.Model subclass. It's important to note here that just because documents are datastore model instances, this doesn't mean that they'll be stored in the datastore - it's just a convenient way to represent and encode documents. Prospective Search supports a limited subset of value types for documents, listed here.
- A topic defines a unique name for a set of alike documents. This is set to the name of the document class by default, so you usually won't have to worry about this. Searches are always specific to a topic - queries against one topic won't be matched by a document posted with a different topic.
- A subscription ID uniquely identifies a subscription. Subscription IDs are user-specified - they can be anything you want that uniquely identifies the subscription.
Defining our document
The first thing we need to do is define a document class that will encapsulate our request records for the Prospective Search API. This is simply done with a model definition like so:
class RequestRecord(db.Model): """Encapsulates information for a request log record.""" method = db.StringProperty(required=True) path = db.StringProperty(required=True) request_headers = db.StringListProperty(required=True) status_code = db.IntegerProperty(required=True) status_text = db.StringProperty(required=True) response_headers = db.StringListProperty(required=True) wall_time = db.IntegerProperty(required=True) cpu_time = db.IntegerProperty(required=True) random = db.FloatProperty(required=True)
Our model will capture most of the important properties of a request and our response to it: The method (eg, GET, POST, etc), the path (eg, '/foo/bar'), all the request headers sent by the client, the status code and message we returned, all the response headers we returned, and the wallclock and CPU time taken. We also include an additional property, random, which will be set to a random number between 0 and 1 - we'll cover exactly why this is useful later.
Here's a place where a real production system would probably do more: It would be useful to record debug logs here in some form, as well as integrating with appstats if it's present so admins can easily find the appstats page for a given request.
Since we'll eventually be sending request records to browsers, let's define a simple method to convert it to a dict suitable for JSON encoding:
def to_json(self): """Returns a dict containing the relevant information from this record. Note that the return value is not a JSON string, but rather a dict that can be passed to a JSON library for encoding.""" return dict((k, v.__get__(self, self.__class__)) for k, v in self.properties().iteritems())
Recording requests
The next step in writing Clio is recording the relevant information about each request in a RequestRecord instance and passing it to the matcher API. For this, we'll use WSGI middleware. Since working with the WSGI environment directly is a bit awkward, we'll use webob's Request and Response objects to make them easier to deal with. Here's how we do it:
class LoggingMiddleware(object): def __init__(self, application): self.application = application def __call__(self, environ, start_response): # Don't record if the request is to clio itself, or the config says no. if (environ['PATH_INFO'] == config.QUEUE_URL or environ['PATH_INFO'].startswith(config.BASE_URL) or not config.should_record(environ)): return self.application(environ, start_response) request = webob.Request(environ) start_time = time.time() response = request.get_response(self.application) elapsed = int((time.time() - start_time) * 1000) status_code, status_text = response.status.split(' ', 1)
Notice that the first thing our middleware does is check if the current request is Clio itself, and skip doing anything if it is. This is important, or you can easily end up with a series loop of tasks reporting on each other ad infinitum! Next, we construct a Webob request object from the environment, and use its get_response method to call the original WSGI app. We use a simple timer to keep track of how long all this took. Next, we construct a RequestRecord out of all the data we've collected and pass it to the Prospective Search API:
record = model.RequestRecord( method=request.method, path=request.path_qs, request_headers=_stringifyHeaders(request.headers), status_code=int(status_code), status_text=status_text, response_headers=_stringifyHeaders(response.headers), wall_time=elapsed, cpu_time=quota.get_request_cpu_usage(), random=random.random()) prospective_search.match( record, result_relative_url=config.QUEUE_URL, result_task_queue=config.QUEUE_NAME)
As we observed above, just because our document class is a db.Model subclass doesn't mean we have to store it in the datastore, and we don't - we just pass it to the Prospective Search API. The Prospective Search API doesn't return a list of matching searches directly - instead, it adds tasks to the task queue, so we provide it with two additional parameters: the URL of the task handler we want it to call, and the name of the queue to put tasks in.
Finally, we return the response from our middleware. Webob makes this easy by allowing us to call the Response object as a WSGI app itself:
return response(environ, start_response)
Using our middleware in a webapp follows the standard pattern established by libraries like appstats, by specifying it in appengine_config.py, like this:
def webapp_add_wsgi_middleware(app): from clio import middleware return middleware.LoggingMiddleware(app)
Registering queries
The next part of the puzzle is how we register queries against the API. This is pretty straightforward, but we'll need a way to keep track of the mapping between subscriptions and clients. We'll do this with a Subscription model:
class Subscription(db.Model): """Provides information on a client subscription to a filtered log feed.""" client_id = db.StringProperty(required=True) created = db.DateTimeProperty(required=True, auto_now=True)
The only important piece of data we track here is the client ID, which is used by the channel API to uniquely identify a connected client. We can't use this directly as the subscription key, because a client may subscribe to multiple feeds, so instead we'll use the key of the Subscription model for that. A more robust implementation would separate the user from their client ID here, since we know channels expire, but a user may want to persist a subscription longer than that, but since it's not relevant to our demonstration of the Prospective Search API, we'll leave it as an exercise for the reader.
Here's the handler that creates new subscriptions:
class SubscribeHandler(webapp.RequestHandler): """Handle subscription requests from clients.""" def post(self): sub = model.Subscription( client_id=self.request.POST['client_id']) sub.put() prospective_search.subscribe( model.RequestRecord, self.request.POST['query'], str(sub.key()), lease_duration_sec=config.SUBSCRIPTION_TIMEOUT.seconds) self.response.out.write(str(sub.key()))
Our handler is passed a client ID and a search term by the client. It then constructs a new subscription record with the client ID, stores it to the datastore, and uses the newly created entity's key as the subscription ID. The prospective_search.subscribe method takes, in order, the document class we want to listen for matches on, the query - specified in a simple textual query language documented here - the subscription ID, and how long to subscribe for. Omitting this last argument will create a subscription that lasts until cancelled, but since we know our channels have a limited lifetime, we may as well specify that here.
Finally, we return the key of the Subscription object to the client, so it can use it to uniquely identify this subscription.
Handling results
The final step in the chain is handling results returned by the Prospective Search API. As I mentioned previously, results aren't returned by the match call, but are instead inserted onto the task queue. Since there may be many subscriptions matching a given document, the API will enqueue a single task with a number of matching subscriptions; it supplies the matching document along with a list of subscription IDs that matched it. Here's how we extract this data:
class MatchHandler(webapp.RequestHandler): """Process matching log entries and send them to clients.""" def post(self): # Fetch the log record record = prospective_search.get_document(self.request) record_data = record.to_json() # Fetch the set of subscribers to send this record to subscriber_keys = map(db.Key, self.request.get_all('id')) subscribers = db.get(subscriber_keys)
First off, we get the matched document. The Prospective Search API provides a method, get_document to extract this from the request object for us. Since we're going to be sending it to clients, we use the method we defined previously to conver it to a JSON-encodable dict. The list of subscription keys are supplied as POST parameters with the id 'id'. Since our subscription IDs are datastore keys, we construct key objects out of them and retrieve the relevant subscriptions, so we know the client IDs to send the results to. Finally, we can iterate over the returned subscription entities, sending the message to each:
for subscriber_key, subscriber in zip(subscriber_keys, subscribers): # If the subscription has been deleted from the datastore, delete it # from the matcher API. if not subscriber: logging.error("Subscription %s deleted!", subscriber_key) prospective_search.unsubscribe(model.RequestRecord, subscriber.key()) else: data = simplejson.dumps({ 'subscription_key': str(subscriber_key), 'data': record_data, }) channel.send_message(subscriber.client_id, data)
This should be fairly self-explanatory. One subtlety we haven't taken care of here is that it's possible one document could match multiple subscriptions held by the same client; a more producitonized implementation would coalesce these into a single message, rather than sending the same document multiple times over the same channel.
Conclusion
That's it for today. You've learned how to use the Prospective Search API to register persistent queries against a document stream; how to feed documents into that stream, and how to deal with the matches that result. In the next post, we'll demonstrate using the Channel API to send these results back to users in real-time, completing our system.
The entire demo app is available online, here, along with a simple demo app so you can test it out.
Got interesting ideas for what to do with the Prospective Search API? Let us know in the comments!Previous Post Next Post | http://blog.notdot.net/2011/06/Using-the-Prospective-Search-API-on-App-Engine-for-instant-traffic-analysis | CC-MAIN-2019-09 | refinedweb | 1,857 | 55.34 |
Hi ALL,
We often use FileSource or FileSink during UT or debug, don't we? But they become unnecessary codes on production environment.
In C/C++ application, we can use #ifdef _DEBUG and #endif to distinguish appropriate codes associated with the target environment.
In SPL codes, can we use similar technique?
If there is a nice idea, could you help me?
Thanks & Regards,
Topic
This topic has been locked.
1 reply Latest Post - 2013-02-05T15:18:09Z by hnasgaard
ACCEPTED ANSWER
Answered question
This question has been answered.
Unanswered question
This question has not been answered yet.
Pinned topic Can I use the technique like "#ifdef _DEBUG" & "#endif" on SPL source code?
2013-02-05T14:43:15Z |
| https://www.ibm.com/developerworks/community/forums/html/topic?id=77777777-0000-0000-0000-000014937255 | CC-MAIN-2015-11 | refinedweb | 118 | 67.76 |
: search
wp query – How to search by a post and a category name on wordpress at the same time?
I?
How to add static pages in the Magento 2 search result?
I’m using a Magento 2.4 and in my project I have many static pages that I would like to be part of my search results.
How could I add Magento 2 static pages in my search results?
Search results in differents Languages
Hi!,
I have a site that has 3 languages (English, Portuguese and Spanish). When doing a search in for example in Spanish, in addition to the results of my website in that language, my website is also shown in English. How can I solve that?
optimization – Given consumer grade hardware,what is a reasonable upper bound for size of search space?
There’s a gacha RPG I’m trying to get better at.
I estimate there are about 10^15 states for the 3 opening rounds of a match for which I am trying to evaluate damage output.
The equations themselves aren’t complicated: mostly linear ones, with the odd division and factorial with small integers (less then n=10) thrown in.
I’m trying to differentiate between “easy”, “tough but doable if you know what you’re doing” and “don’t even think about it”.
I suspect I’ll have to simplify the problem further, but is there a way to know at which point brute force becomes unreasonable before committing to code? I only have access to consumer grade hardware (and google colab).
google sheets – Search through multiple tabs and pull results
Test Sheet for my use case:
I’ve had some input from another user on the site helping me search through one tab of data in my sheet and pull results. Now I’m wondering if its possible to do that but also look through multiple tabs.
In the “Partial Answer” tab, it shows how it would work with a single tab (‘Car Parts’) but it broke when U transferred it over to this new sheet. Besides the point, I would like the “Search Tab” tab be able to look for a keyword in ‘A2’ and return results in ‘B2:B’ from all my tabs (Hoods, Bumpers, and Doors) as well as link to the row the data was pulled from in the query in B2:
=iferror(query('Car Parts'!A2:A,"select A where upper(A) contains '"&UPPER(A2)&"' ",0), "not found")
python – How to make this DFS based exhaustive word grid search faster
I have implemented an exhaustive dfs based grid search that searches for all possible words in the 8 connected regions. Is there any way I can make this faster or memory efficient than it is now?
I feel like passing a copy of the
seen set in
dfs(xx, yy, seen.copy(), word + grid(x)(y)) is an overhead that can possibly be avoided.
Or is my algorithm completely wrong and I should use something else?
This is not a code site challenge, I am just trying to implement this out of curiosity.
My first question on code review so let me know if there is something that I can add to make this better.
Also can this be made more “pythonic”?
def possible_directions(x, y): """ Returns at most 8 connected co-ordinates for given `x` and `y` """ for xx in range(-1, 2): for yy in range(-1, 2): if not xx and not yy: continue if 0 <= x + xx < len(grid) and 0 <= y + yy < len(grid(x)): yield x + xx, y + yy def dfs(x, y, seen, word = ''): """ Recursive Generator that performs a dfs on the word grid seen = set of seen co-ordinates, set of tuples word = word to yield at each recursive call """ if (x, y) in seen: return yield word + grid(x)(y) seen.add((x, y)) for xx, yy in possible_directions(x, y): yield from dfs(xx, yy, seen.copy(), word + grid(x)(y)) grid = (('c', 'f', 'u', 'c'), ('e', 'a', 't', 'e'), ('b', 'h', 'p', 'y'), ('o', 'n', 'e', 'p')) # word grid, can be any size, n x n for x in range(len(grid)): for y in range(len(grid(x))): for i in dfs(x, y, set()): print(i)
Best practice for comma separated input size for the search field
So to reiterate:
- Users have .csvs or other files where large numbers of IMEis are listed
- They need to be able to search for these IMEIs in your system
Ideally you’d have access to analytics or user interviews that could help you define the upper limit users search. It sounds like you don’t have access to either, so in the meantime we can make a few assumptions.
As you said, it seems the most likely scenario is that they’ll be copying and pasting these numbers, as they are difficult to correctly input due to their length. They likely won’t be checking their work, again due to length, so displaying the pasted content is mostly irrelevant – you can display “1234567890abcde, 1234567890abcde, and 498 more“, which should give them enough information about their search to complete their task.
The main bottleneck will likely be your backend system, not the UI. If you paste 500 IMEIs, how fast does the system respond? If it slows at any point and effects the UX, you’ve found your limit. If it responds adequately for 10,000 IMEIs, there’s little reason to limit it at all.
java – How to write springboot job to listen for a result of a search page which is PHP
Sorry guys if it is trivial, but I have no idea how to write a spring boot job that searches in a PHP web page.
So there is a PHP web page, where you can find some search field and a button which will give you the results based on the search fields.
I have always the main URL, like
Under F12 (with a browser) I can see the following:
Request URL: Request Method: POST Content-Type: application/x-www-form-urlencoded
and some Form Data which holds the search filters:
some_search(search_type)(living_search_type): somedummydata
And of course a lot of other data which maybe not necessary.
I know how to write REST API applications, but I have no idea how I could write some scheduled-code to listen to the results of a PHP search site.
So is it possible somehow?
How to delete Google Chrome Omnibox Search History / Omnibox Suggestions
Whenever I type a non-address-text into Googles Search Bar, it seems to save it and present it to me in the future (the entries with the clock icon).
My “web & app activity” is set to “off” and there is no “activity history” to delete, yet the suggestions still are there and every term I search for gets added.
How do I prevent Chrome from saving these, for good? | https://proxies-free.com/tag/search/ | CC-MAIN-2021-04 | refinedweb | 1,159 | 73.31 |
Saving clipboard image to specific file
Hey I feel like this should be really simple, I just want a small script that runs from the share sheet that takes an image and saves it to a specific file. My issue is I can’t seem to get the path part to work. how can I get a specific files path?
Maybe provide the code that you have so far? An appex script that finds an image on the clipboard and attempts to do an Image.save() on it.
By "writing to a specific file", did you mean that you have hardcoded a filename that you want to write to?
Are you trying to write to a specific path in your "This iPad" folder? Or somewhere else?
Or by "specific file", do you mean you are trying to edit the file that was provided to you on the sharesheet, and save modifications to that image back to the original?
In the later case, generally you cannot edit the original files that are shared to you. There are ways to save images back to your photo albums, but you have to use the photos module instead of "writing to a file".
So, can you clarify your desire -- write to a local file (only accessible to pythonista, or possibly iCloud external folder)? Or write back to photos so you can see the modified file by other apps?
Hey thanks for the replies, I would share my code but it’s super basic, just gets the clipboard pil image and then saves it to a location using a path. So I would like to understand how to save it to different locations. Ideally as a starting point somewhere in my iCloud but somewhere on the my iPad part of pythonista would be fine, I just don’t know how to set up a functioning path to any of these places.
Also in my original post I said save to file I actually meant folder, oops
@jackattack said:
how to set up a functioning path to any of these places.
See Folder Picker and try to use it in your script
import sys,os print(os.path.abspath('.'))
That's your current path. You can usually use relative paths to the main script that you ran -- e.g
open('test.jpg')will open the file in the same folder as your script.
In some cases, if you have a module in site-packages, a way to get back to the main script in pythonista is
import sys,os print(os.path.abspath(sys.path[0]))
due to the way that pythonista adds the script that you pressed the play button on to the top of the sys.path.
If you run that little script from a script located in folder inside iCloud folder, it will print out the absolute path, and you can use that in your scripts to write to iCloud. Note, you usually cannot write directly to the iCloud folder itself, you need a subfolder. | https://forum.omz-software.com/topic/7150/saving-clipboard-image-to-specific-file/1 | CC-MAIN-2021-49 | refinedweb | 502 | 78.08 |
Joost, On 03/01/2013 09:51 AM, Joost Yervante Damad wrote: > Package name: python-v8 > Version: 1.0-preview-r446 > Upstream Author: Xiaohai Lu <flier.lu@gmail.com> > URL: > License: APL2.0 > Description: python interface for the v8 javascript engine I took a quick look. Using the plain setup.py distutils based build script, a build automatically checks out v8 and gpy (via svn). Both of these are packaged for Debian already. From a manageability and security standpoint, it's not feasible for python-v8 to "include" v8 (or gpy), but it should rely on libv8 as provided by Debian. That, however, doesn't seem feasible because pyv8 interfaces with v8::internal, a namespace that's not (or not completely) exposed by libv8 - for good reasons, as its name suggests. Thus, I'd currently argue that the upstream package isn't up to Debian standards. I considered, but decided against (trying to) package this piece of software. However, I'm a) not a DD and b) maybe others find a way to make libv8 work with python-v8. Regards Markus Wanner | https://lists.debian.org/debian-devel/2013/03/msg00054.html | CC-MAIN-2018-05 | refinedweb | 182 | 67.35 |
I have a FC4 machine of i386 architecture.
when i am trying to run any simple program like
This code compiles well.This code compiles well.Code:#include<iostream> using namespace std; int main() { cout<<"Hello World"; return 0; }
it gives me error saying required libstdc++.so.5 not found/exist. I have just now installed libstdc++4.0.2.fc4.rpm but it still persists. I think it is some runtime library linking issue.
Ihad also run /sbin/ldconfig.
A few days back it was working perfectly. After that to have some space i uninstalle some applications, one of them was ecclipse. Only in ecclipse i removed c++ development environment. Do this have sth to do with such behaviour.How i can restore it back.
i am looking for help in this regard. | http://cboard.cprogramming.com/tech-board/82656-libstdcplusplus-so-5-not-found.html | CC-MAIN-2014-35 | refinedweb | 134 | 71.92 |
Posted 28 Mar
Link to this post
Posted 02 Apr
Link to this post
Posted 02 Apr
in reply to
Martin Ivanov
Link to this post
Thank you. My experimentation showed that your guess was correct. It did not help performance by any measurable amount.
However One oddity I noticed in trying to evaluate performance was in the binding of the SurfaceSeries3D::ItemsSource property.
My viewmodel exposes this property as IEnumerable<Pixel3d> (where "Pixel3d" is my struct holding the data). I implement this property with a manual enumerator function. However Telerik seems to require me to supply an actual List<Pixel3d> even though the property type of ItemsSource is IEnumerable
public IEnumerable<
Pixel3d
> GetPoints()
{
for (int x = 0; x <
_maxX
; x++)
for (int
y
=
0
; y < _maxY; y++ )
yield return new Pixel3d(x, y, GetData(x, y));
}
public IEnumerable<Pixel3d> Points => GetPoints().ToList(); // MUST HAVE ToList() here
If I remove the call to "ToList()", then the chart will never show any points.
Why am I required to convert the IEnumerable to a List? Shouldn't the chart be enumerating the points itself? If it requires an actual list, why is the property "ItemsSource" of type IEnumerable?
Or am I doing something else wrong?
Posted 04 Apr
Link to this post
Posted 04 Apr
in reply to
Martin Ivanov
Link to this post
Hi Martin,
I took your example and you are right. No problems. So I started trying to gradually make your example like mine and I found the problem. It's certainly not Telerik (no surprise) but as you took the time for me, I feel I at least owe you the explanation. It is an incredibly sneaky WPF problem that yields no warnings, not even binding warning messages in the output window.
In short, my binding used a converter for the pixels. My app has to show them in either metric or imperial so my converter takes a list of pixels, converts them appropriately and returns them. Here is a completely gutted, skeleton, do-nothing implementation of what my converter looks like:
namespace WpfApp40
[ValueConversion(typeof(List<
>), typeof(List<
>))]
[MarkupExtensionReturnType(typeof(PixelUnitConverter))]
public class PixelUnitConverter
: IValueConverter
public object Convert (object v, Type t, object p, CultureInfo c) => v;
public object ConvertBack(object v, Type t, object p, CultureInfo c) => Binding.DoNothing;
Note the [ValueConversion] markup extension up top. It states that the converter takes and returns List<Pixel3d>. Not an IEnumerable<Pixel3d>. (I wrote this a long time ago when I was using List for everything.)
And of course, my binding was like this:
<
telerik:SurfaceSeries3D
ItemsSource
=
"{Binding Points, Converter={StaticResource PixelConverter}}"
x:Name
"series"
>
If you change your example to do that (as I did) and it will no longer work. Not Telerik's fault of course. Mine.
Of course it all works fine when the item you supply actually is a list. Even if the item you supply is a list but you return it as IEnumerable<Pixel3d>, it still works.
But when the Property you are binding to actually uses yield return what is returned is no longer a list at all, it is an enumerator only that traverses a list. So it stops working. Apparently WPF examines enumerator and realizes it doesn't jibe with the [ValueConversion] markup tag and just makes it all fail silently. It didn't even give me a WPF binding warning.
All I had to do whas change the ValueConversion tag to take and return IEnumerable<Pixel3d> and everything started working again.
Anyway I am all set. Thank you for your time.
Posted 05 Apr
Link to this post | https://www.telerik.com/forums/cartesianchart3d-must-bind-to-reference-type-is-there-an-alternative | CC-MAIN-2019-51 | refinedweb | 600 | 63.29 |
Sequence Models and Long-Short Term Memory Networks¶
At this point, we have seen various feed-forward networks. That is, there is no state maintained by the network at all. This might not be the behavior we want. Sequence models are central to NLP: they are models where there is some sort of dependence through time between your inputs. The classical example of a sequence model is the Hidden Markov Model for part-of-speech tagging. Another example is the conditional random field.
A recurrent neural network is a network that maintains some kind of state. For example, its output could be used as part of the next input, so that information can propogate along as the network passes over the sequence. In the case of an LSTM, for each element in the sequence, there is a corresponding hidden state \(h_t\), which in principle can contain information from arbitrary points earlier in the sequence. We can use the hidden state to predict words in a language model, part-of-speech tags, and a myriad of other things.
LSTM’s in Pytorch¶
Before getting to the example, note a few things.. We haven’t discussed mini-batching, so lets just ignore that and assume we will always have just 1 dimension on the second axis. If we want to run the sequence model over the sentence “The cow jumped”, our input should look like
Except remember there is an additional 2nd dimension with size 1.
In addition, you could go through the sequence one at a time, in which case the 1st axis will have size 1 also.
Let’s see a quick example.
# Author: Robert Guthrie import torch import torch.nn as nn import torch.nn.functional as F import torch.optim as optim torch.manual_seed(1)
lstm = nn.LSTM(3, 3) # Input dim is 3, output dim is 3 inputs = [torch.randn(1, 3) for _ in range(5)] # make a sequence of length 5 # initialize the hidden state. hidden = (torch.randn(1, 1, 3), torch.randn(1, 1, 3)) for i in inputs: # Step through the sequence one element at a time. # after each step, hidden contains the hidden state. out, hidden = lstm(i.view(1, 1, -1), hidden) # alternatively, we can do the entire sequence all at once. # the first value returned by LSTM is all of the hidden states throughout # the sequence. the second is just the most recent hidden state # (compare the last slice of "out" with "hidden" below, they are the same) # The reason for this is that: # "out" will give you access to all hidden states in the sequence # "hidden" will allow you to continue the sequence and backpropagate, # by passing it as an argument to the lstm at a later time # Add the extra 2nd dimension inputs = torch.cat(inputs).view(len(inputs), 1, -1) hidden = (torch.randn(1, 1, 3), torch.randn(1, 1, 3)) # clean out hidden state out, hidden = lstm(inputs, hidden) print(out) print(hidden)
Out:
tensor([[[-0.0187, 0.1713, -0.2944]], [[-0.3521, 0.1026, -0.2971]], [[-0.3191, 0.0781, -0.1957]], [[-0.1634, 0.0941, -0.1637]], [[-0.3368, 0.0959, -0.0538]]], grad_fn=<StackBackward>) (tensor([[[-0.3368, 0.0959, -0.0538]]], grad_fn=<StackBackward>), tensor([[[-0.9825, 0.4715, -0.0633]]], grad_fn=<StackBackward>)).
The model is as follows: let our input sentence be \(w_1, \dots, w_M\), where \(w_i \in V\), our vocab. Also, let \(T\) be our tag set, and \(y_i\) the tag of word \(w_i\). Denote our prediction of the tag of word \(w_i\) by \(\hat{y}_i\).
This is a structure prediction, model, where our output is a sequence \(\hat{y}_1, \dots, \hat{y}_M\), where \(\hat{y}_i \in T\).
To do the prediction, pass an LSTM over the sentence. Denote the hidden state at timestep \(i\) as \(h_i\). Also, assign each tag a unique index (like how we had word_to_ix in the word embeddings section). Then our prediction rule for \(\hat{y}_i\) is
That is, take the log softmax of the affine map of the hidden state, and the predicted tag is the tag that has the maximum value in this vector. Note this implies immediately that the dimensionality of the target space of \(A\) is \(|T|\).
Prepare data:
def prepare_sequence(seq, to_ix): idxs = [to_ix[w] for w in seq] return torch.tensor(idxs, dtype=torch.long) training_data = [ ("The dog ate the apple".split(), ["DET", "NN", "V", "DET", "NN"]), ("Everybody read that book".split(), ["NN", "V", "DET", "NN"]) ] word_to_ix = {} for sent, tags in training_data: for word in sent: if word not in word_to_ix: word_to_ix[word] = len(word_to_ix) print(word_to_ix) tag_to_ix = {"DET": 0, "NN": 1, "V": 2} # These will usually be more like 32 or 64 dimensional. # We will keep them small, so we can see how the weights change as we train. EMBEDDING_DIM = 6 HIDDEN_DIM = 6
Out:
{'The': 0, 'dog': 1, 'ate': 2, 'the': 3, 'apple': 4, 'Everybody': 5, 'read': 6, 'that': 7, 'book': 8}
Create the model:
class LSTMTagger(nn.Module): def __init__(self, embedding_dim, hidden_dim, vocab_size, tagset_size): super(LSTMTagger, self).__init__() self.hidden_dim = hidden_dim self.word_embeddings = nn.Embedding(vocab_size, embedding_dim) # The LSTM takes word embeddings as inputs, and outputs hidden states # with dimensionality hidden_dim. self.lstm = nn.LSTM(embedding_dim, hidden_dim) # The linear layer that maps from hidden state space to tag space self.hidden2tag = nn.Linear(hidden_dim, tagset_size) def forward(self, sentence): embeds = self.word_embeddings(sentence) lstm_out, _ = self.lstm(embeds.view(len(sentence), 1, -1)) tag_space = self.hidden2tag(lstm_out.view(len(sentence), -1)) tag_scores = F.log_softmax(tag_space, dim=1) return tag_scores
Train the model:
model = LSTMTagger(EMBEDDING_DIM, HIDDEN_DIM, len(word_to_ix), len(tag_to_ix)) loss_function = nn.NLLLoss() optimizer = optim.SGD(model.parameters(), lr=0.1) # See what the scores are before training # Note that element i,j of the output is the score for tag j for word i. # Here we don't need to train, so the code is wrapped in torch.no_grad() with torch.no_grad(): inputs = prepare_sequence(training_data[0][0], word_to_ix) tag_scores = model(inputs) print(tag_scores) = prepare_sequence(tags, tag_to_ix) # Step 3. Run our forward pass. tag_scores = model(sentence_in) # Step 4. Compute the loss, gradients, and update the parameters by # calling optimizer.step() loss = loss_function(tag_scores, targets) loss.backward() optimizer.step() # See what the scores are after training with torch.no_grad(): inputs = prepare_sequence(training_data[0][0], word_to_ix) tag_scores = model(inputs) # The sentence is "the dog ate the apple". i,j corresponds to score for tag j # for word i. The predicted tag is the maximum scoring tag. # Here, we can see the predicted sequence below is 0 1 2 0 1 # since 0 is index of the maximum value of row 1, # 1 is the index of maximum value of row 2, etc. # Which is DET NOUN VERB DET NOUN, the correct sequence! print(tag_scores)
Out:
tensor([[-1.1389, -1.2024, -0.9693], [-1.1065, -1.2200, -0.9834], [-1.1286, -1.2093, -0.9726], [-1.1190, -1.1960, -0.9916], [-1.0137, -1.2642, -1.0366]]) tensor([[-0.0462, -4.0106, -3.6096], [-4.8205, -0.0286, -3.9045], [-3.7876, -4.1355, -0.0394], [-0.0185, -4.7874, -4.6013], [-5.7881, -0.0186, -4.1778]])
Exercise: Augmenting the LSTM part-of-speech tagger with character-level features¶
In the example above, each word had an embedding, which served as the inputs to our sequence model. Let’s augment the word embeddings with a representation derived from the characters of the word. We expect that this should help significantly, since character-level information like affixes have a large bearing on part-of-speech. For example, words with the affix -ly are almost always tagged as adverbs in English.
To do this, let \(c_w\) be the character-level representation of word \(w\). Let \(x_w\) be the word embedding as before. Then the input to our sequence model is the concatenation of \(x_w\) and \(c_w\). So if \(x_w\) has dimension 5, and \(c_w\) dimension 3, then our LSTM should accept an input of dimension 8.
To get the character level representation, do an LSTM over the characters of a word, and let \(c_w\) be the final hidden state of this LSTM. Hints:
- There are going to be two LSTM’s in your new model. The original one that outputs POS tag scores, and the new one that outputs a character-level representation of each word.
- To do a sequence model over characters, you will have to embed characters. The character embeddings will be the input to the character LSTM.
Total running time of the script: ( 0 minutes 1.054 seconds)
Gallery generated by Sphinx-Gallery | https://pytorch.org/tutorials/beginner/nlp/sequence_models_tutorial.html | CC-MAIN-2019-43 | refinedweb | 1,429 | 65.83 |
Hi everyone, I decided to share my solution as an exercise… so I could briefly present how I put it down and also have some useful feedback possibly.
My idea was to inherit from the Room class to define a child ExpireRoom(Room) class where to implement some additional features requested like guessing a code within a certain number of attempts as in escape_pod and laser_weapon_armory.
I know inheritance isn’t the best and that composition should be preferred but I wanted to keep the app.py file as it was, as much as possible because I reckoned there was no way to improve its readability and it was already pretty straightforward and compact. Inheritance allowed me to do so because the app.py code can keep working exactly the same, no matter what kind of Room istance it deals with. If app.py goes through an ExpireRoom istance, overridden methods perform different features instead of a normal Room basic features.
I also fixed the Room.go method so it can react to the presence of ‘*’ key, if such a special key is in paths dict.
Last but not least I decided to fix global functions name_room and load_room restricting their action to Room istances, instead of all kinds of global variables.
Here is my code of planisphere.py:
from random import randint from random import sample class RoomCallError(Exception): pass class Room(object): def __init__(self, name, description): self.name = name self.description = description self.paths = {} # Method go was fixed in order to work with '*' key. # When '*' is a key, it indicates path for unknown directions # (which can be != from default None) # If paths dict hasn't got a '*' key, then the method will return None, # allowing reload of the same room as expected in app.py def go(self, direction): if '*' in self.paths.keys(): if direction in self.paths.keys(): return self.paths.get(direction) else: return self.path.get('*') else: return self.paths.get(direction, None) if direction in self.add_paths.keys(): return self.paths.get(direction, None) else: return self.paths.get('*') def add_paths(self, paths): self.paths.update(paths) # This class ExpireRoom is-a Room. Inheritance from class room was chosen # because composition would have led to more changes in the code. I think # it is more logical in this case. class ExpireRoom(Room): # __init__ method was overridden to define additional attributes def __init__(self, name, description, max_attempts, code, faildestination): self.name = name self.description = description self.paths = {} # Additional attributes for ExpireRoom self.attempts = 0 self.code = code self.max_attempts = max_attempts self.faildestination = faildestination # writes the code on a log file self.logfile = open(f"{self.name}_log.txt", 'w') self.logfile.write(f"{self.code}\n") self.logfile.close() # The following resetcode method is defined only for the child class # This method allows to refresh the code whenever necessary (for example # once the user lost and wants to play again, or after winning) # The method resetcode also resets and readds paths in order to refresh # the code path def resetcode(self, code, paths): self.attempts = 0 self.code = code # Also paths must be refreshed self.paths.clear() self.add_paths(paths) # writes the code on a log file self.logfile = open("log.txt", 'a') self.logfile.write(f"{self.code}\n") self.logfile.close() # Check_code_expired method is defined only for the child class # Increments attempts and checks if code is expired def check_code_expired(self): self.attempts += 1 # in attempts == max_attempts condition, the new path ('*') has to be # added so this last chance becomes critical due to the presence of '*' if self.attempts >= self.max_attempts: self.add_paths({'*': self.faildestination}) return True else: return False def go(self, direction): # First off updates expiration state of the code self.check_code_expired() if '*' in self.paths.keys(): if direction in self.paths.keys(): return self.paths.get(direction) else: return self.paths.get('*') else: return self.paths.get(direction, None) if direction in self.add_paths.keys(): return self.paths.get(direction, None) else: return self.paths.get('*') # Possible death quotes, derived from map.py in previous exercise quips = ["You died. You kinda suck at this.", "Your Mom would be proud...if she were smarter.", "Such a luser.", "I have a small puppy that's better at this.", "You're worse than your Dad's jokes." ] # Only inizialize death Room istance with one static sample quote generic_death = Room("Death", sample(quips, 1)[0]) central_corridor = Room(. """) # This is an istance of child class ExpireRoom. __init__ overriden method takes # 3 more arguments laser_weapon_armory = ExpireRoom("Laser Weapon Armory", """. """, 10, f"{randint(0, 9)}{randint(0, 9)}{randint(0, 9)}", generic_death) the_bridge = Room("The Bridge", """ The container clicks open and the seal breaks, letting gas out. You grab the neutron bomb and run as fast as you can to the bridge where you must place it in the right spot. You burst onto the Bridge with the neutron. """) the_end_winner = Room("The End (winner)", """ You jump into pod 2 and hit the eject button. The pod easily slides out into space heading to the planet below. As it flies to the planet, you look back and see your ship implode the explode like a bright star, taking out the Gothon ship at the same time. You won! """) the_end_loser = Room("The End (loser)", """ You jump into a random pod and hit the eject button. The pod escapes out into the void of space, then implodes as the hull ruptures, crushing your body into jam jelly. """ ) # Also this is a istance of ExpireRoom and has 3 more attributes to inizialize escape_pod = ExpireRoom("Escape Pod", """ on do you take? """, 1, f"{randint(1, 5)}", the_end_loser) # code attribute of laser_weapon_armory is the key of a new path # Warning! Every time that code is reset by the resetcode method, this path has # to be passed to the method resetcode (see def resetcode) escape_pod.add_paths({ escape_pod.code: the_end_winner # '*': the_end_loser was eliminated because it is included by the ExpireRoom # features (go method override) }) the_bridge.add_paths({ 'throw the bomb': generic_death, 'slowly place the bomb': escape_pod }) # code attribute of laser_weapon_armory is the key of a new path # Warning! Every time that code is reset by the resetcode method, this path has # to be passed to the method resetcode (see def resetcode) laser_weapon_armory.add_paths({ laser_weapon_armory.code: the_bridge }) central_corridor.add_paths({ 'shoot!': generic_death, 'dodge!': generic_death, 'tell a joke': laser_weapon_armory }) START = 'central_corridor' # Definition of rooms list # checks on globals() are thus limited to the rooms list rooms = [central_corridor, laser_weapon_armory, the_bridge, escape_pod, the_end_winner, the_end_loser, generic_death ] def load_room(name): # Checks that the corresponding global variable is in rooms if globals().get(name) in rooms: return globals().get(name) else: raise RoomCallError def name_room(room): if room in rooms: for key, value in globals().items(): # Checks that the corresponding global variable is in rooms if value == room: return key else: raise RoomCallError
I will link also the app.py code:
from flask import Flask, session, redirect, url_for, escape, request from flask import render_template from gothonweb import planisphere from gothonweb.planisphere import quips from random import sample from random import randint app = Flask(__name__) @app.route("/") def index(): # this is used to "setup" the session with starting values session['room_name'] = planisphere.START return redirect(url_for("game")) @app.route("/game", methods=['GET', 'POST']) def game(): room_name = session.get('room_name') if room_name == "generic_death": # The code in laser_weapon_armory is refreshed newcode = f"{randint(0, 9)}{randint(0, 9)}{randint(0, 9)}" planisphere.laser_weapon_armory.resetcode(newcode, {newcode: planisphere.the_bridge}) # The code (pod) in escape_pod is refreshed newpod = f"{randint(1, 5)}" planisphere.escape_pod.resetcode(newpod, {newpod: planisphere.the_end_winner}) if request.method == "GET": room = planisphere.load_room(room_name) # Refresh generic_death, to sort a new quip, to show in case of death planisphere.generic_death.__init__("Death", sample(quips, 1)[0]) return render_template("show_room.html", room=room) # request.method == "POST" else: action = request.form.get('action') if room_name and action: room = planisphere.load_room(room_name) next_room = room.go(action) if not next_room: session['room_name'] = planisphere.name_room(room) else: session['room_name'] = planisphere.name_room(next_room) return redirect(url_for("game")) # YOU SHOULD CHANGE THIS IF YOU PUT ON THE INTERNET (added fb87w at the end of it) app.secret_key = 'A0Zr98j/3yX R~XHH!jmN]LWX/,?RTfb87w' if __name__ == "__main__": app.run() | https://forum.learncodethehardway.com/t/ex52-my-version-of-gothonweb/4469 | CC-MAIN-2022-40 | refinedweb | 1,357 | 60.41 |
glibc has no interface for debuggers to access libraries loaded using dlmopen (LM_ID_NEWLM). This issue was originally filed as GDB bug 11839.
The current rtld-debugger interface is described in the file elf/rtld-debugger-interface.txt under the "Standard debugger interface" heading. This interface only provides access to the first link map (LM_ID_BASE). This interface is not obviously extendable for the reasons described here:.
The probes-based rtld-debugger interface allows debuggers to see libraries loaded using dlmopen as they appear. This is enough to debug applications started in the debugger, but not enough to attach to a running process or to debug using a core file.
There was some discussion of this subject on the libc-alpha mailing list between November 2012 and January 2013. The archives are not easily navigable, but the various messages can be found here:
I don't know in detail what the interface should look like, but some points:
1) A Solaris-style librtld_db.so would be undesirable as it would suffer much the same issues as libthread_db.so.
2) The interface must be usable by gdbserver, so it must be fairly lightweight. An interface that required eg a Python interpreter would exclude users running gdbserver in constrained environments.
3) There are people using GDB to debug applications with 5,000 shared libraries and more, so performance is an issue.
4) The interface should work without debugging symbols to be useful for tools such as ABRT.
I acknowledge that glibc needs to do something about this.
(In reply to Gary Benson from comment #0)
> glibc has no interface for debuggers to access libraries loaded using
> dlmopen (LM_ID_NEWLM). This issue was originally filed as GDB bug 11839.
I filed that gdb bug 4 years ago and I just discovered this glibc bug because you added a comment to the gdb bug about this one.
> 3) There are people using GDB to debug applications with 5,000 shared
> libraries and more, so performance is an issue.
Yes, I am one of these people. I also wrote my own loader because I needed more than the 32 namespaces provided by glibc so, it would be really helpful if the solution you choose to implement can be made to work with a dynamic number of namespaces that is potentially larger than 32.
I have not looked at the glibc loader in a long time but if there was progress on this (gdb/glibc interface for namespaces) front, I would probably try to work on a patch for glibc to support dynamically-allocated namespaces.
Regardless of the status of this feature, I would be happy to provide testing help and/or debugging/implementation time once a decision on how to add this feature is made (I read the ML discussions and I would personally favor the dwarf or r_debug solution). | https://sourceware.org/bugzilla/show_bug.cgi?id=15971 | CC-MAIN-2016-30 | refinedweb | 472 | 60.75 |
Static vs Normal Queries
Gatsby handles three varieties of GraphQL queries: Page queries (sometimes for simplicity referred to as “normal queries”), static queries using the
<StaticQuery /> component, and static queries using the
useStaticQuery hook.
Differences between varieties of GraphQL queries
Static queries differ from Gatsby page queries in a number of ways. For pages, Gatsby is capable of handling queries with variables because of its awareness of page context. However, page queries can only be made in top-level page components.
In contrast, static queries do not take variables. This is because static queries are used inside specific components, and can appear lower in the component tree.. This guide discusses the differences in how they are handled internally by Gatsby
Keeping track of site queries during build in Redux stores
Gatsby stores the queries from your site in Redux stores called
components and
staticQueryComponents. This process and a flowchart illustrating it are explained in the query extraction guide.
In Redux,
staticQueryComponents is a
Map from component
jsonName to
StaticQueryObject. An example entry in that data structure looks like this:
In the example above,
blog-2018-07-17-announcing-gatsby-preview-995 is the key, with the object as its value in the
Map.
The
staticQueryComponents Redux namespace watches for updates to queries while you are developing, and adds new data to your cache when queries change.
Replacing queries with JSON imports
Babel traverses all of your source code looking for queries during query extraction. In order for Gatsby to handle static and normal queries differently, it looks for 3 specific cases in
babel-plugin-remove-graphql-queries:
- JSX nodes with the name
StaticQuery
- Calls to functions with the name
useStaticQuery
- Tagged template expressions using the
gqltag
Adding imports for page data
Code that is specific for querying the GraphQL server set up during build time is no longer relevant, and can be swapped out in exchange for the JSON data that has been extracted for each query.
The imports related to GraphQL and query declarations are changed to imports for the JSON that correspond to the query result that Gatsby found when it ran the query. Consider the following component with a static query written using the
useStaticQuery hook:
This component will have the query string removed and replaced with an import for the JSON file created and named with its specific hash. The Redux stores tracking the queries link the correct data to the page they correspond to.
The above component is rewritten like this:
A page query would be updated in a similar fashion. Although the exact specifics of what has to change are different, the idea is the same:
Gatsby will remove unnecessary imports like
useStaticQuery and
graphql from your pages along with the strings containing queries as well. | https://v4.gatsbyjs.com/docs/static-vs-normal-queries/ | CC-MAIN-2022-21 | refinedweb | 462 | 54.56 |
Universal create-react-app, step by step
This post will explain to you how to refactor an app created with create-react-app step by step in order to make it server-side rendering capable (AKA universal).
In the link below you can view and execute the final refactoring
Development
Production
Before moving things around and changing code in create-react-app, let’s explain a few things.
create-react-app uses a WebpackDevServer to build and serve you the app in development environment. WebpackDevServer basically does two things 1) it builds your app (transpiles JS, bundles assets, etc) using Webpack, and 2) it starts a server to serve you the static assets such as the index.html page and the bundle.js. That index.html will contain the script tag with the JS of your app, something like:
<script type=”application/javascript” src=”/static/js/bundle.js”></script>
The script is added dynamically by Webpack so you won’t see the script tag in /public/index.html.
As the name suggests, we use WebpackDevServer in the “Dev” environment. In production, we build an optimized JS file that can be served from a “source”, this could be our server, a CDN, etc. We don’t care because our app is a static JavaScript bundle. In a client-side only app we just need to set up the server during development.
In a universal app we want to render our React components on the server-side separate from the client. Therefore, we’ll need a server in both the development and production environments to render on the server-side.
Let’s do it! First, create an app using `create-react-app my-app`.
If you want to see your app running, execute `
yarn start`. That will run the following script: scripts/start.js. What that script does and we want to keep in our universal app is:
1 - Find an available port to start the WebpackDevServer (3000 by default)
2 - Get the Webpack configuration for the development environment.
3 - Create a WebpackDevServer with a custom Webpack compiler (to configure custom messages among other things)
4 - Start WebpackDevServer on the available port.
Now we are going to refactor the app created by create-react-app to make it server-side (universal).
Step 1. Restructuring folders
Execute in your terminal `npm run eject`. Since we are going to change the scripts and configuration of the build, we need to run eject.
Now we are going to move some files. First, create the following folders in src/
src/client
src/server
src/shared
/client
Move:
src/index.js to src/client/index.js
src/index.css to src/client/index.css
src/registerServiceWorker.js to src/client/registerServiceWorker.js
Copy the content of src/App.css to src/client/index.css. The reason is we are not going to execute babel style-loader on the server-side since at this point in time it’s not compatible with universal (it requires a window object)
Next edit src/client/index.js:
- Replace import App from ‘./App’; for import App from ‘../shared/App’;
- Add import { BrowserRouter as Router } from ‘react-router-dom’
- Replace
ReactDOM.render(<App />, document.getElementById(‘root’));
with:
ReactDOM.render(
<Router><App /></Router>,
document.getElementById(‘root’)
);
Yes we need to add a package, so let’s execute in our terminal:
`yarn add react-router-dom`
/shared
Please move:
- src/App.js to src/shared/App.js
- src/App.test.js to src/shared/App.test.js
- src/logo.svg to src/shared/logo.svg
/server
Let’s install the dependencies we need: `yarn add express nodemon webpack-node-externals http-proxy-middleware isomorphic-fetch`
In the src/server we are going to create 3 files:
- src/server/index.js
- src/server/app.js
- src/server/render.js
Step 2. Implementing the server-side
/src/server/index.js
Let’s implement first src/server/index.js. Responsibilities of this file are:
1. Create and start the server, Express in this example.
import express from ‘express’
//…
const app = express()
2. If it is production, map the url path ‘/static’ with the directory /bundle/client/static. So in production we serve the production build
If it is development then we have to proxy the url path ‘/static’ with the url where WebpackDevServer is running. We also need to enable web sockets (ws: true). Finally we need to redirect the path ‘/sockjs-node’ to WebpackDevServer. So HMR () will still work. This way, in development, every request to your Express server that has to do with your bundle will be managed by WebpackDevServer
3. Map the build assets with the root url path
app.use(‘/’, express.static(‘build/client’))
4. Use the code that has to do with your React app
import reactApp from ‘./app’
//…
app.use(reactApp)
Note the order of the above 4 points is important. You can see a full implementation of src/server/index.js here
/src/server/app.js
Let’s have a look to src/server/app.js. This server/app.js is going to be an Express middleware, so it has to be a function with the following parameters: const reactApp = (req, res) => { }
Responsibilities of that file are:
1. Render the HTML of that url into the response
2. Set the right http status
react-router v4 is very nicely designed with React’s “way of thinking”, so we don’t have to do anything like in previous versions to match the url and the component at this level. We can get the HTML for that req.url just by doing:
HTML = render(
<Router context={{}} location={req.url}>
<App />
</Router>)
But we are going to add a little trick. We want to return a status 404 if the page is not found. Since the match is done by react-router down in the tree, we can’t know if that req.url is a match or not without adding some custom matching. Here you have an example of what I mean (more on that.)
So what we are going to do instead is we are going to let React tell us if there was a match for a “not found page”. To do that we are going to set in the context the following function:
const setStatus = newStatus => { status = newStatus }
So the “Not found component” that is rendered when there is no match should get that function from the context and set the status to 404.. This way we don’t have to define routes in two different places, and match them twice.
We add the setStatus function to the context by using this simple and generic context provider
HTML = render(
<Context setStatus={setStatus}>
<Router context={{}} location={req.url}><App /></Router>
</Context>
)
You can see a full implementation of src/server/app.js here
/src/server/render.js
Responsibilities of this file:
1- Contains an HTML template for our pages
2- renderToString our React app
3- Sets the url of the statics: main.css and bundle.js
Note, in the 3rd step if we are in development environment we don’t want to set any CSS because that’s Webpack HMR job.
You can see an implementation here
Step 3. Scripts.
/package.json
We are going to add the following scripts:
“serve”: “NODE_ENV=production node ./build/server/bundle.js”,
“build-client”: “node scripts/build-client.js”,
“build-server”: “node scripts/build-server.js”,
“build”: “npm run build-client && npm run build-server”,
/scripts
Rename scripts/build.js to build-client.js and change:
const config = require(‘../config/webpack.config.prod’);
to
const config = require(‘../config/webpack.config.client.prod’)
Find this line:
if (!checkRequiredFiles([paths.appHtml, paths.appIndexJs])) {
and remove paths.appHtml. The reason is we don’t serve that html page anymore, it’s our Express server who takes care of that now.
/scripts/build-server.js
Responsabilities of this file /scripts/build-server.js:
1. Read the asset manifest and set it in process.env.REACT_APP_ASSET_MANIFEST so we can use it in our src/server/render.js
Note, REACT_APP prefix is important otherwise Webpack won’t include it in the transpiled code.
2. Clean the build/server directory fs.emptyDirSync(paths.serverBuild);
3. Compile the code using compiler = webpack(config); // notice that config is const config = require(‘../config/webpack.config.server’);
You can see an implementation of build-server.js here
/scripts/start.js
This script will start both the client(WebpackDevServer) and the server(Express compiled with Webpack). We have to change a few things here:
1. Before requiring ‘../config/webpack.config.client.dev’ we need to know the assigned port to WebpackDevServer and set the following process.env.REACT_APP_CLIENT_PORT = port
So after const urls = prepareUrls(protocol, HOST, port); will do:
process.env.REACT_APP_CLIENT_PORT = port
const configWebpackClient = require(‘../config/webpack.config.client.dev’);
2. Instead of const compiler = createCompiler(webpack, configWebpackClient, appName, urls, useYarn); we are going to use a standard compiler: const compiler = webpack(configWebpackClient);
The reason is, we don’t want custom messages since things won’t work as those messages say.
The code for the previous two points:
3. Once WebpackDevServer starts on the available port, we need to find an available port for the Express server:
choosePort(HOST, DEFAULT_SERVER_PORT).then(portServer => {
if (portServer == null) {
// We have not found a port.
return;
}
4. We need to require the ‘../config/webpack.config.server’, compile and watch for changes:
// process.env.REACT_APP_SERVER_PORT is used by server/index.js
process.env.REACT_APP_SERVER_PORT = portServer;
const configWebpackServer = require(‘../config/webpack.config.server’);
const compiler = webpack(configWebpackServer);
const urls = prepareUrls(protocol, HOST, portServer);
let isServerRunning;
compiler.watch({ // watch options:
aggregateTimeout: 300,
}, function(err, stats) {
//…
Code of the previous two points
5. We execute nodemon to watch for changes and run our server
const nodemon = exec(‘nodemon — watch build/server build/server/bundle.js build/server/bundle.js’)
Full implementation of scripts/start.js
Step 4. Last but not least, configuration.
/config/polyfills.js
Change require(‘whatwg-fetch’) to require(‘isomorphic-fetch’)
/config/path
remove this:
- appIndexJs: resolveApp(‘src/client/index.js’),
- serverIndexJs: resolveApp(‘src/server/index.js’),
- appBuild: resolveApp(‘build/client’),
- serverBuild: resolveApp(‘build/server’),
add this:
- appIndexJs: resolveApp(‘src/index.js’)
- appBuild: resolveApp(‘build’)
Webpack configuration
We need 3 different Webpack configurations.
1- One for the client/bundle.js in production environment. We are going to use puglins like HMR that are not required on the server.
2. Another one for the client/bundle.js in development environment. We are going to use plugins like minification that are not required in development.
3- The server will have the same Webpack configuration in production and development. This is the reason we don’t require different plugins in development and production.
We are going to create a base.config, and the 3 Webpack config files will extend it. You can have a look at this file and see what the common things are:
/config/webpack.config.server.js
Important things to highlight here:
We need to clone the webpack.config.base — we can use const config = Object.assign({}, base). This is because the scripts/start.js will run webpack.config.server.js and webpack.config.client.dev.js, and both override webpack.config.base
config.target = ‘node’
config.entry = ‘./src/server’ // the entry point is different from the client. Notice that Webpack doesn’t include in the bundle files that are not required or imported
config.externals = [nodeExternals()] // / in order to ignore all modules in node_modules folder
config.output = {
path: paths.serverBuild,
filename: ‘bundle.js’,
publicPath: ‘/’
}
/config/webpack.config.client.dev.js
The important bits here:
config.output = {
…
hotUpdateChunkFilename: ‘static/[id].[hash].hot-update.js’, hotUpdateMainFilename: ‘static/[hash].hot-update.json’,
}
This is because we need to proxy Webpack HMR.
config.module.rules we add the style-loader. We only include the “style-loader” on the client because it doesn’t work on the server-side
config.plugins, here we add modules like HotModuleReplacementPlugin.
Some libraries import Node modules but don’t use them in the browser. Tell Webpack to provide empty mocks for them so importing them works.
config.node = {
fs: ‘empty’,
net: ‘empty’,
tls: ‘empty’,
}
/config/webpack.config.client.prod.js
The important bits here:
In the config.entry we don’t need react-dev-utils/webpackHotDevClient and react-error-overlay
config.plugins: we need to add these plugins: ManifestPlugin, SWPrecacheWebpackPlugin and UglifyJsPlugin
Congrats! you read to the end of the article :)
Here you can see a full implementation of all the steps
Happy universal hacking! | https://medium.com/leanjs/universal-create-react-app-step-by-step-b80ba68d125d?source=---------1--------------------- | CC-MAIN-2019-22 | refinedweb | 2,075 | 51.95 |
In this article, we are going to talk about how to use Elasticsearch in Python. If you have no knowledge about Elasticsearch yet, you can read this article for a quick introduction.
As a data engineer you may need to create Elasticsearch documents in Python with some scripts. As a software engineer, when you design your API in Python, you would need to make REST API calls to Elasticsearch to fetch the data. Therefore, if you are using Elasticsearch in your work or plan to learn it, this article can be useful for you.
If you haven’t installed Elasticsearch yet…
When we write Python programs, we often need to print out the results and also log some exceptions. As a beginner, we would normally use the
A cool new feature called assignment expression was introduced in PEP572 since Python 3.8. Assignment expression uses operator
:= to assign the value of an expression to a variable. Since operator
:= resembles the eyes and tusks of a walrus, it is informally known as “the walrus operator”.
The assignment expressions are most commonly used in
if and
while conditions to simplify code. While they can also be used in other cases as demonstrated in PEP572, it is recommended not to do so in order to improve code readability and avoid confusion.
The major benefit of assignment expressions is that…
Postman is a collaboration platform for API development. If you are a software developer and need to develop, test, and maintain an API or a set of API endpoints, you will find Postman very helpful. In this article, we won’t introduce too many concepts about API and Postman but will focus on some of the most common use cases which shall be handy for your development work.
You can use the web version of Postman directly, or you can download and install it on your computer. …
A decorator is a function that takes another function as input, extends its behavior, and returns a new function as output. This is possible because, in Python, functions are first-class objects, which means they can be passed as arguments to functions and also be returned from functions, just as other types of objects such as string, int, or float.
Let’s first demonstrate how a decorator works. Once you understand it, you won’t use it as a black box anymore.
Let’s create a super simple function:
def func1():
print("Inside func1.")>>> func1()
Inside func1.
Then let’s create a simple decorator, which…
Python is a dynamically typed programming language, which means the types are only checked at runtime and a variable is allowed to change its type over its lifetime, whereas a statically typed language like Java checks the types at compile-time, and a variable is not allowed to change its type over its lifetime. On the other hand, Python is a strongly typed language because the types cannot be automatically converted at runtime. For example, you cannot have an addition calculation on integer
1 and string
"2", while in a weakly typed language such as JavaScript such calculation is allowed.
Even…
Google is a great source for obtaining data, either in your personal projects or in real business projects. Google has a Custom Search Engine (CSE) API which can be conveniently used in your Python code. It has a free version which is enough for studying purpose or even small projects which have less than 100 search queries every day.
To get started using Google Custom Search Engine, you need to have a valid API key, which can be obtained here. You need to log in with your Google account and create a project for it. You can create a project…
In this article, some advanced CRUD and search queries for nested objects in Elasticsearch will be introduced. If you want to learn more about the basics about Elasticsearch you can check these articles for a quick start or refresh:
In case you just want to learn nested objects in Elasticsearch. You can run this command in Kibana to create the index which will be used later.
In this example, the
attributes field is a nested…
Good Cloud Storage can be a convenient option if you want to store your data in the cloud programmatically, especially if you use the Google Cloud Platform. You can store any data in your work, such as plain text files, images, videos, etc. As a beginner you may prefer to use the Google Cloud Console to manage you files, which is very straightforward to use. However, as a developer, you would need to use the command line tool or the client library in your code to deal with Google Cloud Storage more programmatically.
Before we introduce the command line tool…
Python 2.7 is not supported after Jan. 1st, 2020. After the first release in July 3, 2010, Python 2.7 has been active for 10 years and a large number of projects are written in this version. Most Python 2 projects should still be able to work properly as Python 2.7 is a very stable version and most bugs have been fixed in the past 10 years. However, with Python 2.7, you are not able to use many cool features introduced in Python 3, such as f-string, typing and assignment expression. Particularly, typing has become a must-to-have for new Python projects…
Senior data engineer specialized in Python, JavaScript/TypeScript, Java/Scala, MySQL, MongoDB, Elasticsearch, API, Big Data, Cloud Computing, Git, etc. | https://lynn-kwong.medium.com/?source=post_internal_links---------3---------------------------- | CC-MAIN-2021-25 | refinedweb | 921 | 68.1 |
Hi there i am having problems trying to compile servlets even those that are examples found in the tomcat directory. The jdk am using is able to compile any other type of classes but not that classes that require the packag javax.servlet infact when compiling it, it says it doesnt exist !.
I am using tomcat 4.0 beta 7 and JDK ver 1.4 on a Windows 2000 machine. When typing the tomcat page appears and when attempting to run the ready made servlets evverything is normal however problem is compiling them.
My server settings are as follows :-
1) Windows 2000- Environment settings (System Variables)-
CATALINA_HOME- C:\Program Files\Tomcat4.0
JAVA_HOME - C:\jdk1.4
CLASSPATH - C:\jdk1.4\bin\tools.jar;C:\Program Files\Tomcat4\lib\servlet.jar;%CLASSPATH%
PATH - C:\jdk1.4\bin;C:\Program Files\Tomcat4
2) Javac commands functions normally and the connection to the server from works fine.
3) Error obtained after attempting to compile :-
HelloWorld.java:2: package javax.servlet does not exist
import javax.servlet.*
Therefore throughout the script every class within this package is regarded as an error.
Can any one help solve this problem or help reconfigure the server ??
Apperciate ur help !!
Urban Developer | http://forums.devshed.com/java-help/20490-compling-servlets-last-post.html | CC-MAIN-2017-13 | refinedweb | 204 | 61.63 |
A First Netlify Function in Golang
I love all things serverless, and Netlify Functions is a neat and convenient way to access AWS Lambda. I do also love AWS Lambda but it’s so powerful and flexible that creating something like a webhook receiver can be hard going by the time you have all the permissions and API Gateway setup sorted out — for a simple webhook receiver, Netlify functions is a nice and easy way to get going. Best of all: it supports Golang but the docs are very JS-heavy so I am writing my notes here in case I need to refer back to them some day.
Write a function
The Netlify docs for golang are a great starting point. I am deploying this project manually, so I need to build the thing myself rather than letting the Netlify CI servers do that.
Here’s a very simple example with a handler declared in
main() and then a function that will greet you by name if you supply a
name parameter in the query (this code lives in
src/first.go):
package main
import (
"context"
"github.com/aws/aws-lambda-go/events"
"github.com/aws/aws-lambda-go/lambda"
)
func handler(ctx context.Context, request events.APIGatewayProxyRequest) (*events.APIGatewayProxyResponse, error) {
params := request.QueryStringParameters
name := "World"
if params["name"] != "" {
name = params["name"]
}
return &events.APIGatewayProxyResponse{
StatusCode: 200,
Body: "Hi " + name,
}, nil
}
func main() {
lambda.Start(handler)
}
Great, we wrote a function! Now what? Time to build the code before deploying it.
Build the binary
You can push code to GitHub and instruct the Netlify CI on how to use the source code to build what you want … in this case I’m just pushing one function as an example so I’ll do the building myself. I like to use a Makefile for this:
build:
mkdir -p functions
GOOS=linux GOARCH=amd64 go build -o functions/first ./src/first.go
Note that for
go build setting the appropriate config for Lambda is important here - on my Ubuntu machine, probably this would build correctly, but by being specific in my
Makefile I'm less likely to screw this up in future :)
When I run this by typing
make, it puts the compiled
first binary into the
functions/ directory. This is important as we work up to deploying in the next step.
Deploy to Netlify
I’m doing a manual deploy because I’m too lazy to set up a pipeline for a one-off project, so I am using the
netlify-cli command line tool here. Before I do though, I'll configure the settings in a
netlify.toml file in the root of my project. Mine looks like this:
[build]
command = "make build"
functions = "functions"
publish = "./"
The important part here is the
functions setting - my build step above put the binaries into the
functions/ directory, and that's what Netlify will deploy. There's more information in the
.netlify.toml docs too.
Now the deploy command! By default this has a really neat feature where you can deploy a draft and check it before promoting to production. For this project though, I’m just going to go straight for the live platform. You only live once, after all.
netlify deploy --prod
This will upload whatever I put in the
functions/ folder and then come back to me with a "Live URL" that it deployed to.
Call the function
Now I can call the function! The URL is a bit funky: [
Live URL]/.netlify/functions/first - but Netlify make this easy to find through the web interface, look in the Site you are working on, choose functions from the top bar and when you click on the function name, you get detailed information including its "Endpoint" and also some logs (the output of
fmt.Print* goes to the logs here, very useful for debugging!).
I can append
?name=Jane to see my function greet Jane rather than World, which is rather simple but neat. You can access a load of the request info AND the serverless function context from within the function so many more things are possible. I tend to think that the hard part is usually the moving parts and not the code, so hopefully this will help me next time I want to do this. If it helped you too, feel free to share more tips in the comments box! | https://lornajane.medium.com/a-first-netlify-function-in-golang-e9912f8a835 | CC-MAIN-2022-33 | refinedweb | 733 | 71.04 |
I have been following the Apple Guide for their new language swift, but I don't understand why the bar on the right is only showing "Hello, playground" and not "Hello, world". Can someone explain why the
println
// Playground - noun: a place where people can play
import Cocoa
var str = "Hello, playground"
println("Hello, world");
In Xcode 6.3 and later (including Xcode 7 and 8), console output appears in the Debug area at the bottom of the playground window (similar to where it appears in a project). To show it:
Click the middle button of the workspace-layout widget in the toolbar
Click the triangle next to the timeline at the bottom of the window
Anything that writes to the console, including Swift's
println in Swift 2 beta) shows up there.
In earlier Xcode 6 versions (which by now you probably should be upgrading from anyway), show the Assistant editor (e.g. by clicking the little circle next to a bit in the output area). Console output appears there. | https://codedump.io/share/lwCwPVFLnafj/1/how-to-print-to-console-using-swift-playground | CC-MAIN-2017-51 | refinedweb | 171 | 64.44 |
I was reading Zack's article about how he uses an interrupt timer to do the debouncing: ... cropython/
It seems like a very smart solution, and I'm wondering if there is a compelling reason to do it that way, rather than with some much simpler code delay, like this one:
Code: Select all
def wait_pin_change(pin): # wait for pin to change value # it needs to be stable for a continuous 20ms cur_value = pin.value() #cur_time = utime.ticks_ms() active = 0 while active < 200: if pin.value() != cur_value: active += 1 else: active = 0 #pyb.delay(1) sleep_ms(1)
Thanks in advance, AB | https://forum.micropython.org/viewtopic.php?p=33922 | CC-MAIN-2019-30 | refinedweb | 101 | 64.41 |
A Sketch of Categorical Relation Algebra Combinators in Z3Py
I’ve discussed relation algebra before. Relations are sets of tuples. There, I implemented the relations naively using lists for sets. This is very simple, and very clean especially with list comprehension syntax. It is however horrifically inefficient, and we could only deal with finitely enumerable domains. The easiest path to fixing these problems is to cash out to an external solver, in this case z3.
There are many beautifully implemented solvers out there and equally beautiful DSL/modeling languages. Examples in mind include sympy, cvxpy, and z3. These modeling languages require you to instantiate variable objects and build expressions out of them and then hand it off to the solver. This is a reasonable interface, but there are advantages to a more categorical/point-free style DSL.
Point-free languages are ones that do not include binding forms that introduce bound/dummy variables. Examples of binding forms like this are $ \lambda \sum \max \min \int \sup \lim \forall \exists$. One problem lies in the fact that the names of bound variables don’t matter, and that they end up accidentally smashing into each other. You may have experienced this in physics or math class as the dummy indices or dummy variable problem causing you to screw up your calculation of some cross product identity or some complicated tensor sum. These are surprisingly subtle problems, very difficult to diagnose and get right. de Bruijn indices is a technique for giving the bound variables canonical names, but it sucks to implement in its own way. When you make a DSL point free, it is a joy to manipulate, optimize, and search. I think this may be the core of why category theory is good language for mathematics and programming.
Point-free style also tends to have significant economy of size, for better or worse. Sometimes it is better to have an expression very dense in information. This is important if you are about the algebraically manipulate an expression with paper and pencil. Every manipulation requires a great deal of mind numbing copying as you proceed line by line, so it can be excruciating if your notation has a lot of unnecessary bulk.
Relations are like functions. The two pieces of the tuple can be roughly thought of as the “input” and the “output”. Relations are only loosely directional though. Part of the point of relations is that the converse (inverse) of a relation is easy to define.
When we are implement relations, we have a choice. Do we want the relation to produce its variables, accept its variable, or accept one and produce the other? There are advantages to each. When relations were [(a,b)], a -> b -> Bool, and a -> [b] converting between these forms was a rather painful enumeration process. The sting of converting between them is taken out by the fact that the conversion is no longer a very computationally expensive process, since we’re working at the modeling layer.
When you’re converting a pointful DSL to pointfree DSL, you have to be careful where you instantiate fresh variables or else you’ll end up with secret relations that you didn’t intend. Every instantiation of
id needs to be using fresh variables for example. You don’t want the different
id talking to each other. Sometimes achieving this involves a little currying and/or thunking.
There is a pattern that I have notice when I’m using modeling languages. When you have a function or relation on variables, there are constraints produced that you have to keep a record of. The pythonic way is to have a Model or Solver object, and then have that objects mutate an internal record of the set of constraints. I don’t particularly enjoy this style though. It feels like too much boiler plate.
In Haskell, I would use something like a Writer monad to automatically record the constraints that are occurring. Monads are not really all that pleasant even in Haskell, and especially a no go in python without “do” syntax.
However, because we are going point free it is no extra cost at all to include this pipework along for the ride in the composition operation.
Here are implementations of the identity and composition for three different styles. Style 1 is fully receptive, style 2 is mixed (function feeling) and style 3 is fully productive of variables.
Fair warning, I’m being sketchy here. I haven’t really tried this stuff out.
def rid1(x,y): # a receptive relations. It receives variables return x == y def compose1(f, sort, g): # annoying but we need to supply the sort of the inner variable def res(x,z): y = FreshConst(sort) return Exists([y], And(f(x,y), g(y,z))) return res def rid2(x): # a functional relation. It receives a variable then produces one. y = FreshConst(x.sort()) return y, x == y def compose2(f,g): def res(x): y, cf = f(x) z, cg = g(y) return z, Exists([y], And(cf,cg) ) def rid3(sort): # a type indexed generator of relations. Annoying we have to supply the type of the variable def res(): # a productive relation x = FreshConst(sort) y = FreshConst(sort) return x, y, x == y return res def compose3(f,g): def res(): x, yf, cf = f() yg, z, cg = g() return x, z, Exists([yf,yg], And(cf, cg, yf == yg)) return res
z3 is a simply typed language. You can get away with some polymorphism at the python level (for example the == dispatches correctly accord to the object) but sometimes you need to manually specify the sort of the variables. Given these types, the different styles are interconvertible
def lift12(sorty, f): def res(x): y = FreshConst(sorty) c = f(x,y) return y, c return res def lift23(sortx, f): def res(): x = FreshConst(sortx) y, c = f(x) return x, y, c return res def lift31(f): def r(x,y): x1, y1, c = f() return x1, y1, And(c, x1 == x, y1 == y) return res
We can create the general cadre of relation algebra operators. Here is a somewhat incomplete list
trivial = BoolVal(True) def top1(x,y): # top is the full relation, return trivial def bottom1(x,y): return BoolVal(False) def top2(sorty): def res(x): y = FreshConst(sorty) return y, trivial return res def top3(sortx, sorty): def res(): x = FreshConst(sortx) y = FreshConst(sorty) return x, y, trivial return res def converse1(r): return lambda x,y: r(y,x) def meet1(p,q): return lambda x,y : p(x,y) & q(x,y) def join1(p,q): return lambda x,y : p(x,y) | q(x,y) # product and sum types def fst1(x,y): # proj(0) return y == x.sort().accessor(0,0)(x) def snd1(x,y): # proj(1) return y == x.sort().accessor(0,1)(x) def left1(x,y): return y == y.sort().constructor(0)(x) def right1(x,y): return y == y.sort().constructor(1)(x) def inj1(n): return lambda x, y: return y == y.sort().constructor(n)(x) def proj1(n): return lambda x, y: return y == x.sort().accessor(0,n)(x) def fan(p,q): def res(x,y): a = y.sort().accessor(0,0)(y) b = y.sort().accessor(0,1)(y) return And(p(x,a), q(x,b)) return res def dup1(x,(y1,y2)): # alternatively we may not want to internalize the tuple into z3. return And(x == y1 , x == y2) def convert_tuple((x,y), xy): # convert between internal z3 tuple and python tuple. return xy == xy.constructor(0)(x,y) #def split(): #def rdiv # relation division is so important, and yet I'm always too mentally exhausted to try and straighten it out def itern(n, sortx, p): # unroll if n == 0: return rid1(sortx) else: return compose(starn(n-1, sortx, p), p) def starn(n, sortx, p): # unroll and join if n == 0: return rid1(sortx) else: return join(rid, compose(starn(n-1, sortx, p))) # 1 + x * p # more specialized operations than general puyrpose structural operators def lte1(x,y): return x <= y def sum1(x,y): # I'm being hazy about what x is here exactly return x[0] + x[1] == y def npsum(x,y): return np.sum(x) == y # you can make numpy arrays of z3 variables. Some vectorized functions work. def mul1(x,y): return x[0] * x[1] == y def and1((x,y), z): return z == And(x,y) def If1((b,t,e),y): return If(b, t,e) == y
Questions about relation algebra expressions are often phrased in term of relational inclusion. You can construct a relation algebra expression, use the rsub in the appropriate way and ask z3’s
prove function if it is true.
# relational properties def rsub(p,q, sortx, sorty): x = FreshConst(sortx) y = FreshConst(sorty) return ForAll([x,y].Implies(p(x,y) , q(x,y) )) def req(p,q,sortx, sorty): return And(rsub(p,q,sortx,sorty), rsub(q,p,sortx,sorty) def symmetric1(sortx, sorty, r): x = FreshConst(sortx) y = FreshConst(sorty) return ForAll([x,y], r(x,y) == r(y,x)) def reflexive1(sortx, r): x = FreshConst(sortx) return ForAll([x],r(x,x)) def transitive1(sortx,sorty,sortz, r): x = FreshConst(sx) y = FreshConst(sy) ForAll([x,y], Implies(r(x,y) & r(y,z) , r(x,z)) def strict1(r,sortx): x = FreshConst(sortx) return Not(r(x,x))
Z3 has solvers for
- Combinatorial Relations
- Linear Relations
- Polyhedral Relations
- Polynomial Relations
- Interval Relations - A point I was confused on. I thought interval relations were not interesting. But I was interpetting the term incorrectly. I was thinking of relations on AxB that are constrained to take the form of a product of intervals. In this case, the choice of A has no effect on the possible B whatsoever, so it feels non relational. However, there is also I_A x I_B , relations over the intervals of A and B. This is much closer to what is actually being discussed in interval arithmetic.
Applications we can use this for:
- Graph Problems. The Edges can be thought of as a relation between vertices. Relation composition Using the
starnoperator is a way to ask for paths through the graph.
- Linear Relations - To some degree this might supplant my efforts on linear relations. Z3 is fully capable of understanding linear relations.
- Safety and liveness of control systems. Again. a transition relation is natural here. It is conceivable that the state space can be heterogenous in time, which is the interesting power of the categorical style. I feel like traditional control systems usually maintain the same state space throughout.
- Program verification
- Games? Nash equilibria?
Other Thoughts
- Maybe we are just building a shitty version of alloy.
- What about uninterpeted relations? What about higher order relations? What about reflecting into a z3 ADT for a relational language. Then we could do relational program synthesis. This is one style, just hand everything off to smt.
- I should try to comply with python conventions, in particular numpy and pandas conventions. @ should be composition for example, since relation composition has a lot of flavor of matrix composition. I should overload a lot of operators, but then I’d need to wrap in a class :(
- Z3 has special support for some relations. How does that play in?
- As long as you only use composition, there is a chaining of existentials, which really isn’t so bad.
- What we’ve done here is basically analogous/identical to what John Wiegley did compiling to the category of z3. Slightly different in that he only allowed for existential composition rather than relational division.
- We can reduced the burden on z3 if we know the constructive proof objects that witness our various operations. Z3 is gonna do better if we can tell it exactly which y witness the composition of operators, or clues to which branch of an Or it should use.
- It’s a bummer, but when you use quantifiers, you don’t see countermodels? Maybe there is some hook where you can, or in the dump of the proof object.
- What about recursion schemes? The exact nature of z3 to handle unbounded problems is fuzzy to me. It does have the support to define recursive functions. Also explicit induction predicates can go through sometimes. Maybe look at the Cata I made in fancy relaion algebra post
- I think most proof assistants have implementations of relation algebra available. I find you can do a surprising amount in z3. | https://www.philipzucker.com/a-sketch-of-categorical-relation-algebra-combinators-in-z3py/ | CC-MAIN-2021-39 | refinedweb | 2,102 | 54.63 |
- Author:
- schinckel
- Posted:
- July 25, 2009
- Language:
- Python
- Version:
- 1.0
- decorator request
- Score:
- -2 (after 2 ratings)
I wanted to be able to limit which types of requests a view will accept. For instance, if a view only wants to deal with GET requests.
@methods(GET) def index(request): # do stuff
Now, calling this view with a non-GET request will cause a 403.
You can easily change this to a 404, by using a different return function: which you may wish to do with openly available sites, as a 403 indicates there is a resource present.
from django.views.decorators import require_http_methods
#
Sorry
from django.views.decorators.http import require_http_methods
#
Nice to know my code is virtually identical. Makes me think I picked the right way to do it.
:)
#
This snippet only works with view functions. I have been doing some stuff with views that are methods of a class (think of an API that is analogous to django.contrib.admin, and we want some views to be methods of ModelApi, so they can be overridden), and this type of decorator doesn't quite work.
#
Please login first before commenting. | https://djangosnippets.org/snippets/1651/ | CC-MAIN-2017-22 | refinedweb | 192 | 64.71 |
{- Text.HTML.Chunks : simple templates with static safety Copyright (C) 2007 Matthew Sack. module Text.HTML.Chunks (chunksFromFile, showChunksData, showChunksAll, Chunk(format) ) where import qualified Text.HTML.Chunks.Parser as P import qualified Text.HTML.Chunks.TH as TH import Language.Haskell.TH import Language.Haskell.TH.Syntax import Data.List class Chunk a where -- | The instances of 'Chunk' that are built by 'chunksFromFile' -- incorporate into the implementation of 'format' all the textual -- content of the chunk. Supplying a value of the automatically -- generated data type @Chunk_/*/@ will use the fields in the -- value to fill in all variables within the chunk. format :: a -> String -- | Parse the supplied file and generate the Haskell AST representing -- data-type declarations of the chunks with instances of 'Chunk' -- incorporating the body of the chunks. Expected use is through -- splicing (ghc needs @-fth@ option for this): -- -- @ -- $(chunksFromFile \"\/path\/to\/templates\/template_01.html\") -- @ chunksFromFile :: FilePath -> Q [Dec] chunksFromFile fileName = do { file <- runIO (readFile fileName) ; let chunks = P.findChunks file ; dataDecls <- TH.declsD chunks ; funcDecls <- TH.declsF chunks ; return (dataDecls ++ funcDecls) } -- |Data :: FilePath -> IO String showChunksData fileName = do { file <- readFile fileName ; let chunks = P.findChunks file ; dataDecls <- runQ (TH.declsD chunks) ; return (pprint dataDecls) } -- |. showChunksAll :: FilePath -> IO String showChunksAll fileName = do { file <- readFile fileName ; let chunks = P.findChunks file ; dataDecls <- runQ (TH.declsD chunks) ; funcDecls <- runQ (TH.declsF chunks) ; return $ (pprint dataDecls) ++ "\n" ++ (pprint funcDecls) } | http://hackage.haskell.org/package/chunks-2007.4.18/docs/src/Text-HTML-Chunks.html | CC-MAIN-2016-30 | refinedweb | 229 | 61.33 |
IRC log of tagmem on 2004-11-30
Timestamps are in UTC.
00:55:32 [timbl]
timbl has joined #tagmem
02:32:22 [DanC_lap]
DanC_lap has joined #tagmem
02:32:41 [DanC_lap]
DanC_lap has left #tagmem
14:07:26 [RRSAgent]
RRSAgent has joined #tagmem
14:08:12 [Stuart]
The latencies are better on the phone
14:08:26 [Norm]
Yes, please use the phone :-)
14:08:27 [paulc]
We are dialing in.
14:08:51 [paulc]
Sorry we were talking on the video link for the last 15 minutes bringing Stuart uptodate.
14:09:12 [Zakim]
+??P1
14:09:16 [paulc]
Trying to find a MIT number for Zakim.
14:09:23 [Stuart]
zakim, ??P1 is me
14:09:23 [Zakim]
+Stuart; got it
14:09:34 [paulc]
BTW we do yet have Roy or Chris at the meeting.
14:09:53 [Zakim]
+MIT262
14:09:56 [paulc]
Norm: We are moving at 12noon to other room and Amy says it will have a telcon facility.
14:10:43 [noah]
noah has joined #tagmem
14:10:52 [paulc]
Sorry we are expecting Dan and Roy.
14:11:25 [paulc]
topic
14:11:33 [paulc]
topic:
14:11:33 [noah]
meeting: TAG F2F Nov 30, 2004
14:11:42 [Stuart]
Stuart has changed the topic to:
14:12:05 [noah]
zakim, who is here?
14:12:05 [Zakim]
On the phone I see Norm, Stuart, MIT262
14:12:06 [Zakim]
On IRC I see noah, RRSAgent, Zakim, Norm, Stuart, timbl, paulc
14:15:07 [DanC_lap]
DanC_lap has joined #tagmem
14:17:19 [DanC_lap]
RRSAgent, pointer?
14:17:19 [RRSAgent]
See
14:17:47 [paulc]
We have to recess at 12noon today and move rooms.
14:18:17 [noah]
We'll be in 346 in the Stata Center this afternoon.
14:18:25 [paulc]
Norm will be away 11:30am ET to 1pm.
14:18:32 [DanC_lap]
Zakim, MIT262 has PaulC, DanC, Roy, Noah
14:18:32 [Zakim]
+PaulC, DanC, Roy, Noah; got it
14:19:32 [DanC_lap]
Scribe: DanC (thru lunch)
14:19:41 [DanC_lap]
RoyF offers for after lunch
14:19:58 [DanC_lap]
Topic: 5. TAG Issues
14:20:09 [DanC_lap]
DanC_lap has changed the topic to: TAG ftf
14:20:13 [paulc]
TAG issues grouped by theme:
14:20:52 [Roy]
Roy has joined #tagmem
14:21:48 [DanC_lap]
PaulC: which issues shall we discuss next? Stuart: I'd like to discuss metadataInURIs 31
14:22:16 [DanC_lap]
14:22:55 [DanC_lap]
PaulC observes that 31 is in the "2.2.2 URI and Fragment Issues" cluster of
14:23:27 [DanC_lap]
Zakim, Chris just arrived in MIT262
14:23:27 [Zakim]
+Chris; got it
14:24:17 [DanC_lap]
PaulC observes requests jive with
14:25:36 [DanC_lap]
Topic: 2.2.1 Media-Types Issues RFC3023Charset-21
14:25:56 [DanC_lap]
PC: outstanding actions here?
14:26:18 [DanC_lap]
CL: just the long-standing action to edit the revision
14:27:17 [paulc]
14:27:34 [DanC_lap]
subject: 3023 update (was Re: Agenda TAG Telcon: 8th Nov 2004)
14:27:59 [DanC_lap]
CL: there's pushback on the use of XPointer
14:29:08 [DanC_lap]
ACTION: something about XPolinter in RFC3023 revision
14:30:15 [DanC_lap]
ACTION 1 = explain how just using the RECcomended parts of XPointer isn't too much of a burden in RFC3023
14:30:24 [DanC_lap]
ACTION 1 = CL: explain how just using the RECcomended parts of XPointer isn't too much of a burden in RFC3023
14:31:16 [DanC_lap]
CL: ... charset...
14:32:26 [DanC_lap]
SW: I found Martin's distinction between use in registration docs and use in exchanged documents useful
14:32:42 [DanC_lap]
CL: I don't see how it helps to require documenting and implementing it but not using it
14:34:02 [Chris]
Chris has joined #tagmem
14:35:34 [paulc]
14:35:58 [Chris]
see also
14:36:38 [Chris]
In general, a representation provider SHOULD NOT specify the character encoding for XML data in protocol headers since the
14:36:47 [Chris]
ation provider SHOULD NOT specify the character encoding for XML data in protocol headers since the data is self-describing
14:37:53 [Roy]
14:38:15 [DanC_lap]
" In general, a representation provider SHOULD NOT specify the character encoding for XML data in protocol headers since the data is self-describing."
14:39:48 [Chris]
Roy: Existing 3023 says must, so we went to SHOULD NOT; if it had not, we would have said MUST NOT
14:39:50 [DanC_lap]
RF: if not for the "providers MUST..." in RFC3023, we'd have said "MUST NOT".
14:40:25 [DanC_lap]
CL: revising the finding along those lines seems like a good next step
14:40:47 [DanC_lap]
PC: there may be knock-on effects on webarch
14:40:56 [DanC_lap]
DC: I don't see an opportunity to do that before REC
14:41:00 [DanC_lap]
PC: no, but eventually
14:42:23 [DanC_lap]
CL: ... charset... local disk... xml processor...
14:42:51 [DanC_lap]
... transcoding proxy
14:42:59 [DanC_lap]
... +xml
14:44:59 [DanC_lap]
PC: in sum, CL is continuing to negotiate changes to 3023 ...
14:45:04 [noah]
NM: I asked whether we were going so far as to encourage transcoding of XML into different encodings, while revising the XML declaration appropriately.
14:45:12 [Stuart]
Two questions: 1) Is text/*+xml allowed (discouraged but allowed) 2) Should charset be used with an instance of text/*+xml if it occurs however discouraged?
14:45:25 [noah]
NM: The answer I got was: "IF you choose to transcode, THEN you must keep the decl in sync"
14:45:50 [Chris]
Chris: not encouraging, but recognising that it happens and also, that the +xml convention has value here for unrecognized media types
14:45:56 [DanC_lap]
PC: I subscribed to ietf-xml-mime. how many others? CL
14:46:37 [noah]
NM: I agree with that, but raised another point: "We should note that such transcoding has costs for other reasons: there are situations in which I depend on my XML files being byte-for-byte unmodified (e.g. CVS diffs)."
14:48:43 [DanC_lap]
Re: MIME Type Review Request: image/svg+xml
14:49:11 [Roy]
14:49:54 [DanC_lap]
CL: yes, I'll let the TAG know when the RFC3023 revision merits TAG review or discussion
14:50:35 [Chris]
14:51:05 [DanC_lap]
Fw: XML media types, charset, TAG findings Fri, 08 Oct 2004 10:48:00 +0900
14:51:12 [Chris]
That summarizes what I have been saying
14:52:50 [DanC_lap]
Topic: 2.2.1 Media-Types Issues putMediaType-38
14:53:09 [DanC_lap]
CL: oh yeah... I had an action here...
14:53:43 [Chris]
pointer to the list Paul is projecting?
14:53:59 [DanC_lap]
14:55:04 [Chris]
ACTION: Chris explain why resources that have further server side processing (includes, php, asp etc) might want to have different media type when placed on server and when retrieved from it
14:55:54 [DanC_lap]
DC: likely for monday's telcon? CL: maybe. 1/2hr email, provided I find the 1/2hr...
14:55:54 [Chris]
its a half hour email thing, well try to do in next few daya
14:56:20 [DanC_lap]
Topic: mediaTypeManagement-45 , 2.2.1 Media-Types Issues
14:57:10 [DanC_lap]
reviewing ACTION CL: draft finding on 45
14:57:33 [Chris]
text from minutes
14:58:33 [DanC_lap]
NM asks about raising issues; several encourage him to raise them in www-tag
14:59:05 [Chris]
Chris: note to self, also discuss impossibility of media types for combinations of different document formats (xhtml+matml+svg+etc)
14:59:45 [DanC_lap]
NM: things like application/soap+xml seem to be stretching MIME... people want this mix-in...
15:00:36 [Chris]
Chris: there was asuggestion to do a three way hierarchy, like application/foo/xml or another suggestion was xml/image/foo
15:00:39 [DanC_lap]
... but if I really want to say "this is a SOAP purchase order" the 2-level system doesn't accomodate it well
15:00:55 [Chris]
+xml precludes adding a +somethingelse
15:01:43 [Roy]
q+
15:02:42 [DanC_lap]
NM: decisions like "don't use ..." seem to be made on-the-margin
15:03:16 [DanC_lap]
PC asks about the number of +'s allowed
15:03:51 [DanC_lap]
PC: does RFC3023 restrict it to just one + ?
15:04:03 [DanC_lap]
NM: I think so
15:05:30 [DanC_lap]
NM: is it better not to raise an issue until there's a constructive solution in sight? I wonder, sometimes.
15:05:49 [paulc]
ack Roy
15:05:55 [Chris]
q+
15:06:29 [DanC_lap]
RF: there's a lot of aspects of media types that suggest "let's redesign the whole system..."
15:07:15 [DanC_lap]
... [missed]
15:07:29 [DanC_lap]
PC: why isn't that[?] a comment on RFC3023?
15:08:02 [DanC_lap]
RF: ... image/* is a whole bunch of unrelated formats; media types are a processing declaration more than a format declaration.
15:08:21 [paulc]
ack Chris
15:08:36 [DanC_lap]
... every text/xml thing is also a text/plain thing, but the difference is how you process it
15:08:52 [Roy]
suggested global issue: RethinkingMediaTypes?
15:09:10 [Norm]
I sometimes worry about the whole media type/fragment identifier tangle of issues
15:09:16 [DanC_lap]
CL: there was discussion of application/soap/xml , which is hierarchical, but...
15:09:36 [Stuart]
q+
15:09:55 [Chris]
... but if you extend it fiurther, is application/spap/cml/signed the same as application/soap/signed/xml ?
15:10:09 [DanC_lap]
DC: this seems like issue 45, to me
15:10:26 [DanC_lap]
[this = NM's questions]
15:10:42 [DanC_lap]
CL: I'm glad to work with Chris on this
15:10:50 [Chris]
s/CL/NM
15:11:11 [paulc]
ack Stuart
15:11:16 [DanC_lap]
SW: how does this relate to compound documents?
15:11:37 [DanC_lap]
CL: yes, quite... the html/svg/mathml 2^N stuff...
15:11:43 [DanC_lap]
q+
15:11:52 [Chris]
PC: the 2^n+1 problem
15:12:05 [noah]
FWIW, I think DC has been proven write. 3023 speaks of a suffix of +xml but does not outright prohibit additional "+" signs by my reading. Hang on, I'll copy some pertinent text.,
15:12:08 [DanC_lap]
SW: the compound documents WG seems relevant here
15:12:28 [Chris]
15:12:33 [noah]
When a new media type is introduced for an XML-based format, the name
15:12:33 [noah]
of the media type SHOULD end with '+xml'. This convention will allow
15:12:33 [noah]
applications that can process XML generically to detect that the MIME
15:12:33 [noah]
entity is supposed to be an XML document, verify this assumption by
15:12:33 [noah]
invoking some XML processor, and then process the XML document
15:12:34 [noah]
accordingly. Applications may match for types that represent XML
15:12:36 [noah]
MIME entities by comparing the subtype to the pattern '*/*+xml'. (Of
15:12:39 [noah]
course, 4 of the 5 media types defined in this document -- text/xml,
15:12:40 [noah]
application/xml, text/xml-external-parsed-entity, and
15:12:40 [paulc]
ack DanC_lap
15:12:42 [noah]
application/xml-external-parsed-entity -- also represent XML MIME
15:12:44 [noah]
entities while not conforming to the '*/*+xml' pattern.)
15:12:50 ."
15:13:12 [noah]
Also: "This document recommends the use of a naming convention (a suffix of
15:13:12 [noah]
'+xml') for identifying XML-based MIME media types, whatever their
15:13:12 [noah]
particular content may represent. This allows the use of generic XML
15:13:12 [noah]
processors and technologies on a wide variety of different XML
15:13:12 [noah]
document types at a minimum cost, using existing frameworks for media
15:13:13 [noah]
type registration.
15:13:15 [noah]
Although the use of a suffix was not considered as part of the
15:13:17 [noah]
original MIME architecture, this choice is considered to provide the
15:13:19 [noah]
most functionality with the least potential for interoperability
15:13:21 [noah]
problems or lack of future extensibility. The alternatives to the '
15:13:23 [noah]
+xml' suffix and the reason for its selection are described in
15:13:25 [noah]
Appendix A."
15:14:28 [Roy]
DC: I think it will be nifty if CDF presented their requirement document to TAG
15:14:41 [DanC_lap]
DC: "compund documents" is a huge design space. I'm surprised W3C chartered a WG with a problem that big. I'm interested to have them present their requirements doc to us
15:15:11 [noah]
See above...they really mean use of multiple namespaces that are designed to be mixed and matched.
15:15:20 [Chris]
* Specifications for combining W3C technologies, such as SMIL, SVG and XML Events, with XHTML by reference.
15:15:20 [Chris]
* Specifications for combining W3C technologies, such as XHTML, XML Events, CSS, SVG, SMIL and XForms, into a single document by inclusion.
15:15:28 [Chris]
* Specifications for combining W3C technologies, such as SMIL, SVG and XML Events, with XHTML by reference.
15:15:28 [Chris]
* Specifications for combining W3C technologies, such as XHTML, XML Events, CSS, SVG, SMIL and XForms, into a single document by inclusion.
15:15:43 [Chris]
15:15:50 [noah]
There's good reason to debate the pros and cons of W3C having a working group in that area, but it's a very narrow slide of what I consider compound documents.
15:17:36 [paulc]
1. grounded in good practise 2. make it short
15:18:01 [paulc]
Dan C suggested a finding on mediaType Management-45 should do the above two points
15:18:21 [DanC_lap]
short ~= 5 pages
15:18:54 [DanC_lap]
ACTION SW: coordinate with CDF WG. e.g. requirements presentation plenary week
15:19:00 [Roy]
[note paulc comments were actually paul minuting DC comments]
15:19:45 [DanC_lap]
Topic: 2.2.2 URI and Fragment Issues
15:19:51 [DanC_lap]
of
15:20:04 [DanC_lap]
reviewing ACTION DC: with Norm, develop a finding on httpRange-14 starting with the HashSlashDuality text
15:20:13 [DanC_lap]
NDW: I've done a little work on that
15:20:30 [DanC_lap]
... since preempted by webarch work
15:22:51 [DanC_lap]
NDW/DC: delivery to tag late Jan is our best guess.
15:23:16 [DanC_lap]
ACTION DanC: update 14 in the issues list to put in on an agenda in late jan 2005
15:23:29 [DanC_lap]
Topic: IRIEverywhere-27
15:24:18 [Chris]
Proof that the split we asked for happened
15:24:19 [Chris]
15:24:28 [Chris]
15:24:29 [DanC_lap]
RF: I suggest that this should be marked pending IETF completing IRI spec [something] which is almost done
15:25:14 [Chris]
Under normative references
15:25:15 [Chris]
I-D IRI
15:25:15 [Chris]
Martin Dürst, Michel Suignard, Internationalized Resource Identifiers (IRIs), Internet-Draft, September 2004. (See.
) [NOTE: This reference will be updated once the IRI draft is available as an RFC.]
15:25:55 [Chris]
PC: Schema has anyURI that is defined in terms of XLink
15:26:03 [DanC_lap]
PC: current state is anyURI type in XML Schema...
15:26:04 [Chris]
PC: XLink defines some of IRI
15:26:32 [Chris]
PC: Quaery 1.0 xslt 2.0 xpath 2.0 (the qt specs) all inherit this
15:27:00 [Chris]
CL: so there is already a support of a subset of IRI
15:27:31 [DanC_lap]
ack danc
15:27:31 [Zakim]
DanC_lap, you wanted to note TimBL's questions
15:29:43 [DanC_lap]
DC: to summarize: are there 2 spaces, or one space with 2 encodings?
15:30:10 [DanC_lap]
SW: I've asked MD and found his answers somewhat unsatisfying... he seems to say "both"
15:30:17 [DanC_lap]
CL: both seem to be useful...
15:32:11 [DanC_lap]
RF: I'm unlikely to read the IRI spec again until the IESG approves it. it changed just yesterday
15:33:31 [DanC_lap]
... and the IESG is all but decided.
15:34:04 [Chris]
RF: Once
exists it will be approved
15:34:45 [DanC_lap]
timbl, do you want the action on this?
15:34:59 [DanC_lap]
that is...
15:35:03 [Chris]
all URIs are IRIs, so there is only one identifier space
15:36:02 [DanC_lap]
ACTION RF: notify the TAG when IESG has decided on IRI spec and suggest answers to timbl's questions
15:36:46 [DanC_lap]
-----------
15:36:50 [DanC_lap]
Topic: fragmentInXML-28
15:37:12 [DanC_lap]
swapping in
15:37:22 [DanC_lap]
reviewing Action CL: Write up a summary of the resolution.
15:37:41 [DanC_lap]
CL: I've been hesitant to draft that since the relevant terminology in webarch was changing
15:37:54 [Chris]
but now its stable
15:38:01 [Chris]
'secondary resource' and so on
15:38:21 [Chris]
So I can do this, eta one week
15:38:41 [DanC_lap]
ACTION CL: Write up a summary of the resolution. on fragmentInXML-28 continues.
15:39:10 [DanC_lap]
------
15:39:14 [DanC_lap]
Topic: metadataInURI-31
15:39:25 [Stuart]
15:39:31 [DanC_lap]
reviewing ACTION Stuart revise finding
15:39:49 [DanC_lap]
^30 Nov summary of feedback
15:40:24 [DanC_lap]
ACTION Stuart: revise finding on metadataInURI-31
15:41:13 [DanC_lap]
reviewing PC's action to find out about DO's action
15:41:21 [DanC_lap]
DC suggests withdraw
15:41:29 [DanC_lap]
action PC WITHDRAWN.
15:41:57 [DanC_lap]
SW: ETA xmas
15:42:28 [DanC_lap]
SW: I'm willing to work on this until it's finished, regardless of my term
15:42:41 [DanC_lap]
----
15:42:54 [DanC_lap]
break 'till 10:50
15:43:01 [Zakim]
-Norm
15:53:14 [Chris]
I have just updated
to take into account the xml:id last call
15:54:09 [Norm]
Ugh. Chris did you send the HTML to Ian?
15:59:29 [DanC_lap]
---- resuming from break
15:59:50 [DanC_lap]
Topic: siteData-36
16:00:07 [DanC_lap]
reviewing ACTION2003-01-12
16:00:17 [DanC_lap]
reviewing ACTION2003-01-12 DC Propose example of a site description.
16:00:17 [Zakim]
+Norm
16:03:36 [DanC_lap]
PC finds "Action TB: Beef up use cases in draft finding."
16:05:08 [DanC_lap]
CL: people use "web site" in 2 senses...
16:05:16 [Norm]
q+
16:05:54 [Chris]
scribe: Chris
16:06:04 [paulc]
ack Norm
16:06:17 [paulc]
ack DanC_lap
16:06:21 [Chris]
NW: confused by what chris said, didn't seem to be about sitedata 36
16:06:44 [Chris]
DC: Its derived from robots.txt and p3p and things that saw of parts of the namespace
16:06:51 [Stuart]
little wormholes in URI space
16:07:18 [Chris]
DC: TBray wanted to have a doc that said 'this is a website' and I saifd 'no, its a website description' hence my action
16:08:02 [Chris]
NW: Interested to see a finding in this area
16:08:17 [Chris]
PC: Should we ask TBray about this?
16:36:59 [RRSAgent]
RRSAgent has joined #tagmem
16:37:03 [Ralph]
Ralph has left #tagmem
16:37:20 [DanC_lap]
DC: does the XQuery spec specify how to take the FO namespace URI and a name like concat and make a URI out of it?
16:37:22 [DanC_lap]
PC: no
16:37:25 [DanC_lap]
DC: webarch says you MUST
16:37:49 [DanC_lap]
NDW: I have a proposal that I haven't yet made... to add fragids
16:38:52 [DanC_lap]
PC: let's add this to our todo list, Norm. IR1 thingy.
16:39:25 [dorchard]
dorchard has joined #tagmem
16:39:36 [Chris]
Hi David
16:39:46 [Chris]
We are meeting in a different room this afternoon
16:39:47 [DanC_lap]
David, 346 is the room for after lunch.
16:39:51 [Chris]
joining us for lunch?
16:40:10 [DanC_lap]
(a room number wasn't sufficient for me; I wandered around the building for 10 minutes before somebody held my hand...)
16:40:38 [DanC_lap]
-----
16:40:41 [DanC_lap]
Topic: xlinkScope-23
16:41:51 [DanC_lap]
in basel (
) we made a nearby decision, but not one to close this issue
16:43:36 [DanC_lap]
PC: is this referenced in webarch?
16:43:41 [DanC_lap]
DC: yes, in 4.5.2
16:44:58 [Chris]
----
16:44:59 [Chris]
# xlinkScope-23 : What is the scope of using XLink?
16:45:44 [Chris]
NW: Propose to wait for XLink 1.1 to see what happens
16:46:12 [Stuart]
q+
16:47:46 [Chris]
SKW: Waiting for Liam to cause task force to meet
16:48:00 [noah]
q+ to say we need to know exactly what we'll say if asked about status at the AC mtg
16:51:48 [DanC_lap]
task force charter/genesis...
16:51:58 [Chris]
first real message
16:51:59 [Chris]
16:53:24 [DanC_lap]
DC: no duration. not optimal.
16:53:37 [DanC_lap]
(also no public accountability)
16:53:57 [Chris]
i agree, it needs to have an actual charter, milestones and deliverables
17:00:44 [Chris]
To quote Ian Hikson "I don't really have a good solution though, not even for this very small
17:00:44 [Chris]
problem set ("identify links and classify them as either hyperlinks or
17:00:44 [Chris]
source links, without using external files, and without making it a pain
17:00:44 [Chris]
to use for authors"). D'oh."
17:01:10 [Zakim]
-Norm
17:01:16 [Zakim]
-MIT262
17:06:13 [timbl_]
timbl_ has joined #tagmem
17:08:15 [Stuart]
Bye
17:10:53 [DanC_lap]
DanC_lap has joined #tagmem
17:14:34 [Roy]
Roy has joined #tagmem
17:15:58 [Zakim]
-Stuart
17:15:59 [Zakim]
TAG_f2f()9:00AM has ended
17:16:00 [Zakim]
Attendees were Norm, Stuart, PaulC, DanC, Roy, Noah, Chris
17:58:05 [Chris]
Chris has joined #tagmem
18:03:10 [paulc]
paulc has joined #tagmem
18:03:21 [noah]
scribenick: roy
18:03:32 [noah]
scribenick: Roy
18:08:28 [roy_scribe]
scribenick: roy_scribe
18:10:04 [paulc]
18:10:56 [roy_scribe]
18:11:12 [roy_scribe]
Dave Orchard in attendance
18:11:24 [DanC_lap]
Zakim, who's on the phone?
18:11:24 [Zakim]
I notice TAG_f2f()9:00AM has restarted
18:11:25 [Zakim]
On the phone I see +1.617.324.aaaa
18:11:42 [roy_scribe]
PC chair for this afternoon
18:12:25 [DanC_lap]
Zakim, aaa is G346
18:12:25 [Zakim]
sorry, DanC_lap, I do not recognize a party named 'aaa'
18:12:29 [DanC_lap]
Zakim, aaaa is G346
18:12:29 [Zakim]
+G346; got it
18:12:43 [Zakim]
+Norm
18:13:00 [DanC_lap]
Zakim, G346 holds PaulC, DaveO, RoyF, DanC, Noah, Chris
18:13:00 [Zakim]
+PaulC, DaveO, RoyF, DanC, Noah, Chris; got it
18:13:55 [roy_scribe]
PC: I saw DO's presentation at the conference, a high-level summary -- shall we go through it?
18:16:02 [roy_scribe]
DO's slides are not on-line
18:17:58 [DanC_lap]
Zakim, TimBL just arrived in G346
18:17:58 [Zakim]
+TimBL; got it
18:18:17 [roy_scribe]
PC: DO has 45 minutes
18:18:41 [roy_scribe]
PC: to present
18:18:42 [Zakim]
-Norm
18:19:10 [DanC_lap]
Zakim, remind us in 40 minutes to see if we're going to be done in 45 minutes
18:19:10 [Zakim]
ok, DanC_lap
18:20:17 [timbl]
timbl has joined #tagmem
18:21:42 [DanC_lap]
Updated rough draft finding on extensibility and versioning for F2F
18:22:16 [DanC_lap]
DC: I like the producer/consumer diagram. I wonder why 3 arcs and not 2/4
18:23:09 [DanC_lap]
+1 discussion of substitution rules. I don't care for "ignore" terminology
18:23:44 [DanC_lap]
nice diagram:
18:24:26 [DanC_lap]
hmm... there's a question of _whether_ to use a schema language, not just which one, yes?
18:24:31 .
18:24:58 [Zakim]
+Norm
18:25:20 [Norm]
Norm has joined #tagmem
18:25:44 .
18:25:52 [DanC_lap]
"Others substitution mechanisms exist, such as the fallback model in XSLT." is news to me. a specific section link into the XSLT spec would be nice
18:27:05 [paulc]
Plan for issue 41:
18:27:14 [DanC_lap]
while there are various ways documents can produced/consumed, but the web architecture has one main one, I think.
18:27:45 [paulc]
Aug F2F discussion of issue 41:
18:28:09 [paulc]
Oct F2F discussion of issue 41:
18:28:14 [DanC_lap]
(checking to see if "xml 1.1 is not a compatible change" is noted in the Nov 2004 draft...)
18:28:38 [DanC_lap]
yup... "A good example of an incompatible changed identified as a minor change is XML 1.1."
18:28:51 [DanC_lap]
a citation link would be nice.
18:30:01 [timbl]
XML1.1 is back but nor forwards compatible with 1.0, I assume
18:30:35 [timbl]
Oh, no ... not compatible, when you include the <?xml ele
18:30:48 [DanC_lap]
yes, I don't know why "incompatible" rather than "not forward compatible" was used
18:32:09 [DanC_lap]
(I have an action from another forum to work on a persistence ontology... quite relevant to "version identification" slide)
18:32:31 [timbl]
q+ ask for a more formal treatment in some places. For example, operation of interpreting a doc in language x as if it were in namespace y. XML version numbers and namespaecs don't make this a trvial operaton.
18:33:34 [timbl]
q+ to ask for a more formal treatment in some places. For example, operation of interpreting a doc in language x as if it were in namespace y. XML version numbers and namespaecs don't make this a trvial operaton.
18:33:58 [DanC_lap]
(work in progress:
)
18:34:20 [timbl]
Eg the "Decision" on this slide connects to the transformation rules on anotehr slide to give f/b compatability results.
18:34:58 [timbl]
UBM the example for a change every time anything changes.
18:35:32 [paulc]
QA Spec Guidelines interaction with Issue 41:
18:35:34 [DanC_lap]
"for each compatible version" -- forward or backward? (seems odd to introduce the fwd/back terminology and then not use it)
18:36:26 [timbl]
q+ tim2 to say: Missing concept -- damage involved. Compat can be quntitative, eg when middle name is removed?
18:36:53 [DanC_lap]
hmm... less fuzzy examples might be better, yes.
18:37:06 [timbl]
Universal Business Language
18:37:31 [DanC_lap]
UBL
18:37:54 [DanC_lap]
DO: I sent a comment on UBL asking for [something]
18:38:07 [DanC_lap]
(I wonder what became of that comment; I gather UBL is done-and-dusted)
18:38:40 [DanC_lap]
DO: UBL don't intend to support distributed extensibility
18:39:20 [roy_scribe]
timbl: what happens when entire namespace changes is that people begin programming to specific exceptions (i.e., if the parts I use have not changed, just internally ignore the namespace) -- that has a negative effect on third-party processing
18:39:39 [DanC_lap]
NM: I'd like to discuss this at length; going over examples like UBL might be as important as the solution
18:40:15 [DanC_lap]
... or solutions
18:40:35 [timbl]
timbl: What happens when UBL comes out with a different version is that the application engineers and lawyers look at the specs and contracts and decide whether one can for them be tretawed like the other.
18:44:04 [DanC_lap]
"this is the most common" ... hmm...
18:44:26 [DanC_lap]
NM: are people happy with the ns2 approach? DO: no, prolly not
18:46:09 [DanC_lap]
did I miss a slide about "or use a different schema language"?
18:46:31 [DanC_lap]
or "don't use a schema language"?
18:47:42 [DanC_lap]
"swap trick" .. I don't grok. would have liked a slide on thqat
18:48:00 [DanC_lap]
re slide "CVI Strategy #3..."
18:48:47 [roy_scribe]
slide: Extension Element
18:50:22 [roy_scribe]
slide: Schema V2
18:52:03 [DanC_lap]
(noodling on a set of slides on how RDF addresses these issues: sacrifices handy XML syntax for stuff like order and containership; establishes the "erasure" substituion rule...)
18:52:58 [roy_scribe]
NM: have concerns about focus on existing Schema limitations, rather than on the way forward on general issues
18:54:47 [DanC_lap]
("the current schema language" bugs me. Relax-NG is current. RDF is a W3C REC and addresses many of these issues.)
18:55:11 [roy_scribe]
slide: #5 Incompatibe Extensions
18:56:32 [DanC_lap]
q+ to ask if there are any non-hypothetical examples of "must understand" mechanisms (does new HTTP verbs count? non-WF XML?)
18:57:53 [DanC_lap]
TBL relates "#5..." slide to issue xmlFunctions-NN
18:58:13 [DanC_lap]
xmlfunctions-34
18:58:19 [DanC_lap]
xmlFunctions-34
18:59:08 [stef]
stef has joined #tagmem
18:59:10 [Zakim]
DanC_lap, you asked to be reminded at this time to see if we're going to be done in 45 minutes
18:59:34 [stef]
stef has left #tagmem
19:00:45 [timbl]
The RSS problem of which David speaks in my view follows from defining processing as oppossed to meaning
19:01:19 [DanC_lap]
yes, but defining meaning is only a solution if it answers the processing questions, right, timbl?
19:01:37 [timbl]
Yes, which is does in this case.
19:05:51 [DanC_lap]
DO: I didn't get around to elaborating on RelaxNG and OWL/RDF for these slides, but I wrote a blog entry
19:06:13 [DanC_lap]
PC: the "versioning activities" list is missing QA WG work
19:07:07 [roy_scribe]
DO: plan to do more reference to the QA work in the finding
19:07:50 [roy_scribe]
PC: what QA is proposing is that it would be better if the SOAP spec laid out the specific extensibility points in one section
19:09:11 [roy_scribe]
DO: end of presentation .... questions?
19:09:20 [paulc]
Plan for issue 41:
19:09:27 [noah]
q?
19:09:31 [paulc]
Which of these items are done?
19:09:45 [noah]
q+ to make a number of comments queued up on Dave's presentation
19:10:05 [timbl]
ack tim
19:10:05 [Zakim]
tim2, you wanted to say: Missing concept -- damage involved. Compat can be quntitative, eg when middle name is removed?
19:10:20 [paulc]
ack timbl
19:10:20 [Zakim]
timbl, you wanted to ask for a more formal treatment in some places. For example, operation of interpreting a doc in language x as if it were in namespace y. XML version numbers
19:10:22 [paulc]
q+
19:10:23 [Zakim]
... and namespaecs don't make this a trvial operaton.
19:11:10 [paulc]
I did not ack him twice - I think someone else did.
19:11:40 [paulc]
IRC indicates that timbl himself did the "ack tim"
19:11:56 [DanC_lap]
ah
19:12:19 [roy_scribe]
timbl: the may-ignore extensions are not really ignored -- they are just not processed (kept in some reserve, perhaps)
19:13:30 [roy_scribe]
timbl: you could write down some math that reflect the extension rules using substitutions
19:15:56 [roy_scribe]
timbl: [discussion of other ways to describe forward and backward compatibilty by phrasing it in terms of substution rules]
19:16:36 [roy_scribe]
DC: there are no documents that are both xml 1.0 and 1.1
19:17:06 [roy_scribe]
DC: because the version is labeled with the document [??]
19:18:29 [paulc]
ack noah
19:18:29 [Zakim]
noah, you wanted to make a number of comments queued up on Dave's presentation
19:18:56 [roy_scribe]
noah: there are many shades of gray.
19:19:26 [timbl]
XML 1.1 specifies a language we can call XMLP1.1 whcih is the set of documents an XML 1.1 processor is supposed tro be able to receive, and is union of XML1.0 and XML1.1.
19:19:40 [timbl]
XML1.0 and XML1.1 are incompatable.
19:20:00 [timbl]
XMLP1.1 is backward compatible with XMLp1.0 = XML1.0
19:21:00 [roy_scribe]
noah: my view is that rather than saying there is a binary backwards and forwards-compatibility, they should state the ways in which they will process content
19:21:13 [DanC_lap]
q+ to say I like do's diagram, and I sorta disagree with noah; webarch does have one dominant "processing" model, i.e. publication in the web context.
19:21:30 [DanC_lap]
ack danc
19:21:30 [Zakim]
DanC_lap, you wanted to ask if there are any non-hypothetical examples of "must understand" mechanisms (does new HTTP verbs count? non-WF XML?) and to say I like do's diagram, and
19:21:33 [Zakim]
... I sorta disagree with noah; webarch does have one dominant "processing" model, i.e. publication in the web context.
19:21:49 [noah]
q+ to talk about more of the things I had queued up during dave's talk
19:21:51 [roy_scribe]
noah: there is a bit of a trap in treating it as a binary condition, maybe looking at it as shades of gray would free up the text
19:22:49 [noah]
suggest s/treating it/treating compatibility (e.g. forward compatibility or backward compatibility)/
19:23:11 [roy_scribe]
DC: I like the diagram -- it oversimplifies in ways that are consistent with web architecture
19:23:50 [paulc]
ack paulc
19:24:13 [DanC_lap]
q+ to ask if there are any non-hypothetical examples of "must understand" mechanisms (does new HTTP verbs count? non-WF XML?)
19:24:28 [roy_scribe]
PC: had some high-level questions about the docs sent in e-mail on 26 Nov
19:24:39 [noah]
q+ to mention input from XML Schema WG
19:24:40 [roy_scribe]
19:24:56 [roy_scribe]
PC: missing response to the work plan... how mucch is done?
19:25:00 [paulc]
Plan for issue 41:
19:25:04 [roy_scribe]
s/mucch/much/
19:26:10 [roy_scribe]
DO: I have not done the protocol extensibility and service compatibility (from the work plan message)
19:26:37 [paulc]
Items on the plan not done:
19:26:42 [paulc]
- add protocol extensibility,
19:27:05 [paulc]
- Add material on issue about service compatibility
19:28:08 [roy_scribe]
DO: looking at what can be done to describe compatible/incompatible flags to operation extensions
19:28:10 [DanC_lap]
(glad to know DO is noodling on all this stuff, and that my impression that XML Schema problems was the whole story was mistaken)
19:28:51 [timbl]
Compatible services:
?
19:29:13 [paulc]
Only first item in Part 2 was done:
19:29:28 [paulc]
- insert original xml schema material
19:29:42 [roy_scribe]
noah: first, I think there is a lot of good work here... trying to figure out what is appropriate for a TAG finding
19:30:05 [paulc]
q+
19:32:51 [DanC_lap]
q+ DanC2 to noodle on writing the E+V book breadth-first or depth first, and to lean toward "write about what you know"
19:33:22 [roy_scribe]
noah: there are a set of idioms ... would be stronger if the finding strarted by emphasizing the principle
19:33:30 [timbl]
agenda+ Type-based solutions without <extension> element
19:33:36 [roy_scribe]
noah: up front
19:33:41 [roy_scribe]
19:34:43 [paulc]
Above link is member-only.
19:35:15 [DanC_lap]
(bummer V-F1, VF-2 is member-only; pls send to www-tag, noah)
19:35:29 [roy_scribe]
noah: look for the principles, list the use cases, and treat the issues at a high level before getting into the details of idioms
19:36:41 [paulc]
ack noah
19:36:41 [Zakim]
noah, you wanted to talk about more of the things I had queued up during dave's talk and to mention input from XML Schema WG
19:38:35 [DanC_lap]
ack danc3
19:38:35 [Zakim]
DanC3, you wanted to comment on the barrier to entry to the XML Schema WG
19:38:49 [paulc]
ack DanC3
19:38:51 [roy_scribe]
noah: would like DO to enter the schema group and see the (non-public) scenarios
19:39:41 [timbl]
19:40:04 [roy_scribe]
DC: sympathetic to barrrier to entry in schema WG -- it is natural effect from a wg with 7 years of history
19:40:11
19:41:16 [roy_scribe]
DC: it needs to be made public
19:41:17 [paulc]
ack DanC_lap
19:41:17 [Zakim]
DanC_lap, you wanted to ask if there are any non-hypothetical examples of "must understand" mechanisms (does new HTTP verbs count? non-WF XML?)
19:42:08 [roy_scribe]
DC: are there any examples to provide that show must-understand in practice?
19:42:15 [DanC_lap]
NM: SOAP
19:42:44 [roy_scribe]
Roy: is that SOAP in practice, or just theory?
19:44:18 [roy_scribe]
DO: bulk of use is not in distributed extensibility (planning for other folks extensions)
19:45:51 [roy_scribe]
DO: version identifiers often mean capability rather than format of this message
19:46:20 [roy_scribe]
NM: XML 1.1 is a countter-example (very rare)
19:46:57 [roy_scribe]
NM: flexibility is often in conflict with interoperability
19:47:54 [DanC_lap]
RF: yes, HTTP spec says new verbs are "must understand". except for proxies
19:48:07 [DanC_lap]
DO had a sort of "good question" look. timbl said yes.
19:48:26 [paulc]
ack paulc
19:48:26 [roy_scribe]
NM: M-PUT extensibility mechanism is an example, but not widely deployed
19:49:00 [timbl]
q+ to say there is some connection you could write up between message format extension and protocol extension.
19:49:16 [roy_scribe]
PC: we extracted some text for webarch -- does the updated finding mean that we should change the text in webarch?
19:49:29 [roy_scribe]
DO: no, it is augmentation so far
19:50:36 [roy_scribe]
PC: I think NM was saying that the material in webarch was not high-level enough?
19:51:25 [roy_scribe]
NM: I think there are lots of principles between the levels of webarch and the current content of the draft finding
19:51:50 [roy_scribe]
DO: some are implicit
19:52:22 [roy_scribe]
NM: they should be explicit -- they are the main event when it comes to teaching others how to do extensibility and versioning
19:52:35 [paulc]
Norm: are you still there?
19:52:43 [roy_scribe]
DO: trade-off of breadth vers brevity
19:53:19 [paulc]
ack DanC2
19:53:19 [Zakim]
DanC2, you wanted to noodle on writing the E+V book breadth-first or depth first, and to lean toward "write about what you know"
19:54:29 [roy_scribe]
ACTION noah to work with DO to come up with improved principles and background assumptions that motivate Schema WG
19:54:58 [roy_scribe]
s/Schema WG/versioning finding/
19:56:20 [timbl]
agenda?
19:56:25 [roy_scribe]
DC: glad to see chapter 2, see noah asking for chapter 1, but I'd like to see more discussion of the rest of the problem space beyond issues with schema 1
19:56:38 [DanC_lap]
ACTION DanC: review blog entry on RDF versioning [pointer?]
19:57:11 [roy_scribe]
ACTION noah: work with DO to come up with improved principles and background assumptions that motivate versioning finding
19:57:44 [noah]
q+ to ask about review process for what Dave has written
19:59:54 [roy_scribe]
DC: title is much broader than the topics being discussed in the finding -- what about RELAX NG, OWL/RDF, ...
20:01:55 [roy_scribe]
timbl: can we change the title of the first draft to better reflect the content?
20:03:34 )
20:03:45 [roy_scribe]
PC: xml-binary is an example where we wrote a problem statement and then asked others to form a group -- we could do the same here
20:04:25 [roy_scribe]
timbl: TAG work has be half vertical and half horizontal (finding depth and webarch breadth)
20:04:29 [paulc]
q+
20:04:47 [roy_scribe]
s/be/been/
20:05:52 [roy_scribe]
NM: the schema WG work and TAG's work (through DO) seem to be taking place on different planets, which is unhealthy
20:06:29 [paulc]
ack timbl
20:06:29 [Zakim]
timbl, you wanted to say there is some connection you could write up between message format extension and protocol extension.
20:06:37 [paulc]
ack noah
20:06:37 [Zakim]
noah, you wanted to ask about review process for what Dave has written
20:06:39 [roy_scribe]
DO: there are limitations to what a single volunteer has time to cover
20:06:52 [timbl]
q+ to say there is some connection you could write up between message format extension and protocol extension.
20:07:15 [roy_scribe]
NM: is now the time to focus on this (process wise)?
20:08:17 [Norm]
I'm here
20:08:21 [roy_scribe]
DO: TAG in general has not said what the next step should be (i.e., indicated approval of the outline so far)
20:08:43 [roy_scribe]
NM: how about placing that on the agenda for a specific meeting in January?
20:09:18 [DanC_lap]
+1 the ball is with the readers, not the writers, at the piont
20:09:48 [roy_scribe]
s/piont/point/
20:09:59 [Norm]
I think collecting some solid review would be good
20:10:38 [roy_scribe]
DC: wants this stuff to be public first
20:11:41 [roy_scribe]
NM: will need to check for permission first (no objections likely)
20:12:18 [roy_scribe]
PC: why not just pass the work?
20:13:27 [roy_scribe]
DC: we are talking about joint work because we (Dave, Norm) have invested a lot of work and have (so far) been unable to interface with Schema due to legacy barrier
20:14:08 [roy_scribe]
DC: has Schema done a public working draft?
20:14:22 [roy_scribe]
DO: fails to mention wilcarding stuff
20:14:49 [roy_scribe]
s/wilcarding/widcarding/
20:15:05 [roy_scribe]
s/wilcarding/wildcarding/
20:18:21 [Norm]
q+
20:22:52 [paulc]
q-
20:26:00 [noah]
q?
20:26:26 [paulc]
q+
20:26:35 [paulc]
What we have to decide:
20:26:42 [roy_scribe]
ack timbl
20:26:42 [Zakim]
timbl, you wanted to say there is some connection you could write up between message format extension and protocol extension.
20:27:01 [roy_scribe]
ack Norm
20:27:07 [paulc]
a) when we will review XV Part 1 and when will we discuss the feedback
20:27:17 [timbl]
q?
20:27:21 [paulc]
b) what we need to finish today
20:27:34 [roy_scribe]
ack paulc
20:28:48 [DanC_lap]
agenda?
20:31:45 [Zakim]
-Norm
20:43:24 [Norm]
Norm has joined #tagmem
20:43:33 [Norm]
Still on break?
20:45:36 [roy_scribe]
yes
20:46:45 [Norm]
thx
20:51:40 [roy_scribe]
back from break, returning to discussion on extensibility and version
20:51:43 [roy_scribe]
ing
20:52:01 [Zakim]
+Norm
20:52:05 [Chris]
Chris has joined #tagmem
20:52:15 [Chris]
Daves slides
20:52:17 [Chris]
20:52:28 [Norm]
q+
20:52:58 [paulc]
ack Norm
20:53:40 [roy_scribe]
Norm: I'd like to see feedback from the TAG first
20:54:03 [roy_scribe]
PC: happy to read it on the flight back home
20:56:23 [DanC_lap]
ACTION PC, DC: review nov part 1, 2 of E+V draft finding
20:56:36 [DanC_lap]
... for 10 Jan
20:56:52 [roy_scribe]
ACTION: paulc and DanC to review parts 1 and 2 of extensibility and versioning editorial draft finding prior to discussion for 10 Jan
20:57:45 [roy_scribe]
PC: regarding tech plenary, our discussion earlier suggested that a session on this topic would be good
20:57:56 [Chris]
take two: DO's slides
20:57:57 [Chris]
This is the presentation that Dave Orchard gave at todays TAG meeting.
20:58:06 [Chris]
20:59:29 [roy_scribe]
ACTION: paulc to inform QA and Schema WGs of the new version of the e&v draft
21:00:14 [DanC_lap]
q+ to offer some work on CDF and XML Schema mixing
21:01:02 [noah]
ACTION: Noah to explore means of getting current and future Schema WG work on versioning into public spaces
21:02:01 [noah]
q+ to say we should still watch out for duplicating requirements effort on XSD-specific requirements
21:02:32 [DanC_lap]
(I gather a certain amount of duplication is inevitable, but yes, let's mitigate it to some extent)
21:02:52 [noah]
Agreed...just some discomfort with the spin that as long as there are no patent issues, anything goes
21:02:59 [timbl]
Danc, DaveO may have "substitution groups" mentioned in the existing part2.
21:03:27 [roy_scribe]
q?
21:03:27 [Chris]
q?
21:03:29 [paulc]
ack noah
21:03:29 [Zakim]
noah, you wanted to say we should still watch out for duplicating requirements effort on XSD-specific requirements
21:03:50 [timbl]
So he may have covered this method of doing extensions.
21:04:33 [DanC_lap]
3.3 Substitution Groups
21:05:08 [timbl]
Zakim, take up agendum 1
21:05:08 [Zakim]
agendum 1. "Type-based solutions without <extension> element" taken up [from timbl]
21:05:26 [DanC_lap]
(did you just mean to clear the agenda?)
21:06:55 [DanC_lap]
(the meeting gets to timbls' agenda request...)
21:07:50 [paulc]
ack DanC_lap
21:07:50 [Zakim]
DanC_lap, you wanted to offer some work on CDF and XML Schema mixing
21:09:19 [roy_scribe]
DC: was trying to see if composition of data formats is possible using schema
21:10:57 [Norm]
What file are we looking at?
21:12:00 [Chris]
21:12:16 [Chris]
mathml-renamed.xsd
21:12:40 [Norm]
ty
21:13:02 [Chris]
np
21:13:52 [Chris]
q+ to talk about what HTML did
21:14:59 [roy_scribe]
so is the scribe
21:19:39 [DanC_lap]
(yes, Dave, I think it gets down to fine details about when "compatible" assumes access to a schema)
21:19:45 [roy_scribe]
PC: let's return to open issues
21:19:47 [roy_scribe]
--------
21:20:27 [roy_scribe]
21:20:38 [DanC_lap]
Topic: abstractComponentRefs-37
21:21:29 [roy_scribe]
PC: was pointed out that the document is not yet polished
21:23:39 [roy_scribe]
DC: start with Stuart's null hypothesis: if WSDL has done something and is happy, do we need any further action?
21:24:24 [Chris]
This was the () considered harmful in fragments.....
21:24:28 [roy_scribe]
DO: Roy has an action URIGoodPractice-40
21:25:31 [noah]
q+ to say that schema is chugging along too, if that matters
21:25:40 [DanC_lap]
(I and a few others have been discussing good URI construction practice in a wiki.
)
21:26:49 [roy_scribe]
DO: so, this issue is done unless it needs to be revisted after URIGoodPractice-40
21:27:08 [roy_scribe]
s/revisted/revisited/
21:27:29 [roy_scribe]
q+
21:28:51 [roy_scribe]
ack roy_scribe
21:29:22 [paulc]
ack Chris
21:29:22 [Zakim]
Chris, you wanted to talk about what HTML did
21:29:27 [paulc]
ack noah
21:29:27 [Zakim]
noah, you wanted to say that schema is chugging along too, if that matters
21:30:02 [noah]
FYI: July 2004 Working Draft of XML Schema:Component Designators is at
21:31:51 )
21:39:59 [Norm]
ping?
21:40:07 [DanC_lap]
(yeah! the relevant WGs are talking about it already!)
21:40:12 [paulc]
SW use of SCUDs:
21:40:14 [paulc]
21:40:16 [DanC_lap]
(yay! dan't can't spell yay!)
21:41:01 [DanC_lap]
RF's offer to write on 40 on Jan stands, but there's some questions about the relationship to 37...
21:42:13 [DanC_lap]
TBL: let's change 37 to get rid of the ()'s [?]
21:42:29 [Chris]
q+
21:43:58 [paulc]
ack Chris
21:44:10 [DanC_lap]
DO: let's start a finding on 40 that argues against ()s
21:44:35 [DanC_lap]
CL: ISO MPEG is building a thing of indexing into video based on XPointer-like syntax, using ()s
21:45:31 [Chris]
WebCGM also uses nested parens in fragments
21:45:32 [DanC_lap]
RF: meanwhile, RFC3023 is headed toward endorsing XPointer ()s for all +xml media types.
21:46:12 [DanC_lap]
TBL: I don't follow the argument that LR syntax in fragids is bad
21:46:16 [Chris]
21:46:30 [Chris]
"Pictures and objects (application structures) within a WebCGM are addressed using the mechanism of the URI fragment. These WebCGM rules are derived from and are consistent with the Web protocols defined in RFC-2396."
21:46:40 [Chris]
(BNF follows)
21:46:57 [Chris]
WebCGM 1.0 Second Release
21:46:57 [Chris]
W3C Recommendation, 17 December 2001
21:47:28 [DanC_lap]
RF: URIs ala lsdjflkj#abc(../foo) get parsed wrong; consumers treat / as part of the path
21:47:50 [DanC_lap]
some consumers
21:51:51 [roy_scribe]
---------
21:52:29 [roy_scribe]
21:56:02 [Norm]
q?
21:56:02 [roy_scribe]
DO: can't remember which of XInclude's use of fragments was the issue
21:56:06 [DanC_lap]
agenda + post-meeting scribe duties
21:57:03 [roy_scribe]
DO: brought this up because there was no normative material explaining why what they were doing was unsound
21:57:25 [timbl]
+1
21:57:36 [noah]
FWIW, The AWWW PR says:
21:57:52 [roy_scribe]
NW: as a result of other feedback, XInclude changed its use of fragments and that we may not need to do anything further
21:58:23 [timbl]
q+
21:58:25 [noah]
...never mind...
21:59:02 [noah]
Found it. AWWW says "The Internet Media Type defines the syntax and semantics of the fragment identifier (introduced in Fragment Identifiers (§2.6)), if any, that may be used in conjunction with a representation."
21:59:42 [timbl]
q+ to say that the issue that, as he recalls, was about the way XInclude seemed to be abusing fragids, and that he agreed, and that XInclude was changed. XIncldue itself is a very messy level-breaking part of XML, and so is not a very goo duse case.
21:59:48 [paulc]
ack timbl
21:59:48 [Zakim]
timbl, you wanted to say that the issue that, as he recalls, was about the way XInclude seemed to be abusing fragids, and that he agreed, and that XInclude was changed. XIncldue
21:59:51 [Zakim]
... itself is a very messy level-breaking part of XML, and so is not a very goo duse case.
22:00:28 [roy_scribe]
s/XIncldue//
22:01:18 [roy_scribe]
s/goo duse/good use/
22:02:07 [paulc]
ack DanC_lap
22:02:07 [Zakim]
DanC_lap, you wanted to ask timbl to say, kinda slowly, why he thinks the status quo is correct, and maybe we could RESOLVE that that's the answer to this issue
22:02:49 [roy_scribe]
DC: 1) if the WG was persuaded to change things, I don't mind writing down the argument
22:03:40 [roy_scribe]
DC: 2) if it was just a non-persuaded process decision, then there's no point in going there
22:04:26 [DanC_lap]
I think a TAG decision is worthwhile here.
22:05:36 [noah]
q+
22:09:11 [roy_scribe]
example: href="...chap3#xpointer(h2[3])
22:09:37 [roy_scribe]
example: 200 response from action says the representation is "text/plain"
22:11:54 [noah]
Doesn't it matter if it's href="(h2
[3])
22:13:49 [Chris]
q+ because webarch does not do that
22:16:05 [roy_scribe]
Chris; provides example of math+xml and the desire to identify an SVG view of part of the rendered math
22:17:44 [DanC_lap]
DC asks CL to package that mathml/SVG example up, mail it to the CDF WG and ask them if they're going to solve it or not
22:19:59 [DanC_lap]
DC also pointed out that if the mathml/SVG example had 200 content-type: mathml, then the mathml media type spec would have to specify how the XSLt transformation to SVG interacts with fragid syntax
22:26:02 [roy_scribe]
timbl: use of a URI in a retrieval action has a single meaning that cannot be overridden by something like XInclude just because it appears as an identifier during an inclusion action
22:26:24 [DanC_lap]
ACTION CL: to package that mathml/SVG example up, mail it to the CDF WG and ask them if they're going to solve it or not
22:27:28 [DanC_lap]
next agendum
22:30:02 [paulc]
22:31:32 [paulc]
Paul suggests that meeting record makes clear what issues we did not do at this meeting.
22:31:46 [DanC_lap]
RESOLVED to thank the host! thanks, Amy1
22:31:47 [paulc]
TAG thanks Amy and W3C for hosting our meeting.
22:31:49 [DanC_lap]
Amy!
22:32:36 [DanC_lap]
RRSAgent, make logs world-access
22:32:45 [DanC_lap]
RRSAgent, pointer?
22:32:45 [RRSAgent]
See
22:32:49 [DanC_lap]
Zakim, list attendees
22:32:49 [Zakim]
As of this point the attendees have been +1.617.324.aaaa, Norm, PaulC, DaveO, RoyF, DanC, Noah, Chris, TimBL
22:33:16 [timbl_]
timbl_ has joined #tagmem
22:34:04 [DanC_lap]
DanC_lap has changed the topic to: TAG ftf adjourned.
">
22:34:31 [timbl_]
timbl_ has joined #tagmem
22:38:48 [Zakim]
-Norm
22:38:49 [Zakim]
TAG_f2f()9:00AM has ended
22:38:50 [Zakim]
Attendees were +1.617.324.aaaa, Norm, PaulC, DaveO, RoyF, DanC, Noah, Chris, TimBL
23:22:58 [DanC_lap]
DanC_lap has joined #tagmem | http://www.w3.org/2004/11/30-tagmem-irc | CC-MAIN-2016-44 | refinedweb | 9,027 | 62.41 |
import "github.com/igm/kubernetes/pkg/kubecfg"
Package kubecfg is a set of libraries that are used by the kubecfg command line tool. They are separated out into a library to support unit testing. Most functionality should be included in this package, and the main kubecfg should really just be an entry point.
doc.go kubecfg.go parse.go proxy_server.go resource_printer.go
DeleteController deletes a replication controller named 'name', requires that the controller already be stopped.
LoadClientAuthInfoOrPrompt parses a clientauth.Info object from a file path. It prompts user and creates file if it doesn't exist. Oddly, it returns a clientauth.Info even if there is an error.
ResizeController resizes a controller named 'name' by setting replicas to 'replicas'.
func RunController(ctx api.Context, image, name string, replicas int, client client.Interface, portSpec string, servicePort int) error
RunController creates a new replication controller named 'name' which creates 'replicas' pods running 'image'.
func SaveNamespaceInfo(path string, ns *NamespaceInfo) error
SaveNamespaceInfo saves a NamespaceInfo object at the specified file path.
StopController stops a controller named 'name' by setting replicas to zero.
func Update(ctx api.Context, name string, client client.Interface, updatePeriod time.Duration, imageName string) error
Update performs a rolling update of a collection of pods. 'name' points to a replication controller. 'client' is used for updating pods. 'updatePeriod' is the time between pod updates. 'imageName' is the new image to update for the template. This will work
with the first container in the pod. There is no support yet for updating more complex replication controllers. If this is blank then no update of the image is performed.
HumanReadablePrinter is an implementation of ResourcePrinter which attempts to provide more elegant output.
func NewHumanReadablePrinter() *HumanReadablePrinter
NewHumanReadablePrinter creates a HumanReadablePrinter.
func (h *HumanReadablePrinter) Handler(columns []string, printFunc interface{}) error
Handler adds a print handler with a given set of columns to HumanReadablePrinter instance. printFunc is the function that will be called to print an object. It must be of the following type:
func printFunc(object ObjectType, w io.Writer) error
where ObjectType is the type of the object that will be printed.
Print parses the data as JSON, then prints the parsed data in a human-friendly format according to the type of the data.
PrintObj prints the obj in a human-friendly format according to the type of the obj.
IdentityPrinter is an implementation of ResourcePrinter which simply copies the body out to the output stream.
Print is an implementation of ResourcePrinter.Print which simply writes the data to the Writer.
PrintObj is an implementation of ResourcePrinter.PrintObj which simply writes the object to the Writer.
func LoadNamespaceInfo(path string) (*NamespaceInfo, error)
LoadNamespaceInfo parses a NamespaceInfo object from a file path. It creates a file at the specified path if it doesn't exist with the default namespace.
NewParser creates a new parser.
func (p *Parser) ToWireFormat(data []byte, storage string, decode runtime.Codec, encode runtime.Codec) ([]byte, error)
ToWireFormat takes input 'data' as either json or yaml, checks that it parses as the appropriate object type, and returns json for sending to the API or an error.
type ProxyServer struct { httputil.ReverseProxy }
ProxyServer is a http.Handler which proxies Kubernetes APIs to remote API server.
NewProxyServer creates and installs a new ProxyServer. It automatically registers the created ProxyServer to http.DefaultServeMux.
func (s *ProxyServer) Serve() error
Serve starts the server (http.DefaultServeMux) on TCP port 8001, loops forever.
type ResourcePrinter interface { // Print receives an arbitrary JSON body, formats it and prints it to a writer. Print([]byte, io.Writer) error PrintObj(runtime.Object, io.Writer) error }
ResourcePrinter is an interface that knows how to print API resources.
TemplatePrinter is an implementation of ResourcePrinter which formats data with a Go Template.
func NewTemplatePrinter(tmpl []byte) (*TemplatePrinter, error)
Print parses the data as JSON, and re-formats it with the Go Template.
PrintObj formats the obj with the Go Template.
YAMLPrinter is an implementation of ResourcePrinter which parsess JSON, and re-formats as YAML.
Print parses the data as JSON, re-formats as YAML and prints the YAML.
PrintObj prints the data as YAML.
Package kubecfg imports 25 packages (graph). Updated 2018-04-17. Refresh now. Tools for package owners. | https://godoc.org/github.com/igm/kubernetes/pkg/kubecfg | CC-MAIN-2019-47 | refinedweb | 699 | 52.56 |
This is an autogenerated API Doc for the module "cgiutils".
It was generated on: Monday, January 01 06:46 PM.
def :
Useful for vetting user added information posted to web applications.
Note
Another, possibly more effective, way of coping with spam input to web applications is to use the Akismet Web Service.
For this you can use the Python Akismet API Interface.
def cgiprint(inline='', unbuff=False, line_end='\r\n'): Print to the ``stdout``. Set ``unbuff=True`` to flush the buffer after every write. It prints the inline you send it, followed by the ``line_end``. By default this is ``
`` - which is the standard specified by the RFC for http headers.
def createhtmlmail(subject, html, text=None):
Create a mime-message that will render as HTML or text as appropriate. If no text is supplied we use htmllib to guess a text rendering. (so html needs to be well formed)
Adapted from recipe 13.5 from Python Cookbook 2
def environdata():
Returns some data about the CGI environment, in a way that can be mailed.
def formdecode(thestring):
Decode a single string back into a form like dictionary.
def formencode(theform):
A version that turns a cgi form into a single string. It only handles single and list values, not multipart. This allows the contents of a form requested to be encoded into a single value as part of another request.
def getall(theform, nolist=False):
Passed a form (FieldStorage instance) return all the values. This doesn't take into account file uploads.
Also accepts the 'nolist' keyword argument as getform.
Returns a dictionary.
def getform(valuelist, theform, notpresent='', nolist=False):
This function, given a CGI form, extracts the data from it, based on valuelist passed in. Any non-present values are set to '' - although this can be changed.
It also takes a keyword argument 'nolist'. If this is True list values only return their first value.
Returns a dictionary.
def.
def isblank(indict):
Passed an indict of values it checks if any of the values are set.
Returns True if every member of the indict is empty (evaluates as False).
I use it on a form processed with getform to tell if my CGI has been activated without any values.
def.
def.
def).
def randomstring(length):
Return a random string of length 'length'.
The string is comprised only of numbers and lowercase letters.
def dicitionary key with it's value.
indict can also be a list of tuples instead of a dictionary (or anything accepted by the dict function).
def sendmailme(to_email, msg, email_subject=None, from_email=None, html=True, sendmail='/usr/sbin.
def.
def validemail(email):
A quick function to do a basic email validation. Returns False or the email address. | http://www.voidspace.org.uk/python/weblog/pythonutils/cgiutils.html | CC-MAIN-2018-05 | refinedweb | 451 | 67.96 |
UnetLab Installation
Since UNL is a separate project with its own evolving documentation I won’t try to reproduce it in my blog and I’ll simply refer all my readers to UNL download page, UNL installation instructions and UNL first boot configuration.
At the time of writing UNL is distributed as an image packaged in Open Virtualization Format. I’m using VMWare Workstation as a type-2 hypervisor to import and run this image. Check with the UNL how-to page for the list of currently supported hypervisors.
I’ll be using Cisco IOU as a network device emulator in my topologies. Similarly, you can find IOU installation instructions on UNL website. The rest of this post assumes you’ve got UNL up and running and you can successfully create, start and connect to an IOU device by navigating through native GUI interface.
Installing Python and Dependencies
For development purposes I’ll be using Python 2.7. You’ll need to install a package management system pip to gain access to requests library that we’ll be using to talk HTTP to our REST server. To install requests or any other package using pip on a Windows machine, you can use the following command:
python -m pip install requests
PyCharm and Github integration
There’s a plethora of IDEs available for Python. My personal choice is PyCharm - an open-source IDE with built-in debugger, syntax checker, code completion and GIT integration. Here is how you setup PyCharm to work with Github:
- Create a new repository on Github.
- In PyCharm navigate to
VCS -> Checkout from Version Control -> Github, paste in the link to a newly created repository and click
Clone. This will create a clone of an empty code repository on your local machine. From now on you’ll see two VCS buttons in PyCharm toolbar to pull and push code to Github.
- Add newly created files and directories to git by right-clicking on them and selecting
Git -> Add
- At the end of your work push the code to Github by clicking the green VCS button, write your comment in
Commit messagewindow, enter your Github username in
Authorfield and select
Commit and Push.
- To get the latest version of code from Github click the blue VCS button to pull changes to local directory.
Just remember that your Github repository is your source of truth and you need to push changes to it every time you finish work and pull code from it every time you restart it. It makes sense even if you work alone since it creates a good habit which may come very useful in the future.
For additional information about git workflow and working with Github you can check out (no pun intended) Github help and Github guides.
Project Skeleton
Now that we’ve fully integrated with Github we can setup our basic directory structure. In project Navigation Bar under the project’s main directory create 3 subdirectories:
restunl- to store all code implementing REST SDK logic
samples- to store sample applications
tests- to store test cases for REST SDK
Next we need to tell git which files we DON’T want to track. To do that add filename patterns to
.gitignore file and put this file into every directory. Rule of thumb is to only track your code and not your auxiliary files like compiled python code (.pyc), PyCharm settings (.idea) or local git files (.git).
.idea .git *.pyc
Finally, in order to be able to import code between different directories within the project, we need to add an empty
__init__.py file to each non-root directory which tells Python to treat that directory as a package. The final version of skeleton will look like this:
Before you REST
Here are a few things you need to know about the REST server before you start working with it:
- IP address and Port - the same IP address you use to access UNL from your web browser (in my case it’s 192.168.247.20:80)
- Username and password for authentication - default UNL credentials (admin/unl)
- REST API documentation - in our case it’ll be UnetLab API documentation
Using REST for the first time
Let’s try to query the status of our UnetLab server. According UNL documentation the correct request should look like this:
curl -s -c /tmp/cookie -b /tmp/cookie -X GET -H 'Content-type: application/json'
Take note of the HTTP method (GET) and URL (), we’ll use these values in our test program. Disregard the cookies and Content-type headers for now, we’ll get back to them in the future posts. In our project’s root directory create a
test.py file with the following code:
import requests import json url = '' method = 'GET' response = requests.request(method, url) payload = json.loads(response.content) print payload['code']
This code calls
.request method of requests library and passes in an HTTP method type and the URL. The value returned by this call would be an HTTP response. Since payload is encoded as JSON we need to parse the content of the HTTP response (
response.content) by calling a
.loads method of json library. Once parsed, we can work with any part of JSON payload same way we would with a Python dictionary. If you’ve done everything right, the result of the last print statement should be
200. Feel free to experiment and print, for example, the current version of UNL. Refer to API documentation for the exact structure of the payload.
Conclusion
Now that we’ve setup our development environment we’ll move on to the actual REST SDK development in the next post. Don’t forget to add all your newly created files and directories to git and push them to Github.
All code from this post can be found in my public repository on Github | https://networkop.co.uk/blog/2016/01/03/dev-env-setup-rest/ | CC-MAIN-2020-05 | refinedweb | 978 | 60.65 |
spataspata
spata is a functional tabular data (
CSV) processor for Scala. The library is backed by FS2 - Functional Streams for Scala.
The main goal of the library is to provide handy, functional, stream-based API with easy conversion between records and case classes, completed with precise information about possible flaws and their location in source data for parsing while maintaining good performance. Providing the location of the cause of a parsing error has been the main motivation to develop the library. It is typically not that hard to parse a well-formatted
CSV file, but it could be a nightmare to locate the source of a problem in case of any distortions in a large data file.
The source (while parsing) and destination (while rendering) data format is assumed to conform basically to RFC 4180, but allows some variations - see
CSVConfig for details.
Getting startedGetting started
spata is available for Scala 2.13 and requires at least Java 11.
To use spata you have to add this single dependency to your
build.sbt:
libraryDependencies += "info.fingo" %% "spata" % "<version>"
The latest version may be found on the badge above.
Link to the current API version is available through the badge as well.
Basic usageBasic usage
The whole parsing process in a simple case may look like this:
import scala.io.Source import cats.effect.IO import fs2.Stream import info.fingo.spata.CSVParser import info.fingo.spata.io.Reader case class Data(item: String, value: Double) val records = Stream // get stream of CSV records while ensuring source cleanup .bracket(IO { Source.fromFile("input.csv") })(source => IO { source.close() }) .through(Reader[IO].by) // produce stream of chars from source .through(CSVParser[IO].parse) // parse CSV file with default configuration and get CSV records .filter(_.get[Double]("value").exists(_ > 1000)) // do some operations using Stream API .map(_.to[Data]()) // convert records to case class .handleErrorWith(ex => Stream.eval(IO(Left(ex)))) // convert global (I/O, CSV structure) errors to Either val result = records.compile.toList.unsafeRunSync() // run everything while converting result to list
Another example may be taken from FS2 readme, assuming that the data is stored and written back in
CSV format with two fields,
date and
temp:
import java.nio.file.Paths import scala.io.Codec import cats.effect.{Blocker, ExitCode, IO, IOApp} import fs2.Stream import info.fingo.spata.{CSVParser, CSVRenderer} import info.fingo.spata.io.{Reader, Writer} object Converter extends IOApp { val converter: Stream[IO, Unit] = Stream.resource(Blocker[IO]).flatMap { blocker => implicit val codec: Codec = Codec.UTF8 def fahrenheitToCelsius(f: Double): Double = (f - 32.0) * (5.0 / 9.0) Reader .shifting[IO](blocker) .read(Paths.get("testdata/fahrenheit.txt")) .through(CSVParser[IO].parse) .filter(r => r("temp").exists(!_.isBlank)) .map(_.altered("temp")(fahrenheitToCelsius)) .rethrow .through(CSVRenderer[IO].render) .through(Writer.shifting[IO](blocker).write(Paths.get("testdata/celsius.txt"))) } def run(args: List[String]): IO[ExitCode] = converter.compile.drain.as(ExitCode.Success) }
Modified versions of this sample may be found in error handling and schema validation parts of the tutorial.
More examples of how to use the library may be found in
src/test/scala/info/fingo/spata/sample.
TutorialTutorial
- Parsing
- Rendering
- Configuration
- Reading and writing data
- Getting actual data
- Creating and modifying records
- Text parsing and rendering
- Schema validation
- Error handling
- Logging
ParsingParsing
Core spata operation is a transformation from a stream of characters into a stream of
Records. This is available through
CSVParser.parse method (supplying FS2
Pipe) and is probably the best way to include
CSV parsing into any FS2 stream processing pipeline:
val input: Stream[IO, Char] = ??? val parser: CSVParser[IO] = CSVParser[IO] val output: Stream[IO, Record] = input.through(parser.parse)
In accordance with FS2, spata is polymorphic in the effect type and may be used with different effect implementations (Cats IO, Monix Task, or ZIO ZIO). Please note, however, that Cats Effect
IO is the only effect implementation used for testing and documentation purposes. Type class dependencies are defined in terms of the Cats Effectclass hierarchy. To support effect suspension, spata requires in general
cats.effect.Sync type class implementation for its effect type. Some methods need enhanced type classes to support asynchronous or concurrent computation.
Like in the case of any other FS2 processing, spata consumes only as much of the source stream as required, give or take a chunk size.
Field and record delimiters are required to be single characters. There are however no other assumptions about them - particularly the record delimiter does not have to be a line break and spata does not assume line break presence in the source data - it does not read the data by lines.
If newline (
LF,
\n,
0x0A) is used as the record delimiter, carriage return character (
CR,
\r,
0x0D) is automatically skipped if not escaped, to support
CRLF line breaks.
Fields containing delimiters (field or record) or quotes have to be wrapped in quotation marks. As defined in RFC 4180, quotation marks in the content have to be escaped through double quotation marks.
By default, in accordance with the standard, whitespace characters are considered part of the field and are not ignored. Nonetheless, it is possible to turn on trimming of leading and trailing whitespaces with a configuration option. This differs from stripping whitespaces from resulting field content because it distinguishes between quoted and unquoted spaces. For example, having the following input:
X,Y,Z xxx," yyy ",zzz xxx, yyy ,zzz
without trimming the content of
Y field will be
" yyy " for both records. With trimming on, we get
" yyy " for the first record and
"yyy" for the second.
Please also note, that the following content:
X,Y,Z xxx, " yyy " ,zzz
is correct with trimming on (and produces
" yyy " for field
Y), but will cause an error without it, as spaces are considered regular characters in this case and quote has to be put around the whole field.
Not all invisible characters (notably non-breaking space,
'\u00A0') are whitespaces. See Java
Char.isWhitespace for details.
In addition to the
parse,
CSVParser provides other methods to read
CSV data:
get, to load data into
List[Record], which may be handy for small data sets,
process, to deal with data record by record through a callback function,
async, to process data through a callback function in an asynchronous way.
The three above functions return the result (
List or
Unit) wrapped in an effect and require calling one of the "at the end of the world" methods (
unsafeRunSync or
unsafeRunAsync for
cats.effect.IO) to trigger computation.
val stream: Stream[IO, Char] = ??? val parser: CSVParser[IO] = CSVParser[IO] val list: List[Record] = parser.get(stream).unsafeRunSync()
Alternatively, instead of calling an unsafe function, the whole processing may run through IOApp.
If we have to work with a stream of
Strings (e.g. from FS2
text.utf8Decode), we may convert it to a stream of characters:
val ss: Stream[IO, String] = ??? val sc: Stream[IO, Char] = ss.map(s => Chunk.chars(s.toCharArray)).flatMap(Stream.chunk)
See Reading and writing data for helper methods to get a stream of characters from various sources.
RenderingRendering
Complementary to parsing, spata offers
CSV rendering feature - it allows conversion from a stream of
Records to a stream of characters. This is available through
CSVRenderer.render method (supplying FS2
Pipe):
val input: Stream[IO, Record] = ??? val renderer: CSVRenderer[IO] = CSVRenderer[IO] val output: Stream[IO, Char] = input.through(renderer.render)
As with parsing, rendering is polymorphic in the effect type and may be used with different effect implementations. The renderer has weaker demands for its effect type than parser and requires only the
MonadError type class implementation.
The
render method may encode only a subset of fields in a record. This is controlled by the
header parameter, being optionally passed to the method:
val input: Stream[IO, Record] = ??? val header: Header = ??? val renderer: CSVRenderer[IO] = CSVRenderer[IO] val output: Stream[IO, Char] = input.through(renderer.render(header))
The provided header is used to select fields and does not cause adding header row to output. This is controlled by
CSVConfig.hasHeader parameter and may be induced even for
render method without header argument.
If no explicit header is passed to
render, it is extracted from the first record in the input stream.
The main advantage of using
CSVRenderer over
makeString and
intersperse methods is its ability to properly escape special characters (delimiters and quotation marks) in source data. The escape policy is set through configuration and by default, the fields are quoted only when required.
Like parser, renderer supports any single-character field and record delimiters. As result, the
render method does not allow separating records with
CRLF. If this is required, the
rows method has to be used:
val input: Stream[IO, Record] = ??? val output: Stream[IO, String] = input.through(CSVRenderer[IO].rows).intersperse("\r\n")
The above stream of strings may be converted to a stream of characters as presented in the rendering part.
Unlike
render, the
rows method outputs all fields from each record and never outputs the header row.
See Reading and writing data for helper methods to transmit a stream of characters to various destinations.
ConfigurationConfiguration
CSVParser and
CSVRenderer are configured through
CSVConfig, which is a parameter to their constructors. A more convenient way may be a builder-like method, which takes the defaults and allows altering selected parameters:
val parser = CSVParser.config.fieldDelimiter(';').noHeader.parser[IO] val renderer = CSVRenderer.config.fieldDelimiter(';').noHeader.renderer[IO]
Individual configuration parameters are described in
CSVConfig's Scaladoc.
A specific setting is the header mapping, available through
CSVConfig.mapHeader. It allows replacing original header values with more convenient ones or even defining header if no one is present. When set for the parser, the new values are then used in all operations referencing individual fields, including automatic conversion to case classes or tuples. The mapping may be defined only for a subset of fields, leaving the rest in their original form.
date,max temparature,min temparature 2020-02-02,13.7,-2.2
val stream: Stream[IO, Char] = ??? val parser: CSVParser[IO] = CSVParser.config.mapHeader(Map("max temparature" -> "tempMax", "min temparature" -> "tempMin")).parser[IO] val frosty: Stream[IO, Record] = stream.through(parser.parse).filter(_.get[Double]("minTemp").exists(_ < 0))
It may also be defined for more fields than there are present in any particular data source, which allows using a single parser for multiple datasets with different headers.
There is also index-based header mapping available. It may be used not only to define or redefine header but to remove duplicates as well:
date,temparature,temparature 2020-02-02,13.7,-2.2
val stream: Stream[IO, Char] = ??? val parser: CSVParser[IO] = CSVParser.config.mapHeader(Map(1 -> "tempMax", 2 -> "tempMin")).parser[IO] val frosty: Stream[IO, Record] = stream.through(parser.parse).filter(_.get[Double]("minTemp").exists(_ < 0))
Header mapping may be used for renderer too, to output different header values from those used by
Record or case class:
val stream: Stream[IO, Record] = ??? val renderer: CSVRenderer[IO] = CSVRenderer.config.mapHeader(Map("tempMax" -> "max temparature", "tempMin" -> "min temparature")).renderer[IO] val frosty: Stream[IO, Char] = stream.filter(_.get[Double]("minTemp").exists(_ < 0)).through(renderer.render)
FS2 takes care of limiting the amount of processed data and consumed memory to the required level. This works well to restrict the number of records, nevertheless, each record has to be fully loaded into memory, no matter how large it is. This is not a problem if everything goes well - individual records are typically not that large. A record can, however, grow uncontrollably in case of incorrect configuration (e.g. wrong record delimiter) or malformed structure (e.g. unclosed quotation). To prevent
OutOfMemoryError in such situations, spata can be configured to limit the maximum size of a single field using
fieldSizeLimit. If this limit is exceeded during parsing, the processing stops with an error. By default, no limit is specified.
Reading and writing dataReading and writing data
As mentioned earlier,
CSVParser requires a stream of characters as its input. To simplify working with common data sources, like files or sockets, spata provides a few convenience methods, available through its
io.Reader object.
Similarly,
io.Writer simplifies the process of writing a stream of characters produced by
CSVRenderer to an external destination.
There are two groups of the
read and
write methods in
Reader and
Writer:
basic ones, accessible through
Reader.plainand
Writer.plain, where reading and writing is done synchronously on the current thread,
with support for thread shifting, accessible through
Reader.shiftingand
Writer.shifting.
It is recommended to use the thread shifting version, especially for long reading or writing operations, for better thread pool utilization. See a post from Daniel Spiewak about thread pools configuration. More information about threading may be found in Cats Concurrency Basics.
The simplest way to read data from and write to a file is:
val stream: Stream[IO, Char] = Reader.plain[IO].read(Path.of("data.csv")) // do some processing on stream val eff: Stream[IO, Unit] = stream.through(Writer.plain[IO].write(Path.of("data.csv")))
or even:
val stream: Stream[IO, Char] = Reader[IO].read(Path.of("data.csv")) // Reader.apply is an alias for Reader.plain // do some processing on stream val eff: Stream[IO, Unit] = stream.through(Writer[IO].write(Path.of("data.csv"))) // Writer.apply is an alias for Writer.plain
The thread shifting reader and writer provide similar methods, but require implicit
ContextShift:
implicit val cs: ContextShift[IO] = IO.contextShift(ExecutionContext.global) val stream: Stream[IO, Char] = Reader.shifting[IO].read(Path.of("data.csv")) val eff: Stream[IO, Unit] = stream.through(Writer.shifting[IO].write(Path.of("data.csv")))
The
ExecutionContext provided to
ContextShift is used to switch the context back to the CPU-bound one, used for regular, non-blocking operations, after the blocking I/O operation finishes. The
Blocker, which provides the thread pool for blocking I/O, may be passed to
shifting or will be created internally.
All
read operations load data in chunks for better performance. Chunk size may be supplied while creating a reader:
val stream: Stream[IO, Char] = Reader.plain[IO](1024).read(Path.of("data.csv"))
If not provided explicitly, a default chunk size will be used.
Except for
Source, which is already character-based, other data sources and all data destinations require an implicit
Codec to convert bytes into characters:
implicit val codec: Codec = Codec.UTF8
The caller to a
read or a
write method which takes a resource as a parameter (
Source,
InputStream or
OutputStream) is responsible for its cleanup. This may be achieved through FS2
Stream.bracket:
val stream: Stream[IO, Unit] = for { source <- Stream.bracket(IO { Source.fromFile("data.csv") })(source => IO { source.close() }) destination <- Stream.bracket(IO { new FileOutputStream("data.csv") })(fos => IO { fos.close() }) out <- Reader.shifting[IO].read(source) // do some processing .through(Writer[IO].write(destination)) } yield out
Other methods of resource acquisition and releasing are described in Cats Effect tutorial.
Unlike the
Reader.read method, which creates a new stream,
Writer.write operates on an existing stream. Being often the last operation in the stream pipeline, it has to allow access to the final stream, being a handle to run the entire processing. This is why
write returns a
Pipe, converting a stream of characters to a unit stream.
There is a
by method in
Reader, which returns a
Pipe too. It converts a single-element stream containing data source into a stream of characters:
val stream: Stream[IO, Char] = Stream .bracket(IO { Source.fromFile("data.csv") })(source => IO { source.close() }) .through(Reader.shifting[IO].by)
Getting actual dataGetting actual data
Sole
CSV parsing operation produces a stream of
Records. Each record may be seen as a map from
String to
String, where the keys, forming a header, are shared among all records. The basic method to obtain individual values is through the call to
apply, by key (taken from the header):
val record: Record = ??? val value: Option[String] = record("some key")
or index:
val record: Record = ??? val value: Option[String] = record(0)
CSVRecord supports retrieval of typed values. In simple cases, when the value is serialized in its canonical form, like ISO format for dates, which does not require any additional format information, or the formatting is fixed for all data, this may be done with single-parameter
get function:
val record: Record = ??? val num: Decoded[Double] = record.get[Double]("123.45")
Decoded[A] is an alias for
Either[ContentError, A]. This method requires a
text.StringParser[A], which is described in Text parsing.
get has overloaded versions, which support formatting-aware parsing:
val record: Record = ??? val df = new DecimalFormat("#,###") val num: Decoded[Double] = record.get[Double]("123,45", df)
This method requires a
text.FormattedStringParser[A, B], which is also described in Text parsing. (It uses an intermediary class
Field to provide a nice syntax, this should be however transparent in most cases).
Above methods are available also in unsafe, exception-throwing version, accessible through
Record.unsafe object:
val record: Record = ??? val v1: String = record.unsafe("key") val v2: String = record.unsafe(0) val n1: Double = record.unsafe.get[Double]("123.45") val df = new DecimalFormat("#,###") val n2: Double = record.unsafe.get[Double]("123,45", df)
They may throw
ContentError exception.
In addition to retrieval of single fields, a
Record may be converted to a case class or a tuple. Assuming a
CSV data in the following form:
element,symbol,melting,boiling hydrogen,H,13.99,20.271 helium,He,0.95,4.222 lithium,Li,453.65,1603
the data can be converted from a record directly into a case class:
val record: Record = ??? case class Element(symbol: String, melting: Double, boiling: Double) val element: Decoded[Element] = record.to[Element]()
Notice that not all source fields have to be used for conversion. The conversion is name-based - header keys have to match case class field names exactly, including case. We can use header mapping, described in Configuration, if they do not match.
For tuples, the header has to match tuple field names (
_1,
_2, etc.) and is automatically generated in this form for source data without a header:
hydrogen,H,13.99,20.271 helium,He,0.95,4.222 lithium,Li,453.65,1603
val record: Record = ??? type Element = (String, String, Double, Double) val element: Decoded[Element] = record.to[Element]()
Notice that in this case the first column has been included in the conversion to ensure header and tuple field matching.
Both forms of conversion require implicit
StringParser. Parsers for common types and their default formats are provided through
StringParser object and are automatically brought in scope. Because it is not possible to explicitly provide custom formatter while converting a record into a case class, an implicit
StringParser has to be defined in case of specific formats or types:
element,symbol,melting,boiling hydrogen,H,"13,99","20,271" helium,He,"0,95","4,222" lithium,Li,"453,65","1603"
val record: Record = ??? case class Element(symbol: String, melting: Double, boiling: Double) val nf = NumberFormat.getInstance(new Locale("pl", "PL")) implicit val nsp: StringParser[Double] = (str: String) => nf.parse(str).doubleValue() val element: Decoded[Element] = record.to[Element]()
Creating and modifying recordsCreating and modifying records
A
Record is not only the result of parsing, it is also the source for
CSV rendering. To let the renderer do its work, we need to convert the data to records first. As mentioned above, a
Record is essentially a map from
String (key) to
String (value). The keys form a header, which is, when only possible, shared among records. This sharing is always in effect for records parsed by spata but requires some attention when records are created by application code, especially when performance and memory usage matter.
Creating recordsCreating records
The basic way to create a record is to pass values as variable arguments:
val header = Header("symbol", "melting", "boiling") val record = Record("H","13.99","20.271")(header) val value = record("melting") // returns Some("13.99")
The header length is expected to match the number of values (arguments). If it does not, it is reduced (the last keys are omitted) or extended (tuple-style keys are added).
It is possible to create a record without providing a header and rely on the header that is implicitly generated:
val record = Record.fromValues("H","13.99","20.271") val header = record.header // returns Header("_1", "_2", "_3") val value = record("_2") // returns Some("13.99")
Because the record's header may be needless in some scenarios (e.g. while using the index-based
CSVRenderer.rows method), its implicit creation is lazy - it is postponed until the header is accessed. If the header is created, each record gets its own copy.
A similar option provides record creation from key-value pairs:
val record = Record.fromPairs("symbol" -> "H", "melting" -> "13.99", "boiling" -> "20.271") val value = record("melting") // returns Some("13.99")
This method creates a header per record and it should not be used with large data sets.
All three above methods require record values to be already converted to strings. However, what we often need, is to create a record from typed data, with proper formatting / locale. There are two methods to achieve that.
The first one is to employ a record builder, which allows adding typed values to the record one by one:
val record = Record.builder.add("symbol", "H").add("melting", 13.99).add("boiling", 20.271).get val value = record("melting") // returns Some("13.99")
To convert a typed value to a string, this method requires an implicit
StringRenderer[A], which is described in Text rendering. Similarly to
StringParser, renderers for basic types and formats are provided out of the box and specific ones may be implemented:
val nf = NumberFormat.getInstance(new Locale("pl", "PL")) implicit val nsr: StringRenderer[Double] = (v: Double) => nf.format(v) val record = Record.builder.add("symbol", "H").add("melting", 13.99).add("boiling", 20.271).get val value = record("melting") // returns Some("13,99")
The second method allows direct conversion of cases classes or tuples to records:
case class Element(symbol: String, melting: Double, boiling: Double) val element = Element("H", 13.99, 20.271) val record = Record.from(element) val value = record("melting") // returns Some("13.99")
This approach relies on
StringRenderer for data formatting as well. It may be used even more comfortably by calling a method directly on case class:
val nf = NumberFormat.getInstance(new Locale("pl", "PL")) implicit val nsr: StringRenderer[Double] = (v: Double) => nf.format(v) case class Element(symbol: String, melting: Double, boiling: Double) val element = Element("H", 13.99, 20.271) val record = element.toRecord val value = record("melting") // returns Some("13,99")
A disadvantage of both above methods operating on typed values is header creation for each record. They may be not the optimal choice for large data sets when performance matters.
Modifying recordsModifying records
Sometimes only a few fields of the original record have to be modified and the rest remains intact. In such situations, it may be much more convenient to modify a record instead of creating a new one from scratch, especially for large records. Because spata supports functional code, modifying means the creation of a copy of the record with selected fields set to new values.
The simplest way is to provide a new string value for a record field, referenced by key or index:
val record: Record = ??? val modified: Record = record.updated(0, "new value").updated("key", "another value")
It is also possible to access existing value while updating record:
val record: Record = ??? val modified: Record = record.updatedWith(0)(v => v.toUpperCase).updatedWith("key")(v => v.toUpperCase)
The record provides a method to modify typed values too:
val record: Record = ??? val altered: Either[ContentError, Record] = record.altered("int value")((i: Int) => i % 2 == 0)
or in extended form:
val dateFormat = DateTimeFormatter.ofPattern("dd.MM.yy") implicit val ldsp: StringParser[LocalDate] = (str: String) => LocalDate.parse(str, dateFormat) implicit val ldsr: StringRenderer[LocalDate] = (ld: LocalDate) => dateFormat.format(ld) val record: Record = ??? val altered: Either[ContentError, Record] = for { r1 <- record.altered("field 1")((d: Double) => d.abs) r2 <- r1.altered("field 2")((ld: LocalDate) => ld.plusDays(1)) } yield r2
Please note, however, that this method may produce an error because the source values have to be parsed before being passed to the updating function. To support value parsing and rendering, an implicit
StringParser[A] and
StringRenderer[B] have to be provided for specific data formats.
All the above methods preserve record structure and keep existing record header. It is also possible to modify the structure, if necessary:
val record: Record = ??? val modified: Record = record.patch.remove("field 1").add("field 10", 3.14).get
Record.patch employs
RecordBuilder to enhance or reduce record. See Creating records above for more information.
Text parsing and renderingText parsing and rendering
CSV data is parsed as
Strings. We often need typed values, e.g. numbers or dates, for further processing. There is no standard, uniform interface available for Scala or Java to parse strings to different types. Numbers may be parsed using
java.text.NumberFormat. Dates and times through
parse methods in
java.time.LocalDate or
LocalTime, taking format as an argument. This is awkward when providing a single interface for various types as
Record does. This is the place where spata's
text.StringParser comes in handy.
The situation is similar when typed values have to be converted to strings to create
CSV data. Although there is a
toString method available for each value, it is often insufficient, because a specific format of dates, numbers, and other values may be required. Again, there is no single interface for encoding different types into strings. spata provides
text.StringRenderer to help with this.
Similar solutions in other libraries are often called
Decoder and
Encoder in place of
Parser and
Renderer.
Parsing textParsing text
StringParser object provides methods for parsing strings with default or implicitly provided format:
val num: ParseResult[Double] = StringParser.parse[Double]("123.45")
where
ParseResult[A] is just an alias for
Either[ParseError, A].
When a specific format has to be provided, an overloaded version of the above method is available:
val df = new DecimalFormat("#,###") val num: ParseResult[Double] = StringParser.parse[Double]("123,45", df)
(It uses intermediary class
Pattern to provide nice syntax, this should be however transparent in most cases).
These functions require implicit
StringParser or
FormattedStringParser respectively. Implicits for a few basic types are already available - see Scaladoc for
StringParser. When additional parsers are required, they may be easily provided by implementing
StringParser or
FormattedStringParser traits.
Let's take
java.sql.Date as an example. Having implemented
StringParser[Date]:
implicit val sdf: StringParser[Date] = (s: String) => Date.valueOf(s)
we can use it as follows:
val date = StringParser.parse[Date]("2020-02-02")
Defining a parser with support for custom formatting requires the implementation of
FormattedStringParser:
implicit val sdf: FormattedStringParser[Date, DateFormat] = new FormattedStringParser[Date, DateFormat] { override def apply(str: String): Date = Date.valueOf(str.strip) override def apply(str: String, fmt: DateFormat): Date = new Date(fmt.parse(str.strip).getTime) }
and can be used as follows:
val df = DateFormat.getDateInstance(DateFormat.SHORT, new Locale("pl", "PL")) val date = StringParser.parse[Date]("02.02.2020", df)
Please note that this sample implementation accepts partial string parsing, e.g.
"02.02.2020xyz" will successfully parse to
2020-02-02. This is different from the built-in parsing behavior for
LocalDate, where the entire string has to conform to the format.
Parsing implementations are expected to throw specific runtime exceptions when parsing fails. This is converted to
ParseError in
StringParser object's
parse method while keeping the original exception in the
cause field.
Although this design decision might be seen as questionable, as returning
Either instead of throwing an exception could be the better choice, it is made deliberately - all available Java parsing methods throw an exception, so it is more convenient to use them directly while implementing
StringParser traits, leaving all exception handling in a single place, i.e. the
StringParser.parse method.
Rendering textRendering text
Rendering is symmetrical with parsing.
StringRenderer object provides methods for rendering strings with default or implicitly provided format:
val str: String = StringRenderer.render(123.45)
When a specific format has to be provided, an overloaded version of the above method is available:
val df = new DecimalFormat("#,###") val str: String = StringRenderer.render(123.45, df)
These functions require implicit
StringRenderer or
FormattedStringRenderer respectively. Implicits for a few basic types are already available - see Scaladoc for
StringRenderer. When additional renderers are required, they may be easily provided by implementing
StringRenderer or
FormattedStringRenderer traits.
Let's take again
java.sql.Date as an example. Having implemented
StringRenderer[Date]:
implicit val sdf: StringRenderer[Date] = (d: Date) => if(d == null) "" else d.toString
we can use it as follows:
val date = Date.valueOf(LocalDate.now) val str = StringRenderer.render(date)
Defining a renderer with support for custom formatting requires the implementation of
FormattedStringRenderer:
implicit val sdf: FormattedStringRenderer[Date, DateFormat] = new FormattedStringRenderer[Date, DateFormat] { override def apply(date: Date): String = date.toString override def apply(date: Date, fmt: DateFormat): String = fmt.format(date) }
and can be used as follows:
val df = DateFormat.getDateInstance(DateFormat.SHORT, new Locale("pl", "PL")) val date = Date.valueOf(LocalDate.now) val str = StringRenderer.render(date, df)
Schema validationSchema validation
Successful
CSV parsing means that the underlying source has the correct format (taking into account parser configuration). Nonetheless, the obtained records may have any content - being a collection of strings they are very permissive. We often require strict data content and format to be able to use it in accordance with our business logic. Therefore spata supports basic fields' format definition and validation.
CSV schema can be defined using
schema.CSVSchema:
val schema = CSVSchema() .add[String]("symbol") .add[LocalDateTime]("time") .add[BigDecimal]("price") .add[String]("currency")
Schema is basically specified by the names of expected
CSV fields and their data types.
We do not need to include every field from the
CSV source in the schema definition. It is enough to do it only for those fields we are interested in.
Schema is validated as part of a regular stream processing pipeline:
val schema = ??? val stream: Stream[IO, Char] = ??? val validatedStream = stream.through(CSVParser[IO].parse).through(schema.validate)
As a result of the validation process, the ordinary
CSV
Record is converted to
ValidatedRecord[T], which is an alias for
Validated[InvalidRecord, TypedRecord[T]]. The parametric type
T is the compile-time, shapeless based representation of the record data type. Because it depends on the schema definition and is quite elaborate, we are not able to manually provide it - we have to let the compiler infer it. This is why the type signatures are omitted from some variable definitions in code excerpts in this chapter. Although the compiler infers the types correctly, the IDEs and linters often wrongly report problems with the source code. Please do not be held back by red marks in your code editor.
Validated is a Cats data type for wrapping validation results. It is similar to
Either, with
Valid corresponding to
Right and
Invalid to
Left, but more suitable for validation scenarios. Please reach for Cats documentation for an in-depth introduction.
The compile-time nature of this process makes future record handling fully type-safe:
val validatedStream = ??? validatedStream.map { validated => validated.map { typedRecord => val symbol: String = typedRecord("symbol") val price: BigDecimal = typedRecord("price") // ... } }
Please notice, that in contrast to the regular record, where the result is wrapped in
Decoded[T], we always get the straight type out of typed record. If we try to access a non-existing field (not defined by schema) or assign it to a wrong value type, we will get a compilation error:
val typedRecord = ??? val price: BigDecimal = typedRecord("prce") // does not compile
The key (field name) used to access the record value is a literal type. To be accepted by a typed record, the key has to be a literal value or a variable having a singleton type:
val typedRecord = ??? val narrow: "symbol" = "symbol" // singleton val wide = "symbol" // String val symbol1 = typedRecord("symbol") // OK val symbol2 = typedRecord(narrow) // OK val symbol3 = typedRecord(wide) // does not compile
Typed records, similarly to regular ones, support conversion to case classes:
case class StockPrice(symbol: String, price: BigDecimal) val typedRecord = ??? val stockPrice: StockPrice = typedRecord.to[StockPrice]()
Like in the case of regular records, the conversion is name-based and may cover only a subset of a record's fields. However, in contrast to a regular record, the result is not wrapped in
Decoded anymore.
A field declared in the schema has to be present in the source stream. Moreover, its values, by default, must not be empty. If values are optional, they have to be clearly marked as such in the schema definition:
val schema = CSVSchema() .add[String]("symbol") .add[Option[LocalDateTime]]("time")
Please note, that this still requires the field (column) to be present, only permits it to contain empty values.
While processing a validated stream, we have access to invalid data as well:
val validatedStream = ??? validatedStream.map { validated => validated.map { typedRecord => val price: BigDecimal = typedRecord("price") // ... }.leftMap { invalid => val price: Option[String] = invalid.record("price") // ... } }
(the above
map/
leftMap combination may be simplified to
bimap).
Schema validation requires string parsing, described in the previous chapter. Similarly to the conversion to case classes, we are not able to directly pass a formatter to the validation, so a regular
StringParser implicit with the correct format has to be provided for each parsed type. All remarks described in Text parsing and rendering apply to the validation process.
Type verification, although probably the most important aspect of schema validation, is often not the only constraint on
CSV required to successfully process the data. We often have to check if the values match many other business rules. spata provides a mean to declaratively verify basic constraints on the field level:
val schema = CSVSchema() .add[String]("symbol", LengthValidator(3, 5)) .add[LocalDateTime]("time") .add[BigDecimal]("price", MinValidator(BigDecimal(0.01))) .add[String]("currency", LengthValidator(3))
Records that do not pass the provided schema validators render the result invalid, as in the case of a wrong type.
It is possible to provide multiple validators for each field. The validation process for a field is stopped on the first failing validator. The order of running validators is not specified. Nevertheless, the validation is run independently for each field defined by the schema. The returned
InvalidRecord contains error information from all incorrect fields.
The validators are defined in terms of typed (already correctly parsed) values. A bunch of typical ones is available as part of
info.fingo.spata.schema.validator package. Additional ones may be provided by implementing the
schema.validator.Validator trait.
The converter example presented in Basic usage may be improved to take advantage of schema validation:
import java.nio.file.Paths import java.time.LocalDate import scala.io.Codec import cats.effect.{Blocker, ExitCode, IO, IOApp} import fs2.Stream import info.fingo.spata.{CSVParser, CSVRenderer, Record} import info.fingo.spata.io.{Reader, Writer} import info.fingo.spata.schema.CSVSchema object Converter extends IOApp { val converter: Stream[IO, Unit] = Stream.resource(Blocker[IO]).flatMap { blocker => implicit val codec: Codec = Codec.UTF8 val schema = CSVSchema().add[LocalDate]("date").add[Double]("temp") def fahrenheitToCelsius(f: Double): Double = (f - 32.0) * (5.0 / 9.0) Reader .shifting[IO](blocker) .read(Paths.get("testdata/fahrenheit.txt")) .through(CSVParser[IO].parse) .through(schema.validate) .map { _.leftMap(println).map { tr => val date = tr("date") val temp = fahrenheitToCelsius(tr("temp")) Record.builder.add("date", date).add("temp", temp).get }.toOption } .unNone .through(CSVRenderer[IO].render) .through(Writer.shifting[IO](blocker).write(Paths.get("testdata/celsius.txt"))) } def run(args: List[String]): IO[ExitCode] = converter.compile.drain.as(ExitCode.Success) }
Error handlingError handling
There are three types of errors that may arise while parsing
CSV:
Various I/O errors, including but not limited to
IOException. They are not directly related to parsing logic but
CSVis typically read from an external, unreliable source. They may be raised by
Readeroperations.
Errors caused by malformed
CSVstructure reported as
StructureException. They may be caused by
CSVParser's methods.
Errors caused by unexpected / incorrect data in record fields reported as
HeaderErroror
DataError. They may result from interactions with
Record. Alternatively, when schema validation is in use, this type of error results in
InvalidRecordwith
SchemaErrors (one per each field) being yielded. More precisely,
HeaderErrorand
DataErrorare wrapped in
TypeErrorwhile any custom validation problem is reported as
ValidationError.
The two first error categories are unrecoverable and stop stream processing. For the
StructureException errors, we can precisely identify the place that caused the problem. See Scaladoc for
CSVException for further information about the error location.
The last category is reported on the record level and allows for different handling policies. Please notice, however, that if the error is not handled locally (e.g. using safe functions returning
Decoded) and propagates through the stream, further processing of input data is stopped, like for the above error categories.
As for rendering, there are basically two types of errors possible:
Errors caused by missing records keys, including records of different structures rendered together. They are reported on record level with
HeaderError.
Similarly to parsing, various I/O errors, when using
Writer.
Errors are raised and should be handled by using the FS2 error handling mechanism. FS2 captures exceptions thrown or reported explicitly with
raiseError and in both cases is able to handle them with
handleErrorWith. To fully support this,
CSVParser and
CSVRenderer require the
RaiseThrowable type class instance for its effect type, which is covered with
cats.effect.Sync type class for the parser.
The converter example presented in Basic usage may be enriched with explicit error handling:
import java.nio.file.Paths import scala.io.Codec import scala.util.Try import cats.effect.{Blocker, ExitCode, IO, IOApp} import fs2.Stream import info.fingo.spata.{CSVParser, CSVRenderer, Record} import info.fingo.spata.io.{Reader, Writer} object Converter extends IOApp { val converter: Stream[IO, ExitCode] = Stream.resource(Blocker[IO]).flatMap { blocker => def fahrenheitToCelsius(f: Double): Double = (f - 32.0) * (5.0 / 9.0) implicit val codec: Codec = Codec.UTF8 val src = Paths.get("testdata/fahrenheit.txt") val dst = Paths.get("testdata/celsius.txt") Reader .shifting[IO](blocker) .read(src) .through(CSVParser[IO].parse) .filter(r => r("temp").exists(!_.isBlank)) .map { r => for { date <- r.get[String]("date") fTemp <- r.get[Double]("temp") cTemp = fahrenheitToCelsius(fTemp) } yield Record.builder.add("date", date).add("temp", cTemp).get } .rethrow .through(CSVRenderer[IO].render) .through(Writer.shifting[IO](blocker).write(dst)) .fold(ExitCode.Success)((z, _) => z) .handleErrorWith { ex => Try(dst.toFile.delete()) Stream.eval(IO(println(ex)) *> IO(ExitCode.Error)) } } def run(args: List[String]): IO[ExitCode] = converter.compile.lastOrError }
The
rethrow method in the above code raises an error for
Left, converting
Either to simple values.
Sometimes we would like to convert a stream to a collection. We should wrap the result in
Either in such situations to distinguish successful processing from erroneous one. See the first code snippet in Basic usage for sample.
LoggingLogging
Logging is turned off by default in spata (no-op logger) and may be activated by defining implicit
util.Logger, passing an SLF4J logger instance to it:
val slf4jLogger = LoggerFactory.getLogger("spata") implicit val spataLogger: Logger[IO] = new Logger[IO](slf4jLogger)
spata does not create per-class loggers but uses the provided one for all logging operations.
All logging operations are deferred in the stream effect and executed as part of effect evaluation, together with main effectful operations.
The logging is currently limited to only a few events per parsed
CSV source (single
info entry, a couple of
debug entries, and possibly an
error entry). There are no log events generated per
CSV record. No stack trace is recorded for
error events.
The
debug level introduces additional operations on the stream and may slightly impact performance.
No parsed data is explicitly written to the log. This can however occur when the
CSV source is assumed to have a header row, but it does not. The first record of data is then assumed to be the header and is logged at debug level. Please do not use the debug level if data security is crucial.
AlternativesAlternatives
For those who need a different characteristic of a
CSV library, there are a few alternatives available for Scala:
- Itto-CSV -
CSVhandling library based on FS2 and Cats with support for case class conversion.
- fs2 data - collection of FS2 based parsers, including
CSV.
- kantan.csv - well documented
CSVparser/serializer with support for different parsing engines.
- scala-csv - easy to use
CSVreader/writer.
CreditsCredits
spata makes use of the following tools, languages, frameworks, libraries and data sets (in alphabetical order):
- Cats Effect licensed under Apache-2.0 /C
- Codecov available under following Terms of Use /D
- FS2 licensed under MIT /C
- Git licensed under GPL-2.0 /D
- GitHub available under following Terms of Service /D
- Gitter available under following Terms of Use /D
- http4s licensed under Apache-2.0 /S
- IntelliJ IDEA CE licensed under Apache 2.0 /D
- javadoc.io licensed under Apache-2.0 /D
- Mars weather data made publicly available by NASA and CAB /T
- Metals licensed under Apache-2.0 /D
- OpenJDK licensed under GPL-2.0 with CE /C
- sbt licensed under BSD-2-Clause /D
- sbt-api-mappings licensed under Apache-2.0 /D
- sbt-dynver licensed under Apache-2.0 /D
- sbt-header licensed under Apache-2.0 /D
- sbt-pgp licensed under BSD-3-Clause /D
- sbt-scoverage licensed under Apache-2.0 /D
- sbt-sonatype licensed under Apache-2.0 /D
- Scala licensed under Apache-2.0 /C
- Scalafix licensed under BSD-3-Clause /D
- Scalafmt licensed under Apache-2.0 /D
- ScalaMeter licensed under BSD-3-Clause /T
- ScalaTest licensed under Apache-2.0 /T
- shapeless licensed under Apache-2.0 /C
- SLF4J licensed under MIT /C
- sonatype OSSRH available under following Terms of Service /D
- Travis CI available under following Terms of Service /D
/C means compile/runtime dependency, /T means test dependency, /S means source code derivative and /D means development tool. Only direct dependencies are presented in the above list. | https://index.scala-lang.org/fingo/spata/spata/0.7.2?target=_2.13 | CC-MAIN-2021-43 | refinedweb | 7,030 | 50.23 |
Hi all,
I have noticed There is lot of different strings in drop down button . For example there "In Progress", "Not started", "deferred", etc...
I would like to simply this drop down button. It should conatin only 3 strings "Not started", "accept","refuse".
Accept and refuse would be the same as Complete. The difference will be that behind the code "Accept" would call a different url than "refuse".
How can I achieve this ?
Answer 1
The built-in enumerations, such as those for the task Status property, cannot be changed.
The other solutions available depend on your Outlook version and whether you're doing this for your personal use or as part of an add-in to be distributed to others.
Answer 2
Thanks Sue.
I am using Outlook 2007. It will be distributed to others.
Answer 3
Answer 4
Hi,
Is there a way to add or remove (hide) buttons from the Project Web App ribbon using code, such as JScript or C#, at run-time? Or is using elements.xml the only supported way of doing this?
Thanks,
Arnar
Hello im pretty new to programming so i'm gonna try to explain my problem as best i can
what i am trying to do is i have taken the text of a web page source and have added all the lines to a list box. i have successfully been able to get whatever item in that list box that contains say ":1080" to be added to another list box. my problem
is that im trying to add only the numbers 0 - 0 and . and : from the selected items.
the purpose of what i am programming takes the following example:
75.73.245.70:27977<br />
75.73.32.124:27977<br />
75.74.186.127:27977<br />
131 | Live | 67.171.118.168:27977 | Time: 0.508375 | City: Brigham City |
and then adds only the the ip addresses in the list like follows:
75.73.245.70:27977
75.73.32.124:27977
75.74.186.127:27977
67.171.118.168:27977
the following code i am using to do what i have been able to do is as follows:
Private Sub Button2_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles Button2.Click
Try
Catch
End Try
For i = 0 To ListBox4.Items.Count - 1
ListBox4.SetSelected(i, True)
If ListBox4.SelectedItem.contains(ComboBox2.SelectedItem) Then
ListBox1.Items.Add(ListBox4.SelectedItem)
ListBox4.SelectedItem = i
End If
End Sub
i was wondering if somoene can help me with the coding to do what i am trying to do.
thank you in advance
What I'm trying to do:
I'm working in SharePoint 2010 with SPD2010 and InfoPath 2010.
I have two lists - one for proposed investment projects and one for votes. I have set up all the necessary lookup fields between these two lists. I'm trying to find a way so that when a user sees a project they want to vote for they can click
a button or link on that projects row in the view and have it take them to the newform.aspx of the child list (Votes). I also want to add some parameters to that URL link so that the child form pre-populates the "Proposal Name" field which is the
lookup relationship between the two lists:
What I have done that is working fine:
In Project Server 2007, once a task is complete is there a way to remove the task from the My Tasks view (without removing the actual hours).
I know you can limit the tasks in the view by using the 'show only current tasks' filter - is that the only way to not see the compelted task.
Texas Tonie
Hi
I am writing a small application which has 3 buttons with names, Button1, Button2 and Button3 and each of them has a click event association Button1_click(), Button2_Click() and Button3_Click().
Each of these click events do some kind of job.
On the same form I have a textbox and another Button named ButtonCaller. When I click on ButtonCaller, I want the click function of Button1, Button2 or Button3 to be called, depending on what text I gave in the Textbox. Hence if textbox.text is Button1,
then Button1_Click() should be called, if Button2 then Button2_Click() should be called.
An easy way out was to use switch case statements inside the Button4 click function as below
switch(textbox.texxt)
{
case "button1": Button1_Click(); break;
case "button2": Button2_Click(); break;
....
This way is not extensible, because adding the 4th button is a process. How can I invoke the ButtonX_Click() depending on the text in the textbox.
Thanks in advance.
Vincent
I have found numerous forums postings for this issue all over the web, but none of them have solved my problem. I have a setup and deployment project in Visual Studio 2008 that does not remove pervious versions of the application from the Add/Remove
Programs list like it did with VS 2005. Piecing together recommendations from all the forums I've found, these are the settings I've used:
Main project > Properties > Application Tab - keep Assembly name and Root namespace the same.
Main project > Properities > Application Tab > Assembly Information - increment both Assembly Version and File Version to next major version number.
Setup project > Properties - keep UpgradeCode the same.
Setup project > Properties - increment the Version to match the Assembly and File Versions to indicate a major revision. Then I clicked Yes when prompted to let VS generate a new ProductCode.
Setup project > Properties - DetectNewerInstalledVersion, RemovePreviousVersions, and InstallAllUsers all set to True in both setup projects.
I also tried using Orca to set the RemoveExistingProducts sequence to 1525 and then to 1450 to force the uninstall. But nothing is working. Please help.
Hello,
I am faced with a strange issue. One of our customers tried uninstalling our product and the uninstallation was always rolling back.
So he went ahead and ran a couple of cleanup steps ,which otherwise the installer would have taken care of during uninstallation.However now the product registration is not cleaned from the windows installer database. So the customer continues to see the
entries for our product in the Add/Remove programs applet.
The customer now wants to reinstall our product and the installer detects that the product is installed and goes into maintenance mode.
He also wants the add/remove entries to be cleaned up.
Here were my suggestions:
1)Use the windows installer cleanup tool - The customer is not ready to use this.
2)Use msizap - Not yet conveyed to the customer. However i am not sure if the customer would agree to this.
3)Provide the customer with a utility which would cleanup the windows installer registration entries.
I am now pursuing the third option.
Here are the steps i am performing in the cleanup utility:
1)Cleanup the registration entries under HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\<Product GUID>
2) Cleanup the registration entries under HKEY_CLASSES_ROOT\Installer\Products\<GUID>
I observed that cleaning up the registry key as described in step 2 removed the entries in the Add/Remove programs.
Questions:
1)Is there an API/set of API's which i could use to cleanup the windows installer registration?
2)HKEY_CLASSES_ROOT\Installer\Products\<GUID>
How do i locate this registry key? What is this registry key? How is this generated?
Obviously, the Microsoft provided cleanup tools have some mechanism by which they locate this registry key.Does anyone know of the same.
I am dead stuck here. Any help would be very much appreciated.
Regards,
Kiran Hegde
I implemented the FeatureDeactivating event just like the activated event except I used the Remove() method instead of Add(). From all the articles I found this is what you're supposed to do, but perhaps I'm missing something. I also tried removing
all modifications for a specific owner, which resulted in duplicating every modification that owner made. Everything seems to suggest that the Remove() method is actually adding entries.
Here is my code, can someone tell me if I've done someting wrong or if this is a bug?
using System;
using System.Runtime.InteropServices;
using System.Security.Permissions;
using Microsoft.SharePoint;
using Microsoft.SharePoint.Security;
using Microsoft.SharePoint.Administration;
namespace Sample.Features.Feature2
{
[Guid("3eac000f-333d-4ee2-a961-2eda341b6c66")]
public class Feature2EventReceiver : SPFeatureReceiver
{
public override void FeatureActivated.Add(config);
app.WebService.ApplyWebConfigModifications();
app.Update();
}
public override void FeatureDeactivating.Remove(config);
app.WebService.ApplyWebConfigModifications();
app.Update();
}
//)
//{
//}
}
}
A user created a work Item in a proposed state. Any users even admins can not change the state in the Status area of the Team Web Acces. If the same user opens the bug in Visaul Studio 2010 there is no issue. The drop downs for
Title and Area path work. The only issue is the (Assigned to:, Severity:, Priority:, State:, & Reason:) drop downs won't work. Any Ideas what is happening?
I have disconnected (removed access) from HealthVault. how to find disconnected member status when the member login into my phr
Regards
Madhavi
I use .NET reflector to view the disasembled code of the methods in String class. Interestingly, I find the String.Equals(string, string) and String.op_Equality(string, string) calls each other, and to my knowledge, this would lead to a StackOverflowException.
Here is the code from .NET reflector:
publicstaticbooloperator==(string a, string b)
{
returnEquals(a, b);
}
publicstaticboolEquals(string a, string b)
{
return ((a == b) || (((a != null) && (b != null)) && EqualsHelper(a, b)));
}
Can someone explain why it works?
publicstaticboolEquals(string a, string b)
{
return ((a == b) || (((a != null) && (b != null)) && EqualsHelper(a, b)));
}
We are using OOB Approval Workflow. When the user gets a task to approve, the Title of the document is present in the Task. Is there a way to provide link to the document property as well in the Task List. Will the approval workflow need to be
customized for this?
Also, in the OOB Approval workflow the email sent to the Approvers has "Open this Task" which is not a link. If a user is on Outlook 2003 they will not be able to take any action on the Task from Outlook because Outlook 2003 does not have the Ribbon interface
with the Edit this Task button. Is there a work around for this?
Thanks!
I've a drop down menu for one of my fields in my list. I want to delete some of the choices from the dropdown but am a bit concerned about the consequences. As far as I can tell, if I delete a choice it will delete it from all already submitted items that
have used that choice. Is there any alternative to this? Can I hide a choice or something?
Hope that is clear, all suggestions welcome
Claire
I logged in as myself to sqlserver 2008. Then another user asked me to disconnect so that he could use my compuer, and he used his id to connect my computer. Now when I login, there is an option to use my own id or his. How can I
remove his id?
Thank you for your immediate help.
slue
I logged in as myself to Sqlserver 2008. Then another user asked to to disconnect so that he could use my comptuer, and he used his id to connect my computer. Now whenever I login, there is an option to use my own id or his. How can
I remove his id?
Sally | http://go4answers.webhost4life.com/Example/addremove-strings-drop-button-status-56183.aspx | CC-MAIN-2015-48 | refinedweb | 1,907 | 66.13 |
works just fine for me, except if the client stops sending data to the server, the server socket script stops running, so you can't restart the client without restarting the server.
I added a second while loop so that the server waits on "s.accept" to accept a new connection but that doesn't work. How kan i keep the server alive? (One connection at a time is sufficient, no need for multiple connections using threads)...
Code: Select all
import socket TCP_IP = '127.0.0.1' TCP_PORT = 5005 BUFFER_SIZE = 20 # Normally 1024, but we want fast response s = socket.socket(socket.AF_INET, socket.SOCK_STREAM) s.bind((TCP_IP, TCP_PORT)) s.listen(1) while 1: try: conn, addr = s.accept() while 1: data = conn.recv(BUFFER_SIZE) conn.send(data) # echo except: conn.close() | https://www.raspberrypi.org/forums/viewtopic.php?f=32&p=1428752 | CC-MAIN-2019-18 | refinedweb | 132 | 69.58 |
.
This document describes the Google Data Protocol used by many Google APIs, including information about what a query looks like, what results look like, and so on.
For more information about the Google Data Protocol, see the Developer's Guide overview page and the Protocol Basics document.
Contents
- Audience
- Protocol details
- Document format
- Queries
- Resource versioning (ETags)
- Partial response (Experimental)
- Partial update (Experimental)
- Authentication
- Session state
- Additional resources
Audience
This document is intended for anyone wanting to understand the details of the XML format and protocol used by the APIs that implement the Google Data Protocol.
If you just want to write code that uses one of these APIs, then you don't need to know these details; instead, you can use the language-specific client libraries.
But if you want to understand the protocol, read this document. For example, you may want to read this document to help you with any of the following tasks:
- evaluating the Google Data Protocol architecture
- coding using the protocol without using the provided client libraries
- writing a client library in a new language Google Data Protocol messages using any programming language that lets you issue HTTP requests and parse XML-based responses.
Protocol details
This section describes the Google Data Protocol document format and query syntax.
Document format
The Google Data Protocol and Atom share the same basic data model: a container that holds both some global data and any number of entries. For each protocol, the format is defined by a base schema, but it can be extended using foreign namespaces.
Atom is the default format for the Google Data Protocol. To request a response in another format, use the
alt query parameter; for more information, see Query requests.
Note: Most Google Data Protocol feeds in Atom format use the Atom namespace as the default namespace by specifying an
xmlns attribute on the feed element, as seen in the examples given in Protocol Basics. Thus, the examples in this document don't explicitly specify
atom: for elements in an Atom-format feed.
The following tables show the Atom representation of the elements of the schema. All data not mentioned in these tables is treated as plain XML. Unless indicated otherwise, the XML elements in a given column are in the Atom namespace.
Note: This summary uses standard XPath notation: in particular, slashes show the element hierarchy, and an @ sign indicates an attribute of an element.
In each of the following tables, the highlighted items are required.
The following table shows the elements of a Google Data Protocol feed:
The following table shows the elements of a Google Data Protocol search-results feed. Note that the protocol exposes some of the OpenSearch 1.1 Response elements in search-results feeds.
The following table shows the elements of a Google Data Protocol Google:
The Google Data Protocol supports HTTP Conditional
GET. APIs that implement the protocol service returns a 304 (Not Modified) HTTP response.
APIs that implement the Google Data Protocol must support.
About category queries
We decided to provide a slightly unusual format for category queries. Instead of requiring a query like the following:
we made it possible to use:
This approach identifies a resource without using query parameters, and it produces cleaner URIs. We chose this approach for categories because we think that category queries will be among the most common queries.
The drawback to this approach is that we require you to use
/-/ in this type of category queries, so that services can distinguish category queries from other resource URIs, such as.
Query responses
- Data API="" xmlns:openSearch="" xmlns: gd: gd: .
HTTP status codes
The following table describes what various HTTP status codes mean in the context of the Data APIs.
Resource versioning (ETags)
Sometimes you need to be able to refer to a specific version of a particular entry.
This is important in two cases in particular:
- Doing a "conditional retrieval," in which your client requests an entry, and the server sends the entry only if it has changed since the last time the client requested it.
- Ensuring that multiple clients don't inadvertently overwrite one another's changes. The Data APIs do this by making updates and deletes fail if the client specifies an old version identifier for the entry.
The Google Data APIs handle both of these cases using ETags, a standard part of HTTP.
An ETag is an identifier that specifies a particular version of a particular entry. The server attaches an ETag to entry and feed elements that it sends to clients. When an entry or feed changes, its ETag changes as well.
The Google Data APIs provide ETags in two places: in an
ETag HTTP header, and in a
gd:etag attribute of
<feed> and
<entry> elements.
In the Google Data APIs, an ETag is usually a string of letters and numbers, sometimes also including hyphens and periods; the string is usually enclosed in quotation marks. (The quotation marks are part of the ETag.) For example, here's an ETag from a Data API entry:
"S0wCTlpIIip7ImA0X0QI".
There are two kinds of ETags: strong and weak. Strong ETags identify a specific version of a specific entry, and can be used to avoid overwriting other clients' changes. Weak ETags, in the context of the Google Data APIs, are used only for conditional retrieval. A weak ETag always starts with
W/. For example:
W/"D08FQn8-eil7ImA9WxZbFEw."
Not all Google Data APIs support strong ETags. For those that do, the strong ETags are used only for entries; ETags on feeds are always weak.
Here's an example of a feed (including some of the HTTP headers) retrieved from a service that supports strong ETags:
GData-Version: 2.0 ETag: W/"C0QBRXcycSp7ImA9WxRVFUk." ... <?xml version='1.0' encoding='utf-8'?> <feed xmlns='' xmlns: ... <entry gd: ... </entry> </feed>
The client libraries that support version 2 of the Data APIs handle ETags for you, transparently. The following information is for clients that don't use client libraries, and for readers interested in how versioning is handled at the protocol level.
Note: For information about the resource-versioning system used in version 1.0 of the Data APIs, see 1.0 reference guide..
Here's an example of an
If-None-Match header:.
Note::
- Use an
If-MatchHTTP header.
- Use the
gd:etagattribute in the
<atom:entry>element.
We recommend the
If-Match approach where possible.
To update an entry using
If-Match, start by acquiring the entry you're updating. Make any desired changes to the entry, then create a new
PUT request containing the modified entry. (For details of URLs to use, see service-specific documentation.)
Before sending the
PUT, add an HTTP
If-Match header containing the ETag from the original entry:
If-Match: "S0wCTlpIIip7ImA0X0QI"
Then send the
PUT request.
If the update succeeds, then the server returns an HTTP
200 OK status code, and a copy of the updated entry.
If the update fails because the ETag you specified doesn't match the current ETag on the entry (which implies that the entry has changed on the server since you last retrieved it), then the server returns an HTTP
412 Precondition Failed status code..
To override the versioning system and update the entry regardless of whether someone else has updated it since you retrieved it, use
If-Match: * instead of specifying the ETag in the header.
For information about which services support strong ETags, see the Migration Guide.
Deleting entries
Deleting entries that use strong ETags works much like updating them.
To delete an entry that has a strong ETag, first you retrieve the entry you want to delete, then you you want to override the versioning system and delete the entry regardless of whether someone else has updated it since you retrieved it, use
If-Match: * instead of specifying the ETag in the header.
If an entry does not have a strong ETag, then a
DELETE request always succeeds.
Partial response (Experimental)
By default, the server sends back the full representation of the target resource after processing requests. Partial response lets you request only the elements or attributes of interest, instead of the full resource representation. This lets your client application avoid transferring, parsing, and storing unneeded fields, so it can use network, CPU, and memory resources more efficiently.
To find out if partial response is available for the product you are using, see its API documentation.
To request a partial response, use the
fields query parameter to specify the elements or attributes you want returned. Here's an example:(@gd:etag,id,updated,link[@rel='edit']))
The server's response contains only only link and entry elements for the feed; the entry elements contain only ETag, ID, updated, and edit link information. The
fields query parameter syntax is covered in the following sections. For more details about the response, see Handling partial responses.
Note: You can use the
fields query parameter with any request that returns data. In addition to
GET, this includes
PUT (as well as
PATCH, which is used for making partial updates). However, the
fields query parameter only affects the response data; it does not affect the data that you must provide or which fields are updated or created.
Fields parameter syntax summary
The format of the
fields query parameter value is based on XPath syntax; however, it supports only a subset of valid XPath expressions. The supported syntax is summarized below, and additional examples are provided in the following section.
- Use a comma-separated list to select several fields.
- Use
a/bto select an element
bthat is nested within element
a; use
a/b/cto select an element
cnested within
b.
- Use
'@'prefix to identify an attribute with the given name; omit the
'@'prefix to refer to an element.
- Apply field conditions to select elements that match certain criteria, by placing expressions in brackets "
[ ]" after the element you want to restrict.
For example,
fields=entry[author/name='Elizabeth']returns only feed entries for which Elizabeth is the author.
- Specify field sub-selectors to request only specific attributes or sub-elements, by placing expressions in parentheses "
( )" after any selected element.
For example,
fields=entry(id,author/email)returns only the ID and the author's email for each feed entry.
- You can delimit strings using either double or single quotes
.
To escape a double or single quote, repeat the quote
. For example,
"""Hello,"" he said"produces the string
"Hello," he said, and
'''Hello,'' he said'produces the string
'Hello,' he said.
- You can use wildcards in field selections.
For example,
entry/gd:*selects all child elements of entry in the
gdnamespace, and
entry/@gd:*selects child element attributes in the same namespace.
The
fields query parameter acts as an output filter. This means that the partial response is computed only after processing the rest of the query. For example, if you also specify a
max-results query parameter to indicate that you want 20 results per page, then the first 20 results are generated and the partial response is computed from that. If the
fields specification doesn't match any of the first 20 entries selected by the query, then you get back an empty feed; you do not get back the first 20 matching entries.
Note: Do not attempt to use field conditions as query selectors. That is, do not attempt to retrieve a full feed and apply field conditions to filter out items of interest from a very large data set. Whenever possible, use other query parameters, such as
start-index and
max-results, to reduce the results of each query to a manageable size. Otherwise, the performance gains possible with partial response could be outweighed by the serious performance degradation caused by improper use.
Formatting the fields parameter value
The following guidelines explain how to construct the
fields query parameter value. Each guideline includes examples and provides descriptions of how the parameter value affects the response.
Note: As with all query parameter values, the
fields parameter value must be URL encoded. For better readability, the examples below omit the encoding.
- Identify the fields you want returned, or make field selections.
- The
fieldsquery parameter value is a comma-separated list of service returns all instances of that element.
Here are some feed-level examples:
Here are some entry-level examples:
- Restrict the response to selected fields that match certain criteria, or use field conditions.
- By default, if your request specifies an element that occurs more than once, the partial response will include all instances of that element. However, you can also specify that the response should only include elements that have a particular attribute value or elements that fulfill some other condition using "
[ ]" syntax, as shown in the examples below. See the field condition syntax section for more details.
- Request only parts of the selected elements, or use field sub-selections.
- By default, if your request specifies particular elements, the service returns the elements in their entirety. You can specify that the response should include only certain sub-elements within the selected elements. You do this using "
( )" sub-selection syntax, as in the examples below.
More about field condition syntax
You can use field conditions with fields or sub-fields. The condition must evaluate to true for the selected field to be included in the results. If there is no field condition, then all fields of the selected type are included.
The text value of the selected field is used for comparisons. In this context, if the field is an element, the text value is its contents; if the field is an attribute, the text value is the attribute's value. If the field has no text value, then the comparison fails and the field is not included in the results.
The following table shows the XPath operators that are supported for field conditions and provides some examples.
Handling partial responses
After a server that supports partial response processes a valid request that includes the
fields query parameter, it sends back an HTTP
200 OK status code along with the requested attributes or elements. If the
fields query parameter has an error or is otherwise invalid, the server returns an HTTP
400 Bad Request status code.
The root element of the response is either
<feed> or
<entry>, depending on the target URI. The root element's content includes only the selected fields for that feed or entry, along with the enclosing tags for any parent elements.
The value of the the request's
fields query parameter can be echoed back in two ways:
- The root element has a
gd:fieldsattribute that shows value of the
fieldsquery parameter specified in the request.
- If the target URI is a feed, each editable entry has a
gd:fieldsattribute that shows the portion of the
fieldsselection that applies to it.
Note: In order to see these
gd:fields attribute values in your partial response, you must include them in your
fields query parameter specification. You can do this explicitly, using
@gd:fields, or using the more general
@gd:*, which also includes ETag information.
The following example query asks the server to return a document that contains only attributes in the
gd namespace (at both the feed and entry level), as well as the feed ID, the title, and the edit link for each feed entry::*,id,entry(@gd:*,title,link[@rel='edit'])
The server returns the following partial response, along with a
200 Successful HTTP status code:
<?xml version='1.0' encoding='utf-8'?> <feed xmlns='' xmlns: <title>This year</title> </entry> <entry gd: <title>Last year</title> </entry> <entry d: <title>Today</title> </entry> </feed>
If the selected fields do not match anything, the service still returns a
200 Successful HTTP status code, but the partial response is an empty feed:
<?xml version='1.0' encoding='utf-8'?> <feed xmlns='' xmlns:gd='' gd:etag='W/"DEAEQH47eCp7IWA9WxBVGUo."' gd:fields='@gd:*,id,entry(@gd:*,title,link[@rel='edit'])> </feed>
Partial update (Experimental)
Google products that support partial response and editable resources also allow you to use partial update. With partial update, you send only the fields you want to update, rather sending a modified version of the full resource representation. This lets your client application be more efficient when making updates, as well as when using partial response to retrieve data.
Instead of using
PUT, however, you must use a
PATCH request when making a partial update. The semantics for
PATCH are powerful enough to let you add, replace, and delete specific fields for a particular entry, all with a single request.
To find out if partial update is available for the product you are using, refer to the product-specific documentation.
Submitting a partial update request
To submit a partial update request, you send an HTTP
PATCH request to the same URL that you would normally use with
PUT to update the resource. The body of the
PATCH request is a partial
<entry> element that specifies the fields you want to add or modify. The entry's
gd:fields attribute indicates the fields you want to delete.
The server processes
PATCH requests in a specific order:
- It first removes from the resource representation the fields specified by the
gd:fieldsattribute.
The syntax for the
gd:fieldsattribute is the same as for the
fieldsquery parameter used when requesting a partial response. See Supported syntax for more details.
- It then merges into the existing resource representation the data provided in the body of the request.
More details on how the data is merged are provided in Adding or updating fields below.
Note: Since the body of a
PATCH request is not typically compliant with the Atom Syndication Format, the
Content-Type you use with a
PATCH request is
application/xml.
Here is an example of a partial update request:
PATCH /myFeed/1/1/ Content-Type: application/xml <entry xmlns='' xmlns: <title>New title</title> </entry>
This
PATCH request makes the following changes to the resource representation stored on the server for the target URI's entry:
- Removes the
<description>element.
- Updates the
<title>element.
Semantics of a partial update request
The instructions below explain how to set up your
PATCH request to delete, add, or update specific fields within an entry. A single
PATCH request can perform any combination of these operations.
Deleting fields. Use the
<entry>element's
gd:fieldsattribute to identify any fields you want deleted from the resource. The following sample request deletes the title and summary associated with an entry. However the request does not add or update any other data for the entry.
PATCH /myfeed/1/1/ Content-Type: application/xml <entry xmlns='' xmlns:
Adding or updating fields. Use the body of the
<entry>element to specify the data that you want to add or update for a resource. These fields are merged into the existing data for the resource, after any deletions are made, according to the following rules:
Fields not already present are added. If the resource data does not already specify a value for a field, then the field is added to the existing data. For example, if an entry does not have a title, and your
PATCHrequest contains a
<title>element, then the new title is added to the entry.
Fields already present are replaced or appended. The specific behavior for merging fields that are already specified in the resource data depends on the characteristics of the field:
Non-repeating fields are replaced. If the resource data already specifies a value for a non-repeating element, then the value you specify in the
PATCHrequest replaces the existing value for that element. For example, in the example below, the new title replaces the existing title.
PATCH /myFeed/1/1/ Content-Type: application/xml <entry xmlns='' xmlns: <title>New Title</title> </entry>
A more complex example is given below. For this example, assume that the entry can have only one author, and that the target resource already has values for the author's name and email address. Even though
<author>element has two child fields, only the
<name>element is present in the data provided. As a result, only that field's value is overwritten. The value of the
PATCH /myfeed/1/1/ Content-Type: application/xml <entry xmlns='' xmlns: <author> <name>New Name</name> </author> </entry>
Repeating fields are appended. If the resource data already specifies a value for a repeating element, then the new element you provide is added to the existing set of values.
Note that there might be times when you want to do something other than add a new instance of a repeating element. For example, you might want to do one of the following:
Replace an entire list of repeating elements. You can delete all the repeating fields using the
gd:fieldsattribute (
gd:fields='ns:accessControl', for example) and provide a complete set of the replacement fields. Since all the existing elements are deleted first, the set of fields you provide do not conflict with any existing values when they are appended.
Replace one value in a set of existing values for a repeating element. In this case, simply remove the single element by defining the
gd:fieldsvalue narrowly enough to avoid deleting other values that you want to keep. For example, to remove only an access control with an
actionof
embed, you might use
gd:fields='ns:accessControl[@action="embed"]'. Then you provide the single field that you want to replace it with in the body of the
<entry>element:
PATCH /myfeed/1/1/ Content-Type: application/xml <entry xmlns='' xmlns:gd='' gd:fields='ns:accessControl[@ </entry>
Handling the response to a partial update
After processing a valid partial update request, the API returns a
200 OK HTTP response code. By default, the body of the response is the complete entry that you updated. The server updates ETag values when it successfully processes a
PATCH request, just as it does with
PUT.
If a
PATCH request results in a new resource state that is syntactically or semantically invalid, the server returns an
HTTP 400 Bad Request or
422 Unprocessable Entity HTTP status code, and the resource state remains unchanged. For example, if you attempt to delete a required field and do not provide a replacement, the server returns an error.
Note: It is important to understand how different fields relate to each other. It might be possible to put a resource into an inconsistent state by updating only part of mutually interdependent values. For example, it might be possible to update a start time to a later value than an end time. Although the API should return an error code, we recommend that you fully test these kinds of conditions to ensure consistency.
Alternate notation when PATCH is not supported
If your firewall does not allow
PATCH, then do an HTTP
POST request and set the override header to
PATCH, as shown below:
POST /myfeed/1/1/ X-HTTP-Method-Override: PATCH Content-Type: application/xml ...
Using partial response with partial update
You can use a partial response as the basis of a subsequent partial update request. If you do this, specify a
fields query parameter that includes edit links, as well as
@gd:*. This ensures that the partial response includes information like the ETag and
gd:fields attribute values, which are important for subsequent requests.
Here is an example that returns a partial response that you could use as the basis for a future partial update::*,link[@rel='edit'](@href),gd:who
The server responds:
<?xml version='1.0' encoding='utf-8'?> <entry xmlns='' xmlns: <gd:who <gd:who <gd:who </entry>
Suppose that you want to remove the user with email
'jane@gmail.com', add a user with email
'will@gmail.com', and change the email for the user currently listed as
'jo@gmail.com' to
'josy@gmail.com'.
You can make these changes simply by starting with the results of the previous response, modifying only the fields that are different, and submitting the modified partial entry as the body of the
PATCH request. For this example, the needed modifications are:
-
<gd:whofrom the list of elements provided.
- Add
<gd:whoto the list of elements provided.
- Replace
<gd:whowith
<gd:who.
The
PATCH request based on the pevious partial response is shown below:
PATCH /myFeed/1/1/ Content-Type: application/xml <entry gd: <link href=''/> <gd:who <gd:who <gd:who </entry>
Note: This approach relies on the
gd:fields and
gd:etag (if supported) attributes being included in the partial response for the entry. The body of the partial entry must retain all fields and attribute that were present in the partial response — except for those you explicitly want to remove. You can update any of the existing fields in the body with new values, and you can include any new fields you want to add. Account Authentication for Installed Applications (also known as "ClientLogin"). (Web-based clients should not use this system.)
- A web-based client, such as a third-party front end to a Google service, should use a Google-specific authentication system called Account Authentication Proxy for Web-Based Applications (also known as "AuthSub").
In the ClientLogin system, the desktop client asks the user for their credentials, and then sends those credentials to the Google authentication system.
If authentication succeeds, then the authentication system returns a token that the client subsequently uses (in an HTTP Authorization header) when it sends Data API Google Data APIs Authentication Overview or the Google Account Authentication documentation.
Session state Data APIs,.
Additional resources
You may find the following third-party documents useful:
- Comparison of Atom and RSS from intertwingly
- Overview of Atom from IBM
- Dublin Core extensions to RSS
- HTTP 1.1 method definitions; specification for
GET,
PUT, and
DELETE
- HTTP 1.1 status code definitions
- How to Create a REST Protocol
- Building Web Services the REST Way
- A Technical Introduction to XML
- XML Namespaces by Example
- ETag section of HTTP specification | https://developers.google.com/gdata/docs/2.0/reference | CC-MAIN-2018-17 | refinedweb | 4,319 | 52.19 |
Coding for the Big Screen with the Apple tvOS SDK
Free JavaScript Book!
Write powerful, clean and maintainable JavaScript.
RRP $11.95
The future of TV is apps!
Is what Tim Cook stated at the recent Apple event in September and this future is already upon us with an increasing amount of TV content streamed through mobile devices and apps.
The newly announced tvOS SDK is something for iOS developers to get excited about. For the first time we will be able to create apps for the new Apple TV and publish them to the App Store. This is a great opportunity to deliver content and great user experience through apps to the big screen in everyone’s living room.
Let’s dive right in and take a look at the tvOS SDK.
We’ll cover the basics of each new framework, identify their purpose and describe what the requirements to make an app. Armed with our newfound knowledge, we will create a simple custom tvOS app step by step.
Overview of the SDK
There are two types of applications for tvOS.
Custom Applications
These apps use the latest iOS frameworks and are similar to traditional iOS applications for the iPhone and iPad. You can use storyboards or code to create user interfaces.
Client Server Applications
These apps use a new set of frameworks unique to tvOS. If you are a web developer you are going to find these frameworks interesting as they provide the ability to create applications using JavaScript and a markup language. Yes, you read that right, this is the first time Apple have provided a JavaScript framework as the means to create applications.
Here is a list of all the new frameworks:
TVML
TVML is Apple’s custom markup language and is used to create interfaces. It has an XML style and if you know HTML you will find it familiar.
Apple has made a set of reusable TVML templates available to help you get started. You can find a detailed description of these templates here.
TVJS
As the name suggests, TVJS a collection of JavaScript APIs used to load TVML pages. It contains the necessary functionality for interacting with the Apple TV hardware. From what I can see, this is standard JavaScript without any special syntax.
More information can be found in the TVJS Framework Reference documentation.
TVMLKit
This is the core framework where everything comes together. TVMLKit provides a way to incorporate TVJS, JavaScript and TVML elements into your app. Think of this framework as container and bridge for delivering code and markup as a native application to the Apple TV.
See the TVMLKit Framework Reference for more details.
TVServices
TVServices is the framework that allows you to add a top shelf extension to your app. The top shelf is an area of the Apple TV home screen dedicated to displaying content from an application that placed in the first row. It provides an opportunity to display content and information to the user when the focus is on the app icon, without the need to launch the app.
See TVServices Framework Reference.
Architecture of the Client Server Apps
All the and display of the data.
Learn PHP for free!
Make the leap into server-side programming with a comprehensive cover of PHP & MySQL.
Normally
RRP $11.95 Yours absolutely free
I like to think of this architecture as the typical website, where all HTML and JS files reside on a web server and the application responsible for rendering them is similar to the users browser.
Development Considerations
Before jumping into Xcode to create an application it’s important to consider the following limitations:
– Application size is limited to 200MB.
– You cannot persist data to the device, CloudKit is something you need to get familiar with if you require saving user settings.
It’s important to understand that the Apple TV has a new user interface and Apple has defined a set of Human Interface Guidelines specific to the tvOS.
You need to be aware that unlike iOS devices the user has limited touch capabilities, (swipe, click and tap) that affect how they can interact with your application. This is what makes focus important for the Apple TV and given that it’s a new concept I would highly recommend you invest some time learning how to support focus in your application.
Create Your First tvOS Application
Time to have some fun with the tvOS SDK.
We will create an application that makes a call to a TV database API, retrieves a list of popular TV shows and displays them on our TV application.
By the time we complete this tutorial the application will look like this:
Setting Up Your Development Environment
Development for the Apple TV requires Xcode 7.1 which is still in beta. As with anything under development you may face unexpected crashes and slow performance.
Download Xcode 7.1 from here
We are going to use the themoviedb.org API and specifically the following API request that returns json data containing a list of popular TV shows. You can see the request information here
The API requires a key that you can request for free but you have to register first.
Developing the application
Open Xcode and select a new Single view Application under the tvOS section.
Give the application a name, I named mine PopularTVShows, select a location for the files and click create.
Designing the UI
Select the main storyboard, you will notice that this is very large storyboard area. This is because we now need to create UI for full HD on a TV.
Select the default view, you will notice that by default it’s at 1920 x 1080 resolution.
Apart from that difference, everything else should be familiar.
You will probably want to zoom out to be able to see the complete storyboard.
Start by dragging a Collection View to the storyboard, position it to the top left corner and add zero margin constraints on all 4 sides.
Click on update frames.
The collection view will now take up all the space on the storyboard.
On most iOS devices, scrolling, when there is more data that can fit the screen, is usually implemented vertically. For the Apple TV the recommended scrolling direction is horizontal. Set this in the Collection View.
Next select the Collection View Cell and give it a custom size of 260 by 430.
This cell will contain the TV Show poster and the show name, we gave it a relatively small size to allow for multiple shows to be displayed on the screen.
In the attributes inspector assign an identifier of ShowCell.
Add an Image View in the cell and name it ShowImg
Add the following constraints: top margin 0, width 225, height 354 and align horizontally in the container.
Drag a label underneath the Image view and give it the following constraints: Top margin 20, width 225, height 35
Align horizontally in the container.
Set the text to center alignment and change it to any TV show you like, I set mine to Doctor Who.
Set the image view to use the poster of your choice or the one I used from here
Download the image and drag it into the Assets catalog of your project.
Give it an appropriate name, I named mine posterbackground_.
Return to the storyboard, select the image view and set it as the background in the properties inspector.
This is all that we need for our UI, if you did not follow along so far or were not able to complete any step, download a copy of the code from the UI branch here
Getting the data
Time to make our API requests and get data in our application.
Serializing and deserializing json with Swift can become time consuming because of the optional values. I like to use a framework called SwiftyJSON. It makes the process of working with json much simpler and provides a wrapper that takes away a lot of code management.
Download a copy of the framework and make sure you are on the Xcode 7 branch.
The easiest way to integrate the library into the project is to drag the SwiftyJSON.swif‘ file into the project, selecting the project target.
Great! now we are ready to add some code.
Add a new Swift file to the project and name it ApiService.() } }
The code has a function that creates a network task with a request, it takes a url as a parameter and returns data if successful or an error if not.
This function is generic and can be used for every API request the application will make.
Let’s look at the API. To access the data we make a GET request to the following URL : ’‘ including the key at the end.
Add the following line of code at the top of the class.
let API_TV_POPULAR_URL = ""
Ensure to replace
YourKeyHere with your api key.
Great, now let’s add another function that takes this url and passes it to the generic function we created earlier, it should then return the data or the error from the request.
func getPopularTVShows(onCompletion: (JSON, NSError?) -> Void) { apiGetRequest(API_TV_POPULAR_URL, onCompletion: { json, err in onCompletion(json as JSON, err as NSError?) }) }
Thats all we need for this class. It should now look like this:
import Foundation let API_TV_POPULAR_URL = ""() } func getPopularTVShows(onCompletion: (JSON, NSError?) -> Void) { apiGetRequest(API_TV_POPULAR_URL, onCompletion: { json, err in onCompletion(json as JSON, err as NSError?) }) } }
Let’s create our data objects, these are classes that will contain the data received from the json. We will use these objects to populate the UI elements of the application.
If you open your browser and go to the URL added in the code above, you will receive the json data we will work with. It should look like this.
{ "page": 1, "results": [ { "backdrop_path": "/aKz3lXU71wqdslC1IYRC3yHD6yw.jpg", "first_air_date": "2011-04-17", "genre_ids": [ 10765, 18 ], "id": 1399, "original_language": "en", "original_name": "Game of Thrones", .\n\n", "origin_country": [ "US" ], "poster_path": "/jIhL6mlT7AblhbHJgEoiBIOUVl1.jpg", "popularity": 36.072708, "name": "Game of Thrones", "vote_average": 9.1, "vote_count": 273 }, { "backdrop_path": "/kohPYEYHuQLWX3gjchmrWWOEycD.jpg", "first_air_date": "2015-06-12", "genre_ids": [ 878 ], "id": 62425, "original_language": "en", "original_name": "Dark Matter", "overview": ?", "origin_country": [ "CA" ], "poster_path": "/iDSXueb3hjerXMq5w92rBP16LWY.jpg", "popularity": 27.373853, "name": "Dark Matter", "vote_average": 6.4, "vote_count": 4 } ], "total_pages": 3089, "total_results": 61761 }
Taking a closer look, you can see that we have a structure containing the following at the top level:
– A page number.
– An array of results.
– The number of total pages.
– The total results.
Let’s create a class that will represent this data structure. Add a new Swift file and name it ApiResults.
Add the following code
class ApiResults { var page : Int! var results : [ApiTVResult]! var totalPages : Int! var totalResults : Int! /** * Instantiate the instance using the passed json values to set the properties values */ init(fromJson json: JSON!){ if json == nil{ return } page = json["page"].intValue results = [ApiTVResult]() let resultsArray = json["results"].arrayValue for resultsJson in resultsArray{ let value = ApiTVResult(fromJson: resultsJson) results.append(value) } totalPages = json["total_pages"].intValue totalResults = json["total_results"].intValue } }
This creates the
page,
totalPages and
totalResults variables as integers since they will hold the json numeric values. It also creates an array of results.
The initialization code takes the json data and assigns the values to the appropriate variables.
You probably noticed that we have an
ApiTVResult object declared and mapped to the
results array. This is going to be our second object that will contain the data of each result, which in this case is the TV show details.
Add a new Swift file and name it ApiTVResult.
Add the following code
let imagesBasePath = "" class ApiTVResult { var backdropPath : String! var firstAirDate : String! var genreIds : [Int]! var id : Int! var originalLanguage : String! var originalName : String! var overview : String! var originCountry : [Int]! var posterPath : String! var popularity : Float! var name : String! var voteAverage : Float! var voteCount : Int! /** * Instantiate the instance using the passed json values to set the properties values */ init(fromJson json: JSON!){ if json == nil{ return } let apiBackDropPath = json["backdrop_path"].stringValue backdropPath = "\(imagesBasePath)\(apiBackDropPath)" firstAirDate = json["first_air_date"].stringValue genreIds = [Int]() let genreIdsArray = json["genre_ids"].arrayValue for genreIdsJson in genreIdsArray { genreIds.append(genreIdsJson.intValue) } id = json["id"].intValue originalLanguage = json["original_language"].stringValue originalName = json["original_name"].stringValue overview = json["overview"].stringValue originCountry = [Int]() let originCountryArray = json["origin_country"].arrayValue for originCountryJson in originCountryArray { originCountry.append(originCountryJson.intValue) } let apiPosterPath = json["poster_path"].stringValue posterPath = "\(imagesBasePath)\(apiPosterPath)" popularity = json["popularity"].floatValue name = json["name"].stringValue voteAverage = json["vote_average"].floatValue voteCount = json["vote_count"].intValue } }
The approach here is the same as before, we created the variables that match to json data and added initialization code to populate the object. Looking at the data received, the
backdropPath and the
posterPath contain only the name of the image. To construct the complete image URL we need to combine the file name with the imagesBasePath like so:
let apiBackDropPath = json["backdrop_path"].stringValue backdropPath = "\(imagesBasePath)\(apiBackDropPath)"
Wherever we have an array of values like
var genreIds : [Int]! we iterate through each value and add it to the array like so:
let genreIdsArray = json["genre_ids"].arrayValue for genreIdsJson in genreIdsArray { genreIds.append(genreIdsJson.intValue) }
This is all we need to do for our data model.
The code above can be found at the Model Branch here
Bringing it all together
Let’s connect the UI to our code and make the API calls to fetch the data.
First, we are going to create a class that will allow us to populate our collection cell. Create a new Swift file and name it ShowCell.
Add the following code
import UIKit class ShowCell: UICollectionViewCell { @IBOutlet weak var showImg: UIImageView! @IBOutlet weak var showLbl: UILabel! func configureCell(tvShow: ApiTVResult) { if let title = tvShow.name { showLbl.text = title } if let path = tvShow.posterPath { let url = NSURL(string: path)! dispatch_async (dispatch_get_global_queue (DISPATCH_QUEUE_PRIORITY_DEFAULT, 0)) { let data = NSData(contentsOfURL: url)! dispatch_async(dispatch_get_main_queue()) { let img = UIImage(data: data) self.showImg.image = img } } } } }
This code creates an outlet for the TV show poster and another for the TV show title, named
showImg and
showLbl accordingly.
It contains a function that takes the
ApiTVResult object, assigns the title to the label and uses the poster URL to download the image asynchronously and populates the
imageView.
We now need to connect the outlets to the code. Open the storyboard, select the
showCell and set the class to the one we just created
Right click the
ShowCell and connect the
showImg outlet by selecting the + next the outlet name and dragging to the poster
imageView. Repeat the step above to connect the
showlbl outlet to the title label.
That is all that is required for
ShowCell.
Now lets connect the
CollectionView to the
ViewController.
Go to the View Controller and add the following code line at the top of the class:
@IBOutlet weak var collectionView: UICollectionView!
Return to the storyboard, right click on the collection, select the + next to new referencing outlet and drag to the yellow View Controller icon. Select the viewCollection.
This finalizes all the linking required, so select the
ViewController class and replace the following code
class ViewController: UIViewController {
with this
class ViewController: UIViewController, UICollectionViewDelegate, UICollectionViewDataSource, UICollectionViewDelegateFlowLayout {
We just added a number of protocols to the
CollectionView, these are the minimum required implementations to add data and control the layout of the view.
Lets implement them. Start by deleting the following code as we will not be performing any actions with it.
override func didReceiveMemoryWarning() { super.didReceiveMemoryWarning() // Dispose of any resources that can be recreated. }
Replace the following code:
override func viewDidLoad() { super.viewDidLoad() // Do any additional setup after loading the view, typically from a nib. }
with:
override func viewDidLoad() { super.viewDidLoad() collectionView.delegate = self collectionView.dataSource = self }
We stated that the
ViewController will act as the source of data and the delegate for the
CollectionView.
Before we implement our protocols, we should create a function that will call the API and populate our objects, this way we can assign the appropriate data to the
CollectionView.
The first thing we need is a variable that will contain our data, create it by adding the following code underneath the
IBOutlet
var tvShows = [ApiTVResult]()
This variable will contain an array of TV Shows.
Create a method to make the API call using the ApiService created earlier.() } } } }
In the code above, once the API call has succeed and we have the json data, we populate the
ApiResuts objects. Then we assign to the
viewController variables the data contained in the results.
Here you can see how the SwiftyJSON library assists with serialization and population of the objects.
Call this method in the
viewDidLoad function. Your code should look like this:
override func viewDidLoad() { super.viewDidLoad() collectionView.delegate = self collectionView.dataSource = self downloadData() }() } } } }
Now we can implement the required
UICollectionView protocols. Add the following code to your file:
func collectionView(collectionView: UICollectionView, cellForItemAtIndexPath indexPath: NSIndexPath) -> UICollectionViewCell { if let cell = collectionView.dequeueReusableCellWithReuseIdentifier("ShowCell", forIndexPath: indexPath) as? ShowCell { let tvShow = self.tvShows[indexPath.row] cell.configureCell(tvShow) return cell } else { return ShowCell() } } func numberOfSectionsInCollectionView(collectionView: UICollectionView) -> Int { return 1 } func collectionView(collectionView: UICollectionView, numberOfItemsInSection section: Int) -> Int { return tvShows.count } func collectionView(collectionView: UICollectionView, layout collectionViewLayout: UICollectionViewLayout, sizeForItemAtIndexPath indexPath: NSIndexPath) -> CGSize { return CGSizeMake(260, 430) }
The code here is standard for a protocol implementation.
In the
numberOfSectionsInCollectionView we return 1 as we will only have a single category in the UI.
In the
numberOfItemsInSection we return a count of the
TvShows in the data. Basically we say that we want to display as many items as
TVShows returned from the API.
In the layout we set the size of our item to the size of the
showcell in the storyboard.
Finally, in what looks as the most complex piece of code in the
cellForItemAtIndexPath, we create a cell based on the
ShowCell class we created earlier. We select the
TVShow from the
tvShows array based on its index and execute the configure it to display the required data.
Now for the exciting part… Let’s run the application!
Oops…
iOS 9 now requires the explicit use of the HTTPS protocol for transferring data in applications. Since our API calls are currently HTTP we need to enable it in the application settings.
Open the Info.plist file and click the + button on the last item. Select the App Transport Security Settings entry
Set Allow Arbitrary Loads to yes.
This will allow all types of connections for the application.
Lets run again…
If you managed to follow along you should now be seeing sucess! The app displays TV Shows with their respective posters and titles.
But there is still something missing.
On Apple TV focus is important, and navigating between elements in the application requires it.
Let’s implement one last function that will help with this.
Add the following code at the top of the
ViewController (Underneath the
var TVShows)
let originalCellSize = CGSizeMake(225, 354) let focusCellSize = CGSizeMake(240, 380)
This creates a variable that contains the original size of our cell and one slightly bigger value. Add a function that will change the size of the cell when focused to make the selection visible to the user.
override func didUpdateFocusInContext(context: UIFocusUpdateContext, withAnimationCoordinator coordinator: UIFocusAnimationCoordinator) { if let previousItem = context.previouslyFocusedView as? ShowCell { UIView.animateWithDuration(0.2, animations: { () -> Void in previousItem.showImg.frame.size = self.originalCellSize }) } if let nextItem = context.nextFocusedView as? ShowCell { UIView.animateWithDuration(0.2, animations: { () -> Void in nextItem.showImg.frame.size = self.focusCellSize }) } }
Run the application again and swipe on the TV Remote, you should be able to see which item is now selected. This completes our application.
A complete copy of the code can be found here
Final Thoughts
Experienced iOS developers will find creating application for tvOS familiar. There’s a small learning curve, especially around the UI design and user interaction, but it’s worth the effort. For those interested in serving media and large content, TVML applications provide an easy way to do so while using familiar web technologies.
For those new to iOS or mobile development there is no better time to jump in. The skills you will acquire developing for custom tvOS apps will be transferable to iOS later.
The Apple TV will provide a new platform for custom applications and it will most likely have it’s own independent App Store. It’s not everyday that an opportunity like this presents itself to developers.
I already have list of applications that I would love to use on the big screen of my TV and I’m looking forward to enjoying the content and experiences you will provide while holding a Siri remote in one hand and some pop corn on the other.
Patrick is a senior software developer at NAB in Melbourne. He is a certified .NET developer and has over 12 years of experience in application development. He is passionate about everything related to mobile and web and spends most of his time developing mobile applications on the iOS and Windows Phone platforms. | https://www.sitepoint.com/coding-for-the-big-screen-with-the-apple-tvos-sdk/ | CC-MAIN-2020-29 | refinedweb | 3,490 | 57.87 |
Hide Forgot
Clone of RHEL6 bug
+++ This bug was initially created as a clone of Bug #643750 +++
When using a virtio serial port from an application and putting it in non blocking mode, then fulling it till write returns -EAGAIN and then doing a select
for write, the select will never returns.
The reason for this is that poll waits for port->waitqueue, but nothing
wakes the waitqueue when there is room again in the queue, quoting from virtio_console.c: init_vqs():
io_callbacks[j] = in_intr;
io_callbacks[j + 1] = NULL;
The fix is to simply define a callback for the j + 1 case, and make this wait the waitqueue all the other needed bits are already present.
--- Additional comment from hdegoede@redhat.com on 2010-10-19 03:57:30 EDT ---
Some notes my original description of this problem comes from reading the code, not from hitting this in practice. Amit Shah has run some tests and cannot re-create the problem which one would expect up on reading the code.
We've discussed this and decided to keep this bug open for further investigation later to see if the waitqueue in question is somehow actually woken when room becomes available in the out_vq, or if things currently happen to work because of some side-effect somewhere else.
--- Additional comment from amit.shah@redhat.com on 2011-01-28 04:56:09 EST ---
This is needed once the qemu can do nonblocking IO and flow control. Those patches are scheduled for 6.1. This patch needs to get to 5.7 and 5.6.z.
Testing notes:
With qemu-kvm with the fix for bug 588916, start a guest with:
-chardev socket,path=/tmp/foo,server,nowait,id=c0 -device virtio-serial -device virtserialport,chardev=c0
Then redirect the port to a file:
nc -U /tmp/foo > /tmp/guest-file
In the guest, transfer a big file (anything > 1G) to the virtio port:
cat /tmp/bigfile > /dev/vport0p1
In some cases, the guest command will never finish and the size of the host file will not increase beyond a particular number.
After the kernel with this bug solved is used, the 'cat' command in the guest will finish and the size of the file in the host will match the size of the file in the guest.
in kernel-2.6.18-242.el5
You can download this test kernel (or newer) from
Detailed testing feedback is always welcomed.
Verified on qemu-kvm-0.12.1.2-2.144.el6.
guest kernel : kernel-2.6.18-243.el5
steps:
1.start VM with virtio-serial-port w/o -M parameter.
2.open the socket file on the host and not read it
eg:#cat open-socket
#!/usr/bin/python
import os
import sys
import socket
import time
#fd = os.open(sys.argv[1], os.O_RDONLY)
s = socket.socket(socket.AF_UNIX)
s.connect(sys.argv[1])
while 1:
# do nothing
time.sleep(1)
#python open-socket /tmp/vport0
3.transfer a file whose size > 2G via virtio-serial
eg :#cat /tt > /dev/vport0p1
Actual Results:
qemu-kvm process does not freeze.
Based on above ,this issue has been fixed.
Change status to VERIFIED.
Technical note added. If any revisions are required, please edit the "Technical Notes" field
accordingly. All revisions will be proofread by the Engineering Content Services team.
New Contents:
Using a virtio serial port from an application, filling it until the write command returns -EAGAIN and then executing a select command for the write command caused the select command to not return any values, when using the virtio serial port in a non-blocking mode. When used in a blocking mode, the write command waited until the host indicated it used up the buffers. This was due to the fact that the poll operation waited for the port->waitqueue pointer, however, nothing woke the waitqueue when there was room again in the queue. With this update, the queue is woken via host notifications so that buffers consumed by the host can be reclaimed, the queue freed, and the application write operations may proceed. | https://bugzilla.redhat.com/show_bug.cgi?id=673459 | CC-MAIN-2019-39 | refinedweb | 682 | 62.27 |
libspe provides an interface for programmers to manage and communicate with SPE processes. The upgrade from libspe1 to libspe2 has involved an entire rethinking of the way that SPE processes are managed from the PPE. In this article, I'll refer to the general library without respect to version number as libspe, and I'll use libspe1 and libspe2 to refer to the specific versions.
Before diving into libspe2, you should note that the purpose of libspe is not to manage physical SPEs. Because the code that uses libspe is user-level code, it should not have the ability to directly modify hardware resources. The user-level code requests SPE resources from the operating system which implements that physically in whatever way the operating system deems best. The operating system, for instance, is allowed to schedule multiple contexts onto a single physical SPE by loading and unloading contexts as needed. Each SPE process will get access to the whole SPE as long as it is running, but the operating system can freely suspend execution at any point (to be resumed later) and schedule another SPE context to run. All of this should be invisible to the user-level software on both the SPE and the PPE, except that excessive context switches on the SPE would cause performance degradations.
In libspe1 the SPE resource the operating system managed was called a thread; in libspe2 this resource is called a context. The change is not simply a terminology change -- instead, the goal of libspe2 is to separate the threading model from the SPE resource management.
Creating and using SPE contexts
The two biggest differences between libspe1 and libspe2 is in the basic execution of SPE
code. In libspe1, context creation and execution were handled simultaneously with
spe_create_thread. In libspe2 these are separate steps (in fact, as you will see below, it is several steps).
In libspe1, calls to run SPE code were handled asynchronously.
spe_create_thread caused the SPE code to be run at the same time as
the continuing PPE code. In libspe2, calls to run SPE code are handled synchronously.
This means that in order to get one or more SPE simultaneous execution threads, the
program will have to create that many threads in the PPE code, and then run the SPE
program in each of those threads. This might seem like more work, but in fact it is simple to wrap with helper functions and provides quite a bit of flexibility with the way that SPE programs are run.
Here is a libspe1 program that starts a new SPE thread running (enter as
ppe_example.c):
Listing 1. Simple libspe1 thread creation
Here is the SPE code for this program (enter as
spe_example.c):
Listing 2. SPE code for thread demonstration
To build the program, just enter:
The PPE part of the program can be rewritten using libspe2 like this (the SPE code can remain as is):
Listing 3. Simple libspe2 thread creation
The build process for this program is only slightly different:
As you can see, libspe2 is using pthreads to handle the threading rather than relying on libspe to handle it for you (to learn more about pthreads, see Resources at the end of the article). The procedure that the code is following is this:
- Create and run the pthread (
pthread_create).
- Create an SPE context (
spe_context_create).
- Load the SPE code into the context (
spe_program_load).
- Run (and re-run) the SPE code until completion (
spe_context_run).
By breaking the process up into steps, it gives the programmer direct control over each stage of the process. Want to use a different thread model? Just replace the pthread calls with whatever threading system you want. Want to run an external program file rather than embedding one in the application? Just use
spe_image_open before calling
spe_program_load. Want to customize how PPE callbacks work? Just change the loop and flags around
spe_context_run. Is all this too complicated? Just wrap the sequence that works best for your program into a helper function.
The whole process is pretty straightforward except for
spe_context_run. This is the function that actually causes the code on the SPE to run. It is synchronous, meaning that it suspends the execution of the currently running thread on the PPE while it runs the SPE code. When the SPE code terminates or temporarily stops (for signalling, for example), it resumes the PPE thread. In the simple program shown here, you would do just fine to leave out the
do..while loop around
spe_context_run. However, in more complicated programs, you might want to keep it and check the return value to see if it is a normal program exit or if it is the result of a stop and signal instruction and needs special handling.
spe_context_run also has some interesting arguments. The first argument is simply a reference to the context that you want to run. The second argument, however, is a pointer to the offset into the program that you want to begin execution. That's right, you literally tell the SPE which byte of your program you want to start executing. This is easier to manage than it sounds. First of all, the default starting point of all programs is
SPE_DEFAULT_ENTRY. Second, since you are passing a pointer to the value, the
spe_context_run function modifies the value for you upon return so that it points to the correct re-entry position. Therefore, as long as it is initialized correctly, the entry-point will actually be maintained by
spe_context_run itself. However, this gives you the added flexibility of being able to restart the SPE program after signals at any location you wish.
The third argument is a set of run flags. This is normally fine to set to 0. You can also send the flag
SPE_NO_CALLBACKS which means that your program will handle all callback functions directly rather than letting the
spe_context_run function auto-dispatch them and hide them from you. The fourth and fifth arguments are
argp and
envp. These are used at SPE program startup to pass arguments and environment information to the SPE program (this is the same as the same parameters in libspe1's
spe_create_thread). Finally, the last argument is an optional pointer to a structure of type
spe_stop_info_t. For advanced usage, this gives you detailed information about the reason that
spe_context_run returned. However, for most applications the return value has sufficient information.
The return code for
spe_context_run is either 0 for successful termination of the program, a positive number indicating that a "stop and signal" instruction was executed (the actual value will be the value set by the signalling instruction), or a -1 indicating an error condition (
errno will then be set and detailed information will be in the
spe_stop_info_t structure, if provided).
In libspe1, SPE programs could easily call certain libc functions on the PPE and therefore essentially have access to the operating system's libc. However, the list of functions available for use by the SPE were essentially pre-defined. libspe2 provides an interface to include additional PPE callback functions that are available for the SPE to call.
To create additional callback functions on the PPE, you have to create both the function itself in your PPE code and generate a stub on the SPE which performs the thunk. When performing the callback, the SPE provides the PPE with a pointer to a single four-byte argument and provides no direct support for returning a value. The usual pattern for calling and returning on the callback is to create a struct to hold both the parameters to the function and the return value. The address to this struct is then what is passed as the data. Remember though that the callback function doesn't get the pointer in this case, but a pointer to the pointer.
The prototype of the callback function is this:
The return value for this is 0 for success, and any other value is considered an error which will cause
spe_context_run to return (the return value itself will be in the
spe_stop_info_t structure if provided). The
ls_base is the effective address (PPE process virtual address) that the SPE's local store has been memory-mapped into.
data_ptr is the SPE pointer to the parameter that is passed from the SPE. Because the SPE's address space has been memory-mapped into the PPE's address space, it is very easy to move data back and forth from and to the SPE local store.
Since
data_ptr is an SPE pointer, it needs to be treated
specially. Remember that SPE pointers refer to the local store address space, not to
the PPE process's address space. This means that SPE pointers must all be
translated into the PPE address space before dereference. To do that, you need to:
- Have
ls_baseas a
char *in order that arithmetic on it will treat it as bytes.
- Add the SPE pointer to the
ls_base.
- Cast the result into the proper pointer type.
- Assign or dereference the new pointer.
For pointers to pointers (like
data_ptr usually is), the procedure is slightly more difficult since you have to do the procedure I just mentioned for each stage of dereferencing.
Using the memory-mapped local store instead of DMA makes it easy to access the arguments to the callback (which are in the SPE's local store). Accessing the SPE's local store through the memory-mapped interface can be slow because it goes through MMIO instead of DMA. However, for storing and retrieving small bits of data, it is not very problematic like it is for larger data sets. It has two advantages that are particularly useful for implementing callback functions:
- Memory-mapped data transfers do not have to keep 16-byte data alignments like DMA transfers do.
- Memory-mapped data transfers are much easier to perform since it is simply a short address-space conversion followed by a pointer dereference rather than setting up a DMA transfer and waiting for it to finish.
In any case, these examples will access the local store through memory-mapped addresses -- you can feel free to implement them using whichever communication method you wish.
For this example, I will implement a callback function which calculates the length of a
string. This is a bit redundant because
strlen() is already
implemented in the SPE's libc, but it makes a good example because it has a return
value, simple arguments, and a simple implementation. Here is what the PPE function will look like:
Listing 4. Example PPE callback function
Now that the actual code is written, I still need to write the stub on the SPE to run this function. According to the libspe2 specs, the SPE needs to have the following assembly language instruction sequence to use the callbacks:
You may have noticed that the code references my PPE code with a number,
0x2110. The hex digits
21 tell the
signalling mechanism that this is a PPE callback and the hex digits
10 references the specific callback that I am trying to call. On the
PPE side, each callback must be registered with the callback system on a specific number
between 0x00 and 0xff. 0 through 3 are reserved for C99, POSIX, and Linux® functions (these use a secondary "opcode" representing the specific function in the highest-order byte). Callback functions can be registered using
spe_callback_handler_register. The first parameter is the function address, the second parameter is the callback number to register, and the last parameter should be
SPE_CALLBACK_NEW. Note that while this is supposed to throw an error if the number is in use, this particular feature is a bit buggy. Therefore, if your callback isn't being called, try moving it to a different callback number.
Don't worry, you won't have to write assembly instructions yourself; there is a nice C function for that. To make the call from C, you need to use the C library's
__send_to_ppe function. This performs the assembly language magic needed to stop the SPE, signal the PPE, and pass a single argument.
__send_to_ppe is called with three arguments:
- The first one is the signal to send to the PPE. PPE callbacks begin with the hex digits
21and the next two hex digits refer to the callback number being called.
- The second argument is used for callbacks that code multiple functions and basically serves to allow the callback function to switch functionality based on the value. This value basically gets plugged into the high-order byte of the data pointer. Most simple applications just use 0 for this argument.
- The third argument is the data (usually a pointer) to pass to the PPE. Remember, however, that the high-order byte of the third parameter gets replaced with the value of the second parameter when the system actually passes the arguments.
__send_to_ppe makes it fairly simple to create stubs. In the string length example, the SPE stub looks like this:
Here is the complete listing for a program that uses the callback. First, I have the PPE code (enter as
callback_ppe.c):
Listing 5. PPE code illustrating callback functions
Here is the SPE code that demonstrates both the stub and some example code that uses it (enter as
callback_spe.c):
Listing 6. Program to create PPE callback stub and use it
To build, just do:
Problem state functions in libspe2
The problem state functions in libspe2 track the ones in libspe1 pretty closely. One difference is that all of the libspe2 functions use the return value solely for status and not for returning results. libspe2 functions return zero for success. On error, the error code will be stored in
errno. Another difference is that libspe1 functions usually take the SPE thread ID (of type
speid_t) as the first parameter, while in libspe2 it is usually the SPE context pointer (of type
spe_context_ptr_t).
Here are some of the function differences between libspe1 and libspe2:
Table 1. Function differences between libspe1 and libspe2
The transition to libspe2 should provide a more flexible environment for managing SPE processes. The 2.1 SDK officially deprecates libspe1, so transitioning soon is important. Also, libspe2 includes additional facilities such as callback registration which makes SPE programming easier.
Learn
- Get a jump on the upcoming changes by reading the "SPE Runtime Management Library for SDK 2.1" (IBM Semiconductor solutions library, March 2007) which describes the SPE Runtime Management Library, the library that constitutes the standardized low-level application programming interface for application access to the Cell/B.E. SPEs. There is a libspe1 to libspe2 migration guide that goes along with it.
- An oldie but a goodie, "POSIX threads explained" (developerWorks, July 2000) explains how to use pthreads in your code. As does this lovely tutorial, "POSIX Threads Programming.
- Explore the Cell/B.E. memory model (developerWorks, April 2006) with experts Mark Nutter and Max Aguilar.
- "Introduction to the Cell Multiprocessor" (IBM Journal of Research and Development, 2005) provides an introductory overview of the Cell/B.E. multiprocessor's history, the program objectives and challenges, the design concept, the architecture and programming models, and the implementation.
-.
- For more on Cell/B.E. programming, try the developerWorks's series "Programming high-performance applications on the Cell/B.E. processor," "PS3 fab to lab," and "The little broadband engine that could."
- Browse the technology bookstore for books on these and other technical topics.
Get products and technologies
- Here is the centerpiece of Cell/B.E. development, the latest Cell/B.E. SDK release, Version 2.1.
- representative.
Jonathan Bartlett is the author of the book Programming from the Ground Up, an introduction to programming using Linux assembly language. He is the lead developer at New Media Worx, responsible for developing Web, video, kiosk, and desktop applications for clients. | http://www.ibm.com/developerworks/library/pa-libspe2/ | crawl-002 | refinedweb | 2,625 | 61.87 |
3, .... r u..C0 r- Citrus .. g 9 and Lecanto o < 0 - square off. f - PAGE 1B Bush a' *^r i^ S "Copyrighted Material Syndicated Content Available from Commercial News Providers" Kings Bay project stumbles * ~ ~. ~. .zr.r~XC..,'x.fl V.tfl t ~ k. 1! *1 - *1 >Iuod in are er an (fle S Origanizer halts fimdraising MIKE VWRrOV-it mwright@ chronicleonline.com Chrionicle Stay close This is clear as the murky waters of Kings Bay. Unable to get a firm commit- ment from the Crystal River City Council that money raised for a Crystal Riverwalk Foun- dation wouldn't be used for anything but a multi-million 'dollar Kings - Bay boardwalk project, organ - izer Don Hess on Thtursda. abruptly puLit a halt to his plan Mean k hiled the consulting partner rs ip --,.. -.e firms Gift- A Counsel.com anid Avatar Com- pany, \which Hess had hoped the ftonldation would hire to plan the river%%alk, may be hired by the city itself to raise lloney to expand the cit'e s e aste%%ater treatment plant. And a planned March 13 presentation to the council by the consultants likely \%ill be postponed until the end of the month as city officials see itf the.[ have the money or inter- est in hiring the company Hess. a Kings Bay resident, spearheaded a drive months ago for what lie called tie Crystal Riverwalk, designed to protect the bay from high-scale development that would cause further pollution to the water- way Hess said he would raise millions ot dollars from local residents whose pocketbooks could afford such donations. He suggested creating a tfon- dation, then hiring consultants whose expertise is planning top-scale public'rnonprofit projects and know ing w here to find the money to fund them Bill Sheen, an lInerness couMncilnan and expert in pub- lic relations, is a member of S GiftCounsel.com's "team" of experts that the company nmai turn to for help with clients. Last summer, Sheen learned that the city was considering a new city hall and expansion of its sewer system and told Crystal River City Councilwoman Susan Kirk about the company, Kirk said. Earlier this year, Sheen, a member of the Citrus County Economic Development Council, heard Hess give his pitch for the riverwalk idea. Please see /Page 9A X Annie's Mailbox 6C w Movies .. ........ 70 S Comics. . . . 7C z Crossword ... ... 6C - Editorial ........ 14A " Horoscope ....... 7C Obituaries ....... 6A Stocks . . . . 12A Four Sections 6 118 11li II110 11 6 4578 20025 -- -- *K'SOH PMAN kphan@chronicleonline.com CIronouick There's a reason why Tom Anderson and Ste e Lamb can't stop smiling she's candy apple red and chrome and packs a w hop- ping two 80-cubic-inch, V-Twin, Harley Davidson engines. The two friends have been woork- State Rep. Charlie Dean set to testify TERRY WITT terrywitt@Phronicleonline.com Chronicle The possibility that State Rep. Charles Dean might testify against a Dunnellon engineer Tuesday led to a delay of an administrative trial and Patriot Act approved The Senate on Thursday approved an extension of the Patriot Act./16A ing for the last 18 months on this custom motorcycle, and they can't wait to debut this rolling thunder beauty this week at Daytona's Bike Week. "We want to go to Bike Week and just bring people off the curb." Lamb, the bike's owner, said. When people see this bike especially motorheads they're going to go crazy for it. allegations of politics. Attorney Fred Reeves, who repre- sents engineer Troy Burrell, said his client was already wary of how his case :was being prosecuted when he learned atthe 11th hour that Dean would testify' against him. Burrell, who owns Burrell Engineering in Dunnellon. is accused of negligently designing three drainage retention ponds at the Courthouse Annex in Inverness. His company was hired by Dooley & Mack Constructors to design and build the ponds. Dooley & U.S. envoy, driver killed A suicide bomber, blocked from driving into the U.S. Consulate, slammed into an American diplomat's car in Pakistan./16A "I'm going to have goose bumps, when I pull down Main Street Anderson and Lamb aren't ones for naming things, but not to worry. once this bike fires up, it'll be easi- ly identified. For Anderson, a renowned, mas- ter custom motorcycle builder for the past 30-plus years, and who is Please see SkIEi/Page 4A Mackbuilt the annex, an office building for the tax collector and property appraiser. The ponds overflowed in the summer of 2003 and flooded neighbor John Godowski's backyard. Godowski filed a complaint with the State Board of Engineering accusing Burrell of negli- gently engineering the ponds. Reeves and prosecuting attorney Douglas Sunshine, who represents the Florida Engineers Management Corp., both asked for a continuance of the case Tuesday, with each side accusing 'Miracle Worker' Z The Art Center a Theatre will g present the ( award-winning . William Gibson play during March./1C GET ON YOUR BAD MOTOR SCOO1fFK AND RIDE E Bile Week begins today and runs through Sunday, March 12 in Daytona Beach. For more about Bike Week visit http: '. ome.html. the other of producing. surprise wit- nesses. Administrative Law Judge William.E Quattlebaum granted a motion by both attorneys to postpone Burrell's tiial until May 3 and 4 in New Port Richey. The trial had been set for March 5 and 6. Sunshine said he wants to excuse engineer Wayne Pandorf and profes- sional surveyor and mapper William C. Lanigan, as well as former Citrus Please see TRIAL/Page 5A Computer glitch slows postal service a Network failures hit Citrus County post offices./3A * Economic Development Council compares funding./3A * Katherine Harris faces bribery scandal fallout./3A 3, ~ q~r',tsMw~....~rzaI 4." .A IK I" iii BRIAN LaPETERIChrorncle Motorcycle builder Tom Anderson, standing, and bike owner Steve Lamb are taking their newest creation a direct-drive, twin-engine motorcycle to Bike Week in Daytona Beach hoping to wow the crowds. CitrimCounty bike builders think twin-engine creation will be a hit at Bike Week Bot. ..... sides trade barbs as retention pond trial -.......postponed....... Both sides trade barbs as retention pond trial postponed n A I I AL IMLan S mp, ~~we ft wvq" - - a 600 OWN qwwa Qft 4" - a a B S a a S a 0 a 0 0 ~ - b. a-a. S --4 - .0 . - a =-R Mo.-I-s- 4 e-Nw og a ow do- q- -. 4D-ft .Now Odm.- a- 40-400- ~- -- -- ab dmm- a -E - b b MINN.- -- a f-.Iw a - 41W -a ..4b 41b a. a- -ww . o a m- qw Oft - ow __- ww u- - dump up.- 4D - ab.- .--M 1 .ago -- am Mo q a -.00 a ..-.f ,W- 111000 m a --lol .AD a -Imb a a- a .No.qw a.n qlp..Ww %-.N- -M --a- . 4b__ a-- -ap to pP=74 - .-W 0 * Availab mft. ae m ao a m *- g i -a" * 4b si 11- 0 q b m -q 4110 a- lw -.d 041ouoo 4 1oo,- a a-- a.- *- - .Copyrighe a rial ctedCnMaterial IB a s'- - a- le from Commercial ~News~ Pro ft04 _____* ** *- op.. ae - . %fq- yop-6r 410 alo * .~~ss^ s wc 0. * a- aa -a * S a-a a- -a * a- * 0 a- - M- a--Nmm am-Qad a mp S. - * 0 a- -a * a -a * a -a * 0 -a -a a-a * S -a * 0 a- a- a. a *0 0 a- a - a - a- ~ a - a- -a a- a S a- a -a -a- - a- a a- - -- a- - a. --f * a - a a a a 0a 0 0 * S -~ S a. * S a. . * a a-- - 0 a a a a a-t 4wa-4D a a -~w .m 0 0i 0 0 0 Im- ap. S 50 a- -m *.4b * a * -. a a *~m~ ~ - - Q a- - a - a- a * a- a. A a- - a- - ~ 0-a 0* _____________________________________ a- _____________ -a *- a-- - a -a - a a. a a.- - S a- -~ a. a- a- - S a- a S a- 0 - a -a a- - a - S a a. a. -a *ja~ ~ *a - - 4 a Wb 4 - - awmm -M a- -oow- p o Ow 00 410 aw 40 o O I a.- 4b a- a -OW a- a- a - 40- a 40 -mm .Mqp ma. b 4-a a 4WD a ~ ____ 4w M d mim0 ~ a um ap ON a- wal-- -RMa a&Ms 40 mom-4wa am S wm- 40 4000D nowft -. a- w~ mm a- a q a qs mmb"No*~- qm 4ft..a- 40-w- t -4-0 40 f- o* * - - qpq 4w0S 41111M 111M I .- f-o a -am m 0pmwa * so 4a a 4pw -amf W- 40W m m so mpmeo-a 401 4 v -- -- .1 5.. F "y: 4..~rj I ~ -- ~ ,; S. 11'.> * FRIDAY MARCH 3, 2006; ww .chronicleonline.com Computer glitch slows postal service Homosassa Springs reporting network failure that lasted for at least a few hours. The glitch affected computer systems that ran electronic scales for weighing packages, as well as systems that processed credit and debit card orders and related transactions. Steve Hardeman, postmaster for the Inverness post office off U.S. 41, said his computers went down around 10 a.m. and were offline for about three hours. Transactions for such things as stamp sales had to be manually entered on calculators, and older scales previ- ously replaced by electronic ones - were taken out of storage to weigh items. Hardeman said his office received a message from the Postal Service that a security patch had been installed Wednesday to the system network, shortly before it crashed. He was quick- ly reminded of what life use to be like before computers. "When that goes down, man!" he said. About 250 post offices of 15,000 nationwide were affected by the 0lil li, he said, according to information he received. Daria Chilton, supervisor of the Lecanto post office, said the glitch caused some problems, but for the most part, things ran smoothly Some pack- ages were sent to a nearby location con- tracted with the Postal Service so pack- ages could be weighed. She also said the office was able to sell stamps and ring up other transac- tions, and that everybody was put into the backup plan, adding, "We didn't want to close our doors down or any- thing." Strawberry stakes Economic Council of 47 county EDCs tound that 84 percent are public-private partnerships, EDC president Jack Reynolds said. Most budgets were higher, many counties offered vehicles for their executive directors and the average salary was in the $86,000-range. Citrus County's budget, which comes from a percent- age of the $25 occupational license fees that businesses pay annually, is $131,000. It also receives private funding through dues paid by business- es, Reynolds said the public/private support split is about 70 percent public and 30. percent private. County commissioners this week tabled until March 14 a decision on renewing the EDC's contract. Wattles said the commission will ask the , FC' to .mee( \itIh thation that -aite ic' tt's"&st Ilk' h OIc m'a'l ,;:> . tOeyMPld.- .,id later Thursday that Conmissionier Joyce VNn01111110 was the only commissioner to say outright she doa.._'it support public funding for the EDC, He said other commissioners had con= c rns and ,,ti.llMn, but nothing that would lead him to believe they wanted to cancel the contract, Commission tables contract decision MIKE WRIGHT mwright@chronicleonline.com Chronicle When officers with the Economic Development Coun- cil met with individual Citrus County commissioners last month, some said they support- ed economic development, but questioned the need for public funding. What commissioners want- ed, EDC members said Thurs- day, was a comparison with similar-sized counties. EDC Executive Director Brett Wattles reported he did. just S'7 v'1-: .Herrv;.'t :mid Both counties had EDC budgets at least twice the size of Citrus's, and both had signif= ieantly more public ruiidiing fi'om a percentage standpoint, Wattles saiad during the Ri-kl , mecutive committee meeting, Plus, an independent study conducted for the Florida N P9 NASA to ptpvd up nivnew & by a 0owe S - - e - - CATHY KAPULKAIChwnid Linda Sutton hammers a stake in the ground to mark a spot for a vendor to set up at the 'L9th Annual Floral City Strawberry Festival, The festival will take place Saturday and Sunday at Floral Park on U.S. 41, 24/2 miles south of Floral City, The festival hours are from 9 a.m. to I p.m. Saturday and 9 a.m1 to 4 p.m, Sunday. Additional parking will be available at the Citrus County Fairgrounds with fie- shuttle service. For more Information, call the Citrus County Chamber of Commeree at 12- 2801 or 7 t149, "&"PAP"-' - C - - * - C Available from Commercial News Providers" DAVE PIEKLIK dpieklik@chronicleonline.com Chronicle The U.S. Postal Service ,,\pcrinecd a computer glitch Thursday that caused network failures across the nation, including Citrus County. The network problems affected about 2 percent of post office locations across the country, according to a statement from the Postal Service. "The Postal Service was experienc- ing network problems, which were affecting our Point of Service (POS) ter- minals at retail locations nationwide. In some cases, Automated Postal Centers were temporarily affected," the statement read, in part. "To minimize customer inconvenience, established workaround procedures were imple- mented at all affected post offices." Debra Fetterly, Postal Service spokeswoman for central Florida, said it was unknown what caused the com- puter glitch. She said most locations were up and running by mid-afternoon. Fetterly was unable to elaborate about what the "workaround proce- dures" were, except to say they were "backup plans" that offices utilized. The failures were experienced throughout Citrus County, with workers at post offices in Inverness, Lecanto, Beverly Hills, Crystal River and About 250 post offices hit nationwide County BRIEFS Nokomis Point vote deadline nears The deadline to register to vote for the April 4 mail ballot election is 5 p.m., Monday. Only voters registered by March 6, 2006, living on Nokomis Point will be allowed to vote in this election. Registered voters will be sent a mail ballot not more than 20 days before the elec- tion. Contact the Supervisor of Elections office at 341-6740 for additional information. Right to Life bike event starts today , The first Right to Life bike-a- thon begins at 7 a.m. today in, Floral City. Bike riders will travel from Floral City to Citrus Springs along the Withlacoochee Trail, then back through Floral City, down to Dade City and back to Floral City. The entire ride will cover 100 miles. Bike riders began participat- ing Feb. 17, in rides throughout the state to support the Right to Life cause. The state "Love for Life" banquet will be the final portion of the program,. and is set for Saturday at the Citrus Springs Community Center. Sierra Club to discuss toll road The Nature Coast Sierra Club will host a town hall meeting at 2 p.m. Sunday, March 26, at the National Guard Armory on Venable Street, Crystal River, to discuss projects of concern to the group including the Suncoast II toll road. The Sierra Club is a global organization with local affiliates that advocate for the environ- ment. Doors will open at 1 p.m. Fair winners to show work at carving club The Nature Coast Carving Club will present the seven local carvers and their work that won 23 ribbonsiat the o= oda Sate Tr? e mEeti2 is aY: 0 T rn m.T" Friday at tie Lake Regior Library on Druio Road in Inverness. The public is invited. From staff reports State BRIEFS Teacher in incident faces suspension CLEARWATER A teacher has been recommended for suspension after she did not allow a student to use a rest- room, resulting in the student urinating in a trash can in a closet, school officials said. Clearwater High School teacher Lesley Campbell violat- ed the school district's policy, distlidct officials said. Lotto jackpot rolls over to $21 million TALLAHASSEE No tickets matched all six Florida Lotto numbers to win a jackpot of $15 million, lottery offi- cials said Thursday. s The netijackpot l will rollover to $21 million, officials said. A total of 79 tickets matched flwe numbers to win $5,698; 5,397 tickets matched four num- bers for $67.50; and 109,370 tickets matched three numbers for $4,50 The winning Florida Lotto unibers selected Wadnesday 'rtyi Wt tei" r EDC surveys public funding "Copyrighted Material Syndicated Content- ,m",- -- - -J ."A m: -_", q -"A.67. I _2 ml- ja *wgh Wod UMIwA wow, %,dwr tgo;WwA V*4&M irm wpporlq ntmmbur- Twar 4 ml Iviur I'M I "'I'Ofillitwilf)-C-if, mmor", Q ... . - * - f * - O A& FRIDAY. MARCH 3. 2006 - * Copyrighted Material __ - - Syndicated Content Cimus COUNTY (FL) CHRoNIcdE 4b- -~ ~ 0 low 2-.Available from Commercial News Providers"- - - a.-. - - - m -.- - - - -- . ft-de 4b. q..w-- - qb-0 -a BIKE Continued from Page 1A simply called "The Godfather," this particular project was a long time coming. "For 20 years, I've always wanted to build a twin-engine bike," Anderson said. "Steve asked, 'Can you do it? I said, 'Oh yeah."' Why put two engines on a bike? "People asked me that all the time. I said, 'Three just looks too gaudy,"' Anderson said with a laugh. Twin-engine bikes are fairly rare, but this particular one is extra special. "It's an experimental con- cept," Anderson said. "It's a direct-drive, twin engine, which means both motors run as one. Other twin engines have special clutch systems." Anderson admitted that syn- chronizing both engines was taxing and downright frustrat- ing at times. When-asked about how the feat was accom- plished, the usually talkative Lamb was tight-lipped. "We spent an inordinate amount of time trying to figure this out," Lamb said. "We've got something here that we're keeping a secret, and people are going to beat their brains out trying to figure out how we did this." Adding to the uniqueness of the bike is the fact that one belt and one starter drive its engines. The transmission is a separate chain-driven design. While both engines do run simultaneously, Anderson has the bike designed so that if one of the motors should fail, the bike will still easily run. When the bike fires up, Anderson estimates it can kick out about 160 horsepower. Despite all the power, Lamb said it travels smoothly. "I wanted the bike to be very rideable," he said. "I told him that I didn't want some high- horsepower thing I couldn't handle." Besides the obvious mechan- ical designs, the bike is stun- ning to look at Though it packs two engines, the bike is only 2 inches longer than the typical chopper and is quite sleek It's so sleek that even when it's sit- ting still it looks like it's moving. Adding to the bike's smooth- ness is it's thicker-than-usual frame, which serves both a functional and aesthetic pur- pose. "One nice thing about this bike is that the tubing is so big you can run all the wires right through it," Anderson said. "Everything is internal, even the cables for the clutch and brakes." Besides the wiring, the bike's various switches are also hid- den. The toggles to start the bike and the ones to light it are all hidden underneath. No expense or detail was spared on this project The seat is made of eel skin and even the undersides of the compo- nent pieces were painted. World-class fabricator Kirk Hum, who used to work for drag-racing legend Don Garlits, spent an estimated 550 hours crafting the metal on the bike. Hum did everything from build the bike's twin six-gallon gas tanks to diamond-cutting accents on various other parts of the bike. Hum, and other build team members Anderson, Lou Huntington and Bill O'Brien all hail from Citrus County, a fact that makes Lamb proud. "This is something that can put this area on the map," he said. The only thing was that did- n't come from the county was the paint job, which was done by renowned artist Chris Cruz, who resides in Deland. All Lamb would say for the cost of all this effort was that the bike costs somewhere in the six-figure range. Anderson and Lamb have collaborated on many bikes before, spending their toils in Lamb's "T-Barn," a spacious garage filled with everything from custom choppers, vintage cars and even a dandy of an air- boat Supporting this unique hobby is Lamb's wife, Jewel, who with Steve co-owns the Crystal Motor group. Anderson said that he will enter this bike into as many show contests as he can while in Daytona. He expects it to be a stunner and hopes to brings home some trophies and prize money. While contests and recogni- tion are in their sights, bikp building for Anderson and Lamb is a whole lot more thah that. "It's a challenge to see if we can push the technology fur- ther," Lamb said. "I want tb take the whole custom bike thing to a whole other level." Lamb and Anderson expect to bring home some hardware, but they don't expect to return with the bike. Lamb said thEt he's already received quite a few handsome offers for the bike, and he will most, likely sell it The thought of parting with this beauty wrenches at his heart, but he won't be downcast for long. "We have an even cooler ide4 for the next one," he said. "Wait until you see that" ----- ---- For the RECORD Crystal River Police DUI arrest Liza Carmella Mastronardi, 26, 11058 W. London Lane, Homosassa, at 2:38 a.m. Thursday on charges of driving under the influ- ence and criminal mischief. According to the arrest report, after being placed in the backseat of a patrol car for DUI, Mastronardi repeatedly kicked the rear window. She reportedly bent the doorframe and knocked the window off its track. She had to be subdued with pepper spray. Bond was set at $1,000. Other arrest Eric Hamilton Thurman, 25, 927 N.E. 7th Ave., Unit D, Crystal River at 7:35 p.m. Wednesday on charges of resisting an officer with violence and possession of drug paraphernalia. According to the arrest report. ,.-Thurman repeatedly struggled with officers, including shoving an officer into a wall. Thurman was pepper sprayed multiple times, but still con- tinued to be resistant. He was even- tually subdued and handcuffed. Officers reportedly also found sever- al marijuana pipes in his residence Citrus County Sheriff SDomestic battery arrests William Ridge Brown, 40, Hemando, at 1:25 a.m. Thursday on a charge of domestic battery. According to the arrest report, Brown pushed and choked a woman. No bond was set. Joseph Michael Czamecki, 40, Inverness, at 8:19 p:m. Tuesday on charges of domestic battery, tam- ON THE NET 0 For more information about arrests made by the Citrus County Sheriff's Office, go to and click on the link to Daily Reports, then Arrest Reports. pering with a witness and assault. According to the arrest report, Czamecki is set to go to trial next month for a domestic battery case from July 2005. He choked and threatened to kill a woman if she did not drop the charges. Czamecki denied the allegations. No bond was set for the domestic battery charge, while the bond was set at $5,250 for the other charges. Joseph Lee Pendleton, 38, Homosassa, at .11:26 p.m. Wednesday on charge of domestic battery. According to the arrest report, Pendleton grabbed a woman by the wrists and held her down on a bed. No bond was set. Allen West, 52, Citrus Spriegs, at 11:15 p.m. Wednesday on charges of domestic battery and vio- lating an injunction. According to the arrest report, West hit a woman with a cane. No bond was set. SMITHRBARNEY. citigroup" Edmund D. "Ned" Barry & Jeff McDonald Financial Advisors Retirement Specialists Cordially Invite You To Attend A Hands-On Workshop "Investing & Spending In Retirement" Living Longer & How To Prepare For It Establishing Feasible Spending Rules Focusing On Real (After Inflation) Returns Designing A Portfolio For Your Lifetime Leader: Edmund D. "Ned" Barry Financial Advisor Smith Barney (Learn more about Ned at) Date: Thursday, March 161, 2006 Time: 4:30pM-6:00PM Location: Central Ridge Library (Community Room) RSVP: Ned Barry at (352) 249-1042 or - Ruth ann Talsky at (800) 342-9627 2701 SW 34th Street, BUilding 100, Ocala, FL 34474-3314 -Tol (352) 438-1325 Fe (352) 438-1350 -Toll Free (800) 342-9627 02005Smii Bneyt dBaO t le loe( t, Is rilgroJpcl obdMutEitelonc eCndi i Bll1etesndsused andregisteredth foghxfouthewfd O igrp th umbrela Dvtca ere trademarks of CdcvrpcIsWaeffslareatw e uad ardvreitered thtiqho the wCod CsIgrxjp[GcbdMarkets,inc 15ememblrof t SflJnttiz lweithrProtcton Corp ftion SPC) Other arrests Charlotte Elizabeth Eskridge, 46, 3054 E. Scofield St., Inverness, at 10:21 p.m. Wednesday on a charge of petit theft. Bond was set at $250. Melissa Lachelle Haeussler, 36, 7138 N. Farmingtori Terrace, Citrus Springs, at 5:51 p.m. on a charge of petit theft. She was released on her own recognizance. Dee Ellis Leach, 41,3781 Indian Rock Point, Citrus Springs, at 11:52 p.m. Wednesday on charges of pos- session of drug paraphernalia and obstructing an officer without violence. According to the arrest report, Leach had a brass, smoking pipe in her bag and also ran away from a deputy as well provided false information. Bond was set at $1,000. a Steven Ray Major, 18,2525 N. Lantern Terrace, Hernando, and Michael David Raley, 18, 8270 E. Windsong.Street, Floral City, at 3:36 p.m. Wednesday on a charge of principal in the first degree. According to the arrest report, both Major and Raley knew an arson would takeplace and did not prevent it from happening. Both men were cooperative with deputies in provid- ing information about who did com- mit the crime. Both were released on their own recognizance. Lillian Rosario Pacitti, 48, Now seeing patients at our NEW LOCATION Dr. Daniel Robertson, M.D. Board Certified in Neurologic Surgery Specializing in: Surgery for Brain, Movement Disorders, Lumbar and Cervical Spinal Conditions Please call to make an appointment 352-622-3360 West Marion Medical Center 4600 SW 46th Ct. Bldg #200 Ocala, FL 34474 Hwy 44 Fontin qInvenes 3671 Ridgecrest Court, Inverness, at 11:39 a.m. Thursday on a charge of uttering a forged instrument. According to the arrest report, Pacitti forged a check, changing the amount from $115 to $1,115. She was released on her own recognizance. - C I T R U S,.'-" Daniel Anthony Padilla, 28, 817 S. Apopka Ave., Inverness, At 4:55 p.m. Tuesday on a warrant that contained two counts of possession of a controlled substance and twb counts of intent to sell a controlled substance (cocaine). Bond was set at $40,000. ..0 UN TY -H ONICLE Florida's Bst Comm ty Newspaper Serving Florida's Best Community , To start your subscription: Call now for home delivery by our carriers: Citrus County: (352) 563-5655 Marion County: 1-888-852-2340 j or visit us on the Web at .html to subscribe. 13 wks.: $34.00* 6 mos.: $59.50* 1 year: $105.00* *Plus 64 Florida sales tax SFor-mallonlne.com Where to find us: . Meadowcrest office Invemess office 81 8. {A0deocr441 - .9 ---mw 41b MOD O Q FRIDAY, MARCH 3, 2006 SA -A C1-USJUNIYI (PL) CHRONICflLEA TRIAL Continued from Page 1A ,County Public Works Director _(en Frink, all of whom were named as defense witnesses on Feb. 23, less than two weeks ',before the trial. Or, if he can't ,excuse them, he wants to Iepose them. Reeves said he may file a ,motion asking for Dean to be "excluded as a witness. He said Dean is not an expert scientific ivitness and. his presence would politicize the case. He said if Dean does testify, it will ,probably be in advance of the trial. A transcript would be provided to the judge. "If you take away the evi- dence, you have a state repre- sentative choosing sides between two of his con- stituents," Reeves said. "We were ready to go to trial until this." Burrell designed the drainage ponds to capture and treat stormwater runoff from the annex's roof and parking lot on North Apopka Avenue, but he said he received faulty information about the seasonal high water table from Central Testing Laboratory, the compa- ny hired by the county to do soil testing at the site. He blames CTL for the bad pond design. Dean, R-Inverness, said he knows nothing about Burrell's case, but was asked by Godowski to give a statement about whether he ever saw flooding on Godowski's proper- ty before the drainage ponds were built. Dean, who has lived in the Inverness area since 1947, said as a boy he rode his bicycle past Godowski's property (before it was owned by Godowski). "I never saw the water stand- ing there making a pond behind his house, and I've lived here since 1947," Dean said. "Whenever it rained heavy the water would drain to the ditches and run to the lake. It never flooded." Frink was employed as pub- lic works director for the coun- ty at the time Burrell submit- ted plans for the drainage ponds. Frink left his job with the county to work for Burrell at the same time as former county engineer Ken Cheek. Both are now employed as engineers with Burrell Engineering. VACATIONING? * Remember to take photos ,during the trip, to submit to the Dream Vacation Photo Contest. * Send in a photo with a brief description of the trip. Include the names of anyone pictured, and include a contact name and phone number onr the back.Weekly winners will be pub- lished in the Sunday Chron, le. At the end of the year, a panel of judges will select the best photo during the year and that photographer will win a prize. * Avoid photos with computerized dates on the print. * Submit photos to the Chror,cle at 1624 N. Meadowcrest Blvd Cry-'-tal PR.er, FL 34429. Help prevent damage from bark beetles, diseases, and wildfire through practices that promote healthy pines. * Thin dense pine stands.' * Control understory plant competition. * Minimize tree wounds during harvests, PREVENT v Qlr"mM * Use prescribed fire. * Harvest low-vigor stands and replant. * Plant species right for the soil and site. A message from the Florida Department of Agriculture and Consumer Services, Division of Forestry, the University of Florida/IFAS, and the USDA Forest Service. ^1.- ^.^---- -"i " I-^ NOWl I U * New Television Guide * This Sunday in the CiT RU S CO U N T Y CH ONICLE 6859823'; 658215 I Lilo:Fil . ..,. es.......,, ran c.,,,m,,,,,,, CITRUS COUNTY (FL) CHRONICLE Obituaries .. Ruth Berger, 83 INVERNESS Ruth Mary Berger (nee Daudlin), 83, Inverness, died Wednesday, March 1, 2006. She was born May 6, 1922, in Detroit, Mich., the daughter of William Sr. and Marie Daudlin. Ruth and her late husband , Bill had been residents of Inverness since 1979, making it their perma- nent home in Ruth 1994. Berger She spent her career as a customer service manager at Sears, retiring in 1970. She was an active member of Our Lady of Fatima Catholic Church, where she was a mem- ber of various prayer groups, the choir and the St. Vincent DePaul Society, (Helping Hands). Her husband of 33 years, Bill Berger Sr., preceded her in death. Survivors include six sons, Bill Jr. and wife Jan of Magnolia, Texas, Jim and wife Beth of Hewitt, Texas, Bob and wife Alice of Battle Creek, Mich., Jerry and wife Sue of Grosse Pointe Farms, Mich., David of Harbor Beach, Mich., and Leo and wife Maria of Martinez, Ga.; four brothers, Bill Daudlin and wife Lyle of Sterling Heights, Mich., George Daudlin and wife Vi of Grosse Pointe Farms, Mich., Bob Daudlin and wife Eunice of Sterling Heights, Mich., and Dick Daudlin and wife Lenore of Crosswell,Mich.; four sisters, Bette Castle of Birmingham, Mich., Maureen LeVasseur and husband Bob of West Bloomfield, Mich., Carol Cote and husband Harry of Gladwin, Mich., and Sister Eileen Daudlin, SSND of Elkhart, Ind.; 26 grandchildren; nine great- grandchildren; and numerous nieces and nephews. Heinz Funeral Home, Inverness. George Danison Jr., 83 INVERNESS George D. Danison Jr., 83, Inverness, died Wednesday, March 1, 2006. He was born July 6, 1922, to Lola A. (West) and George D. Danison Sr. He moved to this area in 1992 from his native St. Petersburg, where he was employed as a city fireman for more than 21 years. Mr. Danison was a U.S. Army veteran serving during World War II and the Korean War. He was a flight instructor for Bay Air at Albert-Whitted Airport in St. Petersburg, and he was a former member of the St. Petersburg Glee Club. A Protestant, he was a mem- ber of the Christ United Methodist Church in St. Petersburg, where he sang lead tenor with the choir. His daughter, Sally Danison, preceded him in death June 11, 2003. Survivors include his wife of 58 1/2 years, Barbara Danison of Inverness; son, George D. Danison III and wife Janice of Wilmington, Ohio; daughter, Cindy Sweeney of Milton; brother, Charles Danison of St Petersburg; sister, Betty Dornbush of St. Petersburg; three grandchildren, Brian, Scott and David Sweeney; and three great-grandchildren. Hooper Funeral Home, Inverness. Ruth 'Willy' Dittrich, 88 HOMOSASSA Ruth "Willy" Dittrich, 88, Homosassa, died Tuesday, Feb. 28, 2006. Born Feb. 12, 1918, in Brooklyn, N.Y, to Harry and Ethel (Calabush) Block, she moved to this area from Stephentown, N.Y, in 1976. She was the owner of a motel in Ridge, Long Island, N.Y She was Lutheran. In addition to her parents, she was pre- ceded in death by her hus- band, John F . Dittrich, in 1999. Dittrich Survivors include her son, John Dittrich of Homosassa; daughter, Diane Toto of Homosassa; five grand- children; and two great-grand- children. Hooper Funeral Home, Homosassa, Carolyn Letz, 63 BUSHNELL Carolyn C. Letz, 63, Bushnell, died Monday, Feb. 27, 2006, in Inverness. She was born Feb. 7, 1943, in Johnson City, Tenn., to Charles and Louise (Keefauver) Dyer and moved to this area in 2002 from Naples. Ms. Letz was a department store retail manager. She was an avid Bucs and NASCAR fan. She enjoyed her cats. She was Baptist. Her parents preceded her in death. Survivors include her son, Louis Richard Letz Jr. of Spring Hill; daughter, Rhonda Letz of Bushnell; brother, Grayson Dyer of Jonesboro, Tenn.; sisters, Margie Boughen of Dana Point, Calif., and Judith Leonard of Johnson City, Tenn.; and two grandchil- dren, Keri and Lanah. Hooper Funeral Home, Inverness. Grace Pedota, 88 BEVERLY HILLS Grace Jean Pedota, 88, Beverly Hills, died Wednesday, March 1, 2006, at Seven Rivers Regional Medical Center in Crystal River. Born Nov. 10, 1917, in Astoria, N.Y, to Anthony and Vita (Santa) Disabota, she moved here seven years ago from Fort Lauderdale. Mrs. Pedota retired from Bulova Watch Co. as an inspec- tor with 43 years of service. She enjoyed reading and playing bingo. She was Catholic. Survivors include her hus- band of 69 years, Nicholas Pedota; nephew, Peter D. Cerni of Glen Cove, N.Y; one grand- child, Lynn Pedota of Inverness; and three great- grandchildren, Alfred, Thomas and Johanna Grossbauer. Chas. E. Davis Funeral Home with Crematory, Inverness. Walter Shaver, 87 DUN NELLON Walter W Shaver, 87, Dunnellon, died Tuesday, Feb. 28, 2006, at West Marion Hospital in Ocala. A native of Shavertown, Pa., he moved to this area in 1997 from Fort Lauderdale. Mr. Shaver was a mechanic by trade. He was active in bowling leagues in both Holder and Fort Lauderdale. Survivors include his wife, Dorothy Shaver of Dunnellon; three daughters, Barbara Tavano of Sebring, Janet Crawford of Dunnellon and Bonnie McCarrier of Hoover, Ala.; and six grandchildren. Roberts Funeral Home of Dunnellon. Manuel Silva, 82 INVERNESS Manuel B. Silva, 82, Inverness, died Wednesday, March 1, 2006, at the Hospice Care Unit of Citrus Memorial Hospital. Born Oct 4,. 1923, in Faial, Azorces, Portugal, to Manuel B. and Tereasa DaSilva, he moved to this area 15 years ago from Barrington, R.I. Mr. Silva was a truck driver and served in the Portuguese Army. He loved to fish and enjoyed gardening in his yard. He was Catholic. Survivors include his wife of 60 years, Maria C. Silva of Death ELSEWHERE Owen Chamberlain, 85 P H-YSICIS T- BERKELEY, Calif. Owen Chamberlain, who shared the 1959 Nobel Prize in physics as co-discoverer of the antiproton in atomic physics, died Tuesday of Parkinson's disease, officials -at the University of California, Berkeley, said Wednesday He was 85. Chamberlain, a professor emeritus of physics at the uni- versity, died at his Berkeley home, officials said. Chamberlain and Berkeley physicist Emilio Segre shared the Nobel Prize for discovering the antiproton, which is the counterpart to the positively charged proton. "The discovery opened up a CPfua. E. Wa 'Funeral -H[ome 'With Crematory HERMAN GRAHAM Services & Burial in Indiana TARA PROPP Visitation: Sat., 3-5 PM WELLS HARLING Service Sat., 11AM Hernando Methodist Church HAZEL ZIPPERER Services Valdosta, GA BEATRICE MOLINERO Private Cremation Arrangements GRACE PEDOTA Private Cremation Arrangements HAROLD BURGET Private Service: Florida National S221 726-8323 whole new field of physics and expanded our understanding of particle physics'," ; said Chamberlain's colleague and former student Herbert Sterner, a professor .of physics at UC Berkeley Chamberlain was a humanist and social activist who took part in Free Speech Movement ,.. demonstrations in the 1960s and spoke out or race relations, the Vietnam War and many lib- eral causes. Steiner said. In the 1950s and 1960s, he campaigned for a nuclear test ban treaty. Chamberlain retired in 1989, but had continued to attend weekly department meetings, including one last week Chamberlain was born July 10, 1920, in San Francisco. He graduated froim Dartmouth College and enrolled at UC Berkeley, where he joined the Manhattan Project. He was present at the first atomic bomb test in New Mexico, where he lost a $5 bet it would not explode. Inverness; three sons, George Silva and wife Mary Jo of Pawtucket, R.I., Louis Silva of Bushnell and Steven Silva of Inverness; two daughters, Fatima Avila of Seekonk, Mass., and Natalie Dicks and hus- band James of Crystal River; eight grandchildren; and three great-grandchildren. Chas. E. Davis Funeral Home with Crematory, Inverness. Frank Spallane Jr., 71 INVERNESS Frank "Frankie" M. Spallane Jr., 71, Inverness, died Tuesday, Feb. 28, 2006. Born Feb. 1, 1935, in Troy, N.Y, to Frank Sr. and Bertha (Drozd) Spallane, he moved to this area in mid-1980s from Albany, N.Y 'Mr. Spallane was retired owner/opera- tor of Frankie's Cars. He served in the Navy Reserve. He was a 21-year member of the Elks Lodge, a member of the Knights of Columbus and the I.U.O.E. Local No. 106, all of New York He was Catholic. He was preceded in death by his parents; and lifelong com- panion, Margaret Moschini (2002). Survivors include three sons, Michael Spallane of Inverness, Anthony Spallane of Albany, N.Y, and Stephen Spallane of Athens, N.Y; two daughters, Michelle Alber of West Sand Lake, N.Y, and Susan Spallane of Waterford, N.Y; brother, Walter Spallane ofAverill Park, N.Y; sisters, Barbara Della Rocco of Latham, N.Y., and Mary Belcastro of Las Vegas, Nev.; eight grandchildren, Diana Spallane of Inverness, Gabrielle Spallane 'of Inverness, Antonette Spallane of Albany, N.Y, NikolaS Baldwin of Waterford, N.Y., Corey Spallane of Athens, N.Y., Jenna Spallane of Athens, N.Y., Jessica Alber of West Sand Lake, N.Y, and Michael Alber Jr. of West Sand Lake, N.Y; and special extended family, Steven Moschini of Cohoes, N.Y, and Tina Kear of Delmar, N.Y. Hooper Funeral Home, Inverness. Click on- cleonline.com to view archived local obituaries. Funeral :: Ruth Mary Berger. Visitation for Ruth Mary Berger, 83, of Inverness, will be between the hours of 2 and 4 p.m. and 6 and 8 p.m. Friday, March 3, 2006 (today), at the Heinz Funeral Home, 2507 State Road 44 West in Inverness. A vigil service will be conducted at 2 p.m. The Mass of Christian burial will be at 10 a.m. Saturday, March 4, 2006, at Our Lady of Fatima Catholic Church in Inverness. Fr. Charles Leke will preside. Additional services and inter- ment will be in Michigan. Frank "Frankie" MY Spallane Jr. The service of remembrance for Mr. Frank t. Spallane Jr., age 71, of Inverness, will be conducted at 6 p.m. Tuesday, March 7, 2006, at the Inverness Chapel of Hooper Funeral Homes, Cremation will be under the direction ofHooper Crematory, Inverness. WEEKLY AQUATIC SPRAY SCHEDULE FOR CITRUS COUNTY Citrus County's Aquatic Services Division plans the following aquatic weed control activities for the week beginning MARCH 6,2006. HERBICIDE TREATMENTS: Chassahowitzka.. Torpedo Grass/Hydrilla/Hyacinth/Lettuce Floral City Pool Hydrilla/Salvinia/Sedges/Tussocks/Coontail/ Hyacinth/Lettuce/Torpedo Grass/S. Naiad Hernando Pool Nuphar/Grasses/Water Hyacinth/Lettuce/ Hydrilla/Tussocks/Sedges/S. Naiad /Cattail Inverness Pool Hydrilla/Frog's Bit/Grasses/Tussocks/Sedges/Water Hyacinth/ Lettuce/Nuphar/Fanwortl Bladderwort/ S. Naiad/Pondweed MECHANICAL HARVESTING: Crystal River Lyngbya Inverness Pool Tussocks/Fanwort Hernando Pool Tussocks/Nitella/S. Naiad/Fanwort I **''' COOKIE CUTTER - Inverness Pool W illows . . All treatments are contingent upon weather conditions and water quality. Treated areas will be identified with 'Warning Signs" indicating the date of treatment'and the necessary water use restrictions. For further information, please call 352-527-7620 Citrus County Division of Aquatic Services S Serving' You For Two Generations n rickland Funeral Home and Crematory Since 1962 352-795-2678 1901 SE Hwy. 19 CRYSTAL RIVER, FL 34423 6ATRiDAY, MARCH 3,,206 --U-IO AM A --, 4 J * FRIDAY, MARCH 3, 2006 7A Participate In Choosing "KHE B'j OF CITRUS COUNTY CHRONICLES The Citrus County Chronicle is asking you, our readers, to participate in the Tenth Annual "Best of the Best" Reader's Choice Contest for the best F food,people,places, shopping and services in Citrus County. J I| Tell us your picks for the "Best of the Best" by filling out the official entry ballot on this page. As a thank you for your time, we will enter all qualified ballots in a random drawing for a free Circle of Love pendant in 14k God with chain from Kenneth Charles Jewelers. Of Tf1 [ One entry per person. Just follow these guidelines: All Ballots should be clearly printed. The business must be clearly identified as it would appear on the physical location. If multiple locations exist, please specify location by city. Your nominations must fit the appropriate category. Use D the official entry ballot (this page). All ballots must be received at the Citrus County Chronicle by 4 p m. on Monday, March 13,2006. Ballots may be f- S mailed to: Citrus County Chronicle, "Best of the Best," 1624 North Meadowcrest Blvd., Crystal River, Florida 34429, or you may drop off the ballot at either the Crystal River or Inverness office. I la H Join us in our Eleventh Annual "Best of the Best" Reader's Choice Contest! Send in your nominations today! Then watch for the results in the Chronicle's special Readers Choice Section to be published in the June 17, 2006 edition of the Citrus County Chronicle. VVVvvvvvvvv Air Conditioning/Heating Service Aluminum Contractors/Screen Enclosures Antique Store Appliance Store Arts & Crafts Store Art Gallery Assisted Living Facility Automotive Repair Bakery )p mattress in r or Repair & Service Retail , Used Bowling Alley Burglar Alarm System Campground Candle Hearing Aid Center Home Builder Home Repair & Maintenance Home Remodeling Contractor Hot Tub & Spa Dealer Hotel/Motel Insurance Agency Insurance Company Interior Decorator Internet Provider Investment Firm Jewelry Store Karate & Martial Arts School Kennels Lawn Care & Landscaping Center Lighting Store Liquor Store Local Event Local Golf Course Locksmith Lounge Marina 1 f ni i &L'1 OCircle '" of Love Pendant in 14k Gold ,,: it/i1 C ]wthith c Meat Market Medical Center Mobile Home Dealer Movers Music Store Motorcycle Dealer Nail Salon Newspaper Foreign Auto Repair Framing Furniture Funeral Home Gift Shop Hair Salon Hardware Store Health & Fitness Club Health Food Store OpticalNision Center Outdoor/Patio Furniture Park Paint Store Pawnbroker Pest Control Service Pet Grooming *hain Pet Shop Photo Center Plant & Garden Nursery Plumber Pool Builder Printer Radio Station Real Estate Agent Real Estate Company Resort River Cruises Roofer RV Dealer Satellite Dealer Sewing Machine Dealer Shoe Store Shopping Center: A+mnqonhkro Banquet Facility Bar-B-Que Breakfast Buffet/Salad Bar Burgers Chinese Cuban-Food. Deli Dessert Fine Dining Home Cooking Italian Mexican Pizza Seafood Service Sports Bar Steaks Wings Mail your official entry form and completed ballot to: Citrus County Chronicle 25% 4 c/o Best of the Best of ballot 1624 North Meadowcrest Boulevard, Crystal River, Florida 34429 must i be or bring it to our Crystal River or Inverness Office filled to be State Zip - Phonn Age_ Are you a current subscriber to the Chronicle? 0 Yes 3 No Instructions. Ballots not meeting these requirements will be voided. * All ballots must be received by the Citrus County Chronicle by 4 p.m. on Monday, March 13,2006. 17,2006 issue of the Citrus County Chronicle. * Employees of Citrus Publishing and their families are not eligible to win. Not intended for residents of states where prohibited by law. Winner must be 18 years of age or older. * All ballots that do not meet this criteria will not be counted. * Winner is responsible for any taxes resulting from receipt of drawing. 1 141 TRUS COUNTY (L URNZL 7Wr ren[7'PY' XT rsTrnnN[rr C Bank Barber Sho Bedding/Ma Bicycle Sho Boat Dealer Boat & Mot Body Shop Book Store, Book Store, Boutiques Aol 0-4rv nlvv , C11 e 0 I,,'C 8A FRIDAY, MARCH 3, 2006 STATE CITRUS COUNTY (FL) CHRONICflE) ~. -400- gob -ft -Nuba d- m a1~p- --- M-4- -o i 40, 'dip 4w -l- c 46. am- 4b 0 -a -a - - a- - -- - - a -a a- - S - - C - - .5 -a ~ ~ ~ -a-a q- -ama a -- 4@mm.5ob a4bw dipa - yrlg 'mhte 9d -glob Mater - a - a a a ~. a - - a -a- - - -a -a a -a - a. . * -e a ma a - a -a - a a- a w a- - ~ a ial - a -Syndicated Content Available from Commercial'News Pro PvW.B -ad mv dat owW "mw a w a-a-1 qm ab Mow -a quo. - ____ af - -~- amg a- a '-01. 40 -owama 0-up- qv. AND - --slw aw 40-qa-m a 4a40---moma b- dm w o 4m 0. aft OWN& 4a 4o -0 -M "m --mo 4w-- .-M 40 a- ividers" I*rbw u hwqmw am 04 Avohodsud-oo o - -OW. - --on 4m- a as a a a - a- a - -a a - a- a -a *. a - a,- - ----a - -- - a a- -- *-~. -~ a a a a - 0 a ~- a. 0.~ a- - - - 0 a- a a a- - - a a-- - --a a ~a a a --a o a ~ a -a W a-- a - a -- -- - a. a a-~ a a - a a- a a. - a a a -. ---. - ~ ~ ~ m a qu- - 4Da 40 a- GOT A NEWS TIP? * The Chronicle welcomes tips from readers about breaking news. Call the newsroom at 563-5660, and be prepared to give youi name, phone number, and the address of the news event. * To submit story ideas for feature sections, call 563-5660 and ask for Cheri Harris / gain, be prepared to leave a detailed message. - .4 40- G a a -Md _____ a * a a-- -- a -~ -a. - -a a-- - a- -a.- * a - - - -a - - - a a-~ * a a a-- a -a-a - a - - - a -~ a a. wa a - -. a - -a w ~ - a a a- - 'a a- ~- a 0 - -a a a- a.- - - -. a -~ - -a ~- -a a a a-a-. --a a 'a--a -a. ~ a - -- ~ a - a -a - 1- .000-a --mo -a400.W.- qmmp - -M - ft-- ab a m 400 ane sm - O famw ap 4b a Nd 4 4 -lmm 0m S-----change with lu-------be & filter Oil change with lube & filter .1 D* -7.. -9 u S: C--k W -oo BUY 3, GETl I FREE SPECIALS! $AVE ON QUALITY UNIROYAL AS-6000 60,000 MILE RADIALS IN 13, 14 & 15 INCH SIZES! SAll-season tread design! * Superb all-weather traction! * 30-day ride guarantee! SLifetime rotation! U,'9 j T 0 o From: $5999, AS 430 60,000 mile ltd. warranty III. $891 I Saveatthepumpthe next i | time you need gas with a| FREE $5 Shell gift card! 4 Ask for Pennzoil'Platinum'mSynthetic motor I l on your next Premium oil change"service and expeien cethepowerthatcomesfromsmooth flowing oil in cold temperatures and extreme temperature protection when things get hot! I 1Alignment Service $uper Saver! yI _with ANY 4 tire buy! . I -, y y with ANY2 tire buy! Not oeoter.. Mostca&Issbgvnjda i Cvaxn*EXPIRES 0308-0 Brake Service I _KA tfo'P2 or OFF per axle S h oe a Complete brake service! i SMicas&IlgH k*iiNdd.vdoltecnsEtidwgekparpatstrMadtWmiCvtxo *EXPOR E -Of6 .q 4 Tire Rotation & Balanc b I 1 Mtcs&ihttAk.* Nol* wv naw ~ iWpu WMCa OL 'COD O7E:lNIP03 E EXIRE SALOMOTIVE CONNECT SERVICE L EXCELLENCE *| 'lt online:- D C a - - a - -ma - Vertica's Wood Blinds Shutters Crystal Pleat Silhouette fn, 4w SA FRiDAY, MARCH 3, 2006 STATE CiTRus CouNTY (FL) CHRoNicLit) I %we Gvs p .we a 4. wi- - 14411W NOW qb..Nml. IF I Cimus CouNTY (FL) CHRONICLE FRIDAY, MARCH 3, 2006 9A PROJECT Continued from Page 1A Sheen also directed Hess to the same group, saying the company president Danny Berenberg and grant consult- ant Bob Kovacevich would soon be meeting with Crystal River government officials, and they could meet with'Hess the same day, Sheen said Thursday. City Manager Phil Deaton was unable to attend the meet- ing, but his senior staffers and Kirk met with Berenberg and IKovacevich to discuss poten- tial city projects. They also wanted a breakdown about what the city's costs to the con- sultant might be. 'Deaton said Thursday they were told consultant fees would probably average $25,000 a month for as many months as necessary to com- plete the fundraising. ..He said he wasn't sure the city needed a consultant to find grants to expand the sewer plant; however, the con- sultant's pull was that it knew how to find grants from the pri- vate sector, something not nor- mally found for sewer projects. Meanwhile, Hess was round- ing up support in the commu- nity for his plan. He presented Eferenberg and Kovacevich to tie city council on Monday night to discuss the Crystal iiverwalk Foundation. No one mentioned during t e meeting that both men already had conversations about city projects with city officials. Kirk, who said she asked the same questions of the men that she'd asked during the staff meeting, acknowledged Thursday she probably should h!ve mentioned that the firm had met with both the city and with Hess. Hess told council members that he'd walk off the plan alto- gether if they didn't agree that 4ioney raised for the founda- tion would be used expressly for the riverwalk project iHe said he was willing to ~fid $50,000 in, donations for a asibil ity study and set up the foundation, and it wouldn't cost the city a lime. ,-Council members balked. They agreed only to hear a pro- posal from Berenberg and Ovacevich at the first March Y eeting, but would not agree t 6a resolution backing the cre- ation ofthe foundation. Hess said he thought about it few days later and decided to .top his fundraising activities because he believed the river- walk project could be derailed 1)y city projects. r^He sent an e-mail to Berenberg and Kovacevich sayingg such. They responded Thursday with an e-mail say- ing they could no longer par- ticipate in future riverwalk discussions because, without fundraising, they wouldn't be getting a contract "I'm now told the city is going to hire these folks," Hess said in an interview. "I'm pleading with everybody not to lt this happen. They can get Money for sewer extensions fl&m other locations." Deaton and Kirk both said tl ere is no reason why the city cannot create a foundation for il projects and allow Hess to do the same thing with the r: erwalk. In a phone interview, Brenberg, the Gift C unsel.com founder, said it's possible his company could represent both foundations so h ng as the projects were clear- ly defined and that donors k ew exactly where their n money would be going. Hess said he doesn't think t 0ro foundations would work. 'Considering the city's staffing problem right now, I'm n >t sure they could handle tl at," he said. He said people with individ- u al interests are trying to rail- road the riverwalk project. "From day one, I've been fighting the situation in city h ll," he said. "The city is a tempting to make progress o0 their own with fundraisers, a id I'm trying to do another p ckage on the other side." iSheen, meanwhile, joked tlat he finds himself in a con- tr oversy he didn't create. I"My involvement was noth- itfg more than introducing peo- ple," he said. "I don't have a d~g in this fight." FORMS AVAILABLE I he Chronicle has forms available for wedding and engagement announce- ments, anniversaries, birth announcements and first birthdays. Call Linda Johnson at 563-5660 for copies. C-- "- w . - - 4b G--i.-. - * Jessie Jessie Claire "Flower" died February 27, 2006. She is husband James Lysle Stimson, retired Captain, USNR. She is - w *1 - . Judy Claire Russell of Conyers,, Ms. Sandra Elizabeth Seidling of died Feray-2206S Vidalia, Sharon Patricia (Randy) Chandler of Mableton, and Susan Eileen (Art J.) Hamer, Jr. M-r RussllofCo8e00 James Michael (Amanda) Seindling, and Melissa Jayne (Juan) Cervantes; great- grandchildren Melinda Claire Munoz, Corrin Nicole Lemons, Angelna Jade Cervantes, Harley Elizabeth Rush, and Rylee Elizabeth Seidling. Funeral services will be held MowaMell & Son Chapel, FayetteviMle with Hank Melton Ea 0b - officiating. Interment will be at the Marietta National Cemetery. The family will receive friends Wednesday from 2:00 to 8:00 PM 180 Jeff Davis Drive Jessie Claire l Flower timson 83 of Fayetteville, Georgia 30214 husband James Lysle Stimson, retired Captain, USNR. She is survived by her daughters Ms. Judy Claire Russell of Conyers, Munoz, Darlene Lenore (Brad) 666935 Audiovox CDM8910 Color screen External caller ID Speakerphone Kyocera SoHo z" Unique pop-up I screen Samsung n330 p * .343 w S - up S ----S 9 7 %b in .w - - -S - m -.5 - 0- d - m. : -.- - .---- i; _"Copyrighted. Material_" in --. * A--- fo Syndicated Content.v-. Available from Commercial News Providers", AlNIIU lf rSWf in i d*,Mibaco ddm- o 0-s - -.0040qf 40 4 Camera phone Voice-activated dialing Speakerphone 0. ~ S. . 41P-- ,.4110D 41 0 -a - We - -. a - ~ -~ ~ - - -a -- -w - - - ~. dil 4- - - -i -W o S of their community cooperating, too, but most often "When those two things do so for a goal,such as banding come together they obvious- together to chase down food or - a .1wqmm in" a - a -m-410 4b 4w- -.wmb 4b 4 - -"up --m. ab -w momon -- qba w qmglm - 4-00 - -lo Ow.-N ftffob -~ - HAIR EXTENSIONS! We Have the Most Natural and Non-Damaging To Give You The Look You Want! Strand By Strand Technology S -* Free Consultation Financing Available Trust The Experts With Over 25 Years Experience! ,; Appointnents Requested *'U In Jasmine Plaza 6160 SW SR 200 Ocala, FL 34476 DAY! 1866-44-793 .^ii ^fSARASOTA OCALAJ come and get your lovesM Clitel wireless Phone prices with 2-year service agreement. 99(p price does not apply to Motorola RAZR. forexcu -ie o lin de ls shopal. com0 3gg -alle0 Alltel Retail Store I Crystal River 1801 North West Hwy 19 (inside Kmart) (352) 563-5340 Inverness Citrus Shopping Center 2625 E. Gulf-to-Lake Hwy. (352) 860-2241 Shop at a Participating WAL*MART Business Sales (800) 663-4886 I Authorized Agents I Equipment & promotional offers at these locations may vary. Comm. Central Crystal River Mall (352) 563-6333 Homosassa Charles Pope Cellular 4155 S. Suncoast Blvd. (352) 628-2891 Inverness Charles Pope Cellular 511 W. Main St. (352)341-4244 Proud Sponsor of: Crystal River Cell-All Crystal River Mall (352)563-0432 Charles Pope Cellular 602 N. US Hwy. 19 (352) 795-7048 Charles Pope Cellular Crystal River Mall (352) 795-4447 Lecanto Charles Pope Cellular 6782 W. Gulf-to-Lake Hwy. (352) 564-2355. *Largest Reliable. An automatic one-minute credit will be provided for any dropped voice call on the Alltel network. Not available on prepaid plans. No action is required by the customer to receive the credit Total dropped calls will be reflected on the current month's billing statement Dropped calls will not be credited when outside the Alltel network. Program may be discontinued at the discretion of Alltel. & Mhs .m wMed. eligible existing customers. Requires activation of a qualifying Alitel rate plan. Contact Alltel to determine if you are eligible. Mail-In Rebate: Umit 1 rebate per qualifying purchase. Phone cannot be .nt, AIltel Terms /Consumer & Conditions for Communications Services available at any Alltel store or alitel.com. Samsung Telecommunications America, LP. Samsung is a registered trademark of Samsung Electronics America, Information | Inc. & its entities. @2006 Gameloft All Rights Reserved. Gameloft & the Gameloft Logo are trademarks of Gameloft in the U.S. &/or other counties. Universal Studios King Kong movie Universal e Code , Studios. Licensed by Universal Studios Licensing LLLP. All rights reserved. All other product & service marks referenced are the names, trade names, trademarks & logos of their respective owners. Screen images are simulated, es775 ' 1-800-286-1551- or 527-1988 I 5685 Pine Ridge Blvd. STATE CERTIFIED CBCO49359 switch to america's largest network* so reliable, you stay connected or we pay you back limited time offer phones you'll love just 990 acI e h FRiDAY, MARCH 3, 2006 9A CaRus CouN7y (H) CHRoNicLE . . . ..I- -j . o 6 q 10A FRIDAY MARCH 3, 2006 (ommunity U~ ~ ~ .1 MENL JlJL J JUJ J -I& Air 32 more 'boat smart' Special to the Chronicle The Crystal River Power Squadron (CRPS) would like to congratulate the 32 persons who were awarded a Certificate of Completion for success- fully completing the U.S. Power Squadron (USPS) Boat Smart Course on Jan. 21. The recipient's Past Cmdr. William Foster and Lt. Cmdr. Jack Flynn. The basic boating safety course titled require- ments, official Coast Guard and Florida state regulations, safety on the water, Jet .Ski handling, trailer handling and emergency procedures. The class is open to men, women conducted from 8 a.m. to 5:30 p.m. Saturday, April 29, at the CRPS building, 845 N.E. Third Ave., Crystal River. The fee is $32 with charge for lunch. Call Foster at 563-2114. Patient Care Assisting program graduates On Feb. 17, nine stu- ; dents completed the . Patient Care Assisting N. program at Withiacoochee ' Technical Institute in Inverness. The instruc- tion these graduates " received prepares ,f them to work in home . health, long-term care and at hospitals. They are eligible for the - state certifying exam as CNAs. From left are: Bonnie Siefert, Debbie Bullington, Paula Swindells, Asia Sanchez, Jennifer Biedenstein, Amy Lawrence, Amanda Abrams, Louise La.i_ Thompson and Kim Best. Call 726-2430, ,. . Ext. 244 for informa- tion about upcoming , classes. r i '' a[TorEcr.Craor.,Ce Nit Homosassa Heritage Day set for Saturday Homosassa yset .... Special to the Chronicle Whether you are an area res- ident, a visitor interested in the history of Homosassa, or a for- mer employee of the attraction or park, you will enjoy a step back in time Saturday, March 4, at Homosassa Springs Wildlife State Park. This year, the Wildlife Park will be partner- ing with Homosassa Civic Club and Citrus County Historical Society and other local groups to present this annual event, with sponsorship by the Citrus County Chronicle and the Friends of Homosassa Springs Wildlife Park The Homosassa Civic Club will participate this year, with a display featuring Homosassa's past and present The wildlife park will have special exhibits of old photos and memorabilia from the park and attraction's early days. The Citrus County Historical Society, Homosassa River Garden Club, Old Printing Museum and Cafe, Homosassa Beacon and an exhibit about Citrus County pioneer woman Dessie Smith Prescott will all be set up in the Florida Room. There will be no charge for the programs and exhibits in the Florida Room. Homosassa Heritage Day is an annual event at the wildlife park, during which former employees and. their family members come back for a day of reminiscing about the park and the attraction's early days. These former employees and their families are admitted free for the day when they reg- ister as Homosassa Heritage Keepers. Registration forms are available in the park's administrative office Monday through Friday. Park staff will also be available in the Florida Room at the Park's Visitor Center on March 4 to register former employees and their family-members. Homosassa residents and visitors are invited to come out and share what they know and learn about Homosassa's and the park's history. Old photos of the area will be scanned and returned to their owners. As visitors walk through the park, they can enjoy a "Walk Back through Time" as they fol- low- the trails and Wildlife- Walk Enlarged photos from, the park's historical files will be posted along the way depict- ingwhat the park looked like in. its earlier days. Regular admis- sion will apply for entrance into the wildlife park If you would like to assist with this event or if you have information to share, call Susan at 628-5343, Ext 102. News NOTES Pet adoption set for Saturday Adopt a Rescued Pet will hold a pet adop- tion from 10 a.m. to noon Saturday at the Nature Coast Lodge, 279 N. Lecanto Highway (County Road 491), Lecanto. Come on out and meet the volunteers and foster pets; you might just find the love of a lifetime. For more information, call 795-9550 and leave a message. American Revolution group meeting The Withlacoochee Chapter of the sons of the American Revolution will have its regular March luncheon meeting at 11 a.m. Saturday at the Inverness Golf and Country Club. This isaweeeariier than The cistoiim- ary second Saturday due to a conflict in the club's schedule. All interested parties are welcome. Call John Camillo at 382-7383 for more information and reservations. Car wash set for Relay for Life team Citrus Memorial Health System's External Services Division staff and volunteers will have a car wash to benefit American Cancer Society's Relay for Life from 10 a.m, to 1 p.m. Saturday in the parking lot of the Citrus" Primary Care office at 450 W. Roosevelt Blvd. in Beverly Hills. A $5 donation per vehi- cle is recommended. Along with the car wash, baked goods will be on sale. All proceeds for the day go to the American Cancer Society. Crystal Oaks hosts Tricky Tray fundraiser The Crystal Oaks Civic Association is pre- senting its 7th Annual Tricky Tray fundraiser Saturday at its clubhouse, State Road 44 and Crystal Oaks Drive, Lecanto. The entry fee is $4, which gives attendees a sheet of 25 tickets and a door prize ticket; additional sheets of tickets will be available for $3. each. Tricky Tray does not begin to tell the whole fun-filled story. The fun begins at 11:30 a.m. Inside the clubhouse will be more than 50 theme baskets, chance-drawing items and door prizes, all set up on tables to. tickle one's fancy. Free refreshments and cookies will be served., The baskets are created by members of the Crystal Oaks Civic Association. Those participating in this Tricky Tray can choose to drop tickets into any basket that they would like to have. Drawings for the baskets will begin at 1:30 p.m. For information, call Hedda Smith at 527-8144. Milford Day picnic set in St. Petersburg The 16th annual snowbird "Milford Day" picnic; which is always on the-first .Sunday in. March rain or shine, will be from 10 a.m. to 5 p.m. Sunday at Fort DeSoto Park, St. Petersburg. Friends from Milford and neighboring towns are invited to share the day, meeting. old and new friends and long lost class- mates. This year there will be a famous singer to provide entertainment. Pack a pic- nic lunch and meet at Pavilion No. 14. Call Dick-and Paula Hensel at 746-2146.or Bob.. and Vicki Tocchi at (727) 547-4311. BHRA announces spring rummage sale Now is the time to clean up and weed out your closets, bureau drawers, garages and storage areas. An easy way to dispose of your excess salable articles, games, tools, books and clean folded clothing is to donate them to the Beverly Hills Recreation 'Association at 77 Civic Circle for their Spring. Rummage Sale that will be from 9 to 11 a.m. March 25. " All items may be dropped offat the-BHRA-. office starting Monday. Donations of plastic bags will also be needed. \ For information call 746-4882. Club's membership open to many in need News NOTES Central Ridge GOP Meeting on Saturday The Central Ridge Republican Club will be meetiHg 9 a.m. Saturday at the Beverl" Hills Community Building local- ed at 1 Civic Circle. Pastries and coffee are provided at 8:3:i The guest speaker will be County Commissioner Gary . Bartell. All registered Republicans T. Citrus County are invited to attend. Call President Chris "Gangler at 220-4855. ; CCCC meets today in Lecanto ' Today the Citrus County ' Computer Club (CCCC) will h6ld its first Friday of the month ' meeting at 7 p.m. at The Shepherd of the Hills Church tn! Lecanto, on CR 486, 1/4 mile , east of CR 491. There will be a short busin8s meeting followed by a round- table discussion. Come and ;, bring your questions. As. always, there will be computers avail-,-4 able at the meeting to help with problem solving. Guests are o0 always welcome. The club meets twice a ,s month, the next meeting will b.ej. - March 17 with a demo presenta- tion. I Callall Elaine Quarton at 686- 2845 or Lee Nowicke at 746--.; 5974. co Advent Hope to meet Saturday . Tonight at 7.there will be ar, Agape meal and prayer time go Advent Hope church.. Saturday starting at 10 a.mr4i there will be a study and discus sion of "The Search for n( Significance." Other classes are also available for all ages. - Worship service begins at 11 cq a.m. and the speaker is our L y Pastor Tracy Brown. Saturday evening is "Movies on the ,jJ Lawn," beginning at 6:30 pm,) . - Fun for the whole family. Fre6' for everyone. Advent Hope isf 428 N.E. Third Ave. Crystal :, River. Call 794-0071. 7C Seventh-day ' Adventists to meet' There will be a song service starting at 9:10 a.m. The next service is at 11: The church is - 4.5 miles east of Inverness off- State Road 44 in Eden .W Gardens. rl Call 746-3434. Free CPR class offered 1 There will be a free CPR and Heimlich Manuever Seminar j Monday at 10 a.m. offered at. the Best Western Citrus Hills Lodge, 350 E Norvell Bryant Hwy., Hemando. Open to the public. Call Judy at 527-0015. CFCC classes to be offered The Central Florida Community College Citrus , County Campus will offer the - following courses in early - March: ; n "Bob Ross Painting" will e teach participants the painting 14 technique made popular by Bob Ross on PBS stations nation- 'wide. Certified Ross instructor' Margaret Messina will help pa'r- ticipants paint a wetland scene0 with a bird Tuesday from 10 "'- a.m. to 2 p.m. All materials "' including canvas, brushes and' paint will be provided. The "' course cost is $40. For registration or more inform nation, callAmy Prodan-at 24W 1210. Pet SPOTLIGI4 Ashley w T he Boys and Girls and eighteen years. Clubs of Citrus County There is a misconception have all kinds of mem- that the Boys and Girls Clubs bers. They are tall, short, and exist only for at-risk kids or medium sized. Some are thin for those from indigent back- and some are not-so-thin, grounds. Their skin colors vary from With the countless tempta- white to black to gold to red to tions and dangers existing in brown. Some members are our world today, it is feasible from affluent families, and that every child, no matter some are from families that Lane Vick the background or lifestyle, have a lot less. Boys and Girls BOYS & GIRLS could be considered at-risk Clubs do not distinguish one CLUBS Influences and temptations, child from another by race, by both good and bad, are wide- sex, or by financial means. spread through television, The only requirement is that a member popular music, and movies. be a child between the ages of five years Contacts through the Internet are easily made outside the family and beyond the close circle of approved friends. The Boys and Girls Clubs of Citrus County provide programs that help to give our children the needed skills and attitudes for coping with such threats. In addition, the clubs offer a place to belong. Members have ownership in the clubs. A reasonable fee schedule that is nec- essary to supplement the clubs' fund- raising efforts in the community exists for those members who can afford to pay, but Boys and Girls Clubs do not turn away children if they cannot do so. Grants and other means are in place to provide for those children who do not have financial resources. Additional information is available at 621-9225 or the BGCCC web site at concerning the Boys and Girls Clubs of Citrus County and the club sites in Inverness, Homosassa, and Crystal River. Boys and Girls Clubs of Citrus County pro- vide a "positive place for kids." Lane Vick is a member of the Boys and Girls Clubs of Citrus County. Special to the Chroriife 13-year-old Ashley lives li) Floral City with her owners, Cheri and Jerry Boggs. 77 Maw CITRus COUNTY (FL ) CHRONICLE 1)9~~nlr "Copyrighted Material Syndicated* Content - - Available from Commercial News Providers" b - - a -- - ft -- - What Could Be Better Than 1 Day 7 2080 of Spectacular Savings at REX? Rc >AI THE REX -- - - FRIDAY AND SATURDAY 10AM-9PM "I T 1Aer HITACHI 57" HITACHI 46" 16:9 WIDE 42" 16:9 WIDE WIDESCREEN SCREEN PROJECTION SCREEN PLASMA PROJECTION HDTV TV WITH HIGH DEFINI- EDTV MONITOR WITH WITH SRS, BBE, TION CAPABILITY, MTS 500:1 CONTRAST DIGITAL CABLE STEREO/SAP WITH RATIO, 170 READY, CableCARDOm dbx, SRS@ SUR- HORIZONTAL VIEWING COMPATIBLE AND HD ROUND & SPLIT ANGLE AND 16.7 DIGITAL WINDOW SCREEN 2TUNER PIP MILLION COLORS SPLIT-SCREEN $1399 1299 $1688 ..- MITSUBISHI 55 MITSUBISHI 62" I HITACHl '. "WIDESCREEN DIGITAL WIDESCREEN HIGH _ _ .. CABLE READY REAR DEFINITION READY PROJECTION HDTV TV WITH DLPT WiCableCARD-" SLOT, LIGHT ENGINE, -'." ,4 FireWirel INPUTS .RSPLIT(EEN PIP, SPLIT-SCREEN PIPOPPOP .P DAND PerfectColor- .POP AND AND PerfectColorPerfectColorm S... 1699 -2699 s EMERSON 20" LCD E -- TV WITH IMTS ."*. |! ~STEREO/SAP, ON-SCREEN ', :'. ." ,' DISPLAY, V-CHIP, AUTO SHUT OFF, :.,%, s SLEEP TIMER AND CLOSED CAPTION s\ $499 RCA 27" TruFlatT TVWITH MTS p^ STEREO/SAP, STRILINGUAL ON-SCREEN DISPLAY, SOUND LOGIC, PARENTAL CONTROLS .. AND REMOTE $269 |TOSHIBAI TOSHIBA 5-DISC DVD/CD CHANGER WITH PROGRESSIVE i PLAYBACK, DOLBY DIGITALJDTSA, COMPATIBLE & UNIVERSAL REMOTE SJ$79 - 0 -.~ - = - a - II SONY 26" 16:9 SONY. BRAVIATm LCD HDTV UONiITnlD MII n & t -- -.. SONY. ,~ H iR;gy SONY 32" FD TRINITRON WEGA FLAT SCREEN TV WITH SRS& 3D AUDIO EFFECT, TRILINGUAL ON-SCREEN DISPLAY AND REMOTE $487 4SONY 36" FLAT SCREEN TV .... $849 5 I%-;:5-" HITACHI 42" 16:9 WIDE SCREEN PLASMA HDTV WITH VirtualHDT 10801 VIDEO PROCESSOR, PIP, WOW BY SRS, TABLE TOP STAND AND 20W SPEAKERS $2699 19" TV WITH TRILINGUAL ON-SCREEN DISPLAY, SLEEP TIMER, CLOSED CAPTION AND REMOTE CONTROL $88 STOSHIBA 13" TV WITH ATTACHED VCR, GLOW-KEY REMOTE, TRILINGUAL ON-SCREEN DISPLAY, SLEEP TIMER AND FRONT A/V INPUTS $99 TOSHIBA 20" TV/VCR COMBO ........ $139 SAMSUNG 46" WIDESCREEN HDTV WITH DLP-, DIGITAL CABLE READY WITH CableCARDO SLOT, DIGITAL NATURAL IMAGE ENGINE AND 2-TUNER PIP S s$1899 ISONY. SONY 55" 16:9 WEGAT 3LCD REAR .- PROJECTION DIGITAL CABLE READY HDTV WITH BUILT-IN HD TUNER, DOLBY& DIGITAL AND SRS" TruSurround XT S -2649 rF uI RCA 24" TV WITH : ITOSHIBAI K* 2jEt~gB. MT5 STEREO/SAP, . ELECTRONIC ON-SCREEN NOTEPAD, V-CHIP, CLOCK/SLEEP/ WAKE TIMER ANP REMOTE S169 TOSHIBA 24" FLAT SCREEN STEREO TV[ DVD PLAYER COMBO W/DVD-Video, Video CD, DVD-R, CD, CD-R/RW, WMA, MP3 PLAYBACK, JPEG VIEWER & REMOTE $299 PHILIPS 20" TV/DVD COMBO ......... 219 PHILIPS DVD CONVERSION DVD PLAYER/4-HEAD HI-FI WITH PROGRESS' PLAYER WITH HDMI STEREO VCR COMBO SCAN, DOLBY* DI( OUTPUT, DVD-R/-RW/ WITH PROGRESSIVE V1D 2.0 ENCODER, i.LIl +Ri+RWICD, VIDEO '? OUT, DVD/DVD-R/ AND DVD Video, V DAC 54MHz/O1BH, RWICDICD-R/RWI/ __ CD, Super VCD, Au EZ VIEW AND VCDISVCDIWMA/MP3 CD, MP3 CD, CD-RI REMOTE PLAYBACK & REMOTE DVD-R/RW 79 s129 ; -$149 SONY MiniDV HANDYCAM /N JVC 100Wx5 A/V CAMCORDER WIHANDYCAMO VPl CONTROL RECEIVER STATION, DIGITAL STILL W/DOLBY6 DIGITAL./ i DUAL 400-WATT CAMERA, 2.5" DTS DECODERS, 12-INCH 3-WAY SWIVELSCREENT" TOUCH DOLBY* PRO LOGIC II SPEAKER SYST PANEL LCD & 20x OPTICAL/ AND REMOTE 12" Poly Treated Cone 800x DIGITAL ZOOM Virtual Surround Back DSP .. Loaded 25mm Plezo * I LINK' DV Interface 116" Digital Equalizer New Quick Tweeter Horn Loaded Adavr,,, d HAD CCD Imager Speaker Setup. #RX5040 Piezoelectric Driver. # * Carl Zi iSVarlo-Tessar@ Lens. -2- $369 $139 49. ER VE GITAL nke Video idio lRW, T EM e Horn electric d 30mm IJLI23E I. WHITE. SUPER WASH 8 CYCI 3 WAS TEMPE *2Agital nations Level. # | kV ..... ...... .. 1 S WHITE. m 18 CU. 1 -" REFRIED WITH ; GLASS S" GALLC "' STORA -* -2 Opaqu Cover 0 Width Fre CANON PowerShot 4 MEGAPIXEL DIGITAL CAMERA WITH 4x OPTICAL ZOOM & 1.8" LCD SCREEN - Continuous Shooting Mode DIGIC Image Processor Video Mode 8 Spe- cial Scene Modes 9-Point Autofocus - Special Photo Effects. 197 -WESTINGHOUSE k CAPACITY ER WITH LES AND H/RINSE ERATURES te/Spin Speed Combi- * 3 Position Water WWS833ES s57 WESTINGHOUSE FT. G.-FREEZER SSLIDING SSHELVES AND IN DOOR AGE e Crispers Clear DaIry paque Dell Drawer Full sezer Shelf. #WRT8G3EW 167 . . ir: , 0..7 CU. FT. 800-WATT MICROWAVE OVEN WITH ELECTRONIC TOUCH R CONTROLS, 10 POWER LEVELS, AUTO DEFROST, AUTO COOK AND $3 TURNTABLE E #KOR630A $ N WHITE-WESTINGHOUSE 5.7 CU. FT. ELECTRIC DRYER WITH REVERSIBLE DOOR Auto Dry Cycles Timed Dry Cycles One In Timer Tem- perature Quick Clean Lint Screen. #WER211ES 1u$197 FRIGIDAIRE ELECTRIC RANGE WITH LIFT-UP COOKTOP AND OVEN DOOR WINDOW 2-8" & 2-6" Coll Elements Chrome Drip Bowls Sur- face "On" Indicator Oven Light Porcelain Broiler Pan & Grill Storage Drawer. #FEF316BS i$299 BUSH TV STAND I\- Accommodates Sel Most 36" TV's & 60" Flat Panel TV's 'Two Fixed Tem- Spered Glass Shelves*-Back Openings For Easy Wire Management. #VS97250-03 Electronics Not Included RCA AUDIO SYSTEM WITH NEO 5-CD CHANGER, DIGITAL AM/FM TUNER, DETACHABLE SPEAKER SYSTEM, DYNAMIC BASS BOOST SYSTEM AND REMOTE eRS2041 $89 DUAL 100-WATTS TOTAL POWER AM/FM/CD RECEIVER WITH DETACHABLE FACE & CARRYING CASE * CD Changer Controller * 18FM/6AM Station Presets - 3 Selectable EQ Curves 5 Second Scan Tuning' Includes Hard Carry Case. #V508 $69 658241 $289 STATE ROAD 44 |1 IL-1c SONY. f^^ 12 JVC PROGRESSIVE SCAN 5-DVD/CD HOME THEATER SYSTEM W/SMART SURROUND SPEAKER SETUP PLUS 167-WATT SUBWOOFER AND 5.1 DOLBY DIGITAL/DTSIPRO LOGIC II DECODERS #TH-C6 $479 SONY 52Wx4 CD RECEIVER WITH MP3/WMA PLAYBACK, EQ3, DETACHABLE FACEPLATE AND WIRELESS REMOTE - ATRAC3" Plus/Connect'" Ready 45 Degree Install Red Key Illumination Blue 13-Seg- ment Negative LCD, Clock. #CDXGT200 $129 CRYSTAL RIVER 2061 NW HWY. 19 1/2 Mile North Of Crystal River Mall 795-3400 BUSINESSES. CONTRACTORS OR SCHOOLS CALL: 1-800-528-9739 - .. -. kwL mi I I * S . N FRIDAY, MARCH 3, 2006 IIA TTATitOr-lN dp o I illfill i'l , Millill'IM157 m CiRUS COUNmv (FL) CHRomNcE 12A FRIDAY, MARCH 3, 2006 THE MAKET INREVIE GAINERS (52 OR MORE) Name Last Chg %Chg Midas 21.55 +2.71 +14.4 MensWs 36.80 +4.59 +14.3 Applicah 2.40 +.26 +12.1 LongDrg 43.81 +4.36 +11.1 HangrOrth 6.95 +.69 +11.0 LOSERS (S2 DIARY Advar:ced Declined Unchanged Total issues New Highs New Lows Vnolume I 457 1,817 177 3,451 160 21 2.501.357.800 MOST ACTIVE (SI OR MORE) Name Vol (00) Last Chg SPDR 571352 129.36 -.01 iShRs2000s361429 73.59 -.31 SemiHTr 215782 38.50 -.03 SPEngy 207418 54.12 +.89 SPFnd 143144 32.60 -.20 GAINERS ($2 OR MORE) Name Last Chg %Chg Metretekn 19.62 +5.47 +38.7 Tarpon 2.55 +.50 +24.4 TitanPhm 4.40 +.72 +19.6 Halozyme 3.50 +.48 +15.9 Kimbergn 2.48 +.31 +14.3 LOSERS ($2 OR MORE) Name Last Chg %Chg HyperSp 3.85 -.32 -7.7 GascoEngy 5.65 -.40 -6.6 Sifco 4.05 -.28 -6.5 LeNik07wt 27.38 -1.77 -6.1 PathlNet 2.15 -.14 -6.1 DIARY Adi an,:ed Declined Unchanged Total issues New Highs New Lows Volume 471 461 87 1,019 62 8 345.,991,509 MOST ACTIVE ($1 OR MORE) Name Vol (00) Last Chg JDS Uniph 1412023 3.49 +.32 Intel 859020 20.49 -.31 Cisco 689644 20.88 -.18 NasdlOOTr 680634 41.69 +.03 Orade 620249 12.80 -.01 LOSERS ($2 OR MORE) Name Last Chg %Chg QuantaCap 2.83 -1.90 -40.2 Nastech 14.43 -8.59 -37.3 IRIS Int 17.27 -5.83 -25.2 BioDIvrylf 2.38 -.75 -24.0 NitroMed 9.49 -1.90 -16.7 DIARY 4.j. ar,.:L i Declined Unchanged Total issues New Highs New Lows Volume 1 -I':4 1,700 165 3,164 166 32 2,085,586,803 Here are Ihe 825 most active STO.Rs on The ewA 'rork SIock E change. 765 moail acLive on Ine Nasdaq rational Marketl a3d 116 mostly active on ine Ameri.an Slock EYchange. SItc.s in bold aie worth at leasT 15 and changed 5 percent or more in price uneilgnloi for 50C most active on NYSE and rJasda. and 25 most active on Ame Tables s nho name, price and neT change and orne T, two addlional fields rotaled Ihrough the weae, as follows Div: Current annual dlwidend rate paid on slock, based or n laesl quarterly or semiannual declaration, unless otherwise fooTnoted Name: Slocks appear alphaOelically by The cnrcompany s lull name rion l is abbreviation) Names consistinglng l rinilials appear at Irhe Deglinnng ol each letter's lis Last: Price slock w'35. radinrg aS when ,..change closed or I-e lda;3 Chq: Loss .:'r gain or Ihe a IJo li chang iniCalrOd by ii" IV.'4 ISP COO 4* *~.1LI3 r.. Simo Fc+ o nolos :x FE g 9 ir.,. thr T..n99 cI I i:u.e ri'bra~LOr, -:. +d1-115 ,ae piE c'ris y "q' ':0,11Tr5 y 0 TNW, 52 *.10111IL-i e -15 -0U.- in 1I"i1-2 mc',e t.: C,"inrj far' rrri iv iiIA.l 7 -n in ,, Ir 11C nhO i~r' n jrr .13i vEIi q. q Dpr i- nr,-ea.n Ir 1.11,ar n.. Ai' cair, In I.Jr,nrir E.--rni I R ir~ .. wIriin.31`1 -1i ir 'ram ..r r.,d zai vi i 03r.i16 iE.alm, rri t vrmn, a r ,*mad v Vrrei l w* 0mTi' v1 i.r,6, i F-i,. 3 lic ?, cq v wien d.,,.e ,4? an 15,1 is. sLingj r'm M !?,.. 3ir ,cC ,-. a w aIi CC tn- u rn+ i v n+ ,T. Sr-r' -ai jr, p i A- ri i i:!s n,: .itr,. tr m-ip -sw vpic+ ji3 Appe.j.r in mii orin, sanei:t Dividend Feornore~s: a -Ettra dr,,d.r.. -ImA.i r, p4.rm 3r-i, roi i-ud-t. Ad o~r~u arare plij ; .: Lq'iders.,.I ..i.;rd t? -. ?sr, iLIu ,d *)r p~i-d ii iinsr ST. r.h: I '..ribm r~i arial SiR hiS... .J 3:mr, n'.dtl d I 5.11 ,n .11.'II'i lC~d r,..,.m .I v1. '- J '. Sum fit' ",'npidil r ~,-n:, p~lirno ii-p lar I cua. pc ,.ir i, p.1 rls ir l'"- i- intdi. dend; In aa' sri hmCurrent arn,s'.Iraut-i~,s v-:' T,0:1rC2 ,... aimeind arri-,nnui,.:rjninir p roiii .i,mi~airl, rir~r,.iu r l .a '.i rnovn'n '~iii "Or sr..SvA r Da.. rarni .3 & p~aicd rnrjr7m. rnpn- 12 arr,.cirsFL- i z;c. .1i,'Jit rid I N~j i : ,io': P. I~ ~ ~ ~ f r...-ar uh..ie., Jci,'5.11i5 Source: The Associated Press. Sales figures are unofficial. I6SOC S O SLCA ITEES YTD Name Div YId PE Last Chg %Chg +.19 +15.5 -.28 +5.0 -.45 -2.2 +.09 +17.6 -.09 +.6 -.48 -5.1 -.06 +16.9 +.01 +18.8 +.51 +8.3 -.27 -.5 -.02 +19.5 -.29 -.8 +.09 -6.3 -.49 -.1 -.30 +4.5 -.31 -17.9 +.04 -2.7 Name Div YTD h ) YId PE Last Chg %ChgM +3.6"' 'Al a +4.71]! +12.991A +5.4oA I INDEXE 52-Week Hinh Low 11,159.18 4,514.32 438.74 8,156.28 1,878.30 2,332.92 1,297.57 742.77 13,090.49 10,000.46 3,348.36 346.46 6,902.51 1,415.75 1,889.83 1,136.15 570.03 11,195.22 Net % YTD 52-WK Last Chg Chg % Chg % Chg Name Dow Jonas Industrials 11,025.51 -28.02 Dow Jones Industrials Dow Jones Transportation Dow Jones Utilities NYSE Composite Amex Index Nasdaq Composite S&P 500 Russell 2000 DJ Wilshire 5000 11,025.51 4,482.05 411.66 8,126.53 1,887.27 2,311.11 1,289.14 740.16 13,022.96 -28.02 -32.09 -.16 -4.10 +8.97 -3.53 -2.10 -2.19 -14.73 +2.87 +1.78 +6.82 +19.18 +1.62 +15.99 +4.80 +10.46 +7.29 +24.20 +4.80 +12.28 +3.27 +6.50 +9.94 +15.96 +4.04 +9.15 .52 ,* S YTD Name Last Chg +26.3 ABBUd 1228 -.17 +4.4 ACE Ltd 55.78 -.12 +.8 ACM Inco 8.35 -.05 +8.3 AESCorp 17.14 -.36 -1.3 AFLAC 45.80 -.02 +17.1 AGCO 19.41 -24 +2.9 AGLRes 35.83 -.24 +42.6 AKSteel 11.34 -.05 +12.0 AMR 24.89 -.48 +13.6 ASA Ltd 62.50 +.91 +15.5 AT&TInc 28.28 +.19 -.2 AT&T2041 25.03 -.06 +10.3 AUOpton 16.55 -.20 +10.3 AXA 35.66 -.19 +10.2 AbtLab 43.44 -.56 -6.3 Aberntc 61.05 -6.20 +12.9 Accentura 32.60 -.03 +4.6 AdamsEx 13.13 +.03 +4.5 Adesa 25.51 -26 -1.9 AdvAutos 42.62 +.10 +7.4 AdvMOpt u44.89 +.64 +35.1 AMD 41.33 +1.26 +8.3 Aeropst] 28.47 -.42 +7.0 Aetnawi 50.45 -.84 +6.6 AffCmpS 63.10 -.07 +102 Agerers 1421 +.53 +9.1 Agilent 36.32 -.39 +42.6 Agnlcog u28.18 +1.58 +92 Ahold 822 -.10 +8.8 AirProd 64.41 +.09 +11.0 AirTran 17.80 -.06 +18.9 AlbertGn 25.38 -.02 +8.7 Alcan 44.50 +.62 +14.1 Alcatel 14.15 +.10 +1.1 Alcoa 29.90 +.35 -11.9 Acon 114.15 -2.23 +82.1 AmegTch u54.88 +1.84 +6.0 Allete 46.63 -.29 +4.3 AmWrkI2 12.96 -.03 +22.8 AldWaste 10.73 +.03 +1.1 Allstate 54.65 -.10 +1.0 AlItel 63.76 ... +13.3 AlphaNRs 21.76 +.26 +6.4 Alpharma 30.33 -.79 -42 AiTaI 71.61 -.44 +21.5 Amdocs 33.40 -20 +14.0 AmHess 144.54 +2.63 -2.1 Ameren 50.14 -.24 +21.3 AMovilLs 35.50 -23 -15.1 ArnAxe d15.57 -.64 -2.0 AEP 36.34 -.20 +4.5 AmExp 53.78 -.34 -1.4 AFncIRT 11.83 -.14 -3.6 AmIntGp1f 65.80 -.42 ... AmStand 39.94 +.05 +12 AmSIP3 10.87 +.03 +162 AmTower 31.50 +17.0 Amednicdt 29.98 -.09 +8. 0 Amerigas 30.53 -.08 +8.7 Ameriprsn 44.57-1.32 +11.0 Amerirgs 45.96 -.04 +5.0 AnmSouth 27.51 -.28 +7.4 Anadrk 101.73 +2.75. 5 A-.-.g.Dev 38.91 -.29 ." ,Ar.s:.A 53.25 +1.88 -' Ar.r,. "' 41.37 -.17 +8.2 AnnTaylr u37.36 +.61 +8.0 Anna*y 11.82 +.07 +12.0 AonCorp 4025 -.16 +1.6 Apache 69.63 +1.43 .- f .i.;,:, 28.55 -.14 ,-I A. n,, 29.54 -.05 +8.3 Aquita 3.9 0 -.04 -7.5 Arbtron d35.15 -3.73 -3.5 ArchCoal 76.72 +1.07 +29.5 ArchDan 31.94 +.74 +36.3 AmodrH 58.15 -20 +1.8 ArvMerit 14.65 -.89 +12.9 Ashlandn 65.39 -.59 +232 AsdEstat 11.14 -.05 +.9 ATMOS 26.39 i, '-3.8 AutoNatn 20.91 : +.4 AutoData 46.07 -.15 +6.5 AutoZonee 97.68-2.61 +5.2 Avaya 11.23 +.05 +33.0 Avial u38.31 -.21 +7.8 Avnet 25.77 -.43 -.2 Avon 28.50 -.26 +.4 AXIS Cap 31.40 +.21 -5.9 BB&TCp 39.45 -.25 +9.7 BHPBilILt 36.66 +.36 +4.0 BISYSIf 14.57 +.21 -8.9 BJSvcss 33.42 +.96 YTD Name Last Chg +1.4 ABXAirn 7.96 +20.1 ACMoore 17.47 -.46 +16.6 ADCTelrs 26.02 +.79 +132 ASETst u8.89 -.07 +62 ASMLHId 21.33 -.07 +28.9 ASVIncs 32.21 -.19 -3.9 ATITech 16.32 +.03 -2.5 ATS Med 2.69 -.08 +110.1 AVIBio 7.25 -.22 -17.5 Aastrom 1.74 +3.6 Abgenix u2226 -.02 +60.4 AcadiaPh 14.81 +.18 +8.0 AccHrme 53.57 -.50 -8.5 Activisns 12.57 -.12 +13.3 Acxiom 26.05 ... -7.8 AdamsResn37.50 +.17 +12.9 Adaptec u6.57 -.06 +5.0 AdobeSys 38.81 -.23 +88.0 AdolorCp 27.45 +.20 -2.7 Adtran 28.92 +.33 -8.2 AdvDigInf 8.99 -.06 +24.3 AdvEnld 14.71 -24 +6.5 Advanta 32.10 -.40 +82 AdvantB 34.45 -.68 +26.2 Aeroflex u13.57 +.23 -27.9 Affymet 34.45 -.27 +21.6 AgileSft 7.27 +.32 +30.9 AkamaiT u26.09 -.92 +10.3 Akzo 50.82 -.21 +28.7 Aldila u32.74 +1.44 +80.7 Alexion 36.59 -.96 +42.6 AlignTech 8.58 +.12 +35.4 Alkerm 25.88 -.58 +40.4 AlifbO ul.60 +.17 +46.6 Allscipts u19.65 +.70 +21.5 AInylamP 16.23 -.06 +80.8 AltairNano 3.67 +.18 +14.5 AiteraCp 21.21 +.03 +20.8 AlPids 20.40 -.06 -21.8 Amazon 36.88 -.24 -23.1 Amedlsy 32.49-1.72 -14.4 AmerBio .95 +.01 ... AmrBiowt 20 ... -1.5 AmCapStr 35.68 +.06 +23.9 ACmdLnn 37.58 +.20 +24.2 AEagleOs 28.55 -.36 -7.2 APwCnv 20.41 -.10 +38.6 ASciE u86.45 +2.90 -3.0 Amgen 76.47 +.42 +702 AmkorT 9.53 -.16 +9.7 Amylin 43.79 -.11 +13.2 Anlogic 54.15 -.13 +8.3 Analysts 2.60 -.05 -20.6 AnlySurh 1.58 -.10 +28.1 Andrew u13.74 +.04 +20.7 AndrxGp 19.89 +.13 +18.1 Angiotchg 15.53 -.25 +10.0 AngloAm 38.26 -.01 +36.8 Antgncs 6.51 +.06 -20.7 ApoltoG d47.94 -.94 +4.3 Apollolnv 18.70 -.27 -3.2 AoDeC 6961 +51 +3.5 Applebees 23.39 -.18 +25.1 Apldlnov 4.14 -.02 +6.0 ApldMat 1902 +.17 +52.1 AMCC u3.91 +.18 -1.1 aQuantive 24.96 -1.29 +29.8 ArenaPhm u18.45 +.40 --8 AriadP 6.89 -.08 +30.' Adiba nc 10.27 +.02 +13.? Arotech .42 -.02 +44. iis 13.29 -.23 +0.0 ArtTech 2.94 +.01 +6.1 Artesyn 10.93 +47.5 AspenTc 11.58 -.36 +4.5 AsscdBanc 34.02 -.33 +81.8 Asysffch ul10.40 -.6 AtRoad 520 -.06 -25.9 Atad .80 +.01 -20.0 AthrGnc 16,00 -.07 +77.8 Atheros u23.11 +.01 +52.4 Amrel 4.71 -.05 -21.7 Audible 10.05 -.04 -8.7 Audvox 12.685 -.33 +2.8 BJsWhIs 30.40 -.04 +8.6 BMCSft 22.26 +.09 +4.2 BP PLC 66.91 -.27 +15.6 BakrHu 70.24 +1.61 +9.5 BallCp 43.48 +.94 +18.7 BanColum u34.21 +.96 +47.4 BcoBrads u42.96 +.08 -2.2 BktofA 45.15 -.45 +9.1 BkNY 34.74 +.19 -2.2 Banta 48.71 -.23 +6.3 Bard 70.06+4.06 +6.5 BarrPhm 66.32 -.08 +1.1 BarickG 28.18 +.67 +3.1 BauschLIf 70.00 +57 +1.1 Baxter 38.07 -.05 +16.9 BearSt 135.10 +.41 +12.1 BearingPIf 8.81 -.05 +8.2 BectD 64.99 -.32 +17.6 BellSouth 31.88 +.09 +23.1 BestBuys 53.52 -.46 +5.9 Beverly 12.6 -.02 +9.0 BigLots 13.09 -.12 +1.9 BlackD 88.60 +1.84 -.1 BIkHICp 34.56 -.24 +.1 BkFL08 15.12 -.38 -9.8 BlkckHRs d22.14 -.04 -5.5 BlueChp 5.96 -.07 +3.6 Boeing 72.80 -.15 +12.6 Borders 24.40 +.20 +7.0 BoslBeer 26.75 -.05 +15.1 BostProp 85.30 +.55 -2.8 BostonSd 23.80 -.20 -10.3 BoydGm 42.76 -1.19 -1.0 BrMySq 22.75 -.02 -2.2 Brunswick 39.76 +.12 -3.8 Buenavnt 27.23 +.53 -12 BungeLt 55.94 -.16 +11.0 BudNSF 78.62 -1.23 +2.9 BudRsc 91.32 +.60 -4.3 CAInc 26.98 -.12 -5.6 CBSBn d24.06 -.59 +14.1 CFlndsn 17.40 -.34 +6.0 CHaEngy 48.64 -.62 +10.4 CIGNA 123.31 +.46 +4.4 CITGp 54.04 +.06 -2.5 CMSEng 14.15 -.05 -6.7 CNAFn 30.54 -.73 +.3 CSS Inds 30.82 +10.8 CSX 56.27 -27 +10.1 CVSCps 29.08 +.02 +12.5 CabIvsnNY 26.40 +.20 +7.8 CabotOGs 548.63 +1.77 +18.6 CaliGolf 16.42 -.10 +17.8 Camecogs 37.34 +.35 +4;2 CampSp 31.03 -.01 +19.8 CdnNRygs 47.90 +.22 +21.4 CdnNRsgs6026 +3.04 +32 CepOne 89.16 +.87 +10.7 CapBSrce 24.80 +20 +2.0 CapMpt8 12.71 +5.8 CardnlHth 72.61 -.39 -1.9 CaremkRx 50.83 -.01 -3.1 Carnival 51.80 -.32 +18.7 CarrAmrR 41.11 +.09 +28.7 Caerpils 74.34 -.05 +8.8, Celesicg .11.49 +.38 -46 i:,mn ",.W4 -6+ -3 C .''e-an' It.r'i 14 7 ,i:rf.-r ,'r.l 1.'+ '" -4.6 Centex 68.17 +.74 +10.7 COntyTel 36.70 +.14 +13.1 Cenveo u14.88 +.33 +15.1 ChmpE 15.68 -.34 +16.0 Checkpnt 28.59 -.31 -13.8 Chemtura 10.96 -.02 -.1 ChesEnq 31.70 +1.27 +.4 Chevron 57.01 -.23 +18.0 ChiMoerc u433.49 +2.09 -5.9 Chlcos 41.35 -6.41 +14.6 ChrisBnk 21.52 -.71 +.8 Cimarex 43.37 +.31 +16.0 CindBell 4.07 -.06 ,3 r.-.?, 44.03 +.14 .-" W 'r,.,ir, 23.70' -.22 -13.8 CitadlBr 11.58 +.32 -5.1 Ctigm 46.05 -.48 +10.3 CitzComrnm 13.49 +.17 +9.7 ClairesSt s 32.06 -.60 -8.1 ClearChan 28.91 +.32 +8.1 Clorox 61.51 +.02 +8.7 Coach s 36.24 +.36 +1.6 COcaCE 19.47 -.48 +4.0 CocaCI 41.91 -.40 +52.0 Coeur u6.08 +.38 -.6 ColgPal 54.51 -.26 -10.3 Autobytel 4.43 -.28 -4.1 Autodesk 41.16 -.52 +234 Avanex 1.69 -.01 +5.9 Avantlmm 1.99 -.06 -16.0 AvidTch 46.02 -1.08 +20.7 'Aware 5.37 -.03 -19.6 AxcanPh 12.17 -.27 +49.9 Axcelis 7.15 -.08 +30.1 Axonyx 1.08 -.04 +8.9 BEAero 23.95 -.25 +24.5 BEASys u11.70 +.46 -16.4 Baidun 52.60 +1.36 +54.5 BallardPw 6.46 +.09 -2.5 BarrettBs 24.37 +1.42 -5.0 BeaconP 1.72 -.18 -5.6 BeasleyB 12.75 -.69 +24.2 BebeSItrss 17.42 -.35 +.6 BedBath 36.35 -.31 -4.0 BioDIvryf 2.38 -.75 +24.1 Biocryst 20.79 +.44 +30.0 Bioenvisn 8.49 -.01 +2.4 Blogenldc 46.36 -.59 .+25.3 BbMarin uI3.51 +.37 -.4 Blomet 36.41 -.26 +21.8 Blopure rs .95 +10.1 Bickbaud 18.80 +.11 -52.8 BluCoat 21.57 -.57 -2.7 Bluefly 1.09 +.04 +25.4 BobEvn 28.92 -.45 +53.0 BonTon u29.27 +1.77 +30.9 Bookham 7.49 +.04 -18.2 Bodand 5.34 -.14 +57.5 BostnCom 1.78 +.03 -27.2 BrigExp 8.63 -.10 -5.8 BightHrzs 34.96 +1.21 +56.1 Brighlpnts 28.86 +.64 +22.4 BroadVis .60 +55.4 Broadcma su48.84 +.63 +58.0 Broadwing 9.56 +.21 433.4 BrcdeCm 543 +08 +27.4 BrooksAut 15.96 -.23 +1.3 BldgMat 69.09 +1.74 -4.4 BusnObj 38.65 +.51 +50.0 C-COR 7.29 -.35 +25.9 CBRLGrp 44.27 -.04 +49.5 CDCCpA 4.79 +.06 -.3 CDWCorp 57.39 -.29 +22.9 CHhRobns 45.50 -.31 -4.6 CMGI 1.44 -.04 -8.9 CNET 13.67 -.23 +3.2 CVThera 25.52 -1.49 +6.6 Cadence 18.04 +.03 +4.8 CalDives 37.63 -.43 +202 CmbrAnt 14.44 -.49 +.6 CapCtyBks 34.51 -.09 +6.4 CpstnTrb 3.18 -.02 +18.8 Cardiomg 12.00 +.10 -1.2 CareerEd 33.30 -.03 +442 CasualMal 8.84 -.25 +21.5 Celgenes u39.37 +1.04 +21.2 CellGens 7.19 -.01 -11.9 Cellffera 1.92 -.02 -6.9 Centllm 3.24 +.18 +3.2 CentEur 41.43 -1.50 +10.1 CEurMed u63.72 +4.35 +44.4 CentAI 37.85 +.84 +26.1 Cephln u81.63 +.60 +37.2 Ceradyne 60.08 -1.23 -6.1 Cemers 42.70 -.57 +3.5 ChrmSh 13.61 -.13 -4.1 CharlCm 1.17 -.01 +5.2 ChkPoint 21.10 -.24 +8.8 ChkFree 49.92 -.25 -3.1 Checkers 14.69 -.08 -32 Cheesecake36.20 -.08 +2.2 ChlldPlc 50.50 +2.99 +84.9 ChinAuto 12.57 -.21 -5.2 ChlnaTcFn 12.80 +280.8 ChinaTDev 8.15 +.15 +2.6 Chiron 45.59 -.05 +13.5 ChrchllD 41.69 +.40 +562. ClenaCp u464 +29 +.1 CIntas 41.17 +.10 +23.7 Cirrus 826 +.20 +22.0 Cisco 20.88 -.18 +74.2 CitadelSec 54 +.03 -6.0 CitlTrendn 40.11 -4.14 +2.6 Collntin 8.36 +.06 +.2 Comerica 56.86 -.35 -2.9 CmcBNJs 33.42 -.10 +27.4 ComScop 25.65 -.75 +16.6 CVRD 47.96 -.04 +16.8 CVRD pf 42.35 +.14 +7.8 CompSd 54.60 -.06 +3.9 ConAgra 21.07 -.28 +7.9 ConocPhils 6278 +1.01 +1.4 ConsolEgy 66.10 +.90 -2.4 ConEd 45.23 -.42 +12.0 CtlAIrB 23.85 -.21 +9.1 Cnvrgys 17.30 -.14 +1.3 Coopams 41.94 +.38 +1.2 CooperCo 51.94 -.96 +12.6 Cooperlnds 82.21 -.79 -3.3 CooperTire 14.81 -.54 +33.6 Coming 26.26 -.15 +26.2 CorisGr 12.82 +.18 +2.3 CntwdFn 34.96 -.08 +12.4 CovantaH 16.93 -.06 +4.4 Coventry s 59.45 +.81 +14.6 CrwnCstle 30.83 +.94 -1.3 CrownHold 19,28 +.82 +29.1 CypSem u18.40 -.03 4.5 DNPSelct 10.86 -.02 +4.2 DPL 27.11 +.11 -6.0 DRHortnas 33.60 -.24 -4.4 DSTSys 57.27 -.24 -.4 DTE 43.03 -.05 +9.1 Daiml rC 55.66 -.95 -85.5 DanaCom d1.04 -.81 +9.2 Danaher 60.89 -.31 +6.5 Darden 41.39 -.43 +14.0 Deere 77.65 +.56 +4.9 DelMnte u10.94 +.04 +26.3 Danburys 28.77 +.19 -1.0 DeufTel 16.47 +.40 -3.3 DevonE 60.49 +1.32 +18.3 DiaOffs 82.32 +1.94 +9.1 Diebold 41.45 +.64 -2.1 Dillards 24.30 -.69 +11.1 DirecTV 15.69 -.07 +16.9 Disney 28.03 -.06 -8.4 DollarG 17.46 +.01 -3.7 DomRes 74.33 -.34 +2.4 Doralminlf 10.85 -.23 +19.3 Dover 48.31 -.06 -.3 DowChm 43.69 -.27 +15.9 DowJns 41.15 -.02 -3.4 DuPont 41.04 +.43 +3.2 DukeEgy 28.34 +.06 +8.3 DukeRlty 35.50 +.20 +5.3 DuLight 17.19 -.10 +9.7 Dynegy 5.31 -.02 +23.2 ETrade u25.70 +.19 -34.5 ECCCap 1.48 -.02 +7.0 EMCC 14.58 +.33 -5.5 EOGRes 69.32 +.97 -2.0 EastChm 50.56 +.18 +18.8 EKodak 27.81 +.01 +.7 EatnVan 27.55 -.72 +1.4 EdisonIlnt 44.23 -.06 +6.8 EiP. :,". 1:, : -.i:l El"' 16 6A :mTp ,,:iL I., . . -52 E,,.ulI 1"76 -.18 +.6 E,,riEPr -i i: -.28 -4.3 EnCanas 43.23 +1.43 +26.5 Endesa 32.89 -.14 +31.6 EnglCp 39.67 -.03 +24.0 EnPro 33.43 -.17 +7.0 ENSCO 47.46 +1.57 +4.1 Entergy 71.49 -.51 -.5 EntPrPt 23,90 +8.1 Enravisn 7.70 +.20 +.7 EqtRess 36.95 +.64 +15.9 Eqlylnn 15.70 +.05 +6.8 EqOftPT 32.40 +.52 +14.1. EqtyRsd 44.65 -.31 +11.3 EsteeLdr 37.27 -.01 -3.5 ExoResnd12.59 -.01 +6.4 Exelon 56.52 +.07 +8.3 ExxonMbl 60.85 +.51 +14.3 FMCTch 49.05 +.87 -.5 FPLGps 41.34 -.27 +8.3 FairchldS 18.31 -.24 +4.6 FarnDIr 25.93 -.04 +12.4 FannieMIf 54.85 -.97 +5.8 FedExCp 109.40 -1.03 +21.7 FedSignl 18.27 -.40 +6.3 FedrDS 70.50 -.57 +14.3 CirixSy 32.84 +.02 +15.0 CleanH 33.12 -.56 +17.2 ClickCm 24.64 -.05 -11.7 Cogent 20:02 +.66 +15.9 CogTech 58.26 -.53 +12.9 Cognosg 39.19 -.08 +9.8 CIdwbrCrs 22.34 -.03 +26.8 Comarco 12.65 -.03 +5.6 Comcast 27.38 +01 +6.6 Come so 27.38 +.04 +10.4 ComTouch 1.17 -.04 -4.4 CCmnwltTsd32.29 +.34 -10.0 Compuwre 8.07 -.32 +42.8 ComtchGr 9.49 -.47 +8.3 Comtechs 33.09 +.80 +9.0 Comvers 28.98 -.26 +20.8 ConcurTch 15.57 +.44 +45.0 ConcCm 2.74 -.05 +40.3 Conexant 3.17 -.11 -18.7 Conmed d19.23 -.32 +15.9 Connetcs 16.75 -.12 +38.5 ConorMd u26.80 +.37 +15.4 CorinthC 13.58 +.12 +16.1 Cosilnc 9.64 -.32 +9.2 CostPlus 18.73 -.19 +6.7 Costco u52.80 +.61 +57.9 Craylnc 2.10 +.09 +27.2 CredSys 8.85 -.10 +19.9 Creelnc 30.26 -.12 -6.8 Crocsn 26.60 -.30 +14.0 CubistPh u24.22 +.49 -17.9 Cyberonic 26,.52 -.23 +29.8 Cymer 46.10 -.75 +24.8 Cytogen 3.42 +.05 +3.5 Cytyc, 29.21 +.16 +34.9 DOVPh 19.81 +.05 +7.6 DRDGOLD 1,55 +.10 +33.3 DXP Ent 22.93 +4.35 -10.5 DadeBehs 36.61 -.43 -1.2 Danka 1.62 +32.7 DeckOut 36.64 -.09 +20.1 decdGenet 9.92 +.24 -1.3 DellInc 29.56 +.29 -4.0 DltaPIr 20.90 +.80 -7.6 Dndreon 5.01 +.11 -1A.4 Dendrite 14.21 +.87 +8.2 Dennys n 4.36 -.09 +5.2 Dentsply 56.47 -.34 +4.4 Dglnsght 33.43 -.16 +27.6 DigRiver 37.94 -.26 +12.9 Digitas 14.13 -.10 -4.2 DiscHidAn 14.51 -.23 +16.8 DiscvLabs 7.80 +.19 +74.6 Diversa 8.38 +.67 -.7 DobsonCm 7.45 +.02 +13.3 DllrTree 27.12 -.71 +10.6 DressBn 42.71 -1.67 +9.3 DynMatIs 32.80 +.35 -6.9 eBav 40.22 +.32 +21.6 ECITel 9.11 +.03 +10.5 EGLInc u41.51 -.65 -2.8 eResrch 14.68 -.50 +11.9 ev3lncn 16.50 -.33 -12.1 EZEM 20.14 -.11 -8.7 ErthUnk 10.14 -.05 +6.9 EchoStar 29.06 -.04 -23.7 Educate 9.00 +.17 +10.7 EducMgt 37.09 -.20 +1.9 EduDv 8.25 +.11 +6.3 BectSci 25.68 -.16 +61.7 Bctrgis 4.69 +.26 +.7 BectArts 52.68 +.65 +3.4 EFII 27.52 -.37 +10.7 Emageon 17.60 -.31 +7.8 Emcore 8.00 +27.3 Emdeon 10.77 +.24 -11.4 eMrgelnt .39 -.00 +16.4 EncrMed 5.76 -.13 +48.9 EncorW u33.88 +1.07 +13.9 EncysiveP 8.99 +.14 +5.8 EndoPhrm 32.00 -.12 -4.2 EndWve 11.28 +.32 +19.5 EngyConv 48.71 -.55 +14.2 Enlegris 10.76 -.10 -3.5 EnzonPhar 7.14 +.30 +8.4 Ferrellgs 22.34 +.04 +6.0 Ferrolf 19.89 -.27 .. FRdlNFns 36.80 -.52 -9.5 FstAmCp 4099 -1.04 +5.2 FirstData 45.25 -.27 -4.7 FstFinFd 16.26 -.02 +3.2 FstHodzon 39.68 +25 +15.9 FstMarb 38.10 +2.10 +7.9 FtTrFid 18.47 -.16 +5.9 FstFed 57.72 -3.15 +3.9 FirslEngy 50.92 -.08 -.8 RFleetEn 12.25 +.44 +19.5 Rahocks 58.61 -.02 +5.9 Realuor 81.80 -6.01 +1.7 FootLockr 23.99 +.73 -11.5 EpioorSft 12.50 -.10 +28.8 Equlnix u52.51 -.34 +1.6 EricsnTI 34.94 +.24 +11.0 EuroTech 3.42 -.21 +49.6 EvrgrSIr 15.93 -.08 +18.5 EKelbxis 11.16 -.02 -20.0 Expedian 19.16 -.24 +17.2 Eapdlntl 79.15 +4.9 ExpScripts 87.90 -.88 -2.7 ExtNetw 4.62 -.07 +20.2 F5Netw u68.75 +.83 -42.9 FX Ener d4.56 +.06 +13.1 Fastenals 44.25 -1.02 +1.8 FifthThird 38.41 -.53 +5.0 FileNeth 27.14 +1.20 +39.9 Rnisar u2.91 -.01 -2.2 FinUine 17.04 +.24 +20.4 FrslHrzn 20.77 -.15 -.1 FstNiagara 14.45 -.11 -3.7 FstMerit 24.95 -.05 -2,3 Rserv 42.29 -.61 +1.0 Rextrn 10.54 +.08 +65.7 FocusMed n55.96 +3.82 +84.2 FormFac u40.11 -.59 -18.9 Fossil Inc 17.45 +.27 +28.7 FosterWhn 47.34 +1.04 +11.1. Foundry 15.34 +.69 -6.4 FoxHolIw 27.87 +.15 -14.4 Fredslnc 13.93 -.21 -21.4 FmtrAir 7.26 -.13 +32.2 FuelCell 11.20 +.08 -31.3 Ftrmdiah .22 -.01 +6.4 GSICmmrc 16.06 -.14 -31.7 GTCBio 1.12 +9.6 Garmin u72.70 +3.03 +24.9 Gemstar 3.26 +.17 -4.7 Genaera 1.43 -.22 +167.5 GenBlotc 2.22 -.09 +19.1 GenesMcr 21.55 -.85 +85.6 Genita 2.71 -.11 -15.4 Gentexs 16.49 -.16 +15.3 Gentiva 17.00 +.48 -4.2 Genzyme 67.84 -.85 +3.8 GeronCp 8.94 -4.7 GevityHR 24.50 -.40 +16.6 GileadSd 61.29 +.24 +17.2 Globlind 13.30 +.16 -17.7 GoldKist d12.31 -.70 -9.3 Google 376.45+11.65 -3.1 GrWIfRes 9.99 -.25 +4.3 GrtrBay 26.72 -.64 +2.1 GuitarC 51.08 -.16 +5.6 Gymbree 24.70 +1.84 +10.0 HMN Fn 32.45 +.20 +5.8 HMS Hid 8.09 -.29 +25.6 Hansen s 98.97 +3.52 +1.7 HarbrFL 37.69 -.46 +18.1 Harmonic 5.73 -.09 +3.4 HeidrkStr 33.14 +.34 +28.7 Hittiten 29.79 +1.78 +31.8 Hologics 49.99 -.13 +17.3 HomeStore 5.98 -.17 -7.0 HotTopic d13.25 -.03 -30.6 HouseValu d9.05 -.66 +9.4 HudsCitysu13.26 +.05 +55.3 HumGen 13.29 -.09 +4.6 HuntJBs 23.68 -.29 -.2 HuntBnk 23.70 -.29 +9.7 Hydril 68.70 +.76 -2.5 HyperSols 34.94 +.63 +18.9 12Techn 16.77 -.22 +5.9 IAC Inter s 29.99 +.34 -11.7 ICOS 24.40 -.62 -4.1 IPCHold 26.25 -.73 +16.3 IPIXCp 1.93 +.07 +16.8 Pass 7.66 -.08 -14.1 iRobotn 28.63 +.71 +25.9 IconixBr 12.83 -.04 +31.2 IdenlxPh 22.44 +1.41 +66.5 Identix 8.34 +.13 +85.5 Illumina 26.16 +.16 +9.3 Imclone 37.42 -1.58 +27.4 Immucor 29.75 -.21 +103.7 ImperlSgr u27.66 +1.72 -29.8 InPhonic 6.10 +.40 +6.2 GoldWFn 70.12 -.75 +12.8 GoldmanS 144.00 +.85 +1.4 Goodrich 41.68 -.11 -19.0 Goodyear 14.08 -.44 +10.6 vjGrace 10.40 +.18 -23.6 Graffech 4.75 -.20 -4.7 GrantPrde 42.05 +.48 +1.6 GtIPalnEn 28.41 +.14 -2,5 GMP 28.05 +.08 ... Griffon 23.82 -.17 -3.2 GTelevsa 77.95 -1.20 +6.4 Gtech 33.77 +.30 +26.6 GuangRy 19.65 +.69 +18.9 Guidant 76.99 -.08 -5.2 HCA Inc 47.86 -.06 +16.1 Incyte 6.20 +.29 +2.0 IndpCmty 40.94 -.18 -6.1 InfoSpce 24.24 -.17 +9.2 InFocus 4.38 +.10 +34.3 Informat 16.12 -.84 -10.8 Infosys 72.14 -.20 -1.9 Innovoh 1.01 +.06 +42.1 InsitTc u27.52 +.25 +29.9 Insmed 2.56 -.09 +144.8 Insteel u40.57 +1.27 +17.0 IntgDv U15.42 -.10 -17.9 Intel 20.49 -.31 -31.3 Interchg d3.80 -.26 +47.1 InterDig u26.95 +.48 +38.9 Intrface 11.42 +.21 -23.2 Intgph 38.25 +1.05 +17.3 InlerMune 19.71 +.31 +12.8 IntlDisWk 6.70 +.01 +.1 IntlSpdw 47.93 +.47 +12.0 IntemlCap 9.21 +.18 -12.9 IntrntlniU 9.71 -.14 +19.6 Intersil 29.75 +.16 +7.9 IntraLase 19.24 +.21 -9.2 Intuit 48.42 -.53 -21.9 IntSurg 91.59 -.81 +22.0 InvFnSv 44.92 -.72 +11.3 Invitrogn 74.14 -.52 +23.5 lonatron u12.49 +.95 -21.0 IRISInt 1727 -5.83 +56.5 Isid' 8.20 +.06 -11.7 Isonics dl.59 -.14 +52.4 Ilron u61.03 +.14 +171.7 IvanhoeEn 2.88 +.21 -18.9 Ixia 12.00 -.05 +479 JDS Unih u3.49 +.32 +1.0 JamesRrv 38.59 -.74 -22.0 JetBues 12.00 -.03 +24.1 JJillGr 23.62 -.01 +23.6 JosphBnk s42.91 -2.35 +45.3 JoyGlbIs u58.12 -.86 -12.2 JnprNtw 19.58 -.07 +9.2 KLATnc 53.89 -.27 +19.3 KeryxBio 17.46 -.14 +30.6 KnghtCap u12.92 +.09 +45.4 Komag 50.38 +.34 -9.9 KongZhg 11.26 -.20 -14.4 KopinCp 4.58 -.17 -14,8 KosPhr 44.09 +.61 +.4 Kronos 42.03 -.05 +32.8 Kulicke 11.74 +.07 -10.6 LCAVis 42.47 -.70 +30.0 LKQCps 22.50 +.69 -.8 LSllnds 15.53 -.09 +32.4 LTX 5.96 +.05 +26.1 LamRsch 44.99 +.32 +11.6 LamarAdv u51.46 +.09 +11.3 Landstar 46.45 -.71 -2.9 Lasrsop 21.80 -.35 +12.3 Lattice 4.85 +.11 -.9 Laureate 52.02 -.07 +7.9 LawsnSft 7.93 -.12 +23.7 Level3 3.55 +.04 -13.0 LexarMd 7.14 +.08 -9.6 UbGlobAsd20.33 +.47 -8.2 UbGlobCn 19.46 +.23 +13.8 Ufecell 21.67 -.35 +30.1 LlelneS 47.55 -.05 -19.1 UlePRH 30.35 -.38 -4.4 Uncare 40.07 +.06 +4.5 UnearTch 37.71 -.09 +4.4 LodgEnt 14.56 -.11 +22.3 LookSmtrs 4.60 -.07 +44.7 Loudeve .55 +.03 -18.4 M-SysFD 27.03 -.39 +5.2 MCGCap 15.35 +3.7 MGI Phr 17.79 +.14 +25.8 MKSInst 22.51 -.38 +62.0 MRVCm 3.32 +.05 +13.0 MTS 39.09 -.76 +4.6 Magma 8.80 +.14 +13.7 Manugist 1.99 +.12 +30.6 Martek 32.12 -.98 +15.6 MarvellT 64.83 -.35 +43.1 MatrlxOne u7.14 +1.13 -3.3 IMSHIth 24.10 -.09 +29.3 iShBrazil 43.14 +.24 +1.5 iShJapan 13.72 -.21 +4.7 iSh Kor 46.86 -.38 +4.4 IShTaiwan 13.03 -.01 +3.9 IShSP500 129.48 -.08 +9.5 [ShREsts 70.22 -.17 +9.3 iShSPSmlsu63.17 -.05 +8.1 iStar 38.55 +3.0 ITTIndss 52.98 -.04 +9.2 Idacorp 32.00 -.54 +.6 ITW 88.55 +25 -2.5 Imation 44.94 -.23 -13.3 ImpacMtg 8.16 -.26 +19.4 INCO u52.01 +1.61 +18.3 Mattson 11.90 -.24 .11" ,.II .,,T, 40.29 +.32 +16 r.i-..vT 19.10 +.11 +18.0 McData 4.07 -.01 +16.8 McDataA 4.44 -.03 +3.8 Medimun 36.34 +.04 +7.5 Medarex 14.89 -.09 -17.8 MediaByrs 1.11 +.10 +2.7 Mediacm 5.64 -.02 +16.3 MedAct u23.78 +.23 +17.5 MediCo 20.51 -.09 +10.8 MentGr 11.46 -.15 -26.9 MergeTc 18.31 +.19 -.3 MetaSolv 2.89 +.10 +75.0 MetroOne .63 +.01 +26.1 Micrel 14.62 -.12 +13.6 Microchp 36.52 +.42 +13.1 MicroSemi 31.27 -.21 +3.1 Microsoft 26.97 -.17 +19.1 MicroStr 98.45 -.30 +8.1 MllePhar 10.49 -.22 +61.7 Mindspeed 3.80 -.08 +37.6 Misonix 5.97 +.19. +25.2 Molex 32.49 -.31 +22.8 MnslrWw 50.14 +.26 -3.8 MorgHtin 19.14 -.31 -43.3 MovieGal 3.18 +33.2 Myogen 40.09 +3.28 +26.1 MydadGn u26.22 +.42 +22.8 NABI1Bio 4.15 -.01 -6.8 NETgear 17.95 +.55 -13.5 NGASRs 9.07 -.10 +18.1 NIIHIdgs 51.57 -.36 +40.9 NMTMed 22.62 -.59 +25.9 NPSPhm 14.91 -.09 -1.7 NTLInc 66.90 +.63 -2.7 Nanogen 2.54 . -2.6 Napster 3.43 -.09 +3,2 Nasd100Tr 41.69 +03 +13.7 Nasdaq 40.00 -.49 -2.0 Nastech 14.43 -8.59 +6.8 NatAtlH 11.70 -29.1 Navarre 3.92 +.05 +23.0 NektarTh 20.24 -.29 -5.5 NeoPharm 10.20 -.25 +6.3 Neoware 24.76 -.34 +21.9 NetSeric 5.58 +.08 ... Net2Phn 2.04 +.01 -7.2 NetlQ 11.40 +.03 +42.7 NetLogic 38.87 +1.05 +56.7 Netease 88,02 -.59 -.9 Nettft 26.81 -.04 +23.3 NetWolve .33 -.02 +26.7 NetwkAp u34.21 +.02 +77.5 NtwrEng 2.29 +.07 +10.2 Neurcrine u69.15 +2.09 +38.0 Newport 18.68 +.16 +.6 NexlPrt 28.11 -32.0 NltroMed d9.49 -1.90 -5.2 NobltyH 25.61 +.01 +2.9 NorTrst 53.30 +.02 -30.6 NvtiWds 8.41 -.09 +39.7 Novavax 5.38 -.31 +7.9 Novell 9.53 -.23 +13.4 Novlus 27.35 -.42 -16.4 NuHoiz 8.44 -.03 +34.7 NuanceCm 10.28 -.46 +12.6 NuriSys 40.55 -1.10 +121.9 Nuvelo 18.00 +.23 +34.0 Nvidia 48.99 +.07 +15.0 OReillyAs 36.80 -.40 +13.1 OSIPhrm 31.72 -.11 -41.9 OccuLogix 4.18 +.37 +6.9 OhioCas 30.27 -.79 +8.7 OlympSt 27.00 +.10 +20.2 OmnIVIsn 23.99 -3.22 -5.4 OnAssign 10.32 -.26 +25.5 OnSmcnd 6.94 +.04 -1.4 OnyxPh 28.41 -.21 +7.9 OpnwvSv 1885 -78 +17.8 Opsware 8.00 +18.6 OptdCm 2.74 -.16 +26.6 optXprs 31.07 +.49 +48 Oracle 1280 -01 +11.5 OraSure 9.83 +.10 +9.4 Orthfx 43.65 +.66 8.3 OtterTail 29.95 -1.01 ....... v .iwvKo.... Kohls Kraft KrspKrm If Kroger LG Philips LLE Ry LSI Log LTC Prp LaZBoy Laclede LVSands LearCorp LehmBr LennarA Lexmark S49.03 +26 29.54 -.10 6.54 -.19 19.79 -.32 23.44 +.60 2.63 +.04 9.80' -09 22.42 -.23 15.77 -.23 33.65 -.55 53.23 -.86 d18.61 -2.16 145.81 -.63 59.28 +.03 47.72 -.04 Building A Home /'.. As Unique As Your / Signature ,. ,r.c .., P ." wwwsandnotntuy crjrri Lic#CG028828 -.8 FordM 7.66 -.29 +20.6 FdgCCTgs 41.70 +.74 +12.2 ForestLab 45.66 -1.34 +9.7 ForestOil 50.00 -.06 +.3 FortuneBr 78.24 -.28 A F.ti.. l,: "" "i -,., *t0I'. Frv :B. ; .; -.18 -1f99 FDeiMnI 01824 -r. J -1.5 FriedBR 9.75 -.07 +31.6 FrontOils u49.38 +1.63 +4.2 Frontline 37.08 +.27 +10.9 GATX 40.00 -.36 +9.1 GabelliEr 8.76 -.02 +3.6 Gannett 62.75 +.02 +3.6 Gap 18.28 -.38 -11.6 Gateway d2.22 -.06 -8.1 'Genentch 85.05"+.10 +10.9 GenDyn u126.44 +1.98 -6.3 GenElec 32.85 +.09 +6.8 GnGrthPrp 50.20 -.45 -.3 GenMlls 49.18 +.16 -.1 GnMotr 19.41 -.49 +1.7 GMdb32B 15.15 -.05 +3.4 GMdb33 16.28 -.11 -4.6 Genworth 33.00 +.33 +49.1 Gerdaus u24.87 +.96 +.1 Glamils 29.15 +1.51 +2.3 GlaxoSKIn 51.65 +.26 +20.5 GlobalSFe 58.02 +1.95 +10.2 GolLlnhass31.10 -2.08 +22.3 GoldFLld 21.57 -1.63 +25.3 Goldcrp gu27.92 +1.68 +15.7 Hallibin 71.69 -+2.32 +8.7 HanJS 14.60 +.02 +6.7 HanPIDiv 8.60 -.04 +14.7 HanPtDv2 11.64 -.20 +10.6 Hanover 15.61 +.13 .1.9 HC -.'.:.,icrl.. ]6S -.05' *LI..1 Hu ,C., t'f.l) ) -.59 I HiA,1,-l I .1 '*4 -.67 -4.4 Hiia :..yG 14a, +.57 .1 H4,-rr'r,t 71 '. -.90 +9.0 Harris s 46.89 +.88 -3.5 HarI dFn 82.90 -.60 +1.9 Hasbro 20.56 +.08 +2.6 HawaliEl 26.57 -.14 +.9 HItCrREIT 35.91 -.31 -4.0 HItMgt 21.08 -.13 +12.2 HlthcrRity 37.32 -.14 -4.8 HealthNet 49.06 +.39 +32.5 HecteaM 5.38 +.48 +10.8 Heinz 37.35. -.29 +5.7 HelnTel 11.08 +.32 +9.6 HelmPay 67.87 +1.35 -7.3 Hershey 51.21 -.20 +19.4 HewlettP 34.19 +14 +12.0 HghldH 12.38 +.06 +15.2 HighwdPIf 32.77 +.11 -.6 Hilton 23.96 -.19 +4.5 HomeDo 4229 -.30 +11.4 HonWallnl 41.48 +.21 -6.0 Hospira 40.23 +1.13 +11.7 HospPT 44.81 -.18 +4.2 HostMarr 19.75 +.22 +5.6 HoustEx 55.78 -.20 -6.4 HovnanE. 46.44 +.31 +29.1 HughSup 46.27 +.02 -6.2 Humana 50.94 -.51 -.4 Indymac 38.87 -.33 +6.2 Infineon 9.66 -.07 +2.6 IngerRds 41.42 -.54 +63.3 IntntnExn u59.36 +2.60 -2.7 IBM 79.94 +.04 -'i i,'l'..: '1 8.60 +.156 ,rj Ir, ,irr., "c" -.50 -'IrFPa C .,' ? -.08 *.i56 .. 40.08+1.12 +8.3 Interpublic 10,45 -.03 +15.9 Intrawtg 33.55 +.81 +3.9 IronMtn 43.86 +.41 +34.4 JLG u61.37 +1.38 +5.0 JPMorqCh 4166 +03 +3.7 Jabil 38.45 +.15 +17.8 JanusCap 21.94 -.36 -.4 Jardens 30.02 +.17 +4.2 JeffPilot 59.30 -.67 -4.0. JohnJn 57.69 +.03 -3.1 JohnsnCtI 70.67 -.61 -5.8 JonesApp 28.93 -.07 -7.9. KB Homes 66.93 +.39 +11,8 Kaydon u35.93 -.19 +18.1 Keane 13.00 -.15 +2.4 Kellogg 44.27 -.05 +9.1 Kellwood 26.05 -.09 +10.3 KerrMcG 100.25 +.72 +11.1 Keycorp 36.57 -.34 +14.3 KeySpan 40.81 +.06 -.1 KimbCIk 59.60 -1.3 KndME 47.19 -.08 -15,0 KindredH 21.90 -.18 +1.7 KingPhrmnn 17.21 +.93 +10.6 Kinross g 10.20 +.68 +4.6 LbtyASG 5.69 +.01 +5.5 .r...rM 8.30 +.05 -1.5 -.,)EI. 55.75 -.14 +4.3 Umited 23.30 -.49 +6.2 UncNat 15I1 -7 F . -;l:' il. ,' 2 ,3l l .- -;i,:..: 36.97 W '+15.2 I...: 73.31 --: -2 Ic-w'. 94.62 .i.3 +20.4A-LngDrg u43.81 -4136 +2.7 LaPac 28.20 -*: +2.4 .LowesCos 68.26 -.06 +5.6 Lucent 2.81 -.06 -12.4 Lyondell 20.86 -.14 I 3lTB II r -,68 ,f. I ILLH I1 -.40 riEt.IC iT U34.83 +.38 I. AI. 8.53', +2.6 MGMMirs 37.64 +.53 +6.3 Madeco 8.26 -.26 +2.6 Magnal g 73.87 -2.67 +2.8 MgdHi 6.18 -.02 +6.0 ManorOareu42.15 +.43 +10.2 Manulifg u64.80 +.81 +19.2 Marathon 72.65 +.16 -2.9 Mariner wi 20.40 -.96 +2.1 MarlntA 68.38 -.43 -1.5 MarshM 31.29 +.39 -1.0 MStewrt 17.25 +.24 +8.1 Masco 31.14 -.07 -2.4 MasseyEn 36.96 +.14 -7.8 MatedalSud 13.00 +.25 +7.3 Maitel 16.97 +.21 +21.5 MavTube 48.41 +1.21 -19.9 Overstk 22.56 -.24 +11.3 PDLBio 31.63 -.12 -7.4 PETCO 20.33 +.93 +45.1 PMCSra u11.19 +.07 -19.7 PRGSchlz .49 +19.8 PSSWrid 17.78 +.29 +16.3 PW Eagle 23.85 +1.05 +1.2 Paccar 70.06 -.81 +81.2 PacEthannu19.61 -.04 +40.5 Paclntrnet 8.09 +35 -11.6 PacSunwr 22.02 +.09 +67.2 Packetr 12.99 +.49 +62.7 PaInTher 11.00 +.10 +32.6 PalmInc u42.16 -.84 +32.4 PanASIv 24.94 +2.49 +14.7 Panacos 7.95 +.35 +.6 PapaJohn s29.82 -1.79 -1.4 ParmTcrs 15.04 -.34 +17.9 Parlux 36.00 +.49 +6.0 Patterson 35.39 -.17 -14.4 PattUTI 28.22 -,26 +5.4 Paychex 40.17 -.02 +2.4 PnnNGm s 33.73 -.42 4+51.6 Peregrine 1.41 +.06 -1.5 Petrohawk 13.02 +.40 +32.9 PetDev 44.30 +.55 +10.1 PetsMart 28.25 +2.04 +11.8 PhrmPdts 34.62 -.23. -2.9 Pharmion 17.25 +.34 +6.4 PhilConss 34,29 -1.06 +19.7 Photlrn 18.02 -.07 +21.6 Pixars 64.10 -.17 -5.5 Pxiwrks 4.80 +.30 +52.2 Plexus 34.60 -.39 -4.5 PlugPower 4.90 -.10 +35.4 Polycom 20.72 -.26 -5.9 Popular 19,90 -.46 -14.5 PortPlay 24.20 -1.05 +20.8 Powrwav 15.19 -.14 +91.4 Pozen u18.36 +.58 +38.6 Prestek 12.53 +.09 +7.6 PriceTR 77.50 +.27 +13.3 PrimusT .85 +.00 +16.5 ProgPh 29.14 -.22 +15.8 PsycSols 34.,01 +.75 +29.2 QIAGEN 15.18 +.33 +16.2 QLT 7.39 -.08 +1.8 QiaoXing 7.53 +.07 +27.6 Qlogic 41.47 +.73 +11.0 Qualcom 4783 -.20 -44.5 QuantaCap d2.83 -1,90 +74.6 QuanFuel 4.68 +.03 +8.4 QuestSftw 15.52 +.39 +6.0 Quidel 11.41 +.44 +33.8 RFMicD 7.24 -.01 +45.0 RSASec 16.23 +1.13 +30.4 RackSysn 37.15 -1.66 +48.6 Radcom 4.68 -.30 -21.4 ROneD d8.13 -.13 +14.6 Radware 20.82 +.75 +29.9 Raindance 2.65 +102.2 Rambus 32.74 -.10 +10.6 Randgold 17.84 +.65 +1.7 RealNwk 7.89 -.01 +3.6 RedHat 28.25 +.11 +46.2 Redback u20.55 +1.00 +40.1 Rdif.crm 25.32 -.17 +43.7 Renovis 21.98 -.43 +25.7 RenlACt 23.70 +.27 -8,9 RepubAir 13.85 -.22 +1.5 RepBcp 12.08 -.08 +8.2 RschMotn 71.39 +.34 -8.5 RIghtNow 16.89 +.80 -3.2 RosettaRn 17.91 -.17 -1.6 RossStrs 28.43 -.19 -9.5 RoyGId 31.42 +.70 -8.5 S1 Corp 3.98 -.30 +15.2 SAFLINK .91 -.04 +28.0 SBACom 22.92 +.29 +39.2 SFBCInt 122.29 -1.33 -8.9 Safeco 51.48 -.30 -22.5 SafeNet 24.98 -.15 -10.2 SalixPhm 15.79 -.28 -23.1 SanderFm 23.48 -.21 +44.1 Maxtor u10.00 +.08 -9.7 Maylag 16.99 +.22 +20.2 McDer 53.60 +2.75 +3.6 McDnlds 34.94 +.01 +5.2 McGrwHs 54.32 +.04 +5.5 McKesson 54.42 -.35 -12.5 McAfee 23.75 +,29 -2.3 MeadWvco 27.38 -.58 +6.3 MedcoHIth u59.29 +.01 -8.4 Medcis 29.35 +1.02 -6.5 Medmnic 53.80 +.02 +5.9 MellonFnc 36.27 -.22 +25.0 MensWs 36.80 +4.59 +10.4 Merck 35.12 +.16 +22.9 MeridGld 26.88 +1.12 -1.7 MedriRes 4.13 -.03 +9.5 MedStHsp 10.29 -.01 +14.7 MerrilLyn 77.68 +.14 +2.2 MeatLe 50.06 +.38 -8.0 Michaels 32.53 -.02 +19.1 MicronT 15.85 -.10 +11.6 MidAApt 54.13 -.17 +17.4 Midas 21.55 +2.71 +26.2 Milacron 1.59 -.01 +5.0 Millipore 69.36 +.09 -5.0 MillsCp 39.85 -.33 +.3 Mirantn 25.05 +.55 +7.1 MNtsuUFJ 14.66 -.29 +31.6 MittalSt 34.65 +.70 +11.3 MoblleTel 38.96 +1.98 -3.3 MolsCoorsB 64.76 +2.20 +10.3 Monsnto 85.48 +.46 -12.4 Montpelr 16.55 -.49 +10.7 Moedyss 68.00 -.39 +5.4 MorgStanr 59.79 -.34 +20.1 MSEmMkt 26.32 +.12 -1.8 Motorola 22.19 +.10 -.9 MunienhFd 11.03 +.01 -11.9 MurphOs 47.57' -.02 +16.1 MylanLab 23.18 -.07 +17.2 NCRCp 39.78 -.29 -5.7 NRG Egy 44.42 +.42 -11.3 Nabors 67.20 +.34 +3.8 NaltCity 34.85 -.42 +4.5 NalFuGas 32.60 +.09 +7.8 NatGrid 52.49 +.06 -.1 NOilVarco 62.66 +1.59 +14.3 NatSemi u29.69 +.22 +6.9 NewAm 2.17 +8.2 NwCentFn 39.01 -.09 +6.2 NJRscs 44.50 -.17 -34.0 NY&Co 14.00 -2.73 +3.3 NYCmtyB 17.06 -.13 +5.0 NewellRub 24.97 +.06 -21.3 NewlExps 39.42 +54 +1.4 NewmtM 54.15 +1.18 -.1 NwpkRs 7.62 -.01 +5.2. NewsCpA 16.36 -.01 +4.5 NewsCpB 17.36 -.01 -3.0 NiSoirce 20.24 -.20 +3.4 NiaMpf B u75.50 +1.15 +8.2 Nicor 42.53 -.27 -.9 NikeB 86.05 -.26 +10.2 NobleCorp 77.75 +1.45 . :I J ..l. C y'. .''; 1 ' +-i1 rJ.,,,.i lJ.i 1 1 I i -.i.. Tvh'.lrtv5 : i': .'. 1r +13.2 NoBordr 47.55 +.03 +8.6 NorthropG 65.30 +.76 +3.5 Novarts 54.33 +.73 +.8 NSTARs 28.92 -.13 +33.3 Nusor u88.95 +1.44 +4.8 NvFL 14.72 -.08 +5.3 NvIMO 15.20 -.16 +6.0 OGEEngy 28.39 -.16 +2.4 OMICp 18.58 +.82 +18.0 OcdPet 94.28 +1.64 +15.4 OfcDpt u36.24 +.40 +1.9 OldRepubs21.40 +.18 +9.6 Olin 21.56 +18 +7.2 Omncre 61.33 -.48 -5.6 Omnicom 80.38 -.13 +48.9 OreSlt u43.80 +2.05 +28.4 Oshkshs 57.25 +.30 +.3 OutbkStk 41.75 -.03 -9.8 Owenslll 18.98 +.05 +5.2 PG&ECp 39.04 +.58 -7.2 PHH Cp 26.00 -2.73 +14.2 PNC 70.63 -.28 -2.5 PNM Res 23.88 -.95 N-2.8ASn 61.20SD-7IONALM -2.6 SanDisk 61.20 -.57 -T Sanmina 3.90 -.03 I' Santarus 7.00 -.04 +38.3 Sapient 7.87 -.12 -4.0 Sawis .72 -.07 +5.2 Scholasto 29.99 +.03 +12.7 Schwab 16.54 +.02 +21.1 SdClone 2.81 +.11 +17.3 SciGames 32.00 -.63 +11.0 SeaChng 8.77 -.08 +4.9 SearsHIdgs121.20 -.24 +5.2 SecureCmp 12.90 +.33 +34.6 SelCmfrt 36.80 +.06 +2.1 Selctin. 54.21 -.17 +6.0 Semlech 19.36 -.13 +11.4 Sepracor 57.48 -.67 +2.1 SerenaSt 23.92 +.07 +24.3 Serolog 24.54 +.30 -10.1 Shanda d13.70 +54 +.1 Shrplm 9.75 -1.91 +25.0 Shire 48.49 -.20 +3.8 ShulfMstif 26.10 -.17 +32.7 SIRFTch u39.55 -1.36 +14.4 SierraWr 12.70 +.47 +17.6 Sify 12.65 +.07 -15.4 SigmaTel 11.08 -.04 +22.5 Silicnlmg 11.11 -.03 +36.1 SilcnLab 49.90 -.41 +11.2 SilicnMotn13.34 -.81 -3.9 SST 4.87 +.05 -1.4 SIcnware 6.84 -.02 +19.6 SIIvStdg 18.34 +1.58 -6.0 Sina 22.70 +51 -24.2 SiriusS 50B +04 +105.6 SimaThera 6.23 +.04 +7.2 SkyWest 28.80 -.19 +6.5 SkywksSol 5.42 -.02 -7.7 SmudSlne 13.08 +.03 +19.0 Sohu.cm 21.83 -.24 -34.6 SomeraC .51 -.03 -12.5 SncWall 6.93 +.08 +17.1 SonoSite 41.01 +.07 +37.6 Sonus 5.12 +.03 -9.9 SouMoBc 13.25 -8.6 SrcelntInk 10.16 -.31 +7.4 SpansionAn14.96 -23.1 SpatiaLt 2.67 -.43 +1.5 StaarSur 8.02 -.09 +9.2 Staples s 24.80 -.29 +9.4 StarSden 2.57 -.12 +18.1 Starbuckss 3545 -83 +10.1 STATS Chp 7.49 -.07 +33.9 StlDyna 47.55 -.12 -12.6 SteinMrt d15.87 -.54 +4.3 StemCells 3.60 -.04 +51.0 Stereotaxis 13.00 -.33 -3.1 StckYale .93 +.03 +25.6 StoltOffshu14.65 +.80 +46.9 Stratex u5.26 +.06 -4.4 SumTotal 4.30 +.03 +1.9 SunMicro 427 -.02 +47.9 SunOptla 7.78 +.29 +27.6 SunPowern43.38 -.69 +16.3 SupTech .50 -.01 +2.7 SusqBnc 24.33 '-20 +19.4 SwiftTm 24.23 +.09 +13.4 Sycamore 4.90 +.03 -3.0 Symantec 16.98 +.04 +7.0 Symetric 9.06 +.01 -2.9 Synaptics 24.00 +.17 -14.5 Syneron 27.15 -.62 +12.1 Synopsys 22.49 +.50 -3.4 Synovis 9.69 +.37 +22.1 TDAmeritr u2Z57 +.55 -.2 THQs 23.81 -.27 -6.0 TLC Vision 6.06 +.06 -11.9 TakeTwos 15.59 +12.1 TalxCpa 34.16 +2.25 +12.9 TardPh 15.77 -.35 +42.8 TASER 9.94 -.09 +7.0 TechData u42.37 -.18 -5.3 Tegal .54 -.04 -1.6 Tekelec 13.68 -.07 +29.9 Telikinc 22.07 -.31 +36.1 Tellabs 14.84 -.03 +48.9 Terabeam 4.14 +.12 +.9 TerayonIf 2.33 -.37 +7.4 PPG 62.20 +.17 +8.6 PPLCps 31.93 +.35 -74.5 PXREGrp d3.30 -.16 +6,5 Pal[Cp 28.60 -.62 -4.7 ParPharm 29.88 +.05 -10.7 ParkDrl 9.67 +.32 -13.5 PaylShoe 21,72 -.53 +20.3 PeabdyEs 49.58 -.22 +.6 Pengrth g 23.67 -.30 +6.2 PenVaRs 59.00 +1.10 +8.3 Penney u60.19 +.01 +3.3 PepBoy 15.38 -.24 +.3 PepsiCo 59.28 +.03 +3.5 PepsiAmrer 24.07 -.12 +1.4 PerkElm 23.88 -.20 +.8 Prmian 15.66 -.07 +24.9 PelrbrsA 85.70 +.40 .+31.7 Pelrobrs 92.73 +.53 +11.7 Pfizer 26.06 -.20 -.3 PhelpD 143.50 +2.05 +4.8 PhilipsEI 32.59 -.30 +1.2 PiedNG 24.45 -.19 +17.6 Pier 1 10.27 -.28 -30.3 PilgrimsPr 23.11 -.16 +13.4 PimaoStra 11.99 +.19 -2.9 PinWst 40.17 -.57 -14.5 PioNti 43.85 +1.55 -.8 Pitoyw 41.92 -.69 +1.1 PlacerD 23.19 +.50 +4.7 PlainsEx 41.59 +.34 +2.3 PlumCrk 36.87 -.18 +.7 PogoPd 50.14 +.17 +10.7 PoslPrp 44.21 -.04 +3.3 Praxair 54.70 -.15 +4.7 PrecCasts 54.27 +.65 +5.4 Pridelnt 32.41 +.46 +2.0 PrinFnc 48.39 -.61 +2.9 ProctGam 59.55 -.56 +.7 ProgrssEn 44.22 +.03 -11.1 ProgCp 103.80 +-3.30 +12.1 ProLogis 52.36 -.31 +12.0 ProsStHiln 3.26 +.05 -.1 ProvETg 10.80 +3.3 Prudent 75.59 -.48 +6.1 PSEG 68.95 +.21 +4,2 PugelEngy 21.27 -.17 -1.4 PulteHs 38.82 +.10 +3.4 PHYM 7.00 -.02 +4.1 PIGM 9.81 -.04 +1.3 PPrIT 6.15 +29.6 Quanex 64.74 +.17 +6.2 QuantaSvc 13.98 +.02 +22.0 QtmDSS 3.72 -.02 +4.2 QstDiags 53.65 +.50 -1.2 Questar 74.78 -.03 -12.8 QksuvRess 36.64 +.24 +4.0 Quiksilvrs 14.40 -.16 +16.3 QwestCm u6.57 +.15 +4.1 RPM 18.08 +.03 -8.7 RadioShk 19.20 -.43 -3.2 Ralcorp 38.65 -.03 -4.4 RangeRss 25.18 +28 +16.3 RJamesFn 43.82 -.34 +9.3 Rayoniers 43.56 -.22 ,+9.5. Rayltheon u43.98 +.30 '. ; ril,',',' .23.25 ..' .11 i i,.:..,:fn -'.> -2.6 Repsol. 28.65 +.52 +7.6 RetailVent 13.39 -.30 +12.5 Revlon rt .09 +10.0 Revaon 3.41 -.09 +17.8 RteAid 4.10 +.21 +13.7 RockColl 52.85 -.27 +18.3 Rowan 42.16 +.91 -1.1 RylCarb 44.55 -.20 +.4 RoyDShAn 61.74 -.18 +5.2 Royce 21.12 +.17 +2.7 SCANA 40.48 -.24 +3.4 SLM Cp 56.95 -.35 +12.9 SPXOp 51.67 -.73 -1.7 STMicro 17.69 +.09 +4.5 Safeway 24.72 -.01 -12,2 StJoe 59.00 +.08 -9.3 SUude 45.55 +.22 -4.7 StPaurfrav 42.59 -.22 +11.5 Saks 18.80 -.80 +14.6 Salesforce 36.72 -.09 +5.1 SalEMInc2 13.82 -.01 +3.4 SalmSBF 15.59 -.01 -7.3 SJuanB 40.41 +.23 -2.6 Sanofi 42.78 -.11 -7.6 SaraLee 17.46 -.11 -12.9 SchergPI 1815 -.21 +16.3 TetraTc 18.22 +.28 +1.1 TevaPhrm 43.48 +.05 +6.5 ThStreet 7.68 -15.1 Thrmogn 4.10 +.09 -2.9 Thoratc 20.10 -.44 +34.4 3Com 4.84 +.07 +1.9 ThrshldPh 14.72 -.26 +17.8 TibcoSft 8.80 -.05 +35.7 TWTeleh u13.37 +.54 +10.4 liVo Inc 5.65 +18.3 TracltSupp 62.62 -1.82 +32.6 TrdeStatn 16.42 +.17 +15.3 TmsactnSy 33.19 -.84 +47.8 Tmsmeta 1.67 -.02 -6.0 TmSwtc 1.72 -.07 +.4 TriZetto 17.06 +.20 +58.8 TridMics 28.58 -.54 +22.6 TrImbleN 43.50 +2.35 +8.5 TnQuint 4.83 +.01 +46.0 TrueRelilgn22.48-1.19 +1.1 TrstNY 12.56 -.04 +10.4 Trstrnk 30.32 +21.3 24/7RealM 8.90 -.01 -16.4 UALn 36.07 -.03 +.1 UCBHHds 17.90 +.03 +40.9 USCncrt u13.36 +.62 -2.5 USPhysTh 18.00 -1.05 -18.9 UTStrcm 6.54 +.13 -4.6 UbiquiTI 9.44 -.10 430.5 UtdNtdF 34.46 +.66 -14.8 UtdOnIn 12.11 -.01 +25.2 UtRetail 16.47 -.62 +34.5 US Enr 5.89 +.44 -7.6 UtdThrp 63.89 +1.02 +2.3 UnvAmr 15.42 +.16 +13.6 UnivFor 62.75 +.12 +9.2 UrbanOuts 27.54 -.62 +110.1 VASftwr 3.74 +.06 -10.4 VNUSMdhd7.51 -.95 +74.7 ValTech 2.69 -.01 -4.1 ValueCirck 17.37 +.02 +8.7 VarianSs 31.25 -.99 +4.7 VasooDta 10.32 +.28 +39.5 Vasogeng 2.86 -.05 +8.3 Vedsign 23.71 -.10 +47.8 Versantre 8.09 +2.69 +59.0 VertxPh 43.99 -.11 -4.0 VertidNet .56 -.00 +4.5 VewptCp 1.15 +.04 +4.7 VisageTrs 18.44 +.31 +41.2 VionPhm 2.33 -.02 +12.4 ViroPhrm 20.79 +.19 +74.5 Viesse u3.35 +03 +13.2 Vofiera 16.98 -.07 -10.0 Wamaco 24.04 +.07 +7.1 WashGInt 56.75 -.60 -6.0 WaveSys .64 +.02 -21.1 WebSide 14.31 -.74 +36.7 WebEx 29.67 -.05 -.9 webMeth 7.64 +.01 -5.4 Websense 62.07 -.59 -.4 WemerEnt 19.63 -.36 -3.6 WstMar 13.48 +.77 -.3 WAmBcp 52.92 -1.67 +8.2 Westell 4.87 +.06 +22.5 WetSeal 5.44 +.09 -17.6 WholeFds 63.80 +.13 +51.1 Wild0ats u18.25 -.05 +3.4 WindRvr 15.27 -.11 -6.5 WrdssFac 4.77 +.09 +17.6 WtnSys 23.13 -1.18 +58.5 WHeartg .84 -.11 +18.6 Wynn 65.03 -1.38 -19.7 XMSat 21.90 -.05 +12.5 XOMA 1.80 +.07 +10.1 Xilinx 27.75 -.27 +7.5 YRC Wwde 47.97 -.88 -191 Yahoo 31.70 -.48 +23.6 ZhoneTch 2.62 +.01 -16.2 ZixCorp 1.60 -.06 +28.2 Zoran 20.78 -.13 +31.5 ZymoGen 22.37 -.30 -8.2 SchrPpfM d49.38 -.37 +25.0 Schlmb 121.42 +3.36 +8.0 ScottPw 40.38 -.07 +38.6 SeagateT u27.70 +45 +7,0 SempraEn 47.99 +.02 -.7 Sensient 17.78 -.14 -.8 Sherwin 45.05 -.45 +12.3 Shurgard 63.70 .. +8.7 SierrPac 14.17 +.01) +8.4 SimonProp 83.0 8 -.48 +34.6 SmihAO u47.25 +.13 +9.0 Smitilnts 40.46 +1.09 -11.0 SmithfF 27.23 +.24 -2.5 Solectm 3.57 -.04 +12.7 SonyCp 45.99 -1.16 -2.0 SouthnCo 33.84 -.26 +25,3 SthnCopp 83.92 +3.17 +2.5 SwstAirl 16.84 -.19 -3.3 SwnEngys 34.76 -.23 -3.4 SovrgnBcp 20.88 -.16 +4.7 SprintNex 24.45 -.06 -10.3 StdPacs 33.01 +.26 +14.7 Standex u31.85 -.55 S+.l Starwdl 63.93 -.32 +13.0 StateStr 62.66 +.24 -.9 StationCas 67.20 -1.29 +2.3 Steds 25.59 +.22 +20.0 StillwtrM 13.88 +.68 +10.0 sT Gold 56.74 +.64 +3.6 Stryker 46.05 -.28 -1.3 SturnR 6.92 -.15 +10.0 SubPpne 28.82 +.06 +12.5 SunCmts 35.31 +.24 -45.1 SunComWlsdl.52 -.08 +24.9 Suncorg 78.83 +2.23 -.4 Sunocos 78.05 +1.84 -.7 SunTrst 72.23 -.25 +28.2 SupEnrgy 26.98 -.08 -3.5 Supvalu 31.34 -.06 -8.3 SymnbT 11.75 -.09 -4.6 Sysco d29.61 -.35 -5.7 TCF Fnd 25.60 -.13 +7.5 TDBknorth 31.23 -.11 -3.1 TECO 16.64 -.25 +4.5 TJX 24.27 -.24 +5.5 TXU Cps 52.94' +.79 +4.7 TXUpfD 84.45 +1.12 +.4 TaiwSemi 9.95 -.10 -7.2 Talbots 25.83 -.50 +5.5 TalismEg 55.79 +1.47 -2.3 Target 53.71 -.86 +39.0 TataMotorsu19.96 +.60 +7.2 TelNorL 19.21 -.03 -14.5 TelcNZ 27.95 +.14 -7.3 TelMexLs 22.88 -.09 +36.2 TelspCel 5.15 +.04 +3.7 TempurP 11.92 +.24 +56.7 Tenaris u179.41+12.16 -4.2 TenetHU-Ilh 7.34 -.37 +4.2 Teppco 36.30 -.08 +19.1 Teradyn 17.35 -.31 +27.9 Terra 7.16 -.04 +20.5 TerraNitro 22.95 +.14 +2.4 Tesoro 63.00 +1.37 ,+31.1 TeruTs 40.02 +.95' -+.9 1 I,1',-i .." l,.: i" .+142 T_.i:,,', -'. l -60,. +15.4 rr., '.,:, 1 "i 3 i-6 +24.9 Tredgar 16.10 -5.5'I +7.6 TdCont u20.00 +.07!! +1.5 Tribune 30.70 -.0; I +25.5 Trnityln u55.30 +.13. +6.5 TrizecPr 24.40 -.H11O -10.2 Tyccl..ii _'.K*~- -20.4 Tysc" ., p '- +13.7 UBSAG 108.17 +.69J +11.4 UILHold 51.25 +0.t1 +6.3 USEC 12.70 -.19%, -2.9 USTInc 39.65 +.04-A +6.6 UniFirst 33,14 +.14 +10.3 UnionPac 88.82 -63 +16.0 Unisys 6.76 1,9 +14:1 UDomR 26.74 - +4.8 UtdMicro 3.27 -O -.3 UPSB 74.95 -.3+7 +2.7 USBancrp 30.70 -3 +19.8 USSteel 57.60 +4.3 UtdTechs 58.29 -A4 -7.3 UtdhWhs 57.58 -.8 +14.0 UnMsion 33.50 -3 -9.5 UnumProv 20.60 -1'7 +6.5 ValeanlPh 19.25 +.4i1a'l +9.9 ValeroEs 56.73 +1.790! -2.9 Veclren 26.36 -.021 +12.9 VerizonCm 34.00 -.M -2.8 ViacomB n 39.98 -.95S +8.7 Vishay 14.96 +.lyT -31.6 Visteon 4.28 -.45', -8.3 Vodafone 19.68 +.Ir-,A +7.2 Vornado 89.44 -3&;3 +3.7 Wabash 19.75 -.163 +5.4 Wachhvia 55.72 -.3, -3.7 WalMart 45.06 -.O8,T +.8 Walgm 44.62 -0c,| -2.2 WAMull 42.96.8 -34 +10.7 WsleM[nc 33.59 +.1- . +23.3 Weathilnts 44.64 +1.50.. +5.9 WeinRt 40.04- -' -9.9 Wellmrn 6.11 . -4.7 WellPoints 76.00 +1.6 Xi.:i,,) :. 63.84 - +5.8 1'.'.1'L 58.44 .-h' +.8 WestarEn 21.68 --'1 . -.1 WAstTIP2 11.86 ..!"8 +23.4 WDigii 22.96 -.23a +.9 WstnGsRs 47.50 -5.9 WslnRefn 17.50 ." -32.2 WestwOne 11.05 +.098 +2.4 Weyerh 67.96 +.00:1 +8.8 Whrpl 89.49 -.411 +.7 WhitngPet 40.28 +.3QT +7.8 WilmCS 18.75 +.46iil -5.4 WmsCos 21.92 +.0183 -5.3 WinlisGp 34.99 9 -.A +.5 Wimnnbgo 31 4- -5.1 +4.0 WiscEn rAu n ., +3.6 Worthgin -. r',4i !'8 -5.4 Wrigley :." *Lul , +7.9 Wyeth .aA" '8 +1,0 XL Cap ;'6, -1 +2.0 XLCapun '; . -. II T.. 4 j :i .I I 5.-" 6-,, ., 1 ,', 1 r YA1 American Stock Exchriange listings can be lourid onn he nexi page. Request OK os or mutual lunds Dy wrilinrg he Crironicle Ann SOlCK Requesis. 1624 Nr Mleadowcresi Blvd. Crystal Rrver, FL 344129; or pnoning 563-5660. For stocks. include : the name of Ihe stock, its market and s Ticker symbol. For mutual lundis, 1s - the parent company and Ire exact name o0 Ire lund 7f Yesterday Pvs Day - Australia 1.3389 1.3434 ' Brazil 2.1185 2.1170 Britain 1.7535 1.7400 iri Canada 1.1310 1.1351 1) China 8.0341 8.0345 Euro .8310 .8393 ;. HonqcKonq 7.7573 7.7574 .c) HunQary 211.24 212.58 al India 44.180 44.280 IT Indnsia 9177.00 9178.00 5s Israel 4.7004 4.6975 d3 Japan 115.80 116.07 - Jordan .7091 .7091 . Malaysia 3.7065 3.7095 Y Mexico 10.5483 10.4690 T, I Pakistan 59.98 59.70 Poland 3.15 3.16 ., Russia 28.0467 27.3830 .4 SDR .6957 .6953 Singapore 1.6141 1.6181 Slovak Rep 30.79 30.99. o So. Africa 6.0990 6.1733 So. Korea 968.70 971.00 v Sweden 7.8736 7.9376 Switzerind 1.2990 1.3129 v4 Taiwan 32.30 32.25 .7 U.A.E. 3.6729 3.6730 0 British pound expressed in U.S. dollars. All others show-T dollar in foreign currency. I 0 111111114 i r iiiii. r ^ .mll^* Yesterday Pvs Day ?. Prime Rate 7.50 7.50 Discount Rate 5.50 5.50 Federal Funds Rate 4.50 4.50 Treasuries 3-mnnth 4 50 4.45 ".-m..Ihr. 4 58 4 52 . E.-vear aIP". 459 1O-year 463 457 ,j 30-year 4 61 4 53 FUTURES Exch Contract Settle Chg1 Lt Sweet Crude NYMX Apr06 63.36 +1.39] Corn CBOT May06 239V4 +41/2 .1 Wheat CBOT May 06 3801/2 +61/2,1 I Soybeans CBOT May 06 604 +13 ' Cattle CME Apr06 86.80 -.22, Pork Bellies CME May 06 90.87 +.15,) Sugar (world) NYBT May06 16.88- +.093a Orange Juice NYBT May06 132.05 +.50) SPOT Yesterday Pvs Day '3 Gold (troy oz., spot) $568.20 $553.90 r) Silver (troy oz., spot) $10.128 $9.536 ro Copper (pound) $2.2755 $2.2810 t , C- NMER = New York Mercantile Exchange. CBOT = Chicago'! Board of Trade. CMER = Chicago Mercantile Exchange.s NCSE = New York Cotton, Sugar & Cocoa Exchange.153 NCTN = New York Cotton Exchange. L. 'I -I I , nigil LVW liall.. ft I +J FRIDAY, MuARcCH 3, 2006 J3A L1IRUs COUNTYJ I(1L) LCHRONIC~LE~ S5-Yr. Nane NAV Chg %Rtn AIM Investments A: Agpvp 11.86 +.01 +9.0 MVaAp3556 -.04 +232 CfetAp 13.96 ... +9.0 Cons p 26.05 +.02 +2.0 HYdAp 4.4t ... +2t.6 IntlGOm 2538 +.04 +50.6 MuBp 8.07 -.02 +26.9 PremnEqty 10.81 -.01 -9.1 SeEqtyr 19.44 -.03 +1.5 WeirgAp 1477 ... -8.4 AIM Investments B: CapDvBt 17.58 -.01 +36.9 PremnEqty 994 -.01 -125 AIM Investor Cl: Energy 42,64 +.62+116.4 SmCoGlp14.64 -.01 +11.3 SummitPp12.53 +.01 +3.3 Ufiies 14.52 ... -32 Advance Capital I: Balancpn18.32 -.02 32.0 Retllncn 9.76 -.02 +362 Alger Funds B: SmCapGrt 5.58 +.01 +22,9 AlllanceBem A: BalanAp 16.94 -.04 +28.5 GbTchAp62.74 +.14 -19.6 SmCpGrA 27.34 -.09 +34.5 AIllanceBemrn Adv: S L Gd 22.02 +.06 -9.1 S AllceBern B: Cq Bd p 11.84 -.02 +25.3 GlbTchBt 56.38 +.12 -22.7 GPowhB 126.87 +.06 +7.2 SpGrBt 2291 -.08 +29.2 USGovtBp 6.85 -.02 +15.8 AtanceBern C: GrCt 2297 -.08 +29.4 AIanz Funds C: GV hCt 19.65 +.02 -13.4 TiotCt 18.14 -.05 +3.1 Amer Century Adv: EqGropn 24.17 +.01 +23.1 Aer Century Inv: lanc 6.42 -.01 +26.0 Eqlncn 8.07 -.02 +55.9 FlIuBnrdnlO.65 -.02 +23.3 Grwsthln 21.20 -.02 +3.5 Hit&egln15.65 -.03 +22.8 lInron 3120 -.07 +232 InoDiscrn 15.69 -.03 +79.0 InlGroln 10.81 -.02 +153 UfBSdn 5.53 -.01 +11.7 NowOpprn658 +.02 +11.0 OneChAg n11.97 -.01 NS RalEstlln 27.85 -.14+169.4 Select] n 37.93 -.14 -6.7 Ultan 30.13 -.04 +4.3 Utpn 13.98 ... +9.5 Vuielnvn 7.12 -.03 +52.7 Anmerican Funds A: ABicpAp 19.64 -.02 +24.6 iulp 27.09 -.06 +36.3 IAp 18.09 -.03 +39.0 dAp 13.18 -.02 +33.9 C4pWAp 18.77 +.02 +52.4 CapBAp 54.87 -.07 +62.1 CpWGAp 38.25 -.05 +742 EUpacAp 43.49 +.01 +61.5 FdnvAt p 3746 +.10 +37.4 GMthAp 32.03 +.10 +29.0 HTAp 1227 -.01 +47.0 InuAp 18.70 -03 +49.5 IV p 13.37 -.01 +19.6 CAAop 32.52 -.01 +282 NEoAp 24.34 -.02 +16.9 NPerAp 29.82 +.03 +432 NMWridA 43.03 +.02+110.5 SDrCpAp 38.54 +.09 +59.1 TxExAp 12.44 -.0 3 +2.5 WsiAp 32.03 -.07 +27.4 American Funds B: dBBt 18.05 -.03 +33.9 CapBBt 54.87 -.07 +65.8 G tlnhBt 31.05 +.10 +24.3 Irt 18.60 -.03 +43.8 IC t 32.35 -.02 +23.3 WftBt 31.82 -.07 +22.6 Ar I Mutual Fds: Apec 47.69 -.14 +562 A 53.11 -.07 +75.5 Artsan Funds: S27.14 -.01 +38.4 w9Cvp 32.90 +.01 +302 MiapVal 19.36 -.01 NS Baron Funds: A*Set 58.39 -.09 +41.3 Growth 4854 -.03 +88.5 StFCap 24.78 -.04 +87.4 Betnstein Fds: Intur 13.10 -.03 +262 DiMu 13.97 -.03 +20.4 TMgintV 25.80 -.04 +63.8 Ilntal2 25.67 -.04 +62.9 BlickRock A: AuoraA 36.032 -.08 +642 cHinvA 7.92 ... +48.9 Leacy 14.88 +.01 +5.4 Br well Funds: Gipthp 19.87 -.01 -3.4 Brandywine Fds: Brdywnn3 3.49 +.0 3 +23.8 Brinson Funds Y: hi,,&i ,', :" : ,n: CGM Funds: : . C-SO..- ,. +29 +263.6 Focus n 3729 +.75+229.5 Mutin 29.03 +.10 +47.0 dasamos Funds: MGrr:3 3, .- +.03 +54.6 C.ti At, 9F.1 +.14 +59.6 growth t 55.64 +.12 +53.8 alvert Group: Hip 16.66 -.032 39.3 InlEqAp 22.39 -.06 +29.5 teCAi 1026 ... +152 WIlnt 10.70 -.02 +22.1 iUntalAp 29.17 -.04 +15.0 SocBodp 15.72 -.03 +35.6 SocEqAp 36.39 -.09 +212 TpFFU 10.57 -.01 +12.3 TxFLgp 16.58 -.04 +28.1 TOFVT 15.66 -.03 +23.6 Causeway Intl: lsitur rn17.70 +.06 NS Clipper 88.98 -.15+30.1 Cbhen & Steers: jtyhrs 79.59 -22+162.6 ClIumbia Class A: Acot 29.66 -.06 +942 Columbia Class Z: AcomZ 30.32 -.06 +98.6 AcomlntZ 37.15 +.16 +78.0 ReEsEqZ 26.57 -.05+127.3 DWS AARP Funds: CapGrr 48.48 +.09 -4.5 CoS 12.16 +.04 +22.5 NMA 14.73 -.04 +24.3 diTheme 33.0 ... +51.4 rolnc 22.48 ... +10.3 qrnwAlo 14.12 +.02 +14.7 If- 54.16 -.01 +25.8 hTrmBd 9.91 ... +16.6 SmCpCorer24.64 -.03 +688.7 DWS Scudder Cl A: CommAp 20.57 ... -16.8 DrHiRA 46.78 -.04 +33.0 DWS Scudder CI S: CorPIslnc 12.63 -.03 +26.3 EmMkin 12.06 ...+1122 EmMkGrr 24.37 +.09+158.0 roEq 33.02 +.08 +24.3 FIBdnr 9.51 +.01 +34.6 q Bopp 4220 -.05 +56.4 qThem 33.54 ... +61.8 Gotl&Prc 21.89 +.57+3412 GiolncS 22.45 +.01 +10.1 HiYbITx 12.87 -.02 +34.7 IntfxAMT 11.18 -.02 +22.9 IntOFdS 54.18 -.02 +26.7 LgCoGro 26.02 +.05 -7.5 LkArnrEq 55.91 -.05+193.6 MgdMuniS 9.15 -.02 +28.8 MATFS 14.33 -.04 +28.6 PacOppsr17.70 +.03 +91.3 SthrTmBdS 9S2 ... +16,8 Davis Funds A: NYVenA 34.49 ... +30.7 Davis Funds B: NYVenB 33.04 ... +25.6 Davis Funds C &Y: NYVenY 34.88 ... +32.8 NYVen C 33.25 ... +25.7 Delaware Invest A: TrendAp 24.58 -.06 +41.5 i USAp 11.54 -.02 +31.7 Delaware Invest B: DelchB 329 ... +322 Dineneslonal Fds: InltlniVan 19.16 +.02+190.4 USLgVan 22.84 -.06 +54.5 US Micro nl6.34 -.02+123.6 Us Small n21.46 -.06 +87.1 US SmVa 29.07 -.12+141.4 lrldl nCo n17.40 ..+145.4 EmgMkt n 23.15 +.08+152.4 IilVan 19.55 -.06 +93.1 "+I'USSV 25.59 -.09+104.0 pFARIEn 27.52 -.08+162.6 Dodge&Cox: Balanced 83276 -.11 +59.8 Income. 12.56 -.02 +32.9 IrilStk 37.21 +.11 NS Stock 143.17 -.22 +69.7 Dreyfus: u 4020 -.09 +4.4 sp 3524 -.01 +6.1 uryf 10.65 -.01 +9.6 40Int 37.64 -.06 +10.9 EmgLd 4520 +.10 +46.0 FLIntr 13.03 -.03 +21.4 IisMutn 17.87 -.05 +24.6 SrValAr 29.93 -.03 +40.8 Dreyfus Founders: GrowthBn1051 -.02 -8.4 GratFpn11.46 -.03 -4.3 DreyAus Premier: t 1reEqA4.96 -.04 -2.1 dorVip 32.58 -.03 +14.0 LIdHYdAp 727 ... +24.7 Ty TchGroA 25.66 +.06 -142 Eqton Vance Cl A: ChinaAp 17.34 +.13 +57.1 GrwthA 829 +.05 +273 InBosA 6.40 ... 441.9 =EqlA 12.47 +.02 -53 nBdl 10.83 -.03 +38.7 TradGvA 7.25 -,01 +19.8 EAtonVanceCIlB: FLMBt 10.99 -.02 +273 HlhSBt 12.20 -.03 +12.8 NatlMBt 11.50 -.03 +42.2 Eaton Vance Cl C: GovtCp 725 ... +15.5 NatMCt 1151 -.02 +40.8 Evergreen A: AlAlsA p 14.54 -.03 +60.1 Evergreen B: DvBdBt 1450 -.03 NS MuBdBt 7.48 -.02 +23.8 Evergreen C: AstAICI 14.13 -.03 NS Evergreen I: CoiBdl 10.38 -.02 +29.7 SIMunil 9.92 -.02 +18.8 Excelsior Funds: Energy 2521 +37+108.8 HidelIp 452 ... +24.1 ValResI 49.03 +.03 +54.6 FPA Funds: Nwinc 10.87 ... +26.7 Federated A: AmLdrA 24.10 -.06 +13.5 MidGrStA 37.13 -.01 +29.1 MuSecA 10.66 -.03 +27.1 Federated B: StilncB 8.70 -.01 443.4 Federated Instl: Kaulmn 6.07 +.04 +69.6 Fidelity Adv FocT: HItCarT 24.06 -.06 +15.4 NalResT 44.93 +,0+103.7 Fidelity Advisor A: DiMntAr 22.31 -.04 +76.1 Fidelity Advisor I: DMCntin 22.61 -.03 +78.9 EqGd n 5239 +.06 -4.3 Eqinln 29.66 -.02 +34.4 IntBdln 10.77 -.02 +28.4 Fidelity Advisor T: BalancT 16.48 +.02 +23.1 DMnfrp 22.10 -.04 +73.6 DivGrTp 12.49 -.01 +8.3 DynCATp 17.41 +.03 +21.7 EqGrTp 49.53 +.06 -7.0 EqlnT 2928 -.02 +30.9 GoavnT 9.87 -.02 +243 GOppT 33.37 +.0 8 +10.5 HinAdTp 10.08 -.01 +56.9 InltdT 10.75 -.02 +26.7 MdCpTp 2526 -.02 +462 MulncTp 12.93 -.03 +30.6 OvrseaT 20.82 -.03 +33.8 STT 9.37 ... +193 Fidelity Freedom: FF2010n 14.39 ... +25.5 FF2020n 1522 ... +26.2 FF2030n 15.63 +.01 +25.1 FF2040n 921 ... +23.9 Fidelity Invest: AggrGrrn 18.81 +.04 -35.4 AMgrn 16.40 -.02 +19.4 AMgrGrn 15.52 -.01 +15.5 AMgrInn 13.10 -.01 +33.5 Balancn 19.52 +.02 +529 BlueChGr n44.03 -.05 -25 CA Munn 12.41 -.03 +2859 Canadan 46.92 +.63+150.5 CapApyn 26.92 +.02 443.8 Cphnrn 8.50 ... +48.8 ChinRgn20.60 +.17 +56.6 CngSn 413.11 -.68 +11.1 CTMunrn11.37 -.03 +26.6 Coan 66.09 +.17 +54.1 CnvScn 23.92 +.13-+30.7 DeGsin 14.71 +.04 +7.7 Destlln 12.54 +.01 +16.7 DisEqn 28.83 6 0+23.8 Dinlntn 34.71 +.09 +78.0 DlGthn 29.84 -.03 +112 EmrMkn 21.01 +.14+166.0 i:lncn 54.93 -.10 +273 -.I n 23.71 -.06 +29.3 tCapAp 24.42 +.10 +61.2 Europe 39.18 +.12 +62.3 Exchn 289.45 -31 +21.3 Exportn 21.89 +.09 +513 Fiddl n 32.97 +.06 +13.7 Fifty rn 23.88 +.05 +.0 37.6 FLMurn 11.43 -.03 +28.3 FrnOnen 27.37 -.04 +27.5 GNMAn 10.77 -.03 +25.4 Govtlncn 10.04 -.02 +26.0 GroCon 67.63 +.09 +16.5 Grolncn 3524 +.07 +92 GmIlnclln 10.59 ... +17.1 Highlncrn 8.8 ... +30.9 Indepnn 20.83 +.02 +15.8 IntBdn 1021 -.02 +27.5 IntGovn 9.96 -.01 +23.4 IntDisc n 33.54 -.04 +72.6 IntSCprn 29.01 ... NS InvGBn 7.33 -.01 +30.6 Japan n 17.62 -.40 +51.5 JpnSmrn 15.10 -.40+115.5 LatAmn 38.90 +.06+215.5 LevCoStkn28.05 +.15+1992 LowPrtn 43.62 ...+1232 Magelnn11l21 +.03 +82 MD Murn 10.83 -.03 +26.0 MAMunn 11.88 -.03 +29.7 MIMunn 11.82 -.03 +28.6 MidCapn 29.37 +.08 +25.5 MNMunn 11.41 -.02 +26.4 MtgSecn 11.01 -.0 3 +28.2 Munilncn 12.80 -.04 +32.2 NJMunrnll.48 -.03 +28.6 NwMikrn 14.98 ... +98.1 NwMilln 38.14 +.18 +34.2 NYMuon 12.83 -.04 -,+ O T7Cr., 39.43 +.03 -'6 0'i11+ur, 11.64 -.03 -:4 I Ovrsean 43.39 +.09 -i..; PcBasn 26.31 -.17 +72.1 PAMunrn10.79 -.02 +27.8 Puritnn 1925 -.03 +31.4 RealEn 33.92 -.12+162.3 StInlMun, 10.18 -.01 +17.7 MSTFn 8.83 -.01 +21.6 SmCapIndsn22.080+.05 +70.9 SmllCpSrn2O.08 -.01 +82.9 SEAslan 22.93 +.06+111.3 StkIcn 25.92 +.02 +19.1 Sratlicn 10.49 ... +51.9 Trend n 59.52 +.01 +18.8 USBIn 10.82 -.02 +30.5 Utiltyn 1535 -.01 +8.8 ValSaItn 32.92 -.03 +59.8 Value n 80.40 +.01 +89.2 Wddwln 2023 +.01 +45.2 Fidelity Selects: Airn 43.62 +.01 +36.1 Auton n 34.33 -.39 +64.8 Bankng n 36.70 -21 440.7 Blotchn 68.62 +.12 -2.7 Brokrn 76.61 +.12 +77.9' Chem0 n 7025 -.07 +86.6 Cormpn 38.39 +.07 -7.0 Conlndn 25.81 -.09 +16.6 CstHon 49.66 -.20+130.6 DIAeron 79.96 +.41 +99.8 DvCmn 22.44 +20 -5.7 Electrn 47.88 -.02 -4.8 Enrgyn 51.08 +.90+109.7 EngSvn 71.27 +1.63 +77.7 Envirn 17.43 +.03 +33.4 FInSvn 12029 -32 +40.9 Foodn 52.17 -.16 +38.1 Goldrn 37.20 +.86+282.3 Heal n 139.68 -31 +18.7 HomFn 51.95 -33 +50.0 IndMtn 47.41 +A41 +120.8 Insurn 68.70 -.15 +59.0 Leisrn 80.91 -.18 +36.7 MedDln 55.40 -.17+127.6 MdEqSysn24.80 +.01 +69.9 MlERmdn 47.68 -.01 +29.4 NtGasn 40.42 +.75 +952. Papern 30.78 -.01 +24.0 Pharmn 10.52 +.02 NS Real n 50.93 -.33 433.1 Soflwrn 54.68 +.25 +28.9 Techn 66.66 +.12 -1.6 Telcmn 43.14 -+.32 -2.5 Transn 50.91 -.11 +833 UIflGrn 46.85 +.27 +3.6 Wirelessn 7.32 +.03 +1.7. Fidelity Spartan: Eqldxlnn45.76 -.08 +13.0 50lnxlInvrn89.15 -.14 +13.0 GouInrn 10381 -.02 +27.6 InvGr~dn 1034 -.02 +31.7 Fidelity Spart Adv: EqdoAdn 45.77 -.07 NS SOOAdrn 89.15 -.14 NS First Eagle: GIbrA 4422 +.13+128.9 OverseasA24.55 +.09+143.6 First Investors A BIChpAp 21.69 -.02 -8.1 GloblAp 7.46 -.01 +17.6 GovtAp 10.77 -.03 +22.0 GrolnAp 14.64 -.04 +11.6 IncoAp 3.01 ... +31.8 InvGrAp 9.53 -.02 +26.7 MATFAp 11.82 -.03 +25.1 MnFFAp 1234 -.03 +24.3 MidCpAp 2932 -.06 +34.6 NJTFAp 12.92 -.03 +24.0 NYTFAp 14.38 -.03 +23. PATFAp 12.92 -.03 +25.2 SpSitAp 22.09 -.11 +20.1 TxExAp 9297 -.02 +23.1 ToItRAp 1454 -.03 +14.5 ValueBp 7.05 -.01 +5.8 FIrsthand Funds: GIbTech 426 ... -38.1 TechVal 3723 -.11 -28.6 FranktTemp Frnk A: AGEAp 2.10 -.01 +473 AdjUSp 8090 -.01 +14.8 ALTFAp 1147 -.02 +30.1 AZTFAp 11.06 -.03 +29.2 Ballnvp 65.51 -.13+1002 CallnsAp 12.69 -.03 +29.2 CAIntAp 11.50 -.03 +23.5 CaITFAp 728 -.01 +29.7 CapGrA 11.54 -.01 -5.8 COTFAp 12.00 -.03 +29,8 CTrFAp 11.07 -.03 +430.5 CvtScAp 16.84 ... +483 DblTFA 11.95 -.02 +29.8 DynTchA 27.02 -.04 +25.0 EqlncAp 21.02 -.03 +23.8 Fedlrtp 1139 -.03 +26.6 FedTFAp 12.07 -.03 +29.7 FLTFAp 11.90 -.02 +30.6 FoundAlp 12.98 -.01 NS GATFAp 12.10 -.03 +29.1 GoldPrM A 28.94 +.86+227.8 GrwthAp 37,68 -.07 +13.3 HYTFAp 10.81 -.02 +35.3 IncomAp 2.46 ... +51.4 InsTFAp 1229 -.02 +28.9 NYITFp 1090 -.02 +242 LATFAp 11.50 -.02 +29.0 LMGvScA 9.86 -.01 +16.8 MDTFAp 11.74 -.03 +29.5 MATFAp 11.88 -.03 +28.5 MIfFAp 12.25 -.02 +28.4 MNInsA 12.10 -.03 +26.9 MOTFAp 12.28 -.03 +31.0 I OWToREDTHSMTULFUD ABE Here are the 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 ollows. Thes: 4-wk total return 1%) Wed: 12-mo iolal return (%) Thu: 3-yr cumulative oltal return (%) Fri: 5-yr cumulative total return (%) Name: Name of mutual fund and family. NAV: Nei asset value. Chg: Net change in price of NAV Total return: Percent change In NAV for the lime period shown, with dividends reinvested. If penod longer than 1 year, return is cumula- tive Data based on NAVs reported to Lipper by 6 p.m Eastern. Footnotes: e Ex-capital gains distribution. t Previous day's quote n No-load fund. p Fund assets used to pay distribution costs r - Redemption fee or contingent deterred sales load may apply s - Stock dividend or split Both p and r x Ex-cash dividend. NA - No Information available. NE Data In question NN Fund does not wish to be tracked. NS Fund did not exist at start date. Source: LipDer, Inc. and The Associated Press NJTFAp 12.12 -.03 +2959 NYlnsAp 11.59 -.02 +28.1 NYTFAp 11.82 -.01 +28.9 NCTFAp 1228 -.03 +30.7 OhiolAp 12.56 -.03 +28.8 ORTFAp 11.86 -.03 +302 PATFAp 10.41 -.03 +29.4 ReEScAp2721 -.12+136.1 RisDvAp 34.25 -.12 460.6 SMCpGrA 40.31 -.04 +213 USGovAp 6.44 -.01 +24.71 UflxsAp 12.14 -.02 +45.9 VATFAp 11.82 -.02 +293 Frank/Temp Frnk B: IncomBl p 2.46 ... +47.7 IncomeBt 2.45 ... NS Frank/Temp Frnk C: IncormCt, 2.47 -.01 +47.4 Franldk/Temp Mtl A&B: DiscA 27.71 +.02 +702 OualldAt 20.56 +.01 +56.0 FharesA 24.66 -.03 +44.8 Frank/Temp Temp A: DvfMktAp 26.18 +.11+155.1 ForgnAp 13.24 +.01 +51.0 GIBdAp 10.67 +.03 +73.8 GrwthAp 23.85 -.02 +58.5 IntxEMp 16.87 +.01 +43.7 WorldAp 18.50 -.03 +49.1 Frank/Temp Tmp Adv: GrthAv 23.87 -.02 +60.5 Frank/Temp Tmp B&C: DevMktC 25.68 +.11+147.2 FurgnCp 13.07 +.02 +45.4 GE Elfun S&S: S&SPM 44.68 -.06 +10.8 GMO Trust III: .EmMkr 22.80 +.04+240.9 For 16.82 -.05 +80.4 IntlGrEq 30.06 -.02 NE IntlnlrI 32.66 -.07 +94.0 USCoreEq 14.57 -.05 NS GMO Trust IV: EmrMkt 22.83 +.04+241.4 Int[InrVI 32.65 -.07 +94.6 Gabelll Funds: Asset 43.32 +.01 +41.1 Gartmore Fds D: Bond 9.54 -.02 +33.7 GvtBdD 10.12 -.02 +26.9 GrowthD 7.36 -.02 +1.5 NatonwD 19.50 -.03 +22.1 TxFrr 10.51 -.02 +27.1 Gateway Funds: Gateway 25.54 -.05 +18.8 Goldman Sachs A: GdncA 26.91 -.04 +35.4 MdCVAp 36.58 ... +93.9 SmCapA 43.92 -.17+97.9 Guardian Funds: GBG InGrA 16.17 -.02 +26.5 PaNA A 33.67 -.05 -0.4 Harbor Funds: Bond 11.64 -.03 +35.1 CapAplnst 33.38 -.02 +5.7 Indtr 54.14 -.05 +85.3 Hartford Fds A:. AdwsAp 16.17 -.04 +11.9 CpAppAp37.69 +.10 +45.4 DivGthAp 19.63 ... +28.4 SmICouAp 22.04 -.02 +59.1 Hartford HLS IA: CapApp 56.11 +.15 +53.9 Dv&Gr 21.52 ... +31.5 Advisers 22.98 -.05 +12.8 Stock 50.84 -.11 +4.3 Hartford HLS IB: CapAppp 55.83 +.14 +52.0 Hennessy Funds: CorGrow 21.67 +.11+123.8 CorGroll 32.80 +29+110.2 HolBalFd n15.63 +.01 +7.0 Holcnkis & Wiley: l.-4i.m1, 2.8'7 -.06 NS T.rlc0n.y 0'.A -.02+123.8 ISI Funds: NoAmp 7.41 -.03 +30.8 JPMorgan A Class: MCpValp 24.33 -.06 NS JPMorgan Select: IntEqn 34.55 -.07 +47.8 JPMorgan Setl CIs: InlrdAmern25.45 +.03 NS Janus: Balanced 23.25 '+.01 +25.4 Conradian 1628 +.04 +54.5 CoreEq 25.20 +.10 +31.9 Enterpr 45.12 +.17 +2.7 FedTEn 6.99 -.01 +22.5 FIxBndn 9.40 -.02 +28.9 Fund 26.69 +.03 -102 GIUfeScirn2l.52 +.04 +192 GITechr 12.79 +.03 -20.1 Gdnc 38.41 +20 +20.5 Mercury 23.70 +.04 -5.0 MdCpVal 23.19 -.04 +842 Olympus 33.83 +.04 0.0 Orion 9.08 +.05 +50.0 Ovseasr 36.21 +.16 +58.7 ShTmBd 2.87 ... +17.3 Twenty 50.08 +21 +13.5 Ventur 64.29 +.42 +52.5 WWrInW 44.57 +.01 -8.9 JennlsonDryden A: BlendA 18.76 +.05 +25.9 HiYldAp 5.69 -.01 +32.2 InsuredA 10.79 -.02 +24.4 UI.tyA 15.13 +.04 +48.9 JennisonDryden B: GrowthB 15.19 -.01 -0.5 HIYldBt 5.68 -.01 +28.9 InsuredB 10.80 -.03 +22.8 John Hancock A: BonAAp 14.84 -.03 +293 ClassicVlp 25.54 -.16 +75.0 StlnAp 6.88 ... +44.1 John Hancock B: StrlncB 6.88 ... +392 Julius Baer Funds: IntEqlr 39.90 -.15 +87.1 lInlEqA 39.16 -.15 +83.4 Legg Mason: Fd OpporTrt 17.60 -.01 +74.1 Splnvp 46.07 -.22 +86.9 lVafrp 68.54 -.03 +25.9 Legg Mason Instll: Vairrlnst 75.58 -.04 +32.4 Longleaf Partners: Partners 32.49 -.02 +53.8 Intl 17.96 -.04 +53.4 SmCap 28.09 +.08 +79.9 Loomis Sayles: LSBondl 14.05 +.01 +75.2 Lord Abbett A: AfiAp 14.79 -.01 +26.9 BdDebAp 7.88 -.01 +33.6 GllncAp 6.80 +.01 +34.6 MidCpAp 2232 +.07 +672 MFS Funds A: MITA 19.18 -.01 +6.0 MIGA 13.30 -.01 -10,8 GrOpA 9.24 -.01 -9.3 llnA 3.83 -.01 +33.1 MFLA 10.13 -.02 +29.7 TotRA 15.65 -.02 +29.5 ValueA 24.17 -.03 +32.0 MFS Funds B: MIGB 12.14 -.01 -13.6 GvScB 9.42 -.02 +18.8 HIAnB 3.84 -.01 +28.7 MulnB 8.59 -.02 +243 TotRB 15.65 -.02 +25.8 MainStay Funds B: CapApBt 29.90 +.06 -17.2 CorvBt 14.21 +.06 +22.6 GovtBt 8.16 -.02 +16.9 HYIdBBt 6.23 -.01 +48,6 InEqB 13.64 +.01 +48.0 SmrGBp 15.93 -.01 +12.7 Mairs & Power: Managers Funds: SpclEqn 92.65 -.51 +39.5 Marsmbo Funds: Focusp 1.85 -.03 +27.9 Merrll Lynch A: HealthAp 7.00 ... +26.4 Merrill Lynch B: BalCapBt 25.57 -.02 +13.5 BaVIBt 31.67 ... +21.4 BdHiInc 5.12 ... +35.6 CalnsMB 11.57 -.02 +24.8 CroBPtt 11.49 -.03 +233 CpITBI 11.66 -.03 +24.5 EquotyDiv 16.62 +.03 +43"9 EuroBt 17.08 -.13 +42.5 FocValt 13.11 -.01 +30.9 FndlGB1 17.59 ... -9.9 FLMBt 10.40 -.02 +29.8 GIAiBt 17.33 +.01 +67.5 Hea IBt 5.16 ... +213 LatABt 43.37 +.09+2122 MnlnBt 7.86 -.02 +26.1 ShTUSGt 9.07- ... +13.9 MuShIT 9.92 ... +10.0 MulntBt 10.23 -.02 +22.0 MNtBI 10.51 -.02 +29.5 NJMBI 10.71 -.03 +27.3 NYMBi 11.01 -.03 +24.1 NatRsTBI 50.22 +.97+139.5 PacBt 23.98 -.11 +54.5 PAMBt 11.31 -.02 +27.7 ValueOppt 24.78 -.03 +73.8 USGovt 9.99 -.02 +19.6 Utltcmt 12.59 +.02 +23.5 WIdInBt 6.22 -.01 +47.9 Merrill Lynch C: GIAICt 16.80 +.01 +57.7 MerrIll Lynch I: BalCapl 26.38 -.02 +19.6 BaVil 32.41 ... +27.7 BdHiinc 5.11 ... +40.7 CalnsMB 11.57 -.02 +28.0 CrBPlIt 11.49 -.03 +28.1 Cpml 11.66 -.03 +27.7 DvCapp 25.95 +.05+149.3 Equoy)v 16.59 +.03 +51.4 Eurolt 19.94 -.14 +50.1 FccValt 14.50 -.01 +379 FLMI 10.40 -.03 +33.1 G0Alt 17.75 +.01 66.0 Healthl 7.63 ... +27.8 LatAI 45.44 +.09+228.9 Mnlnl 7.86 -.02 430.7 MnShtT 9.92 ... +12.0 MulTI, 10.23 -.02 +23.8 MNalll 10.52 -.02 +34.6 NatRsTrt 53.48 +1.04+152.1 Pad 26.14 -.11 +62.7 ValueOpp 27.78 -.0 3 +83.0 USGovt 9.99 -.02 +24.3 UtLcRmlt 12.63 +.02 +28.4 WIdlncI 6.22 -.01 +563.7 Midas Funds: MdasFd 3.57 +.10+310.3 Monetta Funds: Moneltan 12.77 +.04 +19.2 Morgan Stanley A: DiGthA 33.76 -.03 +12,8 Morgan Stanley B: GIbDvB 15.10 -.02 +33.0 GrwthB 13.94 -.02 +2.3 StrM B 19.67 +.01 +21.6 MorganStanley Inst: GIValEqAn18.47 -.01 +25.4 IntiEqn 21.38 +.02 +61.4 Muhlenk 85.93 -.05+77.8 Munder Funds A: IntemtA 21.08 +.02 -182 Mutual Series: BeacnZ 16.18 -.01 +50.7 DiscZ 27.97 +.01 +73.2 QualfdZ 20.67 ... +58.7 SharesZ 24.82 -.03 +47.4 Neuberger&Berm Inv: Focus 35.18 +.14 +15.3 Inllr 23.69 +.13 +97.9 Partner 29.44 +.10 447.0 Neuberger&Berm Tr: Genesis 50.72 +.09 +99.8 ,Nicholas Applegate: EmgGroIn13.27 -.03 +25.4 Nicholas Group: Hilnc In 2.14 ... +25.0 Nichn 60.87 -.02 +17.8 Northern Funds: SmCpldxn11.57 -.04 +59.7 Technlyn 1228 +.02 -20.7 Nuveen CI R: InMunR 10.82 -.03 +27.9 Oak Assoc Fds: WhitOkSGn32.98 +.02 -31.7 Oakmark Funds I: EqtyInorn25.27 +.08 +63.6 Globalln 24.59 +.07+125.8 Intlirn 24.22 +.13 +732 Oakmarkrn41.87 -.10 +299 Selectrn 33.35 -.14 +47.9 Old Mutual Adv II: Tc&ComZn13.18 ... -47.8 Oppenheimer A: IAMTFMu 10.15 -.02 vhi AMTFrNY 13.06 -.05 .1 " CAMunlAp11.51 -.03' 4J.,9 CapApAp 44.86 +.05. +2.0 CapIncApl1.96 -.02 +24.7 ChlncAp 9.40 -.01 +30. DvMktAp 40.46 +.05+199.3 Discp 48.14 +.02 +23.5 EquiyA 10.97 ... +20.9 GlobAp 70.45 +.05 +48.0 GIbOppA 41.48 +.09 +76.9 Goldp 27.33 +.79+284.8 HiYdAp 9.42 -.01 +29.0 IntBdAp 6.02 ... +93.1 LtdTmMu 15.79 -.02 +38.0 MnStFdA 38.75 -.03 +17.3 MidCapA 19.55 -.05 +2.7 PAMuniAp 12.82 -.02 +52.1 StrInAp 426 ... +49.4 USGvp 9.44 -.02 +26.6 Oppenheimer B: AMTFMu 10.11 -.03 +34.1 AMTFrNY 13.07 -.04 +30.7 CplncBt 11.82 -.03 +19.7 ChIncBt 9.39 -.01 +26.1 EquityB 10.51 -.01 +15.6 HiYldBt 927 -.01 +24.1 StrincB.t 427 -.01 +43.5 Oppenhelm Quest: QBalA 17.98 -.04 +18.0 Oppenheimer Roch: RoMuAp 18.44 -.05 +40.5 PIMCO Admin PIMS: TotRtAd 10.43 -.03 +33.1 PIMCO Instl PIMS: AlAsset 12.85 -.02 NS ComodRR 1426 +.19 NS HiYWd 9.81 -.02 +43.5 LowDu 9.94 -.01 +22.2 RealRIln 11.04 -.01 +47.8 TotRt 10.43 -.03 +34.8 PIMCO Funds A: RealRtAp 11.04 -.01 +44.6 TolRtA 10.43 -.03 +31.7 PIMCO Funds D: TRtnp 10.43 -.03 +32.6 PhoenlxFunds A: BalanA 14.98 -.03 +20.7 CapGrA 15.77-.06-16.7 InsIA 12.06 +.05 +27.3 Pioneer Funds A: BalanAp 10.09 -.01 +11.3 BondAp 9.10 -.02 +33.7 EqlncAp 30.10 -.06 +29.0 EurSelEqA34.84 -.08 +72.9 GrwthAp 12.80 -.05 -182 InriValA 21.46 -.06 +31.4 MdCpGrA 15.85 -.02 +12.9 MdCVAp 24.18 +.01 +70.9 PionFdAp46.02 -.03 +13.6 TxFreAp 11.62 -.02 +27.9 ValueAp 18.01 +.02 +23.1 Pioneer Funds B: HiYIdB 11.04 ... +53.1 MdCpVB 21.12 +.01 +63.6 Pioneer Funds C: HiYIdCt 11.14 ... +53.0 Price Funds: Balance n 20.25 -.04 +29.6 BlChipn 33.72 -.01 +11.3 CABondn 11.00 -.03 +27.2 CapAppn 20.77 ... +70.8 DivGron 23.61 -.04 +21.5 Eqlncn 27.01 -.04 +37.9 Eqlndexn 34.75 -.05 +12.1 Europen 18.63 +.01 +329 FUntmn 10.75 -.03 +21.4 GNMAn 9.41 -.01 +25.9 Growth n 29.50 +.02 +20.1 Gr&lnn 21.31 -.03 +14.0 HBhScin 27.05 -.02 +49.0 Hiieldn 6.95 ... +45.4 ForEqn 18.34 -.09 +303 IntlBondn 9.38- +.03 +442 IntDisn 44.36 .... +82.4 IntIkn 15.57 -.07 +27.9 Japann 11.28 -26 +442 L.atAmn 30.94 -.12+223.4 MDShrtn 5.12 .. +12.6 MDBondn10.67 -02 +280 MidCapn 57.28 +.13 +61.4 MCapValn24.44 -.03 +9527 NAmnern 32.86 -.01 +82 NAslan 12.70 +.04+104.6 NewEran44.15 +53+1139 N Horizn 34.62 +.04 +04. Nnocn 8.90 -.02 +28.9 NYBondn 11.32 -.03 +27.9 PSIncn 15.41 -.02 +37.5 RealEstn 21.40 -.085+169.1 SaTecn 20.48 +.03 -25,3 ShIBd n 4.67 ... +20.3 SmCpStkn35.52 +.02 +76,6 SmCapVal n4053 +.11+136.0 SpecGrn 19.17 -.02 +33.6 Speclnn 11.87 -.01 +39.7 TFincn 10.00 -.02 +28,9 TxFrHn 11.97 -.02 +34.7 TFintmn 11.10 -.02 +22.9 TxFrSIn 5.33 -.01 +1659 USTintn 525 -.01 +222 USTLgn 11.64 -.07 +32.1 VABondn 11.63 -.03 +28.8 Value n 2433 -.04 +35.4 Putnam Funds A: AmGvAp 8.85 -.01 +19.5 AZTE 920 -.02 +26.4 CiscEqAp13.74 -.01 +13.0 Convp 1823 +.01 +41.0 DiscGr 1954 +.02 -4.4 DvrinAp 9,90 -.02 44329 EuEq 24.53 -.08 +26.1 FLTxA 9.16 -.01 +26.2 GeoAp "1825 -.03 +24.5 GIGvAp 12.05 ... +39.2 GIbEqIyp 9.65 -.01 +172 GdnAp 20.38 -.04 +17.2 HIlhAp 63.76 +.01 4+.4 HiYdAp 7.98 -.01 +44.7 HYAdAp 6.01 -.01 +44.1 InAoAp 6.72 -.01 +27.4 IntldEqp 27.74 -.13 +29.0 IntGrlnp 1428 -.07 +47.5 InvAp 14.08 -.01 +7.4 MITx p 8.99 -.01 +24.8 MNTxp 8.99 -.01 +26.2 NJTxAp 9.20 -.02 +25.2 NwOpAp 4824 +.05 -2.7 OTCAp 8.54 +.02 -13.0 PATE 9.10 -.02 +28.5 TxExAp 8.77 -.02 +2.2 TFInAp. 14.87 -04 +25.9 TFHYA 12.97 -.02 +28.0 USGvAp 13.09 -.02 +22.1 UtIlAp 11.28 -.01 +7.2 VslaAp 11.41 +.02 +6.7 VoyAp 17,81 -.02 -8.4 Putnam Funds B: CapAprt 19.89 -.04 +12.2 ClscEqBt 13.61 -.02 +8.7 DiscGr 17.97 +.01 -8.0 DvrlnBt 9.82 -.02 +38.4 Eqlnct 1728 -.03 +29.6 EuEq 23.73 -.07 +21.5 FLTxBt 9.15 -.02 +22.0 GeoBt 18.09 -.02 +20.0 GllncBl 12.01 ... +34.1 GIbEqt 8.82 -.01 +13.0 GINtRst- 28.41 +32 +92:7 GrinBt 20.06 -.04 +129 HthBI 57.40 ... +4.4 HiYldBt 7.94 -.01 439.4 HYAdBt 5.93 -.01 +38.3 IncmBt 6,67 -.02 +22.5 IntGrInt 14.05 -.08 +42.0 InlNopt 13.52 -.04 +34.4 InvBt. 12.94 -.01 43.5 NJTxBt 9.19 -.02 +212 NwOpBt 4321 +.05 -6.3 NwValp 18.30 ... +35.5 NYTxBt 8.4 -.01 +21.9 OTCBt 7,53 +.02 -16.1 TxExBt 8.77 -.02 +22.1 TFHYBt 12.99 -.02 +24.4 TFInBt 14.89 -.04 +222 USGvBt 13.02 -.02 +17.6 ULIBt 1121 -.01 +32 VistaBt 9.93 +.02 +2.8 VoyBt 15.56 -.02 -11.8 RiverSource/AXP A: Discover 10.33 ... +53.5 DEI 12.75 ... +662 DivBd 4.78 ... +23.4 DvOppA 7.79 -.02 -3.4 GlbIEq 7.03 +.01 +212 Growth 29,92 +.03 -9.4 HIYdTEA 4.38 -.02 +24.8 Insr 5.35 -.02 +22.7 Mass 5.31 -.02 +232 Mich 5024 -.02 +25.5 Minn 527 -.01 +25.4 NwD 20.45 -.01 -1.8 NY 5.05 -.01 +25.2 Ohio 526 -.01 +22.5 SDGovt 4.72 -.01 +152 RiverSource/AXP B: EqValp 12.12 +.02 +23.7 Royce Funds: LwPrStkr 1721 +.12 +91.1 MicroCap 17.74 +.07+117.0 Premiedr 18.04 +10+113.9 TotRelIr 13.42 -.03 +89.8 Russell Funds S: DivEqS 46.85 -.04 +15.9 Ai anr.E.i ir; -.02 +16.0 Rydex Advilor: C.T, r, 106: -.01 -17.9 SEI Portfolios: CoreFxAn1027 -.02 +28.4 IndEqAn 13.07 -.03 +32.5 LgCGroAn20.32 -.01 -8.9 LgCValAn2223 -.0 3,33.6 STI Classic: CpAppAp 12.14 -.02' 4.7 CpAppCp11.41 -.02 -6.9 LCpVEqA 13.66 -.03 +29.2 QuGrStkC 12425 -.02 -.7 TxSnGrlp 25.96 -.02 -3.9 Salomon Brothers: BaanroBp 1325 +.01 +22.4 Oppor 53.01 -.02 +31.4 Schwab Funds: 10Ulnvr 37.56 -.04 +16.2 S&PInv 19.89 -.03 +11.9 S&PSel 19.95 -.04 +12.9 SmCplnv 24.90 -.09 +54.4 SYIdPLsS 9,66 ... +18.1 Selected Funds: AmShSp 41.10 +.02 +27.7 Sellgman Group: FrontrA 13.95 -.03 +21.4 FrontrDt 12.18 -.02 +16.8 GIbSmA 18.17 +.02 +41.9 GIbTchA 15.02 +.01 -1.6 HYdBAp 3.34 ... +2.7 Sentinel Group: ComSAp30.094 +.05 +20.7 Sequoia n155.88-1.17+44.0 Sit Funds: LrgCpGr 3829 +.10 -6.4 Smith Barney A: AgGrAp 113.54 +.01 +17,6 ApprAp 14.78 +.02 +17.5 FdValAp 15.27 -.01 +15.2 HilncAt 6.78 -.01 +25.3 InAICGAp 13.39 -.05 +8.9 LgCpGA p22.86 -.06 +7.5 Smith Barney B&P: FValBt 14.29 -.01 +10.7 LgCpGBt 21.47 -.05 43.6 SBCplnct 17.50 ... +32.1 Smith Barney 1: DvStl 16.94 -.02 -9.9 GrInc 116.35 +.1 +10.3 St FarmAsso:c Gwlh 51.95 -.09 +21.2 Stratton Funds: Dividend 36.92 -.15+123.2 Growth 46.41 +20 +0.5 SmCap 47.82 -.15+138.9 SunAmerica Funds: USGvBt 9.27 -.02 +23.2 SunAmerica Focus: FLgCpAp 18.92 -.01 +10.0 TCW Galileo Fds: SelEqty 19.80 -.06 +11.1 TIAA-CREF Funds: BdPlus 10.05 -.02 +30.2 Eqlndex 9.34 -.02 +19.2 Grolnc 13.49 ... +9.3 GroEq 9.92 -.01 -7.9 HiYldBd 9.15 ... +38.8 InflEq 13.00 -.03 +44.3 MgdAlc 11.75 -.02 +25.1 ShtTrBd 10.28 ... +23.2 SocChEq 10.09 -.02 +20.6 TxExBd 10.71 -.04 +29.6 Tamarack Funds: EntSmCp 31.48 +.02 +75.6 Value 39.81 -.15 +26.1 Templeton Instil: EmMSp 21.18 +.09+163.3 ForEqS 23.60 +.03 +58.5 Third Avenue Fds: Intgr 22.57 +.09 NS RIEstVIr 31.26 -.04+149.7 Value 57.40 +.06 +81.7 Thornburg Fds: IntValAp 25.17 +.02 +72.7 Thrivent Fds A: HiYOd 5.08 ... +253 Incorn 8.55 -.02 +25.4 LgCpSth 27.19 -.02 -0.2 TA IDEX A: JasGrowp256. +.02 -1.6 GCGIObp 26.96 -.06 -9,0 TrCHYBp 9.18 -.02 +3027 TAFlInp 9.38 -.02 +29.4 Turner Funds: SmlCpGrn28.58 +.02 +39,0 Tweedy Browne: GiobVal 28.05 -.12 +54.1 US Global Investors: AIAsnn 28.14 +.16 +11.9 GIbRs 16.09 +.27+356.1 GidShr 13.45 +55.432.0 USChIna 8.64 +.08 +97.0 WldPrcMn 25.82 +.93+548.4 USAA Group: AgvGI 32.22 -.06 -42 CABd 11.15 -.03 +2827 CosotIr 26.63 -.02 +33,2 GNMA 9.52 -.02 +24.4 GrTxStr 14.62 -.03 +20.2 Grwth 15.67 -.05 -4,5 Gr&lnc 19.07 -.05 +18,9 IncSrk 15.95 -.03 +24.1 Inc0 12.10 -.03 +28.4 Ins 25.17 +.07 +55.7 NYBd 11.99 -.03 +30.4 PrecMM 24.60 +.32+4372 SaTech 11.21 +.01 -11.8 ShftBnd 8.82 ... +12.1 SmCpStk 14.44 -.02 +54.7 TxE 13.17 -.03 +27.4 C H.., saw r -~ Sari. 1" -+0 .0' -'A ON Es,-, 55+ ova %RL ,1.- .+0 -.53 a avv -, *aJr,.,..ub v~v4 -va-i r..rr vM .0~ .IJ. to ~,'-. tAb Lvq 'it Aol lAflsvS 2.+n.v+ 0 ..tOA . ~tI .~ TxELT 14.05 -.04 +33.6 TxESh 10.61 -.01 +163 VABd 11.60 -.03 +28.7 WIdGr 18.82 ... +28.9 Value Line Fd: LevGtn 24.18 -.01 +6.2 Van Kamp Funds A: CATFAp 18.54 -.05 +273 CmstAp 18.27 -.05 +282 CpBdAp 6.56 -.01 +29.8 EGAp 43.59 -.03 -16.8 EqlncAp 8,87 -.01 +38.6 Exch 379.92 +.33 +10.5 GrInAp 21,10 ... 438.1 HarbAp 15.00 +.02 +14.0 HIYtdA 3.53 -.01 +17.0 HYMuAp 10.96 -.02 +38.6 InTFAp 18.56 -.05 +28.6 MunlAp 14.70 -.03 +28.2 PATFAp 17.37 -.04 +26.8 S-FMunlnc 13.33 -.03 +33.6 US MIgeA 13.54 -.03 +23.7 UIAp 19.49 -02 +15.5 Van Kamp Funds B: EGBt 37.11 -.02 -19.9 EnlerpBt 12.48 -.01 -9.1 EqIncBt 8.72 -.01 +33.5 HYMuBt 10.96 -.02 +33.5 MulB 1466 -.03 +23.3 PATFBt 17.32 -.03 +22.1 StrMunInc 13.32 -.03 +28.7 USMtge 13.49 -.02 +18.9 UIB 19.43 -.01 +11.3 Vanguard Admiral: CpOpAdln8232 -.06 NS Energy 115.31 +1.61, NS ExplAdmin76.07 -.09 NS 500Admlnil9.10 -.19 +13.4 GNMAAdn1022 -.03 +28.6 HIthCrn 60.16 -.21 NS HiYIdCpn 6.19 -.01 NS HiYlIdAdmn10.81 -.03 NS IBdAdmln1021 -.03 NS IstGrAdmn71.58 -.36 NS rrAdmiIn 13.31 -.03 +23.8 UdTrAdn 10.69 -.01 +17.1 MCpAdmrln84.50 +.02 NS PnnCaprn72.06 -.03 NS STsyAdmln1027 -01 +21.1 ShITrAdn 15.53 ... +12.6 STIGrAdn 10.48 -.01 +21.9 TlBAdmln 9.97 -.02 NS TStkAdmn31l.31 -.04 +232 WellslAdmn51.83-.11 ,NS WellinAdmn53.87-.05 NS Wir dsorn6026 -.16 NS da31.1Z,.7,-iA -.07 NS Vanguard Fds: AssetAn 2624 -.04 +28.7 CALTn 11.72 -.03 +28,6 CapOppn 35.2 -.03 +42.7 Convtn 1428 -.01 +432 DiudGron 12.96 -.03 +2.7 Energy 61.40 +.86+178.7 Eqlnon 23.80 -.07 +29.7 Expirn 81.69 -.11 +63.0 FLLTn 11.62 -.03 +30.1 GNMAn 10.22 -.03 +28.2 GkobEqn 20.67 -.04 +83.4 Grolncn 32.87 -.02 +182 GrthEqn 11.04 ... +2.8 HYCorpn 6.19 -.01 +31.5 HithCren142.52 -.48 +45.1 c.,i.,nIo 12.13 -.01 +44.6 IntltExprn 19.40 -.08 +87.4 IntGrn 22.50 -.11 4+39.7 IntlVal n 37.44 -.21 4+67.7 ITIGraden 9.66 -.03 +322 nTsryn 10.77 -.03 +29.0 UfeConn 15.82 -.03 +29.1 UfeGron 21.84 -.05 +30.1 Ulnicn 13.65 -.02 +27.6 UlfeModn 19.03 -.04 +30.7 LTlGraden 9.33 -.06 444.1 LTTsryn 11.32 -.07 +38.5 Mogn 18.48 -.01 +19.1 MuHYn 10.81 -.03 +30.4 MulnsLgn 12.63 -03 +29.8 MuIlntn 13.31 -.03 +23.4 MuLtdn 10.69 -.01 +16.7 MuLongn 1127 -.03 +28.9 MuShrtn 15.53 ... +12.3 NJLTn 11.84 -.03 +28.5 NYLTn 11.27 -.04 +29.3 OHLTTEn11.98 -03 +29.7 PALTn 11.35 -.03 +29.4 PrecMs rn26.56 +.28337.3 Prmcprn 69.42 -.04 +33.8 SelValurnl9.19 -.07 +76.7 STARn 20.20 -.05 +38.3 STIGradenlO.48 -.01 +21.5 STFedn 10.21 -.01 +20.3 StralEqn 23.34 -.01 +5.2 TgtRe2025n12.08-.02 NS USGron 18.49 +.03 -15.0 USValuen13.98 -.06 +41.9 Wellslyn 21.39 -.05 +36.8 Welltnn 31.18 -.03 +39.7 .Wndsrn 17.86 -.04 4+37.8 Wndslln 32.41 -.04 +36.9 Vanguard Idx Fds: 500n 119.08 -.19 +13.0 Balanced n20.32 -.04 +27.0 EMkIn 21.32 +.05+1572 Europe n 29.67 -.18 +39.5 Extendn 36.69 -.01 +61.7 Growthn 28.31 -.03 +8.6 ITBndn 10.21 -.03 +32.3 LgCaplxn 23.20 -.03 NS MidCapn 18.62 ... +70.4 Pacificn 11.63 -.12 +560.8 REITrn 21.74 -.06+153.8 SmCapn 31.07 -.06 +70.4 SmICpVn 15.72 -.07 +813 STBndn 9.86 -.01 +203 Tot0ndn 9.97 -.02 +26.9 Totlntin 15.19 -.09 +52.1 ToStkn 31.30 -.05 +22.8 Valuen 23.29 -.04 +21.5 Vanguard Instl Fds: Instldxn 118.16 -.19 +13.7 InsPin 118.17 -.19 +13.9 TotlBdIdxn5032 -.13 NS lnsTStPlusn28.19-.04 NS MkldCplsltn18.67 .. +71.6 TBlsIn 927 -.02 +27.7 TSInstn 3132 -.04 +23.6 Vantagepoint Fds: Growth 8.96 ... +3.1 Victory Funds: DvsStA 17.56 +.04 +28,3 Waddell & Reed Adv: CorelnvA 6.52 +.02 +8,7 Wasatch: SmCpGr 39.59 -.07 +79.0 Waltz Funds: Value 35.80 -.04 +19.9 Wells Fargo Adv: CmStkZ 23.20 +.05 444.6 Opplylnv 46.97 ... +26.1 Western Asset: CorePlus 10.34 -.03 +39.6 Core 11.16 -.03 +33.8 William Blair N: GrowthN 11.85 -.02 +8.6 ntlGthN 26.98 -.05 +68.6 Yacktman Funds: Fundp 15.15 -.04 +90.3 - asw * * 2= * * eS -,o, - 5 0O re-s n a e 0 i 0W - -- S e -- - -t - - --- -a -e - a . , -- C .-"Copyrighted Material -a - Syndicated Content - Available from Commercial News Providers"a 4w 4 - l i, ow- e a -.-Mows e a OS 0 m ..M-a 4m 0 b- - a- a Se a - -e e F q S C - a-SO -E a -e O -G 4WM" -mm ago- - goa p a -mop- -0- ba-41 0am -.0NWw---0- 411b-e -m 400 -- l -ll --Q o00.am--W a 0 o o o -a a=u ,=J. ...u Cnn r=. a 0p -S - -a-0 =f--._"m * Am- e *.40 4 4an.a nmo-s a e o Show 2005 hurricane season was the most active in history... + Hurricane Panels + Accordions Shutters + + Wind Guard Hurricane Windows += M- pM-- He P"oIed Your Home 30 Years as Your f J VBIUhImu Hometown Dealer Get Protection From: H !--Hurricanes & Storms ," .' Burglaries Rising SInsurance Rates B O O MUUAF3D \ .__-.- nr.w., / r\ Tn /wix~r F o p 0 ,P 40 1 AA / S '"A proverb is a short sentence- based on lonn experience." J 7IT- -.,.I MARCH 3, 2006 ~: - telig~kei 1.ta FL- .Ek3' eI CITRUS COUNTY CHRONICLE IT, EDITORIAL BOARD Gerry Mulligan...............................publisher Charlie Brennan .................................editor Neale Brennan ...... promotions/community affairs Kathie Stewart ................circulation director Mike Arnold ........................ managing editor ._r Andy M arks ................... ......... U -E FOR CONCERN Meticulously monitor crack in school floor About a half-year ago, a crack was discovered on the floor of the recently. constructed Homosassa Elemen- tary School cafeteria. Granted, concrete naturally expands and contracts, common- ly causing cracks; but when there's a crack in a structure that has the history of the cafete- . ria, great concern is warranted. In 2004, it was revealed that the contractor for the new cafeteria THE I and media center failed to include Homo critical ingredients Eleme - specifically,-.teel. r reinforcement bars and concrete grout OU.R. OF - in the walls'That Cont discovery set' -in dilige motion a series-of measures, includ- YOUR OPIN ing sending pupils hr:,:in off to Crystal Ri\er **..rnment at for a half-year. Chi,:,nrIle spending an extra $950,000 and the formation of a blue-ribbon committee to assess what went wrong and to recom- mend ways to avoid such shoddy construction in future projects. The contractor, R.E. Graham Contracting Inc., was not charged criminally, but never regained the confidence of local officials. About the only thing good to Protein mix S I hate to bother you again, but you've got some ( articles by people that are -. out of their freaking mind. Look at columnist Mary Hunt's ("Everyday Cheap- skate") Monte Cristo sand- wiches. You're supposed to put them in the grill or CALL - frying pan. Well, look at 563- the ingredients. She's got 5U6 ' two types of cheese pro- volone and Swiss and then she wants you to put ham on it and then she wants you to put turkey on it and then you've got two eggs you're beating, then you've got milk So you've got milk and eggs and cheese and ham and turkey and chicken. I mean talk about mixing your pro- teins. Junk mail I've lived here a little over a year, and I went and got my driver's license in Citrus County so I could claim the Ilm.estead Within the past six months s e recei ed se- er- al things in the mail with my dri- ver's license name on it. Now 'my driver's license is the onl.\ thing I have that has my maiden name on.... I'd like to know, is it illegal or legal for them to use my name for the Florida Sheriff's Association want- ing money and Mutual of Omaha selling me insurance? They are sell- ing my address and my name for solicitation. I'd like to know who I can get a hold of to get my name off of this list from the State of Florida Department of Motor Vehicles .... Please put a phone number or give me a phone number. Smoky road Environmentalists, where are you? Citrus County approved an incinerator off Homosassa Trail .... and admits it does not have the capacity to regulate or monitor it. One of the conditions to allowing the incinerator is the open burning of debris is specifically prohibited. come from the debacle was new criteria for monitoring the con- struction of schools. News that the floor crack has grown since it was first discov- ered this past July led to a "call for an engineering study. One side of the crack is a quarter- inch higher than the other. Several days ago, a brief com- munication problem led to school officials keeping children out of the cafeteria until being formally SSUE: advised that the sassa structure wvas safe. -ntary Not everyone is :raSck( :. convinced of the safety of the cafete- INIQN: -ria and the media i -nu,' center. .nce. It's tough to gauge when people VION: Go to are being alarmists, hine.c.:m to especially when out toda)'s history lends merit ditornal. tO their fears.till-v experts feel the building is safe. - Short of the high-dollar prospect of razing the media center and cafeteria to learn if the floors were improperly built, the best bet is to have profes- sionals routinely and meticu- lously monitor the cracks and other aspects of the construction to ensure the safety of children and educators is not in doubt. Then why was a permit issued for open burning of debris allowed on one of the windiest days of the month that required .the ^ assistance of the local fire department and Depart- ment of Forestry and also S ,s? required hazard-warning signs for heavy smoke in 0579 the area to be placed on 0579 t Rock Crusher Road? Citrus County needs to fig- ure out how to regulate this or shut it down if they can't han- dle it. Open to suggestion You have three calls in on President's Day obviously more than just opinions. You. have one titled "Reagan's role" and the "Bush legacy" and another on "Hunting safety"... It just makes me celebrate my Republicanism ... I must say I have to agree with Leonard Pitts, in Monday's paper, and also Mike DAgastino's letter My only question is: Whom do we vote for? I don't want any of the candidates... Maybe he could suggest someone better. I really mean that. Bill zapper I'd like to know when our electric bills are going to go down again. Last month, my electric bill was $399. This month it's $275. We can't afford these electric bills. It's ridiculous. What's going on? I think there needs to be a big investiga- tion. Gas prices have gone down, so why is the electric company charg- ing us so much money? Somebody has got to investigate and see why we're getting big bills. Everybody is complaining, and we can't afford it. Vermont syrup I was reading over the Saturday's (Feb. 25) Sound Off and noticed someone looking for "Vermont syrup." I bought some at Cracker Barrel in Ocala, and they also have it in sugar-free. Mims the National Guard b - - Q - l ..p *on0 T * - SO - S = -~ - -RW -4 ~1 C - -4 - 0 ~ - S - - . S. - S - -w -~ -a. - - ~-- - - -0 - -- "Copyrighted Material * ~- -I. a ; -- -_Syndicated Content-.-. Available from Commercial News Providers", 4&*% - 0 wr _______ .LETTERS to the Editor - LEDER A matter of tax monies Recently, the Crystal River City Council asked the county to go into a partnership to keep Pete's Pier open to the public. The county's response, "no." The county said their emphasis would be on obtaining waterway access in the unincorporated areas. That is even though most of the users of Pete's Pier ramp are county resi- dents and out-of-towners, not city res- idents. The county appears to feel they do not have any obligation to an area that was dumb enough to incorporate. That is even though the city taxpayers pay the same county taxes as unincor- porated county taxpayers pay. City taxpayers should be tired of subsidizing the unincorporated tax- payers by paying out money for very little services returned. Otherwise county taxpayers would be paying more. Hopefully, the city of Crystal River will be dissolved some day. and the county will be forced to provide the services to the old city. Yes, Mr. Farley, we do expect Beverly Hills residents to pay for Crystal River sidewalks. Who do you think paid for Beverly Hills sidewalks? The Crystal River taxpayers, when they paid their county taxes. Phillip W. Price Crystal River Missing the boat For the love of manatees, and you now propose to love them to death in reality with a marina to boot on the old Cross Florida Barge Canal to unleash watercraft from the Ocala-. Gainesville area that do not now come to Citrus County to come try out our manatee speed bumps in a prime birthing area for manatees. Who did your research, the proposed develop- er? Information you didn't see or disre- garded was a recommended judicial order that became a final ruling in February, 1997. "Recommended Order on Monday, Nov. 18, 1996. Summary: Applicant failed to provide assurances proposed marina will not adversely impact manatee (unless only sailboats allowed) and groundwater." "This was a challenge to a DEP per- mit by several organizations con- cerned about the impact on a prime manatee birthing area and drinking water for the area. The DEP permit was denied. Yet, you now recommend yet anoth- er marina there.. Is this an, "If at first you don't suc- ceed, try, try again?" And didn't you catch a glimpse o through the smoke and mirrors in j this overlay plan to swap 143 acres of,2 limerock mining along the barge idT -canal for 143 acres currently zoned ioj Industrial to the north, so the mining- operation can blast along this very mA large residential area just south of b9 the Withlacoochee River? r I hate to say it, but I think you )' il missed the boat on this one, big time2ag Helen Spiveg, Homosassa.F Co-Chair of the Board yl of Save the Manatee Clu8la Manatee Issue Chajbia Florida Chapter of Sierra CluI Thanks due 'N On behalf of the Lecanto High 'O b School baseball program, I would likP9'1 to take this opportunity to extend my qa, sincere thanks to parents, friends, d organizations and businesses for their' support. Your financial support helps defra B expenses incurred during the presea;., son, tournaments and regular-season... campaign. I My thanks also goes to our adminisms9 tration for their enthusiasm and sup-Wlq port of the baseball program. bu We are enthusiastic about the ,nu upcoming season and encourage ',as everyone to come out to the ball parlasv and root for the Panthers. ja I Jim Manoid Head Baseball CoacIjbq [iiil * 0. U941OG" Ui - * wl - - - *-7 _ qm. s )s e. i ( FRIDAY, MARCH 3, 2006 15A ---Maemr- ia- S"Copyrighted Mater ial indicated Content- _"- Availablefr Commecial News Providers- -- -Avanlable"jrotMCommercial News Providers"'_ . mob -. - 'B 1b - - B .- .Q 4 - B, -. 0 9 ' ---10- - - q 0b m Mm -o do. @AD- 41b- wm 41b Mo twm 0 14%- w- owEN q 4o lo - 40 .WM -410. quo f- 'a O.. ag -omb fmw ubd mdam. F On Easy Street next to Walmart in Ocala! wo- -womo - 401"m . m qp d' 4-i- cum ~ special purchase on quality La-Z- Boy FDA i-.lo b upfin qbmwm - 40- -lm .k.-0o uoa- -m -no 0- 4 4b.- * b-amNM s O .Ndb- - -m 4b* - -amS 40 -.a - *-* eam 41 - C S o"o 480 0 q* - *UD4m 1 4wea u- e Goo C- 6 4w e w a 1 0 -mm -M =qt- --* am a% I we -m 40 q 4 qo m- em -q- ______ * - - 40 qwm * Sale price good through March 4th! SPECIAL HURRY IN $2,199 TODAY! Regularly $2,399 FINANCING AVAILABLE [BI[,' Ocala 2530 SW 19th Ave. Rd., Ocala, FL (on Easy Street next to Walmart), 861-3009 Mon. Fri. 10 am 7pm, Sat. 10am 6pm, Sun. Noon -5pm The Conrad slyle 462 Sectional Fr" Docaoitor ConsultntJ "'4 The Five Star Edition of the Carrier Infinityr System is the world's first self-monitoring residential air conditioning system. Designed and programmed to run a daily diagnostic check, it actually adjusts itself to maintain maximum efficiency. Cool Cash You stay cooler, drier and save money. You also get the best limited warranties* in the business plus Puron', the environmentally sound refrigerant. Get a $1,200 Cool Cash instantly when you call Bay Area, your Carrier Factory Authorized Dealer and replace your old air conditioner with a new, two-speed Five Star Edition of the Infinity- System. Smart air conditioner. Smart deal. * 100% Satisfaction Guaranteed * 25% Minimum Cooling & Heating Cost Savings * 10 Year Factory Parts & Labor Guarantee * 10 Year Rust Through Guarantee @ 10 Year Lightning Protection Guarantee @ 30 Times More Moisture Removal Ask About L HYBR1DHEA ,t I on eed A New Sysfst 1 AIR CONDITIONING D .o't Netd C Aew Sym. ! & HEATING n I T My T9, f or t s Schedule your Carrier Factory 1 .AU Authorized Precision Test, I Tune & Cleaning today C wImnile R.O.P. Offer ends 3/1/06 "-, a i n- - h ft lommA . Citrus. Marion Levy Hernando 795- 489 - 447 - 688 - wwf:w O O6B,1/s5e kiI uMlt 2 6 6ai cooI CITRUS COUNTY '(PL) LCHRONIC~LE * a - 'B S - dimB ql- - -'B -~ C S ~ B ~ - ppmommmmmm I I -V - I L A F U R N f-DTTC rn IFT ) Ir.pnwr, ; N. leivX ' c II ~ Nation X.. . ~!tT~ff~lbM151!- kib U -Wy A o op6dt.,IAP V a NO 9 - S * S a S 0 4b 0 4 esp_ - 0- 4D o-m- ftm am 46- 46 m- m 0 4001b 40110- MOMII 4* OW9 EMPWWAO MW_ ---m ammo- ils- 0 d - a 8umsW vt"to 40 quww -* w Available from Commercia M~iomme a am a Im wf- S4m do-moo a ambd- - fm- .40 -M a -41-0 - 0 f m q - 41.--p ma 0 0 ~ 41b Sm-ow - 411. - f 9b.d . ftv- . a ~ - - ~- - ~ - ~ **- ~*- -~ - - w* a - - ~ a - a - * emmum WpY cat mwm *o* -s 4 mam * n 4 e anmn o- -, ** am e 1NDme * 4m 400 4w* mm 0 lerola m,. l News Providers" -4 4m e0 e 4b om4 mfam- 4- Material M =1 on e~ 'INew rviders" -mom Uw~ - St - -~ a - ~.* ~ ~ Kr wnw i-md hp kiatoW pope 1~ - ~ - -a a- - - S - * 0 a - 0 dh pm o 0 *-~ - -S - 0 0 ~ 9 = - - a - - a - .4 do 4 a a - a - * - a * -- - - a 0 -*~- * - 0O 0 a- a- - -. - 0 - - 0 * -S a *- p. S. - - -~. - - - - p - 0~ C~ = 4pm m- q- Gwp -1M ___- -momo41m W-= mwAb .as 0 -,==N 401 a a -44 ,N --.u 0 -w ar. qw- mom -uo - pqm 40- 4 -~ I~~' :0 S Not ahe opyrihtg1e Syndicated C *0 b-t 40 -NNW .Mo a ~ -.0-.0 --W AM A _-- pabiot Ah Ah Ah ralww YIPWIMM, - ql sov -Ak- i ood start ; Matt Kenseth back to old PAGE 5B in MARCH 3, 2006 (z.4 ~ Sports BRIEFS Seven Rivers pounds Cedar Key 12-1 -,,The Warriors picked up a 12- j,'mercy rule win in five innings Against Cedar Key Thursday. ,*,Chad Peets earned the win h seven strikeouts, t ile giving up oly two hits taid no ,pned runs. ,j Justin .hardson Went 2-4 at * plate with tiWo home runs and three RBIs. Julian Cousinet "wnt 2-2 with an RBI. ~ The Wanrriors (2-2, 2-1) next play Monday at home against -First Academy of Leesburg. Hurricanes strike "W. .00 . Citrus' No.1 seed Courtney Spafford returns the ball to Lecanto's Sonia Shah during a match at Lecanto High School Thursday afternoon. Spafford won 6-1, 6-1. Citrus girls topple Lecanto 5-2, Panthers boys victorious in 6-1 romp low a mom~ * . -" .* C.J. RIsAK cjrisak@chronicleonline.com Chronicle It was, after all, just anoth- er regular-season dual meet -right? Guess again. The Citrus girls tennis team certainly didn't approach Thursday's visit to Lecanto as such. The Hurricanes, second to Lecanto in the district last season, wanted to make a ,statement in this clash- between District 2A-5 pow- ers. and they did just that, shocking the nine-time Woods -A At* defending champs 5-2. Citrus improved to 4-0 overall; Lecanto is 5-1. "This is a cross-county rival," said Citrus coach Michelle Connor, in her first season as coach. "And any- time you beat a cross-county rival it means something - especially against a team that has won the district nine times. "Yes, there's still a lot of tennis left to play this season, but you listen to these girls on the bus on the-way back-- and try and tell them this really doesn't mean that much." Panthers' coach Karen Dickson had tried to de- emphasize this match, refer- ring to it as part of the sorting out period of the season. But it quickly became apparent it meant much more to those playing. Three of the seven matches went to three sets, and two of those featured tiebreakers. In four different flights, both coaches were summoned to serve as line judges after players on both sides disput- ed'calls:.hiide by their,adver- saries. "That tells me it means something to them," noted Connor The three three-set match- es delivered a different mes- sage to Dickson. especially since Lecanto lost two of them. "It shows me we need to be in better shape." she said. "We need to work on condi- tioning." Asked if this would serve as a wake-up call to the Panthers, Dickson replied: "Oh yeah. You can't just show up .and win. .You've got to work at it." -... -0- Citrus opened play with Please see T-/,!I'VPage 3B Teams lifting BoywWs44ifng J #lx0 S 0 - teams set goals fir new season JON-MICHAEL SORACCHs jmsoracchi@chronicleonline.com Chronicle With 180 spots in 10 weight classes in Class 2A, the oppor- tunity for Citrus County schools to place lifters into the FHSAA Boys Weightlifting Championships are ample. After placing seven lifters in the finals last year, and two coming home with medals, Citrus County has just one returning state qualifier - Citrus' Curtis Neumann, who finished 14th last season. The Hurricanes, Crystal River. Dunnellon and Lecanto all have the same plight: few returnees.especially ones that made the trip to Gainesville, to last year's teams. Citrus has been the team to beat for the last six years. The Hurricanes have dominated at the county championship since the 2000 season and, according to Citrus coach T.D. Haines, haven't suffered a reg- ular-season loss in over three years. Crystal River last won a county championship in 1999 while Lecanto claimed a share with Citrus in 1995. The Panthers already own a win this season over Crystal River by a score of 47-34 last Wednesday and it won't take -long to-seeidliecanto is a seri,- ous contender. ,The Hurricanes will host the Panthers Wednesday. Please see i,'iNG-/Page 3B ill in trol oduel at Doal ,* ~- 5m * "'Copyrighted Material |111111111111111111 Syndicated Content . Available from Commercial NewsPoider ft A &" -...* ,dll NFL exted frew epcy frmdline DeviI Rays lxmnh HaILWlada', Javs 945 S S qM M MW*M M.. q *A ~. -b a -: .... ,awt. ..vf', "" *Wttfe- *jE *jttttir - d.. 2B FRIDAY, MARCH 3, 2006 Ui i I NIH Canadiens shut down Panthers - 0 - S - - ~- .-- - -0 0a - a ~- - a.- -.- -'a - C 'a.- - - a 'a = S 'a 0. -~ - 5- 'a - - "a 'a C * a 'a ~0. 'a - 'a - .'~ a- S - 0 0 ' a - 4D 0oft- d em a- w4w0w "D qu AN 1Ua 'amop- m IU ob 4 'a .NO 10 N-S N0P -f quom v' "M 0 ' quo-w 41-0 0 *mpab ~1 - q 4 -1b do- 'a ab ft'ab 4 ON 40 o.41b 'a S so a& -m 4m ft.. ** . - orp oftw 4 4a omO m 4~ a do 'a -o am "' - 4 --0 lm GOO oa lb. 4W a NM 4 0 m 'a bam 4 * 401 40 4w 0 'ab o qw ov a 44 4w 0 .mm 'a -b "ma = b4W ob -4m* WD - 4am 4110.-00 -a'a do~- 4-m --VI 0 --lw 0- 4D qm meo do- a- o a- -4 - dm m f.0 dl 410 00 4M VAN qimo 0 'ab- ft b 00m - 4m aw40-M 4D l 0 'a 0M 'a w qmamb .- ft 44100 a. S. AvailI S O'q S * a SpamtoA 0aa 4110- SNO -00 40 c- .00 4b *..dlm- - S rS plw 0 40 0 -4 -Raw 4WDa0 ON av cow -wSb- 4w em 'a w '%wow 0 td'dMa e 2- ft *O. owl -vdiaeq .0 Svnicted- Content' -*- i a-q 3 b 'f '' -M aD -lsp MEO qw-- 40 -..m w - aw 0 'a -a0 400 wab qpas 0 -am mm dM N900' ONO 01- - -so - 'a a 'a - 'a ~ -'a - * Q Am e 0 Lecanto teams nab meet with ease C.J. RISAK cjrisak@chronicle6nline.com Chronicle The start to the season has been a surprise to Lecanto's track teams, both of them - and a pleasant one at that. - The Panthers hosted their second invitational meet of the week yesterday, and for the second time they both came away with team victo- ries. The Lecanto, girls won with relative ease, compiling 156.5 points in the five-team meet. East Ridge was second with 76, followed by Hernando (51.5), Springstead (29) and Central (28). The boys meet was closer, but the standings were simi- lar. Lecanto finished first with 120, followed by East Ridge (99), Central (47), Springstead (41) and Hernando (40). "We (won) by a lot more than I thought we would," Lecanto boys coach Dan Epstein said afterward. Depth was the key factor for both the Panthers boys and girls teams, particu- larly in the field -416 events. The Lecanto I seven events, with wins in three of the six field events. Maryann Bruno got two victories for the Panthers, capturing both the 100-meter (18.4) and 300- meter (52.56) hurdles. Bruno led a one-two-three sweep by Lecanto in both events. Shaneatha Gates took first 'a o -- 0 41b . a. 4- q a. - 0 'a 'a 'a a-a.- 'a 0- 0 - -a 'a S~ - - 'a a 'a 0. -~ -~ '0- - - S -. - 'a.- -.0- - .0 0- 'a 0. in the shot put (36-feet, 10 3.4- inches) and was second in the discus (94-3), while Natalie Burnett won the triple jump (29-5 1/2), again leading a Lecanto one-two-three sweep in the event. Kelly Butler took top honors for the Panthers in the pole vault (8-0). _ Tara Haddock was I I first in the 1,600 for Lecanto (5:36.73) and the team of Kirstie NC Charlston, Bruno, Vicki Pepin and Summer Dupler were best in the 4x400 relay (4:43.0). The Panther boys team managed wins in six events, and four of those were in the field. Richard Chaney accounted for two of them, collecting victories in both the --fi ID 4Da ' high jump (5-10) and triple jump (41-3); Chaney also placed second :in the long jump (20-8 1/2). Other Lecanto triumphs in the field came from Brian Burns in the pole vault-(10-6) and Denver Carpenter in the shot put (41-10 1/4). The Panthers also got first- place' performances from Nick Farrington in the 1,600 (4:41.29) and Felton Kitchner in the 300 hurdles (42.68). One of the better races of the night was in the boys 800, where Hernando's Ben Martucci out- dueled Lecanto's Nick Norton, winning in 2:03.18. Norton was second in 2:04.63. Next up for the Panthers is the Crystal River Invitational, which starts at 10 a.m. Saturday. "W 4 - 'a --~-- 'ab 1"i wh ul em00 S ead-o 'amp t0owON- -40 Io WD -0 di 0ow -m 'aaNum- n- mol. m "a mp -aim & -OP 'a4w ob Q. qw om %a. .0 41W0 b.0 a' V ~0 a a 0-we wo 0 0 0 0'0 ''-a .- -0 -mm41 a aw coo s. m- S0 .0m No 4b. a dm 4 0b -mom G..00 ammom0 411 45'- 0doo *AID--=mon d- - go-*oft=*O 6 OP-- - 41b kmm 0 0 'a -4S 40. S 40 abom b==0 NG 0 0 --4110 swim 4 ..'a * S. -. a moSm 4.0.~ . 5- b ' -.0 -4b. o'at dp -qp-mw S. 0 .- S.a S. m -- --I 0m-4b -.4 0 - q0l M - w 0 0.w owe 4bo S a'a - -p a-a w- a mb-- 4- S. do'a- Sa w 41. .00- 'a-a qb .0- 0 le ' Sb.- -.moo ft ma '.-NEW=. 4-01. qW~-0- a -m. 40. .mm d abmmaw 0 ob -- q 0-- 4o m 'a- - - S 0- - S S 0. - S 0 a - S a 'a * a- * a. --- -a. - 00 - 00 - S - 'a - 'a '0 a. 'a Commercial News Provide a. a 0 S 0 4 - 0 - - '0'a 'a ~ - - 0 a - -~ 0 'a - 'a a.-~ -- * - e - - CITRUS COUNTY (FL) CHRONICLE, mihjr FqMLALAA A Ai .. .... / 4 o "qm litt 0 WNKXNM --CiTR,,rsC,~ nu v /17(FL) CHtN'niFfc()LSFRDY ACH3 063B'. BASKETBALL V NBA ( All Times EST \,. EASTERN CONFERENCE Atlantic Division W L Pct GB New Jersey 31 26 .544 - Philadelphia 29 28 .509 2 -Boston 23 34 .404 8 '-Toronto 20 37 .351 11 New York 15 42 .263 16 Southeast Division W L Pct GB Miami 37 20 .649 - Washington 29 27 .518 7%2 Orlando 20 37 .351 17 Atlanta 19 37 .339 17% Charlotte 16 43 .271 22 .l Central Division lri)!. W L Pct GB Detroit 47 10 .825 - Cleveland 33 26 .559 15 Indiana 29 25 .537 16%2 ,'lilwaukee 29 29 .500 18%2 l hicago 25 32 .439 22 a: WESTERN CONFERENCE Southwest Division W L Pct GB ballas 45 11 .804 - *San Antonio 44 12 .786 1 Memphis 32 26 .552 14 New Orleans 31 27 .534 15 Houston 25 33 .431 21 Northwest Division W L Pct GB Denver 31 27 .534 - P; (Utah 27 30 .474 32 innesota 25 32 .439 5% Seattle 22 36 .379 9 Portland 19 38 .333 11% '" Pacific Division W L Pct GB Phoenix 39 17 .696 - L.A. Clippers 33 23 .589 6 L.A. Lakers 29 29 .500 11 Sacramento 27 30 .474 12%2 Golden State 25 32 .439 14% I Wednesday's Games Atlanta 113, Toronto 111, OT Sacramento 97, Cleveland 90 Miami 103 Boston 96 Memphis 101, New York 99 Minnesota 100, New Jersey 90 Charlotte 104, Utah 89 Denver 98, Detroit 87 Pnoen.x 123, Milwaukee 110 Philadelphia 106, Houston 101 SPortland 99, L.A. Lakers 93 Golden State 98, Orlando 94 L A Clippers 89, New Orleans 67 Thursday's Games S.-Cleveland 92, Chicago 91 Dallas at San Antonio, 9:30 p.m. Friday's Games Sacramenlo at Allanta, 7 p.m. Indiana at Boston 7 30.p.m.. S Chicago pm m L.A. Lakers at Golden Snate 10:30 -p.m. Saturday's Games. Toronto at New Jersey, 1 p.rm. Allanta at Miami 7:30 p.m. New YorK al Milwaukee. 8:30 p.m. Portland at San Antonio 8 30 p.m. ,f Orlando al Denver, 9 p.m. i .Detroit at LA. Lakers, 10:30 p.m. Sunday's Games Boston al Toronto 1 p m Sacramenlo at.Washington, 1 p.m- IndaiAsti Pridellfnia 1 p.m. Phoenix at Dallasw 3.30 pm. Golden State al Minnesota 3:30 p.m. Chicago at Cieveland 7:30 p.m. Portland at Houston, 8:30 p.m. Utah at Seattle, 9 p.m., , Memphis at L.A. Clippers, 9 p.m. 5ssi Cavaliers 92, Bulls 91 5.CLEVELAND (92) James 11-27 11-13 33, Varejao 5-8 3-7 13, Ilgauskas 3-13 3-5 9, Murray 5-13 2-2 13, Snow 5-8 4-4 14, Jones 1-5 0-0 3, Marshall 2-3 0-0 5, Henderson 1-1 0-0 2. Totals 33-78 23-31 92. CHICAGO (91) Deng 6-13 5-5 18, Allen 2-6 0-0 4, )Chandler 1-4 0-0 2, Gordon 6-14 3-5 16, -,linrich 10-21 3-4 25, Songaila 3-5 1-2 7, Harrington 0-3 0-0 0, Nocioni 3-9 2-2 9, '3DDuhon 1-4 4-4 6, Pargo 1-3 0-0 2, P l-iatkowski 0-0 0-0 0, Sweetney 0-3 2-2 2. S.Totals 33-85 20-24 91. SCleveland 26 29 2017- 92 Chicago 17 20 2331- 91 & 3-Point'Goals--Cleveland 3-11 (Marshall ,60,1-2, Murray 1-2, Jones 1-4, James 0-3), oCiphicago 5-14 (Hinrich 2-4, Deng 1-1, Ri .Gordon 1-3, Nocioni 1-4; Duhon 0-2). ,- Fouled Out-Ilgauskas. Rebounds- . l' leveland 53 (James 11), Chicago 56 SCnhandler 15). Assists-Cleveland 19 1,k(James, Snow 8), Chicago 12 (Hinrich, 5tIbuhon 4). Total Fouls-Cleveland 24, Chicago 24. A-20,726. (21,711). P How the NCAA Top 25 Fared Thursday br;.r 1. Duke (27-2) did not play. Next: vs. No. -,"] 3 North Carolina, Saturday. 1- 2. Connecticut (26-2) did not play. Next: p,/-s. Louisville, Saturday. L 3. Memphis (26-2) at UAB. Next: vs. Houston, Saturday. S4. Villanova (23-3) did not play. Next: at k'fSyracuse, Sunday. 5. Gonzaga (25-3) did not play. Next: vs. . TBA, Sunday. 6. Texas (24-5) did not play. Next: vs. No. S19 Oklahoma, Sunday. 7. George Washington (25-1) did not ,L 'Splay. Next: vs. Charlotte, Saturday. -1 > 8. Pittsburgh (21-5) did not play. Next: p 1vs. Seton Hall, Friday. 9. Ohio State (22-4) did not play. Next: S vs. Purdue, Sunday. rJ 10. Illinois (24-5) did not play. Next: at i i'- - - -. - - ~ Q - ~ ~ b .. W4-S ,Or the record On the AIRWAVES TODAY'S SPORTS BASEBALL 1 p.m. (ESPN) MLB Preseason Baseball Los Angeles Dodgers at Atlanta Braves. From Disney's Wide World of Sports Complex in Kissimmee (Live) 4 a.m. (ESPN2) Baseball World Classic Chinese Taipei vs. Japan. From the Tokyo Dome in Tokyo. (Live) BASKETBALL 11 a.m. (FSNFL) Women's College Basketball ACC Tournament Quarterfinal North Carolina vs. Team TBA. From Greensboro, N.C. (Live) 1 p.m. (SUN) Women's College Basketball SEC Tournament Quarterfinal LSU vs. Team TBA. From Little Rock, Ark. (Live) 3:30 p.m. (SUN) Women's College Basketball SEC Tournament Quarterfinal Tennessee vs. Team TBA. From Little Rock, Ark. (Live) 4 p.m. (FSNFL) Women's College Basketball ACC Tournament Quarterfinal Florida State vs. Team TBA. From Greensboro, N.C. (Live) (ESPN2) College Basketball CIAA Tournament Semifinal - Teams TBA. From Charlotte, N.C. (Live) (CC) 7:30 p.m. (ESPN) NBA Basketball Washington Wizards at Philadelphia 76ers. From the Wachovia Center in Philadelphia.. (Live) (CC) 9 p.m. (SUN) NBA Basketball Orlando Magic at Phoenix Suns. From US Airways Center in Phoenix. (Live) 9:30 p.m. (FSNFL) Women's College Basketball ACC Tournament Quarterfinal Maryland vs. Team TBA. From Greensboro, N.C. (Live) 10 p.m. (ESPN) NBA Basketball Los Angeles Clippers at Utah Jazz. From the Delta Center in Salt Lake City. (Live) (CC) 11:30 p.m. (SUN) Women's College Basketball SEC Tournament Quarterfinal Georgia vs. Team TBA. From Little Rock, Ark. (Live) (Joined in Progress) BOXING 9 p.m. (ESPN2) Boxing Friday Night Fights. Demetrius Hopkins battles Mario Jose Ramos. From Philadelphia. (Live) (CC) GOLF 9 a.m. (GOLF) European; PGA Golf Enjoy Jakarta Indonesia Open - Second Round.'From Indonesia. (Same-day Tape) 3 p.m. (USA) PGA Golf Ford Championship at Doral Second Round. From Doral Golf Resort and Spa in Miami. (Live) (CC) - ; HOCKEY 7 p.m. (FSNFL) NHL Hockey Florida Panthers at Carolina Hurricanes. From the RBC Center in Raleigh, N.C. (Live) Prep CALENDAR TODAY'S PREP SPORTS BASEBALL 6: 30 p.m. West Port at Citrus 6:30 p.m. Lecanto at Crystal River 7 p.m. Dunnellon at Belleview SOFTBALL 7 p.m. Crystal River at Lecanto 7:30 p.m. Belleview at Dunnellon TRACK &FIELD 3:30 p.m. Citrus at Mitchell Invitational 'm No. 2A Michigan State. Saturday 11. Tennessee 020-61 did not plsy Next at Vanderbilt, Saturday.' 12. Boston College (23-6) did not play. Next: vs. Virginia Tech, Saturday. ' 13. North Carolina (20-6) did not. play. Next: at No. 1 Duke, Saturday. 14. Washington (22-5) at Arizona State. Next: at Arizona, Saturday. 15. UCLA (22-6) at California. Next: at Stanford, Saturday. 16. West Virginia (20-8) did not play. Next: at Cincinnati, Saturday. 17. Florida (23-6) did not play. Next: at Kentucky, Sunday. 18. Kansas (21-7) did not play. Next: at Kansas State, Saturday. 19. Oklahoma (20-6) did not play. Next: at No. 6 Texas, Sunday. 20. Georgetown (19-7) did not play. Next: at South Florida, Saturday. 21. LSU (21-7) did not play. Next: vs. Mississippi, Saturday. 22. N.C. State (21-7) did not play. Next: at Wake Forest, Saturday. 23. Iowa (21-8) did not play. Next: vs. Wisconsin, Saturday. 24. Nevada (22-5) vs. San Jose State. Next: vs. Fresno State, Saturday. 25. Michigan State (20-9) beat Wisconsin 74-65. Next: vs. No. 10 Illinois, Saturday HOCKEY EASTERN CONFERENCE Atlantic Division W LOT Pts GF GA N.Y Rangers 3615 8 80 195"143 Philadelphia 33 17 10 76 197 194 New Jersey 3122 7 69 174 170 N.Y. Islanders 26 28 4 56 171 207 Pittsburgh 14 35 11 39 168 239 Northeast Division W LOTPts GF GA Ottawa 39 14 5 83 234 141 Buffalo 36 16 5 77 188 162 Montreal 2822 8 64 166 183 Boston 2525 10 60 174 186 Toronto 2726 5 59 181 196 Southeast Division W LOTPts GF GA Carolina 40 14 4 84 219 179 Tampa Bay Atlanta Florida Washington 3223 4 2727 6 2328 8 2033 5 68 182 176 60 200 208 54 162 181 45 162 227 dip 400M I%. w QD - -40- 411b - S *, ~ - %-- 4b.- -% - f Delroit Nashvi Column Chicag St. Lou Vancou Calgary SColorai Edmon Minnes Dallas Los An Anahei San Jo Phoeni WEtTERN-6014FRENtE Central Division W LOTPts GF GA 40 14 5 85 211 147, lle ,35 19 6 76 186 173 bus 23 33 2 48 147 209 o 1931 8 46 148 199 is 1731 9 43 157 212 Northwest Division W LOTPts GF GA river 3422 5 73 201 184 y 3318 7 73 154 146 do 3321 6 72 217 189 ton 3021 0 68 195 190 sota 29 26 5 63 178 157 Pacific Division W LOTPts GF GA 38 17 3 79 192 156 geles 32 23 5. 69 203 200 m 2720 11 65 168 161 se 2821 8 64 179 173 x 2728 4 58 171 192 Two points for a win, one point for over- time loss or shootout loss. Wednesday's Games Atlanta 4, Buffalo 2 Carolina 4, Boston 3 Ottawa 4, Pittsburgh 3 New Jersey 2, Philadelphia 1, SO Chicago 3, Nashville 0 St. Louis 4, Edmonton 2 Detroit 2, Anaheim 0 Thursday's Games Boston 3, Atlanta 2 Montreal 1, Florida 0 NY. Rangers 6, Philadelphia 1 N.Y Islanders 3, New Jersey 2, SO Ottawa 7, Washington 1 Nashville 3, Vancouver. Saturday's Games Columbus at Los Angeles, 4 p.m. Buffalo at Boston, 7 p.m. Ottawa at Toronto, 7 p.m. Washington at Atlanta, 7 p.m. Carolina at Pittsburgh, 7:30 p.m. Montreal at Tampa Bay, 7:30 p.m. N.Y Rangers at New Jersey, 7:30 p.m. - -.A t V- - - e a - -- Colorado at Dallas, 8 p.m. Philadelphia at N.Y. Islanders, 8 p.m. Detroit at Phoenix,. 9 p.m. San Jose at Calgary, 10 p.m. Sunday's Games Nashville at Edmonton, 4 p.m. Columbus atAnaheim, 4 p.m. Dallas at Chicago, 7 p.m. Colorado at Minnesota, 7 p.m. St. Louis at Vancouver, 10 p.m. Ford Championship at Doral Thursday ,At Doral Golf Resort and Spa, Blue Course Miami Purse: $5.5 million Yardage: 7,266 Par: 7 First Round Tigei" WoCods Camilo Villegas Rich Beem Ryan Palmer Phil Mckelson Mark Wiison' Dean WIAson Scott Verplank David Toms Daniel Chopra Michael Bradley Lucas Glover Jason Bohn Vijay Singh Steve Elkington Charley Hoffman Chris Riley John Riegger Joey Snyder III Chad Campbell Padraig Harrington Davis Love III Tim Clark Arjun Atwal Rocco Mediate, Craig Barlow Shane Bertsch Trevor Immelman Joe Ogilvie Tag Ridings Billy Mayfair Justin Leonard Duffy Waldorf , Briny Baird ' Hank Kuehne Charles Warren Bo Van Pelt Kevin Na . Kenny Perry Fred Funk Stephen Ames Tom Pernice Jr Brian Gay Jerry Kelly Steve Lowery Mark O'Meara David Howell Harrison Frazar Robert Damron Carlos Franco Shaun Micneel. 33-31 -64 34-31 -65 33-32 -65 32-33 -65 33-32 -65 33-32 -65 33-33 -66 34-32 -66 31-35 -66 32-34 66 34-32 66 34-33 67 34-33 67 31-36 -67 34-33 -67 33-34 -67 33-34 -67 34-33 -67 35-32 -67 34-34 -68 35-33 -68 34-34 -68 33-35 -68, 34-34 -68 34-34 -68 33-35 68 34-34 -68 32-36 -68 34-34 68 36-32 -68 33-35 -68 34-34 -68 33-35-68 34-34 -68 32-36 -68 34-35 -69 34-35 -69 33-36 -69 35-34' -69:' 35-34 -69 32-37 69 35-34 -69. 35-34 -69 35-34 -69 34-35-69 33-36 -69 32.37-69 32-37 -69 33.36-69 35-34 -69 35-34 -69 TRANSACT!( BASEBALL American League LOS ANGELES ANGELS- terms with RHP Ervin Santana, Gregg, INF Casey Kotchrman,. I lztuis and INF Robb Quinlan c contracts. OAKLAND ATHLETICS-Agre with RHP Justin Duchscherer, Gaudin. RHP Kirk Sarloos. OF Jav OF Nick Swisher. INF Marco Scut Antionio Perez onon e-year Renewed me contracts of RHP J RHP Hustor. Street and OF.Chard SEATTLE MARINERS-Agree with RHP Clint Nageotte RHP J. OF Shln-Soo Choo Renewed Ine RHP pdicher Felix Hemandez NationaLLeague z ARIZONA DIAMONDBAOKS'- terms with RHP Greg Aquino I Bulger RHP Brian Bruney. R Gonzalez, RHP Ennque Gonz Dustin Nippert, RHP Tony Pena, Schultz, LHP Brad Halsey, LHP D INF Andy Green, INF Scott He Conor Jackson, INF Chad Trac Terrero, OF Chris Young, C.:Ko Miguel Montero and C Chris Snyc year contracts. Renewed thecontr Brahdon Medders and RHP Jose CHICAGO CUBS-Agreed to LHP Rich Hill, RHP Michael WL Roberto Novoa, RHP Todd Wellen John Koronka, RHP David Aard Jerome Williams, INF Ronny Ci Ryan Theriot and OF Matt Murton i contracts. CINCINNATI REDS--Agreed to RHP Matt Belisle on a one-year cc FLORIDA MARLINS-Agreed to INF-OF Miguel Cabrera and RHPE on one-year contracts. Renewed t of LHP Jason Vargas. MILWAUKEE BREWERS-Na Taylor vice president of consumer Agreed to terms with INF Bill Hal year contract. NEW YORK METS-Agreed to RHP Aaron Heilman, OF Victor Heath Bell, RHP John Maine, Nady RHP Juan Padilia RHP Ste LHP Royce Ring INF Anderson I RHP Matt Lndstrom RHP Fortunalo INF Jose Reyes Keppirger RHP Duarer Sancnez Bann-isler RHP Anderson Garoa Owens, LHP Juan Perez anrd Wylie on one-year contracts. Re contract of INF David Wnignt PHILADELPHIA PHILLIES-Re contract of 2B Chase Utley. SAN FRANCISCO GIANTS- RHP Joe Bateman, RHP Justin Brian' Munhall, C Guillermo Rodr Brian Buscher,. INF Jake Wald, Sandoval, OF.Clay Timpner, OF Jo and OF Brain Horwitz to the mi camp. Agreed to terms with RI Accardo, RHP Kelyn Acosta, RHP RHP Kevin Correia, RHP Brad I RHP Scott Munter, RHP Alfredo S Merkin Valdez, RHP Tyler Walke Coutlangus, LHP Noah Lowry, I Reina, LHP Jack Taschner, I Threats, C EliezerAlfonzo, C Justi INF Angel Chavez, INF Travis Ish Lance Niekro, OF Jason Ellison Lewis, OF Todd Linden, OF Dani and OF Nate Schierholtz on one tracts. - "11 - - - - - - - .- e S -~ - - - -~ .~ S ~ w - S.- ~.. - - S - - - a e * 72 -8 -7 -7 -7 -7 -7 -6 -6 -6 -6 -6 -5 -5 -5 -5 -5 -5 -5 -5 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4 -4, S-3 -3 -3 -3 -3 -3 -3' -3 -3 -3 -3 -3 -3 -3 -3 -3 ONS Agreed to RHP Kevin INF Maicer )n one-year ad to terms RHP Chad vier Herrera, aro and INF contracts. oe Blanton, es Thomas. d to terms J. Putz and conlraci of RHP Jason TENNIS Continued from Page 1B the district's premier player, Courtney Spafford, who won at No. 1 singles 6-1, 6-1 over Sonia Shah. Despite the lop- sided final score, the match featured several long, laser- like rallies, something that reappeared often in other flights. Lecanto knew Spafford would be difficult to defeat at No.. 1, but had counted on its depth further down the line-up. But it didn't emerge; the Hurricanes won four of the five singles matches, los- ing only at No. 3, where Lecanto's Lakshimi Ram beat Natasha Maggiore 6-1, 6- 1. At No. 2, Lindsey Spafford Courtney's freshman sis- ter topped Shivani Parikh 6-3, 6-4. That match was somewhat close, but at No. 4 and No. 5 singles the meet turned in Citrus' favor. At No. 4, Jennifer Parker rallied after losing 6-2 in the first set to defeat Tracy Grady 7-6 (7-5 in the tiebreaker), 6-4, and at No. 5, Jordan Connor overcame a 7- 6: (7-4 tiebreaker) loss in the first set to win the next two, 6-4, 6-3. In the first doubles match, the.. Spafford sisters over- whelmed Shah and Parikh 6- 4, 6-0, but the second doubles went three sets before Lecanto's Ram and Grady defeated Citrus' Jordan Connor and Ashton Connor 6-2, 2-6, 6-3., "The girls were battlers today," said Connor. "I'm very proud of them." If that attitude can be sus- tained, Lecanto's streak of nine-straight district crowns will be in serious jeopardy. Lecanto boys roll past Citrus The Panthers got wins in all five singles matches to remain unbeaten with an easy 6-1 tri- umph at Citrus Thursday. Matt Tringali got things started for the Panthers with a 6-1, 6-2 victory over Citrus' Charlie Hendrick. Tommy Saltsman beat Lars Olsen 6-1, 6-2 at No. 2; LFTin agNG ag s '"il.,i :, Continued from Page lB HP Edgar Citrus alez RHP RHP Mike First-year coach T.D. Haines oug Slaten, knows the successes the program airston, INF y, OF Luis he inherits from Jonny Bishop has oyie Hill, c enjoyed. He just hopes to keep it der on one- acts of RHP going. Valverde. "I think we've got a really strong terms with season ahead of us," Haines said uertz, RHP eyer, LHP prior to the team's Black and Gold isma, RHP Meet last Wednesday, an edeno, INF intrasquad scrimmage that doubles on one-year as a fundraiser for the program. i terms with "This is a squad that hasn't lost in contract terms with over three years." Sergio Mitre The Hurricanes graduated six the contract members of last year's team that named Todd qualified for a state meet, including r marketing. Chronicle Lifter of the Year Chadd I on a one- Malone, but several return who terms with should be competitive. Diaz, RHP OF Xavier Curtis Neumann is the only /eSchmoll, returning lifter with state-level. Hemandez, experience and the senior will be a Bartolome e INF Jeff force in the 139-lbs. class again RHP Bran, this year. RHP Mitch Other top lifters Haines pinpoint- Bnewed the ed were juniors Doug Connors ewed the (238) and Ryan Loggins (219), renewed the saying that the two have been the -Assigned main leaders on the team. Loggins kguez, INF won a county championship last INF .Pablo year. ohn Bowker inor league Kevin Lewis also returns at 139 HP Jeremy after winning his division at the Maet Cain' county meet last season. Hennessey, 3imon, RHP Nick Tarr (199), Geoff Blotz r, LHP Jdn (154) and Brian Moore (219) are LHP Jesus LHP Erick newcomers that should contribute n Knoedler, to the team. hikawa,OF Fred The kids have a great attitude," el Ortmeier Haines said. "My main goal is four i-year con- us to improve and have fun. Any success we can taste, we'll take." Crystal River Although they suffered a 47-34 setback in their first match against Lecanto, Pirates coach Charles Brooks is extremely optimistic about the season. S "We're going to be good," Brooks said. "Every kid has been coming to the weight room. We're building the competitive juices and building that edge right now." -" Like Citrus, Crystal River loses a top-flight talent in Joel Vasquez, who finished 3rd in Class 1A in the 183-lbs. division of the FHSAA J state championships. Unlike the S Hurricanes, the Pirates didn't lose anyone else of note and return a few significant pieces of last year's team. Cory Edwards (119), John Seffem (183), Chris Fleming (154) and Jason Crowe (169) are the top retumees and are joined by Justin Rolph (154), Wes Lanier (169) and Ryan Dunn topped Brad Davies 6-1, 5-7, 6-2 at No. 3; Eric Fields, bested Kris Blasel 6-2, 6- 3 at No. 4; and Yogesh Gandhi stopped Kyle Klauder 6-2, 6-1 at No. 5. Tringali and Saltsman were 8- ,5 victors over Hendrick and Olsen in the first doubles, but the Hurricanes' Klauder and Davies emerged with an 8-7 (7-3 ,in the tiebreaker) win in the sec- ond doubles. Crystal River boys blast Dunnellon Can't get better than a sweep, and that's just what Crystal River got in its District 2A-5 meet against Dunnellon Thursday. The Pirates' 7-0 win was paced by Brian deMontfort's 8-0 win at No. 1 singles, and his combining with Jake Noland to beat Julian Jacobs and Alex Conley 8-0 at the top doubles spot. Noland topped Andre Whyne 8-0 at No. 2 singles, Mike Sanchez got an 8-2 win over Courtney Grant at No. 3, and both Jake Noland at No. 4 and J.D. Talley at No. 5 were 8- 0 winners over Dunnellon's Sean Anderson (No. 4) and Nick Indelicati. Josh Noland and Sanchez beat Javier Campos and. Matthew Smith at the second doubles spot, 8-1, as Crystal River improved to 5-1-1. Crystal River girls sweep Dunnellon The Pirates had few problems against Dunnellon Thursday, los- ing just six games in their meet as they improved to 2-4 overall, 2-3 inr District 2A-5. In singles, Jillian DeRevere beat Heaven Mitchell 8-5 at No. 1; Kristen Hall topped Arlene Lepin 8-1 at No. 2; Kaycee Hutchins won 8-0 at No. 3 over Scandi Pena; Alisha Rhodes stopped Deanna Cazalbro 8-0 at No. 4; and Alma Cordero bested Jennifer Stees 8-0 at No. 5. DeRevere and Hutchins, at first doubles against Mitchell and Pena, and Hall and Rhodes, at second doubles against Cazalbro and Stees, were win- ners for Crystal River by 8-0 margins. Frank and Aaron Laga, who com- pete at 154 and 119 respectively. ' Other lifters that have a chance to'mak6 an impact are Jlohn Koney (119), Kenny Haviland (129) and Matt Sims (199). One of Crystal River's biggest assets may be the depth that it possesses. At several classes, the Pirates have two or three lifters. Dunnellon The Tigers can be described in one word young. Kent Maugeri, a first-year coach for Dunnellon, knows that his squad has its work cut out for it but has set reason- able goals. "Our goal is qualifying at least one to the state meet," Maugeri said. "If we could qualify at least five to the 2nd sectional, that would be great." The Tigers have nowhere to go but up after not qualifying a single lifter for last year's state meet in Gainesville. "We're really young," Maugeri said. "At this point, we're just trying to get stronger." At present, Maugeri said that Josh Dodge (a junior lifting at unlimited), Joey Casper (129) and Justin Peacock (139) look to be his top lifters. S Lecanto One goal is already out ,of the way for the Panthers after knock- ing off Crystal River in both teams' first meet. Regardless, Lecanto has bigger goals than that. "We want to try to win the coun- ty championship if we can," said Panthers coach Ron Allan. If that's to be so, Lecanto will need a host of new lifters to grow up and get stronger quickly. Seniors Stan Kruslicky (183) and Andrew Hoffman (238) are the only notable lifters to return from last year's team. According to Allan, both have a shot to be state quali- fiers but Kruslicky could go further. "Stan's got a pretty good chance to go to state and possibly place," Allan said. Kyle Ellis was set to lift last sea- son before injuries put those plans on the shelf but the senior will be ready to go for the Panthers at 199. Alan Paz, another senior, will lift at 169. Ellis and Paz each took first place against Crystal River. Newcomers who should chip in include sophomore Larry Shimmell (119), Mike Richardson (at either 129 or 139) and Ben Ford, a junior lifting at 154:; .. . ." "One of the things I've been try-. ing to tell the kids is you want to not only do well at meets but you want to improve yourself every week." -Copyrighted Material Syndicated Content -"- %Available from Commercial News Provider a - - - JITRUS UOUNIY (rLj (,HKUNI(-Lb FiuDAY, MARCH , 2006 3B ,-o .STP0rT 8 - - - . qb 4 sasecA. -a a. aa.~ I - - S. * 0A a --a. S 1b 1m - a. a- S a-. a b.-- - - a -~ a- 0 a. a- a. a * a a.. a.- a * a-- a- ~a a'- a- a a. a. a. a -quo 4w - iA!~vaiia a. -mm a a - a 0 0 a. -a a-a a a 11 q aw t.0S 0-- a a --Nw -- .* a * ae a a ae o ZO -4Ta atERWN -a. a a--a - -a -a ow - mml- 0 M aII. aw a - - a- a. a- - ~ ., a. a. ~ r... . - 0 * a. a a a a a-a a a a. a.- ~- - a - a- . o* - a.. a -- a. - a 4IA. 4m- - '-a - a.- a. - a a a. - a a a. a 40 me ~ ? :~~3 a. 4 p WAIM - a - - --- a - -- b.-' a. - --Now 49b.a Go .01oa a a a a. gaa. __am_____ .00- -~1 MW- a. a.- - a -0 41D.. L 4b.- db "W- .....wgoa - _..O0. aglo ab t. AD __10- U -Da"D do. -- -' W a ew OSIIM0-aiom 10 f -Aft qW.401. ew4- fa a aw 0 "- 4IN ____ -0-10-o 0 ft qW a p"I" aft 0ans a nw- Ako- 11- M 11 -M -000 Go 0u- MI- MNO lb- .101 om snw-40 OW-00. MMa - Op a. 4a. I 0104a _MM 10_W __ AU MM MW- lo MW -400 a a -ao_.u . -am 0 a. -p*Ma.d*f am- a p 5 a. -a 1. 10* w, 00-lb a a a W aw am Maqggpoo 60 Im 4a ____ a..-MW a, .I,- ~ -a yrdightid CMaterilt ble fo 'Co mriaNws -vies 0* -% a. IWO, -0 -doo. - em q a m- sowd 40- u bsiem-me a.m age4D -p t ab a-l a.mie- .- -ot am a-.an a W.0 a. mma.a- a. 0 4 40mo ONISOW -W - 400 4amm mam, aim 4 41W saw, msa a - a. 4a-a p a a so sm om ma -41 100- soma 410 sm-am mU " pa40 f a a-m 441 40001, W, 4W 4"0ab am am O a. -mmq amm w o- 4bm-wm INDan a.a a - a. - q:mE~, a. a-a - a. a a- a--a. a a a. a- a. --a- a. -- a.- - a - a. - - -- a - a ~mm a a..- ~.a. a. a a-- ~ a.. - - a 0 -d~ mom- -mm mm U - WN1- ob aa. W aM Goo& -ab a a a 4m W -b do mum dw - a -0 spft4m a.l I -a -~ a a--a ~ a - a.-. -a a. a - * a- -. - -a a a a- a - a- ___ -a. .au~ a- a-- a-- ~-a a-- a a.- ~ a-a a. .- a a-' - a -. - a a a -a- a a- - * a a' S-a - a a- a. - a. W a S -- a- 4wm bal om . S-d qw MNIMa-mam4m 4D w w M a40* o So- w Slw.10 ft ob qw 4M-a a l~mm aw. .Qw -a 4b- -e--m b a- am twmw q.0O- quo -.dm a- a * am 4 4 -4 aw 4 40 o 400- 44M a a p *w smos ow "mom a 40b a aw t ab- 0oo, 4u. 40b 400 4 41b 4hoa. a0wa a * * * --' O * -a -. a. at Inverness Golf & Country Club 3150 S. Country Club Dr., Inverness 7:0-'il? Trohie -a a a - - a - a. -a. -- a..a --ow -4M .90 -a . a a. a. - a'.- a - a- a-- -a - - a -a a a. a - a.. a- -- -. .ilpmosassa Flats RedfIsh, T rout, and many more. ______n __ Captain Paul Barker- Owner . ,'$OFCFe Winds FishinS Guide l?.63 Homosassa Springs FLA34447 1 .^. 1| 1st Booking :L'Pfhone: 352-228-2231 -l >F. iLe /06 Fuyl - corn 66592 * S -- a a - a -a - * a. *a .low b a S U' 'a. p. * 4 - 0 a- at a* - a1..l - S _ a a a.' qlP Ib' w m * o o o llmw, Q 0 o LI ' FAST FACT: n Nextel Cup drivers, known S as "Buschwhackers," domi L nated California by finishing in the top 11 positions in S the Busch race m ~ a FRIA-PAY MARCH 3, 2006. co m 7- -2uT 2 ~ 6"&m - .-~ C - - - aj~ ~? * * * a * a - - .. ~- . - --- a - .9. - a 4 -- 40410 *00** ** m -ea m m - tte n eme m m ep Co"pyrg hted Material .. y-n idca content Failable'.fro Pro ralalero CommercialNews'pj0 :0 -.a - -x. m - ft a __ ft-* co- p -f 0. 0 -- w a a a ft. V Q, -a "Ww -"- ---- -- - ____- -m fll&mv -. 4",w.,- U ft.- a-- GM.-- o- q. "m -n, .dOam O.to w- a .u p l - ft- an dn -- _ - a- ~ mp qa -- a 0 a 9. a a .* a 0 * a w a S a..- w a a. - - ~ a - b.om pm momo -I op a- - S. - -qtpe With Laiboxe, NPe-yu w temurna a a a - a - -- -ft -.w4b - 04 ~ A kb -to a * - 41 .- dlm Ia -now- f a. 4m a -. a-- .0 d*t- VO-* - am.- 40. M do--4p ba S - -C - a __ - a.- - *'a. a - a - -- - - a- - a -a - - a e C- .. a - a a- * .0 a-- Id- 4D a 4mm -41b ----Gom low q- op a. -.. - a. - - - - -~-. a - - - ..o. Aa. -doa- 4 -m a- mom 4 N a a a -. -N - 4b. - -M w w -o -wm 4m_ a b- a- 41 a a. mm 41b m m ~ -@-om a. a do- a - 4-D- a - a -abd -a a - ~ Sa em* a - -a a. a. -- *0- - a - am a.- - * ~ a ~ a. -~ a a a a- ~ a V _ a a ~ a ~- a a -- - * -e a a a . ~ C a ~ a S a * a *0 viders" q 4b, V 4 - a - a -- m ~ -a - a a -.m 4w o O "Ca a a a Jam a a a. a a - - a a ago wwwo Oa 6.-.-IS 40 "E * . C. a. a a~ C- a. a- ____ - 4~ -a a- -- - 9 -.9 C. - ---a - S am -- - - C ~ a. 9 - ~Tv~ -C. * ~ C * a- ~a. - vra_ 4mm O - 4 -0 - a.r - qab a- A da o * a W - a. 0 - a a a a a - 0~ 0 * a a V a * m a 1m a a- - - a * *0 O ll.I 4mJ o o o w 41=4400441 4MOV"P q, in Q 55 FRIDAY, MARCH 3, 200o6 , _ .Gopyri htedMateri a so qm f 4m m 6 0 tf 4w____mo NN.. M ..- a - -~ Available from Commercial News Pro Available from Commercial News Pro -- ~- -* a - - - r" C - - ~- ~ a a - -a. a' -w -- - - 'a a - -a -~ - -- ~0 ~ -- - a'-a p a' a'-~~ -~. - a *~ - -a - a a- a- inS - a - -e = a - S a - ~ - - a-- in- - a - 4w -4 dM- ma .11W coo -mw a-- -a *AM - - - m - ~ ~ . - - - ~- - ---u a Uo 1b %a 9 lft AN-* .0 4 -.aor -oo qw'oa -mmmem lbf- S -w 4 41b 40 40m -no a- a's 4b mp 4w *o :- a a - d.-MMM M *o vl Anne -AiD w ammom Amm - in lD so-m - 0mumomquo-d 0 a -RM O-40 g- A 4 4b . %% -mA -m.4m ss -MM A w- - No .m0-0- *on~ - go ON ob.-ow -d 4"1 4 e no 400.M 440 ON sof -t aom -p wm - v-40 aftmam=-% . - i4,a. - in MP-- lop-ow- I m -b Z* ^ a0-M--ft w.- w q d -110 1. - 4b.- - a' a'a -a a 4b 4040 aw mom-mom- am 40411 o 4w -0--S w a -- 'aME.W 'a -~4b w - - now .Mpp a' 6".o &- -~ iOw. 400.-.0 - 4'-00- 4= a'- om 400 ewa wod-a a a.b -mp -4b- ' 4w in-- dp- a - - GNP- ~ S b a The Five Star Edition of the Carrier Infinity"I System is the world's first self-monitoring re.ldential air conditioning system. Designed and programmed to run a daily diagnostic check, It actually adjusts Itself to maintain maximum efficilercy. You stay cooler, drier and save money. You also get the best limited C.* 'CS warranties* In the business plus Purons, the environmentally sound refrigerant. Get a S1,200 Coal Cash instantly when you call Senica. your Carrier Factory Authorized Dealer and replace your old air conditioner with a new, two-speed Five Star Edition of the Infinity" System. Smart olair conditioner. Smart deal. * 100% Satisfaction Guaranteed 0 10 Year Rust Through Guarantee a 25% Minimum Cooling & Heating Cost Savings i 10 Year UghtrJng Protection Guarantee * 10 Year Factory Pans & Labor Guarantee 30 Times More Moisture Removal Ask Abo HYRII )Ut oduelyv Carrier Focory Tomne & Cetr.ngkoda. I J $ fm .,. ".00 Crystal River 352-795-9685 Dunnellon 352-489-9686 Toll Free 877-489-9686 Turn to the E perns milliluillua;alill..... ,en All Services Performed With Today's Manufacturers Recommended Cleaners, Fluids & Conditioners We Will Honor AnyOther ServiceCoupon 11 1 11 1g 1 gm =g. 1m =11 m 111= = m m .=== =. m =m=.. m ..=mm = =m.= =11 ===1 OMBO PAAGE unN 27 Polr n E RENTAL WILD CARD DISCOUNT l27ou mt i l = How many times have you seen an advertised discount for A !_ im N1 S ENI PFEIE something you don't need? Or you need something but can't includes: IwVm findton a discount? Well, this coupon is for you. You decide Lube, Oil & what service you want done th Filter hangeU .Factory TrainedTechnicians wil perform a 27 Point Venice One Day FREE rental car* with any and we wdi youthe aRotate All Inspection anat no charge lu you These Technicians will conduct ne E rena car wit any1 % dO Four Tires a an analysis using the latest electronic equipment and will Sservice or repair of $299.99 or more I EGU PRI R.O. Labor Parts i Brake Inspection provide you with a wntten report of your vehicle's condition. This BY APPOINTMENT ONLY i REGULAR PRICE lu. .[, T E- ,, .Iu, oTM a ,, ..Es;.: T i lD,,'i,, lfe, service is absolutely FREE, and there is no obligallon to buy anyn , r Y P Iem shpa - -_ I *flu o ir, :,n:,u,,:,r ,u.o i 3 r inM, suggested service. "Up to a28 W0 pr d.ay ,Plus tax Plase call anead to reserve ycur rental ca Cannot De combined wwan any other offer. Must present coupon when order vaji. l, i lryvi C l errDre6 Jellxaions E1i.31 ulpriniuplr. rinoidi :arl.-nitna l Crcl Cal l Cry.:l-r Cr roe Cnrysi M 'Fi pre ,n cupo r,renar orrier .3 n nen 'alla l a C l Criaw Crer i S ri en o alone previous clna es or wllh any oier coupons or Docge Jeap loCctpp",r.EbresM E 3lluo Cr Ddg J Cr,,y er Drog i Jep loIcallori Epires a3/.3 16 l res 3l 311 Dodge eep on W m m a ULM m m mmmm m mmmmmmn g.,, .; CHEVROLET __ CHEVROLET 1035 S. Suncoast Blvd.- *Homosas-ssa 2209 HWY. 44 WEST INVRNESS S(352) Ss 795-1515 (352637-5050 a. GmmOM41- 40.-am-1M. Ua 0w .10 *--m cw- 4 w- 11lo f 40400b a dme m 4w -0 ---gab am - iimm.40-wao 490 4w 400 -a -.f cw-- MID-wIM mw--mm 9- -ft4 am -a, aw-0- 8GE - So -b o -sif Ow0 0100-*owco M-N O 4 0Ow 40 GO- f. vf iders"NMP4000 an-gp 4 __w cm 4WD m ao bomf w" *law ftoo4m-Mon oft f AW*S -a 40- 111f-- Qua 400 .c- 0- - -W do-* lb - . - --Syndicated Content ^- -7 -- S 'a a - - in = . a'- -a a' a' , , v ; t '. I t 'i k I I I, I,, Ml Cimus CouNTY (FL) CHRoNrcLE C T p rg' Get jl 1200 Cool Cash On The World's St-nartest Air Conditioner! Ell I 0 - - qm -Webb -0 ob Qft %a- MARCH 3, 2006 - - .- . . .,- .. .t - Time to explore the berries CHERI HARRIS charris@chronicleonline.com Chronicle This weekend, come celebrate what could be one of the most popular veg- etables ever. That's right. Strawberries are techni- cally vegetables. According to Wikipedia, the flesh of a strawberry is a vegetable, and the seeds are the fruits. At the 19th annual Floral City Strawberry Festival, you can decide if, that changes how you feel about them by eating them over shortcake, dunked in chocolate or buying them by the flat to take home and experiment with. Strawberry shortcake is one of the most popular treats for sale at the Floral City Strawberry Festival. The 19th annual Floral City Strawberry Festival is this weekend at Floral Park. Hours are 9 a.m. to 5 p.m. Saturday and 9 a.m. to 4 p.m. Sunday. Floral Park is off U.S. 41 in Floral City. Admission is $2 each. For informa- tion, call 726-2801. DAVE SIGLER/Chronicle File 'Miracle Worker' to play at ACT 0..^.* ..rs. P iA'., kphan@chronicleonline.com Clron icle One of the most %well-loved and poignant sto- ries comes to the local stage as "The Miracle Worker" debuts at the Art Center Theatre next week. The award-winuining William Gibson play cen- ter, on the youngerr years of renowned disabled advocate Helen Keller Keller was struck blind and (leaf in early infancy in 1880s Alabama. Keller grew up to be a somewhat difficult child who tried the patience ot all around her. Things change tfor Keller when her parents WHAT: hire a young teacher. "Miracle Annie Sullivan. who Worker" play. despite the reservations WHEN: March of Keller's family, perse- 10 to March veres to teach and ulti- 26. 7:30 p.m. mately lo\e her young Friday and pupil. Saturday and "This play gives the 2 p.m. audience a true cathartic Sunday. 2 experience," director Jeff p.m. matinee Collom said. "'It can make March 18. people cr'." WHERE: Citrus The play w\as both a County Art Broadway and film hit, League garnering Academy Theatre, 2644 Awards forfilmr stars N. Annapolis Patty Duke and Anne Blvd., Bancroft. Hernando. Collom said that people COST: Tickets \tere originally reluctant are $15 to produce the play local- ly because of its complex E GET INFO: staging A short visit to Call] 46 606. rehearsal recently revealed that the fears ha e been quieted down, considering that the two-story set has come together quite nicely. After the fears of set design were laid to rest, Collom faced the daunting task of casting the play. which hinges on the talent of its two lead actresses. With 27-.ear-old Laura Radecki play- ing Anrnie Sullivan and 15-year-old Marina Siegel as Helen Keller. Collom has great confi- dence that the play will be a success Please see A, j/Page 2C .--. .--.- : -- . .- .. :.-.. --., .. :;- . -....v- .. ... -: -. ..- .'.,,_ .,.-.a Cn ,,-- --.-. . The Citrus County Chamber of Commerce hosts the festival. Suzanne Clemente, the Chamber's event coordi- nator, said that last year, visitors bought 1,235 flats of strawberries at the festi- val. Each flat holds 12 pints, which means Suzanne 14,820 pints of straw- berries went to good said this homes. With a weekend wait for forecast calling or r warm weather and should b sunny skies, Clemente expects strawberry becau sales to be even better passen- this year. paSseng Other festival high- will be a lights include an arts and crafts show, more food vendors, chil- dren's activities and live entertain- ment . Clemente said arts and crafts ven- dors have reserved every space avail- able at the festival, so she expects more than 150 of them at the event There should be plenty of strawber- ( c I tE c ry-inspired crafts, because Clemente said all craft vendors are encouraged to carry items with that theme. Other types of crafts for sale will include hand-painted items, jewelry, beadwork and glass- Clemente work. Clemente said many year the vendors will have great food for sale shuttles from barbecue, kettle corn, blooming onions e shorter and funnel cakes to hamburgers and hot se 44 dogs. She said many non- er buses profit groups will sell available, food items as valuable. fundraisers. Entertainment at the festival includes plenty of live music and the Little Miss and Miss Strawberry Princess pag- eants. The pageants start at 9 a.m. Saturday. Clemente said that the Citrus Please see EXPLORE/Page.8C * wtflAinfls~ -ainn*.flS Citrus Memorial salutes community Special to the Chronicle After successful debut in 2005, Citrus Memorial's "Salute to Our Community" event will return this year with two days of activities and entertainment. The second annual celebration features something for everyone on Sunday, April 2, and Monday, April 3. Start off with the Car Show: Sunday's activities begin at 11:30 a.m. on the grounds of the Curtis Peterson Auiditorium, The second annual celebration features something for everyone on Sunday, April 2, and Monday, April 3. when the gates open for the Classic Car and Corvette Show, with competition in several categories. Registration is $10 per vehicle, but free with the purchase of two tickets to the concert in the Auditorium. Entrants may register until 1 p.m., and judging ends at 4:30 p.m. Admission is free for specta- tors. Great harmonies in concert: Also on Sunday, April 2, you can treat yourself to some great music from the good ol' days, when The Lettermen, featur- ing Jay Traynor of The Americans, will perform at 2 and 6 p.m. in Curtis Peterson Auditorium. See The- Lettermen founder Tony Buttala perform some favorites with Donovan Tea and Mark Preston, who joined the group in 1984. Buttala said he is proud that The Lettermen group has been part of Americana for more than 45 years, singing good, quality and positive harmony music that the whole family can enjoy. Tickets for general seating are $20, and reserved area tick- ets are $25. The Lettermen are inductees of the Vocal Group Hall of Fame and had the Top 10 hits "When I Fall in Love," "Hurts so Bad," "The Way You Look Tonight" and "Goin' Out of My Head / Can't Take My Eyes Off of You," among many others. There are many convenient ticket sale locations: Allen Ridge Diagnostic Imaging Center; Allen Ridge Family Please see SALUTE/Page 8C Khuong Phan KINGDOM KHUONG How bad is bad? Oh, it's that most glori- ous time of year again, where movie buffs like myself can stand up and rejoice. It's Oscar time,,the-mother lode of all awards ceremonies. . Sure, the whole event is a bit trivial why we focus so intently on what's being worn on the red carpet is beyond me but it's also a splash of fun. (Jack Palance doing one-armed push-ups. c'mon, that's classic.) I've got to admit I decided that I've had my to view moments of disdain the other with the Academy end of the of Motion Picture spectrum. Arts and Sciences in the past. The whole endeavor does seem quite arbitrary. I mean, how can Martin Scorsese be over- looked constantly (he's been nominated for Best Director five times) and guys like James Cameron wvin? With this in my mind. I'd have to admit that the Academy has a strong lineup this year with Best Picture nominees "Brokeback Mountain," "Capote,". "Crash," "Good Nieht. and Good Luck" and "Munich." Being open-minded, a bit of a freethinker and, well, a complete idiot, I decided to view the other end of the spectrum. So in the spirit of celebrating the best films of 2005, I decided to rent some of the critically reviewed worst Really, how bad is bad? "Dukes oftHazzard" They said it first: "It's. every bit as bad as you thought it'd be. Only worse." Eleanor Ringel Gillespie, Atlanta Journal-Constitution Cast: Johnny Knoxville, Seann William Scott, Jessica Simpson, Burt Reynolds and Willie Nelson. Plot Plot? What's that? The big-screen edition of the wildly popular, southern- fried TV show focuses on the Duke cousins, Luke (Scott) anc Bo (Knoxville), their smoking hot cousin Daisy (Simpson) and their rocking' ride, the General Lee. Why this won't be at the Oscar' ceremony: Let me preface by saying that I loved the original TV show, so I was kind of looking for- ward to seeing this movie. Yeah, I actually regretted seeing this movie more than the time I ate that 27-hour- old fish sandwich I found in my car. Considering the subject matter, this movie could have at least been fun, but it's so boring, that I actually considered getting a jump on my tax return or being punched in the face continu- ously. oDespite her overwhelm- ing hotness, Jessica Simpson should limit her acting roles to selling pizza. Notable performance: ,Willie Nelson is great as Uncle Jesse. I love this man. Mamas may not want their sons to grow up to be cow- boys, but daddies sure hope that their boys grow up to be as cool as Willie. Remotely redeemable Please see KINGDOM/Page 2C CATHY KAPULKA hCr.r.:,n.:.- Marina Siegel plays Helen Keller, floor, Chris Wilson plays Capt. Keller, left, and Dolores Elwood plays Aunt Ev on Tuesday, as they rehearse a scene from 'The Miracle Worker' at Art Center Theatre in Hernando. WMIlls AM, PRO VSM CITRUS COUNTY (FL) CHRONICLE MIARCH 3, 200UU()lmii KINGDOM Continued from Page 1C. aspect: The General Lee, a bright orange, '69 Dodge Charger with a Hemi engine. Enough said. How I may try to pass this off in intelligent conversation: "The Dukes are truly renais- sance men of the greatest Appalachian pedigree. Their anti-hero antics align so suc- cinctly with the class struggle that bogs down all of America. Oh yeah, Skynyrd rules!!" "Stealth" They said it first: "I can therefore recommend it to any and all audiences lacking higher brain functions. Sea cucumbers, perhaps." Ty Burr, Boston Globe Cast: Josh Lucas, Jessic.1 Biel and Jamie Foxx. Plot: An experimental, high- ly intelligent robot warplane goes crazy, blah, blah, blah. Basically, it's an excuse to blow stuff up. Why this won't be at the Oscar ceremony. This movie made me angry because I had actually wasted money on it You know you've made a bad robot movie when it makes 1986's "Short Circuit" look as magnificent as "Raging Bull." The worst part about this movie is how hard it tries to be cool. It's insulting. It's the ulti- mate look-at-me kid you knew in high school who everyone thought was lame and laughed at It was directed by Rob Cohen, the same guy who over- saw such films as "XXX" and "The Fast and the Furious," which begs the question: how does this guy keep getting work? ' Considering it's status as a supposed summer blockbuster, the special effects were not that great. I don't know if it's just me, but this CGI thing is getting way out of hand. I miss the good old "Star Wars" days when people built models. No matter how much they spend on computers, the objects they render still look fake. Notable performance: Sam Shepard has a supporting role, and he's the kind of actor that can brighten up any film. (You might remember him as Chuck Yeager in "The Right Stuff.") With that said, this Pulitzer Prize-winning playwright drowns when he's forced in this movie to deliver some ter- ribly crafted lines. Remotely redeemable aspect: Jessica Biel wears a bikini. (I know, I know, that was a bit misogynistic, but let's face it, that girl is hot) How I may try to pass this off in intelligent conversation: "The current state of advanc- ing technology portends of a grim future. How so, you ask? Man's continued need to rely on machines may ultimately be his undoing. Why? Because despite any of Asimov's laws of robotics, them mechanical dudes can go crazy." "The Man" They said it first: "Did Samuel L. Jackson have to re- roof his house or something? Why else would he breeze through this piece of junk?" - E! Online Cast: Samuel L. Jackson and Eugene Levy. Plot: Eugene Levy is a dental. supply salesman from Wisconsin who gets mistaken for ATF agent Samuel L. Jackson during a botched weapons buy. Seriously, that's the plot. Why this won't be at the Oscar ceremony: I actually feel asleep during this movie, and regretted waking up. I couldn't actually come up with any reason as to why this "buddy" movie should've been made. It was totally pointless. Notable performance: Jack- son's appearance in this film is only notable because there is no reason why he needs to be there. In my opinion, Jackson is one of the most gifted and, surely, one of the coolest actors around, yet he must be behind on his mortgage or is support- ing three families or some- thing. The man has a body of work that elevates him to a much higher standing, yet he takes any role they throw at him. He's actually attached to seven projects in 2006 alone! .I have this theory that be- cause he works so much, you don't really notice that he's been in so many bad films. He's so awesome in "Pulp Fiction," "The Negotiator" and "The Red Violin," that you forget he was in "S.WAT." and "Formula 51." Remotely redeemable aspect: Urn... at approximately 80 minutes, it was the shortest movie I saw. How I may try to pass this off in intelligent conversation: '"The Man' is really an allegory of the state of race relations in this country. It prevails because it shows that maybe, if the situations we find our- selves in are dire enough, i.e., European gun-runners are hunting us down, then we can bridge the differences." "Deuce Bigalow: European Gigolo" They said it first: "Speaking in my official capacity as a Pulitzer Prize winner, Mr. Schneider, your movie sucks." - Roger Ebert, Chicago Sun- Times Cast: Rob Schneider, Eddie Griffin. Plot: Someone's been mur- dering European gigolos and pimp T.J. has been accused of the crimes. Retired gigolo Deuce Bigalow travels to Amsterdam to help out his old friend. Basically,, if you have seen the first "Deuce Bigalow," you've seen the second one. Everything is pretty much the same including the jokes - save the fact that the story is set in Europe. (I'm sure that "Deuce Bigalow: Arctic Circle Gigolo" is in the works. Hey, Inuit women need loving, too.) Why this won't be at the Oscar ceremony: This com- pletely tasteless. movie was panned by everyone and topped just about every "Worst of" list. It's really one of the stu- pidest movies I've ever seen. Notable performance: Eddie Griffin is hilarious in this movie. He gets subjected to some of the worst indignities I have ever seen (he actually eats French fries out of a toi- let), and the whole time he had me in hysterics. Remotely redeemable aspect: I actually found this movie to be the most enjoyable one of the lot. You don't come into this movie expecting "Casablanca," .so the sopho- moric, scatological humor can be quite funny. Then again, I'm a frat guy who actually travels with a copy of "Harold and Kumar Go to White Castle" in his carry-on luggage. How I may try to pass this off in intelligent conversation: I'd have a better chance of becom- ing a white, female gymnast than making anything smart out of this. If there's one thing I learned through this experience, it's that making a good movie is harder than it looks, and this;is the reason why we should cele- brate the fine films that came out this year. The other thing I've realized is that because of these bad films, I've wasted seven hours of life, time that could've been spent on more industrious things like cleaning my apart- ment, volunteering for charity, getting my moles checked or finally finishing my time machine. (As soon as I can afford a DeLorean, I'll be head- ing back to 1985.) KhuongPhan, Chronicle reporter, can be reached at kphan@chronicleonline.com. Out.& ABOUT Car & Truck Show Citrus County Cruisers present the 22nd Manatee Car & Truck Show at Crystal Chevrolet in Crystal River on Sunday. Judged Show Top 50 Plus Awards, Plus Best Of Show Car, Best Of Show Truck, Best Paint, Best Engine and more. Event Photo & Dash Plaques to first 125 registered, Club Participation-Plaque Plus $100' Pre-81 Antiques, Customs, Trucks, Street Rods. There will be '50s and '60s music, 50/50, door prizes, a Chinese Auction, Valve Cover Racing and Muffler Rap Contest. Registration is from 8 a.m. to noon, awards at 3 p.m. Motor/Cash raffle drawing at 3 p.m. Registration day of show $15. For information, call Jim at (352) 621-7572 or Len at (352) 341- 0447. Fax: (352) 637-5420. Email: len@codella.com.. Corvette show Mark your calendar for Saturday, March 25. That's the day when more than 400 Corvettes will con- verge on Citrus County for the "Corvettes in the Sunshine IIl" all Corvette show, sponsored by Crystal Chevrolet. Door prizes, $500 to Best of Show, thousands of dollars that go to the top three Corvettes in each class ($100 to each of the first-eplace 'Vettes, $50 to each of the second place 'Vettes, $25 to each of the third- place 'Vettes), $100 each to the two clubs with the most participa- tion and lots of beautiful trophies. Vendors will be on hand with chrome items, "go faster" goodies, food and much more. Here are just some of the great highlights: Elvis will be here an awe- some performer.' Friday evening reception buf- fet at our host hotel. The beautiful Hooter's Girls will grace even the best Corvettes. Log onto s.com for full information and an application form that you can download. Need to speak with someone? Contact Harry Cooper by e-mail at citruscorvettes@hot- mail.com or call at (352) 637-2917. On STAGE 'On Golden Pond' Playhouse 19's production of "On Golden Pond" will run to Sunday. The show is being direct- ed by Jim Davis and stars, Curtis Rich, Vangie Rich, Lisa Stocker, Joseph Drew, Dennis Love and Aaron Johnston as Billy. Playhouse 19 is at 865 North ulti- mate triumphs of life, love and fam- ily. For more information and tickets, call the box office at 563-1333. 'Butterflies Are Free' "Butterflies Are Free," a play by Leonard Gershe, will be presented at Playhouse 19 from March 23 through April 9. Peter Abrams directs this two act comedy-drama. The story centers around Don Baker, a young aspiring songwriter who has left home and an overpro- tective mother for a shabby New York apartment. His life is compli- cated by a flighty actress, Jill Tanner, who moves in next-door. The two become romantically involved, much to the disapproval of Don's mother who tries to break up the affair. Further complications arise with the arrival of Jill's, new boyfriend Ralph Austin, an.off- Broadway director. The Playhouse 19 cast features -Greg Wilker as Don, Mary Brous- sard as Jill, Pam Schreck as Mrs. Baker and Hugh Phillips as Ralph. Stage manager for the production is Jane Smith. Show times are 7:30 p.m. Thurs- days, 8 p.m. Friday and Satur- days and 2 p.m. Sunday. Tickets are $15. Call the box office at 563- 1333 for more information and reservations. Box office hours are 10 a.m. to 2 p.m. Tuesday to . Saturday. . Music 2PM to appe Dar A trio of talented musicians, con- sisting of Pete Price, Pete Henning and Mike Jurgensen, will be this month's featured act at Woodview Coffee House in Lecanto on Friday. 2PM bring their considerable musical talents to an eclectic mix of material. Mike Jurgensen, the "M" of the trio, has written award-win- ning songs. Jurgensen plays guitar. Pete Henning's guitar, bass, man- dolin and violin, add varied tonal textures. The second Pete, Pete ' Price, adds smooth guitar solos' and flourishes, as well as solid bass lines to the blend. 2PM, whose hallmark is tight instrumentation and pristine vocal harmonies, presents a repertoire ranging from Everly Brothers, the Beatles, country and western, con- temporary and original songs. All three are talented songwriters who have performed solo, as well as with other bands. Henningi and Price have played with Jon Semmes and the Florida Friends; Jurgensen and Henning with Myriad. At 7:30, Woodview's open microphone begins the evening and encourages performers of music, dance and poetry to step on stage and perform before a live audience. Shortly after 8 p.m. local singer Tom Gray will take the stage to open for the evening's featured act. 2PM will perform at 8:30 p.m. After a brief intermission, the open mike will resume. There is a $3 per person donation at the door. Coffee, tea, soft drinks and shacks are available. The coffee house at 2628 Woodview Lane in Lecanto in the Fellowship Hall of Unity Church of Citrus County opens its doors at 7 p.m. At 7:30, open mike perform- ers will present live music. OnApril 7,Armand and Angelina harmonies to the Woodview stage. In May, Woodview will feature the -music of Katelyn Hart.. Unity Church is on Woodview Lane, just off County Road 491 - near Beverly Hills. For more infor-- mation or directions, call Jim Davis at 726-9814. Rockabilly US glitzy cos- tumes. The shows are suitable for' the whole family. Please see OUT/Page 8C ACT Continued from Page 2C "This Laura is a rare find,". Collom said. "She's talented, attractive and she's inexperi- enced. She's very talented and- we're very lucky. Marina actu- ally has more experience than Laura. I first saw her as Scout in 'To Kill a Mockingbird,' but when she came here I didn't know who she was. She read with everyone else and she clearly was the best. "'They've both been wonder- ful." Radecki first appeared on the Art Center stage about a year ago. and she admitted that she came into "Miracle Worker" with a healthy bit of trepidation. "I was nervous from the beginning," she said. "Then I became terrified. I had to buck- le down and do it. Everything's been going very well. The time it took to get everything in my head was difficult, but now that it's there, we're really having a good time with it." For Siegel, acting is nothing new, but that doesn't mean that she wasn't ecstatic about earn- ing her role. "I've always wanted to have this part," she said. "It's m.v WILEILUfE PFRRK & THE HOMOSASSA CIVIC CLUB & THE CITRUS COUNTY CHRONICLE INVITE YOU TO Take a Walk Back in Time Saturday, March 4, 2006 10:00 a.m. to 4:00 p.m.n the Florida Room at Homosassa Springs Wildlife State Park's Visitor Center on U.S. 19 An annual even focusing on Homosassa's Heritage Foi mer employees and their families may register for complimentary admission on this day or by calling .. (352) 628-5343. ext 102, Monday through Fridays The public is invited to learn about the Park and its early years as an attraction as well as the history of .lHomosassa SxbibitA on the Park and Homosassa Old Photographs and albums Guest Speakerm and area residents share S memory ofs Homemasa'ma history S Take a Walk Back ain Time through the ...-' ... Park and follow the historic photo trall. 1 5th Annual Canoe-A-Thon For the benefit of the Wishing Well Center operated by Blind Americans, Inc. Saturday,April I 13.5 mile canoe trip starting at 9 a.m. Starting at Stumpknockers Restaurant on the Withlachoochee River. This event includes two nights of camping at Rainbow Springs State Park Campground. Help a blind person to enjoy an outing and help the Blind Americans, Inc. complete their building. If you can help at the event or can volunteer with pontoon or kayaks, please call. Any donation no matter how small will be appreciated. Mak chck payab !4~ IleAI to: BlKj 1ind Amer~jUicanIncp.bi6055 N U.Carl G Rs wy. en[lando FL 3444 For*moreinfomaiocal6713 K? $V F dream part. I was so excited. There were so many girls try- ing out. When they called to tell me I got the part, I screamed- and jumped over a chair." The play has posed unique challenges for its two female leads. Often the interaction between Sullivan and Keller is quite physical, and Radecki and Siegel are required to wrestle around a bit In addi- tion to the physicality, both actresses had to learn the sign language in order to keep the historical value of the play authentic. , Both actresses said that they've enjoyed the experience tremendously and have grown to be good friends. Helping the pair develop their characters further is spe- cial consultant Karen Setlowe. A local actor and playwright, Setlo\\ e first played Sullivan in 1975 and subsequently wrote an acclaimed, one-woman show titled "Teacher" Setlowe earned a Florida Fine Arts Fellowship for "Teacher" and 04(C~idKE toured for a month in Scotland acting as an ambassador between Inverness and its sis- ter city, Inverness, Scotland. "Teacher" was so popular, in fact, that there is an original copy of the script enclosed in a time capsule that was set into the cornerstone of the Citrus County Courthouse in 1979. Rounding out the cast is Cathi Schenck, Chris Wilson, Maurice St Germain, Katelyn Rodewald, Alex Williams, Howard Christ III, Dolores Elwood, David Easter, Ashley Kisner, Channing Canary, Amber Glover,. Sarah Hugget, Jean Koney and Emma Nalepa. "The Miracle Worker" opens March 10 and runs through March 26. Show times are 7:30 p.m. Friday and Saturday -nights, and 2 p.m.. Sunday. There will be a 2 p.m. Saturday matinee on March 18. Tickets are $15. The Citrus County Art League Art Center Theatre is at 2644 N. Annapolis Blvd. in Hernando. Call 746-7606. CIT RUS BAZZ SOCIETY Always Love- . Barbershop Harmony Citrus County, Fl Barbershoppers of the Barbershop Harmony Society, International "Chorus of the Highlands" For more information call Homosassa/Crystal River 382-0336 or 382- 0057 Inverness/General 726-6409 or 637-6011 2C FRIDAY, I . ....... . ....... SETqWE ^ ^ ^, -' (',,'uj..~ (,,,yxJrv (~I (5-wnve' 5i. FRSDAY, MARcH 3, 2006 3C I\I'L U IT 1W -^ A mUI CTF UI fR' Stumpknockers on the Square offers authentic Florida cuisine The rustic cuisine and casual atmosphere of Stumpknockers on the Square in downtown Inverness, just makes the mouth-watering all-you-can-eat Southern Catfish that much more enjoyable. Add that to an incredible selection of Southern desserts including Key Lime Pie, Southern Pecan Pie, Peanut Butter Pie, Florida Orange Blossom and you have a dining experience you won't soon forget. For the northern visitor, New York cheesecake is also available. When the original Stumpknockers 'State Road 200 on the Withlacoochee River - decided to expand six years ago, the option of newly restored downtown Inverness made the perfect choice for the next venture. Spacious and quaint, the restaurant invites warm, friendly conversation and the ultimate in dining experiences! A full'bar as well as charbroiled steaks, center cut pork chops and farm raised gator is enjoyed along with radio and sports TV and live stream, surround-sound. Prices range from $8.95 to $16.95 and hours are from 11 AM until 9 PM Tuesday, Wednesday, & Thursday and Sunday, staying open until 10 PM on Friday and Saturday. Stumpknockers is located at 110W. Main St. in old historic downtown Inverness. 352-726-2212. Seve Mon. Fi.til* PV Sad ichesw/Fisor oleSla P.O.F-MS. Karaoke^^^^ Eme^Krafld CSysy^T^^^ .!DELIVERY SPECIAS.AALAL Little r' !" i. I- i. b t: k c oupo Rque-. Large Deep Dish 1 Topping Pizza with 10 Wings $1149 Exp. 3/14/06 Carry Out or Delivery )Best Deal In Town! Try ourt& Ready Large Pepperoni Pizza for $5.00. Call or Visit Caesars Pizza - - - - - - - 2 Large Supreme Pizzas I includes FREE Crazy Bread w/Sauce 1 Exp. 3/14/06 Original Round Crust . Carry Out or Delivery S : China First 4 iBuffet Restaurant Features: Clean, Elegani ~10% OFF~ I I TOTAL BILL I L-- Coupon Expires 3/9/06 j ce & Quality Food Lunch Buffet Mon.-Sat. Fri. Sun. 618 S.E. Hwy. 19 11 sunday Dinner Buffet Only (352) 795-5445 S12 noon- 3:00 pm $6.99 (WEEKENDS ONLY): . Dinner Buffet A ANAT A Mon. Thurs. ALL YOU CAN EAT usy. 19 KFC 3:30 pm 9:00pm Snow CrabLeg Fri.3:3 -op Snow Crab Legs, 13 I " '3:30 prn-9:30-pm $10.99 Oy Shrimp . Sunday Oysters, Shrimp 3:30 pm 9:00. pm $10.99 W In a - LUNCH Rur? TRY, Vandervalk fine dining & Bistro Lunch is served from 10am till 5pm J- CRYSTAL RIVER INVERNESS King's Bay Shopping Center Citrus Center/Old Walmart Hwy. 19 795-1122 Hwy. 44 344-5400 WE DELIVER Limited Delivery Area, $10 Minimum Purchase V A N D E R VArL K HOTELS & RESTAURANTS Fine dining and istro We are Open 7 days a week for lunch and Dinner Happy Hour 5to 7pm -, .,'... FullLiquorBar .: Lve Music& Dance . Every Wednesdav Night 637-1140 P.. p Located on the 18th hole of Lakeside Golf Course, Hwy. 41 between Inverness and Hernando BECOME A MEMBER NOW FOR ONLY $10 " December's Denny Lynns Chosco Turner's Fish Camp * 4 I Reserve Your Space in ENTERTAINING MNOONS 563.6363 cilY ANTIPASTO GREEK TOSSED SALAD FluDAY, MARCH 3, 2006.3C I .1 CiTiusC ',"tIvn 'P/ (FLC 1 ("f.iFf)NfICl E* CITrtiS COUNTY (FL) CHRONICLw 4C FRIDAY, MARCH 3, 2006 Cedar Key Retail Specializing In The Freshest Seafood Fish Shrimp Blue Crab Scallops -Squid Octopus j Frog Legs Gift Shop ' Tues. Sat. 10-6 Sun. 12-6 37 5590 S. Boulevard Drive, Old Homosassa Welcome t: e Japanese * Chinese Thai Cuisine k ; .,.. L T, Fax 352-628-0345 628-1888 Kash n' K.R PI.,. Honos.iss, . Wine Saki *Lunch Dinn.-r ' 'akeiitl Availableo 6 '6 ,i S PARTS DISHES GLASSWARE FLATWARE B.........- RE I Ul * Schools Restaurants * Bars Day Cares Churches * Nursing Homes Clubs Are You Looking For A Local Supplier? CALL US! 621-3712, SHAFFER WHOLESALE DISTRIBUTORS, INC. 5415 W Homosossa Tr. Lecanto Located ALt.oss From Anson Ni-r'ery Monday -Frida, 7' 30 a m 4 'l I '" -.. .~1p~.,.'. T, H PPN N A H AG* Waterfront Dinina On The IM, ".S.Tigertaill" A Cnwm. .: I Youl board our brad new sightseping boat) .it.l e* .y aI relaxing cruse on tie %en mc Homosassa River. Return to our dock and be ser oa the deoltious dinner of your Choice on the HS. Tiertail, our non-smoking flat.ng dinina room with a fabulous s-ew of the river. Choose from our entire dinner menu mncludng:. Steaks, Prime Rib, Lobster, Gulf Grouper andi watiy t' ofthir e0i eFtMns. AReseratrans Reqtrfed . Dinner & A Cruise $2495 E I I II I I El I A IA A IAI II N Tues.-Thurs. I 1:30-9pm; Fri & Sat. I 1:30- I Opm; Sun. 12-9pm J ar Crrilond a Greal Frirnids Grerl Fun UNDER NEW OWNERSHIP -' Crab Rc. A -re 1, WEDNESDAY LADILis NIGHT .Bll ! ;to r. Wells I0Draft Wi 11 o,, i,,o ,,) Mon.r,,/20 6:30- pmu -, UN POWER PLAY O 8H 0ptil-. 2I lm -, _." ' S T NIiESDAY LONNAI N: LILLY Nmm e 8;:0pmi-12OL'pm /_ 1 ; BAD LITrLEi DOGGIES :0opml- 1:uit, 563-5255 2581 US 19 N 1/2 Mi N. Of Mall -Crvsta FRiver Fax 563-5275 j C Wi> '~ "I -'-4--- 14"' 'I-' rn -E V # I rTAiwsM t, tHi^g f^iv cfyrul^r cowd EVERYMONDAY S95 AVou I GROUPER can Ea o-r large out--VZ18B ourlare out l.. $25 96 door deck and "Real Sand" 'S' Beach and TiMt Bar, "5k-' 444 - it .- '14.4 -. ~t.:4z< - CENTRAL FLORIDA COMMUNITYY COLLEGE I S ,lth I'. IAI' (1-Sfl .'v1 41 S 'i ex ,tI i i"H i TIIAT'S ENTERTAINMENT! E ,At Call for our daily specials and soup of the day 563-1611 Hours: Breakfast 5:30-12:00; Lunch 1:00-4:00; Dinner 4:00-Close rw., Next to Walgreen's Hwy. 19, Crystal River ..Iw. Don't Miss The Last Performance Of This Season! Curtis Peterson Auditorium Lecanto Matinee Sunday 3:00 p.m. John Davidson March 12 Tickets available at box office window on the day of performance after 2:00pm, for unreserved seat $15" or call 746-6721 Ext. 1416 for a '17 reserved seat by March 9" ir l ,*W118 Supplies j High Speed Shuttles Departing Several Times a Day! 9:30 M, 11:00AM., :30 PM, 7:00 PM 727-848-DICE 800-464-DICE :s, $ON So mm TOKEN.Rm EE: BOARDING OR A FREE $10.00 EEM PARKING TABLE MATCH PLAY! JERFOODANDDRINKS ULmit One Coupon Per Person Per Cruise. WILE AM GI LOCATED IN POWTRICHEY. NEWX TO HOOTERS Csino reseivos the rfght to cancel, change, or revise this promotion at any ti> without notice. ' 1. Whole Maine Lobster ............$21.95 2. Surf & Turf Steak w/Shrimp..$15.95 or w/Lobster Tail.................$18.95 3. Catfish Dinner.........................$9.95 4. Crab Legs 1 lb................. $10.95 2 Ibs ...........$15.95 On Hwy. 491 in the Beverly Hills Plaza SUN. 12 NOON. 9 P.M. MON. THURS. 11 AM. 9 P.M. FRI. & SAT. 11 AM. TO 10 P.M. 746.1770 A :D )JI March 26th 'r Bring A :Covered Dish Music BN Country Swing F 2-61)m o9w A I FRIDAY, MARC 53, 2006 SC CITRUS COUNTY (FL) CHRONICLE It' al bou wtefrot0inng Crystal Kiver A ie louse Chef Lyndell's Wednesday STEAK NIGHT N.Y. Strip $10.95 Both Nights Served With Red Bliss Potatoes & Vegetable Friday & Saturday PRIME RIB $10.95 THE PORT HOTEL & MARINA 1610 S.E.Paradise Point Crystal River, FL 34429 1 1 5993 795-3111 Is ycztur rc': stcz:iLrc::rlt stc:rvir19 m~gfcDr c ij s tcz. rr-ic rs ~~~~ 5S2 b ..z F.coas) greek Itaim Seafood Steak ;Z pi Still Serving Our Early Evening Specials - Complimentary Soup ^, & Salad Bar With Entree 'i Hours: i[i Tuesday-Saturday 3.00-9:00 Sunday 11 30-8 00 ijdy 7431 S. Sunceast BlIvd., H9emossea (13512) 21-4551 G| I '.4 ni rk.-* .*.'. S,i -.11 .1-w--. capB~i Tusdegy thru suesdey Eleanid Manademy Tertiglow Bowling9, Bring The Whole Family And Enjoy 2-1 2 Hours of " Unlimited Bowling, Laser Lights, Music & Fun sSuggested SATURDAYS Laser IIDAYS Lights...Music 2 Shifls .m-:.am .. I Of Rock 300 8:15pm-10:45pm Rsmem Rd Pin $27.50/Lane ao wling 11:15pm-:45an LN I -ams Priz $25.00/LaneN MANATE, MOUSE SPECIALTIES FLORIDA GATOR FROG LEGS SHRIMP OYSTERS SPlus I, "AII You Can Eat . CATFISH 726-2212 . Also Thick Juicy Steaks 7 -, Pork Chops & Tender Chicken Breasts... All Grilled On An Open Flame. Plus Much More. *.? Large Portions At A Reasonable Price. Come & Enjoy An Authentic Florida Restaurant tMv .. "P.-remim Weli Lardarm. n # www .ri.eri s ot.coi Clo ed Mon._cf t MARTINI BAR & NIGHT CzUB' LIVE ENTERTAINMENT NIGHTLY LIVE BANDS THURSDAY, FRIDAY, SATURDAY LIVE MUSICI .~ ~ ~ ~~ ~AC 23d 24h MA25h 0t,1t EIHCTN&thEACLRTR Bob txo rsy tls&Ns MACH2n, rd 4h hrshol caSo "Chocolate Shoppe. Bo)e Denny Lynn's Fudge Factory sorted Sizes Great For Business Gifts! * Espresso * Toffee, Fudge * Cappuccino * Chai Tea Monday-Friday 10-6; Saturday 10-5; Closed Sunday 2746 N. FloridaAve. 52 7 Hernando, FL 34442 352m637m 3438 RESrAJAURANT -'0uW'IS HwY. 41 & 44 W INVERNESS I-- --1[ 1"- --- -- 2 Baked I Ziti Dinners for Must Present Coupon Expires March 3, 2006 OPEN 7 DAYS* BST 637-1355 LUNCH & DINNER \f P.S. "YOU'LL NEVER LEAVE HUNGRY" I Mexican F SPECLAUZING IN Seafood a Steaks Sandwiches Ribs Pasta Full Service Bar Lunch & Dinner 7 Days a Week I 6418 w ,m * 0. 04 a 0 0 * 0 * - ~ * 0 0 6 1~ *~. I - a * 000 - * 0 0 0 .0 ~0 = 0 0 0 p x*. s.p LI ~,W *0@0 S ~,Q ~W -' S * 0 ad z d. 3t ON &.e - 4olm aw 410- a lll u0. 41 00 so- "a* "To t 16 t*9... em,. a 0 0 c - *a C .? ~ ' B ~tv a4M 4p. - b.- . A 0L Go "(4- 4LWF 99 9T . & * 6@ S * Oe a 6@ Wa 6@ a. * a 60 * 0 * *. * 0 v %P IF I q a- fir ,1r41M71*o OD~Vriahl 00 0 .- olsDi;S :.0ndicat i AValI ab I efromC'ommei %MW ,1, W ---- %- zr r '. a *... *ago- - 6 'L see3 *0. em. . tai ted ft ICo rcia o rcialI I I 0.0 fW 195+f!IrI951 .* * 'is 0 0 tu n- I nte nt i e News Providers" * I I *mp -W -11 - Ow _w 0. ft - qbw wwo *b -ft -w qow f mom -o a 4 - -ma mo -4 0o 0. t ft. A.= a.. 40b E-- - 41. b - as do - .b-.a Ndbp 0 P te- -o -d 41b ma 5 0em 4 41D .imom -W t we da-mo 40 0 06 'P 0 *.p oa a onr 41 a o o 0 45 .t-~ .S *A 410 0. 0 4m boom - 4 o5 m q~w MAP0 I 0Lt 4 0* 0 * 0*0 * 000 * 0 @0 0 0 0e 0e ** 0 * a-..q-w 6- trw %9P w~E~UWWL lob 41410 ~ - 0 0 0 0 0 *00 0 0- 0 5 d- -45 :m.qUL -~ 0. - n - a 9-~l 1-.. * * 0. 0- 0 0 - ~ m - 0. - -~ 0. * .0 0. -~ a - 0. -00-0 0. - .45 0..~ - 0 ~ - 45 0 - 0. - 0 - a -0 - I I 0 ~. a I S K - 0 O.dN EW qft l- - -m - - 0.- - - 0. - 0 0 0 - * 0 - 0 ~ - - 'I a S. J ~tMhI 9 ' * 0 em *6 @6 ** 00 S .0 S 0 - 0 4M 0 4m Iv 19L S 9 - m* I I _ Q o o o o A Few i NO 0 ~ - S - 0 ~ S... * 00" ~. SM%- ., . ~w-~ S 0 - ab , --|J --- 9 *~* S * a * - a -5- - Gm 0 0 b S 41 mm -4000 me- 4o 0 -lo *rn ti e riahted Material 4w- U U a W *. , , b fSyondicated Contente r 'e A alb fro-n9 l N wPo r v~aila'befrom' Commercial News Providers" _-W7NWn:6 co, 4 op do~ooS 7; A A - --4 I 40 U S 0 vI?~ IAh9 0 40 'S D *1 *"Iwa* gEp 4, 0 1 40090%t 44~b *am*7duke 04M *be AM 1% -lh 4.' S* - left-- 4wmm q 4 4" 4111. 0 qu -m - a am41- -4 400M. NO. .p q 4= - - I qw 4m 4w domo 4p -ne - S S On mpq5 -% w - S-S-a S -a S - -S S - 0 - ~ S .5 -S - -5-- - S *~ - - - S - a - .5@ S a- - S -S S *- - S ~ S - - a S OS- - S ~m - -.5 - -S S -S .0 - a-S .5 ,410 uom% am -~ 0 0 -map 0 0- - S 00om- ql -- .Im -40 4m m4 -m q S --ump 4 - - .do om map I -E -.0 4b4s --EW a .- ~--am 40b5up -m * a IW do-- .0 4 -a -o-- do .Jjjjjp 0 q5- - .IM a . a - em** I * - m a 'r(WI ;3 6 F7ow ==ow MO q _ GN _oh f -ft I -- JMMMMML- I 0 dob 4im4b .. II. ----_- --- q ftw . qbdbp- qmwb ftw qP 0 4 so "o mm :1=04WMW VAs SC FRIDAY, MARCH C, UU2 0T Y1-('3H N " Arts & CRAFTS Artists on display In March the Art Center A&E Building's Main Gallery will once again pay tribute to the versatility and creative spirit of Citrus County artists. Each month participating artists bring a new work to exhibit and to entertain the viewing public. We, at the Art Center, are proud to be the vehicle for showing their outstanding work. The Main Gallery hours are Tuesday through Saturday, 1 to 4 p.m. The Art Center is located on the junction of CR486 and Annapolis Ave. near, Citrus Hills, in Hemando. East Wall Gallery The Art Center of Citrus County is pleased to announce the contin- uing exhibit of artist Douglas Prescott Murray on the East Wall Gallery through mid-April. Murray winters in Citrus County and before leaving for the summer has generously consented to extend his exhibit. Murray is extremely proficient, working realistically in a variety of mediums. He has been recognized with many awards here in Citrus County, as well as in his home state of Maine. The gallery is open 1 to 4 p.m. Tuesday to Saturday and during special events. The Art Center complex is at the comer of County Road 486 and Annapolis Avenue in Citrus Hills, Hemando. Calligraphers to meet The Creative Calligraphers of Citrus Springs will open its Thursday, March 9, meeting with a workshop by presenter Yolanda Mayhall. She will illustrate and guide the calligraphers in the ancient art of Sumi-e, a method of Japanese brush strokes. The students will use this art to. Across the LINE Folk festival The 5th Annual Orlando Folk Festival from 10:00 a.m. to 5:00 p.m. Saturday and Sunday on the grounds of the Mennello Museum of American Art, 900 E. Princeton St., Oriando. It is two days of music, funky primitive art and fine craft, food, face painting and chil- dren's art activities. It is free. Swamp Festival The 2006 Weeki Wachee ... Swamp Festival in the Park is from '`a.m. to 5 p.m. Saturday and from 9 a.m. to 4 p.m. Sunday. There is a Swamp Monster Contest and more. For informa- tion about the rules of the contest and.prizes for the winners, visit the Web site at w.wwswampfest.com. SALUTE Continued from Page 1C all branches; Citrus Memorial's SHARE Club office; Citrus Memorial Laboratory Collection Centers all locations; Citrus Primary Care physician offices all locations; Don Ross Roofing; Hot Heads Crystal River; Romano's Crystal River; SunTrust Banks all branch- es; Tangles Hair Salon & Spa Inverness. Memorial golf tournament: On Monday, golfers will take a swing at the world-famous Black Diamond Ranch quarry course in the Randall Jenkins Memorial Golf Tournament, named for one of Citrus Memorial's pioneering physi- cians. Registration for the 18- hole, scramble-format event is limited. Golf Digest rates Black Diamond's Tom Fazio- designed holes among the best in the nation. Thanks to sponsors: Proceeds from the second annual Salute to Our Community activities benefit the Citrus Memorial Health Foundation's Advancing the Vision Care for a Lifetime cap- ital campaign, which will sup- port Citrus Memorial s planned Family Care Health and Education Center. The center will provide a wide range of educational programs and healthcare services for people of all ages. Citrus Memorial thanks its major sponsors at the Diamond level the Citrus County Chronicle and the Law Offices of Buchanan Ingersoll, PC. Platinum sponsors include Blue Cross Blue Shield of Florida Inc., Robins & Morton, The St Petersburg Times and WJQB True Oldies FM. Information: For more information, call 344-6952 to inquire about the Classic Car and Corvette Show, 560-6222 for concert informa- tion or 344-6485 to learn more about the Randall Jenkins Memorial Golf Tournament. embellish their calligraphy. The group will meet from 1 to 3 p.m. at the Citrus Springs Memorial Library at 1826 Country 'Club Road, Citrus Springs. The public is welcome. For information call June Towner at 489-9717. Decorative artists The Manatee Haven Decorative, Artists is an affiliated chapter with the National Society of Decorative Painters, which was founded in 1972. Meetings are on the second Saturday monthly. The next meet- ing will be at 9:30 a.m. March 11 at the Bittner residence, 8089 W. Pine Bluff St., Crystal River. The group welcomes beginners, inter- mediate and advanced painters in all mediums to join and share in our decorative art forms. For direc- tions and information about the project, call Jan Bittner, Crystal River, at 563-6349, Bea Peterson, Ocala, at (352) 861-8567 or Katherine Goulet, Spring Hill, at (352) 596-9956. Alice Frisch will teach and in Europe. He has demonstrated, judged and conducted master classes at major London wood- EXPLORE .Continued from Page 8C Corvette Club will have a col- lection of the popular sports cars on display Saturday and some Citrus Model As club members willtdisplaytheir vin- carving shows. He retired in 1997 from teaching and now runs his own carving school. He has been Artist-in-Residence with the Woodcarvers Association, Guild of Woodcarvers and leads a number of master wood-carving classes and workshops. Peter Benson's class will be in the home of Dr. and Mrs. Shook at 1800 N. Squirrel Tree Ave., Lecanto, on March 13 to 15. Class is limited to 14 students, Students may pick to carve a polar bear or a man-in-hat project. The cost is $95 per student. For additional informa- tion, call Lyle or Marilou Shook at 527-3260. Crackers guild meets The Citrus County Crackers Guild class meeting March 15 is open to the community. Dixie Shaffer will teach a workshop fea- turing the use of UFOs on a sweat- shirt. The price for the workshop is $10 for nonmembers. Attendees will need to purchase a sweatshirt and bring other sewing supplies. The class will start at 9 a.m. at the First Baptist Church of Crystal River. Call Barb at 249-3221 or Lori at 489-7538 for more informa- tion and a supply list. Although the quilters have can- celed their quilt show in March there will still be the drawing for the guild's Florida-theme quilt. The quilt features flamingos and is paper pieced and machine quilted. The quilt proceeds benefit the Family Resource Center. Lori Wichers, the chairwoman for the quilt, is still selling tickets for the quilt. Call Wichers at 489-7538 for more information. The drawing will take place at the March 15 work- shop meeting. Attendance is not required to win the quilt. tage cars Sunday. Childhood Development Services will host an array of appealing children's activities that Clemente said will include a bounce house, a giant slide, games and prizes. There is limited free parking available at the festival and plenty of free parking with free shuttle service available at the Citrus County Fairgrounds in Inverness. "We want to strongly encour- age people to park at the fair- grounds," Clemente said. She said this year the wait for shuttles should be shorter because 44 passenger buses will be available. OUT Continued from Page 2C The next performances are two shows Saturday at the Curtis Peterson Auditorium in Lecanto, next to Lecanto High School just off County Road 491 about 2.2 miles from State Road 44. The shows are at 4 p.m. with an admis- sion of $11 plus tax for all seats, and at 6:30 p.m. admission is $13 plus tax for all seats. Information is available on the Web at or by calling (352) 400-4266. Tickets are available at the door, or advance reserved seats may be purchased at no extra charge via the Web site, by phone or at Donutown on U.S. 41 near Kmart in Inverness. The 4 p.m. show on March.4 will be a mixture of country and oldies music. The 6:30 show will feature a variety of musical styles that will include an Elvis tribute that is nor- mally performed in all the evening shows. Willfest extra day The 17th annual Will McLean Festival (Willfest) will offer an extra day of celebration. Festivities will begin Friday, March 10, with per- formances, workshops, crafts and food during the day, and the new- talent search at 7 p.m. You are invited to participate in this annual celebration of Florida at the Sertoma Ranch in the beautiful rolling hills of Hernando County, on the shores of Lake McLean. Friday will feature starter work- shops in fiddle, guitar, banjo, dul- cimer and mandolin. Saturday and Sunday will provide more advanced sessions. Amy Carol Webb will continue the series she * teaches at the University of Miami, with a session titled "Empowering Your Voice." Citrus Springs Concert Series presents The King of Comedy! Barry St. Ives March 21, 2006 11I Citrus Springs Community Center 7 p.m Tickets available at CMH Share Club $15 each For more information call 527-8002, 3446513, or 476-4242 .... .... .- Proceeds to benefit Citru. Memorial Hospital U~kONICI.E Something extraordinary is happening at Meadowcrest! It's hard to imagine life at Meado,...crest. co'ul-g e. better, buqt ,s-;on it .-ill. Enjoy relaxed maintenahnce-free living at Sum'merhill 'it Meadowcrest! Walking trails; tennis courts; a luxurious new clubhouse with sparkling pool:; witness center:; and richl.,'-appointed, .- '- spacious ne.v condominiums and to..'nhomes offer the perfect home in Cr,stal Ri.er's most Coming soon! Luxurious two and three-bedroom For Priority Reservations condominiums and townhomes in Crystal River's call: 1-800-485-5240 or most sought-after planned community. visit From the $170s. 1875 N. Macvicar Road- Crystal River; FL 34429 ORAL REPRESENTATIONS CANNOT BE RELIED UPON AS CORRECTLY STATING THE REPRESENTATIONS OF THE DEVELOPER. FOR CORRECT REPRESENTATIONS, : REFERENCE SHOULD BE MADE TO THE DOCUMENTS REQUIRED BY SECTION 718.503, FLORIDA STATUTES, TO BE FURNISHED BY THE DEVELOPER TO A BUYER OR LESSEE. .. 7,*. . *, .- .:.,- ,I ,-. .. .' ": ..' -' s *' 4 't wh,, ,. ;L-"Y ,,II' Another new event, the Saturday Morning Breakfast Club at 9 a.m. Saturday, March 11, will feature the winners from the 2005 talent search. Those planning to camp for the weekend are encouraged to arrive Thursday, March 9, and attend the "welcome home" potluck at 6:30 p.m. Will McLean died in 1990. His thousands of friends, and fans of the music he loved have gathered each year since his death to honor him and his music. In addition, they perform their own songs inspired in large measure by McLean. The festival, honoring him will continue until 5 p.m. Sunday, March 12, with music, storytelling, poetry, great food, native crafts, workshops and campfire jams. For more information, call (352) 465-7208 or visit. com. Mickey Finn Band The Mickey Finn Band will per- form at the Kiwanis Club of Homosassa Springs' annual con- cert at Curtis Peterson Auditorium on Saturday, March 11. This very popular group is well known in this area for its sold-out performances at Rock Crusher Canyon. The Mickey Finn Band does comedy, Dixieland jazz, rag- time piano, banjo music, big band, happy music, family entertainment and audience participation. The original show was at Mickey Finn's Speakeasy night club in San Diego. There was also a TV series "The Mickey Finn Show" on NBC in the summer of 1966 and there were 13 TV shows for PBS in 2002. They have produced crowd- pleasing shows for Disney, Caesar's Palace, Sea World, fairs, festivals, concerts and cruise lines. This concert is the major fundraiser of the year for the club. The proceeds from this concert will be used for the club's community service projects including the annu- al Citrus County Field Day for Key Training Center clients. Tickets will be sold in advance for $14 and at the door for $15. Tickets are available at the Citrus County AmSouth, Regions and SunTrust bank branches, Citrus County Chamber of Commerce offices and from club members. For more information, call Jack Graham at 382-5770 or Jim Harris at 382-1470. Citrus Jazz Society The Citrus Jazz Society's next jam session has been set for 1:30 p.m. Sunday, March 12, at the Loyal Order of the Moose Lodge (side entrance, please) at 1855 S. Suncoast Blvd. (U.S. 19), Homo- sassa. The location will be perma- nent due to the unavailability of the Hampton Room. The Moose Lodge is next to and just south of the Harley Davidson motorcycle dealership on the east side of U.S. 19. Drinks and light snacks are available for purchase from the lodge. Dancing is encouraged. I Cmus CouNTY (FL) CHRONICLE I S E.TvlF, m~ I I LmI Iuud LA ILI0--L- kk %K 2 ~' ~ urn *- I :u u ~ BEvERLYHILLS NEW PRU br,,ir.l ,r,.,hlr,, ':2,-' E u . al T .:r S" T,: r ,. i - - I.. large laundry rm.$149900#RPF612A $149,990 #RPF612A V NEW LISTING TERRA VISTA $359,900 Stun 212/2 villa boasts tile thnr-out incl. the den, Corian coun counter tops, dual wall oven, glass block master floor shower & enlarged laundry rm. Membership Required. room S: 2 Locations Open 7 Days A Week! Citrus Hills Office Pine Ridge Office 20 W.Norvell Bryant Hwy. 1411 Pine Ridge Blvd. Hernando,FL34442 Beverly Hills, FL 34465 352-746-0744 352-527-1820 . ,, Toll Free 888-222-0856 Toll Free 888-553-2223 .wwwIfloridashowcase S-An independently ownedand operated memberofr JIM HOFPIS REALTOR@ (352) 464-2761 4ow OPOpRTUNITY Cathi Schenck. ABR' Prudential Florida Showcase Properties IdepeideIll. ned& Ope-ated 663524 OAK RIDGE 5299,900 ning 3/2/2 home loaded with extras. Granite iters in the eat-in kitchen, raised cabinets, tile. s, split plan widen. Formal dining rm & great i, diamond brite heated pool & spa. Prudential Florida Showcase Properties eproperties.com She Prdential Real EstaterAIlates, lc. aro n WELCOME HOME is what this Beverly Hills 4/3 says to you. Numerous upgrades and meticulous maintenance invites you to "move right in." Definitely NOT a drive-by with 2208 sq. ft. of living space inside. Only $172,900. call Sherri C. Parker, GRI Broker/REALTOR .'.: 352-527-8090 or 352-206-0144 for an appointment to view this lovely home. "- 663530 Email: citrusrealtor@aol.com ,PFiiue Homes :. 8468 Erin Dr. ........... Crystal Manor ................. 1.16 acres .... $52,000 2797 Hythe Pt. ......... Canterlury Lake Estates .. .20 acre ..:.... $55,000 '/ 731 Dunbar Ln. ......... Citrus. Hills .............. ... 1.00 acre ..... $58,900 1248 Bismark St........ Presidential Estates .......... 1.00 acre ..... $62,900 ,9 *ki3W 1213 Cleveland St...... Presidential Estates .......... 1.00 acre ..... $63,900 3144 Eisenhower Ave. Presidential Estates .......... 1.00 acre ... $82,500 366 477 . SUGARMILL WOODS COMMUNITY . I Sunday, March 5* 1:00 4:00 pm 10 BEAUTIFUL HOMES r Will be open for your inspection 1G SEE OUR FULL PAGE AD IN SUNDAY'S PAPER |H k Realty One 795.244 .. .. m m u w 4 4. Il =r4 jj_1 Vz =FM rl; :4 : I =FMy;f .j ~ 0 ONE American Realty Lar Lopez ERA & Investments (352)746-3600 Office ..... < nvn (800) 843-4391 ToIl Free 4007 N. Lecanto Hwy., Beverly Hills, FL 34465 6628o OPEN HOUSE March 5 from 12:00 4:00 5371 N. MALLOWS CIRCLE BEVERLY HILLS, FL 34465 MUST SEE!! 4/2/3 on the 12th green with a 14x28 solar heated pool. There is an extra room that can be a den/office or 5th bedroom. New painted inside and out. Make your appointment today. This won't last. Home warranty included. $499,000. LGL500 2/2/1 IN SUGARMILL WOODS on large, well landscaped corner. Split plan with almost 1500 sq ft plus large screened lanai with winter windows. Garage is oversized, has workshop area & remote door opener. Paint is neutral, fresh & clean both inside & out. Only $167,900 MAINTENANCE FREE LIVING AT MEADOWCREST Enjoy The Clubhouse. Pool. Tennis Court. Shuffleboard., Walking Trail IWO VILLAS TO CHOOSE FROM ....-- GREAT FLOOR PLAN 3 bedroomrr 2 NICE 2 BEDROOM, 2 BATH win 1 car baths. oversized garage, .glassed larsa, garage in Pineriurti village Featuring split plan, dining room, living room, eat- open rloor plan, cathedral ceilings in in. kitchen, solar tube, and much more. great room and kitchen/breakfast nook. $188,500 MLS 1155434 Offered at $154,500. MLS 1155411 em63489 SSANDERSON BAY REALTY, LLC. 1724 E. RIDGELINE PATH, INVERNESS, FL 34453 PHONE/FAX 352.637.2822 CELL 352.302.1419 E-MAIL: TIMCMIiRRAI,'SANDEILRSONBAY.COIM o. house sound system. ving room has a unique build-in with a LP Gas fireplace located in the center. This home must beeen 3 buler moto be apprdel Mr toaeciated. $725,000. MLS # SBRS 0Wo years It has numerous upgrades Irrougr,- 588 N. Rudockingham Pceramoin." i Iram$250,000 lin ,g r, om B n ,d J li hhen D ri.e a. .y .alletk a y 687 N. Laarake Shenanl de:doah reLoop $187900,,er rn Game room has a built-in wet bar, game room has a built-in entertainment center/ with a BOSE entire house sound system. Living room has a unique build-in with a LP Gas fireplace located in the center. This home must be seen to be appreciated. $725,000. MLS# SBRS04 Shenandoah Estate Lots 1579 E. Ridgeline Path $219,000 588 N. Rockingham Point $250,000 687 N. Lake Shenandoah Loop $187.900 504 N. Lake Shenandoah Loop $235,500 579 N. Rockingham Point ...... $230,000 ; Sugarmill Woods Lots 77 Oak Village Blvd.................JUST REDUCED $75,000 15 Cyclamen Court East $90,000 17 Cyclamen Court East $90,000 Fairview Estates 3955 N. Indianhead Road..........JUST REDUCED $96,500 Crystal River Waterfront 11306 W. Coral Court......(Ready to Build) $259,900 Realtor' 697-3133 REALTY LEADERS Multi-Million Dollar Producer BEVERLY HILLS r, 1.al3I -. ,i ul ,l ,31 r.lr,:..m: ,ir,: rl, BEAUTIFUL OAK WOOD VILLAGE. L1; r,.:.,, Au', .. ,1 ,i lh'j ,:,.ul, j '=:. ub J 3 u <3', E r,. ,,:,'T L', r, .31: I" : ,0T el I' ,, ra: ,-,, A I C r, r.:..:. ,,, iv .ini>-,3 Ki u4ua14'r.ll.5 L..O..APED IL 10: v.e BEAUTIFUL ANDiEW HOME IN OAK RIDGE COMMUNITY BE nAUTFUL .- UPGRADES 2 BaCONDO r THROUGHOUT B ,r, Tr,,k. ,1,l ,,ir : .)^ jC a r G a r a y g F r r. A j, : ;. 1i 1 I ,' ,, .C',-, 'a !,, ,u l, C' , r/,m/,n,n ro-,ir., CTInc, plJ,.loiT,'-. 1 rai 5:- ,a,. [ ,',, , "1, ,,,: :I,' i r, ar, in K.icnen i l 6, 'Ui : -a1s a ,: I.. i F ,lO e ,:,a ,,, 1 *,,',,, ,, ,,, 2 h,',,.,,l I,,I,1 Ir , %iliag t W on i lami: ic-ro EX.4 B ,,, L- -" I., ;l : S r.A la pul," Iwl THE MORRISON BERKSHIRE MODEL ,- A e,.p rly. de-oraled anrd sure ,3 please odur buye~r. 2 Dedroorms and a den r. .i p-,cketi doors, could be used as trir. bedroom, caged pool with ,.cry nice lanai and private lfre lned Da'ac'aard Triis home is loaded with extras #EX940RB LOTS Excellent lot, approx. .30 acre in very desirab e .area o Crrrus S o n"'- ig a. l .a i.ii is 1 si.o for sale. See alt key 1432421. The lots together w:.u-l.i E apo'x 7,:, a.:' acr.I i.s 545.000. Excellent lot, approx. .40 acres in very desiraie eaa of CiBfC ru SCpi-Aq. ",3lacer.a i-i t 6 alt o i ior sale. See alt. key 1432430. The 2 lots together w:,ula, (.m apprc.4 711 ac, .: Each lot is $45,000. Beautiful 1.16 acre lot. Pine Ridge. $124,900 6aul.rui" CIruI-u H.I i a 1WAprox 1 10' cie Herrai3na.h $89,900 SM=LD DEBBIE RECTOR Rel'ho"r "'ii sumph buiine i a; uual.' REALTY ONE 795-2441 N] 614:1 1 :11 I'II ] =1; aiI -- STILL SHOWS LIKE A MODEL V W n all trC belli & Ar.i'lei 2001 bu.Ii p.3,I n..Cn ie wair, 2 7.6 o f l' f Il.I'i9 3 r I'ar3T * offce r ir. a car 'a Cl r,ia r e ure ra e Woo,1 Br i. le re'Oor,na r.ni-o Ui p ,graea k.lCr.,6 o wa.h, A: h:.:iTI Aa O id t.c, .le a l. ,iri C r.- a, ', CC.ur.Iencip l ,ivir & Pa.T, l] rc ,r lar. ,e l nr I i, dir, gas fireplace over looking heated pool with spill over spa and much, much more. Situated on beautifully landscaped acre homesite. Offered at $499,900.4964 W. Pine Ridge Blvd., Beverly Hills, FL. R4348B. Visit for visual tour. MUST SEE TO APPRECIATEI .sur.ruii, JUST USTEDI 6-.urr.i r,.:., ,.,irr, *r.s.ri. r ai.a ,,r.i':,li.;' 'a J . I] ) 2, r ,. i. "T i 3 a a j i T :a u ,A l . I. l ,.e .5 I I c .. p rl..3 [.? .a a raeY. lI ., ,r , C., .: ., .V .,al l- r.ll .iJ r ,i'v :ll,'i .I r.. :T :.u,.'.]-. .:. ,,.l.a. ,,-r.. ri,. a .,e c. E a.a.js Gr'e.ar F.e:' ., , In eat-In kitchen plus 2 breakfast bars. Uving & Dining Room open to enclosed florIda Room Room & Family Room. Florida Room, on same w/heat & air Well for.yard. 51de-entry garage. 10' level as home has heat & air. Extra bay In garage ceilings. Mlce patio. French doors. Extra large lot. for workshop. New /VC & hot water recovery Exterior recently painted. Nicely landscaped. system. #0982747. $199,900 #0982769. $247,900. BETTER THAN NEW This one year ...... 1 old Mitch Underwood home is located Popular Sanabel II Model Nicely very close the private park and lake in Upgraded in the adult community of Arbor Arbor Lakes. Nice upgrades like real Lakes. A heated pool and enclosed lanai 1 wood floors. Don't miss out on this one. are just some of the features of this oin oornnn beautiful home. $227.700 NEW LISTING Fantastic pool home in New Construction Our largest the adult community of Arbor Lakes. maintenance free Carriage Home in the Enjoy relaxing by your sparkling pool. final phase of Arbor Lakes. Now under Take advantage of the amenities provided construction with an early summer by this Resident owned adult community. completion date. Save thousands in price $229,900 increases by purchasing nowl $243,500 -CITRUS L.VUNiY (FL) CHROICEIVLE FRIDAY, MARCH 3, 2006 .D JUST LISTED Spacious 3 212 all the ALL YOU COULD WISH FOR .r. In,, 3'22 deasrable extras, pocket acoor, ceiling 'lai, pui!l home Far ,ii, r,,om 'A.uit.h n b1,:. kitchen pantry, bay window, plant shelves, shelves. Convenient den/computer room. Eat- eyebrow windows, walk-in closet, garden tub, In kitchen w/breakfast bar. Cathedral & tray double pane windows, & cathedral ceilings, ceilings. Garden tub & separate shower in Newer A/C. Oversized cul-de-sac lot w/deep master. Oversized lanai. Heated pool. See greenbelt. See virtual tour @ erakeyl. & virtual tourrakeylcom virtual tour erakeyl.com & Realtor.com. Realtor.com. $250,000. #0982731: $325,000. #0982668. . I: -I a, i* "1 I a , 'I '1 ?i r , I . i1 ,I Adpl nrrC us CouNTY (FL) CHRONICLE 2D FRIDAY, MARCH 3, 2006 PLEASANT GROVE APARTMENT 2BR/1BA apartment located inside city limits. 320 Pleasant Grove Road. $500 per month P71 PLEASANT GROVE 224 Pleasant Grove Road. 2 bed, 1 bath inside city limits. Garbage pickup included. $550 per month P189 KNOB HILL 2 bedroom, 2 bath furnished home inside city limits. Close to Rails to Trails. $650 per month P199 CITRUS SPRINGS Newer home on Sussex Drive has 3 bed, 2 bath, 2 car garage, den, and dining room. $1000 per month P202 DUNNELLON Riverbend Road. 3/1.5/2 with caged pool, den, computer room, on 9 acres. Mother-in- law suite. $1200 per month P208 HIGHLANDS 2/2 with double carport, 3 car detached garage, pool, and separate apartment. 101 Highland. $1000 per month P39 SEASONAL RENTAL: 209 West Hill Street, Inverness Fully Furnished $1300 plus taxes P103 1325 Longboat Point, Inverness Landings off Mossy Oak, fully furnished $1300 plus taxes P150 Storage Unit: Size: 10x20 $80.00 Rent $4.80 Sales Tax $84.80 total w/tax #7, #22, #31, #39 available COMMERCIAL/PROFESSIONAL RENTALS PROFESSIONAL OFFICE SPACE INVERNESS Across from Citrus Memorial Hospital 3310 sq. ft. Can be rented as one large unit or divided 1655 sq. ft. each office $1500.00 per month each plus sales tax. PROFESSIONAL OFFICE BEVERLY HILLS Medical complex 4500 sq. ft. (Can separate 1000 sq. ft. smaller unit) $12.00 per sq. ft. plus sales tax Many built-in fixtures remain exam rooms, reception room, and other necessary rooms already subdivided and in place. Great opportunity for doctor office or other medical related use. INDUSTRIAL BUILDING HOLDER BRAND NEW 4000 sq' ft. building Zoned industrial Paved road Fenced parking area 5600 sq. ft. heated and cooled office 2 large industrial pull-up doors $2200 per month plus $150. (CAM, lawn, water, sewer, outside security lighting) 3-5 year lease .. Call Karen Morton at 352-726-6668 PLEASANT GROVE ACRES 4 53.Acr ar ii uiel .:.:.u ir eini.ng BP'2'EA l.uuble '.',,'e fixer upper or build and save -paying impact fees. Partially wooded, horses allowed. Close to the Withlacoochee State Forest with. miles of riding trails. Priced at $149,900. #19598MH. Call Cheryl Scruggs for more information. WATERFRONT POOL HOME Er,. j- :i tijl :u.jT ..ur,.3,r, : Ar.I: ,.:0 u :i ., ,..u, ..:. l...j :., ..I L. i t r,.:.." 1/2 acre on a cul-de-sac street near Inverness Golf & Country Club. 3BR/2BA - 2 car garage, fireplace, large eat-in kitchen, split plan, 1667 living area. Property has recently undergone repairs and is 100% cured by certified engineers (see disclosure) Priced to sell at $279,900. #19447HWCall Cheryl Scruggs at Century 21 J.W. Mortofi Real Estate, Inc. 1-800-543-9163 or 352-726-6668 WA- LAKE TSALA APOPKA -This 3BR/2BA brick home has.a nice corner fireplace, new carpet, has been refurbished and sits on a nice lot with water on 2 sides, water goes to the Hernando pool of the Tsala Apopka chain, can go to several lakes from here. Reduced, $199,900. Call Ruth Frederick 1-352-563-6866. MLS#19241HW. WZTERFRONThI Acnaz;,,,) 6 1'BFL d t..Tl.; B.,. i ; ,lm :,iT" htp,,, lsJ 1 1 1 ,1 :,',r.jI L..I : iT r,Ti I T . d n ... .. :I r 1 boll ir.,,ri a .I .:.;r r..'I .i & ,,',,i ,I A,.',, r .1- rF r,' t4W u.: .0 ]) ,,,,,, | : ,, ',,' l, : F ,t ] ,,,,1., vr ,, ,',',aH room with plenty of built-in storage and shelving, fisherman's delight boat dock, beautifully manicured ard, and city water Unbelievable amenities with this unique home Don't miss this opportunity, call today for your private showing. REDUCED to k $260,000 by Mary Parsons MLS#19541HW. -M.EW;,. . EXQUISITE LAKEFRONr HOME ON DUVAL ISLAND L c: Il-ed ,, '" TEI:, ,...,T,,ur.r, ..ir. t. .iir, il r.. I.:.r. .-. ..], .i-i i, i with 12 ceilings. Extra large screen enclosure for lanai and inground heated pool with fountain. Terraced wood decking sloping gently down to the lakeside. Over 3,000 sq. ft. under roof including a large master suite with 2 walk-in closets. $545,000. Call Barb Monahan for a private showing today before this one Is sold. (352) 726- 0094. #19637HW. THIS CHARMING NEW HOME riao ie,6.r been occupied. Dor I miss out on this Inverness Highlands home. 3/2/1 features split floor plan, neutral colors, open patio, all appliances included, nice yard ready for immediate " occupancy. $169,900. #19603HN. Call Tammy Chamberlain for showing. 634-1202. I.'.,., NEW CONSTRUCTION! 3BR/2BA/2 car garage CBS, central water, dead end street, 2187 sq. ft. UR. 1519 sq. ft living area, screen porch, almost done. $182,900. MLS#19655HN. Call Mike Smallridge 302-7406. Inverness i Farms r. Realty Group, Inc. Specializing in Residential Homes with Acreage Richard (Rick) Couch Lic. Real Estate Broke" 1045 E. Norvell Bryant Hwy: Hernando, FL 34442 Office: 352 344-8018 Cell: 352 212-3559 Fax: 352 344-8727 -s Sigg $106,900 ON YOUR LOT Other packages available. 3/2/I + laundry . Atkinson Construction, Inc. (352) 637-4138 . CBC059685 opportunity won't last long. Open House Sun., Mar. 5 11am-3pm TERRA VISTA Dir: 486 to Tena Vista through guardhouse, first left Doerr Path at stop sign left, 480 W Doerr Path, house on right. Windward Model on double lot - ~ Spectacular ;4 .. *:, .,:lc ;ir,.l ,:.lf r. r e Furnished h.rn:.. i h.ad, I r,. c e i',.:, I. ut. .:.al S t : n m| .. Ic , vF ,: I t vous Florida Dream' $429,000 L " ,1 -01135- "'1 22 3 ' Save now with turn key preconstruction prices. Starting at $499,500. iIncludes beautiful home property lull furnishings pkg , standard features uc.:h as granite couniertcps & Spanish roofl lest r Van der Valk Tradewinds 10265 Fishbowl Drive, Homosassa, FL 352.628.2284 or 352.726.5140 Sales office open from Wednesday through Saturday 11 am 5 pm and Sunday 1 pm 5 pm email: sales@valkusa.com Thinking of selling? Have questions? Our professional . REALTORS are "Full-Time" & have been serving clients since 1987 in marketing & selling property. Call CRAVEN REALTY; Raveo.Ral). INC. at 352-726-1515 or e-mail us at S ,..'.... cravenrealty@tampabay.rr.com. G V 835 N.E. Hwy. 19, Crystal River, FL 34429 Michael Quirk, ... rZI.... Direct: (352) 228-0232 Glenn Kristine Quirk, P.A NATURE CAST Direct: (352) 228-0878 Kristine E'lah Ot tih a i, Iidepti Je ntiy OynIad A Opterted sq t" '.1 home .5r, iar,,'.l c ed ..u'le Io, .v 125 ol water Ir1r, Iage L arge open f amly r m, turml I,,ar.g ,om anrd Z- .rli areaI J-..ar garage largn Si..:rur.d .ag.d pool 5i n b0at d, iik 1 '1 001 i, t rjil ih arid U T:n nmor-e $999,000 Rustic LAKE ROUESEAU Enjoy privacy and stunning views from this 1,854 sf. 4/2. The interior offers a lqrge open kitchen and Sdiri'nri 3a .v.ath ae. floors and a SIr.place O'l}iide yOU t.il erc', I' ,,' .10 .1P luS h lanr:c.apirg rnana ozenrs of[uit Irees $519,000 MLS 11E.5402 31 &I BLACK DIAMOND 312 Tnia imrcc.abl, Timainiar.ed horrae ,s or 71rh re o ir.f Hign r.;nvwa) Pella ainnoows &S c:alhedal Cellir.iq Large great room open l.mcne, *lr,,n.g area Pequ.re, asumptplri or ovner"- iqoll ,.urie mTeTbeartnip for (i 00'3 $379.000 MLSnl I5531:5 . .5." compete pria.: ,y in Ihis secluded. 2 100, 3.-torj home with 2 master suites a loft/ optior lal ar efoornr large, kitchen anda i.i.rg roomrr. h h water v.,ew Exreror feature, include a Dai dock.. boat ramp boat 1-n anrdj a 2 car garage $589,900 MLS4 115533 1 WATERFRONT CONDO Enjoy canal views from this large 2/2 condo. Open Gflorplan with a large family and li, ng room Picheri with breafant Bar and ample storage Frech rpanl ran 18 ceramic t ies inrcuohc.u i Boa ock ,CK wil Gull i ace.ass and a cornimuniry pool $269,000 MLS4154,155405 2 STORY 2 Dearoom. 1 5 bathroom townnouse in Pelican Cooe with open lining area Localed in a beautiful waterfront community New " A/C and wasrherlryer Priced ' to sell $150,000 MLSt 1155469 Lir" 11,. 8CB0M9032 aFvmru mtmneiIIIqt' i:I K1J~a :. Ja ps ipi: SI : IS. ..'L'] ...U2 I] ps J 1--o- lvv Ul 34442 Cravenrealty@tampabay.rr.com 3088 N. Carl .. .1 Cu61RUS CO~Uvrs(FL) CIRhOMVCLE ~ lChronicle CILASSIIFIEDr-S *~' ~WA~ Classifieds - ' -, *" ,' "-""" 4 . T' ," i ."* '4 mi . Classifieds In Print and Online All The Time 56356 1@ol F6 e (8882-34 1Emil ca 'sified croiceolie-o I w'site w w acroiclonineco FRIDAY. MARCH 3. 2006 3D Handsome Aquarius Man seeking soul mate. f,-.Age unimportant. I am S--,53 years young and in ,,,good health. Seeking attractive, Intelligent 'female for good times I'*" and dating. Lets get f together and dream a little bit. All replies answered. Reply to Box 953P t, c/o Citrus Chronicle PO Box 640850 t; Beyerly Hills, FL 34464 ;, RETIRED ORIENTAL LADY 5'5",125 lbs., No smoking/ drink/drugs. v- Wish to meet friend who needs : companionship with S -.i the same interests. t,-;Reply T.S., P.O. Box 895, r Waldo, FL 32694 SSWM, 65+ Financially . secure, enjoys country r.fnusic, western, movies, r,. flea markets, travel (USA, Alaska) SWF 60+ with same f-I; interest, Respond to Blind Box 952P P C/o Citrus County .\ Chronicle C!41624 N. Meadowcrest Blvd. Crystal River Fl. 34429 ** FREE SERVICE** Cars/Trucks/Metal I Removed RERE. No title OK 352-476-4392 Andy Tax Deductible Receipt 2 FREE AIR CONDITIONERS For Mobile or Home S .' (352) 628-1244 2 Male Long Earred S Rabbits, (352) 726-3670 9 WK. OLD ': Mixed Male Puppy ; (352) 795-3650 COMMUNITY SERVICE SThe Path Shelter is available for people who need to serve ; their community S .service. 1, (352) 527 6500 or ; (352) 74679084 [ Leave Message F e-:)IT 1e ,:T.-r ,.3" rall' J i i yrs old., male rednose 2 i 'yrs. old. Free to good Some. (352) 601-3606 S FOUND Lab, male neutered in S Citrus Springs. S (352)465-1182 FREE (2)4month old kittens (black) 527-0703 leave-message FREE 3 FIVE GALLON BUCKETS'of Carpet Adhesive, also 1 LARGE CHEST OF DRAWERS. (352)344-1515 FREE CONCRETE ,GARDEN EDGING FOR % FLOWER BEDS S(352) 344-2752 Free Dryer, works, s takes longer to dry S(352)341-4449 FREE GROUP '.-. COUNSELING Depression/ Anxiety (352) 637-3196 or 628-3831 Free Kittens (352) 613-3607 "' Free moving boxes. Inverness 212-6858 FREE REMOVAL OF Mowers, motorcycles, T'V's,Cars. ATV's, jet skis, 3 wheelers, 628-2084 E D- iag-. ttO; Your world first. S Even Day I . S ONIC U Free to good home 1 male, 2 females Goats, 1 fem. pregnant (352) 795-8655 Free to good home, Lab Mix, 6 yr. old female, (352) 628-4217 Free to good home. Golden Retriever Female, Spayed (352) 476-3410 Humane Society of Inverness No kill shelter 352-344-5207 Requested Donations All pets spayed/neutered, heartworm check, luek. test, Rabies and all vaccines DQg LECANTO Saturday MORNING 8am Free clothing & household items, appliances. Too many things to S mention :. THE PATH STORE 1729 W GULF TO LAKE HWY rescued oetf.om (352) 795-9O0. Need help rehoming a pet- call us Adoptive homes available for small dogs Requested donations are tax deductible PetAdoption Saturday, March 4 S10am-12pm Nature Coast Lodge Rt. 491 Lecanto Cats Kitten and teenager - .628-4200 Kitten 5mos F tabby 746-6186 Orange/Cream Per- sian adult 527-9050 Small Terrier mix F Adult 527-9050 Adult Lhasa M; Toy Poodles young adults 341-2436 All pets are spayed/ neutered, cats tested for leukemia/aids, dogs are tested for heart worm and all shots are current, FURNITURE & Odds & Ends TAKE ALL (352) 726-6234 HORSE MANURE Can arrange for loading, (352) 527-9184 RESCUED, abandoned Black Female Cat, 1-2 yrs. old. Very friendly & playful, Spayed, alll shots current, no para- sites. (352) 465-9029 Keywest JUMBO SHRIMP 13 -15Ct. $5.00 l1b Misc. Seafood 795-4770 9 WEEK OLD PUPPY blonde, vic. of Eden Dr. Inverness. If found call 212-4147. BEAGLE/ Walker Hound Neutered male. Beloved family pet. Lost vic. Inglis, may have traveled. Very well behaved. (352) 447-6120 Blue/Gold Macaw Lost 488, Holiday Heights area, please, please call. (352) 795-6659 Digital Camera, 2"x 2", lost at gas station on 44, very important, Reward (352) 527-0482 LOST Grey 5 Ib Chihuahua Near Key Training Center Child's pet .(352) 795-9060 LOST-MALL AREA Family Cat Male, orange tabby 220-6347 Very Missed MALE TERRIER lost Floral City. Choc. w/wht. blaze chest. Chip ID. Shy. REWARD. (352) 726-0647 Palm Pilot Tungsten T5 Crystal River area, REWARD (352) 302 5972 Beagle/ Hound Mix Dog Well behaved male, (352) 564-1453, call to identity. FOUND PUREBRED WHITE BOXER, no collar or tags,. vicinity of E. Tangelo, 41-N, near Bowling Alley, Inverness (727) 808-8515 MOTHER & PUPPY Near 486 &491 Call to identity (352) 746-7347 Peacock, female found mini-farms area. (352) 564-8915,eve. Puppy about 2-3 Mos. old. Lab mix. Vicinity of Intersection of Rock Crusher & 44 (352) 201-0726 Divorces IBankruptcy I I Name Change Chld Support I Wife s 1 In eniess..............374022 *CHRONICLE. INV. OFFICE 106 W. MAIN ST. Courthouse Sq. next to Angelo's Pizzeria Mon-Fri 8:30a-Sp Closed for Lunch 2om-3pm HOMEWORK Legal form services, wills, divorces, bankruptcy, notary serv., credit card assis- tance, (352) 637-9635 LHS CLASS OF 1996 Has set the date for it's 10 yr. reunion June 16 & 17th, 2006 has been marked to celebrate the occasion. To learn more please contact Amanda Agnitsch at AAgnitsc@ tampabay.rr.com ii i -i I II~i REAL ESTATE CAREER Sales Lic. Class I $249Start 3/28/06 CITRUS REAL ESTATE | SCHOOL, INC. S(352)795-0060 2 REWARD for info. Honda 300 EX 4-wheelers, stolen Janl15/16 from Lecanto (352) 382-7039 STAMPIN' UP, Stamp; Scrap, make new friendsl cdi.-s r..:.n forming. For more a rs i call Kristie @ 352-465-3426. MR CITRUS COUNTY REALTY ALAN NUSSO 3.9% Listings INVESTORS BUYERS AGENT BUSINESS BROKER (352) 422-6956 ATTRACTIVE SWF seeking male companion. Candi, 352-628-1036 Tennis partner needed for daily exercise. Keywest JUMBO SHRIMP 13 -15Ct. $5.00 Ib Misc. Seafood 795-4770 TODDLER TEACHER POSITION Full time, Exp. required TODAY'S CHILD 352-344-9444 ANCOR FURNITURE Customer Service Desk 9 4, M F, wholesale, Fax short resume 775-243-6347 or email garrvmelott@aol.com FT. EVENING RECEPTIONIST With benefits Crystal Chevrolet of Inverness Hrs. 2-8 M-F, 9-5 Sa. Fax resume to Melody Garnett 352-564-1952 JOBS GALORE! EMPLOYMENT.NET LOCAL AUTO DEALER Looking for experi- enced accounting & clerical person. Fax resume to: 407-297-0870 Will train right person! comr RESIDENTIAL BLDR. Office Assistant -needed w/Bookkeeplhg, Computer skills & building permit application exp. necessary. (352) 726-4652 folloing.cass.s Hai yls I Yourchalle geT!. ABITARE PARIS DAY SPA & SALON Is seeking exp. Stylists to join their Aveda Hair Design team Benefits Include: Health Insurance Vacation Pay Education Fund Established Clientele preferred. Apply within Call 352-563-0011 EXP. HAIR STYLIST Full time or Part time, HOMOSASSA SALON (352) 628-4888 or 613-3004 JOIN THE 2005 BEST OF THE BEST SALON Hair Stylist & Nail Tech Contact Uz at (352) 795-6666 and^^ of Citrus County a Skilled Facility has openings for: CNA's Fulltime 3-11 & 11-7 RN Fulltime 3-11 Fax Resume (352) 746-0748 or SApply in person Woodland Terrace 124 Norvell Bryant Hwy. Hernando (352) 249-3100 CNA/TECH rull rrr.i A.3, : Send Resume to. Blind Box 951P, c/o Citrus County Chronicle S1624 N, Meadowcrest Blvd. Crystal River Fl. 34429I avantegroup.com CNA'S F/T3-11 Shift differential. Bonuses abundant Highest paid In Citrus County. Join our team, mCypression drive ife rnet. 3325 W. Jerwayne DIETARYca CNA'S F/T 3-11 PRN's All Shifts We offer excellent pay and benefits in a mission driven environment, Visit us at: 332611W. Jerwayne Lane, Lecanto FL 34461. EOrness FL EOWP DIETARY Join the Arbor Trail Teaml Now acceptingof sanitcations for: Fulle-Time Evening COOK Part-Time Evening DIETARY AIDE Apply In person Arbor Trail Rehab 611 Turner Camp Rd Inverness FL EOE DIETARY AIDE Must be knowledgeable of therapeutic andrc modified diets In a nursing home setting. Must have good sanitation skills and enjoy working with the elderly. Please only serious applicants need apply. SURREY PLACE 2730 W. Marc Knighton Ct. Lecanto No ohone calls olease 1' Cleric c=-Secre MDS Coordinator RN F/T We offer excellent pay and benefits In a mission driven environment. Visit us at: 3325 W. Jerwayne Lane, Lecanto FL 34461. EOE DFWP MEDICAL ASSISTANT EXPERIENCE NEEDED Please Send Resume to: P.O. Box 3087 Homosassa Springs, Florida, 34447 S- -- N r Nurse | F/T & P/T I 7-3 &3-11 I Shift differential. I Bonuses abundant Highest paid in Citrus County. | Join our team, S Cypress Cove I * Care Center * 700 SE 8th Ave. I Cr steal River | (352) 795-8832 Lk m *mLpNlEonline.com Drug screen required for final applicant. EOE New Home Builder/ Supervisor West Central Florida Division of Mercedes Homes has an Immediate opening for an individual with 3-5-plus years production home building experience. Must be high energy, organized, meet deadlines, strong customer/ sub-contractor skills. Good salary, benefits. Submit resumes to MRobertson@mer homes.com Drug Free Workplace/EOE REAL ESTATE CAREER Sales Lic. Class $249.Slarl 3/28/06 CITRUS REAL ESTATE I SCHOOL, INC. L (352)795-0060 ----7- 06 -E Endoscopy LPN Thurs. Morning & PRN, days w/ no weekends, Fax resume to: 352-563-2961 FRONT DESK POSITION For Dental Office, Exp. preferred. Fax Resume to: (352) 527-3682 9am-5pm GROWING ORTHO PRACTICE SEEKS THE FOLLOWING Full Time Medical Assistant/ Xray tech. Insurance Specialist Office Phone Rep. Competitive Salary, Pension,, Group Health Incentives; Medical office exp. req. Fax resume to: 352-746-6107. or email ien@drpetrella cornm or call (352) 746-2663 i--- -, --= = ,= i IMMEDIATE OPENING P/T RECEPTIONIST NEEDED FOR BUSY OBGYN OFFICE Front Office Exo. Required. Fax Resume to: (352) 794-0877 LAB TECHNICIAN/CLERK Looking for an individual to process incoming & outgoing shipments for a hearing aid clinic. Minor lab work and patient ri.ll:.l..-ur. core ;: .: l;:. q,,j irr ., L -.'rr, l I ,t. F' r : I r, :. (352)795-8663 LABORATORY MED/RN'S, LPN'S and ARNP FT & PRN POSITIONS AVAILABLE IMMEDIATELY In Med. Surge and ER, at progressive rural hospital. Please fax resume to 352-528-3824 or apply In person at Nature Coast Regional Hospital 125 SW 7th St. Williston, Fl. EOE/DFWP LOOKING FOR CNA'S/HHA'S'& HOMEMAKERS To take care of patients in their homes. Call Mon. thru Fri. 9am-2pm (352) 344-5228 EARN AS YOU LEARN CNA Test Prep/CPR Continuing Education 341-2311/Cell 422-3656 MEDICAL OFFICE Looking for Front & Back office help. Send Resume to Box 954P c/o Citrus Chronicle, 1624 N Meadowcrest Blvd., Crystal River, Fl 34429 NURSING ASSISTANT Do you have nursing exp. but are not certified? If you're willing to work hard and have a positive attitude; come apply at Barrington Place. Strong communication and customer service skills a must. Excellent benefits. Fun place to work 9nd -Call Homell & Apply at: & BARRINGTON PLACE 2341 W. Norvell Bryant Hwy. Lecanto No Phone Calls P/T ACTIVITIES AIDE If you are Fun, outgoing, and energetic. o Apply at: o BARRINGTON PLACE 2341 W. Norvell Bryant Hwy. Lecanto No Phone Calls "Part time Medical Clinic Typing exp. outgoing, & motivated Fax resume to 352-291-2498 SURREY PLACE OF LECANTO IS LOOKING FOR CNA'S For3-11 & 11-7 Full Time & PRN RN's, LPN's 111-7 Full time & Part Time Please apply within 2730 WMarc Knighton Ct (352) 746-9500 CORRECTIONAL OFFICER (Full Time) Certified by FDLE & LPN GREAT BENEFITSII Paid Vacations, Holidays, Health Insurance & 401K A valid Florida Drivers license is required. Call for Info at: (352) 527-3332 ext. 1317 M-F 8:30 AM -4:30 PM M/F/VET/HP E.O.E. Drug Free Workplace BOOKKEEPER Excel. Opportunity for a self motivated, dependable & detail oriented Ind. Must be proficient in Microsoft Excel & Word. Bookkeeping exp. & job references are req'd. Fax resume to: (352) 746-3838 CHILDREN MINISTRY DIRECTOR P/T Exp.Methodist children ministry. 1st UMC, Inverness 726-2522 for details. PEST CONTROL SALES / Exp. Only. 20% commission. Paid weekly.Company truck, benefits Call Vinny Nelson (352) 628-5700 (352) 634-4720 To place an ad, call 563-5966 m .... 'M yl $$$$$$$$$ SHIFT MANAGER Positions Benefits, Insurance, 401k, competitive pay. Apply n person at: of Crystal River. (352)795-6116 ALL POSITIONS At HOMOSASSA RIVERSIDE RESORT & RIVERSIDE CRAB HOUSE. Aoolv In Person 5297 S. Cherokee Way, Homosassa *BARTENDERS *SERVERS & eCOOKS Exp. preferred. High volume environment. COACH'S Pub&Eaterv DAYTIME DISHWASHER Flexible hours experience with good work ethic. Good pay and benefits. 746-6855. DISHWASHER Apply in person LA CASA DI NORMA (352) 795-4694 Exp. Line Cook Wait Staff Apply at: CRACKERS BAR & GRILL Crystal River Exp. Servers Busers & Hostess Apply in Person FUJI In Kash-n-Karry Plaza, Homosassa EXP. SERVERS PT/FT Also HOUSEKEEPER Previous applicants need not apply. Seagrass Pub & Grill 10386 W. Halls River Rd FULL/PART TIME OPENINGS For fast paced Dell & cl-cat,.:,n. L'ell. r, aon. err earn .j a s e p r ', . .. I ,i per ael,.er rp . Ear;r,a po.l.r,iaI ; S c i ,l ur Please Apply at: 1677 S. Suncoast Blvd. Crystal River or 3601 N. Lecanto Blvd. Beverly Hills Line Cooks Prep Cooks, Dishwashers & Wait Staff Applyin person 9am-lpm M- FataJ's, Kmart Plaza, Inverness No ohone calls SERVERS BENEFITS. Applications now being accepted at between 1pm-2pm: Cockadqodles Cafe 206 W. Tompins St. Inverness 01116 CITRUS COUNTY (FL) CHRONIC 4D FRIDAY, MARCH 3, 2006 - =SalsHl Phone Sales Help Earn $1000 week easy Mon.-Fri. 35 hrs.week. Base pay + comm. Call Bob or Nate, 563-0314, Cell 464-3613 REAL ESTATE CAREER Sales Lic. Class I $249.Start 3/28/06 CITRUS REAL ESTATE I i SCHOOL, INC. S (352)795-0060 SALES & CUSTOMER SERVICE For fast paced upscale Citrus Fruit Shop on South Wildwood. Call or Fax (352) 748-4168 Sales Representatives Exciting opportunity for a motivated Sales Representative in the Wholesale Construction Industry. Career opportunity provides commission & Expenses for a motivated candidate, please fax resume to: ' 352-563-0459/ App. 352-563-5099 SALESPERSON Carpet, Ceramic, Wood Sales, experienced preferred. Williams Floor Store 637-3840 TELEMARKETERS EXP., 6 NEEDED IMMEDIATELY Set your own scheduled Make $1000 wk, Plus Call 325-628-5700 -LI WANTED SMILING PLEASANT TEAM PLAYER FOR SALES POSITION Start immediately. Gulf to Lake Sales, 705 S Scarboro Ave. Lecanto $$$$$$$$$$$$$$$-5700 * A/C Service Tech F/T. Growing Co. Exp. preferred Call (352) 564-8822 ALUMINUM INSTALLERS Exp'd or will train motivated persons. (352) 795-9722 Cabinet Installer Needed for growing kitchen and bath distributor. Subcontractor and in house positions available, Must have own tools.Salary, job bonuses. Health and dental insurance, paid vacations, company phone (for in-house installers only). Experienced and reliable only need apply. Send resume to 352-628-9563 or apply in person at Deems Kitchens and Baths CARPENTER Min. 1 year, cutting and sheeting exp. (352) 220-9187 DELIVERY/ Ibs., are able to push, pull, lift and/or carry material up to 100 lbs, please consider joining our team. The position offers a competitive salary and benefits package. Apply In person at FARMERS FURNITURE 657 SE Hwy 19 Crystal River EOE CONCRETE CONTRACTOR Lic & Ins. (352) 637-3912 DRIVER NEEDED Local delivery, Class B CDL, air brakes, Hazmat, Full time w/benefits. Will Train. Apply in person Heritage Propane 2700 N. Florida Ave., Hernando DRIVERS Class A & B. Required; Full time & Part Time. Local/ Long Distance. Home most weekends. Contact Dicks Moving Inc. (352) 621-1220 DRIVERS WANTED Class A & B HOME EVERY NIGHT Great Pay &'Bonuses Call 800-725-3482 DRYWALL STOCKER Needed for Building Supply Co. Monday thru Friday, 7am-5pm, (352) 527-0578 DFWP mmh Trades ibb cn /Skills DRIVER NEEDED Dump exp, preferred. Class B CDL. (352) 628-6414 DUMP TRUCK DRIVERS Class A CDL needed for local contractor. Call (352) 726-3940 *EXP DETAILERS*. Good Pay, Good Benefits, Good Hours Reply Blind Box 955-P . c/o Citrus County Chronicle 106 W Main St., Inverness, FL 34450 SEXP. FRAME CARPENTERS Local F/T positions Benefits. Must have trans.(352) 634-0432 EXP. FRAMER NEEDED (352) 637-3496 EXP. FRAMERS 352-726-4652 EXP. FRAMERS & HELPERS Must have own tools and transportation. Local work POWELL FRAMING (352) 341-3259 EXP. LAMINATOR For busy shop. Apply in person BulltRite, 438 E Hwy 40 Inglls, (352) 447-2238 ff-I EXP. POOL CAGE INSTALLERS & GUTTER INSTALLERS MUST HAVE CLEAN DRIVER'S LICENSE Call:(352) 563-2977 Exp. Welder/ Fabricator That can build utlty trailers, etc. (352) 489-5900 EXPERIENCED INSTALLERS Must have FL Driver's License & own transportation. Apply in person: Daniel's Healing & Air 4581 S. Florida Ave. Inverness Experienced Painters 5 years minimum. Must have own tools & transportation: (352) 302-6397 F/T WARRANTY TECH Must have clean driving record. Must be skilled In drywall, carpentry and painting. Please fax resume to: 352-746-2944 & CARPENTERS Must be dependable & exp. Own tools and ride a must. 352-279-1269 FULLTIME DETAILER/ GENERAL MAINTENANCE PERSON Apply in person Mon- Fri 8-1. Dependability a must. Dave's Body Shop, (352) 628-4878 R WRIGHT TREE SERVICE, tree removal, stump grind, trim, Ins.& Uc #0256879 352-341-6827 STUMPS FOR LE$$ "Quote so cheap you won't believe it!" 60FT BUCKET TRUCK I JOE'S I- I TREE SERVICE I I All types of tree work A TREE SURGEON S DEPENDABLE, HAULING CLEANUP, I PROMPT.SERVICE I I Trash, Trees, Brush, I Appl. Furn, Const. Debris & Garages Land Clearing, tree Ser. Removal. Driveways/ concrete 302-6955 DOUBLE J STUMP GRINDING, Mowing, Hauling,Cleanup, Mulch, Dirt. 302-8852 D's Landscape & Expert Tree Svce Personalized design. Cleanups &- Bobcat work. Fill/rock & Sod: 352-563-0272. JOHN MILL'S TREE SERV Trim, top, removal Ins. Uc. 7830208687 352-341-5936. 302-4942, LAWNCARE-N-MORE Lawns, Hedges, Mulch, Leaf Removal, Clean Ups, Haul, 726-9570 M&C CLEAN UPS & BOB CAT SERV Trash & Brush removal, const. debris, Free est. (352) 400-5340 PALM TREES FOR SALE delivered and planted, transplanting & removal avall. (352) 697-3176 A PAUL'S TREE & I CRANE SERVICE Serving All Areas. | Trees Topped, Trimmed, or .Removed. s FREE ESTIMATES. '* Ucensed,& Insured. I (352)458-1014 5 --- ---il' Your world firsi. E'vern' Da CHpClO aE Cltasatg& ol COMPUTER TECH MEDICS Hardware & Software Internet Specialists S (352) 628-6688 Cooter'Computers Inc. Repair, Upgrades, Virus & Malicious software removal (352) 476-8954 PC Troubleshooters We clean, optimize PC's Call for in home appt. Ask for Mark (352) 219-7215 vChris Satchell Painting & Wallcovering.AII. Ucensed & Insured. 637-3765 Gary Ouillette Painting & Handywork Quality, affordable, Lic 30001 Free Est. (352) 860-0468 George Swedllge Painting- Int./Ext. Pressure Cleaning- Free est. 794-0400 /628-2245 INTERIOR/EXTERIOR & ODD JOBS. 30 yrs J. Hupchick Lc./Ins. (352) 726-9998 MICHAEL DAVIDSON 20+ yrs. exp. Painting contractor/ handyman Lic.3567 (352) 746-7965 Mike Anderson Painting Int/Ext Painting & Stain- ing, Pressure Washing also. Call a profession- al, Mike (352) 464-4418 POOL BOY SERVICES I Total Pool Care I | Acrylic Decking I * 352-464-3967 J PRESSURE CLEANING Painting, Roof Coating, Repairs. Free estimates. #73490256567 726-9570 Robert Loveling Painting, Inc. Lic. Contractor for 20 yrs. Com/res. Free est. LP-9011 (352) 746-9173 F-- Wall & Ceiling Repairs %Drywall, Texturing, Painting, Vinyl. .Tile work. 30 yrs. exp. 344-1952 CBC058263 Fast Tax Prep Personals & Corporate Practicing since 1987. Confidential. 220-6353. Uc#99990001273 Bob, 352-220-4244 Elyte Home Services Shower & Tub Endcl., Grab Rails, & morel Ins. Lic#99990255004 (352) 220-9056 BATHTUB REGLAZING Old tubs & ugly ceramic tile Is restored to new cond. All colors avail. 697-TUBS (8827) P LOVING CARE V That makes a difference. Will care for elderly person In my home or yours 24 hr. care. Louisa 613-3281 Will care for your loved ones in my Dunnellon Riverfront home. (352) 522-0282 MOTHER OF INFANT will watch children in her Inverness home. Infant to 12 yrs. (352) 302-6486 vChris Satchell Paintingi & Wallcovering.All work 2 full coats.25 yrs. Exp. Exc. Ref. Lic#001721/ Ins. (352) 795-6533 Dennis Office Cleaning and Floor Waxing 17 years experience 352-400-2416,465-0693 HOMES & WINDOWS Serving Citrus County over 17 years. Kathy (352) 465-7334 . MELODIE'S Cleaning & Gardening, Homes, landl6tds,.$10; off 1st kit (352) 220-6035 Post Contruction to Residental/ Com- merical. Exp. & Uc. (352)637-1497/476-3948 The Window Man Free Est., Com./residential, new construction Uc. & Ins. (352) 228-7295 .DISCOUNT COUNTER TOP Resurfacing & repair. All types of Handyman Work. Uc. 28417 (352) 212-7110 Formica Brothers. Don't replace, reface. Cabinets/Counter tops Relaminating - (352) 586-3010 Additions/ REMODELING New construction Bathrooms/Kitchens ULc. & Ins. CBC 058484 (352) 344-1620 Residential & Commer- cial, New construction, room additions, re- modeling,; CBC 1253431 352-422-2708 ROGERS Construction Additions, remodels, new homes. Most home repairs. 637-4373 CRC 1326872 Screen rms,Carports, vinyl & acrylic windows, roof overs & gutters Lic#2708 (352) 628-0562 Richie's Pressure Cleaning Service Uc # 99990001664. Call 746-7823 for Free Est. #1 IN HOME REPAIRS, paint, press.wash, clean roof&gutters, clean up, haul #0169757 344-4409 Elyte Home Services Shower & Tub Encl., Grab Rails; & morel S AFFORDABLE, DEPENDABLE HAULING CLEANUP. PROMPT SERVICE I ITrash,2562Z71352-465-9201 BILL STEWART Pressure waslh Malnt.& Repair Painting,hauling, lic# 73490234087 344-2904 DANIEL HARSH EXP. HANDYMAN. Full Range Services. No Job too small. Punctual, Reliable & Affordable, ULc. 80061, Ins. & Ref. (352) 746-2472 DISCOUNT COUNTER TOP Resurfacing & repair. All types of Handyman Work. Uc. 28417 (352) 212-7110 NATURE COAST HOME REPAIR & MAINT. INC. Offering a full range of servlces.Lic.0257615/Ins. (352) 628-4282 Visa/MC -I L & L HOME REPAIRS & painting. 7days wk Lic 99990003008. (352) 341-1440 Wall & Ceiling Repairs Drywall, Texturing, Painting, Vinyl. Tile work. 30 yrs. exp. 344-1952 CBC058263 A+ TECHNOLOGIES Plasma lV's installed, Stereo, phone, cable & more (352) 746-0141 All of Citrus Hauling/ Moving Items delivered, clean ups.Everything from A to Z 628-6790 r AFFORDABLE, S DEPENDABLE, * HAULING CLEANUP, I PROMPT SERVICE I STrash, Trees, Brush, | Appl. Furn, Const, U HISE ROOFING New const. reroofs & repairs. 25 yrs. exp. leak sp ,: **'.C .. \ "':L ' (352) 344-2442 J,T. Neely Roofing Reroofs, new roofs & repairs (352) 637-6616 or 866-300-5469 John Gordon Roofing Reas. Rates. Free est. Proud to Serve You. cccl325492. 795-7003/800-233-5358 All Tractor & Dirt Service Land Clearing, tree Ser. Removal. Driveways/ concrete 302-6955 Benny Dye's Concrete Concrete Work All types! Lic. & Insured. RX1677. (352) 628-3337 BIANCHI CONCRETE Driveway-Ratio- Walks. Concrete Specialists. Lic#2579 /Ins. 746-1004 Concrete Slabs Driveways, patios, boat shed & RV Slabs, etc. Brick pavers. Lic. & Ins. Mario (352) 746-9613 CONCRETE WORK. SIDEWALKS, patios, driveways, slabs. Free estimates. Lic. #2000. Ins. 795-4798. EROSIONS, driveways, pool decks, sea walls, concrete pumping (352) 634-2338 r -,,-, -- E POOL BOY SERVICES Total Pool Care I I Acrylic Decking I L 352-464-3967 RIP RAP SEAWALLS & CONCRETE WORK Llc#2699 & Insured. (352)795- 7085/302-0206 Additions/ REMODELING New construction Bathrooms/Kitchens Lic. & Ins. CBC 058484 (352) 344-1620 AFFORDABLE, I DEPENDABLE, I I HAULING CLEANUP, I I PROMPT SERVICE I I Trash, Trees, Brush, I Appl. Furn, Const, | Debris & Garages I 795-7241 1= Drywall REPAIRS, Wall & ceiling sprays, Int/Ext Painting Lic/Ins 73490247757 220-4845 Wall & Ceiling Repairs Drywall, Texturing, Painting, Vinyl. Tile work. 30 yrs. exp. 344-1952 CBC058263 FILL, ROCK, CLAY, ETC. All types of Did Service Call Mike 352-564-1411 Mobile 239-470-0572 4-H HAULING Dirt, clay, sand, rock, etc. Call Mike @ 302-7388 or 795-1524., DEPENDABLE, HAULING CLEANUP, . I PROMPT SERVICE I I Trash, Trees, Brush, Apple. Furn, Const, | Debris & Garages .,352-697-1126 --- --- 0iEll All Tractor & Dirt Service Land Clearing, tree Ser. Removal. Driveways/ concrete 302-6955 All TYPES OF TRACTOR WORK. BUSHHOG SPECIAL $20 an acre (352) 637-0172 * DAN'S BUSHHOGGING Pastures, Vacant Lots; Garden Roto Tilling Lic. & FRANKLIN AUER & SONS Landscaping, all types of yard work. C.rI.,. flower gardens & ponds installed. Sr. Citizen Discount. 352-382-2660 D's. Landscape & Expert Tree Svce Personalized design. Cleanups & Bobcat Work. RIll/rock & Sod: 352-563 0272 PRO-SCAPES Complete lawn serv- ice. Spend time with your Family, not-your lawn. Uc./Ins. (352) 613-0528 Advanced Lawncare & More Comp. lawncare, Pres. washing, odd jobs, No job too small Uc. Ins. 352-220-6325/220-9533 S AFFORDABLE, I DEPENDABLE, I HAULING CLEANUP, PROMPT SERVICE I I Trash, Trees, Brush, Appl. Furn, Const, = Debris & Garages | agalnl(352) 465-8447 or 464-1587 i-== -- --- U.=I LAWN PLUGS INSTALLED (352) 527-9247 LAWNCARE-N-MORE Lawns, Hedges, Mulch, Leaf Removal, Clean Ups, Haul, 726-9570 MAVEN POOL MAINT. Start enjoying , your pool again ', Wkly. service avail. Lib. (352)726-1674/464-2677, POOL BOYSERV E Total Pool Care ' I Acrylic Decking S 352-464-3967 L --= == =- m POOL PRO. r,.-n-i g Sproblems.addressed. Free pool consultatin Neil (352) 344-8472 Seasoned Oak Fire Wood. Solit $80,4x7. CRYSTAL PUMP REPAIR Filters, Jets, Subs, Tanks, w/ 3yr Warr. Free Est. (352)563-1911 WATER PUMP SERVICE & Repairs on all makes & models. Lic. Anytimna 344-2556, Richard DECORATIVE CONCRETE COATINGS. Renew any existing concrete Lots of designs & colors. Lic. Ins.(352) 527-9247.1 MR CITRUS COUNTY REALTY ALAN NUSSO v 3.9% Listings - INVESTORS BUYERS AGENT BUSINESS BROKER N (352) 422-6956 A MOBILE NOTARY I Avail. 24/7 7 1 Off. (352) 465-2339 Cell (352) 613-0078 H------ 0 RAINDANCER 0 Installing 6" Seamless res, 7" corn V rnd & Copper, Unsuroassed Quality For Over 15 yrs. Free Est., ULic. & Ins. 352-860-0714' l All Exterior Aluminum Quality Pricel 6" Seemless Gutters A LiUc & Ins 621-0881 L - - PEST CONTROL Mowing o Edging STrimming Plugging SMulching 527-9373 FREE INSPECTION FREE ESTIMATE Installati Brian CB ve're 4oty ditiy ~ 352-628 ions by C1253853 -7519 '1Z 6 Insect Spray a 3 Granular Fertilizer 3 Liquid Fertilizer 3 Weed Control (1) Granular Pre-Emergent Application (2) Liquid Applications 527-9373 FREE INSPECTION FREE ESTIMATE " I, I k, 1. 1. O "ZA ALTMAN'S FAMILY PEST CONTROL WHAT'S MISSING? Your ad! Don't miss out! Call for more information. 563-3209 4;AbI" Trades cp/Skills L -- - Copyrighted Mfteial %WW IIOwn% W V II VII HEAVY EQUIPMENT MECHANIC Needed for Road Construction Company. Must have min. of 5 yrs. exp. working w/dlesel equipment & valid driver's license. Great company w/good pay & benefits. Call (352) 797-3537 EOE/DFWP CLASSIFIED Housekeeping /Laundry Aide Seeking full time Housekeeping/ Laundry aide. Exp. preferred. Only serious applicants need apply. Please no phone calls. Aply at SURR PLACE OF LECANTO 2730 W. Marc Knighton Court, FRAMERS & HELPERS WANTED Work done in Spring Hill; area. 40/hr. wk. Must have trans. & tools. (727) 243-2692 INSTRUMENT, PERSON , Needed for Survey Crew w/road i Construction Company. 401K/ Health/ Vacl Call (352) 797-3537 EOE/DFWP I ALUMINUM I FRIDAY, MARCH 3, 2006 5D FRAMERS & LEAD MAN WANTED (352) 422-2708 LABORERS Needed, to help assist in loading household goods, Full time or Part Time. Start Immediately, Contact Dicks Moving Inc. (352) 621-1220 LOOKING FOR CERAMIC TILE CREW & EXP. CARPET INSTALLER Call (352) 564-2772 MARINE FORKLIFT OPERATOR Fulltime position. Prior marine forklift exp req'd. Competitive pay w/benefit pkg. Apply In person Riverhaven Marina, _5296 S. Rivervlew Cir. Homosassa 628-5545 ,,MASONS $20 hr. & LABORERS 352-529-0305 NOW HIRING! METAL INDUSTRIES (Manufacturer of A/C grilles, registers, and diffusers) Tour Our Facility! AT: NOW HIRING! METAL INDUSTRIES (Manufacturer of A/C ,grilles, registers, and r;, diffusers) Tour Our Facility! Come join us on: Friday, March 3, 2006 9:00am-2:00 pm 400 W. Walker Ave. Bushnell, FI 33513 Applicants will have 'the opportunity to complete an Sr errmpie.,ment p"opih.',: 3i.':,r. 1.311 ..lir. a-. .rmTer.l L.uperr.i.fr: tour the facility, ask questions, and learn about the current positions available. Applicants -,jnay attend anytime ',.' -r.\e-ri -''0 L amrr. -2 00 pm. c tCi61ni Dernefits :.package and 401k with company contributions. DFW, EOE. yiSIT OUR WEBSITE AT: S PEST CONTROL ^ SALES Exp. Only. 20% *, commission. Paid . -weekly.Company '. truck, benefits Call Vinny Nelson S(352) 628-5700 (352) 634-4720 PLASTERERS & LABORERS Must have transportation. 352-344-1748 PLASTERERS LABORERS 'Needed Citrus Co. Work. Transportation provided. Vacation. 352 -621-1283 EXP PLUMBER V e Starting Wage Htween $16-18/hr. ALSO HELPERS . Benefits, Health, SHolidays & Paid SVacation. 621-7705 PLUMBERS & -, PLUMBERS HELPERS Exreaedroly. Must e have at least two years documented ,experiencehrough,top out 'and trim plumbing. Competitive Pay -:and Health Benefits available (352) 237-1358 Drug Free Work Place Pool Mechanic . ll time, salary, .f benefits Call between, S 10a-4p 0 (52) 344-4861 PROFESSIONAL DRIVERS WANTED Will train. Must have clean CDL w/ 2 years driving exp. Good attitude, hard working, dependable knowledge of Citrus County. Good Pay. Call 352-489-.3100 GROUNDS PERSON Wanted for Tree Service. DL. 746-5129 Plywood Sheeters & Laborers Needed in Dunnellon area. (352) 266-6940 PROFESSIONAL PEST CONTROL Needs Sales Tech Hourly pay Commission Company Vehicle Paid Training Paid Vacation Pd.Slck Days, $30,000. + 344-3444 QUALIFIED I SERVICE TECH I Must have experience and S current FL Driver's Ucense & Apply in person: SDaniel's Heating & S4581 S. Florida Ave. S Inverness. illi--- Stucco Plasterers & Laborers Needed 352-726-9681 TAFFLINGER PAINTING Seeking experienced painters for local work. Please leave message (352) 341-3553 TRIM CARPENTER Experienced, own trans., pay by exp. (352) 596-4800/ (352) 400-2110, Frank TRIM CARPENTER'S HELPER WANTED $7/hr. No exp. necessary, will train. (352) 527-8316 Vinyl Siding & Soffit Installer Exp. req'd. Apply in person MH Services 7075 W. Homosassa Trail, Homosassa 628-5641 WANTED EXP. TIRE TECH/ OIL CHANGER For very busy .shop, hrs. Mon. Fri. Only, Valid Driver's License req. Call BEASLEY TIRE 352-447-3174/563-5256 WANTED DIESEL MECHANIC/ MAINTENANCE Full time position available for experienced person with tools. Applicants must have verifiable work experience. Salary Open.' Apply In personal: Inter-County Recycling Inc. 1801 West Gulf To Lake Hwy. Lecanto Drug Free Work Place EOE WAREHOUSE ASSISTANT Must have plumbing and irrigation experi- ence, computer exp. helpful. Must be friendly & energetic. Mon. Fri. 8 4:30 Full benefit package. IApply at Golden X Plumbing, 8 N. Florida Avenue, Inverness. Ask for Ira. Wilson BAKERY HELP & PKG & DELIVERY EARLY MORNINGS Apply Monday Friday before 10am at 211 N. Pine Ave., inv. Caregivers S&S Resource & Services seeking persons to work with developmentally disabled. Call (352) 637-3635 CDL Drivers, Equip. Operators Office Help Growing company skills. Good pay, holidays, sick and vacation pay. Must submit to drug & alcohol screening. Mail resume to: P.O. Box 1383, Inv. FL 34451 Customer Service Representative Part-time * Are you a customer service champion? * Have exceptional computer skills? * Organized & detailed oriented? * Enjoy a fast paced challenging work environment? * Available early mornings & weekends? Join the Citrus County Chronicle's Circulation team Email Resume to: hr@ choronlcleonline,com or Apply in person at: CITRUS COUNTY CHRONICLE 1624 N. Meadowcrest Blvd. Crystal River, FL, 34429 EOE, drug screening for final applicant I I I I TradesiUB Eln/Skill-- DRIVERS NEEDED CDL Class A license, home every night, 2-yrs experience. Health benefits offered. Bonus program, hourly pay. Nice equip. Contact Mac at (352) 568-8333 Exp. Painter Own transportation, good pay for right person (352) 746-7965 F/T CUSTODIAN/ MAINTENANCE North Oak Baptist Church, Citrus Springs Experience Preferred For application call 746-1500/489-1688 FRONT DESK Hotel experience preferred. Great benefits. Full time. Apply in person: BEST WESTERN 614 NW Hwy 19, 1 Crystal River. ithacher@hospiceof citruscountv org Mail your resume and credentials to: Hospice of Citrus County P.O. Box 641270 Beverly Hills, Fl 34464 Apply on-line at hospiceofcitrus county.org dfw/eoe Immediate Openings Available for FT/PT *PT/FT PREP COOK w/ basic knowledge of Food prep & cooking skills. *EXECUTIVE CHEF is willing to train Individual to advance future career. Only serious candidates apply. 352-382-5994 Ask for Zach. .g,,, ade -4 I Tr r PLASTERERSI *I LABORERS* NEEDED* * 746-5951 --- --- J PRODUCTION WORKERS No experience needed. Gulf Coast Metal Products Homosassa Call between 8-11am, M-F (352) 628-5555 REAL ESTATE CAREER Sales Lic. Class i S$249. Start 3/28/06 CITRUS REAL ESTATE I SCHOOL, INC. L (352)795-0060 -npesn SALES/OFFICE Quick books a must, AR, AP, Apply within Joe's Carpet, Inverness SEASONAL GROUNDS The Citrus County School Board is seeking applicants for, Seasonal Grounds positions (mowing). We have (3) positions available. Please call (352)726-1931 ext. 2443 to apply EOE SERVERS BENEFITS. Applications now being accepted at between .1 pm-2pm: Cockadoodles Cafe 206 W. Tompins St. Inverness TELEMARKETERS EXP., 6 NEEDED IMMEDIATELY Set your own scheduled, Make $1000 wk, Plus Call 325-628-5700 WE BUY HOUSES Ca$h....Fast I 352-637-2973 1Ihomesold.com Welder & Helper Homosassa Area Call (352) 628-4038 WILL TRAIN Willing to work long hours, for position In well drilling operation & pump repair. Must have clean driving record. Apply . Citrus Well Drilling 2820 E Norvell Bryant Hwy. Hernando -lM --E IMMEDIATE OPENING P/T RECEPTIONIST NEEDED FOR BUSY OBGYN OFFICE Exo. Required. Fax Resume to: (352) 794-0877 m APTS. FOR SALE 9 UNITS 2/1, Crystal River, $450,000. By Owner 352-634-4076 Detailing Business for Sale, incl. truck & sup- plies, accounts, detail shop & employees, F/T business, turn key oper- ation. (352) 613-0581 Lawn Service encl. Trailer & equip. 17 monthly accts. $6500. 352-628-5145 SALVAGE YARD 7 ac MOL Towing, Repair & Used Car licenses. Bldg renovated, 3 bays w/ 2 lifts. Wreckers, Roll- backs, Forklift, Invento- ry, 1/2 mi. off 1-75; a tre- mendous growth area. Clean $725K; Owner,- (352) 793-4588 INVERNESS FLEA MARKET CC Fairgrounds Invites The Public $4.00 Outside $16.00 ~ Inside s 7am til ? For Info S Call 726-2993 SYSTEMS LLC 1-800-920-1601 metalsvstemsllc corn "LIVE AUCTIONS" For Upcoming Auctions 1-800-542-3877 ANTIQUES WANTED Glass, quilts, pottery, Jewelry, most anything old. Ask for Janet 352-344-8731/860-0888 Child's Chair (1918) $25. Treadle Singer Sewing Machine in Cabinet $95. (352) 795-5014 Two Quilts (1930's) $300. ea (352) 795-5014 ZENITH TRANSOCEANIC RADIO over 50 yrs old beautiful cond., $150 (352) 344-5933 CARPET INSTALLERS Must have paperwork. Apply Joe's Carpet, Inverness CLEANING PERSON Must be Reliable, Dependable and love to clean. Experience Preferred 352-220-8483 the...e....... 0ubtidsy a -I4 Computer credenza w/ matching stand, walnut finish $100. Portable drafting board 31 x42, $60. (352) 563-2288 Computer desk, w/ tower storage & keybrd shelf, adj. monitor tray, $100. File Cabinet, 4 drawer, locking $50. (352) 860-0444 Lg. Metal Desk, w/ file & storage drawers, & full sz. center drawer $100. (352) 563-2288 -A-- NEW WEEKLY AUCTION SUNDAY at 2:00 PM Preview at 12!00 pm Everything from tools & autoparts to antiques & hsewares, flea mkt. items; toys, fishing equip., turn. & much more consign- ment welcome, low seller fees. Located at 6680 gulf to Lake Hwy. CR, Same build- Ing as Carlos Tires near the Publix Call Us (352) 247-1025, 247-1054 *SUPER. Antique & Collect. AUCTION *SUN. MARCH 5* 4000 S. Fla. Ave. Hwy. 41-S, Inverness PREVIEW: 10 AM AUCTION: 1 PM Victorian furn., clocks, Irg. collect, of rental antiques & paintings, pottery, deco & mad. oak turn., country & prim.collect., jewelry, Hummels, stamps & much more! See web: www. dudleysauctlon.com AB1667 AU2246 12%BP 2%Disc ca/ck JOBS GALORE!!! EMPLOYMENT.NET LABORERS NEEDED No exp. necessary Benefits offered. Valid Drivers Lic. & Heavy Lifting Required Gardners Concrete 8030 Homosassa Tri. LANDSCAPING & IRRIGATION HELP WANTED. 352-422-7559 MAINTENANCE DIRECTOR Must have strong organizational & team work skills. Plumbing, electrical & A/C background required. No Phone Calls. Apply at: Barrington Place 2341 W. Norvell Bryant Lecanto, FI :6NEN a SUPRVSO 29 hp Mahindra diesel 4x4, new loader, box blade & trailer. $10,500. (352) 628-5358 -E ADVERTISING NOTICE: This newspaper o does not knowlingly accept ads that are not bonatide employment offerings. Please use caution when responding to employment ads. REAL ESTATE CAREER | Sales LIc. Class l S$249.Srt 3/28/06 CITRUS REAL ESTATE I SCHOOL, INC. S (352)795-0060 Junior Staff Accountant The West Central Florida Division of SMercedes Homes, Inc is currently seeking an Individual that will process take downs, assist accounts payable, conduct weekly check runs, and assist accounting department. Must be proficient in MS Office and a Degree is preferred. Seeking an independent worker with the ability" to multi-task. Send Resume to: DCooper MerHomes.com DFW/EOE. -0.., p^-- C=rlffnB King size bedroom set, bed, mattress, dresser, chest w/ mirror, 2 night stands. $300. (352) 489-5207 KING SIZE PILLOWTOP MATTRESS Sealy Posturpedic exc. cond. $125. DESK, Wood, custom made $65. 352-628-3868 King size Serta Pillow Top Mattress Set, still In plastic, 6 mo. old. Paid $1200. Asking $400. (352) 746-7877 Large Entertainment Center, 1 PC, white washed look, for 33" or smaller TV, Storage & stereo space. $100. (352) 637-2532 LazyBoy Loveseat, Double Recliner, bur- gundy, almost new $500. (352) 746-4943 Leather Sofa off white/tan, 3 cushions, clean, $150. (352) 795-2706 Barry Bonds Autographed Baseball mint cond. w/ COA, $450. abo (352) 270-3303 Botticeoll -ps cF/Ho----- Hot Tub/Spa 5 person, Redwood cabinet, like new, $999. (352) 621-1253 HOTTUB SPA, 5-PERSON, 24 Jets, redwood cabinet. Warranty, must move, $1495. 352-28615647 HOTTUB/SPA 4 person, wooden cabinet, like new, $699 (352) 527-3894 SPA W/ Therapy Jets. 110 volt, water fall, never used $1850. 352 )597-3140n W-1 Attention Woodworkers Perfomax 16 32 Drum sander, comp. w/ext. tables, stand & wheels, Like new. Asking $800. (352) 860-2228 Craftsman Radial Armsaw, with stand, lock &roll system new blade,lazer guide $200. 352-266-4698 Paslode Strap Nailer Very good cond. $200. Low-Ommnl Rldgevent Brand new In box $50.00 (352) 637-6407 WORKBENCH Professional workbench. Excellent condition, 27" x 60". $175. 352-795-2924. 2, Reel to Reels Teak, (352) 726-8548 27" PHILLIPS MAGNAVOX, color TV, exc. cond., $150 (352) 344-0172 55" Mitsubishi High Definition Big Screen TV Hardly used. $1500. OBO (352) 344-5365 2 glass sliders For 72 X 80 opening $150 OBO (352)601-3848 Interior/Exterior doors Interior Prehungs: $35 Exterior Prehung 6 Panels: $85. Mirrors $10. Next to Citrus County Speed way (352) 637-6500 Cooter Computers Inc. Repair; Upgrades, Virus & Malicious software removal (352) 476-8954 Dell Optiplex, GX1, pent. II, 349 Mhz, 256 mg. ram, 20 gb hd, 'XP Pro, Office 2000, 17" monitor, mse & keybrd. $175. (352) 621-1249 DELL PENTIUM III 866mhz; CDRW, 256mb, WinXP, 17" monitor. $265 352-245-4632 DIESTLER COMPUTERS Internet service, New & Used systems, parts & upgrades. Visa/ MCard 637-5469 MISC. COMPUTER EQUIP. up for bid; as Is condition. Call (352)726-1252 PENTIUM 2 COMPUTER Monitor, keyboard & mouse. Internet ready, Printer incl. WIN 98, $100 (352) 726-3856 Available front & 4 04 1 656237 2 Twin Beds w/ night stand, all furnishings, $500.(352) 382-3912 BAR STOOLS 2 White Leather Bar Stools. Excellent Condi- tion. $75 for both. Call 860-1840 Bedroom Set, Dining Room Table, Entertainment Center, Best Offer Avail. Sat & Sun (352) 726-1753 BEDS BEDS BEDS Beautiful fact closeouts. Nat. Advertised Brands 50% off Local Sale Prices. Twin $119 Full $159-Queen $199- King $249. (352)795-6006 ,Blg Man's Leather Recliner w/massage Exc. Cond. $350 (352) 628-3755 Blue/Brown/belge plaid Sofa. 2- oak glass end tables w/matching coffee table. 2- mauve L/R lamps. $400. for all. (352) 860-0334 L/M Brand newly Sofa w/2 recliners and vibrator. Beige colored. Half Price $400.00 OBO (352) 615-9262 CEDAR RUSTIC SOFA TABLE Beautifully finished; Hand made $225 352-726-8508. CHINA CABINET with hutch, $75. BEDROOM SET, dc.ube r.3,=lL'.ra ar--..:er miTrror .:r..t .:r .r .-ari iramTe rno mattress or boxspring, $75 (352) 344-8328 Coffee & End Tables, white rattan, glass top $125. Sofa & Love Seat, .-.ie .' :n', pattern, n e rne., $575. (352) 382-1381 Coffee Table w/' two end tables w/ doors for storage, light pine, $100. (352) 257-1478 DINING SET, 4 chairs, table with leaf, lighted china cabinet, white wash, exc. cond., $350 (352) 637-0477 Ent. Center, light, wood excel, cond. holds 20-27".TV, $45. (352) 465-3939 Iv. msg. Entertainment Center (key west style) 36" x71x24 $150. aba TV,19", Sampson, newish, $245. obo, Inverness (352)201-9430 French Provincial Dining room table, 1 leaf, 4 matching chairs. Good cond. $50. (352) 628-9401 Full Size Beds, $30 The Path Shelter Store 1729 W. Gulf to Lake Hwy. (352) 746-9084 Glass Top Table rattan base, pickled white w/ 4 coaster chairs, Eterge to match $350. (352) 382-1381 King size bed w/ Oak 174"WX78"HX 16" D headboard Incl. Inlaid mirrors, overhead lights, end. shelves, six drw.: $200.00. Sofa & love seat, bright floral . pattern: $150.00. Call Steve 352-746-5018 352-302-8880,Citrus Hills APPLIANCE CENTER Used Refrigerators, Stoves, Washers. Dryers. NEW AND USED PARTS Dryer Vent Cleaning Visa, M/C., A/E. Checks 352-795-8882 GE ELECTRIC STOVE 4 Burners, large self cleaning oven, like new. Bisque. $225. (352) 341-0443 Kenmore Ultra Wash Dishwasher, black & off white, $100.- Kenmore Plus Electric Stove, Ceram 5 burner glass top, off white. $350. (352) 637-2532 Kenmore Vented fan & light, for over the stove, off white, $75. , Small Chest Freezer White, $250. (352) 637-2532 Uke New 11/ yr. old GE Refrigerator white, side by side, ice & water in door, b.:.uahl blazer c-rie $750.(352) 795-8755 REFRIGERATOR BY AMANA Large capacity bottom freezer. Excec cond. $325.00 Call:249-3290 REFRIGERATOR BY GE 22 CU Side by Side w/Water& Ice in Door - $300.00 Call: 249-3290 Small Chest Freezer $100. Excel. condition (352) 527-3276 Stove, 30", gas $225. Kenmore 2001 self, clean, biscuit color, like new must see, Citrus. Hills area. (352) 527-8880 Washer $50.00 Dryer $40.00 Sell both for $80.00 (352) 527-0421 WASHER & DRYER, HD, $250 set, Refrig., $185 Elec. stove, $139 Guar. Free Del.. 352-754-1754 Washer, $125 Dryer, $125 (352) 564-0903 Whirlpool Washer & Dryer Older set, works well $150/obo, set. (352) 422-3829 .CrRUS COUNTY (FL) CHRONICLE Light Wood Entertainment Center, holds 27" TV, $100. Bookcase, med color $25. Pine Ridge 352-527-9226 Like New 4 mos. old Cour.lr, ir,l- l w.;..:.d S.1.. el H.3 r ,-.:, ; Pair $100. (352) 746-5613 Like New King size brass hdbrd, frame & pillow top matt/box springs. $200. Ivory Rattan Benchcraft qu. sofa slpr. $200. 352-795-2201. LOVESEAT, pastel color, Rowe furniture, like new, $225. SWIVEL ROCKER, upholstered, mauve, $50 (352) 726-2269 MATTRESS Qu sz pillow l ':- 1 lE -i. r u . Siiii pI .I.I. :. :..er $900. Sac. $300. Deliv. poss. (352) 465-8741 New Natuzzi Leather sectional, w/ chaise lounge on end; fawn. color, $2,000. Stressless Leather Chair & ottoman w/ headrest Pillow Coffee color, $1,000. (352) 637-4960 Org. Hand Painting by Jay Watson,4' H x 5' W Catalillles.$50. (352) 860-0444 PAUL'S FURNITURE New Inventory daily Store Full of Bargains Tues-Fri 9-5 Sat 9-1 Homosassa 628-2306 Polynesian Style Kitchen table, 48" glass top, 4 cushioned chairs, r, ll r.:.I-r' ,-r.r 03 e -, (352) 637-6482 Pre Owned Furniture Unbeatable Prices NU 2 U FURNITURE Homosassa 621-7788 Preowned Mattress Sets from T.-...r. ". Fulji :JO Q r r . g'. 'S . 628-0508 QUEENSIZE BED Paid $150, willing to sacrifice for $100 (352) 697-2462 QUEENSIZE BEDROOM SET. :--i. ..a ,: :. '100 P',r.,e idae (352) 527-9573 (352) 527-1179 Rocker Kennedy Style. Pine Blanket/towel rack. $5. (352) 637-6482 SAUDER ENTERTAINMENT CENTER 48"x50"x17" holds 27" TV, storage & 5 shelves, exc. cond., $50 (352)637-3579 Scandinavian Teak Dining Room Set, incl. 4 chairs. Matching. lighted China Cabinet. Excel. Cond. $850. (352) 527-0837 leave mess. Seaman's Black Sectional Couch& Chaise chair w/light grey marble look cof- fee table & 2 end tbis. $500. (352) 637-2532 Sectional Sofa tan, maroon, & blue Excel. cond. $175. OBO (352) 489-8169 SLEEPER SOFA, queen, neutral color, new cond, $105. (352) 465-6818 Small Recliner, light green, $35. (352) 621-9281. Sofa new, custom made Bassett, fabric, new $1,800. sell $800. oabo (352) 465-1074 Sofa & Love Seat, matching Lamp for. Sale, excel, cond. floral print. $350. (352) 489-4844 Sofa 93", sage, $125. (352) 341-6991 SOFABED, DENIM Upholstery, 69', $45; SOFA, Cream w/blue, brown & rust. $25. (352) 341-2263 Solid Oak & Glass expanding Entertain- ment Unit, lighted & hold CD's, DVD's and much more. Must see to appreciate $600. .(352) 465-5296 Teak King Platform Bed Incl. 2 dressers $500. (352) 527-0837 The Path's Graduates, Single Mothers, Needs your furniture. Dining tables, dressers & beds are needed. Call (352) 527-6500 TWIN BEDS COMPLETE W/Maple headboards, $50 each. (352) 465-5251 TWIN BEDS, mattress, foundation & frame. $75 each (352) 637-3172 WALL UNIT, 3 pcs., pine, 2 shelves, 76"x32'x16' ea. 1 cabinet, 48"x31"x20" $195 (352) 344-8368 Wall Unit, 3 piece 7' 4" W, 7' H, w/smoked glass doors, lights, rm. for Ig. TV, solid wood, . sliding doors $800 obo. (352) 860-0444 4 Chairs, w/ casters 11/2" -PVC, quality made, w/ 54" octagon, table, excel. cond. new $700. asking $300. (352) 382-3298 8 piece deluxe pvc patio set. Glilder (352) 382-0042 2 Club Chairs w/ottomans, blue & wht. striped. Orig. $900/ asking $300, Computer Desk, $40. (352) 341-4444 2 swivel rockers, $50.00 living room chair .$30.00, Call Steve (352) 746-5018 (352) 302-8880 Citrus Hills 4 PC LIVING RM SET Lt. beige leather, good cond. $500. ENTERTAINMENT CENTER good cond. $50. (352) 628-0139 5 PC BEDROOM SET Ughted, storage head- board w/pldtform brass pedestal ta- ble, w/ 4 matching chairs $350. obo (352)465-8332 after 10a 9 Pelce Cherry queen ann Dining Room Set . $850. (352) 726-5233 3-PC. COFFEE TABLE & end tables, matching, $50. 2 BOOK CASES Tall, $30 each (352) 344-8328 90" Sofa w/ recliner on each end. Fold down tray In middle, more extras. $500. Metal Trundle bed $300. (352) 489-8383 96" Curved Green Plaid Sectional with Recliner at each end. Exc. cond. $400. SMW. (203) 889-8866 Ashley Din./ Pub. set. $250.Oak Cabinet 44W x1 7D x 87H $275. For Info./email plcs (352) 527-0162 476-8211 CLASSIFIED )yrighted Material indicated Content-- ICommercial News Providers" V I MR CITRUS COUNTY REALTY ALAN NUSSO 3.9% Listings INVESTORS BUYERS AGENT BUSINESS BROKER (352) 422-6956 Briggs & Stratton 6.5HP Yard Machine Chipper/Shredder, 3 way system, excel. cond. used only once pd. $600. New $350. (352) 527-8646 CRAFTSMEN MOWER 4I' ,:u 18HP, new belts & blades, runs.& cuts great reeds battery. 2-" (352) 563-0818 FREE REMOVAL OF Mowers, motorcycles, RV's, Cars. ATV's, jet skis, 3 wheelers. 628-2084 GARDEN TUMBLER Large Compost Tumbler $250.00. 795-1549 John Deere Riding Mower, older but runs fine, 30" cut, bagger, $400. Leaf vacuum, on wheels, $75. (352) 860-2337 LAWN SWEEPER 38", Craftsman, $100 Call (352) 344-2361 SEARS RIDING MOWER, 22HP J-2"Cul ued ,rone .ea.,:.r., .3a 1 .-,.) Ii OSj (352) 586-9498 SNAPPER, Riding Mower $350. Seir propelled good .crnd. Self propelled Mower $75.(352) 746-7357 Troy built riding mower Ir.p r..iri ,I inr o.-r.mrr r,cIro rlaior roc r.: .. lr,. J;. -ut Ii.'e r.e .. *.:'Lo O' ... (352) 637-3753/341-3900 ANNUAL PARKWIDE YARD SALES Saturday, March 4, 9.00 AM ? Village Pines Campground 7 Miles North of Inglis on US 19. BEVERLY HILLS Sat.9am-2pm Mulit Family Sale Furn., knick knacks, toys, girls bike. 55 S. Osceola St BEVERLY HILLS Fri & Sat. 3 &4, 8a- lp 235 S. Monroe BEVERLY HILLS Fri. & Sat. 8-2 Furniture, household goods, clothing 451 W. Sugarberry Lane off Forest Ridge., BEVERLY HILLS Fri.& Sat. 9am-5pm Furn., household, clothes, TV, etc. 1 New Florida Ave., BEVERLY HILLS Saturday, Mar. 4,9a-lp 4439 N. Bacall Loop BEVERLY HILLS Thurs., Fri. & Sat., 8amrn Furniture, collectibles, hardware, clothing & knick knacks, etc., 308-310 S. Fillmore St. CHASSAHOWITZKA 1st Christian Church, S. Riviera Dr. Friday & Saturday 9-3. Furn. appls, lots of misc. CHASSAHOWITZKA Fri & Sat 9am-3pm Tools, Furn. marine stuff, AC, doll house, wine Jugs, jewelry & antiques 8461 W. Crane Ct CITRUS HILLS Sat. 8am. Moving Sale Furn, pictures, odds & ends 715 E Keller Court CITRUS HILLS Sat. 9-3. Something for everyone 1105 N Chance Way. CITRUS HILLS Saturday; March 4,8-2 MULTI-FAMILY SALE No early birds, children clothes, toys, pre school curriculum, hshld. misc. 1159 W. Pearson St. CRYSTAL RIVER Fri. & Sat. Mar. 3&4, 8-2 Coast Guard Auxiliary Bldg. 148, NE 5th St. Sponsored by TOPS 408 CRYSTAL RIVER ESTATE SALE SAT 8-2 523 N Golfcourse Dr. Everything must gol CRYSTAL RIVER Fri. & Sat. 3 & 4, 7a-4p Housewares, tools, furn. & '73, Pontiac, Car 2620 N. Donovan Ave. CRYSTAL RIVER Fri. & Sat.10am-1pm Din. Rm., twin beds, office desk, & misc. 2565 N. Crede Ave. Crystal River Moving Sale, Fri. & Sat. Mar. 3& 4, Jacuzzi, Nor- dic trac, tools, furn..& misc.., 3875 N. Sagamon Pt. off St. Prk Rd. CITRus COUNTY (FL) CHRONIOLE CILASSIIFIIEDS 6D TFDAwr> MAKcH 3, 2006 _- C CITRUS HILLS Sat. Mar. 4, 8-12N 2602 N. Clements Ave. CRYSTAL RIVER Sat. Mar. 4, 9am-lpm Monthly Yard Sale Many new items, turn., dishes, hshld., sporting. Proceeds help support low cost, spay/neuter, for dogs & cats. HUMANITARIANS OF FL. 1149 Conant Ave 2 blocks N or the Key Center CRYSTAL RIVER Sat. Misc. household items. Lots of boys clothes: 6,7,8. Girl clothes:3-4 5425 W. PAUL BRYANT DR. CRYSTAL RIVER Starting FrIday 3th (352)%63-5032 Crystal River United Methodist Church HUGE SALE Sat. 8-1 4801 N. Citrus Ave. FLORAL CITY Moving Sale, Wed. till all sold. Records, books, HO scale train layout etc. (352) 637-5688 GOSPEL ISLAND Thurs., Fri., & Sat. 9a-3p 9128 E. Crescent Dr. 2nd ent. to Pt. of Woods Hernando Wishing Well Ctr on Hwy. 200 Sat. 8-4 Huge Salel HERNANDO Estate Sale, Fri. & Sat. 7am-3pm 999 Winnetka St., Forest Lake North subd.Entire contents of household HOMASASSA Hugh Yard Salel March 3,4,5, 8am-4pen If you need it chances are we have It. 6462 W. LiUberty Ln. off Rock Crusher Rd. 628-3012 HOMOSASSA Fri & Sat 9 ? Video Tyme Too 4980 S. Suncoast Blvd. HOMOSASSA Fri & Sat. Rain or shine, Tools, appliances, Furn, commercial stove, collectibles, 4620 S. Corbett Off Grover Cleveland. HOMOSASSA Fri. & Sat. Mar. 3 &4, 8-2 MANY ITEMS 2521 S. Wakulla Pt. HOMOSASSA Fri. & Sat. Mar. 3/4, 8am Bldg. materials, 3.0 doors, air handler, elec. supplies, misc. pipe. tubing & steel, GEO top & set of rims. airboat jackplate. Ford headers 7887 W. Homosassa Tr. (352) 212-1114 Homosassa Fri. & Sat., 3 & 4, 9a-3p 2597 S. Coleman Ave. HOMOSASSA Moving Sale 352-382-1337 or 352-257-3756 Homosassa Saturday March 4, Canoe, lawn mow. bike 6085 W. Meadow St. Homosassa Springs Friday & Sat. 8 ? Neighborhood Sale All in one big Yard,. Follow signs from Quick Save off 490, corner of Radiance & Alabama, Tools, canopy bed, vac- uum, collectibles, vintage, too much to rer lsnt INGLIS M1urt, roJnill y'aia .-'1 190 & 200 Hudson St. March 3 & 4, 8am Rain or Shine INGLIS Fri. & Sat. Mar. 3&4, 8-4 misc. items, and motor home, 5631 SE 194th St. INVERNESS 3 family moving/yard sale. Fri. & Sat. 7am-? Everything must go 3045 E, Fawn Ct, Deerwood INVERNESS 3-fam. Fri. & Sat. Turner Camp to Oak Haven INVERNESS BIG YARD SALE 3/2, 3/3, 3/4, 3/5 9933 Perch Ct. INVERNESS Fri. & Sat. 8:30-? -Washer, Wheelchair, Numerous Baby Items, Table w/6 chairs, Fabric, & misc. 725 S. Crabtree Pt. (352) 726-9758 INVERNESS Fri. & Sat. 8a- 3p, 1039 LOWELL TERR INVERNESS Fri. Oasis M.H.Park, 4624 S. Florida Ave. SINVERNESS Garage sale, Fri. & Sat. 8am-? 3815 E. Beck St., off Independence INVERNESS Huge 2-fam. Estate Sale. Thurs. Fri. Sat. Antiques, furn. paint- ings, 1036Fordham PL INVERNESS Huge Yard Sale Fri. &Sat. 3 &4, 9- ? 124 N. East Avenue (Off Croft) INVERNESS Large yard sale, Frl. & Sat.'9am-5pm Merchandise from Estate minus furniture. Too much to list. Priced to sell. 1020 Cedar Ave. @ Inverness Blvd. INVERNESS Lawn sale. Thurs. Fri. & Sat. 8am-5pm 4700 & 4702 Bow-N-Arrow Loop, off 581-S. INVERNESS Mar. 3 & 4 8-3 Neighborhood Sale Sweetwater Point; children's itms, toolsetc. INVERNESS Sat., Mar. 4, 8-12N Tools, Kayak, clothing 3926 S. Cameo Terr. INVERNESS Saturday, Mar 4, 7a-3p, 931 Carnegie Drive off Old Floral City Rd. Clothes .25cents, furni- ture, household, books sewing machines, Jew- elry & much more. INVERNESS Thurs. Fri. Sat. 8am-? Furniture, riding mower, misc. 121 Cherry Ave. INVERNESS Yard Sale, Fri. 1 pm-5pm Sat. 8am-? Something for everyone. 9018 E. Swift Ct., corner of Maplenut Way & Swift INVERNESS Yard Sale. Fri. & Sat. only 8am-4pm Books, clothes, linens & more. 3104 S. Buckley Pt. Kensington Estates Saturday, Mar. 4, 8-3p Sofa, tables, lots more 311 N. Brighton Road Needed at prestigious Black Diamond Country Club located In Lecarito. Minimum of two yrs. experience as a line or lead cook. Apply at Black Diamond HR & Acct. at Rock Crusher RV Pk Rock Crusher Rd. Crystal River DFWP DR Chipper 12HP, w/ accessories, used 3.3 hrs. like new, $1,400. (352) 860-2385 Elvis, 20 pictures taken at last concert, $150. '77 Calendar Poster Sz. never put together, $195.(352) 628-5230 Featherlite Gas blower, $50. Exercise Bike Go Meter $25. (352) 527-7223 $50. Safety Pool enclosure $15. (352) 726-9886 Inverness-Hickory Hill II Multi-Family Sat. 8-? Dream Terrace Keywest JUMBO SHRIMP 13 -15Ct. $5.00 Ib Misc. Seafood 795-4770 LECANTO Sat. 8am Piano, Furn & misc. Timberlane Estates Corner of Rabeck & Cindy LECANTO Saturday Morning Only 1729 W Gulf to Lk. Hwy. All proceeds to benefit The Path Rescue Shelter (352) 527-6500 Meadowcrest Spring Yard Sale Sat. March 4, 8a-lp Winn-Dixle Parking Lot - Hwy 44 In Crystal River OLD HOMOSASSA Clothing, household Items, baby items, collectibles. Palmetta St. Thurs. Fri., Sat. 8am PINE RIDGE 6,000 VHS tapes, .50 ea. 100 Lots, 527-4320 RIVERHAVEN GOOD STUFF, Artworks, Hshld. Items, Furn, bikes, Fish, ProLine Boat, silk flowers, Sat. & Sun. 8-2. 5186 S. Stetson Pt. BURN BARRELS * $10 Each Call Mon-Fri 8-5 860-2545 2 Twin Size Beds Good cond. $30 each. Small Platform Rocker $30. (352) 621-9281 14 cu. ft. Kenmore frost free Freezer, $75. Antique bench w/ storage $125. (352) 726-9886 55 GAL. AQUARIUM Encl. in beautiful wood cabinet. Pd. $750. Sell $300. FIRM 352-422-1519 / 527-6997 100 gal. propane tank, like new. Full $80.00 OBO (352) 637-1161 2- 11' x 12' carpet 1- Burgandy & 1- Tan $20. each (352) 341-4449 34' Trailer, Country Aire, $2,800. also, washer, electric saws, much more... too much to list Call (352) 447-2994 8MM MOVIE PROJECTOR. - Lrg screen, also viewer & splicer, asking $100, Inverness (352) 344-1727 ALUMINUM WHEELS 16", set of 4, $100 (352) 344-1692 Carpets w/ pads, used, 13' x 16'., & 14' x 14', dark green, both $135./obo (352) 795-9950 Casino Slot Machine, takes tokens, excel, cond. $175.00 50's record player, RCA Victor $195.00 (352) 628-5230 Coleman Direct Vent Forced Air Furnace. 55000btu, 44000 output, reconditioned. $100. Buyer remove. (352) 726-2463 Commercial Sewing Machine Consew, walking foot, maple table - $200. (352) 447-6281 COOKS STove; Lg. run. prop. griddle w/cart. Port. Hot Dog roller grill. HD church dining tbis. Call St Margaret's Church (352) 726-3153 Electric Jazzy Wheelchair excel cond. $1,200. (352) 527-3276 Electric Wheelchair Jazzy 1120, used very little, $2,500. (352) 637-0089 LIFT RECLINER CHAIR Like new cond. Dark blue velour. $600. Call (352) 726-9503 -I-NalIi i "A" Model Mandolin, Hondo, Vintage 60's, great shape, $79; Mandolin, nice begin- ners model, $35. (352) 746-4063 Baldwin Upright Piano w/music & Metronome $500/obo (352) 344-2345 Freedom II Organ with 2 keyboards and bench. $950. (352) 489-8383 WANTED Christian Bass Player GOLD STAR MICROWAVE Model ER4010 works fine 19 x 12 x 10 1/2 $20 OBO Phone: 795 0999 Noritake China, Blossomftime, 12 place settings. 90 pieces, like new. $250.00 (352) 382-4537 Recumbent bicycle Stamina 750 Brand new. $150. (352) 746-4028 Treadmill, Vision T7000, variable speed/incline, $400. Total Gym 1700 w/ attachments & weights, mint, $200. (352) 382-9034 2002 Easy go Golf Cart, Electric,Exc Cond (352) 302-9345 26" WOMEN'S HUFFY BIKE, 6-speed, balloon tires, fenders, large seat, lock and chain, like new, $45 (352) 637-6836 Bicycle, Ladies 26" 5 speed, $35. Corner weight Gym, free, (352) 795-9344 Bow-Mathews "Switchback" 28'2" Draw, must sell $650. (352) 527-2792 Keywest JUMBO SHRIMP 13 -15Ct. $5.00 lb Misc. Seafood 795-4770 NEW 18 SPEED JEEP Sports Bike, $75 (352)637-1617 IUDAY IVXA.KL-rl - F*iw NOTICE Pets for Sale - In theState-Of Florida * per stature 828.29 all dogs or cats offered for sale are required to be at least 8 weeks of age with a health certificate per Florida Statute. 2 FEMALE SUGAR GLIDERS, large 30x28x18" cage, $275 (352) 344-2974 2 Ferrets Must go together, must have cage, $125 352-697-0125, after 10am. 4 Jack Russell Puppies 3fem. 1 male, Health cert. 8wks. $350 each. (352) 697-2140 ADULT MUSTACHE PARAKEET $150 (352) 628-4441 Aquarium 25 gal. rectangular w/ wooden stand, light, hood. Whisper power filter & gravel. $85.00 (352) 746-7232 FREE PUPPY 6 mo old Rott/shep pup, all shots.spayed, needs single dog hm, very loving. 352 634-4350 German Shephard,1 yr. old, all white, neut., house trained, pet track, shots, good watch dog, needs love & room to run. $50.00 (352) 527-7404 Humanitarians of Florida Low Cost Spay & Neuter by Appt. Cat Neutered $20 Cat Spayed $25 , Dog Neutered & Spaved start at $35 (352) 563-2370 Red Tail Boa w/ cage (352) 489-0907 SHARPER & LAB MIX PUPPIES. Foster Care Animals. $75.-$100. 352-220-6343/563-1905 2 HORSES, 1 Morgan, 1 TWH, Please call (352) 621-7729 or (352) 634-1143 Horse Sitting w/TLC at your barn. Long & short Term. 352-746-6207 1, 2 & 3 BDRMS. Quiet family park, w/pool, From $400. Inglis. (352) 447-2759 Crystal River 2/1.5 furn. sgl. wide home w/ carport. CHA. $650/mo 1st, last & sec.(813) 361-4615 Floral City New owner, completely refurbished, MH, 1/1 W/D, storage, 1/2 acre lot, attractive setting treed. Move in special (352) 476-3948 U"MbleHome Q for en Golf Clubs, ler nana $200. Sea Shells $5. (352)564-0637 Keywest JUMBO SHRIMP 13 -15Ct. $5.00 Ib Misc. Seafood 795-4770 LAPTOP HP, computer, printer, web cam, $389 FIBERGLASS SHOWER off white, $400 new, asking $75 (352) 257-0419 (352) 563-4169 Ughted Natural Finish Etarge $250. Ladles golf clubs $70. w/cart (352) 382-2913 MISCELLANEOUS Track lighting, new, $50. 2 professional camera bags, $20 and $50. 352-795-2924.' NY STYLE HOT DOG CART Butane dbl. burners, side sink, cooler compartment, w/many extras. $2000. (352) 382-5030 Propane Tank, 120 gal, 52lbs of propane In tank, $250. 352-637-2349 585-733-6709 .QUEEN BED, mattress & boxspring, $60. ELEC. STOVE, $60 (352) 464-0316 REFRIGERATOR, GE, white, ice maker, 18.2 cubic ft, $150 Organ, Yamaho Rivet DFWP Shrink Wrap System hardly used, excel. cond. w/ heat gun 1200W, & 400 ft., roll of film$350. (352) 382-5734 SIMMONS BEAUTYREST Pillow top, frill size mattress, never needs turning, exc. cond. $50 Manual treadmill with counter, $15 344-1993 SINGLE HORSE TRAILER $400. good cond. $400. Call 628-5542 before 1pm or 628-1962 after 6pm Suitcase 20"x18", $20. Hip Boots Sz. 10, LaCrosse $15. (352)564-0637 WASHER & DRYER $50 each. 2 Twin Beds, $20 each. (352) 637-3253 WROUGHT IRON Outdoor Patio Set table & chairs, $50. Nice Oak desk $25. I 1/1, 35', FI Rm. 2/3, DW, 28 x 60, horse barn, kennel, storage bldgs., fenced & cross fenced. Paved Road $195.K (352) 427-4720 1981 SW, 14x 60 Fl. Rm., Scrn. Por., /2 acre, quiet street, after 4pm, (352) 586-2611 NICE SINGLEWIDE ON HALF ACRE. 3-4 miles from Homosassa Walmart. Call C.R. 464-1136 to see it. $60,000. View Photo Tour at; enter tour #0047-6128; Slick on Find Tour. American Realty & Inveistments C. R. Bankson, Realtor 464-1136 POOL TABLE, Gorgeous, 8', 1" Slate, new In crate, $1395. 352-597-3519 ROSS LADIES ENGLISH style, 10spd., touring bike, 27" tires, A-1 cond. $55 LADIES 7 spd touring bike, 26" Irg. tires, fenders, like new cond $75 (352) 344-5933 Schwinn Sierra Sport Ladles Mountain Bike, like new V2 price $150. (352) 302-9261 WINCHESTER MODEL 12 16 gauge pump, at least 75 plus years old. $400/firm. REMINGTON 742 Woodsman, 30-06, semi auto, 150th Ann. model 1966, only 1100 made, $500, (352) 344-3536 or 563-9768 17'x7', Dble axle,new tires + spare, only used 1 time, $1400. (256) 239-6945 BUY, SELL, TRADE, PARTS, REPAIRS, CUST. BUILD Hwy 44 & 486 Flatbed Trailer w/ removable sides, tilts, tongue jack. spare tire, 4.5' x 10' $350/obo. (352) 341-3716 MOTORCYCLE TRAILER Wanted to buy for single motor cycle. (352) 860-1211 SMALL FORD PICKUP BED TRAILER with spare, $100. (352) 464-0316 -C Graco Car Seat Stroller/combo $125. Infant to Toddler Rocker vibrates, $25. Like new cond. (352) 341-6920 Diamond Wedding Set 2 Carats, center stone marquise, 11/2 carats, 8 baguettes on ea. side, 8 round across ea. band $3,500. obo (352)465-8332 after 10a -1 ANTIQUES WANTED Glassware, quilts, most anything old, jewelry, Furn. We Also liquidate Estates. Ask for Janet 352-344-8731/860-0888 BUYING OLD WOOD BASEBALL BATS Any condition. Baseball gloves & signed team balls. (727) 236-5734 IRREGULAR. PLANKS Need planks for rustic furniture. Preferably with bark. 352-726-8508. 2 Bd, 2 Ba MH on 1/2 acre. Fireplace, Priced to sell (352) 270-3345 or 270-3350 1977, 14 x 56, SW, newly remodeled 2/1, w/ all newer appl's, $2,000. oblls 447-4398 2005 Lot Models 3/2 and 4/2, Must Go. Special Pricing. Call today (352) 795-1272 BANK OWNED .REPO"S! Never lived in Starting @ $40,000 - Only a few left Payments from $349.00 per month Call for locations 352-621-9182. Coll Builder @ 352-628-0041 CHEAP Mobiles for Sale ,$2,500. obo, Call.Bob (352) 812-1000 Come See Our New 2366 sq. ft. Modular Homel Site Built, Quality Manufacturing Prices Call today (352) 795-1272 HOMOSASSA In park; fully furnished; FL Room; Central H/A; Carport; 3 Outbuildings All this for $22,000 ,(352) 628-9007 Mobile Home $15,900. New kitchen & Bath 55+ Park 7ml. N. Inglis Cell (570) 561-3716 Over 3,000 Homes and Properties listed at homefront.com STOP RENTING!!! Brand New: 3/2 on well HERNANDO 1/1, water view like new, no smoking/pets, $550./mo. 352-746-6477 HOMOSASSA/LECANTO 1/1, scrn. rm. $380 mo. Sec. No Pets Don Crdgger Real Estate (352) 746-4056 IN QUIET PARK w/pool. IBR 1 bdrm trailer, $300mo., Free Utilities & Satalite, fenced yard, pets ok (352)563-1465 CRYSTAL RIVER Newly Renovated 1 bedrm efficiencies w/ fully equip kitchens. No contracts necessary. Next to park/ Kings Bay Starting@ $199 wk (Includes all utilities & Full Service Housekeeping) (352) 586-1813 FLORAL CITY Lakefront IBR. Wkly/Mo No Pets. (352) 344-1025 Crystal Palms Apts 1& 2 Bdrm Easy Terms. Crystal River. 564-0882 CRYSTAL RIVER 2/1 $650/mo. Coldwell Bank (352) 634-0297 CRYSTAL RIVER Nice 2/1 duplex, $525/mo. 1st, last & Sec. 352-527-3887 352-563-2727 E--1 Crystal Palms Apts 1& 2 Bdrm Easy Terms. Crystal River. 564-0882 3/2OnO2Acre, Paved Roads, Landscaped, Good School, In Homosassa, Call (352) 795-1272 3/2 WITH POOL Gar. & carport. Huge orange & grapefruit trees on 1/3 acre. Cinnamon Ridge by owner. $96,000. (352) 212-1827 $2,000 and $650 mo. (352) 795-6085 BY OWNER 1 AC W/14X60 2/2 SPLIT, DBL Roofover, NEW deck, siding, Int, Lg. trees, fenced, priv.. custom finish, very unique, Priced Reducedl 352-586-9498 Corner of Northcutt & Dunnellon Rd. 3/2 Manufactured Home on 1+ ac. Newly remodeled. $99,000 (419) 865-8630 Crystal River 2/1, SWMH on I. $57,000. View Photo Tour at wwwviBualtour.corn; enter tour #0047-6128; "Best Quality Lowest Price" American Realty & Investments C. R. Bankson, Realtor ! 464-1136 i FLORAL CITY 2/1'/2/Carport Glass screened room. New AC. 14X60 Nicel $49,900. (352) 344-1362 HEATHERWOOD Hilltop property; 2-1/2 acre, 1996 trlplewide, Irg. workshop. Also Irg. shed. Completely fenced. Adjoining corner acre avail. Seen by appt. only $200,000 firm No Agents please (352) 726-2539 HERNANDO 3/2 CHA, i2ac, LARGE 3/2 Beautiful 2000 DW on .97 acre in Homosassa. Reduced $119,900. Must Seel 270-3318 or 302-5351 Beautiful Park w/ pool. Free 6 mo. MH lot rent. RV lots $170. & up. (352) 628-4441 SOver 3,000 Homes and listed at homefront.com LECANTO 40x100 lot in Senior park for rent, $228mo 352-746-1189 CRYSTAL RIVER Hunter's Spring Condo- 2/2 unfurnished $850. INVERNESS Cr.rmson Lane 3#2/1 with eec.a tbacK yard and rnea S750. MEADOWVCREST MeaaoAc res3I/i13 Cryslai Ri.er $1,000. 31/22. 2121are fu ee h...$1.000 21.5 fum, elecvnmwateinL...$975 CRYSTAL RER 221 in the couny....................... $750 : .Hi We Hove SnSONA RENTAL CI, FOR LiST Marie E. Hager B-oker-,0, l or-popedty ManaCer 3279 S, Suncoist 01.U= Homoo. FL (352) 621-4780 1-800-795-6855 For Sale or Lease 2423 sf office, located in Meadowcrest Professional office park. Stand alone building, offices, upstairs conference room, 3 baths, 1 w/ shower, new carpet & paint, CAT5 wired in all offices, Contact Julie (352) 634-3838 For more Info 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. Robble Anderson LCAM, Realtor 352-628-5600 Infogotropertv managmentgroup. 9- GATED 55+ DW 2/2, end. Fl. rm. Islnd. kit, all appll's. Custom storm awnings, 5 ceiling fans, many extras. Close to shops & hosp. REDUCED to $54,900. 352-257-1367 794-0408, after 5. HOMOSASSA BY OWNER MUST SELL DW, Overlooks Pond, 55+ Park, 2/2/crprt. Open plan, scrn. porch $58,500. (352) 228-7775 or (352) 563-1893 LAKE ROUSSEAU SW w/dock, complete newer remodel, roof over carport, scrn. rm. Shed, furn. Lot rent $150 $17K. Part trade? (352) 447-2922/ (352) 586-2657" Nice S/W 2/1 furn. scrn rm. shed, xtras, $22,900 Roomy 2/2 D/W crprt shed, $22,000. In quiet secure 55+ pk. Close to shopping. 352-628-5977 Quiet, friendly park 2/1.5, very nice, carport Ig. scrn. prch., shed, wood crown base & casings, turn., $24,500 352-860-2115 Second Home in park that caresI -E. Need a mortgage & banks won't help? Self-employed, all credit Issues bankruptcy Ok. Associate Mortgage Call M-F 352-344-0571 Beverly Hills Office/Business Space, 300 sq. ft. $400/mo. Hwy. 491 behind B. H. Liquors. (352) 613-4913 For Sale or Lease 2423 sf office, located in Meadowcrest Professional office park. Stand alone building, 6 offices, upstairs conference s room, 3 baths, 1 w/ shower, new carpet & paint, CAT5 wired In all offices, Contact Julle (352) 634-3838 For more Info Prime Location HWY 44 1/2 MI. West of Wal-mart 1760sq.ft. Retail Space, (2) 5,000 sq.ft:-out par- cels Will Build to SuitI Assurance Group Realty, 352-726-0662 CITRUS HILLS 2/2, Furn. Lke new. Long or short term/ corp. $950/mo Incl. water/garbage (352)400-2036/527-0463 CITRUS HILLS 2/2, Furnished condo, long term, $850. mo. avail. Immediately 352-726-7543/201-0991 Citrus Hills 2/2/1 Unfurn,, Clean, encld. FL oom., Screen porch $875 mo. (352)746-2206 INVERNESS 2/2.5, pool, boat launch, no smok/pets. $750. 746-3944 *Daily/Weekly rw Monthly o Efficiency Sr Seasonal $725-$1800/mo. Maintenance Services Available Assurance Property Management 352-726-0662 CITRUS HILLS 2/2/2 Den, Brand New Golf Course Home. 2400sf. $1400mo 617-327-2042 Citrus Hills Brand New Home w/ 2215 Sq. ft. 3/2/2. Close to shop- ping & golf. $1200.00 Call 352a341-3330 or 1-800-864-4589 CITRUS SPRINGS . Brand, new 3 or4 4 bedroom homes for rent starting at $975/month. Many homes pet friendly. No app. feel aAction Prop. Mgt. -Uc. R.E. Agent 352-465-1158 or 866-220-1146 rental.net CRYSTAL RIVER 3/2 New appli. $750/mo. +1st, 1st. (352) 686-9355 Dunnellon Hills 3/1/1 $700/mo. RAINBOW LKS EST2/1/1, CB $725/mo. Both part. furn/ poss. rent to own (352) 447-2849 HOLDER Lg. 3/2/2, Ig. fenced yard, dog ok. $1200/mo (352) 302-7303 HOME FROM $199/MO 4% down, 30 yrs. @5.5% 1-3 bdrm. HUDI Listings 800-749-8124 Ext F012 HOMOSASSA Spacious 2/21 BEVERLY HILLS 2/1, C/H/A, fenced yard, small pet ok, 28 N. Jeff. $675. mo., 1st, last ref., (352) 795-1863 BEVERLY HILLS 2/1/1 +Fam Rm, tlle & berber carpet W/D, C/H/A, Ig. shed, $850. mo. 352-697-3456 BEVERLY HILLS 2/11/2, nice, clean, cul-de-sac, 5 Donna Ct $850mo, 1st, last & Sec. 352-746-5969 BEVERLY HILLS 2/2/1, Avail. April 1, $775. Mo.1st. last, sec. nice home & yard 202 S HARRISON STREET Possible lease purchase 865- 933-7582 call col- lect, Cell 865-335-4545. CITRUS HILLS 2/2 Condo Citrus Hills 312 Brentwood 3/2Laurel Ridge Greenbrlar Rentals, Inc. (352) 746-5921 quiet neighborhood, $975. mo. deposit, 1st & last., avail. 3/1 (352) 812-1414 CITRUS SPRINGS New, 4/2/2, City water $1,100. mo. $1,500. sec. (772) 263-6300 CRYSTAL RIVER 3/2, near Gulf. $950 mo Contact Kristi Plantation Rentals (352) 634-0129 CRYSTAL RIVER Cottage, 2/1, CH/A, $440 795-1865 HOMOSASSA 3/2 on 2 acres, Completely remodeled In '05. $825mo. (352) 621-0750, Fld. rm, like new, no pets, no smoking close to Walmart, $1,100 mo. (352) 344-1411 INVERNESS 2/2/1 Highlands,,lanal, CHA, dishwasher, no pets $685, 813-973-7237 INVERNESS 3/2/2 Beautiful New Home, Pets on approval. Gall Stefanski Coldwell Banker 726-1192 or 601-2224 LEASE OPTION ,5/2, 11 acres, Barn/Workshop Inglis $399,000. or $1800mp. Lisa VanDeboe Broker (R) /Owner 352-422-7925 Rent to Own Many homes to choose rr.' r, in ir.i growing communirtr OCr il r S Sp r., g: 11 ,.3inef r,lr p.:-+ rar.ng: Why rent when you can get start- ed on purchasing your new home now? (352) 686-8850 or (813) 546-6982 SUGARMIL WOODS 3 1.22 ,rT Ir, ugoarr r.lll I'n,.,'; 9i L'0 I Waybright Real Estate Inc., 795-1600 Come To - Anderson'SC where Floridlan's Call Home Call Ala Today @ Terri's Team 864-314-9346 WOODED LOT F)R SALE -. Beautiful woodedlot close to Cryslai Ri;er 100-. 125 Perfecti or buid,.n. close to shopping. ,Fon more information please contact Paul @772-370-2684 asking price 55,000 will take offers. 863 N Appalachian Terrace MR CITRUS COUNTY REALTY, ALAN NUSSO 3.9% Listings INVESTORS BUYERS AGENT BUSINESS BROKER (352) 422-6956 Newly Constructed i Home (352) 302-2883 Absolutely I Precious Homest H Free Home Finder homes available. ( Free Recorded msg. 1-800-233-9558, ext 13071 ACROPOLIS MORTGAGE *Good Credit I *Bad Credit/No Crediti *Lower Rates I *Purchase/ Refinance +Fast Closings Free Call 888-443-4734 HAMILTON GROUP ' FUNDING, we specidlile in all types of mort- I gages and all types df credit. Call AnnMari Zarek, (352) 341-0311 Need a mortgage & banks won't help? Self-employed, iall credit Issues. bankruptcy Ok.- Associate Mortgage Call M-F 352-344-0571 CRYSTAL RIVER Commercial _ Warehouse for rerit. $900/mo. Contact Uisa Broker/Owner (352) 422-7925 RETIRED CORP. EXEC. Needs 3/2 home qr mobile w/Rent to own. Can put $5,000-$ 10,00 down & will pay TI taxes, Insurance & maint. during leash period (352) 726-9369 Crystal River Vacation Rentals. Sleeps 4. Open water w/dock & courtyard. $1000./mo. (386) 462-3486 .- New Homes on your land In as little as 4 mos. Call Suncoast Homes (352) 697-1655 PUBLISHER'S *r NOTICE: . All real estate . advertising In this newspaper is subject to Fair Housing Act- which makes it illegal to advertise "any preference, limitatlon or discrimination.., based on race, color, religion, sex, handi- cap, familial status6r national origin, or an intention, to make such preference, llrffi station or discrimina- tion." Familial status In- cludes children under the age of 18 -. living with parents-or legal custodians, pregnant women and people securing custody of children under 18. , This newspaper wi$ I Sales Lic. Class I .$249. Start 3/28/06 | CITRUS REAL ESTATE I I SCHOOL, INC. (352)795-0060 I= TRANQUIL GOLF & LAKE COMMUNRI IN ANDERSON, S w Affordable quality homes to build oaj buy I Great Rates on - Insurance & Tax"e i* Homes Start at $170,000. , MOVE IN NOWI Brand new, warranted homes. We have 6 homes ready for Immediate occupancy. Prices are from $109,900 to $125,900. All under appraised value. Must see before you buy S-3126 Snowbird Speciall 2/2 on 1/2 Acre W/Carport Must Seel Won't Last! Only $74,000. Call (352) 302-8147 TOTALLY RENOVATED 2/1 SW, scrn. prch, roof over, access to chain of lakes, $45,000. For more Info. 352-628-3674 $13,500 Down Town Inver. Prof, remodeled corner lot, lake access, Lrg. SW, H & A, WD. Lg Sc SRm, carport, $225moI lot rent. Inc water & lawn (352) 697-1126 L ..... mm 55+ plus, 2/1 Furnished, clean, small park (352) 746-9329 Carpeted, 1 bedroom, 1 bath mobile home at Inverness 55+ Park. Partially furnished with carport, $5,800 (352) 344-1788 CRYSTAL RIVER 2/2, carport & shed, 55+ gated comm., pool, club house, $50,000. (352) 795-6003 Crystal River Village 55+ gated comm. 2005 "Palm Harbor" Home. 3/2 many upgraded features, scrn.porch, shed, carport, sprk. sys., $129,500. (352)422-6136 EDGEWATER OAKS M.H.P. 55+, lake access, 2/1, Irg. shed, screen room, carport, (Lot 15), Lot rent $180 $18,000 (989) 859-0564 FOR SALE BY OWNER 2/1 On Lake Rouseau, Part- ly turn. CRYSTAL RIVER 2/2 $900/mo, Garbage, Water, cable & lawn maint. Inc. 1st. last. & sec. (352) 527-0260 CRYSTAL RIVER Luxury, 3/3/2, Irg caged pool, big lot, $1800.mo. Incl. pool & yard maint. (352) 586-7728 2/2, Crystal Riv., WF, .$1450. mo. 3/2/2, SMW,$1600.mo River Links Realty 628-1616/800-48-Sc 184 2/2/2 Villa $825. mo Please Call: (352) 341-3330 For more into. or visit the web at: cifrusvillaaes 3/2 Downtown Dunnellon. $900.00 (352) 465-7740 AVAILABLE NEW 4/2/2, Cit. Spr. SMW from $975. Homosassa $775 3/2/2 Crys.Riv W.F. 4/2/2 $975 River Links Realty 352-628-1616/ 800-488-5184 HOMOSASSA 2 bedroom, 2 bath,. furn.,.stilt house on Homosassa River. C/H/A, boat dock. 813-299-8142 HOMOSASSA 2/2,2 sheds, carport, dock, Halls River, qvail. March 10th, $1,000. (352) 228-0232 Hwy. 200 near North County Une, 2/2.5 newer home, $995/mo. (352) 302-5875 INVERNESS 3/2 Pool, on open lake front, Electric Dock off Gospel Island - 352-637-3749 leave message. Dunnellon Hills 3/1/1 $700/mo. RAINBOW LKS EST 2/1/1, CB $725/mo. Both part. turn/ poss. rent to own (352)447-2849 Citrus Springs With house privileges, utl. Incl., $125. wk (352) 489-1651 CRYSTAL RIVER Room with bath 352-422-2927 HOMOSASSA Room for rent, $100/wk. incl all until. 352-628-2483 HOMOSASSA Roommate Wanted to share 3 bedrm,. house, cable, W/D $400. mo. Luls (305) 510-1234 Inverness Roommate, house priv. 3/2, W/D, all until. AC, $95. wk. (352) 637-0117 Leave message 2/2, Crystal Riv., WF, $1450. mo. 3/2/2, SMW,$1600.mo River ULinks Realty 628-1616/800-488-5c184 SUGARMILL WOODS 2/2/2 +Lanal, cul de sac. turn. Lawn Incl. $1500mo. Owner/agent AvaIl 4/1 727- 804-9772 12X20 Secure, Storage In bldg. 352-422-3112 .-ITRUS COUNTY (FL) CHRONICLE -Floral City, Hwy 41 2/2/1, 202 S Harrison St. MEADOWCREST BUILT '05 3/2/2 1200sq.ft., 2 units, $900/ New Thermopane wind, Prime new listings Good neighborhood, mo (352) 344-2500 $125,900. Owner. 865- 2/2 Villa, $162,900. close to everything. awn Business for Sale 933-7582/ 865-335-4545 3/2 Villa. $184,900. $185,000. Accounts & Equipment 2/2/1, fenced, screen MUST SEEIIII (352) 398-6570 ,20K. Serious Inq. Only. rm./vlyn., C/H/A, apple's, Citrus Realty Group BY OWNER, 1133 S(352) 476-5690 carpet, ceil. fans, win. (352) 795-0060 Woodcrest Ave., 3/2/2 trmnt. new inter, paint, w/screened lanal, 1/4 great neigh., $139,000. acre lots, City sewer/ (352) 746-7372 water. Close to Lake SA Must See, 45 S and shopping. Compl. Jackson 2/1 w/carport, renovated. Ready to APTS. FOR SALE 9 UNITS new kit. cab. filed eat In 2003 Custom 3/2/2 move nl $189,000 2/1, Crystal River, kit., sunrm. & bath, new 1 acre landscaped. (352) 637-6893 > $450,000. By Owner carpet liv. rm. & bdrm. Immaculatel By Owner, 3/2/2, 415 352-634-4076 newer AC, 2 sheds, roof Open House Sat.& Sun Daisy Lane. Inverness 8 yrs. old. Much more 3/11 & 12; 11a-4p or by Highlands, new In 2005, $116,000. (774)836-2598 appt./No Realtors split plan w/ gas Beautiful 2/2/2, (352) 344-0428 Fireplace & more, solar heated pool, Brentwood $185,000 (352) 637-0768 5,000. Buyer Rebate, fireplace, 1/2 acre, New villa on premium or (352) 303-7428 5,000. Buyer Rebate, $179,900.. lot overlooking golf By Owner, Highlands, "New 3/2/2, 2175 sqft (352) 527-4643 course. 3/2/2 2/2 w/oversized gar. & Under Rf. Privacy fence (352) 476-5916 Workmanship warr. to workshop shed 352-302-any extras $179,900. BEVERLY HILLS '07. Membership req'd. Beautifully furn./ 352-302-3929, BEVERLY HILLS $Asking 279,000. dec. & equip. Newly 352-795-1314 2/2/1, Av Apr 1, $775. (352) 726-9774 remodeled w/extra Ig. 3/2/2, ncel/4 acre lot, last, sec.nice home & Completely refurbished, corner lot $159,900. 3/2/2, nicel/4 acre lot, yard 3/2/2, new carpet, 1026 Rutgers Terr. upgraded floor tile, appi. 202 S HARRISON STREET flooring, appliances. (352) 344-5721 Ready April $189,900 Possible lease purchase self cleaning pool, CITY LIMITS k,' Call 407-227-2821 865- 933-7582 call col- 1 acre lot, By Owner. Close to everything in ,3/2/2, Pool Home lect, 279,500. Call for appt. town, Immaculate, 2200 sq. ft., tile floors, Cell 865-335-4545. (850) 319-2913 or 2/2 home. $139,900 & counter tops, security CREAM PUFF! (352) 746-0514 (352) 726-2361 system, many extras. Immacualte. 2/2/1. Cen- Ar you Ready to Have ,$,215,000. (352)422-4544 tral A/C. Private Court- TYTour owei Home 1 Asking $170,000. yard. Siding. Landscaped. Is a promem,orthatyoudon't ,48R/3 full ba, 2473 sq. ft. Artistic interior like new. have enough moneyfor a r'. Beautiful Home $133,900. 746-7992. Don'tlets stp you (352) 563-5735 #316 S.Washington. anymore! Call now and )e the Free Information BRAND NEW HOME DO YOU NEED R red NesSe 14/2/2 For Sale or rent i Y D l.8-l 2 split plan. 2200 sq. ft. ADVISE SELLING E.0AAme ?0n '" Owner will finance, OR RENTING ERAn erca ni nveunrents $194,900.(352) 341-1859 YOUR HOME? GOLF COURSE HOME, FOR SALE BY OWNER FREE Home Warranty mint cont, 3/2/2. r FREE WEBSITE WE SUPPLY ALL THE Policy when listing open st am r wwwSellYourOwn FORMS FOR THIS your house with "The fireplace, 1/2 acre Homeste.com PURPOSE. Max R. Max Simms, corner lot, waterview SH eslte.co LLC, GRI, AHWD $241,500 ... Have you been turned OTHER SERVICES ARE Broker Associate. (352) 341-3941 or down for a mortgage? T LABLE (352)527-1655 239-209-1963 'We can help Ask about AVAILABLE. GOSPEL ISLAND 3/2/2 v our rent to own CONTACT:- CAt ibrit Close to lakes, comp. program. Alex C ONTC T remodeled, new roof, (352) 686-8850 JUDY L. ZELTZER 1400 ft living, new appil- Newly Constructed ADVISOR Ete ances, file floors, fire- Home, 3/2/2, $225,000. place, split-plan, 12x14 (352) 564-8423 (352) 697-3456 Golf Course Home workroom. $174,900. ,r (352) 795-4155 $287,000,6th Fairway, 352-634-0052 For Sale by Owner meadows Course Highlands 2/1/1 'SITS ON 1 ACRE! New listing OPen Killlngsworth Agency w/ Fl. room, cm. lot, SBeautiful NEW, 3/2/2 House, each Sunday Inc., Real tor move-in cond. Owner just 2% down, beginning Mar 5, 1-4pm (352) 302-8376 must sell $114,900. upgraded floor tile, apple, in Oakwood Village 302 Blanche St. $209,900 Ready April 735W. Colbert Ct. GOLF COURSE HOME (352) 726-5584 Call 407-227-2821 off Forest Ridge Blvd. 3/2/2, large lanal, huge Highlands 3/2/2 or den 'Your Neighborhood (352) 527-1429 deck, 1/2 ac, w/Ig. oaks. & laundry rm., caged REALTOR' Have you been turned New England Charm. inground pool. Lg. tiled down for a mortgage? 121 E Glassboro Ct Ilanai. By Owner 6150 E. We can help Ask about $299,900. 352-302-9834 Sage St. $169,000. our rent to own (352)726-4178/464-0062 program. Alex HOW TO SPEED HIGHLANDS, BRAND (352) 686-8850 UP YOUR HOME NEW 3/2/2, Fla. Rm, Move In for "0" $$$$ SALE! great neighborhood, 3 /2, & garage, corner close to everything, lot, hard wood & tile Online Email $169,900. 352-726-6075 r floors, like new 1600 sq. debble@debbie HOME FOR SALE ft., Only $845. mo. Irctor.QQm On 2V2 acres/zoned for call Cindy Bixler (352) 637-1641 Or Over The Phone horses $249,900. S352REALTOR (814) 573-2232 352-795-2441 3/3 w/ fenced pool cbixler15@tampa 0 Down Move in Only DEBBIE RECTOR (352) 344-3981 bixier.tma $510/mo at 43/4%. av qyrr.com Cute 2/1, CHA, clean, 1 __ il HOME FOR SALE Craven Realty, Inc. good neighborhood. L W On Your Lot, $106,900. 352-726-1515 814-573-2232 Realty One 3/2/1 w/ Laundry f (352) 270-2015 Atkinson Construction S 352-637-4138 * * homesnow.com Uc.# CBC059685 Terra Visfa Golf Crs Mint Condition 3.9%/2.9% Pool Home, GIbson Pt. 1818sq ft 2/2/2, 919 2678 W. Goldenrod Dr. Full Service Listing 3/3/2 Single Family Villa Orchid St. Apt. only, r.C.rrer -.:.r k.-rT, New in 2003 $169,900 Crossland ?-.l.',',r..- 3, .:.r. 1 Why Pay More??? $349,900, 352-527-9973 Realty Inc. acre. 2,100 sq. ft. No Hidden Fees TERRA VISTA VILLA landrealtycom Laminate firs.,'fully land- 25+Yrs. Experience Maint. Free, spect. sun- (352) 726-6644 escaped (352) 527-1717 Call & compare sets, file roof, beaut. MOTIVATED SELLER $Pool Hom50+Million SOLD!II landsc. Open plan, 2/2/1 Highlands home P3/2/2 Pool Home Please Call 3/2/2, top loc. 2600sf. Borders Holden Park. er.On I Acre. st hole of for Details, und. rf. Low tx. $346,900 Oversized lot, wood, golf course For sale by Listings & Home Owner, (352) 527-3419 floors, large shed Qwner/ $389,000 Market Analysis $129,900 (352) 726-0643 d8-7) r8215 a *. .--," MOVE"RIGHT7Nl- By Owner 3.r -2,' 2 RON & KARNA NEITZ CoMplEtRemodeled '- 3.9/2.9% 3/2/1, Very Clean, Over- cargr,. CITRUS REALTY GROUP Full Service Listing sized Lot. Great Home At owner financing avail. (352)795-0060. An Even Greater Pnce 4749 N. Pink Poppy Dr. Why Pay More??? $132,900. Don't Miss Out z.-:. (352) 746-9795 jNo Hidden Fees On This Onell 270-3318 Don't Horse Aroundl 25+Yrs. Experience or 302-5351 Don't Horse AroundCall & Compare MUST SELL, Highlands, 2/2/2 FOR SALE BY $150+Million SOLDIII mint 3/2/2, split OWNER Nice, private bedrooms, too many CBS home 1.2-acre lot Please Call for Details, (352) 726-0879, 900v.msg. near 44/491. New roof Listings & Home well system and boat Market Analysis Need a mortgage storage shed. $165K. & banks won't help? Call Diana Willms (954) 235-0892 RON & KARNA NEITZ Sef-empwonelp? 'A Pine Ridge Resident (954)235-0892 RON& RNANEIT Self-employed, REALTOR 2/2/2 GREAT BUY BROKERS/REALTORS all credit issues REALTORV 352-422540 /2/2 GREAT BUY CITRUS REALTY GROUP bankruptcy Ok. dwilimsl@tampa ON BEAUTIFUL (352)795-0060. Associate Mortgage bay.rr.com LECANTO HOME Call M-F 352-344-0571 Located on a corner, Priced Below Appraisal, Craven Realty, Inc. lot fenced in 2005 Home, 3/2/2 on 352-726-1515 backyard w/21' over 1/2 acre corner canopy for your boat, new roof & AC, along Lakefront w/ dock, lot, split plan, w/ great with appliances and 3/3/2, over 5,000 sq. ft. room, all Appl, hot tub other negotiable under roof, open floor off master, $185,000. items. Buy it all for plan, split bedrooms. (352) 220-3897 $139,900. Call to see it (352) 637-3149 Relocating 3/2/2 Pool L or stopbye on Home in Highlands 1_SUNDAY Extra lot avail. OPEN HOUSE 1-4 A MUST SEE at $175,000 low ,2035 W Shining Dawn (352) 279-2 772 or (352) 746-9994 $$ BELOW MKT VALUE (352)726-2069 Extra large 2/2/2+, SELL YOUR.HOMEI FREE Home Warranty Eat In kitchen, oak Place a Chronicle SO.F., ..rE r,E Iirr cabinets, family rm w/ Classified ad cu; r,.-..: with "The fireplace, too much to 6 lines, 30 days 'r.l. .1ax Simms, list, must see, call $49.95 LLC, GRI. AHWD for appt. (352) 637-6617 : Broker Associate. 2 LAKEFRONT HOMES Call b" (352) 527-1655 on 9.5 acres, Beautiful 726-1441 2 5 scenery, Ideal for 563-5966 _ residential or to divide Non-Refundable S Bonnie Peterson (352) 726-3622 ome Pestticl Realtor 18 Yrs. in Citrus M app Need a mortgage "rsao s & banks won't help? Your Satisfaction is a' Self-employed, my Future! .. all credit Issues a- - bankruptcy Ok. (352) 794-0888 .Associate Mortgage (352) 586-6921 , Call M-F 352 g-344-0571 Exit Realty Leaders of ". \ " Crystal River" * * Cinnamon Ridge 3/2/1- carport not 3.9%/2.91310,sf., 91' skyline,. 3.9%/2.9 Io deck, FIrm, new roof,, a- Full Service Listing $79,900.352-637-2973 Call Me t: Why Pay More??? ERIC HURWITZ B e e No Hidden Fees 3522 1Bonnie P8terson 25+Yrs. Experience 352-212-5718 eo Call & Compare ehurwltz@ r S"$150+Million SOLDIll Fairmont Villa tampabay.rr.com Your Satisfaction is 2/2/2, Furn. Main. Exit Realty Leaders u ti P Please Call for Details, Free, bright open living Priced to Sell, 3/2/2, w/ Listings & Home area, $178, 000. fenced In back yard, a (352) 794-0888 a Market Analysis (352) 563-1139 must see at $155,500. (352) 586-6921 -N KA ,,, FAIRMONT VILLA (352) 726-3258 Exit Realty Leaders of BROKERS/REALTORS Exceptional location, 2/2/1 BLOCK, FENCED Crystal River CITRUS REALTY GROUP 2/2/2, by owner 2004 Double pane Complete Renovation 0( (352)795-0060. 352) 89L /M 2005 2-ton heatpump Inside & Out, 3/2 split, (352) 563-0893 L/M Screen room/vinyl MB has Fr. Drs. to Ig. Fox Hallow FSBO 3/2/2 Slab for shed $130,000. covered patio, all Fl. Rm., Scrn. Porch, Rackley, (352) 637-2123 apple utility rm., Ig. W/D, all appl.'s, all tile, 2/2/1 ON FENCED carport & lot, close to alarm, water softener, Gated, Treed Private 2 schools, 465 NE 10th St. 2/1 arrt, maint. free, built 2004 ac's. Fireplace, new Possession at closing v2/eIn report Ready to move in floors, incl. Ig. Fla. Rm. $128,000. S egorhdyreat $219,000. (352)384-0711 $169,000. For appt. call (352) 220-4298 r -pjetely new kit., appl.'s, * owner at 352-560-7327 CRYSTAL MANOR I ;ath, carpet & CHA. 3/1, Great in town REDUCED NEW HOME Won't Last location, remodeled, $289,900 3/2/2 ( 30 N. Columbus 3.9%/2.9% CB, 1400 SF, $125,000. with screen lanal $119,500.(352) 400-0525 Full Service Listing (352) 860-1189 9262 Beechtree Way S2/1/1, Fenced yard, 3/3, Den & Bonus Rm., (352) 795-5308 , j "as Is" 16N Lee, Why Pay More??? FP, close to hospital & Crystal Manor, 3/2/2, $90,000. No Hidden Fees schools, double lot, 2250 sq. ft., 1+ ac. open KB (352) 795-7374 25+Yrs. Experience very private, $189,900. fl. plan, cathedral cell., Call & compare (352) 637-5968 FP, 15x30 caged pool, S2/2/Carport, $150+Mlllion SOLDIII BLOCK HOME ON 1.13 w/privacy garden, re- S Completely furnished, Please Call ac. 3/21/2 on Cul de modeled throughout e i.5" including, utensils, for Details, sac. Under appraisal, w/woodwork & tile, Pic- $113,000 Listings & Home $223,000 obo 637-9220 ture via e-mail, owner (717) 870-0382 Market Analysis BY OWNER 3/2/2 $279,500. (352)794-4197 o2/1/1, new Fl Rm, new 6360E Gurley, Highlands LAST ONEI NEW TWO A/C & heating, very RON & KARNA NEITZ Split plan, Wood Floors STORY CAPE 2,900 sq. good cond, $130,000. BROKERS/REALTORS thru-out, New Kit. Fam. ft. of Living, 1/2 Ac. Was 211 W. Seymeria CITRUS REALTY GROUP Rm. w/Gas FP $169,900. $230,00. REDUCED to (352) 527-3566 (352)795-0060. 352-302-3901/726-9928 osass Lie sedR. roe W ate-rot, ol 1/2 Acre, office w/ view of golf course. Extra long 3rd gar., pool & spa, over 5,100 total sq. ft., make offer. (352) 228-7756 BY OWNER 3/2/2 MAINTENANCE FREE Villa Home In THE HAMMOCKS located on the OAK GOLF COURSE $289,000 (352)382-4370 By Owner 3/2/2'/2, 2434 sq. ft. split plan, pool, 408 sq. ft., lanal, Ig. fam. rm., wet bar, well, 3 walk In closets, fans, fence, Jacuzzi, newer roof, extras $289,000. (352)382-7383. WAYNE CORMIER Licensed R.E. Broker A Waterfront, Golf Investment, Vacant Land and Relocation * Citrus, Marion and . Hernando 352-628-5500 propertles.com "Here to Help you Through the Process" LOVELY 3/2/2 HOME ON 1/2 ac. in prestigious, quiet area. Many extras Near shopping, By Owner, $234,900 (352) 621-5157 New Construction ready for occupancy. 3/2/2 on 1.25 acres in homes only area. $259,900. Waybright Real Estate (352) 795-1600 Peggy Mixon --- ~ Bonnie Peterson Realtor Your Satisfaction is my Futurel (352) 794-0888 (352) 586-6921 Exit Realty Leaders of Crystal River 3/2/3, exec. home w/den & solar htd. pool Immaculately Motivated Seller PRICED REDUCED :352)476-1569/382-3312 $274,900. 183 Pine St. BY OWNER 3/2/2 Weil now LEILA IK. WUUU, WKI Broker/ Realtor Your Real Estate Consultant with vision PARADISE REALTY & Investments Inc. 7655 W. Gulf to Lake Hwy., Crystal River (352) 795-9335 MEADOWCREST Prime new listings 2/2 Villa, $162,900. 3/2 Villa. $184,900. MUST SEEIIII Citrus Realty Group (352) 795-0060 Michele Rose REALTOR "Simply Put- I'll Work Harder"' 352-212-5097 thorn@atiantic.net Craven Realty, Inc. 352-726-1515 Need a mortgage & banks won't help? Self-employed, all credit Issues bankruptcy Ok. Associate Mortgage Call M-F 352-344-0571 -rusCunty Receive New Listings By Email LAURA GRADY (352) 302-2340 laura@silverking propertles.com Reducedll Bring the Horses, 10 acres, w/ nice '99,3/2, DW, 18,50 sf, fenced w/ stalls, room to build, impact fee pd. live on property while building your dream home $225,000. 352-613-0232. Vic McDonald (352) 637-6200 Selling Citrus!! NO Transaction fees to the Buyer or Seller. Call Today Craven Realty, Inc. (352) 726-1515 ADVISE SELLING OR RENTING YOUR HOME? WE SUPPLY ALL THE FORMS FOR THIS PURPOSE. OTHER SERVICES ARE AVAILABLE. CONTACT: JUDY L. ZELTZER ADVISOR (352) 697-3456 Fixer Upper Bargains, These homes need work, lowest prices. Call for a free list. Free recorded message 1-800-208-9258 ID#1048 E R.A.American Realty & Investments 663527 FOR SALE BY OWNER Super clean 4/2/2, on .68 acres. Over 2300 sf. many extras.Great location.com Graceland Shores Lots 4/2 MH Gorgeous view of Lake Rousseau Work- shop, shed, Fireplace $90,000. Lake access- lots $20,000. Waterfront starting at $85,000. (352) 316-2168 Over 3,000 Homes and Properties listed at homefront.com Over 3,000 Homes and Properties listed at homefront.com -4Codo BY OWNER 2'2 .:ff '-, .D l e151 a Ir,..erres:' L.gur. aii,.lm; $105,000 Possible owner finance f352) 461-6973 CRYSTAL RIVER S CONDO Move In condition, Ground Floor. 1 bed- room 1 bath condo in Crystal River, unfur- nished. Newer carpet,. stove, refrigerator, de- luxe dishwasher and stack washer/dryer. New countertops, sinks and more. Tiled porch wrr, new sci'eer,. an d *.l.l3ir, r rI ,;r. .,; iJ':t 1le p-; .,p tr.' f eai- ed pool. Condo fee $100/mo. This is a must see. $95,900. Call Jason at 422-8095 Good Location, first floor 2/2 furnished Screened Lanai, great view, club house, pool, facUlties,/2/2/1 Townhouse, very nice with many upgrades, Call for appointment. $127,500. (352) 860-2786 Royal Oaks Condo, Totally remodeled al- most everything newl 1/1, lots of amenities, & activities, low maint., a must see, could be model $95,900. No Realtors (352) 344-5966 TOWNHOUSE 2/2, 1 car garage, community pool & boat dock. Low maintenance, close to downtown Inverness. $134,000 (352) 400-0731 Here To Help! Visit: waynecormier.com (352) 382-4500 (352) 422-0751 Gate House Realty vs. .'r List with me and get a Free Home Warranty & no transaction fees 352-302-2675 Nature Coast CEDAR KEY GULF FRONT Gorgeous 2/2 stilt home. 3 acres MOL-airport access Waybright Real Estate Inc., 795-1600 CRYSTAL RIVER 3/2/2, Boat Lift, Dock, Deck. $469,900 (352)465-1261 (352)563-0970 Floral City 2 story, 3/2 ,F/P, built In bar, upgrades galore.. $280,000. Will consider rent/lease option, $850 6511 S. Dolphin Dr. (727) 237-9062 FSBO Waterfront Dixie Shores. 5/4 W/in law appt. /Jdtimm (352) 564-7076 Gospel Island 3/2/2 500ft of Waterfront. property on its own point. Relax, entertain Sand enjoy peace, serenity & privacy from your own dock. 8410 E. Muir Place, Incl. Adjoining build able waterfront lot at $389,000 Dan 352-601-3863 Kings Bay Area 804 SE 1st Ct. on Palm Island, Comfortable Home, located on deep water canal. $975,000. (352)795-3264 Lakefront 1214 Lakeshore drive. Inverness. 2/2 Fl. Rm. Scm. porch boat dock, beautiful trees & lot, city water & sewer, great lake view. 2 blks. fromWith. trail & public "-boat-dock.'$279,000. (352) 341-0509 or (434) 489-1384. LET OUR OFFICE GUIDE YOU! r Plantation Realty Inc. (352) 795-0784 Cell 422-7925 Lisa VanDeboe Broker (R)/Owner See all of the listings In Citrus County at www plantation realtvinc.com RON EGNOT 352-287-9219 Professional Service Guar. Performance u-u 1st Choice Realty SAWGRASS LANDING Furn. 1 loft bdrm, 1 lhbths Stilt Condo on channel leading to Crys. Rvr. Dock, pool, /614/2695northsea breezept/ $195K. (352) 527-9616 Tracy. Destin *-: ~ ' Domson Realty Services Specializing in all your Real Estate Needs Please call for a free Market Analysis 352-795-0455 ccHU.trrn 11. I Helping FAMILIES I Acquire A Quality-Low-Priced Building Lot. 1-800-476-5373 ask for C.R. Bankson at ERA American Realty & Investments cr bankson@era corn FOR FREE PACKAGE of Lots & Maps SCall 800 # Above Lv. Name & Address PINE RIDGE 1 ACRE Wooded, asking $89,000, No Realtors. please. 410-848-8092 or 443-536-6464 PINERIDGE 1.5 Acre, W. Pansy Lane, $145,900. (352) 746-9957 PRIVATE OWNER MOVING. Grab these beautiful Citrus County 1/2 acre lots on Lk Roussea(s and Old Homosassa Canal. Ready to build. Rare find. $200,000 each S727-644-8228 Reducedli Bring the Horses, 10 acres, w/ nice'99,3/2, DW, 1850 sf, fenced w/ stalls, room to build, Impact fee pd. live on property while building your dream home $225,000. 352-613-0232 i/z vin gorgeous view of Lake' Rousseau Work- shop, shed, Fireplace $90,000. Lake access lots $20,000. Waterfront starting at $85,000. (352) 316-2168 INVERNESS .87 ACRES Beautiful Oak Treesl quiet dead end St.in city limits. Zoned LMD/R3. Build a home, day care, church or school. $94,000. (352) 688-9274 RARE FIND, Industrial Property, 1.2 acres MOL on Hwy. 41, 40 x 100 steel building, (rented) new well, possible own- er finance, $300,000. (352) 344-2333 -aS3 ccn~~l^ 1 ACRE CITRUS HILLS Beautiful treed. High & Dry In neighborhood of expensive homes. Central Water. Priced right to sell at $69K/obo (352) 637-1614 I ACRE NEAR HOMOSASSA $28,000. Others available 352-628-7024 3.4 ACRES In Pine Ridge price reduced, $180.000., Firm (352) 746-0348 I 1. 0 I 'JCrystal River "Homes "j Sugarmill ca Woods HOME FOR SALE On Your Lot, $106,900. 3/2/1, w/ Laundry Atkinson Construction 352-637-4138 Lic.# CBC059685 HOME FROM $7 0001 Foreclosures, 1-3 bdrm. For Listings 800-749-8124 Ext F9845 How To Speed Up Your Home Sale! Online Email debbie@debble rector.cor Or Over The Phone 352-795-2441 DEBBIE RECTOR Realty One homesnow.com New Homes on your tand In as little as 4 mos. Call Suncoast Homes (352) 697-1655 SITS ON 1 ACRE! Beautiful NEW, 3/2/2 just 2% down, upgraded floor tile, apple, $209,900 Ready April Call 407-227-2821 MR CITRUS COUNTY REALTY ALAN NUSSO 3.9% Listings INVESTORS BUYERS AGENT BUSINESS BROKER (352) 422-6956 2.20 ACRES, 2/1 1712 house under roof, 7157 W Dunklin St, $130,000, 352-422-4824 Beautiful, poss. 4 bed, 2 bath, 2 offices, spa- cious kit., living, dining off US 19, huge deck & docking, placed at dead rd. $275,000. flexi- ble (352) 257-1994 C. Lynn Wallace Cl-ASS)IIII]EIDS SPACIOUS, SUNNY 6 room 21/2 bath Condo End unit, with deck, screened lanal, vaulted ceilings. Located in Pelican Cove with exclusive amenities Including clubhouse, heated pool, and tennis court. Attached garage, deeded boat slip with Gulf access. A live-in Investment at $430,000... by owner. Crystal River (352) 564-8692 L-IMM1,a lhomesold.com 1 Acre, high/dry, fenced, Dbl M ranchette, CR 488 $35,000.(352) 249-1149 5 ACRES, in Lecanto border Stat. Forest fenced, private road $150,000. 352-302-8044 Beautiful 1/2 acre lot in Citrus Springs, Fireside Dr. Near Elementary School. Have recent survey. $55,000 OBO. S352-212-3069 day or 352-489-1462 eve Beautiful wooded building site, 1 acre, 3386 W. Birds Nest Dr. PineRidge, $98,500. (989) 868-3409 CITRUS SPRINGS GOLF COURSE LOT, $64,900 ALSO 1.42 AC. LOT, $57,900. (352) 212-9918 Crystal River 2.39 Acres, Impact Fees paid, elec. well & septic. $75,000. 5530 North Tallahassee Rd. Call (352) 422-4824 or (352) 522-0058 DUNNELLON 1/2 acre, 488 & 41 $55,000. (352) 628-3551 302-7816 E. STAGECOACH TRAIL, Floral City. Beautiful open pasture 14.7 acres, bring the horses $30,000 per acre Coritact David (352) 637-6443 GREEN ACRES 1AC mol Power, septic, well, old mobile home, until bldg. w/pwr/wtr. $42,500. - (352) 382-4738, Iv. msg. LECANTO 2n.-.rdti, C.l ac Hih Dr, rriull' zc.r. ing. Off So Scarboro on Axis PFt Newly surveyed. $145K (561) 588-7868 LOOKING TO BUILD YOUR HOME IN CITRUS COUNTY? CONTACT US. FRxDAY, MARCH 3, 2006 7D ........ 7 ...... K=1 cc Lt c= for Sale BEAUTIFUL 1 ACRE LOTS Linda St NICE $29.9K; Crystal Manor $45.9K; Citrus Spgs from $29.9; LibertyRE 561-792-1992 CITRUS HILLS, Fairview Estates, I acre on quiet E. Westgate, Hi & Dry, underground ufil. $97K, (352)726-6665 CITRUS SPRINGS 2AC. MOL, Riley Drive, $44,500. (352) 628-4042 CITRUS SPRINGS 20 Lots avail. by owner. Some comer & some oversized. Most have util. 30K- 36K 407-617-1005 CITRUS SPRINGS 3 lots, $29,000. each. 3020 & 3004 W. Unda Place, 176W. Brfmson Call (352) 522-0058 or (352) 422-4824 .CITRUS SPRINGS Multi Family Lot, $35,000 1-800-314-8221 High & Dry nice trees, In Highlands, 80' x 120' $26,900. (352) 637-5968 golf course lot on desirable Mallows Circle. (352) 795-0702 PINE RIDGE 1+ ACRE. Beautiful wooded Cor- ner lot in very desirable subd. , TCHT RE SUGARMILL - SOUTHERN WOODS Oversize deep lot south of US 98 on main blvd $78,000.00 352-464-2463 or 352-503-3123 SUGARMILL WOODS desirable location, $59,900. (352) 634-2288 WAYNE CORMIER Here To Help! Visit: wynecormler.com (352) 382-4500 (352) 422-075.1 Gate House Realty ABANDONED WINE COUNTRY FARM.. 30 acres $59,900 Gorgeous Finger Lake acreage! Views, pond, woods & fields! Town road w/elec! Terms available! (866) 903-5263 HORSE FARM OPEN HOUSE Saturday, March 11, 67 acres $689,000 Historic stone home, barns, indoor arena. Call (877) 908-5263 or go to.. upstateNYiand.com NC Mountain Property Ridges Resort Communities. Gated Country Club Golf Course & Lake Phase 1 closeout, New phase home sites opening. Call (866) 997-0700 ext. 200 for Info TN & KY LAKE PROPERTY LAND INVESTORS... Lots selling fast Gorgeous lake and mountain views... 1-3 acre lots Call Usa todayi1 (800)301-5263 McKeough Land Co Waterfront Over One Beautiful Acre in Floral : City right off Hwy. 41. Only $79,900. Call (352) 302-3126 -I 1987 Mercury Outboard 150HP, original owner, 2 props, $1,400. (352) 795-6405 2005 ALUM. BOAT TRAILER, good for wide alrboat, skiff or Jon boat, 1/2 price at $1,275 (352) 527-3555 15HP HONDA, 4 stroke, like new, 2 gas tanks, 2 props, with shop manu- al, runs perfect, $1,400 obo (352) 341-4755 ^HE. ACE DAVITS Combined lift of 4,000lbs. New motors, Installation hardware. $1200/obo (352) 400-0525 0000 THREE RIVERS MARINE -- - CLEAN USED BOATS We Need Them! We Sell Them! U. S. Highway 19 Crystal River 5 -5510 2, 14' Fiberglass Boats w/ 10hpJohnsons 4 stroke, $800 each. (352) 726-2553 18 ft. CSquirt New bottom pnt, 90 HP Yahama, rec. serv. Bimini top, tilr, gd shape. $2,900 (352) 795-5228 Before 9:30 2000 SKEETER ZX 2200 C.C. Yamaha 250 Saltwater Series, to much to list. Great shape! $21,500. Call Chris 352-235-2308 14-24FT NEW BOAT TRAILERS for Flat bottom boats- like Carolina Skiff's, Polar's, Jon boats, Alrboats & clam-type boats + morel Most New Performance finished, some not. Galvanized & Alum. (352) 527-3555 Mon-Fri. 9am-5pm MONROE SALES AIRBOAT Volkswagen motor, rebuilt hull, new prop, 2 extra motors, trailer, lots of extras, $1A400 (352) 637-0637 Alumacraft Super Hawk, 2005, 15', 25hp Mercury stroke motor, troll motor + extras. $6500. (352) 527-3019 Avon Inflatable 11' w/ wood floors. Incl. 15hp Johnson. Like new $1500. (352) 527-0837 BASSTRACKER '90, 17 ft. w/ trailer, 90H merc., oall in., Fb.-r.l.3:.; r:,t.,:,-ol .n iF berg..l 2-m ar. bass boat. 8FT Fiberglass kayak, $200 ea (352) 464-0316 Carolina Skiff '05, J16, 30HP, EFI, merc. 4 stroke, filler contr.,. front deck, 2 fishing chairs, bimini top, bilge i: "',mp, lights, extra prop, anhkor, gal. trail. ,$6,995. (352) 628-5999 Gheenoe 15'9" like new 15hp Johnson elec start, Just serviced. Front trolling motor, depth finder, tilt trir. Will sell separate. $1595.00 (352) 726-1172 GLASSTREAM '85, 16FT, 60HP Johnson, T&T, new battery, runs, great, $1,800 obo (352) 613-2393 or 637-4638 HOUSEBOAT 1970, Naugalne Bay and Off Shore Citrus County's Best Service & Crystal River Marine 352-795-2597 Key PONTOON 21' '03 Odyssey, 50HP Merc. Under 50hrs.10-13 pass. CD, Dp Finder. Tndm trlr $11,900. (352) 382-1075 PORTA- BOTE Unique folding 10' boat, complete package, brand new. $700. com (352) 382-0477 Porta-Bote Folding boats, folds to 4" thick, new boat, back from recent show for sale at discount, plus 3.5HP Johnson motor (352) 564-1390 PROLINE 28 ft. w/ 012' beam (compares to today's 32') '86/2000, Twin -Johnson 150's w/ SST -130 hrs., all elect. one owner, excel, cond $18,500. (352) 795-3002, (352) 795-3317 SEA NYMPH 14FT alum., Yacht trailer, 15HP Evinrude elec. start motor, $2,500. (352) 860-2165 P Spacecraft 25' w/ trailer, rebuilt eng,, new bimini, ready to go. $7,500.00 OBO (352) 465-8078 BOAT SHOW DEALS SILL AVAILABLE Pro-Line 17 Sport 90HP Mercury $15,295 1976S. Suncoast Blvd. Homosassa, FL 34448 Coachman 111/2ft. Fjeetwood 32.5' 1990,47k, loaded, good shape, only 14,900. Must sell! (352) 341-3372,000. m. queensize bed, Clean, $14,000 obo (352) 341-2019 Search 100's of Local Autos Online at wheels.com 1,01" 11. Ito 261/2' 5TH Wheel, Slider, As new ext. warranty $15,500. (859) 760-4522limited hwy use. 352-302-9507. Hitchhiker II '01, 5th wheel, 29.5, 31ft., rear Iv,; rm., all extras $20,000. (352) 228-3073 Hitchhiker II LAYTON '98, 25ft., excel cond., ducted heat & air, fully turn., qn. sz. bed, $8,000. (317) 281-0883 NOMAD 23 ft., newer dual refrlg. awning, tires, & window coverings, rear full bed $3,995. (352) 563-5074 Timberlodge 28' 2003, Super slide, good cond. $13,000.00 (352) 445-9043 WANTED TRAVEL TRLRS. 5TH WHEELS or PARK MODELS to be used for Hurricane Relief. (352) 302-0778 Wolverine 8ft. Pickup Truck Camp- er, very good cond., sleeps 4, LP furnace, range w/ hood, & 2 way refrig. 12 & 110V lights, fresh water tank, $1,495. (352) 563-2583 Tow Bar Class 3 (5,000 Ibs) mounting brackets & safety chains to fit Jeep, $75; Port. Satellite Winegard 2000, Inc. tri- pod, basemount, 100' cbl. for use In RV/home $100. (352) 637-4335 Li 3, -vi lYu lUKR. L.cW,'LIIJ $700! Police impounds! For listings call 1-800-749-8116 ext 7374 2000 LINCOLN TOWN CAR Signature series, loaded, showroom condition in/out. 147K mi. $7,600 352.860.0865 2002 MITSUBISHI LANCER ES 63983 miles, $7500, AC PS PW PDL Tilt AM/FM CD $1600 Below Blue Book. Drives/looks new 566 2534 i1 F-ul l 97 Lincoln Towncar 61k, 2 sctoset '...........$7,995 '00 Mercury Grand Marquis LS Red, mile top, Lealher.......$9,995 '02 Lincoln Towncar Exec, Low miles, Siler,Nice!:......$14,500 *ISG SALE* CARS TRUCKS SUVS CREDIT REBUILDERS $500-$1000 DOWN Clean rafpe AnutOr CONSIGNMENT USA -, "J |-l^ or i *'.'0I' l BUICK '93 Skylark Cust. j-lr 1:.q.3-e '- g. . mi. V-6, Great mpg, $2600 352-382-4541 BUICK '94, LeSabre, 128k mi., 3.8 L, V6, auto, Power everything $2,600.obo 352-425-2904 BUICK '95, LeSabre, 4DR, V6. Hood scoops, sharp, clean, reliable $2,500. H 726-0131, C 476-7031 CADILLAC '99, DeVille, 67k org. ml. garage kept, mother of pearl paint w/ bik conv. top, runs & looks great $9,900. (352) 860-0444 Cadillac DeVille 2004, 11k, white-saddle, showroom, smells new. List $48 First $25,500. B.H. (352) 476-1543 Call Us For More Info. About New Rules for Car Donations Donate your vehicle to THE PATH (Rescue Mission for Men Women & Children) at (352) 527-6500 Chrysler 300C 2005, Hemi, low miles, prem., pkg., GPS, moon roof, sat. radio $29,500. (352) 628-1951 Corvette '94, red, automatic, super sharp, if you drive it, you'll buy it. $13,500. obe (352) 212-0121 DODGE DYNASTY 1993, 4dr sedan. 152Kml. Runs great, cold AC, $1700. (352) 422-0530 FORD 2004, Taurus SE, all pwr, under 30K, very good cond, $9,00. (352) 489-3342 FORD '93, T-Bird, LX, V6. needs work $800. (352) 634-1057 FORD '97, Escort LX, Wagon, excel, cond. $2,250. (352) 344-2606 HONDA 1990, Accord.LX, blue, 5 spd, CD. FM, AC, Garg. kept, looks & runs exc. $3400 (352) 527-3580 KIA RIO 2003, Stick shift, 22K ml. Dark grey. $6900. (352) 344-0840 Lincoln '92, Towncar, 67k mi., like new, $4,500. ab '65 GMC/ '64Chevy BOTH $3000 (352) 341-1539 CHEVROLET '85, Suburban, 350, auto, 120k mi., tow pack. $2,500. (352) 795-2258 DODGE 2004 2500, Cummins diesel, auto., 4x4, long box, Michelins, poss. owner finance $28,000 aobo (352) 726-9369 DODGE DAKOTA SPORT, '00, tilt, cruise, Tonneau cover, Mural on hood, Good. cond. $6400 (352) 228-1606 DODGE RAM 1500 '97 lowered; 20" whs, dual exhausts, AC, All power, keyless entry. $6,500 (352) 476-3082 DORSEY 1978, Aluminum, Fl . Spec Rock Dump Trail- er, w/ roll up tarp, nice trailer, ready to work $10,000. (352) 212-0451 FORD '05, F450, XLT,4 x 4, dump truck, diesel, 3,800k ml. $45,000. (352) 527-9992 Ford Box Truck 1982 18' body & lift gate, A/C, 370 gas eng.,5speedtrans., low miles 8.25/20 rubber runs great. $4250.00 . (352) 793-4588 Ford F150 1997,82,500 miles, V-6, 5 speed, A/C, pwr. str. & brakes, Citrus Hills $4500. (727) 809-2313 FORD F-150 1998, work truck runs great, $2500/obo (352) 257-7726 FORD RANGER 1996, red, cold air, 5spd, 4 cyl. runs great. $2950. (352) 212-3997 GMC, Wife's Truck Vortec auto, red, nice 116k ml. $6,800. (352) 795-2706 Plymouth '79, Arrow Pick up runs good $500. (352) 746-4625 Search 100's of Local Autos Online at wheels.com (ii"a, IC Itr, u H TOYOTA '01,4dr., 4 cyL, auto., white, nice cond,w exc, mileage. $7,800 obo. Possible owner finance (352) 726-9369 Truck Bed Lid, fiberglass, red, fits small truck, 6ft bed, $350. (352) 465-6818 ATV + ATC USED PARTS Buy-Sell-Trade ATV, ATC Gocarts, 12-5pn, DODGE ASPIN 1978, 6 cyl, 4dr, $700 (352) 489-0403 MERCEDES 2001, S430, Desert Silver, exc. cond, fully loaded, low mileage, $32,500. (352) 489-1798 NISSAN 1996, Sentra GXE, 92K, AC, Pwr locks/wind, white, beige ent. good cond, $3500 (352) 746-0815 Pontiac Grand Am GT, 1999, 4dr..83K all options, Sr. Owner. $6,300/obo, (352) 382-4029 Search 100's of Local Autos Online at wheels.com TOYOTA 1999 Corolla, VE,4-dr., 73K ml., $5,500 (352) 464-0580 69 Chevy Truck runs, needs some work. $1500.OBO (352) 860-2556 71 VW Camper runs good, lots of new parts, $1500. OBO (352) 860-2556 A CLASSIC CAR WANTED American or Foreign Will travel, Cash waiting (407) 957-6957 AUTO/SWAP/CAR CORRAL SHOW Sumter Co. Fairgrounds Florida Swap Meets March 5th 1-800-438-8559 BMW R45 1979 Motorcycle w/ sidecar $2000. (352) 628-4576 Chevelle '66, 427 clone, 4 spd $24k obo (352) 621-6621 CUSHMAN 1957 Eagle scooter, $4,250 obo a (352) 201-1114, cell DODGE 1990 Dakota Convertible pick up, factory conv, 1 of only 1039 made, V6, auto, runs good, $4200. (352) 726-0931 El Camino 1987 SS Choo Choo grey & grey, 305 w/ a/c $7,500.00 OBO (352) 628-4576 MERCEDES 1974, 450SL convertible, exc, cond., lots of work done. Price Reduced, 352) 586-9498 PACKARD 1955, started, restora- tion but can not finish. In running cond. Have spent over $6k so far. Will sell for $3,500. firm CHEVY 1992, Custom, loaded, exc cond, nice, 78,500 actual miles, $3,850 (352) 344-2606 CHEVY CONV. VAN 1995 100,000 miles, Leather Seats, TVNCR Fair Condition $2500 (352)637-3635 DODGE 1997, Grand Caravan, good cond.$3000 OBO. (352) 726-5844 DODGE '77, runs, extra parts to go with. $600. (352) 277-4195 Dodge '93, Custom Van, Mark III, Ram 250, very clean, good tires, 72k ml., $2,500. (352) 628-2076 DODGE B-250 Conversion Van, 1996, 360 eng. All pwr. access. Fact. installed towing pkg, 67K mi. $6,000 (352) 795-1379, Iv msg., 22,000 miles, like new $18,000. 352-400-1448 Search 100's of Local Autos Online at wheels.com CLASSIFI C" Cr z r :.r.: i.' C e-litors Paul J. DeGuardl PUBUC NOTICE IN THE CIRCUIT COURT FOR CITRUS COUNTY, FLORIDA PROBATE DIVISION File No. 2006-CP-71 Division: PROBATE IN RE: ESTATE OF PAUL J. DEGUARDI Deceased, ,NOTICE TO CREDITORS The administration of the estate of PAUL J. DEGUARDI, deceased, whose date of death was January 11, 2006, and whose Social Security Number Is 055-18-5800, Is pending in the Circuit Court for Citrus County, Florida, Probate Division, the address of which Is 110 N. Apopka Avenue, Inverness, Florida 34450. The names and addresses of the personal represent- ative and the personal representative PUBUCATION, 2006. Personal Representative: Janet DeGuardi 112A East Broadway Port Jefferson, New York 11777 Attorney for Personal Representative: Keith R. Taylor Florida Bar No. 0981532 P.O. Box 975 Crystal River, Florida 34423-0975 Telephone: (352) 795-0404 Published two (2) times In the Citrus County Chroni- cle, February 24 and March 3, 2006. 806-0303 FCRN Notice to Creditors Estate of Robert E. Howton PUBUC NOTICE IN THE CIRCUIT COURT'FOR CITRUS COUNTY, FLORIDA PROBATE DIVISION File No. 2006-CP-161 Division: PROBATE IN RE: ESTATE OF TOYOTA 2000 Tacoma SR5 Ext. Cab, 5 spd, wht. cap, trir. hitch, & more $10,000 (352) 563-0434 2005 JEEP WRANGLER X 8,422 ml, $20,999,4wd, pkg 24x, A/C, PS, Tilt, Cruise, AM/FM/CD Ster- eo,7 spkrs, Front Air Bags, Premium Wheels, Silver w/Soft BIk Top, Side Steps, Tow Pkg, fog Its & more. Immaculate condition. (352) 422-2038 Eagle Summit 1992, 34+ Mpg. Runs & looks good. $1,800. (352) 228-9790 FORD 2000 Eddie Bauer, Expedition, good cond., 82K ml,. fully loaded, garage kept. $13,500 (352) 586-8305 FORD 2003, Expedition, Eddie Bauer, 35K TLC mlles, Ext. 70,000/2008 Warr., $20,800. (352) 726-2649 FORD '92 Explorer, 4x4, V-6, 4.0 litre, 5-spd., exc. run- ning. Good shape, $3,500 obo. 344-8556 GMC JIMMY 1997, 90K ml, 4WD, 4 dr, Loaded, towing pkg. Have to seel $5,100, (352) 341-0039 JEEP WRANGLER 1997, Garaged, Beautiful! 51K ml. loaded, $8,300. (352) 746-4859 Search 100's of Local Autos Online at wheels.com SUBURBAN 4x4 1989, Navy/grey, front r far nir +f* \ rhnit-, cordance with Florida Statutes. /s/ D. M. Garrick Owner Published two (2) times In the Citrus County Chroni- cle, March 3 and 10,, All-10. SD cm 3 2006 ATV + ATC USED PARTS Buy-Sell-Trade ATV, ATC, Go-carts 12-5pm Dave's USA (352) 628-2084 REWARD for Info. Honda 300 EX 4-wheelers, stolen Jan 15/16 from Lecanto (352) 382-7039 SUZUKI 05, Z400, white w/ blue, only 50 hrs, 3 yr warr., $4,200 0B8. (352) 746-4859 2, 2004 Honda Shadows less than 2k miles vest. Numerous Goldwing insignias. $40. (352) 400-2045 HARLEY DAVIDSON '99, XLH, 1200 Sportster 5k ml., slv./6urg., excel, cond., new battery, $5,900.(352) 344-2331 Harley Davidson, Red, "Road King", less than 10k ml., w/ voyager kit. $12,000. (352) 228-3073 Harley Softtail Deuce. 01, Silver, 425 miles, Harley slash cut mufflers, security sys., $15,800. (352) 220-2324 HARLEY SPORTSTER 1983, 1000cc, S&S carb. 24K ml. New tires, chain & more. $4,000/obo. (352) 212-3562 HONDA 1984 Shadow, 700 cc, runs good, $1,000 (352) 341-0836, after 1pm HONDA 1989, PC800, 11K ml. Exc. cond. $3200/ obo 352-400-0525 HONDA 2003 VIX Retro, ed I... ,Tile.agae (352) 794-0477 HONDA OF CRYSTAL RIVER BIG SALE! 06 VTX1300 SAVE 06 VT750 Aero SAVE! (352) 795-4832 KAWASAKI 2003, KX85, mint cond, very low hrs, many extra $1950 OBO. (352) 527-4453 KAWASAKI '97, ZX1100, polished wheels, frame & more, .11k mi. $5,300. (352) 464-4265 Kawasaki Volcan "Mean Streak" 1600 cc's, windscreen, only 2250 miles! Showroom cond. $8,250. (352) 726-2641 Search 100's of Local Autos Online at wheels.com SUZUKI KM85, good cond, low hrs, $1800 OBO. (352) 527-4453 ROBERT E. HOWTON a/k/a ROBERT EDWARD HOWION Deceased. NOTICE TO CREDITORS_ The administration of the estate of ROBERT E. HOWTON, deceased, whose date of death was October 12, 2005, Is pend- Ing In the Circuit Court for CITRUS County, Florida, Probate Division, the ad- dress of which Is 110 N. Apopka Ave., Inverness, Florida 34450. The names and addresses of the per- sonal representative and the personal representa- tive's attorney are set forth beblow.3702, 2Q06. Personal Representative: /s/ WILLIAM J. HOWTON 3055 N. Quarterhorse Terr. Crystal River, FL 34428. 24 and March 3, 2006. 810-0310 FCRN Notice to Creditors Estate of Harriet E. King PUBLIC NOTICE IN THE CIRCUIT COURT FOR CITRUS COUNTY, FLORIDA PROBATE DIVISION File No.: 2006-CP-196 IN RE: ESTATE OF HARRIET E. KING Deceased. NOTICE TO CREDITORS The administration of the estate of Harriet E. King, deceased, whose date of death was December 10, 2005, I .: p-'r.ir.g i. ir. Ci, cult Ccun i-,'i ,-Irru C,:.,jr, ty Fr,:i''. a. i L e 31 i i s March 3, 2006. Personal Representative: /s/ Roberta F. Stoughton 3968 North Baywood SDrive Hernando, Florida 34442 Attorney for Personal Representative: /s/ Thomas E. Slaymaker Attorney for Roberta F Stoughton Florida Bar No. 398535 Slaymaker and Nelson, P.A. 2218 Highway 44 West Inverness, Florida 34453 Telephone: (352) 726-6129 Published two (2) times In the Citrus County Chroni- cle, March 3 and 10, 2006. 811-0310 FCRN Crystal River Self Storage Disposal of Stored Goods of Sherle Colo SHERIE COLO whose last known mailing address was: 287 HIGHLAND PARK APALACHICOLA, FL 32320 for the purpose of satisfy- ing delinquent rents and related collection costs accruing since 12/1/2005. the first notice In ac- SECTION ON OR BEFORE THE DEADLINE SATED IN PARAr, GRAPH 2 OF THIS'ORDER, YOU HAVE AGREED TO A TER- MINATION OF YOUR PARENTAL RIGHTS. IN THE CIRCUIT COURT FOR FREDERICK COUNTY MARYLAND IN THE MATTER OF A PETITION: 4 . FOR ADOPTION OF A MINOR: BY PAMELA MONTGOMERY-MOONEY: C-,N AND JAMES MOONEY: Case No.: 05-3602,, SHOW CAUSE ORDER TO: Unknown Biological Father You are hereby notified that: 1. Filng of Petition. ',oo- A Petition has been filed for Adoption of female chtld who was born at Crystal River, Florida on November.23, 1999, . 2. Right to object; time for objection. If you wish to object to the Adoption you must file a notice of objection with the clerk of the court on or be- fore May 9, 2006, at 100 W. Patrick Court, Frederidl Maryland 21701. WHETHER THE PETITION REQUESTS ADOPTION OR GUARM- IANSHIP, IF YOU DO NOT MAKE SURE THAT THE COURT RECEIVES YOUR NOTICE OF OBJECTIONS ON OR BEFORE THE DEADUNE STATED ABOVE, YOU HAVE AGREED TCO:A TERMINATION OF YOUR PARENTAL RIGHTS. OIus COUNTY (FL) CnHRoNIq: Published seven (7) times Chronicle, March 3 In the Citrus County through March 10, 2006: . 812-0303 FCRN ) Show Cause Order PUBLIC NOTICE V-" IMPORTANT , THIS IS A COURT ORDER. IF YOU DO NOT UNDERSTAND. WHAT THE ORDER SAYS, HAVE SOMEONE EXPLAIN ITTO YOU. YOUR RIGHT TO AN ATTORNEY IS EXPLAINED,'IN PARAGRAPH 3 OF THIS ORDER. IF YOU DO NOT MAKE SURE THAT THE COURT RECEIVES YOUR NOTICE OF 081 JECTION ON OR BEFORE THE DEADLINE STATED IN PARA- GRAPH 2 OF THIS ORDER, YOU HAVE AGREED TO A TER- MINATION OF YOUR PARENTAL RIGHTS. IN THE CIRCUIT COURT FOR ' FREDERICK COUNTY MARYLAND "It, IN THE MATTER OF A PETITION: FOR ADOPTION OF A MINOR: BY PAMELA MONTGOMERY-MOONEY: AND JAMES MOONEY: Case No.: 05-3602 SHOW CAUSE ORDER TO: Beth Howe BiologIcal Mother of the Minor You are hereby notified that: 1. Filing of Petition. A Petition has been filed for Adoption of female chMti who was born at Crystal River, Florida on November'2, 1999. 'O . 2. Right to object; time for objection. If you wish to object to the Adoption you must flea notice of objection with' the clerk of the court on or be-' fore May 9, 2006, at 100 W. Patrick Court, Frederick, Maryland 21701, ' WHETHER THE PETITION REQUESTS ADOPTION OR GUARD ' IANSHIP, IF YOU DO NOT MAKE SURE THAT THE COURT- RECEIVES YOUR NOTICE OF OBJECTIONS ON OR BEFORE, THE DEADLINE STATED ABOVE, YOU HAVE AGREED TO ;A TERMINATION OF YOUR PARENTAL RIGHTS. - 3. Right to an attorney, (a) You have the right to consult an attorney and 61-' tain Independent legal advice. 4 (b) -An attorney may already have been appointed for you based on statements In the petition. If an attor- ney has been appointed and has already contacted. you, you should consult with that attorney. (c) If an attorney has not already contacted you, ydu, may be, entitled to have the court appoint an attorney foryou : If:I ; L (1) you are the person to be adopted and: (A) you are at least ten years old but are not yet 18; or (B) you are at least ten years old and have a disability that makes you Incapable of consenting to the adop- tion or of participating effectively in the proceeding. (2) you are the person to be adopted or the person for whom a guardian Is sought and the proceeding In- volves the involuntarytermlhation of the parental rights of your parents. (3) you are a parent of the person to be ao.:-oTe or' for whom a guardian is sought and: ,.:.u are- 'r.. 3 8 ,e r31: :.f age; or -6., c-s.-: a : a iioaiiITr, /ou are Incapable of cbn- senting to the adoption or guardianship or of partici- pating effectively in the proceeding; or (C) you object to the adoption and cannot afford to -",h O '.:31 i.,',- : -.- u. .:.u r.: ir-.a r. r.i , 1I- .':' BEuE. E C' Fr ENTITLED TO. HAVE THE COOItT 'PirvFir A ri Dn.,E,|E FOR YOU AND YOU WANT 1A ATin.:-riF, ,.1 [.1,.I:T r.TIFY THE COURT BEFORE TiHt' TIME YOUR NOTICE OF OBJECTION MUST BE FILEDIF YOU DO NOT MAKE SURE THAT THE COURT RECEIVES YOUR NOTICE OF OBJECTION ON OR BEFORE THE DEAD- LINE STATED, YOU HAVE AGREED TO A TERMINATION OF YOUR PARENTAL RIGHTS. (d) If you are a parent of the o.'r.c-.. ic Dr- aa'.- you are entitied to consult an ar,:.rr.,, cr..e.n C., ,C!u' even. If you are not entitled to or. anc.i.-.-e, ac.opr. ii- by the court. If you employ an attorney, you may be responsible for any fees and costs charged by that at-' torney unless this Is an adoption proceeding and the' adoptive parents agree to pay, or the court orders them to pay all or part of those fees or expenses. (e) If you wish further Information concerning appoint- ment of an attorney by the court or concerning adop- ltion counseling and guidance, you may contact - Clerk of the Circuit Court for Frederick County, MD - I I' A'F Jri" '"r F -r.er ..:k f.1D 2.i1 i'C j 1 j. i''? , *, r.:.-r. l tre-i,: l. .- p ,r. 5 .,:.-,ur.-i: ling Ir rl: i, a-r. ,a -:.c o"i.:' pr.:,, 3ir .. .:.j ai.., ma,0, rI -, rr"e ptllr to receive adoption c :.ur,.,ir.; a-r.a gularI.Ce /Y0 may have to pay for-tr'n.a .r-..'i:e u,.e rt.e aaoprl'. parents agree to pay or rr.- .:.u.jn .. a. rt-.em to pao all or part of those charges. , Date of Issue: ::-r ru,:-, I N .' :, : .:- ED,. DW'. Er i JUDGE, Ci.cu tii CcJn. .,rFre e ri, Cour.ni, r.aco.-.a IN THE CIRCUIT COURT FOR ' FREDERICK COUNTY MARYLAND N h r.T i rrE r ,.;. : .' ; : 0'L ; F-f.11EL r. l.:1r ,: ,f.lr ,I CCtrr . ... - -ILE JJ UES .;.,,,f JE; C.3.e ri. 0:..3,'-.02'b'H this sheet.) I object to the of the above-named Individual. My reasons for obJection are as follows: .; ; I.1 do/do not want the Court to appoint an attomey'to represent me. If I circled that I do . (Circle one) . want the court to appoint an attorney for me, I belle-e that I am entitled to a court-appointed attorney rp . cause: (Check appropriate box or boxes) ( I am the person to be adopted and () I am at least ten years old but am not yet 18; or ( ) I am at least ten years old and I have a disablllt . that makes me Incapable of consenting to the ad6p- tion or of participating effectively In the proceeding; qr=,q () the proceeding Involves the Involuntary termlnatltd of the parental rights of my parents. S) i am a parent of. the person to be adopted or for whom a guardian Is sought and ( I am under 18 years of age; or [) because of. a disability, I am Incapable of consenf- Ing to the adoption or guardlanshlp or of participating effectively In the proceeding: or () I object to the adoption or guardianship and canlo" afford to hlre an attorney because I am Indlgent Signature. Name, prlnte Addr.es Telephone Num .r Published one (1) time In the Citrus County Chronlc!,. March 3, 2006. ; 813-0303 FCRN : Show Cause Order PUBUC NOTICE ' IMPORTANT THIS IS A COURT ORDER. IF YOU DO NOT UNDERSTAND WHAT THE ORDER SAYS, HAVE SOMEONE EXPLAIN IT TO YOU. YOUR RIGHT TO AN ATTORNEY IS EXPLAINED IN PARAGRAPH 3 OF THIS ORDER. IF YOU DO NOT MAKE SURE THAT THE COURT RECEIVES YOUR NOTICE OF OBr. 1995, S10 Blazer, auto, 4x4, needs engine swap, 2nd engine -included, $200 OBO. (352) 447-2602 Dodge Dakota 2002, Quad Cab, V-8, 4x4 fully loaded, bed liner, topper, excel. cond. $16000. OBO (352) 795-1495 Dodge Pick Up '97, Ext. Cab. 124,611 mi., ['. niI, o, , CITTUS COUNTY (FL) CHRONICLE 3. Right to an attorney. (a) You have the right to consult an attorney and ob- 'toln.Independent legal advice. (b) An attorney mfiay an attorney fpryou If: ,() you are the person to be adopted and: ,(A) you are at least ten years old but are not yet 18; or =(J)) you are at least ten years old and have a disability thqt makes you Incapable of consenting to the adop- tiho or of participating effectively In the proceeding. ,(t2) you are the person to be adopted or the person for whom a guardian Is sought and the proceeding In- volves the Involuntarytermlnatlongtl- ULNE STATED, YOU HAVE AGREED TO A TERMINATION OF YOUR PARENTAL RIGHTS. ,(d) If you are a parent of the person to be adopted, you are entitled to consult an attorney chosen by you, even If you are not entitled to an attorney appointed by the court. If you employ an attorney, you may be responsible for any fees and costs charged by that at- torney unless this Is an adoption proceeding and the Odpptlve parents agree to pay, or the court orders t#*rn to pay all or part of those fees or expenses. ,.(e) If you wish further Information concerning appoint- ment of an attorney by the court or concerning adop- tion counseling and guidance, you may contact Clerk of the Circuit Court for Frederick County, MD 109 W Patrick St., Frederick, MD 21701 (301-694-1976) 4. Option to receive adoption counseling. If this Is an adoption proceeding, you also may have the option to-.receive adoption counseling and guidance. You rmay have to pay for that service unless the adoptive parents agree to pay or the court orders them to pay allor part of those charges. Date of issue: February 10, 2006 /s/ G. EDWARD DWYER, JR. ,C JUDGE, Circuit Court for Frederick County, ,1. Maryland IN THE CIRCUIT COURT FOR FREDERICK COUNTY MARYLAND IN THE MATTER OF A PETITION: FOR ADOPTION OF A MINOR: BY PAMELA MONTGOMERY-MOONEY: AND JAMES MOONEY: Case No.: 05-3602 NOTICE OF OBJECTION (Instructions to the person served with the show cause order: IF YOU WISH TO OBJECT, YOU MUST MAKE SURE T7HT THE COURT RECEIVES YOUR NOTICE OF OBJECTION ON OR BEFORE THE DEADLINE STATED IN THE SHOW CAUSE ORDER. You may use this form to do.so. You nred only sign this form, print or type your name, ad- drqss, and telephone number underneath your signa- tuie, and mail or deliver it to the court at the address sewn In paragraph 2 of the show cause order. IF THE COURT HAS NOT RECEIVED YOUR NOTICE OF OBJECTION ON OR BEFORE THE DEADLINE STATED, YOU HAVE AGREED TO A TERMINATION OF YOUR PARENTAL RIGHTS. If, ypu wish to state your reason you may state them on thissheet.) S Igbject to the of the above-named In ivldual. My reasons for objection are as follows: \ l,,o/do not want the Court tfo appoint an attorney to represent me. if, I circled that I do (Crcle one) wgnt the court to appoint an attorney for me, I believe tfat I am entitled to a court-appointed attorney be- cause: (Check appropriate box or boxes) () I am the person to be adopted and. (a1 am at least ten years old but am not yet 18; or (,], I am at least ten years old and I have a disability Stiqt makes me Incapable of consenting to the adop- tion or of participating effectively in the proceeding; or ( ) the proceeding Involves the Involuntary termination of the parental rights of my parents. I i i ., .3 cl,.,',i .:.f ii', p r...n to be adopted or for ,.:,T-, a '3',J31,lal'. I- '.:,j3. r,i q r . Ii ',', 3 i ,' I .) a,-3 : : .3 : ':r () because c r 3 di 3.iiiir, I .3.T, i.','.3 .3 e .:.r :.-.; rI. Ing to the aa.pri.or,,.., ua'.3ia.r,;r.i o. .,i c.Iao icl: onrig effectively in tr..- c:r.:..:e adir,.3 .:,r ( )1 object to the adoption or guardianship and cannot afford to hire an attorney because I am Indigent Signature Name, printed Address Telephone Number P*sillshed one (1) time In the Citrus County Chronicle, MTrch 3, 2006. P'7' 814-0303 FCRN Show Cause Order PUBLIC NOTICE IMPORTANT THIS IS A COURT ORDER. IF YOU DO NOT UNDERSTAND WHAT THE ORDER SAYS, HAVE SOMEONE EXPLAIN IT TO YOU. YOUR RIGHT TO AN ATTORNEY IS EXPLAINED IN PARAGRAPH 3 OF THIS ORDER. IF YOU DO NOT MAKE SURE THAT THE COURT RECEIVES YOUR NOTICE OF OB- I ACTION ON OR BEFORE THE DEADLINE STATED IN PARA- RAPH 2 OF THIS ORDER, YOU HAVE AGREED TO A TER- IINATION OF YOUR PARENTAL RIGHTS. IN THE CIRCUIT COURT FOR FREDERICK COUNTY MARYLAND I 1E MATTER OF A PETITION: FOR ADOPTION OF A MINOR: BY'PAMELA MONTGOMERY-MOONEY: AND JAMES MOONEY: ..Case No.: 05-3603 K' SHOW CAUSE ORDER TO: Beth Howe Biological Mother of the Minor You are hereby notified that: 1:-Filing of Petition. A Petition has been filed for Adoption of female child who was born at Crystal River, Florida on November 23, 1999. f. Right to object; time for objection. . If you wish to object to the Adoption you must file a noejce of objection with the. clerk of the court on or be- oi6 May 9, 2006, at 100 W. Patrick Court, Frederick, Maryland 21701. WHETHER THE PETITION REQUESTS ADOPTION OR GUARD- IANSHIP, IF YOU DO NOT MAKE SURE THAT THE COURT RECEIVES YOUR NOTICE OF OBJECTIONS ON OR BEFORE IIE' DEADLINE STATED ABOVE, YOU 'HAVE AGREED TO A TERMINATION OF YOUR PARENTAL RIGHTS. 3. Right to an attorney. -(a) You have the right to consult, an attorney and ob- tain Independent legal advice. (b) An attorney may ah attorney folyou if: WI) you are the person to be adopted and: '(A) you are at least ten years old but are not yet 18; or 3(B) you are at least ten'years old and have a disability ttst makes you Incapable of consenting to the adop- ti6f or. of participating effectively In the proceeding. -1T2) you are the person to be adopted or the person for whom a guardian Is sought and the proceeding In- volves the Involuntarytermination- LINE STATED, YOU HAVE AGREED TO A TERMINATION OF YOUR PARENTAL RIGHTS. "'I() If you are a parent of the person to be adopted, S you are entitled to consult an attorney chosen by you, even if you are not entitled to an attorney appointed by the court. If you employ an attorney, you may be rjsonsible for any fees and costs charged by that at- tM'ey unless this Is an adoption proceeding and the adoptive parents agree to pay, or the court orders them to pay all or part of those fees or expenses. (e) If you wish further Information concerning appoint- ment of an attorney by the court or concerning adop- - - ton counseling and guidance, you may contact Clerk of the Circuit Court for Frederick County. MD 100 W Patrick St., Frederick. MD 21701 (301-694-1976) 4. Option to receive adoption counseling. If this Is an adoption proceeding, you also may have the option to receive adoption counseling and guidance. You may have to pay for that service unless the adoptive parents agree to pay or the court orders them to pay all or part of those charges, Date of Issue: February 10, 2006 /s/ G. EDWARD DWYER, JR. JUDGE, Circuit Court for Frederick County, Maryland IN THE CIRCUIT COURT FOR FREDERICK COUNTY MARYLAND IN THE MATTER OF A PETITION: FOR ADOPTION OF A MINOR: BY PAMELA MONTGOMERY-MOONEY: AND JAMES MOONEY: Case No.: 05-3603 on this sheet.) I object to the of the above-named Individual. My reasons for objection are as follows: I do/do not want the Court to appoint an attorney to represent me. If I circled that I do (Circle one) want the court to appoint an attorney for me, I believe that I am entitled to a court-appointed attorney be- cause: (Check appropriate box or boxes) () I am the person to be adopted and. () I am at least ten years old but am not yet 18; or ( ) I am at least ten years old and I have a disability that makes me Incapable of consenting to the adop- tion or of particlpatirg effectively In the proceeding;,or ( ) the proceeding Involves the Involuntary termination of the parental rights of my parents. ( ) I am a parent of the person to be adopted or for *whom a guardian Is sought andt () I am under 18 years of age; or () becauseof a disability. I am Incapable of consent- Ing to the adoption or guardianship or of participating effectively In the proceeding: or () I object to the adoption or guardlanshlp and cannot afford to hire an attorney because I am Indigent Signature Name, printed Address Telephone Number Published one (1) time In the Citrus County Chronicle, March 3,2006. 415-0303 FCRN. PUBLIC NOTICE PUBLIC NOTICE OF INTENT TO ISSUE AIR PERMIT STATE OF FLORIDA DEPARTMENT OF ENVIRONMENTAL PROTECTION DEP File No. 0170022-003-AC Progress Materials, Inc: Citrus County The Department of Environmental Protection (Department) gives notice of Its' Intent to Issue an air permit to Progress Materials, Inc., located at 15760 W. Powerilne Road, Crystal River, Citrus County. The permit authorizes Progress Materials, Inc. to modify a Fly Ash Surge Bin by allowing It to also receive lime- stone by trucks. MAIUNG ADDRESS: Progress Materi- als, Inc., 200 Central Avenue, Suite 1000. St. Peters- burg, FL 33701 to the attention of Mr. Frank KIrkconnell, Vice President and General Manager, The Department will Issue tr.e rii.31 rrr.ii .vitr. he attached conditions unless a3 reipcEr.i .ec.aied In accordance with the following procedures results In a different: decision'or signtifbant change of terms or- conditions. The Department will accept written comments and requests for public meetings concerning the pro- posed permit Issuance action for a period of four- teen days from the date of publication of this Public Notice of Intent to Issue Air Permit. Written com-. ments and requests for public meetings should be provided to the Department of Environmental Pro- tection, 13051 N. Telecom Parkway, Temple Terrace, FL, 33637-0926. Any written comments filed shall be made available for public Inspection. If written .comments received result In ad grfi.:ar.r .=:r.3nga in the proposed agency action, -re C.-ep.nrrm'enr i:r,-a revise the proposed permit and reauir Iir oociic.:aDo another Public Notice. The Department will Issue the final permit with the attached conditions unless a timely petition for an administrative hearing Is filed pursuant to Sections 120.569 and 120.57, F.S. before the deadline for filing a petition, The procedures for petitioning for a hearing are set forth below. Mediation Is not available In this proceeding. A person whose substantial Interests are affected by the proposed permitting decision may petition for an administrative .,r ,,aitr. (hra.g'i. u".er Sections 129.569 and 120.57, F.S. The perrror m.u:t contain the ir.i.:;.,.Tall.:.r. set forth below and must be filed i.rei.e-3. ir. the Office of General Counsel of the Department, 3900 Commonwealth' Boulevard, Mall ?t3ll, o. '.' i'.3l.3r..r3..-., .:.ida, 32399-3000. Petitions iii.-3 C, ir, pe-nria .3ppi-.3.~.r or any of the parties list- ed below must be filed within fourteen days of re- ceipt of this notice of Intent. Petitions filed by any persons other than those entitled to written notice under Section 120.60(3), F.S. must be filed within four- teen days of publication of the public notice or. within fourteen days of receipt of this notice of In- tent, whichever occurs first. Under Section 120.60(3), F.S., however, any person who askec ir.e Decarnrr.,r.i for notice of agency action may file a p-rii.,.r. .mirr. In fourteen days of receipt of that -,.:.II.:, r,6.3.31a3.,e of the date of publication.. A petiti.r.e- :nrail mana, F.S. or to Intervene In this proceeding and o,.3,tl:l;oate 3: 3 par- ty to It, Any subsequent interve-.lic.r. ,. m Ii nl'riy at the approval of the presiding officer upon the filing of a motion In compliance with Rule 28-106.205, F.A.C. A petition that disputes the material facts on which the Department's action Is based must contain the following Information: (a) The name and address of each agency affected .and each 3.e..:, ; nle or Identification number, If known; (b) ir. r, 3,'5 ad- dress, and telephone number o0 r iCh -iifi.:.r.er the name, address, and telephone -,.jrr.oe ci rr. peti- tioner's representative, if any, which shall be the ad- dress for service purposes during .the course of the proceeding; and an explanation of how the peti- tioner's substantial Interests wlll be affected by the agency determination; (c) A statement of how and when petitioner received notice of the agency ac- tion or proposed action; (d) A statement of all dls- puted Issues of material fact. If there are none, the petition must so Indicate; (e) A concise statement of the ultimate facts alleged, Including the speclflc facts the petitioner contends warrant reversal ofr modification of the agency's proposed action; (f) A statement of the specific rules or statutes the peti- tioner contends require reversal or modification of the agency's proposed action; and (g) A statement of the relief sought by the petitioner, stating precise- ly de- signed to formulate final agency action, the filing of a petition means that the Department's final action may be different from the position taken by It In this notice. Persons whose substantial Interests will be affected by any such final decision of the Depart- ment on the application have the right to petition to become a party to the proceeding, In accordance with the requirements set forth above.' A complete project file Is available for public Inspec- tion during normal business hours, 8:00 a.m. to 5:00 p.m., Monday through Friday, except legal holidays, at the Florida Department of Environmental Protec- tion, Southwest District. 8407 Laurel Fair Circle, Tam- pa, Florida. The complete project file Includes the application, technical evaluations, Draft permit, and the Infor- mation submitted by the responsible official, exclu- sive of confidential records under Section 403.111, F.S. Interested persons may contact Mara Grace Nasca, District's Air Program Administrator, at 8407 Laurel Fair Circle, Tampa, Florida or call 813-632-7600, for addl- tonal Information. Any person may request to obtain additional Infor- mation, a copy of the application (except for Infor- mation entitled to confidential treatment pursuant to Section 403.111, F.S.), all relevant supporting mate- rials, a copy of the permit draft, and all other materi- als available to the Department that are relevant to the permit decision. Additionally, the Department will accept written comments concerning the pro- posed permit Issuance action for a period of 14 (fourteen) days from the date of publication of "Public Notice of Intent to Issue Permit." Requests and written comments filed should be provided to the Florida Department of Environmental Protection at 13051 N. Telecom Parkway, Temple Terrace, FL, 33637-0926, to the attention of Mara Grace Nasca (phone no, 813-632-7600) referencing the DEP file number listed above. Any written comments filed shall be made available for public inspection. If writ- ten comments received result In a significant change In the proposed agency action, the Depart- ment shall revise the proposed permit and require, If applicable, another Public Notice. Published one (1) time In the Citrus County Chroni- cle, March 3, 2006. 800-0303 FCRN Notice of Sale Lester R. Fagg, et al. vs. Shirley Scigllmpaglia, et al. PUBLIC NOTICE IN THE CIRCUIT COURT OF THE FIFTH JUDICIAL CIRCUIT, IN AND FOR CITRUS COUNTY, FLORIDA. CASE NO. 2005-CA-3641 LESTER R. FAGG and BEVERLY J. FAGG, his wife, Plaintiffs, -vs- SHIRLEY SCIGLIMPAGLIA, TROY C. MATTHEWSON; AUTO OWNERS INSURANCE COMPANY A/S/O ALLSTATE TRANSMISSION; GENERAL'MOTORS ACCEPTANCE CORPORATION, a foreign Corporation; L&W SUPPLY CORP., d/b/a SEACOAST SUPPLY; INSULATION DISTRIBUTORS, INC., Defendants. NOTICE OF SALE NOTICE IS HEREBY GIVEN pursuant to that certain Sum- mary Final Judgment of Foreclosure daitd Februar,, 8, 2006, and entered In the Circuit C .:,ur .: r tr,-. fir. Ju.di- clal Circuit, In and for Citrus County, Florida, wherein LESTER R. FAGG and BEVERLY J. FAGG, husband and' wife, are the Plaintiffs and SHIRLEY SCIGLIMPAGLIA, TROY C. MATTHEWSON; AUTO OWNERS INSURANCE COMPANY A/S/O ALLSTATE TRANSMISSION; GENERAL MOTORS ACCEPTANCE CORPORATION, a foreign Cor- poration; L&W SUPPLY CORP., d/b/a SEACOAST SUPPLY; INSULATION. DISTRIBUTORS, INC. are the Defendants, I will offer for sale and will sell to the. highest and best bidder for cash at public auction at the Jury Assembly Room In the new addition to the Citrus County Court- house, 110 N. Apopka Avenue, Inverness, Citrus Coun- ty, Florida, at 11:00 A.M. on the 9th day of March, 2006, the following described real property as set forth In the Summary Final Judgment of Foreclosure: Lot 122, Block 17, PLANTATION GARDENS, HOMOSASSA HILLS, UNIT 2, according to the map or plat thereof as recorded In Plat Book 4, page 128, public records of Citrus County, Florida, TOGETHER with that certain 1997 Triple-Wide CLAS mobile home ID#'s JACFL18198A, JACFL18198B and JACFL18198C; Title #'s 71185304, 71185305 and 71185306; RP#'s R0675499, R0675500 and R0716701 situated thereon, WITNESS my hand and the seal of the Court on this 9th day of February, 2006, BETTY STRIFLER Clerk of Courts- By: /s/ J. Ramsey Deputy Clerk Published two (2) times In the Citrus County Chronicle, February 24 and March 3, 2006. 801-0303 FCRN Notice of Sale Harvey Schonbrun, Trustee vs. Duane,P. Holloway PUBLIC NOTICE IN THE CIRCUIT COURT OF THE FIFTH JUDICIAL CIRCUIT IN AND FOR CITRUS COUNTY, FLORIDA CIVIL DIVISION, CASE NO. 2005-CA-5095 HARVEY SCHONBRUN, TRUSTEE, Plaintiff, vs. DUANE P. HOLLOWAY, Defendant. NOTICE OF SALE Notice Is r,eiei jgl.e.-. rr.al pur.uar.I ri, a hvral Ju,.. ment of Forecio:u.e er.nire-a |I-. ir.e 1 ao,.-, .riea cause, In mrn Cir.:ut Counr of Cirru: Cour.r, Fin..,n3 i 'will sell the pi:operr/ :ruaie ir. Crr';' Courir, lFjioaa ce- scribed as: Lot 8, Block G, CINNAMON RIDGE UNIT 1, according to. map or plat thereof as recorded In Plat Book 12. Pages 35 & 36, of the Public Records of Citrus County, Florida TOGETHER WITH that certain' 1984 *BEAC" single wide mobile home located thereon and also known as ID #SSMFLABI0101. at public: sale, to the highest and best bidder, for cash, at the'new Citrus County, Courthouse Addition, 110 North Apopka Avenue, Inverness, Florida, in the Jury Assembly Room, first floor, at 11:00 a.m. on the 9th day of March, 2006. Dated this 15th day of February. 2006. BETTY STRIFLER CLERK OF THE COURT By:; /s/ Judy Ramsey Deputy Clerk Published two (2) times In the Citrus County Chronicle, February 24, and March 3,2006. , 809-0310 FCRN Notice of Sale Inverness Landings vs. Elizabeth Osmond PUBLIC NOTICE IN THE COUNTY COURT OF THE FIFTH JUDICIAL'CIRCUIT IN AND FOR CITRUS COUNTY, FLORIDA CASE NO.: 2005-CC-2160 INVERNESS LANDINGS PROPERTY OWNERS ASSOCIATION, Plaintiff, vs. ELIZABETH OSMOND, Defendant. . NOTICEOF SALE Notice Is hereby given that pursuant to the Summary Fi- nal Judgment of Foreclosure entered In this cause, In the County Court of Citrus County, Florida, I will sell the property situated In Citrus County, Florida, described as; ANGLERS LANDING PHASES 5 & 6, PLAT BOOK 14, PAGE 4, LOT 1, BLOCK 20, PUBLIC RECORDS OF CITRUS COUN- TY, FLORIDA. at public sale, to the highest and best bidder, for cash, In th Jury Assembly Room at the Citrus County Court- house, 110 North Apopka Avenue, Inverness, FL 34450 on March 16, 2006 at 11:00 a.m. BETTY L STRIFLER CLERK OF THE CIRCUIT COURT Y BY:/S/M. EVANS Deputy Clerk Published two (2) times In the Citrus County Chronicle, March 3 and 10,2006. , 894-0303 FCRN Notice of Sale Deutsche Bank, etc, vs. Darryl G, Davidson Est,, et al, PUBLIC NOTICE IN THE CIRCUIT COURT OF THE FIFTH JUDICIAL CIRCUIT IN AND FOR CITRUS COUNTY, FLORIDA CIVIL ACTION CASE NO. 2005-CA-4335 DIVISION DEUTSCHE BANK NATIONAL TRUST COMPANY, AS TRUSTEE, Plaintiff, vs. THE UNKNOWN HEIRS, DEVISEES, GRANTEES, ASSIGNEES, LENORS, CREDITORS, TRUSTEES, OR OTHER CLAIMANTS CLAIMING BY, THROUGH, UNDER, DARRYL G. DAVIDSON, DECEASED, elt al., Defendantss. NOTICE OF FORECLOSURE SALE NOTICE IS HEREBY GIVEN pursuant to a Final Judgment of Mortgage Foreclosure dated February 08, 2006, and entered In Case NO. 2005-CA-4335 of the Circuit Court of the FIFTH Judiclal Circuit in and for CITRUS County, Florida wherein DEUTSCHE BANK NATIONAL TRUST COM- PANY, AS TRUSTEE, Is the Plaintiff and THE UNKNOWN HEIRS, DEVISEES, GRANTEES, ASSIGNEES, LIENORS, CRED-, ITORS, TRUSTEES, OR OTHER CLAIMANTS CLAIMING BY, THROUGH, UNDER, DARRYL G. DAVIDSON, DECEASED; DALE S. DAVIDSON, AS PERSONAL REPRESENTATIVE OF THE ESTATE OF, DARRYL G. DAVIDSON. DECEASED; DALE S. DAVIDSON, AS AN HEIR OF THE ESTATE OF DARRYL G, DAVIDSON. DECEASED; FISHER G. DAVIDSON, A MINOR IN THE CARE OF HER MOTHER AND NATURAL GUARDIAN, WHITNEY LOUISE CHARLTON; MICHELLE LING, FOR MA- SON L. DAVIDSON, A MINOR AS AN HEIR OF THE ESTATE OF DARRYL G. DAVIDSON, DECEASED; ANY AND ALL UNKNOWN PARTIES CLAIMING BY, THROUGH, UNDER, AND AGAINST THE HEREIN NAMED INDIVIDUAL DEFEND- ANT(S) WHO ARE NOT KNOWN TO BE DEAD OR ALIVE, WHETHER SAID UNKNOWN PARTIES MAY CLAIM AN IN- TEREST AS SPOUSES, HEIRS, DEVISEES, GRANTEES OR OTH- ER CLAIMANT; TENANT #1 N/K/A MICHELLE LING are the Defendants, I will sell to the highest and best bidder for cash at JURY ASSEMBLY ROOM IN THE NEW ADDITION TO THE NEW CITRUS COUNTY COURTHOUSE, 110 NORTH APOPKA AVENUE, INVERNESS, CITRUS COUNTY, FLORIDA at 11:00 AM, on the 9th day of March, 2006, the follow- ing described property as set forth In sold Final Judg- ment: LOTS 76, 77 AND 78 OF WHITE LAKE SUBDIVISION, AC- CORDING TO THE PLAT THEREOF AS RECORDED IN PLAT BOOK 7, PAGES) 84 OF THE PUBLIC RECORDS OF CITRUS COUNTY, FLORIDA. A/K/A 622 Whilte Boulevard, Inverness, FL 34453-1053 WITNESS MY HAND and the seal of this Court on Febru- ary 10, 2006. Betty Strifler Clerk of the Circuit Court By:; /s/ J. Ramsey Deputy Clerk Published two (2) times in the Citrus County Chronicle, February 24 and March 3, 2006. F05019547 895-0303 FCRN Notice of Sale Wells Fargo Bank, N.A. vs. Kelly L. McHugh, et al. PUBLIC NOTICE IN THE CIRCUIT COURT OF THE 5TH JUDICIAL CIRCUIT, IN AND FOR CITRUS COUNTY, FLORIDA GENERAL JURISDICTION DIVISION CASE NO.; 2005-CA-4608 WELLS FARGO BANK, N.A., PLAINTIFF, VS. KELLY L. MCHUGH IF LIVING, AND IF DEAD/THE UNKNOWN SPOUSE, HEIRS, DEVISEES, GRANTEES, ASSIGNEES, LIENORS, CREDITORS, TRUSTEES AND ALL OTHER PARTIES CLAIMING AN INTEREST BY, THROUGH, UNDER OR AGAINST KELLY L.. MCHUGH; UNKNOWN SPOUSE OF KELLY L MCHUGH IF ANY; KELLY L.. MCHUGH AS PERSONAL REPRESENTATIVE OF THE ESTATE OF DENNIS J. DARBY; RYAN R. DARBY IF LIVING, AND IF DEAD, THE UNKNOWN SPOUSE, HEIRS, DEVISEES, GRANTEES, ASSIGNEES, LIENORS, CREDITORS; TRUSTEES AND ALL OTHER PARTIES CLAIMING AN INTEREST BY, THROUGH, UNDER OR AGAINST RYAN R. DARBY; DENNIS DARBY JR., A MINOR, BY AND THROUGH HIS NATURAL MOTHER, TERESA DARBY IF LIVING, AND IF DEAD, THE UNKNOWN SPOUSE, HEIRS, DEVISEES, GRANTEES, ASSIGNEES, LIENORS, CREDITORS, TRUSTEES AND ALL OTHER PARTIES CLAIMING AN INTEREST BY, THROUGH, UNDER OR AGAINST DENNIS DARBY JR., A MINOR; JOHN DOE AND JANE DOE AS UNKNOWN TENANTS IN POSSESSION, DEFENDANTS) NOTICE OF FORECLOSURE SALE NOTICE IS HEREBY GIVEN pursuant to a Summary Final Judgment of Foreclosure dated February 8, 2006, en- tered In Civil Case No. 2005-CA-4608 of the Circuit Court of the 5TH Judicial Circuit In and for CITRUS County, INVERNESS, Florida, I will sell to the highest and best .bidder for cash at JURY ASSEMBLY ROOM, IN THE NEW ADDITION TO THE NEW CITRUS COUNTY COURT- HOUSE at the CITRUS County Courthouse located at 110 N. APOPKA AVENUE in INVERNESS, Florida, at- 11:00 a.m., on the 9th day of March, 2006, the following de- scribed' property as set .forth In said Summary Final Judgment, to-wit: LOTS 72, 73 AND 74, BLOCK 271, INVERNESS HIGHLANDS SOUTH, A SUBDIVISION, BOOK 3, PAGES 51 THROUGH 66, CITRUS COUNTY, FLORIDA. Dated this 10th day of February, 2006. BETTY STRIFLER Clerk of the Circuit Court (CIRCUIT COURT SEAL). By; /s/ Judy Ramsey Deputy Clerk IN r ..:'Lr-C-rJ(E WITH THE AMERICANS A'JVIHL Di-bILi. TIES -GI p-r:.;r.: with disabilities needing 3 :p:iai a.:-. commodation should contact COURT ADMINISTRA- TION, at the CITRUS County Courthouse at, 1-800-955- 8771 (ODD) or 1-800-955-8770, via Florida Relay Service. Published two (2) times in the Citrus County, Chronicle, Fec ,ruar, .J. ama F.13r.:r. 2 .: u i-J" I'. i r.1irif 897-0303 FCRN ri.,ncs ur 5'3l- U.S. Bank, etc. vs. Justin Lambright, et al. PUBUC NOTICE IN THE CIRCUIT COURT OF THE 5TH JUDICIAL CIRCUIT OF FLORIDA, IN AND FOR CITRUS COUNTY CASE #: 05-C*..01' UNC:_ U S BANK. N A., AS TRUSTEE FOR THE REGISTERED HOLDERS OF ASSET BACKED SECURITIES CORPORATION HOME EQUITY LOAN TRUST 2004-HE8, ASSET BACKED PASS-THROUGH CERTIFICATES, SERIES 2004-HE8, Plaintiff, -vs.- - JUSTIN LAMBRIGHT AND BRANDY LAMBRIGHT F/K/A BRANDY WILUAMSON, HIS WIFE; SALE riI :E i.r HEIkF Era C.,j u.3rir .: 3r, .r1 .-,r r of Final juJagrr.ir,II a F. e : i...ur aea Fec. u.ar, 8 ;.006, en- T ir-, '-I.I 'I :- ri... -'. i I r..s Cir.:uillr Court 31 rr.-- ir. ju.3i.:ii 'l r j ir: Ir. .r.I c.i, C.irj '-our'.ry, Flori- da, -whereln U.S.: BANK, N.A., AS TRUSTEE FOR THE REGIS- TERED HOLDERS OF ASSET BACKED SECURITIES CORPOC RATION HOME EQUITY LOAN TRUST 2004-HE8, ASSET BACKED PASS-THROUGH CERTIFICATES, SERIES 2004-HE8, Plaintiff and JUSTIN LAMBRIGHT AND BRANDY LAMBRIGHT F/K/A BRANDY WILLIAMSON, HIS' WIFE, are defendantss, I will sell to the highest and best bidder for cash, FRONT STEPS OF THE COURTHOUSE TO THE JURY ASSEMBLY ROOM IN THE NEW ADDITION TO THE .NEW CITRUS COUNTY COURTHOUSE at 11:00 a.m., on March 9, 2006, the following described property as set forth In said Fnal Judgment, to-wit: LOT 7, IN BLOCK B, OF PARADISE COUNTRY CLUB, AC- CORDING TO THE PLAT THEREOF, AS RECORDED IN BOOK 2,.AT.PAGE 182, OF THE PUBLIC RECORDS OF CITRUS COUNTY, FLORIDA. 10th day of February,. 2006. ,. . BETTY STRIFLER CLERK OF THE CIRCUIT COURT CItrus County, Florlda: By:/s/Judy Ramsey Deputy Clerk Published two (2) times In the Citrus County Chronicle, February 24 and March 3, 2006. 05-68098T 896-0303 FCRN Notice of Sale Bank of America, et al. vs. Fred M. Rhodes, Sr., et al, PUBLIC NOTICE IN THE CIRCUIT COURT OF THE 5TH JUDICIAL CIRCUIT, IN AND FOR CITRUS COUNTY, FLORIDA GENERAL JURISDICTION DIVISION CASE NO.: 05-CA-4974 BANK OF AMERICA, NATIONAL ASSOCIATION, successor by merger to BA MORTGAGE, LLC, successor by merger to NATIONSBANC MORTGAGE CORPORATION, PLAINTIFF, VS. FRED M. RHODES, SR., IF LIVING, AND IF DEAD, THE UNKNOWN SPOUSE, HEIRS, DEVISEES, GRANTEES, ASSIGNEES, LIENORS, CREDITORS, TRUSTEES AND ALL OTHER PARTIES CLAIMING AN INTEREST BY, THROUGH, UNDER OR AGAINST FRED M. RHODES, SR.; BETTY L. RHODES; FREDERICK M. RHODES, JR., IF LIVING, AND IF DEAD, THE UNKNOWN SPOUSE, HEIRS, DEVISEES, GRANTEES, ASSIGNEES, LIENORS, CREDITORS, TRUSTEES AND ALL OTHER PARTIES CLAIMING AN INTEREST BY, THROUGH, UNDER OR AGAINST FREDERICK M. RHODES, JR.; UNKNOWN SPOUSE OF FREDERICK M. RHODES, JR., IF ANY; CAPITAL CITY BANK; JOHN DOE and JANE DOE AS UNKNOWN TENANTS IN POSSESSION DEFENDANTS) NOTICE OF FORECLOSURE SALE NOTICE IS HEREBY GIVEN pursuant to a Summary Final Judgment of Foreclosure dated February 8, 2006, en- tered In Civil Case No. 05-CA-4974 of the Circuit Court of the 5TH Judicial Circuit In and for CITRUS County, IN- VERNESS, Florida, I will sell to the highest and best bid- der for cash at IN THE JURY ASSEMBLY ROOM IN THE NEW ADDITION at the CITRUS County Courthouse lo- cated at 110 N. APOPKA AVENUE in INVERNESS, Florida, at 11:00a.m., on the 9th day on he 9h day of March, 2006, the follow- ing described property as set forth In said Summary Fi- nal Judgment, to-wit; LOT 5, HOLIDAY ACRES, UNIT #2, AS PER PLAT THEREOF RECORDED IN PLAT BOOK 6, PAGES 40 AND 41, PUBLIC RECORDS OF CITRUS COUNTY, FLORIDA, LESS THE SOUTH 638.88 FEET THEREOF. TOGETHER WITH AN EASEMENT ACROSS THE WEST 5 FEET OF THE EAST 150 FEET OF THE SOUTH 638.88 FEET OF SAID LOT 5 AND TOGETHER WITH AN EASEMENT ACROSS THE EAST 5 FEET OF THE WEST 150 FEET OF THE SOUTH 638.88 FEET OF SAID LOT 5. TOGETHER WITH A 1989 MERIT DOUBLE WIDE MOBILE HOME VIN#'S SF35228068A and SF35228068B Dated this 10th day of February,, February 24 and March 3, 2006. 05-48346(FM)NAT 742-0303.W/TH/FCRN PUBLIC NOTICE The Citrus County School Board will accept sealed Re- quest for Proposals for: RFP # 2006-44 SARGENT LOCKS & HARDWARE Bid specifications may be obtained on the CCSB VendorBid website; Automated Vendor Application & Bidder Notification system: www vendorbid net/cifrus/ Sandra "Sam" Himmel Superintendent, Citrus County School Board Published. three (3) times in the Citrus County Chronicle, March 1,2, 3, 2006. 898-0303 FCRN Notice of Sale USA, etc. vs. Wallace J. Heintz, et al. PUBLIC NOTICE IN THE CIRCUIT COURT OF THE FIFTH JUDICIAL CIRCUIT OF FLORIDA IN AND FOR CITRUS COUNTY CIVIL ACTION CASE NO. 2005 CA 4538 UNITED STATES OF AMERICA, acting through the United States Department of Agriculture, Rural Development, f/k/a Farmers Home Administration, Plaintiff, vs. WALLACE J. HEINTZ and DEBRA J. HEINTZ, Husband and Wife; and CITRUS COUNTY FLORIDA, Defendants. * NOTICE OF SALE NOTICE IS HEREBY GIVEN that pursuant to a Summary Fi- nal Judgment of Foreclosure entered, on February 8, 2006, by the above entitled court In the above styled cause, the undersigned Clerk of Court or any of his 3.l, .3,,Tr.i.ri:.a .3,-..rjN-u .-iii .ii ,r, e property situated ,-..-fi'l.I.: Cour.r, II.:.i.3 .Ics s.:rnic. a o . Lot 1, Block "B", of PINE VALLEY, according to the plat thereof as recorded In Plat Book 12, Page 90, public records of Citrus County, Florida, at u-l:i.c .'u n.:., I, nme r.iarr.i o.,rd :e.r' r oaa i,.' i.:. cash on March 9, 2006, at 11:00 AM .-. ir.-e lur, .:embly F.-:,.ir. i r, re t. .3a.3ii.:.r. I,c ir.- New Citrus County C'c.u'r.,nou:-. i 10 I-'ir. -c.cL.e ".-r.ue. Inverness, Flori- a.3 u.-.1,' :,j .,:r r .311 ..) ..:r1. ., taxes and assess- ments for the real property described above. Hi -:cHEr.'E.-rif ,'rr iHE 1E-',:'J3 WITH DISABILI- iE; C i FE i'-,ri: 'A.i Cr:, iTiE'L I IEEDING A SPE- CI.L ';:.'.:':r..1 .L:.r-i-.:.rI iGc, T r/ii'.if-TE IN THIS PRO- .EuE[iri.- :. 'I.IIL. ,*:'rir-:i iHE .:fri:C OF THE COURT ADMINISTRATOR, 110 NORTH APOPKA, AVENUE, INVER- NESS, FLORIDA 34450-4299, TELEPHONE '(352) 341-6400, WITHIN TWO .2.. W,':.ir if -IG DAYS OF YOUR RECEIPT OF THIS NOTICE *F .-:. i.:. IF HEARING IMPAIRED, ODD) 1-800-955-8771, OR VOICE (V) 1-800-955-8770, VIA FLORIDA RELAY SERVICE. DATED on February 10,.2006. BETTr.' TPiFLEr Clerk cr Cir, uI C.'::.,jn 1 ij r,.:.nr. .C:.p.-3 .-erIe Ir..,er-..; EL -. -U.-J^2 (CIRCUIT COURT SEAL) By: /s/ Judy Ramsey Deputy Clerk -uCi'i.r.ea rA.:. .1 n,.-,. Ir, ir- Citrus County Chronicle, cV.',1., 3r,.3 r.lar,:r. 2' . 699-0303 FCRN I ,,T.-r.er -l I].:.I l, i O .ol1 f 3,'..r, "- I E:ial- .1 1 ,3 J'5..A CvtO ..:.'. i *31 PUBLIC NOIICE IN THE C ri LIIC i r.' f iHe IFITH .ii.C.ICII '.j-iC I.IiT I C' f ':I r *:J. -- 'ir I .CO Li ir L. i" ,:- I--,E i: -,:-1.1" E PARESH G. DESAI and NICHOLAI ZELNERONOK vs. JESSE DOBSON and SHIRLEY BOWERMASTER. PETER GU- BER. LEEPER AIR CONDITIONING & HEATING. INC.. a Flor- ida corporation, IRENE S. TINGLEY. MAYNARD L.. TING- LEY. SR.. FIRST UNITED PENTECOSfAL CHURCH, ARNOLD'S CONSULTING AND EDuCATION SERVICES INC.. a Florida corporation, SURF'S UP INCORPORATED, a texas corpo- ratlon, JOHN DOE 1/JANE DOE 1, JOHN DOE 2/JANE DOE 2, AND JOHN DOE 3/JANE DOE 3, AS UNKNOWN TENANTS IN POSSESSION, i all., .3r.i.3 i a-n a rr.aIr un- Ikr i.,.. :c.,J.- ne ., a.i .i. ga- .ie : creanra; rru . Ir ,. .:r .:.rr i.r .:iaim r,.r: a-1.3 a I r.'31j : .:i.3a TIr. c, tr ,.-,jar. u ,-r3 i' or .3.aci :ri ir .A -.3 311 ijri .. -, -atu- ral i:.r:.:....: ir 311i.. a II 3 :.r c..:.l .r,,-...r. Ic. be 3e.-3.- allji.e rr. .-i :e..,'al a r. -. r_. ,:n.- ul,.i .,-.. AMENDED NOTICE OF MORTGAGE FORECLOSURE SALE NOTICE IS HEREBY GIVEN that the undersigned, BETTY STRIFLER, Clerk of the Court, pursuant to a Fi.-..3 Judg- '-.r.i of For i -...j. dated January 4, .I0n: Ir. Case iJ,, ;..)c -.31 ]: Ci'c'uir Court of the Fifth Judicial Cir- cuit In and for Citrus County, Florida, will sell to the high- esf bidder for cash at the front door of the Citrus Coun- ty Courthouse, 110 North Apopka Avenue, Inverness, Florida at 11:00 a.m., on the 9th day of March, 2006, the following described real properly as set forth In the Fl- nal Judgment of Foreclosure, to wit: See Attached Exhibit "A" DATED on this 10tOh day of February, 2006. BETTY STRIFLER, Clerk of the Court By: /s/ Judy Ramsey Deputy Clerk EXHIBIT "A" Lots 197 and 198 of Crystal Park Addition to the town of Crystal River, Florida, according to map or plat thereof recorded In Plat Book 1, Page 2, Public:Records of Cit- rus County, Florida, and Beginning on the North line of Church Street plattedd but not opened) at a point 40 feet Westwardly, measured at right angles, from the center line of the Atlantic Coast Line Railroad Company main track, said point being 128 feet Northeastwardly, measured along said center line, from said Railroad Company's mile post RD-790; running thence North- eastwardly, parallel with said center line 3144 feet to the South line at College Street, platted but not opened; thence Westwardly along the South line of said College Street, 201. feet; thence Southwardly 300 feet to a point on the Noadh line of said Church Street distance 102 feet Westv '1ly, measure along said North line, from the point of beginning; thence East- wardly along said North line 107 feet to.the point of be- ginning; being all of lots 199 and 200 In the Town of Crystal River In the Northwest 1/4 of the Northeast 1/4 of Section 21, Township 18 South, Range 17 East, a map or plat which Is of record In the Clerk's Office of said Citrus County, Florida. LESS AND EXCEPT: That part of the "llnycky" tract as per description re- corded In Official Record Book 1071, page 29 of the Public records of Citrus County, Florida, being a portion of Lot 198, "The Townsfte of Crystal Park", as per plat thereof, recorded In Plat Book 1, page 2 of said Public Records, being in Section 21, Township 18 South, Range 17 East and being more particularly described as fol- lows. Beginning at the Southwest comer of Lot 198, "The Townsite of Crystal Park", as per plat thereof, recorded In Plat Book 1, page 2 of the Public Records of Citrus County, Florida, said point being the Southwest comer of the "llnycky" tract as per description recorded In Of- ficial Record Book 1071, page 29 of said Public Rec- ords; thence North 00 degrees 41' 08" West along the West line of said Lot 198 and along the West line of said "llnycky" tract for 80 feet; thence North 89 degrees 28' 58" E along a line parallel with the South line of said Lot 198 and the South line of said "llnycky" tract for 50 feet; thence South 00 degrees 41' 08" East along a line paral- lel with said West lines for 80 feet to an Intersection with said South line; thence South 89 degrees 28' 58" West along said South lines for 50 feet to said Point of Begin- ning. Published two (2) times In the Citrus County Chronicle, February 24 and March 3. 2006. CITRus COUNTY (FL) CHRONICLE IOD LIuDA, ,, vmARci 3, 2006 LI NCOLN REACH HIGHER SIGN * 2006 MERCURY GRAND MARQUIS Over 50 In Stock! MERCUI NEW DOORS C RY )PEN AM/FM Stereo/CD, 8-Way Power Drive Seat W/ Lumbar, Illuminated Entry W/Theater Dimming Feature, Anti-Lock Braking System, Auto, Parking Brake Release, Speed Sensitive Variable, Assist Power Steering, Air Conditioning-CFC Free, Power Equipment Group-Locks, Windows and Mirror, Wiper Activated Headlamps, Maintenance Free Battery, Dual Stage Front Air Bags, Front Crash Severity Sensor, Anti-Theft Securilock System, 3 Yr/36,000 Mile Warranty, 100k Mile Tune-Up Interval, 24-Hr Roadside Assistance. * "Includes $3 000 Rebate $2 000 Owner Loyalty anda 1 000 Fora Molt or Credit 2006 LINCOLN TOWN CAR\ $ " 12-Spoke Machined Aluminum Wheels, 8 Way Power Front Seats, Dual-Zone Electronic Climate Control, Extended Rear ParkJAssist, ink automotive history fo receive a Five Star Rating: in all five categories. I $8 9 ,r2002 FORD S9 2001 FORD9 9 2003 FORD 9' S995 TAURU995 FOCUSWAGON 5 TAURUS SE I, R ed cloth nt, full pr 1S6264 Elect blue auto A'C #P30784 Green, cloth. 36k mi #R3019 2003 FORD WINDSTAR SEL Blue. 16 000 miles leather intenor, loaded $ 14,995 2003 TAURUS WAGON Gold 20 000 miles #R3025 $ 14,995 zuu2 I-UKU 2003 GRAND 2005 SABLE LS MUSTANG MARQUIS LS silver moon roof Only 7,000 miles CD Ultimate. candy apple leather. CD player player V6 #R3030 red 38h1 mi leather nt #R3022 $ 14,995 $ 14,995 $ 14,995 2003 GRAND 2002 FORD F150 MARQUIS SUPER CAB Ultimate Edition, blue, Black. V8. 15 000 miles. #R3036 #R3043 $ 15,995 15,995 2004 GRAND 2005 GRAND MARQUIS GS MARQUIS LS Silver, 23,000 miles. Leather, 19,000 miles. leather intenor blue #R3032 1 15.995 17.995 2005 GRAND MARQUIS LS Gold leather 19 000 miles #X853 S 17,995 2005 GRAND MARQUIS LS Silver loaded 19 000 miles #IR3050 $ 17,995 2005 FREESTAR SEL White dual air 20k mi, DV'D player #R3027 S17,995 2003 TOWN CAR 2005 FORD SIGNATURE MUSTANG 23 000 miles one Lime green 3k mi Ithi ontner #R3053 6 CD player #R2999 S9951919,995 4 %.L.0.. Eli 2002 LINCOLN LS 2003 LINCOLN 2005 FORD LIMITED TOWN CAR ESCAPE XLT Burgandy. moon roof White. Signature, one Moon roof, Ithr 13k #X836 owner, tan top #R3058 #R3002 9.995 21995 $21,995 zUU3 IUWN LAK PRESIDENTIAL Blue. 19 000 miles one otiner #R3061 121.995 2003 TOWN CAR CARTIER LIMO i ory. one oatne-r #P3060 122.995 2005 FORD FREESTYLE SPORTS WAGON LI ,99ir5 I 7 riA: Br 35-A 122.995 '.7 r~z-- -nr'- MIt!a. 'M 2004 TOWN CAR SIGNATURE Gold 9 000 miles #R3057 124.995 2004 TOWN CAR 2005 FORD F150 2005 TOWN CAR 2005 TOWN CAR .. - SIGNATURE CREW CAB 4X4 LIMITED LIMITED LVItie 22 000 miles white. 5 4 T riton. W white. moon roof Gold moon roof loaded #X551 only 21 000 miles 14 000 miles #R3054 #R3059 2003 LINCOLN ' $24,995 $26,995 $28,995 $28995 hlVGTOR983 28,995 ilk SEALED & DELIVERED ..... ,... ,N.; .. , V a. I. a' i. ........... ow *It Wig ........... LINCOLN MERCURY OURS: Mon.-Fri. 8-6, Sat. 9-5 Sun. Closed SERVICE PARTS: Mon.-Fri. 8-5:30 SAT 8-12:00 FRIDAY, MARCH 3, 2006 11D 2005 ALTIMA 14,925 DOWNN ^253 PER $5 MONTH* 2005 EXPLORER 2005 ACCORD $15,945 *ODOWN $271 MONTH H 2005 DURANGO 2005 CAMRY .15,825 DOWNN E27 NTH* $271MONTH* 2005 SONATA $11,650 DOWNN 98PERNTH 198w MONTH* 2005 MURANO 2005 EXPEDITION S~saS^ *-' ^^^iriaaa~ff^~ifA^^^^^fei- A' ; frin Ei'tU~'~B- *n $15,350 ODOWN 260 "MONTH" 16,925 DOWNN PER 287 MONTH* $21 975 o0 DOWN $37 PER 7/3 MONTH* $20,925 $ODOWN $555 PER $35.5 MONTH* 2006 MAXIMA' )2006 TAURUS '2005 LESABRE SAVE '8,000 2005 NEON j *._ -:--" 2005 FOCUS 2005 SENTRA 2005 COROLLA 2005 ESCAPE 8,1975 $9,250 $9,925 10,5345- $141825 DOWN 152PERTH DOWN 157MONTH' 0 DOWN 0168 MONTH' 0 DOWN 175MONTH' DOWN D MONTH' A 0 DO.NPER7 252PER $ MONTH* 2005 CROWN VICTORIA A l " J^- --!' 5+_:_ t+ w W $12,925 2005 SEBRING S11,425 2005 GRAND CARAVAN $14,750O 2005 GRAND CHEROKE 2005 ESCALADE $18,275 331,875 O0 DOWN M219ONTH' $0DON 194MONTH* M OTH DOWN 250 MONTH O"o*310,MONTH' OoWN $575 fPER $35 MONTH* AFFILIATED STORES ..Atlantic Infiniti CHESTERFIELD CAPITOL HUGGNS : DODGE O CA LINCOLN rA DENBIGH OCALA Mercury C OCALA STOYOTA NISSAN MIYUNDAI MITSUBISHI 4" : EVENT SPONSOR . cCALANISSAN 7.1 02200 SR 200 OCALA (352)622-4111 (800)342-3008 1 P INVENTORY SUBJECT TO AVAILABILITY. PICTURES FOR ILLUSTRATION ONLY. ALL PRICES WITH '1,000 CASH OR TRADE EQUITY PLUS TAX, TAG & '195 DEALER FEE. PAYMENTS FOR 6 YEARS. 07.50% APR, WITH APPROVED CREDIT. GOOD DAY OF PUBLICATION. /.rI ,,/lF rn T CT M rTnwrrr.r i LOWER THAN YOU'D EXPECT TO PAY,,,.. "Air CITRUS COUNTY (FL) CHRONICLE J UXP FRIDY, NLARCHa, ZU AM P 10 .'t '~ k : ,. L cX~~-- -* ,,~~*~:''~~'~~___ '05 FORD MUSTANG 60 K les,1 PT CondoningCruse, R '01 ACURA INTEGRA Red & Loaded! Much Much More Very Clean, Sliver MUST SEE $9,995 -10.995 '02 BUICK RENDEZVOUS CX Fully Loaded, Leather, Wood Grain Trim A1 1 .788 '04 CHEVY VENTURE Power Windows & Locks, Cruise, Auto, Alloys s1 1,788 '02 ISUZU TROOPER All Power Equipment, CD, Cruise, Alloys, Tow Pkg *1 1- .988 Special 8 YR/100K Miles Certified Warranty 8 YR/100K Miles Certified Warranty Only 20,000 - '99 MAZDA MIATA '04 MAZDA B3000 '04 FORD RANGER EDGE 4 MAZDA RX8 GT 05CHRYSLER SEBRING LX A 4 D 0Automatic, Leather, 18" Wheels,- Power Windows & Locks, CID, '02 WRANGLER SAHARA Power Windows & Locks, CD, DUAL SPORT Reg Cab, Low Miles, Automatic Sunroof, Power eats, Power '2 WRANGLER SAHARA Alloys, Extra Clean One Owner, V6, Automatic Extra Clean Locks, Keyless Entry, Spoiler Alloys, Cruise 1S 1,995 1 2,499 $1 2M900 A MUST SEE!! *13,788 MUST SEE 16K V6 Gas Saver 18K Miles ,,. . . . ........z '04 HYUNDAI TIBURON GT TOWN A C NTR Leather, Sunroof, Alloys, CD '05 PONTIAC VIBE '05 NISSAN ALTIMA 2.5 '05 TOWN & COUNTRY EX '04 HONDA ELEMENT EX '05 PT CRUISER Changer, Power Windows & Locks, Power Windows & Locks, Power Windows & Locks, CD, Cruise All Power Equipment, Power Power Windows & Locks, CD, Only 10,000 Miles, Silver Cruise, Spoiler, Autostlck CD, Cruise, Auto Auto, X-Clean, Keyless Entry Sliding Door Cruise. Auto, 4 Cyl., Alloys *$13,988 14J0,888 -15,777 *1 ,791 18,988 18,991 9,000 4WD Tow PKG Ext. Cab M1K '05 JEEP LIBERTY '05 HONDA ACCORD LX '04 DODGE DAKOTA SLT TOYOTA TUNDRA LTD "05 RX8 05 MADA MIATA RENEGADE0003 TOYOTA TUNDRA LTD "05 RX8 105 MAZDA MIATA Power Windows & Locks, CD, Cruise, Power Windows & Locks, CD, Quad.Cab, Bedliner, CD, Power Leather, Power Everything, CD, MAZDA Certified Auto, Power Windows & Locks, Auto, Moonroof, Alloys, Tow PKG Cruise, Auto, Keyless Entry Windows & Locks, Leather, Cruise Cass., Tow PKG, Bedllner CD, Cruise, Alloys, Keyless Entry $20.449 MUST SEE $20 999 ,22,377 $22,988 A MUST SEE!! Moonroof Leather 4K 9K Balance of 4YR/50K Mile Warranty 1200 Miles Miles Miles .'0 '05 MERCURY SABLE LS '05 TOYOTA AVALON '04 CADILLAC DEVILLE '05 BMW Z-4 CONVERTIBLE 02 MERCURY MOUNTAINEERP s, BUICK LACROSSE CXL Imatlon. Cony., Chrome Wheels, Power Local02 MERCURY MOUNTAINEER Power Windows & Locks, CD, Cruise, '06 BUICK LACROSSE CXL Leather, Loaded With All Windows, Locks & Seats, CD, Leather, One Owner, Local Trade, Red with Loca Trade, Very Clean Alloys, Moonroof & Leather Fully Loaded,. A Must See the Bells and Wistles! cruise, OnStar Black Top, Superb Luxury *13,995 0 16,988 022,774 MUST SEE! *24,755 *38,900 CERTIFIED 8 YEARS OR 100,000 MILES LIMITED WARRANTY NO DEDUCTIBLE FOR COVERED REPAIRS NO CHARGE TO SUBSEQUENT OWNERS FOR GREATER RESALE VALUE ROADSIDE ASSISTANCE FOR THE DURATION OF THE WARRANTY 9 Pre-Owned AT NO ADDED COSTI ALL VEHICLES MUST PASS A 100 POINT INSPECTION IN ORDER TO QUALIFY 2001 -2006 ONLY PRE-OWNED MAZDAS. PICTURES FOR ILLUSTRATION PURPOSES ONLY ESPANOUA i ionlPz..... MARCR :lv 2006) 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/00427 | CC-MAIN-2018-22 | refinedweb | 82,404 | 78.85 |
Using Java Libraries
Let's take a look at a more complicated example: a simple Swing application.
import javax.swing.JFrame import javax.swing.JButton class SwingMirah def initialize(title:String, w:int, h:int) @title = title @width = w @height = h end def run frame = JFrame.new @title frame.setSize @width, @height button = JButton.new "Press me" frame.add button button.addActionListener do |event| JButton(event.getSource).setText "Mirah rocks!" end frame.setVisible true end end sm = SwingMirah.new("Welcome!", 300, 200) sm.run
Here we have a class definition and code that consumes that class. As in Java, if the superclass is omitted we assume it's Object. Classes are public by default, and you use the less-than symbol to indicate extension (not shown here, but it looks like class Foo < Bar).
Constructors are named initialize (Note: we may change this to the class name, as in Java, for obvious reasons). You can overload constructors and methods just as you can in Java.
Java fields are indicated with a leading @ sigil. This makes it nearly impossible to accidentally use a local variable instead of a field or vice versa. Unlike Java, their type is inferred from usage, so the @title field here will be of type String, and @height and @width will be int fields.
Inside the Run method, the types of frame and button are inferred from context as JFrame and JButton, respectively. Rather than all the usual noise of an inner class (even an anonymous one), we just provide a block of code and Mirah uses it to implement ActionListener. The type of the event variable is inferred from the interface we're implementing, and doesn't need to be declared. Notice also the JButton(event.getSource) code. This is Mirah's casting syntax, casting the event source back into a JButton reference.
Finally, we construct a new SwingMirah object by calling new on the class (indicating a Java constructor call), and then run the application.
Pretty slick, no?
Performance
Let's look at an example of Mirah's performance compared to Java. We'll use fibonacci; it's the canonical "dumb benchmark," but it does demonstrate two things well: method call performance and integer math performance — which are both difficult to optimize in dynamic languages.
def fib(a:int):int if a < 2 a else fib(a - 1) + fib(a - 2) end end def bench(n:int) n.times do timeStart = System.currentTimeMillis puts "fib(40): #{fib(40)}\nTotal time: #{System.currentTimeMillis - timeStart}" end end bench 3
There's a lot happening here. First of all, you can see that the fib method declares its a parameter as being an int. Mirah supports both reference types (Object and its descendants, basically) and Java's primitive types (short, byte, int, and so on). This guarantees that code written in Mirah will perform the way you expect, since we build everything with Java's types and libraries. The fib method also declares that it returns int because, in recursive methods, we can't infer the method's return type.
The bench method show us one of Mirah's language-level features: a virtual times method on int. In Java, primitive types can't be dereferenced (i.e. you can't do 1.something()) and have no methods of their own. Mirah extends the primitive types to have a few useful features like times and upto. Here we run the benchmark n times, providing a block of code to execute.
(Note: Although we haven't time to cover it in this article, Mirah has a very powerful macro subsystem, allowing you to decorate any type with "virtual" methods similar to 1.times. Adding methods to primitives...how's that for extensible?)
Inside the code block, we call System.currentTimeMillis and assign the result to the timeStart variable. Mirah considers method-call parentheses optional unless ambiguous, and we are inferring the type of timeStart (long)^, so there's no need to declare it.
Finally we call fib(40) and print out the result using an interpolated string. So how does it perform compared to Java?
~/projects/mirah_play → java FibJava fib(40): 102334155 Total time: 883 fib(40): 102334155 Total time: 876 fib(40): 102334155 Total time: 875 ~/projects/mirah_play → mirah fib.mirah fib(40): 102334155 Total time: 882 fib(40): 102334155 Total time: 876 fib(40): 102334155 Total time: 878
The performance of Mirah is essentially identical to that of Java. And this extends to every program you'll write in Mirah.
More Features from Java
Let's take a step back and look at a few more mundane Java features. First, there's interface definition:
import java.util.List interface Printer do def printAll(a:List) returns void end end
We can implement this interface similar to Java, using the implements keyword. However in Mirah, implements comes inside the body of the class.
class MyPrinter implements Printer def printAll(a) a.each {|element| puts element} end end list = ['foo', 'bar', 'baz'] p = Printer(MyPrinter.new) p.printAll(list)
Because there's only one printAll method on the interface, we can infer the type of the a variable. We narrow our p variable declaration to the Printer type using casting syntax (though it works fine with out it; I'm just being illustrative here). To declare a variable of a specific type but with a null reference, we'd use the same syntax:
p = Printer(nil) # or null; nil and null are interchangable
Primitive arrays from Java are allocated by simply using array notation on a type. Here we allocate arrays of int and String:
str_ary = String[5] int_ary = int[5]
Literal lists and maps are represented using [] and {} syntax
list = [1,2,3,4] list.each {|x| puts x} # prints "1\n2\n3\n4\n" map = {'foo' => 'bar'} puts map['foo'] # prints "bar"
And you have probably figured out that comments are indicated by the # character. They can come anywhere in a line, and everything following them in that line will be ignored.
Status and Future
Mirah is still under development, but there are production users already. It's helpful to think of Mirah in terms of Java compatibility. Right now, Mirah is roughly like a Java 0.9 with a few bonuses. There are no generics or enums, minimal annotation support, and mostly basic language features in place...but you have some support for closures, more literals, local type inference, and so on. We're pushing steadily toward a 1.0 release of Mirah that's at least on par with Java 5. We'll also continue improving Mirah's macro system and meta-programming capabilities, while carefully stealing the coolest features from other modern languages.
If you'd like more information about Mirah, visit the Mirah homepage, join the mailing list mentioned there, and check out Mirah's implementation yourself on Github. You can also browse the Mirah organization, where you'll find projects like Dubious (a Mirah web framework for Google AppEngine) and Pindah (a framework for building Android apps in Mirah). | http://www.drdobbs.com/web-development/language-of-the-month-mirah/229400307?pgno=2 | CC-MAIN-2016-07 | refinedweb | 1,177 | 57.27 |
On Thu, 13 Mar 2003 13:00:56 +0000 (UTC), Simo Salminen <simo_salminen at iki.fi> wrote: >I've played with VIM lately, and stumbled to problems with its >python indenting. I really like the emacs-python mode of indenting >stuff inside parenthesis, like this: > >(emacs session) >if (cond and<enter> > <- cursor moves here > >now, the same code in VIM: > >if (cond and<enter> ><- cursor moves here > >Now I have to manually indent, but then there is another problem: > >if (cond and > cond):<enter> > <- VIM indents two times! > > >Has anyone else stumbled to these problems, and maybe even have >patched indent/python.vim available (*wishful thinking*) ? Hmm... That's an editor configuration problem. You may want to report it to developer (bugs at vim dot org), you may have better luck than I did sometime ago. BTW, you may want to pose this question in the vim users mailing list, a more appropriate forum, I'd believe. Check. In the meantime you might want to use the following ftplugin (for the benefit os those who only search c.l.p.'s archive): ---begin python_pep8.vim if exists("did_python_pep8") finish else let did_python_pep8=1 endif set shiftwidth=4 set tabstop=4 set softtabstop=4 set expandtab set textwidth=80 ---end python_pep8.vim -- Alejandro Lopez-Valencia tora no shinden python -c "print('ZHJhZHVsQDAwN211bmRvLmNvbQ=='.decode('base64'))" | https://mail.python.org/pipermail/python-list/2003-March/215398.html | CC-MAIN-2014-15 | refinedweb | 223 | 63.39 |
One of Podman’s most exciting new features is rootless containers. Rootless allows almost any container to be run as a normal user, with no elevated privileges, and major security benefits. However, running containers without root privileges does come with limitations.
A user asked a question about one of these: Why couldn’t they pull a specific image with rootless Podman?
Their image was throwing errors after downloading, like the one below:
ERRO[0005] Error pulling image ref //testimg:latest: Error committing the finished image: error adding layer with blob "sha256:caed8f108bf6721dc2709407ecad964c83a31c8008a6a21826aa4ab995df5502": Error processing tar file(exit status 1): there might not be enough IDs available in the namespace (requested 4000000:4000000 for /testfile): lchown /testfile: invalid argument
I explained that their problem was that their image had files owned by UIDs over 65536. Due to that issue, the image would not fit into rootless Podman’s default UID mapping, which limits the number of UIDs and GIDs available.
The follow-on questions were, naturally:
- Why does that limitation exist?
- Why can’t you use any image that works on normal Podman in rootless mode?
- Why do the exact UIDs and GIDs in use matter?
I’ll start by explaining why we need to use different UIDs and GIDs than the host, and then explain why the default is 65536—and how to change this number.
Mapping the user namespace
Rootless containers run inside of a user namespace, which is a way of mapping the host’s users and groups into the container. By default, we map the user that launched Podman as UID/GID 0 in rootless containers.
On my system, my user (
mheon) is UID 1000. When I launch a rootless container as
mheon with
podman run -t -i --rm fedora bash, and then run
top inside the container, I appear to be UID 0—root.
However, on the host, the
bash process is still owned by my user. You can see this result when I run
podman top on my host system:
mheon@Agincourt code/podman.io (release_blog_1.5.0)$ podman top -l user group huser hgroup USER GROUP HUSER HGROUP root root 1000 1000
The
USER and
GROUP options are the user and group as they appear in the container, while the
HUSER and
HGROUP options are the user and group as they appear on the host.
Let’s show a simple example. I’ll mount
/etc/, which is full of files owned by root, into a rootless container. Then I’ll show its contents with
ls:
mheon@Agincourt code/libpod (master)$ podman run -t -i -v /etc/:/testdir --rm fedora sh -c 'ls -l /testdir 2> /dev/null | head -n 10' total 1700 -rw-r--r--. 1 nobody nobody 4664 May 3 14:39 DIR_COLORS -rw-r--r--. 1 nobody nobody 5342 May 3 14:39 DIR_COLORS.256color
I have no permission to change these files, despite the fact that I’m root in the container. I can’t even see many of them: Note the
2> /dev/null after
ls to squash errors because I get many permission errors even trying to list them.
On the host, these files are owned by root, UID 0—but in the container, they’re owned by
nobody. That’s a special name the Linux kernel uses to say the user that actually owns the files isn’t present in the user namespace. UID and GID 0 on the host aren’t mapped into the container, so instead of files being owned by
0:0, they’re owned by
nobody:nobody from the container’s perspective.
No matter what user you may appear to be in a rootless container, you’re still acting as your own user, and you can only access files that your user on the host can access. This setup is a large part of the security appeal of rootless containers—even if an attacker can break out of a container, they are still confined to a non-root user account.
Allocating additional UIDs/GIDs
I said earlier that a user namespace maps users on the host into users in the container, and described a bit of how that process works for root in the container. But containers generally have users other than just root—meaning that Podman needs to map in extra UIDs to allow users one and above to exist in the container.
In other words, any user required by the container has to be mapped in. This issue caused the original error above because the image used a UID/GID that was not defined in its user namespace.
The
newuidmap and
newgidmap executables, usually provided by the
shadow-utils or
uidmap packages, are used to map these UIDs and GIDs into the container’s user namespace. These tools read the mappings defined in
/etc/subuid and
/etc/subgid and use them to create user namespaces in the container. These
setuid binaries use added privileges to give our rootless containers access to extra UIDs and GIDs—something which we normally don’t have permission for. Every user running rootless Podman must have an entry in these files if they need to run containers with more than one UID. Each container uses all of the UIDs available by default, though the exact mappings can be adjusted with
--uidmap and
--gidmap.
A normal, non-root user in Linux usually only has access to their own user—one UID. Using the extra UIDs and GIDs in a rootless container lets you act as a different user, something that normally requires root privileges (or logging in as that other user with their password). The mapping executables
newuidmap and
newgidmap use their elevated privileges to grant us access to extra UIDs and GIDs according to the mappings configured in
/etc/subuid and
/etc/subgid without being root or having permission to log in as the users.
Every user running rootless Podman must have an entry in these files if they need to run containers with more than one UID inside them.
Changing the default number of IDs
Now, on to the issue of the default number of UIDs and GIDs available in a container: 65536. This number is not a hard limit, and can be adjusted up or down using the aforementioned
/etc/subuid and
/etc/subgid files.
For example, on my system:
mheon@Agincourt code/libpod (master)$ cat /etc/subuid mheon:100000:65536
This file is formatted as
<username>:<start_uid>:<size>, where
start_uid is the first UID or GID available to the user, and
size is the number of UIDs/GIDs available (beginning from
start_uid, and ending at
start_uid + size - 1).
If I were to replace that 65536 with, say, 123456, I’d have 123456 UIDs available inside my rootless containers.
"Why choose 65536 for the default?" is a question for the maintainers of the Linux user creation tool,
useradd, as the initial defaults are populated when a user is created, and not by Podman. However, I’ll hazard a guess that this setting is enough to keep most applications functioning without changes (very old Linux versions only had 16-bit UIDs/GIDs, and higher values are still somewhat uncommon).
Note: The
/etc/subuid and
/etc/subgid files are for adjusting users that already exist. Defaults for new users are adjusted elsewhere.
The 65536 default that new users receive is not hard-coded. However, This will not affect existing users. It is set in the
/etc/login.defs file, with the
SUB_UID_COUNT and
SUB_GID_COUNT options. We’ve actually had discussions on moving the default lower, since it feels like most containers will probably function fine with a little over 1000 UIDs/GIDs, and any more after that are wasted.
The important thing is that this value represents a tract of UIDs/GIDs allocated on the host that are available for one specific user to run rootless containers. If I were to add another user to this system, they’d get another tract of UIDs, probably starting at 165536, again 65536 wide by default.
Root has permissions to change these limits, but normal users don't. Otherwise, I could change the mapping a bit to
mheon:0:65536 and map the real root user on the system into my rootless containers, which can then easily be pivoted into system-wide root access.
Preventing UID and GID overlap
As a general rule for security, avoid letting any system UIDs/GIDs (usually numbered under 1000), and ideally any UID/GID in use on the host system, into a container. This practice prevents users from having access to system files on the host when they create rootless containers.
We also want each user to have a unique range of UIDs/GIDs relative to other users—I could add a user
alice to my
/etc/subuid with the exact same mapping as my user (
alice:100000:65536), but then Alice would have access to my rootless containers, and I to hers.
It’s possible to increase the size of your user’s allocation, as discussed earlier, but you need to follow these rules for security. I’ll list them again:
- No UID/GID under 1000.
- No UID or GID goes into the container if it’s in use on the host.
- Don’t overlap mappings between users.
The last one is the primary reason that we don’t want to map in higher UID and GID allocations. We could potentially give one user a massive range, including everything from 100,000 up to
UID_MAX, and make a little over 4.2 million UIDs available—but then there’d be none left for other users.
Wrapping up
With Podman 1.5.0 and higher, we’ve added a new, experimental option (
--storage-opt ignore_chown_errors) to squash all UIDs and GIDs down, thus running containers as a single user (the user that launched the container). This setting solves the article’s initial problem, but it does place a set of additional restrictions on the container—details on that are best left to a different article.
The UID and GID restrictions placed on rootless containers can be inconvenient, but you’ll rarely run into them. Most images and containers use far fewer than the 65536 UIDs and GIDs available. These limitations are some of the tradeoffs of rootless containers, where we sacrifice some convenience and usability for major improvements in security. | https://www.redhat.com/sysadmin/rootless-podman | CC-MAIN-2021-43 | refinedweb | 1,726 | 58.42 |
cephire wrote: > Hi: > If you mean am I closing all the forms, yes. Here is the code snippet > of both program.py and the form's exit menu item. > Please note that I also tried self.Close and still it didn't exit from > the memory. Thank you for your > > > Program.py > ========= > > class mysecs10: # namespace > > @staticmethod > def RealEntryPoint(): > > Application.EnableVisualStyles() > Application.Run(mysecs20.MainForm()) > > if __name__ == "Program": > mysecs10.RealEntryPoint(); > > > mainform. exit > =========== > > @accepts(Self(), System.Object, System.EventArgs) > @returns(None) > def _exitToolStripMenuItem_Click(self, sender, e): > Application.Exit() > > > > On Sep 2, 1:36 am, Michael Foord <fuzzy... at voidspace.org.uk> wrote: > >> cephire wrote: >> >>> Hi all, >>> I've found out that the application is still in memory even after >>> closing the application. I exit the application with >>> Application.Exit(). >>> >>> What should I do to remove the application completely? >>> >> Which version of IronPython are you using? >> >> Have you deleted all references to the form (I assume it is a Windows >> Forms application)? >> >> Michael >> >> >>> Thank you, >>> Joseph >>> _______________________________________________ >>> Users mailing list >>> Us... at lists.ironpython.com >>> >>> >> -- >> >> _______________________________________________ >> Users mailing list >> Us... at lists.ironpython.com >> > _______________________________________________ > Users mailing list > Users at lists.ironpython.com > > -- | http://mail.python.org/pipermail/ironpython-users/2008-September/008280.html | CC-MAIN-2013-20 | refinedweb | 190 | 54.29 |
Difference between hashmap and hashtable
In this post, you will learn the difference between hashmap and hashtable using the Java programming language. Such a type of question is frequently asked in an interview or test.
Java Hashmap
Java HashMap class implements the Map interface, which allows us to store key and value pairs where keys should be unique. HashMap in Java is like the legacy Hashtable class, but it is not synchronized. It allows us to store the null elements as well, but there should be only one null key. The HashMap is non synchronised and not thread safe. For non-threaded applications, HashMap should be preferred over Hashtable
Java Hashtable
Hashtable is synchronized. It is thread-safe. The Hashtable class implements a hash table, which maps keys to values. Hashtable doesn't allow any null key or value. The hashtable is synchronized, which means the hashtable is thread-safe and can be shared between multiple threads.
Difference between hashmap and hashtable
There are many differences between hashmap and hashtable. Here, we have mentioned most of them-
Example of Java HashMap
Output of the above code:Output of the above code:
// Import the HashMap class import java.util.HashMap; public class Main { public static void main(String[] args) { // Create a HashMap object called animal HashMap<String, Integer> animal = new HashMap<String, Integer>(); // Add keys and values (Name, Age) animal.put("Dog", 10); animal.put("Cat", 20); animal.put("Fish", 30); for (String i : animal.keySet()) { System.out.println("key: " + i + ", value: " + animal.get(i)); } } }
key: Cat, value: 20 key: Fish, value: 30 key: Dog, value: 10
Example of Java Hashtable
Output of the above code:Output of the above code:
import java.util.*; public class Hashtable1{ public static void main(String args[]){ Hashtable<Integer,String> people = new Hashtable<Integer,String>(); people.put(101,"Smith"); people.put(102,"Andy"); people.put(103,"Gaga"); people.put(104,"Michel"); for(Map.Entry m:people.entrySet()){ System.out.println(m.getKey()+" "+m.getValue()); } } }
104 Michel 103 Gaga 102 Andy 101 Smith | https://etutorialspoint.com/index.php/790-difference-between-hashmap-and-hashtable | CC-MAIN-2022-33 | refinedweb | 337 | 66.03 |
asp:feature
Languages: VB
Technologies: ADO.NET | Datasets | Web Services | Data Mapping
Manage Web Services With Data Mapping
Use ADO.NET's mapping classes to streamline the interaction between your Web Services and databases.
By Fabio Claudio Ferracchiati
ADO.NET includes a new set of classes, the mapping classes, which were added to the .NET Framework library to manage the interaction between Web Services and databases. You might find the mapping classes useful, however, anytime you need to deal with foreign databases or strange column names. When you define a mapping mechanism in your code using the mapping classes, you map the database column names to the dataset column names.
The ADO.NET Mapping Mechanism
The code in FIGURE 1 is fairly typical code you might use to retrieve records from a table into a dataset using a DataAd("fn") &
"
")
Response.Write("Last
Name: " & r("ln") & "
")
Response.Write("City: " & r("cty") &
"
")
Catch ex As Exception
' An exception occurred. Display the error
' message.
Response.Write(ex.Message)
End Try
End Sub
FIGURE 1: This code retrieves the first name, last name, and city of every user in the tabUser table.
When the code in FIGURE 1 uses the Fill method provided by the DataAdapter class, the mapping mechanism is executed automatically. The method looks into the TableMappings collection searching for one or more mapped tables to use. When no table mappings classes have been added to the collection, the code uses the names of the default tables and columns specified in the SQL query statement. In FIGURE 1, when the code enters the loop used to display each record in the table, the default column names retrieve the respective column values.
The column names used in the tabUser table are difficult to remember. This might be a good candidate for using the mapping classes.
Here are the basic steps involved in using the mapping mechanism:
- Import the System.Data.Common namespace.
- Create a DataColumnMapping object for each column you wish to map.
- Create a DataTableMapping object for each table.
- Add the DataColumnMapping objects to the DataTableMapping object's ColumnMapping collection.
- Add the DataTableMapping objects to the DataAdapter object's TableMappings collection.
If you follow these five simple rules, you can see in FIGURE 2 how easy it is to change the strange column names to more readable")
' Create each column to map database columns
' to dataset columns
Dim dcmFirstName As New DataColumnMapping("fn", _
Dim dcmLastName As New DataColumnMapping("ln", _
Dim dcmCity As New DataColumnMapping("cty", "City")
' Create a TableMapping object to contain
' the mapped columns
Dim dtmUser As New DataTableMapping("Table", _
"tabUser")
' Add the mapped columns to the ColumnMappings
' collection of the DataTableMapping object
dtmUser.ColumnMappings.Add(dcmFirstName)
dtmUser.ColumnMappings.Add(dcmLastName)
dtmUser.ColumnMappings.Add(dcmCity)
' Add the mapped table object into
' the TableMappings collection
' provided by the DataAdapter object.
daUsers.TableMappings.Add(dtmUser)
'("FirstName") & _
"
")
Response.Write("Last Name: " & r("LastName") & _
"
")
Response.Write("City: " & r("City") &
"
")
Catch ex As Exception
' An exception occurred. Display the error
' message.
Response.Write(ex.Message)
End Try
End Sub
FIGURE 2: The columns have more readable names using the mapping classes.
FIGURE 2 shows you how to provide the DataColumnMapping constructor with the correct parameters to map the database column's name to the dataset's. Then it shows how you can create a DataTableMapping object using its constructor to inform the DataAdapter class about the source table name and the dataset mapped table name. Note that when you use the Fill method without specifying the source table parameter, the Table default name is used. Finally, after adding each mapped column into the ColumnMappings collection, it shows how you can add the object to the TableMappings collection exposed by the DataAdapter object.
Once the mapping mechanism has been defined and assigned to the DataAdapter object, you can accomplish every database operation - such as queries and record management - using the mapped columns and tables. For example, the code in FIGURE 3 adds a record to the database using the mapped column names.
' Add a new row to the table
Dim r As DataRow
r = dsUsers.Tables(0).NewRow()
r("FirstName") = "Fabio Claudio"
r("LastName") = "Ferracchiati"
r("City") = "Rome"
dsUsers.Tables(0).Rows.Add(r)
' Automatically define the SQL INSERT
' command
Dim cb As New SqlCommandBuilder(daUsers)
' Update the database with the new row
daUsers.Update(dsUsers.GetChanges(DataRowState.Added))
' Update the dataset confirming the addition
dsUsers.AcceptChanges()
FIGURE 3: Once you've defined the mapped column names, you can add new rows to the database easily.
Combine Mapping With Web Services
As I mentioned previously, the mapping classes are most useful when used in conjunction with data provided by Web Services. When consuming data from a Web Service, you won't have control over the names of columns used in the service, which might cause problems in your client application. This makes a great case for using the mapping classes.
The X Methods Web site () is an online Web Service repository. It contains the SearchMusicTeacher Web Service, which uses the FindMusicTeachers() method to retrieve a list of musical teachers in a particular U.S. city specified by ZIP code. The method will return a string containing the dataset's structure with the results of the required city. In FIGURE 4, you can see a snippet of a search result for a fictional ZIP code.
NANA
. . .
. . .
FIGURE 4: A portion of the music teachers in ZIP Code 55555, returned by the SearchMusicTeacher Web Service.
The Web Service returns a dataset formed by two tables: the Summary and Details tables. The former will contain some of the required parameters such as the ZIP code, the instruments of expertise, and so forth with the addition of the total count of the records contained in the ResultsCount tag. The latter will include the teacher data, including name, address, and phone number.
Let's say you have a "Musical Institute" Web site that offers a "find a teacher" search service that points to your local data store. In FIGURE 5, you can see the table's structure that maintains the music teacher data.
FIGURE 5: Here is the tabTeacher local database table's structure.
<%@ Import Namespace="System.Data" %>
<%@ Import Namespace="System.Data.Common" %>
<%@ Import Namespace="System.Data.SqlClient" %>
<%@ Import Namespace="System.IO" %> daTeachers As New SqlDataAdapter( _
"SELECT * FROM tabTeacher", dbConn)
' Create each column to map database columns
' to dataset columns
Dim dcmFullName As New _
DataColumnMapping("FullName", "Name")
Dim dcmAddress As New _
DataColumnMapping("StreetAddress", "Address")
Dim dcmPhone As New _
DataColumnMapping("PhoneNumber", "Phone")
Dim dcmEmail As New _
DataColumnMapping("Email", "Email")
Dim dcmType As New _
DataColumnMapping("Type", "Type")
Dim dcmInstruments As New _
DataColumnMapping("Instruments", "Teaches")
Dim dcmGenre As New _
DataColumnMapping("Genre", "Style")
Dim dcmHowMuch As New _
DataColumnMapping("HowMuch", "Rates")
' Create a TableMapping object to contain
' the mapped columns
Dim dtmTeacher As New _
DataTableMapping("Table", "Details")
' Add the mapped columns to the ColumnMappings
' collection of the DataTableMapping object
dtmTeacher.ColumnMappings.Add(dcmFullName)
dtmTeacher.ColumnMappings.Add(dcmAddress)
dtmTeacher.ColumnMappings.Add(dcmPhone)
dtmTeacher.ColumnMappings.Add(dcmEmail)
dtmTeacher.ColumnMappings.Add(dcmType)
dtmTeacher.ColumnMappings.Add(dcmInstruments)
dtmTeacher.ColumnMappings.Add(dcmGenre)
dtmTeacher.ColumnMappings.Add(dcmHowMuch)
' Add the mapped table object into
' the TAbleMappings collection
' provided by the DataAdapter object.
daTeachers.MissingMappingAction = _
MissingMappingAction.Error
daTeachers.TableMappings.Add(dtmTeacher)
' Create the object to use the Web Service
Dim teacher As New _
net.perfectxml.
' Retrieve the music teacher for Los Angeles
' providing the ZIP code. The method returns
' a string representing a DataSet object filled
' with the query result.
Dim strDataSet As String
strDataSet = teacher.FindMusicTeachers2( _
"90020", "0", "0", "0", 0, 10)
' Fill a StringReader object with the resulting string
Dim xmlStream As New StringReader(strDataSet)
' Fill a DataSet object using the records
' retrieved from the Web Service
Dim dsTeachers As New DataSet("Teachers")
dsTeachers.ReadXml(xmlStream, XmlReadMode.InferSchema)
' Automatically define the SQL INSERT
' command
Dim cb As New SqlCommandBuilder(daTeachers)
' Update the database using the dataset retrieved
' from the Web Service. The Update method will use
' the mapping mechanism to bind to the right columns
' in the database's tabTeacher table.
daTeachers.Update(dsTeachers.Tables("Details"))
Catch ex As Exception
' An exception occurred. Display the error
' message.
Response.Write(ex.Message)
End Try
End Sub
FIGURE 6: This is the code to insert the Web Service's data into your local database using the mapping classes.
The code in FIGURE 6 begins by defining an object for each column to map to the Web Service's provided dataset. Then you must create a DataTableMapping object that points to the correct table within the source DataSet object. Next, the code informs the mapping classes used by the DataAdapter object to map the columns to the Details table of the dataset.
These mapping classes are used by the DataAdapter object when the Update method is invoked in the final portion of the code in FIGURE 6.
Fix the Glitches
Imagine that the SearchMusicTeacher Web Service provider decides to add a new column to the resulting DataSet string structure. Then the next time your application is launched an error occurs. The ADO.NET DataAdapter class provides two properties to tell the mapping mechanism what to do when something strange happens. The MissingMappingAction property tells the DataAdapter object what to do when a column in the source dataset is not mapped. FIGURE 7 shows the enumeration values it can assume.
FIGURE 7: This table shows the enumeration values the DataAdapter object can assume when a column in the source dataset is not mapped.
FIGURE 8: This table shows the enumeration values the DataAdapter object can assume when the dataset used by either the Fill or Update methods doesn't contain one or more columns in the schema.
The code in FIGURE 6 uses the MissingMappingAction property, set to Error, in order to raise an exception when the Web Service's resulting dataset changes its structure.
The MissingSchemaAction property tells the DataAdapter what to do when the dataset used by either the Fill() or Update() methods doesn't contain one or more columns in its schema. FIGURE 8 shows the enumeration values it can assume.
In this article you have seen how the mapping classes resolve common issues like the interaction between Web Services and data store when table and column names don't match. In addition, you have seen how the mapping mechanism can be useful when databases have strange column names.
Once you have fully acquired the Mapping mechanism and class functionalities, you'll find them useful and intuitive - especially when you receive data from a Web Service and you want to store its data in your database. By giving more significant names to columns, you create more readable code that helps you during all your code development.
The files referenced in this article are available for download.
Fabio Claudio Ferracchiati is a software developer and technical writer and works in Rome for CPI Progetti Spa () where he develops Internet/intranet solutions using Microsoft technologies. He has worked with Visual Basic and Visual C++ and now dedicates his attention to the Internet and related technologies. He's also co-author of four books from Wrox Press: Professional Commerce Server 2000, ADO.NET Programmer's Reference, Professional ADO.NET Programming, and Data-centric .NET Programming with C#. E-mail Fabio at mailto:[email protected].
Tell us what you think! Please send any comments about this article to [email protected]. Please include the article title and author. | http://www.itprotoday.com/web-development/manage-web-services-data-mapping | CC-MAIN-2018-09 | refinedweb | 1,908 | 54.02 |
Aggressive MSBuild - Bypass Detection
It’s no secret that Casey Smith’s research into bypasses has changed how nearly everyone in the industry approaches testing and circumventing application whitelisting solutions. You could argue that one of his more prolific findings is how to abuse MSBuild’s inline tasks as a method of executing code. We at FortyNorth Security commonly face application whitelisting solutions in hardened environments and have used MSBuild, amongst other candidates, to circumvent their protection.
Due to commonly encountering the need for an application whitelisting bypass (and its effectiveness even on systems without application whitelisting solutions) we decided to automate using MSBuild, specifically in this case to run PowerShell namespaces via MSBuild (thanks @djhohnstein for the edit), based off a script from Chris Ross (@xorrior). Our choice was to use Aggressor since Cobalt Strike is a platform we commonly use for our assessments. We wanted our script to be able to do the following:
- Run a single PowerShell command via MSBuild
- Execute a function within a PowerShell script via MSBuild
- Perform either of the above both locally or remotely
This blog post will quickly cover some of the key points of how we completed this task and ended up with four additional commands registered within Beacon. You can review both scripts within our Github repo Aggressor Assessor here (there’s also an alternative version to accomplish the same overall goal within @MrUn1k0d3r’s Github Repo here, written by @ramen0x3f). Once you load either script from the AggressorAssessor repo into Cobalt Strike, you will have new commands available in the help menu when you type “help”. These new options are shown below with their own help menu.
How Do You Use These MSBuild Scripts?
If we wanted to use MSBuild to run the cmdlet “Get-Process”, you just need to type “msbuild_cmd Get-Process”. Since you are running this on the local host, you will also get the output from this command.
The same concept extends to running a PowerShell script on the same system via MSBuild. The only difference is that you are providing the path to the PowerShell script you want to run (on your local system) and the PowerShell cmdlet you are running.
Finally, how about the ability to do all of this, but remotely? The good thing is: it’s essentially the same steps (different Beacon commands – remote_msbuild_cmd and remote_msbuild_script). The only difference is that you need to provide the IP address or hostname of the system you are targeting. For example, the command below demonstrates running “Get-Process” remotely on a system and storing the output on disk.
How Do The Scripts Work?
These scripts largely operate the same way. They all use the XML file from Chris Ross and modify its contents to be able to run the command, or script, that we are trying to run. The general process is as follows:
- The XML file is built locally on the attacker’s system, and then uploaded to the victim system to C:\Users\Public\Documents\trusteddata.xml
- MSBuild.exe is copied from its original location into C:\Users\Public\Documents\svchost.exe via PowerPick
- PowerPick then runs the copied and renamed MSBuild and instructs it to interpret the trusteddata.xml file
- After execution, PowerPick then removes the trusteddata.xml and svchost.exe files
The primary difference between the local execution and the remote execution is the manner in which MSBuild is run. For remote execution, the “trusteddata.xml” is uploaded to the remote system via a UNC path and then MSBuild is triggered to run via WMI. Outside of these differences, it’s largely the same.
You can check out the Aggressor code right here. We hope that this helps explain how these scripts work. If you have any questions at all, don’t hesitate to Contact Us and we’ll be happy to answer.
If you are interested in additional application whitelisting bypass techniques, be sure to register for our free webinar on the topic. Additionally, this is the type of material we will be covering in our BlackHat USA class, amongst much more information. Click here to learn about what we will be teaching, and we hope to see you in Las Vegas! | https://fortynorthsecurity.com/blog/aggressive-msbuild-bypass-detection/ | CC-MAIN-2021-04 | refinedweb | 703 | 60.85 |
Output of C++ programs | Set 35
1. What will be the output of following program?
Options
A) Compile error
B) Hi
C) HelloHi
D) Hello
Answer : A
Explanation: Compile error, keyword break can appear only within loop/switch statement.
2. What will be the output of following program?
Options
A) 10
B) Garbage
C) Runtime error
D) Compile error
Answer : D
Explanation:Class member variables cannot be initialized directly. You can use member function to do such initialization.
3. What will be the output of following program?
‘cin’ is an __
Options
A) Class
B) Object
C) Package
D) Namespace
Answer : B
Explanation: It’s an object of istream class.
4. What will be the output of following program?
Options
A) 6553
B) 6533
C) 6522
D) 12200
Answer : B
Explanation: In this program, we are adding the every element of two arrays. Finally we got output as 6533. Means for first array total sum will be 1200 + 200 + 2300 + 1230 + 1543 = 6473 and for second loop sum will be 12 14 + 16 + 18 = 60 (except 20 because loop is from 0 to 3 index) so result = 6473 + 60 = 6533.
5. Which rule will not affect the friend function?
Options
A) private and protected members of a class cannot be accessed from outside
B) private and protected member can be accessed anywhere
C) both a & b
D) None of the mentioned
Answer : A
Explanation: Friend is used to access private and protected members of a class from outside the same class.
6.What will be the output of following program?
Options
A)8.31416
B)8
C)9
D)compile time error
Answer : B
Explanation: We are getting two variables from namespace variable and we are adding that with the help of scope resolution operator.The values are added to variable “a” which is of type int and thus the output is of type integer.
7.What will be the output of following program?
Options
A) x is greater
B) y is greater
C) Implementation defined
D) Arbitrary
Answer : A
Explanation: x is promoted to unsigned int on comparison. On conversion x has all bits set, making it the bigger one.. | https://www.geeksforgeeks.org/output-c-programs-set-35/?ref=lbp | CC-MAIN-2021-49 | refinedweb | 361 | 62.17 |
Monday, November 21, 2011
The Agile Testing & BDD eXchange 2011
- BDD
- Living Documentation
- Testing
I know what I'll be watching tonight :) (Coffee? (Check), Biscuits? (Check), Slippers? (Check))
Sunday, November 20, 2011
KnockoutJS 1.3 Almost Here
For those of you who are fans of Steve Sanderson’s excellent MVVM (Model View View Model) framework KnockoutJS, you'll be pleased to hear that the release candidate for version 1.3 is now available. There are a number of improvements including better syntax for defining event handling (a popular fix for many people who felt that the current method of event binding was a bit messy).
Check out this blog article by Steve, which talks about the upcoming changes.
Saturday, November 19, 2011
Using MSpec.Fakes–Part 2
Next example I’d like to show is how to force a method to return a specific value:
public class example_when_told_to : WithFakes { private static int result; private static IHelper sut; private Establish context = () => { sut = An<IHelper>(); sut.WhenToldTo(s => s.OK(Arg<int>.Is.Anything)).Return(4567); }; private Because of = () => result = sut.OK(1); private It should_be_4567 = () => result.ShouldEqual(4567); }
Here I use ‘WhenToldTo()’ in order to control the return value of ‘OK()’. I could also do this:
public class example_when_told_to : WithFakes { private static int result; private static IHelper sut; private Establish context = () => { sut = An<IHelper>(); sut.WhenToldTo(s => s.OK(23)).Return(4567); }; private Because of = () => result = sut.OK(23); private It should_be_4567 = () => result.ShouldEqual(4567); }
So when ‘OK()’ is called with a specific argument, in this case 23, I want to return the value 4567. OK, so let’s have a look at using the ‘WithSubject’ parent class. First, we need the code for the salary calculator which Helper is using:
public interface ISalaryCalculator { double CalculateSalary(double baseSalary, double bonus); int GetValue(); } public class SalaryCalculator : ISalaryCalculator { public double CalculateSalary(double baseSalary, double bonus) { return baseSalary + bonus; } public int GetValue() { return 34; } }
Now here is the example test class we’ll be referencing:
public class example_using_WithSubject_1 : WithSubject<Helper> { private static int result; private Establish context = () => The<ISalaryCalculator>().WhenToldTo(x => x.GetValue()).Return(1); private Because of = () => result = Subject.OK(1); private It should_be_1 = () => result.ShouldEqual(1); }
We’re using WithSubject and passing it the type of Helper. What this give us is a .Subject property that we can use to access the SUT (i.e. the instance of Helper). The other cool thing is that since Helper requires an implementation of ISalaryCalculator in it’s constructor, an instance of ISalaryCalculator will be created for us. Not only that, but we can control the behaviour of the ISalaryCalculator instance via the ‘The<>’ method.
In the above example I’m stating that when ISalaryCalculator.GetValue() is called, it should return 1. We can also verify calls against the ISalaryCalculator like this:
public class example_using_WithSubject_2 : WithSubject<Helper> { private static int result; private Because of = () => result = Subject.OK(1); private It should_be_1 = () => The<ISalaryCalculator>().WasToldTo(x => x.GetValue()); }
That’s all for now. I might write a bit more about using Stubs in your MSpec.Fakes tests for part 3.
Thursday, November 17, 2011
Using MSpec.Fakes–Part 1
I decided to try out MSpec.Fakes, just to see how it works and to write a very quick guide on how to use it. First, in Visual Studio 2010, I added a reference to MSpec.Fakes via NuGet:
I chose the RhinoMocks flavour mainly as I had dabbled with both it and Moq in the past and felt that RhinoMock annoyed me less
(Note: I’m a TypeMock user by heart, but I often have to use an open source mocking framework, in order that all devs on the team can run the tests. TypeMock does have it’s critics, but it’s by far my choice of isolation framework, but that’s for another post.)
OK, once installed, I created a couple of nonsense classes and interfaces in order to help me get up and running:
public interface IHelper { int OK(int number); } public class Helper : IHelper { private readonly ISalaryCalculator salaryCalculator; public Helper(ISalaryCalculator salaryCalculator) { this.salaryCalculator = salaryCalculator; } public int OK(int number) { return this.salaryCalculator.GetValue(); } }
Here’s my MSpec test, I’ll explain what’s going on next:
public class when_given_a_number : WithFakes { private static int result; private static IHelper sut; private Establish context = () => { sut = An<IHelper>(); }; private Because of = () => result = sut.OK(1); private It should_have_been_passed_a_number = () => sut.WasToldTo(s => s.OK(Arg<int>.Is.Anything)); }
Notice that the test class inherits WithFakes, this parent class has the support for the faking implementation. The cool thing is that, regardless of the underlying mocking framework you choose to use (Moq, RhinoMock) the MSpec.Fakes API is the same. I really like this approach. Next thing to look at is how we create an instance of the Subject Under Test (SUT)
private Establish context = () => { sut = An<IHelper>(); };
The An<>(); method takes care of calling the RhinoMock equivalent of
var mockRepository = new MockRepository(); var helperMock = mockRepository.CreateMock<IHelper>();
After calling the .OK() method, the assertion for this test is that sut.OK() was called with any number:
private It should_be_1 = () => sut.WasToldTo(s => s.OK(Arg<int>.Is.Anything));
Here we see the .WasToldTo() method which takes care of verifying that .OK() was indeed called with any number. Simples.
In my next post I will show some more examples.
Friday, November 11, 2011
Using Jing To Record Videos
For the past few weeks I have been using Jing, a screencast tool available from TechSmith. Jing comes in two flavours: Free and Pro. I use the free edition. If you purchase the Pro version you do get the ability to save videos in MPEG-4 format (the free edition only allows you to create SWF files).
I learnt about Jing after reading this blog article on the Telerik site. They use Jing to record the progress of features completed by developers. This provides instant feedback to the team on how a feature has been implemented. I really like that idea and started to use it at work, though I’ve been recording videos to help document how I resolved some customer issues which are reported to us. I’ve also recorded videos which show how to configure IIS for client who wanted 301 redirects for certain url’s on their site. The videos have proved really useful, no to mention the amount of time saved when compared to writing out documentation by hand! | http://mrclyfar.blogspot.co.uk/2011_11_01_archive.html | CC-MAIN-2017-13 | refinedweb | 1,075 | 56.05 |
Jay Taylor's notesback to listing index
java - How to directly initialize a HashMap (in a literal way)? - Stack Overflow[web search]
- Public
Stack Overflow
- Users
- Find a Job
- Jobs
- Companies
- Teams
- Free 30 Day Trial
Is there some way of initializing a Java HashMap like this?:
Map<String,String> test = new HashMap<String, String>{"test":"test","test":"test"};
What would be the correct syntax? I have not found anything regarding this. Is this possible? I am looking for the shortest/fastest way to put some "final/static" values in a map that never change and are known in advance when creating the Map.
staticwhile this Question is asking about instantiating by literal syntax. Voting to re-open. Perhaps this Question is a duplicate of some other Question; if so, re-open and close again by linking to a Question that is truly an original of this. – Basil Bourque Dec 17 '19 at 2:13
All Versions
In case you happen to need just a single entry: There is
Collections.singletonMap("key", "value").
For Java Version 9 or higher:
Yes, this is possible now. In Java 9 a couple of factory methods have been added that simplify the creation of maps :
// this works for up to 10 elements: Map<String, String> test1 = Map.of( "a", "b", "c", "d" ); // this works for any number of elements: import static java.util.Map.entry; Map<String, String> test2 = Map.ofEntries( entry("a", "b"), entry("c", "d") );
In the example above both
test and
test2 will be the same, just with different ways of expressing the Map. The
Map.of method is defined for up to ten elements in the map, while the
Map.ofEntries method will have no such limit.
Note that in this case the resulting map will be an immutable map. If you want the map to be mutable, you could copy it again, e.g. using
mutableMap = new HashMap<>(Map.of("a", "b"));
(See also JEP 269 and the Javadoc)
For up to Java Version 8:
No, you will have to add all the elements manually. You can use an initializer in an anonymous subclass to make the syntax a little bit shorter:
Map<String, String> myMap = new HashMap<String, String>() {{ put("a", "b"); put("c", "d"); }};
However, the anonymous subclass might introduce unwanted behavior in some cases. This includes for example:
- It generates an additional class which increases memory consumption, disk space consumption and startup-time
- In case of a non-static method: It holds a reference to the object the creating method was called upon. That means the object of the outer class cannot be garbage collected while the created map object is still referenced, thus blocking additional memory
Using a function for initialization will also enable you to generate a map in an initializer, but avoids nasty side-effects:
Map<String, String> myMap = createMap(); private static Map<String, String> createMap() { Map<String,String> myMap = new HashMap<String,String>(); myMap.put("a", "b"); myMap.put("c", "d"); return myMap; }
Collections.singletonMap():) – skwisgaar Aug 16 '17 at 17:47
entrydocumented? – Brent Bradburn Jul 27 '18 at 16:42
This is one way.
Map<String, String> h = new HashMap<String, String>() {{ put("a","b"); }};
However, you should be careful and make sure that you understand the above code (it creates a new class that inherits from HashMap). Therefore, you should read more here: , or simply use Guava:
Map<String, Integer> left = ImmutableMap.of("a", 1, "b", 2, "c", 3);
ImmutableMap.of works for up to 5 entries. Otherwise, use the builder: source.
If you allow 3rd party libs, you can use Guava's ImmutableMap to achieve literal-like brevity:
Map<String, String> test = ImmutableMap.of("k1", "v1", "k2", "v2");
This works for up to 5 key/value pairs, otherwise you can use its builder:
Map<String, String> test = ImmutableMap.<String, String>builder() .put("k1", "v1") .put("k2", "v2") ... .build();
- note that Guava's ImmutableMap implementation differs from Java's HashMap implementation (most notably it is immutable and does not permit null keys/values)
- for more info, see Guava's user guide article on its immutable collection types
There is no direct way to do this - Java has no Map literals (yet - I think they were proposed for Java 8).
Some people like this:
Map<String,String> test = new HashMap<String, String>(){{ put("test","test"); put("test","test");}};
This creates an anonymous subclass of HashMap, whose instance initializer puts these values. (By the way, a map can't contain twice the same value, your second put will overwrite the first one. I'll use different values for the next examples.)
The normal way would be this (for a local variable):
Map<String,String> test = new HashMap<String, String>(); test.put("test","test"); test.put("test1","test2");
If your
test map is an instance variable, put the initialization in a constructor or instance initializer:
Map<String,String> test = new HashMap<String, String>(); { test.put("test","test"); test.put("test1","test2"); }
If your
test map is a class variable, put the initialization in a static initializer:
static Map<String,String> test = new HashMap<String, String>(); static { test.put("test","test"); test.put("test1","test2"); }
If you want your map to never change, you should after the initialization wrap your map by
Collections.unmodifiableMap(...). You can do this in a static initializer too:
static Map<String,String> test; { Map<String,String> temp = new HashMap<String, String>(); temp.put("test","test"); temp.put("test1","test2"); test = Collections.unmodifiableMap(temp); }
(I'm not sure if you can now make
test final ... try it out and report here.)
Map<String,String> test = new HashMap<String, String>() { { put(key1, value1); put(key2, value2); } };
HashMapinto this subclass. This can only work if you actually provide them. (With a new (empty) HashMap, the type arguments are not relevant.) – Paŭlo Ebermann Jul 12 '16 at 8:22
An alternative, using plain Java 7 classes and varargs: create a class
HashMapBuilder with this method:; }
Use the method like this:
HashMap<String,String> data = HashMapBuilder.build("key1","value1","key2","value2");
JAVA 8
In plain java 8 you also have the possibility of using
Streams/Collectors to do the job.
Map<String, String> myMap = Stream.of( new SimpleEntry<>("key1", "value1"), new SimpleEntry<>("key2", "value2"), new SimpleEntry<>("key3", "value3")) .collect(toMap(SimpleEntry::getKey, SimpleEntry::getValue));
This has the advantage of not creating an Anonymous class.
Note that the imports are:
import static java.util.stream.Collectors.toMap; import java.util.AbstractMap.SimpleEntry;
Of course, as noted in other answers, in java 9 onwards you have simpler ways of doing the same.
tl;dr
Use
Map.of… methods in Java 9 and later.
Map< String , String > animalSounds = Map.of( "dog" , "bark" , // key , value "cat" , "meow" , // key , value "bird" , "chirp" // key , value ) ;
Map.of
Java 9 added a series of
Map.of static methods to do just what you want: Instantiate an immutable
Map using literal syntax.
The map (a collection of entries) is immutable, so you cannot add or remove entries after instantiating. Also, the key and the value of each entry is immutable, cannot be changed. See the Javadoc for other rules, such as no NULLs allowed, no duplicate keys allowed, and the iteration order of mappings is arbitrary.
Let's look at these methods, using some sample data for a map of day-of-week to a person who we expect will work on that day.
Person alice = new Person( "Alice" ); Person bob = new Person( "Bob" ); Person carol = new Person( "Carol" );
Map.of()
Map.of creates an empty
Map. Unmodifiable, so you cannot add entries. Here is an example of such a map, empty with no entries.
Map < DayOfWeek, Person > dailyWorkerEmpty = Map.of();
dailyWorkerEmpty.toString(): {}
Map.of( … )
Map.of( k , v , k , v , …) are several methods that take 1 to 10 key-value pairs. Here is an example of two entries.
Map < DayOfWeek, Person > weekendWorker = Map.of( DayOfWeek.SATURDAY , alice , // key , value DayOfWeek.SUNDAY , bob // key , value ) ;
weekendWorker.toString(): {SUNDAY=Person{ name='Bob' }, SATURDAY=Person{ name='Alice' }}
Map.ofEntries( … )
Map.ofEntries( Map.Entry , … ) takes any number of objects implementing the
Map.Entry interface. Java bundles two classes implementing that interface, one mutable, the other immutable:
AbstractMap.SimpleEntry,
AbstractMap.SimpleImmutableEntry. But we need not specify a concrete class. We merely need to call
Map.entry( k , v ) method, pass our key and our value, and we get back an object of a some class implementing
Map.Entry interface.
Map < DayOfWeek, Person > weekdayWorker = Map.ofEntries( Map.entry( DayOfWeek.MONDAY , alice ) , // Call to `Map.entry` method returns an object implementing `Map.Entry`. Map.entry( DayOfWeek.TUESDAY , bob ) , Map.entry( DayOfWeek.WEDNESDAY , bob ) , Map.entry( DayOfWeek.THURSDAY , carol ) , Map.entry( DayOfWeek.FRIDAY , carol ) );
weekdayWorker.toString(): {WEDNESDAY=Person{ name='Bob' }, TUESDAY=Person{ name='Bob' }, THURSDAY=Person{ name='Carol' }, FRIDAY=Person{ name='Carol' }, MONDAY=Person{ name='Alice' }}
Map.copyOf
Java 10 added the method
Map.copyOf. Pass an existing map, get back an immutable copy of that map.
Notes
Notice that the iterator order of maps produced via
Map.of are not guaranteed. The entries have an arbitrary order. Do not write code based on the order seen, as the documentation warns the order is subject to change.
Note that all of these
Map.of… methods return a
Map of an unspecified class. The underlying concrete class may even vary from one version of Java to another. This anonymity enables Java to choose from various implementations, whatever optimally fits your particular data. For example, if your keys come from an enum, Java might use an
EnumMap under the covers. | https://jaytaylor.com/notes/node/1611171338000.html | CC-MAIN-2021-39 | refinedweb | 1,589 | 57.98 |
Functions
FunctionBody: BlockStatement BodyStatement InStatement BodyStatement OutStatement BodyStatement InStatement OutStatement BodyStatement OutStatement InStatement BodyStatement InStatement: in BlockStatement OutStatement: out BlockStatement out ( Identifier ) BlockStatement BodyStatement: body BlockStatement
Pure Functions
Pure functions are functions that produce the same result for the same arguments. To that end, a pure function:
- has parameters that are all invariant or are implicitly convertible to invariant
- does not read or write any global mutable state
A pure function can throw exceptions and allocate memory via a NewExpression.
int x; invariant int y; const int* pz; pure int foo(int i, // ok, implicitly convertible to invariant char* p, // error, not invariant const char* q, // error, not invariant invariant int* s // ok, invariant ) { x = i; // error, modifying global state i = x; // error, reading mutable global state i = y; // ok, reading invariant global state i = *pz; // error, reading const global state return i; }
Nothrow Functions
Nothrow functions do not throw any exceptions derived from class Exception.
Ref Functions
Ref functions allow functions to return by reference. This is analogous to ref function parameters.
ref int foo() { auto p = new int; return *p; } ... foo() = 3; // reference returns can be lvalues
Virtual Functions
Virtual functions are functions that are called indirectly through a function pointer table, called a vtbl[], rather than directly. All non-static non-private non-template member functions are virtual. This may sound inefficient, but since the D compiler knows all of the class hierarchy when generating code, all functions that are not overridden can be optimized to be non-virtual. In fact, since C++ programmers tend to "when in doubt, make it virtual", the D way of "make it virtual unless we can prove it can be made non-virtual" results, on average, in many more direct function calls. It also results in fewer bugs caused by not declaring a function virtual that gets { B test() { return null; } // overrides and is covariant with Foo.test() }
Virtual functions all have a hidden parameter called the this reference, which refers to the class object for which the function is called.
Function Inheritance and OverridingA functions A.foo, an std.HiddenFuncError exception is raised:
import std.hiddenfunc; class A { void set(long i) { } void set(int i) { } } class B : A { void set(long i) { } } void foo(A a) { int i; try { a.set(3); // error, throws runtime exception since // A.set(int) should not be available from B } catch (HiddenFuncError o) { i = 1; } assert(i == 1); } void main() { foo(new B); }
If an HiddenFuncError exception is thrown in your program, the use of overloads and overrides needs to be reexamined in the relevant classes.
The HiddenFuncError exception is not thrown }
Inline FunctionsThere is no inline keyword. The compiler makes the decision whether to inline a function or not, analogously to the register keyword no longer being relevant to a compiler's decisions on enregistering variables. (There is no register keyword either.)
Function Overloading
Functions are overloaded based on how well the arguments to a function can match up with the parameters. The function with the best match is selected. The levels of matching are:
- no match
- match with implicit conversions
- match with conversion to const
- exact match. because the name mangling does not take the parameter types into account.
Overload Sets:) }
Even though B.foo(int) is a better match than A.foo(long) for foo(1), it is an error because the two matches are in different overload sets.
Overload sets can be merged with an alias declaration:
import A; import B; alias A.foo foo; alias B.foo foo; void bar(C c) { foo(); // calls A.foo() foo(1L); // calls A.foo(long) foo(c); // calls B.foo(C) foo(1,2); // error, does not match any foo foo(1); // calls B.foo(int) A.foo(1); // calls A.foo(long) }
Function ParametersParameter storage classes are in, out, ref, lazy, final, const, invariant, or scope. For example:
int foo(in int x, out int y, ref int z, int q);
x is in, y is out, z is ref, and q is none.
The in storage class is equivalent to const scope.
If no storage class is specified, the parameter becomes a mutable copy of its argument.
- The function declaration makes it clear what the inputs and outputs to the function are.
- It eliminates the need for IDL as a separate language.
- It provides more information to the compiler, enabling more error checking and possibly better code generation.
out parameters are set to the default initializer for the type of it. For example:
void foo(out int x) { // x is set.
Lazy arguments are evaluated not when the function is called, but when the parameter is evaluated within the function. Hence, a lazy argument can be executed 0 or more times. A lazy parameter cannot be an lvalue.
void dotimes(int n, lazy void exp) { while (n--) exp(); } void test() { int x; dotimes(3, writefln(x++)); }
prints to the console:
0 1 2
A lazy parameter of type void can accept an argument of any type.
Function Default Arguments
Function parameter declarations can have default values:
void foo(int x, int y = 3) { ... } ... foo(4); // same as foo(4, 3);
Default parameters are evaluated in the context of the function declaration. If the default value for a parameter is given, all following parameters must also have default values.
Variadic FunctionsFunctions taking a variable number of arguments are called variadic functions. A variadic function can take one of three forms:
- C-style variadic functions
- Variadic functions with type info
- Typesafe variadic functions
C-style Variadic FunctionsA C-style variadic function is declared as taking a parameter of ... after the required function parameters. It has non-D linkage, such as extern (C):
extern (C) int foo(int x, int y, ...); foo(3, 4); // ok foo(3, 4, 6.8); // ok, one variadic argument foo(2); // error, y is a required argumentThere must be at least one non-variadic parameter declared.
extern (C) int def(...); // error, must have at least one parameterC-style variadic functions match the C calling convention for variadic functions, and is most useful for calling C library functions like printf. The implementiations of these }To protect against the vagaries of stack layouts on different CPU architectures, use std.c.stdarg to access the variadic arguments:
import std.c.stdarg;
D-style Variadic FunctionsVariadic functions with argument and type info are declared as taking a parameter of ... after the required function parameters. It has D linkage, and need not have any non-variadic parameters declared:
int abc(char c, ...); // one required parameter: c int def(...); // okThese }An additional hidden argument with the name _arguments and type TypeInfo[] is passed to the function. _arguments gives the number of arguments and the type of each, enabling the creation of typesafe variadic functions.
import std.stdio; class Foo { int x = 3; } class Bar { long y = 4; } void printargs(int x, ...) { writefln("%d arguments", _arguments.length); for (int i = 0; i < _arguments.length; i++) { _arguments[i].print(); if (_arguments[i] == typeid(int)) { int j = *cast(int *)_argptr; _argptr += int.sizeof; writefln("\t%d", j); } else if (_arguments[i] == typeid(long)) { long j = *cast(long *)_argptr; _argptr += long.sizeof; writefln("\t%d", j); } else if (_arguments[i] == typeid(double)) { double d = *cast(double *)_argptr; _argptr += double.sizeof; writefln("\t%g", d); } else if (_arguments[i] == typeid(Foo)) { Foo f = *cast(Foo*)_argptr; _argptr += Foo.sizeof; writefln("\t%X", f); } else if (_arguments[i] == typeid(Bar)) { Bar b = *cast(Bar*)_argptr; _argptr += Bar.sizeof; writefln("\t%X", b); } else assert(0); } } void main() { Foo f = new Foo(); Bar b = new Bar(); writefln("%X", f); printargs(1, 2, 3L, 4.5, f, b); }which prints:
00870FE0 5 arguments int 2 long 3 double 4.5 Foo 00870FE0 Bar 00870FD0To protect against the vagaries of stack layouts on different CPU architectures, use std.stdarg to access the variadic arguments:
import std.stdio; import std.stdarg; void foo(int x, ...) { writefln("%d arguments", _arguments.length); for (int i = 0; i < _arguments.length; i++) { _arguments[i].print();%X", f); } else assert(0); } }
Typesafe Variadic FunctionsTypesafe variadic functions are used when the variable argument portion of the arguments are used to construct an array or class object.
For arrays:
int; char[] s; this(int x, char[] s) { this.x = x; this.s = s; } } void test(int x, Foo f ...); ... Foo g = new Foo(3, "abc"); test(1, g); // ok, since g is an instance of Foo test(1, 4, "def"); // ok test(1, 5); // error, no matching constructor for Foo
Lazy Variadic Functions );
Local Variables is never referred to. Dead variables, like anachronistic dead code,.
Nested Functions; } }
Member functions of nested classes and structs do not have access to the stack variables of the enclosing function, but do have access to the other symbols:
void test() { int j; static int s; struct Foo { int a; int bar() { int c = s; // ok, s is static int d = j; // error, no access to frame of test() int foo() { int e = s; // ok, s is static int f = j; // error, no access to frame of test() return c + a; // ok, frame of bar() is accessible, // so are members of Foo accessible via // the 'this' pointer to Foo.bar() } return 0; } } }
Nested functions always have the D function linkage type.
Unlike module level declarations, declarations within function scope are processed in order. This means that two nested functions cannot mutually call each other:
void test() { void foo() { bar(); } // error, bar not defined void bar() { foo(); } // ok }
The solution is to use a delegate:
void test() { void delegate() fp; void foo() { fp(); } void bar() { foo(); } fp = &bar; }
Future directions: This restriction may be removed.
Delegates, Function Pointers, and Closures
A function pointer can point to a static nested function:
int function() fp; void test() { static int a = 7; static int foo() { return a + 3; } fp = &foo; } void bar() { test(); int i = fp(); // i is set to 10 }.
Future directions: Function pointers and delegates may merge into a common syntax and be interchangeable with each other.
Anonymous Functions and Anonymous Delegates
See Function Liter(char[][] args) { ... } int main() { ... } int main(char[][] args) { ... }
Compile Time Function Execution
A subset of functions can be executed at compile time. This is useful when constant folding algorithms need to include recursion and looping. In order to be executed at compile time, a function must meet the following criteria:
- function arguments must all be:
- integer literals
- floating point literals
- character literals
- string literals
- array literals where the members are all items in this list
- associative array literals where the members are all items in this list
- struct literals where the members are all items in this list
- const variables initialized with a member of this list
- function parameters may not be variadic, or lazy
- the function may not be nested or synchronized
- the function may not be a non-static member, i.e. it may not have a this pointer
- expressions in the function may not:
- throw exceptions
- use pointers, delegates, non-const arrays, or classes
- reference any global state or variables
- reference any local static variables
- new or delete
- call any function that is not executable at compile time
- the following statement types are not allowed:
- synchronized statements
- throw statements
- with statements
- scope statements
- try-catch-finally statements
- labelled break and continue statements
- as a special case, the following properties can be executed at compile time:
In order to be executed at compile time, the function must appear in a context where it must be so executed, for example:
- initialization of a static variable
- dimension of a static array
- argument for a template value parameter
template eval( A... ) { const typeof(A[0]) eval = A[0]; } int square(int i) { return i * i; } void foo() { static j = square(3); // compile time writefln(j); writefln(square(4)); // run time writefln(eval!(square(5))); // compile time }
Executing functions at compile time can take considerably longer than executing it at run time. If the function goes into an infinite loop, it will hang at compile time (rather than hanging at run time).
Functions executed at compile time can give different results from run time in the following scenarios:
- floating point computations may be done at a higher precision than run time
- dependency on implementation defined order of evaluation
- use of uninitialized variables
These are the same kinds of scenarios where different optimization settings affect the results.
String Mixins and Compile Time Function Execution
Any functions that execute at compile time foo() cannot be generated. A function template would be the appropriate method to implement this sort of thing. | http://www.digitalmars.com/d/2.0/function.html | crawl-002 | refinedweb | 2,094 | 53.41 |
Hello! This community's reputation has given me the courage to attempt my first Arch install! Following the instructions in the installation guide, I made it as far as the partitioning step. When I run "fdisk -l" I see my windows partitions listed (not as /dev/sdx as I'm used to seeing) as /dev/nvme0n1px. I just did a fresh Win 10 install and left half of my SSD free for this Arch install. I don't see the unallocated space label that I'm used to seeing in GUI apps like gparted. How do I know where to start making my new partitions? I ran "parted -l" and I'm not seeing that space either.
EDIT: I discovered the "free" command in parted listed my 124GB Free space but I still haven't figured out how to write my home, swap, and root partitions to that space.
Running "fdisk /dev/nvme0n1p4" and then F to list unpartitioned space returns "fdisk: libfdisk/src/table.c:414: new_freespace: Assertion 'start >= cxt->first_lba' failed.
[1] 14784 abort (core dumped) fdisk /dev/nvme0n1p4".
Running the n command for a new partition, and then p for primary (3 primary, 0 extended, 1 free) returns "No free partition available!"
Last edited by wwindexx (2018-09-15 05:40:26)
Offline
Offline
They way nvme devices are named is the following: nvme + #devicenr.(think sd[a-z]) + n +#namespacenr (a nvme specific "partition" were you can set different parameters) + p + "traditional" partition number (think sdaX)
For most home purposes it is likely fine to simply use the default namespace, so the granularity at which you want to define partitions at is the namespace. So your fdisk command should be
fdisk /dev/nvme0n1
the p part are your actual partitions and they will get added as you add new partitions.
Offline
Running the n command for a new partition, and then p for primary (3 primary, 0 extended, 1 free) returns "No free partition available!"
That and other info in post #1 indicates the ssd uses GPT instead of MBR.
The explanation given by V1del is accurate, just use gdisk or cgdisk instead of fdisk/cfdisk .
Booting with apg Openrc, NOT systemd.
Automounting : not needed, i prefer pmount
Aur helpers : makepkg + my own local repo === rarely need them
Offline | https://bbs.archlinux.org/viewtopic.php?pid=1807963 | CC-MAIN-2018-39 | refinedweb | 383 | 61.67 |
Hello,
I need to get some user information beyond name and email (which I can get from SPUser) and was wondering if there's a way to get more AD property values via the WSS API instead of using the classes in System.DirectoryServices. The reason being is that I'm worried that I won't have the permissions to query the AD schema via the DirectorySearcher class.
Thanks,
~Peter
In SharePoint this information is available via the Profile Database. You'll need to set up your SSP to import profile data from AD, which you can then query via the object model.
Here is the SDK reference for the Microsoft.Office.Server.UserProfiles namespace:
Many thanks Eric. I just emailed our systems/infrastructure team to find out if we have the Profile Database setup.
Cheers,
Microsoft is conducting an online survey to understand your opinion of the Msdn Web site. If you choose to participate, the online survey will be presented to you when you leave the Msdn Web site.
Would you like to participate? | http://social.msdn.microsoft.com/Forums/sharepoint/en-US/7ca2bd11-c6b4-4b12-afde-1e445b8cca0a/getting-ad-attributes-from-microsoftsharepointspuser?forum=sharepointdevelopmentlegacy | CC-MAIN-2014-35 | refinedweb | 176 | 62.98 |
Odoo Help
This community is for beginners and experts willing to share their Odoo knowledge. It's not a forum to discuss ideas, but a knowledge base of questions and their answers.
Change Boolean field to Boolean(computed)
I habe a problem to change an existing boolen field to an computed boolean field:
class manatec_project_task_type(models.Model):
_inherit = 'project.task.type'
@api.one
def _get_value(self):
print 'inside'
self.value = True
value = fields.Boolean(compute='_get_value')
The field is visible on the form view but the method _get_value ist never called.
Regards
Ok my friend as i see in this link:
We cant add a compute function to a boolean field.
You can do this:
Python:
def on_change_value_id(self, cr, uid, ids, field_name, context=None):
print ('------------------------test vente--------------------')
print field_name
Try this and tell me what you have got. Regards.
Where in the link do you see you can't add a compute function to a boolean changed value = fields.Boolean(compute='_get_value_get_value') to value = fields.Boolean(compute='_get_value'). This is how my code looks. It was just an copy and paste mistake. | https://www.odoo.com/forum/help-1/question/change-boolean-field-to-boolean-computed-90605 | CC-MAIN-2016-50 | refinedweb | 183 | 67.25 |
All Articles from Perl.comBeginner. [May 7, 2008]. [Apr 23, 2008]
Using Amazon S3 from Perl. [Apr 8, 2008]. [Mar 14, 2008]. [Feb 13, 2008]. [Jan 18, 2008]
Memories of 20 Years of Perl
The Perl community just celebrated the 20th anniversary of Perl. Here are some stories from Perl hackers around the world about problems they've solved and memories they've made with the venerable, powerful, and still vital language. [Dec 21, 2007]
Programming is Hard, Let's Go Scripting...
Larry Wall's annual State of the Onion describes the state of Perl, the language and the community. In his 11th address, he discussed the past, present, and future of scripting languages, including the several dimensions of design decisions important to the development of Perl 6. [Dec 6, 2007]. [Sep 21, 2007]. [Aug 7, 2007]
Option and Configuration Processing Made Easy. [Jul 12, 2007]. [Jun 7, 2007]. [May 10, 2007]
Lightning Strikes Four Times
Perl lightning articles offer short takes on important subjects. See how Perl can outperform C for 3D programming, how (and why) to express cross-cutting concerns in your programs, and one way of keeping your test counts up-to-date. [Apr 12, 2007]
The Beauty of Perl 6 Parameter Passing. [Mar 1, 2007]
Advanced HTML::Template: Widgets
HTML::Template is a templating module for HTML made powerful by its simplicity. Its minimal set of operations enforces a strict separation between presentation and logic. However, sometimes that minimalism makes templates unwieldy. Philipp Janert demonstrates how to reuse templates smaller than an entire page--and how this simplifies your applications. [Feb 1, 2007]. [Jan 11, 2007]
Using Java Classes in Perl
Java has a huge amount of standard libraries and APIs. Some of them don't have Perl equivalents yet. Fortunately, using Java classes from Perl is easy--with Inline::Java. Andrew Hanenkamp shows you how. [Dec 21, 2006]
Advanced HTML::Template: Filters. [Nov 30, 2006]
Hash Crash Course
Most explanations of hashes use the metaphor of a dictionary. Most real-world code uses hashes for far different purposes. Simon Cozens explores some patterns of hashes for counting, uniqueness, caching, searching, set operations, and dispatching. [Nov 2, 2006]. [Oct 19, 2006]
The State of the Onion 10
In Larry Wall's tenth annual State of the Onion address, he talks about raising children and programming languages and balancing competing tensions and irreconcilable desires. [Sep 21, 2006]. [Aug 3, 2006]. [Jul 13, 2006]. [Jun 1, 2006]. [May 4, 2006]
Unraveling Code with the Debugger. [Apr 6, 2006]
Using Ajax from Perl
The recently rediscovered Ajax technique makes the client side of web programming much more useful and pleasant. However, it also means revising your existing web applications to take advantage of this new power. Dominic Mitchell shows how to use CGI::Ajax to give your Perl applications access to this new power. [Mar 2, 2006]. [Feb 23, 2006]. [Feb 16, 2006]
Debugging and Profiling mod_perl Applications
How do you use the debugger on a
mod_perlapplication? How do you profile an application embedded in a web server, with multiple child processes? Don't worry. Where there's Perl, there's a way. Frank Wiles demonstrates how to debug and profile
mod_perlapplications. [Feb 9, 2006]. [Feb 2, 2006]
More Advancements in Perl Programming. [Jan 26, 2006]
Analyzing HTML with Perl
Kendrew Lau taught HTML development to business students. Grading web pages by hand was tedious--but Perl came to the rescue. Here's how Perl and HTML parsing modules helped make teaching fun again. [Jan 19, 2006]
What Is Perl 6
Perl 6 is the long-awaited rewrite of the venerable Perl programming language. What's the status? What's changing? What's staying the same? Why does Perl need a rewrite anyway? chromatic attempts to answer all of these questions. [Jan 12, 2006]
Lexing Your Data. [Jan 5, 2006]. [Dec 21, 2005]. [Dec 15, 2005]. [Dec 8, 2005]. [Dec 1, 2005]
Document Modeling with Bricolage
Any document-processing application needs to make a model of the documents it expects to process. This can be a time-consuming and error-prone task, especially if you've never done it before. David Wheeler of the Bricolage project shows how to analyze and model documents for his publishing system. Perhaps it can help you. [Nov 23, 2005]
Building E-Commerce Sites with Handel
Building web sites can be tedious--so many parts and pieces are all the same. Have you written enough form processors and shopping carts to last the rest of your life? Now you can get on with the real programming. Christopher H. Laco shows how to use Handel and Catalyst to build a working e-commerce site without actually writing any code. [Nov 17, 2005]
Making Sense of Subroutines
Subroutines are the building blocks of programs. Yet, too many programmers use them ineffectively, whether not making enough of them, naming them poorly, combining too many concepts into one, or any of a dozen other problems. Used properly, they can make your programs shorter, faster, and more maintainable. Rob Kinyon shows the benefits and advanced uses that come from revisiting the basics of subroutines in Perl. [Nov 3, 2005]
Data Munging for Non-Programming Biologists
Scientists often have plenty of data to munge. Non-programmer scientists often have to beg their coders for help or get by doing it themselves. Amir Karger and his colleagues had a different idea. Why not provide them with short, interchangeable Perl recipes to solve small pieces of larger problems? Here's how they built the Scriptome. [Oct 20, 2005]
Making Menus with wxPerl. [Oct 6, 2005]
The State of the Onion 9
In Larry Wall's ninth annual State of the Onion address, he explains Perl 6's Five Year Plan, how Perl programmers are like spies (or vice versa), and how open source can learn from the intelligence community. [Sep 22, 2005]. [Sep 8, 2005]
Perl Needs Better Tools
Perl is a fantastic language for getting your work done. It's flexible, forgiving, malleable, and dynamic. Why shouldn't it have good, powerful tools? Are Perl development tools behind those of other, perhaps less-capable languages? J. Matisse Enzer argues that Perl needs better tools, and explains what those tools should do. [Aug 25, 2005]
This Week in Perl 6, August 17-23, 2005
Matt Fowles summarizes the Perl 6 mailing lists, with p6i seeing the most HLL discussion yet; p6l debating binding, parameters, and primitives; and p6c appreciating pretty graphics. [Aug 25, 2005]
Parsing iCal Data. [Aug 18, 2005]
This Week in Perl 6, Through August 14, 2005
Piers Cawley summarizes the Perl 6 mailing lists with containers and metamodels on the Perl 6 compiler list, metamodel and trait questions on the Perl 6 language list, and opcode changes and test modules on the Perl 6 internals list. [Aug 18, 2005]
Important Notice for Perl.com Perl.com.
The following URLs represent Perl.com
Automated GUI Testing. [Aug 11, 2005]
This Week in Perl 6, August 2-9, 2005
Matt Fowles summarizes the Perl 6 mailing lists, with p6i seeing build and platform patches, p6l exploring meta-meta discussions, and p6c enjoying Pugs and PxPerl releases. [Aug 11, 2005]
This Week in Perl 6, through August 2, 2005
Piers Cawley summarizes the Perl 6 mailing lists with PIL discussion on the Perl 6 compiler list, type and container questions on the Perl 6 language list, and a Lua compiler on the Perl 6 internals list. [Aug 8, 2005]
Building a 3D Engine in Perl, Part 4
The ultimate goal of all programming is to be as unproductive as possible--to write games. In part four of a series on building a 3D engine with Perl, Geoff Broadwell explains how to profile your engine, how to improve performance and code with display lists, and how to render text. [Aug 4, 2005]. [Jul 28, 2005]
This Week in Perl 6, July 20-26, 2005
Matt Fowles summarizes the Perl 6 mailing lists, with p6i discussing garbage collection schemes, p6l rethinking object attribute access and plotting GC APIs and access, and p6c reporting problems, documenting PIL, and discussing the grammar. [Jul 28, 2005]
An Introduction to Test::MockDBI. [Jul 21, 2005]
This Week in Perl 6, July 13-19, 2005
Piers Cawley summarizes the Perl 6 mailing lists with Pugs running on a JavaScript engine, GMC plans for Parrot, and typechecking and metamodel discussions about Perl 6. [Jul 21, 2005]. [Jul 14, 2005]
This Week in Perl 6, July 5-12, 2005
Matt Fowles summarizes the Perl 6 mailing lists, with p6l discussing metamodels, MMD, and invocants; p6i handling Leo's new calling conventions; and p6c plotting on retargeting Pugs to different back ends. [Jul 14, 2005]
Building Navigation Menus
Well-designed websites are easy to navigate, with sensible menus, breadcrumb trails, and the information you need within three clicks of where you are. Rather than tediously coding navigation structures by hand, why not consider using a Perl module to generate them for you? Shlomi Fish shows how to use his HTML::Widgets::NavMenu module. [Jul 7, 2005]
This Week in Perl 6, June 29-July 5, 2005
Piers Cawley summarizes the Perl 6 mailing lists with YAPC::NA hackathons, a request for better archives, DBI v2 plans from Tim Bunce, and PGE interoperability questions. [Jul 7, 2005]
Annotating CPAN
Perl has voluminous documentation, both in the core distribution and in thousands of CPAN modules. That doesn't make it all perfect, though, and the amount of documentation can make it daunting to find and recommend changes or clarifications. The Perl Foundation recently sponsored Ivan Tubert-Brohman to fix this; here's how he built AnnoCPAN, an annotation service for module documentation. [Jun 30, 2005]
This Week in Perl 6, June 21-28, 2005
Matt Fowles summarizes the Perl 6 mailing lists with p6c discussing self-hosting options for Perl 6, Parrot segfaults and changes; and
AUTOLOADand self method invocation discussions continuing on p6l. [Jun 30, 2005]. [Jun 23, 2005]. [Jun 23, 2005]. [Jun 16, 2005]. [Jun 9, 2005]
This Week in Perl 6, June 1-7, 2005
Piers Cawley summarizes the Perl 6 mailing lists with Parrot 0.2.1 released,
mod_parrotbundled with
mod_pugs(or vice versa), an end to the reduce operator debate, and a paean to Parrot lead architect Dan Sugalski. [Jun 9, 2005]. [Jun 2, 2005]
This Week in Perl 6, May 25, 2005-May 31, 2005
Matt Fowles summarizes the Perl 6 mailing lists with Parrot keys, MMD, Tcl, Python discussion, Pugs' continued evolution, introspection, generation, and more Perl 6 meta-programming goodness. [Jun 2, 2005]
This Week in Perl 6, May 18 - 24, 2005
Piers Cawley summarizes the Perl 6 mailing lists with Inline::Pugs bridging the gap, ParTcl coming into existence, and many questions about multimethod dispatch in Perl 6. [May 27, 2005]
Manipulating Word Documents with Perl
Unix hackers love their text editors for plain-text manipulatey goodness--especially Emacs and Vim with their wonderful extension languages (and sometimes Perl bindings). Don't fret, defenestrators-to-be. Andrew Savikas demonstrates how to use Perl for your string-wrangling when you have to suffer through using Word. [May 26, 2005]
This Week in Perl 6, May 3, 2005 - May 17, 2005
Matt Fowles summarizes the Perl 6 mailing lists with Pugs gaining object support, Parrot 0.2.0 released, and Perl 6 going through a reduction (though not in volume). [May 19, 2005]
Build a Wireless Gateway with Perl. [May 19, 2005]
Inside YAPC::NA 2005
One of the success stories of the Perl community is the series of self-organized Yet Another Perl Conferences. This year's North American YAPC is in Toronto in late June. chromatic recently interviewed Richard Dice, the man behind YAPC::NA 2005 to discuss how to put together a conference and what to expect from the conference and its attendant extracurricular activities in lovely Toronto. [May 12, 2005]
Massive Data Aggregation with Perl. [May 5, 2005]
This Week in Perl 6, April 26 - May 3, 2005
Matt Fowles summarizes the Perl 6 mailing lists with Pugs 6.2.2 released, Parrot freezing for a release, and the great debate over invocant naming continuing. [May 5, 2005]
This Week in Perl 6, April 20 - 26, 2005
Piers Cawley summarizes the Perl 6 mailing lists with Pugs 6.2.1 released, more MMD schemes, and big discussions of blocks, invocants, and parameters. [May 2, 2005]
People Behind Perl: brian d foy
brian d foy is a long-time Perl hacker and leader, having founded the Perl Mongers, written and helped to write many useful CPAN modules, and recently founding, publishing, and editing The Perl Review. Perl.com recently interviewed brian about his work, history, and future plans. [Apr 28, 2005]
Automating Windows Applications with Win32::OLE
Many Windows applications are surprisingly automable through OLE, COM, DCOM, et cetera. Even better, this automation works through Perl as well. Henry Wasserman walks through the process of discovering how to automate Internet Explorer components to automate web testing from Perl. [Apr 21, 2005]
This Week in Perl 6, April 12 - 19, 2005
Matt Fowles summarizes the Perl 6 mailing lists with Pugs 6.2.0 released, documentation patches, a switch to Subversion, and scope, whitespace, and character class questions. [Apr 21, 2005]
Building Good CPAN Modules
Your code is amazing. It works exactly as you intended. You've decided to give back, to share it with the world by uploading it to the CPAN. Before you do, though, there are a few fiddly details about cross-platform and cross-version compatibility to keep in mind. Rob Kinyon gives several guidelines about writing CPAN modules that will work everywhere they will be useful. [Apr 14, 2005]
This Week in Perl 6, April 4-11, 2005
Piers Cawley summarizes the Perl 6 mailing lists with a new plan for Ponie, a Parrot/Pugs hackathon announcement, and identity tests. [Apr 14, 2005]
Perl Code Kata: Mocking Objects
One problem with many examples of writing test code is that they fake up a nice, perfect, self-contained world and proceed to test it as if real programs weren't occasionally messy. Real programs have to deal with external dependencies and work around odd failures, for example. How do you test that? In this Perl Code Kata, Stevan Little presents exercises in using Test::MockObject to make the messy real world more testable. [Apr 7, 2005]
This Fortnight in Perl 6, March 22 - April 3, 2005
Matt Fowles summarizes the Perl 6 mailing lists with p6l discussing converters and S03 and S29 updates, p6c finding and fixing bugs in Pugs, and p6i cleaning up code and welcoming Chip. [Apr 7, 2005]
More Lightning Articles
Yes, it's the return of Perl Lightning Articles -- short discussions of Perl and programming. This time, learn about Emacs customization with Perl, debugging without adding print statements, testing database-heavy code, and why unbuffering may be a mistake. [Mar 31, 2005]
This Fortnight in Perl 6, March 7 - March 21, 2005
Matt Fowles summarizes the Perl 6 mailing lists with the resurgence of Perl 6 language questions, implementation decisions galore, and a new Parrot chief architect. [Mar 24, 2005]. [Mar 24, 2005]
Symbol Table Manipulation
One of the most dramatic advantages of dynamic languages is that they provide access to the symbol table at run-time, allowing new functions and variables to spring into existence as you need them. Though they're not always the right solution to common problems, they're very powerful and useful in certain circumstances. Phil Crow demonstrates how and when and why to manipulate Perl's symbol table. [Mar 17, 2005]
This Fortnight in Perl 6, Feb. 23 - March 7, 2005
Matt Fowles summarizes the Perl 6 mailing lists with the release of Parrot 0.1.2, lots of Pugs patches, and a plea for off-list summarization help. [Mar 10, 2005]
A Plan for Pugs. [Mar 3, 2005]
This Fortnight in Perl 6, Feb. 9-22, 2005
Matt Fowles summarizes the Perl 6 mailing lists with kudos to Autrijus, still more plans for the Parrot 0.1.2 release, and lots and lots and lots of words about junctions. [Feb 24, 2005]
Perl and Mandrakelinux
Perl is a fantastic tool for system administrators. Why not use it for building administrative applications? That's just what Mandrakelinux does! Mark Stosberg recently interviewed Perl 5.10 pumpking and Mandrake employee Rafael Garcia-Suarez about the use of Perl for graphical applications. [Feb 24, 2005]
Building a 3D Engine in Perl, Part 3
The ultimate goal of all programming is to be as unproductive as possible--to write games. In part three of a series on building a 3D engine with Perl, Geoff Broadwell explains how to manage the viewpoint and how to achieve impressive lighting effects with OpenGL. [Feb 17, 2005]
Perl Code Kata: Testing Databases. [Feb 10, 2005]
This Week in Perl 6, Feb. 1 - 8, 2005
Matt Fowles summarizes the Perl 6 mailing lists with bugfixes, plans for a Parrot 0.1.2 release, and the introduction of Featherweight Perl 6, an actual implementation. [Feb 10, 2005]
Throwing Shapes
Sometimes data processing works best when you separate the application into multiple parts; this is the well-loved client-server model. What goes on between the parts, though? Vladi Belperchinov-Shabanski walks through the design and implementation of a Remote Procedure Call system in Perl. [Feb 3, 2005]
This Fortnight in Perl 6, Jan. 19-31, 2005
Matt Fowles summarizes the Perl 6 mailing lists with more Parrot calling conventions, Perl 6 loop-ending and loop-continuing semantics, and evil thoughts from Luke Palmer. [Feb 3, 2005]
The Phalanx Project
One ancient Greek military invention was the phalanx, a group of soldiers with overlapping shields each protecting each other. In the Perl world, the Phalanx project intends to improve the quality of Perl 5, Ponie, and the top CPAN modules. Project founder Andy Lester describes the goals and ambitions. [Jan 20, 2005]
This Week in Perl 6, Jan. 11-18, 2005
Matt Fowles summarizes the Perl 6 mailing lists with idioms, loop counters, method-calling semantics, and the return of Dan Sugalski. [Jan 20, 2005]
An Introduction to Quality Assurance
The libraries and syntax for automated testing are easy to find. The mindset of quality and testability is harder to adopt. Tom McTighe reviews the basic principles of quality assurance that can make the difference between a "working" application and a high-quality application. [Jan 13, 2005]
This Week in Perl 6, January 03 - January 11, 2005
Matt Fowles summarizes the Perl 6 mailing lists with bugfixes, multimensional data structures, and a new syntax engine. [Jan 13, 2005]
This Fortnight in Perl 6, December 21 - 31 2004
Matt Fowles summarizes the Perl 6 mailing lists with the final summary of 2004. What's on the lists? Patches, design decisions, and lots of theory. [Jan 6, 2005]
Bricolage Configuration Directives
Any serious application has a serious configuration file. The Bricolage content management system is no different. David Wheeler explains the various configuration options that can tune your site to your needs. [Jan 6, 2005]
This Fortnight in Perl 6, December 7-20 2004
Matt Fowles summarizes the Perl 6 mailing lists: the Perl 6 language list discusses hashes, classes, and variables; the Perl 6 Compiler list launches code; and the Parrot list fixes lots and lots of bugs. [Dec 29, 2004]
Building a 3D Engine in Perl, Part 2
The ultimate goal of all programming is to be as unproductive as possible--to write games. In part two of a series on building a 3D engine with Perl, Geoff Broadwell demonstrates animations and event handling. [Dec 29, 2004]
Introducing mod_parrot
mod_perl marries Perl 5 with the Apache web server. What's the plan for Perl 6? mod_parrot--and it may also be base for any language hosted on the Parrot virtual machine. After a brief hiatus, Jeff Horwitz recently resurrected the mod_parrot progress. Here's the current state, what works, and how to play with it on your own. [Dec 22, 2004]
Perl Code Kata: Testing Imports
Persistently practicing good programming will make you a better programmer. It can be difficult to find small tasks to practice, though. Fear not! Here's a 30-minute exercise to improve your testing abilities and your understanding of module importing and exporting. [Dec 16, 2004]
The Evolution of ePayment Services at UB
Perl is often a workhorse behind the scenes, content to do its job quietly and without fuss. When the University of New York at Buffalo needed to offer electronic payment services to students, the Department of Computing Services reached for Perl. Jim Brandt describes how Perl (and a little Inline::Java) helped them build just enough code to allow students to pay their bills online. [Dec 9, 2004]
This Fortnight in Perl 6, December 1 - 6 2004
Matt Fowles summarizes the Perl 6 mailing lists: the Perl 6 language list discusses a shiny new syntax update, and the Parrot list discusses what is and isn't up for grabs. [Dec 9, 2004]
This Fortnight in Perl 6, November 16-30 2004
Matt Fowles summarizes the Perl 6 mailing lists, with the introduction of the Parrot Grammar Engine! [Dec 2, 2004]
Building a 3D Engine in Perl
The ultimate goal of all programming is to be as unproductive as possible -- to write games. Why hurt yourself to write in low-level languages, though, when Perl provides all of the tools you need to do it well? Geoff Broadwell demonstrates how to use OpenGL from Perl. [Dec 1, 2004]
Perl Debugger Quick Reference
Perl's debugger is both powerful and somewhat esoteric. This printable excerpt from Richard Foley's Perl Debugger Pocket Reference can help take some of the mystery out of the common commands and put more advanced features within your reach. [Nov 24, 2004]
Cross-Language Remoting with mod_perlservice
Remoting -- sharing data between server and client processes -- is powerful, but writing your own protocols is tedious and difficult. XML-RPC is too simple and SOAP and CORBA are too complex. Isn't there something in the middle, something easier to set up and use? Michael W. Collins introduces
mod_perlservice, an Apache httpd module that provides remote services to C, Perl, or Flash clients. [Nov 18, 2004]
This Week in Perl 6, November 9 - 15 2004
Matt Fowles summarizes the Perl 6 mailing lists, with the Parrot list discussing continuations and the unchanging calling conventions, the Perl 6 folks discussing exports, and the Perl 6 Compiler list still strangely quiet. [Nov 18, 2004]
Implementing Flood Control. [Nov 11, 2004]
This Week in Perl 6, November 2 - 8 2004
Matt Fowles summarizes the Perl 6 mailing lists, with the Parrot folks talking about optimizations not to apply yet, the Perl 6 people receiving updated Synopses and Apocalypses, and the Perl 6 Internals team being strangely quiet. [Nov 11, 2004]
Komodo 3.0 Review
ActiveState has recently released version 3.0 of its Komodo IDE, supporting agile languages. Jason Purdy reviews the progress made since the 2.0 release. [Nov 4, 2004]
This Fortnight on Perl 6, October 2004 Part Two
Matt Fowles summarizes two more weeks of the Perl 6 mailing lists in the last half of October. [Nov 4, 2004]
Installing Bricolage
Though CPAN makes it possible to write large and powerful applications, distributing those applications can prove daunting. In the case of the Bricolage content management system, though, David Wheeler's installation guide here will walk you through the process. [Oct 28, 2004]
This Fortnight on Perl 6, October 2004
In a stunning achievement, Matt Fowles makes his debut as the new Perl 6 summarizer, covering all three major mailing lists through the first half of October. [Oct 28, 2004]
Perl Code Kata: Testing Taint
Persistently practicing good programming will make you a better programmer. It can be difficult to find small tasks to practice, though. Fear not! Here's a 30-minute exercise to improve your testing abilities and your understanding of Perl's taint mode. [Oct 21, 2004]
FMTYEWTK About Mass Edits In Perl
Though it's a full-fledged programming language now, Perl still has roots in Unix file editing. A hearty set of command-line switches, options, and shortcuts make it possible to process files quickly, easily, and powerfully. Geoff Broadwell explains far more than you ever wanted to know about it. [Oct 14, 2004]
Why Review Code?
Want to become a better programmer? Read good code! How do you know what's good code and where to start? Luke Schubert demonstrates how to pull ideas out of code by exploring Math::Complex. [Oct 7, 2004]
Don't Be Afraid to Drop the SOAP
Web services may be unfortunately trendy, but having a simple API for other people to use your application is very powerful and useful. Is SOAP the right way to go? Sam Tregar describes an alternate approach he's pulled from working the Bricolage and Krang APIs. [Sep 30, 2004]
This Week on Perl 6, Week Ending 2004-09-24
Piers Cawley has the latest from the Perl 6 mailing lists. The perl6-compiler list discusses rule engine flexibility, the Parrot people discuss the Parrot versions of Forth, Tcl, and Python as well as lexical pads, and the Perl 6 Language list argues about what being in the core really means. [Sep 28, 2004]
Building a Finite State Machine Using DFA::Simple. [Sep 23, 2004]
This Week on Perl 6, Week Ending 2004-09-17
Piers Cawley has the latest from the Perl 6 mailing lists. The perl6-compiler list discusses grammar bootstrapping, the Parrot people debate namespaces again, and the Perl 6 Language list ponders the freshly updated Synopsis 5. [Sep 23, 2004]
Embedded Databases. [Sep 16, 2004]
This Week on Perl 6, Week Ending 2004-09-10
Piers Cawley has the latest from the Perl 6 mailing lists. The perl6-compiler list makes its introduction as Parrot people argue about configuration and namespaces and play Minesweeper and the Perl 6 language list continues to discuss Synopsis 9. [Sep 16, 2004]
Lightning Articles
Got something to say about Perl, but don't want to stretch it out to a full perl.com article? In the tradition of lightning talks, we now present lightning articles! [Sep 9, 2004]
This Week on Perl 6, Week Ending 2004-09-03
Piers Cawley has the latest from the Perl 6 mailing lists. The Parrot folks create some TODOs, hash out math semantics, and discuss cross-compiling. The Perl 6 language folks argue about ranges, roles, pipelines, and PRE and POST hooks. [Sep 9, 2004]
Hacking Perl in Nightclubs
By editing Perl programs on-the-fly, in real-time, Alex Mclean is producing some really interesting computer music. He talks to perl.com about how it all works. [Aug 31, 2004]
Content Management with Bricolage
David Wheeler presents an introduction to the Bricolage content management system (CMS). [Aug 27, 2004]
This Week on Perl 6, Week Ending 2004-08-20
Better register spilling, COBOL on Parrot, and a re-examination of lookahead from Apocalypse 12. All this and more in the latest Perl 6 summary. [Aug 26, 2004]
The State of the Onion
Larry Wall's eighth annual State of the Onion address from OSCON 2004 related screensavers to surgery to Perl and the community. [Aug 19, 2004]
Perl Command-Line Options
After looking at special variables, Dave Cross now casts his eye over the impressive range of functionality available from simple command-line options to the Perl interpreter. [Aug 10, 2004]
This Week on Perl 6, Week Ending 2004-07-31
The pie hits! --more-- [Aug 6, 2004]
Giving Lightning Talks
It's conference season, and there's still a chance to sign up for lightning talks. Until now, there were no written rules for giving lighting talks. Mark Fowler explains. [Jul 30, 2004]
Building Applications with POE
In Matt Cashner's second article on POE, he describes how to fit together POE's components into event-driven applications. [Jul 23, 2004]
This Week on Perl 6, Week Ending 2004-07-18
The Piethon benchmark contest is beginning to loom, and the language list discusses how scalars should be interpolated and subscripted. [Jul 23, 2004]
Accessible Software
Jouke Visser demonstrates how to adapt your Perl programs for use by those who have difficulty using a mouse or keyboard. [Jul 15, 2004]
Autopilots in Perl
Jeffrey Goff explains how to connect the X-Plane flight simulator with a Perl console to build new instrument panels, traffic simulators, and even an autopilot in Perl. [Jul 12, 2004]
This Week on Perl 6, Week Ending 2004-07-04
Work begins on a Perl 6 regexp parser, and Unicode manipulation of strings prompts discussion on the language list. [Jul 9, 2004]
This Week on Perl 6, Week Ending 2004-06-27
Getting ready for the Piethon is a major concern, while the language list deals with various ways of modifying and annotating expressions. [Jul 2, 2004]
Application Design with POE
Matt Cashner provides a high-level introduction to POE, the Perl Object Environment, examining the concepts that POE brings to bear when designing long-running Perl applications. [Jul 2, 2004]
This Week on Perl 6, Fortnight Ending 2004-06-21
Arrays and other classes go into the basic Parrot PMC hierarchy, and Dan finally embraces Unicode while perl6-language ... doesn't. [Jun 24, 2004]
Profiling Perl
How do you know what your Perl programs are spending their time doing? How do you know where to start optimizing slow code? The answer to both these questions is "profiling," and Simon Cozens looks at how it's done. [Jun 24, 2004]
Perl's Special Variables
Dave Cross goes back to basics to show how using Perl's special variables can tidy up file-handling code. [Jun 18, 2004]
The Evolution of Perl Email Handling. [Jun 10, 2004]
This Week on Perl 6, Fortnight Ending 2004-06-06
Parrot gets the beginnings of library dynamic loading, and Perl 6 gets a... periodic table? [Jun 9, 2004]
Web Testing with HTTP::Recorder. [Jun 4, 2004]
Return of Quiz of the Week
Mark-Jason Dominus's quiz of the week mailing list is back, and we bring you the questions and solutions for the past week's quizzes. [May 28, 2004]
This Week on Perl 6, Week Ending 2004-05-23
Lots of documentation effort on the Parrot list this week, and some work on the Perl 6 compiler, while on the language list, magical new syntaces for filling hashes... [May 27, 2004]
An Interview with Allison Randal
Allison is President of the Perl Foundation, and project manager for Perl 6. What does that actually mean? We caught up with her to talk about the Foundation, YAPC, and the Perl 6 effort. [May 21, 2004]
Affrus: An OS X Perl IDE
Affrus is a new IDE from Late Nite Software; Simon puts it through its paces to see how it compares to Komodo and his beloved Unix editors. [May 14, 2004]
This Week on Perl 6, Week Ending 2004-05-09
The native call interface raises questions on the internals list; Piers Cawley has the details on this and everything else from the Perl 6 effort. [May 14, 2004]
Building Testing Libraries
Save time, test more, and use what the CPAN has made available to enhance your development. Casey West demonstrates examples of good techniques when testing Perl-based software. [May 7, 2004]
This Week on Perl 6, Week Ending 2004-05-02
The internals list mulls over strings and multi-method dispatch, while Apocalypse 12 continues to intrigue and entertain the language list. [May 7, 2004]
Rapid Web Application Deployment with Maypole : Part 2
We use Maypole to turn last week's product catalogue into a complete web commerce application. [Apr 29, 2004]
This Week on Perl 6, Week Ending 2004-04-25
Now that Apocalypse 12 is out, what do the Perl 6 developers think about it? Piers has all the details... [Apr 29, 2004]
Rapid Web Application Deployment with Maypole
Maypole is a framework for creating web applications; Simon Cozens explains how to set up database-backed applications extremely rapidly. [Apr 22, 2004]
This Fortnight on Perl 6, Weeks Ending 2004-04-18
Parrot gains the beginnings of some Unicode support, causing much fallout; meanwhile, there's a fight over who gets the backtick operator, and what Perl 6 does to recognize and run Perl 5 code. [Apr 22, 2004]
Apocalypse 12
Larry Wall explains how objects and classes are to work in Perl 6. [Apr 16, 2004]
Using Bloom Filters. [Apr 8, 2004]
This week on Perl 6, week ending 2004-04-04
This week, the vexed question of how assignment should work returns, and Piers tries to make sense of continuations; meanwhile, the language list comes alive on the first of April... [Apr 4, 2004]
Photo Galleries with Mason and Imager
One of the major problems with the plethora of photo gallery software available is that very few of them integrate well with existing sites. Casey West comes up with a new approach using Imager and Mason to fit in with Mason sites. [Apr 1, 2004]
This week on Perl 6, week ending 2004-03-28
The language list is relatively quiet, but the Parrot implementors are haunted by continuations this week. Piers has the full story. [Mar 28, 2004]
Making Dictionaries with Perl
Sean Burke is a linguist who helps save dying languages by creating dictionaries for them. He shows us how he uses Perl to layout and print these dictionaries. [Mar 25, 2004]
This week on Perl 6, week ending 2004-03-21
Concerns about embedding and a new release of Tcl on Parrot occupy the internals mailing list, while the language list experiences some surprise about changes to the hash subscriptor syntax. [Mar 21, 2004]
Synopsis 3
In this synopsis, Luke Palmer provides us with an updated view of Perl 6's operators. [Mar 18, 2004]
This week on Perl 6, week ending 2004-03-14
Benchmarks, Ponie and even Ruby drive on Parrot development this week, while the language team discuss methods that mutate their objects and properties that call actions on variables. [Mar 14, 2004]
Simple IO Handling with IO::All
Perl module author extraordinaire Brian Ingerson demonstrates his latest creation. IO::All ties together almost all of Perl's IO handling libraries in one neat, cohesive package. [Mar 11, 2004]
This week on Perl 6, week ending 2004-03-07
Work on objects for Parrot continues, while the perl6-internals list gets dragged into a discussion about date/time handling; the & multimatching operator appears, and a question about detecting undefined subs on the language list. [Mar 7, 2004]
Distributed Version Control with svk
What started off for Chia-liang Kao as a wrapper around the Subversion version control system rapidly turned into a fully-fledged distributed VCS itself -- all, of course, in Perl. [Mar 4, 2004]
This week on Perl 6, week ending 2004-02-29
More on Parrot's objects, plus some discussion of the Perl 6 release timescale. Will we see Perl 6 this century? [Feb 29, 2004]
Exegesis 7
Damian Conway explains how formatting will work in Perl 6 -- with a twist... [Feb 27, 2004]
This week on Perl 6, week ending 2004-02-22
It had to happen some day - someone wrote obfuscated Parrot assembler. Objects are nearly there, and the fight over "sort" cotinues. [Feb 22, 2004]
Find What You Want with Plucene
Plucene is a Perl port of the Java Lucene search-engine framework. In this article, we'll look at how to use Plucene to build a search engine to index a web site. [Feb 19, 2004]
This week on Perl 6, week ending 2004-02-15
Parrot gains Data::Dumper, sort and nearly system(), while the language list struggles to agree on the best way to represent multi-level and multi-key sorting. [Feb 15, 2004]
Mail to WAP Gateways
Ever needed to quickly check your email while you're away from your computer? Pete Sergeant devises a way to convert a mailbox into a WAP page for you to easily check over the phone. [Feb 13, 2004]
This week on Perl 6, week ending 2004-02-08
This week, the internals team attack the challenges posed by garbage collection and threading, while the Unicode operators debate rages on over at the language list. Piers Cawley has the details. [Feb 8, 2004]
Siesta Mailing List Manager
Majordomo is past its best, and many Perl Mongers groups rely on ezmlm or Mailman. Why isn't there a decent Perl-based mailing list manager? Simon Wistow and others from London.pm decided to do something about it ... and came up with Siesta. [Feb 5, 2004]
This week on Perl 6, week ending 2004-02-01
Lots of little clean-ups done to Parrot this week, while the Perl 6 language design focuses on vector operations and Unicode operators. [Feb 1, 2004]
How We Wrote the Template Toolkit Book ...
When Dave Cross, Andy Wardley, and Darren Chamberlain got together to write the Perl Template Toolkit book, they decided to write it in Plain Old Documentation. Dave shows us how the Template Toolkit itself transformed that for publication. [Jan 30, 2004]
This week on Perl 6, week ending 2004-01-25
The internals list is concerned with threading a smattering of other things; the language list debates vector operators and syntax mangling. Piers, as ever, fills us in. [Jan 25, 2004]
Introducing Mac::Glue
Now that Apple computers are all the rage again, we describe how the technically inclined can use Perl to script Mac applications. [Jan 23, 2004]
Maintaining Regular Expressions
It's easy to get lost in complex regular expressions. Aaron Mackey offers a few tips and an ingenious technique to help you keep things straight. [Jan 16, 2004]
This week on Perl 6, week ending 2004-01-11
Parrot fixes to threading, continuations, the JIT and the garbage collector; the Perl 6 language list discusses traits, roles, and, for some reason, the EU Constitution... [Jan 11, 2004]. [Jan 9, 2004]
This week on Perl 6, week ending 2004-01-04
Dan calls for detailed suggestions for the Parrot threading model, and Piers makes up for the lack of activity in the language list by asking a few key players about their New Year hopes for Perl 6. [Jan 4, 2004]
Blosxoms, Bryars and Blikis
How to add a blog, wiki, or some combination of the two to almost anything. [Dec 18, 2003]
This week on Perl 6, week ending 2003-12-07
Objects all round - Parrot gets objects, and there was much rejoicing. Meanwhile, Larry lifts parts of the veil on the Perl 6 object model. Piers Cawley has the details. [Dec 7, 2003]
How Perl Powers the Squeezebox
The Squeezebox is a hardware-based ethernet and wireless MP3 player from Slim Devices; its server is completely written in Perl, and is open and hackable. We talked to the Squeezebox developers about Perl, open source, and third-party Squeezebox hacking. [Dec 5, 2003]
This week on Perl 6, week ending 2003-11-30
The IMCC has a FAQ, the Perl 6 compiler gets updated to this month's reality, and Larry explains some more about the properties system. Piers Cawley, as ever, summarizes. [Nov 30, 2003]
This fortnight on Perl 6, week ending 2003-11-23
Dan returns from LL3 with new ideas, what "multi" really means, and more on the Perl 6 design philosophy - Piers Cawley sums up two weeks on the Perl 6 and Parrot mailing lists. [Nov 23, 2003]
Perl Slurp-Eaze
Uri Guttman demonstrates several different ways to read and write a file in a single operation, a common idiom that's sometimes misused. [Nov 21, 2003]
Solving Puzzles with LM-Solve
A great many puzzles and games, such as Solitaire or Sokoban, are of the form of a "logic maze" -- you move a board or tableau from state to state until you reach the appropriate goal state. Shlomi Fish presents his Games::LMSolve module, which provides a general representation of such games and an algorithm to solve them. [Nov 17, 2003]
This week on Perl 6, week ending 2003-11-09
People try to get PHP working on Parrot, while the perl6-language list thinks about nesting modules inside of modules. And Piers, dilligent as ever, summarizes all the action for your benefit. [Nov 9, 2003]
Bringing Java into Perl
Phil Crow explains how to use Java code from inside of Perl, using the Inline::Java module. [Nov 7, 2003]
This week on Perl 6, week ending 2003-11-02
A Hallowe'en release, catering for method calls on empty registers, and Parrot gets a HTTP library. (No, really.) Perl 6 and Parrot news from Piers Cawley. [Nov 2, 2003]
Open Guides
Kake Pugh describes how Perl can help you find good beer in London, and many other places, with the OpenGuides collaborative city guides. [Oct 31, 2003]
This week on Perl 6, week ending 2003-10-26
IMCC becomes more important, how objects can get serialized, and the all-important Infocom interpreter: all the latest Parrot news from Piers. [Oct 26, 2003]
Database Programming with Perl
Simon Cozens introduces the DBI module, the standard way for Perl to talk to relational databases. [Oct 23, 2003]
This week on Perl 6, week ending 2003-10-19
A new Parrot pumpking, Larry returns, and the Perl 6 compiler actually starts gathering steam... All this and more in this week's Perl 6 summary. [Oct 19, 2003]
A Chromosome at a Time with Perl, Part 2
In this second article about using Perl in the bioinformatics realm, James Tisdall, author of Mastering Perl for Bioinformatics, continues his discussion about how references can greatly speed up a subroutine call by avoiding making copies of very large strings. He also shows how to bypass the overhead of subroutine calls entirely and how to quantify the behavior of your code by measuring its speed and space usage. [Oct 15, 2003]
This week on Perl 6, week ending 2003-10-12
The perl6-language list remains eerily silent, and Leo Tö [Oct 12, 2003]
A Refactoring Example
Michael Schwern explains how to use refactoring techniques to make code faster. [Oct 9, 2003]
Identifying Audio Files with MusicBrainz
Paul Mison describes one way to use the MusicBrainz database to find missing information about audio tracks. [Oct 3, 2003]
Adding Search Functionality to Perl Applications
Do you write applications that deal with large quantities of data -- and then find you don't know the best way to bring back the information you want? Aaron Trevena describes some simple, but powerful, ways to search your data with reverse indexes. [Sep 25, 2003]
This week on Perl 6, week ending 2003-09-21
The low-down on the 0.0.11 Parrot release, and some blue thinking about clever optimizations - the latest from the Perl 6 world, thanks to our trusty summarizer. [Sep 21, 2003]
Cooking with Perl, Part 3
In this third and final batch of recipes excerpted from Perl Cookbook, 2nd Edition, you'll find solutions and code examples for extracting HTML table data, templating with HTML::Mason, and making simple changes to elements or text. [Sep 17, 2003]
A Chromosome at a Time with Perl, Part 1
If you're a Perl programmer working in the field of bioinformatics, James Tisdall offers a handful of tricks that will enable you to write code for dealing with large amounts of biological sequence data--in this case, very long strings--while still getting satisfactory speed from the program. James is the author of O'Reilly's upcoming Mastering Perl for Bioinformatics. [Sep 11, 2003]
This week on Perl 6, week ending 2003-09-07
This week in Perl 6, the keyed ops question raises its head again, how to dynamically add singleton methods, and why serialisation of objects is hard. [Sep 7, 2003]
Cooking with Perl, Part 2
Learn how to use SQL without a database server, and how to send attachments in email in two new recipes from the second edition of Perl Cookbook. And check back here in two weeks for new recipes on extracting table data, making simple changes to elements or text, and templating with HTML::Mason. [Sep 3, 2003]
This week on Perl 6, week ending 2003-08-31
Continuation passing style, active data, dump PMCs and absolutely nothing at all on the language list. [Aug 31, 2003]
Using Perl to Enable the Disabled
Some people use Perl to help with data munging, database hacking, and scripting menial tasks. Jouke Visser uses Perl to communicate with his disabled daughter. Here he explains what his pVoice software is and how it works. [Aug 23, 2003]
Cooking with Perl
The new edition of Perl Cookbook is about to hit store shelves, so to trumpet its release, we offer some recipes--new to the second edition--for your sampling pleasure. This week learn how to match nested patterns and how to pretend a string is a file. Check back here in the coming weeks for more new recipes on using SQL without a database server, extracting table data, templating with HTML::Mason, and more. [Aug 21, 2003]
This week on Perl 6, week ending 2003-08-17
Python on Parrot is nearly done, what's to do before Parrot 0.1.0, and when should we start writing about Perl 6? Piers Cawley reports on the perl6 mailing lists. [Aug 17, 2003]
Perl Design Patterns, Part 3
Phil Crow concludes his series on patterns in Perl, with a discussion of patterns and objects. [Aug 15, 2003]
Perl Design Patterns, Part 2
Phil Crow continues his series on how some popular patterns fit into Perl programming. [Aug 7, 2003]
This week on Perl 6, week ending 2003-08-03
Piers Cawley brings us news of PHP, Java, and Python ports to the Parrot VM, and more Exegesis 6 fall-out. [Aug 3, 2003]
Exegesis 6
Apocalypse 6 described the changes to subroutines in Perl 6. Exegesis 6 demonstrates what this will mean to you, the average Perl programmer. Damian Conway explains how the new syntax and semantics make for cleaner, simpler, and more powerful code. [Jul 29, 2003]
Overloading
C++ and Haskell do it, Java and Lisp don't; Python does it, and Ruby is almost built on it. What is the allure of operator overloading, and how does it affect Perl programmers? Dave Cross brings us an introduction to overload.pm and the Perl overloading mechanism. [Jul 22, 2003]
This week on Perl 6, week ending 2003-07-20
Threads, Events, code cleanups, and onions top the list of interesting things discussed on the Perl 6 lists this week. Piers Cawley summarizes. [Jul 20, 2003]
State of the Onion 2003
Larry Wall's annual report on the state of Perl, from OSCON 2003 (the seventh annual Perl conference) in Portland, Oregon in July 2003. In this full length transcript, Larry talks about being unreasonable, unwilling, and impossible. [Jul 16, 2003]
How to Avoid Writing Code. [Jul 15, 2003]
This week on Perl 6, week ending 2003-07-13
Ponie and Perl6::Rules impressed Perl 6 summarizer Piers Cawley this week. Read on to find out why. [Jul 13, 2003]
Integrating mod_perl with Apache 2.1 Authentication
It's a good time to be a programmer. Apache 2.1 and mod_perl 2 make it tremendously easy to customize any part of the Apache request cycle. The more secure but still easy-to-use Digest authentication is now widely supported in web browsers. Geoffrey Young demonstrates how to write a custom handler that handles Basic and Digest authentication with ease. [Jul 8, 2003]
This week on Perl 6, week ending 2003-07-06
Building IMCC as
parrot, a better build system, and Perl 6 daydreams (z-code!) were the topics of note on perl6-internals and perl6-language this week, according to OSCON-session dodging summarizer Piers Cawley. [Jul 6, 2003]
Power Regexps, Part II
Simon looks at slightly more advanced features of the Perl regular expression language, including lookahead and lookbehind, extracting multiple matches, and regexp-based modules. [Jul 1, 2003]
Perl 6 Design Philosophy
Perl 6 Essentials is the first book to offer a peek into the next major version of the Perl language. In this excerpt from Chapter 3 of the book, the authors take an in-depth look of some of the most important principles of natural language and their impact on the design decisions made in Perl 6. [Jun 25, 2003]
This week on Perl 6, week ending 2003-06-22
Continuation Passing Shenanigans, evil dlopen() tricks, and controlling method dispatch dominate perl6-internals and perl6-language, according to fearless summarizer Piers Cawley. [Jun 23, 2003]
This week on Perl 6, week ending 2003-06-29
Exceptions, continuations, patches, and reconstituted flying cheeseburgers all dominated discussion on perl6-internals and perl6-language, according to summarizer Piers Cawley. No kidding. [Jun 23, 2003]
Hidden Treasures of the Perl Core, part II
Casey continues to look at some lesser-known modules in the Perl core. [Jun 19, 2003]
This week on Perl 6, week ending 2003-06-15
All the latest from perl6-language, perl6-internals and even the Perl 6 track at YAPC from our regular summariser, Piers Cawley. [Jun 15, 2003]
Perl Design Patterns
The Gang-of-Four Design Patterns book had a huge impact on programming methodologies in the Java and C++ communities, but what do Design Patterns have to say to Perl programmers? Phil Crow examines how some popular patterns fit in to Perl programming. [Jun 13, 2003]
This week on Perl 6, week ending 2003-06-08
IMCC becomes Parrot, continuation passing style, timely destruction YET AGAIN, multi-method dispatch and more. [Jun 8, 2003]
Regexp Power
In this short series of two articles, we'll take a look through some of the less well-known or less understood parts of the regular expression language, and see how they can be used to solve problems with more power and less fuss. [Jun 6, 2003]
This week on Perl 6, week ending 2003-06-01
Much more work on IMCC, method calling syntax in Parrot, coroutines attempt to become threads, compile-time binding, and many more discussions in this week's Perl 6 news - all summaries as usual by the eminent Piers Cawley. [Jun 1, 2003]
Hidden Treasures of the Perl Core
The Perl Core comes with a lot of little modules to help you get your job done. Many of these modules are not well known. Even some of the well known modules have some nice features that are often overlooked. In this article, we'll dive into many of these hidden treasures of the Perl Core. [May 29, 2003]
This week on Perl 6, week ending 2003-05-25
Piers takes a break from traditional English festivities to report on the Perl 6 world: this week, more about timely destruction, the Perl 6 Essentials book, a new layout for PMCs, and a lengthy discussion of coroutines. [May 25, 2003]
Testing mod_perl 2.0
Geoffrey Young examines another area of programming in mod_perl 2.0, testing your mod_perl scripts. [May 22, 2003]
This week on Perl 6, week ending 2003-05-18
Garbage collection versus timely destruction, colors in BASIC, how contexts interact, and whether or not we need a special sigil for objects - it's all talk in the Perl 6 world this week. [May 18, 2003]
CGI::Kwiki
Brian Ingerson's latest Perl module is a new modular implementation of the wiki, a world-editable web site. [May 13, 2003]
This week on Perl 6, week ending 2003-05-11
Perl 6 this week brings us news of managed and unmanaged buffers from Parrot's NCI, stack-walking garbage collection, co-routines, and some really horrible heredoc syntax wrangling. [May 11, 2003]
This week on Perl 6, week ending 2003-05-04
Piers reports on Parrot's calling conventions, the strange case of the boolean type, and much from the Perl 6 lists this week. [May 7, 2003]
2003 Perl Conferences
There are a plethora of Perl conferences on this year; which of them should you go to? I survey the conference scene and make a few recommendations about talks you might want to try and get to see. [May 6, 2003]
This week on Perl 6, week ending 2003-04-27
Memory allocation, NCI, more about types, and changes in the syntax of blocks - all the latest in the Perl 6 world from Piers Cawley. [Apr 27, 2003]
POOL
What do templating, object oriented modules, computational linguistics, Ruby, profiling and oil paintings have in common? They're all part of this introduction to POOL, a tool to make it easier to write Perl modules. [Apr 22, 2003]
This week on Perl 6, week ending 2003-04-20
Piers brings us a summary of much discussion of the proposed Perl 6 type system. [Apr 20, 2003]
Filters in Apache 2.0
Geoffrey Young, co-author of the renowned mod_perl Cookbook, brings us an introduction to Apache mod_perl 2.0, starting with Apache filters. [Apr 17, 2003]
This week on Perl 6, week ending 2003-04-13
Parrot on Win32, roll-backable variables, and properties versus methods. Piers has the scope, uh, scoop. [Apr 13, 2003]
Synopsis 6
Damian Conway and Allison Randal bring you a handy summary of the Perl 6 subroutine and type system, as described in last month's Apocalypse. [Apr 9, 2003]
This week on Perl 6, week ending 2003-04-06
Piers reports on the struggle for documentation, the battle of the threading models, and the victory for equality. [Apr 6, 2003]
Apache::VMonitor - The Visual System and Apache Server Monitor
In Stas' final article in his mod_perl series, we investigate how to monitor the performance and stability of our now fully-tuned mod_perl server using Apache::VMonitor. [Apr 2, 2003]
This week on Perl 6, week ending 2003-03-30
People remain silent about Leo's work, how to do static variables, assignment operators, and more. Piers Cawley has the details. [Mar 30, 2003]
Five Tips for .NET Programming in Perl
One of the most common categories of questions on the SOAP::Lite mailing list is getting Perl SOAP applications to work with .NET services. This article, by Randy J. Ray, coauthor of Programming Web Services with Perl, covers some of the most common traps and considerations that can trip up Perl developers. [Mar 26, 2003]
This week on Perl 6, week ending 2003-03-23
Another PDD, and much discussion of the latest Apocalypse. Piers Cawley, as ever, reports... [Mar 23, 2003]
For Perl Programmers : only
Brian Ingerson's curious new module allows you to specify which version of a module you want Perl to load - and even to install multiple versions at the same time. Let's hear about it from the man himself! [Mar 18, 2003]
This week on Perl 6, week ending 2003-03-16
Parrot 0.10.0 released, the Apocalypse hits, summarizer not quite buried... [Mar 16, 2003]. [Mar 13, 2003]
This week on Perl 6, week ending 2003-03-09
Object specifications and serialization discussion takes over both lists, and Piers narrowly escapes having to summarise the fallout from the Apocalypse already... [Mar 9, 2003]
Apocalypse 6
Larry continues his unfolding of the design of Perl 6 with his latest Apocalypse - this time, how subroutines are defined and called in Perl 6. [Mar 7, 2003]
Improving mod_perl Sites' Performance: Part 8
In the penultimate of Stas Bekman's mod_perl articles, more of those obscure Apache settings which can really speed up your web server. [Mar 4, 2003]
This week on Perl 6, week ending 2003-03-02
IMCC is still a subject of much debate on the perl6-internals list, while tumbleweed drifts through perl6-language. Piers has the details. [Mar 3, 2003]
Genomic Perl
After James Tisdall's "Beginning Perl for Bioinformaticists", has Rex Dwyer come up with a "Beginning Bioinformatics for Perl Programmers"? Simon Cozens reviews "Genomic Perl", with some anticipation... [Feb 27, 2003]
This week on Perl 6, week ending 2003-02-23
More from Piers Cawley on Perl 6, IMCC, Parrot's perfomance and the continuing arrays versus lists saga. [Feb 23, 2003]
Building a Vector Space Search Engine in Perl
Have you ever wondered how search engines work, or how to add one to your program? Maciej Ceglowski walks you through building a simple, fast and effective vector-space search engine. [Feb 19, 2003]
This week on Perl 6, week ending 2003-02-16
Optimizations to the main loops, reflections from the Perl 6 design meeting, arrays versus lists, and much more... [Feb 16, 2003]
Module::Build
Traditionally, modules have been put together with
ExtUtils::MakeMaker. Dave Rolsky describes a more modern solution, and in the first of a two-part series, tells us more about it. [Feb 12, 2003]
This week on Perl 6, week ending 2003-02-09
Beating Python, Parrot objects, shortcutting assignment operators , and much more... [Feb 9, 2003]
Improving mod_perl Sites' Performance: Part 7
In this month's episode of Stas Bekman's mod_perl series, more on how settings in your Apache configuration can make or break performance. [Feb 5, 2003]
This week on Perl 6, week ending 2003-02-02
Packfiles, coroutines, secure sandboxes, Damian takes a break, and much more... [Feb 2, 2003]
Embedding Perl in HTML with Mason
HTML::Mason is my favourite toolkit for building pages out of Perl-based components: can Dave Rolsky and Ken Williams do it justice in their new book? I take a look at "Embedding Perl in HTML with Mason" and find it a mixed bag... [Jan 30, 2003]
This week on Perl 6, week ending 2003-01-26
Problems on OS X, targetting Parrot, the pipeline syntax thread refuses to die, and much more... [Jan 26, 2003]... [Jan 22, 2003]
This week on Perl 6, week ending 2003-01-19
Yet more on dead object detection and pipeline syntax, (surprise!) eval in Parrot, Larry and others need gainfultude, and much more... [Jan 19, 2003]
What's new in Perl 5.8.0
It's been nearly six months since the release of Perl 5.8.0 but many people still haven't upgraded to it. Artur Bergman takes a look at some of the new features it provides and describe why you ought to investigate them for yourself. [Jan 16, 2003]
This week on Perl 6, week ending 2003-01-12
More on dead object detection, pipeline syntax, Perl 6 as a macro language, and much more... [Jan 12, 2003]
This week on Perl 6, weeks ending 2003-01-05
Garbage collection, the Ook! language, variables, values and properties, and much more... [Jan 8, 2003]
Improving mod_perl Sites' Performance: Part 6
In this month's episode of Stas Bekman's mod_perl series, how to correctly fork new processes under mod_perl. [Jan 7, 2003]
How Perl Powers Christmas
We've had some fantastic Perl Success Stories in the past, but this one tops them all: How Perl is used in the distribution of millions of Christmas presents every year. [Dec 18, 2002]
Programming with Mason
Dave Rolsky, coauthor of Embedding Perl in HTML with Mason, offers recipes--adapted from those you'll find in his book--for solving typical Web application problems. [Dec 11, 2002]
This week on Perl 6 (12/02-08, 2002)
Lots of work on IMCC, string literals, zero-indexec arrays, and much more... [Dec 8, 2002]
Improving mod_perl Sites' Performance: Part 5
Stas Bekman continues his series on optimizing mod_perl by examining more ways of saving on shared memory usage. [Dec 4, 2002]
This week on Perl 6 (11/24-12/01, 2002)
C# and Parrot again, various visions, and, well, not all that much more... [Dec 1, 2002]
Class::DBI
Tony Bowden introduces a brilliantly simple way to interface to a relational database using Perl classes and the Class::DBI module [Nov 27, 2002]
This week on Perl 6 (11/17-11/23, 2002)
C# and Parrot, the status of 0.0.9, invocant and topics, string concatenation and much, much more... [Nov 27, 2002]
This week on Perl 6 (11/10-11/17, 2002)
A quick Perl 6 roadmap, plus some JIT improvements, mysterious coredump fixes, continuations, superpositions, invocants, tests, and programming BASIC and Scheme in Parrot. [Nov 21, 2002]
Managing Bulk DNS Zones with Perl
Chris Josephes describes the challenges to system administrators in maintaining forward and reverse DNS records, and how a clever sysadmin can use Perl to automate this often tedious task. [Nov 20, 2002]
This week on Perl 6 (11/03-11/10, 2002)
Bytecode fingerprinting, on_exit() portability, memory washing, invocant and topic naming syntax, Unicode operators, operators, more operators, the supercomma, perl6-documentation, Schwern throws the Virtual Coffee Mug, and much more... [Nov 15, 2002]
Object Oriented Exception Handling in Perl
Arun Udaya Shankar discusses implementing object-oriented exception handling in Perl, using Error.pm. Also covered are the advantages of using exceptions over traditional error handling mechanisms, basic exception handling with eval {}, and the use of Fatal.pm. [Nov 14, 2002]
This week on Perl 6 (10/28-11/03, 2002)
Bytecode formats, "Simon Cozens versus the world", and more... [Nov 6, 2002]
Writing Perl Modules for CPAN
For many years, the Perl community has extolled the virtues of CPAN and re-usable, modular code. But why hasn't there been anything substantial written on how to achieve it? Sam Tregar redresses the balance, and this month's book review looks at how he got on. [Nov 6, 2002]
This week on Perl 6 (10/20-27, 2002)
C# and Parrot, fun with operators, a license change, and more... [Nov 4, 2002]
On Topic
Allison Randal explains the seemingly strange concept of "topic" in Perl 6 - and finds that it's alive and well in Perl 5 too... [Oct 30, 2002]
The Phrasebook Design Pattern
Have you ever written code that uses two languages in the same program? Whether they be human languages or computer languages, the phrasebook design pattern helps you separate them for more maintainable code. [Oct 22, 2002]
This week on Perl 6 (10/7-14, 2002)
A new pumpking, sprintf, insight from Larry, and more... [Oct 16, 2002]
Radiator
Are you fed up with those who think that commercial applications need to be written in an "enterprise" language like Java or C++? So are we, so we spoke to Mike McCauley at Open System Consultants. [Oct 15, 2002]
A Review of Komodo
Simon Cozens takes a look at ActiveState's latest Komodo release, Komodo 2.0. Will this version of the Perl IDE finally convince the hardened emacs and vi users to switch over? [Oct 9, 2002]
This week on Perl 6 (9/30 - 10/6, 2002)
The getting started guide, interfaces, memory allocation, and more... [Oct 6, 2002]
How Hashes Really Work
We're all used to using hashes, and expect them to just work. But what actually is a hash, when it comes down to it, and how do they work? Abhijit explains! [Oct 1, 2002]
This week on Perl 6 (9/23 - 9/29, 2002)
An IMCC update, the Scheme interpreter, lists and list references again, and a load besides... [Sep 29, 2002]
An AxKit Image Gallery
Continuing our look at AxKit, Barrie demonstrates the use of AxKit on non-XML data: images and operating system calls. [Sep 24, 2002]
This week on Perl 6 (9/16 - 9/22, 2002)
The neverending keys thread, lists versus list references, and a load besides... [Sep 22, 2002]
Embedding Web Servers
Web browsers are ubiquitous these days - it's hard to find a machine without one. To make use of a web browser, you need a web server, and they are simple enough to write that you can stick them almost anywhere. [Sep 18, 2002]
This week on Perl 6 (9/9 - 9/15, 2002)
Goals for the next release, arrays and hashes, hypothetical variables, getting more Parrot hackers, and a load besides... [Sep 15, 2002]
Retire your debugger, log smartly with Log::Log4perl!
Michael Schilli describes a new way of adding logging facilities to your code, with the help of the log4perl module - a port of Java's log4j. [Sep 11, 2002]
Writing CGI Applications with Perl
There are roughly four bazillion books on Perl and CGI available at the moment; one of the most recent is Brent Michalski and Kevin Meltzer's Writing CGI Applications with Perl. Kevin and Brent are long-standing members of the Perl community - can they do justice to this troublesome topic? Find out in this month's book review! [Sep 10, 2002]
This week on Perl 6 (9/1 - 9/8, 2002)
Goals for the next release, arrays and hashes, hypothetical variables, getting more Parrot hackers, and a load besides... [Sep 8, 2002]
Going Up?
Perl 5.8.0 brought stable threading to Perl - but what does it mean and how can we use it? Get a lift with Sam Tregar as he creates a multi-threaded simulation. [Sep 4, 2002]
The Fusion of Perl and Oracle
Andy Duncan, the coauthor of Perl for Oracle DBAs, explains that Perl's symbiosis with the Oracle database helped in constructing the Perl DBA Toolkit. He also ponders what Ayn Rand might have thought of these two strange bedfellows. [Sep 4, 2002]
This week on Perl 6 (8/26 - 9/1, 2002)
More talk of garbage collection, the never-ending keys debate, Parrot 0.0.8, lots and lots about regular expressions, and a good deal more... [Sep 1, 2002]
Mail Filtering
Michael Stevens compares two popular mail filtering tools, both written in Perl: ActiveState's PerlMX, and the open source Mail::Audit. How do they stack up? [Aug 27, 2002]
Exegesis 5
Are Perl 6's regular expressions still messing with your head? Never fear, Damian is here - with another Exegesis explaining what real programs using Perl 6 grammars look like. [Aug 22, 2002]
Web Basics. [Aug 20, 2002]
This week on Perl 6 (week ending 2002-08-18)
Much ado about regexes, a pirate parrot, (it had to happen...) and more... [Aug 18, 2002]
Acme::Comment
One of the most requested features for Perl 6 has been multiline comments; Jos Boumans goes one step ahead, and provides the feature for Perl 5. He describes the current hacks people use to get multiline comments, and explains his Acme::Comment module which now supports 44 different commenting styles. [Aug 13, 2002]
This week on Perl 6 (week ending 2002-08-11)
Arrays, Garbage collection, keys, (again) regular expressions on non-strings, and more... [Aug 11, 2002]
Proxy Objects
How do you manage to have circular references without leaking memory? Matt Sergeant shows how it's done, with the Proxy Object pattern. [Aug 7, 2002]
This week on Perl 6 (week ending 2002-08-04)
More ops, JIT v2, Regex speed and more... [Aug 5, 2002]
Improving mod_perl Sites' Performance: Part 4
Your web server may have plenty of memory, but are you making the best use of it? Stas Bekman explains how to optimize Apache and mod_perl for the most efficient memory use. [Jul 30, 2002]
This week on Perl 6 (week ending 2002-07-21)
0.0.7 is released, looking back to 5.005_03, documentation, MANIFEST and more... [Jul 23, 2002]
Graphics Programming with Perl
Martien Verbuggen has produced a fine book on all elements of handling and creating graphics with Perl - we cast a critical eye over it. [Jul 23, 2002]
Improving mod_perl Sites' Performance: Part 3
This week, Stas Bekman explains how to use the Perl and mod_perl benchmarking and memory measurement tools to perform worthwhile optimizations on mod_perl programs. [Jul 16, 2002]
This Week on Perl 6 (8 - 14 Jul 2002)
Second system effect, IMCC, Perl 6 grammar, and much more... [Jul 14, 2002]
A Test::MockObject Illustrated Example
Test::MockObject gives you a way to create unit tests for object-oriented programs, isolating individual object and method behavior. [Jul 10, 2002]
This week on Perl 6 ~(24-30 June 2002)
Processes, iterators, fun with the Perl 6 grammar and more... [Jul 2, 2002]
Taglib TMTOWTDI
Continuing our look at AxKit tag libraries, Barrie explains the use of SimpleTaglib and LogicSheets. [Jul 2, 2002]
Synopsis 5
Confused by the last Apocalypse? Allison Randal and Damian Conway explain the changes in a more succinct form. [Jun 26, 2002]
Improving mod_perl Sites' Performance: Part 2
Before making any optimizations to mod_perl applications, it's important to know what you need to be optimizing. Benchmarks are key to this, and Stas Beckman introduces the important tools for mod_perl benchmarking. [Jun 19, 2002]
Where Wizards Fear To Tread
One of the new features coming in Perl 5.8 will be reliable interpreter threading, thanks primarily to the work of Artur Bergman. In this article, he explains what you need to do to make your Perl modules thread-safe. [Jun 11, 2002]
Apocalypse 5
In part 5 of his design for Perl 6, Larry takes a long hard look at regular expressions, and comes up with some interesting ideas... [Jun 4, 2002]
Improving mod_perl Sites' Performance: Part 1
What do we need to think about when optimizing mod_perl applications? Stas Bekman explains how hardware, software and good programming come into play. [May 29, 2002]
Achieving Closure
What's a closure, and why does everyone go on about them? [May 29, 2002]. [May 22, 2002]
The Perl You Need To Know - Part 3
Stas Bekman finishes his introduction to the basic Perl skills you need to use mod_perl; this week, globals versus lexicals, modules and packages. [May 15, 2002]. [May 7, 2002]
The Perl You Need To Know - Part 2
Stas Bekman continues his mod_perl series by looking at the basic Perl skills you need to use mod_perl; this week, subroutines inside subroutines. [May 7, 2002]
Becoming a CPAN Tester with CPANPLUS
A few weeks ago, Jos Broumans introduced CPANPLUS, his replacement for the CPAN module. In the time since then, development has continued apace, and today's release includes support for automatically testing and reporting bugs in CPAN modules. Autrijus Tang explains how it all works. [Apr 30, 2002]
mod_perl Developer's Cookbook
Geoffrey Young, Paul Lindner and Randy Kobes have produced a new book on mod_perl which claims to teach "tricks, solutions and mod_perl idioms" - how well does it live up to this promise? [Apr 25, 2002]
The Perl You Need To Know
This week, Stas Bekman goes back to basics to explain some Perl topics of interest to his continuing mod_perl series. [Apr 23, 2002]
XSP, Taglibs and Pipelines
In this month's AxKit article, Barrie explains what a "taglib" is, and how to use them to create dynamic pages inside of AxKit. [Apr 16, 2002]
Installing mod_perl without superuser privileges
In his continuing series on mod_perl, Stas Bekman explains how to install a mod_perl-ized Apache on a server even if you don't have root privileges. [Apr 10, 2002]
Exegesis 4
What does the fourth apocalypse really mean to you? A4 explained what control structures would look like in Perl 6; Damian Conway expands on those ideas and presents a complete view of the Perl 6 control flow mechanism. [Apr 2, 2002]
CPAN PLUS
For many years the CPAN.pm module has helped people install Perl modules. But it's also been clunky, fragile and amazingly difficult to use programmatically. Jos Boumans introduces CPANPLUS, his project to change all that. [Mar 26, 2002]
mod_perl in 30 minutes
This week, Stas Bekman shows us how to install and configure mod_perl, and how to start accelerating CGI scripts with Apache::Registry. [Mar 22, 2002]
A Perl Hacker's Foray into .NET
We've all heard about Microsoft's .NET project. What is it, and what does it mean for Perl? [Mar 19, 2002]
Introducing AxKit
This is the first in the series of articles by Barrie Slaymaker on setting up and running AxKit. AxKit is a mod_perl application for dynamically transforming XML. In this first article, we focus on getting started with AxKit. [Mar 13, 2002]
This Week on Perl 6 (3 -9 Mar 2002)
Reworking printf, 0.0.4 imminent, multimethod dispatch, and more... [Mar 12, 2002]
Stopping Spam with SpamAssassin
SpamAssassin and Vipul's Razor are two Perl-based tools that can be used to dramatically reduce the number of junk emails you need to see. [Mar 6, 2002]
These Weeks on Perl 6 (10 Feb - 2 Mar 2002)
information about the .NET CLR and what it means for Parrot people, how topicalizers work in Perl 6, and a rant about the lack of Parrot Design Documents. [Mar 6, 2002]
Why mod_perl?
In the first of a series of articles from mod_perl guru, Stas Bekman, we begin by taking a look at what mod_perl is and what it can do for us. [Feb 26, 2002]
Preventing Cross-site Scripting Attacks
Paul Lindner, author of the mod_perl Cookbook, explains how to secure our sites against Cross-Site Scripting attacks using mod_perl and Apache::TaintRequest. [Feb 20, 2002]. [Feb 12, 2002]
This Fortnight on Perl 6 (27 Jan - 9 Feb 2002)
The Regexp Engine, Mono, Unicode and more... [Feb 12, 2002]
Visual Perl
Most Perl programmers are die-hard command line freaks, but those coming to Perl on Windows may be used to a more graphical way to edit programs. We asked the lead developer of the new Visual Perl plugin for Microsoft Visual Studio to tell us the advantages of a graphical IDE. [Feb 6, 2002]
Beginning PMCs
Parrot promises to give us support for extensible data types. Parrot Magic Cookie classes are the key to extending Parrot and providing support for other languages, and Jeff Goff shows us how to create them. [Jan 30, 2002]
Finding CGI Scripts
Dave Cross explains what to watch out for when choosing CGI scripts to run on your server, and announces a new best-of-breed project for CGI scripting. [Jan 23, 2002]
This Week on Perl 6 (13 - 19 Jan 2002)
Apocalypse 4, Parrot strings, and more... [Jan 23, 2002]
This Week on Perl 6 (6 - 12 Jan 2002)
Parrot has Regexp support! (And more...) [Jan 17, 2002]
Apocalypse 4
In his latest article explaining the design of Perl 6, Larry Wall tackles the syntax of the language. [Jan 15, 2002]
Creating Custom Widgets
Steve Lidie, coauthor of Mastering Perl/Tk, brings us more wisdom from his Tk experience--this time, explaining how to create your own simple widget classes. [Jan 9, 2002]
This Week on Perl 6 (30 December 2001 - 5 Jan 2002)
Generators, Platform Fixes, Output records, and more [Jan 5, 2002]
Beginning Bioinformatics
James Tisdall's new book is great for biochemists eager to get into the bioinformatics world, but what about us Perl programmers? In this article, we turn the tables, and ask what your average Perl programmer needs to know to get into this exciting new growth area. [Jan 2, 2002]
This Week on Perl 6 (23 - 29 December 2001)
JITs, primitives for output, and the PDGF. [Dec 29, 2001]
This Week on Perl 6 (16 - 22 December 2001)
A JIT Compiler, the PDFG, an I/O layer, and much more [Dec 29, 2001]
Building a Bridge to the Active Directory
Kelvin Param explains how Perl provides the glue between Microsoft's Active Directory and non-Windows clients. [Dec 19, 2001]
This Week on Perl 6 (9 - 15 December 2001)
Slice context, troubles with make, aggregates and more... [Dec 19, 2001]
A Drag-and-Drop Primer for Perl/Tk
This article, by Steve Lidie, coauthor of Mastering Perl/Tk, describes the Perl/Tk drag-and-drop mechanism, often referred to as DND. Steve illustrates DND operations local to a single application, where you can drag items from one Canvas to another. [Dec 11, 2001]
This Week on Perl 6 (2 - 8 December 2001)
Parrot 0.0.3, a FAQ, the execution environment and more... [Dec 10, 2001]
An Introduction to Testing
chromatic explains why writing tests is good for your code, and tells you how to go about it. [Dec 4, 2001]
Request Tracker
Do you ever forget what you're supposed to be doing today? Do you have a million and one projects on the go, but no idea where you're up to with them? I frequently get that, and I don't know how I'd get anything at all done if it wasn't for Request Tracker. Robert Spier explains how to use the open-source Request Tracker application to organise teams working on common projects. [Nov 28, 2001]
Lightweight Languages
Simon Cozens reports from this weekend's Lightweight Languages workshop at the MIT AI labs, where leading language researchers and implementors got together to chat about what they're up to. [Nov 21, 2001]
Parsing Protein Domains with Perl
James Tisdall, author of O'Reilly's Beginning Perl for Bioinformatics, shows biologists how to program in Perl using biological data, with downloadable code examples. [Nov 16, 2001]
Create RSS channels from HTML news sites
Chris Ball shows us how to turn any ordinary news site into a Remote Site Summary web service. [Nov 15, 2001]
Object-Oriented Perl
How do you move from an intermediate Perl programmer to an expert? Understanding object-oriented Perl is one key step along the way. [Nov 7, 2001]
The Lighter Side of CPAN
Alex Gough takes us on a whirlwind tour around the more esoteric and entertaining areas of the Comprehensive Perl Archive Network, and makes some serious points about Perl programming at the same time. [Oct 31, 2001]
Perl 6 : Not Just For Damians
Most of what we've heard about Perl 6 has come from either Larry or Damian. But what do average Perl hackers think about the proposed changes? We asked Piers Cawley for his opinions. [Oct 23, 2001]
This Week on p5p 2001/10/21
What's left before 5.8.0, the POD specification, test-fu and more. [Oct 21, 2001] - here's your chance to find out. [Oct 17, 2001]
Filtering Mail with PerlMx
PerlMx is ActiveState's Perl plug-in for Sendmail; in the first article in a new series, Mike DeGraw-Bertsch shows us how to begin building a mail filter to trap spam. [Oct 10, 2001]
This Week on p5p 2001/10/07
Code cleanups, attributes, tests from chromatic, and more... [Oct 10, 2001]
Exegesis 3
Damian Conway puts Larry's third Apocalypse to work and explains what it means for the budding Perl 6 programmer. [Oct 3, 2001]
Apocalypse 3
Larry Wall brings us the next installment in the unfolding of Perl 6's design. [Oct 2, 2001]
Asymmetric Cryptography in Perl. [Sep 26, 2001]
Parrot : Some Assembly Required. [Sep 18, 2001]
wxPerl: Another GUI for Perl
Jouke Visse brings us a new tutorial on how to use wxPerl to create good-looking GUIs for Perl programs. [Sep 12, 2001]
This Week on Perl 6 (2 - 8 September 2001)
Lexical insertion, lots of new documentation, and more... [Sep 8, 2001]
Changing Hash Behaviour with
tie
Hashes are one of the most useful data structures Perl provides, but did you know you can make them even more useful by changing the way they work? Dave Cross shows us how it's done [Sep 4, 2001]
This Week on p5p 2001/09/03
Michael Schwern, Coderefs in @INC (again), localising things, and more... [Sep 3, 2001]
This Week on Perl 6 (26 August - 1 September 2001)
Parameter passing, the latest on Parrot, finalization and more... [Sep 1, 2001]
Perl Helps The Disabled, to speak and to better use her computer. Jon's talk received a grand reception, not only for his clever use of Perl, but for a remarkably unselfish application of his skills. [Aug 27, 2001]
This Week on Perl 6 (19 - 25 August 2001)
Closures, more work on the internals, method signatures and more... [Aug 27, 2001]
This Week on p5p 2001/08/27
vstrings, callbacks, coderefs in @INC, and more... [Aug 27, 2001]
Choosing a Templating System
Perrin Harkins takes us on a grand tour of the most popular text and HTML templating systems. [Aug 21, 2001]
This Week on Perl 6 (12 - 18 August 2001)
Modules, work on the internals, language discussion and more... [Aug 21, 2001]
This Week on p5p 2001/08/15
POD specification, Unicode work, threading and more! [Aug 15, 2001]
Yet Another Perl Conference Europe 2001
A review of this year's YAPC::Europe in Amsterdam. [Aug 13, 2001]
This Week in Perl 6 (5 - 11 August 2001)
Damian's slides, more on properties and more [Aug 11, 2001]
This Fortnight In Perl 6 (July 22 - Aug. 4, 2001)
The Perl Conference 5.0 synopsis, ideas from the mailing lists, and more. [Aug 9, 2001]
This Week on p5p 2001/08/07
Subroutine Prototypes, the Great SDK Debate, and much more! [Aug 8, 2001]... [Aug 8, 2001]
People Behind Perl : Artur Bergman
We continue our series on the People Behind Perl with an interview with Artur Bergman, the driving force behind much of the work on Perl's new threading model. While the model was created by Gurusamy Sarathy, Artur's really spent a lot of good time and effort making iThreads usable to the ordinary Perl programmer. Artur tells us about what got him into Perl development, and what he's doing with threads right now. [Aug 1, 2001]
This Week on p5p 2001/07/30
Hash "clamping", a meeting of the perl-5 porters at TPC, and more! [Aug 1, 2001]. [Jul 25, 2001]
Mail Filtering with Mail::Audit
Does your e-mail still get dumped into a single Inbox because you haven't taken the time to figure out the incantations required to make procmail work? Simon Cozens shows how you can easily write mail filters in something you already know: Perl. [Jul 17, 2001]
This Week on p5p 2001/07/16
5.7.2 is out, some threading fixes, and much more. [Jul 16, 2001]
Symmetric Cryptography in Perl
What do you think of when you hear the word "cryptography"? Big expensive computers? Men in black helicopters? PGP or GPG encrypting your mail? Maybe you don't think of Perl. Well, Abhijit Menon-Sen says you should. He's the author of a bunch of the Crypt:: modules, and he explains how to use Perl to keep your secrets... secret. [Jul 10, 2001]
This Week on p5p 2001/07/09
No 5.8.0 yet, numeric hackery, worries about PerlIO and much more. [Jul 9, 2001]
This Fortnight in Perl 6 (17 - 30 June 2001)
A detailed summary of a recent Perl vs. Java battle, a discussion on the internal API for strings, and much more. [Jul 3, 2001]. [Jul 3, 2001]
This Week on p5p 2001/07/02
Module versioning and testing, regex capture-to-variable, and much more. [Jul 2, 2001]
Why Not Translate Perl to C?
Mark-Jason Dominus explains why it might not be any faster to convert your code to a C program rather than let the Perl interpreter execute it. [Jun 27, 2001]
This Week on p5p 2001/06/25
5.7.2 in sight, some threads on regular expression, and much more. [Jun 25, 2001]. [Jun 21, 2001]
This Week in Perl 6 (10 - 16 June 2001)
Even More on Unicode and Regexes, Multi-Dimensional Arrays and Relational Databases, and much more. [Jun 19, 2001]
This Week on p5p 2001/06/17
Miscellaneous Darwin Updates, hash accessor macros, and much more. [Jun 19, 2001]
The O'Reilly and Perl.com privacy policy [Jun 15, 2001]
Parse::RecDescent Tutorial
Parse::RecDescent is a recursive descent parser generator designed to help to Perl programmers who need to deal with any sort of structured data,from configuration files to mail headers to almost anything. It's even been used to parse other programming languages for conversion to Perl. [Jun 13, 2001]
The Beginner's Attitude of Perl: What Attitude?
Robert Kiesling says that the Perl Community's attitude towards new users is common fare for Internet development and compared to other lists Perl is downright civil. [Jun 12, 2001]
This Week on p5p 2001/06/09
Removing dependence on strtol, regex negation, and much more. [Jun 12, 2001]
This Week in Perl 6 (3 - 9 June 2001)
A discussion on the interaction of properties with use strict, continuing arguements surrounding regular expressions, and much more. [Jun 12, 2001]
Having Trouble Printing Code Examples?
Info for those who can't get Perl.com articles to print out correctly [Jun 11, 2001]
About perl.com
[Jun 7, 2001]. [Jun 5, 2001]
This Week in Perl 6 (27 May - 2 June 2001)
Coding Conventions Revisited, Status of the Perl 6 Mailing Lists, and much more. [Jun 4, 2001]
This Week on p5p 2001/06/03
Improving the Perl test suite, Warnings crusade, libnet in the core, and much more. [Jun 4, 2001]
Turning the Tides on Perl's Attitude Toward Beginners
Casey West is taking a stand against elitism in the Perl community and seems to be making progress. He has launched several new services for the Perl beginner that are being enthusiastically received. [May 28, 2001]
This Week on p5p 2001/05/27
Attribute tieing, Test::Harness cleanup, and much more. [May 27, 2001]
Taking Lessons From Traffic Lights
Michael Schwern examines traffic lights and shows what lessons applied to the development of Perl 6 [May 22, 2001]
This Month on Perl6 (1 May - 20 May 2001)
Perl 6 Internals, Meta, Language, Docs Released, and much more. [May 21, 2001]
Exegesis 2
Having trouble visualizing how the approved RFC's for Perl 6 will translate into actual Perl code? Damian Conway provides and exegesis to Larry Wall's Apocalypse 2 and reveals what the code will look like. [May 15, 2001]
This Week on p5p 2001/05/13
The to-do list, safe signals, release numbering and much more. [May 13, 2001]
This Week on p5p 2001/05/20
Internationalisation, Legal FAQ, and much more. [May 6, 2001]
This Week on p5p 2001/05/06
iThreads, Relocatable Perl, Module License Registration, and much more. [May 6, 2001]. [May 3, 2001]
This Week on p5p 2001/04/29
MacPerl 5.6.1, Licensing Perl modules, and much more. [Apr 29, 2001]
Quick Start Guide with SOAP Part Two
Paul Kulchenko continues his SOAP::Lite guide and shows how to build more comples SOAP servers. [Apr 23, 2001]
This Week on p5p 2001/04/22
Modules in the core, Kwalitee control, and much more. [Apr 22, 2001]
MSXML, It's Not Just for VB Programmers Anymore
Shawn Ribordy puts the tech back into the MSXML parser by using Perl instead of Visual Basic. [Apr 17, 2001]
This Week on p5p 2001/04/15
perlbug Administration, problems with tar, and much more. [Apr 15, 2001]
Designing a Search Engine
Pete Sergeant discusses two elements of designing a search engine: how to store and retrieve data efficiently, and how to parse search terms. [Apr 10, 2001]
This Week on p5p 2001/04/08
Perl 5.6.1 and Perl 5.7.1 Released(!), and much more. [Apr 8, 2001]
Apocalypse 1: The Ugly, the Bad, and the Good
With breathless expectation, the Perl community has been waiting for Larry Wall to reveal how Perl 6 is going to take shape. In the first of a series of "apocalyptic" articles, Larry reveals the ugly, the bad, and the good parts of the Perl 6 design process. [Apr 2, 2001]
This Week on p5p 2001/04/02
Perl and HTML::Parser, Autoloading Errno, Taint testing, and much more. [Apr 2, 2001]
This Week on p5p 2001/04/01
Perl and HTML::Parser, Autoloading Errno, Taint testing, and much more. [Apr 1, 2001]
A Simple Gnome Panel Applet
Build a useful Gnome application in an afternoon! Joe Nasal explains some common techniques, including widget creation, signal handling, timers, and event loops. [Mar 27, 2001]
This Week on p5p 2001/03/26
use Errno is broken, Lexical Warnings, Scalar repeat bug, and much more. [Mar 26, 2001]
This Month on Perl6 (25 Feb--20 Mar 2001)
Internal Data Types, API Conventions, and GC once again. [Mar 21, 2001]
DBI is OK
chromatic makes a case for using DBI and shows how it works well in the same situations as DBIx::Recordset. [Mar 20, 2001]
This Week on p5p 2001/03/19
Robin Houston vs. goto, more POD nits, and much more. [Mar 19, 2001]
Creating Modular Web Pages With EmbPerl
If you have ever wished for an "include" HTML tag to reuse large chunks of HTML, you are in luck. Neil Gunton explains how Embperl solves the problem. [Mar 13, 2001]
This Week on p5p 2001/03/12
Pod questions, patching perly.y, EBCDIC and Unicode, plus more. [Mar 12, 2001]
Writing GUI Applications in Perl/Tk
Nick Temple shows how to program a graphical Point-of-Sale application in Perl, complete with credit card processing. [Mar 6, 2001]
This Week on p5p 2001/03/05
Coderef @INC, More Memory Leak Hunting, and more. [Mar 5, 2001]
This Week on p5p 2001/02/26
Overriding +=, More Big Unicode Wars, and more. [Feb 28, 2001]
DBIx::Recordset VS DBI
Terrance Brannon explains why DBI is the standard database interface for Perl but should not be the interface for most Perl applications requiring database functionality. [Feb 27, 2001]
The e-smith Server and Gateway: a Perl Case Study
Kirrily "Skud" Robert explains the Perl behind the web-based administrator for the e-smith server. [Feb 20, 2001]
This Week on p6p 2001/02/18
A revisit to RFC 88, quality assurance, plus more. [Feb 18, 2001]
Perl 6 Alive and Well! Introducing the perl6-mailing-lists Digest
Perl.com will be supplying you with the P6P digest, covering the latest news on the development of Perl 6. [Feb 14, 2001]
This Week on p5p 2001/02/12
Perl FAQ updates, memory leak plumbing, and more. [Feb 14, 2001]
Pathologically Polluting Perl
Brian Ingerson introduces Inline.pm and CPR; with them you can embed C inside Perl and turn C into a scripting language. [Feb 6, 2001]
This Week on p5p 2001/02/06
Perl 5.6.1 not delayed after all, MacPerl, select() on Win32, and more. [Feb 6, 2001]
This Week on p5p 2001/01/28
5.6.x delayed, the hashing function, PerlIO programming documentation, and more. [Jan 30, 2001]. [Jan 29, 2001]
This Week on p5p 2001/01/21
Safe signals; large file support; pretty-printing and token reporting. [Jan 24, 2001]
Creating Data Output Files Using the Template Toolkit
Dave Cross explains why you should add the Template Toolkit to your installation of Perl and why it is useful for more than just dynamic web pages. [Jan 23, 2001]
A Beginner's Introduction to POE
Interested in event-driven Perl? Dennis Taylor and Jeff Goff show us how to write a simple server daemon using POE, the Perl Object Environment. [Jan 17, 2001]
This Week on p5p 2001/01/14
Unicode is stable! Big performance improvements! Better lvalue subroutine support! [Jan 15, 2001]
Beginners Intro to Perl - Part 6
Doug Sheppard shows us how to activate Perl's built in security features. [Jan 9, 2001]
This Fortnight on p5p 2000/12/31
Unicode miscellany; lvalue functions. [Jan 9, 2001]
This Week on p5p 2000/12/24
5.6.1 trial release; new repository browser; use constant [Dec 27, 2000]
What every Perl programmer needs to know about .NET
A very brief explanation of Microsoft's .NET project and why it's interesting. [Dec 19, 2000]
Beginners Intro to Perl - Part 5
Doug Sheppard discusses object-oriented programming in part five of his series on beginning Perl. [Dec 18, 2000]
This Week on p5p 2000/12/17
More Unicode goodies; better arithmetic; faster object destruction. [Dec 17, 2000]
Why I Hate Advocacy
Are you an effective Perl advocate? Mark Dominus explains why you might be advocating Perl the wrong way. [Dec 12, 2000]
This Week on p5p 2000/12/10
Unicode support almost complete! Long standing destruction order bug fixed! Rejoice! [Dec 11, 2000]
Beginners Intro to Perl - Part 4
Doug Sheppard teaches us CGI programming in part four of his series on beginning Perl. [Dec 6, 2000]
This Week on p5p 2000/12/03
Automatic transliteration of Russian; syntactic oddities; lvalue subs. [Dec 4, 2000]
Programming GNOME Applications with Perl - Part 2
Simon Cozens shows us how to use Perl to develop applications for Gnome, the Unix desktop environment. [Nov 28, 2000]
Red Flags Return
Readers pointed out errors and suggested more improvements to the code in my 'Red Flags' articles. As usual, there's more than one way to do it! [Nov 28, 2000]
This Week on p5p 2000/11/27
Enhancements to for, map, and grep; Unicode on Big Iron; Low-Hanging Fruit. [Nov 27, 2000]
Beginner's Introduction to Perl - Part 3
The third part in a new series that introduces Perl to people who haven't programmed before. This week: Patterns and pattern matching. If you weren't sure how to get started with Perl, here's your chance! [Nov 20, 2000]
This Week on p5p 2000/11/20
Major regex engine enhancements; more about
perlio; improved
subs.pm. [Nov 20, 2000]
This Week on p5p 2000/11/14
lstat _; more about
perlio; integer arithmetic. [Nov 14, 2000]
Program Repair Shop and Red Flags. [Nov 14, 2000]
Beginner's Introduction to Perl - Part 2
The second part in a new series that introduces Perl to people who haven't programmed before. This week: Files and strings. If you weren't sure how to get started with Perl, here's your chance! [Nov 7, 2000]
This Week on p5p 2000/11/07
Errno.pm error numbers; more self-tying; stack exhaustion in the regex engine. [Nov 7, 2000]
Hold the Sackcloth and Ashes
Jarkko Hietaniemi, the Perl release manager, responds to the critique of the Perl 6 RFC process. [Nov 3, 2000]
Critique of the Perl 6 RFC Process
Many of the suggestions put forward during the Perl 6 request-for-comment period revealed a lack of understanding of the internals and limitations of the language. Mark-Jason Dominus offers these criticisms in hopes that future RFCs may avoid the same mistakes -- and the wasted effort. [Oct 31, 2000]
This Week on p5p 2000/10/30
More Unicode; self-tying; Perl's new built-in standard I/O library. [Oct 30, 2000]
Last Chance to Support Damian Conway
As reported earlier, the Yet Another Society (YAS) is putting together a grant to Monash University, Australia. The grant will fund Damian Conway's full-time work on Perl for a year. But the deadline for pledges is the end of the week, and the fund is still short. [Oct 26, 2000]
State of the Onion 2000
Larry Wall's annual report on the state of Perl, from TPC 4.0 (the fourth annual Perl conference) in Monterey in July 2000. In this full length transcript, Larry talks about the need for changes, which has led to the effort to rewrite the language in Perl 6. [Oct 24, 2000]
These Weeks on p5p 2000/10/23
Perl's Unicode model; sfio; regex segfaults; naughty
use vars calls.
Beginner's Introduction to Perl
The first part in a new series that introduces Perl to people who haven't programmed before. If you weren't sure how to get started with Perl, here's your chance! [Oct 16, 2000]
Programming GNOME Applications with Perl
Simon Cozens shows us how to use Perl to develop applications for Gnome, the Unix desktop environment. [Oct 16, 2000]
This Week on p5p 2000/10/08
Self-tying is broken; integer and floating-point handling; why
unshiftis slow. [Oct 8, 2000]
Report from YAPC::Europe
Mark Summerfield tells us what he saw at YAPC::Europe in London last weekend. [Oct 2, 2000]
How Perl Helped Me Win the Office Football Pool
Walt Mankowski shows us how he used Perl to make a few extra bucks at the office. [Oct 2, 2000]
Ilya Regularly Expresses
Ilya Zakharevich, a major contributor to Perl 5, talks about Perl 6 effort, why he thinks that Perl is not well-suited for text manipulation, and what changes would make it better; whether the Russian education system is effective; and whether Perl 6 is a good idea. [Sep 20, 2000]
Sapphire
Can one person rewrite Perl from scratch? [Sep 19, 2000]
Guide to the Perl 6 Working Groups
Perl 6 discussion and planning are continuing at a furious rate and will probably continue to do so, at least until next month when Larry announces the shape of Perl 6 at the Linux Expo. In the meantime, here's a summary of the main Perl 6 working groups and discussion lists, along with an explanation of what the groups are about. [Sep 5, 2000]
Damian Conway Talks Shop
The author of Object-Oriented Perl talks about the Dark Art of programming, motivations for taking on projects, and the "deification" of technology. [Aug 21, 2000]
Report from the Perl Conference
One conference-goer shares with us his thoughts, experiences and impressions of TPC4. [Aug 21, 2000]
Report on the Perl 6 Announcement
At the Perl conference, Larry announced plans to develop Perl 6, a new implementation of Perl, starting over from scratch. The new Perl will fix many of the social and technical deficiencies of Perl 5. [Jul 25, 2000]
Reports from YAPC 19100
Eleven attendees of Yet Another Perl Conference write in about their experiences in Pittsburgh last month. [Jul 11, 2000]
Choosing a Perl Book
What to look for when choosing from the many Perl books on the market. [Jul 11, 2000]
This Week on p5p 2000/07/09
The Perl bug database;
buildtoc; proposed
use namespacepragma; a very clever Unicode hack. [Jul 9, 2000]
This Week on p5p 2000/07/02
Lots of Unicode; method lookup optimizations;
my __PACKAGE__ $foo. [Jul 2, 2000]
Notes on Doug's Method Lookup Patch
Simon Cozens explains the technical details of a patch that was sent to p5p this month. [Jun 27, 2000]
This Week on p5p 2000/06/25
More method call optimization; tr///CU is dead; Lexical variables and eval; perlhacktut. [Jun 25, 2000]
This Week on p5p 2000/06/18
Method call optimizations; more bytecode; more unicode source files; EPOC port. [Jun 17, 2000]
Return of Program Repair Shop and Red Flags
My other 'red flags' article was so popular that once again I've taken a real program written by a genuine novice and shown how to clean it up and make it better. I show how to recognize some "red flags" that are early warning signs that you might be doing some of the same things wrong in your own programs. [Jun 17, 2000]
Adventures on Perl Whirl 2000
Adam Turoff's report on last week's Perl Whirl cruise to Alaska [Jun 13, 2000]
This Week on p5p 2000/06/11
Unicode byte-order marks in Perl source code; many not-too-difficult bugs for entry-level Perl core hackers. [Jun 13, 2000]
ANSI Standard Perl?
Standardized Perl? Larry Rosler, who put the ANSI in ANSI C, shares his thoughts on how Perl could benefit from standards in this interview with Joe Johnston. [Jun 6, 2000]
This Week on p5p 2000/06/04
Farewell to Ilya Zakharevich; bytecode compilation; optimizations to
map. [Jun 4, 2000]
This Week on p5p 2000/05/28
Regex engine alternatives and optimizations;
eqand UTF8; Caching of
get*by*functions; Array interpolation semantics. [May 28, 2000]
This Week on p5p 2000/05/21
What happened on the perl5-porters mailing list between 15 and 21 May, 2000 [May 21, 2000]
Pod::Parser Notes
Brad Appleton, author of the
Pod::Parsermodule suite, responds to some of the remarks in an earlier perl5-porters mailing list summary. [May 20, 2000]
Perl Meets COBOL
I taught a Perl class to some IBM mainframe programmers whose only experience was in COBOL, and got some surprises. [May 15, 2000]
This Week on p5p 2000/05/14
What happened on the perl5-porters mailing list between 8 and 14 May, 2000 [May 14, 2000]
This Week on p5p 2000/05/07
What happened on the perl5-porters mailing list between 1 and 7 May, 2000 [May 7, 2000]
Program Repair Shop and Red Flags. [May 2, 2000]
This Week on p5p 2000/04/30
What happened on the perl5-porters mailing list between 24 and 30 April, 2000 [Apr 30, 2000]
This Week on p5p 2000/04/23
What happened on the perl5-porters mailing list between 17 and 23 April, 2000 [Apr 23, 2000]
What's New in 5.6.0.
After two years in the making, we look at new features of Perl, including support for UTF-8 Unicode and Internet address constants. [Apr 18, 2000]
POD is not Literate Programming
[Mar 20, 2000]
My Life With Spam: Part 3
In the third part of a tutorial on how to filter spam, Mark-Jason Dominus reveals how he relegates mail to his "losers list, blacklist and whitelist." [Mar 15, 2000]
This Week on p5p 2000/03/05
What happened on the perl5-porters mailing list between 28 February and 5 March, 2000 [Mar 5, 2000]
Ten Perl Myths
Ten things that people like to say about Perl that aren't true. [Feb 23, 2000]
My Life With Spam
In the second part of a tutorial on how to filter spam, Mark-Jason Dominus shows what to do with spam once you've caught it. [Feb 9, 2000]
RSS and You
RSS is an XML application that describes web sites as channels, which can act as feeds to a user's site. Chris Nandor explains how to use RSS in Perl and how he uses it to build portals. [Jan 25, 2000]
In Defense of Coding Standards
Perl programmers may bristle at the idea of coding standards. Fear not: a few simple standards can improve teamwork without crushing creativity. [Jan 12, 2000]
This Week on p5p 1999/12/26
What happened on the perl5-porters mailing list between 20 and 26 December, 1999 [Dec 26, 1999]
Virtual Presentations with Perl
This year, the Philadelphia Perl Mongers had joint remote meetings with Boston.pm and St. Louis.pm using teleconferencing equipment to bring a guest speaker to many places at once. Adam Turoff describes what worked and what didn't, and how you can use this in your own PM groups. [Dec 20, 1999]
This Week on p5p 1999/12/19
What happened on the perl5-porters mailing list between 13 and 19 December, 1999 [Dec 19, 1999]
Happy Birthday Perl!
According to the perlhist man page, Perl was first released twelve years ago, on December 18, 1987. Congratulations to Larry Wall on the occasion of Perl's twelfth birthday! [Dec 18, 1999]
This Week on p5p 1999/12/12
What happened on the perl5-porters mailing list between 6 and 12 December, 1999 [Dec 12, 1999]
This Week on p5p 1999/12/05
What happened on the perl5-porters mailing list between 29 November and 5 December, 1999 [Dec 5, 1999]
Sins of Perl Revisited
Tom Christiansen published the original seven sins in 1996. Where are we now? [Nov 30, 1999]
This Week on p5p 1999/11/28
What happened on the perl5-porters mailing list between 22 and 28 November, 1999 [Nov 28, 1999]
This Week on p5p 1999/11/21
What happened on the perl5-porters mailing list between 15 and 21 November, 1999 [Nov 21, 1999]
Perl as a First Language
Simon Cozens, author of the upcoming Beginning Perl talks about Perl as a language for beginning programmers. [Nov 16, 1999]
This Week on p5p 1999/11/14
What happened on the perl5-porters mailing list between 8 and 14 November, 1999 [Nov 14, 1999]
This Week on p5p 1999/11/07
What happened on the perl5-porters mailing list between 1 and 7 November, 1999 [Nov 7, 1999]
This Week on p5p 1999/10/31
What happened on the perl5-porters mailing list between 25 and 31 October, 1999 [Nov 3, 1999]
A Short Guide to DBI
Here's how to get started using SQL and SQL-driven databases from Perl. [Oct 22, 1999]
Happy Birthday Perl 5!
[Oct 18, 1999]
This Week on p5p 1999/10/17
What happened on the perl5-porters mailing list between 11 and 17 October, 1999 [Oct 17, 1999]
This Week on p5p 1999/10/24
What happened on the perl5-porters mailing list between 18 and 24 October, 1999 [Oct 17, 1999]
Perl/Tk Tutorial
On Perl.com, we are presenting this as part of what we hope will be an ongoing series of articles, titled "Source Illustrated." The presentation by Lee and Brett is a wonderfully concise example of showing annotated code and its result. [Oct 15, 1999]
Topaz: Perl for the 22nd Century
Chip Salzenberg, one of the core developers of Perl, talks about Topaz, a new effort to completely rewrite the internals of Perl in C++. The complete version of his talk (given at the 1999 O'Reilly Open Source Conference) is also available in Real Audio. [Sep 28, 1999]
Open Source Highlights
An open source champion inside Chevron writes about his visit to the Open Source Conference. [Sep 28, 1999]
Bless My Referents
Damian Conway explains how references and referents relate to Perl objects, along with examples of how to use them when building objects. [Sep 16, 1999]
White Camel Awards
An interview with White Camel Award winners Kevin Lenzo and Adam Turoff. [Sep 16, 1999]
3rd State of the Onion
Larry explains the "good chemistry" of the Perl community in his third State of the Onion speech. [Aug 30, 1999]
Perl Recipe of the Day
Each day, we present a new recipe from The Perl Cookbook, the best-selling book by Tom Christiansen and Nathan Torkington. [Aug 26, 1999]
Common Questions About CPAN
Answers to the most common questions asked from cpan@perl.org [Jul 29, 1999]
A New Edition of
Welcome to the new edition of! We've redesigned the site to make it easier for you to find the information you're looking for. [Jul 15, 1999]
Dispatch from YAPC
Brent was at YAPC -- were you? He reports from this "alternative" Perl conference. [Jun 30, 1999]
White Camel Awards to be Presented at O'Reilly's Perl Conference 3.0
The White Camel awards will be presented to individuals who have made outstanding contributions to Perl Advocacy, Perl User Groups, and the Perl Community at O'Reilly's Perl onference 3.0 on August 24, 1999. [Jun 28, 1999]
Microsoft to Fund Perl Development
ActiveState Tool Corp. has a new three-year agreement with Microsoft that funds new development of Perl for the Windows platform. [Jun 9, 1999]
Perl and CGI FAQ
This FAQ answers questions for Web developers. [Apr 14, 1999]
Perl, the first postmodern computer language
Larry Wall's talk at Linux World justifies Perl's place in postmodern culture. He says that he included in Perl all the features that were cool and left out all those that sucked. [Mar 9, 1999]
Success in Migrating from C to Perl
How one company migrated from using C to Perl -- and in doing so was able to improve their approach to code design, maintenance and documentation. [Jan 19, 1999]
What the Heck is a Perl Monger?!
Want to start or find a Perl user group in your area? Brent interviews brian d foy, the creator of Perl Mongers to find out just what the Mongers are all about. [Jan 13, 1999]
Y2K Compliance
Is someone asking you to ensure that your Perl code is Y2k compliant? Tom Christiansen gives you some answers, which may not completely please the bureaucrats. [Jan 3, 1999]
XML::Parser Module Enables XML Development in Perl
The new Perl module known as XML::Parser allows Perl programmers building applications to use XML, and provides an efficient, easy way to parse XML documents. [Nov 25, 1998]
A Zero Cost Solution
Creating a task tracking system for $0 in licensing fees, hardware, and software costs. [Nov 17, 1998]
Perl Rescues a Major Corporation
How the author used Perl to create a document management system for a major aerospace corporation and saved the day. [Oct 21, 1998]
A Photographic Journal
Photographs taken at the Perl Conference by Joseph F. Ryan: Perl Programmer at the National Human Genome Research Institute. [Aug 27, 1998]
Perl's Prospects Are Brighter Than Ever
Jon Udell's summary of the Perl Conference. [Aug 26, 1998]
2nd State of the Onion
Larry Wall's keynote address from 1998 Perl Conference. There is also a RealAudio version. [Aug 25, 1998]
The Final Day at The Perl Conference
Brent Michalski winds down his coverage of the Perl Conference. Highlights include: Tom Paquin's Keynote: "Free Software Goes Mainstream" and Tom Christiansen's "Perl Style". [Aug 21, 1998]
Day 3: Core Perl Developers at Work and Play
Recapping Larry Wall's Keynote, The OO Debate, The Internet Quiz Show, The Perl Institue and The Perl Night Life. [Aug 20, 1998]
Day 2: Perl Mongers at The Conference
Another exciting day! Brent talks about the Advanced Perl Fundamentals tutorial, the concept behind the Perl Mongers and the Fireside Chat with Jon Orwant. [Aug 19, 1998]
Day 1 Highlights: Lincoln's Cool Tricks and Regexp
Brent Michalski reports on the highlights of the first day of The Perl Conference. [Aug 18, 1998]
Perl Conference 3.0 -- The Call for Participation
This is a call for papers that demonstrate the incredible diversity of Perl. Selected papers will be presented at the third annual O'Reilly Perl Conference on August 21-24, 1999 at the Doubletree Hotel and Monterey Conference Center in Monterey California. [Aug 17, 1998]
How Perl Creates Orders For The Air Force
Brent Michalski, while in the Air Force, created a Web-based system written in Perl to simplify the process of ordering new hardware and software. [Jul 22, 1998]
Perl Builder IDE Debuts
A review of Perl Builder, the first integrated development environment (IDE)for Perl. [Jul 22, 1998]
MacPerl Gains Ground
MacPerl gains a foothold on a machine without a command-line interface. Rich Morin of Prime Time Freeware and Matthias Neeracher, the programmer who ported Perl to the Macintosh, talk about what makes MacPerl different. [Jun 3, 1998]
Perl Support for XML Developing
O'Reilly & Associates hosted a recent Perl/XML summit to discuss ways that Perl can support the Extensible Markup Language (XML), a new language for defining document markup and data formats. [Mar 10, 1998]
The Culture of Perl
In this keynote address for the first Perl Conference, Larry Wall talks about the key ideas that influence him and by extension the Perl culture. [Aug 20, 1997]
The Artistic License
This document states the conditions under which a Package may be copied, such that the Copyright Holder maintains some semblance of artistic control over the development of the package [Aug 15, 1997] | http://www.perl.com/all_articles.csp | crawl-002 | refinedweb | 18,578 | 68.91 |
Working with View Models in RavenDB
Modern app developers often work with conglomerations of data cobbled together to display a UI page. For example, you've got a web app that displays tasty recipes, and on that page you also want to display the author of the recipe, a list of ingredients and how much of each ingredient. Maybe comments from users on that recipe, and more. We want pieces of data from different objects, and all that on a single UI page.
For tasks like this, we turn to view models. A view model is a single object that contains pieces of data from other objects. It contains just enough information to display a particular UI page.
In relational databases, the common way to create view models is to utilize multiple JOIN statements to piece together disparate data to compose a view model.
But with RavenDB, we're given new tools which enable us to work with view models more efficiently. For example, since we're able to store complex objects, even full object graphs, there's less need to piece together data from different objects. This opens up some options for efficiently creating and even storing view models. Raven also gives us some new tools like Transformers that make working with view models a joy.
In this article, we'll look at a different ways to work with view models in RavenDB. I'll also give some practical advice on when to use each approach.
The UI
We're building a web app that displays tasty recipes to hungry end users. In this article, we'll be building a view model for a UI page that looks like this:
At first glance, we see several pieces of data from different objects making up this UI.
- Name and image from a Recipe object
- List of Ingredient objects
- Name and email of a Chef object, the author of the recipe
- List of Comment objects
- List of categories (plain strings) to help users find the recipe
A naive implementation might query for each piece of data independently: a query for the Recipe object, a query for the Ingredients, and so on.
This has the downside of multiple trips to the database and implies performance overhead. If done from the browser, we're looking at multiple trips to the web server, and multiple trips from the web server to the database.
A better implementation makes a single call to the database to load all the data needed to display the page. The view model is the container object for all these pieces of data. It might look something like this:
/// <summary> /// View model for a Recipe. Contains everything we want to display on the Recipe details UI page. /// </summary> public class RecipeViewModel { public string RecipeId { get; set; } public string Name { get; set; } public string PictureUrl { get; set; } public List<Ingredient> Ingredients { get; set; } public List<string> Categories { get; set; } public string ChefName { get; set; } public string ChefEmail { get; set; } public IList<Comment> Comments { get; set; } }
How do we populate such a view model from pieces of data from other objects?
How we've done it in the past
In relational databases, we tackle this problem using JOINs to piece together a view model on the fly:
// Theoretical LINQ code to perform a JOIN against a relational database. public RecipeViewModel GetRecipeDetails(string recipeId) { var recipeViewModel = from recipe in dbContext.Recipes where recipe.Id == 42 join chef in dbContext.Chefs on chef.Id equals recipe.ChefId let ingredients = dbContext.Ingredients.Where(i => i.RecipeId == recipe.Id) let comments = dbContext.Comments.Where(c => c.RecipeId == recipe.Id) let categories = dbContext.Categories.Where(c => c.RecipeId == recipeId) select new RecipeViewModel { RecipeId = recipe.Id Name = recipe.Name, PictureUrl = recipe.PictureUrl, Categories = categories.Select(c => c.Name).ToList(), ChefEmail = chef.Email, ChefName = chef.Name, Ingredients = ingredients.ToList(), Comments = comments.ToList() }; return recipeViewModel; }
It's not particularly beautiful, but it works. This pseudo code could run against some object-relational mapper, such as Entity Framework, and gives us our results back.
However, there are some downsides to this approach.
- Performance: JOINs and subqueries often have a non-trivial impact on query times. While JOIN performance varies per database vendor, per the type of column being joined on, and whether there are indexes on the appropriate columns, there is nonetheless a cost associated with JOINs and subqueries. Queries with multiple JOINs and subqueries only add to the cost. So when your user wants the data, we're making him wait while we perform the join.
- DRY modeling: JOINs often require us to violate the DRY (Don't Repeat Yourself) principle. For example, if we want to display Recipe details in a different context, such as a list of recipe details, we'd likely need to repeat our piece-together-the-view-model JOIN code for each UI page that needs our view model.
Can we do better with RavenDB?
Using .Include
Perhaps the easiest and most familiar way to piece together a view model is to use RavenDB's .Include.
// Query for the honey glazed salmon recipe // and .Include the related Chef and Comment objects. var recipe = ravenSession.Query<Recipe>() .Include(r => r.ChefId) .Include(r => r.CommentIds) .Where(r => r.Name == "Sweet honey glazed salmon") .First(); // No extra DB call here; it's already loaded into memory via the .Include calls. var chef = ravenSession.Load<Chef>(recipe.ChefId); // Ditto. var comments = ravenSession.Load<Comment>(recipe.CommentIds); var recipeViewModel = new RecipeViewModel { RecipeId = recipe.Id, Name = recipe.Name, PictureUrl = recipe.PictureUrl, ChefEmail = chef.Email, ChefName = chef.Name, Comments = comments.ToList(), Ingredients = recipe.Ingredients, Categories = recipe.Categories };
In the above code, we make a single remote call to the database and load the Recipe and its related objects.
Then, after the Recipe returns, we can call session.Load to fetch the already-loaded related objects from memory.
This is conceptually similar to a JOIN in relational databases. Many devs new to RavenDB default to this pattern out of familiarity.
Better modeling options, fewer things to .Include
One beneficial difference between relational JOINs and Raven's .Include is that we can reduce the number of .Include calls due to better modeling capabilities. RavenDB stores our objects as JSON, rather than as table rows, and this enables us to store complex objects beyond what is possible in relational table rows. Objects can contain encapsulated objects, lists, and other complex data, eliminating the need to .Include related objects.
For example, logically speaking, .Ingredients should be encapsulated in a Recipe, but relational databases don't support encapsulation. That is to say, we can't easily store a list of ingredients per recipe inside a Recipe table. Relational databases would require us to split a Recipe's .Ingredients into an Ingredient table, with a foreign key back to the Recipe it belongs to. Then, when we query for a recipe details, we need to JOIN them together.
But with Raven, we can skip this step and gain performance. Since .Ingredients should logically be encapsulated inside a Recipe, we can store them as part of the Recipe object itself, and thus we don't have to .Include them. Raven allows us to store and load Recipe that encapsulate an .Ingredients list. We gain a more logical model, we gain performance since we can skip the .Include (JOIN in the relational world) step, and our app benefits.
Likewise with the Recipe's .Categories. In our Tasty Recipes app, we want each Recipe to contain a list of categories. A recipe might contain categories like ["italian", "cheesy", "pasta"]. Relational databases struggle with such a model: we'd have to store the strings as a single delimited string, or as an XML data type or some other non-ideal solution. Each has their downsides. Or, we might even create a new Categories table to hold the string categories, along with a foreign key back to their recipe. That solution requires an additional JOIN at query time when querying for our RecipeViewModel.
Raven has no such constraints. JSON documents tend to be a better storage format than rows in a relational table, and our .Categories list is an example. In Raven, we can store a list of strings as part of our Recipe object; there's no need to resort to hacks involving delimited fields, XML, or additional tables.
RavenDB's .Include is an improvement over relational JOINs. Combined with improved modeling, we're off to a good start.
So far, we've looked at Raven's .Include pattern, which is conceptually similiar to relational JOINs. But Raven gives us additional tools that go above and beyond JOINs. We discuss these below.
Transformers
RavenDB provides a means to build reusable server-side projections. In RavenDB we call these Transformers. We can think of transformers as a C# function that converts an object into some other object. In our case, we want to take a Recipe and project it into a RecipeViewModel.
Let's write a transformer that does just that:
/// <summary> /// RavenDB Transformer that turns a Recipe into a RecipeViewModel. /// </summary> public class RecipeViewModelTransformer : AbstractTransformerCreationTask<Recipe> { public RecipeViewModelTransformer() { TransformResults = }; } }
In the above code, we're accepting a Recipe and spitting out a RecipeViewModel. Inside our Transformer code, we can call .LoadDocument to load related objects, like our .Comments and .Chef. And since Transformers are server-side, we're not making extra trips to the database.
Once we've defined our Transformer, we can easily query any Recipe and turn it into a RecipeViewModel.
// Query for the honey glazed salmon recipe // and transform it into a RecipeViewModel. var recipeViewModel = ravenSession.Query<Recipe>() .TransformWith<RecipeViewModelTransformer, RecipeViewModel>() .Where(r => r.Name == "Sweet honey glazed salmon") .First();
This code is a bit cleaner than calling .Include as in the previous section; there are no more .Load calls to fetch the related objects.
Additionally, using Transformers enables us to keep DRY. If we need to query a list of RecipeViewModels, there's no repeated piece-together-the-view-model code:
// Query for all recipes and transform them into RecipeViewModels. var allRecipeViewModels = ravenSession.Query<Recipe>() .TransformWith<RecipeViewModelTransformer, RecipeViewModel>() .ToList();
Storing view models
Developers accustomed to relational databases may be slow to consider this possibility, but with RavenDB we can actually store view models as-is.
It's certainly a different way of thinking. Rather than storing only our domain roots (Recipes, Comments, Chefs, etc.), we can also store objects that contain pieces of them. Instead of only storing models, we can also store view models.
var recipeViewModel = new RecipeViewModel { Name = "Sweet honey glazed salmon", RecipeId = "recipes/1", PictureUrl = "", Categories = new List<string> { "salmon", "fish", "seafood", "healthy" }, ChefName = "Swei D. Sheff", ChefEmail = "borkbork@bork.com", Comments = new List<Comment> { new Comment { Name = "Dee Liteful", Content = "I really enjoyed this dish!" } }, Ingredients = new List<Ingredient> { new Ingredient { Name = "salmon fillet", Amount = "5 ounce" } } }; // Raven allows us to store complex objects, even whole view models. ravenSession.Store(recipeViewModel);
This technique has benefits, but also trade-offs:
- Query times are faster. We don't need to load other documents to display our Recipe details UI page. A single call to the database with zero joins - it's a beautiful thing!
- Data duplication. We're now storing Recipes and RecipeViewModels. If an author changes his recipe, we may need to also update the RecipeViewModel. This shifts the cost from query times to write times, which may be preferrable in a read-heavy system.
The data duplication is the biggest downside. We've effectively denormalized our data at the expense of adding redundant data. Can we fix this?
Storing view models + syncing via RavenDB's Changes API
Having to remember to update RecipeViewModels whenever a Recipe changes is error prone. Responsibility for syncing the data is now in the hands of you and the other developers on your team. Human error is almost certain to creep in -- someone will write new code to update Recipes and forget to also update the RecipeViewModels -- we've created a pit of failure that your team will eventually fall into.
We can improve on this situation by using RavenDB's Changes API. With Raven's Changes API, we can subscribe to changes to documents in the database. In our app, we'll listen for changes to Recipes and update RecipeViewModels accordingly. We write this code once, and future self and other developers won't need to update the RecipeViewModels; it's already happening ambiently through the Changes API subscription.
The Changes API utilizes Reactive Extensions for a beautiful, fluent and easy-to-understand way to listen for changes to documents in Raven. Our Changes subscription ends up looking like this:
// Listen for changes to Recipes. // When that happens, update the corresponding RecipeViewModel. ravenStore .Changes() .ForDocumentsOfType<Recipe>() .Subscribe(docChange => this.UpdateViewModelFromRecipe(docChange.Id));
Easy enough. Now whenever a Recipe is added, updated, or deleted, we'll get notified and can update the stored view model accordingly.
Indexes for view models: let Raven do the hard work
One final, more advanced technique is to let Raven do the heavy lifting in mapping Recipes to RecipeViewModels.
A quick refresher on RavenDB indexes: in RavenDB, all queries are satisfied by an index. For example, if we query for Recipes by .Name, Raven will automatically cretate an index for Recipes-by-name, so that all future queries will return results near instantly. Raven then intelligently manages the indexes it's created, throwing server resources behind the most-used indexes. This is one of the secrets to RavenDB's blazing fast query response times.
RavenDB indexes are powerful and customizable. We can piggy-back on RavenDB's indexing capabilities to generate RecipeViewModels for us, essentially making Raven do the work for us behind the scenes.
First, let's create a custom RavenDB index:
/// <summary> /// RavenDB index that is run automatically whenever a Recipe changes. For every recipe, the index outputs a RecipeViewModel. /// </summary> public class RecipeViewModelIndex : AbstractIndexCreationTask<Recipe> { public RecipeViewModelIndex() { Map = }; StoreAllFields(Raven.Abstractions.Indexing.FieldStorage.Yes); } }
In RavenDB, we use LINQ to create indexes. The above index tells RavenDB that for every Recipe, we want to spit out a RecipeViewModel.
This index definition is similiar to our transformer definition. A key difference, however, is that the transformer is applied at query time, whereas the index is applied asynchronously in the background as soon as a change is made to a Recipe. Queries run against the index will be faster than queries run against the transformer: the index is giving us pre-computed RecipeViewModels, whereas our transformer would create the RecipeViewModels on demand.
Once the index is deployed to our Raven server, Raven will store a RecipeViewModel for each Recipe.
Querying for our view models is quite simple and we'll get results back almost instantaneously, as the heavy lifting of piecing together the view model has already been done.
// Load up the RecipeViewModels stored in our index. var recipeViewModel = ravenSession.Query<RecipeViewModel, RecipeViewModelIndex>() .Where(r => r.Name == "Sweet honey glazed salmon") .ProjectFromIndexFieldsInto<RecipeViewModel>() .First();
Now whenever a Recipe is created, Raven will asynchronously and intelligently execute our index and spit out a new RecipeViewModel. Likewise, if a Recipe, Comment, or Chef is changed or deleted, the corresponding RecipeViewModel will automatically be updated. Nifty!
Storing view models is certainly not appropriate for every situation. But some apps, especially read-heavy apps with a priority on speed, might benefit from this option. I like that Raven gives us the freedom to do this when it makes sense for our apps.
Conclusion
In this article, we looked at using view models with RavenDB. Several techniques are at our disposal:
- .Include: loads multiple related objects in a single query.
- Transformers: reusable server-side projections which transform Recipes to RecipeViewModels.
- Storing view models: Essentially denormalization. We store both Recipes and RecipeViewModels. Allows faster read times at the expense of duplicated data.
- Storing view models + .Changes API: The benefits of denormalization, but with code to automatically sync the duplicated data.
- Indexes: utilize RavenDB's powerful indexing to let Raven denormalize data for us automatically, and automatically keeping the duplicated data in sync. The duplicated data is stashed away as fields in an index, rather than as distinct documents.
For quick and dirty scenarios and one-offs, using .Include is fine. It's the most common way of piecing together view models in my experience, and it's also familiar to devs with relational database experience. And since Raven allows us to store things like nested objects and lists, there is less need for joining data; we can instead store lists and encapsulated objects right inside our parent objects where it makes sense to do so.
Transformers are the next widely used. If you find yourself converting Recipe to RecipeViewModel multiple times in your code, use a Transformer. They're easy to write, typically small, and familiar to anyone with LINQ experience. Using them in your queries is a simple one-liner that keeps your query code clean and focused.
Storing view models is rarely used, in my experience, but it can come in handy for read-heavy apps or for UI pages that need to be blazing fast. Pairing this with the .Changes API is an appealing way to automatically keep Recipes and RecipeViewModels in sync.
Finally, we can piggy-back off Raven's powerful indexing feature to have Raven automatically create, store, and synchronize both RecipeViewModels for us. This has a touch of magical feel to it, and is an attractive way to get great performance without having to worry about keeping denormalized data in sync.
Using these techniques, RavenDB opens up some powerful capabilities for the simple view model. App performance and code clarity benefit as a result. | https://ravendb.net/articles/working-with-view-models | CC-MAIN-2017-09 | refinedweb | 2,941 | 57.98 |
To find your Hollywood Walk of Fame Quarantine house, use this script on the command line, providing your latitude and longitude:
$ python quarantine-house.py 40.7484 -73.9856 Humphrey Bogart Patrick Swayze Ozzy Osbourne Kathy Bates Earth, Wind and Fire
The code is based on this earlier post about the "What N Things" geocoding application.
The possible names are taken from a subset of the list of people who have stars on the Hollywood Walk of Fame. The text file is hollywood-list.txt.
import sys import math # Settings: the resolution is 10^(-ires) and we use m words. ires = 10000 ndp = int(math.log10(ires)) m = 5 # Read the word list words = [line.strip() for line in open('hollywood-list '\n'('\n') print(decode(code))
Comments are pre-moderated. Please be patient and your comment will appear soon.
There are currently no comments
New Comment | https://scipython.com/blog/covid-19-quarantine-house-hollywood-walk-of-fame-edition/ | CC-MAIN-2021-39 | refinedweb | 147 | 66.74 |
Plone Folderish Content Types And References
This little walk through will illustrate some of the principles for building a folderish content type and for using references. For me there was quite a lot of new things I had to learn in order to understand these concepts. I really try to remain a minimalist and only introduce one new concept at a time with the minimal effort. However, this tutorial introduces at least two new concepts: folderish content types and references. They do not necessarily have to be combined like this - I only do it because it suits my way of wanting to implement this specific family of content types.
Since the documentation of Plone sometimes lags I got the tip to use something called DocFinderTab (see [1] for downloads and so on). The DocFinderTab allows you to see the names of all functions you can use on an object and how to call them. This is similar to SourceDiving but you get a lot for free instead of having to scan through thousands of source code files distributed over at least three platforms.
You can download the product explained in this tutorial here: [2], enjoy.
Goal
I want to create a network where the nodes and edges are content types that all together build up some kind of network. Also I want them to be forced to live inside a special network folder.
Files Used
Still trying to be a frugalist this tutorial includes the usual four files and two skins-files:
__init__.py config.py message.py Extensions/Install.py skins/mynetwork/networkfolder_view.pt skins/mynetwork/node_view.pt
Please note the more intelligent approach to installing the different classes using better "factory registration code" in Extensions/Install.py (hint provided by ritz):
def addToFactoryTool(self, out): print >> out, 'portal_factory modifications started.' ftool = getToolByName(self, 'portal_factory') if ftool: portal_factory_types = ftool.getFactoryTypes().keys() for portalType in [ typeDict['portal_type'] for typeDict in listTypes(PROJECTNAME) ]: if portalType not in portal_factory_types: portal_factory_types.append(portalType) ftool.manage_setPortalFactoryTypes(listOfTypeIds=portal_factory_types) print >> out, ' %s now uses portal_factory' % portalType print >> out, 'portal_factory modifications done.'
Classes used
I have three classes:
- network folder
- node
- edge
The network folder class
The code in the network folder is quite condensed and contains two methods: one for getting a list of nodes, and one for a list of edges in the folder. This is the code:
class NetworkFolder(BaseFolder): "A folder to put nodes and edges in." schema = BaseSchema.copy() + Schema(()) allowed_content_types = ('node', 'edge') filter_content_types = 1 _at_rename_after_creation = True def edges(self): "Get edges contained in this folder." output = list() for item in self.listFolderContents(): if isinstance(item, edge): if item.getNode_a() != None and item.getNode_b() != None: output.append(item) output.sort() output.reverse() return output def nodes(self): "Get nodes contained in this folder." output = list() for item in self.listFolderContents(): if isinstance(item, node): output.append(item) output.sort() output.reverse() return output registerType(NetworkFolder, PROJECTNAME)
These two lines are of particular interest:
allowed_content_types = ('node', 'edge') filter_content_types = 1
The first one says: "if we filter the content then only allow nodes and edges" and the second one says"filter the contents". This results in "only allow nodes and edges" :)
This is what it looks like when you add a network folder:
And inside the folder we can now only add nodes and edges:
The node class
The code for the node is almost as minimal as you can make a content type I guess:
class node(BaseContent): """An Archetype for nodes (only allowed in a network folder)""" schema = BaseSchema.copy() + Schema(()) _at_rename_after_creation = True global_allow = 0 registerType(node, PROJECTNAME)
Of particular interest here is the line containing global_allow = 0 - this line informs the system to not allow nodes to be placed anywhere. This is matched with code in the network folder to allow nodes in there.
Adding a node is simple: just insert a title:
The edge class
It is the edge class where all the action takes place. In short an edge is a content type with two reference fields (see for example [3] for some hints on the reference field and also [4] for hints on the reference browser widget).
As you will see the principal layout of the edge is two sets of nodes, node_a and node_b (very original names). For this class I use the reference browser widget in order to get a convenient "popup" when selecting the nodes a and b. In short the syntax is something like this:
ReferenceField('node_a', widget=ReferenceBrowserWidget(... ), ... ),
All the code for the entire class:
class edge(BaseContent): """An Archetype for edges""" # Schema definition schema = BaseSchema.copy() + Schema(( ReferenceField('node_a', widget=ReferenceBrowserWidget( label="start node", destination=".", destination_types=("node",), ), required = 1, relationship='start', allowed_types= ("node",), ), ReferenceField('node_b', widget=ReferenceBrowserWidget( label="end node", destination=".", destination_types=("node",), ), required = 1, relationship='end', allowed_types= ("node",), ), )) global_allow = 0 _at_rename_after_creation = True registerType(edge, PROJECTNAME)
This is what it looks like when you edit or create an edge:
And this is the reference browser widget in action:
Just add page templates
If you haven't looked into zopes TAL and METAL languages this is a great opportunity to do so (one of many guides on the web is this one: [5] it's quite short, simple and explains one thing at a time, also this one seems nice: [6] ).
node view page template
As you might have guessed if you have read Plone Archetypes View Template Modifications I will not modify more macros than I must. In the node case this is only the body-macro. So the body-macro part of node_view.pt is the following:
<metal:body_macro metal: <b><span tal:name</span></b> is a part of: <ul> <metal tal: <li><a tal: edge</a></li> </metal> </ul> </metal:body_macro>
I find these files a bit hard to understand since the lines are often quite long. This is also a bad example for you if this is the first time you read a pt-file; it uses tal:replace, tal:content, tal:attributes and tal:repeat. Also it mixes the "python:"-syntax and the "context/"-syntax.
In live example the above code is be interpreted into:
<b>Home</b> is a part of: <ul> <metal> <li><a href="[long url]">drive home by car and get stuck in a jam</a></li> </metal> <metal> <li><a href="[long url]">regular train from Sundbyberg to Home</a></li> </metal> <metal> <li><a href="[long url]">really slow Swedbus from Stockholm C to Home</a></li> </metal> </ul>
So this is what happens:
- tal:replace: for example """<span tal: name</span>""" is converted to "Home". As you can see the span-tag is completely replaced (remember: we used tal:replace, so this might not come as a surprise) with the Title of the current object (the context).
- tal:content: like in """<a [...] tal: edge </a>"" is transformed into """<a href="[long url]">regular train from Sundbyberg to Home</a>""". It might not be a complete surprise that content-means the stuff inside the starting and finishing tags.
- tal:attributes: is a simi-colon separated listing of attributes you want. If you only need one as in """<a tal:""".
- tal:repeat creates a loop and defines a variable that is (most likely) different in each iteration. So """<metal tal:""" loops over the list created by "context/getBRefs" and in each iteration the variable edge is used. This does not generate any code in itself - but aids in the generation of lists for example - as in the example above.
As you might have already guessed "context/getBRefs" is important here. As you saw above in the edge schema we had reference fields. Also these reference fields "points" to nodes. You might think that nodes then have no idea if they are pointed to or not - but they do. The object is aware of its "back references". To get the back references of an item you can call the function getBRefs (there is also a synonym of this function called something like getBackReferences).
By now I hope you have figured out what we are doing by this code. By using the back references we get a list of the edges a particular node is part of. So when viewing a node you should now see something like this:
network folder view page template
In the network folder view I want to replace the folder listing macro with a custom view of the folder. I first want to see all edges including their start and finish node. Then I want to see all nodes and all edges each node is part of. Also I want lots and lots of links.
This is about half of the file networkfolder_view.pt:
<metal:folderlisting_macro metal: <h2> The <span tal:42</span> edges in <span tal:</span> </h2> <metal tal: <p> <img tal: <b><a tal:edge</a>:</b> <a tal:start</a> » <a tal:target</a> </p> </metal> <!-- MORE HERE --> </metal:folderlisting_macro>
One thing that I have found to be confusing is the mix of python code (like """<span tal:42</span>""") and tal/tales/metal code (like """<span tal:</span>""") in the same file. This is just something you have to live with. I guess it is preferable to avoid python code if possible since it is easier to brake things with python - but sometimes that is impossible.
Code that might be new here is for example:
- <img tal:: a nice way to get and display the icon of a content type.
- <a tal:attributes="href python:edge.getNode_a().reference_url()" [...]>: this is used inside a loop where the loop variable is called edge to get the node a of the edge and then to get the url to that node. Nice for creating the links I want.
Viewing the folder should now look something like this:
Final remarks
There are more things you can do with folderish content types, the reference field, the reference browser widget and references. I hope this frugalist approach is complete but not bloated.
Download
See also Plone Cms
This page belongs in Kategori Programmering | http://pererikstrandberg.se/blog/index.cgi?page=PloneFolderishContentTypesAndReferences | CC-MAIN-2017-39 | refinedweb | 1,674 | 60.24 |
by Angela Caicedo
Jump into programming the next big thing using embedded Java.
In my 10 years as a Java evangelist, I’ve never been more excited about a Java release. Not only is Java 8 a great release with cool new features in the language itself, but it also provides great things on the embedded side, great optimizations, and really small specifications. If you are a Java developer and ready to jump with me into the new wave of machine-to-machine technology—better said, into programming the next big thing—let’s get started with the Internet of Things (IoT).
Before you get started with embedded programming, you need to understand exactly what you are planning to build and where you are planning to run your application. This is critical, because there are different flavors of embedded Java that will fit your needs perfectly.
If you are looking to build applications similar to the ones you run on your desktop, or if you are looking for great UIs, you need to take a look at Oracle Java SE Embedded, which is derived from Java SE. It supports the same platforms and functionality as Java SE. Additionally, it provides specific features and supports additional platforms, it has small-footprint Java runtime environments (JREs), it supports headless configurations, and it has memory optimizations.
Oracle Java SE Embedded supports the same platforms and functionality as Java SE.
On the other hand, if you are looking for an easy way to connect peripherals, such as switches, sensors, motors, and the like, Oracle Java ME Embedded is your best bet. It has the Device Access API, which defines APIs for some of the most common peripheral devices that can be found in embedded platforms: general-purpose input/output (GPIO), inter-integrated circuit (I2C) bus, serial peripheral interface (SPI) bus, analog-to-digital converter (ADC), digital-to-analog converter (DAC), universal asynchronous receiver/transmitter (UART), memory-mapped input/output (MMIO), AT command devices, watchdog timers, pulse counters, pulse-width modulation (PWM) generators, and generic devices.
The Device Access API is not present in Oracle Java SE Embedded (at least not yet), so if you still want to use Oracle Java SE Embedded and also work with peripherals, you have to rely on external APIs, such as Pi4J.
In term of devices, embedded Java covers an extremely wide range from conventional Java SE desktop and server platforms to the STMicroelectronics STM32F4DISCOVERY board, Raspberry Pi, and Windows. For this article, I’m going to use the Raspberry Pi, not only because it’s a very powerful credit-card-size single-board computer, but also because it’s very affordable. The latest model costs only US$35.
In order to boot, the Raspberry Pi requires a Linux image on a Secure Digital (SD) memory card. There is no hard drive for the computer. Instead, an SD card stores the Linux image that the computer runs when it is powered on. This SD memory card also acts as the storage for other applications loaded onto the card.
To configure your SD card, perform the following steps:
Once you have your SD card ready, you can turn on your Raspberry Pi. The first time you boot your Raspberry Pi, it will take you to the Raspberry Pi Software Configuration Tool to perform some basic configuration. Here are the additional tasks you should perform:
Expand Filesystemoption.
Internationalisationoption.
Advancedoption from the main menu.
/etc/ network/interfacesfile. An example of this file is shown in Figure 1.
Now you are ready to connect to the Raspberry Pi. One option is to use PuTTY. An example of how to connect is shown in Figure 2.
Figure 2
Now, this is where you decide the kind of application you want to run on your device. I personally love having fun with peripherals, so in this article I’m going to use Oracle Java ME Embedded, so I can leverage the Device Access API. But remember, you can also run Oracle Java SE Embedded on your Raspberry Pi.
Installing the Oracle Java ME Embedded binary on the Raspberry Pi is very simple. Just use FTP to transfer the Raspberry Pi distribution zip file from your desktop to the Raspberry Pi over the SSH connection. Then unzip the file into a new directory, and you’re done.
One great option for creating your embedded application is using the NetBeans IDE with the Java ME SDK. Combining these two allows you to test your application, even before you run it on your device, by using an emulator. You will be able to automatically transfer your code and execute it on your Raspberry Pi, and you can even debug it on the fly. All you need to ensure is that the Java ME SDK is part of the Java platforms on your IDE. You need to enable the SDK in the NetBeans IDE by selecting
Tools->Java Platforms, clicking
Add Platform, and then specifying the directory that contains the SDK.
In order to remotely manage your embedded applications on your Raspberry Pi, you need to have the Application Management System (AMS) running. Through SSH, simply execute the following command:
pi@raspberrypi sudo javame8ea/bin/usertest.sh
Oracle Java ME Embedded applications look exactly like other Java ME applications. Listing 1 shows the simplest example you can have.
public class Midlet extends MIDlet { @Override public void startApp() { System.out.println("Started..."); } @Override public void destroyApp(boolean unconditional) { System.out.println("Destroyed..."); } }
Listing 1
Your application must inherit from the
MIDlet class, and it should override two lifecycle methods:
startApp and
destroyApp. These two methods will be invoked when the application gets started and just before it gets destroyed. The code in Listing 1 just prints a text message on the device console.
Now let’s do something a bit more interesting, such as turning an LED on and off by pressing a switch. First, let’s have a look at the GPIO pins on the Raspberry Pi (see Figure 3).
Figure 3
The GPIO connector has a number of different types of connections on it:
This means that we have several options for where to connect our LED and switch; any of the GPIO pins will work fine. Just make a note of the pin number and ID for each device, because you will need this information to reference each device from your code.
If you are a Java developer and you are ready to jump into the new wave of machine-to-machine technology—let’s get started with the Internet of Things (IoT).
Let’s do some basic soldering and create the circuit shown in Figure 4. Note that we are connecting the LED to pin 16 (GPIO 23) and the switch to pin 11 (GPIO 17). A couple of resistors are added to make sure the voltage levels are within the required range.
Figure 4
Now let’s have a look at the program. In the Device Access API, there is a class called
PeripheralManager that allows you to connect to any peripheral (regardless of what it is) by using the peripheral ID, which simplifies your coding a lot. For example, to connect to your LED, simply use the static method
open, and provide the pin ID 23, as shown in Listing 2. Done!
private static final int LED1_ID = 23; ... GPIOPin led1 = (GPIOPin) PeripheralManager.open(LED_ID);
Listing 2
To change the value of the LED (to turn it on and off), use the
setValue method with the desired value:
// Turn the LED on led1.setValue(true);
It really can’t get any easier.
To connect the switch, we could potentially use the same
open method on
PeripheralManager, but because we would like to set some configuration information, we are going to use a slightly different approach. First, we create a
GPIOPinConfig object (see Listing 3), which contains information such as the following:
private static final int Button_Pin = 17; ... GPIOPinConfig config1 = new GPIOPinConfig("BUTTON 1", Button_Pin, GPIOPinConfig.DIR_INPUT_ONLY, PeripheralConfig.DEFAULT, GPIOPinConfig.TRIGGER_RISING_EDGE, false);
Listing 3
Then, we call the
open method using this configuration object, as shown in Listing 4.
GPIOPin button1 = (GPIOPin) PeripheralManager.open(config1);
Listing 4
We can also add listeners to the pins, so we will get notified every time a pin value changes. In our case, we want to be notified when the switch value changes, so we can set the LED value accordingly:
button1.setInputListener(this);
Then implement the
value Changed method that will be called when events occur, as shown in Listing 5.
@Override public void valueChanged(PinEvent event) { GPIOPin pin = (GPIOPin) event.getPeripheral(); try { if (pin == button1) { // Toggle the value of the led led1.setValue(!led1.getValue()); } }catch (IOException ex) { System.out.println("IOException: " + ex); } }
Listing 5
It’s also important that you close the pins when you are done, and also make sure you turn your LED off (see Listing 6).
public void stop() throws IOException { if (led1 != null) { led1.setValue(false); led1.close(); } if (button1 != null) { button1.close(); } }
Listing 6
The whole class can be found here.
Now, all we are missing is the main MIDlet that invokes our code. The
startApp method shown in Listing 7 will create an object to control our two GPIO devices (LED and switch) and listen to our inputs, and the
stopApp method will make sure everything is closed (stopped) properly.
public class Midlet extends MIDlet{ private MyFirstGPIO gpioTest; @Override public void startApp() { gpioTest = new MyFirstGPIO(); try { gpioTest.start(); } catch (PeripheralTypeNotSupportedException | PeripheralNotFoundException| PeripheralConfigInvalidException | PeripheralExistsException ex) { System.out.println("GPIO error:"+ex.getMessage()); } catch (IOException ex) { System.out.println("IOException: " + ex); } } @Override public void destroyApp(boolean unconditional) { try { gpioTest.stop(); } catch (IOException ex) { System.out.println("IOException: " + ex); } } } }
Listing 7
LEDs and switches are nice, but what is really interesting is when we start sensing our surrounding environment. In the following example, I want to show how to get started with sensors that use the I2C protocol.
I2C devices are perhaps the most widely available devices, and their biggest advantage is the simplicity of their design. I2C devices use only two bidirectional open-drain lines: Serial Data Line (SDA) and Serial Clock Line (SCL).
Devices on the bus will have a specific address. A master controller sets up the communication with an individual component on the bus by sending out a start request on the SDA line, followed by the address of the device. If the device with.
If you look at the Raspberry Pi pins again (see Figure 3), you will see that there are two pins for I2C: pin 3 is the data bus (SDA) and pin 5 is the clock (SCL). I2C is not enabled by default, so there are a few steps we need to follow in order to make it available to our application.
First, use a terminal to connect to your Raspberry Pi, and then add the following lines to the
/etc/ modules file:
i2c-bcm2708 i2c-dev
It’s very useful to have the
i2c-tools package installed, so the tools will be handy for detecting devices and making sure everything works properly. You can install the package using the following commands:
sudo apt-get install python-smbus sudo apt-get install i2c-tools
Lastly, there is a blacklist file called
/etc/modprobe.d/ raspi-blacklist.conf; by default SPI and I2C are part of this blacklist. What this means is that unless we remove or comment out these lines, I2C and SPI won’t work on your Raspberry Pi. Edit the file and remove the following lines:
blacklist spi-bcm2708 blacklist i2c-bcm2708
Restart the Raspberry Pi to make sure all the changes are applied.
The BMP180 board from Bosch Sensortec is a low-cost sensing solution for measuring barometric pressure and temperature. Because pressure changes with altitude, you can also use it as an altimeter. It uses the I2C protocol and a voltage in the range of 3V to 5V, which is perfect for connecting to our Raspberry Pi.
Let’s go back to soldering to connect the BMP180 board to your Raspberry Pi using the diagram shown in Figure 5. Normally, when you use an I2C device, a pull-up resistor is required for the SDA and SCL lines. Fortunately, the Raspberry Pi provides pull-up resistors, so a simple connection is all you need.
Figure 5
Once we connect the board to the Raspberry Pi, we can check whether we can see an I2C device. On your Raspberry Pi run the following command:
sudo i2cdetect -y 1
You should be able to see your device in the table. Figure 6 shows two I2C devices: one at address 40 and one at address 70.
Figure 6
There are a few things you need to know before you programmatically connect to an I2C device:
Listing 8 defines the values for the BMP180 as static variables to be used later in the code.
//Raspberry Pi's I2C bus private static final int i2cBus = 1; // Device address private static final int address = 0x77; // 3.4MHz Max clock private static final int serialClock = 3400000; // Device address size in bits private static final int addressSizeBits = 7; ... // Temperature Control Register Data private static final byte controlRegister = (byte) 0xF4; // Temperature read address private static final byte tempAddr = (byte) 0xF6; // Read temperature command private static final byte getTempCmd = (byte) 0x2E; ... // Device object private I2CDevice bmp180;
Listing 8
Once again, the way we connect programmatically to the device is using the
PeripheralManager’s static method
open. In this case, we will provide an
I2CDeviceConfig object that is specific to an I2C device (see Listing 9). The
I2CDeviceConfig object allows us to specify the device’s bus, address, address size (in bits), and clock speed.
... //Setting up configuration details I2CDeviceConfig config = new I2CDeviceConfig(i2cBus, address, addressSizeBits, serialClock); //Opening a connection the I2C device bmp180 = (I2CDevice) PeripheralManager.open(config); ...
Listing 9
To take a temperature reading, we need to follow three steps:
//; ... // Read all of the calibration data into a byte array ByteBuffer calibData= ByteBuffer.allocateDirect(CALIB_BYTES); int result = bmp180();
Listing 10a
//();
Listing 10b
// Write the read temperature command to the command register ByteBuffer command = ByteBuffer.allocateDirect (subAddressSize).put(getTempCmd); command.rewind(); bmp180.write(controlRegister, subAddressSize, command);
Listing 11
ByteBuffer uncompTemp = ByteBuffer.allocateDirect(2); int result = bmp180 // This is device specific again! int X1 = ((UT - AC6) * AC5) >> 15; int X2 = (MC << 11) / (X1 + MD); B5 = X1 + X2; // Temperature in celsius float celsius = (float) ((B5 + 8) >> 4) / 10;
Listing 12
Finally, the temperature in Celsius will be stored in the
celsius variable. You can find the entire program here.
As an exercise, you can extend the program to read the pressure, the altitude, or both.
This article took you through the steps required to start creating embedded Java applications by showing real examples of how to use GPIO and the I2C devices. Now it’s your turn to find more devices that you would like to connect to your Raspberry Pi so you can have fun with embedded Java on the Raspberry Pi.. | http://www.oracle.com/technetwork/articles/java/ma14-new-to-java-embedded-2177732.html | CC-MAIN-2016-30 | refinedweb | 2,498 | 52.39 |
IRC log of tagmem on 2008-02-07
Timestamps are in UTC.
17:56:23 [RRSAgent]
RRSAgent has joined #tagmem
17:56:23 [RRSAgent]
logging to
17:56:32 [Stuart]
zakim, this wll be TAG
17:56:32 [Zakim]
I don't understand 'this wll be TAG', Stuart
17:56:40 [Stuart]
zakim, this will be TAG
17:56:40 [Zakim]
ok, Stuart; I see TAG_Weekly()1:00PM scheduled to start in 4 minutes
17:58:32 [Zakim]
TAG_Weekly()1:00PM has now started
17:58:39 [Zakim]
+??P1
17:58:41 [Stuart]
zakim, ?? is me
17:58:41 [Zakim]
+Stuart; got it
18:00:00 [Zakim]
+TimBL
18:00:50 [Zakim]
+jar
18:01:14 [Zakim]
+Ashok_Malhotra
18:01:15 [jar_]
jar_ has joined #tagmem
18:01:29 [raman]
raman has joined #tagmem
18:01:37 [raman]
someone remind me of the pin?
18:01:50 [ht]
zakim, please call ht-781
18:01:50 [Zakim]
ok, ht; the call is being made
18:01:51 [Zakim]
+Ht
18:01:54 [ht]
zakim, what's the code?
18:01:54 [Zakim]
the conference code is 0824 (tel:+1.617.761.6200 tel:+33.4.89.06.34.99 tel:+44.117.370.6152), ht
18:01:57 [Ashok]
Ashok has joined #tagmem
18:02:09 [timbl_]
timbl_ has joined #tagmem
18:02:13 [ht]
TV, See above
18:02:38 [jar]
jonathan is here
18:02:52 [timbl_]
Zakim, who is on the call?
18:02:52 [Zakim]
On the phone I see Stuart, TimBL, jar, Ashok_Malhotra, Ht
18:03:01 [Zakim]
+DOrchard
18:03:07 [Zakim]
+Raman
18:03:21 [dorchard]
dorchard has joined #tagmem
18:03:50 [dorchard]
scribe: dorchard
18:03:51 [ht]
Call: TAG telcon
18:03:55 [Zakim]
+Norm
18:03:56 [dorchard]
scribenick: dorchard
18:03:57 [ht]
Scribe: David Orchard
18:04:09 [ht]
Chair: Stuart Williams
18:04:11 [dorchard]
zakim, who's on the phone?
18:04:11 [Zakim]
On the phone I see Stuart, TimBL, jar, Ashok_Malhotra, Ht, DOrchard, Raman, Norm
18:04:11 [Stuart]
zakim, who is here
18:04:13 [Zakim]
Stuart, you need to end that query with '?'
18:04:14 [Stuart]
zakim, who is here?
18:04:14 [Zakim]
On the phone I see Stuart, TimBL, jar, Ashok_Malhotra, Ht, DOrchard, Raman, Norm
18:04:17 [Zakim]
On IRC I see dorchard, timbl_, Ashok, raman, jar, RRSAgent, Zakim, Stuart, DanC_lap, Norm, ht, trackbot-ng
18:04:18 [dorchard]
scribe: dorchard
18:04:24 [Noah]
Noah has joined #tagmem
18:04:42 [ht]
Agenda:
18:04:48 [timbl_]
DanC_lap? Tag?
18:04:53 [Zakim]
+[IBMCambridge]
18:05:39 [Noah]
zakim, [IBMCambridge] is me
18:05:39 [Zakim]
+Noah; got it
18:06:14 [dorchard]
RESOLVED: minutes of Jan 31st 2008 approved
18:06:51 [Zakim]
+DanC
18:06:52 [dorchard]
topic: next meeting
18:07:20 [dorchard]
RESOLVED: next telcon Feb 14th
18:07:45 [dorchard]
TOPIC: upcoming regrets
18:07:56 [dorchard]
Noah, HT, Ashok regrets for March 6th
18:08:21 [dorchard]
topic: telcon rescheduling
18:09:31 [Noah]
I also note that the current time came up as least objectionable.
18:11:20 [Norm]
q+
18:12:24 [dorchard]
much discussion of the scheduling
18:12:53 [Norm]
ack norm
18:13:54 [daveorchard]
daveorchard has joined #tagmem
18:13:55 [jar]
i thought about suggesting this too (different times on alternate weeks)
18:14:13 [timbl_]
DanC?
18:15:38 [ht]
What about two one-hour calls?
18:19:32 [Norm]
This is starting to consume a lot of time, I propose that Stuart run the survey again looking for two 1 hour slots
18:21:41 [daveorchard]
I think we ought to couple the wbs survey with some online surveys to win facebook scratch 'n win points.
18:22:12 [daveorchard]
skw: Ashok will be flexible in the current slot, same for raman.
18:22:36 [daveorchard]
... as a group we'll commit to reviewing if it is unworkable for Ashok
18:22:44 [daveorchard]
scribe: daveorchard
18:22:48 [Ashok]
Thanks!
18:22:50 [daveorchard]
scribenick: daveorchard
18:23:00 [daveorchard]
I think we ought to couple the wbs survey with some online surveys to win facebook scratch 'n win points.
18:23:07 [daveorchard]
skw: Ashok will be flexible in the current slot, same for raman.
18:23:13 [daveorchard]
... as a group we'll commit to reviewing if it is unworkable for Ashok
18:23:44 [daveorchard]
RESOLVED: keep time slot as is
18:24:11 [daveorchard]
topic: URNsAndRegistries-50
18:25:21 [daveorchard]
discussion about how to send comments to oasis, email list vs web form.
18:25:33 [daveorchard]
ashok: supposedly there is a form
18:25:50 [daveorchard]
noah: why don't you look for the form, and if you find it, send our message in.
18:27:02 [daveorchard]
skw: comments are probably broader than the single document
18:27:24 [daveorchard]
... and we might do a review of the document collection
18:27:43 [daveorchard]
ht: I'll be looking into this
18:28:41 [daveorchard]
topic: passwordsintheclear
18:29:07 [daveorchard]
18:30:35 [daveorchard]
daveorchard: this finding is about passwords in the clear, not passwords in general
18:31:17 [daveorchard]
danc: the editor has considered this, i'm fine with moving on.
18:32:22 [daveorchard]
latest version is
18:33:04 [daveorchard]
18:34:55 [Noah]
Looks to me like the latest undiffed is.
The metadata in the diff URI above seems to confirm that. Right?
18:35:23 [daveorchard]
yes
18:35:32 [Noah]
tnx
18:35:36 [Norm]
ScribeNick: Norm
18:35:54 [Norm]
DO: Ashok, I think you'd be expanding the scope to talk about alternatives to passwords.
18:35:57 [Norm]
AM: Yes.
18:36:03 [Norm]
DO: I'd prefer to keep this just about passwords.
18:36:10 [Norm]
Dave describes some of the history.
18:36:34 [Norm]
DO: I'm hoping we can just do a few things and call it finished, not make it bigger.
18:36:43 [jar]
q+ jar to suggest a compromise
18:37:02 [Norm]
DO: I think we're close to consensus on the message that's embodied in the current finding.
18:37:29 [Norm]
JR: Given that we don't know who's going to read it, perhaps a phrase or sentence in the abstract could point out that there are other alternatives.
18:37:34 [Norm]
General sounds of agreement
18:37:49 [Norm]
DO: "Note that there are technologies other than passwords for enabling the transmission of secure informaton"
18:37:53 [Stuart]
q?
18:38:01 [Stuart]
ack jar
18:38:01 [Zakim]
jar, you wanted to suggest a compromise
18:38:04 [Noah]
OK, I think the contents to
-52.html"> and are now correct.
18:38:30 [Noah]
...and that makes the link from the list of Draft TAG Findings work too.
18:38:35 [Norm]
Stuart: My comments were mostly editorial, I'm happy to leave them to Dave's discretion.
18:38:50 [Norm]
DO: Sorry, I didn't get to them yet.
18:39:19 [Norm]
SW: With respect to the paragraph about digest authentication and salted hashes, I wasn't sure what it was trying to tell me. That might be a technical comment.
18:39:52 [Norm]
DO: I thought that was just a note of warning: digest does require that both parties have access to the same value.
18:40:00 [Norm]
...Maybe there needs to be some tie in there.
18:40:17 [Norm]
SW quotes the paragraph.
18:40:38 [Norm]
SW: I can't tell if the last part of that paragraph is a good thing or a bad thing.
18:41:06 [Norm]
DO: I think it's saying that if you come along afterwards, and you've got the password stored, and you want to talk to someone else, you can't extract the password again. Both parties have to agree up front.
18:41:48 [Norm]
DO: I'll check with Hal and add a sentence for clarification.
18:42:30 [Norm]
DC: I know the history. As written it sounded just written to me. Most UNIX systems store the password salted and encrypted. That's not compatible with the digest algorithm and that was a big deployment problem.
18:42:38 [Norm]
...In the digest algorithm, the server actually has to have the password.
18:44:00 [Norm]
Some additional discussion
18:44:25 [Norm]
DC: Maybe it'd be simpler to say that many systems store salted, encrypted password and those just can't be used with digest authentication.
18:44:42 [daveorchard]
Many systems store passwords as a salted hash and it is not possible to use such passwords in digest
18:44:58 [Norm]
SW: That'd be fine, now I understand the point.
18:46:07 [Norm]
NM: I don't think it's the passwords you can't use. I think it's that it's not possible for the server to compute the digest if its passwords are stored as salted hashes.
18:46:35 [Norm]
DO: And it can't go either way, it can't digest or undigest.
18:47:23 [Norm]
SW: I had one more technical comment. On section 3, the last paragraph repeats advice and examples from section 2. I suggest deleting them, though that might make the document end abruptly.
18:47:35 [Norm]
...There's also a SHOULD good practice with some explanation about why it's a SHOULD.
18:48:01 [Norm]
...Instead, you could say "User agents MUST mask passwords with respect to their current modality"
18:49:05 [Norm]
DO: The problem is that one of our examples from the face-to-face, the Apple Wifi access I think, you have a little toggle that let's you display or not display. That works for long passwords, for example.
18:49:33 [Norm]
SW: I'm not wedded to it, I was just trying to get to something stronger than SHOULD. But I'm not going to die in a ditch for it.
18:50:00 [DanC_lap]
DanC_lap has joined #tagmem
18:50:19 [Norm]
DO: This is about soliciting the password, that's not quite the same as transmitting it in the clear.
18:50:26 [Norm]
...I could tie them together...
18:50:51 [Norm]
SW: I thought you were repeating the same example, but you're telling me there's a subtle difference.
18:51:07 [Norm]
DO: They're completely different in that sense.
18:51:21 [Norm]
SW: Perhaps I should have noticed that, but I didn't. Broadly, I'm happy for you to just respond how you see fit.
18:52:34 [Norm]
DO: We should solicit feedback from the security folks, what about the HTTP WG at the IETF.
18:52:43 [Norm]
SW: And HTML5, given that we're talking about form fields?
18:52:52 [Norm]
DO: And the encryption folks. Any other suggestions?
18:53:04 [Norm]
NW: That covers the folks I can think of.
18:53:11 [Norm]
ACTION: orchard to revise the finding and publish it directly, unless he feels the need for more review before publication
18:53:11 [trackbot-ng]
Created ACTION-99 - Revise the finding and publish it directly, unless he feels the need for more review before publication [on David Orchard - due 2008-02-14].
18:53:38 [timbl_]
trackbot-ng, who is here?
18:53:57 [Norm]
ScribeNick: daveorchard
18:54:01 [timbl_]
trackbot-ng, status?
18:54:51 [DanC_lap]
close action-89
18:54:51 [trackbot-ng]
ACTION-89 Note the old submission about logout button under passwordsInTheClear closed
18:54:54 [DanC_lap]
action-25?
18:54:54 [trackbot-ng]
ACTION-25 -- T.V. Raman to summarize history of DTD/namespace/mimetype version practice, including XHTML, SOAP, and XSLT. -- due 2008-01-31 -- OPEN
18:54:54 [trackbot-ng]
18:55:17 [DanC_lap]
q+ to propose to witdraw the uri testing idea
18:55:21 [daveorchard]
planning on doing action 25 in time for reading before f2f
18:57:04 [DanC_lap]
ack danc
18:57:04 [Zakim]
DanC_lap, you wanted to propose to witdraw the uri testing idea
18:57:06 [daveorchard]
ht: action 33 will hopefully be done in time for f2f
18:57:11 [DanC_lap]
action-55?
18:57:11 [trackbot-ng]
ACTION-55 -- Dan Connolly to work with SKW on a few paragraphs of thinking around a URI testing group (IG/WG/XG?) -- due 2008-01-24 -- OPEN
18:57:11 [trackbot-ng]
18:57:54 [DanC_lap]
close action-55
18:57:54 [trackbot-ng]
ACTION-55 Work with SKW on a few paragraphs of thinking around a URI testing group (IG/WG/XG?) closed
18:57:57 [DanC_lap]
withdrawn
18:58:18 [DanC_lap]
action-95?
18:58:18 [trackbot-ng]
ACTION-95 -- Dan Connolly to ask SWEO working group for one week extension for review of their document -- due 2008-01-24 -- CLOSED
18:58:18 [trackbot-ng]
18:58:33 [DanC_lap]
action-93?
18:58:33 [trackbot-ng]
ACTION-93 -- Henry S. Thompson to review EXI WDs since 20 Dec -- due 2008-01-17 -- OPEN
18:58:33 [trackbot-ng]
19:00:02 [daveorchard]
norm: will do 38 in time for f2f
19:00:06 [DanC_lap]
action-92?
19:00:06 [trackbot-ng]
ACTION-92 -- Tim Berners-Lee to consider whether or not he wants to post an issue re: POWDER/rules -- due 2007-12-20 -- OPEN
19:00:06 [trackbot-ng]
19:02:04 [daveorchard]
ht: on 73, xhtml wg said we're going to next state in November, and then nothing happened,and then they went to next state yesterday
19:02:10 [DanC_lap]
(norm, the db has you overdue on review of curies; my vague memory says otherwise)
19:02:47 [DanC_lap]
close action-73
19:02:47 [trackbot-ng]
ACTION-73 Contact the XHTML 2 WG about the fact that the TAG has been experimenting with modularisation closed
19:02:51 [DanC_lap]
withdrawn
19:04:09 [Noah]
Speaking of actions that are not quite overdue, the long-promised draft of self-describing Web is likely to be out within the next day or two.
19:04:22 [Noah]
Should give plenty of opportunity for people to read it for the F2F.
19:04:27 [daveorchard]
skw: there is also a view that shows actions soon to be completed..
19:04:50 [daveorchard]
agenda: Vancouver F2F Agenda Request for Agenda Items
19:05:59 [Noah]
q+ to say that after we're done with the versioning thread, I'd like to mention that a self-describing Web draft should be out within a couple of days
19:06:34 [Stuart]
ack Noah
19:06:34 [Zakim]
Noah, you wanted to say that after we're done with the versioning thread, I'd like to mention that a self-describing Web draft should be out within a couple of days
19:07:10 [daveorchard]
dorchard: I like versioning, urnsregistries, web app state, web arch vol 2
19:07:48 [daveorchard]
noah: self-describing web draft coming out.
19:13:00 [DanC_lap]
if the TAG is considering discussing state foo, my input is: yes please let's, and let's look at the "offline applications and data synchronization" HTML WG requirements issue <
> while we're at it
19:13:03 [daveorchard]
raman: will produce something for application-state-60
19:13:11 [DanC_lap]
q+
19:14:31 [Stuart]
As understand it raman will generate material for webApplicationState-60 in advance of the F2F.
19:14:50 [daveorchard]
noah: what about dave's work on state?
19:14:58 [DanC_lap]
Noah, I don't know the relationship between the HTML WG state work and Dave's drafts; that's why I want ftf discussion.
19:16:36 [Stuart]
In the earlier conversation Dave and I thought we were talking about ACTION-25 and Raman thought we were talking about ACTION-91.
19:17:17 [Stuart]
I believe that we have already agreed to close ACTION-25 with reference to Norm's bog article on implit namespaces.
19:18:07 [Stuart]
close action-25
19:18:08 [trackbot-ng]
ACTION-25 summarize history of DTD/namespace/mimetype version practice, including XHTML, SOAP, and XSLT. closed
19:18:50 [daveorchard]
does norm's blog cover all of action 25?
19:19:06 [Stuart]
Norm?
19:19:16 [Zakim]
-Ht
19:20:19 [daveorchard]
raman: offline gives you the possibility of doing asynch other than xmlhttprequest
19:20:24 [daveorchard]
raman: asynch ala email
19:20:52 [daveorchard]
noah: if you step back far enough and look at offline systems
19:21:23 [daveorchard]
... the webby systems seem to have assymetric state, where the state lives in the web
19:21:41 [daveorchard]
... vs systems like Notes where the client has fully featured state.
19:23:05 [daveorchard]
skw: jar, can we bring aswww to table?
19:23:38 [daveorchard]
jar: yes
19:23:50 [daveorchard]
skw: I'll add that to the f2f agenda
19:23:55 [daveorchard]
skw: tbl?
19:24:36 [daveorchard]
tbl: wonder how long aswww should be separate and when to surface
19:24:49 [Stuart]
s/aswww/awwsw/
19:24:53 [Stuart]
:-)
19:24:59 [DanC_lap]
(a 5 to 10 minute present-only update on AWWSW would work for me.)
19:24:59 [daveorchard]
jar: the kinds of confusions we have are interesting
19:25:42 [daveorchard]
I'm interested in this, and would be glad to hear about confusions, 30, 60 mins or more.
19:25:49 [DanC_lap]
(I'm happy to spend 3 days in AWWSW ;-)
19:26:39 [daveorchard]
(I wonder when the TAG will become WWSWAG?) :-)
19:28:41 [Stuart]
19:29:44 [Zakim]
-Raman
19:29:47 [Zakim]
-Ashok_Malhotra
19:29:51 [Zakim]
-TimBL
19:29:55 [Zakim]
-jar
19:29:57 [Zakim]
-Stuart
19:29:57 [Norm]
The best way to get from YVR to the Opus is a cab, right?
19:29:58 [Zakim]
-Noah
19:30:34 [daveorchard]
Norm: yes
19:30:56 [Zakim]
-Norm
19:33:15 [jar_]
jar_ has joined #tagmem
19:34:39 [Zakim]
-DOrchard
19:35:33 [daveorchard]
zakim, generate minutes
19:35:33 [Zakim]
I don't understand 'generate minutes', daveorchard
19:35:42 [daveorchard]
zakim, please generate minutes
19:35:42 [Zakim]
I don't understand 'please generate minutes', daveorchard
19:35:52 [daveorchard]
zakim, make minutes world readable
19:35:52 [Zakim]
I don't understand 'make minutes world readable', daveorchard
19:36:01 [daveorchard]
sigh
19:37:22 [Stuart]
Stuart has joined #tagmem
19:37:33 [Stuart]
rrsagent, make logs public
19:39:39 [Zakim]
disconnecting the lone participant, DanC, in TAG_Weekly()1:00PM
19:39:41 [Zakim]
TAG_Weekly()1:00PM has ended
19:39:42 [Zakim]
Attendees were Stuart, TimBL, jar, Ashok_Malhotra, Ht, DOrchard, Raman, Norm, Noah, DanC
19:40:25 [daveorchard]
thx stuart
21:59:00 [Zakim]
Zakim has left #tagmem | http://www.w3.org/2008/02/07-tagmem-irc | CC-MAIN-2014-41 | refinedweb | 3,188 | 65.25 |
Details
- Type:
Bug
- Status: Open
- Priority:
Major
- Resolution: Unresolved
- Affects Version/s: 0.10.0
- Fix Version/s: None
- Component/s: None
- Labels:None
- Environment:
pig-0.10.1, hadoop 0.20.2
Description
I started using embedded Pig in Python scripts. I had a need to execute a pig script with slightly different set of parameters for each run.
The job are quite small so taking advantage of the cluster and running them in parallel made sense for me.
Here's a python code I've used. (I executed it like that: bin/pig run.py script.pig ):
from org.apache.pig.scripting import Pig import sys def main(): SCRIPT_NAME = sys.argv[1] jobParamsSets = prepareParameterSets() NUM_OF_JOBS_TO_RUN_AT_ONCE = 5 while len(jobParamsSets) != 0: batchParamSet = jobParamsSets[:NUM_OF_JOBS_TO_RUN_AT_ONCE] del jobParamsSets[:NUM_OF_JOBS_TO_RUN_AT_ONCE] print 'batch to execute:', batchParamSet P = Pig.compileFromFile(SCRIPT_NAME) bound = P.bind(batchParamSet) stats = bound.run() for s in stats: print s.isSuccessful(), s.getDuration(), s.getReturnCode(), s.getErrorMessage() def prepareParameterSets(): # loads properties from files and creates multiple sets of parameters
With NUM_OF_JOBS_TO_RUN_AT_ONCE variable I'm able to control the parallelism.
I can have up to 150 parameter sets so that means 150 pig executions.
Everything seemed to work just fine but I started noticing single failures for some job executions.
It happens occasionally. 0-5 executions fail out of 150 for example. Always with the same kind of error.
2013-02-14 16:25:04,575 [main] ERROR org.apache.pig.scripting.BoundScript - Pig pipeline failed to complete java.util.concurrent.ExecutionException: org.apache.pig.impl.logicalLayer.FrontendException: ERROR 1000: Error during parsing. Could not resolve my.pig.udf.OrderQueryTokens using imports: [, org.apache.pig.builtin., org.apache.pig.impl.builtin.] ...
Full stacktrace attached.
I'm using many UDFs so the name of the UDF in the exception is changing.
I suspect there is a threading issue somewhere.
My best guess is that org.apache.pig.impl.PigContext.resolveClassName is not thread safe and when multiple threads are trying to resolve a UDF class something goes wrong.
I've tried a couple of tricks hoping that maybe it would help. What I did is that to my knowledge there are 3 ways in how you can register your jars with udfs.
- in pig script ( REGISTER lib/*.jar
- in python Pig.registerJar("/lib/*.jar")
- command line param for pig command, $PIGDIR/bin/pig -Dpig.additional.jars=lib/*.jar
Initially the 1) option was used. I was thinking that maybe if I register the jars globally right at the beginning with the option 3) I could go around the bug. Well it seems the problem dropped but didn't go away fully and still appears from time to time.
The problem is that I cannot provide an reproducible use case. My process is quite complicated and presenting it here seems infeasible. I've tried to strip down my scripts and have something quick and simple to present. I've run that with like 1000 parameter sets with parallelism set to 10 or 20 and it sadly never occurred.
PS.
With pig-0.10.1 I had to substitute the distributed jython dependency with a standalone version. Otherwise I wasn't able to use python standard modules.
I couldn't try if this bug still exists in pig-0.11.0 as the version is incompatible with hadoo 0.20. pig-0.11.1 has not been released yet.
Activity
- All
- Work Log
- History
- Activity
- Transitions
Thank you Jakub for reporting the issue.
I am puzzled because packageImportList is a ThreadLocal variable, so any front-end exception shouldn't be thrown for this:
private static ThreadLocal<ArrayList<String>> packageImportList = new ThreadLocal<ArrayList<String>>();
Looking at the stack trace, I can see both front-end and back-end errors:
Caused by: org.apache.pig.impl.logicalLayer.FrontendException: ERROR 1000: Error during parsing. Could not resolve my.pig.udf.OrderQueryTokens using imports: [, org.apache.pig.builtin., org.apache.pig.impl.builtin.] ... Caused by: org.apache.pig.backend.executionengine.ExecException: ERROR 1070: Could not resolve my.pig.udf.OrderQueryTokens using imports: [, org.apache.pig.builtin., org.apache.pig.impl.builtin.]
I suppose that these errors are from different threads?
The back-end error makes sense because the LocalJobRunner of Hadoop 0.20.x and 1.0.x is not thread safe. I have seen several similar issues (
PIG-2852, PIG-2932, etc) for that, and it is also documented here.
But the front-end should be thread safe, so if not, it should be fixed.
full stack trace of the exception | https://issues.apache.org/jira/browse/PIG-3263 | CC-MAIN-2016-07 | refinedweb | 754 | 53.17 |
What do you mean by real IP?
Type: Posts; User: master5001
What do you mean by real IP?
Many API's use globals and just hide them with calls to functions. Of course one downside to globals is thread-safety. But even then you can tinker with your type declaration to make things thread...
if(strstr(buffer, "!add") == buffer)
/* do stuff */
Or "How to write bot?"
switch(i)
{
case 0: IScd(argc, argv); break;
case 1: IShelp();break;
case 2: kill_main(argc, argv); break;
case 3: ISls(args); break;
case 4: ISps();...
Post anything that I may say "what does that do exactly?"
To begin, see the red.
I am not seeing enough code here to for sure say that I understand the problem... though I guess your main issue is that you are replacing blocks of data, correct? So just don't do that and problem...
There is one important decision to make in software design. Whether to be the smart cynical guy, or the nerdy bastard guy (or in Elysia's case be the nerdy bastard girl). Though seemingly similar at...
Don't eat anything greasy while coding. It makes your mouse all difficult to hold. Join the ranks of the rest of us coders and memorize shortcut keys like a mofo. Also, don't forget to become very...
No problem dude. I am glad I was of such great service to you.
Example:
/* Here is a custom loop */
loopy:
if(x < 50)
{
/* Stuff goes here */
My first guess would be simple oversight on your behalf.
Example:
int main(void)
{
int number = 15;
printf("number = %d\n", number);
Fair enough. I happen to know you so I know full well you would not be trying to be mean or anything. But I also wouldn't want you to build a reputation as a dick.
I like perl :) New York City!? (I doubt most of the people here remember those commercials to get the reference--and so you don't think I am being a random nut, I noticed MK27 is from NYC). And the h...
No, not at all. I was curious if you are making fun of that one poor shmuck's calculator?
He is right to touch on the fact that you are not considered a troll and are a regular member. Thus some of us still hold respect for you and you wouldn't wish to go around and make people feel...
Haha you made me laugh :-) In all seriousness, your code isn't "not-brilliant" because of how you did it. It is problematic because of the fact that global buffers are just plain messy. Simply put...
Yeah I wonder about that too. An LOL! no less.
Because 0x80000 is half a mebabyte in hexidecimal. Figure if 0x100000 is 1MG, then 0x100000 / 2 = 0x80000. Right? .5MB = 2^19, right?
I hate to be the psyche student on you but your code is neither brilliant nor worth using for homework purposes. I was going to simply correct your code but the entire way it works was too flawed to...
I do not see any minor errors. I only see crippling ones and ones that make the program HIGHLY under-efficient if it even works to begin with.
You obviously know where the edit button is, so...
Oooops, I didn't notice the line number mumbo jumbo. MK27's code hardly seems brilliant. I mean come on now dude...
#include <stdlib.h>
#include <stdio.h>
int main(int argc, char **argv)...
You do understand that this is an issue of guideline and not a rule. Like Linus Torvalds is not going to jump out of the bushes with a crow bar shouting obsceneties or anything. Its just bad form.
132 is correct, yes. Perhaps you are seeing the wonders of signedness! behold!
Check this out.
Example 1:
#include <stdio.h>
int main() | https://cboard.cprogramming.com/search.php?s=125e59e5fb5f669003dd70df551f6a43&searchid=5722208 | CC-MAIN-2020-34 | refinedweb | 646 | 85.69 |
14 February 2006 21:22, deifo@... wrote:
> When I click on the reload button on the PIC, KTechLab crashes with the
> attached backtrace. I have gputils-0.13.3 installed. KTechLab from today
> svn. Aditionally, when I load KTechLab (before I click the button) I see
> the following messages in the console:
This is a bug in gpsim-0.21.11 - it crashes when a PIC program is reloaded.
See
David
I have a project with a .circuit file with a PIC in it, and a .asm file w=
ith
the following program:
LIST P=3DPIC16F84
#include <p16f84.inc>
ORG 000H
END
The program compiles succesfully without warnings, and the PIC is configu=
red
with that .asm file.
When I click on the reload button on the PIC, KTechLab crashes with the a=
ttached
backtrace. I have gputils-0.13.3 installed. KTechLab from today svn.
Aditionally, when I load KTechLab (before I click the button) I see the f=
ollowing
messages in the console:
.cod range error
FIXME: HLL files are not supported at the moment
Enabling WDT timeout =3D 0.018 seconds
QColor::setRgb: RGB parameter(s) out of range
By the way, if you just have an .asm file with an 'END' on it and try to
compile, the following messages appear in the console:
Warning, you need to upgrade to gputils-0.13.0 or higher
(Your assembler version is )
is not a valid processor.
(try 'processor list' to see a list of valid processors.
is not a valid processor.
(try 'processor list' to see a list of valid processors.
unrecognized processor in the program file
Sorry, forgot to attach the backtrace.
I agree to receive quotes, newsletters and other information from sourceforge.net and its partners regarding IT services and products. I understand that I can withdraw my consent at any time. Please refer to our Privacy Policy or Contact Us for more details | https://sourceforge.net/p/ktechlab/mailman/message/1636995/ | CC-MAIN-2017-34 | refinedweb | 319 | 76.72 |
/**14 * ========================================15 * <libname> : a free Java <foobar> library16 * ========================================17 *18 * Project Info: * Project Lead: Thomas Morgner;20 *21 * (C) Copyright 2005, by Object Refinery Limited and Contributors.22 *23 * This library is free software; you can redistribute it and/or modify it under the terms24 * of the GNU Lesser General Public License as published by the Free Software Foundation;25 * either version 2.1 of the License, or (at your option) any later version.26 *27 * This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;28 * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.29 * See the GNU Lesser General Public License for more details.30 *31 * You should have received a copy of the GNU Lesser General Public License along with this32 * library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330,33 * Boston, MA 02111-1307, USA.34 *35 * ---------36 * YieldReportListener.java37 * ---------38 *39 * Original Author: Thomas Morgner;40 * Contributors: -;41 *42 * $Id: Anchor.java,v 1.3 2005/02/23 21:04:29 taqua Exp $43 *44 * Changes45 * -------------------------46 * 01.10.2006 : Initial version47 */48 package org.pentaho.plugin.jfreereport.helper;49 50 import org.jfree.report.event.RepaginationListener;51 import org.jfree.report.event.RepaginationState;52 53 /**54 * Creation-Date: 01.10.2006, 16:44:2055 * 56 * @author Thomas Morgner57 */58 public class YieldReportListener implements RepaginationListener {59 private int rate;60 61 private transient int lastCall;62 63 private transient int lastPage;64 65 public YieldReportListener() {66 rate = 50;67 }68 69 public YieldReportListener(final int rate) {70 this.rate = rate;71 }72 73 public int getRate() {74 return rate;75 }76 77 public void setRate(final int rate) {78 this.rate = rate;79 }80 81 public void repaginationUpdate(RepaginationState repaginationState) {82 final int currentRow = repaginationState.getCurrentRow();83 final int thisCall = currentRow % rate;84 final int page = repaginationState.getPage();85 86 if (page != lastPage) {87 Thread.yield();88 } else if (thisCall != lastCall) {89 Thread.yield();90 }91 lastCall = thisCall;92 lastPage = page;93 }94 }95
Java API By Example, From Geeks To Geeks. | Our Blog | Conditions of Use | About Us_ | | http://kickjava.com/src/org/pentaho/plugin/jfreereport/helper/YieldReportListener.java.htm | CC-MAIN-2016-50 | refinedweb | 361 | 50.53 |
#include <HAPI_Common.h>
Definition at line 1324 of file HAPI_Common.h.
Definition at line 1337 of file HAPI_Common.h.
Adjust the gamma of the image. For anything less than HAPI_IMAGE_DATA_INT16, you probably want to leave this as 2.2.
Definition at line 1344 of file HAPI_Common.h.
Unlike the other members of this struct changing imageFileFormatNameSH and giving this struct back to HAPI_SetImageInfo() nothing will happen. Use this member variable to derive which image file format will be used by the HAPI_ExtractImageTo...() functions if called with image_file_format_name set to NULL. This way, you can decide whether to ask for a file format conversion (slower) or not (faster).
Definition at line 1332 of file HAPI_Common.h.
ex: true = RGBRGBRGB, false = RRRGGGBBB
Definition at line 1339 of file HAPI_Common.h.
Definition at line 1340 of file HAPI_Common.h.
Definition at line 1334 of file HAPI_Common.h.
Definition at line 1335 of file HAPI_Common.h. | http://www.sidefx.com/docs/hdk/struct_h_a_p_i___image_info.html | CC-MAIN-2018-17 | refinedweb | 152 | 61.22 |
Review, Formatting Silly Sentences
June 14, 2011 5 Comments
Voice Over Well it’s a straight fight here at Leicester…On the left of the Returning Officer (camera shoes grey-suited man) you can see Arthur Smith, the Sensible candidate and his agent, (camera pans to silly people) and on the other side is the silly candidate Jethro Walrustitty with his agent and his wife.
Officer Here is the result for Leicester. Arthur J. Smith…
Voice Over Sensible Party
Officer 30,612…
Jethro Q. Walrustitty…
Voice Over Silly Party
Officer 32,108..
I also noticed that I did some things in the last tute which we haven’t encountered yet. In particular, I:
- assigned a function to an object r = random.randint. Isn’t Python neat? You can make these assignments, then the name r points at the function random.randint, so you can use r wherever you use the function. Sometimes you can use this pattern to make your program run faster (honest!). However, it might be confusing so I’ll stop it now!
- used tab characters to format a print out: ‘\t’. There are some “control” characters which modify the usual output of a set of printed characters. Of particular interest are ‘\n’ (which makes a new line) and ‘\t’ which adds a tab space. Try printing some strings with \n and \t in them to see what they do.
In this tutorial we’re going to look at formatting strings. In the previous tute we constructed a string by adding (using the ‘+’ operator) them together. Building strings this way can be a little challenging. Another way to do it, is to use formatting strings. We put place markers into a string, and match the place markers with values to go in there. The place markers are identfied by a % sign in the string, and values are added at the end after a % sign. Here is a simple example:
>>> print '%s'%'hi' hi
The string ‘hi’ is inserted in place of the %s (%s (the s is important – not just the % by itself) says insert a string here). There are a number of different options for formatting other than %s (eg %f) but we’re not going into them here. Read the documentation for more details.
>>> print '->%s<-'%'This is the value which is inserted' ->This is the value which is inserted<-
We can define the format string and the value differently:
>>>>> print formatString%"they won't believe you" ...tell that to the young people of today, and they won't believe you.
Then you can use the same format string with a different value. This is useful when you have to print something repetitive, where only a part of it changes:
>>> print formatString%"they will fall about laughing" ...tell that to the young people of today, and they will fall about laughing.
You can put multiple values into the format string, but the values you supply must:
- be in brackets () (this makes a thing called a tuple, but we haven’t seen them yet); and
- have a comma between each of the values; and
- there must be the same number of values as there are %s in the format string.
So, in the previous tute, we might have done something like this: >>>>> print formatString%(2,2,4) 2 x 2 = 4
We can also pass variables to be printed as values to the formatting string:
>>> i=2 >>> j=3 >>> print formatString%(i,j,i*j) 2 x 3 = 6
So here’s the times table again:
>>> for i in range(12): ... for j in range(12): ... print formatString%(i+1,j+1,(i+1)*(j+1))
Silly Sentences
Let’s adapt the silly sentence example from last tutorial.
Set up:
1. open your text editor,
2. open a new file
3. “save as” this empty file with the name “sillySentences110614.py”, save it in the p4k directory we’ve created to hold our stuff.
Now copy and paste this:
import random nouns = ["apple","toy car","pumpernickel","dinner","pillow","homework","little finger","house","pencil","letterbox","hamster"] verbs = ["ate","played","smelled","lost","forgot","dropped","hid","erased","infuriated","planted","ripped up","tripped over","dusted","talked to"] v = len(verbs)-1 n = len(nouns)-1 numberOfSillySentences = 10 formatString = "I was very taken aback when Mrs Pepperpot %s my %s." for i in range(numberOfSillySentences): verb = verbs[random.randint(0,v)] noun = nouns[random.randint(0,n)] print formatString%(verb,noun)
And save the file. Can you see how much easier it is to get the spacing right?
Run the file by going to a console and typing:
> python sillySentences110614.py
Funny?
Now you need to make this code your own.
Exercise: First, change some of the verbs and nouns. You will see the pattern – for verbs you need to substitute doing words, and they need to be in the past – ate rather than eat. For nouns you need to substitute words which name things. Save the file, then run the program again from the console with:
> python sillySentences110614.py
Next, we’re going to change it to add some feelings in, but you have to supply the feelings:
Exercise: add some feeling words to the feelings arrray and run again:
import random nouns = ["apple","toy car","pumpernickel","dinner","pillow","homework","little finger","house","pencil","letterbox","hamster"] verbs = ["ate","played","smelled","lost","forgot","dropped","hid","erased","infuriated","planted","ripped up","tripped over","dusted","talked to"] feelings=["very taken aback","very happy","quite sad"] # add more feelings to the array here v = len(verbs)-1 n = len(nouns)-1 f = len(feelings)-1 numberOfSillySentences = 10 formatString = "I was %s when Mrs Pepperpot %s my %s." for i in range(numberOfSillySentences): verb = verbs[random.randint(0,v)] # choose a verb,noun, feeling by calculating a random integer noun = nouns[random.randint(0,n)] # between 0 and v,n,f (number of verbs,nouns, feelings) feeling = feelings[random.randint(0,f)] print formatString%(feeling,verb,noun) # substitute into the format string and print
I have made a list of pronouns. I am trying to make it so that certain subject pronouns will use a slightly modified sentence so that it is grammatically correct but I keep receiving this error message.
File “sillySentences1.py”, line 16,in (module)
if pronoun == pronoun[1,4,5]:
TypeError: sting indices must be integers, not tuple
Here is my script:
import random
nouns = [“couch”,”basket”,”cup”,”wall”,”willow”,”dog”,”finger”,”book”,”leather”,”skin”,”ball”]
verbs = [“vomitted”,””,”muredered”,”ran”,”foraged”,”flopped”,”did”,”shot”,”infuriated”,”crushed”,”boiled”,””,”dusted”,”talked to”]
pronouns = [“I”,”You”,”She”,”He”,”They”,”We”]
v = len(verbs)-1
n = len(nouns)-1
p = len(pronouns)-1
numberOfSillySentences = 10
formatString = “%s was very taken aback when Mrs Pepperpot %s my %s.”
formatString1 = “%s were very taken aback when Mrs Pepperpot %s my %s”
for i in range(numberOfSillySentences):
verb = verbs[random.randint(0,v)]
noun = nouns[random.randint(0,n)]
pronoun = pronouns[random.randint(0,p)]
if pronoun == pronoun[1,4,5]:
print formatString1%(pronoun,verb,noun)
else:
print formatString%(pronoun,verb,noun)
If i put just 1 = sign in my if statement it also goes wrong and the interpreter tells me to change it.
I cant figure out whats wrong.
TypeError: sting indices must be integers, not tuple
This type error doesn’t look right. However as it says the index (ie the thing in the []) must be an integer (ie a single number) not a tuple (like a list of numbers – I don’t think we’ve done tuples yet).
Also, in your code there is no list called “pronoun” (without an s). Even if there was, pronoun[1,4,5] would not make any sense.
Try making two lists of pronouns, then set pronouns = list1 + list2. Then try:
if pronoun in list1:
etc….
Another way to do it is to save the index your creating with the random number and check whether it is “in [1,4,5]”
Good luck!
Pingback: MineCraft config editor part 2 « Python Tutorials for Kids 8+
Pingback: Almost There! Adding Methods to Our Classes « Python Tutorials for Kids 8+
Pingback: Put your child’s work on line with Web2py and Google Apps | Python for Dads | https://python4kids.brendanscott.com/2011/06/14/review-formatting-silly-sentences/?replytocom=559 | CC-MAIN-2020-10 | refinedweb | 1,363 | 63.09 |
nan, nanf, nanl − return ’Not a Number’
#include <math.h>
double nan(const char *tagp);
float nanf(const char *tagp);
long double nanl(const char *tagp);
Link with −lm.
Feature Test Macro Requirements for glibc (see feature_test_macros(7)):
nan(), nanf(), nanl():
_XOPEN_SOURCE >= 600 || _ISOC99_SOURCE || _POSIX_C_SOURCE >= 200112L;
or cc -std=c99
These.
These functions first appeared in glibc in version 2.1.
C99, POSIX.1-2001. See also IEC 559 and the appendix with recommended functions in IEEE 754/IEEE 854.
isnan(3), strtod(3), math_error(7)
This page is part of release 3.35 of the Linux man-pages project. A description of the project, and information about reporting bugs, can be found at. | http://man.m.sourcentral.org/ubuntu1204/3+nan | CC-MAIN-2021-25 | refinedweb | 114 | 67.35 |
How do I get the number of rows returned from a Microsoft SQL Query in C#?
How do I get the number of rows returned from a SQL Query in C#?
Having used other languages where this is much simpler, I was surprised at how “not simple” this was in C#. I expected it to be a little more complex than in some scripting language such as PHP, but it was way more complex.
Here is how I do it:
using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Data; using System.Data.SqlClient; namespace CountRows { class Program { static void Main(string[] args) { // Create a string to hold the database connection string string sdwConnectionString = @"Data Source = ServerName; user id=UserName; password=P@sswd!; Initial Catalog = DatabaseName;"; // Create a string to hold the database connection string string query = "SELECT * FROM MyTable"; // Pass both strings to a new SqlCommand object. SqlCommand queryCommand = new SqlCommand(query, sdwDBConnection); // Create a SqlDataReader SqlDataReader queryCommandReader = queryCommand.ExecuteReader(); // Create a DataTable object to hold all the data returned by the query. DataTable dataTable = new DataTable(); dataTable.Load(queryCommandReader); // The DataTable object has a nice DataTable.Rows.Count property that returns the row count. int rowCount = rowCount = dataTable.Rows.Count; } } }
Now doing it this way, you also have the data available in the
DataTable dataTable object so you don’t have to go to the database and get it again. | https://www.wpfsharp.com/2009/09/21/how-do-i-get-the-number-of-rows-returned-from-a-sql-query-in-c/ | CC-MAIN-2021-31 | refinedweb | 237 | 59.19 |
27 September 2008 11:00 [Source: ICIS news]
By Nel Weddle and Linda Naylor
LONDON (ICIS news)--Supply and demand expectations are likely to be key issues for players in the olefins and polyolefins markets heading to the annual European Petrochemical Association (EPCA) conference in Monaco this weekend.
Many are pessimistic and do not expect demand to be in any way buoyant moving through the fourth quarter and into 2009.
To exacerbate the situation, sources are eyeing new ?xml:namespace>
“We will try to discuss longer term stuff, now that the Q4 [ethylene] contracts are out of the way,” one supplier said
“The senior guys are in and so they like to talk of longer term strategies with business partners, check overall relationships.”
The European olefins contract mechanism will again also be a point of discussion.
Unprecedented upstream volatility and negative cracker margins have led to further calls for a change to the way contracts are settled.
In July, the INEOS group officially announced its intention to move to a more responsive monthly contract system from 1 October.
But other companies’ positions have not been totally clear.
Currently, most ethylene (C2) and propylene (C3) is contracted on a quarterly basis, although some ethylene volume is based on a bimonthly contract. It is by no means certain that the industry will manage to adapt to new mechanisms.
This year has so far been a rollercoaster for both ethylene and propylene.
Cracker reliability has been good and the shutdown slate lesser than in previous years, but market dynamics have forced cutbacks in operating rates.
First, in the second quarter, when cracker margins turned negative for the first time since 2002 on peak crude and naphtha values. And for a second time towards the end of the third quarter, because of ethylene containment issues.
In the first half of the year, propylene was long and producers were forced to switch to alternative feedstocks and tweak running severity in order to better tailor output to demand. Ethylene was healthy, demand strong.
Both markets balanced out mid year following record high increases for third quarter contracts. Contract discussions were protracted and settlements agreed only after the quarter had begun. These highlighted an industry environment made difficult by unfeasibly high feedstocks and concerns about downstream demand.
Concerns began to heighten in the second half of the year as demand failed to emerge as expected following the European summer break.
Demand into the key ethylene derivative polyethylene was particularly bad. Industry observers were unable to determine what proportion of the downturn in demand was pricing speculation and what was the result of the weak economy.
Demand for propylene, by comparison, was steadier
Downstream from the olefins it is becoming increasingly clear that polyethylene (PE) volumes have slumped in 2008.
Some players estimated a drop of as much as 7% in year-to-date volumes over 2007, sources said on Friday.
The slump has led to a significant price drop in price levels in September, with lower indications already circulating for October.
Spot low density PE (LDPE) had dropped from highs of €1,500/tonne ($2,206/tonne) FD (free delivered) NWE (northwest Europe).
Asian prices also fell dramatically in the week to Friday 26 September, showing their biggest drop for ten years.
September PE volumes in
“We were expecting a strong October,” said a major producer, “but it’s just not happening.”
Another major producer, however, expected demand to improve. “We are seeing an over-reaction to an over-stressed situation,” he said.
The consensus of opinion, however, was that the fourth quarter would be hard.
($1 = €0.68)
To discuss issues facing the chemical industry go to ICIS connect
For more on the major olefins | http://www.icis.com/Articles/2008/09/27/9159529/epca-08-supply-and-demand-key-for-olefins-chain.html | CC-MAIN-2014-42 | refinedweb | 619 | 52.29 |
UFDC Home | Help | RSS TABLE OF CONTENTS HIDE Front Cover Front Matter Introduction Cultural procedure followed Stalk size distribution in relation... Description of the experimental... Influence of various "trace" elements... Depth of the water table - Cost... Influence of nitrogen upon yields... Influence of potassium (potash)... Influence of phosphates (phosphoric... Method and rate of application... Miscellaneous suggestions Summary and abstract Acknowledgement Literature cited Appendix Group Title: Bulletin - University of Florida. Agricultural Experiment Station ; no. 333 Title: A fertility program for celery production on Everglades organic soils CITATION THUMBNAILS PAGE IMAGE ZOOMABLE Full Citation STANDARD VIEW MARC VIEW Permanent Link: Material Information Title: A fertility program for celery production on Everglades organic soils Series Title: Bulletin University of Florida. Agricultural Experiment Station Physical Description: 39 p. : ill., charts ; 23 cm. Language: English Creator: Beckenbach, J. R ( Joseph Riley ), 1908- Publisher: University of Florida Agricultural Experiment Station Place of Publication: Gainesville Fla Publication Date: 1939 Subjects Subject: Celery -- Soils -- Florida -- Everglades ( lcsh )Celery -- Fertilizers -- Florida -- Everglades ( lcsh ) Genre: government publication (state, provincial, terriorial, dependent) ( marcgt )bibliography ( marcgt )non-fiction ( marcgt ) Notes Bibliography: Bibliography: p. 36. Statement of Responsibility: by J.R. Beckenbach. General Note: Cover title. Funding: Bulletin (University of Florida. Agricultural Experiment Station) Record Information Bibliographic ID: UF00015112 Volume ID: VID00001 Source Institution: University of Florida Rights Management: All rights reserved by the source institution and holding location. Resource Identifier: aleph - 000924563oclc - 18214555notis - AEN5190 Table of Contents Front Cover Page 1 Front Matter Page 2 Introduction Page 3 Page 4 Page 5 Cultural procedure followed Page 6 Stalk size distribution in relation to yield Page 7 Page 8 Description of the experimental plots Page 9 Page 10 Influence of various "trace" elements upon celery yields Page 11 Page 12 Depth of the water table - Cost of growing celery in the Everglades Page 13 Page 14 Page 15 Influence of nitrogen upon yields and costs Page 16 Page 17 Page 18 Page 19 Page 20 Page 21 Influence of potassium (potash) upon yields and costs Page 22 Page 23 Page 24 Page 25 Page 26 Influence of phosphates (phosphoric acid) upon yields and costs Page 27 Page 28 Page 29 Method and rate of application of fertilizer Page 30 Page 31 Miscellaneous suggestions Page 32 Summary and abstract Page 33 Page 34 Acknowledgement Page 35 Literature cited Page 36 Appendix Page 37 Page 38 Page 39 Full Text r Bulletin 333 UNIVERSITY OF FLORIDA AGRICULTURAL EXPERIMENT STATION GAINESVILLE, FLORIDA WILMON NEWELL, Director A FERTILITY PROGRAM for CELERY PRODUCTION ON EVERGLADES ORGANIC SOILS By J. R. BECKENBACH , ,. a w,, , Fig. 1.-A commercial field of celery on sawgrass peat land. Bulletins will be sent free to Florida residents upon request to AGRICULTURAL EXPERIMENT STATION GAINESVILLE, FLORIDA March, 1989 r .1 .u 4 f"l ii EXECUTIVE STAFF John J. Tigert, M.A., LL.D., President of the University Wilmon Newell, D.Sc., Director Harold Mowry, M.S.A., Asst. Dir., Research V. V. Bowman, M.S.A., Asst. to the Director J. Francis Cooper, M.S.A., Editor Jefferson Thomas, Assistant Editor Clyde Beale, A.B., Associates. Anderson, M.S,. Asst. Poultry Hush. W. G. Kirk, Ph.D., Asst. An. Husbandman R. M. Crown, B.S.A., Asst. An. Husbandman P. T.T Dix Arnold, M.S.A., Assistant.Dairy Husbandman L. Rusoff, M.S., Asst. in An. Nutritions CHEMISTRY AND SOILS R. V. Allison, Ph.D., Chemist' F. B. Smith, Ph.D., Soils Chemist Analysts Richard A. Carrigan, B.S., Asst. Chemist ECONOMICS, AGRICULTURAL C. V. Noble, Ph.D., Agricultural Economist' .irucei A. L. Stahl, Ph.D.. Associate F. S. Jamison, Ph.D., Truck Horticulturistologist R. K. Voorhees, M.S., Assistants L. O. Gratz, Ph.D., Plant Pathologist in Charge R. R. Kincaid, Ph.D., Asso. Plant Pathologist J. D. Warner, M.S., Agronom., Associate Plant Path. R. W. Kid'er, B.S., Asst. Animal Husbandman W. T. Foresee, Ptathologist W. CENTRAL FLA. STA., BROOKSVILLE W. F. Ward, M.S., Asst. An. Husbandman in Charge2 FIELD STATIONS Leesbhnrg2 Bradenton. 2On leave. A FERTILITY PROGRAM FOR CELERY PRODUCTION ON EVERGLADES ORGANIC SOILS By J. R. BECKENBACH CONTENTS Page Cultural procedure followed ............................ ............ 6 Stalk size distribution in relation to yield .....................-- ....- 7 Description of the Experimental Plots ................. ........... 9 Influence of various "trace" elements upon celery yields ................ 11 Depth of the water table ............ ............. ................. ..... 13 Cost of growing celery in the Everglades .................. ........... 13 /Influence of nitrogen upon yields and costs ............... ............. 16 Influence of potassium upon yields and costs ............................. 22 influence of phosphates upon yields and costs .................----.......-- -. 27 ethod and rate of application of fertilizer ....................................... 30 Miscellaneous suggestions ............ .........-------.........---... .. .. .. 32 Summary and abstract ........... ........................... ....... 33 Acknowledgments .................. ........ ... .. .......- 35 Literature cited .......................... ........ ................. ...... 36 A ppendix ................................ ............................. ........... ........... 37 INTRODUCTION Peat and muck soils throughout the country are particularly. well adapted to various truck crops, and especially to the leaf crops. The rapidly increasing utilization of Everglades organic soils for the production of celery is, therefore, a logical de- velopment. On the other hand celery is a notoriously gross feeder, requir- ing a heavy initial outlay of cash for fertilizer in comparison with most other truck crops. It also requires a relatively long growing season, commonly from 85 to 110 days after being set in the field, depending upon the variety and time of year grown. As long as beans were a sure money crop in the Everglades a majority of growers concentrated on this crop, but since the margin of profit has been steadily diminishing many growers in the region are, of necessity, branching out into a program of growing different truck crops. For this and other reasons, celery production is rapidly increasing. Palm Beach County shipped 347 carloads of celery in the spring of 1938 (3)1. In 1934 only 54 carloads were shipped (3), and in 1929 only 5 (7). The marketing season for the region extends from early Jan- uary through May. In comparison with other areas in the state 347 carload lots would make the area seem of minor importance, but the extremely rapid expansion in the last few years belies such a conclusion. 1Italic figures in parentheses refer to "Literature Cited" in the bacl- of this bulletin. Florida Agricultural Experiment Station Both soil type and climate are entirely suitable for celery production. There are several soil types, but all are of organic nature and origin. By far the largest area is composed of the highly organic sawgrass peat lands, which are largely still in native sawgrass. The more highly mineralized muck soils, in- cluding the custard apple, elder and lake bottom mucks, are located principally around Lake Okeechobee. To a considerable extent these latter soil types are already being intensively cropped. Their proximity to the lake makes them almost frost free, and they are utilized largely for the more tender crops, such as beans, tomatoes, potatoes and sugarcane. This will probably continue to be the case. According to soil maps there are some two and a half to three million acres of land classed as organic Everglades soils. The organic layer is too shallow over some of this area for practical cropping over a period of years. However, there are still large areas in native sawgrass which, with adequate drain- age, are entirely suitable for the growing of hardy truck crops. It is into these areas that further expansion must proceed, and for this reason most of the experimental work on celery pro- duction has been carried out on sawgrass peat soils. A brief discussion of some of the characteristics of these organic soils will emphasize their suitability for growing celery. In the first place, with adequate drainage (which should include unit ditch control and mole drainage) the level of the water table can be regulated and held at an optimum depth during the winter months. The entire growing period of the winter crop of celery comes in the dry season of winter. A dry season has no limiting effect upon the water supply-on the contrary, it has been found that the more prolonged the spring drouth, the higher the yield of celery produced. A second important factor affecting the suitability of such a soil to celery is the fact that since it is largely organic, the soil acts as a huge sponge, with a large capacity for hold- ing water, adequate pore space for necessary soil air, and a fine capacity for holding fertilizer materials, thus preventing their rapid loss by leaching waters. This latter property insures efficient utilization of fertilizer materials, and, therefore, reduces greatly the tonnage per acre that must be applied, in contrast to the amount required on coarse mineral soils. A Fertility Program for Celery Production A third important property of these soils is their high ni- trogen content. Inorganic soils under continuous cropping inevitably become nitrogen deficient, unless applications of nitrogenous materials are made from time to time. In peat and muck soils, natural chemical processes and micro-organisms within the soil are always at work disintegrating the organic material, and these processes result in a gradual release of the nitrogen in forms available to plants. Fourthly, almost all of these organic soils overlie marl or limestone, and the upward movement of soil waters during the dry season carries with it dissolved calcium and magnesium salts. For this reason none of these soils is highly acid and the addition of limestone or hydrated lime is neither desirable nor necessary. There are, of course, certain disadvantages inherent in these soils. We have already mentioned the absolute necessity of drainage ditches, and the advantages of mole drainage. There is also one direct danger inherent in organic soils wherever they may be located. This is the danger of fire-a dry muck or peat soil may be badly damaged by burning. On such a burned soil the problem of fertilization is greatly complicated because of the alkaline residues resulting from the burning, and since the fertilizer problem is already a complex one the burning off of these soils should be avoided when possible. Peat and muck soils are almost universally deficient in both potassium and phosphorus, and the Everglades soils are no ex- ception. In southern Florida there may also be a deficiency of available manganese, zinc and copper in the soil. Since the primary purpose of a good fertility program is to make avail- able to the growing plants a proper balance of all needed nutrient materials throughout the growing period of the crop, several experiments were designed for the purpose of studying this problem. They necessarily cover such essential points as the amount per acre of each fertilizer material which must be sup- plied to give the best possible yield, the most satisfactory method of applying the fertilizer, the best time for applying the fertilizer (whether entirely before planting or in part as a side-dressing), and, finally, the fertilizer program which will return the highest dividends over and above the cost of fertilization per unit area. In short, it was desired to find the most economically sound fertility program for growing celery in the Everglades. 6 Florida Agricultural Experiment Station CULTURAL PROCEDURE FOLLOWED Before entering into a detailed description of the experimental work involved in the determination of the fertility program to be suggested for the commercial growing of celery in the Ever- glades, it is desirable that certain methods involved in the grow- ing of the crops be explained. The cultural procedure followed is one of these essential parts of the experimental program. As far as possible standard commercial cultural methods were used in all of this work. The seedlings were started in raised seedbeds in the open field and protected by cloth shades until the seedlings were well established, primarily for the purpose of keeping the upper surface of the beds from drying out. These seedbeds were pretreated with formaldehyde or other materials for the control of damping-off fungi. The troughs between the beds were used for irrigation purposes to keep water available to the germinating seedlings. When the seedlings were well established this surface irrigation was stopped and the shades were removed. Weeding was done whenever necessary. The seedlings in the beds also received one or more bordeaux sprays. The seedlings were planted to the fields either by hand, using Negro labor, or by means of a commercial plant setting machine (Fig. 2). The latter method is to be preferred over hand setting. Plants were set in single rows 30 inches apart, with a 4-inch spacing between plants. This arrangement is already standard- ized commercially, and gives approximately 52,275 plants per acre. At time of setting the water table was brought to the field surface by means of portable pumps installed in the adjoin- ing ditches. Water from these ditches backed up through the mole drains and moved to the soil surface in a short time, thus making conditions for setting satisfactory. The water table was allowed to drop to its normal level as soon as the plants became reestablished in the field. A regular spray program was followed, in that plants in the field were sprayed weekly until papered for blanching. The various fertilizer mixtures were made up in small lots, in a quantity sufficient for the plots, and mixed by hand in a small mixer. Due to the fact that the plots were relatively small the fertilizers were also spread by hand. For the most part the fertilizers utilized in these experiments were hand- distributed in the opened rows at a depth of three to four inches several days prior to the setting of the plants. In treat- A Fertility Program for Celery Production ments designed to compare broadcast applications of fertilizers with the above procedure the fertilizer was applied broadcast by hand over the entire plot area and subsequently disked in. Fig. 2.-A commercial type of plant-setting machine in use on one of the experimental areas. Blanching paper was applied seven to 10 days before harvest- ing. Harvesting was done by trained crews who cut, stripped, and graded the produce in the field. The total weight of each grade harvested was taken for each plot, and these results were calculated to terms of the yield in 70-pound field crates per acre. All grades, from 3's to xx's, were considered as market- able celery, and are included in the totals dealt with in the subsequent discussion. Strippings were removed from the field, except in Area 3, where they were disked in the plots on which the plants had grown. This latter method was used with the 1936-37 and 1937-38 crops, and will be mentioned in a later part of this bulletin. STALK SIZE DISTRIBUTION IN RELATION TO YIELD While this relationship was studied in the fertility experi- ments, it is not essential that it be discussed in direct connection with the various fertilizer combinations because of the nature Florida Agricultural Experiment Station of the relationship.. For the purpose of simplification of the subsequent part of this report, this section has been placed preceding the description of the experimental plot arrangements. Celery is commonly shipped from the Everglades region in a crate which measures 10" x 24" x 16" and which contains approximately 70 pounds when packed for shipment. The celery is roughly stripped and graded in the field, the marketable celery being divided commonly into 3's, 4's, 6's, 8's, 10's and xx's. The 3's are the largest stalks and contain three dozen stalks to the crate. The other sizes also indicate the number of dozen stalks packed in the crate, with the xx's being very small. The popular medium sized stalks are the 6's, and a satisfactory crop is one in which the 6's make up the largest relative proportion of the crop, with 4's, 3's, 8's, 10's and xx's following in order. It is important that the effect of the fertility program on the stalk size distribution be known, therefore, and fortunately, for the average year this relationship is a simple one. It is simply this-with a spacing of four inches between plants and 30 inches between rows as was used throughout in the experi- mental plots, the fertility program which gave the highest yields in the average year also gave the most desirable size distribu- tion. For example, the highest 5-year average yield from Area 2 of these experiments was 589 crates per acre, and the average distribution (by weight) with regard to the various stalk sizes was as follows: 12.9% of 3's; 20.5% of 4's; 29.7% of 6's; 20.8% of 8's; 9.0% of 10's and 7.1% of xx's. In other words, 83.9% by weight of the marketable celery crop was composed of 6's, 8's, 4's and 3's. Of course, in years when the highest yielding fertility pro- gram gave particularly good yields, a larger portion of the crop was represented by 3's and 4's. Conversely, when celery yields were relatively low, the preponderance of the crop was 6's and 8's, with a sizable proportion of 10's. However, since it is impossible to foretell the yield at the time the fertilizer is applied, the best that can be done is to rely upon the average, and the average shows that when you fertilize to obtain the highest possible yield, the stalk size distribution will take care of itself in a satisfactory manner. For this reason, the stalk size distribution will be disregarded in the balance of this bulle- tin, and the fertilizer treatment which gives the highest yields will be considered the best treatment. A Fertility Program for Celery Production DESCRIPTION OF THE EXPERIMENTAL PLOTS The Brown Company, at Shawano Farms, cooperated with the Everglades Experiment Station over a two-year period (1930-32) in a comprehensive study of the use of fertilizers for celery production on sawgrass peat lands. The experimental area (Area 1 of this report) was located in the southeast corner of Lot 1 of Section 22 and in the north end of Section 21. This land had been plowed for the first time in January 1926 and had been planted successively to potatoes and three crops of peanuts. During this period the total amount of chemicals which had been applied to the area as either fertilizers or dusts amounted to 112.5 pounds of copper sulfate and 12 pounds of zinc sulfate per acre. No other materials had ever been added. Sixty-six different fertility treatments were tested upon this area. Each was used on four separate 1/75 acre plots so scat- tered through the field that averages of the four plots of any treatment could be compared to similar averages of other treat- ments. Tested in these treatments were the influence of the composition of the fertilizer mixture, the source of the various fertilizer ingredients, and different methods, time and rate per acre of fertilizer applications. Experimental Area 2 was located in Section A of the north- west sector at the Everglades Experiment Station at Belle Glade. Originally this land was covered with native sawgrass but after the excavation of the main canal elder came in on the disturbed area along the banks of the canal. In June 1924 this land was ditched, and at this time most of the area was under a heavy growth of elder, which extended to the native sawgrass in an Fig. 3.-A field view across the experimental plots in one of the experimental areas. Florida Agricultural Experiment Station irregular line near the southern edge of Section A. The land was subsequently cleared and remained fallow throughout the winter and spring of 1926. In March 1926 and again in 1927 corn was planted in the area, without any addition of fertilizer. In September 1927 and again in 1928 the area was divided into plots and tested for response to manganese, phosphates, potash and copper, with a variety of different crops. In 1930, after having received no fertilizer for almost two years, the area was again divided into plots for a celery fertility experiment. Seven- teen different fertility treatments were included, each replicated six times on plots of 1/90 acre each. They were planted to celery for the first time in the late fall of 1930, and celery was planted each year thereafter until the final crop was harvested in the spring of 1936, after which this series of plots was abandoned and a new series begun in Area 3. Throughout this period of six years other truck or cover crops were planted after the celery was removed in the spring but none received addi- tional fertilizer. Fertilizer was added only for the celery crop. All celery strippings were removed from this area each year. Experimental Area 3 was broken out of native sawgrass in the fall of 1933. This area is located in the south half of Section D of the southeast sector at the Everglades Experiment Station. It was moled at a depth of 30 inches throughout, at an approximate spacing of 15 feet. It was plowed again in the spring of 1935 and a third time in 1936. From the time it had been broken in 1933 it had been disked several times to keep down weed growth, although it was not kept in a continuously fallow condition throughout this period. The entire area re- ceived its first fertilizer treatment on January 26, 1937, five days before the first celery plants were set. This treatment consisted of a broadcast application of copper, manganese and zinc sulfates, at rates of 100, 100 and 15 pounds per acre, re- spectively, over the entire area. The area was divided into 40 plots, consisting of four plots each of 10 different fertility treatments. The individual plot area was slightly less than 1/30 acre. These different fertilizer treatments were applied on January 28 and the plants were set the first week in February for the first celery crop on this area. All strippings from the plots of this area were turned back to the soil upon which they were produced. A Fertility Program for Celery Production INFLUENCE OF VARIOUS "TRACE" ELEMENTS UPON CELERY YIELDS It has been known for years that all plants require small amounts of several trace elements for satisfactory growth. Of v these, at least a few are not present in quantities sufficient for celery in Everglades organic soils. Trace elements which are known to be low are manganese, zinc and copper, and possibly boron in some areas. There may be others, but their need has not yet been satisfactorily demonstrated. Areas 1 and 2 were used for studies of the effect of trace elements upon celery yields. Of these trace elements, manganese seems to be the one . most commonly found deficient in these organic soils with re- spect to most truck crops. The availability of manganese, like that of phosphate, is partially dependent upon the degree of acidity or alkalinity of the soil. However, experiments have shown that there is an absolute deficiency of manganese in these soils, regardless of their reaction, inasmuch as celery has shown a decided response to manganese even on the unburned soils. Therefore, it is recommended that 100 pounds per acre of man- - ganese sulfate be applied with the fertilizer to these soils the first year celery is grown, provided no manganese has been previously added to the land. For succeeding years much less will be required and probably 25 pounds per acre should be J sufficient. Alkaline burned soils will require more than will the normal soils of the area. Manganese can be supplied also combined with the bordeaux sprays which should be applied weekly for the control of early blight. It is known that this method is satisfactory for some other crops. It is suggested that four pounds of 83% man- ganese sulfate be added to 50 gallons of spray solution (5), and used in this manner for the first three or four weekly sprays in the event that no manganese is applied with the fertilizer. It is not desirable to delay the application of manganese until the plants show a deficiency in the field, since by that time the plants are already severely injured and will never make the crop that they would have made had the manganese been supplied earlier. Zinc is another trace element which can be added in fertilizer-- applied to Everglades organic soils. The requirement of celery for zinc is not large, but the addition of 25 pounds of zinc Florida Agricultural .Experiment Station sulfate per acre in the fertilizer, the first year, serves as an inexpensive insurance against zinc deficiency. In subsequent years 10 to 15 pounds per acre should be sufficient. As an /alternative procedure, zinc sulfate (89%) also can be supplied with the first few bordeaux sprays, at the rate of 2 pounds per 50 gallons of spray solution. Zinc deficiency has not been definitely observed with celery on these soils, although there has appeared to be some response to added zinc, and the response to zilic of some other crops, such as beans, peas, cabbage, and potatoes (6) has been quite marked. The use of copper is not such a problem with celery, inasmuch as copper is the normal base for bordeaux sprays. However, work with copper as a plant nutrient has indicated that it must be present in the soil for benefit to the crop. The first year that celery is grown on an area it is well to add some snow-form v bluestone (copper sulfate) along with the fertilizer. One hundred pounds to the acre should suffice. For subsequent crops the copper added in the bordeaux sprays will leave suffi- cient residue in the soil and additional copper need not be added. Boron is still something of an unknown quantity on Ever- glades soils where celery is concerned. In other sections of the state (2) boron deficiency is known to develop as "cracked- stem" disease, but little celery showing these symptoms has been reported in the Everglades. Plants require boron in very small quantities, and since it is known that many fertilizer materials, such as natural nitrate of soda, triple superphosphate, and most organic fertilizers (1) contain small amounts of boron, when-these ingredients are used in the fertilizer there is little possibility of boron deficiency symptoms appearing. When synthetic fertilizers are used exclusively in mixing the fertilizer it might be well. to add 10 to 15 pounds of borax per ton of fertilizer as an insurance against deficiency of boron. Large amounts of borax will prove toxic to plants, and are very dangerous. According to present knowledge no other trace elements need be added to these.soils. If others are required, it is probable that they are present in sufficient quantity as impurities in the fertilizer materials commonly used. With respect to magnesium, calcium and iron, there seems to be a sufficiency of these ma- terials present in these soils natively, at least for several years' cropping. It is recommended that no further supply of any of these three be added. A Fertility Program for Celery Production DEPTH OF THE WATER TABLE Strictly speaking, water is as necessary for plants as is any material commonly applied through the medium of the soil. With respect to the absolute quantity required, water can be considered by far the most important nutrient of all. For this reason the supply of water available to celery roots is of the utmost importance and this should be the first factor considered by the grower. Since the depth of the water table can be simply regulated within certain limits on these soils by means of mole drainage and adequate ditching and pumping, and since water control is such an important factor with celery, experimental work has been carried out in which the water table was held at levels varying from 6 to 30 inches below the surface with several crops of celery. The resulting data permit the drawing of very positive conclusions. Except at the time of sowing the seed and at the time of setting the plants to the field, the water table should be kept at a depth of from 16 to 24 inches through- out the entire growing period of the crop. A high water table shuts necessary soil air from the plant roots and results in "drowning" the crop, and a very low water table may result in a water deficiency. COST OF GROWING CELERY IN THE EVERGLADES There are, of course, many factors which make it impossible to present cost data which will fit the growing of a crop in any location under all conditions or for all seasons. Among these can be included such factors as the size of the farm, cultural procedure followed, possible extraordinary invasions of insects or diseases, and the ability of the grower to deal with specific problems as they appear. Nevertheless, in experimental work it is important that the fertilizer program to be recommended or suggested for field application be one which produces the highest economical yield. There is always, with every crop, a point beyond which added fertilizer produces an increase in yield insufficient to pay for the application. The only valid way in which this point can be determined is by estimating, as accurately as possible, the prob- able cost of producing a crop of celery in the average season. For this purpose of comparing different fertilizer combinations in terms of their effects upon yields, a cost break-down is pre- 14 Florida Agricultural Experiment Station sented in Table 1, which includes all costs attendant upon the production of a crop under average conditions for the 1937-38 season. TABLE 1.-AVERAGE COSTS AND RETURNS FOR AN ACRE OF CELERY, BELLE GLADE AREA, FLORIDA, SEASON OF 1937-38.* Number of operators ..................................... ................ 4 A cres planted ......... ..... .................... ........................................ 408 Acres harvested ................................................................ .... ... 364 Average yield of harvested acreage (crates) .............................. 448 Per Acre Cost of Growing Plants: Rent on land .....................................$ .54 Preparing seedbed ................................................... ........ .. 5.73 Fertilizer ....................... ............................ ............ .86 Seed .............................. ........... 2.90 Applying fertilizer and seeding .......................................... .32 Spraying-including materials ................................. 1.33 Irrigation expense ......... ........... ................... ......... .99 Labor (weeding and covering beds) ...................................... 4.24 Depreciation on seedbed frames and covers ...................... 5.50 M miscellaneous ............................ ...................................... .28 Total ..................................................... $ 22.69 Costs of Growing and Harvesting: Rent on land ..................................... ...................................$10.91 Growing cover crop .......................................... ................. 3.58 Preparing land for celery .................................................. 6.07 Fertilizer ........................................ 34.77 Applying fertilizer ............................. .................. .86 Transplanting from seedbed to field .................................. 14.03 W after control .......................................... ....... ................... 2.88 Cultivating and weeding .................................................. ...... 11.64 Spraying-including materials ........................................... 16.17 Blanching: Applying and removing paper ...................................... 11.38 Depreciation on-paper and wire .................................... 9.30 Cutting celery and field stripping .................................... 34.36 Hauling to packinghouse ..................................................... 15.68 Total .............................. .... ... ......... ... $171.63 Cost of Marketing: Grading ................................................................. ........... $58.24 Pre-cooling. ............ .......... ......... .... ... 35.84 Crates ............................................................ 85.12 Selling ......-...... ........ ............ .................. ........................ 32.70 Total ........................................ ... ............ $211.90 Total cost excluding production interest and operator's supervision ---............................ .................... $406.22 Returns from celery marketed .......................................................... 487.76 Net returns to operator .............................................................................. 81.54 *Data furnished by R. H. Howard of the Economics Department, Agricultural Extension Service. University of Florida. A Fertility Program for Celery Production 15 Detailed cost data for previous seasons, are not available, but since with expanding future acreage there is little likelihood that the cost per acre will go up, the data in this table will be used in making cost comparisons in this bulletin. Since this experimental work has consisted of comparisons between several different fertilizer treatments, the cost of fer- tilizer per acre as reported in Table 1 ($34.77) will be subtracted and the actual fertilizer costs of the various treatments sub- stituted. The cost of fertilizing the plants in the seedbeds has been considered as a constant item for all treatments, and for this reason, this cost item ($0.86) will not be subtracted as are the other fertilizer costs. Also, to arrive at a base figure which will represent the total cash outlay of the grower, all costs of marketing after delivery to the packinghouse will be omitted. This basic cost figure is, therefore, $159.55, to which must be added the cost of the fertilizer. Actually, since the number of crates per acre influences the cost of harvesting and hauling somewhat, this basic figure is probably slightly high for poor yields and slightly low for high yields. For the purpose of comparison in this bulletin, how- ever, it will be considered constant. Table 2 is a very simple table devised and included principally for convenience in reference. This table shows the influence of two factors, yield of celery and cost per acre (including fer- tilizer), upon the actual cost to the grower of each field-trimmed crate of celery produced. It should be understood that these costs cover the celery to the point where it has been stripped in the field, and the cost per crate refers to the cost per 70-pound field crate only. All yield data mentioned in this bulletin will be given in terms of field-trimmed crates. Addi- tional trimming at the packinghouse will cause about a 20% shrinkage in the total number of crates as listed in this table and referred to in other parts of this bulletin. Costs of washing, grading, pre-cooling and packing, broker's commission, crates and shipping, are not included in Table 2. These costs need not be included, inasmuch as they are taken out of the gross return before the grower is paid for his produce. The check which the grower finally receives for his produce represents his total return, which must more than cover all costs incurred up to delivery of the crop to the packinghouse, if a net profit is to be made. For example, assume that the grower sent one acre's yield of 500 crates of celery to the packinghouse, and received Florida Agricultural Experiment Station a check for $250.00 for it. This would give him a return of 50c a field-trimmed crate for his crop, although further trimming and repacking at the packinghouse might have reduced to 400 the number of crates actually shipped. Assuming that the total cost to the above-mentioned grower, including fertilizers, was $180.00, he should have a net profit of $70.00 per acre, and it is shown in Table 2 that this celery cost him 36c a crate. If he had received 50c a field crate for a yield of 350 crates per acre, with the same field costs, he would have had a net loss of $5.00 an acre. Table 2 can be used to show the yield which must be obtained at any given field cost to break even or to show a profit at any return, per 70-pound field crate, from the packing- house. It should be obvious that any outside factor, such as a market- ing agreement which places a restriction upon the percent of the celery grown which can be shipped, is, in effect, decreasing the yield per acre, and must be interpreted as such in Table 2. INFLUENCE OF NITROGEN UPON YIELDS AND COSTS Despite the fact that available nitrogen is being released in these peat soils at all times, celery is such a gross feeder that in no case has a crop been grown at the Everglades Experiment Station (Areas 2 and 3) that did not show a yield response to nitrogen fertilizers. Experiments comparing different materials as sources of ni- trogen, and for the purpose of finding the amount of nitrogen which should be added, were conducted in Area 1. It was found that there was no increase in yield from a fertilizer analyzing higher than 30% nitrogen when one ton or more was applied to the acre. Nitrate of soda, sulfate of ammonia, and castor pomace were used alone and in various combinations. Over a two-year period there seemed to be little difference in the source of the nitrogen supply, whether organic or inorganic. In Area 2, at the Experi- ment Station, a mixture of half castor pomace and half sulfate of ammonia proved satisfactory, and in Area 3, a mixture of sulfate of ammonia and nitrate of soda gave good results. This latter mixture is to be recommended because of its lower cost per unit of nitrogen, or, on neutral or slightly alkaline soils, sulfate of ammonia may be used as the sole source of supply. TABLE 2.-THE NET COST, PER CRATE, FOR GROWING CELERY IN THE EVERGLADES, TABULATED ACCORDING TO THE TOTAL COST PER ACRE AND THE YIELD IN TERMS OF THE NUMBER OF CRATES OF MARKETABLE CELERY PRODUCED PER ACRE. COST PER ACRE FIGURES INCLUDE ALL FIELD COSTS AS LISTED IN TABLE 1, PLUS THE COST OF ALL FERTILIZER MATERIALS. No. crates per acre 175 200 225 250 275 300 325 350 375 400 425 450 475 500 525 550 575 600 625 650 675 700 725 750 775 800 825 850 875 900 925 950 975 1000 $130 $0.75 .65 .58 .52 .47 .43 .40 .37 .35 .32 .31 .29 .27 .26 .25 .24 .23 .22 .21 .20 .19 .19 .18 .17 .17 .16 .16 .15 .15 .14 .14 -.14 .13 .13 Cost per crate when the acre cost of production is: $140 $150 $160 $170 I $180 I $190 $200 $210 $0.80 $0.86 $0.91 $0.97 $1.03 $1.09 $1.15 $1.20 .70 .75 .80 .85 .90 .95 1.00 1.05 .62 .67 .71 .76 .80 .84 .88 .93 .56 .60 .64 .68 .72 .76 .80 .84 .51 .55 .58 .62 .65 .69 .73 .76 .47 .50 .53 .57 .60 .63 .67 .70 .43 .46 .49 .52 .55 .58 .62 .65 .40 .43 .46 .49 .51 .54 .57 .60 .37 .40 .43 .45 .48 .51 .53 .56 .35 .38 .40 .42 .45 .48 .50 .52 .33 .35 .38 .40 .42 .45 .47 .49 .31 .33 .36 .38 .40 .42 .44 .47 .29 .32 .34 .36 .38 .40 .42 .44 .28 .30 .32 .34 .36 .38 .40 .42 .27 .29 .30 .32 .34 .36 .38 .40 .25 .27 .29 .31 .33 .35 .36 .38 .24 .26 .28 .30 .31 .33 .35 .37 .23 .25 .27 .28 .30 .32 .33 .35 .22 .24 .26 .27 .29 .30 .32 .34 .22 .23 .25 .26 .28 .29 .31 .32 .21 .22 .24 .25 .27 28 .30 .31 .20 .21 .23 .24 .26 .27 .29 .30 .19 .21 .22 .23 .25 .26 .28 .29 .19 .20 .21 .23 .24 .25 .27 .28 .18 .19 .21 .22 .23 .25 .26 .27 .18 .19 .20 .21 .22 .24 .25 .26 .17 .18 .19 .21 .22 .23 .24 .25 .16 .18 .19 .20 .21 .22 .24 .25 .16 .17 .18 .19 .21 .22 .23 .24 .16 .17 .18 .19 .20 .21 .22 .23 .15 .16 .17 .18 .19 .21 .22 .23 .15 .16 .17 .18 .19 .20 .21 .22 .14 .15 .16 .17 .18 .19 .21 .22 .14 .15 .16 .17 .18 .19 .20 .21 $220 1 $230 $1.26 $1.31 1.10 1.15 .98 1.02 .88 .92 .80 .84 .73 .77 .68 .71 .63 .66 .59 .61 .55 .58 .52 .54 .49 .51 .46 .48 .44 .46 .42 .44 .40 .42 .38 .40 .37 .38 .35 .37 .34 .35 .33 .34 .31 .33 .30 .32 .29 .31 .28 .30 .28 .29 .27 .28 .26 .27 .25 .26 .24 .26 .24 .25 .23 .24 .23 .24 .22 .23 $240 $1.37 1.20 1.07 .96 mO .87 . .80 . .74 .69 .64 .60 o .56 .53 .51 .48 , .46 0 .44 .42 .40 S .38 , .37 .36 1 .34 0 .33 F- .32 .31 .30 .29 .28 .27 .27 .26 .25 i .25 .24 Florida Agricultural Experiment Station Figure 4 represents comparisons between fertilizers with and without nitrogen with respect to yields of celery over an eight- year period at the Everglades Experiment Station. In each comparison represented the only difference in treatment in the entire growing period of the crop was in the amount of nitrogen included in the fertilizer mixture. The smallest response to nitrogen in the period represented by the graph occurred in the 1936-37 crop on Area 3. The low yields of this year appar- ently were caused by two factors-the extremely dry condition of the surface soil when the plants were set, which necessitated a resetting of much of the area, and constant rains shortly after the plants had finally become well established, which kept the soil water-logged for more than a week. This crop was not set to the field until early February, and rains were abnormally early. Fig. 4.-The influence of a 3% nitrogen fertilizer on the yield of marketable celery produced per acre for eight crops, on sawgrass peat land. The yield represented by the figures is given in terms of the number of field-trimmed crates produced per acre. (Yield data for the five separate years which go to make up the five-crop average in Area 2 are listed in Table 5 in the appendix.) The comparison of the 0-41/2-61 vs. the 3-41/-6 with respect to yields is represented at the extreme left of Figure 4 for the single year 1930-31. This was a preliminary test and was some- what modified for the subsequent five-year period. 1 0-4%-6 = 0% Nitrogen, 4 z% P20,, 6% K20. A Fertility Program for Celery Production Differences represented by the five-year averages of the sub- sequent, crops on Area 2 were significant statistically, with calculated odds of more than 50 to 1. This means that for every one of these five crops there were striking differences in yield in favor of the fertilizer containing nitrogen, and that the average difference for this period was 75 field crates of marketable celery per acre. Since in this area the nitrogen used was half from castor pomace [with a cost to the grower of 37.1c per pound of nitrogen (4)] and half from ammonium sul- fate [with a cost of 9.8c per pound of nitrogen (4)], the total cost per acre for the nitrogen alone in the 3% fertilizer was $28.16. All strippings were removed from the plots each year in this area and the fertilizer was supplied at the rate of 2,000 pounds per acre before planting, with an additional 2,000 pounds per acre applied later as side-dressing. The total growing cost per acre, including fertilizer (4), for each year of this five-year period was as follows for the two fertilizer combinations used in this comparison: Without With 3% nitrogen nitrogen Growing cost (see Table 1) ............................ $159.55 $159.55 Superphosphate ................................ .... 9.52 9.52 Sulphate of potash ................................... 12.74 12.74 Castor pomace ....... ................... 0 22.28 Sulphate of ammonia .......... ............... 0 5.88 Mixing cost @ $3.50 a ton (4) ............. 7.00 7.00 Total cost per acre .................................. $188.81 $216.97 Comparative average yields, Fig. 4, were 435 and 510 field crates per acre, respectively, for those two treatments and for five different crops of celery. The growing cost per field crate of marketable celery produced (Table 2) was nearly the same for each of these two treatments. Actually, the cost per crate without nitrogen was 43.4c, as compared with 42.5c per crate where nitrogen was used. There were, therefore, 75 crates more per acre produced where nitrogen was added to the fertilizer, at a slightly lower cost per crate. If we assume a return to the grower of 50c per field crate, the total return per acre with- out nitrogen would be $217.50, with nitrogen $255.00. For the former the net profit per acre would be $217.50 minus $188.81, or $28.69. For the treatment with nitrogen the comparable net profit would be $255.00 minus $216.97, or $38.03. Nitrogen in the fertilizer would, therefore, increase the net profit per acre by $9.23, assuming a return of 50c per field-trimmed crate. Florida Agricultural Experiment Station This is a return of approximately 33% on the investment of the nitrogen in the fertilizer. A higher return per field crate (as in 1937-38, Table 1) would mean a greater difference be- tween the profits realized from the two treatments, and, con- versely, a lower return would tend to minimize the treatment differences from the economic standpoint. The other three comparisons shown in Fig. 4 are for one-year yields only and are, therefore, not so dependable as are the fig- ures for the five-year average. For the 1930-31 crop, mentioned briefly -above, a total of only 2,000 pounds of fertilizer per acre was used, one-half before planting and one-half as a side- dressing. This was a good year for celery, as can be seen from the yields obtained. The same materials were used in the fer- tilizer as outlined in the discussion of the five-year yields, but with the amount of fertilizer used only one-half as large, the crop costs per acre were slightly lower, being $174.23 without nitrogen and $188.26 with nitrogen. Respective yields were 601 and 685 field-trimmed crates per acre, which give a growing cost per crate of 29.0c for the former and of 27.5c for the latter. It is obvious that the nitrogen added in the latter treatment proved an excellent investment, since this treatment not only produced 84 more crates per acre but reduced production costs 11/2c per crate. Assuming, as above, that the grower received a return of 50c a field-trimmed crate, the net profit per acre of celery for the year would have been $126.27 without nitrogen and $154.24 with nitrogen. The return ($27.97> from an in- vestment of $14.08 worth of nitrogen fertilizer in this case would be almost 200% for this year, with the celery selling at 50c per field-trimmed crate. The 1936-37 crop, Figure 4, has been already mentioned with respect to unfavorable conditions for production. Yields were very low with both treatments, the treatment containing nitro- gen yielding but five crates per acre more than the one without. This was the first crop grown in Area 3 and was fertilized with 2,000 pounds per acre before planting and another 2,000 pounds as side-dressing; formulas used were 0-6-12 and 3-6-12. The nitrogen was supplied in the latter as half sulfate of ammonia and half nitrate of soda, which lowered considerably the nitro- gen cost in comparison to that in Area 2 in the previous year already discussed, since the State Chemist's quotation on the nitrogen in nitrate of soda is 12.4c per pound (4). Other materials were the same as those used in Area 2. The field A Fertility Program for Celery Production cost for growing this crop was $188.41 without nitrogen and $201.73 per acre with nitrogen. From Table 2 it can be seen that the cost per crate of celery was approximately 64.5c for the former and 67.9c for the latter. With a 50c per crate return for the celery, it is obvious that a net loss would be incurred from both treatments, and despite the five-crate difference the loss from the treatment in which nitrogen was added would be heavier. With a 70c return per crate both treatments would have shown slight profits but under no probable market condi- tions could the nitrogen have paid for itself. This has been the only crop of the eight grown at the Experiment Station in which the addition of nitrogen fertilizer has not yielded an economically profitable return at 50c per field-trimmed crate for the increased yield obtained. The year 1937-38 was, by contrast, a fine year for celery, as is indicated by the yields represented in Fig. 4. The strip- pings of the previous year's crop had been returned to the soil, and as a consequence only one ton of fertilizer was used, all applied before planting. The costs per acre were somewhat lower, being $173.98 without nitrogen and $180.64 with nitrogen. The cost per field-trimmed crate is found to be 19.3c for the former treatment, with a yield of 903 crates per acre, and 18.9c per crate for the latter, with a yield of 958 crates per acre. Almost any return will net a considerable profit under these conditions but the latter treatment, with a higher yield per acre as well as a slightly lower cost per crate than the former, is undoubtedly an economically sound fertilizer treatment. Actually, the 1937- 38 season found marketing agreement restrictions in effect, so that the full yield could not be marketed. In summing up the effects of nitrogen in fertilizer, it has_ been found that in eight successive years fertilizer mixtures containing phosphate and potash plus 3% nitrogen have given higher yields than fertilizers of the same potash and phosphate content without nitrogen. These yield responses to nitrogen re- sulted whether all of the fertilizer was applied before planting or whether 1fart was applied as a side-dressing. In seven of these eight years the increased yield due to added nitrogen was sufficient to more than pay the cost of nitrogen, at the very conservative estimated value of 50c per field-trimmed crate. Therefore, a total of 60 pounds per acre of nitrogen, applied with the necessary phosphate and potash before the plants are set, is the suggested procedure for commercial celery growing Florida Agricultural Experim't Station in the Everglades on sawgrass peat lands. Mixtures of sulfate of ammonia and nitrate of soda, or either of these alone, should be suitable nitrogen sources, from the standpoint of both cost and returns. 'INFLUENCE OF POTASSIUM (POTASH) UPON YIELDS AND COSTS Natively, these soils are very low in potassium. It is, there- fore, of the utmost importance that both the amount and the source of potash best for celery be determined. With respect to source, it was found in Area 1 that sulfate of potash, muriate of potash, and hardwood ashes were all acceptable as potash fertilizers. Kainit showed up well one year but poorly another. According to the 1937 State Chemist's report (4), these ma- terials cost the grower as follows: Sulfate of potash ........................ 5.31c per pound of K2O Muriate of potash ...................... 3.83c per pound of KO2 Kainit ............. ................ 6.25c per pound of KLO 3% Hardwood ashes .................... 35.00c per pound of K2O The excessive cost, per pound of K20, makes hardwood ashes far too expensive for general use, although if available in quan- tity they are a fine fertilizer material. Kainit also is relatively expensive per pound of potash and this, together with the un- certainty attached to its results, makes it a less desirable fertilizer than the other two potash salts. For this reason only the muriate and the sulfate of potash were used with celery in the trials at the Experiment Station. Figure 5 illustrates a comparison between these two materials. As a five-year average the muriate of potash produced 51 crates per acre per year more than did the sulfate. All in all, using results of two years in Area 1, six years in Area 2, and two years in Area 3 (a total of 10 separate crop comparisons), the muriate of potash plots outyielded the sulfate of potash plots in seven cases. Statistically these differences are not considered significant (the statistical odds for the five-year average from Area 2 were 5 to 1), but from the practical standpoint it is clear that, because of the difference in cost of the two materials, muriate of potash has proven preferable to the sulfate for celery. With regard to the quantities of potash which must be sup- plied, it was found that with the first celery crop grown on each of the three areas a relatively low amount of potash was required (a 6 to 8% potash analysis fertilizer, applied broad- A Fertility Program for Celery Production 23 cast at the rate of one ton per acre before planting gave good results). With all subsequent crops larger amounts of potash were required. This difference between the first and other years is probably only the result of a partially adequate reserve supply of potash in previously uncropped soils, or of previous cropping with a crop which removes relatively less potash than does celery. I... .. v m,.' - -_ t= ..>- .; tA m o --.t b s Ar-ea "Z.- Q -,r of celery, per acre, over an eight-year period. For each comparison the amounts of potash (KO) applied were the same. The yield represented by the figures is given in terms of the number of field-trimmed crates produced per acre. (Yield data for the five separate years which go to make up the five-crop average in Area 2 are listed in Table 6 in the appendix.) It may be readily seen from Figs. 6, 7 and 8 that celery grown without potash will be practically a failure on these soils. From the economic standpoint this possibility is further 500- "-" i -. .. emphasized-for the five-year average period covered by Table 3 a return of 65c a crate would have been necessary for the grower to break even with celery for this period, in the event that he fertilized only with phosphate. The data comprising Table 3 were calculated in the same way that similar data were treated in the previous section on nitrogen fertilizers. It should be remembered that both yield per acre and cost and return figures are based upon field-trimmed cratates, rather than crates as actually shipped from the packinghouse. Sea-o *r Florida Agricultural Experiment Station ".n _l lll. . 400- 54) 300- (246) 200 - 100 - A l -- .9 " Fig. 6.-The influence of different amounts of potash (KaO) fertilizers on the yield of marketable celery produced per acre for two crops grown on Area 1. The yield represented by the figures is given in terms of the number of field-trimmed crates produced per acre. TABLE 3.-THE ECONOMIC VALUE OF POTASH FERTILIZERS FOR CELERY PRODUCTION IN THE EVERGLADES. Fertil- Yield Cost Total Re-i Treatment izer per Cost per per I turn per Net Profit Number Formula' Acre2 Acre3 Crate Acre' j per Acre A-1 0-0-0 174 $159.55 $0.92 $ 87.00 -$72.55 (loss) A-2 0-0-6 352 179.29 .51 176.00 3.29 (loss) B-1 0-4%-0 222 176.07 .79 111.00 65.07 (loss) B-2 0-4%-6 435 188.81 .43 217.50 + 28.69 B-3 0-4%-12 538 201.55 .37 269.00 + 67.45 C-1 0-9-6 466 198.33 .43 233.00 + 34.67 C-2 0-9-12 536 211.07 .39 268.00 + 56.93 'One ton applied at planting, one ton applied later as side-dressing. 'Calculatel as of 70-lb. field-trimmed crates of marketable celery produced per acre. 3Including cost of fertilizer materials, cost of mixing fertilizer @ $3.50 a ton, and all field costs up to and including stripping and field grading. 'Assuming a return to the grower of 50c per field-trimmed crate, after all packinghouse charges, brokerage fees, freight costs, etc., have been deducted. The yield data represented in Figure 7 and listed in Table 3 are all based on five-year average harvests. The comparisons included show differences between comparable treatments which have been calculated to be highly significant statistically, with odds greater than 50 to 1 in all comparisons. Figures 6 and 8 are presented to show the lower potash requirement which was found for the first celery crop in these areas, and also serve to emphasize the importance of potash fertilization. They would A Fertility Program for Celery Production seem also to indicate that in good celery years, such as 1931-32 and 1937-38, a fertilizer analyzing even higher than 12% potash applied at the rate of one ton to the acre before planting (more than 240 pounds of K20 per acre) might be beneficial, but a later discussion of the yields from Area 2 will show that a higher application will probably not be advantageous from the commercial standpoint in the average year. 600 - 500 - 400 - o00 - 00 (174) 100 I No P 65 No pc,0O I 43bJ ht 62. .IO5 4:-: Pr05l Fig. 7.-The influence of different amounts of potash (K2O) fertilizers on five-year average yields of marketable celery produced per acre on Area 2 at the Everglades Experi- ment Station. The different amounts of potash applied were tested at each of three levels of phosphate (PaOs). The yield represented by the figures is given in terms of the number of field-trimmed crates produced per acre. (Yield data for the five separate years for all of these comparisons are listed in Table 7 in the appendix.) Fig. 8.-The influence of different amounts of potash (KzO) fertilizers on the yield of marketable celery produced per acre for two crops grown on Area 8. The different amounts of potash applied were tested at each of three levels of phosphate (PsOs). The yield repre- sented by the figures is given in terms of the number of field-trimmed crates produced per acre. II go %gO 9% 1aOs Florida Agricultural Experiment Station Table 3 has been included to emphasize the economic advant- age of the use of potash fertilizers for celery. Here, as in the discussion of nitrogen fertilizers, the cost of the fertilizer was taken from the 1937 report of the State Chemist (4), the standard mixing charge has been added, and the total added to the basic figure found previously to represent the costs of carrying celery through to the field-trimmed crate, all on the "per acre" basis. The rate was one ton of fertilizer to the acre applied before planting and one ton per acre as side-dressing when the crop was partly grown. The cost of both tons has been included, although it has been found that in the event strip- pings are not removed from the field the fertilizer added as side-dressing would not have been necessary. The advisability of such a procedure is discussed in the latter part of this bulletin. Returning to the discussion of Table 3, again it has been assumed that the marketable celery brought a gross return to the grower of 50c per field-stripped crate, in order to compare the several treatments listed from the standpoint of net profits per acre. With respect to each or any comparison in this table, the treatment higher in potash has produced the crop with the lower cost per crate. Under any probable market conditions such a condition must make the use of the higher potash analysis fertilizers economical. For this reason the use of 12% potash fertilizers, properly mixed with nitrogen and phosphate, is sug- gested for commercial practice, under conditions comparable to those under which these crops have been grown. Table 3 does not list any 15 or 18% potash fertilizers and it might be assumed, as mentioned above, that because of the other comparisons an analysis higher than 12% might prove economically feasible when applied at the same rate (one ton) per acre. No 0-41/2-18 fertilizers were tested in Area 2. How- ever, a fertilizer with the approximate analysis of 0-12-18 was included in the experiment. In three of the five years this treatment outyielded the 0-4/2-12 by 3, 21 and 27 crates per acre, while in the other two years the 0-4-12 outyielded the 0-12-18 by 3 and 16 crates per acre. No significance can be attached to such irregular results. It is also most unlikely that the extra phosphate depressed the yields. Thus it can be seen that the 6% potash fertilizer produced a tremendous yield response from celery compared with that produced by a fertilizer entirely deficient in potash; that a 12% potash fertilizer produced a relatively smaller but still sizeable A Fertility Program for Celery Production increase in yield over that of the 6% fertilizer; and finally, that an 18% potash fertilizer produced a slightly higher yield in three out of five years than did the 12% formula, but not enough higher, in the average year, for the yield increase to pay for the additional potash applied per acre. This can serve to illustrate the economic law of diminishing returns as applied to fertilizer usage. From the standpoints of both yield and net profit per acre, therefore, a fertilizer analyzing 12% potash, properly balanced with nitrogen and phosphate, is suggested for celery. The ratio of nitrogen to potash which has given best results has been found to be 1 to 4. The ratios of phosphate to the other two nutrient materials will be discussed in the next section. Muriate of potash is recommended as the most economical potash source, although sulfate of potash and hardwood ashes are suitable in all respects except their higher cost per unit of potash. INFLUENCE OF PHOSPHATES (PHOSPHORIC ACID) UPON YIELDS AND COSTS These peat and muck soils are also very low in phosphates, perhaps even lower than in natural potash content. Further- more, the availability of phosphate to celery-or to any other plant-is dependent upon other factors, largely the reaction and calcium content of the soil. At the normal soil reactions usually found in this region (slightly acid to slightly alkaline) part of the phosphate forms a relatively insoluble compound with cal- cium or with some other soil constituent, and thus becomes less available to the plant roots. Many sources of phosphatic fertilizers are used and varied results may be expected on different types of soils. In Area 1 of these experiments several phosphate sources were compared, including 16% superphosphate, colloidal phosphate, floats, for- eign basic slag, and domestic basic slag. Of these, floats and colloidal phosphate were found to be definitely unsatisfactory materials, regardless of cost. The other materials all were more or less satisfactory, the domestic basic slag in particular showing up well. However, it is practically impossible to com- pare these basic slag materials with the superphosphates on the unit P20s basis, because of a rather wide variability in the phosphate content of slags from various sources, and because the guaranteed analyses of the slags are usually much lower Florida Agricultural Experiment Station than the actual available phosphate content. The basic slags also contain from 1 to 3% of manganese oxides, and since manganese is also very low in these soils it is impossible to tell how much of the yield difference is due to the source of phosphate and how much to the various trace elements present in the slag. In general, basic slag is well suited to unburned soils and less suited for use on alkaline soils. Should home mixing of fertilizer be practiced, ammonia fertilizers should not be mixed with basic slags, or some of the ammonia will be lost. . The superphosphates, "single" or "triple", can be used more or less interchangeably. Triple superphosphate is slightly cheaper per unit of P205 (4), and more economical, higher analysis fer- tilizers can be mixed when this material is used. These are probably the most satisfactory phosphatic materials on neutral or alkaline soils, and they have proven very satisfactory on the slightly acid soils of the Everglades Experiment Station. The available phosphoric acid (P205) has a cost of 5.5c per pound in 16% superphosphate, and of 5.1c per pound in 44% super- phosphate, according to the State Chemist's report (4). 600 600 -63 (5 ,C, ) 400 (.35) B !, -0 (17I 5CNO No B ^B r'*H ^ "o .. o o 1o--2 0 Fig. 9.-The influence of different amounts of phosphate (PzOs) fertilizers on five-year average yields of marketable celery produced per acre on Area 2 at the Everglades Experiment Station. The different amounts of phosphate applied were tested at each of three levels of potash (KzO). The yield represented by the figures is given in terms of the number of field-trimmed crates produced per acre. (Yield data for the separate years for all of these comparisons are listed in Table 8 in the appendix.) Figure 9 represents the yields of marketable celery, in terms of the number of 70-pound field-trimmed crates per acre, pro- duced by using different quantities of superphosphate in the A Fertility Program for Celery Production fertilizer. Since it was found that a 12% potash fertilizer, applied at the rate of one ton per acre prior to setting the plants to the field was, on the average, best for celery, the comparison on the extreme right in the figure tells the story with respect to phosphate requirements of this crop. Over a five-year period the 9% phosphate formula, at a cost of about $9.50 an acre more than that of the 41% fertilizer, actually gave a slightly reduced annual yield. However, the first two years of this period the 9% analysis fertilizer gave higher yields than did the 41/2%, which indicates that a soil reserve was built up by the third year which served to make the 41/9% analysis fertilizer sufficient thereafter. The "fixing" of the phosphate in the soil in a relatively insoluble form undoubtedly has some effect upon these results. It is probable that a 6% material would be satisfactory, and perhaps more economical than a change from a 9 to a 41/2% fertilizer material at the start of the third year on celery land. TABLE 4.-THE ECONOMIC VALUE OF PHOSPHATE FERTILIZERS FOR CELERY PRODUCTION IN THE EVERGLADES. SFertil- Yield Cost I Total Re- Treatment izer per Cost per per turn per Net Profit Number Formulal Acre2 Acre3 Crate Acre' per Acre A-1 0-0-0 174 $159.55 $0.92 $ 87.00 -$72.55 (loss) A-2 0-4%-0 222 176.07 .79 111.00 65.07 (loss) B-1 0-0-6 352 179.29 .51 176.00 3.29 (loss) B-2 0-4%-6 435 188.81 .43 217.50 + 28.69 B-3 0-9-6 466 198.33 .43 233.00 + 34.67 C-1 0-4%-12 538 201.55 .37 269.00 + 67.45 C-2 0-9-12 536 211.07 .39 268.00 + 56.93 'One ton applie I at planting, one ton applied later as side-dressing. 2Calculated to the number of 70-lb. field-trimmed crates of marketable celery produced per acre. 3Including cost of fertilizer materials, cost of mixing fertilizer @ $3.50 a ton, and all field costs up to and including stripping ani field grading. 'Assuming a return to the grower of 50c per field-trimmed crate, after all packinghouse charges, brokerage fees, freight costs, etc., have been deducted. Inasmuch as cost data for potash and nitrogen materials required a more comprehensive analysis than has proven neces- sary with phosphate fertilizers, Table 4 is included principally for reference and for convenient comparison. The economic value of a 41/ % phosphate formula should be evident from this table. The preceding paragraph suggests the use of a 6% phosphate fertilizer, rather than a 41%, but this difference is of minor importance, and would depend upon the previous Florida Agricultural Experiment Station history of the land to be planted. In Area 3 this 6% formula has proven desirable up to this time. To sum up the effects of phosphate fertilizer briefly, then, either single or triple superphosphate should be suitable, but on unburned lands domestic basic slag may be even better. A 6% phosphate fertilizer, properly balanced with nitrogen and potash, applied at the rate of one ton to the acre before setting the plants on land to which the strippings of previous crops have been returned, is probably about optimum for Ever- glades organic soils to be cropped annually with celery. The final ratio of these fertilizer materials suggested for commercial use is 1:2:4 (nitrogen, phosphate and potash). METHOD AND RATE OF APPLICATION OF FERTILIZER The method of applying fertilizers has been found to be some- what dependent upon the rate of application, so that these two factors are probably best discussed together. Fertilizers applied in considerable quantity in a band below the roots may "burn" the young roots unless applied several days before the plants are set. Experiments have shown that\ celery in the Everglades, planted in 30-inch rows, four inches apart in the row, gives growth response to fertilizer applied broadcast before planting as high as or higher than to a similar quantity of fertilizer applied in a band beneath the row, pro- vided a suitable analysis fertilizer is used at a rate of 2,000 pounds per acre. The 3-6-12 formula evolved and presented in the previous sections of this paper is such a fertilizer. Broad- casting (or distribution with a seed drill) is satisfactory for celery because of the tremendous spread of root growth of celery in these organic soils, and because very little fertilizer is lost by leaching processes during the winter months. The celery roots are continually growing into fresh soil which holds an additional supply of fertilizer. Therefore, no side-dressing need be applied to celery in a normal year on these soils. There has been found to be no response to side-dressing applications when enough fertilizer was applied before planting to carry the crop through to harvest. Only when this original application of fertilizer was too low did the celery respond to side-dressing, and then it never produced as high yields as it did when it had an ample amount of fertilizer from the start. When side- dressings were applied in treatments discussed in the earlier pages of this bulletin, the cost of the fertilizer was included A Fertility Program for Celery Production in the cost per acre for growing the crop, but in many cases in which both the formula and the rate per acre applied before the plants were set were suitable, the chief benefits from the side-dressing was only to add to the fertilizer reserve of the soil, and considerable amounts of it were undoubtedly lost by leaching during the summer months. The previous history of the soil is, therefore, a factor affect- ing the rate of fertilizer application. In virgin land it has been found that a fertilizer analyzing 3% nitrogen (half from nitrate of soda, half from sulfate of ammonia), 6% P20s (from superphosphate or basic slag) and 6 to 12% K20 (from muriate or sulfate of potash) should be applied at the rate of two tons to the acre, broadcast. With land previously cropped and fer- tilized for crops other than celery, a fertilizer having the formula 3-6-12 should be applied at the same rate and in a similar man- ner.' For succeeding years, experiments have shown that for - the average year one ton per acre of the 3-6-12 should suffice for the entire growing period of the crop, when the previous crop has been stripped in the field and the strippings retained on the land. In the event that pink rot has shown up in the field it may not prove advisable to return the strippings to the soil, and there is experimental work under way at this time to determine the advisability of returning the strippings under these conditions.! If the strippings are removed from the field for sanitary reasons it is advisable to continue the use of the 3-6-12 fertilizer at a rate of approximately 3,000 pounds per acre per year. It has been found that with a crop yielding 500 crates of marketable celery per acre, about 40% by weight of the plant is represented by strippings. With higher yielding crops, this percentage is somewhat lower, and with low yield- ing ones it is, of course, somewhat higher. On the average, however, it is estimated that 50% of the fertilizer taken up by the crop can be returned to the soil in the form of the strip- pings and roots, and under such conditions, one ton of 3-6-12 should be sufficient additional fertilizer for the succeeding celery crop. I Another factor which makes possible this lower applica- tion in succeeding years is the residue of potash and phosphate which is left in the soil despite summer leaching. As mentioned above, !experimental evidence indicates that on these peat soils all of the fertilizer can be applied before the plants are set (no side-dressing necessary), and it is recom- mended that it be applied broadcast or by drill and disked and Florida Agricultural Experiment Station floated in at least three days before the plants are set. How- ever, if the weather should be unseasonably wet and cold in the growing season, some further side-dressing with nitrogen might be beneficial. It is suggested that this side-dressing con- sist of nitrate of soda or nitrate of potash on normal, unburned soils, or of sulfate of ammonia on neutral or slightly burned soils, applied at approximately 200 pounds to the acre. It should not be worked in deeply, because of the mass of roots near the surface of the soil. Assuming that the celery field is adequately mole-drained and that water does not stand on it, this side- dressing should be applied as soon as the water from the un- seasonable rains has subsided and the field is workable. MISCELLANEOUS SUGGESTIONS Celery should not be planted on raw land. The first year that sawgrass soils are broken it is better to plant them to some crop of low fertility requirements. Sawgrass decomposes rather slowly, and during the process of decomposition crops requiring large amounts of fertilizer will not do well. Although seedbeds are commonly raised two to three inches to permit rapid surface irrigation, it is neither necessary nor desirable to set the celery in the fields upon raised beds in the Everglades area. Celery is commonly planted in rows 30 inches apart, and with a four-inch spacing between plants. Under such conditions, there will be approximately 52,275 plants to the acre. The relatively close spacing usually will prevent pro- duction of too many extra large stalks, will encourage erect stalks with good hearts, and will give a high per acre yield. The distance between rows is commonly modified somewhat for convenience in spraying, depending upon type of equip- ment used. With regard to celery varieties, only the so-called self- blanching types are grown. Selected strains and especially bred varieties of celery are being introduced almost yearly by the seed houses. Some of these "specials" have done very well, and almost all of them are improvements over the old Golden Self-Blanching. In all of this experimental work the only filler used with the fertilizer mixtures was sawgrass peat soil. Consequently the filler may be ignored completely in a consideration of the active ingredients of the fertilizer mixtures. In the event that the grower mixes his own fertilizer, or has it mixed to his order, A Fertility Program for Celery Production a slightly higher analysis fertilizer, applied at a lower rate per acre, may be used. It should be remembered that with more concentrated fertilizers it is most important that the mixing be very thoroughly done. Since the ratio of N:P20s:K20 sug- gested for use has been 1:2:4, it is possible to have mixed a 4-8-16 fertilizer for application at the rate of 1,500 pounds per acre, in place of the 3-6-12 application at 2,000 pounds. On new lands being set to celery for the first time, this would mean an application of 3,000 pounds of 4-8-16 instead of 4,000 pounds of 3-6-12. This 4-8-16 mixture would be composed of 251 pounds of nitrate of soda (16% N), 197 pounds of sulfate of ammonia (20.5% N), 365 pounds of triple superphosphate (44% P205), and 533 pounds of muriate of potash (60% K20), plus the necessary filler to make the ton of fertilizer. The essential trace elements, in recommended amounts, can be used to replace part of this filler. If it is desired to withhold the nitrogen application and apply it as a side-dressing, an 0-12-24 mixture can be used at the rate of 1,000 pounds per acre before the plants are set, and the nitrogenous materials distributed later as a side-dressing. SUMMARY AND ABSTRACT The experimental data which have been discussed in the body of this bulletin permit the presentation of the following com- bination of suggested fertility programs for the commercial growing of celery on the sawgrass peat lands of the Florida Everglades: 1. For virgin sawgrass peat soils. Do not plant virgin soils to celery the first year the land is broken. Work the land into some semblance of shape, planting a crop of low fertilizer requirement the first year. This will give the turned under sawgrass a chance to decom- pose thoroughly. The second year apply broadcast 4,000 pounds to the acre of a 3-6-6 or a 3-6-12 fertilizer (or its equivalent in a higher analysis fertilizer of the same relative composition), to which has been added -100 pounds of manganese sulfate, 100 pounds of copper sulfate, and 25 pounds of zinc sulfate. The nitro- gen should be applied as one half sodium nitrate and one half ammonium sulfate if the soil is normal and unburned. or entirely as ammonium sulfate if the soil is neutral or slightly burned. The phosphate should be applied as the triple super- phosphate or as basic slag. The use of the latter material will result in a lower analysis fertilizer which will conse- Florida Agricultural Experiment Station quently have to be applied at a higher rate per acre. If basic slag is used, ammonium sulfate should not be used as the nitrogen source. The potash should be applied as the muriate, although either the sulfate or hardwood ashes are quite suitable if they are on hand. -This fertilizer application should be made not less than three days prior to the setting of the plants, and should be disked and floated to mix the soil and fertilizer, and to level the field for planting. 2. For sawgrass peat soils which have been previously fertilized and planted to truck crops other than celery. Apply broadcast 3,000 pounds of a 3-6-12 (or its equiva- lent) fertilizer composed of the same materials mentioned above and in a manner similar to that suggested above. If copper sprays or dusts have been used on the previous crops, or if copper has been added to fertilizers previously used on the land, no copper need be applied. Otherwise, add 100 pounds of copper sulfate with the fertilizer. If manganese has been previously added to the soil, apply only 25 pounds per acre of manganese sulfate. If no manganese has been used previously, 100 pounds per acre should be added. If zinc has been used previously, 10 to 15 pounds of zinc sulfate should be sufficient. If none has been used before, 25 pounds per acre, applied with the fertilizer, is suggested. 3. For sawgrass peat soils previously fertilized for and planted to celery. If either of the programs suggested above, or their ap- proximate equivalent, had been followed the previous year, and if the celery strippings had been returned to the soil and no market crop grown since the previous celery crop, it is suggested that 2,000 pounds of a 3-6-12 (or its equiva- lent) fertilizer per acre be applied broadcast, plus 25 pounds of manganese sulfate and 10 to 15 pounds of zinc sulfate per acre. If the strippings of the previous crop had been removed, or if the previous year's celery crop has been fol- lowed by another market crop, 3,000 to 4,000 pounds of the same formula fertilizer will probably be required for a good crop of celery. The above three suggested programs should not require the use of additional side-dressing in a normal winter season. If unseasonably wet and cold weather occurs at some time during the growing period, it is suggested that a side-dressing of 200 pounds per acre of nitrate of soda or nitrate of potash be applied to unburned soils, or 200 pounds per acre of sulfate of ammonia to neutral or slightly alkaline burned soils. This should not be A Fertility Program for Celery Production worked in deeply, since many of the roots of celery grow near the surface. It should not be necessary to add lime or dolomite (calcium or magnesium) to these soils at any time. Boron deficiency does not commonly occur on Everglades soils; however, if such a condition is suspected, the addition of 10 to 15 pounds of borax per acre should suffice and will not be dangerous if it is properly distributed. These recommendations are based primarily upon experi- mental work on sawgrass peat soils. For heavier muck soils of the Everglades area no positive recommendations can be made because of lack of experimental data, but it is suggested that a somewhat similar program be followed, substituting a fertilizer slightly higher in phosphate, such as a 3-8-12. The more highly mineralized soils seem to have a higher phosphate requirement with most truck crops than do the highly organic peats. A brief discussion of the common cultural procedure for celery growing in the area is included in the body of the bulletin. The most important features of such a procedure are the weekly application of bordeaux sprays (in which the necessary zinc and manganese may also be added, instead of in the fertilizer), and the maintenance of a suitable water table during the grow- ing season,. from 16 to 24 inches below the soil surface. The fertilizer program suggested has been shown to be eco- nomically sound on the sawgrass peat soils of the Everglades Experiment Station, assuming a return to the grower of 50c per 70-pound field-trimmed crate of marketable celery. This program is intended to serve as a base for commercial plantings on comparable soils, but since there is some land variation throughout the area, it is suggested that the grower try varia- tions of the program based upon his previous experience with celery or other crops on his own land, keeping an actual cost and return record. It is only by such means that the most economical procedure for celery growing on any piece of land can be determined. ACKNOWLEDGMENTS The author is indebted to Dr. R. V. Allison, the late H. H. Wedgworth and the late Dr. A. Daane for much of the planning of this experimental work; and to Dr. G. R. Townsend, Mr. Wedgworth and R. E. Robertson for their close attention to and detailed records of many of the earlier crops grown. 36 Florida Agricultural Experiment Station LITERATURE CITED 1. GADDUM, L. W., and L. H. ROGERS. A study of some trace elements in fertilizer materials. Fla. Agr. Exp. Sta. Bulletin 290. 1936. 2. PURvIS, E. R., and R. W. RUPRECHT. Cracked stem of celery caused by a boron deficiency in the soil. Fla. Agr. Exp. Sta. Bulletin 307. 1937. 3. SCRUGGs, F. H. Annual fruit and vegetable report. Fla. State Mkt. Bureau. Season 1937-38. 4. TAYLOR, J. J. Annual report of the State Chemist of Florida for the year ending December 31, 1937. 5. TOWNSEND, G. R. Manganese sulphate sprays for vegetable crops. Fla. Agr. Exp. Sta. Press Bulletin 487. 1936. 6. TOWNSEND, G. R. Zinc sulphate sprays for vegetable crops. Fla. Agr. Exp. Sta. Press Bulletin 488. 1936. 7. WANN, JOHN L. Florida truck crop competition. II. Intrastate. Fla. Agr. Exp. Sta. Bulletin 238. 1931. A Fertility Program for Celery Production APPENDIX TABLE 5.-YIELDS OF CELERY IN AREA 2 FOR THE FIVE-YEAR PERIOD FROM 1932 THROUGH 1936, AS INFLUENCED BY NITROGEN. THE DATA ARE GIVEN IN TERMS OF THE NUMBER OF FIELD-TRIMMED 70-LB. CRATES OF CELERY PRODUCED PER ACRE. Fertilizer Formula 0-4/2-6 3-4%-6 Increase Due Sto Nitrogen 1932 238 255 17 1933 496 559 63 1934 351 386 35 1935 756 840 84 1936 335 512 177 Total 2,176 2,552 376 Five-year average 435 510 75 TABLE 6.-YIELDS OF CELERY IN AREA 2 FOR THE FIVE-YEAR PERIOD FROM 1932 THROUGH 1936, AS INFLUENCED BY SOURCE OF POTASH. THE DATA ARE GIVEN IN TERMS OF THE NUMBER OF 70-LB. FIELD-TRIMMED CRATES OF CELERY PRODUCED PER ACRE. THE FERTILIZER FORMULA WAS 0-41/2-12. rPotash SourceI Increase Due Muriate I Sulphate | to Muriate 1932 306 294 12 1933 652 556 96 1934 422 390 32 1935 1,044 1,058 14 1936 521 393 128 Total 2,945 2,691 254 Five-year average 589 538 51 Florida Agricultural Experiment Station TABLE 7.-YIELDS OF CELERY IN AREA 2 FOR THE FIVE-YEAR PERIOD FROM 1932 THROUGH 1936, SHOWING THE INFLUENCE OF POTASH UPON YIELDS AT DIFFERENT PHOSPHATE LEVELS. THE DATA ARE GIVEN IN TERMS OF 70-LB. FIELD-TRIMMED CRATES OF CELERY PRODUCED PER ACRE. I No Phosphate Year Fertilizer Formula Increase Due 0-0-0 (Check) | 0-0-6 to Potash 1932 20 154 134 1933 231 366 135 1934 158 271 113 1935 317 655 338 1936 144 315 171 Total I 870 1 1,761 ] _891_ Five-year average | 174 | 352 178 II 4'2/% Phosphate Year Fertilizer Formula Increase Due 0-4Y2-0 0-41/2-6 to Potash 1932 58 238 180 1933 288 496 208 1934 180 351 171 1935 415 756 341 1936 171 335 164 Total 1,112 j 2,176 1,064 Five-year average | 222 | 435 213 SIncrease Due Year Fertilizer Formula to Extra 0-4I2-6 0-42-12 Potash 1932 238 294 56 1933 496 556 60 1934 351 390 39 1935 756 1,058 302 1936 335 393 58 Total 2,176 2,691 515 Five-year average 435 538 | 103 III 9% Phosphate Year Fertilizer Formula Increase Due 0-9-6 0-9-12 to Potash 1932 245 303 58 1933 520 594 74 1934 352 389 37 1935 877 1,001 124 1936 338 394 56 Total 2,332 2,681 | 348 Five-year average | 466 I 536 70 A Fertility Program for Celery Production TABLE 8.-YIELDS OF CELERY IN AREA 2 FOR THE FIVE-YEAR PERIOD FROM 1932 THROUGH 1936, SHOWING THE INFLUENCE OF PHOSPHATE UPON YIELDS AT DIFFERENT POTASH LEVELS. THE DATA ARE GIVEN IN TERMS OF 70-LB. FIELD-TRIMMED CRATES OF CELERY PRODUCED PER ACRE. I No Potash Year Fertilizer Formula Increase Due 0-0-0 (Check) I 0-41-/-0 to Phosphate 1932 20 58 38 1933 231 288 57 1934 158 180 22 1935 317 415 98 1936 144 171 27 Total 870 | 1,112 | 242 Five-year average 174 | 222 I 48 II 6% Potash Year Fertilizer Formula Increase Due 0-0-6 0-41/-6 to Phosphate 1932 153 238 84 1933 366 496 130 1934 271 351 80 1935 655 756 101 1936 315 335 20 Total 1,761 | 2,176 415 Five-year average 352 435 83 SIncrease Due Year Fertilizer Formula to Extra 0-412-6 0-9-6 Phosphate 1932 238 245 7 1933 496 520 24 1934 351 352 1 1935 756 877 121 1936 335 338 3 Total 2,176 2,332 156 Five-year average 435 466 31 III 12% Potash I Increase Due Year Fertilizer Formula to Extra 0-41/2-12 I 0-9-12 Phosphate 1932 294 303 9 1933 556 594 38 1934 390 389 1 1935 1,058 1,001 -57 1936 393 I 394 1 Total 2,691 2,681 -10 Five-year average 538 | 536 2 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/UF00015112/00001 | CC-MAIN-2019-13 | refinedweb | 14,757 | 58.01 |
1. Launching a Google Colab Notebook
We’re going to perform the text paraphrasing on the cloud using Google Colab, which is an online version of the Jupyter notebook that allows you to run Python code on the cloud. If you’re new to Google Colab, you will want to brush up on the basics in the Introductory notebook.
- Log into your Gmail account, then go to Google Colab.
- Launch the tutorial notebook by first heading over to
File > Open Notebookand then click on the
Uploadtab (far right).
- Type
dataprofessor/parrotinto the search box
- Click on the
parrot.ipynbfile
2. Installing the PARROT Library
The PARROT library can be installed via pip by typing the following into the code cell:
! pip install git+
Library installation should take a short moment.
3. Importing the Libraries
Here, we’re going to import 3 Python libraries consisting of
parrot,
torch and
warnings. You can go ahead and type the following (or copy and paste) into a code cell then run it either by pressing the
CTRL + Enter buttons (Windows and Linux) or the
CMD + Enter buttons (Mac OSX). Alternatively, the code cell can also be run by clicking on the play button found to the left of the code cell.
from parrot import Parrot
import torch
import warnings
warnings.filterwarnings("ignore")
The
parrot library contains the pre-trained text paraphrasing model that we will use to perform the paraphrasing task.
Under the hood, the pre-trained text paraphrasing model was created using PyTorch (
torch) and thus we’re importing it here in order to run the model. This model is called
parrot_paraphraser_on_T5 and is listed on the Hugging Face website. It should be noted that Hugging Face is the company that develops the
transformer library which hosts the
parrot_paraphraser_on_T5 model.
As the code implies, warnings that appears will be ignored via the
warnings library.
4. Reproducibility of the Text Paraphrasing
In order to allow reproducibility of the text paraphrasing, the random seed number will be set. What this does is produce the same results for the same seed number (even if it is re-run multiple times).
To set the random seed number for reproducibility, enter the following code block into the code cell:
def random_state(seed):
torch.manual_seed(seed)
if torch.cuda.is_available():
torch.cuda.manual_seed_all(seed)
random_state(1234)
5. Load the Text Paraphrasing Model
We will now load and initialize the PARROT model by entering the following into a code cell and run the cell.
parrot = Parrot(model_tag="prithivida/parrot_paraphraser_on_T5", use_gpu=False)
The models will be loaded as shown below:
6. Input Text
The input text for this example, which is
What’s the most delicious papayas?, will be assigned to the
phrases variable, which we will be using in just a moment.
To find out the answer to that make sure to watch the accompanying YouTube video (How to paraphrase text in Python using the PARROT library (Ft. Ken Jee)).
phrases = ["What's the most delicious papayas?"]
7. Generating the Paraphrased Text
Now, to the fun part of generating the paraphrased text using the PARROT T5 model.
7.1. The Code
Enter the following code block into the code cell and run the cell.
for phrase in phrases:
print("-"*100)
print("Input_phrase: ", phrase)
print("-"*100)
para_phrases = parrot.augment(input_phrase=phrase)
for para_phrase in para_phrases:
print(para_phrase)
7.2. Line-by-line Explanation
Here, we’ll be using a
for loop to iterate through all the sentences in the
phrases variable (in the example above we assigned only a single sentence or a single phrase to this variable).
For each
phrase in the
phrases variable:
- Print out the
-character for 100 times.
"Input phrase: "followed by the returned output of the
phrasethat is being iterated.
- Print out the
-character for 100 times.
- Perform the paraphrasing using the
parrot.augment()function that takes in as input argument the
phrasebeing iterated. Generated paraphrases are assigned to the
para_phrasesvariable.
- Perform a nested
forloop on the
para_phrasesvariable:
— Print the returned output of the paraphrases from the
para_phrasesvariable that have been generated iteratively (the 4 paraphrased text that we will soon see in the next section).
7.3. Code Output
This code block generates the following output:
Here, we can see that PARROT produces 4 paraphrased text and you can choose any of these for further usage.
8. What’s Next?
Congratulations, you can successfully produced paraphrased text using AI!
In case you’re interested in taking this a step or two further.
Here are some project ideas that you can try out and build to expand your own portfolio of projects. Speaking of portfolios, you can learn how to build a portfolio website for free from this recent article that I wrote:
Project Idea 1
Create a Colab/Jupyter notebook that expands on this example (which generates paraphrased text for a single input phrase) by making a version that can take in multiple phrases as input. For example, we can assign a paragraph consisting of a couple of phrases to an input variable, which is then used by the code to generate paraphrased text. Then for the returned outputs of each phrase, randomly select a single output to represent each of the phrase (i.e. each input phrase will correspondingly have 1 paraphrased text). Combine the paraphrased phrases together into a new paragraph. Compare the original paragraph and the new paraphrased paragraph.
Project Idea 2
Expand on Project Idea 1 by making it into a web app using Streamlit (Also check out the Streamlit Tutorial Playlist) or PyWebIO. Particularly, the web app would take as input a paragraph of phrases and applies the code to generate paraphrased text and return them as output in the main panel of the web app.
Share Your Creations
I’d love to see some of your creations and so please feel free to post them in the comment section. Happy creation!
AI/ML
Trending AI/ML Article Identified & Digested via Granola by Ramsey Elbasheer; a Machine-Driven RSS Bot | https://ramseyelbasheer.io/2021/06/04/how-to-paraphrase-text-using-python/ | CC-MAIN-2021-25 | refinedweb | 1,000 | 61.77 |
Discussion board where members can learn more about Integration, Extensions and API’s for Qlik Sense.
Hi everybody,
I've just updated my QlikView Sense Desktop to 1.0.0 and now I could not get in the workbencheditor with the link :
It's bizarre, it works fine before under the version 0.9.6. Does anyone have an idea about this ?
Thanks for your help
CE
Solved!
Go to Solution.
Hi CE Bian
Try
the URL has changed.
Please mark the appropriate replies as helpful / correct so our team and other members know that your question(s) has been answered to your satisfaction.
Regards,
Mike
Thank you very much for your help, Mike.
By following the link your have indicated, I've re-found this beautiful interface.
Regards.
Ce
There has also been some noticeable changes between the pre-release and the GA (1.0 version) in terms of the APIs. This is by no means a full list of features that has been added between 0.96 and 1.0 but should help you get started and/or upgrade any projects that was based on 0.96.
We now have a dedicated API documentation site, finally!, that has been separated from the general help.
Both the general help and the API documentation can be found at
The main namespace has changed name and is now referred to as qlik. Any old references to js/qlikview would have to be updated.
The Mashup API has gotten some new methods to make it easier to work with selections.
Several of the examples in the documentation has been updated and new ones added.
The .NET SDK has been released. Ever wanted to build a custom native application that utilizes the Qlik engine? Now you can!
If you are running mashups on a seperate machine than your Sense server installation there is now a new property to white list communication between the proxy and your server hosting the mashups in the QMC.
Hi Alexander,
Thank you for these clear explanations about the new release. I start to take a look at the documentation website, the contenu is very rich in this version. | https://community.qlik.com/t5/Qlik-Sense-Integration/Can-t-open-Workbencheditor-after-install-Qv-Sense-1-0-0/td-p/735254 | CC-MAIN-2019-04 | refinedweb | 360 | 75.5 |
TxIR
Table of Contents
Overview¶
This is a low level library that handles sending infrared (IR) commands. IR commands are normally sent on a carrier frequency. Depending on the device, the frequency can vary some, but it's generally around 40kHz (26us). To send a bit of data the sender alternates between a 50% duty cycle pulse and a 0% duty cycle pulse. The relationship between these pulses determines what data is being sent. For a good description about how IR commands are normally sent see.
This library lets you choose how long pulses should be sent for. It's very low level, but it lets you control devices that only need a couple of codes. Hopefully, libraries for other devices will derive from this library. I used it to control the shutter on a NIkon DSLR camera.
To use the library you need to connect an IR led to one of the PWM enabled ports on the mbed. In my case I'm using port 21.
To use the transmitter¶
#include "TxIR.hpp" TxIR txir(p21); // Send the code for a Nikon ML3 remote const unsigned nikonShutter[] = {2250, 27600, 650, 1375, 575, 3350, 650, 62000, 2250, 27600, 650, 1375, 575, 3350, 650}; txir.txSeq(26, 15, nikonShutter);
Code¶
Library:
Import libraryTxIR
This library is a very low level interface to a transmit IR codes. Other libraries could be built on top of it to transmit different manufactures codes, or a specific code. I use the library to remotely trigger a Nikon DSLR camera the same way an ML3 Nikon remote does.
API:
Circuit¶
| https://os.mbed.com/cookbook/TxIR | CC-MAIN-2018-13 | refinedweb | 264 | 73.07 |
Created on 2018-04-15 05:24 by Ian Burgwin, last changed 2018-05-02 02:56 by ned.deily. This issue is now closed.
On Python 3.7.0a4 and later (including 3.7.0b4), find_library currently always returns None on macOS. It works on 3.7.0a3 and earlier. Tested on macOS 10.11 and 10.13.
Expected result: Tested on 3.6.5, 3.7.0a1 and 3.7.0a3:
>>> from ctypes.util import find_library
>>> find_library('iconv')
'/usr/lib/libiconv.dylib'
>>> find_library('c')
'/usr/lib/libc.dylib'
>>>
Current output on 3.7.0a4 to 3.7.0b3:
>>> from ctypes.util import find_library
>>> find_library('iconv')
>>> find_library('c')
>>>.
On 15/04/2018 07:56, Ned Deily wrote:
> Ned Deily <nad@python.org> added the comment:
>
>.
Perhaps he can give a bit more info. I do not understand how this could
break things, as the darwin code is earlier in the queue.
if os.name == "posix" and sys.platform == "darwin":
from ctypes.macholib.dyld import dyld_find as _dyld_find
def find_library(name):
possible = ['lib%s.dylib' % name,
'%s.dylib' % name,
'%s.framework/%s' % (name, name)]
for name in possible:
try:
return _dyld_find(name)
except ValueError:
continue
return None
if sys.platform.startswith("aix"):
# AIX has two styles of storing shared libraries
# GNU auto_tools refer to these as svr4 and aix
# svr4 (System V Release 4) is a regular file, often with .so as suffix
# AIX style uses an archive (suffix .a) with members (e.g., shr.o,
libssl.so)
# see issue#26439 and _aix.py for more details
from ctypes._aix import find_library
elif os.name == "posix":
# Andreas Degert's find functions, using gcc, /sbin/ldconfig, objdump
import re, tempfile
def _findLib_gcc(name):
As I understand the code above (and maybe I am wrong) - the code should
be calling the unchanged routines in the macholib subdirectory. A simple
test on macOS would be to comment out the two lines
if sys.platform.startswith("aix"):
from ctypes._aix import find_library
That will "delete" the AIX find_library logic.
In other words - can someone check whether the unchanged
Lib/ctypes/macholib/* files are being used? And if not, then something
surprising is preventing that. If they are - no idea how the macholib
code got effected by this. The goal was to have all changes in the
_aix.py file, rather than in util.py.
>
> ----------
> nosy: +Michael.Felt, ned.deily, vstinner
> priority: normal -> release blocker
> stage: -> needs patch
>
> _______________________________________
> Python tracker <report@bugs.python.org>
> <>
> _______________________________________
>
New changeset d06d345f04b3f7e5b318df69b1d179328a64ca9c by Ned Deily (Ray Donnelly) in branch 'master':
bpo-33281: Fix ctypes.util.find_library regression on macOS (GH-6625)
New changeset 69a013ec189f93a0dea97cfdbb3adc348648a666 by Ned Deily in branch 'master':
bpo-33281: NEWS and ACK (GH-6681)
New changeset c74ca5396aa7740d4fc90617e6b2315e849fa71f by Ned Deily (Miss Islington (bot)) in branch '3.7':
bpo-33281: Fix ctypes.util.find_library regression on macOS (GH-6625) (GH-6680)
New changeset d74f35331f176e0679f0614b6cccf0dc0422e31a by Ned Deily (Miss Islington (bot)) in branch '3.7':
bpo-33281: NEWS and ACK (GH-6681) (GH-6682)
Thanks for the PR, Ray. Merged for 3.7.0b4 (and 3.8.0). | https://bugs.python.org/issue33281 | CC-MAIN-2019-18 | refinedweb | 511 | 71.71 |
Intro:.
Components required-
1) Jumper wires
2) Sheet metal (alternative: cardboard)
3) 2 Servo motors
4) 4 Light dependent resistors
5) Arduino + Arduino cable
6) Raspberry Pi 3 Model B + keyboard, mouse, power supply and monitor for using RPi
7) Solar panel
8) Four 10K ohm resistors
Components required for manufacturing PCB (optional step)-
1) FeCl2 solution
2) Acetone
3) Etching marker
4) one component side PCB
5) Soldering rod
6) Solder
Softwares required-
1) Arduino
2) Raspbian Jessie
3) Eagle or Fritzing
4) Processing
Step 1: Draw and Understand Schematic Diagram
The schematic can be made using either Fritzing or Eagle software. Here, the basic schematic was made using Fritzing.
4 Light dependent resistors are used on four corners of the solar panel to sense light. The values from these LDRs is read by the Arduino.
To move the solar panel, we use servo motors. The bottom servo motor is the horizontal servo motor whereas the top servo motor is the vertical servo motor.
The average of the two top and the two bottom LDRs is calculated. If the average of the two top LDRs is more, then the vertical servo motor rotates towards that side. If the average of the two bottom LDRs is more, then the vertical servo motor rotates towards the bottom side.
The average of the two right and the two left LDRs is calculated. If the average of the two right LDRs is more, then the horizontal servo motor rotates towards that side. If the average of the two left LDRs is more, then the horizontal servo motor moves towards that side.
This is the logic behind the code used to create the solar tracker.
Step 2: Design and Manufacture PCB (optional Step)
The wiring of the solar tracker is a lot and can cause hindrance to the motion of the tracker.
One of the workable solutions for this problem is to design and manufacture a customized printed circuit board.
Steps to design and manufacture a PCB-
1) Design schematic using Eagle software
2) Print the schematic on glossy paper
3) Iron the glossy paper on the one component side PCB
4) Apply etching marker to all the tracks as a safety measure
5) Dip PCB inside FeCl2 (ferrous chloride) solution for about 30 minutes to complete the etching process
6) Use water to get rid of excess ferrous chloride on the PCB
7) Use acetone to clean the tracks
8) Place the components at appropriate places and solder them
An alternative to this step is to use a cardboard piece to support the LDRs and the solar panel. It will be explained in the next step.
Step 3: The Setup
1) To start the setup, create a base for the setup. Here, heavy sheet metal is used as a base to support the entire structure. Alternatively, a cardboard piece could be used for the same.
2) Cut two metal strips out of light sheet metal. Drill one hole on each strip to attach the servo motors as shown. Alternatively, two perforated metal strips could be used.
3) In case you have decided not to create a PCB, then take a piece of cardboard to support the LDRs. Look at the image to understand the position of the LDRs and solar panel.
4) Attach one servo motor to one metal strip that has a hole in the middle. Stick that servo motor to the base and bend the metal strip as shown.
5) Attach the other servo motor to the other metal strip that has one hole on one of its ends. Bend the metal strip as shown. Stick this servo motor to the previously placed metal strip such that the servo motor can move without hindrance.
6) Stick the PCB or cardboard (with LDRs and solar panel) on top of the second metal strip.
7) Make the necessary connections by checking the schematic.
Step 4: Steps to Use Raspberry Pi 3 Model B (optional)
Arduino can be used via a laptop. Alternatively, it can be used via Raspberry Pi. Arduino can be directly connected to RPi using one of its USB ports.
Processing can also be used either on laptop or on RPi.
However, it is mandatory to use the same device for both Processing and Arduino at one time.
First, setup RPi using any of the tutorials available online.
Then, download Arduino on it using
sudo apt-get install Arduino
from command line.
Download Processing on Rpi using
curl | sudo sh
from command line.
Step 5: Arduino Code
#include<Servo.h> //header file for using servo motors
//define Servos
Servo servohori; //horizontal servo motor
int servoh = 0;
int servohLimitHigh = 160;
int servohLimitLow = 20;
Servo servoverti; //vertical servo motor
int servov = 0;
int servovLimitHigh = 160;
int servovLimitLow = 20;
//define LDRs
int ldr1 = 0; //top left
int ldr2 = 1; //top right
int ldr3 = 2; //bottom right
int ldr4 = 3; //bottom left
void setup ()
{
Serial.begin(9600); //start serial monitor
servohori.attach(10);
servohori.write(0);
servoverti.attach(9);
servoverti.write(0);
delay(500);
}
void loop()
{
servoh = servohori.read();
servov = servoverti.read();
//capture analog values of each LDR
int reading1 = analogRead(ldr1);
int reading2 = analogRead(ldr2)-;
int reading3 = analogRead(ldr3);
int reading4 = analogRead(ldr4);
//necessary to send values to serial monitor so that Arduino can communicate with Processing
Serial.print(reading1);
Serial.write(',');
Serial.print(reading2);
Serial.write(',');
Serial.print(reading3);
Serial.write(',');
Serial.print(reading4);
Serial.write(',');
Serial.print(servoh);
Serial.write(',');
Serial.println(servov);
delay(1);
// calculate average
int avg12 = (reading1 + reading2) / 2;
int avg34 = (reading3 + reading4) / 2;
int avg32 = (reading3 + reading2) / 2;
int avg41 = (reading1 + reading4) / 2;
//compare average of two and move servo motors accordingly
if ( avg12>avg34)
{
servoverti.write(servov +1);
if (servov > servovLimitHigh)
{
servov = servovLimitHigh;
}
delay(10);
}
else if (avg12 < avg34)
{
servoverti.write(servov -1);
if (servov < servovLimitLow)
{
servov = servovLimitLow;
}
delay(10);
}
else
{
servoverti.write(servov);
}
if (avg32 < avg41)
{
servohori.write(servoh +1);
if (servoh > servohLimitHigh)
{
servoh = servohLimitHigh;
}
delay(10);
}
else if (avg32 > avg41)
{
servohori.write(servoh -1);
if (servoh < servohLimitLow)
{
servoh = servohLimitLow;
}
delay(10);
}
else
{
servohori.write(servoh);
}
delay(50);
}
Step 6: Processing Code
A graphic user interface was created using Processing.
The rectangles represent the value of the LDRs and the circles with arcs represent the angle of the servo motors.
The code-
import processing.serial.*; //to communicate with the serial monitor of Arduino
Serial myPort;
int[] inStr = {0,0,0,0,0,0};
void setup()
{
size(1200,650,P3D); //to define size of the GUI window
background(0); //to make the background black
myPort=new Serial(this, "COM4", 9600); //In place of COM4, use the Arduino port in your laptop or Raspberry Pi. Make sure the baud rate is the same as the one given in Arduino code.
myPort.bufferUntil('\n');
}
void draw()
{
background(0); //The background is declared as black again. This is necessary so that the motion described in the draw function appears without any distortions.
//for servo motor 1
fill(100,100,200); //to give color to the object
ellipse(1000, 200, 100,100);
textSize(20);
fill(255);
text("Servo 1", 970, 300);
arc(1000,200,100,100 ,radians(180),radians(180+inStr[4])); //to draw a dynamic arc to represent the angle of the servo motor
//for servo motor 2
fill(100,100,200);
ellipse(1000, 450, 100, 100);
textSize(20);
fill(200);
text("Servo 2", 970, 550);
arc(1000,450,100,100, radians(180),radians(180+inStr[5]));
//for LDR1
fill(200, 200, 0);
rect(100, 570, 100, -inStr[0]); //draw a dynamic rectangle to represent the value of the LDR
textSize(20);
fill(255);
text("LDR1", 100, 600);
//for LDR2
fill(200, 100, 100);
rect(300,570, 100, -inStr[1]);
textSize(20);
fill(255);
text("LDR2", 300, 600);
//for LDR3
fill(100, 200, 100);
rect(500, 570, 100, -inStr[2]);
textSize(20);
fill(255);
text("LDR3", 500, 600);
//for LDR4
fill(100,100,200);
rect(700, 570, 100, -inStr[3]);
textSize(20);
fill(255);
text("LDR4", 700, 600);
}
void serialEvent(Serial myPort)
{
String inString = myPort.readStringUntil('\n'); //read values from serial monitor
if(inString!=null)
{
inString = trim(inString);
inStr = int(split(inString, ',')); //split the values from the serial monitor where a comma is encountered. Store each value in the array inStr
}
}
7 Discussions
1 year ago
Pretty nifty.
Just curious;
You must power the RPi3. If you're using this as a solar tracker, do you generate enough electricity to even power the RPi3?
If your answer is something along the lines of; 'Add more solar panels.' Is it even cost effective then? Does it have the power to move a larger array of solar panels?
Not trying to criticize, just curious. It's still a great project. Thanks for sharing.
1 year ago
Thats some nice etching you have there.
1 year ago
Why use adrino & raspberry pi ? Couldn't the Pi handle both tasks?
1 year ago
Nice instructable,and these kind of creations gives me new ideas. Thanks for sharing and keep up the good work :)
Reply 1 year ago
Thank you :)
1 year ago
That looks good :)
Reply 1 year ago
Thank you :) | https://www.instructables.com/id/Solar-Tracker-Using-Arduino-and-Raspberry-Pi-3/ | CC-MAIN-2018-47 | refinedweb | 1,517 | 53.1 |
From Blender to Papervision3D
Here is a simple wheel I created using Blender. The wheel is exported from Blender as as COLLADA object (*.dae file).
Use Cursor Keys to rotate the model, and Space to roll.
Along my way of creating this stunning artwork :) I came on to some difficulties with Blender and the Collada plugin. Such problems are always frustrating, so here are some notes that may help:
- Do not install the latest Blender release (2.45 at the time I write this). Use 2.43 instead, as the Collada 1.4.1 script is not working properly in the newest one.
- You need also to install the Python programming language because the Collada script needs some libraries that are not part of the Blender distribution. You need to set some environment variables in order make it work, but the Blender documentation mentions only one, PYTHON, which does not seem enough. After some research I found out that you need tow of them:
PYTHON=[path to python.exe in the python instaloation folder]
PYTHONPATH=[path to python instalation folder and some other folders]
On my computer it looks like this:
PYTHON=”C:\Program Files\Python\python.exe”
PYTHONPATH=C:\Program Files\Python;C:\Program Files\Python\DLLS;C:\Program Files\Python\LIB;C:\Program Files\Python\LIB\LIB-TK
- If you do not know anything about Blender (like me) check out this tutorial. I helped me alot.
UPDATE May 17th 2008. Source code. I decided to publish the source for this example. Grab it here.
That’s great – I’ve just managed to load up my first dae from Blender into papervision, but I can’t work out how to access the object for position, rotation etc…
Here’s my .as file –
package {
import flash.display.Sprite;
import flash.display.Stage;
import flash.events.Event;
import org.papervision3d.cameras.Camera3D;
import org.papervision3d.objects.DisplayObject3D;
import org.papervision3d.objects.Collada;
import org.papervision3d.scenes.MovieScene3D;
public class collCube extends Sprite
{
public var scene:MovieScene3D;
public var camera:Camera3D;
public var dae:Collada;
public var myobject:DisplayObject3D;
public function collCube() {
init();
}
private function init() {
//basic scene stuff
var container:Sprite = new Sprite();
container.x = 200;
container.y = 200;
addChild( container );
scene = new MovieScene3D(container);
camera = new Camera3D();
camera.z = -500;
camera.zoom = 5;
var dae = new Collada(“cube.dae”);
var myobject = new DisplayObject3D();
myobject.addChild(dae);
scene.addChild(myobject);
stage.addEventListener(Event.ENTER_FRAME, runtime);
}
private function runtime(e:Event):void {
//WHAT CODE DO I USE HERE?
//dae.Cube.rotationX += 5;
scene.renderCamera(camera);
}
}
}
Would love it if you could help me out – or even better – post the code from your example.
Cheers
Karl
In my code it goes something like this:
cola = new Collada(“model.dae”);
colaHolder = new DisplayObject3D();
colaHolder.addChild(cola);
scene.addChild(colaHolder);
and then I modify the colaHolder properties such as rotation, postion etc… Anyway, I updated the post with the source files (see above), so grab them and check them out!
Thanks Bartek, that’s a great help! I’d managed to do it using the PV3D components, but this way seems to have more flexibility – eg for combining collada objects and PV primitives. Have you had any success exporting meshes with armature animations as colladas from Blender? Can’t get those to work either…
Can’t wait for Blender 2.46 by the way.
Cheers
Karl
check it out
[...] Este tutorial nos explica ¿cómo pasar un modelo de Blender*? a una aplicación de PaperVision3D. :-) [...]
hi Bartek.
where are suppose to set these python paths you were talking about?
@vitaLee These are the windows system environment variables.
On an XP machine you set them by right-clikcking the ‘My Computer’ icon, choosing the ‘Advanced’ tab and then ‘Environment variables’ at the bottom.
You will see 2 panels, one for user variables on the top, other for system variables on the bottom. I added the Python related variables to the system ones so that they are available for every user.
Have you tried using the newest version of Blender? I think they might have fixed it. I successfully exported a dae file and loaded it into Papervision.
@MikeTheVike No, I haven’t. But I intend to go back to the Blender/PV3D topic later this month, so I will check that and maybe update this post. Thanks!
[...] be bugged as well, as I wrote the last time, with faulty animation. And while there’s tons of options for exporting Blender models into PV3D, none seems to include [...]
hi, i am projecting a game with at maximum 36 cones and 5*36 circles. if i use PV3D to buil the objects are about 36*5+5*6*36=1360 triangles and the game appears slow, too much slow! do you think that importing the 3d object with blender could be faster?
@scheggia it’s the polygon count that’s important, not where the models come from, so making them in Blender would not help. On the other hand 1360 tris is not very many…
Suggestions:
- try setting Stage.quality to LOW
- if you can, switch from pv3d to away3d or away3dlite – this engine, in the fp10 version, is significantly faster
[...] be bugged as well, as I wrote the last time, with faulty animation. And while there’s tons of options for exporting Blender models into PV3D, none seems to include [...]
Hello, im trying to put a Loader im my Flash builder augmented reality. Someone can help me, where can I insert the loader im my code.
following my code:;
}
}
} | http://www.everydayflash.com/blog/index.php/2008/03/01/from-blender-to-papervision3d/ | CC-MAIN-2014-15 | refinedweb | 921 | 59.3 |
Writing, Rewriting, and Rerewriting the Same Java Program
Have you ever asked yourself what would happen if you ran the same file writing program more than once in Java. Create the tiny program below and run the program twice. Then examine the program’s output file. The output file contains only two letters.
import java.io.FileNotFoundException;
import java.io.PrintStream;
class WriteOK {
public static void main(String args[])throws FileNotFoundException {
PrintStream diskWriter = new PrintStream(new File("approval.txt"));
diskWriter.print ('O');
diskWriter.println('K');
diskWriter.close();
}
Here’s the sequence of events, from the start to the end of the experiment:
- Before you run the code, the computer’s hard drive has no
approval.txtfile.
That’s okay. Every experiment has to start somewhere.
- Run the code above.
The call to new
PrintStreamcreates a file named
approval.txt. Initially, the new
approval.txtfile contains no characters. Later in the code, calls to
printlnput characters in the file. So, after running the code, the
approval.txtfile contains two letters: the letters
OK.
- Run the code a second time.
At this point, you could imagine seeing
OKOKin the
approval.txtfile. But that’s not what you see above. After running the code twice, the
approval.txtfile contains just one
OK. Here’s why:
- The call to
new PrintStreamin the code deletes the existing
approval.txtfile. The call creates a new, empty
approval.txtfile.
- After a
new approval.txtfile is created, the
Ointo the new file.
- The
printlnmethod call adds the letter
Kto the same
approval.txtfile.
That’s the story. Each time you run the program, it trashes whatever
approval.txt file is already on the hard drive. Then the program adds data to a newly created
approval.txt file.
Where’s my file?
Create an Eclipse project containing the following code:
import java.util.Scanner;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
class ReadAndWrite {
public static void main(String args[]) throws FileNotFoundException {
Scanner diskScanner = new Scanner(new File("data.txt"));
PrintStream diskWriter = new PrintStream("data.txt");
diskWriter.println("Hello");
System.out.println(diskScanner.next());
diskScanner.close();
diskWriter.close();
}
}
When you run the code, you see an error message in Eclipse’s Console view. Why?
Write and then read
Modify the code from the where’s-my-file experiment so that the code>PrintStream diskWriter declaration comes before the Scanner
diskScanner declaration.
When you run the code, the word
Hello should appear in Eclipse’s Console view. After running the code, check to make sure that your Eclipse project contains a file named
data.txt.
Random numbers in a file
Create a program that writes ten randomly generated numbers in a disk file. After writing the numbers, the program reads the numbers from the file and displays them in Eclipse’s Console view. | http://www.dummies.com/programming/java/writing-rewriting-rerewriting-java-program/ | CC-MAIN-2017-43 | refinedweb | 467 | 70.39 |
0
Hello there,
I've a homework assignment from a while ago that asks
"Implement a recursive Python function which returns the sum of the first n integers"
Now i just dont know exactly what it's asking and how to get started.
Recursive functions, right (my thoughts so far is it'll look something like )
def sum(n,amount):
and then i get stumped, i have worked with some so it usually continues with if (statement) == Integer etc.
But for this i seem to need to ask what the n integers are, then ask how many they want to add.
It's confused me, as my text wall probably has to you :P haha
Thanks for the help in advance, (try to keep it simple for me ^^) | https://www.daniweb.com/programming/software-development/threads/185848/recursive-python-function | CC-MAIN-2017-47 | refinedweb | 128 | 65.9 |
Topological data scripting
Contents
- 1 Introduction
- 2 Creating basic types
- 2.1 Short description
- 2.2 Detailed explanations
- 2.2.1 How to create a Vertex?
- 2.2.2 How to create an Edge?
- 2.2.3 How to create a Wire?
- 2.2.4 How to create a Face?
- 2.2.5 How to create a circle?
- 2.2.6 How to create an Arc along points?
- 2.2.7 How to create a polygon or line along points?
- 2.2.8 How to create a plane?
- 2.2.9 How to create an ellipse?
- 2.2.10 How to create a Torus?
- 2.2.11 How to make a box or cuboid?
- 2.2.12 How to make a Sphere?
- 2.2.13 How to make a Cylinder?
- 2.2.14 How to make a Cone?
- 2.3 Boolean Operations
- 3 Exploring shapes
- 4 Using the selection
- 5 Examples
- 6 Load and Save.
First to use the Part module functionality you have to load the Part module into the interpreter:
import Part
Class Diagram
This is a UML overview about the most important classes of the Part module:
Geometry
The geomtric.
Creating basic types
Short description
You can easily create basic topological objects with the "make...()" methods from the Part Module:
b = Part.makeBox(100,100,100) Part.show(b)
A couple of other make...() methods available:
- makeBox(l,w,h,[p,d]) -- Make a box located in p and pointing into the direction d with the dimensions (l,w,h). By default p is Vector(0,0,0) and d is Vector(0,0,1)
- makeCircle(radius,[p,d,angle1,angle2]) -- Make a circle with a given radius. By default p=Vector(0,0,0), d=Vector(0,0,1), angle1=0 and angle2=360
- makeCompound(list) -- Create a compound out of a list of shapes
- makeCone(radius1,radius2,height,[p,d,angle]) -- Make a cone with a given radii and height. By default p=Vector(0,0,0), d=Vector(0,0,1) and angle=360
- makeCylinder(radius,height,[p,d,angle]) -- Make a cylinder with a given radius and height. By default p=Vector(0,0,0), d=Vector(0,0,1) and angle=360
- makeLine((x1,y1,z1),(x2,y2,z2)) -- Make a line of two points
- makePlane(length,width,[p,d]) -- Make a plane with length and width. By default p=Vector(0,0,0) and d=Vector(0,0,1)
- makePolygon(list) -- Make a polygon of a list of points
- makeSphere(radius,[p,d,angle1,angle2,angle3]) -- Make a sphere with a given radius. By default p=Vector(0,0,0), d=Vector(0,0,1), angle1=0, angle2=90 and angle3=360
- makeTorus(radius1,radius2,[p,d,angle1,angle2,angle3]) -- Make a torus with a given radii. By default p=Vector(0,0,0), d=Vector(0,0,1), angle1=0, angle2=360 and angle3=360
Detailed explanations
First import the following:
>>> import Part >>> from FreeCAD import Base
How to create a Vertex?
>>> vertex = Part.Vertex((1,0,0))
vertex is a point created at x=1,y=0,z=0 given a vertex object, you can find its location like this:
>>> vertex.Point Vector (1, 0, 0)
How to create an Edge?
An edge is nothing but a line with two vertexes:
>>> edge = Part.makeLine((0,0,0), (10,0,0)) >>> edge.Vertexes [<Vertex object at 01877430>, <Vertex object at 014888E0>]
Note: You cannot create an edge by passing two vertexes. You can find the length and center of an edge like this:
>>> edge.Length 10.0 >>> edge.CenterOfMass Vector (5, 0, 0)
How to create a Wire?
A wire four lines as a square:
>>> wire3.Length 40.0 >>> wire3.CenterOfMass Vector (5, 5, 0) >>> wire3.isClosed() True >>> wire2.isClosed() False
How to create.
How to create a circle?
circle = Part.makeCircle(radius,[center,dir_normal,angle1,angle2]) -- Make a circle with a given radius
By default, center=Vector(0,0,0), dir_normal=Vector(0,0,1), angle1=0 and angle2=360.)
How to create, which is generally produced by makeLine or makeCircle
>>> arc = Part.Arc(Base.Vector(0,0,0),Base.Vector(0,5,0),Base.Vector(5,5,0)) >>> arc <Arc object> >>> arc_edge = arc.toShape()
Note: Arc only accepts Base.Vector() for points but not tuples. arc_edge is what we want which we can display using Part.show(arc_edge). If you want a small portion of a circle as an arc, it's possible too:
>>> from math import pi >>> circle = Part.Circle(Base.Vector(0,0,0),Base.Vector(0,0,1),10) >>> arc = Part.Arc(c,0,pi)
How to create a polygon or line along points?
A line along multiple points is nothing but creating a wire with multiple edges. makePolygon function takes a list of points and creates a wire along those points:
>>> lshape_wire = Part.makePolygon([Base.Vector(0,5,0),Base.Vector(0,0,0),Base.Vector(5,0,0)])
How to create a plane?
Plane is a flat surface, meaning a face in 2D makePlane(length,width,[start_pnt,dir_normal]) -- Make a plane By default start_pnt=Vector(0,0,0) and dir_normal=Vector(0,0,1). dir_normal=Vector(0,0,1) will create the plane facing z axis. dir_normal=Vector(1,0,0) will create the plane facing x axis:
>>> in y axis is zero. Note: makePlane only accepts Base.Vector() for start_pnt and dir_normal but not tuples
How to create
How to create a Torus?
makeTorus(radius1,radius2,[pnt,dir,angle1,angle2,angle]) -- Make a torus with a given radii and angles. By default pnt=Vector(0,0,0),dir=Vector(0,0,1),angle1=0,angle1=360 and angle=360
consider, to create an arc the last parameter angle is to make a section of the torus:
>>> torus = Part.makeTorus(10, 2)
The above code will create a torus with diameter 20(radius 10) and thickness 4(small cirlce i.e half
How to make a box or cuboid?
makeBox(length,width,height,[pnt,dir]) -- Make a box located in pnt with the dimensions (length,width,height)
By default pnt=Vector(0,0,0) and dir=Vector(0,0,1)
>>> box = Part.makeBox(10,10,10) >>> len(box.Vertexes) 8
How to make a Sphere?
makeSphere(radius,[pnt, dir, angle1,angle2,angle3]) -- Make a sphere with a given radius.)
How to make a Cylinder?
makeCylinder(radius,height,[pnt,dir,angle]) -- Make a cylinder with a given radius and height
By default pnt=Vector(0,0,0),dir=Vector(0,0,1) and angle=360
>>> cylinder = Part.makeCylinder(5,20) >>> partCylinder = Part.makeCylinder(5,20,Base.Vector(20,0,0),Base.Vector(0,0,1),180)
How to make a Cone?
makeCone(radius1,radius2,height,[pnt,dir,angle]) -- Make a cone with given radii and height
By default pnt=Vector(0,0,0), dir=Vector(0,0,1) and angle=360
>>> cone = Part.makeCone(10,0,20) >>> semicone = Part.makeCone(10,0,20,Base.Vector(20,0,0),Base.Vector(0,0,1),180)
Boolean Operations
How to cut one shape from other?
cut(...)
Difference of this and a given topo shape.
>>> cylinder = Part.makeCylinder(3,10,Base.Vector(0,0,0),Base.Vector(1,0,0)) >>> sphere = Part.makeSphere(5,Base.Vector(5,0,0)) >>> diff = cylinder.cut(sphere) >>> diff.Solids [<Solid object at 018AB630>, <Solid object at 0D8CDE48>] >>> diff.ShapeType 'Compound'
Playground:cut shapes.png Playground:cut.png
How to get common between two shapes?
common(...)
Intersection of this and a given topo shape.
>>> cylinder1 = Part.makeCylinder(3,10,Base.Vector(0,0,0),Base.Vector(1,0,0)) >>> cylinder2 = Part.makeCylinder(3,10,Base.Vector(5,0,-5),Base.Vector(0,0,1)) >>> common = cylinder1.common(cylinder2)
Playground:common cylinders.png Playground:common.png
How to fuse two shapes?
fuse(...)
Union of this and a given topo shape.
>>> cylinder1 = Part.makeCylinder(3,10,Base.Vector(0,0,0),Base.Vector(1,0,0)) >>> cylinder2 = Part.makeCylinder(3,10,Base.Vector(5,0,-5),Base.Vector(0,0,1)) >>> fuse = cylinder1.fuse(cylinder2) >>> fuse.Solids [<Solid object at 0DA5B8A0>]
How to section a solid with given shape?
section(...)
Section of this with a given topo shape.
will return a intersection curve, a compound line exactly one closed wire. In the wire, we can look at each edge separately, and inside each edge, we can see the vertexes. Straight edges have only two vertexes, obviously. Part Vertexes are OCC shapes, but they have a Point attribute which returns a nice FreeCAD Vector.
Exploring Edges
In case of an edge, which is an arbitrary curve, it's most likely you want to do a discretization. In FreeCAD the edges are parametrized by their lengths. That means you can walk an edge/curve by its length:
import Part anEdge = Part.makeBox(100,100,100).Edges[0] # make a box with 100mm edge length and get the first edge print anEdge.Length # get the length of the edge in mm (modeling shows it in the viewer
import Part Part.show(Part.makeBox(100,100,100)) Gui.SendMsgToActiveView("ViewFit")
Select now some faces or edges. With this script you can iterate
Examples.Line(aPnt1,aPnt2) aSegment2=Part.Line(aPnt4,aPnt5)
Here we actually define the geometry: an arc, made of 3 points, and two line segments, made of 2. 3 edges (edges can be straight or curved), then a wire made of those three edges.
aTrsf=Base.Matrix() aTrsf.rotateZ(math.pi) # rotate around the z-axis aMirroredWire=aWire.transform)
Load and Save. At the moment exporting is still not possible that way, but should be there soon. | https://wiki.freecadweb.org/index.php?title=Topological_data_scripting&oldid=3715 | CC-MAIN-2020-50 | refinedweb | 1,601 | 60.82 |
Warning: The content of this article may be out of date.
Preamble
Mozilla has configurable, downloadable chrome, meaning that the arrangement and even presence or absence of controls in the main window is not hardwired into the application, but loaded from a separate UI.
Terms
"XPFE" is the term Mozilla-the-organization is using to describe Mozilla-the-browser's Cross Platform Front End, because X and C look similar if you beat them long and hard with a hammer. The intention is to build cross-platform applications like browsers and mail clients from a set of tools designed for that purpose. The intention is not to implement a generic cross-platform application framework. That's been done, and is a great deal of work. We intend to provide a subset of cross-platform functionality suitable for building network applications like browsers, leveraging the cross-platform functionality already built into Gecko, Mozilla's HTML layout engine.
The term "cross-platform UI" is somewhat misleading. UI designers will be able to create UI descriptions which will work on multiple platforms. But proper UI descriptions which take into account various platforms' differing ideas about proper placement of such things as dialog buttons will require some platform-specific work. A single XUL specification can only cross-platform to a degree. UI designers and build engineers will need to maintain separate, platform-specific versions of at least some XUL documents.
"XPToolkit" is rather synonymous with XPFE. Though the former term seems more concrete than the other, and therefore is not an exact replacement, no one is completely certain why we have both.
"XUL" already introduced, is an application of XML used to describe the layout of most windows in the Mozilla browser, including and especially the main, browser window.
Scope
This paper makes no attempt to explain requirements. We don't have a current "requirements" document. XPToolkit Architecture is a better place to gain an understanding of such things. This paper contains a short introduction to Mozilla front-end architecture, concentrating on the task of building UIs. It is, as always, incomplete.
Mozilla applications will be built of "small" components like dialog buttons and mail inbox folders, which we collectively term "widgets." Within a widget, drawing and user interactions are completely under control of the individual widget, and set when the widget was built. Relative placement of widgets, their interactions with each other, and optionally some of their configuration, will be controlled by a UI layout specified in a script whose structure is defined in this and related documents.
Widgets are pieces of the application largely self-contained, generally corresponding to a rectangle of window real estate. Widgets will generally live grouped in separate, dynamically loaded libraries. A widget may expect to own a piece of a window (a toolbar or toolbar set), or it may be expected to work within or without a window (menubars, depending on the platform). It may not be a part of the application UI at all.
Widgets will have predefined behaviour, set at compilation. Buttons will respond to the mouse; toolbars will act as containers for buttons. The effect a widget will have on its application will be defined as a combination of predefined application behaviour and linkage between the widgets. This linkage can be accomplished by including JavaScript in the XUL, or by application code which walks the content model after it has been built from XUL, and hooks up event listeners. Generally a real application will use some combination of the two.
Applications, for instance, will have preconceived notions of what to do when they receive an "open file" command. An "open" button is simply a button. It will send its command to the application for processing, generally using some simple JavaScript for linkage.
We are at first primarily concerned with the obvious UI components: toolbars, menus and dialogs. Conceptually, the XUL language will allow someone with a text editor, given a package of components which can work together, the ability to put together an application by specifying something like this (for an application on an OS using menubars across the top of its applications' windows):
main window containing menubar area at top across width of window containing menubar (and its contents) toolbar area below menubar across width of window containing main toolbar (and its contents) application-specific content area below toolbar area. The task of writing a XUL window description is basically the same as the task of writing an HTML content description, with these exceptions: the syntax is XML (not that different from HTML 4), and there are some elements unique to XUL. These elements are widgets and certain infrastructure associated with the behaviour of the window, explained below.
Most of the details of writing a XUL document are identical to those for writing an XML document, a description of which we will leave to other excellent XML documentation which we assume must exist but have never seen. This document will concentrate on XUL-specific features.
A Word on Case and Namespaces, and Filetypes
XML is of course case sensitive. XUL is equally so. Our current code tends not to be strict about enforcing this, especially for tags and attributes in the HTML namespace. This will change: tags and attributes will, as a rule, always be lower case as suggested in the XHTML Working Draft.
Mozilla gives a special meaning to XUL files; it expects to find UI descriptions within. For this reason, we've defined a MIME type "text/xul" mapped to files with the extension ".xul". (For standards purposes, we will probably need to change the the mime type to something like "text/x-xul".) These files are processed using the same parser as "text/xml" files (and therefore subject to XML syntax rules, as they should be). It's possible to load a XUL document from an XML file (one named *.xml). The resulting UI will be created using an XML content model. A XUL content model is generated from *.xul files. XML documents support the basic DOM Level 1 Core APIs. XUL documents support an extended set, much as HTML documents support DOM Level 1 HTML APIs. Mozilla's XUL content models also support nifty features like local/remote merging; see the XUL and RDF document for details. In general, you will want to store XUL in *.xul files.
A XUL file can contain XML elements and HTML elements, as well as special elements unique to XUL: XUL elements. Namespace declarations for XUL (and HTML, if HTML elements are used) must be included in the file. Namespaces must be treated carefully. Correct namespace usage dictates that the namespace be used only for the tag, not in individual attributes. Rare exceptions to this rule are bugs..
Someday, there will be a complete description of this mechanism at packages, but for now there's a good but somewhat out of date document at Configurable Chrome available for more information.
Scripting
A XUL interface is only a collection of disconnected widgets until it has been programmed. "Programming" can be as simple as some JavaScript to tie the widgets together and perhaps to give them extra functionality, or as complex as application (C++) code which is free to do ... anything. This paper will concentrate on JavaScript, deeming application programming to be beyond its scope. for a list of attributes accepting JavaScript values.
JavaScript is most safely kept in a separate file and included in the XUL file
<html:script
or relegated to the contents of a CDATA section, to prevent the XML parser from choking on JavaScript which may look like XML content (a
< character, for instance.)
<html:script <![CDATA[ function lesser(a,b) { return a < b ? a : b; } ]]> </html:script>.
DOM Extensions
Since XUL is not the same thing as HTML, while XUL documents will support the DOM Level 1 Core API, they will not support the DOM Level 1 HTML API. However, Mozilla supports extended DOM functionality for the XUL content model, patterned after the HTML extensions. At this time these additional DOM methods are available, though the code is of course the most accurate place to look for this information. These interfaces can be found in the directory
mozilla/rdf/content/public/idl.
XULDocument
XULDocument extends
Document in a fashion similar to
HTMLDocument's extension
interface XULDocument : Document { Element getElementById(in DOMString id); NodeList getElementsByAttribute(in DOMString name, in DOMString value); };
getElementById works like HTML's
getElementById.
getElementsByAttribute returns a list of
Elements for which the named attribute has the given value. A
value of "*" is a wildcard signifying all elements with the attribute.
XULElement
XULElement extends
Element.
interface XULElement : Element { NodeList getElementsByAttribute(in DOMString name, in DOMString value); };
getElementsByAttribute functions as does its namesake in
XULDocument, though this version returns only those elements which match the criteria and are descendants (in CSS selector terminology) of the given element.
XULElement also supports other methods for hooking up broadcasters; a function performed automatically by the XUL document loader and therefore not normally used in JavaScript.
XUL Elements
As mentioned above, a XUL file is mostly an HTML file with XML syntax. A XUL file may contain nothing but HTML elements and be completely functional. But XUL defines several element types unique to itself, which add functionality to the window..
Other Infrastructure
Widgets may have JavaScript event handlers just as in HTML, and are tied together using JavaScript and broadcaster nodes. Broadcaster nodes are declared as
<broadcaster> elements in the XUL description, and are involved with the communication of changes of state between widgets. A widget or several widgets can arrange to have the value of one of their attributes be tied to a broadcaster node. This tie is defined within the XUL:
<xul:window <broadcaster id="canGoBack"/> <titledbutton src="resource:/res/toolbar/TB_Back.gif" align="bottom" value="Back" onclick="BrowserBack()"> <observes element="canGoBack" attribute="disabled"/> </titledbutton> </window>
But it is up to the application code to locate the broadcasters within a window so it can punch them when necessary.
Broadcasters can broadcast any change of state, which can be tied to the value of any attribute in another XUL widget. For more complete documentation, see Broadcasters and Observers. label="File"> <menupopup> <menuitem label="Hello World!" onclick="alert('Hello world!\n');"/> </menupopup> <).
Idealistic Future Direction
Ideally, packages of XUL UI descriptions could be shipped in a single file something like
<?xml version="1.0"?> <?xml-stylesheet <window id="main"> ... </window> <window id="help"> ... </window> </package>
And a window (or other service) could be instantiated by first parsing the whole package and then picking out a window from its contents
Package *package = LoadPackage(""); InstantiateWindow(package, GetNodeWithID("main");
This happy scheme doesn't work today, because the code expects the result of parsing an XML document to be a window. So currently, a single XUL file must contain a single window.
<?xml version="1.0"?> <?xml-stylesheet ... </window>
We would like to head more toward the "package" implementation in the future.
Internationalization
For practical reasons, the locale-specific attributes of a UI description would be most happily developed (and possibly distributed) in separate files, where localization can be performed by altering only a subset of the UI description devoted expressly to localization issues. That is, a separate file of localized strings.
Internationalization is discussed more completely in the XUL Coding Style Guidelines document. In brief, Mozilla has settled on XML entities as the mechanism. Entities are a feature of the language and therefore outside the scope of this paper. A XUL file can be made localizeable very easily by substituting entities for any content which may change as the locale changes. The localized text must be defined in a separate DTD or DTD fragment. The whole system is then configured with different locale-specific DTDs, and the correct DTD will be chosen for a given XML file at runtime, depending on the current locale settings. Mozilla will make that decision automatically if the localized XML file specifies its DTD using a chrome URL, as outlined in XUL Localizability Issues.
Original Document Information
- Author(s): danm@netscape.com
- Last Updated Date: January 31, 2005 | https://developer.mozilla.org/en-US/docs/Archive/Mozilla/XUL/Introduction_to_XUL | CC-MAIN-2020-24 | refinedweb | 2,018 | 53.1 |
JavaScript.
CSS custom properties and JavaScriptCSS custom properties and JavaScript
Custom properties shouldn’t be all that surprising here. One thing they’ve always been able to do since browsers started supporting them is work alongside JavaScript to set and manipulate the values.
Specifically, though, we can use JavaScript with custom properties in a few ways. We can set the value of a custom property using
setProperty:
document.documentElement.style.setProperty("--padding", 124 + "px"); // 124px
We can also retrieve CSS variables using
getComputedStyle in JavaScript. The logic behind this is fairly simple: custom properties are part of the style, therefore, they are part of computed style.
getComputedStyle(document.documentElement).getPropertyValue('--padding') // 124px
Same sort of deal with
getPropertyValue. That let us get the custom property value from an inlined style from HTML markup.
document.documentElement.style.getPropertyValue("--padding'"); // 124px
Note that custom properties are scoped. This means we need to get computed styles from a particular element. As we previously defined our variable in
:root we get them on the HTML element.
Sass variables and JavaScriptSass variables and JavaScript
Sass is a pre-processing language, meaning it’s turned into CSS before it ever is a part of a website. For that reason, accessing them from JavaScript in the same way as CSS custom properties — which are accessible in the DOM as computed styles — is not possible.
We need to modify our build process to change this. I doubt there isn’t a huge need for this in most cases since loaders are often already part of a build process. But if that’s not the case in your project, we need three modules that are capable of importing and translating Sass modules.
Here’s how that looks in a webpack configuration:
module.exports = { // ... module: { rules: [ { test: /\.scss$/, use: ["style-loader", "css-loader", "sass-loader"] }, // ... ] } };
To make Sass (or, specifically, SCSS in this case) variables available to JavaScript, we need to “export” them.
// variables.scss $primary-color: #fe4e5e; $background-color: #fefefe; $padding: 124px; :export { primaryColor: $primary-color; backgroundColor: $background-color; padding: $padding; }
The
:export block is the magic sauce webpack uses to import the variables. What is nice about this approach is that we can rename the variables using camelCase syntax and choose what we expose.
Then we import the Sass file (
variables.scss) file into JavaScript, giving us access to the variables defined in the file.
import variables from './variables.scss'; /* { primaryColor: "#fe4e5e" backgroundColor: "#fefefe" padding: "124px" } */ document.getElementById("app").style.padding = variables.padding;
There are some restrictions on the
:export syntax that are worth calling out:
- It must be at the top level but can be anywhere in the file.
- If there is more than one in a file, the keys and values are combined and exported together.
- If a particular
exportedKeyis duplicated, the last one (in the source order) takes precedence.
- An
exportedValuemay contain any character that’s valid in CSS declaration values (including spaces).
- An
exportedValuedoes not need to be quoted because it is already treated as a literal string.
There are lots of ways having access to Sass variables in JavaScript can come in handy. I tend to reach for this approach for sharing breakpoints. Here is my
breakpoints.scs file, which I later import in JavaScript so I can use the
matchMedia() method to have consistent breakpoints.
// Sass variables that define breakpoint values $breakpoints: ( mobile: 375px, tablet: 768px, // etc. ); // Sass variables for writing out media queries $media: ( mobile: '(max-width: #{map-get($breakpoints, mobile)})', tablet: '(max-width: #{map-get($breakpoints, tablet)})', // etc. ); // The export module that makes Sass variables accessible in JavaScript :export { breakpointMobile: unquote(map-get($media, mobile)); breakpointTablet: unquote(map-get($media, tablet)); // etc. }
Animations are another use case. The duration of an animation is usually stored in CSS, but more complex animations need to be done with JavaScript’s help.
// animation.scss $global-animation-duration: 300ms; $global-animation-easing: ease-in-out; :export { animationDuration: strip-unit($global-animation-duration); animationEasing: $global-animation-easing; }
Notice that I use a custom
strip-unit function when exporting the variable. This allows me to easily parse things on the JavaScript side.
// main.js document.getElementById('image').animate([ { transform: 'scale(1)', opacity: 1, offset: 0 }, { transform: 'scale(.6)', opacity: .6, offset: 1 } ], { duration: Number(variables.animationDuration), easing: variables.animationEasing, });
It makes me happy that I can exchange data between CSS, Sass and JavaScript so easily. Sharing variables like this makes code simple and DRY.
There are multiple ways to achieve the same sort of thing, of course. Les James shared an interesting approach in 2017 that allows Sass and JavaScript to interact via JSON. I may be biased, but I find the approach we covered here to be the simplest and most intuitive. It doesn’t require crazy changes to the way you already use and write CSS and JavaScript.
Are there other approaches that you might be using somewhere? Share them here in the comments — I’d love to see how you’re solving it.
This is awesome. Thank you very much.
This is big! Thanks for sharing.
Wow, I had no idea about the :export. Can be really useful. Thanks
Very useful, thanks
I use TailwindCSS in my pipeline so accessing a variable is as simple as just using a class from a design system or a reference to a theme object. The source for Tailwind config are json files, so those can be imported directly into js without any sass mumbo-jumbo
Thanks for sharing. Where I’m stuck is going the other direction: accessing JavaScript variables from SCSS. My client wants to define a theme in JavaScript and access theme values in SCSS.
I can find surprisingly little discussion of this. I tried the most promising Webpack-based technique from a 2018 article but couldn’t get it to work with recent libraries.
You can do it with css variables.
Javascript can assign css variables to any DOM node. Then you can you access it in your CSS.
Just wanted to also add that if you’re using Gatsby and want to export Sass variables with :export as shown above, that it will work in local development mode but then won’t in production for gatsby specific reasons. The simple solution is to name your file from
variables.scssto
variables.module.scss. Files named with
modules.scssat the end are treated slightly differently.
Some context:
Hi Marko, thanks for the informative article!
I’m trying to find official documentation for the “:export” syntax but I’m coming up short. Is this a webpack feature? Or a loader’s feature? If you could point me to official docs, I’d be grateful.
Thank you!
Hi Maxime,
This is enabled by
css-loader. But is actually CSS-modules feature and here is the exact link to the export doc.
Hope I answered your question.
For adding your script in webpage try this chrome extension
For some reason if you write Jest tests and use :export the variables will be undefined when Jest runs. | https://css-tricks.com/getting-javascript-to-talk-to-css-and-sass/ | CC-MAIN-2021-21 | refinedweb | 1,169 | 57.98 |
Created on 2006-10-02 13:30 by lskovlund, last changed 2010-12-04 11:02 by georg.brandl. This issue is now closed.
Use iterative doubling when extending the old array.
This results in O(log n) calls to memcpy() instead of O(n).
Logged In: YES
user_id=341410
Have you benchmarked this for repeats found "in the wild" to
establish *observable* speedup for code that already exists?
Logged In: YES
user_id=263372
I wrote this code for a university project I'm doing myself,
which involves initializing a *very* large array (it's a
remote memory system). It does help there, certainly; for
medium-sized arrays, the improvement would be negligable,
and for small ones it might even be worse.
If you mean, have I benchmarked it with other people's code,
no. I just thought I'd offer it to the community, since it
has certainly helped me.
Logged In: YES
user_id=80475
This patch is basically fine. Will neaten it up to match
our source coding conventions and apply it when I get a
chance. Py2.6 won't be out for a good while, so there is
no hurry.
Logged In: YES
user_id=364875
I'd assumed Python *didn't* double the size when resizing an array because of how much memory that wastes. May I suggest trying it with a multiplier of 1.5x, and comparing both CPU time and memory consumption? I find for these things that 1.5x is nearly as fast and wastes far less memory.
Logged In: YES
user_id=341410
This patch has nothing to do with array resizing. It has to
do with array initialization.
This proposal is basically fine. The patch should be re-worked to model as closely as possible the code for string_repeat in Objects/stringobject.c (revisions 30616 and 30368 provide the details). That code is known to work and to have provided a meaningful speed-up.
This one is easy if someone wants to take a crack at it.
Looking at stringobject.c:1034:
i = 0;
if (i < size) {
Py_MEMCPY(op->ob_sval, a->ob_sval, Py_SIZE(a));
i = Py_SIZE(a);
}
while (i < size) {
j = (i <= size-i) ? i : size-i;
Py_MEMCPY(op->ob_sval+i, op->ob_sval, j);
i += j;
}
return (PyObject *) op;
Do I miss something or the first condition "if (i < size)" is
a fancy way to check for size > 0?
Wouldn't it be clearer to write
if (size == 0)
return (PyObject *) op;
Py_MEMCPY(op->ob_sval, a->ob_sval, Py_SIZE(a));
i = Py_SIZE(a);
..
Attached patch (issue1569291.diff) reimplements the optimization by
following Objects/stringobject.c logic as Raymond suggested.
I see two remaining issues which in my view should be addressed separately:
1. There is no check for overflow after the multiplication computing the
size of the resulting array. Note that while newarrayobject checks that
size*itemsize does not overflow internally, there is no such check for
Py_SIZE(a) * n. A decision needs to be made whether Overflow or NoMemory
error should be raised because currently string_repeat and
newarrayobject treat overflow differently.
2. See msg64429 above. I think both string and (patched) array codes
can be simplified.
I forgot to mention that I added a unit test to cover the special case
of repeating a single-byte array.
Georg, do you want to take it from here.
There are lots of positive comments on this issue, please can core developers take a bit of time to have a look and say yes or no.
Uh, this slipped under my radar. Let's see if I get the chance to look at it at the core sprint next week.
I changed the patch to look more like unicode_repeat (which addresses Alex' point #2) and committed in r87022. | http://bugs.python.org/issue1569291 | CC-MAIN-2017-04 | refinedweb | 623 | 75 |
TLDR; testing a popular web app using Cypress.
- Array Explorer
- The setup
- First test
- Second test
- Covering primary methods
- Use JavaScript
- Simplifying test using aliases
- Generating tests
- Fake time
- Need for speed
- How do you say test in ...
- Final thoughts
Array Explorer
Array Explorer is a great resource for learning JavaScript array operations. You can see it in action yourself at. Here is me adding items to an array and seeing the result and relevant documentation.
The source for this project is available at github.com/sdras/array-explorer and is written by wonderfully productive Sarah Drasner. I have noticed that the project does not have any tests. This is a great opportunity to quickly write a few end-to-end tests using Cypress test runner. Just a few high level tests can exercise the entire application as if a real user was interacting with the page.
Let us start testing!
Hint: Sarah has a sister project sdras/object-explorer that you could test the same way! That would be a great practice for anyone trying out Cypress.
The setup
First, I need to setup Cypress. Luckily it only takes a minute.
- I forked the
sdras/array-explorerrepo to get my own copy
- cloned the forked repository to local drive
If we execute
npm start right now we will get a local app running at. Let us start testing it.
- I installed Cypress as a dev dependency, and set the
testscript command.
During local development we will be running
npm run test:gui which opens Cypress in GUI mode - it is really convenient to see what is going during our tests. On CI we will run Cypress tests in headless mode using
cypress run command.
- when I opened Cypress using
npm run test:guifor the very first time, it scaffolded the test folder
cypressand a configuration file
cypress.json.
First test
- We can rename new file
example_spec.jsto just
spec.jsand remove its contents to start from scratch. Notice that Cypress picks up file changes right away; click on the renamed file
spec.jsin Cypress file list. There no tests yet it says. Here is the first test I wrote.
Cypress has noticed file changes and ran it right away. I see the local site in the Cypress iframe (the dev server
npm start is still running). Everything is green!
Second test
Let us confirm that the page is greeting us with the name of the project "JavaScript Array Explorer". For finding unique text on the page, I usually use
cy.contains(text) command. In this case this text might appear somewhere else on the page. To avoid accidents like this, let us make the selector more precise. Recently we have introduced CSS Selector Playground tool. Click on its target icon next to the url bar and hover over the text to see its "best" selector - in this case it suggests using
h1 selector.
Let us update our first test to confirm that the text really greets us after load.
Perfect, the test passes.
Covering primary methods
There are 7 primary methods Array Explorer teaches: from "add items or other arrays" to "something else". We really should create suites of tests for each primary method. In this example I will write just a few example tests. Let me start with "something else" primary method, that has "length of the array" secondary option.
As suggested by the "CSS Selector Playground" helper (or by looking up in the DevTools), the first drop down choice can be queried with
#firstmethod selector. The method options can be set in the
#methodoptions drop down. Here is our test.
While the test is running I see Cypress opening drop downs, finding the right choice, selecting it. If an element with a given selector was missing and did not appear for the command's timeout duration, an intelligent error message with a screenshot would appear. But so far everything is going great.
We need to add an assertion to the test. We have not confirmed that the app actually shows an example of the array length property. And we have not confirmed that the output text area is really showing the right answer. Let us do this. The app works in steps
- Code appears (with slow type effect) in the first box
.usage1
- Then the answer appears in box
.usage2 > .usage-code
Under the hood, the Array Explorer has input and output code as text already in the DOM, just hidden. The input code is supposed to "produce" the output text - it has
console.log(...) statements, but of course they are not actually executing. So in our "length of array" example the input looks like this
The output text is
3 and is initially hidden. Only after delayed "type" effect it appears.
In our test, we can grab the input code as text, and the output text, and we should make sure the output value is visible and correct. To make sure the value is correct, I will
eval the input text. Because the input uses
console.(...) to "print" the result, before evaluating the code, I will set up a spy on
console.log method using built-in [
cy.spy][spy] method. Here is the entire test - it kind of looks scary, but it is really universal and can work with any array explorer example!
Here is the test in action. Notice an interesting detail that goes to the heart of what makes Cypress great - the intelligent waiting for assertion to pass. The last statement of the test grab the output element and sets up TWO assertions.
Tip:
.and is equivalent to
.should. It improves readability when making multiple assertions about the same element.
The video below shows the first asserts waits until the type effect finishes and the app makes the answer visible. Then the second assertion verifies that the right value is in the element.
Cypress fights the unpredictable nature of end-to-end tests by retrying commands for a period of time, and these options are very configurable. The default command timeout of 4 seconds works well for this example, but was too short for other ones. So I increased the command timeout by setting it in
cypress.json file
Use JavaScript
As my test grows in complexity to handle multiple output values and different edge cases, the code becomes difficult to understand. Luckily, it is just JavaScript. I can refactor the test code as much as I like. I could move utility functions out to separate files and just
require or
import them. I can bring any NPM module as a dependency and include in my test code.
Back to our test. We can factor out the logic for running the input code sample and comparing it to the output text box. Here is this function with its main parts.
Simplifying test using aliases
A very handy feature to make tests simpler is aliases. Aliases allow saving reference to a DOM element, data or XHR stubs to use later. Here is a fragment of the function that gets the output text and saves several aliases for future use.
In the above example we save reference to the DOM element as alias
output, raw text without comments as alias
outputText and parsed JavaScript values as
outputValues. Later we can use the aliased values like this
Aliases are great way to avoid deep nesting or temporary variables.
Generating tests
I wrote a couple of other tests: "fill array ...", "copy a sequence of elements ...". They all work the same way - set the desired method example and call
confirmInputAndOutput. The spec file kind of looks boring.
All tests are going to look like this. Can we generate the tests from a list of options? Yes we can. Instead of writing individual
it(..., () => {...}) calls, I placed all primary method names and corresponding option names into an object of arrays. A small helper function iterates over the arrays, creating tests.
One short spec file is running 20 tests checking all array method examples (except for "find" method that requires extra arguments)
Fake time
One test is failing. Can you spot the problem?
The input code sample uses current date!
The expected output is hardcoded to be "12/26/2017, 6:54:49 PM", which will never match the evaluated input code. What can we do? Ordinarily, Cypress tests use
cy.clock to control the time inside the running application like this
But our use case is different. It is NOT the application that is calling
new Date(), but our unit test via
eval.
Thus our test code must fake the date. Luckily, Cypress has Sinon bundled and available under
Cypress.sinon property. Right before we evaluate our code we can fake the
Date object.
Tricking
eval to use local variable via closure is one of my favorite JS tricks. Aside from this, I changed the original example a little bit. I split the single
console.log to be two statements to better match what every example is doing and what my tests expect.
Note the alises are highlighted when saved (pink and blue rounded labels
output and
outputValues). They are also highlighted with
@... label when used.
Need for speed
The tests are passing, but there is one negative. They take too long to finish - 67 seconds! The main reason each tests takes a few seconds are the delays built into the app. There is half a second delay to let the user read the first line of the example code, then there is the "type" effect that uses
gsap library to reveal the rest of the example code.
The gsap is JavaScript animation library, so maybe if we can "speed" up application's timers we can zoom through the type animation and make our tests faster. While Sinon includes timers, I found lolex to be the most convenient library to work with fake timers. Luckily using this from our tests is very simple.
First, install
lolex as a new dev dependency.
Second, install fake timers into the application before the application loads. We can do this in the callback
onBeforeLoad of the
cy.visit method. It is important to pass the application's window as the target for stubbing timers.
Inside the test logic we can manually advance the clock after the source code appears and the app called its
setTimeout (which is now stubbed).
The generous 10 second time jump completes the initial delay of 500ms and instantly zooms through any typing animation the app makes. The result is awesome - total time to finish all tests goes down from 67 seconds to 27 seconds!
How do you say test in ...
The last thing I will do is write a test to make sure the language selector works. Because the language selection element does not have a good way to access it I have added
data-attr-cy attribute
The test can use this data attribute to get the right selection element. After selecting the desired language (I am picking my native Russian), we use the same test logic as before.
Tip: we could have imported data for different languages directly from the
store/<language> files. Then we could actually iterate and create full test suites for every language. After all, out tests are JavaScript and can share code with the web app itself!
Final thoughts
Here is the final result - the spec.js file and the screen recording of the running tests. The tests take longer than 27 seconds because my laptop is choking a little bit during while doing full screen recording.
I have opened a pull request sdras/array-explorer/pull/70 to merge these tests into the Array Explorer. Maybe these tests can inspire you to add tests to sdras/object-explorer?
You can find more information about Cypress from these links | https://glebbahmutov.com/blog/drive-by-testing-array-explorer/ | CC-MAIN-2019-18 | refinedweb | 1,967 | 74.9 |
This explanation is really intuitive
.
SJ1 - Editorial
I guess you are missing taran’s editorials more - I barely get time to serve as editorialist these days I am sure people would have forgotten how mine were like
thumbs up… it’s a great explanation, I see nowadays that the official editorials use a bit tough language and statements i.e. it’s not beginner friendly
"Life is too short to keep track of unwanted things"…
but seriously though I miss Chef’s Vijju Corner.
@melfice It is mentioned in editorial that :
“we always may find a linear combination which is equal to g , by extended euclids algorithm”
But in extended Euclid’s theorem the coefficients of a,b maybe negative i.e in the equation ax+by=gcd(a,b) , x and y maybe negative .
However it is clearly mentioned in the question
"For each node on this path (including the root and this leaf), choose a non-negative integer and multiply the value of this node by it "
what is wrong in this code.please if you can debug it
now i am able to understand it clearly,thanks man
@yuv_sust I agree that if D is not a multiple of G then surely there is no integral solution, however, I don’t see why the converse part is always true, that given any D=nG we can always get non-negative coefficients A, B, C... which satisfy the equation.
A simple example can be x=240 and y=46 with GCD(x,y) =G= 2 , lets say we want D=G (i.e n=1) here using extended Euclid’s theorem give us A=-9 and B=47 ( -9*240+47*46=2 ) , but in question it is clearly mentioned that the coefficients A,B with which we are multilpying the nodes must be positive.
"For each node on this path (including the root and this leaf), choose a non-negative integer and multiply the value of this node by it "
Unofficial Editorial of SJ1
Please Help me with this code.
It is giving me wrong answer in every test case.
But i manually tested a few cases, they’re running fine.
#include<iostream> #include<vector> #include<map> #define lli long long int using namespace std; vector <lli> G[100001]; int V[100001]; int M[100001]; bool T[100001]; map <lli,lli> A; lli GCD(lli a , lli b){ if(b == 0) return a; else return GCD(b,a%b); } void DFS(lli i, lli gcdTillNow) { if(T[i]==false) { T[i]=true; gcdTillNow=GCD(gcdTillNow,V[i]); if(G[i].size()==1)// ie of leaf node { A[i]=M[i]-GCD(M[i],gcdTillNow); } else // if not leaf node { for(lli j=0;j<G[i].size();j++) { DFS(G[i][j],gcdTillNow); } } } } int main() { int t; cin>>t; while(t--) { for(lli i=0;i<100001;i++) { G[i].clear(); T[i]=false; V[i]=0; M[i]=0; } A.clear(); lli N; cin>>N; for(lli i=0;i<N-1;i++) { lli a,b; cin>>a>>b; G[a].push_back(b); G[b].push_back(a); } for(lli i=1;i<=N;i++) cin>>V[i]; for(lli i=1;i<=N;i++) cin>>M[i]; DFS(1,V[1]); // printing ANS map<lli,lli>::iterator it; for(it=A.begin();it!=A.end();it++) { cout<<it->second<<" "; } cout<<endl; } return 0; }
He is missing your corner thoughts. As for me, I have been barely keeping up college work and related things these days.
@vijju123 Legends are not forgotten.
But if only my corner is being missed then that means I can extend my break
. I will be back when my explanations get missed as well hehehehe
@vijju123 Sir,we are missing you badly. Our life is hollow without your editorials and chef vijju’s corner
Can someone please help me find my mistake in this??
@ melfice please help me, what is the bug in my program, it run perfectly in my computer but didn’t get AC this is the link i have use dictionary for storing tree as well as result
For all those who are getting TLE, try using fast input output. TLE arises because of the fact that computing gcd is a time consuming process. | https://discuss.codechef.com/t/sj1-editorial/23213?page=2 | CC-MAIN-2019-22 | refinedweb | 714 | 58.52 |
Spawns child processes and allocates
process.env.PORT for each.
Spawns child processes with dynamic port allocation and other goodies. Sort of like forever but with a few more features.
PORTenvironment variable
$ npm install spinner
var http = require'http';console.log'[myapp] Started on port %s' processenvport || 5000;httpcreateServerconsole.log'[myapp] %s %s' reqmethod requrl;resend'hello, world';listenprocessenvport || 5000;
This is a simple node.js HTTP server that binds to
process.env.port.
It emits some logs which will be piped into the server's stdio streams.
var http = require'http';var spinner = require'spinner'createSpinner;spinnerstart'./myapp.js'var req = httprequest socketPath: socket ;reqon'response'console.log'[server] HTTP %d %s' resstatusCode httpSTATUS_CODESresstatusCode;reson'data'console.log'[server] DATA <' + datatoString + '>';;reson'end'spinnerstop'./myapp.js';;;reqend;;
The server creates a spinner and starts
./myapp.js. The callback receives a
socket parameter
with the unix domain socket (or named pipe in Windows) path. Then, it uses node's
http module to
issue an HTTP request into this pipe.
Output:
$ node server.js[myapp] Started on port /tmp/ed929e3c521e4004bb93c59a65c968b2[myapp] GET /[server] HTTP 200 OK[server] DATA <hello, world>
Returns a spinner. Within a spinner namespace, child processes are identified by name and only a single child can exists for every name.
This means that if I call
spinner.start('foo') twice, only a single child will be spawned. The second call will return the same port.
globalOptions may contain any of the options passed along to
spinner.start() (except
name and
args) and used as defaults options
for
spinner.start.
// Name of child. Basically a key used to identify the child processname: 'foofoo'// Program to execute (default is `process.execPath`, which is node.js)command: processexecPath// Array of arguments to use for spawnargs: './myapp.js'// Environment variables for spawned processenv: myenv: '1234'// working directory to spawn the app (default null)cwd: null// Logger to use (default is `console`)logger: console// Timeout in seconds waiting for the process to bind to the// allocated port (default is 30 seconds)timeout: 30// Number of attempts to start the process. After this, spinner will not// fail on every `start` request unless a `stop` is issued (default is 3).attempts: 3// Timeout in seconds to wait for a child to stop before issuing a// SIGKILL (default is 30 sec)stopTimeout: 30// Path of file or directory to monitor for changes. When the monitor// indicates a change, the child will be restarted. Default is null// (no monitor). file must exist when the child is first started.monitor: './lazykiller.js'// Stream to pipe process stdout to (default is process.stdout). Use `null` to disable.stdout: processstdout// Stream to pipe process stderr to (default is process.stderr). Use `null` to disable.stderr: processstderr// Idle time: if `spinner.start` is not called for this process within this time,// spinner will automatically stop the process. Use `-1` to disable (default is 30 minutes).idleTimeSec: 30 * 60// Number of seconds allowed between unexpected restarts of a child process. If a restart// happens within less time, the child will be become faulted.restartTolerance: 60// Number of seconds child process is not restarted when it is faulted. If child process// started again after this timeout expired, another attempt to spawn it will be made.faultTimeout: 60
The argument
callback is
function(err, port) where
port is the port number allocated for this child process and set in it's
PORT environment variable (in node.js:
process.env.PORT). If the child could not be started or if it did not bind to the port in the alloted
timeout,
err will indicate that with an
Error object.
A short form for
spinner.start() where
script is used as the first argument to the node engine prescribed in
process.execPath and also used as the name of the child.
Monitor is also set to point to the script, so if it changes, the child will be
restarted (unless
monitor is set to
null in the global options).
Stops the child keyed
name.
callback is
function(err).
Spinner sends
SIGTERM and after
stopTimeout passes, sends
SIGKILL.
Stops all the child processes maintained by this spinner.
callback is
function(err)
Returns information about a child process named
name. The information includes the options
used to start the child process and a
state property indicating the current state of the
child.
Possible states are:
Returns the list of child processes maintained by this spinner. The result is a hash
keyed by the child name and contains the details from
spinner.get().
function(port) {}
Emitted after the child process has been started and bound to
port. This means it can
be accessed from now on via
{ host: 'localhost', port: port }.
function() {}
Emitted after the child process has been stopped.
function(port) {}
Emitted after the child process has been restarted (either due to a file change or due to a crash).
function(e) {}
Emitted when an error occured while starting the child process.
MIT
Originally forked from forked from nploy by George Stagas (@stagas), but since I had to work out the crazy state machine, not much code of
nploy let. Neverthess, it's an awesome lib. | https://www.npmjs.com/package/spinner | CC-MAIN-2015-35 | refinedweb | 858 | 59.5 |
In today’s Programming Praxis exercise, our goal is to write an interpreter for the esotreric programming language Fractran and use it to execute a program that generates prime numbers. Let’s get started, shall we?
A quick import:
import Data.List
The fractran interpreter itself is pretty simple. We use tuples to represent the fractions rather than Ratios since this made for slightly more elegant code. Unfortunately the Prelude doesn’t have a function to swap the values of a tuple, or I could’ve use divMod rather than having to repeat the multiplication.
fractran :: [(Integer, Integer)] -> Integer -> [Integer] fractran xs = unfoldr (\m -> fmap ((,) m) . lookup 0 $ map (\(n,d) -> (mod (m*n) d, div (m*n) d)) xs)
Since we’re using tuples, we represent the primegame program as a zip.
primegame :: [(Integer, Integer)] primegame = zip [17,78,19,23,29,77,95,77, 1,11,13,15,15,55] [91,85,51,38,33,29,23,19,17,13,11,14, 2, 1]
Finding the primes is a matter of finding the terms in the output of fractran primegame 2 that are powers of two.
primes :: [(Integer, Integer)] primes = [(i,e) | (i,n) <- zip [1..] $ fractran primegame 2 , let e = round $ log (fromIntegral n) / log 2, 2^e == n]
A test to see if everything is working properly:
main :: IO () main = mapM_ print $ take 26 primes
Tags: bonsai, code, fractran, Haskell, interpreter, kata, praxis, prime, primes, programming | http://bonsaicode.wordpress.com/2012/07/06/programming-praxis-fractran/ | CC-MAIN-2014-10 | refinedweb | 240 | 61.06 |
/* input_file.h header for input-file. */ /*"input_file.c":Operating-system dependant functions to read source files.*/ /* * No matter what the operating system, this module must provide the * following services to its callers. * * input_file_begin() Call once before anything else. * * input_file_end() Call once after everything else. * * input_file_buffer_size() Call anytime. Returns largest possible * delivery from * input_file_give_next_buffer(). * * input_file_open(name) Call once for each input file. * * input_file_give_next_buffer(where) Call once to get each new buffer. * Return 0: no more chars left in file, * the file has already been closed. * Otherwise: return a pointer to just * after the last character we read * into the buffer. * If we can only read 0 characters, then * end-of-file is faked. * * All errors are reported (using as_perror) so caller doesn't have to think * about I/O errors. No I/O errors are fatal: an end-of-file may be faked. */ extern FILE *f_in; extern char *file_name; #ifdef SUSPECT extern int preprocess; #endif extern void input_file_begin( void); extern void input_file_end( void); extern int input_file_buffer_size( void); extern int input_file_is_open( void); extern void input_file_open( char *filename, int pre); extern char *input_file_give_next_buffer( char *where); | http://opensource.apple.com//source/cctools/cctools-667.4.0/as/input-file.h | CC-MAIN-2016-36 | refinedweb | 182 | 51.65 |
C++ Class Basics
Classes are a user defined data type that contain components known as members. These members can be private or public variables or functions. By default, all members of a class are private, which means they cannot be accessed outside of the class.
Classes are used as blueprints to create objects, or instances, of a class. For example, if you had a class
Dog, you can create many instances of
Dog.
class Dog { private: // private member variables cannot be accessed outside of the class std::string m_name; public: void speak() { std::cout << "Woof! I'm " << m_name << "!\n" ; } void setName(std::string name) { // since m_name cannot be accessed directly, a member function can be used to indirectly set a Dog's name m_name = name; } }; // <- don't forget the semi-colon int main() { Dog penny; // members are accessed using the 'dot operator', or member access operator penny.setName("Penny"); penny.speak(); Dog pixel; pixel.setName("Pixel"); pixel.speak(); return 0; } // output Woof! I'm Penny! Woof! I'm Pixel!
You can initialize member variables upon instantiation by using a constructor function. A constructor has no type and uses the same name as the class. You can also set default parameters which will be set if no other value is provided. A default constructor is automatically executed when a class object is declared, whether you explicitly create one or not.
class Dog { // private members ... public: Dog(std::string name = "Gremlin") { m_name = name; } // more public members ... }; int main() { // using setName Dog penny; penny.setName("Penny"); penny.speak(); // using constructor Dog pixel("Pixel"); pixel.speak(); // using default parameter Dog unnamed; unnamed.speak() } // output Woof! I'm Penny! Woof! I'm Pixel! Woof! I'm Gremlin!
Classes also have functions called destructors, that are automatically invoked when the object goes out of scope or is destroyed.
class Dog() { // ... public: Dog(); // constructor ~Dog(); // destructor };
Like a constructor, a destructor is automatically created if not explicitly defined and has the same name as the class, but it's preceded by a tilde (~). A destructor takes no arguments.
Moving a class into separate files
You will want to move a class into its own files in order to keep the implementation private, keep your main file clean, and allow the class to be used in other files/programs.
There are 2 types of files that need to be created: the implementation file (.cpp) and header file (.h or .hpp). I wrote about header files here if you want to check that out.
The implementation file contains the definitions of the class' member functions and the header file contains the function prototypes and member variables.
// Dog.hpp #ifndef Dog_hpp #define Dog_hpp #include <string> class Dog { private: std::string m_name; // variable to store name int m_age; // variable to store age public: // constructor function Dog(std::string name = "Gremlin"); // function to output dog speaking its name to the console void speak(); // function to set the dog's name void setName(std::string name); }; #endif /* Dog_hpp */
// Dog.cpp #include "Dog.hpp" #include <iostream> Dog::Dog(std::string name) { m_name = name; } void Dog::speak() { std::cout << "Woof! I'm " << m_name << "!\n" ; } void Dog::setName(std::string name) { m_name = name; }
// main.cpp #include "Dog.hpp" int main() { Dog penny; penny.setName("Penny"); penny.speak(); Dog pixel("Pixel"); pixel.speak(); Dog unnamed; unnamed.speak(); return 0; } // output Woof! I'm Penny! Woof! I'm Pixel! Woof! I'm Gremlin!
Further Reading / References
- C++ Programming: Program Design Including Data Structures 8th ed. by D.S. Malik
- C++ Classes - Microsoft Docs
- Destructors
Discussion (0) | https://practicaldev-herokuapp-com.global.ssl.fastly.net/robotspacefish/c-class-basics-4fjc | CC-MAIN-2021-49 | refinedweb | 588 | 57.37 |
Obama’s ideological war on coal unnecessary, is wasteful, costly, inept, and pure political theater.
Guest essay by Larry Hamlin
China’s energy consumption is climbing so rapidly that it’s energy use, which already exceeds ours, will be double U.S. levels by 2040 as shown from EIA data below. (1)
Furthermore the astounding growth in China’s energy consumption is dominated by coal fuel energy resources.(2)
Coal fuel use provided more two thirds of China’s 2012 total energy consumption requirements.(2)
This massive growth in both energy use consumption and coal fuel resources have driven China’s CO2 emissions to the highest level in the world and far above U.S. levels with continued large future increases expected.(3)
Obama’s EPA proposal seeks to reduce U.S. CO2 emissions by mandating reductions in our use of coal fuel in the production of electricity. But the U.S. is already in the process of reducing the use of coal fuel for the production of electricity with free market energy forces driving the increased use of natural gas with declining use of coal to meet both our present and future growing needs for electricity as shown in EIA data below. (4)
This is not the case for electricity production in China where coal fuel is used in even greater abundance than it is used in providing total energy consumption. (2) In 2012 China’s electricity from coal accounted for 76% of the countries total electricity production.(5)
While the U.S. is expected to have little increase in future coal use (see EIA Figure ES-5 above) for electricity the same cannot be said for China. China is expected to see about an 80% increase in its 2012 level of coal fuel use for electricity by 2030 as shown below from EIA data. (5)
Compare China’s huge growth in use of coal fuel above with U.S. estimated coal fuel use (absent Obama’s EPA proposed schemes) shown in the EIA data below. (5)
This increased coal fuel use by China results in its CO2 emissions climbing from 2012 levels of 8,994 million metric tons to 14,029 million metric tons in 2030 (EIA data shown below) which is an increase of 5,014 million metric tons of CO2. The Obama EPA CO2 reduction proposal amounts to a maximum reduction of about 500 million metric tons of CO2 by 2030 which is overwhelmed by the China’s increase which is 10 times larger than Obama’s EPA proposed reduction. (5), (6)
Compare China’s growth in CO2 emissions above against the U.S CO2 emissions future profile from EIA data shown below.(5)
The EPA cost assessments for the costs of complying with its CO2 reduction mandates are erroneous. The EPA assumes that by 2030 U.S. electricity growth can be reduced by more than 11% from its present rate of growth. But the EIA 2014 AEO report estimates that to achieve modest GDP growth of about 2.4% per year means that electricity growth between now and 2030 needs to increase by more than 16%. The difference between the EPA’s 11% reduction in growth by 2030 versus the EIA GDP economic growth needed increase of more than 16% amounts to tens of billions of dollars of increase costs to electricity consumers. (4),(7)
While the climate alarmist press here in the U.S. provide erroneous and misleading stories claiming that China is going to agree to emissions reduction targets in the future (8) the reality is quite different. China is struggling to continue to grow its economy and the latest intentions announced by their government are that future emissions growth will occur consistent with achieving the desired growth of their economic objectives. (9)
The monumental climate impact futility of Obama’s EPA proposal is demonstrated by estimates of so called global temperature reductions which would be achieved by complying with the EPA demands even using flawed climate model projections which grossly overestimate global temperature impacts based on atmospheric CO2 emissions.
Estimates of the global temperature “benefit” from Obama’s schemes vary between less than a hundredth of a degree by 2050 and less than 2 hundredths of a degree by 2100. (10), (11) With the reality of global CO2 emissions growing hugely between the present and 2030, despite Obama’s EPA dumb CO2 reduction schemes, as demonstrated by the material discussed above even the trivial, miniscule, pathetic and grossly overestimated global temperature “benefits” suggested are completely wiped out.
Other nations from around the world are growing in number and rebelling against the absurd climate fear political ideology that is wasting massive national resources and pushing scientifically unsupported climate alarmist claims trying to falsely impose the need for measures to clamp down on reasonable future energy use growth, use of diverse fuel resources including fossil fuels and economic growth needed to create better futures for disadvantaged peoples. Countries engaged in this growing rebellion against misguided climate fear politics include Australia, New Zealand, Canada and India. (12)
Meantime the great global temperature “pause” continues with the RSS satellite global temperature measurements showing no increases in global temperatures occurring in 17 years and 9 months.(13)
(1)
(2)
(3)
(4)
(5)®ion=0-0&cases=Reference-d041117
(6) Pages ES-6 and ES-7
(7) Pages 3-14 to 3-17
(8)
(9)
(10)
(11)
(12)
(13)
74 thoughts on “China ‘the coal monster’ fuel dominated energy use overwhelms Obama’s EPA CO2 reduction schemes”
One of the most bizarre aspects of Australian Warmism, is that its hand wringing exponents who carefully count ever gram of carbon that is emitted in Australia cheerfully ignore the millions of tonnes per annum of coal being exported to China. Their smug, sanctimonious attitudes are based entirely on either ‘denial’ or ‘hypocrisy’ got to be one or the other!
The irony, of course, is the U.S. as well will be shipping coal to both China and India to feed those new power plants there. Too funny.
Burn baby burn!!
MSM still desperate to prove China is serious about CAGW. like the last rubbish about China capping emissions, this one has not been confirmed by the Chinese Govt.
what next – capital punishment?
11 June: Reuters: China’s Shenzhen to punish firms if carbon targets not
met-media
by Kathy Chen and Stian Reklev.
(LOL) Bids and offers opened far apart, with the first trade going through in the afternoon at 60
yuan, but only for a single permit.
The government has issued 33 million permits for 2014, according to the
exchange.
***this is obviously
I was pretty surprised to hear that the USA aims to reduce CO2 emissions from existing power stations by 30%. What does that mean? Close down 30% of existing stations? Run stations at 70% of nameplate capacity? Or carbon capture and storage? CCS converts power production plants into power consumption plants. For coal about 25% more energy is required for the capture, compression, and sequestration of CO2. But at least in the USA you will probably use the CO2 in enhanced oil recovery (EOR). Capital cost of a CCS station is about double the normal. It increases the demand for coal.
Germany is building 12 new coal fired power stations and is in process of abandoning Energiewende. In the UK we took the wrecking ball to about 12 coal fired power stations this past 24 months for loss of about 12 GW generating capacity, preferring to be dependent upon Qatari and Russian gas.
Carbon Capture and Storage and 1984
Why does the concept of CCS exist?
Those who like my charts for China can find a similar set for the USA here and a list of links at the end of that article for several other countries including Germany, the UK, Egypt, Turkey, Nigeria, Russia etc.
America energy independence
Charles Nelson says:
June 12, 2014 at 12:09 am
There are those in Australia who want the Chinese burned Australian coal to be attributed to Australia.
The possessive singular of country is country’s. Countries is the plural of country.
lol
Is the EPA going to declare war on China or threaten to fine them? I don’t think so.
As Charles mentioned in the first response, a vast amount of Australian coal is sold to China & our country benefits immensely, being able to support a wide range of age, unemployment and disability pensions as well as programs for indigenous advancement, green initiatives and universal education and health care.
The opposition to this is very loud from the green and environmental groups but they have no guilty conscience at putting their hand out, wanting to say more than their fair share in any conversation and refusing to recognize that their own existence is just as valid as that that of every other person on the planet.
The logical conclusion, for the sake of Mother Gaia, is that saturation bombing of China should commence immediately.
After all, it’s a crisis and isn’t doing something better than doing nothing?
Redistributionist take note: you don’t “spread the wealth (energy)” the folks will make and spread it around themselves. For the Sophomoric Reasoning genuis of the Left and Greens, they’re simply making the pie larger and not making more slivers.
One note about India. Their recent elections put very pro-capitalist (MSM “conservative”, “right-wing”) in office. If they only slightly implement what they propsoed, India’s expansion of energy will be as dramatic as China. China and India recognize energy is life and plentiful, cheap energy is prosperity. Unlike the Sophomoric Reasoning of the Left and Greens, they also know if the pie isn’t made larger, redistribution will only result in equal shares of misery. And when they make the pie large enough, they’ll begin implementing some of the greenie stuff. China is using what some have labled “capitalist-totalitarian”; we’ll know in a few months the direction India chooses.?
Having read current federal officials at the US Department of ED stating that China is in the ascension and the US in decline like it was no big deal, I do not think harming of the US via policy troubles our public class in the least. Plus CO2 moderation is the excuse for Regional Equity which takes the prosperity where it exists still and transfers funds to the Blue States and inner cities.
Called Metropolitanism now, the Low Carbon push is actually a means of fostering racial justice in the US as former federal officials like Van Jones have openly stated. It ensures “that people of color have equal access to jobs, schools, and housing throughout metropolitan regions.” The Obama Administration calls these areas Promise Zones and it is a major and increasing priority.
So when these CO2 policies seem to make no sense in light of costs and a Middle East in turmoil and the lack of factual support for the models, there is always the cui bono analysis to keep in mind. Especially since the policymakers have so openly proclaimed this as their rationale. I have sat in the audience and gasped at times at the forthrightness.
With all that growth in global CO2 emissions atmospheric CO2 levels do show any growth change associated with China’s output, it does not matter what rate our emissions are, atmospheric CO2 levels keep growing based on other factors.
The second essay in as many days on this subject, and once again not a single mention of the key concept surrounding emissions reductions: total cumulative emissions. The United States and its 300 million people have put 1.5 to 2 times more greenhouse gas in the atmosphere than the 1.3 billion Chinese have up to now. Even with increasing Chinese emissions and flat to declining U.S. emissions, the Chinese won’t match the U.S. in total cumulative emissions until about 2030 on a nation-to-nation level, and likely never will on a per capita level.
That is why the developing world asks that developed nations which are responsible for the majority of excess greenhouse gas currently in the atmosphere (a situation that will remain for some time yet) need to take the lead right now in emissions reductions.
Looking only at annual emissions numbers ignores all this.
Leo Geiger:
Your post at June 12, 2014 at 5:07 am says
Your post rightly says this is “The second essay in as many days on this subject” but every other thing in your post is wrong.
“Cumulative emissions” are NOT the “key concept surrounding emissions reductions”. You made that assertion on WUWT yesterday hereand I refuted it here saying
Repetition does not convert untrue assertions into reality. Your assertions were refuted yesterday and you have not answered the refutation.
Richard
M Simon says:
June 12, 2014 at 4:13 am
?”
___________________________
“I’ve been to one world’s fair, a picnic and a rodeo and that’s the stupidest thing I ever heard…”
–Slim Pickens, as: Maj. T.J. (King) Kong- “Dr. Strangelove”
ok, why wait any longer- i’ll just dive right into pre-traumatic stress syndrome- beat the rush, right?
because in any hurry, see- so please don’t try to worry me-
i suffer from catastrophe fatigue in a very big way.
so wake me when it’s over and done.
when it’s time for doing something new and fun.
a second coming’s nothing but another rerun
i’d like to give a fuck but i don’t have a free one-
so wake me when it’s over and the parasites are gone!
wake me when it’s over and done!
I have no idea who came up with these projections for future Chinese power sources, but they are pure BS with respect to nuclear, for certain, and therefore highy questionable for everything else.
The chart , which ends in 2012, doesn’t show any Chinese nuclear, nor does the text even mention same. That’s pretty strange, since just in the past 3 months the Chinese have completed and connected 3 nuclear plants to the grid, and are currently building 37 nuclear plants, all of which will go online within the next several years. And that’s far from the last- Chinese plans are for 600 nuclear plants by midcentury and 1600 by the end of the century. They will easily surpass U.S. nuclear capacity within the next decade. Recently China notified Westinghouse that they will shortly order an additional 25 AP1000 nuclear plants, to follow the 4 AP1000 plants they currently have under construcion. China can build, all by herself, nuclear power plants equal to our best technology – for example their CAP1000 and CAP1400, variants and extensions of the Westinghouse-Toshiba AP1000. They are also far advanced in their testing of fast reactors. The Chinese do NOT like burning coal and will be building facilities to allow importation of LPG to replace coal.
I have no idea who created these estimates of future Chinese power sources, or how dated they are, but everything I’ve read about Chinese energy programs tells me they cannot be taken seriously.
Lucky for us man-made CO2 has not changed the relationship between temperature and the AMO by any discernible amount.
The bad news is that negative AMO is very, very close.
Damages for cumulative emissions are a weakness in the negotiating position of the developed nations, which China intends to exploit to its advantage.”
US EPA is overdue in releasing the NAAQS required under the CAA as a result of its 2009 Endangerment Finding regarding CO2. EPA could satisfy the President, his Secretary of State, his Science Adviser, Joe Romm, Bill McKibben, etc. by setting the NAAQS at 350 ppmv and then retreating to its secret bunker and monitoring the “fun”.
ferdberple @ June 12, 2014 at 5:57 am,
I can hardly wait to review the official definition of an “extreme climate event” and the criteria for establishing that such “extreme climate event” was caused by AGW. The poor countries are demanding compensation now for “loss and damage” which exist only in the “modeled” future. They have no apparent interest the “gain and enhancement” which has resulted from the past actions of the developed nations. Interesting worldview.
@Leo Geiger: So, (1) “total CUMULATIVE emissions and (2) “per capita” emissions are your important points. Sigh, so many things to say about that but I’ll make it short. First, let me sum up your message:
(1) Cumulative Emissions: Guilt should govern our future actions. We must pay for past “sins”. A very common theme in current politics. Also known as LIBERAL GUILT. In what way does punishing people of today for past events in any area help anything going forward? How did Hillary put it? Something like “what difference does it make now”?
(2) Per capita Emissions: More guilt…. of course. However, having lived and worked in 3rd world countries, I can simply tell you that a day doesn’t go by that I’m not thankful I live in a 1st world country. And again, In what way does stigmatizing and penalizing people who live well help those who don’t? elsewhere, nuclear fission is not a candidate for future power.
See full article at.
Roger Sowell says:
June 12, 2014 at 7:00 am
And not only that. If we turn to renewables now prices will go way up reducing demand. And we will still need to burn fuels to keep the grid powered. But hey. Maybe an intermittent grid is another positive feature.
I’m sure Obama would be VERY receptive to such a scheme.
Pamela Gray says:
June 12, 2014 at 7:08 am!
_________________________
China doesn’t make pencils. They make non- working facsimiles of pencils, just like so many of their other products that aren’t what they pretend to be. I bought a cheap Chinese hammer about 20 years ago. The hammer head shattered on first impact with a nail. It was made of cast iron. It was only a facsimile of a hammer.
M Simon says:
June 12, 2014 at 7:37 am.
_____________________________
If that site has a fair bit of traffic, then you may have had some number of true believers who agreed with you.
Ed Reid says:
June 12, 2014 at 6:21 am
You have to look at who gets the money. With development the money goes to developers. With transfer payment it goes to….
Thankfully China is becoming a modern responsible nation that knows how to safely dispose of all that fly ash from the coal.
Hey, did they ever tell us why those plastics from China, from Christmas tree lights to kids toys, had those high mercury concentrations?
Have they figured out yet why the pets were sickened and killed from Chinese-made animal food and treats?
Huh, I have an old can of cat food here, “ASH (MAX.) 2,7%”. Is that supposed to “bone ash”, added for the minerals?
If the technologies still need a subsidy to advance so they can stand alone and provide electricity at reasonable rates, then prudence dictates the subsidies be made.
A little economics lesson for you Roger, if the subsidies are big enough they are a drag on the economy. If they are really big they can crash the economy.
So what level do you propose?
R&D – minor
Major roll out – a big drag
Total replacement – crash
And BTW Roger – resource estimates are based on current prices and current technology.
Remember in 2000 when the US was running out of oil and natural gas? Today we produce more oil than the Saudis. Given the resource estimates from 2000 how is that possible?
After posting my info about China’s considerable nuclear prowess I was informed of a landmark
event – China First Heavy Industries has, on June 8th, successfully tested the first locally produced Westinghouse AP1000 nuclear reactor pressure vessel, the most critical component of a nuclear power plant, just one month after having successfully tested the first locally produced steam power generator, the second most important component of a nuclear plant. This was all done under supervision of Westinghouse and are milestones in China’s program that
purchased nuclear technology from Westinghouse, and aims to produce not only Westinghouse
AP1000 power plants, but their own designed variants, designated as CAP1000 and CAP1400
(Chinese AP1000s, etc) both Gen 3+ designs, the most advanced in the world.
Leo Geiger says:
June 12, 2014 at 5:07 am
I keep wondering about this because that pesky, CO2-sniffing Ibuki satellite launched by JAXA back in early 2009 seems to show that the northern industrialized countries of N. America & Eurasia (excluding China) are net sinks of CO2 during the summer months, i.e. absorption of CO2 in these regions exceeds emissions.
On the public release of carbon dioxide flux estimates based on the observational data by the Greenhouse gases Observing SATellite “IBUKI” (GOSAT)
I assume the downtake is due to intensive agriculture in these regions, but also because the people of wealthy nations like to surround themselves with greenery. Beyond that, the generally fertile soils of the continental mid-high latitudes are in well-drained areas blessed with regular precipitation for the most part, and lush summer vegetation is the rule.
Lush summer vegetation wants all the CO2 it can get.
Cheefio: The 3rd World Owes…
Yes, and as an aside in looking at various graphics/maps from Ibuki, none I’ve found show CO2 as “well-mixed” in any way.
In the final analysis, we shouldn’t expect that numbers would add up because the Great Global Warming Swindle has been a scam from the get-go. Now the poor nations have legal leverage to penalize their wealthy counterparts for cumulative damage due to climate change, but the Ibuki data seem to contradict the very core of their argument.
No, poor people don’t suffer from lack of plumbing, heat and light – they suffer from climate change.
We know it’s a crock; now we’ve got clear, graphic proof of that in the Ibuki data, which you many notice are not being widely publicized. See for example Wiki, which describes the satellite, but omits any mention of its results.
The Great Global Warming Swindle:
Roger Sowell says:
June 12, 2014 7:00 am
“As I have stated elsewhere, nuclear fission is not a candidate for future power due to resource limitations, outrageous cost, and serious safety concerns.”
******
Roger, you obviously haven’t spent any time looking at or studying 4th generation nuclear power technology such as the Liquid Fluoride Thorium Reactor (LFTR) or the IFR/PRISM reactor. If you bothered to do so, you would understand that these technologies largely succeed at addressing the concerns we have regarding today’s nuclear technology. The only reason we do not see them in commercial use today is because the federal government stupidly pulled the plug on the development of these technologies decades ago for political reasons having nothing to do with flaws in the technologies themselves.
You remind me of someone who drives around in an old clunker of an automobile that is always breaking down on him because it is so old and in such poor shape. He doesn’t bother looking at and considering all the new and better cars on the market because he has already concluded that the automobile is a lousy way of getting around based on his experience with the car he currently owns. Very ignorant and narrow-minded.
LFTR and PRISM are both capable of burning up the plutonium by-products of today’s reactors as nuclear fuel. LFTR is powered by thorium which is far more plentiful on Earth than uranium and is said to be the most energy dense substance on Earth. There is reported to be enough of it to provide our energy needs in a LFTR for perhaps a millennium or more. And, if you bothered studying it, you would find that LFTR is safe and significantly less costly to build due to its basic design. It is never to late to pick up where we left off with the development of it decades ago. And, speaking of China, they are doing just that themselves with LFTR.
I could ramble on here by explaining how wrong you are about wind and solar, but others here will probably do that for me. Suffice it to say that wind and solar are extremely inefficient sources to tap into for electrical energy because they require such massive amounts of resources, not the least of which is land.
I for one grow increasingly tired of rebutting people like you with your green propagandizing. Please stay away from WUWT and go elsewhere with your bunk.
from the comments:
The costs of renewables bring dysfunctional to society. What to me is intriguing is that the confraternity of renewables Baptists and bootleggers is engaged in the classic definition of bunco: a swindle in which unsuspecting people are cheated, with the perpetrators promising much, delivering nothing–and making off with the unsuspecting people’s loot.
The situation is almost the perfect piracy.
David in Michigan says:“In what way does punishing people of today for past events in any area help anything going forward?”
You are confusing “guilt” with the concepts of fairness, responsibility, and leadership. Food for thought:
Or in simpler language:
On behalf of our groups and organizations, together representing millions of Americans, we write to express our strong opposition to renewing expired wind tax incentives.
“Over the past 20 years, American taxpayers have seen little return from the forced investment in wind energy. This handout consistently fails to deliver on its promise of long-term job creation, economic activity, and affordability. It promotes government favoritism in the energy marketplace, threatens the reliability of the electric grid, and a 1 year extension costs $12 billion over 10 years. Recent reports and studies have also shown that subsidizing wind energy results in higher electricity costs for American families.
“American taxpayers deserve a portfolio of energy solutions that are economically viable, not those that have to be propped up by carve outs in the tax code.”
Leo Geiger says:
June 12, 2014 at 8:21 am
It is not anyone’s fault but the Chinese that they handicapped themselves with a dysfunctional economic system. If they want fairness let them correct their errors and revive the 10s of millions Mao offed. Well that last part is going to be difficult. Correcting the errors of central planning should be easier. If they can give up the habit.
But tell you what Leo. Make the responsible pay. The Communists.
Had the post WW2 Chinese aligned themselves with the West as the South Koreans and Taiwanese Chinese did, their economy would be operating at a similar level today.
Roger,…
That’s not so. Yesterday I followed your post, quoted in part below, . . .
. . . with my response, at.
@Pamela Gray. In a few years you will be able to buy a 3D printer and make your own pencils with the lead centered or off-centered as much as you wish. Then the Chinese will start supplying 3D printers and the world will slowly fall apart.
From Roger Sowell on June 12, 2014 at 7:00 am:
Yes you have, numerous times, with dodgy numbers used by anti-nuke agitators that shrivel when exposed to factual truth. Which basically comes down to them using the worst-sounding estimates based on 1970’s and earlier reactor tech, to condemn modern efficient inherently-safe designs, while getting “risk assessments” from alarmists using the Linear No-Threshold model to predict death and illness down to exposure levels well under normal background amounts, even though The Linear No-Threshold Relationship Is Inconsistent with Radiation Biologic and Experimental Data.
While I could again badger you with reality until you drift away flustered and sputtering, I shall currently decline.
Now if you’re ready to write off your failing investments in windmills and sunbeam catchers and move on, PPL Corporation, an electric utility company that was originally just in PA but now has holdings even in Great Britain where they have 7.8 million customers after acquiring Central Networks, is getting out of electricity generation. The plans are to spin off their generating capacity and merge with that of Riverstone Holdings, forming Talen Energy Corporation.
This is an important signal of the growing specialization of the market. Electricity providers are increasingly tied to the quixotic whims of government administrations, seemingly overnight a source may be forced out by fiat. With major generating projects planned for a decade, this severely discourages investment.
But PPL excels as a distributing company. So the fiscally vulnerable generating parts are cleaved off. PPL will then buy off the open market whatever electricity there is, generated by whatever source, for whatever is the going price, then tack on their profitable charges and send the customers the bill. Sensible business model for this regulatory climate.
They’re PPL on the NYSE, also a S&P 500 component. Currently trending down on the news, about $33.35. Motley Fool has up 3 Reasons PPL’s Spinoff Is Dynamite for Your Dividend.
Buy now, hold long.
which (industrial complex) has the record for the max single point emission of CO2 in the last twenty years?
fwiw – they pay a grand dividend. and property prices in the ‘town’ far outstrips the rest of the country…
their next factory may well be in your area…
Alan Robertson says:
June 12, 2014 at 8:59 am.
*************
Alan, you are obviously one of those daft persons to whom I have to unfortunately repeat myself before something finally (and hopefully) sinks in, if it ever does.
The only reason LFTR is likely not in commercial use today is because the federal government failed to follow through and complete the development of the technology. Alvin Weinberg was one of our top nuclear people at the time and was in charge of the project at ORNL. He had high hopes for it back in the 1970s as a safe alternative, but politics got in the way and it was terminated for POLITICAL reasons.
China is developing LFTR today because they see the same potential for it as Weinberg and his people did back in the day. It is very upsetting to see China one upping us and doing something today that we should have completed decades ago. Some of us in this country see that, and it is sad that more of us don’t.
and it is not Norilsk –
which is the 2nd biggest complex I ever saw…
Steve from Rockwood said on June 12, 2014 at 9:11 am:
But a REAL pencil has that scratchy graphite, that chips and crushes to a powder and be shaped to a tiny sharp point. Those 3D printers extrude plastic. I have used “pencils” where the “wood” is plastic, and the lead is plastic that feels like and slides over the paper like soapstone. 3D printers cannot make the same thing.
Also we are already to where they could make a tabletop printer for $100 that’s big enough for a custom cell phone case, if people wouldn’t mind paying $100 for a cartridge holding 2.75oz of material, for each color they want. Almost as much fun as inkjet printers.
For CD and the other nuclear apologists,
If you knew the truth about nuclear power, you would change your stance.
Advanced civilizations are predicated on abundant cheap energy, without this abundant cheap energy you are or will be a back water inconsequential nation. China and India will set the standard as to what it means to be civilized if North America doesn’t get it head out of its AGW derrière..
p.s. The future is nuclear energy, and lots of it.
[Leo Geiger:]
You have again ignored my refutation of your assertions which you first posted yesterday on another thread and repeated on this thread at June 12, 2014 at 5:07 am.
My refutation in this thread is at June 12, 2014 at 5:29 am here.
I have repeatedly told you
This is because any AGW from now would results from emissions made now and in the future (the so-called ‘pause’ in global warming demonstrates there is no discernible ‘committed warming’). Hence, the “key concept surrounding emissions reductions” is the assertion that it is possible to reduce future emission.
Having no answer to that reality, at June 12, 2014 at 8:21 am you here switch your assertion to
.
But that is blatant nonsense because the increases to atmospheric CO2 since the industrial revolution have been purely beneficial (it is future increases which it is claimed will have ill effects in future). These benefits include higher crop yields.
You are asserting that
(a) The industrialised countries have responsibility for the increase to atmospheric CO2 since the industrial revolution
and
(b) compensation for effects of that increase should be awarded
then
(c) in fairness the developing world should PAY the compensation for the benefits they have obtained
and
(d) the industrialised countries would display leadership by demanding they obtain the compensation at very least for having provided higher crop yields.
Personally, I think the entire concept of ‘compensation for climate change’ is daft.
Richard
Ouch!
My post was intended to be addressed to Leo Geiger and not myself. [Sorry.]
Richard
2011 February 16
Comment: The experts the Grauniad trusts think thorium is better for solving the devastating climate change problem. What a sterling endorsement.
2012 October 30
2014 March 18
Comment: Got that? In 2012 they pushed the completion dates for test reactors to 2017 and 2020. But in 2014, only about 18 months later, they announce they originally had 25 years to develop, but it’s shortened to 10, they’ll have reactors by 2024, which is 4 and 7 years later than the delayed dates, but is a Great Leap Forward as this is 15 years sooner than their government now says was their previous deadline.
I do not think China’s progress on developing practical thorium reactors, molten salt or pebble bed, is going as well as thorium’s cheerleaders would have us believe.
kadaka (KD Knoebel) says:
June 12, 2014 at 11:07 am
I do not think China’s progress on developing practical thorium reactors, molten salt or pebble bed, is going as well as thorium’s cheerleaders would have us believe.
______________________________
Welcome to the “daft” club, (thanks to CD (@CD153) @June 12, 2014 at 9:34 am.)
As long as we’re hanging our hats on vaporware, why not go all the way?
Roger Sowell says:
June 12, 2014 at 10:16 am
For CD and the other nuclear apologists,
If you knew the truth about nuclear power, you would change your stance.
*******************
Excuse me Roger, but did I say one thing in defense of TODAY’S nuclear power technology in my first post? Not that I recall. You are making a seriously faulty assumption here….and you know what you do when you assume, don’t you Roger? I will try to explain something to you here even though I doubt that it will do any good.
Ever wonder why we don’t all still drive around in Model T Fords today Roger? Because when we humans invent something, we don’t rest on our laurels and just leave it as it is. We continually strive to make it better, to improve on it in ever way we can. That applies to all technologies we invent, including nuclear.
Your mindset with regard to nuclear power assumes (there’s that word again!) that there is nothing out there better than today’s LWR nuclear technology, and that the problems with today’s reactor technology apply across the board to all future human nuclear power endeavors. You seem to be assuming that we humans, in our efforts to improve on the technologies we invent, somehow, in some way are not able to or interested in correcting or at least mitigating the issues we have with today’s nuclear technology.
Roger, LFTR is NOT light water reactor technology and is a significant departure from it. Do yourself a HUGE favor and read up on it:.
Alan Robertson & KD Knoebel:
Do either of you two really expect major new technologies to be developed without delays or bumps in the road along the way? You two are living in a dream world if you think that will never happen. Do you know how many different kinds of material Thomas Edison tried before he found a practical filament for the electric light bulb?
The materials, equipment and technical knowhow the Chinese have at their disposal may or may not be up to the standards or level of ORNL here in the U.S., and I can’t say what kind of problems, if any, they are having. What I can tell you is that Alvin Weinberg and his colleagues at the Oak Ridge National Labs in Tennessee demonstrated the practicality of the molten salt reactor with the MSR experiment they conducted at ORNL back in the 1960s. Weinberg would not have wanted to continue the project if he didn’t feel it had potential.
Alan Robertson: There is a big difference between the warp drive dreams that NASA engineers have in their heads and what has been shown to be practical at ORNL. This is not to say that warp drive won’t happen someday. Maybe it will, and maybe it won’t. Ever hear the old saying about not putting all of your eggs in one basket? That is why LFTR should not be abandoned.
One sure path to failure is having a skeptical or pessimistic mindset like that of the two of you.
CD (@CD153) says:
June 12, 2014 at 12:45 pm
“You two are living in a dream world if you think that…”
______________________
As long as you keep making statements like that and “daft”, I’m gonna keep pokin you in the eye with a stick.
VAPORWARE
Alan Robertson says:
June 12, 2014 at 12:56 pm
Okay Alan. I apologize for calling you daft and for the dream world statement. They were uncalled for. However, I’m believe I’m justified in saying that is impractical to abandon and give up on a major, new developing technology simply because it may be experiencing bumps in the road along the way (as LFTR may or may not be in China). I see nothing wrong with that.
Exactly, the U.S. is increasingly irrelevant. China is the big dog now!
To CD and any other thorium enthusiasts:
If you knew the truth about thorium molten salt reactors, you would not be at all hopeful at their prospects.
I will write an article on thorium quite soon now in TANP series. It will be article 28 in the series. 20 articles are published at this time.
Grammar:
Not
‘China’s energy consumption is climbing so rapidly that it’s energy use …’
but
‘China’s energy consumption is climbing so rapidly that its energy use …’
richardscourtney says: Repetition does not convert untrue assertions into reality.
That’s the only thing we are going to agree on. I won’t waste my time or yours on anything else.
CD (@CD153) says:
June 12, 2014 at 12:45 pm
The LFTR experiments you mention were shut down and never restarted because of corrosion problems. Now maybe we can fix that. Maybe we can’t but they are a HUGE stumbling block.
M. Simon – Naval Nuke in another life.
======================================
I’m not a real big fan of nukes (except for Naval Military uses). But I’m not as pessimistic as RS. But there is no need to rush. We have at least 500 years of coal left. Probably 100 yrs of nat gas. There is time.
========================================
AE has two problems
1. Capacity factor
2. Storage
Based on #1 grid parity is on the order of 1/3 to 1/6th the $/watt of a coal plant. Based on #1 and #2 the total cost for AE + batteries has to come in at around 1/2 to 1/4 the $/watt of a coal burner. We are no where near that. Not even close.
Leo Geiger:
Your post at June 12, 2014 at 3:27 pm says in total
Actually, I would be very interested in an explanation from you and, therefore, it would not waste my time.
If you agree that “Repetition does not convert untrue assertions into reality” then I would like to know why you repeated your untrue assertions then changed your assertions when your repeated untrue assertions were again refuted.
In other words, I would welcome an answers from you to my post at June 12, 2014 at 5:29 am which is here and especially to my post at June 12, 2014 at 11:02 am which is here.
Thanking you in anticipation
Richard
What is the solution?
Simple. Stop exporting coal to China and use it at home to manufacture output and heat our homes for next to nothing. If China want our coal then they should pay a lot more for it and if they want to sell us their output then we should be getting a better price.
For as long as there is a single young man in our nation who wants work but is unemployed we should not be exporting energy and importing goods. Instead we should train him to use the energy to create goods for export and domestic use.
The status quo makes no sense apart from to those who currently profit from the status quo. They have found themselves in a position to make great profit by creating a “Fire Sale” of our resources.
CD (@CD153) says:
June 12, 2014 at 12:45 pm
“Do you know how many different kinds of material Thomas Edison tried …”
A rhetorical question but a useful takeoff point:
Not only is a major new technology not likely to arrive like in the plot device Deus ex machina but such would have to be built in quantity requiring land and resources, workers, financing, lawyers, and NIMBY court cases.
Edison’s team and others (Batchelor of G.B.) tested many hundreds to thousands and Thomas is credited with saying they learned something from every one. An important issue is that it was not just the filament that was invented but an entire system of parts, such as switches, meters, wiring. The “quick break” switch (J. H. Holmes) is an important innovation. Any new energy system will have a long invention, development, and build-out period. Those past current retirement age are not going to live long enough to witness significant changes in the world-wide supply mix.
Little frustrating to read comments about Australian and US exports to China and not allowing it or counting the CO2 emmissions against the source country etc.
Please please check out the numbers – World Coal Assoc. or IEA
For 2012 China produced 3549 Mt, USA 935 Mt and Aus 421 Mt
Coal exports- Indonesia 383 Mt (mainly thermal), Aus 301 Mt(50:50 thermal:coking) and USA 114 Mt (50:50 thermal:coking)
Coal Imports- China 289 Mt, Japan 184 Mt , India 160 Mt even Germany and the UK import around 45 Mt each
China imports < 10% of what it produces so it is not reliant on imports. They have huge resources/reserves and currently import as it is cheaper to do so
David in Michigan says:
June 12, 2014 at 6:22 am
=============================
Me three. Agree 100% with your comments. I have woken up in an african hut with brown sludge on my cheek cause it was up against the wall – made of sticks and manure. Coming home, I had to wash everything twice to get the smell of charcoal out of my clothes as it permeates everything. Life span is 55 years or less, income in those days was less than $2 a day in the city and for those in the country side, subsistence living.
On another thread:
========================
Oatley says:
June 13, 2014 at 6:08 pm…
========================
Couldn’t agree more. This discussion on CO2 is getting to be more of a straw man every day. What is really important?
Roger Sowell says:
June 12, 2014 at 7:00 am
++++++++++++++++++++++++++++++++
Your reference to a 2011 coal reserve of about 500 billion ton tons and a 60 year supply is out by at least half. There are over 950 billion short tons available with today’s technology and prices so if we allow for new recovery and increased prices there is probably at least a couple hundred years of coal – depending on consumption rate and other energy technologies that come into play.
50% of the world coal consumption is in China, US regulations are meaningless from a global perspective.
”
According to BGR there are 1038 billion tonnes of coal reserves left, equivalent to 132 years of global coal output in 2012. ” | https://wattsupwiththat.com/2014/06/12/china-the-coal-monster-fuel-dominated-energy-use-overwhelms-obamas-epa-co2-reduction-schemes/ | CC-MAIN-2017-22 | refinedweb | 7,538 | 60.45 |
Templ8
JavaScript Client/ Server Template Engine
Templ8.js
Templ8 as you can probably guess is a JavaScript template engine, with a Django'ish style of syntax.
It's fast, light weight and unlike a lot of other JavaScript template engines: Templ8 does not use the JavaScript
with statement. This actually makes Templ8 parse templates faster than it would if it did use the
with statement!
Templ8 does not restrict you to generating HTML. All outputs are strings so if you want to generate HTML, CSS, JavaScript or whatever, the choice is yours...
#TODO:
- documentation is not yet complete
Dependencies
Templ8.js only has one dependency m8.js.
NOTE:
If you are using Templ8 within a commonjs module, you don't need to require m8 before requiring Templ8 as this is done internally and a reference to m8 is available as:
Templ8.m8.
var Templ8 = require 'Templ8'm8 = Templ8m8; // <= reference to m8// if running in a sandboxed environment remember to:m8x Object Array Boolean Function String ; // and/ or any other Types that require extending.
See m8: Extending into the future for more information on working with sandboxed modules.
Support
Tested to work with nodejs, FF4+, Safari 5+, Chrome 7+, IE9+. Should technically work in any browser that supports ecma 5 without throwing any JavaScript errors.
API
If all you want to do is swap out values you can use one of the following two smaller template functions.
<static> Templ8.format( template
:String, param1
:String[, param2
:String, ..., paramN
:String] )
:String
This function takes a minimum of two parameters. The first is the template you want perform substitutions over.
The template should use zero based tokens, e.g.
{0},
{1} ...
{N} that increment for each argument passed to the function.
e.g.
Templ8format 'Hello {0}! Nice {1} we\'re having.' 'world' 'day' ;
returns: Hello world! Nice day we're having.
<static> Templ8.gsub( template
:String, dict
:Object[, pattern
:RegExp] )
:String
gsub works similarly to format only it takes an Object with the values you want to substitute, instead of a sequence of parameters. Actually format calls gsub internally.
e.g.
Templ8gsub 'Hello {name}! Nice {time} we\'re having.' name : 'world' time : 'day' ;
returns: Hello world! Nice day we're having.
The default pattern for substitutions is
/\{([^\}]+)\}/g. However, you can supply a third argument to gsub which is your own custom pattern to use instead of the default.
If you want to do fancy stuff, you'll want to use the Templ8 constructor.
new Templ8( template
:String, options
:Object )
The Templ8 constructor actually takes an arbitrary number of String arguments which form the template body.
The last argument to the Templ8 can -- optionally -- be a configuration Object which defines any custom Filters you want to use for this Templ8 and any sub Templates it contains.
It also accepts the following four parameters (needless to say that these cannot be used as Filter names):
Templ8 instance methods
To keep it simple, a Templ8 instance only contains one method.
parse( dictionary
:Object )
:String
This method accepts one parameter: an Object of values you want to substitute and returns a String of the parsed Templ8.
Any tokens in the Templ8 that do not have a dictionary value will use the
fallback value described above,
Templ8 variables
basic global variables
$_
This is based on perl's
$_ and is a reference to the the current dictionary value being parsed.
For instance if you are in a loop, rather than access the value using
iter.current you could also access it via
$_.
e.g. instead of this:
itercurrent|parse:'sub_template' for each items
or this:
item|parse:'sub_template' for each item in items
you could do this:
$_|parse:'sub_template' for each items
iter
This is the current iterator being parsed. It is an instance of an internal class called Iter. Iter instances are created internally, when you use a
{% for %} loop or an Array Comprehension
{[ for each ]} tag you should not need to create one yourself.
It has the following properties available for both Arrays and Objects:
It also has the following two methods:
Templ8 internal variables
Along with the above Templ8 has some internal variables accessible for the more advanced user, should they require access to them.
$C:ContextStack
Templ8 does not use the JavaScript
with statement. It implements its own version of a
with statement using an internal class called ContextStack.
It has five methods (you should NOT call these if you DO NOT know what you're doing):
__OUTPUT__:String
This is where all parsed template output is stored.
__ASSERT__:Function{}
This is a reference to Templ8.Assertions.
__FILTER__:Function{}
This is a reference to Templ8.Filters.
__UTIL__:Function{}
This is a reference to the internal utility functions used by Templ8.
Tags & Statements
Tag: {{}} - Interpolation
This tag is used for interpolating dictionary values with their respective template tokens. At it simplest a tag which will be replaced by a dictionary value
foo would look something like this:
var tpl = '{{foo}}' ;tplparse foo : 'bar' ; // returns: bar
Accessing nested values
If your dictionary contains nested objects you can easily access nested values like you would in regular JavaScript.
var tpl = '{{some.nested.value}}' ;tplparse some : nested : value : 'foo' ; // returns: foo
You can also similarly access values from Array's in the same way:
var tpl = '{{some.nested.1.value}}' ;tplparse some : nested : value : 'lorem' value : 'ipsum' value : 'dolor' ; // returns: ispum
Filtering
This is all well and good, but at some point we will want to manipulate the values in our dictionary Objects in some way or another.
Templ8 provides a very simple and powerful method for doing so based on Django's pipe syntax for filtering values.
It is probably most easily illustrated with an example showing the pipe syntax converted to JavaScript. So:
value|truncate:30|bold|wrap:"(" ")"|paragraph
Would translate to something like this:
value = truncate value 30 ;value = bold value ;value = wrap value '(' ')' ;value = paragraph value ;// orparagraph wrap bold truncate value 30 '(' ')' ;
The most important thing to note is that the first value passed to the filter is always the value being parsed by the template, the arguments passed to each filter will always come after the value being parsed.
One line statements
As well as standard template conditionals, Templ8 introduces one line statements, because, hey it's JavaScript and we like to keep things concise.
If you only want to parse a value if a certain condition is met, rather than writing block if tags around it, you can include it in your interpolation tag like so:
value if value|exists
Which translates to something like this:
if exists value __OUTPUT__ += value;
Notice how you can use the same pipe syntax for conditionals. Templ8's internals work out whether your method is an assertion or a filter and reference the appropriate method.
You can also use ordinary JavaScript conditions if you want to, as well as an unless statement; and filtering is still ok too.
A more complex example would be:
value|truncate:30|bold|wrap:"(" ")"|paragraph unless value == null
Translating to something like:
if ! value == nullparagraph wrap bold truncate value 30 '(' ')' ;
Tag: {%%} - Evaluation
This tag is used in conjunction with the above tag to give you access to more powerful conditional statements, iteration and sub templates.
if/ unless/ elseif/ else/ endif/ endunless Statements
Just like regular JavaScript Templ8 features conditional statements. It also introduces the
unless statement based off Perl.
Every open
if/
unless statement must end with an
endif statement -- with any number of
elseifs in between; an optional
else is also allowed just before
endif.
The reason for the
endif statement is that Templ8 does not use braces to encapsulate block statements, so it requires a flag to let the parser know when to close a block.
Note:
elseif should be written as one word, no spaces. It can also be written as
elsif, again, based off Perl.
An example would be:
% if value == 'foo' %<h1>value|bold</h1>% elseif value == 'bar' %<h2>value|italics</h2>% else %value% endif % // note: this tag can also be written as: {% /if %}
Translating to:
if value == 'foo''<h1>' + bold value + '</h1>';else if value == 'bar''<h2>' + italics value + '</h2>';else value;
for/ forempty/ endfor Statements
The
for statement allows you to iterate over Arrays as well as Objects. There are a number of options available with the
for statement.
Just like the
if statement the
for statement must end with an
endfor statement to tell the parser that the statement block is ending.
You can also include a
forempty statement which will be used in the case where an Array/ Object is either empty or the item you are trying to iterate over is not iterable, e.g. a Number or Date.
forempty is not mandatory.
The
iter variable mentioned above is the standard way to access any and all properties you require while iterating over an Array/ Object.
You can also use
$_ to access the current value being iterated over.
However you can also assign your own variable names to the
for. e.g.
% for item in items %item% forempty %No items% endfor % // note: this tag can also be written as: {% /for %}
Will assign the current value being iterated over to the variable
item, which is accessible as demonstrated.
% for key value in items %key value% endfor %
Will assign the current value being iterated over to the variable
value. If you are iterating over an Array then the variable
key will be the zero based index of the the current item being iterated over. If you are iterating over an Object then the variable
key will be the the key name of the current item being iterted over.
If you want to limit the number of items you are iterating over you can do so by using brackets to specify the range of items to iterate over.
% for item in items 10 %item% endfor %
Will iterate over items 0 to 10, so the first 11 items in the Array/ Object.
% for item in items 510 %item% endfor %
Will iterate over items 5 to 10.
% for item in items 5 %item% endfor %
Will iterate over all items starting from the 6th item in the Array/ Object.
If you are nesting
for statements you can access the parent
iter Object by using the syntax
iter.parent this will maintain state no matter how deep you nest.
sub/ endsub templates
TODO
Tag: {[]} - Array Comprehensions
TODO
Tag: {::} - Executing Arbitrary JavaScript
TODO
Tag: {##} - Comments
TODO
Adding your own Tags and/ or Statements
TODO
Examples (by tag)
Tag: {{}}
Replacing values
var tpl = '{{value}}' ;tplparse value : 'github.com' ; // returns: *github.com*
Filtering values
var tpl = '{{value|truncate:30|bold|link:""}}' ;tplparse value : 'github.com is great for sharing your code with other people.' ;
returns the String:
github.com is great for sharin...
One line if statement
var tpl = '{{value if value|notEmpty}}' ;tplparse value : 'github.com' ; // returns: *github.com*tplparse {} ; // returns: empty String ( "" )
One line unless statement
var tpl = '{{value unless value|equals:"foo"}}' ;tplparse value : 'github.com' ; // returns: *github.com*tplparse value : 'foo' ; // returns: empty String ( "" )
Tag {%%}
conditions: if|unless/ elseif/ else/ endif
var tpl ='{% if value == "foo" || value == "bar" %}''{{value}}''{% elseif value != "lorem ipsum" %}''{{value|bold}}''{% elseif value|notEmpty %}''{{value|italics}}''{% else %}''No value''{% endif %}' // note: this tag can also be written as: {% /if %};tplparse value : 'foo' ; // returns: footplparse value : 'lorem ipsum' ; // returns: <strong>lorem ipsum</strong>tplparse value : 'dolor sit amet' ; // returns: <em>dolor sit amet</em>tplparse {} ; // returns: No Value
iterating: for/ forempty/ endfor
var tpl ='{% for item in items %}''<p>{{item}}</p>''{% forempty %}''<p><strong>No items</strong></p>''{% endfor %}' // note: this tag can also be written as: {% /if %};tplparse items : 'one' 'two' 'three' ; // returns: <p>one</p><p>two</p><p>three</p>tplparse items : "one" : 1 "two" : 2 "three" : 3 ; // returns: <p>1</p><p>2</p><p>3</p>tplparse {} ; // returns: <p><strong>No items</strong></p>tplparse items : foo ; // returns: <p><strong>No items</strong></p>
sub/ endsub templates
var tpl ='{% sub list_item %}''<li>{{$_}}</li>''{% endsub %}' // note: this tag can also be written as: {% /sub %}'<ul>{[ item|parse:"list_item" for each ( item in items ) ]}</ul>';tplparse items : 'one' 'two' 'three' ;
returns the String:
onetwothree
Tag {[]} (Array comprehensions or one line for loops)
var tpl_foo = id : 'foo' '<em>{{val}}</em>'tpl_bar = id : 'bar' '<strong>{{val}}</strong>'tpl = '{[ v|parse:k|paragraph for each ( [k,v] in items ) if ( k|isTPL ) ]}' ;tplparsefoo : val : 'foo'bar : val : 'bar'greg : val : 'not gonna happen';
returns the String:
foobar
as greg does not exist as a template (poor greg), the value is not rendered...
Tag {::}
Allows you to execute arbitrary JavaScript.
var tpl = '{: aribtrarily.executing.nasty.code.isFun(); :}' ;
Tag {##}
Allows you to add comments in your template.
var tpl = '{# doing something complex and describing it is sensible, but not probable #}' ;
File size
- Templ8.js ≅ 7.8kb (gzipped)
- Templ8.min.js ≅ 5.2kb (minzipped). | https://www.npmjs.com/package/Templ8 | CC-MAIN-2015-11 | refinedweb | 2,142 | 60.75 |
Using Hot Wires / Snap Circuits with Raspberry Pi
It's Friday!! Time for some fun!
Hot Wires / Snap Circuits are simple circuit building blocks that are used to teach electronics to small children. They use press studs, similar to those used on coats, to connect the components, which are encased in a plastic shell meaning that small hands can't easily break the components.
I've used them quite a lot at Blackpool Raspberry Jam as some of our younger children want to build rather than code.
I recently...well ok November 2016, received some of these wires...
They are called "Snap to pin" and are used to convert the press stud connection to a breadboard compatible male jumper wire.
So armed with these wires and a "spare" (LOL) hour I made a simple circuit to illustrate how they can be used with any model of the Raspberry Pi and programmed two ways. Using Scratch and Python, with GPIO Zero.
Hardware Setup
I used
- 100 Ohm resistor (R1)
- Red LED (Piece 17) Note that the Red LED already has a 100 Ohm resistor soldered to the LED, but as we are teaching the right way to make a circuit, use the additional resistor to promote best practice
- Momentary Switch (S2)
- 2 x 2 Bridge Connector
- 3 x Snap to pin connectors (Black, Red and Yellow)
- 3 x Male to Female Jumper wires
- Any model of Raspberry Pi, I used a Zero W
- The usual accessories to control your Pi
Values in () are the Hot Wires part number.
So for the red, black and yellow snap to pin wires, you can see in the picture that they are connected to the Hot Wires pieces and then connected to a breadboard.
I then used the male to female jumper wires to connect the breadboard, and in turn the Hot Wires components to the GPIO of the Raspberry Pi. Note that I maintained colour coding for easy reference...and because I am a little OCD about that.
For reference
So our Red wire connect the Red LED to GPIO 17 on our Raspberry Pi via a resistor.
The Yellow wire connect one side of the momentary switch / button to GPIO 27.
The black wire is connected to any Ground pin on the Raspberry Pi and to the Ground pin (Cathode) of our LED and to the other side of our momentary switch.
Here is a quick diagram that shows the position of the pins. Pin 1 is the pin nearest your SD card on every model of Pi.
The awesome pinout.xyz from Gadgetoid!
So with the hardware built, power up your Pi and open Scratch!
Scratch
The basics of this project are based upon this worksheet from the Raspberry Pi Foundation
For our project we need to write the following code.
- We start by using a When Green Flag Clicked block from Control.
- Then we create three broadcasts, you can find this block in Control but you will need to create the text inside the block for each broadcast. Our first broadcast will turn on the server that enables Scratch to talk to the GPIO. The second and third configure pins 17 and 27 to be an output (for our LED) and an input (for the momentary switch)
- Now click on the Green Flag, located in the top right of the screen, this will enable the GPIO server and setup our GPIO pins. Then press the red stop button, also in the top right.
- Still in the Control palette we drag the Forever block over and place it under the broadcasts.
- We now need an If..Else block from Control, place it inside the loop.
- Now grab a __ = __ from Operators and place it in the space next to If.
- Go to Sensing palette and look for Sensor Value, left click on its drop down and you should see gpio27, this is our momentary switch. Change the sensor value block so that it reads gpio27 sensor value then drag it into the first space of our __ = __ block.
- In the second space type in the number 0. Now this block will compare the value that our momentary switch reports against the number 0. In other words when the switch is pressed its value changes from 1 (on) to 0 (off).
- If the button is pressed we turn gpio17on using another broadcast (Control palette).
- We also use turn from Movement to turn the cat sprite on our screen.
- Next we use wait from the Control palette to slow the rate that our cat spins at.
- We now move to our code for else and here we use a broadcast to turn off the LED gpio17off
So that's the code. Click on the green flag to run and watch your LED come to life and spin the cat!
Python 3 GPIO Zero
I also created a sample script in Python 3 using Ben Nuttall's great GPIO Zero library
The wiring is exactly the same as Scratch.
Here is all of the code. I edited and ran the code using Python 3 editor, found in the Programming menu.
from gpiozero import LED, Button from time import sleep led = LED(17) button = Button(27) while True: if button.is_pressed: print("LED Activated") led.on() sleep(0.1) else: print("LED Deactivated") led.off() sleep(0.1)
Essentially it works by using a loop and a conditional test. If the button is pressed, then the LED is turned on and we print something to the Python shell for debugging. If the button is not pressed then the LED is turned off and again we print to the Python shell.
Conclusion
Hot Wires / Snap Circuits and Raspberry Pi are a wonderful way to hack electronics projects to life, no matter how old the person may be.
Using a magnet to control a reed switch that turns on an LED.
| http://bigl.es/using-hot-wires-snap-circuits-with-raspberry-pi/ | CC-MAIN-2018-26 | refinedweb | 985 | 78.38 |
My friend Dave Clements is always game for a brainstorming session—especially if I'm buying the coffee. We met at the usual place and I explained my problem to him over the first cup: We had a bunch of Linux nodes sitting idle and we had a stack of work lined up for them, but we had no way to distribute the work to them. And the deadline for completion loomed over us. Over the second cup, I related how I had evaluated several packages such as Open Mosix [0] and Sun's Grid Engine [1], but had ultimately decided against them. It all came down to this: I wanted something leaner than everything I'd seen, something fast and easy, not a giant software system that would take weeks of work to install and configure.
After the third cup of coffee, we had it: Why not simply create an NFS [2] mounted priority queue and let nodes pull jobs from it as fast as they could? No scheduler. No process migration. No central controller. No kernel mods. Just a collection of compute nodes working as quickly as possible to complete a list of tasks. But there was one big question: Was concurrently accessing an NFS-mounted queue possible to do safely? Armed with my favorite development tools (a brilliant IDE named vim [3] and the Ruby programming language [4]), I aimed to find out.
I work for the National Geophysical Data Center's (NGDC) [5] Solar-Terrestrial Physics Division (STP) [6] in the Defense Meteorological Satellite Program (DMSP) group [7]. My boss, Chris Elvidge, and the other scientists of our group study the nighttime lights of earth from space. The data we receive helps researchers understand changes in human population and the movement of forest fires, among other things. The infrastructure required to do this sort of work is astounding. This image:
showing the average intensity of nighttime lights over part of North America, required over 100 gigabytes of input data and 142 terabytes of intermediate files to produce. Over 50000 separate processes spread across 18 compute nodes and a week of wall clock time went into its production.
Linux clusters have become the new super computers. The economics of teraflop performance built on commodity hardware is impossible to ignore in the current climate of dwindling research funding. However, one critical aspect of cluster-building, namely orchestration, is frequently overlooked by the people doing the buying. The problem facing a developer with clustered systems is analogous to the one facing a home buyer who can only afford a lot and some bricks: He's got a lot of building to do.
Yukihiro Matsumoto, a.k.a like this.
The first task was to work out the issues with concurrent access to NFS shared storage, and the first bridge I had to cross was how to accomplish NFS-safe locking from within Ruby. Ruby has an fcntl(2) interface similar to Perl's and, just(2), always is. One of things that's really impressive about Ruby is that the code for the interpreter itself is very readable. The source includes array.c, hash.c, and object.c—files that even I can make some sense of. In fact, I was able to steal about ninety eight percent of the above code from Ruby's File.flock implementation defined in file.c.
Along with posixlock.c I needed to write an extconf.rb (extension configure) file which Ruby auto-magically turns into a Makefile. Here is the complete extconf.rb file used for the posixlock extension:
require 'mkmf' and create_makefile 'posixlock'
Usage of the extension mirrors Ruby's own File.flock call," will show it being concurrently accessed in a safe fashion. Notice the lack of error checking—Ruby is an exception-based language, any method which does not succeed will raise an error and a detailed stack trace will be printed on standard error.
One of the things to note about this extension is that I was able to actually to extend Ruby but that you can. And it is not difficult.
Having resolved my locking dilemma, the next design choice I had to make was what format to store the queue in. Ruby has the ability to serialize any object to disk and also includes a transactions-based file-backed object storage class, PStore, which I have used successfully as a 'mini database' for many cgi programs. I began by implementing a wrapper on this class that used the posixlock module to ensure NFS safe transactions and which supported methods like "insert_job", "delete_job", and "find_job." Right away I started feeling like I was writing a little database.
Not being one to reinvent the wheel (or at least not too often!) I decided to utilize the SQLite [8] embedded database and the excellent Ruby bindings for it written by Jamis Buck [9] as a storage back end. very readable code like:
ssn = tuple['ssn']
and yet are unable to write natural code like
sql = "insert into jobs values ( #{ tuple.join ',' } )"
or
primary_key, rest = tuple
While with an array representation you end up with undecipherable code like:
field = tuple[7]
Now, what was field "7" again?
When I first started using the SQLite binding for Ruby, all it's tuples were returned as hashes and I had a lot of slightly-verbose code converting tuples from hash to array and back again. Anyone who's spent much time working with Ruby will tell you that its elegance inspires you to make your own code more elegant. All this converting was not only inelegant, but inefficient. What I wanted was a tuple class that was an array, but one that allowed keyword field access for readability and elegance.
For Ruby this was no problem. I wrote a pure Ruby module, ArrayFields, that allowed any array to do exactly this. In Ruby a module is not only a namespace but can be "mixed-in" to other classes to impart functionality. The effect is similar, but less confusing, than multiple inheritance. In fact, not only can Ruby classes be extended in this way, but instances of Ruby objects themselves can be dynamically extended with the functionality of a module—leaving other instances of that same class untouched. Here's an example using Ruby's Observable module, which implements the Publish/Subscribe design pattern:
require 'observer' publisher = Publisher::new publisher.extend Observable
In this example only this instance of the Publisher class is extended with Observable's methods.Jamis was more than happy to work with me to add ArrayFields support to his SQLite package. The way it works is simple: if the ArrayFields module is detected at runtime the tuples returned by a query will be dynamically extended to support named field access. No other Array objects in memory are touched—only those Arrays returned as tuples are extended with ArrayFields.
Finally I was able to write readable code like: like:
tuples.sort_by{ |tuple| tuple['submitted'] }.reverse
This is lines of code almost always aids both development and maintenance.
Using. | http://www.artima.com/rubycs/articles/rubyqueueP.html | CC-MAIN-2015-32 | refinedweb | 1,178 | 62.58 |
. These Logger objects allocate LogRecord objects which are passed to Handler objects for publication. Both Loggers and Handlers may use logging Levels and (optionally) Filters to decide if they are interested in a particular LogRecord. When it is necessary to publish a LogRecord externally, a Handler can (optionally) use a Formatter to localize and format the message before publishing it to an I/O stream.
Each Logger keeps track of a set of output Handlers. By default all Loggers also send their output to their parent Logger. But Loggers may also be configured to ignore Handlers higher up the. Handlers. In particular, localization and formatting (which are relatively expensive) are deferred until the Handler requests them. For example, a MemoryHandler can maintain a circular buffer of LogRecords without having to pay formatting costs.
Each log message has an associated log Level.).
As stated earlier, client code sends log requests to Logger objects. Each logger keeps track of a log level that it is interested in, and discards log requests that are below this level.
Loggers are normally named entities, using dot-separated names such as "java.awt". The namespace is hierarchical and is managed by the LogManager. The namespace should typically be aligned with the Java packaging namespace, but is not required to follow it slavishly. Loggers, it is also possible to create anonymous Loggers that don't appear in the shared namespace. See section 1.14.:
The Logger class provides a large set of convenience methods for generating log messages. For convenience, there are methods for each logging level, named after the logging level name. Thus rather than calling "logger.log(Constants... JDBC, etc. See the LogManager API Specification for details.. Java Logging APIs do not provide any direct support for unique message IDs. Those applications or subsystems requiring unique message IDs should define their own conventions and include the unique IDs in the message strings as appropriate..
A new security permission LoggingPermission is defined to control. This,..("com.wombat", Level.FINEST); ... }
Here's a small program that sets up it"); } }
<)> <!-- Unique sequence number within source VM. --> <!ELEMENT sequence (#PCDATA)> <!-- Name of source Logger object. --> <!ELEMENT logger (#PCDATA)> <!-- Logging level, may be either one of the constant names from java.util.logging.Constants )> | http://java.sun.com/javase/6/docs/technotes/guides/logging/overview.html | crawl-002 | refinedweb | 374 | 50.43 |
Building the Right Environment to Support AI, Machine Learning and Deep Learning
Watch→
First, in the project where you intend to call the Web service, you must add a reference to Masonry.Interfaces. Remember that this contains the public interface IUserObject: while the client piece doesn't have the code for the user object, it knows what functions exist through the interface. This will become very important over the next several steps.
Next, you must add a Web reference to the Web service you created in Tip 3. You can right-click and select Add Web Reference..., and select the Web service you created earlier. Note that .NET adds the Web service with a default name of localhost: you'll need to change the name to wUserObject. (Remember that all Web services are named after their corresponding business object, plus a "w" prefix.)
Normally you only need to add the Web service reference. However, because you declared earlier that the Web service implements the IUserObject interface, you must implement that interface in the client Web reference. Why? Because .NET "drops" the interface implementation when the Web reference proxy is created; however, you can add it back in by selecting "show all files" in Solution Explorer, and navigating all the way down the Web reference until you see the file Reference.cs. You'll see the declaration of public class wUserObject that derives from the SoapHttpClientProtocol class, but does not implement IUserObject. Simply add a reference to the Masonry.Interfaces namespace, and add the reference to IUserObject at the end of the class declaration.
Listing 8 provides a full example that uses this connection class. Listing 7 and Listing 8 represent the most critical pieces of code in the client piece.
Tip 5: Building a Data Access Layer
The application will use stored procedures to retrieve, add, and update data. You must develop a function to build a connection associated with the requested database, and build necessary functions to execute stored procedures. This ties together Tip 2, Tip 3, and Tip 4 to show a complete "wire-to-wire, and back" process.
The CG Framework provides a base data access class (CGS.DataAccess.cgsDataAccess) for many common database tasks. These tasks include building connection strings, executing stored procedures with parameters, managing transactions, and supporting multiple databases. As stated in Tip 1, developers can build their data access layer by inheriting from cgsDataAccess.
As a basic introduction, the ValidateUserID function in the Masonry.DataAccess.UserDA class (see Listing 9) provides an example of using methods that the base data access class exposes. The primary base method you'll use in ValidateUserID is SPRetrieveData. Let's take a few minutes and walk through the parameters for this method.
The first parameter (required) is the database key. The base data access class utilizes the database key (sent by the client piece) to build the appropriate connection string. It does this by reading an XML file (Database.xml, see Listing 10) on the server that contains the connection information for each possible database key. As stated earlier, this functionality allows a company to add database connections without the need for a software update.
The second parameter is the name of the stored procedure, and it is also a required parameter. The third and fourth parameters are optional. The third parameter is an ArrayList of the parameters to be passed to the stored procedure. The fourth parameter is the timeout factor. The developer should only pass the collection of parameters if necessary, and they only need to pass a timeout factor if the specified stored procedure is intensive and requires more time than the default command timeout provides.
While not included in the listing example, SPRetrieveData contains an additional parameter for typed datasets, so that result sets can be specifically named. By default, result sets are named "table," "Table1," "Table2," etc. Developers who have constructed typed datasets and wish to use specific names for each table in the corresponding result set will find the default names for the result sets frustrating. Fortunately, the CG Framework deals with this by permitting the developer to pass a reference to the typed dataset as a parameter. SPRetrieveData will utilize the TableMappings function to name each result set based on the corresponding table name in the typed dataset.. | http://www.devx.com/codemag/Article/28744/0/page/3 | CC-MAIN-2019-13 | refinedweb | 718 | 54.52 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.