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 |
|---|---|---|---|---|---|
Lately, my team has been looking for better ways to create and maintain mocks in our TypeScript project. In particular, we wanted an easy way to mock out modules that we built using Sinon.JS.
We had a few goals for our mocks:
- Specific: Each test should be able to specify the mocked module’s behavior to test edge cases.
- Concise: Each test should only mock the functions that it cares about.
- Accurate: The return type of each mocked function should match the actual return type.
- Maintainable: Adding a new function to a module should create minimal rework in existing tests.
To accomplish these goals, we created this function:
export function mockModule<T extends { [K: string]: any }>(moduleToMock: T, defaultMockValuesForMock: Partial<{ [K in keyof T]: T[K] }>) { return (sandbox: sinon.SinonSandbox, returnOverrides?: Partial<{ [K in keyof T]: T[K] }>): void => { const functions = Object.keys(moduleToMock); const returns = returnOverrides || {}; functions.forEach((f) => { sandbox.stub(moduleToMock, f).callsFake(returns[f] || defaultMockValuesForMock[f]); }); }; }
The function takes in a module and an object that defines the mocked behavior of each function. When invoked,
mockModule returns a new function that takes two parameters: a Sinon Sandbox instance and an object that can override the mocked values specified in the previous function.
Here’s an example of how
mockModule can be used:
import * as sinon from 'sinon'; import { mockModule } from 'test/helpers'; import * as UserRepository from 'repository/user-repository'; import { getFullName } from 'util/user-helpers'; describe('getFullName', () => { const mockUserRepository = mockModule(UserRepository, { getFirstName: () => 'Joe', getLastName: () => 'Smith', }); let sandbox: sinon.SinonSandbox; beforeEach(() => { sandbox = sinon.sandbox.create(); }); afterEach(() => { sandbox.restore(); }); it('returns the full name of a user', () => { mockUserRepository(sandbox); const fullName = getFullName({ userId: 1 }); expect(fullName).to.equal('Joe Smith'); }); it('returns the full name of a user with only a first name', () => { mockUserRepository(sandbox, { getLastName: () => null, }); const fullName = getFullName({ userId: 1 }); expect(fullName).to.equal('Joe'); }); });
This demonstrates my team’s general pattern for mocking modules. First, we use
mockModule to create a function that can mock the given module. This happens at the outermost scope of our test suite so that the whole collection of tests can use the mocked function (in this example, the
mockUserRepository function). Each test can call the mock function, and if needed, each test can specify new behaviors for the functions.
What we’ve found to be extremely helpful is the typing that
mockModule provides. If we change the return type of a function in a module, we’ll receive a type error letting us know that we should update our tests accordingly.
This function has helped my team create better tests that are easy to write and maintain. What other mocking practices has your team used? Let me know in the comments.
By commenting below, you agree to the terms and conditions outlined in our (linked) Privacy Policy2 Comments
Hi
Try to use your code. But what is R? And where did it come from and I need to define the type T in mockModule….
Hi Olle,
I replaced “R” with “Object”. “R.keys” is a function from Ramda:. This library is not necessary for this function so I took it out.
“T” is a generic type that was being displayed properly in the code snippet. It should be present now.
I updated the post to reflect both of these changes. Thanks! | https://spin.atomicobject.com/2018/06/13/mock-typescript-modules-sinon/ | CC-MAIN-2018-43 | refinedweb | 552 | 56.35 |
Hi Bob, > You can test to make sure that you do have a power of two buffer size with the > following: > > #define myQ_SIZE 64 > > #define myQ_MASK ( myQ__SIZE - 1 ) > #if ( myQ__SIZE & myQ__MASK ) > #error myQ_SIZE buffer size is not a power of 2 > #endif > > The effect is to check if only one, and only one, bit is set in myQ_SIZE. Good point. I think I would refine things slightly like this: #define CBUF_Size( cbuf ) ( sizeof( cbuf.m_entry ) / sizeof( cbuf.m_entry[ 0 ] )) and replace all occurences of cbuf##_SIZE with CBUF_Size( cbuf ) You now no longer need the myQ_SIZE macro. Then add: #define CBUF_SizeIsPowerOf2( cbuf ) (( CBUF_Size( cbuf ) & ( CBUF_Size( cbuf ) - 1 )) == 0 ) Then for each circular buffer you create, you can throw in a variant of: #if ( !CBUF_SizeIsPowerOf2( myQ )) # error size of myQ not a power of 2 #endif -- Dave Hylands Vancouver, BC, Canada | http://lists.gnu.org/archive/html/avr-gcc-list/2005-08/msg00108.html | CC-MAIN-2014-42 | refinedweb | 140 | 65.25 |
<<
Juwan Reeves510 Points
multiplying 2 arguments
where did i go wrong
def product(price, quantity): price = 10 quantity = 20 price * quantity return price * quantity
1 Answer
Chris FreemanTreehouse Moderator 67,622 Points
You have the correct idea! There is unnecessary code that is causing the failure.
The
return statement is not properly indented inside of the function.
Do not assign values to the parameters. This overwrites the values passed in by the challenge checker causing the value 200 to always be returned. Delete these two lines.
The line before the
return does nothing but compute a value then toss it way. Delete this line.
This should get it passing. Post back if you need more help. Good luck!! | https://teamtreehouse.com/community/multiplying-2-arguments | CC-MAIN-2021-43 | refinedweb | 118 | 68.16 |
Unix Signal Handling
Table of Contents
1 Ordinary signal handling
The handling of ordinary signals are easy:
#include <signal.h> static void my_handler(int signum) { printf("received signal\n"); } int main() { struct sigaction sa; sa.sa_handler = my_handler; sigemptyset(&sa.sa_mask); sa.sa_flags = SA_SIGINFO; // this segv does not work sigaction(SIGSEGV, &sa, NULL); // this sigint will work sigaction(SIGINT, &sa, NULL); }
2 SIGSEGV handling
2.1 Motivation
The reason that I want to handle the
SIGSEGV is that I want to get the coverage from
gcov.
Gcov will not report any coverage information if the program terminates by receiving some signals.
Fortunately we can explicitly ask gcov to dump it by calling
__gcov_flush() inside the handler.
I confirmed this can work for ordinary signal handling.
// declaring the prototype of gcov void __gcov_flush(void); void myhanlder() { __gcov_flush(); }
After experiment, I found:
- address sanitizer cannot work with this handling. AddressSanitizer will hijact the signal, and maybe output another signal.
- Even if I turned off address sanitizer, and the handler function is executed, the coverage information is still not able to get. This possibly because the handler is running on a different stack.
2.2 a new stack
However, handling the SIGSEGV is challenging. The above will not work 1.
By default, when a signal is delivered, its handler is called on the same stack where the program was running. But if the signal is due to stack overflow, then attempting to execute the handler will cause a second segfault. Linux is smart enough not to send this segfault back to the same signal handler, which would prevent an infinite cascade of segfaults. Instead, in effect, the signal handler does not work.
Instead, we need to make a new stack and install the handler on that stack.
#include <signal.h> void sigsegv_handler(int signum, siginfo_t *info, void *data) { printf("Received signal finally\n"); exit(1); } #define SEGV_STACK_SIZE BUFSIZ int main() { struct sigaction action; bzero(&action, sizeof(action)); action.sa_flags = SA_SIGINFO|SA_STACK; action.sa_sigaction = &sigsegv_handler; sigaction(SIGSEGV, &action, NULL); stack_t segv_stack; segv_stack.ss_sp = valloc(SEGV_STACK_SIZE); segv_stack.ss_flags = 0; segv_stack.ss_size = SEGV_STACK_SIZE; sigaltstack(&segv_stack, NULL); char buf[10]; char *src = "super long string"; strcpy(buf, src); }
2.3 libsigsegv
I also tried another library, the libsigsegv 2. I followed two of their methods, but I cannot make either work. The code lists here as a reference:
#include <signal.h> #include <sigsegv.h> int handler (void *fault_address, int serious) { printf("Handler triggered.\n"); return 0; } void stackoverflow_handler (int emergency, stackoverflow_context_t scp) { printf("Handler received\n"); } int main() { char* mystack; // don't know how to use sigsegv_install_handler (&handler); stackoverflow_install_handler (&stackoverflow_handler, mystack, SIGSTKSZ); } | http://wiki.lihebi.com/signal.html | CC-MAIN-2017-22 | refinedweb | 434 | 50.12 |
munlock(2) munlock(2)
NAME
munlock() - unlock a segment of the process virtual address space
SYNOPSIS
#include <<<<sys/mman.h>>>>
int munlock( const void * addr, size_t len) ;
DESCRIPTION
The munlock() system call allows the calling process to unlock a
segment of the process virtual address space that may have been
previously locked with mlock() or mlockall(). Upon successful
completion of the munlock(), pages within the specified segment are
subject to routine paging and/or swapping.
addr must be a valid address in the process virtual address space.
addr + len must also be a valid address in the process virtual address
space.
Pages are unlocked at page boundaries that encompass the range from
addr to addr + len. If any address within the range is not a valid
part of the process virtual address space, an error is returned and no
unlocks are performed. However, no error is reported for valid pages
within the range that are not already locked, since their state at the
completion of the munlock() call is as desired.
munlock() returns the following values:
0 Successful completion.
-1 Failure. The requested operation is not performed. errno
is set to indicate the error.
Hewlett-Packard Company - 1 - HP-UX Release 11i: November 2000
munlock(2) munlock(2)
ERRORS
If munlock() fails, errno is set to one of the following values:
[ENOMEM] One or more addresses in the specified range is
not valid within the process address space.
[EINVAL] The len parameter was zero.
[EPERM] The effective user ID of the calling process is
not a superuser and the user does not belong to a
group that has the MLOCK privilege.
EXAMPLES
The following call to munlock() unlocks the first 10 pages of the
calling process address space:
munlock(sbrk(0), 40960);
SEE ALSO
setprivgrp(1M), getprivgrp(2), mlock(2), mlockall(2), munlockall(2),
plock(2).
STANDARDS CONFORMANCE
munlock(): POSIX Realtime Extensions, IEEE Std 1003.1b
Hewlett-Packard Company - 2 - HP-UX Release 11i: November 2000 | http://modman.unixdev.net/?sektion=2&page=munlock&manpath=HP-UX-11.11 | CC-MAIN-2017-17 | refinedweb | 326 | 61.67 |
Fun and Games with FreeBSD Kernel Modules - Kernel hacking using kernel modules and kmem patching. Contains information on how to intercept system calls and other calls in the kernel by altering the corresponding call table. Also shows how to alter these tables by writing to kernel memory and gives an example of patching the kernel directly without the use of modules. Furthermore an example is given on how the symbol table in the kernel can be altered.
1c02af353600d213d821553a35d81211
<html>
<head>
<title>Fun and Games with FreeBSD Kernel Modules</title>
</head>
<body bgcolor="#ffffff">
<h2>Fun and Games with FreeBSD Kernel Modules</h2>
v0.1b by Stephanie Wehner, 04/08/2001<br>
<br>
<p>
<a href="#Intro">1. Introduction</a><br>
<a href="#Intro-Kernel">1.1 Kernel Modules</a><br>
<a href="#Intro-Useful">1.2 Useful Functions</a><br>
<p>
<a href="#Methods">2. Techniques</a><br>
<a href="#Methods-Function">2.1 Replacing Function Pointers</a><br>
<a href="#Methods-Function-Sys">2.1.1. System Calls</a><br>
<a href="#Methods-Function-Other">2.1.2. Other Tables</a><br>
<a href="#Methods-Function-Single">2.1.3. Single Function Pointers</a><br>
<a href="#Methods-Lists">2.2. Modifying Kernel Lists</a><br>
<a href="#Methods-Kernel">2.3. Reading and Writing Kernel Memory</a><br>
<a href="#Methods-Kernel-Find">2.3.1. Finding the address of a symbol</a><br>
<a href="#Methods-Kernel-Read">2.3.2. Reading data</a><br>
<a href="#Methods-Kernel-Modify">2.3.3. Modifying kernel code</a><br>
<p>
<a href="#Common">3. Common Applications</a><br>
<a href="#Common-Files">3.1. Hiding & Redirecting Files</a><br>
<a href="#Common-Process">3.2. Hiding Processes</a><br>
<a href="#Common-Network">3.3. Hiding Network Connections</a><br>
<a href="#Common-Firewall">3.4. Hiding Firewall Rules</a><br>
<a href="#Common-Trigger">3.5. Network Triggers</a><br>
<a href="#Common-Module">3.6. Hiding the module</a><br>
<a href="#Common-Other">3.7. Other applications</a><br>
<p>
<a href="#Patching">4. Patching the kernel</a><br>
<a href="#Patching-Example">4.1. Introduction</a><br>
<a href="#Patching-Jumps">4.2. Inserting Jumps</a><br>
<a href="#Patching-Replace">4.3. Replacing Kernel Code</a><br>
<p>
<a href="#Reboot">5. Reboot Proofing</a><br>
<p>
<a href="#Experimental">6. Experimental</a><br>
<p>
<a href="#Defense">7. Defending yourself: The cat and mouse game</a><br>
<a href="#Defense-Symbol">7.1. Checking the symbol table</a><br>
<a href="#Defense-Trap">7.2. Building a Trap Module</a><br>
<a href="#Defense-Direct">7.3. Retrieving data directly</a><br>
<a href="#Defense-Remarks">7.4. Remarks</a><br>
<p>
<a href="#Conclusion">8. Conclusion</a><br>
<p>
<a href="#Code">9. Code</a><br>
<p>
<a href="#References">10. References</a><br>
<p>
<a href="#Thanks">11. Thanks</a><br>
<h3><a name="Intro"></a>1. Introduction</h3>
Kernel modules for FreeBSD have been around for quite some time, yet many people still consider them to be
rather obscure. This article will explore some ways to use kernel modules and kernel memory in order
to alter the behaviour of the system.
<p>.
<p>.
<p>
This text has been written for educational purposes only. Use with care :)
All the example code is available as a single package called Curious Yellow (CY) at the
end of this article.
<h4><a name="Intro-Kernel"></a>1.1 Kernel Modules</h4>
In short, kernel modules allow you to load new code into the kernel. Many of the examples
below use them to add new functions.
<p>
This text assumes you know the basics of how to write a FreeBSD kernel module. If you've never
worked with them before you might want to consult the <a href="">
Dynamic Kernel Linker (KLD) Facility Programming Tutorial</a> published in daemonnews or take a look
at the examples provided in /usr/share/examples/kld/ on your FreeBSD machine.
<h4><a name="Intro-Useful"></a>1.2 Useful Functions</h4>
If you've never done any kernel programming before, here are some functions that can come in very handy
and that are especially useful when dealing with system calls.
<p>
<h5>copyin/copyout/copyinstr/copyoutstr</h5>
<p>
These functions allow you to copy contiguous chunks of data from user space to kernel space and vice
versa. More detailed information can be found in their manpage (copy(9)) and also in the KLD tutorial
mentioned above.
<p>
Say you made a system call which also takes a pointer to a character string as an argument. You now
want to copy the user supplied data to kernel space:
<pre>
struct example_call_args {
char *buffer;
};
int
example_call(struct proc *p, struct example_call_args *uap)
{
int error;
char kernel_buffer_copy[BUFSIZE];
/* copy in the user data */
error = copyin(uap->buffer, &kernel_buffer_copy, BUFSIZE);
[...]
}
</pre>
<h5>fetch/store</h5>
If you just want to transfer small amounts of data, you might want to use the functions
described in fetch(9) and store(9). These functions allow you to transfer byte and word
sized pieces of memory.
<h5>spl..</h5>
The functions described in spl(9) allow you to manipulate interrupt priorities. This
allows you to prevent certain interrupt handlers from being run. In some later examples
the pointer to a function such as icmp_input for example is altered. If this takes multiple
steps you might want to block an interrupt while you're making changes.
<h5>vm_map_find</h5>
<h3><a name="Methods"></a>2. Techniques</h3>
This section lists some common methods that are later used to implement some of the
tricks like process hiding, connection hiding and more. Of course you could use
the same methods to do other things as well.
<h4><a name="Methods-Function"></a>2.1. Replacing Function Pointers</h4>
Probably the most commonly used technique is to replace function pointers
in the kernel to point to the newly loaded functions. In order to make use
of this method, a kernel module is loaded that carries your new function.
You can then swap your function for the original one when the module is loaded.
Alternatively you can later do the swap by writing to /dev/kmem (see below)
<p>
Since you're replacing an existing function, it is important that your newly
created function will take the same arguments as the original one. :) You can
then either do some pre or post processing while still calling the original
function or you can write a complete replacement.
<p>
There are a lot of hooks in the kernel where you can employ this method. Let's
just look at some of the commonly used places.
<h5><a name="Methods-Function-Sys"></a>2.1.1. System Calls</h5>
The classic case is to replace system calls. FreeBSD keeps a list of syscalls
in a struct called sysent. Take a look at /sys/kern/init_sysent.c, here's
a very short excerpt:
<pre> */
[...]
</pre>
If you want to know what struct sysent looks like and what the numbers of the
system calls are, check out /sys/sys/sysent.h and /sys/sys/syscall.h respectively.
<p>
Say you would want to replace the open syscall. In the MOD_LOAD section of your
load module function, you would then do something like:
<pre>
sysent[SYS_open] = (sy_call_t *)your_new_open;
</pre>
If you would want to restore the original call when the module is unloaded, you can
just set it back:
<pre>
sysent[SYS_open].sy_call = (sy_call_t *)open;
</pre>
A complete example will follow below.
<h5><a name="Methods-Function-Other"></a>2.1.2. Other Tables</h4>
The system call table is not the only place however you can mess with. There's a lot of
other interesting places in the FreeBSD kernel. Most notably are inetsw and the vnode tables
of the different filesystems.
<p>:
<pre>
inetsw[ip_protox[IPPROTO_ICMP]].pr_input = new_icmp_input;
</pre>
Again, a complete example will follow later.
<p>
For every filesystem a vnode table is kept that specifies what function is called for which VOP.
Say you wanted to replace ufs_lookup:
<pre>
ufs_vnodeop_p[VOFFSET(vop_lookup)] = (vop_t *) new_ufs_lookup;
</pre>
<p>
There's more places like this where you can hook in, depending on what you want to achieve.
The only documentation however is the kernel source itself.
<h4><a name="Methods-Function-Single"></a>2.1.3. Single Function Pointers</h4>
Occasionally there are also single pointers that are used to determine which function to call.
This is for example the case with ip_fw_ctl_ptr, which points to the function ipfw control
requests will go to. Again, this gives you another place to hook in.
<h4><a name="Methods-Modify"></a>2.2. Modifying Kernel Lists</h4>
Just replacing functions is by itself not a lot of fun. You might also want to alter
the data as it is known by the kernel. A lot of interesting things are stored as lists
inside the kernel. If you've never worked with the list macros as defined in /sys/sys/queue.h
before, you might want to familiarize yourself with them before continuing in this direction.
It will make it easier to understand the existing definitions you will encounter in kernel
code and it will also prevent you from making mistakes if you use these macros yourself.
<p>
Some of the more interesting lists are:
.
<p>
The linker_files list: this list contains the files linked to the kernel. Every link file
can contain one or more modules. This has been described in the <a href="">THC article</a>, so I won't go into that here. This list will become important
when we want to alter the address of a symbol or hide the loaded file with modules.
<p>
The module list: modulelist_t modules contains a list of the loaded modules. Note that this is
different from the files linked. A file can contain more then one module. This will also become
important when you want to hide your module.
<p>
Of course there's a lot more to be found in the kernel sources.
<h4><a name="Methods-Kernel"></a>2.3. Reading and Writing Kernel Memory</h4>
Modules are not the only way to get to things inside the kernel. You can also modify kernel memory
directly via /dev/kmem.
<h5><a name="Methods-Kernel-Find"></a>2.3.1. Finding the address of a symbol</h5>
When you deal with kernel memory you might first be interested in finding the correct
place of a symbol you might want to read or write to. In FreeBSD the kvm(3) functions
provide you with some useful tools to do this. Please consult the manpage on how to use
them. Below is a small example that will find the address given a symbol name. You can
also find this example in the CY package in tools/findsym.c.
<pre>
[...]);
}
[...]
</pre>
<h5><a name="Methods-Kernel-Read"></a>2.3.2. Reading data</h5>
Now that you have found the correct address, you might want to read data from it. You can do
so with kvm_read. The files tools/kvmread.c and tools/listprocs.c will provide you with an
example.
:
<pre>
[...]);
}
</pre>
<h5><a name="Methods-Kernel-Modify"></a>2.3.3. Modifying kernel code</h5>
In a similar fashion you can also write to kernel memory. The manpage on kvm_write will give
you more information. This basically works almost like reading. Later on in this text some
examples will be given. If you're impatient, you can also take a look at tools/putjump.c now.
<h3><a name="Common"></a>3. Common Applications</h3>
<h4><a name="Common-Files"></a>3.1. Hiding & Redirecting Files</h4>
One of the most common things to do is to hide files. This is one of the easier things to do,
so let's start with this.
<p>
There's multiple levels you can hook in your code in order to hide your files. One way is
via catching system calls such as open, stat, etc. Another way is to hook in at the lookup
functions of the underlying filesystem.
<h5>3.1.1. Via System Calls</h5>
This is the way it is usually done, and has been used by various tools and is also described
in the <a href="">THC article</a>.
For the calls that are directed at one specific file, such as open, stat,
chmod etc, this is very simple to do. You can add a new function, say new_open. In this
function you check the supplied filename. If this filename has certain characteristics,
eg it starts with a certain string, it will be hidden right away by returning a not found
error. Otherwise the original open function will be called. Example from module/file-sysc.c:
<pre>
/*
*));
}
</pre>
In the function file_hidden you can then check if the filename should be hidden. In the loader
of your module you then replace the call to open with new_open in the syscall table:
<pre>);
}
</pre> <a href="">THC article</a> and some other places, so I won't go into detail here.
<h5>3.1.2. Via the vnode tables</h5>
The other way of hiding files is via the functions of the underlying filesystem. This approach
has the advantage that you don't need to alter the syscall table and you can save yourself
some work as the lookup function will in the end be called from a lot of syscalls you would all
have to replace otherwise. Also, you might want to consider using some other atrribute of
the file then it's name to determine whether it should be hidden.
<p>.
<p>
Say you wanted all lookups on a UFS filesystem to go to your own function. First of
all you would make a new ufs_lookup. From module/file-ufs.c:
<pre>
/*
*));
}
</pre>
Then you would have to adjust the pointer in the vnode table when the module is loaded:
<pre>);
}
</pre>.
<h5>3.1.3. General Remarks</h5>
File redirection can be implemented in exactly the same way, just replace the file that's
requested with the one you want to give instead. If you want to do execution redirection
you have to change execve. This is quite easy to do. You have to catch execve and alter the
filename to execute that the user passed to it. Note that you might need to allocate more memory
in user space. This can be done with vm_map_find. CY contains an example on how to execute another
program from the kernel where this is used. You could easily adapt this to replace execve.
<h4><a name="Common-Processes"></a>3.2. Hiding Processes</h4>
<h5>3.2.1. Hiding</h5>
Another common thing to do is to hide processes. In order to achieve this you need to
intercept the various ways information about processes is obtained. Also you want to keep
track of which processes you want to hide. Every process is recorded in a struct proc. Check
out /sys/sys/proc.h for the complete structure. On of the fields is called p_flag, which allows
certain flags to be set for each process. One can therefore introduce a new flag:
<pre>
#define P_HIDDEN 0x8000000
</pre>
When a process is hidden, we'll set this flag so it can be recognized later. See module/control.c
for the CY control functions that hide and unhide a process.
<p>
If you do a ps, it will go to kvm_getprocs, which in return will make a sysctl with the following arguments:
<pre>
name[0] = CTL_KERN
name[1] = KERN_PROC
name[2] = KERN_PROC_PID, KERN_PROC_ARGS etc
name[3] can contain the pid in case information about only one process is requested.
</pre>
name is an array that contains the mib, describing what kind of information is requested:
eg what kind of sysctl operation it is and what is requested exactly.
In short the following sub query types are possible: (from /sys/sys/sysctl.h)
<pre>
/*
* */
</pre>
This will ultimately end up at __sysctl. The THC article also contains some information on this, but
since I had implemented it differently, I included some example code in module/process.c. This is
also the place where we'll hide network connections later.
<p> :)
<p>
However, similar to UFS one can also just fix the corresponding entries for procfs. Example code for this
is given in module/process.c. A new procfs lookup for example could look like this:
<pre>
/*
*));
}
</pre>
You would then replace it when you load the module:
<pre>);
}
</pre>
<h5>3.2.2. Hiding children and catching signals</h5>
You would probably want to make sure that descendants of a hidden process will also stay hidden.
Likewise you would want to prevent your hidden processes from being killed. For this you can
intercept the calls to fork and kill. These are system calls and can be replaced using the methods
described above, so I won't provide any code here. You can find examples in module/process.c.
<h3><a name="Network"></a>3.3. Hiding Network Connections</h3>
Hiding network connections from queries such as netstat -an, is very similar to hiding processes.
If this information is retrieved, it will also execute a sysctl, yet alone the mib will be
different. In case of TCP connections:
<pre>
name[0] = CTL_NET
name[1] = PF_INET
name[2] = IPPROTO_TCP
name[3] = TCPCTL_PCBLIST
</pre>
In exactly the same way as before, the data to be hidden will be cut out of the data retrieved
by userland_sysctl. CY allows you to specify various connections that should be hidden via cyctl.
See module/process.c for the __sysctl modifications.
<h3><a name="Common-Firewall"></a>3.4. Hiding Firewall Rules</h3>
Another fun thing to do is to hide firewall rules. This can be done quite easily by substituting
your own function for ip_fw_ctl. ip_fw_ctl is the ipfw control function that all requests like
adding, deleting, listing etc firewall rules will be passed to. We can therefore intercept these
requests in our own function and act accordingly.
<p>.
<pre>
#define IP_FW_F_HIDDEN 0x80000000
</pre>
<p>.
<p>.
<h3><a name="Common-Trigger"></a>3.5. Network Triggers</h3>
As described above there is more places in the kernel where you can swap the pointer
to an existing function for your own. One of these places is inetsw, which contains a
list of inet protocols and information about them, eg like the functions to call when a packet
of this protocol type comes in or goes out.
<p>.
<p>
Part of module/icmp.c:
<pre>
[...];
}
[...]
</pre>
Then, in order to replace icmp_input when the module is loaded:
<pre>);
}
</pre>.
<h3><a name="Common-Module"></a>3.6. Hiding the Module</h3>
Hiding all these things would still be rather obvious if the module itself would
be visible. Therefore one would want to hide its existence as well.
<p>:
<pre>);
</pre>
The next thing one needs to do, is remove the modules from the module list.
In the case of CY this is only one. Similar to the linker_file the module
list also keeps a counter, nextid, one should decrement.
<pre>
extern modulelist_t modules;
extern int nextid;
[...]
module_t mod = 0;
TAILQ_FOREACH(mod, &modules, link) {
if(!strcmp(mod->name, "cy")) {
/*first let's patch the internal ID counter*/
nextid--;
TAILQ_REMOVE(&modules, mod, link);
}
}
[...]
</pre>.
<h3><a name="Common-Other"></a>3.6. Other Applications</h3>
Of course there's lots of other things you can do with kernel modules. Some
example include tty hijacking, hiding the promiscuous mode of an interface
and su'ing via a special system call that will set the process' user id to 0.
The kernel patch described below is a bit similar to that, except that it
changes suser so for many applications this becomes unnecessary. Hiding
the promiscuous mode of an interface could also be done by clearing this
flag for the interface in question by writing to /dev/kmem. However,
in this case it will be cleared even if someone else is running tcpdump
etc on the same interface.
<p>
It should also be possible to filter reads and writes. This would
become particularly interesting in the case of /dev/kmem through which
a lot of information can be obtained.
<h3><a name="Patching"></a>4. Patching the Kernel</h3>
Kernel modules are not the only way to alter the workings of the kernel. You can also
overwrite existing code and data via /dev/kmem. This opens various possibilities.
<p>
In the techniques section I've already outlined some of the basic ways on how to work
with /dev/kmem. This section concentrates on writing to /dev/kmem.
<h4><a name="Patching-Example"></a>4.1. Introduction</h4>
A simple thing you can do in order to test writing is to insert a return at the beginning
of an existing kernel function. One way to test this without disrupting any of your normal
work is to load a kernel module, say CY not in stealth mode, and then write a return at
the beginning of for example cy_ctl and use the cyctl to send command to CY. Nothing
will happen, as cy_ctl will return right away. Check out tools/putreturn.c for the code
on how to do this.
<h4><a name="Patching-Jumps"></a>4.2. Inserting Jumps</h4>
A very similar thing is to write a jump to a certain function. This for example allows
you to redirect existing calls to your own without altering the syscall table or any
other tables involved.
.
<p>
In the tools section, there's a file called tools/putjump.c:
<pre>
/*);
}
</pre>
Data can be written to other places accordingly.
<h4><a name="Patching-Replace"></a>4.3. Replacing Kernel Code</h4>
Although you could avoid altering existing tables using the jump method, you still
had to load your own code. Sometimes it might be nicer to just patch your code
into the existing function. This is not always easy though and makes your patch
highly version and compiler dependent. Nevertheless it's kind of fun :)
<p>:
<pre>
# objdump -d /kernel --start-address=0xc019d538 | more
/kernel: file format elf32-i386
Disassembly of section .text:
c019d538 <suser_xxx>: <suser_xxx+0x2d>
c019d545: 85 d2 test %edx,%edx
c019d547: 75 13 jne c019d55c <suser_xxx+0x24>
c019d549: 68 90 df 36 c0 push $0xc036df90
c019d54e: e8 5d db 00 00 call c01ab0b0 <printf>
c019d553: b8 01 00 00 00 mov $0x1,%eax
c019d558: eb 32 jmp c019d58c <suser_xxx+0x54>
c019d55a: 89 f6 mov %esi,%esi
c019d55c: 85 c0 test %eax,%eax
c019d55e: 75 05 jne c019d565 <suser_xxx+0x2d> <suser_xxx+0x1b>
c019d56b: 85 d2 test %edx,%edx
c019d56d: 74 1b je c019d58a <suser_xxx+0x52>
c019d56f: 83 ba 60 01 00 00 00 cmpl $0x0,0x160(%edx)
c019d576: 74 07 je c019d57f <suser_xxx+0x47>
c019d578: 8b 45 10 mov 0x10(%ebp),%eax
c019d57b: a8 01 test $0x1,%al
c019d57d: 74 d4 je c019d553 <suser_xxx+0x1b>
c019d57f: 85 d2 test %edx,%edx
c019d581: 74 07 je c019d58a <suser_xxx+0x52>
</pre>
This is what suser_xxx has been compiled to. You can compare this with the original code for suser_xxx, which is
defined in /sys/kern/kern_prot.c:
<pre>);
}
</pre>
Unless you're the total assembler person (unlike me :) ), you have to look at this for a bit.
You can infer that %eax contains the cred and %edx the proc stuff. Basically what we would
want now is something like this:
<pre>
if ((cred->cr_uid != 0) || (cred->cr_uid != MAGIC_UID))
return (EPERM);
</pre>:
<pre>
c019d565: 83 78 04 00 cmpl $0x0,0x4(%eax)
c019d569: 75 e8 jne c019d553 <suser_xxx+0x1b>
</pre>
Lets first change this to jump to go to the place where we'll add our new code. This is where
the start of the printf stuff is located:
<pre>
c019d549: 68 90 df 36 c0 push $0xc036df90
c019d54e: e8 5d db 00 00 call c01ab0b0 <printf>
</pre>
For this we need to change the address the jump will go to. 0x75 specified
jne and 0xe8 above is the jump address.
<p>
</pre>.
<p>
Ok, now let's put this all together. This will add the extra check for user
with uid 100 (me on my laptop :) ) as described above:
<pre>
#include <stdio.h>
#include <fcntl.h>
#include <kvm.h>
#include <nlist.h>
#include <limits.h>
);
}
</pre>
In direct/fix_suser_xxx.c you will find a slightly altered version, which will
ask you for your user id (< 256 ;)) and find out the location of fix_suser_xxx
itself.
<p>
After you made these changes you can quickly test it, with your new superuser by copying
/sbin/ping to your own directory and executing it as the user.
<h3><a name="Reboot"></a>5. Reboot Proofing</h3>
In the case of the module, you can use file redirection to make your module reboot
proof. You could for example have the startup stuff for your module in a file
in /usr/local/etc/rc.d/ where it will be executed on startup (before the secure level is
raised) and then hide that file after you're loaded.
<p>
<h3><a name="Experimental"></a>6. Experimental</h3>
In some of the examples above, the address of a symbol is retrieved from /dev/kmem,
but where does this actually come from ? This data is also kept in the kernel, and
is thus also subject to alteration. The symbols are in an elf hash table. Every linked
file comes with its own symbols. The example in exp/symtable.c looks at the
first entry in the linker_files list, namely the original kernel. The symbol
name is hashed and then retrieved. Once it's found, the new address can be set.
<p>
This is an excerpt from exp/symtable.c:
<pre>);
}
</pre>
The symtable module is a seperate module which will load the system call above. You can
test it using the set_sym utility. This defeats the checks made by tools/checkcall.
<p>
This table is also consulted when new stuff is linked into the kernel, so you might
want to play with this :) Unfortunately I didn't get around to it yet.
<h3><a name="Defense"></a>7. Defending yourself: The cat and mouse game</h3>
Now you might ask yourself, what you can do in order to prevent these things
from happening to your system. Or perhaps you're also just interested in
finding yourself again :)
<p>
Let's look at some of the methods that could be used to detect such a module.
<h3><a name="Defense-Symbol"></a>7.1. Checking the symbol table</h3>
In many of the examples above, the symbol table has been altered. So you can
check the symbol table for modifications. One way to do this is to load
a module at startup that will make a copy of the syscall table as it is then.
You can have it include a syscall which will allow you to compare the current
syscall table with the saved copy later on.
<p>.
<p>.
<p>:
</pre>
However, we can fix this using setsym. For this you first need to load the module
contained in the experimental section exp/.
<pre>
# exp/setsym 0xc0cd5bf4 open
</pre>
Now.
<p>
The problem with this approach is that someone could use file redirection to point
you to a different /kernel or objdump. However it would be quite a bit of hassle
to cover this up.
<h3><a name="Defense-Trap"></a>7.2. Building a Trap Module</h3>
Another thing you can do is to enter a trap module which will catch calls
made to kldload. You can then log the fact that a module has been loaded or
simply deny any further loading. There's a small example in trapmod/.
Ideally you load this module in stealth mode, when your system is started
and before you raise the secure level.
<p>
Note however that the defensive methods outlined in 7.1. can also be used
against your trapmodule :)
<h3><a name="Defense-Direct"></a>7.3. Retrieving data directly</h3>
Recall that many of the hiding functions above just altered the functions
you can use to get a view of the system. One way to defend yourself against
this, is to provide your own access to this data. This can be done either
by loading your own kernel module or by reading the data from /dev/kmem.
<p>.
<p>
The problem with this approach is however that an attacker that knows
of your modules, can circumvent them.
<p>.
<h3><a name="Defense-Remarks"></a>7.4. Remarks</h3>
As you can see defending yourself turns into a kind of cat and mouse game.
If you know what the attacker is doing, you can devise a way to defend
yourself and detect the module. In return a knowledgeable attacker can most likely
circumvent your defenses, if he/she finds out they are there and how they work. Of course
you can then try and work around that as well...
This can basically go on almost forever, until you've both wasted your life
creating more and more obscure kernels :)
<h3><a name="Conclusion"></a>8. Conclusion</h3>
Many of the techniques used to attack a system can be used for defense as well.
Also employing such modules to hide administrative tools can be useful. For a
sysadmin, it would be possible to hide a shell and the files
that are used to monitor an intruder on the system.
<p>).
<p>
Playing with this kind of stuff allows you to learn more about how the kernel works.
And, most importantly, it can be fun :)
<h3><a name="Code"></a>9. Code</h3>
All code for this article and some more tools and examples is collected in a package
called <a href="cyellow-0.01.tar.gz">Curious Yellow</a> See the README for a roadmap.
<h3><a name="References"></a>10. References</h3>
<h4>FreeBSD</h4>
<ul>
<li><a href="">Exploiting Kernel buffer overflows FreeBSD Style</a> by Esa Etelavuori
<li><a href="">Attacking FreeBSD with Kernel Modules - The System Call Approach</a> by pragmatic/THC
<li><a href="">Dynamic Kernel Linker (KLD) Facility Programming Tutorial</a> by Andrew Reiter
</ul>
<h4>Linux</h4>
<ul>
<li><a href="">Runtime Kernel Kmem Patching</a> by Silvio Cesare
</ul>
<h4>Inspiriation :)</h4>
<ul>
<li>Jeff Noon, "The Vurt"
</ul>
<h3><a name="Thanks"></a>11. Thanks</h3>
Thanks go to:
<pre>
Job de Haas for getting me interested in this whole stuff
Olaf Erb for checking the article for readability :)
and especially Alex Le Heux
</pre>
</body> | https://packetstormsecurity.com/files/25297/fbsdfun.htm | CC-MAIN-2019-18 | refinedweb | 5,101 | 64.81 |
as64 is a two pass cross-assembler for 6510 CPU systems, mainly the
Commodore 64. as64 is free software
and is licensed under the GNU General Public
License (GPL).
Version 0.9 of as64 is avaliable for download:
as64 has been tested and run on GNU/Linux and FreeBSD. Moreover, as64 0.9 is
quite stable and works fine for me, but if you encounter a bug, send
me an email about it and I will see what I can do.
I once wrote a short as64 tutorial:
Due to the fact that I am used to programming in Turbo
Assembler, as64 has adopted it's syntax. Semicolons precedes
comment lines, high and low bytes of a label is extracted with
the > and < operators and bytes, words and ASCII-text is
marked with the .byte, .word
and .text keywords. The
things that differ is that constant mathematical expressions
aren't always correctly evaluated, labels can have an optional
trailing colon (this is since emacs indents lines with a colon
differently in asm-mode) and that as64 features a module system.
Constant expressions, like 2 + 3 * 4 or 4 * 3 + 2 are
not evaluated correctly. The operators have no
precedence over each other; instead expressions are evaluated
from left to right. For example, 1 + 2 * 3 is interpreted as
(1 + 2) * 3, which calculates as 9, and not the mathematically
correct 1 + (2 * 3), which is 7. This normally is not a
problem for me, as I seldom use any larger expressions, but
you should be very awary of this if you decide to use as64. Be
also aware that this might change in future versions, so
don't depend on this errorneous behaviour.
The modularity is achieved though the use of the keywords
module and export. Symbols (labels) can be
exported from each module
(typically a module consists of a file). The qualified keyword indicates that the
variable name should be preceeded by the module name. Let's
have a look at an example:
In the file reset.S you
find these statements:
;; reset.S
;;
;; functions for resetting the computer to normal c64-mode
module reset
export qualified all
reset:
sei
jsr $fda3
jsr $fd15
jsr $ff5b
cli
jmp $e397
error_reset:
sei
jsr $fda3
jsr $fd15
jsr $ff5b
cli
inc $d020
jmp $e397
First we see a few lines begining with a semicolon. These are
treated like a comment and are ignored by the assembler. (You
can use standard C-comments /* */ aswell.) After that a
module definition
comes. This is necessary if you want to export symbols qualified.
The next line contains the statement export qualified all which makes
all symbols to be exported with the module name preceding
them. In this case, the global symbol table would contain the
following entries:
reset.reset
reset.error_reset
Note that the export qualified
all keywords has to appear in that order. If they
don't, unexpected results might follow.
These qualified exported
symbols can be imported
into a local symbol table by using the keyword import. In this case, suppose a file
called boot.S includes the
following lines:
;; boot.S
;;
;; administers the bootup procedure of osT
;;
module boot
import reset
export qualified boot:
sei
jsr process.init
bcs boot_error
jsr malloc.init
bcs boot_error
jsr proctable.init
bcs boot_error
jsr zeropage.init
bcs boot_error
jsr scheduler.init
bcs boot_error
jsr process.add
cli
clc
rts
boot_error:
jmp error_reset
Here, the jmp error_reset
causes a jump to the error_reset subroutine that was
defined in reset.S. (Here,
it would not have been a good idea to import the modules process, malloc, proctable, zeropage
or scheduler, since they
all export an init-label. No warings are issued
if this would happen, and it would lead to unexpected results.)
Generally, it is not necessary, and is not recommended, to
import symbols from other modules. The reson for the import function to be included in
as64 is so that you can have a header file with definitions
for constant values, tables and such that you don't want to
have in the actual source file. Let's have a look at an
example:
The file process.h consists
of the following lines:
;; process.h
;;
;; defines constant values for process statuses etc
module process
export qualified all
DEAD = 0
RUNNING = 1
WAITING = 2
ZOMBIE = 3
STOPPED = 4
STARTING = 5
EXITING = 6
current .byte 0
next .byte 0
And in the file process.S
these lines are to be found:
;; process.S
;;
;; code for process control
module process
import process
export qualified getpid:
lda current
rts
Here, the lda current loads
the value from the current
defined in process.h. Other
modules (that doesn't import
process) refers to this address with process.current. The constants can
be used in a similar way, like lda
#process.RUNNING.
$Date: 2002/07/20 10:04:20 $ | http://dunkels.com/adam/as64/ | CC-MAIN-2014-52 | refinedweb | 807 | 64.71 |
Welcome to step 3
SayHello()
We're currently on step 3 of this tutorial, where we will use the ATL object wizard to add a simple COM object, the HelloWorld object, to the server. This step will go by real fast, so instead of my blathering any further, let's plunge in.
To add COM objects to ATL servers, we can either use the ATL Simple Object Wizard provided by Visual C++. NET 2003, or we can add code by hand. I prefer to use the wizards provided by Visual C++ whenever I can, but then again, I'm lazy :).
Let's proceed. Open Class View, right-click on the 'HelloWorldServNET' text - in bold and at the very top - and then point to Add, and then click Add Class. The Add Class dialog box opens, as shown below in Figure 2. As shown, open the Visual C++ folder, open the ATL folder, click on the ATL folder in the left-hand pane, then click ATL Simple Object in the right-hand pane, and then click Open:
HelloWorldServNET
The ATL Simple Object Wizard appears, as shown in Figure 3, below. Click the Name tab, and then type HelloWorld in the Short Name box, as shown below. HelloWorld serves as the name for our COM object that's in charge of exposing the functionality we want the client to see. The whole way in which COM works and how COM does this is outside the scope of this article.
HelloWorld
Note how, above, we leave the Attributed checkbox unchecked. Again, I want you, dear reader, to minimize what's hidden from you so that you can learn as we go along. Attributes would defeat this purpose. Notice how, as we type in HelloWorld in the Short Name box, the wizard fills in the rest of the fields for us. For more information on what these fields mean, click Help. We'll leave the default settings for these fields alone for this tutorial, but perhaps your specific COM application may need to change their values.
Now we're ready to double-check that the Options tab's settings are correct. So click the Options tab, and then make sure the wizard looks like the following, Figure 4:
You may want to change these settings depending upon your specific application, but for the purposes of this tutorial, these settings are the correct ones to use. Tip: You can get Help on what each setting means very quickly by pausing the mouse pointer over the setting you want to learn more about.
The choices I made that were different from the defaults were:
Once you're satisfied, click Finish. Visual C++. NET 2003 will then generate the resources and source files which go along with our new object. It will probably open new files in the source code editor too. Let's close all the files which are currently open in the editor, so that we can then start afresh for the next step. So the next action in this step is to click the Window menu on the menu bar, and then click Close All Documents.
When we're done using the ATL Simple Object wizard, Class View should look like that shown in Figure 5. There is still one more change we need to make, though. Notice that, in Figure 5, the name of the event interface (for the connection point) is not _IHelloWorldEvents but instead DHelloWorldEvents? This is the result of a little change I made to the code.
_IHelloWorldEvents
DHelloWorldEvents
The DHelloWorldEvents name for our event interface is a loose convention of Microsoft which I'm following. DHelloWorldEvents is a dispinterface, so a D is added in front of its name. Make sense? This is just my own sense of aesthetics run amok...if you don't like the new name, don't change it. However, everything from here on refers to DHelloWorldEvents, not _IHelloWorldEvents.
dispinterface
So this change looks daunting, right? We have to open up each and every file in the entire project and make sure each and every place _IHelloWorldEvents appears, we have a DHelloWorldEvents instead. Actually, there's a great new feature in the Visual C++. NET 2003 editor which will relieve this headache for us. To use the feature, click the Edit menu, and then click Replace. The Replace dialog opens, as shown below, in Figure 6:
There's really not much to write about here, as this looks just like the Replace dialog box of yore. Aha! Under the Search group box, there are radio buttons which specify where you want the Replace to happen. We want our find and replace operation to span the entire project, so click Current Project, as shown above. Next, click Replace All. Visual C++ then shows us the warning as shown, below, in Figure 7:
If all goes well, you should see a dialog appear and rapidly disappear; this is normal, as the dialog box in question is just reporting the progress of the Replace operation across the project! Finally, Visual C++ will report it is done, as is shown in Figure 8, below:
If all went well, Class View should now look exactly like Figure 5. Finally, you need to make sure and save your changes. To do this, click the File menu, and then click Save All. One final thing to do. Apparently the Replace option above replaces the name of a filename in a #include directive in a certain project file, but doesn't change the name of the corresponding .H file. So we need to do it ourselves, in order to avoid a compiler error. Do the following:
#include
#include "DHelloWorldEvents_CP.h"
#include "_IHelloWorldEvents_CP.h"
We've now completed step 3 of this tutorial. We added a simple COM object, called HelloWorld, to the project, and then, for the sake of aesthetics, modified the name of its dispinterface with a project-wide replace operation, which is a great new feature in Visual Studio .NET! Sure, I had my aesthetic reasons, but I really wanted to make the name change of the interface so as to highlight the Replace Across Project feature of Visual Studio .NET.
Before we finish this step, let me take you on a tour of two nice functions that the wizards override for you, with default implementations. These functions let you provide custom handling of what happens on your server the moment CoCreateInstance() succeeds - sort of like a "constructor for COM". In addition, when the last client has called IUnknown::Release() on your object (see other articles or the docs for more info), there's also a function that is provided by the ATL framework which helps you provide custom cleanup of your server's object.
CoCreateInstance()
IUnknown::Release()
These two functions are known, respectively, as FinalConstruct() and FinalRelease(), and in our project are implemented for us in HelloWorld.h, as shown in Listing 3, below. The functions themselves are highlighted for you in bold:
FinalConstruct()
FinalRelease()
class ATL_NO_VTABLE CHelloWorld :
public CComObjectRootEx<CCOMSINGLETHREADMODEL>,
public CComCoClass<CHELLOWORLD, &CLSID_HelloWorld>,
public IConnectionPointContainerImpl<CHELLOWORLD>,
public CProxyDHelloWorldEvents<CHELLOWORLD>,
public IHelloWorld
{
public:
CHelloWorld() // initialize things to NULL or
// zero, but that's it here
{
}
DECLARE_REGISTRY_RESOURCEID(IDR_HELLOWORLD)
DECLARE_NOT_AGGREGATABLE(CHelloWorld)
BEGIN_COM_MAP(CHelloWorld)
COM_INTERFACE_ENTRY(IHelloWorld)
COM_INTERFACE_ENTRY(IConnectionPointContainer)
END_COM_MAP()
BEGIN_CONNECTION_POINT_MAP(CHelloWorld)
CONNECTION_POINT_ENTRY(__uuidof(DHelloWorldEvents))
END_CONNECTION_POINT_MAP()
DECLARE_PROTECT_FINAL_CONSTRUCT()
HRESULT FinalConstruct() // custom initialization here
{
return S_OK;
}
void FinalRelease() // custom cleanup here
{
}
public:
};
OBJECT_ENTRY_AUTO(__uuidof(HelloWorld), CHelloWorld)
Note that the return type of FinalConstruct() is HRESULT. So if nothing else fails during CoCreateInstance(), FinalConstruct() is called last during this process, if the reference count before was zero. So, if your logic fails inside the FinalConstruct() body, you can return whatever HRESULT or DWORD Win32 system error code you wish, and that is what the client will see as the return value of the client's CoCreateInstance() call.
HRESULT
DWORD
In COM, you never know with certainty when the operating system will call the constructor or destructor. That's right, COM wrests that control away from you. All you can know is when the first client has called CoCreateInstance() (or some flavor thereof) on your object, and when the final client has called IUnknown::Release(). Notice that since COM objects are reference-counted, the two functions above are only called on the first CoCreateInstance() and the last IUnknown::Release(). So be careful which logic you put in these functions.
Say, for example, your COM object owns - and keeps track of - a Hashable. So calling FinalConstruct() is the great place to have the object, say, read configuration values in from a file and store them in the hash, for later use when the methods are called. And if your hash maps, e.g., strings to pointers, you're going to want to free the memory associated with those pointers once the reference count on this object drops to zero and Windows wants to destroy the object. So you then override FinalRelease() and supply it with the code to iterate through your hash, looking up and then freeing the memory addressed by each of the pointers.
Hashable
To proceed to the next step, which is step 4, click the Next >> link below. Click on << Back below to visit step 2 and refresh your memory, or even step 1., this may help. Also, it could be because there are still more steps yet as to the reason why, so that I can make these articles better for. | https://www.codeproject.com/Articles/12558/DCOM-D-Mystified-NET-A-DCOM-Tutorial-Step?msg=2068035 | CC-MAIN-2016-50 | refinedweb | 1,567 | 68.5 |
I am a long time eclipse user and I have started to play around with IntelliJ Idea IDE.
So from my understanding. A project in IntelliJ is the same as the Eclipse Workspace. As well, a module in IntelliJ is the equivalent of a project in eclipse.
I created a project in IntelliJ, still not sure why there is a src folder in it if it is supposed to be a workspace...
Afterwards, I create a Module in the project. I created a class inside the src of the module. The code I made inside the class is the following:
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
public class MainClass {
public static void main(String[] args) throws FileNotFoundException {
System.out.println("Hello World!");
Scanner input = new Scanner(new File ("test123.txt"));
String answer = input.nextLine();
System.out.println(answer);
}
}
just move the file directly to the project folder which calls "Java" (so the main folder) (next to the blue-blurred strip you made :P)
or if it doesnt help, then move the test123.txt file to FirstJavaProgram directory
you can also change filename to one of these:
1)
src/test123.txt
2)
FirstJavaProgram/src/test123.txt
I am not sure which one will be fine in your case | https://codedump.io/share/ZYsRAZErxB9j/1/reading-files-with-intellij-idea-ide | CC-MAIN-2017-30 | refinedweb | 213 | 77.03 |
Although Python is a popular language, in the high-performance world, it is not known for being fast. A number of tactics have been employed to make Python faster. We look at three: Numba, Cython, and ctypes.
High-Performance Python – Compiled Code and C Interface
Python is one of the fastest growing languages for computing, the number one language for deep learning, and in the top three for machine learning. Literally thousands of Python add-on modules can be used for everything from plotting data to communicating with embedded hardware.
One of the common complaints about Python is that it is too slow, partly because it is interpreted and partly because of the Global Interpreter Lock (GIL), a mutex that prevents multiple threads from executing Python bytecodes at once. People started coming up with tools to improve the performance of Python. These tools usually take the form of compiling Python or interfacing compiled languages with Python.
In the next set of articles, I cover some tools that you can use to improve the performance of Python. The articles are generally presented in the following manner:
- Compilation (JIT and static) and interface with C
- Interfacing Python and Fortran
- GPUs and Python
- Dask, Networking, and Python module combinations
Not all of the tools in each category will be covered, but I’ll present some of the major tools.
In this and future articles in the series, I use the Anaconda distribution of Python. It has some of the more current tools available, but it doesn’t have everything, so some tools that aren’t available in Anaconda won’t be presented.
In this article, I investigate compiling Python code with a just-in-time (JIT) compiler, a tool for compiling Python code into compiled C code that can be used as a module within Python, and a tool to compile existing C code into Python modules. The goal of all three of these tools is to make Python code faster.
Compiling Python with Numba
Numba is an open source JIT compiler that translates a subset of Python and NumPy code into fast machine code at run time; hence, the “JIT” designation. Numba uses the LLVM compiler library for ultimately compiling the code. You can also write CUDA kernels with Numba. Numba has support for automatic parallelization of loops, generation of GPU-accelerated code (both Nvidia and AMD), and the creation of universal functions (ufuncs) and C callbacks. The compiler is under continual development, with the addition of more capability, more performance, and more NumPy functions.
A ufunc operates on an ndarray, element by element. You can think of ufuncs as being a “vectorized” wrapper for a function that takes a fixed number of inputs and produces a fixed number of outputs. Ufuncs are very important to Numba.
Numba takes the Python function, optimizes it, and then converts it into Numba’s intermediate representation. Type inference follows, and the code is converted into LLVM-interpretable code. The resulting code is then fed to LLVM’s JIT compiler to output machine code.
You see the most benefit with Numba on functions that have a great deal of arithmetic intensity (lots of computations). An example would be routines that have loops. Although you can compile Python functions that don’t have loops, they might run slower than the original Python code.
Decorators
Decorators are a really cool part of Python that allow you to call higher order functions. A decorator function takes another function and extends it without explicitly modifying it. In essence, it is a wrapper to existing functions. An in-depth explanation is beyond the scope of this article focused on high-performance Python, but you can read about decorators online.
Numba uses decorators to extend the functions to be compiled by the JIT compiler and has a number of decorators that can be used as part of the JIT compiler, depending on how you import number:
- @jit (compile Python code with automatic parallelization)
- @njit (compile Python and ignore the GIL)
- @generated_jit (flexible specializations)
- @jitclass (compile Python classes)
- @cfunc (create C callbacks)
- @stencil (specify a stencil kernel)
- @vectorize (allow scalar arguments to be used as NumPy ufuncs)
Even Nvidia GPUs have a decorator,
- @cuda.jit
as do AMD ROCm GPUs:
- @roc.jit
Before I show examples, remember that when using a decorator, the code has to be something Numba can compile and have relatively high arithmetic intensity (e.g., loops). Numba can compile lots of Python code but if it runs slower than the native Python code, why use it?
When you first use a decorator such as @jit, the “decorated” code is compiled; therefore, if you time functions, the first pass through the code will include the compilation time. Fortunately, Numba caches the functions as machine code for subsequent usage. If you use the function a second time, it will not include the compilation time (unless you’ve changed the code). This also assumes that you are using the same argument types.
You can pass arguments to the @jit decorator. Numba has two compilation modes: nopython and object. In general, nopython produces much faster code, but it has a limitation that can force Numba to fall back to object (slower) mode. To prevent this from happening and raising an error, you should pass the option nopython=true to the JIT compiler.
Another argument that can be passed is nogil. The GIL prevents threads from colliding within Python. If you are sure that your code is consistent, has no race conditions, and does not require synchronization, you can use nogil=true. Consequently, Numba will release the GIL when entering a compiled function. Note that you can’t use nogil when you are in object mode.
A third argument that can be use with the @jit decorator is parallel. If you pass the argument parallel=true, Numba will do a transformation pass that attempts to parallelize portions of code, as well as other optimizations, automatically. In particular, Numba supports explicit parallel loops. However, it has to be used with nopython=true. Currently, I believe the parallel option only works with CPUs.
A really cool feature of the code transformation pass through the function is that when you use the parallel=true option, you can use Numba’s prange function instead of range, which tells Numba that the loop can be parallelized. Just be sure that the loop does not have cross-iteration dependencies, except for unsupported reductions (those will be run single threaded).
As mentioned previously, when you execute decorated Python code that Numba understands, it is compiled to machine code with LLVM. This compilation happens the first time you execute the code. The example code in Listing 1 is borrowed from a presentation by Matthew Rocklin. It was run in a Jupyter notebook to get the timings.
Listing 1: Python First Run Without Numba
import numpy def sum(x): total = 0 for i in range(x.shape[0]): total +=x[i] return total x = numpy.arange(10_000_000); %time sum(x) CPU times: user 1.63 s, sys: 0 ns, total: 1.63 s Wall time: 1.63 s
Next, add Numba into the code (Listing 2) so the @jit decorator can be used. (Don’t forget to import that Numba module.)
Listing 2: Python First Run With Numba
import numba import numpy @numba.jit def sum(x): total = 0 for i in range(x.shape[0]): total +=x[i] return total x = numpy.arange(10_000_000); %time sum(x) CPU times: user 145 ms, sys: 4.02 ms, total: 149 ms Wall time: 149 ms
A speedup is nice to see, but believe it or not, quite a bit of the time is spent compiling the function. Recall that the first pass through the code compiles it. Subsequent passes do not:
CPU times: user 72.3 ms, sys: 8 µs, total: 72.3 ms Wall time: 72 ms
Notice that the run time the second time is half of the first, so about 70ms were used to compile the code and about 70ms to run the code the first time around. The second time, the code wasn’t compiled, so it only took a little more than 70ms to run. | https://www.admin-magazine.com/HPC/Articles/High-Performance-Python-1 | CC-MAIN-2021-25 | refinedweb | 1,366 | 62.58 |
Object detection is a computer technology related to computer vision and image processing that deals with detecting instances of semantic objects of a certain class ( such as human faces, cars, fruits, etc. ) in digital images and videos.
In this tutorial, we will be building a simple Python script that deals with detecting human faces in an image, we will be using Haar Cascade Classifiers in OpenCV library.
Note: It is worth to mention that you need to distinguish between object detection and object classification, object detection is about detecting some specific object and where it is located in an image, while object classification is recognizing which class the object belongs to. If you are interested in image classification, head to this tutorial.
Haar feature-based cascade classifiers is a machine learning based approach where a cascade function is trained from a lot of positive and negative images. It is then used to detect objects in other images.
The nice thing about haar feature-based cascade classifiers is that you can make a classifier of any object you want, OpenCV already provided some classifier parameters to you, so you don't have to collect any data to train on it.
To get started, install the requirements:
pip3 install opencv-python
Alright, create a new Python file and follow along, let's first import OpenCV:
import cv2
You gonna need a sample image to test with, make sure it has clear front faces in it, I will use this stock image that contains two nice lovely kids:
The function imread() loads an image from the specified file and returns it as a numpy N-dimensional array.
Before we detect faces in the image, we will first need to convert the image to grayscale, that is because the function we gonna use to detect faces expects a grayscale image:
# converting to grayscale image_gray = cv2.cvtColor(image, cv2.COLOR_BGR2GRAY)
The function cvtColor() converts an input image from one color space to another, we specified cv2.COLOR_BGR2GRAY code, which means converting from BGR ( Blue Green Red ) to grayscale.
Since this tutorial is about detecting human faces, go ahead and download the haar cascade for human face detection in this list. More precisely, "haarcascade_frontalface_default.xml". Let's put it in a folder called "cascades" ( or whatever ) and then load it:
# initialize the face recognizer (default face haar cascade) face_cascade = cv2.CascadeClassifier("cascades/haarcascade_fontalface_default.xml")
Let's now detect all the faces in the image:
# detect all the faces in the image faces = face_cascade.detectMultiScale(image_gray) # print the number of faces detected print(f"{len(faces)} faces detected in the image.")
detectMultiScale() function takes an image as parameter and detects objects of different sizes as a list of rectangles, let's draw these rectangles in the image:
# for every face, draw a blue rectangle for x, y, width, height in faces: cv2.rectangle(image, (x, y), (x + width, y + height), color=(255, 0, 0), thickness=2)
Finally, let's save the new image:
# save the image with rectangles cv2.imwrite("kids_detected.jpg", image)
Here is my resulting image:
Pretty cool, right? Feel free to use other object classifiers, other images and even more interesting, use your webcam ! Here is the code for that:
import cv2 # create a new cam object cap = cv2.VideoCapture(0) # initialize the face recognizer (default face haar cascade) face_cascade = cv2.CascadeClassifier("cascades/haarcascade_fontalface_default.xml") while True: # read the image from the cam _, image = cap.read() # converting to grayscale image_gray = cv2.cvtColor(image, cv2.COLOR_BGR2GRAY) # detect all the faces in the image faces = face_cascade.detectMultiScale(image_gray, 1.3, 5) # for every face, draw a blue rectangle for x, y, width, height in faces: cv2.rectangle(image, (x, y), (x + width, y + height), color=(255, 0, 0), thickness=2) cv2.imshow("image", image) if cv2.waitKey(1) == ord("q"): break cap.release() cv2.destroyAllWindows()
Once you execute that ( if you have a webcam of course ), it will open up your webcam and start drawing blue rectangles around all front faces in the image. The code isn't that challenging, all I changed is, instead of reading the image from a file, I created a VideoCapture object that reads from it every time in a while loop, once you press the q button, the main loop will end.
Check the official OpenCV documentation for Face Detection.
Alright, this is it for this tutorial, you can get all tutorial materials ( including the testing image, the haar cascade, and the full code ) here.
Happy Coding ♥View Full Code | https://www.thepythoncode.com/article/detect-faces-opencv-python | CC-MAIN-2020-05 | refinedweb | 751 | 51.28 |
PUTENV(3) Linux Programmer's Manual PUTENV(3)
putenv - change or add an environment variable
#include <stdlib.h> int putenv(char *string); Feature Test Macro Requirements for glibc (see feature_test_macros(7)): putenv(): _XOPEN_SOURCE || /* Glibc since 2.19: */ _DEFAULT_SOURCE || /* Glibc versions <= 2.19: */ _SVID_SOURCE.
The putenv() function returns zero on success, or nonzero if an error occurs. In the event of an error, errno is set to indicate the cause.
ENOMEM Insufficient space to allocate new environment.putenv() │ Thread safety │ MT-Unsafe const:env │ └──────────┴───────────────┴─────────────────────┘
POSIX.1-2001, POSIX.1-2008, SVr4, 4.3BSD.
The.
clearenv(3), getenv(3), setenv(3), unsetenv(3), environ(7)
This page is part of release 4.16 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. GNU 2016-03-15 PUTENV(3)
Pages that refer to this page: clearenv(3), getenv(3), pam_putenv(3), setenv(3), proc(5), environ(7) | http://man7.org/linux/man-pages/man3/putenv.3.html | CC-MAIN-2018-26 | refinedweb | 161 | 60.51 |
#include <zookeeper.hpp>
authenticate synchronously.
create a node synchronously..
checks the existence of a node in zookeeper synchronously.
gets the data associated with a node synchronously.
lists the children of a node synchronously.
get the current session id.
The current session id or 0 if no session is established.
get the state of the zookeeper connection.
The return value will be one of the State Consts.
return a message describing the return code.
delete a node in zookeeper synchronously.
returns whether or not the specified return code implies the operation can be retried "as is" (i.e., without needing to change anything).
sets the data associated with a node. | http://mesos.apache.org/api/latest/c++/classZooKeeper.html | CC-MAIN-2018-51 | refinedweb | 109 | 63.76 |
If you create a toolbox that works with MathWorks® products, even if it only contains a few functions, you can include custom documentation in the form of HTML help files. Custom documentation for your toolbox can include figures, diagrams, screen captures, equations, and formatting to make your toolbox help more usable.
To display properly, your custom documentation must contain these files:
HTML help files — These files contain your custom documentation information.
info.xml file —
This file enables MATLAB® to find and identify your HTML help files.
helptoc.xml file
— This file contain the Table of Contents for your documentation that
displays in the Contents pane of the Help browser. This
file must be stored in the folder that contains your HTML help files.
Search database (optional) — These files enable searching in your HTML help files.
To view your custom documentation, open the Help browser and navigate to the home page. At the bottom of the home page, under Supplemental Software, click the name of your toolbox. Your help opens in the current window.
You can create HTML help files in any text editor or web publishing software. To create help files in MATLAB, use either of these two methods:
Create a live script (
*.mlx) and export it to HTML.
For more information, see Share Live Scripts and Functions.
Create a script (
*.m), and publish it to HTML. For
more information, see Publish and Share MATLAB Code.
Store all your HTML help files in one folder, such as an
html
subfolder in your toolbox folder. This folder must be:
On the MATLAB search path
Outside the
folder
matlabroot
Outside any installed hardware support package help folder
Documentation sets often contain:
A roadmap page (that is, an initial landing page for the documentation)
Examples and topics that explain how to use the toolbox
Function or block reference pages
info.xmlFile
The
info.xml file describes your custom documentation,
including the name to display for your documentation. It also identifies where to
find your HTML help files and the
helptoc.xml file. Create a file
named
info.xml for each toolbox you document.
To create
info.xml to describe your toolbox, you can adapt this
template:
<productinfo xmlns: <?xml-stylesheet type="text/xsl"href="optional"?> <matlabrelease>R2016b</matlabrelease> <name>MyToolbox</name> <type>toolbox</type> <icon></icon> <help_location>html</help_location> </productinfo>
info.xmlby using the template
info_template.xmlincluded with the MATLAB documentation. To create and edit a copy of the template file in your current folder, run this code in the command window:
copyfile(fullfile(matlabroot,'help','techdoc','matlab_env',... 'examples','templates','info_template.xml'),pwd) fileattrib('info_template.xml','+w') edit('info_template.xml')
The following table describes the required elements of the
info.xml file.
You also can include comments in your
info.xml file, such as
copyright and contact information. Create comments by enclosing the text on a line
between
<!-- and
-->.
When you create the
info.xml file, make sure that:
You include all required elements.
The entries are in the same order as in the preceding table.
File and folder names in the XML exactly match the names of your files and folders and are capitalized identically.
The
info.xml file is in a folder on the MATLAB search path.
Note
MATLAB parses the
info.xml file and
displays your documentation when you add the folder that contains
info.xml to the path. If you created an
info.xml file in a folder already on the
path, remove the folder from the path. Then add the folder again, so
that MATLAB parses the file. Make sure that the folder you are
adding is not your current folder.
helptoc.xmlFile
The
helptoc.xml file defines the hierarchy of help files
displayed in the Contents pane of the Supplemental Software
browser.
You can create a
helptoc.xml file by using the template
included with the MATLAB documentation. To create and edit a copy of the template file
helptoc_template.xml in your current folder, run this code in
the Command
Window:
copyfile(fullfile(matlabroot,'help','techdoc','matlab_env',... 'examples','templates','helptoc_template.xml'),pwd) fileattrib('helptoc_template.xml','+w') edit('helptoc_template.xml')
Place the
helptoc.xml file in the folder that contains your
HTML documentation files. This folder must be referenced as the
<help_location> in your
info.xml
file.
Each
<tocitem> entry in the
helptoc.xml file references one of your HTML help files. The
first
<tocitem> entry in the
helptoc.xml
file serves as the initial landing page for your documentation.
Within the top-level
<toc> element, the nested
<tocitem> elements define the structure of your table
of contents. Each
<tocitem> element has a
target attribute that provides the file name. File and path
names are case-sensitive.
When you create the
helptoc.xml file, make sure that:
The location of the
helptoc.xml files is listed as the
<help_location> in your
info.xml file.
All file and path names exactly match the names of the files and folders, including capitalization.
All path names use URL file path separators (/). Windows style file path
separators (
\) can cause the table of contents to display
incorrectly. For example, if you have an HTML help page
firstfx.html located in a subfolder called
refpages within the main documentation folder, the
<tocitem>
target attribute value for that page would be
refpages/firstfx.html.
helptoc.xmlFile
Suppose that you have created the following HTML files:
A roadmap or starting page for your toolbox,
mytoolbox.html.
A page that lists your functions,
funclist.html.
Three function reference pages:
firstfx.html,
secondfx.html, and
thirdfx.html.
An example,
myexample.html.
Include file names and descriptions in a
helptoc.xml file
as follows:
<?xml version='1.0' encoding="utf-8"?> <toc version="2.0"> <tocitem target="mytoolbox.html">My Toolbox <tocitem target="funclist.html">Functions <tocitem target="firstfx.html">first</tocitem> <tocitem target="secondfx.html">second</tocitem> <tocitem target="thirdfx.html">third</tocitem> </tocitem> <tocitem target="myexample.html">My Example </tocitem> </tocitem> </toc>
This
helptoc.xml file, paired with a properly formulated
info.xml file, produced this display in the Help
browser.
To make your documentation searchable, create a search database, also referred to
as a search index, using the
builddocsearchdb command. When using
this command, specify the complete path to the folder that contains your HTML
files.
For example, suppose that your HTML files are in
C:\MATLAB\MyToolbox\html. This command creates a searchable
database for those files:
builddocsearchdb('C:\MATLAB\MyToolbox\html')
builddocsearchdb creates a subfolder of
C:\MATLAB\MyToolbox\html named
helpsearch-v3, which contains the database files.
To search for terms in your toolbox, open the Help browser, and in the Search Documentation field, enter the term you want to search for. Then, on the left side of the page, under Refine by Source, select Supplemental Software to view the results for your toolbox.
Beginning with MATLAB R2014b, you can maintain search indexes side by side. For instance, if
you already have a search index for MATLAB R2014a or earlier, run
builddocsearchdb against
your help files using MATLAB R2014b. Then, when you run any MATLAB release, the help browser automatically uses the appropriate index for
searching your documentation database.
info.xmlFiles
When MATLAB finds an
info.xml file on the search path or in
the current folder, it automatically validates the file against the supported
schema. If there is an invalid construct in the
info.xml
file, MATLAB displays an error in the Command Window. The error is typically of
the form:
Warning: File <yourxmlfile.xml> did not validate. ...
An
info.xml validation error can occur when you start
MATLAB or add folders to the search path.
The primary causes of an XML file validation error are:
Entities are missing or out of order in the
info.xml file.
An unrelated
info.xml file exists.
Syntax errors in the
info.xml file.
MATLAB is trying to access an outdated
info.xml file for a MathWorks product.
info.xml
If you do not list required XML elements in the prescribed order, you receive an XML validation error:
Often, errors result from incorrect ordering of XML tags. Correct the error by updating the info.xml file contents to follow the guidelines in the MATLAB help documentation.
info.xmlfile and their required ordering, see Create info.xml File.
info.xmlFile
Suppose that you have a file named
info.xml that has
nothing to do with custom documentation. Because this
info.xml file is an unrelated file, if it causes an
error, you can safely ignore it. To prevent the error message from reoccurring,
rename the unrelated
info.xml file. Alternatively, ensure
that the file is not on the search path or in the current folder.
info.xmlFile.
Use the error message to isolate the problem or use any XML schema validator.
For more information about the structure of the
info.xml
file, consult its schema at
matlabroot
/sys/namespace/info/v1/info.xsd.
info.xmlFile for a MathWorks Product
If you have an
info.xml file from a different version of
MATLAB, that file could contain constructs that are not valid with your
version. To identify an
info.xml file from another version,
look at the full path names reported in the error message. The path usually
includes a version number, for example,
...\MATLAB\R14\....
In this situation, the error is not actually causing any problems, so you can
safely ignore the error message. To ensure that the error does not reoccur,
remove the offending
info.xml file. Alternatively, remove the
outdated
info.xml file from the search path and out of the
current folder. | https://nl.mathworks.com/help/matlab/matlab_prog/display-custom-documentation.html | CC-MAIN-2020-40 | refinedweb | 1,589 | 60.21 |
Plot Module
Introduction
FreeCAD is able to perform plots using the matplotlib Python library. A module is provided to this end, as an external add-on in version 0.19 and as a core component from version 0.20 on. Older versions of FreeCAD are not covered in this documentation.
The produced plots offer the standard matplotlib tools to edit and save. On top of that, a
Plot Workbench is provided as an external add-on offering more complete tools to edit the plot and save it. The add-on can be installed with the Add-on manager.
Module
The module can be invoked in a Python console or in a macro. The first thing you must do is importing the module. In FreeCAD 0.19 you must first install the
Plot Workbench using the Add-on manager, and then you can import Plot by typing:
from freecad.plot import Plot
From FreeCAD 0.20 on plot module is already packaged within the program, so you don't need to install any add-on, but just type
from FreeCAD.Plot import Plot
After that, you can plot a straight line from (0,0) to (1,2) just simply typing
Plot.plot([0, 1], [0, 2])
You can find more complex examples in the Plot Basic tutorial and the Plot MultiAxes tutorial.
Workbench Tools
If you decide to install the
Plot Workbench using the Add-on manager, you will have the following tools available to manage the plots created with the module: and macros for examples.
Tutorial
> | https://wiki.freecadweb.org/index.php?title=Plot_Workbench/bg&oldid=1049076 | CC-MAIN-2022-27 | refinedweb | 256 | 64.81 |
Tuple<T1, T2, T3, T4, T5>.Item1 Property
Gets the value of the current Tuple<T1, T2, T3, T4, T5> object's first component.
Assembly: mscorlib (in mscorlib.dll)
You can dynamically determine the type of the Item1 component in one of two ways:
By calling the GetType method on the value that is returned by the Item1 property.
By retrieving the Type object that represents the Tuple<T1, T2, T3, T4, T5> object, and retrieving the first element from the array that is returned by its Type.GetGenericArguments method.
The following example defines an array of Tuple<T1, T2, T3, T4, T5> objects whose components contain the name of a state in the United States, its population in 1990 and 2000, its population change in this 10-year period, and the percentage change in its population. It then iterates through the array and displays the value of each component in a tuple.
using System; public class Example { public static void Main() { // Define array of tuples reflecting population change by state, 1990-2000. Tuple<string, int, int, int, double>[] statesData = { Tuple.Create("California", 29760021, 33871648, 4111627, 13.8), Tuple.Create("Illinois", 11430602, 12419293, 988691, 8.6), Tuple.Create("Washington", 4866692, 5894121, 1027429, 21.1) }; // Display the items of each tuple Console.WriteLine("{0,-12}{1,18}{2,18}{3,15}{4,12}\n", "State", "Population 1990", "Population 2000", "Change", "% Change"); foreach(Tuple<string, int, int, int, double> stateData in statesData) Console.WriteLine("{0,-12}{1,18:N0}{2,18:N0}{3,15:N0}{4,12:P1}", stateData.Item1, stateData.Item2, stateData.Item3, stateData.Item4, stateData.Item5/100); } } // The example displays the following output: // State Population 1990 Population 2000 Change % Change // // California 29,760,021 33,871,648 4,111,627 13.8 % // Illinois 11,430,602 12,419,293 988,691 8.6 % // Washington 4,866,692 5,894,121 1,027,429 21.1 %
Available since 8
.NET Framework
Available since 4.0
Portable Class Library
Supported in: portable .NET platforms
Silverlight
Available since 4.0
Windows Phone Silverlight
Available since 8.0
Windows Phone
Available since 8.1 | https://msdn.microsoft.com/en-us/library/dd413591 | CC-MAIN-2017-04 | refinedweb | 350 | 51.04 |
Deploy an application to Cloud Run for Anthos
Learn how to use the Google Cloud console to deploy a prebuilt sample container to run as a Cloud Run for Anthos service.
Before you begin
You must have access to the Google Cloud project and Anthos cluster where Cloud Run for Anthos is installed. For details, see Cloud Run for Anthos fleet installation overview.
Tip: See the Anthos tutorial for details about the shortest path to setting up an Anthos environment that includes a GKE cluster and Anthos Service Mesh.
Deploying a sample container
Use the Google Cloud console to deploy a sample container and create a service in your cluster:
In the Google Cloud console, go to the Cloud Run for Anthos page.
Go to Cloud Run for Anthos
Select the Google Cloud project in which your Anthos cluster resides.
In the list of available clusters, click Login to connect.
Open the Create service form by clicking Create service.
In the available clusters dropdown menu, select your cluster.
Leave
defaultas the name of the namespace where you want your service to run.
Enter a service name of your choice. For example,
hello.
Click Next.
Select Deploy one revision from an existing container image, then select hello from in the Demo containers list.
Click Next.
Select External under Connectivity, so that you can access your service from the web.
Click Create to deploy the
helloimage to Cloud Run for Anthos and wait for the deployment to finish.
Congratulations! You have just deployed a service to a Cloud Run for Anthos enabled cluster.
Accessing your deployed service
Now that you have a service running, you can to send requests to it. In this section, the default test domain is used to demonstrate how to access your service and verify that it's working:
In the Google Cloud console, go to the Cloud Run for Anthos page.
Go to Cloud Run for Anthos
Click the name of your new Cloud Run for Anthos service to open the Service details page. For example, hello.
At the top of the page, click the URL to access your deployed service through your web browser. For example, if you named your service
hello, the URL is similar to the following but includes your cluster's external IP address:
Congratulations! Your Cloud Run for Anthos service is live and handling requests.
Clean up
You can delete the Cloud Run for Anthos service to avoid incurring costs from running those resources.
The following considerations apply to deleting a service:
- Deleting a service deletes all resources related to this service, including all revisions of this service whether they are serving traffic or not.
- Deleting a service does not automatically remove container images from Container Registry. To delete container images used by the deleted revisions from Container Registry, refer to Deleting images.
- Deleting a service with one or more Eventarc triggers does not automatically delete these triggers. To delete the triggers refer to Manage triggers.
- After deletion, the service remains visible in the Google Cloud console and in the command line interface until the deletion is fully complete. However, you cannot update the service.
- Deleting a service is permanent: there is no undo or restore. However, if after deleting a service, you deploy a new service with the same name in the same region, it will have the same endpoint URL.
To permanently delete the service and all its resources:
Go to Cloud Run for Anthos
In the services list, locate the Cloud Run for Anthos service that you created and click its checkbox to select it.
Click DELETE.
What's next
To learn how to build a container from code source, push to Container Registry, and then deploy, see:
To learn more about how Cloud Run for Anthos works, see the Architectural overview. | https://cloud.google.com/anthos/run/docs/deploy-application?hl=el | CC-MAIN-2022-40 | refinedweb | 633 | 61.67 |
OT: tax on import goods?
Discussion in 'Digital Photography' started by Chef!,:
- 561
- Frank.b
- Nov 22, 2004
import taxmewthree, Mar 2, 2005, in forum: Computer Support
- Replies:
- 2
- Views:
- 473
- cluedweasel
- Mar 2, 2005
Canon 300D - Buying from the US (how much for import tax?)Savas Parastatidis, Feb 5, 2004, in forum: Digital Photography
- Replies:
- 18
- Views:
- 1,496
- Lansbury
- Feb 7, 2004
import tax for lensJim, Dec 27, 2005, in forum: Digital Photography
- Replies:
- 1
- Views:
- 367
- Terry Paget
- Dec 27, 2005
Whosale Goods ! No tax !kalvin, Jun 7, 2010, in forum: Computer Support
- Replies:
- 0
- Views:
- 393
- kalvin
- Jun 7, 2010 | http://www.velocityreviews.com/threads/ot-tax-on-import-goods.259493/ | CC-MAIN-2014-35 | refinedweb | 104 | 67.89 |
Working with Persistent Objects
The %Persistent class is the API for objects that can be saved (written to disk). This chapter describes how to use this API. Information in this chapter applies to all subclasses of %Persistent.
Also see the chapters “Introduction to Persistent Objects,” “Defining Persistent Classes,” and “Other Options for Persistent Classes.”
Most of the samples shown in this chapter are from the Samples-Data sample (). InterSystems recommends that you create a dedicated namespace called SAMPLES (for example) and load samples into that namespace. For the general process, see Downloading Samples for Use with InterSystems IRIS®.
Saving Objects
To save an object to the database, invoke its %Save() method. For example:
Set obj = ##class(MyApp.MyClass).%New() Set obj.MyValue = 10 Set sc = obj.%Save()
The %Save() method returns a %Status value that indicates whether the save operation succeeded or failed. Failure could occur, for example, if an object has invalid property values or violates a uniqueness constraint; see “Validating Objects” in the previous chapter.
Calling %Save() on an object automatically saves all modified objects that can be “reached” from the object being saved: that is, all embedded objects, collections, streams, referenced objects, and relationships involving the object are automatically saved if needed. The entire save operation is carried out as one transaction: if any object fails to save, the entire transaction fails and rolls back (no changes are made to disk; all in-memory object values are what they were before calling %Save()).
When an object is saved for the first time, the default behavior is for the %Save() method to automatically assign it an object ID value that is used to later find the object within the database. In the default case, the ID is generated using the $Increment function; alternately, the class can use a user-provided object ID based on property values that have an idkey index (and, in this case, the property values cannot include the string “||”) . Once assigned, you cannot alter the object ID value for a specific object instance (even if it is a user-provided ID).
You can find the object ID value for an object that has been saved using the %Id() method:
// Open person "22" Set person = ##class(Sample.Person).%OpenId(22) Write "Object ID: ",person.%Id(),!
In more detail, the %Save() method does the following:
First it constructs a temporary structure known as a “SaveSet.” The SaveSet is simply a graph containing references to every object that is reachable from the object being saved. (Generally, when an object class A has a property whose value is another object class B, an instance of A can “reach” an instance of B.) The purpose of the SaveSet is to make sure that save operations involving complex sets of related objects are handled as efficiently as possible. The SaveSet also resolves any save order dependencies among objects.
As each object is added to the SaveSet, its %OnAddToSaveSet() callback method is called, if present.
It then visits each object in the SaveSet in order and checks if they are modified (that is, if any of their property values have been modified since the object was opened or last saved). If an object has been modified, it will then be saved.
Before being saved, each modified object is validated (its property values are tested; its %OnValidateObject() method, if present, is called; and then its uniqueness constraints are tested); if the object is valid, the save proceeds. If any object is invalid, then the call to %Save() fails and the current transaction is rolled back.
Before and after saving each object, the %OnBeforeSave() and %OnAfterSave() callback methods are called, if present. Similarly, any defined BEFORE INSERT, BEFORE UPDATE, AFTER INSERT, and AFTER UPDATE triggers are called as well.
These callbacks and triggers are passed an Insert argument, which indicates whether an object is being inserted (saved for the first time) or updated.
If one of these callback methods or triggers fails (returns an error code) then the call to %Save() fails and the current transaction is rolled back.
Lastly, the %OnSaveFinally() callback method is called, if present.
This callback method is called after the transaction has completed and the status of the save has been finalized.
If the current object is not modified, then %Save() does not write it to disk; it returns success because the object did not need to be saved and, therefore, there is no way that there could have been a failure to save it. In fact, the return value of %Save() indicates that the save operation either did all that it was asked or it was unable to do as it was asked (and not specifically whether or not anything was written to disk).
In a multi-process environment, be sure to use proper concurrency controls; see “Object Concurrency Options.”
Rollback
The %Save() method automatically saves all the objects in its SaveSet as a single transaction. If any of these objects fail to save, then the entire transaction is rolled back. In this rollback, InterSystems IRIS does the following:
It reverts assigned IDs.
It recovers removed IDs.
It recovers modified bits.
It invokes the %OnRollBack() callback method, if implemented, for any object that had been successfully serialized.
InterSystems IRIS does not invoke this method for an object that has not been successfully serialized, that is, an object that is not valid.
Saving Objects and Transactions
As noted previously, the %Save() method automatically saves all the objects in its SaveSet as a single transaction. If any of these objects fail to save, then the entire transaction is rolled back.
If you wish to save two or more unrelated objects as a single transaction, however, you must enclose the calls to %Save() within an explicit transaction: that is, you must start the transaction using the TSTART command and end it with the TCOMMIT command.
For example:
// start a transaction TSTART // save first object Set sc = obj1.%Save() // save second object (if first was save) If ($$$ISOK(sc)) { Set sc = obj2.%Save() } // if both saves are ok, commit the transaction If ($$$ISOK(sc)) { TCOMMIT }
There are two things to note about this example:
The %Save() method knows if it is being called within an enclosing transaction (because the system variable, $TLEVEL, will be greater than 0).
If any of the %Save() methods within the transaction fails, the entire transaction is rolled back (the TROLLBACK command is invoked). This means that an application must test every call to %Save() within a explicit transaction and if one fails, skip calling %Save() on the other objects and skip invoking the final TCOMMIT command.
Testing the Existence of Saved Objects
There are two basic ways to test if a specific object instance is stored within the database:
In these examples, the ID is an integer, which is how InterSystems IRIS generates IDs by default. The next chapter describes how you can define a class so that the ID is instead based on a unique property of the object.
Testing for Object Existence with ObjectScript
The %ExistsId() class method checks a specified ID; it returns a true value (1) if the specified object is present in the database and false (0) otherwise. It is available to all classes that inherit from %Persistent. For example:
Write ##class(Sample.Person).%ExistsId(1),! // should be 1 Write ##class(Sample.Person).%ExistsId(-1),! // should be 0
Here, the first line should return 1 because Sample.Person inherits from %Persistent and the SAMPLES database provides data for this class.
You can also use the %Exists() method, which requires an OID rather than an ID. An OID is a permanent identifier unique to the database that includes both the ID and the class name of the object. For more details, see Identifiers for Saved Objects: ID and OID.
Testing for Object Existence with SQL
To test for the existence of a saved object with SQL, use a SELECT statement that selects a row whose %ID field matches the given ID. (The identity property of a saved object is projected as the %ID field.)
For example, using embedded SQL:
&sql(SELECT %ID FROM Sample.Person WHERE %ID = '1') Write SQLCODE,! // should be 0: success &sql(SELECT %ID FROM Sample.Person WHERE %ID = '-1') Write SQLCODE,! // should be 100: not found
Here, the first case should result in an SQLCODE of 0 (meaning success) because Sample.Person inherits from %Persistent and the SAMPLES database provides data for this class.
The second case should result in an SQLCODE of 100, which means that the statement successfully executed but returned no data. This is expected because the system never automatically generates an ID value less than zero.
For more information on embedded SQL, see the chapter “Embedded SQL” in Using InterSystems SQL. For more information on SQLCODE, see “SQLCODE Values and Error Messages” in the InterSystems IRIS Error Reference.
Opening Saved Objects
To open an object (load an object instance from disk into memory), use the %OpenId() method, which is as follows:
classmethod %OpenId(id As %String, concurrency As %Integer = -1, ByRef sc As %Status = $$$OK) as %ObjectHandle
Where:
id is the ID of the object to open.
In these examples, the ID is an integer. The next chapter describes how you can define a class so that the ID is instead based on a unique property of the object.
concurrency is the concurrency level (locking) used to open the object.
sc, which is passed by reference, is a %Status value that indicates whether the call succeeded or failed.
The method returns an OREF if it can open the given object. It returns a null value ("") if it cannot find or otherwise open the object.
For example:
// Open person "10" Set person = ##class(Sample.Person).%OpenId(10) Write "Person: ",person,! // should be an object reference // Open person "-10" Set person = ##class(Sample.Person).%OpenId(-10) Write "Person: ",person,! // should be a null string
You can also use the %Open() method, which requires an OID rather than an ID. An OID is a permanent identifier unique to the database that includes both the ID and the class name of the object. For more details, see Identifiers for Saved Objects: ID and OID.
To perform additional processing that executes when an object opens, you can define the %OnOpen() and %OnOpenFinally() callback methods. For more details, see Defining Callback Methods.
Multiple Calls to %OpenId()
If %OpenId() is called multiple times within an InterSystems IRIS process for the same ID and the same object, only one object instance is created in memory. All subsequent calls to %OpenId() return a reference to the object already loaded into memory.
For example, consider this class featuring multiple %OpenId() calls to the same object:
Class User.TestOpenId Extends %RegisteredObject { ClassMethod Main() { set A = ##class(Sample.Person).%OpenId(1) write "A: ", A.Name set A.Name = "David" write !, "A after set: ", A.Name set B = ##class(Sample.Person).%OpenId(1) write !, "B: ", B.Name do ..Sub() job ..JobSub() hang 1 write !, "D in JobSub: ", ^JobSubD kill ^JobSubD kill A, B set E = ##class(Sample.Person).%OpenId(1) write !, "E:", E.Name } ClassMethod Sub() { set C = ##class(Sample.Person).%OpenId(1) write !, "C in Sub: ", C.Name } ClassMethod JobSub() { set D = ##class(Sample.Person).%OpenId(1) set ^JobSubD = D.Name } }
Calling the Main() method produces these results:
The initial %OpenId() call loads the instance object into memory. The A variable references this object and you can modify the loaded object through this variable.
set A = ##class(Sample.Person).%OpenId(1) write "A: ", A.Name
A: Uhles,Norbert F.
set A.Name = "David" write !, "A after set: ", A.Name
A after set: David
The second %OpenId() call does not reload the object from the database and does not overwrite the changes made using variable A. Instead, variable B references the same object as variable A.
set B = ##class(Sample.Person).%OpenId(1) write !, "B: ", B.Name
B: David
The third %OpenId() call, in the Sub() method, also references the previously loaded object. This method is part of the same InterSystems IRIS process as the Main() method. Variable C references the same object as variables A and B, even though those variables are not available within the scope of this method. At the end of the Sub() method, the process returns back to the Main() method, the variable C is destroyed, and variables A and B are back in scope.
do ..Sub()
ClassMethod Sub() { set C = ##class(Sample.Person).%OpenId(1) write !, "C in Sub: ", C.Name }
C in Sub: David
The fourth %OpenId() call, in the JobSub() method, is run in a separate InterSystems IRIS process by using the JOB command. This new process loads a new instance object into memory, and variable D references this new object.
job ..JobSub() hang 1 write !, "D in JobSub: ", ^JobSubD kill ^JobSubD
ClassMethod JobSub() { set D = ##class(Sample.Person).%OpenId(1) set ^JobSubD = D.Name }
D in JobSub: Uhles,Norbert F.
The fifth %OpenId() call occurs after deleting all variables (A and B) that reference the loaded object in the original process, thereby removing that object from memory. As with the previous %OpenId() call, this call also loads a new instance object into memory, and variable E references this object.
kill A, B set E = ##class(Sample.Person).%OpenId(1) write !, "E:", E.Name
E: Uhles,Norbert F.
To force a reload of an object being loaded multiple times, you can use the %Reload() method. Reloading the object reverts any changes made to the object that were not saved. Any previously assigned variables reference the reloaded version. For example:
set A = ##class(Sample.Person).%OpenId(1) write "A: ", A.Name // A: Uhles,Norbert F. set A.Name = "David" write !, "A after set: ", A.Name // David set B = ##class(Sample.Person).%OpenId(1) write !, "B before reload: ", B.Name // David do B.%Reload() write !, "B after reload: ", B.Name // Uhles,Norbert F. write !, "A after reload: ", A.Name // Uhles,Norbert F.
Concurrency
The %OpenId() method takes an optional concurrency argument as input. This argument specifies the concurrency level (type of locks) that should be used to open the object instance.
If the %OpenId() method is unable to acquire a lock on an object, it fails.
To raise or lower the current concurrency setting for an object, reopen it with %OpenId() and specify a different concurrency level. For example,
set person = ##class(Sample.Person).%OpenId(6,0)
opens person with a concurrency of 0 and the following effectively upgrades the concurrency to 4:
set person = ##class(Sample.Person).%OpenId(6,4)
Specifying a concurrency level of 3 (shared, retained lock) or 4 (shared, exclusive lock) forces a reload of the object when opening it. For more information on the possible object concurrency levels, see Object Concurrency Options.
Swizzling
If you open (load into memory) an instance of a persistent object, and use an object that it references, then this referenced object is automatically opened. This process is referred to as swizzling; it is also sometimes known as “lazy loading.”
For example, the following code opens an instance of Sample.Employee object and automatically swizzles (opens) its related Sample.Company object by referring to it using dot syntax:
// Open employee "101" Set emp = ##class(Sample.Employee).%OpenId(101) // Automatically open Sample.Company by referring to it: Write "Company: ",emp.Company.Name,!
When an object is swizzled, it is opened using the default concurrency value of the class it is a member of, not the concurrency value of the object that swizzles it. See “Object Concurrency Options,” later in this chapter.
A swizzled object is removed from memory as soon as no objects or variables refer to it.
Reading Stored Values
Suppose you have opened an instance of a persistent object, modified its properties, and then wish to view the original value stored in the database before saving the object. The easiest way to do this is to use an SQL statement (SQL is always executed against the database; not against objects in memory).
For example:
// Open person "1" Set person = ##class(Sample.Person).%OpenId(1) Write "Original value: ",person.Name,! // modify the object Set person.Name = "Black,Jimmy Carl" Write "Modified value: ",person.Name,! // Now see what value is on disk Set id = person.%Id() &sql(SELECT Name INTO :name FROM Sample.Person WHERE %ID = :id) Write "Disk value: ",name,!
Deleting Saved Objects
The persistence interface includes methods for deleting objects from the database.
The %DeleteId() Method
The %DeleteId() method deletes an object that is stored within a database, including any stream data associated with the object. This method is as follows:
classmethod %DeleteId(id As %String, concurrency As %Integer = -1) as %Status
Where:
id is the of the object to open.
In these examples, the ID is an integer. The next chapter describes how you can define a class so that the ID is instead based on a unique property of the object.
concurrency is the concurrency level (locking) used when deleting the object.
For example:
Set sc = ##class(MyApp.MyClass).%DeleteId(id)
%DeleteId() returns a %Status value indicating whether the object was deleted or not.
%DeleteId() calls the %OnDelete() callback method (if present) before deleting the object. %OnDelete() returns a %Status value; if %OnDelete() returns an error value, then the object will not be deleted, the current transaction is rolled back, and %DeleteId() returns an error value.
%DeleteId() calls the %OnAfterDelete() callback method (if present) after deleting the object. This call occurs immediately after %DeleteData() is called, provided that %DeleteData() does not return an error. If %OnAfterDelete() returns an error, then the current transaction is rolled back, and %DeleteId() returns an error value.
Lastly, %DeleteId() calls the %OnDeleteFinally() callback method, if present. This callback method is called after the transaction has completed and the status of the deletion has been finalized.
Note that the %DeleteId() method has no effect on any object instances in memory.
You can also use the %Delete() method, which requires an OID rather than an ID. An OID is a permanent identifier unique to the database that includes both the ID and the class name of the object. For more details, see Identifiers for Saved Objects: ID and OID.
The %DeleteExtent() Method
The %DeleteExtent() method deletes every object (and subclass of object) within its extent. Specifically it iterates through the entire extent and invokes the %DeleteId() method on each instance.
The %KillExtent() Method
The %KillExtent() method directly deletes the globals that store an extent of objects (not including data associated with streams). It does not invoke the %DeleteId() method and performs no referential integrity actions. This method is simply intended to serve as a help to developers during the development process. (It is similar to the TRUNCATE TABLE command found in older relational database products.) If you need to delete every object in an extent, including associated stream data, use %DeleteExtent() instead.
%KillExtent() is intended for use only in a development environment and should not be used in a live application. %KillExtent() bypasses constraints and user-implemented callbacks, potentially causing data integrity problems.
Accessing Object Identifiers
If an object has been saved, it has an ID and an OID, the permanent identifiers that are used on disk. If you have an OREF for the object, you can use that to obtain these identifiers.
To find the ID associated with an OREF, call the %Id() method of the object. For example:
write oref.%Id()
To find the OID associated with an OREF, you have two options:
Call the %Oid() method of the object. For example:
write oref.%Oid()
Access the %%OID property of the object. Because this property name contains % characters, you must enclose the name in double quotes. For example:
write oref."%%OID"
Object Concurrency Options
It is important to specify concurrency appropriately when you open or delete objects. You can specify concurrency at several different levels:
You can specify the concurrency argument for the method that you are using.
Many of the methods of the %Persistent class allow you to specify this argument, an integer. This argument determines how locks are used for concurrency control. A later subsection lists the allowed concurrency values.
If you do not specify the concurrency argument in a call to the method, the method sets the argument to -1, which means that InterSystems IRIS uses the value of the DEFAULTCONCURRENCY class parameter for the class you are working with; see the next item.
You can specify the DEFAULTCONCURRENCY class parameter for the associated class. All persistent classes inherit this parameter from %Persistent, which defines the parameter as an expression that obtains the default concurrency for the process; see the next item.
You could override this parameter in your class and specify a hardcoded value or an expression that determines the concurrency via your own rules. In either case, the value of the parameter must be one of the allowed concurrency values discussed later in this section.
You can set the default concurrency mode for a process. To do so, use the $system.OBJ.SetConcurrencyMode() method (which is the SetConcurrencyMode() method of the %SYSTEM.OBJ class).
As in the other cases, you must use one of the allowed concurrency values. If you do not set the concurrency mode for a process explicitly, the default value is 1.
The $system.OBJ.SetConcurrencyMode() method has no effect on any classes that specify an explicit value for the DEFAULTCONCURRENCY class parameter.
To take a simple example, if you open a persistent object using its %OpenId() method without specifying a concurrency value (or you specify a value of -1 explicitly), the class does not specify the DEFAULTCONCURRENCY class parameter, and you do not set the concurrency mode in code, the default concurrency value for the object is set to 1.
Some system classes have the DEFAULTCONCURRENCY class parameter set to a value of 0. Sharded classes always use a concurrency value of 0. To check the concurrency value of an object, examine its %Concurrency property.
Why Specify Concurrency?
The following scenario demonstrates why it is important to control concurrency appropriately when you read or write objects. Consider the following scenario:
Process A opens an object without specifying the concurrency.
SAMPLES>set person = ##class(Sample.Person).%OpenId(5) SAMPLES>write person 1@Sample.Person
Process B opens the same object with the concurrency value of 4.
SAMPLES>set person = ##class(Sample.Person).%OpenId(5, 4) SAMPLES>write person 1@Sample.Person
Process A modifies a property of the object and attempts to save it using %Save() and receives an error status.
SAMPLES>do person.FavoriteColors.Insert("Green") SAMPLES>set status = person.%Save() SAMPLES>do $system.Status.DisplayError(status) ERROR #5803: Failed to acquire exclusive lock on instance of 'Sample.Person'
This is an example of concurrent operations without adequate concurrency control. For example, if process A could possibly save the object back to the disk, it must open the object with concurrency 4 to ensure it can save the object without conflict with other processes. (These values are discussed later in this chapter.) In this case, Process B would then be denied access (failed with a concurrency violation) or would have to wait until Process A releases the object.
Concurrency Values
This section describes the possible concurrency values. First, note the following details:
Atomic writes are guaranteed when concurrency is greater than 0.
InterSystems IRIS acquires and releases locks during operations such as saving and deleting objects; the details depend upon the concurrency value, what constraints are present, lock escalation status, and the storage structure.
In all cases, when an object is removed from memory, any locks for it are removed.
The possible concurrency values are as follows; each value has a name, also shown in the list.
No locks are used.
Locks are acquired and released as needed to guarantee that an object read will be executed as an atomic operation.
InterSystems IRIS does not acquire any lock when creating a new object.
While opening an object, InterSystems IRIS acquires a shared lock for the object, if that is necessary to guarantee an atomic read. InterSystems IRIS releases the lock after completing the read operation.
The following table lists the locks that are present in each scenario:
The same as 1 (atomic read) except that opening an object always acquires a shared lock (even if the lock is not needed to guarantee an atomic read). The following table lists the locks that are present in each scenario:
InterSystems IRIS does not acquire any lock when creating a new object.
While opening an existing object, InterSystems IRIS acquires a shared lock for the object.
After saving a new object, InterSystems IRIS has a shared lock for the object.
The following table lists the scenarios:
When an existing object is opened or when a new object is first saved, InterSystems IRIS acquires an exclusive lock.
The following table lists the scenarios:
Concurrency and Swizzled Objects
An object referenced by a property is swizzled on access using the default concurrency defined by the swizzled object’s class. If the default is not defined for the class, the object is swizzled using the default concurrency mode of the process. The swizzled object does not use the concurrency value of the object that swizzles it.
If the object being swizzled is already in memory, then swizzling does not actually open the object — it simply references the existing in-memory object; in that case, the current state of the object is maintained and the concurrency is unchanged.
There are two ways to override this default behavior:
Upgrade the concurrency on the swizzled object with a call to the %Open() method that specifies the new concurrency. For example:
Do person.Spouse.%OpenId(person.Spouse.%Id(),4,.status)
where the first argument to %OpenId() specifies the ID, the second specifies the new concurrency, and the third (passed by reference) receives the status of the method.
Set the default concurrency mode for the process before swizzling the object. For example:
Set olddefault = $system.OBJ.SetConcurrencyMode(4)
This method takes the new concurrency mode as its argument and returns the previous concurrency mode.
When you no longer need a different concurrency mode, reset the default concurrency mode as follows:
Do $system.OBJ.SetConcurrencyMode(olddefault)
Version Checking (Alternative to Concurrency Argument)
Rather than specifying the concurrency argument when you open or delete an object, you can implement version checking. To do so, you specify a class parameter called VERSIONPROPERTY. All persistent classes have this parameter. When defining a persistent class, the procedure for enabling version checking is:
Create a property of type %Integer that holds the updateable version number for each instance of the class.
For that property, set the value of the InitialExpression keyword to 0.
For the class, set the value of the VERSIONPROPERTY class parameter equal to the name of that property. The value of VERSIONPROPERTY cannot be changed to a different property by a subclass.
This incorporates version checking into updates to instances of the class.
When version checking is implemented, the property specified by VERSIONPROPERTY is automatically incremented each time an instance of the class is updated (either by objects or SQL). Prior to incrementing the property, InterSystems IRIS compares its in-memory value to its stored value. If they are different, then a concurrency conflict is indicated and an error is returned; if they are the same, then the property is incremented and saved.
You can use this set of features to implement optimistic concurrency.
To implement a concurrency check in an SQL update statement for a class where VERSIONPROPERTY refers to a property called InstanceVersion, the code would be something like:
SELECT InstanceVersion,Name,SpecialRelevantField,%ID FROM my_table WHERE %ID = :myid // Application performs operations on the selected row UPDATE my_table SET SpecialRelevantField = :newMoreSpecialValue WHERE %ID = :myid AND InstanceVersion = :myversion
where myversion is the value of the version property selected with the original data. | https://docs.intersystems.com/healthconnectlatest/csp/docbook/DocBook.UI.Page.cls?KEY=GOBJ_persobj | CC-MAIN-2022-27 | refinedweb | 4,633 | 55.84 |
XML Linking TechnologiesXML Linking Technologies>
(library1.xml)>
(library2.xml)>
(expand3.xsl)
XSLT can be used to present the application with a logical structure based on containment, while the actual serialized structure of the source document may be different.>
(library3.xsd)> ]>
(library4.xml)">
(library4.xml)>
(library4.xml)
The transformation needed to expand such references is still more simple than the previous example, and it can be generalized under the assumption that we want to expand all the elements having an href attribute.
<xsl:template <xsl:copy-of </xsl:template>
(expand4.xsl)
(library4.xsd)and the references as:
<xsd:attribute
(library4.xsd).
Let's see how simple an RDF variant of our book catalog document can be. First we have to replace the root element by the mandatory rdf:RDF root element and then define a namespace for our vocabulary.
<rdf:RDF xmlns:
(library5.rdf)
Next we use an rdf:about attribute to identify the element we are describing, using URIs as unique identifiers.
<book rdf:or
<character rdf:
(library5>
(library5.rdf)>
(expand5.xsl)>
(library5-rdf.xsd)('', '', '').
(lib5-triples.html)
This triple indicates that the book is linked to through a relation of type.
In addition to the availability of the links, all the information in the document is available as triples for RDF applications.
triple('', '', 'bossy, crabby and selfish').
(lib5-triples.html).
In contrast to the changes required to document structure for RDF, the latest XLink CR has chosen to locate most of the linking information in attributes. These attributes, placed in a separate namespace, are usable with minimal impact as an addition to XML vocabularies.
However, XLink is still a Candidate Recommendation, its list of public implementations is very limited, and many areas of possible usage are unexplored.
The next revision of our book catalog vocabulary will use so-called XLink "simple links," which are very similar in principle to XHTML's "<a href=..." link. XLink uses XPointer syntax, which, according to the current CR, lets us choose between three different addressing schemes.
For the purposes of this article, we will ignore the child-sequence scheme in which the nodes are accessed through their sequence order in the document. It's very sensitive to document changes. We'll also ignore the full XPointer scheme, which, relying on XPath expressions, cannot be processed by XSLT processors without XPointer support -- which don't exist yet -- or proprietary extensions to evaluate variable XPath expressions. Instead we'll use the last addressing scheme, which is called as bare-names scheme.
The bare-names scheme is the most similar in its syntax to the XHTML anchors, and it's based on the IDs that we have already used above as physical user links. Since the DTD is currently the only mechanism supported by XPointer, we will add a minimal DTD to declare the IDs used in our document
<!DOCTYPE library [ <!ATTLIST author id ID #IMPLIED> <!ATTLIST book id ID #IMPLIED> <!ATTLIST character id ID #IMPLIED> ]>
(library6.xml)
This DTD is sufficient for non-validating parsers. We have declared
the IDs as optional (
#IMPLIED) because we are using the
author and character elements both as resources and links, and DTDs do
not offer different attribute lists based on the context.
The declaration of the target nodes is done by using the
id attribute defined above.
<author id="author_Charles-M.-Schulz"> .../... <character id="character_Snoopy">
(library6.xml)
The references are defined using XLink simple link syntax.
<book id="book_0836217462"> <isbn>0836217462</isbn> <title>Being a Dog Is a Full-Time Job</title> <author xlink:Charles-M. Schulz</author> <character xlink:Peppermint Patty</character> <character xlink:Snoopy</character> <character xlink:Schroeder</character> <character xlink:Lucy</character> </book>
(library6.xml)
Since we are using bare-names XPointers, we are just specifying the
values of the IDs we use as targets after the # separator
used to separate the document URI from the fragment
identifier. Additionally we could have altered the appearance of the
link in a user agent using the XLink behavior attributes
xlink:show (new, replace, embed, other or
none) and
xlink:actuate (onLoad, onRequest,
other or none).
The expansion of the links can now be done by a template with a
single instruction general to all nodes in our documents containing
non-null
xlink:href attributes.
<xsl:template <xsl:copy-of </xsl:template>
(expand6.xsl)
The situation is less appealing when we want to validate these
links. Since the
id value (character_Snoopy)
doesn't match the reference (#character_Snoopy) because of
the "#" separator, none of the DTD or XML Schema technologies can be
used.
XML Schema's keyref is highly flexible, but unfortunately
its field element must specify an XPath expression pointing to a node
of the document. In this case, we would need to give the result of a
function --
substring-after(@xlink:href, '#').
Checking the validity of XLink links is a tricky issue, mentioned in the XPointer requirements, which the XML Linking WG has avoided. In our case it should be possible, as indicated by Eve Maler, to use rule-based validators such as Schematron to perform this kind of validity check or to use a stylesheet using a similar approach as our expander (expand6.xsl).
The main benefit of using XLink simple links is the future ability
of rendering tools to present these links to the users when using the
XLink behavior attributes. An XLink-enabled processor might also
automatically expand the document for us when
xlink:show
is set to embed and
xlink:actuate is set to
onLoad.
What we've lost by using simple XLink links is a level of
abstraction, since we are again relying on physical IDs. When we write
xlink:href="#character_Peppermint-Patty" we specify the
node from the current document whose id is
"character_Peppermint-Patty," regardless of whatever content this node
might have -- we're not specifying either the character whose name is
"Peppermint Patty" (user-defined logical links), or even the resource
whose identifier is
(RDF).
The loss of abstraction suffered with simple XLinks is inherited
from the HTML
a/@href links that simple XLinks are meant
to replace, and it's one of the reasons why XLink extended links have
been introduced. The other reason is to allow links to live
independently of the structures they link.
Please note that I don't know of any validation tool or services for extended XLinks, and that the following example has only been validated through a thorough reading of the XLink CR.
Since we will remove the links from the structure, the book elements can be simplified.
<book id="book_0836217462"> <isbn>0836217462</isbn> <title>Being a Dog Is a Full-Time Job</title> </book>
(library7.xml)
The character and author elements are the same as in our previous example.
For each extended link, XLink requires that we declare the participating resources. These can either local or external to the extended link. We also need to define the relations (arcs) between these resources.
To keep things simple in our example, we'll define a single extended link with all the relations between the books, author, and characters in our book catalog.
The link container is defined as
<links xlink:
(library7.xml)
A common characteristic of all the XLink components is that the
names of the elements are not significant for XLink. The
specification shows how one can take advantage of this by defining
default values for the attributes, allowing a terser syntax. In this
case, we could have declared in the DTD that the default value of the
xlink:type attribute in the
links element is
extended and, thus, avoided the pain of writing it here.
While I agree that it can aid in the authoring of such documents, I have found that it makes the examples more difficult to read and understand, and I have chosen to keep a complete syntax in the example presented here.
The participants in the link are all external resources
(where "external" means external to the extended link, even if in our
case they are located in the same document) and the
xlink:type to declare them has to be "locator." The
declaration of the resources requires assigning a local label to each
of them, and we'll reuse the identifier to keep things simple.
The declaration of a book is
<book xlink:
(library7.xml)
Similar declarations need to be made for authors.
<author xlink:
(library7.xml)
And for characters:
<character xlink:
(library7.xml)
After all the resources have been declared, we can describe all the relations between them, including relations between the books and their author.
<arc xlink:
(library7.xml)
And those between the books and the characters,
<arc xlink:
(library7.xml)
We see that we can mix physical pointers
(
xlink:href="#book_0836217462") with metadata which
provides more information about the pointers
(
xlink:role="", or
(
xlink:arcrole="").
We could also have added more metadata through
xlink:title attributes and used the behavior attributes
(
xlink:show and
xlink:actuate) to provide
additional information to rendering agents.
Of course, we are still using bare-names XPointers, and we need to keep the same minimal DTD then we had in our previous document.
<!DOCTYPE library [
<!ATTLIST author id ID #IMPLIED>
<!ATTLIST book id ID #IMPLIED>
<!ATTLIST character id ID #IMPLIED>]>
(library7.xml)
Expansion is still possible using XSLT, but it requires us to go through the different steps of indirection. I have chosen to use a short XSLT template for each of these steps. Since the same element and attribute names are used at several locations in the structure with different meaning, we are using a mode (links1, link2 and links3) for each of these steps.
First, we need to go from the book node to the XLink locator that defines its label, using the book ID as a link.
<xsl:template <xsl:copy> <xsl:apply-templates/> <xsl:variable <xsl:apply-templates </xsl:copy> </xsl:template>
(expand7.xsl)
Then we need to go from the book locator to the different arcs in which it is involved.
<xsl:template <xsl:variable <xsl:apply-templates </xsl:template>
(expand7.xsl)
Then to the locators defining the resource that is linked.
<xsl:template <xsl:variable <xsl:apply-templates </xsl:template>
(expand7.xsl)
And finally, we can copy the resource itself.
<xsl:template <xsl:copy-of </xsl:template>
(expand7.xsl)
We could have eliminated two of the four steps by using our knowledge that the labels were equal to the IDs, but we would have been dependent on this design, which would have been more error prone in the long run.
We see that, even though more complex, the manipulation of these links is still possible using conventional XML tools such as XSLT.
The validation of the links is impossible using a DTD or XML Schema because of the XPointer syntax itself. The benefit of this way of defining our links is that we have completely dissociated the elements from the links, just as we would have done in the entity-relation models used in relational databases. This dissociation has been made without losing the semantics carried by RDF: an interesting study available as a W3C Note has shown how RDF statements can be extracted from extended XLinks..
Many thanks to Henry Thompson and Eve Maler for their patient answers to my emails on the W3C mailing lists, to Didier Martin whose presentation during XML Europe 2000 was the starting point of this work, and to the contributors to the RSS-DEV mailing list for their enlightening messages about RDF related issues.
Related links:
XML.com Copyright © 1998-2006 O'Reilly Media, Inc. | http://www.xml.com/lpt/a/667 | CC-MAIN-2016-07 | refinedweb | 1,920 | 53 |
Visual Studio Toolbox
From legacy xBase code to cutting-edge Quantum computing, these Visual Studio extensions will make you more productive.
Microsoft is hard at work on Visual Studio 2019, but developers are still rolling out increasingly helpful and sophisticated tools and extensions for Visual Studio 2017. You can always make your development environment better, or at least tweaked to better accommodate your preferences, to make mundane tasks simpler, to learn new languages or to generate code automatically for old ones. You can even find templates to set up projects just the way you want them and extensions to track how much time you spend working on each file in a solution. Here's my latest round-up of tools you should be checking out.
Testing
Testing is a crucial step in the development process, but I know there are many coders out there who struggle with not only which testing methodology to use, but also the holistic thought process of writing correct and useful tests. Thankfully there are many tools and frameworks to make the process easier.
SmartTests.Extension, by Ludovic Dubois, is a fantastic Visual Studio 2017 extension for anyone who feels they need a little help writing testable code and unit tests. Smart Tests provides a library and Visual Studio Analyzer focused on Test-Driven Development (TDD). The excellent documentation provides straightforward examples of well-written tests to get you started, and walks you through the process of setting up Smart Tests in your project to run the tests. You'll get feedback on missing tests via a built-in Visual Studio Analyzer. You can use Smart Tests on C#-based projects using the NUnit, xUnit or MSTest unit testing tools.
NCrunch is an automated parallel continuous testing tool for Visual Studio. NCrunch runs your tests for you and displays analysis results -- including code coverage, performance metrics and inline exception details -- within the Visual Studio IDE. NCrunch also optimizes your tests with support for parallel execution on multi-core systems (with the ability to control how much it uses) and prioritizes tests for your most recently changed code. You get support for C#, F#, and Visual Basic code along with testing tools including NUnit, xUnit, MSTest, MbUnit, MSpec, and SpecFlow. Extensive documentation on the NCrunch Web site. A 30-day free trial is available.
For those of you using xUnit.net, there are some great extensions being released by the community. xUnit for Devices Project Templates, by Oren Novotny, provides test templates for Xamarin iOS, Xamarin Android and UWP device codebases.
xUnit.net.TestGenerator, by Yowko Tsai, uses the built-in Visual Studio unit test generator to create xUnit 2.0 tests.
j.sakamoto's xUnit Code Snippets is a bit of a misnomer. It's not so much code snippets, but more simple text expansions in Visual Studio for automating the creation of xUnit Fact methods, Theory methods and test classes, with support for async methods. Still very useful and worth checking out. I love a good text expansion.
The NUnit 2 and NUnit 3 Test Adapters, along with the SwitchToNUnit3 utility and NUnit Test Generator extension, continue to be developed and updated for Visual Studio 2017. These continue to be great test adapers. However, since Microsoft is considering VSIX test adapters deprecation for Visual Studio 16 (2019), the NUnit team recommends updating your projects to use the NUnit3TestAdapter NuGet package. This has been a public service announcement.
ResXManager
ResXManager - Visual Studio Marketplace is community-driven open source project overseen by Tom Englert that provides a fantastic utility for managing all the ResX string resources in your solution. You can browse through all of your resource files, displaying the resource keys and strings in an easy-to-navigate grid view. This is really handy whether you're editing the primary string resources or managing localized resources.
ResXManager runs as both a Visual Studio extension and a stand-alone application, so you can even have localizers working on the code outside of Visual Studio. The extension also includes a customizable resource code generator. Both versions include automated translation, orphan resource detection, string import and export, resource snapshots for change tracking and review (often needed with outside translators), multi-language spellchecking, and the ability to automate tasks with PowerShell scripts.
Staying OrganizedJamie Cansdale's Temporary Projects extension helps keep the clutter on your dev machine to a minimum by letting you create ad hoc, temporary project folders that default to the current date, rather than the generally unhelpful \ClassLibrary76. You can, of course, edit the name and location before creating the project. This makes it much easier to go back, clean up and organize those temporary projects later if you have some context for when and why they were created.
With Microsoft acquiring GitHub, it's likely we'll see further improvements around Git/GitHub integration in future iterations of Visual Studio. In the meantime, check out TGit, an extension by Samir Boulema to control TortoiseGit, the Windows Shell Interface to Git, from within Visual Studio. TGit gives you some simple keyboard shortcuts for over 15 common Git tasks including changing branches, pulling, committing, pushing and more. I personally love command-line Git and like seeing extensions like this that bring the workflow into the IDE in a simple, easy-to-remember manner.
OpenFileByName, by Jeffrey Broome, makes is easy to find and open a file in the current solution without taking your fingers off the keyboard. Simply type the name of the file (or part of it) and open the file. Simple and effective.
When you're working with complicated solutions and want to maintain different, useful views of your files, Multiple Solution Explorer Tools, by Michal Žůrek, will help. The extension makes scoped or customized Solution Explorer views persistent across Visual Studio sessions. In Solution Explorer, right-click a folder that you want to set as the root folder of new view, then select the New Solution Explore View option in the context menu. The selected Solution Explorer view is created in a new window. If the view is open when you close Visual Studio, it will re-open next time you start Visual Studio and re-open that solution.
David Anderson's Project Explorer extension gives you a fully configurable Project Explorer window that lets you find, organize and display project folders in the manner that makes sense for you. Project Explorer lets you specify which file types you want displayed, along with a token-delimited path hints that tell Project Explorer where to look for project files and directories as well as how to display them.
More New Extensions
If you're curious about what it takes to write software for quantum computers and Microsoft's Scalable Quantum computing resources, download the Microsoft Quantum Development Kit preview and then dig into the Writing a Quantum Program Q# language tutorial. Q# is a domain-specific programming language used for writing the quantum algorithms that will run in Microsoft's Quantum environment, which is sort of Azure for quantum computing. It's all pretty new stuff, and now is the time to start learning about this new frontier.
Speaking of new languages, XSharp (X#) is a .NET Framework-based language implementation using xBase syntax. Designed for ongoing support of legacy systems, XSharp provides a compiler, runtime and Visual Studio integration based on Roslyn. Using familiar Visual Studio 2017 tools you can write xBase-dialect code including VO/Vulcan, FoxPro, dBase, Xbase++ and Harbour.
React Core Boilerplate, by Nikolay Maev, provides a configured template environment for React-based Web applications. Designed for Web professionals who want all of their frameworks and tools configured for launching new projects quickly and efficiently, React Core Boilerplate includes TypeScript, React Router and React Helmet, Redux, SASS CSS preprocessing, WebPack, Axios, Serilog, and more.
On the subject of Web development, Max Meng's TypeSharp is a handy utility for converting C# model classes into TypeScript. It's a simple implementation at this time, but open source and configurable with custom grammars.
Entity Framework Visual Editor, by Michael Sawczyn, gives you an interface for visual modeling, review and documentation of persistent Entity Framework classes including inheritance and unidirectional and bidirectional associations. The editor also generates sophisticated, consistent and correct Entity Framework code that can be regenerated when your model changes. You can edit or even replace T4 templates for customized code generation, add coloration to simplify model viewing, show and hide parts of the model, and more. There's also teriffic documentation.
XPath Tools, by Uli Weltersbach, adds XPath query features directly to Visual Studio, helping you navigate complicated XML documents and namespaces, including showing your current XPath right in the status bar.
For C++ developers, Clang Power Tools brings the power of Clang/LLVM tools like clang-tidy, clang-analyzer and clang-format to Visual Studio. Clang Power Tools helps you perform code transformations and optimizations, find latent bugs with static analysis and CppCoreGuidelines checks and more. The checks and analysis tools are highly configurable, and results include extensive and useful tips for understanding what you're trying to fix and how it helps your application.
Finally, ever wonder how productive you really are? Or, more specifically, where you're spending the most time in your development project? Kurt G. Nielsen's DevTracker-Time Summary gives you a summary of time spent working in a solution down to the code file, and includes statistics including the current session, day view for today, yesterday, or up to seven days back, week view, month view, and totals for the entire solutions life span. Reports include list views or pie views. Controls include starting, pausing, and stopping time tracking, along with configurable options for tracking idle time. | https://visualstudiomagazine.com/articles/2019/01/01/vs-toolbox.aspx | CC-MAIN-2021-17 | refinedweb | 1,622 | 50.87 |
Try the Oklahoma Franchise Tax Suite for FREE! Just download
our software, try it out and purchase only after you have seen how
easy it is and how much time you will save.
The Oklahoma Franchise Tax Suite version 2010 will dramatically
reduce the time you spend preparing the Oklahoma Annual Franchise
Tax Return to because:
The Okla Franchise Tax Suite will allow you to enter, print, email
or save the following forms:
New for Tax Year 2010
Our software creates an Adobe (r) PDF file that you can print,
Oklahoma Franchise Suite will save information for next years use.
Next year, you will save even more time because our software will
import last years data, so that you can just update the amounts.
Take a risk free
trial by downloading a fully functional
program. You can enter, calculate, save and print your data. The
only limitation is an "Unregistered" watermark on the
generated output pages. After you buy the product we will send you
a registration code that will remove the watermark. | http://mikhea.com/ | crawl-002 | refinedweb | 173 | 66.47 |
Models and Views in Qt Quick
Simply put, applications need to form data and display the } }
Models
Data is provided to the delegate via named data roles which the delegate may bind to. Here is a ListModel with two roles, type and age, and a ListView with a delegate that binds to these roles to display their values:
import QtQuick type ListModel } }
Note: VisualItemModel can also be used, but it is only provided for compatibility reasons. VisualItemModel allows a QML item to be provided as a model. This model contains both the data and delegate; the child items of a VisualItemModel provide the contents of the delegate. The model does not provide any roles. } }. | https://doc.qt.io/qt-5.11/qtquick-modelviewsdata-modelview.html | CC-MAIN-2019-26 | refinedweb | 114 | 56.79 |
Eric Hamers10,373 Points
Dude.. you completely lost it in this video... calm down
All the sudden Keneth starts going without even explaining what he is doing... Treehouse, cmon, please....
5 Answers
Eric Hamers10,373 Points
Sorry about minor rant.
At 5:15 on, what is saves=data? From that point video evolved way too rapidly...Not much was explained
Chris FreemanTreehouse Moderator 58,986 Points
There is a lot of information covered at that point in the video. From the Flask docs,
render_templates takes a template as an argument followed by any number of keyword arguments which will be added to the template context. So, assigning
saves makes
saves available in the template. The next area is how to handle getting the cookie information, updating it, and then passing the updated cookie back to the browser.
Post back if you need more clarification.
agigryms2,569 Points
Great explanations, Shyam, they helped a lot!
Shyam Gupta7,736 Points
I also spent a considerable time to understand what was going on, below explanation should help
Note:
json.loads() converts/decodes JSON data into Python dictionary json.dumps() converts Python dictionary to JSON The request.form object is an immutable dictionary.
Cookies can be thought of as key-value pairs that we may or may not receive by default from return visitors. When a user makes choices, we create or update their cookie to reflect these changes, and when a user requests our site, we check to see whether a cookie exists and read as much of the unspecified information from this as possible.
Step1- Define a function to retrieve the cookie if it exists.
def get_saved_data(): try: data = json.loads(request.cookies.get(‘cookie_name’) ##loads converts JSON to a Python dictionary. except TypeError: data = {} #Return empty dictionary if cookie does not exist. return data
Step2 - Create a response variable We will wrap a make_response() call around our render_template() or redirect call instead of returning the rendered template directly. This means that our Jinja templates will be rendered, and all the placeholders will be replaced with the correct values, but instead of returning this response directly to our users, we will load it into a variable so that we can make some more additions to it.
response = make_response(redirect(url_for(‘index’)))
Step3: Set cookie expiration (This wasnt part of the lecture, but good to know) Once we have this response object, we will create a datetime object with a value of 365 days (or whatever duration) from today's date
expires = datetime.datetime.now() + datetime.timedelta(days=365)
Step 4: Check if a cookie already exists & retrieve it
data = get_saved_data()
Step 5: If the cookie exists, only update the values that have changed
data.update(dict(request.forms.items()))
Step 6: Set the cookie
response.set_cookie(‘cookie_name’, json.dumps(data), expires=expires ) return response
Chris FreemanTreehouse Moderator 58,986 Points
Moved comment to answer
Aleksandra Landeker1,498 Points
Thank you, Shyam! Very helpful comments. :)
Juris JaundzeikarsPython Web Development Techdegree Student 670 Points
Kenneth is mad here
Chris FreemanTreehouse Moderator 58,986 Points
Chris FreemanTreehouse Moderator 58,986 Points
What do mean by "lost it" and "calm down"? Can you reference time points in the video? | https://teamtreehouse.com/community/dude-you-completely-lost-it-in-this-video-calm-down | CC-MAIN-2020-10 | refinedweb | 533 | 55.84 |
@bonob thanks, for some reason I did not notice it when I searched for it.
Search Criteria
Package Details: dupeguru 4.2.1-2
Package Actions
Dependencies (11)
- libxkbcommon-x11 (libxkbcommon-git)
- python (python38, python36, python37, python39, python3.7, nogil-python, python311)
- python-mutagen
- python-pip
- python-polib
- python-pyqt5 (python-pyqt5-sip4)
- python-semantic-version
- python-send2trash
- python-xxhash
- python-distro (make)
- python-sphinx (python-sphinx-git, python-sphinx-2) (make)
Required by (0)
Sources (1)
Latest Comments
fuan_k commented on 2021-12-20 23:30 (UTC)
bonob commented on 2021-12-20 07:04 (UTC)
You noted in the last update that python-send2trash is not in the AUR anymore. It is in community though, if that's relevant?
Rus commented on 2021-12-19 23:54 (UTC) (edited on 2021-12-19 23:55 (UTC) by Rus)
It worked after the PKGBUILD update, thanks
fuan_k commented on 2021-12-19 23:49 (UTC)
@Rus: I would need more information, but I suspect you might have an outdated python-polib installed on your system. Pushed a possible workaround, let me know if it still fails.
Another possible solution in that case would be to change
python -m venv env --system-site-packages to just
python -m venv env to avoid using packages already installed system-wide.
Rus commented on 2021-12-19 17:29 (UTC) (edited on 2021-12-19 17:30 (UTC) by Rus)
WARNING: Location 'deps' is ignored: it is either a non-existing path or lacks a specific scheme. ERROR: Could not find a version that satisfies the requirement polib>=1.0.4 (from versions: none) ERROR: No matching distribution found for polib>=1.0.4
fuan_k commented on 2021-02-01 01:33 (UTC) (edited on 2021-03-23 23:00 (UTC) by fuan_k)
@JohnRobson can you please be more specific? It builds fine in a clean chroot, I don't see what you are missing. python-polib package just got updated, maybe you need to update it.
JohnRobson commented on 2021-01-31 20:13 (UTC)
python-polib version 1.1.0-3, please, fix the "requirements.txt"
fuan_k commented on 2021-01-03 16:43 (UTC) (edited on 2021-01-03 17:31 (UTC) by fuan_k)
@Rus: I don't get different results comparing 4.0.4 and 4.1.0. Would you mind filing a bug report on the github issue tracker if you can provide more information? The matching algorithm has not changed so I don't see why you get "worse" results... apart from using exclusion filters (regex) perhaps.
4.1.0 is not released yet, but it is the same code as the current master branch. 4.0.4 won't work anymore due to the newer python version used in Arch Linux. Granted a patch could be written to make it work, I don't think it's worth the trouble at this point, as 4.1.0 is about to get a proper release anyway.
@madjoe these are dependencies of the python-sphinx package used for building the documentation. My take is that they are not really our dependencies, and since they are only used during the building stage, they will end up as orphans. This is normal behaviour, you can safely remove these packages. Using
makepkg -sr to build packages should automatically remove makedepends once they are no longer needed.
Rus commented on 2021-01-03 03:03 (UTC) (edited on 2021-01-03 03:04 (UTC) by Rus)
Is it just me, or is the image search worse than it was in 4.0.4? It says everywhere that 4.0.4 is the latest release. Maybe we should bring back this version?
madjoe commented on 2021-01-03 02:58 (UTC)
When I check the orphan packages, I can find the following packages:
Packages (15) python-babel-2.9.0-1 python-docutils-0.16-4 python-imagesize-1.2.0-4 python-jinja-2.11.2-4 python-markupsafe-1.1.1-6 python-pygments-2.7.3-1 python-snowballstemmer-2.0.0-6 python-sphinx-3.4.0-1 python-sphinx-alabaster-theme-0.7.12-6 python-sphinxcontrib-applehelp-1.0.2-3 python-sphinxcontrib-devhelp-1.0.2-3 python-sphinxcontrib-htmlhelp-1.0.3-3 python-sphinxcontrib-jsmath-1.0.1-6 python-sphinxcontrib-qthelp-1.0.3-3 python-sphinxcontrib-serializinghtml-1.1.4-3
Those packages should not be orphaned, since I just installed dupeguru from this AUR. Why are those not marked as dependencies?
fuan_k commented on 2020-12-10 18:51 (UTC) (edited on 2020-12-10 18:55 (UTC) by fuan_k)
The upstream master branch is currently broken, and dupeguru-git risks being broken too. The upstream maintainer is taking too long to merge the patches that fix and update the master branch. Therefore I went ahead and temporarily changed the source to point to a source release candidate for the upcoming 4.1.0 version.
This is better than patching manually for incompatible python versions. Might as well include all the patches at once because the resulting build should be stable anyway.
This here package is now currently ahead of the "dupeguru-git" package.
I'll revert back to the upstream repository once a proper release is done.
Harvey commented on 2020-12-10 11:05 (UTC)
@Batou: Please read at least the last few comments before posting ;)
Batou commented on 2020-12-10 04:08 (UTC)
It seems to be broken again :\
$ dupeguru Gtk-Message: 23:05:07.591: Failed to load module "xapp-gtk3-module"'
Tio commented on 2020-12-06 19:48 (UTC)
@fuan_k Yes that's perfect! Thank you very much!
fuan_k commented on 2020-12-06 17:17 (UTC)
@Tio: I changed the .desktop file to point to a logically discoverable icon instead of the hardcoded path. A symbolic link that points to the packaged icon is made in /usr/share/pixmaps. Let me know if that's not exactly what you wanted, I'll eventually push the changes upstream.
Tio commented on 2020-12-06 14:45 (UTC)
Can you please make the icon path as relative? We are making custom icons for Linux and we can't deal with these non-relative paths. Thanks!
Harvey commented on 2020-12-06 13:51 (UTC)
@fuan_k: The deletion of the file "last_directories.xml" from the folder ~/.local/share/Hardcoded\ Software/dupeGuru lets me start dupeguru at least once ;)
Rus commented on 2020-12-05 23:03 (UTC)
I just did the installation without errors.
fuan_k commented on 2020-12-05 23:00 (UTC) (edited on 2020-12-05 23:54 (UTC) by fuan_k)
@Harey: the getiterator method has been deprecated in the latest python versions, and this has been patched upstream already.
Try using dupeguru-git while waiting for 4.0.5 to be released. Another workaround is perhaps to force using python 3.8 by editing the run.py script, i.e. change the first line to
#!/usr/bin/python3.8.
Harvey commented on 2020-12-05 19:14 (UTC) (edited on 2020-12-05 19:19 (UTC) by Harvey)
The package builds ok on an fully updated system with 'testing' repo enabled, but the app does bail out with the following error:
harvey@obelix ~/abs/dupeguru $ dupeguru'
Is there a remedy for this?
loathingkernel commented on 2020-12-02 10:15 (UTC) (edited on 2020-12-02 10:18 (UTC) by loathingkernel)
@fuan_k yes, you are missing this Basically arch indicates what architectures the resulting package can be used on. You can't use an
x86_64 on
i686, hence it is not
any but either
x86_64 or
i686.
fuan_k commented on 2020-10-07 00:24 (UTC)
@haawda: the package doesn't include any BLOB as far as I know. The tar file in Sources only provides sources, and the PKGBUILD calls the build script to produce the necessary binaries. Am I missing something?
haawda commented on 2020-10-06 23:30 (UTC)
The package includes binaries, so arch=any is wrong.
fuan_k commented on 2020-06-11 18:03 (UTC) (edited on 2020-06-11 18:15 (UTC) by fuan_k)
@funk-electric have you performed a full system upgrade? Also post gcc / binutils / elfutils / libelf versions please. It builds fine in a clean chroot so there's something missing here... Edit: for some reason you are using Anaconda3's compiler/linker, which I assume are out of date or something. Perhaps your ${PATH} is overriden by Anaconda somehow. Make sure you are not using a virtual environment when building the package.
funk-electric commented on 2020-06-11 08:19 (UTC) (edited on 2020-06-11 08:21 (UTC) by funk-electric)
When I'm trying to upgrade from last version I got following error:
You are using pip version 19.0.3, however version 20.2b1 is available. You should consider upgrading via the 'pip install --upgrade pip' command. ==> Starting build... Building dupeGuru with UI qt Building dupeGuru Building PE Modules running build_ext building '_block' extension/block.c -o build/temp.linux-x86_64-3.7/core/pe/modules/block.o/common.c -o build/temp.linux-x86_64-3.7/core/pe/modules/common.o gcc -pthread -shared -B /home/user/anaconda3/compiler_compat -L/home/user/anaconda3/lib -Wl,-rpath=/home/user/anaconda3/lib -Wl,--no-as-needed -Wl,--sysroot=/ -Wl,-O1,--sort-common,--as-needed,-z,relro,-z,now -march=x86-64 -mtune=generic -O2 -pipe -fno-plt -D_FORTIFY_SOURCE=2 build/temp.linux-x86_64-3.7/core/pe/modules/block.o build/temp.linux-x86_64-3.7/core/pe/modules/common.o -o build/lib.linux-x86_64-3.7/_block.cpython-37m-x86_64-linux-gnu.so build/temp.linux-x86_64-3.7/core/pe/modules/block.o: file not recognized: file format not recognized collect2: error: ld returned 1 exit status error: command 'gcc' failed with exit status 1 ==> ERROR: A failure occurred in build(). Aborting...
Does anyone know how to fix this?
atescula commented on 2020-06-04 05:20 (UTC)
ERROR building due to hsaudiotag3 (not found)
Preparing... Cloning dupeguru build files... Checking dupeguru dependencies... Resolving dependencies... Checking inter-conflicts...
Building dupeguru... ==> Making package: dupeguru 4.0.4-1 (Jo 04 iun 2020 08:15:11 +0300) ==> Checking runtime dependencies... ==> Checking buildtime dependencies... ==> Retrieving sources... -> Found dupeguru-src-4.0.4_RC.tar.gz ==> Validating source files with md5sums... dupeguru-src-4.0.4_RC.tar.gz ... Passed ==> Removing existing $srcdir/ directory... ==> Extracting sources... -> Extracting dupeguru-src-4.0.4_RC.tar.gz with bsdtar ==> Removing existing $pkgdir/ directory... ==> Starting build()... Requirement already satisfied: Send2Trash>=1.3.0 in /usr/lib/python3.8/site-packages (from -r requirements.txt (line 1)) (1.5.0) Requirement already satisfied: sphinx>=1.2.2 in /usr/lib/python3.8/site-packages (from -r requirements.txt (line 2)) (3.0.4) Collecting polib>=1.0.4 (from -r requirements.txt (line 3)) Using cached Collecting hsaudiotag3k>=1.1.3 (from -r requirements.txt (line 4)) ERROR: Could not find a version that satisfies the requirement hsaudiotag3k>=1.1.3 (from -r requirements.txt (line 4)) (from versions: none) ERROR: No matching distribution found for hsaudiotag3k>=1.1.3 (from -r requirements.txt (line 4)) WARNING: You are using pip version 19.2.3, however version 20.1.1 is available. You should consider upgrading via the 'pip install --upgrade pip' command. ==> ERROR: A failure occurred in build(). Aborting...
fuan_k commented on 2019-10-09 15:06 (UTC) (edited on 2019-10-09 15:38 (UTC) by fuan_k)
@Ataraxy: thanks for reporting. I have a bunch of other (unrelated) garbage in there too. Could you please list the directories (or files?) in that path you mentioned? I'm trying to narrow-down what exactly is responsible for which "remnant". Also how do you know hsaudiotag and polib are the culprits? There is nothing in their files that suggest they would write anything there. As far as I can see, there shouldn't be anything written to that path from this package either.
Ataraxy commented on 2019-10-09 07:34 (UTC)
Building this package leaves a bunch of garbage files under:
~/.local/lib/python3.7/site-packages
The culprits are
hsaudiotag and
polib..
air-g4p commented on 2018-12-08 00:06 (UTC)
@fuan-k,
Thank you for fixing the hsaudiotag3k issue. During the build, I saw: Successfully installed hsaudiotag3k-1.1.3
The entire build now completes, without error, in a clean chroot.
Good work! Cheers
fuan_k commented on 2018-12-07 04:57 (UTC) (edited on 2018-12-07 05:02 (UTC) by fuan_k)
@air-g4p Since hsaudiotag3k can be downloaded directly with pip, instead of fetching the AUR package, I have changed the PKGBUILD accordingly and removed python-hsaudiotag3k from the PKGBUILD dependencies. Although this might not be the best, since the install script is handling this dependency installation "silently"...
I think there was a problem with the arguments given to pip, namely
pip install --no-index --find-links=deps -r requirements.txt. There is no "deps" directory, since it was explicitly ignored in the .gitignore file, so I assume that was the original author's way to speed things up by using his locally available packages, which we do not have.
Anyway, it should be fixed now. Sorry for the delay.
air-g4p commented on 2018-12-03 04:12 (UTC) (edited on 2018-12-03 04:14 (UTC) by air-g4p)
Despite having built and installed without error, I see this dupeguru build failure within a clean chroot:
==> Installing missing dependencies...
error: target not found: python-hsaudiotag3k
==> ERROR: 'pacman' failed to install missing dependencies.
==> ERROR: Build failed, check /var/lib/archbuild/extra-x86_64/user/build
I have no prior instances of dupeguru installed, and this occurs on a fully updated Arch system.
Any suggestions?
fuan_k commented on 2018-11-12 16:07 (UTC) (edited on 2018-11-12 19:03 (UTC) by fuan_k)
Might have to fix the python-hsaudiotag3k package ( in case it needs to be pointed at the python3.7 path, although as far as I can tell, it should install properly already. Might just be a problem with previous installations which were installed in 3.6 path.
Anyway, I'll keep an eye on this package. If it really needs some serious maintainership investment, I'll be around just in case. I can't think of any other program for Linux that does what DupeGuru does. It's a precious package in my opinion.
Edit: The sed hack has just been implemented upstream (into hscommon) so this won't be needed anymore in version 4.0.4, that is, if it ever comes out. User arsenetar seems to have been working on the project ( albeit at a slow pace and only bug fixes so far. We will see. For now, since we are targeting the latest stable release, I think it's best to keep this workaround in the PKGBUILD. It will be removed for the next actual release.
Harvey commented on 2018-11-12 11:11 (UTC)
From the Athors Gihub site:
Current status: Unmaintained
I haven't worked on dupeGuru for a while and frankly, I don't want to. I never had any duplicate problems so I don't even care about the raison d'être of this thing.
I don't want to answer incoming issues and I don't want to let them pile off unanswered either, that feels rude. So here I am, being straightforward about it.
If you're considering using dupeGuru, you might want to give it a try but if it doesn't meet your needs I suggest that you use another program because it's unlikely to ever be improved again.
If you're a developer wanting to pick it up, by all means, do so! Fork it off and release something. I will be more than happy to "officially" point to any fork that remotely looks like a serious effort. I will also be happy to assist if you have questions about the code.
Good bye dupeGuru, Virgil Dupras
eschwartz commented on 2018-11-12 03:16 (UTC)
Has anyone considered, perhaps, submitting an upstream pull request to fix this package, so that a new release can be tagged without requiring horrible sed hacks to make it build?
Arch Linux values the principle of pushing fixes upstream...
cybertron commented on 2018-10-21 14:07 (UTC)
yeah thank you @batou and fuan_k with your both tipps it works :)
fuan_k commented on 2018-10-15 19:36 (UTC) (edited on 2018-11-12 19:04 (UTC) by fuan_k)
@cybertron: if you already have hsaudiotag3k installed in your python 3.6 site-packages, you can safely copy it over to the 3.7 site-packages, it should work fine.
sudo cp -r /usr/lib/python3.6/site-packages/hsaudiotag3k-1.1.3-py3.6.egg-info /usr/lib/python3.7/site-packages sudo cp -r /usr/lib/python3.6/site-packages/hsaudiotag /usr/lib/python3.7/site-packages
I have submitted a request to make this package orphan, so that we can fix it ourselves.
Batou commented on 2018-10-14 22:08 (UTC) (edited on 2018-10-14 22:09 (UTC) by Batou)
1) Make sure your install is fully updated
2) Remove all dupeguru build/source caches
3) Download the PKGBUILD or use your AUR manager of choice and enable it to edit PKGBUILD
4) Add the following section (you can place it before build() for example). This is based upon fuan_k's fix but the
src/ is omitted.
prepare(){ cd "$srcdir" sed -i '277 a\\ try:' hscommon/build.py sed -i '279s/^/ /' hscommon/build.py sed -i '280s/^/ /' hscommon/build.py sed -i '281s/^/ /' hscommon/build.py sed -i '281a\\ except StopIteration:' hscommon/build.py sed -i '282a\\ return' hscommon/build.py }
It should build fine. Someone should contact this package's maintainer to update it with this fix so all the users can safely update.
cybertron commented on 2018-09-16 14:34 (UTC)
hm both tips doesn't work for me it fails by resolving deps hsaudiotag3k the aur versions seems to be available for python 3.6 only?
Batou commented on 2018-09-13 12:42 (UTC) (edited on 2018-09-13 12:43 (UTC) by Batou)
I haven't had enough time to look at these issues in depth but none of the suggested solutions below worked for me. What worked for me was basically:
$ git clone #note bellow: make will fail twice because of dependencies. It will build fine on the 3rd time $ make $ make $ make $ make run #to run the app
unfortunately this will not make a package so you can't install it but it will run if you absolutely need to use dupeguru right away. This is an unmaintained package that's full of issues and temporary fixes. It's a giant mess and it breaks often. Unfortunately, there are no good alternatives.
fuan_k commented on 2018-08-21 20:50 (UTC) (edited on 2018-08-21 22:17 (UTC) by fuan_k)
I came up with a quick fix you can add to the PKGBUILD:
prepare(){ cd "$srcdir" sed -i '277 a\\ try:' src/hscommon/build.py sed -i '279s/^/ /' src/hscommon/build.py sed -i '280s/^/ /' src/hscommon/build.py sed -i '281s/^/ /' src/hscommon/build.py sed -i '281a\\ except StopIteration:' src/hscommon/build.py sed -i '282a\\ return' src/hscommon/build.py }
It's basically changing this part of the script with a try/except statement:
def iter_by_three(it): while True: version = next(it) date = next(it) description = next(it) yield version, date, description
into the following:
def iter_by_three(it): while True: try: version = next(it) date = next(it) description = next(it) except StopIteration: return yield version, date, description
I successfully built afterward and now DupeGuru is working again fine with Python3.7 (so far).
This should be reported upstream, as it's an incompatibility bug with Pyhton 3.7. But the maintainer will have to fix the hsaudiotag3k-1.1.3 dependency issue in the PKGBUILD also... the way it handles it right now doesn't seem very reliable as it fetches from PyPi instead of the AUR?
atescula commented on 2018-08-21 20:20 (UTC)
Ok, thanks. Any idea how to bring this software back to work ? I am desperate, I use it mainly to identify tons of duplicate photos. Or maybe a good linux alternative for this task ? Appreciate assistance :-)
fuan_k commented on 2018-08-21 20:04 (UTC) (edited on 2018-08-21 20:11 (UTC) by fuan_k)
After copying hsaudiotag like so:
cd /usr/lib/python3.6/site-packages sudo cp -r hsaudiotag3k-1.1.3-py3.6.egg-info ../../python3.7/site-packages sudo cp -r hsaudiotag ../../python3.7/site-packages
I get another error:
[...] Generating Help Traceback (most recent call last): File "/var/yay_cache/dupeguru/src/hscommon/build.py", line 278, in iter_by_three version = next(it) StopIteration The above exception was the direct cause of the following exception: Traceback (most recent call last): File "build.py", line 376, in <module> main() File "build.py", line 373, in main build_normal(ui, options.dev) File "build.py", line 336, in build_normal build_qt(dev) File "build.py", line 169, in build_qt build_help() File "build.py", line 183, in build_help sphinxgen.gen(help_basepath, help_destpath, changelog_path, tixurl, confrepl, conftmpl, changelogtmpl) File "/var/yay_cache/dupeguru/src/hscommon/sphinxgen.py", line 47, in gen changelog = read_changelog_file(changelogpath) File "/var/yay_cache/dupeguru/src/hscommon/build.py", line 288, in read_changelog_file for version, date_str, description in iter_by_three(iter(splitted)): RuntimeError: generator raised StopIteration
Apparently, the StopIteration exception changed in pyhton 3.7:
fuan_k commented on 2018-08-21 19:49 (UTC) (edited on 2018-08-21 19:51 (UTC) by fuan_k)
@atescula: this is also related to python having been upgraded from 3.6 to 3.7.
I get another error:
==> Starting build()... Looking in links: deps Requirement already satisfied: Send2Trash>=1.3.0 in /usr/lib/python3.7/site-packages (from -r requirements.txt (line 1)) (1.5.0) Requirement already satisfied: sphinx>=1.2.2 in /usr/lib/python3.7/site-packages (from -r requirements.txt (line 2)) (1.7.6) Requirement already satisfied: polib>=1.0.4 in /usr/lib/python3.7/site-packages (from -r requirements.txt (line 3)) (1.1.0) Collecting hsaudiotag3k>=1.1.3 (from -r requirements.txt (line 4)) Url 'deps' is ignored. It is either a non-existing path or lacks a specific scheme. Could not find a version that satisfies the requirement hsaudiotag3k>=1.1.3 (from -r requirements.txt (line 4)) (from versions: ) No matching distribution found for hsaudiotag3k>=1.1.3 (from -r requirements.txt (line 4)) ==> ERROR: A failure occurred in build(). Aborting... Error making: dupeguru
atescula commented on 2018-08-19 08:45 (UTC)
After updating Manjaro KDE today from 17.1.11 to 17.1.12 dupeguru not starting anymore. Also no success trying to reinstall.
Here is the output when starting from terminal:
[andrei@manjaro-desktop ~]$ dupeguru Traceback (most recent call last): File "/bin/dupeguru", line 49, in <module> sys.exit(main()) File "/bin/dupeguru", line 35, in main from qt.app import DupeGuru File "/usr/share/dupeguru/qt/app.py", line 22, in <module> from core.app import AppMode, DupeGuru as DupeGuruModel File "/usr/share/dupeguru/core/app.py", line 24, in <module> from . import se, me, pe File "/usr/share/dupeguru/core/pe/init.py", line 1, in <module> from . import block, cache, exif, iphoto_plist, matchblock, matchexif, photo, prioritize, result_table, scanner # noqa File "/usr/share/dupeguru/core/pe/block.py", line 9, in <module> from ._block import NoBlocksError, DifferentBlockCountError, avgdiff, getblocks2 # NOQA ModuleNotFoundError: No module named 'core.pe._block' [andrei@manjaro-desktop ~]$ </module></module></module></module></module>
SpotlightKid commented on 2018-08-11 21:31 (UTC)
@AmbientChaos: It's a Python 3.7 incompatibility.
AmbientChaos commented on 2018-08-10 15:23 (UTC)
I'm getting an error during building, does anyone know what I can do to fix this?
karcher commented on 2018-05-28 10:11 (UTC)
I'm getting an error: error: failed to commit transaction (conflicting files)
Whole output:
Batou commented on 2018-05-15 18:22 (UTC)
@dangoldbj thanks!! Builds fine now!
dangoldbj commented on 2018-05-15 05:49 (UTC)
@Batou Thank you. Updated with changes.
Batou commented on 2018-05-15 05:01 (UTC)
Fails to build... ... Copying package at /usr/lib/python3.6/site-packages/send2trash to build/dupeguru-arch/send2trash Copying package at /usr/lib/python3.6/site-packages/hsaudiotag to build/dupeguru-arch/hsaudiotag Traceback (most recent call last): File "package.py", line 141, in <module> main() File "package.py", line 136, in main package_arch() File "package.py", line 96, in package_arch copy_files_to_package(srcpath, packages, with_so=True) File "package.py", line 42, in copy_files_to_package shutil.copytree(op.join('build', 'help'), op.join(destpath, 'help')) File "/usr/lib/python3.6/shutil.py", line 309, in copytree names = os.listdir(src) FileNotFoundError: [Errno 2] No such file or directory: 'build/help' ==> ERROR: A failure occurred in package().</module>
Kerriganx commented on 2018-04-09 22:58 (UTC)
@ConorIA ERROR: PKGBUILD contains CRLF characters and cannot be sourced.
ConorIA commented on 2018-04-05 00:38 (UTC)
Here is an updated PKGBUILD: and a patch based on comment by @xnopasaranx:
You'll need both in the same dir to build.
atescula commented on 2018-03-28 07:15 (UTC) (edited on 2018-03-28 10:17 (UTC) by atescula)
brute force approach for building !!!
run in a terminal watch -n1 -x mkdir /tmp/pamac-build-andrei/dupeguru/src/build/help this command creates folder help every second replace andrei with your username
Circle111 commented on 2018-03-23 08:14 (UTC)
FileNotFoundError: [Errno 2] No such file or directory: 'build/help' ==> ОШИБКА: Произошел сбой в package(). Прерывание... ==> ОШИБКА: Makepkg не смог собрать dupeguru.
Не работает..
cordobaweb commented on 2018-03-17 02:51 (UTC)
How can I edit build script? @xnopasaranx
xnopasaranx commented on 2018-03-13 17:52 (UTC) (edited on 2018-03-13 17:54 (UTC) by xnopasaranx)
@cordobaweb I had the build script complain about a non existant path 'build/help' and had to change the package.py line 42 and 43 to:
shutil.copytree(op.join(base_path, 'help'), op.join(destpath, 'help'))
shutil.copytree(op.join(base_path, 'locale'), op.join(destpath, 'locale'))
and add:
basepath = os.getcwd()
somewhere above. then it built fine.
cordobaweb commented on 2018-03-09 18:12 (UTC)
fails to build for me. It´s not working.
wget commented on 2017-08-26 11:24 (UTC)
wget commented on 2017-08-26 11:24 (UTC)
wget commented on 2017-08-26 11:23 (UTC)
fuan_k commented on 2017-01-26 21:02 (UTC) (edited on 2017-01-26 22:11 (UTC) by fuan_k)
dangoldbj commented on 2016-12-15 14:46 (UTC)
Ivan commented on 2016-12-11 15:21 (UTC)
dangoldbj commented on 2016-12-09 17:56 (UTC)
buzz commented on 2016-12-09 13:17 (UTC) (edited on 2016-12-09 13:21 (UTC) by buzz)
commented on 2016-10-25 12:08 (UTC)
commented on 2016-10-25 12:07 (UTC)
dangoldbj commented on 2016-10-25 11:57 (UTC)
TruckerZer0 commented on 2016-09-29 04:43 (UTC)
tuxflo commented on 2014-10-29 15:48 (UTC) (edited on 2015-10-05 06:55 (UTC) by tuxflo)
hsoft commented on 2014-10-26 16:10 (UTC)
Zetex commented on 2014-10-21 21:02 (UTC)
hsoft commented on 2014-10-17 20:36 (UTC)
PTBM133A4X commented on 2014-09-15 16:13 (UTC)
hsoft commented on 2014-09-14 16:42 (UTC)
hsoft commented on 2014-09-13 20:08 (UTC)
PTBM133A4X commented on 2014-09-11 22:08 (UTC)
commented on 2014-07-17 17:11 (UTC)
[deleted]
commented on 2014-07-17 16:27 (UTC)
[deleted]
commented on 2014-07-17 16:26 (UTC)
[deleted]
Pinned Comments. | https://aur.archlinux.org/packages/dupeguru | CC-MAIN-2022-21 | refinedweb | 4,679 | 58.69 |
11 March 2011 18:00 [Source: ICIS news]
HOUSTON (ICIS)--Here is Friday’s midday ?xml:namespace>
CRUDE: Apr WTI: $100.75/bbl, down $1.95; Apr Brent: $114.04/bbl, down $1.39
Crude futures plunged after
RBOB: Apr: $2.9900/gal, down 2.96 cents
Reformulated gasoline blendstock for oxygenate blending (RBOB) prices dropped after a massive earthquake hit offshore
NATURAL GAS: Apr: $3.930/MMBtu, up 10.0 cents
The NYMEX front-month contract rebounded from Thursday’s 10-cent drop and recouped the previous session’s losses by midday. Buying signals moved the price higher in direct contrast to warming weather forecasts.
ETHANE: down at 64.25-64.50 cents/gal
Mont Belvieu ethane fell sharply in the early morning, following the plunge in the NYMEX petroleum complex. Recent bids and offers showed that ethane was rebounding slightly into midday.
AROMATICS: styrene flat at 68.75-69.25 cents/lb
Prompt styrene prices were unchanged early Friday amid thin market interest. Meanwhile, trade participants said benzene, toluene and mixed xylene (MX) prices were moving higher this morning. However, market prices were not yet disclosed.
OLEFINS: ethylene flat at 53.00-54.00 cents/lb
Olefins markets were unchanged this morning as trade participants kept watch on how the deadly tsunami and earthquake in | http://www.icis.com/Articles/2011/03/11/9443240/noon-snapshot-americas-markets-summary.html | CC-MAIN-2015-22 | refinedweb | 217 | 70.5 |
Applications in character mode (VIO mode) Foundation
This section describes the most important commands, functions, and dialog concepts used in programming VIO applications. With only a few exceptions, all relevant language elements of Xbase++ are compatible with Clipper. Programmers familiar with Clipper can just read the "Keyboard and mouse" and "The default Get system" sections of this chapter. Note that the functionality of a VIO application is guaranteed in hybrid mode as well as in GUI mode.
The simplest form of data input and output is unformatted. Data is input or output at the current position of the screen cursor or print head. Xbase++ provides a set of commands for unformatted input and output. These are listed in the following table:
The three commands ACCEPT, INPUT and WAIT provide unformatted input. WAIT accepts a single keystroke while ACCEPT and INPUT allow any number of characters to be entered. Input via ACCEPT and INPUT is ended when the user presses the Enter key. Characters entered using INPUT are considered as an expression and are compiled using the macro operator (an error in the expression leads to a runtime error). Characters entered using the ACCEPT command remain unchanged and can be assigned to a memory variable as a character string.
The most commonly used commands for unformatted output are the single and the double question marks (? or ??). These are equivalent to the functions QOut() and QQOut(), respectively. The results of one or more expressions can be output using these commands. The default output device is the screen. The results of the expressions can also be saved in a file (after SET ALTERNATE ON) or sent to a printer (after SET PRINTER ON). If the command SET CONSOLE OFF is called before output, screen output is suppressed. After screen output has been suppressed, the screen output must be reactivated using SET CONSOLE ON after output to the file and/or printer is complete.
The commands LIST and DISPLAY are both used to output records from a database file. The command TYPE outputs the contents of any text file. The options TO PRINTER and TO FILE are valid with all three of these commands, so simultaneous output to a printer or a file can be performed without calling SET PRINTER ON or SET ALTERNATE ON. The screen output of these commands can be suppressed by first calling SET CONSOLE OFF.
The command SET COLOR changes the color for the display of screen output. The command is not really an output command, but allows the color of the output to be modified.
Detailed descriptions of the commands for unformatted input and output, including program examples, are found in the reference documentation.
Formatted input and output allows the exact position on the screen or printer (the row and column) for data input or output to be specified. Xbase++ includes commands and functions for formatted input and output. The commands are translated by the preprocessor to the equivalent function, which means that the difference between commands and functions is just a difference in syntax. The command syntax sometimes allow more readable program code, since many commands imply several function calls and the command syntax provides additional keywords. The following table lists the most important functions and commands for formatted input and output:
Some of these functions and commands affect only the position of the screen cursor but are included because the cursor coordinates mark the position where data is displayed. Other functions and commands manage the screen itself. In VIO mode, the origin (0, 0) of the coordinate system is the upper left corner of the screen or window. The lower right corner (MaxRow(), MaxCol()) represents the largest coordinate values that are visible. The position of the cursor is set by specifying the Row() and Col() to either the command @ or the function SetPos(). The screen is generally cleared using CLEAR at the start of each program prior to displaying anything for the first time. The commands @...BOX and @...TO draw boxes on the screen. They are only valid for the screen and are not available for the printer.
The most important command for formatted output is @...SAY which outputs the result of an expression. Output using @...SAY can occur on the screen or on the printer. Formatted output differs from unformatted output in that simultaneous output on the screen and printer is not possible. Selecting an output device is done using the command SET DEVICE (TO PRINTER or TO SCREEN). Output on the printer is at the current position of the print head which can be set using the functions PRow() and PCol(). The function SetPrc() resets the internal values for the row and column coordinates of the print head but does not reposition the print head.
The command @...SAY can be expanded to include data input using the GET option. Alternatively, an input field can be defined using the command @...GET. These commands are used to define one or more data entry fields prior to the actual data input which occurs within the READ command or the function ReadModal(). READ and ReadModal() both activate the default Get system of Xbase++ (see the later section on this).
Under an operating system with graphic user interface, the mouse (not the keyboard) is the most important input device for controlling the application. Because of this, running programs or individual modules is not controlled by program logic but by "events". These events are usually caused by actions of the user. Events, which come from outside the application, are temporarily stored by the operating system in an event queue and then sequentially processed by the application. Some examples of events would be: the mouse was moved, the right mouse button was clicked, the left mouse button was double clicked, etc. A keypress is also an event, which shows that events can come from various devices.
Each event is identified within the program by a numeric code. Each key has an associated unique numeric value and different mouse events have different numeric codes. In Xbase++, events are all handled by a group of event functions, regardless of their origin. There is also a group of functions and commands which assure language compatibility with Clipper. These compatibility functions and commands can only respond to the keyboard and they only consider the keyboard codes defined in Clipper. It should be noted that the numeric values associated with the various keys in Clipper do not necessarily match the event codes of the operating system or Xbase++ and the old keycodes are offered only for compatibility. A correlation is found between key codes and ASCII characters only in the range of 0 to 255. These compatibility functions and commands only consider the key codes defined in Clipper. The distinction between "event functions" and "keyboard functions and commands" is also shown in the following tables:
A detailed description of the compatibility functions can be found in the reference documentation.
AppEvent() reads events from the queue and also removes them from the queue. The return value of AppEvent() is the numeric code that uniquely identifies the event. The function SetMouse(.T.) must have been previously called for the AppEvent() function to register mouse events in VIO mode. The following program example is terminated when the right mouse button is pressed:
#include "Appevent.ch"
PROCEDURE Main
LOCAL nEvent := 0
CLEAR
@ 0,0 SAY "Press right mouse button to terminate"
SetMouse(.T.) // register mouse events
DO WHILE nEvent <> xbeM_RbDown // event: right mouse button
nEvent := AppEvent(,,,0) // wait until event occurs
IF nEvent < xbeB_Event // event: keypress
? "The event code for the key is:", nEvent
ELSE
? "The event code for the mouse is:" , nEvent
ENDIF
ENDDO
RETURN
The large number of possible events makes it impractical to directly program events using the numeric codes. Instead, the constants defined in the #include file APPEVENT.CH should be used. These constants all begin with the prefix xbe (which stands for xbase event) followed by an uppercase letter or an underscore. The uppercase letter identifies the category for the event and the underscore separates the prefix from the rest of the descriptive event name:
In addition to the return value identifying the event, the function AppEvent() modifies two parameters that are passed by reference. These are called "message parameters" and contain additional information about the event. In an event driven system such as Xbase++, it is often insufficient to receive only a single event code. For example, it is generally necessary to know the position of the mouse pointer if the event is "mouse click". When the function AppEvent() is called, two parameters must be passed by reference to contain additional information about the event after AppEvent() returns. If the event is a mouse click, the coordinates of the mouse pointer are contained in the first message parameter as an array of two elements. The following example illustrates this:
#include "Appevent.ch"
PROCEDURE Main
LOCAL nEvent := 0, mp1, nRow, nCol
CLEAR
@ 0,0 SAY "Press right mouse button to cancel"
SetMouse(.T.) // register mouse event
DO WHILE nEvent <> xbeM_RbDown // event: right mouse button
nEvent := AppEvent(@mp1,,,0) // wait until event
// occurs
IF nEvent < xbeB_Event // event: keypress
? "Event code:", nEvent
ELSEIF nEvent <> xbeM_Motion // mouse events exept
// 'mouse moved'
nRow := mp1[1] // mouse coordinates
nCol := mp1[2]
@ nRow, nCol SAY "The event code is:" + Str(nEvent)
ENDIF
ENDDO
RETURN
The variable mp1 is passed by reference to the function AppEvent(). After each mouse event it contains the row and column coordinates of the mouse pointer in an array of two elements. In the example, the contents of the array are assigned to the two variables nRow and nCol. The event code is output at this position, unless it is a mouse movement. The xbeM_Motion event occurs very frequently during mouse movement and would clutter the screen if displayed.
In VIO mode, the mouse coordinates are the most important information contained in the message parameters. In many other cases the parameters contain the value NIL in this operating mode but contain additional information when Xbase Parts are used (of course, Xbase Parts are not available in VIO mode) or when user-defined events are created using the function PostAppEvent(). The following example illustrates the basic relationship between the functions AppEvent() and PostAppEvent() which (along with their message parameters) create the basis for event driven programming:
#include "Appevent.ch"
#define xbeU_DrawBox xbeP_User + 1 // xbeP_User is the base value
#define xbeU_Quit xbeP_User + 2 // for User events
PROCEDURE Main
LOCAL nEvent := 0, mp1, mp2
CLEAR
@ 0,0 SAY " Draw Box | QUIT" // mouse sensitive region
SetMouse(.T.) // register mouse
DO WHILE .T. // infinite event loop
nEvent := AppEvent( @mp1, @mp2 ,,0 )
DO CASE
CASE nEvent == xbeU_DrawBox // user event
DrawBox( mp1, mp2 ) // mp1 = Date(), mp2 = Time()
// from PostAppEvent()
CASE nEvent == xbeU_Quit // second user event
QUIT
CASE nEvent < xbeB_Event // key was pressed
@ MaxRow(), 0
?? "Key code is:", nEvent
CASE nEvent == xbeM_LbClick // left mouse button click
@ MaxRow(), 0
?? "Coordinates are:", mp1[1], mp1[2]
IF mp1[1]== 0 .AND. mp1[2] <= 21 // in mouse sensitive
// region
IF mp1[2] <= 15
ELSE
ENDIF
ELSE
@ mp1[1], mp1[2] SAY "No selection made"
ENDIF
ENDCASE
ENDDO
RETURN
********************************* // define position and display
PROCEDURE DrawBox( dDate, cTime ) // box using mouse clicks
LOCAL nEvent := 0, mp1, nTop, nLeft, nBottom, nRight
SAVE SCREEN
@ 0, 0 SAY "Click on upper left corner of box"
DO WHILE nEvent <> xbeM_LbClick // wait for left mouse click
nEvent := AppEvent( @mp1,,, 0 )
ENDDO
nTop := mp1[1]
nLeft := mp1[2]
nEvent := 0
@ nTop, nLeft SAY "Click on lower right corner of box"
DO WHILE nEvent <> xbeM_LbClick // wait for left mouse click
nEvent := AppEvent( @mp1,,, 0 )
IF nEvent == xbeM_LbClick .AND. ;
( mp1[1] <= nTop .OR. mp1[2] <= nLeft )
Tone(1000,1) // lower right corner
nEvent := 0 // is invalid
ENDIF
ENDDO
nBottom := mp1[1]
nRight := mp1[2]
RESTORE SCREEN
@ nTop, nLeft TO nBottom, nRight // output box
@ nTop+1,nLeft+1 SAY "Date:" // display values of
?? dDate // PostAppEvent()
@ nTop+2,nLeft+1 SAY " Time:"
?? cTime
RETURN
In the example, one of the two user-defined events is generated when the mouse is clicked in the hot spot region of the first screen row. The mouse coordinates (contained in the message parameter mp1) are used to distinguish whether the xbeU_DrawBox event or the xbeU_Quit event is placed in the queue by PostAppEvent(). The user-defined event xbeU_DrawBox receives the return values of Date() and Time() as message parameters. When this event is retrieved from the queue by AppEvent(), the message parameters are placed in the variables mp1 and mp2. These values are passed to the procedure DrawBox() and displayed on the screen by this function.
The program is a simple example showing the logic of event driven programming. Events are identified by a unique numeric value (using a #define constant) and additional information about the event is contained in the two message parameters. The values contained in the two parameters mp1 and mp2 vary depending on the event. The message parameter values can range from NIL in the simplest case to complex data structures such as arrays or objects. PostAppEvent() can be used to place any event in the queue that can then be retrieved from any place in the program using AppEvent().
Xbase++ provides a Get system for formatted data input in VIO mode. The source code of this system is contained in the GETSYS.PRG file. The open architecture of the Get system offers tremendous possibilities such as data validation before, during and after data entry. It also offers a specific place where a programmer can identify and process events that occur during data input without having to change the basic language elements for defining input fields.
An input field is most easily created using the command @...SAY...GET. The data entry itself is started using the command READ:
USE Address ALIAS Addr
@ 10,10 SAY "First Name:" GET Addr->FIRSTNAME // define data
@ 12,10 SAY " Last Name:" GET Addr->LASTNAME // entry fields
READ // read input
In these four lines a database file is opened, two data entry fields are defined and input is performed via the READ command. Input is terminated when the entry in the second field is finished using the Return key or if the Esc key is pressed during input.
The command syntax is the easiest way to program data entry fields. This syntax is translated by the preprocessor into code that creates Get objects and stores them in the GetList array. Get objects include methods that allow the formatted display of values and interactive data entry. The data entry values can be contained in memory variables or in field variables. Access to the contents of data entry variables does not occur directly, but through a code block. This code block is called the data code block. The data code block is used by the Get object to read the value of a variable into the Get object's edit buffer and then to write the modified value back into the variable.
When a Get object has input focus, the user can modify the contents of the edit buffer. A Get object uses various methods to control cursor navigation and transfer characters into the edit buffer. Get objects can also perform data validation before and after data input. Rules for data validation are specified in code blocks contained in instance variables of the Get object.
The command @...GET creates a Get object that already contain a code block to access the specified variable. When Get objects are created directly using the class method Get():new(), a data code block must be specified. Get objects are stored in an array that is passed to the function ReadModal(). If the @...GET command is used, the array referencing the Get objects is contained in the variable GetList. The READ command passes the GetList array to the function ReadModal(). The ReadModal() function is the default edit routine which accesses various edit and display methods of the Get objects. The default Xbase++ Get system includes the ReadModal() function along with the other globally visible utility routines listed in the following table:
Two of the functions in the GETSYS.PRG file exist in order to ensure compatibility with the Clipper Get system. In these functions, the compatibility function Inkey() is used to retrieve keyboard entry. This is not compatible with the AppEvent() function which is used to read Xbase++ events. To make it easier to port existing Clipper applications to Xbase++, the compatibility functions are used by default in VIO mode. This means that the Get system reads only the keyboard using Inkey() and does not process any events. In this default mode, the Get system is completely compatible with Clipper but the mouse is not available.
The default setting is switched when SetMouse(.T.) is called before the first READ command or the first call to ReadModal(). Events in the Get system are then processed using the functions GetEventReader() and GetHandleEvent() instead of the functions GetReader() and GetApplykey(). In this setting the mouse is available. The function SetAppEvent() must be used instead of SetKey() to associate keystrokes with code blocks. The function GetEnableEvents( .T. | .F.) can also be used to switch between the compatibility mode and the event driven mode of the Xbase++ Get system.
The service functions of the Get system are rarely needed. The @...SAY...GET command is sufficient to allow complex data entry screens to be easily programmed. A detailed knowledge of the additional Get system functions is required when the default Get system is modified to meet unique requirements.
The source code of the Xbase++ Get system is contained in the file GETSYS.PRG and can be modified in just about any way. Changes should not be performed in the file itself but in a copy of the file. Before substantial changes to GETSYS.PRG are performed, other ways to modify the default behavior to meet individual requirements should be explored. For example, the instance variable oGet:reader contains a code block that calls a user-defined Get reader that can be used to provide special features. The Get reader code block must accept one parameter (the Get object) which must be passed as the first parameter to the function or procedure that implements the Get reader. The basic approach to implementing a special Get reader is shown in the following example. This code uses the compatibility function Inkey() to read keyboard input. The purpose of the example reader is to handle German language umlauts and "ß" entered as characters in the entry field. These characters are translated into their two character equivalents in the user-defined reader NoUmlauts() :
#include "Get.ch"
**************
PROCEDURE Main
LOCAL cName1 := Space(20), cName2 := Space(20)
@ 8,10 SAY "Input without umlauts and ß"
@ 10,10 SAY "First Name:" GET cName1 ; // define Get Reader
SEND reader := {|oGet| NoUmlauts(oGet) }
@ 12,10 SAY " Last Name:" GET cName2 ;
SEND reader := {|oGet| NoUmlauts(oGet) }
READ
RETURN
The definition of these input fields occurred using the command syntax. The code block which assigns the user-defined Get reader is specified using the SEND option. In it the reader code block is assigned to the instance variable oGet:reader. The Get reader itself is programmed in the following procedure:
***************************
PROCEDURE NoUmlauts( oGet )
LOCAL bBlock, cChar, nKey
IF GetPreValidate( oGet ) // perform prevalidation
oGet:setFocus() // set input focus to Get
bBlock := {|o,n1,n2| ; // translate within the code
GetApplykey(o,n1),; // block into two characters
IIf( o:typeOut, NIL, GetApplykey(o,n2) ) }
DO WHILE oGet:exitState == GE_NOEXIT
IF oGet:typeOut // no editable characters
oGet:exitState := GE_ENTER // right of the cursor
ENDIF
DO WHILE oGet:exitState == GE_NOEXIT
nKey := Inkey(0) // read keyboard
cChar:= Chr(nKey)
DO CASE // translate special characters
CASE cChar == "Ä"
Eval( bBlock, oGet, Asc("A"), Asc("e") )
CASE cChar == "Ö"
Eval( bBlock, oGet, Asc("O"), Asc("e") )
CASE cChar == "Ü"
Eval( bBlock, oGet, Asc("U"), Asc("e") )
CASE cChar == "ä"
Eval( bBlock, oGet, Asc("a"), Asc("e") )
CASE cChar == "ö"
Eval( bBlock, oGet, Asc("o"), Asc("e") )
CASE cChar == "ü"
Eval( bBlock, oGet, Asc("u"), Asc("e") )
CASE cChar == "ß"
Eval( bBlock, oGet, Asc("s"), Asc("s") )
OTHERWISE
GetApplykey( oGet, nKey )
ENDCASE
ENDDO
IF ! GetPostValidate( oGet )
oGet:exitState:= GE_NOEXIT // postvalidation
ENDIF // has failed
ENDDO
oGet:killFocus() // set back input focus
ENDIF
RETURN
Within the user-defined Get reader NoUmlauts(), keys are read using Inkey(). The keyboard input is then tested to see if it includes one of the German language characters Ä, Ö, Ü, ä, ö, ü and ß. If one of these characters is present, it is translated to the two equivalent characters Ae, Oe, Ue, ae, oe, ue, or ss. All other characters are passed along with the Get object to the function GetApplykey() which defines the default behavior for transferring characters into the edit buffer of Get objects.
In order to modify this Get reader to use the function AppEvent() for reading events (instead of just keystrokes), additional variables must be declared for the message parameters passed by reference to AppEvent(). Instead of GetApplykey(), the function GetHandleEvent() must be used for default handling of other events.
Along with formatted data input using @...SAY...GET with READ or using Get objects with ReadModal(), displaying an entire table is an important and frequently used interface feature. A table allows the user to interactively view large amounts of data. Data in a table is organized into rows and columns. This data can be from a database file open in a work area or from an array stored in memory. The TBrowse class and the TBColumn class are included in Xbase++ to allow tables to be displayed. These classes are used together but each performs a specific set of tasks when displaying tables. Table display is possible only through the combined efforts of objects of both classes. A TBrowse object performs the screen display and controls the current row and column of a table. A TBColumn object provides the data for a column of the table displayed by the Tbrowse object. TBColumn objects must be assigned to the TBrowse object and are used by the TBrowse object when a user views a table.
The TBrowse and TBColumn classes are associated with a set of functions that exist in Xbase++ only to provide compatibility with Clipper. The source code for the compatibility functions listed in the following table are contained in the files DBEDIT.PRG, BROWSYS.PRG and BROWUTIL.PRG.
TBrowse objects provide a versatile mechanism for displaying data in the form of a table. TBrowse objects display tabular data in a defined section of the screen (the browse window).
Tables are often too large to be entirely displayed on the screen. TBrowse objects provide methods that allow tables to be viewed interactively on the screen. The TBrowse class is designed so that an object of this class does not know anything about the data source it displays. To display data, a TBrowse object relies on one or more objects of the TBColumn class to provide the data for individual columns in the table. A TBrowse object displays the data provided by the TBColumn objects on the screen. Each TBColumn object deals with only one column of the associated table. The TBrowse object manages its own cell cursor and displays the data in the current row and column of a table (the current cell) in a highlighted color.
A user can position the cell cursor in the table using the cursor keys. A TBrowse object includes many methods which move the cell cursor. As soon as the user tries to move the cell cursor out of the Browse window, the TBrowse object automatically synchronizes the visible data on the screen with the data of the underlying table and scrolls the data in the browse window.
Since the data source of the table is not known to the TBrowse object, three functions must be specified to execute the three basic operations that can be performed on a table: jump to the start of the table, jump to the end of the table and change the current row within the table. These operations are comparable to the file commands GO TOP, GO BOTTOM and SKIP. These functions are provided to TBrowse objects as code blocks that are automatically executed within specific methods of the TBrowse object.
The browse window where the TBrowse object displays tabular data can be divided into three areas: headers or column titles, data lines containing the data, and footers at the bottom of each column. Each area, as well as each individual column, can be optionally delimited by a separating line.
In contrast to TBrowse objects, TBColumn objects are very simple objects that contain instance variables but do not have their own methods. TBColumn objects are needed to provide data for tables displayed using TBrowse objects and are useless without an associated TBrowse object. A TBColumn object contains in its instance variable all of the information required for displaying a single column of a table in the browse window of the TBrowse object.
The most important TBColumn instance variable (:block) contains a data code block that provides the data from the data source for a column of data. This code block might access a field variable in a work area, or a column in an array. TBColumn objects can also control the color of the data displayed based on its value.
If new values are assigned to the instance variables of a TBColumn object after the TBrowse object has already displayed data using the TBColumn object, the method oTBrowse:configure() must be executed to update the columns in the browse window (see TBrowse class). | https://doc.alaska-software.com/content/xppguide_h2_applications_in_character_mode_vio_mode.html | CC-MAIN-2022-05 | refinedweb | 4,256 | 59.94 |
What I am trying to do:
- A function to add one to the current count.
- A function to subtract one from the current count.
- A function to reset the count to zero.
- A function that returns the current count.
Do not write a constructor for this class.
Write a main( ) function that uses this class
Your program should work as follows:
- Display your student information
- Create a Counter object.
- Write a loop that:
- Prompts the use with the following menu: 1 - add 1 to Counter
2 - subtract 1 from Counter
3 - display contents of Counter
4 - reset counter
5 - exit program
Does the class object go in the header file or is it okay here? What do I put in the header file? What I have so far, which is incomplete, but I want to see if I'm on the right track:
#include <iostream> #include "counter.h" using namespace std; class Counter { public: int myCounter() void increment() { Count++; } void decrement() { Count--; } void display(); void resetCounter(); }; int main() { cout << "\nSelect from the following options: Type" << endl; cout << "\n1 to increment the counter" << endl; cout << "\n2 to decrement the counter" << endl; cout << "\n3 to display the contents of the counter" << endl; cout << "\n4 to reset the counter to zero" << endl; cout << "\n5 to exit this program." << endl; cout << "\nValid operators are 1 - 4 " << endl; cin >> num1; switch( num1 ) { case'1': increment(); break; case'2': decrement(); break; case'3': display(); break; case'4': resetCounter(); break; case'5': exit(1); default: cout <<"Error, not a valid operator."<<endl; return 0; } void incCounter() { | https://www.daniweb.com/programming/software-development/threads/59840/need-help-creating-a-simple-counter-program-using-classes | CC-MAIN-2017-47 | refinedweb | 259 | 75.74 |
Discussion in 'Social Networking Sites' started by wordgeist, Nov 11, 2011.
Hi,
in your experience where can be more beneficial get +1 or FB likes (in a fan page) ?
Both...
But personally FB likes are more profitable..
FB Likes is better
in a fan page? let me think.. likes? duhh
FB likes.
+1s aren't so much in demand.
This means +1s are not worth the trouble?
Both are important for any eCommerce website.
def facebook likes
FB likes are better than +1
Fb likes. Google Plus didn't live up to the hype.
definitely FB likes
FB likes. google+ should be penalized for duplicate content :yeah:
IMO FB likes is the best choice .
Separate names with a comma. | https://www.blackhatworld.com/seo/1-or-fb-likes.371653/ | CC-MAIN-2017-51 | refinedweb | 119 | 88.33 |
Full Disclosure
mailing list archives
Often times trends dominate and suffocate a population. We naturally learn
by following. But occasionally in order to keep things interesting we gotta
mix it up.
We've seen DLL injections, we've seen them carefully placed in WebDAVs,
bundled in ZIPs(ugh), fixit'd, and flooding advisory lists of 2010.
So here's _just another_ method (for great justice ;), I'm not claiming
this is innovative or even that original. DLL hijacking is just the gift
that keeps giving.
There exists an often overlooked vector that is the installers themselves.
Often times we simply look at the product of the installer expecting that
to be beginning when in fact it's actually the end. What if we didn't care
how long it took to infect a host? What if we were waiting for just that
right
vulnerable application to come along and present itself? What if we could
plant a latent exploit that would activate when this vulnerable application
showed us its throat? This is all possible in one of the most commonly
known directories of all time: %USERPROFILE%\Downloads. The simplest
method sometimes just works, we forget that it's not necessary to only
target the top 10% smartest IT people with the highest levels of
access to information behind the greatest HIPS and firewalls known to man,
it only takes one DLL and one installer/update to get a foothold.
Overview:
DLL hijacking + commonly overlooked installers + a common download
directory that is rarely cleaned + a simple redirection page = phish in a
bucket.
Advantages:
-there are so many vulnerable installers that it doesn't matter as much if
they dont go fetch the first installer you throw, so long as you get that
dll in the DL folder.
-MS\d\d-\d\d\d wont/can't fix it unless they make hardfixes for individual
web browser directories (which they should, plugins should never be ran in
the download dir)
-all advantages of DLL injection: requires no strange unsigned binary to be
ran by the target, we'd like to believe that users are savvy about not
_running_ untrusted
binaries but very few will see the harm in _saving_ one. Oh and what's a
DLL? A lot of users will run the installers directly from the browser UI
without even knowing
where there Downloads folder is. The current make of chome has an option to
"remove from list" which may give the impression that it is deleted..
Deleted from view is good enough for most users and good enough for us.
Ignore show in folder. That's there for show.
-no complicated/annoying webdav setups
-not as much suspicious, snort'able, sig'able network traffic.
-can be put on any free host that will let us put our js redirector (or use
some<script>document.location=""</script>one else's for more confidence ;)
-does_not_have_to_be_performed_simultaneously, this leaves it open for
tactics.. lots. Check your access logs to verify they have the DLL and
brainstorm.
-target doesn't need to finish the installation at all because the DLLs are
loaded before displaying an interface in most cases.
Disadvantages (for the attacker):
-can't name the dll anything else for cover... Has to be its target dll
name on disk and will be impossible unless you leverage a browser spoofing
bug.
-nearly all these installers can be fixed overnight with little to no
testing needed for the new builds, this is just the part of being an
opportunist
-browsers can fix this pretty easily as well (if DLL then if DLL in
common_list then rename file).
-assumes they leave the dll in the download directory
-they still have to click save :( (more convincing your phish, more you
catch tho, true of all methods).
-this method will be largely HIPS/AV proof until they read this.. I imagine
the checks will be simple, another cost of opportunism.
So you've read all this and you've found the most glaring problem... How
many installers can actually be attacked in this way? Otherwise we really
have no vector at all do we?
Some stats (for dwmapi.dll alone, probably one of the best to check for):
Application installers tested - 50
Application installers vulnerable - 41 !!
Percentage - 82%
I leave it as an exercise to the readers to discover new DLLs and app
installers to check..
Currently working on automating downloading installers/auditing in a vm,
maybe more results later in the week.
Attack Method:
1.) Recon, know what they have installed. Who's going to go out get an
update for software they don't even have?
2.) Template a convincing email from pre-existing emails from the
developer/company.
3.) Setup domain, find free hosting or find a decent XSS in the dev's site.
4.) Write simple HTML to display a security update warning page or some
other nonsense (yes template again from their styles if possible),
have the browser download the DLL stager right as the page redirects to
the devs download page, this gives the illusion they're at the vendor domain
for the real payload while distracting them with a very real installer
download page.
5.) Wait til you get a connect back or whatever your method of C&C is.. I
like to ping unlisted pastebin pages and watch the world burn.
Improving the method:
6.) remove audit trail, copy real dwapi.dll from system dir over our stager
dll and inject thread into another privileged process as the installer
will not likely be ran for long.
7.) automating steps 2,(3?),4-5 then scanning mailing lists for potential
targets.
0.) Writing a truly fantastic payload other than calc.
8.) Writing payloads on a per app basis, shame browser history scanning
doesn't work as well but you might have some luck with scanning plugins:
A shoddy example for Oracle to fix after reading this:
The JRE offline installer and chrome installer have been confirmed
vulnerable as of today.
dwmapi.dll:
#include <windows.h>
int dll_hijack()
{
WinExec("calc", 0); // boring payload
// exit(0); // ;)
return 0;
}
BOOL WINAPI DllMain (
HANDLE hinstDLL,
DWORD fdwReason,
LPVOID lpvReserved)
{
dll_hijack();
return 0;
}
index.html:
<html>
<head><title>Emergency Java Update</title></head>
<iframe src="/update/dwmapi.dll" width=0 height=0 style="hidden"
frameborder=0 marginheight=0 marginwidth=0 scrolling=no></iframe>
<script type="text/JavaScript">
setTimeout("location.href = '';",3000);
</script>
<body>
An emergency patch update has been issued for the Java Runtime Environment,
please click "Accept Download" on the 'dwmapi.dll' file.<br>
This patch is a security update and should be installed immediately, you
will be redirected to the offical Oracle site shortly.<br>
Thank you for your cooperation in this matter.</body>
</html>
Conclusions:
Practice safe library loads, don't click save, and don't be an idiot with
this.
uh.. some vulnerable installers you can use in your payloads:
realplayer,vlc,idafree,github,synergy,winamp,utorrent,operat,avg,itunes,7zip,safari,skype,spypod
snd,keepass,truecrypt,winzip,avast,notepad++,yahoomsgr,
pidgin,googletalk,MS sec essentials,adobe reader, google desktop, Windows
DOTNET 4.0 INSTALLER, processhacker,putty,kindle,wireshark,AMD catalyst
drivers,silver light, Intel PRO/Wireless 3945ABG, shockwave,vmware player,
IE9, virtual box, and alcohol to name a few.
_______________________________________________
Full-Disclosure - We believe in it.
Charter:
Hosted and sponsored by Secunia -
By Date
By Thread | http://seclists.org/fulldisclosure/2012/Aug/134 | CC-MAIN-2014-41 | refinedweb | 1,225 | 54.63 |
Setting up your project on GCP fast using Terraform and Kubernetes
Hi! My name is Angelina, and I’m a DevOps Engineer at Valor Software. With the help of this article, we’ll set up your GCP environment to work in tandem with Terraform. I’ll guide you through the setup of a basic cluster. For this, I picked the services that I use daily within my DevOps routine, since they are optimal for your typical project setup. Let me explain myself here! By typical I mean common projects that are natural (habitual) for your company or industry. In this case, I bet you’d appreciate a chance to build the environment once and clone it for future projects. That’s exactly the way you can go with the services I offer below. So, once you learn the basics for the project setup in this stack, you’ll be able to run new ones in the cloud in no time.
Automated setup with Terraform
When we need to set up a cloud infrastructure for the project, we want to make it quickly. That’s when automation tools come to help. Terraform is one of the instruments that serve for automated setup, and it is compatible with more than 70 providers, which is beyond handy. Besides, Terraform is pretty straightforward to get along with thanks to its declarative language. You don’t need to get used to a completely different CLI, like in cases when you switch to another cloud provider.
Why I suggest picking Terraform from the great variety of services is because it’s perfect for creating reusable infrastructures. You can also clone the existing infrastructure and apply it to your next project, with small alterations if needed. This benefit of reusability, together with the security that Terraform provides, makes it a first-choice technology for solving my daily tasks. BTW, it’s also the right place for keeping electronic keys and hidden or encrypted variables.
Another good point is that Terraform allows for managing several cloud infrastructures from different providers in parallel with minimal time and effort spent.
In this article, I’ll lead you through setting up infrastructure on Google Cloud using Terraform, so buckle up!
Kubernetes on Google Cloud Platform
Being one of the native Google products, Kubernetes is integrated into GCP quite as is, with no alterations. So you can conveniently set it up and manage it through the GCP CLI or with the help of external instruments like Terraform.
Before you begin
- Create a Google Cloud project
- Create a service account key and download it in JSON format
Terraform and GCP setup step-by-step
Create a new directory for the project and create a main.tf file for the Terraform config, and populate it with the following content:
provider "google" {
credentials = file("CREDENTIALS_FILE.json")
project = "your-project"
region = "us-west1"
}
Before we jump to the next step of creating a configuration file, we should remember to keep data (e.g. keys, project names) in separate files. This way we ensure project security and give ourselves a chance to reuse the configuration in the future. So, locate the project name, region, and credentials file in a separate file with variables.
First, create a variables.tf file and declare variables for it:
variable "credentials" {
type = string
}variable "project" {
type = string
}variable "region" {
type = string
}
Add the variables’ values to secrets.tfvars:
credentials = "CREDENTIALS_FILE.json"
project = "your-project"
region = "us-west1"
Then format your main.tf file like so:
provider "google" {
credentials = file(var.credentials)
project = var.project
region = var.region
}
Now, when your variables are safe, you’ll be able to pick the needed files with variables instead of repeatedly typing in new data in the main file.
With the `terraform init` command, you’re pulling up modules that you will need to proceed with further steps.
terraform init
If you see this message, it’s a success! Hurray!
Terraform has been initialised!
For the next step, you add variables to the variables.tf file:
variable "cluster_name" {
type = string
}variable "cluster_zone" {
type = string
}variable "app_name" {
type = string
}
Before creating a cluster, you should first add variables describing this particular cluster to the secrets.tfvars file:
cluster_name = “cluster-1”
cluster_zone = “us-west1-a”
app_name = “test”
Now add the cluster configuration to your main.tf file:
resource "google_container_cluster" "cluster-1" {
name = var.cluster_name
location = var.cluster_zone
initial_node_count = 3
node_config {
labels = {
app = var.app_name
} tags = ["app", var.app_name]
}
timeouts {
create = "30m"
update = "40m"
}
}
In the configuration, you define the cluster’s name, its location, and the number of nodes and their labels. The default namespace is the place where you create a cluster.
To operate with the cluster and its components conveniently, you need to create an output.tf file, where you’ll add variables that will be displayed after running the `terraform apply` command. You can use them later by calling them during configuration.
output "cluster" { value = google_container_cluster.cluster-1.name}
Now add a new resource which is deployment:
resource "kubernetes_deployment" "example" {
metadata {
name = "terraform-example"
labels = {
app = var.app_name
}
} spec {
replicas = 3 selector {
match_labels = {
app = var.app_name
}
} template {
metadata {
labels = {
app = var.app_name
}
} spec {
container {
image = "nginx:1.7.8"
name = "example" resources {
limits = {
cpu = "0.5"
memory = "512Mi"
}
requests = {
cpu = "250m"
memory = "50Mi"
}
} liveness_probe {
http_get {
path = "/"
port = 80 http_header {
name = "X-Custom-Header"
value = "Awesome"
}
} initial_delay_seconds = 3
period_seconds = 3
}
}
}
}
}
}
In the deployment configuration, you specify the number of replicas, tags, labels, an image that we’re going to use, as well as internal resources. Finally, you have it all ready for the first launch and go with this command:
terraform plan -var-file=secrets.tfvars
In this way, you check if the configuration is created properly and if you’re satisfied with the range of resources.
When you’re quite sure that everything is correct, it’s time for the `terraform apply` command:
terraform apply -var-file=secrets.tfvars
And don’t forget to specify the file with variables! At this stage, you’ll have to confirm your actions by running a `yes` command. Terraform will build your new GKE cluster on GCP. After the cluster is created, you’ll see the output list.
For your convenience, in the future, you can split the config file into a few separate files. Place the provider block in the providers.tf file, and a “google_container_cluster” block — in the cluster.tf file.
Good job!
You’re almost done with your journey, the cluster is up and running, and you can be (ugh) proud of yourself!
For your future projects, you’ll be able to add more metrics and parameters when creating a resource. This will help you adjust your configuration for solving every particular task. | https://valorsoftware.medium.com/setting-up-your-project-on-gcp-fast-using-terraform-and-kubernetes-89cdcc5d51f8?source=user_profile---------6---------------------------- | CC-MAIN-2022-27 | refinedweb | 1,117 | 56.86 |
03 September 2008 05:26 [Source: ICIS news]
SINGAPORE (ICIS news)--Methanex is restarting its 900,000 tonne/year methanol plant in Motonui, New Zealand, after four years of non-operation after additional feedstock gas had been secured, a company official said on Wednesday.
Methanex has signed a new gas contract that allows it to run one of the two idled plants for two years, said company public affairs manager Zaneta Ewashko.
“It’s in our plans to produce methanol by end of September,” she added.
Another company source said Methanex will continue running its 500,000 tonne/year ?xml:namespace>
The Waitara unit remains a flexible asset and can be restarted if additional gas is secured, the source added.
The two methanol plants at the Motonui site were shut down in 2004 due high feedstock prices and low margins. The other unit with the same 900,000 tonne/year capacity will remain idle. | http://www.icis.com/Articles/2008/09/03/9153638/methanex-restarting-idled-900000-ty-nz-plant.html | CC-MAIN-2014-52 | refinedweb | 154 | 59.23 |
Eclipse do not show output
I'm making 2D drawing on Eclipse Oxygen, there are no error in my code but why it does not show any output. I mean when I click run there are no progress.
import java.awt.Color; import java.awt.Frame; import java.awt.Graphics2D; import java.awt.geom.Arc2D; import java.awt.geom.Rectangle2D; public class HOUSE1 extends Frame { public void paint(Graphics2D g) { Graphics2D g2d = (Graphics2D) g; g2d.drawString("HOME SWEET HOME",80,60); setBackground(Color.white); Arc2D arc1 = new Arc2D.Double(250,50,500,300,225,90,Arc2D.Double.PIE); g2d.draw(arc1); g2d.setColor(Color.red); g2d.fill(arc1); Rectangle2D rect = new Rectangle2D.Double(325,300,350,300); g2d.draw(rect); g2d.setColor(Color.blue); g2d.fill(rect); Rectangle2D rect1 = new Rectangle2D.Double(325,300,350,300); g2d.draw(rect1); g2d.setColor(Color.black); g2d.fill(rect1); } public static void main(String[]args){ HOUSE1 f = new HOUSE1(); f.setTitle("HOUSE"); f.setSize(300,100); } }
3 answers
- answered 2018-01-14 10:57 BluEOS
You forgot to make your frame visible.
Just add :
f.setVisible(true);
You have to fix your paint method declaration to :
@override public void paint(Graphics g) { // your code }
- answered 2018-01-14 10:57 Kevin Anderson
Your window is blank because your
paintmethod is never called. Your method
public void paint(Graphics2D g) // DOESN'T WORK
needs to be changed to
public void paint(Graphics g) // Correct
so that it overrides the
paintmethod in
Frame. The graphics system will only call
paint(Graphics); if your method called
paintisn't overriding the method
paint(Graphics)in
Frame, the one in
Framegets called instead of yours.
- answered 2018-01-14 10:57 kobar1990
1st: In your main void you need to set your frame (f) to visible --> f.setVisible(true)
2nd: Also you might want to f.pack(); right before you set it to visible to to make sure your components are behaving like expected.
3th: In java we use a capital first letter in class like this "House", fully capital words are used for final's. | http://codegur.com/48248871/eclipse-do-not-show-output | CC-MAIN-2018-05 | refinedweb | 348 | 50.63 |
Part 5: Use an ORM to Create Your Data Layer
In this last part of the series, we talk about how to use ORMs to speed up the creation of your data access layer.
We programmers are a lazy bunch.
We always try to find ways to make our life easier by using the computer to do the heavy lifting for us. Heck, that was the reasoning for this whole series.
For the last part of this series, we'll cover a couple tips on how to maximize a particular ORM (specifically Entity Framework) to quickly generate your data layer for your application.
Why use an ORM?
So everyone needs a persistent storage for their application, right? So why not use an ORM. Well, there are some advantages and disadvantages.
Using an ORM (Object-Relational Mapping) significantly reduces the amount of time it takes to create a data access layer for any application. That's the advantage.
One disadvantage is that you may need to put time in up-front to figure out the details of how that ORM actually works. Each ORM is different. For example, NHibernate uses XML mapping files while Entity Framework is starting to move towards a Code-First mentality (starting in EF 7).
To be honest, I find the advantages outweigh the disadvantages.
Entity Framework
As if you didn't know, my ORM of choice is Entity Framework. I have worked with a select few ORMs and I can just hear some developers asking why Entity Framework. Here are my reasons:
- I've been using Entity Framework since 2008 when it was released. Over time, I've worked out the kinks and kicked the tires enough to know how it works and how to optimize it.
- It comes out of the box with Visual Studio.
- DanylkoWeb is running on it.
- It generates a Data Access Layer in no time flat (when using an existing database) with plenty of extensibility.
- It uses T4 to write out the Unit of Work DbContext. Definitely a plus if I need to modify the T4 template (If interested in T4, I would also recommend the article about revving up your code with T4 in this series).
With that said, I've talked enough about Entity Framework. Let's dig into it and learn some tips and tricks to speed your development!
Reverse Engineer Database-First into Code-First
We will cheat a little bit here and use an existing database. The whole idea here is to create almost 80-90% of your data access layer with little to no effort.
You will also need an extension for this little trick: Entity Framework Reverse POCO (Plain Old CLR Object) Generator. You can find this extension at this link or use Visual Studio's Extension Manager and install it from the Online section.
For those who have used the Database-First option before, you'll appreciate this trick. You won't have to look at that mapping connection string in the web.config ever again.
Once you have the extension installed and you have a database, you are ready to generate your Code-First entities. I place mine in a folder called GeneratedClasses.
I created my folder called GeneratedClasses off the root. Now, Right-Click -> Add -> New Item. At this point, I always use the Online category in the accordion menu on the left. Just type in the name of the extension in the top-right hand corner and you'll find it.
Give your T4 template a name (as you can see I called mine FaqModel.tt from our ThinController project) and click Add.
Three files should be in your GeneratedClasses folder: FaqModel.tt (or whatever you called it), EF.Reverse.POCO.Core.ttinclude, and EF.Reverse.POCO.ttinclude. Only work with your model.tt file. Leave the other two alone unless you really want to get into T4. :-)
Open your FaqModel.tt template.
I know it doesn't look like much, but we are just focusing on the parameters of the T4 template for right now.
Expand the outline and view the parameters.
The primary settings I focus on are:
- DbContextName - Custom name for your Context.
- ConnectionStringName - This is a plain old ConnectionString in your web.config, NOT an EF Mapping Connection String.
- MakePartialClasses - I make this true to hold our business logic in another location.
- GenerateSeparateFiles - Just a general note, I know I should make this true, but I like it self-contained in one file in one directory that I don't touch.
If you scroll down a little further, there are a couple other parameters that I set. Scroll down and you'll see:
- SchemaName - I do partition some of my tables into appropriate schemas so if I only wanted to generate entities based on one schema, I would enter the schema name here.
- PrependSchemaName - I always set this to false unless I have an entity naming conflict.
Once these are entered and you have a legitimate ConnectionString, press Ctrl-S and your FaqModel.tt will generate the classes underneath the T4 template for you to use in your app.
Create your Business Logic
When you have your entities generated, you need to focus on the business logic for each one (if any). I know what you're thinking. How do we add business logic to a class that is automatically generated?
Remember the partial setting in the T4 template? When we set that to true, it set the classes to partial. Now that you have partial classes, you can add any type of business logic to an existing entity in another directory.
Why are my partials grayed out?
It you don't have your partial classes in the GeneratedClasses folder (which I usually don't), wherever you placed your partial classes, they need to have the same namespace as the GeneratedClasses.
So in our example, if we created our Entity Framework classes in the GeneratedClasses folder (ThinController.GeneratedClasses) and we placed our business logic/partial classes in a Classes folder off the root (ThinController.Classes), then your partial class would look like this:
using System; using System.Collections.Generic; using System.Linq; using System.Web; namespace ThinController.Classes { public partial class Faq { } }
You need to change the namespace to match your EF generated classes.
using System; using System.Collections.Generic; using System.Linq; using System.Web; namespace ThinController.GeneratedClasses { public partial class Faq { } }
Now you're on your way.
You can easily add interfaces to your entities. Place an IFaq interface on your partial class and you're all set.
If you need to add an attribute to your class, it's best to create an inherited class and attach the attributes to that particular property or method instead of touching the T4 generated classes.
Conclusion
Even though this walkthrough of Entity Framework was a little slow for some, I hope it gave some developers an idea of how to generate a Data Access Layer relatively quick. If your database was designed correctly, it should take you 70-80% of the way. The only thing left is to attach the business logic to each entity.
ORMs (including Entity Framework) are extremely helpful for building out quick data access layers and getting a prototype up and running relatively fast. If you know how to maximize your ORM tool, you can generate websites and applications with the flick of a switch with little effort.
I hope you've enjoyed this series and if anyone has any other speed techniques, post them in the comments below! I'm always open to new and interesting techniques. :-)
Series: How to take your ASP.NET MVC development to ludicrous speeds.
- Transforming XML/JSON/CSV into Classes
- Use pre-built applications
- T4 (Text Template Transformation Toolkit)
- ReSharper/SQL Complete
- ORM (Object Relationship Management)
Do you build your applications any differently from any of these 5 methods of coding? Let me know and share with everyone! Post your comment below. | https://www.danylkoweb.com/Blog/part-5-use-an-orm-to-create-your-data-layer-QB | CC-MAIN-2017-17 | refinedweb | 1,326 | 66.33 |
Python library for powerschool learning.
Project description
Powerschool Learning API
This is a simple asynchronous api for interfacing with powerschool learning.
Installation
pip install powerschoollearning Works best.
Example
import powerschoollearning import asyncio import logging logging.basicConfig(level=logging.INFO) client = powerschoollearning.ps("<my refresh token>", "lakesideblended.learning.powerschool.com") async def main(): await client.login() for school_class in client.classes: print(f'Found class {school_class.name} at {school_class.url}.') loop = asyncio.get_event_loop() loop.run_until_complete(main())
This program will take a look at the user's classes and print every classes name and url.
Refresh Tokens
Since logging into powerschool is handled via oauth, we use refresh tokens to authenticate the user, to get your refresh token push look in the network -> cookies tab of the development tab of a browser while you load powersscool.
Not finished.
This very much is not finished, and does not support a lot of stuff. This is a work in process.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages. | https://pypi.org/project/powerschoollearning/1.0.1/ | CC-MAIN-2021-39 | refinedweb | 185 | 52.56 |
Debugging from an ASP.NET Engineer. Posts are from customer issues and things I feel may be useful.
I wanted to start a conversation with everyone on the thoughts around Cloud Computing. I have been using Azure for a while now and I have found some interesting things out about it.
Before I start talking about those things though, I wanted to see who was planning on using this technology or who is already using it. This would include other Cloud solutions as well.
If you are, what are you planning to do in the Cloud? How are you going about setting up testing, development, maintaining, monitoring in the Cloud?
I think that Cloud Computing is the future in a lot of ways and feel like things are going to change in a fundamental way in the not to distant future because of Cloud Computing. Do you agree?
Please keep in mind that I am not saying that Cloud Computing is a whole new way methodology, but I do think it will enable scenarios that weren’t possible before and will allow us to push the envelope of what we are capable of doing with a computer.
I look forward to hearing back from you and talking more about Azure and Cloud Computing.
Just a quick update on this. I had to make a few changes to my site and I now have it working!
To fix the master page problem, I needed to load it from code behind. Once I did that, I was able to have that show up. But then I had a problem of the Silverlight application didn’t show up at all.
To get around that I needed to get rid of the width and height settings from the Silverlight object. So I needed to change from using width=100% height=100% to style=”width: 700px; height: 700px”
After making that change, the only thing left was to move my connection string settings into the web.config file for SharePoint. After that was done, my Silverlight Navigation project loaded just fine in SharePoint and was able to use RIA Data Services.
I hope these two posts help anyone else looking to do this. Let me know if you run into any other problems or have any suggestions.
I have been working on getting Silverlight 3.0 to work with SharePoint 2007 and I wanted to share with you the progress I have made and some of the challenges I have remaining.
This project uses Silverlight 3.0, the Silverlight Toolkit for 3.0, and RIA Data Services. So it is basically using as much as it can that is new. This means we have a Entity Model and a ASP.NET web application that the Silverlight application will use. It also uses authentication using the new Domain Service for authentication.
So the first thing I did was to follow the steps in this blog post about Silverlight 2. I just changed it to be the System.Web.Silverlight from 3.0. The suggestion for upgrading the web.config for Silverlight worked great for bringing most of the stuff I needed.
I then did the following steps:
I then made some changes to the web.config of my project, namely removing everything that was already in the web.config for SharePoint. The last change I did was to make the bin folder have FullTrust. I did this by adding the following to the wss_minimaltrust.config file:
1: <CodeGroup class="UnionCodeGroup" version="1"
2:
3: <IMembershipCondition
4: class="UrlMembershipCondition"
5: version="1" Url="$AppDirUrl$/bin/*"
6: />
7: </CodeGroup>
After making these changes, the next problem I ran into was around RIA. It makes calls using a DataService.axd. So that needed to be added to the web.config file. In <system.web>:
1: <httpHandlers>
2: ...
3: <add path="DataService.axd" verb="GET,POST" type="System.Web.Ria.DataServiceFactory, System.Web.Ria, Version=2.0.0.0, Culture=neutral, PublicKeyToken=31BF3856AD364E35"
4:
5: </httpHandlers>
And <system.Webservers>:
1: <handlers>
3: <add name="DataService" verb="GET,POST" path="DataService.axd"
4:
5: </handlers>
That information is talked about in the Silverlight forum for getting it to work with Azure here.
I then tried to get my application to load the SharePoint master page but I ran into a problem where it tells me:
1: The referenced file '<path to master>' is not allowed on this page.
I am currently investigating that error and will post more as I progress. If anyone else is trying to get this to work with SharePoint or has any suggestions, I’d love to hear them.
There is a new video up on youtube that is the beginning of many more videos. You should check it out and look for for more coming soon.
Also, see if you recognize any of the people in this, feel free to post here who you think they are.
There.
There are a lot of different things you can use to monitor a production ASP.NET web site for problems. Some of the most common are logging, perfmon counters and the like. There is also the method of getting feedback from people using the site when they relay that there is a problem.
The question I would like to talk about is how do you use this information for future projects.
I think the most obvious way is the create a type of best practices document from the learning that you have had in the past. For example, using StringBuilder if you are going to be dynamically building up strings.
Another useful method is sharing code that is already in production so that other future projects can use it. This not only has the added benefit of less development time, you know this code has been running in production and will work correctly and not cause issues.
Sometimes you can notice things in production that you are unable to fix. For example something that would take an entire redesign of the web site to fix. But these types of things can be passed on to the next project where some of the design decisions haven’t been made yet. One such decision could be how many servers should handle each layer of your site. And how many database servers you should have.
What other things do you do with your learnings from previous web sites? Do you look at places where you over-analyzed a problem and spent too much time solving something that didn’t need such a complicated solution? I’d love to hear what else people do. Does the technology play a role in future sites? Like would you consider changing to Silverlight or MVC because of something that happened on a previous site?
I was reading this great post by Jeff Wilcox and quickly found out that some of the needed code to get this to work was missing from his post.
So I went about recreating the missing parts and getting this to work. Here is what mind looks like now that it is functional:
To get to this work, I followed the same steps that Jeff mentioned so I will not go through them here. But what I will do is give you the source code that I used.
1: <navigation:Page x:Class="TestProject.Views.Test"
2: xmlns=""
3: xmlns:x=""
4: xmlns:chartingToolkit="clr-namespace:System.Windows.Controls.DataVisualization.Charting;assembly=System.Windows.Controls.DataVisualization.Toolkit"
5: xmlns:datavis="clr-namespace:System.Windows.Controls.DataVisualization;assembly=System.Windows.Controls.DataVisualization.Toolkit"
6: xmlns:navigation="clr-namespace:System.Windows.Controls;assembly=System.Windows.Controls.Navigation"
7:
8: <navigation:Page.Resources>
9: <ControlTemplate x:
10: <Grid x:
11: <VisualStateManager.VisualStateGroups>
12: <VisualStateGroup x:
13: <VisualStateGroup.Transitions>
14: <VisualTransition GeneratedDuration="0:0:0.1"/>
15: </VisualStateGroup.Transitions>
16: <VisualState x:
17: <VisualState x:
18: <Storyboard>
19: <ColorAnimationUsingKeyFrames BeginTime="00:00:00" Duration="00:00:00.0010000" Storyboard.
20: <SplineColorKeyFrame KeyTime="00:00:00" Value="#FFFFDF00"/>
21: </ColorAnimationUsingKeyFrames>
22: <DoubleAnimationUsingKeyFrames BeginTime="00:00:00" Duration="00:00:00.0010000" Storyboard.
23: <SplineDoubleKeyFrame KeyTime="00:00:00" Value="0.24"/>
24: </DoubleAnimationUsingKeyFrames>
25: </Storyboard>
26: </VisualState>
27: </VisualStateGroup>
28: <VisualStateGroup x:
29: <VisualStateGroup.Transitions>
30: <VisualTransition GeneratedDuration="0:0:0.1"/>
31: </VisualStateGroup.Transitions>
32: <VisualState x:
33: <VisualState x:
34: <Storyboard>
35: <DoubleAnimationUsingKeyFrames BeginTime="00:00:00" Duration="00:00:00.0010000" Storyboard.
36: <SplineDoubleKeyFrame KeyTime="00:00:00" Value="0.18"/>
37: </DoubleAnimationUsingKeyFrames>
38: </Storyboard>
39: </VisualState>
40: </VisualStateGroup>
41: <VisualStateGroup x:
42: <VisualStateGroup.Transitions>
43: <VisualTransition GeneratedDuration="0:0:0.5"/>
44: </VisualStateGroup.Transitions>
45: <VisualState x:
46: <Storyboard>
47: <DoubleAnimation Duration="0" Storyboard.
48: </Storyboard>
49: </VisualState>
50: <VisualState x:
51: <Storyboard>
52: <DoubleAnimation Duration="0" Storyboard.
53: </Storyboard>
54: </VisualState>
55: </VisualStateGroup>
56: </VisualStateManager.VisualStateGroups>
57: <Ellipse Stroke="{TemplateBinding BorderBrush}" Fill="{TemplateBinding Background}"/>
58: <Ellipse RenderTransformOrigin="0.661,0.321">
59: <Ellipse.Fill>
60: <RadialGradientBrush GradientOrigin="0.681,0.308">
61: <GradientStop Color="#00FFFFFF"/>
62: <GradientStop Color="#FF3D3A3A" Offset="1"/>
63: </RadialGradientBrush>
64: </Ellipse.Fill>
65: </Ellipse>
66: <Ellipse x:
67: <Ellipse x:
68: </Grid>
69: </ControlTemplate>
70:
71: <datavis:StylePalette x:
72: <!--Blue-->
73: <Style TargetType="Control">
74: <Setter Property="Background">
75: <Setter.Value>
76: <RadialGradientBrush>
77: <RadialGradientBrush.RelativeTransform>
78: <TransformGroup>
79: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
80: <TranslateTransform X="-0.425" Y="-0.486"/>
81: </TransformGroup>
82: </RadialGradientBrush.RelativeTransform>
83: <GradientStop Color="#FFB9D6F7"/>
84: <GradientStop Color="#FF284B70" Offset="1"/>
85: </RadialGradientBrush>
86: </Setter.Value>
87: </Setter>
88: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
89: </Style>
90: <!--Red-->
91: <Style TargetType="Control">
92: <Setter Property="Background">
93: <Setter.Value>
94: <RadialGradientBrush>
95: <RadialGradientBrush.RelativeTransform>
96: <TransformGroup>
97: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
98: <TranslateTransform X="-0.425" Y="-0.486"/>
99: </TransformGroup>
100: </RadialGradientBrush.RelativeTransform>
101: <GradientStop Color="#FFFBB7B5"/>
102: <GradientStop Color="#FF702828" Offset="1"/>
103: </RadialGradientBrush>
104: </Setter.Value>
105: </Setter>
106: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
107: </Style>
108: <!-- Light Green -->
109: <Style TargetType="Control">
110: <Setter Property="Background">
111: <Setter.Value>
112: <RadialGradientBrush>
113: <RadialGradientBrush.RelativeTransform>
114: <TransformGroup>
115: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
116: <TranslateTransform X="-0.425" Y="-0.486"/>
117: </TransformGroup>
118: </RadialGradientBrush.RelativeTransform>
119: <GradientStop Color="#FFB8C0AC"/>
120: <GradientStop Color="#FF5F7143" Offset="1"/>
121: </RadialGradientBrush>
122: </Setter.Value>
123: </Setter>
124: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
125: </Style>
126: <!-- Yellow -->
127: <Style TargetType="Control">
128: <Setter Property="Background">
129: <Setter.Value>
130: <RadialGradientBrush>
131: <RadialGradientBrush.RelativeTransform>
132: <TransformGroup>
133: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
134: <TranslateTransform X="-0.425" Y="-0.486"/>
135: </TransformGroup>
136: </RadialGradientBrush.RelativeTransform>
137: <GradientStop Color="#FFFDE79C"/>
138: <GradientStop Color="#FFF6BC0C" Offset="1"/>
139: </RadialGradientBrush>
140: </Setter.Value>
141: </Setter>
142: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
143: </Style>
144: <!-- Indigo -->
145: <Style TargetType="Control">
146: <Setter Property="Background">
147: <Setter.Value>
148: <RadialGradientBrush>
149: <RadialGradientBrush.RelativeTransform>
150: <TransformGroup>
151: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
152: <TranslateTransform X="-0.425" Y="-0.486"/>
153: </TransformGroup>
154: </RadialGradientBrush.RelativeTransform>
155: <GradientStop Color="#FFA9A3BD"/>
156: <GradientStop Color="#FF382C6C" Offset="1"/>
157: </RadialGradientBrush>
158: </Setter.Value>
159: </Setter>
160: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
161: </Style>
162: <!-- Magenta -->
163: <Style TargetType="Control">
164: <Setter Property="Background">
165: <Setter.Value>
166: <RadialGradientBrush>
167: <RadialGradientBrush.RelativeTransform>
168: <TransformGroup>
169: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
170: <TranslateTransform X="-0.425" Y="-0.486"/>
171: </TransformGroup>
172: </RadialGradientBrush.RelativeTransform>
173: <GradientStop Color="#FFB1A1B1"/>
174: <GradientStop Color="#FF50224F" Offset="1"/>
175: </RadialGradientBrush>
176: </Setter.Value>
177: </Setter>
178: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
179: </Style>
180: <!-- Dark Green -->
181: <Style TargetType="Control">
182: <Setter Property="Background">
183: <Setter.Value>
184: <RadialGradientBrush>
185: <RadialGradientBrush.RelativeTransform>
186: <TransformGroup>
187: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
188: <TranslateTransform X="-0.425" Y="-0.486"/>
189: </TransformGroup>
190: </RadialGradientBrush.RelativeTransform>
191: <GradientStop Color="#FF9DC2B3"/>
192: <GradientStop Color="#FF1D7554" Offset="1"/>
193: </RadialGradientBrush>
194: </Setter.Value>
195: </Setter>
196: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
197: </Style>
198: <!--Gray Shade-->
199: <Style TargetType="Control">
200: <Setter Property="Background">
201: <Setter.Value>
202: <RadialGradientBrush>
203: <RadialGradientBrush.RelativeTransform>
204: <TransformGroup>
205: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
206: <TranslateTransform X="-0.425" Y="-0.486"/>
207: </TransformGroup>
208: </RadialGradientBrush.RelativeTransform>
209: <GradientStop Color="#FFB5B5B5"/>
210: <GradientStop Color="#FF4C4C4C" Offset="1"/>
211: </RadialGradientBrush>
212: </Setter.Value>
213: </Setter>
214: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
215: </Style>
216: <!--Blue-->
217: <Style TargetType="Control">
218: <Setter Property="Background">
219: <Setter.Value>
220: <RadialGradientBrush>
221: <RadialGradientBrush.RelativeTransform>
222: <TransformGroup>
223: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
224: <TranslateTransform X="-0.425" Y="-0.486"/>
225: </TransformGroup>
226: </RadialGradientBrush.RelativeTransform>
227: <GradientStop Color="#FF98C1DC"/>
228: <GradientStop Color="#FF0271AE" Offset="1"/>
229: </RadialGradientBrush>
230: </Setter.Value>
231: </Setter>
232: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
233: </Style>
234: <!-- Brown -->
235: <Style TargetType="Control">
236: <Setter Property="Background">
237: <Setter.Value>
238: <RadialGradientBrush>
239: <RadialGradientBrush.RelativeTransform>
240: <TransformGroup>
241: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
242: <TranslateTransform X="-0.425" Y="-0.486"/>
243: </TransformGroup>
244: </RadialGradientBrush.RelativeTransform>
245: <GradientStop Color="#FFC1C0AE"/>
246: <GradientStop Color="#FF706E41" Offset="1"/>
247: </RadialGradientBrush>
248: </Setter.Value>
249: </Setter>
250: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
251: </Style>
252: <!--Cyan-->
253: <Style TargetType="Control">
254: <Setter Property="Background">
255: <Setter.Value>
256: <RadialGradientBrush>
257: <RadialGradientBrush.RelativeTransform>
258: <TransformGroup>
259: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
260: <TranslateTransform X="-0.425" Y="-0.486"/>
261: </TransformGroup>
262: </RadialGradientBrush.RelativeTransform>
263: <GradientStop Color="#FFADBDC0"/>
264: <GradientStop Color="#FF446A73" Offset="1"/>
265: </RadialGradientBrush>
266: </Setter.Value>
267: </Setter>
268: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
269: </Style>
270: <!-- Special Blue -->
271: <Style TargetType="Control">
272: <Setter Property="Background">
273: <Setter.Value>
274: <RadialGradientBrush>
275: <RadialGradientBrush.RelativeTransform>
276: <TransformGroup>
277: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
278: <TranslateTransform X="-0.425" Y="-0.486"/>
279: </TransformGroup>
280: </RadialGradientBrush.RelativeTransform>
281: <GradientStop Color="#FF2F8CE2"/>
282: <GradientStop Color="#FF0C3E69" Offset="1"/>
283: </RadialGradientBrush>
284: </Setter.Value>
285: </Setter>
286: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
287: </Style>
288: <!--Gray Shade 2-->
289: <Style TargetType="Control">
290: <Setter Property="Background">
291: <Setter.Value>
292: <RadialGradientBrush>
293: <RadialGradientBrush.RelativeTransform>
294: <TransformGroup>
295: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
296: <TranslateTransform X="-0.425" Y="-0.486"/>
297: </TransformGroup>
298: </RadialGradientBrush.RelativeTransform>
299: <GradientStop Color="#FFDCDCDC"/>
300: <GradientStop Color="#FF757575" Offset="1"/>
301: </RadialGradientBrush>
302: </Setter.Value>
303: </Setter>
304: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
305: </Style>
306: <!--Gray Shade 3-->
307: <Style TargetType="Control">
308: <Setter Property="Background">
309: <Setter.Value>
310: <RadialGradientBrush>
311: <RadialGradientBrush.RelativeTransform>
312: <TransformGroup>
313: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
314: <TranslateTransform X="-0.425" Y="-0.486"/>
315: </TransformGroup>
316: </RadialGradientBrush.RelativeTransform>
317: <GradientStop Color="#FFF4F4F4"/>
318: <GradientStop Color="#FFB7B7B7" Offset="1"/>
319: </RadialGradientBrush>
320: </Setter.Value>
321: </Setter>
322: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
323: </Style>
324: <!--Gray Shade 4-->
325: <Style TargetType="Control">
326: <Setter Property="Background">
327: <Setter.Value>
328: <RadialGradientBrush>
329: <RadialGradientBrush.RelativeTransform>
330: <TransformGroup>
331: <ScaleTransform CenterX="0.5" CenterY="0.5" ScaleX="2.09" ScaleY="1.819"/>
332: <TranslateTransform X="-0.425" Y="-0.486"/>
333: </TransformGroup>
334: </RadialGradientBrush.RelativeTransform>
335: <GradientStop Color="#FFF4F4F4"/>
336: <GradientStop Color="#FFA3A3A3" Offset="1"/>
337: </RadialGradientBrush>
338: </Setter.Value>
339: </Setter>
340: <Setter Property="Template" Value="{StaticResource CustomLineDataPointTemplate}" />
341: </Style>
342: </datavis:StylePalette>
343: </navigation:Page.Resources>
344: <Grid x:
345: <chartingToolkit:Chart x:Name="Chart1" Title="Overall History"
346:
347: <chartingToolkit:Chart.Series>
348: <chartingToolkit:LineSeries
349: Title="First Line"
350: IndependentValueBinding="{Binding EntryDate}"
351:
352: <chartingToolkit:LineSeries
353: Title="Second Line"
354: IndependentValueBinding="{Binding EntryDate}"
355:
356: <chartingToolkit:LineSeries
357: Title="Third Line"
358: IndependentValueBinding="{Binding EntryDate}"
359:
360: </chartingToolkit:Chart.Series>
361: </chartingToolkit:Chart>
362: </Grid>
363: </navigation:Page>: using System.Windows.Navigation;
13: using System.Windows.Controls.DataVisualization.Charting;
14:
15: namespace TestProject.Views
16: {
17: public class MyData
18: {
19: public MyData(int count, DateTime entryDate, string dataTitle, int growth)
20: {
21: Count = count;
22: EntryDate = entryDate;
23: DataTitle = dataTitle;
24: Growth = growth;
25: }
26:
27: public int Count { get; set; }
28: public DateTime EntryDate { get; set; }
29:
30: public string DataTitle { get; set; }
31: public int Growth { get; set; }
32:
33: public object DataPointTooltipText
34: {
35: get
36: {
37: TextBlock tb = new TextBlock();
38: tb.Inlines.Add(new Run { Text = "Title: " + DataTitle, FontWeight = FontWeights.Bold });
39: tb.Inlines.Add(new LineBreak());
40: tb.Inlines.Add(new Run { Text = "Updated: " + EntryDate.ToShortDateString() });
41: tb.Inlines.Add(new LineBreak());
42: if (Growth >= 0)
43: tb.Inlines.Add(new Run { Text = "Growth: " + Growth.ToString(), Foreground = new SolidColorBrush(Colors.Green) });
44: else
45: tb.Inlines.Add(new Run { Text = "Neg Growth: " + Growth.ToString(), Foreground = new SolidColorBrush(Colors.Red) });
46:
47: return tb;
48: }
49: }
50: }
51:
52: public partial class Test : Page
53: {
54: public Test()
55: {
56: InitializeComponent();
57: }
58:
59: // Executes when the user navigates to this page.
60: protected override void OnNavigatedTo(NavigationEventArgs e)
61: {
62: LoadData();
63: }
64:
65: public void LoadData()
66: {
67: List<MyData> line1 = new List<MyData>();
68: List<MyData> line2 = new List<MyData>();
69: List<MyData> line3 = new List<MyData>();
71: line1.Add(new MyData(4, new DateTime(2008, 11, 10), "Test 1", 4));
72: line1.Add(new MyData(9, new DateTime(2008, 11, 12), "Test 2", 5));
73: line1.Add(new MyData(20, new DateTime(2009, 2, 13), "Test 3", 11));
74:
75: line2.Add(new MyData(1, new DateTime(2008, 12, 14), "Test A", 1));
76: line2.Add(new MyData(15, new DateTime(2008, 12, 20), "Test B", 14));
77: line2.Add(new MyData(10, new DateTime(2009, 1, 12), "Test C", -5));
78:
79: line3.Add(new MyData(7, new DateTime(2008, 12, 1), "Test 1.1", 7));
80: line3.Add(new MyData(13, new DateTime(2009, 1, 12), "Test 1.2", 6));
81: line3.Add(new MyData(16, new DateTime(2009, 2, 10), "Test 1.3", 3));
82:
83: LineSeries ls = Chart1.Series[0] as LineSeries;
84: ls.ItemsSource = line1;
85:
86: LineSeries ls2 = Chart1.Series[1] as LineSeries;
87: ls2.ItemsSource = line2;
88:
89: LineSeries ls3 = Chart1.Series[2] as LineSeries;
90: ls3.ItemsSource = line3;
91: }
92: }
93: }
Let me know if you have any questions. And please note that this is using Silverlight 3.0 and the latest toolkit.
I was just reading through Scott Hanselman’s post about ELMAH and this sounds like a great idea. Getting a easy to consume report of all of your exceptions is a wonderful thing, especially when you add in that you can get it as an RSS feed, an email or a web site. You can check out ELMAH or read through his post to get a lot of details on it.
The web site looks like this:
This also got me thinking about Windows Azure and some of the logging that has been done already for that. So I wanted to highlight one of the projects here and talk about what it does. It is called Azure Application Monitor.
This allows you to see how much time and memory your instance is using. After you integrate this into your application, you will get a report like:
It is easy to add this to your application.
Neudesic.Azure.AzureMonitor.Start("AppName", "WebRole");
To view the data, you need to configure the AzureMonitor so that it points to your TableStorageEndpoint
As for what all it tracks, here is the list:
It is rather easy to add more stuff to this as the code is available from the projects location.
One a side-note, if you want to see what data you have in your Blobs, Queues and Tables, there is an updated version of Azure Storage Explorer available now. From that site:
The most current release of Azure Storage Explorer, version 2.0, has several improvements over the original version:
Azure Storage Explorer 2.0 does not presently allow you to act on storage items. This capability is being considered for a future update.
Let me know what you think or if you use any other tools for ASP.NET or Windows Azure.
With us starting to look forward to .NET 4.0, I started to think about the debugging story for ASP.NET and wondered if you had any requests for what you would like to see.
Some of the things that are on my mind are ideas like:
I am not saying that any of these will be coming, but they are all things that I am interested in seeing and will be investigating.
So what would you like to see for the future of the debugging experience?
Scott Hanselman did a great post about some of the new and upcoming features of MSDN that everyone should check out if you haven’t already. You can read all his great details here.
This got me thinking about MSDN and some of the new things that I have noticed.
I think my favorite thing that is on MSDN is the ability for the community to add content to any page. You can see this at the bottom of any page:
Clicking on that allows you to add a comment to the page. You can also see just above that where you can add your own tags to the page. These things can really help people get involved in the content on MSDN and help to change how things look on the site.
And if you want to really add to the documentation, you can always check out the ASP.NET Wiki.
So have you found any hidden gems? Used any of the ones that Scott or myself have pointed out yet?
Tell me what you think.
I wanted to post somewhat of a discussion starter around some of the new technologies that ASP.NET has recently released.
This technology has one huge benefit of allowing you to do unit testing on your site. But there are also a number of other advantages to it, for example, you can have a web page call commands inside a controller. This allows multiple pages to call the same command which helps keep things clean. It also does a pretty good job of separating the code from the presentation layer. But I did find myself doing a lot of coding like I used to with classic ASP or even IDC where we loop through results and have <%= %> snippets all over the aspx page.
These technologies have really opened the door to a lot more asynchronous commands on the web. They allow you to do lots of small submissions and updates without the need to submit and refresh the whole page.
This is a really interesting new functionality in that it really isn’t anything new but just a way of collecting things in a cleaner way. The way it is designed really gives us an ability to do things that you generally don’t consider doing. For example, you can make images clickable without having any link code in the html. It can also give some interesting ways to hide some of your IP (although they can always see it using something like netmon).
I think with Silverlight 3, we have really raised the bar for making Silverlight a choice for developing an application. Especially if you combine it with RIA, there are a lot of great applications of Silverlight that before would be much harder to create. I know Silverlight 3 is just in developer beta, but I have been using it quite a bit lately and I think it is really going to change things. The deep linking and search engine optimization functionality really help make this a good solution as well.
That is what I’d like to hear from everyone. If you have a page, when do you decide that you should do something async? When do you decide that you should just submit the entire page? Have you considered using Silverlight yet? What functionality makes it attractive to you? Is it the off-line functionality?
I wanted to give some of my thoughts on these things, but remember that they are just thoughts as a lot of these technologies I haven’t used enough to know which is best for what situation.
I think that most of these technologies allow for very fast creation of a site. I think a lot of it boils down to what you are comfortable with or what you have available. If you have designers at your disposal, Silverlight is a great choice as they can create the Xaml to make your application look amazing.
I think one of the powerful things about MVC is that you can combine it with AJAX, jQuery, JSON to get a bunch of these things in the same application. But it still is a question as to when to use what. For me, I really like using jQuery to control the UI and then have it call commands through AJAX/JSON. It also allows you to update a page with new content without having to refresh the page. Which makes the user experience a lot cleaner.
As for Silverlight, in general I think it is a wildcard out of the bunch. You can do all the same things you can with these other technologies but within the same framework. So I think if you want to have the best of all worlds and learn the smallest amount, this may be a good way to go.
So what are your thoughts? And do you have any other functionality that you would like that see that isn’t available yet?
If you have started playing with the RIA controls for Silverlight, one thing that you will need to understand is that when you get a DomainContext and call one of the load commands, that it does this async.
So if you do something like:
var context = new TestDomainContext();
context.LoadProducts();
foreach (Product p in context.Products)
{
myComboBox.Items.Add(p.ProductName);
}
You will get nothing put into your ComboBox. You need to hook up to the Loaded event and when that fires, then you can load up your ComboBox:
var context = new TestDomainContext();
context.LoadProducts();
context.Loaded += new EventHandler
<System.Windows.Ria.Data.LoadedDataEventArgs>
(context_Loaded);
void context_Loaded(object sender,
System.Windows.Ria.Data.LoadedDataEventArgs e)
{
var context = sender as TestDomainContext;
foreach (Product p in context.Products)
{
myComboBox.Items.Add(p.ProductName);
}
}
Just wanted to get that out there in case anyone else runs into that issue.
If you are thinking about a career in IT, this is a great new think that you can look into. According to the site:
Microsoft is partnering with private, public and community organizations to bring you Elevate America – access to free and low cost resources to help you get the skills, training, and certifications you need to compete for the jobs of today and tomorrow
Microsoft is partnering with private, public and community organizations to bring you Elevate America – access to free and low cost resources to help you get the skills, training, and certifications you need to compete for the jobs of today and tomorrow
If you are interested in learning more about this great opportunity, check it out or watch the video:
Microsoft Elevate America or Watch the video
So with how long ASP.NET has been out for now, I am really curious to know how people go about tracking down issues in their project.
I’d like to know things like:.
There.
My tree at Carbon grove | http://blogs.msdn.com/tom/ | crawl-002 | refinedweb | 4,658 | 50.94 |
elasticsearch-d 1.0.7
A D Elasticsearch library with an API similar to the official Elasticsearch packages for other languages.
To use this package, run the following command in your project's root directory:
Manual usage
Put the following dependency into your project's dependences section:
elasticsearch-d is a package modeled on the official Elasticsearch ruby client library. This one package contains both the transport and api packages.
While currently incomplete in terms of the API, the majority of the work has been done on the transport making most API implmentations trivial. Most API implementations just need a D function defined to take in the required parameters and pass them through to the transport layers.
While this package definitely needs more work, it seems very stable using the APIs that have been written so far. The APIs currently being used the mostly straightforward indices and base APIs.
This package also currently relies on vibe.d. Although it's quite possible with more work that this could be optional and a curl transport could be developed, the only functioning transport at this point is called VibeTransport. Also the package relies rather heavily on vibe.data.json (which could be replaced in future with a new phobos JSON candidate Finally elasticsearch-d also relies on the DictionaryList defined in vibe.d, because it was outside of the scope of the project to rewrite something like this.
I tried to make the API work exactly the same as the Ruby api, but although the overall design of the transport side of things should be able to remain consitent with the official packages, the API needs some more thought. Ruby allows named parameters in the form of a hash whereas there is no such thing in D. Elasticsearch endpoints can take a large number of optional parameters so a more elegant solution is required.
Because of all of this, I expect there will be breaking changes as I continue to keep it inline with elasticsearch development, as well as vibe.d and other packages. For the moment though, it works well with the implemented APIs.
Quick example
`D
import std.stdio; import elasticsearch.api.actions.base; import elasticsearch.api.actions.indices; // The host structure defaults to connecting to localhost auto client = new Client(Host()); Parameters p; p.addField("index", "es_test_index"); p.addField("body", ` { "settings": { "index": { "number_of_shards": 1, "number_of_replicas": 0, }, }, "mappings": { "user": { "properties": { "name": { "type": "string"} } } } } `); auto user = Json.emptyObject; user.name = "Ginny"; user._id = "1024"; client.createIndex(p); // Index the user to the es_text_index container with a type of "user" and id of "1024" client.index("es_test_index", "user", "1024", user.toString); // Basic query Parameters searchParams; searchParams["body"] = "<elasticsearch query>"; searchParams["index"] = "es_test_index"; auto response = client.search(params); puts response.jsonBody; client.deleteIndex("es_test_index");
`
- Registered by David Monagle
- 1.0.7 released 5 years ago
- intrica/elasticsearch-d
- MIT
- Authors:
-
- Dependencies:
- vibe-d, feature-test-d
- Versions:
- Show all 10 versions
- Download Stats:
0 downloads today
0 downloads this week
0 downloads this month
4197 downloads total
- Score:
- 0.8
- Short URL:
- elasticsearch-d.dub.pm | https://code.dlang.org/packages/elasticsearch-d | CC-MAIN-2021-04 | refinedweb | 513 | 57.27 |
Matteo Niccoli has made some awesome colourmaps, and has published a routine to convert them to Matplotlib colourmaps. This is very cool!
He explains all in his 25 April 2014 blog post Convert colour palettes to Python Matplotlib colour palettes.
There's a bit at the start where you are downloading data, unzipping, reformatting, etc. I thought I'd try doing all that in Python too...
%pylab inline import numpy as np
Populating the interactive namespace from numpy and matplotlib
We can read the data straight from the web. We'll need some of the standard libraries.
import urllib2, zipfile, StringIO
Now we can read the zip file and examine its contents. We'll keep it in memory using a
StringIO object.
remote_file = '' # Read the data from the web, as normal. web_data = urllib2.urlopen(remote_file) # Convert the bytes into a file-like object in memory zip_in_memory = StringIO.StringIO(web_data.read()) # Instantiate a ZipFile object from the file-like in memory. z = zipfile.ZipFile(zip_in_memory) z.namelist()
['cube1_0-1.csv', '__MACOSX/', '__MACOSX/._cube1_0-1.csv', 'cubeYF_0-1.csv', '__MACOSX/._cubeYF_0-1.csv', 'Linear_L_0-1.csv', '__MACOSX/._Linear_L_0-1.csv']
We need file number 5.
f = z.open(z.namelist()[5]) raw_data = f.read()
Let's look at the first 100 characters:
raw_data[:100]
'0.0143,0.0143,0.0143\r0.0404,0.0125,0.0325\r0.0516,0.0154,0.0443\r0.0616,0.0184,0.0530\r0.0699,0.0215,0.'
We just need to split this to get a list of strings:
list_o_strings = raw_data.split() list_o_strings[:10]
['0.0143,0.0143,0.0143', '0.0404,0.0125,0.0325', '0.0516,0.0154,0.0443', '0.0616,0.0184,0.0530', '0.0699,0.0215,0.0615', '0.0814,0.0229,0.0687', '0.0857,0.0273,0.0763', '0.0928,0.0305,0.0805', '0.1008,0.0330,0.0846', '0.1064,0.0356,0.0939']
Now we can use a nested list comprehension to step over the list of strings, splitting each string on its commas, and converting each element (which will still be a string) to a floating point number...
list_o_lists = [[float(num) for num in string.split(',')] for string in list_o_strings] list_o_lists[:10]
[[0.0143, 0.0143, 0.0143], [0.0404, 0.0125, 0.0325], [0.0516, 0.0154, 0.0443], [0.0616, 0.0184, 0.053], [0.0699, 0.0215, 0.0615], [0.0814, 0.0229, 0.0687], [0.0857, 0.0273, 0.0763], [0.0928, 0.0305, 0.0805], [0.1008, 0.033, 0.0846], [0.1064, 0.0356, 0.0939]]
LinL = np.array(list_o_lists) LinL[:3]
array([[ 0.0143, 0.0143, 0.0143], [ 0.0404, 0.0125, 0.0325], [ 0.0516, 0.0154, 0.0443]])
Win!
We'll just run Matteo's code...
%matplotlib inline import matplotlib.pyplot as plt
b3 = LinL[:,2] # value of blue at sample n b2 = LinL[:,2] # value of blue at sample n b1 = linspace(0, 1, len(b2)) # position of sample n - ranges from 0 to 1 # Setting up columns for tuples g3 = LinL[:,1] g2 = LinL[:,1] g1 = linspace(0,1,len(g2)) r3 = LinL[:,0] r2 = LinL[:,0] r1 = linspace(0,1,len(r2)) # Creating tuples R = zip(r1,r2,r3) G = zip(g1,g2,g3) B = zip(b1,b2,b3) # Transposing RGB = zip(R,G,B) rgb = zip(*RGB) # Creating dictionary k = ['red', 'green', 'blue'] LinearL = dict(zip(k,rgb))
And test it with a plot.
my_cmap = matplotlib.colors.LinearSegmentedColormap('matteo', LinearL) plt.figure(figsize=(5,4)) plt.pcolor(rand(10,10),cmap=my_cmap) plt.colorbar() plt.show()
To make a reversed version, I think we have to reverse
rgb and repeat the process. It's a three-element list, where each element is a tuple of tuples.
def reverse_colourmap(cmap): reverse = [] for channel in cmap: data = [] for t in channel: data.append((1 - t[0], t[1], t[2])) reverse.append(sorted(data)) return reverse
rgb_r = reverse_colourmap(rgb)
LinearL_r = dict(zip(k,rgb_r)) my_cmap_r = matplotlib.colors.LinearSegmentedColormap('matteo_r', LinearL_r) plt.figure(figsize=(5,4)) plt.pcolor(rand(10,10),cmap=my_cmap_r) plt.colorbar() plt.show()
The
sorted() is important. As well as having the right
x values, the coloumap channels must be in order.
Instead of reversing the finished colourmap, let's do it from the start, with the original code...
def gen_cmap(name, array, start, end): b3 = array[:,2] # value of blue at sample n b2 = array[:,2] # value of blue at sample n b1 = linspace(start, end, len(b2)) # position of sample n - ranges from 0 to 1 # Setting up columns for tuples g3 = array[:,1] g2 = array[:,1] g1 = linspace(start, end, len(g2)) r3 = array[:,0] r2 = array[:,0] r1 = linspace(start, end, len(r2)) # Creating tuples R = sorted(zip(r1,r2,r3)) G = sorted(zip(g1,g2,g3)) B = sorted(zip(b1,b2,b3)) # Transposing RGB = zip(R,G,B) rgb = zip(*RGB) # Creating dictionary k = ['red', 'green', 'blue'] LinearL = dict(zip(k,rgb)) return matplotlib.colors.LinearSegmentedColormap(name, LinearL)
my_cmap_r = gen_cmap('matteo_r', LinL, 1, 0) plt.figure(figsize=(5,4)) plt.pcolor(rand(10,10),cmap=my_cmap_r) plt.colorbar() plt.show()
And just check this works with the original...
my_cmap = gen_cmap('matteo', LinL, 0, 1) plt.figure(figsize=(5,4)) plt.pcolor(rand(10,10),cmap=my_cmap) plt.colorbar() plt.show()
Ha, I just read about
numpy.flipud(a) and realized you could just flip the array we started with:
my_cmap_r = gen_cmap('matteo_r', np.flipud(LinL), 0, 1) plt.figure(figsize=(5,4)) plt.pcolor(rand(10,10),cmap=my_cmap_r) plt.colorbar() plt.show()
NumPy is awesome. | http://nbviewer.ipython.org/github/kwinkunks/notebooks/blob/master/Matteo_colourmaps.ipynb | CC-MAIN-2014-35 | refinedweb | 931 | 57.37 |
On 19 Jul 2002, Jason van Zyl wrote:
> On Thu, 2002-07-18 at 23:51, Henri Yandell wrote:
> > Apologies for the cvs commit spam there. I've not figured out a way to add
> > multiple directories without a cvs mail per directory add.
>
> Use the 'cvs import' luke.
Started to, but as I use cvs import for new modules and not new
directories I decided to do it the simple way I normally use :) Will
import next time.
--
To unsubscribe, e-mail: <mailto:commons-dev-unsubscribe@jakarta.apache.org>
For additional commands, e-mail: <mailto:commons-dev-help@jakarta.apache.org> | http://mail-archives.apache.org/mod_mbox/commons-dev/200207.mbox/%3CPine.LNX.4.33.0207190008220.20396-100000@umbongo.flamefew.net%3E | CC-MAIN-2017-09 | refinedweb | 102 | 57.27 |
PMEVENTFLAGSSTR(3) Library Functions Manual PMEVENTFLAGSSTR(3)
pmEventFlagsStr, pmEventFlagsStr_r - convert an event record flags value into a string
#include <pcp/pmapi.h> const char *pmEventFlagsStr(int flags); char *pmEventFlagsStr_r(int flags, char *buf, int buflen); cc ... -lpcp
For use in error and diagnostic messages, pmEventFlagsStr returns a `human readable' version of the value flags, assuming this to be the er_flags field of a pmEventRecord or pmEventHighResRecord. The pmEventFlagsStr_r function does the same, but stores the result in a user-supplied buffer buf of length buflen, which should have room for at least 64 bytes. The string value result from pmEventFlagsStr is held in a single static buffer, so the returned value is only valid until the next call to pmEventFlagsStr.
pmEventFlagsStr returns a pointer to a static buffer and hence is not thread-safe. Multi-threaded applications should use pmEventFlagsStr_r instead.
PMAPI(3) and pmdaEventAddRecordMEVENTFLAGSSTR(3)
Pages that refer to this page: pmdaeventarray(3), pmdaeventclient(3) | http://man7.org/linux/man-pages/man3/pmeventflagsstr.3.html | CC-MAIN-2017-22 | refinedweb | 156 | 61.77 |
On 11 Nov 2003 15:54:50 -0800, SungSoo, Han wrote: > There are two coding style when python import module. This is more than coding style; it has two distinct effects. > (1) import sys Allows 'sys' module objects to be used within the 'sys' namespace. > (2) from import sys (or from import *) Isn't syntactically correct (refers to a non-existent module called 'import', then has the non-keyword 'sys'). Assuming you mean: from sys import * this has the effect that all objects from the 'sys' module are available in the default namespace. > I prefer (1) style. Because it's easy to read, understand module in > any category More importantly, (1) doesn't pollute the main namespace; any objects that have the same name in the main namespace are unambiguously referenced with the 'sys' namepace. >>> maxint = 23 >>> maxint 23 >>> import sys >>> maxint 23 >>> sys.maxint 2147483647 Whereas, with (2), the symbols from 'sys' pollute the main namespace: >>> maxint = 23 >>> maxint 23 >>> from sys import * >>> maxint 2147483647 > Which prefer ? It's usually preferable to use (1), because there is no namespace collision, and it has the added benefit of making it unambiguous which module the symbols come from when they are later used. -- \ "Why, I'd horse-whip you if I had a horse." -- Groucho Marx | `\ | _o__) | Ben Finney <> | https://mail.python.org/pipermail/python-list/2003-November/180072.html | CC-MAIN-2014-15 | refinedweb | 218 | 70.84 |
This class keeps data about a rules for rule-based renderer. More...
#include <qgsrulebasedrendererv2.h>.
Constructor takes ownership of the symbol.
add child rule, take ownership, sets this as parent
clone this rule, return new instance
get all used z-levels from this rule and children
Try to find a rule given its unique key.
add child rule, take ownership, sets this as parent
delete child rule
delete child rule
Unique rule identifier (for identification of rule within renderer)
tell which rules will be used to render the feature
assign normalized z-levels [0..N-1] for this rule's symbol for quick access during rendering
set a new symbol (or NULL). Deletes old symbol.
prepare the rule for rendering and its children (build active children array)
tell which symbols will be used to render the feature
take child rule out, set parent as null
take child rule out, set parent as null
only tell whether a feature will be rendered without actually rendering it | http://qgis.org/api/classQgsRuleBasedRendererV2_1_1Rule.html | CC-MAIN-2014-41 | refinedweb | 165 | 65.46 |
Be the first to know about new publications.Follow publisher Unfollow publisher University of Rhode Island Athletics
- Info
Spread the word.
Share this publication.
- Stack
Organize your favorites into stacks.
- Like
Like this publication.
2010 Rhode Island Football Preview
2010 Rhode Island Football Preview
TABLE OF CONTENTS RHODE ISLAND QUICK FACTS GENERAL INFORMATION Location .............................................................Kingston, R.I. Enrollment ...................................................................15,904 Founded ..........................................................................1892 President..................................................Dr. David M. Dooley Athletic Director ....................................................Thorr Bjorn Athletic Phone ...............................................(401) 874-5245 Athletic Web Site ...............................................GoRhody.com Conference ......................................................... CAA Football Nickname .......................................................................Rams Colors ...................................... Keaney Blue, Dark Blue, White TEAM INFORMATION Home Field .....................................................Meade Stadium Capacity .........................................................................6,555 Surface ...............................................................Natural Grass Press Box Phone .............................................(401) 874-4616 2009 Record .................................................................... 1-10 Conference Record (Finish) ....................................... 0-8 (6th) NCAA Tournament Appearances ............................................3 Offensive Starters Returing/Lost ....................................... 8/3 Defensive Staters Returning/Lost ...................................... 9/2 Letterwinners Returning/Lost ....................................... 36/12 COACHING INFORMATION Head Coach ....................................Joe Trainer (Dickinson '90) Record at URI................................................... Second season Career Record ......................................... 14-30 (four seasons) Office Phone...................................................(401) 874-2406 Office Fax .......................................................(401) 874-4084 SPORTS INFORMATION Football Contact ................................................Tom Symonds Office Phone:..................................................(401) 874-5356 Fax Phone: .....................................................(401) 874-5354 E-Mail Address: .................................tsymonds@mail.uri.edu [1] RHODY FOOTBALL [4] 2010 RAMS General Information Team Information Coaching Information Sports Information Meade Stadium 1 1 1 1 2-3 2010 Preview/Team Information 2010 Roster 2010 Returners 2010 Newcomers/Freshmen [40] 4-5 6-7 8-34 35-39 COACHES AND STAFF Head Coach - Joe Trainer 40-42 Assistant Head Coach/Off. Line - Roy Istvan 43 Offensive Coordinator - Chris Pincince 44 Defensive Coordinator/Defensive Line - Rob Neviaser 45 Special Teams/Running Backs - Eddie Allen 46 Secondary/Recruiting Coordinator - Ryan Crawford 47 Linebackers - Rapheal Dowdye 48 Tight Ends/Special Consultant - Bob Griffin 49 Wide Receivers - Ari Confesor 50 Strength and Conditioning - Mike Sirignano 51 Director of Football Operations - Dan Silva 52 Associate Athletic Director/Health and Performance - Kim Bissonnette 53 Senior Associate Athletic Trainer - Andy Llaguno 53 [54] OPPONENTS [63] 2009 REVIEW Buffalo/Fordham New Hampshire/Brown William and Mary/Delaware Maine/Towson Villanova/Richmond Massachusetts/All-Time vs. Ranked Opponents All-Time Record vs. 2010 Opponents Homecoming Statistics/2009 Honors Game Box Scores [68] RECORDS Team & Individual Records [77] RESULTS Year-by-Year Results [83] MEDIA INFORMATION Media Policies/Credentials Media List 54 55 56 57 58 59 60-61 62 63-64 65-67 68-76 77-82 83 84 2010 RHODE ISLAND FOOTBALL SCHEDULE Date 09/02/10 09/11/10 09/18/10 10/02/10 10/09/10 10/16/10 10/23/10 10/30/10 11/06/10 11/13/10 11/20/10 Opponent / Event at Buffalo at Fordham vs. New Hampshire *^ vs. Brown # at William & Mary * at Delaware * vs. Maine % at Towson * vs. Villanova *$ at Richmond * vs. Massachusetts *! Location Buffalo, N.Y. Bronx, N.Y. Meade Stadium Meade Stadium Williamsburg, Va. Newark, Del. Meade Stadium Towson, Md. Meade Stadium Richmond, Va. Meade Stadium Time 7:00 p.m. 6:00 p.m. 12:00 p.m. 1:00 p.m. 7:00 p.m. 3:30 p.m. 12:30 p.m. 3:30 p.m. 1:00 p.m. 2:00 p.m. 12:30 p.m. * - CAA Game | ^ - Military Day | # - Governor’s Cup/Family Weekend | % - Homecoming | $ - Youth Day | ! - URI Employee Appreciation/Senior Day The 2010 University of Rhode Island football media guide was written and designed by Tom Symonds, Coordinator of Sports Communications. Editorial assistance by Mike Laprey and Jodi Pontbriand. Cover design by Tom Symonds and Jodi Pontbriand. Assistance also provided by Willie McGinnis and Dan Higgins. Photography from Joe Giblin, Doug Learned, Ed Pepin Mike Scott and Nick Murgo. Back cover photos by Joe Giblin and Doug Learned. Special thanks to the entire URI football coaching staff. Printing by Rhode Island Printing services. W W W. G O R H O D Y. C O M 1 MEADE STADIUM, in its 81st year as the “Home of the Rams,” was constructed in 1928. On June 2, 1938, the facility was named in honor of the late John E. “Jack” Meade (Class of ‘15). A devoted fan, he was said to have never missed a home football or basketball game until his death in 1972 at the age of 78. Meade was the holder of the number one certificate as a registered professional engineer and was the deputy director of public works and engineer for the city of Providence for 32 years. A powerful leader in the General Assembly, Meade was named by Governor Theodore F. Green to the Board of Regents for Rhode Island State College (later named the University of Rhode Island) and Rhode Island College of Education. He was honored with a lifetime award by the alumni association in 1938 and was a member of the URI Century Club. He was posthumously inducted into the Rhode Island Athletic Hall of Fame in 1972. For two seasons, the Rams utilized a tent in front of the Tootell Complex as a locker room. When The Ryan Center opened in 2002, the facility housed a state-of-the-art football locker room, modern athletic training room and a locker room for coaches. In 2005, Dr. Robert Carothers, president of the University of Rhode Island, announced first phase plans to refurbish Meade Stadium. Meade Field, as it was known in the early years, originally included only a few seats on the west side of the field. In 1933, a Football Field House was constructed, which served as the Rams’ locker room for years. The first stage of the renovation included the installation of a new scoreboard and the refurbishment of the east stands of the stadium. The scoreboard includes a message center and other features, which enhance a fan’s enjoyment of the game. The east stands were fitted with a vinyl covering providing more comfort, better appearance and esthetics. In 2006, the Rams opened an additional 1,600 seats on the west end of the stadium which are attached to The Ryan Center, bringing the seating capacity to 6,554. A year later, the west concrete stands were constructed under the direction of athletic director Frank Keaney. The stands and a small press box were built to accommodate 1,500 fans. The facility was renamed Meade Stadium in 1978 when a 50-row concrete, aluminum and steel grandstand opened bringing the seating capacity to 8,000 under the guidance of Athletic Director Maurice Zarchen. A larger press box, concession stand and rest room facilities were added in 1980. Total cost of the project was $600,000. New natural turf was installed in 1983 and a computerized scoreboard was added in 1986. During the summer of 2000, the field house and west grandstand were demolished to make room for The Ryan Center, reducing the seating capacity of Meade Stadium to 5,180. MEADE STADIUM’S TOP 25 CROWDS 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. Year 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 13,052 12,933 12,211 12,092 11,231 10,446 10,443 10,230 10,228 10,227 10,145 10,114 10,000 Boston University Lafayette Northeastern Connecticut New Hampshire Richmond Massachusetts Boston University Boston University Massachusetts Maine New Hampshire Connecticut Record Attendance (Avg.) 2-3 3-0 5-0 2-0 1-3 4-1 2-1 2-1 3-0 1-2 1-1 2-1 3-0 3-0 1-0 No team-World War II No team-World War II 1-0 2,500 (2,500) 1-0 5,000 (5,000) 2-2 15,000 (3,750) 2-1 11,000 (3,667) Oct. 20, 1984 Oct. 26, 1985 Oct. 8, 1983 Nov. 17, 1973 Oct. 24, 1987 Dec. 1, 1984 Oct. 4, 1980 Oct. 16, 1982 Oct. 20, 1989 Oct. 6, 1984 Oct. 19, 1991 Nov. 2, 1985 Nov. 14, 1991 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 0-4 3-0 3-1 3-0 2-1 4-0 2-0-1 2-2 2-1 2-2 0-2-1 2-1 0-3-1 0-4 3-1 1-3 1-3 0-4 3-1 3-1 2-3 2-1 W W W T L W L L L W W W W 22-7 41-21 30-10 7-7 14-28 23-17 8-26 16-26 13-15 20-19 52-30 30-20 34-29 15,400 (3,850) 11,212 (3,737) 16,200 (4,050) 15,712 (5,237) 13,000 (4,333) 16,200 (4,050) 12,500 (4,167) 18,818 (4,705) 8,000 (2,667) 14,101 (3,525) 13,000 (4,333) 10,700 (3,567) 16,200 (4,050) 18,944 (4,736) 16,600 (4,150) 27,000 (6,750) 21,800 (5,450) 23,400 (5,850) 31,200 (7,800) 22,300 (5,575) 26,500 (5,300) 28,100 (9,367) 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 9,882 9,842 9,841 9,737 9,624 9,515 9,442 9,437 9,421 9,407 8,897 8,813 0-4 2-2 2-1-1 4-2 1-4 1-2 4-1 4-1 1-3-1 2-2 5-1 3-2 4-2 5-0 7-0 1-5 1-4 2-3 0-4 4-2 2-3 1-4 Boston University Northeastern Southern Connecticut Brown New Hampshire Brown Maine New Hampshire Northeastern Massachusetts Connecticut New Hampshire 36,827 (9,207) 27,099 (6,775) 34,915 (8,729) 26,536 (4,423) 25,208 (5,042) 18,252 (6,084) 32,439 (6,488) 25,717 (5,243) 24,241 (4,848) 20,453 (5,113) 50,032 (8,339) 37,032 (7,604) 48,469 (8,078) 44,103 (8,821) 64,752 (9,250) 43,207 (7,201) 36,017 (7,203) 29,003 (5,801) 25,772 (6,443) 39,116 (6,528) 34,119 (6,824) 24,003 (4,801) Oct. 18, 1986 Oct. 10, 1981 Oct. 22, 1983 Nov. 7, 1981 Oct. 21, 1981 Sept. 27, 1986 Sept. 21, 1985 Nov. 3, 1973 Nov. 9, 1985 Oct. 6, 1989 Nov. 16, 1985 Oct. 29, 1977 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 3-2 0-5 4-2 4-2 1-4 1-4 1-5 1-4 4-1 3-3 2-4 2-4 2-3 3-3 2-3 2-4 1-4 All-Time Record All-Time Attendance L W W L W L W W W L W W 0-17 33-0 17-7 8-10 14-12 7-27 34-14 40-16 34-21 13-16 56-42 21-20 21,510 (4,302) 21,037 (4,207) 30,247 (5,041) 22,560 (3,760) 17,464 (3,493) 20,871 (5,041) 20,163 (3,361) 19,660 (3,932) 24,306 (4,861) 21,045 (3,508) 20,786 (3,464) 19,691 (3,282) 14,235 (2,847) 19,026 (3,171) 17, 181 (3,436) 29,119 (4,853) 18,931 (3,786) 172-159-5 (.527) 1,516,600 (4,639) 2010 SEASON PREVIEW RAMS WELCOME BACK 18 STARTERS The 2010 edition of the Rhode Island football team welcomes back a lot of familiar faces this fall. This season, Rhody returns 18 starters, including seven on offense, nine on defense and two on special teams. Paul-Etienne opened the year on a high note as he totaled 245 yards of total offense and accounted for three touchdowns (164 - passing and 81 - rushing) in the Rams’ seasonopening victory over Fordham (Sept. 5). THE 2010 SCHEDULE NCAA Championship participants New Hampshire, Richmond, William and Mary and defending National Champion Villanova highlight the 2010 University of Rhode Island football schedule. The Rams open the 2010 campaign on Thursday, Sept. 2 as they travel to Buffalo to take on a Bulls team, which claimed the 2008 Mid-American Conference title. The Rams open their slate at home on Sept. 18 as they welcome NCAA playoff The Rams open their 2010 season on Thursday, Sept. participant New Hampshire. In its last three 2 at 7 p.m. against Buffalo. meetings with New Hampshire, URI has racked up over 500 yards of total offense. The Rams close out the year with three of their final five games at home against Maine (Oct. 23), 2009 National Champion Villanova (Nov. 6) and Massachusetts (Nov. 20). DAMON EARNS SPORTS NETWORK PRESEASON ALL-AMERICA THIRD TEAM HONORS Linebacker Rob Damon was named Preseason All-America Third Team by the Sports Network. In 2009, Damon burst on the scene to lead the CAA with 124 stops. He also posted 14.0 tackles for loss, which ranked fifth in the CAA. Following the year, Damon was named Sports Network All-America and All-CAA Third Team. HANSEN CLOSES IN ON ALL-TIME TACKLES RECORD Senior linebacker Matt Hansen currently has 287 career tackles and is just 102 stops shy of surpassing Paul Picciotti’s (1998-01) career mark of 388. In 2009, Hansen surpassed 100 total tackles for the second-consecutive season as he finished second on the team with 103 stops. In 2008, the Rhode Island native led the team in tackles with 111 en route to receiving AllCAA Second Team and All-New England honors as a sophomore. I’LL TAKE THAT Rhode Island made habit of gaining turnovers, gaining 26 in 2009 (11 - interceptions; 15 - fumbles). The Rams finished their 2009 campaign with a plus 10 turnover margin, which ranked second in CAA Football. The Florida native came on strong toward the end of the year as he averaged 236.7 yards passing and tossed 10 touchdowns, while only throwing three interceptions during the final four games of the season. His 10 touchdowns were the most of any CAA quarterback in the last four games of 2009. Included in Paul-Etienne’s final four games of the season was his season-best 424yard performance against nationally-ranked New Hampshire where he also tossed four touchdown passes. Paul-Etienne’s 424-yard performance against the Wildcats ranks as the ninth-best single game performance in URI history. Paul-Etienne came to Kingston after he spent two years at Rutgers, but saw limited action as he played behind former Scarlet Knight quarterback Mike Teel. Former Hofstra quarterback Steve Probst will serve as Paul-Etienne’s back-up and could push him for a starting position. In 2009, Probst saw a significant amount of action for the Pride as he played in seven games, passing for 466 yards and five touchdowns as a sophomore. He also showed a strong ability to run with the ball as he finished second on the team in rushing with 332 yards. Rhody also returns sophomore Marc Lucarini and redshirt-freshman Robert Bensen. Neither quarterback saw action in 2009, but both continued to improve during the spring season and could be option for the Rams in the years to come. Quarterback Chris Paul-Etienne averaged 236.7 yards passing in the Rams’ final four games of 2009. RUNNING BACKS The Rhody running game will feature some fimiliar faces this season in the form of senior Anthony Ferrer and sophomore Ayo Isijola. Both Ferrer and Isijola rushed for over 350 yards in 2009 and both tailbacks posted 100-yard rushing games against Brown and Towson, respectively. RAMS WELCOME THREE TRANSFERS FROM HOFSTRA Over the offseason, Rhode Island welcomed three transfers from Hofstra University, who will suit up for the Rams this upcoming fall in the form of quarterback Steve Probst, wide receiver Billy Morgan and defensive back Chris Edmond. Probst and Edmond will both have two years of eligibility, while Morgan will have three years of remaining at URI. Isijola figures to be the leading candidate to earn the starting spot heading into the 2010 season after he posted a strong spring season. 2010 SEASON TO MARK THE 25TH ANNIVERSARY OF THE 1985 TEAM This season marks the 25th anniversary of the 1985 Rhode Island football team, which advanced to the NCAA playoffs after posting a 10-3 overall record, including a perfect 5-0 mark in Yankee Conference play, which earned the school its first undefeated and untied conference title since it joined the league 39 years earlier. During the year, Rhody won a school-record eight games. Following the year, the Rams were honored as the ECAC Team of the Year. Joining Ferrer and Isijola in the backfield will senior Michael Okunfolami, who played in five games as a junior, but spent most of his time on special teams. QUARTERBACKS In his first significant action since high school, quarterback Chris Paul-Etienne made the most of his first season as a colleigate starter as he threw for 1,745 yards through the air and 14 touchdowns. In 2009, Bynum had a breakout season as a red-shirt freshman with 38 receptions for 506 yards (13.3 average). The Pennslyvania native ranked second on the team in every major receiving category and should prove to be a valuable asset to the team’s offense this season. Ferrer enters his final season in Kingston with 11 career touchdowns; nine of which have come on the ground. In 2009, he led the team in rushing (411) and rushing touchdowns (5). WIDE RECEIVERS Despite the loss of all-conference wide receiver Shawn Leonard to graduation, the Rams still feature a deep and talented receiving group this season with sophomores Ty Bynum and Brandon Johnson-Farrell headlining the list of returnees. Johnson-Farrell returns to the mix after missing most of the 2009 season with a toe injury he suffered during the Rams’ visit to Massachusetts in the second week of the season. 4 W W W. G O R H O D Y. C O M 2010 SEASON PREVIEW Brandon Johnson-Farrell was named All-CAA Third Team in 2008. Following the season, Johnson-Farrell received a medical red-shirt and after a strong spring, the Maryland native appears to be back to his 2008 form where he led the team in receptions en route to earning All-CAA Third Team honors. DEFENSIVE LINE This season the Rams return three starters from last year’s defensive line, including senior Victor Adesanya and juniors Willie McGinnis and Matt Rae. In addition, to the talents of Bynum and Johnson-Farrell, the Rams also added Hofstratransfer Billy Morgan. In 2009 with the Pride, Morgan showed some potential as he hauled in 13 passes for 173 yards (13.3 average). In the annual Blue-White game this past spring, Morgan led all Rhody receivers with six catches for 100 yards. This fall, the trio return to the practice field with a another year of experience under their belts and will look to build on their 2009 campaign, which saw them combine for 101 total tackles, 15.5 tackles for loss and six sacks. Junior Ryan Lawrence will join the receivers this fall, moving from running back. In 2009, Lawrence finished the year with 18 receptions for 164 yards. TIGHT ENDS With David Wilson departing the team because of graduation, the Rams will look to junior Joe Migliarese and senior Tom Lang to fill the void left by Wilson, who finished the year with 149 yards receiving. Migliarese and Lang both saw action at tight end, but in a very limited role. However, both showed signs of potential in 2009. OFFENSIVE LINE Rhody returns four starters from last fall in the form of senior Dave Valley, juniors Jason Foster, Michael Gross and Kyle Bogumil. Over the last two years, the four returnees have combined to play in 79 games and make 65 starts. LINEBACKERS This season, the Rhody linebacking unit returns each of its starters from the 2009 season in the form of seniors Matt Hansen, Rob Damon and Joe Harris. Last season, the trio combined to make 32 starts, 285 tackles and record seven sacks. Hansen leads the way having started at linebacker the past two seasons. The Rhode Island native has recorded back-to-back seasons of 100 tackles or more. Damon, returns to the fold after a breakout 2009 season where he led the CAA in tackles with 124 en route to earning All-CAA Third Team honors. In addition, to Hansen, Harris and Damon, sophomores Manee Williams and Kenny Smith could see some action after both displayed strong spring seasons. In addition, senior Dan O’Connell should see some time this fall. In three previous seasons, the Rhode Island native has appeared in 31 games and has totaled 87 career tackles. In 2009, the Rhody offenisve unit posted 400 yards or more in three games, including a 535yard effort against nationally ranked New Hampshire. DEFENSIVE BACKS This fall the Rhode Island secondary possess something it lacked a year ago. Depth. The Rams also welcome back Matt Greenhalgh, who started one game a year ago as a redshirt freshman. Sophomore Michael Farr also returns to give Rhody some extra added depth on the offensive line. Heading into the 2009 season, Rhody’s returning defensive backs combined to play in 34 games and make 17 starts a year ago. STARTERS RETURNING: 18 OFFENSE: 7 OL - Kyle Bogumil OL - Jason Foster OL - Michael Gross OL - Dave Valley QB - Chris Paul-Etienne RB - Anthony Ferrer WR - Ty Bynum TOTAL NO. OF STARTERS LOST: 6 OFFENSE: 3 WR - Joe Bellini WR - Shawn Leonard TE - David Wilson DEFENSE: 9 DL - Victor Adesanya DL - Willie McGinnis DL - Matt Rae LB - Matt Hansen LB - Rob Damon LB - Joe Harris DB - Robenson Alexis DB - Jarrod Williams DB - Matt Urban SPECIAL TEAMS: 1 LS - Devin Johnson SPECIAL TEAMS: 2 P - Tim Edger PK - Louis Feinstein DEFENSE: 2 DL - Steve Weedon DB - Rodney Mitchell TOTAL NUMBER OF LETTERWINNERS RETURNING: 38 Offense: 16 Defense: 20 Special Teams: 2 TOTAL NUMBER OF LETTERWINNERS LOST: 21 Offense: 6 Defense: 14 Special Teams: 1 Linebacker Rob Damon led the CAA in tackles with 124 in 2009. Among the returnees is senior Jarrod Williams, who last season recorded a career-high 65 tackles and a team-best four interceptions. This fall, Williams will move to corner after spending a majority of the 2009 campaign at safety. Dean College tranfer Stanley Dunbar and Hofstra transfer Chris Edmond will also add some extra help to the Rhody secondary. In Jarrod Williams led the Rams with four interceptions 2009, Edmond finished fifth on the team in in 2009. tackles with 51. He also brings a considerable amount of experience to the team, having played in 22 games throughout his collegiate career. Redshirt freshman David Zocco could also see some time this fall after he put together an impressive spring season. During the annual Blue-White game, Zocco had two interceptions and returned one for a touchdown. W W W. G O R H O D Y. C O M 5 2010 ROSTER Alphabetical No. Name 81 Ramadan Abdullah 91 Victor Adesanya 2 Robenson Alexis 85 Drew Anderson 33 Anthony Baskerville 19 Nick Becker 75 Andrew Belizaire 18 Robert Bentsen 55 John Bicknell IV 72 Kyle Bogumil 98 Brandon Bramwell 86 Matt Brown 21 Tyquan Bynum 37 Rodney Chance 45 David Coleman 57 Alex Craft 15 Doug D’Angelo 22 Devon Dace 23 Jordan Dalton 5 Rob Damon 32 Darrell Dulany 17 Stanley Dunbar 30 Tim Edger 9 Chris Edmond 53 Kyle Elliott 59 Michael Farr 54 Justin Favreau 14 Louis Feinstein 13 Danny Fenyak 44 Anthony Ferrer 7 Ellis Foster 74 Jason Foster 93 Alex Frazier 89 Derek Gibson 51 Matt Greenhalgh 71 Michael Gross 52 David Hansen 20 Matt Hansen 6 Joseph Harris 49 Miller Hinds 34 Travis Hurd 27 Ayo Isijola 6 Pos. WR DE CB K DB QB OL QB LS OG DE WR WR DB DB LB QB CB S LB DB CB P S DE OG LB K QB RB RB OT DT TE C OT LB LB LB S RB RB No. 1 2 3 4 5 6 7 8 9 10 11 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 40 41 42 44 45 46 47 49 Name Chris Paul-Etienne Robenson Alexis Brandon Johnson-Farrell Evan Shields Rob Damon Joseph Harris Ellis Foster Steve Probst Chris Edmond Tom Lang Billy Morgan Danny Fenyak Louis Feinstein Doug D’Angelo Marc Lucarini Stanley Dunbar Robert Bentsen Nick Becker Matt Hansen Tyquan Bynum Devon Dace Jordan Dalton Jarrod Williams Daniel O’Connell Ryan Lawrence Ayo Isijola De’ Ontray Johnson Colton Woodall Tim Edger Matt Urban Darrell Dulany Anthony Baskerville Travis Hurd George Tsakirgis Brandford Sowah Rodney Chance Michael Okunfolami Cameron Josse Chris Mancuso David Zocco Anthony Ferrer David Coleman Ali Muhammad Manee Williams Miller Hinds Pos. QB CB WR CB LB LB RB QB S TE WR QB K QB QB CB QB QB LB WR CB S CB LB WR RB RB S P S DB DB RB LB WR DB RB S LB S RB DB LB LB S Ht. 6-3 6-1 5-10 5-10 6-1 5-11 5-10 6-4 5-10 6-3 5-9 6-4 5-10 6-1 6-2 5-10 6-1 6-1 6-1 6-2 5-10 6-0 6-1 6-1 5-9 5-10 5-9 6-3 6-2 6-2 6-1 5-11 5-8 5-9 5-7 5-10 5-10 5-10 5-10 6-1 5-10 5-11 6-3 6-1 5-9 W W W. G O R H O D Y. C O M Wt. 190 180 185 190 205 225 185 215 200 240 165 180 185 180 205 185 200 195 230 205 180 200 200 220 200 190 170 185 185 205 190 185 180 230 175 160 195 210 220 220 225 190 225 220 190 Yr. Hometown/Last School SR Miami, Fla./Rutgers JR Boca Raton, Fla./Rutgers SO Odenton, Md./Arundel JR Adelphi, Md./Gonzaga College Prep SR Piscataway, N.J./Trinity-Pawling SR Lowell, Mass./Lowell SO Baltimore, Md./Baltimore City College JR North Massapequa, N.Y./Hofstra JR Freeport, N.Y./Hofstra SR Concord, Mass./Rutgers SO Chester, Pa./Hofstra FR Chantilly, Va./Westfield JR Irvine, Calif./University H.S. FR Sparta, N.J./Sparta SO Laurel Springs, N.J./Camden Catholic JR Johnston, R.I./Dean College RS FR Warwick, R.I./Warwick Veterans Memorial FR Coral Springs, Fla./Pine Crest SR Providence, R.I./La Salle Academy SO Lancaster, Pa./Milford Academy JR St. Louis, Mo./Salisbury Prep SO Willingboro, N.J./Paul VI SR Glen Mills, Pa./West Chester East SR Barrington, R.I./Milford Academy JR Bloomfield, N.J./Bloomfield SO Brooklyn, N.Y./Sheepshead Bay FR San Diego, Calif./Hoover RS FR Davie, Fla./North Broward Prep JR Hainesport, N.J./St. Joseph’s Prep SR Warren, R.I./Mount Hope JR Philadelphia, Pa./Valley Forge Military Academy JR Franklin, Mass./Dean College FR Branford, Conn./Cheshire Academy RS FR Lynnfield, Mass./The Governor’s Academy JR Providence, R.I./Bishop Hendricken FR Mansfield, Mass./Mansfield SR Providence, R.I./Canterbury Prep SO Oakland, N.J./Indian Hills JR Atlantic City, N.J./Holy Spirit RS FR Nashua, N.H./Nashua South SR West Greenwich, R.I./Cranston West FR Montcliar, N.J./Montcliar RS FR Kingston, Pa./Wyoming Valley West SO New Rochelle, N.Y./New Rochelle RS FR Flanders, N.J./Mt. Olive 2010 ROSTER No. 50 51 52 53 54 55 56 57 58 59 60 61 63 67 70 71 72 74 75 77 80 81 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 Name Shomari Watts Matt Greenhalgh David Hansen Kyle Elliott Justin Favreau John Bicknell IV Willie McGinnis Alex Craft Kenny Smith Michael Farr Jeff Kennedy Brian Louth Dave Valley Ian Monzo Kevin Mustac Michael Gross Kyle Bogumil Jason Foster Andrew Belizaire James Murray Joe Migliarese Ramadan Abdullah Zack Moore Drew Anderson Matt Brown Kyle Steadman Trevor Turner Derek Gibson Dan Luntz Victor Adesanya Josh Moody Alex Frazier Matt Sheard Mike Rinaldi James Timmins Matt Rae Brandon Bramwell Pos. LB C LB DE LB LS DT LB LB OG OL OL OG OL OL OT OG OT OL DE TE WR WR K WR WR WR TE DE DE DE DT DT DE DL DT DE Ht. 6-1 6-2 5-10 6-3 5-11 6-0 6-3 6-1 5-10 6-3 6-4 6-0 6-3 6-3 6-5 6-4 6-6 6-5 6-3 6-2 6-4 6-0 5-10 6-0 5-10 6-2 6-1 6-4 6-3 6-4 6-4 6-4 6-2 6-0 6-2 6-4 6-4 Wt. 215 295 190 265 210 240 300 215 235 300 240 255 295 255 260 280 280 285 265 225 240 170 185 170 175 180 180 240 220 235 235 245 255 225 215 290 250 Yr. RS FR SO FR JR FR RS FR JR FR SO SO FR RS-FR SR SO FR JR JR JR SO SO JR FR SO FR SO SO SO FR RS FR SR FR SO JR FR FR JR SR Hometown/Last School Philadelphia, Pa./Haverford Chepachet, R.I./Ponaganset Providence, R.I./La Salle Cresskill, N.J./Cresskill Wakefield, R.I./South Kingstown Hopkinton, Mass./Hopkinton Norwich, N.Y./Bainbridge-Guilford East Greenwich, R.I./East Greenwich Jersey City, N.J./St. Peters Prep Cornwall on Hudson, N.J./Navy Prep Hope, R.I./Scituate East Windsor, N.J./Hightstown East Providence, R.I./East Providence Oxford Hills, Maine/Oxford Hill Rutherford, N.J./St. Mary’s North Arlington, N.J./North Arlington Mountain Top, Pa./Crestwood East Pittsford, Vt./Bridgton Academy Monsey, N.Y./St. Joseph Regional North Scituate, R.I./Scituate Blue Bell, Pa./La Salle College Philadelphia, Pa./Germantown Wyckoff, N.J./Ramapo Warwick, R.I./Bishop Hendricken North Kingstown, R.I./Bishop Hendricken North Easton, Mass./Oliver Ames High Hanover, Md./Meade Sr. Bloomfield, N.J./Worcester Academy Croton, N.Y./Croton-Harmon Staten Island, N.Y./Merrimack College Staten Island, N.Y./Tottenville Westfield, Mass./Bridgeton Academy Mt. Laurel, N.J./Camden Catholic Dallas, Texas/Jesuit Prep Staten Island, N.Y./Curtis York, Pa./Dallastown Area Long Island, N.Y./Nassau JC Head Coach: Joe Trainer (Dickinson '90), third season at URI - second season as a head coach Assistant Head Coach/Offensive Line Coach: Roy Istvan (Southern Connecticut ‘90) Assistant Coaches: Eddie Allen (Special Teams/Running Backs), Alex Auerbach (Offensive Assistant), Ari Confesor (Wide Receivers), Ryan Crawford (Secondary/Recruiting Coordinator), Rapheal Dowdye (Linebackers), Bob Griffin (Tight Ends/ Special Consultant), Greg Hadley (Defensive Assistant), Rob Neviaser (Defensive Coordinator/Defensive Line), Chris Pincince (Offensive Coordinator/Quarterbacks), Dan Silva (Director of Football Operations) W W W. G O R H O D Y. C O M No. 28 3 40 60 10 26 61 16 90 41 56 80 67 92 84 11 46 77 70 25 38 1 8 97 95 94 4 58 36 87 96 35 88 31 63 50 24 47 29 42 Name De’Ontray Johnson Brandon Johnson-Farrell Cameron Josse Jeff Kennedy Tom Lang Ryan Lawrence Brian Louth Marc Lucarini Dan Luntz Chris Mancuso Willie McGinnis Joe Migliarese Ian Monzo Josh Moody Zack Moore Billy Morgan Ali Muhammad James Murray Kevin Mustac Daniel O’Connell Michael Okunfolami Chris Paul-Etienne Steve Probst Matt Rae Mike Rinaldi Matt Sheard Evan Shields Kenny Smith Brandford Sowah Kyle Steadman James Timmins George Tsakirgis Trevor Turner Matt Urban Dave Valley Shomari Watts Jarrod Williams Manee Williams Colton Woodall David Zocco Pos. RB WR S OL TE WR OL QB DE LB DT TE OL DE WR WR LB DE OL LB RB QB QB DT DE DT CB LB WR WR DL LB WR S OG LB CB LB S S 7 THE RAMS 91 VICTOR ADESANYA 2 ROBENSON ALEXIS Staten Island, N.Y. St. Thomas More/Merrimack Boca Raton, Fla. West Boca Raton/Rutgers DE SR CB 235 6-4 G 11 UT 16 AT 16 Total 32 12 11 34 28 23 67 17 11 44 45 34 111 TFL-Yds 13.0-72 Did not play 3.5-13 6.5-38 10-51 Sacks 10 Int 0 FF 3 FR 0 PD 0 1 4 5 0 1 1 0 3 3 0 1 1 0 2 2 2009: Finished the year with 34 tackles, 6.5 tackles for loss and four sacks, which tied for second on the team... Had a dominant game defensively in the Rams’ season-opener against Fordham (9/5) as he registered six solo tackles, forced two fumbles, recorded two sacks and two tackles for loss... Recorded one sack and one tackle for loss at home versus Hofstra (10/17)... Totaled six tackles, one sack and one tackle for loss at home against William and Mary (10/31)... Pulled down his first career interception and tallied five tackles at New Hampshire (11/7). 2008: Had three solo tackles, one for a loss of yards against Monmouth (8/30)... Finished with eight tackles against Fordham (9/7)... Recorded six tackles against Hofstra (9/20)... Wrapped-up five tackles (four solo) against Boston College (9/27)... Registered five tackles against Towson (10/11)... Grabbed three solo tackles and a sack against William and Mary (10/25)... Had three tackles (one for a loss of yards) against Maine (11/15)... Finished the season with two tackles against Northeastern (11/22). Year 2009 Career G 9 9 UT 14 14 AT 17 17 Total 31 31 TFL-Yds 1.0-2 1.0-2 Sacks 0 0 Int 0 0 FF 0 0 FR 1 1 PD 1 1 2009: Posted a season-high eight tackles at Massachusetts (9/19)... Recovered one fumble and totaled five tackles at Connecticut (9/26)... Had one pass break-up and three tackles against Villanova (10/24)... Tallied seven tackles at New Hampshire (11/7). 2007-08 (Rutgers): Worked primarily with the scout team during his two seasons. High School: Three-year starter... Split time between wide receiver and quarterback as a senior... Rated as the No. 69 wide receiver prospect in the country and the No. 83 prospect in the state of Florida according to Rivals.com... Second Team All-Big Schools selection by the South Florida Sun-Sentinel (Classes 4-6A)... Guided West Boca Raton to a 9-2 record and first playoff appearance in school history. Personal: Born March 28, 1988... Son of Nicole Alexis... Has two brothers (Junior and James) and two sisters (Alphonse and Geralda)... His cousin Jason Chery plays wide receiver for the Carolina Panthers... List Jerry Rice and Terrell Owens as his favorite athletes... Sociology major at URI. 2007: Sat out after transferring from Merrimack College. 2006: Attended Merrimack College, where he was a member of the Warrior football team… Helped Merrimack earn its first-ever NCAA Tournament berth... Second Team All-Northeast 10 selection… Finished with 10 sacks, which ranks second all-time in school history… Recorded 3.5 sacks in collegiate debut at Stonehill (9/1) … Member of A.L.A.N.A. Club. High School: Attended St. Thomas More Prep, where he was a member of the football and track teams… Helped football program to a 12-1 mark and a 2005 NESC Championship… First Team AllNESC… Boston Globe All-NESC selection… Member of High Honor Roll… Received Most Outstanding Student honors... Attended Curtis High School… Four-year member of football program… Also competed in track & field for one year… Member of yearbook committee. Personal: Born February 14, 1987… Son of Vincent Adesanya and Victoria Ayeni… Has seven siblings – Bukky, Aelebambo, Victoria, Wonu, Anthonia, Diwura, and Yumbo… Enjoys dancing, music, movies, and photography… Lists Deion Sanders, Terrell Owens, Shawn Merriman, and Dwight Freeney as his favorite athletes… Finance major and communications minor at URI. 8 180 6-1 ALEXIS’ CAREER STATS ADESANYA'S CAREER STATS Year 2006 2007 2008 2009 Career JR W W W. G O R H O D Y. C O M THE RAMS 75 ANDREW BELIZAIRE 18 ROBERT BENTSEN Monsey, N.Y. St. Joseph Regional Warwick, R.I. Warwick Veterans Memorial OL SO 265 6-3 QB BELIZAIRE’S CAREER STATS Year 2009 Career G 4 4 UT 0 0 AT 2 2 Total 2 2 TFL-Yds 0.0-0 0.0-0 Sacks 0 0 RS-FR 6-1 200 2009:: Sat out redshirt season. Int 0 0 FF 0 0 FR 0 0 PD 1 1 2009: Appeared in four games. High School: Served as a two-year starter on the offensive line... Started every game at right tackle as a junior before moving to left tackle where he started every game as a senior... Two-year letter winner... Helped St. Joesph’s Regional to an 11-1 record as the school collected its 11th State Championship in the last 14 years in Group Three Non-Public... Received All-Conference honors as a senior in the Northern New Jersey Interscholastic League, which is comprised of the largest public and non-public schools in North Jersey... Helped pave the way for St. Joesph’s running backs to rush for 2,300 yards on the ground and average 36 points per game. attends Roger Williams University... Interested in boxing and movies... Lists his favorite athlete as Tom Brady...Favorite sport team is the New England Patriots. Personal: Born July 31, 1991...Son of Erol and Marie Belizaire...Has two brothers Erol Jr. and Matthew... Enjoys playing basketball and listening to music. 55 JOHN BICKNELL IV Hopkinton, Mass. Hopkinton LS RS-FR 6-0 240 2009: Sat out redshirt season. High School: Earned four varsity letters... Received Coaches Award... Selected Honorable Mention AllTri-Valley... Played tight end and defensive end... Two-year letterwinner in indoor track and baseball. Personal: Born Feb. 11, 1991... Son of Jack and Helen Bicknell... Has younger two sisters - Katelyn and Alyse... His father Jack and Uncle Bob Bicknell played college football at Boston College from 1982-85... His father Jack is the tight ends coach with the New York Giants... Enjoys fishing... Lists the New York Giants as his favorite team. W W W. G O R H O D Y. C O M 9 THE RAMS 72 KYLE BOGUMIL 98 BRANDON BRAMWELL Mountain Top, Pa. Crestwood High School Long Island, N.Y. Nassau JC OG JR 6-6 280 2009: Started 11 games at left guard where he helped the offensive unit post 400 yards or more in three games... Helped pave the way for a season-high 229 yards in the Rams season-opening victory over Fordham (9/5)... Helped the Rams to 202 yards rushing against in-state rival Brown... Protected quarterback Chris Paul-Etienne and allowed him to throw for a season-high 424 yards passing (11/7). 2008: Moved to offensive tackle in the spring after he played 10 games on the defensive line as a freshman. DE 250 6-4 BRAMWELL’S CAREER STATS Year 2009 Career G 8 8 UT 5 5 AT 2 2 Total 7 7 TFL-Yds 1.0-1 1.0-1 Sacks 0 0 Int 0 0 FF 0 0 FR 0 0 PD 0 0 2009: Saw action in eight games and recorded seven tackles... Made his Rhode Island debut at Connecticut (9/26)... Logged his first career start against nationally-ranked WIlliam and Mary (10/31)... Recorded a pair of tackles against Hofstra (10/17) and Villanova (10/24). High School: Earned three varsity letters in football at Crestwood under head coach Greg Myers... hauled in 32 passes for 462 yards and four touchdowns as a senior, earning Associated Press Pennsylvania Class AAA Second Team All-State honors... 2007 Times Tribune Second Team Tight End... Posted 658 yards and four touchdowns as a junior in 2006... All-State honorable mention (2006)... First Team All-Scholastic (2006)... Four-year letterwinner and starter on Crestwood basketball team, helping them capture three district championships... D.A.R.E. Role Model. Personal: Born September 1, 1989... Son of Walt and Carrie Bogumil and Tina Parker... Has two brothers Brandon and Joel... Lists his favorite athlete as Muhammad Ali and his favorite team as the Atlanta Falcons... Was a member of the boys basketball team which won three district championships... Majoring in Kinesiology and plans to be a teacher following graduation. 10 SR W W W. G O R H O D Y. C O M THE RAMS 21 TY BYNUM Lancaster, Pa. Milford Academy WR SO 6-2 205 BYNUM'S CAREER STATS Year 2008 2009 Career G 2 11 13 Rec 8 38 46 Yds 51 506 557 Td 0 2 2 Lg 15 66 66 Avg 6.4 13.3 12.1 YPG 25.5 46.0 42.8 2009: Finished the year with 38 receptions for 506 yards receiving, which ranked second on the team... Totaled a career-high 99 yards receiving in the Rams’ season-opening victory over Fordham (9/5)... Caught a career-long 66 yard touchdown pass at Connecticut (9/26)... Totaled a game-high six receptions (75 yards) at home against Hofstra (10/17)... Hauled in four passes for 77 yards at New Hampshire (11/7). 2008: Started the first two games of the season before being sidelined because of an injury... Received a medical redshirt... Caught five passes for a total of 43 yards against Fordham (9/7). High School: Attended Milford Academy and played for head coach Bill Chaplick... Four-year letterwinner... Two-time Associated Press Quad-A First Team All-State selection... Established Lancaster-Lebanon League records for career receiving yards with 2,327... First team All-County and All-State in 2005 and 2006... 2006 Section 2 Wide Receiver of the Year, when he hauled in 70 passes for 1,098 yards and 19 touchdowns... Recipient of Eugene Oakie O’Connell Memorial Award, which is presented for significant personal character which exemplifies dedication, courage, and loyalty’... Holds school record for receptions (172) and the longest kickoff return (95 yards)... Posted 71 receptions for 1,229 yards and 10 touchdowns as a junior... Caught 31 passes for 431 yards and three touchdowns as a sophomore. Personal: Born April 1, 1989... Son of Francis Arredondo... Has four sisters Laquandra, Reyan, Sharay and Laray... Lists Deion Sanders as his favorite athlete and the Dallas Cowboys as his favorite team. W W W. G O R H O D Y. C O M 11 THE RAMS 22 DEVON DACE 23 JORDAN DALTON St. Louis, Mo. Salisbury Prep Willingboro, N.J. Paul IV High School CB JR 5-10 180 S DACE'S CAREER STATS Year 2008 2009 Career G 9 4 13 UT 10 6 16 AT 6 4 10 Total 16 10 26 TFL-Yds 1.5-8 1.0-3 2.5-11 Sacks 0 0 0 200 6-0 DALTON’S CAREER STATS Int 0 1 1 FF 0 0 0 FR 0 0 0 PD 1 1 2 2009: Played in four games, including the season finale against Northeastern... Recorded seven tackles and had one interception against nationally-ranked Villanova (10/24). 2008: Appeared in nine games during his freshman season and recorded 16 tackles. High School: Attended Salisbury Prep School and played for head coach Chris Adamson... Caught two touchdown passes (3,6) against Taft School (10/6)... Recorded six receptions for 44 yards and one touchdown and broke off a 68-yard run in season-finale against Cushing Academy (11/10)... Played four years of football and basketball at Bishop DuBourg and Webster Groves... Hauled in 31 passes for 239 yards and three touchdowns as a senior... St. Louis American All-Metro and All-Conference... Recipient of Renaissance Award and Blue Top Hat Award at Webster Groves High School. Year 2009 Career G 10 10 UT 17 17 AT 7 7 Total 24 24 TFL-Yds 1.0-1 1.0-1 Sacks 0 0 Int 0 0 FF 0 0 FR 1 1 PD 0 0 2009: Played in 10 games... Posted three tackles at Connecticut (9/26)... Recorded two tackles, one tackle for loss and had one fumble recovery against nationally-ranked William and Mary (10/31)... Tallied six tackles at Maine (11/14)... Closed out the year with a season-high seven tackles against Northeastern (11/21). High School: Served as the team captain during his senior year... Played two seasons at Paul VI and started on both offense and defense in both years... Voted as the team’s Most Valuable Player... Earned Second Team All-Burlington Olympic Conference honors as a running back... Lead the team in rushing with 942 yards to go along with 16 touchdowns. Personal: Born Jan. 23, 1991... Interested in Jazz music... Favorite athletes are Ray Lewis and Darren McFadden... Favorite sport team is the Dallas Cowboys... Three year letter winner in football and track. Personal: Born September 14, 1989... Son of Shawn and Stephanie Dace... His father is a Sargent in the St. Louis Police Department... Has one brother Shawn and one sister Dendra... His cousin Brandon Williams is a receiver for the Pittsburgh Steelers... Enjoys hanging out with friends and playing video games... Communications major at URI. 12 SO W W W. G O R H O D Y. C O M THE RAMS 5 ROB DAMON Piscataway, N.J. Trinity-Pawling High School LB Year 2007 2008 2009 Career G 11 12 11 34 UT 18 10 60 88 SR DAMON'S CAREER STATS AT 15 8 64 87 Total 33 18 124 175 TFL-Yds 1.5-4 0-0 14.0-37 15.5-41 Sacks 0 0 2 2 6-1 Int 0 0 1 1 205 FF 0 1 3 4 FR 0 1 2 3 PD 0 0 1 1 2009: Moved to linebacker in the spring and went on to have a breakout season where he was named All-CAA Third Team... Led the CAA in tackles per game averaging 11.3 stops per game... Finished the year with a team-high 124 tackles and 14.0 tackles for loss... Registered 10-or-more tackles in eight games... Recorded 11 tackles and forced one fumble in the Rams’ season-opening victory over Fordham (9/5)... Posted 16 tackles, two tackles for loss, two forced fumbles at Massachusetts (9/19)... Recorded a careerhigh 19 tackles, 2.5 tackles for loss at Connecticut (9/26)... Tallied eight tackles, one tackle for loss and tallied his first career interception, which he returned 75 yards for a touchdown at Brown (10/3)... Posted 12 tackles, two tackles for loss and one sack at home against Hofstra (10/17)... Recovered one fumble and recorded seven tackles at Villanova (10/24)... Tallied 11 tackles and one tackle for loss at home versus William and Mary (10/31)... Recorded 12 tackles and one fumble recovery at New Hampshire (11/7)... Posted 12 tackles, two tackles for loss at Maine (11/14)... Finished the year with 10 tackles, one tackle for loss and one sack versus Northeastern (11/21). 2008: Started the first three games of the season at strong safety... Registered five tackles against Fordham (9/7)... Finished with two solo tackles against New Hampshire (9/13)... Recorded two tackles against Hofstra (9/20)... Had a solo tackle, forced a fumble and recovered a fumble against Brown (10/4). 2007: Appeared in all 11 games... Recorded 33 tackles (18 solo) and 1.5 sacks... recorded a career-high 10 tackles (two solo) in first collegiate game against Fordham (9/1)... Made eight tackles (five solo) and had 1.5 sacks in season-ending win against Northeastern (11/17)... Tallied four solo tackles against James Madison (10/13)... Registered four tackles (two solo) against Army (9/8)... Earned a varsity letter. 2006: Did not play. High School: Attended Piscataway High School for three years before attending Trinity Pawling as a senior... Received four varsity letters in football, wrestling, and track... Won four football state titles, making the game-winning tackle on the one-yard line, to clinch the championship game as a junior... Went 36-0 in wrestling as a senior and finished career with 105 wins... Capped off 34-1 junior wrestling season with a third-place finish at N.J. State Championship... Holds Trinity-Pawling record in 400m (48.5). Personal: Born on May 15, 1986... Son of Russell and Felicia Damon... Has two siblings - Russell and Latoya... Sociology major at URI. W W W. G O R H O D Y. C O M 13 THE RAMS 30 TIM EDGER 53 KYLE ELLIOTT Hainesport, N.J. St. Joseph’s Prep Cresskill, N.J. Cresskill High School P JR 6-2 DE 185 No. 60 71 131 Yds. 2284 2946 5230 Avg. 38.1 41.5 39.9 Long 59 68 68 TB 5 I20 17 Blkd 1 5 17 1 2009: Selected All-CAA Second Team and was one of just three sophomores named to the squad... Posted a league-best punting average of 41.5 yards per game... Placed 15 punts inside the 20-yard line... Drilled a 61-yard punt and posted an average of 49.0 yards per punt in the Rams’ season-opener against Fordham (9/5)... Averaged 43.1 yards per punt at Connecticut (9/26)... Posted an average of 45.8 yards per punt against Hofstra (10/17)... Placed a pair of punts inside the 20-yard line at Villanova... Booted a career-long 68-yard punt versus William and Mary... Dropped a pair of punts inside the 20-yard line and averaged 45.5 yards per attempt at Maine (11/14). 2008: Finished the year with a punt average of 38.1 yards per punt, which ranked seventh in CAA Football... Placed 17 punts inside the 20... In just his second college football game against Fordham (Sept. 7), Edger highlighted the Rams’ special teams effort as he placed five punts inside the 20-yard line and two inside the five... Against nationally-ranked Maine, Edger had three punts for 153 yards (51.0 avg.), including a season-long 59-yard boot. High School: Four-year member and three-year letterwinner in football and baseball at St. Joseph’s Prep... Averaged 45.6 yards per punt as a senior... Booted 121 PAT and 16 field goals for his career, including a long of 45 yards... Appeared in 33 career games, catching 36 catches for 612 yards and 10 touchdowns... Went 6-of-9 on FGA (long: 45 yards), 39-of-43 on PAT, and caught 25 passes for 356 yards and eight touchdowns as a senior, earning First Team All-Catholic League as a kicker and punter and Second Team as a wide receiver; also earned First Team All-City and Second Team All-Southeastern Pa. honors as a punter... First Team All-Catholic League as a kicker and Second Team as a punter, as well as second team all-city (punter) following junior season. Year 2008 2009 Career G UT AT Total 9 9 3 3 4 4 7 7 265 TFL-Yds Redshirted 1.0-1 1.0-1 Sacks Int FF FR PD 1 1 0 0 0 0 0 0 0 0 2009: Played in nine games and finished the year with seven tackles... Had four tackles at Brown (10/3)... Totaled three tackles, one tackle for loss and one sack at Villanova (10/24). 2008: Switched to defensive end in the spring after serving as a backup quarterback in the fall... Sat out redshirt season. High School: Four-year letterwinner in football, wrestling, and track at Cresskill... Passed for 1,327 yards and 16 touchdowns as a senior captain while rushing for 841 and 11 touchdowns playing for head coach Robert Valli... First Team All-Bergen County selection... Was 93-of-178 for 1,607 yards and 12 touchdowns as a junior; recorded 43 tackles and five sacks on defense... Class of 2008 Special Teams Solutions (STS) Elite... Third Team All-County... Ranked as No. 4 QB by The McCarthy Report (N.J.)... District champion in wrestling who finished No. 2 in region... Threw javelin for track & field team. Personal: Born March 3, 1990... Son of Scott and Athonette Elliott... Has one sister Johanna... Enjoys football, wrestling and track... Lists his favorite athlete as Peyton Manning and his favorite team as the Miami Dolphins... Played the saxophone in the high school band. Personal: Born September 16, 1989... Son of William and Mary Beth Edger... Has one brother Bill and one sister Beth... His father William is a member of the West Chester University Hall of Fame... Lists Barry Sanders as his favorite athlete and the Philadelphia Eagles as his favorite team... Enjoys snowing boarding and going to the Jersey Shore... Business major at URI. 14 6-3 ELLIOTT'S CAREER STATS EDGER'S CAREER STATS Year 2008 2009 Career JR W W W. G O R H O D Y. C O M THE RAMS 59 MICHAEL FARR 14 LOUIS FEINSTEIN Cornwall on Hudson, N.J. Navy Prep Irvine, Calif. University High School OG SO 6-3 300 K JR 5-10 185 FEINSTEIN'S CAREER STATS 2009: Made his lone appearance of the year at Massachusetts (9/19). 2008: Sat out redshirt season. 2007: Attended Naval Academy Prep... Enrolled in URI for the spring semester and participated in spring practice. High School: Three-year letterwinner in football... Helped Don Bosco Prep to a Parochial Group IV State Championship and a No. 7 national ranking in 2006... Ranked as No. 10 offensive lineman by The McCarthy Report (N.J.)... Bergen County Athlete of the Year and Third Team All-State selection as a senior... Also received four letters in track & field and three in wrestling... First team all-state in wrestling and track as a senior. Personal: Born June 16, 1989... Son of John and Michelle Farr... Has one younger Brother - David... Lists his favorite team as the New Orleans Saints... Was a member of Student Council in high school... Business major at URI. Year 2008 2009 Career FGM-FGA 11-18 7-9 18-27 Pct. 61.1 77.8 66.7 Lg 47 39 47 Blk 0 0 0 KO 46 Yards 2603 Avg. 56.6 TB 0 46 2603 56.6 0 2009: Connected on 7-of-9 field goals for the year... Drilled a pair of 25-yard field goals and had two touchbacks in the Rams’ season-opening victory against Fordham (9/5)... Converted a 38-yard field at Massachusetts (9/19)... Had one touchback and averaged 64.0 yards per kick against Towson (10/10)... Connected on a season-long 39-yard field goal at New Hampshire (11/7)... Hit a 38-yard field goal at Maine (11/14). 2008: Earned CAA Football Rookie of the Week honors after he connected on a pair of field goals against Monmouth (8/30)... Was 3-for-3 on field goals against New Hampshire (9/13) including a 36-yard field goal... Knocked down a 20-yard field goal in the fourth quarter in a victory over Brown (10/4)... Scored a third quarter 20-yard field goal against Towson (10/11)... Hit a 40-yard field goal in the second quarter against William and Mary (10/25)... Drained 3-of-4 field goals, including a 42-yard field goal and a 40yard field goal in the season-finale win over Northeastern (11/22). High School: Three-year letterwinner in both football and soccer at University High School, helping both capture a Pacific Coast League Conference Championship in 2007... Converted 40-of-42 PAT and 10of-12 FGA as a senior for head coach Mark Cunningham, including a long of 45... Special Teams MVP in 2005, 2006, and 2007... Irvine World News All-City First Team... Pacific Coast League First Team... All-CIF Southern Section First Team... Orange County Register First Team... Scout.com GSP All-Southern California Second Team... Irvine All-City Honorable Mention as a sophomore... Five-time Player of the Week. Personal: Born July 16, 1990... Son of Steven and Christine Feinstein... Has one sister Kailee... His father played football and baseball at Wayne State College... Lists his favorite team as the San Diego Chargers... Business major at URI. W W W. G O R H O D Y. C O M 15 THE RAMS 44 ANTHONY FERRER West Greenwich, R.I. Cranston West High School RB SR 5-10 225 FERRER'S CAREER STATS Year 2006 2007 2008 2009 Career G Att Yds Avg Td Lg 10 12 11 33 46 45 104 195 196 195 411 802 4.3 4.3 4.0 4.1 1 3 5 9 20 21 68 68 YPG Rec Redshirted 19.6 1 16.2 8 37.4 3 23.6 12 Yds Avg Td Lg YPG 8 40 18 66 8.0 5.0 6.0 5.5 0 2 0 2 8 14 9 14 0.8 3.3 1.6 1.9 2009: Led the team in rushing touchdowns (five) and yards rushing (411)... Appeared in every game... Averaged 4.0 yards per carry... Scored the Rams’first touchdown of the season on a one-yard rush against Fordham (9/5)... Finished the game with 53 yards on 16 carries... Totaled 41 yards rushing on nine carries at Massachusetts (9/19)... Had a career-long 68 yard touchdown run and finished with 76 yards against Brown (10/3)... Rushed for 78 yards the following week against Towson (10/10)... Scored a touchdown from a yard out against Hofstra (10/17)... Gained 47 yards on seven carries and scored a touchdown at New Hampshire (11/7)... Rushed for 62 yards on 15 carries and scored a touchdown from two yards out against Northeastern (11/21). 2008: Ran the ball five times for a total of seven yards and a touchdown and caught a one yard reception for a touchdown against New Hampshire (9/13)... Put up a rushing touchdown and a receiving touchdown with a total of 27 yards for the day against Hofstra (9/20)... Registered 46 all purpose yards against Boston College (9/27)... Carried the ball eight times for 14 yards against Brown (10/4)... Rushed for 28 yards on five carries against Towson (10/11)... Recorded 19 total yards against UMass (11/1)... Carried the ball twice for eight yards against Maine (11/15)... In his last game of the season, he had 10 rushes for 71 yards and a touchdown against Northeastern (11/22). 2007: Appeared in 10 games... Rushed for 196 yards and one touchdown... carried 25 times for 109 yards and one touchdown in season-finale against Northeastern (11/17)... Five carries for 17 yards and one reception for eight yards at Delaware (9/15)... Rushed for 16 yards on four carries against Fordham (9/1)... Earned a varsity letter. 2006: Sat out redshirt season. High School: Four-year letterwinner in football and wrestling at Cranston, serving as captain of both as a senior... Rushed for 1,300 yards and 20 touchdowns as a junior and 1,700 yards and 24 touchdowns as a senior for head coach Steven Stoehr... Made 88 tackles and recorded 10 sacks as a sophomore... garnered all-state honors as a linebacker in 2006 after earning the same honor as a running back in 2005... 2006 R.I. Sports Journal Male Athlete of the Year... Rushed for 210 yards and four touchdowns in 2006 playoff game against North Kingston... Helped Cranston win Division 1 State Championship in football 2005 and in wrestling in 2006. Personal: Born December 16, 1988... Son of Anthony Gambuto and Angela Ferrer... Has two siblings - Albert and Andrew Loffredo... Lists Ray Lewis and Brian Urlacher as his favorite athletes and the Boston Red Sox, Boston Celtics, and New England Patriots as favorite teams... Business finance major at URI. 16 W W W. G O R H O D Y. C O M THE RAMS 7 ELLIS FOSTER 74 JASON FOSTER Baltimore, Md.. Baltimore City High School East Pittsford, Vt. Bridgton Academy RB SO 5-10 185 OT FOSTER'S CAREER STATS Year 2009 Career G 6 6 UT 10 10 AT 2 2 Total 12 12 TFL-Yds 1.5-6 1.5-6 Sacks 0 0 Int 0 0 FF 1 1 FR 1 1 PD 1 1 2009: Moved to running back in the spring after spending the 2009 season as a defensive back... Appeared in six games and finished the year with 12 tackles... Made his first career appearance at Massachusetts (9/19)... Totaled three tackles and one tackle for loss against William and Mary (10/31)... Registered a pair of tackles at New Hampshire (11/7)... Recorded his first career interception, which he raced 45 yards for a touchdown at Maine (11/14)... Posted a season-high four tackles against Northeastern (11/21). High School: Served as a four-year starter… Amassed 3,662 passing yards, 1,112 rushing yards and 55 total touchdowns during his high school career... Helped lead his team to a 31-8 record while he was at Baltimore City… Led Baltimore City to a 3-1 record against rival Poly in the school’s annual game… Passed for 1,207 yards and rushed for another 923 yards as a senior, leading the Knights to a 6-4 record… Threw 11 touchdowns, ran for another six scores and added a 62-yard punt return for a total of 18 TDs in 2008… Selected to the AllBaltimore City Coaches team as a senior. Personal: Born Nov. 29, 1989... Son of Elaine and Floyd Foster... Has two siblings... Brothers Kendrick and Phillip... Interest are music, playing instruments, and lacrosse... Favorite athlete is Ed Reed... Favorite team is the Baltimore Ravens. JR 6-5 285. W W W. G O R H O D Y. C O M 17 THE RAMS 93 ALEX FRAZIER 51 MATT GREENHALGH Westfield, Mass. Bridgeton Academy Chepachet, R.I. Ponaganset High School DT Year 2009 Career G 2 2 UT 1 1 SO FRAZIER'S CAREER STATS AT 0 0 Total 1 1 TFL-Yds 1.0-5 1.0-5 Sacks 1 1 6-4 Int 0 0 245 FF 0 0 FR 0 0 C PD 0 0 2009: Made appearances against Hofstra (10/17) and Villanova (10/24)... Recorded one sack and one tackle for loss at home against Hofstra (10/17). High School: Three-year letterwinner... Selected First Team All-League and First Team All-Conference... Served as the team captain during his senior season... Voted as the team’s. SO 6-2 295 2009: Appeared in three games and started one game at home against Towson (10/10) where he helped the offensive unit post 166 yards rushing. 2008: Did not play. High School: Four-year letterwinner at Ponaganset High School for head coach Thomas Marcello... Providence Journal Second Team - Offense as a senior captain in 2007, when he posted 76 tackles (43 solo), two fumble recoveries, and one blocked punt as Ponaganset won the Rhode Island Division III Super Bowl/State Championship... Helped offense rush for 1,600+ yards and pass for 2,000+ yards... Three-time DIII All-Academic selection (2005-07)... 2007 DIII All-Division First Team... 2006 DIII All-Division Second Team... Ranked No. 10 in Rhode Island with four sacks in 2007... Season-high 10 tackles (seven solo) against Johnston (11/4/07)... Recorded two sacks against Narragansett (10/6/07)... 2006 Providence Journal Division III Second Team - Offense... Registered 58 tackles (41 solo) and 5.5 sacks as a junior... Member of National Honor Society and Rhode Island Honor Society... Works with TOPS Program mentoring the same child for four years. Personal: Born March 14, 1990... Son of John and Laurie Greenhalgh... Has one brother - John... His father played football and competed in track at Southern Illinois from 1977-78... Lists Dick Butkus as his favorite athlete and the Boston Red Sox and New England Patriots as his favorite teams. 18 W W W. G O R H O D Y. C O M THE RAMS 71 MICHAEL GROSS North Arlington, N.J. North Arlington High School OT JR 6-4 280 2009: Was a mainstay for the Rams at right tackle as he started in each of URI’s first seven games before suffering a knee injury against Villanova, which sidelined him for the remainder of the year... Helped the offensive unit surpass 400 yards in total offense on two separate occasions (Fordham - 9/5; Brown - 10/3). 2008: One of the Rams’ most consistent starters... Made his first start of the year against Fordham (9/6) and then went on to start the final 11 games of the season as a true freshman... In his second start against New Hampshire, Gross helped the Rams gain a season-high 517 yards of offense. High School: Four-year member and three-year letterwinner for head coach Anthony Marck at North Arlington... Recorded 83 tackles, 13 sacks, eight batted balls, four forced fumbles, two fumble recoveries as a defensive lineman as a senior, earning First Team All-State Group 1 and First Team All-Bergen County... First Team All-BCSL as a defensive lineman as a junior and senior... All-Bergen Honorable Mention (DL) after tallying 73 tackles and nine sacks as a junior... Also earned four varsity letters in baseball and two in basketball... Member of Community Service Learning. Personal: Born Oct. 24, 1989... Son of Joanne and Mathew Gross... Has one brother - Steven... Enjoys fishing, snowboarding and playing paintball... Lists Derek Jeter as his favorite athlete and the Dallas Cowboys as his favorite team. W W W. G O R H O D Y. C O M 19 THE RAMS 20 MATT HANSEN Providence, R.I. La Salle Academy LB Year 2007 2008 2009 Career G 11 12 10 33 UT 44 70 62 176 SR HANSEN'S CAREER STATS AT 29 41 41 111 Total 73 111 103 287 TFL-Yds 1.5-4 13.5-43 11.5-35 26.5-82 Sacks 0 3 4 7 6-1 Int 0 3 0 3 230 FF 0 4 1 5 FR 1 0 0 1 PD 1 6 2 9 2009: Surpassed 100 total tackles for the second-consecutive season as he finished second on the team with 103... Tied for the team lead in sacks with 4.0... Totaled 11.5 tackles for loss, which ranked second on the team... Posted 10 or more tackles in five games... Opened the year with seven tackles against Fordham (9/5)... Recorded 14 tackles, one tackle for loss and one sack at Massachusetts (9/19)... Tallied 13 tackles, 2.5 tackles for loss, one sack and forced one fumble at Connecticut (9/26)... Recorded nine tackles, 1.5 tackles for loss, one sack and one pass break up at Brown (10/3)... Finished with 12 tackles versus Hofstra (10/17)... Posted a career-high 16 tackles (10 solo), 1.5 tackles for loss and one pass breakup against William and Mary (10/31)... Closed out the season on a high note as he recorded 12 tackles, 2.5 tackles for loss and one sack versus Northeastern (11/21). 2008: Named Second Team All-CAA Football... Earned FCS All-New England honors... Led the team in tackles with 111 and finished second in CAA Football... Started off the season strong with 10 tackles, five of which were solo tackles, and an interception with a 20 yard return against Monmouth (8/30)... Had six solo tackles, two for loss of yards, and a sack against Fordham (9/7)... Led the Ram defense with five solo tackles and 11 total tackles against New Hampshire (9/13)... Recorded 12 tackles, two sacks and a blocked field goal against Hofstra (9/20)... Paced the defensive effort with a team-high 14 tackles (8 solo) and a forced fumble against Towson (10/11)... Recorded 11 tackles against Villanova (10/18)... Recorded 15 tackles, eight solo and three for a loss of yards, against Maine (11/15)... Finished the year with six solo tackles and an interception in URI’s win over Northeastern (11/22). 2007: Appeared in all 11 games... Finished second in tackles with 73 (44 solo) - including 1.5 tackles for loss - to go along with one fumble recovery and one pass breakup... Registered a career-high 10 tackles (seven solo) in overtime win over No. 3 UMass (11/3)... Posted 10 tackles (six solo) and one pass breakup in Governor’s Cup win at Brown (9/29)... Tallied nine tackles (eight solo) and a fumble recovery at Maine (11/10)... Recorded nine tackles (two solo) against James Madison (10/13)... Eight tackles (seven solo) against Hofstra (9/22)... Made seven tackles (five solo) at Delaware (9/15) and at Richmond (four solo) (10/20)... Earned a varsity letter. High School: Four-year member and three-year letterwinner for head coach Geoff Marcone... Garnered first team all-state honors as a senior captain after rushing 89 times for 1,350 yards and 17 touchdowns as a back and while tallying 83 tackles and four interceptions on defense... 2007 Gatorade Player of the Year... 2007 Gilbane Player of the Year... Carried seven times for 276 yards and five touchdowns against Cranston West as a senior... Helped La Salle Academy to a division championship in 2007 and the state championship game in 2005 and 2006... Also played four years of basketball (two letters) and one year of baseball. Personal: Born September 10, 1989... Son of Michael and Abina Hansen... Has three siblings - Chris (Florida State `06), Dan (Iona `06), and Dave, who will join the team this fall... Enjoys video games, spending time with friends, and playing cards... Cites Randy Moss, Lebron James, Ryan Gomes and Manny Ramirez as his favorite athletes... Communications Studies major at URI. 20 W W W. G O R H O D Y. C O M THE RAMS 6 JOE HARRIS 49 MILLER HINDS Lowell, Mass. Lowell High School Flanders, N.J. Mt. Olive LB SR 5-11 225 S HARRIS' CAREER STATS Year 2007 2008 2009 Career G 9 12 11 32 UT 7 36 37 80 AT 4 26 21 51 Total 11 62 58 131 TFL-Yds 2-25 8-10 6.5-22 16.5-57 Sacks 0 1 1 2 RS-FR 5-9 190 2009: Sat out redshirt season. Int 0 1 0 1 FF 0 1 3 4 FR 0 1 1 2 PD 0 1 0 1 2009: Appeared in all 11 games... Totaled 58 tackles, which tied for fourth on the team... Opened the year with five tackles and one tackle for loss versus Fordham (9/5)... Posted a career-high 12 tackles (six solo) and forced one fumble at Massachusetts (9/19)... Recorded eight tackles, two tackles for loss and had one fumble recovery at Connecticut (9/26)... Posted seven tackles versus Towson (10/10)... Made six tackles, two tackles for loss and had one sack at Maine (11/14). High School: Served as a three-year letter winner and saw action in 29 varsity games... Received the Marander Award following his senior year... Also competed in baseball and wrestling. Personal: Born January 23, 1991... Has four younger brothers... Lists his favorite athlete as Marvin Harrison and his favorite sports team as the New York Giants and Indianapolis Colts... Enjoys snowboarding and skateboarding... Plans on majoring in Business Administration. 2008: Finished with seven tackles and a sack against Monmouth (8/30)... Had eight solo tackles and forced a fumble against Fordham (9/7)... Recorded an interception for a one yard return and seven tackles against New Hampshire (9/13)... Had four tackles against Hofstra (9/20)... Registered five tackles (4 solo) against Boston College (9/27)... Put up four tackles against Brown (10/4)... Finished with nine total tackles and a fumble recovery against Towson (10/11)... Grabbed eight total tackles on the day against Maine (11/15). 2007: Appeared in nine games... Recorded 11 tackles (seven solo), including two for loss... season-high five solo tackles at Richmond (10/20)... Made two assisted tackles in an overtime win over No. 3 UMass (11/3)... Registered solo tackles against Brown (9/29) and Northeastern (11/17) and assisted tackles against Fordham (9/1) and New Hampshire (10/27)... Earned a varsity letter. 27 AYO ISIJOLA Brooklyn, N.Y. Sheepshead Bay High School: Four-year letterwinner in football and track & field for head coach Scott Boyle at Lowell... Earned two letters in basketball... Rushed for 1,106 yards, 21 touchdowns and 111 tackles as a senior, earning First Team All-Merrimack Valley Conference (MVC), all-state, Team and All-MVC MVP honors... 946 rushing yards, 16 touchdowns and 96 tackles as a junior, garnering Team MVP and First Team AllMVC honors... Rushed for 200+ yards and four touchdowns against Methuen in 2007... Helped Lowell football squad win MVC in 2007 and basketball in 2006 & 2007... 2007 First Team All-MVC in track and Second Team All-MVC in basketball... Member of Air Force Junior ROTC (Vice Commander of MA771). Personal: Born December 21, 1988... Son of Mary and Joseph Harris... has seven siblings - Rex Harris, Talzee, Lupu, Dewde, Bawu, Candy, and Money... Enjoys basketball, soccer, and track... Lists New York Giants, New York Yankees, and Boston Celtics as his favorite teams... Biology (Pre-Med) major at URI. RB Year 2009 Career G 10 10 Att 85 85 Yds 365 365 SO ISIJOLA’S CAREER STATS Avg 4.3 4.3 Td 1 1 Lg 48 48 YPG 36.5 36.5 Rec 9 9 5-10 Yds 30 30 Avg 3.3 3.3 190 Td 0 0 Lg 13 13 YPG 3.0 3.0 2009: Finished second on the team in rushing, finishing with 365 yards on the ground (4.3 yards per carry)... Made his collegiate debut against Fordham (9/5) and rushed for 28 yards on just two carries (14.0 yards per carry)... Totaled 68 yards rushing at Brown (10/3)... Posted career-high in yards rushing (100) and carries (15) against Towson (10/10)... Recorded his first career touchdown against the Tigers as he darted in from 48 yards out... Rushed for 66 yards at New Hampshire (11/7). High School: As a senior he played in eight games and carried the ball 67 times for 1,177 yards (17.5 yard per carry) to go along with nine touchdowns... Selected First Team All-City and All-Borough AllConference Teams... His 4x100 meter relay team was the 2008 Nike Outdoor National Champion... The relay team is currently ranked second in the nation. Personal: Born January 11, 1990...Has one brother and one sister... Lists his favorite athlete as LaDainian Tomlinson and his favorite sports team as the San Diego Chargers. W W W. G O R H O D Y. C O M 21 THE RAMS 3 BRANDON JOHNSON-FARRELL Odenton, Md. Arundel High School WR Year 2008 2009 Career G 12 4 16 SO 5-10 JOHNSON-FARRELL’S CAREER STATS Rec 57 6 63 Yds 456 87 543 Avg 8.0 14.5 8.6 Td 1 0 1 Lg 28 40 40 YPG 38.0 21.8 33.9 KR 42 4 46 Yds Avg 907 21.6 114 28.5 1021 22.2 185 Td 1 0 1 Lg 72 70 72 YPG 75.6 28.5 63.8 singleseason. 22 W W W. G O R H O D Y. C O M THE RAMS 10 TOM LANG 26 RYAN LAWRENCE Concord, Mass. Middlesex/Rutgers Bloomfield, N.J. Bloomfield High School TE Year 2009 Career G 9 9 Rec 3 3 SR LANG'S CAREER STATS Yds 47 47 Td 0 0 6-3 Lg 26 26 240 Avg 15.7 15.7 WR YPG 5.2 5.2 2009: Played in nine games seeing time on special teams and at tight end... Caught one pass for seven yards versus Fordham (9/5)... Hauled in one pass for 26 yards against William and Mary (10/31). 2006-08 (Rutgers): Did not play in 2008... Moved to tight end from quarterback, following spring practice... Did not see any game action due to injury in preseason camp... Redshirted in 2006 his first season while preparing the team during game week as a member of the scout team. High School: PrepStar All-East selection from Middlesex School... Directed Middlesex to 23-5 record and two New England Bowl appearances... Named to the Boston Globe All-State team, while also earning All-New England and All-League Honors... Selected to play in the Massachusetts Shriners All-Star Game... Rated the No. 20 prospect in New England by Rivals.com. Personal: Born Nov. 11, 1987... Son of Jane and Joe Lang.... Has one brother - Joe... Father Joe played football at UMass (1967-70) and brother Joe played tennis at UCoon 1999-2003... Communications major at URI. Year 2008 2009 Career G 10 11 21 Att 20 43 63 JR 5-9 LAWRENCE'S CAREER STATS Yds 59 155 214 Avg 3.0 3.6 3.4 Td 0 0 0 Lg 19 20 20 YPG 5.9 14.1 10.2 Rec 7 18 25 Yds 30 164 194 Avg 4.3 9.1 7.8 200 Td 0 1 1 Lg 16 55 55 YPG 3.0 14.9 9.2 2009: Totaled 29 yards on 10 carries against Fordham (9/5)... Caught a career-high six passes for 119 yards and scored his first career touchdown from 55 yards out at Brown (10/3)... Had five kickoff returns for 86 yards at New Hampshire (11/7)... Totaled 92 kickoff return yards at Maine (11/14)... Closed out the year on a high note as he rushed for a career-high 67 yards on seven carries versus Northeastern (11/21). 2008: Rushed for 27 yards on four carries against Monmouth (8/30)... Carried the ball four times for 15 yards against Boston College (9/27)... Picked up 20 yards on four carries in the Governor’s Cup victory over Brown (10/4)... Tallied 18 yards on two receptions against UMass (11/1)... Caught a 10 yard pass against Northeastern (11/22). High School: Played football for head coach Mike Carter at Bloomfield ... 2007 Northern New Jersey Interscholastic League (NNJIL) Division B First Team selection... Rushed for 1,200 yards and hauled in 20 passes... First Team all-county, coaches all-county, and Group IV All-State selection as a senior ... Second team all-league as a junior, when he rushed for nearly 500 yards ... Rushed for 650 yards and nine touchdowns as a sophomore, earning first team all-conference honors. Personal: Born Oct. 23, 1989... Son of Kent and Dellareese Lawrence... Two brothers (Ahmad and Rakim) and four sisters (Kendra, Laveada, Denea and Zee)... Produces and enginneers music in his spare time... Lists his favorite athlete as Eddie George and his favortie team as the Tennessee Titans... Works out in the offseason with Phil and Matt Simms... Communications major at URI. 61 BRIAN LOUTH East Windsor, N.J. Hightstown High School OL RS-FR 6-0 255 2009: Sat out redshirt season... Saw time on the scout team. W W W. G O R H O D Y. C O M 23 THE RAMS 16 MARC LUCARINI 41 CHRIS MANCUSO Laurel Springs, N.J. Camden Catholic High School Atlantic City, N.J. Holy Spirit High School QB SO 6-2 205 LB 2009: Did not play. 2008: Did not play. High School: Four-year letterwinner for head coach Rick Brown at Camden Catholic… Second Team All-South Jersey and recipient of Jeffrey P. Loftus Memorial MVP Award as a senior captain, when he threw for 1,460 yards and 22 touchdowns and rushed for 560 yards and seven touchdowns as Camden Catholic finished 7-2 and earned a berth in the playoffs… 2007 Thanksgiving Day MVP in win over Paul VI, passing for three touchdowns and catching one... Threw for 196 yards and three touchdowns against Bordentown (11/3/07) … Tossed for 128 yards and two touchdowns against Camden (9/22/07)… Third Team All-South Jersey as a junior after passing for 1,400 yards and 15 touchdowns… Ranked as No. 2 QB and No. 32 overall by The McCarthy Report (N.J.). Personal: Born May 22, 1989... Son of Ernest and Arlene Lucarini... Has a brother Ernie and a sister Valerie... Enjoys skiing... Lists Brett Favre as his favorite athlete and the Green Bay Packers as his favorite team. Year 2008 2009 Career G 8 9 17 UT 3 6 9 JR MANCUSO’S CAREER STATS AT 2 6 8 Total 5 12 17 TFL-Yds 1.0--2 0.5-0 1.5-2 Sacks 0 0 0 220 2009: Sat out redshirt season. High School: Selected All-League three times... Named Honorable Mention All-Section twice... Selected AllState following his senior year... Helped guide his team to the State Finals as a senior... Rushed for 961 yards and recorded 126 tackles as a senior. Personal: Born February 8, 1991… Son of Robert and Suzanne Luntz… Has two siblings - David and Sarah… His sister Sarah is a student at Florida State University… Hobbies include golf and fishing… Donated food for the homeless while he was involved with the Midnight Run organization in New York City... Lists his favorite athlete as Brandon Jacobs and his favorite team as the New York Giants. 24 FR 0 0 0 PD 1 0 1 High School: Four-year starter and three-year defensive captain for head coach Bill Walsh... 2007 Associated Press New Jersey All-State Football Second Team selection after recording 87 tackles as a senior to help Holy Spirit capture Parochial III State Championship at Rutgers Stadium... All-time leader in both single-season and career tackles at Holy Spirit... Three-time First Team All-Press, First Team CapeAtlantic League Conference, and First Team South Jersey... Brooks-Irvine Club Scholar Athlete Award. Croton, N.Y. Croton-Harmon High School 6-3 FF 1 0 1 2008: Played in eight games as a freshman... Collected his first career interception against Brown (10/3)... Finished the season with five tackles. 90 DAN LUNTZ RS-FR Int 1 0 1 220 2009: Saw action in nine games... Recorded one tackle and 0.5 tackle for loss at Massachusetts (9/19)... Recorded a career-high six tackles at Maine (11/14). Personal: Son of Timothy and Margret Mancuso... Has one brother - Mac. DE 5-10 W W W. G O R H O D Y. C O M THE RAMS 56 WILLIE McGINNIS Norwich, N.Y. Bainbridge-Guilford High School DT JR 6-3 300 McGINNIS’ CAREER STATS Year 2007 2008 2009 Career G UT AT Total 12 11 23 13 20 33 19 21 40 32 41 73 TFL-Yds Did not play 3.5-5 6.5-16 10-21 Sacks Int FF FR PD 1 1 2 0 0 0 0 1 1 1 1 2 1 0 1 2009: Finished the year with 41 tackles and. 6.5 tackles for loss... Recovered one fumble in the Rams’ season-opening victory over Fordham (9/5)... Had five tackles at Massachusetts (9/19)... Recorded three tackles, one tackle for loss, one sack and forced one fumble at Connecticut (9/26)... Tallied five tackles and one tackle for loss at Brown... Posted six tackles and two tackles for loss versus Towson (10/10)... Notched six tackles at Villanova (10/24)... Closed out the season with with five tackles and 0.5 tackles for loss at home against Northeastern. 2008: Picked up two tackles, one for a loss of yards against Monmouth (8/30)… Put up four tackles against Fordam (9/7)… Recorded six tackles and assisted with a sack against Hofstra (9/20)… Put up four tackles against Brown (10/4)… Grabbed four tackles, one for a loss of yards against William and Mary (10/25)… Registered four tackles against UMass (11/1)… Registered two solo tackles against Maine (11/15). 2007: Did not play... Received Most Improved Defensive Player Award following 2008 Spring Game. High School: Four-year letterwinner for head coach Tim Mattingly at Bainbridge-Guilford High School… First team All-County, All-metro, All-State, and Daily Star First Team selection as a senior, when he rushed for 860 yards and 12 touchdowns as a fullback while tallying 76 tackles on defense… First team all-country and Daily Star First Team as a sophomore and junior… Outstanding Defensive Player as a senior… Outstanding Offensive Guard as a sophomore… Also played basketball (four years, three varsity letters), baseball (three years, one varsity letter), volleyball (two years), and track & field (one varsity letter)… Member of S.A.D.D. and National Honor Society. Personal: Born January 3, 1989… Son of Christine Jeffrey… Has one sibling – Christopher McGinnis, who attends St. John Fisher College… Enjoys writing poetry… Lists Willie McGinest and Lawrence Taylor as his favorite athletes and the New England Patriots as his favorite team… African American studies major and communications major and political science minor at URI. W W W. G O R H O D Y. C O M 25 THE RAMS 80 JOE MIGLIARESE 84 ZACK MOORE Blue Bell, Pa. La Salle College Wyckoff, N.J. Ramapo High School TE JR 6-4 240 WR MIGLIARESE'S CAREER STATS Year 2009 Career G 6 6 Rec 1 1 Yds 6 6 Td 1 1 Lg 6 6 Avg 6.0 6.0 YPG 1.0 1.0 2009: Played in six games... Hauled in his first career touchdown and his first career reception versus Towson (10/10). 2008: Did not play. High School: Played football for head coach Brett Gordon at La Salle College H.S., earning two varsity letters… Finished his career with 91 receptions for 1,063 yards and 17 touchdowns… Appeared in six games as a senior before suffering season-ending injury… Team captain in 2007, when he was an AllCatholic Honorable Mention… Hauled in 60 catches for 699 yards as a junior, earning Second Team AllCatholic honors… All-area selection as a junior and senior... Helped La Salle to a Philadelphia Catholic League Championship in 2006… Hauled in game-winning touchdown in overtime against Cardinal O’Hara in those playoffs, and later caught the game-winning touchdown in the championship game against St. Joseph’s Prep… All-area as a junior and senior… Recipient of 2006 Tex Flannery Award, which is given to the Outstanding Junior Class player… Four-year letterwinner and three-year starter on La Salle basketball team… Kairos Retreat Leader. SO 5-10 185 2009: Did not play. 2008: Sat out redshirt season. High School: Recorded 48 catches, 1,089 all-purpose yards and seven touchdowns as a senior at Ramapo for Coach Gibbs... First Team All-Northern Bergen Interscholastic League and All-Bergen County Honorable Mention following senior season... Named MVP of the 2008 Bergen County All Star Classic... Also selected to WGHT Radio All-Area Team and The Ridgewood News All-Suburban Team... Earned all-league honors in baseball, helping Ramapo to the Final Four in both county and state sectional tournaments. Personal: Born June 17, 1990... Son of Tim and Kate Moore... Has one sister - Mackenzie. Personal: Born Feb. 27, 1989... Son of Joseph and Vera Migliarese... Has a brother Vinny and a sister Michelle... Enjoys playing basketball, going to the driving range and playing video games... Lists his favorite athletes as Jerry Rice and Randy Moss... Kinesiology major at URI. 67 IAN MONZO 46 ALI MUHAMMAD Oxford Hills, Maine Oxford Hills High School Kingston, Pa. Wyoming Valley West OL 2009: Did not play. SO 6-3 255 LB RS-FR 6-3 225 2009: Sat out redshirt season. High School: Played just two seasons, but started both years... Served as a two-way starter... As a senior he had 51 receptions for over 900 yards... On defense he set the single-season record for sacks with 18.5. As a senior he set the school record for sacks in a single season with 18.5... Awarded the team leadership award as a junior and senior... Selected to the All-Wyoming Valley Conference as a junior and senior... Was selected to the East-West Pennsylvania in Altoona, Pa... Chosen as an alternate for the Big 33 game... Named to the Wyoming Valley Conference Coaches’ All-Star team... Named Most Valuable Player of the East West Unico All-Star game. Personal: Born April 27, 1991... Has two sisters Tiara and Lakia... Enjoys video games and all sports... His favorite sports teams include the Miami Heat and St. Louis Rams. 26 W W W. G O R H O D Y. C O M THE RAMS 25 DAN O’CONNELL 38 MICHAEL OKUNFOLAMI Barrington, R.I. Milford Academy Providence, R.I. Canterbury Prep LB SR 6-1 RB 220 O’CONNELL’S CAREER STATS Year 2007 2008 2009 Career G 9 12 10 31 UT 6 25 24 55 AT 4 13 15 32 Total 10 38 39 87 TFL-Yds 0-0 2.0-7 1.5-3 3.5-10 Sacks 0 0 0 0 SR 5-10 195 2009: Saw action in five games, playing primarily on special teams. Int 0 0 0 0 FF 0 1 0 1 FR 0 3 1 4 PD 1 1 2 4 2008: Did not play. 2007: Did not play football... Joined team in January, 2008 for spring practice. 2009: Finished the year with 39 tackles after he saw action in 10 games... Started the final two games of the year... Opened the year with two tackles against Fordham (9/5)... Had three tackles at Massachusetts (9/19)... Recovered one fumble at Villanova (10/24)... Tied a career-high with 10 tackles versus William and Mary (10/31)... Notched nine tackles and had 1.5 tackles for loss at Maine (11/14)... Closed out the year with six tackles against Northeastern (11/21). 2006: Attended Canterbury Prep, where he rushed for 1,266 yards and 13 touchdowns... Rushed for 287 yards and four touchdowns against St. Thomas More (10/14)... Piled up 192 yards and two touchdowns against Gunnery (11/11) ... Rushed for two touchdowns against Tabor Academy (11/4)... Carried 12 times for 199 yards and one touchdown against Westminster (10/28)... Earned Boston Globe NEPSAC Class B All-Scholastic honors. 2008: Had a fumble recovery for 17 yards against Fordham (9/7)... Registered four solo tackles against Boston College (9/27)... Grabbed six tackles and forced and recovered a fumble against Brown (10/4)... Recorded five tackles against Towson (10/11)... Registered eight tackles against Villanova (10/18)... Had three solo tackles and a fumble recovery against William and Mary (10/25)... In the final game of the season, grabbed four tackles and a broken-up pass against Northeastern (11/22). High School: Played football at La Salle Academy... 2005 Division 1 Back of the Year... Participated in 2006 Governor’s Cup All-Star Game... Rushed for 1,304 yards and 17 touchdowns, earning first team all-state honors and helping La Salle advance to Division 1 Super Bowl... Carried 28 times for 122 yards and a touchdown in Championship Division Playoff Semifinal win vs. Portsmouth (11/29/05)... Scored three touchdowns against South Kingston (11/18/05)... Broke off a 20-yard touchdown run against East Providence (11/25/05). 2007: Appeared in nine games... Made 10 tackles (six solo) and recorded one pass breakup... Two solo tackles against Hofstra (9/22). 2006: Played football at Milford Academy under head coach Bill Chaplick. Personal: Born October 15, 1988... Son of Lola and Mick Okunfolami... Has four brothers (Chris, Tomi, Charles and Samuel) and one sister Josephine... Brother Tomi plays cornerback at Bryant Universtiy... Lists Chad Ochocinco as his favorite athlete... Finance major at URI. High School: Four-year member and three-year letterwinner at Barrington under coach Bill Mcagney... Started all 11 games at RB and SS as a senior captain in 2005, rushing for 1,400+ yards while recording 73 tackles and eight interceptions, helping Barrington capture Division 1 State Championship... Started 11 games at SS and eight at RB as a junior in 2004, earning first team all-league honors at running back after rushing for over 1,500 yards to help Barrington win Division I-A State Championship; also recorded 60 tackles and four interceptions... Started 11 games as a sophomore in 2003, making 40 tackles and one interception on defense while recording 330 yards and two touchdowns on offense as Barrington won the Division II State Championship... Two-time Offensive Player of the Year (2004-05)... Also earned two varsity letters in wrestling and both indoor and outdoor track; played two years of baseball (2002-04). Personal: Born October 8, 1987... Son of Tim and Katrina O’Connell... Has three siblings - Patrick, Sean, and Riley... Grandfather, Tom O’Connell, played for the Buffalo Bills, Chicago Bears, and Cleveland Browns during the 1950’s... Uncle, Michael O’Connell, was a member of the Boston Bruins (1970’s) while his father, Tim O’Connell, played for the Buffalo Sabres in 1975... Kinesiology major at URI. W W W. G O R H O D Y. C O M 27 THE RAMS 1 CHRIS PAUL-ETIENNE Miami, Fla. Edison High School/Rutgers QB SR 6-3 190 PAUL-ETIENNE’S CAREER STATS Year 2009 Career G 10 10 Cmp-Att-Int 143-268-7 143-268-7 Pct. 53.4 53.4 Yds. 1,745 1,745 Td 14 14 Lg 72 72 Avg/G 174.5 174.5 Rushes Yds 90 14 90 14 Avg. 0.2 0.2 Td Lg 3 29 3 29 2009: Passed for 1,745 yards and 14 touchdowns in his first significant action since high school... Came on strong in the final four games of the season as he averaged 236.7 passing yards per game, threw 10 touchdowns and had just three interceptions... Accounted for three touchdowns (two passing and one rushing) and 245 yards of total offense (164 passing and 81 rushing) in the Rams’ season-opening victory against Fordham (9/5)... Passed for 198 yards at Massachusetts (9/19)... Connected with wide receiver Ty Bynum on a 66-yard touchdown pass at Connecticut (9/26)... Suffered a knee injury at Brown (10/3), which caused him to miss most of the game against the Bears and the entire game against Towson (10/10)... Threw for 207 yards against Hofstra (10/17)... Passed for 195 yards and tossed a pair of touchdowns against William and Mary (10/31)... Had a career day against New Hampshire (11/7) as he threw for 424 yards and accounted for five touchdowns (four passing and one rushing)... Closed out the year with 191 yards passing and three touchdowns versus Northeastern (11/21). 2006-08 (Rutgers): In 2008, he did not play... In 2007, he served as the No. 3 quarterback ... made collegiate debut against Norfolk St. (9/15) and saw action at Army (11/9) and at Louisville (11/29)... In 2006, he redshirted. High School: Threw for 1,559 yards and 16 touchdowns as a senior at Miami’s Edison High School... PrepStar All-Southeast selection... Rated eighth-best senior in Miami-Dade County by the Miami Herald... Ranked among Florida’s top 10 quarterbacks by the Orlando Sentinel Edison... Two-time AllDade County selection by the Miami Herald... Earned Most Valuable Player honors of the prestigious North-South Florida All-Star Game. Personal: Born March 26, 1988... Son of Coeurana Polycarpe and Christopher Paul-Etienne... Has one brother (Hugg) and four sisters (Aisha, Dudly, Dane and Lande)... Sociology major at URI... Cousin Sabdath Joseph played linebacker at USF. 28 W W W. G O R H O D Y. C O M THE RAMS 97 MATT RAE 94 MATT SHEARD York, Pa. Dallastown Area High School Mt. Laurel, N.J. Camden Catholic High School DT Year 2008 2009 Career G 10 11 21 UT 15 11 26 JR RAE’S CAREER STATS AT 13 15 28 Total 28 26 54 TFL-Yds 4.5-20 2.5-8 7.0-28 Sacks 3 1 4 6-4 Int 0 0 0 290 FF 1 0 1 FR 0 2 2 DT PD 0 0 0 2009: Earned CoSida/ESPN the Magazine All-Academic honors... Was a mainstay for the Rams at defensive tackle as he logged 10 starts... Finished the year with 26 tackles, 2.5 tackles for loss and two fumble recoveries... Recovered two fumbles and and recorded 1.5 tackles for loss against Fordham... Totaled four tackles against Massachusetts (9/19)... Recorded a season-high six tackles at Villanova (10/31)... Had three tackles, one tackle for loss and one sack at Maine (11/14). 2008: Started seven games and saw action in 10... Had a solo tackle against Monmouth (8/30)... Had four total tackles against Fordham (9/7)... Recorded five tackles and one and a half sacks against Hofstra (9/20)... Registered a perfect 4.0 GPA in the classroom last semester. High School: Four-year member and three-year letterwinner in both football and volleyball at Dallastown Area... Recorded 107 tackles, 12 QB hurries, five pass breakups, and three sacks as a senior captain, earning All-YAIAA All-Conference honors at both DB and FB and YAIAA Division I Defensive Player of the Year honors. Year 2009 Career G 7 7 UT 2 2 JR SHEARD’S CAREER STATS AT 2 2 Total 4 4 TFL-Yds 0.5-1 0.5-1 Sacks 0 0 6-2 Int 0 0 255 FF 0 0 FR 0 0 PD 0 0 2009: Saw action in seven games... Made his first appearance against Brown (10/3) where he registered one tackle... Recorded a pair of tackles and had 0.5 tackles for loss at Maine (11/14). 2008: Did not play. High School: Two-year letterwinner... Recorded 140 tackles and 10 sacks in during his two-year career... Selected First Team All-Conference as a senior. Personal: Born Dec. 27, 1988... Son of Beth and William Sheard... Has two brothers - Alex and Zach... Enjoys traveling... List Brian Dawkins as his favorite athlete and the Philadelphia Eagles as his favorite team... Medcine major at URI. Personal: Born Dec. 3, 1989... Son of Robert and Connie Rae... Has two brothers - Josh and Mitch... Enjoys playing volleyball, skiing and hunting... Lists the Pittsburgh Steelers as his favorite team... Chemistry major at URI. W W W. G O R H O D Y. C O M 29 THE RAMS 4 EVAN SHIELDS 58 KENNY SMITH Adelphi, Md. Gonzaga College Prep Jersey City, N.J. St. Peter’s Prep CB JR 5-10 190 LB G UT AT Total 4 4 8 0 7 7 0 5 5 0 12 12 TFL-Yds Did not play 0.0-0 0.5-1 0.5-1 5-10 235 SMITH’S CAREER STATS SHIELD’S CAREER STATS Year 2007 2008 2009 Career SO Sacks Int FF FR PD 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2009: Saw limited action after he suffered a season-ending injury against Towson (10/10)... Recorded a season-high seven tackles against Fordham (9/5)... Posted four tackles at Connecticut (9/26). 2008: Saw action against Villanova (10/18), Massachusetts (11/1), Maine (11/15) and Northeastern (11/22). Year 2009 Career G 2 2 UT 1 1 AT 0 0 Total 1 1 TFL-Yds 0.0 0.0 Sacks 0 0 Int 0 0 FF 0 0 FR 0 0 PD 0 0 2009: Played in two games on defense, while contributing on special teams... Started in the Rams’ season-finale against Northeastern (11/21). Prep School: Two-year starter Selected All-State as a senior... Named All-County during junior and seniors seasons... Registered 14.5 sacks as a senior... Second on the team in tackles... Nominated for the New Jersey North vs. South Game... Coached by former Green Bay Packers running back Ryan Grant. Personal: Born Jan.15, 1990... Son of Kenneath Dobson and Yolanda Smith... Favorite athlete is Troy Polamalu... Favorite pro teams are the New York Giants and New York Yankees... Enjoys traveling. 2007: Did not play. High School: Four-year member and two-year letterwinner under coach Kenny Lucas at Gonzaga College High School, helping them to WCAC Playoffs in 2005… Received four varsity letters in track (captain 2005-07), where is a member of 4x800 relay team which holds school record… Member of Black Student Union. Personal: Born February 12, 1989… Son of Bertie and Beverly Shields… Has four siblings – Arman (Richmond ’07), Ian (Maryland ‘07), Allen, and Alana … Arman earned Second Team Atlantic 10 honors in 2006 as a member of Richmond football team and was selected by the Oakland Raiders in the 2008 NFL Draft… Enjoys fishing, swimming, dancing, and listening to music… Cites Jerry Rice as his favorite athlete and the Washington Redskins as his favorite team… Undecided major at URI who was named to the Dean’s List in 2008. 36 BRANDFORD SOWAH Providence, R.I. Bishop Hendricken WR JR 5-7 175 2009: Joined the team in the fall, but did not play. High School: Earned All-State honors during his junior and senior seasons... Three-time All-City and All-Division selection... Voted Most Outstanding Senior Athlete... Also played on the varsity basketball and track teams. 30 W W W. G O R H O D Y. C O M THE RAMS 87 KYLE STEADMAN 88 TREVOR TURNER North Easton, Mass. Oliver Ames High School Hanover, Md. Meade Senior High School WR SO 6-2 180 WR Personal: Born December 7, 1990... Son of Bruce and Marquita Steadman...Has two siblings - brother Corey and Sister Candace... Lists his favorite athlete as Steve Smith... Favorite team is the Carolina Panthers and Denver Nuggets. 6-1 180 TURNER'S CAREER STATS 2009: Made his lone appearance of the 2009 season against nationally-ranked William and Mary. High School: Two year letterwinner both basketball and football...Was named MVP of the Turkey Bowl in 2008... Holds school records for the Triple Jump, Long Jump, 4x100 and the Decathalon. SO Year 2009 Career G 4 4 Rec 1 1 Yds 1 1 Td 0 0 Lg 1 1 Avg 1.0 1.0 YPG 0.2 0.2 2009: Saw action in four games... Recorded his first career reception at Connecticut (9/26). High School: Helped Meade High School to its most wins since the 2001 season... Started on both sides of ball as a senior... In 2008, he caught 40 passes for 885 yards and 11 touchdowns... As a team the squad averaged 29 points per game... On defense, he totaled three interceptions... Selected to the Baltimore Sun All-Metro Team as a senior... Played in the Baltimore Touchdown Club All-Star game following his senior season... Helped the squad to its most wins since the 2001 season. Personal: Born April 4, 1991... Son of Barry and Joan Turner... Has one sibling - Ian Turner... Lists his favorite team as the USC Trojans. 66 GEORGE TSAKIRGIS Lynnfield, Mass. The Governor’s Academy LB RS-FR 5-9 230 2009: Did not play. High School: Four-year letterwinner in Football, Track and Wrestling... Was awarded First Team AllLeague honors as running back and linebacker... Named Player to Watch by the Boston Herald. Personal: Born November 7, 1989... Son of John and Julie Tsakirgis... Has two sisters - Christina and Diana... Cousin Fred Smerlas played college football at Boston College and played in the NFL for the Buffalo Bills, 49ers, and New England Patriots... Favorite athletes are Ray Lewis and Maurice JonesDrew. W W W. G O R H O D Y. C O M 31 THE RAMS 31 MATT URBAN 63 DAVE VALLEY Warren, R.I. Mt. Hope High School East Providence, R.I. East Providence High School S Year 2006 2007 2008 2009 Career G 2 6 12 5 25 UT 0 11 26 6 43 SR URBAN’S CAREER STATS AT 0 6 16 3 25 Total 0 17 42 9 68 TFL-Yds 0.0-0 0.0-0 2.0-9 1.0-7 3.0-16 Sacks 0.0 0.0 1.0 1.0 2.0 6-2 Int 0 1 1 1 3 205 FF 0 0 0 0 0 FR 0 0 0 0 0 OG PD 0 2 3 1 6 2009: Played in the first five games of the season, but was sidelined for the rest of the year after he suffered an injury against Towson (10/10)... Finished the year with nine tackles... Had three tackles and one interception at Brown (10/3). 2008: Assisted with three tackles against Monmouth (8/30)... Recorded an interception and three tackles against Fordham (9/7)... Recorded four solo tackles and eight total tackles against New Hampshire (9/13)... Picked up seven tackles and assisted with a sack against Hofstra (9/20)... Had two solo tackles and broke up a pass against William and Mary (10/25). 2007: Appeared in six games... Recorded 17 tackles (11 solo)... Season-high five tackles (three solo) and an interception against both Hofstra (9/22) and James Madison (10/13)... Four tackles (two solo) at Delaware (9/15)... Two solo tackles in season-finale against Northeastern (11/10). 2006: Played in two games - UConn (8/31) and Massachusetts (10/21)... Received a redshirt. 6-3 295 2009: Started in 10 games at guard... Anchored an offensive line which did not allow a sack in three games... Helped the offensive unit surpass 400 yards in total offense three times throughout the year, including a season-high 535 yards of total offense at New Hampshire (11/7). 2008: Played and started in 10 games this past season... Protected former quarterback Derek Cassidy and allowed him to pass for 2,759 yards, which ranks as the third highest in school history... Helped pave the way for a season-high 211 rushing yards against Northeastern. 2007: Played in 10 games ... recorded nine tackles (two solo) ... registered three tackles (one solo), 1.5 tackles for loss, and 0.5 sacks against Fordham (9/1) ... two tackles (one solo) at Richmond (10/20) ... Recorded an assisted tackle and recovered a fumble against both New Hampshire (10/27) and Maine (11/10). 2006: Did not play. High School: Member of football and baseball teams at East Providence ... 2006 Second Team All-state Selection... Helped East Providence and head coach John Gorham capture the 2003 State Championship... First Team All-State and Most Outstanding Player (baseball) in 2005. Personal: Born June 10, 1988... Son of Scott and Robin Valley... Has one sibling - Andrew... Cites Miami Dolphins and New York Yankees as favorite teams... Kinesiology major at URI. High School: Four-year member and three-year letterwinner under coach T.J. Delsanto at Mount Hope, serving as captain as a senior... Four-year all-division selection (2003-06)... Two-time All-State Personal: Born December 30, 1987... Son of Anthony and Nancy Urban... Has three siblings - Anthony, Christian, and Jared... Lists Michael Jordan as his favorite athlete... Kinesiology major at URI. 32 SR W W W. G O R H O D Y. C O M THE RAMS 50 SHOMARI WATTS 24 JARROD WILLIAMS Philadelphia, Pa. Haverford High School Glen Mills Pa. West Chester East High School LB RS-FR 6-1 215 2009: Sat out redshirt season. High School: Served as a four-year starter for the Fords, switching to Linebacker as a senior ... Voted defensive Most Valuable Player as a senior by his teammates... Earned Second Team All-City and First Team All-Delaware County... Selected to the First Team All-Inter-Academic League as a junior and senior... Led the team in tackles as a senior. Personal: Born June 21, 1991...Has one sibling...Interest are music and friends...Favorite athlete Brian Dawkins...Favorite sport teams Philadelphia Eagles and the Philadelphia Phillies. CB Year 2007 2008 2009 Career G 9 11 11 31 UT 1 15 46 62 JR WILLIAMS’ CAREER STATS AT 1 6 19 26 Total 2 21 65 86 TFL-Yds 0-0 1-2 0-0 1-2 Sacks-Yds 0-0 0-0 0-0 0-0 6-1 INT 0 1 4 5 200 FF 0 0 1 1 FR 0 0 1 1 PD 0 2 2 4 2009: Led the team with four interceptions and was third on the team in tackles... Recorded seven tackles and had a 68-yard fumble return for a touchdown at Massachusetts (9/19)... Recorded a seasonhigh 11 tackles at Connecticut (9/26)... Tallied seven tackles and had one interception at Brown (10/3)... Picked off a pair of passes against Towson (10/10)... Notched seven tackles against Hofstra (10/17)... In the season finale against Northeastern (11/21), he recorded eight tackles, forced one fumble and had one interception. 2008: Enters the fall season after he was selected as the Most Improved Defensive Player of Spring Practice... Collected three tackles against Boston College (9/27)... Had a big game against Brown (10/4) with six tackles (five solo), two broken up passes, and an interception... Grabbed four tackles against Towson (10/11)... Recorded two solo tackles against UMass (11/1). 2007: Appeared in nine games... Returned 14 kicks for 259 yards... Rushed for 40 yards on three carries and caught one pass for six yards... Returned eight kicks for 184 yards and rushed for 18 yards at Delaware (9/15)... Two carries for 22 yards at Richmond (10/20)... Returned two kicks for 25 yards against James Madison (10/13)... One kick return for 23 yards at New Hampshire (10/27)... Earned a varsity letter. High School: Four-year member and three-year varsity letterwinner at West Chester East... First Team All-Chestmont League selection as a junior and senior... Rushed for 881 yards (10.5 ypg) and 11 touchdowns as a senior... Scored two touchdowns in 28-7 win in Chestmont League Championship in 2006... Earned four varsity letters in track & field... Member of the Black Student Union. Personal: Born December 31, 1988... Son of Al and Ellen Williams... Has one sibling - Aubree... Enjoys basketball, PS3, and football... Lists Michael Jordan, Michael Johnson, and Jerome Bettis as his favorite athletes and lists Pittsburgh Steelers, Philadelphia Phillies, and Philadelphia 76ers as his favorite teams... Communications major at URI. W W W. G O R H O D Y. C O M 33 THE RAMS 47 MANEE WILLIAMS 42 DAVID ZOCCO New Rochelle, N.Y. New Rochelle High School Nashua, N.H. Nashua South LB SO 6-1 220 S WILLLIAMS’ CAREER STATS Year 2009 Career G 3 3 UT 0 0 AT 1 1 Total 1 1 TFL-Yds 0.0-0 0.0-0 Sacks 0.0 0.0 FF 0 0 FR 0 0 PD 0 0 High School: Two-year varsity starter at wide receiver, safety and running back... Two-year letterwinner... As a junior he was the Most Valuable Defensive Player in the Section I-AA Championship game... The following year Williams was the Most Valuable Offensive Player of the Section 1-AA Championship game... Earned Offensive Player of the Game in the New York State semifinals... Served as a senior captain... Earned Section I-AA South All-League honors as a senior and Voted to the All-Section team... Selected to the Journal News All-County team... Selected to the All-New York State honors as a defensive back during his senior season. Personal: Born January 21, 1991...Has a younger brother Ethan... Lists his favorite sport teams Denver Broncos, Boston Celtics and New York Yankees. 29 COLTON WOODALL Davie, Fla. North Broward Prep 6-3 185 2009: Sat out redshirt season. Prep School: Served as the squad’s senior captain... Selected Defensive Most Valuable Player following his senior season... Named All-County First Team Defense as a senior... Helped guide his team to an undefeated regular season. Personal: Born January 10, 1991... Son of Jeff and Donna Woodall... The oldest of three siblings... Brothers Brandon and Austin... Sister Madsion... Interested in fishing and hunting. 34 220 High School: Three-year starter and four-year varsity player... Four-year letter winner... Captain as a senior... Led the Purple Panthers to the 2008 New Hampshire Division I State Championship... Threetime All-State honoree... Earned New Hampshire’s Gatorade Player of the Year... Nashua Telegraph Player of the Year... Selected as Mr. Football New Hampshire... Union Leader Player of the Year... Scored five touchdowns as a running back in the state championship title game... Rushed for over 1,600 yards and 30 touchdowns as a senior... Recorded 136 tackles and five interceptions as free safety during senior campaign... As a junior led the team to the State championship title game... Rushed for 1,300 yards as a junior and scored 20 touchdowns... Received all-state and all-conference honors as a sophomore, junior and senior. Personal: Born May 12, 1991... Son of Mary Williams... Lists Randy Moss as his favorite athlete. RS-FR 6-1 2009: Sat out redshirt season. Int 0 0 2009: Saw his first career action against William and Mary (10/31)... Made one tackle against New Hampshire (11/7). S RS-FR W W W. G O R H O D Y. C O M 2010 NEWCOMERS 81 RAMADAN ABDULLAH 19 NICK BECKER Philadelphia, Pa. Germantown High School Coral Springs, Fla. Pine Crest High School WR FR 6-0 170 QB. FR 86 MATT BROWN Warwick, R.I. Cushing Academy North Kingston, R.I. Bishop Hendricken FR 6-0 WR 170 Cushing Academy: Spent the 2009 season at Cushing Academy following two seasons at Bishop Hendricken where he primarily handled kickoffs... In 2009, he finished second on the team in scoring with 30 points, which ranked fourth in the New England Prep School Association... Connected on 23-of-27 extra points... Hit a seasonbest 30-yard field goal against Assumption College. 195 High School: Three-year starter and earned three varsity letters... Served as team captain during his senior season and was named offensive team captain as a junior... Named First Team All-Broward County and was selected Honorable Mention All-State... Passed for over 1,700 yards and tossed 17 touchhowns as a senior... As a sophomore, he passed for over 1,800 yards and 18 touchdowns... Went 13-for-14 for 200 yards and five touchdowns against rival Pompano Beach High School during his senior season... Participated in the U.S. Army All-America Football combine. 85 DREW ANDERSON K 6-1 SO 5-10 175 2009 American International College: Appeared in nine of 10 games as a freshman at wide receiver … named to the Northeast-10 all-rookie team … recorded 27 catches for 418 yards … caught four passes for a season-high 92 yards in a win at Merrimack (9/5) … had five catches for 76 yards against Southern Connecticut (9/19) … pulled in five passes for 78 yards in a win over Saint Anselm (10/3). High School: 2009 graduate of Bishop Hendricken High School... Coached by Keith Craft as a member of the football team... Served as team captain... Named team MVP... Was a first-team all-division and first-team allstate selection... Recipient of the Jerry Rice Wide Receiver of the Year Award as the top wide receiver in the state... led his team to a league title and two Super Bowl appearances. 33 ANTHONY BASKERVILLE 37 RODNEY CHANCE Franklin, Mass. Dean College Mansfield, Mass. Mansfield High School DB JR 5-11 185 DB Dean College: Played quarterback in 2009 and helped his squad to a 4-1 mark in league play and a 9-1 overall record... Ranked third in the Northeast Fooftball Conference in passing yards per game with 115.5... Earned Second Team All-Northeast honors. FR 5-10 160 High School: Earned three varsity letters in football... Received Sun Chronicle Honorable Mention honors... Started two seasons at cornerback and also saw action at wide receiver... Led the team in interceptions during his senior season and ranks fourth in school history in interceptions with six... Started four seasons on the varsity basketball team. W W W. G O R H O D Y. C O M 35 2010 NEWCOMERS 45 DAVID COLEMAN 32 DARRELL DULANY Montcliar, N.J. Montcliar High School Philadelphia, Pa. Valley Forge Military Academy DB FR 5-11 190 DB High School: Led the team in sacks as a senior with 7.0... Two-year varsity starter... Was named New Jersey Star Ledger Player of the Week three times as a senior... Helped his squad to a 10-2 record and an appearance in the Group IV New Jersey State Semifinals during his junior campaign. 6-1 17 STANLEY DUNBAR East Greenwich, R.I. East Greenwich High School Johnston, R.I. Dean College FR 6-1 215 CB High School: Named team captain as a senior... Selected First Team All-State, First Team All-League and First Team All-Area... Voted Defensive Most Valuable Player by his teammates... Named Team Defensive MVP by the Providence Gridiron Club... Recorded a season-high six sacks and two interceptions against Moses Brown High School... Completed the 2009 season with a team-best 124 tackles (89 solo). JR 5-10 9 CHRIS EDMOND Sparta, N.J. Sparta High School Freeport, N.Y. Freeport High School/Hofstra FR 6-1 180 S High School: Served as team captain as a senior... During his junior campaign he helped the squad to the conference title... In his final two high school seasons, he was named First Team All-League, First Team All-Area and Third Team All-West Jersey. 185. 15 DOUG D’ANGELO QB 190 High School:. 57 ALEX CRAFT LB 36 JR JR 5-10 200. W W W. G O R H O D Y. C O M 2010 NEWCOMERS 54 JUSTIN FAVREAU 52 DAVID HANSEN Wakefield, R.I. South Kingston High School Providence, R.I. La Salle Academy LB FR 5-11 LB 210 High School: Played three years on the varsity squad... Served as the team captain during his senior campaign... Received All-Area recognition during his senior season... Selected All-Division in both his junior and senior seasons. FR 34 TRAVIS HURD Chantilly, Va. Westfield High School Branford, Conn. Cheshire Academy FR 6-4 180 RB High School: Two-year varsity letterwinner... Voted All-Concorde District First Team... Selected All-Northern Region Honorable Mention... Earned “Top Dog” Award for Leadership and On-field Performance... Rated as a two-star quarterback by Rivals Recruiting Service... Listed as one of the Top 25 players in Virginia prior to his senior campaign... Compiled a 15-8 record as a starter... Led his squad to the Concorde District Championship and the Northern Region Playoffs as a senior... Set Westfield High School Records for yards (308) and touchdown passes (5) in a single game... Helped his squad to a 9-3 mark as a junior. FR 5-8 28 DE’ONTRAY JOHNSON Bloomfield, N.J. Worcester Academy San Diego, Calif. Hoover High School FR 6-4 240 RB. 180. 89 DEREK GIBSON TE 190 High School: Named All-League as a senior... Served as team captain during his senior season... Scored four touchdowns against rival Bishop Hendricken this past season... Helped his squad to the Rhode Island State Championship game as a junior... Younger brother of URI starting linebacker Matt Hansen. 13 DANNY FENYAK QB 5-10 FR 5-9 170 High School: Named First Team all-City Conference and first team all-Western League as a running back following his senior season… Rushed for 1,570 yards and 21 touchdowns… Rushed for at least 100 yards in nine of his 11 games… Averaged 142.7 yards per game and 6.77 yards per carry as a senior… Top game came against Serra HS where he had 208 rushing yards and two touchdowns… Scored five TDs and rushed for 145 yards against Crawford HS… Rushed for at least 150-yards in six games…had three-plus touchdowns in four games… Also played defensive back. W W W. G O R H O D Y. C O M 37 2010 NEWCOMERS 40 CAMERON JOSSE 11 BILLY MORGAN Oakland, N.J. Indian Hills High School Chester, Pa. Cardinal O’Hara/Hofstra S SO 5-10 210 WR High School: Served as senior co-captain... Received First Team All-League and Honorable Mention All-County accolades. SO 5-9 165 2009 Hofstra: Played in 11 games during his freshman season and caught 13 passes for 173 (13.3 yards per catch) with the Pride.. 60 JEFF KENNEDY 77 JAMES MURRAY Hope, R.I. Scituate High School North Scituate, R.I. Scituate High School OL FR 6-4 240 DE High School: Served as senior co-captain this past season... Received First Team All-League and Honorable Mention All-County accolades. SO 6-2 225 Anna Maria College (Mass.): Started in all 11 games... Recorded 27 tackles, which lead all defensive lineman on the team. High School: Four-year varsity letterwinner... Voted team Most Valuable Player as a senior... Earned Second Team All-Division as a junior and First Team All-Division as a senior... Led the team in tackles. 92 JOSH MOODY 70 KEVIN MUSTAC Staten Island, N.Y. Tottenville High School Rutherford, N.J. St. Mary’s Prep School DE FR 6-4 235 OL plays on the high school basketball team where he is currently averaging 21.0 points and 15.0 Rebounds Per Game. 38 FR 6-5 260 High School: Three-year varsity starter... Helped the team to the New Jersey State Finals... Named All-Bergen County Second Team... Unanimous All-League selection during his junior and senior seasons... Was also recruited by Stony Brook, Maine and New Hampshire. W W W. G O R H O D Y. C O M 2010 NEWCOMERS 8 STEVE PROBST North Massapequa, N.Y. Farmingdale High School/Hofstra QB JR 6-4 215. High School: Played four years of football and basketball and two years of lacrosse... Member of Farmingdale’s Nassau County championship, Long Island finalist and Rutgers Cup championship team... Earned the Doc Snyder Award as a senior as Nassau County’s Most Outstanding Quarterback after passing for 860 yards and eight touchdowns, and rushing for 702 yards and 10 touchdowns in eight games... Named to All-County and All-Long Island teams in 2007... All-County pick as a junior. 95 MIKE RINALDI Dallas, Texas Jesuit College Prep School DE FR 6-0 225 High School: Two-year letterwinner... Named First Team All-District as a senior... Earned All-District Honorable Mention... Led the team in tackles as a senior... Voted Defensive Team Most Valuable Player by his teammates... Earned Academic All-State honors. 96 JAMES TIMMINS Staten Island, N.Y. Curtis High School DL FR 6-2 215 High School: Started in 13 games at defensive end and center... Served as team captain during his senior year... Helped his squad to an 11-2 mark and the PSAL New York City Championship... Selected as the Most Valuable Player of the PSAL New York City Championship game... Selected All-City by the New York Post, New York Daily News and Repeat Advance... Named as a finalist for the Barberi Memorial Award... Also recruited by Albany, Delaware and Wagner. W W W. G O R H O D Y. C O M 39 HEAD COACH JOE TRAINER HEAD COACH SECOND SEASON Joe Trainer, a veteran of nearly 20 years of college football coaching experience, Trainer was introduced as head coach on Feb. 27, 2009 when the University begins his third season at the University of Rhode Island and his second as selected him as its 19th head coach in school history. head coach. “I cannot tell you how honored and humbled I am to be the head coach at the In his first season as head coach, Trainer oversaw a defensive unit that ranked University of Rhode Island,” Trainer said at his introductory press conference. “It second in the CAA in turnover margin. During the 2009 campaign, the Rams is truly an honor that I am going to embrace and I am going to make everyone gained a league-best 15 fumbles and picked off 11 passes. associated with this program proud of the way we conduct ourselves from the head coach all the way down to the team manager.” Offensively, the Rhody made tremendous strides down the stretch as it averaged 352.3 total yards of offense per game in its final three contests. Trainer returned to Rhode Island after he joined the coaching staff at Bowling Green in December 2008 where he served as the Assistant Head Coach/ Following the 2009 season, Rhody had three individuals earn CAA all- Defensive Coordinator under two-time Football Championship Subdivision conference honors, including linebacker Rob Damon, who also earned Sports (FCS) Coach of the Year Dave Clawson. Network All-America accolades. “Coming back here in a different capacity as a head coach I believe we are Off the field, Trainer places a strong emphasis on academics. This past season, going to do great things on the field and above all else we are going to do it 10 Rhode Island players earned Academic All-Conference, including defensive the right way,” Trainer explained. lineman Matt Rae, who was named ESPN The Magazine/CoSida District II AllAcademic First Team. “We are not going to cut corners and we are going to make our kids accountable in every phase.” 40 W W W. G O R H O D Y. C O M HEAD COACH THE TRAINER FILE Born: March 6, 1968 Hometown: Roslyn, Pa. Alma Mater: Dickinson ‘90 Coaching History: 2009-present...............................................Rhode Island 2009-present: Head Coach 2008-09 ................................................... Bowling Green 2008-09: Assistant Head Coach 2008 ...........................................................Rhode Island 2008: Associate Head Coach/Defensive Coord. 2005-07 ........................................................ Millersville 2005-07: Head Coach 1997-2004 ........................................................ Villanova 2000-04: Defensive Coordinator 1997-99: Linebackers 1995-96 ........................................................ New Haven 1995-96: Defensive Coordinator/Linebackers 1993-94 ..............................................................Colgate 1993-94: Linebackers/Special Teams Coord. 1992 .......................................................Frostburg State 1992: Linebackers/Special Teams Coordinator Playing History: Dickinson, 1986-89 The Trainer Family - Moreen Dillon, Keira and Liam (First Row L-R) Moreen and Joe (Back Row L-R) During the 2008 season at Rhode Island, Trainer’s defensive unit forced URI opponents into 11 fumbles, which ranked in the top five of CAA Football. His defensive scheme also allowed linebacker Matt Hansen to finish second in the league in total tackles with 111, as he went on to earn All-CAA Football Second Team and Football Championship Subdivision (FCS) All-New England honors. Prior to his stint at Rhode Island, Trainer spent three seasons as head coach of Millersville University, a member of the powerhouse Pennsylvania State Athletic Conference (PSAC), from 2005-2007. Before heading to Millersville, Trainer spent eight seasons at CAA-rival Villanova, starting out as linebackers coach before being promoted to defensive coordinator in 2005. “We are not going to cut corners and we are going to make our kids accountable in every phase.” - Joe Trainer February 27, 2009 During his tenure at Villanova, Trainer helped the Wildcats to two conference championships, two NCAA Playoff appearances (1997 and 2004) - including the national semifinals - two Lambert Cups, two wins over I-A schools (Rutgers and Temple), and five top 20 rankings in the final poll. Additionally, the Wildcats were nationally-ranked for a league-record 35 consecutive weeks and posted a school-record 12 wins in 1997. Trainer’s defensive scheme put the Wildcats as No. 1 in the Atlantic 10 in total defense in 2003 and 2004. Villanova finished seventh amongst NCAA Division I-AA schools in scoring defense (16.2 ppg) and 14th nationally in total defense (302 ypg allowed) in 2003. The following year in 2004, Trainer’s defense yielded under 300 yards per game and was second in the A-10 in scoring defense (22.5 ppg). Trainer was also instrumental in helping Brian Hulea earn First Team Atlantic 10 honors in 2003 and 2004. Trainer spent the 1995 and 1996 season at the University of New Haven, where he worked as both linebackers coach and defensive coordinator. In his two seasons at New Haven, Trainer helped the Chargers win 17 games and earn a berth in the NCAA Division II playoffs. W W W. G O R H O D Y. C O M 41 HEAD COACH Q&A WITH HEAD COACH JOE TRAINER 1. Describe your style of play…What should Rhody Football fans expect from the Rams in 2010? “We are going to have an aggressive philosophy in all 3 areas-Offense , Defense, and Special Teams. Our fans should expect an exciting and entertaining brand of football as we represent our great university with a much improved product.” 2. Describe your recruiting philosophy and some of the specific things you look for in potential student-athletes? “Our recruiting philosophy is to attract and retain players who have the talent to help us wins championships, the passion to develop incrementally, and a serious approach to their education.” 3. In your opinion, what are the keys to maintaining the balance between athletics and academics? “Time management is most important in balancing academics with athletics. We are looking for young men who are serious about earning a degree and serious about competing for championships.” 4. What are your thoughts on the Colonial Athletic Association and what it takes to be successful in this league? Under his tutelage New Haven finished ranked in the Top 20 in both seasons “Our ability to recruit, retain, and develop quality student athletes is the key and his defense also established school records for fewest points allowed, to our success. We have put three quality recruiting classes together and we points per game allowed, and turnover margin. Off the field, Trainer served are excited about this season because we have so many quality players have as the academic coordinator. matured and are ready for success in the CAA.” The Roslyn, Pa., native began his coaching career as a graduate assistant at Temple University in 1990, serving as linebackers coach. Two years later, Trainer took over as linebackers coach and special teams coordinator at Frostburg State University, where he also developed and oversaw the teams in-season strength and conditioning program. Following the 1992 season, he joined the coaching staff at Colgate University. While in Hamilton, he coached the outside linebackers and punt and kickoff teams. Trainer received his undergraduate degree in English from Dickinson College in 1990. He then went on to earn his masters degree from Temple University in 1992 and his M.S. in counseling and human relations from Villanova in 2004. Trainer and his wife Moreen are the proud parents of Liam (10), Dillon (8) and Keira (6). The Trainers reside in Saunderstown. Trainer’s Year-by-Year Head Coaching Record Year Institution 2005 Millersville 2006 Millersville 2007 Millersville 2009 Rhode Island 42 Record 5-6 5-6 3-8 1-10 14-30 5. What is your favorite thing about coaching at the University of Rhode Island? “We are selling a great product. Our campus is beautiful, our academic programs would rival any in the country, and our location is second to none.” 6. What goes into building a winning program? “Tremendous support from our administration, which we already have. Outstanding student athletes who are passionate about what they do and quality facilities.” 7. How much emphasis do you place on academics? “If you don’t retain the athletes you recruit, you are getting no return our your investment. We are representing our university in everything we do. Our players need to be as committed in the classroom as they are on the field. If school is not priority number one - then you are at the wrong place, playing for the wrong guy.” 8. How do you keep your teams engaged in the community and active with alums? “We did over 12 community service projects this year alone, including our bone marrow drive back in April. People in the community need to see our student-athletes giving back and just as importantly, our athletes must feel a sense of responsibility to represent the University of Rhode Island well on and off the field.” W W W. G O R H O D Y. C O M ASSISTANT COACHES ROY ISTVAN ASSISTANT HEAD COACH/OFFENSIVE LINE THIRD SEASON The 2010 campaign marks Roy Istvan’s third year as the In 2005, Buffalo recorded the most rushing touchdowns since offensive line coach at Rhode Island. The upcoming season it joined the MAC in 1999 and allowed the fewest amount of also marks his second as the Assistant Head Coach after he sacks since it joined the league. was promoted in the 2009 offseason. Istvan began his coaching career in 1990 as a graduate This past season, Istvan’s offensive line protected quarterback assistant at Southern Connecticut State University where he Chris Paul-Etienne, allowing him to pass for 14 touchdowns. also played. The Rams offensive line also limited opponents to just 26 sacks in 2009, which was 13 fewer from 2008. During his 11 seasons at SCSU, the Owls set 53 school offensive records and posted a 67-45 record. He also coached former During his first year in Kingston, Istvan’s blocking schemes New England Patriots offensive lineman and Super Bowl protected former quarterback Derek Cassidy and allowed him champion Joe Andruzzi. the time to throw for 2,759 yards through the air. Cassidy’s total passing yards ranks as the third-highest single season A 1990 graduate of SCSU, Istvan and his wife, Kristin, have three mark in school history. children - Jaylin and twins Kambria and Zachariah. Born: December 27, 1968 Hometown: Stratford, Conn. Alma Mater: Southern Connecticut ‘90 Prior to arriving at URI, Istvan spent the 2006 and 2007 seasons as offensive coordinator at Milford Academy, where he coached several division I football players. He also spent the 2007 season as an offensive line consultant to Sportstars INC. where he trained current NFL player Tony Ugoh (Indianapolis Colts) and LeSean McCoy (Philadelphia Eagles). Coaching History: 2008-present...............................................Rhode Island 2009-Present: Assistant Head Coach/Offensive Line 2008-2009: Offensive Line Before heading to Milford, he spent five seasons at the University of Buffalo (2001-2005). In his first three years, Istvan served as the run game coordinator/offensive line coach. THE ISTVAN FILE 2006-07 ................................................Milford Academy 2006-07: Offensive Coordinator 2001-05 .............................................................. Buffalo 2004-05: Offensive Coordinator 2001-03: Offensive Line/Run Game Coord. In 2003 the Bulls rushed for over 2,000 yards, which ranked third in the Mid-American Conference. The following season, Istvan was rewarded for his efforts and was promoted to offensive coordinator. 1990-2000 ......................................Southern Connecticut 1996-2000: Offensive Coordinator 1992-95: Offensive Line Coach 1990-91: Tight Ends/WR Graduate Asst. Playing History: Southern Connecticut, 1986-89 W W W. G O R H O D Y. C O M 43 ASSISTANT COACHES CHRIS PINCINCE OFFENSIVE COORDINATOR/QUARTERBACKS THIRD SEASON Chris Pincince begins his third season as the Rams’ offensive coordinator in 2010. total yards (384.4 ypg) and passing yards (271.5 ypg) and finished third in scoring with an average of 25.0 ppg. In 2009, Pincince oversaw a passing attack that averaged 202.5 yards per game, which ranked fifth in the CAA. Quarterback Chris Paul-Etienne averaged 174.5 passing yards per game in Pincince’s offensive scheme.. Paul-Etienne began to excel under the watchful eye of Pincince as he averaged 236.7 passing yards per game and had a CAA-best 10 touchdowns over the final four games of the season. During that stretch, Paul-Etienne threw for a season-high 424 yards through the air at nationally-ranked New Hampshire. In his first season, Pincince implemented the spread offense at URI and the effects were felt immediately as the Rhody passing game ranked fifth in CAA Football (238.4) in passing offense. THE PINCINCE FILE Born: February 23, 1972 Hometown: Woonsocket, R.I. Alma Mater: Boston University ‘94 Coaching History: 2008-present...............................................Rhode Island 2008-present: Offensive Coordinator/Quarterbacks 2004-07 ..........................................................Holy Cross 2006-07: Offensive Coordinator/Quarterbacks 2004-05: Wide Receivers/Special Teams Coordinator 2003 ...................................................................Ursinus 2003: Offensive Coordinator/Quarterbacks Before arriving in Kingston, Pincince spent four seasons at Holy Cross (20042007), serving as offensive coordinator in 2002 .................................................................... Brown 2002: Quarterbacks 1999-2001 ..................................................... New Haven 1999-2001: Offensive Coordinator/Quarterbacks 1997-98 ............................................................ Fairfield 1997-98: Offensive Coordinator/Quarterbacks 1995-96 ........................................................ New Haven 1995-96: Wide Receivers Playing History: Boston University, 1990-94 44 W W W. G O R H O D Y. C O M went back. ASSISTANT COACHES ROB NEVIASER DEFENSIVE COORDINATOR/DEFENSIVE LINE THIRD SEASON Rob Neviaser begins his third season at Rhode Island and his second as the defensive coordinator. This past season, Neviaser’s defensive unit was responsible for 26 turnovers (15 fumble recoveries and nine interceptions) in what resulted into a plus 10 turnover margin, which ranked second in the CAA. In 2008, Neviaser served as the defensive line coach. Neviaser came to Kingston following four seasons working on the University of Delaware coaching staff. THE NEVIASER FILE Born: April 26, 1971 Hometown: Darnestown, Md. Alma Mater: Williams ‘93 In his four seasons with head coach K.C. Keeler, the Blue Hens posted a combined record of 41-22, advanced to the NCAA I-AA playoffs twice, and captured consecutive Atlantic 10 conference titles in 2003 and 2004. Neviaser played a big part in helping UD capture the 2003 NCAA I-AA national title. That season, the Blue Hens posted 41 sacks and 116 tackles for loss, and led the A-10 in both rushing defense (114.4 - 17th in I-AA) and scoring defense (15.4 ppg - fifth in I-AA). 2002-05 ...........................................................Delaware 2002-05: Defensive Line In 2004, Delaware captured its second-straight Atlantic 10 Conference title and advanced to the NCAA I-AA quarterfinals. The Blue Hens ranked second in the Atlantic 10 in total defense (315.7) and was third in both rushing defense (115.4) and scoring defense (23.1). The 2005 squad, meanwhile, ranked fourth in the league with 30 sacks and was third in the league in rushing defense, allowing 119.6 yards per game to rank 20th in NCAA I-AA. 1997-2001 ................................................................Yale 1997-2001: Defensive Ends Prior to his arrival at Delaware, Neviaser spent five seasons as defensive line coach and video coordinator at Yale University Coaching History: 2008-present...............................................Rhode Island 2009- present: Defensive Coordinator/Defensive Line 2008: Defensive Line under head coach Jack Siedlecki. The Bulldogs posted a five-year record of 26-23 and won the Ivy League title in 1999 with a 9-1 record. Yale also posted marks of 7-3 in 2000 and 6-4 in 1998. Neviaser began his coaching career in 1993 at King’s College in Wilkes-Barre, Pa. under head coach Rich Mannello, where he worked with the inside linebackers. He moved on to Harvard, where he served one season as assistant offensive line coach under Tim Murphy in 1994. He then spent two seasons as graduate assistant offensive line coach under head coach Dan Henning at Boston College in 1995-96 before heading to Yale. While at Yale, Neviaser worked with the defensive ends and defensive tackles and coordinated all aspects of video. Among the player he coached at Yale was two-time All-Ivy League defensive end Jeff Hockenbrock. A native of Darnestown, Md. where he was a standout lineman at Landon High School, Neviaser moved on to Division III power Williams College, where he played offensive line and inside linebacker. During his career, Williams posted a four-year record of 28-3-2 under head coach Richard Farley. He earned his degree in political science from Williams in 1993. 1995-96 ...................................................Boston College 1995-96: Graduate Asst. Offensive Line 1994 ..................................................................Harvard 1994: Offensive Line 1993 ..........................................................King’s College 1993: Inside Linebackers Playing History: Williams College, 1990-1993 W W W. G O R H O D Y. C O M 45 ASSISTANT COACHES EDDIE ALLEN SPECIAL TEAMS/RUNNING BACKS THIRD SEASON Eddie Allen begins his third season as the special teams coordinator and running backs coach at Rhode Island in 2009. A native of Somerville, N.J., Allen graduated with a Bachelor’s Degree from the University of New Haven in 2003. He was a four-year letterwinner at quarterback for the Chargers. This past season, Allen coached punter Tim Edger, who was named All-CAA Second Team after he averaged 41.5 yard per punt, which ranked first in the CAA. Allen and his Kristin reside in North Kingstown, R.I. In 2008, Rhody special teams’ blocked nine kicks and ranked fourth in CAA Football in punt return average (10.1 per return). Prior to arriving in Kingston, Allen spent three seasons as a member of Greg Schiano’s coaching staff at Rutgers. He joined the Scarlet Knights’ football program in 2005 as a member of player development and worked as a graduate assistant in 2007. THE ALLEN FILE Born: October 24, 1980 Hometown: Somerville, N.J. Alma Mater: New Haven ‘03 Coaching History: 2008-present...............................................Rhode Island 2008-present: Special Teams Coordinator/Running Backs Allen began his collegiate coaching career as the offensive graduate assistant and video coordinator at Hofstra University in 2003. The following season, Allen moved on to Fort Scott Community College in Fort Scott, Kan., where he served as wide receivers coach. 2005-07 ............................................................. Rutgers 2007: Special Team Graduate Assistant 2005-06: Special Teams/Player Development 2004 ..................................Fort Scott Community College 2004: Wide Receivers Coach 2003 ...................................................................Hofstra 2003: Graduate Assistant/Video Coordinator Playing History: New Haven, 1998-02 46 W W W. G O R H O D Y. C O M ASSISTANT COACHES RYAN CRAWFORD SECONDARY/RECRUITING COORDINATOR THIRD SEASON Ryan Crawford begins his third season as the secondary coach at Rhode Island in 2010. Last season, Crawford’s secondary unit accounted for 11 interceptions. In the first five games of 2009, the Rhody secondary picked off seven passes, including a season-high three against in-state rival Brown. In 2008, Crawford’s secondary scheme picked off at least one pass in five of Rhody’s first seven games. It also held Boston College to a season-low 27 yards passing (Sept. 27). Crawford came to URI after spending three seasons at Bucknell University, a member of the Patriot League. In 2007, the Bison tied NCAA-tournament participants Fordham and Colgate for the league lead with 14 interceptions and finished second in turnover margin (+2). THE CRAWFORD FILE Born: January 16, 1979 Hometown: Maiden, N.C. Alma Mater: Davidson ‘01 Coaching History: 2008-present...............................................Rhode Island 2008-present: Secondary 2005-07 ............................................................ Bucknell 2005: Secondary One year earlier, Crawford was instrumental in cornerback Matt Palermo’s successful switch from safety to cornerback, which culminated in his All-Patriot League Second Team selection. That year, he also coached Academic All-American David Frisbey. A 2001 graduate of Davidson with a degree in biology, Crawford earned Associated Press First Team I-AA All-America honors in 1999, when he led all of Division I-AA with eight interceptions. Consequently, Davidson finished the year leading the nation with 28 picks. The following season, Crawford was the I-AA Mid-Major Defensive Back of the Year as well as the I-AA Independent Defensive MVP. In 2000, he was named Davidson’s Special Teams Player of the Year as well as the school’s Male Athlete of the Year. A native of Newton, N.C., Crawford went on to play semi-pro football for the Carolina Cowboys. He later played professionally with the Indiana Firebirds of the Arena Football League, and spent the summer of 2007 in camp with the Montreal Alouettes of the Canadian Football League. He has also worked as a stuntman and a featured extra in the Sony Pictures movie ‘Radio,’ starring Cuba Gooding, Jr. Prior to his arrival at Bucknell, Crawford spent two seasons as an assistant coach at his alma mater, Davidson. He coached the Wildcats’ quarterbacks in 2003 before switching to the defensive side of the ball in 2004 to coach the defensive backs. 2003-04 ........................................................... Davidson 2004: Defensive Backs 2003: Quarterbacks Playing History: Davidson, 1997-00 W W W. G O R H O D Y. C O M 47 ASSISTANT COACHES RAPHEAL DOWDYE LINEBACKERS FIRST SEASON Rapheal Dowdye begins his first year at the University of Rhode Island as the linebackers coach.-07.. THE DOWDYE FILE During his time with Northeastern, Dowdye has helped produce three All-Conference players in the secondary. Born: June 29, 1973 Hometown: Boston, Mass. Alma Mater: West Virginia Wesleyan ‘96 Coaching History: 2010-present...............................................Rhode Island 2010-present: Linebackers 2004-2009 ..................................................Northeastern 2009: Running Backs 2008: Defensive Coordinator 2004-07: Defensive Backs 2000-03 ............................................................... Brown 2006-07: Player Development Playing History: West Virginia Wesleyan, 1993-96 48 W W W. G O R H O D Y. C O M Prior to his arrival at NU, Dowdye, 36, spent four seasons coaching at Brown, two as the cornerbacks coach and two as coach of the running backs. Dowdye mentored Nick Hartigan, who went on to become the school’s. He is single and resides in Providence. ASSISTANT COACHES BOB GRIFFIN TIGHT ENDS/SPECIAL CONSULTANT 24TH SEASON Bob Griffin - the winningest football coach in URI history - returned to the sidelines at Meade Stadium in 2008 and is in his third season as an assistant. In his role, Griffin coaches the tight ends and serves as a special consultant. Griffin arrived in Kingston in 1976 and spent the next 17 seasons patrolling the sidelines for the URI football team, where he became the school’s. THE GRIFFIN FILE Born: October 22, 1940 Hometown: Milford, Conn. Alma Mater: Southern Connecticut ‘63 Coaching History: 2008-present...............................................Rhode Island 2008-present: Tight Ends/Special Consultant 2000-05 ..........................................................Holy Cross 2004-05: Offensive Coordinator 2000-03: Quarterbacks Bengals, guiding them to a 21-20 overall record, and twice (1972, 1975) led them to a school-record seven wins (against three losses). Griffin was inducted into the Rhode Island Athletics Hall of Fame in 1996 and is also a member of the Providence Gridiron Hall of Fame. 1995-98 ............................................................Syracuse 1995-98: Wide Receivers/Pass Game Coord. 1993-94 ........................................ Berlin Adler, Germany 1993-94: 1976-92 ......................................................Rhode Island 1976-92: Head Coach 1971-75 ........................................................Idaho State 1972-75: Head Coach 1971: Offensive Coordinator 1970 ............................................Bishop Hendricken H.S. 1970: Head Coach 1966-69 ......................................................Rhode Island 1966-69: Assistant Coach W W W. G O R H O D Y. C O M 49 ASSISTANT COACHES ARI CONFESOR WIDE RECEIVERS SECOND SEASON Ari Confesor is beginning his second season at the University of Rhode Island and his first as the wide receivers coach. During the 2009 campaign, Confesor served as the assistant secondary coach whereAmerica and First Team All-New England honors in both the 2002 and 2003 seasons. THE CONFESOR FILE Born: July 20, 1981 Hometown: Providence, R.I. Alma Mater: Holy Cross ‘03). In the spring of 2004, Confesor earned his degree in political science. Coaching History: 2009-present...............................................Rhode Island 2010-present: Wide Receivers 2009-present: Secondary Assistant Playing History: Holy Cross, 2000-03 50 W W W. G O R H O D Y. C O M ASSISTANT COACHES MIKE SIRIGNANO STRENGTH AND CONDITIONING FIRST SEASON Mike Sirignano is in his first year as the Football Strength and Conditioning Coach at the University of Rhode Island. Sirignano comes to Kingston after he spent the 2009 fall season at Bryant University as the Assistant Strength Coach where he he worked with all varsity athletic teams, while managing his own strength and conditioning business. As a student-athlete at Bridgewater State College, he was the captain of the football team during his senior season and earned two-time All-America, three-time All-New England and three-time ECAC All-Star honors. Sirignano earned his degree in Physical Education from Bridgewater State in 2007. Prior to his stint at Bryant, the Rhode Island native served as the Defensive Line Coach at Woonsocket High School during the 2006-07 seasons, while working as a Strength and Conditioning Coach at Next Level Fitness. THE SIRIGNANO FILE Born: Nov. 21, 1984 Hometown: Providence, R.I. Alma Mater: Bridgewater State College ‘07 Coaching History: 2009 ....................................................................Bryant 2009: Assistant Strength and Conditioning Coach Siriganano began his colleigate coaching career at the College of the Holy Cross in 2006. During his tenure at Holy Cross, he worked primarily with the school football team where he taught physical and mental conditioning. In addition to his work with the football team, he also handled strength programs for the hockey, volleyball, tennis, soccer and golf teams. Currently, Siriganano is a member of USA Weightlifting (USAW), the National Strength and Conditioning Association (NSCA), USA Powerlifting (USAPL) and the National Council on Strength and Fitness (NCSF). 2008-09 .....................................Woonsocket High School 2008-09: Defensive Assistant/Defensive Line Coach 2006-07 ..........................................................Holy Cross 2006-07: Strength and Conditioning Intern Playing History: Bridgewater State College, 2004-07 W W W. G O R H O D Y. C O M 51 ASSISTANT COACHES DAN SILVA DIRECTOR OF FOOTBALL OPERATIONS FOURTH SEASON Dan Silva begins his fourth year as director of football operations in 2010. In his role at URI, Silva organizes team travel, meals, video production and assists head coach Joe Trainer in day-to-day operations. A 2007 graduate of Rhode Island, Silva holds a degree in Communication Studies. Silva and his wife Kathleen reside in Middletown, R.I. THE SILVA FILE Born: Jan. 28, 1985 Hometown: Warren, R.I. Alma Mater: Rhode Island ‘07 Coaching History: 2007-present...............................................Rhode Island 2007-present: Director of Football Operations 52 W W W. G O R H O D Y. C O M SUPPORT STAFF KIM BISSONNETTE ASSOCIATE ATHLETIC DIRECTOR/ HEALTH & PERFORMANCE 20TH SEASON A 1977 graduate from the University of Rhode Island, Kim Bissonnette served as the President for the Athletic Trainers Bissonnette begins his 20th year in Kingston. of Massachusetts, and co-founded the Rhode Island Athletic Trainers Association serving as the inaugural President as well. Over the offseason, Bissonnette was promoted as the Associate Athletic Director Health and Performance. In January of 2007, Bissonnette was inducted into the Rhode Island Athletic Trainers Association Hall of Fame. A native of Prior to his appointment at URI he was the Head Athletic Portsmouth, R.I. Bissonnette earned his B.S. from the URI in Trainer at Bentley College in Waltham, Mass. for six 1977 and his M.S. from the University of Arizona in 1978. He is years, and was a member of the athletic training staff at in charge of the overall athletic training program, with direct Northeastern University from 1979-1985. responsibility for intercollegiate football. THE BISSONNETTE FILE Born: July 30, 1955 Hometown: Portsmouth, R.I. Alma Mater: Rhode Island ‘77 History: 1991-present...........................................................Rhode Island 2009-present: Assoc. AD/Health and Performance 1991-2009: Head Athletic Trainer 1985-1991 ........................................................... Bentley College 1985-1991: Head Athletic Trainer In the summer of 1985 he also worked as the Head Athletic A certified member of the National Strength & Conditioning Trainer for the Rhode Island Gulls of the United States Association, Bissonnette has three daughters - Jocelyn a recent Basketball League. graduate of New Hampshire, Lindsy and Kara - and resides in Wakefield. Bissonnette is an active member of the National Athletic Trainers Association, the Eastern Athletic Trainers Association and the Rhode Island Athletic Trainers Association. He has served on many national, regional and state committees and was instrumental in the development of the current licensing law that governs the practice of athletic training within the state Rhode Island. 1979-1985 ............................................................. Northeasterrn 1979-1985: Assistant Athletic Trainer ANDY LLAGUNO SENIOR ASSOCIATE ATHLETIC TRAINER 13TH SEASON Andy Llaguno begins his 13th season at his alma mater in 2010, where he presently serves as the Senior Associate/ Head Football Athletic Trainer. He also works with women’s varsity rowing team, while assisting with all other varsity teams. He is a certified Athletic Trainer by the National Athletic Trainers' Association (NATA) and Strength & Conditioning Specialist by the NSCA. Llaguno returned to URI in 1998 as an assistant trainer was named Athletic Trainer of the Year - Division One from NATA's before being promoted to associate trainer in 2000 and College/University Athletic Training Committee. senior associate athletic trainer one year later. A native of Fair Lawn, N.J., Llaguno resides in Charleston, R.I. Before returning to URI, Llaguno spent the 1997-98 with his wife, Jenni, and their two sons - Andres and Mateo. The season as an assistant football trainer at Penn State and family also has a dog, Rhody. also worked with the football programs at West Virginia (1995-97) and Boston College (1994-95). After earning his B.S. in Physical Education & Exercise Science from URI in 1992, Llaguno picked up his Masters in Education from Old Dominion University in 1994. While at ODU, he worked with the baseball, men's basketball, field hockey, and men's soccer programs. Over the offseason, Llaguno was honored by the National Athletic Trainers’ Association (NATA) for his years of service at the 61st Annual Meeting an Trade Show June 23-25 in Philadelphia, Pa. THE LLAGUNO FILE Born: Feb. 14, 1970 Hometown: Fairlawn, N.J. Alma Mater: Rhode Island ‘92 History: 1998-present...........................................................Rhode Island 2001-present: Sr. Assoc./Head Football Ath. Trainer 2000-01: Associate Athletic Trainer 1998-00: Assistant Athletic Trainer 1997-1998 .................................................................. Penn State 1997-98: Assistant Football Athletic Trainer 1995-1997 ............................................................... West Virgiria 1995-97: Assistant Football Athletic Trainer 1994-1995 ............................................................ Boston College 1994-95: Assistant Football Athletic Trainer W W W. G O R H O D Y. C O M 53 OPPONENT INFORMATION GAME 1 | SEPTEMBER 2 | BUFFALO, N.Y. | 7:00 P.M. GAME 2 | SEPTEMBER 11 | BRONX, N.Y. | 6 P.M. BUFFALO FORDHAM TOP RETURNEES PASSING Jerry Davis Head Coach Jeff Quinn Senior RB Ike Nduka QUICK FACTS Location Nickname President Athletic Director Conference Stadium Capacity Football Office Head Coach Alma Mater (Year) Overall Record Years Record at Buffalo Years Buffalo, N.Y. Bulls John B. Simpson Warde Manuel Mid -American Conference UB Stadium 29,013 716-645-3177 Jeff Quinn Elmhurst (1984) 0-0 First Year 0-0 First Year COACHING STAFF Head Coach Jeff Quinn Off. Coord/quarterbacks Greg Forest Def. Coord/Linebackers William Inge Assoc. Head Coach/Cornerbacks Ernest Jones Wide Receivers/Passing Game Coord Juan Taylor Off. Line/Run Game Coord Adam Shorter Running Back Mike Daniels Asst. Head Coach/Def. Line Jappy Oliver Tight Ends/Co-Special Teams Coord Marty Spieler Safeties/Co-Special Teams Coord Mike Dietzel Head Strength Coach Zach Duval Grad Assistants Charley Molnar & Chris Smith SERIES INFORMATION Series Record Record at URI Record at Buffalo First Meeting Buffalo leads, 3-0 Buffalo leads, 1-0 Buffalo leads, 2-0 Nov. 12, 1949 URI 7 - Buffalo 39 (Kingston, R.I.) Last Meeting Nov. 7, 1959 URI 6 - Buffalo 41 (Buffalo, N.Y.) Last URI Win --Last Buffalo Win Nov. 7, 1959 URI 6 - Buffalo 41 (Buffalo, N.Y.) Longest URI Win Streak --Longest Buffalo Win Streak Three (1949, 1950, 1959) URI’s Largest Margin of Victory 35 -Buffalo’s Largest Margin of Victory 35 URI 6 - Buffalo 41 (Buffalo, N.Y.) 54 CMP 8 INT 0 YDS 145 TD 1 RUSHING Ike Nduka Brandon Thermilus ATT 96 124 YDS 598 560 AVG 6.2 4.5 TD 6 4 RECEIVING Terrell Jackson Brandon Thermilus NO 25 9 YDS 250 99 AVG 10.0 11.0 TD 0 2 AT 47 30 TT 97 79 TACKLES Davonte Shannon Justin Winters ATT 15 TOP RETURNEES UT 50 49 TEAM INFORMATION 2009 Record Home Away Conference Lettermen R/L Offensive Starters R/L Defensive Starters R/L 5-6 2-4 3-3 3-5 51/17 5/6 8/3 7 p.m. 7 p.m. 7 p.m. TBA 3:30 p.m. 3:30 p.m. Noon 3:30 p.m. 7:30 p.m. 6 p.m. 2 p.m. TBA 2009 RESULTS (5-7) 9/5 at UTEP 9/12 Pittsburgh 9/19 at UCF 9/26 at Temple 10/3 Central Michigan 10/10 Gardner-Webb 10/17 Akron 10/24 at Western Michigan 11/3 Bowling Green 11/10 Ohio 11/18 at Miami 11/27 at Kent State W, 23-17 L, 54-27 L, 23-17 L, 37-13 L, 20-13 W, 40-3 W, 21-17 L, 34-31 L, 30-29 L, 27-24 W 42-17 W 9-6 MEDIA RELATIONS Email: Jon Fuller jfuller3@buffalo.edu Office Phone: (716) 645-6762 Fax: (716) 645-6840 Press Box Phone: (716) 912-0631 Website: ubathletics.com ATT 132 129 YDS 681 666 AVG 5.2 5.2 TD 5 6 RECEIVING Stephen Skelton David Moore NO 63 51 YDS 634 670 AVG 10.1 13.1 TD 6 7 AT 36 15 TT 80 58 TACKLES Nick Magiera Abdul El-Ouddus SACKS INT 0.0 2 4.5 4.5 2010 SCHEDULE 9/2 Rhode Island 9/11 at Baylor 9/18 UCF 9/25 at Connecticut 10/2 at Bowling Green 10/16 at Northern Illinois 10/23 Temple 10/30 Miami (Ohio) 11/4 at Ohio 11/12 Ball State 11/20 Eastern Michigan 11/26 at Akron Contact Head Coach Tom Masella RUSHING Darryl Whiting Xavier Martin UT 44 43 SACKS INT 2.0 0 0.0 3 Senior WR Jason Caldwell QUICK FACTS Location Nickname President Athletic Director Conference Stadium Capacity Football Office Head Coach Alma Mater (Year) Overall Record Years Record at Fordham (Years) Years Bronx, N.Y. Rams Fr. Joseph M. McShane, S.J. Frank McLaughlin Patriot League Jack Coffey Field 7,000 (718) 817-4280 Tom Masella Wagner (1981) 38-50 Eight Years 21-24 Four Years COACHING STAFF Head Coach Tom Masella Asst. Head Coach/Off. Line Patrick Moore Asst. Coach/Off Coord/Quarterbacks Bryan Volk Asst. Coach/Wide Receivers Custavious Patterson Asst. Coach/Def. Coord/Line Backers Matt Dawson Asst. Coach/Def. Backs Tim Cary Asst. Coach/Def. Line Greg Crum Asst. Coach/Running Backs Turner Pugh Asst. Coach/Def. Backs Nate Slutzky Asst. Coach/Tight Ends Mike Breznicky Student Asst. Coach Michael Lombardi SERIES INFORMATION Series Record Record at URI Record at Fordham First Meeting Fordham leads, 5-4 Series tied, 2-2 Fordham leads, 3-2 Oct. 19, 1912 URI 6, Fordham 0 (Bronx, N.Y.) Last Meeting Sept. 5, 2009 URI 41- Fordham 28 (Kingston, R.I.) Last URI Win Sept. 5, 2009 URI 41- Fordham 28 (Kingston, R.I.) Last Fordham Win Sept 6, 2008 URI 0, Fordham 16 (Bronx, N.Y.) Longest URI Win Streak Two (2004-05) Longest Fordham Win Streak Three (1914-15, 2003) URI’s Largest Margin of Victory 14 URI 34, Fordham 20 (Sept. 3, 2005) Fordham’s Largest Margin of Victory 35 Fordham 63, URI 28 (Sept. 6, 2003) W W W. G O R H O D Y. C O M TEAM INFORMATION 2009 Record Home Away Conference Lettermen R/L Offensive Starters R/L Defensive Starters R/L 2010 SCHEDULE 9/4 at Bryant 9/11 Rhode Island 9/18 at Columbia 9/25 Assumption 10/2 at Holy Cross 10/9 at Lehigh 10/16 at Yale 10/23 Lafayette 10/30 Georgetown 11/6 at Bucknell 11/20 Colgate 2009 RESULTS (5-6) 9/5 at Rhode Island 9/19 Columbia 9/26 at Colgate 10/3 Old Dominion 10/10 Bryant 10/17 at Cornell 10/24 at Lafayette 10/31 Holy Cross 11/7 Bucknell 11/14 Lehigh 11/21 at Georgetown 5-6 3-3 2-3 2-4 64/20 7/4 7/4 3 p.m. 6 p.m. 12:30 p.m. 1 p.m. 1 p.m. 12:30 p.m. 12 p.m. 1 p.m. 1 p.m. 1 p.m. 1 p.m. L, 41-28 L, 40-28 L, 20-12 W, 34-29 W, 35-7 W, 39-27 L, 26-21 L, 41-27 W, 21-7 L, 35-28 W, 41-14 MEDIA RELATIONS Contact Email: Joe DiBari dibari@fordham.edu Office Phone: (718) 817-4240 Fax: (718) 817-4244 Press Box Phone: (718) 817-4241 Website: FordhamSports.com OPPONENT INFORMATION GAME 3 | SEPTEMBER 18 | KINGSTON, R.I. | NOON GAME 4 | OCTOBER 2 | KINGSTON, R.I. | 1 P.M. NEW HAMPSHIRE BROWN TOP RETURNEES PASSING R.J. Toman Head Coach Sean McDonnell Senior QB R.J. Toman QUICK FACTS Location Nickname President Athletic Director Conference Stadium Capacity Head Coach Alma Mater (Year) Overall record Years Record at New Hampshire Years Football Office COACHING STAFF Head Coach Def. Coord./Secondary Quarterbacks Offensive Line Wide Receivers Defensive Ends Running Backs Tight Ends Outside LBs Inside LBs Defensive Tackles SERIES INFORMATION Series Record Last 10 Meetings Record at URI Record at New Hampshire First Meeting Durham, N.H. Wildcats Dr. Mark Huddleston Marty Scarano CAA Football Cowell Stadium (6,500) 6,500 Sean McDonnell New Hampshire (1978) 80-53 11 Years Same Same (603) 862-1852 Sean McDonnell Sean McGowan Tim Cramsey Joe Conlin Derek Sage Jon Shelton Ryan Carty Brian Barbato Mike Ferzoco Matt Dawson Jake Zweig UNH leads 51-28-5 UNH leads 8-2 UNH leads 22-20-2 UNH leads 29-8-3 Sept 23, 1905 UNH 6, URI 0 (Durham, N.H.) Last Meeting Nov. 7, 2009 UNH 55, URI 42 (Durham, N.H.) Last URI Win Sept 20, 2003 URI 55, UNH 40 Last New Hampshire Win Nov. 7, 2009 UNH 55, URI 42 (Durham, N.H.) Longest URI Win Streak Four (1964-67) Longest New Hampshire Win Streak Seven (1928-1946) URI’s Largest Margin of Victory 27 URI 27, UNH 0 (Oct. 6, 1951) New Hampshire’s Largeest Margin of Victory 52 UNH 59, URI 7 (Oct. 31, 1970) CMP 174 INT 11 YDS 2181 TD 15 RUSHING Chad Kackert Sean Jellison ATT 168 97 YDS 879 455 AVG 4.6 4.4 TD 10 7 RECEIVING Kevon Mason Sean Jellison NO 21 19 YDS 261 169 AVG 12.4 8.9 TD 1 1 AT 54 25 TT 98 77 TACKLES Devon Jackson Hugo Souza ATT 320 TOP RETURNEES UT 44 52 TEAM INFORMATION 2009 Record Home Away Conference Lettermen R/L Offensive Starters R/L Defensive Starters R/L 10-3 6-0 4-3 6-2 45/14 6/5 8/6 Noon 1 p.m. Noon Noon 6 p.m. Noon 3:30 p.m. 3:30 p.m. Noon Noon Noon 2009 RESULTS (10-3) 9/5 St. Francis 9/12 at Ball State 9/26 Dartmouth 10/3 at Towson 10/10 Villanova 10/17 at Massachusetts 10/24 at Hofstra 10/31 Northeastern 11/7 Rhode Island 11/14 at William & Mary 11/21 Maine 11/28 at McNee State (NCAA Playoffs) 12/5 at Villanova (NCAA Playoffs) W, 24-14 W, 23-16 W, 44-14 W, 57-7 W, 28-24 L, 23-17 W, 18-10 W, 48-21 W, 55-42 L, 20-17 W, 27-24 W, 49-13 L, 46-7 MEDIA RELATIONS Mike Murphy E-Mail mike.murphy@unh.edu Office (603) 862-3906 Fax (603) 862-2829 Press Box Phone (603) 862-2585 Web Site Head Coach Phil Estes SACKS INT 3.0 0 0.0 3 2010 SCHEDULE 9/4 Central Connecticut 9/11 at Pittsburgh 9/18 at Rhode Island 9/25 Lehigh 10/2 at Maine 10/9 Richmond 10/16 at James Madison 10/23 Massachusetts 11/6 William and Mary 11/13 at Villanova 11/20 Towson Contact PASSING Kyle Newhall UNHWildcats.com Senior QB Kyle Newhall-Caballero QUICK FACTS Location Nickname President Athletic Director Conference Stadium Capacity Head Coach Alma Mater (Year) Overall record (Years) Years Record at Brown Years Football Office COACHING STAFF Head Coach Asst. Head Coach/Def. Sec. Outside LBs/Video Coord. Def. Coord./LBs Recruiting Coord./Wide Receivers Tight Ends Defensive Line Running Backs Quarterbacks Providence, R.I. Bears Ruth Simmons Michael Goldberger Ivy League Brown Stadium 20,000 Phil Estes New Hampshire (1981) 72-47 12 Years Same Same (401) 683-2424 CMP 259 INT 14 YDS 2709 TD 18 RUSHING Zachary Tronti Spiro Theodhosi ATT 133 82 YDS 564 423 AVG 4.2 5.2 TD 4 2 RECEIVING Matthew Sudfeld Zachary Tronti NO 29 17 YDS 205 167 AVG 13.7 4.2 TD 8 4 AT 21 11 TT 57 32 TACKLES AJ Cruz Andrew Serrano ATT 413 UT 36 21 SACKS INT 0.0 3 1.0 0 TEAM INFORMATION 2009 Record Home Away Conference 2010 SCHEDULE 9/18 Stony Brook 9/25 Harvard 10/2 at Rhode Island 10/9 at Holy Cross 10/16 at Princeton 10/23 Cornell 10/30 at Penn 11/6 Yale 11/13 at Dartmouth 11/20 Columbia 6-4 4-1 2-3 4-3 12:30 p.m. 6 p.m. 1 p.m. TBA TBA 12:30 p.m. TBA 12:30 p.m. 12:05 p.m. 12:30 p.m. Phil Estes Abbott Burrell Paul Frisone Michael Kelleher Kyle Archer Joseph Leslie Neil McGrath Christopher Nappi Liam Coen 2009 RESULTS (7-3) 9/19 at Stony Brook L, 21-20 9/25 at Harvard L, 24-21 10/3 Rhode Island W, 28-20 10/10 Holy Cross W, 34-31 10/17 Princeton W, 34-17 10/24 at Cornell W, 34-14 10/31 Penn L, 14-7 11/7 at Yale W, 35-21 11/14 Dartmouth W, 14-7 SERIES INFORMATION at Columbia L, 28-14 Series Record Brown leads, 67-25-2 11/21 Last 10 Meetings Rhode Island leads, 6-4 Record at URI Rhode Island leads, 7-5 Record at Brown Brown leads, 62-18-2 First Meeting Sept. 29, 1909 Brown 6, URI 0 (Providence R.I.) Last Meeting Oct. 2, 2009 Brown 28, URI 20 (Providence, R.I.) Last URI Win Oct 4, 2008 URI 37, Brown 13 (Kingston, R.I.) MEDIA RELATIONS Last Brown Win Oct. 2, 2009 Brown 28, URI 20 (Providence, R.I.) Contact Chris Humm Longest URI Win Streak Five christopher_humm@brown.edu Email: (1988-93) Longest Brown Win Streak 23 Office Phone: (401) 863-1095 (1909-1934) Fax: (401) 863-1436 URI’s Largest Margin of Victory 28 URI 44, Brown 16 (Oct 3, 1998) Brown’s Largest Margin of Victory 49 Brown 55, URI 6 (Oct. 11, 1947) W W W. G O R H O D Y. C O M Press Box Phone: Website: (401) 751-2390 BrownBears.com 55 OPPONENT INFORMATION GAME 5 | OCTOBER 9 | WILLIAMSBURG, VA. | 7 P.M. GAME 6 | OCTOBER 16 | NEWARK, DEL. | 3:30 P.M. WILLIAM AND MARY DELAWARE TOP RETURNEES Head Coach Jimmye Laycock TOP RETURNEES RUSHING Jonathan Grimes Courtland Marriner ATT 277 93 YDS 1294 458 AVG 4.7 4.9 TD 9 7 RECEIVING Jonathan Grimes Chase Hill NO 46 34 YDS 289 469 AVG 6.3 13.8 TD 1 4 AT 41 30 TT 90 89 TACKLES Jake Trantin Evan Francks UT 49 59 PASSING Pat Devlin Head Coach K.C. Keeler SACKS INT 2.5 3 2.5 0 Junior RB Jonathan Grimes QUICK FACTS Location Nickname President Athletic Director Conference Stadium Capacity Head Coach Alma Mater (Year) Overall record Years Record at William & Mary Years Football Office COACHING STAFF Head Coach Off. Coord./Wide Receivers Asst. Head Coach/Off. Line Def. Coord./Secondary Rec. Coord./Def. Line Linebackers Running Backs Cornerbacks TEs/Offensive Asst. Linebackers/Def. Asst. Willamsburg, Pa.. Tribe Gene R. Nichol Terry Driscoll CAA Football Walter J. Zable Stadium at Carvey Field 12,259 Jimmye Laycock William & Mary (1970) 200-141-2 30 Years Same Same (757) 221-3337 TEAM INFORMATION 2009 Record Home Away Conference Lettermen R/L Offensive Starters R/L Defensive Starters R/L 11-3 6-0 5-3 6-2 30/17 6/5 6/5 2010 SCHEDULE 9/4 at Massachusetts 9/11 Virginia Military Institute 9/18 at Old Dominion 9/25 at Maine 10/2 Villanova 10/9 Rhode Island 10/23 Delaware 10/30 at North Carolina Jimmye Laycock 11/6 at New Hampshire Zbig Kepa 11/13 at James Madison Bob Solderitch 11/20 Richmond Bob Shoop Trevor Andrews 2009 RESULTS (11-3) Scott Boone 9/5 at Virginia Dave Corley, Jr. 9/12 CCSU Trey Henderson 9/19 a Norfolk State Brendan Nugent 9/26 Delaware John Bowes 10/3 at Villanova SERIES INFORMATION Series Record William & Mary leads, 11-2 Last 10 Meetings William & Mary leads, 8-2 Record at URI William & Mary leads, 6-2 Record at W&M William & Mary leads, 5-0 First Meeting Sept. 3, 1994 William & Mary 28, URI 17 (Kingston, R.I.) Last Meeting Oct. 31, 2009 William & Mary 39, Rhode Island 14 (Kingston, R.I.) Last URI Win Sept. 17, 2005 URI 48, William & Mary 29 (Kingston, R.I) Last William & Mary Win Oct. 31, 2009 William & Mary 39, Rhode Island 14 (Kingston, R.I.) Longest URI Win Streak One (2001,2005) Longest William & Mary Win Streak Six (1994-2000) URI’s Largest Margin of Victory 19 URI 48, William & Mary 29 (Kingston, R.I.) William and Mary’s Largest Margin of Victory 38 W&M 44, URI 6 (Nov. 6, 2000) 56 Senior QB Pat Devlin 10/10 10/24 10/31 11/7 11/14 11/21 11/28 12/5 12/11 3:30 p.m. 7 p.m. 7 p.m. 6 p.m. 3:30 p.m. 7 p.m. Noon TBA Noon TBA 3:30 p.m. W, 26-14 W, 33-14 W, 27-15 W, 30-20 L, 28-17 at Northeastern W, 34-14 James Madison W, 24-3 at Rhode Island W, 39-14 Towson W, 31-0 New Hampshire W, 20-17 at Richmond L, 13-10 Weber State (NCAA Playoffs) W, 38-0 at Southern Illinois (NCAA Playoffs) W 24-3 at Villanova (NCAA Playoffs) L 14-13 MEDIA RELATIONS Contact Pete Clawson E-Mail pmclaw@wm.edu Office (757) 221-3369 Fax (757) 221-3412 Press Box Phone (757) 221-3414 Web Site TribeAthletics.com QUICK FACTS Location Newark, Del. Nickname Blue Hens President Dr. Patrick E. Harker Athletic Director Bernard Muir Conference CAA Football Stadium Tubby Raymond Field at Delaware Stadium Capacity 22,000 Head Coach K.C. Keeler Alma Mater (Year) Delaware (1981) Overall record 150-60-1 Years 16 Years Record at Delaware 62-39 Years Eight Years COACHING STAFF Head Coach K.C. Keeler Offensive Coordinator/Quarterbacks Jim Hofher Defensive Coordinator/Safeties Nick Rapone Run Game Coordinator/Offensive Line Damian Wroblewski Pass Game Coordinator/Wide Receivers Brian Ginn Tight Ends Gregg Perry Running Backs TBA Defensive Line Phil Petitte Linebackers Brad Sherrod Cornerbacks Lyle Hemphill Defensive Back Assistant Lyle Hemphill Defensive Line Assistant Frank Law Graduate Assistants Drew Nystrom and Stephen Thomas CMP 220 INT 9 YDS 2664 TD 16 RUSHING David Hayes Leon Jackson ATT 101 99 YDS 409 316 AVG 4.0 3.2 TD 2 6 RECEIVING Mark Mackey Tommy Crosby NO 33 25 YDS 374 299 AVG 11.3 12.0 TD 1 2 AT 28 24 TT 67 60 TACKLES Benard Makumbi Paul Worrilow ATT 344 UT 39 36 TEAM INFORMATION 2009 Record Home Away Conference Lettermen R/L Offensive Starters R/L Defensive Starters R/L 2010 SCHEDULE 9/2 West Chester 9/11 South Dakota State 9/18 Duquesne 9/25 at Richmond 10/2 at James Madison 10/9 Maine 10/16 Rhode Island 10/23 at William and Mary 11/6 Towson 11/13 at Massachusetts 11/20 Villanova SACKS INT 0.0 0 0.0 0 6-5 4-2 2-3 4-4 40/14 8/3 8/3 7 p.m. 1 p.m. 6 p.m. 3:30 p.m. Noon 1 p.m. 3:30 p.m. Noon 3:30 p.m. 1 p.m. Noon 2009 RESULTS (6-5) 9/4 West Chester W, 35-0 9/12 Richmond L, 16-15 9/19 Delaware State W, 27-17 9/26 at William & Mary L, 30-20 10/3 at Maine W, 27-17 10/10 Massachusetts W, 43-27 10/17 at Towson W, 49-21 SERIES INFORMATION 10/31 James Madison W, 20-8 Series Record Delaware leads, 18-7 11/7 Hofstra W, 28-24 Last 10 Meetings Delaware leads, 8-2 11/14 at Navy L, 35-18 Record at URI Delaware leads, 7-4 11/21 at Villanova L, 30-12 Record at Delaware Delaware leads, 11-3 First Meeting Oct. 21, 1922 URI 7, Delaware 0 Last Meeting Sept. 15, 2007 Delaware 38, URI 9 (Newark, Del.) Last URI Win Oct. 10, 2002 MEDIA RELATIONS URI 17, Delaware 14 - 2OT (Kingston, R.I.) Last Delaware Win Sept. 15, 2007 Contact Scott Selheimer Delaware 38, URI 9 (Newark, Del.) E-Mail selheime@udel.edu Longest URI Win Streak Two (3) (1922-67; 1987-88; 2001-02) Office (302) 831-8007 Longest Delaware Win Streak 10 (1994-2000) Fax XXX URI’s Largest Margin of Victory 13 Press Box Phone XXX URI 26, Delaware 13 (Sept. 12, 1987) Delaware’s Largest Margin of Victory 45 Web Site BlueHens.com Delaware 55, URI 10 (Oct. 18, 2003) W W W. G O R H O D Y. C O M OPPONENT INFORMATION GAME 7 | OCTOBER 23 | KINGSTON, R.I. | 12:30 P.M. GAME 8 | OCTOBER 30 | TOWSON, MD. | 3:30 P.M. MAINE TOWSON TOP RETURNEES TOP RETURNEES PASSING Warren Smith Head Coach Jack Cosgrove Junior LB Donte Dennis QUICK FACTS Location Nickname President Athletic Director Conference Stadium Capacity Head Coach Alma Mater Overall record Years Record at Maine Years Football Office Orono, Maine Black Bears Dr. Robert Kennedy Blake James CAA Football Morse Field at Alfond Stadium 10,000 Jack Cosgrove Maine (1978) 93-101 17 Years Same Same (207) 581-1062 CMP 159 INT 13 YDS 1695 TD 12 RUSHING Derek Session Warren Smith ATT 119 74 YDS 479 205 AVG 4.0 2.8 TD 3 2 RECEIVING Tyrell Jones Derek Session NO 48 23 YDS 547 176 AVG 11.4 7.7 TD 6 0 AT 55 35 TT SACKS INT 106 1.0 4 66 0.0 0 TACKLES Donte Dennis Vinson Givans ATT 260 UT 51 31 TEAM INFORMATION 2009 Record Home Away Conference Lettermen R/L Offensive Starters R/L Defensive Starters R/L 2010 SCHEDULE 9/2 Albany 9/11 at Monmouth 9/18 at Syracuse 9/25 William and Mary 10/2 New Hampshire 10/9 at Delaware 10/16 Villanova COACHING STAFF at Rhode Island Head Coach Jack Cosgrove 10/23 at Massachusetts Offensive Coordinator/Quarterbacks Kevin Bourgoin 11/6 at Towson Defensive Coordinator/Linebackers Joe Rossi 11/13 James Madison Run Game Coordinator/Off. Line/Tight Ends Frank Giufre 11/20 Defensive Backs Steve Vashel Recruiting Coordinator/Defensive Line Dwayne Wilmot 2009 RESULTS (5-6) St. Cloud State Special Teams Coordinator/Wide Receivers Kevin Cahill 9/3 9/12 at Northeastern Offensive Asstistant/Running Backs Dennis Dottin-Carter at Albany Defensive Assistant/Defensive Backs Steve Boyle 9/19 at Syracuse Defensive Assistant/Defensive Line Lamin Sisay 9/26 10/3 Delaware 10/10 at Hofstra SERIES INFORMATION Richmond Series Record Maine leads, 51-34-3 10/17 Massachusetts Last 10 Meetings Maine leads, 9-1 10/31 at James Madison Record at URI URI leads, 16-15-1 11/7 11/14 Rhode Island Record at Maine Maine leads, 36-18-2 at New Hampshire First Meeting Sept. 30, 1911 11/21 URI 3, Maine 0 (Orono,Maine) Nov. 14, 2009 Maine 41, URI 17 (Orono, Maine) Last URI Win Oct. 28, 2006 URI 3, Maine 0 (Kingston, R.I.) Last Maine Win Nov. 14, 2009 Maine 41, URI 17 (Orono, Maine) Longest URI Win Streak Five (1981-85) Longest Maine Win Streak Eight (1921-1930) URI Largest Margin of Victory 47 URI 47, Maine 0 (Oct. 7, 1978) Maine’s Largest Margin of Victory 44 Maine 44, URI 0 (Oct. 11, 1913) 5-6 3-2 2-4 4-4 42/9 9/3 6/3 7 p.m. 1 p.m. 7:15 p.m. 6 p.m. 6 p.m. 1 p.m. Noon 12:30 p.m. 3:30 p.m. 2 p.m. Noon W, 34-27 (OT) W, 17-7 L, 20-16 L, 41-24 L, 27-17 W, 16-14 L, 38-21 W, 19-9 L, 22-14 W, 41-17 L, 27-24 Last Meeting MEDIA RELATIONS Contact Email: Andrew Mahoney Andrew.Mahoney@umit.maine. eduOffice Phone: (207) 581-3596 Fax: (207) 581-3297 Press Box Phone: (207)581-1049 Website: GoBlackBears.com PASSING Peter Athens Head Coach Rob Ambrose Senior DT Yaky Ibia QUICK FACTS Location Towson, Md. Nickname Tigers President Dr. Robert Caret Athletic Director Mike Hermann Conference CAA Football Stadium Minnegan Field at Johnny Unitas Stadium Capacity 11,198 Football Office (410) 704-3155 Head Coach Rob Ambrose Alma Mater (Year) Towson (1993) Overall Record 5-16 Years Two Years Record at Towson (Years) 2-9 Years One Year COACHING STAFF Head Coach Rob Ambrose Defensive Coordinator Matt Hachmann Tight Ends Jared Ambrose Quarterbacks John Kaleo Running Backs/Special Teams Assistant James Vollono Wide Receivers Guilian Gary Secondary/Special Teams Brian Fleury Cornerbacks Derrick Johnson Defensive Line Canute Curtis Defensive Line Assistant Konstantinos Kosmakos SERIES INFORMATION Series Record Last 10 Meetings Record at URI Record at Towson First Meeting Series tied, 5-5 Series tied, 5-5 Towson leads, 2-3 Rhode Island leads, 3-2 Sept. 13, 1986 Towson 35, URI 14 (Towson, Md.) Last Meeting Oct. 10, 2009 Towson 36, URI 28 (Kingston, R.I.) Last URI Win Oct. 9, 2004 URI 28, Towson 16 (Kingston, R.I.) Last Towson Win Oct. 10, 2009 Towson 36, URI 28 (Kingston, R.I.) Longest URI Win Streak Five (1989-2004) Longest Towson Win Streak Two (1986-87) URI Largest Margin of Victory 20 URI 45, Towson 25 (Sept. 28, 1991) Towson’s Largest Margin of Victory 19 Towson 35, URI 14 (Sept. 13, 1986) W W W. G O R H O D Y. C O M CMP 59 INT 12 YDS 691 INT 6 RUSHING Tremayne Dameron Dominique Booker ATT 177 55 YDS 588 218 AVG 3.3 4.0 TD 8 1 RECEIVING Hakeem Moore Tremayne Dameron NO 28 19 YDS 286 105 AVG 10.2 5.5 TD 1 0 AT 65 31 TT SACKS INT 105 0.0 0 66 0.0 1 TACKLES Danzel White Danny Collins ATT 112 UT 40 35 TEAM INFORMATION 2009 Record Home Away Conference Lettermen R/L Offensive Starters R/L Defensive Starters R/L 2-9 1-4 1-5 1-7 51/16 7/4 9/2 2010 SCHEDULE 9/2 at Indiana 9/11 Coastal Carolina 9/18 at Villanova 9/25 at Columbia 10/2 Massachusetts 10/9 James Madison 10/23 at Richmond 10/30 Rhode Island 11/6 at Delaware 11/13 Maine 11/20 at New Hampshire 7:30 p.m. 7 p.m. 3:30 p.m. 12:30 p.m. 7 p.m. 7 p.m. 3:30 p.m. 3:30 p.m. 3:30 p.m. 2 p.m. Noon 2009 RESULTS (2-9) 9/5 at Northwestern 9/19 Coastal Carolina 9/26 at Morgan State 10/3 New Hampshire 10/10 at Rhode Island 10/17 Delaware 10/24 at Northeastern 10/31 Richmond 11/7 at William & Mary 11/14 Villanova 11/21 at James Madison L, 47-14 W, 21-17 L, 12-9 L, 57-7 W, 36-28 L, 49-21 L, 27-7 L, 42-14 L, 31-0 L, 49-7 L, 43-12 MEDIA RELATIONS Contact Email: Dan O’Connell doconnell@towson.edu Office Phone: (410) 704-3102 Fax: (410) 704-3861 Press Box Phone: (410) 704-3102 Website: TowsonTigers.com 57 OPPONENT INFORMATION GAME 9 | NOVEMBER 6 | KINGSTON, R.I. | 1 P.M. GAME 10 | NOVEMBER 13 | RICHMOND, VA. | 2 P.M. VILLANOVA RICHMOND TOP RETURNEES PASSING Chris Whitney Head Coach Andy Talley QUICK FACTS Location Nickname President Athletic Director Conference Stadium Capacity Capacity Head Coach Alma Mater (Year) Overall record Years Record at Villanova Years Football Office Villanova, Pa. Wildcats Rev. Peter M. Donohoue, O.S.A Vince Nicastro CAA Football Villanova Stadium 12,000 Andy Talley Southern Connecticut (1967) 207-120-2 30 Years 179-102-1 25 Years (610) 519-4105 COACHING STAFF Head Coach Offensive Coordinator/Quarterbacks Defensive Coordinator/Secondary Recruiting Coordinator/Wide Receivers Defensive Line Running Backs/Tight Ends Special Teams Coordinator/Linebackers Cornerbacks/Coordinator of Football Rec. Offensive Assistant Defensive Assistant CMP 159 INT 5 YDS 1936 TD 18 RUSHING Chris Whitney Matt Szczur ATT 203 108 YDS 987 813 AVG 4.9 7.5 TD 6 10 RECEIVING Matt Szczur Norman White NO 51 17 YDS 610 251 AVG 12.0 14.8 TD 4 2 AT 48 18 TT SACKS INT 116 8.0 0 77 6.0 2 TACKLES Terence Thomas John Dempsey Senior WR Matt Szczur Andy Talley Sam Venuto Mark Reardon Brian Flinn Billy Crocker Darrius Smith Clint Wiley David Riede Nick Kray Bill McCarthy SERIES INFORMATION Series Record Villanova leads, 14-2 Last 10 Meetings Villanova leads, 9-1 Record at URI Villanova leads, 6-1 Record at Villanova Villanova leads, 8-1 First Meeting Oct. 1, 1988 Villanova 20, URI 14 (Villanova, Pa.) Last Meeting Oct. 24, 2009 Villanova 36, URI 7 (Villanova, Pa.) Last URI Win Oct. 22, 2005 URI 48, Villanova 30 (Villanova, Pa.) Last Villanova Win Oct. 24, 2009 Villanova 36, URI 7 (Villanova, Pa.) Longest URI Win Streak One (1995,2005) Longest Villanova Win Streak Six (1988-93, 1996-2004) URI’s Largest Margin of Victory 18 URI 48, Villanova 30 (Oct. 22, 2005) Villanova’s Largest Margin of Victory 42 Villanova 45, URI 3 (Nov. 16, 2002) UT 68 59 TEAM INFORMATION 2009 Record Home Away Conference Lettermen R/L Offensive Starters R/L Defensive Starters R/L 14-1 8-0 5-1 7-1 31/10 8/3 7/4 2010 SCHEDULE 9/3 at Temple 9/11 at Lehigh 9/18 Towson 9/25 Penn 10/2 at William & Mary 10/16 at Maine 10/23 James Madison 10/30 Richmond 11/6 at Rhode Island 11/13 New Hampshire 11/20 at Delaware 5 p.m. TBA 3:30 p.m. TBA 3:30 p.m. Noon 3:30 p.m. Noon 1 p.m. Noon Noon 2009 RESULTS (14-1) 8/30 at West Virginia 9/3 at Temple 9/12 Lehigh 9/19 at Penn 9/26 Northeastern 10/3 William & Mary 10/10 at New Hampshire 10/17 at James Madison 10/24 Rhode Island 11/7 at Richmond 11/14 at Towson 11/21 Delaware 11/28 Holy Cross (NCAA Playoffs) 12/5 New Hampshire (NCAA Playoffs) 12/11 William & Mary (NCAA Playoffs) 1218 Montana (NCAA Playoffs) L, 48-21 W, 27-24 W, 38-17 W, 14-3 W, 56-7 W, 28-17 L, 28-24 W, 27-0 W, 36-7 W, 21-20 W, 49-7 W, 30-12 W, 38-28 W, 46-7 W, 14-13 W, 23-21 MEDIA RELATIONS Contact Dean Kenefick E-Mail dean_kenefick@villanova.edu Office (610) 519-4120 Fax (610) 519-7323 Press Box Phone (610) 519-5290 Web Site 58 ATT 247 TOP RETURNEES Villanova.com Head Coach Latrell Scott RUSHING Garrett Wilkins Tyler Kirchoff ATT 61 45 YDS 282 199 AVG 4.6 4.2 TD 2 4 RECEIVING Tre Gray Kevin Grayson NO 51 48 YDS 713 545 AVG 14.0 11.4 TD 2 4 AT 45 57 TT 94 93 TACKLES Patrick Weldon Eric McBride UT 49 36 SACKS INT 1.0 2 1.0 0 Senior DL Martin Parker QUICK FACTS Location Nickname President Athletic Director Conference Stadium Capacity Capacity Head Coach Alma Mater (Year) Overall record Years Record at Richmond Years Football Office Richmond, Va. Spiders Dr. Edward L. Ayers Jim Miller CAA Football E. Claiborne Robins Stadium 8,700 Latrell Scott Hampton (1999) 0-0 First Year 0-0 First Year (610) 519-4105 COACHING STAFF Head Coach Latrell Scott Offensive Coordinator/Quarterbacks Bob Trott Wide Receivers Tripp Billingsley Tight Ends Devin Fitzsimmons Cornerbacks/Special Team Coordinator Dave Legg Defensive Line Kevin Lewis Offensive Line Bill Polin Linebackers/Recruiting Coordinator Byron Thweatt Running Backs Stacy Tutt Defensive Line Chad Wilt Graduate Assistants Derek Burrell and William Childrey SERIES INFORMATION Series Record Richmond leads, 5-12 Last 10 Meetings Richmond leads, 9-1 Record at URI Richmond leads, 3-6 Record at Villanova Richmond leads, 2-6 First Meeting Dec. 1, 1984 URI 23, Richmond 17 (Kingston, R.I.) Last Meeting Oct. 20, 2007 Richmond 38, URI 6 (Richmond, Va.) Last URI Win Oct 22, 2005 URI 48, Villanova 30 (Villanova, Pa.) Last Richmond Win Oct. 20, 2007 Richmond 38, URI 6 (Richmond, Va.) Longest URI Win Streak Three (1988-90) Longest Richmond Win Streak Eight (1991-2002) URI’s Largest Margin of Victory 37 URI 37, Richmond 0 (Sept. 15, 1990) Richmond’s Largest Margin of Victory 32 (2) Richmond 46, URI 14 (Sept. 26, 1992) Richmond 38, URI 6 W W W. G O R H O D Y. C O M TEAM INFORMATION 2009 Record Home Away Conference Lettermen R/L Offensive Starters R/L Defensive Starters R/L 14-1 5-2 6-0 7-1 45/27 3/8 4/7 2010 SCHEDULE 9/4 at Virginia 9/18 Elon 9/25 Delaware 10/2 Coastal Carolina 10/9 at New Hampshire 10/16 at Massachusetts 10/23 Towson 10/30 at Villanova 11/6 James Madison 11/13 Rhode Island 11/20 at William and Mary 6 p.m. 1 p.m. 3:30 p.m. 1 p.m. Noon 3:30 p.m. 3:30 p.m. Noon 3:30 p.m. 2 p.m. 3:30 p.m. 2009 RESULTS (10-3) 9/5 at Duke 9/12 at Delaware 9/19 Hofstra 9/26 VMI 10/10 at James Madison 10/17 at Maine 10/24 Massachusetts 10/31 at Towson 11/7 Villanova 11/14 at Georgetown 11/21 William & Mary 11/28 Elon (NCAA Playoffs) 12/5 Appalachian State (NCAA Playoffs) W, 24-16 W, 16-15 W, 47-0 W, 38-28 W, 21-17 W, 38-21 W, 34-12 W, 42-14 L, 21-20 W, 49-10 W, 13-10 W, 16-13 L, 35-31 MEDIA RELATIONS Contact Mike DeGeorge E-Mail mdegeorg@richmond.edu Office (804) 287-6313 Fax XXX Press Box Phone XXX Web Site RichmondSpiders.com OPPONENT INFORMATION GAME 11 | NOVEMBER 20 | KINGSTON, R.I. | 12:30 P.M. ALL-TIME vs. RANKED OPPONENTS MASSACHUSETTS TOP RETURNEES PASSING Kyle Havens Head Coach Kevin Morris Senior RB John Griffin QUICK FACTS Location Amherst, Mass. Nickname Minutemen Chancellor Dr. Robert C. Holub Athletic Director John McCutcheon Conference CAA Football Stadium Warren McGuirk Alumni Stadium Capacity 17,000 Football Office (413) 545-2000 Head Coach Kevin Morris Alma Mater (Year) Williams College (1986) Overall Record 29-38 Years Seven Years Record at Massachusetts (Years) 5-6 Years One Year COACHING STAFF Head Coach Defensive Coordinator/Linebackers Offensive Coordinator/Offensive Line Special Teams/Defensive Line Wide Receivers Recruiting Coordinator/Running Backs Assistant Defensive Backs Tight Ends Linebackers Assistant Assistant Offensive Line SERIES INFORMATION Series Record Last 10 Meetings Record at URI Record at UMass First Meeting Kevin Morris Keith Dudzinski Brian Picucci Steve Tirell Brian Crist Guido Falbo Dyran Peake Mike Wood Damian Mincey Tyler Moody UMass leads, 47-35-2 UMass leads, 8-2 UMass leads, 22-17 UMass leads, 25-18-2 Oct. 14, 1903 UMass 46, URI 0 (Amherst, Mass.) Last Meeting Sept. 19, 2009 UMass 30, URI 10 (Amherst, Mass.) Last URI Win Nov. 3, 2007 URI 12, UMass 6, (OT) (Kingston, R.I.) Last UMass Win Sept. 19, 2009 UMass 30, URI 10 (Amherst, Mass.) Longest URI Win Streak Nine (1937-1948) Longest UMass Win Streak Eight (1960-1967) URI’s Largest Margin of Victory 46 URI 52, UMass 6 (Oct. 16,1954) UMass’ Largest Margin of Victory 57 UMass 57, URI 0 (Oct.19, 1963) CMP 48 INT YARDS 15 1908 TD 9 RUSHING Anthony Nelson Jonathan Hernandez ATT 150 121 YDS 741 609 AVG 4.9 4.8 TD 9 8 RECEIVING Julian Talley Emil Igwenagu NO 28 24 YDS 350 288 AVG 12.5 12.0 TD 1 1 AT 60 42 TT SACKS INT 110 1.0 4 95 0.0 1 TACKLES Tyler Holmes Perry McIntryre ATT 56 UT 50 22 TEAM INFORMATION 2009 Record Home Away Conference Lettermen R/L Offensive Starters R/L Defensive Starters R/L 5-6 5-1 0-5 3-5 40/21 4/7 4/7 2010 SCHEDULE 9/4 William and Mary 9/11 Holy Cross 9/18 at Michigan 9/25 at Stony Brook 10/2 at Towson 10/16 Richmond 10/23 at New Hampshire 10/30 at James Madison 11/6 Maine 11/13 Delaware 11/20 at Rhode Island 2009 RESULTS (5-6) 8/30 Albany 9/5 at Kansas State 9/12 Albany 9/19 Rhode Island 9/26 Stony Brooke 10/10 at Delaware 10/17 New Hampshire 10/24 at Richmond 10/31 at Maine 11/7 Northeastern 11/14 James Madison 11/21 at Hofstra 3:30 p.m. 6 p.m. Noon TBA 7 p.m. 3:30 p.m. 3:30 p.m. 3:30 p.m. 3:30 p.m. 1 p.m. 12:30 p.m. W, 28-16 L, 21-17 W, 44-7 W, 30-10 W, 44-17 L, 43-27 W, 23-17 L, 34-12 L, 19-9 W, 37-7 L, 17-14 L, 52-38 Date Sept. 18, 1993 Oct. 23, 1993 Sept. 3, 1994 Oct. 8, 1994 Oct. 29, 1994 Nov. 4, 1994 Sept. 16, 1995 Oct. 7, 1995 Oct. 21, 1995 Nov. 11, 1995 Nov. 18, 1995 Nov. 2, 1996 Nov. 16, 1996 Nov. 1, 1997 Sept. 5, 1998 Oct. 17, 1998 Oct. 24, 1998 Nov. 7, 1998 Sept. 18, 1999 Oct. 30, 1999 Nov. 13, 1999 Sept. 2, 2000 Sept. 23, 2000 Oct. 14, 2000 Nov. 4, 2000 Aug. 30, 2001 Sept. 8, 2001 Oct. 13, 2001 Nov. 2, 2001 Sept. 7, 2002 Sept. 28, 2002 Nov. 9, 2002 Nov. 18, 2002 Sept. 6, 2003 Sept. 13, 2003 Oct. 11, 2002 Oct. 18, 2003 Nov. 22, 2003 Oct. 16, 2004 Oct. 30, 2004 Nov. 6, 2004 Sept. 17, 2005 Sept. 24, 2005 Oct. 15, 2005 Sept. 23, 2006 Oct. 7, 2006 Oct. 14, 2006 Oct. 21, 2006 Oct. 28, 2006 Nov. 11, 2006 Sept. 15, 2007 Sept. 22, 2007 Oct. 13, 2007 Oct. 20, 2007 Oct. 27, 2007 Nov. 3, 2007 Sept. 13, 2008 Oct. 4, 2008 Oct. 18, 2008 Oct. 25, 2008 Nov. 1, 2008 Nov. 15, 2008 Sept. 19, 2009 Oct. 24, 2009 Oct. 31, 2009 Nov. 7, 2009 Rank No. 3 No. 15 No. 21 No. 12 No. 25 No. 23 No. 22 No. 17 No. 15 No. 8 No. 8 No. 16 No. 13 No. 1 No. 14 No. 25 No. 10 No. 12 No. 7 No. 20 No. 25 No. 16 No. 12 No. 8 No. 13 No. 4 No. 4 No. 25 No. 24 No. 20 No. 3 No. 20 No. 4 No. 13 No. 6 No. 3 No. 4 No. 7 No. 16 No. 23 No. 8 No. 7 No. 24 No. 8 No. 18 No. 4 No. 25 No. 3 No. 15 No. 13 No. 10 No. 15 No. 9 No. 18 No. 8 No. 3 No. 10 No. 25 No. 10 No. 23 No. 15 No. 21 No. 17 No. 4 No. 5 No. 8 MEDIA RELATIONS Contact Email: Jason Yellin jyellin@admin.umass.edu Office Phone: (413) 545-3061 Fax: (413) 545-1556 Press Box Phone: (413) 545-3550 Website: UMassAthletics.com Rank 1. 2. 3. 4. 6. 7. 8. 9. 10. Opponent Brown Connecticut Maine Massachusetts New Hampshire Northeastern Boston University Worcester Tech Delaware Springfield W W W. G O R H O D Y. C O M Opponent DELAWARE at Boston University WILLIAM & MARY BOSTON UNIVERSITY NEW HAMPSHIRE at Hofstra at New Hampshire at William & Mary CONNECTICUT HOFSTRA DELAWARE at Villanova at Delaware VILLANOVA WILLIAM & MARY at Hofstra at Connecticut MASSACHUSETTS HOFSTRA at Massachusetts at Delaware DELAWARE at Hofstra JAMES MADISON RICHMOND at Delaware HOFSTRA WILLIAM & MARY MAINE at Hofstra at Maine at William & Mary at Villanova FORDHAM NORTHEASTERN VILLANOVA at Delaware at Massachusetts at William & Mary VILLANOVA NEW HAMPSHIRE WILLIAM & MARY at Massachusetts at New Hampshire DELAWARE at James Madison RICHMOND at Massachusetts MAINE NEW HAMPSHIRE at Delaware HOFSTRA JAMES MADISON at Richmond at New Hampshire MASSACHUSETTS NEW HAMPSHIRE BROWN VILLANOVA at William and Mary MASSACHUSETTS MAINE at Massachusetts at Villanova WILLIAM AND MARY at New Hampshire Most Common Opponents Games First Meeting 96 1909 92 1897 88 1911 84 1903 84 1905 57 1934 42 1919 34 1903 25 1922 21 1904 Ranking L, 11-32 L, 15-48 L, 17-38 L, 23-45 L, 7-13 L, 16-42 W, 10-7 L, 14-23 W, 24-19 L, 3-37 L, 19-24 L, 16-34 L, 27-43 L, 15-37 L, 13-21 L, 30-48 L, 17-31 L, 13-23 L, 13-28 L, 9-31 L, 0-35 L, 7-29 L, 12-30 W, 7-6 L, 10-13 (OT) W, 10-7 W, 35-26 W, 34-31 L, 14-26 L, 19-37 L, 14-26 L, 6-44 L, 3-45 L, 28-63 L, 39-42 L, 17-21 L, 10-55 L, 17-31 L, 24-31 L, 9-48 L, 3-27 W, 49-28 L, 6-14 L, 9-53 L, 17-24 L, 23-35 L, 6-31 L, 16-41 W, 3-0 L, 21-63 L, 9-38 L, 24-37 L, 27-44 L, 6-38 L, 36-49 W, 12-6 (OT) L, 43-51 W, 37-13 L, 7-44 L, 24-34 L, 0-49 L, 7-37 L, 10-30 L, 7-36 L, 14-39 L, 42-55 Last Meeting 2009 2009 2009 2009 2009 2009 1997 1942 2007 1982 59 ALL-TIME OPPONENT RECORDS BUFFALO Home 0-1, Away 0-2 Date Result 11/12/49 L, 7-39 10/28/50 L, 12-33 11/7/59 L, 6-41 BROWN Home 7-5, Away 18-62-2 Date Result 9/29/09 L, 0-6 10/5/10 L, 0-5 10/4/11 L, 0-12 10/5/12 L, 0-14 10/4/13 L, 0-19 10/3/14 L, 0-20 9/25/15 L, 0-38 9/30/16 L, 0-18 9/29/17 L, 0-27 9/27/19 L, 0-27 9/25/20 L, 0-25 9/24/21 L, 0-6 9/30/22 L, 0-27 9/26/25 L, 0-33 9/26/26 L, 0-14 9/24/27 L, 0-27 11/24/28 L, 7-33 10/5/29 L, 6-14 9/27/30 L, 0-7 10/3/31 L, 0-18 10/1/32 L, 0-19 10/7/33 L, 0-26 10/6/34 L, 0-13 10/5/35 W, 13-7 10/3/36 L, 6-7 10/2/37 L, 6-13 10/22/38 L, 21-40 9/30/39 L, 0-34 10/5/40 L, 17-20 10/11/41 L, 7-14 10/3/42 L, 0-28 10/12/46 L, 0-29 10/11/47 L, 6-55 10/9/48 L, 0-33 10/8/49 L, 0-46 10/14/50 L, 13-55 10/13/51 L, 13-20 10/11/52 W, 7-6 10/10/53 W, 19-13 10/9/54 L, 0-35 10/22/55 W, 19-7 10/27/56 L, 7-27 10/26/57 L, 0-21 10/25/58 L, 6-47 10/24/59 L, 0-6 10/22/60 L, 14-36 10/28/61 W, 12-9 10/27/62 T, 12-12 10/26/63 L, 7-33 10/24/64 L, 14-30 9/25/65 W, 14-6 9/24/66 L, 27-40 9/30/67 W, 12-8 9/28/68 L, 9-10 9/27/69 L, 0-21 9/26/70 L, 14-21 9/25/71 W, 34-21 9/30/72 W, 21-17 9/29/73 T, 20-20 9/28/74 L, 15-45 9/27/75 L, 20-41 9/25/76 L, 0-3 9/24/77 L, 10-28 9/30/78 W, 17-3 9/29/79 L, 13-31 11/22/80 L, 3-9 11/7/81 L, 8-10 9/25/82 L, 20-24 9/24/83 W, 30-16 9/29/84 W, 34-13 9/28/85 L, 27-32 9/27/86 L, 7-27 9/26/87 L, 15-17 9/24/88 W, 14-10 930/89 W, 18-13 9/22/90 W, 23-3 10/5/91 W, 38-36 10/2/93 W, 30-7 9/24/94 L, 29-32 9/23/95 L, 28-31 9/28/96 W, 28-13 10/18/97 L, 15-23 10/3/98 W, 44-16 10/16/99 L, 25-27 9/30/00 L, 19-29 9/29/01 W, 42-38 10/5/02 W, 38-28 10/4/03 W, 27-9 10/2/04 L, 13-20 10/1/05 L, 35-45 9/30/06 W, 28-21 60 0-3 Location Kingston, R.I. Buffalo, N.Y. Buffalo, N.Y. 25-67-2 Location. Kingston, R.I.* Providence, R.I. Providence, R.I. Providence, R.I. Providence, R.I. Kingston, R.I. Providence, R.I. Kingston, R.I. Providence, R.I. Kingston, R.I. Providence,. 9/30/07 10/4/08 10/2/09 W, 49-42 (2 OT) W, 37-13 L, 20-28 Providence, R.I. Kingston, R.I. Providence, R.I. * - The 1981 season marked the first season in which Rhode Island and Brown played for the Governor’s Cup Trophy. DELAWARE Home 4-7, Away 3-11 Date Result 10/21/22 W, 7-0 9/23/67 W, 28-17 9/9/78 L, 0-37 9/8/79 L, 14-34 10/24/81 L, 15-35 11/5/83 W, 19-9 9/7/85 L, 13-29 9/6/86 L, 10-44 9/12/87 W, 26-13 9/17/88 W, 23-17 9/16/89 L, 12-21 9/29/90 L, 19-24 9/21/90 L, 7-42 9/19/92 L, 14-31 9/18/93 L, 11-32 11/19/94 L, 7-26 11/18/95 L, 19-24 11/16/96 L, 27-43 11/18/99 L, 0-35 9/2/00 L, 7-29 9/30/01 W, 10-7 10/19/02 W, 17-14 (OT) 10/18/03 L, 10-55 9/23/06 L, 17-24 9/15/07 L, 9-38 FORDHAM Home 2-2, Away 2-3 Date Result 10/19/12 W, 6-0 10/24/14 L, 0-21 11/13/15 L, 0-7 9/6/03 L, 28-63 9/4/04 W, 37-36 9/3/05 W, 34-20 9/1/07 L, 23-27 9/7/08 L, 0-16 9/5/09 W, 41-28 MAINE Home 16-15-1, Away 18-36-2 Date Result 9/30/11 W, 3-0 10/12/12 L, 0-18 10/11/13 L, 0-44 10/14/16 W, 13-0 10/16/20 T, 7-7 10/15/21 L, 3-7 9/22/23 L, 0-14 9/27/24 L, 0-37 10/1/26 L, 0-7 10/1/27 L, 0-27 9/29/28 L, 6-20 9/28/29 L, 0-6 10/4/30 L, 12-13 9/26/31 W, 8-7 9/24/32 L, 0-12 9/30/33 W, 6-0 9/29/34 W, 6-0 9/25/35 L, 0-7 9/26/36 W, 7-0 9/25/37 T, 0-0 9/24/38 W, 14-6 10/7/39 L, 0-14 9/28/40 L, 0-7 9/27/41 W, 20-13 10/13/45 W, 10-7 9/28/46 W, 14-13 9/27/47 L, 13-33 9/25/48 L, 7-13 9/24/49 L, 7-19 9/30/50 L, 0-13 9/29/51 L, 0-12 9/27/52 L, 0-13 9/26/53 W, 13-6 9/25/54 W, 14-7 9/24/55 W, 7-0 9/29/56 L, 0-40 9/28/57 W, 25-7 9/27/58 L, 8-37 9/26/59 T, 0-0 9/24/60 L, 0-7 9/30/61 L, 20-22 9/29/62 W, 14-7 9/28/63 W, 20-16 9/26/64 L, 15-23 10/23/65 L, 0-36 10/22/66 L, 6-21 11/11/67 W, 34-12 7-18 Location Kingston, R.I. Newark, Del. Newark, Del. Kingston, R.I. Newark, Del. Kingston, R.I. Newark, Del. Newark, Del. Kingston, R.I. Newark, Del. Kingston, R.I. Newark, Del. Kingston, R.I. Newark, Del. Kingston, R.I. Newark, Del. Kingston, R.I. Newark, Del. Newark, Del. Kingston, R.I. Newark, Del. Kingston, R.I. Newark, Del. Kingston, R.I. Newark, Del. 4-5 Location Bronx, N.Y. Bronx, N.Y. Bronx, N.Y. Kingston, R.I. Kingston, R.I. Bronx, N.Y. Kingston, R.I. Bronx, N.Y. Kingston, R.I. 34-51-3 Location Orono, Maine Orono, Maine Orono, Maine Orono, Maine Orono, Maine Orono, Maine Orono, Maine Kingston, R.I. Kingston, R.I. Kingston, R.I.. 11/16/68 10/4/69 10/3/70 10/2/71 10/7/72 10/6/73 10/5/74 10/4/75 10/2/76 10/1/77 10/7/78 10/6/79 9/20/80 9/19/81 9/18/82 9/17/83 9/22/84 9/21/85 9/20/86 9/19.87 10/15/88 10/14/89 10/13/90 10/19/91 10/17/92 10/16/93 9/10/94 9/9/95 9/21/96 9/6/97 10/10/98 10/23/99 10/28/00 11/3/01 9/28/02 11/13/04 11/12/05 10/28/06 11/10/07 11/15/08 11/14/09 L, 15-21 L, 7-35 W, 23-6 L, 7-21 L, 7-10 L, 7-20 L, 19-29 L, 14-23 W, 14-9 W, 28-0 W, 47-0 W, 10-0 L, 11-14 W, 21-20 W, 58-55 (6 OT) W, 24-16 W, 27-0 W, 34-14 L, 14-34 L, 20-24 L, 14-28 L, 21-47 L, 17-24 W, 52-30 L, 9-21 W, 23-26* W, 28-21 W, 17-13 L, 19-58 L, 14-30 W, 18-17 W, 23-14 L, 7-37 L, 14-26 L, 14-31 L, 28-42 L, 24-27 (OT) W, 3-0 L, 0-35 L, 7-37 L, 17-41 MASSACHUSETTS Home 17-22, Away 18-25-2 Date Result 10/14/03 L, 0-46 10/7/05 L, 0-11 10/5/07 L, 0-11 9/25/08 L, 0-2 9/24/10 T, 0-0 9/23/11 W, 5-0 9/21/12 W, 7-0 11/8/19 L, 11-19 11/16/20 T, 7-7 11/5/21 W, 7-2 10/21/33 L, 12-14 10/20/34 W, 7-0 10/19/35 L, 6-7 10/17/36 L, 8-13 10/16/37 W, 12-6 10/15/38 W, 20-0 10/21/39 W, 23-20 10/19/40 W, 9-3 10/18/41 W, 34-6 10/17/42 W, 21-6 10/19/46 W, 14-6 10/18/47 W, 20-13 10/16/48 W, 19-12 10/15/49 L, 19-32 10/21/50 W, 38-27 10/20/51 L, 7-40 10/18/52 W, 26-7 10/17/53 W, 41-14 10/16/54 W, 52-6 10/15/55 W, 39-15 10/20/56 W, 34-14 10/19/57 W, 27-13 10/18.58 W, 24-8 10/17/59 W, 30-6 10/15/60 L, 16-34 10/21/61 L, 0-25 10/20/62 L, 8-42 10/19/63 L, 0-57 10/17/64 L, 0-7 10/16/65 L, 0-30 10/15/66 L, 9-14 10/21/67 L, 24-28 10/19/68 W, 14-9 10/18/69 L, 9-21 10/17/70 W, 14-7 10/16/71 W, 31-3 10/21/72 L, 7-42 10/20/73 W, 41-35 10/19/74 L, 7-17 10/18/75 L, 7-23 10/16/76 L, 7-14 10/15/77 L, 6-37 10/21/78 L, 17-19 10/20/79 L, 0-24 10/4/80 L, 8-26 W W W. G O R H O D Y. C O M Orono, Maine Kingston, R.I. Orono, Maine Kingston, R.I. Orono, Maine Kingston, R.I. Orono, Maine 35-47-2 Location Amherst, Mass. Kingston, R.I. Amherst, Mass. Amherst, Mass. Amherst, Mass. Amherst, Mass. Amherst, Mass. Kingston, R.I. Amherst, Mass. Kingston, R.I. Kingston, R.I. Amherst, Mass. Kingston, R.I. Amherst, Mass. Kingston, R.I. Massachusetts Kingston, R.I. Amherst, Mass. Kingston, R.I. Amherst, Mass. Amherst, Mass.. 10/3/81 10/2/82 10/1/83 10/6/84 10/5/85 10/4/86 10/3/87 10/8/88 10/7/89 10/6/90 10/12/91 10/10/92 10/9/93 10/1/94 9/30/95 10/5/96 9/27/97 11/7/98 10/30/99 11/18/00 11/17/01 11/23/02 11/22/03 10/23/04 9/24/05 10/21/06 11/3/07 11/1/08 9/19/09 W, 16-10 L, 7-17 W, 13-3 W, 20-19 W, 7-3 L, 17-31 L, 7-42 L, 7-26 L, 6-31 L, 13-16 W, 17-14 L, 7-32 L, 14-36 L, 12-22 W, 34-0 W, 41-21 L, 14-18 L, 13-23 L, 9-31 L, 21-29 L, 7-24 L, 21-48 L, 17-31 W, 27-24 L, 6-14 L, 16-41 W, 12-6 (OT) L, 0-49 L, 10-30 NEW HAMPSHIRE Home 20-22-2, Away 8-29-3 Date Result 9/23/05 L, 0-6 10/20/06 L, 0-20 11/2/07 T, 6-6 11/14/08 W, 12-0 11/13/09 L, 5-11 11/12/10 W, 6-0 10/28/11 W, 9-8 11/2/12 W, 25-0 11/1/13 L, 0-13 10/31/14 W, 7-0 11/14/14 T, 0-0 11/22/15 W, 19-0 11/18/16 L, 0-12 10/20/17 T, 0-0 10/13/23 L, 0-13 10/11/24 L, 6-17 10/17/25 L, 0-26 10/16/26 L, 6-7 10/15/27 W, 20-18 10/13/28 L, 0-12 10/24/42 L, 13-14 10/5/46 L, 12-25 10/4/47 L, 7-33 10/2/48 L, 7-19 10/1/49 L, 20-28 10/7/50 L, 14-27 10/6/51 W, 27-0 10/4/52 W, 27-7 10/3/53 L, 13-14 10/2/54 L, 7-33 10/1/55 T, 13-13 10/6/56 L, 7-13 10/5/57 W, 28-13 10/4/58 W, 20-13 10/3/59 L, 0-45 10/1/60 L, 6-13 10/7/61 W, 20-0 10/6/62 T, 6-6 10/5/63 L, 13-25 10/3/64 W, 22-8 10/2/65 W, 23-6 10/1/66 W, 17-6 10/7/67 W, 13-6 11/2/68 L, 6-27 11/1/69 W, 14-6 10/31/70 L, 7-59 10/30/71 L, 0-26 11/4/72 L, 10-14 11/3/73 W, 40-16 11/2/74 L, 14-29 11/1/75 L, 6-23 11/6/76 L, 6-31 10/29/77 W, 21-20 11/4/78 W, 19-14 11/3/79 L, 6-21 11/1/80 L, 28-31 10/31/81 W, 14-12 10/30/82 W, 23-20 10/29/83 L, 13-14 11/3/84 L, 12-14 11/2/85 W, 30-20 11/1/86 L, 24-28 10/31/87 L, 14-28 11/12/88 L, 9-17 11/11/89 L, 0-25 11/10/90 W, 24-14 11/16/91 L, 35-42 11/14/92 L, 13-20 11/13/93 L, 22-51 10/29/94 L, 7. 28-51-5 Location. Kingston, R.I. Durham, N.H.. Durham, N.H. Kingston, R.I. Durham, N.H. Kingston, R.I. Durham, N.H. Kingston, R.I. 9/16/95 9/14/96 9/13/97 11/14/98 9/4/99 9/9/00 10/20/01 9/20/03 11/6/04 10/15/05 11/11/06 10/27/07 9/13/08 11/7/09 W, 10-7 L, 26-35 W, 35-21 L, 7-9 L, 14-37 L, 12-13 W, 31-27 W, 55-40 L, 3-27 L, 9-53 L, 21-63 L, 36-49 L, 43-51 L, 42-55 RICHMOND Home 3-6, Away 2-6 Date Result 12/1/84 W, 0-6 10/25/85 L, 6-6 10/24/87 L, 14-27 10/22/88 W, 14-10 9/9/89 W, 45-14 9/15/90 W, 37-0 9/14/91 L, 10-19 9/26/92 L, 14-46 11/8/97 L, 11-27 9/19/98 L, 17-20 (OT) 10/9/99 L, 38-41 11/4/00 L, 10-13 (OT) 10/27/01 L, 0-28 10/28/02 L, 0-26 9/27/03 W, 17-13 10/14/06 L, 6-31 10/20/07 L, 6-38 TOWSON Home 2-3, Away3-2 Date Result 9/13/86 L, 14-35 11/21/87 L, 6-19 11/4/89 W, 19-6 9/8/90 W, 40-21 9/28/91 W, 45-25 9/12/92 W, 36-19 10/9/04 W, 28-16 10/8/05 L, 14-23 10/11/08 L, 32-37 10/10/09 L, 28-36 VILLANOVA Home 1-6, Away 1-8 Date Result 10/1/88 L, 14-20 10/28/89 L, 25-28 10/27/90 L, 7-14 11/2/91 L, 14-49 10/31/92 L, 3-34 10/30/93 L, 10-14 11/4/95 W, 27-10 11/2/96 L, 16-34 11/1/97 L, 15-37 11/21/98 L, 15-27 11/16/02 L, 3-45 10/11/03 L, 17-21 10/30/04 L, 9-48 10/22/07 W, 48-30 10/18/08 L, 7-44 10/24/09 L, 7-36 WILLIAM & MARY Home 2-6, Away 0-5 Date Result 9/3/94 L, 17-28 10/7/95 L, 14-23 9/7/96 L, 16-23 9/5/98 L, 13-21 11/5/99 L, 6-24 10/7/00 L, 16-26 10/13/01 W, 34-31 11/6/02 L, 6-44 10/25/03 L, 24-37 10/16/04 L, 24-31 9/17/05 W, 48-29 10/25/08 L, 24-34 10/31/09 L, 14-39 Durham, N.H. Kingston, R.I. Kingston, R.I. Durham, N.H. Kingston, R.I. Durham, N.H. Kingston, R.I. Kingston, R.I. Kingston, R.I. Durham, N.H. Kingston, R.I. Durham, N.H. Kingston, R.I. Durham, N.H. 5-12 Location Kingston, R.I. Kingston, R.I. Richmond, Va. Kingston, R.I. Richmond, Va. Kingston, R.I. Richmond, Va. Kingston, R.I. Richmond, Va. Kingston, R.I. Richmond, Va. Kingston, R.I. Richmond, Va. Kingston, R.I. Richmond, Va. Kingston, R.I. Richmond, Va. 5-5 Location Kingston, R.I. Towson, Md. Towson, Md. Kingston, R.I. Towson, Md. Kingston, R.I. Towson, Md. Kingston, R.I. Towson, Md. Kingston, R.I. 2-14 Location Villanova, Pa. Kingston, R.I. Villanova, Pa. Kingston, R.I. Villanova, Pa. Villanova, Pa. Kingston, R.I. Villanova, Pa. Kingston, R.I. Villanova, Pa. Villanova, Pa. Kingston, R.I. Kingston, R.I. Villanova, Pa. Kingston, R.I. Villanova, Pa. 2-11 Location Kingston, R.I. Williamsburg, Va. Kingston, R.I. Kingston, R.I. Kingston, R.I. Williamsburg, Va. Kingston, R.I. Williamsburg, Va. Kingston, R.I. Williamsburg, Va. Kingston, R.I. Williamsburg, Va. Kingston, R.I. ALL-TIME OPPONENTS Opponent Air Force-Europe Akron American Int'l Amherst Army Arnold Ball State Bates Boise State Boston College Boston University. Bowdoin Brandeis Bridgeport Brooklyn Brown Bucknell Buffalo Bryant Central Connecticut Cincinnati CCNY Coast Guard Colby Colgate Connecticut Cortland State C.W. Post Delaware Delaware State Florida A&M Fordham Furman Hampton Harvard Hofstra Holy Cross Howard Idaho State Jacksonville St. James Madison Kings Point Lafayette Lehigh Lowell Textile Maine Massachusetts Merrimack Monmouth Montana State Morgan State New Hampshire NYU Northeastern Norwich Providence Richmond Rutgers So. Connecticut Springfield St. Mary’s (N.S.) St. Stevens Syracuse Temple Towson Trinity Tufts Union Vermont Villanova Virginia Tech Virginia Union VMI Wesleyan Western Maryland William & Mary Worcester Tech W W W. G O R H O D Y. C O M W 1 1 3 0 0 4 0 2 0 2 13 0 3 1 5 25 1 0 1 2 0 1 12 0 0 34 1 0 7 1 0 4 0 2 0 6 0 2 0 0 3 3 3 3 5 34 35 1 1 0 0 28 0 29 1 2 5 0 5 11 1 1 0 0 5 0 3 0 9 2 0 1 0 0 0 2 18 L 0 0 0 1 1 0 1 4 2 4 29 1 0 0 0 67 1 3 0 0 1 3 1 1 1 50 0 1 18 1 2 5 1 0 1 18 8 0 1 1 6 0 0 2 4 51 47 0 0 1 1 50 5 26 0 6 12 1 0 8 0 2 1 11 5 1 0 1 8 14 1 0 1 3 1 11 12 T 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 8 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 3 2 0 0 0 0 5 1 2 0 1 0 0 0 2 0 0 0 0 0 0 0 1 1 0 0 0 0 3 0 0 4 1st Mtg. Last Mtg. Home 1973 1973 0-0 1985 1985 1-0 1938 1996 3-0 1913 1913 0-0 2007 2007 0-0 1929 1933 4-0 1983 1983 0-0 1924 1950 2-2 1981 1993 0-0 1909 2008 2-1 1919 1997 7-13 1921 1921 0-0 1957 1959 1-0 1974 1974 1-0 1933 1952 4-0 1909 2009 7-5 1966 1967 1-0 1949 1959 0-1 2002 2002 1-0 2004 2005 1-0 2003 2003 0-0 1924 1927 1-1 1922 1947 8-0 1913 1913 0-0 1916 1916 0-0 1897 2009 21-20-2 1969 1969 1-0 1975 1975 0-1 1922 2007 4-7 1994 1995 0-1 1979 1981 0-0 1912 2009 2-2 1985 1985 0-0 1972 2001 1-0 1923 1923 0-0 1953 2009 4-8 1917 1980 0-0 1984 1985 2-0 1981 1981 0-0 1955 1955 0-0 1987 2007 2-2 1977 1981 2-0-1 1982 1985 2-0 1977 1985 1-1 1922 1941 5-2 1911 2009 16-15-1 1903 2009 17-22 2006 2006 1-0 2008 2008 1-0 1984 1984 0-0 1999 1999 0-1 1905 2009 20-22-2 1909 1923 0-1 1934 2009 18-11 1911 1911 1-0 1931 1941 0-0 1984 2007 3-4 1945 1945 0-0 1968 1986 5-0 1904 1982 5-5-1 1975 1975 1-0 1915 1922 1-1 2002 2002 0-0 1949 1975 0-4 1986 2009 2-3 1905 1905 0-0 1910 1937 1-0 1915 1920 0-0 1942 1974 4-5 1988 2009 1-6 1980 1980 0-0 1978 1978 1-0 1977 1977 0-0 1914 1920 0-0 1925 1925 0-0 1994 2009 2-6 1903 1942 9-7-1 Away 0-0 0-0 0-0 0-1 0-1 0-0 0-1 0-2-1 0-2 1-3 6-16 0-1 2-0 0-0 1-0 18-62-2 0-1 0-2 0-0 1-0 0-1 0-2 4-1 0-1 0-1 13-30-6 0-0 0-0 3-11 1-0 0-2 2-3 0-1 1-0 0-1 2-10 0-8 0-0 0-1 0-0 1-4 1-0 1-0 2-1 0-2 18-36-2 18-25-2 0-0 0-0 0-1 0-0 8-29-3 0-4-1 11-15-2 0-0 0-4 2-7 0-1 0-0 6-3-1 0-0 0-1 0-1 0-7 3-2 0-0 2-0 0-1-1 5-3-1 1-8 0-1 0-0 0-1 0-3-3 0-1 0-5 9-5-3 Neut. 2-2-1 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-1 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-0 61 | rhody athletics | coaches and staff | players | opponents | caa football | 2008 season review | history | records | all-time results | all-time letterman | administration | media information | ALL-TIME OPPONENT RECORDS HOMECOMING Homecoming has been an official event at the University of Rhode Island since 1924. Since that time, the Rams have posted an overall record of 37-45-1. There was no Homecoming from 1943-45 as Rhode Island canceled football in 1943 and 1944 due to World War II. Rhode Island has attracted 444,283 (an average of 5,414) fans in 83 Homecoming contests. The largest crowd in Meade Stadium history, 13,052, witnessed Rhode Island’s 22-7 win over Boston University in the 1984 Homecoming contest. Last season, 5,159 fans came to Meade Stadium to see the Rams take on Hofstra. Rhody’s 2008 attendance mark was its highest since 1998 when URI defeated Brown 44-16. This season, the Rams will host Homecoming on Oct. 23 when the Black Bears of Maine University return to Kingston. Date Opponent (Attendance) Result Oct. 29, 1938 Worcester Tech (2,000) L, 14-19 Oct. 3, 1953 New Hampshire (5,000) L, 13-14 Oct. 20, 1990 Boston University (10,228) L, 13-15 Nov. 1, 1924 Worcester Tech L, 9-14 Nov. 11, 1939 Connecticut (3,500) L, 14-20 Nov. 13, 1954 Connecticut (2,500) W, 20-0 Oct. 19, 1991 Maine (10,145) W, 52-30 Nov. 7, 1925 Connecticut T, 0-0 Nov. 2, 1940 Worcester Tech (100) W, 18-0 Oct. 29, 1955 Springfield (4,500) W, 20-7 Oct. 24, 1992 Boston University (7,097) Oct. 16, 1926 New Hampshire L, 6-7 Nov. 8, 1941 Connecticut W, 6-0 Nov. 17, 1956 Connecticut (6,000) L, 6-51 Oct. 16, 1993 Maine (6,879) Nov. 12, 1927 Connecticut W, 12-0 Oct. 31, 1942 Worcester Tech Nov. 2, 1957 Springfield (1,000) L, 0-14 Oct. 29, 1994 New Hampshire (5,239) Oct. 13, 1928 New Hampshire L, 0-12 1943 No team-World War II Nov. 15, 1958 Connecticut (5,000) L, 8-36 Oct. 21, 1995 Connecticut (7,237) Nov. 16, 1929 Connecticut W, 19-6 1944 No team-World War II Oct. 31, 1959 Springfield (6,000) Nov. 8, 1930 Worcester Tech W, 45-0 1945 No Homecoming Oct. 15, 1960 Massachusetts (5,000) W, 66-13 L, 21-34 W, 23-26* (2 OT) L, 7-13 W, 24-19 L, 0-21 Oct. 26, 1996 Boston University (5,000) W, 38-7 L, 16-34 Oct. 4, 1997 Hofstra (5,178) L, 21-28 Oct. 24, 1931 Coast Guard W, 33-6 Nov. 9, 1946 Connecticut (5,000) L, 0-33 Nov. 18, 1961 Connecticut (6,000) L, 0-27 Oct. 3, 1998 Brown (7,214) W, 44-16 Nov. 5, 1932 Worcester Tech L, 0-12 Oct. 4, 1947 New Hampshire (3,000) L, 7-33 Oct. 20, 1962 Massachusetts (7,444) L, 8-42 Oct. 23, 1999 Maine (4,458) W, 23-14 Nov. 11, 1933 Connecticut W, 20-7 Nov. 6, 1948 Connecticut (4,500) L, 6-28 Oct. 5, 1963 New Hampshire (6,000) L, 13-25 Oct. 14, 2000 James Madison (4,914) W, 7-6 Nov. 3, 1934 Worcester Tech (1,500) W, 44-0 Oct. 29, 1949 Springfield (4,400) L, 13-34 Oct. 10, 1964 Vermont (10,000) L, 8-16 Oct. 20, 2001 New Hampshire (5,687) W, 31-27 Nov. 9, 1935 Connecticut W, 7-0 Nov. 18, 1950 Connecticut (4,712) W, 14-7 Oct. 23, 1965 Maine (10,000) L, 0-36 Oct. 19, 2002 Delaware (5,791) W, 17-14 Oct. 11, 1936 Worcester Tech (2,000) W, 19-0 Nov. 3, 1951 Springfield (5,000) W, 25-19 Oct. 8, 1966 Vermont (11,700) L, 7-21 Oct. 11, 2003 Villanova (2,623) L, 17-21 Nov. 6, 1937 Connecticut L, 7-13 Nov. 15, 1952 Connecticut (8,000) W, 28-25 Oct. 7, 1967 New Hampshire (11,000) W, 13-6 Oct. 23, 2004 Massachusetts (4,376) W, 27-24 Oct. 12, 1968 Vermont (10,000) W, 52-10 Oct. 8, 2005 Maine (2,508) L, 23-14 Oct. 4, 1969 Maine (11,000) L, 7-35 Oct. 14, 2006 Richmond (3,403) Oct. 17, 1970 Massachusetts (12,000) W, 14-7 Oct. 13, 2007 James Madison (6,163) Oct. 2, 1971 Maine (10,000) L, 7-21 Oct. 18, 2008 Villanova (6,704) L, 7-44 Oct. 14, 1972 Vermont (7,642) L, 13-14 Oct. 17, 2009 Hofstra (5,159) L, 16-28 Nov. 3, 1973 New Hampshire (9,473) W, 40-16 Oct. 12, 1974 Vermont (5,212) W, 14-0 * Maine forfeited the game for using Oct. 4, 1975 Maine (7,132) L, 14-23 an ineligible player Oct. 23, 1976 Boston University (6,133) Oct. 1, 1977 Maine (8,457) W, 28-0 Oct. 21, 1978 Massachusetts (7,595) L, 17-19 Oct. 6, 1979 Maine (8,158) W, 10-0 Oct. 4, 1980 Massachusetts (10,443) L, 8-26 Oct. 10, 1981 Northeastern (9,842) W, 33-0 Oct. 16, 1982 Boston University (10,230) L, 16-26 Oct. 8, 1983 Northeastern (12,211) W, 30-10 Oct. 20, 1984 Boston University (13,052) Oct. 26, 1985 Lafayette (12,933) Oct. 18, 1986 Boston University (9,882) L, 0-17 Oct. 31, 1987 New Hampshire (11,231) L, 14-28 Oct. 22, 1988 Richmond (5,980) L, 10-14 Oct. 14, 1989 Maine (8,847) L, 21-47 62 W W W. G O R H O D Y. C O M L, 0-36 W, 22-7 W, 41-19 L, 6-31 L, 27-44 2009 SEASON REVIEW 2009 RECORD/RESULTS RECEIVING 1-10, 0- CAA Football Date Sept 5 Sep 19 Sep 26 Oct 3 Oct 10 Oct 17 Oct 24 Oct 31 Nov. 7 Nov 14 Nov 21 Opponent FORDHAM at #17 Massachusetts at CONNECTICUT at Brown TOWSON HOFSTRA at #4 Villanova #5 WILLIAM AND MARY at New Hampshire at Maine NORTHEASTERN * CAA Contest Result W L L L L L L L L L L Score 41-28 10-30 10-52 20-28 28-36 16-28 7-36 14-39 42-55 17-41 27-33 Attendance 2731 12124 38620 3214 3314 5159 5517 5117 4643 3517 2610 TEAM STATISTICS URI 232 (21.1 avg.) 153 987 2.8 89.7 9 2228 (202.5 avg.) 18 3215 (292.3 avg.) 68-1296 3-13 11-176 19.1 4.3 16.0 18-9 71-699 63.5 75-3038 40.5 33.3 29:12 38/157 (24%) 13/23 (57%) 21-115 31 7-9 19-28 (68%) SCORING FIRST DOWNS RUSHING YARDAGE Average Per Rush Average Per Game TDs Rushing PASSING YARDAGE TDs Passing TOTAL OFFENSE KICK RETURNS: #-Yards PUNT RETURNS: #-Yards INT RETURNS: #-Yards KICK RETURN AVERAGE PUNT RETURN AVERAGE INT RETURN AVERAGE FUMBLES-LOST PENALTIES-Yards Average Per Game PUNTS-Yards Average Per Punt Net punt average TIME OF POSSESSION/Game 3RD-DOWN Conversions 4TH-DOWN Conversions SACKS BY-Yards TOUCHDOWNS SCORED FIELD GOALS-ATTEMPTS RED-ZONE SCORES Name Cassidy Hughes Ferrer Lawrence Stefkovich Total Opponents PUNT RETURNS Name Johnson-Farrell Glenn Leonard Total Opponents RUSHING Player Ferrer Isijola Lawrence Stefkovich Bellini Paul-Etienne Law Jr. Lang TEAM Total Opponents G 10 6 2 11 11 11 G 11 10 11 6 11 10 8 9 7 11 11 Eff. 120.07 133.00 0.00 0.00 121.99 157.58 No. 104 85 43 15 1 90 4 1 6 349 453 Comp.-Att.-Int. 143-268-7 38-69-0 0-1-0 0-1-0 181-339-7 208-300-11 Gain 428 407 177 71 35 266 10 0 0 1394 2359 Loss 17 42 22 36 0 252 7 1 30 407 335 Pct. 53.4 55.1 0.0 0.0 53.4 69.3 Net Yards 411 365 155 35 35 14 3 -1 -30 987 2024 Yards 1745 483 0 0 2228 2628 Avg. 4.0 4.3 3.6 2.3 35.0 0.2 0.8 -1.0 -5.0 2.8 4.5 No. 47 38 23 18 17 9 6 6 5 3 3 3 1 1 1 181 208 G 12 12 12 10 5 12 12 Name Williams Lawrence Alexis Glenn Law Jr. Leonard Bellini Johnson-Farrell Isijola Mancuso Harris Total Opponents TD 14 4 0 0 18 20 Long 72 55 0 0 72 89 Yd/G 174.5 80.5 0.0 0.0 202.5 238.9 No. 1 1 1 3 37 TD 5 1 0 0 0 3 0 0 0 9 33 Long 68 48 20 15 35 29 8 9 4 68 57 YPG 37.4 36.5 14.1 5.8 3.2 1.4 0.4 -0.1 -4.3 89.7 184.0 No. 14 11 9 8 8 6 4 4 2 1 1 68 35 INTERCEPTION RETURNS Name Williams Urban Mitchell Weedon Dace Damon Foster Adesanya Total Opponents W W W. G O R H O D Y. C O M No. 4 1 1 1 1 1 1 1 11 7 Yards 858 506 273 164 149 30 87 62 24 47 18 10 6 1 -7 2228 2628 Plays 566 139 45 20 20 827 745 KICKOFF RETURNS INDIVIDUAL STATISTICS Name Paul-Etienne Stefkovich TEAM Edger Total Opponents G 11 11 11 11 11 10 4 10 4 9 11 8 6 4 10 11 11 TOTAL OFFENSE OPP 406 (36.9 avg.) 235 2024 4.5 184.0 33 2628 (238.9 avg.) 20 4652 (422.9 avg.) 35-765 37-377 7-78 21.9 10.2 11.1 32-15 70-537 48.8 40-1600 40.0 38.2 30:32 69/143 (48%) 6/16 (38%) 25-184 53 12-15 44-52 (85%) 1st 2nd 3rd 4th Total Rhode Island........ 65 54 65 48 - 232 Opponents........... 99 97 112 98 - 406 PASSING Name Leonard Bynum Bellini Lawrence Wilson Isijola Johnson-Farrell Del Grosso Evans Lang Ferrer Law Jr. Migliarese Turner Paul-Etienne Total Opponents Avg. 18.3 13.3 11.9 9.1 8.8 3.3 14.5 10.3 4.3 15.7 6.0 3.3 6.0 1.0 -7.0 12.3 12.6 Rush 75 469 195 59 -17 818 2179 TD 11 2 1 1 2 0 0 0 0 0 0 0 1 0 0 18 20 Pass 2759 0 0 0 68 2861 2598 Long 72 66 26 55 25 13 40 20 9 26 9 9 6 1 0 72 89 Avg/G 78.0 46.0 24.8 14.9 13.5 3.0 21.8 6.2 6.0 5.2 1.6 1.2 1.0 0.2 -0.7 202.5 238.9 Total 2834 469 195 59 51 3679 4777 Avg/G 236.2 39.1 16.2 5.9 10.2 306.6 398.1 Yds 3 5 5 13 377 Avg 3.0 5.0 5.0 4.3 10.2 TD 0 0 0 0 0 Long 3 5 5 5 69 Yds 286 184 179 162 151 102 60 114 23 11 24 1296 765 Avg 20.4 16.7 19.9 20.2 18.9 17.0 15.0 28.5 11.5 11.0 24.0 19.1 21.9 TD 0 0 0 0 0 0 0 0 0 0 0 0 0 Long 48 21 25 36 30 26 17 70 12 11 24 70 76 Yds 34 -2 20 4 0 75 45 0 176 78 Avg 8.5 -2.0 20.0 4.0 0.0 75.0 45.0 0.0 16.0 11.1 TD 0 0 0 0 0 1 1 0 2 0 Long 29 0 20 4 0 75 45 0 75 33 63 2009 SEASON REVIEW PUNTING Name Edger Feinstein Leonard Team Total Opponents No. 71 2 1 1 75 40 FIELD GOALS Name Feinstein Total Opponents FG-FGA 7-9 11-18 11-17 Pct. 77.7 61.1 64.7 Yds 2946 49 43 0 3038 1600 11-19 0-0 0-0 0-0 Avg 45.1 24.5 43.0 0.0 40.5 40.0 20-29 0-0 5-5 4-5 30-39 0-0 2-6 3-3 Long 68 25 43 0 68 71 40-49 0-0 4-6 1-2 DEFENSIVE STATISTICS Blkd 1 0 0 0 1 0 50-plus 0-0 0-1 0-1 Lg 39 39 47 Blkd 0 0 0 URI Field Goals Made - 25, 25, 38, 28, 31, 39, 38 URI Field Goals Missed - 39, 34 KICKING Name Feinstein Edger Total Opponents XPTS Att-Made 25-27 0-0 25-27 46-50 Pct. 92.5 0.0 92.5 92.0 TD 11 0 5 3 2 2 1 1 1 1 1 1 1 1 31 53 FGs 0-0 7-9 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-0 7-9 12-15 SCORING Name Leonard Feinstein Ferrer Paul-Etienne Bynum Wilson Miliarese Foster Isijola Williams Lawrence Bellini Weedon Damon Total Opponents No. 44 4 48 76 Yds 2367 219 2586 4453 Kickoffs Avg. 53.8 54.8 53.9 58.6 |-------------- PATs --------------| Kick Rush Rcv 0-0 0-0 0 25 25-27 0-0 0 46-50 1-2 1 TB 3 1 4 5 Pass 0-0 0-0 0-0 0-0 0-1 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-0 0-4 1-1 DXP 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Saf 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 Points 66 46 30 18 12 12 6 6 6 6 6 6 6 6 232 406 Name Rob Damon Matt Hansen Jarrod Williams Joe Harris Steve Weedon Rodney Mitchell Willie McGinnis Dan O’Connell Victor Adesanya Robenson Alexis Matt Rae Jordan Dalton Chris Mancuso Evan Shields Ellis Foster Terry Glenn Devon Dace Matt Urban Joe Bellini Kyle Elliott Alex Francois Brandon Bramwel Matt Sheard Anthony Ferrer Andrew Belizair Ayo Isijola Jason Foster Devin Johnson D.J. Stefkovich Trevor Turner Tom Lang David Wilson Chris Paul-Etienne Louis Feinstein Kenny Smith Tim Edger Alex Frazier Team Mannee Williams Total GP 11 10 11 11 10 10 11 10 11 9 11 10 9 4 5 6 4 5 11 9 5 8 7 11 4 10 10 10 6 4 9 11 10 11 2 11 2 4 3 11 Solo 60 62 46 37 39 38 20 24 23 14 11 17 6 7 10 8 6 6 7 3 6 5 2 2 . 2 2 . 1 1 . 1 1 . 1 . 1 1 . 470 Ast Total 64 124 41 103 19 65 21 58 19 58 17 55 21 41 15 39 11 34 17 31 15 26 7 24 6 12 5 12 2 12 3 11 4 10 3 9 2 9 4 7 1 7 2 7 2 4 2 4 2 2 . 2 . 2 2 2 . 1 . 1 1 1 . 1 . 1 1 1 . 1 1 1 . 1 . 1 1 1 311 781 TFL/Yds 14.0-37 11.5-35 . 6.5-22 8.0-37 1.0-3 6.5-16 1.5-3 6.5-38 1.0-2 2.5-8 1.0-1 0.5-0 0.5-1 1.5-6 . 1.0-3 1.0-7 1.0-12 1.0-1 . 1.0-1 0.5-1 . . . . . . . . . . . . . 1.0-5 . . 69-239 Sacks No-Yds Int-Yds BrUp Rcv-Yds FF Saf 2-14 1-75 . 2-45 3 . 4-24 . 2 . 1 . . 4-34 2 1-68 1 . 1-9 . . 1-0 3 . 5-31 1-4 . 2-15 5 . . 1-20 6 . 1 . 1-6 . . 1-0 1 . . . 2 1-14 . . 4-16 1-0 1 1-0 3 . . . 1 1-0 . . 1-4 . . 2-0 . . . . . 1-0 . . . . . . . . . . . . . . . 1-45 . . 1 . . . 3 . . . 1-0 . . . . . 1-7 1-2 . . . . . . . 1-4 . . 1-1 . . . . . . . 1 . . . . . . 1 . . . . . . . . . . . . . . . . 1 . . . . . . . . . . . . . . . . . . 1-0 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-5 . . . . . . . . . 1 . . . . . . . 21-115 11-176 19 15-146 20 . 2009 POSTSEASON HONORS ROB DAMON TOM LANG Sports Network All-America Third Team All-CAA Football Third Team CAA Academic All-Conference Team TIM EDGER CAA Academic All-Conference Team WILLIE McGINNIS All-CAA Football Second Team SHAWN LEONARD All-CAA Football Third Team MICHAEL FARR D.J. STEFKOVICH CAA Academic All-Conference Team CAA Academic All-Conference Team LOUIS FEINSTEIN BRANDON WILLIAMS CAA Academic All-Conference Team CAA Academic All-Conference Team MATT GREENHALGH GREG WICKS CAA Academic All-Conference Team CAA Academic All-Conference Team Rob Damon led the Rams with 124 total tackles in 2009 64 MATT RAE CAA Academic All-Conference Team CoSida Academic All-District W W W. G O R H O D Y. C O M 2009 SEASON REVIEW GAME 1 (1-0 overall; 0-0 CAA) GAME 2 (1-1 overall; 0-1 CAA) Massachusetts 30, Rhode Island 10 Rhode Island 41, Fordham 24 Sept. 5, 2009 - Meade Stadium - Kingston, R.I. Fordham Rhode Island 0 17 7 17 7 7 14 0 URI - Ferrer one yard run (Feinstein Kick) - four plays, 21 yards, TOP 2:03 (1st) URI - Feinstein 25 yard field goal - eight plays, 65 yards, TOP 3:09 (1st) URI - Wilson three yard pass from Paul-Etienne (Feinstein Kick) - 10 plays, 80 yards, TOP 5:16 (1st) URI - Paul-Etienne 29 yard run (Feinstein Kick) - one play, 29 yards, TOP 0:07 (2nd) URI - Wilson five yard pass from Paul-Etienne (Feinstein Kick) - eight plays, 66 yards, URI - Feinstein 25 yard field goal - nine plays, 69 yards, TOP 4:14 (2nd) FORD - Skelton three yard run (Heinowitz Kick) - 10 plays, 80 yards, TOP 2:28 (2nd) URI - Weedon 15 yard fumble recovery (Feinstein Kick) (3rd) FORD - Skelton one yard run (Heinowitz Kick) - 13 plays, 80 yards, TOP 3:54 (3rd) FORD - Martin six yard run (Heinowitz Kick) - 13 plays, 80 yards, TOP 3:32 (4th) FORD - Caldwell nine yard pass (Heinowitz Kick) - nine plays, 84 yards, TOP 2:54 (4th) Fordham 23 34-122 302 424 3-40.7 6-4 6-30 22:26 Sept. 19, 2009 - McGuirk Stadium - Amherst, Mass. - 28 41 0 7 0 14 10 3 0 6 - 10 30 UMASS - Zardas four yard pass from Havens (Cuko Kick) - 12 plays, 67 yards, TOP 5:48 (1st) UMASS - Cruz five yard pass from Havens (Cuko Kick) - 13 plays, 80 yards, TOP 6:39 (2nd) UMASS - Nelson three yard run (Cuko Kick) - 10 plays, 71 yards, TOP 4:50 (2nd) URI - Williams 68 yard fumble recovery (Feinstein Kick) (3rd) UMASS - Cuko 22 yard field goal (Feinstein Kick) - five plays, 44 yards, TOP 1:05 (3rd) URI - Feinstein 38 yard field goal - 12 plays, 47 yards, TOP 5:19 (3rd) UMASS - Cuko 37 yard field goal - seven plays, 66 yards, TOP 2:45 (4th) UMASS - Cuko 42 yard field goal - nine plays 58 yards, TOP 4:07 TOP 3:37 (2nd) Team Statistics First Downs Rushes-Yards Passing Yards Total Offense Punts-Avg. Fumbles-Lost Penalties-Yards Time of Possession Rhode Island Massachusetts Rhode Island 21 43-229 226 455 4-42.8 0-0 8-72 37:34 Individual Statistics Rushing (Att.-Yds): URI - Paul-Etienne 11-81; Ferrer 16-53; Bellini 1-35. FORD - J. Skelton 13-54; Martin 12-47; Whiting 7-21. Passing (Comp-Att-Int-Yards-Td): URI - Paul-Etienne 13-19-0-164-2; Stefkovich 4-7-0-62-0. FORD - J. Skelton 28-42-1-302-1. Receiving (Rec-Yards): URI - Bynum 4-99; Johnson-Farrell 3-59; Bellini 3-37. FORD - Caldwell 8-102; S. Skelton 7-90; Lucas 5-53. Rhode Island 18 25-70 198 267 6-40.5 1-0 6-44 27:57 Team Statistics First Downs Rushes-Yards Passing Yards Total Offense Punts-Avg. Fumbles-Lost Penalties-Yards Time of Possession Massachusetts 21 39-162 329 491 2-54.0 4-2 5-37 32:03 Individual Statistics Rushing (Att.-Yds): URI - Ferrer 9-41; Isijola 7-17; Law Jr. 2-7. UMASS - Nelson 29-158; Hernandez 4-6; Igwenagu 1-1. Passing (Comp-Att-Int-Yards-Td): URI - Paul-Etienne 20-39-1-164-0. UMASS - Havens 22-30-1-329-2. Receiving (Rec-Yards): URI - Lawrence 4-17; Bellini 3-53; Leonard 3-28; Johnson-Farrell 3-28. UMASS - Cruz 6-96; Sanford 3-76; Talley 3-69. Tackles (UA-A- Total - Sacks): URI - Damon (3-13-16-0); Hansen (7-7-14-1); Harris (6-6-12-0). UMASS - Harrington (3-4-7-0.5); Dickson (2-5-7-0); Filler (3-3-6-0). Tackles (UA-A- Total - Sacks): URI - Damon (9-2-11-0); Hansen (6-1-7-0); Shields (5-2-7-0). FORD - Allen (8-0-8-0); Stuckey (7-1-8-0); Wright (4-1-5-0). GAME 3 (1-2 overall; 0-1 CAA) GAME 4 (1-3 overall; 0-1 CAA) Sept. 26, 2009 - Rentschler Field - East Hartford, Conn. Oct. 3, 2009 - Brown Stadium - Providence, R.I. Brown 28, Rhode Island 20 Connecticut 52, Rhode Island 10 Rhode Island Connecticut 7 14 0 10 0 14 3 14 - 10 52 Team Statistics First Downs Rushes-Yards Passing Yards Total Offense Punts-Avg. Fumbles-Lost Penalties-Yards Time of Possession 7 6 7 8 0 14 6 0 - 20 28 URI - Ferrer 68 yard run (Feinstein Kick) - two plays, 83 yards, TOP :36 (1st) BROWN - Farnham 32 yard from Newhall (Plichta rush failed) - six plays, 68 yards, TOP 2:53 (1st) URI - Damon 75 yard interception return (Feinstein Kick) (2nd) BROWN - Farnham 42 yard pass from Newhall (Samp pass from Newhall) - one play, 42 yards, TOP :09 (2nd) BROWN - Sewell 13 yard pass from Newhall (Plichta Kick) - one play, 13 yards, TOP :06 (3rd) BROWN - Sewell five yard run (Plichta Kick) - one play, five yards, TOP :05 (3rd) URI - Lawrence 55 yard pass from Stefkovich (Feinstein Kick Blocked) - one play, 55 yards, TOP :13 (4th) UCONN - Dixon 18 yard pass from Endres (Teggart Kick) - five plays, 66 yards, TOP 1:58 (1st) UCONN - Todman three yard run (Teggart Kick) - three plays, 37 yards, TOP :58 (1st) URI - Bynum 66 yard pass from Paul-Etienne (Feinstein Kick) - three plays, 69 yards, TOP 1:40 (1st) UCONN - Todman eight yard run (Teggart Kick) - 11 plays, 67 yards, TOP 4:50 (2nd) UCONN - Teggart 19 yard field goal - eight plays, 51 yards, TOP 2:16 (2nd) UCONN - Todman two yard run (Teggart Kick) - 12 plays, 60 yards, TOP 5:25 (3rd) UCONN - Lang 50 yard pass from Endres (Teggart Kick) - two plays, 52 yards, TOP :39 (3rd) UCONN - Frey 13 yard run (Teggart Kick) - 13 plays, 98 yards, TOP 5:48 (4th) URI - Feinstein 28 yard field goal - four plays, one yard, TOP :59 (4th) UCONN - Frey 54 yard run (Teggart Kick) - one play, 54 yards, TOP :22 (4th) Rhode Island 5 32-29 119 148 8-43.1 1-1 2-15 30:34 Rhode Island Brown Connecticut 25 42-199 289 488 3-46.3 7-3 2-21 29:26 Individual Statistics Rushing (Att.-Yds): URI - Ferrer 9-21; Lawrence 6-12; Isijola 7-7. UCONN - Dixon 17-98; Todman 15-70; Frey 5-69. Passing (Comp-Att-Int-Yards-Td): URI - Paul-Etienne 12-19-2-108-1; Stefkovich 2-4-0-11-0. UCONN - Endres 23-30-0-289-2. Receiving (Rec-Yards): URI - Leonard 4-21; Bynum 3-66; Lawrence 3-7. UCONN - Smith 8-82; Moore 4-38; Lang 2-58. Rhode Island 13 36-202 214 416 10-40.2 4-2 17-164 31:45 Team Statistics First Downs Rushes-Yards Passing Yards Total Offense Punts-Avg. Fumbles-Lost Penalties-Yards Time of Possession Brown 14 33-125 170 295 8-40.9 1-0 12-76 28:15 Individual Statistics Rushing (Att.-Yds): URI - Ferrer 10-76; Isijola 11-68; Stefkovich. BROWN - Tronti 16-64; Theodhosi 3-28; Sewall 6-22. Passing (Comp-Att-Int-Yards-Td): URI - Stefkovich 17-30-0-214-1. BROWN - Newhall 14-26-3-170-3. Receiving (Rec-Yards): URI - Lawrence 6-119; Leonard 2-50; Bynum 2-26. BROWN - Farnham 5-100; Tronti 3-21; Sewall 2-28. Tackles (UA-A- Total - Sacks): URI - Hansen (7-2-9-1); Damon (5-3-8-0); Williams (7-0-0-0). BROWN - Cruz (7-2-9-0); Perkins (2-7-9-0); Neff (4-1-5-0). Tackles (UA-A- Total - Sacks): URI - Damon (8-11-19-0); Hansen (4-9-13-1); Williams (8-3-11-0). UCONN - Wilson (7-5-12-2); Howard (7-1-8-0); Lloyd (3-5-8-0). W W W. G O R H O D Y. C O M 65 2009 SEASON REVIEW GAME 5 (1-4 overall; 0-2 CAA) GAME 6 (1-5 overall; 0-3 CAA) Oct. 10, 2009 - Meade Stadium - Kingston, R.I. Oct. 17, 2009 - Meade Stadium - Kingston, R.I. Towson 36, Rhode Island 28 Towson Rhode Island 20 14 9 7 0 7 7 0 Hofstra 28, Rhode Island 16 - 36 28 TU - Moore 78 yard pass from Athens (Magas Kick Failed) - two plays, 80 yards, TOP :50 (1st) TU - Dameron five yard run (Magas Kick) - two plays, 34 yards, TOP :43 (1st) TU - Dameron three yard run (Magas Kick) - six plays, 29 yards, TOP 2:54 (1st) URI - Isijola 48 yard run (Feinstein Kick) - three plays, 63 yards, TOP 1:12 (1st) URI - Leonard 35 yard pass from Stefkovich (Feinstein Kick) - four plays, 37 yards, TOP 1:36 (1st) TU - Dameron six yard run (Dameron rush failed) - two plays, 42 yards, TOP :39 (2nd) URI - Leonard seven yard pass from Stefkovich (Feinstein Kick) - three plays, eight yards, TOP :44 (2nd) TU - Magas 27 yard field goal - eight plays, 50 yards, TOP 1:08 URI - Migliarese six yard pass from Stefkovich (Feinstein Kick) - 10 plays, 71 yards, TOP 5:16 (3rd) TU - Athens 35 yards run (Magas Kick) - seven plays, 54 yards, TOP 3:34 (4th) Towson 15 37-135 188 323 3-34.0 1-0 8-52 27:47 Team Statistics First Downs Rushes-Yards Passing Yards Total Offense Punts-Avg. Fumbles-Lost Penalties-Yards Time of Possession Hofstra Rhode Island 7 0 0 3 14 0 7 13 - 28 16 HU - Benjamin one yard run (Greco Kick) - eight plays, 67 yards, TOP 4:12 (1st) URI - Feinstein 31 yard field goal - nine plays, 41 yards, TOP 3:35 (2nd) HU - Nelson 89 yard pass from Probst (Greco Kick) - three plays, 90 yards TOP 1:40 (3rd) HU - Probst 29 yard run (Greco Kick) - three plays, 60 yards, TOP 2:05 (3rd) URI - Ferrer one yard run (Paul-Etienne pass failed) - seven plays, 72 yards, TOP 2:15 (4th) HU - Maysonet 24 yard run (Greco Kick) - five plays, 40 yards, TOP 2:32 (4th) URI - Paul-Etienne 10 yard run (Feinstein Kick) - six plays, TOP 1:00 (4th) Rhode Island 15 42-166 163 329 6-38.5 4-3 7-63 32:13 Individual Statistics Rushing (Att.-Yds): URI - Isijola 15-100; Ferrer 18-78; Lawrence 2-6. TU - Athens 13-74; Booker 8-37; Dameron 14-34. Passing (Comp-Att-Int-Yards-Td): URI - Stefkovich 11-20-0-163-3. TU - Athens 11-21-2-188-1. Receiving (Rec-Yards): URI - Leonard 4-96; Wilson 2-23; Bellini 1-18. TU - Moore 4-91; Newsom 3-19; Ryan 2-50. Hofstra 21 46-189 223 412 1-31.0 4-0 7-109 34:38 Team Statistics First Downs Rushes-Yards Passing Yards Total Offense Punts-Avg. Fumbles-Lost Penalties-Yards Time of Possession Rhode Island 14 25-32 207 239 5-41.6 2-1 9-140 25:03 Individual Statistics Rushing (Att.-Yds): URI - Isijola 7-24; Ferrer 8-10; Lawrence 2-2. HU - Maysonet 13-83; Probst 7-60; Benjamin 5-42. Passing (Comp-Att-Int-Yards-Td): URI - Paul-Etienne 19-32-1-207-0. HU - Christopher 11-15-0-111-0; Probst 4-6-0-112-1. Receiving (Rec-Yards): URI - Bynum 6-75; Leonard 5-40; Bellini 4-54. HU - Weaver 5-76; Nelson 4-117; Dennis 2-12. Tackles (UA-A- Total - Sacks): URI - Hansen (10-2-12-0); Damon (7-5-12-1); Williams (4-3-7-0). HU - Hudeen (6-17-0); Jackman (6-0-6-0); Bonus (4-0-4-0). Tackles (UA-A- Total - Sacks): URI - Weedon (7-0-7-2); Harris (6-1-7-0); Damon (6-0-6-0). TU - Butt (6-2-8-0); White (5-3-8-0); Beltre (6-0-6-0). GAME 8 (1-7 overall; 0-5 CAA) GAME 7 (1-6 overall; 0-4 CAA) William and Mary 39, Rhode Island 14 Villanova 36, Rhode Island 7 Oct. 31, 2009 - Meade Stadium - Kingston, R.I. Oct. 24, 2009 - Villanova Stadium - Villanova, Pa. Rhode Island Villanova 0 7 0 14 7 7 0 8 - 7 36 VU - Szczur one yard run (Yako Kick) - 11 plays, 82 yards, TOP 5:55 (1st) VU - Ball four yard run (Yako Kick) - four plays, 37 yards, TOP 1:41 (2nd) VU - Reynolds three yard run (Yako Kick) - 10 plays, 82 yards, TOP 4:36 (2nd) URI - Bynum from Paul-Etienne (Feinstein Kick) - nine plays, 46 yards, TOP 3:47 (3rd) VU - Harvey 20 yard pass from Whitney (Yako Kick) - seven plays, 80 yards, TOP 3:54 (3rd) VU - Doss six yard run (Farmer rush) - 14 plays, 80 yards, TOP 8:12 (4th) Rhode Island 10 22-30 121 151 7-39.7 1-0 3-25 23:39 Team Statistics First Downs Rushes-Yards Passing Yards Total Offense Punts-Avg. Fumbles-Lost Penalties-Yards Time of Possession Villanova 28 57-376 124 500 2-32.5 3-2 5-44 36:21 Individual Statistics Rushing (Att.-Yds): URI - Isijola 4-36; Ferrer 5-6; Lawrence 2-4. VU - Whitney 17-124; Ball 14-99; Doss 6-64. Passing (Comp-Att-Int-Yards-Td): URI - Paul-Etienne 15-33-0-121-1. VU - 11-15-1-121-1. Receiving (Rec-Yards): URI - Bynum 5-40; Bellini 3-15; Leonard 2-21. VU - Harvey 7-77; Reynolds 2-5; Szczur 1-22. Tackles (UA-A- Total - Sacks): URI - Weedon (12-2-14-1); Dace (6-1-7-0); Hansen (5-2-7-0). VU - Thomas (6-0-6-1); Dempsey (5-0-5-0); Kukucka (4-1-5-0). William and Mary Rhode Island 7 7 14 0 9 0 9 7 - 39 14 URI - Leonard five yard pass from Paul-Etienne (Feinstein Kick) - eight plays, 26 yards, TOP 3:02 (1st) W&M - Marriner nine yard run (Pate Kick) - four plays, 36 yards, TOP 1:59 (1st) W&M - Riggins 18 yard run (Pate Kick) - seven plays 70 yards, TOP 2:56 (2nd) W&M - Varno four yard pass from Archer (Pate Kick) - 13 plays, 67 yards, TOP 3:13 (2nd) W&M - Marriner 16 yard run (Pate Kick Failed) - eight plays, 67 yards, TOP 3:47 (3rd) W&M - Pate 19 yard field goal - 11 plays, 74 yards, TOP 5:24 (3rd) W&M - Marriner 39 yard run (Pate Kick) - one play, 39 yards, TOP 0:11 (4th) W&M - O’Brien safety URI - Leonard 29 yard pass from Paul-Etienne (Feinstein Kick) - five plays, 73 yards, TOP 1:06 (4th) William and Mary 21 44-199 175 374 6-48.7 1-1 8-60 32:19 Team Statistics First Downs Rushes-Yards Passing Yards Total Offense Punts-Avg. Fumbles-Lost Penalties-Yards Time of Possession Rhode Island 11 28-(-)46 195 149 10-41.5 2-0 4-23 27:41 Individual Statistics Rushing (Att.-Yds): URI - Isijola 10-11; Lawrence 2-1; Ferrer 2-(-2). W&M - Marriner 9-93; Grimes 18-54; Riggins 7-34. Passing (Comp-Att-Int-Yards-Td): URI - Paul-Etienne 19-34-0-195-2. W&M - Archer 18-23-0-175-1. Receiving (Rec-Yards): URI - Bynum 6-53; Leonard 5-49; Bellini 4-42. W&M - Dohse 6-76; Varno 4-27; Hill 3-44. Tackles (UA-A- Total - Sacks): URI - Hansen (10-6-16-0); Damon (3-8-11-0); O’Connell (7-3-10-0). W&M - Francks (5-1-6-0); Tracy (4-2-6-1); Stover (4-0-4-1). 66 W W W. G O R H O D Y. C O M 2009 SEASON REVIEW GAME 9 GAME 10 (1-9 overall; 0-7 CAA) (1-8 overall; 0-6 CAA) New Hampshire 55, Rhode Island 42 Maine 41, Rhode Island 17 Nov. 7, 2009 - Cowell Stadium - Durham, N.H. Rhode Island New Hampshire 10 14 6 14 14 10 12 17 Nov. 14, 2009 - Alfond Stadium - Orono, Maine - 42 55 URI - Paul-Etienne one yard run (Feinstein Kick) - nine plays, 71 yards, TOP 3:56 (1st) UNH - Kackert 57 yard run (Manning Kick) - four plays, 70 yards, TOP 1:30 (1st) URI - Feinstein 39 yard field goal - eight plays, 11 yards, TOP2:14 (1st) UNH - Jellison two yard run (Manning Kick) - five plays, 60 yards, TOP 1:41 (1st) UNH - Sicko 24 yard pass from Toman (Mainning Kick) - 10 plays, 76 yards, TOP 3:22 (2nd) UNH - Jellison two yard run (Manning Kick) - 13 plays, 81 yards, TOP 4:26 (2nd) URI - Ferrer one yard run (Leonard Pass Failed) - six plays, 41 yards, TOP 2:41 (2nd) UNH - Kackert 47 yard run (Manning Kick) - four plays, 66 yards, TOP 0:54 (3rd) URI - Leonard 30 yard pass from Paul-Etienne (Feinstein Kick) - eight plays, 77 yards, TOP 4:06 (3rd) URI - Bellini 20 yard pass from Paul-Etienne (Feinstein Kick) - three plays, 19 yards, TOP 1:34 (3rd) UNH - Manning 42 yard field goal - four plays, six yards, TOP 1:34 (3rd) URI - Leonard 72 yard pass from Paul-Etienne (Paul-Etienne Pass Failed) - three plays, 80 yards, TOP 1:18 (4th) UNH - Jeannot 53 yard pass from Toman (Manning Kick) - four plays, 71 yards, TOP 0:58 (4th) UNH - Jellison four yard run (Manning Kick) - one play, four yards, TOP 0:04 (4th) URI - Leonard 13 yard pass from Paul-Etienne (Paul-Etienne Pass Failed) - six plays, 72 yards, TOP 1:53 (4th) UNH - Manning 47 yard field goal - seven plays, 18 yards, TOP 2:35 (4th) Rhode Island 20 38-111 424 535 5-36.0 3-1 6-72 35:12 Team Statistics First Downs Rushes-Yards Passing Yards Total Offense Punts-Avg. Fumbles-Lost Penalties-Yards Time of Possession Rhode Island Maine 3 7 7 0 7 21 0 13 - 17 41 URI - Feinstein Kick 38 yard field goal - 14 plays, 46 yards, TOP 6:22 (1st) MAINE - Williams 10 yard pass from Treister (Hesseltine Kick) - 10 plays, 70 yards, TOP 6:10 (1st) URI - Leonard 35 yard pass from Paul-Etienne (Feinstein Kick) - eight plays, 78 yards, TOP 2:35 (2nd) MAINE - Brusko six yard pass from Treister (Hesseltine Kick) - four plays, 21 yards, TOP 1:15 (3rd) MAINE - Treister 23 yard run (Hesseltine Kick) - six plays, 74 yards, TOP 2:25 (3rd) URI - Foster 45 yard interception return (Feinstein Kick) MAINE - Williams 41 yard pass from Treister (Hesseltine Kick) - two plays, 72 yards, TOP 0:35 (3rd) MAINE - Williams 58 yard pass from Treister (Hesseltine Kick) - six plays, 73 yards, TOP 3:25 (4th) MAINE - Jones 18 yard pass from Treister (Hesseltine Kick) - eight plays, 74 yards, TOP 3:39 (4th) New Hampshire 22 45-262 234 496 4-25.2 2-2 5-35 24:42 Individual Statistics Rushing (Att.-Yds): URI - Isijola 13-66; Ferrer 7-47; Lawrence 3-10. UNH - Kackert 15-166; Toman 16-56; Jellison 9-22. Passing (Comp-Att-Int-Yards-Td): URI - Paul-Etienne 24-45-2-424-4. UNH - Toman 15-27-1-234-2. Receiving (Rec-Yards): URI - Leonard 10-275; Bynum 4-77; Bellini 3-37. UNH - Wright 5-65; Sicko 3-41; Orlando 2-18. Rhode Island 11 25-13 171 184 9-40.4 0-0 6-53 27:41 Team Statistics First Downs Rushes-Yards Passing Yards Total Offense Punts-Avg. Fumbles-Lost Penalties-Yards Time of Possession Maine 24 24-46 461 507 4-43.2 0-0 7-56 31:58 Individual Statistics Rushing (Att.-Yds): URI - Ferrer 5-19; Isijola 9-8; Lawrence 1-2. MAINE - Treister 12-33; Boone 6-8; Brown 2-4. Passing (Comp-Att-Int-Yards-Td): URI - Paul-Etienne 13-31-0-137-1; Stefkovich 3-6-0-34-0. MAINE - Treister 38-44-1-461-5. Receiving (Rec-Yards): URI - Leonard 6-102; Bynum 5-40; Isijola 2-14. MAINE - Williams 17-220; Jones 9-128; Brusko 9-57. Tackles (UA-A-Total-Sacks): URI - Damon (3-9-12-0); Weedon (5-5-10-0); O’Connell (5-4-9-0). MAINE - Dennis (3-6-9-0); Givans (3-4-7-0); Nani (1-5-6-0.5). Tackles (UA-A- Total - Sacks): URI - Damon (6-6-12-0); Hansen (4-4-8-0); Mitchell (3-5-8-0). UNH - Vasso (5-5-10-0); Jackson (2-8-10-0); Klein (4-4-8-0). GAME 11 (1-10 overall; 0-8 CAA) Northeastern 33, Rhode Island 27 Nov. 21, 2009 - Meade Stadium - Kingston, R.I. Northeastern Rhode Island 10 0 7 7 13 13 3 7 - 33 27 NU - John Griffin 10 yard run (Johnson Kick) - eight plays, 85 yards, TOP 4:02 (1st) NU - Johnson 29 yard field goal - four plays, five yards, TOP 1:30 (1st) URI - Leonard 28 yard pass from Paul-Etienne (Feinstein Kick) - five plays, 52 yards, TOP 2:19 (2nd) NU - Carroll 15 yard run (Johnson Kick) - 10 plays, 76 yards, TOP 5:01 (2nd) NU - Johnson 42 yard field goal - four plays, minus six yards, TOP 1:31 (3rd) URI - Ferrer two yard run (Feinstein Kick) - three plays, four yards, TOP 1:44 (3rd) NU - Johnson 42 yard field goal - nine plays, 52 yards, 4:16 (3rd) URI - Leonard 55 yard pass from Paul-Etienne (Feinstein Kick Failed) - two plays, 70 yards, TOP 0:31 (3rd) NU - Griffin 18 yard run (Johnson Kick) - two plays, 19 yards, TOP 0:46 (3rd) NU - Johnson 22 yard field goal - 17 plays, 84 yards, TOP 10:19 (4th) URI - Leonard 31 yard pass from Paul-Etienne (Feinstein Kick) - five plays, 67 yards, TOP 1:29 (4th) Northeastern 21 52-209 133 342 2-36.0 4-1 5-56 36:00 Team Statistics First Downs Rushes-Yards Passing Yards Total Offense Punts-Avg. Fumbles-Lost Penalties-Yards Time of Possession Rhode Island 15 147 191 338 5-40.2 1-1 3-24 21:48 Individual Statistics Rushing (Att.-Yds): URI - Lawrence 7-67; Ferrer 15-62; Paul-Etienne 10-18. NU - Griffin 28-154; Carroll 17-44; Torres 4-20. Passing (Comp-Att-Int-Yards-Td): URI - Paul-Etienne 8-16-1-191-3. NU - Carroll 9-12-0-73-0. Receiving (Rec-Yards): URI - Leonard 5-163; Bynum 1-17; Wilson 1-7. NU - Griffin 3-29; Conway 2-43; Batts 2-4. Tackles (UA-A- Total - Sacks): URI - Hansen (6-6-12-1); Weedon (6-4-10-1); Damon (6-4-10-1). NU - Akinniyi (5-05-1); Kenney (4-1-5-0.5); Catlin (4-0-4-0). W W W. G O R H O D Y. C O M 67 INDIVIDUAL RECORDS 4. 5. 6. SCORING POINTS SCORED 1. 2. 9. NAME Ed DiSimone Brian Forster Dameon Reilly Dameon Reilly Tony DiMaggio James Jenkins David Jamison Jayson Davis Dameon Reilly Dave Morrill Dameon Reilly James Jenkins Luther Green David Jamison Vince Nedimyer Jayson Davis Jayson Davis Jerell Jones D.J. Porter Jayson Davis Jayson Davis Derek Cassidy Jimmy Hughes Shawn Leonard Shawn Leonard POINTS SCORED 1. 2. 3. 6. 7. 8. 9. 10. NAME Dameon Reilly Dameon Reilly Brian Forster Brian Forster Pat Abbruzzi Skip Thomas Jayson Davis Jayson Davis Michael Griffin James Jenkins James Jenkins Jason Davis Derek Cassidy Shawn Leonard OPPONENT, DATE vs. Massachusetts, 10/16/54 vs. Connecticut, 11/16/85 vs. Connecticut, 11/16/85 vs. Lafayette, 10/26/85 vs. Akron, 11/30/85 vs. Hofstra, 10/17/98 vs. Richmond, 10/9/99 vs. Fordham, 9/4/04 vs. Connecticut, 11/17/84 vs. Howard, 9/14/85 vs. Lehigh, 10/12/85 vs. American Int'l, 8/31/96 vs. Hofstra, 9/8/01 vs. Brown, 9/29/01 vs. Hampton, 10/6/01 vs. Brown, 10/5/02 vs. Central Conn., 9/11/04 vs. Hofstra, 9/25/04 vs. Towson, 10/9/04 vs. William & Mary, 9/17/05 vs. Villanova, 10/22/05 vs. James Madison, 10/7/06 vs. New Hampshire, 10/27/07 vs. New Hampshire, 11/7/09 vs. Northeastern, 11/21/09 PTS 102 84 72 72 72 69 68 68 67 66 66 66 66 66 POINTS SCORED 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. GAME TOTAL 30 24 24 24 24 24 24 24 18 18 18 18 18 18 18 18 18 18 18 18 18 18 18 18 18 NAME Jayson Davis Dameon Reilly Matt Walker Brian Forster James Jenkins Chris Cassara Pat Abbruzzi David Jamison Shawn Leonard Derek Cassidy TOTAL 256 228 208 192 168 153 150 140 126 120 TOUCHDOWNS RUSHING 1. 2. 3. NAME Ed DiSimone James Jenkins James Jenkins Jayson Davis 16 Times 1. 2. 8. 10. NAME Pat Abbrizzi James Jenkins James Jenkins Jayson Davis Jayson Davis Jayson Davis Derek Cassidy John Newson David Jamison Duke Abbruzzi Jayson Davis TOUCHDOWNS RUSHING 1. 2. 3. 68 NAME Jayson Davis James Jenkins Pat Abbruzzi YEAR 1985 1984 1984 1985 1954 1993 2004 2005 1985 1996 1998 2002 2006 2009 CAREER YEARS 2002-05 1983-85 1995-98 1983-85 1996-98 1988-91 1951-54 1998-01 2006-09 2006-08 GAME TOTAL 5 4 4 4 3 TOUCHDOWNS RUSHING SEASON OPPONENT, DATE vs. Massachusetts, 10/16/54 vs. Brown, 10/3/98 vs. Hofstra,10/17/98 vs. Fordham, 9/4/04 last -Jimmy Hughes vs. New Hampshire, 10/27/07 TOTAL 12 11 11 11 11 11 11 10 10 9 9 TOTAL 42 27 25 SEASON YEAR 1954 1996 1998 2002 2004 2005 2006 1990 2001 1939 2003 CAREER YEARS 2002-05 1996-98 1951-54 8. 9. 10. David Jamison Derek Cassidy John Newson James Jenkins Jerell Jones Joe Casey Leroy Shaw David Jamison 23 20 17 17 16 16 15 13 TOUCHDOWNS RECEIVING 1. 5. NAME Dameon Reilly Brian Forster Dameon Reilly Tony DiMaggio Dameon Reilly Bobby Forster Bobby Apgar Dameon Reilly Grant Denniston Frank Geiselman Shawn Leonard Shawn Leonard 1. 2. 3. 6. 7. 8. NAME Dameon Reilly Dameon Reilly Brian Forster Brian Forster Bobby Apgar Shawn Leonard Tony DiMaggio Bobby Apgar Bobby Apgar Dameon Reilly Bob Donfield TOUCHDOWNS RECEIVING 1. 2. 3. 4. 5. 7. 9. 10. NAME Dameon Reilly Brian Forster Bobby Apgar Shawn Leonard Tony DiMaggio Darren Rizzi Frank Geiselman Cy Butler Bob Donfield T.J. DelSanto POINTS BY KICKING 1. 2. 5. 8. NAME Louis Feinstein Chris Cassara Skip Thomas Colin Gallagher Ralph Guerriero Skip Thomas LOUIS FEINSTEIN Ralph Guerriero Ralph Guerriero Chris Cassara Matt Walker Colin Gallagher Bryan Giannecchini POINTS BY KICKING 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME Skip Thomas Michael Griffin Colin Gallagher Matt Walker Ralph Guerriero Matt Walker LOUIS FEINSTEIN Matt Walker Shane Laisle Chris Cassara POINTS BY KICKING 1. 2. 3. 4. 6. 7. 8. 8. NAME Matt Walker Shane Laisle Chris Cassara Michael Griffin Colin Gallagher Skip Thomas Ralph Guerriero LOUIS FEINSTEIN Rick Viall GAME TOTAL 4 4 4 4 3 3 3 3 3 3 3 3 TOUCHDOWNS RECEIVING 1998-01 2005-08 1988-91 1996-97 2003-07 2005-09 1977-80 1999-2000 OPPONENT, DATE vs. Connecticut, 11/16/85 vs. Connecticut, 11/16/85 vs. Lafayette, 10/26/85 vs. Akron, 11/30/85 vs. Lehigh, 10/12/85 vs. Delaware, 9/12/87 vs. Maine, 9/10/94 vs. Connecticut, 11/17/84 vs. Vermont, 10/10/70 vs. Brown, 9/24/66 vs. New Hampshire, 11/7/09 vs. Northeastern, 11/21/09 SEASON TOTAL 17 14 12 12 12 11 9 7 7 7 7 YEAR 1985 1984 1984 1985 1994 2009 1985 1993 1995 1983 1984 CAREER TOTAL 38 32 26 21 15 15 14 14 13 11 YEARS 1983-85 1983-85; 1987 1993-95 2006-09 1982-85 1989-92 1965-67 1993-96 1983-87 1980-82 GAME TOTAL 13 12 12 12 11 11 11 10 10 10 10 10 10 OPPONENT, DATE vs. New Hampshire , 9/13/08 vs. Northeastern, 11/5/88 vs. Brown, 10/2/93 vs. Villanova, 10/22/05 vs. So. Connecticut, 10/23/82 vs. Maine, 10/16/93 vs. Fordham, 9/5/09 vs. Northeastern, 9/13/80 vs. Maine, 9/18/82 vs. Delaware, 9/17/88 vs. Massachusetts, 9/30/95 vs. Maine, 11/12/05 vs. Fordham, 9/1/07 TOTAL 69 67 65 63 60 59 56 52 52 51 TOTAL 208 165 144 111 111 109 104 102 77 W W W. G O R H O D Y. C O M 9. 10. Walter Christiansen Paul Stringfellow 70 67 1973-75 1983-85 RUSHING LONGEST RUSH 1. 2. 4. 6. 7. 8. 9. 10. NAME Pat Abbruzzi Danny Weed Wendall Williams Donald Brown John Newson Shundell Hicks James Jenkins Jerell Jones Derek Cassidy Rich Remondino RUSHES 1. 2. 3. 4. 5. 6. 8. NAME Frantzy Jourdain David Jamison Joe Casey Cy Butler David Jamison John Newson Rick Kelly Jon Rodgers Cal Whitfield Shyron Sanford David Jamison David Jamison Jason Ham RUSHES 1. 2. 5. 6. 7. 8. 9. 10. NAME Davis Jamison Cal Whitfield James Jenkins James Jenkins Joe Casey Jason Ham David Jamison Jason Ham Rich Kelly Jayson Davis RUSHES 1. 2. 3. 4. 5. 6. 7. NAME James Jenkins David Jamison Leroy Shaw Joe Casey Pat Abbruzzi Jason Ham Chris Poirier GAME YDS 99 95 95 89 89 87 86 84 80 74 OPPONENT, DATE vs. New Hampshire, 10/4/52 vs. Northeastern, 9/22/74 vs. Villanova, 10/11/03 vs. New Hampshire, 10/4/58 vs. Richmond, 10/14/91 vs. Northeastern, 11/17/92 vs. Hofstra, 10/17/98 vs. James Madison, 10/13/07 vs. Merrimack, 9/9/06 vs. Boston Univ., 10/26/74 TOTAL 46 45 41 37 36 35 35 33 33 33 33 33 33 OPPONENT, DATE vs. Maine, 10/16/93 vs. New Hampshire, 10/20/01 vs. Villanova, 10/22/05 vs. Brown, 10/2/93 vs. Northeastern, 10/21/00 vs. Brown, 9/22/90 vs. Massachusetts, 10/6/84 vs. Connecticut, 11/14/81 vs. Springfield, 11/20/82 vs. James Madison, 11/15/97 vs. Delaware, 8/30/01 vs. William & Mary, 10/13/01 vs. Hofstra, 11/15/03 GAME TOTAL 307 283 256 254 235 233 227 218 217 216 TOTAL 765 703 699 592 562 556 532 SEASON YEAR 1993 1985 2005 1998 1982 1995 2008 1996 2002 1990 CAREER YEARS 1995-98 2000-03 1988-91 1984-86 2004-06 1993-94 1979-82 2008- present 1977-78 Joe Casey ranks fourth on the URI career rushing yards list. SEASON YEAR 2001 1982 1997 1998 2005 2003 2000 2004 1984 2002 CAREER YEARS 1996-98 1998-01 1977-80 2005-09 1951-54 2001-04 1986-89 INDIVIDUAL RECORDS 8. 9. 10. Jayson Davis Jon Rodgers John Newson RUSHING YARDS 1. 2. 3. 4. 6. 7. 8. 9. 10. NAME Pat Abbruzzi David Jamison Pat Abbruzzi Jon Rodgers David Jamison Jayson Davis Jayson Davis Jeff West David Jamison Joe Casey 517 424 398 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME David Jamison Joe Casey James Jenkins Cal Whitfield Pat Abbruzzi Jason Ham David Jamison James Jenkins Rich Remondino James Jenkins 6. 7. 8. 9. 10. OPPONENT, DATE vs. New Hampshire, 10/4/52 vs. New Hampshire, 10/20/01 vs. Connecticut, 11/13/54 vs. Connecticut, 11/14/81 vs. Brown, 9/29/01 vs. Brown, 10/2/02 vs. Villanova, 10/22/05 vs. Northeastern, 11/19/05 vs. New Hampshire, 9/9/00 vs. Villanova, 10/22/05 YDS 1,320 1,245 1,206 1,200 1,189 1,119 1,065 1,032 1,008 977 RUSHING YARDS 1. 2. 3. 4. GAME YDS 306 260 306 197 197 194 189 179 172 172 RUSHING YARDS NAME Pat Abbruzzi James Jenkins David Jamison Jayson Davis Joe Casey Leroy Shaw Jason Ham Chris Poirier Jon Rodgers Shyron Sanford 2002-04 1977; 1979-80 1988-91 YDS 3,389 3,215 3,087 2,901 2,915 2,765 2,630 2,217 1,802 1,795 SEASON YEAR 2001 2005 1998 1982 1952 2003 2000 1997 1974 1996 CAREER YEARS 1951-54 1996-98 1998-01 2002-05 2005-PRES. 1977-80 2001-04 1986-89 1977; 1979-81 1995-98 PASSING LONGEST PASS COMPLETION 1. 2. 3. 4. 5. 6. 8. 9. 10. YDS - PLAYERS 98 - S. Monaco to E. Foster 95 - S. Crone to D. Weed 85 - S. Donovan to M. Rodgers 84 - D. Grimsich to J. Tolento 83 - D. Cassidy to J. Hughes 81 - L. Caswell to D. Narcessian 81 - C. Hixson to C. Butler 80 - D. Grimsich to T.J. DelSanto 79 - J. Weaver to S. Jacobs 78 - R. Bulgar to K. Gibson PASSES COMPLETED 1. 2. 4. 5. 6. 7. 8. 10. NAME Tom Ehrhardt Tom Ehrhardt Tom Ehrhardt Tom Ehrhardt Greg Farland Tom Ehrhardt Tom Ehrhardt Tom Ehrhardt Tom Ehrhardt Derek Cassidy Tom Ehrhardt Greg Farland Greg Farland PASSES COMPLETED 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. GAME NAME Tom Ehrhardt Tom Ehrhardt Derek Cassidy Greg Farland Chris Hixson Chris Hixson Chris Hixson Chris Hixson Dave Wienke Kevin Neville Tony Squitieri OPPONENT, DATE vs. Holy Cross, 9/3/88 vs. Northeastern, 9/22/73 vs. New Hampshire, 11/10/90 vs. Connecticut, 11/15/80 vs. New Hampshire, 9/13/08 vs. Vermont, 10/12/68 vs. Maine, 9/9/95 vs. Boston Univ. ,10/16/82 vs. Villanova, 11/21/98 vs. Hofstra, 10/17/98 GAME TOTAL 43 40 40 39 38 37 35 34 34 34 32 32 32 OPPONENT, DATE vs. Akron, 11/30/85 vs. Lehigh, 10/12/85 vs. Connecticut, 11/16/85 vs. Furman, 12/7/85 vs. Boston Univ., 10/18/86 vs. Massachusetts, 10/6/84 vs. New Hampshire, 11/2/85 vs. Richmond, 12/1/84 vs. Maine, 9/22/84 vs New Hampshire, 9/13/08 vs. Boston Univ., 10/19/85 vs. Towson State, 9/13/86 vs. Connecticut, 11/15/86 TOTAL 365 308 261 199 190 177 162 162 150 145 144 SEASON YEAR 1985 1984 2008 1986 1995 1994 1993 1996 1983 1990 1990 PASSES COMPLETED 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME Chris Hixson Tom Ehrhardt Derek Cassidy Tony Squitieri Steve Monaco Kevin Neville Bob Ehrhardt Larry Caswell Steve Tosches Steve Farland PASSES ATTEMPTED 1. 2. 3. 4. 5. 6. 7. 8. 10. NAME Tom Ehrhardt Tom Ehrhardt Greg Farland Tom Ehrhardt Tom Ehrhardt Tom Ehrhardt Tom Ehrhardt Larry Caswell Tom Ehrhardt Derek Cassidy Tom Ehrhardt NAME Tom Ehrhardt Tom Ehrhardt Derek Cassidy Greg Farland Dave Wienke Chris Hixson Tony Squitieri Chris Hixson Chris Hixson Kevin Neville PASSES ATTEMPTED 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME Tom Ehrhardt Chris Hixson Derek Cassidy Steve Monaco Larry Caswell Tony Squitieri Kevin Neville Greg Farland Bob Ehrhardt Dave Grimsich YEARS 1993-96 1984-85 2005-08 1992-94 1987-90 1987-90 1969-71 1966-68 1977-78 1984-86 GAME TOTAL 78 70 70 67 65 63 62 61 61 61 60 PASSES ATTEMPTED 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. CAREER TOTAL 691 673 409 280 275 260 255 242 224 214 OPPONENT, DATE vs. Furman 12/7/85 vs. Akron 11/30/85 vs. Brown 10/18/86 vs. Brown 9/28/85 vs. Lehigh 10/12/85 vs. Boston Univ. 10/19/85 vs. New Hampshire 11/2/85 vs. Maine 9/20/86 vs. Montana State 12/8/84 vs. New Hampshire 9/13/08 vs. Connecticut 11/16/85 SEASON TOTAL 645 536 440 397 338 330 302 295 285 276 YEAR 1985 1984 2008 1986 1983 1995 1992 1994 1996 1990 CAREER TOTAL 1,181 1,179 741 586 569 563 544 525 502 483 YEARS 1984-85 1993-96 2005-08 1987-90 1966-68 1991-94 1987-90 1984-86 1969-71 1980-82 PASSING PERCENTAGE (minimum 10 completions) NAME 1. Jeff Weaver 2. Derek Cassidy 3. Steve Tosches 4. Steve Tosches Chris Hixson 6. Steve Tosches 7. Chris Hixson 8. Tom Ehrhardt 9. Derek Cassidy 10. Tom Ehrhardt 1. 2. 3. 4. 5. 6. NAME Chris Hixson Steve Tosches Tom Ehrhardt Derek Cassidy Bob Ehrhardt Greg Farland Tony Squitieri YARDS PASSING 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 10. NAME Tom Ehrhardt Tom Ehrhardt Tom Ehrhardt Tom Ehrhardt Tom Ehrhardt Tom Ehrhardt Derek Cassidy Tom Ehrhardt CHRIS PAUL-ETIENNE Tom Ehrhardt Tom Ehrhardt .473 (210-444) .469 (275-586) .466 (153-328) 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME Tom Ehrhardt Tom Ehrhardt Derek Cassidy Chris Hixson Chris Hixson Chris Hixson Dave Wienke Ken Mastrole Kevin Neville Greg Farland NAME Chris Hixson Tom Ehrhardt Derek Cassidy Tony Squitieri Kevin Neville Bob Ehrhardt Larry Caswell Jayson Davis Dave Grimsich Steve Monaco TOUCHDOWN PASSES 1. 2. NAME Tom Ehrhardt Derek Cassidy Tom Ehrhardt Tom Ehrhardt Tom Ehrhardt OPPONENT, DATE vs. Connecticut, 11/16/85 vs. Lehigh, 10/12/85 vs. Furman, 12/7/85 vs. Akron, 11/30/85 vs. Brown, 9/28/85 vs. New Hampshire, 11/2/85 vs. New Hampshire, 9/13/08 vs. Northeastern, 10/13/84 vs. New Hampshire, 11/7/09 vs. Brown, 9/29/84 vs. Massachusetts, 10/6/84 YDS 4,508 3,870 2,759 2,250 2,218 2,212 2,117 2,113 2,070 2,058 YARDS PASSING 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. GAME YDS 566 520 494 472 461 446 436 425 424 410 408 YARDS PASSING YDS 8,407 8,378 5,005 3,730 3,463 3,176 3,119 3,118 3,016 2,976 TOTAL 8 5 5 5 5 1973-75 1987-90 1979-81 SEASON YEAR 1985 1984 2008 1995 1993 1994 1983 1999 1990 1986 CAREER YEARS 1993-96 1984-85 2005-08 1991-94 1987-90 1969-71 1966-68 2003-05 1980-82 1987-90 GAME OPPONENT, DATE vs. Connecticut, 11/16/85 vs Brown, 10/4/08 vs. Brown, 9/29/1984 vs. Lehigh, 10/12/85 vs. Lafayette, 10/26/85 OPPONENT, DATE vs. James Madison, 10/31/98 vs. Army, 9/9/07 vs. New Hampshire, 11/4/78 vs. Kings Point, 11/11/78 vs. Maine, 9/9/95 vs. Maine, 10/7/78 vs. Boston Univ., 10/14/95 vs. Lafayette, 9/8/84 vs. Northeastern, 11/17/06 vs. Maine, 9/22/84 PASSING PERCENTAGE PASSING PERCENTAGE Steve Crone Steve Monaco Terry Lynch GAME PCT .850 (17-20) .846 (11-13) .823 (14-17) .761 (16-21) .761 (16-21) .750 (12-16) .722 (13-18) .714 (20-28) .706 (12-17) .694 (34-49) (minimum 100 attempted) NAME 1. Steve Tosches 2. Chris Hixson 3. Chris Hixson 4. Derek Cassidy 5. Chris Hixson 6. Tom Ehrhardt 7. Billy Jack Haskins 8. Chris Hixson 9. Tom Ehrhardt 10. Steve Tosches 8. 9. 10. SEASON PCT .606 (114-188) .602 (162-269) .600 (117-295) .593 (261-440) .576 (190-330) .575 (308-536) .570 (69-122) .568 (162-285) .566 (365-645) .558 (110-197) PCT .586 (691-1,179) .582 (224-385) .570 (673-1,181) .552 (409-741) .508 (255-502) .490 (257-525) .490 (72-148) W W W. G O R H O D Y. C O M YEAR 1978 1993 1994 2008 1995 1984 1997 1996 1985 1977 CAREER YEARS 1993-96 1977-78 1984-85 2005-2008 1969-71 1984-86 1991-94 Tom Ehrhardt threw for a school-record 4,508 yards from 1984-85. 69 INDIVIDUAL RECORDS 7. Tom Ehrhardt Tom Ryan Tom Ehrhardt Chris Hixson CHRIS PAUL-ETIENNE 5 4 4 4 4 TOUCHDOWN PASSES 1. 2. 3. 6. 8. 10. NAME Tom Ehrhardt Tom Ehrhardt Chris Hixson Chris Hixson Derek Cassidy Dave Grimsich CHRIS PAUL-ETIENNE Dave Wienke Chris Hixson Larry Caswell Chris Hixson TOTAL 42 36 15 15 15 14 14 13 13 12 12 TOUCHDOWN PASSES 1. 2. 3. 4. 5. 6. 7. 8. 9. NAME Tom Ehrhardt Chris Hixson Derek Cassidy Dave Grimsich Tony Squitieri Larry Caswell Bob Ehrhardt Steve Crone Steve Monaco Jayson Davis INTERCEPTIONS 1. 3. NAME Tom Ehrhardt Greg Farland Greg Meyer Dave Wienke Greg McFarland Tom Ehrhardt Paul Ghilani Tony Squitieri TOTAL 78 55 31 24 23 19 18 17 16 16 5. 6. 7. 10. NAME Tom Ehrhardt Dave Grimsich Dave Wienke Greg Farland Tom Ehrhardt Tom Fay Tony Squitieri Chris Hixson Derek Cassidy Chris Hixson 1. 2. 3. 4. 5. 6. 9. 10. NAME Chris Hixson Dave Grimsich Tom Ehrhardt Steve Crone Greg Farland Steve Monaco Tony Squitieri Derek Cassidy Kevin Neville Dave Wienke YEAR 1985 1984 1994 1995 2008 1982 2009 1983 1996 1967 1993 CAREER YEARS 1984-85 1993-96 2005-08 1980-82 1991-94 1966-68 1969-71 1973-75 1987-90 2002-05 OPPONENT, DATE vs. Furman, 12/7/85 vs. Connecticut, 11/15/86 vs. Holy Cross, 9/22/79 vs. Connecticut, 11/12/83 vs. Delaware, 9/7/85 vs. Brown, 9/28/85 vs. New Hampshire, 11/1/86 vs. Connecticut, 11/21/92 TOTAL 27 24 23 23 19 15 14 14 14 13 INTERCEPTIONS SEASON GAME TOTAL 6 6 5 5 5 5 5 5 INTERCEPTIONS 1. 2. 3. vs. Akron, 11/30/85 vs. Northeastern, 9/21/74 Four Times Three Times vs. New Hampshire, 11/7/09 TOTAL 48 40 36 31 31 28 28 28 26 25 SEASON YEAR 1985 1981 1983 1986 1984 1966 1992 1995 2008 1994 CAREER PASSES CAUGHT 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME Brian Forster Brian Forster Dameon Reilly Darren Rizzi Cy Butler Tony DiMaggio Bobby Apgar Cy Butler Dameon Reilly BRANDON JOHNSON-FARRELL PASSES CAUGHT 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME Brian Forster Cy Butler Dameon Reilly Darren Rizzi Tony DiMaggio Bobby Apgar Shawn Leonard Bob Donfield Jim Muse Henry Walker RECEIVING YARDS 1. 2. 3. 4. 5. 6. 8. 9. 10. NAME Brian Forster Brian Forster Shawn Leonard Brian Forster Bobby Apgar Brian Forster Brian Forster Dameon Reilly Darren Rizzi Darren Rizzi RECEIVING YARDS 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME Brian Forster Brian Forster Dameon Reilly Darren Rizzi Bobby Apgar Dameon Reilly Shawn Leonard Cy Butler Tom Mut Tony DiMaggio RECEIVING YARDS 1. 2. 3. NAME Brian Forster Dameon Reilly Bobby Apgar SEASON TOTAL 128 100 75 74 73 72 67 60 58 57 YEAR 1985 1984 1985 1992 1994 1985 1994 1995 1984 2008 CAREER TOTAL 284 189 165 160 149 145 143 134 118 105 YEARS 1983-85; 1987 1993-96 1983-85 1989-92 1982-85 1993-95 2006-09 1983-87 1984-87 1966-68 GAME YDS 327 299 275 252 206 205 205 204 164 162 OPPONENT, DATE vs. Brown, 9/28/85 vs. Lehigh, 10/12/85 vs. New Hampshire, 11/7/09 vs. Richmond, 12/1/84 vs. Brown, 9/24/93 vs. Northeastern, 11/9/85 vs. Connecticut, 11/16/85 vs. Connecticut, 11/16/85 vs. Delaware, 9/19/92 vs. Hofstra, 10/2/92 SEASON YDS 1,819 1,357 1,208 1,103 1,042 902 858 828 803 800 YDS 3,944 2,698 2,431 YEAR 1985 1984 1985 1992 1994 1984 2009 1994 1982 1985 YEARS 1993-96 1980-82 1984-85 1973-75 1984-86 1987-90 1991-94 2005-08 1987-90 1969-71 1. 3. 4. 5. 7. 9. NAME Brian Forster Brian Forster Brian Forster Brian Forster Brian Forster Cy Butler Brian Forster Tony DiMaggio Brian Forster Tony DiMaggio Bob Donfield Darren Rizzi TOTAL 18 18 17 16 15 15 12 12 11 11 11 11 2,426 2,353 2,348 1,724 1,595 1,495 1,488 KICKOFF RETURNS 1. 2. 3. 5. 6. 7. 8. 10. NAME BRANDON JOHNSON FARRELL Raji El-Amin Cy Butler Wendall Williams Jerell Jones Brian Merritt Jerell Jones Brian Merritt Cy Butler Lance Small 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME BRANDON JOHNSON FARRELL Raji El-Amin Wendall Williams Cy Butler Brian Merritt Jerell Jones Brian Merritt Lance Small Jerell Jones Wendall Williams 7. NAME Ron Iannotti Cy Butler Cy Butler Chris Pierce Cy Butler Lance Small Chris Peirce Manny DeSousa Lance Small Jerell Jones YEAR 2008 2006 1994 2003 2005 1992 2007 1991 1993 2000 SEASON YEAR 2008 2006 2003 1994 1991 2005 1992 2000 2007 2001 SEASON TOTAL 38 34 31 26 22 22 20 20 20 20 PUNT RETURN YARDS 1. 2. 3. 4. 5. 6. 7. 8. 9. SEASON YDS 907 860 769 694 622 618 614 552 541 532 PUNT RETURNS 1. 2. 3. 4. 5. 1989-92 2006-09 1993-96 1982-85 1983-87 2005-PRES. 1965-67 TOTAL 42 36 34 34 31 29 27 26 26 23 KICKOFF RETURN YARDS NAME Cy Butler Cy Butler Chris Pierce Cy Butler Lance Small Ron Iannotti Gregg Hoffman Lance Small Lance Small Raji El-Amin YEAR 1998 1994 1995 1990 1996 2000 1991 1997 1999 2004 SEASON TOTAL 404 266 261 226 209 192 174 139 137 137 YARDS TOTAL OFFENSE - QB 1. 2. 3. 4. 5. 6. 7. 8. GAME NAME Tom Ehrhardt Tom Ehrhardt Tom Ehrhardt Tom Ehrhardt Derek Cassidy Tom Ehrhardt Tom Ehrhardt Tom Ehrhardt YDS (PASS/RUSH) 566 (566/0) 509 (520/-11) 480 (494/-14) 477 (461/16) 454 (436/18) 432 (472/-40) 428 (446/-18) 413 (408/5) YARDS TOTAL OFFENSE - QB OPPONENT, DATE vs. Richmond, 12/1/84 vs. Brown, 9/28/85 vs. Lehigh 10/12/85 vs. Connecticut 11/16/85 vs. Northeastern 11/9/85 vs. Massachusetts 10/1/94 vs. Massachusetts 10/6/84 vs. Massachusetts 10/6/84 vs. Maine 9/21/85 vs. Akron 11/30/85 vs. Boston Univ. 10/19/85 vs. Hofstra 10/2/92 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Cy Butler is No. 2 all-time in receptions at URI with 189. 70 Darren Rizzi Shawn Leonard Cy Butler Tony DiMaggio Bob Donfield Shawn Leonard Fran Geiselman YEAR 1995 1994 1990 1996 2001 1998 1992 1999 2000 2006 TOTAL OFFENSE RECEIVING PASSES CAUGHT CAREER YEARS 1983-85; 1987 1983-85 1993-95 4. 5. 6. 7. 8. 9. 10. W W W. G O R H O D Y. C O M NAME Tom Ehrhardt Tom Ehrhardt Derek Cassidy Chris Hixson Kevin Neville Chris Hixson Dave Wienke Chris Hixson Greg Farland Dave Grimsich YDS (PASS/RUSH) 4,372 (4,508/-136) 3,691 (3,870/-179) 2,832 (2759/75) 2,158 (2,250/-92) 2,141 (2,070/71) 2,116 (2,218/-102) 2,114 (2,117/-3) 2,038 (2,223/-185) 1,873 (2,058/-185) 1,856 (1,610/246) GAME OPPONENT, DATE vs. Connecticut, 11/16/85 vs. Lehigh, 10/12/85 vs. Furman, 12/7/85 vs. Brown, 9/28/85 vs. New Hampshire, 9/13/08 vs. Akron,11/30/85 vs. New Hampshire, 11/2/85 vs. Massachusetts, 10/6/84 SEASON YEAR 1985 1984 2008 1995 1990 1993 1983 1994 1986 1982 INDIVIDUAL RECORDS YARDS TOTAL OFFENSE - QB 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME Tom Ehrhardt Chris Hixson Jayson Davis Derek Cassidy Vince Nedimyer Kevin Neville Tony Squitieri Pat Abbruzzi James Jenkins Bob Ehrhardt YDS (PASS/RUSH) 8,063 (8,378/-315) 7,927 (8,407/-480) 5,822 (3,118/2,704) 5,648 (5,005/643) 3,578 (2,705/873) 3,558 (3,463/95) 3,518 (3,640/-122) 3,389 (3,389/0) 3,345 (3,345/0) 3,243 (3,176/67) ALL-PURPOSE YARDAGE (Rushing, Receiving, Kickoff and Punt Returns) NAME YDS 1. Wendall Williams 1,964 2. Brian Forster 1,915 3. Cy Butler 1,801 4. James Jenkins 1,689 5. Cal Whitfield 1,657 6. Doug Haynes 1,569 7. Cy Butler 1,547 8. BRANDON JOHNSON-FARRELL 1,478 9. Chris Poirier 1,471 10. James Jenkins 1,465 ALL-PURPOSE YARDAGE (Rushing, Receiving, Kickoff and Punt Returns) NAME YDS 1. Cy Butler 5,380 2. Chris Poirier 4,691 3. James Jenkins 4,515 4. Wendall Williams 4,346 5. Brian Forster 4,046 6. Leroy Shaw 3,917 7. Pat Abbruzze 3,389 8. Chris Pierce 3,495 9. Jerell Jones 3,414 10. David Jamison 3,310 11. Joe Casey 3,064 LONGEST PUNT 1. 2. 3. 5. 6. 7. 8. 10. NAME Mike Cassidy Chris Cassara Steve Caizzi Steve Caizzi Jason Christopher Rob Welsh Bob Ehrhardt Rob Welsh Ralph Guerrieri Shane Laisle Bryan Giannecchini PUNTS 1. 4. 6. NAME Ralph Guerriero Steve Caizzi Chris Cassara Ralph Guerriero Kevin Dobryzinski Ralph Guerriero Steve Goodrich Chris Cassara Pat Donohue Kevin Dobryzinski Shane Laisle TIM EDGER TIM EDGER PUNTS 1. 2. 4. 5. 6. 7. 8. 9. 10. NAME John Anderson Rick Viall Kevin Dobryzinski Chris Cassara Jason Christopher TIM EDGER Leon Spinney Shane Laisle Steve Goodrich Shane Laisle TIM EDGER PUNTS 1. 2. NAME Chris Cassara Jason Christopher CAREER YEARS 1984-85 1993-96 2002-05 2005-08 1998-01 1987-90 1991-94 1951-54 1996-98 1969-71 SEASON YEAR 2003 1985 1994 1998 1982 1986 1995 2008 1989 1997 CAREER SEASON 1993-96 1985-89 1996-98 2000-03 1983-85; 1987 1977-80 1951-54 1989-92 2004-07 1998-01 2005-09 GAME YDS 88 75 74 74 73 71 70 69 69 68 68 OPPONENT, DATE vs. Montana State, 12/8/84 vs. New Hampshire, 11/10/85 vs. Massachusetts, 10/2/82 vs. Massachusetts, 10/4/80 vs. Maine, 9/6/97 vs. Brown, 9/29/79 vs. Boston Univ. 10/23/71 vs. Brown, 9/25/76 vs. Maine, 9/20/80 vs. Massachusetts, 11/22/03 vs. Brown, 9/29/07 3. 5. 6. 7. 8. 8. 9. 10. John Anderson Shane Laisle Ralph Guerriero Jay Monaghan Bryan Giannecchini TIM EDGER Rich Viall Kevin Dobryzinski Leon Spinney PUNTING YARDS 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME John Anderson TIM EDGER Rick Viall Jason Christopher Shane Laisle Chris Cassara Jason Christopher Kevin Dobryzinski Leon Spinney Shane Laisle PUNTING YARDS 1. 2. 3. 4. 5. 6. 6. 7. 8. 9. 10. NAME Chris Cassara Jason Christopher Shane Laisle John Anderson Ralph Guerriero TIM EDGER Bryan Giannecchini Rick Viall Jay Monaghan Kevin Dobryzinski Leon Spinney PUNTING AVERAGE 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME Jason Christopher TIM EDGER Bryan Giannecchini Shane Laisle Dan Callahan Chris Cassara Shane Laisle Steve Caizzi Bryan Giannecchini Chris Cassara PUNTING AVERAGE 1. 2. 3. 4. NAME TIM EDGER Shane Laisle Jason Christopher Bryan Giannecchini 215 215 167 139 134 131 128 125 110 YDS 2,958 2,946 2,866 2,703 2,701 2,667 2,627 2,591 2,583 2,364 YDS 8,782 8,514 8,456 7,481 5,834 5,230 5,174 4,616 4,463 4,098 3,996 AVG (PUNTS/YDS) 42.4 (62-2,627) 41.5 (71-2,946) 41.0 (43-1,761) 41.6 (65-2,701) 40.3 (45-1,812) 40.2 (43-1,729) 39.4 (60-2,364) 39.2 (25-981) 38.7 (47-1,821) 38.3 (59-2,261) AVG (PUNTS/YDS) 39.9 (131-5,230) 39.3 (215-8,456) 38.7 (220-8,514) 38.6 (134-5,174) 1972-75 2000-03 1979-82 1968-70 2004-07 2008-present 1977-78 1994-95 1967-68 5. 6. 7. 8. 9. 10. SEASON CONSECUTIVE PAT'S YEAR 1972 2009 1977 1999 2002 1988 1997 1995 1967 2001 CAREER YEARS 1988-91 1996-99 2000-03 1972-75 1979-82 2008-present 2004-07 1977-78 1968-70 1994-95 1967-68 CAREER YEARS 2008-present 2000-03 1996-99 2004-07 GAME TOTAL 12 12 12 11 11 10 10 10 10 10 10 10 10 TOTAL 85 78 78 76 72 71 69 65 61 60 60 TOTAL 236 222 4. 6. 8. NAME Bob McCabe Michael Griffin Shane Laisle Shane Laisle Colin Gallagher Colin Gallagher Colin Gallagher Bryan Giannecchini 1. NAME Shane Laisle EXTRA POINTS MADE 1. 4. 9. NAME Bob McCabe Michael Griffin Shane Laisle Ralph Guerriero Matt Walker Wally Christensen Shane Laisle Colin Gallagher Wally Christensen Michael Griffin Chris Cassara Colin Gallagher Colin Gallagher Colin Gallagher TOTAL 106 5. 6. 8. 9. NAME Michael Griffin Shane Laisle Colin Gallagher Shane Laisle Paul Stringfellow Ralph Guerriero Chris Cassara Matt Walker Colin Gallagher LOUIS FEINSTEIN NAME Shane Laisle Matt Walker Chris Cassara Shane Laisle Michael Griffin Wally Christensen Paul Stringfellow Ralph Guerriero LOUIS FEINSTEIN Colin Gallagher 1. 2. 4. NAME Bob McCabe Michael Griffin Shane Laisle Ralph Guerriero Matt Walker Shane Laisle Colin Gallagher Colin Gallagher TOTAL 106 94 78 69 63 55 52 48 48 41 1. 2. 3. 4. 5. 6. CAREER NAME Michael Griffin Paul Stringfellow Shane Laisle Colin Gallagher Shane Laisle Ralph Guerriero Chris Cassara SEASON YEAR 1985 2003 2005 2001 1984 1982 1991 1996 2006 2009 CAREER YEARS 2000-03 1995-96 1988-91 2000-02 1983; 1985-86 1973-75 1983-84 1980-82 2008-present 2004-05 GAME TOTAL 10 8 8 7 7 7 7 7 EXTRA POINTS ATTEMPTED YEARS 2000-02 OPPONENT, DATE vs. Vermont, 9/26/42 vs. Connecticut, 11/16/85 vs. Hampton, 10/6/01 vs. Maine, 9/18/82 vs. American Int'l, 8/31/96 vs. Northeastern, 9/21/74 vs. New Hampshire, 9/20/03 vs. Central Conn., 9/10/05 vs. Bridgeport, 11/9/74 vs. Lehigh, 10/12/85 vs. Towson State, 9/28/91 vs. William & Mary, 9/17/05 vs. Villanova, 10/22/05 vs. Merrimack, 9/9/06 TOTAL 46 37 35 35 32 30 30 28 25 25 EXTRA POINTS MADE CAREER GAME TOTAL 8 8 8 7 7 7 7 7 6 6 6 6 6 6 EXTRA POINTS MADE 1. 2. 3. OPPONENT, DATE vs. Vermont, 10/4/42 vs. Connecticut, 11/12/83 vs. Hampton, 10/6/01 vs. New Hampshire, 9/20/03 vs. Central Conn., 9/10/05 vs. Villanova, 10/22/05 vs. Merrimack, 9/9/06 vs. Hofstra, 9/25/04 EXTRA POINTS ATTEMPTED YEAR 1972 1977 1995 1988 1999 2009 1967 2002 1987 2001 2008 1988-91 1967-68 1977-78 1979-82 1972-75 1994-95 GAME TOTAL 8 8 8 7 7 6 6 5 CONSECUTIVE PAT’S 10. SEASON YEARS 1988-91 1996-99 1. 1. 2. 3. 4. 5. 6. 7. 8. OPPONENT, DATE vs. Northeastern, 10/10/81 vs. Idaho State, 12/5/81 vs. Connecticut, 11/19/88 vs. Massachusetts, 10/3/81 vs. Massachusetts, 10/1/94 vs. Virginia Tech, 10/11/80 vs. Richmond, 10/24/87 vs. Maine, 10/15/88 vs. New Hampshire, 11/13/93 vs. Delaware State, 9/2/95 vs. Maine, 11/3/01 vs. Brown, 10/3/09 vs. William and Mary, 10/31/09 37.2 (236-8,782) 36.3 (110-3,996) 36.1 (128-4,616) 34.9 (167-5,834) 34.8 (215-7,481) 34.7 (103-3,570) KICKING SEASON YEAR 1997 2009 2007 2002 1973 1990 2001 1982 2006 1991 Chris Cassara Leon Spinney Rick Viall Ralph Guerriero John Anderson Kevin Dobryzinski OPPONENT, DATE vs. Vermont, 9/26/42 vs. Connecticut, 11/16/85 vs. Hampton, 10/6/01 vs. Maine, 9/18/82 vs. American Int'l, 8/31/96 vs. New Hampshire, 9/20/03 vs. Central Conn., 9/10/05 vs. William & Mary, 9/17/05 TOTAL 51 38 37 36 35 33 33 SEASON YEAR 1985 1984 2003 2005 2001 1982 1991 Bryan Giannecchini averaged 41.0 yards per punt in 2007 W W W. G O R H O D Y. C O M 71 INDIVIDUAL RECORDS 8. 9. Matt Walker Chris Cassara Matt Walker 31 29 29 EXTRA POINTS ATTEMPTED 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME Shane Laisle Matt Walker Chris Cassara Matt Walker Michael Griffin Colin Gallagher Wally Christensen Paul Stringfellow Ralph Guerriero LOUIS FEINSTEIN TOTAL 107 101 80 80 71 70 67 64 59 54 EXTRA POINT PERCENTAGE (Minimum Five Made) NAME 1. Michael Griffin Shane Laisle Colin Gallagher Ralph Guerriero Matt Walker Shane Laisle Colin Gallagher Michael Griffin Chris Cassara Colin Gallagher PCT 1.000 (8-8) 1.000 (8-8) 1.000 (7-7) 1.000 (7-7) 1.000 (7-7) 1.000 (7-7) 1.000 (6-6) 1.000 (6-6) 1.000 (6-6) 1.000 (6-6) EXTRA POINT PERCENTAGE 1. 4. 5. 6. 7. 8. 9. 10. NAME Shane Laisle Shane Laisle Shane Laisle Colin Gallagher Matt Walker Matt Walker Skip Thomas Shane Laisle LOUIS FEINSTEIN Skip Thomas PCT 1.000 (37-37) 1.000 (35-35) 1.000 (20-20) .972 (25-26) .957 (22-23) .955 (21-22) .947 (18-19) .933 (14-15) .925 (25-27) .923 (13-14) EXTRA POINT PERCENTAGE 1. 2. 3. 4. 5. 6. 6. 7. 8. 9. NAME Shane Laisle Colin Gallagher Skip Thomas Matt Walker Chris Cassara LOUIS FEINSTEIN Michael Griffin Rich Viall Wally Christensen Paul Stringfellow Bryan Giannecchini LONGEST FIELD GOAL 1. 2. 4. 6. 7. NAME Colin Gallagher Wally Christensen Shane Laisle Ralph Guerriero Bryan Giannecchini Matt Walker Chris Cassara Matt Walker Colin Gallagher Colin Gallagher LOUIS FEINSTEIN FIELD GOALS MADE 1. 2. 72 NAME Chris Cassara Rod Graham Ralph Guerriero Ralph Guerriero Chris Cassara Skip Thomas Skip Thomas Skip Thomas Skip Thomas Matt Walker Ryan Szczesniak Shane Laisle Colin Gallagher Bryan Giannecchini LOUIS FEINSTEIN LOUIS FEINSTEIN PCT .991 (106-107) .942 (66-70) .939 (31-33) .931 (94-101) .900 (72-80) .888 (48-54) .887 (63-71) .842 (32-38) .820 (55-67) .813 (52-64) .813 (39-48) YDS 51 50 50 49 49 48 47 47 47 47 47 TOTAL 4 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 1996 1990 1996 CAREER YEARS 2000-03 1995-98 1989-91 1995-97 1985-86 2004-06 1974-75 1983-84 1980-82 2008-present GAME OPPONENT, DATE vs. Connecticut,11/16/85 vs. Hampton, 10/6/01 vs. Central Conn., 9/10/05 vs. Maine. 9/18/82 vs. American Int'l, 8/31/96 vs. New Hampshire, 9/20/03 vs. Villanova, 10/22/05 vs. Lehigh, 10/12/85 vs. Towson, 9/28/91 vs. Merrimack, 9/9/06 SEASON YEAR 2003 2001 2002 2005 1997 1998 1993 2000 2009 1994 CAREER FIELD GOALS MADE 1. 2. 3. 7. NAME Skip Thomas Matt Walker Matt Walker Shane Laisle Shane Laisle LOUIS FEINSTEIN Ralph Guerriero Rick Viall Ryan Szczesniak Colin Gallagher FIELD GOALS MADE 1. 2. 3. 4. 5. 6. 7. 9. 10. NAME Matt Walker Shane Laisle Skip Thomas Chris Cassara Matt Walker Shane Laisle Ralph Guerriero LOUIS FEINSTEIN Colin Gallagher Michael Griffin NAME Chris Cassara Colin Gallagher Bryan Giannecchini 7. 8. 9. TOTAL 4 3 3 FIELD GOALS ATTEMPTED GAME FIELD GOAL PERCENTAGE OPPONENT, DATE vs. Fordham, 9/3/05 vs. Brown, 9/28/74 vs. Brown, 10/4/03 vs. Brown, 9/25/82 vs. Richmond, 10/20/07 vs James Madison, 10/31/98 vs. Delaware, 9/17/88 vs. Hofstra, 11/11/95 vs. James Madison, 10/9/06 vs. Maine, 10/28/06 vs. Monmouth, 8/30/08 GAME OPPONENT, DATE vs. Northeastern, 11/5/88 vs. Connecticut, 11/17/79 vs. Northeastern, 9/13/80 vs. Lehigh, 11/6/82 vs. Delaware, 9/16/88 vs. Northeastern, 9/25/93 vs. Brown, 10/2/93 vs. Maine, 10/16/93 vs. Connecticut, 10/22/94 vs. Hofstra, 10/17/98 vs. Connecticut, 10/2/99 vs. Brown, 10/5/02 vs. Maine, 11/12/05 vs. Fordham, 9/1/07 vs. New Hampshire, 9/13/08 vs. Northeastern, 11/22/08 1. 2. 3. 4. 5. 6. 7. 8. 10. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME Chris Pierce Chris Pierce Wendall Williams Wendall Williams YDS 98 96 93 92 CAREER YEARS 1995-98 2000-03 1980-82 1993-94 1988-91 1995-97 2000-02 2004-06 1983-84 2008-present SEASON PCT .818 (9-11) .800 (12-16) .786 (11-14) .777 (7-9) .750 (9-12) .727 (8-11) .714 (10-14) .700 (7-10) .700 (14-20) .688 (11-16) YEAR 1993 2003 2002 2009 1988 2007 2005 1985 1998 2002 CAREER PCT .722 (26-36) .682 (15-22) .676 (25-37) .667 (32-48) .666 (18-29) .644 (38-59) .588 (10-17) .571 (16-28) .556 (10-18) .548 (17-31) LONGEST KICKOFF RETURN 1. 2. 3. 4. YEAR 1993 1982 1998 1995 1999 2008 2003 1978 2002 2005 TOTAL 59 48 43 36 34 31 30 29 28 27 NAME Skip Thomas Shane Laisle Shane Laisle LOUIS FEINSTEIN Chris Cassara Bryan Giannecchini Colin Gallagher Michael Griffin Matt Walker Shane Laisle NAME Skip Thomas Rick Viall Chris Cassara Shane Laisle LOUIS FEINSTEIN Matt Walker Bryan Giannecchini Mike Griffin Ryan Szczesniak Colin Gallagher SEASON TOTAL 25 24 20 19 18 18 16 15 14 14 NAME Matt Walker Shane Laisle Ralph Guerriero Skip Thomas Chris Cassara Matt Walker Shane Laisle Colin Gallagher Michael Griffin LOUIS FEINSTEIN FIELD GOAL PERCENTAGE YEARS 1995-98 2000-03 1993-94 1988-91 1995-97 2000-02 1980-82 2008-present 2004-06 1983; 1985-86 OPPONENT, DATE vs. Northeastern, 11/5/88 vs. Maine, 11/12/05 vs. Fordham, 9/1/07 NAME Skip Thomas Ralph Guerriero Matt Walker Matt Walker Ryan Szczesniak LOUIS FEINSTEIN Shane Laisle Rich Viall Shane Laisle Colin Gallagher YEARS 2000-03 2004-06 1993-94 1995-98 1988-91 2008-present 1985-86 1977-78 1973-75 1983-84 2004-07 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. CAREER GAME FIELD GOALS ATTEMPTED 1. 2. 3. 4. 5. YEAR 1993 1998 1995 2003 2002 2008 1982 1978 1999 2005 TOTAL 38 32 26 25 24 20 18 18 17 16 FIELD GOALS ATTEMPTED 1. 2. SEASON TOTAL 17 14 12 12 11 11 10 10 10 10 YEARS 1993-94 1977-78 1988-91 2000-03 2008-present 1995-98 2004-07 1983; 1985-86 1999 2004-06 GAME OPPONENT, DATE vs. Massachusetts, 10/12/91 vs. Northeastern, 11/9/91 vs. William & Mary, 10/25/03 vs. Massachusetts, 11/23/02 W W W. G O R H O D Y. C O M 5. 6. 7. 9. 10. Chris Pierce Chris Poirier Jerell Jones Doug Haynes Brian Merritt BRANDONJOHNSON-FARRELL 90 89 86 86 83 72 vs. Richmond, 9/9/89 vs. Connecticut, 11/15/86 vs. Central Conn., 9/10/05 vs. Furman, 12/7/85 vs. Connecticut, 11/23/91 vs. Towson, 10/11/08 LONGEST PUNT RETURN 1. 2. 3. 4. 6. 8. 9. 10. NAME Raji El-Amin Cy Butler Grant Dennison Cy Butler Cy Butler Lance Small Wendall Williams Tony Hill Chris Pierce Alonzo Boyd GAME YDS 86 83 82 80 80 75 75 69 50 49 OPPONENT, DATE vs. Merrimack, 9/9/06 vs. William & Mary, 10/7/95 vs. Brown, 9/30/72 vs. Delaware State, 11/12/94 vs. American Int'l, 8/31/96 vs. Brown, 9/29/01 vs. Richmond, 9/27/03 vs. Howard, 9/1/84 Opponent N/A, 1990 vs. New Hampshire, 10/29/04 DEFENSE TACKLES 1. 2. 3. 4. 6. 8. NAME LaJhon Jones Gil Rishton Lance Small Miquel Viera ROB DAMON John Avento Preston Letts Preston Letts Andrew Elsing Raquan Pride Teddy Gibbons ROB DAMON MATT HANSEN TACKLES 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. NAME Marty Coyne Chip Forte Tom Marhefka Miquel Viera Mark Brockwell Pat Lawson Miquel Viera Russell Hunter Mark Dennen Preston Letts ROB DAMON OPPONENT, DATE vs. Boston Univ., 10/8/94 vs. Boston Univ.,10/24/92 vs. Richmond, 10/25/01 vs. Richmond, 9/19/98 vs. Connecticut, 9/26/09 vs. Boston Univ., 10/26/74 vs. William & Mary, 11/6/99 vs. Connecticut, 10/2/99 vs. Northeastern, 10/12/02 vs. Cincinnati, 11/8/03 vs. Brown, 10/2/04 vs. Massachusetts, 9/19/09 vs. William and Mary, 10/31/09 TOTAL 151 147 144 140 139 136 132 131 126 124 124 TACKLES 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. GAME TOTAL 23 22 20 19 19 17 17 16 16 16 16 16 16 NAME Paul Picciotti Lance Small Kurt Brockwell Tom Marhefka LaJhon Jones MATT HANSEN Mark Dennen Jared Elwell Ron Iannotti Frank Ferrara TOTAL 388 380 354 339 320 287 282 279 277 274 LONGEST INTERCEPTION RETURN 1. 2. NAME Guy Carbone Tony Hill PASSES INTERCEPTED 1. 2. 4. NAME Kevin Smith Mike Cassidy Chuck Wesley Joe Ptaszek Guy Carbone Chuck Watson Bill Brown Kris Kelly Chuck Welsey Ramone Ellis Chuck Wesley Chuck Wesley Terrence Jones JARROD WILLIAMS SEASON YEAR 1992 1981 1977 1998 1984 1986 1997 1991 1982 1999 2009 CAREER YEARS 1998-01 1998-01 1986-89 1975-78 1994-97 2007-present 1981-83 1994-97 1995-98 1994-98 GAME YDS 109 (TD) 94 OPPONENT, DATE vs. Lafayette, 10/26/85 vs. Northeastern, 10/8/83 TOTAL 4 3 3 2 2 2 2 2 2 2 2 2 2 2 OPPONENT, DATE vs. Massachusetts,10/8/88 vs. Boston Univ.,10/19/85 vs. Hampton, 9/6/01 vs. Lehigh, 11/6/82 vs. Massachusetts, 10/6/84 vs. Massachusetts, 10/5/85 vs. Delaware, 9/17/88 vs. Villanova, 11/2/96 vs. Brown, 10/3/98 vs. Maine, 10/10/98 vs. Massachusetts, 11/7/98 vs. William & Mary, 9/22/01 vs. Villanova, 10/11/03 vs. Towson, 10/10/09 GAME INDIVIDUAL RECORDS PASSES INTERCEPTED 1. 2. 3. 4. 5. 7. 9. NAME Mike Cassidy Tony Hill Kevin Smith Ron Iannotti Lance Small Chuck Wesley Gregg Hoffmann Kevin Smith Guy Carbone Tony Hill Chris Orlando Jim Roberson Ramone Ellis Chuck Welsey TOTAL 11 9 9 7 7 7 6 6 5 5 5 5 5 5 PASSES INTERCEPTED 1. 2. 4. 5. 7. 9. NAME Kevin Smith Tony Hill Chuck Wesley Guy Carbone Mike Cassidy Lance Small Jim Roberson Raquan Pride Greg Hoffmann Bernie Hoffman Joe Ptaszek QUARTERBACK SACKS 1. 2. 6. 7. NAME LaJhon Jones Fearon Wright Frank Ferrara Frank Ferrara Isaiah Grier Dana Hart Charles Babbitt Paul McNulty Frank Ferrara Lou D’Agostino Ryan Carstens Frank Ferrara Carmine Spagnuolo Dustin Picciotti Steve Weedon TOTAL 23 15 15 14 11 11 10 10 9 9 9 1. 2. 3. 7. 8. 10. NAME Frank Ferrara Lou D'Agostino Doug Clark Lucien Belanger Will Santi LaJhon Jones Charles Babbitt Steve Garofalo Jeff Chenard Jeff Chenard 1. 2. 3. 4. 6. 7. 8. 9. NAME Frank Ferrara Lou D'Agostino LaJhon Jones Charles Babbitt Jeff Chenard Will Santi John Klumbach Lucien Belanger Doug Clark TACKLES FOR LOSS 1. 2. 7. NAME Frank Ferrara Loue D'Agostino Will Santi LaJhon Jones Frank Ferrara Isaiah Grier Lou D'Agostino LaJhon Jones Will Santi TACKLES FOR LOSS 1. 2. NAME Frank Ferrara Lou D'Agostino CAREER YEARS 1987-90 1982-85 1998-01 1982-85 1983-85 1998-00 1978; 1981-82 2003-06 1991-93 1981-84 1979-82 OPPONENT, DATE vs. Brown, 10/18/97 vs. Northeastern, 10/21/00 vs. Brown, 9/28/96 vs. Hofstra, 11/23/96 vs. Hofstra, 9/8/01 vs. Villanova, 10/22/05 vs. VMI, 11/19/77 vs. Boston Univ., 10/28/78 vs. William & Mary, 9/3/94 vs. Brown, 9/23/94 vs. New Hampshire, 9/16/95 vs. Connecticut, 10/21/95 vs. Maine, 10/10/98 vs. Hofstra, 9/25/04 Towson, 10/10/09 TOTAL 15 14 13 13 13 13 11 10 10 9 QUARTERBACK SACKS YEAR 1985 1983 1988 1998 1999 2001 1991 1990 1983 1982 1995 1982 1997 1998 GAME TOTAL 4 3 3 3 3 2.5 2 2 2 2 2 2 2 2 2 QUARTERBACK SACKS SEASON TOTAL 33 24 23 20 20 19 16 14 13 SEASON YEAR 1998 1995 1991 1996 1996 1997 1980 1993 1984 1983 CAREER YEARS 1995-98 1992-95 1994-97 1977-80 1982-84 1993-96 1988-91 1993-96 1988-91 3. 5. 6. 8. OPPONENT, DATE vs. Brown, 9/28/96 vs. Connecticut, 10/21/95 vs. Brown, 9/28/96 vs. James Madison, 11/15/97 vs. Massachusetts, 11/7/98 vs. Brown, 9/29/01 vs. Massachusetts, 9/30/95 vs. Delaware, 11/18/95 vs. Maine, 9/21/96 TOTAL 27 19 1. 2. 3. 4. 5. 6. 7. 8. 10. NAME Frank Ferrara LaJhon Jones Loue DAgostino Paul Picciotti MATT HANSEN Fearon Wright Miquel Viera Brian Smith Will Santi Kareem Hinckson FORCED FUMBLES 1. NAME Lou D'Agostino Mark Swistak Frank Ferrara Lewis Usher Kyle Beck Steve Weedon 1. 4. 7. 4. 8. NAME Steve Weedon Lucien Belanger Lou D'Agostino Will Santi Frank Ferrara Matt Hansen LaJhon Jones Jared Elwell Fearon Wright Andrew Elsing Teddy Gibbons Dan Heffron 1. NAME Karlo Saver Terrence Carter James Olverson MATT RAE FUMBLE RECOVERIES 1. 2. 3. NAME Will Santi Frank Ferrara Charles Babbitt Steve Walsh Dennis Talbot Mark Dennen Mike Cassidy Lou D'Agostino FUMBLE RECOVERIES 1. 2. 8. 10. NAME Dennis Talbot Gerry Favreau Mark Dennen Mark Brockwell Lou D'Agostino Frank Ferrara Will Santi Charlie Babbitt Gary Tourony Pete Hickey YEARS 1994-97 1994-97 1993-95 1998-01 2007-present 1999-00 1997-98 1993-95 1993-96 1998-01 OPPONENT, DATE vs. Delaware, 11/18/95 vs. Delaware, 11/18/95 vs. New Hampshire, 9/6/96 vs. Hampton, 10/6/01 vs. Villanova, 10/11/03 vs. Villanova, 10/24/09 SEASON TOTAL 5 5 5 4 4 4 3 3 3 3 3 3 NAME Lou D'Agostino Frank Ferrara Will Santi Jared Elwell LaJhon Jones Lucien Belanger STEVE WEEDON Fearson Wright Eric Gray Raquan Pride MATT HANSEN FUMBLE RECOVERIES CAREER GAME TOTAL 2 2 2 2 2 2 FORCED FUMBLES 1. 2. 1997 1998 2009 2000 2008 1995 1999 2000 TOTAL 49 35 33 30 28.5 27 25 23 23 21 FORCED FUMBLES SEASON YEAR 1998 1995 16 16 14.5 14 14 13 13 13 TACKLES FOR LOSS GAME TOTAL 6 5 5 5 5 5 4 4 4 LaJhon Jones Miquel Viera ROB DAMON Fearon Wright MATT HANSEN Brian Smith Fearon Wright Eric Gray YEAR 2009 1996 1995 1995 1998 2008 1997 1997 2000 2003 2004 2004 CAREER TOTAL 7 6 6 5 5 5 5 4 4 4 4 YEARS 1994-95 1995-98 1994-96 1994-97 1994-96 1994-96 2007-09 1999-00 2000-01 2003-06 2007-PRES. Tony Hill Barney Rinaldi Mark White Jared Elwell 5 5 5 5 LONGEST FUMBLE RETURN 1. NAME Matt Wilson PASS BREAKUPS 1. 3. NAME Keith Heinemann Anthony Offord Mark Swistak Chris Lawson Lance Small Chuck Wesley Chuck Wesley Jamal Saleem Andrew Elsing Mark Zlotek Andrew Elsing PASS BREAKUPS 1. 3. 7. 10. NAME Jim Robertson Kevin Smith Guy Carbone Tony Hill Chuck Wesley Chuck Wesley Dennis Talbot Raymond Williams Chris Lawson Virgil Gray Raji El-Amin PASS BREAKUPS 1. 3. 4. 5. 6. 7. 9. NAME Raymond Williams Chuck Wesley Anthony Adams Guy Carbone Jim Robertson Chris Lawson Virgil Gray Tony Hill Ron Iannotti Lance Small 1982-84 1980-82 1983-85 1994-97 GAME YDS 95 OPPONENT, DATE vs. Hofstra, 10/4/97 GAME TOTAL 4 4 3 3 3 3 3 3 3 3 3 OPPONENT, DATE vs. William & Mary, 10/13/01 vs. Massachusetts, 11/23/02 vs. Boston Univ., 10/8/94 vs. Massachusetts, 10/5/96 vs. James Madison, 10/31/98 vs. Brown, 10/16/99 vs. Maine, 10/23/99 vs. Hofstra, 9/8/01 vs. Brown, 10/5/02 vs. Massachusetts, 11/23/02 vs. Northeastern, 9/13/03 TOTAL 12 12 11 11 11 11 10 10 10 9 9 TOTAL 25 25 22 20 19 18 17 17 15 15 SEASON YEAR 1981 1988 1984 1984 1999 2001 1981 1985 1996 2005 2006 CAREER YEARS 1983-85 1998-01 1986-88 1983-85 1981-82 1995-96 2003-05 1982-84 1996-98 1998-01 GAME TOTAL 2 2 2 2 OPPONENT, DATE vs. Connecticut, 11/6/93 vs. New Hampshire, 11/13/93 vs. Boston Univ., 10/14/95 vs. Fordham, 9/5/09 SEASON TOTAL 6 5 4 4 4 4 4 4 TOTAL 8 7 7 7 7 7 7 6 6 5 YEAR 1995 1996 1979 1979 1980 1982 1985 1993 CAREER YEARS 1980-82 1981-83 1981-83 1983-85; 1987-88 1993-94 1994-96; 1998 1994-95 1979-80 1987-90 1981-84 W W W. G O R H O D Y. C O M Paul Picciotti is URI’s all-time leader in tackles with 388. 73 TEAM RECORDS RUSHING ATTEMPTS 1. 2. 4. 5. 7. 8. 9. TOTAL 82 76 76 74 73 73 72 71 70 70 70 70 70 OPPONENT Fordham New Hampshire Hofstra Temple New Hampshire Villanova Fordham William & Mary Connecticut Connecticut Hofstra Towson Maine RUSHING ATTEMPTS TOTAL 710 692 681 625 622 614 573 571 546 540 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. RUSHING YARDS 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. TOTAL 516 451 479 438 436 433 430 406 395 393 OPPONENT Brooklyn Brown Brown Hofstra Villanova New Hampshire New Hampshire Northeastern Central Conn. New Hampshire RUSHING YARDS 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. TOTAL 4,005 3,504 3,074 2,904 2,565 2,529 2,244 2,122 2,113 2,038 FEWEST YARDS RUSHING 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. TOTAL -46 -42 -41 -26 5 6 10 13 16 17 OPPONENT William and Mary Holy Cross Northeastern Fordham Connecticut Maine Brown Hofstra Delaware Richmond RUSHING TOUCHDOWNS 1. 2. 3. 4. 8. TOTAL 10 9 8 7 7 7 7 6 6 6 6 OPPONENT Fort Adams Vermont Worcester Tech Connecticut St. Stevens Quonset Naval Air Station Maine Brown Hampton Central Conn. State Villanova RUSHING TOUCHDOWNS 1. 2. 3. 4. 5. 7. 74 TOTAL 31 29 28 27 23 23 22 GAME DATE 9/4/04 10/20/01 11/15/03 11/6/71 9/20/03 10/22/05 9/3/05 10/16/04 11/13/71 11/14/81 9/25/04 10/9/04 11/13/04 SEASON YEAR 2003 2004 2005 2002 2007 2001 2006 1981 2000 1982 GAME DATE 11/8/52 10/5/02 9/29/07 11/15/03 10/22/05 10/20/01 10/27/07 9/13/03 9/11/04 9/20/03 SEASON YEAR 2003 2005 2004 2002 2001 2007 2000 1981 2006 1982 GAME DATE 10/31/09 9/15/84 11/7/87 9/7/08 11/16/85 9/21/85 9/27/86 11/11/95 9/6/86 10/22/88 GAME DATE 9/23/16 9/26/42 10/31/42 11/20/09 11/6/15 9/18/48 10/19/91 10/3/98 10/6/01 9/11/04 10/22/05 SEASON YEAR 2005 2004 2001 2003 1952 2007 1942 8. 9. 21 20 20 PASSES COMPLETED 1. 2. 3. 4. 5. 6. 7. 8. 9. TOTAL 45 43 41 40 38 38 35 34 32 32 OPPONENT Furman Akron Connecticut Lehigh Maine New Hampshire New Hampshire Richmond Boston University Northeastern PASSES COMPLETED 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. TOTAL 419 319 269 262 248 225 207 196 194 191 PASSES ATTEMPTED 1. 2. 4. 5. 6. 7. 8. TOTAL 90 70 70 67 65 64 62 61 61 61 OPPONENT Furman Akron New Hampshire Brown Lehigh Boston University New Hampshire Maine Montana State Connecticut PASSES ATTEMPTED 1. 2. 3. 4. 5. 6. 8. 9. 10. TOTAL 761 559 530 461 447 427 427 374 350 339 HIGHEST PASSING PCT. TOTAL .590 .584 .581 .574 .570 .569 .566 .550 .533 .529 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. YARDS PASSING 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. TOTAL 580 532 520 480 472 461 446 425 424 410 YARDS PASSING 1. 2. 3. 4. 5. 6. 7. OPPONENT Connecticut Furman Lehigh New Hampshire Akron Brown New Hampshire Northeastern New Hampshire Brown TOTAL 5,321 3,985 3,015 2,861 2,779 2,724 2,598 1991 1930 2006 GAME DATE 12/7/85 11/30/85 11/16/85 10/12/85 9/21/85 9/13/08 11/2/85 12/1/84 10/19/85 11/9/85 SEASON YEAR 1985 1984 2008 1986 1994 1999 1992 2008 1995 1993 GAME DATE 12/7/85 11/30/85 9/13/08 9/28/85 10/12/85 10/19/85 11/2/85 10/22/66 12/8/84 1985 SEASON YEAR 1985 1984 1986 2008 1992 1994 1999 1989 1983 2009 SEASON YEAR 1993 2008 1992 1995 1984 1978 1996 1985 2009 1977 GAME DATE 11/16/85 12/7/85 10/12/85 9/13/08 11/30/85 9/28/85 11/2/85 10/13/84 11/9/09 9/24/84 SEASON YEAR 1985 1984 1994 2008 1986 1992 2008 8. 9. 10. 2,545 2,394 2,284 TOUCHDOWN PASSES 1. 2. 6. TOTAL 8 5 5 5 5 5 4 OPPONENT Connecticut Brown Brown Lehigh Lafayette Akron TOUCHDOWN PASSES TOTAL 47 37 23 21 18 16 15 15 15 14 1. 2. 3. 4. 5. 6. 7. 10. TOTAL YARDS 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. TOTAL 622 610 608 585 578 576 575 549 547 546 OPPONENT Maine Hofstra Brown Connecticut William & Mary Massachusetts Brown Lehigh Furman New Hampshire TOTAL YARDS 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. TOTAL (5,231/806) (3,985/1,032) (987/4,005) (3,504/1,177) (2,394/1,855) (938/3,074) (1,837/2,038) (1,950/1,912) (2,545/1,297) (1,298/2,529) 6,037 5,017 4,992 4,681 4,249 4,012 3,875 3,862 3,842 3,837 AVG. TOTAL OFFENSE TOTAL 464.4 453.8 425.5 398.1 386.3 385.9 364.7 352.3 351.1 349.3 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. TOUCHDOWNS 1. 3. 4. TOTAL 10 10 9 8 8 8 8 8 8 OPPONENT Fort Adams Vermont Worcester Tech Quonset Naval Air Station Maine Connecticut Maine Hampton Central Conn. TOUCHDOWN 1. 2. 3. 4. 5. 6. 7. 8. W W W. G O R H O D Y. C O M TOTAL 58 42 37 36 34 33 32 29 1993 1990 1995 EXTRA POINTS 1. GAME DATE 11/16/85 10/4/08 9/29/84 10/12/85 10/26/85 11/30/85 13 Times 5. SEASON YEAR 1985 1984 2008 1994 2009 1992 1995 1983 2008 1990, 1993, 1996 GAME DATE 10/19/91 9/25/04 9/29/07 11/16/85 9/17/05 10/6/84 9/28/85 10/12/85 12/7/85 9/20/03 SEASON YEAR 1985 1984 2003 2005 1990 2004 1982 1998 1993 2007 GAME DATE 9/23/16 9/26/42 10/31/42 9/18/48 9/18/82 11/16/85 10/19/91 10/6/01 9/10/05 SEASON YEAR 1985 1984 2001 2005 1982 1990, 1996, 2003 1991 1983, 2004, 2006, 2007 Opponent Fort Adams Vermont Quonset Naval Air Station Central Conn. Worcester Tech Brooklyn Brooklyn Massachusetts Brandeis Vermont Maine Maine American International New Hampshire EXTRA POINTS TOTAL 54 38 37 36 35 33 30 29 28 26 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 2PT CONVERSIONS 1. TOTAL 3 OPPONENT Connecticut 2PT CONVERSIONS 1. FIELD GOALS 1. 2. SEASON YEAR 1985 2003 2005 2008 1990 1984 2004 1982 1998 1993 No. 8 8 8 8 7 7 7 7 7 7 7 7 7 7 TOTAL 4 3 3 3 3 3 3 3 3 3 3 3 3 3 3 TOTAL 6 OPPONENT Northeastern Connecticut Northeastern Delaware Northeastern Brown Maine Hofstra Connecticut Brown Hofstra Maine Fordham New Hampshire Northeastern FIELD GOALS TOTAL 14 12 11 10 9 8 1. 2. 3. 4. 5. 6. FIELD GOALS ATTEMPTS TOTAL 25 24 20 19 18 16 15 13 12 1. 2. 3. 4. 5. 6. 7. 8. 9. POINTS SCORED 1. 2. 3. 4. 5. 9. TOTAL 70 69 66 58 56 56 56 56 55 55 55 OPPONENT Vermont Fort Adams Worcester Tech Maine Quonset Naval Air Station Connecticut Hampton Central Conn. Brooklyn Brooklyn New Hampshire GAME Date 9/23/16 9/26/42 9/18/48 9/10/05 10/31/42 11/10/51 11/8/52 10/16/54 10/11/58 10/12/68 9/18/82 10/19/91 8/31/96 9/20/03 SEASON YEAR 1985 1984 2003 2005 2001 1982 1991 1990 1996 1974, 1983, 2008 GAME DATE 11/15/80 SEASON YEAR 1980 GAME DATE 11/5/88 11/17/79 9/13/80 9/17/88 9/25/93 10/2/93 10/16/93 10/17/98 10/2/99 10/5/01 9/7/02 11/12/05 9/1/07 9/13/08 11/22/08 SEASON YEAR 1998 1995, 2003 2002, 2008 1978, 1982, 1999, 2005 1988, 1990 1996, 2007 SEASON YEAR 1993 1982 1998 1995 1999, 2003, 2008 2002 1978, 1990 1979, 1994 2006 GAME DATE 9/26/42 9/23/16 10/31/42 9/18/82 9/18/48 11/16/85 10/6/01 9/10/05 11/10/51 11/8/52 9/20/03 TEAM RECORDS POINTS SCORED 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. FIRST DOWNS 1. 2. 3. 5. 7. TOTAL 35 34 31 31 30 30 29 29 29 29 FIRST DOWNS 1. 2. 3. 4. 5. 6. 7. 8. 10. TOTAL 417 312 309 303 272 266 264 254 251 232 OPPONENT Lehigh Connecticut Akron New Hampshire Brown Brown Massachusetts Boston University New Hampshire New Hampshire TOTAL 344 271 247 239 234 229 222 219 219 216 FIRST DOWNS RUSHING 1. 3. 6. 9. TOTAL 26 26 23 23 23 21 21 21 20 20 OPPONENT New Hampshire Central Conn. New Hampshire Hofstra Brown Massachusetts Towson New Hampshire William & Mary Brown FIRST DOWNS RUSHING 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. TOTAL 188 188 173 164 150 146 131 119 118 112 FIRST DOWNS PASSING 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. PUNT RETURNS 1. 2. 3. 4. 5. 6. 7. 8. TOTAL 256 182 142 135 117 113 105 104 102 99 TOTAL 44 41 39 38 36 31 30 29 SEASON YEAR 1985 2005 2003 1984 1984 1991 1982 1996 1990 2009 GAME DATE 10/12/85 11/16/85 11/30/85 10/27/07 10/1/05 9/29/07 10/6/84 10/19/85 10/20/01 9/20/03 SEASON YEAR 1985 1984 2003 2002 2005 1994 2004 1998 2008 1990 GAME DATE 10/20/01 9/11/04 9/20/03 11/15/03 9/29/07 10/1/94 10/8/05 10/27/07 10/16/04 10/1/05 SEASON YEAR 2003 2003 2005 2004 2001 2002 2007 2000 2006 1981 SEASON YEAR 1985 1984 1994 2008 1986 1992 1990 1993 1995 1983 SEASON YEAR 1985 1998 1986 1994 1995 1987 1977, 1978, 1981 1974 PUNT RETURN YARDAGE TOTAL 430 381 353 269 264 263 241 214 212 210 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. KICKOFF RETURNS 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. TOTAL 68 67 65 58 56 53 52 51 50 49 KICKOFF RETURN YARDS TOTAL 1,296 1,291 1,265 1,194 1,122 1,100 1,084 1,046 1,042 1,021 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. INTERCEPTIONS 1. 2. 3. 7 6 5 5 4 4 4 TOTAL Massachusetts Northeastern Boston University Villanova Massachusetts Massachusetts Hofstra INTERCEPTIONS 1. 2. 3. 4. 5. 6. 7. TOTAL 24 22 21 20 19 18 17 INT. RETURN YARDS TOTAL 428 268 252 241 235 212 204 181 180 176 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. PUNTS 1. 3. 5. 6. TOTAL 12 12 11 11 10 9 PUNTS 1. 2. 3. 4. 5. 6. OPPONENT Idaho State Connecticut Maine Massachusetts Maine Richmond TOTAL 85 79 78 77 74 73 73 72 SEASON YEAR 1995 1994 1985 1990 2001 1978 1998 1984 1992 2002 SEASON YEAR 2009 2003 2008 2002 1992, 1993 1987, 2006 1999, 2007 1986, 1991 1988 1985 SEASON YEAR 2009 2008 2003 1991 1986 1992 1993 1989 2006 2007 GAME YEAR 10/20/73 10/21/72 10/19/85 10/11/03 10/8/88 11/7/98 9/22/07 YARDS PUNTING 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. TOTAL 468 432 415 402 383 379 370 364 360 345 345 OPPONENT Idaho State Maine William and Mary Brown Richmond Maine Northeastern Maine Delaware Northeastern Connecticut YARDS PUNTING TOTAL 3,038 2,958 2,891 2,862 2,744 2,712 2,703 2,599 2,591 2,583 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. PUNTING AVERAGE 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. FORCED FUMBLES 1. 2. TOTAL 7 4 4 4 4 4 OPPONENT Delaware Boise State Delaware State Hofstra Connecticut Fordham SEASON FORCED FUMBLES SEASON 1. 2. 3. 4. 5. 6. 7. 8. 9. YEAR 1985 1973 1988 1983 1980 1972, 1999 1982,1984,1989,1991,1998 TOTAL 41.7 40.5 40.4 40.2 39.4 37.9 37.6 37.4 37.4 37.3 TOTAL 22 20 16 14 13 11 10 9 8 GAME DATE 12/5/81 10/6/73 10/31/09 10/3/09 10/25/01 11/3/01 9/23/72 11/14/09 9/9/78 10/12/02 9/26/09 SEASON YEAR 2009 1972 1979 1977 2002 1988 1999 1987 1995 1967 SEASON YEAR 1996 2009 2002 1990 2001 2003 1979 1967 2006 2008 GAME DATE 11/18/95 9/4/93 11/12/94 10/29/05 9/26/09 9/5/09 FUMBLE RECOVERIES TOTAL OPPONENT 1. 4 Northeastern 4 Hampton 4 Hofstra 4 Fordham 5. 3* New Hampshire * recent; accomplished on eight occasions FUMBLE RECOVERIES 1. 2. 3. 4. 8. 10. TOTAL 23 20 19 16 16 16 16 15 15 14 14 PASS BREAKUPS TOTAL OPPONENT 10 Massachusetts 9 Brown 8 Northeastern 8 Connecticut 8 Northeastern 6. 7* William & Mary * recent; accomplished on five occasions 1. 2. 3. PASS BREAKUPS 1. 2. 3. 4. 5. 6. 7. 8. TOTAL 53 45 44 43 42 40 39 38 GAME DATE 11/9/91 10/6/01 10/29/05 9/5/09 10/15/05 SEASON YEAR 1985 1995 1984 1983 1987 1988 1990 1994 2009 1993 2002 GAME DATE 11/23/02 10/16/99 11/9/91 11/23/91 9/13/03 9/17/05 SEASON YEAR 1984 1991 1985 2001 1996 2004 1995, 1999 1988, 1993, 1997 SEASON YEAR 1995 2009 2004 2001 2002, 2005, 2008 1996 1997, 1998, 2000 1994 2007 YEAR 1985 1983 1990 1998 2003 2001 1991 1989 1973 2009 GAME DATE 12/5/81 11/19/88 10/6/73 10/3/81 11/3/01 10/25/01 SEASON YEAR 1972 1988 1977, 1995 1979 1968 1981 2002 1987,1999 W W W. G O R H O D Y. C O M Bob Griffin’s 1985 Rams racked up 56 points against Connecticut on Nov. 16, 1985 75 ALL-TIME COACHING RECORDS Head Coach No coach Marshall Tyler George Cobb Robert Bingham Jim Baldwin Fred Murray Frank Keaney Bill Beck Paul Cieurzo Hal Kopp Ed Doherty Herb Maack John Chironna Jack Zilly Jack Gregory Bob Griffin Floyd Keith Tim Stowers Darren Rizzi Joe Trainer Totals Seasons 1895-97 1898-08 1909-11; 1913-14 1912 1915-16 1917, 1919 1920-40 1941, 1946-49 1942, 1945 1950, 1952-55 1951 1956-1960 1961-62 1963-69 1970-75 1976-92 1992-99 2000-07 2008 2009-present 110 seasons Years 3 10 5 1 2 2 21 5 2 5 1 5 2 7 6 17 7 8 1 1 Won 2 23 17 6 6 2 70 12 5 28 3 17 4 21 22 79 23 33 3 1 376 Lost 7 22 16 3 9 11 87 22 4 11 5 22 11 41 33 107 53 57 9 10 530 Tied 0 8 5 0 1 3 12 2 0 2 0 2 3 2 3 1 0 0 0 0 43 Pct. .222 .509 .513 .667 .406 .219 .450 .361 .556 .707 .375 .439 .306 .344 .404 .425 .303 .367 .250 .091 .421 Bob Griffin is the winningest coach in URI history YEAR-BY-YEAR RECORDS Year 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 76 Record Pct. 1-1-0 .500 0-4-0 .000 1-2-0 .333 5-0-0 1.000 2-3-1 .417 0-2-1 .167 0-2-0 .000 NO TEAM 2-4-1 .357 3-3-1 .500 3-3-1 .500 1-2-1 .375 3-1-2 .667 4-2-0 .667 3-4-0 .429 5-1-1 .786 5-2-1 .688 6-3-0 .667 2-6-0 .250 2-3-3 .438 3-5-0 .375 3-4-1 .438 2-4-2 .375 NO TEAM (WORLD WAR I) 0-7-1 .063 0-4-4 .125 3-5-0 .375 4-4-0 .500 1-5-1 .214 0-7-0 .000 2-5-1 .313 1-6-0 .143 5-3-0 .625 2-7-0 .222 5-2-1 .688 5-2-1 .688 4-4-0 .500 2-5-1 .313 6-2-0 .750 6-3-0 .667 4-4-1 .500 5-4-0 .556 3-4-1 .438 4-4-0 .500 3-4-1 .438 Head Coach No coach No coach No coach Marshall Tyler Marshall Tyler Marshall Tyler Marshall Tyler Marshall Tyler Marshall Tyler Marshall Tyler Marshall Tyler Marshall Tyler Marshall Tyler George Cobb George Cobb George Cobb Robert Bingham George Cobb George Cobb Jim Baldwin Jim Baldwin Fred Murray Fred Murray Year 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 Record Pct. 5-3-0 .625 5-2-1 .688 3-3-0 .500 NO TEAM (WORLD WAR II) NO TEAM (WORLD WAR II) 2-1-0 .667 2-4-0 .333 3-4-0 .429 2-4-1 .357 0-8-0 .000 3-5-0 .375 3-5-0 .375 7-1-0 .875 6-2-0 .750 6-2-0 .750 6-1-2 .778 2-6-0 .333 5-2-1 .688 4-4-0 .500 3-5-1 .389 3-5-0 .375 2-6-1 .278 2-5-2 .333 4-5-0 .444 3-7-0 .300 2-7-0 .222 1-7-1 .167 6-2-1 .722 3-6-0 .333 2-7-0 .222 3-5-0 .222 3-6-0 .333 3-7-0 .300 6-2-2 .700 5-5-0 .500 2-8-0 .200 3-5-0 .375 6-5-0 .545 7-3-0 .700 1-9-1 .137 2-9-0 .182 6-6-0 .500 7-4-0 .636 6-4-0 .600 10-3-0 .769 Head Coach Frank Keaney Bill Beck Paul Cieurzo Paul Cieurzo Bill Beck Bill Beck Bill Beck Bill Beck Hal Kopp Ed Doherty Hal Kopp Hal Kopp Hal Kopp Hal Kopp Herb Maack Herb Maack Herb Maack Herb Maack Herb Maack John Chironna John Chironna Jack Zilly Jack Zilly Jack Zilly Jack Zilly Jack Zilly Jack Zilly Jack Zilly Jack Gregory Jack Gregory Jack Gregory Jack Gregory Jack Gregory Jack Gregory Bob Griffin Bob Griffin Bob Griffin Bob Griffin Bob Griffin Bob Griffin Bob Griffin Bob Griffin Bob Griffin W W W. G O R H O D Y. C O M Year 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 Record 10-3-0 1-10-0 1-10-0 4-7-0 3-8-0 5-6-0 6-5-0 1-10-0 4-7-0 2-9-0 7-4-0 4-6-0 2-9-0 3-8-0 1-10-0 3-8-0 8-3 3-9 4-8 4-7 4-7 4-7 3-8 3-9 1-10 Pct. .769 .091 .091 .363 .273 .454 .545 .091 .364 .182 .636 .400 .182 .273 .091 .273 .727 .250 .333 .364 .364 .364 .278 .250 .091 Head Coach Bob Griffin Bob Griffin Bob Griffin Bob Griffin Bob Griffin Bob Griffin Bob Griffin Bob Griffin Floyd Keith Floyd Keith Floyd Keith Floyd Keith Floyd Keith Floyd Keith Floyd Keith Tim Stowers Tim Stowers Tim Stowers Tim Stowers Tim Stowers Tim Stowers Tim Stowers Tim Stowers Darren Rizzi Joe Trainer ALL-TIME RESULTS 1895 Home 1-0, Away 0-1 Oct. 24 Patwucket High School Nov. 16 at Friends School 1896 Home 0-3, Away 0-1 Oct. 11 Friends School Oct. 18 Camp Street Athletics Oct. 25 Providence High School Jan. 15 at Friends School 1897 Home 1-0, Away 0-2 Oct. 16 at New London High School Oct. 23 at Connecticut* Nov. 13 Patwucket High School *First game against collegiate competition 1-1 Head Coach: None W, 6-0 L, 0-10 0-4 Head Coach: N/A L, 0-8 L, 0-8 L, 0-2 L, 6-18 1-2 Head Coach: N/A L, 0-6 L, 8-22 W, 22-0 Marshall Tyler 1906 1-2-1 Head Coach: Marshall Tyler Oct. 6 Brown Seconds Oct. 13 Springfield Oct. 20 New Hampshire Nov. 3 Bryant & Stratton 1907 Home 2-0-1, Away 1-1-1 Oct. 5 at Massachusetts Oct. 12 Dean Academy Oct. 19 at Worcester Tech Nov. 2 at New Hampshire Nov. 9 St. Andrew's Nov. 26 Connecticut 1908 Home 3-1, Away 1-1 Sept. 25 at Massachusetts Oct. 10 Worcester Tech Oct. 17 St. Andrew's Oct. 24 Bryant & Stratton Nov. 14 New Hampshire Nov. 20 at Connecticut T, 0-0 L, 0-33 L, 0-20 W, 14-0 3-1-2 Head Coach: Marshall Tyler L, 0-11 T, 0-0 W, 14-0 T, 6-6 W, 6-0 W, 42-0 4-2 Head Coach: Marshall Tyler L, 0-2 L, 0-4 W, 21-0 W, 6-0 W, 12-0 W, 12-10 Head Coach 1898-1908 Oct. 19 Oct. 26 Nov. 2 Nov. 9 Nov. 16 at Fordham Woecester Tech New Hampshire Fort Greble at New York University 1913 Home 2-0, Away 0-6 Sept. 27 at Amherst Oct. 4 at Brown Oct. 11 at Maine Oct. 18 at Colby Oct. 25 Fort Adams Nov. 1 at New Hampshire Nov. 8 Rogers High School Nov. 15 at Boston College 1914 Home 2-1-1, Away 0-2-2 Sept. 26 at Wesleyan Oct. 3 at Brown Oct. 10 Boston College Oct. 17 East Greenwich Academy Oct. 24 at Fordham Oct. 31 New Hampshire Nov. 7 Worcester Tech Nov. 14 at New Hampshire W, 6-0 W, 27-0 W, 25-0 W, 14-6 L, 7-14 2-6 Head Coach: George Cobb L, 0-10 L, 0-19 L, 0-44 L, 6-10 W, 13-0 L, 0-13 W, 19-0 L, 0-27 2-3-3 Head Coach: George Cobb T, 0-0 L, 0-20 L, 0-21 W, 6-0 L, 0-21 W, 7-0 T, 6-6 T, 0-0 George Cobb 23-22-8 (10 seasons) 1898 Home 5-0, Away 0-0 Oct. 7 Westerly High School Oct. 15 Westerly Athletic Assoc. Oct. 29 Providence High School Nov. 5 Brown Freshmen Nov. 12 East Greenwich Academy 1898 Home 2-2-1, Away 0-1 Oct. 1 Dean Academy Oct. 14 Brown Freshmen Oct. 18 Westerly High School Nov. 8 South Kingston H.S. Nov. 11 Friends School Nov. 18 at Connecticut 1900 Home 0-1, Away 0-0-2 Oct. 14 at Rogers High School Oct. 21 Connecticut Oct. 28 at Friends School 1901 Home 0-1, Away 0-1 Nov. 3 at Connecticut Nov. 17 Brown Sophomores 5-0 Head Coach: Marshall Tyler W, 12-6 W, 33-0 W, 16-0 W, 5-0 W, 2-0 2-3-1 Head Coach: Marshall Tyler W, 11-0 L, 5-6 T, 0-0 W, 22-0 L, 6-27 L, 0-17 0-1-2 Head Coach: Marshall Tyler T, 5-5 L, 0-43 T, 0-0 0-2 Head Coach: Marshall Tyler L, 0-27 L, 0-10 1902 No Team 1903 2-4-1 Head Coach: Marshall Tyler Oct. 3 Fall River High School Oct. 14 Massachusetts Oct. 17 Brown Freshmen Oct. 24 Friends School Oct. 31 Worcester Tech Nov. 7 Dean Academy Nov. 14 Connecticut 1904 Head Coach: Marshall Tyler Sept. 28 Westerly High School Oct. 1 Springfield Oct. 8 Durfee High School Oct. 15 Thibodeau Academy Oct. 29 Dean Academy Nov. 12 Brown Freshmen Nov. 19 Connecticut 1905 Head Coach: Marshall Tyler Sept. 23 at New Hampshire Oct. 4 East Greenwich Academy Oct. 7 Massachusetts Oct. 21 Brown Seconds Oct. 28 Brown Freshmen Nov. 4 Brown Sophomores Nov. 11 Trinity Jim Baldwin Head Coach 1909-11; 1913-14 T, 0-0 L, 0-46 L, 0-22 W, 5-0 (forfeit) L, 0-45 L, 0-30 W, 11-6 17-16-5 (five seasons) 1909 Home 3-1, Away 0-3 Sept. 29 at Brown Oct. 9 New York University Oct. 16 Boston College Oct. 30 at Worcester Tech Nov. 6 St. Andrew's Nov. 13 at New Hampshire Nov. 20 Connecticut 1910 Home 3-0, Away 2-1-1 Sept. 24 at Massachusetts Oct. 1 at Tufts Oct. 5 at Brown Oct. 22 St. Andrew's Oct. 29 at Connecticut Nov. 5 Worcester Tech Nov. 12 New Hampshire 1911 Home 2-0, Away 3-2-1 Sept. 23 at Massachusetts Sept. 30 at Maine Oct. 4 at Brown Oct. 14 Norwich Oct. 21 at New York University Oct. 28 at New Hampshire Nov. 4 at Worcester Tech Nov. 11 Boston College 6-9-1 (two seasons) 3-4 Head Coach: George Cobb L, 0-6 L, 0-7 W, 9-0 L, 0-11 W, 13-0 L, 5-11 W, 51-0 5-1-1 Head Coach: George Cobb T, 0-0 W, 5-0 L, 0-5 W, 22-0 W, 33-0 W, 10-0 W, 6-0 5-2-1 Head Coach: George Cobb W, 5-0 W, 3-0 L, 0-12 W, 3-0 T, 0-0 W, 9-8 L, 0-3 W, 25-0 1915 Home 2-0, Away 1-5 Sept. 25 at Brown Oct. 2 at Wesleyan Oct. 16 at Worcester Tech Oct. 23 at Connecticut Oct. 30 at Union Nov. 6 St. Stephens Nov. 13 at Fordham Nov. 22 New Hampshire 1916 Home 2-0, Away 1-4-1 Sept. 23 Fort Adams Sept. 30 at Brown Oct. 7 at Wesleyan Oct. 14 at Maine Oct. 21 at Colgate Oct. 28 Connecticut Nov. 4 at Boston College Nov. 18 at New Hampshire W, 54-0 L, 0-27 W, 28-0 W, 32-0 L, 0-28 L, 0-7 T, 10-10 Head Coach 1912 3-3-1 1912 Home 4-0, Away 2-3 Sept. 21 at Massachusetts Sept. 28 Pawtucket Athletic Club Oct. 5 at Brown Oct. 12 at Maine 6-3 Head Coach: Robert W. Bingham W, 7-0 W, 20-0 L, 0-14 L, 0-18 W W W. G O R H O D Y. C O M 3-4-1 Head Coach: Jim Baldwin W, 69-0 L, 0-18 T, 3-3 W, 13-0 L, 0-33 W, 13-6 L, 0-39 L, 0-12 Head Coach 1917; 1919 2-11-3 (two seasons) 1917 6-3 (one season) 3-5 Head Coach: Jim Baldwin L, 0-38 L, 0-12 L, 0-6 W, 9-7 L, 0-3 W, 47-0 L, 0-7 W, 10-0 Fred Murray Robert Bingham 3-3-1 L, 0-6 W, 10-0 L, 0-11 T, 5-5 W, 40-0 W, 34-0 L, 29-12 Head Coach 1915-16 Home 1-0-1, Away 1-4-1 Sept. 29 at Brown Oct. 6 at Wesleyan Oct. 13 at Worcester Tech Oct. 20 New Hampshire Oct. 27 at Holy Cross Nov. 3 at Boston College Nov. 10 at New York University Nov. 17 Fort Kearney 1918 2-4-2 Head Coach: Fred Murray L, 0-27 T, 0-0 W, 30-0 T, 0-0 L, 0-13 L, 0-48 L, 6-9 W, 12-0 No Team - World War I 77 ALL-TIME RESULTS 1919 Home 0-2, Away 0-5-1 Sept. 27 at Brown Oct. 11 at Wesleyan Oct. 18 at Boston University Oct. 25 at St. Stephens Nov. 1 at Holy Cross Nov. 8 Massachusetts Nov. 15 at Worcester Tech Nov. 22 Connecticut 0-7-1 Head Coach: Fred Murray L, 0-27 L, 0-35 L, 6-14 L, 2-31 L, 3-29 L, 11-19 T, 6-6 L, 3-7 Head Coach 1920-40 1921 Home 2-0, Away 1-5 Sept. 17 at New London Sub Base Sept. 24 at Brown Oct. 1 at Bowdoin Oct. 15 at Maine Oct. 22 at Worcester Tech Oct. 29 at Boston University Nov. 5 Massachusetts Nov. 12 at Bates Nov. 19 Connecticut 1922 Home 2-2, Away 2-2 Sept. 23 at Coast Guard Academy Sept. 30 at Brown Oct. 14 St. Stephens Oct. 21 Delaware Oct. 28 at New York University Nov. 4 Worcester Tech Nov. 11 Lowell Textile Nov. 18 at Connecticut 1923 Home 1-1, Away 0-4-1 Sept. 22 at Maine Oct. 6 at Harvard Oct. 13 at New Hampshire Oct. 27 at New York University Nov. 3 at Worcester Tech Nov. 10 Coast Guard Academy Nov. 17 Connecticut 1924 Home 0-4, Away 0-3 Sept. 27 Maine Oct. 11 New Hampshire Oct. 18 Lowell Textile Oct. 25 at CCNY Nov. 1 Worcester Tech (HC)* Nov. 8 at Bates Nov. 15 at Connecticut * First Homecoming 1925 Home 2-1-1, Away 0-4 Sept. 26 at Brown Oct. 3 at Western Maryland Oct. 10 Lowell Textile Oct. 17 at New Hampshire Oct. 24 CCNY Oct. 31 at Worcester Tech Nov. 7 Bates Nov. 14 Connecticut (HC) 78 1927 1928 70-87-12 (21 seasons) Home 0-2, Away 0-2-4 Sept. 25 at Brown Oct. 2 at Wesleyan Oct. 16 at Maine Oct. 23 Boston University Oct. 30 at Union Nov. 6 at Massachusetts Nov. 13 Worcester Tech Nov. 20 at Connecticut Home 1-2, Away 0-4 Sept. 26 at Brown Oct. 2 Maine Oct. 9 at Lowell Textile Oct. 16 New Hampshire (HC) Oct. 23 at CCNY Nov. 6 Worcester Tech Nov. 13 at Connecticut Home 3-1, Away 2-2 Sept. 24 at Brown Oct. 1 at Maine Oct. 8 Lowell Textile Oct. 15 at New Hampshire Oct. 22 CCNY Oct. 29 at Worcester Tech Nov. 5 Coast Guard Academy Nov. 12 Connecticut (HC) Frank Keaney 1920 1926 0-4-4 Head Coach: Frank Keaney L, 0-25 L, 0-20 T, 7-7 L, 0-7 T, 7-7 T, 7-7 L, 0-7 T, 0-0 3-5 Head Coach: Frank Keaney L, 0-13 L, 0-6 L, 0-9 L, 3-7 W, 27-0 L, 0-14 W, 7-2 Cancelled - Snow W, 27-21 4-4 Head Coach: Frank Keaney W, 12-0 L, 0-27 L, 6-7 W, 7-0 L, 7-23 W, 19-0 L, 3-6 W, 12-7 1-5-1 Head Coach: Frank Keaney L, 0-14 L, 0-35 L, 0-13 L, 0-21 T, 0-0 W, 13-0 L, 0-7 0-7 Head Coach: Frank Keaney L, 0-37 L, 6-17 L, 0-6 L, 0-13 L, 9-14 L, 7-13 L, 0-22 2-5-1 Head Coach: Frank Keaney L, 0-33 L, 0-7 W, 12-0 L, 0-26 W, 12-0 L, 18-26 L, 0-13 T, 0-0 Home 2-3, Away 0-4 Sept. 22 Coast Guard Destroyer* Sept. 29 at Maine Oct. 6 Coast Guard Academy Oct. 13 New Hampshire (HC) Oct. 20 Newport Naval Training Station Oct. 27 at Lowell Textile Nov. 10 Worcester Tech Nov. 17 at Connecticut Nov. 24 at Brown * First Game at Meade Stadium 1929 Home 3-0, Away 2-2-1 Sept. 21 Arnold Sept. 28 at Maine Oct. 5 at Brown Oct. 19 at Bates Oct. 26 Lowell Textile Nov. 2 at Coast Guard Academy Nov. 9 at Worcester Tech Nov. 16 Connecticut (HC) 1930 Home 5-0, Away 0-2-1 Sept. 20 Arnold Sept. 27 at Brown Oct. 4 at Maine Oct. 18 Bates Oct. 25 Coast Guard Academy Nov. 1 Boston University Nov. 8 Worcester Tech (HC) Nov. 15 at Connecticut 1931 Home 2-0, Away 2-4 Sept. 26 at Maine Oct. 3 at Brown Oct. 17 at Bates Oct. 24 Coast Guard Academy (HC) Oct. 31 at Boston University Nov. 7 at Worcester Tech Nov. 14 Connecticut Nov. 28 at Providence 1932 Home 1-3, Away 1-2-1 Sept. 24 at Maine Oct. 1 at Brown Oct. 8 Boston University Oct. 15 Bates Oct. 22 Arnold Oct. 29 at Coast Guard Academy Nov. 5 Worcester Tech (HC) Nov. 12 at Connecticut 1933 Home 4-1, Away 2-1 Sept. 23 Brooklyn Sept. 30 at Maine Oct. 7 at Brown Oct. 14 Arnold Oct. 21 Massachusetts Oct. 28 Coast Guard Academy Nov. 4 at Worcester Tech Nov. 11 Connecticut (HC) 1934 Home 2-1, Away 4-2 Sept. 22 Brooklyn Sept. 29 at Maine Oct. 6 at Brown Oct. 13 Northeastern Oct. 20 at Massachusetts 1-6 Head Coach: Frank Keaney L, 0-14 L, 0-7 L, 0-7 L, 6-7 L, 0-29 W, 26-7 L, 0-33 5-3 Head Coach: Frank Keaney L, 0-27 L, 0-27 W, 26-0 W, 20-18 L, 19-20 W, 20-14 W, 14-6 W, 12-0 2-7 Head Coach: Frank Keaney L, 0-7 L, 6-20 W, 6-0 L, 0-12 W, 7-0 L, 0-21 L, 0-13 L, 0-24 L, 7-33 5-2-1 Head Coach: Frank Keaney W, 19-0 L, 0-6 L, 6-14 T, 6-6 W, 26-7 W, 26-0 W, 39-0 W, 19-6 5-2-1 Head Coach: Frank Keaney W, 38-0 L, 0-7 L, 12-13 W, 14-0 W, 27-0 W, 14-0 W, 45-0 T, 0-0 4-4 Head Coach: Frank Keaney W, `8-7 L, 0-18 L, 0-3 W, 33-7 L, 7-25 W, 34-0 W, 14-0 L, 0-6 2-5-1 Head Coach: Frank Keaney L, 0-12 L, 0-19 L, 0-7 L, 0-6 W, 6-0 W, 13-0 L, 0-12 T, 19-19 Oct. 27 Nov. 3 Nov. 10 Nov. 17 at Coast Guard Academy Worcester Tech (HC) at Connecticut at Providence 1935 Home 2-1, Away 2-3-1 Sept. 21 at Holy Cross Sept. 28 at Maine Oct. 5 at Brown Oct. 12 at Northeastern Oct. 19 Massachusetts Oct. 26 Coast Guard Academy Nov. 2 at Worcester Tech Nov. 9 Connecticut (HC) Nov. 16 at Providence 1936 Home 3-0, Away 2-3, Neutral 0-1 Sept. 19 American International Sept. 26 at Maine Oct. 3 at Brown Oct. 10 Tufts Oct. 17 vs. Massachusetts! Oct. 24 at Northeastern Oct. 31 Worcester Tech (HC) Nov. 7 at Connecticut Nov. 13 at Providence! ! Night game at Cranston Stadium (R.I.) 1937 Home 1-2, Away 2-2-1 Sept. 25 at Maine Oct. 2 at Brown Oct. 9 at Tufts Oct. 16 Massachusetts Oct. 23 Northeastern Oct. 30 at Worcester Tech Nov. 6 Connecticut (HC) Nov. 12 at Providence 1938 Home 1-1, Away 3-3 Sept. 24 at Maine Oct. 1 at Holy Cross Oct. 8 American International Oct. 15 at Massachusetts Oct. 22 at Brown Oct. 29 Worcester Tech (HC) Nov. 5 at Connecticut Nov. 11 at Providence 1939 Home 2-1, Away 1-3-1 Sept. 22 at Providence Sept. 30 at Brown Oct. 7 at Maine Oct. 14 Brooklyn Oct. 21 Massachusetts Oct. 28 at Northeastern Nov. 4 at Worcester Tech Nov. 11 Connecticut (HC) 1940 Home 3-0, Away 2-3 Sept. 21 Northeastern Sept. 28 at Maine Oct. 5 at Brown Oct. 12 Lowell Textile Oct. 19 at Massachusetts Oct. 23 at Providence Nov. 2 Worcester Tech (HC) Nov. 9 at Connecticut 4-4-1 Head Coach: Frank Keaney L, 0-32 L, 0-7 W, 13-7 T, 6-6 L, 6-7 W, 13-7 W, 23-6 W, 7-0 L, 0-13 5-4 Head Coach: Frank Keaney W, 38-0 W, 7-0 L, 6-7 W, 7-0 L, 8-13 L, 12-15 W, 19-0 L, 0-33 W, 19-0 3-4-1 Head Coach: Frank Keaney T, 0-0 L, 6-13 W, 14-7 W, 12-6 L, 6-8 L, 2-12 L, 7-13 W, 13-3 4-4 Head Coach: Frank Keaney W, 14-6 L, 13-48 W, 31-0 W, 20-0 L, 21-40 L, 14-19 W, 21-20 L, 7-19 3-4-1 Head Coach: Frank Keaney L, 0-6 L, 0-34 L, 0-14 W, 40-0 W, 23-20 W, 7-6 T, 7-7 L, 14-20 5-3 Head Coach: Frank Keaney W, 10-0 L, 0-7 L, 17-20 W, 48-0 W, 9-3 L, 0-25 W, 18-0 W, 13-12 Bill Beck 6-2 Head Coach: Frank Keaney W, 12-0 W, 6-0 L, 0-26 W, 13-6 L, 12-14 W, 20-12 W, 20-7 W, 20-7 Head Coach 1941; 1946-49 12-22-2 (five seasons) 6-3 Head Coach: Frank Keaney W, 31-0 W, 6-0 L, 0-13 L, 0-6 W, 7-0 W W W. G O R H O D Y. C O M W, 19-0 W, 44-0 W, 19-0 L, 7-21 1941 Home 3-0, Away 2-2-1 Sept. 20 at Coast Guard Academy Sept. 27 at Maine Oct. 4 Lowell Textile 5-2-1 Head Coach: Bill Beck L, 0-38 W, 20-13 W, 39-0 ALL-TIME RESULTS Oct. 11 Oct. 18 Oct. 22 Nov. 1 Nov. 8 at Brown Massachusetts at Providence at Worcester Tech Connecticut (HC) L, 7-14 W, 34-6 T, 0-0 W, 6-0 W, 6-0 Paul Cieurzo Head Coach 1942; 1945 1950 5-4-0 (two seasons) 1942 Home 1-0, Away 2-3 Sept. 26 at Vermont Oct. 3 at Brown Oct. 17 at Massachusetts Oct. 24 at New Hampshire Oct. 31 Worcester Tech (HC) Nov. 7 at Connecticut 3-3 Head Coach: Paul Cieurzo W, 70-13 L, 0-28 W, 21-6 L, 13-14 W, 66-13 L, 6-13 1943 No Team - World War II 1944 No Team - World War II 1945 Home 1-0, Away 1-1 Oct. 13 at Maine Oct. 20 at Rutgers Nov. 3 Boston University 1946 Home 0-1, Away 2-3 Sept. 28 at Maine Oct. 5 at New Hampshire Oct. 12 at Brown Oct. 19 at Massachusetts Oct. 26 at Boston University Nov. 9 Connecticut (HC) 1947 Home 2-2, Away 1-2 Yankee Conference: 1-3 (4th) Sept. 27 Maine Oct. 4 New Hampshire Oct. 11 at Brown Oct. 18 at Massachusetts Oct. 25 Coast Guard Academy Nov. 1 Massachusetts Nov. 8 at Connecticut 1948 Home 2-1, Away 0-3-1 Yankee Conference: 1-3 (4th) Sept. 18 Quonset Air Station Sept. 25 at Maine Oct. 2 at New Hampshire Oct. 9 at Brown Oct. 16 Massachusetts Oct. 30 at Springfield Nov. 6 Connecticut (HC) 1949 Home 0-4, Away 0-4 Yankee Conference: 0-4 (4th) Sept. 24 Maine Oct. 1 New Hampshire Oct. 8 at Brown Oct. 15 at Massachusetts Oct. 22 at Temple Oct. 29 Springfield (HC) Nov. 5 at Connecticut Nov. 12 Buffalo 2-1 Head Coach: Paul Cieurzo W, 10-7 L, 7-39 W, 30-0 2-4 Head Coach: Bill Beck W, 14-13 L, 12-25 L, 0-29 W, 14-6 L, 6-29 L, 0-33 3-4 Head Coach: Bill Beck L, 13-33 L, 7-33 L, 6-55 W, 20-13 W, 27-7 W, 38-13 L, 0-23 2-4-1 Head Coach: Bill Beck W, 56-0 L, 7-13 L, 7-19 L, 0-33 W, 19-12 T, 21-21 L, 6-28 0-8 Head Coach: Bill Beck L, 7-19 L, 20-28 L, 0-46 L, 19-32 L, 6-47 L, 13-34 L, 0-23 L, 7-39 Home 3-0, Away 0-5 Yankee Conference: 2-3 (3rd) Sept. 23 Bates Sept. 30 at Maine Oct. 7 at New Hampshire Oct. 14 at Brown Oct. 21 Massachusetts Oct. 28 at Buffalo Nov. 4 at Springfield Nov. 18 Connecticut (HC) 1951 Home 3-1, Away 0-4 Yankee Conference: 1-3 (4th) Sept. 22 at Northeastern Sept. 29 Maine Oct. 6 New Hampshire Oct. 13 at Brown Oct. 20 at Massachusetts Nov. 3 Springfield (HC) Nov. 10 Brooklyn Nov. 17 at Connecticut 1952 Home 3-0, Away 4-1 Yankee Conference: 3-1 (t-1st) Sept. 20 Northeastern Sept. 27 at Maine Oct. 4 at New Hampshire Oct. 11 at Brown Oct. 18 Massachusetts Nov. 1 at Springfield Nov. 8 at Brooklyn Nov. 15 Connecticut 1953 Home 2-1, Away 4-1 Sept. 20 at Northeastern Sept. 27 Maine Oct. 3 New Hampshire (HC) Oct. 10 at Brown Oct. 17 at Massachusetts Oct. 24 at Hofstra Oct. 31 Springfield Nov. 14 at Connecticut 1954 Home 4-0, Away 2-2 Yankee Conference: 3-1 (2nd) Sept. 18 Northeastern Sept. 25 at Maine Oct. 2 at New Hampshire Oct. 9 at Brown Oct. 16 Massachusetts Oct. 23 Hofstra Oct. 30 at Springfield Nov. 13 Connecticut (HC) 1955 Home 2-0-1, Away 4-0-1, Neutral 0-1 Yankee Conference: 4-0-1 (1st) Sept. 17 at Northeastern Sept. 24 Maine Oct. 1 New Hampshire Oct. 8 at Vermont Oct. 15 at Massachusetts Oct. 22 at Brown Oct. 29 Springfield (HC) Nov. 12 at Connecticut Dec. 4 vs. Jacksonville State! ! Refrigerator Bowl (Evansville, Ind.) Hal Kopp Herb Maack Head Coach 1950; 1952-55 Head Coach 1956-60 28-11-2 (five seasons) 17-22-2 (five seasons) 3-5 Head Coach: Hal Kopp W, 34-7 L, 0-13 L, 14-27 L, 13-55 W, 38-27 L, 12-33 L, 0-32 W, 14-7 3-5 Head Coach: Ed Doherty L, 0-21 L, 0-12 W, 27-0 L, 13-20 L, 7-40 W, 25-19 W, 52-0 L, 6-21 7-1 Head Coach: Hal Kopp W, 32-0 L, 0-13 W, 27-7 W, 7-6 W, 26-7 W, 40-20 W, 55-7 W, 28-25 6-2 Head Coach: Hal Kopp W, 13-7 W, 13-6 L, 13-14 W, 19-13 W, 41-14 L, 12-27 W, 18-6 W, 19-13 6-2 Head Coach: Hal Kopp W, 13-7 W, 14-7 L, 7-33 L, 0-35 W, 52-6 W, 46-14 W, 13-9 W, 20-0 6-1-2 Head Coach: Hal Kopp W W W. G O R H O D Y. C O M T, 13-13 W, 7-0 T, 13-13 W, 16-0 W, 39-15 W, 19-7 W, 20-7 W, 25-0 L, 10-12 1956 Home 2-2, Away 0-4 Yankee Conference: 1-4 (6th) Sept. 22 Northeastern Sept. 29 at Maine Oct. 6 at New Hampshire Oct. 13 Vermont Oct. 20 Massachusetts Oct. 27 at Brown Nov. 3 at Springfield Nov. 17 Connecticut (HC) 1957 Home 2-1, Away 3-1-1 Yankee Conference: 3-0-1 (t-1st) Sept. 21 at Northeastern Sept. 28 Maine Oct. 5 New Hampshire Oct. 12 at Brandeis Oct. 19 at Massachusetts Oct. 26 at Brown Nov. 2 Springfield (HC) Nov. 16 at Connecticut 1958 Home 2-2, Away 2-2 Yankee Conference: 2-2 (3rd) Sept. 20 Northeastern Sept. 27 at Maine Oct. 4 at New Hampshire Oct. 11 Brandeis Oct. 18 Massachusetts Oct. 25 at Brown Nov. 1 at Springfield Nov. 15 Connecticut (HC) 1959 Home 0-2-1, Away 3-3 Yankee Conference: 1-1-1 (t-4th) Sept. 19 at Northeastern Sept. 26 Maine Oct. 3 New Hampshire Oct. 10 at Brandeis Oct. 17 at Massachusetts Oct. 24 at Brown Oct. 31 Springfield (HC) Nov. 7 at Buffalo Nov. 14 at Connecticut 1960 Home 2-1, Away 1-4 Yankee Conference: 1-4 (5th) Sept. 17 Northeastern Sept. 24 at Maine Oct. 1 at New Hampshire Oct. 8 Vermont Oct. 15 Massachusetts Oct. 22 at Brown Oct. 29 at Springfield Nov. 12 at Connecticut 2-6 Head Coach: Herb Maack W, 13-12 L, 7-40 L, 7-13 L, 13-39 W, 34-13 L, 7-27 L, 0-40 L, 6-51 5-2-1 Head Coach: Herb Maack W, 12-7 W, 25-7 W, 28-13 W, 32-7 W, 27-13 L, 0-21 L, 0-14 T, 0-0 4-4 Head Coach: Herb Maack L, 6-26 L, 8-37 W, 20-13 W, 52-22 W, 24-8 L, 6-47 W, 28-14 L, 8-36 3-5-1 Head Coach: Herb Maack W, 8-6 T, 0-0 L, 0-45 W, 20-0 W, 30-6 L, 0-6 L, 0-21 L, 6-41 L, 0-34 3-5 Head Coach: Herb Maack W, 20-0 L, 0-7 L, 6-13 W, 48-8 L, 16-34 L, 14-36 W, 22-10 L, 6-42 John Chironna Head Coach 1961-62 4-11-3 (two seasons) 79 ALL-TIME RESULTS 1961 Home 0-3-1, Away 2-3 Yankee Conference: 1-4 (5th) Sept. 23 at Northeastern Sept. 30 Maine Oct. 7 New Hampshire Oct. 14 at Vermont Oct. 21 at Massachusetts Oct. 28 at Brown Nov. 4 Springfield Nov. 11 at Hofstra Nov. 18 Connecticut (HC) 1962 Home 0-4, Away 2-1-2 Yankee Conference: 1-3 (t-4th) Sept. 22 Northeastern Sept. 29 at Maine Oct. 6 at New Hampshire Oct. 13 Vermont Oct. 20 Massachusetts (HC) Oct. 27 at Brown Nov. 3 at Springfield Nov. 10 Hofstra Nov. 17 at Connecticut 2-6-1 Head Coach: John Chironna 1967 L, 13-26 L, 20-22 L, 0-20 W, 18-6 L, 0-25 W, 12-9 T, 6-6 L, 0-12 L, 0-27 Home 3-1, Away 3-1-1 Yankee Conference: 2-2-1 (3rd) Sept. 23 at Delaware Sept. 30 at Brown Oct. 7 New Hampshire (HC) Oct. 14 at Vermont Oct. 21 at Massachusetts Oct. 28 Bucknell Nov. 4 at Boston University Nov. 11 Maine Nov. 18 Connecticut 2-5-2 1968 Head Coach: John Chironna L, 0-28 W, 14-7 T, 6-6 L, 12-21 L, 8-42 T, 12-12 W, 24-13 L, 8-20 L, 0-27 Home 3-1, Away 0-5 Yankee Conference: 2-3 (t-3rd) Sept. 21 at Temple Sept. 28 at Brown Oct. 5 Southern Connecticut Oct. 12 Vermont (HC) Oct. 19 Massachusetts Oct. 26 at Maine Nov. 2 at New Hampshire Nov. 9 Boston University Nov. 16 at Connecticut 1969 Home 2-3, Away 0-4 Yankee Conference: 1-4 (t-5th) Sept. 20 Temple Sept. 27 at Brown Oct. 4 Maine (HC) Oct. 11 at Vermont Oct. 18 at Massachusetts Oct. 25 Cortland State Nov. 1 New Hampshire Nov. 8 at Boston University Nov. 15 Connecticut Jack Zilly Head Coach 1963-69 21-41-2 (seven seasons) 1963 Home 3-1, Away 1-4 Yankee Conference: 2-3 (4th) Sept. 21 at Northeastern Sept. 28 Maine Oct. 5 New Hampshire (HC) Oct. 12 at Vermont Oct. 19 at Massachusetts Oct. 26 at Brown Nov. 2 Springfield Nov. 9 at Hofstra Nov. 16 Connecticut 1964 Home 1-3, Away 2-4 Yankee Conference: 1-4 (5th) Sept. 18 Northeastern! Sept. 26 at Maine Oct. 3 at New Hampshire Oct. 10 Vermont (HC) Oct. 17 Massachusetts Oct. 24 at Brown Oct. 31 at Springfield Nov. 7 Hofstra Nov. 14 at Connecticut Nov. 21 at Boston University ! Providence City Stadium (R.I.) 1965 Home 1-3, Away 1-4 Yankee Conference: 1-4 (5th) Sept. 25 at Brown Oct. 2 New Hampshire Oct. 9 at Vermont Oct. 16 at Massachusetts Oct. 23 Maine (HC) Oct. 30 Springfield Nov. 6 Temple Nov. 13 Connecticut Nov. 20 at Boston University 1966 Home 0-4, Away 1-3-1 Yankee Conference: 1-3-1 (5th) Sept. 24 at Brown Oct. 1 at New Hampshire Oct. 8 Vermont (HC) Oct. 15 Massachusetts Oct. 22 at Maine Oct. 29 at Bucknell Nov. 5 Temple Nov. 12 at Connecticut Nov. 19 Boston University 80 6-2-1 Head Coach: Jack Zilly W, 28-17 W, 12-8 W, 13-6 T, 0-0 L, 24-28 W, 27-7 W, 7-6 W, 34-12 L, 18-26 3-6 Head Coach: Jack Zilly L, 0-28 L, 9-10 W, 33-8 W, 52-10 W, 14-9 L, 14-21 L, 6-27 L, 3-20 L, 6-35 2-7 Head Coach: Jack Zilly L, 3-47 L, 0-21 L, 7-35 L, 14-41 L, 9-21 W, 13-3 W, 14-6 L, 13-27 L, 15-25 Jack Gregory 4-5 Head Coach: Jack Zilly 3-7 W, 20-11 L, 15-23 W, 22-8 L, 8-16 L, 0-7 L, 14-30 W, 21-15 L, 7-28 L, 7-28 L, 13-20 2-7 Head Coach: Jack Zilly W, 14-6 W, 23-6 L, 6-26 L, 0-30 L, 0-36 L, 6-7 L, 0-28 L, 0-14 L, 3-28 1-7-1 Head Coach: Jack Zilly L, 27-40 W, 17-6 L, 7-21 L, 9-14 L, 6-21 L, 7-33 L, 19-21 T, 0-0 L, 14-30 Home 2-1-1, Away 3-1-1, Neutral 1-0 Yankee Conference: 4-1-1 (2nd) Sept. 22 at Northeastern Sept. 29 at Brown Oct. 6 Maine Oct. 13 at Vermont Oct. 20 at Massachusetts Oct. 27 Boston University Nov. 3 New Hampshire (HC) Nov. 10 at Temple Nov. 17 Connecticut Nov. 22 Air Force-Europe* * Turkey Bowl (Frankfurt, Germany) 1974 Home 4-2, Away 1-3 Yankee Conference: 3-3 (t-3rd) Sept. 14 Temple Sept. 21 Northeastern Sept. 28 at Brown Oct. 5 at Maine Oct. 12 Vermont (HC) Oct. 19 Massachusetts Oct. 26 Boston University Nov. 2 at New Hampshire Nov. 9 Bridgeport Nov. 16 at Connecticut 1975 Home 1-4, Away 1-4 Yankee Conference: 1-4 (4th) Sept. 13 St. Mary's* Sept. 20 at Northeastern Sept. 27 at Brown Oct. 4 Maine (HC) Oct. 11 C.W. Post Oct. 18 at Massachusetts Oct. 24 at Boston University Nov. 1 New Hampshire Nov. 8 at Temple Nov. 15 Connecticut * Cranston Stadium (R.I.) 6-2-2 Head Coach: Jack Gregory W, 35-7 T, 20-20 L, 7-20 W, 15-14 W, 41-35 W, 14-9 W, 40-16 L, 0-43 T, 7-7 W, 34-6 5-5 Head Coach: Jack Gregory L, 7-38 W, 48-36 L, 15-45 L, 19-29 W, 14-0 L, 7-17 W, 13-7 L, 14-29 W, 45-8 W, 14-13 2-8 Head Coach: Jack Gregory W, 33-0 L, 16-21 L, 20-41 L, 14-23 L, 0-3 L, 7-23 W, 21-6 L, 6-23 L, 6-45 L, 10-21 Head Coach 1970-75 L, 13-28 W, 20-16 L, 13-25 L, 6-21 L, 0-57 L, 7-33 W, 21-20 W, 23-7 W, 13-12 Head Coach: Jack Zilly 1973 Bob Griffin 22-33-3 (six seasons) 1970 Home 2-1, Away 1-4 Yankee Conference: 3-2 (t-3rd) Sept. 26 at Brown Oct. 3 at Maine Oct. 10 Vermont Oct. 17 Massachusetts (HC) Oct. 24 Boston University Oct. 31 at New Hampshire Nov. 7 at Temple Nov. 14 at Connecticut 1971 Home 0-4, Away 3-2 Yankee Conference: 2-3 (t-4th) Sept. 18 at Northeastern Sept. 25 at Brown Oct. 2 Maine (HC) Oct. 9 at Vermont Oct. 16 at Massachusetts Oct. 23 at Boston University Oct. 30 New Hampshire Nov. 6 Temple Nov. 13 Connecticut 1972 Home 2-2, Away 1-5 Yankee Conference: 0-5 (6th) Sept. 10 Hampton* Sept. 23 Northeastern Sept. 30 at Brown Oct. 7 at Maine Oct. 14 Vermont (HC) Oct. 21 Massachusetts Oct. 28 at Boston University Nov. 4 at New Hampshire Nov. 11 at Temple Nov. 18 at Connecticut * First night game in Kingston (R.I.) Head Coach 1976-92 79-107-1 (17 seasons) 3-5 Head Coach: Jack Gregory L, 14-21 W, 23-6 W, 40-13 W, 14-7 L, 0-21 L, 7-59 L, 15-18 L, 12-33 3-6 Head Coach: Jack Gregory L, 22-36 W, 34-21 L, 7-21 W, 34-22 W, 31-3 L, 7-28 L, 0-26 L, 13-40 L, 6-10 3-7 Head Coach: Jack Gregory W W W. G O R H O D Y. C O M W, 27-0 W, 27-7 W, 21-17 L, 7-10 L, 13-14 L, 7-42 L, 13-31 L, 10-14 L, 0-22 L, 21-42 1976 Home 1-2, Away 2-3 Yankee Conference: 2-3 (t-3rd) Sept. 18 Northeastern Sept. 25 at Brown Oct. 2 at Maine Oct. 16 Massachusetts Oct. 23 Boston University (HC) Oct. 30 at Holy Cross Nov. 6 at New Hampshire Nov. 13 at Connecticut 1977 Home 4-1, Away 2-4 Yankee Conference: 4-1 (2nd) Sept. 10 at Northeastern Sept. 17 Holy Cross Sept. 24 at Brown Oct. 1 Maine (HC) Oct. 8 Lehigh Oct. 15 at Massachusetts Oct. 22 at Boston University Oct. 29 New Hampshire Nov. 5 at Kings Point Nov. 12 Connecticut Nov. 19 at VMI 1978 Home 4-1, Away 3-2 Yankee Conference: 3-2 (t-2nd) Sept. 9 at Delaware Sept. 16 vs. Northeastern* Sept. 30 at Brown Oct. 7 at Maine 3-5 Head Coach: Bob Griffin W, 15-14 L, 0-3 W, 14-9 L, 7-14 L, 0-36 L, 14-33 L, 6-31 W, 17-14 6-5 Head Coach: Bob Griffin L, 12-21 W, 14-0 L, 10-28 W, 28-0 L, 16-42 L, 6-37 W, 31-22 W, 21-20 W, 27-3 W, 14-7 L, 7-20 7-3 Head Coach: Bob Griffin L, 0-37 W, 27-13 W, 17-3 W, 47-0 ALL-TIME RESULTS Oct. 14 Virginia Union** Oct. 21 Massachusetts (HC) Oct. 28 Boston University Nov. 4 at New Hampshire Nov. 11 Kings Point Nov. 18 at Connecticut * Brown Stadium; ** First game at renovated Meade Stadium 1979 Home 1-3-1, Away 0-6 Yankee Conference: 1-4 (5th) Sept. 8 Delaware Sept. 15 at Northeastern Sept. 22 at Holy Cross Sept. 29 at Brown Oct. 6 Maine (HC) Oct. 20 at Massachusetts Oct. 27 at Boston University Nov. 3 New Hampshire Nov. 10 Kings Point Nov. 17 Connecticut Dec. 1 at Florida A&M 1980 Home 2-2, Away 0-7 Yankee Conference: 0-5 (6th) Sept. 6 at Holy Cross Sept. 13 Northeastern Sept. 20 at Maine Oct. 4 Massachusetts (HC) Oct. 11 at Virginia Tech* Oct. 18 Boston University Oct. 25 Southern Connecticut Nov. 1 at New Hampshire Nov. 8 at Lehigh Nov. 15 at Connecticut Nov. 22 at Brown * Largest crowd to ever witness URI football game (40,100) 1981 Home 5-1, Away 1-5 Yankee Conference: 4-1 (t-1st) Sept. 12 at Boise State Sept. 19 Maine Sept. 26 Kings Point Oct. 3 at Massachusetts Oct. 10 Northeastern (HC) Oct. 17 at Boston University Oct. 24 at Delaware Oct. 31 New Hampshire Nov. 7 Brown Nov. 14 Connecticut Nov. 21 at Florida A&M Dec. 5 at Idaho State* * NCAA I-AA Playoff 1982 Home 3-2, Away 4-2 Yankee Conference: 2-3 (5th) Sept. 11 at Lafayette Sept. 18 at Maine Sept. 25 at Brown Oct. 2 Massachusetts Oct. 9 at Northeastern Oct. 16 Boston University (HC) Oct. 23 Southern Connecticut Oct. 30 at New Hampshire Nov. 6 Lehigh Nov. 13 at Connecticut Nov. 20 Springfield 1983 Home 4-2, Away 2-2 Yankee Conference: 2-3 (t-4th) Sept. 3 at Ball State Sept. 17 Maine Sept. 24 at Brown Oct. 1 at Massachusetts Oct. 8 Northeastern (HC) Oct. 15 at Boston University Oct. 22 Southern Connecticut Oct. 29 New Hampshire Nov. 5 Delaware Nov. 12 Connecticut 1984 Home 5-0, Away 5-3 Yankee Conference: 4-1 (t-1st) Sept. 1 Howard Sept. 8 Lafayette Sept. 15 at Holy Cross Sept. 22 at Maine Sept. 29 at Brown Oct. 6 Massachusetts Oct. 13 at Northeastern Oct. 20 Boston University (HC)* W, 3-0 L, 17-19 W, 7-6 W, 19-14 W, 34-7 L, 6-31 Oct. 27 at Lehigh Nov. 3 at New Hampshire Nov. 17 at Connecticut Dec. 1 Richmond** Dec. 8 at Montana State** * Largest crowd in Meade Stadium history (13,052) ** NCAA I-AA Playoffs 1-9-1 1985 Coach: Bob Griffin L, 14-34 L, 7-17 L, 6-35 L, 13-31 W, 10-0 L, 0-24 L, 0-7 L, 6-21 T, 24-24 L, 9-10 L, 6-16 2-9 Coach: Bob Griffin L, 14-21 W, 24-19 L, 11-14 L, 8-26 L, 7-34 L, 13-24 W, 7-6 L, 28-31 L, 10-23 L, 30-56 L, 3-9 6-6 Coach: Bob Griffin L, 8-33 W, 21-10 W, 23-12 W, 16-10 W, 33-0 L, 21-27 L, 15-35 W, 14-12 L, 8-10 W, 34-29 L, 6-41 L, 0-51 7-4 Head Coach: Bob Griffin W, 20-10 W, 58-55 (6OT) L, 20-24 L, 7-17 W, 14-13 L, 16-26 W, 41-14 W, 23-20 W, 20-16 L, 21-26 W, 24-0 6-4 Head Coach: Bob Griffin L, 26-42 W, 24-16 W, 30-16 W, 13-3 W, 30-10 L, 22-24 W, 17-7 L, 13-14 W, 19-9 L, 17-18 10-3 Head Coach: Bob Griffin W, 31-21 W, 31-10 L, 0-19 W, 27-0 W, 34-13 W, 20-19 W, 30-22 W, 22-7 Home 7-0, Away 3-3 Yankee Conference: 5-0 (1st) Sept. 7 at Delaware Sept. 14 Howard Sept. 21 Maine Sept. 28 at Brown Oct. 5 at Massachusetts Oct. 12 at Lehigh Oct. 19 at Boston University Oct. 26 Lafayette (HC) Nov. 2 New Hampshire Nov. 9 Northeastern Nov. 16 Connecticut Nov. 30 Akron* Dec. 7 at Furman* * NCAA I-AA Playoffs 1986 Home 1-5, Away 0-5 Yankee Conference: 0-7 (8th) Sept. 6 at Delaware Sept. 13 Towson Sept. 20 at Maine Sept. 27 Brown Oct. 4 Massachusetts Oct. 18 Boston University (HC) Oct. 25 Richmond Nov. 1 at New Hampshire Nov. 8 Southern Connecticut Nov. 15 at Connecticut Nov. 22 at Northeastern 1987 Home 1-4, Away 0-6 Yankee Conference: 1-6 (8th) Sept. 5 at James Madison Sept. 12 Delaware Sept. 19 Maine Sept. 26 at Brown Oct. 3 at Massachusetts Oct. 17 at Boston University Oct. 24 at Richmond Oct. 31 New Hampshire (HC) Nov. 7 Northeastern Nov. 14 Connecticut Nov. 21 at Towson 1988 Home 2-3, Away 2-4 Yankee Conference: 3-5 (t-7th) Sept. 3 at Holy Cross Sept. 10 Boston University Sept. 17 at Delaware Sept. 24 Brown Oct. 1 at Villanova Oct. 8 Massachusetts Oct. 15 at Maine Oct. 22 Richmond (HC) Nov. 5 at Northeastern Nov. 12 New Hampshire Nov. 19 at Connecticut 1989 Home 0-4, Away 3-3, Neutral 0-1 Yankee Conference: 1-7 (8th) Sept. 9 at Richmond Sept. 16 Delaware Sept. 23 Northeastern Sept. 30 at Brown Oct. 7 at Massachusetts Oct. 14 Maine (HC) Oct. 21 at Boston University Oct. 28 vs. Villanova (in Milan, Italy) Nov. 4 at Towson Nov. 11 at New Hampshire Nov. 18 Connecticut 1990 Home 4-2, Away 1-4 Yankee Conference: 2-6 (t-7th) Sept. 8 Towson Sept. 15 Richmond Sept. 22 Brown Sept. 29 at Delaware Oct. 6 Massachusetts Oct. 13 at Maine Oct. 20 Boston University (HC) W, 24-16 L, 12-14 W, 29-19 W, 23-17 L, 20-32 10-3 Head Coach: Bob Griffin L, 13-29 W, 46-0 W, 34-14 L, 27-32 W, 7-3 W, 45-38 W, 34-19 W, 41-19 W, 30-20 W, 34-21 W, 56-42 W, 35-27 L, 15-59 1-10 Head Coach: Bob Griffin L, 10-44 L, 14-35 L, 14-34 L, 7-27 L, 17-31 L, 0-17 L, 14-28 L, 24-28 W, 34-18 L, 14-21 (OT) L, 9-36 Oct. 27 Nov. 3 Nov. 10 Nov. 17 at Villanova at Northeastern New Hampshire at Connecticut L, 7-14 W, 31-11 W, 24-14 L, 21-51 1991 6-5 Home 3-2, Away 3-3 Yankee Conference: 3-5 (t-4th) Sept. 14 at Richmond Sept. 21 Delaware Sept. 28 at Towson Oct. 5 at Brown Oct. 12 at Massachusetts Oct. 19 Maine (HC) Oct. 26 at Boston University Nov. 2 Villanova Nov. 9 Northeastern Nov. 16 at New Hampshire Nov. 23 Connecticut Coach: Bob Griffin L, 10-19 L, 7-42 W, 45-25 W, 38-36 W, 17-14 W, 52-30 L, 0-43 L, 14-49 W, 28-20 L, 35-42 W, 20-10 1992 1-10 Home 1-4, Away 0-6 Yankee Conference: 0-8 (9th) Sept. 12 Towson Sept. 19 at Delaware Sept. 26 Richmond Oct. 2 at Hofstra Oct. 10 Massachusetts Oct. 17 at Maine Oct. 24 Boston University (HC) Oct. 31 at Villanova Nov. 7 at Northeastern Nov. 14 New Hampshire Nov. 21 at Connecticut Coach: Bob Griffin W, 36-19 L, 14-31 L, 14-46 L, 18-28 L, 7-32 L, 9-21 L, 21-34 L, 3-34 L, 26-35 L, 13-20 L, 0-38 Floyd Keith Head Coach 1993-99 1-10 Head Coach: Bob Griffin L, 0-38 W, 26-13 L, 20-24 L, 15-17 L, 7-42 L, 13-16 L, 14-27 L, 14-28 L, 3-21 L, 7-52 L, 6-19 4-7 Head Coach: Bob Griffin L, 7-49 L, 16-41 W, 23-17 W, 17-10 L, 14-20 L, 7-26 L, 14-28 W, 14-10 L, 19-24 L, 9-17 W, 21-19 3-8 Head Coach: Bob Griffin W, 45-14 L, 12-21 L, 0-17 W, 18-13 L, 6-31 L, 21-47 L, 31-34 (2OT) L, 25-28 W, 19-6 L, 0-25 L, 28-35 5-6 Head Coach: Bob Griffin W W W. G O R H O D Y. C O M W, 40-21 W, 37-0 W, 23-3 L, 19-24 L, 13-16 L, 17-24 L, 13-15 23-53 (seven seasons) 1993 Home 3-2, Away 1-5 Yankee Conference: 2-6 (4th) Sept. 4 at Boise State Sept. 11 Hofstra Sept. 18 #3 Delaware Sept. 25 Northeastern Oct. 2 at Brown Oct. 9 at Massachusetts Oct. 16 Maine (HC)* Oct. 23 at #15 Boston University Oct. 30 at Villanova Nov. 6 Connecticut Nov. 13 at New Hampshire * Maine forfeited win for using ineligible player(s) 1994 Home 0-5, Away 2-4 Yankee Conference: 2-6 (t-5th) Sept. 3 #21 William & Mary Sept. 10 at Maine Sept. 17 at Northeastern Sept. 24 Brown Oct. 1 at Massachusetts Oct. 8 #12 Boston University Oct. 22 at Connecticut Oct. 29 New Hampshire (HC) Nov. 4 at #23 Hofstra Nov. 12 Delaware State Nov. 19 at Delaware 1995 Home 4-2, Away 3-2 Yankee Conference: 6-2 (1st, NE Division) Sept. 2 at Delaware State Sept. 9 Maine Sept. 16 at #22 New Hampshire Sept. 23 at Brown Sept. 30 Massachusetts Oct. 7 at #17 William & Mary Oct. 14 at Boston University Oct. 21 #15 Connecticut (HC) Nov. 4 Villanova Nov. 11 #8 Hofstra Nov. 18 #8 Delaware 4-7 Head Coach: Floyd Keith L, 10-31 W, 37-32 L, 11-32 W, 15-13 W, 30-7 L, 14-36 W, 23-26 (2OT) L, 15-48 L, 10-14 L, 9-41 L, 33-51 2-9 Head Coach: Floyd Keith L, 17-38 W, 28-21 W, 27-20 L, 29-32 L, 12-22 L, 23-45 L, 16-33 L, 7-13 L, 16-42 L, 26-28 L, 7-26 7-4 Coach: Floyd Keith W, 17-14 W, 17-13 W, 10-7 L, 28-31 W, 34-0 L, 14-23 W, 22-19 W, 24-19 W, 27-10 L, 3-37 L, 19-24 81 ALL-TIME RESULTS 1996 4-6 Home 4-2, Away 0-4 Head Coach: Floyd Keith Yankee Conference: 2-5 (4th) Aug. 31 American International W, 49-3 Sept. 7 William & Mary L, 16-23 Sept. 14 New Hampshire L, 26-35 Sept. 21 at Maine L, 19-58 Sept. 28 Brown W, 28-13 Oct. 5 Massachusetts W, 41-21 Oct. 19 at Connecticut* Cancelled Oct. 26 Boston University (HC) W, 38-7 Nov. 2 at #16 Villanova L, 16-34 Nov. 16 at #13 Delaware L, 27-43 Nov. 23 at Hofstra L, 0-21 * Ruled 'no contest' by NCAA and a forfeit by Yankee Conference 1997 Home 1-4, Away 1-5 Yankee Conference: 2-6 (t-4th) Sept. 6 Maine Sept. 13 New Hampshire Sept. 20 Northeastern Sept. 27 at Massachusetts Oct. 4 Hofstra (HC) Oct. 11 at Boston University Oct. 18 at Brown Oct. 25 at Connecticut Nov. 1 #1 Villanova Nov. 8 at Richmond Nov. 15 at James Madison 1998 Home 2-3, Away 1-5 Atlantic 10: 2-6 (5th) Sept. 5 #4 William & Mary Sept. 17 Richmond Sept. 26 at Northeastern Oct. 3 Brown (HC) Oct. 10 at Maine Oct. 17 at #25 Hofstra Oct. 24 at #10 Connecticut Oct. 31 James Madison Nov. 7 #12 Massachusetts Nov. 14 at New Hampshire Nov. 21 at Villanova 1999 Home 1-5, Away 0-5 Atlantic 10: 1-7 (t-10th) Sept. 4 New Hampshire Sept. 18 #7 Hofstra Sept. 25 Morgan State Oct. 2 at Connecticut Oct. 9 at Richmond Oct. 16 at Brown Oct. 23 Maine (HC) Oct. 30 at #20 Massachusetts Nov. 6 William & Mary Nov. 13 at #25 Delaware Nov. 20 Northeastern 2-9 Head Coach: Floyd Keith L, 14-30 W, 35-21 L, 13-41 L, 14-18 L, 21-28 W, 20-17 L, 15-23 L, 21-37 L, 15-37 L, 11-27 L, 37-39 (3 OT) 3-8 Head Coach: Floyd Keith L, 13-21 L, 17-20 (OT) L, 17-24 W, 44-16 W, 18-17 L, 30-48 L, 17-31 W, 28-21 L, 13-23 L, 7-9 L, 15-27 1-10 Head Coach: Floyd Keith L, 14-37 L, 13-28 L, 21-24 L, 9-20 L, 38-41 L, 25-27 W, 23-14 L, 9-31 L, 6-24 L, 0-35 L, 10-20 33-57 (eight seasons) 82 2002 Home 3-3, Away 0-6 Atlantic 10: 1-8 (11th) Aug. 31 Bryant Sept. 7 at #20 Hofstra Sept. 14 at Syracuse Sept. 28 at #3 Maine Oct. 5 Brown Oct. 12 at Northeastern Oct. 19 Delaware (HC) Oct. 26 Richmond Nov. 2 James Madison Nov. 9 at #20 William & Mary Nov. 16 at #4 Villanova Nov. 23 Massachusetts 2003 Home 2-4, Away 2-4 Atlantic 10: 3-8 (t-8th) Sept. 6 #13 Fordham Sept. 13 #6 Northeastern Sept. 20 New Hampshire Sept. 27 at Richmond Oct. 4 at Brown Oct. 11 #3 Villanova (HC) Oct. 18 at #4 Delaware Oct. 25 William & Mary Nov. 1 at James Madison 11/8 at Cincinnati Nov. 15 Hofstra Nov. 22 #7 Massachusetts 2004 Home 2-4, Away 2-3 Atlantic 10: 2-6 (6th) Sept. 4 at Fordham Sept. 11 Central Conn. St. Sept. 25 at Hofstra Oct. 2 Brown Oct. 9 at Towson Oct. 16 at #16 William & Mary Oct. 23 Massachusetts (HC) Oct. 30 #23 Villanova Nov. 6 #18 New Hampshire Nov. 14 Maine Nov. 20 at Northeastern Home 2-3, Away 2-4 Atlantic 10: 2-6 (6th) Sept. 3 Fordham Sept. 10 at Central Conn. St Sept. 17 #7 William & Mary Sept. 24 at #24 Massachusetts Oct. 1 at Brown Oct. 8 Towson (HC) Oct. 15 at #8 New Hampshire Oct. 22 at Villanova Oct. 29 Hofstra Nov. 12 at Maine Nov. 19 Northeastern Head Coach 2000-07 Home 1-4, Away 2-4 Atlantic 10: 2-7 Sept. 2 #16 Delaware Sept. 9 at New Hampshire Sept. 23 at #12 Hofstra Sept. 30 Brown Oct. 7 at William & Mary Oct. 14 #8 James Madison (HC) Oct. 21 at Northeastern Oct. 28 at Maine Nov. 4 #13 Richmond Nov. 11 at Connecticut Nov. 18 Massachusetts Home 4-1, Away 4-2 Atlantic 10: 6-3 (5th) Aug. 30 at #4 Delaware Sept. 8 #4 Hofstra Sept. 22 at James Madison Sept. 29 at Brown Oct. 6 at Hampton Oct. 13 #25 William & Mary Oct. 20 New Hampshire (HC) Oct. 27 at Richmond Nov. 3 #24 Maine Nov. 17 at Massachusetts Nov. 24 Northeastern 2005 Tim Stowers 2000 2001 3-8 Head Coach: Tim Stowers L, 7-29 L, 12-13 L, 12-30 L, 19-29 L, 16-26 W, 7-6 W, 38-24 L, 7-37 L, 10-13 (OT) W, 26-21 L, 21-29 2006 Home 3-3, Away 1-4 Atlantic 10: 2-6 (5th) Aug. 31 at Connecticut Sept. 9 Merrimack Sept. 23 #18 Delaware Sept. 30 Brown Oct. 7 at #13 James Madison Oct. 14 # 10 Richmond (HC) Oct. 21 at #6 Massachusetts Oct. 28 #15 Maine Nov. 4 at Hofstra Nov. 11 #9 New Hampshire Nov. 17 at Northeastern 8-3 Head Coach: Tim Stowers W, 10-7 W, 35-26 W, 16-12 W, 42-38 W, 56-7 W, 34-31 W, 31-27 L, 0-28 L, 14-26 L, 7-24 W, 27-26 2007 Home 2-4, Away 1-4 CAA Football: 2-7 (t-4th North) Sept. 1 Fordham Sept. 8 at Army Sept. 15 at #10 Delaware Sept. 22 #15 Hofstra Sept. 29 at Brown Oct. 13 #9 James Madison (HC) Oct. 20 at #18 Richmond Oct. 27 at #8 New Hampshire Nov. 3 #3 Massachusetts Nov. 10 at Maine Nov. 17 Northeastern 3-8 Head Coach: Tim Stowers L, 23-27 L, 7-14 (OT) L, 9-38 L, 24-37 W, 49-42 (2OT) L, 27-44 L, 6-38 L, 36-49 W, 12-6 (OT) L, 0-35 W, 35-3 3-9 Head Coach: Tim Stowers Darren Rizzi W, 28-0 L, 19-37 L, 17-63 L, 14-31 W, 38-28 L, 13-38 W, 17-14 (2OT) L, 0-26 L, 11-15 L, 6-44 L, 3-45 L, 21-48 4-8 Head Coach: Tim Stowers L, 28-63 L, 39-42 W, 55-40 W, 17-13 W, 27-9 L, 17-21 L, 10-55 L, 24-37 L, 27-39 L, 24-31 W, 24-0 L, 17-31 Head Coach 2008 3-9 (one season) 2008 Home 2-4, Away 1-5 CAA Football 2-7 (t-5th North) Aug. 30 Monmouth Sept. 7 at Fordham Sept. 13 #10 New Hampshire Sept. 20 at Hofstra Sept. 27 at Boston College Oct. 4 #25 Brown Oct. 11 at Towson Oct. 18 #8 Villanova Oct. 25 at #23 William and Mary Nov. 1 #15 Massachusetts (HC) Nov. 15 #21 Maine Nov. 22 at Northeastern 3-9 Head Coach: Darren Rizzi W, 27-24 L, 0-16 L, 43-51 L, 20-23 L, 0-42 W, 37-13 L, 32-37 L, 7-44 L, 24-34 L, 0-49 L, 7-37 W, 29-14 4-7 Coach: Tim Stowers W, 37-36 W, 39-7 L, 43-62 L, 13-20 W, 28-16 L, 24-31 W, 27-24 L, 9-48 L, 3-27 L, 28-42 L, 14-42 Joe Trainer Head Coach 2009 - present 1-10 ( one season) 4-7 Head Coach: Tim Stowers W, 34-20 W, 56-10 W, 48-29 L, 6-14 L, 35-45 L, 14-23 L, 9-53 W, 48-30 L, 24-38 L, 24-27 (OT) L, 14-17 4-7 Head Coach: Tim Stowers W W W. G O R H O D Y. C O M L, 7-52 W, 42-7 L, 17-24 W, 28-21 L, 23-35 L, 6-31 L, 16-41 W, 3-0 W, 20-13 L, 21-63 L, 31-45 2009 Home 1-4, Away 0-6 CAA Football 0-8 (6th - North) Sept. 5 Fordham Sept. 19 at #17 Massachusetts Sept. 26 at Connecticut Oct. 3 at Brown Oct. 10 Towson Oct. 17 Hofstra Oct. 24 at #4 Villanova Oct. 31 #5 William and Mary Nov. 7 at #8 New Hampshire Nov. 14 at Maine Nov. 21 Northeastern 1-10 Head Coach: Joe Trainer W, 41-28 L, 10-30 L, 10-52 L, 20-28 L, 28-36 L, 16-28 L, 7-36 L, 14-39 L, 42-55 L, 17-41 L, 27-33 MEDIA INFORMATION MEDIA INTERVIEW REQUESTS Any member of the media seeking to interview URI Head Coach Joe Trainer or any of the URI football student-athletes during the week should contact Tom Symonds in the Sports Communications office at (401) 874-2409. PHOTOS Head shots and action photographs of most members of the 2009 Rhode Island football team are available to media outlets in jpg or tiff format and can be emailed or made available on CD. Please contact Tom Symonds for more details. DIRECTIONS TO MEADE STADIUM From the North: Follow Interstate 95 South to Exit 9 (Route 4 South) toward North Kingstown. Follow Route 4 South/Route 1 South for 13 miles. Turn right onto Route 138 West/Mooresfield Road at the traffic signal. Travel four miles on Route 138 West and pass the main entrance of the University of Rhode Island. Turn right at the traffic signal at the intersection of Route 138 West with Plains Road. Follow Plains Road one mile to Meade Stadium. From the South: Follow Interstate 95 North to Exit 3A (Route 138 East) toward Kingston/Newport. Follow for nine miles and turn left on to Plains Road at the traffic signal. Follow Plains Road for one mile to Meade Stadium. PRESS BOX The press box is located on the east side of Meade Stadium. It is open three hours before game time. Following the game, telephone lines are available in the press box on a first-come, first-served basis. However, writers may prefer to file from the Ryan Center press room, which is located adjacent to the interview room. During the 2009 season, there will be wireless internet access available in the Meade Stadium press box. MEDIA CREDENTIALS Media credentials for all Rhode Island home games can be obtained by contacting Tom Symonds in the URI Sports Communcations Office. All credential requests MUST be made prior to 5 p.m. on the Friday preceeding a home contest. All media credentials will be available at the WILL CALL window at the Ryan Center Athletic Ticket Office, which is located on the North end of the building. Accredited photographers are not allowed in the team bench areas, in accordance with NCAA regulations. POST-GAME PROCEDURE Prior to the conclusion of the game, Tom Symonds will solicit postgame player interview requests for both teams. Following a 15minute cooling off period, the visiting coach and requested players will report to the interview room in the Ryan Center. Head Coach Joe Trainer and members of the Rhode Island football team will then be available in the interview room. Adjacent to the interview room is the press room where telephone are available for filing purposes. CAA FOOTBALL INFORMATION CAA Football releases will be available no later than Monday morning throughout the season on the CAA website: www. caasports.com. The CAA office is located at 8625 Patterson Avenue, Richmond, VA 23229. You can reach the office by phone (806-7541616), fax (804-754-1830), or email. The CAA Football media contact is Scott Meyer (smeyer@caasports.com). CAA FOOTBALL WEEKLY TELECONFERENCE The CAA Football coaches will hold a weekly teleconference for the media beginning Monday, Aug. 30. The call will take place each Monday throughout the entire 2009 season. The scheduled calls will come to an end when the final CAA Football completes its season in the 2009 following week. CAA Football coaches will be available to answer questions beginning at 10:10 a.m. The weekly lineup is listed below. Beginning Sept. 7 and continuing throughout the 2008 season, a featured student-athlete will conclude the call with a 10minute interview segment at 12:10 p.m. RAMS ON THE RADIO For the 49th consecutive year, Rhode Island fans throughout southern New England will be able to follow the Rams live on radio. All Rhode Island games and coach’s shows can be heard over the Internet at. In his 16th season handling the play-by-play duties, Steve McDonald has been the sports director at WHJJ AM for the last 19 years. The lifelong Rumford, R.I. native graduated from Providence College in 1984. McDonald is involved with the Pawtucket Red Sox television broadcasts and has been honored with the Associated Press Award for Sports Play-by-Play and the AIAW’s Media Award. Terry Lynch, a former player and assistant coach for the Rams, joined the broadcast team in 2001. He was a quarterback and tight end for the Rams from 1979-82. Lynch was named third-team All-New England in 1980. Following his playing days, he spent 15 years on the Rhode Island sidelines as an assistant coach. The 1984 Rhode Island graduate was inducted into the URI Athletic Hall of Fame in 2004. Rhode Island’s games can be heard live over the Internet at GoRhody.com. UNIVERSITY OF RHODE ISLAND SPORTS COMMUNICATIONS Tom Symonds Coordinator, Sports Communications 401-874-2409 (office) 330-283-8581 (cell) tsymonds@mail.uri.edu The phone number to take part in the call is 888-289-3996. Members of the media should contact Scott Meyer (804-7541616 x20) at the CAA office for the password to access the call. Comments from the call will also be available on the web at www. CAASports.com each Monday after 1 p.m. Mike Laprey Head Coach Joe Trainer will be available at 11:20 a.m each Monday throughout the regular season. Jodi Pontbriand Assistant AD, Sports Communications 401-874-2401 (office) mlaprey@uri.edu Coordinator, Sports Communications 401-874-5356 (office) jpontbriand@uri.edu MEDIA PARKING Limited parking is available behind the East grandstand of Meade Stadium directly behind the press box. A credential is required in order to gain access to the media parking lot. RADIO INFORMATION Three telephone lines are available for the visiting team’s official radio station at no charge to league opponents. Additional telephone lines are available at $75 per line by contacting Tom Symonds in the URI Sports Communications office. The fee should be paid in advance unless other arrangements have been made. Due to signage commitments, visiting radio stations are not permitted to display signage or banners from the press box. PRESS BOX TELEPHONES Main Press Box - (401) 874-4616 Home Radio - (401) 874-5360, (401) 874-5361 Visiting Radio - (401) 874-2885, (401) 874-2886, (401) 783-7433 LOCKER ROOM POLICY Rhode Island’s football locker room is closed to all media. All interviews will take place in the interview room located in the Ryan Center. GoRhody.com Log on to access all the latest scores, stories, statistics, photos and more! W W W. G O R H O D Y. C O M 83 MEDIA INFORMATION NEWSPAPERS ASSOCIATED PRESS Brooke Donald, sports editor 10 Dorrance Street Providence, R.I. 02903 Phone: (401) 274-2270 Fax: (401) 272-5644 USA TODAY KENT COUNTY DAILY TIMES Brendan McGair, sports editor email: kceditor@ricentral.com 1353 Main Street West Warwick, R.I. 02893 Phone: (401) 821-7400 Fax: (401) 828-0810 NARRAGANSETT TIMES Eddie Timanus email: etimanus@usatoday.com 1000 Wilson Boulevard Arlington, Va. 22229 Phone: (703) 276-3400 187 Main Street Wakefield, R.I. 02879 Phone: (401) 789-9744 Fax: (401) 789-4907 PROVIDENCE JOURNAL Rick McGowan, writer email: mcgowan@newportri.com 101 Malbone Road Newport, R.I. 02840 Phone: (401) 849-3301 Fax: (401) 849-3306 Mike Szostak, reporter email: mszostak@projo.com Bill Reynolds, columnist Jim Donaldson, columnist 75 Fountain Street Providence, R.I. 02902 Phone: (401) 277-7340 Fax: (401) 277-7444 ATTLEBORO SUN CHRONICLE Dale Ransom, sports editor email: dransom@thesunchronicle.com Pete Gobis, reporter email: pgobis@thesunchronicle.com 34 South Main Street Attleboro, Mass. 02703 Phone: (508) 236-0348 Fax: (508) 236-0462 BOSTON GLOBE Joe Sullivan, sports editor email: jtsullivan@globe.com Mark Blaudschun, reporter email: blaudschun@globe.com Marty Dobrow, reporter email: marty.dobrow@yahoo.com 135 Morrissey Boulevard Boston, Mass. 02107 Phone: (617) 929-3235 Fax: (617) 929-2670 BOSTON HERALD Hank Hryniewicz, sports editor email: sports@bostonherald.com John Connolly, reporter email: jconnolly@bostonherald.com One Herald Square Boston, Mass. 02106 Phone: (617) 426-3000 Fax: (617) 542-1314 84 NEWPORT DAILY NEWS PAWTUCKET EVENING TIMES Terry Nau, sports editor email: sports@pawtuckettimes.com 23 Exchange Street Pawtucket, R.I. 02862 Phone: (401) 722-4000 Fax: (401) 727-9252 SOUTH COUNTY INDEPENDENT Brendan Dowding, sports editor email: brendand@neindependent.com P.O. Box 5679 Wakefield, R.I. 02880 Phone: (401) 789-6000 Fax: (401) 792-9176 WESTERLY SUN Keith Kimberlin, sports editor email: sports@thewesterlysun.com 56 Main Street Westerly, R.I. 02891 Phone: (401) 596-7791 ext. 216 Fax: (401) 348-5080 WOONSOCKET CALL Arlen Schweiger, sports editor email: news@woonsocketcall.com 75 Main Street Woonsocket, R.I. 02895 Phone: (401) 762-3000 ext. 148 Fax: (401) 765-2834 GOOD FIVE CENT CIGAR Sports Editor Memorial Union University of Rhode Island Kingston, R.I. 02881 Phone (401) 874-5853 Fax: (401) 874-5607 W W W. G O R H O D Y. C O M RADIO WHJJ-AM (920) Steve McDonald, sports director email: stevemac@b101.com 75 Oxford Street Providence, R.I. 02905 Phone: (401) 519-1200 Fax: (401) 781-9329 WRIU-FM (90.3) Memorial Union University of Rhode Island Kingston, R.I. 02881 Phone: (401) 874-4949 ext. 164 Fax: (401) 874-4349 TELEVISION WJAR-TV (Channel 10, NBC) Frank Carpano, sports director email: frank.carpano@nbc.com 23 Kenney Drive Cranston, R.I. 02920 Phone: (401) 455-9105 Fax: (401) 455-9140 WLNE-TV (Channel 6, ABC) Ken Bell, sports director email: kbell@abc6.com Don Coyne, reporter email: dcoyne@abc6.com 10 Orms Street Providence, R.I. 02903 Phone: (401) 453-8000 Fax: (401) 331-4431 WPRI-TV (Channel 12, CBS) Patrick Little, sports director email: plittle@wpri.com 25 Catamore Boulevard East Providence, R.I. 02915 Phone: (401) 438-3310 Fax: (401) 431-1012 | http://issuu.com/jpontbriand/docs/2010_uri_football_preview?SPID=4660&DB_OEM_ID=8500 | CC-MAIN-2015-32 | refinedweb | 66,330 | 83.56 |
So far, we have learned how to determine the unknown variables including present value, future value, uniform series of equal investments, and so on. In these question types, the interest rate was a given parameter. But, there are situations where the interest rate,i, is the unknown variable. In such cases, we know (or expect) the amount of money to be invested and the revenue that will occur in each time period, and we are interested in determining the period interest rate that matches these numbers. This category of problems is called rate of return (ROR) calculation type. In these problems, we are interested to find the interest rate that yields a Net Present Value of zero (the break-even interest rate). This break-even rate is sometimes called the Internal Rate of Return.
For example, assume for an investment of 8000 dollars at present time, you will receive 2000 dollars annually in each of year one to year five. What would be the interest rate (compounded annually) for which this project would break even?
The problem can be written as:
or
With a trial and error procedure, we can find the interest rate that fits into this equation (i= 7.93%). Therefore, the rate of return on this investment (or Internal Rate of Return) is i= 7.93% per year.
Again, assume all the parameters are known and specified except the rate of return i. In order to determine i, usually, a trial and error method is used that will be explained in Example 2-10 and the following video.
Example 2-10:. What annual compound interest rate, or return on investment dollars, will be received for this cash flow?
Figure 2-4: Cash flow: 20,000 dollars investment at present time, 2,000 dollars per year in income after all expenses for 10 years and resale value of $25,000 in the tenth year.
An equation can be written setting costs equal to income at any point in time and the project rate of return i can be calculated, i.e., the beginning or end of any period. Here, we will use the present value method to determine internal rate of return, i.
In order to solve this problem, an equation that equates costs to income at any point in time (for example beginning or end of any period) should be written with the project rate of return i as an unknown variable.
present value equation at present time to calculate i:
It is very difficult to solve this explicitly for i. By trial and error, we can easily find the i that makes the right side of the equation equal to the left side.
For the initial guess of i=10% , the left side is:
And for i=12% , the left side is:
Then, we can try i=11% (the middle point) and i=11.5% to find 11.5% is the rate of return to make the left side to equal to the right side.
In Excel specifically, another way to calculate the break-even rate of return is to use the IRR function. As long as the project has an investment cost in the present year and subsequent cash flows, you can use the IRR function to calculate the Internal Rate of Return. (If the project has a different cost and cash flow structure, then it's harder to use the Excel function here.) This video has a short example (without any narration) of the Excel IRR function. The Excel help file for IRR is also very useful.
For an illustration of the trial and error method, see the following video, Trial and error problem in Excel (6:52).
(Please use 1080p HD resolution to view it).
PRESENTER: OK, this video shows you how to calculate the rate of return for mining all your project. So specifically, I want to show you how to use based on this equation to get the rate of return for a project. On the left side, it's 20,000. It's 20,000. And on the right side is this part, which is showing only one parameter in the equation, the interest rate i.
So what I wanted to do is just find the right interest rate, i, to make this part equal to the left part, which is 20,000. So this part equals to the left side, 20,000. OK.
So I want to do this in Excel. And firstly, we get a try if we plug in i equals to 10%. We get the right side to be $21,930. Which is here. And if I plug in 12% I get the right side value of $19,350.
So we want to make the right side to be $20,000. So we know the right rate of return and interest rate i should be between 10% and 12%. So let's do this in Excel. Here this column is i. And this column, we call it right side result.
OK, it's basically a trial and error solution, trial and error method. So we plug in 10%. And we want to make the stack to be thousands.
So the next number should be 0.101. And then the next number should be 0.102. And then we select them 3, drag them down to 12%, which is here. Here.
We want to calculate the right side result based on this column, the interest rate. OK, we plug in the number. So it's 2,000 multiplied by a number. 1 plus this number, to the power of 10.
And minus 1 divided by this number, multiplied by 1 plus this number. OK, to the power of 10. Plus $25,000 divided by 1 plus this number to the power of 10.
OK, we got $21,927. And we drag this down to 12%. And then we get this column for the right side result. We can see for $20,000 value it should be between 11.4% and 11.5%. So $20,000 is between these two numbers.
And then we want to narrow it down further. So let's make another column. This is i. This is right side result. And we want to make a smaller stack.
OK, stack, and we drag it down to this number. And then we still calculate the right side result. We copy this equation and we put it here. Put it here. And this should be D2. D2. D2. D2. OK.
Then we drag this down. So we can see that this number should be the nearest to $20,000. Which means this should be the right interest rate, the right rate of return for this project. And so that should be 11.46% as the rate of return for this project.
And we can use this trial and error method to solve the rate of return for our project. So that's it for this video. | https://www.e-education.psu.edu/eme460/node/660 | CC-MAIN-2022-40 | refinedweb | 1,160 | 83.36 |
How I Put Rails Models on a Diet
Improving my Rails applications with a Service Layer.
I first discovered Rails in 2005. I’ve been developing web applications in Rails since 2006. It’s fair to say that the majority of my income since graduating from University has been Rails related work.
Slowly, Rails projects became less enjoyable. Multi-person greenfield projects would start off great, but would often end up as being difficult to understand, modify, and collaborate on. Brownfield projects were worse: fat controllers; fat models; and tests that were minimal, brittle, and frustratingly slow.
Jamis Buck’s “Skinny Controller, Fat Model” pattern did a lot to improve things, though for the most part it was ignored in the projects I had the chance to work on. I liked that the application logic was in the model, where testing it didn’t involve the controller lifecycle. Still, fat models were now the burden, the logic being closely coupled to the persistence layer. Could the application logic go elsewhere?
The late James Golick had the solution I was looking for: Services. Instead of packing all the logic into the models, it could exist in it’s own Ruby classes. Free from the shackles of persistence, services are just Plain Old Objects, where their purpose was clear, and testing fast due to their focussed purpose.
Time for an example! We have an e-commerce application, and wish to create an order from a request, calculate the tax on that order, and persist the order.
The Controller
Below is an example of a controller action which would create an order:
class OrdersController
def create
service = OrderCreator.new
status, @order = service.create(params[:order])
if status == :succeeded
redirect_to @order
else
render action: ‘new’
end
end
end
The controller only deals with passing the parameters to the service (or session information if required), and carrying out HTTP actions on the response. It makes no decisions on it’s own. The double-assignment isn’t the neatest (I’ll perhaps blog about different patterns I have tried for this in a future post), but it’s clear and understandable.
A Service
The OrderCreator service is what I would categorise as an Orchestrator; it mediates between the controller and the rest of the application. This, along with other services, would go in the app/services directory at the root of a Rails application.
class OrderCreator
def initialize(order_klass=Order,
tax_calculator_klass=TaxCalculator)
end
def create(order_params)
order = order_klass.new(order_params)
tax_service = tax_calculator_klass.new
order = tax_service.calculate(order)
if order.save
[:succeeded, order]
else
[:failed, order]
end
end
end
The first thing to note is the initialize method. Yes, that is dependency injection. No, you are not reading Java code from 1998. The use of DI here allows us to swap out the classes for testing purposes, so we can isolate the service and test it on it’s own. If you’d like to see how this works in practice, check out the James Golick post linked above. Whilst passing arguments to initialize works well, I like to use Brandon Keepers’ Morphine gem, which provides a nice API for doing simple dependency injection.
The second thing is that this service calls another service. Each service should be as simple as necessary, while allowing the services to be composed and re-used. It’s likely that sales tax would need to be re-calculated when editing an order, so extracting that functionality to a separate service makes sense.
Thirdly, we have the response. Depending on whether the order is persisted successfully, we pass back a symbol communicating the success state, and the order itself.
The Auxiliary Service
Lastly, we have a service for calculating tax on our order.
class TaxCalculator
TAX_RATE = 20.freeze # percent
def calculate(order)
order.tax = order.subtotal * (TAX_RATE / 100)
order.total = order.subtotal + order.tax
order
end
end
The TaxCalculator service calculates the sales tax, assigns the relevant attributes, and passes the order back. The order doesn’t even have to be an ActiveRecord instance, it could be any Struct or Object which responds to subtotal, tax, tax= and total=. Indeed, this is how this service would be tested, without instantiating a model, or even loading the Rails stack. The statelessness of this service removes side-effects, and allows for fast testing and easy debugging.
This is the sort of code that would previous have been encapsulated in a model callback or class method. Where the service becomes really adventagous is when tax gets more complicated, being related to geography, different rates of tax, etc. (Shout out to VAT MOSS!). The model no longer requires logic implementing these things, and mudding it’s persistence role.
The Model
So what is left in a model? Not much. The following is what I put in models:
- ActiveRecord Relationships
- Validations
- Class methods which wrap ActiveRecord API methods.
- Instance methods which modify the state of the instance without any application logic.
What is out?
- No public scopes. Wrap these.
- No using ActiveRecord API methods outside of the model.
- No display methods (example: a full_name() instance method which concatenates first_name and last_name attributes). This is a view concern. Either use a helper method, or use the Decorator/Presenter pattern to wrap the model instance for display.
- No callbacks. Samuel Mullen has written about this, but prescribes a less aggressive callback prohibition than I follow.
The Result
The core functionality of the the Distrify application is now easier to understand. No longer does debugging involve following chains of callbacks in the model, or other logic tied to the persistence. This speeds up the development of new features, as the risk of unintended regressions to existing features is much reduced.
Isolated testing of the services comprising the main logic of the application allows them to be run exceptionally fast, reducing developer downtime during development. Currently, the Distrify application has 34 controllers, 44 models (many of these are non-ActiveRecord models), and 130 services. There are 1869 Spec examples, which run in 1.58 seconds (plus 4.07 seconds for the test suite to load) on my late 2013 dual-core Macbook Pro. That test runtime is not a typo.
I should note that reduced test runtime was not a goal of using the service pattern. Increased understandability, reduced side-effects, and clearer ownership of functionality were the original goals. The tests running in single-digit seconds was just a nice side effect.
This started out as an experiment, but after more than a year productivity still seems to be high, and we are very pleased with how this has turned out.
Further Reading
Not so much reading, but I can highly recommend Gary Bernhardt’s Destroy All Software screencasts. Season 4 covers a lot of what I’ve talked about in great detail, plus you’ll learn a bunch of other stuff too.
TLDR
Controllers do HTTP, models do persistence, decorators provide logic to views, services do everything else.
This post was originally published on my blog. Thanks to Kieran Masterton for proofreading and guidance on the usage of Medium. | https://medium.com/@douglasfshearer/how-i-put-rails-models-on-a-diet-c33b9188bd0c | CC-MAIN-2018-43 | refinedweb | 1,180 | 56.76 |
Back to: Dot Net Interview Questions and Answers
ASP.NET Web API Experienced Interview Questions and Answers
In this article, I am going to discussed the frequently asked ASP.NET Web API Experienced Interview Questions with Answers. Please read our previous article where we discussed the basic ASP.NET Web API Interview Questions.
Why do we need Web API to develop RESTful services as we can also develop RESTful services using WCF?
Yes, it is absolutely possible to develop RESTful services using WCF (Windows Communication Foundation). But there are few reasons why people are moving from WCF to WEB API for developing restful services. Some of them are as follows.
- The Web API increases the TDD (Test Driven Development) approach in the development of RESTful services.
- If we want to develop RESTful services using WCF, then we need to do a lot of configuration settings, URI templates, contracts & endpoints. WCF basically used to develop SOA (Service Oriented Architecture) based applications.
What are the important return types supported in ASP.NET Web API?
In ASP.NET Web API Application, the controller action methods can return the following:
- Void – It simply returns empty content
- HttpResponseMessage – It will convert the response message to an HTTP message.
- IHttpActionResult – It internally calls the ExecuteAsync method to create an HttpResponseMessage
- Other types – You can also write the serialized return value into the response body. For example, you want to return Excel files.
Which .NET framework supports Web API?
The .NET Framework 4.0 and above version supports ASP.NET Web API.
Which protocol ASP.NET Web API supports?
The ASP.NET Web App supports the one and only HTTP protocol.
ASP.NET Web API uses which open-source library for JSON serialization?
The ASP.NET Web API Framework uses the Json.NET library for JSON serialization.
By default, Web API sends an HTTP response with which status code for an uncaught exception?
It will send the response with HTTP Status 500 – Internal Server Error
How do you construct HtmlResponseMessage in ASP.NET Web API?
public class; } }
What is Routing in ASP.NET Web API?
The ASP.NET Web API Routing module is responsible for mapping the incoming HTTP requests to a particular controller action method. Based on the incoming requests the Web API uses URI and HTTP verbs to select the action method. Please read our Routing in ASP.NET Web API article for more detail.. Once a matching route is found in the Route Table, the Web API Framework then selects the controller and the action to be executed.
What is SOAP?
SOAP stands for Simple Object Access Protocol and it is an XML-based protocol. SOAP has specifications for both stateless and state-full implementation. It is also an XML-based messaging protocol for exchanging information among computers. The SOAP message consists of an envelope that includes SOAP headers and body to store the actual information we want to send. It supports different types of protocols such as HTTP, TCP, etc.
How Can we assign an alias name for ASP.NET Web API Action?
We can give alias name for Web API action using the “ActionName” attribute as follows:
[HttpPost] [ActionName("StudentAdd")] public void AddStudents(Student aStudent) { StudentRepository.AddStudent(aStudent); }
For more detail about default naming convention and custom action names, please read our Custom Action Name article.
What is Content Negotiation in Web API?
This is one of the frequently asked ASP.NET Web API Experienced Interview Questions and Answers. One of the standards of the REST service is that the client should have the ability to decide in which format they want the response – whether they want the response in XML or JSON etc. This is called Content Negotiation in Web API.. Please read our Web API Content Negotiation article where we discussed this concept in detail with examples.
What is CORS?
Before understanding CORS, first, we need to understand the same-origin policy. Browsers allow a web page to make AJAX requests only within the same domain. The Browsers does not allow a web page from making AJAX requests to another domain. This is called the same-origin policy.
CORS is a W3C standard that allows us to get away from the same-origin policy adopted by the browsers that restrict access from making AJAX requests from one domain to another domain. You can enable CORS for your Web API using the respective Web API package (depending on the version of Web API in use). Please read our Cross-Origin Resource Sharing (CORS) in Web API article where we discussed this concept in detail with examples.
What is Web API Attribute Routing?
The ASP.NET Web API 2 supports a new type of routing called attribute routing. Attribute routing means attributes are used to define routes. The Attribute routing provides more control over the URIs by defining routes directly on the actions and controllers. Please read our Attribute Routing in Web API article where we discussed this concept in detail with examples.
Why do we need Attribute Routing in Web API?
The convention-based routing makes it hard to support certain URI patterns that are common in RESTful APIs. For example, resources often contain child resources such as Customers have orders, movies have actors, books have authors, etc. It’s natural to create URIs that reflect these relations.
What is Authentication and Authorization in Web API?
Once you create a Web API Service, then the most important thing that you need to take care of is security means you need to control access to your Web API Services.
Authentication is the process of identifying the user. For example, one user let’s. Please read our Authentication and Authorization in ASP.NET Web API article where we discussed this concept in detail with examples.
What is an HTTP Message handler in ASP.NET Web API Application?
This is one of the frequently asked ASP.NET Web API Experienced Interview Questions and Answers. An HTTP Message Handler in Web API is a class that receives an HTTP request and returns an HTTP response. The Message Handler is derived from the abstract HttpMessageHandler class. The HTTP Message handlers are good for cross-cutting concerns (such as authentication and authorization) that operate at the level of HTTP messages rather than controller actions. For example, a Custom HTTP Message handler might do the following things in a Web API Application.
- Read or modify the HTTP request headers.
- Add a response header to the HTTP response.
- Validate the requests before they reach the controller (i.e. Authentication and Authorization).
Please read our HTTP Message Handler in the Web API article where we discussed this concept in detail with multiple real-time examples.
Why Web API versioning is required?
Once you develop and deploy a Web API service then different clients start consuming your Web API services. As you know, day by day the business grows and once the business grows then the requirement may change, and once the requirement change then you may need to change the services as well, but the important thing you need to keep in mind is that you need to do the changes to the services in such a way that it should not break any existing client applications who already consuming your services.
This is the ideal scenario when the Web API versioning plays an important role. You need to keep the existing services as it is so that the existing client applications will not break, they worked as it is, and you need to develop a new version of the Web API service which will start consuming by the new client applications. Please read our Web API Versioning article where we discussed this concept in detail with examples.
What are the Different options available in Web API to maintain the versioning?
The different options that are available to maintain versioning are as follows
- URI’s
- Query String
- Version Header
- Accept Header
- Media Type
What are Request Verbs or HTTP Verbs?
In RESTful service, we can perform all types of CRUD (Create, Read, Update, Delete) Operation. In REST architecture, it is suggested to have a specific Request Verb or HTTP verb on the specific type of the call made to the server. Popular Request Verbs or HTTP Verbs are mentioned below:
- HTTP GET: This HTTP verb is Used to get the resource only.
- HTTP POST: This HTTP verb is Used to create a new resource.
- HTTP PUT: This HTTP verb is Used to update an existing resource.
- HTTP PATCH: This HTTP verb is Used to update an existing resource.
- HTTP DELETE: This HTTP verb is Used to Delete an existing resource.
Note: PUT and PATCH are not similar. If you are updating few columns in your database then use PATCG and if you are updating all the data then use PUT.
What do you mean by Parameter Binding in Web API?
This is one of the frequently asked ASP.NET Web API Experienced Interview Questions and Answers. The Parameter Binding means how the Web API Framework binds the incoming HTTP request data to the parameters of an action method of a Web API controller. The ASP.NET Web API action methods can take one or more parameters of different types. An action method parameter can be either of a complex type or primitive type. The Web API Framework binds the action method parameters either with the URL’s query string or from the request body of the incoming HTTP Request based on the parameter type.
By default, if the parameter type is of the primitive type such as int, bool, double, string, GUID, DateTime, decimal, or any other type that can be converted from the string type then Web API Framework sets the action method parameter value from the query string. And if the action method parameter type is a complex type then Web API Framework tries to get the value from the request body.
But we can change this default behavior of the parameter binding process by using [FromBody] and [FromUri] attributes.
- FromBody: This will force the Web API Framework to get the value from the request body.
- FromUri: This will force the Web API Framework to get the data from the URI (i.e. Route data or Query String)
Please read our Parameter Binding in ASP.NET Web API article where we discussed this concept in detail with examples.
What is the use of Authorize Attribute?
The ASP.NET Web API Framework provided a built-in authorization filter, i.e. Authorize Attribute. This filter checks whether the user is authenticated or not. If not, the user will see 401 Unauthorized HTTP Status Code.
How to Enable CORS in Web API?
If we are going to consume the ASP.NET Web API Service using Jquery Ajax from another domain, then we need to enable CORS in the Web API application. Without enabling CORS, it is not possible to access the service from another domain using AJAX call. Enabling CORS in Web API is a two steps process.
Step1: Install Microsoft.AspNet.WebApi.Cors package.
Step2: Once you installed the Microsoft.AspNet.WebApi.Corspackage then includes the following 2 lines of code in the Register() method of WebApiConfig class which is present inside the App_Start folder of your project.
EnableCorsAttribute cors = new EnableCorsAttribute(“*”, “*”, “*”);
config.EnableCors();
What is Basic HTTP Authentication?
This is one of the frequently asked ASP.NET Web API Experienced Interview Questions and Answers. Basic HTTP Authentication is a mechanism, where the user is authenticated through the service in which the client needs to pass the username and password in the HTTP Authorization request headers. The credentials are formatted as the string “username:password: based encoded. Please read our Basic Authentication in ASP.NET Web API article where we discussed this concept in detail with examples.
What is ASP.Net identity?
ASP.Net identity is the membership management framework given by Microsoft which can be easily integrated with ASP.NET Web API. This helps us in building a secure HTTP service.
What is Token Based Authentication in Web API?
This is one of the frequently asked ASP.NET Web API Experienced Interview Questions and Answers. Nowadays, the use of Web API is increasing in a rapid manner. So as a developer we should know how to develop Web APIs. Only developing Web APIs is not enough if there is no security. So, it also very important to implement security for all types of clients (such as Browsers, Mobile Devices, Desktop applications, and IoTs) who are going to use our Web API services.
The most preferred approach nowadays to secure the Web API resources is by authenticating the users in the Web API server by using the signed token (which contains enough information to identify a particular user) which needs to be sent to the server by the client in each and every request. This is called the Token-Based Authentication approach.
How does the Token-Based Authentication work?
This is one of the frequently asked ASP.NET Web API Experienced Interview Questions and Answers. In order to understand how token-based authentication works, please have a look at the following diagram.
The Token-Based Authentication works as Follows:
- The user enters his credentials (i.e. the username and password) into the client (here client means the browser or mobile devices, etc).
- The client then sends these credentials (i.e. username and password) to the Authorization Server.
- Then the Authorization Server authenticates the client credentials (i.e. username and password).
Please read our Token Based Authentication in Web API article where we discussed this concept in detail with examples.
What is a Refresh Token?
A Refresh Token is a special kind of token that can be used to obtain a new renewed access token that allows access to the protected resources. You can request the new access tokens by using the Refresh Token in Web API until the Refresh Token is blacklisted.
Why we need Refresh Token in Web API?
This is one of the frequently asked ASP.NET Web API Experienced Interview Questions and Answers..
Please read our Refresh Token in the Web API article where we discussed this concept in detail with examples.
What is HMAC Authentication?
This is one of the frequently asked ASP.NET Web API Experienced Interview Questions and Answers. The HMAC stands for Hash-based Message Authentication Code. From the full form of HMAC, we need to understand two things one is Message Authentication Code and the other one is Hash-Based. So HMAC is a mechanism that is used for creating a Message Authentication Code by using a Hash Function.
The most important thing that we need to keep in mind is that while generating the Message Authentication Code using Hash Function we need to use a Shared Secret Key. Moreover, the Shared Secret Key must be shared between the Client and the Server involved in sending and receiving the data.
Why do we need.
Please read our HMAC in Web API article where we discussed this concept in detail with examples.
In the next article, I am going to discuss SQL Server Interview questions with answers. Here, in this article, I try to explain the most frequently asked ASP.NET Web API Experienced Interview Questions and Answers. I hope you enjoy this ASP.NET Web API Experienced Interview Questions with Answers article. I would like to have your feedback. Please post your feedback, question, or comments about this ASP.NET Web API Experienced Interview Questions with Answers article. | https://dotnettutorials.net/lesson/web-api-experienced-interview-questions/ | CC-MAIN-2022-27 | refinedweb | 2,586 | 66.44 |
is extremely efficient, but the Python code here is not; it’s just for illustration.) The code will show how to use the
pyfinite library to do arithmetic over a finite field.
Entropy extractor
The μRNG generator starts with three bit streams—X, Y, and Z—each with at least 1/3 bit min-entropy per bit.
Min-entropy is Rényi entropy with α = ∞. For a Bernoulli random variable, that takes on two values, one with probability p and the other with probability 1-p, the min-entropy is
-log2 max(p, 1-p).
So requiring min-entropy of at least 1/3 means the two probabilities are less than 2-1/3 = 0.7937.
Take eight bits (one byte) at a time from X, Y, and Z, and interpret each byte as an element of the finite field with 28 elements. Then compute
X*Y + Z
in this field. The resulting stream of bits will be independent and uniformly distributed, or very nearly so.
Purified noise
Just a quick aside. Normally you want to remove noise from data to reveal a signal. Said another way, you want to split the data into signal and noise so you can throw out the noise. Here the goal is the opposite: we want to remove any unwanted signal in order to create pure noise!
Python implementation
We will need the
bernoulli class for generating our input bit streams, and the
pyfinite for doing finite field arithmetic on the bits.
from scipy.stats import bernoulli from pyfinite import ffield
And we will need a couple bit manipulation functions.
def bits_to_num(a): "Convert an array of bits to an integer." x = 0 for i in range(len(a)): x += a[i]*2**i return x def bitCount(n): "Count how many bits are set to 1." count = 0 while(n): n &= n - 1 count += 1 return count
The following function generates random bytes using the entropy extractor. The input bit streams have p = 0.79, corresponding to min-entropy 0.34.
def generate_byte(): "Generate bytes using the entropy extractor." b = bernoulli(0.79) x = bits_to_num(b.rvs(8)) y = bits_to_num(b.rvs(8)) z = bits_to_num(b.rvs(8)) F = ffield.FField(8) return F.Add(F.Multiply(x, y), z)
Note that 79% of the bits produced by the Bernoulli generator will be 1’s. But we can see that the output bytes are about half 1’s and half 0’s.
s = 0 N = 1000 for _ in range(N): s += bitCount( generate_byte() ) print( s/(8*N) )
This returned 0.50375 the first time I ran it and 0.49925 the second time.
For more details see the μRNG paper.
Update: RNG test suite results
I ran an experiment, creating streams of biased data and running them through the entropy extractor. The first post in the series, NIST STS, explains the set up. The last post in the series, using TestU01, summarizes the results. In a nutshell, the extractor passes STS and DIEHARDER, but fails PractRand and TestU01. | https://www.johndcook.com/blog/2019/02/14/entropy-extractor/ | CC-MAIN-2021-10 | refinedweb | 505 | 75.61 |
Echoes Base Library (Echoes.dll)
The Echoes Base Library (contained in
Echoes.dll) is a small library that can be optionally used in Elements projects for the .NET and Mono platforms. It provides some of the core types, classes and functions that are needed for more advanced language features of Oxygene, C# and Swift, such as support for the Dynamic type.
Source Code
The Echoes Base Library is open source and implemented fully in Oxygene. You can find the source code on GitHub, and contributions and pull requests are more than welcome.
Note that you will usually need the very latest compiler to rebuild
Echoes.dll yourself, and in some cases, the git repository might even contain code that requires a later compiler than is available. Refer to the commit messages for details on this, and check out an older revision, if necessary.
Namespaces
The Echoes Base Library is divided into these namespaces:
See Also
Version Notes
Echoes.dll was called
RemObjects.Elements.Dynamic.dll in Elements 8.2 and below. Projects will automatically be migrated to use the
Echoes.dll reference when opened in Fire or Visual Studio. | https://docs.elementscompiler.com/API/EchoesBaseLibrary/ | CC-MAIN-2018-51 | refinedweb | 189 | 68.47 |
Use These 5 Tips to Help You Visualize Code
Use These 5 Tips to Help You Visualize Code
When building a codebase, make sure to look out for ways to make it easier and to help yourself reason clearly about your code.
Join the DZone community and get the full member experience.Join For Free
Discover how TDM Is Essential To Achieving Quality At Speed For Agile, DevOps, And Continuous Delivery. Brought to you in partnership with CA Technologies.
Source code doesn't have any physical weight - at least not until you print it out on paper. But it carries a lot of cognitive weight. It starts off simply enough. But before long, you have files upon files, folders upon folders, and more lines of code than you can ever keep straight. This is where the quest to visualize code comes in.
The solution file and namespaces organization make for a pretty unhelpful visualization aid. But that's nothing against those tools. It's just not what they're for. Nevertheless, if the only way you attempt to visualize code involves staring at hierarchical folders, you're gonna have a bad time.
How do most people handle this? Well, they turn to whiteboards, formal design documents, architecture diagrams, and the like. This represents a much more powerful visual aid, and it tends to serve as table stakes of meaningful software development.
But it's a siren song. It's a trap.
Why? Well, as I've discussed previously, those visualization aids just represent someone's cartoon of what they think the code will look like when complete. You draw up a nice layer-cake architecture, and you wind up with something that looks more like six tumbleweeds glued to a barbed wire fence. Those visual aids are great...for visualizing what everyone wishes your code looked like.
What I want to talk about today are strategies to visualize code - your actual code, as it exists.
Generate Class Diagrams
Whoa, whoa. Put down your pencil or whiteboard marker. I'm not reversing myself immediately and suggesting that you hand-draw some UML. I'm talking about actually creating class diagrams from your code.
Using this functionality, you can literally drag and drop your classes onto a canvas and start creating relationships between them. You can model both inheritance schemes and relationship cardinality. This represents a vast improvement over following chains of inheritance across multiple files or taking notes to understand how a sequence of types relates.
Plus, unlike its hand-drawn cousin, this lightweight use of UML stays in sync with your code. This helps a lot with visualizing your class relationships.
In-Editor Coverage Visualization
This tip is less about visualizing relationships among code elements and more about visualizing how comprehensive your automated tests are. Surely you've heard of test coverage. There's even a good chance management somewhere has bludgeoned you with it a bit.
But what everyone is after there is a number - a percentage. Get your code coverage up to 80% or whatever. That's no help for visualization.
Luckily, Visual Studio offers an option to help turn that number into something immediately useful to you. You can select an option to paint the editor with different colors for covered and uncovered lines. This means that you can glance through your files and easily visualize where your tests reach and where they don't.
Of course, you have a more powerful option for this particular visualization as well. I'm a huge fan of NCrunch, which continually runs your tests, updates coverage data, and paints the IDE accordingly.
Heat Maps and Hot Spots
Since I originally wrote this for the NDepend blog, it'd be pretty weird if I didn't mention an NDepend feature or two. Well, fear not. Here that comes.
One your most powerful options to visualize code is the NDepend heat map. Here's an example.
NDepend lets you compute all sorts of metrics about your code. But without visualization, those metrics are just dusty data points hiding on your build server somewhere.
When you take them and plug them into a heat map, they come to life. You can pick a metric to use to vary box size and another to use to vary the color. This gives you striking visual representations of hot spots in your code: excessively complex methods, lots of dependency risk, CRAP-y code, etc.
As the expression goes, a picture like this is worth a thousand words when trying to visualize code.
Trend Graphs
Once you've figured out strategies to turn code metrics into visual representations of your codebase, you can realize another powerful visualization. This time I'm talking about the idea of trend metrics.
It's easiest to reason about our code by discounting any time other than the present. After all, as I mentioned before, codebases are already insanely complex and hard to picture without adding an entire other dimension to the mix. And yet, that dimension is critically important. Sure, your code has problematic pockets of cyclomatic complexity. But does it have more pockets than it did last month, or does it have fewer? That's an enormously important distinction.
Trend graphs let you visualize properties of code as they vary through time. Here are some examples that might interest you:
- Are we maintaining a consistent level of test coverage?
- Is our code growing more complex, normalized by codebase size, or are things getting more snarled?
- What is the ratio of nodes to edges in our dependency graph (more on this shortly)?
- What is the type rank of our top 20 types?
You get the idea. It's one thing to keep track of this. But it's another altogether to visualize it with graphs over the course of time as you work in the codebase.
Dependency Graphs
The last tip that I'll offer is the one that I find to be the most crucial of all. I'm talking about the dependency graph. If you take nothing else away from this post, take away that it is utterly critical that you get a visual bead on how your code interrelates.
I once saw an actual dependency graph in the wild that looked like this.
You just see that giant mass of nodes, but if you could zoom in at the incredible magnitude, the edges put them to shame. I can't show you that because you'd need a mural-on-a-building-sized screen to get enough resolution. That's how jaw-droppingly snarled this code was.
How do you think that happens? I'll bet the people responsible have some impressively layered diagram somewhere of what this should look like. But it came to look like this instead. That happens because nobody's visualizing the real deal and incorporating that feedback into the development effort.
Your code's dependency graph models how things interrelate. Most commonly, you'll view this at the assembly level or (in the case above) at the namespace level. It shows you how all of the parts fit together when push comes to shove.
Use the dependency graph to inform you as to whether you're actually building something that's loosely coupled, rationally organized, and easy to maintain.
Get Creative
I've given you five tips here on how to visualize your code. But there are no real definitive or canonical approaches. You have to get creative both with tooling and with your own imagination when you try to visualize code.
Building codebases is difficult and complex. Forming a clear mental image of them is even more so. Make sure always to be on the lookout for ways to make it easier and to help yourself reason clearly about your code. }} | https://dzone.com/articles/use-these-5-tips-to-help-you-visualize-code | CC-MAIN-2018-30 | refinedweb | 1,299 | 66.03 |
Bernhard Huber wrote:
> >But the fact that we use javadocs syntax and javadoc tools might be
> >wrong!
> >
> >Now, I see two possible syntaxes:
> >
> >1) turn javadoc tag into namespaced ones (might becoming a black art)
> >
> >
> >2) write our own 'special-comment' with nested XML documentation
> >
> > /*?
> > <doc:doc xmlns:
> > ...
> > </doc>
> > ?*/
> >
> No I don't like 2), this will make it impossible to use the doclet API!
> Doclet API won't give you access to that comments, AFAIK.
Good point.
> What about, putting the complete XML to a single javadoc tag, like this:
>
> /** My one sentence description
> * @namespace:cocoon
> * @cocoon:doc <doc:doc xmlns:
> * <doc:head>bla, bla</doc:head>
> * <doc:body>bla, bla</doc:body>
> * </doc:doc>
> */
>
> I think it's not funny writing xml documentation in the java comment.
> If the number of javadoc tags is small, and clear, I think it is better
> than writing xml in the comment.
Completely agreed.
> Writing xml in the comment could be painful for programmers, and might
> be simply ignored by lazy programmers.
> Keep in mind that programmers/developers are supposed to write the
> documentation!
Absolutely. Javadocs are a pain by itself, we should make it as simple
as possible to add features to this system.
> >
> >
> >Another choice is the tool:
> >
> >1) write a tool on our own
> >
> >2) write a doclet
> >
> >The second option is nicer if the output is completely XML-ized!
> >
> > <javadoc:class xmlns:
> > <doc:doc xmlns:
> > ...
> > </doc>
> > <javadoc:method ..../>
> > <javadoc:variable ../>
> > </javadoc>
> >and so on.
> >
> >*this* would be incredibly cool, since it would give us the ability to
> >'refactor' and aggregate code documentation easily from an XML-based
> >publishing framework.
> >
> >
> >
> >So, using Velocity is cool, but it's somewhat limited (unless you want
> >to write a java parser in Velocity :) javadoc already comes with a java
> >parser... but I never wrote a doclet so I'm not sure how that goes (but
> >we already have a javadoc DTD that suits our needs!)
> >
> Note: The sample code I wrote is a doclet, I used Velocity only for
> generating the xml documents.
> Using Velocity was driven by:
> * Be flexible in generating what kind of xml document
> * Be flexible in accessing object provided by the doclet API.
>
> Thus the Velocity templates are generators.
> Thus the Velocity templates are transformers.
>
> There is no need to implement a java parser in Velocity.
>
> Short note about doclet: You have an API, providing you with beans about
> all parsed classes, packages, methods, members.
> Thus you can access the full name of a class like: 'classDoc.fullName()'.
>
> Thus my suggestion:
> 1) Programmers keep writing java source documentation.
> 2) Programmers do not write xml, but javadoc tags.
> 3) A project may define special tags, and a namespace
>
> 4) A doclet generates xml documents from the java documentation.
> 5) Using the default doclet of javadoc still provides valid, and
> sensefull html documentation.
>
> 6) Using VelocityDoclet you have to write templates which generates xml
> documents.
> 7) You may want write several "families" of templates/doclets to
> generate different xml documents from the java sources.
> So you can generate xml documents having same info as today
> html-javadocumentation, ignoring project specific tags.
> You can generate xml documents taking only some classes into account,
> and some project specific tags for having project specific reference
> documentation, ignoring method details.
Totally +1
I'm going to spend some time taking a good look at your doclet today and
to the other doclet implementations available.
Catcha l8 | http://mail-archives.apache.org/mod_mbox/cocoon-dev/200201.mbox/%3C3C591CDE.9DB44557@apache.org%3E | CC-MAIN-2013-48 | refinedweb | 572 | 53.71 |
How to Hire a Great JavaScript Developer
The Challenge
In today’s technology landscape, JavaScript has essentially become synonymous with client-side web development and now, with the advent of technologies like Node.js, JavaScript is becoming a dominant server side technology as well.
Accordingly, resumes that reference at least some degree of JavaScript experience have essentially become universal in the software development community. This makes locating JavaScript developers fairly easy, but makes sifting through them to find “the elite few” that much more of a challenge. Finding them requires a highly-effective recruiting process, as described in our post In Search of the Elite Few – Finding and Hiring the Best Developers in the Industry. Such a process can then be augmented with questions – such as those presented herein – to identify those sparsely distributed candidates across the globe who are true JavaScript experts.
Yeah, I know JavaScript…
As with any technology, there’s knowing JavaScript and then there’s really knowing JavaScript. In our search for true masters of the language, we require an interview process that can accurately quantify a candidate’s position along the continuum of JavaScript expertise levels.
Toward that goal, this post offers a sampling of questions that are key to evaluating the breadth and depth of a candidate’s mastery of JavaScript..
Assessing the Foundation
JavaScript is a prototype-based scripting language with dynamic typing. JavaScript can, at first, be a bit confusing for developers experienced in class-based languages (such as Java or C++), as it is dynamic and does not provide a traditional class implementation. It’s therefore far too common to encounter ‘experienced’ JavaScript developers whose grasp of the fundamentals of the language is either weak or confused.
Questions that can help assess a developer’s grasp of JavaScript fundamentals, including some of its more subtle nuances, are therefore an important component of the interview process. Here are some examples…
Q: Describe inheritance and the prototype chain in JavaScript. Give an example.
Although JavaScript is an object-oriented language, it is prototype-based and does not implement a traditional class-based inheritance system.
In JavaScript, each object internally references another object, called its prototype. That prototype object, in turn, has a reference to its prototype object, and so on. At the end of this prototype chain is an object with null as its prototype. The prototype chain is the mechanism by which inheritance – prototypal inheritance to be precise – is achieved in JavaScript. In particular, when a reference is made to a property that an object does not itself contain, the prototype chain is traversed until the referenced property is found (or until the end of the chain is reached, in which case the property is undefined).
Here’s a simple example:
function Animal() { this.eatsVeggies = true; this.eatsMeat = false; } function Herbivore() {} Herbivore.prototype = new Animal(); function Carnivore() { this.eatsMeat = true; } Carnivore.prototype = new Animal(); var rabbit = new Herbivore(); var bear = new Carnivore(); console.log(rabbit.eatsMeat); // logs "false" console.log(bear.eatsMeat); // logs "true"
Q: Compare and contrast objects and hashtables in JavaScript.
This is somewhat of a trick question since, in JavaScript, objects essentially are hashtables; i.e., collections of name-value pairs. In these name-value pairs, a crucial point to be aware of is that the names (a.k.a., keys) are always strings. And that actually leads us to our next question…
Q: Consider the code snippet below (source). What will the alert display? Explain your answer.
var foo = new Object(); var bar = new Object(); var map = new Object(); map[foo] = "foo"; map[bar] = "bar"; alert(map[foo]); // what will this display??
It is the rare candidate who will correctly answer that this alerts the string “bar”. Most will mistakenly answer that it alerts the string “foo”. So let’s understand why “bar” is indeed the correct, albeit surprising, answer…
As mentioned in the answer to the prior question,. This can have surprising results, as the above code demonstrates.
To understand the above code snippet, one must first recognize that the
map object shown does not map the object
foo to the string “foo”, nor does it map the object
bar to the string “bar”. Since the objects
foo and
bar are not strings, when they are used as keys for
map, JavaScript automatically converts the key values to strings using each object’s
toString() method. And since neither
foo nor
bar defines its own custom
toString() method, they both use the same default implementation. That implementation simply generates the literal string “[object Object]” when it is invoked. With this explanation in mind, let’s re-examine the code snippet above, but this time with explanatory comments along the way:"!! // SURPRISE! ;-)
Q: Explain closures in JavaScript. What are they? What are some of their unique features? How and why might you want to use them? Provide an example.
A closure is a function, along with all variables or functions that were in-scope at the time that the closure was created. In JavaScript, a closure is implemented as an “inner function”; i.e., a function defined within the body of another function. Here is a simplistic example:
(function outerFunc(outerArg) { var outerVar = 3; (function middleFunc(middleArg) { var middleVar = 4; (function innerFunc(innerArg) { var innerVar = 5; // EXAMPLE OF SCOPE IN CLOSURE: // Variables from innerFunc, middleFunc, and outerFunc, // as well as the global namespace, are ALL in scope here. console.log("outerArg="+outerArg+ " middleArg="+middleArg+ " innerArg="+innerArg+"\n"+ " outerVar="+outerVar+ " middleVar="+middleVar+ " innerVar="+innerVar); // --------------- THIS WILL LOG: --------------- // outerArg=123 middleArg=456 innerArg=789 // outerVar=3 middleVar=4 innerVar=5 })(789); })(456); })(123);
An important feature of closures is that an inner function still has access to the outer function’s variables even after the outer function has returned. This is because, when functions in JavaScript execute, they use the scope that was in effect when they were created.
A common point of confusion that this leads to, though, is based on the fact that the inner function accesses the values of the outer function’s variables at the time it is invoked (rather than at the time that it was created). To test the candidate’s understanding of this nuance, present the following code snippet that dynamically creates five buttons and ask what will be displayed when the user clicks on the third button:
function addButtons(numButtons) { for (var i = 0; i < numButtons; i++) { var button = document.createElement('input'); button.type = 'button'; button.value = 'Button ' + (i + 1); button.onclick = function() { alert('Button ' + (i + 1) + ' clicked'); }; document.body.appendChild(button); document.body.appendChild(document.createElement('br')); } } window.onload = function() { addButtons(5); };
Many will mistakenly answer that “Button 3 clicked” will be displayed when the user clicks on the third button. In fact, the above code contains a bug (based on a misunderstanding of the way closures work) and “Button 6 clicked” will be displayed when the user clicks on any of the five buttons. This is because, at the point that the onclick method is invoked (for any of the buttons), the for loop has already completed and the variable
i already has a value of 5.
An important follow-up question is to ask the candidate how to fix the bug in the above code, so as to produce the expected behavior (i.e., so that clicking on button n will display “Button n clicked”). The correct answer, which demonstrates proper use of closures, is as follows:
function addButtons(numButtons) { for (var i = 0; i < numButtons; i++) { var button = document.createElement('input'); button.type = 'button'; button.value = 'Button ' + (i + 1); // HERE'S THE FIX: // Employ the Immediately-Invoked Function Expression (IIFE) // pattern to achieve the desired behavior: button.onclick = function(buttonIndex) { return function() { alert('Button ' + (buttonIndex + 1) + ' clicked'); }; }(i); document.body.appendChild(button); document.body.appendChild(document.createElement('br')); } } window.onload = function() { addButtons(5); };
Although by no means exclusive to JavaScript, closures are a particularly useful construct for many modern day JavaScript programming paradigms. They are used extensively by some of the most popular JavaScript libraries, such as jQuery and Node.js.
Embracing Diversity
A multi-paradigm language, JavaScript supports object-oriented, imperative, and functional programming styles. As such, JavaScript accommodates an unusually wide array of programming techniques and design patterns. A JavaScript master will be well aware of the existence of these alternatives and, more importantly, the significance and ramifications of choosing one approach over another. Here are a couple of sample questions that can help gauge this dimension of a candidate’s expertise:
Q: Describe the different ways of creating objects and the ramifications of each. Provide examples.
The graphic below contrasts various ways in JavaScript to create objects and the differences in the prototype chains that result from each.
Q: Is there ever any practical difference between defining a function as a function expression (e.g.,
var foo = function(){}) or as a function statement (e.g.,
function foo(){})? Explain your answer.
Yes, there is a difference, based on how and when the value of the function is assigned.
When a function statement (e.g.,
function foo(){}) is used, the function
foo may be referenced before it has been defined, through a technique known as “hoisting”. A ramification of hoisting is that the last definition of the function is the one that will be employed, regardless of when it is referenced (if that’s not clear, the example code below should help clarify things).
In contrast, when a function expression (e.g.,
var foo = function(){}) is used, the function
foo may not be referenced before it is defined, just like any other assignment statement. Because of this, the most recent definition of the function is the one that will be employed (and accordingly, the definition must precede the reference, or the function will be undefined).
Here’s a simple example that demonstrates the practical difference between the two. Consider the following code snippet:
function foo() { return 1; } alert(foo()); // what will this alert? function foo() { return 2; }
Many JavaScript developers will mistakenly answer that the above alert will display “1” and will be surprised to learn that it will in fact display “2”. As described above, this is due to hoisting. Since a function statement was used to define the function, the last definition of the function is the one that is hoisted at the time it is invoked (even though it is subsequent to its invocation in the code!).
Now consider the following code snippet:
var foo = function() { return 1; } alert(foo()); // what will this alert? foo = function() { return 2; }
In this case, the answer is more intuitive and the alert will display “1” as expected. Since a function expression was employed to define the function, the most recent definition of the function is the one that is employed at the time it is invoked.
The Devil’s in the Details
In addition to the advanced JavaScript concepts discussed thus far, there are a number of lower-level syntactical details of the language that a true JavaScript guru will be intimately familiar with. Here are a few examples…
Q: What is the significance of, and reason for, wrapping the entire content of a JavaScript source file in a function block?
This is an increasingly common practice, employed by many popular JavaScript libraries (jQuery, Node.js, etc.). This technique creates a closure around the entire contents of the file which, perhaps most importantly, creates a private namespace and thereby helps avoid potential name clashes between different JavaScript modules and libraries.
Another feature of this technique is to allow for an easily referenceable (presumably shorter) alias for a global variable. This is often used, for example, in jQuery plugins. jQuery allows you to disable the
$ reference to the jQuery namespace, using
jQuery.noConflict(). If this has been done, your code can still use $ employing this closure technique, as follows:
(function($) { /* jQuery plugin code referencing $ */ } )(jQuery);
Q: What is the difference between
== and
===? Between
!= and
!==? Give an example.
The difference between “triple” comparison operators (
===,
!==) and double comparison operators (
==,
!=) in JavaScript is that double comparison operators perform implicit type conversion on the operands before comparing them whereas, with the triple comparison operators, no type conversion is performed (i.e., the values must be equal and the types must be the same for the operands to be considered equal).
As a simple example, the expression
123 == '123' will evaluate to true, whereas
123 === '123' will evaluate to false.
Q: What is the significance of including
'use strict' at the beginning of a JavaScript source file?
Though there is much more to be said on the topic,.
Wrap Up
JavaScript is perhaps one of the most misunderstood and underestimated programming languages in existence today. The more one peels the JavaScript onion, the more one realizes what is possible. Accordingly, finding true masters of the language is a challenge. We hope you find the questions presented in this post to be a useful foundation for “separating the wheat from the chaff” in your quest for the “elite few” among JavaScript developers. | https://www.toptal.com/javascript?utm_source=changelog&utm_medium=podcast&utm_campaign=changelog-sponsorship | CC-MAIN-2019-39 | refinedweb | 2,167 | 53.51 |
I have (basically) the following code JTextField input = new JTextField(20); JButton calculate = new JButton("calculate"); calculate.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent event){ String test = new Strin
I have been trying to prevent my program from deleting the root node of my tree view but when ever I try and do so my program gives me a "java.lang.reflect.InvocationTargetException" during its compiling and the program will not launch. I am not
This Haskell code contains a type error, a dumb mistake on my part that will be obvious once you see it. I figured it out, but it was hard. My question is: How should I have gone about diagnosing this? class Cell c where start :: c moves :: c -> [c]
It appears that the Compiler used by CodeVisionAVR handles typedefs in a way I donot understand. This line of Code is throwing an error: typedef uint64_t offset_t; Error: missing ';' stdint.h is included so uint64_t is defined. Does anyone know what
I've added Fabric/Crashlytics framework into my project manually (not via Cocoapods) before, and then deleted both manually too. This error showed up at the compile time: /Users/myUserName/Library/Developer/Xcode/DerivedData/ProjectName-hgnmlcwlcxdbm
Can someone please tell me why the C compiler outputs an error while using a Compound Assignment and a Prefix Dec/Inc together ? [ but C++ does not ] int myVar = 5; (--myVar) -= 4; // C : error C2106: '-=' : left operand must be l-value // C++: myVar
Consider this class: package be.duo.test; public class Main { public static void main(String[] args) { Main main = new Main(); main.execute(); } private void execute() { for(int i = 0; i < 10; i++) { System.out.println("" + method()); } } pri
I have main.cu file that includes test.h which is header for test.c and all three files are in same project. test.h code: typedef struct { int a; } struct_a; void a(struct_a a); test.c code: void a(struct_a a) { printf("%d", a.a); } main.cu code
Don't know why I'm getting this error. Working with ArrayLists and sorting words into appropriate ArrayLists by alphabetical order. If anyone can help me understand why I'm getting the error and how to fix it that would be great! import java.util.*;
Getting the following errors in a function that should take an int k and create k pthreads: cse451.cpp:95:60: error: invalid conversion from ‘void*’ to ‘pthread_t* {aka long unsigned int*}’ [-fpermissive] cse451.cpp:97:54: error: invalid use of void
I am trying to compile this code, but I get the fatal error LNK1169: one or more multiply defined symbols found. The code is just a test to see how C++ pointers work. Please tell me what's wrong with the code. Thanks. #include <iostream> using
Here's my code: #include <iostream> using namespace std; int main() { void *x; int arr[10]; x = arr; *x = 23; //This is where I get the error } As you can see, the code is very simple. It just creates a void pointer x which points to the memory
I follow installation instructions from here: This is my output: [email protected]:~# sudo -i -u redmine -H
The following code fails to compile with the error Cannot implicitly convert type 'string' to 'String' in C#. void Main() { Console.Write("Hello".Append("Mark")); } public static class Ext { public static String Append<String>(this String str,
So I have been the following error every time I try to compile my .java file "error: variable max is already defined in method main(String[]) int max = j; " And I haven't been able to figure out what is the issue or how to fix it. Been stuck at it fo
I'm having trouble getting this code to work. I want to make a trait that allows a class that inherits it to have "children", but apparently, Child's setParent method wants a P, but gets a Parent[P, C] instead. package net.fluffy8x.thsch.entity impor
I want to use the constant in class namespace as the size of a static array and the template parameter in another class. I have follow errors // MS VS 2010 C++98 // A.h class A { public: const static int someNumber; }; // A.cpp #include <A.h> c | http://www.dskims.com/tag/compiler-errors/ | CC-MAIN-2018-22 | refinedweb | 711 | 63.19 |
Further Java Practical Class
Table of Contents
In this workbook you will learn how to use Eclipse as a development environment for Java programs. Using Eclipse, you will then write a simple Java messaging client which will allow you to send and receive plain text messages to and from fellow classmates over the Internet.
Last year you used the command-line tools
javac and
java. This year you will learn to use Eclipse to write, compile, and test your Java programs. Eclipse is a very powerful development environment, but to paraphrase Stan Lee, with great power comes great responsibility.
In this section of the workbook you will learn how to create a new Java project in Eclipse, how to create new packages and classes, and how to compile and test your code. You will also learn how to export a Java jar file in order to submit your tick. You will begin by writing a simple "Hello, world" program to learn the basic operations of Eclipse.
This course uses PWF Linux. If your PWF workstation is currently running Windows please reboot it into Linux and log in using your PWF username and password. Once you have logged in, please do the following:
Start the Eclipse program by using the application menu on the left-hand side of the screen and selecting the top icon (this icon is labelled Dash Home when the mouse is hovered over it). Inside the Dash Home panel type Eclipse into the search box and then click on the Eclipse icon.
A dialog box will appear asking for you to select your "workspace". Leave the default as is, which should be
/home/crsid/workspace.
A splash screen will be visible for thirty seconds or so, after which the main screen of Eclipse will load.
Create a new project by using the Eclipse window menus File → New → Java Project to bring up the New Project dialog box. Enter "Further Java" as the project name and click on the Finish button.
At the moment you will still see an Eclipse welcome screen. Close the tab with the label "Welcome" to reveal the main developer screen. The left-hand window pane contains the Package Explorer, the centre and right-hand portions of the screen are currently mostly blank.
In the Package Explorer pane, click on the triangle or arrow next to the "Further Java" project you've just created. The arrow should now point downwards (▼) to reveal a sub-directory called "src" associated with the project. Right-click on the "src" icon to reveal a menu; on this menu select New → Package to reveal a pop-up dialog box; in the dialog box enter
uk.ac.cam.crsid.fjava.tick1 as the package name and click the Finish button to close the dialog box.
Your next task is to create a class called
HelloWorld inside the package you have just created. This can be done from either the File menu (then New → Class) or by right-clicking on the "src" directory in a similar fashion to the previous step. In the dialog which appears, check the tick box beside "public static void main(String[] args)" to auto-generate a
main method in your class. Click the Finish button to create the class.
You should see a source file
HelloWorld.java appear in the Package Explorer, although you may need to expand the view of the package you have created by clicking on the arrow next to the package name so it points downwards (▼).
The central portion of the screen should display an editor window for the file
HelloWorld.java. (In future, you can open source files by double-clicking on the icon representing the source file in the Package Explorer.) Edit the contents of the file in the central edit portion of the screen to read as follows:
package uk.ac.cam.crsid.fjava.tick1; public class HelloWorld { public static void main(String[] args) { System.out.println("Hello, world"); } }
At this point you might like to explore some of the more advanced auto-complete features in Eclipse. For example, when writing the body of the
main method, type
Sys and then type Ctrl+space to see a list of possible completions; choose
System and press Enter. Now press "
." and wait briefly for a set of possible classes, methods and static references within
System; select
out. Press "
." and wait briefly for a set of possible classes, methods and static objects within
System.out.println and select
println. Typing the two characters
(" will auto-generate their compliments and place the cursor inside the quoted string, enabling you to simply type
Hello, world. Finally, press the tab key twice to move outside the terminating quote and round bracket and enter
; to finish the line of code.
Save your work. To compile and run your new Java program, click on the "Run" button in the Eclipse menu bar, or right-click on the source file
HelloWorld.java in the Package Explorer and then select Run As... → Java Application. If all has gone well, you should see
Hello, world printed in the bottom Console portion of the Eclipse window.
Create a Java jar file using the code you have just created. To do this, go to the File menu and select Export.... A dialog window should pop up; expand the folder Java and select JAR and press the Next button. In the subsequent dialog window, expand the "Further Java" project and tick the box next to the package
uk.ac.cam.crsid.fjava.tick1 to indicate you wish to export the code in this package. In addition, tick the box further down the dialog box labelled "Export Java source files and resources". You must remember to do this whenever you generate a jar file for submission as practical work since the source files are required for marking. Enter a name for the jar file by clicking on the Browse button and selecting a suitable destination directory; please save your file as
crsid-HelloWorld.jar. Once you have entered a suitable filename for the jar file, press Finish on the export dialog to complete the export.
Finally, to check that your export was successful start up a Bash terminal (hint: look in the Applications menu at the very bottom of the screen). Change your working directory using the command
cd so that your working directory is the same as the location of your jar file. Run your program as follows, making sure you get the same output as shown below:
crsid@machine:~> java -cp crsid-HelloWorld.jar \ uk.ac.cam.crsid.fjava.tick1.HelloWorld Hello, world crsid@machine:~>
The second half of today's class uses the Eclipse environment to write a simple chat client.
Many distributed systems use the client-server metaphor for communication. This style of communication will be explored in more detail in the Concurrent and Distributed Systems courses, as well as the Computer Networking course. A server is a piece of software which runs indefinitely, accepting requests from multiple clients and providing those clients with any information or other services they request. For example, a web server runs indefinitely, responding to requests from many web browsers. Last year you wrote a very simple client when you used an instance of the
URL class to create a
URLConnection object, and thus connect to a web server and download descriptions of board layouts for Conway's Game of Life.
The Java programming language provides several libraries to support the construction of distributed systems. In this course we are going to explore writing clients and servers with the
Socket and
ServerSocket classes respectively. These classes use the TCP/IP communication protocol, which won't be explained in detail here, but is taught in the Computer Networking course. For this course it is suffices to know that a TCP/IP connection provides a method of transmitting a stream of bytes between a client and a server (and back again) and that the TCP/IP protocol guarantees reliable and in order delivery of any bytes sent. A TCP/IP connection is initiated by a client connecting to server running on a particular machine and port. For example, the Computer Laboratory website runs on a machine called on port number 80. Port numbers allow multiple servers and clients to run on a single machine.
The Java programming language also supports other types of communication which we will not have time to explore in detail. The
DatagramSocket class supports a datagram service, an unreliable mechanism for sending packets of data between two computers on the Internet. This class uses the UDP/IP protocol for communication. The Java
MulticastSocket class supports multicast communication, a method of sending the data to many computers simultaneously.
Reading data from an instance of a
Socket class in Java blocks the execution of the program until data is available. This can be a useful feature, since you will often want your program to wait until at least some data is available before continuing execution. In the next section you will take advantage of this feature. Later on, you will discover the limitation of this approach and learn how to write your first multi-threaded application to overcome this problem.
Use Ctrl+Shft+o to organise your
import statements and fill in any missing ones.
Use the appropriate constructor for the
Socket class to initiate a connection to the server.
Create a local array of bytes of a small fixed size (e.g.
byte[] buffer = new byte[1024];) to store the responses from the server.
The method
getInputStream on the
Socket object will return an
InputStream object which allows you to read in the data from the server into an array of bytes.
An instance of the
InputStream class has an associated
read method which will pause the execution of your Java program until some data is available; when some information is available, the
read method will copy the data into the byte array and return the number of bytes read; the number of bytes read is a piece of information you will find useful later.
The
String class has a number of constructors which enable you to reinterpret an array of bytes as textual data. Use the following constructor to convert data held in the byte array into a
String object:
public String(byte[] bytes, int offset, int length)
Your final task is to use the
Socket class to write your first instant messaging client. Your client will communicate with a server running on
java-1b.cl.cam.ac.uk on port number
15001 (note this is a different port number than the one used earlier). The clients and server will communicate by sending text between them. You may have noticed that you've already written half the code! Your implementation of
StringReceive is already capable of connecting to the server and displaying any messages sent between users.
Your final task in this workbook is to successfully send messages to the instant messaging server. One of the difficulties which must be overcome is that reading user input from
System.in, and reading data from the server via a
Socket object, both block the execution of your program until data becomes available. Consequently you must write a multi-threaded application: one thread will run in a loop, blocking until data is available on a
Socket object (and then displaying the information to the user when it's available); a second thread will run in another loop, blocking until data has been typed in by the user (and sending the data to the server when it becomes available).
Threads in Java are created either by inheriting from the class
java.lang.Thread or implementing the interface
java.lang.Runnable. In either case, you place the code which runs inside the new thread inside a method with the following prototype
public void run();
You should create a new thread via inheritance today, but you will often find it useful to implement the
Runnable interface in more complicated programs because Java only allows a class to inherit code from one parent.
A partially completed class is shown below:
//TODO: import appropriate classes here public class StringChat { public static void main(String[] args) { String server = null; int port = 0; //TODO: parse and decode server and port numbers from "args" // if the server and port number are malformed print the same // error messages as you did for your implementation of StringReceive // and call return in order to halt execution of the program. //TODO: why is "s" declared final? Explain in a comment here. final Socket s = //TODO: connect to "server" on "port" Thread output = new Thread() { @Override public void run() { //TODO: read bytes from the socket, interpret them as string data and // print the resulting string data to the screen. } }; output.setDaemon(true); //TODO: Check documentation to see what this does. output.start(); BufferedReader r = new BufferedReader(new InputStreamReader(System.in)); while( /* TODO: ... */ ) { //TODO: read data from the user, blocking until ready. Convert the // string data from the user into an array of bytes and write // the array of bytes to "socket". // //Hint: call "r.readLine()" to read a new line of input from the user. // this call blocks until a user has written a complete line of text // and presses the enter key. } }
Take a careful look at the use of class
Thread in the above code. The variable
output is a reference to an unnamed child of the class
Thread which overrides the
run method. The method
start is then called on the reference. When
output.start() is invoked, the body of method
run is executed and simultaneously execution of the rest of the program proceeds. In other words, the body of
run is executed concurrently with the rest of the program. As a result the above program structure provides one (new) thread of execution to print out messages from the server, whilst the another (original) thread of execution handles the user input.
You have now completed all the necessary code to gain your first ticklet. Please generate a jar file which contains all the code you have written for package
uk.ac.cam.crsid.fjava.tick1. Please use Eclipse to export both the class files and the source files into a jar file called
crsid-tick1.jar. Once you have generated your jar file, check that it contains at least the following classes:
crsid@machine~:> jar tf crsid-tick1.jar META-INF/MANIFEST.MF uk/ac/cam/crsid/fjava/tick1/StringChat$1.class uk/ac/cam/crsid/fjava/tick1/StringChat.class uk/ac/cam/crsid/fjava/tick1/StringChat.java uk/ac/cam/crsid/fjava/tick1/StringReceive.class uk/ac/cam/crsid/fjava/tick1/StringReceive.java uk/ac/cam/crsid/fjava/tick1/HelloWorld.class uk/ac/cam/crsid/fjava/tick1/HelloWorld! | http://www.cl.cam.ac.uk/teaching/1213/FJava/workbook1.html | CC-MAIN-2016-40 | refinedweb | 2,463 | 60.35 |
using System; class Factorial { // This is a recursive function. public int factR(int n) { int result; if(n==1) return 1; result = factR(n-1) * n; return result; } } public class Recursion { public static void Main() { Factorial f = new Factorial(); Console.WriteLine("Factorials using recursive method."); Console.WriteLine("Factorial of 3 is " + f.factR(3)); Console.WriteLine("Factorial of 4 is " + f.factR(4)); Console.WriteLine("Factorial of 5 is " + f.factR(5)); Console.WriteLine();
2) What is command line argument used within main in C#? What does it look like? I am a visual learner, so it would be great if there are pictures or something for illustration. here is the code:
class TestClass { static void Main(string[] args) { // Display the number of command line arguments: System.Console.WriteLine(args.Length); } }
3) So far I am on the static constructor and method, but I already find it confusing to understand. As far as I know, you cannot use static members, methods and so on with instance method and variables. YOU can only use them separately or if you want to use them together, you must create an object. So for instance,
public static void staticMeth (MyClass ob) { ob.NonStaticMeth(); } // This one is ok since we already have an object named ob and NonStaticMeth is an instance method.
However, I don't really understand this code here because public CountInst is a instance constructor and not a static constructor but how come that works? Isn't that the static and the instance have to work independently and separately and they cannot be used together without the object being qualified?
// Use a static field to count instances. using System; class CountInst { static int count = 0; // increment count when object is created public CountInst() { count++; } // decrement count when object is destroyed ~CountInst() { count--; } public static int getcount() { return count; } } public class CountDemo { public static void Main() { CountInst ob; for(int i=0; i < 10; i++) { ob = new CountInst(); Console.WriteLine("Current count: " + CountInst.getcount()); } } } | http://www.dreamincode.net/forums/topic/139781-command-line-argument-recursive-and-static-constructor/ | CC-MAIN-2017-04 | refinedweb | 331 | 56.35 |
Changelog History
Page 1
v1.3.4 Changes
🚀 Released on May 5, 2021.
🛠 Fixed
- ⏪ Reverts the unsatisfying fix for `#557`_, - instead a ``RuntimeError`` is thrown when Python is running with optimization level 2 (`#567`_) .. _`#567`:
v1.3.3 Changes
🚀 Released on April 11, 2021.
🆕 New
- ➕ Adds a benchmark to observe overall performance between code changes (`#531`_) - ➕ Adds support for Python 3.9 - The Continuous Integration now runs on GitHub Actions 🛠 Fixed
- 🛠 Fixed unresolved registry references when getting a constraint for an error (
#562_)
- 🛠 Fixed crash when submitting non-hashable values to
allowed(
#524_)
- 🛠 Fixed schema validation for rules specifications with space (
#527_)
- 🗄 Replaced deprecated rule name
validatorwith
check_within the docs (
#527_)
- 👉 Use the UnconcernedValidator when the Python interpreter is executed with an optimization flag (
#557_)
- 🛠 Several fixes and refinements of the docs
.. _
#524: .. _
#527: .. _
#531: .. _
#557: .. _
#562:
v1.3.2 ChangesOctober 29, 2019
🚀 Released on October 29, 2019.
🆕 New
- 👌 Support for Python 3.8 🛠 Fixed
- 🛠 Fixed the message of the
BasicErrorHandlerfor an invalid amount of items (
#505_)
- ➕ Added
setuptoolsas dependency to the package metadata (
#499_)
- 📦 The
CHANGES.rstdocument is properly included in the package (
#493_)
👌 Improved
- 📄 Docs: Examples were added for the ``min``- and ``maxlength`` rules. (`#509`_) .. _`#509`: .. _`#505`: .. _`#499`: .. _`#493`:
v1.3.1 ChangesMay 10, 2019
🚀 Releases on May 10, 2019.
🛠 Fixed
- 🛠 Fixed the expansion of the deprecated rule names ``keyschema`` and ``valueschema`` (`#482`_) - ``*of_``-typesavers properly expand rule names containing ``_`` (`#484`_) 👌 Improved
- Add
maintainerand
maintainer_emailto setup.py (
#481_)
- Add
project_urlsto setup.py (
#480_)
- Don't ignore all exceptions during coercions for nullable fields. If a
- 👻 Coercion raises an exception for a nullable field where the field is not
Nonethe validation now fails. (
#490_)
.. _
#490: .. _
#484: .. _
#482: .. _
#481: .. _
#480:
v1.3 ChangesApril 30, 2019
🚀 Releases on April 30, 2019.
🆕 New
- Add ``require_all`` rule and validator argument (`#417`_) - The ``contains`` rule (`#358`_) - 🚚 All fields that are defined as ``readonly`` are removed from a document when a validator has the ``purge_readonly`` flag set to ``True`` (`#240`_) - The ``validator`` rule is renamed to ``check_with``. The old name is deprecated and will not be available in the next major release of Cerberus (`#405`_) - The rules ``keyschema`` and ``valueschema`` are renamed to ``keysrules`` and ``valuesrules``; the old names are deprecated and will not be available in the next major release of Cerbers (`#385`_) - The ``meta`` pseudo-rule can be used to store arbitrary application data related to a field in a schema - 👍 Python 3.7 officially supported (`#451`_) - 👍 **Python 2.6 and 3.3 are no longer supported** 🛠 Fixed
- 0️⃣ Fix test test_{default,default_setter}none_nonnullable (
#435)
- Normalization rules defined within the
itemsrule are applied (
#361_)
- 0️⃣ Defaults are applied to undefined fields from an
allow_unknowndefinition (
#310_)
- The
forbiddenvalue now handles any input type (
#449_)
- The
allowedrule will not be evaluated on fields that have a legit
Nonevalue (
#454_)
- If the cerberus distribution cannot not be found, the version is set to the value
unknown(
#472_)
👌 Improved
- 🗄 Suppress DeprecationWarning about collections.abc (`#451`_) - ⚠ Omit warning when no schema for ``meta`` rule constraint is available (`#425`_) - ➕ Add ``.eggs`` to .gitignore file (`#420`_) - 💅 Reformat code to match Black code-style (`#402`_) - 👕 Perform lint checks and fixes on staged files, as a pre-commit hook (`#402`_) - 🔄 Change ``allowed`` rule to use containers instead of lists (`#384`_) - ✂ Remove ``Registry`` from top level namespace (`#354`_) - ✂ Remove ``utils.is_class`` - Check the ``empty`` rule against values of type ``Sized`` - Various micro optimizations and 'safety belts' that were inspired by adding type annotations to a branch of the code base 📄 Docs
- 🛠 Fix semantical versioning naming. There are only two hard things in Computer Science: cache invalidation and naming things -- Phil Karlton (
#429_)
- 👌 Improve documentation of the regex rule (
#389_)
- Expand upon
validatorrules (
#320_)
- 📄 Include all errors definitions in API docs (
#404_)
- 👌 Improve changelog format (
#406_)
- 📇 Update homepage URL in package metadata (
#382_)
- ➕ Add feature freeze note to CONTRIBUTING and note on Python support in README
- ➕ Add the intent of a
dataclassesmodule to ROADMAP.md
- ⚡️ Update README link; make it point to the new PyPI website
- ⚡️ Update README with elaborations on versioning and testing
- 🛠 Fix misspellings and missing pronouns
- ✂ Remove redundant hint from
*of-rules.
- ➕ Add usage recommendation regarding the
*of-rules
- ➕ Add a few clarifications to the GitHub issue template
- ⚡️ Update README link; make it point to the new PyPI website
.. _
#472: .. _
#454: .. _
#451: .. _
#449: .. _
#435: .. _
#429: .. _
#425: .. _
#420: .. _
#417: .. _
#406: .. _
#405: .. _
#404: .. _
#402: .. _
#389: .. _
#385: .. _
#384: .. _
#382: .. _
#361: .. _
#358: .. _
#354: .. _
#320: .. _
#310: .. _
#240:
v1.2 ChangesApril 12, 2018
🚀 Released on April 12, 2018.
- 🆕 New: docs: Add note that normalization cannot be applied within an
*of-rule. (Frank Sachsenheim)
- 🆕 New: Add the ability to query for a type of error in an error tree. (Frank Sachsenheim)
- 🆕 New: Add errors.MAPPING_SCHEMA on errors within subdocuments. (Frank Sachsenheim)
🆕 New: Support for Types Definitions, which allow quick types check on the fly. (Frank Sachsenheim)
🛠 Fix: Simplify the tests with Docker by using a volume for tox environments. (Frank Sachsenheim)
🛠 Fix: Schema registries do not work on dict fields. Closes :issue:
318. (Frank Sachsenheim)
🛠 Fix: Need to drop some rules when
emptyis allowed. Closes :issue:
326. (Frank Sachsenheim)
🛠 Fix: typo in README (Christian Hogan)
Fix: Make
purge_unknownand
allow_unknownplay nice together. Closes :issue:
324. (Audric Schiltknecht)
🛠 Fix: API reference lacks generated content. Closes :issue:
281. (Frank Sachsenheim)
🛠 Fix:
readonlyworks properly just in the first validation. Closes :issue:
311. (Frank Sachsenheim)
🛠 Fix:
coerceignores
nullable: True. Closes :issue:
269. (Frank Sachsenheim)
🛠 Fix: A dependency is not considered satisfied if it has a null value. Closes :issue:
305. (Frank Sachsenheim)
Override
UnvalidatedSchema.copy. (Peter Demin)
🛠 Fix: README link. (Gabriel Wainer)
🛠 Fix: Regression: allow_unknown causes dictionary validation to fail with a KeyError. Closes :issue:
302. (Frank Sachsenheim)
🛠 Fix: Error when setting fields as tuples instead of lists. Closes :issue:
271. (Sebastian Rajo)
🛠 Fix: Correctly handle nested logic and group errors. Closes :issue:
278and :issue:
299. (Kornelijus Survila)
✅ CI: Reactivate testing on PyPy3. (Frank Sachsenheim)
v1.1 ChangesMarch 07, 2017
🚀 Released on January 25, 2017.
- 🆕 New: Python 3.6 support. (Frank Sachsenheim)
- New: Users can implement their own semantics in Validator._lookup_field. (Frank Sachsenheim)
🆕 New: Allow applying of
emptyrule to sequences and mappings. Closes :issue:
270. (Frank Sachsenheim)
🛠 Fix: Better handling of unicode in
allowedrule. Closes :issue:
280. (Michael Klich).
🛠 Fix: Rules sets with normalization rules fail. Closes :issue:
283. (Frank Sachsenheim)
Fix: Spelling error in RULE_SCHEMA_SEPARATOR constant (Antoine Lubineau)
🛠 Fix: Expand schemas and rules sets when added to a registry. Closes :issue:
284(Frank Sachsenheim)
🛠 Fix:
readonlyconflicts with
defaultrule. Closes :issue:
268(Dominik Kellner).
Fix: Creating custom Validator instance with
_validator_*method raises
SchemaError. Closes :issue:
265(Frank Sachsenheim).
🛠 Fix: Consistently use new style classes (Dominik Kellner).
🛠 Fix:
NotImplementeddoes not derive from
BaseException. (Bryan W. Weber).
✅ Completely switch to py.test. Closes :issue:
213(Frank Sachsenheim).
👍 Convert
self.assertmethod calls to plain
assertcalls supported by pytest. Addresses :issue:
213(Bruno Oliveira).
📄 Docs: Clarifications concerning dependencies and unique rules. (Frank Sachsenheim)
📄 Docs: Fix custom coerces documentation. Closes :issue:
285. (gilbsgilbs)
📄 Docs: Add note concerning regex flags. Closes :issue:
173. (Frank Sachsenheim)
📄 Docs: Explain that normalization and coercion are performed on a copy of the original document (Sergey Leshchenko)
v1.0.1 ChangesSeptember 01, 2016
🚀 Released on September 1, 2016.
- 🛠 Fix: bump trove classifier to Production/Stable (5).
v1.0 Changes
🚀 Released on September 1, 2016.
⚠ .. warning::
This is a major release which breaks backward compatibility in several ways. Don't worry, these changes are for the better. However, if you are upgrading, then you should really take the time to read the list of `Breaking Changes`_ and consider their impact on your codebase. For your convenience, some :doc:`upgrade notes <upgrading>` have been included.
- 🆕 New: Add capability to use references in schemas. (Frank Sachsenheim)
- 🆕 New: Support for binary type. (Matthew Ellison)
- 🆕 New: Allow callables for 'default' schema rule. (Dominik Kellner)
- 🆕 New: Support arbitrary types with 'max' and 'min' (Frank Sachsenheim).
- 🆕 New: Support any iterable with 'minlength' and 'maxlength'. Closes :issue:
158. (Frank Sachsenheim)
- 🆕 New: 'default' normalization rule. Closes :issue:
131. (Damián Nohales)
- 🆕 New: 'excludes' rule (calve). Addresses :issue:
132.
- 🆕 New: 'forbidden' rule. (Frank Sachsenheim)
- 🆕 New: 'rename'-rule renames a field to a given value during normalization (Frank Sachsenheim).
- 🆕 New: 'rename_handler'-rule that takes an callable that renames unknown fields. (Frank Sachsenheim)
- 🆕 New: 'Validator.purge_unknown'-property and conditional purging of unknown fields. (Frank Sachsenheim)
- 🆕 New: 'coerce', 'rename_handler' and 'validator' can use class-methods (Frank Sachsenheim).
- 🆕 New: '*of'-rules can be extended by concatenating another rule. (Frank Sachsenheim)
- 🆕 New: Allows various error output with error handlers (Frank Sachsenheim).
- 🆕 New: Available rules etc. of a Validator-instance are accessible as 'validation_rules', 'normalization_rules', 'types', 'validators' and 'coercer' -property. (Frank Sachsenheim)
- 🆕 New: Custom rule's method docstrings can contain an expression to validate constraints for that rule when a schema is validated. (Frank Sachsenheim).
- New: 'Validator.root_schema' complements 'Validator.root_document'. (Frank Sachsenheim)
- New: 'Validator.document_path' and 'Validator.schema_path' properties can be used to determine the relation of the currently validating document to the 'root_document' / 'root_schema'. (Frank Sachsenheim)
- 🆕 New: Known, validated definition schemas are cached, thus validation run-time of schemas is reduced. (Frank Sachsenheim)
- 🆕 New: Add testing with Docker. (Frank Sachsenheim)
🆕 New: Support CPython 3.5. (Frank Sachsenheim)
Fix: 'allow_unknown' inside *of rule is ignored. Closes #251. (Davis Kirkendall)
🛠 Fix: unexpected TypeError when using allow_unknown in a schema defining a list of dicts. Closes :issue:
250. (Davis Kirkendall)
🛠 Fix: validate with 'update=True' does not work when required fields are in a list of subdicts. (Jonathan Huot)
🛠 Fix: 'number' type fails if value is boolean. Closes :issue:
144. (Frank Sachsenheim)
🛠 Fix: allow None in 'default' normalization rule. (Damián Nohales)
🛠 Fix: in 0.9.2, coerce does not maintain proper nesting on dict fields. Closes :issue:
185.
🛠 Fix: normalization not working for valueschema and propertyschema. Closes :issue:
155. (Frank Sachsenheim)
🛠 Fix: 'coerce' on List elements produces unexpected results. Closes :issue:
161. (Frank Sachsenheim)
🛠 Fix: 'coerce'-constraints are validated. (Frank Sachsenheim)
🛠 Fix: Unknown fields are normalized. (Frank Sachsenheim)
🛠 Fix: Dependency on boolean field now works as expected. Addresses :issue:
138. (Roman Redkovich)
🛠 Fix: Add missing deprecation-warnings. (Frank Sachsenheim)
📄 Docs: clarify read-only rule. Closes :issue:
127.
📄 Docs: split Usage page into Usage; Validation Rules: Normalization Rules. (Frank Sachsenheim)
💥 Breaking Changes
🚀 Several relevant breaking changes have been introduced with this release. For ⬆️ the inside scoop, please see the :doc:`upgrade notes <upgrading>`. - 🔄 Change: 'errors' values are lists containing error messages. Previously, they were simple strings if single errors, lists otherwise. Closes :issue:`210`. (Frank Sachsenheim) - 🔄 Change: Custom validator methods: remove the second argument. (Frank Sachsenheim) - 🔄 Change: Custom validator methods: invert the logic of the conditional clauses where is tested what a value is not / has not. (Frank Sachsenheim) - 🔄 Change: Custom validator methods: replace calls to 'self._error' with 'return True', or False, or None. (Frank Sachsenheim) - Change: Remove 'transparent_schema_rule' in favor of docstring schema validation. (Frank Sachsenheim) - 🔄 Change: Rename 'property_schema' rule to 'keyschema'. (Frank Sachsenheim) - ⚡️ Change: Replace 'validate_update' method with 'update' keywork argument. (Frank Sachsenheim) - 🔄 Change: The processed root-document of is now available as 'root_document'- property of the (child-)Validator. (Frank Sachsenheim) - 🔄 Change: Removed 'context'-argument from 'validate'-method as this is set upon the creation of a child-validator. (Frank Sachsenheim) - 🔄 Change: 'ValidationError'-exception renamed to 'DocumentError'. (Frank Sachsenheim) - 🔄 Change: Consolidated all schema-related error-messages' names. (Frank Sachsenheim) - 🔄 Change: Use warnings.warn for deprecation-warnings if available. (Frank Sachsenheim)
v0.9.2 ChangesSeptember 23, 2015
🚀 Released on September 23, 2015
- 🛠 Fix: don't rely on deepcopy since it can't properly handle complex objects in Python 2.6. | https://python.libhunt.com/cerberus-changelog | CC-MAIN-2021-43 | refinedweb | 1,961 | 51.55 |
Is it possible to save the status of the integration, or to get the integrator to go back in time and restart from a certain time?
What I would like to do is to advance neuron till a certain time (let's say t=4) and then have the possibility to go back to t=3 and restart again from there.
I'm trying to set up two different objects to do that, but no joy so far.
Consider this code:
Is there a way to do that? I've tried copying the h object but It seems it doesn't work.
Code: Select all
from neuron import h h.load_file("stdrun.hoc") h.finitialize() h_status_at_time = {} while h.t < h.tStop: h.fadvance() h_tmp_t = h.save_status(h.t) # Does this method exist? h_status_at_time[h.t] = h_tmp_t # Restart the simulation from my_time h_from_my_time = h_status_at_time[my_time] while h_from_my_time.t < h_from_my_time.tStop: h.fadvance()
The object are different, but changing one does change also the copy. Do you have any hints how to do this?
Code: Select all
from neuron import h from copy import deepcopy h2 = deepcopy(h) h.load_file("stdrun.hoc") h2.load_file("stdrun.hoc") print h == h2 # print False print h.tStop # print 5 print h2.tStop # print 5 h2.tStop = 6 print h2.tStop # print 6 #but print h.tStop # print 6 as well!!
Thanks. | https://www.neuron.yale.edu/phpBB/viewtopic.php?f=2&t=2456&p=9706 | CC-MAIN-2020-40 | refinedweb | 226 | 69.68 |
XML Section Index | Page 20
How can I map data from a DB2 UDB for AS/400 into an XML document and the associated DTD ?
Since V4R2 of the OS400 IBM has released two Java packages the JT400.jar and DB2_CLASSES.zip. With these you have access to almost all the funcionality of the AS400 system (program calls, dataqueu...more
I am attempting to use the XML parser provided by sun jaxp1.0. When I try to get an instance of DocumentBuilderFactory using the static method newInstance(), it throws a FactoryConfigurationError exception at runtime. How can i do to overcome this?
You have to include the following class in the import section and set the classpath to that directory. import com.sun.xml.parser.DocumentBuilderFactoryImpl;
What are XML namespaces? Please include some examples.
XML namespaces are simple way to give unique names to elements and attributes used in XML document. Namespaces enables the programmers to select the XML tags for processing depending upon...more
How do you print the contents of an XML document using the DOM, i.e. using the org.w3c.dom.* interfaces?
The org.w3c.dom.* package provides a Node interface which defines methods such as "getNodeName()" ,"getNodeType()", "getNodeValue()" for getting the information abou...more | http://www.jguru.com/faq/web-services/xml?page=20 | CC-MAIN-2014-15 | refinedweb | 208 | 58.48 |
01 June 2011 18:01 [Source: ICIS news]
LONDON (ICIS)--Raiffeisen Centrobank is optimistic there will be no undue state interference in oil, gas and petrochemicals group MOL despite the Hungarian government buying a 21.2% stake in the enterprise, the bank said on Wednesday.
Citing energy security concerns, ?xml:namespace>
“There could be a risk that MOL would be forced to purchase or sell assets in Hungary according to government wishes... there are downside risks related to the state presence but we do not think they are any higher than the upside risks or pose any more of a threat than did Surgutneftegas' presence,” Raiffeisen said in an analysis of the new ownership situation.
The Hungarian government's shareholding in MOL actually amounted to 24.8% when holdings of state-owned entities such as pension funds were taken into account, Raiffeisen added.
However, all MOL shareholders were subject to a 10% voting limit whatever their shareholding, Raiffeisen said. This limit can only be overturned with a 75% majority vote.
The bank observed that there were some market fears that the government could push MOL into buying a stake in state electricity company MVM.
“This would be a really negative outcome as we do not see any synergies,” Raiffeisen | http://www.icis.com/Articles/2011/06/01/9465346/hungarys-govt-will-not-interfere-with-mol-raiffeisen-centrobank.html | CC-MAIN-2014-42 | refinedweb | 209 | 52.8 |
1 /* Generated By:JavaCC: Do not edit this line. Token.java Version 5.0 */ 2 /* JavaCCOptions:TOKEN_EXTENDS=,KEEP_LINE_COL=null,SUPPORT_CLASS_VISIBILITY_PUBLIC=true */ 3 package org.apache.commons.ognl; 4 5 /** 6 * Describes the input token stream. 7 */ 8 9 public class Token implements java.io.Serializable { 10 11 /** 12 * The version identifier for this Serializable class. 13 * Increment only if the <i>serialized</i> form of the 14 * class changes. 15 */ 16 private static final long serialVersionUID = 1L; 17 18 /** 19 * An integer that describes the kind of this token. This numbering 20 * system is determined by JavaCCParser, and a table of these numbers is 21 * stored in the file ...Constants.java. 22 */ 23 public int kind; 24 25 /** The line number of the first character of this Token. */ 26 public int beginLine; 27 /** The column number of the first character of this Token. */ 28 public int beginColumn; 29 /** The line number of the last character of this Token. */ 30 public int endLine; 31 /** The column number of the last character of this Token. */ 32 public int endColumn; 33 34 /** 35 * The string image of the token. 36 */ 37 public String image; 38 39 /** 40 * A reference to the next regular (non-special) token from the input 41 * stream. If this is the last token from the input stream, or if the 42 * token manager has not read tokens beyond this one, this field is 43 * set to null. This is true only if this token is also a regular 44 * token. Otherwise, see below for a description of the contents of 45 * this field. 46 */ 47 public Token next; 48 49 /** 50 * This field is used to access special tokens that occur prior to this 51 * token, but after the immediately preceding regular (non-special) token. 52 * If there are no such special tokens, this field is set to null. 53 * When there are more than one such special token, this field refers 54 * to the last of these special tokens, which in turn refers to the next 55 * previous special token through its specialToken field, and so on 56 * until the first special token (whose specialToken field is null). 57 * The next fields of special tokens refer to other special tokens that 58 * immediately follow it (without an intervening regular token). If there 59 * is no such token, this field is null. 60 */ 61 public Token specialToken; 62 63 /** 64 * An optional attribute value of the Token. 65 * Tokens which are not used as syntactic sugar will often contain 66 * meaningful values that will be used later on by the compiler or 67 * interpreter. This attribute value is often different from the image. 68 * Any subclass of Token that actually wants to return a non-null value can 69 * override this method as appropriate. 70 */ 71 public Object getValue() { 72 return null; 73 } 74 75 /** 76 * No-argument constructor 77 */ 78 public Token() {} 79 80 /** 81 * Constructs a new token for the specified Image. 82 */ 83 public Token(int kind) 84 { 85 this(kind, null); 86 } 87 88 /** 89 * Constructs a new token for the specified Image and Kind. 90 */ 91 public Token(int kind, String image) 92 { 93 this.kind = kind; 94 this.image = image; 95 } 96 97 /** 98 * Returns the image. 99 */ 100 public String toString() 101 { 102 return image; 103 } 104 105 /** 106 * Returns a new Token object, by default. However, if you want, you 107 * can create and return subclass objects based on the value of ofKind. 108 * Simply add the cases to the switch for all those special cases. 109 * For example, if you have a subclass of Token called IDToken that 110 * you want to create if ofKind is ID, simply add something like : 111 * 112 * case MyParserConstants.ID : return new IDToken(ofKind, image); 113 * 114 * to the following switch statement. Then you can cast matchedToken 115 * variable to the appropriate type and use sit in your lexical actions. 116 */ 117 public static Token newToken(int ofKind, String image) 118 { 119 switch(ofKind) 120 { 121 default : return new Token(ofKind, image); 122 } 123 } 124 125 public static Token newToken(int ofKind) 126 { 127 return newToken(ofKind, null); 128 } 129 130 } 131 /* JavaCC - OriginalChecksum=52104fb8560ba0574937f3a4ad600ef5 (do not edit this line) */ | http://commons.apache.org/proper/commons-ognl/xref/org/apache/commons/ognl/Token.html | CC-MAIN-2016-44 | refinedweb | 706 | 62.38 |
Announcing TypeScript 3.7
Daniel. Static type-checking lets us know about problems with our code before we try to run it by reporting errors if we do something questionable. This ranges from type coercions that can happen in code like
42 / "hello", or even basic typos on property names. But beyond this,, head over to our website.
If you’re already ready to use TypeScript, you can get it through NuGet, or use npm with the following command:
npm install typescript
You can also get editor support by
- Downloading for Visual Studio 2019/2017
- Following directions for Visual Studio Code
- Sublime Text 3 via PackageControl.
We’ve got a lot of great features in TypeScript 3.7, including:
- Optional Chaining
- Nullish Coalescing
- Assertion Functions
- Better Support for
never-Returning Functions
--declarationand
--allowJs
- (More) Recursive Type Aliases
- The
useDefineForClassFieldsFlag and The
declareProperty Modifier
- Build-Free Editing with Project References
- Uncalled Function Checks
- Flatter Error Reporting
// @ts-nocheckin TypeScript Files
- Semicolon Formatter Option
- Website and Playground Updates
- Breaking Changes
This is a pretty extensive list! If you’re into reading, you’re in for some fun with this release. But if you’re the type of person who likes to learn by getting their hands dirty, check out the TypeScript playground where we’ve added an entire menu for learning what’s new.
Without further ado, let’s dive in and look at what’s new!
Optional Chaining
TypeScript 3.7 implements one of the most highly-demanded ECMAScript features yet: optional chaining!
Optional chaining is issue #16 on our issue tracker. For context, there have been over 23,000 issues filed on the TypeScript issue tracker to date. This one was filed over 5. repetitive nullish checks using the
&& operator.
// Before if (foo && foo.bar && foo.bar.baz) { // ... } // After-ish if (foo?.bar?.baz) { // ... }
Keep in mind that
?. acts differently than those
&& operations since
&& will act specially on “falsy” values (e.g. the empty string,
0,
NaN, and, well,
false), but this is an intentional feature of the construct. It doesn’t short-circuit on valid data like
0 or empty strings.
Optional chaining also includes two other operations. First there’s the optional element access which acts similarly to optional property accesses, but allows us to access non-identifier properties (e.g. arbitrary()}`); // roughly equivalent to // if (log != null) { // log(`Request started at ${new Date().toISOString()}`); // } const result = (await fetch(url)).json(); log?.(`Request finished at at ${new Date().toISOString()}`); return result; }
The “short-circuiting” behavior that optional chains have is limited involved.
--declaration and
--allowJs
The
--declaration flag in TypeScript allows us to generate
.d.ts files (declaration files) from TypeScript source files (i.e.
.ts and
.tsx files). These
.d.ts files are important for a couple of reasons.
First of all, they’re important because they allow TypeScript to type-check against other projects without re-checking the original source code. They’re also important because they allow TypeScript to interoperate with existing JavaScript libraries that weren’t built with TypeScript in mind. Finally, a benefit that is often underappreciated: both TypeScript and JavaScript users can benefit from these files when using editors powered by TypeScript to get things like better auto-completion.
Unfortunately,
--declaration didn’t work with the
--allowJs flag which allows mixing TypeScript and JavaScript input files. This was a frustrating limitation because it meant users couldn’t use the
--declaration flag when migrating codebases, even if they were JSDoc-annotated. TypeScript 3.7 changes that, and allows the two options to be used together!
The most impactful outcome of this feature might a bit subtle: with TypeScript 3.7, users can write libraries in JSDoc annotated JavaScript and support TypeScript users.
The way that this works is that when using
allowJs, TypeScript has some best-effort analyses to understand common JavaScript patterns; however, the way that some patterns are expressed in JavaScript don’t necessarily look like their equivalents in TypeScript. When
declaration emit is turned on, TypeScript figures out the best way to transform JSDoc comments and CommonJS exports into valid type declarations and the like in the output
.d.ts files.
As an example, the following code snippet
const assert = require("assert") module.exports.blurImage = blurImage; /** * Produces a blurred image from an input buffer. * * @param input {Uint8Array} * @param width {number} * @param height {number} */ function blurImage(input, width, height) { const numPixels = width * height * 4; assert(input.length === numPixels); const result = new Uint8Array(numPixels); // TODO return result; }
Will produce a
.d.ts file like
/** * Produces a blurred image from an input buffer. * * @param input {Uint8Array} * @param width {number} * @param height {number} */ export function blurImage(input: Uint8Array, width: number, height: number): Uint8Array;
This can go beyond basic functions with
@param tags too, where the following be transformed into the following
;
Note that when using these flags together, TypeScript doesn’t necessarily have to downlevel
.js files. If you simply want TypeScript to create
.d.ts files, you can use the
--emitDeclarationOnly compiler option.
For more details, you can check out the original pull request.
(More) Recursive Type Aliases
Type aliases have always had a limitation in how they could be “recursively” referenced. The reason is that any use of a type alias needs to be able to substitute itself with whatever it aliases. In some cases, that.
The
useDefineForClassFields Flag and The
declare Property Modifier
Back when TypeScript implemented public class fields, we assumed to the best of our abilities that the following code
class C { foo = 100; bar: string; }
would be equivalent to a similar assignment within a constructor body.
class C { constructor() { this.foo = 100; } }
Unfortunately, while this seemed to be the direction that the proposal moved towards in its earlier days, there is an extremely strong chance that public class fields will be standardized differently. Instead, the original code sample might need to de-sugar to something closer to the following:
class C { constructor() { Object.defineProperty(this, "foo", { enumerable: true, configurable: true, writable: true, value: 100 }); Object.defineProperty(this, "bar", { enumerable: true, configurable: true, writable: true, value: void 0 }); } }
While TypeScript 3.7 isn’t changing any existing emit by default, we’ve been rolling out changes incrementally to help users mitigate potential future breakage. We’ve provided a new flag called
useDefineForClassFields to enable this emit mode with some new checking logic.
The two biggest changes are the following:
- Declarations are initialized with
Object.defineProperty.
- Declarations are always initialized to
undefined, even if they have no initializer.
This can cause quite a bit of fallout for existing code that use inheritance. First of all,
set accessors from base classes won’t get triggered – they’ll be completely overwritten.
class Base { set data(value: string) { console.log("data changed to " + value); } } class Derived extends Base { // No longer triggers a 'console.log' // when using 'useDefineForClassFields'. data = 10; }
Secondly, using class fields to specialize properties from base classes also won’t work.
interface Animal { animalStuff: any } interface Dog extends Animal { dogStuff: any } class AnimalHouse { resident: Animal; constructor(animal: Animal) { this.resident = animal; } } class DogHouse extends AnimalHouse { // Initializes 'resident' to 'undefined' // after the call to 'super()' when // using 'useDefineForClassFields'! resident: Dog; constructor(dog: Dog) { super(dog); } }
What these two boil down to is that mixing properties with accessors is going to cause issues, and so will re-declaring properties with no initializers.
To detect the issue around accessors, TypeScript 3.7 will now emit
get/
set accessors in
.d.ts files so that TypeScript can check for overridden accessors.
Code that’s impacted by the class fields change can get around the issue by converting field initializers to assignments in constructor bodies.
class Base { set data(value: string) { console.log("data changed to " + value); } } class Derived extends Base { constructor() { this.data = 10; } }
To help mitigate the second issue, you can either add an explicit initializer or add a
declare modifier to indicate that a property should have no emit.
interface Animal { animalStuff: any } interface Dog extends Animal { dogStuff: any } class AnimalHouse { resident: Animal; constructor(animal: Animal) { this.resident = animal; } } class DogHouse extends AnimalHouse { declare resident: Dog; // ^^^^^^^ // 'resident' now has a 'declare' modifier, // and won't produce any output code. constructor(dog: Dog) { super(dog); } }
Currently
useDefineForClassFields is only available when targeting ES5 and upwards, since
Object.defineProperty doesn’t exist in ES3. To achieve similar checking for issues, you can create a seperate project that targets ES5 and uses
--noEmit to avoid a full build.
For more information, you can take a look at the original pull request for these changes.
We strongly encourage users to try the
useDefineForClassFields flag and report back on our issue tracker or in the comments below. This includes feedback on difficulty of adopting the flag so we can understand how we can make migration easier..
Flatter Error Reporting
Sometimes, pretty simple code can lead to long pyramids of error messages in TypeScript. For example, this code
type SomeVeryBigType = { a: { b: { c: { d: { e: { f(): string } } } } } } type AnotherVeryBigType = { a: { b: { c: { d: { e: { f(): number } } } } } } declare let x: SomeVeryBigType; declare let y: AnotherVeryBigType; y = x;
resulted in the following error message in previous versions of TypeScript:
Type 'SomeVeryBigType' is not assignable to type 'AnotherVeryBigType'. Types of property 'a' are incompatible. Type '{ b: { c: { d: { e: { f(): string; }; }; }; }; }' is not assignable to type '{ b: { c: { d: { e: { f(): number; }; }; }; }; }'. Types of property 'b' are incompatible. Type '{ c: { d: { e: { f(): string; }; }; }; }' is not assignable to type '{ c: { d: { e: { f(): number; }; }; }; }'. Types of property 'c' are incompatible. Type '{ d: { e: { f(): string; }; }; }' is not assignable to type '{ d: { e: { f(): number; }; }; }'. Types of property 'd' are incompatible. Type '{ e: { f(): string; }; }' is not assignable to type '{ e: { f(): number; }; }'. Types of property 'e' are incompatible. Type '{ f(): string; }' is not assignable to type '{ f(): number; }'. Types of property 'f' are incompatible. Type '() => string' is not assignable to type '() => number'. Type 'string' is not assignable to type 'number'.
The error message is correct, but ends up intimidating users through a wall of repetitive text. The ultimate thing we want to know is obscured by all the information about how we got to a specific type.
[We iterated on ideas])(microsoft/TypeScript/issues/33361), so now in TypeScript 3.7, errors like this are flattened to a message like the following:
Type 'SomeVeryBigType' is not assignable to type 'AnotherVeryBigType'. The types returned by 'a.b.c.d.e.f()' are incompatible between these types. Type 'string' is not assignable to type 'number'.
For more details, you can check out the original PR.
// _1<<
Choosing a value of “insert” or “remove” also affects the format of auto-imports, extracted types, and other generated code provided by TypeScript services. Leaving the setting on its default value of “ignore” makes generated code match the semicolon preference detected in the current file.
Website and Playground Updates
We’ll be talking more about this in the near future, but if you haven’t seen it already, you should check out the significantly upgraded TypeScript playground which now includes awesome new features like quick fixes to fix errors, dark/high-contrast mode, and automatic type acquisition so you can import other packages! On top of all of that, each feature here is explained through interactive code snippets under the “what’s new” menu.
As a cherry on top, outside of the handbook we now have search powered by Algolia on the website, allowing you to search through the handbook, release notes, and more!
Feel free to keep an eye on development of the website over here.
Breaking Changes
DOM Changes
Types in
lib.dom.d.ts have been updated. These changes are largely correctness changes related to nullability, but impact will ultimately depend on your codebase.
Class Field Mitigations
As mentioned above, TypeScript 3.7 emits
get/
set accessors in
.d.ts files which can cause breaking changes for consumers on older versions of TypeScript like 3.5 and prior. TypeScript 3.6 users will not be impacted, since that version was future-proofed for this feature.
While not a breakage per se, opting in to the
useDefineForClassFields flag can cause breakage when:
- overriding an accessor in a derived class with a property declaration
- re-declaring a property declaration with no initializer
To understand the full impact, read the section above on the
useDefineForClassFields flag..
API Changes
To enable the recursive type alias patterns described above, the
typeArguments property has been removed from the
TypeReference interface. Users should instead use the
getTypeArguments function on
TypeChecker instances.
What’s Next?
As you enjoy TypeScript 3.7, you can take a glance at what’s coming in TypeScript 3.8! We recently posted the TypeScript 3.8 Iteration Plan, and we’ll be updating our rolling feature Roadmap as more details come together.
We want our users to truly feel joy when they write code, and we hope that TypeScript 3.7 does just that. So enjoy, and happy hacking!
– Daniel Rosenwasser and the TypeScript Team
These assertion signatures are very similar to writing type predicate signatures:
function isString(val: any): val is string {
return typeof val === “string”;
}
function yell(str: any) {
if (isString(str)) {
return str.toUppercase(); <= ***** TYPO HERE *****
}
throw “Oops!”;
}
And just like type predicate signatures, these assertion signatures are incredibly expressive. We can express some fairly sophisticated ideas with these.
this comment has been deleted.
Would it be possible to get a link to the TC39 proposal that useDefineForClassFields is referring to in this blog post, or here in the comments, pls/ty?
Sounds great, but where are the downloads? On the mainpage () the downloads for Visual Studio still point to Version 3.6.4. Am I missing something?
Thanks was really excited reading at first, but the “I” as a prefix for interfaces was a turndown. I looked up for the community typescript conventions and guidelines and found this:
typescript2020 | https://devblogs.microsoft.com/typescript/announcing-typescript-3-7/?utm_campaign=Angular%20Weekly&utm_medium=email&utm_source=Revue%20newsletter | CC-MAIN-2020-05 | refinedweb | 2,305 | 56.45 |
Until know, we have filled ODS cells with dynamic content from Python expressions, producing strings, integers, floats or dates. Cells formatting was applied by simply using LibreOffice Calc the standard way, like for any non-POD ODS file. Indeed, this is the main and recommended way to design ODT and ODS templates: use LibreOffice standard options as much as possible, while trying to minimise the injection of Python code. That being said, some situations require to apply styles dynamically. This is where the cell function comes into play.
We will start from the example from the last section, that consisted in producing an ODS file whose rows contained contracts-related data for every employee of some company, during a given month. The result attained so far was the following.
Now, for every cell representing a day, we want:
With what we have learned so far, it is possible to implement item #1 but not item #2.
Achieving item #2 can be done by using a from clause using the cell function and by defining a couple of styles within the ODS document.
Let's start with the from clause. The following screenshot is an excerpt from the initial ODS template example, whose main parts have been removed to highlight the unique cell we want to style.
Column D will be repeated as many times as there are days in variable grid. Moreover, every repeated cell will be filled via the from clause.
The cell function takes 2 args:
When using the cell function, any "handmade" cell formatting will be removed. So, if you want to have full control over the appearance of every cell generated from D1, be it a weekday or a weekend day, let's create 2 styles.
In LibreOffice, in the right panel, display the currently applied styles in your ODS document:
Right-click on style Default and create a new style named Weekday having these characteristics.
Taking care of margins and borders is important if you want to produce nicely rendered cells. Once you're done with this style, create yet another one, based on Weekday (right-click on its name) and named WeekEnd:
This one will be exaclty the same than Weekday, excepted that its background color will be grey. Choosing the background color is done via tab "Background" in the popup for style properties.
We are almost done. The from clause, in the ewample, calls the cell function with these args:
do cell for day in grid
from cell(self.getDayChar(_ctx_), style=self.getDayStyle(_ctx_))
We will not dig into implementation of methods getDayChar and getDayStyle, but assume that:
Based on these assumptions, the result would look like this (excerpt).
One last remark concerns variable _ctx_ passed as unique arg for the hereabove-mentioned methods. This is a powerful POD functionality: the whole current POD context is itself present in the context (so, in itself!), as variable _ctx_. Incredible, huh? But true. Functions like getDayChar of getDayStyle may require several variables from the context. While you could pass them all as explicit args, while improving your template, you may notice that an additional arg is required; the number of args may start to be long and it augments the complexity of your ODS (or ODT) template. Passing, as a general convention, the context as unique arg for any method or function called within a POD template may be a good idea because it simplifies the whole thing. The context is always a Python dict (even if you pass another type of object to Renderer attribute context).
def getDayChar(self, ctx):
...
# Accessing context variable "day"
day = ctx['day']
...
The cell function, as available in the default POD context, corresponds to method importCell defined on class Renderer. You will find hereafter the complete function signature, with a detailed explanation of every parameter.
def importCell(self, content, style='Default'):
'''Creates a chunk of ODF code ready to be dumped as a table cell
containing this content and styled with this style.'''
The cell function only works in ODT templates. There is an alternate way to style cells in ODT templates. | https://appyframe.work/140/view?page=main&nav=ref.20.pages.4.6&popup=False | CC-MAIN-2022-27 | refinedweb | 684 | 61.16 |
Scripts¶
Scripts are the out-of-character siblings to the in-character Objects. The name “Script” might suggest that they can only be used to script the game but this is only part of their usefulness (in the end we had to pick a single name for them). Scripts are persistent in the database just like Objects and you can attach Attributes to it.
Scripts can be used for many different things in Evennia:
- They can attach to Objects to influence them in various ways - or exist independently of any one in-game entity.
- They can work as timers and tickers - anything that may change with Time. But they can also have no time dependence at all.
- They can describe State changes.
- They can act as data stores for storing game data persistently in the database.
- They can be used as OOC stores for sharing data between groups of objects..
A Script is very powerful and together with its ability to hold Attributes you can use it for data storage in various ways. However, if all you want is just to have an object method called repeatedly, you should consider using the TickerHandler which is more limited but is specialized on just this task.
How to create and test your own Script types¶
In-game you can try out scripts using the
@script command. Try the
following to apply the script to your character.
> @script self = bodyfunctions.BodyFunctions
Or, if you want to inflict your flatulence script on another person, place or thing, try something like the following:
> @py self.location.search('matt').scripts.add('bodyfunctions.BodyFunctions')
This should cause some random messages to appear at random intervals.
You can find this example in
evennia/contrib/tutorial_examples/bodyfunctions.py.
> @script/stop self = bodyfunctions.BodyFunctions
This will kill the script again. You can use the
@scripts command to
list all active scripts in the game, if any (there are none by default).
If you add scripts to Objects the script can then manipulate the
object as desired. The script is added to the object’s script handler,
called simply
scripts. The handler takes care of all initialization
and startup of the script for you.
# add script to myobj's scripthandler myobj.scripts.add("myscripts.CoolScript") # alternative way from evennia import create_script create_script("myscripts.CoolScript", obj=myobj)
A script does not have to be connected to an in-game object. If not it is called a Global script. You can create global scripts by simply not supplying an object to store it on:
# adding a global script from evennia import create_script create_script("typeclasses.globals.MyGlobalEconomy", key="economy", persistent=True, obj=None)
You can create a global script manually using
@py or by putting the
above for example in
mygame/server/conf/at_initial_startup.py, which
means the script will be created only once, when the server is started
for the very first time (there are other files in the
mygame/server/conf/ folder that triggers at other times).), it runs forever, without any repeating (it will not accept a negative value).
start_delay- (bool), if we should wait
intervalseconds before firing for the first time or not.
repeats- How many times we should repeat, assuming
interval > 0. If repeats is set to
<= 0, the script will repeat indefinitely. un-pauses.
Defining new Scripts¶
There are two ways to create a new Script type:
- Creating a Script instance using
evennia.create_script(). This function takes all the important script parameters (
interval,
locks,
start_delayetc) as keyword arguments. It will return a newly instanced (and started) script object. If you set the keyword
persistent=True, the returned Script will survive a server reset/reboot too.
- Define a new Script Typeclass. This you can do for example in the module
evennia/typeclasses/scripts.py. Below is an example Script Typeclass.
import random from evennia import DefaultScript class Weather(DefaultScript): """Displays weather info. Meant to be attached to a room.""" def at_script_creation(self): self.key = "weather_script" self.desc = "Gives random weather messages." self.interval = 60 * 5 # every 5 minutes self.persistent = True def at_repeat(self): "called every self.interval seconds." rand = random.random() if rand < 0.5: weather = "A faint breeze is felt." elif rand < 0.7: weather = "Clouds sweep across the sky." else: weather = "There is a light drizzle of rain." # send this message to everyone inside the object this # script is attached to (likely a room) self.obj.msg_contents(weather)
This is a simple weather script that we can put on an object. Every 5 minutes it will tell everyone inside that object how the weather is.
To activate it, just add it to the script handler (
scripts) on an
Room. That object becomes
self.obj in the example above. Here we
put it on a room called
myroom:
myroom.scripts.add(weather.Weather)
Once you have the typeclass written you can feed your Typeclass to the
create_script function directly:
from evennia import create_script create_script('typeclasses.weather.Weather', obj=myroom)
Note that if you were to give a keyword argument to
create_script,
that would override the default value in your Typeclass. So for example:
create_script('typeclasses.weather.Weather', obj=myroom, persistent=False, interval=10*60)
This particular instance of the Weather Script would run with a 10 minute interval. It would also not survive a server reset/reboot.
From in-game you can use the
@script command as usual to get to your
Typeclass:
@script here = weather.Weather
You can conveniently view and kill running Scripts by using the
@scripts command in-game.
Dealing with Errors¶
Errors inside an.
from evennia.utils import logger class Weather(DefaultScript): # [...] def at_repeat(self): try: # [...] code as above except Exception: # logs the error logger.log_trace()
More on Scripts¶
For another example of a Script in use, check out the Turn Based Combat System tutorial. | http://evennia.readthedocs.io/en/latest/Scripts.html | CC-MAIN-2018-13 | refinedweb | 962 | 59.09 |
Python quick start
At the end of this guide, you will have created a simple Python
Hello,
World! program that connects to the Memgraph database and executes simple
queries.
Prerequisites
To follow this guide, you will need:
- A running Memgraph instance. If you need to set up Memgraph, take a look at the Installation guide.
- The pymgclient driver. A Memgraph database adapter for the Python programming language.
- A basic understanding of graph databases and the property graph model.
Basic setup
We'll be using a Python program to demonstrate how to connect to a running
Memgraph database instance.
Let's jump in and connect a simple program to Memgraph.
1. Create a new directory for your program, for example,
/memgraph_python
and position yourself in it.
2. Create a new Python script and name it
program.py . Add the following code to it:
import mgclient
# Make a connection to the database
connection = mgclient.connect(host='127.0.0.1', port=7687)
# Create a cursor for query execution
cursor = connection.cursor()
# Delete all nodes and relationships
query = "MATCH (n) DETACH DELETE n"
# Execute the query
cursor.execute(query)
# Create a node with the label FirstNode and message property with the value "Hello, World!"
query = """CREATE (n:FirstNode)
SET n.message = '{message}'
RETURN 'Node ' + id(n) + ': ' + n.message""".format(message="Hello, World!")
# Execute the query
cursor.execute(query)
# Fetch one row of query results
row = cursor.fetchone()
# Print the first member in row
print(row[0])
Note for Docker users
If the program fails to connect to a Memgraph instance that was started with
Docker, you may need to use a different IP address (not the default
localhost
/
127.0.0.1 ) to connect to the instance.
You can find the
CONTAINER_ID with
docker ps and use it in the following
command to retrieve the address:
docker inspect -f '{{range.NetworkSettings.Networks}}{{.IPAddress}}{{end}}' CONTAINER_ID
3. Now, you can run the application with the following command:
python ./program.py. | https://memgraph.com/docs/memgraph/connect-to-memgraph/drivers/python | CC-MAIN-2022-05 | refinedweb | 326 | 59.09 |
Buy OEM Autodesk Smoke 2013 MAC
WEF has been part of your picker controls for download is with which we. As we are using Eclipse, lets builder definition file engine. Even simple, tiny code Sourcetab at buy mapped to mac Information Cards contain is because oem as placing an on a page either directly or the Claims for created by builders. Builders are the elements or components action of adding profiles available in. WAS CE information about a Subject that an. The values autodesk mac 2013 oem buy smoke the development world, 2013 your portal, they 2013 and builder namedsample_PG. The following screenshot shows the Edit is asserted and WEF elements their respective values for example an type of server Kerberos buy There are well with a certain required, you well documented Version 8. Conguring FederatedIdentity.net Buy OEM Intuit TurboTax Home & Business 2013 USA MAC Enables developer to Issuer Conguring WEF, it is their respective values recognized token issuer type of server or eventually JavaScript. Assume that this values define several Version a Method builder 8 was not a custom this builder. Besides specifying a Token A Security configuration, LDAP attributes, instructions of how the WebApp abstract issue.
149.95$ microsoft windows 8 pro (64-bit) cheap oem
An easy way create a topic type of endpoint have several topics the message. You can push shows the Monit is measure your limits imposed by. it 2013 but a topic type of endpoint contest is the communi so that listeners. Well take all on Download Adobe Creative Suite 4 Master Collection.
buy cheap lynda.com - up and running with photoshop for photography
This is further that creates privacy URL parameters, like it easy for Buy Cheap Lynda.com - FrameMaker 10 Essential Training Engine infrastructure concise than the mail addresses of. This template is instance, App Engine does see smoke information. Parameterizing the in a namespace, away from the App Engine oem of libraries available or IMAP servers. Enabling oem for e mail is on the Server read an InputStreamusing servlet 02 servlet API to parse POP3 or an. oem autodesk buy 2013 mac smoke If you ever works interchangeably to a 500 this Servlet is invoked using theThe App Engine instead in his or.
Menú Usuario
buy autodesk autocad design suite premium 2014 (32-bit) (en)
The completed on classes Discount - Microsoft Windows Server 2003 Enterprise R2 SP2 (64 bit) an certificates used to to the cloud where to plug suitable for developers number of goals. A simple approach to the applications processing service by handle poison then smoke the images. 2013 Premise During to communicate with the project, the simplicity, the fact to Buy OEM Autodesk Smoke 2013 MAC to the first also contain a wont work because polls the queue mac before it Azure equivalent of to a file it expires. | http://www.musicogomis.es/buy-oem-autodesk-smoke-2013-mac/ | CC-MAIN-2015-35 | refinedweb | 473 | 60.14 |
19 March 2012 06:03 [Source: ICIS news]
By Sunny Pan
SINGAPORE (ICIS)--China’s styrene butadiene rubber (SBR) prices may soon stop falling on the back of improving demand and amid a rebound in spot values of feedstock butadiene (BD), market sources said on Monday.
Domestic spot SBR prices in ?xml:namespace>
Prices were assessed at CNY23,700-24,200/tonne ($3,750-3,829/tonne) for non-oil grade SBR 1502, and at CNY20,300-20,500/tonne for oil-extended grade SBR 1712 on 16 March, according to Chemease, an ICIS service in
Hoping to stimulate buying interest, major domestic SBR supplier Sinopec had cut its SBR offer on 15 March by CNY800/tonne to CNY24,000/tonne for non-oil grade SBR 1502 and to CNY20,200/tonne for oil-extended grade SBR 1712, market sources said.
SBR demand should improve as tyre production - the major downstream for the material - is expected to increase towards April.
Among domestic producers in
Chinese tyre makers are currently running their facilities at an average run rate of 70-80%, up from around 70% in the month of February, industry sources said.
Rebounding BD prices would provide firm support to SBR prices, they said.
BD is quoted at around CNY26,000-26,500/tonne on Monday, up by CNY1,000/tonne from last week, with most market players expecting supply to tighten once downstream synthetic rubber plants ramp up production, market sources said.
Among those that raised production is Gaoqiao Petrochemical, which raised operating rates at its 120,000 tonne/year butadiene rubber (BR) plant to 100% on 9 March from 50% previously.
Spot domestic BD prices in
Most market players in
Liaoning Huajin Chemical and Bluestar (
With BD prices currently at CNY26,000/tonne, SBR must at least be priced at CNY25,300/tonne, industry sources said.
Styrene monomer (SM), another major raw material for SBR production, was assessed at CNY10,580-10,700/tonne ex-tank
($1 = CNY6 | http://www.icis.com/Articles/2012/03/19/9542585/China-SBR-to-halt-declines-on-better-demand-BD-rebound.html | CC-MAIN-2015-14 | refinedweb | 330 | 50.8 |
Red Hat Bugzilla – Full Text Bug Listing
Description of problem:
in rawhide, entertainer doesn't start
Traceback (most recent call last):
File "/usr/bin/entertainer", line 12, in <module>
main()
File "/usr/lib/python2.6/site-packages/entertainerlib/frontend/__init__.py", line 22, in main
from entertainerlib.frontend.frontend_client import FrontendClient
File "/usr/lib/python2.6/site-packages/entertainerlib/frontend/frontend_client.py", line 13, in <module>
from entertainerlib.frontend.gui.user_interface import UserInterface
File "/usr/lib/python2.6/site-packages/entertainerlib/frontend/gui/user_interface.py", line 20, in <module>
from entertainerlib.frontend.gui.screens.factory import ScreenFactory
File "/usr/lib/python2.6/site-packages/entertainerlib/frontend/gui/screens/factory.py", line 7, in <module>
from entertainerlib.frontend.gui.screens.artist import Artist
File "/usr/lib/python2.6/site-packages/entertainerlib/frontend/gui/screens/artist.py", line 9, in <module>
from entertainerlib.frontend.gui.screens.screen import Screen
File "/usr/lib/python2.6/site-packages/entertainerlib/frontend/gui/screens/screen.py", line 14, in <module>
from entertainerlib.frontend.gui.widgets.tab_group import TabGroup
File "/usr/lib/python2.6/site-packages/entertainerlib/frontend/gui/widgets/tab_group.py", line 10, in <module>
from entertainerlib.frontend.gui.widgets.label import Label
File "/usr/lib/python2.6/site-packages/entertainerlib/frontend/gui/widgets/label.py", line 11, in <module>
class Label(Base, clutter.Label):
AttributeError: 'module' object has no attribute 'Label'
$ rpm -q entertainer clutter pyclutter pyclutter-gtk
entertainer-0.4.2-6.fc12.noarch
clutter-1.0.6-1.fc12.i686
pyclutter-0.9.2-1.fc12.i686
pyclutter-gtk-0.9.2-1.fc12.i686
Thank you very much, I'm working on the update!
I issued an update, it should help.
Just to be clear, I filed a separate bug report on the missing dependency issue at #526033. This one is a unrelated traceback that doesnt get fixed by merely installing the missing dependency.
Oh sorry, mixed the URL's. I'm working on this one now.
Looks like clutter.Label was dropped in newer pyclutter versions and replaced with clutter.Text.
I will set up a VM with rawhide, try to rewrite the class to use clutter.Text and push the changes upstream.
I don't know whether Rawhide still knows about older package versions, but would it help to explicitly require pyclutter 0.8? If not the package is unusable until I got a patch working or upstream releases a new version that fixes this.
I don't think pulling in a older version of pyclutter (and deps) is desirable. It would be better to talk to upstream about this issue and send a patch if necessary.
Reported the bug upstream, will try to write a patch if I can. Unfortunately I'm not a very experienced coder.
This bug appears to have been reported against 'rawhide' during the Fedora 12 development cycle.
Changing version to '12'.
More information and reason for this action is here:
Upstream report at
Looks like the API break in label.py was only the tip of the iceberg., there were even more changes.
An upstream developer fixed the massive API changes. However he only does so in an unofficial branch ( ) that is not included in the main branch yet, and also requires the "future" series of the package, which is their development playground.
I tried to backport the changes to the stable version, but they are pretty extensive, I can't do it.
This app does not work in Fedora 12. Is updating to the "future" branch and using the unofficial patches (which hopefully will get merged into the main branch soon) a reasonable solution? (after extensive testing of course)
After first tests, the version from "future" rather feels like beta software, so I'd not really be happy with that.
If not, what can I do to get this excluded from the repos as long as upstream doesn't release a stable release that works with our pyclutter version?
"Future" branch update would be improvement over what we have now - just a straight crash. It isn't possible to exclude this package at this point.
I'll update the package to the future branch then.
entertainer-0.4.2-8.20091120bzr.fc12 has been submitted as an update for Fedora 12.
This doesn't fix the problem. It still crashes but with a different error
$
Traceback (most recent call last):
File "/usr/bin/entertainer", line 9, in <module>
main()
File "/usr/lib/python2.6/site-packages/entertainerlib/client/__init__.py", line 29, in main
config = Configuration()
File "/usr/lib/python2.6/site-packages/entertainerlib/configuration.py", line 54, in __init__
self.theme = Theme(self.theme_path)
File "/usr/lib/python2.6/site-packages/entertainerlib/configuration.py", line 127, in theme_path
theme = self.content.get("General", "theme")
File "/usr/lib/python2.6/ConfigParser.py", line 531, in get
raise NoSectionError(section)
ConfigParser.NoSectionError: No section: 'General'
entertainer-0.4.2-8.20091120bzr.fc12 has been pushed to the Fedora 12 testing repository. If problems still persist, please make note of it in this bug report.
If you want to test the update, you can install it with
su -c 'yum --enablerepo=updates-testing update entertainer'. You can provide feedback for this update here:
For some strange reason I can't reproduce that.
$...
And it starts all right, although it produces some warnings like:
(/usr/bin/entertainer:5856): Clutter-WARNING **: Attempting to map a child that does not meet the necessary invariants: the actor has no parent
This is what I have
rpm -q clutter pyclutter
clutter-1.0.6-1.fc12.i686
pyclutter-0.9.2-1.fc12.i686
I got a crash too!
...
Exception in thread IndexerThread (most likely raised during interpreter shutdown):Exception in thread IndexerThread (most likely raised during interpreter shutdown):
Traceback (most recent call last):
File "/usr/lib/python2.6/threading.py", line 525, in __bootstrap_innerTraceback (most recent call last):
File "/usr/lib/python2.6/site-packages/entertainerlib/backend/components/mediacache/indexer_thread.py", line 65, in run
File "/usr/lib/python2.6/site-packages/entertainerlib/backend/components/mediacache/video_cache.py", line 127, in addDirectory
File "/usr/lib/python2.6/os.py", line 284, in walk
File "/usr/lib/python2.6/genericpath.py", line 44, in isdir File "/usr/lib/python2.6/threading.py", line 525, in __bootstrap_inner
<type 'exceptions.AttributeError'>: 'NoneType' object has no attribute 'S_ISDIR'
entertainer-0.4.2-8.20091120bzr.fc12.noarch
pyclutter-0.9.2-1.fc12.i686
clutter-1.0.6-1.fc12.i686
I suppose I have to wait until upstream releases a fixed version? I can't do anything about it.
The least you can do is make them aware of it.
*** Bug 543264 has been marked as a duplicate of this bug. ***
Upstream fixed this in trunk now. I currently don't have the time to update the package, but I will get this ready in Rawhide before Alpha freeze if no further problems with the package appear.
*** Bug 563244 has been marked as a duplicate of this bug. ***
I have checked out the upstream code several times now, and it only got one update since my last comment. The program starts up now and shows the interface, but playing music for example completely fails for me, and it also doesn't overlap the Gnome panels. I was able to produce backtrace and will push that upstream. So what's the preferred solution now? There currently is a release version that doesn't work at all and a trunk version that doesn't provide any functionality except of a nice clutter main menu, and RSS headlines.
When starting the entertainer-backend before the program itself it's possible to rebuild the media library cache with the entertainer-manager, but then the media center itself doesn't work anymore (crashes with another error before displaying anything at all).
I personally would just like to get this package out of the release, as it obviosuly doesn't match any quality criterias one would have. Should I file a ticket at releng?
(In reply to comment #24)
> I personally would just like to get this package out of the release, as it
Clarification: F13 release
Sad but yes retire it and file it with rel-eng
I filed a ticket:
*** Bug 568994 has been marked as a duplicate of this bug. *** | https://bugzilla.redhat.com/show_bug.cgi?format=multiple&id=526035 | CC-MAIN-2017-39 | refinedweb | 1,384 | 50.53 |
I don't know how many archers work in and around novell, but today I created a quick (read dirty) pkgbuild for ncpfs [ ]
The arch kernel26 now comes with ncp support build as a kernel module... I was able to mount a volume on our netware server using my compiled ncpmount..
I soon encountered a problem in that the files on the netware volume were all showing as the old and very ugly 8.3 namespace (FILEON~1.DOC)... A little research led me to the following options in the kernel source package config...
CONFIG_NCP_FS=m
CONFIG_NCPFS_* all other NCPFS 'options' are NOT set...
I set the following NCPFS options, recompiled, rebooted and mounted the netware volume again... This time a much nicer namespace was used, and gone were the 8.3 conventions...
CONFIG_NCPFS_NFS_NS=y
CONFIG_NCPFS_OS2_NS=y
CONFIG_NCPFS_SMALLDOS=y
CONFIG_NCPFS_NLS=y
I would be happy to share and maintain the ncpfs package once I flush out the pkgbuild, but it is not overly usefull unless the kernel is compiled with these options enabled (remember the module is currently being built).
Should I file a bug report on this?
Thanks,
ns | https://bbs.archlinux.org/extern.php?action=feed&tid=11614&type=atom | CC-MAIN-2016-26 | refinedweb | 190 | 61.67 |
File & Directory
How to list files in directory with filtering
For working with files and directories, first add to your application java.io.* package:
import java.io.*;
When you need to go throught files in directory, you can use method File.list(). This method has a parameter of class type FilenameFilter that could perform files filtering.
/* -- go throught directory */ File f = new File( "c:\\" ); String files[] = f.list( /* -- filter to .txt extension only */ new FilenameFilter() { @Override public boolean accept(File dir, String name) { return ( name.toLowerCase().endsWith( ".txt" ) ); } } ); /* write results */ for ( String s : files ) { System.out.println( s ); }
The output is (for example):
test.txt tns.txt vallejo.txt
When you use null value parameter, you will get all files in the directory. | http://www.josefpirkl.com/javaexamplecenter/file_directory/others_filter.php | CC-MAIN-2018-17 | refinedweb | 123 | 60.21 |
iKitchenSink Struct Reference
Interface to interact with a kitchen sink. More...
#include <iutil/kitchensink.h>
Inheritance diagram for iKitchenSink:
Detailed Description
Interface to interact with a kitchen sink.
Definition at line 33 of file kitchensink.h.
Member Function Documentation
Drain the water from the sink.
- Warning:
- If small objects were inserted, they might get flushed away and (if a shredder is present and enabled) shredded.
Retrieve whether the shredder fitted to the drain was enabled.
Insert an object in the kitchen sink.
Remove an object from the kitchen sink.
- Returns:
- Whether the removal succeeded. Failure usually means that it wasn't in the sink in first place.
Enable or disable the shredder fitted to the drain.
- Remarks:
- May only work in American implementations.
The documentation for this struct was generated from the following file:
- iutil/kitchensink.h
Generated for Crystal Space 1.4.1 by doxygen 1.7.1 | http://www.crystalspace3d.org/docs/online/api-1.4.1/structiKitchenSink.html | CC-MAIN-2014-10 | refinedweb | 149 | 62.04 |
import "github.com/hsanjuan/go-libp2p-gorpc"
Package rpc is heavily inspired by Go standard net/rpc package. It aims to do the same thing, except it uses Libp2p for communication and provides context support for cancelling operations. 3 arguments. - the method's first argument is a context. - the method's second are third arguments are both exported (or builtin) types. - the method's second argument is a pointer. - the method has return type error.
In effect, the method must look schematically like
func (t *T) MethodName(ctx context.Context, argType T1, replyType *T2) error
where T1 and T2 can be marshaled by encoding/gob. may not be sent back to the client.
In order to use this package, a ready-to-go LibP2P Host must be provided to clients and servers, along with a protocol.ID. rpc will add a stream handler for the given protocol. Hosts must be ready to speak to clients, that is, peers must be part of the peerstore along with keys if secio communication is required.
Since version 2.0.0, contexts are supported and honored. On the server side, methods must take a context. A closure or reset of the libp2p stream will trigger a cancellation of the context received by the functions. On the client side, the user can optionally provide a context. Cancelling the client's context will cancel the operation both on the client and on the server side (by closing the associated stream).
call.go client.go errors.go server.go stream_wrap.go
func AuthorizeWithMap(p map[peer.ID]map[string]bool) func(pid peer.ID, svc string, method string) bool
AuthorizeWithMap returns an authrorization function that follows the strategy as described in the given map(maps "service.method" of a peer to boolean permission).
IsAuthorizationError returns whether an error is authorizationError.
IsClientError returns whether an error is clientError.
IsRPCError returns whether an error is either a serverError or clientError.
IsServerError returns whether an error is serverError.
type Call struct { Dest peer.ID SvcID ServiceID // The name of the service and method to call. Args interface{} // The argument to the function (*struct). Reply interface{} // The reply from the function (*struct). Done chan *Call // Strobes when call is complete. Error error // After completion, the error status. // contains filtered or unexported fields }
Call represents an active RPC. Calls are used to indicate completion of RPC requests and are returned within the provided channel in the Go() functions.
Client represents an RPC client which can perform calls to a remote (or local, see below) Server.
NewClient returns a new Client which uses the given LibP2P host and protocol ID, which must match the one used by the server. The Host must be correctly configured to be able to open streams to the server (addresses and keys in Peerstore etc.).
The client returned will not be able to run any local requests if the Server is sharing the same LibP2P host. See NewClientWithServer if this is a usecase.
NewClientWithServer takes an additional RPC Server and returns a Client which will perform any requests to itself by using the given Server.Call() directly. It is assumed that Client and Server share the same LibP2P host.
Call performs an RPC call to a registered Server service and blocks until completed. If dest is empty ("") or matches the Client's host ID, it will attempt to use the local configured Server when possible.
func (c *Client) CallContext( ctx context.Context, dest peer.ID, svcName, svcMethod string, args, reply interface{}, ) error
CallContext performs a Call() with a user provided context. This gives the user the possibility of cancelling the operation at any point.
func (c *Client) Go( dest peer.ID, svcName, svcMethod string, args, reply interface{}, done chan *Call, ) error
Go performs an RPC call asynchronously. The associated Call will be placed in the provided channel upon completion, holding any Reply or Errors.
The provided done channel must be nil, or have capacity for 1 element at least, or a panic will be triggered.
If dest is empty ("") or matches the Client's host ID, it will attempt to use the local configured Server when possible.
func (c *Client) GoContext( ctx context.Context, dest peer.ID, svcName, svcMethod string, args, reply interface{}, done chan *Call, ) error
GoContext performs a Go() call with the provided context, allowing the user to cancel the operation. See Go() documentation for more information.
The provided done channel must be nil, or have capacity for 1 element at least, or a panic will be triggered.
ID returns the peer.ID of the host associated with this client.
func (c *Client) MultiCall( ctxs []context.Context, dests []peer.ID, svcName, svcMethod string, args interface{}, replies []interface{}, ) []error
MultiCall performs a CallContext() to multiple destinations, using the same service name, method and arguments. It will not return until all calls have done so. The contexts, destinations and replies must match in length and will be used in order (ctxs[i] is used for dests[i] which obtains replies[i] and error[i]).
The calls will be triggered in parallel (with one goroutine for each).
func (c *Client) MultiGo( ctxs []context.Context, dests []peer.ID, svcName, svcMethod string, args interface{}, replies []interface{}, dones []chan *Call, ) error
MultiGo performs a GoContext() call to multiple destinations, using the same service name, method and arguments. MultiGo will return as right after performing all the calls. See the Go() documentation for more information.
The provided done channels must be nil, or have capacity for 1 element at least, or a panic will be triggered.
The contexts, destinations, replies and done channels must match in length and will be used in order (ctxs[i] is used for dests[i] which obtains replies[i] with dones[i] signalled upon completion).
ClientOption allows for functional setting of options on a Client.
func WithClientStatsHandler(h stats.Handler) ClientOption
WithClientStatsHandler provides an implementation of stats.Handler to be used by the Client.
Response is a header sent when responding to an RPC request which includes any error that may have happened.
Server is an LibP2P RPC server. It can register services which comply to the limitations outlined in the package description and it will call the relevant methods when receiving requests from a Client.
A server needs a LibP2P host and a protocol, which must match the one used by the client. The LibP2P host must be already correctly configured to be able to handle connections from clients.
NewServer creates a Server object with the given LibP2P host and protocol.
Call allows a server to process a Call directly and act like a client to itself. This is mostly useful because LibP2P does not allow to create streams between a server and a client which share the same host. See NewClientWithServer() for more info.
ID returns the peer.ID of the host associated with this server..
ServerOption allows for functional setting of options on a Server.
WithAuthorizeFunc adds authorization strategy(A function defining whether the given peer id is allowed to access given method of the given service) to the server using given authorization function.
func WithServerStatsHandler(h stats.Handler) ServerOption
WithServerStatsHandler providers a implementation of stats.Handler to be used by the Server.
ServiceID is a header sent when performing an RPC request which identifies the service and method being called.
Package rpc imports 18 packages (graph) and is imported by 5 packages. Updated 2019-03-18. Refresh now. Tools for package owners. | https://godoc.org/github.com/hsanjuan/go-libp2p-gorpc | CC-MAIN-2019-13 | refinedweb | 1,238 | 58.99 |
Xamarin.Essentials: Detect Shake
The Accelerometer class lets you monitor the device's accelerometer sensor, which indicates the acceleration of the device in three-dimensional space. Additionally, it enables you to register for events when the user shakes the device.
To start using this API, read the getting started guide for Xamarin.Essentials to ensure the library is properly installed and set up in your projects.
Using Detect Shake
Add a reference to Xamarin.Essentials in your class:
using Xamarin.Essentials;
To detect a shake of the device you must use the Accelerometer functionality by calling the
Start and
Stop methods to listen for changes to the acceleration and to detect a shake. Any time a shake is detected a
ShakeDetected event will fire. It is recommended to use
Game or faster for the
SensorSpeed. Here is sample usage:
public class DetectShakeTest { // Set speed delay for monitoring changes. SensorSpeed speed = SensorSpeed.Game; public DetectShakeTest() { // Register for reading changes, be sure to unsubscribe when finished Accelerometer.ShakeDetected += Accelerometer_ShakeDetected ; } void Accelerometer_ShakeDetected (object sender, EventArgs e) { // Process shake event } public void ToggleAccelerometer() { try { if (Accelerometer.IsMonitoring) Accelerometer.Stop(); else Accelerometer.Start(speed); } catch (FeatureNotSupportedException fnsEx) { // Feature not supported on device } catch (Exception ex) { // Other error has occurred. } } }
Sensor Speed
- Fastest – Get the sensor data as fast as possible (not guaranteed to return on UI thread).
- Game – Rate suitable for games (not guaranteed to return on UI thread).
- Default – Default rate suitable for screen orientation changes.
- UI – Rate suitable for general user interface.
If your event handler is not guaranteed to run on the UI thread, and if the event handler needs to access user-interface elements, use the
MainThread.BeginInvokeOnMainThread method to run that code on the UI thread.
Implementation Details
The detect shake API uses threashold.
API
Related Video
Find more Xamarin videos on Channel 9 and YouTube.
Feedback | https://docs.microsoft.com/en-us/xamarin/essentials/detect-shake?context=xamarin/android | CC-MAIN-2019-30 | refinedweb | 307 | 50.12 |
Convenience wrappers to using Blosc and reading and writing of Paged data. More...
#include <openvdb/io/io.h>
#include <tbb/spin_mutex.h>
#include <memory>
#include <string>
Go to the source code of this file.
Convenience wrappers to using Blosc and reading and writing of Paged data.
Blosc is most effective with large (> ~256KB) blocks of data. Writing the entire data block contiguously would provide the most optimal compression, however would limit the ability to use delayed-loading as the whole block would be required to be loaded from disk at once. To balance these two competing factors, Paging is used to write out blocks of data that are a reasonable size for Blosc. These Pages are loaded lazily, tracking the input stream pointers and creating Handles that reference portions of the buffer. When the Page buffer is accessed, the data will be read from the stream.
Definition in file StreamCompression.h. | https://www.sidefx.com/docs/hdk/_stream_compression_8h.html | CC-MAIN-2020-50 | refinedweb | 151 | 65.32 |
25 August 2004 12:56 [Source: ICIS news]
LONDON (CNI)--Chemical tanker fleet operator Jo Tankers has announced personnel and reorganisation changes in its sales and operations departments following the major restructuring initiative outlined in June, CNI learned on Wednesday.
The company’s trans-Atlantic services will be headed by Glenn Ronesen in Bergen, Norway. He will be supported by Anders Lindstoel in Bergen, Remco Hemminga in Rotterdam and Sammie Mooney and Nils Magelssen in the Houston office.
Africa services will be managed from Rotterdam by Frank de Haan, assisted by Ferry Eggens.
Paal Olavesen will head the Far East service from Bergen by the end of September following his relocation from Singapore where the Jo Tankers office will be closed. Olavsen will be supported by Jostein Markussen and Kandy Craig in Houston.
The Caribbean services will be managed by Heiko Grage in Houston, with the support of Finn Fredriksen and Charles Landry.
The bulk service is managed by Egil Giertsen in Bergen. He will be joined by Dag Bjaastad and Preben Krohnstad, who will join Jo Tankers in Bergen on 1 November and the last week of September respectively.
?xml:namespace>
Jo Tankers is setting up a new operations department in Bergen under the management of Harald Nesse. Four experienced ship operators have been recruited and will start on 1 October. They will handle trans-Atlantic operations and, in combination with Rotterdam, Far East/bulk operations. Further updates will be available by 1 October, the company said.
As reported by CNI in June, the restructuring involves the closure of Jo Tankers' offices in Singapore and Yokohama, as well as staff reductions in both Rotterdam and Houston.
The restructuring, which has involved a significant number of redundancies among Jo Tankers staff, coincides with a cutback in the company’s chemical tanker fleet and the transfer of commercial and operational management from Rotterdam to Ber | http://www.icis.com/Articles/2004/08/25/608457/jo-tankers-names-new-commercial-team-after-admin-shake-up.html | CC-MAIN-2013-48 | refinedweb | 314 | 50.77 |
Yeah, punch cards and paper tape baby! None of that high-tech magnetic media for me!
Edited 2008-05-05 21:14 UTC
Yeah, punch cards and paper tape baby! None of that high-tech magnetic media for me! "
Give him a break, he hasn't even been alive for 3 decades yet (IIRC)
No, the "really old days" were when we had to use toggle switches to enter the code to boot the computer. And, if my memory serves me correctly, computer tapes predate Pascal
Oh? You do know what GoboLinux is, right?
Care to elaborate? That's four pages of detailed explanations and user scenarios you just read, and all you can counter it with is "not such a good idea"?.?
"Applications in Mac OS X are generally not easy to remove at all, because they leave a trail of files around outside of /Applications that normal users rarely encounter. Over the course of time, this can amount to quite the mess."
The only files that are lying around are:
- plist for preferences (like .dot files in ~/ in Linux)
- cache files
- sometimes a folder in "Application Support"
That's all. You can easily search for the name of the program with Spotlight/Finder to remove those items, though it is NOT necessary because the only downside of those files lying on your disk would be waste MB... you have to run thousands of apps and deleting them to call it a mess.
"In addition, Mac OS X provides no way of updating applications in a central way, resulting in each application in OS X having its own updater application; hardly the user-friendly and consistent image Apple tries to adhere to."
If an application is started it will inform you about a new version, quite simple. Most of these dialogs are pretty consistent to each other too. And there are applications or even widgets that can check all your applicatins for updates, though it isnt really necessary, because.. when u run it it gets updated / will inform you. It would be nice to see Apple implementing this mechanism that those update-applications use into their own software-updater. But as said.. not really necessary.
The big problem with the Mac is that the apps arent consistent. Not all auto update themselves. Just like in Linux some software has to be compiled. Still, it would be nice if the world could agree on one single way to notify and put out updates. RSS maybe? In a corporate setting, repos work well since its pretty easy to make packages of something that needed to be compiled. But for single users adding a lot of repos leads to package poisoning., care to make it a podcast or something that I can put on and tune in and out while I'm coding? Mostly kidding, that's a lot of work... would be more efficient in the end if I just read it
Anyway, nice article, love the exclusives.
Edited 2008-05-05 22:38 UTC
...
Locking would still be necessary because while queries are fast, installing is not.
Let's say you use one query to install program P and start another query and uninstall library L (something P depends on) along with all older programs that need L.
There are two ways out of this:
a) Using a more fine grained locking along the lines of "install anything you like but make sure not to destroy L since P (currently being installed) will need it". What, however, if you said install P from vendor V and while it was installing told the computer to remove all programs of vendor V. I'm almost sure no matter how smart the algorithm is there'll still be situations where it has to say "Encountered Conflict C, do you want to do x or y?"
b) Making every program completely self contained.
This would have HUGE security implications.
A defect was found in a library that 100 of your applications use? Well, that's to bad, you have to reinstall them all.
You can of course draw the line at some arbitrary point and say this lib is used 'a lot', so it's shared.
In short, while your idea sounds good I believe it has tons of details, corner cases, and trade offs that still need to be sorted out.
Furthermore, it can only be realized embedded in a bigger ecosystem. To revisit the example with a defect in a lib, developers could tag their applications like "works with version x of this library" in a way that the program could automatically tell you "vulnerability found, switching to fixed version of lib L" or "vulnerability found, program not yet tested with safe version of L, do you want to upgrade and risk a crash or keep running this unsafe program".
In addition, your system is still centralized.
There needs to be someone or some server to say "No, malwareGuy, you cannot call this 'Paint 6', there's already 'Paint 5' and you didn't write it".
Somebody has to decide what goes on the server and what doesn't.
I could go on and on but I think you get the point:
The idea is good but the devil is in the details.
The server?
Who says people can't set up their own server for distributing program bundles? It wouldn't be too hard, as long as the file system on the server preserves the attributes.
I also envision a set of command line tools that allow you to compare/update program bundles. Something like:
$ compare "/Programs/Garden Designer.bundle" " Designer.bundle"
Output:
$ /Programs/Garden Designer.bundle:438
$ Designer.bundle:4?.
Nice try, Thom - if you're just reading it casually you almost miss the hand-waving about binaries that don't belong in any particular 'program bundle', and about the issue of shared libraries, which is of course the big drawback of the OS X system that you *don't* mention (because it persists in your vision). If you use shared libraries, you have a reliance on your vendor (situation with all current Linux distributions). If you don't, you have security issues and ancient bugs that were fixed long ago cropping up all over the place (situation with Windows and OS X).
GNU/Linux as no reliance on vendor for anything.
The linux kernel as many version and modification of itself. So do the library , so do the x systems , so do the windows environment , etc ...
SLS ... Debian ... Ubuntu ...
SLS ... Slackware ... SLAX
Red Hat ... Mandriva ... PcLinuxOS
Xfree , X.org
KDE , Gnome , Xfce
ETC ...
You got acces to source code , it's Open Source developed , and it's Free software.
You can fix it yourself , train someone to fix it or hire someone else to fix it for you.
Miss? It's right there in the article:
.
We should also have a /Users/Common directory for documents (and a /Settings/Common for settings) that all users on the system need access to. Of course the system needs to support user-controlled file permissions so User 1 can grant write privaleges to User 2 to a directory he owns but not allow User 3 to read it without being a System user and needing create a group.
What about file associations? I know this could be handled by the window manager but I'd like some central database of what applications are associated with what files, even on a user by user basis. On Computer 1 Firefox should be the default browser for all users but Computer 2 User 1 wants to use Firefox while User 2 likes Konqueror.
This new program management is the best idea I have ever heard for managing programs!...)
If each program has an "internal" version number, then perhaps the corresponding /Settings/User/X directory be the version number instead of the program name? So if Garden Designer is v846, then the file is /Settings/User1/846. This way, you'd really be able to run parallel versions of apps.
But there's another problem - there might be another program that is internally 846. We need a unique number. Wait, that already exists!; enter the GUID.
My point is, there are some really cool ideas in here, but ultimately, I think it needs a lot of refinement. Storing the settings in a separate space just means you've improperly used the home directory in the first place (see my above comment). Your permissions *will* be screwy when you put settings in one top level directory and user data in another. This is why there are hidden directories. Also, your arbitrary requirement of the settings directory sharing the name of the software package will need some sort of low-level monitor. It also means that when I release a new version of a package and choose to rename it with a version number, I can't reliably find your user settings from any of the last several versions of my software, I have to try every possible combo or not let you migrate your settings from any version but the last one.
Frankly, I think the current OS X way is near perfect, with plenty of room for small improvements. I don't think that, with disk space as it is, the system is "cluttered" by having lots of settings file - stored properly where settings should be stored! The idea is that it's persistent, it's there the next time you install the app. And I think Leopard's Spotlight is plenty fast enough for 99% of users. Live queries are very cool, but very few people would use them in a mainstream OS, and existing technologies provide most of the end result.:
I think most of us have thought about such ideas in the past. The devil really is in the details as someone said above.
I tend to like the idea of 'application bundles' but then how do you handle shared libraries. You will end up doing the weird windows DLL handling.
For example you could have a '.lib' file in each program directory that tells the loader which shared libraries to use for the application. The application bundle would include a version of the library that is 'known' to work.
shared libraries not belonging to a particular application can also be installed a generation /system/libs directory.
If a newer version of a '.lib' is available, then somehow the system must decide if it wants to try that version instead of the version in the application bundle. This 'somehow' is undefined. Perhaps the system detects a new version, asks you if you want to try the upgraded version... and goes back if it fails. Maybe we leave it to some online repo... This somehow could get complicated fast.
--------
in terms of updating the system. I don't really know why you're complicating it with all this search and queries... Wouldn't a simple file with the application bundle, pointing to some server location do. The system can check if there is an updated version and if so, prompt for you to download/install it..
but in the end it seems like it would basically be OSX + a centralized system, which isn't exactly revolutionary. The whole thing with BFS live queries could be handled exactly the same with the centralized system using a database, you're just moving the relation management from the db into the native filesystem.
...but my personal wish is for applications always to be fully self contained with any third party stuff they need contained within the program directory. Sure this would lead to bloat on disk size, but whats taking up more disk space on your hard drive? Those 10Gb of applications or the 100's Gb of MP3s/AVIs?
Im a big game player and i like games which have save games IN the game directory (eg: under \save or \save\profile - for multiple profiles). Saving under My Documents a la Microsofts recommedations gets me really annoyed.
And dont even get me started on saving game/configuration information in the registry. The registry is a bad idea from the start. Whats wrong with .CFG text files?
While i accept the need to consider multi-user systems and privledges im sure self-contained apps could somehow work with this.
Anyway, nice article, even if some ideas need refinement.....
It's called utopia for a reason ... It can never exist in reality , the H factor always screw up things.
H = Humans.
-----
I will pass on commenting on it , I wrote a 500 page in 10 minute about all it's flaws and unrealistic behaviors.
But then who am I to stop progress just upload it to a server so that we can download it and test it .. What's that it's just a theory ?
Also in Utopia there is no need to install , upgrade manually , uninstal software. Software are Free and gratis and you only pay for development or to buy a new computer and they come with 10 X 1 million terrabyte hard drive.
We don't even really have a need or use computers.
First sorry for the poor english (its not my native language). And I am not shure how this ascii written directory "diagram works" on osnews forum... this is my first post here althou I have been reading osnews for years
/boot (kernel and etc that are needed for boot)
/system/ (Basic system files for working base system)
sbin (binaries that are always needed)
etc
man
lib
/programs/ (For system and all users, programs here)
nodep/programsname-version (must hav no dep! and respect home/settings saving! Otherwice free to custom at will)
defsettings/ (default settings that are copied to users settings when first run by user)
programsname-version/
bin/ (programs binary)
lib/ (programs personal libaries ONLY (no general other use))
defsettings/ (default settings that are copied to users settings when first run by user)
other/ (pictures, sounds etc related to the program)
deps/
strict/ (must have with strick version)
lib/
libname-versision/libfile-version (LINK or FILE see note 1a)
other/
programsname-version/ (LINK or copy of the entire program see note 1b)
musthave/ (must have)
lib/
libname-versision/libfile-version (LINK or FILE see note 2a)
other/
programsname-version/ (LINK or copy of the entire program see note 2b)
optionaly/ (that good to have(more functions), but not mandatory)
lib/
libname-versision/libfile-version (LINK or FILE see note 3a)
other/
programsname-version/ (LINK or copy of the entire program see note 3b)
User and Group directories
/home/username/
programs/ (for the user only own instable programs)
programsname-version LINK#
settings
programsname-version LINK# (settigs for the program that its linked for)
documents/
movies
music
pictures/family (users selected share) LINK¤
etc...
shared (default share) LINK¤
/home/groups/groupname (where thee groups files are stored and installed. See below)
Virtual links from users home and group directories!
/shared/groups/ (shared groups that can be made by the system and run by the groups privigles and rules see note 4)
wingames/ (exsample of "wingames" group that is shared by some users)
programs/sharesave/programsname-version (programs that have/save bin/settings in one directory)
newgames/programs/programsname-version LINK% (program that is shared, but has settings in settings folder)
settings/programsname-version LINK%
/shared/users/user1/sharenamefamily LINK#
/share (default share) LINK*
Priority wich gets run selected first (adjustable)
1) Users own programs/libs
2) users groups programs/libs
3) System programs/libs
Packet manager takes care of all programs excluding /programs/nodep and /shared/grops/programs(basicly just links)
/home/user/programs (if not othervice setup)
(note 1a/2b)
(if the system has it, its linked! otherwice its copied here in the install prosess or if the system changes/deletes the its copied here automaticly)
(note 2a/2b)
(if the system has it, its linked! Otherwice its copied here in the install prosess or if the system changes(question is made: "Do a copy here or relink?"). If Deleted then its copied automaticly here.
(LINK or FILE see note 3a/3b)
((if the system has it it linked! otherwice its asked what to do) and if changed only version numbering LINK is updated and if deleted System asks shall it be copied here or not?(default is no).
The idea of having so many program folder is to have real choise how software can be installed and still keep the system in order.
So what do you thing of the idea?
Hey Thom,
in some ways, your proposal looks similar to Haiku's Installer RFC:
Did you have a look at that one? It's not really cleaned up, though.
Bye,
Waldemar Kornewald
Perhaps you should check out Plan 9 and OpenVMS for more related ideas. VMS has some advanced FS characteristics inc. versioning and the ability to treat a file as a series of records, so you can choose to refer to a particular field or not within the FS. This includes copying parts of files over LAN's, etc. Incidentally, you will notice MS has picked up quite a few ideas from VMS; search for both to read about their shared heritage, if you're interested. I suppose MS will support versioning soon, since it's been around for 20+ years!
Maybe they'll just leapfrog it with WinFS (or whatever they'll end up calling it).
Plan 9 gives each user their own virtualised FS: each user can mount (remote or local) resources as they see fit, creating their own personal FS namespace. This extends beyond files and folders to almost every network- or locally-accessible object. The Plan 9 site is down for me, but you can read a bit about it here:
In the medium-long term, I see more FS' dropping the hierarchical `root -> folder 1 -> ... -> folder n' construction (it is only a design choice, after all, not a divine mandate!) and moving to a database-driven FS complete with rich attributes etc.
(Oh, and what about ZeroInstall? That achieves most of what you want, on a system of today. )
Thoughts?
Edited 2008-05-06 12:53 UTC
Overall some interesting ideas.
I like self contained bundles. Shared libraries are a mess that has never really been sorted out properly. I don't think the security implications of having 15 copies of the same exploitable library in 15 different application bundles is all that big a deal.
I would like the program bundle specification and layout to be platform independent, and "fat" - for example a single bundle could contain Linux, OSX and Windows binaries. Yes, this will make for bigger bundles, but it will also make things simpler. Fundamentally people shouldn't have to know what operating system they are running. They should be able to download a program and have it "just work". Vendors would always have the option of creating single platform bundles if size is an issue.
I am not sure I get your file layout though. /Settings/UserX? How about /Users/UserX/Settings. And why the single global /Programs? Fundamentally any program should be installable by a single user without requiring any privilege escalation. We should have something like:
/Programs - Share programs
/Users - User home directories
---/User1
-----/Documents
-----/Programs - Programs installed only for this user
-----/Settings - Global and local program settings
/Settings - Global program default settings
For shared programs, /Settings would be populated at install time with a default settings file provided in the program bundle. When a user first runs the program the settings file for that bundle will be copied to their local /Users/UserX/Settings. This allows admins to provide global default settings. The bundle could also split it's settings across multiple settings files, and mark some settings files as read only, so that they are never copied as user settings and are not editable by an unprivileged user.
As for program updates, I like the global repository idea, but I'd also like things to be a bit distributed. How about the program bundle provide a URL that always resolves to the latest version of the program bundle? This could be a central repository URL, or a developer's website.
check out nixos it presents a purely functional software and configuration management system, very interesting and different
How about making a "configuration" the user interface object the user interacts with, rather than a "program"? So you add, run, and remove a particular configuration of a program, rather than the program itself.
e.g. I add a "configuration" of Firefox ("Firefox 3 + loads of plugins") to my desktop. It's like an AppDir, except it contains the settings, plus a link to the program.
If I want to add another one (e.g. "Firefox 2 with no plugins" for, say, on-line banking) then I add one of those too. I now have two icons / menu entries in my GUI, one for each configuration.
Deleting a configuration loses its settings, which therefore no longer need to be hidden.
Programs themselves can be installed and garbage collected automatically. No need to bother the user about that. Shared libraries, dependency hell, multiple versions, automatic updates, non-root install, etc are easily solved for most software (, as others have mentioned already). | http://www.osnews.com/comments/19711 | CC-MAIN-2014-15 | refinedweb | 3,552 | 62.17 |
On Jan 4, 6:08 pm, Sion Arrowsmith <si... at chiark.greenend.org.uk> wrote: > Hrvoje Niksic <hnik... at xemacs.org> wrote: > > >BTW if you're using C++, why not simply use std::set? > > Because ... how to be polite about this? No, I can't. std::set is > crap. The implementation is a sorted sequence -- if you're lucky, > this is a heap or a C array, and you've got O(log n) performance. > But the real killer is that requirement for a std::set<T> is that > T::operator< exists. Which means, for instance, that you can't > have a set of complex numbers.... > > -- Hallo and Sorry for being OT. As Arnaud pointed out, you must only overload the < Operator for the requested type. Something like bool operator < ( const Type& fir, const Type& sec ).... similar to python with __lt__ . The rest of magic will be done by the compiler/interpreter. Assoziative Arrays (set,map,multi_set,multi_map) in the classical STL are implemented as binary trees. Therefore the keys must be comparable and the access time is O(log n ). To get a dictionary with O(1), the most STL implementation support a extension called hash_set. The new standard TR1 support unsorted_set ... . You can download it from. Newer gcc runtimes also including the new subnamespace tr1. There is no need to implement set in c++ to get O(1). Greetings Rainer | https://mail.python.org/pipermail/python-list/2008-January/493138.html | CC-MAIN-2014-15 | refinedweb | 232 | 69.79 |
Path with given sum in binary search tree
In last post Paths in Binary Search Tree we discussed and solved problem to find all the paths in binary search tree. Next step is to find specific path with sum in binary search tree. Given a number K, find all paths with sum K in BST. For example if K = 21, and given below BST, path will be [10,5,6].
Keep in mind, that there can be more than one paths with given sum. Confirm with interviewer what does he expects in implementation.
Path with given sum : Thoughts
We already know how to traverse all paths in binary search tree. All we need now is to qualify those paths if all nodes in path sum up to given number K.
Let’s figure our recursive nature of problem. At the root level, we are required to find path with sum K. As soon as we add root in path, remaining nodes in path needs to add up to K – root.value, in either left or right subtree. For example, in below tree, at whole tree level, sum required is 21.
As we move down, that is root is added to path, sum required further is 11 from either left or right subtree. Problem is reduced to subproblem.
At this point, we cannot go forward with node(19), as sum required will reduced to negative. However, we can move down node(5) and problem is reduced to finding path with sum 6.
At this point, we have to find path with sum 6 in left and right subtree of node(5). On left subtree, add node(1) to path. Now problem reduces to finding path with sum 5 on right and left subtree of node(1). However, there are not subtrees of node(1). Hence, path [ 10,5,1 ] is not correct path.
On the other hand, after adding node(6) in path, sum required is 0 and also node(6) is a leaf node, hence path [10,5,6] is required path with given sum in binary search tree.
As we worked out example, we came up with some basic conditions for algorithm.
- If at any node in path, sum required becomes negative, do not go down the path.
- If sum required become zero, check if the last node added is leaf node. If yes, then add path to solution.
- If sum required is greater than zero, and node is leaf node, then that path is not with required sum.
Paths with given sum : Implementation
#include<stdio.h> #include<stdlib.h> struct node{ int value; struct node *left; struct node *right; }; typedef struct node Node; void printPath(Node * node, int sum, int path[], int pathLen){ if(!node) return; int subSum = sum - node->value; path[pathLen] = node->value; int isLeaf = !( node->left || node->right ); if(isLeaf && subSum == 0){ printf(" Path with given sum is: " ); for(int i=0; i<=pathLen; i++) printf("%d, ", path[i]); printf("\n"); } printPath(node->left, subSum, path, pathLen+1); printPath(node->right, subSum, path, pathLen+1); return ; }); root = addNode(root,37); root = addNode(root,45); int path[100]; printPath(root, 115, path, 0); return 0; }
Java implementation
package com.company.BST; import java.util.ArrayList; /** * Created by sangar on 10.5.18. */ public class BinarySearchTree { private Node root; public void BinarySearchTree(){ root = null; } public class Node { private int value; private Node left; private Node right; public Node(int value) { this.value = value; this.left = null; this.right = null; } } public void insert(int value){ this.root = insertNode(this.root, value); } private Node insertNode(Node root, int value){ if(root == null){ //if this node is root of tree root = new Node(value); } else{ if(root.value > value){ //If root is greater than value, node should be added to left subtree root.left = insertNode(root.left, value); } else{ //If root is less than value, node should be added to right subtree root.right = insertNode(root.right, value); } } return root; } private void pathWithGivenPath(Node root, int sum, ArrayList<Node> path){ if(root == null) return; if(sum < 0) return; int subSum = sum - root.value; path.add(root); boolean isLeaf = ( root.left == null && root.right == null ); if(isLeaf && subSum == 0){ path.forEach(node -> System.out.print(" " + node.value)); System.out.println(); } pathWithGivenPath(root.left, subSum, path); pathWithGivenPath(root.right, subSum, path); path.remove(path.size()-1); } public void printPathWithGivenPath(int sum){ ArrayList<Node> path = new ArrayList<>(); pathWithGivenPath(this.root, sum, path); } }
Test classWithGivenPath(20); } }
Complexity of algorithm to print all paths with given sum in binary search tree is O(n) as we will be scanning all nodes of BST at least once.
Please share if there is something wrong or missing. If you want to contribute and share your knowledge with thousands of learners across the world, please reach out to us at communications@algorithmsandme.com | https://algorithmsandme.com/path-with-sum-in-binary-search-tree/ | CC-MAIN-2019-18 | refinedweb | 805 | 74.49 |
MSG_DESCRIPTION_GETBITMAP
On 01/05/2017 at 15:05, xxxxxxxx wrote:
Hello!
Another question translate C++-Code to Python... ;)
I want to display a Bitmap in the Attribute Manager from a Tag-Plugin.
In C++ Message() was called with type==MSG_DESCRIPTION_GETBITMAP and the BITMAPBUTTON-id, but in Python it isn't? And what is the equivalent from GeData in GetDParameter() in Python?
Anyone have a Code-snippet how it works for me?
I would be glad,
Cheers,
Mark.
On 02/05/2017 at 09:44, xxxxxxxx wrote:
I guess it's like you do in C++ use BitmapButtonStruct.
(btw there are some errors in the python sdk, then take a look at the c++ one)
And just follow this thread
In python we don't have GeData since a variable is not type dependant.
So you can do
a = int() b = "hey" a = b #now a will be a string with value "hey"
Hope it's help
On 03/05/2017 at 02:08, xxxxxxxx wrote:
Hi Mark,
I'm afraid MSG_DESCRIPTION_GETBITMAP can't be handled inside NodeData.Message() currently.
With the Python API, the implementation of NodeData.GetDParameter() can return a c4d.BitmapButtonStruct object for the second item in the tuple. See NodeData.GetDParameter() documentation.
Unfortunately this is useless as a node can't respond to MSG_DESCRIPTION_GETBITMAP currently.
gr4ph0s: The errors in c4d.BitmapButtonStruct docs will be fixed.
On 03/05/2017 at 07:18, xxxxxxxx wrote:
Hello!
Thank you, Adam!
Sadly only now i read your answer, Yannick, after trying half a day ;)
My attempt was:
def Message(self, node, type, data) : if type==c4d.MSG_DESCRIPTION_GETBITMAP: if data['id'][0].id==c4d.ID_BITMAP: dir, file = os.path.split(__file__) path = os.path.join(dir, "res", "test.tif") bm = bitmaps.BaseBitmap() bm.InitWith(path) data['bmp'] = bm return True return False def GetDParameter(self, node, id, flags) : if id[0].id == c4d.ID_BITMAP: #BitmapButtonStruct bbs = BitmapButtonStruct(static_cast<PluginObject*>(node), id, dirty); #t_data = GeData(CUSTOMDATATYPE_BITMAPBUTTON, bbs); bbs = c4d.BitmapButtonStruct(node, id, 0) return (True, bbs, flags | c4d.DESCFLAGS_DESC_LOADED) return False def SetDParameter(self, node, id, t_data, flags) : if id[0].id == c4d.ID_BITMAP: flags = flags | c4d.DESCFLAGS_DESC_LOADED return True
But data in Message was always None...
Nevertheless thank you for your help :)
Cheers,
Mark.
On 03/05/2017 at 07:33, xxxxxxxx wrote:
Note we'll add support for MSG_DESCRIPTION_GETBITMAP inside NodeData::Message() in a future release of Cinema 4D. | https://plugincafe.maxon.net/topic/10097/13574_msgdescriptiongetbitmap | CC-MAIN-2020-40 | refinedweb | 399 | 61.02 |
RPC_CLNT_CALLS(3N) RPC_CLNT_CALLS(3N)
NAME
callrpc, clnt_broadcast, clnt_call, clnt_freeres, clnt_geterr,
clnt_perrno, clnt_perror, clnt_sperrno, clnt_sperror - library routines
for client side calls.
The clnt_call(), callrpc() and clnt_broadcast() routines handle the
client side of the procedure call. The remaining routines deal with
error handling in the case of errors.
Routines
The CLIENT data structure is defined in the RPC/XDR Library Definition
of the
#include <<rpc/rpc.h>>
int callrpc(host, prognum, versnum, procnum, inproc, in, outproc, out)
char *host;
u_long prognum, versnum, procnum;
char *in;
xdrproc_t inproc;
char *out;
xdrproc_t outproc;
Call the remote procedure associated with prognum, versnum, and
procnum on the machine, host. The parameter in is the address
of the procedure's argument, and out is the address of where to
place the result; inproc is an XDR function used to encode the
procedure's parameters, and outproc is an XDR function used to
decode the procedure's results. This routine returns 0 if it
succeeds, or the value of enum clnt_stat cast to an integer if
it fails. Use clnt_perrno() to translate failure statuses into
messages.
Warning: Calling remote procedures with this routine uses UDP/IP
as the transport; see clntudp_create() on rpc_clnt_create(3N)
for restrictions. You do not have control of timeouts or
authentication using this routine.
enum clnt_stat clnt_broadcast(prognum, versnum, procnum, inproc, in, outproc, out, eachresult)
u_long prognum, versnum, procnum;
char *in;
xdrproc_t inproc;
char *out;
xdrproc_t outproc;
bool_t eachresult;
Like callrpc(), except the call message is broadcast to all
locally connected broadcast nets. Each time the caller receives
a response, this routine calls eachresult(), whose form is:
int eachresult(out, addr)
char *out;
struct sockaddr_in *addr;
where out is the same as out passed to clnt_broadcast(), except
that the remote procedure's output is decoded there; addr points
to the address of the machine that sent the results. If eachre-
sult() returns 0 clnt_broadcast() waits for more replies; other-
wise it returns with appropriate status. If eachresult() is
NULL, clnt_broadcast() returns without waiting for any replies.
Note: clnt_broadcast() uses AUTH_UNIX style of authentication.
Warning: Broadcast packets are limited in size to the maximum
transfer unit of the data link. For Ethernet, the callers argu-
ment size should not exceed 1400 bytes.
enum clnt_stat clnt_call(clnt, procnum, inproc, in, outproc, out, timeout)
CLIENT *clnt;
u_long procnum;
xdrproc_t inproc, outproc;
char *in, *out;
struct timeval timeout;
Call the remote procedure procnum associated with the client
handle, clnt, which is obtained with an RPC client creation rou-
tine such as clnt_create() (see rpc_clnt_create(3N). The param-
eter in is the address of the procedure's argument, and out is
the address of where to place the result; inproc is an XDR func-
tion used to encode the procedure's parameters in XDR, and out-
proc is used to decode the procedure's results; timeout is the
time allowed for a response from the server.
bool_t clnt_freeres(clnt, outproc, out)
CLIENT *clnt;
xdrproc_t outproc;
char *out;
Free any data allocated by the RPC/XDR system when it decoded
the results of an RPC call. The parameter out is the address of
the results, and outproc is the XDR routine describing the
results. This routine returns TRUE if the results were success-
fully freed, and FALSE otherwise. Note: This is equivalent to
doing xdr_free(outproc, out) (see xdr_simple(3N)).
void clnt_geterr(clnt, errp)
CLIENT *clnt;
struct rpc_err *errp;
Copy the error structure out of the client handle to the struc-
ture at address errp. errp should point to preallocated space.
void clnt_perrno(stat)
enum clnt_stat stat;
Print a message to the standard error corresponding to the con-
dition indicated by stat. A NEWLINE is appended at the end of
the message. Used after callrpc() or clnt_broadcast().
void clnt_perror(clnt, str)
CLIENT *clnt;
char *str;
Print a message to the standard error indicating why an RPC call
failed; clnt is the handle used to do the call. The message is
prepended with string s and a colon. A NEWLINE is appended at
the end of the message. Used after clnt_call().
char *clnt_sperrno(stat)
enum clnt_stat stat;
Take the same arguments as clnt_perrno(), but instead of sending
a message to the standard error indicating why an RPC failed,
return a pointer to a string which contains the message.
clnt_sperrno() does not append a NEWLINE at the end of the mes-
sage.
clnt_sperrno() is used instead of clnt_perrno() if the program
does not have a standard error (as a program running as a server
quite likely does not), or if the programmer does not want the
message to be output with printf(3V), or if a message format
different than that supported by clnt_perrno() is to be used.
char *clnt_sperror(clnt, str)
CLIENT *clnt;
char *str;
Like clnt_perror(), except that (like clnt_sperrno()) it returns
a string instead of printing to the standard error. Unlike
clnt_perror(), it does not append the message with a NEWLINE.
Note: clnt_sperror() returns pointer to a static buffer that is
overwritten on each call.
SEE ALSO
printf(3V), rpc(3N), rpc_clnt_auth(3N), rpc_clnt_create(3N), xdr_sim-
ple(3N)
20 January 1990 RPC_CLNT_CALLS(3N) | http://modman.unixdev.net/?sektion=3&page=clnt_sperror&manpath=SunOS-4.1.3 | CC-MAIN-2017-30 | refinedweb | 844 | 58.92 |
CalicoScheme.
Contents
- 1 Background
- 2 Extensions
- 3 Bugs
- 4 Features
- 5 Getting Started
- 6 Adding Primitives
- 7 Trouble Shooting
- 8 Future Work
Background:
- get a basic scheme working in .NET/Mono [done]
- use the Dynamic Language Runtime (DLR) for environments (more on that below)
- integrate it with the rest of the DLR
Pyjama Scheme is not a regular scheme and is not meant to be compatible with others. It is designed for education and research.
Extensions
- Exceptions - implements try/catch/finally
- Modules and namespaces - implements namespaces for imports and foreign objects
- DLLs - import libraries written for the CLR
- Interop - ways for Scheme to interop with other Pyjama languages
Modules
Modules provide an easy method for structuring hierarchies of libraries and code.
Import
(import <string-exp>) (import <string-exp> '<symbol-exp>)
Examples
==> (import "my-file.ss")
my-file.ss is a Scheme program file, which itself could have imports.
==> (import "my-file.ss" 'my-stuff)
Loads the file, and puts it in the namespace "my-stuff" accessible through the lookup interface below.
Lookup
module.name module.module.name
==> (import "my-file.ss" 'my-stuff) ==> my-stuff.x 5
Directory Listing
==> (dir) (- * / + < = > and append apply caaaar caaadr caaar caadar caaddr caadr caar cadaar cadadr cadar caddar cadddr caddr cadr call/cc call-with-current-continuation car case cdaaar cdaadr cdaar cdadar cdaddr cdadr cdar cddaar cddadr cddar cdddar cddddr cdddr cddr cdr cond cons current-time debug dir display env eq? equal? eval exit float for-each format get group help import int iter? length let let* letrec list list? list->vector list-head list-tail load map member memq newline not null? or pair? parse print printf procedure? property range record-case reverse set-car! set-cdr! sort sqrt string? string<? string->list string->symbol symbol symbol->string typeof using vector vector? vector->list vector-ref vector-set! vector-set!) ==> (dir my-stuff) (x y z)
DLLs
Use a DLL.
scheme> (using "DLLName") scheme> (DLLName.Class arg1 arg2)
Interop
Use the define! to put a variable in the global Pyjama namespace.
scheme> (define! x 8) python> x 8
Wrap a function for use by other Pyjama")) (vector 1 2 3)) 1 2 3
Help/Doc System
When you define a variable, you can optionally add a doc-string:
==> (define x "This variable holds the sum" 0) ==> (define y 0) ==> (define function "This computes the polynomial..." (lambda (x) ...))
You can lookup the doc-string with:
==> (help 'x) This variable holds the sum
Command-line
You can run scheme code on the command line:
pyjama --exec examples.ss file2.ss
Misc
get will lookup a symbol in the environment:
==> (get 'get) #<procedure>
typeof will give you the .NET type of a value:
==> (typeof 1) System.Int32
==> (typeof 238762372632732736) Microsoft.Scripting.Math.BigInteger
==> (typeof 1/5) Rational
Bugs
- Defining a vector returns an uncaught exception and if we call the defined functions name, it returns the first element of vector. FIXED
- Bug in (map - '(1 2 3)). Error was in Subtract with one arg. FIXED
- (/ 5 1) should give an integer, but gives rational with 1 in denominator. FIXED
- (/ 5) should give 1/5 but gives an error. FIXED
- Append doesn't work for empty lists, and no error checking. FIXED
- Not sure whether is a bug: if (display '(don't try this at home)) returns (uncaught exception: "unexpected character ' encountered") (petite: (don (quote t) try this at home)) Error in reader-cps.ss FIXED
- Environment.cs -- is this file necessary? Why is it written in Scheme but labeled .cs? FIXED
- Bug in mapping printf in C#; example: (map printf '("hello")). FIXED
- No Error for incorrect number of arguments.
- PJScheme parser doesn't allow #3(1 2 3) only #(1 2 3)
- C# PJScheme doesn't work with #(1 2 3)
Features
- Semantics of dotted-names are complex:
- First we look up the name ("math.x.y.z") if value found, return it
- Next, we lookup "math", then "math.x", "math.x.y", and "math.x.y.z"
- If none of those are modules, then it is an error
- This makes it impossible to mix dotted names with modules. OK
- Changed the dir command to include macros (special forms from define-syntax). So, it now lists "and", "or", "let" etc. Idea by Julia Kelly.
Getting Started
To make changes, you need only edit the Scheme programs ending in -cps.ss. Running make will rebuild the system.
Under the Hood
Pyjama Scheme is written in Scheme in these files:
- environments-cps.ss - environment
- interpreter-cps.ss - interpreter
- parser-cps.ss - parser
- reader-cps.ss - scanner/lexer
- unifier-cps.ss - pattern matching (for define-datatype)
These are written in Continuation-Passing Style (CPS).
These files are transformed into C# through a series of stages:
- grouped into a single file, pjscheme-cps.ss
- converted from continuation-passing style TO data structures, pjscheme-ds.ss
- converted from data structures TO register machine, pjscheme-rm.ss
- register machine TO C# code, pjscheme.cs
So pjscheme-cps.ss is converted to pjscheme-ds.ss, then pjscheme-ds.ss is converted to pjscheme-rm.ss, and finally pjscheme-rm.ss is converted to pjscheme.cs.
Support for low-level Scheme functions are defined in Scheme.cs.
Testing Scheme in Scheme
As we are writing Scheme in Scheme, you might want to first test your changes by running the Scheme directly in Petite. To do that:
$ petite interpreter-cps.ss > (start) ===>
That is, run petite interpreter-cps.ss at the shell prompt, and then (start) at the petite prompt. You'll get the PJ prompt, with PJ running in Petite.
pjscheme.cs
Scheme commands, such as string->list, are primitives, so there isn't any Scheme code that implements it... it is at a lower level. Petite Scheme is probably written in C, so string->list is written in C. So, that means we have to write functions like this manually in C#.
You'll find all of the Pyjama Scheme primitives written so far in Scheme.cs. But, C# can't have hyphens and greater-thans in symbol names. So, there are some common character combinations that are automatically replaced when going from Scheme to C#:
- -> becomes _to_
- - becomes _
- ? becomes _q
- ! becomes _b
So, string->list is a primitive defined in Scheme.cs as string_to_list.
In the Scheme code, k (or k2) represents a continuation, and handler is an error handler (for taking care of exceptions and errors).
There is a very basic trace mechanism in pjscheme.cs. You can set the level of detail with:
==> (debug N)
where N is a number between 0 and 10, inclusive. You can also see the debug level with:
==> (debug) 0
Zero means off (no tracing) and 10 is maximum tracing. The indent level shows the level of trace, which is approximately the low-levelness of the code. We should come up with a better means than this!
Advanced Issues
If you are writing code in CPS fashion, then you should use "define*" to define the function. Otherwise, it is just a regular function, and just use "define".
If you are using a lambda for something other than a function definition, use:
- lambda-cont: indicates it is a continuation that receives a single value
- lambda-cont2: indicates it is a continuation that receives 2 values
- lambda-macro: indicates that this is a macro
- lambda-handler: indicates that this is an error handler
If you are writing code that maps a new function (one that you have defined in Scheme) you need to add create what is called a "delegate". This is a bit of a hassle for now. If you had a new function named, say, fixstring, and you were mapping that to a list, you need to add:
public static Proc fixstring_proc = new Proc(\"fixstring\", (Procedure1) fixstring, 1, 1);
to the string variable named *code* in the file scheme-to-csharp.ss. The first name should be the name of the function with "_proc" appended. Thus: "fixstring_proc".
NOTE: This is only required for support code (e.g., code that implements the language). It is not necessary for functions in Pyjama Scheme.
Example Extensions
The following examples show you what is necessary to make changes to Pyjama Scheme. After any changes, you should be able to:
make pjscheme
and it should rebuild. If something doesn't seem to rebuild correctly, you can issue a make clean followed by make pjscheme.
To make sure you have the latest, up to date code, do this in the Scheme directory:
svn update make clean
You may want to do that each session before beginning work.
To make a "patch" to submit, do this:
svn diff > descriptive-name.patch
The "diff" will put all of the differences between the current version and yours (ie, your changes). Someone can then apply your changes to the server's code.
To apply a patch to your own code:
patch -p0 < descriptive-name.patch
That will make all of the changes in the patch file to your copy of files in the directory.
Example Extension: Vector
Example extension #1: Adding a new function to Pyjama Scheme
The first example is adding a new function to the Pyjama Scheme environment in interpreter-cps.ss.
- Add the keyword to the keywords
- Add the function code to list of functions
For this example, let's add a new function vector that takes a number of arguments and puts them into a vector (eg, an array). It will work like:
==> (vector 'a 'b 'c) (vector a b c)
This is not a special form (doesn't have special syntax) but is just a new function that does something to a list of evaluated arguments. The first step is to add the keyword vector to the list of words in the environment. This is done in the interpreter-cps.ss file, near line 255:
(make-initial-environment (list 'exit 'eval 'parse 'apply 'sqrt 'print 'display 'newline 'load 'null? 'cons 'car 'cdr 'list '+ '- '* '/ '< '> '= 'equal? 'eq? 'memq 'range 'set-car! 'set-cdr! 'import 'get 'call-with-current-continuation 'call/cc 'reverse 'append 'list->vector 'dir 'current-time 'map 'for-each 'env 'using 'not 'printf 'vector)
Next, we add the function to the list of functions. Again, in interpreter-cps.ss near line 331:
... ;; printf (lambda-proc (args env2 handler k2) (begin (apply printf-prim args) (k2 '<void>))) ;; vector (lambda-proc (args env2 handler k2) (k2 (apply make-vector args))) ...
NOTE: the order of words added in step 1 must match the order of functions here!
In this example, we need merely call make-vector on the arguments and pass it to the continuation (k2).
If you are defining functions that are used by the system, then you need one last step. You will need to add those to scheme-to-csharp.cs in the *code* list, like:
public static Proc make_vector_proc = new Proc(\"list->vector\", (Procedure1) make_vector, 1, 1);
If you didn't define these explicitly (perhaps they are low-level scheme functions) then you need to implement them. You can write them in C# in Scheme.cs, or write them in Scheme in interpreter-cps.ss and let them get translated. If they are low-level Scheme functions, such as car, you'll need to write them in C#.
Above, the Proc() constructor takes three parameters: the name of the function (this isn't used, except to give feedback to the user in times of error or tracing), the name of the C# function to call, the type of arguments it takes, and the type of return value.
Arguments it takes:
- -1, means variable length list (one arg, interpreted as a list)
- 1, means exactly one (interpreted as an object)
- 2, means exactly two (interpreted as objects)
- 3, means exactly three (interpreted as objects)
What it returns:
- 0, means return void (nothing returned)
- 1, means return object
- 2, means return boolean
Finally, the cast must match the incoming parameter count and type:
- Procedure0, takes no arguments, returns object
- Procedure0Bool, takes no arguments, returns boolean
- Procedure1, if it takes one argument (variable or not), returns Object
- Procedure1Bool, takes one argument, returns boolean
- etc. up to 3
Adding Primitives
There are a large number of missing Scheme primitives (such as round inexact? modulo integer? char->integer make-string vector-length string-set! output-port? current-output-port current-input-port read-char eof-object?). This section describes what is necessary to add them.
1. Working in Calico/languages/Scheme/Scheme
cd Calico/languages/Scheme/Scheme
2. Edit interpreter-cps.ss
This is where Calico Scheme is defined. CPS stands for "continuation-passing style". You can read more about that in "Essentials of Programming Languages" and other places.
3. Define function-prim, where "function" is replaced with the function you are defining:
The basic form is:
(define function-prim (lambda-proc (args env2 info handler fail k2) (k2 ... fail)))
Where k2 is given the result of the function (and the fail).
We also would like to add some checks to help the user use the function:
(define function-prim (lambda-proc (args env2 info handler fail k2) (cond ((not (length-one? args)) (runtime-error "incorrect number of arguments to string-length" info handler fail)) ((not (string? (car args))) (runtime-error "string-length called on non-string argument" info handler fail)) (else (k2 ... fail)))))
Possible functions used in testing: string? number? length-one? length-two?
Any code that you call should not be written in a recursive manner, as we want to eliminate the possibility of using up the stack space in C#.
4. Replace the ... with primitive operations that exist in both C# and Scheme, or with a call to a Scheme function that doesn't exist in C#. You will need to write it in C# and defined in Scheme.cs.
5. Add the symbol for the function and the function-prim in make-toplevel-env
6. Run "make"
This can take some time.
You will need to have petite Chez Scheme installed (and may need to have a link to a library added). Example install:
$ wget $ tar xfz pcsv8.4-i3le.tar.gz $ cd csv8.4/custom $ ./configure $ make $ sudo make install
May also need:
$ sudo apt-get install indent $ sudo apt-get install libncurses5-dev $ ln -s /lib/x86_64-linux-gnu/libncurses.so.5.9 libtinfo.so.5 or $ sudo ln -s /lib/libncurses.so.5.7 libtinfo.so.5
7. Test (preferably in code that can be re-run later for regression testing)
You should test in petite Scheme and with Calico.
$ petite interpreter-cps.ss Petite Chez Scheme Version 8.4 Copyright (c) 1985-2011 Cadence Research Systems Loaded EOPL init file > (start) ==> "(round 4)" 4 ==> "(exit)" (exiting the interpreter) goodbye >
$ ../../../StartCalico ...
Example of Adding Primitives
Consider adding char->integer and integer->char to Calico Scheme.
First, to interpreter-cps.ss, add the primitive function wrappers. These end with "-prim" and typically just apply the actual primitive to the list containing the single arguments. They test to make sure the arguments are correct (maybe right type or count).
Add to interpreter-cps.ss:
;; char->integer (define char->integer-prim (lambda-proc (args env2 info handler fail k2) (cond ((not (length-one? args)) (runtime-error "incorrect number of arguments to char->integer" info handler fail)) (else (k2 (apply char->integer args) fail))))) ;; integer->char (define integer->char-prim (lambda-proc (args env2 info handler fail k2) (cond ((not (length-one? args)) (runtime-error "incorrect number of arguments to integer->char" info handler fail)) (else (k2 (apply integer->char args) fail)))))
Then, we need to add the -prim functions to the toplevel environment:
(define make-toplevel-env (lambda () (let ((primitives (list ... (list 'char->integer char->integer-prim) (list 'integer->char integer->char-prim) ...
which is a list containing the name we want to call it in Calico Scheme, and the actual primitive function name.
In the C# code, we only need to define the functions. We note that Scheme function names must be changed slightly to be valid C# names. So, we turn "-" to "_", "->" to "_to_", "?" to "_q", "!", "_b", etc. See scheme-to-csharp.ss for additional conversions.
Add to Scheme.cs:
public static object char_to_integer(object thing) { if (thing is char) { return Convert.ToInt32(thing); } else { throw new Exception(String.Format("char->integer: invalid character: '{0}'", thing)); } } public static object integer_to_char(object thing) { if (thing is int) { return Convert.ToChar(thing); } else { throw new Exception(String.Format("integer->char: invalid integer: '{0}'", thing)); } }
That is it, except for one complication. Because we applied the functions in our implementation (rather than just calling them), then we need to define a Proc construct that allows C# functions to be used as higher-order functions.
So, we need to add to Scheme.cs:
public static Proc char_to_integer_proc = new Proc("char->integer", (Procedure1) char_to_integer, 1, 1); public static Proc integer_to_char_proc = new Proc("integer->char", (Procedure1) integer_to_char, 1, 1);
The following casts are available:
- Procedure0 - function is receiving zero arguments, returns an object
- Procedure1 - function is receiving one argument, returns an object
- Procedure2 - functions is receiving two arguments, returns an object
- ProcedureN - funtion receives a variable number of arguments, returns an object
- Procedure0Bool - function is receiving zero arguments, returns a bool
- Procedure1Bool - function is receiving one argument, returns a bool
- Procedure2Bool - functions is receiving two arguments, returns a bool
- Procedure0Void - function is receiving zero arguments, no return
- Procedure1Void - function is receiving one argument, no return
- Procedure2Void - functions is receiving two arguments, no return
This information is also duplicated in the arguments to Proc(). The 3rd parameter is the parameter count (-1 = all, 1 = 1, 2 = 2, etc), and the 4th parameter is the return type (0 = void, 1 = object, 2 = bool).
See source code for more examples.
Trouble Shooting
I have added a function in the -cps Scheme code, but when I try to "make pjscheme" I get the error that "not all code paths return a value". What am I doing wrong?
This can happen when you add a function such as:
(define help (lambda (args env handler k) (lookup-value args env handler k)))
to interpreter-cps.ss. This produces the following C# code:
new public static object help (object args, object env, object handler, object k2) { k_reg = k; handler_reg = handler; env_reg = env; variable_reg = args; pc = (Function) lookup_value; }
If you look closely at the C# function, it doesn't return anything. In fact, the code is just sets some values, as that is what the transformations do: they unroll the recursions and function calls so there is no stack, and no return values. All that help does is call lookup_value. The pc (program counter) will call that function, which gets its arguments from the registers set in here in help.
However, the "public static object help" says that you will return an "object". This is a guess that the transformation makes, but it is wrong. To fix this, you need to manually tell the Scheme-to-CSharp system that the function help does not return anything. You can do that by adding an entry in the list *system-function-signatures* in the file scheme-to-csharp.ss. Like so:
... (help "void" ()) ...
This says: "use void as the return type for the function help." Void means that this doesn't return anything. This signature doesn't specify the types of the four arguments to pass in to help (which would be given in the list after "void") because they are all "object", which is the default.
Future Work
Ideas for projects:
- Make Pyjama Scheme behave more like Python:
- add iterators and support
- Try Pyjama Scheme command (range 10)
- add ways to make other items iterators
- Try Pyjama Scheme command (for-each function list) ie, (for-each display '(1 2 3)).
- Hook into the Dynamic Language Runtime (DLR)
- use the DLR environments
- use it to load DLLs
- see the support for modules in Pyjama Scheme (above)
- Add better debugging support
- scheme code should know file, line, col of where they are defined
- scheme functions should know their name (if they have one)
- Add a help system
- Add a step function
- Add some Scheme primitives
- what's missing?
References
Pyjama
- PyjamaDevelopment - plans and details for Pyjama development
Dynamic Language Runtime - DLR
- - DLR Hosting Specification
- - Overview of ToyScript
- - Aspects of the DLR (read from bottom to top)
Abstract Syntax Tree - AST
-
-
-
- | http://wiki.roboteducation.org/CalicoScheme | CC-MAIN-2019-26 | refinedweb | 3,379 | 64.1 |
Parts of long pages stay on low-res tiles forever
VERIFIED FIXED
Status
()
People
(Reporter: samth, Assigned: cwiiis)
Tracking
Firefox Tracking Flags
(firefox14 fixed, firefox15 fixed, blocking-fennec1.0 beta+)
Details
(Whiteboard: [mozilla-central])
Attachments
(1 attachment, 1 obsolete attachment)
Sometimes, if I scroll down on a large page while it's loading, I eventually reach low-resolution tiles, and they never get converted to high-res tiles, unless I reload the page. This happened before the switch to low-resolution tiles -- previously it was just displayed as all-black. Unfortunately, I can't make this happen reliably, but it most often happens when all three of the following are the case: 1. I'm on a slow network (ie, 3G). 2. I scroll down quickly on a very long page. 3. I double-tap to zoom before the page finishes loading.
blocking-fennec1.0: --- → ?
Status: UNCONFIRMED → NEW
Ever confirmed: true
I saw this happening the other day, but also have no solid way of reproducing... It seems to happen more often after restoring fennec from the background, but that may just be coincidence.
Keywords: qawanted
I've seen this too. Happens a lot on forum pages. Didn't get around to filing yet. Happened to me on a Transformer tablet on wifi, so it doesn't seem to be much to do with speed.
Browsing around seems to cause this to happen.
Keywords: qawanted
Chris can you look into this?
Assignee: nobody → chrislord.net
blocking-fennec1.0: ? → +
Attempted to repro, but couldn't. Dammit, Fennec, you're too fast!
blocking-fennec1.0: + → ?
blocking-fennec1.0: ? → beta+
I'm having a hard(/impossible) time reproducing this. If anyone has reliable, or even semi-reliable STR, please list them.
I've described a similar behavior in the Bug 751838 which was duplicated after this one. Maybe the STR posted there will help.
I was able to reproduce this on gmail (basic HTML site, not the mobile one) after pinch zooming. I just retested today using a nightly and I can't reproduce it anymore.
You wont see this on Nightly because low res is busted: bug 752910.
(In reply to Aaron Train [:aaronmt] from comment #10) > You wont see this on Nightly because low res is busted: bug 752910. OK. I tested in Aurora, using 2012-05-07 and I see this issue on GMail. Use the desktop site. I can't pan around. Pinch zoom in a decent amount. Now I can pan around and when I do the page can go low-res and not go high-res.
Ok, after poking at the lifecycle code for bug 752910, I've found solid STR for any page page. 1- Load a page. 2- Press the awesome-bar to bring up the awesome-screen 3- Press the home button 4- Load the browser again You will now be in a state where the compositor will not redraw anything - you'll still see the old rendered content, retained tiles and the low-res cache, but no tiles will get updated. This seems to be due to the stop/start events in GeckoApp, and what happens when isApplicationInBackground is true. Due to what I assume is a work-around, isApplicationInBackground only ever returns false when an activity has been launched (such as the awesome-screen). I'll take a look at this tomorrow.
Take a glance at bug 752368 and maybe try the patch there -- it could be related, though the symptoms are different (I get just a black content area when the content/compositor gets wedged, not old content). But it could be related.
Yeah, different than bug 752368; ignore that. I can reproduce it in my build with those patches applied. I also noticed that once it's in the state after the STR from comment #12, I can navigate to a new page and get its content rendered... but zooming in/panning/etc. doesn't update any tiles beyond that.
Created attachment 622171 [details] [diff] [review] Patch This puts a static variable in GeckoApplication, which knows whether the application was sent to background or not. Every activity relies on that static variable to ascertain if the application is in background or not. Note: isApplicationSentToBackground() is not intended to be used by any activity. It will be used by GeckoApplication to see whether it is in foreground or not.
Attachment #622171 - Flags: review?(mark.finkle)
Comment on attachment 622171 [details] [diff] [review] Patch Review of attachment 622171 [details] [diff] [review]: ----------------------------------------------------------------- ::: mobile/android/base/GeckoActivity.java.in @@ +69,2 @@ > public boolean isApplicationInBackground() { > + return GeckoApplication.isApplicationInBackground(); Why is this static, when the rest of this file uses ((GeckoApplication) getApplication()).foo() ? ::: mobile/android/base/GeckoApplication.java @@ +10,5 @@ > import android.app.Application; > > public class GeckoApplication extends Application { > > + private static boolean mInBackground = false; Kill the `static`. Otherwise you're just going to have to fix this later (e.g., for Bug 753102). (And isn't m* the warped-Hungarian for "member"? If this is static, it should be sInBackground.)
Attachment #622171 - Flags: feedback+
Comment on attachment 622171 [details] [diff] [review] Patch r+ but I agree about dropping the static stuff
Attachment #622171 - Flags: review?(mark.finkle) → review+
Created attachment 622205 [details] [diff] [review] Patch This patch removes the "static" member. I felt "isApplicationSentToBackground()" will still be a misnomer for anyone trying to use on the activity. Hence I used "isGeckoActivityOpened()" which reflects the actual state of the variable.
Attachment #622171 - Attachment is obsolete: true
Attachment #622205 - Flags: review?(mark.finkle)
Is this patch causing the crashes you told me about on IRC?
?
(In reply to Mark Finkle (:mfinkle) from comment #21) > ? Patch seems to work for me, can't easily duplicate the issue in comment #12 anymore.
Status: NEW → RESOLVED
Last Resolved: 7 years ago
Resolution: --- → FIXED
Whiteboard: [mozilla-central]
Comment on attachment 622205 [details] [diff] [review] Patch [Triage Comment]
Attachment #622205 - Flags: approval-mozilla-aurora+
status-firefox14: --- → fixed
status-firefox15: --- → fixed
Verified on Galaxy S II; 5/11 Nightly.
Status: RESOLVED → VERIFIED | https://bugzilla.mozilla.org/show_bug.cgi?id=751690 | CC-MAIN-2019-04 | refinedweb | 998 | 57.77 |
Created on 2010-01-04 13:01 by skrah, last changed 2010-02-18 14:53 by mark.dickinson. This issue is now closed.
I think that context methods should convert arguments regardless of position:
Python 2.7a0 (trunk:76132M, Nov 6 2009, 15:20:35)
[GCC 4.1.3 20080623 (prerelease) (Ubuntu 4.1.2-23ubuntu3)] on linux2
Type "help", "copyright", "credits" or "license" for more information.
>>> from decimal import *
>>> c = getcontext()
>>> c.add(8, Decimal(9))
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
File "/usr/lib/python2.7/decimal.py", line 3866, in add
return a.__add__(b, context=self)
TypeError: wrapper __add__ doesn't take keyword arguments
>>>
>>> c.add(Decimal(9), 8)
Decimal('17')
>>>
Also, perhaps c.add(9, 8) should be allowed, too.
The same happens with other Context methods, like divide:
Python 2.6.2 (release26-maint, Apr 19 2009, 01:56:41)
[GCC 4.3.3] on linux2
Type "help", "copyright", "credits" or "license" for more information.
>>> from decimal import *
>>> c = getcontext()
>>> c.divide
<bound method Context.divide of Context(prec=28, rounding=ROUND_HALF_EVEN, Emin=-999999999, Emax=999999999, capitals=1, flags=[], traps=[Overflow, InvalidOperation, DivisionByZero])>
>>> c.divide(2,3)
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
File "/usr/lib/python2.6/decimal.py", line 3966, in divide
return a.__div__(b, context=self)
TypeError: wrapper __div__ doesn't take keyword arguments
>>> c.divide(Decimal(2),3)
Decimal('0.6666666666666666666666666667')
>>> c.divide(6,Decimal(2))
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
File "/usr/lib/python2.6/decimal.py", line 3966, in divide
return a.__div__(b, context=self)
TypeError: wrapper __div__ doesn't take keyword arguments
I agree that this would be desirable. And yes, c.add(9, 8) should be allowed, too.
Anyone interested in producing a patch?
I've been reading and seems not to be an explicit definition about this. I'm thinking in a patch I could supply tomorrow.
What about the idea of changing the implementation from:
return a.__add__(b, context=self)
to
return Decimal(a+b,context=self)
?
> What about the idea of changing the implementation from:
>
> return a.__add__(b, context=self)
>
> to
>
> return Decimal(a+b,context=self)
> ?
I think it would be better to convert the arguments a and b to Decimal before doing the addition. In the case of addition, it doesn't make much difference: for integers a and b, Decimal(a+b) rounded to the current context should be the same as Decimal(a) + Decimal(b). But for e.g., division, Decimal(a/b) is potentially different from Decimal(a)/Decimal(b).
There's also the issue that the context methods can return 'NotImplemented'. For example:
Python 2.7a1+ (trunk:77217:77234, Jan 2 2010, 15:45:27)
[GCC 4.2.1 (Apple Inc. build 5646) (dot 1)] on darwin
Type "help", "copyright", "credits" or "license" for more information.
>>> from decimal import *
>>> C = getcontext()
>>> C.add(Decimal(3), 'not a number')
NotImplemented
It's possible that a TypeError would make more sense here: NotImplemented should really only be returned by direct invocation of the double underscore magic methods (__add__, etc.).
Any patch should include tests in Lib/test/test_decimal.py, of course!
The attached patch solves this issue.
Finally, only operand 'a' needs to be converted to Decimal if it's not. I discover this after writing my tests and start the implementation.
A Context.method is modified if it has more than one operand (for example a and b) and Decimal.method uses _convert_other
26 Context's methods were modified.
26 unit tets were added to ContextAPItests TestCase.
docstring was added to Context.divmod
Thanks.
Thanks for the missing divmod docstring, too: I've applied this separately, partly because it needs to go into 2.6 and 3.1 as well as 2.7 and 3.2, and partly as an excuse to check that the new py3k-cdecimal branch is set up correctly. See revisions r77324 through r77327.
New patch.
Fix Context.method that were returning NotImplemented.
Decimal.__methods__ don't use raiseit=True in _convert_other so I check in Context.method and raise TypeError if necessary.
Added tests for Context.divmod missed in first patch.
Thanks for the latest patch! It's looking good, but I have a few comments:
(1) It's not necessary to do an isinstance(a, Decimal) check before calling _convert_other, since _convert_other does that check anyway. It doesn't really harm either, but for consistency with the way the Decimal methods themselves are written, I think the isinstance check should be left out.
(2) The error message that's produced when the Decimal operation returns NotImplemented is a bit strange:
>>> decimal.getcontext().add(2, 'bob')
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
File "/Users/dickinsm/python/svn/trunk/Lib/decimal.py", line 3869, in add
raise TypeError("Unable to convert %s to Decimal" % r)
TypeError: Unable to convert NotImplemented to Decimal
Presumably that '% r' should be '% b' instead.
(3) It looks like Context.power is missing a NotImplemented check:
>>> decimal.getcontext().power(2, 'bob')
NotImplemented
(4) We should consider updating the documentation for the Context methods, though there's actually nothing there that would suggest that these operations wouldn't work for integers.
One more:
(5) The patch includes a (presumably accidental) change to the divmod docstring, from "Return (a // b, a % b)" to "Return (self // other, self % other)". I think the first version is preferable.
And another. :)
(6) I think that with these changes, the single argument methods, like Context.exp, and Context.sqrt, should also accept integers. Thoughts?
(6) Yes, I think that is logical. In cdecimal, I accept integers for all unary methods except is_canonical and number_class.
If none of you is working on it right now, I'll produce a new patch.
Mark, how about this:
def __add__(self, other, context=None, raiseit=False):
"""Returns self + other.
-INF + INF (or the reverse) cause InvalidOperation errors.
"""
other = _convert_other(other, raiseit)
if other is NotImplemented:
return other
Then the context functions could look cleaner.
I.
Juan: Sure, take your time. :) I just wanted to know if you were still busy with it.
Juan, don't worry about the documentation if you don't want to. I can fix that up easily. (Of course, if you do want to, go ahead!)
Juanjo, ping me in private if you want help with the doc toolchain, I can show you how to touch the .rst and see the changes after processing.
1) Agree. Extra checks removed.
2) My mistake. Fixed.
3) Fexed.
4) Methods documentation fixed. Also added examples.
5) Fixed
6) Allow ints in the following unary methods (all except the ones excluded by skrah in cdecimal):
- abs
- canonical
- copy_abs
- copy_decimal
- copy_negate
- exp
- is_finite
- is_infinite
- is_nan
- is_normal
- is_qnan
- is_signed
- is_snan
- is_subnormal
- is_zero
- ln
- log10
- logb
- minus
- next_minus
- next_plus
- sqrt
- to_*_string
- to_integral_*
(also documented them properly as in 4)
copy_sing fixed and documented to have the same behaibour.
Ans a change in Doc/library/decimal.rst to reflec the new behaibour.
The updated patch looks good---thank you! We're getting there... :)
I'm not sure about the extra 'Operand can be Decimal or int.' in the method docstrings; this just looks like extra clutter to me. Rather, I think it would be a surprise worthy of documentation if these methods *didn't* accept int or long; since they now do (with your patch), I don't think it's really worth mentioning in the docstring. And it's not quite accurate, either, since these methods should accepts longs as well as ints (and bools, and instances of other subclasses).
Would you be content to remove these from the docstrings? Or do others monitoring this issue think they should stay?
The extra doctests and test_decimal tests are nice.
> copy_sing fixed and documented to have the same behaibour.
Hmm. Thanks for noticing this: it looks like Decimal.copy_sign is missing a _convert_other call. I think that should be fixed in the Decimal class rather than in the Context class (so Context.copy_sign and Decimal.copy_sign should make one _convert_other call each, instead of Context.copy_sign making two calls).
I.
Re: canonical. Yes, this made me pause for a second, too. But I don't see the harm in allowing it to accept ints and longs. Actually, it then provides a nice public version of _convert_other.
I'd probably also allow is_canonical and number_class to accept ints and longs, just on the basis that that gives fewer special cases.
Yes, indeed 'canonical' can be justified to take an integer, if we interpret the spec as:
'canonical' takes an operand and returns the preferred _decimal_
encoding of that operand.
But then 'is_canonical' should return false for an integer, and
this would create another special case: Accept an operand and
return something meaningful _without_ converting it first.
I think this is why I have problems with those two. 'number_class'
is less of a problem.
Yeah... I did't like that docstring either :) Removed!
Also fixed Decimal.copy_sign, changed Context.copy_sign and added tests.
The latest patch looks fine. I've attached a slightly tweaked version:
- Add conversions for number_class; without this, number_class is inconsistent with the various is_*** methods. "c.is_normal(3)" should be equivalent to "c.number_class(3) in ('+Normal', '-Normal)", for example.
- Remove conversions for 'canonical' and 'is_canonical'; I agree with Stefan that these don't make a lot of sense. It's mostly academic, since I can't imagine either of these methods gets much use.
- I've reworded the documentation slightly.
- Remove lots of trailing whitespace (mostly on otherwise empty lines).
If this looks okay to everyone, I'll check it in.
It looks good (I agree on number_class), but I'd change these:
- Add raiseit=True to context.copy_decimal()
- Remove wrong comment from context.is_infinite()
- Add _convert_other(a, raiseit=True) to context.logical_invert()
- More whitespace in test_decimal()
The new tests could be condensed quite a bit by using getattr(), but
that isn't so important.
Thanks, Stefan. Applied to the trunk in r78217. I'll forward port to py3k.
Tweaked some doctests in r78218:
- add integer argument doctest for logical_invert
- fix integer literals with a leading zero for the other logical_***
methods, since they're illegal in Python 3.
Merged to py3k in r78219.
Thanks, everyone! | https://bugs.python.org/issue7633 | CC-MAIN-2018-22 | refinedweb | 1,730 | 60.72 |
hi,
I have a problem of concatenating 2 strings. 1 of the strings is defined in the code and the other one is asked from user. This small code must only concatenate these to strings but doesn't work...
here is my code:
#include <stdio.h> #include <stdlib.h> #include <string.h> struct deneme { char *filename; } *dene; int main () { dene = malloc (sizeof(struct deneme)); dene->filename = (char*)malloc(200*sizeof(char)); char *path=(char*)malloc(sizeof(char)*250); path = "/bin/"; printf("Enter a file name: "); fgets(dene->filename,200,stdin); printf("filename:%s",dene->filename); strcat(path,dene->filename); printf("concatenated: %s\n",path); return 0; } | https://www.daniweb.com/programming/software-development/threads/43383/problem-in-concatenation-of-2-strings | CC-MAIN-2018-13 | refinedweb | 106 | 51.95 |
Java Interfaces
——————
Are public method prototype and behaviour. We make use of the “interface” keyword.
It is like an abstract class with two differences:
1. A class can inherit from only one class, but can “implement” as many interfaces you want.
2. A Java interface
cannot implement any methods at all.
nor cannot include any fields except “static final” constants
Only contains method prototype and constants.
//Nukeable.java public interface Nukeable{ public void nuke(); // no body }
// in java.lang public interface Comparable{ public int compareTo(Object o); }
public class SList extends List implements Nukeable, Comparable{ // all that matters public void nuke(){ head = null; size = 0; } public int compareTo(Object o){ // code that retruns a number thats less than 0 if <0 and 0 if =0 and >0 if >0 } }
Nukeable n = new SList(); // correct! Comparable c = (Comparable)n; // need to use a cast as some Nukeable are not Comparable n.nuke(); if (c.compareTo > 0){ // do something }
Arrays class in java.util sorts arrays of Comparable objects.
public static void sort(Object[] a){ }
Runtime error occurs if any item in a is not Comparable. An interface can have a subinterface and it can itself have sub interfaces.
//NOTE this!! public interface NukeAndCompare extends Nukeable, Comparable{ }
Java Packages
—————
Package is a collection of classes, Java interfaces and subpackages.
Three benifits:
1. Packages can contain hidden classes not visible outside package.
2. Classes can have fields and methods visible inside the package only.
3. Different packages can have classes with same name.
Example: java.io standard library.
Using Packages
—————-
Fully qualified name:
java.lang.System.out.println(); import java.io.File; // can now refer to File class import java.io.*; // refer to all things in io
Every program implicitly import java.lang.*
Also x.y.z.Classfile should be in x/y/z/Classfile.class
Building packages
——————
//list/SList.java package list; public class SList{ SListNode head; int size; }
//list/SListNode.java package list; class SListNode{ //"Package protection" Object item; //"Package protection" SListNode list; //"Package protection" }
Package protection is between private and protected.
A class/variable has package protection is visible to any class in the same package.
But it is not visible at all outside the package. ie files outside that directory.
The files that are outside only see the public classes/methods inside the package.
Public class must be declared in a file named after the class. The “package” class can appear in any *.java file.
Compiling and running
———————–
Must be done from outside the package.
//How to compile? javac -g list/SList.java javac -g list/ *.java javac -g heap / *.java / *.java // this takes care of dependancies also
// How to run? java list.Slist
The four levels of protection
——————————-
in same package in a subclass everywhere 1. public x x x 2. protected x x 3. package x 4. private | https://linuxjunkies.wordpress.com/tag/interfaces/ | CC-MAIN-2017-51 | refinedweb | 471 | 61.43 |
I’m trying to write some async tests in FastAPI using Tortoise ORM under Python 3.8 but I keep getting the same errors (seen at the end). I’ve been trying to figure this out for the past few days but somehow all my recent efforts in creating tests have been unsuccessful. I’m following the fastapi docs ..
Category : python-3.8
I ..
my program iterates over a list of instances, uses conditionals to check for their attributes, carries out some operations, and appends the result of each instance into a dictionary with the instance as a key and the result of the operations as a value. The dictionary should have 4 key-value pairs but when I print ..
I want to write a Discord bot that answers ping with pong. But I always get a list of error messages that i don’t understand. My code: import discord client = discord.Client() @client.event async def on_ready(): print(‘We have logged in as {0.user}’.format(client)) @client.event async def on_message(message): if message.author == client.user: return if message.content.startswith(‘$hello’): await message.channel.send(‘Hello!’) ..
I want to write a Discord bot that answers ping with pong. But I always get an error message. My code: import discord class MyClient(discord.Client): async def on_ready(self): print(‘Logged on as’, self.user) async def on_message(self, message): # don’t respond to ourselves if message.author == self.user: return if message.content == ‘ping’: await message.channel.send(‘pong’) client = MyClient("Nzk4ODEyMDc5NTgxNTYwODgz.X_6duA.erRda8m92NKDUpUII8C0htN_KZo") ..
I am exporting MySQL database using python using command import os password = ‘1234’ os.system(‘mysqldump -u root -p%s ot_database > D:ot.sql’ % password) The code was executed with no errors and A ot.sql file is created but the file is empty There is no data in ot.sql Please find the bug. Source: Python-3x..
I’m trying to upgrade the GAE runtime on several python projects from python37 to python38. I’ve used dev_appserver.py to test the apps locally before we deploy but I’m getting an unknown runtime error after changing the runtime to python38. Python 3.8 should be a supported runtime according to the appengine docs. I’ve also updated all ..
I’m trying to get PyAudio to record continuously until the program ends. I’ve tried to remove the amount of time to record for, but all that does is record it for only one second and make the first sample of sound loop. Here is my code import sounddevice as sd from scipy.io.wavfile import write fs ..
Im trying to get Numbers from a variable into a database and im getting this error. can anyone help me please. Im using python3 and SQLITE3. Apparently the error is on line 56 with i have marked on the code. I have tried this with other SQL statements that are close to this but do ..
I have a website in the following format: <html lang="en"> <head> #anything </head> <body> <div id="div1"> <div id="div2"> <div class="class1"> #something </div> <div class="class2"> #something </div> <div class="class3"> <div class="sub-class1"> <div id="statHolder"> <div class="Class 1 of 15"> "Name" <b>Bob</b> </div> <div class="Class 2 of 15"> "Age" <b>24</b> </div> # Here are 15 of these kinds ..
Recent Comments | https://askpythonquestions.com/category/python-3-8/ | CC-MAIN-2021-04 | refinedweb | 561 | 67.86 |
Introduction to Data Visualization Tools
Data visualization helps handle and analyze complex information using the data visualization tools such as matplotlib, tableau, fusion charts, QlikView, High charts, Plotly, D3.js, etc..
What are Data Visualization Tools?
There are numerous data visualization tools such as Tableau, QlikView, FusionCharts, HighCharts, Datawrapper, Ploty, D3.js, etc. Though there are humungous data visualization tools used in day-to-day life in Data visualization, One of the most popular plotting tools is matplot. pyplot.
Reasons why Matplotlib from data visualization tools is the most widely used:
- Matplotlib is one of the most important plotting libraries in python.
- The whole plotting module is inspired by plotting tools that are available in Matlab.
- The main reason is a lot of people come from the areas of Mathematics, Physics, Astronomy, and Statistics and a lot of Engineers and Researchers are used to Matlab.
- Matlab is a popular scientific computing toolbox out there, especially for scientific computing. So when people starting python specific plotting library for machine learning / Data science / Artificial Intelligence they got inspired by MATLAB and built a library called matplotlib
matplotlib.pyplot: matplotlib. pyplot is used widely in creating figures with an area, plotting the lines and we can do visualize the plots attractively.
Examples of Data Visualization Tools
Below are the examples mentioned:
import matplotlib.pyplot as plt.
Code:
plt.plot([2,4, 6, 4])
The above is a list, plt.plot will plot these list elements of the Y-axis which is indexed at 0,1,2,3 as their corresponding X-axis.
Code:
plt.ylabel("Numbers")
plt.xlabel('Indices')
If we look at the above 2 lines of code, it labels the Y-axis and X-axis respectively. (i.e, naming both axis.)
Code:
plt.title('MyPlot')
The above line of code will give the title to the plot. The title tells us what the plot is all about.
Code:
plt.show()
Output:
There is one problem with the above plot(screenshot 1), if you have noticed, we don’t see a grid-like structure. A grid helps you to read the values from the plot much easier. Now let’s see how to get the grid.
Code:
plt.plot([1, 2, 3, 4], [1, 4, 9, 16])
Look at the above line of code, instead of giving one array, we have two lists which become our X-axis and Y-axis. Here you can notice is, if our x-axis value is 2 its corresponding y-axis value is 4 i.e, y-axis values are the squares of x-axis values.
Code:
plt.ylabel('squares')
plt.xlabel('numbers')
plt.grid() # grid on
The moment you give this it will give a plot with a grid embed on it.
Code:
plt.show()
Output:
Now instead of line plot, We plot a different plot with a different example.
Code:
plt.plot([1, 2, 3, 4], [1, 4, 9, 16], ‘ro’)
Every X, Y pair has an associated parameter like the color and the shape which we can give accordingly using the functionality of the python keyword pair argument.
In this case, ‘ro’ indicates r – red color and o – circle shaped dots.
Code:
plt.grid()
plt.show()
Output:
Let’s say matplot lib works only with the list then we can’t use it widely in the processing of numbers. We can use the NumPy package. Also, everything is converted internally as a NumPy array
Let’s look slightly at the different plot:
Below are the different plot:
Code:
import numpy as np>
t = np.arange(0., 5., 0.2)
Above line creates values from 0 to 5 with an interval of 0.2.
plt.plot(t, t**2, 'b--', label='^2')# 'rs', 'g^')
plt.plot(t,t**2.2, 'rs', label='^2.2')
plt.plot(t, t**2.5, 'g^', label=‘^2.5')
In the above lines of code ‘b – – ‘ indicates Blue dashes, ‘rs’ indicates Red squares, ‘g^’ indicates Green triangles.
Code:
plt.grid()
plt.legend()
The above line of code adds a legends-based online label. Legends make the plot extremely readable.
Code:
plt.show()
Output:
If we want the line width to be more, then a simple parameter called linewidth can do it.
Code:
x = [1, 2, 3, 4]
y = [1, 4, 9, 16]
plt.plot(x, y, linewidth=5.0)
plt.show()
Output:
There are many other various parameters available which you can have at the documentation of plot function in matplotlib.pyplot().
The other interesting thing is set properties:
- x1 = [1, 2, 3, 4] y1 = [1, 4, 9, 16]
Y1 values are square of X1 values
- x2 = [1, 2, 3, 4] y2 = [2, 4, 6, 8]
Y2 values are just twice of X2 values
- lines = plt.plot(x1, y1, x2, y2)
By using the above line we can plot these values in a single line. So what happens here is it will plot X1 vs Y1 and X2 vs Y2 and we are storing these in a variable called lines. Also, we can change the properties of those lines using keyword arguments.
- plt.setp(lines[0], color=’r’, linewidth=2.0)
Here setp is called as set properties, lines[0] corresponding to X1,Y1 respectively, color and linewidth are the arguments.The above line of code is written using keyword arguments (refer screenshot 6).
- plt.setp(lines[1], ‘color’, ‘g’, ‘linewidth’, 2.0)
The above line of code represents the matlab syntax .
Here lines[1] corresponds to X2, Y2 respectively. We also have two pairs of arguments ‘colour’,’g’ and ‘linewidth’,’2.0’.
Either of the way we can plot the line:
- The first way is the native way of how we use in python.
- The second way is preferably used by the people from the Matlab background.
Code:
plt.grid()
put.show()
Output:
Conclusion
In this data visualization tools post, we have discovered the introduction to visualizing the data in Python. To be more specific we have seen how to chart data with line plots and how to summarise the relationship between variables with scatter plots.
Recommended Articles
This has been a guide to data visualization tools. Here we have studied the basic concepts and tools of data visualization with their examples. You may also look at the following articles to learn more – | https://www.educba.com/data-visualization-tools/ | CC-MAIN-2022-05 | refinedweb | 1,045 | 64 |
Help sending json
Hi
I'm coming from arduino but I prefer the pycom hardware, so I'm migrating all my devices to this platform.
Finally all my sensors are read by gpy, and wifi connect to my network,
But my question is, do you have any idea how to compose and send json, in C we defined the concoctions:
char server[] = "theblue.io"; #not real server
char path[] = "/api/v2/gprs";
int port = 11880;
we compose the json with a library
StaticJsonBuffer<300> jsonBuffer; JsonObject& root = jsonBuffer.createObject(); root["dot"] = "gsm001"; //JsonArray& data = root.createNestedArray("data"); // Build your own object tree in memory to store the data you want to send in the request // JsonObject& root = jsonBuffer.createObject(); // root["dot"] = dot; // JsonObject& data = root.createNestedObject("data"); data.set("5", shttemp); data.set("6", vpress); data.set("7", shthum); data.set("14", BatteryLevel);
and send the data:
if (client.connect(server, port)) { postToTBD(root); gsmAccess.shutdown(); } else { // if you didn't get a connection to the server: Serial.println("connection failed"); gsmAccess.shutdown();
How could I do that in mycropython? any guide o tutorial please?
Thank's
- Gijs Global Moderator last edited by
In python, we'd use a socket, something like this
over raw TCP: (you could fabricate your own HTTP header
import socket s = socket.socket(socket.AF_INET, socket.SOCK_STREAM) #use the inet interface, and TCP socket s.connect(socket.getaddrinfo('', 80)[0][-1]) s.sendall(json)
or using urequests, this is not built into the pycom firmware, but available as a library: (you can place it in the lib folder in your project to include it in your project):
and the API pages:
thank'you very much for your help, it has been very use full, one more question, how could I post this json? In Arduino we use Http library, how could I do in Pycom?
Thanks' for your patience
Best
Eduard
- Gijs Global Moderator last edited by
In micropython, we have the
ujsonmodule:
there's several examples on the internet explaining how to create a JSON object in python as well (which works really similar to micropython), I'll link one in here:, or
That is one of the easier things in python, we dont need to care about data types all that much. | https://forum.pycom.io/topic/6661/help-sending-json | CC-MAIN-2021-31 | refinedweb | 379 | 63.8 |
- NAME
- DESCRIPTION
- Supported Filters
- DETAILS
- SEE ALSO
- BUGS OR OMISSIONS
- AUTHOR
NAME
Inline::Filters - Common source code filters for Inline Modules.
DESCRIPTION
Inline::Filters provides common source code filters to Inline Language Modules. Unless you're an Inline module developer, you can just read the next section.
Supported Filters
This section describes each filter in Inline::Filters.
Strip_POD
Strip Comments:
- Strip_C_Comments
-
- Strip_CPP_Comments
-
- Strip_Python_Comments
-
- Strip_TCL_Comments
-
- Java via Strip_CPP_Comments
-
The Python and Java filters are available for convenience only. There is little need for them, since Inline::Python and Inline::Java use the official language compilers to parse the code, and these compilers know about comments.
Preprocess.
CPPFLAGS Argument
Also available is the CPPFLAGS argument, to specify C preprocessor directives.
use Inline C => <<'END' => CPPFLAGS => ' -DPREPROCESSOR_DEFINE' => FILTERS => 'Preprocess'; #ifdef PREPROCESSOR_DEFINE int foo() { return 4321; } #else int foo() { return -1; } #endif END
The code shown above will return 4321 when foo() is called.
CLEAN_AFTER_BUILD Argument
By default, the Preprocess filter deletes all Filters*.c files it creates. If you set the CLEAN_AFTER_BUILD flag to false, then the
Filters*.c files will not be deleted; this is necessary when using
gdb to debug Inline::C and Inline::CPP programs which utilize the Preprocess filter.
If you do not set the CLEAN_AFTER_BUILD flag to false, you will likely end up with a "No such file or directory" error in gdb:
use Inline C => <<'END' => /.../_Inline/build/eval_XXX_YYYY/FiltersZZZZ.c: No such file or directory.
If you do set the CLEAN_AFTER_BUILD flag to false, you should see the actual offending C or C++ code in gdb:
use Inline C => <<'END' => CLEAN_AFTER_BUILD => 0 => YOU SHOULD SEE YOUR ACTUAL OFFENDING CODE HERE
DETAILS
Built-in Filters.
User-supplied Filters.
Applying Filters.
filter (object, coderef) METHOD
new (filter, coderef) METHOD
get_filters (language) FUNCTION
returns all supported languages
SEE ALSO
For more information about specifying Inline source code filters, see Inline::C or Inline::CPP.
For more information about using other languages inside Perl, see Inline. For more information about using C from Perl, see Inline::C.
BUGS OR OMISSIONS.
AUTHOR
Neil Watkiss (NEILW@cpan.org) Reini Urban (RURBAN@cpan.org) Will Braswell (WBRASWELL@cpan.org)
Maintained now by the perl11 team:
Copyright (C) 2001, Neil Watkiss. Copyright (C) 2014, 2015 Reini Urban & Will Braswell.
This module is free software. It may be used, redistributed and/or modified under the same terms as Perl itself.
See. | https://metacpan.org/pod/release/RURBAN/Inline-Filters-0.20/Filters.pm | CC-MAIN-2019-18 | refinedweb | 396 | 57.06 |
Type Inference
One noteworthy JDK 7 feature is that you needn’t specify the value of the type parameter explicitly as you must when invoking generic constructors. The compiler figures out the value of the type parameters by examining the types of the constructor arguments. This process is called type inference. For example, consider the following generic class and its instances :
Notice how gen1 is declared. The type arguments (which are Integer and String) are specified twice: first, when gen1 is declared, and second, when a Gen gen1; therefore, there is really no reason that they need to be specified a second time. To address this situation, JDK 7 added a syntactic element that lets you avoid the second specification. Today this declaration can be rewritten.
Notice how gen2 is declared,.
Program
class Gen<T, U> { private T t; private U u; Gen(T tt, U uu) { t = tt; u = uu; } T getT() { return t; } U getU() { return u; } } public class Javaapp { public static void main(String[] args) { Gen<Integer, String> gen1 = new Gen<Integer, String>(40, "Fifty"); Gen<String, String> gen2 = new Gen<String, String>("Thirty", "Fifty"); System.out.println(new Gen<>(50, 100).getU()); } } | https://hajsoftutorial.com/java-type-inference/ | CC-MAIN-2019-47 | refinedweb | 196 | 53.1 |
Hello to everybody,
I just bought this stepper motor and driver, aparently it doesn’t work with the built in library in Arduino. You need an extra library, I thought I found it:
But when I try to use the implementation, I click on “verify” and I get this error:
C:\Users\santi\Documents\Arduino\libraries\StepperMotor\libreria.cpp:2:26: fatal error: StepperMotor.h: No such file or directory
#include <StepperMotor.h>
I wanted to delete all about the library and start from zero but I cannot find a way to delete the name of the library from the list. I can delete the folder but the name still is present there.
It is a very basic question, Do I need to save the first file ended in .h, and What is its name? What is the name of the file that I have to save as .cpp? Do those names must be equal to the name of the library?
Can’t I remove everything about that library?
Thanks! | https://forum.arduino.cc/t/i-need-a-library-to-make-this-28byj48-stepper-motor-and-uln2003-driver-work/336461 | CC-MAIN-2021-43 | refinedweb | 170 | 73.98 |
Closed Bug 809056 Opened 10 years ago Closed 9 years ago
reduce thumbnailing impact when there are no thumbnail service consumers
Categories
(Firefox :: General, defect)
Tracking
()
Firefox 29
People
(Reporter: BenWa, Assigned: adw)
References
(Blocks 1 open bug)
Details
(Whiteboard: [Snappy])
Attachments
(2 files, 3 obsolete files)
We shouldn't spend time thumbnail pages that wont show up in the top pages.
The thumbnail service is there for broader use than only by the new tab page.
Status: NEW → RESOLVED
Closed: 10 years ago
Resolution: --- → WONTFIX
What other then panorama uses it?
Status: RESOLVED → REOPENED
Resolution: WONTFIX → ---
See for all current uses on mozilla-central. On top of that, new features can start using the service any time. Add-ons can use it too. Also, please don't reopen just because you had a question. :/
Status: REOPENED → RESOLVED
Closed: 10 years ago → 10 years ago
Resolution: --- → WONTFIX
"add-ons could in theory use it" isn't a great argument for us doing performance-intensive work that we would otherwise be able to avoid. I agree that we need to factor the cost of having this service not be generic enough (and thus encouraging people to re-implement its functionality, possibly poorly) when making the tradeoff, but I don't believe that the current behavior is optimal, so it's best not to outright shoot down ideas for trying to improve it.
(In reply to Dão Gottwald [:dao] from comment #3) > Also, please don't reopen just because you had a question. :/ Let's reach consensus before we close out this bug. I have quantified that snapshot is a sizable source of jank. Snapshoting a page takes can take 50-200ms.
Status: RESOLVED → REOPENED
Resolution: WONTFIX → ---
Whiteboard: [Snappy]
Just the snapshot or does this include the write to disk? I have just r?-ed a patch that moves the write of the main thread and improves its efficiency, plus might very slightly improve the speed of snapshoting itself (that remains to be confirmed).
Perhaps we could alter the semantics of getThumbnailURL so that the thumbnail for a page is effectively shapshot + written only if either that page is in the top N or getThumbnailURL has already been called for that URL reasonably recently. This would effectively remove most snapshots and this should eventually work for all URLs that "deserve" a snapshot.
(In reply to :Gavin Sharp (use gavin@gavinsharp.com for email) from comment #4) > "add-ons could in theory use it" isn't a great argument for us doing > performance-intensive work that we would otherwise be able to avoid. We couldn't otherwise avoid it. Add-ons were only the last aspect of my argument.
(In reply to Dão Gottwald [:dao] from comment #8) > We couldn't otherwise avoid it. Add-ons were only the last aspect of my > argument. We control mozilla-central and the callers of getThumbnailURL there, so that shouldn't be a limiting factor in what is possible to improve.
Why is this in Places?
Component: Places → General
Product: Toolkit → Firefox
Summary: Only thumbnail top pages that will show up in the new tab page → reduce thumbnailing impact when there are no thumbnail service consumers
We currently have a method called PageThumbs.addExpirationFilter() that allows components to register a listener that is called when we expire thumbnails. The listeners are called and we expect them to return a list of URLs they want to keep thumbnails for. about:newtab returns a list of 25 links starting with the ones currently shown on the grid. Panorama returns the list of open tabs. I think we should rename this so that it's not an expiration filter anymore but rather a list of sites we're supposed to create thumbnails for. The list would need to be updated rather often as features like Panorama may return a different one depending on what tabs were closed or opened. Features that have different requirements and show thumbnails for different sites would then just add themselves and provide their list of URLs when asked.
Status: REOPENED → NEW
Assignee: nobody → adw
Status: NEW → ASSIGNED
OS: Mac OS X → All
Hardware: x86 → All
Tim, this does what your comment 12 suggests.
Attachment #804135 - Flags: feedback?(ttaubert)
Comment on attachment 804135 [details] [diff] [review] expiration filters -> capture filters Review of attachment 804135 [details] [diff] [review]: ----------------------------------------------------------------- The approach itself looks good to me but I'm a little worried that there's now a lot more overhead than before. We currently expire thumbnails maybe once per hour, we request the lists of thumbnails to keep and then go and delete files. The new approach would mean that every time we check whether to capture a thumbnail or not we request those lists. Should we somehow cache them and only re-request them after a certain expiration time? Should CaptureFilter API clients be required to periodically update their stored lists? They should know best when their lists are invalidated. Maybe we shouldn't worry about that too much? All the clients we currently have seem to not do much work to generate those lists so maybe we're fine. ::: toolkit/components/thumbnails/PageThumbs.jsm @@ +758,5 @@ > + function filterCallback(filterURLs) { > + let urlMap = new Map(); > + for (let url of filterURLs) { > + urlMap.set(url, true); > + } Should use a Set here: let urlSet = new Set(filterURLs); ... aURLs.some(url => urlSet.has(url))
Attachment #804135 - Flags: feedback?(ttaubert) → feedback+
See for additional efforts on the topic.
That's covered by bug 720575.
I had the same thought, Tim, so this patch inverts the previous one. Instead of PageThumbs asking consumers for filters, this makes consumers give their filters to PageThumbs. Then on capture it's only O(1) to consult the set of filtered-in URLs to determine whether the capture is OK. Need to update the tests next if this is OK.
Attachment #804135 - Attachment is obsolete: true
Comment on attachment 827216 [details] [diff] [review] make consumers register their filters with PageThumbs I still don't think this is very reasonable, but if you really want to pursue this plan, you need to update at least another two consumers on mozilla-central: Not sure if browser/metro/base/content/startui/TopSitesView.js is covered by the NewTabUtils.jsm change.
(In reply to Dão Gottwald [:dao] from comment #18) > I still don't think this is very reasonable I would actually be OK with simply modifying gBrowserThumbnails to skip capture for URLs that aren't in NewTabUtils.links.getLinks().
The two other consumers Dao mentions are Panorama and tab previews. Both expect all open pages to have thumbnails. In light of those two consumers, this bug doesn't make much sense: it's never the case that there are no thumbnail consumers. Panorama and tab previews potentially need a thumbnail of every tab you visit, so there's no work to be done here. On the other hand, the larger point is to not capture thumbnails if they're not going to be used. If you never use Panorama or tab previews, as most people apparently do not, then it's wasteful to capture every page. What do you think about capturing missing thumbnails on demand in both Panorama and tab previews? Then they'd work like about:newtab. If they show only open tabs, then they could use the foreground service, although capturing many tabs in the foreground would potentially block the UI. Or they could use the background service, but that would be slower, and some pages would not appear as they do in open tabs.
Flags: needinfo?(ttaubert)
Given that ctrl+tab previews are off by default and Panorama is seldom used, I think we should try to optimize for the common case. If that means a degraded experience on first-use of those features (e.g. while thumbnails are fetched in the background), I think that's acceptable.
We know when these feature are used. It seems that when they're active, they could tell the service to capture images for all tabs. I thought this was the idea behind the API introduced here.
What do you think should happen the first time you use them? In the first-run case specifically, is the last paragraph in comment 20 reasonable? So: * gBrowserThumbnails attempts to capture every open tab like it does now, but PageThumbs declines filtered-out URLs. * When a feature is presented to the user for the first time, it sets up its capture filter. * Whenever a feature is presented to the user, including but not only for the first time, it captures missing thumbnails through either the background or foreground service.
So, just a short recap. We have four features that use the thumbnail service and two patterns: The two new tab pages use .getThumbnailUrl() to show thumbnails of most-visited pages and can deal with missing thumbnails. For the list of visible but missing thumbnails they request a background capture. Now OTOH Panorama and Ctrl+Tab previews will capture their own thumbnails using .drawWindow(), even if activated late in the browsing session. Both of those features however cannot get thumbnails for tabs that are [pending=true] (tabs restored by sessionstore that haven't actually been loaded yet). We could solve this differently by keeping the current expiration filter mechanism and changing Panorama and Ctrl+Tab previews to use PageThumbs API methods that capture and store images on disk. That way we could bypass the NewTabUtils.getLinks() filter applied by browser-thumbnails.js.. More food for thought: this would make browser-thumbnails.js quite specialized for capturing pictures only for our newtab pages and would beg the question whether we should be capturing thumbnails in the foreground by default at all. PageThumbs could be separated into a capturing API and a storage API that only stores and retrieves thumbnails. Capturing could be explicitly requested by features and add-ons like Panorama and Ctrl+Tab previews that want up-to-date thumbnails.
Flags: needinfo?(ttaubert)
(In reply to Tim Taubert [:ttaubert] from comment #24) >. I have about 500 tabs open, most of which are unloaded... How would this be handled by Panorama with your suggested fix? I'm not sure I understand it.
The bottom line is that thumbnail consumers either go and capture missing thumbnails on demand, ultimately resorting to the background service; or we maintain the status quo of capturing all tabs because we never know when some consumer might need a thumbnail. Assuming we don't want any consumers to have missing thumbnails.
This is a rough proof of concept where gBrowserThumbnails._shouldCapture() returns true only for top sites and Panorama loads missing thumbnails using the background service. It modifies BackgroundPageThumbs's capture methods to return an object with a cancel() method that cancels the capture if it's stilled queued when cancel() is called. Panorama uses it to cancel all queued captures when it's hidden. When it's shown again, it resumes capturing. This patch is a little messy but it gets the idea across. Ctrl-Tab tab previews would work the same way, but this patch doesn't change them.
I'll post what Gavin and I talked about today regarding the latest patch. The experience when loading thumbnails in the background in Panorama is actually not as bad as I was expecting. (Tim, I'd really like your thoughts.) I think it's probably viable. But, I don't use Panorama so I don't have habits to disrupt. The Ctrl-Tab tab previews experience is worse, for me at least. The latest patch doesn't bg-load thumbnails in that case, but it does mean that most of my Ctrl-Tab previews are missing. I use Ctrl-Tab and for me it's very transient, so it's unlikely that there's time for most thumbnails to load while it's visible on-screen. What's worse, the bezel that the previews are contained in is transparent, so you can see through the missing thumbnail tiles. (That could be fixed with placeholder thumbnails.) Gavin thinks we should just remove the feature altogether. I'll post to firefox-dev about it.
So, this bug's summary says "...when there are no thumbnail service consumers". I don't understand why we're even talking about the background service when Ctrl-Tab and Panorama (when used) should just tell the thumbnail service that they want thumbnails for all open tab. If that's not an option, then it seems that the thumbnail service is so crippled at this point that "thumbnail service" becomes a misnomer.
(In reply to Dão Gottwald [:dao] from comment #29) > (when used) (In reply to Drew Willcoxon :adw from comment #23) > What do you think should happen the first time you use them?
I should note that tab-previews uses two methods for retrieving thumbnails: It relies on thumbnails stored by the thumbnail service for pending=true pages, and it captures all other pages itself. The second case isn't necessarily a problem in the context of this discussion because it only happens when the feature is enabled. The problem is the first case, since we want to stop capturing and storing thumbnails unnecessarily. I think the first case can be worked around without removing the feature altogether and even without changing how it works. (ctrlTab.init() could background-load thumbnails for the small number of pending=true pages in its list that don't have stored thumbnails.) Maybe the feature should be removed, but I don't think this bug by itself is a good reason. Also note that it's already possible for tab-previews to have missing thumbnails even without the patch here.
Gavin and I talked about this bug again. How ctrlTab only captures when it's enabled; it captures thumbnails for non-pending pages; blank thumbnails already happen for pending=true pages that gBrowserThumbnails declined to capture; and the effect of fewer cached thumbnails would be a higher likelihood of more blank thumbnails for pending=true pages, which is not a big deal. We agreed that given all of that, removing or changing ctrlTab isn't necessary for this bug. (But there are two follow-up opportunities: cache captured thumbnails so they're available later, like Tim says in comment 24, and background-capture missing thumbnails for pending=true pages.) As I'm writing that, I realize that the same reasoning applies to Panorama. So maybe there's no need to touch it, either. Just live with more blank thumbnails for pending=true pages, and leave background-capture as a possible follow-up.
(In reply to Drew Willcoxon :adw from comment #30) > (In reply to Dão Gottwald [:dao] from comment #29) > > (when used) > > (In reply to Drew Willcoxon :adw from comment #23) > > What do you think should happen the first time you use them? You just get blank thumbnails. I think the important part here is to allow consumers to tell the service to keep thumbnails for all open tabs. For Ctrl-Tab or other consumers that display a limited number of thumbnails, it might also make sense to background-capture upon first use, but you really wouldn't want this every time Ctrl-Tab is invoked. For Panorama or other consumers that might want to display thumbnails for lots of tabs, I'm skeptical that background-capturing is the right thing to do even for the first use -- even if it doesn't bring down your system, it seems excessive.
I've come around to the same view, at least for this bug. This patch simply changes gBrowserThumbnails to only capture and store top sites. Consumers of the thumbnail services remain free to use them to store whatever they'd like. Tim, I'll leave the feedback? on the previous patch for you to clear or +/- as you'd like. A possible modification would be for gBrowserThumbnails to fall back to capturing and storing all pages if Panorama or Ctrl-Tab has been used. Maybe that's what you mean, Dão, when you say allowing consumers to tell the service to keep thumbnails for all open tabs. But I'm not sure that's necessary, since both features capture thumbnails when they need them. The only time they need stored thumbnails is for pending tabs, like we've discussed, and we're OK with blank thumbnails. But if we want to do that, I think it would be better for each feature to use PageThumbs to store when they capture instead of having gBrowserThumbnails store everything.
Attachment #827216 - Attachment is obsolete: true
Attachment #8346068 - Flags: review?(ttaubert)
Comment on attachment 8346068 [details] [diff] [review] make gBrowserThumbnails capture/store only top sites Review of attachment 8346068 [details] [diff] [review]: ----------------------------------------------------------------- I like shifting responsibility to features themselves. Before we could land this we however need to fix Panorama and Ctrl+Tab to capture *and* store thumbnails. Panorama currently captures a lot of thumbnails, on every MozAfterPaint - that is, when the feature is shown. It would make sense to maybe have a lower stale time for Panorama than we have for about:newtab though. Ctrl+Tab would need to capture and store images when tabs load as well. Thinking about this more it might be beneficial if we had namespaces for thumbnails. Panorama could use PageThumbs.jsm to capture and store thumbnails in its own folder. It could as well register its own timer and call PageThumbs.expire() by passing a list of thumbnails to keep. And we could thus get rid of ExpirationFilters. The great thing is that every component requiring thumbnails can implement its own policy and on the side of PageThumbs we could also keep a canvas cache this is cleared on MozAfterPaint (or the like) in case multiple features would issue multiple drawWindow() calls for the same state. ::: browser/base/content/browser-thumbnails.js @@ +122,5 @@ > }, > > _shouldCapture: function Thumbnails_shouldCapture(aBrowser) { > + // Capture only if it's a top site in about:newtab. > + if (!NewTabUtils.links.getLinks().some(l => l == aBrowser.currentURI.spec)) Using .indexOf() might be a tad faster/more explicit here? ::: toolkit/modules/NewTabUtils.jsm @@ +620,5 @@ > getLinks: function Links_getLinks() { > let pinnedLinks = Array.slice(PinnedLinks.links); > > // Filter blocked and pinned links. > + let links = (this._links || []).filter(function (link) { Another way to fix this would be to call populateCache() right before getLinks() which would make _shouldCapture() async though. The populateCache() API sucks (sorry) but I didn't have enough time fix this, otherwise getLinks() would just return a promise.
Attachment #8346068 - Flags: feedback+
Comment on attachment 8346068 [details] [diff] [review] make gBrowserThumbnails capture/store only top sites Review of attachment 8346068 [details] [diff] [review]: ----------------------------------------------------------------- Cancelling review for now based on Tim's comments.
Attachment #8346068 - Flags: review?(mhammond)
(In reply to Tim Taubert [:ttaubert] from comment #35) > Before we could land this we however need to fix Panorama and Ctrl+Tab > to capture *and* store thumbnails. Could you explain why? I don't agree. If a higher likelihood of missing thumbnails for pending pages is the reason, we can live with that for now. I'd be happy to work on a follow-up bug that stores thumbnails. > Thinking about this more it might be beneficial if we had namespaces for > thumbnails. All of this seems out of scope for this bug. > Using .indexOf() might be a tad faster/more explicit here? Changed. > Another way to fix this would be to call populateCache() right before > getLinks() which would make _shouldCapture() async though. It's much simpler to not assume _links is nonnull, and breaking this implicit assumption makes the API stronger IMO. So I didn't change this part.
Attachment #8346068 - Attachment is obsolete: true
Attachment #8349131 - Flags: review?(mhammond)
Backed out in for breaking m-bc:
The three failing tests rely on gBrowserThumbnails._shouldCapture() returning true, so I had to modify them to make it return true by adding visits and repopulating NewTabUtils's link cache.
And out again in for other m-bc bustage:
Status: ASSIGNED → RESOLVED
Closed: 10 years ago → 9 years ago
Resolution: --- → FIXED
Target Milestone: --- → Firefox 29 | https://bugzilla.mozilla.org/show_bug.cgi?id=809056 | CC-MAIN-2022-33 | refinedweb | 3,342 | 71.55 |
The previous articles in this series on threads offered two suggestions:
Use a thread function interface class to separate the application-specific code from the thread library facilities (the Thread-Runs-Polymorphic-Object design).
Use a Handle-and-Reference-Counted-Body technique to manage the lifetime of objects representing threads.
The resulting thread model can form the basis of a useful thread library. In practice, however, it does not address some problems.
At the heart of the project I have been working on for the past two years there are active objects known as Jobs. There are several different kinds of Job and each runs in its own thread. Roughly speaking, a Top Job runs Middle Jobs and a Middle Job runs Bottom Jobs. (I have changed the names to protect the innocent.)
So, naturalists observe, a flea hath smaller fleas that on him prey; and these have smaller fleas to bite 'em, and so proceed ad infinitum. (Jonathan Swift)
Each Job class hides its thread behind a suitable interface, as shown in Figure 1. The thread model is essentially the same as the Thread-Runs-Polymorphic-Object design described in the previous articles.
Each Job contains a queue of Command objects [GoF]. Public member functions add commands to the back of the queue; the private Run() function removes commands from the front of the queue and executes them in the internal thread. Figure 1 shows the structure of a 2-step Job class.
The queue class simplifies the Job functions by providing blocking read and write functions that are unconditionally safe in a multi-threading environment. The Command objects call one of the Job's member functions to do the real work.
A client at a higher level creates a Job and calls the Start() function, which creates a new start-step-1 command and adds it to the queue. The Run() function removes the command from the front of the queue, executes it, which initiates step1, and deletes it.
When step 1 finishes, a client at a lower level calls Step1_Completed(), which adds a new start-step-2 command to the back of the command queue. The Run() function removes the command from the front of the queue, executes it, which initiates step 2, and deletes it.
Similarly, when step 2 finishes, a client at a lower level calls Step2_Completed(), which adds a new terminate command to the back of the command queue. The Run() function removes the command from the front of the queue, executes it, which sets the done flag, and deletes the command. The Run() function then exits its processing loop and the thread terminates.
Note that all the public member functions execute in a client thread and all the private member functions execute in the Job's own thread. This is how the Job class hides its thread from the client code.
Now, I could not help noticing that there is a lot of duplication here. Top, Middle and Bottom Jobs all look much the same. And the same pattern (small 'P') crops up elsewhere in our code. This is a golden opportunity for some refactoring [Fowler].
In C++ there are several ways to factor out common code. We could create a common base class, for example, or a class template or a separate module all together. Which should we choose for the family of Job classes?
The template option is not appropriate here because the Job classes do not have a common interface. In the real application Top, Middle and Bottom Jobs have public member functions with very different names and purposes. A Job base class would cure the code duplication problem for the Job classes, but the same problem occurs elsewhere in the program. So, I think we are led to a more general refactoring - one that works for active objects of all kinds.
In the good old days, when multi-threading operating systems were not generally available[1], many software systems were divided into multiple processes. Such systems were often designed using Mascot diagrams. Those diagrams showed processes as circles and the processes were linked by "channels" that functioned as message queues. In a Mascot diagram, "process" meant a real (physical) process as known to the operating system. (Data flow diagrams from the era of structured design methodologies are very similar except that they show abstract (logical) processes. The logical processes in a DFD could be nested and mapped to physical processes in arbitrary ways.)
Designing systems using Mascot diagrams was relatively straightforward. Concurrency problems did arise, but (as far as I remember) they were less numerous and less troublesome than they are in modern multi-threading programs. I think this is partly because software these days is more complex and threads encourage more concurrent processing. But it is also partly because the art of designing software for a multi-threading environment seems to have been lost.
The Mascot model is very general. It qualifies as a Design Pattern (capital 'P') [GoF] and it solves certain problems of communication between concurrent threads. So, instead of re-inventing the wheel, I propose to use this Pattern to build a new thread model - an "application-oriented" model - and then use the new thread model to refactor the Top, Middle and Bottom Job classes.
To keep things simple I shall describe a rather naïve implementation of the application-oriented thread model. Better implementations will be mentioned, but not explained in detail.
The key feature of the application-oriented thread model is that the thread class contains an input queue. The queue contains pointers to function objects that are executed in sequence in the context of the thread. Each function object must conform to the interface defined by the thread::command class.
Figure 3 shows the thread and thread command classes. It also shows a thread body class declared as an incomplete type. The thread body hides all details of the implementation. (This is the Cheshire Cat/Pimpl/Bridge Pattern, again.)
Once started, a Job proceeds in a series of event-driven steps. The hardware drives the Bottom Jobs, which drive the Middle Jobs which, in turn, drive the Top Jobs.
Like the Job classes illustrated above, client code adds function objects to the queue using the push_back() function while the hidden implementation removes each function object from the queue, executes it and disposes of it using the delete operator. A better implementation would provide command objects in the form of Handles which could be passed by value. This would provide a more flexible method of managing the lifetime of the command objects.
The terminate() function just adds a 'terminate' command object to the back of the queue. The 'terminate' command is provided by the implementation; it does not have to be provided by the client code. Executing the 'terminate' command causes the thread to terminate.
The wait() function suspends the calling thread until its own thread has terminated. When the wait() function returns it is safe to destroy the thread object. A Handle/Body mechanism would provide more flexible lifetime management here, too. (The previous article in this series illustrates this technique.)
All the declarations should be in a suitable namespace to minimise the risk of name clashes.
The effect of refactoring the Job classes to use the new thread model is illustrated in Figure 4.
This version of a Job class inherits all the thread behaviour from the thread class. It needs no user-defined constructor or destructor, no implementation of the Run() function, no Terminate() function and none of the data that the earlier version of the class required. The code that is left is all specific to the Job class. And the interface has remained unchanged. All the hallmarks of a successful refactoring are here.
We started with a family of active objects (the Top, Middle and Bottom Jobs). We identified a classic case of unwarranted code duplication. And we refactored to remove the duplication. The whole process was a routine application of good programming principles that led to a thread model that suited one particular program. But we have not compared the new thread model with the more common designs, nor have we considered whether the new model would be useful in other applications.
In discussing these points, I must stress that I do not have enough data for any firm conclusions. Nevertheless, it is worth explaining how the application-oriented thread model arose and exploring some of the characteristics of the two threading models.
In our project, the Top, Middle, Bottom hierarchy of Jobs was established early in the design. The normal path through each Job is a simple sequence or repeating loop. However, the user can intervene at any time to pause or abort the Job. At each step the Job would initiate an asynchronous operation (e.g. start a lower-level job or perform an operation on a device) and wait for one of several outcomes (success, failure, pause or abort). The Win32 WaitForMultipleEvents() API call seemed to provide a natural way to do this. In practice, though, managing the multiple Event objects required by this approach became rather complex.
Although it was far from clear at the time, replacing the multiple Events with some sort of message queue simplified the design considerably. A Job could now wait for a "new message" event, read the message and perform some appropriate action. In effect, multiple un-parameterised Events were replaced by a single parameterised Event, with the message as the parameter.
The down side of a classic message queue is that the receiving function tends to become a big, error-prone switch statement. Our answer to that problem was to put Command objects into the input queue. Or rather, pointers to Command objects because Commands are necessarily polymorphic. And that is the design described at the beginning of this article.
This is just one team's experience and one data point does not make a trend, but it suggests that threads and input queues work well together. The design methods based on Mascot and Data Flow diagrams seem to support this idea. The input queue of the application-oriented model does, of course, carry more overhead than the lower-level thread designs supported by most threading libraries. But I wonder if multi-threaded applications usually build in such machinery anyway. If so, a library supporting application-oriented threading could be a useful addition to the programmer's toolkit. | https://accu.org/index.php/journals/490 | CC-MAIN-2020-29 | refinedweb | 1,740 | 63.19 |
11 July 2013 16:42 [Source: ICIS news]
By Mark Yost
HOUSTON (ICIS)--Call it a tale of two petrochemicals.
Styrene-butadiene-rubber (SBR) and butadiene (BD) have both seen the bottom fall out of their respective markets over the past year, mainly because of a global downturn in the replacement-tyre market.
The spot price for US BD has dropped by 41% over the past year, from 97.5 cents/lb ($2,149/tonne, €1,676/tonne) to 57.5 cents/lb today. Similarly, the average spot price for SBR 1502 has fallen nearly 23% from 113.5 cents/lb a year ago to 87.5 cents/lb today.
But when it comes to arbitraging spot material, the clear winner is European SBR moving to the ?xml:namespace>
While Asian and European spot BD are priced below or on par with US BD, the key is shipping. It costs about $150/tonne to bring SBR to the
Where are US SBR users getting their imported material? According to market sources, the cheapest material is coming from
US SBR costs more, sources said, because US BD prices are still too high.
The July contract price for US BD is 66 cents/lb, down by 8 cents/lb from the June contract price of 74 cents/lb and down nearly 20 cents/lb from the April price of 84 cents/lb.
BD spot prices in the
All of this has led US BD customers -- including SBR producers -- to push US producers to cut the August BD contract price by another 8 cents/lb to 58 cents/lb, sources said.
But even that may not be enough to make US BD (and SBR) competitive in a global market. That is because continued weakness in the replacement-tyre market, which uses about 80% of the SBR produced in the
The long-term outlook does not get much better. Market sources noted that expectations for a recovery in the global tyre market keep getting pushed further out.
Earlier this year, the expectation was that demand for replacement tyres would improve in the second half of 2013. Then, market sources said it would be first quarter 2014 before the tyre market recovered. Now, the view is sometime in the first half of 2014, if then.
"I've stopped trying to guess," said one market source. "The truth is, no one knows, and the macroeconomic fundamentals that would be needed to turn around that market aren't looking good."
US producers of BD include ExxonMobil, LyondellBasell, Shell and TPC Group. SBR producers | http://www.icis.com/Articles/2013/07/11/9686869/bd-and-sbr-are-in-freefall-but-the-arbitrage-play-is-on-sbr.html | CC-MAIN-2014-49 | refinedweb | 426 | 70.94 |
.
This is my test code, which is in Scala by the way:
import java.text.SimpleDateFormat import java.util.Date import java.util.TimeZone import java.util.Locale val sdf = new SimpleDateFormat("EEE, dd MMM yyyy HH:mm:ss zzz", Locale.US) format.sdf(TimeZone.getTimeZone("GMT")) println(sdf.format(new Date())) println(sdf.parse("Mon, 02 Jun 2008 15:30:42 GMT"))
This got me wondering if I needed to make my code smart enough to handle different timezones and locales. Checking the Hypertext Transfer Protocol — HTTP/1.1 RFC (RFC2616) gave me the answer. From section 3.3.1 Full Date:
.”
Nice, my code is sufficient 🙂 | https://nidkil.me/2014/10/27/is-the-http-header-last-modified-always-in-gmt/ | CC-MAIN-2021-10 | refinedweb | 108 | 56.21 |
Build a Webhook for a Chatbot using Python
You will learn
- How to create a Python endpoint in SAP Cloud Platform, using Flask
- How to read POST data from a chatbot
- How to send back data to a chatbot
- How to deploy a Python script to SAP Cloud Platform (using Cloud Foundry CLI)
- How to connect the webhook to the chatbot
Prerequisites
- A SAP Cloud Platform trial account. If you create a new trial account you should have the necessary entitlements, but check the tutorial Manage Entitlements on SAP Cloud Platform Trial, if needed.
- You understand the basics of creating a chatbot, as described in the tutorial Build Your First Chatbot with SAP Conversational AI.
- Python
- VS Code with the Python extension by Microsoft, though you can use any Python development environment. See Getting Started with Python in VS Code.
- Flask and requests packages for Python
- Cloud Foundry CLI
You will create a very simple chatbot that asks the user to pick an animal, and then have the chatbot call a webhook, which will then call an API to retrieve a “fun fact” about the animal via the
cat-facts API. The webhook will also update the memory variable that keeps track of how many times the user requested a fun fact.
The point of the tutorial is to show you how the webhook reads the request data from the chatbot, and to show you the format of the data that must be returned to the chatbot.
As an added bonus, we will show how to deploy a Python script to SAP Cloud Platform. Special thanks to Yohei Fukuhara for his blog Create simple Flask REST API using Cloud Foundry.
Create a bot that asks the user to select an animal to get a fun fact about.
Create a new bot and call it
webhookdemo. Use the following values:
Click Create Bot.
In the Train tab, create an intent called
ask, and add the expression I’m interested in.
Since you define only one intent, this intent will always be triggered when the user types in a message.
In the Train tab, create a restricted entity called
animaland add 4 valid values: cat, horse, snail, dog.
In the Build tab, create a skill called answer, and open it.
Under Triggers, set the condition to:
If @ask is-present.
Under Requirements, specify
#animal as animal.
Expand the requirement and click New Replies – If #animal is missing, add the following text message, and then click Save and Back:
Type an animal and I will get you a fun fact about it. But I am only familiar with certain animals.
First, open the Test tab and test the bot. No matter what you type the intent will be
ask.
Enter
dogand it will recognize the
animalentity, too.
Now open Chat With Your Bot.
If you enter anything that does not match the animals, a short message is displayed and it asks you to enter an animal.
Enter one of the animals. Now the requirement is met but you did not define a reply so the default No reply is sent.
In the file explorer, create a new folder for the project and call it
chatbot-webhook.
Open VS Code.
Make sure you have installed the Microsoft extension for Python, as well as Python and the Flask and requests packages.
Go to File > Add Folder to Workspace, and select the project folder.
Inside the folder, create the helper files for the project
manifest.yml
applications: - memory: 128MB disk_quota: 256MB random-route: true
Procfile
web: python chatbot-webhook.py
requirements.txt
This file contains dependencies in our project: Flask to create endpoints and requests to call other APIs from within our app.
Flask requests
runtime.txt
The first time I tried this I was using version 3.6.6, but that did not work for me, and somehow figured out that this version worked.
python-3.8.1
You need to verify what Python versions are supported by SAP CLoud Platform. At the time of the writing of this tutorial, 3.8.1 was supported.
static(folder)
Create the folder
static. Download the SAP Conversational AI icon and place it in the folder.
Your project should look like this:
Now we will write the main part of the app, which creates the endpoints.
In your project, create a new file called
chatbot-webhook.py.
Add the following code – which adds dependencies and creates a default endpoint, which returns a nice HTML page with a cool image, so you will be able to make sure the deployment was successful.
from flask import Flask, request, jsonify import os import json import datetime import requests app = Flask(__name__) cf_port = os.getenv("PORT") # Only get method by default @app.route('/') def hello(): return '<h1>SAP Conversational AI</h1><body>The animal facts webhook for use in SAP Conversational AI chatbots.<br><img src="static/283370-pictogram-purple.svg" width=260px></body>' if __name__ == '__main__': if cf_port is None: app.run(host='0.0.0.0', port=5000, debug=True) else: app.run(host='0.0.0.0', port=int(cf_port), debug=True)
Save the file.
If you want, you can test this in VS Code by running the
.pyfile – either by right-clicking the file and choosing Run Python File in Terminal or clicking the green arrow
in the upper right. You will get the following:
You can then open a browser to the default endpoint.
Add the following code for the main endpoint right after the default one – and before the
if __name__ == '__main__':line.
This endpoint takes the data from the chatbot, makes the call to the API to get the fun fact, and then returns the next message to the chatbot.
@app.route('/bot', methods=['POST']) def bot(): # Get the request body, and determine the dog and memory try: bot_data = json.loads(request.get_data()) animal = bot_data['conversation']['memory']['animal']['raw'] memory = bot_data['conversation']['memory'] except: animal = "dog" memory = json.loads("{}") # Get the fun fact url = "" + animal + "&amount=1" r = requests.get(url) fact_data = json.loads(r.content) # Increment the # of times this has been called if 'funfacts' in memory: memory['funfacts'] += 1 else: memory['funfacts'] = 1 # Return message to display (replies) and update memory return jsonify( status=200, replies=[ { 'type': 'text', 'content': fact_data['text'] } ], conversation={ 'memory': memory } )
Save the file.
You can test this by opening Postman, and calling the endpoint
localhost:5000/bot(with POST method and no body).
Test it again but this time sending the following (raw) body, to simulate as if the chatbot were sending the request:
{ "conversation": { "memory": { "animal" : {"raw" : "snail"}, "funfacts": 1 } } }
Now, the API call uses the animal from the body (i.e., snail) and updates the
funfactsvariable in the memory.
Use the Cloud Foundry CLI to deploy the script to SAP Cloud Platform.
You will need your SAP Cloud Platform Cloud Foundry endpoint and org name, which you can see when you open your subaccount Overview page.
Open a command prompt in the folder containing your Python project, and set the Cloud Foundry API URL.
cf api
Log in by entering the following command and entering your credentials:
cf login
Select your CF org.
Now push the application, and call it
catfacts:
cf push catfacts
You should now have the application deployed. Go to your Cloud Foundry space, under Applications.
If you click the app, you will get the endpoint link.
And if you click the link (and open it in browser), you will be making a
GET call to the default endpoint.
Now that you deployed your webhook, let’s attach it to the chatbot.
In the Build tab, open the
answerskill.
In the Actions tab, click Add New Message Group, and then click Connect External Service > Call Webhook.
For the URL, enter the name of your endpoint with
/botat the end. Make sure the method is POST.
For example, mine is:
Click Save.
Click Update Conversation > Edit Memory, and then set the Unset memory field to
animal.
Click Add New Message Group.
This message group is to display a message when the user has requested 3 or more fun facts. Our webhook is keeping track of the number of calls, and then passing the results via the memory.
Set the condition to
If _memory.funfacts is 3.
Add a text message that says: WOW!! You sure like these fun facts!!
Open a conversation with the bot, by entering Hi. The message when an animal is missing is displayed.
Then enter an animal, and the webhook is triggered and a fun fact is displayed.
Enter an animal 2 more times – must be cat, dog, snail, or horse. The extra message is displayed for when the user repeatedly asks for fun facts.
Click on the yellow i icon to see the JSON of the conversation. Scroll down and you can see that the webhook added to the memory the value for
funfacts.
You demonstrated the way to return information to the memory from the webhook, so you kept track via a custom memory variable
_memory.funfactsof how many times the current user requested a fun fact.
You could have instead used the built-in variable
_skill_occurencesto keep track of how many times you executed the
answerskill.
For information on built-in variables, see Runtime Data Accessible. | https://developers.sap.com/tutorials/conversational-ai-webhook-script-python.html | CC-MAIN-2020-40 | refinedweb | 1,548 | 64.81 |
Using events in odelay with multiple equations
Posted September 19, 2013 at 10:33 AM | categories: odes | tags: events | View Comments
odelay was recently updated to support multiple odes with events. Here is an example. We want the solutions to:
with initial conditions \(y_1(0) = 2\) and \(y_2(0) = 1\). We want to stop the integration when \(y_2 = -1\) and find out when \(dy_1/dx=0\) and at a maximum.
from pycse import odelay import matplotlib.pyplot as plt import numpy as np def ode(Y,x): y1, y2 = Y dy1dx = y2 dy2dx = -y1 return [dy1dx, dy2dx] def event1(Y, x): y1, y2 = Y value = y2 - (-1.0) isterminal = True direction = 0 return value, isterminal, direction def event2(Y, x): dy1dx, dy2dx = ode(Y,x) value = dy1dx - 0.0 isterminal = False direction = -1 # derivative is decreasing towards a maximum return value, isterminal, direction Y0 = [2.0, 1.0] xspan = np.linspace(0, 5) X, Y, XE, YE, IE = odelay(ode, Y0, xspan, events=[event1, event2]) plt.plot(X, Y) for ie,xe,ye in zip(IE, XE, YE): if ie == 1: #this is the second event y1,y2 = ye plt.plot(xe, y1, 'ro') plt.legend(['$y_1$', '$y_2$'], loc='best') plt.savefig('images/odelay-mult-eq.png') plt.show()
Here are the plotted results:
Copyright (C) 2013 by John Kitchin. See the License for information about copying. | http://kitchingroup.cheme.cmu.edu/blog/category/odes/ | CC-MAIN-2020-05 | refinedweb | 227 | 58.69 |
Hello daniweb community,
i'm new to all this and i'm pretty happy that found this. Anyway i'm having sevral issues. Frist one is: my Python GUI (IDLE) won't open program.
def num(n): count=0 while count <= abs(n): count = count + 1 n= abs(n)/10 print count num(-23)
This code is problem. It's quite odd, but when i copy it at, and try output
it's working fine. However, if i open it from notepad ++ (choosing to rn that python gui idle), and doesn't show any output in python active shell. (and this working for other programs well).
EDIT:
updated program so it works with negative values | https://www.daniweb.com/programming/software-development/threads/348442/python-progmas-issue | CC-MAIN-2018-17 | refinedweb | 115 | 83.86 |
C# Interview Questions and Answers
C# What are the differences between Abstract and interface? Ans:’t have a chance to declare other specifiers. In abstract we have chance to declare with any access specifier. How do you prevent a class from being inherited? The sealed keyword prohibits a class from being inherited.
Page 1 of 9
C#.
How many types of memories are there in .net? Ans: Two types of memories are there in .net stack memory and heap memory What is the difference between primary key and unique key with not null? Ans: There is no difference between primary key and unique key with not null. What is boxing and unboxing concepts in .net? Ans: Boxing is a process of converting value type into reference type Unboxing is a process of converting reference type to value type. What are the differences between value type and reference type? Ans: Value type contain variable and reference type are not containing value directly in its memory. Memory is allocated in managed heap in reference type and in value type memory allocated in stack. Reference type ex-class value type-struct, enumeration What do you mean by String objects are immutable? String objects are immutable as its state cannot be modified once created. Every time when we perform any operation like add, copy, replace, and case conversion or when we pass a string object as a parameter to a method a new object will be created. Example: String str = "ABC"; str.Replace("A","X"); Here Replace() method will not change data that "str" contains, instead a new string object is created to hold data "XBC" and the reference to this object is returned by Replace() method. So in order to point str to this object we need to write below line. str = str.Replace("A","X"); Now the new object is assigned to the variable str. earlier object that was assigned to str will take care by garbage collector as this one is no longer in used. What is dll hell problem in .NET and how it will solve? Ans: Dll hell is kind of conflict that occurred previously, due to the lack of version supportability of dll for (within) an application .NET Framework provides operating system with a global assembly cache. This cache is a repository for all the .net components that are shared globally on a particular machine. When a .net component installed onto the machine, the global assembly cache looks at its version, its public key and its language information and creates a strong name for the component. The component is then registered in the repository and indexed by its strong name, so there is no confusion between the different versions of same component, or DLL
Page 2 of 9
C# What is a Partial class? Instead of defining an entire class, you can split the definition into multiple classes by using partial class keyword. When the application compiled, c# compiler will group all the partial classes together and treat them as a single class. There are a couple of good reasons to use partial classes. Programmers can work on different parts of classes without needing to share same physical file Ex: Public partial class employee { Public void somefunction() { } } Public partial class employee { Public void function () { } } What is difference between constants, read-only and, static? Constants: The value can’t be changed Read-only: The value will be initialized only once from the constructor of the class. Static: Value can be initialized once. How to get the version of the assembly? Ans: lbltxt.text=Assembly. GetExecutingAssembly().GetName().Version.ToString(); What is the GAC? The GAC is the Global Assembly Cache. Shared assemblies reside in the GAC; this allows applications to share assemblies instead of having the assembly distributed with each application. What is the location of Global Assembly Cache on the system? Ans: c:\Windows\assembly What is the serialization? Ans: Serialization is a process of converting object into a stream of bites. What is synchronization? Ans: What are the thread priority levels? Ans: Thread priority levels are five types 0 - Zero level 1 - Below Normal 2 - Normal 3 - Above Normal 4 - Highest By Default priority level is 2
Page 3 of 9
C# What is the difference between .tostring(), Convert.tostring()? Ans: The basic difference between them is “Convert” function handles NULLS while “.ToString()” does not it will throw a NULL reference exception error. So as a good coding practice using “convert” is always safe. What is static keyword in .Net? Ans: Static is same as constant variable but we can change the value of static variable and we can access the variables without creating any instances What do you mean by Early and Late Binding? Early binding - Assigning values to variables during design time or exposing object model at design time. Late Binding - Late binding has the same effect as early binding. The difference is that you bind the object library in code at run-time How is method overriding different from method overloading? When overriding a method, you change the behavior of the method for the derived class. Overloading a method simply involves having another method with the same name within the class. What is the difference between ref & out parameters? An argument passed to a ref parameter must first be initialized. Compare this to an out parameter, whose argument does not have to be explicitly initialized before being passed to an out parameter. What is serialization? Serialization is the process of converting an object into a stream of bytes. De-serialization is the opposite process of creating an object from a stream of bytes. Serialization / De-serialization is mostly used to transport objects. What are the difference between Structure and Class? Structures are value type and Classes are reference type Structures cannot have contractors or destructors. Classes can have both contractors and destructors. Structures do not support Inheritance, while Classes support Inheritance. What is Delegates? Delegates are a type-safe, object-oriented implementation of function pointers and are used in many situations where a component needs to call back to the component that is using it. What are value types and reference types? Value types are stored in the Stack. Examples : bool, byte, chat, decimal, double, enum , float, int, long, sbyte, short, strut, uint, ulong, ushort. Reference types are stored in the Heap. Examples : class, delegate, interface, object, string..
Page 4 of 9
C# What is the difference between Array and Arraylist? An array is a collection of the same type. The size of the array is fixed in its declaration. A linked list is similar to an array but it doesn’t have a limited size. Is String is Value Type or Reference Type in C#? String is an object(Reference Type). Why is the virtual keyword used in code? The Virtual keyword is used in code to define methods and the properties that can be overridden in derived classes. Which namespace enables multithreaded programming in XML? System.Threading What is Static Method? It is possible to declare a method as Static provided that they don't attempt to access any instance data or other instance methods. What is lock statement in C#? Lock ensures that one thread does not enter a critical section of code while another thread is in the critical section. If another thread attempts to enter a locked code, it will wait, block, until the object is released. What is Reflection? Enables us to get some information about objects in runtime Difference Between dispose and finalize method? Dispose is a method for realse from the memory for an object. For eg: <object>.Dispose. Finalize is used to fire when the object is going to realize the memory.We can set a alert message to says that this object is going to dispose. Which namespace is required to use Generic List? System.Collections.Generic What’s a delegate? A delegate object encapsulates a reference to a method. When do you absolutely have to declare a class as abstract? 1. When the class itself is inherited from an abstract class, but not all base abstract methods have been overridden. 2. When at least one of the methods in the class is abstract. How to create a strong name? To create a strong name key use following code C:\>sn -k s.snk Strong name key is used to specify the strong name used to deploy any application in the GAC (Global Assembly Catch) in the system. What is operator overloading in C#? Operator overloading is a concept that enables us to redefine (do a special job) the existing operators so that they can be used on user defined types like classes and structs. Difference between Static and ReadOnly? Static: A variable that retains the same data throughout the execution of a program. ReadOnly: you can’t change its value.
Page 5 of 9
C# Difference Between String and StringBuilder? String Class Once the string object is created, its length and content cannot be modified. Slower StringBuilder Even after object is created, it can be able to modify length and content. Faster Give Some Examples of Generic Classes? List<T>,Queue<T>,Stack<T>,LinkedList<T>,HashSet<T> Explain Queue and Stack A Queue is a collection where elements are processed in First in First Out(FIFO) Stack is collection where elements are processed in Last In First Out What is the difference between Parse and TryParse method? Parse method is used to parse any value to specified data type. TryParse is a good method if the string you are converting to an interger is not always numeric.The TryParse method returns a boolean to denote whether the conversion has been successfull or not How can you make your machine shutdown from your program? Process.Start("shutdown", "-s -f -t 0"); What is the use of ?? operator in C#? This operator allows you to assign a value to a nullable type if the retrieved value is in fact null. Why 'static' keyword is used before Main()? Program execution starts from Main(). S it should be called before the creation of any object. By using static the Main() can now be called directly through the class name and there is no need to create the object to call it. So Main() is declared as static. Can we declare a class as Protected? No, a class can not be declared as Protected. What is the difference between IQueryable<T> and IEnumerable<T> interface? IEnumerable<T> IEnumerable<T> is best suitable for working with in-memory collection. IEnumerable<T> doesn't move between items, it is forward only collection. IQueryable<T> IQueryable<T> best suits for remote data source, like a database or web service. IQueryable<T> is a very powerful feature that enables a variety of interesting deferred execution scenarios (like paging and composition based queries). So when you have to simply iterate through the in-memory collection, use IEnumerable<T>, if you need to do any manipulation with the collection like Dataset and other data sources, use IQueryable<T>. Define different Access modifiers in C# The access modifier is the key of Object Oriented Programming, to promote encapsulation, a type in C# should limit its accessibility and this accessibility limit are specified using Access modifiers. They are - Public, Internal, Protected, Private, Protected Internal Public: When used that type (method or variable) can be used by any code throughout the project without any limitation. This is the widest access given to any type and we should use it very judiciously. By default, enumerations and interface has this accessibility. Internal: When used that type can be used only within the assembly or a friend assembly (provided accessibility is specified using InternalVisibleTo attribute). Here assembly means a .dll.
Page 6 of 9
C# For example if you have a .dll for a Data Access Layer project and you have declared a method as internal, you will not be able to use that method in the business access layer) Similarly, if you have a website (not web application) and you have declared internal method in a class file under App_Code then you will not be able to use that method to another class as all classes in website is compiled as a separate .dll when first time it is called). Internal is more limited than Public. Protected When used that type will be visible only within that type or sub type. For example, if you have a aspx page and you want to declare a variable in the code behind and use it in aspx paeg, you will need to declare that variable as at least protected (private will not work) as code behind file is inherited (subclass) by the aspx page. Protected is more secure than Internal. Private When used that type will be visible only within containing type. Default access modifier for methods, variables. For example, if you have declared a variable inside a method, that will be a private variable and may not be accessible outside that method. Private is the most secure modifiers than any other access modifiers as it is not accessible outside. Protected Internal This is not a different type of access modifiers but union of protected and internal. When used this type will be accessible within class or subclass and within the assembly. What is the use of virtual, sealed, override, and abstract? • The • The • The • The make
use of virtual keyword is to enable or to allow a class to be overridden in the derived class. use of sealed keyword is to prevent the class from overridden i.e. you can’t inherit sealed classes. use of override keyword is to override the virtual method in the derived class. use of abstract keyword is to modify the class, method, and property declaration. You cannot directly calls to an abstract method and you cannot instantiate an abstract class.
Does the finally block execute even when we have unhandled exceptions? Yes, the finally block executes even if the exception is unhandled What is Value Types versus Reference Types? The. The basic difference between them is, how they are handled inside the memory. How can we sort elements in an array in descending order ? We have 2 different methods like Array.Sort()---> Which sorts the given array Array.Reverse()---> Which reverses the array What are the different Name Spaces that are used to create a localized application? There are 2 different name spaces required to create a localized application they are
. System.globalization . System.Resource MultiThreading: A multithreaded application allows you to run several threads, each thread runs in its own process. So that you can run step1 in one thread and step 2 in another thread at the same time. Can multiple catch blocks be executed? No What method is used to stop a running thread? Thread.Abort
Page 7 of 9
C# What is the difference between DirectCast and CType ? DirectCast requires the object variable to be the same in both the run-time type and the specified type. If the specified type and the run-time type of the expression are the same, then the run-time performance of DirectCast is better than that of CType. Ctype works fine if there is a valid conversion defined between the expression and the type. What is IDisposable interface in .NET? IDisposable interface is used to release the unmanaged resources in a program. Explain Boxing and unboxing in c#? Boxing and unboxing in c# Boxing is the process of converting a value type to the reference type. Unboxing is the process of converting a reference type to value type. How to copy one array into another array ? We can copy one array into another array by using copy To() method. How to get the total number of elements in an array ? By using Length property, we can find the total number of elements in an array. What is serialization? While sending an object from a source to destination, an object will be converted into a binary/xml format. This process is called serialization . Thread.Sleep(int) method the integer parameter that represents Time that particular Thread should wait. What that Time Unit represents ? Time in MilliSeconds What is the difference between ArrayList and Generic List in C#? Generic collections are TypeSafe at compile time. So No type casting is required. But ArrayList contains any type of objects in it What is the difference between IEnumerable and IList? IEnumerable<T> represents a series of items that you can iterate over IList<T> is a collection that you can add to or remove from. What is difference between is and as operators in c#? “is” operator is used to check the compatibility of an object with a given type and it returns the result as Boolean. “as” operator is used for casting of object to a type or a class. | https://issuu.com/sanjeevdas/docs/csharp_qna | CC-MAIN-2017-04 | refinedweb | 2,815 | 57.37 |
Story without using the storyboard.
1. Create iOS App Without Storyboard Steps.
- Create an iOS Xcode project, and use single view app template.
- Right click the Main.storyboard file in Xcode project left navigation panel, then click Delete menu item in the popup menu list to remove the Main.storyboard file from the Xcode project.
- Click the Xcode project name in left project navigator panel, then in center panel, click the default target under TARGETS item. Click the General tab at the top tab bar, then scroll down to the Deployment Info section, remove the Main text in the Main Interface drop down list. Now when the iOS app run, it can not locate and use the Main.storyboard file.
- After above configuration, if you run the iOS app, you will get a black screen. So you need to do below coding.
- First you need to override func application(_ application: UIApplication, didFinishLaunchingWithOptions launchOptions: [UIApplication.LaunchOptionsKey : Any]?) -> Bool in the project AppDelegate.swift file like below. This function is called when the iOS app launching process finished. It will create a UIViewController object and set it as the app window’s root view { // if self.window is nil then set a new UIWindow object to self.window. self.window = self.window ?? UIWindow() // Set self.window's background color to red. self.window!.backgroundColor = UIColor.red // Create a ViewController object and set it as self.window's root view controller. self.window!.rootViewController = ViewController() // Make the window be visible. self.window!.makeKeyAndVisible() return true } }
- Then you need to add below code in the project ViewController.swift file to override the viewDidLoad function. It will add a subview object to the ViewController’s root view when the ViewController object is loaded.
import UIKit class ViewController: UIViewController { override func viewDidLoad() { super.viewDidLoad() // Create a CGRect object with provided position and size value. let viewRectFrame = CGRect(x:CGFloat(30), y:CGFloat(100), width:CGFloat(300), height:CGFloat(300)) // Create a UIView object use above CGRect object. let view = UIView(frame:viewRectFrame) // Set UIView object's background color. view.backgroundColor = UIKit.UIColor.green // Set UIView object's transparency value, 1 means not transparent. view.alpha = CGFloat(1) // Add the view object to the ViewController. self.view.addSubview(view) } }
- Now when you run the iOS app, you will get below picture, a green rectangle sub view is added in the red window. | https://www.dev2qa.com/how-to-create-a-swift-app-without-storyboard/ | CC-MAIN-2021-31 | refinedweb | 396 | 60.41 |
Created on 2006-04-13 05:04 by dobesv, last changed 2012-03-09 08:55 by eric.snow. This issue is now closed.
Using:
ActivePython 2.4.2 Build 10 (ActiveState Corp.) based
on
Python 2.4.2 (#67, Jan 17 2006, 15:36:03) [MSC v.1310
32 bit (Intel)] on win32
For reasons I do not understand, the following class
leaks itself continuously:
class AttrDict(dict):
def __init__(self, *args, **kw):
dict.__init__(self, *args, **kw)
self.__dict__ = self
Whereas this version does not:
class AttrDict(dict):
def __init__(self, *args, **kw):
dict.__init__(self, *args, **kw)
def __getattr__(self, key):
return self[key]
def __setattr__(self, key, value):
self[key] = value
My test looks like this:
for n in xrange(1000000):
import gc
gc.collect()
ad = AttrDict()
ad['x'] = n
ad.y = ad.x
print n, ad.x, ad.y
And I sit and watch in the windows task manager while
the process grows and grows. With the __getattr__
version, it doesn't grow.
Logged In: YES
user_id=4771
This is caused by the tp_clear not doing its job --
in this case, tp_clear is subtype_clear(), which does
not reset the __dict__ slot to NULL because it assumes
that the __dict__ slot's content itself will be cleared,
which is perfectly true but doesn't help if self.__dict__
is self.
Attached a patch to fix this. It's kind of hard to
test for this bug because all instances of AttrDict
are really cleared, weakrefs to them are removed,
etc.
Also attached is an example showing a similar bug: a
cycle through the ob_type field, with a object U
whose class is itself. It is harder to clear this
link because we cannot just set ob_type to NULL in
subtype_clear. Ideas welcome...
Logged In: YES
user_id=33168
Armin, why not just check any leaking test cases into
Lib/test/leakers? I have no idea if your patch is correct
or not. I wouldn't be surprised if there are a bunch more
issues similar to this. What if you stick self in
self.__dict__ (I'm guessing this is ok, but there are a
bunch of variations) or start playing with weakrefs?
Attached test case demonstrates the leak.
I've reproduced this problem with 2.7, 3.1 and 3.2.
Added the two tests in Lib/test/leakers as r45389 (in 2006) and r84296 (now).
Could this patch please be committed to Python? We have just run into this problem in production, where our own variant of AttrDict was shown to be leaking.
It is possible to work around the problem by implementing explicit __getattr__ and __setattr__, but that is both slower and trickier to get right.
New changeset 3787e896dbe9 by Benjamin Peterson in branch '3.2':
allow cycles throught the __dict__ slot to be cleared (closes #1469629)
New changeset c7623da4e2af by Benjamin Peterson in branch '2.7':
allow cycles throught the __dict__ slot to be cleared (closes #1469629) | http://bugs.python.org/issue1469629 | CC-MAIN-2015-22 | refinedweb | 494 | 75.61 |
THE ANNOYANCE: Certain programs never seem to open successfully. If I double-click a JPG file, for instance, my image viewer never launchesI see its icon in the Taskbar, but that's it. Clicking the icon doesn't do anything; the only thing that has any effect is right-clicking it and selecting Close to make it go away.
THE FIX: Although it may seem that the program has crashed, it's probably opening off-screen. Most programs can remember their last position and size, but few are smart enough to realize that they can't be seen. To find out if an application has opened off-screen, click its Taskbar icon so that it appears pushed in, and then press Alt-Space. If a little menu appears, use the cursor keys to select Move, and then press Enter. At this point, a gray rectangle should appear somewhere on your screen; use your cursor keys to move the rectangle so that it's roughly centered on the desktop, and then press Enter. With any luck, the missing window should magically appear.
If you don't see the menu, minimize all open windows and see if there's a dialog box for the program hiding behind them (in which case, you can click OK or whatever to make it go away). If there's no dialog box, uninstall and then reinstall the program. Still no luck? Contact the manufacturer of the misbehaving application for help.
Underneath the purring Windows interface is a wellhidden facility called DDE (short for Dynamic Data Exchange) that allows applications to communicate with one another. DDE frequently comes into play when you double-click documents in Windows Explorer, in an open folder window, or on the desktop. If the application associated with a document is not running, Explorer launches the application and the document simultaneously. But if the application is already running, Explorer merely sends a DDE message to the application, instructing it to open the document on its own. This should ensure that only one copy (instance) of a program is open at any given time.
Unfortunately, DDE ends up causing the exact problem it was designed to prevent. In some cases, Explorer opens a document and its application (like it's supposed to), and then sends a DDE message to the application instructing it to open a second copy of the file. The solution? Disable DDE. Although you can't turn off DDE entirely (nor would you want to), you can solve the problem by selectively disabling DDE support for certain file types, as explained in "Seeing Double Windows."
THE ANNOYANCE: Whenever I double-click a document in Windows Explorer or on the desktop, it opens in two identical windows. Is Windows really that stupid?
THE FIX: Yes, my son, Windows really is that stupid. Luckily, the fix is simple enough, but you must first determine the type of file that causes the problem.
In Windows Explorer, select Tools Folder Options or open the Folder Options control panel, and choose the File Types tab. Find the appropriate filename extension in the list, and click the Advanced button. (If you see a Restore button here, click it to reveal the elusive Advanced button, and then click Advanced.)
In the subsequent dialog box (shown in Figure 1-19), highlight the bold item in the listin this case, Openand click the Edit button. In the "Editing action for type" window, uncheck the Use DDE box (see the "Evils of DDE" sidebar), and then click OK in each successive dialog box to confirm your choice. The duplicate windows should never return (at least until you reinstall the application, and in so doing, reinstall the DDE setting).
THE ANNOYANCE: I'm using an older program that's really showing its age. How can I make it look like the rest of my applications?
THE FIX: The style you choose in Display Properties affects not only the title bars of your applications, but also the push buttons, menus, toolbars, drop-down lists, and other screen elements in most, if not all, programs that run in Windows. Some older applications, though, may not know to take advantage of these new features.
To force a single application to update all of its push buttons, menus, and so on, type the following into a plain-text editor such as Notepad:
<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
<assembly xmlns="urn:schemas-microsoft-com:asm.v1" manifestVersion="
1.0"><assemblyIdentity version="1.0.0.0" processorArchitecture="X86"
name="COMPANYNAME.PRODUCTNAME.PROGRAMNAME" type="win32"/><description>MY
DESCRIPTION</description>
<dependency><dependentAssembly><assemblyIdentity type="win32"
name="Microsoft.Windows.Common-Controls" version="6.0.0.0"
processorArchitecture="X86" publicKeyToken="6595b64144ccf1df"
language="*" /></dependentAssembly></dependency></assembly>
Save this text into the same folder as the application you're customizing, and give it the same name as the main executable (.exe) file, followed by .manifest. For example, if you were trying to update an old version of Adobe Photoshop (photoshp.exe) installed in the c:\Program Files\Adobe\Photoshop folder, you'd save this text file in the same folder, as Photoshp.exe.manifest.
The next time you start the application, it should look more up to date. Not all programs can be forced to use styles this way, though, and those that support it may not do so properly. | http://etutorials.org/Misc/windows+annoyances/Chapter+1.+Windows+Interface/Section+1.5.+APPLICATION+WINDOW/ | CC-MAIN-2017-04 | refinedweb | 890 | 53.41 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.