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 |
|---|---|---|---|---|---|
Simon Guest
Microsoft Corporation
September 2004
Applies to:
Microsoft .NET Framework 1.1
Microsoft Visual Studio .NET 2003
IBM WebSphere Application Developer (WSAD) 5.1.2
Summary: Predicting whether Web services interoperability between two platforms is going to work is sometimes difficult. Simon Guest shares recommendations for Web services interoperability between the Microsoft .NET Framework 1.1 and IBM WebSphere Application Developer (WSAD) 5.1.2. (19 printed pages)
Web Services Interoperability: "Is It Going to Work?"
About the Recommendations using IBM WebSphere Application Developer." I nodded in acceptance. "I'm looking to build an application in .NET and interoperate with IBM WebSphere WebSphere. For example: Passing a message with a Boolean, then a String, then a Long, then a Float. As the tests moved on, they got increasingly complex. Create an array. Nest types within types. Include some null values. IBM WebSphere Application Developer (WSAD) 5.1.2.
I've divided the recommendations up in to two sections: IDE Recommendations and "On the wire" Recommendations.
IDE Recommendations covers recommendations for using either Visual Studio .NET 2003 or IBM WSAD 5.1.2 in IBM WSAD 5.1.2 calling Web service in .NET.
Scenario: Imagine two Web services, both written in .NET. The first Web service is part of a Customer Relationship Management (CRM) service and is used to create and maintain customers. The service has a method similar to the following:
public Response CreateCustomer(Customer customer)
The namespace for this Web service is
The second Web service is used to display current orders for a customer. It has a method signature that looks as follows:
public Orders GetOrders(Customer customer)
It has been decided that the namespace for this Web service is.
When creating a Java Web Services Client in IBM WSAD 5.1.2, the IDE defines the package based on the domain portion of the namespace. The domain portion of the namespaces for these two Web service methods is, therefore the package name is org.myorg.
IBM WSAD 5.1.2 defines the class name for each Web service based upon the name of the ASMX file (for example, Service1.asmx would result in a proxy class called Service1.java).
In our example, let's imagine the first Web service was exposed using Service1.asmx. Based on the namespace and file name, the data types and proxy files will be created under the org.myorg structure. Within the IDE, this may look similar to Figure 1.
Figure 1. Namespace structure created in IBM WSAD 5.1.2
Let's imagine however that the second Web service also has the same filename (Service1.asmx). Even though the two Web services may have very different URLs, because the domain portion of the namespace and the filename are the same, this causes a conflict.
When creating the client proxy for the second Web service, the same package (org.myorg) will be used. Because the Service1.asmx file has the same name as the first Web service, all of the client proxy files (Service1*.java) will be in conflict.
Figure 2. Generated Proxy Files in Conflict
As shown in Figure 2, after creation of the proxy, the original Service1.java, Service1Locator.java, Service1Soap.java, Service1SoapProxy and Service1SoapStub files remain bound to the first Web service. In essence, the second client proxy never gets created.
Recommendation:
To overcome this you can do one of three things:
For two namespaces of and, IBM WSAD 5.1.2 will generate proxy files in the sample package (org.myorg). Using different domains for each Web service will correct this.
For example, and will create packages named org.myorg.crm and org.myorg.purchasing respectively. In this instance, there will not be a conflict.
The second option is to ensure all of the ASMX files being consumed by IBM WSAD 5.1.2 have a unique name (for example Service1.asmx and Service2.asmx). This will still create the shared package (org.myorg), but the service proxy files will be uniquely named.
If however, you are using data types with the same names this could still cause problems.
At the end of the client proxy generation wizard in the IBM WSAD 5.1.2 IDE, you are given the option to define custom mappings for namespace to packages.
Figure 3. Custom Namespace Mapping in IBM WSAD 5.1.2
This gives you the option of mapping the unique namespace to a correctly named package. As shown in Figure 3, you have the opportunity to add a namespace to package mapping. For this example, the namespace of the first ASMX Web service () is mapped to a unique package name (org.myorg.crm).
Applies To: IBM WSAD 5.1.2 Client calling .NET Web service
Scenario: In a similar scenario to the previous recommendation, again imagine two Web services, written in .NET. The first Web service is used to create new customers. It has a method that looks like the following:
The second Web service is used to display current orders based on a current customer. It has a method signature that looks as follows: http:/myorg.org/types/customer.xsd. Based on this, the xsd.exe tool (a utility in the .NET Framework SDK) has been used to generate the class from this XSD document (xsd.exe /c customer.xsd). This is used for the Web services described above.
In IBM WSAD 5.1.2, when you create the Java proxies for these two Web services, everything works, as shown in Figure 4.
Figure 4. Proxy Generation in IBM WSAD 5.1.2
org.myorg is used for the shared data types.
org.myorg.crm is used for the CRM service.
org.myorg.purchasing is used for the purchasing service.
The issue arises if the ASMX Web services are changed to use arrays instead of single values.
For example, imagine that the Web services methods are changed from this:
public Response CreateCustomer(Customer customer)
public Orders GetOrders(Customer customer)
To this:
public Response CreateCustomer(Customer[] customer)
public Orders GetOrders(Customer[] customer)
When the java client proxies are regenerated through IBM WSAD 5.1.2, a new class called ArrayOfCustomer is created in the org.myorg package.
Figure 5. Proxy Generation for Array Types in IBM WSAD 5.1.2
Everything looks to be OK, until you re-run the Java client. When the client runs, one of the .NET Web services is correctly passed the array, where as the other Web service believes it receives a null value. This problem arises because the namespace for the ArrayOfCustomer type is bound to a particular service.
Exploring further, we can see that the generated ArrayOfCustomer_Helper.java class contains static methods that are explicitly bound to a particular Web service:
field.setXmlName(com.ibm.ws.webservices.engine.utils.QNameTable.createQ
Name("", "Customer"));
This therefore breaks the model of sharing schemas between services and we are forced to look at alternative workarounds in IBM WSAD 5.1.2 in order to compensate.
To overcome the issue of these namespace issues, one of the following options is recommended:
During the generation of the client proxy files in IBM WSAD 5.1.2, you can manually move (also known as refactoring) the classes to place them in unique namespaces.
To do this, clear all of the existing proxy files (to ensure that no old proxy files are left behind), and regenerate the client proxy for the first Web service. This will create the correct set of ArrayOfCustomer values in the org.myorg package.
Within the WSAD 5.1.2 IDE, right click on the generated types in org.myorg and select Move. Move all of the types to either a unique package, or the package used for the Web service proxy itself: org.myorg.crm
Figure 6. Moving Generated Data Types in IBM WSAD 5.1.2
Do the same for the second Web service and re-run the client.
An alternative to refactoring the classes in the previous step is to again use the Web service namespace to package mapping option at the end of the Java proxy wizard.
Figure 7. Using Custom Mappings to Map the Data Types
To use this, map the namespace of the XSD type (in this case it is) to the package that contains the client proxy files (org.myorg.crm).
For both the options listed above, you will also need to change the client code to reference the correct data type for each proxy. For example:
org.myorg.purchasing.ArrayOfCustomer purCustomers =
new org.myorg.purchasing.ArrayOfCustomer();
purCustomers.setCustomer(new org.myorg.purchasing.Customer[]{cust2});
proxy.getOrders(purCustomers);
Although the data types are being duplicated, each Web service will now be called using the correct namespace.
Applies To: Web services created using IBM WSAD 5.1.2
Scenario: The first recommendation in this article covered how IBM WSAD 5.1.2 has an issue dealing with two ASMX files with the same name. Likewise, Web services that have the same class name in WSAD 5.1.2 can also experience problems. If you are planning Web services in both .NET and IBM WSAD 5.1.2 that share the same names across projects, this could be an important consideration.
To demonstrate this, imagine that you have two Java beans created under the scope of a single project in WSAD 5.1.2, as shown in Figure 8:
Figure 8. Creating Two Web services with the Same Name
Notice how both beans are in separate packages, but both are called the same class (Service.java).
Right clicking each of these beans within the IDE and selecting Web services->Deploy As Web Service generates a Web service for each bean. This generates an SEI (Service Endpoint Interface) file for each of the classes and additional WebContent files required for the deployment.
The Web services are built correctly, and will compile, but when they are deployed to the WebSphere server, the following error is observed.
[8/12/04 17:25:03:389 PDT] 3ce2077a WebGroup E SRVE0020E: [Servlet Error]-[org_myorg_crm_Service]:
Failed to load servlet: java.lang.ClassCastException: org.myorg.crm.Service
at com.ibm.ws.webcontainer.webapp.WebAppServletManager.loadServlet(WebAppServletManager.java:188)
at com.ibm.ws.webcontainer.webapp.WebAppServletManager.loadAutoLoadServlets(WebAppServletManager.java:542)
at com.ibm.ws.webcontainer.webapp.WebApp.loadServletManager(WebApp.java:1277)
at com.ibm.ws.webcontainer.webapp.WebApp.init(WebApp.java:283)
Only the last Web service with the same name will be deployed. This applies even if the name of the generated WSDL file (Service.wsdl by default) is renamed to something unique.
It is believed that this is an error with the binding generation during the WebSphere deployment process. To overcome this error, ensure that all Web services (resident under the same project) have unique class names.
If class names must be the same for two or more Web services (for example, you wish to duplicate the setup of several ASMX Web services), the recommendation is to use multiple projects to host these.
Scenario: Imaging that you are planning a similar suite of Web service methods to run on both Microsoft .NET and IBM WebSphere.
For example:
public Customers GetCustomers() in .NET
public Customers GetCustomers()
public Customers GetCustomers() in IBM WSAD 5.1.2
When you try and deploy a Web service with this method in IBM WSAD 5.1.2 you will get the following message:
java.lang.Exception: WSWS3352E: Error: Couldn't find a matching Java
operation for WSDD operation "getCustomers" (Debug Info: name: services/Service
The exception raised indicates that the reflection processes of the service are looking for method names that only start with lower case letters.
Recommendation: If using both Microsoft .NET and IBM WSAD 5.1.2 to generate Web services, you may want to set some standard naming conventions ahead of time based on this recommendation. Doing so may reduce the likelihood of clients calling different cased methods for each Web service. For example:
Method service1.GetCustomers() for .NET
service1.GetCustomers()
Method service2.getCustomers() for IBM WSAD 5.1.2
service2.getCustomers()
Web services created and deployed using Microsoft .NET support method names that start with both upper and lower case letters.
Scenario: For generating classes from XSD documents, IBM WSAD 5.1.2 uses the Java Beans for XML Schema wizard. The wizard creates bean methods (getters and setters) from the XSD document.
If the wizard comes across a value of type of xsd:boolean however, the getter method is prefixed by is instead of get. For example:
order.isFulfilled()
Whereas order.getFulfilled() may have been expected.
Recommendation: This is important to note if you are using any reflective properties from a .NET client that is consuming a Web service hosted using IBM WebSphere.
For the unit tests I had to check whether the method returned a Boolean value and adjusted the call accordingly.
Applies To: IBM WSAD 5.1.2 client calling a .NET Web service
Scenario: Imagine that you have a client created using IBM WSAD 5.1.2: IBM WSAD 5.1.2 Client calling a .NET Web service
Scenario: Imagine a .NET Web service that contains the following method:
public void Method1(Message[] messages)
{
//do something with the messages
}
The method accepts an array of messages. When thinking about the IBM WSAD 5.1.2 client proxy, you may believe that you should call the method using the following construct:
Message[] messages = myFactory.createMessages();
service.Method1(messages);
When the client proxy is generated by IBM WSAD 5.1.2, a new data type called ArrayOfMessage will be created. The Web service has to be called using the following code:
ArrayOfMessage
Message[] messages = myFactory.createMessages();
ArrayOfMessage mArray = new ArrayOfMessage();
mArray.setMessageType(messages);
service.Method1(mArray);
Using this construct will ensure that arrays sent in Web service requests are correctly handled between IBM WSAD 5.1.2 clients and .NET Web services.
The recommendations listed in this section cover "On the Wire" (or runtime) recommendations. They are in no particular order of priority, but some do follow sequentially. Each of the recommendations covers the platform it applies to, an example scenario and the actual recommendation itself.
Applies To: .NET Client and .NET Web service
Scenario: You have a Web service running on IBM WebSphere:
Applies To: .NET Client calling IBM WSAD 5.1.2 Web service
Scenario: Imagine the following Web service in WSAD 5.1.2:
public Messages[] Method1()
{
return null;
}
When the .NET client receives the response from the Web service, it is interpreted as a single element, not a NULL value.
The recommendation is to avoid returning NULL arrays—or instead return the NULL array as an element of a complex object, which works successfully.
SOAP Trace:
When the IBM WSAD 5.1.2 Web service is called with the above example, it returns the following response:
<?xml version="1.0" encoding="UTF-8"?>
<soapenv:Envelope xmlns:soapenv=""
xmlns:soapenc=""
xmlns:xsd=""
xmlns:
<soapenv:Body>
<method1Response xmlns="">
<method1Return xsi:
</method1Response>
</soapenv:Body>
</soapenv:Envelope>
The .NET Client however was expecting the following (this message is correctly sent from a .NET Web service):
<?xml version="1.0" encoding="utf-8"?>
<soap:Envelope xmlns:soap=""
xmlns:xsi=""
xmlns:
<soap:Body>
<Method1Response xmlns=""/>
</soap:Body>
</soap:Envelope>
Scenario: Imagine the following Web service, created using IBM WSAD 5.1.2:
public Message[] Method1()
{
Message[] myMessage = new Message[10];
return myMessage;
}
When the .NET Client receives the array, it is able to traverse through the array, but for each element in the array a default message exists instead of a NULL value. This also applies if the .NET client sends an empty array or array containing nulls to the Web service hosted by IBM WebSphere.
Recommendation:
The recommendation is to avoid return empty arrays or arrays containing nulls from a WSAD 5.1.2 Web service.
The following SOAP response was returned from the IBM WSAD 5.1.2 Web service:
<?xml version="1.0" encoding="UTF-8"?>
<soapenv:Envelope xmlns:soapenv=""
xmlns:soapenc=""
xmlns:xsd=""
xmlns:
<soapenv:Body>
<method1Response xmlns="">
<method1Return xsi:nil="true"
xmlns:
Response>
</soapenv:Body>
</soapenv:Envelope>
To correctly interpret this, the .NET client expects the following (this was sent by a .NET Web service):
<?xml version="1.0" encoding="utf-8"?>
<soap:Envelope xmlns:soap=""
xmlns:xsi=""
xmlns:
<soap:Body>
<Method1Response
xmlns="">
<Method1Result>
"/>
</Method1Result>
</Method1Response>
</soap:Body>
</soap:Envelope>
In this article you have seen some of the recommendations for achieving interoperability between Web services created using Microsoft .NET Framework 1.1 and IBM WSAD 5.1.2.
Through creating this article, it is apparent that interoperability using Web services developed on the Microsoft .NET Framework 1.1 and IBM WSAD 5.1.2 is most definitely achievable today. The results and observations from running the unit tests confirm this, and this is validated by the number of organizations who are developing applications today that span both platforms.
Overall, the results are testament to how well both Microsoft and IB in creating. | http://msdn.microsoft.com/en-us/architecture/ms998272.aspx | crawl-002 | refinedweb | 2,822 | 59.5 |
OPENAT2(2) Linux Programmer's Manual OPENAT2(2)
openat2 - open and possibly create a file (extended)
#include <sys/types.h> #include <sys/stat.h> #include <fcntl.h> #include <openat2.h> int openat2(int dirfd, const char *pathname, struct open_how *how, size_t size); Note: There is no glibc wrapper for this system call; see NOTES.-zero pro‐ grams resolu‐ tion immedi‐ ately resolu‐ tion. However, this may change in the future. There‐ fore, to ensure that magic links are not resolved, the caller should explicitly specify RESOLVE_NO_MAGICLINKS. RESOLVE_NO_MAGICLINKS Disallow all magic-link resolution during path resolu‐ tion. fol‐ lowing: · If the process opening a pathname is a controlling process that currently has no controlling terminal (see credentials(7)), then opening a magic link inside /proc/[pid]/fd that happens to refer to a ter‐ minal would cause the process to acquire a control‐ ling terminal. · In a containerized environment, a magic link inside /proc may refer to an object outside the container, and thus may provide a means to escape from the con‐ tainer. Because of such risks, an application may prefer to disable magic link resolution using the RESOLVE_NO_MAG‐ ICLINKS flag. If the trailing component (i.e., basename) of pathname is a magic link, how.resolve contains RESOLVE_NO_MAGI‐ CLINKS, and how.flags contains both O_PATH and O_NOFOL‐ LOW, then an O_PATH file descriptor referencing the magic link will be returned. RESOLVE_NO_SYMLINKS Disallow resolution of symbolic links during path reso‐ lution. This option implies RESOLVE_NO_MAGICLINKS. If the trailing component (i.e., basename) of pathname is a symbolic link, how.resolve contains RESOLVE_NO_SYMLINKS, and how.flags contains both O_PATH and O_NOFOLLOW, then an O_PATH file descriptor refer‐ encing widely used by end-users. Setting this flag indiscriminately—i.e., for purposes not specifi‐ cally related to security—for all uses of openat2() may result in spurious errors on previously-functional sys‐ tems. This may occur if, for example, a system path‐ name that is used by an application is modified (e.g., in a new distribution release) so that a pathname com‐ ponent (now) contains a symbolic link. RESOLVE_NO_XDEV Disallow traversal of mount points during path resolu‐ tion (including all bind mounts). Consequently, path‐ name must either be on the same mount as the directory referred to by dirfd, or on the same mount as the cur‐ rent working directory if dirfd is specified as AT_FDCWD. Applications that employ the RESOLVE_NO_XDEV flag are encouraged to make its use configurable (unless it is used for a specific security purpose), as bind mounts are widely used by end-users. Setting this flag indis‐ criminately—i.e., for purposes not specifically related to security—for all uses of openat2() may result in spurious errors on previously-functional systems. This may occur if, for example, a system pathname that is used by an application is modified (e.g., in a new dis‐ tribution release) so that a pathname component (now) contains a bind mount. If any bits other than those listed above are set in how.resolve, an error is returned.
On success, a new file descriptor is returned. On error, -1 is returned, and errno is set appropriately.INVAL An unknown flag or invalid value was specified in how. EINVAL mode is non-zero,.
openat2() first appeared in Linux 5.6.
This system call is Linux-specific. The semantics of RESOLVE_BENEATH were modeled after FreeBSD's O_BENEATH.
Glibc does not provide a wrapper for this system call; call it using syscall(2). perf_setattr(2), perf_event_open(2), and clone3(2). If we let usize be the size of the structure as specified by the user-space application, and ksize be the size of the structure which the kernel supports, then there are three cases to consider: · If ksize equals usize, then there is no version mismatch and how can be used verbatim. ·. ·-zero,).
openat(2), path_resolution(7), symlink(7)
This page is part of release 5.07 of the Linux man-pages project. A description of the project, information about reporting bugs, and the latest version of this page, can be found at. Linux 2020-04-11 OPENAT2(2)
Pages that refer to this page: creat(2), open(2), openat(2), syscalls(2), path_resolution(7), symlink(7) | https://www.man7.org/linux/man-pages/man2/openat2.2.html | CC-MAIN-2020-29 | refinedweb | 701 | 58.18 |
RUR-PLE 0.95 has been released. The "end" is somewhat in sight. A copy of the announcement that I have posted on a few lists is appended at the end of this post.is' Karel the Robot was named after the author Karel Capek, who popularized the word robot in his play Rossum's Universal Robots (RUR). While RUR-PLE shares the basic RUR acronym,
in this case it stands for Roberge's Used Robot. However, through the magic of Guido van Rossum's Python, you can learn how to fix it and design a better one, worthy of the name Rossum's Universal Robot.
1 comment:
Sorry couldn't find a way to send you a patch for the bug in rur_py/translation.py
--- translation.py 2006-03-22 17:17:26.000000000 -0500
+++ newTranslation.py 2006-03-22 16:52:09.000000000 -0500
@@ -5,8 +5,9 @@
# standard 'gettext' approach and expects some standard functions to
# be defined - which they are not in my customized version.
-import os
+import os , sys
home = os.getcwd()
+OsPlatform_Win = sys.platform.startswith('win')
@@ -14,23 +15,34 @@
#---BUG HERE FOR UNIX-LINUX path // not \\ as in windows
def select(lang):
- global selected
- global english, french, spanish
- if lang == 'en':
- if english == {}:
- filename = os.path.join(home, "rur_locale\\en\\english.po")
- english = build_dict(filename)
- selected = english
- if lang == 'es':
- if spanish == {}:
- filename = os.path.join(home, "rur_locale\\es\\spanish.po")
- spanish = build_dict(filename)
- selected = spanish
- if lang == 'fr':
- if french == {}:
- filename = os.path.join(home, "rur_locale\\fr\\french.po")
- french = build_dict(filename)
- selected = french
+ global selected
+ global english, french, spanish
+ if lang == 'en':
+ if english == {}:
+ if OsPlatform_Win:
+ filename = os.path.join(home, "rur_localei\\en\\english.po")
+ else:
+ filename = os.path.join(home, "rur_locale/en/english.po")
+ english = build_dict(filename)
+ selected = english
+ if lang == 'es':
+ if spanish == {}:
+ if OsPlatform_Win:
+ filename = os.path.join(home, "rur_localei\\es\\spanish.po")
+ else:
+ filename = os.path.join(home, "rur_locale/es/spanish.po")
+ spanish = build_dict(filename)
+ selected = spanish
+ if lang == 'fr':
+ if french == {}:
+ if OsPlatform_Win:
+ filename = os.path.join(home, "rur_localei\\fr\\french.po")
+ else:
+ filename = os.path.join(home, "rur_locale/fr/french.po")
+ french = build_dict(filename)
+ selected = french
+
+
def _(message):
message = message.replace("\n","") # message is a key in a dict | http://aroberge.blogspot.com/2006/01/rur-ple-095-is-out.html | CC-MAIN-2016-36 | refinedweb | 375 | 51.24 |
This is the second of five articles about Host Workflow communication.
In this series of articles, I will try to show the different possibilities to implement communication, from the simplest case to the more complex. I am not planning to be exhaustive, but I will try to give a general panoramic in order to get us a good idea about the thematic.
Because I also don’t like large articles, I have divided this series into the followings parts:
In Part I, we understood how to pass information to a Workflow when it is launched. That works OK when you don’t need to return data from the Workflow. But often, you need to return information about the processed data in the Workflow.
The Workflow foundation is delivered with an Activity component to do this work: the CallExternalMethod Activity.
CallExternalMethod
Returning to the example of Part I, our program reads a file from the computer and sees determinate number of chars from it. In this program, we want to pass two parameters (the file path and the number of characters to return from the file), and the Workflow will show the information in an internal message box. Now, we have the requirement to show the return information directly in the console output and not in an internal message box form (see Figure 1).
You can see that the barrier between the threads is passed with the Workflow invocation and again to return the character from the file to the console host application.
To implement passing the information form the Workflow to the Host, WWF comes with a dedicated activity named CallExternalMethod. That is the good news; the bad news is that we must create a specific service pattern to communicate with this activity.
The communication service pattern works as another service. You must create a service interface, implement the service, and register it in the Workflow runtime instance. You can implement the communication as you want, by poll or by events, but you must fulfill the CallExternalMethod requirements. In short, you need to implement the following code structure:
Create the followings interface and classes:
EventArgs
In the Host application, the following steps need to be taken:
ExternalDataExchangeService
In the Workflow:
You can see the result class structure for our example in the following diagram:
You can see that the CallExternalMethod makes a call to a method that is in another thread. When this method is executed, we have the results in the host thread! That is the trick.
We use a console application and a sequential Workflow to explain in detail how to create these structures.
The best thing to do is download the code that is attached to this article, or if you have it from of Part I of this series, you can reuse it.
The companion project has the communication with the Workflow through parameters, that was explained in Part I. I assumed that you would know how to do it (if you don’t know, please revisit Part I of this article series).
We will now do a step by step explanation of the use of CallExternalMethod in our example:
You can create this interface in the same project as your host or in an independent project. For simplicity, we created it in the same host application. The interface simply contains the method to be called by the Workflow. You should now be thinking, why not call any method in the host? The answer is, this interface must have a special header to define it as an external method callable by the Workflow. The complete code is shown here:
///<summary>
/// You MUST to mark the interface with the header ExternalDataExchange
/// to identify the interface as the communication interface.
/// </summary>
[ExternalDataExchange]
public interface ICommunicationService
{
/// <summary>
/// This method must be call by the CallExternalMethod Activity
/// to transfer the information to the console host application
/// <param name="response">Data to send to console</param >
void SendDataToHost(string response);
}
Observe the ExternalDataExchangeHeader. It determines that the method in the class can be called from the Workflow.
ExternalDataExchangeHeader
The code for this class is your responsibility and your decision. You can decide to implement a method to simply hold the data passed from the Workflow and then the host will poll the class instance, or you can decide if you want to implement an event to asynchronously get the data.
In our code, we implement an event. We should pass the data from the Workflow in the arguments of the event:
/// <summary >
/// Implement the interface
/// This implementation is made to comunicate WF -> Host
/// </summary >
public class CommunicationService: ICommunicationService
{
/// <summary >
/// Event to communicate the host the result.
/// </summary >
public event EventHandler <SendDataToHostEventArgs> SendDataToHostEvent;
/// <summary >
/// Implement the external Method
/// </summary >
/// <param name="response" >response to host</param >
public void SendDataToHost(string response)
{
SendDataToHostEventArgs e = new SendDataToHostEventArgs();
e.Response = response;
EventHandler<senddatatohosteventargs > sendData = this.SendDataToHostEvent;
if (sendData != null)
{
sendData(this, e);
}
}
}
You can see the implementation of the event and the simple code of the method above. The method only passes the response input parameter to the event arguments and raises the event.
The definition of the event argument is trivial, and is shown here:
public class SendDataToHostEventArgs: EventArgs
{
string _response = string.Empty;
/// <summary >
/// This property is used to pass in the Event
/// the response to host
/// </summary >
public string Response
{
get
{ return _response; }
set
{ _response = value; }
}
}
In our example, we create the three classes in different files. You can see them here:
We register it in the Workflow runtime instance in the host program. The intercommunication class Workflow-Host must be registered as an External Data Exchange Service in the runtime. The registration is relatively simple, as you can see in the following code:
//Add support to the Communication Service..................
//Declare a ExternalDataExchangeService class
ExternalDataExchangeService dataservice = new ExternalDataExchangeService();
//Add to workflow runtime
workflowRuntime.AddService(dataservice);
//Declare our CommunicationService instance
CommunicationService cservice = new CommunicationService();
//Add to the ExternalDataService
dataservice.AddService(cservice);
//Add a handler to Service Event
cservice.SendDataToHostEvent += new
EventHandler<senddatatohosteventargs> (cservice_SendDataToHostEvent);
// end of support to Communication Service.................
The first four instructions are related to registering the intercommunication service, and the last to registering the event to communicate the result from the Workflow. Our application is now complete in the host side. Now we should make our Workflow.
Well, we use as base the same Workflow as in Part I. We suppress the code activity that shows the MessageBox. Then, drag and drop a CallExternalMethod activity to the Workflow, and configure it as in the following figure:
MessageBox
Note that the InterfaceType property is filled with the created ICommunicationService. The MethodName is the method to be called by the activity in the interface. When you enter the MethodName, the property is expanded and you must declare the variable that will fill the response parameter. In our application exists a variable _response. To match the parameter with the variable, click in the ellipsis button in the Response field, and in the opened dialog, click in “Bind to a new member", create the field, and enter the name of the field _response. (If you click in the example code, the binding is already created, and you can see the variable directly in the “Bind to an existing member” screen).
InterfaceType
ICommunicationService
MethodName
_response
The rest of the logic is trivial, and you can see it in the example (the logic to access the file and pass the initialization parameters from the Host).
Compile the application and launch it. You can use your proper parameters to launch the application or use the default. (Maybe you do not have the specific file that is used as the default. Feel free to change it for another that you have).
The basic step to pass information from the Workflow to the Host using the CallExternalMethod Activity are the following:
[ExternalDataExchange]
In the Host application:
ExternalDataExchangeServiceInstance
Now, you know how to do a bi-directional communication between a host and a Workflow. But you will continue to have limitations. Until now, you only knew how to send information to a Workflow in the initialization phase, but what about sending information from the Host to the Workflow at any point of the Workflow? We will talk about this in the next. | http://www.codeproject.com/Articles/29873/Host-and-Workflow-Two-Worlds-to-Communicate-Part?msg=4366088 | CC-MAIN-2015-35 | refinedweb | 1,370 | 51.68 |
This document describes how to create an API connecting to the TSF in the backend through the API Gateway console.
You have created a service.
Enter the API name.
Enter the URL path.
You can write a valid URL path as needed. If you need to configure a dynamic parameter in the path, use
/user/{userid} path declares the
userid parameter in the path, which must be defined as a path-type input parameter. A query parameter does not need to be defined in the URL path.
{}to enclose the parameter name. For example, the
Select the request method.
The request method is HTTP method. You can choose from GET, POST, PUT, DELETE, HEAD, and ANY.
Select the authentication type: no authentication or key pair.
Select whether to support CORS.
Enter the parameter configuration.
Input parameters include parameters from the header, query, and path locations, where a path parameter corresponds to a dynamic parameter defined in the URL path.
For any parameter, the parameter name, parameter type, and parameter data type must be specified. Whether a parameter is required and its default value, sample data, and description can be specified optionally. Using these configuration items, API Gateway helps you with the documentation and preliminary verification of input parameters.
Two required parameters
X-NameSpace-Code and
X-MicroService-Name need to be passed in for the call. They control which microservice the API Gateway request will be sent to and can be placed in header, path, or query. If the parameters are placed in path, just like for general APIs, you need to configure the path parameter in the path, such as
/{X-NameSpace-Code}/{X-MicroService-Name}. If the variable
X-NameSpace-Code is
crgt and
X-MicroService-Name is
coupon-activity, then the access URL will be
domain name/crgt/coupon-activity/. Except these 2 fixed parameters, other parameters can be configured in the same way as the general APIs are.
In the namespace of Tencent Service Framework, the
X-NameSpace-Code path parameter is the code value of the namespace selected for the backend configuration.
In the service management of Tencent Service Framework, the
X-MicroService-Name path parameter is the microservice name of the cluster selected for the backend configuration.
Click Next and configure the backend.
Select the cluster and namespace of the microservices to be interconnected with.
Select the microservices. The API publisher can integrate multiple microservices in 1 API.
Please make sure that the added microservices, including those deployed on CVMs and containers, can be accessed by API Gateway (over the public network and NodePort).
Note：
Currently, API Gateway only supports forwarding requests to service instances of the same deployment type (virtual machine or container) in TSF. If there are microservice instances deployed on both virtual machines and containers under a service, API Gateway cannot be used as the request entry.
Configure the backend path.
This refers to the specific backend service request path. If you need to configure a dynamic parameter in the path, use
{}to enclose the parameter name. In the parameter mapping configuration, this parameter name will be configured as the input parameter from the frontend configuration. The path here can be different from the frontend path. The backend path is the actual service request path.
Set the backend timeout period.
This refers to the timeout period of the backend service call initiated by API Gateway (up to 30 seconds). During a call, if there is no response within the timeout period, API Gateway will terminate the call and return the corresponding error message.
Select the load balancing method.
Set the session persistence.
Set the parameters.
X-NameSpace-Codeand
X-MicroService-Nameare fixed parameters and cannot be mapped. Other configured parameters can be mapped.
Bodyparameter only has a form format, you can directly map the frontend and backend parameters when configuring them. If it is in JSON format, the JSON parameter will be directly passed through by API Gateway.
Click Next and configure the response result..
To allow access to the backend microservice through API Gateway, you need to open the security group of the virtual machine where the microservice resides to the internet. You can set the source, protocol port, and access policy of the security group access.
When setting the access source, you need to at least open the IP ranges 9.0.0.0/8 and 100.64.0.0/10 where API Gateway resides. You can also open other sources as needed.
Contact our sales team or business advisors to help your business.
Open a ticket if you're looking for further assistance. Our Ticket is 7x24 avaliable.
Was this page helpful? | https://intl.cloud.tencent.com/document/product/628/39488 | CC-MAIN-2022-21 | refinedweb | 774 | 50.33 |
Hi,
how can I set the exact size of an object?
I know Key S and Ctrl.
But with that I do not know the exact size of the object (e.g. cube) nor can I set it exactely.
Wrote a script to give me the size, but guess there should be an easier way?!
Best,
Johannes
#!BPY
“”" Registration info for Blender menus:
Name: ‘Object Names’
Blender: 237
Group: ‘Add’
Submenu: ‘All Objects…’ all
Submenu: ‘Selected Objects…’ selected
Tooltip: ‘Show names of all objects’
“”"
import Blender
objects = Blender.Object.Get ()
print objects
#print objects.GetSelected()
#print objects.GetSelected().getSize()
for object in objects:
print object.getSize() | https://blenderartists.org/t/set-exact-size-of-object-e-g-cube/350574 | CC-MAIN-2021-10 | refinedweb | 106 | 68.77 |
During the last post we discussed how AWS GLUE has masked the PII information in FEED file. After masking, a new file got generated and kept in the S3 bucket. In continuation of the same process, we need this file to be ingested inside the Snowflake. We know there can be multiple way to process the file e.g. Snowpipe, Conventional COPY command etc. However, for our USE case we will connect AWS GLUE with SNOWFLAKE and ingest the file via GLUE aka SPARK code.
Integrating the two solutions enable customers to manage their data ingestion and transformation pipelines with more ease and flexibility. With AWS Glue and Snowflake, customers get the added benefit of Snowflake’s query pushdown which automatically pushes Spark workloads, translated to SQL, into Snowflake
To connect GLU with SNOWFLAKE, following Prerequisites needs to be in place.
- Two Jars file.
- A Bucket in AWS region
- Copy the above JAR files to the S3 bucket.
Please see the below steps we have performed in AWS Glue to connect with Snowflake:
- Goto AWS Glue Service and create a new JOB.
- Expand Script libraries and job parameters:
Under Dependent jars path, add entries for both .jar files
- Click Next again, then click Finish and prompted with a blank script interface.
- Paste the following Script in the Interface.
from pyspark.sql import SparkSession
from pyspark import SparkContext
spark = SparkSession \
.builder \
.appName("GLUEWITHSF") \
.getOrCreate()
def main():
SNOWFLAKE_SOURCE_NAME = "net.snowflake.spark.snowflake"
snowflake_options = {
"sfUrl": "",
"sfUser": "sachinsnowpro",
"sfPassword": "xxxxxxx",
"sfDatabase": "DEMO_DB",
"sfSchema": "PUBLIC",
"sfWarehouse": "COMPUTE_WH",
"sfRole" : "ACCOUNTADMIN"
}
df = spark.read.csv("s3://gluemaskingdestfeed/Invoice_mask.csv")
df.write.format(SNOWFLAKE_SOURCE_NAME) \
.options(**snowflake_options) \
.option("dbtable", "GLUE_TBL_DF").mode("overwrite") \
.save()
main()
- Save and Run the Job.
- Login to the Snowflake and you see data gets ingested into the Table:
| https://cloudyard.in/2021/12/aws-glue-connect-with-snowflake/ | CC-MAIN-2022-33 | refinedweb | 293 | 56.86 |
this is my sample code:
---
from SQLObject import *
conn = MySQLConnection(user='abc', db='abook', passwd='def')
class Person(SQLObject):
_connection = conn
firstName = StringCol()
lastName = StringCol()
#Person.createTable()
p1 = Person.new(firstName="Frodo", lastName="Baggins")
p2 = Person(firstName="Bilbo", lastName="Baggins")
---
creating p1 works fine and Frodo is inserted into the database.
but Bilbo does not work. but according to the Documentation it should
work if I understand this correctly.
I get this error:
p2 = Person(firstName="Bilbo", lastName="Baggins")
TypeError: __new__() got an unexpected keyword argument 'lastName'
I have Python 2.3.3
and a SQLObject Snapshot I downloaded a few days ago.
but I am not sure if this is the correct version. the documentation says
0.6, but setup.py says 5.1
any hints ?
I am quite new to SQLObject, so maybe I just did not understand
everything correctly.
regards
Markus
Thanks for SQLObject, it's great!
I have used SQLObject with one project and I am working on my second. Still,
I am rather new to Python and totally new to SQLobject so excuse me if this
question is dumb.
I am looking for a way to created a table from a list of values. Say I have:
headers = ['bbd_id', 'co_name1', 'address1', 'address2', 'city',
'state', 'zip5', 'zip4', 'first_name', 'surname', 'telephone']
Is there a way to define my class attributes from this list?
I tried playing with the _columns like this:
#.....snip...does not work......
class mail_list(SQLObject):
def __init__(self, headers):
for h in headers:
self._columns.append("StringCol("+h+")")
mail_list.createTable()
#....snip
But I was unsure on how to pass headers while initiating the class with
'createTable'. I end up with a table with only one field, id. Is there a way
to inherit these values from elsewhere?
Then I have made a string of arguments to use when initialize the new
instance:
new_values = "bbd_id='1', co_name1='big corp', address1='123
AnyStreet', address2='', city='Sample', state='ST', zip5='12345',
zip4='9999', first_name='Bob', surname='Villa', telephone='555-1212'"
I plan on simply creating each row with the string:
row = mail_list.new.new(new_values)
Thanks in advance for any help.
SQLObject-0.5.2
Python 2.3 | https://sourceforge.net/p/sqlobject/mailman/sqlobject-discuss/?viewmonth=200408&viewday=18 | CC-MAIN-2017-43 | refinedweb | 361 | 59.7 |
Getting started with React Router v4 of the application is needed and this is typically achieved by using a router. In the React ecosystem, React Router is the most popular choice for implementing routing.
This article will take you through some of the most important concepts in React Router by showing how to build a simple portfolio website that uses the library to navigate through its pages.
What we’ll be building
You can view the completed version of the site here. The code used in this tutorial can be found on GitHub.
Before you continue, note that this tutorial assumes prior experience with writing React applications.
Installation and setup
To get started, we will install create-react-app for bootstrapping our application.
npm install -g create-react-app
If you’re not familiar with create-react-app, it is a quick and easy way to get started with building React applications without messing around with configuring build tools such as Webpack and Babel. You can find out more on its GitHub repository.
Next, create a new app, change into the app’s directory and start the app in development mode.
create-react-app portfolio cd portfolio npm start
You can open to preview it in the browser.
Next, we need to install React Router. In version 4, the library was broken down into 2 packages:
react-router-dom and
react-router-native.
Since we’re building this app for the browser,
react-router-dom is what we will install and import from. If you’re working with React Native, you’ll want to use
react-router-native instead.
npm install --save react-router-dom
Choosing a router
When working in a browser environment, React Router provides two Routers for your consumption:
BrowserRouter and
HashRouter. You need to decide which one to use when starting your project and your choice will mostly depend on your server architecture.
BrowserRouter is the recommended default but it may require additional server configuration to handle dynamic requests.
HashRouter is not suitable for all situations, but it can be a good solution for static websites.
For this tutorial, we will use
BrowserRouter as our Router of choice.
Change to the
src folder inside the portfolio directory, open up the
index.js file contained therein and import
BrowserRouter into scope below the other imports:
import { BrowserRouter } from 'react-router-dom';
You can only pass a single child element to a Router, so it is necessary to create a root component that renders the rest of your application and then pass that in as the child of the Router.
create-react-app already provides an
App component for this purpose. We need to place the
App component inside the
BrowserRouter so that routing can work for the entire application.
Change your
index.js file to look like this:
import React from 'react'; import ReactDOM from 'react-dom'; import App from './App'; import { BrowserRouter } from 'react-router-dom'; ReactDOM.render(( <BrowserRouter> <App /> </BrowserRouter> ), document.getElementById('root'));
That’s it. We can now concentrate on building up our app.
Adding the styles
Before we start implementing the routes, open up
App.css and replace its contents with the following styles:
html { box-sizing: border-box; } *, *::before, *::after { box-sizing: inherit; padding: 0; margin: 0; } .app { width: 960px; margin: 0 auto; padding: 20px; } nav ul { list-style: none; display: flex; background-color: black; margin-bottom: 20px; } nav ul li { padding: 20px; } nav ul li a { color: white; text-decoration: none; } .current { border-bottom: 4px solid white; } h1 { margin-bottom: 20px; } p { margin-bottom: 15px; }
Application structure
Open up
App.js in your editor and change it to look like this:
import React from 'react'; import './App.css'; const App = () => ( <div className='app'> <h1>React Router Demo</h1> <Navigation /> <Main /> </div> ); export default App;
The
App component references two other components:
Navigation which will display the navigation menu, and
Main which will display the contents of each view.
On a real project, you will want to create a new file for each component but, to simplify things here, we will put all the other components into the
App.js file.
Creating the navigation menu
The way you specify navigation links in React Router is not by using the anchor tag and passing in the path via its
href attribute as you’re probably used to.
Instead we use the
NavLink component which was created for this purpose.
NavLink helps us conditionally add styling attributes to the rendered element if it matches the current URL. It is a special version of the
Link component which no longer does conditional styling as of version 4.
Import
NavLink into scope first:
import { NavLink } from 'react-router-dom';
Then create the
Navigation component just below the
App component.
const Navigation = () => ( <nav> <ul> <li><NavLink to='/'>Home</NavLink></li> <li><NavLink to='/about'>About</NavLink></li> <li><NavLink to='/contact'>Contact</NavLink></li> </ul> </nav> );
Creating routes
To create a route, we will make use of the
Route component whose basic responsibility is to render some component when a URL matches the
Route‘s path.
A route can be placed anywhere inside the Router. The
Route component will render to wherever it was written if the route matches.
You can also group multiple
Routes inside a
Switch component to render only the first child
Route that matches the current URL.
Go ahead and import the two components into scope:
import { NavLink, Switch, Route } from 'react-router-dom';
Next, create the
Main component just below
Navigation:
const Main = () => ( <Switch> <Route path='/' component={Home}></Route> <Route path='/about' component={About}></Route> <Route path='/contact' component={Contact}></Route> </Switch> );
Here, we have created three routes — one for each view of our application.
The
Route component expects a
path prop that describes the path that the route matches. If you do not specify a
path, the route will always match for any URL.
The
component prop is used to specify what component should be rendered when a route matches. There are two other props that can be used for this purpose as well:
render and
children. See the relevant documentation to understand the situations when either option is useful.
Creating the views
Let’s go ahead and create each of the components that hold the views for the site. Add the following chunk of code just above the
Main component.
const Home = () => ( <div className='home'> <h1>Welcome to my portfolio website</h1> <p> Feel free to browse around and learn more about me.</p> </div> ); const About = () => ( <div className='about'> <h1>About Me</h1> <p>Ipsum dolor dolorem consectetur est velit fugiat. Dolorem provident corporis fuga saepe distinctio ipsam? Et quos harum excepturi dolorum molestias?</p> <p>Ipsum dolor dolorem consectetur est velit fugiat. Dolorem provident corporis fuga saepe distinctio ipsam? Et quos harum excepturi dolorum molestias?</p> </div> ); const Contact = () => ( <div className='contact'> <h1>Contact Me</h1> <p>You can reach me via email: <strong>hello@example.com</strong></p> </div> );
All our view components simply return some JSX that will be rendered into the DOM when the routes for each component match the current URL.
If you preview the app now and click on the navigation links, you will notice that the
Home component is rendered for all routes.
This is because a
Route will match for any URL that contains its path by default. This is why
/ matches for both
/``about and
/contact. While this is the default behavior at the moment, it may change in future releases.
To have our routes render only when the path is an exact match on the URL, the
exact prop is required on each of our routes. We don’t need to pass in anything to
exact as it is a Boolean.
const Main = () => ( <Switch> <Route exact path='/' component={Home}></Route> <Route exact path='/about' component={About}></Route> <Route exact path='/contact' component={Contact}></Route> </Switch> );
The
exact prop helps to specify that we want to match the exact path that is provided in the
path prop. By adding this prop, we make sure each
Route is rendered only if an exact match is made.
Preview the app again and click each of the navigation links. You will see that the routes now work perfectly.
Highlight the current view
Our final task is to indicate the current view in the application on the navigation bar.
We can do this in two ways: by applying a set of styles to a
NavLink via its
activeStyle prop so that the style takes effect when it is active, or by setting a class on the element when it is active using the
activeClassName prop. You can then create the styles for that class in your CSS.
We will use the latter method to complete this task.
By default, the class name ‘active’ is applied to the active
NavLink without any need to specify the
activeClassName prop. If you’re OK with this, you can go ahead and create styles for that class in your CSS and everything should work just fine.
If you want to change the class applied to active
NavLinks, you can do so by setting the
activeClassName prop on the
NavLink instances and pass in the name of the class you prefer.
We also need to use
exact on the
NavLinks as well for the same reasons stated earlier.
const Navigation = () => ( <nav> <ul> <li><NavLink exactHome</NavLink></li> <li><NavLink exactAbout</NavLink></li> <li><NavLink exactContact</NavLink></li> </ul> </nav> );
Here we set the
activeClassName to
current. In our CSS, a rule already exists for this class:
.current { border-bottom: 4px solid white; }
Now, if you preview the app again, you will see that a white border is applied to the bottom of the currently active link.
View the demo –
Wrap up
I hope this tutorial has helped you learn how you can use React Router to build your own SPAs. We successfully covered some of its major features in this article but keep in mind that these are only a subset of what the library provides.
The React Router Documentation provides excellent information about all components included in the library as well as working examples to get you started so make sure to check that out! | https://blog.pusher.com/getting-started-with-react-router-v4/ | CC-MAIN-2018-26 | refinedweb | 1,707 | 61.46 |
Thank so much
Is your rebar slab family a detail component meaning a 2D annotation, or a model element meaning a 3D object?
This family is a detail component by line
Provide an rvt including the family and dyn files and we can help as the detail component by curve pretty much always works.
File revit 2020:
File Dynamo: Place Detail Component Floor Rebar.dyn (25.6 KB)
File Revit have 2 view: Source and Result
Do you have a 2019 version of this family by any chance?
File Revit 2019:
Thank you so much
Well, I have it figured out. Your curve isn’t in the same plane as your view.
Feel free to follow along as I’m going to ‘teach a man to fish’ here so that you and others will be able to solve this stuff more readily in the future. Not all ‘fixes’ are this easy, but the concepts here are good ‘how to’ steps for resolving python based nodes in the future.
Start by opening the DetailComponent.ByCurve node in the Clockwork package (double click on it to do so), select the useful bits (anything that isn’t an input or output node), switch back to the active dyn document and paste them in. You can then remove some of the ‘no longer necessary’ stuff like turn into list, and the like.
Once that was done you can pretty easily see that the issue starts (and continues) with the Python code which @Andreas_Dieckmann was using. Making a few easy edits to it as per this post by @Konrad_K_Sobon will allow us to understand what is going wrong.
Side note, we owe both of these guys some thanks for the accessible content and documentation which they continue to provide the larger community.
# Original Code by Andreas Dieckmann # # edited by Jacob Small, following the instructions in this post: # import clr clr.AddReference('RevitAPI') from Autodesk.Revit.DB curves = UnwrapElement(IN[0]) famtype = UnwrapElement(IN[1]) view = UnwrapElement(IN[2]) version = IN[3] elementlist = list() counter = 0 TransactionManager.Instance.EnsureInTransaction(doc) for curve in curves: if version > 2015: if not(famtype.IsActive): famtype.Activate() try: # added line to set error report to none if there is no failure. errorReport = None newobj = doc.Create.NewFamilyInstance(curve.ToRevitType(),famtype,view) elementlist.append(newobj.ToDSType(False)) except: # revised except lines to import the traceback and set the error report acordingly. import traceback errorReport = traceback.format_exc() TransactionManager.Instance.TransactionTaskDone() # updated the output to include a list of the elements and the traceback OUT = [elementlist,errorReport]
That edit allows access to the resulting element list, as well as the error report for anything which fails in the output results. Reviewing that error report, the reason behind the failureis pretty straight forward:
Traceback (most recent call last): File "<string>", line 30, in <module> Exception: The line is not in the plane of view. Parameter name: line
With that bit of knowledge, it’s pretty clear what you have to do: move the curve onto the same plane as the view. From here on out this is basic Dynamo, just a matter of finding the right nodes.
Fortunately we have a handy node also in the Clockwork package that we can leverage to find out what plane the linework needs to be on: the View.Plane node. There is also and an out of the box node called Curve.PullOntoPlane which will adjust the curve geometry and location as needed. Your actual use case may require a few tweaks to stuff like list lacing and levels.
From there things should just work with the old node, no edits required and you don’t even have to make a new custom node, or maintain the python in the .dyn.
I’ll make an issue on the Clockwork package’s GitHub repo tomorrow, which will included the code above so that if he thinks that it would be worthwhile then Andreas can update the package to include that error handling.
I’m a newbie, i think it very helpful for all.
Thanks
Glad I could help.
I have a little question: How can I find a node (View.Plan), I seach ViewPlan and PlanView, but it dont show. I went into ClockWork to get it out, but it took more time. Do you have any trick?
I’m try, it’s very well, but I have a question more, Why I active view “Source”, node “Active view” return result is “Result”
Not sure - where are you seeing this node and what are you expecting it to do?
I can’t comform, but this is likely because you ran the graph before changing the view. Nodes only update their results if their inputs change. This keeps you from having to recalculate every node on the canvas as you build your graph. Try disconnecting and reconnecting the inputs to get it to update.
I think I need re-open file after each run to update Active view.
Disconnect the input from the current document input. Run the graph. Reconnect the document input. Run the graph.
Or, add a boolean switch in a code block to flip between the document and the document. If you need help with this option start a new topic as these are pretty far off the original request.
I am developing this file, but I have 2 unsolved questions.
Hi,
I’m following ur instruction but i got this error in python script :
“Warning: IronPythonEvaluator.EvaluateIronPythonScript operation failed.
Traceback (most recent call last):
File “”, line 32, in
ImportError: No module named traceback”
any idea how to fix it?
Use this just under
import clr…
import sys pyt_path = r'C:\Program Files (x86)\IronPython 2.7\Lib' sys.path.append(pyt_path)
This should fix it.
thank .
now i got this warning:
IronPythonEvaluator.EvaluateIronPythonScript operation failed.
unexpected token ‘pyt_path’
Hi @rinag, without showing your code it’s hard for me to determine your issue.
EDIT: Apologies, after looking at my first reply again, I seems like I have formatted the code wrong, looked ok on mobile.
It should have read…
import sys pyt_path = r'C:\Program Files (x86)\IronPython 2.7\Lib' sys.path.append(pyt_path)
This is why it failed. However, please use this snippet of code for reference for traceback example…
""" Description: Traceback example catching Divide by Zero Exception. Author: Dan Woodcock Website: Licence: N/A """ ##### Imports ##### import clr # Add IronPython Path to sys.path. This will expose additional IronPython Modules... import sys pyt_path = r'C:\Program Files (x86)\IronPython 2.7\Lib' sys.path.append(pyt_path) # Import traceback module... import traceback ##### Inputs ##### a = IN[0] # Input any Number... b = IN[1] # Make this Zero to see traceback error... ##### Main Script ##### # Try divide by zero. We know this will fail and trigger the traceback... try: OUT = a/b except: # Return Traceback.... OUT = traceback.format_exc()
Hope this helps.
D | https://forum.dynamobim.com/t/why-cant-i-place-detail-component-by-curve/41252/13 | CC-MAIN-2022-40 | refinedweb | 1,144 | 65.22 |
No "too late" notification from timekpr-client
Bug #1055703 reported by Roman Bazalevsky on 2012-09-24
This bug affects 1 person
Bug Description
For example, if you set user time boundaries to "from 8 to 22", you will receive "too early" notification when you login as 7, but you will not receive any message, when you logging in at, lets say, 22:30, you will be just kicked off by daemon.
In timekprcommon.py we see:
def islate(bto, allowfile):
. . .
if (hour > bto[index]):
if isfile(allowfile):
. . .
So you will get notification only 1 hour after time boundary (i.e. in 23:00, if boundary is set to 22:00).
Shoud be replaced with:
if (hour >= bto[index]):
Olli-Pekka Wallin (hozmaster) on 2012-10-26 | https://bugs.launchpad.net/timekpr/+bug/1055703 | CC-MAIN-2020-34 | refinedweb | 127 | 69.41 |
Explain IIFE(Immediately Invoke Function Expression) Like I'm Five
Latheresienne
・1 min read
Classic DEV Post from Jan 8
Analogy:
IIFE
Ask friend for the WIFI password, use it immediately, forget about the password afterward.
Normal Function
Ask friend for the WIFI password, writes it on a piece of paper, paste on the wall, everyone knows it.
What's the point of IIFE?
The IIFE is a javascript design pattern invented in the days before modules was introduced in ES6, and people wanted to run a piece of code only once, like a setup code, without polluting the global namespace.
e.g.
Thanks for the explanation😃
IIFE:
Plate goes on the table and a fork full of food immediately goes into your mouth.
Normal Function:
Plate goes on the table and you must wait until Mom tells you to each fork full.
IIFEs are functions that are run immediately without the need to be called from somewhere else.
Normal functions need to be called before they are run.
Nice approach with food 😋. Thanks for thé explanation.
You’re welcome
IIFE:
An item you put on your to-do list and then do right away.
Normal function:
An item you put on your to-do list and you'll get to it later.
An IIFE is nothing more than a function that is called once and it's called right away.
They used to be big back in the day to avoid variable scoping issues:
The above
secretvariable is in the
windowscope, so it is accessible anywhere in the runtime. Changing to use an IIFE, it put the variable in the function's scope, meaning it cannot be accessed outside the function:
`
Thanks for the explanation. Your approach with a to-do list is just great!
Normally we create a function, then call it later on:
It turns out we can also call a function immediately following its definition:
I the above code sample, we define the function
helloand call it immediately, passing in "Jennifer" as a parameter. It seems JavaScript can't properly parse this unless the function definition is wrapped in an extra set of parentheses - so that's what the extra parentheses are for.
This type of self-calling function, an IIFE, executes once and that's it. You can't call it separately - note the function is not visible when we try
hello(“Tom”). The name of the function can also be omitted. You'll often see IIFEs in this anonymous form:
IIFEs were used in the old days of JavaScript, mostly to create namespaces - the code inside the IIFE is isolated from the outside world, none of its variables can be seen from outside the IIFE (though global variables are still visible from within the IIFE). This means variables that are defined inside the IIFE won't accidentally clobber any global ones that have the same name. That's what it means when people say the IIFE does not "pollute" the global namespace. This way only the return values from such a function are available for use.
I don't think you'd see this kind of thing so much anymore these days, since JavaScript supports modules natively with the import syntax nowadays.
Thanks for the explanation.
A more recent use of iife is to use async await.
The above changes the context of the block (the function body) to mean I can use await to grab data that may take some time to retrieve.
No IIFE: I buy food, we eat, then leave the dishes on the table.
IIFE: I buy food, we eat, then toss out the leftovers and put the dishes away.
I understand your function logic. Gitter done!!! Well spoken!!! | https://practicaldev-herokuapp-com.global.ssl.fastly.net/latheresienne/explain-iife-immediately-invoke-function-expression-like-i-m-five-57om | CC-MAIN-2019-43 | refinedweb | 619 | 69.41 |
I've searched the list archives about this, but did not find anything
relating to this problem when running svnserve on an internal server to
support a few developers. From what I see out of the ethernet traces,
no challenge is ever issued by the server for getting the user
identity.
Subversion is installed via the FreeBSD port on FreeBSD 4.9.
I've set up svnserve as per the book chapter. I run it with this
command:
su svn -c "svnserve -r /home/svn/repos --foreground -d"
the svnserv.conf file is this:
--cut here--
[general]
auth-access = write
anon-access = none
[users]
password-db = passwd
realm = Khera Communications
--cut here--
and the passwd file is just this for testing purposes:
--cut here--
[users]
khera = khera
--cut here--
the passwd file is readble by the svn user and group. The entire
repository is owned by the svn user and is writable -- the cvs2svn
import accessed it fine, and if I enable anon-access are read only in
the conf file, I can check out the project.
when I try to check out an imported project, I get this error:
% svn co svn://yertle/testproject/trunk testproject
svn: No access allowed to this repository
Tracing the wire, I see these exchanges between the server and client:
>> "( success ( 1 2 ( ANONYMOUS ) ( edit-pipeline ) ) ) "
<< "( 2 ( edit-pipeline ) 30:svn://yertle/testproject/trunk ) "
>> "( failure ( ( 170001 36:No access allowed to this repository
27:subversion/svnserve/serve.c 1029 ) ) ) "
isn't the server supposed to issue some sort of challenge to the client
when it needs authenticated access?
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Vivek Khera, Ph.D. Khera Communications, Inc.
Internet: khera@kciLink.com Rockville, MD +1-301-869-4449 x806
AIM: vivekkhera Y!: vivek_khera
---------------------------------------------------------------------
To unsubscribe, e-mail: users-unsubscribe@subversion.tigris.org
For additional commands, e-mail: users-help@subversion.tigris.org
Received on Tue Mar 9 18:15:30 2004
This is an archived mail posted to the Subversion Users
mailing list.
This site is subject to the Apache Privacy Policy and the Apache Public Forum Archive Policy. | https://svn.haxx.se/users/archive-2004-03/0697.shtml | CC-MAIN-2022-33 | refinedweb | 342 | 60.95 |
Hi community,
I fight again serval problems for many days. I hope, you can help me to find the reason. The symptoms are that no events of these electrons recieved my application and the Particle console. I have a python app which waits for events using SSE. This interface works. The problem must be at the electron side. I have running 4 electrons in a field test. So I can not really produce logs which could help me and I cannot watch them the whole time. I only see the physical status when I detected that their is no event for some hours. Sometimes the status led is off, sometimes it breathe white and sometimes i flash green forever (I waited maximum 10 minutes before I tried a reset. After reset, the system works again for a few hours. Then the same issue is there.)
First I thought, it could be the current problem of a Particle service (topic "Electron won’t publish events") because sometimes I had the issue of fast cyan flashing with red flashes. After Particle's fix, this disappeared but the main problem is still there.
Second I thought, it could be the "String - heap" problem because the problems appears irregular after a few hours or some days. So I replaced all strings with char arrays. But this doesn't change anything.
Third I thought it could be a problem, that I don't always have a Cellular.on() before my System.sleep(...DEEP...) and I use the semi automatic mode. So I put the Cellular.on() before the sleep command, but this also didn't help against the problem. I have Particle SIM cards.
The code on my electrons do the following:
On the whole, it is a temperatur sensor which publish the measurement in 2 hour intervals. The python app generates alertings and does other stuff. The alterting thresholds are saved on the electron via cloud function. So the electron publish immediately (before the 2h interval) when the threshold/border is breaked.
My english is not the best, so maybe the terms are wrong
This is my code (without Serial prints):
#include "SparkJson/SparkJson.h"
#include "SHT1x/SHT1x.h"
#include "OneWire/OneWire.h"
#include "math.h"
PRODUCT_ID(XXXX);
PRODUCT_VERSION(X);
SYSTEM_MODE(SEMI_AUTOMATIC);
OneWire ds = OneWire(D4);
FuelGauge fuel;
const unsigned long timeToSleep = 60 * 15; // 15 minutes
const int size_of_queue = 8; // reserve var * 4 bytes for addresses = 2 hours
const int steps_to_force = size_of_queue * 1; // force sending after 2 hours
int address_counter_force = 10;
int address_tempDS = 20;
int address_tempSH = 70;
int address_humiSH = 120;
int address_soc = 220;
int address_tempDS_max = 270;
int address_tempDS_min = 320;
int address_tempSH_max = 370;
int address_tempSH_min = 420;
int address_humiSH_max = 470;
int address_humiSH_min = 520;
float tempDS_array[size_of_queue];
float tempSH_array[size_of_queue];
float humiSH_array[size_of_queue];
float soc_array[size_of_queue];
// default values of borders to avoid RTEs
float ds_temp_max = 0;
float ds_temp_min = 0;
float sh_temp_max = 0;
float sh_temp_min = 0;
float sh_humi_max = 0;
float sh_humi_min = 0;
int current_counter_force = 0;
bool border_crashed = false;
char publishDString[80];
char publishSString[80];
char publishHString[80];
char publishPString[80];
char* latitude;
char* longitude;
SHT1x sht1x(0, 1); // dataPin, clockPin
void setup() {
Cellular.off();
Particle.function("borders", saveBorders);
}
int saveBorders(String json) {
// parse string
int lastFound = -1; // needed to get first char
int currentFound = 0;
int step = 0;
float borders[6];
while(currentFound != -1) {
currentFound = json.indexOf("|", lastFound + 1);
if(currentFound != -1) {
borders[step] = json.substring(lastFound + 1, currentFound).toFloat();
lastFound = currentFound;
step++;
}
}
if(currentFound == -1 && step == 0) return -1; // if no | is found, return error.
ds_temp_max = borders[0];
ds_temp_min = borders[1];
sh_temp_max = borders[2];
sh_temp_min = borders[3];
sh_humi_max = borders[4];
sh_humi_min = borders[5];
EEPROM.put(address_tempDS_max, ds_temp_max);
EEPROM.put(address_tempDS_min, ds_temp_min);
EEPROM.put(address_tempSH_max, sh_temp_max);
EEPROM.put(address_tempSH_min, sh_temp_min);
EEPROM.put(address_humiSH_max, sh_humi_max);
EEPROM.put(address_humiSH_min, sh_humi_min);
return 1;
}
float average(float * array, int len) {
float sum = 0.0 ;
for (int i=0; i<len; i++) {
sum += array[i];
}
return sum / len;
}
void loop(void) {
byte i;
byte present = 0;
byte type_s;
byte data[12];
byte addr[8];
float tempDS, tempSH, humiSH, batterySOC;
if (!ds.search(addr)) {
ds.reset_search();
delay(250);
return;
}
if (OneWire::crc8(addr, 7) != addr[7]) {
return;
}
type_s = 0;
ds.reset(); // first clear the 1-wire bus
ds.select(addr); // now select the device we just found
ds.write(0x44, 0); // or start conversion in powered mode (bus finishes low)
delay(1000); // maybe 750ms is enough, maybe not, wait 1 sec for conversion
present = ds.reset();
ds.select(addr);
ds.write(0xB8,0); // Recall Memory 0
ds.write(0x00,0); // Recall Memory 0
present = ds.reset();
ds.select(addr);
ds.write(0xBE,0); // Read Scratchpad
for (i = 0; i < 9; i++) { // we need 9 bytes
data[i] = ds.read();
}
int16_t raw = (data[1] << 8) | data[0];
byte cfg = (data[4] & 0x60);
if (cfg == 0x00) raw = raw & ~7; // 9 bit resolution, 93.75 ms
if (cfg == 0x20) raw = raw & ~3; // 10 bit res, 187.5 ms
if (cfg == 0x40) raw = raw & ~1; // 11 bit res, 375 ms
tempDS = (float)raw * 0.0625;
// remove random errors
if(tempDS > 84.0) {
tempDS = tempDS_array[size_of_queue-2]; // take the last measured value instead of the error
}
// Read values from the SHT10 sensor
tempSH = sht1x.readTemperatureC();
humiSH = sht1x.readHumidity();
// Read values of battery
batterySOC = fuel.getSoC();
// routine to check a border crash
EEPROM.get(address_tempDS_max, ds_temp_max);
EEPROM.get(address_tempDS_min, ds_temp_min);
EEPROM.get(address_tempSH_max, sh_temp_max);
EEPROM.get(address_tempSH_min, sh_temp_min);
EEPROM.get(address_humiSH_max, sh_humi_max);
EEPROM.get(address_humiSH_min, sh_humi_min);
if(tempDS > ds_temp_max || tempDS < ds_temp_min || tempSH > sh_temp_max || tempSH < sh_temp_min || humiSH > sh_humi_max || humiSH < sh_humi_min) {
border_crashed = true;
}
// read EEPROM
EEPROM.get(address_counter_force, current_counter_force);
EEPROM.get(address_counter_admin, current_counter_admin);
EEPROM.get(address_tempDS, tempDS_array);
EEPROM.get(address_tempSH, tempSH_array);
EEPROM.get(address_humiSH, humiSH_array);
EEPROM.get(address_soc, soc_array);
// move every entry one position back
for(int n=0; n<size_of_queue; n++) {
tempDS_array[n] = tempDS_array[n + 1];
tempSH_array[n] = tempSH_array[n + 1];
humiSH_array[n] = humiSH_array[n + 1];
soc_array[n] = soc_array[n + 1];
}
tempDS_array[size_of_queue - 1] = tempDS;
tempSH_array[size_of_queue - 1] = tempSH;
humiSH_array[size_of_queue - 1] = humiSH;
soc_array[size_of_queue - 1] = batterySOC;
// store new values in EEPROM
EEPROM.put(address_tempDS, tempDS_array);
EEPROM.put(address_tempSH, tempSH_array);
EEPROM.put(address_humiSH, humiSH_array);
EEPROM.put(address_soc, soc_array);
// Need to do this to go in the correct sleep mode:
Cellular.on();
// dont send data every time. Store in EEPROM and send whole array sometimes.
if ((current_counter_force >= (steps_to_force - 1)) || border_crashed) { // "- 1" because counter starts with 0
EEPROM.put(address_counter_force, 0);
Cellular.connect();
waitUntil(Cellular.ready);
Particle.connect();
waitUntil(Particle.connected);
Particle.process();
// build transfer string
publishDString[0] = '[';
publishSString[0] = '[';
publishHString[0] = '[';
publishPString[0] = '[';
for(int i=0; i<size_of_queue; i++) {
if(i == (size_of_queue - 1)) { // last iteration -> closing brake]);
} else {]);
}
}
Particle.publish("tempSMS", String::format("{\"d\":\"%s\",\"s\":\"%s\",\"h\":\"%s\",\"p\":\"%s\",\"t\":\"%s\"}", publishDString, publishSString, publishHString, publishPString, String::format("%d", timeToSleep).c_str()), PRIVATE); // data max 255 bytes
Particle.process();
delay(10000); // wait 10sec for new borders
} else {
EEPROM.put(address_counter_force, current_counter_force + 1);
}
delay(1000); //can be removed with firmware 0.6.1
System.sleep(SLEEP_MODE_DEEP, timeToSleep - (millis() / 1000));
}
Can someone helps me? I'm very frustrated because I want to have a stable version of my application. At this point, the electrons stop working after some hours or sometimes after 2 days Maybe it is a very simple mistake of myself which results a lot of chaos
Best regards,Niklas
for(int n=0; n < size_of_queue; n++) {
tempDS_array[n] = tempDS_array[n + 1];
tempSH_array[n] = tempSH_array[n + 1];
humiSH_array[n] = humiSH_array[n + 1];
soc_array[n] = soc_array[n + 1];
}
isn't that loop supposed only to go to size_of_queue - 1?But I'd rather go for a circular buffer anyway rather tham having to shift the values through the array.
size_of_queue - 1
I'd also suggest you're using snprintf(buf, sizeof(buf), ...) rather than sprintf(buf, ...) especially when dealing with recursive string building
snprintf(buf, sizeof(buf), ...)
sprintf(buf, ...)
Thanks for your response.
isn't that loop supposed only to go to size_of_queue - 1?
Yes, you're right
But I'd rather go for a circular buffer anyway rather tham having to shift the values through the array.
I had this in my previous versions but the problem is, that I have to save my python app: which value is the recent one. With the queue, it is always the last element. With a circle, I need to publish this information, too.
I still have two String operations in the Particle.publish line. Could this results heap problems? If yes, how can I replace them with char arrays? The publish function needs a String as parameter, isn't it?
What I have changed:
[...]
for(int n=0; n<size_of_queue - 1; n++) {
tempDS_array[n] = tempDS_array[n + 1];
tempSH_array[n] = tempSH_array[n + 1];
humiSH_array[n] = humiSH_array[n + 1];
soc_array[n] = soc_array[n + 1];
}
[...]
for(int i=0; i<size_of_queue; i++) {
if(i == (size_of_queue - 1)) { // last iteration -> closing brake]);
} else {]);
}
}
[...]
I will flash this on my devices and will hope I will give you a report.
Thanks,Niklas
Why? If you start building your transfer string from the tail the head value will always be the last to be added to the string.You just do the indexing like this
strcpy(buf, "[");
for(int i=0; i<size_of_queue; i++) {
strncat(buf, val[(tail + i) % size_of_queue], sizeof(buf));
strncat(buf, (i < size_of_queue-1) ? "," : "]", sizeof(buf));
}
Nope, Particle.publish() has also an overload that takes const char*.So you'd just write
Particle.publish()
const char*
char pubData[256];
snprintf(pubData, sizeof(pubData)
,"{\"d\":\"%s\",\"s\":\"%s\",\"h\":\"%s\",\"p\":\"%s\",\"t\":\"%d\"}"
,publishDString
,publishSString
,publishHString
,publishPString
,timeToSleep
);
Particle.publish("tempSMS", pubData, PRIVATE); // data max 255 bytes
Why? If you start building your transfer string from the tail the head value will always be the last to be added to the string.
Yes your right. I didn't think in this direction. So I will replace the queue with a circle, if I solved the other problems.
I flashed the new firmware without any String on 4 Electrons to run the test. Two works perfectly, until now wait for another day.
The two others have a new strange issue. When the electron tries to connect to the mobile network and cloud, it fails. It starts flashing green for a long time. After round about 5 minutes, a white flash appears (looks like a reboot) and the green flash continues. In 50% of the cases, after a manual reset or 1-3 of this self-reboots, it starts flashing cyan after 1 minute if green flashing.
These cyan flashes takes 1 minute, then the fast cyan flashing starts for different durations. It is interrupeted by red flashes. Sometimes only one red flash, sometimes many (~10) flashes but never a SOS pattern. After the red flash, it starts cyan flash (fast or slow) again.
I also flashed a simple firmware which do only clear the EEPROM and do nothing else (automatic mode) -> same issue pattern So I don't think my software is the root of the errors?
Hope you understand the steps. I tried to make a video but the flashes are bad recorded.
-Niklas
Flashing cyan with red blips sounds like a keys issue. Have you tried running particle keys doctor using the Particle CLI?
particle keys doctor
ScruffR give me the hint that my green later white issue seems to indicate some issue with the power supply. The SOC was ~40%, but maybe this was false because I sometimes get SOC higher than 100% from some Electrons. I have the 2G version of the Electron (SARA-G350).
Following the hints of @will and @ScruffR I did the following:
particle keys server
particle keys doctor [ElectronID]
Then it flashes green for ~30s, flashes cyan, fast flashes cyan for ~10s, one red flash, fast flashes cyan for ~5s, breaths cyan. The second and third try works, too.
What could be the reason that the keys get confused? What can I do, that this won't happen again?
@Niklas Are you using any code to prevent the Electron from running the battery down past 10 - 20% SOC which can prevent various issues that can happen when the Electron runs on a low or dead battery.
@RWB Yes that is one of my learnings which is now on the to-do list. Maybe this is possible with the onboard power management unit and its functions. But first I have to read the docs.
What I am also wondering about is that a full loaded LiPo only has a SOC of 80-90% and no 100%. I know how hard it is to calculate a SOC but my feelings says that there could be a default options with prevent a loading up to 100% because this could shorten the LiPo's lifetime. Have somebody made the same experience of an maximum SOC of 80-90%?
Here is the code I'm using after months of testing a Electron running off the 2000mAh battery + a 3w / 5v solar panel outside. You can use the same code to prevent your Electrons from crashing from low battery voltage.
SYSTEM_MODE(SEMI_AUTOMATIC);
//SYSTEM_THREAD(ENABLED);
// This #include statement was automatically added by the Particle IDE.
#include "Ubidots/Ubidots.h"
#define TOKEN "Token Here" // Put here your Ubidots TOKEN
#define DATA_SOURCE_NAME "ElectronSleepNew"
SerialLogHandler logHandler(LOG_LEVEL_ALL); //This serial prints system process via USB incase you need to debug any problems you may be having with the system.
Ubidots ubidots(TOKEN); // A data source with particle name will be created in your Ubidots account
int button = D0; // Connect a Button to Pin D0 to Wake the Electron when in System Sleep mode.
int ledPin = D7; // LED connected to D1
int sleepInterval = 60; // This is used below for sleep times and is equal to 60 seconds of time.
ApplicationWatchdog wd(660000, System.reset); //This Watchdog code will reset the processor if the dog is not kicked every 11 mins which gives time for 2 modem reset's.
void setup() {
//Serial.begin(115200);
pinMode(button, INPUT_PULLDOWN); // Sets pin as input
pinMode(ledPin, OUTPUT); // Sets pin as output
ubidots.setDatasourceName(DATA_SOURCE_NAME); //This name will automatically show up in Ubidots the first time you post data.
PMIC pmic; //Initalize the PMIC class so you can call the Power Management functions below.
pmic.setChargeCurrent(0,0,1,0,0,0); //Set charging current to 1024mA (512 + 512 offset)
pmic.setInputVoltageLimit(4840); //Set the lowest input voltage to 4.84 volts. This keeps my 5v solar panel from operating below 4.84 volts.
}
void loop() {
FuelGauge fuel; // Initalize the Fuel Gauge so we can call the fuel gauge functions below.
if(fuel.getSoC() > 20) // If the battery SOC is above 20% then we will turn on the modem and then send the sensor data.
{
float value1 = fuel.getVCell();
float value2 = fuel.getSoC();
ubidots.add("Volts", value1); // Change for your variable name
ubidots.add("SOC", value2);
Cellular.connect(); // This command turns on the Cellular Modem and tells it to connect to the cellular network.
if (!waitFor(Cellular.ready, 600000)) { //If the cellular modem does not successfuly connect to the cellular network in 10 mins then go back to sleep via the sleep command below. After 5 mins of not successfuly connecting the modem will reset.
System.sleep(D0, RISING,sleepInterval * 2, SLEEP_NETWORK_STANDBY); //Put the Electron into Sleep Mode for 2 Mins + leave the Modem in Sleep Standby mode so when you wake up the modem is ready to send data vs a full reconnection process.
}
ubidots.sendAll(); // Send fuel gauge data to your Ubidots account.
digitalWrite(ledPin, HIGH); // Sets the LED on
delay(250); // waits for a second
digitalWrite(ledPin, LOW); // Sets the LED off
delay(250); // waits for a second
digitalWrite(ledPin, HIGH); // Sets the LED on
delay(250); // waits for a second
digitalWrite(ledPin, LOW); // Sets the LED off
System.sleep(D0, RISING,sleepInterval * 2, SLEEP_NETWORK_STANDBY); //Put the Electron into Sleep Mode for 2 Mins + leave the Modem in Sleep Standby mode so when you wake up the modem is ready to send data vs a full reconnection process.
}
else //If the battery SOC is below 20% then we will flash the LED 4 times so we know. Then put the device into deep sleep for 1 hour and check SOC again.
{
//The 6 lines of code below are needed to turn off the Modem before sleeping if your using SYSTEM_THREAD(ENABLED); with the current 0.6.0 firmware. It's a AT Command problem currently.
//Cellular.on();
//delay(10000);
//Cellular.command("AT+CPWROFF\r\n");
//delay(2000);
//FuelGauge().sleep();
//delay(2000);
System.sleep(SLEEP_MODE_DEEP, 3600); //Put the Electron into Deep Sleep for 1 Hour.
}
}
This is normal and has to do with the fuel gauge chip wanting higher charged voltages to read 100%. Normally I get 82-86% when the battery is fully charged to 4+ volts. You can use the scale function to scale the battery SOC from 0-86 to 0-100% if you desire.
Hello @RWB
"The 6 lines of code below are needed to turn off the Modem before sleeping if your using SYSTEM_THREAD(ENABLED); with the current 0.6.0 firmware. It's a AT Command problem currently."
I want to know whether this has already corrected in version 0.6.1?
Not sure, you will have to check the 6.1 firmware notes.
@RWBThanks for your information. I will test parts of your code in my system.
@will @ScruffRMy systems are running for two days now. See it's stable now You are all great!
@RWB
I just see at this moment what cool stuff you did with your posted code. It helps me very much in my dev process. For example debugging without tinker or the intelligent way of handle connection fails.
Thank you for this | https://community.particle.io/t/again-and-again-individual-failures-of-electrons/29323/10 | CC-MAIN-2017-26 | refinedweb | 2,929 | 58.58 |
From: Darin Adler (darin_at_[hidden])
Date: 2000-01-24 13:31:03
> IMO, the best resolution is a change to the Standard, allowing overloading
> of functions in namespace std as long as the same semantics were preserved.
> This would allow us to always use explicit qualification. Has this been
> presented as an issue to the working group yet?
I agree.
And no, I don't think anyone has submitted a defect report to the library
working group about this yet.
-- Darin
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk | https://lists.boost.org/Archives/boost/2000/01/1910.php | CC-MAIN-2020-05 | refinedweb | 103 | 68.36 |
C++ programs that use the size() function to get the length of a string. This is just an alias of length(). std::string::length · Parameters none · Return Value The number of bytes in the string. Example 1 · Complexity C++98 · Iterator validity No changes. C++ String class has length() and size() function. These can be used to get the length of a string type object. specific part of a string we use the erase the.
Substring C++
How to count number of substrings with exactly k distinct characters. Let’s have a look at the problem statement. Given a string of lowercase alphabets, count all possible substrings (not necessarily distinct) that have exactly k distinct characters.
For example, for input string “abc” and k=2, the output will be 2 as we can have 2 possible substrings with exactly k distinct characters: ab and bc. For input string “aba” and k=2, the output will be 3 as we can have 3 possible substrings with exactly k distinct characters: ab, ba and aba.
For input string “aa” and k=1, the output will be 3 as we can have 3 possible substrings with exactly k distinct characters: the first a, the second a, and aa. Now let’s have a look at the solution.
First method is brute force method.n) to generate all substrings and O(n) to do a check on each one. Thus overall it would go O(nnn). The problem can be solved in O(n*n).
Idea is to maintain a hash table while generating substring to store count of each character and checking the number of unique characters using that hash table. Let’s have a look at the implementation.
We assume that the input string contains only characters from small ‘a’ to small ‘z’. We calculate n= str.length() which is the length of our input string. We initialize result as 0.
We create count array cnt to store count of characters from ‘a’ to ‘z’. Hence, the size of the array is 26, for the 26 alphabets. Then to generate substrings, we use 2 loops. In the first loop, i goes from 0 to n and in the inner loop j goes from i to n.
Also, we set dist_count: the count of distinct characters as 0 and initialize count array with 0. Then when we enter the loop we check If str[j] is a new character for the substring, i.e. cnt[str[j] – ‘a’] is 0 then increment dist_count. Also, Increment count of current character as cnt[str[j] – ‘a’]++.
If distinct character count becomes k, then we do result++. Finally we will return the value of result The time complexity of this solution is O(n2) as there are 2 loops in it.
Strlen C++
C++ strlen() is an inbuilt function that is used to calculate the length of the string. It is a beneficial method to find the length of the string. The strlen() function is defined under the string. h header file.
How do I use strlen in C++: The header file <string. h> . In C++, including <string. h> places strlen into the global namespace, while including <cstring> instead places strlen into the std namespace.
Used: strlen() function in C++ returns the length of the given string
Array Length C++
sizeof() operator can be used to find the length of an array. A program that demonstrates the use of the sizeof operator in C++
Finds size of arr[] and stores in ‘size‘ int size = sizeof(arr)/sizeof(arr[0]);.
size() function is used to return the size of the list container or the number of elements in the list container. Syntax : arrayname.size()
Used:
- #include <iostream>
- using namespace std;
-
- int main() {
- int arr[] = {10,20,30,40,50,60};
- int arrSize = sizeof(arr)/sizeof(arr[0]);
- cout << “The size of the array is: ” << arrSize;
- return 0;
How to find length of string in C++
determine the number of elements in the array, we can divide the total size of the array by the size of the array element. You could do this with the type, like this: int a[17]; size_t n = sizeof(a) / sizeof(int);
- Using
sizeof()
sizeof()
- Using pointer arithmetic
int arrSize = *(&arr + 1) - arr;
#include <iostream> using namespace std; int main() { int arr[] = {10,20,30,40,50,60}; int arrSize = *(&arr + 1) - arr; cout << "The length of the array is: " << arrSize; return 0; }
C++ string length vs size
Length() returns the number of characters in the string and size() returns a size_t which is also the same but used to make it consistent with other STL containers. For computing length() , the string iterates through all the characters and counts the length.
size_type size() const noexcept;
Returns: A count of the number of char-like objects currently in the string. Complexity: Constant time.
And
size_type length() const noexcept;
// string::length #include <iostream> #include <string> int main () { std::string str ("Test string"); std::cout << "The size of str is " << str.length() << " bytes.\n"; return 0; }
string::size C++
std::string::size · Parameters none · Return Value The number of bytes in the string. C++ String size() · Syntax Consider a string object named as ‘str’.
Given your array of strings, you can most certainly use
sizeof(array)/sizeof(array[0]) to get its size and the following program works just fine:
int main() { std::string array[] = { "S1", "S2", "S3" }; std::cout << "A number of elements in array is: " << sizeof(array)/sizeof(array[0]) << '\n'; foo(array); }
It is not clear what do you mean by saying that size of elements vary. Size of the elements of any array is always known at compiler-time, no exceptions.
There are, however, situations where the above will not work. Consider the following example:
void foo(std::string array[]) { std::cout << "A number of elements in array is: " << sizeof(array)/sizeof(array[0]) << '\n'; }
The above code is doomed to fail. It might look a bit weird at first, but the reason for this is actually very simple — this is called array decaying. It means that every time you pass an array to a function, its type is automatically decayed to that of a pointer. So the above function is in fact an equivalent of this:
void foo(std::string *array) { }
And if in the first example the
sizeof operator returns the total size of an array, in the second example it returns the size of a pointer to that array, which is a totally different thing.
There are usually two ways people go about it. The first is to add a special “last” element of the array so that application can traverse the array until it sees the last element and calculate the array’s length. String literals are the perfect example of this — every string literal ends with ‘\0’ and you can always calculate its length. Here is an example:
static void foo(const std::string *array) { size_t i = 0; while (!array[i].empty()) ++i; std::cout << "Array length is: " << i << std::endl; }
The downside is obviously a need to traverse the array to determine its length. The second way it to always carry array length around, for example:
static void foo(const std::string *array, size_t length) { // ... } void bar() { std::string array[] = { "S1", "S2", "S3" }; foo(array, sizeof(array)/sizeof(array[0])); }
In C++, you can use a template to deduct array’s length, for example:
template <size_t array_length> static void foo(const std::string (&array)[array_length]) { std::cout << "A number of elements in template array is: " << array_length << '\n'; } | https://epratap.com/string-length-cpp/ | CC-MAIN-2021-10 | refinedweb | 1,262 | 70.43 |
//GetVertexData //Returns the vertex data virtual void *GetVertexData() { T *vertexData = (T *)malloc(m_numVertices * sizeof(T)); for(int i = 0; i < m_numVertices; i++) { vertexData[i] = m_vertexData.at(i); } return (void *)vertexData; }
As far as I can see there is nothing wrong with this code. It simply takes data from a std::vector and puts it in vertexData. But for some reason malloc is returning 0 so no memory is allocated for the pointer. I've done some debugging and m_numVertices is definatly non-null as is sizeof(T) (This is a templated function BTW). In fact the values are something like m_numVertices = 12 and sizeof(T) = 24. Any ideas why it would return 0? | http://devmaster.net/forums/topic/7049-malloc-returns-0/ | crawl-003 | refinedweb | 113 | 56.66 |
Hi Hernan,
There is no way that an ObjectCreationFactory can have access to the
contents of child elements. Digester is SAX based, and therefore the
only info available to an ObjectCreationFactory is the xml attributes on
the start element.
Unfortunately, I don't really understand what you are trying to do here.
Do you have something like this?
public class Element {
public void setName(String) {...}
public void setCategory(Category c) {...}
}
or do you want the <element> tag to create an instance of some class
whose type is returned by CategoryService.getCategory(catCode)
or something else?
Regards,
Simon
On Thu, 2006-09-07 at 13:54 -0300, Hernán Seoane wrote:
> I've seen that what I request could be done with the factory-create-rule.
> However, I can't seem to make the ObjectCreationFactory have access to the
> content of the <categcode> tag ("CATEG_1" in my example)
> Any help will be appreciated!
>
> Thanks,
> Hernán
>
>
> On 9/7/06, Hernán Seoane <hseoane@gmail.com> wrote:
> >
> > Hello, I'm using Commons Digester to parse a XML similar to this:
> >
> > <element>
> > <name>Name of the element</name>
> > <categcode>CATEG_1</categcode>
> > </element>
> >
> > Where 'categcode' is a code for the element's category. This category is
> > actually a Category object, and I need to fetch it with the use of a
> > service.
> > What I need is a way to call a method in that service directly from the
> > Digester rules XML (e.g. CategoryService.getCategory(String categ) ) that
> > sets this category in the Element as an object. Have in mind that I'm trying
> > to do is to avoid calling this service from the Element object itself,
> > because it is a business model object.
> >
> >
> > Thanks in advance,
> > Hernán P. L. Seoane
> >
---------------------------------------------------------------------
To unsubscribe, e-mail: commons-user-unsubscribe@jakarta.apache.org
For additional commands, e-mail: commons-user-help@jakarta.apache.org | http://mail-archives.apache.org/mod_mbox/commons-user/200609.mbox/%3C1157710226.5244.12.camel@blackbox%3E | CC-MAIN-2018-13 | refinedweb | 306 | 57.16 |
4779/different-smart-contract-logic-master-contract-configuration
It depends on the complexity of the business logic you want to implement.
let's take an example here, if I were in the business of putting a home buying escrow onto the blockchain, I would make each deal it's own contract (even though the terms of different deals may be similar). If I were building a lottery contract that executed every day, I would put a master contract for all lotteries on the blockchain. In another example, if I were to build a gambling business that supported multiple game types, I may have one master contract that tracks all activity and then delegates to a game specific contract.
So, basically it depends on the business logic. But surely we can have a master contract linked with other contracts if your business logic demands.
If you are using Remix IDE to ...READ MORE
Every Blockchain has a separate administration. So, it ...READ MORE
While the contract is open-source, if you ...READ MORE
Summary: Both should provide similar reliability of ...READ MORE
This will solve your problem
import org.apache.commons.codec.binary.Hex;
Transaction txn ...READ MORE
This was a bug. They've fixed it. ...READ MORE
Bitcoin is decentralized payment syatem. It was ...READ MORE
The most obvious use case would be ...READ MORE
OR
At least 1 upper-case and 1 lower-case letter
Minimum 8 characters and Maximum 50 characters
Already have an account? Sign in. | https://www.edureka.co/community/4779/different-smart-contract-logic-master-contract-configuration?show=4780 | CC-MAIN-2022-27 | refinedweb | 249 | 57.67 |
From: David Abrahams (abrahams_at_[hidden])
Date: 2000-10-24 07:50:55
----- Original Message -----
From: "Anton Gluck" <gluc_at_[hidden]>
> Dave,
>
> > To handle this case, you need to decide how you want the enum to show up
in
> > Python (since Python doesn't have enums). If you are satisfied with a
Python
> > int as a way to get your enum value, you can write a simple
from_python()
> > function in namespace py::
> [snip]
>
> Yes, this worked like a charm. Thanks once again!
>
> And here is how I show my gratitude - with yet another question :-(
>
> Now that I got a significant part of my DLL wrapped, I thought I'd bring
> my wrapper code up to speed with your latest examples. In particular, I
> was still using "static py::ExtensionClass", and wanted to change this to
> "py::ClassWrapper". For example I had:
>
> static py::ExtensionClass<CVar> CVar_class("CVar");
>
> which I changed to:
>
> py::ClassWrapper<CVar> CVar_class("CVar");
>
> I should also say that I have the "#include <py_cpp/class_wrapper.h>"
> line. Nonetheless, this didn't go down well. Here is the error I'm
> getting:
>
> D:\mymodule\glue.cpp(55) : error C2664: '__thiscall py::ClassWrapper<class
> CVar,class py::HeldInstance<class CVar> >::py::ClassWrapper<class
> CVar,class py::HeldInstance<class CVar> >(const class
> py::ClassWrapper<class CVar,class py::HeldInstance<class CVar> > &)'
> : cannot convert parameter 1 from 'char [5]' to 'const class
> py::ClassWrapper<class CVar,class py::HeldInstance<class CVar> > &'
> Reason: cannot convert from 'char [5]' to 'const class
> py::ClassWrapper<class CVar,class py::HeldInstance<class CVar> >'
> No constructor could take the source type, or constructor overload
> resolution was ambiguous
>
> There are indeed two constructors for CVar, but they are exposed further
> down in the code without problem (when using ExtensionClass, that is).
>
> I guess I'm missing a piece of py_cpp somewhere. I've looked at the
> example in the documentation and the vc6_prj settings, but didn't find
> anything. Any suggestions?
It has nothing to do with CVar. The py::ClassWrapper<> constructor takes two
parameters. One should be the module object.
> I should also say that this isn't all that important right now, since I'm
> happy with the way things work with ExtensionClass (the "runtime error
> R6025 - pure virtual function call" error doesn't bother me - yet). But
> there are probably good reasons to move to the new ClassWrapper.
That would be the reason. The old static ExtensionClass idiom is just buggy.
Python expects things to be destroyed in an order corresponding to its
reference counts, not according to the C++ rules for destruction of local
static variables.
-Dave
-Dave
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk | https://lists.boost.org/Archives/boost/2000/10/5973.php | CC-MAIN-2021-31 | refinedweb | 454 | 54.22 |
04 September 2012 08:25 [Source: ICIS news]
SINGAPORE (ICIS)--?xml:namespace>
The company decided to supply 2,000 tonnes of spot Group II N150 base oils to
FPCC’s global supply of Group II base oils will remain flat at 45,000 tonnes in September, including about 20,000 tonnes of both term and spot cargoes to the Chinese market, the source said.
However, no spot cargoes of Group II N500 will be available for September delivery because of an ongoing maintenance at the company’s 600,000 tonne/year base oils plant at Mailiao, the source said.
The company plans to restart the plant on 15 September, after a 45-day turnaround, the source added.
Prices of Group II base oils in the Asian spot market are expected to firm during the consumption peak in September, although supplies will rebound along with FPCC’s plant restart, major base oils traders | http://www.icis.com/Articles/2012/09/04/9592384/taiwans-fpcc-raises-spot-prices-of-base-oils-to-china.html | CC-MAIN-2015-11 | refinedweb | 152 | 59.98 |
The ability to filter email and news posts by regular expression matching in headers would be nice. It could be used to filter out messages in ALL CAPS or ending with a number, among other things.
Adding to [help wanted] list
That and it'd be nice to have a filter action that would move messages to folders like "bug $1", where the $1 gets substituted from the regex, creating a new folder if one doesn't already exist.
Daniel: one issue = one bug. Let's keep this one nice & simple. Using backreferences for folder creation would be a new RFE depending on this one.
At the very least, there must be a case sensitivity flag for the matching strings. Now I have to enter a spam-filtering substring several times in all case combinations if I want to filter by it.
so I have an extensive set of pr0n and spam filters, and there is yet two types of mails slipping through 1) Subject: bla blah blah blah [many spaces here] 12451252 [AFXLKFJK whatever] 2) Received: someone@anyhost.cn [or other strange domains] 1 could be satisfied by an additional [ends with] condition 2 and more sophisticated stuff could not also I think it's faster to do a regex than browsing my 20+ filters per account I know discussion does not belong here, but I needed to tell that it's impossible to filter *much* spam out without regex (I still get 2-10 per account a day and I have a very good set of message filters so far AND I do not subscribe with my email in sex sites :) ) and the fact that regexes might actually be faster in some cases nominating mozilla1.1
*** Bug 148430 has been marked as a duplicate of this bug. ***
Yes, as the number of spam mails I get has dramatically increased (around 50 per day ) I also came to the conclusion that regex filtering is urgently needed. So to filter out for example mails by subject "Gambling get over $100 and 100% guranteed" by gambling*$*. I think that Perl regexes would (though I would like it) to overhelming for the average user. Maybe bug 151226 is also of interest within this context.
I just want to second that the number of spam dramtically increases and due to that this should work in the body too, but that is another bug I guess...
updated keyword -> mozilla1.2
Great for RegExp filter ability!!! I have a 440 filter in file of WinEudora that look on IP source of a spammail and I can survive from 25 spam x day. I hope this filter is applicable on "all header", "All Received: line", "last Received: line" or "Body" (not so usefull for antispam efficacy). Antispam step: 1 - look in header for "real" source IP. Not always is last Received: 2 - Whois this IP, get back email of admin, and IPrange of provider. 3 - Write to Admin and attach the mail with all headers 4 - Create a RegExp filters based on IPrange that put mail in a folder I had write a C program that from IPrange create a RegExp. I'm writing a second C program that parse header to find the real IPsource... and that dont believe to forged header... :-)) How can I partecipate to developing MozillaMail ? Bye, efa
While regular expressions are a great tool for identifying patterns, if each person takes the time to keep their regexes up to date with the latest spamming tactics, there will be a very large collective waste of time. There are projects like spamassassin that are probably better spending your time on. I know, I spent a lot of time with procmail and its weighted scoring, and even with that many spams got through and I had to keep updating it as time went along. You might consider supporting the spamassassin (spamd) protocol and have mozilla filter a message through that, but if you already have a smamd server then you can probably filter on the server level...
Last time I checked, mail filters weren't just for filtering spam.
I do not concordate completely with Mike. I explain why: Before I do not understood spamassassin. I studied it in this time. I see that is a weighted scoring with a very big list of check on body and header of a mail. I also tried Spamnix (EudoraWin32 plugin of spamassassin). It function well. But they are code to identify automatically a mail as a spam mail. It's a great tool. But limiting only to receive, identify and move mail to a spamFolder is really dangerous. If you do so, the number of spam become really enormous. At the end you receive 99% spam. Yes you dont see that, but internet traffic will be all spam. Dont think only to you. Spam must be killed before it damage us! My idea is to kick out spammer from good provider (really really most). Imagine to have a spammassassin tool to identify spam, and than an automatic tools that do my previous point 1 to 3. The spammail will be forwarded to Admin of source server, and he kick out immediately the spammer. I do that manually about one time per day. Everyday I receive response from Admin that say: "We investigate. If we find that a customer is in violation of our policies, we will take the necessary action to stop the activity in question" or best "Thanks you for report. I have just now terminated the account responsible for the abuse." This method is functional, only slow because for now is most manual and maybe I'm the unique to use it. Point 4 is only for Admin that dont reply, dont kick out the spammer, or for provider that are spammer (really few). Regex filtering require some time to keep updated the list of filter, but do not require to keep updated to lastest spamming tactics. They are the same in header. Most of mail, source from last (bottom) received IP address. Forged header are sourced from last IP that have real DNS in header. My C Code to do point 1 is a real alpha, but in the future I think it can identify correcly the real source IP. My C Code to do point 4 is a CandidateRelease2, really stable and bug free. Point 2 is Unix Whois (need port for Win32 system). Not too much more, some parsing on Whois report to extract abuse@domain.tld and IPrange registered in IANA, ... Seems to me that the trick to extinguish spam, is an automatic tools to recognise spam (spamassassin or new MozillaMail1.3 filter), and than a generalized automatic tools to stop the spammer. And if such tool is really diffused (with point 4), Admin keep more attection to spammer, because most users can easily filter all the mail sourced from a provider. In any case RegEx filter ability is a great tool for text matching in filter and search in mailboxes. I want it. :-))
Valerio: that was entirely offtopic, except for the last line which was a simple "me too". Please don't comment unless you have something you have to contribute to the bug under consideration.
*** Bug 191261 has been marked as a duplicate of this bug. ***
*** Bug 184690 has been marked as a duplicate of this bug. ***
I'd posted a dup of this bug apparently. I was informed: q> > I want to sift out all emails with the subject line containing "jhotdraw". So > I create a filter for subject = *jhotdraw* Why not simply do "subject" "contains" "jhotdraw" ? /q> I've been trying to do this: --------simply do "subject" "contains" "jhotdraw"----- for as long as I've been running mozilla. As it stands in moz1.3b no newly created filters are running at all (not connected to this bug, I know)
*** Bug 198273 has been marked as a duplicate of this bug. ***
*** Bug 218298 has been marked as a duplicate of this bug. ***
There has been an increase of SPAM recently due to some very prolific viruses. I think that if wildcards (* and ?) were added to "Message Filtering" that many of the SPAMs that I am receiving could be filtered out. Ususally they are shotgun spams that are emailed to a dozen people with similar email addresses as mine. Wild Cards would allow me to easily identify these shot gun spammers.
I need regex for matching SpamAssassin headers. Voting for this bug.
Sander: See also bug 224318 - "Bayes filtering should be aware of X-Spam Headers".
Ich möchte mein Mozilla noch effektiver machen. Für folgende Probleme suche ich eine Lösung: Bei offensichtlichen (und sicherlich beabsichtigten) Schreibfehlern ist der Filter durchlässig wie ein Sieb. Ich habe beispielsweise gesperrt "Viagra", der Filter läßt durch V;agra V i a g r a Via.gra Es wäre hilfreich, wenn alle Leer- und Sonderzeichen *vor* dem Mustervergleich eliminiert würden. Noch problematischer sind HTML-Emails: ein Text wie <br> V<big>i</big>agra<br> <br> Via<span style="color: rgb(102, 51, 102);">g</span>ra<br> wird nicht erkannt, obwohl der Mensch das bestens lesen kann! noch witziger: <br> Vi<acd>agra<br> wobei <acd> jede beliebige Zeichenkombination sein kann, die willkürlich vom SPAM-Versendern eingestreut wird.
*** Bug 213567 has been marked as a duplicate of this bug. ***
In all honesty, the concept of Perl regular expressions doesn't even have to be implemented in its entirety... if I would like to send entire domains to a certain folder, it'd be nice to do *@somedomain.com and have that be my one filter. So a simple implementation of ? (single character match) or * (multiple character matches) would do the job for me, and would also be more well known that full-blown regex.
The fact is that it already _is_ implemented in its entirety in JavaScript (AFAIK), so it's just a matter of using it. No sense in re-implementating a subset of regular expressions, I think.
(In reply to comment #25) > if I would like to send entire domains to a > certain folder, it'd be nice to do *@somedomain.com The problem is not with real source email. Is for fake source email, like spam. The spammer can easily cheat the source email and domain, but cannot cheat on source IP address in header Received lines. With regex you can match the whole IP range registered IANA block of a known spam provider like chi....... or hana......
(In reply to comment #27) While I agree with the general concepts, my comments don't relate specifically to spam. I get plenty of mail that is legitimate AND needs to be filed away into a single folder, BUT comes from sources that are just a little bit different in different ways (for example, 61source_dev@domain.com, 61source_stg@domain.com, 81prod_srv2@domain.com). Filtering on subject lines would not be helpful as there have been unpleasant side effects. :) The ability to write a single expression for this would be helpful. I tested a handful of regular expressions that might've worked... they didn't. Eyal... if the JS filtering is there, it's undocumented. :-) On a related note, the reason this comes up is because I don't have the option to create a filter from a message in my inbox (much faster way to create filters). That is a separate feature, however.
(In reply to comment #25) if I would like to send entire domains to a > certain folder, it'd be nice to do *@somedomain.com and have that be my one > filter. So a simple implementation of ? (single character match) or * (multiple > character matches) would do the job for me I tryed this now with Mozilla Suite 1.7.3 and it works well. Just create a filter with "Sender" and "Contain" and "@domain.com"
> > Eyal... if the JS filtering is there, it's undocumented. :-) > Here's how we use regexp's in BiDi Mail UI: just define it with /..../ 's and then do myregexp.test(mystring) . Pretty straightforward.
(In reply to comment #28) > > The ability to write a single expression for this would be helpful. I tested a > handful of regular expressions that might've worked... they didn't. > > Eyal... if the JS filtering is there, it's undocumented. :-) It's not that regexp filtering has been implemented (if it was, this would be RESOLVED FIXED), but that JavaScript already has support for regular expressions so it's just a matter of modifying the filter code to use it. No need to implement a new parser.
It's a pity nobody is working on this. Would be a killerfeature for Thunderbird.
*** Bug 261854 has been marked as a duplicate of this bug. ***
Free Eudora had regular expressions in filters a long time ago. Couldn't believe it when I discovered that Mozilla mail didn't.
*** Bug 275988 has been marked as a duplicate of this bug. ***
*** Bug 304428 has been marked as a duplicate of this bug. ***
*** Bug 337229 has been marked as a duplicate of this bug. ***
If Thunderbird had a basic "wild card intelligence" (which comes since the DOS age when we wrote dir file.* and the program gave us the matching files...) it could (with no much lines more) be more efficient and less frustrating in finding INTELLIGENT MATCHES in the filter expression. I know a little about C++ (its not my best language) and I analized the Thunderbird source, so I could give the following CODE SUGGESTION. Just need to transform the diagram in equivalent code. VERY STRAIGHTFORWARD and simple. Please take a look and I hope you give us SOON a Thunderbird UPDATE with "wild card intelligence" in the CUSTOM FILTERS... That would be basic, but would help us A LOT. The ideal features would include: 1- Possibility of mixing OR and AND statements in the same RULE WINDOW. Nowadays you can use ONLY one of the options... 2- For advanced users, Filters with Perl regexp. Ex: re:.+v.*i?a?.*g?.*r?.*a to match: Viagra Visagra Viagbbbrgra and so on... Here is the algorith I suggest to add "wild card intelligence" to thunderbird filters. I the image I indicate even the cpp file and the function that needs to be improved. I hope it helps somehow... Best Regards Sergio Abreu
*** Bug 358683 has been marked as a duplicate of this bug. ***
I've been taking a look at this and have hacked up some code. It'll need some beating into shape before it is suitable for inclusion, for which I will need some advice from someone more familiar with the mozilla codebase. (My current MUA is showing signs of age, and I'd *really* like to switch to Thunderbird. However the lack of regex support in the filters means I can't bring over my existing sorting/blacklisting filters which is an absolute showstopper for me.) There are actually two existing regex implementations within the mozilla codebase: 1) directory/c-sdk/ldap/libraries/regex.c - this is a very limited implemenation, far less capable that most people would expect in this age of ubiquitous PCRE support. It's also apparently extended from an old grep implementation in a slightly odd (non-standard) way. 2) js/src/jsregexp.c - this is the one mentioned above. This supports a much more powerful Perl-ish syntax - as I believe from the comments is specified for Javascript by ECMA. Unfortunately it is heavily tied in with both the JS engine memory allocation routines, and the JS engine's internal typedef range. Its symbols are not, without a lot of grotty hacking, even visible from the rest of the mozilla codebase. Even if it were visible, it requires a JSRuntime and JSContext object to operate, which are way too much overhead for a generic facility. It cannot be used directly. 3) (I know I said 2!) There's something in security/nss/lib/util/portreg.c *calling* itself a regexp, but clearly just a shell glob with maybe a little regexy-like extension. There is almost identical code in both modules/libjar/nsWildCard.cpp and xpfe/components/filepicker/src/nsWildCard.cpp which is more accurately named. God knows whether (1) or (3) are still live code. I've been playing around and am now at the stage where I have working POP3 filtering based on regexes. I've taken a copy of jsregexp.c, converted it to use PR_ memory allocation and PR typedefs and it seems to function fairly well. As a proof of concept it shows this bug (after 8 years!) could be addressed without too much pain. At the moment the regex engine is namespaced out of the way and #included directly into mailnews/base/search/src/nsMsgSearchTerm.cpp. Quick-n-dirty with minimal impact, but clearly not a great solution. I suggest that after suitable cleanups it ought to be made a core facility available across mozzila/. The problem is I lack the familiarity (and authority!) to know where it is appropriate to put it so that it is available to anywhere it might be needed. (I don't think it could be abstracted out of the JS engine - which means a parallel implementation. The JS version has to rigidly conform to ECMA, whereas a common internal facility I can see people wanting to extend in various ways. The different ways of handling memory management are also a block here. Not pretty, but necessary I think.) The changes to filtering/UI to integrate it are relatively trivial by comparison (even if the mozilla codebase is a huge bloated monstrosity with no rhyme nor reason to the location of any particular file), however there are a number of places where it may be useful and it might be nice to hit all of them in one go. Again, I lack familiarity enough to be able to enumerate all such places, my focus has so far been on filtering of POP3 mail. I could do with someone who knows the codebase better to give me a few pointers here... Cheers, John
I have a need for wildcards '*' and '?' in filters. This would be a much-welcomed improvement.
Can we please get the priority on this enhancement elevated to P1? This is a huge hole in TB's filtering capability in my and 80 other people's opinions..
OK - thanks, Eval. I wonder if John Sullivan is still around (see comment #40 above).
(In reply to comment #43) >. > Mozilla may only have 2 people working on Thunderbird, but Qualcomm has 4 additional people working on the same basic code. Granted those 4 are not _full-time_ on Thunderbird / Penelope / Eudora, but they are submitting changes.... The more people we can get involved the better, IMHO. Matt
I am still around. I'd really like to get this done - it's a stopper from me upgrading from my current MUA, which a spammer has unwittingly discovered how to crash with stupidly long subject lines. I have a workaround, but a local build of Thunderbird sorts it out completely. Situation as above. If someone with commit rights wants to say where I ought to put generic library code in a way that wont interfere with other projects I can make time. I could I guess just make something up, request review and sort it out from there if any reviewer is listening and objects to a crude insertion. I should point out that I can make time before the end of year, I have leave I need to take and could use a part of for this, but I just don't feel up to using spare time during my normal working schedule when I could be unwinding from existing machine stuff. I'm sure you understand.
John: some related regexp interface design was done in bug 106590. (If you need that it might be worth arguing your case there to get it un-wontfixed.)
(In reply to comment #47) > ... (If you need that it might be worth arguing your case there to get it un-wontfixed.) That seems highly unlikely without core (pun intended) support from those formerly involved in that bug and their strategic (and probably smart) direction of ECMA-262 regexp's / JS_*RegExp API noted in bug 348642. John, Brian says in there "It's pretty easy". Perhaps they'd be glad to have your help. (plus the bugs dependent on bug 106593, bug 32641 and bug 80337, are quite dead so no help gonna come from there)
I'm not sure what is involved to make this possible, but I would absolutely love this feature. It would be a hard-core user thing I'm sure, but very powerful. For the record, if someone can manage to build this, even as an extension/addon, I think I would be very happy (as would others)
> Reported: 1999-11-19 Does anyone else think it would be nice to get this fixed before it's been kicking around for an entire decade?
I'd love to see this get done as well. Since John Sullivan appears to be offering to work on it, it would be nice if someone with authority would speak up and give him what he needs to DO it.
I want to interject one point into the debate: should we do full JS regexp or wildcard matching. Regexp is much more powerful matching, and I have one use case. The most recent infusion of MI5 spam in Usenet can be filtered out with the matching regexp for sender: ^[vief]+@.*$ Laying out other requirements: * Support both wildcard and regexp? If not, which one? * Matches, contains, or both? * Strings? I like the idea `Sender' `matches regex' [==========] * Needs to be implemented for all of IMAP, POP, NNTP To John: If you need help with the filter code, I can easily provide it.
(In reply to comment #53) > full JS regexp or wildcard matching If we can grab some low hanging wildcard fruit, fine. But as soon as "heavy" coding is involved, we'd probably shoot for RegExp - although not necessarily JS based (having a scriptable interface for the JS RegExp would be truly cool, but I doubt we'll see that). (I've tinkered a bit with how to implement user-defined JS filter actions, but I'm not sure how slow such extensive XPCOM boundary crossing would get.) > * Matches, contains, or both? Not much of a difference with RegExp. > * Needs to be implemented for all of IMAP, POP, NNTP And "movemail" and "none" (local folders).
Filter on "Nobody_NScomTLD_20080620"
Marking as wanted-, as per the revised driving rules <>.
It's not reasonable for the people who edit some Wiki page somewhere to decide that 'wanted' now only pertains to what "thunderbird-drivers think would be nice to have". The drivers control 'blocking', 'wanted' should be for users, QAers, extension devs, and non-driver devs. Please reconsider.
I am *not* a thunderbird driver, but I think the way they're doing things is fair. If users, QAers, extension devs, and non-driver devs "want" a bug, they should vote for it. Obviously by virtue of the feature bug existing in the first place, somebody wants it. So unless the "wanted" flag is only for "special" people, it's pretty redundant.
Votes are not version-related. Plus, by now voting is pretty deprecated AFAICT since votes have been generally ignored. Eh, what the hell, let'em do whatever they want(ed). Nobody seems to listen to what I/people like me say anyway.
blocking and wanted have always been part of a mechanism for thunderbird-drivers to help shepherd the highest-impact bugs/features into the tree; nothing has changed there. The wiki page changes did not happen at random; I personally made them on behalf of thunderbird-drivers, to clarify policy changes we've made regarding use of that flag: we didn't think that the way it was being used was really sufficiently helpful w.r.t. helping get the highest impact bugs into the tree. It sounds like you think there should be some separate mechanism for use by the broader community, but it's not clear to me how you envision that working. That bug isn't really the best place for that discussion, I think, but you're welcome to post a proposal to m.d.a.thunderbird or m.d.planning.
Er, "This bug isn't really the best place...."
(In reply to comment #59) > Votes are not version-related. Plus, by now voting is pretty deprecated AFAICT > since votes have been generally ignored. To be fair, I don't think anyone *currently* associated with Thunderbird has discouraged voting by users (tho there are certainly detractors in the mozilla community). And some of us do use votes. For example when attempting to differentiate within an overwhelming number of bugs looking for worthy nominations.. Getting back to this bug... > Eh, what the hell, let'em do whatever they want(ed). Nobody seems to listen to > what I/people like me say anyway..
(In reply to comment #62) >. I counted: # of TB bugs > 50 votes in the last: 1 year: 0 2 years: 1 3 years: 2 4 years: 4 all time: 44 No bugs in the past 4 years have > 100 votes, the newest being just under 5 years. Votes have a strong bias towards older bugs, which means that it's a poor approximation to wanted features. >. I've been reading C++0x recently, and as that adds support for regex natively, it might be worthwhile to ask NSPR to add support for the libraries or put it elsewhere. That's another can of worms entirely, though...
I recently posted a patch in bug 495519 that implements the ability to add custom search terms to Thunderbird filters, and as a demonstration shows an extension that does a regular expression comparison to the message subject. I'm reasonably confident that a finished patch will be implemented in TB3, so the use of regular expression filter terms in extensions should be possible then. That patch, and its cousin that adds custom filter actions, relies on calling javascript-implemented features from the C++ filter code. If we are willing to take that step, then it is not a big leap to do the same trick in the normal filter code to implement regular expressions. We could implement a javascript XPCOM object to execute a regular expression, and call it from the C++ search code when needed to do the regular expressions. This is not a big project. It also could be done in extensions instead of in the core code though. I'm curious what people think of this approach, with its obvious possible performance issues. I'd probably be willing to do this work if drivers could add wanted+ to this bug. Otherwise I'll just leave it to the imagination of extension writers.
In general, it seems like an entirely reasonable approach. Because of the potential perf issues, I suspect that the thing that makes the most sense is to code this up as an extension first and do some benchmarking before committing to accept this in the core. As such, I don't think we can say for sure whether it's wanted+ at this point in time.
Also it would be nice if messages could be searched for using regular expression syntax.
kent's comment 64 is related to
This is a bug that could be easily implemented using a javascript XPCOM component to do the regex processing, and adding an additional choice for text searching as suggested in
This is what kent told me 2 years ago on his forum & a year after, he tells me he doesn't have time for this ... . the man seems to have an ego & practices abuse of trust pretending. there's even better, send him requests to add regex for the body using different emails, pretending someone else is asking it & he will objectively ignore the request, whoich shows he doesnt give 2 phux about specific requests when hes not in the mood for particular requests to be added at a certain time of his life .. . also, dont expect anything from mozilla, as a wise man above pointed out: "Lance Haverkamp 2007-10-11 15:47:25 PDT > Reported: 1999-11-19 Does anyone else think it would be nice to get this fixed before it's been kicking around for an entire decade?"
kent usually responds to request by it's easy before ignoring you forever.. & mozilla seems to care less about regex implementation in filters .. . something that exists in postbox, with a postbox addon.. let's wait one more decade & see if things evolve at mozilla, i had my dose of it.
ukrainianconsular@gmail.com, Personal attacks are not appreciated *at all* around here. Clearly you have nothing better to do with your time than to insult extremely helpful and knowledgeable contributors such as Kent. Thunderbird is run ONLY by contributors now and Mozilla has very little to do in it's development. If you care so badly about this being fixed, by all means go ahead and fix it yourself, but don't expect the rest of us to do whatever you want. We are all working in our spare time to improve TB (We actually have lives and jobs outside of this), but we can't get to every bug in a timely fashion. There are thousands of filed bugs. Therefore, unless you have something useful to contribute to a development-only site, please just stop. Continuing to attack people may result in a ban to your account. Thanks, Josiah
alos, i am insisting towards moz devs, because rkent will not add regex filtering for the body section in his addon, because he thinks it affects me & only me through his rejection & my complaint about his abuse of trust. he will not do it & everyone who's expected that function here has been waiting forever.
(In reply to ukrainianconsular from comment #74) You cover your valid points with so much hyperbole, with curses, with YELLING, et cetera - that it's really difficult for people with a view similar to yours to sympathize with your message, or even to read through it. (In reply to Josiah Bruner [:JosiahOne] from comment #73) Josiah, - "Very little" is still some. And I'm sure people connected to the Mozilla foundation/Corporation have a lot of say w.r.t. Thunderbird development. - Thunderbird development work over the years sure seem to have very strange priorities. - Many users get extremely frustrated - For some people, implementing a certain feature might mean 2 days of work, while for others, it might mean many months of agonizing to get to the point where they can add anything significant to the code. I really suggest people remove "so fix it yourself" from the lexicon. - A 20-year-old mail client should have gotten regex support in message filters many years ago. Having said that, ukranianconsular's personal attacks are quite beyond the acceptable.
it's just that the 15 years of thread & the fact another contributor of an addon ignores a main basic function of his add-on drives me nuts, and that's factual, not an hyperbole. if my complaints are beyond the acceptable, i will apologize to have bothered you & will make sure i never post any requests at mozilla.org it is certain that after having started many threads & obtained no fix for all of them even without complaining about that form of negligence, it's beyond acceptable to insist. you are right eyal, i shouldn't keep expecting anything after having seen the date this thread was started .. . when email clients r conceived & posted online with regex on their first release, i send to all of the ppl here who have been deeply offended, my most humble apologizes. keep up the good work.
(missing bit in my comment) - Many users get extremely frustrated after waiting many years to see some attention to significant issues they have reported or commented on, that they end up losing their temper, like our friend ukrainianconsular. I'm sure he has enough on his plate in life these days in the Ukraine than to write comments here... he does it because he cares about making Thunderbird better. Everyone here wants that, nothing else.
ur right ((
I propose to remove vote feature in Importance field of Bugzilla, as is never looked while assigning bugs or RFE
If you check bug 868233, you can see Kent has already have a patch that can help all addon authors to working on filter using body part. The patch itself actually demos how to use regular expressions for body match. Also without the above patch, it's not possible to just write addon to do the regular expression search against body, as now if you need get the body, it's an async call, and filter system need sync call. The current Thunderbird development is a bit slow, that's true. I do see a few bugs have patch and it might need months before get reviewed. That frustrated both contributors and end users. There might be ways to improve this, but I agree with Josiah Bruner, Personal attacks doesn't help.
could you move this fruitless discussion to the forum please? I really dont need this via email...
Thank you so much opera wang, hoping this patch addresses regex & not javascript since i don't know the javascript language & have no computer knowledge. could you please tell me how to install it by the way since i have no coding knowledge & don't know were to put that content & how to name the file: Regex is already a bit complicated for me but i use a magic tool called regulazy that helped me a lot, when i click on regex edit, select parts & right click, then i have many choices including "exact-letters-numbers-anything, etc". This matter has frustrated me a lot because i've been fighting against spam using a personal email that's been posted by inbreds online & collected by all types of extractors-companies or hired spammers to send me a whole imaginary world of spam content, & i took the decision to abandon the ordinary baysian filters since they appeared on the web & that are useless for my part, since the baysian system sends false positives to a spam folder, moreover, there is a spam folder "to deal with/deal with spam", & i can't use that system to delete false positives. so i started to create complex filters over 20 years of my life, dealing with those spams almost every day, i now reached almost 2500 complex filters, and many of those filters are very "cerebral" & well thought, including the fact: Re: i "or" you (depending on the linguistic expression & content) are not present when i receive marketing related words & http is present & that personal technique is like 30% of my spam filter's database. regex for the body was my only accurate possibility because: if people use doesn't contain "i " & there's a word finishing with the letter "i" in the body, a false positive will be considered & i cannot allow myself such false positives caus emy filters are radical & delete the messages without sound without any attention, without visibility of the matter.. & this is a stupid limitation of all email clients that's never been fixed by an update. i could use " i " but if my letter " i " is in the body but at the start of the body, it will be ignored by tb's filters, because there's no space before " i " so we either needed a regex for the body, or "exclusively contains" option in tb's filters "this would be an evolution in email filtering". which would exclude all letters of the alphabet before or after a string/word/letter. using exclusively contains for "i", this should be recognized "hihi,i " .. . but not this "oui" spammers can even amuse themselves reading this message, i will defeat their mind polluting unsolicited spam campaigns. even if they try to obfuscate i or you or or http links playing with tags or colors, i have a solution for them too. & a link that arrives without any text should also be treated by a complex regex for the body .. . i already excluded more than a certain number of emails allowed in the too or bcc or cc fields. this regex option for the body was very important to me cause i engaged myself in 20 years of personal fight & my system is actually almost perfect, for an email that receives 100 spam remails PER DAY, if i login my email servers account through the web panel, ill see them all in the trash can & they're purged auto. by the server. & i get like 1 spam email over 7 to 14 days actually.. i've built very complex filters including words obfuscated by discomposition among tags for ex.. i've reviewed my spam box many times & have no false positives, but that's a hard & long work & fight against spam, i also lost a dear member of my family & forgot the human vital aspect of my life & experienced affective misery for being so obsessed with it. today, i'm watching the end of the tunnel folks & this body regex filtering option adds perfection to my filtering system & allows me to treat tags too without ever having to deal with it again, when some online filtering engines don't even allow it either, . I became schizophrenic & it became a psychosis, that i ended up regretting to have ignored that family member that passed away before i could spend more time by having more freedom in my hands. & you cant just sign up for a new email when you've shared that email with thousands of people over decades .. . spam can be very devastating in a life, it starts to slowly irritate you until it invades your life, even spammers from argentina are protected by their laws & spam in total impunity, that's why full spam reports will never stop some spammers. All i'm missing now is the "My email" not present in the To field nor cc field, while that filter should check more than one identity, without having to add them to filters & removing them when necessary when if i ever get rid of an account. i hope aceman takes care of it. Again, my sincere apologizes to everyone who's felt harassed in my interventions here, but if Eyal wouldn't have tried to understand me, i probably wouldn't have taken the time to explain my situation & why am i so obsessed with the matter. Because, before you guys feel harassed, trust me, i've been through a lot on this matter .. . Let's move on from this. Thanks.
News: My private conversation with Opera Wang: Opera: The patch C++ code requires you to download the source code of TB, patch it and then rebuild whole TB, it would be hard if you were not in IT. Also the patch is about half year ago which means it is bit rotted ( can't get patched directly, need some merge effort ). ukrainianconsular: It means if i use the patch, i should never update thunderbird & condemn thunderbird to the latest actual stable build & never update it again, since i can't expect devs at mozilla to incorporate it for good .. . could you please add it, since i have no coding knowledge (( Opera: As I said, without the patch, it's (almost) impossible to do regex search in the body. I actually tried it once, with a lot of dirty code, still can't make it work without the possibility of crashing TB. ukrainianconsular to the devs of bugzilla: So now, i'm hopeless .. . and i believe rkent is blocked because tb needs a code modification before this regex search becomes possible .. . If you guys want to consider that issue, here's rlkent patch: Apparently, only you can do something about it.
Getting rid of filtaquilla which becomes now obsolete to (regex) filter by headers to from subject & the missing one: body Many thanks to opera wang to introduce all those options in the addon he is maintaining: Expression Search / GMailUI 0.8.8 beta
I cannot believe that requests for this enhancement go back 16 years, and are still unfulfilled! So much for Open Source! Regular Expressions, or even wildcards, in all fields in Message Filters would allow the creation of the most powerful spam filters on an individual basis. After all, one man's marketing communication is another man's spam. It cannot be difficult, can it?
(In reply to Alastair Gordon from comment #89) > It cannot be difficult, can it? Sure it isn't ... just attach a patch to fix it!
We seem to have agreement that RegEx/Wildcards would be an extremely valuable feature for all fields in Message Filters, and that there are no technical hurdles. So why has no one taken up the challenge in 16 years? If I had the skills, I would definitely do it.
See my comment 64. That approach is implemented in the addon FiltaQuilla, which has been available for years. The usage of that addon has never been that high (I believe around 10,000 users) and it includes many features in additional to RegExp, so the total actual demand for this feature is not as high as you would think. Because it is easy to do in an addon now, it may be appropriate to just leave it there.
I have installed FiltaQuilla, and to the best of my knowledge, it will not apply filters to the BODY of the message, making it essentially useless for filtering spam. If FiltaQuilla does, in fact, allow filtering on the body and is usable by anyone other than a hard-core nerd, then you are right that we already have a solution. Simply supporting a wildcard character in the existing Thunderbird Message Filters would meet 90% of filtering needs. How about someone just adding wildcard capability to existing Message Filters?
Alastair: Right, body filters are much more difficult, since filters are sync by nature, and body access is async. There is now a technical solution to this that did not exist when FiltaQuilla was written, though it is still a bit of a kludge, and may lead to unstable behavior (filters are crashy enough by themselves). It would probably be possible to add RegEx body filters to an addon such as FiltaQuilla, but frankly I've put almost no effort into that in years, and am unlikely to do so in the foreseeable future. There are much more urgent issues to deal with in Thunderbird at the moment that filter improvements. If someone wanted to attempt that I would be happy to point them in the correct direction.
Thank you for the explanation, Kent. I hope someone takes up your kind offer. In fact, simply allowing wild cards ("*") in the existing Message Filters, which can filter on the contents of the BODY, would achieve most of what is needed. How tough would that be?
asterisk "*" is simple workaround but it isn't enough. do you plan support for unix shell or regexp wildcard? shell accepts * , ? and [chars] . this is the simplest regexp for creating. other question. does asterisk work when is placed in theme, sender, receiver or else anywhere ?
Sorry if I'm late to the party, here. Kent, FiltaQuilla doesn't come up when I search for Thunderbird add-ons that do searching - and its description only includes a laundry list of features I don't actually care about (no offense). I care far more about the ability to search e-mail bodies than the ability to use full regular expressions to search only subjects. That said, either regex or boolean search would seem to me to be much more than just a nice-to-have. For me, this has nothing to do with spam - there are other means of filtering spam, and for now TB's "junk" designation is working OK for me. I keep my e-mail until I run out of disk space, and I search old e-mails for specific content *in the body of the e-mail* on a regular basis. In fact, I only within the last month switched to using TB at home rather than my ancient Forte Agent 1.8, because it's easy to use and I haven't wanted to pay to upgrade Forte Agent to a more modern version that will handle the now-ubiquitous HTML e-mails. But I was dismayed to see how e-mail search is implemented in TB. I may go back to Forte Agent after all... I will try some add-ons first, but everything I'm reading seems to indicate that even those that will search other headers may not search bodies (and I understand about the technical difficulty). And recent reviews of FiltaQuilla and of Wang Opera's Expression Search / GMailUI seem to indicate regex searching is currently broken in both of them. Rebeccah | https://bugzilla.mozilla.org/show_bug.cgi?id=19442 | CC-MAIN-2017-17 | refinedweb | 7,550 | 70.13 |
Open Source Your Knowledge, Become a Contributor
Technology knowledge has to be shared and made accessible for free. Join the movement.
Party generalization
When modeling people and organizations we have to make generalizations that allow us to handle both of these as one when needed.
Imagine the case when customer can be either company or person. What happens if they are totally independent in data model? Let's see the bad scenario. Take a look at Invoice class and think if you want to see something like this in your data model.
public class Person { public int Id { get; set; } public string FirstName { get; set; } public string LastName { get; set; } } public class Company { public int Id { get; set; } public string Name { get; set; } } public class Invoice { public int Id { get; set; } public Person CustomerPerson { get; set; } public Company CustomerCompany { get; set; } }
Let's make things worse and imagine the whole data model where there are 60 classes that are related is with Person or Company but not both of these at same time. Horror, isn't it?
Party base class
Let's introduce Party base class that generalizes Person and Company. Demo below shows how to do it using class Party. Notice the DisplayName property that brings name of party to base class. Also notice how two invoices are created and for one of them customer is Person and for other Company.
References
- Modeling people and organizations: Class Party (Gunnar Peipman) | https://tech.io/playgrounds/5802/modeling-people-and-organizations---party-generalization | CC-MAIN-2018-34 | refinedweb | 241 | 54.32 |
From: Larry Evans (cppljevans_at_[hidden])
Date: 2006-09-13 11:28:45
On 09/13/2006 10:18 AM, Larry Evans wrote:
> On 09/13/2006 07:26 AM, Andy Little wrote:
> [snip]
>
>>I am not quite sure whether put these into the fusion namespace and put them in
>>the Boost Vault as extensions to fusion, or just to keep them in my own
>>namespace?
>
>
> Joel, would a new directory, boost/fusion/sequence/container/matrix,
> be a good place?
Joel, I'm also thinking this matrix *might* help in calculating
the First and/or Follow sets for the deterministic parsing
discussed in the post with headers:
From: Joel de Guzman <joel_at_[hidden]>
Newsgroups: gmane.comp.parsers.spirit.devel
Subject: Re: Re: first sets and deterministic parsing
Date: Fri, 27 Feb 2004 12:59:15 +0800
using the method described in section 3.3 of:
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk | https://lists.boost.org/Archives/boost/2006/09/110039.php | CC-MAIN-2021-25 | refinedweb | 166 | 62.78 |
src/README
- Solvers
- General orthogonal coordinates
- Data processing
- Output functions
- Input functions
- Interactive Basilisk View
- Miscellaneous functions/modules
- Tracking floating-point exceptions
- See also
Solvers
Saint-Venant
Systems of conservation laws
Navier–Stokes
Streamfunction–Vorticity formulation
- “Markers-And-Cells” (MAC or “C-grid”) formulation
-
- Two-phase interfacial flows
Momentum-conserving two-phase interfacial flows
Electrohydrodynamics
Viscoelasticity
Other equations
- Hele-Shaw/Darcy flows
- Advection
- Interfacial forces
- Reaction–Diffusion
- Poisson–Helmholtz
- Runge–Kutta time integrators
- Signed distance field
General orthogonal coordinates
When not written in vector form, some of the equations above will change depending on the choice of coordinate system (e.g. polar rather than Cartesian coordinates). In addition, extra terms can appear due to the geometric curvature of space (e.g. equations on the sphere). An important simplification is to consider only orthogonal coordinates. In this case, consistent finite-volume discretisations of standard operators (divergence etc…) can be obtained, for any orthogonal curvilinear coordinate system, using only a few additional geometric parameters.
Metric scale factors
The face vector fm is the scale factor for the length of a face i.e. the physical length is and the scalar field cm is the scale factor for the area of the cell i.e. the physical area is . By default, these fields are constant and unity (i.e. the Cartesian metric).
Several metric spaces/coordinate systems are predefined:
Data processing
- Various utility functions: timing, field statistics, slope limiters, etc.
- Tagging connected neighborhoods
- Counting droplets
Output functions
- Multiple fields interpolated on a regular grid (text format)
- Single field interpolated on a regular grid (binary format)
- Portable PixMap (PPM) image output
- Volume-Of-Fluid facets
- Basilisk snapshots
- Basilisk View
- Gerris simulation format
- ESRI ASCII Grid format
- VTK format
Input functions
Interactive Basilisk View
- bview: a script to start the client/server visualisation pipeline.
- bview-server.c: the server.
- bview-client.py: the client.
Miscellaneous functions/modules
Tracking floating-point exceptions
On systems which support signaling NaNs (such as GNU/Linux), Basilisk is set up so that trying to use an unitialised value will cause a floating-point exception to be triggered and the program to abort. This is particularly useful when developing adaptive algorithms and/or debugging boundary conditions.
To maximise the “debugging potential” of this approach it is also recommended to use the
trash() function to reset any field prior to updates. This will guarantee that older values are not mistakenly reused. Note that this call is quite expensive and needs to be turned on by adding
-DTRASH=1 to the compilation flags (otherwise it is just ignored).
Doing
ulimit -c unlimited
before running the code will allow generation of
core files which can be used for post-mortem debugging (e.g. with gdb).
Visualising stencils
It is often useful to visualise the values of fields in the stencil which triggered the exception. This can be done using the
-catch option of
qcc.
We will take this code as an example:
#include "utils.h" int main() { init_grid (16); scalar a[]; trash ({a}); foreach() a[] = x; vector ga[]; gradients ({a}, {ga}); }
Copy and paste this into
test.c, then do
ulimit -c unlimited qcc -DTRASH=1 -g -Wall test.c -o test -lm ./test
you should get
Floating point exception (core dumped)
Then do
gdb test core
you should get
... Core was generated by `./test'. Program terminated with signal 8, Arithmetic exception. #0 0x0000000000419dbe in gradients (f=0x7fff5f412430, g=0x7fff5f412420) at /home/popinet/basilisk/wiki/src/utils.h:203 203 v.x[] = (s[1,0] - s[-1,0])/(2.*Delta);
i.e. the exception occured in the gradients() function of utils.h.
To visualise the stencil/fields which lead to the exception do
qcc -catch -g -Wall test.c -o test -lm ./test
you should now get
Caught signal 8 (Floating Point Exception) Caught signal 6 (Aborted) Last point stencils can be displayed using (in gnuplot) set size ratio -1 set key outside v=0 plot 'cells' w l lc 0, 'stencil' u 1+3*v:2+3*v:3+3*v w labels tc lt 1 title columnhead(3+3*v), 'coarse' u 1+3*v:2+3*v:3+3*v w labels tc lt 3 t '' Aborted (core dumped)
Follow the instructions i.e.
gnuplot gnuplot> set size ratio -1 gnuplot> set key outside gnuplot> v=0 gnuplot> plot 'cells' w l lc 0, 'stencil' u 1+3*v:2+3*v:3+3*v w labels tc lt 1 title columnhead(3+3*v), 'coarse' u 1+3*v:2+3*v:3+3*v w labels tc lt 3 t ''
With some zooming and panning, you should get this picture
Example of stencil/field causing an exception
The red numbers represent the stencil the code was working on when the exception occured. It is centered on the top-left corner of the domain. Cells both inside the domain and outside (i.e. ghost cells) are represented. While the field inside the domain has been initialised, ghost cell values have not. This causes the
gradients() function to generate the exception when it tries to access ghost cell values.
To initialise the ghost-cell values, we need to apply the boundary conditions i.e. add
boundary ({a});
after initialisation. Recompiling and re-running confirms that this fixes the problem.
Note that the blue numbers are the field values for the parent cells (in the quadtree hierarchy). We can see that these are also un-initialised but this is not a problem since we don’t use them in this example.
The
v value in the gnuplot script is important. It controls which field is displayed.
v=0 indicates the first field allocated by the program (i.e.
a[] in this example), accordingly
ga.x[] and
ga.y[] have indices 1 and 2 respectively. | http://basilisk.fr/src/README | CC-MAIN-2018-43 | refinedweb | 962 | 55.54 |
16 March 2012 03:02 [Source: ICIS news]
SINGAPORE (ICIS)--?xml:namespace>
The spot cargo for loading in the first half April was sold to a trading firm at $3,400-3,420/tonne FOB (free on board) Map Tha Phut, the source said.
The results of BST’s tender translate into a price of $3,550/tonne on a cost and freight (CFR) northeast (NE) Asia basis - taking into account freight costs - indicating a rebound in BD prices, traders said.
In the week ended 9 March, BD spot prices were at $3,350-3,400/tonne CFR NE Asia, according to ICIS.
“I guess the buyers think the price has bottomed out and are starting to purchase BD | http://www.icis.com/Articles/2012/03/16/9542130/thai-bst-awards-h1-april-bd-sales-tender-at-3400-3420tonne.html | CC-MAIN-2014-10 | refinedweb | 119 | 75.54 |
339 m0 > > I I '* I I CD ._ . . .. _- "- 0 '._ _' ._ q -- -" *-- ---...._- .. ... .. . Allawi ciaima winmpt on life "Copyrighted Material Syndicated Content Available from Commercial News Providers" Docks covered with gel Man finds chunks ofsubstance TERRY Wirr terrywitt@chronicleonline.com Chronicle When George Magura discov- ered chunks of crystal-clear gela- tin on his dock on Tuesday, it aroused his curiosity. The odorless chunks reminded him of large diamonds, yet they seemed to have come from nowhere. Identical chunks of gelatin were scattered on seven or eight of his neighbors' docks along Little Lake Henderson near Inverness. Some docks The had 50 to 60 chunks of gela- gelatin tin. The gelatin appeared appeared on the docks after on the two days of heavy rain, but docks there had been after two no heavy winds to push them days of ashore or big waves to lift heavy them onto the docks. rain, but M a g u r a began looking there for answers. Turns out, the had been mysterious material was an no heavy herbicide gran- winds ule. It was w d apparently to push accidentally spread on the them docks by county aquatic weed ashore spraying crews. Julia Wood, or big operations manager for waves to Citrus County SA q u a t i c lift them Services e, Aonto the solved the mys- nto the tery when a docks reporter docks. brought sam- ples of the gela- tin to her office on Friday. She immediately recognized the gelatin as a byproduct of Super K herbicide granules. When water hit the granules, they turned to gelatin. "With all the rain we got, they puffed up," said Wood, a former chemist with the Florida Department of Environmental Protection. She said the gelatin was harm- less. The sun absorbed any remaining herbicide, leaving behind the benign gelatin. Magura said he did not see any county work crews spreading granules before the rain came. If he had, Magura said he would have correlated the two. Having lived on the lake for 10 years, he said it was the first time he had ever seen anything like the Please see vI/Page 4A A juicy harvest Sewer project high on agenda Commissioners to discuss options MIKE T mwright@chronicleonline.com Chronicle .A. Citrus County Commission Chairman Gary Bartell and County Administrator Richard Wesch are scheduled to head to Tallahassee this morning to dis- cuss with state officials the water and sewer project for Chassahowitzka. State Sen. aNancy Argen- U WHAT: ziano, R-Dun- Citrus ..,.- nellon, set up the County meeting with Com- Bartell, Wesch mission .. and top officials meeting. .. with the Depart- 0 WHEN: 1 S","-, ment of Environ- p.m. S. mental Protec- Tu6sday. tion. r WHERE: Bartell and First ' Wesch will give a floor report during court- Tuesday's county house, Sc o mm mi s s i o n down- meeting that will town begin at 1 p.m. in Inverness. the county court- TO VIEW house in Inver- AGENDA: AGENDA:, ness. At 3:30 p.m., a WWW. t bocc. presentation is citrus. scheduled about fl.us the Chassa- howitzka issue that gives commissioners options. Commissioners in. November said they would reject a water and sewer project that received just one bid and came in twice the amount officials had estimated. Property owners in Chassahow- itzka were facing an assessment of more than $10,000, plus hook-up fees and the costs to remove their septic tanks. Instead, commissioners said they wanted to see if state grants or loans are available to upgrade septic tanks that need upgrading, while allowing functioning septic tanks to continue. Commissioners sent letters to MATTHEW BECK/Chronicle the DEP and the Department of Arnulfo Macedo unloads some of the thousands of oranges he picked Friday afternoon at an orange grove on Gospel Health asking that both agencies Island owned by Snell and Olivia Mills. Workers in the groves use long wooden ladders to reach high into the tall orange help with the project. The DEP is trees to gather the golden fruit. All of the fruit collected at this grove will be taken to Auburndale, where it will be used charged with protecting the to make juice. Please see /Page 4A Adolph Penno: 'Crusty,' with a heart of gold Friends remember plain-spoken vet was a founding member of VFW Post 4864. nkennedy@chronicleonline.com Chronicle Do yourself a favor. Those who knew Adolph Theo- dore Carl Penno knew that sooner or later he would get around to saying that. "Do yourself a favor go home and go to bed," he would say "Do yourself a favor don't spend your money" He wasn't afraid to speak his mind. If he thought you were doing something wrong, he would let you know. "He was crusty, but he had a heart of gold," said Bob Shepherd, Adolph's friend, as well as state commander of the Veterans of Foreign War, Post 4864 in Citrus Springs. Adolph Penno died Oct. 24 in his Please see /Page 5A X Annie's Mailbox ... 6B Movies .......... 7B Com ics ......... 7B I Crossword .... . 6B Editorial ........ 10A Horbscope .... . 7B Obituaries .... . 7A Community ...... 8A Two Sections 6 18 IIlll4578 2002511 5 'Goblet' still burning For the third weekend, "Harry Potter and the Goblet of Fire" remained the top movie, with $20.45 i:'i .: ii i n tick- et sales./2A Window shopping Models wave at passersby from a shop window in downtown Augusta. Maine./6A A stressful time of year As holidays draw nearer, many people deal with the grief of a lost loved one./Tuesday Man charged with child abuse * Two-year-old witnesses conflict./3A * FHA launching plan to pay mort- gages for hurri- cane victims./3A * Historical society seeks more preservers of the past./3A Sports Bucs battle Saints. Ronde Barber comes up big. FORECAST: Partly 73 ::ou.i '.'ilh slightly i55 I e of s hr.ver in 55 the nmiri'n'r i , h ,, I r -i,hi . 2A MNDA DEEME 5205NTTANETCTUCop'(F)CIOCL LOTTERIES SHere are the winning numbers selected Sunday in the Florida Lottery: CASH 3 2-8-9 PLAY 4 7-0-7-5 FANTASY 5 10 14 28 30 35 -225MB 21,936 $6 THURSDAY, DECEMBER 1 Cash 3: 9- 3- 4 Play 4:9-2-6 -8 Fantasy 5: 3-5 -28- 34-35 5-of-5 3 winners $79,361.13 4-of-5 321 $119.50 3-of-' 6-of-6 No winner 5-of-6 74 $4,752.50 4-of-6 3,986 $71.50 3-of-6 84,078 $4.50 TUESDAY, NOVEMBER 29 Cash 3: 0 9 -4 Play 4:8-9 1 6 INSIDE THE NUMBERS U To verify the accuracy of winning lottery numbers, players should double-check the numbers printed above with numbers officially posted by the Florida Lottery. On the Web, go to cornr; by telephone, call (850) 487.7777. _______ a P e *D0aflso fa *. * mP 4 f ow S aw DidK makn 0n -Mo" a re0-- -a- na a .. a. .a-a - -a e a 0 be ... .- . .g MIgimm k im 4" am "Copyrighted Material Today in Today is Monday, Dec. 5, the 339th day of 2005. There are 26 days left in the year. Today's Highlight in History: On Dec. 5, 1933, national Prohibition came to an end as Utah became the 36th state to rati- fy the 21st Amendment to the Constitution, repealing the 18th Amendment. On this date: In 1776, the first scholastic fra- ternity in America, Phi Beta Kappa, was organized at the College of William and Mary in Williamsburg, Va. In 1791, composer Wolfgang Amadeus Mozart died in Vienna, Austria, at age 35. In 1792, George Washington was re-elected president; John Adams was re-elected vice presi- dent. In 1848, President Polk trig- gered the Gold Rush of 1949 by confirming that gold had been dis- covered in California. In 1955, the American Federation of Labor and the Congress of Industrial Organizations merged to form the AFL-CIO under its first president, George Meany. In 1994, Republicans chose Newt Gingrich to be the first GOP speaker of the House in four decades. Ten years ago: In the first hint of movement at budget talks, White House officials and Democratic congressional leaders said they were preparing a seven- year budget-balancing plan. Five years ago: Florida's high- est court kept the presidential race on the legal fast track, agreeing to a speedy hearing of Al Gore's appeal of a ruling that in effect awarded George W. Bush the state's 25 electoral votes. * One year ago: Gunmen -- ambushed a bus carrying unarmed S. Iraqis to work at a U.S. ammo dump near Tikrit, killing 17. Today's Birthdays: Singer Little Richard is 73. Author Joan Didion is 71. Author Calvin Trillin is 70. Opera singer Jose Carreras is 59. Pop singer Jim Messina is 58. Actor Brian Backer is 49. Country singer Gary Allan is 38. Comedian- actress Margaret Cho is 37. Writer-director Morgan J. Freeman is 36. Actress Amy Acker is 29. Actor Nick Stahl is 26. Actor Frankie Muniz ("Malcolm in the 'Middle") is 20. Actor Ross Bagley is 17. Thought for Today: "All our dreams can come true, if we have the courage to pursue them." - Walt Disney (1901-1966). Syndicated Content * ? Available from Commercial News Providers" 7r0 L ^ 1^ mw SIP * -NA harm mp 'C I t0J6 .1 7 0 0 p a" r ar 4Sb ne~. 4 ta a? a w4e. *W^ ^a *6 n e -em a Sommm m a Smk a I S- - -dab .. .. ..... - ... a...... Ss ~ e r -- - Am p - # I* p. S S _ -aw Am" *woweow m a - -4 ____ w m 61 -.am . W .- a a oft- 2A MowayDECEMBER 5 2005 CITRUS COUNTY (FL) CHRONICLE ENTERTAINMENT Society needs a few good history buffs -. . '.1 to mortgages "Copyrighted Material Syndicated Content ul Volunteers a crucialpan ofhistorical society DAVE PIEKLIK dpieklik@ chronicleonline.com Chronicle The Citrus County Hist- orical Society is looking for more preservers of the past. Like many other organiza- tions throughout the area, the society relies on volunteers to operate. Along with helping with heritage councils in Crystal River, Hernando and Floral City, volunteers could find themselves conducting tours at the Old Courthouse in Inverness-w.hich the his- 9e0to~,~~icqiety.-pperates--- or -heplp~gunr rithe museum, and"' store there. '"They-rer the backbone of ,our organization." Dan Armstrong, historical society president' said last week about those who volunteer: While the society currently boasts a membership that includes 57 volunteers. Armstrong said it's always looking for more help. Next month, the historical society will have its annual election for board members, and once they're situated, Armstrong said the annual volunteer drive will start up its efforts to recruit new members. Providing service to the community through the socie- ty is something he equates with another valuable group of individuals. "Volunteers are just as, important to us as volunteers are to the fire service," Armstrong said. "We save his- tory, and they save buildings and people." Right now, he said, the his- torical society is focusing on finishing preparations for upcoming fundraisers, as well as the elections and get- ting new committee mem- bers, which would include the volunteer committee. Armstrong said despite recent resignations of long- time historical society mem- MATTHEW BECK/Chronicle Two-year-old Aiden Topping has a surprised look on his face when Santa hands him a present Friday evening at the Old Courthouse in Inverness during the 11th year of the "Christmas Trees around the Courthouse" tree-lighting ceremony. The event was held complete with holiday music performed by a number of church and community groups. The event was one of many sponsored by the Citrus County Historical Society. bers, it still has a full commit- ment from its volunteers. The resignations he referred to are that of former vice president Beverly Drinkhouse, former director Marcia Beasley and former president John Piersall. The three quit in the past several months, in part, because of a dispute between the society and Betty Strifler, Citrus County Clerk of the Circuit Court, about space at the Old Courthouse. The sides were in.disagree- ment about the building's lease and an office there that Strifler uses. Though the his- torical society's board of directors felt the lease pro- hibited that, the county com- mission sided with her and she remains in the county archives office. Armstrong said he was recently contacted by a cou- ple of people who wished to volunteer for the society, who were aware of the dispute. He said their reaction was that it was too bad, but things must move on. "That's kind of the atti- tude," Armstrong said. "We have to keep going." And things are going for- ward. He continues to collect applications for potential vol- unteers, which he said are in .short supply right now because of the holidays and vacations. He hopes to address issues shortages have created, including having to keep the Old Courthouse Heritage Museum and store closed on Saturday because of the lack of volunteers. Armstrong said those who join get to feel the nostalgia of working in a historic spot, and the personal satisfaction of helping the community. Laurie Diestler, the educa- tion coordinator at the court- house, agrees. Opportunities to help range from working in the museum store, to helping in the photo shop or research department, giving the perfect chance, she believes, for a person with a taste for history. She and Armstrong agree the volun- teers deserve credit for their help. "Many of our (guides) are history buffs. The ones that are here are so interested in history, this is their job every week," she said. "They're very, very dedicated." - k .t - - Homosassa man arrested in child abuse case KHUONG PHAN kphan@chronicleonline.com Chronicle A Homosassa man arrested Sunday morning is being accused of child abuse. According to the Citrus County Sheriff's Office, David Paul -Curry, 34, was arrested on charges of child abuse and violation of an injunction that pro- tected a woman from domestic abuse/repeat violence. Police were originally called to the scene Saturday after a dispute broke out between Curry and the woman. In the police report, the woman claimed that Curry had come over to her home to return a cellular phone. After return- ing the phone, the woman asked Curry to leave, but he refused, and, instead, picked up a 2-year-old child. In the report, the woman said she continued to ask Curry to leave. Upset, Curry allegedly threw the child onto a couch, causing the child to cry. Curry finally left after a relative of the woman forced him out of the home. Police found no noticeable injuries on the child. When questioned by police, Curry stated that he had in fact gone to the woman's home to return the phone. He also said that he had not thrown the child onto the couch as the woman claimed, but had instead tossed the child to the woman from a distance of one or two feet away mimicking a game that he and the woman had often played with the child. Curry went on to tell police that despite the injunction, he and the woman had gone bowling together recently The woman disputed Curry's account of what happened, telling police that she and Curry never tossed the child to one another in a playful manner. She also told officers that after his initial visit to her home Saturday, Curry called her repeatedly, asking if she could meet him somewhere. No bond has been set. I 4~ha~c 'j~4~~% U..', ~ a S **0 . * "Copyrighted Material Syndicated Content Available from Commercial News Providers" with aH4 ME& ap P a a~ fir poesmwm - _ o, Available from Commercial News Providers" FOR MORE INFORMATION E Anyone interested in volunteering for the Citrus County Historical Society can call 341-6427, or stop by the busi ness office at the Old Courthouse, 1 Courthouse Square in Inverness L7777- County Online assistance available for needy More than 170 people a day in the Florida Department of Children and Families' District 13 (Citrus, Hernando, Lake, Marion and Sumter counties) are seeking financial assistance and food stamps for their fami- lies. Recent DCF data also shows 68 percent of those appli- cations are now being received via our Access Florida Web site at- florida. Anyone whose health or well being is compromised by a tem- porary financial crisis or an ongoing struggle to provide food for their families should take advantage of the efficiency of the Web application, and request Access Florida services immediately. For information, log on to the Web site or call (866) 762-2237 toll free. From staff reports ' A DAY DECEMBER 5, 2005 - - - A'A: MONDAY, DECEMBER 5, 2005 CUB seeks help SEWER Continued from Page 1A Special to the Chronicle While many organizations have been developed through the years and do a good job of helping the residents of Citrus County, only one organization has been serving the communi- ty for more than 27 years: Citrus United Basket CUB has been, and remains, the one- stop location for those resi- dents in need. CUB is supported by United Way, representing about 10 percent of the total disburse- ment in any given year. Donations from individuals, civic organizations and clubs, churches and schools, repre- sent at least 90 percent of the food, money, clothes, furniture, appliances and numerous other items. CUB handles and disburses as needed to the res- idents of Citrus County. During December 2004, Citrus United Basket assisted more than 3,973 people, dis- bursed more than $31,000 worth of f6od, helped residents with emergency financial assistance representing more than $2,400, and provided almost 2,200 youngsters with almost $43,000 worth of donat- ed toys. You, the residents of Citrus County, made all this possible. As Christmas 2005 approach- es, CUB once again turns to the community for assistance. School food drives, cash dona- tions from individuals and organizations, and the numer- ous toy drives allow Citrus United Basket to "Make a Significant Difference" in our community. We anticipate feeding more than 1,500 families for Christmas this year. With the average cost per dinner being projected at $22, Citrus United Basket will distribute more than $33,000 worth of food. CUB is especially in need of 1- and 3-pound canned hams and small turkeys. The hams repre- sent more than one-third of the total cost for Christmas din- ners. Anyone wishing to make a donation to Citrus United Basket can either deliver the hams to the CUB office behind the New Courthouse at, 103 Mill Ave., Inverness; or mail it, to Citrus United Basket, PO. Box 2094, Inverness, FL 34451. For more information, call Nola Gravius, executive direc- tor, at 344-2242 between 10 a.m. and 3 p.m. Monday, through Friday. 352-726-2424 465 S. Croft Ave. (Parkside Plaza) Accent Furniture Accessories Artwork Lamps Mirrors Wallpaper & Window Treatment Showroom Mon-Fri 9-5 Sat (By Appointment Only) 352-560-0330 o Historic Merry House, Downtown Inverness Behind Wendy's i'a i f i i j i y "j Up to $1,600 In Rebates and 10% DISCOUNT For full payment upon completion AIR SRVICE LENNOX INDOOR COMFORT SYSTEMS A better placeT 4811 S. Pleasant Grove Rd. Inverness, FL 726-2202 795-88081 LIC #CMC039568 Chassahowitzka River, an Outstanding Florida Waterway. The health department over- sees septic tank inspections. Mimi Drew, DEP's director of water resource manage- ment, sent a letter late last week that outlined some options, including rebidding the project. The letter said that Bob Holmden, with the DEP bureau of water facilities funding, will attend Tuesday's GEL Continued from Page 1A gelatin on his dock or his neighbors' docks. Wood said she has seen the gelatin chunks show up on docks in other locations. When that happens, she said county employees go out with brooms to brush it off the commission meeting to answer questions. Argenziano has suggested the county tap into a low-inter- est state loan program to help residents pay for replacing septic tanks. She said that would knock $8 million off the $10 million price tag the county estimates for the project. Drew's letter says the state revolving fund is the DEP's only source of low-interest loans for wastewater projects. It states, however, that the loans cannot be used to assist homeowners to upgrade sep- tic tanks. docks. She said the granules are so small they might not be notice- able on a dock until they became wet and puffed up. Wood said a county crew probably used a blower to dis- tribute the granules. She said the herbicide is designed to kill aquatic weeds on contact. "We try to be careful not to ge t on docks, but sometimes it happens," she said. SBest Wester Citrus Hills Lodge ' ES -7 In the middle of "Nature's Paradise" 350 E. Norvell Bryant Hwy. Hernando, FL 34442 Next to Ted Williams Museum 1 (352) 527-0015 1 (888) 424-5634 COMPANY COMING ? -For the Crystal River Police DUI arrest Nicholas Cito, 73, 12334 W. Checkerberry Drive, Crystal River, at 11:31 p.m. Saturday on a charge of driving under the influence. His bond was set at $500. Other arrest Jermiah Franklin Smith, 3072 S. Colenatius Way, Homosassa, at 6:47 p.m. Saturday on a charge of knowingly driving with a suspended license. His bond was set at $1,000. Citrus County Sheriff Arrest Joseph William Owens, 26, 10535 E. Rabbit Lane, Floral City, at 7:40 p.m. Saturday on a charge of possession of drug paraphernalia. He was released on his own recognizance. Florida Highway Patrol DUI arrest Randy Hackney, 50, 7 S. Friar St., Inverness, at 5:40 p.m. Saturday on a charge of driving under the influence. His bond was set at $500. Other arrest Kenneth James Rapoza, 37, 7259 S. Withlapopka Drive, Unit A, Floral City, at 3:35 p.m. Saturday on charges of knowingly driving with a suspended license and operating a motorcycle without a license. His bond was set at $1,000. ON THE NET * 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. SShelter Store TUnr Tinru Si 9imj5m S t o re a Furniture *-* .Hardware .- f* Household S746-9084 1729 W Gulf to Lake Hwy. * Next to Inler-County Recycling jHR O Florida's Best Community Newspaper S To start your subscription: Call now for home delivw Citrus County: (352) 563-5655 Ma or visit us on the Web at .html to subscribe. 13 wks.: $33.50* 6 mos.: $56 *Plus 6% Florida For home delive In Florida: $59.00 for 13 weeks Elsewt To contact us regarding your 563-5( Call for redelivery: 6 to 11 a.m. I. 6:30 to 11 a.n Call with questions: 6 a.m. to 5 p 6:30 to 11 a Main switchboard ph Citrus County 563-6363. Citrus S County residents, call toll-free at 1-81 I want to plac To place a classified ad: Citru Mari To place a display ad: 563-i To place an online display ad: 563-3 nccs, I want to send information MAIL IT TO US The Chronicle, P.O. I FAX IT TO US Advertising- 563-5( E-MAIL IT TO US Advertising: advertise Newsroom: newsdes Where to fil Meadowcrest office In 44 i ,. ',( ., :\ '. '" .1 - 1624 N. Meadowcrest Blvd. 1C Crystal River, FL 34429 Inv Beverly Hills office: Truman Boulev i491/ ------ 3603 N. Lecanto HiE Beverly Hills, FL Who's in c\ Gerry M ulligan ............................ Charlie Brennan ................... Tim Hess ................................ D John Provost................................ Neale Brennan ...... Promotions/Commu John Murphy .............................. Tom Feeney ..................... . Kathie Stew art ............................ Report a nem Opinion page questions ................... To have a photo taken ................... News and feature stories ................. Community/wire service content ......... Sports event coverage .................... Sound Off ....... ................ Founded in 1891, The Chronicle is print Please recycle your Visit us on the World Wide Web Published every Sunday By Citrus Publis 1624 N. Meadowcrest Blvd., C Phone (352) POSTMASTER: Send ad Citrus County POST OFFICE BOX 1899, INVE F ,106 W. MAIN ST., INVEI ^ S PERIODICAL POSTAGE PAIl SECOND CLASS PER SICLL Serving Florida's Best Community ery by our carriers: irion County: 1-888-852-2340 aturecoastcentral.com/chronicle 8.50* I year: $103.00* sales tax ry by mail: here in U.S.: $69.00 for 13 weeks r service: 655 monday through Friday m. Saturday and Sunday i.m. Monday through Friday .m. Saturday and Sunday hone numbers: Springs, Dunnellon and Marion 88-852-2340 e an ad: s 563-5966 on 1-888-852-2340 5592 3206 or e-mail us at ales@chronicleonline.com on to the Chronicle: Box 1899, Inverness, FL 34451 665, Newsroom 563-3280 sing@chronicleonline.com ;k@chronicleonline.com rind us: verness office 41- n -.r, 4 , 6 -. 'A: 06 W. Main St., verness, FL 34450 Visitor ard ghway large: ............ Publisher, 563-3222 ................ Editor, 563-3225 director of Operations, 563-3227 . Advertising Director, 563-3240 inity Affairs Manager, 563-6363 . Classified Manager, 563-3255 Production Manager, 563-3275 Circulation Director, 563-5655 ws tip: .... Charlie Brennan, 563-3225 ...... Linda Johnson, 563-5660 ....... Mike Arnold, 564-2930 ........ Cheryl Jacob, 563-5660 ........ Andy Marks, 563-3261 ........................ 563-0579 ed in part on recycled newsprint. r newspaper: through Saturday shing, Inc. Crystal River, FL 34429 563-6363 'dress changes to: Chronicle RNESS, FL 34451-1899 RNESS, FL 34450 D AT INVERNESS, FL MIT #114280 726-8822 1-800-832-8823 heritage Propane 99 Serving America With Pride $199 INSTALLATION SPECIAL- INTALTIN INCUE Y F E anS et SulCo m ria Seidnil evc asV ou Etie P ysem ee FllDeivry Seric redy epu S erie-.BugetPayPla 2700 N. Florida Ave., Hernando, FL* Serving All Of Citrus County N -.-I r.; v Why wait for the new year to start a new you? A' rW . E Join o Bellamy Groves Fresh Citrus Fruit From Our Own Grove INVERNESS GROVE Navels GROVE Nave M Red GrapefruitsATION 1 Red Grapefruits o Juice Oranges : I EDEN DR. 1 1 MI FROM HWY 41 .,Zr- 14 16' Gift--, f ihippi-. .lOA [,_],' b: .. L E O I, h .A"" "a"' Read; tor FAIRGROUNDS "I, h , Open 9-5 Nlonda Salurda P : Closed on Sunda- Phone 726-6378 * - ~Lj~jvj I ~6~ -J Season's Greetings from Our Family to Yours! I 1, : . i VanAllen INSURANCE AGENCYZ-- . 352-6.3. 751 9 1 OS ', . *. 1 .1 Verticals Sil 0 tt Wood Blinds S S ut r ys a pi at hutters rt*co's rystal Pleat Silhouette t I Am Imb.- j ---j CrIRus COUNTY (FL) CHRONICLE Crnous COUNTY (FL) CHRONICLE MONDAY, DECEMBER 5, 2005 5A PENNO Continued from Page 1A hometown of Des Plaines, Ill. His memorial service in his adopted home of Citrus- Springs was Friday. He was 88. Although Adolph served only one hitch in the Army, serving in the Pacific Rim from 1942 to 1945, his association with the 617th Ordinance Battalion Army Maintenance unit stayed with him until his death. In 1977, he began organizing annual reunions, with the first one in Chicago and his last one in Washington, D.C., in September He was the one to round people up, get trophies and medals made, act as emcee. "He was always talking on the phone," said Marion, his wife of 64 years. "He had a loud voice, and he would say, 'Come to the reunion!"' As a veteran of World War II, Adolph belonged to the local VFW post, first in Illinois, then transferring his membership in 1987 to the post in Citrus Springs that bears his brother's name, Edward Penno. After Adolph retired from McMaster Carr Supply Company, where he worked as a catalog proofreader, and after the death of his 22-year- old son, Teddy, he and Marion came to Citrus County. The first two things Adolph did find the nearest Lutheran church and the near- est VFW post. At the time, the veterans met at the community center on County Road 39. Adolph was one of the members to realize if they wanted to grow they had to have their own place. The current building was for sale and a bid of $80,000 was put to a vote. Everyone voted yes - except Adolph. Afterward, he told Shepherd, then-post quar- termaster, "I voted no, but trust me; I'll be one of the biggest backers you'll have." He was, too, Shepherd said, beginning with a donation for $10,000 and then a yearly dona- tion of $2,500 with a matched donation from McMaster Catr His only request was that the post be named after his broth- er. "He came to every meeting, and every Friday night he was here for dinner," Shepherd said. He served in the honor guard, attended all the memo- rial services for fallen veter- ans, as well as ceremonies for Memorial Day and Veterans Day. (toll free) Happy Dayz Diner 727 Highway 41 South (In front of Central Motel) Inverness Florida Knee & Orthopedic Pavilion , Largo Medical Center ANY FIVE (5) CLEAN ONE SOFA A ROOMSAND ONE (UPTO 7 FT.) OFF 1 HALLCLEANED AND ONE CHAIR I II O FF FREE CLEANED I $ OFF SI ISUPERSHIELDAPPLIED ANYTILE I 3I I II TOANYJUST CLEANED AN I II CARPETANDIOR II AND GROUT (Clean&Protected$240) UPHOLSTERY CLEANING STLET (ean& Protected $113) STANLEY STEEMERi STANLEYTTEEMER. MUSTANLEYSENTCOUPO STANLEYSTEEER. MUSTPRESENTCOUPON MUST PRESENT COUPON. IRESID6NT NLYROOMIS MUSTPRESENTCOUPON RESIDENTIAL OR RESIDENTIAL OR AREAUPTOOs LSOFT 1I RESIDENTIAL ORCOMMERC I COMMERCIAL. MINIMUM COMMERCIAL. MINIMUM DINING COMBOSORGRET EXCLUDING LEATHERAND CHARGE IS REQUIRED. CHARGE IS REQUIRED. ROOMSCOUNTASTVOROOMS IHAITA COMON COUPON COUPON COUPON COUPON EPIRES 121 E0 IM Eim IRES 1O EXPIRES 12/31105. EXPIRES 12/31/05. L- '" I Chronice I L Chronicle L _,,,hoce J Over 50 years experience No soap residue in your carpet to oatractldirt Furniture carefully moved & returned Professionally trained personnel J_ No electricity needed I 11 ii a Radio dispatched trucks H o lid ay IICRC Certified W is h es Special treatment of heavily soiled areas Drug-free workplace F rromI *Supershield available STANLEY No hidden costs QW PMPD 'Deodrizers available 'B ST STEEMERS Water extraction service '.-r- W e Hard surface cleaning 4 i-Nvt Work DEHUMIDIFERS & Saturday AIR MOVER RENTALS | t0 AVAILABLE too! 726-4646 i STANLEY TEEMER CAIiT CI.CAHIR -,n i 1ILE &GROUT 1-800-STEEMER or schedule online at CLEANING EXPERTS stanleysteemer.com He was always talking on the phone. He had a loud voice, and he would say, 'Come to the reunion.' Marion Penno describing how her late husband, Adolph Penno, would organize military reunions. Adolph was instrumental in growing the membership from 148 to 300 he was so excited about the post that he would recruit members from as far away as California. "If he started talking to you, you were going to sign up," Shepherd said. "I'm going to miss him." Adolph was a veteran, a strong Christian, an avid White Sox fan, a devoted husband and father. He met Marion when her brother brought him over with another guy The 17-year-old Marion liked the one they called "Shorty," who turned out to be Adolph. One night as Marion and her sister sat on their porch singing, "When You Wish Upon A Star," as Marion made her wish a car drove up and out stepped Adolph. "I said to my sister, 'I was hoping it was him,'" Marion said. They were married on Oct. 18, 1941. They have five chil- dren, six grandchildren, six VERTICAL BLIND OUTLET 649 E Gulf To Lake Lecanto FL S. 637-1991 -or- 1-877-202-1991 Small Ad [ALL TYPES OF BLINDSIS^mall Pe A Ar^r7777777^f '7 Don't have another silent night. Give the gift of hearing. :FREE BATTERIES ;"$300.00 OFF: i Buy 1 package of batteries at reg. s iAny pair of Premium Digital I I price and get a 2nd package free. I Hearing Instruments i | Expmres12/31J05 *I Explre Ii5311r 5 1I OU UL LI Professional Hearing Centers 211 S. Apopka Ave. Inverness (352) 726-4327 great-grandchildren and three "granddogs." He loved listening to choir and chorus music, and sang with the men's chorus at Hope Lutheran Church in Citrus Springs and with the Citrus Hills Barbershop Chorus. He sang bass and would serenade Marion with "Gimme A Little Kiss, Will Ya, Huh?" "We had lots of good memo- ries," Marion said. Adolph loved showing his visiting grandchildren around central Florida, especially the horse farms in Ocala and tak- ing them to the VFW post. He would say, "Look what we built!" He liked to eat at Joe's Restaurant in Inverness; he liked rhubarb pie. He played cards Kings in the Corner and pinochle he watched poker on TV; and read the Wall Street Journal faithfully. He would clip articles and send them to his kids always in an already-used envelope. "It was so funny how he would cross out the address and put our names or put a sticker over it," said his daughter Diane Petersen. He didn't like waste, never threw anything away, always brought discarded clothes to the churches. "He was always thinking about us," Petersen said. "He was always thinking about others." FORGET TO PUBLICIZE? * Submit photos of successful community events to be pub- lished in the Chronicle. Call 563 5660 for details. 1-~~,, 'OL:. I -I *Detailed Oriented * Bling Bling Tees * Jeans Faux Fur Purses,etc. N-1- SALE IN , PROGRESS 338GuftoLkeHy. ous Hw.4, ona iSqIvresT s-i10-5 - Sprint ,.-t,.4-,,time and Cinemax? * Six free months of High Definition programming. * Combine with Spr nt high-speed Internet or other qualifying services to save even more. * All on one monthly bill, without the drama.vdshnetwork corn HO receivers require additional purchase of DISH Network HD Pak. Digital Home Advantage: Pay $49.99 activation fee, receive $S49 99 credit on first bill with 18-month qualifying programming purchase. Restrictions apply, including credit approval and monthly fees for receivers. Early cancellation fee applies DISH Network retains ownership of equipment. Limit four tuners per account Free Programming: Requires participation in Digital Home Advantage offeu After free period. customer must call to downgrade to other qualifying programming, or then-current price for selected programming package will apply Customer must SPR4130 651054 AIRPORT TAXI 746-2929 C-Qp E 1Hw) 1 LCrpi.li .w MONDAY, DECEMBER 5, 2005 5A CITRUS CouNTY (FL) CHRONIClE GA MONDAY, DECEMBER 5, 2005 %XEIRD XVIRE CITRUS COUNTY (FL) CHRONICLE - o S - -O * -eme .D ...- 44M0 0 s -- I - _-'--oo o .~ - % -- i- o- I -- eme ** * Imamw m 0 ab d~b NOW0 60 4m 40 40mm at 4 - d o * __ - Copyrighted Material - - aill Syndicated Content- P_-ov-- -- Available from Commercial News Providers" -- - ___ A ____________________w --.0- -0-- b -- O ---,. o- --mm ft - a- 4 - _____ M- - bmmp- "I'm Wearing One!" "The Qualitone ClC gives you better hearing for about 1/2 the price of others you've heard of I'm wearing one! Come & try one for yourself. I'll give you a 30 DAY TRIAL. NoOBLIGATION." on Qualitone CIC David Ditchfield TRI-COUN1Y AUDIOLOGY Audioprosthologist & HEARING AID SERVICES Inverness 726-2004 Beverly Hills 746-1133 Since 1955 mm mmeWHITE Since 195E ALUMINUM Get Ready for the Holidays Sale! Patio Covers Vi y & Screen Rooms! CARPORTS! cryli creenoms r := "l NDOW_ ...... Real-overs Storm Protectien Glass Reoos Vinyld RiBtlflR itilooms Awnings-* Patis Cavers-* Camrports Floridae Ramns* Windows-* SofflIt/Fascla s-_I Vilny Siding Pooeel Cages Skirting Supplies* O-IT-YOURSELF KITS www-whiteamumgnumcom niB m uwM*.WwuTE. lecanto 746-3312 6,m,330m9, TOll Free 800/728-1948 SYou ar cordially invited to attend our 9th Annual Candlelight Remembrance Service to honor each of our families and loved ones on Thursday, December 8, 2005 at 6:00pm 1 GARDEN FUNERAL HOME & MAUSOLE S igni ty 5891 N. Lecanto Hwy. ordignitymemorial.com Beverly Hills, FL 34465 www~dignitymemorial.com I --A A A p3 TR'cD IM^ (352) 746 (352) 489 FUNERAL HOMES WITH CREMATORY MEMORIAL GARDENS CEMETERY -4646 -9613 1 S UM I "WhenCompassionM ttersMst -* m 1 Swrww.allaboutbaths.com All T About rjY - 4w oft w abqw - o_____a_ m Mb An- fm q- A- smm -m O --op- 4-40 qm -.-M m G m d 4 o Lower Energy Use *' Operates Quietly * 7It'v I j-rd To In A Trnoo ,', Lasts A Long Time CURRIER COOLING & HEATING, INC 00I (352) 628-4645 (352) 628-7473 CC >> 4855 S. Suncoast Blvd. (HvHwy. 19 So.) ,, ,, Homosassa, Florida 34:446 Eye FREE Tint Progressive &UV Examinations Present Bifocal this Ad. A $30 Value *59 We accept some insurance plans including: Vision Care Plan Eye Med Medicaid DR. WERNER JAEGER, OPTOMETRIST 3808 E. Gulf to Lake, Inverness Times Square Plaza E 344-5110 A Licensed Opticians: Cheri Fowler Paul Burghardt Cataract Evaluations Available From Lawrence A. Seigel, MD *Alan M. Freedman, MD Suncoast Eye Center Eye Surgery Institute 221 N.E. Hwy. 19, Crystal River, FL (352) 795-2526 6A MONDAY, DECEMBER 5, 2005 WEIRD WIRE ChIRUS COUNTY (FL) CHRONICLE MONDAY, DECEMBER 5, 2005 7A Obituaries , < u 1 Vivian Amon, 78 CRYSTAL RIVER Vivian L. Amon, 78, of Crystal River, died Saturday, Dec. 3, 2005, at Citrus Memorial Hospital in Inverness. She was born Aug. 29, 1927, in Bridgeport, Conn., to Charles and Mae (Gill) Whitehead and she moved here 30 years ago from Palatka. She was a homemaker. She was a member of the Jehovah's Witness Kingdom Hall of Inverness. Survivors include her daugh- ter, Janette Holmes, Crystal River; four grandchildren, Nick Holmes, West Palm Beach, Amanda Holmes, Crystal River, and Lee Amon and LaDonna Amon, Palatka; and one great-grandchild. Brown Funeral Home & Crematory, Crystal River. Ellen Markel, 61 INVERNESS Ellen B. Markel, 61, of Inverness, died Friday, Dec. 2, 2005, at Citrus Memorial Hospital in Inverness. She was born Nov. .9, 1944, in Tennessee to Horace and Wilma Jean (Sheldon) Coachman. She moved here in 1992 from South Miami. She was a homemaker. She was Lutheran. Survivors include her son James P Markel Jr., Billings, Mont; her mother, Wilma Jean Coachman, Inverness; one sis- ter, Linda Herron, Divide, Colo.; two nephews, Shawn Meiman, Fort Lauderdale and Todd Sabino, Long Island, N.Y; and two nieces, Colette Sabino, Florida, and Sherri Sabino, Savannah, Ga. Brown Funeral Home & Crematory, Crystal River. Sylvia Moyer, 80 INVERNESS Sylvia M. Moyer, 80, of Inverness, died Sunday, Dec. 4, 2005,. at Arbor Trail Health and Rehabilitation Center. A native of Indianapolis, Ind., she was born Aug. 19, 1925, to Charles and Ethel (Winters) Jones. She moved here in 1980 from St. Petersburg. She was an office clerk She was Catholic. She was preceded in death by her husband, Vance S. Moyer, on Jan. 2, 1995. Survivors include her care- taker Eileen Creason of Inverness. Chas. E Davis Funeral Home with Crematory, Inverness. Irene Wollard, 91 HOMOSASSA Irene M. Wollard, 91, of Homosassa, died Dec. 2, 2005, in Crystal River She was born in Lakeland to George and Alice (Overmayer) Robertson. She moved to the area in 1980 from Hollywood. Mrs. Wollard was a home- maker who enjoyed her veg- etable and flower gardens and cooking for her family. She was Christian. She was preceded in death by sons, William Lee Wollard and George Wollard, and also by five brothers and one sister. Survivors include her hus- band of 71 years, Troy M. Wollard of Homosassa; her daughter, Betty Bruner and husband Dean of Fruitland Park; 11 grandchildren; and two great-grandchildren. Fero Funeral Home with Crematory, Beverly Hills. Donivan Zachary, infant CRYSTAL RIVER Donivan Matthews Zachary, infant son of Gilbert and Constance Zachary of Crystal River, died Tuesday, Nov. 29, 2005, at Seven Rivers Regional Medical Center in Crystal River. In addition to his parents, he is also survived by his grand- mothers, Tina Figieri, Crystal River, and Janet Zachary, Dunnellon; paternal great- grandmother, Marjorie Zachary, Dunnellon; and sever- al aunts and uncles. Brown Funeral Home & Crematory, Crystal River. Deaths ELSEWHERE, Mary Hayley Bell, 94 ACTRESS LONDON Mary Hayley Bell, an actress and author who wrote the novel "Whistle Down the Wind," died Thursday, according to a family death notice published Saturday in The Daily Telegraph. She was 94. The cause of death was not given, but Bell had been suffer- ing from Alzheimer's disease. Her best known work, "Whistle Down the Wind," was turned into a successful 1961 film starring her daughter Hayley Mills as the eldest of three farm children who mis- take an escaped murderer for Jesus Christ. Andrew Lloyd Webber later turned it into a stage musical, relocating it to the Deep South. Born in Shanghai, China, where her father was a cus- toms official, Bell had a prom- ising career as an actress in the 1930s, making her London debut in 1934 with "Vintage Wine" and later working with the Manchester Repertory Company. In 1937-8, she toured Australia in "Victoria Regina." She gave up the stage after marrying actor Sir John Mills in 1942. John Stewart Detlie, 96 ARCHITECT, DESIGNER WESTLAKE VILLAGE, Calif. John Stewart Detlie, the Hollywood set designer, artist and architect who led the effort to camouflage the Boeing airplane factory during World War II, died Wednesday of lung cancer, his wife, Virginia, said. He was 96. Detlie was born in Sioux Falls, S.D., in 1908, and earned architecture degrees from the University of Pennsylvania. He moved to Hollywood to work in the movie industry, and in 1940, was nominated for an Oscar for design work on "Bitter Sweet." His art director credits include "A Christmas Carol" and "Captains Courageous." Detlie, whose first wife was movie star Veronica Lake, left Metro-Goldwyn-Mayer studios in 1942 to manage the camou- flage project as a member of the Army Corps of Engineers. To confuse enemy bombers, Boeing Aircraft camouflaged nearly 26 acres of the plant in Seattle, where the B-17 and the B-29 were built. The plant was covered with a three-dimen- sional wire, plywood and can- DISCOUNT INTERIOR 1W WALLPAPER' IH RPLUS... HUTER STARTING A!E iLEC INSTALLED 1V BEST SELECTION, BEST PRICES S U T Justwestof tie intersection of 41 & 491 Beverly Hills/Holder .800.5311808 489.0033 MERRY CHRISTMAS FROM DRAKE CARPET SERVICES S.4 FREE TEFLON FREE BOTTLE OF *- D .. SPOT CLEANER 2 . EVERY 3RD ROOM B. CLEANED FREE. OH NO, MOM JUST CALLED AND SAID THE WHOLE FAMILY WE BE HERE FOR THE HOLIDAYS.....CARPETS ARE A MESS, NO PROBLEM CALL D.C.S. LET US SPRUCE UP YOUR CARPETS BEFORE COMPANY SHOWS UP, OR LET US CLEAN UP THE MESS WHEN THEY LEAVE. WE OFFER THE MOST THOROUGH CLEANING OF YOUR CARPETS AND BACK IT WITH OUR 200% GUARANTEE CALL TODAY FOR A FREE NO OBLIGATION IN HOME ESTIMATE 352-795-0859 352-220-3938 REMEMBER ITS ALWAYS EVERY 3RD ROOM CLEANED FREE vas structure that was made to look like a town instead of a wartime airplane factory. He designed a number of landmark Seattle buildings while in the Northwest, includ- ing Children's Orthopedic Hospital, several University of Washington buildings and Temple De Hirsch. John lannacone, 94 PILOT LAKEHURST, N.J. John lannacone, one of the last sur- viving "sky sailors" from the Navy's rigid airship program in the 1920s and '30s and a hero of the Hindenburg crash, died Friday after suffering a heart attack, Lakehurst Capt. L. Bret Gordon said. He was 94. lannacone was a petty officer with a ground crew when the Hindenburg burst into flames on landing May 6, 1937, killing 36. He helped save passengers by carrying them to safety. He served in the Navy's air- craft carrier fleet and during World War II hunted German U-boats from blimps. lannacone spent 44 years with the Navy as a chief petty officer and civilian worker. HEINZ FUNERAL HOME & Cremation Just like you...We're Family! .1t% "Copyrighted Material Syndicated Content Available from Commercial News Providers" H 7u r ..".. r r.*.*r t. . Your AUTHORIZED LIONEL Value-Added Dealer : Better Hearing Is Our Business I A Hearing Loss L *^ ~Is A Lot More Noticeable | Than A Hearing Aid. l Jerillyn Clark ,,. I Board Certified t Licensed HearingAid Specialist a I I Advanced Family Hearing Aid Center I "A Unique Approach To Hearing Services" I 6441 West Norvell Bryant H. Crystal River 795-1 775hj 6441 - - - 2005 hurricane season was the most active in history... REpTm&iT3 NSW ID + Bahama Shutters + Storm Guard Aluminum Awnings + D.' ? Be h + Hurricane Panels + Accordions Shutters + + Wind Guard Hurricane Windows + gnip1pared7 P.owed Your Home 29 Years as Your & Vaduables! Hometown Dealer Get Protection From: Hurricanes & Storms ____ Burglaries *Rising S.. Insurance Rates : *&" I WMtinGuard TODAY' "- '~ * SOLATUBE. The Miracle Skyight That's all it takes for you to see the light. Let us show you the difference Solatubc skylights can make in your home. r Io : ir Dr p 1M S -2 CITRS ARNICA& ITLIANCLU 969 BI &O 0 Doors Open 12PM Sun. 2PM All Games $50.00 Pay-Out Based on Attendance of 75 WINNER TAKE ALL Early Birds Bonanza 50/50 Jack Pot Packages start at $10.00 DOOR PRIZES S With This Coupon Free Coffee BUY 1 BONANZA I Hot Food Available I CET 1 FREE I 1 4325 S. ittle Al Point 637-9501 or 7266155 1. F BINGO PRIZES'- 50 TO A250 NEARLY RD4BY L 7A A+ JACKPOTS KNIGHTS OF COLUMBUS Abbott Francis Sadlier #6168 352/746-6921 W Located County Rd. 486 & Pine Cone Lecanto, FL (1/2 Mile East of County Rd. 491) With Coupon - IKo BUY 1 BONANZA 6168 GET I FREE .., ,_* -. I, .- *^." 'e*-_- ^-' k id HOMOSASSA LIONS r BINGO l st Monday $15 Every Month at 6pm Package $50 Payout Per Game $20 Pkg. (5) $250 Jackpots Free Coffee & Tea Non-Smoking Room HOMOSASSA LIONS CLUB HOUSE Rt. 490 Al Becker 563-0870 LIONS AUXILIARY BINGO 8 Friday Nights @ 6:30prr 3 JACKPOTS WINNER TAKES ALL KING & QUEEN Refreshments Avail. FREE Coffee and Tea * Non-smoking Room $15 pkg. $50 Payout Per Game Homosassa Lions Club House, RT 490 Bob Mitchell 628-5451 3 2001 NO GAMES LESS THAN $50 $200 25. SS0, $250 TOTAL $350 GAMES PLAYED ON HARD CARDS (20) 14 GAMES ......................$50.00 AT 20 0 EACH 4 SPECIAL .......... J 5.....$50.0 LEAST BINGO 1STJACKPOT..................$200.00 BINGO! * 2ND JACKPOT...............$250.00 13 CARDS................10.00 IN 50 NUMBERS -IF NOT CONSOLATION PRIZE$200 15 CARDS. ..........10.50 ALSO 8 SPEED GAMES BEFORE REGULAR BINGO 1 8 CARDS ....................... 1.00 / EA. GAME $50.00 24 CARDS .......................13.00 COST '4.00 TOTAL '400.00 PECIAL. -uy Speeod-ExtraPck $2.00 each 30 CARDSK ......... .......... I .00 *PLAYOUTS BASED ON ATTENDANCE OF A 100 PLAYERS.* CIas. E. 2 cauii Funeral Home With Crematory Burial Shipping Cremation Member of International Order of the LEE For Information and costs, call S3246 726-8323 -I .-JIM11141WAIMM, . Smoke-Free Environment FM Coffee & Too TV Monitors for Your Convenience Sandwiches & Snacks - 11 CITRUS COUNTY (FL) CHRONICLE 8A MONDAY DECEMBER 5, 2005 nAA cri.)onil.,Ornhre coi FCSP plans 'Gift Special to the Chronicle The Family Caregiver Support Program is presenting a day of celebra- tion, recognition and appreciation for family caregivers Wednesday, Dec. 7, at Unity Church of Citrus County, 2628 W Woodview Lane, Beverly Hills. Family caregivers are invited and encouraged to come and enjoy this special day The keynote speaker is Linda Ball, R.N., presenting her special program "Reaching for Rainbows." Other guests include Joseph Bennett Jr., M.D.; Thomas Slaymaker, attorney-at-law; Suzanne Platt, CSA; Jonathan Beard, Hospice of Citrus County; and Kathleen Bogolea, director of Family Caregiver 'Support Program. In addition, there will be great entertainment featuring Sally Langois' "Christmas Vegas Buddies." All activities including lunch, door prizes and gifts are free for the family caregivers attending this won- derful holiday event. Seating for this event is limited and Our ( reservations are plea ed t requested. If care- d givers would like this eff more information, reservation or respite assistance for the day of the event, call (800) 717- 3277. "Our organization is pleased to be a part of this effort by the community to recognize and celebrate the valuable role caregivers play,"' said Sandra McKay, program specialist with the Family Caregiver Support Program. Sponsored by the Florida Department of Elder Affairs and the Alzheimer's Association, this program provides fam- ily caregivers in 16 north central Florida counties with support groups, education, training, respite assistance Clubs make lasting impact B oys & Girls Clubs of p" Citrus Coun- ty provide a lasting 'A L impact on the lives of members by j ; focusing on five key . elements. A safely and secure ,' . environment: Clubs provide a safe, posi- Lane tive environment BOY that is age-appro- GIRLS private and. have clear rules and boundaries to define struc- ture to members. Club settings are predictable and secure to members. Kids have fun at club sites and enjoy attending: They develop a sense of belonging and feel the club is theirs. Staff members support these feelings by providing a family atmosphere. Members want to participate in club activities. Jo Gamblin, Unit director at the Inverness Unit, goes out of her way to plan activities, even to the extent of having a sleepover for members during hours the club isn't normally open. Close relationships with staff: Staff members are warm, caring, accepting, and appre- ciative of members, ensuring that each member has the chance to feel connected with one or more adults, as well as having the opportunity to make friends with peers. Clubs provide expectations and opportunities: Children are able to acquire physical, social, technological, artistic, and life skills through pro- grams provided by clubs. Staffs help members prepare for Vick rS & CLUBS school and develop good study habits through programs such as Power Hour. Expectations of achievement are emphasized by "I Can Achieve Ral- lies" and having work displayed pro- minently at club sites. Crystal River Unit Director Rebekah Csont worked closely with the J.C.Penny store to host the recent "I Can Achieve Rally" and the J.C. Penny Lights on Afterschool event with more than 100 in attendance. Encouragement by staff members: Efforts by members are reinforced through recog- nition, rewards, and incen- tives. Achievements of mem- bers are showcased not only at club sites but also at functions such as the Steak 'n Steak din- ner, newspapers and newslet- ter publications, and programs such as "Youth of the Month." We invite the public to visit any of our three club sites to see for themselves how the lives of children are changed and characters are strength- ened. When children attend frequently, and clubs make these five basic elements a part of daily routines, the level of impact is strong. Call 623- 9225 to find out more about the BGCCC. Lane Vick is a member of the Boys & Girls Club of Citrus County. ( D and resource information and organizationn is referrals. i be a part of A family care- giver is defined ort. as someone who cares for a chronically ill, Sandra :; ....' disabled or eld- erly loved one in their home or other living arrangement, such as a nursing home. As medicine and tech- nology help us to live longer, the num- ber of people who need caregiving assistance grows. People older than 85 are the fastest growing segment of our population. Every family can expect to be impacted by this need at some time. Rosalynn Carter said that there are only four kinds of people in the world - those who have been caregivers, those who currently.are caregivers, those who will be caregivers and those who will need caregivers. Which one are you? According to the National Family Caregivers Association, in any given year more than 50 million people pro- vide some level of caregiving services. The services are valued at more than $257 billion dollars a year. Family caregivers provide more than 80 percent of all homecare services, including daily living activities, such as dressing, bathing and toileting, as well as some level of nursing support. November is also National Family Caregiver's Month. According to Suzanne Mintz, president and co- founder of the National Family Caregivers Association, this year care- givers are encouraged to take three steps every day to make their lives eas- ier, improve care and raise awareness about their continued love and commit- ment. Special to the Chronicle The Spanish-American Association of Citrus Springs recently contributed $2,500 to Hospice of Citrus County, toward the Give for Good Capital Campaign to fund the new Hospice House, which is scheduled to open in December. The Hospice House is a place where people with terminal illnesses may spend their final days when they require special care not possible at home. The cost of the house is supported by donations. By making a contribution to Hospice of Citrus County, you help to insure that dying people will be afforded the opportunity to make the most of their remaining time. For more information about Hospice House call Bonnie Saylor, director of development, at (352) 527-0063, Ext. 263, or visit the Web site at. From left are: Antonio Malave, president of the Spanish- American Association; Bonnie Saylor, director of operations for Hospice of Citrus County, and Jeanette Bermudez, treasurer of the Spanish-American Association.desk@chronicleonline.com. News OTES Service days change for yard waste Waste Management will change its service days for yard waste for the city of Inverness, effective Wednesday. Yard waste will be picked up citywide Wednesdays only. For customers who have yard waste service on Thursday, this will be changed to Wednesday. For customers with regular service on Wednesday, that service remains the same. This is only for yard waste. Regular household garbage pickup days remain the same. Call 726-2321. Library prepares to break ground The Citrus County Library System (CCLS) invites the resi- dents of Citrus County to a groundbreaking ceremony on Thursday at the site for the new Homosassa library, which is at the comer of Grover Cleveland Boulevard and South Grandmarch Avenue. The new library address, 4100 Grandmarch Ave,.is east of U.S. 19 on Grover Cleveland Boulevard in Homosassa. In attendance will be the Board of County Commission- ers, Citrus County officials and staff, members of the Library Advisory Board, Library Friends groups and representatives of Schenkel Shultz Architecture and Greg Construction. Call the Citrus County Library System (CCLS) Administrative Offices at 746-9077, TTY: 249- 1292, or visit the Library System's Web site at. The Administrative Offices are at 425 W. Roosevelt Blvd., Beverly Hills. Hours are from 8 a.m. to 5 p.m., Monday through Friday. Scandinavian Club Christmas party Joyful Christmas carols will sound as we join hands and walk around the Christmas tree at our yearly Christmas Party, being held at the Kellner Auditorium in Beverly Hills Thursday. We start with dinner at 6 p.m.; this is a covered-dish affair, so bring a dish of Scandinavian food or another favored dish. The club will pro- vide a spiral-cut ham and "Rice a I'amande" dessert. Coffee will be served, but bring your own beverage. Cost is $5 per per- son, and please call Tordis Roland at 527-2277 or Bill Browne at 746-0316 with your reservation and the choice of dish you are bringing, or for additional information. Guests are always welcome. Also bring a decoration for the Christmas tree, and remember to retrieve it after the party. Optional: you may bring a wrapped gift of a value between $5 and $10, and mark it male or female. Music will be provided by our three accordion players. BHCA slates holiday gala The Beverly Hills Civic Association is hosting its annual Christmas party at 7 p.m. on Thursday in the Recreation Building. Entertainment will be by Paul Stevio and Jackie Sharps, better known locally as Phantastic Sounds. Stevio has a voice that is likened to Frank Sinatra, Neil Diamond and Elvis Presley. Sharps sings soprano, and is a voice and piano instructor. They recently performed in Phantom of the Opera. Dues can be paid at the door. Pet SPOTLIGHT Happy home Special to the Chronicle Bear shares his home In Inverness with Lori and Joe Miller. .~, / ,... I Key Training at Plantation Inn WALTER CARLSON/Chronicle James Kirkwood, back row, left, the director of tennis for Plantation Inn, put together a tennis training session for some of the Key Training Center residents recent-. ly at the Plantation Inn. Kirkwood worked with Key staff and Plantation golf pros to accomplish the training. The Kiwanis also sponsored the event. Donation to Hospice House --------------------* 'Au-'-y ^~ f.f----------------MV------ ,,'l /:,,,, ( MONDAY, DECEMBER 5, 2005 9A "Copyrighted Material Syndicated Content Available from Commercial News Providers" Se The Fire Place We do more than just Gas Logs! CUSTOM BRICK WORK FIREPLACES/OUTSIDE BBQ KITCHENS REPAIRS SMALL OR BIG 1Mfl SWELpEPB A SPEBC^rTOnSIC S1DRYER DUCT CLEANING 1921 S. Suncoast Blvd., Homosassa 352-795-7976 Even "Santa" . *as A Shiny Cai . .HUNTER DOUGLAS SALES EVENT t-~,e ~. I ic . SAVE SAV H $75 $35 HunterDouglas S 5 A I $25 ,' Get h se&* n i style with HM tii Dugias wi n faiws, Crenltt us today amtd as about the mail-hn tebatl Citrus Paint & Decor --. DECORATING CENTER- 724 NW Hwy. 19, Crystal River 7470 SW 60th Ave., Ocala (352) 795-3613 (352) 873-1300 Mon.-Fri. 7:30 am 5:00 S M Sat. 8:00 D s 2:00 p, t w'., w S w .u ,. " You choose the CD term! 4550o4 From 13 to 23 months 400 From 3 to 8 months MERCANTILE BANK VH take yosr banking persotnally. Crystal River 1000 S.E. U.S. Highway 19 (352) 564-8800 Inverness 2080 Highway 44W (352) 560-0220 M e 'be l 60 C 1 "a i i s "I I Jr .___ .0-1.I. eviemtw FMrww~ n- 1.! -.-'A L P ,' ' Fr .. .'. RDIE E monthte S mIm. D.mmI0JimIi.LJ' .0'; mbusinessfea'uq 41 Still Time For Your Holiday Framing Gifts. Gift Certificates Available Frame Design is celebrating their 13"' anniversary. Gail Dyer, accomplished artist and certified picture framer, provides residents of Citrus County with some of the most beautiful original oils and water colors painted by herself and other local artists. These depictions of Florida's natural wildlife and landscapes must be seen to be appreciated. Gail also carries other art of different themes in her showroom in the Kash n' Karry Plaza in Crystal River. Gail and her associate Valorie recently attended the Decor Expo trade show in Atlanta Georgia. The show was a great success. Come see the new frame moldings, new matting colors and a large selection 6f fashionable photo frames, which make great holiday gifts for those special photo's, needlepoint or art piece. Call Frame Designs at 795-5131 for store hours and information. River Safaris & Gulf Charters, Inc. 10823 West Yulee Drive Homosassa, FL 34448 352-628-5222 Fax 352-628-0122.. . Voted Best of the Best for 2005! pottery. Manatees have arrived! We are offering swimming/viewing trips. Call us for boat tour and rental reservations and information at (352) 628-5222, 1-800-758-FISH (3474), visit us personally or check out our website at. Visit our Free Alligator Exhibit! SKIDMORE'S SPORTS SUPPLY, INC. After being in business for 22 years, we have over 55,000 items in our -, -" - store. People are are amazed at all the different products we stock. For our . hunting, fishing and team sports rm, archery, rods & reels, paint ball and school jackets, cajun spices & seasonings.. SANTA SHOPS HERE!! Stop by today, say hi and see for yourself what awaits you at 999 East Hwy. 44, Crystal River. FL. or find out more about Skidmore's Sports Supply by calling us today at 352-795-4033 or visit the web site. Dog Training At Your Door! Contain 'n Train System By JNNOTEK Peace-Of-Mind -- Effectiveness Aesthetic s l ( Affordability Freedom -, Versatility Another reason to get IN-GROUND PET FENCING Everyday, more and more pet owners Cike you are learning about the many benefits offered 6y Jn-ground7Pet Fencing Veterinarians nationwide recommend In-Ground Pet Fencing a as a safe, effective way to keep your pet on your property. Shelly's K-9 Designs If you have ever met Shelly, you may find it hard to ,,. believe that she has been in the dog business for 30 yrs. 1..t but it's a fact. .*. Shelly Mileti owner of Shelly's K-9 Designs got her t'. Dogs!! Shelly's schooling and education includes many merits in complete A.K.C. Purebred and all breed grooming and showing titles. Shelly has had 3 dog grooming businesses. Atlanta, Chicago and! Boutique hours are Monday Friday 9 2, Saturday by appointment only. Stop by and you'll see how true quality professional dog grooming is really done. Shelly's is also a drug free and smoke free facility. Shelly's K-9 Design is owner operated. 65125 Merry Christmas & Happy New Year From Coast RV Supplies r, , Like you, we are getting ready for the holidays. . We had our windows decorated by a young local -, artist and she did a beautiful job. If you have not i seen them stop by for a cup of coffee and visit with . us. We have enjoyed seeing all of our friends from ~ . up North. The season has arrived so please make time to check your RV's out and make sure everything is working properly and check your batteries because you'll really need them to run your heat, If you have any questions please call one of our techs, they will be glad to help you. For your information we offer detailing, hand wash & wax. For more information call Kathy at 563-2099. Jimmy, Rick, Kathy and Gael wish you all a safe and happy holiday. We are located at 987 N. Suncoast Blvd. (Hwy 19) in the airport plaza in Crystal River. Our phone is 352-563-2099. After hours Rick 352-302-6279. Plaza Health Foods Dear friends and customers, I know it is hard to believe, but ' December is here again and time for out SEMI-ANNUAL .. " 25% OFF SALE. This includes herbs, vitamins, minerals & homeopathics. We hope our new customers will take advantage of this sale as well as our old friends and customers. We really appreciate the confidence you have placed in us, as it is the loyalty of customers like yourself that enables us to succeed. We promise to continue doing our best for you in every way possible. May we convey warm season's greetings and extend our best wishes for your good health, happiness and prosperity in the coming year!! Located at: 8022 w. Gulf-to-Lake Hwy. Crystal River, FL. 34429 352-795-0911 9:30am-5:00pm Monday thru Friday and 9:30am to 2:00pm on Saturdays. ServiceMASTER Clean ' 14, Molly 12 and Merritt 6. Benje is an active member of the community vol- unteering his time coaching little league baseball and he also serves on the CRA Board for Crystal River, the Crystal River High School, (352) 794-0270. ServiceMASTER Clean of Citrus County also services Marion, Levy, Sumter and, Hernando Counties. --------, CITRus COUNTY (FL) CmHRONICLE ll ( . MONDrAV DECEMBER 5, 2005 w*w ,uhrunu.i',l- .um "The mystic bond of brotherhood makes all men one. -- ,---- 0. CITRUS COUNTY CHRONICLE EDITORIAL BOARD S Gerry Mulligan ..............................publisher Charlie Brennan .............................. editor Neale Brennan ...... promotions/community affairs Kath REMEMBER ADOPTED COUNTY Adopted county will need help for years With Hurricane Katrina's fury at risk of taking a back seat to holiday activities and local concerns, members of the Citrus County Disaster Response Team are tak- ing action. This team has recently announced its plans to take the message of long-term recov- ery needs to local . civic and communi- ty groups through a slide show presen- tation in the hope of generating more widespread support for their efforts. . THE IS Helping H County, OUR OP We can't ured in days or weeks but, more accurately, in years. The mes- sage to be delivered is that help is still needed both financial support and volunteers to travel and assist these people in the awesome task of rebuilding and healing. Our community made a promise. SUE: Coordinated by Hancock United Way admin- SMiss. istration and main- tained by overwhel- 'INION: ming responses from local organiza- forget. tions, as well as individual volun- teers, pledges of With the goal of precluding our support have been determinedly adopted county, Hancock upheld. We cannot let this com- County, Miss., from fading "out of mitment waver. sight,-, out.of mind," this recent srghosal oi f misnd," thismlent This latest relief focus to keep proposal is another example of the story in the forefront is right not eW the compassion this n ust t forget at tie compiwlity hasA. .tr ather ', b piuAse l ififn the \ 1ilTih~ness to put those feel- p" :' ' ingi i0action. only a, two~dimension presenta- ,; a.. tion of' the; devastation and The pictures of devastation heartache of a community very that will be shown in these pre-sart o o r-n similar to ours. senautions are just as real as they were when the storm first hit the coastline. Hahcock, a county of about 46,000, took a direct hit Aug. 29. Recovery time for such a disaster is not meas- Groups interested in having a presentation from members of the Citrus Disaster Response Team should call the United Way office at 527-8894. United Way needs your help If every Citrus County family can be mailed to The United donated $25 to United Way send in a check. Your contribution River, Inverness or Beverly Hills. Free to protest C 0IN she or he is in danger Ho ore N. Lj.l because of the wildlife. Hot Corner Nov. 9, "War When you live in a county protest," 2,000-plus that has several wildlife deaths in the oil war, a.k.a. sanctuaries to protect the lucky ones; it's over for wildlife, you can expect to them. The unlucky ones 1 have an occasional are the wounded, the encounter. I have never maimed and the families CALL heard of anyone in Citrus and loved ones they will 5 f3 County being mauled by leave behind. They will 563 t0 5 I any of our wildlife, except have to live with it forever, maybe a couple of Protests isn't it good to instances where we had a rabid fox live in a country where we can? or bobcat. But if it were left up to Maybe we should invade France and some of our citizens, we would help them with their rioting prob- destroy all the wildlife in the county. lems. Don't forget to vote. If you feel like you are in danger Curing the French from our wildlife, you should get out on the highways of our beloved As the French are starting to find county and see what a danger some out, socialism and trying to placate of our citizens can provide for you. terrorism does not work well. The There are many more wrecks than cities are burning; the French are animal encounters. perplexed. I wonder if John Kerry is animal encounters. likewise perplexed. After all, wasn't Good Samaritan it he who wanted us to be more like I want to thank the young lady the French? The mindset of the who came to my rescue at Kmart French leadership reminds me of parking lot Thursday afternoon (Nov. the anti-war types in this country. 10) when I was having heart prob- Instead of using the stick, maybe lems and it was about 3 p.m. I we should try to buy them by would like for her to call me at my increasing scholarships and bene- home phone number, 726-9613, so fits. Some people may not be cur- I could properly thank her. able. Maybe the only cure is an inevitable mushroom cloud. But I Failing to yield doubt if, indeed, that would cure T them. The ones left would probably The sheriffs plan to watch for speed- blame the ones who are fighting the ersduring the holidays was a good idea. terrorists. A better one is to assign deputies rou- tinely at dangerous intersections. One Worse dangers such intersection is at (U.S.) 19 and I read your article about the per- (U.S.) 98. Drivers rarely yield as they son who lost their dog to a bobcat, approach (U.S.) 19 North. This is a very, especially the person who feels like very serious problem. pealy "f-rnI % - 4 - * = - 0 -~ a -. - ' -- S - .-- . - 40 - ~ .... q - - w - - - 0 - t dw--- - 4- -0 ftam .... o 0. .- 0- -.,a S ft ft -nu .. * ..~ * a - .0 ~ - - S - a - - e- a- 'D - 5- -- a - -m - __ 9- - 0 43 - 43 0 a 4& - 4w 4w U8 -- Available from Commercial News Providers"d LETTERS Serving Cypress Village The nominating committee has sub- mitted its written report to Dr. Averill, the acting president of Cypress Village. The results were announced at the board of directors' meeting Nov. 17. From a roster of five candi- dates, two of whom were running for re-election, the remaining three can- didates were reduced to one. One person withdrew because of business commitments and one was eliminated because of her "education." Our by- laws state that anyone in good stand- ing with the association is encouraged to participate in the governing of our organization By reducing the original roster of five candidates to three, with three vacancies to fill gives the voting mem- bership no choice of whom they might choose to represent them. This is both interesting and troubling because education is not a prerequisite to be willing to serve on the board. With an education but no college degree, you may be wondering who this person is - it is me. My husband and I are both active in Cypress Village, and have reserva- tions to some of the changes that have been attempted in the past several years. Monthly, we attend the board of directors meeting. We are helpful if needed, but voice our opposition if necessary. Disruptive, of course not, but attentive; so we consider our- selves informed about deed restric- tions, allocation of money, state statutes being adhered to, etc. The desire to serve on the board would broaden my experience with the changing landscape of our village. I know change is happening, but there remain a lot of people who are very satisfied with the community as they know it. The rejection of the nominat- ing committee will not deter me. There are by-laws that will circumvent. this disappointment and the member- ship will have a choice at the annual meeting in March 2006 to speak I will accept a failure by the majori- ty of the property owners, but never will I accept the rejection by the nom- inating committee gracefully This would be distressing to anyone who might want to serve Cypress Village. JoAnn Deckant Homosassa Nowhere to turn Imagine being a 41-year-old, divorced female, whose only child is grown and married, but you cannot do what you've waited to do, because of numerous debilitating health prob- lems. You've had Crohn's disease and an ileostomy for approximately 22 years, arthritis, a hiatal hernia, migraines, fibromyalgia, peristomal pyoderma gangrenosum and now three herniated discs in your back. Sounds like enough, right? Wait... now you have a cyst on each ovary, too. Continuing to be a long-term care nurse, as you have been for approxi- mately 15 years, is out of the question, so you work one day a week at an assisted living facility. You don't quali- fy for medical insurance, and you simply cannot work more, so you try to apply for Medicaid. You are told you must have minor children, be pregnant or disabled to qualify, so you apply for disability. You are turned down twice, but each time they admit that you cannot do the work you have always done, but they feel you can do something less physical. What they don't appar- ently realize is that assisted living is already a less physical job, and you can barely do that one day a week. So, you have no medical insurance, very little money, you can barely afford your medication and ostomy supplies, and cannot afford to see necessary doctors, and now your 22- year-old daughter has fibromyalgia and your 10-year-old niece has Crohn's disease. Sound like a "quali- ty" life for a 41-year-old? Would you trade lives with me, to ' live a life of constant pain, illness and worry? I realize there are many others much worse off than me, but doesn't each person deserve to receive the necessary medical attention they need? Doesn't it make sense to devel- op a medical care program for adults in need, that offers low-cost doctor visits, discount prescriptions and dis- counts on other necessary medical , supplies? We are always helping ped- ple from other countries, which is wonderful, but we seem unable or unwilling to help adults in need in our own country. Can you imagine that? Melissa Longshore Homosas Syndicated Content to the Editor IN ffiffi- . .. .. .. * * - .0 - .41b - 'm lo 4 too wwem Ciu o %~(L CHOICEMODY DEEBR5 05h 3 DAY EVENT Tuesday, December 6th Thursday December 8th FREE Consultation Call 564-8884 with Mark Selis For Your Appointment EXPERT IN THE NEWEST S*DIGITAL HEARING AIDS Meet with Mark in a private consultation; his 25 years of experience can help you overcome frustrations associated with. hearing loss. Mark will share his unique approach ensuring that you receive the best hearing help available to improve the hearing that you have. Mark Selis Unites States Audibel Centers For Hearing Excellence "Find Out For Yourself How Much Better You Can Hear & Understand" I The three types of loss that our specialist will address in our demonstration technique: MILD Just beginning to miss punchlines, asking people to repeat, etc. *MODERATE Struggling even when people are close, T.V. is up too loud, embarrassment, etc. 4 SEVERE/PROFOUND Those who can't hear without hearing instruments. ca p make in your life. You will be glad you did. Call now and schedule your appointment. 1. FREE Video Ear Inspection 4_ __ 2. FREE Pure-Tone Audiometry Test 3. FREE l. Digital Consultation And Demonstration R DWED(D@EWD IalDIBEL Eur i.m Yiii rr u * IBT RH RN IOU #P ..IRIY We are a professional practice that cares about you. Better hearing involves much more than just buying a hearing aid. Let our team of professionals provide you with the right combination of technology, care and service. NEW DI@QTAL @LU@TNEl. Q Multi-Channel Expansion Helps Reduce Low Frequency Background Noise. ------------------------------------- r BATTERY- Try Before You Buy I"SUPER SPECIAL' 99 PrI Pack I SBring In This Coupon For Al 99 Limit 2 Per Household! FREE GIFT - - - -- Exiries_12/8/5OL If Accompanied By A Relative/Freind They Receive A Gift Also! 4e 0Ig, ,& ; 1: WALK-INS WELCOME CREDIT CARDS & INSURANCE ACCEPTED VISIT la UDIBEL Crystal River Mall e.- Providing Superior Hearing Care Since 1961 1881 NW US 19 N 9Near JC Penny. 352564 8-84 Hearing aids cannot restore natural hearing. Success with hearing aids depends on a number of factors, including hearing loss severity and ability to adapt to amplification. That's why you should see a licensed Audibel hearing specialistto. L- 13 SEPS O BET ERi HEAR^INij^i[G & UNDERSTANING I~ MONDAY, DECEMBER 5, 2005 11A CITRUS COUNTY (L) CHRONICLE r7 12A MON DAY DECEMBER 5, 2005 g --< ;-;,:. . . 7,' ^!'. -K."'* & >:i';1,^^' U.S. safer, but not safe .= .. ...: ...... ...._ -^.-** m- *- 48 -- ( .) P pw'fhe< spending cu L% "Copyrighted Material Syndicated Content e from Commercial News *r ,r Providers' * g* mun hM* -M=M M Od ,. e.~ I- -Th ~ - ____ 14-4 a Available *AD.*4 mml vmo '. NFL action , 4Indy tak es on the Titans. PA 0 E 4 R DECEMBER 5. 2005 - ~ K~9** *mm m=mo Barbers shop I V. t' a 9 U .-:.. , "Copyrighted Material * SyndicatedContenty Available from Commercial News Providers" I sai. |! soos a Tahiri repeats in close Pines final ERIC VAN DEN HOOGEN For the Chronicle It was a nail-biting weekend of tennis, and Citrus County won the overall battle against Hernando at the Chronicle/Pines tennis tourna- ment at Whispering Pines Park The fans were treated to a great men's open final, in which Mehdi Tahiri outlasted Brian deMontfort. Both players had won their semi finals in straight sets, setting the stage for a close matchup. It took Tahiri three sets, but the patience of the seasoned player was just enough to tip the scale into his favor, 4-6, 6-1, 6-1 to repeat as the men's champion. The final drew such crowd that the men's open doubles started late. The doubles match did not disappoint, as former champions fought a close match. Eventual champions Mike Brown and Eric van den Hoogen lost the first set, but constant pressure at the net from Brown/van den Hoogen chipped away at the power of Roy Taylor and Jim Cina, even- tually leading to a 4-6, 6-3, 6-4, victory. Another Citrus County win came in the Middle School Boys singles where Joe Tamposi defeated Hernando's Chris Nyhlom in the final 6-1,6- 0. Hernando got a partial win when Judy Jeanette, with her Citrus County partner Leslie McCue, defeated Shu Sha Mu and Deb Peters in the Women's Open doubles 3-6, 6-2, 6-1. The complete scores were as follows: Men's Open singles final: Mehdi Tahiri def. Brian deMontfort, 4-6,6-1,6-1. In the semi's Tahiri def. Jim Cina in straight sets; deMontfort def. Barney Hess, also in straight sets. Consolation round: Richard Fields def. Tony Bulso, 6-2,6-3; Fields def. Joe Bulso by default. Men's B singles final: Gino Calderone def. Gary Suggs, 7- 6,6-7,6-4. Consolation round: Wayne Steed def. Alfredo Cali, 6-4, 6-3. Men's 60+ doubles final: Tom Spessard/Brent Bullock def. Sam Dixon/Hank Keatts, 6- 2,6-4. Middle School Boys singles final: Joe Tamposi def. Chris Nyhlom, 6-1,6-0. Consolation round: Jackson Roessler def. Jackson Roessler, 7-6,4-6,7-6. Women's Open singles final: Shu Sha Mu def. Janet Mulligan, 6-0,6-0. Consolation round: Sonia Shah def. Lindsey Spafford, Please see /Page 3B Mehdi Tahiri of Inverness wins the Chronicle/Pines Tennis Tournament men's singles Sunday. Brian was one of thirteen com- petitors in the men's singles. 8 ts-t, thc tglit. IOthKut th.r Inpint: "Copyrighted Material Syndicated Content Available from Commercial News Providers" U&OW amoa m - ftl 0 dmm ft qm 0 I r 2B MONDAY, DECEMBER 5, 200 S i-t bK' ~I' WMuUlllum OM".. o *" 'W - S. ..... ... ... ....... . "Copyrighted Material ('an hSyndicated Content i h E >k I Available from Commercial News Providers" Philadelphia Boston New Jersey New York Toronto Miami Washington Orlando Charlotte Atlanta Detroit Cleveland Indiana Milwaukee Chicago San Antonio Memphis Dallas New Orleans Houston Minnesota Denver Seattle Utah Portland L.A. Clippers Golden State Phoenix Sacramento L.A. Lakers Saturday's Games Toronto 95, New Jersey 82 Detroit 92, Chicago 79 Milwaukee 104, Orlando 84 Memphis 90, Houston 75 San Antonio 100, Philadelphia 91 Dallas 97, New Orleans 88 Denver 101, Miami 99 L.A. Clippers 102, Cleveland 90 Sunday's Games Boston 102, New York 99 Seattle 107, Indiana 102 Phoenix 112, Atlanta 94 Utah at Portland, 9 p.m. Minnesota at Sacramento, 9 p.m. Charlotte at L.A. Lakers, 9:30 p.m. EASTERN CONFERENCE Atlantic Division L Pct GB L10 10 .444 3-7 9 .438 4-6 9 .438 4-6 11 .313 2 4-6 15 .167 5 3-7 Southeast Division L Pct GB L10 7 .588 6-4 8 .467 2 3-7 9 .438 2% 5-5 .12 .294 5 3-7 14 .125 7% 2-8 Central Division L Pet GB L10 2 .867 8-2 6 .625 3% 6-4 6 .625 3% 6-4 6 .600 4 5-5 7 .533 5 5-5 WESTERN CONFERENCE Southwest Division L Pct GB L10 3 .813 8-2 5 .706 1% 8-2 5 .688 2 7-3 8 .500 5 6-4 12 .250 9 2-8 Northwest Division L Pct GB L10 6 .571 6-4 9 .500 1 6-4 8 .500 1 6-4 . 10 .375 3 2-8 10 .333 3% 3-7 Pacific Division L Pct GB L10 5 .688 6-4 6 .667 7-3 5 .667 % 8-2 9 .438 4 5-5 9 .400 4% 3-7 Home 6-3 6-5 4-4 3-3 1-8 Home 7-2 4-3 4-4 4-3 1-6 Home 5-1 7-1 5-2 5-2 4-2 Home 7-1 5-2 6-2 4-3 2-6. Str Home Away Conf W-1 6-2 2-4 4-6 W-1 7-3 2-6 6-7 W-3 6-3 2-5 2-5 L-3 2-6 4-4 3-6 L-3 3-3 2-7 1-3 Str Home Away Conf W-1 6-1 5-4 5-2 W-5 8-3 4-3 4-4 W-6 7-4 3-1 6-4 L-2 6-4 1-5 3-6 L-1 3-5 3-4 4-6 Monday's Games San Antonio at Orlando, 7 p.m. Dallas at Chicago, 8:30 p.m.. Celtics 102, Knicks 99 SuperSonics 107, Pacers 102 BOSTON (102) INDIANA (102) LaFrentz 1-7 2-2 5, Pierce 8-15 11-15 Artest 11-21 5-7 30, Pollard 3-3 0-0 6, 28, Perkins 3-4 0-1 6, R.Davis 10-22 7-8 O'Neal 10-17 1-1 22, Jackson 7-14 0-0 15, 27, West 7-13 2-2 17, Blount 1-6 1-1 3, Greene 0-5 2-2 2, Jefferson 4-7 0-0 8 Jasikevicius 5-8 2-2 16, Johnson 3-6 0-0 6, Reed 1-3 0-0 2, Dickau 0-0 2-2.2, Foster 1-1 2-5 4, Jones 0-4 3-4 3, Granger Scalabrine 1-2 0-0 2. Totals 36-84 27-33 0-1 0-0 0. Totals 40-75 13-19 102. 102. SEATTLE (107) NEW YORK (99) Evans 4-5 0-0 8, Lewis 6-17 9-10 23, A.Davis 1-7 2-2 4, Richardson 3-6 3-4 9, Collison 1-5 0-0 2, Allen 10-26 2-2 25, Curry 1-2 1-2 3, Marbury 9-22 17-21 35, Ridnour 4-7 4-4 13, Fortson 3-4 3-3 9, Robinson 2-6 1-1 6, Frye 8-13 8-9 25, Murray 6-9 6-8 18, Radmanovic 2-4 2-2 7, James 1-3 0-0 2, Crawford 1-5 0-0 2, Wilkins 1-2 0-0 2. Totals 37-79 26-29 107. Butler 4-5 2-3 10, Ariza 1-1 1-4 3, Rose 0- Indiana 28 18 2729- 102 1 0-0 0. Totals 31-71 35-46 99. Seattle 27 22 3325- 107 Boston 22 24 3026- 102 3-Point Goals-Indiana 9-23 New York 26 19 2232- 99 (Jasikevicius 4-5, Artest 3-8, O'Neal 1-1, 3-Point Goals-Boston 3-13 (Pierce 1-2, Jackson 1-4, Johnson 0-1, Jones 0-4), LaFrentz 1-4, West 1-4, Greene 0-1, Seattle 7-18 (Allen 3-9, Lewis 2-5, R.Davis 0-2), New York 2-7 (Frye 1-1, Radmanovic 1-1, Ridnour 1-3). Fouled Robinson 1-2, Crawford 0-1, Richardson 0- 3). Fouled Out-Perkins, West. Out-Fortson. Rebounds-Indiana 38 Rebounds-Boston 43. (Pierce,-9), W. l Je.;,:u 7),.Seattle 48 (Lewis, Evans, York 62 (Richardson 13). Asssts- Assists-Boon on ). Assi-Indiana 22 16 (Pierce 7), New York 16 (Marbury 9). (Jasikevicius 9), Seattle 20 (Ridnolir 7). Total Fouls-Boston 32, New York 28. Total Fouls-Indiana 27, Seattle 20. Technicals-West, New York Defensive Technicals-Seattle Defensive Three Three Second. A-19,763 (19,763). Second. A-15,761. (17,072). .uth F.wida Tat fi<^n l hi SPORTS CITRUS COUNTY (FL) CHRONICLE . . I Away Conf 2-7 3-8 1-4 5-7 3-5 3-5 2-8 2-6 2-7 3-7 Away Conf 3-5 5-5 3-5 4-5 3-5 4-6 1-9 5-5 1-8 2-2 Away Conf 8-1 8-1 3-5 6-1 5-4 6,-4 4-4 7-1 4-5 3-3 Away Conf 6-2 7-1 7-3 7-2 5-3 6-3 4-5 5-4 2-6 2-6 MONDAY, DECEMBER 5, 2005 3B BASKETBALL Suns 112, Hawks 94 ATLANTA (94) J.Smith 1-4 0-0 2, Harrington 1-8 2-2 4, Pachulia 2-7 0-1 4, Johnson 9-16 5-6 23, r.Lue 0-7 0-0 0, Stoudamire 4-13 4-4 14, Childress 4-8 3-4 12, M.Williams 7-11 2-3 17, Ivey 1-6 4-6 6, Batista 3-7 6-7 12. .Totals 32-87 26-33 94. PHOENIX (112) Diaw 5-6 4-5 14, Marion 8-19 2-2 20, K.Thomas 4-6 0-0 8, Bell 1-8 5-6 8, Nash 3-8 3-4 10, Jones 6-12 6-7 20, Jackson 3- *6 0-0 7, House 5-9 2-2 14, Burke 3-4 2-2 8, Thompson 0-3 1-1 1, Ford 1-1 0-0 2. Totals 39-82 25-29 112. Atlanta 10 26 1543- 94 Phoenix 25 32 31 24- 112 3-Point Goals-Atlanta 4-11 (Stoudamire 2-4, Childress 1-1, M.Williams 1-1, Harrington 0-1, Lue 0-1, Johnson 0-1, Ivey 0-2), Phoenix 9-26 (House 2-3, Marion 2-5, SJones 2-6, Jackson 1-3, Nash 1-3, Bell 1- 5, Thompson 0-1). Fouled Out-Burke. ,,.Rebounds-Atlanta 60 (M.Williams 11), Phoenix 49 (K.Thomas 11). Assists- Atlanta 8 (Harrington 3), Phoenix 27 (Diaw 9). Total Fouls-Atlanta 26, Phoenix 30. Technicals-Atlanta coach Woodson, Batista, Pachulia 2. Flagrant fouls- J.Smith, Pachulia. Ejected-J.Smith, ;r .Pachulia. A-15,992. (18,422). NBA Today SCOREBOARD SMonday, Dec. 5 Miami at L.A. Clippers (10:30 p.m. EST). The Clippers' Elton Brand was the Western .r Conference player of the month for 'November. STARS Saturday -Chris Bosh, Raptors, scored 29 points with 13 rebounds to lead Toronto to a 95- 82 win over New Jersey. -Dirk Nowitzki, Mavericks, had 30 points and 8 rebounds in a 97-88 victory over the Hornets. -Michael Redd, Bucks, scored 30 points to send Milwaukee past the magic 104-84. -Chris Kaman, Clippers, grabbed 19 rebounds in a 102-90 win over the Cavaliers. STRONG IN DEFEAT Dwyane Wade had 32 points and six assists in the Heat's 101-99 loss to the Nuggets on Saturday night. ... Dwight Howard grabbed 17 rebounds in Orlando's 104-84 loss to Milwaukee. Philadelphia's Allen Iverson scored 37 points in a 100-91 loss to the Spurs. SNAPPED SToronto had not won road games on con- secutive nights since April 2000 and had :. lost its first seven away games this season -- before a 95-82 win over New Jersey on Saturday night, a stretch that included a 33-point loss to Detroit on Nov. 5 and a 26- point defeat at Golden State last Saturday. ON THE SKIDS The Cavaliers have lost four of five fol- lowing an eight-game winning streak. -" Cleveland fell to the Clippers 102-90 on Saturday night. STREAKS The Dallas Mavericks beat the Hornets '."' for the 15th straight time, 97-88 Saturday i night. ... Rasheed Wallace scored 26 points to lead the Pistons to their fourth straight victory, 92-79 over the Bulls. .. -.Memphis has won five straight games ... Orlando has lost three straight games and Milwaukee has won three in a row. SCORCHING . The Bucks shot 57 percent (43-for-76) from Ihe fiela n a 104-84 win over Orlando on Saturday night. SPEAKING n "Our guys did a great job of battling back from 14 down and, quite simply, I blew it. ... The game is fully my responsi- bility." Heat coach Stan Van Gundy, on staying in a zone defense late in the fourth quarter in a 101-99 loss to the Nuggets. Top 25 Fared Sunday 1. Duke (7-0) beat Virginia Tech 77-75. Next: vs. Pennsylvania, Wednesday. 2. Texas (7-0) did not play. Next: at Rice, - Monday. 3. Connecticut (6-0) did not play. Next: vs. Massachusetts, Thursday. 4. Villanova (4-0) did not play. Next: at 'i! Bucknell, Tuesday. 3.' 5. Oklahoma (4-1) did not play. Next: vs. C., oppin State, Saturday. 6. Gonzaga (4-1) at No. 18 Washington. r Next: vs. Washington State, Thursday. 7. Louisville (3-0) beat Arkansas State '67-55. Next: vs. Richmond, Monday. ..,, 8. Boston College (6-0) did not play. Next: vs. No. 13 Michigan State, Tuesday. 9. Memphis (6-1) did not play. Next: at Providence, Saturday. ? 10. Kentucky (5-2) did not play. Next: at t..,Georgia State, Tuesday. 11. Florida (7-0) did not play. Next: at Providence, Tuesday. 12. Illinois (7-0) did not play. Next: vs. ""Arkansas-Little Rock, Monday. Ot 13. Michigan State (5-2) did not play. Next: vs. No. 8 Boston College, Tuesday. 14. Iowa (7-1) did not play. Next: at Northern Iowa, Tuesday. ,. 15. Arizona (2-3) did not play. Next: vs. ; Northern Arizona, Thursday. I> 16. UCLA (6-1) beat Coppin State 69-57. ;\ Next: vs. No. 20 Nevada, Saturday. S17. Indiana (4-1) did not play. Next: at Indiana State, Tuesday. 18. Washington (6-0) vs. No. 6 Gonzaga. '-, Next: vs. New Mexico, Saturday. 'j 19. George Washington (4-0) did not play. Next: vs. No. 23 Maryland, Monday. 20. Nevada (5-0) did not play. Next: vs. " UC Davis, Wednesday. 21. Alabama (4-1) did not play. Next: vs. :'C Notre Dame, Wednesday. 22. Wake Forest (7-1) did not play. Next: vs..DePaul, Tuesday, Dec. 13. 23. Maryland (5-1) did not play. Next: vs. No. 19 George Washington, Monday. 24. N.C. State (5-1) did not play. Next: Svs. Appalachian State, Saturday. - :,' 25. LSU (3-1) did not play. Next: vs. - McNeese State, Saturday.. S Sunday's College Basketball Scores EAST Babson 62, Colby 56 SCalifornia, Pa. 78, West Chester 60 -, Cornell 57, Lehigh 53 '. Edinboro 77, East Stroudsburg 69 SFairmont St. 96, Columbia Union 58 Holy Cross 71, Fordham 63, 20T Indiana, Pa. 78, Cheyney 66 lona 68, Vermont 56 Maine-Farmington 81, Brooklyn 59 Mansfield 74, Slippery Rock 71 Millersville 74, Lock Haven 62 NYU 65, York, N.Y. 52 Norwich 88, Castleton St. 64 Pittsburgh 78, Auburn 41 Shippensburg 77, Kutztown 61 SOUTH Duke 77, Virginia Tech 75 Florida Atlantic 107, Jacksonville 104, :- 20T Georgia Tech 63, Virginia 54 Livingstone 78, Bluefield St. 70, OT Louisville 67, Arkansas St. 55 Marshall 73, Youngstown St. 70 Maryville, Tenn. 69, Methodist 61 N.C.-Wilmington 60, Va. Commonwealth 40 Oglethorpe 74, Huntingdon 71, OT Pfeiffer 106, St. Andrew's 98 Richmond 62, Prairie View 48 Va. Wesleyan 72, Washington & Lee 50 P1 ; ,- . On the AIRWAVES TODAY'S SPORTS BASKETBALL 4:30 p.m. (SUN) College Basketball BB&T Classic Howard vs. Navy. From Washington, D.C. (Live) (Joined in Progress) 7 p.m. (66 PAX) NBA Basketball San Antonio Spurs at Orlando Magic. From the TD Waterhouse Centre in Orlando (Live) 7:30 p.m. (ESPN2) Women's College Basketball Jimmy V Classic - Connecticut vs. North Carolina. From Hartford, Conn. (Live) (CC) 9 p.m. (SUN) College Basketball BB&T Classic George Washington vs. Maryland. From Washington, D.C. (Live) 10:30 p.m. (FSNFL) College Basketball Minnesota at Arizona State. (Live) FOOTBALL 9 p.m. (9 ABC) (20 ABC) (28 ABC) NFL Football Seattle Seahawks at Philadelphia Eagles. From Lincoln Financial Field in Philadelphia. (Live) (CC) GOLF 12:30 p.m. (GOLF) PGA Golf 2005 PGA Tour Q-School Final Round. From La Quinta, Calif. (Live) , HOCKEY 7 p.m. (FSNFL) NHL Hockey Ottawa Senators at Florida Panthers. From the BankAtlantic Center in Sunrise (Live) (OUTDOOR) NHL Hockey Minnesota Wild at New York Rangers. From Madison Square Garden in New York. (Live) RODEO 12 a.m. (ESPN2) Rodeo Wrangler National Finals Fourth Round. From Las Vegas. (Live) (CC) Prep CALENDAR TODAY'S PREP SPORTS BOYS BASKETBALL 7:30 p.m. Ocala Word of Faith at Seven Rivers GIRLS BASKETBALL 6 p.m. Ocala Word of Faith at Seven Rivers 7 p.m. Citrus at Hernando BOYS SOCCER- 5:30 p.m. Lecanto at Dunnellon 7:30 p.m. Crystal River at North Marion GIRLS SOCCER 5:30 p.m. Crystal River at North Marion WRESTLING 5:30 p.m. Citrus at Dunnellon Double-Dual MIDWEST Chicago St. 75, 111.-Chicago 74 Miami (Ohio) 75, Cent. Michigan 62 Northern St., S.D. 79, NW Missouri St. 69 FAR WEST E. Washington 70, CS Northridge 48 UC Davis 64, Stanford 58 UCLA 69, Coppin St. 57 FOOTBALL The AP Topr. 2005-06 College Bowl Glance All Times EST) Akron (ESPN) Monday, Dec. 26 Motor City Bowl At Detroit Payout: $750,000 (7-5) vs. Memphis (6-5), 4 p.m.) or Georgia Tech (7. Boston College (8-3) or. Melne) HOCKEY EASTERN CONFERENCE Atlantic Division W L OT Pts GF GA N.Y. Rangers 17 8 3 37 89 71 Philadelphia 15 6 4 34 100 86 New Jersey 1310 2 28 81 81 N.Y. Islanders 13 12 1 27 81, 89 Pittsburgh 7 14 6 20 77 110 Northeast Division W LOT Pts GF GA Ottawa 20 4 0 40 109 49 Montreal 15 7 5 35 77 82 Buffalo 16 10 1 33 86 87 Toronto 15 10 3 33 97 91 Boston 1013 5 25 89 96 Southeast Division W LOT Pts GF GA Carolina 16 8 2 34 93 87 Tampa Bay 15 10 3 33 87 83 Atlapta 10 14 3 23 92 100 Florida 9 14 4 22 66 86 Washington 9 1 2 20 75 104 WESTERN CONFERENCE Central Division W LOTPts GF GA Detroit 18 8 2 38 103 73 Nashville 17 4 3 37 71 61 Chicago 1014 2 22 71 92 Columbus 719 0 14 48 93 St. Louis 515 3 13 62 90 Northwest Division W LOT Pts GF GA Calgary 16 9 3 35 69 70 Vancouver 16 9 2 34 87 79 Edmonton 15 11 2 32 89 84 Colorado 14 9 3 31 100 84 Minnesota 10 11 4 24 67 62 Pacific Division W LOT Pts GF GA Dallas 17 7 1 35 88 72 Los Angeles 16 11 1 33 98 85 Phoenix 1412 2 30 80 73 Anaheim 12 11 4 28 72 69 San Jose 1012 4 24 73 88 Two points for a win, one point for over- time loss or shootout loss. Saturday's Games New Jersey 3, Minnesota 2, SO Montreal 3, Los Angeles 2 San Jose 5, Toronto 4 Washington 5, N.Y. Rangers 1 Calgary 3, Pittsburgh 2 Florida 4, Chicago 3, OT Nashville 4, Philadelphia 3, SO Phoenix 8, Carolina 4 Boston 5, Edmonton 4, OT Anaheim 2, Atlanta 1 Sunday's Games N.Y. Islanders 2, Detroit 1 Buffalo at Colorado, 9 p.m. Boston at Vancouver, 10 p.m. Monday's Games Ottawa at Florida, 7 p.m. Minnesota at N.Y Rangers, 7 p. TRANSACTIONS Weekend Sports Transactions BASEBALL National League HOUSTON ASTROS-Agreed to terms with RHP Russ Spdinger on a one-year contract. PHILADELPHIA PHILLIES-Agreed to terms with RHP Tom Gordon on a three- year contract. BASKETBALL National Basketball Association NEW YORK KNICKS-Waived F Matt Barnes. FOOTBALL National Football League TENNESSEE TITANS-Placed WR Brandon Jones on injured reserve. HOCKEY National Hockey League NHL-Suspended Ottawa D Zdeno Chara one game and fined coach Bryan Murray $10,000 after Chara instigated an altercation with Los Angeles D Tim Gleason in a Dec. 2 game. CAROLINA HURRICANES-Recalled RW Chad Larose from Lowell of the AHL. DALLAS STARS-Assigned LW Mathias Tjarnqvist to Iowa of the AHL. DETROIT RED WINGS-Recalled F Jiri Hudler from Grand Rapids of the AHL. MONTREAL CANADIENS-Recalled F Garth Murray from Hamilton of the AHL. NASHVILLE PREDATORS-Assigned D Greg Zanon and D Kevin Klein to Milwaukee of the AHL. OTTAWA SENATORS-Recalled D Tomas Malec from Binghamton of the AHL. PHILADELPHIA FLYERS-Assigned LW Ben -Eager and G Jamie Storr to Philadelphia of the AHL and G Rejean Beauchemin to Trenton of the ECHL. PITTSBURGH PENGUINS-Assigned G Sebastien Caron to Wilkes- Barre/Scranton of the AHL. ST. LOUIS BLUES-Claimed D Kevin Dallman off waivers from Boston. Placed D Christian Backman on injured reserve. SAN JOSE SHARKS-Recalled LW Ryane Clowe and G Vesa Toskala from Cleveland of the AHL and F Glenn Olson from Fresno of the ECHL. VANCOUVER CANUCKS-Recalled RW Josef Balej and G Rob McVicar from Manitoba of the AHL. WASHINGTON CAPITALS-Recalled C Graham Mink from Hershey of the AHL. Assigned Mink and C Brooks Laich to Hershey. American League BRIDGEPORT SOUND TIGERS- Announced F Kevin Colley, F Wyatt Smith and D Bruno Gervais have been recalled by the New York Islanders and C Robert Nilsson has been assigned to the team by New York. Recalled F Mark Lee and F Chris Thompson from Trenton of the ECHL and G Frederic Cloutier from Pensacola of the ECHL. SYRACUSE CRUNCH-Recalled F Brett Nowak from Dayton of the ECHL. ECHL AUGUSTA LYNX-Suspended D Ed Hill. LONG BEACH ICE DOGS-Claimed F Blake Robson off waivers from Phoenix of the ECHL. PENSACOLA ICE PILOTS-Signed G Matt Carmichael. Signed G Sam Deitelbaum as emergency goalie. READING ROYALS-Announced LW Dany Roussin has been recalled to Manchester of the AHL. TOLEDO STORM-Announced F Brad Bonello has been recalled to Grand Rapids of the AHL. VICTORIA SALMON KINGS-Signed D Brad Cook. Central Hockey League CHL-Suspended Tulsa LW Shawn Futers one game for his actions in a Dec. 2 ame. BOSSIER-SHREVEPORT MUDBUGS- Signed F Milan Vodrazka. OKLAHOMA CITY BLAZERS-Signed G Michael Dilorenzo. YOUNGSTOWN STEELHOUNDS- Signed LW Jean-Francois Labarre, F Chris Shaffer, F Bill Mosler, D J.R. Holmes and D Marc-Andre Roy. COLLEGE BALL STATE-Named Tom Collins ath- letics director. WESTERN WASHINGTON-Named Robin Ross football coach. TENNIS Continued from Page 1B 6-0, 6-1; Shah def. Courtney Spafford, 6-4,6-4. Women's B singles final: Antoinette van den Hoogen def. Heidi Miller, 7-6, 6-2. Middle School Girls sin- gles final: Stephanie Dodd def. Sarah Labrador, 6-0,6-0. Consolation round: Zeel Patel def. Alshara Patel, 6-4, 6-4. Men's Open doubles final: Mike Brown/Eric van den Hoogen def. Roy Taylor/Janies Cina, 4-6,6-3,6- 4. In the semi's Mike Brown/Eric van den Hoogen def. Barney Hess/Richard Fields, 4-6,6-2,6-2; Roy Taylor/James Cina def. Steve Barnes/Doug Dodd, 6-2,7-5. Consolation round: Hank Keatts/Tom Spessard def. Matt Tringali/Tommy Saltsman, 7-6,6-1; Mike Defiori/Freddy Sansone def. Gerry Mulligan/Tim Channel, 4-6,6-4,7-6. Defiori/Sansone won the final by default. Men's B doubles final: Rene Brunelle/Tony Vicente def. John Hawley/Bob Poore, 6-4,6-3. Earlier Barney Simpson/Bob Albright def. Eric Spafford/John Hoglund, 6-1, 6-3. Women's Open doubles final: Judy Jeanette/Leslie McCue def. Shu Sha Mu/Deb Peters, 3-6,6-2,6-1. Consolation round: Denise Lyn/Susan Garrick def. Courtney Spafford/Linsday Spafford, 6-4, 6-2. 0 "Copyrighted Material Syndicated Content Available from Commercial News Providers" l v now viv 1 t II "Copyrighted Material Syndicated Content Available from Commercial News Providers" SPORTS CITRUS COUNTY (FL) CHRONICLE 4,B MONDAY, DECEMBER 5, 2005 NFL Colts unbeaten n continues -0 al ^*--- qu- Abo 00 M00Sow I ,I * [ .. - low m~. m~e O .e comb a m0 dm- EM-M o 4m m -o 4 o am-.b -wo 0 -4 00 - 0.0. ft M- 4m a ~~eum Ampo- 0._ . .. - 4 o lk M- go do- a-. ~ 4ffAW bpOw m ,,-q "CprgtdMtr-- --0 .Synd'-.i0, ated- 4mm 0. lm- OmbO"ow 41 0. m qem Soh Owl" 0 m e me __ mm-am- "Copyrighted Material ~ Syndicated.Content 4 4 0t m fb 0 .m t~ ---Available from Commercial News Providers .7Ao 1h %. n ow Sm -.0ad 0 41 --dam -*- ---_ .0*. 0* . o.. S% - U- 0 ' -.... .. --- -- I Most Cars...............$39.95 Trucks &Vans .........59.9S 4W heel ...................$59,95 I AI AAdjustableAneSetTo Manufacturers Speciicadon *NoExtr Chi ge ForCarsWith FactoryAir OrTorio, BS Tr- ICOMPUTERDIAGNOSTIC Don't Know Why That Service I Engine Light Is On? I I Computer $ 95 Scan 4 1 m 4 v b %"mom 4100 . RE- ."M-410- -0,0- .ft 'm 40 .0 .- 01 - - 0 0. - qw OEM- - 41b qu0. - . Frequent, Vital Engine ,'.-_.i. SMaintenance includes PENN IL ) 'efll Of Up To 5 Quarts Of 0 Quality IOW-30 Oil. NoIju Oil PENNZOIL"| I ROTATE & BALANCE WHEEL BALANCE I For a smoother ride and longer tire wear. Plus we inspect tire tread, air | pressure, and valve stems. $Img5 I almo N amo 0 me U- a 0 0 4m0nwdw- as g 4a e..Im. O L - 0 -lo -d 0 O - 0. -~ - 0 C-- -U- ~- ~- 0 0 oo - C- - 0 ____ 0 0 - 0 ~- - .0 0 0. - __ - e - a 4U40mmml ,,,. cup q, 0 00 O ft fi" 0. woo b-mm 44P d0 m 0.om 0m - - * -- *. o 0 - 0 --n* -U-mm 2. -"C 7~- /\A HJ .4tHenando a ROOsevelt Blvd.s nJ 1'ostOtffce 3 9 Hwy.486 CitrusHills Oeco,,o Sales Good 12-03-05 Thru 12-09-05 STARBUCKS COFFEE LIQUOR S799 CUTTY SARK 259" - - - APPLETON JAMAICA RUM 10 Cane RUM -- -i, OLD FORESTER 860 S 2.-M---9 175 I JOSE CUERVO I 2991 75 179 CANADIAN CAMPARI CLUB LIQUEUR 18I99 17" 51.75 DEKUYPER SOUR APPLE 99 LIQUEUR |7 1979 SI 175 RON ABUELO ANEJO 299 RUM 0 09Vl.75 RED BICYCLETTE SYRAH, MERLOT 750 DANCING BULL 899 ZINFANDEL 750 0 qw dw wmm a -m 4 Go o 40. .4mn4b O-INV 41o o b 0 NN 0. a -40 -0 4bo0 0- -0 *no -.oft 0 -- 0 di 4MMOP01- 0. NO a 410 f- - G QUM 0 o d~ 0P S0 D 0 4111w-- MOP Ow 4MNDmogo mm460. o So om oamowmm -4 am 0o -o 4ow-100onow.u 0 AI 040 4P* 4W 41~0. 0 dI .0 *w a*a0. 4MMID00 ~ 41P f 40 a 49 w to abawof 411mm&0 mm ~ 0. 0.o 40011am f - aw e*u 4 i 4 faoomo lw 0001s 0___ go- 40 q n sw * 1 4 b*4 WND 4 41 de -t mm*o The Citrus Community Concert Choir, Inc. Proudly Presents Under the direction of Jacki Doxey Hull The Messiah An Oratorio by G. F. Handel Tuesday, December 13 at 7:30 p.m. Playhouse 19 817 N. Suncoast Blvd. (US 19), Crystal River Friday, December 16 at 7:30 p.m. Faith Lutheran Church 935 S. Crystal Glen Drive, Lecanto Sunday, December 18 at 2 p.m. St. Timothy Lutheran Church 1070 N. Suncoast Blvd. (US 19) Crystal River Tickets available at the door $6. General Admission Children 12 and under admitted free Call 212-1746 or 628-6452 C.. . for more information.H 420-1205-MCRN PUBLIC NOTICE FOR ADMINISTRATIVE HEARING TO REVIEW A PROPOSED DEVELOPMENT PLAN IN THE TOWN OF INGLIS, FLORIDA BY THE PLANNING COMMISSION OF THE'2 TOWN OF INGLIS, FLORIDA, SERVING AS-I THE LOCAL PLANNING AGENCY OF THE-: - TOWN OF INGLIS, FLORIDA, NOTICE IS HEREBY GIVEN that, pursuant to Sections---Z 163.3161 through 163.3246, Florida Statutes and:"lC Section 34-35! of the Town of Inglis Land' Development Code, comments, objections and'" recommendations regarding the following described ' proposed Short Form Development Plan, will be,',, heard by the Planning Commission of the Town of,,, Inglis, Florida, at an administrative hearing on," Thursday, December 22, 2005, at 7:00 p.m., or as"-, soon thereafter as the matter can be heard. The ' hearing will be conducted in the Town of Inglis, Town Hall located at 135 Highway 40 West, Inglis,'," Florida. (1) 07-05, a Short Form Development Plan application by Michael Klein and Robert Stem,,,:- for the construction of a single 2400 sq ft . commercial building. Property is located on the north side of C.R. 40, approximately 720 feet East of U.S Hwy 19 and West of Daisy Street as shown on the map below. INGLtS , e "4 II. i i -r CIrnus COUNTY (FL) CHRONICLE SPORTS CIRus COUNTY (FL) CHRONICLE SPOlilTS MONDAY, DECEMBER 5, 2005 5 N AT-"-F.. j:-.-: [. . i .. H ,- New England Miami Buffalo N.Y. Jets x-Indianapolis Jacksonville Tennessee Houston Cincinnati Pittsburgh Baltimore Cleveland Denver Kansas City San Diego Oakland N.Y. Giants Dallas Wasjington Philadelphia Carolina Tampa Bay Atlanta New Orleans 11 AMERICAN CONFERENCE East W L T Pct PF PA 7 5 0 .583 259282 5 7 0 .417 219240 4 8 0 .333 184 247 2 10 0 .167 143264 South W L T Pct PF PA 12 0 01.000 366 162 9 3 0 .750 255201 3 9 0 .250 239319 1 11 0 .083 183341 North W L T Pct PF PA 9 3 0 .750 327239 7 5 0 .583 274225 4 8 0 .333 161 241 4 8 0 .333 183214 West W L T Pct PF PA 9 3 0 .750 310221 8 4 0 .667 301 257 7 4 0 .636 323219 4 7 0 .364 239 262 NATIONAL CONFEREI W 8 7 6 5 W 9 8 7 3 W East L T Pct PF PA 4 0 .667 319218 5 0 .583 253205 6 0 .500 241 233 6 0 .455 229 246 South L T Pct PF PA 3 0 .750 290 194 4 0 .667 226 199 5 0 .583 277237 9 0 .250 183295 North L T Chicago 9 3 0 Minoesota 7 5 0 Detrbit 4 8 0 Green Bay 2 10 0 W L T y-Seattle 9 2 0 St. Louis 5 7 0 Arizona 4 8 0 San Francisco 2 10 0 x-clinched playoff spot y-clinched division Sunday's Games Miami 24,-Buffalo 23 Minnesota 21, Detroit 16 N.Y. Giants 17, Dallas 10 Cicago 19, Green Bay 7 Baltimore 16, Houston 15 Irilianapolis 35, Tennessee 3 Cincinnati 38, Pittsburgh 31 Carolina 24, Atlanta 6 Tdmpa Bay 10, New Orleans 3 Jadksonville 20, Cleveland 14 Washington 24, St. Louis 9 Arizona 17, San Francisco 10 Kansas City 31, Denver 27 New England 16, N.Y. Jets 3 Oakland at San Diego, 8:30 p.m. Monday's Game Seattle at Philadelphia, 9 p.m. c Pct .750 .583 .333 .167 Pct .818 .417 .333 .167 'Buccaneers 10, Saints 3 Tampa Bay 0 7 0 3-10 New Orleans 0 3 0 0- 3 Second Quarter T'--Galloway 30 pass from Simms (France kick), 4:44. NO-FG Carney 26, :46. Fourth Quarter TB-FG France 28, 9:37. A-34,411. TB NO First downs 14 16 Total Net Yards 248 279 Rusre-.e-yards 30-133 27-65 Passing 115 214 Puni'Retums 3-36 1-4 Kickoff Returns 2-53 3-67 Interceptions Ret. 4-91 0-0 Comp-Att-Int 12-21-0 18-34-4 Saoc ed-Yards Lost 1-8 2-1 PUnts 5-39.8 4-44.0 Fumbles-Lost 0-0 0-0. Penalties-Yards 5-26 5-35 Time of Possession 28:47 31:13 i INDIVIDUAL STATISTICS RUSHING-Tampa Bay, C.Williams 22- 96, Pittman 4-40, Simms 4-(minus 3). New Orleans, An.Smith 18-49, Brooks 3-9, Sfecker 5-5, Thomas 1-2. PASSING-Tampa Bay, Simms 12-21-0- 123. New Orleans, Brooks 18-34-4-215. RECEIVING-Tampa Bay, Galloway 5- 75, Hilliard 2-23, Pittman 2-19, C.Williams 27, AI.Smith 1-(minus 1). New Orleans, Stecker 4-55, Hilton 4-50, Henderson 3-42, Siallworth 3-20, Horn 2-40, Hall 1-7, An.Smith 1-1. MISSED FIELD GOAL-Tampa Bay, France 43 (BK). Bengals 38, Steelers 31 Cincinnati 7 14 10 7- 38 Pittsburgh 14 3 7 7-31 i First Quarter Pit-Bettis 1 run (Reed kick), 4:45. .Cin-Houshmandzadeh 43 pass from Ptlmer (Graham kick), 3:22. Pit-Morgan 25 pass from Rbethlisberger (Reed kick), :13. Second Quarter Ckin-Kelly 1 pass from Palmer (Graham kick), 10:08. Cin-Houshmandzadeh 6 pass from Palmer (Graham kick), 6:57. ,Pit-FG Reed 23, :00. S Third Quarter Cin-FG Graham 30, 11:01. 'Pit-Ward 20. pass from Roethlisberger (Reed kick), 9:05. Cin-R.Johnson 1 run (Graham kick), 7,57. i Fourth Quarter Cin-R.Johnson 14 run (Graham kick), 6t09. Pit-Ward 6 pass from Roethlisberger (Feed kick), 2:59. A-63,044. Cin Pit First downs 21 28 T tal Net Yards 324 474 Rushes-yards 25-102 28-95 Passing 222 379 Punt Returns 1-3 2-8 Kickoff Returns 5-197 6-136 Interceptions Ret. 3-58 0-0 C mp-Att-Int 22-38-0 29-41-3 Sacked-Yards Lost 1-5 2-7 PUnts 5-46.8 3-32.0 Fimbles-Lost 0-0 4-1 Penalties-Yards 4-30 4-45 T(me of Possession 26:42 33:18 INDIVIDUAL STATISTICS . ;RUSHING-Cincinnati, R.Johnson 21- 98, Houshmandzadeh 1-7, Palmer 3- (rhinus 3). Pittsburgh, Parker 15-71, Bettis 8,13, Ward 1-7, Staley 3-2, Roethlisberger 1:2. :PASSING-Cincinnati, Palmer 22-38-0- 227. Pittsburgh, Roethlisberger 29-41-3- 386. -RECEI VIN G-C incin n ati, Houshmandzadeh 5-88, C.Johnson 5-54, Henry 5-52, Kelly 3-12, C.Perry 2-12, RJohnson 1-5, Stewart 1-4. Pittsburgh, Ward 9-135, Randle El 5-47, Wilson 4-65, Miller 3-44, Bettis 3-24, Staley 2-9, Tuman 1-26, Morgan 1-25, Parker 1-11. 'MISSED FIELD GOALS-None. Vikings 21, Uons 16 Minnesota 7 7 7 0--21 Detroit 3 3 3 7-16 First Quarter Det-FG Hanson 45, 8:06. PF PA 201 127 219 273 190241 239 242 West PF PA 296 208 294 351 239 302 183 340 HomeAway 4-2-0 3-3-0 3-3-0 2-4-0 4-2-0 0-6-0 2-3-0 0-7-0 HomeAway 6-0-0 6-0-0 4-1-05-2-0 2-4-0 1-5-0 1-5-00-6-0 HomeAway 4-2-05-1-0 3-3-04-2-0 4-2-0 0-6-0 3-3-0 1-5-0 HomeAway 6-0-0 3-3-0 5-1-0 3-3-0 3-2-0 4-2-0 2-4-0 2-3-0 NCE HomeAway 6-1-0 2-3-0 4-2-0 3-3-0 4-2-0 2-4-0 4-1-0 1-5-0 HomeAway 5-1-0 4-2-0 4-2-0 4-2-0 3-3-0 4-2-0 1-5-0 2-4-0 HomeAway 6-1-0 3-2-0 4-1-0 34-0 3-4-0 1-4-0 1-4-0 1-6-0 HomeAway 6-0-0 3-2-0 3-3-0 2-4-0 2-4-0 2-4-0 2-5-0 0-5-0 AFC NFC Div 5-4-0 2-1-0 3-0-0 3-5-0 2-2-0 1-3-0 4-4-0 0-4-0 2-2-0 1-7-0 1-3-0 1-2-0 AFC NFC Div 10-0-02-0-0 5-0-0 7-2-0 2-1-0 2-1-0 2-7-0 1-2-0 1-3-0 1-9-0 0-2-0 0-4-0 AFC NFC Div 6-3-0 3-0-0 4-1-0 6-5-0 1-0-0 3-2-0 4-6-0 0-2-0 2-3-0 2-6-0 2-2-0 0-3-0 AFC NFC Div 6-2-0 3-1-0 3-1-0 7-3-0 1-1-0 3-2-0 5-2-0 2-2-0 2-1-0 2-6-0 2-1-0 0-4-0 NFC AFC Div 7-3-0 1-1-0 3-1-0 6-3-0 1-2-0 3-2-0 6-2-0 0-4-0 2-1-0 2-5-0 3-1-0 0-4-0 NFC AFC Div 6-2-0 3-1-0 2-1-0 6-3-0 2-1-0 2-1-0 4-4-0 3-1-0 1-2-0 1-7-0 2-2-0 1-2-0 NFC AFC Div 8-1-0 1-2-0 4-0-0 6-4-0 1-1-0 4-1-0 2-8-02-0-0 1-4-0 2-7-0 0-3-0 0-4-0 NFC AFC Div 8-1-0 1-1-0 5-0-0 2-6-0 3-1-0 1-4-0 3-7-0 1-1-0 3-3-0 2-8-0 0-2-0 1-3-0 Sunday, Dec. 11 Oakland at N.Y. Jets, 1 p.m. Houston at Tennessee, 1 p.m. Chicago at Pittsburgh, 1 p.m. New England at Buffalo, 1 p.m. Cleveland at Cincinnati, 1 p.m. St. Louis at Minnesota, 1 p.m. Indianapolis at Jacksonville, 1 p.m. Tampa Bay at Carolina, 1. Min-K.Robinson 80 pass from B.Johnson (Edinger kick), 7:56. Second Quarter Min-Bennett 7 run (Edinger kick), 13:53. Det-FG Hanson 26, :08. Third Quarter Min-Bennett 5 pass from B.Johnson (Edinger kick), 10:45. Det-FG Hanson 28, 1:51. Fourth Quarter Det-Pinner 6 run (Hanson kick), 7:38. A-61,375. First downs Total Net Yards Rushes-yards Passing Punt Returns Kickoff Returns Interceptions Ret. Comp-Att-Int Sacked-Yards Lost Punts Fumbles-Lost Penalties-Yards Time of Possession Mi< . ,' 2 0 345 32-103 242 5-24 4-71 1-00 17-23-0 2-14 6-42.7 0-0 11-94 30:41 Det 19 223 23-105 118 3-69 4-80 0-0 17-35-1 1-8 5-47.0 1-0 3-30 29:19 INDIVIDUAL STATISTICS RUSHING-Minnesota, Bennet 22-79, Fason 4-13, K.Robinson 1-9, B.Johnson 4- 8, Moore 1-(minus 6). Detroit, Pinner 14- 64, Bryson 6-29, Garcia 3-12. PASSING-Minnesota, B.Johnson 17- 23-0-256. Detroit, Garcia 17-35-1-126. RECEIVING-Minnesota, K.Robinson 4- 148, Kleinsasser 4-26, M.Robinson 3-32, Bennett 3-10, Burleson 2-26, T.Taylor 1-14. Detroit, R.Williams 4-34, Bryson 4-26, Pinner 3-39, Pollard 2-10, Vines 2-10, M.Williams 1-6, Fitzsimmons 1-1. MISSED FIELD GOALS-None. Colts 35, Titans 3 Tennessee 0 3 0 0- 3 Indianapolis 7 7 14 7- 35 First Quarter Ind-Harrison 10 pass from Manning (Vanderjagt kick), 8:08. Second Quarter Ind-Fletcher 13 pass from Manning (Vanderjagt kick), 4:11. Ten-FG Bironas 24, :29. Third Quarter Ind-Wayne 27 pass from Manning (Vanderjagt kick), 9:40. Ind-James 2 run (Vanderjagt kick), 1:28. Fourth Quarter Ind-Tripplett 60 interception return (Vanderjagt kick), 11:44. A-57,228. First downs Total Net Yards Rushes-yards Passing Punt Returns Kickoff Returns Interceptions Ret. Comp-Att-Int Sacked-Yards Lost Punts Fumbles-Lost Penalties-Yards Time of Possession Ten 17 260 20-40 220 1-16 6-171 0-0 26-39-0 4-30 2-43.0 2-1 7-35 32:57 Ind 21 292 31-105 187 0-0 2-48 0-0 13-17-0 0-0 2-52.0 1-1 5-33 27:03 INDIVIDUAL STATISTICS RUSHING-Tennessee, Brown 11-32, Henry 6-18, McNair 2-3, Jones 1-(minus 13). Indianapolis, James 28-107, Manning 2-(minus 1), Sorgi 1-(minus 1). PASSING-Tennessee, McNair 22-33-0- 220, Volek 4-6-0-30. Indianapolis, Manning 13-17-0-187. RECEIVING-Tennessee, Scaife 6-53, Bennett 6-37, Troupe 5-67, R.Williams 2- 34, Calico 2-26, Henry 2-18, Brown 1-6, Fleming 1-5, Kinney 1-4. Indianapolis, Harrison 4-61, Wayne 3-50, Clark 2-37, Fletcher 2-22, James 2-17. MISSED FIELD GOAL-Tennessee, Bironas 51 (WL). Panthers 24, Falcons 6 Atlanta 3 3 0 0- 6 Carolina 7 7 010-24 First Quarter Atl-FG Peterson 36, 4:02. Car-Foster 18 pass from Delhomme (Kasay kick), :31. Second Quarter AtI-FG Peterson 43, 11:41. Car-S.Smith 18 pass from Delhomme (Kasay kick), 3:51. Fourth Quarter Car-FG Kasay 20, 6:33. Car-Foster 6 run (Kasay kick), Ati 14 259 23-120 139 3-20 4-113 1-15 17-35-2 5-32 6-35.7 0-0 4-37 27:40 A-73,661. First downs Total Net Yards Rushes-yards Passing Punt Returns Kickoff Returns Interceptions Ret. Comp-Att-Int Sacked-Yards Lost Punts Fumbles-Lost Penalties-Yards Time of Possession 2:19. Car 14 306 34-142 164 0-0 3-56 2-37 17-27-1 0-0 7-44.6 1-0 3-38 32:20 INDIVIDUAL STATISTICS RUSHING-Atlanta, Dunn 16-80, Vick 3- 36, Duckett 4-4. Carolina, Foster 24-131, S.Davis 5-8, Delhomme 4-1, Hoover 1-2: PASSING-Atlanta, Vick 17-35-2-171. Carolina, Delhomme 17-27-1-164. RECEIVING-Atlanta, Finneran 4-31, Crumpler 3-52, White 3-35, Jenkins 3-32, Griffith 2-13, Dunn 1-6, Duckett 1-2. Carolina, S.Smith 7-65, Foster 3-49, Colbert 3-24, Hoover 3-20, Proehl 1-6. MISSED FIELD GOAL-Atlanta, Peterson 49 (SH). Jaguars 20, Browns 14 Jacksonville Cleveland 3 0 17 0-20 014 0 0-14 First Quarter Jac-FG Scobee 24, 4:14. Second Quarter Cle-Edwards 34 pass from Frye (Dawson kick), 10:41. Cle-Edwards 17 pass from Frye (Dawson kick), :44. Third Quarter Jac-FG Scobee 29, 10:13. Jac-Wrighster 9 pass from Garrard (Scobee kick), 5:04. Jac-J.Smith 12 pass from Garrard (Scobee kick), 1:11. A-70,941. First downs Total Net Yards Jac Cle 17 15 237 303 Rushes-yards Passing Punt Returns Kickoff Returns Interceptions Ret. Comp-Att-Int Sacked-Yards Lost Punts Fumbles-Lost Penalties-Yards Time of Possession 36-135 102 3-21 3-80 0-0 11-20-1 3-14 4-41.3 0-0 5-50 29:43 32-98 205 0-0 5-84 1-0 13-20-0 5-21 6-37.2 1-0 7-97 30:17 INDIVIDUAL STATISTICS RUSHING-Jacksonville, G.Jones 27- 103, Garrard 7-26, M.Jones 1-3, Pearman 1-3. Cleveland, Droughns 30-88, Frye 2- 10. PASSING-Jacksonville, Garrard 11-20- 1-116. Cleveland, Frye 13-20-0-226. RECEIVING-Jacksonville, J.Smith 3- 49, Wilford 3-36, Wrighster 2-9, Brady 1- 17, G.Jones 1-9, Pearman 1-(minus 4). Cleveland, Edwards 5-86, Bryant 3-63, F.Jackson 2-15, Northcutt 1-45, Shea 1- 13, Heiden 1-4. MISSED FIELD GOAL-Cleveland, Dawson 34 (WL). Dolphins 24, Bills 23 Buffalo 21 0 2 0-23 Miami 0 3 021-24 First Quarter Buf-Evans 46 pass from Losman (Lindell kick), 12:47. Buf-Evans 56 pass from Losman (Lindell kick), 11:07. Buf-Evans 4 pass from Losman (Lindell kick), 2:14. Second Quarter Mia-FG Mare 23, :43. Third Quarter Buf-Safety, Frerotte sacked in end- zone, 10:12. Fourth Quarter Mia-R.Williams 5 run (Mare kick), 11:35. Mia-Brown 23 pass from Rosenfels (Mare kick), 7:35. Mia-Chambers 4 pass from Rosenfels (Mare kick), :06. A-72,051. Buf Mia First downs 16 26 Total Net Yards 294 434 Rushes-yards 33-92 22-73 Passing 202 361 Punt Returns 5-35 5-14 Kickoff Returns 5-111 4-74 Interceptions Ret. 1-0 1-11 Comp-Att-Int 14-27-1 34-65-1 Sacked-Yards Lost 2-25 3-26 Punts 8-44.1 7-36.4 Fumbles-Lost 2-2 1-1 Penalties-Yards 7-55 13-81 Time of Possession 31:17 28:43 INDIVIDUAL STATISTICS RUSHING-Buffalo, McGahee 27-81, Losman 3-10, S.Williams 3-1. Miami, R.Williams 11-46, Brown 9-22, Rosenfels 2-5. PASSING-Buffalo, Losman 13-26-1- 224, Parrish 1-1-0-3. Miami, Frerotte 12- 28-0-115, Rosenfels 22-37-1-272. RECEIVING-Buffalo, Evans 5-117, Reed 2-35, McGahee 2-18, Parrish 2-17, Aiken 1-22, S.Williams 1-13, Euhus 1-5. Miami, Chambers 15-238, McMichael 6- 41, R.Williams 6-32, Welker 4-40, Brown 2-30, Gilmore 1-6. MISSED FIELD GOALS-None Giants 17, Cowboys 10 Dallas 0 0 10 0-10 N.Y. Giants 0 10 7 0-17 Second Quarter NY-Jacobs 1 run (Feely kick), 10:00. NY-FG Feely 27, 1:58. Third Quarter NY-Pierce 12 fumble return (Feely kick), 14:48. Dal-FG Cundiff 34, 10:03. Dal-T.Glenn 7 pass from Bledsoe (Cundiff kick), 3:52. A-78,645. ari MV Enjoy our newly renovated clubhouse and "Champion grass" greens. Citrus County's only TRUE private Country Club. Members enjoy fine dining, a variety of soCal events, otenn/s and swimming. Our R f membership program offers several A im wonderful V i opportunities and provides options& 3 J. -.1* c.......... i.. CA W 10'i I, ;As seen FOR STRUCTURED SETTLEMENTS, on T.. o. ANNUITIES and INSURANCE PAYOUTS (800) 794-7310 |X J.G. Wentworth means CASH NOW for Structured Settlements! First downs Total Net Yards Rushes-yards Passing Punt Returns Kickoff Returns Interceptions Ret. Comp-Att-Int Sacked-Yards Lost Punts Fumbles-Lost Penalties-Yards Time of Possession 16 206 27-81 125 2-30 4-66 2-10 15-39-2 4-21 7-40.0 2-2 7-46 28:29 17 277 34-127 150 2-6 3-61 2-15 12-31-2 1-2 6-44.7 0-0 6-44 31:31 INDIVIDUAL STATISTICS RUSHING-Dallas, J.Jones 23-74, M.Barber 2-8, Bledsoe 2-(minus 1). N.Y. Giants, T.Barber 30-115, Carter 1-6, Ward 1-4, Jacobs 2-2. PASSING-Dallas, Bledsoe 15-39-2- 146. New York, Manning 12-31-2-152. RECEIVING-Dallas, J.Jones 9-88, T.Glenn 3-37, K.Johnson 2-16, Witten 1-5. N.Y. Giants, Burress 4-47, Carter 2-48, Finn 2-20, Shockey 2-20, T.Barber 1-9, Toomer 1-8. MISSED FIELD GOAL-New York, Feely 33 (WR). Chiefs 31, Broncos 27 Denver 7 14 3 3-27 Kansas City 714 3 7- 31 First Quarter Den-Anderson 66 pass from Plummer (Elam kick), 9:14. KC-Hall 41 pass from Green (Tynes kick), 5:49. Second Quarter KC-L.Johnson 1 run (Tynes kick), 10:05. Den-Anderson 1 run (Elam kick), 3:27. KC-Gonzalez 25 pass from Green (Elam kick), 1:39. Den-Van Pelt 7 run (Elam kick), :22. Third Quarter KC-FG Tynes 34, 10:04. Den-FG Elam 22, 3:09. Fourth Quarter Den-FG Elam 40, 13:31. KC-L.Johnson 4 run (Tynes kick), 9:58. A-78,261. First downs Total Net Yards Rushes-yards Passing Punt Returns Kickoff Returns Interceptions Ret. Comp-Att-Int Sacked-Yards Lost Punts Fumbles-Lost Penalties-Yards Time of Possession Den 19 388 29-131 257 * 1-1 6-113 2-38 18-29-2 2-19 2-49.0 0-0 8-55 27:33 KC 24 421 37-168 253 2-10 6-143 2-0 16-23-2 0-0 2-38.0 1-1 6-45 '32:27 INDIVIDUAL STATISTICS RUSHING-Denver, Bell 5-46, Anderson 13-37, Dayne 8-26, Plummer 1-8, R.Smith 1-7, Van Pelt 1-7. Kansas City, L.Johnson 30-140, Green 3-13, Richardson 1-8, Hall 1-6, D.Brown 2-1. PASSING-Denver, Plummer 18-29-2- 276. Kansas City, Green 16-23-2-253. RECEIVING-Denver, R.Smith 6-79, Putzier 4-50, Lelie 2-63, K.Johnson 2- (minus 1), Anderson 1-66, Alexander 1-9, Devoe 1-9, Bell 1-1. Kansas City, Kennison 4-108, Parker 4-39, Hall 2-55, L.Johnson 2-9, Gonzalez 1-25, K.Wilson 1-11, Dunn 1-3, Horn 1-3. MISSED FIELD GOALS-None. Patriots 16, Jets 3 N.Y. Jets 0 3 New England 0 6 Second Quarter NE-FG Vinatieri 21, 5:36. 0 0- 3 7 3- 16 NY-FG Nugent 38, 1:02. NE-FG Vinatieri 34, :02. Third Quarter NE-Dillon 1 run, (Vinatieri kick), 4:12. Fourth Quarter FG-Vinatieri 22, 14:02. A-68,756. First downs Total Net Yards Rushes-yards Passing Punt Returns Kickoff Returns Interceptions Ret. Comp-Att-Int NY 12 164 16-41 123 2-14 5-70 0-0 15-37-1 NE 24 397 35-146 251 3-17 2-32 1-0 27-37-0 Sacked-Yards Lost 2-12 2-20 Punts 6-42.0 4-48.0 Fumbles-Lost 0-0 1-0 Penalties-Yards 7-60 7-68 Time of Possession 21:50 38:10 INDIVIDUAL STATISTICS RUSHING-New York, Martin 15-29, Bollinger 1-12. New England, Dillon 16-65, Faulk 10-35, Cloud 5-27, Brady 4-19. PASSING-New York, Bollinger 15-37-0- 135. New England, Brady 27-37-0-271. RECEIVING-New York, Coles 4-35, Martin 4-26, Jolley 2-26, Cotchery 2-16, Dreesen 1-17, Houston 1-11, McCareins 1- 4. New England, Brown 5-64, Branch 5-44, Givens 5-27, Faulk 4-46, Dillon 4-19, Watson 2-43, Davis 2-28. MISSED FIELD GOALS-New England, Vinatieri 45 (WL). OFFICIALS-Referee JeffTriplette, Ump Scott Dawson, HL Tony Veteri, LJ Jeff Seeman, FJ Duke Carroll, SJ Greg Meyer, BJ Greg Steed, Replay Mark Burns. Redskins 24, Rams 9 Washington 7 3 014-24 St. Louis 0 7 0 2- 9 First Quarter Was-Portis 47 run (Hall kick), 10:29. Second Quarter StL-Fitzpatrick 7 run (Wilkins kick), 7:05. Was-FG Hall 38, 3:11. Fourth Quarter Was-Portis 1 run (Hall kick), 13:46. StL-Safety, Brunell sacked by Little in end zone, 11:55. Was-Cooley 4 pass from Brunell (Hall kick), 5:50. A-65,701. First downs Total Net Yards Rushes-yards Passing Punt Returns Kickoff Returns Interceptions Ret. Comp-Att-Int Was 19 407 40-257 150 5-38 2-42 1-0 14-22-0 StL 13 191 17-49 142 2-2 5-90 0-0 21-36-1 Sacked-Yards Lost 1-6 3-21 Punts 4-42.8 8-46.6 Fumbles-Lost 1-0 2-1 Penalties-Yards 8-76 4-30 Time of Possession 33:58 26:02 INDIVIDUAL STATISTICS RUSHING-Washington, Portis 27-136, Cartwright 9-118, Broughton 1-3, Brunell 3- 0. St. Louis, Jackson 11-24, Fitzpatrick 5- 22, Faulk 1-3. PASSING-Washington, Brunell 14-21- 0-156, Portis 0-1-0-0. St. Louis, Fitzpatrick 21-36-1-163. RECEIVING-Washington, Cooley 5-58, Royal 4-40, Moss 3-58, Portis 1-1, Jacobs 1-(minus 1). St. Louis, Holt 6-75; Bruce 4-. 33, Jackson 4-18, McDonald '2,7, CurtiS) 2-6, Manumaleuna 1-6,. Hddgedock, 1-54') Cleeland 1-(minus 7). '- i t MISSED FIELD GOAL-Washington, Hall 45 (WL). OFFICIAL MERCHANDISE Hats :*T-shirts * Jackets Sports Plaques ekvitman Inadea Se Stas Sugawiti eWe :SOO PM December 10th Tickets $7.00 Curtis Peterson Auditorium Lecanto, Florida Tickets at the door or For tickets in advance call Pat: (352)382=4555 6B MONDAY. DECEMBER 5. 2005 ENTERTAINMENT C'u'nus COUN'IY (EQ cHRONICLE MONDAY EVENING DECEMBER 5, 2005 A: Adelphia,Citrus B: Bright House D: Adelphia,Dunnellon : Adelphia, Inglis A B D I 6:00 6:30 7:00 7:30 8:00 8:30 9:00 19:30 10:00 10:30 11:00 11:30 W 19 19 19 News 650 NBC News Ent. Tonight Access Share Your Sticks and Las Vegas "Down and Medium "Being Mrs. News Tonight NBC 195 Hollywood Christmas Stones'G' Dirty" (N) '14, D,L,S' 9 O'Leary's Cow" '14'6698 1635124 Show (WEDUI BBC World Business The NewsHour With Jim Paul Anka Rock Swings: Live in Celtic Woman (In Stereo) 'G' B] 16501 Loggins- PBS U 3 3 News'G' Rpt. Lehrer c9 4853 Montreal (In Stereo) S 22037 Sittin WUFT BBC News Business The NewsHour With Jim The Perricone Weight Loss Diet (N) (In Cantors: A Faith in Song (In Stereo) 'G' Being Tavis Smiley PBS R5 5 5 3921 Rpt. Lehrer (N) 37211 Stereo) 'G' [9 66495 [9 19124 Served 29673 NWFLAI News 6259 NBC News Ent. Tonight Extra (N) Las Vegas "For Sail By Las Vegas "Down and Medium "Being Mrs. News Tonight NBC 8 'PG' c Owner" '14, D,L' 46969 Dirty" (N) '14, D,L,S' 9c O'Leary's Cow" '14' 29292 7737292 Show (WFTV0 News 10 ABC WId Jeopardy! Wheel of Wife Swap "Pyke/Smith" NFL Football Seattle Seahawks at Philadelphia Eagles. From Lincoln Financial ABC 20 20 20 20 3327 News 'G' [9 4940 Fortune (N) 'PG' c 82785 Field in Philadelphia. (In Stereo Live) c9 413211 WSIWT-]sI News 1969 CBS Wheel of Jeopardy! The King of How I Met Two and a Out of CSI: Miami "From the News Late Show CBS U 10 10 10 10 Evening Fortune (N) 'G''fg 1105 Queens Half Men Practice Grave"'14, V BB 63650 5716056 WT News B9 71230 Geraldo at The Bernie Arrested Kitchen Nanny 911 "Maucione News [9 18124 M*A*S*H The Bernie FOX 13 13 Large'PG' Mac Show Dev. Confid. Family"'PG' cc 15037 'PG' 87766 Mac Show WCJBI 1 1 News 58747 ABC WId Ent. Tonight Inside Wife Swap "Pyke/Smith" NFL Football Seattle Seahawks at Philadelphia Eagles. From Lincoln Financial ABC s News Edition 'PG' c 26785 Field in Philadelphia. (In Stereo Live) c9 242211 WCLRichard and Lindsay Touch of Zola Levitt Gregory Possess the Life Today Manna-Fest The 700 Club 'PG' 9] Pentecostal Revival Hour IND 2 2 2 2 Roberts 'G' 8477124 Fire Presents Dickow 'G' 'G' 5322501 'G' 1617259 2806969 FTS 11 News 47679 ABC Wid Inside The Insider Wife Swap "Pyke/Smith" NFL Football Seattle Seahawks at Philadelphia Eagles. From Lincoln Financial ABC News Edition 50143 'PG' E9 82389 Field in Philadelphia. (In Stereo Live) E9 318853 WMOR Will & Grace Just Shoot Will & Grace Access Movie: "A Chance of Snow" (1998, Drama) JoBeth Fear Factor (In Stereo) Access Cheaters D 12 12 12 12 'PG' Me '14' 'PG' Hollywood Williams, Michael Ontkean. 'PG, D' 9 48969 'PG' cc 27476 Hollywood 'PG' 17785 WT-A Seinfeld Every- Every- Sex and the 7th Heaven (In Stereo) Related "Hello, Deli" 'PG, News Yes, Dear Seinfeld Sex and the IND Ba 6 6 6 6 'PG, D' Raymond Raymond City '14, 'G' 9] 9083834 DL' [ 9003698 2261281 'PG, D' 'PG' City '14, WTOGThe Malcolm in The Friends 'PG' One on One All of Us Girlfriends Half & Half The King of The King of South Park South Park IND 4 4 4 4 Simpsons the Middle Simpsons c9 3969 'PG, L 8308 'PG' E 'PG L' 'PG, L' Queens Queens '14' 85308 '14' 73747 WKE) ANN News Few County CCTV 80969 Let's Talk Golf 44143 We Have Rock It TV Janet Parshall's America! Circuit Court ANN News FAM 16 16 16 16 60105 Minutes Court Issues 30719 34766 91747 OGXI 13 13 Friends 'PG' Friends 'PG' King of the The Arrested Kitchen Nanny 911 "Maucione News (In Stereo) c9 Geraldo at Home FOX 8U35__ 8495 c 9747 Hill 'PG L' Simpsons Dev. Confid. Family"'PG' 9 64389 67476 Large (N) Improvemen WAIND 21 21 2 Variety 5389 The 700 Club 'PG' [] Pastor Dr. Dave Possessing This Is Your R. Praise the Lord c 14227 IND 1 1_ 2 211 21 888056 Loren 8853 Martin the Day 'G' Scarboroug W5A M 1 1, c 1 Noticias 62 Noticiero Piel de Otofio Mujeres Contra Viento y Marea La Esposa Virgen 551292 Cristina Sorpresas de Noticias 62 Noticiero SNI 2 1 94360 Univisi6n valientes. 562308 571056 amor. 561679 856259 Univision WxPX Shop 'Til On the NBA Basketball San Antonio Spurs at Orlando Magic. From the It's a' Doc "The Commercial" (In It's a Build. PAX 7 You Drop Cover 'G' TD Waterhouse Centre in Orlando. Fla. (Live) 101230 Miracle 'G' Stereo) 'PG' [ 61872 Miracle 'G' Wealth S 54 48 54 54 City Confidential 'PG' Cold Case Files 'PG' The Secret Life of a Growing Up Growing Up Intervention'(N) '14, L' M Crossing Jordan "As If By 723921 (487582 Serial Killer 'PG' 496230 Gotti 'P, L' Gotti 'PG' 486853 Fate" '14' 9] 323358 FAICr 55 64 55 55 Movie: *** A "Antwone Fisher" (2002, Drama) Movie: ** "Field of Dreams" (1989, Fantasy) Movie: *** "The Natural" (1984, Drama) Robert Derek Luke, Joy Bryant. c9 765245 Kevin Costner, Amy Madic an. 9102292 Redford, Robert Duvall. [B 18440211 A 52 35 52 52 The Crocodile Hunter 'G' The Most Extreme Lucky Travels L.A. (N) 'G' Animal Precinct 'PG' Animal Precinct (N) 'PG' Lucky Travels L.A. 'G' 9 6479582 "Disguise" 'G' 1687018 1696766 1609230 1686389 2808327 AV 1 77 Great Things About the The West Wing "7A WF The West Wing (in The West Wing (In The West Wing (In The West Wing "Posse Holidays 747037 83429" 'PG' 395698 Stereo) 'PG' []371018 Stereo) '14' c[ 384582 Stereo) 'PG' c 394969 Comitatus" 'PG' 146196 [ 27 61 27 27 Movie: "Joe Dirt" (2001, Comedy) David Spade, Daily.Show Colbert David South Park Mind of Reno 9111 DailyShow Colbert I Brittany Daniel. c9 38582 Report Spade 'MA 92327 Mencia '14' '14'66414 Report fC 98 45 98 98 Reba's Top 20 Dukes of Hazzard "Officer Movie: ** "Great Balls of Firel" (1989, Drama) Dennis American Dukes of Hazzard 'G' I Countdown 40476 Daisy Duke" 'G' 33037 Quaid, Winona Ryder, John Doe. 981563 Soldier 22105 S96 65 96 96 One-Hearts Footstep- Daily Mass: Our Lady of The Journey Home 'G' Super The Holy Abundant Life 'G' The World Over 2771655 1 1_ 3Christ the Angels 'G' 8285495 8294143 Saints 'G' Rosary 8284766 S 29 52 29 29 7th Heaven (In Stereo) Jack Frost 'G' 546834 Movie: ** "Jack Frost" (1998, Fantasy) Michael Whose Whose The 700 Club 'PG' c I9' 2 9 G' 9 905563 Keaton, Kelly Preston. cc 566698 LiLine ?ine? 274230 C 30 60 30 30 King of the King of the That '70s That '70s Movie: * "Speed" (1994) Keanu Reeves, Dennis Hopper. A transit bus Nip/Tuck "Abby Mays" Hill 'PG' c Hill 'PQ V Show '14, Show '14, is wired to explode if it drops below 50 mph. 8436312 'MA' 5495476 FG1 TV 23 57 23 23 Weekend Landscaper Curb Appeal House Cash in the Dream House Designed to Buy Me Rezoned Design on a Double Take __ Warriors 'G' s 'G' Hunters .Attic House (N) Hunters Sell 'G' 1119124 1128872 Dime Sfi 51 25 51 51 Targeted 'PG' B 5166178 Modern Marvels 'PG' c[ Boys' Toys (N) 'PG' c9 Boys' Toys 'PG' c9 Battlefield Detectives (N) Battlefield Detectives (N) 8290327 8276747 8289211 'PG' 9l 8299698 'PG' 0 5539717 (fj 24 38 24 24 Golden Girls Golden Girls Movie: ** "On the 2nd Day of Christmas" Movie: "Recipe for a Perfect Christmas" (2005) Will & Grace Will & Grace (1997) Mary Stuart Masterson. 'PG' c9 258292 Carly Pope. 'PG' cc 561143 '14, L,S' '14' IMK 28 36 28 28 All Grown Danny Fairly Jimmy SpongeBob Fairly Full House Fresh Roseanne Roseanne Roseanne The Cosby Up 'Y' Phantom 'Y' Oddparents Neutron Oddparents 'G' 756124 Prince 'PG' 822619 'PG' 527227 'PG' 768969 Show 'G' ( iCIF 31 59 31 31 Movie: ***'A "Jurassic Park"1993) Sam Neill, Laura Dem. Cloned The Triangle (Series Premiere) (N) (Part 1 of 3) 'PG, The Triangle (Part 1 of 3) 3 5 1 dinosaurs run amok at an island amusement park. NO 8358292 L,V' 5146679 'PQ, L,V' [ 2496360 SPiKl 37 43 37 37 World's Wildest Police CSI: Crime Scene CSI: Crime Scene CSI: Crime Scene UFC Unleashed (In UFC Unleashed (In SVideos'PG' 9 196389 Investigation '14, D,S,V' Investigation'14, L,V Investigation '14, S,V Stereo) 840563 Stereo) 449018 (TD 49 23 49 49 Seinfeld Seinfeld Every- Every- Friends'14, Friends'14' Friends'PG' Friends'PG' Family Guy Family Guy Movie: ** "Lethal 'PGQ D' 'P D' Raymond Raymond D' 926921 945056 303056 364292 '14, D,L,S' 'PG, D,L,S' Weapon" 8381259 (T Movie: * "The Court-Martial of Billy Movie: ** "Going Hollywood" Movie: ** "Pennies From Movie: "Road to 1_3_ -5Mitchell" (1955) Gary Cooper. c9 9084563 (1933) Bing Crosby. 3756259 Heaven" (1936, Musical) 3537872 Singapore" B9 8787018 Cash Cab Cash Cab Biker Build-Off Zero Biker Build-Off'PG' c9 Monster Garage (N) 'PG' American Chopper 'PG' American Chopper 'PG' 53 34 53 53 (N)'G' (N) 'G Engineering. 'PG' 492414 478834 cc 498698 c9 491785 c9 123330 T 50 46 50 50 Martha Christine Amazing Medical Stories Trauma: Life in the ER Untold Stories of the E.R. Born a Boy, Brought Up a Trauma: Life in the ER 50 46 50 50 Baranski. (N) cc 114785 'PG' c 836360 'PG' cc 852308 (N) 'PG' 865872 Girl 'PG' 875259 'PG' c 467414 TTI 488 33 48 48 Charmed "Awakened" Law & Order "For Love or Law & Order "Seer" '14' Law & Order "All in the Wanted "Shoot to Thrill" Wanted "Shoot to Thrill" 'PQ V cc 112327 Money" '14' 867230 9[ (DVS) 843650 Family" '14' 863414 'MA, L,V' 9 866501 'MA, L,V' c 465056 TRAV 9 54 9 9 Alaska's Arctic Wildlife 'G' America's Orient Express Alaska Wide Open 'PG' Strand- Strand- Anthony Bourdain Iceland Alaska Wide Open 'PG' cc 5054501 'G' 9] 2783853 cc 9152993 Peters Peters in winter. 'MA' 3133394 [9 2903563 T ) 32 75 32 32 All in the All in the All in the All in the Little House on the Andy Griffith Sanford and 100 Most Unexpected TV 100 Most Unexpected TV Family 'PG' Family'PG' Family'PG' Family'PG' Prairie 'G' 1681834 Son 'PG' Moments 1604785 Moments 2893495 A) 47 32 47 47 Movie: "Bruce Law & Order: Special Law & Order: Criminal WWE Monday Night Raw (In Stereo Live) '14, D,L,V Movie: "Training Day" 7324 Almighty" (2003) 630747 Victims Unit '14'826740 Intent '14' c9 826560 E9 5523940 (2001) 81392650 18 18 18 18Home Home America's Funniest Home America's Funniest Home America's Funniest Home WGN News at Nine (In Sex and the Becker 'PG, S18 1 I8 18 mprovemen Improvemen Videos 'PG' 382124 Videos 'PG' 391872 Videos 'PG' 388308 Stereo) 381495 City14, L'354476 MONDAY EVENING DECEMBER 5, 2005 A: Adelphia,Citrus B: Bright House D: Adelphia,Dunnellon 1: Adelphia, Inglis ABD TI 6:00 6:30 7:00 7:30 8:00 8:30 9:00 9:30 10:00 10:30 11:00 11:30 DiN ) 46 40 46 46 Sister, Sister Phil of the That'sSo That'sSo Movie: ** "Mickey's Twice Upon a Life With Naturally Sister, Sister That's So That's So 'G' 344196 Future 'G' Raven aven' Raven 'Y7' Christmas" (2004) 1326143 Derek 'G' Sadie 'G' G' 645817 Raven 'G' Raven 'Y7' HA I: 68 M*A*S*H M*A*S*H Walker, Texas Ranger'14, Walker, Texas Ranger '14, Movie: "A Christmas Visitor" (2002, Drama) William M*A*S*H M*A*S*H HAL 68 'PG' 1943308 'PG' 1927360 V 0[ 1603056 V c9 1689476 Devane, Meredith Baxter. 'PG' 0 1682563 'PG' 5329414 'PG' 2356018 Movie: *** "Marvin's Room"(1996) Movie: **s "Spanglish" (2004) Adam Sandler. A housekeeper Movie: *** "In Good Company" (2004, Comedy- Meryl Streep. 9 6102037 works for a chefandis neurotic wife. 41627872 Drama) Dennis Quaid. C[ 7320292 MiAX "Bulworth" Movie: **x "As Good as Dead" Movie: * "Assault on Precinct 13" (2005, Movie: ** "Shaun of the Dead" "Lessons in 58353143 (1995, Suspense) 'PG' 889211 Action) Ethan Hawke. 9B 564230 (2004) Simon Pegg. 6657501 Love" (fM ) 97 66 97 97 Next 292476 Next 216056 Direct Effect (In Stereo) Made "Soccer" Soccer Punk'd 'PG, Gauntlet II R. Wrld MTV Miss Made "Rocker (In Stereo) 'PG'544476 player. 'PG'553124 L'817834 Preview Chal. 17 'PG' 272872 (G 71 Naked Science "Super Spontaneous Human Crop Circles 'G' 7775834 Naked Science "Alien Naked Science 'G' Crop Circles 'G'1469230 Volcano" 'G' 3228143 Combustion 'G' 7799414 Contact" 'G' 7795698 7798785 S 62 "Deceed"Movie: *' "Happy New Year" (1987, Comedy) "The Englishman Who Went Up a Hill Movie: *** "It Could Happen to "Deceived" "Deceived" Peter Falk. [E 28015740 but Came Down a Mountain" You" (1994) 0] 1157360 43 42 43 43 Mad Money 9892389 On the Money 6723969 The Apprentice: Martha Mad Money 6712853 The Big Idea With Donny The Apprentice: Marha S43 42 43 43 MdMny928 Ont oy67 Stewart 'PG'6709389 Deutsch Stewart'PG'3900124 40 29 40 40 Lou Dobbs Tonight c9 The Situation Room Paula Zahn Now cc Larry King Live c9 721376 Anderson Cooper 360 B9 390582 365921 121312 121132 25 55 25 25 NYPD Blue "Lost Israel"' Cops '14, V Cops '14, V The Investigators (N) '14' Forensic North Under Forensic Extreme Extreme '14, L' c9 9810785 3374292 9245872 6727785 Files 'PG' Mission Investigation Files 'PG' Evidence Evidence CSPAN 39 50 39 39 House of Representatives 50766 Tonight From Washington 769563 Capital News Today 783143 44 37 44 44 Special Report (Live) 9 The Fox Report With The O'Reilly Factor (Live) Hannity & Colmes (Live) On the Record With Greta The O'Reilly Factor 9880143 Shepard Smith c9 c 5121360 9 5141124 Van Susteren 8515921 (lSNC 42 41 42 42 The Abrams Report Hardball 9 5158414 Countdown With Keith Rita Cosby Live & Direct Scarborough Country The Situation With Tucker 9860389 Olbermann 5134834 5154698 5157785. Carlson ESPN 33 27 33 33 SportsCenter (Live) 9 894018 o y Night Countdown (Live) c9 Figure Skating Cup of Russia. From St. Petersburg, Russia. (Taped) c] 673969 390655 ESP2 34 28 34 34 ESPN Quite Frankly With Women's College Basketball Jimmy V Classic Codebreaker Rodeo Wrangler National Finals Third Round. From Hollywood Stephen A. Smith 9734143 Connecticut vs. North Carolina. cc 8405872 s Las Vegas. [] 4301292 f L 35 39 35 35 Totally Panthers NHL Hockey Ottawa Senators at Florida Panthers. From the Best Damn Sports Show College Basketball Minnesota at Arizona Football Preview BankAtlantic Center in Sunrise, Fla. (Live) 770766 Period 719495 State. (Live) 833853 FSUN) 36 31 Midnight Esiason Sports Talk Live (Live) Football Wrap 53853 College Basketball BB&T Classic George Sports Talk Live 75259 36_ 31 _Magic 'G' 44105 vWashington vs. Maryland. (Live) 56940. Houmwuata might Mm wrw* ,i. 4 4h I) - Local - X 0 0 IM I I "Copyrighted Material I Syndicated Content Available from Commercial News Providers" 1 _I J B MONDAY, DECEMBER 5, 2005 CITRUS COUNTY (FL) CHRONICLE ENTERTAINMENT S*0 Ciu oin F)CRNCEC Mc ODY DEEME 52057 AU-.X JOP40 4 A i .." - *n 1 ^ i~lli. - qm4j*~ o~lIEb o= 0 ~ 0 . ~0 lb.' es. ~ vi o 4w - mm.- I ^-r^^f -I -m qb a q- I 0 p g too * ^'^L , Oft C 40-A0 .~. TV as Available Syndicated Content , From Commercial News Providers'h 4 lb i. r I' *. 4 __ 1' -1 **/ 0 4 ao 'V "* ^ -l '^*?A It ., flb qgr '0"- v^ > & A ** v 0 0 ^'I' 9 * ,, c., t* VrIpX Efgital. . - .Tod A A Times subject to change; call ahead. Your Birthday: Many Sagittarians will be looking to build their material base in the year ahead, and you will be one of them. While conditions look very good, there is still no reason to take foolish risks. Sagittarius (Nov. 23-Dec. 21) Before impulsively supporting someone, be sure you have all the facts. You could end up defending a person who is unworthy. Capricorn (Dec. 22-Jan. 19) Work things out for yourself today. Don't follow the advice of someone who has nothing at stake. This person is seeing things with a jaundiced eye. Aquarius (Jan. 20-Feb. 19) Before pointing out the shortcomings of others, be mindful of your faults and defects. Only when you clean up your act, can you clean up theirs. Pisces (Feb. 20-March 20) You would be wise to keep outsiders out of your private affairs, even if a close personal friend is involved. He or she could uninten- tionally make a sticky situation much worse. Aries (March 21-April 19) Make the most of any situation no matter who is involved, even if it that per- son rubs you the wrong way. Taurus (April 20-May 20) Watch your conduct in front of an authority figure, whether you like this person or not. Employing the silent treatment will make you look mean and spiteful. Gemini (May 21-June 20) It will be difficult to get your point of view across to an individual who has rejected it in the past. Don't bang your head against a brick wall. Cancer (June 21-July 22) If you must delegate an important matter, make certain the person has the ability to carry it off. A bad selection will be costly for all involved. Leo (July 23-Aug. 22) Partnerships are usually your specialty, but today you might be too intent upon having your way. Rather than reveal this flaw, go it alone. Virgo (Aug. 23-Sept. 22) The row to hoe may be littered with obstacles. Unfortunately, the job is yours because you put most of the impediments in place. Libra (Sept. 23-Oct. 23) Self-centered individuals will annoy you more than usual. If one is encountered, give him or her a wide berth. Don't react improperly. Scorpio (Oct. 24-Nov. 22) A good way to ruin your day is to introduce emotionally charged issues into family affairs everyone will be forced to take oppos- ing positions. - ~ - - - 0 ~- f am ftm a .m - "Copyrighted Material 14 Ifo hoep0* =on w 0 *woo fo Today 'sMOVIES i- ** ,ty9~ 96L S*' w. e I A - 0 4 o S . ,., ."-'-.- | CITRUS COUNTY (FL) CHRONICLE COMICS MONDAY. DECEMBER 5. 2005 7B 0 4ft 4 a. . IV 6 - I tA 8B MONDAY, DECEMBER 5, 2005 Ie ...................550 $151 -$400..............$1050 $401 800............550 '801 1,500.......... *2050 Restrictions apply. Offer applies to private parties only. - I All ads require prepayment. VISA.CAL OICS02-6 HL ANTD15-6 IANCAL 3-11SEVCE 0126ANIALS 00415MOIL5HO ESF RET R AL50 54 RAL SATEFRRN 5560RAL SATEFO ALE715 ACANT ROPRT 81-89 TANSPORATIN 0493 "Copyrighted Material 1 Syndicated Content Available from Commercial News Providers" WIWF, 60, new to area, likes crafts, theater, books, oldies, movies and travel. Wants to learn golf & ball room dancing, In search Of male or female singles to go places to do things and share wwwado interest with.Reply to rescued aet.com Citrus County Chronicle 1624 N. Meadowcrest Requested donations Blvd. Blind Box 914 are tax deductible Crystal River, Fl 34429 Pet Adoption WORKING MAN, FriDa 9 50 yrs old, Black, Friday, ec. - looking for wife. 10am-2pm Race unimportant. AmSouth Bank, Beverly Hills Rt 44 & 486 1-310-989-1473 Crystal River ,:"UFUe Young Calico mom & c r= fnfef r2 kittens 628-4200 Variety of ages and color FREE SERVICEs 746-6186 Cars/Trucks/Metal Grey/Orange F mos Removed FREE. No title 249-1029G OK 352-476-4392 Andy Persian Cream M 2yrs; Tax Deductible Receit Siamese 8yrs F declawed 527-9050 5 Kittens. Utter Trained. Long Furred Litter Great for Xmas. Couch mates M&F lyr also. (352) 621-0141 586-6380 18 mo. old Siamese Dg Female Cat. Spade & Catahoula leopard declawed Free Mix young adult F (352) 726-6261 527-9050 Border Collie / Cock- er mix F medium size CAT ADOPTIONS 8mos; Husky F young adult 249-1029 Catahoula leopard Kerr F 21/2 yrs only pet fenced yard 795-1957 Schipperkes M lyr 726-4348 Adoptive homes available for small l..=. P. m Ho.. A-. A,, dogs & puppies. Wanted poodles & CAT ADOPTIONS small dogs suitable for seniors 527-9050 or There will be kitties 341-2436 ready all days of the week but All pets are spayed / Sunday & Monday, neutered, cats tested Come find your new for leu(remia/aids, best friend, dogs are tested for Some of the cats are heart worm and all older and were shots are current, rescued from abuse. Come see the Cats 4 Kitties C= o Tin Tuesday thru Saturday at the Manchester "tE Clinic on 44 in Crystal HOLIDAY SPECIAL 9 River. 2 blocks west of KEYWEST Jumbo Shrimo the Key Center.. 13-15ct.$5b; 16-20ct Look for the white $4.501b. 352-795-4770 building with the paw prints. We will have a joined adoption with I WY Home at Last on December 17, 2005 CANOE BLUE MISSING FROM MY 352-563-2370 DOCK dn the Withlacoochee, 16', sq. aft. REWARD. COMMUNITY SERVICE (352) 489-9424 The Path Shelter is LOST OLD AFRICAN available for people GREY PARROT, male, 1 who need to serve foot missing. Grandma's their community companion. Inverness service. area. Reward (352) 527-6500 or (305) 812-2506 cell (352) 746-9084 Leave Message LOST Shelty, Bilk. & Wht. (Sm. Collie) in Equestri- an Area of Pineridge FREE GROUP answers to name of COUNSELING Tara, large reward Depression/ Anxiety (352) 586-8589, Cell (352) 637-3196 or (352) 746-0024 628-3831 Small Shih tzu Fe ho MLost Vicinity of Brian St. Free horse. Mustang 2 Inverness, female, grey yr. old. unbroke colt to sweater, micro- approved home only. chipped, Dolly (352) 382-5547 (352) 726-1967 Free Male 4 mo. old grey, long haired kitten. All shots.(352) 628-3904 FREE REMOVAL OF CAT FOUND Mowers, motorcycles, Med. Size blk. & wht. Cars. ATV's, jet ski's, Vicinity Kensington 3 wheelers, 628-2084 Estates area. (352) 344-5364 KITTENS PURRFECT PETS Found Male Dog spayed, neutered, 1/4 mile south on old ready for permanent Floral City Road, loving homes. Available Dalmatian type dog. at Elleen's Foster Care Call Animal Control (352) 341-4125 352-726-7660 (2 sets) 2006 BUCSH & DAYTONA 500 TICKETS $312 for all (352) 794-7436 MR CIfTRUSCOUW t A ALAN NUSSO BROKER Associate Real Estate Sales Exit Realty Leaders (352) 422-6956 *CHRONICLE. INV. OFFICE 106 W. MAIN ST. Courthouse Sq. next to Angelo's Pizzeria Mon-Fri 8:30a-5p Closed for Lunch 2pm-3pm Membership to Rainbow Springs River Club. 12 years remaining. $350.00 (352) 489-7449 REAL ESTATE CAREER Sales Lic. Class $249. Start 1/10/06 CITRUS REAL ESTATE SCHOOL, INC. (352)795-0060 ATTRACTIVE SWF seeking male companion. Candi, 352-628-1036 Grapefruit, Navels. Talnalrte l -nmline Cb * HOLIDAY SPECIAL* KEYWEST Jumbo Shrimop 13-15ct. $51b; 16-20ct $4.501b. 352-795-4770 3 Plots with Vaults & Markers. Memorial Gardens, Beverly Hills. $4500. (828) 586-3299 PRE-SCHOOL TEACHER POSITIONS F/T & P/T. Exp. req. Today's Child. 352-344-9444 Bookkeeper Incl. Receptionist duties., Prof., organized, Peachtree acct. pref. P/R, A/R, A/P. G/L (352) 465-7077 or fax (352) 465-7057 BOOKKEEPER/ SECRETARY Needed Floral City area Comp. exp., good working knowledge of Quick Books, good or- ganizational skills, refer- ences, 20-hrs. wk. Mon thru Fri. Call for inter- view 352-637-0304 BOOKKEEPING ASSISTANT FT & PT Coleman, FL must have exp. w/Excel & bookkeeping. Fax resume: 352-748-6636 JOBS GALORE!!! EMPLOYMENT.NET.. cam Nail Tech 60% Comm. or $50 rental per week, (352) 257-1584 PROFESSIONAL HAIR STYLIST & NAIL TECH For Inverness & Crystal River areas. Most Opulent Salons Contact Georglos (352) 564-0006 JOIN THE TEAM* Family Barber Shop Barber/Cosmetologist (352) 628-2040 COCMGIKOS C IOB0M OF AMMK *MENTAL HEALTH COUNSELOR *DENTIST Call for info at: (352) 527-3332 ext. 1317 M-F 8:30 AM -4:30 PM M/F/VET/HP .EO.E. Drug Free Workplace 3-11 RN/LPN Full time- applu in 7-3 & 3-11 RN/LPN PRN position. Apply In person. a Skilled Facility has openings for: Come Join a Caring Team of Professionals 3-11 RN/LPN Full-time Apply in person Woodland Terrace 124 Norvell Bryant Hwy. Hernando (352) 249-3100 a Skilled Facility has openings for: Come Join a Caring Team of Professionals 7-3 &3-11 RN/LPN PRN Position Apply In person Woodland Terrace 124 Norvell Bryant Hwy. Hernando (352) 249-3100 F/T CERTIFIED PHYSICAL THERAPY Busy orthopedic Mon-Fri. Pleasend Fax Resume: Attent: Manageor (352) 726-7582 FULL TIME MEDICAL ASSISTANT & FULL TIME RN OR LPN Busy office Phlebotomy, Send resume to Inverness, FI. 34452 or Fax 352-726-8193 Your World CHRONICLE Classified A eron.,c.: onllne comr *F/T FRONT DESK RECEPTIONIST/ FILE CLERK Busy OBGYN office. Ex- perience preferred. Fax resume to 352-726-8193 * DIRECTOR OF NURSING * RN * HHA * HMKR * PSYCH NURSE * OT ULTIMATE NURSING CARE A Home Healthcare Agency 1-352-564-0777 EOE LPN'S NEEDED ASAP In Coleman, Fl. Benefits avail. Contact 800-459-5629 EARN AS YOU LEARN CNA Test Prep/CPR Contiuing billing,@ thetapymgmt.com Nurses] i FRONT & BACK OFFICE STAFF NEEDED Fax: (352) 746-2236 NOW HIRING CNA's/HHA's CALL LOVING CARE P/T MAMMOGRAPHY TECH ARRT/Registered. Flexible schedule. - Fax resume to 352-527-1516 Please call Michelle (352) 527-0430 RN's/LPN's NEW VISIT RATES BEST RATES IN TOWN Looking for extra $ for The Holidays? A+ Healthcare Home Health (352) 564-2700 SURREY PLACE OF LECANTO is seeking to fill a limited number of CNA Positions in our PRN Pool We offer: V/ VET ASSISTANT Needed for busy, small animal practice. Exp. in animal re- straint technique required. Position is Fulltime, 40+ hrs. Fax Resume To: (352) 726-1018 -9- Ridge Dr. Lecanto, FL 34461 Or fax resume to 352-527-2235 Drafting/ Design/ M Detailer Structural Steel, PT/FT Clear Span Steel Falrot ,:.3[,.,, .-l:.. : ,- exp a dr arismrn - and/or steel detailer4 "4 for it's Crystal River office. Large govt. J and commercial projects provide interesting challenge. 4% Exc. compensation & % benefits. Send letter of vz background & exp'd . to P.O. Box 130, Crystal River, FL 34423 ' REAL ESTATE CAREER Sales Lic. Class $249. Start 1/10/06 CITRUS REAL ESTATE SCHOOL, INC. (352)795-0060 CHEF For upscale Country Club opening. Must be creative and have good ethic. 4 Fax resume to 352-746-9863. -COOKS High volume environment. Exp. preferred. Positions " available in Inverness COACH'S Pub&Eatery 114 W. Main St., lnv. EOE COOKS NEEDED Scampi's Restaurant (352) 564-2030 DISHWASHER Scampi's Restaurant (352) 564-2030 Exp. Line Cook & Wait Staff Exc. wages. Apply at: CRACKERS BAR & GRILL Crystal River FIRST CLASS LINE COOKS FOR World Class Golf & Country Club. Experienced & Energetic for fast paced modern kitchen under NEW Management. Good $$ and Benefits. Call 422-3941 EOE/DRUG FREE WORKPLACE RESTAURANT MANAGER For new Country Club opening, Exp. in casual and upper casual ala carte dining. Fax resume to 352-746-9863. " SERVERS NEEDED Apply in person. Friendliest restaurant in town. K-*Billon's Inn 589 S E iwy 19 Crystal River SOUS CHEF For new Restaurant, experience. Good attitude. Fax resume to 746-9863 Come Grow With Us! \ it !,,' VV HOSPICE OF CIlUS COUNTY M/F CMH Unit 11-7 M/F CMH Unit PT S/S 12 hour shifts Hospice House FT Time Admissions Nurses PT Admission Nurses FT Continuous Care Patient Care Coordinator LPN's PT S/S 12 hour shifts Hospice House & CMH Unit FT Field Nurse PCA's PT S/S 12 hour shifts CMH Unit CNA & HHA Req. . Social Worker/Grief Services FT Field Staff Admissions Social Worker Social Services Coordinator FT Children's S.W. Grief Specialist MSW or related field req. Chaplain PT Field Staff MS Divinity or related field req. PI/Risk Manager Registered Nurse Nursing Support Team Scheduler PT Team Assistant Weekends PT Truck Driver Begin a rewarding career with us Telephone: 352.527.2020 Fax: 352.5279 CLASSIFIED CITRUS COUNTY (FL) CHRONICLE I MOND)AY, I):(;I:MiHwIR 5, 2005 9B - WAIT STAFF, ENERGETIC for Fast paced. restaurant In World Class Golf & Country Club. Fine dining exp. Preferred. Exc. $$ Call 422-3941 EOE/DFWP AGENTS NEEDED New real estate firm now hiring agents, no franchise fees Crystal Realty (352) 563-5757 REAL ESTATE CAREER Sales Lic. Class $249. Start 1/10/06 CITRUS REAL ESTATE SCHOOL, INC. (352)795-0060 I SALES PEOPLE NEEDED FOR F$$ SELL AVON $$$ NEEDED FOR FjE gift. Earn up to 50% Lawn & Pest four own hrs, be your Control evn boss. Call Jackie I /R 1-866-405-AVON Prefer exp. in the pest control Industry. 'SALES AGENTS' 2 wks paid training, benefits, company S e H e vehicle. , Vor/iea Higr.energv Apply in Person ulgoing real esiole Bray's Pest Control S0les proreszionol for 3447 E Gulf to Lk. Hwy 0 fasi pacea rlEW Inverness F CONSrRUCTIOIJ i CONDO sales in iCrysloi River Week- SALES POSITION S enO work iqauired & LAWN SPRAY Lease fax resumes to TECHNICIANS K 813.920.3604 S oattn: Destllny. Exp. Required w.lfestyleseallors. JD. Smith Pest Control com (352) 726-3921 wag--- Temporary Employees Must have valid driver's license ustbe 18 years ofage Insured dependable auto >, ...'. Yellow Book USA S wants yOU ro help deliver phone book and be. verification operators in the following communitie Crystal River Inverness Homasas a Dunnellon Floral City ; Call: 1-:800-373-3280 monday Thru Friday 7:30 am to 7-00 pm CST r.- LI i"' EOE t Y. 7- -- ' - _ m SALES/ TELEMARKETING $30K + potential 1st yr, Guaranteed salary & commission. Medical & dental. Call Mr. Bishop, 352-726-5600 Musfl CMD INDUSTRIES 352-795-0089 BLOCK MASONS 4 years minimum experience. Must have reliable transportation. Starting at $18 an hour. Call 352-302-9102 or 352-220-9000-Fri DFWP/EOElevlew, Brooksvllle, CARPENTERS/ FRAMERS Exp. only for res. work. (352) 465-3060 CARPET HELPER Exp. preferred. F/T Hard work (352) 400-2354 ELEVATOR CONST. HELPER Construction Helper Needed Employer will train. Full time + benefits. $10/hour. Must be able to lift 50 lbs & have good transportation Weekday travel required. EOE+ DRUG FREE. 352-589-5500 or 800-411-4449 x 298 EXP. CARPENTER & FRAMERS Pay depending on exp. (352) 422-2708 EXP. DUMPTRUCK DRIVER (352) 563-1873 EXPERIENCED SEALCOATING STRIPING, ASPHALT PAVING DUMP TRUCK DRIVERS CDL License TOP PAYI (352) 563-2122 F/T DRIVER Class B CDL. Exp'd dump preferred. (352) 628-0923 FRAMER & HELPER For Inverness Area. (352) 418-2014 contractors.com DRIVERS * IMMEDIATE OPENING 30 + year manufacturing Co. Is looking for qualified drivers w/valld Class "A" CDL and 2 years minimum experience.We offer a competitive benefit package of Medical Insurance, 401K, Paid Vacation & Holiday & Short Term Disability. Apply i onnellon Rd. CR-(488) Dunnellon 746-6825 EOE/DFWP EXP. FRAMERS 352-726-4652 HVAC Service Tech Min, 5 yrs exp with valid D/L Exc, pay & benefits Send resume to: Attn: Personnel PO Box 1127 Homosassa Springs, FL 34447 LABORER Accepting Application for General Construction Laborers. Asphalt paving experience is helpful. Full time employment w/ full benefit package. PAVE- RITE 3411 W. Crigger Ct., Lecanto. 352-621-1600 DFWP/EOE Maintenance PT Apply in person: Mon, Wed, Fri. Inglis Villas 33 Tronou Dr. Inglis Fl 34449 Ph: 352-447-0106 Fax: 352-447-1410 PEST CONTROL SERVICE MANAGER NEEDED Company in search of Individual with experience in Pest Control to supervise people. Must be able to diagnose and solve problems and have experience in pest control. Company vehicle and benefits, All Interviews are strictly confidential. Please apply aof 3447 E Gulf to Lake Hwy, Inverness, Fl. or Fax resume to 352-637-3870 -_I C~A A5 Qult Cae it PrepInc. reeRemva Buke0Tuc ork Trmmng& opin Lo l Orn MR. BILL'S TREE SERVICE No Job Too Big or Small. limbing & removal, hauling. 352-220-4393. R WRIGHT TREE SERVICE, tree removal, stump grind, trim, Ins.& Uc fA TREE SURGEON (352) 527-8253 Uc.&lns. Exp'd friendly serve Lowe ra Free Le estimates,352-860-1452 A WHOLE HAULING & TREE SERVICE Buying a Home, don't 352-697-1421 V/MC/D know where to start? wrw.ataxidermist.com First, second & third, Fm Am.m F m m a1 mortgages. Good & AFFORDABLE, bad credit welcome. I DEPENDABLE, (888) 216-2006 HAULING CLEANUP, M I PROMPT SERVICE I I Trash, Trees, Brush, Appl. Furn, Const; Debris & Garages S352-697- 126ges COMPUTER TECH MEDIC L. m mmmm m ON SITE REPAIRS All Tractor & Truck Work, Software & Hardware Deliver/Spread, Clean issues resolved. Ups, Lot & Tree Clearing Internet Specialists Bush Hog. 302-6955 (352) 628-6688 REAL TREE SURGEONS Cooter Computers, Inc. Quality work, Low rates, Expert Hard/Software Lic&lns. 7830257748 Services. Free Consult. (352) 476-8813 (352) 476-8954 COLEMAN TREE SERVICE Removal & trim, Lie. Ins. FREE EST. Lowest rates guaranteed! 344-1102 = PUain DAVID'S ECONOMY vChris Satchell Painting TREE SERVICE, Removal, & Wallcovering.AII work & trim. Ins. AC 24006. 2 full coats.25 yrs. Exp. 352-637-0681 220-8621 Exc. Ref. Lic#001721/ DOUBLE J STUMP Ins. (352) 795-6533 GRINDING, Mowing, All Phase Construction Hauling,Cleanup, Quality painting & re- Mulch, Dirt. 302-8852 pairs. Faux fin. #0255709; D's Landscape & Expert 352-586-1026 637-3632 Tree Svce Personalized CHEAP/CHEAP/CHEAP design. Cleanups & DP Pressure Cleaning Bobcat work. Fill/rock & & Painting. Licensed & Sod: 352-563-0272. Insured. 637-3765 Dwayne Parlier's Tree George Swedlige Removal. Free estimate Painting- Int./Ext. Satisfaction guaranteed Pressure Cleaning- Free -Lic. (352) 628-6420 est. 794-0400 /628-2245 ; JOHN MILL'S TREE Git' Er' Done Holiday SERV., Trim, top, remove Special Pressure Oc Acct 13732 (352) Washing/Painting. 341-5936 or 302-4942 Free est. (352) 637-5171 PAUL'S TREE INTERIOR/EXTERIOR PAUL'S TREE & ODD JOBS. 30 yrs & CRAIN SERVICE J. Hupchick Uc./ins, Serving All Areas. (352) 726-9998 Trees Topped, MICHAEL DAVIDSON Trimmed, or 20+ yrs. exp. Painting FREE ESTIMATES. contractor/ handyman Ucensed & insured. Uc.3567 (352) 746-7965 ; (352)458-1014 Mike Anderson Painting Int/Ext Painting & Stain- ing, Pressure Washing '" also. Call a profession- ^"'Q~t 01 al, Mike (352) 628-7277 Obur world first. Evenr Day PAik Mk.. SIS. CITIZEN DISCOUNT gLtl aa, With This Ad. Free Estimates. I Sinks Tubs Showers Toilets Sewer & Drain Cleaning AIr CIEAR SPlumbing & Drain Oleaning CFC1426746 552-586-2210 I 9 5 I Unique Effects-Painting, In Bus. since 2000, Interior/Exterior 17210224487 One Call ,To Coat It All 352-344-9053 ' Wall &'Cellig-Repofr-"s - Drywall, Textunring, Painting, Vinyl. Tile work. 30 yrs, exp. 344-1952 CBC058263 Afroraaole Boat Maim. & Repair, Mechanical, - Electrical, Custom Rig. John (352) 746-4521 QUALITY OUTBOARD REPAIRS, Full & dock side serVice. Morrill Marine (352) 628-3331 DJ SPECIAL EVENTS Private parties ONLY. 'Theme" shows. CALL. Lights, Camera, ActionI SLet the Good Times (Rock) & Roll! 352.427.6069_ 1 PROF. CHA/HHA Renders in home medical care, 18-yr. exp. Lic. 352-601-2717 Open 24/7 since 1994. Christian Home, Uc., CDS accepted. Excel. ref. (352) 465-2272 VChris Satchell Painting & Wallcovering.AIl work 2 full coats.25 yrs. Exp. Exc. Ref. Lic#001721/ Ins. (352) 795-6533 *No Job too Big or too Small. Housecleaning to yardwork, anything in between. Llc#4074 352-257-2096 A CLEAN HOUSE I: ..r..3I o' :',,- e- p. (352) 228-1810 local cell CLEANING. Reliable, affordable, Weekly, bi-weekly, monthly Joy, 352-601-2785.cell Dalley LET ME CLEAN Your house, the way I clean minel Reasonable Rates (352) 795-3989 POOL BOY SERVICES Pressure Cleaning, Pool start-ups & Weekly cleaning. 352-464-3967 The Window Man Free Est., Com./resldential, SScr' Richle's Pressure Cleaning Service Lie # 99990001664. Call 746-7823 for Free Est. AAA HOME REPAIRS Maint & repair prob- lems Swimming Pool Rescreen99990000162 352-746-7395 AFFORDABLE, _ DEPENDABLE HAULING CLEANUP. PROMPT SERVICE I Trash, Trees, Brush, | Appl. Furn, Const, Debris & Garages -- GOT STUFF? You Call We Haul CONSIDER IT DONEI Movlng,Cleanouts. & Handyman Service LUc. 99990000665 GOT STUFF? You Call We Haul CONSIDER IT DONE/Ins. (352) 628-4282 Visa/MC No Job too Big or too Small. Housecleaning to yardwork, anything in between. Lic#4074 352-257-2096 Richie's Pressure Cleaning-Service Lie #, DEPENDABLE, HAULING CLEANUP, I PROMPT SERVICE I Trash, Trees. Brush, Appl. Furn, Const, Debris & Garages | 352-697-1126 --- - il We're M td# t,,ited ify your u i 4, ,t= ~.i~\. 352-628-7519 Siding, Soffit & Fascia. Skirting. Roofovers. Carports, Screen Rooms. Decks, Windows, Doors, Additions Fencina. Driveway Sealing & Staining. 2 coats. Reas. prices. Call Roger (352)382-7831 CONCRETE WORK. SIDEWALKS, patios, driveways, slabs. Free estimates. Lic. #2000 Ins, 795-4798. RIP RAP SEAWALLS & CONCRETE WORK Lic#2699 & Insured. (352)795-7085/302-0206 r AFFORDABLE DEPENDABLE, HAULING CLEANUP, I PROMPT SERVICE I Trash, Trees, Brush, * Appl. Furn, Const, SDebris & Garages | S 352-697-1126 DUKE & DUKE, INC. Remodeling additions Lie. # CGC058923 Insured. 341-2675 Wall & Ceiling Repairs Drywall, Texturing, Painting, Vinyl Tile work. 30 yrs. exp. 344-1952 CBC058263 CERAMIC TILE INSTALLER. Bathroom remodeling, handicap bathrooms, Lic/Ins. #2441 795-7241 CUTTING EDGE Ceramic T H I : i-Z .i i 3. . lns.(352)302-7096 FILL, ROCK, CLAY, ETC. All types of Dirt Service Call Mike 352-564-1411 Mobile 239-470-0572 FLIPS TRUCK & TRACTOR, Landclearing, Truck & Tractor work. House Pads, Rock, Sand, Clay, Mulch & Topsoil. You Need It, I'll Get It! (352) 382-2253 Cell (352) 458-1023 HAULING All Aspects, Fill Dirt, Rock, Mulch, etc. Lic. Ins. (352) 341-0747 LARRY'S TRACTOR SERVICE Finish grading & bush hogging (352) 302-3523 (352) 628-3924 r AFFORDABLE, DEPENDABLE, | HAULING CLEANUP, PROMPT SERVICE STrash, Trees, Brush, Appl. Furn, Const, Debris & Garages | 352-697-1126 L- mmmmm WHAT'S MISSING? Your ad! Don't miss out! Call for more information. 563-3209 All Tractor & Truck Work, Deliver/Spread. Clean Ups, Lot & Tree Clearing Bush Hog. 302-6955 CITRUS BOBCAT LTD Bushhog/Debris removal Lic.#3081 464-2701/563-1049 DAN'S BUSHHOGGING Pastures, Vacant Lots, Garden Rota Tilling Lie. & Ins. 352- 303-4679 HAMM'S BUSHHOG SERVICE. Pasture Mowing, lots, acreage. Licensed & Insured (352) 400-5, lie. -24715 (352) 628-0690 PRO-SCAPES Complete lawn service. Spend time with your Family, nc o your lawn. Irc./lns (352) 613-0528 AFFORDABLE, DEPENDABLE, I HAULING CLEANUP, PROMPT SERVICE I Trash, Irees, Blush, Appl. Furn, Const, Debris & Garages 352-697-1126 ALL THINGS GREEN Complete Lawn service Gutters, Best ratso avail. (352) 795-9364 Bill's Landscaping & Complete Lawn Service Mulch, Planis, Shrubs, Sod, Clean Ups, Irees Free esl. (352) 628-4258 DOUBLE J STUMP GRINDING, Mowing, Hauling,Cleanup, Mulch, Dirt. 302-8852 MARK'S LAWN CARE Trimming, landscaping Pressure sVashing (352) 794-4112 EML POOLS Pool clean ( , . (352) 637-1904 MAVEN Pool Maint. NEW LOWER WINTER RATES! Wkly. chemical & full service avail, Lic. (352)-726-1674 POOL'BOE SERVICES/ SPressardCleaning;`'' Pool stdkljo!b& Eit. (352) 563-1911 Get Your Water Tested By A Dept. of Envir. Protection Lic. Drinking Water Operator. Get A Professional Not A Sales Person! We Get It Right The First Time! PURE SYSTEMS WATER TECH, (352) 228-2200 DEP. Lie #0010008 WATER PUMP SERVICE & Repairs on all makes & models. Lie. Anytime, 344-2556, Richard + YUCKY WATER?+ We Will Fix It! 90 Yr Exp. Affordable Solutions to all your water problems. 866-314-YUCK (9825) 'MR CITRUS COUNTYr ALAN NUSSO BROKER Associate Real Estate Sales Exit Realty Leaders (352) 422-6956 RAINDANCER Seamic ; Gutters, Soffit a scia, Siding, Free Est. Ic & Ins 352-860-0714 ' Renew Any Existing Concrete! DESIGNS COLORS PATTERNS Lic /Ins. 352.527-9247 "Copyrighted Material I v Syndicated Content N o Available from Commercial News Providers" I 4 IAl ', INFORATIO FULL TIME PAINTER To Paint Telephones using automotive type paint equipment, 352-465-0503, Iv. msg. MARINE FORKLIFT OPERATOR Fulltime position. Prior marine forklift exp req'd. Competitive pay w/benefit pkg. Apply in person Riverhaven Marina, 5296 S. Riverview Cir. Homosassa 628-5545 CITRUS COUNTY (FL) CHRONICLE EXP. PAINTERS Wanted. Lonny Snipes Painting, Cell, 400-0501 PLASTERERS & LABORERS Must have transportation. 352-344-1748 r "XPHPLUMBER & SERVICE PLUMBERS I Starting Wage between $16-18/hr. Benefits, Health, I Holidays & Paid Vacation. 621-7705 L I I I MASON TENDERS & LABORERS Transportation a rnusl. AllGondrs WWqcorne. 352-628-0035 MECHANICS & TIRE/LUBE TECHS Trucking Comfpany Colemran, B lovie1./, Brooksville Call HR at 1-800-725-3482 MILL HAND 2nd shift machinist w/exp. with conventional horiz. milling machines. Call Tim at 795-1163 CLASSIFIED 7 -: .. ihp [fkills^ PLUMBINGT^Lt^^^ .1 I, I 3.oB M ., DCEMBER 5, 200'_ PLUMBERS HELPER Needed, will train. Must have good driver's license. Apply In person, Grant Plumbing 4424 E Arlington St. Inverness, 726-0816 PLUMBERS' HELPERS Exp'd only. Full time. 621-7705 Plywood Sheeters & Laborers Needed in Duhnellon area. (352) 266-6940 PRODUCTION/ MECHANIC Great Southern Wood Preservingilnc., Is seeking a goal oriented, dependable, safety conscious person to become part of our team. Individuals would d some mechanical background & be willing to work the 2nd and/or the 3rd shift. We offer competitive. wages, healthcare a & 401K. Please apply in person at: 194 CR 527A Lake Panasoffkee, Fl133538 Or call Sean 0 Dell (352) 793-9410 Drug Free Work Place EOE SERVICE TECHNICIAN Full Time Service Position available for qualified Individual w/ expanding accredited water treatment facility.. Must have clean driving record.. Ought plumbing duties are required. We area drug'free work place w/ competitive earnings. Please fax resume to (352) 621-0355 or call Bob (352) 621-0403 SUB CONTRACTOR .Needed for all phases of Restoration. Must be licensed & insured 746-4878 or fax resume to 746-4128 TILE INSTALLER Experienced only West Coast Flooring 352-564-2772 TRACTOR BUSH HOG OPERATOR With 1 yr exp. Salary Negotiable. (352) 795-2976 WANTED INDEPENJE.ENT CARRIERS ate ofj FJ.- ;SC,AI.l Steady runs. Contact Terry at Greenbush Logistics 1-800-868-9410 BUDDY'S HOME FURNISHINGS Is currently seeking a Delivery Driver/ Account Manager Trainee. Must have clean Class D license, Good people skills. (352) 344-0050 or Apply in person at 1534 N. Hwy. 41, Inverness. EOEDFWP IST QUALITY CLEANING FT/PT Floor Tech, hard surface & carpet: PT General Cleaning. Great Pay & Incentive Program. 352-563-0937 CbL-DRIVER Class A, B or C w/ passenger endorsement, P/T 20hrs week. Nursing exp. helpful Apply at: Barrington Place 2341 W. Norvell Bryant Lecanto, Fl COOK i -. Full time. Good organizational Skills a must. Apply at: Barrington Place 2341 W. Norvell Bryant Lecanto, Fl Ask for Pat DELI CLERK Fullime & Part-time Experienced only! Busy Workplace Apply between 2-4 pm, Mon-Sat. Ferrara's Deli 3927 N. Lecanto Hwy. Beverly Hills, FL (352) 746-3354 Dishwasher & Front Desk Auditor Now Hiring. Apply in person. Bella Oasis 4076 S. Suncoast Blvd. Homosassa Immediate Openings -Available for: S"SERVERS *BUSERS 352382-5994 Ask for Zach. Driver & Laborer Both positions are Part time or Full Time. Driver needs Class A CDL with clean license. DFWP Apply in person: Inter-County Recycling St. Rd. 44 Lecanto Exp. Seamstress (352) 302-5707 Full-tim Floor Tec. Must be exp. in all phases of floor care. Apply at LABORERS NEEDED No exp. necessary Benefits offered. Valid Drivers Uc. & Heavy Lifting Required Gardners Concrete 8030 Homosassa Tri. - LAND SURVEYING CADD TECH Benefits, Include Ins. & Retirement Plan. Inverness area Reply Blind Box 916-P c/o Citrus County Chronicle, 106 W. Main St., Inverness, FL 34450 LAWN CREW Immediate Openings Experienced in all phases of lawn & landscape work. Call between 4 & 8 PM (352) 621-3509 Mai tenance Person Various maintenance work & roofing. Must have own tools & transportation. I PLASTERERST I *LABORERS* I NEEDED* 746-5951 ---... ...- J Production Workers Wildwood Manuf. Co, looking for Production/ machine operators for 2nd & 3rd shift. Drug screening, good pay/ benefits, Call (352) 330-2213 JOBS GALORE!!! EMPLOYMENT.NET SALES POSITION & LAWN SPRAY TECHNICIANS Exp. Required J.D. Smith Pest Control (352) 726-3921 CHIkONiLE letter to: HR@ chronicleonline.com Seeking Honest Dependable Career orientated Person for FT Position. Heavy lifting, Driving, Cash Handling & Sales. Please call (352) 564-0700 WE BUY HOUSES Ca$h........ Fast ! 352-637-2973 I homesold.com Laborer/Helper Assist w/ driveway sealing. $8.00/hr. to start Approx. 25/hr. Call (352) 628-1313 ADVERTISING NOTICE: This newspaper does not knowingly accept ads that are not bonat the sn coms up aIOX20 TED'S SHED LEADAID potsoii hmot T e.HS 8FT WALLS, INSULATED diplomarequiredexp. .-fexbl. -DRYWALL, 3/4 FLOOR, positions wih *. gwt w.o andELECT, AIR deeomnalC.CvCOND.NEVER USED JANITOR: -.Ceia h$3500/0B30302-8624 10X12 WOOD COOKS TeSHED, work bench & shelves, $2,150 (352) 795-2181 84' x 40' Metal Cargo 18 5, *Storage Unit. You must move it. $500. (352) 628-0036 CLASSIFIED LOST TREASURED TRAIN SET in house fire, need one for under Christmas Tree. Can you help? 352-697-5252 4x6 Hot Tub. Excel. Cond. 110V, $950. (352) 563-1421 HOTTUB SPA, 5-PERSON 24 Jets, redwood cabinet. Warranty, must move, $1495. 352-286-5647 POOL FILTER, Sta-rite Cartridge type, 2 yrs. old, extra filter car- tridge, handles up to 15,000 gal. $200. (352) 344-2246 SPA W/ Therapy Jets. 110 volt, water fall, never used $1850. (352) 597-3140 Spal, Hottubl 4-5 person Deluxe model. Thera- peutic. Full warr. Sac. $1,650. 352-346-1711 SPA, 5 PERSON, Never used. Warranty. Retil S4on 00.Sarifie 3U" BEIlet E S OUVE ,black ceramic top & door, self cleaning oven, like new, $225 (352) 465-5408, Scratch Dent. Warr. Washers, dryers, stoves, refrig. etc. Serv Buy/ Sell 352-220-6047 APPLIANCE CENTER Used Refrigerators, Stoves, Washers, Dryers. NEW AND USED PARTS Dryer Vent Cleanina Visa, M/C., A/E. Checks 352-795-8882 DISHWASHER Exc. cond. $65. (352) 465-6861 DISHWASHER, Maytag, brand new in box, Retails, $397, Sell for $235 firm. (352) 637-3996 Electric Clothes dryer, $75. Elec. Stove, $75. (352) 637-5171 Kenmore Washer & GE Dryer, both HD & electric. $125/obo both. Call after 6 p.m. (352) 795-3957 KENMORE WASHER & DRYER $100/pair (352) 794-7436 Maytag, Washer & Dryer Washer rebuilt, $400. (352) 270-3274 Refrigerator, Frost Free, 4 yrs. old, $125. (352) 628-3829 Washer & Dryer. Excel. Cond. $250.00 OBO for both. (352) 222-2244 WHIRLPOOL ELECTRIC DRYER, $100 (352) 257-1355 WHIRLPOOL WASHER & DRYER $100 for both (352) 860-2015 after 3pm White Whirlpool Dryer. Works great. 8 yrs. old. $70. Free delivery. After 10am(352)341-3543 Light Oak Desk Ensemble with IBM computer, excel. cond. $125. (352) 563-0022 "BENCHTOP" 117 pc. TOOL SET, 1/43r POWER TOOLS Delta 10" table saw, less than 2 yrs. old. Rarely used, $275. DRILLPRESS GMC 5 spd, lyr. old, used 2x, $75; Air pow- ered Brad nailer, lyr. old, never used, $60' All for $395 firm. (352) 344-2246 LUMBER 271 board feet, live oak, $300. 590 board feetryellow pine, $350 (352) 795-0122 ROOF SHINGLES Never used. 208 GAF 20-yr. Golden cedar, 7.9+ bundles, 2.67 squares $100 (352) 795-1986 SEARS FLOOR KIT for 8x8, 8x10 or 9x10 metal shed, never used, $25 (352) 465-6619 $95 PENTIUM II Computer 17" monitor, keyboard, mouse, CD incl. $130 w/computer desk. (352) 746-9394 Cooter Computers, Inc. Expert Hard/Software Services. Free Consult. (352) 476-8954 DIESTLER COMPUTERS Internet service. New & Used systems, parts. & upgrades. Visa/ MCard 637-5469 HP 8576C Pentium 3 w/ extra ram. CD writer plus DVD, 3 USB ports, Polk Audio spkrs. $150. New 17" HP Monitor $100. (352) 302-4006 HP PRINTER (Ink Jet) 840, extra black cartridge, $25 (352) 860-2015 after 3pm IBM T-23 Notebook. $435, (352) 637-4868 Laptops, Pentium $100. Pentium II $150 (352) 795-2820 LINCOLN ELECTRIC WELDING MACHINE Arc & tig w/gas, 275amp, lots of extras. $995, (352) 527-0223 Porch furn. Couch, 2 armchairs & Cushions, $125; Gd. cond. (352) 637-1161 2 Chairs, (1 blue swivel & 1 wine colored reclner) 5 piece Living Room set. Rooms to Go, Microfiber, creme colored. $600. OBO (352) 222-2244 7 Pc. all Wood bedroom set, no mattress or spring, $500. obo (352) 628-3829 7 piece Lazy Boy living room set. Queen Sipr,, Loveseat & 2 rocker re- cliners. Oak Coffee & end tables included. Like new. $1250. (352) 854-8142 3-pc WHITE NAUGAHYDE corner sectional w/2 recliners, $500 (352) 860-0976 3-PC. SECTIONAL SOFA Contemporary, ivory & beige w/3-pc. brass & glass coffee & end tables, $350 obo Corner Computer Desk, $50 obo (352) 746-7653 "MR CITRUSCOUNN" ALAN NUSSO BROKER Associate Real Estate Sales Exit Realty Leaders (352) 422-6956 BEDROOM Poinf CURIO CABINET, oak, 32x15x36 high, $110 TRIPLE BEVELLED MIRROR 36x24, 8 sided, $50 (352) 344-8720 Dining Rm. Table w/ 6 high back chairs. $125. Lg. comfortable Sofa, floral print. $75. ' (352) 425-4522 Dining Room Set, Oak table, 6 chairs, China Cabinet. $225. OBO (352) 746-7372 Dining Room Table w/ 4 chairs. Glass top, antique creme finish. $400.0BO0 Wrought Iron 3 piece sectional w/ matching chair. $100. (352) 726-5085 DR TRESTLE TABLE W/6 Upholstered chairs, $600 LG. LIBRARY TABLE, $120. (352) 382-2086 Floral Sofa Sleeper, full sz., 68", like new $275. Gate leg Table $300. excel, cond. (352) Like new Loveseat & Sofa Off White Floral Design. $150, (352) 726-3477 Living Room Leather Sofa & Love Seat, blush, like new Org. $1900. Asking $399. (352) 726-8204 LIVING ROOM SET, 6 pieces, all black, $500. (352) 637-9208 Living Room Set, 3 pieces: Sofa, Love Seat & chair, $150. Dining Room Set, whicker w/ 6 chairs, glass top$125. (352) 795-4027 LR Set. Sofa & Loveseat, Tan Floral pattern, Oak Coffee table & 2 end tables w/ glass top inserts. $225. OBO (352) 746-7372 Mahog. 5pc. Bdrm set, no matt. $600;: 4 Caned DR Chairs,. $120. (352) 382-2086 Maple Round Table & 4 chairs $40. Patio, Table chairs & Umbrella $30 (352) 563-5244 QUEEN MATTRESS SET Medium firm, Orig, $1500, Asking $300 Exc. Condition (352) 344-1093 CITRUS COUNTY (FL) CHRONIC Recliner Couch, earth tone colors, good shape. $125. (352) 637-4868 RECLINER, Lane, beigh, good cond, $85. (352) 489-9041 Rocker, Reclilner, Sel, incl. 4 chairs. Matching lighted China Cabinet. Excel. Cond. $850. (352) 527-0837 leave mess. Single bed, Incl. Sealy Ortho Matt, box sprg. frame, & bedding. Like new - perfect cond. $150. (352) 344-4508 SM. CHERRY BOOKCASE $90; LR OCCAS. TABLES $200; (352) 382-2086 Sofa & Chair w/2 tables, Dining table w/4 chairs, China hutch, Wood country design, $250/obo all. Gd. Cond. (352) 860-1426 Sofa & Loveseat Traditional, pink/grn. floral pattern, exc. cond. $500 set. (352) 527-8090 Sofa, excel cond. color is brown. Like new. $75 (352) 746-6406 Washed Oak China Closet in excel. cond. 78" high x 51" wide. $300. (352) 344-8372 Brand new tractor w/ bucket, bushhog & lift. Custom built 20' tri. SEARS RIDING MOWER 15.5 Kohler engine, 42" cut, $450 (352) 795-2181 CITRUS HILLS Moving Sale, Furniture Appl.'s, HD TV, & Misc. 1572 E. Pacific Lane (352) 341-0932! Blue Moon Resale At Kingsbay Plaza (Behind Little Caesar's) (352) 795-2218 BURN BARRELS * $10 Each Call Mon-Fri 8-5 860-2545 2 ELECTRIC FANS Holmes, 6 $10 each SKILL SAW, 7". $20 (352)341-1857 2 Trailer Loads of Misc items plus trailer & Marine equipment. Great for Market, Only $350. (352) 628-5222 3 wheel motor scooter. 49cc, gas, 2 cycle, auto., $950. (352) 637-4868 coo Antique Cast Iron Palor Stove, usable $600. Old Steamer Trunk, redone, $200. (352) 621-0308 CAKE SUPPLIES, pans & accessories, too much to list. $1,200 obo (352) 422-7417 Canoe Ranger 2 person, inflatable w/ outer hull. $250. Screen room, 10' x 12' pop-up $100. (352) 860-0193 Canoe, 15', flat back, Camo Color w/ 15hp CHILD'S SWING SET You remove $50 (352) 341-2929 Christmas 7'/ ft. artificial pre lit tree, 775 triple cluster clear lights, 1500 tips, used once paid $500. asking $100.obo (352) 270-3180 Christmas Decorations. 3' Ughted. /2 HP Garage Door opener, It works, pay for ad $6.50 (352) 527-2419 COMPUTER DESK, $35. Electric Blower, $25. (352) 465-1262 David Bramblett (352) 302-0448 Ust mattress pad, queensize, like new cond. $60 (352) 465-6619 e HOLIDAY SPECIAL e KEYWEST Jumbo Shrimo 13-15ct. $51b; 16-20ct $4.501b. 352-795-4770 Ferret Cage, Ig. on wheels. $75.OBO (352) 628-5694 Free-Standing Fireplace, white porcelain, LP/Gas/ Wood, incl. ceramic logs & LP Burner (needs work). $500. Firm As Is. 564-2424 After 5pm0 Gas Scooter. 49cc, Air tires, elec, start w/ re- movable seat. Runs great. New $375, Sell 200. (352) 746-2536 GE Electric Range, white, clean & all works. $100. 16" scroll saw on metal stand. $50. (352) 628-1813 Glass Display Case 4.5' long., lighted $100. Marquis Board, free standing/ dbl. sided $250. (352) 302-8673 GENERATOR 3,750 watts, low hrs. oar wheels, $300; (352) 795-0917 Just In time for Xmasl' '"- LARGE KENMORE REFRIGERATOR, almond, freezer on bottom, $125, (352) 341-3668 LAWN CHAIRS, 2 quality,- upholstered recliners,, like new, $60 ea AUTOMOTIVE JACK '- STANDS, (2), $20 ea. (352) 341-1857 Lovely 7V2' Artificial ' Christmas Tree $40; 11 Christmas Village pieces, $100; (352) 527-1453 Lrg Parrot Bird Cage,,- - 6' Tall, $300, Parrot Stand, $125. (352) 746-1597 Marble Top Lab Table-, - for perfect work bench $75. firm 1 Brother Word Processor' $35. (352) 563-0022 PATIO SET PVC, rectangular table, 6 - chairs, chaise lounge, $300 MICROWAVE, $25 (352) 341-1857 PATIO TABLE W/4 CHAIRS, $25; CHEST OF DRAWERS, - $20. SMW (352) 382-3379 ' Queen Size Box Spring.,; & Mattress, like new $80; Oreck Vacuum - Cleaner, $50 (352) 746-2853 Queen Size Crdftmatic- - Adj. Bed $200., , lognrJn', pal't :pr'a, r u:-'3 :.rl :. I IIJil (352) 563-0202 - Radio Controlled Airplanes. Please call 795-2747 after 9am for more information. ROUND MIRROR, 24", hanging, $20. - (352)613-2172 SEWING MACHINE $50. ROCKER RECLINER,--): Nice, $30. (352) 628-5472 SINGLE CRYPT Fero Memorial Gardens 1st Level Incl. O/C. Re-., tail $8,700. Will Sell For*,i $5,500 (352)489-0285,: &i SOD. ALL TYPES : Installed and delivery"' available.352-302-3363 SUPER NINTENDO & 21 Games, $70 .. 3 Wheel Bike, w/basket, $70/obo . (352) 637-2735 White China, 8 place setting, trimmed in. gold, Includgp8 pcesetof gold- hdwea, dso gold gold candecenterpiece,goldd white table clothe, $50i:,. (352) 527-1493 after- -. 6pm p,- Custom Hot Dog Cart Model #525, all stainless steel $2,500. & (352) 228-1650 , GMC 1984, $S15, Sierra Classic, Rebuilt motor, Fiber- glass topper bed liner $3,200. (352) 228-1650 ELECTRIC HOSPI- ' TAL BED i. Electric hospital bed $400 OBO 228-7730 INVACARE WHEELCHAIR & FOOT REST % Excellent, $100 .. _, (352) 563-1370 ' JAZZY 1104 - POWER CHAIR Orig. $3000, Sell $800 (352) 726-7405 RECLINER LIFT CHAIR Dk green, exc. cond, - $125; (352) 795-3620 - BALDWIN DUET ORGAN- - double keyboard, foot.' pedal, sell for $500/obo.0 (352)344-2712 "- * BRAND SPANKIN' NEW--, BABY GRAND PIANO Absolutely gorgeous! Black Kawai Baby Grand. Trans 10yr warranty! -- $9,999. _ 352-464-2644 - Crate PA System - With speaker cabinets. $500; Tenor Banjo, $400 (352) 422-2187 Fender Elec. Guitar $200: Epiphone " Accoustic Electric, -', $100. - (352) 422-2187 OmnI 6000 Wurlitzer Organ, keyboard computer, $3000 (352) 382-4539 - Peavey, Electric Guitar. with squire amp, like new $165. both - (352) 527-8471 ~ 0 -* "Copyrighted Material " Syndicated Content - Available from Commercial News Providers" *^ I Full-time position requires working knowledge of Multi-Ad Creator or QuarkXPress & Adobe Photoshop. Produce advertising and editorial pages for newspapers, special products and special sections. Macintosh and PC formats. Application deadline: Dec. 11, 2005 EOE, drug screen required for final applicant. PI.,R iVKii Send resume & cover letter to: .... HR@chronicleonline.com CITRus COUNTY (FL) CHRONICLE gn~iH t. I PIANO Grunell Brothers, ponsole, exc. cond. $1,200 obo (352) 527-3509 PIANO Kawai, upright, ic herrywood $900. OBO.(352) 382-0707 AB Lounge I, (upgrade model)' like new w/video, !$75. (352) 746-1486 HEALTH RIDER, Total body aerobic fitness order w/ manual, New 500 Sell $275 OBO. '(352) 613-2172 iHome Gym System Welder Pro 9628 Jke new. Paid $300. Sell $150. 1(352) 564-0387 FASER PRINTER Brother, hardly used. 2ip'pm black. 2 new ink cartridges. 200.00 OBO 352-564-1668 fock Fitness Pulse gpper w/ excersize 'Pomp. $50..OBO l'(352) 746-2536 TOTAL GYM Tbtal Gym brand new $250 Call Michelle at 637-0556 or 586-1740 TOTAL TRAINER Used 3 times. Same as Total Gym. Paid 300,00 ,sacrifice at 125.00 V, ladies Jeep Comanche Classic, 10-spd., like new, never used, $70 (239) 839-2900 cell Inverness S HOLIDAY SPECIAL KEYWEST Jumbo Shrimp 13-15ct. $51b; 16-20ct $4.501b. 352-795-4770 Full Set of Ladies right handed Golf Club (14) almost new bag, $150 --Call after 5 p.m.. (352) 382-0312 GOLF CART ,New batteries $1,500 (352) 382-4912 GOLF CLUBS Set of right handed ladies golf clubs, w/ brand new dozen balls $d0. Also Ladies right handed clubs, $50. (352) 726-2644 Golf Clubs, bag & pull cart, $75. --- (352) 489-9041 KID'S POLARIS SPORTSMAN 700 2bdtferies excellent " condition,,$275 (352) 637-6588, eves Lady's "Bike" Huffy, L f. Blue, & chrome Many extras $50. (352) 563-5244 Mountain Bikes 2-women's 21 speed, Helmets inc. GT $125 & Giant $75. Both Excel Condition (352) 746-6583 NEW LADIES WARRIOR TOUR GRAPHITE Irons 3 thru Pitching wedge, 1 Warrior driver, titanium, 3 ball putter, titanium. Retail $1200+ Sell $345. 352-746-5789 Ping G5 1 & 3 wood, Ping 3 thru PW, S59 Irons, Ping Bag, $800 (352) 637-1404 Pool Table OLHAUSEN 8' Dark wood, leather pockets. All access. $900. OBO 7(352) 564-9490 POOL TABLE, Gorgeous, 8', 1" Slate, new in crate, $1350. 352-597-3519 S16', Double Axle, giiipment trailer w/ Afamps, $450 OBO 12Stock Trailer, Double Axle, $225. OBO. e-(352) 628-2113 4x8 Flat Bed Trailer, good cond, new tires, $125. S-(352) 726-9647 5x8 OPEN UTILITY TRAILER, S.- $500 (352)341-2929 BX12 FLATBED utility iler, diamond plate br, tandem axle, $250 656 4x8 2ft sides, $150 (352) 628-0950 BUY, SELL, TRADE, PARTS, REPAIRS, CUST. BUILD ,', Hwy 44 & 486 -g Extra Large Dog House, Well made Good cond. (352) 746-1486 Fender, Strat, or Gibson Les Paul, (352) 257-3261 CRailroad keys, 5'. locks, etc., Cash Paid -352) 382-4/86 ...... r- . Dutchman 22' 1998, excel. cond. $6500. (352) 793-2943 J NOTICE Pets for Sale In the State 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. AKP Pomerarian Male 15 mo., $200.0BO 220-6051 leave mess. AKC Yellow LaD Pups OFA Cert., champion blood line, 4F, $850 ea. 1 M, $800. taking depos- its, ready 01/11/06 (352) 302-3866 Beautiful Cockatoo & cage. Brand new. $1000. Yellow Cockatell & Cage. $40. (352) 621-3636 FEMALE QUAKER Parrot, with cage $100 abo (352) 726-3375 Ferret Cage, Ig. on wheels. $75.OBO (352) 628-5694 German Shepard Pups, AKC Reg., Import bloodline. Parent on premises. XLG. bone. Hip Warr. Sable,Tan. 3F, 4M. 16 wks. $400. ea. (352) 465-4642 or 465-5380 Humanitarians of Florida Low Cost Spay & Neuter by Appt. Cat Neutered $20 Cat Spaved $25 Dog Neutered & Saved start at $35 (352) 563-2370 Pitt Bull Puppies parents on premises, $100 each. Call after 3 (352), 746-7159 SHIH TZU 3 mo. old puppy. Has all shots and CKC papers. $450.00 call 352-270-3303 Pony's For Sale Beat the Christmas rush while they last. 6 left. $500 each. (352) 287-9207 (352)447-4017. I BR unfur. $400. up. IBR furn w I This 3/2 Dbl. Wide w/ fireplace. Good cond. Must sell. You move. $10,000. OBO Call Bill (352)726-5131/400-1154 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 Brdnd in your area. Call today. Ready to move into. 352-795-2618 1, 2 & 3 BDRMS. Quiet family park, w/pool, From $400. Inglis. (352) 447-2759 2/1 Mobile w/ large LR addition w/ fireplace, Scr. patio, deck on canal, $90,000. Floral City (352) 212-0066 Over 3,000 Homes and Properties listed at homefront.com . MrnNea10.ean,. $20K Dn. $1,150. Per Mo. Call(352) 302-3126 NICE SINGLEWIDE ON HALF ACRE. 3-4 miles from Homosassa walmart. Call C.R. 464-1136 to see it. $66,600. American Realty & Investments C. R. Bankson, Realtor Bring the Horses, 10 acres, w/ nice 1999, 3/2, DW, 1850 sf, fenced w/ stalls, moti- vated, $245,900.\offer 352-613-0232 FLORAL CITY 1971 Doublewide, 3/2 plus 2 extra rooms. Cent. A/C, carport, $47,000 7991 E. Brooks Lane (352) 560-0019/11/2 on /4ac, completely furn, crprt, scrn rm, picnic deck, shed, septic, well, new roof in '04, was $67,900 reduced to $62,900 neg. (352) 637-0851 For Sale By Owner, Crystal River, 2/1, older DWMH on acre w/ cement block Garage, $59,900. (352) 746-4776 Great Country Setting 3/2 on 2 acres in the Mini Farms. Easy to Qualify. $4,000 down and $560 mo. (352) 795-1272 Great Investment Property. 65'Moblle on 2 lots, Only $35,000. Call Michael @ Florida Realty & Auction (352) 220-0801 HOMOSASSA Nice 2/2 SW, scm prch, crprt. strg. shed, o2ac fenced, $65,000 10%dw Owner. fin. 352-628-3270 Just what you've been looking for. New 4/2 on 5 acres. Zoned for agriculture. Horses Welcome. $6,000 Down $750 mo. ,(352) 795-8822 LAND/HOME 1/2 acre homesle in coun- try setting. 3 bedom, 2%xih 70der wcaan y, eway, appliance package, Must See, $579.68 per month W.A.C. Call 352-621-9183 Lecanto, upgraded DW, 3/2 in desirable Cinnamon Ridge on oversized corner lot, fenced yard, Ig shed. Screened front porch, dbl. carport; fireplace newer roof, apple , carpet, paint. Ask $94,600. (352) 270-3080 Mini Farms, 21/2 AC. 2/1 MH, Pool, Jacuzzi, New 10X16 shed, 2 car garage (352) 563-2328 MOBILE HOME ON LAND WON'T .AST Zero down, $739 mo. 4/2, 2170 sqift, on 1-1/4 acres, Fire- place, new kitchen, new hardwood floors, new carpet, 2 big beautiful decks, Call Jeff, (352) 400-3349 or 814-573-2232 NEW 2005' 3/2 on 1/2 acre off Billows Lane. Financing Available $0 to $11,800 Dn. $700 Per Mo. Call (352) 746-5912 New Land Home Packages, shed, partially fenced, 1.16acres. $129,500. (352) 489-5415 You Can't Beat This one!l Spacious 2003 3/2 manuf. home on 5 acres w/ jacuzzi. Paved road & upgrades. $196,000. (561)262-0947 2001 in WALDEN WOODS, Gated 55+ Community in Homosassa. 3/2 1550 sq. ft. includes some furn. Exc. lot location, $74,000. (352) 382-5514 apple ON LAKE- FULL FURN. scrn. prch. $24,000.OBO Lot rent incl. wtr, garb. sewer, lawn & boat docking, by owner, Pets ok. 352-447-4093 Singing Forest Pk, Floral City, 2/11/2, C/H/A Remodeled inside, large lanai, Furnished, shed, must see $17,500 (352) 746-6410 WESTERN SUMTER CO. 3/2 DW, covered parking, scr porch. Yearly rental. 50+ park, $800mo,lst & 1ImoSec. WynnHaven Riverside Park.(352) 793-4744 . Nice Family Pk w/Pool $205/mo. 6 mo Free rent, Inglis (352) 447-2759 Over 3,000 CRYSTAL RIVER 1 BR condo partially fur- nished boat dock On River House, Travel Trailers & RV spots Big Oaks River Resort (352) 447-5333 Property Management & Investment Group, Inc. Licensed R.E. Broker Travel TProperty & Commt terAssoc. ExceMgmt. second. our owner Assoc. Mgmtaccess. Robbie Andersonrt LCAM, Realtor 352-628-5600 P info@oroperty managment&rouD. coam Crystal Palms Apts L& 2 Bdrm Easy Terms. Crystal River. 564-0882 INVERNESS 1 BR Triplex, on after, Re$375,1st, last, sec.c. Rental Specialists BEVERLY KING Realtor 352-628795-560021 How-95001 Specialist in Property Mngmnt/ Rentals. beverlv.king@ centurv21 V2 Mi. West of Wal-mart 1760sq.ft. Retail Space, (2) 5,000 sq.ft. out par- cels Will Build to Suit! Assurance Group Realty, 352-726-0662 FULL TIME PAY FOR PART TIME WORK!!! Seeking motivated expereinced Sales person for a proven growing company. Please mail resume to Bind Box 915M C/O Citrus County Chronicle 1624 N. Meadowcrest Blvd. Crystal River, FI 34429 CRYSTAL RIVER 1/1, completely furnish- ed waterfront condo on springfed canal w/boat slip. Seasonal rental, $1200 mo. (352) 795-3740 INVERNESS 1/1, Royal Oaks condo, screen rm. clean, $595 FLORAL CITY Duplex, Irg. 2/1, all new, $675 Call Mike, (352) 302-7406 INVERNESS 2/2/1 Whispering Pines pool, W/D, no smok/pets, $715. 746-3944 CRYS RIVER/HOM. 2/1, with W/D hookup, CHA, wtr/garbage incl. $500mo., 1st, Lost & sac. No pets. 352-465-2797 CRYSTAL RIVER Remodeled 2/1. W/D hookup. Water & trash incl. $580/mo. + sec. No pets (352) 228-0525 INVERNESS Neat & clean, 1/1, cent H/A, SR 44-E $495 mo (352) 726-1909 Inverness New 2/2, no smoking & no pets. $750/mo. 1st, last & sec. (352) 341-3562 Lecanto clean, spacious, 2 bdrm/2 ba/ garage/scrn. rm. non-smoking, no pets, 650/mo, 650 dep. avail NOW. 352-422-6548 LECANTO New duplex, 2/2, $625 mo. No pets (352) 249-0848 -r Daily/Weekly Monthly Efficiency a" Seasonal $725-$1800/mo. Maintenance Services Available Assurance Property Management 352-726-0662 $685.A746-3944 HOME FROM $199/MO 4% down, 30 yrs. @5.5% 1-3 bdrm. HUDI Listings 800-749-8124 Ext F012 If you can rent You Can Own Let us show you how. Self- employed, all credit Associate Mortgage Janice Holmes-Ray Property Mgmnt. 352-795-0021 We need units furnished & unfurnished 352-795-0021 NATURE COAST BEVERLY HILLS Beautifully turn.! 750/month. No PETS. Please call Mike at (646)773-6844 Beverly Hills 2/1.5/1 Lease w/purchase option. Fenced yard, nice area. $750/mo. (352) 746-7023 BRENTWOOD AT TERRAVISTA Vacant 3/2,W/D lawn maint/ memerbership CURRENT MO's RENT + $1,100 XTRA FRFF! $1,100/mo short / long term lease (352)726-6528 MONDAY, DECEMBER 5, 2005 11B W condoNillas cmfor Rent I A NEW HOME 3/2/2 Homosassa, $775 River Links Realty 628-1616/800-488-5184 CITRUS HILLS 2/2 Condo Citrus Hills 2/2 Brentwood 3/2 Canterbury 3/2 Pool, Kensington 3/2Laurel Ridge 2/2 Beverly Hills Greenbriar Rentals, Inc. (352) 746-5921 Citrus Hills 1824 E. Monopoly Loop, 3/2/2, Caged pool, $975. (352) 527-7825 CITRUS HILLS 3/2, caged pool, W/D, $1100mo. (352) 746-4821 Citrus Hills 3/2/2 New home on 1 acre. Fenced back yd. 1st, last, sec. $1175./mo (352) 746-5969 CITRUS HILLS Charming 3/2/2, 2300 sq.ft.Beautiful wooded 2V2 ac lot. w/pool,$1195 mo. (561) 306-0246 Citrus Springs New 3/2/2, 2200 sq. ft. W/D, DW, Scrn.m, lanai, great rm., dining, living, garbage & lawn inci, month to month. $1200. (352) 465-2830 CITRUS SPRINGS 2/11/2, carport, very clean, 2050 Howard St. $800. mo 352-746-5969 CRYSTAL RIVER 3/2, Lrg remodeled, W/D hookup, FP, No pets, $800mo + Sec. (352) 228-0525 CRYSTAL RIVER 3-BR, 2-BA, nice, clean, $800 mo 352-795-6299 DUNNELLON 3/2 Fenced, C/H/A, No Pets. $700 Mo. First. Last, Sec (352)489-6975 FLORAL CITY 2/2/2 SCRN. PCH., ADULT COM., NO PETS $790. (352) 344-2500 FOREST RIDGE ESTATES 2/2/2 Villa $825. mo Please Call: (352) 341-3330 For more info. or visit the web at: citrusvillages ient Pool, Spac. 3/2/2, golf course loc., no pets $900/ mo. (908) 322-6529 INVERNESS 2(3)/2/2 1st., Ist. sec. req. (352) 341-0696 or 302-8870 INVERNESS -. 2/2/2, Lake Front, Fl. Rm., FP, scrnm. porch, $950. mo. Gos. Is. Rd. (352) 726-3773 INVERNESS 3/1.5/2 Gospel Island, A/C, tile, W/D, pets ok, $975mo 352-637-3449 INVERNESS 3/2/2, Very nice, city water. $825. mo. .1st, last, sec. No pets. (352) 344-1831 INVERNESS 3/2/2, w/ pool on golf course $1,100. + util. part. turn., lease req. 637-2342 or 726-6027 Inverness Brand new! 3/2/2 No smoking or pets $975. + util.ai, 352-621-0143 3/1'/2, Unfurn House w/ shop. HOMOSASSA $975 mo River Links Realty 628-1616/800-488-5184 CRYSTAL RIVER 1/1 furn., INVERNESS 3/2 Lakefront Townhouse, Washer/Dryer, Pool, Scrn rm. Boat Dock, New carpet/ paint $850mo.352-726-4062 On River House, Travel Trailers & RV spots avail. Short or long term. Excel. cond. on River w/ boat access. Big Oaks River Resort (352)447-5333 $110.wk (352) 628-9267 Citrus Springs 2/2/1 Fully Furn., Includes all utilities, $1500/mo. neg. (352) 465-3944 CRYSTAL RIVER 1/1 furn., w/dock. $700 mo+ util. 1st & Sec. No smoking! 129 Paradise Pt 352-422-6883 o- itrs pi ngs;, --0ome Comp. furn.,priv. wood- ed setting. Utilities incl. No Smoking. 2 wk. min. $300week 352-726-6312 SUGARMILL WOODS 2/2/2 +Lanai, culde sac. turn. Lawn incl. $1500mo. Owner/agent 727- 804-9772 -U INVERNESS 540 SQ.FT. MOL, mobile home, great for storage, $200 mo. (352) 422-1916 cell 4MR CRRUSCOUNTf" $12,00 Lokn forff. Need a mortgage & banks won't help? Self-employed, all credit Issues bankruptcy Ok. Associate Mortgage Call M-F 352-344-0571 Commercial Building 3600 sq. ft. w/additional Commercial Lot. $480,000. Owner Financing available 352-726-0523 Welding Shop w/ Residence 2,200 sq. ft. Commercial Building w/ Turn Key Welding Business, 1,300 sq. ft. 2/2, MH, industrial, Inverness City Limits, $118,000. 352-637-9630 WOMAN'S CIRCUIT TRAINING BUSINESS FOR SALE $35,000 (352) 220-9218 (2) CBS FINISHED DWELLING UNITS. Currently 4 rentals. 2400 liv. area total, 4BR/4BA CH/A, country setting 1-AC mol $250,000 (352) 726-1909 Brokers welcome CLASSIFIED You've Got It! Somebody Wants It! C l' l,,klc -.-, ., U "' ::. -- (352) 563-5966 640980B W. Datura & N. Ocean $176,000. 352-442-2386 'Your Neighborhood REALTOR' RealEstate C c-forSale^ ;L4 call Cindy Bixler REALTOR 352-613-6136 cbixler15@tampa bay .rr.com Craven Realty, Inc. 352-726-1515 2/2/2 + Sm. computer rm & opt. 3rd BR. Totally Custom & Unique Gourmet Kitchen, Fireplace in master, Pond w/waterfall. inground Spa on lanai, Hurricane proof con- struction, priv. 1.4 ac. corner lot, energy effic. home. $339K. Internet; citrusswaoshoo.com Click on buy then ReeL Why Pay More??? No Hidden Fees 20+Yrs. Experience Call & Compare $150+Million SOLDI!! Please Call for Details, Listings & Home Market Analysis RON & KARNA NEIIZ BROKERS/REALTORS CITRUS REALTY GROUP (352)795-0060. CLASSIFIED "Hme 53 BEVERLY HILLS BLVD. Comer Lot Neat 2/1/1 Sunroom, newer appliances & Berber carpet. $97,500 (352) 527-7833 2/1/1, newer carpet, Int. paint, appliances, & bath. C/H/A, Uv. Rm., plus Fam. Rm./3rd Bd. 318 S. Harrison St. $119,900. (3523)946,-6624' .! CITRUS REALTY GROUP 3.9% Listing Full Servlce/MLS Why Pay More??? No Hidden Fees 20+Yrs. Experience Call & compare $150+Million SOLDIIll Please Call for Details, Listings & Home Market Analysis RON & KARNA NEITZ BROKERS/REALTORS CITRUS REALTY GROUP (352)795-0060. For Sale By Owner Lakeside Village Villa $9,9;9, Lovely Sone Ig, bedroom, dining rm., living rm., Den or 2nd guest bedroom. Caet. 55+ Community. Community pool. 3637 N. Longpone Pt. (352) 746-9999 (205) 936-4204 Ookwood Village 3/2/2 pool home, enjoy the trees as green belt Is your back yard, Absolute move in cond, 51965000, (352) 465-9201 OAKWOOD VILLAGE Airy 2/2/1-1/2, oversized lot with level front yard, Fla. rm. leading to 8x16 deck, upgraded apple, & fixtures, new Weather tife windows & window treatment. Partially turn. (352) 746-5307 RENT TO OWN - NO CREDIT CK. 2-3BR's 321-206-9473 visit jademission.com WHY RENT Zero down only $548 mo. Hard to find, 1/1, great neighborhood, (352) 400-3349 or 814-573-2232 Widow Must Selli 2 master suites, Fm. Rm, FP, solar heated pool, 2 car garage, on 1/ acre, asking $189,500. obo Don Crigger Real Estate (352) 746-4056 4 Bed. House + Mobile 5 acres, Hugh oak trees, downtown Lecanto $320.000. owner relo- cated bring all offers. Don Crigger Real Estate (352) 746-4056 2/2/2 FOR SALE BY OWNER Nice, private CBS home 1.2-acre lot near 44/491. New roof well system and boat storage shed. $169K. 352-274-1274. Bonnie Peterson Realtor "PEACE OF MIND" Is what I offer "YOU" (352) 586-6921 Paradise Realty & Investments, Inc. (352) 795-9335 va 0 (21 Brand New 3/2/2 laundry/ screen rm. *(3 Ipl Inv, Highlands: Inside All appliances Included. $188,900. Atkinson Construction, 'Inc. 352-637-4138 CBC059685 BY OWNER RENOVATED 2/1 + Paneled Office, fenced, New Appl., List with Us & Get a Separate gar. Asing. Free Home Warranty & $124,499, 818 Oak St, NtransactIon ees Karen 352-726,0784 (352) 795-0021 352-483-4962 CHARMING 3/2 on ~nt large corner 1/2 acre ~ t !lot with mature oaks, new kitchen appliances C st r.^ & carpet, throughout, Nature Coast Quiet neighborhood., Great Starter Home Don't wait, call Today Won't last long. Offered by Southern Homes & Properties Beautiful 4yr old (877) 809-9329 or Maintenance free (321) 443-1240 home in Citrus Hills. 1900 sq ft of living' CITRUS REALTY GROUP space, 2 bedrooms, den, 2 baths, 2 car gar- 3.9% Listing age. Corian kitchen, many upgrades, on beautiful homesite, Full Service/MLS Golf/tennis member- Why Pay More??? ship avail. In Skyview No Hidden Fees Gated community. No 20+Yrs. Experience Agents Please$337,500 Call & Compare 352-527-6995 for appt. CANTERBURY LAKES $'150+Million SOLDIII CANTERBURY LAKES Please Call for Details, 3/2/2' Listings & Home Nice home in great Market Analysis area. Updated ktch- en,large lanalnew car- RON & KARNA NEITZ pets lots of tile and BROKERS/REALTORS more. $220,000. CITRUS REALTY GROUP (352)637-4844. (352)795-0060. i CITRUSHILLS 'COUNTRYSIDE ESTATES TERRA VISTA Irg 3/2/2+, split level Stunning 4 bed. m, n I "',,r pool home In 1 r . m..n.I. ,, to: (352) 860 0160 .lu .. s (352) 302-8437 1. Citrus Realty Group Cynthia Smith (352) 795-0060 CITRUS REALTY GROUP " 3.9% Listing Full Service/MLS Why Pay More??? No Hidden Fees -20+Yrs. Experience Spotted Dog Call &.Compare Real Estate $150+Mlllion SOLDIII LOVE THE TRAIL? So do II Let me help Please Call for Details, you find the perfect Listings & Home home or lot on or Market Analysis near the trail Call . Cynthia Smith, Realtor RON & KARNA NEITZ Direct (352) 601-2862 BROKERS/REALTORS DoingWhatllove@ CITRUS REALTY GROUP L tampabay.rr.com (352)795-0060. Gospel Island, Ig. 2/2/2, w/ family rm., across from lake in Lockshlre Park. by appt, only $149,900. broker/owner (352) 726-8318 eve. HIGHLANDS SOUTH I-mmac. remodeled, 3/2/2. Ins. Indry, Lg. lot, .? Ready to move in tol $189,900 (352) 527-9268 418 Hiawatha Ave FREE Home HOME FOR SALE FREE Home Warranty On Your Lot, $103,900. Policy when listing 3/2/1 w/ Laundry your house with "The Atkinson Construction Max" R,.Max Simms, 352-637-4138 LLC. GRI, Lic.# CBCO59685 Broker Associate. Lic.# CBCO09685 (352) 527-1655 Inverness Golf & Country Club former Gildd& Crif//ndu Builders Home. 3/2/2 S Great rm, den/poss. IDGMVACL 4th bdrm. eat-In kit, all ]'T 'T'~'a appliances Inci, micro I I Real ttt over glass top stove. wrap-around screen FREE REPORT porch, recent heat & What Repairs Should air, quiet cul-de-sac, You Make Before new ext. paint, You Sell?? $244,900.. (352) 860-0444 Online Email Marilyn Booth, GicRorIcom GRI Or Over The Phone 26 years of 352-795-2441 experience DEBBIE RECTOR HOUSEALLS Realty One homesnow.com -- I 3/2, ALL STONE EXTERIOR and stone fireplace on 1/2 acre. 18x40 caged pool on mile long pond, $275.000 Call Wendy to view the home (352) 476-7631 (352) 400-5054 Call Ann for more info (434) 335-5425 3/2.5/2, Highlands, Ig. rms., 2 lots, excel. location $174,500. (352) 860-2408 3/2/2 HOME COMPLETELY REPAINTED, CBH BUILT IN 1995, VINLY.TILE IN LIVING, DINING, KITCHEN GREAT FOR PETS. $160,000. CALL TROY 352-560-0163 3/2/2 Newly Decorated ,Lot. of jupqr.de, too T 7,rn, .. l.t -, $170,000/obo. (352) 302-0937 CITRUS COUNTY (FL) CHRONiCi 3/2/2 Split, Built '03 S1'/ ac, Extra Drive, Pool ready, fenced, Gospel Island, $274,900 352-860-0759 SELL YOUR HOME! Place a Chronicle Classified ad 6 lines, 30 days $49.50 Call 726-1441 563-5966 Non-Refundable Private Party Only Some lR 'eorrl.c ori r,.,a> appl',) 2/1 POOL HOME dbl lot, fenced back-, yard, Inground caged pool, huge florida room, city water, central A/C. $99.999 352-344-5206 4/2 Mli, Derby Oaks 2300 sq. ft., 1.25 acres,' reduced to $135k. 352-341-0696, 302-8870 * 3/2, w/ pool, 5 acres, 2 story cracker, 1597 sq. ft., 5552 N. Andrl, Shamrock Acres, $289k (352) 563-1147 4/2/2 Near Plantation Golf, Fam, Rm., Lg. Kitchen, Dining Rm., Scrn. Rm., 2667 Sq. Ft. under roof, $196,900. MAMABUNHEE@Yahoo. corn (352) 795-5410 Zoned agriculture. Deborah Infantine CEDAR KEY site, partially cleared, All of this for $250.000. Top Sales Agent 2004 1 wk + bonus wk. 1st offering at $230,000. (352) 621-3826 ALAN NUSSO & 2005. (IAgnv Office Prime time. $1700 obo. Keith 352-249-8205 BROKER EXIT REALTY LEADERS (352) 212-5277 Associate (352) 302-8046 Bring the Horses, Suhill Real Estate Sales 10 acres, w/ nice 1999, Exit Realty Leaders ViM ol3/2, DW, 1850stf, i od(352) 422-6956 Vic McDonald fenced w/ stalls, moti- (352) 637-6200 vated, $245,900.\offer "It's All About YOU I" .................................. CITRUS REALTY GROUP 352-613-0232 CITRUS HILLS 3.9% Listing $67,900 lac Wooded lot S. 352-212-7613 Crawford SFull Service/MLS ,^ .: Why Pay More??? Citrus Springs 10,000 No Hidden Fees sq. ft or 80'x125'. Water, 20+Yrs. Experience elec. & telephone S' ,Call & Compare services already r & Installed. Must Sell! Buyers & Sellers are Realt $150+Million SOLDIII Asking $34,900. smarter than ever. Let Bonnie Peterson My Goal is Satisfied (352) 465-9362 me work WITH you Realtor is Sasfed lease Call for Details for the best deal! "PEACE OF MIND" Customers Listings & Home HOMOSASSA is what I offer Rw0of fe Market Analysis 3 acres high & dry close Meredith Mancini "YOU" REALTY ONE to shopping & river ac- (352) 464-4411 (352) 586-6921 ONE RON & KARNA NEITZ cess 15 minutes to gulf Paradise Realty & Outstanding Agents BROKERS/REALTORS REDUCEDIS $120,000 call Exit Realty Leaders Investments, Inc. OuWtsanding ReiulLs CITRUS REALTY GROUP 352-286-4482 very Crystal River (352) 795-9335 (352) 637-6200 (352)795-0060. motivated to sell w~m8 "It's AllA About L I-" 203//5 usdn 0Bring the Horses, NEAR LAKE ROUSSEAU CRYSTAL RIVER "It's Al About YO 2003 3/2/2.5 plus den 10 acres, w/ nice 1999, BY OWNER 2/1 dbl. lot CAv Condo. 2,162 sq. ft. pool 3/2, DW, 1850 sf, 2 sheds, trailer H.U. 3/2/1, LR, DR deck, home. Open floor fenced w/ stalls, moti- $95,000 plan. Zodiac counter vated, $245,900.\offer (352) 795-6515 great views, deeded tops, tile floors, many 352-613-0232 dock, asking $319,500. extras. $339,000. Over 3,000 owner (352) 795-0069 (352) 382-7084 I G9R Homes and CRYSTAL RIVER, Properties 3/2, over 175ff on 2 2/2/2, Fam. Rm., listed at water, $575,000. Buyers & Sellrsar large kit., 2000 sq. ft,, Contact Lisa uyers Sellers ar excellent cond., office, h m o. BROKER/Owner smarter than ever. Let new roof encl, lanal homefront.com (352) 422-7925 me work WIItyou $160,000.(352) 382-5186 W e-- for the best deal! (931) 808-665 re Crystal Shores, 2/3/den, Meredith Manci4 64-44-1 S Ing dock, boat slip on (352) 464-4411 2 lots, porch w/ vinyl 3/2/2, 2434 sq. ft. + 408 Sellin windows; overlook gor- Exit Realty Leaders sq. ft. lanal, split plan, geous lagoon mln. to Crystal River pool, wetbar, well, IiSUS gulf, excel. cond. appt. 3 walk In closets, many Citrus!! only (352) 795-1571 3 Rental Homes extras. No brokers on about 2.5 acres for $289,000. (352)382-7383 Call MeEveln Surren $125,000.(352) 347-6096 PHYLLIS STRICKLAND NO Transaction (35Evelyn Surrency) 634-186 or (352) 454-1139 CITRUS REALTY GROUP (352) 613-3503 fees to the 6341861 1925 Recently renovat- EXIT REALTY LEADERS Buyer or Seller. ed, 3/1.5, cottage, w/ 2 3.9% Listing Call Today porches, located on Listing corner w/2 lots near US CITRUS HILLS l 19 & shopping district Full Servlce/MLS TERRA VISTAraven Real Inc $185,000,352-628-2695 Why Pay More??? Stunning 4 bed. Craven Real, Inc. No Hidden Fees pool home In (352) 726-1515 2/2/1 New Carpet/Paint 20+Yrs, Experience gated, golf comm. Inside. C/H/A scrn prch. Call & Compare MUST SEE! $618,900. i Ust with me & Get a Part Priv. fence Citrus Realty Group i Free Home Warranty Only $129.500. Call $150+Milllon SOLDIII (352) 795-0060 & No transaction fees Chuck (352) 344-4793 [ 352-634-1861 Please Call for Details, FOR SALE WITH OWNER 3/2/2 Riverhaven Listings & Home CITRUS REALTY GROUP Spruce Creek Preserve Village, Pool home, Market Analysis Rt. 200, Dunnellon open fl. plan, must seel 3.9/ Listing Beautiful Home, 2/2/2, Z . $279,500. Call for more RON & KARNA NEITZ 3.9% Listing like new. Split plan. info. (352) 628-9896 BROKERS/REALTORS Full Servlce/MLS Built In 2000, Eat-In large Nature Coast 3/ao, CBne CITRUS REALTY GROUP Why Pay More??? kitchen with bay 3/I/Carport, CB, new Why Pay More???. window, 1684 sq. ff. tile In kitchen, bath, (352)795-0060. No Hidden Fees Stucco are c1 Homosassa By Owner shower, $99,900 20+Yrs. Experience 19000ge Caement Gated rverfront/ LoeavemgCusn Call & Compare deck.0,000. Call spacious, 4159 sf, Leave msg.or Custom 3/2/3,w/Den Call & Compare owner 1-352-291-2788 3B 3s s 180 352-212-2737 1htd..pool, well, all apple. $150+Mllllon SOLDIII Over 3,000 deg wtr vw. $863,000. 352-212-2737 neutral colors, too Over 3,000352-628-4928 . much to list. Immediate Please Call for Details, Homes and elistingservice.com Capt Linda Occupancy. REDUCEDI Listings & Home Properties Id 32527 (352)628-5500 (352) 382-3312 LAKEFRONT .-RON & KARNA NEITZ Condo. 2/1. $75k. BROKERS/REALTORS homefront.corn 407-836-5624 or 352 228r0232 CITRUS REALTY GROUP 407-644-8523. 3-28Kristine Quirk (352)795-0060. 2004 Custom Built pool GUIDE YOU! -home on 21/2 acres INGLIS, Remodeled, 4/3/2 has mother-n-lw 5/2 ban/w Before Prope k roomties apt. So many extras, on app tax 11Pacres, I can nt list them al Private headed road, homefrosa Vanebo (352)476-1668329000 Call (352) 352422792 746-2458/422-1059 (c) LS k FREE REPORT Over 3,000 r c.o What Repairs Should Homes and PUTstanding custom, You Make Before Properties Need Listings TO WORKI You Sell?o? listed at Plantation Realty. Inc. .t ftnpr Online Emaelnowcom (352) 795-0784 dneblte a On inetohomefront.com Cell 422-7925 _______________ OMUsa VanDeboe Donna Raynes you Asking379,000. Broker (R)/Owner roug the Process" see to apprecalatel of the listings.(352)344-0840 (352) 476- Nature Coast 352795-2441 in DEBBIE RECTOR JH Citrus County at Motivated Seller Ov er 3,000DlanIt tin- ; rpLookie m Need a mortgage Quick Ovme 0 atvi m Closing Realty One Prop DWELLING UNITS Outstanding customs. Current es Over 3,000 Asscantemp. pool home, lw.buyflorida listed at Homes and 5/3/3 4200sq. on priv352-344-0571 mesn Properties /ac. Lg. state of the art HBroker Realtor (352) 726-1909 Real Estate-Real Easy HOMOSASSA SPRINGS Reduced by Owner We're Growing Brokers welcome TOLL FREE kit. Huge master & fam. On Your Lot, $103,900. listedoat rmCounry. 20' cellving o youngs, 3/2/, w/Laundry offersBay 3bd. 2bat quality & value. Royal Oaks Inverness. RN EGNOT "Hereto help you Asking $379,000. Must 1/1 for sale by owner. 352-287-9219 through the Process" see to appreciate (352) 344-0840 o 1(35 quick close.$269,00033 MUST SEE $618,900 homesandland.com (352) 795-0060 donna@silverk lna Sropertles.com Need a mortgage 7rd. h. e. &-banks won't help? st(Re CcB Nl Self-employed, (2) CBS FIN ISHED all credit Issues DWELLING UNITS. Associate Mortgage liv. area total, 4BR/4BA '" banrren t y 4 rentals. 24en all cr dl Fsue F renals . CH/A, country setting .. . Call M-F 352-344-0571 LEILA K. WOOD, GRI 1-AC mol $250,000 Broker/Realtor (352) 726-1909 Real Estate-Real Easy HOMOSASSA SPRINGS Reduced by Owner We're Growing Brokers welcome TOLL FREE Country living n your 3/2/2 Updated, 1915 Visitrus at our 877-507-7653 1800sq. home. 2001 dral ceiling, g. solar PARADISE REALTY Top of the line, Palm heated pool $252,900. 7655W. Gulf to Lake Bay 3bd. 2bath with in (352) 586-6696 Hwy, #8 (next to ad, 45 mnofCrF Manatee Lanes in the CITRUS HILLS aIcast Choie Realty sunroom double drive- Executive Center)ty oway, w/lect.o l S. Oak Village, quality (352) 795-9335 TERRA VISTA Soluble built, smaller, near new Stunnng 4 bed decks & too man 3/2/2 great upscale I35 UP aoo hoRme In options to list. $127,40. appearance, avail. for wwctrgated, golf comm.iol (352) 621-3418 quick close.$269,000. MUST SEEI $618,900. W NECITRUS SPRINGS GL Any Area or Cond. Call WCO UwRSE 3//N eondL anytime, Iv. message lan ov oolanak, overlooking 8th 3 2 neutral colors, applrsp Private Investor buying real estate, can pay full e 6 1 G2o Nh oak trees 230,000.ta 10.3 Acres. High andterms Inetet aat8272 N. Golfview Dr. Call (352) 628-5595 Very Nice Block Home Toll Free (3 8662) 52997-9616 TOP r$$ PAID FOR IgpcdllfCituru M zoned LDRn, 8 well on ,nOver 3,000 Mobiles w/land, houses Cal f' f .-Homes and & promissory notes. Any location or condition. Properties Call Fred Farnsworth Here To Helpi listed at (352) 726-9369 Visit17 352-628-55CIO waynecormier.com WALK AWAY 2 DAY 0.(352) 382-4500 11 homefront.com Sell your house as Is for (352) 422-0751 Mlchele Rose a fair price on the date Gate House REALTOR WAYNE of your choice. To hear ThroughthProcess"Realty "Simply Put- dCORMIER our FREE 24 hr rec msg R,'.1 mff ]I Icine'icnrina. zoned LDRM, 8" well on 1-1.. 0 I.-I -.. m I FLORAL CITY2+acrps (2 lots) wooded, paded, road, city wtr, $59,900 352-344-0191/228-0688; KENSINGTON ESTATES P 495 Cornish, Great ared Excel. acre corner lot. Call (954) 629-5516 PINE RIDGE ESTATES 4563 N. Lena, 1.06 Acre' Lg. Oaks. Needs no fill. $86,000. (352) 621-6621,37,. Ask for CR CITRUS SPRINGS 20 LOTS FOR SALE 30K-34K each.,- - ,407-617-1005 , CITRUS SPRINqS Beautiful wooded 1/2 cre lot on Airway Loop-'- $48,900 call " (352) 746-1636 HOMOSASSA Last Lot close to everything~' first, $18,500. Gets It:,' Richard (352) 795-3676 HOMOSASSA LOT, $12,500. (352) 628-7.024 citruscountylots.cor HOMOSASSA: 1/2 Acres Parcels (2). Zoned-, MDRM. $29,900 Each.. John Carey -,. Re/Max Reality OnrW (352) 795-2441. .--- Pine Ridge Estates 1.1 Acre, Located 'on- W. Papoose Lane. Very nice lot. $89,000.'. (352) 746-0177,. - PINE RIDGE, desirable interior Mallows Cirdle, 1-acre, 954-821-3666 or 954-444-5039 :, PINERIDGE & - TIMBERLANE EST. 5 Lots. (352) 422-2293' WAYNE CORMIERk- Here To Help! | Visit:" " waynecormier Wlthlacoochee at Trail's End, 8220 S,. Kimberly Circle. J~st reduced 5k to-,- $25,000. Patricia-. Realty Group (813) 877-8228. Realtor Owned Lot ready for home or moblle.Ownee Financing Availi . $20,000-$25,000.A , (352) 220-2274 or-, (352) 422-7925, 1, WATERFRONT Over one beautiful acre in- Floral City right off Hwy41. Only$79,900. Call(352) 302-3126 , WIFE SAYS SELLIPrime Riverhaven Canal.lef Priced Reduced to' $300,000 352-621-7713 Sporty 300 hand-held; transrecelver, with ' holster-Dave Clarke headset w/ boom mlk4 and remote switch all . like new $200. ; .' (352) 563-0022 j-S 2, Danforth Boat Ankersi Large, $50 I' Small $20. . (352) 726-9647 , GALVANIZED TRAILE1RC- for 16FT boat, good.' cond., $300 obo S12 S. Jackson St., Beverly Hills r (352) 746-4874 OUTBOARD MOTOR 2001, 70hp Yamaha w/ controls, looks & runs exc. $3,200. (352) 212-2055 - POLARIS - '96, Jet Ski, SL 650, w/ double, trailer, excel. shape $2000.obo 352 257-9321 Your World -. - CITRUS COUNTY (FL) CHRONICLE i Boats =-i Boat THREEE RIVERS MARINE 7" W .' CLEAN USED < BOATS -- We Need Them! We Sell Them! --U. S. Highway 19 Crystal River 563-5510 26 Ft. 2004, Sea Swirl, 'walk around cuddy, w/ ' 25.Yamaha, w/ trailer, ,83rs. on boat & motor, ile new $48,000. obo . (352) 628-4943 1995 Sears 12' Jon Boat 8 Galvanized Trailer. 5$675, 1 Year Old Foot SControl Trolling Motor. 5$125. (352)465-6597 14' BOAT w/8HP Motor, with tallere, $800/obo (352) 860-1426 AIRBOAT .4FT, fiberglass hull, Cadillac engine, with trailere, runs good, needs sailttle TLC, $3,500 obo - Possible trade?? a .A(352) 726-6864 ,. Bass Buggy S Pontoon 18',O40hp SJ6tinson Tracker Motor, L.ong. trl., great fishing/ .K ily fun boat, many ';*S tras. $3800. OBO g .'(352) 628-6364 .-BOAT MOTOR 150HP Evinrude $1,000 '(352) 793-6896 BOAT SLIP FOR -ENT ON CANAL off Homosassa River $1,5/ mo. 352-628-7525 CANOE, 13' 6" Adlron- dack, Oak Bow, stern, ;-side rails,.42" W, Lt. kt ight-2man, garage kdpt, new cohnd. $550. aft, 4pm (352) 465-5337 --;CAROLINA SKIFF 20&T 19.8. 60hp 4 stroke '-iukl &trailer. Perfect C corid, $10,500. _;`. (352) 628-5222 'HOLIDAY SPECIAL 9 KEVWEST Jumbo Shmrim 13-I15ct. $51b;16-20ct $45.01b. 352-795-4770 -FIBERGLASS BOAT -14', 10hp Outboard motor, trolling motor w/ ,';rw battery, new trial, $1,900. (352) 465-8702 -Glass Stream 79' '14ft. Boat & Trailer, w 959. game fisher motor, ctplus trolling motor $1,250. (352) 621-5346 qr Cell, 302-8886 _.'JON BOAT lt" alum., 2 Minnkota -ltroirg motors, access., $350 obo. (954) 444-5039 UGE PONTOON DECK BOAT : SALE holiday Savings -on all New & Inventory i -.Fystal 'River Marine ,352-795-2597 KAYAK 14FT, Old Town, ready to fish, $500 --._352) 228-2407 Y, LARGO'05 16' Mercury with trall- ,..P.S. fish finder. Low hours and many extra's. *under warrantee. $1D,000 OBO. 400-5164 s KEYWEST ~yB04, 1720cc,90hp 45 nson, SW, tilt trim SS ,Min. 551b SW auto 3 batt, charger, 'linini, loaded, mint', A&ss than 50hrs, 2004 Wesco aluminum trailer, sparer, $14,600. (352) 228-3599 7tegacy Sea Era ; 22' 1998, ctr. r console, 150 r Johnson Ocean SRunner Stainless Steel Prop. T-Top. Electronics, Live Swll. Dive Idr. Trl., 'Low hrs., very good .CQnd, Well equip., Cql for list of extras. $12,500. 52) 628-3767 (813) 265-9509 Lowe Alum Bass Bbat'03 17ft 25hp Yamaha 4 Stk Bimini ;--`Top, Incl. Trailer '$5300. 344-5032 ''MARINER 14' Fiberglass, W/9.9 Elec. Strt engine 1996, Bim. yapi1, trailer. $1750/obo r(352) 563-5688 Monark Pontoon ,l95, 20', 40hp, Very 2_ _lood cond. In -.water, $5500. .(352) 637-6188 & NEW ,,Keywest Boats .Angler Boats -Starting as little as -*, $11,695 Large Selection In Stock Nowl ,Select 2005 jiodels still avail. ft discounted ,-prftces. " '-Olean used Boats Riverhaven Marina 5296 S. Riverview Cir Homosassa 352-628-5545 MEW GALV. & ALUM. 'BOAT TRAILERS *Close-out Prices* Big End of the Year Savings on All O.,Trailers & Parts *,*MONROE SALES. ' Mon-Fri. 9am-5pm (352) 527-3555 -.,PONTOON 8, Play Buoy, 20ft., 'nlh fun model, 40HP .,Wmaha, full cover, 6o,995. (352) 628-1958 Pontoon Boat '..1984 18ftFbglss 35"hp Evinrude Mtr Bim top No trailer $2700. 344-5032 RTverMaster Airboat 13. 316 Stainless Steel, S403 V8, $6000. '" (352) 422-0983 -, SAIL BOAT 975,.25', Hunter, needs TLC, $1,200.080 BO. Or Will trade for truck. S (352) 637-5920 7 SILVERTON IFUN BOAT! 1987,34 Ft., runs great $15,000 or trade, (352) 249-6982 or 249-6324 SYLVAN 1990L21', Super Sport, Aluminum, open bow. - 1.992 200hp Mercury black Hawk (low ml) Easy load Trl, all exc , cond, garage kept, Loran fishfinder, 281, diesl $1H7,888 Cll. $13,000 obo (352) 341-6821 lv.msg NEUMAR . 1998 31ft. Full slide, Extra Clean, $9,250 OBO (352) 586-6181 Prowler 1993,26', Real Clean, excel. shape. $6900. (352) 795-2631wrinch, 70% $250.(352) 212-2055 2005 Jeep Wrangler X, front & rear bumpers complete, $60 ea. or both for $100. (352) 795-4027asts, 12-5pm Dave's USA (352) 628-2084 00 + CLEAN DEPENDABLE CARS FROM-*350-DOWN 30 MIN. E-Z CRED IT VEHICLES WANTED, Dead or Alive. Call Smitty's Auto 1 CADILLAC 1998 Sedan DeVille, Delegance. all options. 87K. like new. $8,500. (352)746-4703 '05NissnnQuest 9kFamilyWagon, Tan, $16,888.~ 726-1238'^^ a 2cus g2 me.. $38 AFFORDABLE CARS 91 TEMPO.......$2175 4DR, AUTO, AC, NICE 98 NEON........ $2495 4DR, AUTO, AC CLEAN 99 ONTOUP...2975 4DR, AUTO, AC, GOOD MPG. 1675-US19-HOMOSASSA BUICK SKYLARK '85, 4cyl., seats gd. 4dr, ac, runs gd. 52K, auto, exc.$800. Call 352-464-2172 Cadillac 1987 Sedan Deville, 2 new tires, leather seats, eng. blown. $300. OBO (352) 344-8001 or 220 1990, Celebrity Wagon, very clean $800. (352) 489-0262 CHEVROLET 1995, Camero Z28 Convertible, 35K, Exc Cond, $9,999. (352) 726-5469 (352) 220-4259 CHEVY '05, Impala, 13k mi., one owner, power win., etc.0 itre, $13500-6 warranty (352) 274-0670 -CHEVY 2003, Monte Carlo LS Coupe, 34,500mi, $12,750/OBO10. (352) 267-0879 CHRYSLER 1988 New Yorker, great for parts or repair, good 3.0 litre, V-6, clear title, $300 obo (352)2344-8678 CHRYSLER 2004 Pacifica, White, 21K, under warranty, below book $18,800 (352) 621-5404 CHRYSLER '96 Concord, leathowner, 4-dr., 60K orig. mi. Non- smoker, A-1 cond. $4500 obo 628-5736 CORVETTE 1979, auto., runs good, needs TLC, $4,250 obo -Possible interesting 4tgdes?.(352)J,726x6864_. CORVETTE 2000 coupe,35,000 mi silver w/ gray interior, Asking $26,500. (352) 382-4331 DODGE INTREPID 2003, salesman car. Sunroof, leather seats, loaded, 70K, $900 . (352) 621-0282 WE.FINANCE.YOU 100 + CLEAN DEPENDABLE CARS FROM-350-DOWN 30 MIN. E-Z CREDIT 1675 US19 HOMOSASSA FORD '91 Crown Victoria LX, LTD 128Kmi., $1;000 obo info.(352) 637-3552 FORD '92 Mustangytime 205-0GT con.291 45Kact. dmi., 1-owner, 5.0 auto., PS, PW, PD, exc. cond. $9,500 obo (352) 795-6353 or (352) 697-2737 HONDA ACCORD 2003, Miat4-dr., sliver EX,-5 cn auvertibleo., on4cyl., exc cond. les 19895 s1 owner, A-1 mint cond. $1950. $18,000.Call for info.(352) 628-39695 HYUNDAI 20030, Accent, auto.40 32mpg. 4dr, cold air, (239) 839-2900 cellond,$8,500 OBO. (352) 795-6364 MAZDA '05, MX-5 Miata, whiteMX-5 con- vebleak, auto, viper secu- black, auto, viper secu- rity, excel. cond. 71k mi. $5,500. (352) 746-6583 MERCURY GRAND MARQUIS 2003 Presidential Package, Landau Roof, Beautiful, black/charcoal 21K mi, $13,800 CC, All Pwr, AM/FM Cd/Tape, Gar- age kept, Dealer maint. 352 527-1208 MERCURY Grand Marquis '92 85K, $1800. (352) 628-4147 MITSUBISHI 2003 Lancer ES. 66K, exc. cond. $7400/obo (352) 422-4878 NISSAN CENTRA '96 SE, 4 dr. auto, air, runs good, low mi. $3800 (352) 527-0223 PONTIAC 94 Grand Prix SE high miles, runs & looks great, 2 door, very good on gas, white, all pwr, $1500.OB0. 352-634-6723/ 563-6450 Search 100's of Local Autos Online at wheels.com 3& . Wanted 96' or newer car, good cond./gas mileage. Pay up to ,$1700. (352) 621-9707 CHEVROLET 1987 EL CAMINO, V8, all power w/ cruise, Arizona car, exc. $9,200 QBO. Cony cust paint Red, showroom. 5spd. loaded 30MPG, $4200/ obo. (352) 621-0484 1979 JE EPUJ' 78000, 4 Wheel Drive, $3,500.00 Fiberglass top, full steel doors, half alu- minum doors 344-5529 IN CS SU'S VANS IN STOCK OM'10O0-UP 30 MIN. E-Z CRED IT 675.US19-HOMOSASSA CHEVROLET '86 Silver clean, $8,990.0BO (352) 628-7228 DODGE '05, Rumble Bee, yellow, low mi., $8k in extras, mint, must sell by 12/2 new truck end, asking $23,750. (352) 560-7217 DODGE 2001 PICKUP 1500 CLUB 1999, F150XL, long bed, silver, V6, A/C, auto, AM/FM, Exc Cond, 58K, $7,750 OBO. (352) 628-2113 FORD F-350 '99 VRW, super cab, Diesel, equipped for 5th wheel towing, high mileage but exc. cond. $11,500. (352) 637-3996 FORD RANGER 1994, 4cyl, 5spd, new clutch, great shape Cold AC, $2500/obo (352) 489-5928 GMC 2001, Sierra, SLE, xcab. all power, V8, color Pewter, 45,818 mi. $14,990. (352) 746-0939 Search 100's of Local Autos Online at wheels.com TOYOTA '98, Tacoma, 72k mi., excel, cond., fiberglass topper $7,650. 302-8886, 352-621-5346 88, TOYOTA, 4x4 landcruiser, white, needs trons Toyota Landcruiser 1977, gd. shape, maint. records, repair manual $7500. Call to see 795-5510 or 795-1308 '01 CHEVY BLAZER LT 4x4, 4DR, Loadedw/exitrs............... ..................................... $9,995 '01 FORD ESCAPE XLS 4x4, V, Low Miles, like New................ ....................................$10,980 MANY MORE IN STOCK ALL UNDER WARRANTY FORD BRONCO II '88, 4x4, Manual w/OD, Hunter/mud bigger special. Everything works, $800. , (352) 628-1852 Jeep Grand Cherokee ,1996 V-8, 4x4, new tires, looks perfect, runs better. 103k, $5,500. (352)382-7888 Search 100's of Local Autos Online at wheels.com 93, MITSUBISHI EXPO 5 dr, all pwr, white, runs, drives, trans leak. $600. (352) 427-2818 MR CITRUSCOUNTI r A ALAN..NUSSO, BROKER Associate Real Estate Sales Exit Realty Leaders (352) 422-6956 CHEVROLET 1988 hlghtop, Astro van, V-6, auto., runs good, $900 obo (352) 344-4104 CHEVROLET Ugly but reliable 1990 350 V-8 work van, newer tires, HD trailer hitch, good heat, fullsize spare $550 (352) 341-6984 FORD '87, Van,$550. and 18 ft. Ford Box Truck 352-422-5644 Mercury Villager 2000, Brand new tires, fully loaded, 6 disc CD changer, leather $11,500.(352) 637-6374 Search 100's of Local Autos. Online at wheels.com Cii IN i .fit,,.endon Stand-up 2 bike Trailer. Stores in garage. Used once. $1800. OBO (352) 795-2451 Search 100's of Local Autos Online at wheels.com C, f, 9 '- 423-1205 MCRN PUBLIC NOTICE NOTICE IS HEREBY GIVEN that the Beverly Hills Advl- sory Council will meet Monday, December 12, 2005, at 10:00 o'clock A.M., at the Beverly Hills Civic Center, One Civic Circle, Beverly Hills, Flori- da,: Mike Colbert Chairman BEVERLY HILLS MSBU Published one (1) time in the Citrus County Chroni- 416-1205 MCRN Notice to Creditors Estate of Dennis L. Putlak PUBLIC NOTICE IN THE CIRCUIT COURT FOR CITRUS COUNTY, FLORIDA PROBATE DIVISION File No. 2005-CP-1453 IN RE: ESTATE OF DENNIS L. PUTLAK a/k/a DENNIS LAMBERT PUTLAK a/k/a DENNIS PUTLAK, Deceased. NOTICE TO CREDITORS The administration of the Estate of Dennis L. Pullak a/k/a Dennis Lambert Putlak a/k/a Dennis Putlak, deceased, whose date of death was Sep- tember 25, 2005; is pend- ing in the Circuit Court for Citrus County, Florida, Pro-. bate Division; File No. 2005-CP-1453, the ad- dress of which is 110 N. Apopka Avenue, Inver- ness, Florida 34450. The names and addresses of the Personal Represent- ative and the Personal Representative's attorney are set forth below. All creditors of the dece- dent and other persons having claims or de- mands against the dece- dent's estate, Including unmatured, contingent, or unliquidated claims. and who have been served a copy of this No- tice, unllquidated publica- tion of this Notice Is No- vember 28, 2005. Personal Representative: /s/ Gale Sllbermann Attorney for Personal Representative: /s/ Gary N. Slrohauer, Esquire BAXTER, STROHAUER, MANNION & SILBERMANN, P.A. 1150 Cleveland Street Suite 300 Clearwater, FL 33755 Telephone: 727-461-6100 Facsimile: 727-447-6899 FL BAR NO. 149373 Published two (2) times In the Citrus County Chroni- cle, November 28 and December 5, 2005. 417-1205 MCRN- Notice to Creditors Estate of Philip Vincent McCarty PUBLIC NOTICE IN THE CIRCUIT COURT FOR CITRUS C1 IN UY, -LC 'IDA PROBATE dIVISION File No. 2005-CP-1413 Division: Probate IN RE: ESTATE OF PHILIP VINCENT MCCARTY Deceased. NOTICE TO CREDITORS The administration of the estate of PHILIP VINCENT MCCARTY, deceased, whose date of death was September 6. 2005,liher per- sons having claims or de- mands against dece- dent's estate must file NCO 28, 2005. Personal Representative: /s/ Karen Rizzolo 1690 N Marlborough Loop Crystal River, Florida 34429, November 28 and December 5, 2005. 418-1205 MCRN Notice to Creditors Estate of Gary Lester Hando PUBLIC NOTICE IN THE CIRCUIT COURT FOR CITRUS COUNTY, FLORIDA PROBATE DIVISION File No. 2005-CP-1323 IN RE: THE ESTATE OF GARY LESTER HANDO Deceased. NOTICE TO CREDITORS The administration of the estate of Gary Lester Hando, deceased, whose date of death was August 9th, 2005, and whose So- cial Security Number Is 392-38-9775, Is pending In the Circuit Court for Citrus County, Florida, Prob No- vember 28, 2005. Personal Representative: Jack Hando N7562 Townllne Rd. Fond du Lac, WI 54937 Attorney for Personal Representative: RUSSELL R. WINNER ATTORNEY AT LAW 1904 E. Busch Blvd. Tampa, FL 33612-8666 Telephone: (813) 933-5700 Florida Bar No. 517070 Published two (2) times In the Citrus County Chroni- cle, November 28 and December 5, 2005. 419-1205 MCRN Notice to Creditors (Summary Administration) Estate of Joseph Pittari PUBLIC NOTICE IN THE CIRCUIT COURT FOR CITRUS COUNTY, FLORIDA PROBATE DIVISION File No.: 2005-CP-1150 IN RE: ESTATE OF JOSEPH PITTARI Deceased. NOTICE TO CREDITORS (Summary Administration) TO ALL PERSONS HAVING CLAIMS OR DEMANDS AGAINST THE ABOVE ES- TATE: You are hereby notified that an Order of Summary Administration has been entered In the estate of Joseph Pittari, deceased, File Number 2005-CP- 1150, by the Circuit Court for Citrus County, Florida, Probate Division, the ad- dress of which Is 110 North Apopka Avenue, Inver- ness, Florida 34450; that the decedent's date of death was. March 16, 2005; that the total value of the estate Is $3,300.00 and that the names and addresses to whom It has been assigned by such or- der are: Antoinette Durante 287 Falmouth Avenue Elmwood Park, NJ 07407 Baslllo Pittari 167 Clover Rd. Paramus, NJ 07652 Frances Cirocco 7 Patriots Trail Totowa, NJ 07512 Cynthia Fasolo 30 Clifford Drive Wayne, NJ 07470 JacquelIne Durante 6 Stonybrook Rd. Clarks Summit, PA 18411 publi- cation of this Notice is No- vember 28. 2005. Person Giving Notice: /s/ Antoinette Durante 287 Falmouth Avenue Elmwood Park, New Jersey 07407 Attorney for Person Giving Notice; /s/ Thomas E. Slaymaker, Esquire Slaymaker and Nelson, P.A. Florida Bar No. 398535 6027 South Suncoast Blvd. Homosassa, Florida 34446 Telephone- (352) 628-1204 Published two (2) times in the Citrus County Chroni- cle, November 28 and December 5, 2005. 424-1212 MCRN-- Notice to Creditors Estate of Alfred Custardo PUBLIC NOTICE L1-- IN THE CIRCUIT COURT FOR CITRUS COUNTY. FLORIDA PROBATE DIVISION FILE NO.: 2005-CP-1544 IN RE: ESTATE OF ALFRED CUSTARDO, Deceased. NOTICE TO CREDITORS The administration of the Estate of ALFRED CUS- TARDO, deceased, whose date of death was Octo- ber 24, 2005, and whose Social Security Number Is 341-18-1865, File Number 2005-CP-1544. Is pending In the Circuit Court for Cit- rus County, Florida, Pro- bate Division, the address of which Is 110 N. Apopka, Room 101, Inver- ness, Florida 34450-4299. The names and addresses of the Personal Repre- sentative and the Person- al Representative's attor- ney are set forth below. All creditors of the dece- dent and other persons having claims or de- mands against' dece- dent's estate, upon whom a copy of this notice Is served must file their claims with this Court WITHIN THE LATER OF THREE (3) MONTHS AFTER THE DATE OF THE FIRST PUBLICATION OF THIS NO- TICE OR THIRTY (30) DAYS AFTER THE TIME pub- lication of this Notice Is December 5,2005. SPersonal Representative: /s/VICTOR A. CUSTARDO 975 North Saratoga Drive Palatine, Illinois 60074 Attorney for Personal Representative: /s/ ROBERT J. REYNOLDS, Esquire Florida Bar No.: 0021415 P. 0. Drawer 2480 Dunnellon, Florida 34430 Published' two (2) times In the Citrus County Chroni- cle, December 5 and 12, 2006. 425-1212 MCRN Notice to Creditors - Estate of Wellington Evans Patten PUBLIC NOTICE IN THE CIRCUIT COURT FOR CITRUS COUNTY. FLORIDA PROBATE DIVISION Flle No. 2005-CP-1502 Division: Probate IN RE: ESTATE OF WELLINGTON EVANS PATTEN Deceased. NOTICE TO CREDITORS The administration of the estate of WELLINGTON EV- ANS PATTEN, deceased, whose date of death was December 2, 2004, FIRSI- tlon of this Notice Is 'De- cember 5, 2005. Personal Representative' /s/ Dor-Lynne Semple 2070 Parkview Drive Lansdale, PA 1944f Attorney for Personal Representative: /s/ John S. Clardy III Florida Bar No. 123129 Crider Clardy Law Firm PA PO Box 2410 Crystal River, FL 34423-2410 Telephone: (352) 795-2946 Published two (2) times Ir the Citrus County Chroni cle, December 5 and 12 2005. 426-1212 MCRN Notice to Creditors Estate of Rose A. Patten PUBLIC NOTICE IN THE CIRCUIT COURT FOR CITRUS COUNTY,. FLORIDA PROBATE DIVISION File No. 2005-CP-150: Division: Probate IN RE: ESTATE OF ROSE A. PATTEN Deceased. NOTICE TO CREDITORS The administration of the estate of ROSE A. PATTEN deceased, whose dote o death was April 26, 2004 Is pending In the Circul Court for Citrus County Florida, Probate Division the address of which I: 110 N. Apopka Avenue Inverness, FL 34450. The names and addresses o the personal represent tive and the personal rep resentative's attorney are set forth below, All creditors of the dece dent and other person having claims or de mands against dece dent's estate on whom c copy of this notice is re quired to be served mus file their claims with thi court WITHIN THE LATER 01 3 MONTHS AFTER THE TIMI OF THE FIRST PUBLICATION OF THIS NOTICE OR 3( DAYS AFTER THE DATE O0 SERVICE OF A COPY 01 THIS NOTICE ON THEM. All other creditors of th( decedent and other per sons having claims or de mands against dece dent's estate must file their claims with this court WITHIN 3 MONTHS AFTEr THE DATE OF THE FIRS PUBLICATION OF THIS NO TICE, ALL CLAIMS NOT FILE[ WITHIN THE TIME PERIOD; SET FORTH IN SECTION 733.702 OF THE FLORID/ PROBATE CODE WILL BE FOREVER BARRED. NOTWITHSTANDING THE TIME PERIODS SET FORTH ABOVE, ANY CLAIM FILED TWO (2) YEARS OR MORE AFTER THE DECEDENT'S DATE OF DEATHS BARRED. The date of first publica- tion of this Notice Is De- cember 5, 2005. Personal Representative: /s/ Dori-Lynne Semple 2070 Parkview Drive Lansdale, PA 19446, December 5 and 12, 2005. 427-1212 MCRN Notice to Creditors Estate of John Crider PUBLIC NOTICE IN THE CIRCUIT COURT FOR CITRUS COUNTY, FLORIDA PROBATE DIVISION File No. 2005-CP-1516 DivisIon: Probate IN RE: ESTATE OF JOHN CRIDER a/k/a RAYMOND JOHN CRIDER, JR. a/k/a R. JOHN CRIDER a/k/a R. JOHN CRIDER, JR. Deceased. NOTICE TO CREDITORS The administration of the estate of JOHN CRIDER, deceased, whose date of death was October 20, 2005, Is pending in the Cir- cuit Court for Citrus Coun- ty, Florida, Probate Divi- sion; the address of which Is 110 N. Apopka Avenue, Inverness, FL 34450. The names and addresses of the personal representa- tive and the personal rep- resentative's attorney are CLASSIFIEDS 422-1212 MCRN ,PUBLIC NOTICE ADVERTISEMENT FOR BIDS The City of Inverness, Citrus County, Florida, will receive sealed bids until 1:00 p.m., December 27th. 2005. at 212 W. Main Street, Inverness, Florida. Bids will be re- corded and opened at 2:00 p.m.. on December 27th, 2005, for "Gospel Island Bridge Utility Relocation" In the Council Chambers at 212 W. Main Street, Inverness Flor- Ida. Project manuals and drawings will be available for re- view and/or purchased for $50.00 per set at the office of Bureau Veritas-Berryman & Henigar, 1414 S.W. Martin Luther King Ave., Ocala, Florida 34474-3129. For ques- tions contact (352) 368-5055. Bids submitted shall be enclosed In a sealed envelope, on the bid form provided, addressed to: City Clerk, 212 W. Main Street, Inverness, Florida 34450. In the lower left hand corner bidder shall state, "City of Inverness, Gospel Island Bridge Utility Relocation." The City of Inverness reserves the right to waive formali- ties and to reject any and all bids, to waive any techni- cal defect and to accept any bid which represents the lowest best offer to the City, all as may be In the best Interest of the City. /s/ Frank DIGlovannI, City Manager City of Inverness, Florida Published two (2) times In the Citrus County Chronicle, December 5 and 12,2005. 409-1205 MCRN Notice of Action Roberts vs. Frovold PUBLIC NOTICE IN THE CIRCUIT COURT OF THE FIFTH JUDICIAL CIRCUIT IN AND FOR CITRUS COUNTY, FLORIDA CASE NO. 2005-CA-4413 THOMAS F. ROBERTS and ELNOR ROBERTS, Plaintiffs, vs. JOSEPHINE FROVOLD, and ALL OTHER UNKNOWN PERSONS INTERESTED IN THIS ACTION AS HEIRS, DEVISEES, GRANTEES, ASSIGNEES, TRUSTEES, OR OTHER CLAIMANTS BY, THROUGH, OR UNDER JOSEPHINE FROVOLD, Defendants. NOTICE OF ACTION TO: JOSEPHINE FROVOLD, Rivergate Apts., NR 1218 115 2nd Ave., South Minneapolis, MN 55401 YOU ARE NOTIFIED that an action to quiet title to the following property in CITRUS County, Florida LOT 17, BLOCK 279, CITRUS SPRINGS UNIT 3, CITRUS County, FL has' been filed against you and you are required to serve a copy of your defenses, if any, to It on DAVID ALLEN BUCK, Plaintiffs' attorney, whose address Is 13127 Spring Hill Drive, Spring Hill, Florida 34609. on or before December 14, 2005, and file the original with the clerk of this court either before service on Plaintiffs' attorney or Immediately thereafter; otherwise a default will be entered against you for the relief demanded In the complaint. DATED on November 4, 2005 BETTY STRIFLER Clerk of the Circuit Court By: /s/ M. A. Michel Published four (4) times in the Citrus County Chronicle, November 14, 21,29 and December 5,2005. 421-1212 MCRN Notice of Action The Bank of New York, etc. vs. Carol A. Droog, 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-4748 DIVISION: THE BANK OF NEW YORK, AS TRUSTEE FOR THE HOLDERS OF THE EQUICREDIT CORPORATION ASSET BACKED CERTIFICATES, SERIES 2001-2, Plaintiff, vs. CAROL A. DROOG A/K/A CAROL ANN DROOG, et al., Defendant(s). NOTICE OF ACTION TO: CAROL A. DROOG A/K/A CAROL ANN DROOG LAST KNOWN ADDRESS: 1699 North Paul Drive Inverness, FL 34453 mort- gage on the following property In CITRUS County, Flori- da: LOT 28, BLOCK "A", TRIANGLE TRAILER PARK, ACCORD- ING TO THE PLAT THEREOF AS RECORDED IN PLAT BOOK 4, PAGE 89, OF THE PUBLIC RECORDS OF CITRUS COUN- TY, FLORIDA. TOGETHER WITH A MOBILE HOME LOCATED THEREON AS A PERMANENT FIXTURE AND APPURTENANCE THERETO BEING DESCRIBED AS: A 1970 SKYLINE MOBILE HOME, IDENTIFICATION NUMBER SE 2297D. has been filed against you and you are required to serve a copy of your written defenses within 30 days after the first publication, if any, on Echevorria, Codilis & Stawiarski. 23rd day of November, 2005. Betty St after Clerk of the Court By: /s/ M. A. Michel As Deputy Clerk Published two (2) times In the Citrus County Chronicle, December 5 and 12, 2005, F05020919 I Aon.11o BER 5, 2005 5, 2005. Personal Representative: /s/ Constance Branan Crider 9285 W. Turnberry Loop Crystal River, Florida 34429 Attorney for Personal Representative: /s/ John S. Clardy III Florida Bar No. 123129 Crider Clardy Low Firm PA PO Box 2410 Crystal River, FL 34423-2410 Telephone: (352) 795-2946 Published two (2) times in the Citrus County Chroni- cle, December 5 and 12, 2005. 14B MONDAY, DECEMBER 5, 2005 ., i.'A ': -- S... , .* .-. a - S.70 S -: ," ,- n i ,^ - '" : *" S- . . '1 -'', . ... .',". -':., -. ,.. '^ _ * ." .? * .. .* -* .".i i: ; :.. "' ,, ,^ _- ,, .i ..,. r . ,U.-Woo '. .: "' ,* t .': '* *' -'*y ^ ^ j" ** *': *' .. i T- ,* > r. j1: k-:--- ..... .. .. ............. W4...... ": .! o p "." J' . ;,^:i' .. -'.' '.*:',*, --* : *, :- ;.: + . "ll ;":" " "* "" ' ' -" " It's Here! The ALL-NEW 2006 Mitsubishi ! 'N IN\ MobI All prices plus taxes and fees. It's HOT! The ALL-NEW 2006 Mitsubishi ECM .P-E. :,- 99SK m is taxes and fees. 2005 2006 Mitsubishi -- '* ^J ^ I "SA-- -- All prices plus taxes and C A _ J .r..r J L r - All prices plus taxes ad . All prices plus taxes an'd fiees A 2200 SR 200 OCALA 622*4111 PRICES PLUS TAX. TAC, AND 195 DEALER FEE. INVENTORY SUBJECT TO AVAILABILITY '72 MO. @7.9% APR. WJLC. 'SELECT MODELS, WITH APPROVED CREDIT. '" -, : " O lt ;, :+ .: ,, P. A~' U,' *j'- ~V cI~J Ii' I I I F- 1 1 II Il " I i I -- 0 'aT CIrRus CouNTY (FL) CHRONImcLE . . .- . 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/00339 | CC-MAIN-2019-09 | refinedweb | 41,005 | 75.91 |
* Giacomo Pati (giacomo@apache.org) wrote :
> > > > i'll vote for
> > > >
> > > >
> > > >
> > > > we should immediately switch c2's xsp namespace uri to use that. we
> > > > should also switch the c2 logicsheets to use the new unified xsp
> > > > namespace scheme.
> > > I totally agree.
> > I agree as well.
Thirded.
> > > What pattern should we use for the version? I've actually found two
> > > styles:
> > > 1)
> > > 2)
> > I would suggest the use of two numbers 'dot notation' for versioning
> > [major.minor] where major is incremented when the taglib is *NOT* back
> > compatible, while minor is incremented if something is added or
> > deprecated, but back compatibility is maintained.
> My preference too, so we are at 2 votes for 2) and one for 1)
And mine.
> > In the future, we might want to centralize the distribution of XSP
> > taglibs from the above URI, then I suggest we place a sort of "taglib
> > description file" that indicates where the XSP engine can find the
> > appropriate taglib implementation for the required programming language,
> > but this has nothing to do with embedding either the programming
> > language or the XSP engine name (Cocoon or AxKit) in the taglib URI.
> Yes, kind a automated CPAN for taglibs. I feel sorry nobody investigated into
> the simple logicsheet language (SILLY) where things like this coud be
> addressed. Also because a SILLY stylesheet will be programming language
> neutral to be ported along different implenetations of XSP.
Well, broadly speaking, anyway. What happened to SiLLy? Do we have a
schema lying around? It shouldn't be that hard to write if we knew what
we were aiming for.
P.
--
Paul Russell Email: paul@luminas.co.uk
Technical Director Tel: +44 (0)20 8553 6622
Luminas Internet Applications Fax: +44 (0)870 28 47489
This is not an official statement or order. Web: | http://mail-archives.apache.org/mod_mbox/cocoon-dev/200102.mbox/%3C20010215141751.A987@hydrogen.internal.luminas.co.uk%3E | CC-MAIN-2016-22 | refinedweb | 295 | 64.81 |
Movement¶
Your BBC micro:bit comes with an accelerometer. It measures movement along three axes:
- X - tilting from left to right.
- Y - tilting forwards and backwards.
- Z - moving up and down.
There is a method for each axis that returns a positive or negative number indicating a measurement in milli-g’s. When the reading is 0 you are “level” along that particular axis.
For example, here’s a very simple spirit-level that uses
get_x to measure
how level the device is along the X axis:
from microbit import * within the body of the
loop is a measurement along the X axis which is called
reading. Because
the accelerometer is so sensitive I’ve made level +/-20 in range. It’s why
the
if and
elif conditionals check for
> 20 and
< -20. The
else statement means that if the
reading is between -20 and 20 then
we consider it level. For each of these conditions an accelerometer in exactly the same way as the program above. Game controllers also contain accelerometers to help you steer and move around in games.
Musical Mayhem¶
One of the most wonderful aspects of MicroPython on the BBC micro:bit is how it lets you easily link different capabilities of the device together. For example, let’s turn it into a musical instrument (of sorts).
Connect a speaker as you did in the music tutorial. Use crocodile clips to attach pin 0 and GND to the positive and negative inputs on the speaker - it doesn’t matter which way round they are connected to the speaker.
What happens if we take the readings from the accelerometer and play them as pitches? Let’s find out:
from microbit import * import music while True: music.pitch(accelerometer.get_y(), 10)
The key line is at the end and remarkably simple. We nest the reading from
the Y axis as the frequency to feed into the
music.pitch method. We only
let it play for 10 milliseconds because we want the tone to change quickly as
the device is tipped. Because the device is in an infinite
while loop it
is constantly reacting to changes in the Y axis measurement.
That’s it!
Tip the device forwards and backwards. If the reading along the Y axis is positive it’ll change the pitch of the tone played by the micro:bit.
Imagine a whole symphony orchestra of these devices. Can you play a tune? How would you improve the program to make the micro:bit sound more musical? | https://microbit-micropython-hu.readthedocs.io/hu/latest/tutorials/movement.html | CC-MAIN-2019-30 | refinedweb | 420 | 64.81 |
Run Elm in the Terminal
Elm is usually run in a browser with output in HTML. So how does one run Elm outside the browser, say, in the terminal? Here's a quick setup.
Setup Headless Elm
A headless program is one without a UI. If we run in a terminal or the commandline, we'll be bypassing any UI building and just using the console to log out program results. The same kind of program could be run in node. In fact, when we exercise this program, we'll use
node to run it.
Let's walk through a quick code snippet. Let's say that I wrote an elm program in
MyProgram.elm. In this case, it's simply logging a value:
module MyProgram exposing (..) print : Int -> Int print num = Debug.log "num of destiny" num
Pretty interesting, eh? How should we run this? Let's write a program runner. In
Main.elm, let's work through the different bits:
First, import your program that you want to run.
module Main exposing (..) import MyProgram exposing (print)
Then import the
program function from platform. This is the function that Elm provides to create a headless program:
import Platform exposing (program)
Now let's write the function that calls the
program function and initializes it with sufficient setup data. First, the function signature:
nodeProgram : a -> Program Never () ()
Let's break it down:
nodeProgramis the name of our function
aindicates that this function can take any generic function
The return value is a
Programtype.
Program's first arg is
Never, which means it is a program that will never receive flags. If you want flags, use the sister
programWithFlagsfunction.
Program's next two args are
(), or unit. The first
()is the model. This program runner has no state, so it has no model. The last
()indicates there are no
Cmds or effects that are handled by this program.
The actual body of the function and the call to
program is like this:
nodeProgram _ = program { init = ( (), Cmd.none ) , update = \() -> \() -> ( (), Cmd.none ) , subscriptions = \() -> Sub.none }
Another quick breakdown:
The program takes one function parameter. This is to handle our
MyProgram#printoutput. The
_naming convention indicates it's unused.
initand
updatekeep the model at
()and
Cmd.none. These are required values in the
programinvocation, but we're not going to use them.
Sames goes for
subscriptions
Finally, we get to run the module with a
main function:
main : Program Never () () main = nodeProgram (print 9)
This is the entry point for our runner. It is also the place where we call our
nodeProgram.
Running Elm on Node
Now all we have to do is compile and run. To compile:
elm make --output main.js *.elm
And then to run:
node main.js
And as we'd expect from our setup, the output is:
num of destiny: 9
For the code all together, see this gist.
elm-run
Not too bad, right? Well it can get even easier. If you'd like to have this
Main.elm setup wrapped up in a package that already exists, try out elm-run.
To install:
npm install -g elm-run
And then to run against your program:
elm-run MyProgram.elm
The output will be the same.
What are some other ways that you've found to run a headless Elm program? | https://jaketrent.com/post/run-elm-in-terminal/ | CC-MAIN-2022-40 | refinedweb | 554 | 76.93 |
But if you try to run this this through pybooard.py, then this no longer holds. Here is an example, called test.py:But if you try to run this this through pybooard.py, then this no longer holds. Here is an example, called test.py:dhylands wrote: ↑Wed May 09, 2018 4:36 pmIn the REPL, each statement you execute is evaluated and if the return value from the statement is not equal to None, then the result is printed. Consider the following:An function which doesn't return anything winds up returning NoneAn function which doesn't return anything winds up returning None
Code: Select all
>>> def foo(): ... print('Hey there') ... return 42 ... >>> foo() Hey there 42 >>> def foo2(): ... print('Another print') ... return None ... >>> foo2() Another print >>> def foo3(): ... print('foo3') ... >>> foo3() foo3 >>> def foo4(): ... print('Before 3 * 3') ... 3 * 3 ... print('After 3 * 3') ... return 42 ... >>> foo4() Before 3 * 3 After 3 * 3 42
and if I do this:
Code: Select all
def f(): print('in f()') return 12 f() def g(): return 13 g() print('print g: ', g())
then I get this:
Code: Select all
python pyboard.py test.py
Neither 12, nor 13 is printed, while these numbers were in fact returned. I understand what you are saying, and it is clear that something that returns None is not printed. But if the function does return something, this still doesn't guarantee that the result is printed. It depends on the context.
Code: Select all
$ python pyboard.py test.py in f() print g: 13 | https://forum.micropython.org/viewtopic.php?f=2&t=4757&p=27606 | CC-MAIN-2019-43 | refinedweb | 260 | 76.32 |
This code isn’t making any sense to me. Here’s what I’ve got:
def reversed_list(lst1, lst2):
for i in range(len(lst1)):
if lst1[i] == lst2[(-i - 1)]:
return True
else:
return False
Here’s my problem:
when I have the second print() run through my code, it shows up as true.
The two lists are lst1 = [1, 5, 3] and lst2 = [3, 2, 1]
So in theory, on the second run-through of the loop, it’s doing this:
if lst1[1] == lst2[-1 - 1]:
return True
else:
return False
I know that lst1[1] is equal to 5 and lst2[-1 -1] is lst2[-2] which is equal to 2. These are clearly not equal, yet I’m getting a True return.
Can someone explain why this is? | https://discuss.codecademy.com/t/return-will-end-a-function-and-stop-any-loops/432252/6 | CC-MAIN-2019-43 | refinedweb | 133 | 81.77 |
This article is in the Product Showcase section for our sponsors at CodeProject. These reviews are intended to provide you with information on products and services that we consider useful and of value to developers.
Pegasus Imaging Corporation
With the release of Windows Workflow Foundation (WF), a new paradigm for workflow-based application development has been introduced. Instead of embedding business logic in code, workflows are built declaratively, within a visual designer, using building blocks of functionality called activities. Application developers must still depend upon domain experts to accurately describe the business processes they are automating. However, those experts don’t get left behind the moment the first line of code is written. Domain experts and stakeholders benefit from the WF graphical designer, which provides visibility into the application not possible with code; not only can they see the process followed, but they can validate the workflow for accuracy as well. For developers, WF provides significant amounts of infrastructure typically required for long-running workflow applications including process and thread agility, compensation, and transactions. In essence, WF provides a bridge between the development and business sides of the house while providing enough technical services to make the technology worthwhile. So worthwhile Microsoft has chosen to utilize WF as the workflow engine within Microsoft Office SharePoint Server (MOSS) and will be adding the engine in the next version of BizTalk.
Of course, it’s impossible to build complex workflows in WF without activities which actually do the work. Many useful activities ship with WF and .NET 3.0; however, most are general purpose and do not solve specific business problems. Microsoft has left the task of building domain-specific activities to those who know how to build them best — individual developers and domain experts. Within the imaging domain, Pegasus Imaging Corporation is drawing upon over 15 years of experience as an imaging toolkit provider to deliver WF activities. Over the coming year, activities will be published for document image cleanup, barcode reading and writing, and OCR for use in your own workflow applications or applications that host the WF runtime such as MOSS.
To demonstrate the power and flexibility of WF and Pegasus Imaging’s activity libraries, Part 1 of this article will show how to build a small, imaging workflow application using WF. Part 2 will show how Pegasus’ activities may be used to add imaging workflows to MOSS using Visual Studio 2008.
One common scenario where an imaging workflow makes sense is folder monitoring. In this scenario, a folder path is constantly monitored for newly created image files, typically coming from a scanner or other network location. The images arriving at this location might have some sort of damage caused by the capture process (the page could be skewed, the image is dirty due to specks of dust on the scanner bed, etc.) and requires cleanup prior to further processing. The biggest challenge in building an application to automate this cleanup is determining the actual cleanup required — not all cleanup steps are appropriate for all images. However, WF makes the actual processing definition very easy, especially once we have our application’s framework written.
To demonstrate a potential solution for the folder monitoring scenario, we’re going to build a small Sequential Workflow Console Application using Visual Studio 2008. This application will take a folder path to monitor from the command line, begin watching that folder for new files, and upon the arrival of each new file, run a cleanup workflow using WF. To build our application, we’re going to have to host the WF runtime ourselves, so we have some setup and coding to get through before we hit the visual designer.
To get started, launch Visual Studio 2008, and bring up the New Project dialog. Under the Visual C# heading, select Workflow as the project type, and then select Sequential Workflow Console Application as the project template. Enter a name for your project, and we’re on our way.
x
Once the project has been created, you might see a few things new to you, particularly if this is your first time using WF. We’re not going to go into the details of all things WF, but there are a few things to be aware of. The Sequential Workflow Console Application template caused two classes to get created — Program and Workflow1 — and contain the application’s main entry point and default WF workflow respectively. As shown in Listing 1 below, the generated Main function inside Program creates an instance of the WorkflowRuntime — the runtime engine which manages our workflows — and creates a new instance of our default workflow, Workflow1, returning an instance of WorkflowInstance to represent our loaded workflow. Finally, the loaded instance is started, and our workflow begins execution. One word of caution though: the instance is created on a worker thread, so the call to Start will return immediately. As a result, we have to use a wait handle, signaled in the WorkflowCompleted or WorkflowTerminated handler, to ensure we don’t kill the process by returning from Main before the workflow has an opportunity to complete.
Program
Workflow1
Main
WorkflowRuntime
WorkflowInstance
Start
WorkflowCompleted
WorkflowTerminated
Main
namespace ImageCleaner
{(ImageCleaner.Workflow1));
instance.Start();
waitHandle.WaitOne();
}
}
}
}
With our very brief introduction to WF in hand, it’s time to build something real. To start, we’re going to need to rearrange the default code in Main so we’re able to handle the path passed via the command line and set up the folder monitor. Luckily, Microsoft has made watching folders very easy for us by including the FileSystemWatcher type with the .NET Framework. The only thing we need to do to watch the folder is set the path we wish to monitor, then install an event handler on the Created event. Other events are available for modifications, deletions, and attribute changes, but we’re going to ignore those for now. Once the FileSystemWatcher is initialized, we can instantiate our WorkflowRuntime instance, register our WorkflowCompleted and WorkflowTerminated handlers, and finally start watching for new file creations. Listing 2 below shows the modifications made to Main, but don’t worry when you see some of the Visual Studio generated pieces missing. They’ll make their reappearance soon.
FileSystemWatcher
Created
FileSystemWatcher
WorkflowCompleted
// our workflow runtime instance - this object must be disposed
static WorkflowRuntime workflowRuntime = null;
static void Main(string[] args)
{
// validate our command line for proper usage
if (args.Length != 1)
{
Console.WriteLine("Usage: ImageCleaner.exe <Full Path of Folder to Watch>");
return;
}
// get the path to watch and ensure it is a valid path
// before we move forward...
string folderToWatch = args[0];
if (System.IO.Directory.Exists(folderToWatch) != true)
{
Console.WriteLine("Command line argument \'" +
folderToWatch + "\' is not a valid path");
return;
}
// create a file system watcher to begin watching the folder
// passed via the command line
FileSystemWatcher fileSystemWatcher = new FileSystemWatcher();
fileSystemWatcher.Path = folderToWatch;
// setup our listener to monitor changes
fileSystemWatcher.Created +=
new FileSystemEventHandler(OnFileSystemWatcherCreated);
// initialize the runtime in this program
using (workflowRuntime = new WorkflowRuntime())
{
// ensure we handle the completed and terminated events
workflowRuntime.WorkflowCompleted +=
new EventHandler<WorkflowCompletedEventArgs>(OnWorkflowCompleted);
workflowRuntime.WorkflowTerminated +=
new EventHandler<WorkflowTerminatedEventArgs>(OnWorkflowTerminated);
// start watching
fileSystemWatcher.EnableRaisingEvents = true;
// the watcher will continue watching until we are told to stop watching
Console.WriteLine("Press \'q\' to quit watching the folder...");
while (Console.Read() != 'q')
{
; // do nothing - continue to process and wait
}
}
}
Now that Main is complete, we need to focus on fleshing out the actions required whenever the Created event is fired. When using the FileSystemWatcher type, it is extremely important to think through how you’ll know the file is completely present at the folder location being monitored. The event fires as soon as the first byte gets written to the file, followed by OnChanged events to notify us of additional file actions like appends. As a result, you have to use some sort of heuristic to know the file has been completely written to disk. Listing 3 below shows our handler and the heuristic chosen — code that looks for an exclusive lock on the file being written. Once we acquire the lock, we know the file is available. If we don’t acquire the lock within the timeout specified (we chose 5 minutes), we exit the loop and throw an exception. This heuristic doesn’t support many common cases—file writes which take longer than 5 minutes for one—so you should modify as appropriate to handle your specific needs.
OnChanged
static void OnFileSystemWatcherCreated(object sender, FileSystemEventArgs e)
{
// Get the current time to test timeout
DateTime t0 = DateTime.Now;
// By default, the file is not completely available
bool fileAvailable = false;
// Stop checking the file if the Timeout duration is exceeded
TimeSpan Timeout = new TimeSpan(0, 5, 0);
while (DateTime.Now - t0 < Timeout)
{
try
{
// If the file can be opened exclusively, then it is available
using (FileStream fs = new FileStream(e.FullPath, FileMode.Open,
FileAccess.Read, FileShare.None))
{
fileAvailable = true;
break;
}
}
catch (IOException)
{
// The file is still being written, wait and try again
System.Threading.Thread.Sleep(100);
}
}
// If the file is still not available, then a timeout occurred
if (!fileAvailable)
{
throw new ApplicationException(
string.Format("File lock timeout: {0}", e.FullPath));
}
// the file is available...so, we can process that file
ProcessFile(e.FullPath);
}
Once the file is available, we call ProcessFile, which is shown in Listing 4. As promised, the code that creates the WorkflowInstance representing our workflow makes its reappearance. The code is largely unchanged from the code Visual Studio generated for us as we began this project. The primary difference is we pass the path of the newly created file (InputFile), and the path to the “cleaned” file we wish to create (OutputFile), to our workflow instance. These values (InputFile and OutputFile) are used to set properties contained in the ImageCleanerWF type, and the names much match exactly, or an exception will be thrown. Finally, because our workflow is creating a new file, we need to return immediately if the newly created file in the folder is the one we just created.
ProcessFile
InputFile
OutputFile
ImageCleanerWF
// our wait handle to ensure we don't exit the application prematurely
static AutoResetEvent waitHandle = new AutoResetEvent(false);
// the last file we created via the workflow
static string lastWorkflowOutputFile;
static void ProcessFile(string file)
{
// we don't want to process the file we just created
if (file == lastWorkflowOutputFile)
return;
// make sure our wait handle is non-signaled
waitHandle.Reset();
// determine the file extension of the file so we can
// create a new one for our sample output
string fileExtension = Path.GetExtension(file);
string newFileText = "_clean" + ".pdf";
// create a dictionary to pass the path to our workflow
Dictionary<string, object> myParams = new Dictionary<string, object>();
myParams.Add("InputFile", file);
myParams.Add("OutputFile", file.Replace(fileExtension, newFileText));
// create a new instance of our workflow and begin to process
WorkflowInstance instance =
workflowRuntime.CreateWorkflow(typeof(ImageCleaner.ImageCleanerWF), myParams);
instance.Start();
// wait until we're signaled to continue - we only want to process one workflow
// at a time for now
waitHandle.WaitOne();
}
An important aspect of our application we haven’t touched upon is threading. We’re not going to go too deep into the topic; however, you should know WF is not built with a specific threading model in mind. Instead, it allows the host application to dictate how a WorkflowInstance is to run via a scheduler. By default, the DefaultSchedulerService is installed when the WorkflowRuntime is created, and results in each workflow instance running on a thread from the thread pool. This default is perfectly fine for applications which are starting workflows from the application’s primary thread. However, if I’m starting a workflow from a thread pool thread (not the application’s primary thread), using the DefaultSchedulerService would cause a second thread to be claimed from the thread pool, which is not very scalable. To fix this, you would use the ManualSchedulerService to run the workflow on the calling thread. It is common to host the WF runtime using this technique in ASP.NET applications, and if you look closely, our folder monitor could also benefit from this optimization. FileSystemWatcher events are handled on a thread pool thread, so our current implementation causes a second thread pool thread to be claimed. Fine for demonstration purposes, but limiting when you’re trying to scale.
DefaultSchedulerService
ManualSchedulerService
With our threading discussion out of the way, finally, Listing 5 shows the handlers for WorkflowCompleted and WorkflowTerminated. We must handle these events so our wait handle can be properly signaled. Otherwise, a deadlock would result.
static void OnWorkflowCompleted(object sender, WorkflowCompletedEventArgs e)
{
// get the names of the files we just processed\created
string inputFile = (string)e.OutputParameters["InputFile"];
string outputFile = (string)e.OutputParameters["OutputFile"];
// store the name of the output file, so we make sure we don't create again
lastWorkflowOutputFile = outputFile;
Console.WriteLine("\"" + inputFile + "\" has been cleaned and output as \"" +
outputFile + "\"");
waitHandle.Set();
}
static void OnWorkflowTerminated(object sender, WorkflowTerminatedEventArgs e)
{
Console.WriteLine(e.Exception.Message + ": " +
e.Exception.InnerException.Message);
waitHandle.Set();
}
Enough of the framework goo! Actually, if you take a step back and think about what we’ve accomplished so far, we’ve done an awful lot with little code. We’ve got a working application that monitors a folder of our choosing, and hosts a robust workflow engine that takes our workflow definition, loads it into memory, creates a thread for our workflow to run on, and schedules it for execution. Whew! But I digress; now it’s time for the fun part — dragging and dropping our way to imaging workflow nirvana.
Of all the benefits WF brings to the table, perhaps the greatest advantage is the bridge built beween the technical and business sides of the house. It is possible to build WF workflows in code; however, a picture is worth a thousand words–representing a business process in a graphical designer, using flowchart-like layout, allows a level of visibility simply not possibly in code. So, let’s get started…
When we created our Sequential Workflow Console Application project, the project template created a code-based workflow named Workflow1, which we later renamed ImageCleanerWF. When you double-click on our workflow in the solution explorer, you’ll see the design surface loaded and a list of WF activities available in the toolbox.
To define a workflow in WF, we organize reusable pieces of functionality called activities and link them together through the inputs and outputs of those activities. The activities available out of the box are fairly general in nature, and while useful, do not solve domain-specific problems. However, third-parties like Pegasus Imaging are encouraged to supplement those out of the box activities with their own domain-specific solutions. Figure 2 also shows a partial set of activities delivered by Pegasus Imaging with our ScanFix Xpress 5.1 document image cleanup toolkit. For a complete list of the activities included in ScanFix Xpress 5.1 and other Pegasus Imaging toolkits, please visit us here
Now, let’s get started building our imaging workflow.
In our scenario, we’re watching a folder for new incoming files from a scanner or other source. Those images need some sort of cleanup — in our case deskew and despeckle — then we want to save the output as a PDF file. To get started, we’ll drag some activities onto our designer surface, starting with the LoadImage activity. Then, because ScanFix Xpress 5.1 only works on bitonal (i.e. black and white) images, we’ll need to add an IfElse activity to check for a proper image type. If the image loaded can be processed by ScanFix, we’ll process it using the Deskew and Despeckle activities, then save to disk as a PDF using the SaveImagePDF activity. Otherwise, we’ll skip the cleanup, and save. With the activities arranged in the proper manner, the designer surface will look like that shown in Figure 3 below.
LoadImage
IfElse
Deskew
Despeckle
SaveImagePDF
At this point, the control flow of our business process has been defined through our arrangement of WF activities on the design surface. But, we’re not done yet. If you look at Figure 3 closely, you’ll see a series of exclamation marks with drop downs telling you something isn’t quite right. This feedback is provided by individual activities through something called a validator. In our case, the validators for our activities are telling us to link our activities together so the data flows between them. We link our activities together using data binding.
Data binding allows us to specify, in a declarative fashion, where a specific piece of data should come from. To demonstrate how binding works, we’ll set the FileName property on the LoadImage activity. If you recall from Listing 4 above, we passed two paramaters to the workflow — InputFile and OutputFile. We want the FileName property to be set to the value passed in the InputFile parameter, and this is done via the dialog shown in Figure 4. To launch this dialog from Visual Studio, select the LoadImage activity, then in the property designer, double click on the Bind Property icon in the FileName header box.
FileName
LoadImage
FileName
Bind Property
At this point, intuition takes over and explanation becomes secondary. All you have to do is select the InputFile item in the tree, and click OK. Voila! We’ve now linked the FileName property of our LoadImage activity to the InputFile parameter. For those following along in Visual Studio, you’ll also see the exclamation mark go away in the designer once the FileName property has been set. This occurs because the validator for the LoadImage activity knows the activity has been properly initialized.
Now that we have the LoadImage activity ready to go, we can continue with the other activities by linking together inputs and outputs. We won’t go through each data bind, but there is one important aspect of this workflow we haven’t covered — the Condition activity for the ifElseBranchActivity1. The validator for this activity requires the Condition property be set so that a decision can be made on which branch to go down. It is possible to define this condition via code, or declaratively using a rule. Just to keep things simple, and to avoid a deep discussion of declarative rules in WF, we’re going to use code. All you do is select Code Condition in the Condition drop-down, and specify a method signature. The actual code for this condition is shown in Listing 5.
Condition
ifElseBranchActivity1
private void OnBitonal(object sender, ConditionalEventArgs e)
{
if (this.loadImage.OutputImage.PixelFormat
== System.Drawing.Imaging.PixelFormat.Format1bppIndexed)
{
e.Result = true;
}
}
As shown, the method determines if the image loaded is a 1-bit image. If it is, we’ll execute those activities contained within ifElseBranchActivity1; otherwise, those activities in ifElseBranchActivity2 will run. With this last piece in place, we end up with a complete, graphical representation of our business process — and all for 8 lines of code that wouldn’t have even been required if we used a declarative rule. How’s that for efficient process design!
ifElseBranchActivity2
Part 1 showed how there are minimally two pieces required for a WF workflow to run — an application host for the WF runtime, and the workflow itself. For those who are writing their own WF applications from scratch, you’re going to have to write the code to host the WF runtime in some form or fashion. You might choose to host the runtime in a console application like we did in Part 1, a Windows service, or perhaps even an ASP.NET application. However, if your goal is to write workflows for existing applications that host the WF runtime for you, we don’t have to worry about runtime hosting at all. All we have to worry about is developing our workflow and being a good citizen while integrating with the application we’re targeting. Today, our primary target is Microsoft Office SharePoint Server 2007 (MOSS), which uses WF for its workflow functionality. In the future, our target might be BizTalk, or applications that decide to use WF as their workflow technology. To demonstrate how WF and Pegasus Imaging’s activities can be used in an application that hosts the WF runtime for us, we’re going to rebuild the workflow from Part 1 targeted for MOSS. We won’t go into all the details of how WF and MOSS work, but we’ll whet the appetite just enough to show how WF makes workflow definition within MOSS easy.
The following sections assume you have a properly configured MOSS development environment. This typically includes an installation of MOSS either on your development machine or some readily accessible location. For the steps to succeed, the project template will need access to MOSS .NET assemblies — primarily Microsoft.SharePoint.
Just as we did in Part 1, launch Visual Studio 2008, and bring up the New Project dialog. Under the Visual C# heading, select Workflow as the project type, and then select SharePoint 2007 Sequential Workflow as the project template. Enter a name for your project, click OK, and the project template wizard will startup.
Prior to Visual Studio 2008, deployment of SharePoint workflows to the server was a bit cumbersome, but the new wizards simplify the process greatly. First, the project template wizard will prompt you for the name you wish to use for the workflow within SharePoint along with the SharePoint server you’ll use to debug and deploy the workflow.
Once the name and project site have been established, the template will ask you if you want Visual Studio to automatically associate the workflow with a library or list in SharePoint. We won’t go into a detailed explanation of the SharePoint object model here, but you do need to know that you have to tie your workflow to one of the two. SharePoint uses this association to pass data to the workflow when it runs. For example, if you associate the workflow to the Documents library, the workflow will run on a specific item within that library. Also, workflows in SharePoint log details about their operation using a history list and track tasks per workflow participant, so you can choose which of these you wish to use for your workflow in the same dialog.
Finally, the last step of the project template wizard will ask how you’d like the workflow to be started. There are three options — you can start it manually, you can start the workflow when a new item is created in the list specified, or you can start the workflow when an item is modified. For simplicity, we’re just going to have our workflow start manually.
At this point, Visual Studio has everything it needs to generate the project, so we can click Finish, let the tool do its thing, and begin concentrating on what we want the workflow to do.
Once the project has been generated, you have everything you need to build and deploy your workflow without the worry of hosting the WF runtime. A default workflow is created as part of the project along with a couple of XML files that contain SharePoint deployment information and a strong name key file to sign the assembly. The first XML file, feature.xml, exists to inform SharePoint of a new feature being installed into the system and allows us to set a title and description for that feature. This file also contains a reference to workflow.xml, which lists the details for the workflow being installed. As you can probably imagine, there’s an awful lot of detail being left out of this description, but luckily we don’t have too much to worry about. The wizard took care of things for us. For now, and to keep things simple, we’re not going to rename the default workflow to something more meaningful. If we did rename the workflow, we’d have to worry about updating the project in several places, so for now, we won’t confuse matters.
To get started, make sure the WF designer surface is visible by double-clicking on Workflow1.cs in the solution explorer. The first thing you’ll notice when the designer is visible is an activity named onWorkflowActivated1 of type OnWorkflowActivated already present on the surface. This activity acts as the bridge between SharePoint and your custom workflow, and through its WorkflowProperties property, provides information regarding the item and list the workflow should operate upon. The default designer surface is shown in Figure 10 below.
onWorkflowActivated1
OnWorkflowActivated
WorkflowProperties
At this point, we have a workflow which doesn’t do anything, but is fully deployable to our SharePoint site. To do so, all we have to do is hit Ctrl + F5 within Visual Studio 2008 (or F5 if you wish to run in the debugger) and let the tools do their work. Once your workflow is deployed, the system will navigate to the site you specified when we created the project so you can select the item you wish to use as input to the workflow. To run the workflow, you need to select Workflows from the item drop-down as shown in the figure below.
Clicking on Workflows will bring up a list of workflows which can be run for this SharePoint item. All you need to do to run is click ImageCleanerSP. When the workflow is complete, the item’s view in its library will show a status of Completed for ImageCleanerSP.
Before we continue, let’s recap the steps we’ve covered so far:
OnWorkflowActivated
As you can see, there is quite a bit to understand, but this time, there was no code to write — only a bit of configuration to complete. But now that’s done, we get to the fun part.
To build our workflow, we’ll follow the same drag-and-drop sequence we used in Part 1 to build our workflow for the command-line application. However, when you add activities to the designer surface, we must make sure all activities are added after the OnWorkflowActivated activity. Once we add our activities to the surface, it will look like that shown in the figure below. Just as we saw in Part 1, we’re not done after we organize the activities on the design surface. We also have to connect the inputs and outputs of each activity, and this is exactly the same as it was in Part 1, with a slight twist.
If you recall from Part 1, we received the input file name and output file name as parameters in the call to CreateInstance. The LoadImage and SaveImagePDF activities bound to those parameters to resolve the FileName property each activity requires to run. But in our SharePoint implementation, we don’t have a command line application passing parameters. Instead, we have WorkflowProperties from the OnWorkflowActivated activity that provides information required for the workflow to run, including the name of the item we’re to process. There is a bit of work to transform the item passed by SharePoint into an input the LoadImage activity can accept (LoadImage only loads from a file in the initial release). For brevity’s sake, we won’t explain the details here, but to learn more, have a look at the samples which accompany this article. We basically take the SharePoint item, write the item to a temp file we can load from, do our imaging work, then upload the result back to SharePoint.
CreateInstance
Once the additional activities have been added to transform SharePoint items into inputs acceptable for Pegasus’ activities, your designer should look like the figure below.
To run our completed workflow, simply use F5 deployment, select your item, and run the workflow as we did before. If everything works as it should, you should have a new document in your SharePoint library which has been cleaned (if 1-bit) and converted to PDF. To continue your exploration into WF, you might try modifying the workflow slightly by adding in an additional activity. All you have to do is drag the desired activity to the surface, hook its inputs and outputs, and redeploy.
We have covered an awful lot, and I hope this explanation of WF and examples of what can be accomplished have piqued your interest in the technology. Ultimately, WF is only going to be as successful as the development community decides to make it — by hosting the WF runtime in their applications and developing domain-specific activities. Pegasus Imaging Corporation has committed to deliver imaging activities as the market demands, so please let us know what types of activities you’d like to see. In the meantime, check out our current offerings. | http://www.codeproject.com/Articles/24819/Building-Image-Based-Workflows-with-Windows-Workfl?msg=4724430 | CC-MAIN-2015-06 | refinedweb | 4,787 | 51.28 |
Have you ever found yourself in a situation where you needed to keep track of whether or not you’ve seen an item, but the number of items you have to keep track of is either gigantic or completely unbounded?
This comes up a lot in “massive data” situations (like internet search engines), but it can also come up in games sometimes – like maybe having a monster in an MMO game remember which players have tried to attack it before so it can be hostile when it sees them again.
One solution to the game example could be to keep a list of all players the monster had been attacked by, but that will get huge and eat up a lot of memory and take time to search the list for a specific player.
You might instead decide you only want to keep the last 20 players the monster had been attacked by, but that still uses up a good chunk of memory if you have a lot of different monsters tracking this information for themselves, and 20 may be so low, that the monster will forget people who commonly attack it by the time it sees them again.
Enter The Bloom Filter
There is actually an interesting solution to this problem, using a probabilistic data structure called a bloom filter – and before you ask, no, it has nothing to do with graphics. It was invented by a guy named Burton Howard Bloom in 1970.
A bloom filter basically has M number of bits as storage and K number of hashes.
To illustrate an example, let’s say that we have 10 bits and only 1 hash.
When we insert an item, what we want to do is hash that item and then modulus that has value against 10 to get a pseudo-random (but deterministic) value 0-9. That value is the index of the bit we want to set to true. After we set that bit to true, we can consider that item is inserted into the set.
When we want to ask if an item exists in a given bloom filter, what we do is again hash the item and modulus it against 10 to get the 0-9 value again. If that bit is set to false, we can say that item is NOT in the set with certainty, but if it’s true we can only say it MIGHT be in the set.
If the bit is true, we can’t say that for sure it’s part of the set, because something else may have hashed to the same bit and set it, so we have to consider it a maybe, not a definite yes. In fact, with only 10 bits and 1 hash function, with a good hash function, there is a 10% chance that any item we insert will result in the same bit being set.
To be a little more sure of our “maybe” being a yes, and not a false positive, we can do two things… we can increase the number of bits we use for the set (which will reduce collisions), or we can increase the number of hashes we do (although there comes a point where adding more hashes starts decreasing accuracy again).
If we add a second hash, all that means is that we will do a second hash, get a second 0-9 value, and write a one to that bit AS WELL when we insert an item. When checking if an item exists in a set, we also READ that bit to see if it’s true.
For N hashes, when inserting an item into a bloom filter, you get (up to) N different bits that you need to set to 1.
When checking if an item exists in a bloom filter, you get (up to) N different bits, all of which need to be 1 to consider the item in the set.
There are a few mathematical formulas you can use to figure out how many bits and hashes you would want to use to get a desired reliability that your maybes are in fact yeses, and also there are some formulas for figuring out the probability that your maybe is in fact a yes for any given bloom filter in a runtime state.
Depending on your needs and usage case, you may treat your “maybe” as a “yes” and move on, or you could treat a “maybe” as a time when you need to do a more expensive test (like, a disk read?). In those situations, the “no” is the valuable answer, since it means you can skip the more expensive test.
Estimating Item Count In Bloom Filters
Besides being able to test an item for membership, you can also estimate how many items are in any given bloom filter:
EstimatedCount = -(NumBits * ln(1 – BitsOn / NumBits)) / NumHashes
Where BitsOn is the count of how many bits are set to 1 and ln is natural log.
Set Operations On Bloom Filters
If you have two bloom filters, you can do some interesting set operations on them.
Union
One operation you can do with two bloom filters is union them, which means that if you have a bloom filter A and bloom filter B, you end up with a third bloom filter C that contains all the unique items from both A and B.
Besides being able to test this third bloom filter to see if it contains specific items, you can also ask it for an estimated count of objects it contains, which is useful for helping figure out how similar the sets are.
Essentially, if A estimates having 50 items and B estimates having 50 items, and their union, C, estimates having 51 items, that means that the items in A and B were almost all the same (probably).
How you union two bloom filters is you just do a bitwise OR on every bit in A and B to get the bits for C. Simple and fast to calculate.
Intersection
Another operation you can do with two bloom filters is to calculate their intersection. The intersection of two sets is just the items that the two sets have in common.
Again, besides being able to test this third bloom filter for membership of items, you can also use it to get an estimated count of objects to help figure out how similar the sets are.
Similary to the union, you can reason that if the intersection count is small compared to the counts of the individual bloom filters that went into it, that they were probably not very similar.
There are two ways you can calculate the intersection of two bloom filters.
The first way is to do a bitwise AND on every bit in A and B to get the bits for C. Again, super simple and faster to calculate.
The other way just involves some simple math:
Count(Intersection(A,B)) = (Count(A) + Count(B)) – Count(Union(A,B))
Whichever method is better depends on your needs and your usage case.
Jaccard Index
Just like I talked about in the KMV post two posts ago, you can also calculate an estimated Jaccard Index for two bloom filters, which will give you a value between 0 and 1 that tells you how similar two sets are.
If the Jaccard index is 1, that means the sets are the same and contain all the same items. If the Jaccard index is 0, that means the sets are completely different. If the Jaccard index is 0.5 that means that they have half of their items in common.
To calculate the estimated Jaccard Index, you just use this simple formula:
Jaccard Index = Count(Intersection(A,B)) / Count(Union(A,B))
Estimating False Positive Rate
The more items you insert into a bloom filter the higher the false positive rate gets, until it gets to 100% which means all the bits are set and if you ask if it contains an item, it will never say no.
To combat this, you may want to calculate your error rate at runtime and maybe spit out a warning if the error rate starts getting too high, so that you know you need to adjust the number of bits or number of hashes, or at very least you can alert the user that the reliability of the answers has degraded.
Here is the formula to calculate the false positive rate of a bloom filter at runtime:
ErrorRate = (1 – e^(-NumHashes * NumItems / NumBits))^NumHashes
NumItems is the number of unique items that have been inserted into the bloom filter. If you know that exact value somehow you can use that real value, but in the more likely case, you won’t know the exact value, so you can use the estimated unique item count formula described above to get an estimated unique count.
Managing the Error Rate of False Positives
As I mentioned above, there are formulas to figure out how many bits and how many hashes you need, to store a certain number of items with a specific maximum error rate.
You can work this out in advance by figuring out about how many items you expect to see.
First, you calculate the ideal bit count:
NumBits = – (NumItems * ln(DesiredFalsePositiveProbability)) / (ln(2)^2)
Where NumItems is the number of items you expect to put into the bloom filter, and DesiredFalsePositiveProbability is the error rate you want when the bloom filter has the expected number of items in it. The error rate will be lower until the item count reaches NumItems.
Next, you calculate the ideal number of hashes:
NumHashes = NumBits / NumItems * ln(2)
Then, you just create your bloom filter, using the specified number of bits and hashes.
Example Code
Here is some example bloom filter c++ code with all the bells and whistles. Instead of using multiple hashes, I just grabbed some random numbers and xor them against the hash of each item to make more deterministic but pseudo-random numbers (that’s what a hash does too afterall). If you want to use a bloom filter in a more serious usage case, you may want to actually use multiple hashes, and you probably want to use a better hashing algorithm than std::hash.
#include #include #include #include #include #include #include // If you get a compile error here, remove the "class" from this enum definition. // It just means your compiler doesn't support enum classes yet. enum class EHasItem { e_no, e_maybe }; // The CBloomFilter class template <typename T, unsigned int NUMBYTES, unsigned int NUMHASHES, typename HASHER = std::hash> class CBloomFilter { public: // constants static const unsigned int c_numHashes = NUMHASHES; static const unsigned int c_numBits = NUMBYTES*8; static const unsigned int c_numBytes = NUMBYTES; // friends template friend float UnionCountEstimate(const CBloomFilter& left, const CBloomFilter& right); template friend float IntersectionCountEstimate (const CBloomFilter& left, const CBloomFilter& right); // constructor CBloomFilter (const std::array& randomSalt) : m_storage() // initialize bits to zero , m_randomSalt(randomSalt) // store off the random salt to use for the hashes { } // interface void AddItem (const T& item) { const size_t rawItemHash = HASHER()(item); for (unsigned int index = 0; index < c_numHashes; ++index) { const size_t bitIndex = (rawItemHash ^ m_randomSalt[index])%c_numBits; SetBitOn(bitIndex); } } EHasItem HasItem (const T& item) const { const size_t rawItemHash = HASHER()(item); for (unsigned int index = 0; index < c_numHashes; ++index) { const size_t bitIndex = (rawItemHash ^ m_randomSalt[index])%c_numBits; if (!IsBitOn(bitIndex)) return EHasItem::e_no; } return EHasItem::e_maybe; } // probabilistic interface float CountEstimate () const { // estimates how many items are actually stored in this set, based on how many // bits are set to true, how many bits there are total, and how many hashes // are done for each item. return -((float)c_numBits * std::log(1.0f - ((float)CountBitsOn() / (float)c_numBits))) / (float)c_numHashes; } float FalsePositiveProbability (size_t numItems = -1) const { // calculates the expected error. Since this relies on how many items are in // the set, you can either pass in the number of items, or use the default // argument value, which means to use the estimated item count float numItemsf = numItems == -1 ? CountEstimate() : (float)numItems; return pow(1.0f - std::exp(-(float)c_numHashes * numItemsf / (float)c_numBits),(float)c_numHashes); } private: inline void SetBitOn (size_t bitIndex) { const size_t byteIndex = bitIndex / 8; const uint8_t byteValue = 1 << (bitIndex%8); m_storage[byteIndex] |= byteValue; } inline bool IsBitOn (size_t bitIndex) const { const size_t byteIndex = bitIndex / 8; const uint8_t byteValue = 1 << (bitIndex%8); return ((m_storage[byteIndex] & byteValue) != 0); } size_t CountBitsOn () const { // likely a more efficient way to do this but ::shrug:: size_t count = 0; for (size_t index = 0; index < c_numBits; ++index) { if (IsBitOn(index)) ++count; } return count; } // storage of bits std::array m_storage; // Storage of random salt values // It could be neat to use constexpr and __TIME__ to make compile time random numbers. // That isn't available til like c++17 or something though sadly. const std::array& m_randomSalt; }; // helper functions template float UnionCountEstimate (const CBloomFilter& left, const CBloomFilter& right) { // returns an estimated count of the unique items if both lists were combined // example: (1,2,3) union (2,3,4) = (1,2,3,4) which has a union count of 4 CBloomFilter temp(left.m_randomSalt); for (unsigned int index = 0; index < left.c_numBytes; ++index) temp.m_storage[index] = left.m_storage[index] | right.m_storage[index]; return temp.CountEstimate(); } template float IntersectionCountEstimate (const CBloomFilter& left, const CBloomFilter& right) { // returns an estimated count of the number of unique items that are shared in both sets // example: (1,2,3) intersection (2,3,4) = (2,3) which has an intersection count of 2 CBloomFilter temp(left.m_randomSalt); for (unsigned int index = 0; index < left.c_numBytes; ++index) temp.m_storage[index] = left.m_storage[index] & right.m_storage[index]; return temp.CountEstimate(); } float IdealBitCount (unsigned int numItemsInserted, float desiredFalsePositiveProbability) { // given how many items you plan to insert, and a target false positive probability at that count, this returns how many bits // of flags you should use. return (float)-(((float)numItemsInserted*log(desiredFalsePositiveProbability)) / (log(2)*log(2))); } float IdealHashCount (unsigned int numBits, unsigned int numItemsInserted) { // given how many bits you are using for storage, and how many items you plan to insert, this is the optimal number of hashes to use return ((float)numBits / (float)numItemsInserted) * (float)log(2.0f); } // random numbers from random.org // // in 64 bit mode, size_t is 64 bits, not 32. The random numbers below will be all zero in the upper 32 bits! static const std::array s_randomSalt = { 0x6ff3f8ef, 0x9b565007, 0xea709ce4, 0xf7d5cbc7, 0xcb7e38e1, 0xd54b5323, 0xbf679080, 0x7fb78dee, 0x540c9e8a, 0x89369800 }; // data for adding and testing in our list static const char *s_dataList1[] = { "hello!", "blah!", "moo", nullptr }; static const char *s_dataList2[] = { "moo", "hello!", "mooz", "kitty", "here is a longer string just cause", nullptr }; static const char *s_askList[] = { "moo", "hello!", "unf", "boom", "kitty", "mooz", "blah!", nullptr }; // driver program void WaitForEnter () { printf("nPress Enter to quit"); fflush(stdin); getchar(); } void main(void) { CBloomFilter set1(s_randomSalt); CBloomFilter set2(s_randomSalt); std::set actualSet1; std::set actualSet2; printf("Creating 2 bloom filter sets with %u bytes of flags (%u bits), and %u hashes.nn", set1.c_numBytes, set1.c_numBits, set1.c_numHashes); // create data set 1 unsigned int index = 0; while (s_dataList1[index] != nullptr) { printf("Adding to set 1: "%s"n", s_dataList1[index]); set1.AddItem(s_dataList1[index]); actualSet1.insert(s_dataList1[index]); index++; } // create data set 2 printf("n"); index = 0; while (s_dataList2[index] != nullptr) { printf("Adding to set 2: "%s"n", s_dataList2[index]); set2.AddItem(s_dataList2[index]); actualSet2.insert(s_dataList2[index]); index++; } // query each set to see if they think that they contain various items printf("n"); index = 0; while (s_askList[index] != nullptr) { printf("Exists: "%s"? %s & %s (actually %s & %s)n", s_askList[index], set1.HasItem(s_askList[index]) == EHasItem::e_maybe ? "maybe" : "no", set2.HasItem(s_askList[index]) == EHasItem::e_maybe ? "maybe" : "no", actualSet1.find(s_askList[index]) != actualSet1.end() ? "yes" : "no", actualSet2.find(s_askList[index]) != actualSet2.end() ? "yes" : "no"); index++; } // show false positive rates printf ("nFalse postive probability = %0.2f%% & %0.2f%%n", set1.FalsePositiveProbability()*100.0f, set2.FalsePositiveProbability()*100.0f); printf ("False postive probability at 10 items = %0.2f%%n", set1.FalsePositiveProbability(10)*100.0f); printf ("False postive probability at 25 items = %0.2f%%n", set1.FalsePositiveProbability(25)*100.0f); printf ("False postive probability at 50 items = %0.2f%%n", set1.FalsePositiveProbability(50)*100.0f); printf ("False postive probability at 100 items = %0.2f%%n", set1.FalsePositiveProbability(100)*100.0f); // show ideal bit counts and hashes. const unsigned int itemsInserted = 10; const float desiredFalsePositiveProbability = 0.05f; const float idealBitCount = IdealBitCount(itemsInserted, desiredFalsePositiveProbability); const float idealHashCount = IdealHashCount((unsigned int)idealBitCount, itemsInserted); printf("nFor %u items inserted and a desired false probability of %0.2f%%nYou should use %0.2f bits of storage and %0.2f hashesn", itemsInserted, desiredFalsePositiveProbability*100.0f, idealBitCount, idealHashCount); // get the actual union std::set actualUnion; std::for_each(actualSet1.begin(), actualSet1.end(), [&actualUnion] (const std::string& s) { actualUnion.insert(s); }); std::for_each(actualSet2.begin(), actualSet2.end(), [&actualUnion] (const std::string& s) { actualUnion.insert(s); }); // get the actual intersection std::set actualIntersection; std::for_each(actualSet1.begin(), actualSet1.end(), [&actualIntersection,&actualSet2] (const std::string& s) { if (actualSet2.find(s) != actualSet2.end()) actualIntersection.insert(s); }); // caclulate actual jaccard index float actualJaccardIndex = (float)actualIntersection.size() / (float)actualUnion.size(); // show the estimated and actual counts, and error of estimations printf("nSet1: %0.2f estimated, %u actual. Error: %0.2f%%n", set1.CountEstimate(), actualSet1.size(), 100.0f * ((float)set1.CountEstimate() - (float)actualSet1.size()) / (float)actualSet1.size() ); printf("Set2: %0.2f estimated, %u actual. Error: %0.2f%%n", set2.CountEstimate(), actualSet2.size(), 100.0f * ((float)set2.CountEstimate() - (float)actualSet2.size()) / (float)actualSet2.size() ); float estimatedUnion = UnionCountEstimate(set1, set2); float estimatedIntersection = IntersectionCountEstimate(set1, set2); float estimatedJaccardIndex = estimatedIntersection / estimatedUnion; printf("Union: %0.2f estimated, %u actual. Error: %0.2f%%n", estimatedUnion, actualUnion.size(), 100.0f * (estimatedUnion - (float)actualUnion.size()) / (float)actualUnion.size() ); printf("Intersection: %0.2f estimated, %u actual. Error: %0.2f%%n", estimatedIntersection, actualIntersection.size(), 100.0f * (estimatedIntersection - (float)actualIntersection.size()) / (float)actualIntersection.size() ); printf("Jaccard Index: %0.2f estimated, %0.2f actual. Error: %0.2f%%n", estimatedJaccardIndex, actualJaccardIndex, 100.0f * (estimatedJaccardIndex - actualJaccardIndex) / actualJaccardIndex ); WaitForEnter(); }
And here is the output of that program:
In the output, you can see that all the existence checks were correct. All the no’s were actually no’s like they should be, but also, all the maybe’s were actually present, so there were no false positives.
The estimated counts were a little off but were fairly close. The first list was estimated at 2.4 items, when it actually had 3. The second list was estimated at 4.44 items when it actually had 5 items.
It’s reporting a very low false positive rate, which falls in line with the fact that we didn’t see any false positives. The projected false positive rates at 10, 25, 50 and 100 items show us that the set doesn’t have a whole lot more capacity if we want to keep the error rate low.
The union, intersection and jaccard index error rate was pretty low, but the error rate was definitely larger than the false positive rate.
Interestingly, if you look at the part which reports the ideal bit and hash count for 10 items, it says that we should actually use FEWER hashes than we do and a couple less bits. You can actually experiment by changing the number of hashes to 4 and seeing that the error rate goes down. In the example code we are actually using TOO MANY hashes, and it’s hurting our probability rate, for the number of items we plan on inserting.
Interesting Idea
I was chatting with a friend Dave, who said he was using a bloom filter like structure to try and help make sure he didn’t try the same genetic algorithm permutation more than once. An issue with that is that hash collisions could thwart the ability for evolution to happen correctly by incorrectly disallowing a wanted permutation from happening just because it happened to hash to the same value as another permutation already tried. To help this situation, he just biased against permutations found in the data structure, instead of completely blocking them out. Basically, if the permutation was marked as “maybe seen” in the data structure, he’d give it some % chance that it would allow it to happen “again” anyways.
Unfortunately, the idea in general turned out to be impractical. He had about 40 bits of genetic information which is about 1 trillion unique items (2^40).
for being able to store only 1 billion items – which is 1000 times smaller – with 5% false positive rate, that would require about 750MB of storage of bits.
Dropping the requirement to being 25% false positive rate, it still requires 350MB, and to 75% requires 70MB. Even at 99% false positive rate allowed, it requires 2.5MB, and we are still 1000 times too small.
So, for 1 trillion permutations, the size of the bloom filter is unfortunately far too large and he ended up going a different route.
The technique of rolling a random number when you get a maybe is pretty neat though, so wanted to mention it (:
Next Up
We’ve now talked about a probabilistic unique value counter (KMV) that can count the number of unique objects seen.
We then talked about a probabilistic set structure (Bloom Filter) that can keep track of set membership of objects.
How about being able to probabilistically store a list of non unique items?
One way to do this would be to have a count with each item seen instead of only having a bit of whether it’s present or not. When you have a count per item, this is known as a multiset, or the more familiar term: histogram.
If you change a bloom filter to have a count instead of a single bit, that’s called a counting bloom filter and completely works.
There’s a better technique for doing this though called count min sketch. Look for a post soon!
Links
Wikipedia: Bloom Filter
Interactive Bloom Filter Demo
Check this out, it’s a physical implementation of a bloom filter (WAT?!)
Wikipedia: Superimposed code | https://blog.demofox.org/2015/02/08/estimating-set-membership-with-a-bloom-filter/ | CC-MAIN-2022-27 | refinedweb | 3,655 | 50.36 |
PlainLiteral
__NUMBEREDHEADINGS__
-.
- Status of this Document
- This is an editors' draft being developed jointly by the RIF and OWL WGs with support of the Internationalization Core (I18N) WG. Please send comments and questions to public-rdf-text@w3.org (public archive).
Copyright © 2008-2009 W3C® (MIT, ERCIM, Keio), All Rights Reserved. W3C liability, trademark and document use rules apply.
Contents
- 1 Introduction
- 2 Preliminaries
- 3 Definition of the rdf:PlainLiteral Datatype
- 4 Syntax for rdf:PlainLiteral Literals
- 5 Functions on rdf:PlainLiteral Data Values
- 5.1 Functions for Assembling and Disassembling rdf:PlainLiteral Data Values
- 5.2 The Comparison of rdf:PlainLiteral Data Values
- 5.3 Other Functions on rdf:PlainLiteral Data Values
- 6 Acknowledgments
- 7 References
- 8 Appendix: Change Log (Informative)
1 Introduction.)
2 Preliminaries prefix name xs: stands for
- the prefix name rdf: stands for
The names of the built-in functions defined in Section 5 are QNames, as defined in the XML namespaces specification [XML Namespaces]. The following namespace abbreviations are used in Section 5:
- fn stands for the namespace
- plfn stands for the namespace:
- The value space is a set determining the set of values of the datatype. Elements of the value space are called data values.
- The lexical space is a set of strings that can be used to refer to data values. Each member of the lexical space is called a lexical form, and it is mapped to a particular data value.
- The facet space is a set of facet pairs of the form ( F v ), where F is a URI called a constraining facet, and v is an arbitrary data value called a constraining value. Each such facet pair is mapped to a subset of the value space of the datatype.].
3 Definition of the rdf.:
- If "langTag" is empty, then dv is equal to the string "abc" and
- If "langTag" is not empty, then dv is equal to the pair < "abc", "lc-langtag" > where "lc-langtag" is "langTag" normalized to lowercase..
4 Syntax for rdf:PlainLiteral Literals.
5 Functions on rdf:PlainLiteral Data Values].
5.1 Functions for Assembling and Disassembling rdf.
- [ISO/IEC. [Geneva]: International Organization for Standardization. ISO (International Organization for Standardization).
- ,
- [RFC 3986]
- RFC 3986: Uniform Resource Identifier (URI): Generic Syntax. T. Berners-Lee, R. Fielding, and L. Masinter. IETF, January 2005,
- [RFC 4647]
- RFC 4647 - Matching of Language Tags. A. Phillips and M. Davis, IETF, September 2006.
- .
- [UNICODE]
- The Unicode Standard. Unicode The Unicode Consortium, Version 5.1.0, ISBN 0-321-48091-0, as updated from time to time by the publication of new versions. (See for the latest version and additional information on versions of the standard and of the Unicode Character Database)."
- .
- [XPath20]
- XML Path Language (XPath) 2.0. Anders Berglund, Scott Boag, Don Chamberlin, Mary F. Fernández, Michael Kay, Jonathan Robie, and Jérôme Siméon, eds. W3C Recommendation 23 January 2007.
8 Appendix: Change Log (Informative)
8.1 Changes Since Recommendation
This section summarizes the changes to this document since the Recommendation of 27 October, 2009.
- With the publication of the XML Schema Definition Language (XSD) 1.1 Part 2: Datatypes Recommendation of 5 April 2012, the elements of OWL 2 which are based on XSD 1.1 are now considered required, and the note detailing the optional dependency on the XSD 1.1 Candidate Recommendation of 30 April, 2009 has been removed from the "Status of this Document" section. | http://www.w3.org/2007/OWL/wiki/PlainLiteral | CC-MAIN-2016-18 | refinedweb | 565 | 58.58 |
So at start, the door is closed. Every time it sees 3.8VAC, assume the door is moving. First time it moves it is OPENING, so the program would do a requests.post to a specific URL (that is how I get the info). When it stops, do another requests.post to say the door is STOPPED. When it sees the 3.8VAC again, assume the door is CLOSING. Again, when it stops and the 3.8VAC is gone, it is STOPPED, do another requests.post to a URL. I would have three URLs prebuilt for it to post. One for "opening" direction, one for the "closing" direction, one for the "stopped" event. I already have one for the closed state
For the RIGHT door...
Start with rmovlogic = 1 # door is CLOSED
When I GET the 3.8VAC, do a requests.post to my URL and set rmovlogic = 2 # door is OPENING
When I LOSE the 3.8VAC, do a requests.post to my URL and set rmovlogic = 3 # door is STOPPED
When I GET the 3.8VAC, do a requests.post to my URL and set rmovlogic = 4 # door is CLOSING
* every time it reverses, go back and forth between rmovlogic = 2, 3 or 4, depending on direction as long as it is not CLOSED.
If the door direction changes several times before reaching CLOSED, I want to know what its last direction was. This is populated on my phone, determined by the last requests.post URL. Each URL has it own keyword that is interpreted by my phone (opening, stopped, closing, closed).
I will take care of the closed state with a limit switch on pin 40. If that has a ground, then the door is CLOSED. When it gets closed, the rmovlogic would be reset to 1. I already have a requests.post to a URL to pass on that state.
Here's a demo of what I have now, showing the OPEN/CLOSE state monitoring. I think it is recent... ... TVS81/view
And here's how I am monitoring open/closed state of two different doors in one program:
Code: Select all
import requests import RPi.GPIO as GPIO import time GPIO.setmode(GPIO.BOARD) GPIO.setwarnings(False) r = requests.post("") # Door monitor service is active buttonRDPin = 15 # Not used buttonRUPin = 16 buttonLDPin = 38 # Not used buttonLUPin = 40 GPIO.setup(buttonRUPin, GPIO.IN, pull_up_down=GPIO.PUD_UP) GPIO.setup(buttonRDPin, GPIO.IN, pull_up_down=GPIO.PUD_UP) # Not used GPIO.setup(buttonLUPin, GPIO.IN, pull_up_down=GPIO.PUD_UP) GPIO.setup(buttonLDPin, GPIO.IN, pull_up_down=GPIO.PUD_UP) # Not used ledONPin = 32 GPIO.setup(ledONPin, GPIO.OUT) GPIO.output(ledONPin, GPIO.HIGH) # LED on breadboard indicating door monitor service is active llogic = 1 # Initialize door state of left door, assumed to be closed rlogic = 1 # Initialize door state of right door, assumed to be closed while True: buttonState = GPIO.input(buttonRUPin) if buttonState == False: if rlogic == 0: r = requests.post("") # Right door is open rlogic = 1 else: if rlogic == 1: r = requests.post("") # Right door is closed rlogic = 0 buttonState = GPIO.input(buttonLUPin) if buttonState == False: if llogic == 0: r = requests.post("") # Left door is open llogic = 1 else: if llogic == 1: r = requests.post("") # Left door is closed llogic = 0 time.sleep(0.1) | https://www.raspberrypi.org/forums/viewtopic.php?f=37&t=240886& | CC-MAIN-2019-26 | refinedweb | 543 | 69.07 |
Defining Functions
Welcome to the Defining Functions Practice Lab. In this module, you will be provided with the instructions and devices needed to develop your hands-on skills.
Introduction
Welcome to the Defining Functions Practice Lab. In this module, you will be provided with the instructions and devices needed to develop your hands-on skills.
Learning Outcomes
In this module, you will complete the following exercise:
- Exercise 1 - Implementing a Calculator Using Functions
After completing this lab, you will be able to:
- Structure Python programs by defining functions
Exam Objectives
The following exam objectives are covered in this lab:
- 4.1 Construct and analyze code segments that include function definitions
Lab Duration
It will take approximately 15 minutes to complete this lab.
Exercise 1 - Implementing a Calculator Using Functions
A function is a block of program statements, which can be defined once and called repetitively in a program. You have been using built-in functions like print() all this while. This function helps you print any output in no time. However, not all your needs may be met through built-in functions. In these cases, Python allows you to define your own functions.
In Python, a user-defined function is declared with the keyword def and followed by the function name. For example:
def myfunc():
A colon follows the closing parenthesis to suggest that the following block of code will contain the function definition.
Any arguments are specified within the opening and closing parentheses just after the function name, as shown here:
def myfunc(arg1, arg2):
After defining the function name and arguments(s), a block of program statement(s) start at the next line and these statement(s) must be indented. For example:
def myfunc(arg1, arg2):
print (arg1)
print (arg2)
The above function named myfunc() takes two arguments and prints their values.
Once defined, you can call this function from within the Python program using the function name, parenthesis (opening and closing) and parameter(s). For example, to call the myfunc() function, you may use the following statement:
myfunc(3, 4)
The above statement will call the myfunc() function with 3 and 4 as arguments and the function will print 3 and 4 as the output.
You can call the same function to print the string “hello world” too, as follows:
myfunc(“hello”, “world!”)
A user-defined function can also return a value instead of directly printing the result. In Python, the return statement is used to return a value from a function. The return statement without an expression argument returns none.
If you modify the myfunc() function to return the parameters after adding number 1 to each parameter, the function will look as follows:
def myfunc(arg1, arg2):
newarg1 = arg1 + 1
newarg2 = arg2 + 1
return(newarg1, newarg2)
Now in this case, the myfunc() function will not print the result on its own. It will just return two values newarg1 and newarg2. The above function can be called and results can be printed using the following combined statement:
print(myfunc(3, 4))
The above statement will call the myfunc() function with 3 and 4 as arguments. This print function will print the values returned by the myfunc() function.
A user-defined function can be called multiple times. Your own user-defined functions can also be a third-party library/module for other users. In addition to fostering reusability and saving development time, user-defined functions help make the code well organized, easy to maintain, and developer-friendly.
In this exercise, you will perform three tasks. In the first task, you will download the Python program file from the Intranet and open it in the IDLE environment. In the second task, you will write specific functions to perform different mathematical operations on the numbers accepted at runtime and print the results. In the third task, you will modify the program to have the user-defined functions return values instead of directly printing them.
Learning Outcomes
After completing this exercise, you will be able to:
- Structure Python programs by defining functions
IT & Cybersecurity certification hands on practice labs and practice exams for certifications and skill development.
See the full benefits of our immersive learning experience with interactive courses and guided career paths. | https://www.cybrary.it/catalog/practice-labs-module/defining-functions-645406e8-d41c-49b8-b204-920cd5c117c9/ | CC-MAIN-2021-10 | refinedweb | 702 | 51.28 |
Chimera2345 Wrote:I'm just using EventGhost (no AHK at all), got a folder that becomes exclusive when iexplore.exe activates (had problems with the iewrap crashing when going into full screen). My only problem is that the only way to exit is to send ALT-F4, which works fine but if you happen to hit the button more than once it quits XBMC as well. Hopefully the issues with IEwrap and full screen can be fixed and I can use F10 to quit Netflix rather than ALT-F4.
Great plugin BTW!
Crash Wrote:Hello,
I've installed the plugin and everything seems to be working. However, when I play a netflix movie the firefox screen and movie are playing behind the xbmc window. This is on Mac OSX. I can Cmd Tab to switch to firefox and there's my movie playing.
Any help would be appreciated.
Duane
fekker Wrote:in the playercorefactory.xml,try setting hide xbmc to true
<hidexbmc>true</hidexbmc>
Chimera2345 Wrote:Thanks Rob. Do you have to do Alt-F4 twice (once to get out of fullscreen mode)??
Crash Wrote:Regarding the issue with netflix playing behind xbmc, I've tried setting both
<hidexbmc>true</hidexbmc>
<hideconsole>true</hideconsole>
without luck. It does have the affect of making xbmc go away for an instant, but then it comes right back covering the netflix movie.
Is there a setting in xbmc itself somewhere that says to always stay on top?
11:58:55 T:3996 M:3091615744 ERROR: Error Type: exceptions.TypeError
11:58:55 T:3996 M:3091615744 ERROR: Error Contents: argument 1 must be unicode or str
11:58:55 T:3996 M:3091488768 ERROR: Traceback (most recent call last):
File "C:\Documents and Settings\Anthony\Application Data\XBMC\addons\plugin.video.xbmcflicks\default.py", line 26, in ?
import resources.lib.menu as menu
File "C:\Documents and Settings\Anthony\Application Data\XBMC\addons\plugin.video.xbmcflicks\resources\lib\menu.py", line 464, in ?
getEpisodeListing(tvShowID,tvSeasonID,"Disc")
File "C:\Documents and Settings\Anthony\Application Data\XBMC\addons\plugin.video.xbmcflicks\resources\lib\iqueue.py", line 1618, in getEpisodeListing
curX = getMovieDataFromFeed(curX, curQueueItem, False, netflixClient, instantOnly, strType, True)
File "C:\Documents and Settings\Anthony\Application Data\XBMC\addons\plugin.video.xbmcflicks\resources\lib\iqueue.py", line 867, in getMovieDataFromFeed
addLink(curXe.TitleShort,os.path.join(str(REAL_LINK_PATH), str(curXe.TitleShortLink + '.html')), curXe, curX.ID)
File "C:\Documents and Settings\Anthony\Application Data\XBMC\addons\plugin.video.xbmcflicks\resources\lib\iqueue.py", line 187, in addLink
modScripLoc = os.path.join(str(LIB_FOLDER), 'modQueue.py')
File "special://xbmc/system/python/Lib\ntpath.py", line 62, in join
for b in p:
TypeError: argument 1 must be unicode or str
11:58:55 T:3712 M:3092873216 ERROR: XFILE::CDirectory::GetDirectory - Error getting plugin://plugin.video.xbmcflicks/?mode=tvExpandshId70160012seIdFalse
11:58:55 T:3712 M:3092873216 ERROR: CGUIMediaWindow::GetDirectory(plugin://plugin.video.xbmcflicks/?mode=tvExpandshId70160012seIdFalse) failed
pwalter Wrote:I have installed xbmc on an old ATV and enabled the xbmcflick video add-on.
It lets me get through the first few menu item (i.e. new releases etc) but as soon as it to "authenticate" me, I get an error message saying I must first link xbmc at Netflix.
I have a netflix account but I don't see anywhere as to what Netflix "activation code" I should use.
Please help
Quote:Sven72
Expanding TV Episodes
I'm encountering a problem when attempting to expand TV Episodes. | http://forum.kodi.tv/printthread.php?tid=87552&page=15 | CC-MAIN-2016-50 | refinedweb | 580 | 50.43 |
Welcome to the Enterprise Java Technologies Tech Tips for May 27, 2004. Here you'll get tips on using enterprise Java technologies and APIs, such as those in Java 2 Platform, Enterprise Edition (J2EE).
This issue covers:
Converting Your Data Structures to XML
The Enterprise Bean Timer Interface
These tips were developed using themay2004, and the index.html welcome file indicates how to use the sample code. welcome file indicates how to use the sample code. Any
use of this code and/or information below is subject to the license terms.
ttmay2004
index.html
For more Java technology content, visit these sites:
java.sun.com - The latest Java platform releases, tutorials, and
newsletters.
java.net - A web forum for collaborating and building solutions
together.
java.com - The marketplace for Java technology, applications and
services.
The Java platform offers powerful APIs for parsing and generating XML data streams. You might already know how to use JAXP to parse an XML stream into a Document Object Model (DOM) tree in memory. If you don't, see the Tech Tip "Creating Parsers with JAXP." You might also know how use interface java.xml.transform.Transformer to turn a DOM tree into an XML stream. But did you know that with just a few lines of code, you can write any data into XML?
java.xml.transform.Transformer
The following tip shows how to use the standard XML manipulation facilities in the Java platform to create XML from arbitrary data structures. The tip assumes you understand the basics of JAXP and XSL transformations.
This tip is an example of a programming technique for turning any data structure into XML. The example shown here converts an SQL ResultSet object into XML, but you could use the same technique with any data structure.
Println Considered Harmful
Println
The standard Java APIs are fine for parsing and generating XML if data is already represented as XML (in a file or stream), or as a DOM (in memory). But developers often need to encode state from arbitrary data structures into XML. These data structures usually don't have a DOM interface. So developers usually hand-code routines that serialize the data structures (or parts of the structures) to XML using println statements.
That approach is problematic for several reasons. Some of the reasons are:
A better approach is to encode data from the data structures into a DOM tree, and then use XSLT to rearrange the data in the way you want. A Transformer object based on an XSLT stylesheet can add, sort, prune, merge, and otherwise manipulate the nodes in a DOM without first encoding the DOM as XML. After transformation, the Transformer can convert the result of these transformations to any text format.
This approach solves the problems listed above. Specifically:
The question is how to create a DOM tree from an arbitrary data structure? The sample code that accompanies this tip shows how to use the standard Java XML APIs to transform an SQL ResultSet into a DOM tree, and then transform the result to XML or HTML using a stylesheet. You can use the same technique to encode your own data structures as DOM trees.
How to Fool A Parser
The sample code includes a servlet, May2004Servlet. The servlet has a method called getXML that executes an arbitrary SQL query, converts the result to a DOM tree, and writes the result as XML. The servlet also has a method named resultSetToXML, that receives an SQL ResultSet and transforms it to XML.
May2004Servlet
getXML
resultSetToXML
ResultSet
To understand how resultSetToXML works, you must understand how DOM parsers work. Most DOM parsers use a SAX parser to scan XML source streams. A SAX parser scans the XML input text. It sends events to a listener when it encounters specific lexical features, such as the beginning and ending of tags, or the presence of attributes.
A DOM parser defines a callback method that builds a DOM tree in response to a series of SAX parser callbacks. The sample code "fools" the DOM parser by behaving as if it were scanning text, when, in fact, it is really traversing a data structure.
This concept can be a bit difficult to understand at first. Usually, developers define callback methods and framework calls in response to framework events. But the sample code in this example does the opposite. Instead of writing callback functions, the code calls the callback methods provided by the DOM parser. The DOM parser builds the tree.
For example, imagine a parse method that simply makes the following calls:
startDocument();
startElement("A");
startElement("B");
endElement("B");
endElement("A");
endDocument();
With this series of events, the DOM parser creates a DOM tree that corresponds to the following XML document:
<?xml version="1.0" encoding="utf-8"?>
<a><b/></a>
So, to tell a DOM parser to build a DOM tree for your data, just write a class that pretends to be a SAX parser as it traverses your data structure. Then, present the "fake parser" class to a DocumentBuilder. The DocumentBuilder will build a DOM for you. The DOM can then be serialized to XML, or further transformed for other uses.
DocumentBuilder
Let's look at how to set up the Transformer to transform an arbitrary data structure to XML.
Source Code
Here's the code in method resultSetToXML that converts a ResultSet to XML:
protected void resultSetToXML(OutputStream out,
ResultSet rs,
String stylesheet)
throws IOException, ServletException {
// Create reader and source objects
SqlXMLReader sxreader = new SqlXMLReader();
SqlInputSource sis = new SqlInputSource(rs);
The code defines two new classes, SqlXMLReader and SqlInputSource. The SqlXMLReader class is the XML reader for the SAX parser (because it implements XMLReader). The SqlInputSource class simply holds a copy of the ResultSet object for the XML reader to use. You'll soon see how the SqlXMLReader works.
SqlXMLReader
SqlInputSource
XMLReader
The next two lines of resultSetToXML set up the parser to create the DOM tree as output:
// Create SAX source and StreamResult for transform
SAXSource source = new SAXSource(sxreader, sis);
StreamResult result = new StreamResult(out);
These lines create a SAXSource object that associates the XML reader (SqlXMLReader) with the InputSource (SqlInputSource). The code also creates a StreamResult that the XSLT Transformer uses to create the final result as an XML stream.
SAXSource
InputSource
StreamResult
At this point in the code, no actual data transformation has occurred. The next section of the reader sets up the Transformer object to read from the XML source. It then transforms the results into the result stream:
Transformer
// Perform XSLT transform to get results.
// If "stylesheet" is NULL, then use identity
// transform. Otherwise, parse stylesheet and
// build transformer for it.
try {
// Create XSLT transformer
TransformerFactory tf =
TransformerFactory.newInstance();
Transformer t;
if (stylesheet == null) {
t = tf.newTransformer();
} else {
// Read XSL stylesheet from app archive
// and wrap it as a StreamSource. Then use
// it to construct a transformer.
InputStream xslstream =
_config.getServletContext().
getResourceAsStream(stylesheet);
StreamSource xslsource =
new StreamSource(xslstream);
t = tf.newTransformer(xslsource);
}
// Do transform
t.transform(source, result);
}
This code first gets a new TransformerFactory from the factory interface newInstance method. The method interprets a non-null stylesheet name as the path in the application archive (WAR file) to an XSLT stylesheet. It gets the stylesheet contents as an InputStream, and then creates a Transformer based on the stylesheet contents. If the stylesheet is null, it creates a default identity transformer. An identity transformer simply converts an input DOM tree to a result (in this case, an XML stream) without transforming the DOM in any way.
TransformerFactory
newInstance
InputStream
The final line is where everything happens:
// Do transform
t.transform(source, result);
This line tells the transformer to read from a SAXSource (the one created previously, which produces events from the ResultSet), transforms the input, and writes the result to the StreamResult object.
So where are the DocumentBuilder and the DOM tree? The Transformer handles building the DOM tree itself. It uses the SAXSource object that was supplied to create a DOM tree, performs the transform (if any), and serializes the result DOM tree to the StreamResult.
StreamResult.
Now that you understand the broad outlines of how the parser and transformer work together, let's have a look at how to tell the parser to create its SAX events from a ResultSet.
Reading From a ResultSet
The standard interface for a SAX parser (for SAX2, the second version of the interface) is called XMLReader. Despite its name, XMLReader does not extend java.io.Reader. Instead, it defines methods that a DOM parser uses to receive callbacks from its data source.
java.io.Reader
As mentioned previously, the class that creates events from a ResultSet is called SqlXMLReader. Most of SqlXMLReader's methods are empty because those methods relate to files and other things that are not of interest in this example. Method parse actually does most of the work.
The first section of the parse method gets the ResultSet to be traversed:
// Get result set from SqlInputSource.
SqlInputSource sis = (SqlInputSource)is;
ResultSet rs = sis.getResultSet();
If the DOM parser hasn't provided a ContentHandler to receive the methods, it's an error:
ContentHandler
if (_handler == null) {
throw new SAXException("No XML ContentHandler");
}
The code uses the result set's columns as the tag names in the result XML:
// Get information about result set
ResultSetMetaData md = rs.getMetaData();
int nColumns = md.getColumnCount();
int iRow = 0;
The code performs a couple of callbacks to tell the parser that a document is beginning, and also begins the document root (the top element of the document, with tagname "results"):
// Send startDocument and startElement events
// to handler
_handler.startDocument();
_handler.startElement(uri, docroot, docroot, attrs);
The code then iterates over the result set, outputting tag names, text and ignorable white space (for readability). For each row, it creates an element called "row", and for each column within that row, it creates an element with the column name as the tag name:
while (rs.next()) {
// Output "row" tag
_handler.startElement(uri, "row", "row", attrs);
outputIgnorableWhitespace("\n");
String s;
for (int i = 1; i <= nColumns; i++) {
String tag = md.getColumnName(i);
_handler.startElement(uri, tag, tag, attrs);
s = rs.getString(i);
if (s == null) {
s = "";
}
outputString(s);
_handler.endElement(uri, tag, tag);
outputIgnorableWhitespace("\n");
}
_handler.endElement(uri, "row", "row");
outputIgnorableWhitespace("\n");
}
Finally, the code tells the parser to close the document root and end the document:
_handler.endElement(uri, docroot, docroot);
outputIgnorableWhitespace("\n");
_handler.endDocument();
Accompanying the sample code is a sample database of geographic information. You can use the main page in the sample code to send a query to the interface.
The servlet uses resultSetToXML to create the following XML document:
<?xml version="1.0" encoding="UTF-8"?>
<results><row>
<COUNTRY_COUNT>231</COUNTRY_COUNT>
</row>
</results>
If the result doesn't look like XML, select View Source in your browser to see the actual XML text.
Although this example specifically shows how to create an XML document from a ResultSet, you can use the same technique to convert your own data structures to XML.
The Enterprise JavaBeans (EJB) 2.1 specification defines a new Timer feature for entity beans, stateless session beans, and message-driven beans. (Timers are not available for stateful session beans.) Timers allow application designers to incorporate time-based behaviors and workflows into their applications in a portable way.
Timer
A Timer is an EJB container-managed object that configures a callback to the creating bean when they expire. Timers can be configured to expire after a specific interval has elapsed, or to expire on a particular date and time. They can also be configured to expire only once, or perform callbacks periodically until they are turned off. Each enterprise bean can create as many Timers as the implementing platform allows. Timers created by entity beans are specific to the identity of that bean. Timers created by message-driven and stateless session beans are shared between instances, because those types of beans have no client-accessiblem identity.
Here are a few good reasons to use the Timer interface:
ejbTimeout
This tip explains the Enterprise Bean Timer interface. The source code is a LogCleaner session bean that periodically cleans out a log table in a relational database.
LogCleaner
Timer Interface
An enterprise bean defines and uses the Timer interface by declaring that it implements interface TimedObject. This interface has a single callback method that is called when the timer expires:
TimedObject
void ejbTimeout(Timer timer)
The enterprise bean class must define this method. The method does not appear in the bean's component interface. Instead, it is called by the EJB container when the timer expires.
An enterprise bean can create multiple timers, so the timer that expired is passed to the bean as the argument to the ejbTimeout callback. If the bean uses multiple timers, it is responsible for distinguishing between them when the callback occurs.
The servlet in the sample code (May2004Servlet) logs all of the requests it receives in a database table called SERVLETLOG. The sample code also includes an enterprise bean called TimerBean. The enterprise bean can be configured to periodically remove the contents of this log. The bean class for the bean shows how to create and respond to timer events from the EJB container.
SERVLETLOG
TimerBean
Timer Bean Local Interface
The TimerBean source code is simple. Its component interface is local, and contains the following methods:
public interface TimerLocal extends
EJBLocalObject {
public void start(TimerData data);
public void stop(String timerName);
public boolean isRunning(String timerName);
}
The start method tells the timer to start cleaning the log every "secs" seconds. The stop method stops the timer. The isRunning method indicates whether or not the cleaner is running. The sample servlet provides an interface to start, stop, and query the timer. Of course, in a production system, such a log cleaner would be started and stopped by application management tools, likely using JMX Mbeans. This code uses a servlet for simplicity and clarity.
stop
isRunning
The TimerBean can manage several timers at once, each with a different name. The first argument to TimerBean.start is a TimerData object. You define this object using the TimerBean. It contains the timer's name, the period of the timer (in milliseconds), and a "data" Object for programmer use. Each time a timer with a given name is started, stopped, or times out, the TimerBean makes a callback to a corresponding method (onStart, onStop, or onTimeout) on that timer's TimerData object.
TimerBean.start
TimerData
Object
onStart
onStop
onTimeout
You can define subclasses of TimerData to perform timer-specific functionality. For example, the sample program defines a LogCleanerTimerData object that cleans out the log (by making a call back to the servlet in the Web tier) when the timer times out.
LogCleanerTimerData
Timer Bean Class
The class definition for the Timer Bean says that the bean is a session bean, and that it uses timers:
public class TimerBean
implements SessionBean, TimedObject {
The bean's start method gets a reference to the TimerService, using servlet context method getTimerService. TimerService is a container facility that beans use to create and manipulate timers. The start method creates a Timer that runs once every "secs" seconds. Other Timer create methods of TimerService create Timers that run only once.
TimerService
getTimerService
public void start(TimerData data) {
long ms = data.getMs();
try {
TimerService ts = _context.getTimerService();
// Execute after "secs" seconds, and then
// every "secs" seconds thereafter.
Timer timer = ts.createTimer(ms, ms, data);
data.onStart(timer);
} catch (Exception e) {
System.err.println
("TimerBean.start: " + e.getMessage());
}
}
Notice that the third method of createTimer is the String "log cleaner". The final argument of createTimer methods is user data: a caller-defined object. This object can be a reference to any object that is Serializable. The caller sets this object when the Timer is created. The object can be retrieved anywhere else in the code by calling the Timer's getInfo method. This user data object can be used to distinguish between multiple timers, and might also contain other data needed by the bean that owns the Timer.
createTimer
getInfo
The TimerBean's stop method turns off all Timers associated with the bean.
public void stop(String timerName) {
try {
TimerService ts = _context.getTimerService();
Collection timers = ts.getTimers();
Iterator it = timers.iterator();
// For every timer whose "info" is TimerData,
// if the timer's name is timerName, pass that
// timer to TimerData.onStop. The TimerData object
// must decide whether or not to call Timer.cancel.
while (it.hasNext()) {
Timer t = (Timer)it.next();
if (isCalled(t, timerName)) {
TimerData td = (TimerData)t.getInfo();
td.onStop(t);
}
}
} catch (Exception e) {
System.err.println("TimerBean.stop: " + e.getMessage());
}
}
The isRunning method returns true if this bean owns any running Timer. The method returns false otherwise:
public boolean isRunning(String timerName) {
try {
TimerService ts = _context.getTimerService();
Collection timers = ts.getTimers();
Iterator it = timers.iterator();
if (it.hasNext()) {
Timer t = (Timer)it.next();
if (isCalled(t, timerName)) {
return true;
}
}
} catch (Exception e) {
System.err.println("TimerBean.isRunning: " +
e.getMessage());
}
return false;
}
Finally, the bean's ejbTimeout method receives callbacks from the container each time the Timer expires.
// When the EJB times out, call back
// to the Web tier to execute the SQL.
public void ejbTimeout(Timer timer) {
HttpURLConnection conn = null;
// Throw away everything in the servlet log
// each time the timer ticks. Use a URLConnection
// to ask the Web tier to do that delete for us.
try {
InitialContext ic = new InitialContext();
URL url = (URL)ic.lookup
("java:comp/env/url/cleanLog");
conn = (HttpURLConnection)url.openConnection();
int code = conn.getResponseCode();
conn.disconnect();
} catch (Exception ex) {
throw new EJBException(ex.getMessage());
}
}
In the case of the log cleaner, method LogCleanerTimerData.onTimeout is called by TimerBean.ejbTimeout. The method calls back to the servlet and requests that the servlet clean the log on its behalf. This code could also have connected to the database and cleaned the log itself. The code for onTimeout appears below:
LogCleanerTimerData.onTimeout
TimerBean.ejbTimeout
public void onTimeout(Timer t)
throws EJBException {
System.out.print("Timer " + getName() +
"timed out. ");
System.out.println("Cleaning log by calling " +
getLogCleanURL());
try {
URL url = getLogCleanURL();
HttpURLConnection conn =
(HttpURLConnection)url.openConnection();
int code = conn.getResponseCode();
System.err.println("Cleaned log, code=" + code);
conn.disconnect();
} catch (Exception ex) {
throw new EJBException(ex.getMessage());
}
}
To experiment, open your browser to the main page for the sample code. Under Tip 2 are the instructions for opening a separate window that displays the servlet log. The servlet log refreshes every 10 seconds.
A form and some links on the sample code main page allows you to start and stop the timer.
You can use the form and the links to stop, start, and query the timer status.
Note: You must start the PointBase database server before you start your J2EE server. To start the PointBase database server:
$J2EE_HOME/pointbase/tools/serveroption
Download the sample archive for these tips. The application's context root is ttmay2004. The downloaded ear file also contains the complete source code for the sample.
ear
You can deploy the application archive (ttmay2004.ear) on the J2EE 1.4 Application Server using the deploytool program or the admin console. You can also deploy it by issuing the asadmin command as follows:
ttmay2004.ear
deploytool
asadmin
asadmin deploy install_dir/ttmay2004.ear
Replace install_dir with the directory in which you installed the ear file.
install_dir
You can access the application at.
For a J2EE 1.4-compatible implementation other than the J2EE 1.4 Application Server, use your J2EE product's deployment tools to deploy the application on your platform.
See the index.html welcome file for instructions on running the application. | http://java.sun.com/developer/EJTechTips/2004/tt0527.html | crawl-002 | refinedweb | 3,266 | 57.06 |
The Python library. We have hosted the source code on Github just like others that we have released under the Apache 2.0 license, so feel free to collaborate with us to improve it!
How to install
This Python library.
Create the client object
The developer has to instance an object first passing as argument the API_KEY obtained after registering in.
It’s possible to use the Python library without an API key, but it will be restricted to only 100 hits per day. The TRIAL plan offers 1000 hits per day for 30 days and the FREE plan has 250 hits per day forever. Please read our pricing plans at.
To instantiate the client class with an API key:
client = apilityio.Client(api_key=api_key)
To instantiate the client class without an API key:
client = apilityio.Client()
Execute API calls
Now it’s time to perform the API calls. For example to look up an IP address in Apility.io databases of blacklists:
response = client.CheckIP(ip)
If the IP address has been not found in any blacklist, it will return a 404 code in the status_code attribute of the Response object:
if response.status_code == 404: print("Congratulations! The IP address has not been found in any blacklist.")
If the IP address has been not in any blacklist, it will return a 200 code in the status_code attribute of the Response object, and the lists of blacklists in the blacklists attribute:
if response.status_code == 200: print("Ooops! The IP address has been found in one or more blacklist") blacklists = response.blacklists print('+- Blacklists: %s' % blacklists)
Now the developer can perform as many requests as needed with this client object. And he/she doesn’t need to close the connection because it is stateless.
Example: Get the Geolocation data of an IP address
This full example explains how to write a command-line tool with the Python library to obtain the Geolocation data of an IP address:
import sys import getopt import os import traceback import apilityio import apilityio.errors def main(argv=None): if argv is None: argv = sys.argv try: try: api_key = None ip = None options, remainder = getopt.getopt( argv[1:], 'h:a:i', ['help', 'api_key=', 'ip=']) for opt, arg in options: if opt in ('-a', '--api_key'): api_key = arg if opt in ('-i', '--ip'): try: ip = unicode(arg, "utf-8") except: ip = arg elif opt in ('-h', '--help'): print("python geoip.py --api_key= --ip=") return 0 except getopt.error as msg: raise Exception(msg) try: client = apilityio.Client(api_key=api_key) api_key, protocol, host = client.GetConnectionData() print('Host: %s' % host) print('Protocol: %s' % protocol) print('API Key: %s' % api_key) print('Geolocate IP: %s' % ip) response = client.GetGeoIP(ip) if response.status_code != 200: print("The API call returned this error HTTP %s: %s" % (response.status_code, response.error)) return 0 geoip = response.geoip print('+- Accuracy radius: %s' % geoip.accuracy_radius) print('+- Address: %s' % geoip.address) print('+- City: %s' % geoip.city) print('+- City Geoname ID: %s' % geoip.city_geoname_id) print('+- City Names: %s' % geoip.city_names) print('+- Continent: %s' % geoip.continent) print('+- Continent Geo Name ID: %s' % geoip.continent_geoname_id) print('+- Continent Names: %s' % geoip.continent_names) print('+- Country: %s' % geoip.country) print('+- Country Geo Name ID: %s' % geoip.country_geoname_id) print('+- Country Names: %s' % geoip.country_names) print('+- Hostname: %s' % geoip.hostname) print('+- Latitude: %s' % geoip.latitude) print('+- Longitude: %s' % geoip.longitude) print('+- Postal code: %s' % geoip.postal) print('+- Region: %s' % geoip.region) print('+- Region Geoname ID: %s' % geoip.region_geoname_id) print('+- Region Names: %s' % geoip.region_names) print('+- Time Zone: %s' % geoip.time_zone) print('+--- AS number: %s' % geoip.asystem.asn) print('+--- AS name: %s' % geoip.asystem.name) print('+--- AS country: %s' % geoip.asystem.country) print('+--- AS networks: %s' % geoip.asystem.networks) except apilityio.errors.ApilityioValueError as ae: traceback.print_exc() print("ERROR: ", ae) return 2 return 0 except Exception as e: traceback.print_exc() print("ERROR: ", e) print("For help, use --help") return 2 if __name__ == "__main__": sys.exit(main())
If you would like to obtain code examples for any of the included client libraries, you can find it in the examples folder of the Github repository.
What’s next?
So now you can start coding or integrate our library with your application or service! And we would like to know about it! So please don’t hesitate and contact us to tell us about your product or service!
Do you have an issue using the Apilityio Client Libraries? Or perhaps some feedback for how we can improve them? Feel free to let us know on our issue tracker. | https://apility.io/2018/08/09/python-library-client/ | CC-MAIN-2019-51 | refinedweb | 747 | 61.33 |
Arduino Solar Tracking Robot
Introduction:.
This instructable was inspired from geo bruces instructable solar tracking robot
This instructable explains how to create your own solar tracking robot, how to set up the robot and how to test the robot.
This instructable is a entry in the robot challenge in the age category of 13 - 18 (I am 14 years old).
Step 1: Parts & Tools
Parts:
~ 2 x Servo Motors - Local Electronics Store
~ 4 x LDR's - Local Electronics Store
~ 4 x 10k Resistors - Local Electronics Store
~ Arduino Uno - Sparkfun.com
~ 2 x 50k Variable Resistor - Local Electronics Store
Tools:
~ Soldering Iron - Sparkfun.com
~ Solder Wire - Sparkfun.com
~ Jumper Wires - Sparkfun.com
~ Protoboard - Local Electronics Store
All the parts will cost you less than 30$ (Excluding the arduino and all the tools)
Step 2: Build the Circuit
The Circuit is pretty simple connect the four LDR's to analog pins 0,1,2 and 3 respectively via a 10k resistor.Connect the two servos to digital pins 9 and 10 respectively.Conect the two variable resistors to analog pins 4 and 5 .Take a Look at the pictures they really help.See the last picture for the circuit diagram (It might be the baddest that you have ever seen).
Step 3: Build the Sensor Assembly
To build the the sensor assembly take two rectangular pieces of cardboard, cut a long slit through the middle of the first cardboard piece.Cut a short slit through the middle of the second cardboard piece and then intersect both of them and fix them nicely using some tape. It should look like a 3D cross with 4 sections..We have to place our four LDR's in these four sections of the cross.See the pictures they really help.
Step 4: Set It Up
Find a base (Nescafe bottle in my case) and stick your fist servo to it then to the rotor of the first servo connect the second servo.To the rotor of the second servo connect the sensor assembly that we made earlier.To test your robot take it out in the sun and it should automatically align itself towards the sun.If indoors it will align itself to the brightest source of light in the room. Take a look at the pictures they really help.
Step 5: The Code
Heres the code for your solar tracing robot:
#include <Servo.h> // include Servo library = analogRead(5)/4;
int avt = (lt + rt) / 2; // average value top
int avd = (ld + rd) / 2; // average value down
int avl = (lt + ld) / 2; // average value left
int avr = (rt + rd) / 2; // average value right
int dvert = avt - avd; // check the diffirence of up and down
int dhoriz = avl - avr;// check the diffirence og left and rigt
if (-1*tol > dvert || dvert > tol) // check if the diffirence is in the tolerance else change vertical angle
{
if (avt > av);
}
Step 6: All Done!
Hope this project inspires further experimentation. The Arduino board is incredibly versatile,cheap, and accessible to all hobbyists . This is just one of many simple projects which can be constructed using the arduino. Keep pondering!.Dont forget to follow morescomming up.For any queries contact me heres my E-mail ID r1398ohit@gmail.com
Alright, so did you write this originally, or did this guy:
the link you posted is mine instructable
I wrote it almost a year before this guy "copied" it.
but he didn't read the license terms
This license lets others remix, tweak, and build upon your work non-commercially, as long as they credit you and license their new creations under the identical terms.
"as long as they credit you" <<< you didn't :(
please Mr Geo.
Hey, sorry for not mentioning it before. I have now mentioned your name and a link to the instructables
please.
Great work, thank for sharing. Please, How can i do to increase the sensibility of LDRs and the speed of servo?
my servos just rotate 180° (it stays on 0° or 180°) they dont stay on 70° or 30° for instance.
anyone can help me?
Are the separator between each photoresistor necesary?
Yes
Nice tutorial, I like it and the cardboard solution is ingenious. Looking forward to try this :)
you should make it powered by a solar panel that it holds, and directs towards the light, it would be independent. also you could split the power to go to the arduino, and some for surplus energy.
Your diagram has free wires
That has got to be the punkiest build I've ever seen. LoL! :)
I like the simplicity of the circuit and code. Well done.
Consider painting your cruciform tube black (eliminating stray bounces off the cardboard) to improve the accuracy of the sensors.
Consider how this setup will react to cloudy days. Will it be sending the servos all over the place looking for the brightest spot in the sky? If so, how do you slow down the motion so you don't burn out the servos? Consider adding some acceleration curve code to the movement of the servos, especially once they are driving a load.
Also, consider adding a power relay circuit for the servos so your arduino can turn them on and off, thus relieving them of stress when they aren't moving anyway. The code could;
o turn on the relay, powering the servos
o move the servos to their new position via acceleration curves
o turn off the relay, shutting down the servos
Have fun!
You should consider making a schematic, because it makes it a lot easier to understand. Great Instructable, though.
I added a circuit diagram (last pic step 2) now
Nice project! Well done. Do you have a youtube clip to see it working? | http://www.instructables.com/id/Arduino-Solar-Tracking-Robot/ | CC-MAIN-2017-43 | refinedweb | 957 | 71.34 |
hi all...
learning c pointers. i have this code :
the compiler returns:the compiler returns:PHP Code:
#include <stdio.h>
int main () {
char string3[10], string4[] = "foo moo loo";
for(; (*string3 = *string4) != '\0'; string3++,string4++)
;
return 0;
}
strings.c: In function `main':
strings.c:25: error: wrong type argument to increment
strings.c:25: error: wrong type argument to increment
strings.c:25: warning: left-hand operand of comma expression has no effect
strings.c:25: warning: statement with no effect
what i don't understand is why the "wrong type argument to increment" error?
if the array name is also a pointer to the first element in the array and i'm using pointer aritmetic to move through the array/string why 'wrong type'?! isn't the address always an int?!
thanks.... | http://cboard.cprogramming.com/c-programming/82838-pointers-problem-printable-thread.html | CC-MAIN-2015-40 | refinedweb | 133 | 69.38 |
Beginners find that the scanf function behaves strangely when you input a character when scanf expects an integer or float. When used inside a loop (taking options), it loops infinitely. Here is a short post which explains what it happens, and how to solve this,
For example consider the simple code below describing the situation of scanf in a loop.
#include <stdio.h> int main (void) { int x; do { printf ("\n\nEnter a number: "); scanf ("%d", &x); printf ("\nEntered number: %d", x); } while (x != -1); printf ("\n"); return 0; }
Enter an integer it will keep on asking for integer while you do not enter -1. When you enter a character it will go to an infinite loop.
This is because the scanf did not match an integer in stdin, and that is why it did not read the characters from stdin, which still remain in the input buffer, and the call returned. In the next iteration it will again encounter the unmatched characters in the buffer from the previous iteration and fail matching again and go into another iteration, where it will again fail for the same cause and like this it will infinitely loop trying to match the same set of characters and fail.
To detect if scanf has matched the input or not, check the return value of scanf. Check out what the manual has to say about the return value:
These functions return the number of input items successfully matched and assigned, which can be fewer than provided for, or even zero in the event of an early matching failure.
Therefore check the return value of scanf to know how many parameters has been matched. In the above case check if it returns 1 or not. Check the fixed code below:
#include <stdio.h> int main (void) { int x, retval; do { printf ("\n\nEnter a number: "); retval = scanf ("%d", &x); printf ("retval = %d", retval); if (retval != 1) { printf ("\nEnter again"); scanf ("%*c"); continue; } printf ("\nEntered number: %d", x); } while (x != -1); printf ("\n"); return 0; }
Now if you enter a character in the input, scanf will not match it and return 0 (as none was matched). But we still have the unmatched character in the stdin buffer. Depending on the need we can handle this in different ways. In the above code the next character in the buffer is simply discarded. The * in “%*c” , is the assignment-suppression character. This simply tells that to read the next character from the stdin, but discard it. There is no need to associate corresponding argument in the scanf argument list. Therefore this line simple will read the next character from the standard input and discard it, reveiling the next character in the stdin and will make progress instead of looping infinitely.
In a similar way you can detect the presence of more than one input elements in a scanf as per needed. Some related content could be found in this post: | https://phoxis.org/2012/03/11/using-scanf-safely/ | CC-MAIN-2019-18 | refinedweb | 491 | 68.7 |
Ask Ben: Executing ColdFusion Custom Tag Code If First Run Only
Someone asked me earlier about executing part of a ColdFusion custom tag only if it was the first instance of the tag run of the given page. Basically, what they were trying to do was create reusable UI widgets that had associated Javascript. The given UI widget tags could be used any number of times on the page, but they only wanted the Javascript portion to render once, in the first custom tag execution as it would initialize each UI widget on page load.
To do this, each instance of the custom tag would have to be, to some extent, aware of each of its siblings. Since each tag executes inside of its own bubble, I have to keep ColdFusion custom tag meta data in one of the page scopes to and from which each custom tag can write and read respectively. Traditionally, I use the REQUEST scope as this is both globally available and persistent for a single page request. To avoid naming collisions, I like to create a name space within the REQUEST scope that is specific to custom tags in general and to this tag specifically.
By paraming this ColdFusion custom tag "name space" in the tag ATTRIBUTES scope, it allows each tag to have a default name space with the ability to be overridden by the calling context. Because this name space is dynamic, you would think it would be complicated to work with; but, due to the behavior of the CALLER scope and the auto-struct-path creation behavior of ColdFusion, it's actually quite easy!
To demonstrate this, I have some test code below that executes a demo ColdFusion custom tag three times. Each of the custom tags has its own HTML output plus some Javascript output. The Javascript output, as per the readers question, will only be output once during the first execution of the custom tag:
- <!--- Run the custom tag. --->
- <cf_demo />
- <!--- Run the custom tag. --->
- <cf_demo />
- <!--- Run the custom tag. --->
- <cf_demo />
When we run this code, we get the following PAGE SOURCE output (I've stripped some white space for readability):
<script type="text/javascript">
// Script would go here.
</script>
Tag 1<br />
Tag 2<br />
Tag 3<br />
As you can see, the SCRIPT tag has only been rendered once during the first custom tag execution, but the HTML output has been rendered once for each tag.
So, how does this work? Here is the ColdFusion custom tag that was executed:
Demo.cfm
- <!--- Turn on explicit output. --->
- <cfsetting enablecfoutputonly="true" />
- <!---
- Param the tag attribute for our name space. To make sure
- that the meta data that we store with this tag does not
- conflict with other page variables, we will create namespace
- for storage. This name space can be overridden by the
- calling code.
- --->
- <cfparam
- name="ATTRIBUTES.NameSpace"
- type="variablename"
- default="REQUEST.CustomTagNameSpaces.Demo"
- />
- <!---
- Check to see if the namespace for this tag exists yet.
- If not, we will create a default version.
- --->
- <cfif NOT StructKeyExists( CALLER, ATTRIBUTES.NameSpace )>
- <!--- Create default name space for this tag. --->
- <cfset CALLER[ ATTRIBUTES.NameSpace ] = {
- JavaScriptRendered = false,
- TagCount = 0
- } />
- </cfif>
- <!---
- ASSERT: At this point, we can access the name space for
- this tag (even if it was just created).
- --->
- <!--- Check to see if the Javascript has been rendered. --->
- <cfif NOT CALLER[ ATTRIBUTES.NameSpace ].JavaScriptRendered>
- <!--- Render Javascript. --->
- <cfoutput>
- <script type="text/javascript">
- // Script would go here.
- </script>
- </cfoutput>
- <!--- Flag script as being rendered. --->
- <cfset CALLER[ ATTRIBUTES.NameSpace ].JavaScriptRendered = true />
- </cfif>
- <!---
- ASSERT: At this point, we know that the Javascript has
- either been rendered by this tag or a previous tag.
- --->
- <!--- Render tag content. --->
- <cfoutput>
- Tag #++CALLER[ ATTRIBUTES.NameSpace ].TagCount#<br />
- </cfoutput>
- <!--- Turn off explicit output. --->
- <cfsetting enablecfoutputonly="false" />
- <!--- Exit tag. --->
- <cfexit method="exittag" />
As you can see, I am paraming a name space value in the custom tag ATTRIBUTES scope:
REQUEST.CustomTagNameSpaces.Demo
This value has to be a valid "variable name" data type otherwise we won't be able to leverage the awesome power of the ColdFusion CALLER scope. Like I said before, I like to use a REQUEST-based struct; but, because this variable name is defaulted in the ATTRIBUTES scope, the calling context could easily override it:
- <cf_demo name
Notice that once we have the name space variable, I make no explicit references to the path, only to the variable which contains it. With this variable, we can check to see if the name space exists using StructKeyExists():
- <cfif NOT StructKeyExists( CALLER, ATTRIBUTES.NameSpace )>
Because the CALLER scope does not act like a standard ColdFusion struct, calling StructKeyExists() checks the dynamic variable path, not the key value (NOTE: IsDefined() is almost never needed in ColdFusion!!). Also in this vein, by using the NameSpace variable as a key in the CALLER scope, we dynamically create the full variable path, not just the given key:
- <cfset CALLER[ ATTRIBUTES.NameSpace ] = { ... } />
I find that this approach gives us the most usability but provides great flexibility while at the same time, avoiding any naming conflicts that might arise. Every time I use the CALLER scope, I simply love the way that ColdFusion has chosen to implement it - it just makes life so darned elegant. reference your variables in a shorter (but perhaps more confusing) manner? I think you could still use the request scope directly and have just as much flexibility, e.g:
<cfset request._my_taglib.[attributes.namespace]._this_tag_name.jsRendered = true>
Maybe I'm missing something? :) Or is the point that you can use an arbitrary scope other than the request scope?
I had a couple of reactions to this scenario and wanted to share.. They're not a knock on your nifty solution though.
1. The single-execution logic could be placed in the JavaScript side; although using a global JS var to accomplish this, it might feel better than having a custom tag sticking its grimy fingers where they don't belong.. ;-D
<pre>var executed=false;
function doStuff()
{
if(!executed) {
...do your stuff...
executed=true;
}
}</pre>
Then your custom tag just writes the JS every time and doesn't worry about that logic.
2. A bit more "controversial"... But a CFC could handle this task pretty well, and could maintain the state between each execution. This using CFCs for display is obviously blasphemous from the perspective of CFCs in the "model", but the flexibility of CFCs can come in handy here for a very specific "view" purpose.
Don't get me wrong though. I'm not a custom tag hater.
I dunno. What do you think?
Oops, the pre tags aren't rendering, but you get the point.
@Justin,
The idea behind the CALLER scope is that you don't have to use the REQUEST scope at all. The CALLER scope allows you to reach into the calling context and use whatever variable string was passed in (or defaulted) in the attributes. As such, you could override with a VARIABLES-scopes key as I demonstrate part way in the blog.
Think about something like CFThread; perhaps you are using CFThread to burn some HTML to flat files. You probably wouldn't want to use the REQUEST scope in that case because the context of the custom tag (cfthread) might be running in parallel with other threads all doing the same thing. In such a case, you would want them to use their own name-space such as (THREAD.CustomTagData).
Without using the CALLER scope, also, its much harder to reference an unknown variable location. You can set it using dynamic variable naming:
<cfset "#ATTRIBUTES.NameSpace#" = StructNew() />
... of course, if this is a VARIABLES-scoped value, it will incorrectly store it in the custom tag's VARIABLES scope.
But, accessing it is much less elegant; I believe you would have to use an Evaluate() call:
<cfset objNameSpace = Evaluate( ATTRIBUTES.NameSpace ) />
Wicked gross, right?!?
So, the benefit of using the CALLER scope is:
1. We don't have to rely on hard-coded name spaces.
2. Name spaces can be overridden at run time by calling context.
@Josh,
That's a good point. The only down side to that is that the Javascript would have to be downloaded N times (once per tag instance). Not a biggie, unless the code is large.
As far as a CFC, this could definitely work. I have no problems with CFCs generating output as long as that is their purpose.
Namespace#">
Then inside the custom tag:
<cfparam name="arguments.scope" default="#request#">
<cfset arguments.scope.jsRendered = true>
etc...
I think maybe the only flexibility you would lose is being able to create the full struct path in a single line of code, as per your caller scope example. Did that end up being a bug that you reported though? Is it something you can rely on, and has it been tested on other CFML engines?
Man I'm full of questions today, sorry :P
Errrr, that's supposed to be attributes.scope and not arguments.scope too :)
And now I realise that it's somewhat useless passing in a scope if it might not exist... Haha.
@Justin,
At first, I thought the CALLER scope issue was a bug; but, once I started to see how it could be leveraged, I had to assume that it was designed that way in for those very purposes (especially since a standard struct behavior would make things like that more difficult).
I think you could easily pass in a name-space. You would have to relax the CFParam type to be "any", but then once you had the value, you could test it for string or struct data type:
<cfif IsSimpleValue( ATTRIBUTES.NameSpace )>
. . . . // Use variable name to get create / access struct.
<cfelse>
. . . . // Name space passed in AS given struct.
</cfif>
I think that would be a really good modification, thanks!
I accomplish this before with creating a variable at the beginning of the custom tag which is nothing more than <cfset uniqueID = CreateUUID()>
Then I use that and append it to all my JS functions, and global JS variables.
Not the most efficient, but it worked...
I like this solution...
@David,
I am not sure I understand. If the tag has a UUID(), then how will other instances of the tag know that they are not supposed to execute parts?
It didn't, I created my custom tags with the CreateUUID() to be 100% self contained. They each had their own copy of everything they needed to run.
Hence: "Not the most efficient, but it worked..."
For example, if a custom tag needed to call a JS function, the JS Function would look like this.
function popUpWindow#uniqueID#(){ alert('1'); }
Although not the most efficient, I did gain 1 benefit from doing this, when all functions and vars had this unique name to it, I never had to worry about conflicts from any other libraries, or custom JS code...
In other words, I never thought of trying to be aware of other custom tags on a page, and I never even thought of thinking about a solution like you have been discussing. My idea was not a counter idea to what your discussing, simply what I did with my custom tags when I need to have multiple tags on the same page.
I like this solution much better.
@David,
Ahh, ok, gotcha. Sorry, I was not quite clear on that point. | http://www.bennadel.com/blog/1580-ask-ben-executing-coldfusion-custom-tag-code-if-first-run-only.htm | CC-MAIN-2015-32 | refinedweb | 1,896 | 72.46 |
removing item in dropdownlist
Discussion in 'ASP .Net' started by =?Utf-8?B?Q2hyaXM=?=, Jan 12, 2005.
Want to reply to this thread or ask your own question?It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
- Similar Threads
removing a listbox item - javascriptRA, Nov 15, 2004, in forum: ASP .Net
- Replies:
- 0
- Views:
- 4,602
- RA
- Nov 15, 2004
Removing an item from a QListView in PyQtSvenn Bjerkem, Apr 11, 2006, in forum: Python
- Replies:
- 2
- Views:
- 897
- David Boddie
- Apr 11, 2006
List operation: Removing an itemMiguel E., Apr 16, 2006, in forum: Python
- Replies:
- 8
- Views:
- 335
- Miguel E
- Apr 17, 2006
removing a namespace prefix and removing all attributes not in that same prefixChris Chiasson, Nov 12, 2006, in forum: XML
- Replies:
- 6
- Views:
- 652
- Richard Tobin
- Nov 14, 2006
Random Numbers and Removing only 1 item at a timedeanfamily, Dec 8, 2005, in forum: C++
- Replies:
- 2
- Views:
- 291
- deanfamily
- Dec 8, 2005 | http://www.thecodingforums.com/threads/removing-item-in-dropdownlist.94300/ | CC-MAIN-2014-52 | refinedweb | 182 | 76.96 |
On 7/27/07, Tiger12506 <keridee at jayco.net> wrote: > > Hmmm... interesting tie to another post... > > >>> x = timeit.Timer('random.random()','import random') > >>> x.timeit(3000000) > 1.0161026052194018 > >>> y = timeit.Timer('random()','from random import random') > >>> y.timeit(4600000) > 1.0004307810070827 > > Dictionary lookups do take HUGE amounts of time. Interesting. > > Anyway... I've got it down to > Your numbers with a little more precision gave me > 3.4e5987 yrs. > > and mine > > 3.0e5987 yrs. > > That's a hell of a lot of years! Remember that everyone! If you want your > code to run forever and to eternity, copy variables to the local namespace > first; you get a lot more accomplished (well... whatever) ;-) > > Anyway, the frivolity aside, I can get it to repeat every ten seconds. ;-) > Set the computer clock. (okay, maybe i'm just in a silly mood. But > seriously, > that's why the docs say that it is NOT meant for cryptography - not that > that matters > to the OP, snicker; What have I been drinking????) > > > Well, I was trying to emphasize that it was, for pretty much all intents > > and purposes, infinite. > > Nope-nope-nope you're wrong :-)~ The way I understood the 'period' of the random function was that after x calls to the function, you would start getting the same pattern of results as you did to begin with, in _the same running process_ of a program. This is a separate situation from having the clock be exactly the same and getting the same random values on program start - we already knew that would happen, because the seed hadn't changed. Unless I understand the period wrong, but I don't think so. The daring cracker enters the room, his heart quickening as the door hinge > creaks with the sound of the smallest ever mouse. His dark clothing masks > him from the lit room visible through the window on the adjacent wall. A > woman, working late, sits in a comfortable office chair, her face glowing > from the reflection of her computer screen. A cup of Java (pun intended) > indicates to anyone watching that she is overworked, and under-paid. > > Each step he takes brings him closer to his target. The big boss gave him > a > pay cut so that this new PC could sit on his boss's desk. The cracker's > jealously seems to almost permeate the room. Vengeance shouts out louder > than the compressor of the air conditioner in the north window. The > cracker > intinctively looks up to see if his emotions betrayed his presence. But > the > woman in the other room continues her scrolling through endless lines of > buggy, hard to read, unmaintainable, bloated, and otherwise ridiculously > foolish code that could have been so easily fixed if the same 'big boss' > had > ordered the project in Python. > > Soon, a floppy disk is pulled out of a black jacket pocket. No one has > ever > run the program on the floppy before. Taking the disk, the cracker inserts > it into the drive, starts the machine, swears under his breath when he > reads > "Non-System disk or disk error. Replace and strike any." > > Striking the 'any' key, he quickly shoves the floppy disk back in. He > wants > this over with. Again, he looks to see if he has been detected; still he > is > safe. Opening the folder containing the floppy drive, he groans silently > as > the annoying Windows Firewall flashes an update notice. "See..." he thinks > to himself, "Micro$oft *can* actually restrict viruses from entering their > OS." He fights with the window, impatiently waiting for countless > libraries > to load and free, until the UI responds and he can send it a WM_CLOSE > message. > > Smirking evily, the cracker double-clicks the executable > 'pink_fuzzy_bunny.exe' and resists the urge to laugh maniacally as he > watches the computer clock freeze and not move. Ingenious--his plan--All > it > takes to freeze time is to contantly set it to the same second in history. > Time. Forever frozen. He frowns as he realizes that in so doing, he > provides > the only effective means for keeping those pesky Windows notices out of > his > boss's hair. "No matter" --he thinks, "He will have worse troubles in due > time." Again he suppresses a maniacal laugh. > > . . . > > Monday morning brings a bright and cheerful man into an office, his > office. > The door creaks a little as he opens it, and the air conditioner buzzing > in > the north wall window is refreshing to him after the heat from outside. > The > man waves cheerfully at a woman through the glass in the adjacent wall, > whom > looks up only for an instant to scowl. The man, who recently bought his > new > PC, smiles proudly as he turns it on. His new python program which he > keeps > on the desktop is his early attempt at a cricket game simulation. He > lovingly double-clicks the icon, and runs the program several times. Each > successive time his grin grows smaller and smaller until his face is more > than troubled. Why is his program producing the same output every time? A > scream is heard in the office "NOOOOOOO!!!!!!!!" > The boss runs from the building, never to notice the clock in the > bottom-right hand corner which still shows the caption '10:33 PM'. > > Somewhere, someplace a cracker lies in bed, a silly grin on his face. His > objective, he knows, has been accomplished. nice story. > Because the possibility of my computer even existing after that long is > > effectively zero, I consider the pattern to never repeat :) > > Ahhh... > Your computer ~ sitting on a pedestal in the middle of nowhere in AD > 3.0e5988, the last shrine to the ancient past-- A technological marvel to > the ape like creatures whom are all that remain of the once all powerful > race of human beings. > > Our ape, named Jogg, looks at the bright computer screen, jumps back in > fear > as the ancient Windows Beep function is called and the foreign noise hits > him. What is this? There is a message there. > > ... > ... > File "<stdin>", line 2, in find > File "<stdin>", line 2, in find > File "<stdin>", line 2, in find > RuntimeError: maximum recursion depth exceeded > >>> > > Damn. I guess we will never know. > > (okay... maybe nobody spiked my Mt. Dew, but maybe because it's after 3:00 > am) as a side note - are you going to enter the September Pyweek? You should! It's a lot of fun. -Luke -------------- next part -------------- An HTML attachment was scrubbed... URL: | https://mail.python.org/pipermail/tutor/2007-July/055922.html | CC-MAIN-2014-15 | refinedweb | 1,070 | 73.47 |
We can use a standard bfs to find the second minimum value, but given the fact that the root value is the smaller of both its children, we can prune this early because we do not need to further than a node that has greater value of the root value.
def findSecondMinimumValue(self, root): if not root or not root.left: return -1 s = [root] smallest = float('inf') while s: temp = [] for i in s: if i.val > root.val: smallest = min(smallest, i.val) elif i.left: temp.append(i.left) temp.append(i.right) s = temp return -1 if smallest == float('inf') else smallest | https://discuss.leetcode.com/topic/102724/python-bfs-early-pruning | CC-MAIN-2017-39 | refinedweb | 106 | 72.97 |
ComboBox QML Type
Provides a drop-down list functionality. More...
Properties
- acceptableInput : bool
- activeFocusOnPress : bool
- count : int
- currentIndex : int
- currentText : string
- editText : string
- editable : bool
- hovered : bool
- inputMethodComposing : bool
- inputMethodHints : enumeration
- menu : Component
- model : model
- pressed : bool
- selectByMouse : bool
- textRole : string
- validator : Validator
Signals
Methods
Detailed Description
Add items to the ComboBox by assigning it a ListModel, or a list of strings to the model property. property was introduced in QtQuick.Controls 1.1.
See also validator and accepted.
This property specifies whether the combobox should gain active focus when pressed. The default value is
false.
This property holds the number of items in the combo box.
This property was introduced in QtQuick.Controls 1.1.
This property specifies text being manipulated by the user for an editable combo box.
This property was introduced in QtQuick.Controls 1.1.
This property holds whether the combo box can be edited by the user. The default value is
false.
This combo box and how it should operate. 1 property was introduced in QtQuick.Controls 1.3.
Allows you to set a text validator for an editable ComboBox. When a validator is set, the text field field:
Note: This property is only applied when editable is
true
import QtQuick 2.2 import QtQuick.Controls 1.2 ComboBox { editable: true model: 10 validator: IntValidator {bottom: 0; top: 10;} focus: true }
This property was introduced in QtQuick.Controls 1.1.
See also acceptableInput, accepted, and editable.
Signal Documentation combobox, the signal will only be emitted if the input is in an acceptable state.
The corresponding handler is
onAccepted.
This signal was introduced in QtQuick.Controls 1.1.
Method Documentation
Finds and returns the index of a given text If no match is found,
-1 is returned. The search is case sensitive.
This method was introduced in QtQuick.Controls 1.1.
Returns the text for a given index. If an invalid index is provided,
null is returned
This method was introduced in QtQuick.Controls 1. | https://doc.qt.io/qt-5/qml-qtquick-controls-combobox.html | CC-MAIN-2020-05 | refinedweb | 329 | 51.34 |
Well, I finally did it. LALR(1) parser support is now in PCK.
This background assumes at least a passing familiarity with LL(1) parsing. If you need to develop that, you can fiddle around with my tutorial on creating an LL(1) parser. This also assumes some small familiarity with PCK.
LALR(1) parsing is a form of parsing that works almost "inside out" compared to LL(1) parsing; it builds the tree from the leaves to the root, guiding the parse using the input tokens. Contrast this with LL(1) parsers, which build the tree from the root down to the leaves, using the grammar to guide the parse. In the LALR(1)/LR case, the input tells us what rule to use which the parser compares to the grammar. In the LL(1)/LL case, the grammar tells us what rule to use, which the parser compares to the input.
Sound confusing? It is, a little at first. Luckily, the particulars of the LALR(1) algorithm aren't critical to using it. If it were, most people would be out of luck!
That having been said, we have to start somewhere. Here's the upshot of LALR(1) parsing compared to LL(1) parsing:
Here are the downsides of LALR(1) parsing:
Here's my recommendation, given the above: Use an LL(1) parser if you can, or an LALR(1) parser only if you need the extra parsing power that comes with it. PCK provides both.
Other parser generators that use the LALR(1) algorithm include YACC and Gold Parser.
First, we need to build the code before we can use it. Get pckw (and the supporting assemblies) into your path and let's get started.
pckw
Create an XBNF grammar file:
expr = expr "+" term | term;
term= term "*" factor | factor;
factor= "(" expr ")" | int;
add= "+";
mul= "*";
lparen= "(";
rparen= ")";
int= '[0-9]+';
Convert it to a PCK specification:
PCK
pckw xlt expr.xbnf expr.pck
Now take the pck specification and use it to generate a tokenizer/lexer:
pck
pckw fagen expr.pck ExprTokenizer.cs /namespace Demo
Finally, take the same pck specification file and use it to generate a LALR(1) parser:
pckw lalr1gen expr.pck ExprParser.cs /namespace Demo
Now include those files in your project, and reference the Demo namespace. Add a reference to the assembly pck. Add the following code somewhere, probably in your Main() routine if this is a console app:
Demo
Main()
var parser = new ExprParser(new ExprTokenizer("3*(4+7)"));
That creates a new parser and tokenizer over the expression 3*(4+7).
3*(4+7)
If you want streaming access to the pre-transformed parse tree, you can call the parser's Read() method in a loop, very much like Microsoft's XmlReader:
Read()
XmlReader
while(parser.Read())
{
switch(parser.NodeType)
{
case LRNodeType.Shift:
case LRNodeType.Error:
Console.WriteLine("{0}: {1}",parser.Symbol,parser.Value);
break;
case LRNodeType.Reduce:
Console.WriteLine(parser.Rule);
break;
}
}
However, that doesn't take advantage of trimming or transformation on the parse tree. It's also harder to use in many situations that a parse tree itself.
Fortunately, it's really easy to get a parse tree:
var tree = parser.ParseReductions(); // pass true if you want the tree to be trimmed.
Console.WriteLine(tree);
That returns a node with other nodes as children, representing the parse tree. Each node has all the information about the parsed element. Nodes that were collapsed in the grammar are not in the parse tree. Nodes that were hidden are not in the parse tree unless ShowHidden is true on the parser.
ShowHidden
true
You can also create parsers at runtime, like you can with the LL(1) parser. You don't have to generate code.
To do so, you'll have to reference the pck, pck.cfg, pck.fa and pck.lalr1 assemblies
pck.cfg
pck.fa
pck.lalr1
// we need both a lexer and a CfgDocument.
// we read them from the same file.
var cfg = CfgDocument.ReadFrom(@"..\..\..\expr.pck");
var lex = LexDocument.ReadFrom(@"..\..\..\expr.pck");
// create a runtime tokenizer
var tokenizer = lex.ToTokenizer("3*(4+7)", cfg.EnumSymbols());
// create a parser
var parser = cfg.ToLalr1Parser(tokenizer);
This code does the equivalent of the generated code, without actually generating any code. It can take some time to generate the LALR(1) tables and the FA tokenizer, so pre-generating is recommended. Furthermore, from the above, the set up is obviously a bit more complicated.
This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL) | https://www.codeproject.com/Articles/5164706/Pck-LALR-1-An-LR-Parsing-Algorithm?display=Print&PageFlow=FixedWidth | CC-MAIN-2019-43 | refinedweb | 764 | 57.98 |
Answered
Hi, since I upgraded to PyCharm 2016.1, the code inspection triggers any errors on code changes but does not clear the error highlight on edit. Once the code inspection finds an error, even if I correct the error/typo in the editor it still thinks there is an error. The error messages still refer to the old version of the code. I tried invalidating the cache but that did not help. Once I set the "Highlighing Level" to "None" and then back to "Inspections", the errors go away.
I am currently using:
PyCharm Community Edition 2016.1.2
Build #PC-145.844, built on April 8, 2016
JRE: 1.8.0_45-b14 amd64
JVM: Java HotSpot(TM) 64-Bit Server VM by Oracle Corporation
Thanks
-Selim
Same here, I have it in all projects though. If I cut and paste the code the introspection is reevaluated.
Hi Mkrens! Could you please create a ticket in our bug tracker and attach idea.log file from Help | Show Log in ... there?
I had the same issue with the code inspection not updating, and at least in this case was able to fix it. By trial and error and cutting sections out of the code I found that this snippet caused the issue everywhere before and after it in a 3000 line Python file.
Here is the Bad snippet of code:
import re
s1 = re.search(r'(?i)p|\*', col1) # Which looks for an asterisk or a p in the col1 string. The asterisk is escaped with \
The issue goes away after removing the "\*" or replacing above with:
pat = r'(?i)p|\*'
s1 = re.search(pat, col1)
Version below:
PyCharm 2017.3.2 (Community Edition)
Build #PC-173.4127.16, built on December 18, 2017
JRE: 1.8.0_152-release-1024-b8 amd64
JVM: OpenJDK 64-Bit Server VM by JetBrains s.r.o
Linux 2.6.32-642.6.2.el6.x86_64
Also just to add, this happens in one particular project. The code completion in other projects seems to work fine.
Same issue here! I have to click on customize highlighting level and change it to syntax level, then back to inspections to make it refresh.
Thank you for the comment Gghaibeh! This is, in fact, a different issue, I created a ticket for it: PY-28845.
Looks like this is still an issue for me with PyCharm 2018.1. Having to cut the affected code and paste it back to make errors/warnings go away.
I also still have this problem. Sometimes, however, it does update when you wait long enough. Might also just be a performance problem. Or there is an error that makes it slow.
I'm having this same problem across all projects:
PyCharm 2018.1.4 (Professional Edition)
Build #PY-181.5087.37, built on May 24, 2018
JRE: 1.8.0_152-release-1136-b39 x86_64
JVM: OpenJDK 64-Bit Server VM by JetBrains s.r.o
macOS 10.13.5
I'm having this same problem...
PyCharm 2018.1.4 (Community Edition)
Build #PC-181.5087.37, built on May 24, 2018
JRE: 1.8.0_152-release-1136-b39 amd64
JVM: OpenJDK 64-Bit Server VM by JetBrains s.r.o
Windows 10 10.0
How can solve it?
The same for me, it is very annoying, I always need to cut/paste lines to refresh state, please fix it
Hi Nikolay, could you please create a ticket in our bug tracker and attach idea.log from Help | Show Log in ...?
Hi All, I think I'm hitting the same problem. Memory and CPU are not struggling and cut+undo seems to take care of it right away.
Has anyone opened an issue for this yet?
Thanks!
-Jon
Hi Jon,
If you cannot find the issue, then you can always create your own and we will just set it as a duplicate if there is already such issue.
But please do not forget to attach idea.log from Help | Show Log in ... to it.
Hi Jon,
It is here
For a quick fix, as alluded to by OP:
I still have this problem too. The tickets seems to have timed out. Any progress on this issue?
p.s. I don't want to disable all my plug-ins. That is not really an optimal solution.
Hello @Marcus Baker!
Please submit a ticket here with an attached screencast of the behavior and
folder zipped from ***Help | Collect logs and Diagnostic Data*** .
Custom plugins are third-party software and regrettably, we have no ability to track its affection that is why it is highly recommended to disable it as the first step of the investigation. | https://intellij-support.jetbrains.com/hc/en-us/community/posts/206617049-Code-inspection-does-not-refresh-on-edit?sort_by=votes | CC-MAIN-2020-40 | refinedweb | 780 | 77.13 |
I am just learning about NEURON so please bear with me.
I am looking for a way to keep references to segments and made the following observation,
which might be helpful to other Python programmers, as NEURON behaves different from
usual Python modules:
But you store in segments a reference to the section, not a list of segments.
Code: Select all
soma = Section() segments = soma.allseg()
As I am very stubborn, I then tried
Apparently, what you get is not a list with all the segments of the section but a list of references
Code: Select all
segments = [seg for seg in soma.allseg()]
to the same segment. This is probably because of the hoc concept of <currently accessed object>.
This time I tought I could trick Python + NEURON so typed:
So later I could access segments()
Code: Select all
segments = soma.allseg
but this failed, revealing that allseg returns a reference to the section itself, which is in turn iterable,
but not subscriptable. I think it would be useful to be able to access the segments at will without having
to calculate the x value for it, so I came up with this final statement:
But trying to use the segments results in a segfault, which, as far as I understand is never desired.
Code: Select all
from copy import copy segments = [copy(seg) for seg in soma.allseg()]
Here is a sample code which will segfault on Python 2.6.5 and NEURON 7.1
I hope this is useful, and maybe you can suggest a way to store the segments? I think it would increase
Code: Select all
from neuron import * from nrn import * from copy import copy soma = Section() segments = [copy(seg) for seg in soma.allseg()] vectors = [] for seg in segments: vector = h.Vector() vector.record(seg._ref_v) vectors.append(vector)
the Pythonic feel of the bindings.
Regards
Bryan | https://www.neuron.yale.edu/phpBB/viewtopic.php?f=2&t=1968&p=7194 | CC-MAIN-2020-34 | refinedweb | 314 | 69.52 |
Python: Debugging with PDB | Comments (0)
Posted in Code on 27th April 2008, 10:12 pm by Stuart
Debugging anything can be a real pain in the backside. However with the right tools (think firebug) it actually can become enjoyable. The other day Rob, showed me the pdb module and after using it for two secs I was loving it.
Pdb is the python debugger. It’s great because it’s so simple to use; don’t take my word for it, let’s look at an example:
To use pdb you simply need to import it and set a breakpoint. Like so:
import pdb pdb.set_trace()
Now if you add this in the middle of a piece of code and run that code. The interpreter will enter the debugger at that line.
Here’s an example:
>/Users/code/Python/transmission/transmission.py(131)txcache() -> if int(time.time()) - os.path.getmtime(pickle_path) < self.max_age: (Pdb)
If I press “l” at the prompt I get some output to show where I am in the code:
(Pdb) l 126 127 import pdb 128 pdb.set_trace() 129 130 # if pickle is newer than an max_age old we'll just return it 131 -> if int(time.time()) - os.path.getmtime(pickle_path) < self.max_age: 132 return pk 133 # grab the etag and last mod data to use the request 134 else: 135 # Use the new url if it's changed - following redirection 136 if url != pk['url']: (Pdb)
And I can start printing out vars to find out what’s going on:
(Pdb) print pickle_path /var/folders/v6/v6hHYTmrGBKMrHtAaaWVek+++TM/-Tmp-/e123005fdf1bfd64848c0744ec110f45 (Pdb)
There’s a list of all of the pdb commands in the documentation where you can find out about all the options available.
On a side note: Pdb is also very handy for debugging Django applications as you can set a breakpoint and use the pdb prompt from where you are running the development server. Makes life a lot easier when it’s a cinch to know what’s going on! | http://muffinresearch.co.uk/archives/2008/04/27/python-debugging-with-pdb/ | crawl-002 | refinedweb | 340 | 69.31 |
This screen shows the merged results in the default Activity view. The left pane lists each of the activities along with the number of traces they contain, the duration, the start time, and the end time. When one or more activities are selected, the upper-right pane shows the individual traces associated with the selected activities.
Each service call is shown as a Process action activity. There are four of these in our trace, relating to the Add, Subtract, Multiply, and Divide services that our client code invokes. The client also negotiates a secure session (Set Up Secure Session) as required by the service binding options.
Click the various activities and note the list of associated traces shown in the top-left pane. You can see the type of trace and a brief description. We'll see in a moment another option for inspecting these traces.
Project View
Another view, the Project view, can be shown by clicking the Project tab in the left pane. The Service Trace Viewer supports the concept of projects. A project enables you to specify multiple tracing and logging files that should be loaded when the project is opened. This is especially useful when you have multiple participants (for example, a client calling multiple services) that you are debugging together. From the File menu, choose Save Project after you have loaded the files you want to associate.
Message View
The Message view lists all the logged messages, independently of any correlated activities. This is useful for quickly finding a specific message—for example, the message sent to the Multiply service—and inspecting its contents.
Figure 8 shows the Message view, highlighting the message sent from the client to the Divide service.
Graph View
The primary benefit of this view will be seen in a moment when we include trace files from the service project.
Note that the Live Service Trace Viewer is not supported by Microsoft, but is an interesting example of how WCF diagnostics can be extended.
Details and code can be found at.
To see this, choose File → Add (which, unlike File → Open, merges new logs with currently loaded logs) and select the SelfHost service project's tracing and message logs. The service log files will be imported and correlated with the previously loaded client logs, as shown in Figure 10.
As you can see, there is much more detail available to us. The activity list now displays activities for both the client and service projects.
In Figure 11, you can see that the client sent a message to the service, the service processed that message by calling the Subtract method, and then a response message was created and sent back to the client. This visualization is possible because of end-to-end tracing and the use of correlation to link activities.
A new activity is displayed under the service.vshost block, Execute 'Microsoft.ServiceModel.Samples.ICalculator.Subtract.' If there had been any exceptions or warnings traced, we would see them in the Graph view as yellow triangles or red circles, respectively. By expanding details to show contained activities and observing how interactions between activities and hosts are correlated, you can quickly use the Service Trace Viewer to locate the sources of unexpected behavior, whether you are a developer creating a distributed application or an IT professional investigating reported issues in production.
Filtering Results
You may find, especially with production-generated log files, that locating specific information in trace and message logs can become a challenge. For example, you may know that a particular user's session led to unexpected behavior (and for the sake of example, let's say there were no warnings or exceptions thrown, only incorrect data). This would be an extremely challenging prospect, but the Service Trace Viewer offers a flexible infrastructure for finding and filtering entries.
In the toolbar, the Find What option enables you to quickly search all traces for matching text. For example, type "Divide" and click Find. The trace list will highlight those traces containing that word.
The most powerful filtering option is the capability to create and save custom filters. Click the Create Custom Filter button at the top of the trace list to see a dialog similar to Figure 13.
This editor allows composition of filters with one or more XPath expressions. The nodes and attributes in the left pane default to those of the activity or trace that was selected when the Create Custom Filter button was clicked. Select the attribute(s) you want to query and then give the filter a name and description. After clicking OK, you can select your custom filter from the Search In list on the top toolbar to constrain the display to show only entries matching your custom filter.
Summary
In this chapter, we described how WCF utilizes much of the native functionality of the .NET Framework to improve developers' and IT professionals' abilities to diagnose issues in distributed applications.
End-to-end tracing is the concept where logically related actions in different areas of applications, and perhaps on different systems altogether, can be linked to improve our ability to follow specific scenarios through logged information. This correlation is performed by passing unique identifiers within and between endpoints of a WCF system.
Tracing and logging are simple to enable and configure, building on familiar concepts from the System.Diagnostics namespace. Tracing gives us insight into the actions occurring in our distributed applications. Message logging enables us to inspect the actual data being passed between clients and services.
The Service Configuration Editor is a useful Windows SDK tool that helps developers and administrators quickly and reliably inspect and change WCF configuration settings, including options for diagnostics.
Finally, we saw how the Service Trace Viewer, also included with the Windows SDK, is a powerful tool for visualizing and inspecting the often large amounts of data captured through tracing and message logging. It is especially useful when exceptions and warnings occur and multiple systems (or companies) are potentially involved. Developers or administrators can use the Service Trace Viewer to quickly isolate sources of unexpected behavior.
The diagnostic capabilities of WCF are an easy-to-use yet powerful way to ensure that your complex distributed applications can be effectively maintained and extended.
Please enable Javascript in your browser, before you post the comment! Now Javascript is disabled.
Your name/nickname
Your email
WebSite
Subject
(Maximum characters: 1200). You have 1200 characters left. | http://www.devx.com/dotnet/Article/37389/0/page/6 | CC-MAIN-2016-50 | refinedweb | 1,072 | 53.1 |
Last time I wrote about how the IO manager handles the creation of file handles and pointed out a potential security hole. If there is a namespace (or path) after your device's name in the path passed to CreateFile, the IO managed does not evaluate the security settings set on your device and relies on your driver to do the evaluation. For instance, if you create a device object and specify that only administrators have access to it and you do not validate access during IRP_MJ_CREATE processing, any user regardless of privilege level may open a handle to your device if they specify any namespace (i.e. "\Device\FooDevice\Blah") when opening a handle.
A gut shot reaction to this behavior is that is a very large tax for every device driver to pay and the NT kernel developers agreed. To rectify the situation a new characteristics flag, FILE_DEVICE_SECURE_OPEN, was added. This flag tells the IO manager that when a device namespace is present during handle creation that the IO manager should no longer skip the security check and should still evaluate if the caller has sufficient rights to open the device. By setting this flag, the caller's access to the object is always evaluated at the IO manager level and the driver does nothing more then set this flag.
You might say to yourself, "well that is backwards, shouldn't the driver writer get this behavior by default and choose to opt out of it instead of knowing that the device must opt in to get the most secure behavior?" and I would agree with you. The reason the most secure behavior was not made default was for backwards compatibility. This hole was not discovered until after NT 3.1 shipped and if the IO manager behavior was flipped, already shipping drivers would stop functioning.
So when should you set this flag? In my opinion you should always set this flag in a WDM driver! The one exception is if you are creating a device upon which a file system will be mounted (if you set the flag in this case, the file system will not be able to evaluate the security of the namespace string). In the opinion of the WDF team, this flag is so important that we tried to guarantee that this flag is set for all WDF device objects, even if you tried to clear it by calling WdfDeviceInitSetCharacteristics or WdfDeviceSetCharacteristics. If you are writing a KMDF driver which will have a file system mounted on top of it, this is how you would clear the flag after creating the WDFDEVICE
WdfDeviceWdmGetDeviceObject(device)->Characteristics &= ~FILE_DEVICE_SECURE_OPEN;
This KB article also discusses the side effects of the FILE_DEVICE_SECURE_OPEN flag on inbox drivers in previous OS releases. | http://blogs.msdn.com/b/doronh/archive/2007/10/04/making-sure-the-io-manager-evaluates-the-security-of-your-device.aspx | CC-MAIN-2015-27 | refinedweb | 461 | 54.46 |
User Tag List
Results 1 to 2 of 2
Thread: ActionScript 3.0 Newbie
Threaded View
- Join Date
- Nov 2012
- 3
- Mentioned
- 0 Post(s)
- Tagged
- 0 Thread(s)
ActionScript 3.0 Newbie
Hello All, I have only recently started learning as3. I need a little help! I am creating a form in Flash cs6. In the form im using the UI checkbox component. The component label says yes and no. I want users to tick either the yes or no box thats all!!
I know a little bit of the code but not all. After the function boxHandler i assume you use either the "if" or "else" statement for the two possible actions. But when i tried to execute the code i got a bunch of errors.
I be gratefull if someone can give me a example how to write the code for the checkbox. I have looked for tutorials but none of them were relevant for what i am trying to do.
My code below:
import fl.controls.CheckBox;
var checkbox = new CheckBox();
cb_box1.addEventListener(MouseEvent.CLICK, boxHandler);
cb_box2.addEventListener(MouseEvent.CLICK, boxHandler);
function boxHandler(event:MouseEvent):void{
Bookmarks | http://www.sitepoint.com/forums/showthread.php?934793-ActionScript-3-0-Newbie&p=5261256&mode=threaded | CC-MAIN-2014-10 | refinedweb | 191 | 77.84 |
OK new to C++ and want to learn it, having problem with
code that inputs file and counts the words in the file. I am doing this by character, I know I can do it by string easier! just looking for
direction.
File opens, Loop works, count works but is not correct?
As I parse a page do I have to make any other excludes for line breaks, \n or other ......
Code:#include <cstdlib> #include <iostream> #include <cassert> #include <fstream> #include <string> using namespace std; int main() { int wordCount; char prevChar; char currChar; ifstream inFile; string fileName; cout << "Enter the input file name (quit to exit): "; cin >> fileName; while (fileName != "quit"){ inFile.open(fileName.c_str()); assert(inFile); wordCount = 0; inFile.get(prevChar); inFile.get(currChar); while(inFile.get() != '\n') { if (currChar == ' ' || prevChar != ' ') wordCount++; prevChar = currChar; inFile.get(currChar); } cout << "There are " << wordCount << " words in this " << fileName << endl << endl; inFile.close(); inFile.clear(); cout << '\a'; cout << "Enter the input file name (quit to exit): "; cin >> fileName; } system("PAUSE"); return EXIT_SUCCESS; } | http://cboard.cprogramming.com/cplusplus-programming/61880-counting-words-character.html | CC-MAIN-2015-06 | refinedweb | 169 | 65.83 |
Apache Ignite: QueryEntity and Basic SQL Query With C# Client
In this article, we will configure and run a simple Apache Ignite instance, connect it with a C# client, and query a cache with SQL.
Join the DZone community and get the full member experience.Join For Free
We have lots of distributed cache solutions in our bags: Apache Ignite, Hazelcast, Oracle Coherence, JCS, Ehcache, etc.
In this article, we will configure and run a simple Apache Ignite instance, connect it with a C# client, and query a cache with SQL.
1. Configure and Run an Ignite Instance
After downloading Apache Ignite, edit the configuration file named
default-config.xml, which stands in config directory:
<?xml version="1.0" encoding="UTF-8"?> <beans xmlns="" xmlns: <bean id="ignite.cfg" class="org.apache.ignite.configuration.IgniteConfiguration"> <property name="clientMode" value="false"/> <property name="peerClassLoadingEnabled" value="true"/> <property name="discoverySpi"> <bean class="org.apache.ignite.spi.discovery.tcp.TcpDiscoverySpi"> <property name="ipFinder"> <bean class="org.apache.ignite.spi.discovery.tcp.ipfinder.vm.TcpDiscoveryVmIpFinder"> <property name="addresses"> <list> <!-- In distributed environment, replace with actual host IP address. --> <value>127.0.0.1:47500..47509</value> </list> </property> </bean> </property> </bean> </property> </bean> </beans>
As seen above, we disable the
clientMode and enable
peerClassLoading. We enable
peerClassLoading for dynamic class loading. For further information about the
peerClassLoadingEnabled property, please take a look at the documentation.
Then make some tuning about the JVM parameters if you need. You can find them in the
bin/ignite.bat file.
We will enable the H2 debug console by adding this line to the BAT file:
set IGNITE_H2_DEBUG_CONSOLE=true
We are ready to start our simple Ignite instance. Run the batch file and watch the logs.
The H2 debug console is enabled, as you can see in the log.
2. Define Your SQL-Queryable Cache and Object in Your Code
public class Seat: IBinarizable { [QuerySqlField(IsIndexed = true)] public int SeatId { set; get; } public int ActId { set; get; } public int SectionId { set; get; } public int BlockId { set; get; } public int RowId { set; get; } public int SeatNo { set; get; } public Seat(int seatId, int actId, int sectionId, int blockId, int rowId, int seatNo) { SeatId = seatId; ActId = actId; SectionId = sectionId; BlockId = blockId; RowId = rowId; SeatNo = seatNo; } public Seat() {} public void WriteBinary(IBinaryWriter writer) { writer.WriteInt("SeatId", SeatId); writer.WriteInt("ActId", ActId); writer.WriteInt("SectionId", SectionId); writer.WriteInt("BlockId", BlockId); writer.WriteInt("RowId", RowId); writer.WriteInt("SeatNo", SeatNo); } public void ReadBinary(IBinaryReader reader) { SeatId = reader.ReadInt("SeatId"); ActId = reader.ReadInt("ActId"); SectionId = reader.ReadInt("SectionId"); BlockId = reader.ReadInt("BlockId"); RowId = reader.ReadInt("RowId"); SeatNo = reader.ReadInt("SeatNo"); } }
We can see that the Seat class implements the
IBinarizable interface and the
SeatId field is annotated with
QuerySqlField. Also, the
IsIndexed parameter of the annotation is set to
true for indexing the field.
3. Start the Ignite Client With C#
IIgnite ignite = Ignition.Start("default-config-client.xml"); ICache < string, Seat > RowCache = ignite.GetOrCreateCache < string, Seat > ( new CacheConfiguration("Row", new QueryEntity(typeof(string), typeof(Seat))));
default-client-config.xml is the copy of the
default-config.xml but the
clientMode property is set to
true.
This is important: We are creating the cache with the
QueryEntity configuration. The query entity is a description of cache entry (composed of key and value) in a way of how it must be indexed and can be queried.
After running the ignite C# client, we look at the H2 debug console. We see the SQL-queryable table that we created:
When we fill the cache with the seat entities, the table is loaded and the
SeatId field is indexed. The table has
_KEY and
_VAL columns for us:
We can query the cache with the C# client as:
var sql = new SqlQuery(typeof(Seat), "where SeatId > ?", 99990); IQueryCursor<ICacheEntry<string, Seat>> queryCursor = RowCache.Query(sql); foreach (ICacheEntry<string, Seat> entry in queryCursor) Console.WriteLine(entry.Value.SeatId);
This code block will flash the
SeatIds greater than 99990:
Be careful while determining which fields of your objects can be queried and indexed. The unnecessary indexes will cause wasting the memory.
Opinions expressed by DZone contributors are their own. | https://dzone.com/articles/apache-ignite-queryentity-and-sqlquery-example | CC-MAIN-2022-27 | refinedweb | 688 | 50.63 |
User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.8.1.6) Gecko/20070725 Firefox/2.0.0.6 Build Identifier: 2007-08-09-03-mozilla1.8 In some cases, when you add an attribute to an element, other expressions (such as for form controls) that reference the attribute are not updated. Reproducible: Always
Created attachment 278601 [details] Test form demonstrating the bug When you activate the edit button next to an email address, the corresponding `person` element is marked for editing with an `s:selected` attribute; the edit group should refer to the "selected" `person` element, but it does not rebind to the newly selected `person` element. (Note that I am using XForms Buddy to verify that the attributes are actually being placed on the correct `person` element.) Also, note that the `xf:output` that counts the number of `s:selected` attributes is also not updated, and finally that the "Unselect all" button does not delete the `s:selected` attributes that are added using the edit button.
The namespace of an attribute was not considered when inserting an attribute so the actual name of the attribute that was inserted was 's:selected'. XPath however, recognizes s:selected as a namespace prefix + local name and did not match a node with an attribute whose local name was s:selected.
Created attachment 278689 [details] [diff] [review] patch Take into account namespaces when checking for duplicate attributes and inserting a new attribute.
Comment on attachment 278689 [details] [diff] [review] patch Not sure if XForms patches need approval while in M8 freeze. XForms is not part of the build.
Comment on attachment 278689 [details] [diff] [review] patch According to mozilla.dev.planning, this doesn't need approval
Checked in
checked into 1.8 branch via bug 410239. | https://bugzilla.mozilla.org/show_bug.cgi?id=394023 | CC-MAIN-2017-22 | refinedweb | 300 | 54.32 |
Difference between revisions of "D"
Revision as of 18:22, 18 October 2009
Contents
Introduction.
Installation
To program in D you will need two things - a D compiler and a library. The official compiler is called DMD and is available from Arch's community repo:
# pacman -S dmd
You now have to choose the library you want to use, Phobos or Tango. If you are having trouble deciding which library to choose, have look at a comparison between the two.
Phobos
Phobos is the standard D library. It is available from Arch's community repo:
# pacman -S libphobos
Tango
The D community, after being unhappy about several aspects of the standard D library, wrote their own library called Tango. Tango can be installed from [community]:
# pacman -S libtango
Though at the time of writing, the current release of Tango has a bug making the math modules unusable. It is therefore recommended to install Tango from SVN. The package libtango-svn available from the AUR.
Testing the installation
To make sure that everything is installed and set up correctly, a simple Hello World program should suffice.
For Phobos:
import std.stdio; int main(char[][] args) { writefln("Hello World!"); return 0; }
For Tango:
import tango.io.Stdout; int main(char[][] args) { Stdout("Hello World!").newline(); return 0; }
Paste the code into a file, name it hello.d, and run
$ dmd hello.d
in the same directory as the file. You should then be able to execute the program with:
$ ./hello
Useful libraries, bindings, etc.
- QtD - Qt bindings for D
- GtkD - An object oriented GTK+ wrapper for D
- Derelict - Bindings for multimedia libraries, focused toward game development
- Bindings - A project that houses a lot of bindings to different C libraries
- Descent - An Eclipse plugin for programming in D
Links
- Digital Mars - The official home of D
- dsource - An open source D community, hosts several open source projects
- Planet D - A collection of blogs about D | https://wiki.archlinux.org/index.php?title=D&diff=78900&oldid=78899 | CC-MAIN-2018-09 | refinedweb | 322 | 55.84 |
A Journey with Domain Driven Design (and NHibernate) - Part 8
Thursday, December 14 2006 1 Comment.
I created the Item.hbm.xml:
<hibernate-mapping
<class name="Item" table="Items">
<id name="Id" column="itemId">
<generator class="identity" />
</id>
<property name="Name" not-
<property name="Upc" not-
</class>
</hibernate-mapping>
and Video.hbm.xml:
<joined-subclass
<key column="itemId" />
<many-to-one
<property name="Format" type="Int32" column="videoFormatId" />
</joined-subclass>
In the video mapping, you can see how it inherits from the Item class. If you recall back to where I explained how inheritance works, you can see it in action here. Each video will have it’s Name and UPC stored in the Items table, and the Format and MovieId in the Videos table. The Movie.hbm.xml is below:
<class name="Movie" table="Movies">
<id name="Id" column="movieId" access="nosetter.camelcase-underscore">
<generator class="identity" />
</id>
<property name="Name" not-
<property name="Year" not-
<property name="VideoReleaseDate" not-
<property name="Category" type="Int32" column="categoryId" not-
</class>
This should give you an idea on how to map your entities.
I also did a little refactoring on the naming of my classes. I didn’t like the naming of VideoGame because I thought it was better represented as a GameTitle. I also renamed Transaction to RentalTransaction. This will help avoid confusion when talking about database transactions. I realize that not everything will be a rental (obviously most video stores also sell movies and candy, etc) but this name will suffice for now. Since I am backed up by tests, I can refactor often and with complete confidence that I haven’t broken any old code.
So let’s revisit our feature list
Add new Customer / Account Add other members to an account
- Restrict Certain members from renting certain content
- Query for a customer by customer # (swipe card, etc), phone number, or last name
Add new rental item (move game, console, vcr, etc) Rent an item to a customer
- Check Items Back in
- Get movies checked out for a customer
- Query for an item, see who has it
Some of the remaining things on the list involve querying, so we’ll create a class to assist in that. Listed below is the overview of a class called Repository.
Repository takes advantage of generics to avoid a lot of duplicate code. This is a quick implementation of the Repository pattern, you’ll find more in-depth implementations in Ayende Rahien’s Rhino Commons and Dave Donaldson’s NHibernate Repository. The main point here is that we can abstract 90% of NHibernates functionality in an easy to use class. If we need to do something complex, we can either expose some more methods here, or we can expose the session to the rest of your project. This is a design choice that is really up to you. I generally choose to hide NHibernate from UI developers, especially junior developers.
I provided some static members for just retrieving data, however to save data and participate in transactions, I created instance methods. This class will serve most all of our data access needs. It is the single communication point with our persistence layer to the presentation layer.
One side-note. I have not written any tests for this class (shame on me!). I find it difficult to test it without duplicating what I have already done with the integration/persistence tests. I imagine that I could use a mocking framework like NMock or RhinoMocks, however this would distract from the series and frankly I am not very skilled at mocking. If someone would like to inject a few words about this in the comments, I’d love to hear them.
Ok, back to our list. I’ll tackle Restrict Certain Members from renting certain content. This basically means that minors shouldn’t be able to rent rated R movies.
The ratings for our items apply not to the items themselves, but to the Movie and GameTitle classes. So to validate that the customer can rent one of these items, we must inspect the rating.
A naïve approach would be like this:
public void AddRental(Rental r)
{
//don't allow the same rental to be added twice
if (_rentals.Contains(r)) return;
if(r.Item is Video)
if(!((Video)r.Item).Movie.Rating > _customer.RentalRestriction)
throw new ApplicationException("Customer cannot rent this movie.");
if(r.Item is Game)
if(!((Game)r.Item).GameTitle.Rating > _customer.RentalRestriction)
throw new ApplicationException("Customer cannot rent this game.");
_rentals.Add(r);
_subTotal += r.RentalPrice;
}
The bold portion is what I added to check for the rating. This code should never see the light of day. Each new type of item needs another cryptic if statement here. A better solution is to use the Template Method design pattern. We’ll leave it up to the item to setup a construct for verifying that rentals are allowed.
By default, we won’t restrict rentals. In the item class, we’ll provide a virtual method that returns true always. Inherited classes can make their own decisions by overriding the method.
public virtual bool CanRentFor(Customer customer)
{
return true;
}
In our Video class, we need to base our decision off of the Movie’s rating.
public override bool CanRentFor(Customer customer)
{
return _movie.Rating <= customer.RentalRestriction;
}
In our Game class, we need to base the decision on the GameTitle’s rating.
public override bool CanRentFor(Customer customer)
{
return _gameTitle.Rating <= customer.RentalRestriction;
}
For another Item we might create, say Console, we can choose to accept the default behavior or write our own. This will ensure that certain customers do not rent items that they are not allowed to rent.
I’ve added a few tests and ensure they are passing.
Now I’ll switch gears and look at the next item on the list, which is Can Query for Account by # (swipe card) or customer phone number. This requirement will allow us to bring up the customer’s account when they are at the counter. We would normally extend this requirement to add many more search options, however to be brief, we’ll just implement the two of them.
For this we can make excellent use of the Repository class we wrote earlier. This test will involve the database, so we will place it in the Persistence test project.
I want to keep the database related code out of the DomainModel class. I created a class that can hold any of our queries for us. This way we keep a clean separation between the model and persistence. Remember, we cannot have a dll reference to the persistence project in the domain model project. (This would lead to circular references – not to mention a bad design idea).
Here is the AccountFinder class:
public class AccountFinder
{
Repository<Account> _repository;
public AccountFinder(ISession session)
{
_repository = new Repository<Account>(session);
}
public Account FindById(int id)
{
return _repository.Session.Get<Account>(id);
}
public IList<Account> FindByCustomerPhone(string phone)
{
string hql = "SELECT a FROM Account a JOIN a.Members c WHERE c.HomePhone LIKE :phone";
IQuery query = _repository.Session.CreateQuery(hql);
//this will set our parameter named :phone
query.SetString("phone", phone);
return query.List<Account>();
}
}
Here I am allowing you to specify the session to use in the constructor. This way we can easily supply a session with a transaction (which will come in handy for the test). In the first method we simply defer the call to Session.Get(). The second method takes advantage of HQL, or Hibernate Query Language. This allows us to write queries easily, using familiar syntax, only we speak in terms of our objects. You don’t see any database columns here. HQL is very powerful, but can take some getting used to, because the results of your queries go directly into objects. I’ve found that the best reference so far for HQL is Hibernate in Action book.
I created 2 tests to verify the above functionality:
[Test]
public void CanQueryForAccountByIdWithRepository()
{
using (ISession session = SessionSource.Current.GetSession())
{
using (ITransaction tx = session.BeginTransaction())
{
Account acct = new Account();
Customer customer = new Customer("Some", "Dude");
customer.HomePhone = "212-224-3456";
customer.Address = new Address();
acct.AddMember(customer);
session.SaveOrUpdate(acct);
session.Flush();
int id = acct.Id;
AccountFinder finder = new AccountFinder(session);
Assert.AreEqual(acct, finder.FindById(id));
tx.Rollback();
}
}
}
[Test]
public void CanQueryForAccountByCustomerPhoneWithRepository()
{
using (ISession session = SessionSource.Current.GetSession())
{
using (ITransaction tx = session.BeginTransaction())
{
Account acct = new Account();
Customer customer = new Customer("Some", "Dude");
customer.HomePhone = "212-224-3456";
acct.AddMember(customer);
session.SaveOrUpdate(acct);
session.Flush();
int id = acct.Id;
AccountFinder finder = new AccountFinder(session);
IList<Account> matches = finder.FindByCustomerPhone(customer.HomePhone);
Assert.IsTrue(matches.Contains(acct));
tx.Rollback();
}
}
}
And they are both passing! We’ve come to a good stopping point here. I’d like to wrap up our feature list next time, then start on a basic UI.
I’ve gotten a lot of positive feedback so far with this series, and I always welcome more! If you haven’t downloaded the code to follow along I encourage you to do so.
Here is the latest source: Videocracy - Part 8
Carlo Bertini
2.14.2007
9:00 AM
Good tutorial, i hope to view next lession :P:P:PCarlo | http://flux88.com/blog/a-journey-with-domain-driven-design-and-nhibernate-part-8/ | crawl-002 | refinedweb | 1,538 | 57.57 |
It looks like someone linked you here to our printer friendly page. Please make sure you go Back to Safehaven.com for more great articles just like this one!
Rusty Old Tin Can of Gold.
"In three chaotic days last week, gold fell $14 on the London market," Time explained almost 37 years ago, noting gold's plunge from $198 per ounce at the start of 1975.
Gold's new 31-month low of $105.50 an ounce "[was] a dismal figure for goldbugs," the magazine went on, "who not long ago were forecasting prices of $300 or more."
Spooky, no? 10 years ago this month, in fact, that the number of bullish gold futures on the US Comex market held by professional speculators first broke above 100,000 contracts.
And to celebrate that anniversary, last week the number of bearish contracts held by that same group - professional speculators - leapt above 90,000 for the first time since mid-1999...
Coinciding with the New York Times'.
Gold has come a long way since its Brown Bottom. But gold speculators and hoarders?
- umm - 18 months ago a mere year-and-a-half after the, umm, peak. But what with gold prices failing to make new highs, the Eurozone crisis must be as near-to-finished as the broader global financial crisis. The US Fed is also about to start raising interest rates much sooner than anyone expected, driving a stake into the heart of the case for gold as cash-in-the-bank starts to pay a real return once again.
Or so runs the fast-rolling bandwagon. You can measure its momentum in the Net Long position of professional traders on the gold futures market. It shrank dramatically over the last 3 months, down 43% to its smallest level since just after Lehman's collapsed. That rate of change has been outpaced only 10 times in the last decade.
The average change in the gold price over the 3 months that followed? A tasty 7.8% on BullionVault's analysis today, with only 3 of those 10 occasions failing to deliver a positive 3-month return (and even then managing only a 2.1% drop).
Still, a gold bull market gripped the last decade, of course. And whether the recent bearishness will run deeper or turn tail, time will tell (or not. According to its online archive, Time magazine has given few column inches over to gold investing since the Sept. 2011 highs). Meanwhile, the bearish bandwagon may already have lost a wheel. Italy's elections and the Fed chairman's latest speech today don't quite fit that consensus.
Straws in the wind maybe. But they don't quite fit a long-term drop in gold prices either. Which may be too bad for long-term gold buyers hoping for a proper pullback in prices, such as 1975-1977 offered. | http://www.safehaven.com/print/28955/rusty-old-tin-can-of-gold | CC-MAIN-2014-42 | refinedweb | 481 | 81.53 |
Earlier I created a Reminder Service using ASP.NET Core Web API. For simplicity I used a Hashset in C# as the repository for the reminders. It might be more useful to use a database, and therefore in this example I will create a .NET Core Console Application that uses Entity Framework Core to create a SQLite Database and perform various CRUD operations. Later I will add EF Core and SQLite to the Reminder Service.
Entity Framework Core and SQLite
I open a bash terminal on macOS and create a new .NET Core Application, restore the Nuget Packages, and open everything in Visual Studio Code.
mkdir efcore cd efcore dotnet new dotnew restore code .
I just need to add 1 dependency for this application and that is Microsoft.EntityFrameworkCore.Sqlite. I'm not going to work with the Entity Framework Tools and Database Migrations in this example. I will write about those later.
"dependencies": { "Microsoft.EntityFrameworkCore.Sqlite": "1.0.0" },
Once I have added the new dependency, I re-run
dotnet restore from the Visual Studio Code Command Palette (CMD-SHIFT-P).
Next, I create a class, called
Reminder, that will serve as the entity for a reminder. I'll give it a primary key of
Id and the
Title Property will be the actual reminder.
using System.ComponentModel.DataAnnotations; namespace DatabaseApplication { public class Reminder { [Key] public int Id { get; set;} [Required] public string Title { get; set;} } }
Now I need to create a class, called
SqliteDbContext, that represents the SQLite Database. The database file will be called Reminders.sqlite.
using Microsoft.EntityFrameworkCore; namespace DatabaseApplication { public class SqliteDbContext : DbContext { public DbSet<Reminder> Reminders { get; set; } protected override void OnConfiguring(DbContextOptionsBuilder optionsBuilder) { optionsBuilder.UseSqlite("Filename=./Reminders.sqlite"); } } }
That's crazy simple, right? The last thing I need to do is just perform my CRUD operations.
using System; using System.Linq; using Microsoft.EntityFrameworkCore; namespace DatabaseApplication { public class Program { public static void Main(string[] args) { using (var context = new SqliteDbContext()) { // Start with a clean database context.Database.EnsureDeleted(); context.Database.EnsureCreated(); //}"); } } } } }
I'm having Entity Framework Core create the database. Like I mentioned earlier, I could be a bit more proactive and use the EF Core Command Line Tools and Data Migrations. I'll do that next time. Once the database is created, I just add a few reminders, delete a reminder, and then re-fetch reminders. The output looks like this. I added some spacing so you can see that in the first list there are 2 reminders and in the next list there is only 1 reminder.
Meditate Eat a nutritious breakfast Eat a nutritious breakfast
Next time I will add this functionality to the ASP.NET Core Web API Reminder Service. Things will be a little different, because I'll be using ASP.NET Core and its depdendency injection framework.
You can find me on twitter as @KoderDojo! I hope this was useful!
Posted by Koder Dojo
Welcome to Koder Dojo! I am a freelance C# ASP.NET MVC Developer learning ASP.NET Core and Python. This website is a code dump of my adventures. If you enjoy the examples, you can follow me on my twitter account, @KoderDojo. I'm hoping my samples enourage and inspire others! Best wishes! | https://www.koderdojo.com/blog/getting-started-with-entity-framework-core-and-sqlite | CC-MAIN-2020-10 | refinedweb | 540 | 59.4 |
icehouse RHEL external port down| VMs with external IPS not accessible
I have several issues with my new installation. But ill add different questions in ask.openstack
I did not install openswitch plugin, i am using the ML2 plugin
The issue is networking with my new VMS. i have a demo network, demo subnet, demo router. The router has two interfaces, one for the internal network, the other for the external. I am able to ping the external port IP 172.16.11.10, but state says its DOWN, VM IPS 172.16.11.16 and 172.16.11.18, I am not able to ping any vas with public IPS on the 172.16.11.0/16 network. I have two VMS currently running.
Does the router saying its DOWN? Says its down, but i can ping 172.16.11.10 , but thats it.
root@controller ~]# neutron port-show 82f675e4-3843-48b2-af99-da7d98139ae1 +-----------------------+-------------------------------------------------------------------------------------+ | Field | Value | +-----------------------+-------------------------------------------------------------------------------------+ | admin_state_up | True | | allowed_address_pairs | | | binding:host_id | network | | binding:profile | {} | | binding:vif_details | {"port_filter": true, "ovs_hybrid_plug": true} | | binding:vif_type | ovs | | binding:vnic_type | normal | | device_id | dd6d5c92-e93a-4583-8a82-d45b728868c6 | | device_owner | network:router_gateway | | extra_dhcp_opts | | | fixed_ips | {"subnet_id": "d09ccb0b-5e78-4f35-814e-d9298d9b9781", "ip_address": "172.16.11.10"} | | id | 82f675e4-3843-48b2-af99-da7d98139ae1 | | mac_address | fa:16:3e:a4:3e:31 | | name | | | network_id | abc33382-5f10-45a8-b9d6-1282f76dcedc | | security_groups | | | status | DOWN | | tenant_id | | +-----------------------+-------------------------------------------------------------------------------------+
Please, format your text.
I also met.if you use nova-network can be create instance ;
now,i don't know why use neutron produce error;; neutron agent-list alive is status xxx you can read ---> (link text)
Please , reproduce this report for demo's qdhcp-xxxxxxxx namespace , sourcing demo's credentials.
If you have not empty output for
$ ip netns list | grep router_id ( for any router)
Then run :-
$ ip netns exec qrouter-router-id iptables -S -t nat
I was able to get the output for ip netns list
and here is the output of the routers
[(more) | https://ask.openstack.org/en/question/28033/icehouse-rhel-external-port-down-vms-with-external-ips-not-accessible/ | CC-MAIN-2020-34 | refinedweb | 322 | 65.32 |
sun compiler and gdb736153 May 10, 2012 3:36 PM
I would like to debug a Sun Studio 12.2 compiled program using gdb. gdb folks say [1] this should be theoretically possible. However I got two problems depending on gdb version:]
This content has been marked as final. Show 7 replies
1. Re: sun compiler and gdb736153 May 11, 2012 12:16 PM (in response to 736153)I have tried contacting Oracle through RFE form, got response that it should work already, wanted to reply (that it does not for me) but unfortunately the mails do not get through as ucsinet40.oracle.com [156.151.31.68] claims that: "521 5.0.0 messages are no longer accepted for sun.com" (original e-mail address was: incidentupdatedaemon@sun.com). Any other way to contact the guy (Steve) who wrote to me regarding this issue (Incident Review ID: 2246622)?
Edited by: user3222357 on May 11, 2012 10:15 AM
2. Re: sun compiler and gdbSteve.Clamage-Oracle May 11, 2012 3:37 PM (in response to 736153)The bugs.sun.com mechanism for reporting bugs is being phased out. It will be replaced by the standard Oracle bug reporting mechanism as the former Sun groups (like Studio) transition from the old Sun bug database to the Oracle bug database. Look for an announcement in the Forums when the new mechanism is in place.
I replied to the bug report. Briefly, I have no difficulty building a program with -g using Studio CC and running it under gdb, setting breakpoints and stepping through code. Debugging functionality, however, is very limited compared to using dbx.
DWARF provides for vendor-specific additions. Both gcc and Studio use (different) vendor-specific extensions. The Studio extensions allow for much more detailed debugging than gcc/gdb does.
A DWARF client is supposed to ignore vendor-specific extensions that it doesn't understand, so the presence of Studio DWARF extensions should not affect gdb.
If you can post a small example that demonstrates the problem you are having, someone here can have a look at it. Be sure to provide details about the platform you are on, and the versions of Studio and gdb that you are using.
3. Re: sun compiler and gdb736153 May 11, 2012 4:26 PM (in response to Steve.Clamage-Oracle)1. You can find all the details (including trivial test code, executable, dwarfdump output, compiler versions, architectures) in the link to discussion on gdb list that I have provided in my first post. Basically I agree that these compiler specific extensions should be ignored by gdb. However it seems they are ignored for you (and then it works correctly), but they are not for me (at least gdb complains about them and does not allow to set breakpoint). Maybe I should be using some specific compiler options, maybe the compiler version we are using is different. I originally tried gdb 7.0.1 and 7.4.1, but seeing that you are using 6.7.1 I also tried that one and still no luck (get an error about unknown attribute).
2. What functions of dbx would I lose by switching to gdb? Debugging (at least for the sake of this discussion) is mostly about stepping through the code, setting breakpoints (of various types) and reading/modifying values of variables. For me the biggest problem with dbx is that is does not integrate with QtCreator. If at least some adapter existed (which would behave like gdb but use dbx inside)...
Edited by: user3222357 on May 11, 2012 2:26 PM
4. Re: sun compiler and gdbSteve.Clamage-Oracle May 11, 2012 5:43 PM (in response to 736153)I looked at some of the thread in the gdb forum, and found some usage errors in the examples.
In particular, do not use -xO0 because it is not a documented or supported option. You cannot expect any particular result if you use it.
I ran my test case using Studio 12.2 and 12.3 as
gdb doesn't seem to know how to demangle names for display, and can't find class member functions (probably for the same reason), but can break point on file-level functions.
CC -g myprog.cc gdb a.out
I did not see any complaints about DWARF.
5. Re: sun compiler and gdb736153 May 11, 2012 8:21 PM (in response to Steve.Clamage-Oracle)Here is how it looks for me:
Then where lies the difference...?
cat test.cpp#include <iostream>
using namespace std;
int main()
{
int i=0;
i++;
cout<<i<<endl;
}
CC -VCC: Sun C++ 5.11 SunOS_sparc 2010/08/13
usage: CC [ options ] files. Use 'CC -flags' for details
CC -g test.cppGNU gdb 6.7.1
gdb -readnow ./a.out
This GDB was configured as ""...
Die: DW_TAG_<unknown> (abbrev = 9, offset = 411)
has children: TRUE
attributes:
DW_AT_name (DW_FORM_string) string: "basic_ostream"
DW_AT_<unknown> (DW_FORM_string) string: "nNbasic_ostream3CTACTB_"
DW_AT_decl_file (DW_FORM_data1) constant: 2
DW_AT_decl_line (DW_FORM_data1) constant: 74
Dwarf Error: Cannot find type of die [in module /login/sg209371/gdbtest/a.out]
(gdb) quit
uname -aSunOS s10host 5.10 Generic_137137-09 sun4u sparc SUNW,Sun-Fire-V490
>
Edited by: user3222357 on May 11, 2012 6:20 PM
6. Re: sun compiler and gdb736153 May 19, 2012 4:51 PM (in response to 736153)Any idea what might be the diffrence between our systems? Do you have a gdb version that is compiled from sources provided by gdb team or is it patched in any way? Do you use the exact same compiler version?
7. Re: sun compiler and gdbSteve.Clamage-Oracle May 21, 2012 11:49 AM (in response to 736153)The gcc/gdb components I use are built from gcc/gdb source code by an internal Oracle team for use on Solaris. I'm sure that changes to gcc/gdb code are minimal, but I can't say whether there are any changes at all. | https://community.oracle.com/thread/2389490?tstart=60 | CC-MAIN-2015-18 | refinedweb | 990 | 66.03 |
[SRU, 9.10] libboost-python1.38 issues with __doc__ property in Python >= 2.6.3
Bug Description
Python >= 2.6.3 has changed the way the __doc__ property is implemented. Boost.Python 1.38 does not account for this, yet, leading to many errors executing Python code using the Boost implemented bindings.
An example trying to use a sample from python-visual:
guy@mountpaku:
Traceback (most recent call last):
File "orbit.py", line 1, in <module>
from visual import *
File "/usr/lib/
import cvisual
AttributeError: 'Boost.:
https:/
* Post on Python Ogre and the __doc__ property issue:
http://
* Discussion of a similar issue from PySide:
http://
ProblemType: Bug
Architecture: i386
Date: Thu Oct 22 10:59:00 2009
DistroRelease: Ubuntu 9.10
NonfreeKernelMo
Package: libboost-
ProcEnviron:
PATH=(custom, user)
LANG=en_NZ.UTF-8
SHELL=/bin/bash
ProcVersionSign
SourcePackage: boost1.38
Uname: Linux 2.6.31-14-generic i686
XsessionErrors: (polkit-
additionally, all demos in python-visual 5.11 and 5.13 work fine with boost svn, so this is most definately not a vpython issue.
This bug is in Karmic release. If we could find the exact commit that fixes this bug, we could get it easily into Karmic. The other option is to see how big the diff is in the lib/python/src section of the code, and see if the svn version fixes it.
@sweetsinse, could you try compiling boost with the Karmic version of the source BUT replace the libs/python directory with the version in the svn trunk? ( $ sudo apt-get source libboost1.38 )
If that works, we could get a small patch that makes boost usable in karmic.
https:/
Packages have been built for testing in my PPA at https:/
As far as I've been digging into this, I think this is a Python's bug. See Issue #5890 on which I just commented: http://
It was caused by a change in python to fix issue 5890, as referenced in http://
I have just given the proposed bug fix a spin by using the packages from ppa:ajmitch. At least all the samples from python-visual that I've tried did work properly, now. Well done! I think we've got a go here!
Hi all,
I tried update the boost packages after I install VPython from Ubuntu repository but I still can't get my VPython script working. Do I need to compile the source to get it working?
Dear Scott,
I tried that but still it did not work. Here is the output from the terminal when I run my VPython script:
teonghan@
(<unknown>:3073): GdkGLExt-WARNING **: Cannot open \xe8\u0002\
(<unknown>:3073): GdkGLExt-WARNING **: Cannot open \xe8\u0002\
glibmm-ERROR **:
unhandled exception (type std::exception) in signal handler:
what: Unable to get extension function: glCreateProgram
aborting...
Aborted
Anyway, I manage to try boost packages from Andrew's PPA in a fresh Karmic installation using VirtualBox and it works. Maybe I messed up with the libraries installations. Still hope I won't need to do fresh installation though.
I have installed the ppa's from Andrew Mitchell and can confirm that it fixes the the issue.
Hi all,
I reformat my HD and do fresh installation of Karmic on it. The first thing I did after I log in for the first time, I straight away install python-visual from the repo which pull all the dependencies, including those boost packages from Andrew's PPA. I restart my comp and still I can't use VPython, got the same problem like my previous post here. This morning, I looked into the VPython source/INSTALL and I just simply install "libgtkglextmm-
@teonghan: Two things on that:
* This should be a problem of the python-visual package, rather than the boost packages.
* python-visual should then probably also depend on libgtkglextmm-
*never* depend on a "*-dev" package, which should just contain headers for compilation/
which you're not doing.
You should file a new bug for python-visual on this issue.
Got the bug too, but it was fixed by the updated libboost packages from the mentioned ppa. Thanks!
I can confirm that the ppa fixes the bug for libavg.
Thanks for the PPA, it fixed this issue for me on Ubuntu 9.04.
I think for now, it should be in the standart repository asap!
I don't have this issue any longer even with packaged karmic version of both boost+python. Can someone test the minimal testcase at http://
Please ignore my previous comment, I had the ajmitch's ppa enabled without knowing. (The karmic version really doesn't work)
r1991 detects the issue and tells the user what to do.
(Uh, sorry again, different bug. :-| )
It would be interesting to see whether anybody has tested this bug on libboost1.40.0 from lucid, yet.
Is it still (going to be) an issue, or is it resolved on 1.40.0?
If so, then this bug would just "grow out". If not, then severe action is required in order to prevent another "broken" release on this issue.
I just tested minimal testcase [1] with 1.40.0-4ubuntu2 on lucid (current) and it is still broken.
[1] http://
The 1.40.0-2ubuntu2 on karmic is broken as well.
I filed separate bug #539049 for 1.40 so that (hopefully) someone applies the patch in lucid.
I put rebuilt boost packages for both karmic and lucid are in https:/
SRU request:
A statement explaining the impact of the bug on users and justification for backporting the fix to the stable release:
See description, specifically this causes depending modules to segfault
An explanation of how the bug has been addressed in the development branch, including the relevant version numbers of packages modified in order to implement the fix:
It has been fixed upstream. We are cherry picking the fix from commit (SVN r53731)
A minimal patch applicable to the stable version of the package. If preparing a patch is likely to be time-consuming, it may be preferable to get a general approval from the SRU team first.
See attached debdiff
Detailed instructions how to reproduce the bug. These should allow someone who is not familiar with the affected package to reproduce the bug and verify that the updated package fixes the problem. Please mark this with a line "TEST CASE:".
TEST CASE:
An example trying to use a sample from python-visual:
guy@mountpaku:
Traceback (most recent call last):
File "orbit.py", line 1, in <module>
from visual import *
File "/usr/lib/
import cvisual
AttributeError: 'Boost.
A discussion of the regression potential of the patch and how users could get inadvertently affected.:
This has been tested upstream (and through the ppas linked above in ubuntu) and regressions have not been seen.
@Scott: this bug is reported for boost1.38 which is not in lucid (bug #539049 is for lucid version); will SRU request on libboost1.38 will get attention? Also, why is this "new" and not "confirmed" anymore?
>@Scott: this bug is reported for boost1.38 which is not in lucid (bug #539049 is for lucid version);
Yes - two bugs make sense: one for the SRU in karmic and one for a bug fix upload into lucid
>will SRU request on libboost1.38 will get attention?
The sponsors team is subscribed, they usually do a good job getting back. To get more attention, we should hop onto #ubuntu-devel and try to get someone from the stable release team to look at this bug (and the lucid one). I probably won't be able to do that for a day or two, so feel free to grab someone from irc to take a look at this.
>Also, why is this "new" and not "confirmed" anymore?
the stable release team, archives, and ubuntu-sponsors teams use different importance to track the progress of their inclusion of the patch. Once a team is subscribed, status doesn't matter (they will use it to signal to each other the status of the request). However, I'll make it triaged since that status is not reserved for their workflow. I'll fix the other bug's status as well.
An example:
https:/
#.
ACK from -SRU for the debdiff in comment #28.
Wontfix forLucid since 1.38 has been removed.
For the record, same problem in lucid, but with boost 1.40, is already fixed in packages (bug #539049).
Accepted boost1.38 into karmic-proposed, the package will build now and be available in a few hours. Please test and give feedback here. See https:/ testing should be done with the actual package in -proposed, because it's binary-copied to -updates. This might seem pedantic, but in the past we have had regressions caused by race conditions in the source building process -- the lesson learned is to test the actual update that'll be pushed out.
On Apr 24, 2010, at 4:27 PM, Václav Šmilauer wrote:
>, 9.10] libboost-python1.38 issues with __doc__ property in Python >= 2.6.3
> https:/
> You received this bug notification because you are a member of Ubuntu
> Stable Release Updates Team, which is a direct subscriber.
I have just tested the libboost-
(Beware, some mirrors don't have this package, yet. It took some checking first ...)
Unfortunately, it seems like the error is still there:
$]: from visual import *
-------
AttributeError Traceback (most recent call last)
/home/gkloss/
/usr/lib/
56
57 import crayola as color
---> 58 import cvisual
59 cvisual.
60 from cvisual import (vector, mag, mag2, norm, cross, rotate, comp, proj,
AttributeError: 'Boost.
Guy, I have to contradict your observation.
I just tried in karmic chroot with the package, adding karmic-proposed to sources.list I upgraded via apt-get
Get:2 http://
and then
root@flux:
Python 2.6.4rc2 (r264rc2:75497, Oct 20 2009, 02:54:09)
[GCC 4.4.1] on linux2
Type "help", "copyright", "credits" or "license" for more information.
>>> from visual import *
>>>
works flawlessly.
Are you sure you really had the package installed? (sorry for such a stupid question, but I see no other possible cause)
Václav, of course, I might have gotten something wrong, but I've just tried it again. I've used the nz.archive.
gkloss@it041227:~$ wget http://
--2010-05-11 10:23:32-- http://
Resolving alb-cache.
Connecting to alb-cache.
Proxy request sent, awaiting response... 200 OK
Length: 240038 (234K) [application/
Saving to: `libboost-
100%[==
2010-05-11 10:23:33 (10.1 MB/s) - `libboost-
Now install it manually, after before (forcefully) removing it:
$ sudo dpkg -i libboost-
Selecting previously deselected package libboost-
(Reading database ... 337560 files and directories currently installed.)
Unpacking libboost-
Setting up libboost-
Processing triggers for libc-bin ...
ldconfig deferred processing now taking place
And now for the test:
gkloss@it041227:~$ python
Python 2.6.4 (r264:75706, Dec 7 2009, 18:45:15)
[GCC 4.4.1] on linux2
Type "help", "copyright", "credits" or "license" for more information.
>>> from visual import *
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
File "/usr/lib/
import cvisual
AttributeError: 'Boost.
>>>
I've just tested & confirmed it as being fixed on amd64, I'll setup an i386 VM & see if I can reproduce this.
Just retested on another box. Result is positive.
Also I've now gone and also reinstalled python-visual, and guess what, it works as well. There must've been some things "wrong" after all the tinkering to get python-visual working under karmic last year.
So: Thumbs up for the fix!
This bug was fixed in the package boost1.38 - 1.38.0-6ubuntu6.1
---------------
boost1.38 (1.38.0-6ubuntu6.1) karmic-proposed; urgency=low
* Apply patch from SVN r53731 to fix the static property initialization
- patches/
-- Andrew Mitchell <email address hidden> Wed, 11 Nov 2009 16:55:00 +1300
i can confirm that building the trunk boost libraries solves this issue.
boost 1.40.0rc1 was not sufficient | https://bugs.launchpad.net/python/+bug/457688 | CC-MAIN-2015-48 | refinedweb | 1,989 | 65.42 |
PEAK MILK FULL CREAM POWDER MILK
All Peak products, including its powder milk and condensed milk, contain 28 vitamins and minerals, including vitamin B1, B12 and iodine. Peak milk is a nourishing, refreshing and versatile drink. Several dishes can be prepared with Peak...
South Africa
South Africa
Full Cream Milk Powder
Description Full Cream Milk Powder is produced from pure, natural fresh cow’s whole milk. After receipt of the milk at the dairy plant, the liquid whole milk is pasteurised, standardised to the required level of milkfat, evaporated into a...
United States
United States
SKIMMED MILK POWDER
Our Company is a professionally managed organization which is engaged as the , Exporter, Importer and Supplier of Skimmed milk Powder. Our products are widely demanded in the Food & Beverage Industry. Below is a brief specification about our Skimmed ...
Turkey
Turkey
Full Cream Milk Powder
Produced from fresh, high quality whole milk by a spray-drying process.It contains 5% or less moisture (by weight) and not less than 25% milkfat (by weight).Liquid milk replacement, Yoghurt, ice-cream, bakery & confectionery, chocolate, processed ...
Ukraine
Ukraine
Skimmed milk powder 1,25% fat
Paking in 25 kg bags. Volume in 40"HCREF container - 25 MT Origin EU (Latvia, Lithuania, Estonia). Skimmed milk powder 1.25% fat We will calculate you CIF Price. Give us your port of destination. MOQ - 1 container. FCMP 26% fat also possible, but only ...
Latvia
Latvia
fat filled milk powder 26%
TECHNICAL DATA Fat Filled Milk Powder 26 Product Description: Fat filed milk powders are produced by blending palm or coconut vegetable fat with high quality skimmed milk powder. FFMP is used to replace Full cream milk powder (FCMP) while being more ...
Aptamil Milk Powder
We distribute high quality products from the brands Milupa and Hipp. We guarantee the highest quality standards, we only deal with fresh goods directly from the factory. We guarantee a BBD of 16-17 months. Original Milupa Aptamil Certificate...
Germany
Category: Food & Beverage | Baby Food
Germany
99% Cabergoline Dopamine 81409-90-7 Receptor Dostinex Caberlin Prohormones Series
Product name: Cabergoline Alias: Dostinex CAS: 81409-90-7 MF: C26H37N5O2 MW: 451.6 Melting Point: 102-104ºC Chemical properties: Cabergoline is a white powder soluble in ethyl alcohol, chloroform, and DMF, and insoluble in...
Category: Chemicals | Pharmaceutical
China
Oxymetholone(Anadrol)
Name: China oxymetholone white powder Trade name: Anadrol ...
Category: Chemicals | Pharmaceutical
China
British Aptamil First Infant Baby Milk Powder from Birth Onwards Stage 1(900g)
This is Jstradings a Turkish Branded company which can be described as a complex industrial group , producers and exporters of a Variety of Products Ranging from Frozen whole chicken and parts, Coffee ,Nescafe,Red bull Energy Drink,Heineken Beer and ...
United Kingdom
Category: Agriculture | Milk
United Kingdom
Full Cream Milk Powder
100 % FULL CREAM MILK POWDER from EUROPE origin and 100 % from COW'S MILK HIGH QUALITY ADPI EXTRA GRADE TECHNOLOGY 1. General specification: Producer under European Union requirements on food production. Fat content: min. 26 % Moisture: max. 4 % .....
Thailand
Date: May 9, 2016
Thailand
100% Pure Goat Milk Powder
1.Goat milk produced fresh from our own goat farms. 2.We are the largest goat milk producing company in our region. Goat Milk Powder specifications 1.100% fresh milk spray dry powder 2.Additive free 3.Antibiotic free 4.Pure Natural dairy .....
United Kingdom
Date: Mar 23, 2016
United Kingdom
Full Cream Milk Powder
Milk Powder is manufactured from fresh standardized whole milk from which only the water has been removed. Instant Whole Milk Powder has been agglomerated and lechithinated to produce a free flowing powder that is cream in color. Instant Whole Milk .....
Thailand
Date: Mar 30, 2016
Thailand
Selling vegetable fat milk powder
SKYPE:tracyregan Product Description: Fat filed milk powders (FFMP) are produced by blending palm or coconut vegetable fat with high quality skimmed milk powder. FFMP is used to replace Full cream milk powder (FCMP) while being more economical. .....
Date: Feb 16, 2016
Category: Food & Beverage | Other Dairy Products
Whole Milk Powder / Skimmed Milk Powder / Condensed Milk / Evaporated Milk
Description 100 % FULL CREAM MILK POWDER from EUROPE origin and 100 % from COW'S MILK HIGH QUALITY ADPI EXTRA GRADE TECHNOLOGY 1. General specification: Producer under European Union requirements on food production. Fat content: min. 26 % .....
Philippines
Date: Aug 21, 2016
Category: Agriculture | Condensed Milk
Philippines
Savchenkov Ltd
we are a highly reputable manufacturing and trading company in ukraine we producs and supply products such as,wood pellet,wood chips,firewood,charcoal,mdf board,timber woods,plywoods,melamin board,seafood oyster,blood clam,frozen ...
Business Type: Manufacturer, Exporter, Wholesaler/Retailer
Ukraine
Elitmol Ltd
Dear Sirs, For more than 20 years Elitmol Ltd have been arranging for providing our customers the high quality dairy-based ingredients for a variety of food and feed related applications. We produce: milk powders, vegetable fat milk powders, ...
Business Type: Manufacturer
Ukraine
Category: Food & Beverage | Baby Food
Australia
EKOBIOPOL Sp. Z O.o.
Our company deals in export of Polish food producers. Our products are recognized worldwide because of the great taste that is created by the old recipes and new technologies. Product prices are competitive.
Business Type: Exporter, Importer
Category: Food & Beverage | Canned Poultry & Meat
Poland
import infant milk powder
If you are producing for export Milk Powder , skincare and health care product,and we would be obliged if you would kindly send us details of your products. At president, there is a steady demand in China for high-quality good of this type, and we .....
Zhong Ze Rui Ye International Business Development Co.,Ltd.
China
nutrilon milk powder
I'm looking for milk powder which is produced in Netherlands. May I have your price of every standard of Friso and Nutrilon? What's the mode of shipment? Do you have minimum order? What are your payment terms? Please contect me with above .....
China
looking for quality milk powder made in Netherland
we are looking for qualaity mlik powder produced in Netherland.
Chamzon Import And Export )qingdao)co.,ltd
China
buy full cream milk powder
dear sir/madam we urgently need to import large quantity full cream milk powder , we will use it to produce formular milk powder . just big suppliers can contact us, we need stably supply, we just accept non-transferable at sight L/C . B.....
Category: Food & Beverage | Dairy
buy milk powder
We are a Chinese manufacturer, producing infant formula milk powder. We want to import whole milk powder, skimmed milk powder in bulk, originated in New-Zealand and Australia would be our preference. Please contact us by yaolantrade.at.yahoo.com as.....
Category: Food & Beverage | Dairy | http://www.ecplaza.net/powder-milk-producer--everything | CC-MAIN-2017-04 | refinedweb | 1,096 | 56.86 |
Opt-out from Google Analytics
It is possible to opt-out from Google Analytics by simply setting the
disabled property to true.
The
disabled property accepts also a function, a promise or a function that returns a promise, but it needs to return a boolean.
Take in mind that when using a promise, the plug-in won't start tracking until it's resolved, because the opt-out needs to happen before trackers or queues are initialized.
If you are using more then one domain name, all of them will be disabled from tracking.
if you need to disable tracking just for development, is better to use the
sendHitTask property in the
debug object. Read more here
import Vue from 'vue' import VueAnalytics from 'vue-analytics' // boolean Vue.use(VueAnalytics, { id: 'UA-XXX-X', disabled: true }) // function Vue.use(VueAnalytics, { id: 'UA-XXX-X', disabled: () => { return true } }) // promise Vue.use(VueAnalytics, { id: 'UA-XXX-X', disabled: Promise.resolve(true) }) // function that returns a promise Vue.use(VueAnalytics, { id: 'UA-XXX-X', disabled: () => { return Promise.resolve(true) } })
It is also possible to disable tracking from everywhere at any time using the
disable method.
export default { methods: { disableTracking () { this.$ga.disable() // from now on analytics is disabled }, enableTracking () { this.$ga.enable() // from now on analytics is enabled } } }
or
Vue.$ga.disable() Vue.$ga.enable() | https://matteogabriele.gitbooks.io/vue-analytics/content/docs/opt-out.html | CC-MAIN-2022-27 | refinedweb | 222 | 50.33 |
here is how reduce function works in Python:
{The function reduce(func, seq) continually applies the function func() to the sequence seq. It returns a single value. }
see diagram at
lambda x,y:x^y ----> this creates a function object that xors two arguments. just a short way of defining a function. For instance following is valid solution as well:
{
def singleNumber(self, A):
return reduce(self.xor, A)
def xor(self, x,y):
return x^y
}
Actually I found a shorter one myself :) It is shorter by 2 characters :)
def singleNumber(self, A): return reduce(operator.xor,A)
last edited by
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect. | https://discuss.leetcode.com/topic/2814/challenge-me-shortest-possible-answer | CC-MAIN-2017-34 | refinedweb | 118 | 56.35 |
Data sharing
C | FORTRAN
default
Definition
default is the OpenMP clause that sets the data-sharing policy to apply to variables that have not been explicitly assigned one. If this clause is not specified, variables are considered as having been passed implicity to the shared clause.
Parameters
- policy
- The policy to apply to all variables not declared in a data-sharing policy clause.Possible values:
Example
Copy
Feedback
#include <stdio.h> #include <stdlib.h> #include <omp.h> /** * @brief Illustrates the OpenMP default clause. * @details An int is passed to a parallel region. Then: * - 1st step: thread 0 writes "123" in the int * - 2nd step: thread 1 prints the value of the int * The default policy, set to shared, becomes visible when the value read by thread 1 is the one written by thread 0. **/ int main(int argc, char* argv[]) { // Use 2 OpenMP threads omp_set_num_threads(2); // The int that will be shared among threads int val = 0; // Variables not part of a data-sharing clause will be "shared" by default. #pragma omp parallel default(shared) { // Step 1: thread 0 writes the value if(omp_get_thread_num() == 0) { printf("Thread 0 sets the value of \"val\" to 123.\n"); val = 123; } // Threads wait each other before progressing to step 2 #pragma omp barrier // Step 2: thread 1 reads the value if(omp_get_thread_num() == 1) { printf("Thread 1 reads the value of \"val\": %d.\n", val); } } return EXIT_SUCCESS; } | https://www.rookiehpc.com/openmp/docs/default.php | CC-MAIN-2019-43 | refinedweb | 233 | 62.98 |
I apologize if this has been asked before, but I couldn't seem to find any information on it. Is the EnsembleDock protocol available in Rosetta3.5? I don't see a specific executable for it in the rosetta/source/bin directory. Do I just use -l <pdblist> instead of -s <pdbfile> in the normal docking protocol? And can I still use constraints in EnsembleDock?
I specifically want to do antibody-antigen docking, and I realize that SnugDock is available for this purpose (albeit in Rosetta 2.3.1 it seems, which I'll have to install). But I wasn't sure if you could still specify constraints in SnugDock as I have some constraint information that I would like to incorporate into the docking simulation. We potentially would know or have a good idea about what part of the antigen binds to the CDRs, so if that information cannot be incorporated into SnugDock I was thinking of using EnsembleDock instead. Can anybody advise on whether this is a good plan or not? Thank you in advance for your assistance!
Do you know how to run the EnsembleDock protocol use Rosetta3.4?
If you know, may I ask you a question?
I don't know how to prepare the energy score in the pdblist file.
Sorry for the late response, I thought this thread had died. Thank you for responding! No, but I am trying to figure it out in Rosetta3.5 now and I assume it is the same.
Actually, thank you for asking this question since I forgot that there needs to be a score in the pdblist file. I was just putting a list of PDBs in the pdblist and that was it, and it was crashing. After setting up Rosetta++ I decided not to use SnugDock and only to use EnsembleDock. There do seem to be some helpful files in the SnugDock tutorial that I found that can be applied to EnsembleDock. The demo is in Rosetta3 and lives here: /usr/local/rosetta/demos/public/antibody_docking/PrePack_input. This is specific for antibody-antigen docking but I think it can be generalized to any docking application. If you look at "pdblist1" in that directory it seems that the first 10 entries are the pdb files, followed by 20 numbers. The last 10 numbers look like Rosetta scores. I don't know what the first set of 10 numbers are. One of them is 0.0, so I am guessing that these are RMSD values, but I don't know what the reference PDB is. pdblist2 only has one model, the antigen, and the first number is 0.0, so it probably is an RMSD value. The instructions for this demo claim that this pdblist is modified by the prepacking step (in /usr/local/rosetta/demos/public/antibody_docking/PrePack/prepack.bash) but I have not been successful in getting this script to work.
I don't know if you know this already, but just since the information is useful to post for other users, to use EnsembleDock you have to turn on the -ensemble1 and -ensemble2 flags for the regular docker. Each of these accepts a pdblist as input. You need to have a list for both ensemble1 and ensemble2 even if there is only one model in the list. Then the regular input file (-in:file:s) needs to be the ordinary model that contains all the chains that will be docked. The ensemble1 models I think should only have the receptor chains in it and the ensemble2 models should only have the ligand chain.
I will post back if I get it to work.
Okay, I think I finally figured out how to run EnsembleDock without any errors. Let me post the outline in the main thread.
Got it, it turns out I was wrong in the previous post. The first set of numbers are the centroid scores for the PDB files in the list and the second set of scores are the fullatom scores for the PDB files. Example:
pdb_0001.pdb
pdb_0002.pdb
pdb_0003.pdb
0
1.2
1.3
-100.4
-100.23
-102.5
The first three are the file names, the second three are the centroid scores, and the last three are the fullatom scores. Here is a simple PyRosetta script the will generate the correct format given a list of PDB filenames:
#!/usr/bin/python
import sys
from rosetta import *
if (len(sys.argv) != 3):
print "./gen_ensemble_list.py <pdblist> <output>"
print " <pdblist>: A list of the PDBs that will be in the docked ensemble"
print " <output>: The name of the file that will contain the modified pdblist"
exit()
init(extra_options="-ignore_unrecognized_res -mute all")
# Create the scoring functions
scorefxn_fa = create_score_function("talaris2013")
scorefxn_cen = create_score_function("cen_std")
# Create a mover to switch poses to centroid mode
sw = SwitchResidueTypeSetMover("centroid")
pdblistfile = sys.argv[1]
pdblist = []
cen_scores = []
fa_scores = []
fin = open(pdblistfile, "r")
for pdbfile in fin:
# Save the pdbfile name
pdblist.append(pdbfile.strip())
pose = pose_from_pdb(pdbfile.strip())
# Get the fullatom reference score
fa_scores.append(scorefxn_fa(pose))
# Switch to centroid mode and get the centroid score
sw.apply(pose)
cen_scores.append(scorefxn_cen(pose))
fin.close()
# Output the results
fout = open(sys.argv[2], "w")
for pdbfile in pdblist:
fout.write(pdbfile + "\n")
for cen_score in cen_scores:
fout.write(str(cen_score) + "\n")
for fa_score in fa_scores:
fout.write(str(fa_score) + "\n")
fout.close()
1.) First, you have to run the docking_prepack_protocol to get prepacked structures that go into EnsembleDock. Here is what my flags file looks like:
-in:path:database /usr/local/rosetta/main/database
-in:file:s dock_model.pdb
-in:detect_disulf false
-out:nstruct 1
-randomize2
-ensemble1 pdblist1
-ensemble2 pdblist2
-no_filters
-score:weights talaris2013_cst
-ignore_unrecognized_res
-partners HL_C
-dock_pert 3 8
-constraints:cst_file constraints.cst
-out:file:fullatom
-overwrite
"dock_model.pdb" is the input PDB structure that contains all three chains, L, H, and C. pdblist1 contains 10 models for the unbound L+H chains only. pdblist2 only has one model of chain C models.
IMPORTANT: Notice the option "-in:detect_disulf false". This tells Rosetta not to search for disulfide bridges. If you have multiple models, some of the models may find disulfide bridges and others won't. This leads to crashing because the residue connections will be different between adjacent models in the ensemble. Save yourself a lot of time trying to debug by using this option.
The output from this step is a bunch of *.ppk files that are really just PDB files.
2.) Next, you have to modify the pdblist files to include the list of PDB models, followed by the list of each model's centroid only score, followed by a list of the models' fullatom scores. You can use the script in post #5 to generate this list.
3.) Finally, run docking_protocol. I used the same flags file in post #6 but changed nstruct to 1000. You need the "-ensemble1" and "-ensemble2" options AS WELL AS "-in:detect_disulf false" to avoid disulfide crashing.
I hope this information is useful to people!
One more thing I learned, apparently the input structure (-in:file:s) needs to have the chains in the same order as they appear in the models in the ensemble, otherwise you can have failed docking runs. You'll get an error about how two sequences don't match, and it's due to the fact that the chains were scrambled. If you are getting that error, check to make sure that the ensemble models have the same chain ordering. In my case, the input structure had chain H first, then L, then V. The ensemble had L then H, so editing the input PDB to have L before H seemed to fix the problem. | https://rosettacommons.org/comment/8513 | CC-MAIN-2022-27 | refinedweb | 1,283 | 65.42 |
[TL;DR] - omgRPC is dead; long live grpc-json-proxy.
omgrpc was built because of frustration that we felt at Weave while transitioning from REST to gRPC. Lack of tooling like Postman made it hard to test or feel confident about services we were working on. So, one night while my wife was working late I put together a proof-of-concept for a project that could dynamically load a protobuf file to let you interact with a gRPC server: omgRPC. This project has gotten very little TLC since then, but it helped us a lot at Weave while we were becoming more comfortable with gRPC.
While it was nice to fantasize about adding many more Postman-like features to omgRPC, the fact is that Postman is just awesome and this little side-project was never going to catch up to that.
Recently, another member of our team (and contributor to omgrpc) has found a very convenient way to use Postman to interact with gRPC servers. I'll let him explain the mechanics to you here.
While I encourage you to star this repo (obviously), use it as it's useful, and make any contributions you want, you are probably better off using jnewmano's grpc-json-proxy to enable you to continue to use HTTP tools you know and love like
curlor Postman.
omgRPC aims to be a GUI client for interacting with gRPC services, similar to what Postman is for REST APIs.
The goal is for it to be easy to use. Just open your
.protofile and specify the address of the server you want to connect to and you're ready to start making requests.
Version v0.2.0 and later can automatically setup a port-forward for connecting to services inside of Kubernetes. If kubectl exists in your path, a dropdown will appear allowing you to choose which kubectl config to use, with the current kubectl config selected by default. You can then use the {servicename}.{namespace}:{port|port name} as the server address and omgRPC will figure out how a destination pod to setup a port forward.
Please consider contributing, I will try to make it as easy as possible. This started as a proof-of-concept as I first started working with gRPC at Weave and it's just sort of grown organically from there. As a result, it's quite a mess and can use a lot of love. I'm open to any and all ideas.
In order to run omgRPC from source, execute the following steps from the root directory:
npm install -g nwjs.
nw install 0.25.0-sdk
npm install
npm install -g node-pre-gyp
npm install -g nw-gyp
npm rebuild grpc --build-from-source --runtime=node-webkit --target=0.25.0 --target_arch=x64 --target_platform=darwin(set target_arch and target_platform to whatever you are building for. See here)
nw .
To be able to run the repo's example gRPC service (which is fully optional) you must have Go installed, along with all of the example's required dependencies. If you need help with this, let me know. This miniature Go project is a little different than your average Go project because it might not be in your normal GOPATH.
The project uses Angular 1 (or AngularJS or whatever we're calling it these days). I choice this because I was already familiar with it and didn't want to learn a new framework if this project wasn't even going to work. Now that it does work I'm leaning towards choosing something else, such as React or Angular-whatever-the-newest-is.
Bootstap is the CSS framework, but again switching to some material-design framework might be worth it.
The app itself lives in
app. It imports dependencies from
node_modules. The structure is pretty simple. There are only a couple of views that each have controllers, and a couple of services that handle some common dependencies. The code's organization could use some cleanup and rework as well.
There is an example gRPC service (written in Go) that can be used (and altered) to quickly and easily test omgRPC. This lives in
exampleSvc.
I am sure there is a better way to do this (and one that will utilize minification better).
For now I am just using a tool called nw-builder. You can run
./build.sh, which runs a gulp file that mostly just copies everything it needs into a
buildfolder, then runs this command:
nwbuild -v 0.25.0 -p osx64 ./build/ -o dist. It drops the built resources into a folder called
dist. | https://xscode.com/troylelandshields/omgrpc | CC-MAIN-2022-05 | refinedweb | 770 | 64.51 |
strange
I’ve been having a strange problem with mxj and my latest code abomination.
Max freezes or crashes on the first test-run _after_ I re-compile and re-instantiate the mxj.
Logout sometimes helps, and when it doesn’t a restart always does. Once I restart, the patch runs as expected.
I know it’s impossible to say exactly without a code example, but the code is pretty huge… All I’m wondering about is where I might start looking for a cure for such a problem? Any ideas about what types of routines, data structures, etc. might present this strange behavior? A garbage collection thing maybe? I have a "clear" routine that resets/clears all data structures, which I always run before I close/re-open the patch.
Thoughts?
J.
Are you doing any swing stuff? Are you on OS X?
topher
hmm… I thought I replied to this yesterday, but it doesn’t seem to have posted.
Anyway, no, no swing. I’m on OS X, 10.4.6. I should mention that all of my previous experiences with hangs while working on this patch came down to problems with sflist~. Mostly related to overly ambitious preloading (too fast). I fixed that problem, and sflist~ is now calling the shots in terms of preload speed, so I can’t imagine that’s still the problem. I’ve been clearing the sflist~ before I close the patch as well, just to be safe.
Is it possible for an sfplay~ to still maintain an errant preload, even when it’s getting all its cues from one sflist~?
Mind you, I don’t see how a problem that presents itself after compiling could relate to sflist~. Dunno. Strange, as the post title suggests…
J.
I just found this in a older thread:
>Actually if you do not recompile a class during a Max session all
>instances of that class will be loaded by the same classloader. A
>class will only be loaded by a new classloader if it changes.
>Toph
Do you think maybe there’s something like this going on with my patch, only in the converse "if you _do_ recompile" situation?
The reason I’m wondering is because I just loaded up my patch as a few AU plugins in Logic, and it turns out that there’s some data creeping around between plugin instances — all plugs are getting data from the last plugin instance loaded. So obviously something’s getting passed around. VSTTDs: VST Transmitted Data.
I’ve never quite gotten my head around how data is shared/not shared bewteen instances of mxj objects in plugins. Any hints/tips? Does this seem like it might be related to earlier crashes as well?
J.
I’m still having what I think are constructor-related problems when using multiple plugin instances. Can anyone possibly simplify the "best practices" for keeping independent mxj-based plugins totally independent? I guess I’m really not sure how multiple instances of plugins interact with regard to the VM.
J.
Okay, I can load about 5 or 6 instances of the plug, then Logic crashes on Thread 0, with the following:
Exception: EXC_BAD_ACCESS (0x0001)
Codes: KERN_PROTECTION_FAILURE (0x0002) at 0x27321e90
Thread 0 Crashed:
0 MaxPPC3.1 0x2726ecbc hashtab_store + 216
1 MaxPPC3.1 0x27275a2c reg_object_namespace_fromsym + 92
2 MaxPPC3.1 0x27275f60 object_register_unique + 84
3 MaxPPC3.1 0x271cc1b4 patcher_uniqueboxname + 44
4 MaxPPC3.1 0x271cc2f0 patcher_objectname + 32
5 MaxPPC3.1 0x271b091c typedmess_fun + 1628
6 MaxPPC3.1 0x271b004c typedmess + 84
7 MaxPPC3.1 0x271b1318 aeval + 1116
8 MaxPPC3.1 0x27198b24 bf_fastload + 636
9 MaxPPC3.1 0x271a9200 lowload_type__FPcslsP4atoms + 480
10 MaxPPC3.1 0x271a9928 fileload_extended + 160
11 MaxPPC3.1 0x271a9848 fileload_type + 76
12 MaxPPC3.1 0x272528ac xpcoll_loadentry + 52
13 MaxPPC3.1 0x27252840 xpcoll_findload + 44
14 MaxPPC3.1 0x27247940 linklist_funall + 80
15 MaxPPC3.1 0x27252734 xpcoll_loadpatchers + 72
16 MaxPPC3.1 0x2725222c xpcoll_load + 72
17
18
19
20 VNS_fuzzy_to_VST-build 0x02fcffa8 IntoVstPlugLib + 520
21 VNS_fuzzy_to_VST-build 0x02fcf9a8 main + 792
22 com.cycling74.PluggoAU 0x271603b4 PluggoAUEntry + 10332
23 com.cycling74.PluggoAU 0x2715df98 PluggoAUEntry + 1088
24 com.cycling74.PluggoAU 0x2715d598 dyld_stub_memchr + 655604424
25 com.cycling74.PluggoAU 0x2715dbd0 PluggoAUEntry + 120
26 …ple.CoreServices.CarbonCore 0x90bd9de4 CallComponent + 260
27 …apple.audio.units.AudioUnit 0x94250854 AudioUnitGetPropertyInfo + 56
28 com.apple.ecore 0x0261629c CAudioUnitRegistry::InitIOScope(ComponentInstanceRecord*, unsigned long, unsigned long, unsigned long, double, CAudioUnitRegistry::SScopeInfo&) + 112
29 com.apple.logic.pro 0x004b14e0 0x1000 + 4916448
30 com.apple.logic.pro 0x00109320 0x1000 + 1082144
31 com.apple.logic.pro 0x000c06a4 0x1000 + 784036
32 com.apple.logic.pro 0x0002ee34 0x1000 + 187956
33 com.apple.logic.pro 0x0002f034 0x1000 + 188468
34 com.apple.logic.pro 0x00030ba8 0x1000 + 195496
35 com.apple.logic.pro 0x0003116c 0x1000 + 196972
36 com.apple.logic.pro 0x0002678c 0x1000 + 153484
37 com.apple.logic.pro 0x00036874 0x1000 + 219252
38 com.apple.logic.pro 0x0032fc00 0x1000 + 3337216
39 com.apple.logic.pro 0x000113a4 0x1000 + 66468
40 com.apple.logic.pro 0x001e6e18 0x1000 + 1990168
41 com.apple.logic.pro 0x001eecb0 0x1000 + 2022576
42 com.apple.logic.pro 0x001eed44 0x1000 + 2022724
43 com.apple.logic.pro 0x001e3058 0x1000 + 1974360
44 com.apple.logic.pro 0x001e3194 0x1000 + 1974676
45 com.apple.AE 0x914f2960 aeDispatchAppleEvent(AEDesc const*, AEDesc*, unsigned long, unsigned char*) + 208
46 com.apple.AE 0x914f27fc dispatchEventAndSendReply(AEDesc const*, AEDesc*) + 44
47 com.apple.AE 0x914f2654 aeProcessAppleEvent + 284
48 com.apple.HIToolbox 0x931db0e0 AEProcessAppleEvent + 60
49 com.apple.HIToolbox 0x9321ed24 ProcessHighLevelEvent + 140
50 com.apple.HIToolbox 0x9321ec7c StandardApplicationEventHandler(OpaqueEventHandlerCallRef*, OpaqueEventRef*, void*) + 328
51 com.apple.HIToolbox 0x931d7794 DispatchEventToHandlers(EventTargetRec*, OpaqueEventRef*, HandlerCallRec*) + 692
52 com.apple.HIToolbox 0x931d6eec SendEventToEventTargetInternal(OpaqueEventRef*, OpaqueEventTargetRef*, HandlerCallRec*) + 372
53 com.apple.HIToolbox 0x931d6d68 SendEventToEventTargetWithOptions + 40
54 com.apple.HIToolbox 0x931de0c8 ToolboxEventDispatcherHandler(OpaqueEventHandlerCallRef*, OpaqueEventRef*, void*) + 704
55 com.apple.HIToolbox 0x931d79e4 DispatchEventToHandlers(EventTargetRec*, OpaqueEventRef*, HandlerCallRec*) + 1284
56 com.apple.HIToolbox 0x931d6eec SendEventToEventTargetInternal(OpaqueEventRef*, OpaqueEventTargetRef*, HandlerCallRec*) + 372
57 com.apple.HIToolbox 0x931ddc8c SendEventToEventTarget + 40
58 com.apple.HIToolbox 0x9321e9a0 ToolboxEventDispatcher + 92
59 com.apple.HIToolbox 0x9321e92c HLTBEventDispatcher + 16
60 com.apple.HIToolbox 0x9321cee4 RunApplicationEventLoop + 148
61 com.apple.logic.pro 0x001e99a4 0x1000 + 2001316
62 com.apple.logic.pro 0x0000bcd4 0x1000 + 44244
63 com.apple.logic.pro 0x00003584 0x1000 + 9604
64 com.apple.logic.pro 0x0000342c 0x1000 + 9260
maybe
J.?
J.
On Jun 11, 2006, at 1:26 PM, jbmaxwell wrote:
>
>?
FWIW, If you have a disk buffer argument, they must be the same for
both sfplay~ and sflist~. If this is the case, it should work fine.
I had thought this was in the sflist~ help file (pretty sure it was
at some point), but it looks like it was lost somewhere along the
way. Will add.
-Joshua
Well, that seems the intuitive answer, and this is what I had originally done. But I was able to get more instances loaded by removing the argument from the sfplay~s, while leaving it in the sflist~. Dunno.
Anyway, I’m now able to get about 24 instances of my patch to open before Max quits. I’ll set the sfplay~s back to match the disk buffer size of sflist~ and keep messing around…
thanks,
J.
Sounds like you’re running out of memory. An example or better
description would help us comment further (keep in mind each instance
of sfplay~ has an internal buffer of 8x the disk buffer size and that
each cue loads either 1x or 2x (bidirectional) the disk buffer size).
-Joshua
Well, it certainly does seem that way, but I don’t really understand how that’s possible. As I said, the total memory listed for Max in top is only around 80-90 MB when Max quits. Now I suppose I may be getting an innaccurate reading from top, but it’s strange to me. Also, I was able to load up a bogus abstraction with the same general parameters, in terms of number of sfplay~s, sflist~s and disk buffer size settings. I’ve kind of given up for the moment; just bumped the disk buffer down until I could load as many instances as I needed. As long as performance seems okay, I’ll leave it as is.
J.
Forums > Java | https://cycling74.com/forums/topic/strange/ | CC-MAIN-2015-40 | refinedweb | 1,340 | 60.72 |
Analitza
#include <expression.h>
Detailed Description
Represents a mathematical expression.
Expression let to convert it to string, MathML and make some little queries to it, without calculating anything.
Definition at line 44 of file expression.h.
Member Typedef Documentation
Definition at line 48 of file expression.h.
Constructor & Destructor Documentation
Constructs an empty Expression.
Copy constructor, copies the whole object to the constructed one.
Creates an expression from a value.
Constructor.
Parses an expression and creates the object.
- Parameters
-
Destructor.
Member Function Documentation
Adds a new error
error to the expression, to be reported afterwards.
- Returns
- Lists the global bounded variables in the expression
Invalidates the data of the expression.
creates an expression filled with just a custom object
- Returns
- an expression containing a list of every expression passed on
expson the form: list { exps[0], exps[1], ... }
creates an expression filled with just a string
In case it contains a custom object it returns its value.
- Returns
- the value of the declaration. If it's not a declaration then an expression it's returned.
Returns the element at
position in a vector.
- Returns
- the expression that evaluates the current equation to equal 0
Returns the list of errors that had experienced while building the expression.
- Returns
- if a non-mathml expression is fully introduced (e.g. has closed all parentheses).
- Parameters
-
Returns whether this is a correct expression.
- Returns
- true if the expression is a custom object, false otherwise.
- Returns
- whether it's a declaration
- Returns
- whether it's an equation
Returns whether it is a lambda-expression.
Returns whether it is a list expression.
- Returns
- whether
sis MathML or not. Very simple.
Definition at line 252 of file expression.h.
Returns whether it is a matrix expression.
- Returns
- true if the expression is a value, false otherwise.
Returns whether it is a string expression (a list of chars).
Returns whether it is a vector expression.
Returns the expression of the lambda body (without resolving the dependencies)
- Returns
- the name of the expression. If it's not a declaration then an empty string it's returned.
Copy assignment.
Copies the
e expression here.
Returns whether the
e is equal.
- Returns
- a list of the parameters in case this expression represents a lambda construction.
renames the
depth -th variable into
newName
sets an expression value
value to a
position
Sets an expression
exp which is in MathML format.
Returns whether it was correctly assigned or not.
Sets an expression
exp which is not in MathML format.
Returns whether it was correctly assigned or not.
- Returns
- the contained string value
Returns the tree associated to this object and clears the object, so the ownership of the tree is acquired by the caller.
In case it was a vector or list, it returns a list of each expression on the vector.
Exports the expression to HTML.
Converts the expression to MathML.
Converts the expression to MathML Presentation Markup.
- Returns
- Value representation of the expression.
Converts the expression to a string expression.
Returns the tree associated to this object.
Returns the tree associated to this object.
Converts a
tag to an object type.. | https://api.kde.org/4.x-api/kdeedu-apidocs/analitza/html/classAnalitza_1_1Expression.html | CC-MAIN-2020-05 | refinedweb | 520 | 52.36 |
Created attachment 5769 [details]
demo program that shows fork/system(3) can fail
If a multi-threaded application uses fork and dprintf
(by different threads at about the same time) the fork
can fail because the child process crashes in fresetlockfiles.
This problem can be easily reproduced on our powerpc 32bit
system with the attached program (fork_fail_dprintf.c).
One thread uses system(3) (which is implemented with fork
and exec) to write strings to a file. This often fails.
If write(2) is used instead of dprintf, the problem is gone.
Our system uses glibc-2.7, linux-2.6.28 and has a single core
CPU (Freescale MPC8313).
I tried this with glibc-latest and the problem is still there.
Btw. somehow with glibc-latest the problem also occurs when using
write(2).
The problem does not occur on my host PC (FC8=glibc-2.7
on Intel Core i7).
I believe I found the root-cause of this problem and it looks
to me it's still there in glibc-latest.
dprint adds to the global _IO_list_all a temporary
struct _IO_FILE_plus (tmpfil) for which member _lock is NULL.
If another thread kicks in and calls fork (before tmpfil has
been removed from _IO_list_all!) the child process will
crash in fresetlockfiles. This is because here it will
re-initialize the file locks by writing to the _lock member
(which is NULL!)
see:
for the full story.
I checked in a patch.
Stupid BZ... Closing again
Sorry,
maybe I'm blind, but where is the patch?
I still do encounter the problem in version 2.17 from 25th dec. 2012.
The fresetlockfile function (nptl/sysdeps/unix/sysv/linux/fork.c) that fails:
----snip-------
static void
fresetlockfiles (void)
{
_IO_ITER i;
for (i = _IO_iter_begin(); i != _IO_iter_end(); i = _IO_iter_next(i))
_IO_lock_init (*((_IO_lock_t *) _IO_iter_file(i)->_lock));
}
----snap------
and the code in
_IO_vdprintf
----snip-----
struct _IO_FILE_plus tmpfil;
struct _IO_wide_data wd;
int done;
#ifdef _IO_MTSAFE_IO
tmpfil.file._lock = NULL;
#endif
_IO_no_init (&tmpfil.file, _IO_USER_LOCK, 0, &wd, &_IO_wfile_jumps);
_IO_JUMPS (&tmpfil) = &_IO_file_jumps;
_IO_file_init (&tmpfil);
----snap-----
The _lock here is explicitely set to NULL and _IO_file_init
links the struct to the chain: _IO_list_all
OK, I've seen your bugfix in genops.c, however
this does not fix the fork() bug. I suggest
to modify:
nptl/sysdeps/unix/sysv/linux/fork.c
----snip-------
static void
fresetlockfiles (void)
{
_IO_ITER i;
for (i = _IO_iter_begin(); i != _IO_iter_end(); i = _IO_iter_next(i))
_IO_lock_init (*((_IO_lock_t *) _IO_iter_file(i)->_lock));
}
----snap------
to:
----snip-------
static void
fresetlockfiles (void)
{
_IO_ITER i;
for (i = _IO_iter_begin(); i != _IO_iter_end(); i = _IO_iter_next(i))
if (_IO_iter_file(i)->_lock)
_IO_lock_init (*((_IO_lock_t *) _IO_iter_file(i)->_lock));
}
----snap------
Hi, I maybe can add another testcase, using syslog.
In one of our program, it happens that a call to syslog() is made and no /dev/log listener (syslog daemon) is listening.
If i got it correctly, a fallback method in libc/misc/syslog.c is to open /dev/console:
298 if (LogStat & LOG_CONS &&
299 (fd = __open(_PATH_CONSOLE, O_WRONLY|O_NOCTTY, 0)) >= 0)
300 {
301 dprintf (fd, "%s\r\n", buf + msgoff);
302 (void)__close(fd);
303 }
304 }
that leads to add a _IO_file into _IO_list_all with a NULL lock, because of dprintf.
If in meantime, before fd is closed, a fork occurs and the child crashes with a SEGV at:
static void
fresetlockfiles (void)
{
_IO_ITER i;
for (i = _IO_iter_begin(); i != _IO_iter_end(); i = _IO_iter_next(i))
_IO_lock_init (*((_IO_lock_t *) _IO_iter_file(i)->_lock));
}
because _lock is NULL.
I not have a fix yet to propose, because i just started to dig into libc code, but i'm wondering if it's correct to call a dprintf there since is not fork-safe.
Notice that syslog is the *only* libc-internal caller of dprintf.
Thank you,
Francesco
I'm just trying to dig further in the code:;a=commit;h=c020d48c6e91b351cefebbc7a82a9c1ec2d9d83b
changed the locks for a bunch of functions.I guess that the intended behaviour was to mimic a temporary (lightweight?) stream. The lock is set to NULL, _IO_USER_LOCK is added to _flags but _IO_file_init still called.
_IO_file_init calls _IO_link_in that adds to _IO_list_all file and tries to lock the fp, but since it's a _IO_USER_LOCK this is not performed.
So __libc_fork makes an hard assumption that all files added into _IO_list_all have a valid lock. From here, this bug is exposed.
My question for trying to elaborate a patch is:
It was intended that so called temporary streams gets added to this list? Moreover, if a fork occurs in the meantime, child leaks a temporary fd that it will never release.
Could be a fix to add a check for _IO_USER_LOCK in _IO_new_file_init/_IO_new_file_finish and don't add (and remove) it to the list at all in this case? Or maybe doing this check at _IO_(un)link_in level could be more appropriate?
The bad thing around here is that it's fork() that crashes at child because someone in parent called a dprintf (or syslog()) and it was interrupted before closing it, thus rendering fork() not safe.
This is an automated email from the git hooks/post-receive script. It was
generated because a ref change was pushed to the repository containing
the project "GNU C Library master sources".
The branch, master has been updated
via 217a74a85cdd60df236c296ad88142b78d35eccf (commit)
from aa76a5c7010e98c737d79f37aa6ae668f60f7a00 (commit)
Those revisions listed above that are new to this repository have
not appeared on any other notification email; so we list those
revisions in full, below.
- Log -----------------------------------------------------------------;h=217a74a85cdd60df236c296ad88142b78d35eccf
commit 217a74a85cdd60df236c296ad88142b78d35eccf
Author: Andreas Schwab <schwab@suse.de>
Date: Mon Dec 8 15:13:38 2014 +0100
Don't touch user-controlled stdio locks in forked child (bug 12847)
The stdio locks for streams with the _IO_USER_LOCK flag should not be
touched by internal code.
-----------------------------------------------------------------------
Summary of changes:
ChangeLog | 6 ++++++
sysdeps/nptl/fork.c | 3 ++-
2 files changed, 8 insertions(+), 1 deletions(-)
Fixed in 2.21.
This is an automated email from the git hooks/post-receive script. It was
generated because a ref change was pushed to the repository containing
the project "GNU C Library master sources".
The annotated tag, glibc-2.21 has been created
at dee233133daf497cdb3a507a7da9d88414820a1f (tag)
tagging 4e42b5b8f89f0e288e68be7ad70f9525aebc2cff (commit)
replaces glibc-2.20
tagged by Carlos O'Donell
on Fri Feb 6 01:42:58 2015 -0500
- Log -----------------------------------------------------------------
The-----
Adhemerval Zanella (35):
PowerPC: multiarch bzero cleanup for PPC64
PowerPC: memset optimization for POWER8/PPC64
powerpc: remove linux lowlevellock.h
powerpc: Fix encoding of POWER8 instruction
powerpc: Simplify encoding of POWER8 instruction
libio: Refactor tst-fmemopen to use test-skeleton.c
powerpc: Fix missing barriers in atomic_exchange_and_add_{acq,rel}
powerpc: Add powerpc64 strspn optimization
powerpc: Add powerpc64 strcspn optimization
powerpc: Add powerpc64 strpbrk optimization
libio: Fix buffer overrun in tst-ftell-active-handler
libio: Fix variable aligment in tst-ftell-active-handler
powerpc: Fix lgammal_r overflow warnings
Fix __sendmmsg prototype guards
stdio-common: Include <libc-internal.h> in some tests
Function declaration cleanup
mips: Fix __libc_pread prototype
powerpc: Fix compiler warning on some syscalls
powerpc: Add the lock elision using HTM
powerpc: Add adaptive elision to rwlocks
powerpc: abort transaction in syscalls
powerpc: Fix Copyright dates and CL entry
Add x86 32 bit vDSO time function support
powerpc: Optimized st{r,p}cpy for POWER8/PPC64
powerpc: Optimized strcat for POWER8/PPC64
powerpc: Optimized strncat for POWER7/PPC64
powerpc: Optimized st{r,p}ncpy for POWER8/PPC64
powerpc: Optimized strcmp for POWER8/PPC64
powerpc: Optimized strncmp for POWER8/PPC64
powerpc: Fix POWER7/PPC64 performance regression on LE
BZ #16418: Fix powerpc get_clockfreq raciness
powerpc: Fix ifuncmain6pie failure with GCC 4.9
powerpc: Fix powerpc64 build failure with binutils 2.22
powerpc: Fix fsqrt build in libm [BZ#16576]
powerpc: Fix fesetexceptflag [BZ#17885]
Alan Hayward (1):
[AArch64] Add ipc.h.
Alexandre Oliva (6):
Require check-safety.sh to pass; wish for check that all fns are documented
manual: cuserid is mtasurace if not passed a string
ctermid: return string literal, document MT-Safety pitfall
BZ#14498: fix infinite loop in nss_db_getservbyname
BZ#16469: don't drop trailing dot in res_nquerydomain(..., name, NULL, ...)
BZ#16469: resolv: skip leading dot in domain to search
Allan McRae (5):
Open development for 2.21
Update Russian translation
Update French translation
stdio-common/Makefile: readd bug26 testcase
Label CVE-2014-9402 in NEWS
Anders Kaseorg (2):
manual: Remove incorrect claim that qsort() can be stabilized
manual: Correct guarantee about pointers compared by qsort()
Andreas Krebbel (2):
stdlib/longlong.h: Add __udiv_w_sdiv prototype.
iconv: Suppress array out of bounds warning.
Andreas Schwab (20):
Handle zero prefix length in getifaddrs (BZ #17371)
Fix misdetected Slow_SSE4_2 cpu feature bit (bug 17501)
Don't error out writing a multibyte character to an unbuffered stream (bug 17522)
Remove unused include
m68k: don't expect PLT reference to __tls_get_addr
Don't touch user-controlled stdio locks in forked child (bug 12847)
Update NEWS
Remove duplication from gconv-modules
Properly handle forced elision in pthread_mutex_trylock (bug 16657)
Remove obsolete comment
Constify string parameters
Fix printf format error
Fix changelog typo
m68k: remove @PLTPC from _dl_init call
Remove 17581 from NEWS
m68k: force inlining bswap functions
m68k: fix missing definition of __feraiseexcept
m68k/coldfire: avoid warning about volatile register variables
ia64: avoid set-but-not-used warning
Include <signal.h> in sysdeps/nptl/allocrtsig.c
Andrew Pinski (1):
AArch64: Reformat inline-asm in elf_machine_load_address
Andrew Senkevich (4):
Update minimal required bunutils version to 2.22
i386: memcpy functions with SSE2 unaligned load/store
i386: Fix build by GCC 5.0
Remove duplicated -frounding-math
Anton Blanchard (1):
powerpc: Fix __arch_compare_and_exchange_bool_64_rel
Arjun Shankar (6):
New test for ftime
Write errors to stdout and not stderr in nptl/tst-setuid3.c
Modify several tests to use test-skeleton.c
Modify stdio-common/tst-fseek.c to use test-skeleton.c
Modify stdlib/tst-bsearch.c to use test-skeleton.c
Modify libio/tst-fopenloc.c to use test-skeleton.c
Aurelien Jarno (2):
resolv: improve comments about nserv and nservall
resolv: fix rotate option
Bram (1):
Fix segmentation fault when LD_LIBRARY_PATH contains only non-existings paths
Brooks Moses (1):
sysdeps/x86_64/start.S doesn't have a .size elf directive for _start.
Carlos O'Donell (22):
HPPA: Transition to new non-addon NPTL.
HPPA: Add c++-types.data.
Correctly size profiling reloc table (bug 17411)
hppa: Make __SIGRTMIN 32 (ABI break).
elf/dl-load.c: Use __strdup.
manual/llio.texi: Add Linux-specific comments for write().
Run check-localpltk/textrel/execstack over ld.so.
manual/llio.texi: Comment on write atomicity.
CVE-2014-7817: wordexp fails to honour WRDE_NOCMD.
Expand comments in elf/ldconfig.c (search_dir)
Use ALIGN_UP in nptl/nptl-init.c
Fix indenting in bits/ioctl-types.h.
Update libc.pot:
Regenerate INSTALL.
Fix semaphore destruction (bug 12674).
Fix recursive dlopen.
tst-getpw: Rewrite.
Update copyright year to 2015 for new files.
hppa: Remove warnings and fix conformance errors.
glibc 2.21 pre-release update.
hppa: Sync with pthread.h.
Update version.h and include/features.h for 2.21 release
Chris Metcalf (32):
tile: remove linux lowlevellock.h
tilegx: optimize string copy_byte() internal function
tilegx: provide optimized strnlen, strstr, and strcasestr
tile: add support for _SC_LEVEL*CACHE* sysconf() queries
tile: optimize memcmp
tile: make the prolog of clone() more conformant
tile: add clock_gettime support via vDSO
tile: fix copyright header blocks in just-committed files
tile: add inhibit_loop_to_libcall to string functions
math: increase timeout for math/atest-*.c
iconvdata/tst-loading: bump up timeout to 10s
tilegx: fix strstr to build and link better
tile: provide localplt.data with __tls_get_addr optional
tile: remove localplt.data and use generic one again.
tile: separate ffsll from ffs
Update NEWS and ChangeLog with two tile bug fixes.
tilegx: remove implicit boolean conversion in strstr.
Fix namespace conformance issue with Bessel functions.
NEWS: mention bug fix for 17747.
tilegx: enable wordsize-64 support for ieee745 dbl-64.
tilegx32: avoid a a -Werror warning from unwinding
tilegx: fix sysdep.h to avoid a redefinition warning
linux/clock_settime: remove unnecessary vDSO definitions
tile: add no-op fe*() routines for libc internal use
posix/Makefile: use $(objpfx) for files in before-compile.
tile: prefer inlines to macros in math_private.h.
Fix a couple of -Wundef warnings.
Fix some warnings in the absence of FP round/exception support
lround: provide cast for wordsize-64 version if needed
tile: check error properly for vDSO calls
posix/regcomp: initialize union structure tag to avoid warning
tilegx32: set __HAVE_64B_ATOMICS to 0
Chung-Lin Tang (4):
Add Nios II definitions to elf/elf.h.
Remove divide from _ELF_DYNAMIC_DO_RELOC in elf/dynamic-link.h.
Commit nios2 port to master.
Function name typo error in non-PIC case, fixed in this patch.
David Holsgrove (3):
MicroBlaze: Fix integer-pointer conversion warning
MicroBlaze: Fix volatile-register-var warning in READ_THREAD_POINTER
MicroBlaze: Avoid pointer to integer conversion warning
David S. Miller (6):
Fix sparc build.
Fix array bounds warnings in elf_get_dyanmic_info() on sparc with gcc-4.6
Fix soft-fp build warning on sparc about strict aliasing.
Fix scanf15.c testsuite build on sparc.
Fix sparc semaphore implementation after recent changes.
Fix two bugs in sparc atomics.
Eric Biggers (1):
setenv fix memory leak when setting large, duplicate string (BZ #17658)
Florian Weimer (6):
Turn on -Werror=implicit-function-declaration
malloc: additional unlink hardening for non-small bins [BZ #17344]
Complete the removal of __gconv_translit_find
Update NEWS for bug 17608
Avoid infinite loop in nss_dns getnetbyname [BZ #17630]
iconvdata/run-iconv-test.sh: Actually test iconv modules
Gratian Crisan (1):
arm: Re-enable PI futex support for ARM kernels >= 3.14.3
H.J. Lu (27):
Require autoconf 2.69
Resize DTV if the current DTV isn't big enough
Mention fix for PR 13862
Replace 1L with (mp_limb_t) 1
Compile s_llround.c with -Wno-error for x32 build
Replace -Wno-error with -fno-builtin-lround
Remove @PLT from "call _dl_init@PLT" in _dl_start_user
Add hidden __tls_get_addr/___tls_get_addr alias
Replace %ld with %jd and cast to intmax_t
Replace %ld with %jd and cast to intmax_t
Replace %ld with %jd and cast to intmax_t
Replace %ld with %jd and cast to intmax_t
Replace %ld/%lu with %jd/%ju and cast to intmax_t/uintmax_t
Replace %ld with %jd and cast to intmax_t
Replace %ld with %jd and cast to intmax_t
Replace %ld with %jd and cast to intmax_t
Replace %ld with %jd and cast to intmax_t
Mention fix for BZ #17732
Mention i386 memcpy with SSE2 unaligned load/store
Don't check PI_STATIC_AND_HIDDEN in i386 dl-machine.h
Define CLOCKS_PER_SEC type to the type clock_t
Mention bug fix for BZ #17806
Use uint64_t and (uint64_t) 1 for 64-bit int
Also use uint64_t in __new_sem_wait_fast
Treat model numbers 0x4a/0x4d as Silvermont
Also treat model numbers 0x5a/0x5d as Silvermont
Use AVX unaligned memcpy only if AVX2 is available
J. Brown (1):
Recognize recent x86 CPUs in string.h
James Lemke (2):
Fix for test "malloc_usable_size: expected 7 but got 11"
Fix for test "malloc_usable_size: expected 7 but got 11"
Jeff Law (1):
CVE-2012-3406: Stack overflow in vfprintf [BZ #16617]
Jose E. Marchesi (1):
Fix sparc struct fpu definition.
Joseph Myers (141):
Add new Linux 3.16 constants to netinet/udp.h.
Move architecture-specific shlib-versions entries to sysdeps files.
Move OS-specific shlib-versions entries to sysdeps files.
Use %ifdef in sysdeps/unix/sysv/linux/powerpc/powerpc64/shlib-versions.
Remove configuration name patterns from shlib-versions.
Remove bitrotten --enable-oldest-abi (bug 6652).
soft-fp: Correct _FP_TO_INT formatting.
soft-fp: Fix comment formatting.
Move some setrlimit definitions to syscalls.list (bug 14138).
Clean up gnu/lib-names.h generation (bug 14171).
Remove shlib-versions entries redundant with DEFAULT entries.
Run tst-ld-sse-use.sh with bash.
Move some *at definitions to syscalls.list (bug 14138).
Move execve to syscalls.list (bug 14138).
Move some chown / lchown / fchown definitions to syscalls.list (bug 14138).
Support and use mixed compat/non-compat aliases in syscalls.list.
Don't use INTUSE with __adjtimex (bug 14132).
soft-fp: Remove FP_CLEAR_EXCEPTIONS.
soft-fp: Make extensions of subnormals from XFmode to TFmode signal underflow if traps enabled.
soft-fp: Refactor exception handling for comparisons.
soft-fp: Fix _FP_TO_INT latent bug in overflow handling.
soft-fp: Add FP_DENORM_ZERO.
Remove stray *_internal aliases (bug 14132).
Don't use INTDEF/INTUSE with __cxa_atexit (bug 14132).
soft-fp: Support more precise "invalid" exceptions.
soft-fp: Support rsigned == 2 in _FP_TO_INT.
soft-fp: Use parentheses around macro arguments.
Don't use INTVARDEF/INTUSE with __libc_enable_secure (bug 14132).
Remove CANCEL-FCT-WAIVE and CANCEL-FILE-WAIVE.
conformtest: clean up POSIX expections for sys/utsname.h, sys/wait.h.
Move readv and writev definitions to syscalls.list (bug 14138).
Don't use INTDEF with __ldexpf (bug 14132).
Don't use INTDEF for powerpc32 compat symbols (bug 14132).
Move some chown / lchown / fchown definitions to syscalls.list (bug 14138).
Move get*id and getgroups definitions to syscalls.list (bug 14138).
Move setfsgid/setfsuid definitions to syscalls.list (bug 14138).
Don't use INTDEF/INTUSE in unwind-dw2-fde.c (bug 14132).
Remove __libc_creat function name.
Remove __libc_readv and __libc_writev function names.
Move powerpc64 pread/pwrite definitions to syscalls.list (bug 14138).
Add bug 15215 to NEWS; move bug 17344 to correct version's list in NEWS.
Remove __libc_pselect alias.
Update autoconf version requirement in install.texi.
Make aclocal.m4 comment mention updating install.texi for autoconf version.
Remove __libc_nanosleep function name.
soft-fp: Add _FP_TO_INT_ROUND.
Don't use INTDEF/INTUSE with _dl_argv (bug 14132).
Don't use INTDEF/INTUSE with _dl_init (bug 14132).
Don't use INTDEF/INTUSE with _dl_mcount (bug 14132).
Remove INTDEF / INTUSE / INTVARDEF (bug 14132).
Remove __libc_waitpid function name.
Fix tzfile.c namespace (bug 17583).
Fix __getcwd rewinddir namespace (bug 17584).
Fix malloc_info namespace (bug 17570).
Fix qsort_r namespace (bug 17571).
Fix x86_64 rawmemchr namespace (bug 17572).
Fix stpcpy / mempcpy namespace (bug 17573).
Fix __printf_fp wmemset namespace (bug 17574).
Fix __get_nprocs fgets_unlocked namespace (bug 17582).
Fix locale memmem namespace (bug 17585).
Fix localealias.c fgets_unlocked namespace (bug 17589).
Add tests for namespace for static linking.
Fix strtoll / strtoull namespace for 32-bit (bug 17594).
Use prototype definition for __strtol.
Fix build of C mempcpy and stpcpy.
Require GCC 4.6 or later to build glibc.
Only declare __sigpause in installed signal.h when necessary.
Remove ARM __GNUC_PREREQ(4,4) conditionals.
Remove x86_64 __GNUC_PREREQ (4, 6) conditional.
Fix libm mpone, mptwo namespace (bug 17616).
Fix perror fileno namespace (bug 17633).
Fix warning in posix/bug-regex31.c.
Fix warning in stdio-common/tst-printf-round.c.
Fix warning in setjmp/jmpbug.c.
Fix test-strchr.c warnings for wide string testing.
Remove TEST_IFUNC, tests-ifunc and *-ifunc.c tests.
Fix warnings in fwscanf / rewind tests.
FIx ldbl-128ibm frexpl for 32-bit systems (bug 16619, bug 16740).
Fix sysdeps/unix/sysv/linux/arm/libc-do-syscall.S warning.
Fix nptl/tst-cancel-self-cancelstate.c warning.
Fix sysdeps/mips/__longjmp.c warning.
Avoid warnings for unused results in nscd/connections.c.
Fix nss/tst-nss-test1.c format warning.
Fix stdio-common/tst-fmemopen.c format warnings.
Fix dlfcn/failtestmod.c warning.
Fix libio/bug-ungetwc1.c warning.
Avoid deprecated sigblock in misc/tst-pselect.c.
Make linknamespace tests check only relevant libraries.
Fix elf/tst-unique4lib.cc warning.
Fix fgets_unlocked namespace issues (bug 17664).
Remove excess declarations from unistd.h for XPG3/XPG4 (bug 17665).
Fix warning in posix/tst-getopt_long1.c.
Fix -Waddress warnings in nptl/tst-mutex1.c.
Fix warning in nptl/tst-stack4.c.
Fix getifaddrs, freeifaddrs namespace (bug 17668).
Remove some linknamespace test XFAILs.
Fix linknamespace getdate_err handling.
Fix linknamespace h_errno handling.
Fix pthreads getrlimit, gettimeofday namespace (bug 17682).
Add macros for diagnostic control, use for scanf %a tests.
Disable -Wdiv-by-zero for some tests in stdio-common/tst-unlockedio.c.
Disable -Wdeprecated-declarations for register_printf_function calls in tst-printfsz.c.
Use -Werror by default, add --disable-werror.
Fix tst-ftell-active-handler.c warning.
Fix strftime wcschr namespace (bug 17634).
Fix MIPS sigaction build.
Fix MIPS waitid build.
Clean up localedata tests printf formats, don't use -Wno-format.
Add more headers to include/ for conform tests.
Move semaphore.h to sysdeps/pthread/.
Remove some semaphore.h linknamespace XFAILs.
Fix resolver if_* namespace (bug 17717).
Fix x86_64 memrchr namespace (bug 17719).
Fix resolver inet_* namespace (bug 17722).
Fix profil_counter namespace (bug 17725).
Fix resolver bind, getsockname namespace (bug 17733).
Split __kernel_standard* functions (fixes bug 17724).
Make __ASSUME_UTIMES hppa-specific.
Fix libm feraiseexcept namespace (bug 17723).
Clean up powerpc fegetround / __fegetround inlines.
Fix libm fegetenv namespace (bug 17748).
Update copyright dates with scripts/update-copyrights.
Update copyright dates not handled by scripts/update-copyrights.
Use single year in copyright notice in banner in ntpl/version.c.
Fix MIPS bits/fcntl.h namespace (bug 17780).
Fix MIPS sa_flags type (bug 17781).
Fix MIPS TIOCSER_TEMT namespace (bug 17782).
Fix libm fegetround namespace (bug 17748).
Fix wordsize-64 posix_fadvise64, posix_fallocate64 namespace (bug 17777).
Fix isblank / isascii / toascii namespace (bug 17635).
Fix ARM posix_fadvise64 namespace (bug 17793).
Fix MIPS n64 posix_fadvise namespace (bug 17796).
Fix libm feholdexcept namespace (bug 17748).
Fix libm fesetenv namespace (bug 17748).
Fix libm fesetround namespace (bug 17748).
Fix libm feupdateenv namespace (bug 17748).
Fix ldbl-96 scalblnl for subnormal arguments (bug 17834).
Fix ldbl-96 scalblnl underflowing results (bug 17803).
Fix powerpc-nofpu fesetenv namespace (bug 17748).
soft-fp: Use __label__ for all labels within macros.
Disable 64-bit atomics for MIPS n32.
Kaz Kojima (1):
* Fix SH specific compiler warnings which are for integer-pointer
Kostya Serebryany (3):
remove nested function hack_digit
remove nested functions from elf/dl-deps.c
remove nested functions from elf/dl-load.c
Leonhard Holz (4):
strcoll: improve performance by removing the cache (#15884)
Fix tst-strcoll-overflow returning before timeout (BZ #17506)
Speed up strcoll by inlining
Fix memory handling in strxfrm_l [BZ #16009]
Ma Shimiao (1):
manual: fix addmntent's MT-Safety race annotation
Maciej W. Rozycki (1):
MIPS: Avoid a dangling `vfork@GLIBC_2.0' reference
Marcus Shawcroft (1):
Fix ChangeLog formatting of previous commit.
Marek Polacek (1):
Fix tst_wcscpy.c test.
Martin Sebor (1):
Clarify math/README.libm-test. Add "How to read the test output."
Matthew Fortune (5):
Add a hook to enable load-time inspection of program headers
Add support for MIPS O32 FPXX and .MIPS.abiflags
Fix MIPS variable PAGE_SIZE bug (16191)
NEWS for MIPS ABIs
MicroBlaze: Fix BZ17791 - Remove fixed page size macros and others
Mike Frysinger (1):
arm: drop EABI check
Ondřej Bílka (8):
Sync recvmmsg prototype with kernel usage.
Fix typo in changelog.
Return allocated array instead of unallocated.
Simplify strncat.
Clean up check_pf allocation pattern. addresses
Add changelog
Suppress warning in string/tester.c for gcc 4.9
Revert "Suppress warning in string/tester.c for gcc 4.9"
Paul Eggert (1):
fnmatch: work around GCC compiler warning bug with uninit var
Paul Pluzhnikov (1):
CVE-2015-1472: wscanf allocates too little memory
Petar Jovanovic (1):
mips: Do not use jal to reach __libc_start_main
Pravin Satpute (2):
New locale ce_RU (BZ #17192)
New locale raj_IN (#16857)
Rajalakshmi Srinivasaraghavan (3):
powerpc: strtok{_r} optimization for powerpc64
powerpc: POWER7 strcpy optimization for unaligned strings
powerpc: Optimize POWER7 strcmp trailing checks
Rasmus Villemoes (1):
Fix prototype of eventfd.
Renlin Li (1):
[AArch64] End frame record chain correctly.
Richard Earnshaw (5):
[AArch64] Add optimized strchrnul.
[AArch64] Fix strchrnul clobbering v15
* string/stpcpy.c (__stpcpy): Rewrite using strlen and memcpy.
AArch64 optimized implementation of strrchr.
AArch64: Optimized implementations of strcpy and stpcpy.
Richard Henderson (2):
alpha: Fix soft-fp breakage
Add -Wno-trampolines as needed
Roland McGrath (62):
Move findidx nested functions to top-level.
Don't use a nested function in rpmatch.
Minor cleanup in ld-ctype.c
Minor cleanup in locale.c
Remove unnecessarily nested function in do_lookup_unique.
BZ#17460: Fix buffer overrun in nscd --help.
Remove sysdeps/arm/soft-fp directory.
Fix NPTL build error when missing __NR_set_robust_list.
NPTL: Conditionalize more uses of SIGCANCEL and SIGSETXID.
NPTL: Conditionalize direct futex syscall uses.
NPTL: Clean up THREAD_SYSINFO macros.
Remove obsolete TLS_DEFINE_INIT_TP fallback.
Make internal lock-init macros return void.
NPTL: Add some missing #include's
NPTL: Clean up gratuitous Linuxism in libpthread.so entry point.
Tiny refactoring in fts to eliminate a warning.
Avoid local PLT reference in __nptl_main.
ARM: Use movw/movt more when available
Rework some nscd code not to use variable-length struct types.
Prototypify htonl and htons definitions.
Rework compiler version check in configure.
Clean up wchar_t conversion code in iconv program.
Clean up internal ctype.h header.
BZ#17496: Fix gnu/lib-names.h dependency.
NPTL: Move __libc_multiple_threads_ptr defn to nptl-init.c
Remove sigvec.
NPTL: Refactor createthread.c
NPTL: Move Linux-specific createthread.c to sysdeps.
NPTL: Add stub createthread.c
Test that pthread_create diagnoses invalid scheduling parameters.
NPTL: Don't (re)validate sched_priority in pthread_create.
NPTL: Refactor scheduler setup in pthread_create.
NPTL: Conditionalize asynchronous cancellation support on [SIGCANCEL].
NPTL: Use __libc_fatal in unwind.c.
NPTL: Fix pthread_create regression from default-sched.h refactoring.
De-warning a few stubs.
Fix -Wformat-security warnings in posix/regexbug1.c
Eliminate -Wno-format from printf/scanf tests.
Suppress -Wformat-security in tst-error1.c.
Refactor shm_{open,unlink} code to separate Linux-specific directory choice from POSIX-generic code.
Fix NPTL build for !__ASSUME_SET_ROBUST_LIST case.
NPTL: Add stubs for Linux-only extension functions.
NPTL: Refactor named semaphore code to use shm-directory.h
Use pragmas rather than makefiles for necessary options for unwind code.
Revert "Use pragmas rather than makefiles for necessary options for unwind code."
Use PTR_MANGLE on libgcc unwinder function pointers.
Remove explicit inline on malloc perturb functions.
Fix stub __if_freenameindex build error.
NPTL: Remove gratuitous Linuxisms from gai_misc.h.
NPTL: Move fork state variables to initializer files.
ARM: Consolidate with generic unwinder wrapper code
NPTL: Refactor cpu_set_t validation to be sysdeps-controlled
Add stub sys/procfs.h file
NPTL: Fixed missed conditionalization of setxid hooey.
NPTL: Fix generic pthread_sigmask.
Fix copyright year on new stub sys/procfs.h file.
Clean up allocrtsig code.
Some #include cleanup in aio/timer code.
Fix shm-directory.h #include.
Remove some references to bcopy/bcmp/bzero.
Add missing libc_hidden_def to stub getrlimit64.
Add missing libc_hidden_weak to stub if_nameindex, if_freenameindex.
Ryan Cumming (1):
Define CLOCK_TAI on Linux (bug 17608)
Samuel Thibault (1):
hurd: Fix dlopening libraries from static programs
Siddhesh Poyarekar (53):
Return failure in getnetgrent only when all netgroups have been searched (#17363)
Enhance tst-xmmymm.sh to detect zmm register usage in ld.so (BZ #16194)
Fix typo in macro names in sysconf.c
Add correct variable names for _POSIX_IPV6 and _POSIX_RAW_SOCKETS
Remove _POSIX_REGEX_VERSION
Revert to defining __extern_inline only for gcc-4.3+ (BZ #17266)
Add NEWS entry for previous commit
Fix memory leak in error path of do_ftell_wide (BZ #17370)
Make __extern_always_inline usable on clang++ again
Assume that all _[PS]C_* and _CS_* macros are always defined
Include .interp section only for libc.so
Remove CFLAGS for interp.c
Fix infinite loop in check_pf (BZ #12926)
Fix up incorrect formatting in last commit
Fix stack alignment when loader is invoked directly
Use GOT instead of GOT12 all over
Add new macro IN_MODULE to identify module in which source is built
Fix -Wundef warning in SHLIB_COMPAT
Auto-generate libc-modules.h
Use MODULE_NAME in stap-probe instead of IN_LIB
Remove IN_LIB
Define IN_MODULE for translation units that define NOT_IN_libc
Remove IS_IN_libc
Remove IS_IN_ldconfig
Remove IS_IN_nscd
Remove IS_IN_libdl
Remove IS_IN_librt
Remove IS_IN_libpthread
Remove IS_IN_libm
Remove IS_IN_rtld
Remove last place for definition of IS_IN_* macros
Remove NOT_IN_libc
Use IS_IN internally only
Don't use __warn_memset_zero_len for gcc-5.0 or newer
Update NEWS for previous two commits
ftell: seek to end only when there are unflushed bytes (BZ #17647)
tst-ftell-active-handler: Open file with O_TRUNC for w modes
Reset cached offset when reading to end of stream (BZ #17653)
Fix up function definition style
Fix date in ChangeLog
Fix another typo in the ChangeLog
Fix 'array subscript is above array bounds' warning in res_send.c
Fix the 'array subscript is above array bounds' warning correctly
Remove Wundef warnings for specification macros
Add _POSIX namespace SYSCONF macros to posix-conf-vars.list
Use posix-conf-vars.list to generate spec array
Make type for spec variable size as size_t
Use one-dimension arrays in gen-posix-conf-vars.awk
Remove uses of sprintf in gen-posix-conf-vars.awk
Fix typo in ChangeLog
[s390] Define a __tls_get_addr macro to avoid declaring it again
Initialize nscd stats data [BZ #17892]
Fix up ChangeLog formatting
Stefan Liebler (13):
S/390: Get rid of warning: the comparision will always evaluate as false.
S/390: Get rid of warning unused variable in dl-machine.h.
S/390: Add SystemTap probes to longjmp and setjmp.
S/390: dl-machine.h: Use numbered labels in inline assembly.
Add missing include of libc-internal.h.
S/390: Get rid of assembler warning value truncated.
Get rid of warning inlining failed in call to maybe_swap_uint32
Get rid of warning comparision will always evaluate as true
resolv: Suppress maybe uninitialized warning
Get rid of format warning in tst-widetext.c.
Get rid of format warning in bug-vfprintf-nargs.c.
S390: Get rid of linknamespace failures for string functions.
S390: Get rid of linknamespace failures for utmp functions.
Steve Ellcey (19):
Modify ABI tests in MIPS preconfigure.
Put mips preconfigure code inside mips* case statement.
* sysdeps/mips/strcmp.S: New.
Remove extra whitespace from end of line.
2014-12-10 Steve Ellcey <sellcey@imgtec.com>
2014-12-11 Steve Ellcey <sellcey@imgtec.com>
* sysdeps/mips/dl-trampoline.c: Modify switch expression to have
2014-12-17 Steve Ellcey <sellcey@imgtec.com>
2014-12-19 Steve Ellcey <sellcey@imgtec.com>
2014-12-19 Steve Ellcey <sellcey@imgtec.com>
Remove trailing white space.
Add missing ChangeLog entries from Friday (Dec 19, 2014).
Remove trailing whitespace.
2014-12-22 Steve Ellcey <sellcey@imgtec.com>
Fix preprocessor indentation in sysdeps/mips/memcpy.S.
2015-01-05 Steve Ellcey <sellcey@imgtec.com>
2015-01-05 Steve Ellcey <sellcey@imgtec.com>
2015-01-05 Steve Ellcey <sellcey@imgtec.com>
Merge branch 'master' of ssh://sourceware.org/git/glibc
Tatiana Udalova (1):
New Bhilodi and Tulu locales (BZ #17475)
Tim Lammens (1):
Fix memory leak in libio/wfileops.c do_ftell_wide [BZ #17370]
Tom de Vries (1):
Fix crossreference to nonexistent node BSD Handler
Torvald Riegel (24):
pthread_once: Clean up constants.
pthread_once: Add fast path and remove x86 variants.
Fix SPARC atomic_write_barrier.
powerpc: Change atomic_write_barrier to have release semantics.
Add arch-specific configuration for C11 atomics support.
Add atomic operations similar to those provided by C11.
Add tests for C11-like atomic operations.
Use C11 atomics in pthread_once.
microblaze: 64b atomic operations are not supported.
Fix synchronization of TPP min/max priorities.
Remove custom pthread_once implementation on sh.
Remove custom pthread_once implementation on s390.
Fix nptl/tst-mutex5.c: Do not skip tests if elision is enabled.
Fix nptl/tst-sem4: always start with a fresh semaphore.
Add comments for the generic lowlevellock implementation.
Fix warning in elf/tst-unique4lib.cc.
Fix warning in misc/tst-mntent2.c.
Ignore warning in string/tester.c.
sh: Remove custom lowlevellock, barrier, condvar, and rwlock implementations.
Use generic lowlevellock-futex.h in x86_64 lowlevellock.h.
i386: Move futex functions from lowlevellock.h to lowlevellock-futex.h.
MicroBlaze: Remove custom pthread_once implementation on microblaze.
MicroBlaze: Remove custom lowlevellock.h.
Fix wake-up in sysdeps/nptl/fork.c.
Vladimir A. Nazarenko (1):
Fix incorrect mount table entry parsing in __getmntent_r
Wilco Dijkstra (18):
Remove spaces.
Remove an unused include.
Cleanup fesetexceptflag to use the same logic as the ARM version. No functional changes.
Cleanup feclearexcept to use the same logic as the ARM version. No functional changes.
Cleanup fedisableexcept to use the same logic as the ARM version. No functional changes.
Cleanup feenableexcept to use the same logic as the ARM version. No functional changes.
Call get_rounding_mode rather than duplicating functionality.
Call libc_feholdexcept_aarch64 from math_private.h rather than duplicating functionality.
Call libc_fetestexcept_aarch64 from math_private.h rather than duplicating functionality.
This patch improves strcat performance by using strlen and strcpy. Strlen has a fast C
This patch improves strncat performance by using strlen. Strlen has a fast C implementation, so
Improve strcpy performance.
Improve performance of strncpy.
Fix typo.
Call libc_fesetround_aarch64.
Call libc_fetestexcept_aarch64.
Optimize to reduce FPCR/FPSR accesses.
Optimize to avoid an unnecessary FPCR read.
Will Newton (10):
ARM: Don't define _SYS_AUXV_H in sysdep.h
Allow cross-building of tests
stdlib/tst-strtod-round.c: Fix build on ARM
benchtests: Add malloc microbenchmark
AArch64: Update relocations for ILP32
AArch64: Use ELF macros rather than Elf64 throughout
intl: Merge with gettext version 0.19.3
Bump required version of texinfo to 4.7
Require bison 2.7 or newer for regenerating intl/plural.y
ARM: Remove configure check for binutils 2.21 for ARMv7
----------------------------------------------------------------------- | https://sourceware.org/bugzilla/show_bug.cgi?id=12847 | CC-MAIN-2017-51 | refinedweb | 5,438 | 52.87 |
So the question becomes, how to do this programmatically? You can query it manually via IEEE,, but doing that for 1 host if fine, imagine doing that for a switch stack with hundreds of ports. Luckily, macvendors.com provides a nice API page to do just that, (note. please consider donating to their cause if you have some extra money :) ).
Trying this out in interactive prompt couldn't be easier:
>>> import urllib2
>>>>>>> urllib2.urlopen(url+macOUI).read()
'CISCO SYSTEMS, INC.'
>>>
A switch 'show mac address-table' output typically looks something like this (vlan, mac, learning, port). Note that this is a fake list with the host portion being ff.ffff.
$cat mac_list_fake.txt
3 0004.0ff.ffff DYNAMIC Fa4/0/23
2 000d.56ff.ffff DYNAMIC Fa3/0/30
2 0012.3fff.ffff DYNAMIC Fa2/0/6
2 0012.3fff.ffff DYNAMIC Fa2/0/40
$
If you put that in a text file, here is a script that splits that output and builds a dictionary with the key being the port and the value a list of (mac, vendor):
** start of script **
#!/usr/bin/env python
import sys, urllib2
url = ""
fileName = sys.argv[1]
macFile = open(fileName, 'r')
portMap = {} #builds a dictionary of port: (mac, vendor)
for line in macFile.readlines():
line = line.strip()
vlan, mac, method, port = line.split()
macOUI = mac[:7]
response = urllib2.urlopen(url+macOUI).read()
portMap[port] = (mac, response)
#pretty print
for key in portMap.keys():
print "Port: %s, Mac Address: %s, Vendor: %s" % (key, portMap[key][0], portMap[key][1])
** end of script **
$./macLookup.py mac_list_fake.txt
Port: Fa2/0/6, Mac Address: 0012.3fff.ffff, Vendor: Dell Inc
Port: Fa3/0/30, Mac Address: 000d.56ff.ffff, Vendor: Dell PCBA Test
Port: Fa2/0/40, Mac Address: 0012.3fff.ffff, Vendor: Dell Inc
Port: Fa4/0/23, Mac Address: 0004.0ff.ffff, Vendor: Asus Network Technologies, Inc.
$
I want to mention that Wireshark and IEEE provides a list that is a flat file so you can choose to build your own mapping without using the API if you dont want to depend on Internet connectivity for this.
Happy coding :).
Final Year Projects for CSE in Python
Great Article
Final Year Projects for CSE in Python
FInal Year Project Centers in Chennai
JavaScript Training in Chennai
JavaScript Training in Chennai | https://blog.pythonicneteng.com/2013/06/find-device-connected-to-switch-via-mac.html | CC-MAIN-2022-27 | refinedweb | 385 | 76.22 |
Yesterday I’ve stumbled on the article Pure Python vs NumPy vs TensorFlow Performance Comparisonwhere the author gives a performance comparison of different implementations of gradient descent algorithm for a simple linear regression example.
Lately I’ve been experimenting with the Nim programming language, which promises to offer a Python-like easy to read syntax, while having C-like speeds.This seemed like a nice and simple example to compare speed between Nim and Python.
As everybodywould expect, the article has shownthat the pure Python version is much slower than the other two versions, but nobodywould write numerical code like that.
NumPy allows us to write both more readable and much faster code, as it takes advantage of vectorised operations on NumPy arrays, and usually calls optimized C or Fortran code.
The code from the original article is used without modifications, I have just re-run it on my machine (i7-970 @ 3.20 GHz) to get the base values for a later comparison:
Python time: 34.62 secondsNumPy time: 0.71 seconds
Based on my previous experienceof using both Nim and Python, I knew I could expect Nim to be noticeably faster than (pure) Python.The question is – can Nim compete against NumPy’s speed?
We’ll take “pure Nim” approach – no array/tensor library, meaning we need to iterate the arrays element by element, something that is known to be very costly in Python.
Let’s go through our program bit by bit:
import random, times, mathrandomize(444)const N = 10_000 sigma = 0.1 f = 2 / N mu = 0.001 nEpochs = 10_000
Compared to Python, in Nim all imports are written on the same line, and importing a module in Nim is analogous to
from foo import *in Python.
We take the same seed as in the original, and we define all the needed constants. (All indented lines are part of the
constblock.)Nim is a statically typed language, but the types can be inferred from the values.
Next we need to define vectors
xand
d(
x = np.linspace(0, 2, N)and
d = 3 + 2 * x + noisein Python), and we need to do it element by element:
var x, d: array[N, float]for i in 0 ..< N: x[i] = f * i.float d[i] = 3.0 + 2.0 * x[i] + sigma * randomNormal()
Operator
..<iterates untilthe upper limit. (Operator
..would iterate to the limit, including it.)
The thing to notice here is that we cannot combine integers and floats –
ineeds to be converted to float. (Nim has UFCSsupport so
i.floatis the same as
float(i).)
Function
randomNormal, which gives us a Gaussian distribution (
np.random.randnin the Python version), is taken fromArraymancer, which is Nim’s tensor library (still in early stage, but it is rapidly developed).
The remaining thing to do is to define the
gradientDescentfunction:
proc gradientDescent(x, d: array[N, float], mu: float, nEpochs: int): tuple[w0, w1: float] = var y: array[N, float] err: float w0, w1: float for n in 1 .. nEpochs: var grad0, grad1: float for i in 0 ..< N: err = f * (d[i] - y[i]) grad0 += err grad1 += err * x[i] w0 += mu * grad0 w1 += mu * grad1 for i in 0 ..< N: y[i] = w0 + w1 * x[i] return (w0, w1)
When declaring variables, they are initialized with their default values (0.0 for floats), meaning that
var y: array[N, float]is similar to
y = np.zeros(N, dtype=float)in Python.
Lastly, we print the values of
w0and
w1, to see if the values are close to the ones we expect (
w0 = 3,
w1 = 2) and measure the time needed for the calculation:
let start = cpuTime()echo gradientDescent(x, d, mu, nEpochs)echo "Nim time: ", cpuTime() - start, " seconds"
We compile the program in release mode, which turns off runtime checks and turns on the optimizer, and run it:
$ nim c -d:release gradDesc.nim$ ./gradDesc(w0: 2.968954757075724, w1: 2.02593328759163)Nim time: 0.226344 seconds
While NumPy has offered significant speedups compared to the pure Python version, Nim manages to further improve upon that, and not just marginally – it is two orders of a magnitude faster than Python, and, what is more impressive, it is three times faster than NumPy.
Nim has managed to deliver on its promise – for this example it offers 3x performance compared to NumPy, while keeping the code readable.
Discussion on Redditand Hacker News.
Source files (both .py and .nim) are available here. | http://news.ruankaowang.com/detail/205977 | CC-MAIN-2021-25 | refinedweb | 741 | 63.9 |
QLabel snap to ScrollBar
- J.Hilk Moderators
);
- jsulm Qt Champions 2018
?
- jsulm Qt Champions
If you want, I can send you the project
hi
I think its something else than createActions();
Use the debugger to find the line where it crashes.
error in qaction.cpp
void QAction::setEnabled(bool b) { Q_D(QAction); if (b == d->enabled && b != d->forceDisabled) return; d->forceDisabled = !b; if (b && (!d->visible || (d->group && !d->group->isEnabled()))) return; QAPP_CHECK("setEnabled"); d->enabled = b; #ifndef QT_NO_SHORTCUT d->setShortcutEnabled(b, qApp->d_func()->shortcutMap); //here #endif d->sendDataChanged(); }
This post is deleted!
I commented out all QAction and the program starts, but the picture at start is not loaded. But you need to change the zoom level to display the picture. Please tell me how to fix it.
hi
I think it would be better to call
createActions();
and simply do
menuBar()->hide();
so its not shown.
That way you dont get issues with dangling pointers in the program.
@mrjj said in QLabel snap to ScrollBar:
menuBar()->hide();
it works, thank you! | https://forum.qt.io/topic/103612/qlabel-snap-to-scrollbar/47 | CC-MAIN-2019-30 | refinedweb | 174 | 68.87 |
/* * Copyright db.h> #include <netinet/in.h> #include <netinet/ip.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #include <errno.h> /* * 5/10/12: Imported from telnet project * * Source route is handed in as * [!]@hop1@hop2...[@|:]dst * If the leading ! is present, it is a * strict source route, otherwise it is * assmed to be a loose source route. * * We fill in the source route option as * hop1,hop2,hop3...dest * and return a pointer to hop1, which will * be the address to connect() to. * * Arguments: * * res: ponter to addrinfo structure which contains sockaddr to * the host to connect to. * * arg: pointer to route list to decipher * * cpp: If *cpp is not equal to NULL, this is a * pointer to a pointer to a character array * that should be filled in with the option. * * lenp: pointer to an integer that contains the * length of *cpp if *cpp != NULL. * * protop: pointer to an integer that should be filled in with * appropriate protocol for setsockopt, as socket * protocol family. * * optp: pointer to an integer that should be filled in with * appropriate option for setsockopt, as socket protocol * family. * * Return values: * * If the return value is 1, then all operations are * successful. If the * return value is -1, there was a syntax error in the * option, either unknown characters, or too many hosts. * If the return value is 0, one of the hostnames in the * path is unknown, and *cpp is set to point to the bad * hostname. * * *cpp: If *cpp was equal to NULL, it will be filled * in with a pointer to our static area that has * the option filled in. This will be 32bit aligned. * * *lenp: This will be filled in with how long the option * pointed to by *cpp is. * * *protop: This will be filled in with appropriate protocol for * setsockopt, as socket protocol family. * * *optp: This will be filled in with appropriate option for * setsockopt, as socket protocol family. */ int sourceroute(struct addrinfo *ai, char *arg, char **cpp, int *lenp, int *protop, int *optp) { static char buf[1024 + ALIGNBYTES]; /*XXX*/ char *cp, *cp2, *lsrp, *ep; struct sockaddr_in *_sin; #ifdef INET6 struct sockaddr_in6 *sin6; struct cmsghdr *cmsg = NULL; #endif struct addrinfo hints, *res; int error; char c; /* * Verify the arguments, and make sure we have * at least 7 bytes for the option. */ if (cpp == NULL || lenp == NULL) return -1; if (*cpp != NULL) { switch (ai->ai_family) { case AF_INET: if (*lenp < 7) return -1; break; #ifdef INET6 case AF_INET6: if (*lenp < (int)CMSG_SPACE(sizeof(struct ip6_rthdr) + sizeof(struct in6_addr))) return -1; break; #endif } } /* * Decide whether we have a buffer passed to us, * or if we need to use our own static buffer. */ if (*cpp) { lsrp = *cpp; ep = lsrp + *lenp; } else { *cpp = lsrp = (char *)ALIGN(buf); ep = lsrp + 1024; } cp = arg; #ifdef INET6 if (ai->ai_family == AF_INET6) { cmsg = inet6_rthdr_init(*cpp, IPV6_RTHDR_TYPE_0); if (*cp != '@') return -1; *protop = IPPROTO_IPV6; *optp = IPV6_PKTOPTIONS; } else #endif { /* * Next, decide whether we have a loose source * route or a strict source route, and fill in * the begining of the option. */ if (*cp == '!') { cp++; *lsrp++ = IPOPT_SSRR; } else *lsrp++ = IPOPT_LSRR; if (*cp != '@') return -1; lsrp++; /* skip over length, we'll fill it in later */ *lsrp++ = 4; *protop = IPPROTO_IP; *optp = IP_OPTIONS; } cp++; memset(&hints, 0, sizeof(hints)); hints.ai_family = ai->ai_family; hints.ai_socktype = SOCK_STREAM; for (c = 0;;) { if ( #ifdef INET6 ai->ai_family != AF_INET6 && #endif c == ':') cp2 = 0; else for (cp2 = cp; (c = *cp2); cp2++) { if (c == ',') { *cp2++ = '\0'; if (*cp2 == '@') cp2++; } else if (c == '@') { *cp2++ = '\0'; } else if ( #ifdef INET6 ai->ai_family != AF_INET6 && #endif c == ':') { *cp2++ = '\0'; } else continue; break; } if (!c) cp2 = 0; hints.ai_flags = AI_NUMERICHOST; error = getaddrinfo(cp, NULL, &hints, &res); #ifdef EAI_NODATA if ((error == EAI_NODATA) || (error == EAI_NONAME)) #else if (error == EAI_NONAME) #endif { hints.ai_flags = 0; error = getaddrinfo(cp, NULL, &hints, &res); } if (error != 0) { fprintf(stderr, "%s: %s\n", cp, gai_strerror(error)); if (error == EAI_SYSTEM) fprintf(stderr, "%s: %s\n", cp, strerror(errno)); *cpp = cp; return(0); } #ifdef INET6 if (res->ai_family == AF_INET6) { sin6 = (struct sockaddr_in6 *)res->ai_addr; inet6_rthdr_add(cmsg, &sin6->sin6_addr, IPV6_RTHDR_LOOSE); } else #endif { _sin = (struct sockaddr_in *)res->ai_addr; memcpy(lsrp, (char *)&_sin->sin_addr, 4); lsrp += 4; } if (cp2) cp = cp2; else break; /* * Check to make sure there is space for next address */ #ifdef INET6 if (res->ai_family == AF_INET6) { if (((char *)CMSG_DATA(cmsg) + sizeof(struct ip6_rthdr) + ((inet6_rthdr_segments(cmsg) + 1) * sizeof(struct in6_addr))) > ep) return -1; } else #endif if (lsrp + 4 > ep) return -1; freeaddrinfo(res); } #ifdef INET6 if (res->ai_family == AF_INET6) { inet6_rthdr_lasthop(cmsg, IPV6_RTHDR_LOOSE); *lenp = cmsg->cmsg_len; } else #endif { if ((*(*cpp+IPOPT_OLEN) = lsrp - *cpp) <= 7) { *cpp = 0; *lenp = 0; return -1; } *lsrp++ = IPOPT_NOP; /* 32 bit word align it */ *lenp = lsrp - *cpp; } freeaddrinfo(res); return 1; } | http://opensource.apple.com//source/netcat/netcat-20/sourceroute.c | CC-MAIN-2016-36 | refinedweb | 768 | 61.56 |
Monitoring Cloudflare's Global Network Using Prometheus
- |
-
-
-
-
-
-
Read later
Reading List
Matt Bostock’s SREcon 2017 Europe talk covers how Prometheus, a metric-based monitoring tool, is used to monitor CDN, DNS and DDoS mitigation provider CloudFlare’s globally distributed infrastructure and network.
The Prometheus metrics-based open source monitoring project has been around since 2012. It is a Cloud Native Computing Foundation (CNCF) member. Prometheus’s dynamic configuration and query language PromQL lets users write complex queries in alerts. CloudFlare provides a content delivery network (CDN), distributed DNS and DDoS mitigation services. This means that its infrastructure is spread across the globe. Monitoring such an infrastructure and its network is complex and the talk describes the role Prometheus plays in this. At CloudFlare, Prometheus has replaced 87% of what Nagios used to do previously.
CloudFlare provides services similar to that of a CDN by using Anycast. Anycast DNS allows DNS queries to be served from the server nearest to the user, whereas Anycast HTTP allows serving content from the server nearest to the user. Acting as an intermediary between the original website and the user, CloudFlare also checks if the visitor’s traffic has threat patterns. It has 116 datacenters across 150 countries, and handles 5 million HTTP requests and 1.2 million DNS requests per second, which add up to 10% of global internet requests. Each point-of-presence (PoP) provides HTTP, DNS, attack mitigation and a key-value store. To monitor this, 188 Prometheus servers are in production at the time of the talk.
Image Courtesy -
Prometheus is metrics-based - which is to say that it collects time series metrics and the rest of its features are built on top of metrics. It works on the pull model where each monitored server runs a process called an exporter which exposes its collected metrics over HTTP. CloudFlare deploys one exporter per service domain and uses exporters that collect system (CPU, memory, TCP, disk), network (HTTP, ping), log matches (error messages) and container/namespace metrics. cadvisor, an open source project by Google, is used for the last one. Data retention in Prometheus is not forever, as it focuses more on the here-and-now monitoring aspect. Data is retained for 15 days in CloudFlare’s setup with no downsampling.
The list of services in a CloudFlare core datacenter includes log access, analytics and APIs built with a stack consisting of Marathon, Mesos, Chronos, Docker, Sentry, Ceph (for storage), Kafka, Spark, Elasticsearch and Kibana. In each PoP, Prometheus queries the servers/services for metrics via the exporters. High-availability per PoP is provided by using multiple Prometheus servers.
Prometheus’s alert manager is called, simply, Alertmanager. CloudFlare’s deployment has a single Alertmanager to which individual Prometheus servers push events. High availability of this setup is in the works. Alerts are tested on past data to ensure that they are performing correctly. This feature is part of newer monitoring tools like Bosun also. Other features of a good alert are a descriptive name, simplicity and information to enable the recipient to take immediate action.
The CloudFlare team uses jiralerts to integrate the JIRA ticketing system with Alertmanager. JIRA allows for customizable workflows, so for monitoring alerts, they can include monitoring workflow-specific custom states. Another tool called alertmanagere2s receives alerts and integrates them into an Elasticsearch index for later search and analysis. CloudFlare has built their own dashboard for the Alertmanager, called unsee.
How is Prometheus itself monitored? There are two approaches to it. One is a mesh-like approach where each Prometheus monitors the others in the same datacenter. The other is a top down approach where top-level Prometheus servers monitor datacenter-level Prometheus servers.
Some of the CloudFlare SRE team’s learnings are early standardization of labels and identification of groups - like environments and clusters. Other aspects are related to creating visibility and generating buy-in from peers and stakeholders. Early engagement of teams helps in faster integration of services with the monitoring system. The alerts themselves need multiple iterations to tune and improve, and it’s an ongoing process.
Rate this Article
- Editor Review
- Chief Editor Action | https://www.infoq.com/news/2017/10/monitoring-cloudflare-prometheus | CC-MAIN-2018-51 | refinedweb | 691 | 55.84 |
Details
Description.
Issue Links
- is depended upon by
HARMONY-2363 [drlvm][thread] Move hythr library for DRL VM to VM directory
- Open
- is related to
HARMONY-5883 [vmi] Document and progress pending changes to the VM interface
- Open
Activity
- All
- Work Log
- History
- Activity
- Transitions
Attached corrected patch file. First patch had extra java.util.concurrent java files.
Parse the "-vmdir:" command line option before we create the port library and add the vmdir to the library loading path.
This lays the groundwork to allow the portlibrary to link against a hythr.dll which would now be a VM specific subdirectory.
To accomplish this a small set of port library functions have been copied to the launcher. They are:
- memory allocate/free
- get executable name
- open/close shared library (modified to only open the hyprt library)
- shared library function name lookup
The patch thread_api_harmony_patch_20070206.txt contains the code changes for creating a new table based thread API much like the port library table based API without any VMI changes.
The thread library is created by the port library and obtained through the new port library function port_get_thread_library().
The following patch on top of launcher_02052007_patch.txt (29 kb) is needed to compile it on Linux.
— modules/luni/src/main/native/launcher/unix/main_hlp.c
+++ modules/luni/src/main/native/launcher/unix/main_hlp.c
@@ -348,7 +348,7 @@ searchSystemPath (char *filename, char **result)
*
- @return 0 on success, any other value on failure.
*/
-UDATA VMCALL
+int VMCALL
main_close_port_library (UDATA descriptor)
{
return (UDATA) dlclose ((void *)descriptor);
@@ -363,7 +363,7 @@ main_close_port_library (UDATA descriptor)
*
- @note contents of descriptor are undefined on failure.
*/
-UDATA VMCALL
+int VMCALL
main_open_port_library (UDATA * descriptor)
{
void *handle;
By the way, what's the point of having thread library function table, if port library itself is still linked statically to it?
(And it would be reasonable to expect VM to be linked statically to its thread library as well)
re: By the way, what's the point of having thread library function table, if port library itself is still linked statically to it?
The port library is statically linked to the thread library table creation functions. The implementation of the table functions does not necessarily need to reside in hythr.
The class library natives will no longer be statically linked against hythr. Depending on the implementation of the VM, it may or may not be statically linked against hythr.
It would also be possible to have the port library not statically link against hythr if we felt there was value in this arrangement. I, personally, don't see a big win by doing so.
Thanks, now I've got it, especially the point that thread functions indeed may be residing not in a hythr.dll, making the whole system much more flexible.
I am all for committing this patch.
And a minor gripe on the patch: it is full of ^M (CR) characters, so whoever will commit this patch, please make sure to commit files with correct line endings
(if committing from Windows, CR are okay as long as svn:eol-style is set to 'native', if committing from Linux, there should be no CRs)).
Mark,
As far as I understand, this your patch overrides all the previous patches for this issue, and it may be applied without disrupting the operations of Classlib/IBM VM/DRL VM.
However, if classlib is built with -Dhy.no.thr=true flag, the hythr library is rebuilt with the new approach, and both IBM VM and DRL VM would not function until they're patched accrordingly.
Is my understanding correct?
Vasily,
Yes. That's it exactly. I know it's going to take a little time for the IBM VME to be updated (assume the same is true for DRLVM) and I wanted to give this feature a better chance of being integrated. I imagine that the flag will be removed when all VM's have been updated to include a hythr dll with the required interface.
Note: there is a minor error in the patch - the new thr stub makefile should set the EXPNAME to HYTHR_0.2.
I've applied these changes in r523227 and r523228. The -Dhy.no.thr=true option is needed to apply them. We can remove the option and make this the default when DRLVM and IBM VMEs have been updated.
Ron, can you check that these changes are completed as you'd expect?
Note, that the hy.no.thr=true option implies the hy.no.sig=true option since I didn't see much point in migrating the sig code (since I think we agreed that we should eliminate this code and let the VM handle signals).
Salikh, it would be good if you could take a look at the changes I've committed and see what needs to be done for HARMONY-2363. Note that I changed the hythr library name on unix to HYTHR_0.2 (from HYTHR_0.1) to make it obvious when the wrong library is being found.
This patch is the one described in the problem description. | https://issues.apache.org/jira/browse/HARMONY-3090 | CC-MAIN-2016-36 | refinedweb | 841 | 62.78 |
Segment makes it easy to send your data to Kahuna (and lots of other destinations). Once you've tracked your data through our open source libraries we'll translate and route your data to Kahuna in the format they understand. Learn more about how to use Kahuna with Segment.
Getting Started
Segment makes it easy to send your data to Kahuna. Once you’re tracking data through our iOS, Android or server side libraries, we’ll translate and route your data to Kahuna in the format they can process.
If you have mobile apps, then Kahuna recommends using the Segment iOS and or Android library and bundling Kahuna (see Mobile section below).
If you are sending data from a server side library, please read the Server side section.
Be sure to enable Kahuna in your Segment destinations page and provide your Kahuna Secret Key, which can be found in the Settings page of the Kahuna Dashboard.
Mobile
In order to leverage the full capability of Kahuna’s Push Messaging and In-App features, you will have to bundle the Kahuna SDK while configuring your Segment mobile SDKs.
Android
Add this to your project gradle file:
allprojects { repositories { jcenter() maven { url "" } maven { url "" } } }
Add this to your app level gradle file:
compile ('com.kahuna.integration.android.segment:kahuna:+') { transitive = true }
Then, bundle Kahuna during your Segment Analytics initialization, with more details here:
Analytics analytics = new Analytics.Builder(this, "SEGMENT_KEY") .use(KahunaIntegration.FACTORY) .build();
iOS
Add the Kahuna pod dependency:
pod "Segment-Kahuna
Then, bundle Kahuna during your Segment Analytics initialization, with more details here:
#import <Segment-Kahuna/SEGKahunaIntegrationFactory.h> SEGAnalyticsConfiguration *config = [SEGAnalyticsConfiguration configurationWithWriteKey:@"YOUR_WRITE_KEY"]; [config use:[SEGKahunaIntegrationFactory instance]]; [SEGAnalytics setupWithConfiguration:config];
Push Notifications
To leverage the Push Notifications and In-App functionality provided by Kahuna, follow the steps in the Kahuna SDK destination guide:
For iOS, follow the steps in Enable Personalized Push in the iOS Get Started section.
For Android, follow the steps in Enable Personalized Push in the Android Get Started section.
Reset
If your app supports the ability for a user to logout and login with a new identity, then you’ll need to call
reset in your mobile app. Here we will call Kahuna’s logout implementation to ensure the user information remains consistent.
Server-Side
If you are using Segment’s iOS or Android libraries but have not bundled Kahuna’s SDK as described in the mobile section above, we will default to using the server side destination. It is recommended that you bundle the Kahuna’s SDK in order to use features such as Push Notifications and In-App features.
However, any data coming from sources other than mobile apps should be using the server side destination.
Batching
If you are using the server side destination for Kahuna, we recommend you set the Segment batching options as follows (note: these settings would apply to all of your Segment destinations):
- flushAt to 100
- flushAfter to 30 minutes (or 1800000 ms)
Identify
Our server-side destination supports the ability to register user information with Kahuna through our identify calls. This will allow you to organize and segment your Kahuna campaigns according to the user information that you have sent.
The first thing you’ll want to do is to
identify a user with any relevant information as soon as they launch the app. You record this with our
identify method.
Identify takes the
userId of a user and any
traits you know about them.
When you call
identify, we’ll set two Kahuna Credentials,
user_id and
user_info, which are User Attributes in Kahuna.
We will also send any relevant device information such as device token, app name and version, OS and browser name, etc.
Track
You can also use
track calls to send event data using Kahuna’s
Intelligent Events.
Whenever you call track, we’ll send an event to Kahuna with the event name and a unix timestamp. We will also pass through any properties of the event. If
properties.quantity and
properties.revenue are set, then we will send the event name as well as count and value. For value, we will first multiply
properties.revenue by
100 before sending to Kahuna since Kahuna tracks value in cents not dollars.
Note: We will flatten any compound objects such as nested objects or arrays. We will also strip any properties that have values of
null since Kahuna’s API does not support these values. Lastly, just like the
identify call, we will send any relevant device parameters we can send based off the context of the call.
Screen
When you call
screen in your mobile app, we send a screen view to Kahuna for mobile apps if trackAllPages is enabled for your Kahuna destination. If enabled, we track a Kahuna event with the format “Viewed
screen.name Screen”. If you want to enable sending
screenevents to Kahuna, simply check the box for: Track All Pages from your Segment Kahuna settings page.
E-Commerce
Segment supports a deeper Kahuna destination with e-commerce tracking in our mobile SDKs (NOT in server side). All you have to do is adhere to our
e-commerce tracking API and we’ll track Kahuna e-commerce specific user attributes.
Viewed Product Category
For
Viewed Product Category, we will track the Kahuna User Attributes “Last Viewed Category” and “Categories Viewed”. The value for Last Viewed Category will be taken from
properties.category, “None” if unspecified. The value of Categories Viewed will be a list of the last 50 unique categories the user viewed, also taken from
properties.category.
Viewed Product
For
Viewed Product, we will track the same Kahuna User Attributes as Viewed Product Category. We also will track another User Attribute called “Last Product Viewed Name” with the value taken from
properties.name.
Added Product
For
Added Product, we will track the Kahuna User Attributes “Last Product Added To Cart Name” taken from
properties.name and “Last Product Added To Cart Category” taken from
properties.category. If category is unspecified, we will track “None”.
Completed Order
For
Completed Order, we will track the Kahuna User Attributes “Last Purchase Discount” taken from
properties.discount. If
discount is unspecified, we will track 0.
Send Push Token via Server-Side
If you chose not to bundle the Kahuna Mobile SDK, then you will have to implement your own Push Message processors, and you won’t have access to Kahuna’s In-App feature.
If you decide to implement your own Push Message processors, then make sure you pass the Push Tokens to Kahuna via Server Side. You can do this by sending it inside
context.device.token. We will send this to Kahuna as
push_token..
Segment offers an optional Device-based Connection Mode for Mobile data with Kahuna. If you’d like to use those features that require client-based functionality, follow the steps above to ensure you have packaged the Kahuna SDK with Segment’s.
Settings
Segment lets you change these destination settings via your Segment dashboard without having to touch any code.
Secret Key
Specify the Secret Key from Kahuna (located in Kahuna’s dashboard’s settings).
Send data to production environment (default sandbox)
Check to send data to production account (default sandbox) once you are ready to pass data to Kahuna’s production namespace
Sender ID / Google API Project Number
If you are using our older mobile library (before v2 iOS or v3 Android) and have packaged Kahuna’s SDK, you can give us the sender ID. The sender ID is also called the project number in your Google API project. Make sure you have created a project by following instructions here, under ‘Enable Personalized Push’
If you have any questions or see anywhere we can improve our documentation, please let us know or kick off a conversation in the Segment Community! | https://segment.com/docs/destinations/kahuna/ | CC-MAIN-2018-30 | refinedweb | 1,301 | 51.58 |
Hey, i made this password program but i am having trouble getting it to work. the last thing i need to do it be able to compare the inputed password to the actual password (in this program i want it to be "matt") im not sure how i do this, could someone help? with this code i get undefined symbol 'matt' when i try to compile with borland. i know why i just dont know how to fix it :S
Code://Passwod Program //By Matt #include <iostream> using namespace std; int main() { char password[5]; start: cout<<"* * * * * * * * * * * * * \n"; cout<<" Please enter your PIN \n"; cout<<"------- 4 letters ------ \n"; cout<<"* * * * * * * * * * * * * \n"; cin.getline (password, 5, '\n' ); if(password == matt ) { cout<<"Thank You! \n"; } else { cout<<"Sorry Incorrect PIN \n"; goto start; } } | http://cboard.cprogramming.com/cplusplus-programming/112225-first-password-program.html | CC-MAIN-2016-07 | refinedweb | 130 | 75.84 |
Guest RNB Posted July 27, 2004 Share Posted July 27, 2004 Hi everybody. For my first post in this forum, i want to begin by a big THANK YOU to Jon & all for their work on AutoIt, an incredible tool. (A second thing is apologies for my english: if i read it quite easily, the writing is another thing). Next, you have certainly guessed that i'm writing this message to ask a little help. here goes my gui problem: It's an input box that display a file path read in an ini file. The user can change that path with an open dialog box (FileOpenDialog). If so, i update the input box with the new path (GuiWrite). Until here, everything works. But, when i want to rewrite the ini key with the new path through an "ok" button, nothing happens. This is a lite version of the gui i'm trying to build, only with the control that put me into trouble. expandcollapse popup#include "GUIConstants.au3" Opt ("GUINotifyMode", 1) $path_file = iniread ("INI_FILE", "SECTION", "KEY", "Error") GUICreate ("MyApp", 300, 230) $path_input = guisetcontrol ("input", $path_file, ...) $path_button = guisetcontrol ("button", "Rep", ...) $ok = guisetcontrol ("button", "OK", ...) $cancel = guisetcontrol ("button", "Exit", ...) guishow() While 1 $n = GUIMsg () ; CHOOSE A NEW PATH if $n = $path_button then $choose_path = FileOpenDialog ("Rep", "", "executable (*.exe)" , 1) if $choose_path <> 1 then guiwrite ($path_input, 0, $choose_path) else endif endif ; WRITE IN INI FILE if $n = $ok then ; msgbox (0, "", $new_path_file) iniwrite ("INI_FILE", "SECTION", "KEY", guiread ($path_input)) exit endif ; EXIT if $n = $cancel then exit endif if $n = -3 then exit endif wend i wrote the same thing with a couple of other input boxes where the user have to type some infos if he wants to change it. The rewrite into the ini file with the "ok" button works perfectly. Only this input field, with the FileOpenDialog option, puts everything upside down. The message box (commented in the script above) displays correctly the new path value, but it isn't write back into the ini file with the iniwrite command. If i type the file path myself (like in the other fields), it works, but when i use the open dialog box to acquire it, the rewriting fails. Does somebody understands where i'm | https://www.autoitscript.com/forum/topic/3929-iniwrite-doesnt-work-after-an-opendialog-box/?tab=comments#comment-24866 | CC-MAIN-2021-49 | refinedweb | 373 | 71.55 |
In this post, we will implement the functionality of adding Lightning Web Components (LWC) in the Utility Bar. Utility Bar is displayed at the bottom of the page in Lightning Application and we can access it on any page. Let’s get into the implementation.
Implementation
In this implementation, we are creating a Form using Lightning Web Components using lightning-record-form to create and view Account records. And we will display this Lightning Web Component (LWC) in Utility Bar. If you want to know how lightning-record-form works in detail, please check this post.
Create a component ldsRecordForm. Add lightning-record-form tag and provide required attributes to display the Account record with Name, Phone, and Website Fields. Provide the object-api-name as Account and mode as View. View mode will display the blank record if record-id is not provided. If you want to show a blank record in Edit mode, use the Edit mode. If the record-id is available, it will show the respective record else it will display the blank one and we can create a new record.
ldsRecordForm.html
<template> <lightning-card title={strTitle}> <div class="slds-p-horizontal_small"> <lightning-record-form</lightning-record-form> </div> </lightning-card> </template>
In the JS Controller, we will only create arrayFields array to provide a list of Fields to display. Create strTitle to display the lightning:card title dynamically.
ldsRecordForm.js
import { LightningElement, api } from 'lwc'; export default class LdsRecordForm extends LightningElement { @api strTitle; arrayFields = ['Name', 'Phone', 'Website']; }
Metadata File
To use Lightning Web Components in Utility Bar, we need to make it available first by making changes in the Metadata file. A metadata file is created for every Lightning Web Component to provide the configuration related details. In this file, we can provide a target as lightning__UtilityBar. Check below metadata file for our component.
ldsRecordForm.js-meta.xml
<?xml version="1.0" encoding="UTF-8"?> <LightningComponentBundle xmlns=""> <apiVersion>48.0</apiVersion> <isExposed>true</isExposed> <targets> <target>lightning__AppPage</target> <target>lightning__UtilityBar</target> </targets> <targetConfigs> <targetConfig targets="lightning__UtilityBar"> <property name="strTitle" type="String" /> </targetConfig> </targetConfigs> </LightningComponentBundle>
Here, targets is used to make the component available for a particular Lightning section like App Page, Home Page, or Utility Bar. We are making it available for App Page and Utility Bar.
We can also provide targetConfigs to allow users to add some properties while adding the component on any page or Utility Bar, just like design attributes in Aura components. We are adding strTitle to allow the user to provide the title for our lightning-card. strTitle should be declared as @api to make it available on App Builder or on the Add Utility Item page.
Once the component is available for Utility Bar, we need to add Lightning Web Components (LWC) in Utility Bar. Go to App Manager from the Quick Find box. Edit the App, Click on Utility Items in the sidebar. Click on Add Utility Item and select our component. In the Component Properties section, we should be able to see the strTitle property that we can provide, which is used to display the title of our lighting-card.
Lightning Web Components in Utility Bar
This is how our implementation looks like:
That is all from this post. Please Subscribe here if you don’t want to miss new posts. See you in the next implementation!
1 thought on “Lightning Web Components (LWC) in Utility Bar”
Hi I am trying to call LWC on Utility from another LWC which is placed on recordpage on click of button. If there is any workaround you know please help me. | https://niksdeveloper.com/salesforce/lightning-web-components-in-utility-bar/ | CC-MAIN-2022-27 | refinedweb | 602 | 54.93 |
I did so and guess what?, the display really is fullscreen so I've been looking to see ifI've done something wrong in my actual program I need it to work for but so far I've found nothing.
So the only thing I can think of to do now is post all the requisite files for my project so those that would could look at it but I'm a bit worried I'm going to be embarrassed if I'm exposed as having done something stupid.
Advise please.
Don't be ashamed. Everybody makes mistakes. Even "stupid" ones. My GitHub is full of uninteresting projects full of "stupid" code. Besides, even if there is any "stupid" code in your project, all that exposing it will do is help you to learn more about it through constructive criticism from others so that you can get better! Which is exactly what the purpose of this thread is.
Just because something you've done is "stupid" does NOT mean that there is anything wrong with you. Ultimately, I think that it is a major disservice to our entire civilization that we expect people not to fail (in the sense that most of our states have no safety net to protect everyone from failure, deserved or otherwise). Failure is inevitable, and it is often only through failure that we succeed.
--'ve attached all the necessary files in 7zip file so if anyone really wants to they cancompile my program. I think all the extra files necessary are there ( the config, font, etc). Let me know if not and I'll post the others.
Here's what I get when I run it and that's after a call to
al_set_new_display_flags(ALLEGRO_FULLSCREEN);
{"name":"612818","src":"\/\/djungxnpq2nug.cloudfront.net\/image\/cache\/e\/e\/ee6f8d5771f973ce0cfaf75fdf4823f2.png","w":1229,"h":933,"tn":"\/\/djungxnpq2nug.cloudfront.net\/image\/cache\/e\/e\/ee6f8d5771f973ce0cfaf75fdf4823f2"}
EDIT : the display is created in the InputOutput constructor in input_output.cpp
thanks
Are you trying to set a mode the monitor/driver doesn't support?
---Smokin' Guns - spaghetti western FPS action
In your input_output.cpp you have:
al_set_new_display_flags(ALLEGRO_FULLSCREEN);
#ifdef ART_PROGRAM_DEBUG_MODE
al_set_new_display_flags(ALLEGRO_WINDOWED);
#endif // ART_PROGRAM_DEBUG_MODE
and in your global.hpp you have:
#define ART_PROGRAM_DEBUG_MODE
So remove that line from global.hpp and it will run full-screen??
(Or is the issue that in full-screen mode the taskbar is overlayed?)
----------------------------------------------------Please check out my songs:
The resolution I was trying to set was 1024 \times 768.
Thanks Dizzy Egg. You've found the answer for me. I got it working now.
I've realised that the reason the taskbar was showing was because it was windowed mode which I thought was fullscreen because my Desktop resolution was 1024 by 768 originally which was the size of the display being created.
Well, glad you got it working Just curious, does it still work if you use the fullscreen window mode?
Thanks. There's no obvious difference to ALLEGRO_FULLSCREEN with ALLEGRO_FULLSCREEN_WINDOWED.
The difference should be that with the latter you can have the taskbar or even other application windows on top of your game, right? And there is no delay when switching back and forth.
Affirmative. I've realised that everything is the way it should be. I've also realised that when I think I've done something daft I really aught to try to find out what. Again.
Thanks Dizzy Egg. You've found the answer for me. I got it working now.
You're welcome | https://www.allegro.cc/forums/thread/618318/1048896 | CC-MAIN-2021-39 | refinedweb | 582 | 73.88 |
jGuru Forums
Posted By:
Jabir_Mammu
Posted On:
Thursday, September 16, 2004 07:02 AM
// : GuessGame.java
// Guess the number
import java.awt.*;
import java.awt.event.*;
import javax.swing.*;
public class GuessGame extends JFrame {
private int number, guessCount;
private int lastDistance;
private JTextField guessInput;
private JLabel prompt1, prompt2, prompt3, message;
private JButton newGame;
private Color background;
private Container container;
// set up GUI and initialize values
public GuessGame()
{
super ("Guess Game");
/* Write a line of code that calls the superclass constructor
and sets the title of this application to "Guessing Game" */
guessCount = 0;
background = Color.lightGray;
// create GUI components
prompt1 = new JLabel( "I have a number between 1 and 1000." );
prompt2 = new JLabel( "Can you guess my number?" );
prompt3 = new JLabel( "Enter your guess: " );
guessInput = new JTextField( 5 );
guessInput.addActionListener(this);
//new ActionListener() {
public void actionPerformed( ActionEvent event )
/* Write code that will obtain the guess, convert it to an int and
pass that value to the react method */
}
}
message = new JLabel( "Guess result appears here." );
// button starts a new game
/* Write a statement that creates the "New Game" button */
newGame.addActionListener(
new ActionListener() {
public void actionPerformed( ActionEvent e )
{
/* Write code that resets the application to an appropriate state
to start a new game. Reset the background color to light gray,
set the JTextFields to their initial text, call
generateRandomNumber number and repaint the GuessGame JFrame */
}
// add components to JFrame
container = getContentPane();
/* Write code that will set the layout of the container to a FlowLayout,
then add all the GUI components to the container */
setSize( 220, 150 );
setVisible( true );
generateRandomNumber();
// choose first random number
}
// choose a new random number
public void generateRandomNumber()
{
/* Write a statement that sets instance variable "number" to a
random number between 1 and 1000 */
}
// change background color
public void paint( Graphics g )
super.paint( g );
container.setBackground( background );
// react to new guess
public void react( int guess ) {
guessCount++;
/* Write code that sets instance variable currentDistance to 1000. This
variable's value will be used to determine if the background color
should be set to red or blue to indicate that the last guess was getting
closer to or further from the actual number. */
// first guess
if ( guessCount == 1 ) {
/* Write code to set instance variable lastDistance to the absolute value
of the difference between variables guess and number. This value will
be used with subsequent guesses to help set the background color. */
if ( guess > number )
message.setText( "Too High. Try a lower number." );
else
message.setText( "Too Low. Try a higher number." );
}
else {
/* Write code that sets instance variable currentDistance to the absolute
value of the difference between variables guess and number. This
variable's value will be compared with lastDistance to determine the
background color. */
// guess is too high
if ( guess > number ) {
/* Write code that sets Color variable background to red if the
currentDistance is less than or equal to lastDistance; otherwise,
set background to blue. Then, assign currentDistance to
lastDistance. */
}
else if ( guess
< number ) { // guess is too low
message.setText( "Too Low. Try a higher number." );
else { // guess is correct
message.setText( " Correct! " );
guessInput.setEditable( false );
guessCount = 0; // prepare for next game
}
repaint();
} // end else
} // end method react
public static void main( String args[] )
{
GuessGame application = new GuessGame();
application.setDefaultCloseOperation( JFrame.EXIT_ON_CLOSE );
} // end class GuessGame
Re: Could You help me to debug this java problm?
Posted By:
Christopher_Koenigsberg
Posted On:
Sunday, September 26, 2004 05:40 AM | http://www.jguru.com/forums/view.jsp?EID=1199525 | CC-MAIN-2015-14 | refinedweb | 560 | 53.81 |
However, recently a different problem turned up with OS 10.2.6 and the Java SDK 1.4.1. The "shading" of the fish is where it belongs, but the outline of the fish and its eyes are shifted so that they center at a corner of the square instead of at the center the square. It is also a problem with graphics acceleration, but this version did not allow graphics acceleration to be turned off.
Apple has now fixed this bug and has released an updated version. To get it, run "System Preferences" and select "Software Update". It will give you the option to download a new version of Java SDK 1.4.1. Download it, restart your computer, and the problems with offset fish outlines disappears.
Ideally everyone would be able to update to the latest versions of the operating system and the Java language. It is the easiest and cleanest way to deal with this problem. However, for those who cannot upgrade, there is a way to work around the problem.
There are two areas which will cause difficulty. The first is that a number of the library classes and interfaces in the AP Java subset were not in SDK 1.1. These classes are:
java.util.Random
java.util.ArrayList
java.lang.Comparable
java.util.List
java.util.LinkedList
java.util.Set
java.util.HashSet
java.util.TreeSet
java.util.Map
java.util.HashMap
java.util.TreeMap
java.util.Iterator
java.util.ListIterator
Fortunately Sun has provided two Java Archives,
collections.jar and
swingall.jar, that implement
all of the library classes needed to teach an AP course
and the Swing library. You can download
these two
.jar files by clicking on the following link:
JarFiles.zip
To use these
.jar files, put them in the same folder with the code to
be run or add them to a library folder and make sure that the class
path or the access path in the IDE that you are using includes that
libarary folder.
IMPORTANT: If you are using CodeWarrior, you can save yourself a lot of problems
by putting a copy of
collections.jar in the following folder,
where the arrows show the sequence of folders to follow, starting with
the
System Folder:
System Folder --> Extensions --> MRJ Libraries --> MRJClasses
The Swing classes can be imported by using the statement:
import javax.swing.CLASSNAME;where CLASSNAME is the name of the class to be imported. Unfortunately the classes in
collections.jarcannot be imported in the same way. Instead of saying:
import java.util.CLASSNAME;or
import java.lang.Comparable;one must say
import com.sun.java.util.collections.CLASSNAME;
This means that code that is taken from books or other sources that use any of the classes and interfaces named above must have its import statements modified. This is unfortunate, but given the protection rules in Java there was no good way around it. Only the builtin Java libraries can have classes whose path name begins "java.". Therefore the people at Sun had to create a different name for their "add-on" collections library. You will need to modify all import statements that involve the classes listed above.
Unfortunately, the Marine Biology Simulation case study uses graphics classes (in particular ones in the Graphics2D library) that are not available in SDK 1.1. To get around this problem I have re-written the GUI interface to use only older graphics classes. The GUI interface is not as nice as the one in the standard MBS release, because methods for creating gradient shading and other nice effects are not in the earlier graphics package. However, it works on machines and browsers that have only implemented SDK 1.1.
To download this version of the MBS case study as a
.zip file, click on
the following link:
JavaMBS1pt1.zip
This file, when unzipped, contains all the code needed to run the MBS case study. However, if you are curious about the "black-box" and GUI code or wish to to modify yourself, it is available here:
Code.zip
swingall.jar
swingall.jarimplements an early version of Swing. Swing was updated in version 1.3 of the SDK. Therefore if you take programs from books you may run into error messages caused by the fact that you are using newer Swing features that are not included in
swingall.jar.
The Sun documentation on Java (available at) gives the version of the SDK in
which a class, method, or constant was introduced. If a program that you
get from a book uses a feature introduced in 1.3 or later, you will have
to re-write the code to use equivalent features from an earlier version.
One particular problem arises frequently enough to make it worth describing
here. It involves the
JFrame constant
EXIT_ON_CLOSE.
This constant does not appear in
swingall.jar, so code that
uses it gives an "undefined variable" error message.
The simple, if somewhat kludgy way, to fix this problem when using
swingall.jar is to replace the
EXIT_ON_CLOSE
constant by 3 everywhere it appears.
The following explanation of the problem and why replacing
EXIT_ON_CLOSE by 3 works is condensed from Cay Horstman's
book Core Java, pp. 301-302.
The
EXIT_ON_CLOSE parameter for the
setDefaultCloseOperation method was introduced with version
1.3 of the Java 2 SDK. If you are using an earlier version, you need to
remove this line from the source code....
Of course, after removing the call to
setDefaultCloseOperation,
the program won't exit when you close the window. To exit the program, you
need to kill it....
Alternately, you can replace the call to
setDefaultCloseOperation
method with the following code:
frame.addWindowListener(new WindowAdapter() { public void windowClosing(WindowEvent e) { System.exit(0); } });(where "
frame" is the name of the
JFramethat you want to close on exit).
The preceding note told you the "official" way of making a frame close on exit in a pre-1.3 version of the Java 2 SDK. However, in some of those versions, the call:
frame.setDefaultCloseOperation(3);magically works as well. Apparently, the functionality for the "exit on close" behavior had been added to the SDK before the
EXIT_ON_CLOSEconstant was added to the
JFrameclass. | http://www.cs.dartmouth.edu/~scot/ap/mbs/ | crawl-002 | refinedweb | 1,037 | 57.37 |
Creates a temporary file.
Standard C Library (libc.a)
#include <stdio.h>
FILE *tmpfile ( )
The tmpfile subroutine creates a temporary file and opens a corresponding stream. The file is opened for update. The temporary file is automatically deleted when all references (links) to the file have been closed.
The stream refers to a file which has been unlinked. If the process ends in the period between file creation and unlinking, a permanent file may remain.
The tmpfile subroutine returns a pointer to the stream of the file that is created if the call is successful. Otherwise, it returns a null pointer and sets the errno global variable to indicate the error.
The tmpfile subroutine
fails if one of the following occurs:
This subroutine is part of Base Operating System (BOS) Runtime.
The fopen, freopen, fdopen subroutines, mktemp subroutine, tmpnam or tempnam (tmpnam or tempnam Subroutine) subroutine, unlink (unlink Subroutine) subroutine.
Files, Directories, and File Systems for Programmers in AIX 5L Version 5.1 General Programming Concepts: Writing and Debugging Programs. | http://ps-2.kev009.com/wisclibrary/aix51/usr/share/man/info/en_US/a_doc_lib/libs/basetrf2/tmpfile.htm | CC-MAIN-2022-33 | refinedweb | 170 | 59.4 |
Persistent logins in Elixir with Expected
This blog has moved. Please now refer to this article by using this link.
TD;DR I’ve written an Elixir package to enable persistent logins through an authentication cookie, following Barry Jaspan’s Improved Persistent Login Cookie Best Practice. It is available on hex.pm and GitHub.
After writing my server-side session store using Mnesia, I found a new problem to solve: how should I manage persistent logins? One solution could be setting the session to exist forever, but this is a bad idea. If someone gets my session cookie, he can access to my account and that’s it. I have no way to discard the stolen session. I should have one. More: if someone steals my cookies, I should be informed of that.
I have looked for an authentication solution for browser sessions in Elixir. If there are many JWT-based ones for REST-like APIs, the lone I am aware of for browser sessions is Coherence. It seems really great if you want a framework that generates all the user management for you, but this is not what I was looking for. I feel this approach too monolithic. I want to build and use little tools that does one simple thing and compose them, like in the UNIX philosophy. So I would write mine for persistent logins.
The “best practice”
Before to write anything, I needed to figure how I would handle persistent logins. My initial idea was to have a cookie containing an authentication token, renewed on each successful authentication. But yet, I had to search the Internet for a possible better practice.
My research took me fairly quickly to Barry Jaspan’s Improved Persistent Login Cookie Best Practice. The principle is to store not only a token, but also a username and a serial in the authentication cookie. On a standard login through a user interaction, a new serial and token is randomly generated. Then, when the user’s browser presents the cookie in order to authenticate, the server looks for a username–serial pair in its database. If there is one, it then checks wether the token matches:
- if it is the case, the user is successfully authenticated; a new token is generated while the serial remains the same for this login instance;
- if it is not the case despite the serial beeing correct, it means the token has been re-used. In this event, all the user’s persistent sessions are discarded and he gets notified of a possible attack.
In addition to that, Barry Jaspan advises to use a short-lived standard session cookie, enforced server-side. When the session cookie expires, the user authenticates again thanks to his authentication cookie.
I would add two things: a user should be able to list his current logins and discard them. When a login is discarded, the current session associated with it should also be immediately discarded.
Expected
Lexical note: when I write “session”, I mean the standard session, managed through Plug.Session. When I write “login”, I mean a persistent login managed through Expected.
So here we are: I’ve written an Elixir package and I named it Expected. It is made of three parts:
- a login store, where logins are registered,
- plugs to register logins, authenticate and logout,
- an API to list logins and discard them.
Let’s now explore each of these parts.
The login store(s)
When a user logs in through the login form, an
Expected.Login is created. It contains the user’s username, a newly generated serial and token, the session ID and other metadata such as timestamps and peer information.
Logins must be stored somewhere by Expected. I’ve written a login store using Mnesia, which comes with a mix task to help you create the table:
$ mix expected.mnesia.setup
This is currently the only real store, but that’s up to you to choose wherever you want to put your logins:
Expected.Storeis a behaviour with a few callbacks to implement. I’ve even written a module that automatically generates tests for your callbacks’ implementation when using it. I also plan to eventually write an Ecto store when I will feel the need. If you want to use Expected with Ecto and are willing to help, you can open an issue on GitHub so we can discuss about a good way to implement it.
The plugs
Expected comes with three plugs so that login management is easy on the connection side. Registering a login is simple as plugging
register_login/2 in your login pipeline:
case Auth.authenticate(username, password) do
{:ok, user} ->
conn
|> put_session(:authenticated, true)
|> put_session(:current_user, user)
|> register_login() # Call register_login here
|> redirect(to: page)
:error ->
...
end
It fetches all the information it needs from the session as long as it contains a
current_user with a
username. Naturally, these fields can be configured.
Authentication from a cookie is managed by
authenticate/2, that you can plug in your browser pipeline:
It follows Barry Jaspan’s best practice for you, checking and renewing the cookie if the session is not currently authenticated.
There are yet two actions left to your care because Expected can’t know how to do them:
- load the user from the database after a successful authentication,
- render an error message in case of an unexpected token.
You can achieve this by writing plugs and calling them after the
authenticate/2 plug.
If your users want to logout, which is somewhat fair, you can call
logout/2on a connection:
conn
|> redirect(to: "/")
It unregisters the login from the store, deletes the associated session and cookies.
The login management API
As I said earlier, a user should be able to list his logins and discard them. To help you provide your users such a feature, Expected exposes a few functions. The most useful are the two following:
list_user_logins(username :: String.t) :: [Expected.Login.t]delete_login(username :: String.t, serial :: String.t) :: :ok
The first one returns the list of registered logins for a given user. You can use it to create a login list and show some information about them, like their creation date, their last activity and the IP and user agent of the last successful authentication.
With the second one, you can delete a login. Not only it is deleted from the store, but so is its associated session. The distant logout is thus instantly effective.
Some more technical details
TL;DR In this section, I discuss about some implementation details and difficulties I have encountered. If you do not have much time to spend here, you can jump to the conclusion below.
Old logins cleaning
To avoid old inactive logins to stay forever in the store, Expected is shipped with a login cleaner. That’s a simple GenServer which routinely calls
Expected.clean_old_logins/1with the cookie max age as an argument. This way, logins associated with cookies that should not be valid anymore are effictively deleted server-side.
This function is store-agnostic, but thanks to the
clean_old_logins/2callback in the store specifications, it can leverage implementation-specific optimisations.
Session management
For the logout to be guaranteed when a login is discarded, Expected also needs to delete the current session if it exists. To do so, it must know the session ID and the session store to call. Unfortunately these two pieces of information belong to Plug.Session.
The session store configuration is not available application-wide: it is evaluated at compile time by
Plug.Session.init/1to be passed to
Plug.Session.call/2then. The session ID exists only for server-side session stores, and it is stored in a cookie fairly lately in the connection lifetime. In fact, it is put by a before_send function registered by Plug.Session.
Gathering all this information seemed to be a challenge. I even asked myself if it was a good idea to pursue in this way, as it needed to access some Plug.Session internals. Maybe should I wrote a session store into Expected? I had just written plug_session_mnesia and kept in mind my idea of “one package, one task”, so I was not in peace with this option. It was kind of a brain teaser and I had many other concerns at the time, so I made a break.
Eventually, I started again to work on Expected and said: “Hey, let’s just say that the application developer will use Expected for login and session management, and let Expected use Plug.Session itself, internally”.
The Plug.Session configuration is generally done this way:
plug Plug.Session,
store: :ets,
table: :session,
key: "_my_app_key"
In fact,
plug calls
Plug.Session.init/1 during the compilation:
Plug.Session.init(store: :ets, table: :session, key: "_my_app_key")
The result of
Plug.Session.init/1 is then passed to
Plug.Session.call/2 each time it is called in the pipeline. Internally,
Plug.Session.init/1 also initialises the session store configuration.
Expected would be a wrapper for Plug.Session, so I decided to put the session configuration in the Expected one:
config :expected,
# Login store configuration
store: :mnesia,
table: :logins,
auth_cookie: "_my_app_auth", # Session store configuration
session_store: :ets,
session_opts: [table: :mnesia],
session_cookie: "_my_app_key" # Indeed, this is mapped to :key
As I prefer to load the configuration on the application startup and not at compile time, I had yet to find a way to store the return value of
Plug.Session.init/1 and some other configuration options. I managed that by compiling at the application start a configuration module containing one constant function:
defp compile_config_module do
# Calls Plug.Session.init/1 and other init functions
expected = init_config()
config_module =
quote do
defmodule Expected.Config do
def get, do: unquote(Macro.escape(expected))
end
end
_ = Code.compile_quoted(config_module)
:ok
end
Expected.Config.get/0 returns a configuration map, accessible from anywhere in the application at the cost of a single function call. Thanks to this, I can call the session store functions where I need them.
For the session to be availabe on the connection,
Plug.Session.call/2must be called in your pipeline. As Expected is a wrapper around it, it is simply called by
Expected.call/2 . You just have to plug
Expected in your endoint, where you would otherwise plug
Plug.Session .
The only remaining piece of information to get is the session ID. As I said earlier in this article, it does exist only for server-side session stores. That’s a requirement for Expected to work. Plug.Session puts the session ID in a cookie thanks to a before_send function. Reading the documentation, I found these functions are called in the reverse order they are registered. If I register a before_send function before the Plug.Session one, it will be called after. Thus, I can fetch the session ID from the response cookie:
def call(conn, _opts) do
expected = config_module().get()
conn
|> put_private(:expected, expected)
|> register_before_send(&before_send(&1))
|> Session.call(expected.session_opts)
end
Conclusion
Writing Expected has been quite a good experience. I have learned about different subjects, from Plug internals to a bit of meta-programming. It has also been the opportunity to write another tiny package: export_private, which allows to export private functions witout compiler warnings when you build in test environment.
Now, Expected is available for you to try on hex.pm and GitHub. It may evolve with a few more security options in the next few months, but overall I’ll try to keep it not too big. This is the start of a journey, so every review or comment is welcomed. Don’t hesitate to reply to this story on Medium or open issues on GitHub if you feel there is something to say. In the end, I hope it can be helpful to some of you. Meanwhile, the next step for me now is to build a Phoenix generator to kickstart my future web applications projects. | https://medium.com/@ejpcmac/persistent-logins-in-elixir-with-expected-70b9aac2bcae | CC-MAIN-2020-05 | refinedweb | 1,989 | 56.25 |
How to multiply a sparse matrix by a dense martix with eigen?
I am trying to multiply a sparse matrix by a dense matrix in Eigen in C++ (the dimensions of course match). The following doesn't seem to work.
Here is a MWE:
#include <Eigen/Dense> #include <Eigen/Sparse> using namespace Eigen; int main() { SparseMatrix<double> s; s.resize(3,3); MatrixXf d(3,3); MatrixXf d2(3,3); // gives an error s*d // doesn't give an error d*d2 }
EDIT: The page here suggests that it should work smoothly, yet it doesn't...
Answers
Your problem is is not sparse-dense, but rather mixed types, Xhich isn't allowed. Your sparse matrix is of type double while the dense matrices are of type float (MatrixXF). Change MatrixXf to MatrixXd (or cast to double) and it works fine.
Need Your Help
Direct2d command analog to OpenGL's SwapBuffers?
delphi delphi-2010 c++builder direct2d c++builder-2010What is Direct2d command analog to OpenGl's SwapBuffers? I am using this in a VCL environment such as Delphi and CPP Builder. Thanks
Properly formatted multiplication table
python string algorithm python-3.x formattingHow would I make a multiplication table that's organized into a neat table? My current code is: | http://www.brokencontrollers.com/faq/31006745.shtml | CC-MAIN-2019-30 | refinedweb | 210 | 66.64 |
Talk:Proposal process
Contents
- 1 Tag messiness
- 2 marine-tagging approved now?
- 3 Sign your comments on Proposed features sub-pages?
- 4 Moved page
- 5 Template for sub pages / actually doing something
- 6 Approved features
- 7 Ordering
- 8 Procedure to add a new proposed feature
- 9 different signs for different nationalities
- 10 The Tables
- 11 Cleaning Up this Page, and Making this work more like a wiki
- 12 How to suggest something?
- 13 Using a template to populate the proposal page
- 14 Template:Proposal_Page
- 15 Auto-generate table of proposed features
- 16 Page format change?
- 17 Sorting by category or by status and date
- 18 Change of the approval process
- 19 Drifting from reality
- 20 Proposal process debate ongoing
- 21 Post-vote clean up process needs extending?
- 22 Time and date based tags
- 23 Different fuel sorts / kinds
- 24 Proposed features process: Rejection at draft and proposed
- 25 RFC: Link to mailing list archive in Proposal
- 26 Question about abandoned status
- 27 Cleanup Request
- 28 Features that hasn't gone through the proposal process
- 29 Blue Ribbon Features
- 30 Change Voting terminology
- 31 Tagging of fruit trees and edible plants
- 32 Proposal page should encourage proper namespace usage
- 33 Please promote wiki pages instead of Taginfo for popular values
- 34 Deprecated label
- 35 Resurrecting abandoned proposals?
Tag messiness
Apologies if this isn't the best place to raise a general question. I'll happily move it if there's somewhere more appropriate. I also apologise if it's presumptuous of me to be critical of work done when I'm a consumer rather than a creator.
Looking at all the tags as a prelude to creating a specialised map, I was struck by how many tags there are that make no sense to me at all, how many others are confusing because what the word itself means in OSM is not what it means in the larger world (e.g. "highway"), and how the language granularity/focus varies in irregular and non-intuitive ways (e.g., "junction=roundabout","highway=mini_roundabout", "highway=turning_circle", "junction=circular ).
Although I can solve at least some of the problem for myself by running a filter on the data, I'm wondering whether the language aspects of the tagging system aren't overdue for a general cleanup and regularisation. Niemand (talk) 13:47, 28 March 2017 (UTC)
marine-tagging approved now?
it's 18:2 now. Should be and appropiate number of votes to be approved and let it move to the final-localtion and set as a tagging basement for OSM. What do you think? --Cbm 10:42, 15 August 2010 (BST)
Sign your comments on Proposed features sub-pages?
Perhaps if somebody adds a comment to the subpages here, you should sign them like this- ~~~~? - Bruce89 13:02, 13 Jun 2006 (UTC)
- Agreed, if the subpages are to function like talk pages. Wikipedia says sign your posts on talk pages. OSM Wiki is not Wikipedia, but Wikipedia's style guidelines are the result of vast experience of what works best. Teratornis 17:59, 7 Aug 2006 (BST)
- Another option might be to put the talk-style comments on the talk pages of the sub-pages, while trying to keep the sub-pages proper relatively less chatty, and reflecting the current consensus. For example:
- Proposed_features/Power_Lines contains comments by two users as of 18:07, 7 Aug 2006 (BST).
- Each user could sign his/her comments on the page itself, or on the talk page: Talk:Proposed_features/Power_Lines Teratornis 18:07, 7 Aug 2006 (BST)
Moved page
I've just moved this to use the same name as the now sub pages --Dean Earley 10:46, 4 Jul 2006 (UTC)
Template for sub pages / actually doing something
Perhaps we could have something on each sub-page to show which renderers have actually implemented any given feature Ojw 05:10, 6 Jul 2006 (UTC)
Approved features
What process should we go to to move a feature from "proposed" to "approved"?
Accept votes (Comments/signature on each page) and whichever reaches 5 more then the other first wins? --Dean Earley 23:25, 19 Jul 2006 (BST)
- Personally I think if they fit with the current format of Map Features they can be included after a short time here to alow for anyone to comment on duplication or alternatives. I don't see the need for a vote. Blackadder 09:59, 20 Jul 2006 (BST)
- I agree, if no one has said a proposed feature is a bad idea, then after a short while it should be transferred to the Map Features page. Dmgroom 11:27, 20 Jul 2006 (BST)
- Just move anything older than 2 weeks into Map Features unless there's a load of objections to it? Ojw 20:00, 25 September 2006 (BST)
- Proposed features Sandbox--Nickvet419 22:21, 12 June 2008 (UTC)
Ordering
Are the proposed features in any particular order? - most recently at the top for example? --Gwall 10:53, 5 September 2006 (BST)
- It started out in chronological order, most recent at the bottom. But this order doesn't seem to have been adhered to. The advantage of having it in date order is that it is relatively easy to identify potential transfers of the oldest to the approved map features page. Dmgroom 11:22, 5 September 2006 (BST)
Procedure to add a new proposed feature
Is it as simple as adding it to this page or is there a discussion before on some other page and someone in charge edits this page ? Pov 14:21, 1 October 2006 (BST)
- "send out a request for voting to the mailing list and set the voteStartDate" however it does not state what mailing-list is ment (osm-talk? osm-dev? osm-talk-<country>?). --MarcusWolschon 12:07, 28 November 2007 (UTC)
different signs for different nationalities
If I see an american police sign, I think of a parking lot. Is it possible to do some default sign lists for us, en, de...? Jk 21:25, 23 October 2006 (BST)
The Tables
I feel bad about the column "Rendered as" in the tables of the page. In my oppinion the way how something should be rendered is strongly dependend of the purpose of the map (if rendering a map is the purpos at all). It may also be dependend on cultur, nation etc, see the parking lot issue above.
I suggest to remove this column completely and instead put in a column, that gives a short description of the proposed feature. --Kumakyoo 18:34, 27 April 2007 (BST)
Cleaning Up this Page, and Making this work more like a wiki
I think that unless there are objections, or a proposal is still in an active discussion, then everything should be added to the features page. We shouldn't really be voting on everything, but just discussing it. At least if things are put onto the map features page, then they will be noticed and can be removed when valid reasons are made. So on the 21st of June, I propose that this page should have a mass filtering. Anything else, should sit here for a week/fortnight and then the same. Objections? (Some things should be shifted right away really)Ben 23:04, 7 June 2007 (BST)
- The content of text should not be changed generally. Please respect, the OSM project is not only a dictionary. This is also a software project. Descriptions are free, but determinations with influence to the software are to be discussed. This concerns, for example, the acceptance for keys and names. OnTour 21:56, 11 July 2007 (BST)
- OSM is mapdata. Its not a dictionary, and its not a softwear project. Acceptance isn't the same as a vote. The only softwere effected by changing tags is the rendering and that is not what OSM is. OSM is the data. Renderer's render. Renderer's should not dictate how people tag. Please try to be more constructive, and less aggressive when replying in the future. Ben 00:30, 12 July 2007 (BST)
How to suggest something?
I wonder how I am supposed to tag a Kindergarten/Playschool/Nursery/daycare? Balu 02:52, 16 September 2007 (BST)
- I've been tagging them amenity=preschool in the absence of other suggestions/proposals/standards but it would be nice if someone proposed something and got it approved. Karora 08:49, 31 December 2007 (UTC)
- I've added a page here: Proposed features/Pre-School (early childhood education) and once I work out which mailing list I have to send something to, and subscribe to it, I'll do that, I guess. Karora 09:34, 31 December 2007 (UTC)
It's clear that many visitors with features to suggest don't know the procedure or don't want to follow it (I for one don't want to participate on a mailing list). Perhaps we could have an area on this page or maybe on the Proposed features page where people can just plain suggest a feature. Other folks, who care, can enter it in the right place or start a discussion on the mailing list (if it tickles their fancy). I got to this point because I want to know how to code red-light cameras, speed cameras, and radar traps. I suppose I could use the hazard tag, but a standard method would be more useful. Muir
- Yeah. The mailing list is kind of daunting. It seems to get a zillion messages a day, but if I want to cut to the chase and discuss a new feature I feel it will be lost in the noise. Meanwhile the wiki has perfectly adequate features around watchlists and discussion pages that don't require me to parse all that noise just to hear the one conversation that I am interested in. Karora 10:39, 4 January 2008 (UTC)
- I think Catagories can do good use for this. We can wor this into the template page somehow to add the correct catagory via the status of the proposal. Also see Proposal Page test --Nickvet419 07:28, 14 June 2008 (UTC)
- I have added this to the Template:Proposal_Page, should work very well. --Nickvet419 08:41, 14 June 2008 (UTC)
Using a template to populate the proposal page
- I think this is a good idea for people making proposals to use a template on their page that would populate the proposal page, if that can be done. --Nickvet419 22:23, 12 June 2008 (UTC)
Template:Proposal_Page
Proposal Page test --Nickvet419 00:18, 13 June 2008 (UTC)
Auto-generate table of proposed features
What appears to be needed is a way to autogenerate the various tables. Has anyone investigated whether Mediawiki supports this? The table should be generated from pages that include Template:Proposal Page, or from all pages in a category, such as Category:Proposed features "Proposed". So far, I haven't found a way to do this. Anyone? Robx 11:45, 14 July 2008 (UTC)
- I don't know how to do this in unmodified wiki, but there is a nice extension Semantic MediaWiki which can be used for that. --Jttt 20:04, 14 July 2008 (UTC)
- That looks great, thanks! I'll look into whether it's a possiblity for this wiki. Robx 11:12, 15 July 2008 (UTC)
- Some related discussion at User_talk:Harry_Wood#Semantic_Mediawiki. Robx 16:26, 6 August 2008 (UTC)
We now have a prototype for the OSM wiki with semantic extensions up and running. It demonstrates how tables of map features can be generated using Semantic MediaWiki. Gubaer 19:59, 3 February 2009 (UTC)
Page format change?
Why was the page and proccess changed? This was not dicussed and will be reverted. —Preceding unsigned comment added by Nickvet419 (talk • contribs) 01:40, 1 November 2008
- Why the change was needed:
- It was hard to find the current events (Therefore current votes got too less attention)
- that is what the talk request is for, and I do have a system in place for that already as a catagory, this can easily be taken care of. --Nickvet419 05:19, 1 November 2008 (UTC)
- The list was full of abandoned and invalid entries (They are still not moved to Rejected_features but the site is usable now)
- I agree that they should be moved.--Nickvet419 05:19, 1 November 2008 (UTC)
- The categories was questionable (They are still, but it does not matter if sorted by status)
- They were set up to match the feature page for the ease to find and propose--Nickvet419 05:19, 1 November 2008 (UTC)
- With "Category" as part of the table you can still sort by that, but default to the more useful sort-by-status-and-date (So nothing is lost)
- Where did tagging go???--Nickvet419 05:19, 1 November 2008 (UTC)
- --Phobie 04:43, 1 November 2008 (UTC)
- It is OK to do major changes on a Wiki, but it is not OK to do major reverts without prior discussion (unless it is vandalism)! Your revert to 15:48, 30 October 2008 must be considered as vandalism, because you also deleted all other changes not only the change of the categories (i.e. deleted Proposed_features/aeroway_obstacle or the changes by User:Frederik_Ramm)! I will revert your revert for now. If we (the OSM-users) find a consents about sorting by Category and not by Status, I'll accept that if no other changes get lost! --Phobie 04:43, 1 November 2008 (UTC)
- yes I am a vandalizor and I mean no good to the project... I am kidding of course, Things should be dicussed befor a major edit and posted to the proper talk page. That is edicate--Nickvet419 05:19, 1 November 2008 (UTC)
- and yes I saw the other changes and would add them back in. --Nickvet419 05:25, 1 November 2008 (UTC)
- What is better with the old sorting (many categories)? --Phobie 04:43, 1 November 2008 (UTC)
- They were set up to match the feature page for the ease to find and propose--Nickvet419 05:19, 1 November 2008 (UTC)
- Why do you revert first and than sent me an email asking for my intentions? --Phobie 04:43, 1 November 2008 (UTC)
- I did ask first.--Nickvet419 05:19, 1 November 2008 (UTC)
- Like told via email before: I asked on the IRC-Channel #osm before doing that big change and there were no objections. And no, I can not send a link to that discussion! irc://chat.freenode.net/#osm --Phobie 04:43, 1 November 2008 (UTC)
- I sent you another email stating why. I was the one who set up the current proccess and I know all the interlinkings with the templats and catagories. I am willing to help and discuss this with you. --Nickvet419 04:50, 1 November 2008 (UTC)
We finished that discussion via email and IRC-chat... The only thing left is about sorting entries by category or by date. --Phobie 02:08, 7 November 2008 (UTC)
Sorting by category or by status and date
Nickvet419 implemented the structure of Map Features on Proposed features. While I think that is good for Map Features, sites like Proposed features and Rejected features should be sorted by status and date! Please have a look at [1] and [2] and write down your opinion! --Phobie 02:08, 7 November 2008 (UTC)
- The reason I categorized the proposals is so it mimicked the Map Features page. I think this allows users to easily locate add a new proposals. I also made the tables storable to easily sort the tables. The problem with seporating tables by status and date is it is not as simple to locate a proposal. Also, without an auto list filler the users would have to manually move the proposal from list to list during the proposal process. It is hard enough to get them to update the status let alone move the listings.--Nickvet419 06:11, 7 November 2008 (UTC)
- Also another thing I did was to add links to the proposal status guildings as in list of Voting. This helps in quickly locating proposals acording to status.--Nickvet419 06:16, 7 November 2008 (UTC)
- Well, sorting by status and date is interresting for people trying to clean-up the existing list of proposals, where sorting by category is interresting for people who wants to find if their new idea has already been proposed by somebody else. I think that the majority of the people looking this page are in the second case, meaning that, imho, the current sorting is good enough (although we must be thankful to contributors who try to clean-up the list). -- Pieren 09:39, 7 November 2008 (UTC)
- +1 --Cartinus 22:11, 7 November 2008 (UTC)
- The biggest problem we have is people not updating the status, and not updating the list. This leads to a long list of unfinished and abandoned proposals. Once we get autofill lists, I think the process will be much easier to maintain.--Nickvet419 13:07, 7 November 2008 (UTC)
Solution
If you want to solve this you do this:
- change the proposed featured guidlines
- create a new page with proposal
- the page should contain
- template with categories and dates
- categories for status
- description
if you want to change the way things are sorted you just change the categories that you have on the pages. There are lots of tools to do mass edits based on categories if you need that. Erik Johansson 14:50, 7 November 2008 (UTC)
Change of the approval process
Take 1 (2008-12)
Recent discussions have shown that the current voting process introduces some problems.
I have some recommendations:
- remove the vote-end-date, just check every week after the vote-start if the approval condition have been met
- replace "vote" with "approval", to stop people counting the votes and saying 7:3 can not result into reject
- every "vote" needs a comment, "votes" without rationale will be removed
- voting will not be closed after approval, but if there are no new comments on the talk-page for about two weeks
approval conditions:
- at least 8 votes with valid comments
- no mayor objections
- objections are only valid if a better way to go is shown
- minor objections should result into a new proposal which improves the first one
Why?
- Because we have many mappers who do not read the talk-mailing-list and the Proposed features regularly. They only get notice of new features after they joined the Map_features. Those users should have a late chance to write down their objections on the proposal-talk-page.
- Because a 2/3 majority should not mean a sure approval. Two or three users with mayor objections should be able to stop a proposal.
- Votes without comments are often from user who like to vote but do not understand mapping. Their comments would reveal that. Also comments are useful for later improvements.
- Many users write valid objections but do not help to improve.
--Phobie 10:24, 1 December 2008 (UTC)
- Make all votes open end, would be o.k. I think. Major changes in some categories might inflict on other keys too.
- I would say every objection vote needs a comment. If people have been drafting the proposal what should they post? I like the proposal or See my contribs on the proposal, or this makes sense? --> Those are not really usefull comments.
- Who defines what a major objection is? For me the name i.e. mtb:scale or severity:mtb would definitely not be a major objection. While this will be hard to implement into Josm and Potlach or Mkgmap definitly is a major objection while at the same time proposing a way to achieve the goal with easy implementation into Josm and Potlach would be. I think the major focus should be on wheter the goal stated can be achieved wit the proposal or not.
- Minor objections should be considered but no more. If you read through many talk pages on proposals you will see many objections and changes until a way appropriate to the majority is found.
- I rather think votes without comments are from people who like to tag things as laid out in the proposal, without understanding something about the rendering and mapping techniques behind the scene. I don't think it would be fair to exclude them from voting however. Maybe they are major map material contributors.
- People who write objections whithout being able to improve should nevertheless be considered. Some things are simply very difficult. I have for example no idea what we can do with areas that serve different purposes at different times of the year. So I approve the ice_rink proposal, because in wintertime I do want to be able to know where an ice_rink is. In summer there might be a swimmingpool instead, which I too would like to see on the map. I know there is a problem with the proposal. I don't know however how we can best solve this. An implementation would have to be similar to access restrictions with time ranges, but those are very difficult to read in and understand. I cannot be expected that someone spends hours just to find a better way. In my opinion the proposal should nevertheless be approved, but once a good concept for seperation of summer/winter usage has been found it should be replaced. Maybe that solution would be independant of the proposal tag itself. I.e. write valid for time duration, and have a responding check on the renderer for that. Such a responding mechanism should however better be proposed by the authors of the renderer (because they should know better how to implement), than by those people who want to draw in their ice_rink and want to see it on the map too. If in the long run features are not implementable in maps at all, they do serve no big service, as noone will print out a map including all unconsidered tags.
- --Extremecarver 11:47, 1 December 2008 (UTC)
- -
- There are many useful positive comments! "there is no alternative on how to tag usability of a street", "the tag is already widely used, see tagwatch", "This change will definitely improve the parse-ability of the osm database." Your examples are good ones to show bad comments.
- It it easy to find out major objections, you just did it with our examples. But if we talk about implementing we should always talk about implementation in general and not about JOSM or Mkgmap. If those special software has special shortcomings it should probably be improved instead of doing database-workarounds!
- The question is: Did those objections on talk-pages came up before vote-start-date or after? If they came up before the proposal can be improved but after it can only be approved or rejected!
- Minor objections: You have a problem to recommend a user to start a proposal for his minor objection?
- Major contributors can always tell you why a tag is useful!
- Ever dealt with trolls? If difficult things can only be implemented in an average way, that is still better than telling users "We have no best praxis for this, don't tag it or tag it arbitrary". Later you show that you are with me: You approved both features while you have major objections but no better way to do it. This is exactly what I want. You votes "yes", ok, but if you had voted "no" without in alternative, the feature should be approved anyways. In the end you reveal that you are tagging for the renderer! If a tag is not useful for printing on a map, that does not mean it is not useful at all. Think about routing-software and POI searches! The usability of tags varies by usage. I would not delete sac_scale because it will never be rendered on Mapnik.
- --Phobie 04:27, 2 December 2008 (UTC)
- Well sorry I worded it wrong. It's not about wheter the renderers can display a tag, but wheter the renderers CAN (not will or already do) make use of a tag/key. Sac_scale of course will not be printed on Mapnik, but on hiking maps. It's not about wheter the main renderers will use it, but wheter the main renderers could be adapted to use or display/print it. --Extremecarver 09:50, 2 December 2008 (UTC)
- There are not only renderers out there. If a tag is not useful for renderers it can still be useful for POI-searches or routing software. I can only imagine three reasons why a tag should be avoided: 1. copyright issues 2. fast changing data (traffic jam, wlan-hot-spots) 3. no one can use that tag for anything useful --Phobie 10:40, 3 December 2008 (UTC)
- Any keys can be added to the map, if rederers decide to show a graphic on the map, that should have nothing to do with this voting proccess.. I think the voting proccess should only be a way for users to decide a standard way of tagging. This way when a tag does make it to the map, they dont have to render 15 diferent kinds of tags. therefore, I also think we should start a new voting/proposal page for map additions or graphics to be displayed on the map.--Nickvet419 08:51, 4 December 2008 (UTC)
- In principle yes, any key can be rendered. But there could be keys that are very hard to render. Like someone tagging mtb:scale:uphill=3;mtb:scale:downhill=2 in one line, while renderers as they are working now will only read the first halve, or might drop it completely. Same goes for highway=footway;bicycleway etc.... Using keys like this would need a lot more computer power on the renderer side by having additional controlls. Terefore such a tagging system should not be proposed for use. Another case would be someone tagging: acces:no_access_for_200m instead of putting the nodes properly (this would be practically impossible to display - someone adding a junction and it becomes impossible for the renderer to know to which way it applied). So it should have consequences, if the keys are not implementable. Also Complex Arguments in keys should be avoided if possible.--Extremecarver 15:26, 4 December 2008 (UTC)
- So what I think you are trying to get accross here is that there should be a discription page that explains what a good tag looks like and why it should not be complicated for redering purposes. --Nickvet419 14:08, 9 December 2008 (UTC)
- Making votes open ended has potential, but the problem is that a key could be approved one week, and then disapproved the next. This would not be good. Even properly approved keys have trouble with troublemakers (see the smoothness debate/edit war)
- "stop people ... saying 7:3 can not result into reject": You're saying the vote has to be unanimous? Good luck getting any keys approved like that...
- Who gets to decide if an objection comment is "valid"?
- Who gets to decide if an objection is "major"?
- Who decides that a different way to go is "better"?
- I agree with what Extremecarver said regarding objections without suggestions for improvement.
- --Hawke 17:26, 1 December 2008 (UTC)
- "disapproved next week" - What is bad about that? Currently a new approval could also disapprove an old one. Troublemakers are no problem if they are forced to offer an alternative.
- "unanimous" - No, I don't! I only wanted to say that it is a show-stopper if there are three different users with major objections.
- "valid" - In most cases this is obvious. If not it should be discussed on the talk-page. And if than there is still doubt it should be considered to be valid!
- "major" - See above line!
- "better" - I used the wrong word. I meant "alternate"! If the users shows an alternate way, others can comment on that and quickly it will be clear if the alternative is better or worse.
- "objections without suggestions" - See above!
- --Phobie 04:39, 2 December 2008 (UTC)
- I think;
- I dont think there is a need to vote after a key has been approved. I think a vote-end-date should be placed to show when a feature met te voting standards.
- "replace "vote" with "approval", to stop people counting the votes and saying 7:3 can not result into reject" - I'm no sure what is ment by this... because rejected proposals can be put back though the proccess.
- "every "vote" needs a comment, "votes" without rationale will be removed" - Every No vote should have a valad argument. Why do you disagree with the proposal? what changes can be made?
- Approval conditions...
- 8/15 approved votes withough major objections or sugested changes.
- This goes for approved votes and disaproved votes.
- If rejected, proposal can be modified and moved back to a new vote.
- --Nickvet419 01:05, 2 December 2008 (UTC)
- "I think; I dont think" - Why?
- "replace" - The approval process should look less like votes users know from their governments.
- "every vote needs a comment" - ok
- "approval conditions" - You meant at least 15 votes and a simple majority? Ok! What should we do with proposals which do not get the 15 votes after several months? I think we should lower to at least 8 votes two month after vote-start-date.
- --Phobie 04:58, 2 December 2008 (UTC)
- If we're going to continue to use approval voting, the threshold had better be set a damn sight higher than 50%. Ideally, we can deprecate the voting thing entirely, or at least make it more clear that the vote does not in and of itself give some kind of mandate. The focus needs to be more on the discussion, since that's where the important information changes hands. Chriscf 09:26, 2 December 2008 (UTC)
- We should state that the votes only count in a way that it shows that the majority agrees how the feature should be taged. Not that the tag is invalid or cannot be used. I had stated in the page discription that any tag can be used, and the voting proccess is only to create a standard way of tagging a feature. --Nickvet419 08:58, 4 December 2008 (UTC)
- The problem is still that voting tells us nothing other than numbers. It tells us how many people are in favour or against, which isn't a useful measure of anything. Otherwise, you end up in a situation where you get people voting for something without understanding the implications (Proposed features/Smoothness, Proposed features/Status), or voting against something for petty procedural reasons (Proposed features/Bench). Voting might have worked when the project was much smaller, but with the phenomenal growth we have seen in the last year or so it's no longer sustainable. Chriscf 10:42, 10 December 2008 (UTC)
Take 2 (2015-03)
- It seems that the current approval/rejection policy lacks logic: a feature with 8 approval votes and 1 rejection vote is not approved. After adding 6 more rejection votes, it gets approved due to the 8+7>=15 and 8>7 rule. For discussion, see.
- It is therefore proposed to change to formulation from from "...8 unanimous approval votes or 15 total votes with a majority approval..." to "...8 or more unanimous approval votes or 10 or more total votes with more than 74 % approval...".
- For discussion of this change, see:
--Kotya (talk) 00:00, 18 March 2015 (UTC)
Drifting from reality
This page seems to be increasingly drifting away from the real official approval process, which is:
- Example: you have found a new feature and don't otherwise know how to tag it (i.e. you're not making up tags for the sake of it)
- Discussion: deciding how best to tag it if not obvious (may be accomplished by yourself if it is obvious)
- Use: having decided how to tag it, tag it
The focus needs to move away from the voting and towards the discussion, and any change to the wiki process needs to reflect this a little more closely. The proposal process needs to be more about mapping, and less about process wanking.
Chriscf 09:49, 3 December 2008 (UTC)
- Your simplified process steps do not tackle the problem. These steps are all very well, in fact I would agree that they reflect a real process which people follow when they are getting on with mapping. But this doesn't address the issue of what tags are allowed onto Map Features. That is what the voting process described on this page is all about. That is also what lies at the heart of your recent wiki conflict.
- Do we need to have a process about documenting tags on the wiki (and in particular Map Features), or is this "process wanking"? Well I would've thought you of all people would be in favor of preventing all those "idiots" adding things to Map Features. That's what the process is for. Certainly it's a shame that we have to focus a lot of effort on defining processes, but... well it's you who is forcing the issue.
- The process could be improved or changed completely. For example it doesn't necessarily need to involve voting, or the idea of "proposals" and "approved" tags at all. Currently this page describes it as 'Proposal Status Process' but in more general terms we need a "Tag Documenting Process" of one form or another
- -- Harry Wood 13:58, 3 December 2008 (UTC)
- What I'm against is idiots arbitrarily adding tags to Map Features, which is what happened with smoothness. Someone held a vote, ignored the many objectors, and decided that this somehow gave them a mandate to add it to MF in its still broken, without a thought about how it might be mapped in practice. This is why the first step is always "example" - a real scenario. Chriscf 14:21, 3 December 2008 (UTC)
- Well it does give them a mandate to add it map features. There's nothing arbitrary about it. They followed the process, such as it is. We do need a documented process for what gets added onto Map Features. The process will involve at some stage giving people the go-ahead / the permission / the mandate, to add a tag onto map features. That is unavoidable. Some mystical "real" process is not going to help us control edits to Map Features. The size of community and the importance of map features, means we have no choice but to follow a documented process.
- It has become clear recently that this go-ahead/permission/mandate is coming too soon or too easily, or without sufficient community-wide (outside the wiki) input. Bad tagging ideas have progressed too far, and been allowed onto Map Features. In one way or another the process needs to be changed to fix this.
- As many people have already pointed out, edit warring and charging around calling people idiots is not helpful (and not behavior the sysops will tolerate forever I might add). But the point I want to make is, it is also unhelpful to grumble about "process wanking" in one breath while complaining about bad tags on map features in another. We need a process. We have a process. People are following it. If this has allowed a bad tag onto the map features page, then let's work together to change the process.
- -- Harry Wood 17:28, 3 December 2008 (UTC)
- A process devised by a small number of people which is clearly not supported by the wider community does not give a mandate. Chriscf 17:35, 3 December 2008 (UTC)
- [personal comments removed] --Hawke 22:15, 3 December 2008 (UTC)
- I agree with Harry on this one. The proccess was set up to help people define a standard tag for a feature. If there is a problem with people adding tags to the main feature page without going though the proccess of discussing and deciding as a whole what the best way to tag a feature is, then we should create an admin team to have controle over the main feature page. their sole focus would be to check the approved feature list for proposals that have passed the approval proccess and add them to the main feature page. problem solved.--Nickvet419 09:08, 4 December 2008 (UTC)
- The "process" described here deviates from the three-stepper I've outlined above, which you'll find is the only "official" process we have. The smoothness debacle didn't have a specific feature, the discussion was ignored, and there wasn't and still hasn't been any widespread use of it. Therefore, it has not successfully passed through the official approval process. Chriscf 10:38, 4 December 2008 (UTC)
- As I've already told you, your three-stepper does not tackle the problem of a how a tag should become "approved" onto the map features wiki page. While it may be useful as a guideline on how mappers could begin using a tag, it is irrelevant to the issue at hand.
- Wiki enthusiasts do need to be very conscious that there is a "wider community". We're talking about people on the mailing list, or people who aren't even looking at that, who are just getting on with the real work of OSM mapping/developing. There is a problem that these people are not getting involved decisions about tags, but it is also a valid point that these people haven't scrutinised the process itself.
- However with the process itself those arguments carry less weight. Wiki voting on tags is something which has evolved since the very beginning of the OpenStreetMap project. It's been with us for several years (set up by the people who founded the project in fact) Plenty of time for people to scream "this is rubbish" and change it for something better. That hasn't happened because the fact of the matter is, the process isn't glaringly obviously bad. There is a subtle problem, which has only surfaced recently as the community has grown.
- So we can't say the process is "clearly not supported by the wider community". Are you suggesting that some consensus is forming on the mailing list, that we should ditch the process entirely and allow anyone to do what they like with Map Features? I don't see that. It would be more accurate to say "the wider community would like to see some improvements to the process".
- -- Harry Wood 11:35, 4 December 2008 (UTC)
- A tag becomes "approved" onto Map Features when there is empirical evidence that it works, and people are generally using it correctly. I don't in any way see how this is not relevant to the issue at hand. The very first step is having something concrete to discuss. Those proposing the smoothness tag could not even formulate exactly what it is they were proposing to map in the first place. This single fact alone should have killed it in the womb, but yet we had people that had no idea what they were doing voting in support. Consensus on IRC and the mailing list appears to be that the so-called "process" has been drifting away from reality, and that users have been abusing the proposals process to be prescriptive, instead of descriptive. The support on the mailing lists comes overwhelmingly from those that have been bitter, mostly under the misapprehension that the vote alone somehow means the feature is "approved". Chriscf 12:26, 4 December 2008 (UTC)
- OK so perhaps that should be step number 4 in your process: "A tag becomes "approved" onto Map Features when there is empirical evidence that it works, and people are generally using it correctly". That sounds reasonable as a outline principle. I also kind of agree with the idea that wiki tag documentation should be descriptive not prescriptive. I can see that some of the troublesome tagging ideas could be shown to be in violation of that principle.
- There's issues around these points, but they could form the basis of a new process, along with several other ideas mentioned on the mailing list. We need to bring the ideas together, and then they need some work to turn them into a draft new process (something which nails exactly who gets to change map features and when)
- We could work on this collaboratively so that everyone can feel involved. Now how could we do this?... It's kind of an unfortunate irony that the best tool we have for this kind of thing is the wiki. My instinct is to create a new wiki page and start work on it, but given that the new process should be accepted by the wider community... maybe that's the wrong thing to do.
- -- Harry Wood 15:38, 4 December 2008 (UTC)
- We should never accept a new approval process base on itself. The solution is : use the old system to accept the new system or else "force it" and that's just somehow a revolution or a coup d'état . I'm totally against the last solution Sletuffe 15:49, 4 December 2008 (UTC)
- We don't yet have a process for changing processes! We could write one of those too if it makes you feel better, but I think that's a bit over the top! We're not talking about overthrowing a government here. On the other hand this should obviously be handled with care, which is why I am suggesting we create a draft new process. -- Harry Wood 17:27, 4 December 2008 (UTC)
- Okay, our process is for features approval. However, many are using it right now, and before changing it, I would prefere writing a clear proposal and cast for a vote on it about changing our way to approve proposals. Yeah, that would make me feel better ;-) and that would clear this unreadable page of wich we don't know what the next process will look like... About the care, I am totaly pro ! This might be a big change, and a draft sound to me more than reasonnable, it sounds needed Sletuffe 18:00, 4 December 2008 (UTC)
- Agreeing with Harry on this one. We don't need a process to change process, because nobody cares. It would be yet another level of needless bureaucracy, and that's only going to turn people off. Chriscf 09:34, 5 December 2008 (UTC)
- Another way of putting it is... While looking at changing the existing process, we will be careful and will apply common sense (without documenting a process) We could write a process for changing processes, but then maybe we'd need a process for creating processes for the changing of processes! At some level it is necessary to just reach agreement.
- Sletuffe, you suggest "cast for a vote" on the new draft process. That's the instinctive thing to suggest for a wiki community, but never forget that this isn't just a wiki community. In this case it is crucial that our new draft process is accepted by the wider OSM community. It will be difficult to judge that acceptance, but the best way of judging that acceptance will definitely not be to cast a wiki vote. In fact I think that would too easily lead to a perception the new process is the product of the same old over-enthusiastic wiki fiddlers!
- I have no problem to ask also for comments and votes on the mailing list, the forum, and wherever related to osm. But I am scared that guys shouting stronger will impose their view. And that the new process just lead to an even worst minority of people deciding. When I read that someone wants to restore a "veto" thing (saying that 50% is far too few). I'm scared we are going to blocking minority. I am in favor, as I said before to "kind of" give the power of decision to people that actualy tag things. And since this is hard, then increase the number of votes needed, but dont go to "if their are 2 objections drop it" or else, I'll have to tag for me only, every one will do that, and some data will be simply unusable or tags will stay poor and badly design, just like tracktype=* is against smoothness=* Sletuffe 18:42, 5 December 2008 (UTC)
- Anyway we're getting ahead of ourselves. The first step is to draft a new process (or indeed it may turn out that we can think of a few simple changes to make to the existing process) I'm actually fairly hopeful that we might reach a clear consensus at that stage anyway, but... well we'll see.
- -- Harry Wood 10:47, 5 December 2008 (UTC)
- (indent reset) The steps described on the content page seem to be bureaucratic, and may well have worked when OSM was a lot smaller than it is, however (as we've seen) there seems to be an awful lot of people voting on the wiki with no idea of what they're doing. The three steps are the starting point - (1) no new tag without a real feature to support it (2) a basic sanity check to make to make sure a tag makes sense (3) some sense that the tag will be easy to use and understand. What we need to do is crystallise these into something that isn't too rigid, and doesn't encourage wasting time on petty legalism. Some people have difficulty with the idea of not needing the form signed in triplicate and stamped in all the right places to get things done properly. Chriscf 17:32, 4 December 2008 (UTC)
- I feel like we've made progress with yesterday's discussion. The next step is clear (although I'm not sure whether to begin work on drafting a new process on the wiki)
- BUT I do still feel that the existing documented process needs to be followed in the interim period until we have made improvements.
- Chris has ideas and principles about how tagging should work. Something he describes as the real process. But these are not clearly formulated enough to function as a process governing a wiki page like map features (a wiki page which a large community focuses on, feels passionate about, and has opposing views about). By "clearly formulated" I suppose I could have said "legalistic" or "bureaucratic". It is the nature of the way a wiki community self-governs (where the community is large enough or attempts to contend with opposing viewpoints while still allowing open editing) that you need various sets of carefully spelled out rules. These will inevitably appear "legalistic" or "bureaucratic". We might attempt to cut down on this (in our new process) by no longer allowing open editing thereby giving a few individuals the power to make a more airy-fairy judgment on matters such as "empirical evidence that it works, and people are generally using it correctly"
- But in the meantime we have a process in place which allows open editing and therefore has some legalistic/bureaucratic rules and steps, including a step which gives the go-ahead / the permission / the mandate to add a tag onto Map Features. This should be followed and respected until such time as the process is changed/replaced (which may be fairly soon if we can make some progress re the above discussions)
- -- Harry Wood 10:47, 5 December 2008 (UTC)
- I'm kind of tired of this discussion, but hey it's the weekend! and I have plans which don't involve repeating myself here, so I'll be back on Monday to see if any other conclusions have been reached. I was also just looking on the mailing list thread, and I'll check there again on Monday too. The email discussion seems to keep flipping back over to specifics of the smoothness tag, which I think is not helpful in trying to resolve this. I mean obviously it would be helpful if everyone came to some happy agreement about that tag, but assuming that isn't going to happen...
- I would like a clearer view of how the wider community feels about the existing tag documenting process (our approach for controlling edits of Map Features). If we ask the straightforward question... Should we (A) abandon the existing process and leave people to do what they like on the Map Features page, or (B) follow the existing process while we come up with something better?.... I'm assuming option B would be favored, even amongst those who really don't like the existing process as it is documented here. In that sense I think you don't have support of the wider community.
- The trouble is people will voice opinions on other aspects of this multifaceted debate. They will voice their support of your view of smoothness and support your view of the process as well as suggesting alternatives. That may make it look like you have strong support, but do people really support your recent behavior on the wiki? or should the existing process be enforced while we come up with something better?
- -- Harry Wood 17:51, 5 December 2008 (UTC)
- Those options aren't the only ones open. (A) is a recipe for disaster, and (B) results in more damage being done to Map Features. I prefer "(C) suspend the process indefinitely until it's fixed" which limits the damage and provides some incentive for people to actually fix the process. As for my recent behaviour, I see no problem with reverting vandalism to Map Features, and will continue to do so as long as it continues. Chriscf 12:36, 9 December 2008 (UTC)
- It was not vandalism but different 'opinions' and your behaviour unilateraly reverting changes done by many others can be considered as vandalism. -- Pieren 12:47, 9 December 2008 (UTC)
- I do agree that much of the voting process has outlived its useful life. OSM is massively larger than it used to be. When I joined OSM, there were less than 4,500 users in total - with only around 200-250 actually contributing data to the map in any one month. A vote involving 15-20 people did represent quite a large proportion of data contributors. Now, OSM is pushing 80,000 users in total, with a peak of around 7,200 users contributing around August this year. A vote involving 15-20 people is only a very small proportion of those currently contributing. Many recent tags proposed, voted on and "approved" also seem to ignore tags already in use and used by various applications. We didn't have Tagwatch in 2006, but we do now - and we shouldn't ignore it. Personally, I am now of the opinion that Map Features should only display a "core" set of tags - perhaps only those which are supported by one of the main renderers. We can use Tagwatch to see if a certain set of tags are becoming more widely used - and make a judgement as to whether they should be incorporated into Mapnik or Osmarender (and hence onto Map Features). Surface or smoothness tags, whilst it's nice to have this sort of data, are not in my opinion in the same level as e.g. highway=* tags - which describe the basic fundamental data about an object. Richard B 13:14, 5 December 2008 (UTC)
About Smoothness. It seems to be a valid tag, passed voting and was discussed. Although, On the main map feature page, it should not have got its own section. This is where it went wrong. It should be listed in the properties section. It should be listed just as surface is listed. this is why I believe we should elect a team of users to check the approved feature list and have access to add and modify the main feature page. --Nickvet419 13:35, 5 December 2008 (UTC)
- Again, you seem to be under the misapprehension that "passed voting" means anything. Chriscf 12:36, 9 December 2008 (UTC)
- what it means and what you are missing is that a passed vote shows that a standard way of tagging has been agreed upon by a majority of users. Obviously this voting proccess is open to everyone and everyone has the right to vote. The vote does not mean that this is the only way a feature can be tagged. It also does not mean that the proposed tag cannot be used if the vote fails. Wen a standard tag is agreed upon and yes.. passed with a vote, the tag can then be moved onto the main feature page. Thus, the main feature page is then a record of standard tags that a majority of users agree upon. Thus, making it easier for rederers to creat the map without having to render 15 diferent sets of tags. Do you understand this? although, If someone should happen to put something on the main feature page that has not been discussed, it should be removed until it has been agreed upon. If a key was placed in the wrong section, it should be moved to the correct section. If a new section ie. waterway or cycleway should be desired, this should also have to go though a vote. So, anything else?--Nickvet419 14:24, 9 December 2008 (UTC)
- It means nothing of the sort. The voting is irrelevant, the discussion is everything. The outcome of the discussion was that important objections (subjectivity, not intuitive, inconsistent, etc.) were not addressed. The outcome of the vote differed from that of the arguments weighed in the discussion - if in doubt, the vote is secondary. We don't pass bad tags just because people voted for it. No amount of whining can change this. Chriscf 10:30, 10 December 2008 (UTC)
- So how do you propose we change the approval proccess? how do we agree on a standard way of tagging a feature? Right now we have it as such. Create a proposal, discuss the proposal, edit the proposal to meet everyones input, Vote to see if see if the majority aggrees on the standard tag, If rejected, continue working on the proposal, if passed, archive proposal, create feature page, and add to main feature page. This proccess should take about 3-4 weeks to complete. Only things I suggest we add is that a passed vote does not have a major argument. We could create a list of major arguments that could cause a vote to not pass until review. Also, I suggest we elect a team to have control over the main feature page that can properly add new standard tags that have passed the proposal proccess. --Nickvet419 12:23, 10 December 2008 (UTC)
- Heres an example of a major argument... in the case of Proposed features/Bench there is a major agument that bench=permanent be changed to permanent=yes. This would halt the approved status of this proposal. bench=permanent could simply be removed from the proposal and the proposal could then be set to an approved status. bench=permanent or permanent=yes could then be made into a new proposal, where it could be discussed further.--Nickvet419 12:38, 10 December 2008 (UTC)
- "How do we agree on a standard way of tagging a feature?" First we find the feature (in this case, "here is a bench"). Then we look at how to tag it (in this case, someone suggests amenity=bench, with little disagreement). Then we see whether it's working in practice (in this case, there are lots of uses already, none of which are causing any problems). That's it. This is how people have been tagging most new features in this time, and - what do you know - it seems to work. There's nothing wrong with a straw poll, but it's not the be-all-and-end-all. If a proposal is rejected, it should probably be on the basis that the community feels it's not a good idea. Something that is merely a poor implementation of a good idea may well evolve. Rejection should be fatal, so there should be some care in deciding whether something has actually been rejected. Electing a team is yet another unnecessary step of bureaucracy which might well turn us into an online Ordnance Survey, which isn't what we want. Chriscf 15:50, 10 December 2008 (UTC)
- in essence, the voting proccess is a straw poll... Just to see if we agree on the finished proposal for a standard tag. Yes, the discussion should be the main focus of the proposal, and tags in use should be brought to the table to check if they work well. The main porpose here is to get everyone one the same page for tagging a feature. This way we don't have 15 different tags for the same feature. A rejected vote says we do not agree and we should continue working on it until we agree. A agreed vote says we agree that this should be the standard way to tag this feature. So we are arguing the same point here, but we need a way to show that we agree that this is a good standard way of tagging. This is why there is a vote. --Nickvet419 14:17, 11 December 2008 (UTC)
- Now here is a problem we need to work out in the proccess of proposals. the bench proposal. wee seem to agree on amenity=bench but we do not agree on bench=permanent. If one passes the other passes??? this does not work. I do think for ever tag there should be a poll or vote. that way amenity=bench can be agreed upon sepratly from bench=permanent. The committy would only check to see if the tags are properly being voted on and add them to the main feature page, this way there is no vandalism problems. I am not saying they get overall say if a feature is accepted or rejected. --Nickvet419 14:17, 11 December 2008 (UTC)
Proposal process debate ongoing
There was another big mailing list discussion about this, kicking off with this post by Frederick Ramm. Mostly not terribly constructive, but reinforcing the point that this is a divisive issue.
Ideas of a separate off-wiki web-app to replace wiki approaches, resulted in a wiki page Featurama to discuss them. All very well, but it might just end up being a less flexible platform for the same old debates. Richard put forward some new ideas on how a new technical solution might look, codenamed Tags I Use.
User:Pieren made a very practical suggestion [3] of applying some rewording across the wiki:
- replace "vote" by "opinion poll"
- replace "I approve"/"I oppose" by "I like it"/"I don't like it"
- replace "approved" feature status by "
valuable" "recommended"
As I said, it will take quite a few hours of wiki fiddling to swap all mention of "approved" for "recommended" though. Is it worth doing?
I don't think it will solve the problem completely, because people will still see it for what it is, a vote on whether a tagging idea gets to be put on "Map Features", but the rewording might help make people see it as more of a process of gaining community acceptance rather than just winning a vote.
-- Harry Wood 14:41, 2 February 2009 (UTC)
I was trying to figure out how to propose shop=pet and tourism=aquarium and blundered tragically into this morass of a talk page. So, since i'm here, anyway: I find the present categories of rejected/accepted/proposed/draft/whoknowswhatelso features very confusing. That is compounded by e.g. features in the obsolete/rejected category that seem reasonable and have no obvious objections on the page, and by features listed on what i had expected initially was the canonical (as much as such a thing is possible in a wiki) reference (Map_Features) that show up in the obsolete/rejected list (i just removed it: shop=chemist). I'm all in favor of a separate way to manage the proposal process if it simplifies and streamlines the process. I suspect most of the problems with people not updating proposal status is due to the complexity and confusion about how to do so.--Pouletic 15:02, 26 March 2009 (UTC)
- It's not that complicated, Your proposal goes through draft->proposed->voting->accepted/rejected. If the problem your proposal tried to solve is solved by something else, it is obsoleted. If there is no interest in your proposal for too long, it's abandoned.
- The existing chaos, imo, mainly results from the need to update several pages manually, which clearly should be replaced by automatically generating the tables from the template on the proposal page itself. --Tordanik 15:42, 26 March 2009 (UTC)
- There are ways of generating tables, but this wiki does not have the addons installed. This is one reason I created the proposal template which automaticly links to a catagory. This way you only need to change the status. I had asked the Wiki admins to install the addon a few times but nothing was ever done so for now we are stuck with at least catagories and the self edit lists as the proposal preview. I also wanted to create a form to fill out that would auto generate a proposal page, But yet another addon that needed to be installed. --Nickvet419
05:31, 22 October 2010 (BST)
Post-vote clean up process needs extending?
For "changed" tags, should it not mention raising trac tickets for all editors that are using any old variations of a tag (I'm thinking for example of amenity=dentist which had an approved healthcare=dentist as of last month), all renderers who render the old tag, and also getting in touch with one of the many bot authors to go through and replace all of the existing usage of the old one with the new. Oh, and when there's only been just over 15 votes, perhaps contact all the existing mappers who will carry on using what they know? --EdLoach 16:41, 22 September 2009 (UTC)
Yes and no. It is something that would help but it is not exactly part of the proposal process. The proposal process is to simply help mappers come to consensus on how to tag a particular feature for rendering convenience. Propose/discuss/vote/document. Rendering is a totally different process and has its own forums/webpage to do so. bot editing is something that can be suggested, but should not be a standard practice. Here is how I would handle your question... On the accepted feature list page, create a link to a help pages on how to get your feature rendered or what to do if a tag is obsolete, there might be pages already created.--Nickvet419
05:47, 22 October 2010 (BST):15, 7 December 2009 (UTC)
- This would be possible, but should not go into the map. Instead this kind of information can be stored in a special cinema database, and be displayed on a layer in addition to the base map. See OpenLayers for examples how to do it. Lulu-Ann
- This is WAY too volatile information for OSM. Many services using OSM work with data that is up to a month old and saving the history of such objects would be a nightmare. I think it's okay to store a unique key to a large movie-datase in OSM but NOT the current time-table. --MarcusWolschon 12:24, 8 December 2009 (UTC)
- I agree. Sounds like a fun idea, but not a good thing to put into the OpenStreetMap tags. Instead you should run a separate database and simply correlate ids of the amenity=cinema OSM elements. -- Harry Wood 13:11, 8 December 2009 (UTC)
This wouldn't be just for Cinemas, but for:
- Museums
- Music venues
- Art galleries
- Theatres
- Nightclubs
- Sport venues etc.
In other words, anything that would be in a Listings publication.
What people are suggesting is a separate database to OSM, where each OSM location with time/date information has its own records. RealTimeOpenListings maybe? Has anyone else ever tried this? Listings appear to be one of the last things which have not been powered by collaborative 'crowd-sourcing'.
I guess the tag on OSM could be:
rtol=boolean (yes/no)
..which would let the OSM map-view know that the location has time/date information on RTOL.
--Cali 14:58, 8 December 2009 (UTC)
Different fuel sorts / kinds
We have amenity=fuel. But I think the KIND of fuel that is offered is also important. Things like "Biogas", "Electricity" and others need to be tagged aswell. This sets us apart from Google Maps that doesen't offer that feature at all!
--pr0wl 02:25, 11 January 2010 (UTC)
- Take a look at the Tag:amenity=fuel page, which gives a proposed tagging scheme for fuel types (Key:fuel) -- Harry Wood 12:04, 11 January 2010 (UTC)
Proposed features process: Rejection at draft and proposed
I'm suggesting that an improvement to the process is needed. If a redundant map feature is proposed (in state draft or proposed), then in some cases it should go directly to 'Rejected' state if consensus is achieved. For example if five (5) people fully agree (without objections) that the map feature is redundant, then the map feature goes into 'rejected' state.
This way we are able to clean away "trash" faster. As the map features evolve it will become more and more likely that someone propose something that already exist. --Kslotte 12:19, 11 February 2010 (UTC)
- No, this would work most of the time, but there are features that already have a tag, but there is a better way of tagging. Possibly not the tag itself but also some discriptive tags used in combination. Although it is possible to cancle a proposal if it is reduntant where there are no changes/additions to a tag.--Nickvet419
05:59, 22 October 2010 (BST)
RFC: Link to mailing list archive in Proposal
Hi,
I would like to see the link to the talk mailing list archive in the proposal. This will help to bring wiki users and mailing list users together in better dialog.
I would like to add:
Put the link to the RFC-Email in the talk mailing list archive on the proposal page
Maybe we can add it to the proposal template ?
- I agree that it would be a good idea to add links to other communication channels to proposal pages.
- However, this isn't usually limited to talk ML - while that's the one channel mentioned on Proposed features, it also makes sense to publish a proposal on the forum and maybe international mailing lists, and links to these would be useful, too. Is a template-based solution flexible enough to handle this? I'd expect it would be easier to add a list of links to the usual "Comments"/"Discussion" section of the proposal. --Tordanik 14:04, 16 February 2010 (UTC)
- I disagree to have a list of 5-7 places where a proposal is discussed. The discussion must be on the discussion page. I want to add the link to the talk mailing list, because many mailing list users are to stubborn and don't accept that. (Or to stupid to put wiki pages to their watchlist and activate the email notification? I don't know!) I do not want to have even more places where pieces of discussion must be searched for. Note that each place (Wiki, mailing list, forum) usually needs a new login registration. This does not make it easy for new users to find the needed information. Lulu-Ann
- I agreed that a link from the wiki to the mailing list archive makes sense. I see that mainly being valuable as a proof that this has been done (and clearly forcing proposers to go through that step). The intention would not be to direct discussion traffic at other channels, but to prove that other channels have been directed at the wiki proposal.
- According to the steps outlined at: Proposed features#Proposed, it's the 'tagging' mailing list you're supposed to post to. Are people using that?
- Don't really see the harm in linking to a forum post too. Could be good forum enthusiasts picked up on new proposals and made forum posts about them, but the wording of the forum post should be to send people to the wiki to make their comments.
- -- Harry Wood 13:24, 17 February 2010 (UTC)
Question about abandoned status
"Any proposals that have a 3 month inactive history should be set to "Abandoned"" - Does this rule apply to all proposals (even the drafts) or only to the ones that are in a "voting" status? --Gwilbor 09:57, 10 March 2010 (UTC)
- This applies to all proposals still in the process. This rule was made only to clear up the list so we can focus on active proposals being worked on. If there was a vote done, the status should be changed appropriately, if the vote was inconclusive, a new RFV should be sent out to the mailing list. --Nickvet419
06:08, 22 October 2010 (BST)
Cleanup Request
Hi, this page has a lot of waste proposals that are no longer maintained. To help the users we should reconsider the layout and parts (e.g. where to add a proposal introducing a new namespace?). To reach this aim we have to discuss the proposal process with the whole community --!i! 15:41, 11 August 2010 (BST):
- should it be tolerated that non proposed features get added to Map features?
- should there be a timeout for the single steps within the proposal process, when the proposal gets inactive and archived?
- should there be a min count of users to make a vote 'valid'?
- should a proposal allways be rejected for small issues(e.g. amenity key instead of a specialised another one) or can it be corrected immeadidly?
- what better sollution to prevent conflicts between 2 proposals?
- should there be a team watching at the whole proposal process?
- How can we making migration from old to new tagging schemes more easier?
- can we create templates that simplify the voting? (thumbup/down and a template that counts the ratio and summarizes)
- can we provide better templates to help the users contributing/thinking on enough details?
- I don't think the current voting process can be improved/fixed, it might have once worked when there were less mappers, but both the number of user accounts and active mappers has increased considerably yet fewer people are voting. As for preventing duplicate proposals, why not setup a working group to evaluate proposals, they don't necessarily get final say but they could be used to filter things a little. -- JohnSmith 11:04, 12 August 2010 (BST)
- My opinion: Everyone may use their own tags, the wiki is only to find some guidelines. So if a person 'creates' a new tag, he should place it immediatly on the wiki to explain what is meand. I believe it would be best to have no voting when a tag is added. Discussion about the tag should happen at the talk page and there should be a central page to ask the deletion of a tag (e.g. when it's a duplicate or it makes no sense). I think my opinion supports the "wiki is only a guideline" note many give and may lead to a better wiki. Some remarks:
- if a tag is new, you can add a {{new feature}} template, so all the new tags can be found and improved by wiki workers while mappers can find them and use them (with a little warning).
- if a tag is still incomplete, add a {{incomplete feature}} template which warns users but says they can use it if they want to.
- there should be a wiki beginners guide on how to add your own tags.
- That's only my opinion, I have this opinion cause if I want to tag something, I always look in the wiki and I sometimes have to use proposed features so to mappers it should not make that big difference if a feature is proposed or accepted (it's a thin line for many tags). Hope you understand it, Sanderd17 11:50, 12 August 2010 (BST)
- I lightly agree with you.. All tags used on the map should have a wiki page, if accepted or not. It would be nice if that process could be auto generated and somehow linked within the map editor. The only reason for the proposal process is to come to a consensus on how a feature should be tagged so that renderers don't have to create 100 rendering rules for one feature. It is also nice to have a proposal page to discuss new ideas, and work out all the issues before making a feature/key/tag page. That is also why I made the rule in the post-vote to link back to the proposal page so you can view the debate on why users agreed to tag a feature in that particular way. --Nickvet419
06:34, 22 October 2010 (BST)
- My comments:
- on Map Features, I expect
- tags that are widely used by applications and mappers alike, even if they haven't been part of an "accepted" proposal
- tags that are moderately widely used, but also considered a good idea by many contributors (as demonstrated by, for example, a wiki vote)
- a proposal shouldn't ever get archived if there is no alternative for tagging that object and there is actual interest in mapping the object (as demonstrated by tagwatch/tagstats). If it has been superseded by an alternative proposal or no one really wants to map that kind of object in the first place, it can be archived after some time.
- actually, it's more important that there should be a min number of users before a proposal can truly be considered accepted. As for votes, I don't see a reason to change the 8/15 minimum guideline.
- corrections to a proposal or similar shortcuts to avoid unnecessary bureaucratic efforts are fine if people agree that they are. Use common sense, no need to write this down.
- talk with each other. In most situations, there shouldn't be any irresolvable conflicts. If you really cannot find consensus, wait some time and see which method of tagging becomes more popular.
- Don't see a reason for setting up that kind of team, unless you want to . Which leads to ...
- making migration easy would require some authority to define that tagging A is now "wrong" tagging B is "right". So, unless you can convince people to accept someone's authority in this matter, migration will always be a slow process.
- if there would be a tool to change tags from one word to another (for complete duplicate tags), migration should go faster. Off cource that tool would only be availiable for senior members (1+ years or so and active in the past weeks). This would help with semi-duplicate tags (like highway=minor).--Sanderd17 17:08, 23 August 2010 (BST)
- Voting is easy enough, imo.
- Don't see a problem with current templates. Some may be a bit too restrictive (because they don't hide fields that have not been used and those fields are not appropriate for all proposals).
- --Tordanik 20:08, 12 August 2010 (BST)
- On Mailinglists there was the idea for a Feature garage to act as some kind of incubator for feature ideas/documentation that doesn't want a vote. Might this assist the process? --!i! 19:33, 19 August 2010 (BST)
- IMO we need to distinguish between tags that have been formally approved in some way, whether here on the wiki, in a mailing list discussion, from tags that have been documented from personal use or from wide use. The
{{No proposal}}is one step in that direction, though maybe we should allow links to discussions be more visible also. IMO it is irrelevant how a tag have been created, as long as it is documented properly. It might be enough to make a note such as Not formally proposed, but is a logical tag similar to xxx=yyy. A well documented tag is more likely to be of wide use than a poorly documented tag, even if it is approved by wiki vote. --Skippern 16:41, 28 August 2010 (BST)
I don't know how many of these there are on the page, but if I click, for example, on the proposed feature shop=beauty, it redirects to a feature page for this tag. I am guessing it has been approved. Should I then take it upon myself to remove it from the Proposed features, or will someone else do that, or are proposals meant to stay forever on the page for reference? --ponzu 11:41, 15 February 2011 (PST)
- As written at paragraphe below, the most of us decided not to work on any tagging related pages for now, cause there is a poisoned feeling in the community. We will proceed on the things at Wikiproject Cleanup and if we succeed with this one, I guess than there is a better ground to work on the tagging topic again --!i!
21:20, 15 February 2011 (UTC)
Features that hasn't gone through the proposal process
It exist several map features that hasn't gone through the proposal process and their usage is minor. Here are a few: Tag:shop=copyshop, Tag:shop=erotic, Tag:shop=dive, Tag:shop=furnace, Tag:shop=deli, Tag:shop=mobile phone, Tag:shop=bed, Tag:shop=variety store, Tag:emergency=fire extinguisher, Key:office, Tag:shop=musical instrument, Tag:shop=frame, Tag:shop=funeral directors, Tag:shop=hearing aids, Tag:highway=give_way.
What should we do with these? A "no proposal" template has been placed on these, but has been reverted (several times) without reasons by user JohnSmith. --Kslotte 15:19, 28 August 2010 (BST)
- Personaly I think some are ok and "simple" enough to not to provoke conflicts e.g. shop=erotic. Others are to specific in my opinion and need a review for a more abstract design e.g. shop=frame. But it's not on me to decide this but on the community.
Therefore I'd like to initiate the improvement of the proposal process (see topic above). --!i! 15:59, 28 August 2010 (BST)
- JohnSmith is just a troublemaker. He does what he want without any respect to others, undoing/moving pages without general consensus etc. Don't rely on his edits. --Scai 16:21, 28 August 2010 (BST)
- Might be or not, I think a wiki is living if everybody can go on to improve it. Neverthelless I wouldn't call this behavior gentle...and in the end all is basing on the respect of others work. --!i! 20:12, 28 August 2010 (BST)
- I tried to relabeled the items but it got reverted from John and he point's out that he will revert it again cause it's some kind of defacing to him. If we doesn't like his approaches we can make better ideas cause this documented tags were already discussed on tagging mailing list --!i! 07:02, 29 August 2010 (BST)
- In case you guys missed it, proposals are supposed to be made and then go through the tagging list, you guys can't just pick and choose rules to honour just to suit yourselves, and then whine about others doing the same... --JohnSmith 07:20, 29 August 2010 (BST)
- It's not on us John. We try to get a better concept for the Map features list. We try to understand your point...but actually you don't say why it is wrong to label your pages :(
- OSM is no kind of battlefield or a place to propagate just one single point of view (wether our neither yours) but this becomes offtopic... --!i! 09:02, 29 August 2010 (BST)
- There should be nothing wrong with having any new tag described at Tag:key=value (or Key:key). Even if it's an obvious mistake - in other words, it's used only few times at most, or by a single contributor, and there is a more widely used alternative - it ought to be linked to the "better" tag and the reason documented. When there isn't a better/recognized tag and no proposal exists, wouldn't a category suffice? Category:Unproposed_features and Category:Features_accepted_by_use (a better word?)
- Personally, I find the template box too prominent; it's not a problem with the tag description page, but rather a problem with the Map features template for that key if it includes values that aren't yet popular. Only the tags that have gone through the proposal process might be added without (yet) being used that much. - Alv 15:08, 29 August 2010 (BST)
- Hey everyone... I saw this new template pop up. A no proposal template on a page gives false pretenses that every tag has to go though a proposal process which is not correct. Standard practices suggest you make a proposal before creating a feature page, but a proposal is not needed. Every tag being used on the map should have a wiki page to describe how it is being used. It just helps to get a consensus on how a feature should be tagged, not how it is being already tagged. The process also gives users a forum to discuss and argue the best way to tag a feature without cluttering the feature page itself. I would recommend using a category instead of a template to document features that did not go though a proposal process. Any tag that did go though the process should have a link back to the proposal so users can see why it is the best tagging practice.--Nickvet419
07:01, 22 October 2010 (BST)
- I got kind of burned out with these process discussions about a year ago. Back then there was particularly a lot of backlash against the idea of voting on tags, and that seems to have led to people giving up on following processes altogether. The thing to remember is that there will always be a lot of people who don't like rules and processes. And then there's also a lot of people who are forthrightly opinionated but in a very unhelpful self-contradictory way. On the one hand they complain that the tags documentation is sucky and people are adding stupid tags all the time, and then almost in the same breath they complain that they don't want stupid tag proposal processes. They seem to fail to take a step back and realise the self-contradiction. Essentially it's just lots of people of who find it easy to complain about things, but hard work to actually help improve the tag documentation
- So these days the suggestion seems to be that people are welcome to add new tag documentation (a new page with 'Tag:' prefix) without creating a proposal. Alv and Nickvet419 have said that here, but I know that this is also reflecting the current thinking of a lot of the community.
- I don't understand it though. How does that help us raise the standard of tag documentation?
- -- Harry Wood 01:34, 24 October 2010 (BST)
- Hey Harry Wood, I also got burned out for similar reasons. I spent a lot of time trying to streamline the proposal process to help make it simple, more fun, and actually constructive. To answer your question... The proposal process as you know is to, yes, raise the standards of tag documentation, and to get a consensus among users on the best practices to tag a specific feature. There are still some technical faults with the "process". Not everyone knows Wiki, so it can be difficult to create a proposal and get it listed. Although clearly listed, there are still multiple steps you need to do to create a proposal, discuss it, get it voted on, and even then you may have to start over from scratch. The length it take to create a proposal to the time it gets accepted, you could probably tag 1000 features or more. So therefore if a tag seems appropriate to some one and they don't know how, or want to spend the extra time, they will simply skip the proposal process altogether.
- On the other hand we want every tag to be documented in some way, preferably in a standard format, and in a way the majority can agree on. If a tag is used, we want to know why and how it was used and if wee should use it in the same way. Therefor the proposal process is not a mandatory step in creating a new tag, but recommended to be able to get community input and approval. The Proposal process is a great way to get that done, because it gives that forum to discuss that feature and work out the errors before it goes into the mainstream.
- So here is what I recommend we do. For now, Leave the Proposal process as is. It is doing what it is intended for "Helping create higher standard of feature pages, quality tags, and a forum to fully discuss the best practice to tag a specific feature." We need a new page to clarify what to do when creating a new tag/key/relation. What is needed when documenting a new tag? What are other steps you can take to improve the quality of the tag? Ex. Put the tag though the proposal process.
- In addition, instead of "marking" what tags have not gone though the proposal process, Let create a template that shows a tag did go though the process and that the community has agreed on a standard tag for that particular feature. We can call it "Blue Ribbon features". This way, when someone is searching the wiki for a tag, and sees the "blue ribbon" They know that the community agrees that it is a standard practice though the proposal process. Unless not already on the approved feature list, or part of the drop-down in the map editor, all new features/tags need to go though the process to receive the blue ribbon. --Nickvet419
04:21, 24 October 2010 (BST)
Blue Ribbon Features
Started in the last topic, I have proposed a new way of marking features that have gone though and accepted in the proposal process. It is called, Blue Ribbon features. This is intended to be a template to be placed on accepted feature pages. The main focus of the blue ribbon is to show that the community has discussed and agreed how to tag a spicific feature on OSM. Since all tags should be documented on how and why they are beaing used, this wil be a way to promote the proposal process. This will not only help get users to document their new tags, but also put them though the proposal process so that the communnity can best decide the standard and best way to tag a spacific feature. Features to be included:
- All accepted proposal features.
- All features listed on the Map Features page.
- All features currently on the drop-down list in the map editor.
--Nickvet419
05:06, 24 October 2010 (BST)
- I like the idea. But we should set a few requirements to get this flag? I had the opposite approach with Template:No proposal that failed. I guess it's a better way to say that people doing a good job (like with Awards) instead of telling they are doing something wrong....
So what does you say, is it focused on widespread features that are well known in any kind and supported by the editors presets? Or is the focus that they had been proposed? A lot of old stuff didn't run through the formal process :/ --!i!
17:51, 6 November 2010 (UTC)
- The main focus would be a way to mark the well documented and widely used features/tags. We also want to promote the proposal process as a way to get that quality assurance by the user community. So, I would say to start out with the widely used tags that are on the map features page and the tages used in the main editor. Then move onto the successful proposals. A big problem between the map editor and the Wiki, is that not all tags have a wiki page to document them. When I see a tag dog=maybe on the editor, I'd like to know why it is there, what does it mean. The "Blue Ribbon" tells me this tag is widely used and accepted by the community. That the tag was not just randomly created, but also deemed the best way to tag this feature. --Nickvet419
19:24, 6 November 2010 (UTC)
- I agree with you. But you have to keep in mind that the current proposal process is dammed. A lot of people abandon it, because they say a vote of 10 people is nothing. I agree at this problem but there has to be a improvement but I have no idea how. Did you already got feedback on the talk and/or tagging mailing list? --!i!
20:35, 6 November 2010 (UTC)
- no real feedback besides people saying they like the idea. I think everyone agrees that the voting part of the proposal process is flawed, but the process itself is beneficial to creating good documentation, creating tags that work well with others, and getting support from the community to use the tag as mainstream. The vote part says (yes/no) that the tag meets these criteria and that the tag is a good/safe tag to use, the best way to tag a feature. If we could simply change the terminology to reflect that, it would be much better than to dismiss the proposal process. Because the proposal process is such a useful tool to help meet "Blue Ribbon" standards, I think it should be part of marking features with the blue ribbon. Features already on the main feature list mostly already meet the standards of good documentation and acceptance by the user community, so they do not need to go though the proposal process.--Nickvet419
21:03, 6 November 2010 (UTC)
Change Voting terminology
I think everyone somewhat agrees there are issues with the "Voting" section of the proposal process. Because of this I think there is a need to change the terminology "Voting" "Yes" "No" "majority" to something else. The purpose of voting is simply this... To agree that the tag/feature is well defined, there are no conflicts with other tags, the proposal process is complete, and the feature/tag can be pushed into the mainstream with complete documentation. If we can find better terminology to support this instead of the ones currently used and argued about that would be great. Any suggestions?--Nickvet419
21:14, 6 November 2010 (UTC)
- I do not agree to your view. Your requirements are not sufficient. You are missing "The proposed tag is the best solution for all current and future usecases, it is sustainable." and "It is correct spelling" and "It is easy to remember also for non native speakers" and "It will not cause any inconsistencies." and "It is the easiest way to install all aquired advantages from this proposal" and "It is not foreseen that the proposed tagging will have to be changed manually when more OSM detail data is stored in the future.". And, give me some time, I will find more requirements for a optimal proposal. Often I vote no because only one of these requirements is not met. We don't want any working data model, we want the optimal one. --Lulu-Ann 13:29, 16 November 2010 (UTC)
- Well I guess we all agree that we can*t get an optimal solution just within one single step. But we can get one on a evolution. But this evolution should be managed or assisted in a good way, right? --!i!
13:57, 16 November 2010 (UTC)
- Sorry, I disagree again. I am a database developer. My customers would not give me work again if I would not be able to find the optimal solution in one step (including long discussions). Taking several steps always means doing many manual changes to data, which is a hazard. What's wrong with doing it right? --Lulu-Ann 14:26, 16 November 2010 (UTC)
Tagging of fruit trees and edible plants
Hi there, I have a great vision of a new category or key in OpenStreetMaps: A key for edible and wild growing plants and fruits that are available for free. This would be an equivalent to an existing project based on- but not yet integrated into osm. This is the project i'm inspired by and whose functionality i would love to fully integrate into osm:
With this project, you can tag and find fruit trees, mushroom places, nut trees and herbs which are growing at a certain place and which can be taken for free. I suggest this, because I find it extremely useful especially for backpackers and hikers travelling in a foreign country. With the key "edible" (or anything this way) people would be able to find points where they can access food for free. In my homecountry Germany and for sure everywhere in the world, trees are growing and produce tons and tons of fruits that end up unused and rotten. Maybe this project- this vision- this feature- will might make the world a slightly better place. =) What do you think? In my opinion, this should be a new key "edible" despite the existence of "natural". Justification: the value "tree" in key=natural is insufficiant. Also, it would be great to filter the "edible" POIs in apps like Osmand immediately. Last but not least, something important like food and other (free!) edibles deserve an important place in the osm project. --Ghostrider111 21 November 2014
- Hi and welcome to OSM! I think you are at the wrong place here. Please see Proposal process and create a proposal page where discussion about it can take place. However, it seems you are in an very early stage, I guess a post to our forum (if you like, there is also "Germany") may be the best to discuss and develop your idea. --Aseerel4c26 (talk) 02:41, 21 November 2014 (UTC)
- Thanks for your reply. I continued an ongoing discussion in the forum. If the community agrees, I will initiate a new proposal page. I'm excited what's going to happen with this vision. --Ghostrider111 21 November 2014
- Okay, I would suggest to continue the discussion there before you continue here. --Aseerel4c26 (talk) 13:33, 21 November 2014 (UTC)
Proposal page should encourage proper namespace usage
When someone is going to propose not a single tag, but the whole tagging scheme, as in case of ongoing Pipeline tagging proposal, it's really important to encourage people to use namespaces. It's also very important to use namespaces properly, instead of using it just as prefix for some of keys. I can try to compose short text about it and place it on this page, because, as I know, there is no place on Wiki, where it is explained somehow. --BushmanK (talk) 08:10, 13 December 2014 (UTC)
Please promote wiki pages instead of Taginfo for popular values
We should discourage not-English speaking world from Taginfo (and from using dictionaries and especially google translate as result of our recommendation), we should promote OSM wiki over "just watch taginfo"
Irrelevant to proposal process, but relevant for pages at wiki in languages other than English.
There is a lot of problems outside En community when it comes to OSM guideline "just watch taginfo for popular values". This works more or less for EN community, but users outside English-speaking world, do not get meaning correctly. I do Russian translation at wiki\ID\communicate with ru communite and many ru users do no realize that reading by letters in taginfo doesn't work without meaning of the word. Absurd, but it not written anywhere, instead we (English speaking world) promote "just watch taginfo". This is serious issue outside GB, USA, Canada, Australia. We have way more countries. Even more if we want to grow.
- Promote OSM wiki over taginfo across all non-english languages. Possibly it should be written as notice at main page or every single guide/content should be rewritten.
- Not Taginfo fault. Just add feature to Taginfo to directly show wiki-translated page based on "Accept-Language" header. Force this behavior by default for not-English languages. Yes, force displaying wiki pages parallel to tags, but let users switch language (and disable this feature).
- Everything for English-speaking world stays the same, since this is main language/tagging convention. Xxzme (talk) 00:53, 11 November 2014 (UTC)
Deprecated label
I created a draft of a deprecation label. It should support the display of deprecated features in parallel from the infobox. Please comment and help here: Talk:WikiProject_Cleanup#.22Deprecated.22_label
- Above was me... The label is ready for use! Template:Deprecated feature--Jojo4u (talk) 20:43, 2 August 2015 (UTC)
Resurrecting abandoned proposals?
If a proposal is abandoned, is there any way it might be brought back to attention or taken over by someone else? Or should a new, similar proposal be made by a new person? In particular I have the expressway indication proposal in mind, which I think would be a valuable addition to OSM for U.S. mapping to make it unambiguous whether a trunk road is a true expressway or simply a highly important road. While the person who proposed it is still an active editor of OSM, the proposal has not been touched in over six years, aside from being marked abandoned four years ago. Is there really anything that can be done about this? (EDIT: Spellign)
--Roadsguy (talk) 16:29, 22 December 2016 (UTC)
- there's no hard limit, the same person could in theory propose the almost same proposal as often as the others can bear with it ;-), although the general idea of the proposal process is to improve the definition by discussing it with others. In this particular case this is one of the hundreds of proposals a newbie set to abandoned in 2012. As this tag is already in use I have reverted the edit, so now the status is again "proposed", but you can consider changing this to "de facto" (maybe ask on the tagging mailing list before doing it). --Dieterdreist (talk) 20:07, 22 December 2016 (UTC)
Since the tag is already used fairly frequently, should I also suggest in the mailing list that I flesh out the expressway=* page itself in addition to marking it de facto, or should we only have the proposal page? --Roadsguy (talk) 20:29, 22 December 2016 (UTC)
- IMHO you can add as much as you can to the tag-page, as long as the people who have applied the expressway tag agree with it (what might not be easy to find out practically), i.e. it is desirable to have a definition there, but it should likely start with what the proposal says, because that's the basis for the tag. Please also keep a link to the proposal. --Dieterdreist (talk) 21:21, 22 December 2016 (UTC) | http://wiki.openstreetmap.org/wiki/Talk:Proposed_map_features | CC-MAIN-2017-43 | refinedweb | 16,675 | 68.6 |
A Microsoft developer evangelist has posted links to a series of Microsoft guides for porting existing mobile apps from other platforms, including the iPad, to Windows 8. These guides should be interesting to any developer thinking about, or examining, Microsoft’s platform of the future.
“Developers are excited about Metro app development, but say that the hardest part is coming up with an app idea,” Microsoft’s Jennifer Marsman writes in her MSDN blog. “Some folks want to walk through converting an existing app to Metro as a learning exercise. There are other folks who have very successful websites or apps that they would like to make available on Windows 8 too.”
Marsman offers up the following resources:
Design-focused articles
Porting an iPad app to a Metro app – Focused on design, this article explains how to transition between the iPad and Metro user experiences.
Rethinking a web site as a Metro app – This article is also focused on design, but shows the process of redesigning a web site as a Metro app.
Porting a web site
Migrating a web app to Metro app – This one is focused on the development and conversion of a web app to a Metro app using HTML and JavaScript.
Migrating a web site to Metro app – Another short article, this one discusses issues you’ll run into around communication, streaming, security, client package deployment, data sharing, and syndication while migrating a web site to Metro.
Porting a Windows Phone app
Migrating a Windows Phone 7 app to XAML Metro app – This article examines how one can port a Silverlight Windows Phone 7 app to a Metro app that is written with XAML. It discusses the differences between the WP7/Silverlight and Windows RT namespaces and provides a useful list of the differences in the UI capabilities of each.
Migrating a Windows Phone 7 app to JavaScript Metro app – This article examines porting a Windows Silverlight-based Phone 7 app to a Metro app that is written in HTML and JavaScript.
Good stuff. I’ve been examining Windows 8/Windows RT/Metro software development lately myself and should have a useful high-level look at this stuff soon along with a related list of good resources for those who want to learn more. Speaking of which, if you have any excellent Windows 8 developer links you’d like to share, please do so. :) | https://www.itprotoday.com/windows-78/microsoft-posts-windows-8-app-porting-guides | CC-MAIN-2018-47 | refinedweb | 398 | 51.92 |
If you’ve ever written any Python at all, the chances are you’ve used iterators without even realising it. Writing your own and using them in your programs can provide significant performance improvements, particularly when handling large datasets or running in an environment with limited resources. They can also make your code more elegant and give you “Pythonic” bragging rights.
Here we’ll walk through the details and show you how to roll your own, illustrating along the way just why they’re useful.
You’re probably familiar with looping over objects in Python using English-style syntax like this:
people = [['Sam', 19], ['Laura', 34], ['Jona', 23]] for name, age in people: ... info_file = open('info.txt') for line in info_file: ... hundred_squares = [x**2 for x in range(100)] ", ".join(["Punctuated", "by", "commas"])
These kind of statements are possible due to the magic of iterators. To explain the benefits of being able to write your own iterators, we first need to dive into some details and de-mystify what’s actually going on.
Iterators and Iterables
Iterators and iterables are two different concepts. The definitions seem finickity, but they’re well worth understanding as they will make everything else much easier, particularly when we get to the fun of generators. Stay with us!
Iterators
An iterator is an object which represents a stream of data. More precisely, an object that has a
__next__ method. When you use a for-loop, list comprehension or anything else that iterates over an object, in the background the
__next__ method is being called on an iterator.
Ok, so let’s make an example. All we have to do is create a class which implements
__next__. Our iterator will just spit out multiples of a specified number.
class Multiple: def __init__(self, number): self.number = number self.counter = 0 def __next__(self): self.counter += 1 return self.number * self.counter if __name__ == '__main__': m = Multiple(463) print(next(m)) print(next(m)) print(next(m)) print(next(m))
When this code is run, it produces the following output:
$ python iterator_test.py 463 926 1389 1852
Let’s take a look at what’s going on. We made our own class and defined a
__next__ method, which returns a new iteration every time it’s called. An iterator always has to keep a record of where it is in the sequence, which we do using
self.counter. Instead of calling the object’s
__next__ method, we called
next on the object. This is the recommended way of doing things since it’s nicer to read as well as being more flexible.
Cool. But if we try to use this in a for-loop instead of calling
next manually, we’ll discover something’s amiss.
if __name__ == '__main__': for number in Multiple(463): print(number)
$ python iterator_test.py Traceback (most recent call last): File "iterator_test.py", line 11, in <module> for number in Multiple(463): TypeError: 'Multiple' object is not iterable
What? Not iterable? But it’s an iterator!
This is where the difference between iterators and iterables becomes apparent. The for loop we wrote above expected an iterable.
Iterables
An iterable is something which is able to iterate. In practice, an iterable is an object which has an
__iter__ method, which returns an iterator. This seems like a bit of a strange idea, but it does make for a lot of flexibility; let us explain why.
When
__iter__ is called on an object, it must return an iterator. That iterator can be an external object which can be re-used between different iterables, or the iterator could be
self. That’s right: an iterable can simply return itself as the iterator! This makes for an easy way to write a compact jack-of-all-trades class which does everything we need it to.
To clarify: strings, lists, files, and dictionaries are all examples of iterables. They are datatypes in their own right, but will all automatically play nicely if you try and loop over them in any way because they return an iterator on themselves.
With this in mind, let’s patch up our
Multiple example, by simply adding an
__iter__ method that returns
self.
class Multiple: def __init__(self, number): self.number = number self.counter = 0 def __iter__(self): return self def __next__(self): self.counter += 1 return self.number * self.counter if __name__ == '__main__': for number in Multiple(463): print(number)
It now runs as we would expect it to. It also goes on forever! We created an infinite iterator, since we didn’t specify any kind of maximum condition. This kind of behaviour is sometimes useful, but often our iterator will need to provide a finite amount of items before becoming exhausted. Here’s how we would implement a maximum limit:
class Multiple: def __init__(self, number, maximum): self.number = number self.maximum = maximum self.counter = 0 def __iter__(self): return self def __next__(self): self.counter += 1 value = self.number * self.counter if value > self.maximum: raise StopIteration else: return value if __name__ == '__main__': for number in Multiple(463, 3000): print(number)
To signal that our iterator has been exhausted, the defined protocol is to raise
StopIteration. Any construct which deals with iterators will be prepared for this, like the for loop in our example. When this is run, it correctly stops at the appropriate point.
$ python iterator_test.py 463 926 1389 1852 2315 2778
It’s good to be lazy
So why is it worthwhile to be able to write our own iterators?
Many programs have a need to iterate over a large list of generated data. The conventional way to do this would be to calculate the values for the list and populate it, then loop over the whole thing. However, if you’re dealing with big datasets, this can tie up a pretty sizeable chunk of memory.
As we’ve already seen, iterators can work on the principle of lazy evaluation: as you loop over an iterator, values are generated as required. In many situations, the simple choice to use an iterator or generator can markedly improve performance, and ensure that your program doesn’t bottleneck when used in the wild with bigger datasets or smaller memory than it was tested on.
Now that we’ve had a quick poke around under the hood and understand what’s going on, we can move onto a much cleaner and more abstracted way to work: generators.
Generators
You may have noticed that there’s a fair amount of boilerplate code in the example above. Generators make it far easier to build your own iterators. There’s no fussing around with
__iter__ and
__next__, and we don’t have to keep track of an internal state or worry about raising exceptions.
Let’s re-write our multiple-machine as a generator.
def multiple_gen(number, maximum): counter = 1 value = number * counter while value <= maximum: yield value counter += 1 value = number * counter if __name__ == '__main__': for number in multiple_gen(463, 3000): print(number)
Wow, that’s a lot shorter than our iterator example. The main thing to note is a new keyword:
yield.
yield is similar to
return, but instead of terminating the function, it simply pauses execution until another value is required. Pretty neat.
In most cases where you generate values, append them to a list and then return the whole list, you can simply
yield each value instead! It’s more readable, there’s less code, and it performs better in most cases.
With all this talk about performance, it’s time we put iterators to the test!
Here’s a really simple program comparing our multiple-machine from above with a ‘traditional’ list approach. We generate multiples of 463 up to 100,000,000,000 and time how long each strategy takes.
import time def multiple(number, maximum): counter = 1 multiple_list = [] value = number * counter while value <= maximum: multiple_list.append(value) value = number * counter counter += 1 return multiple_list def multiple_gen(number, maximum): counter = 1 value = number * counter while value <= maximum: yield value counter += 1 value = number * counter if __name__ == '__main__': MULTIPLE = 463 MAX = 100_000_000_000 start_time = time.time() for number in multiple_gen(MULTIPLE, MAX): pass print(f"Generator took {time.time() - start_time :.2f}s") start_time = time.time() for number in multiple(MULTIPLE, MAX): pass print(f"Normal list took {time.time() - start_time :.2f}s")
We ran this on a few different Linux and Windows boxes with various specs. On average, the generator approach was about three times faster, using barely any memory, whilst the normal list method quickly gobbled all the RAM and a decent chunk of swap as well. A few times we got a
MemoryError when the normal list approach was running on Windows.
Generator comprehensions
You might be familiar with list comprehensions: concise syntax for creating a list from an iterable. Here’s an example where we compute the cube of each number in a list.
nums = [2512, 37, 946, 522, 7984] cubes = [number**3 for number in nums]
It just so happens that we have a similar construct to create generators (officially called “generator expressions”, but they’re nearly identical to list comprehensions). It’s as easy as swapping
[] for
(). A quick session at a Python prompt confirms this.
>>> nums = [2512, 37, 946, 522, 7984] >>> cubes = [number**3 for number in nums] >>> type(cubes) <class 'list'> >>> cubes_gen = (number**3 for number in nums) >>> type(cubes_gen) <class 'generator'> >>>
Again, not likely to make much difference in the example above, but it’s a two-second change which does come in handy.
Summary
When you’re dealing with lots of data, it’s essential to be smart about how you use resources, and if you can process the data one item at a time, iterators and generators are just the ticket. A lot of the techniques we’ve talked about above are just common sense, but the fact that they are built into Python in a defined way is great. Once you dip your toe into iterators and generators, you’ll find yourself using them surprisingly often.
17 thoughts on “Learn To Loop The Python Way: Iterators And Generators Explained”
Looks like there is something wrong with these lines:
33: print(f”Generator took {time.time() – start_time :.2f}s”)
38: print(f”Normal list took {time.time() – start_time :.2f}s”)
Can’t find such syntax for print.
Those are f strings, introduced in Python 3.6
Thanks! Found out I have 3.5.
It’s called “format strings”, introduced in Python 3.6 IIRC.
Is there a reason you used the old-style class decleration in the examples?
For Athena’s sake, stop using Python 2 already. It’ll be EOL in less than a year and a half.
Hehe! I even did some QBasic programming today …
I like python, but I swear to god that half the problems with it stem from really crappy terminology.
Yes. Why use old terminology, when we can invent a new one and confuse people with jargon?
Because using common technolgy terms like ” master-slave” is considered hatespeech nowadays, so you have to find something that doesn’t offend the snowflake generation.
Boss-employee, with just the right amount of kneeling.
Cyk, the irony of you being easily offended about other people being easily offended…
Stop harassing me for harassing you. ;-)
What exactly do you mean? Itterators are such an old mechinsm even c++ make massive use of them.
Not a ha –
Oh wait… I’m still learning Python and this was interesting and useful!
Never mind… do please carry on.
This is only scratching the surface of generators. They also have two other properties, the send and return values. Generators can also receive values during their operation, this is the basis of asyncio.
Technically speaking comprehensions yield inside parenthesis, and the same thing would be return inside square brackets. Also it is worthwhile to make sure that iterator is all good iterable with functions __iter__, __next__, and so on and so forth. This is easy to understand, understandable, grasp the meaning to put into practical coding. Well, I would say ‘Disabled’ configuration settings can be more nerve-wracking situation! | https://hackaday.com/2018/09/19/learn-to-loop-the-python-way-iterators-and-generators-explained/ | CC-MAIN-2019-18 | refinedweb | 2,025 | 56.05 |
10 September 2008 07:57 [Source: ICIS news]
SHANGHAI (ICIS news)--China-based Shanxi Lanhua Clean Energy Co has begun commercial production at its newly-built 100,000 tonnes/year dimethyl ether (DME) unit, a company source said on Wednesday.
?xml:namespace>
Shanxi Lanhua has invested a total of yuan (CNY) 650m ($95m) to set up the DME plant and the 200,000 tonne/year methanol unit that broke ground in March last year, the source said. The methanol unit came on stream in June 2008.
Based on the company’s development blueprint, production capacities would be expanded to 1m tonnes/year for the DME unit and to 1.5m tonnes/year for the methanol plant.
“DME is known as the clean energy of 21st century, so it has a bright prospect,” the source said in Mandarin.
The company is a joint-venture company in the northern Chinese | http://www.icis.com/Articles/2008/09/10/9155169/shanxi-lanhua-starts-dme-commercial-production.html | CC-MAIN-2013-48 | refinedweb | 148 | 69.01 |
> In that particular case, replace automatic by implicit, and you got the > reason why it is not a good idea. > Maybe in your case the C habits clashes to the python habits. > You're right ! As a C developer, I appreciate to only include <string.h> to deal with strings, without wondering which other header provides size_t definition. > Talking about python, if the user needs to know about BBB, then it has > to import it, perdiod. If the user needs to know about many objects, > then it has to import them all, explicitly. Ok. If this is the Python way of coding, that's ok for me. I will stop now my quest for an automatic import and work like that. The most interesting solution I have found until now is using PyImport_AppendInittab() and PyEval_GetGlobals() functions. But this also brings lots of problems (mainly namespaces and unloading). Anyway, the time spent to look for a solution was a nice way to learn Python internals :) Cheers, | https://mail.python.org/pipermail/python-list/2010-March/572231.html | CC-MAIN-2014-15 | refinedweb | 165 | 73.47 |
Skip navigation links
java.lang.Object
oracle.iam.reconciliation.api.BatchAttributes
public class BatchAttributes
This is used to store all the attributes which are common for an event. The common argument it take are Profile name which is same as object name for which event has to be created. It also take finished as a boolean parameter which is used to determine if all the data for event creation is passed or expecting more child data.
public BatchAttributes(java.lang.String profileName, boolean finished, java.lang.String dateFormat)
public java.lang.String getProfileName()
public boolean isFinished()
public java.lang.String getDateFormat()
Skip navigation links | http://docs.oracle.com/cd/E28280_01/apirefs.1111/e17334/oracle/iam/reconciliation/api/BatchAttributes.html | CC-MAIN-2016-40 | refinedweb | 104 | 51.75 |
need
need i need a jsp coding based project plz help me
JSP
JSP i need coding for auto text and auto complete of my database for my JSP with out using plugin if any one know answer if any one know's coding for it give me some suggestion
need a jsp example - JSP-Servlet
need a jsp example I need a jsp example to send a voice message or a audio .wav file from my pc to a mobile phone
Need a JSP CODE
Need a JSP CODE *Hi I need JSP source code for selling products which are in database.. please can any one help me ..URGENT*
Thank You
need JSP Code.
need JSP Code. **Hi I need JSP code for selling Products which are in Database.
Please can any one help for this.URGENT...
Thank You..!
Abhije
Need some help urgently
Need some help urgently Can someone please help me with this below question. I need to write a class for this.
If you roll Y standard six-sided dice... number of possible combinations.
The actual question got some error. Its
JSP How to create CAPTCHA creation by using JSP?
I need an code for CAPTCHA creation by using JSP...
You can create a captcha validation using jsp. Have a look at the following tutorial:
Captcha Creation
Need the some guidence - Spring
Need the some guidence Hi,
MY name is pavan iam having mini projects in MCA these are the details
reg projects below
1.project name:identical project finder
description:
Develop s/w to identify identical projects
jsp
jsp Hi
in my dao class some exception is there then how can i display in jsp page
jsp
jsp In any jsp all implicit objects are available directly, in such a case why we need PageContext object again
JSP
JSP Consider that we need to have a text, combo, radio & checkbox in JSP page and the page data's are retrieved
Need E-Books - JSP-Servlet
Need E-Books Please i need a E-Book tutorial on PHP
please kindly send this to me
thanks
jsp
jsp Hi One Help...
I want to develop like that using jsp/javascript but nothing is striking in mind... Please give some suggestions to design first
Thanks in advance---- Vanchinathan
organization. OSCache has a set of JSP tags that make it easy to implement page caching in your JSP application.
Following are some Cache techniques...JSP how did you implement caching in jsp
OSCache
need advice - JSP-Interview Questions
need advice Hi.I m the only java developer in our company which has smaller IT rest 3 are .net developers. I am bit confused about how to integrate work with .net developers. Can I continue with java and still integrate Develop a JSP page (with some fields) with all the JSP tags with a
submit button.Make the JSP page to communicate with the database
...);
}
%>
JSP Tutorials
Coonection JSP with MYSQL
jsp
jsp sir i am trying to connect the jsp with oracle connectivity ,but i am facing some prblems please help me.
1)Import the packages:
<%@ page import="java.sql.*"%>
<%@ page import oracle.sql.*"%>
< how to calculate mark..using radio button?????? Hello,
Please specify some more details.
Thanks
need coding
need coding sir i need code for simple bank application in jsp please send it
sir i need the coding for simple bank application in jsp.
Please visit the following link:
Jsp Bank Application
Jsp help
Need help Dear sir, I have a problem. How to write JSP coding, if a user select a value from drop down list for example department, the another drop... using access database and jsp code.
Thank you
urgent need in two days - JSP-Servlet
the Given JSP Example Code-------------------------------Servletform.html<...(); } }} According to above-mentioned code, you need to create three
how to disable submit button in jsp using servlet when some condition is satisfied
how to disable submit button in jsp using servlet when some condition is satisfied how to disable submit button in jsp using servlet when some condition is satisfied
jsp - JSP-Servlet
jsp get post method What is the get post method in JSP? And when i need to call these methods
jsp - JSP-Servlet
jsp hi,
i need text to speech jsp code
Java Question Anyone need some HELP !!
Java Question Anyone need some HELP !! Create a file that contains your favorite movie quote. Use a text editor such as Notepad and save the file... of the two files.
Note: For the above code, you need POI api.
import
i need some help in understanding the following codes.thanks..
i need some help in understanding the following codes.thanks.. this code is to perform LocalColorHistogram.But i can't understand it
public Vector<Double> getFeatureVector(int[] inImg, int height, int width, int[] maskImg
PLZ Need some help JAVA...HELP !!
PLZ Need some help JAVA...HELP !! Create a class names Purchase Each purchase contains an invoice number, amount of sale and amount of sales tax. Include set methods for the invoice number and sale amount. Within the set
Free JSP Books
that use JSP is a powerful capability,
other times you would rather sacrifice some...Free JSP Books
Download the following JSP books
Pagination in jsp - JSP-Servlet
Pagination in jsp I need an example of pagination in JSP using display tag
jsp functions - JSP-Servlet
jsp functions hi,sir
i need a simple jsp program using page directive with session attribute Hi friend,
To get the solution of your problem visit this link....
jsp - : - JSP-Servlet
is invalid.
This is JSP page...;
}
}
Hi vasu
I am sending some link where you can...://
JSP Examples
: In this page you will learn about how to use JavaScript in JSP.
Some...JSP Examples
In this section we will discuss about the examples of JSP.
This section will help you create web applications using JSP. In this page
you
jsp - JSP visit to :
Thanks
Re:Need Help for Editable Display table - JSP-Servlet
Re:Need Help for Editable Display table Hi Genius
i need project
i need project can u send online shoppin project 2 my mailid.
Please visit the following links:
Struts2 Shopping cart
JSP-Servlet Shopping cart
JSP forwarding
JSP forwarding What is JSP forwarding?
Hi,
You can use the JSP forward tag for jsp forwarding. This will help you forward your request to some other page on the same server.
Here is the code for jsp forwarding
connection of jsp with mysql - JSP-Servlet
Example of connection between JSP and MYSQL Need an example of connection between JSP and MYSQL tag - JSP-Servlet
jsp tag
i am basic jsp learner,so i cann't understand th... stream.A custom action is invoked by using a custom tag in a JSP page.
A tag library is a collection of custom tags.
Some features of custom tags
how to divide 1 web page into some parts...
how to divide 1 web page into some parts... how to divide 1 web page into some parts...i know it using frames in html,bt how can we do it in jsp... with some example(with code plz) n output also to knw hw it works,if possible
servlet and jsp - JSP-Servlet
servlet and jsp can any one give me jsp-servlet related project-its... banking
or other type.
please post some link or source code .
Hi...://
Thanks | http://www.roseindia.net/tutorialhelp/comment/30136 | CC-MAIN-2014-52 | refinedweb | 1,235 | 72.05 |
Adding custom web analytics
The system allows you to track custom events as web analytics and display the results in reports. The following example logs a basic button click event, but you can use the same approach to implement tracking for any type of event on your website.
Logging the event
This example logs the event through a user control:
- Open your Kentico web project in Visual Studio.
- Create a New folder under the root named according to the code name of your site, e.g. CorporateSite (if it doesn't already exist).
- Create a Web User Control in the new folder named AnalyticsButton.ascx.
Add the following code to the control:
<asp:Button
The code inserts a standard Button control, which will be used to add hits to the custom statistic.
Switch to the code behind file of the control and modify it according to the following:
Note: The name of the class will be different according to the code name of your site.
using CMS.Membership; using CMS.SiteProvider; using CMS.WebAnalytics; public partial class CorporateSite_AnalyticsButton : System.Web.UI.UserControl { // Handler for the button's click event protected void btnLog_Click(object sender, EventArgs e) { // Gets the name of the current site string siteName = SiteContext.CurrentSiteName; // Checks if web analytics are enabled in the settings if (AnalyticsHelper.AnalyticsEnabled(siteName)) { // Adds a hit to a custom statistic HitLogProvider.LogHit("buttonclicked", siteName, null, MembershipContext.AuthenticatedUser.UserName, 0); } } })
- codeName - determines the code name of the custom statistic, buttonclicked in the case of this example. This name is also used in the code names of related reports.
- siteName - specifies the code name of the site for which the event is logged.
- culture - specifies the culture code under which the system logs the event.
- object.
- count - sets the amount of hits added to the statistic. This parameter is optional and the default value (1) is used if not specified.
- value - application.
Custom analytics do not automatically use JavaScript logging. If your website has JavaScript logging enabled, you may need to leverage JavaScript in the code to keep your custom statistics consistent with the default web analytics.
Integrating custom analytics into the website
Now you need to publish the user control on your website (this example uses the sample Corporate site).
- Log into the Kentico administration interface.
- Edit the Corporate site in the Pages application.
- Select the Home document in the content tree and switch to the Design tab.
- Add the User control web part to the Main zone zone.
- Type ~/CorporateSite/AnalyticsButton.ascx into the web part's User control virtual path property.
- The page now displays the custom button.
- View the live site version of the Home page and click the Add analytics hit button several times to add hits to the custom statistic.
- Try doing this while logged in under different user accounts.
There are also other ways to add custom web analytics functionality to the pages of your website. For example:
- You can implement the control as a custom web part, add it to your pages and configure it through the portal engine as necessary.
- If you are using the ASPX page template development model for your website, you can integrate the analytics logging code and any required interface elements directly into your page templates.
Using the Analytics custom statistics web part
If you wish to log a simple event when visitors access a specific page, you can do so without having to write any code using the Analytics custom statistics web part.
Once this web part is placed on a page, it automatically adds a hit to a custom statistic when the given page is viewed. You can specify the details of the statistic, such as its code name, the name of the related object or the hit value using the web part's properties. The web part automatically loads the site name and culture from the context of the page.
Creating reports for statistics
Before users can view the statistics of the button click event in the Web analytics application, you need to create reports for displaying the data of the custom statistic. Most statistics have five types of reports: hourly, daily, weekly, monthly and yearly.
- Open the Reporting application and select the Web Analytics category in the tree.
- The sub‑categories contain reports used by the default statistics such as page views, traffic sources, campaigns, etc.
Click ... next to the New report button above the tree and select New category in the menu.
Type Button clicks as the Category display name and click Save.
Create a daily report for the new statistic. Click New report and enter the following values:
Report display name: Button clicked - daily report
Report name: buttonclicked.dayreport
The names of the reports must use a specific format:
- <statistic code name>.hourreport
- <statistic code name>.dayreport
- <statistic code name>.weekreport
- <statistic code name>.monthreport
- <statistic code name>.yearreport
In this example, the code name of the custom statistic is buttonclicked, as defined above in the code of the user control.
- Click Save.
- Switch to the Parameters tab of the new report and use the New field button to create three essential parameters, which the web analytics use internally:
- Field name: FromDate
- Attribute type: Date and Time
Display attribute in the editing form: disabled
Click Save for every parameter before moving on to the next one.
- Column name: ToDate
- Attribute type: Date and Time
- Display.
- Column name: CodeName
- Attribute type: Text
- Attribute size: 20
- Default value: buttonclicked (the code name of the displayed statistic in general)
- Display attribute in the editing form: disabled
The system uses the CodeName parameter to identify from which statistic the report loads data. The value is usually not modified if the report is dedicated to a single statistic (like the one in this example).
Go to the General tab and click New in the Tables section below the layout editor. Fill in the table's properties as shown below:
Display name: Table
Code name: Table_ButtonClicked_Day
Enable export: true (checked)
Query:
SET @FromDate = dbo.Func_Analytics_DateTrim(@FromDate,'day'); SET @ToDate = dbo.Func_Analytics_EndDateTrim(@ToDate,'day'); SELECT StatisticsObjectName as 'User', SUM(HitsCount) as 'Hits' FROM Analytics_Statistics, Analytics_DayHits WHERE (StatisticsSiteID = @CMSContextCurrentSiteID) AND (StatisticsCode = @CodeName) AND (StatisticsID = HitsStatisticsID) AND (HitsStartTime >= @FromDate) AND (HitsEndTime <= @ToDate) GROUP BY StatisticsObjectName ORDER BY SUM(HitsCount) DESC
The new report is a daily report, so the data of the table is retrieved from the Analytics_DayHits table, together with the Analytics_Statistics table. See Web analytics API for more information about the database table structure.
Trimming the values of the FromDate and ToDate parameters
The SET statements included in the query are necessary to ensure that the specified time interval includes the first and last units of time (e.g. the exact days entered into the From and To fields of a daily report).
The second parameter of the trimming functions must match the time unit of the given report. The options are: 'hour', 'day', 'week', 'month', 'year'.
- Click Save & Close to create the table.
- Click Insert in the Tables section to add the new table into the report.
- Click Save.
The daily report is now complete. In a real‑world scenario, the report would usually also contain a graph to display the data. See the Working with system reports () button in the menu above the report tree. Simply create copies of the daily report and then make the necessary adjustments.
Setting the title for custom statistics
To ensure that the user interface displays an appropriate title for your custom statistic, you need to create a resource string:
- Open the Localization application.
- Click New string on the Resource strings tab.
- Enter the Key of the string in format: analytics_codename.<statistic code name> (analytics_codename.buttonclicked for this example)
- Type the text of the string for your system's default culture, for example: Button clicks
- If you are using a multilingual UI, you can enter translations of the string for individual cultures.
- Click Save.
The system uses the string as the title for the matching statistic.
Result
Once there are some hits logged in the database for a custom statistic, the system automatically displays the statistic under the Custom category of the tree in the Web analytics application. The reports of the sample statistic show the number of hits logged for the tracked button click event. | https://docs.kentico.com/k8/custom-development/miscellaneous-custom-development-tasks/web-analytics-api/adding-custom-web-analytics | CC-MAIN-2019-13 | refinedweb | 1,380 | 54.52 |
You can use the load balancing plugin libloadbal to allow your server to execute a program when certain thread load conditions are met, so a load distribution product on the front-end can redistribute the load.
There are two methods that you can use to trigger the load balancer to increase or decrease load:
Standard
Base load decisions on the number of queued requests. This is a passive approach. By letting the queue fill up you are already delaying some requests. In this case, you want the HighThreshold to be a low value and LowThreshold to be a high value.
Aggressive
Base load decisions on the number of active threads in the pool. This is designed to more tightly control the requests so that you would reduce the load before requests get queued..
Below is a sample dosleep.c:
#ifdef XP_WIN32 #define NSAPI_PUBLIC __declspec(dllexport) #else /* !XP_WIN32 */ #define NSAPI_PUBLIC #endif /* !XP_WIN32 */ #include "nsapi.h" #define BUFFER_SIZE 1024 #ifdef __cplusplus extern "C" #endif NSAPI_PUBLIC int dosleep(pblock *pb, Session *sn, Request *rq) { char buf[BUFFER_SIZE]; int length, duration; char *dur = pblock_findval("duration", pb); if (!dur) { log_error(LOG_WARN, "dosleep", sn, rq, "Value for duration is not set."); return REQ_ABORTED; } duration = atoi(dur); /* We need to get rid of the internal content type. */ param_free(pblock_remove("content-type", rq->srvhdrs)); pblock_nvinsert("content-type", "text/html", rq>srvhdrs); protocol_status(sn, rq, PROTOCOL_OK, NULL); /* get ready to send page */ protocol_start_response(sn, rq); /* fill the buffer with our message */ length = util_snprintf(buf, BUFFER_SIZE, "<title>%s</title><h1>%s</h1>\n", "Sleeping", "Sleeping"); length += util_snprintf(&buf[length], BUFFER_SIZE - length, "Sample NSAPI that is sleeping for %d seconds...\n", duration); /* write the message to the client */ if (net_write(sn->csd, buf, length) == IO_ERROR) { return REQ_EXIT; } sleep(duration); return REQ_PROCEED; } | http://docs.oracle.com/cd/E19857-01/820-5709/abyfo/index.html | CC-MAIN-2015-48 | refinedweb | 290 | 55.13 |
Odoo Help
Odoo is the world's easiest all-in-one management software. It includes hundreds of business apps:
CRM | e-Commerce | Accounting | Inventory | PoS | Project management | MRP | etc.
Upload files to OpenERP through custom module
Hello. I need to know how to make a file upload to the server OpenERP. I'm creating a module which has to allow me to do an upload of a file to the server, then do a treatment for their content. I have done the treatment but n ose content as I can make a system call OpenERP to Upload File.
Hi,
you can use
fields.binary. you can save your file in database.
in your file.py
'data': fields.binary('File'),
in your file.xml:
<field name="data" /> and <button name="import_file" string="Import" type="object" class="oe_highlight" />
if you clik in button Import it call function import_file
in your function :
create a temp file for treatment content data.
def import_file(self, cr, uid, ids, context=None): fileobj = TemporaryFile('w+') fileobj.write(base64.decodestring(data)) # your treatment return
Thanks.
I need a button on my form that allows me to look at the client workstation, the file you want to upload to the server, and already once uploaded to launch the program evaluate the content of the file. After parsing the file's contents, if correct, shall be recorded in the custom tables, but never before.
yes retrieve contents of file to download to a temporary file then do tests on this file if correct save this object in your database else display a warning for example.
That is: in my custom program (my. py file), I introduce the sentence: 'data': fields.binary ('File') Along with the content of the file. Xml, this creates a button on the form. Is it right? Once this is when my role would create the temporary file, and then proceed to treatment. Is it right?
I edit my answer .it is now clear?
Sorry, but my English is not very fluid, so I asked confirmation, would not bother or offend. I apologize. Now if I understood your answer. The try tomorrow. Thank you. Best regards from Spain.
In your function you try to write data to a temporary file, but data is not defined in this function. How you get data?
@Joaquin i want to import sale order line from import button like i want add sale order line three(3) way 1-> add sale order line as current working oi's ok 2-> add sale oder line from my CSV/Excel file when i click on import button in sale order form view 3-> add sale order line both like 1, 2 how it is possible ?
Hi,
How can we do this without storing the file in the database? I would like to store the file in filepath on server.
Thanks
About This Community
Odoo Training Center
Access to our E-learning platform and experience all Odoo Apps through learning videos, exercises and Quizz.Test it now
Please elaborate. Do you mean uploading some sort of python script or csv? Not sure where you're trying to go with this, there's already importing, file attachments, etc.
Hi Brett.What I want is to upload a file, it can be a txt, csv or xls from a custom module, and that module should read the contents of that file and processing it, analyzing those contents and insert those contained in the custom tables. | https://www.odoo.com/forum/help-1/question/upload-files-to-openerp-through-custom-module-16828 | CC-MAIN-2017-26 | refinedweb | 578 | 74.49 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.