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 |
|---|---|---|---|---|---|
import "github.com/weaveworks/flux/pkg/errors"
const ( // The operation looked fine on paper, but something went wrong Server Type = "server" // The thing you mentioned, whatever it is, just doesn't exist Missing = "missing" // The operation was well-formed, but you asked for something that // can't happen at present (e.g., because you've not supplied some // config yet) User = "user" )
type Error struct { Type Type // a message that can be printed out for the user Help string `json:"help"` // the underlying error that can be e.g., logged for developers to look at Err error }
Representation of errors in the API. These are divided into a small number of categories, essentially distinguished by whose fault the error is; i.e., is this error:
- a transient problem with the service, so worth trying again? - not going to work until the user takes some other action, e.g., updating config?
Package errors imports 2 packages (graph). Updated 2019-09-29. Refresh now. Tools for package owners. | https://godoc.org/github.com/weaveworks/flux/pkg/errors | CC-MAIN-2020-45 | refinedweb | 166 | 52.39 |
If you’ve read the Overview and Tutorial, you should already be familiar with how Fabric operates in the base case (a single task on a single host.) However, in many situations you’ll find yourself wanting to execute multiple tasks and/or on multiple hosts. Perhaps you want to split a big task into smaller reusable parts, or crawl a collection of servers looking for an old user to remove. Such a scenario requires specific rules for when and how tasks are executed.
This document explores Fabric’s execution model, including the main execution loop, how to define host lists, how connections are made, and so forth.
Fabric defaults to a single, serial execution method, though there is an alternative parallel mode available as of Fabric 1.3 (see Parallel execution). This default behavior is as follows:
Thus, given the following fabfile:
from fabric.api import run, env env.hosts = ['host1', 'host2'] def taskA(): run('ls') def taskB(): run('whoami')
and the following invocation:
$ fab taskA taskB
you will see that Fabric performs the following:
While this approach is simplistic, it allows for a straightforward composition of task functions, and (unlike tools which push the multi-host functionality down to the individual function calls) enables shell script-like logic where you may introspect the output or return code of a given command and decide what to do next.
For details on what constitutes a Fabric task and how to organize them, please see Defining tasks.
Unless you’re using Fabric as a simple build system (which is possible, but not the primary use-case) having tasks won’t do you any good without the ability to specify remote hosts on which to execute them. There are a number of ways to do so, with scopes varying from global to per-task, and it’s possible mix and match as needed.
Hosts, in this context, refer to what are also called “host strings”: Python strings specifying a username, hostname and port combination, in the form of username@hostname:port. User and/or port (and the associated @ or :) may be omitted, and will be filled by the executing user’s local username, and/or port 22, respectively. Thus, admin@foo.com:222, deploy@website and nameserver1 could all be valid host strings.
Note
The user/hostname split occurs at the last @ found, so e.g. email address usernames are valid and will be parsed correctly.
During execution, Fabric normalizes the host strings given and then stores each part (username/hostname/port) in the environment dictionary, for both its use and for tasks to reference if the need arises. See The environment dictionary, env for details.
Host strings map to single hosts, but sometimes it’s useful to arrange hosts in groups. Perhaps you have a number of Web servers behind a load balancer and want to update all of them, or want to run a task on “all client servers”. Roles provide a way of defining strings which correspond to lists of host strings, and can then be specified instead of writing out the entire list every time.
This mapping is defined as a dictionary, env.roledefs, which must be modified by a fabfile in order to be used. A simple example:
from fabric.api import env env.roledefs['webservers'] = ['www1', 'www2', 'www3']
Since env.roledefs is naturally empty by default, you may also opt to re-assign to it without fear of losing any information (provided you aren’t loading other fabfiles which also modify it, of course):
from fabric.api import env env.roledefs = { 'web': ['www1', 'www2', 'www3'], 'dns': ['ns1', 'ns2'] }
In addition to list/iterable object types, the values in env.roledefs may be callables, and will thus be called when looked up when tasks are run instead of at module load time. (For example, you could connect to remote servers to obtain role definitions, and not worry about causing delays at fabfile load time when calling e.g. fab --list.)
Use of roles is not required in any way – it’s simply a convenience in situations where you have common groupings of servers.
Changed in version 0.9.2: Added ability to use callables as roledefs values.
There are a number of ways to specify host lists, either globally or per-task, and generally these methods override one another instead of merging together (though this may change in future releases.) Each such method is typically split into two parts, one for hosts and one for roles.
The most common method of setting hosts or roles is by modifying two key-value pairs in the environment dictionary, env: hosts and roles. The value of these variables is checked at runtime, while constructing each tasks’s host list.
Thus, they may be set at module level, which will take effect when the fabfile is imported:
from fabric.api import env, run env.hosts = ['host1', 'host2'] def mytask(): run('ls /var/www')
Such a fabfile, run simply as fab mytask, will run mytask on host1 followed by host2.
Since the env vars are checked for each task, this means that if you have the need, you can actually modify env in one task and it will affect all following tasks:
from fabric.api import env, run def set_hosts(): env.hosts = ['host1', 'host2'] def mytask(): run('ls /var/www')
When run as fab set_hosts mytask, set_hosts is a “local” task – its own host list is empty – but mytask will again run on the two hosts given.
Note
This technique used to be a common way of creating fake “roles”, but is less necessary now that roles are fully implemented. It may still be useful in some situations, however.
Alongside env.hosts is env.roles (not to be confused with env.roledefs!) which, if given, will be taken as a list of role names to look up in env.roledefs.
In addition to modifying env.hosts, env.roles, and env.exclude_hosts at the module level, you may define them by passing comma-separated string arguments to the command-line switches --hosts/-H and --roles/-R, e.g.:
$ fab -H host1,host2 mytask
Such an invocation is directly equivalent to env.hosts = ['host1', 'host2'] – the argument parser knows to look for these arguments and will modify env at parse time.
Note
It’s possible, and in fact common, to use these switches to set only a single host or role. Fabric simply calls string.split(',') on the given string, so a string with no commas turns into a single-item list.
It is important to know that these command-line switches are interpreted before your fabfile is loaded: any reassignment to env.hosts or env.roles in your fabfile will overwrite them.
If you wish to nondestructively merge the command-line hosts with your fabfile-defined ones, make sure your fabfile uses env.hosts.extend() instead:
from fabric.api import env, run env.hosts.extend(['host3', 'host4']) def mytask(): run('ls /var/www')
When this fabfile is run as fab -H host1,host2 mytask, env.hosts will then contain ['host1', 'host2', 'host3', 'host4'] at the time that mytask is executed.
Note
env.hosts is simply a Python list object – so you may use env.hosts.append() or any other such method you wish.
Globally setting host lists only works if you want all your tasks to run on the same host list all the time. This isn’t always true, so Fabric provides a few ways to be more granular and specify host lists which apply to a single task only. The first of these uses task arguments.
As outlined in fab options and arguments, it’s possible to specify per-task arguments via a special command-line syntax. In addition to naming actual arguments to your task function, this may be used to set the host, hosts, role or roles “arguments”, which are interpreted by Fabric when building host lists (and removed from the arguments passed to the task itself.)
Note
Since commas are already used to separate task arguments from one another, semicolons must be used in the hosts or roles arguments to delineate individual host strings or role names. Furthermore, the argument must be quoted to prevent your shell from interpreting the semicolons.
Take the below fabfile, which is the same one we’ve been using, but which doesn’t define any host info at all:
from fabric.api import run def mytask(): run('ls /var/www')
To specify per-task hosts for mytask, execute it like so:
$ fab mytask:hosts="host1;host2"
This will override any other host list and ensure mytask always runs on just those two hosts.
If a given task should always run on a predetermined host list, you may wish to specify this in your fabfile itself. This can be done by decorating a task function with the hosts or roles decorators. These decorators take a variable argument list, like so:
from fabric.api import hosts, run @hosts('host1', 'host2') def mytask(): run('ls /var/www')
They will also take an single iterable argument, e.g.:
my_hosts = ('host1', 'host2') @hosts(my_hosts) def mytask(): # ...
When used, these decorators override any checks of env for that particular task’s host list (though env is not modified in any way – it is simply ignored.) Thus, even if the above fabfile had defined env.hosts or the call to fab uses --hosts/-H, mytask would still run on a host list of ['host1', 'host2'].
However, decorator host lists do not override per-task command-line arguments, as given in the previous section.
We’ve been pointing out which methods of setting host lists trump the others, as we’ve gone along. However, to make things clearer, here’s a quick breakdown:
This logic may change slightly in the future to be more consistent (e.g. having --hosts somehow take precedence over env.hosts in the same way that command-line per-task lists trump in-code ones) but only in a backwards-incompatible release.
There is no “unionizing” of hosts between the various sources mentioned in How host lists are constructed. If env.hosts is set to ['host1', 'host2', 'host3'], and a per-function (e.g. via hosts) host list is set to just ['host2', 'host3'], that function will not execute on host1, because the per-task decorator host list takes precedence.
However, for each given source, if both roles and hosts are specified, they will be merged together into a single host list. Take, for example, this fabfile where both of the decorators are used:
from fabric.api import env, hosts, roles, run env.roledefs = {'role1': ['b', 'c']} @hosts('a', 'b') @roles('role1') def mytask(): run('ls /var/www')
Assuming no command-line hosts or roles are given when mytask is executed, this fabfile will call mytask on a host list of ['a', 'b', 'c'] – the union of role1 and the contents of the hosts call.
At times, it is useful to exclude one or more specific hosts, e.g. to override a few bad or otherwise undesirable hosts which are pulled in from a role or an autogenerated host list.
Note
As of Fabric 1.4, you may wish to use skip_bad_hosts instead, which automatically skips over any unreachable hosts.
Host exclusion may be accomplished globally with --exclude-hosts/-x:
$ fab -R myrole -x host2,host5 mytask
If myrole was defined as ['host1', 'host2', ..., 'host15'], the above invocation would run with an effective host list of ['host1', 'host3', 'host4', 'host6', ..., 'host15'].
Note
Using this option does not modify env.hosts – it only causes the main execution loop to skip the requested hosts.
Exclusions may be specified per-task by using an extra exclude_hosts kwarg, which is implemented similarly to the abovementioned hosts and roles per-task kwargs, in that it is stripped from the actual task invocation. This example would have the same result as the global exclude above:
$ fab mytask:roles=myrole,exclude_hosts="host2;host5"
Note that the host list is semicolon-separated, just as with the hosts per-task argument.
Host exclusion lists, like host lists themselves, are not merged together across the different “levels” they can be declared in. For example, a global -x option will not affect a per-task host list set with a decorator or keyword argument, nor will per-task exclude_hosts keyword arguments affect a global -H list.
There is one minor exception to this rule, namely that CLI-level keyword arguments (mytask:exclude_hosts=x,y) will be taken into account when examining host lists set via @hosts or @roles. Thus a task function decorated with @hosts('host1', 'host2') executed as fab taskname:exclude_hosts=host2 will only run on host1.
As with the host list merging, this functionality is currently limited (partly to keep the implementation simple) and may be expanded in future releases.
New in version 1.3.
Most of the information here involves “top level” tasks executed via fab, such as the first example where we called fab taskA taskB. However, it’s often convenient to wrap up multi-task invocations like this into their own, “meta” tasks.
Prior to Fabric 1.3, this had to be done by hand, as outlined in Library Use. Fabric’s design eschews magical behavior, so simply calling a task function does not take into account decorators such as roles.
New in Fabric 1.3 is the execute helper function, which takes a task object or name as its first argument. Using it is effectively the same as calling the given task from the command line: all the rules given above in How host lists are constructed apply. (The hosts and roles keyword arguments to execute are analogous to CLI per-task arguments, including how they override all other host/role-setting methods.)
As an example, here’s a fabfile defining two stand-alone tasks for deploying a Web application:
from fabric.api import run, roles env.roledefs = { 'db': ['db1', 'db2'], 'web': ['web1', 'web2', 'web3'], } @roles('db') def migrate(): # Database stuff here. pass @roles('web') def update(): # Code updates here. pass
In Fabric <=1.2, the only way to ensure that migrate runs on the DB servers and that update runs on the Web servers (short of manual env.host_string manipulation) was to call both as top level tasks:
$ fab migrate update
Fabric >=1.3 can use execute to set up a meta-task. Update the import line like so:
from fabric.api import run, roles, execute
and append this to the bottom of the file:
def deploy(): execute(migrate) execute(update)
That’s all there is to it; the roles decorators will be honored as expected, resulting in the following execution sequence:
Warning
This technique works because tasks that themselves have no host list (this includes the global host list settings) only run one time. If used inside a “regular” task that is going to run on multiple hosts, calls to execute will also run multiple times, resulting in multiplicative numbers of subtask calls – be careful!
Once the task list has been constructed, Fabric will start executing them as outlined in Execution strategy, until all tasks have been run on the entirety of their host lists. However, Fabric defaults to a “fail-fast” behavior pattern: if anything goes wrong, such as a remote program returning a nonzero return value or your fabfile’s Python code encountering an exception, execution will halt immediately.
This is typically the desired behavior, but there are many exceptions to the rule, so Fabric provides env.warn_only, a Boolean setting. It defaults to False, meaning an error condition will result in the program aborting immediately. However, if env.warn_only is set to True at the time of failure – with, say, the settings context manager – Fabric will emit a warning message but continue executing.
fab itself doesn’t actually make any connections to remote hosts. Instead, it simply ensures that for each distinct run of a task on one of its hosts, the env var env.host_string is set to the right value. Users wanting to leverage Fabric as a library may do so manually to achieve similar effects (though as of Fabric 1.3, using execute is preferred and more powerful.)
env.host_string is (as the name implies) the “current” host string, and is what Fabric uses to determine what connections to make (or re-use) when network-aware functions are run. Operations like run or put use env.host_string as a lookup key in a shared dictionary which maps host strings to SSH connection objects.
Note
The connections dictionary (currently located at fabric.state.connections) acts as a cache, opting to return previously created connections if possible in order to save some overhead, and creating new ones otherwise.
Because connections are driven by the individual operations, Fabric will not actually make connections until they’re necessary. Take for example this task which does some local housekeeping prior to interacting with the remote server:
from fabric.api import * @hosts('host1') def clean_and_upload(): local('find assets/ -name "*.DS_Store" -exec rm '{}' \;') local('tar czf /tmp/assets.tgz assets/') put('/tmp/assets.tgz', '/tmp/assets.tgz') with cd('/var/www/myapp/'): run('tar xzf /tmp/assets.tgz')
What happens, connection-wise, is as follows:
Extrapolating from this, you can also see that tasks which don’t use any network-borne operations will never actually initiate any connections (though they will still be run once for each host in their host list, if any.)
Fabric’s connection cache never closes connections itself – it leaves this up to whatever is using it. The fab tool does this bookkeeping for you: it iterates over all open connections and closes them just before it exits (regardless of whether the tasks failed or not.)
Library users will need to ensure they explicitly close all open connections before their program exits. This can be accomplished by calling disconnect_all at the end of your script.
Note
disconnect_all may be moved to a more public location in the future; we’re still working on making the library aspects of Fabric more solidified and organized.
As of Fabric 1.4, multiple attempts may be made to connect to remote servers before aborting with an error: Fabric will try connecting env.connection_attempts times before giving up, with a timeout of env.timeout seconds each time. (These currently default to 1 try and 10 seconds, to match previous behavior, but they may be safely changed to whatever you need.)
Furthermore, even total failure to connect to a server is no longer an absolute hard stop: set env.skip_bad_hosts to True and in most situations (typically initial connections) Fabric will simply warn and continue, instead of aborting.
New in version 1.4.
Fabric maintains an in-memory, two-tier password cache to help remember your login and sudo passwords in certain situations; this helps avoid tedious re-entry when multiple systems share the same password [1], or if a remote system’s sudo configuration doesn’t do its own caching.
The first layer is a simple default or fallback password cache, env.password. This env var stores a single password which (if non-empty) will be tried in the event that the host-specific cache (see below) has no entry for the current host string.
env.passwords (plural!) serves as a per-user/per-host cache, storing the most recently entered password for every unique user/host/port combination. Due to this cache, connections to multiple different users and/or hosts in the same session will only require a single password entry for each. (Previous versions of Fabric used only the single, default password cache and thus required password re-entry every time the previously entered password became invalid.)
Depending on your configuration and the number of hosts your session will connect to, you may find setting either or both of these env vars to be useful. However, Fabric will automatically fill them in as necessary without any additional configuration.
Specifically, each time a password prompt is presented to the user, the value entered is used to update both the single default password cache, and the cache value for the current value of env.host_string.
Command-line SSH clients (such as the one provided by OpenSSH) make use of a specific configuration format typically known as ssh_config, and will read from a file in the platform-specific location $HOME/.ssh/config (or an arbitrary path given to --ssh-config-path/env.ssh_config_path.) This file allows specification of various SSH options such as default or per-host usernames, hostname aliases, and toggling other settings (such as whether to use agent forwarding.)
Fabric’s SSH implementation allows loading a subset of these options from one’s actual SSH config file, should it exist. This behavior is not enabled by default (in order to be backwards compatible) but may be turned on by setting env.use_ssh_config to True at the top of your fabfile.
If enabled, the following SSH config directives will be loaded and honored by Fabric: | http://docs.fabfile.org/en/1.4.1/usage/execution.html | CC-MAIN-2016-36 | refinedweb | 3,493 | 62.38 |
Red Hat Bugzilla – Bug 963207
heat missing dep to python-paste-deploy
Last modified: 2013-06-05 22:26:20 EDT
Description of problem:
[root@localhost ~]# heat
Traceback (most recent call last):
File "/usr/bin/heat", line 51, in <module>
from heat.common import config
File "/usr/lib/python2.7/site-packages/heat/common/config.py", line 30, in <module>
from heat.common import wsgi
File "/usr/lib/python2.7/site-packages/heat/common/wsgi.py", line 39, in <module>
from paste import deploy
after yum install python-paste-deploy, problem solved
Version-Release number of selected component (if applicable):
heat-7-1.fc18.noarch
How reproducible:
Steps to Reproduce:
1.
2.
3.
Actual results:
Expected results:
Additional info:
Jeff
Since this appears to be a fedora packaging problem could you check it out?
Thanks
-steve
openstack-heat-2013.1-1.4.fc19 has been submitted as an update for Fedora 19.
heat-7-3.fc19 has been submitted as an update for Fedora 19.
heat-7-2.fc18 has been submitted as an update for Fedora 18.
Package heat-7-3.fc19:
* should fix your issue,
* was pushed to the Fedora 19 testing repository,
* should be available at your local mirror within two days.
Update it with:
# su -c 'yum update --enablerepo=updates-testing heat-7-3.fc19'
as soon as you are able to.
Please go to the following url:
then log in and leave karma (feedback).
heat-7-3.fc19 has been pushed to the Fedora 19 stable repository. If problems still persist, please make note of it in this bug report.
openstack-heat-2013.1-1.4.fc19 has been pushed to the Fedora 19 stable repository. If problems still persist, please make note of it in this bug report. | https://bugzilla.redhat.com/show_bug.cgi?id=963207 | CC-MAIN-2017-39 | refinedweb | 294 | 59.19 |
Perhaps more exciting than just fills and strokes is the fact that you can also create and apply gradients as either fills or strokes.
There are two types of gradients: linear and radial. You must give the gradient an
id attribute; otherwise it can't be referenced by other elements inside the file. Gradients are defined in a defs section as opposed to on a shape itself to promote reusability.
Linear Gradient
Linear gradients change along a straight line. To insert one, you create a
<linearGradient> node inside the definitions section of your SVG file.
Basic example
<svg width="120" height="240" version="1.1" xmlns=""> <defs> <linearGradient id="Gradient1"> <stop class="stop1" offset="0%"/> <stop class="stop2" offset="50%"/> <stop class="stop3" offset="100%"/> </linearGradient> <linearGradient id="Gradient2" x1="0" x2="0" y1="0" y2="1"> <stop offset="0%" stop- <stop offset="50%" stop- <stop offset="100%" stop- </linearGradient> <style type="text/css"><![CDATA[ #rect1 { fill: url(#Gradient1); } .stop1 { stop-color: red; } .stop2 { stop-color: black; stop-opacity: 0; } .stop3 { stop-color: blue; } ]]></style> </defs> <rect id="rect1" x="10" y="10" rx="15" ry="15" width="100" height="100"/> <rect x="10" y="120" rx="15" ry="15" width="100" height="100" fill="url(#Gradient2)"/> </svg>
Above is an example of a linear gradient being applied to a
<rect> element. Inside the linear gradient are several
<stop> nodes. These nodes tell the gradient what color it should be at certain positions by specifying an
offset attribute for the position, and a
stop-color attribute. This can be assigned directly or through CSS. The two methods have been intermixed for the purposes of this example. For instance, this one tells the gradient to start at the color red, change to transparent-black in the middle, and end at the color blue. You can insert as many stop colors as you like to create a blend that's as beautiful or hideous as you need, but the offsets should always increase from 0% (or 0 if you want to drop the % sign) to 100% (or 1). Duplicate values will use the stop that is assigned furthest down the XML tree. Also, like with fill and stroke, you can specify a
stop-opacity attribute to set the opacity at that position (again, in FF3 you can also use rgba values to do this).
<stop offset="100%" stop-
To use a gradient, we have to reference it from an object's
fill or
stroke attributes. This is done the same way you reference elements in CSS, using a
url. In this case, the url is just a reference to our gradient, which I've given the creative ID, "Gradient". To attach it, set the
fill to
url(#Gradient), and voila! Our object is now multicolored. You can do the same with
stroke.
The
<linearGradient> element also takes several other attributes, which specify the size and appearance of the gradient. The orientation of the gradient is controlled by two points, designated by the attributes
x1,
x2,
y1, and
y2. These attributes define a line along which the gradient travels. The gradient defaults to a horizontal orientation, but it can be rotated by changing these. Gradient2 in the above example is designed to create a vertical gradient.
<linearGradient id="Gradient2" x1="0" x2="0" y1="0" y2="1">
xlink:hrefattribute on gradients too. When it is used, attributes and stops from one gradient can be included on another. In the above example, you wouldn't have to recreate all the stops in Gradient2.
<linearGradient id="Gradient1"> <stop id="stop1" offset="0%"/> <stop id="stop2" offset="50%"/> <stop id="stop3" offset="100%"/> </linearGradient> <linearGradient id="Gradient2" x1="0" x2="0" y1="0" y2="1" xmlns:I've included the xlink namespace here directly on the node, although usually you would define it at the top of your document. More on that when we talk about images.
Radial Gradient
Radial gradients are similar to linear ones but draw a gradient that radiates out from a point. To create one you add a
<radialGradient> element to the definitions section of your document.
Basic example
<?xml version="1.0" standalone="no"?> <svg width="120" height="240" version="1.1" xmlns=""> <defs> <radialGradient id="RadialGradient1"> <stop offset="0%" stop- <stop offset="100%" stop- </radialGradient> <radialGradient id="RadialGradient2" cx="0.25" cy="0.25" r="0.25"> <stop offset="0%" stop- <stop offset="100%" stop- </radialGradient> </defs> <rect x="10" y="10" rx="15" ry="15" width="100" height="100" fill="url(#RadialGradient1)"/> <rect x="10" y="120" rx="15" ry="15" width="100" height="100" fill="url(#RadialGradient2)"/> </svg>
The stops used here are the same as before, but now the object will be red in the center, and in all directions gradually change to blue at the edge. Like linear gradients, the
<radialGradient> node can take several attributes to describe its position and orientation. However, unlike linear gradients, it's a bit more complex. The radial gradient is again defined by two points, which determine where its edges are. The first of these defines a circle around which the gradient ends. It requires a center point, designated by the
cx and
cy attributes, and a radius,
r. Setting these three attributes will allow you to move the gradient around and change its size, as shown in the second
rect above.
The second point is called the focal point and is defined by the
fx and
fy attributes. While the first point described where the edges of the gradient were, the focal point describes where its middle is. This is easier to see with an example.
Center and focal point
<?xml version="1.0" standalone="no"?> <svg width="120" height="120" version="1.1" xmlns=""> <defs> <radialGradient id="Gradient" cx="0.5" cy="0.5" r="0.5" fx="0.25" fy="0.25"> <stop offset="0%" stop- <stop offset="100%" stop- </radialGradient> </defs> <rect x="10" y="10" rx="15" ry="15" width="100" height="100" fill="url(#Gradient)" stroke="black" stroke- <circle cx="60" cy="60" r="50" fill="transparent" stroke="white" stroke- <circle cx="35" cy="35" r="2" fill="white" stroke="white"/> <circle cx="60" cy="60" r="2" fill="white" stroke="white"/> <text x="38" y="40" fill="white" font-(fx,fy)</text> <text x="63" y="63" fill="white" font-(cx,cy)</text> </svg>
If the focal point is moved outside the circle described earlier, its impossible for the gradient to be rendered correctly, so the spot will be assumed to be within the edge of the circle. If the focal point isn't given at all, it's assumed to be at the same place as the center point.
Both linear and radial gradients also take a few other attributes to describe transformations they may undergo. The only other one I want to mention here is the
spreadMethod attribute. This attribute controls what happens when the gradient reaches its end, but the object isn't filled yet. It can take on one of three values, "pad", "reflect", or "repeat". "Pad" is what you have seen so far. When the gradient reaches its end, the final offset color is used to fill the rest of the object. "reflect" causes the gradient to continue on, but reflected in reverse, starting with the color offset at 100% and moving back to the offset at 0%, and then back up again. "Repeat" also lets the gradient continue, but instead of going backwards, it just jumps back to the beginning and runs again.
spreadMethod
<?xml version="1.0" standalone="no"?> <svg width="220" height="220" version="1.1" xmlns=""> <defs> <radialGradient id="GradientPad" cx="0.5" cy="0.5" r="0.4" fx="0.75" fy="0.75" spreadMethod="pad"> <stop offset="0%" stop- <stop offset="100%" stop- </radialGradient> <radialGradient id="GradientRepeat" cx="0.5" cy="0.5" r="0.4" fx="0.75" fy="0.75" spreadMethod="repeat"> <stop offset="0%" stop- <stop offset="100%" stop- </radialGradient> <radialGradient id="GradientReflect" cx="0.5" cy="0.5" r="0.4" fx="0.75" fy="0.75" spreadMethod="reflect"> <stop offset="0%" stop- <stop offset="100%" stop- </radialGradient> </defs> <rect x="10" y="10" rx="15" ry="15" width="100" height="100" fill="url(#GradientPad)"/> <rect x="10" y="120" rx="15" ry="15" width="100" height="100" fill="url(#GradientRepeat)"/> <rect x="120" y="120" rx="15" ry="15" width="100" height="100" fill="url(#GradientReflect)"/> <text x="15" y="30" fill="white" font-Pad</text> <text x="15" y="140" fill="white" font-Repeat</text> <text x="125" y="140" fill="white" font-Reflect</text> </svg>
Both gradients also have an attribute named
gradientUnits, which describes the unit system you're going to use when you describe the size or orientation of the gradient. There are two possible values to use here:
userSpaceOnUse or
objectBoundingBox.
objectBoundingBox is the default, so that's what has been shown so far. It essentially scales the gradient to the size of your object, so you only have to specify coordinates in values from zero to one, and they're scaled to the size of your object automatically for you.
userSpaceOnUse essentially takes in absolute units. So you have to know where your object is, and place the gradient at the same place. The radialGradient above would be rewritten:
<radialGradient id="Gradient" cx="60" cy="60" r="50" fx="35" fy="35" gradientUnits="userSpaceOnUse">
You can also then apply another transformation to the gradient by using the
gradientTransform attribute, but since we haven't introduced transforms yet, I'll leave that for later.
There are some other caveats for dealing with
gradientUnits="objectBoundingBox" when the object bounding box isn't square, but they're fairly complex and will have to wait for someone more in-the-know to explain them. | https://developer.mozilla.org/en-US/docs/Web/SVG/Tutorial/Gradients | CC-MAIN-2016-44 | refinedweb | 1,639 | 53 |
When Classes Leak Into Ruby Contracts
Sometimes Ruby APIs document non-Rubyesque expectations that artificially separate "classes" and "objects", a la Java. I'd like to give you a few examples to depict what I mean, and explain why that's artificial later.
First example, the Rack specification says that
A Rack application is an Ruby object (not a class) that responds to call.
That's not very idiomatic, why classes are banned? A Ruby programmer would expect this shorter contract:
A Rack application is an Ruby object that responds to call.
That's it, the nature of the object is irrelevant to Rack, the only thing that matters is that the object responds to call (with such and such signature). Indeed a class that responds to call is a perfectly valid Rack application. The implementation is Rubyesque, but the wording in the docs is not.
Another example taken from the chapter on routing of O'Reilly's Rails 3 in a Nutshell:
Constraints may either be specified as a hash, a class implementing a matches? class method, or a class that responds to a call method, such as a Proc object.
The suspicious bit in that contract is "a class implementing a matches? class method". Indeed there's no requirement in the routing system that you pass a class. All it matters is that you pass any object that responds to matches?, see:
constraint.respond_to?(:matches?) && !constraint.matches?(req)
That's idiomatic Ruby, where the interface is the only thing that matters, classes are irrelevant.
Classes Are Ordinary Objects
Technically in Ruby there are no "class methods" as opposed to "instance methods". Ruby only has instance methods. Let me summarize how this works.
If you define a Person class having a name instance method, instances of Person respond to name. No surprises here. But individual person instances can respond to more stuff:
def person.custom_method ... end
In the example above, the object stored in the person variable also responds to custom_method. Such a method targeted to a particular instance is called a singleton method. You can for example build simple mocks this way:
o = Object.new def o.name "John" end # Now pass o to code that expects anything responding to #name.
And you can also override methods defined in the class of the object.
In Ruby classes are objects. When you write Person, that's an ordinary constant. Totally ordinary. It is the same kind of ordinary constant as
X = 1
No difference. You can think of
class Person end
as being equivalent to
Person = Class.new
The Ruby interpreter then processes the class definition body, but as far as the constant is concerned that's it. In fact, if you have an anonymous class and assign it to a constant later, then it gets its name automatically after the constant's name.
So, this is a key point, the Person constant is ordinary, it happens to evaluate to a class object, the same way X above evaluates to an integer. And here is when Ruby deviates from other OO languages: classes are ordinary objects also, objects of type Class:
klass = Person person = klass.new
That works because Person just evaluates to a class object, and as with any other object you can store classes in variables and pass them around, and that object responds to the new method, the same way person responds to name. Why? Because klass is an object of the class Class, which defines new among its instance methods. Simple and elegant.
So at this point you need to forget a bit mental schemas coming from other languages and open your mind to accept the derivations of this particular OO model.
Since classes are ordinary objects, you can also define singleton methods on them, the same way we did with person before. Do you recognize now this idiom?
class Person def self.find_by_name(name) ... end end
In the body of a class self is the class object in scope, and so that is just defining a singleton method on it.
All classes are instances of Class, a "class method" is any method a class responds to, which may come from Class, or be defined for particular classes, that is, singleton methods.
Class Methods, Fine
I am fine with the term "class method" in Ruby as long as we know what we are talking about. Technically Ruby has no such things, everything are instance methods, but you can take "class method" as short for "an instance method of the class object". Depending on their intended usage, class methods are also referred to as "macros", also a convenient term, think has_many in Active Record.
But even if you can talk about "class methods" in that sense, you rarely need to tell classes from non-classes in API contracts based on interfaces. | http://www.advogato.org/person/fxn/diary.html?start=533 | CC-MAIN-2015-14 | refinedweb | 805 | 63.09 |
Build a Voice Recorder GUI using Python
Prerequisites: Python GUI – tkinter, Create a Voice Recorder using Python
Python provides various tools and can be used for various purposes. One such purpose is recording voice. It can be done using the sounddevice module. This recorded file can be saved using the soundfile module
Module Needed
- Sounddevice: The sounddevice module provides bindings for the PortAudio library and a few convenience functions to play and record NumPy arrays containing audio signals. To install this type the below command in the terminal.
pip install sounddevice
- SoundFile: SoundFile can read and write sound files. To install this type the below command in the terminal.
pip install SoundFile
Approach:
- Import the required module.
- Set frequency and duration.
- Record voice data in NumPy array, you can use rec().
- Store into the file using soundfile.write().
Implementation:
Step 1: Import modules
import sounddevice as sd import soundfile as sf
Step 2: Set frequency and duration and record voice data in NumPy array, you can use rec()
fs = 48000 duration = 5 myrecording = sd.rec(int(duration * fs), samplerate=fs, channels=2)
Note: fs is the sample rate of the recording (usually 44100 or 44800 Hz)
Step 3: Now store these array into audio files.
# Save as FLAC file at correct sampling rate sf.write('My_Audio_file.flac', myrecording, fs)
Let’s create a GUI application for the same. We’ll be using Tkinter for doing the same.
Python3
Output:
My Personal Notes arrow_drop_up | https://www.geeksforgeeks.org/build-a-voice-recorder-gui-using-python/?ref=rp | CC-MAIN-2022-27 | refinedweb | 243 | 57.67 |
Synopsis_22 - CPAN [DRAFT]
Jos Boumans <kane@cpan.org> Audrey Tang <autrijus@autrijus.org> Florian Ragwitz <rafl@debian.org>
Maintainer: Jos Boumans <kane@cpan.org> Date: 3 Nov 2005 Last Modified: 28 Nov 2005 Number: 0 Version: 1
- None of the known tools can do what we want - Will have to implement chain ourselves - Be inspired by dpkg, apt-get and debian policy - See: - Start with the elementary things - See C<Plan of Attack> for first steps
This describes the basic flow for installing modules using the new 6pan installer. This just deals with building a package from source and installing it. Not with the distribution of these files through the means of CPAN. That will be covered in the advanced flow.
1. Setup package directory * creates a directory for the project * includes all relevant default files * and default metadata setup * [ ... write code ... ] 2. Extract/Update metadata * done by giving project code to the compiler * extract the info given by the compiler about the code * update the metadata according * this involves 'use' statements, versions, packages, etc 3. Build package based on metadata * verify integrity of the code/metadata * create a source package called a '.jib' file See '.jib files' further down * contains source code * contains metadata 4. Install package from '.jib' file * Extract '.jib' to a temporary directory * Verify dependencies based on metadata * Build the source code to installable code * Move the installable code to it's final destination * Run appropriate hook-code * Perform appropriate linking * Update system metadata based on package metadata 5. Uninstall packages * Query metadata to verify dependencies * Remove the installed code * Run appropriate hook-code * Perform appropriate linking * Update system metadata based on package metadata
# XXX - What does
.jib stand for? Why not
.p6d or
.p6z or something along that line?
#.
.jib
As outlines in step 4 of the
General Flow, a
.jib will need a few steps on the client machine to be installed. Here are some important details about that installation.
* Files will be installed in one base directory, prefixed with a user-defined prefix. By default this will be the C<site_perl> directory for this particular perl. I.e.: /sw/site_perl/5.8.3 * The name of this base directory is the full name of the package, minus the extension. I.e.: p5-Foo-Bar-1.2-cpan+kane * The lib/, bin/ and docs/ directories, as well as the (generated) man/ directories, will be placed straight under this base directory. I.e.: p5-Foo-Bar-1.2-cpan+kane/ lib/ bin/ man/ docs/ * As the base directories bin/ and man/ path will not be in the standard $PATH and $MANPATH, symlinks will be created from the standard paths to the current active version of the package. These links will go via an intermediate link in the metadir, so all diversions to the automatic linking can be contained to the metadir. I.e: ln -s /sw/site_perl/5.8.3/p5-Foo-Bar-1.2-cpan+kane/bin/X /our/metadir/alternatives/X ln -s /our/metadir/alternatives/X /usr/local/bin/X # XXX - Question - in platforms without symlinks, do we emulate # using hardlinks and fallback to copying? * In the case of multiple installs of the same package (where 'same' is determined by identical <prefix>-<package-name>), the perl6 policy will determine which is the current active package, just like it would for a C<use> statement in normal perl6 code. * These links will be maintained by a linking system managed by the installer, meaning that they will be updated according to policy when any up/downgrades or installs occur. See the section on C<Alternatives>
- Take small steps first - build packages based only on metadata - begin with Metadata -> source-package - see metadata basic spec - write basic create/install/uninstall scripts - go from there
- dpkg is too hard to port - needs custom patches - needs unix emulation layer - needs to be compiled - apt-get won't work on 'intermediate files' - needs complete .debs - gotten from standard archive meta-data
Prototyping code is in the pugs repository under misc/sixpan
Read the README files to see how to test the prototypes
Note shortcomings are mostly mentioned in the code itself with 'XXX' markers.
- Got a basic cleanup script: - Cleans out create's builddirectories - Removes the 'root' directory for installs - Creates a fresh structure of a 'root' - Touches all relevant files
See README for details on these scripts.
- Got a basic create script: (Step 3 from general flow) - makes an archive (.jib file): - reads in the META.info file - builds archive in a separate builddir - takes all files, no MANIFEST/meta.info list yet for files to be packaged - splits out metadata and installable files into 2 different .tgz archives (a la dpkg) - creates a .tgz of both those archives in the name of ${package}.jib in the builddir - outputs archive location when finished - Got a basic install script: (Step 4 from general flow) - installs an archive (.jib file): - extracts .jib file to temp dir - extracts metadata to metadir/${package} - doesn't write to tmpdir first, then moves at the end - writes a .packlist equiv file - verifies if dependencies have been met - uses dependency engine that can deal with AND, OR and grouping. See C<Dependencies>. - aborts install if not - registers this archive in the 'available' file (a la dpkg) - runs preinst script if supplied - no arguments yet - copies installable files to target dir - does not use a specific 'build' tool yet - doesn't write to tmpdir first, then moves at the end - links scripts from the bindir to the targetdir ie /usr/local/bin/script to /site_perl/${package}/bin/script - manages link generation, recording and linking - supports up/downgrades ie 2 installs of different versions of 1 package - all up/downgrades considered 'auto' for now - runs postinst script if supplied - no arguments yet - cleans up temp dir - outputs diagnostics along the way - Got a basic uninstall script: (Step 5 from general flow) - removes an archive - verifies if uninstall is safe to do: - verifies (simplistically) if dependencies are not violated - aborts install if not - runs prerm script if supplied - no arguments yet - reads in .packlist equiv - unlinks all files listed - unlinks all bin/$script files that were linked - relinks them if there's a suitable replacement available - doesn't unlink manpages # XXX - Why? - all up/downgrades considered 'auto' for now - updates 'available' file (a la dpkg) - removes meta data associated with this package
See README.repo for details on these scripts.
- Basic repository create script: - takes one or more source directories and finds the .jib files - extracts their meta files to a temp dir - copies the archive and and the meta file (as $archive.info) to the repository root - aggregates all the meta files into one big index file - Basic repository search script: - takes one or more key:value pairs - key is key in the meta file - value is compiled into a regex - prints out every meta file where key matches value - Basic repository install script: - a la apt-get - takes one or more packages and scans it recursively for dependencies using our dependency engine. See C<Dependencies>. - the to be installed files are then given in the right order to our basic install script, which installs them one by one.
- Basic installed script: - a la dpkg -l - lists all packages installed - and all their files - and all alternatives they own - no manpages yet - Basic dependency printer - takes one or more packages and pretty prints their dependencies - then prints out which files would be installed if you were to install this package - samples the usage of the dependency engine - see C<Dependency Engine> for details. - see README.deps for some samples
- Define no more than needed to get started for now - Allow for future extensions - Use YAML as metadata format as it's portable and available standard in perl6
- Author CPAN author id (KANE) - Name Perl module name (Foo::Bar) - Version Perl module version (1.2.3) - Description Description of function (This is what it does) - Authority From S11 (cpan+KANE) - Package Full package name (p5-Foo-Bar-1.2.3-cpan+kane) - Depends Packages it depends on[1][2](p5-Foo) - Provides Packages this one provides (p5-Foo-Bar, p5-Foo-Bar-cpan+kane)
The alternatives mechanism closely follows the ideas behind the debian's
update-alternatives system:
Alternatives, which may not be the most apt name, will be used in all cases where a module provides scripts or manpages that must be visible to any tool that looks in different places than where the installer will put them.
Alternatives will be updated/altered when another version of the same package is installed (where 'same' is determined by identical <prefix>-<package-name>).
Since an alternative can only point to one particular version at a time, another version might be the new
current alternative. Deciding which alternative is to be used, is something that will be answered by the perl6 policy file, which also resolves
use statements.
Alternatives will be stored in the
alternatives file in the metadata dir of the installation. Alternatives will have at least the following properties:
* package that registered one or more alternatives * Files written for the 'man' alternative * Files written for the 'bin' alternative * [ ... more possible alternatives ... ] * Whether the alternatives manager should update the alternatives automatically, or leave it to the sysadmin (manually)
The rules in changing the alternatives are as follows:
Install: no Should i register an alternative? ---> Done | | yes | v no Does the file exist already? ---> Register alternative | | yes | v no Is this an upgrade? ---> Error[1] | | yes | v no Are we the new alternative? ---> Done (Based on policy file) | | yes | v Install new links, update alternatives file [1] The alternative system doesn't support 2 different packages to supply the same file. This would be solved with with debian-style alternatives. Since we recognize the condition, we can implement deb-style behaviour later, without breaking anything
The uninstall rules are quite similar, except the installer has to check, when removing the links for this version, if the policy can point to a new default, and register those alternatives: =: - ...
- short circuits on OR (first named gets priority) - favours higher versions over lower versions on draw - this should be policy based - checks if already installed packages satisfy the dependency before checking the repository for options - is completely recursive -- any combination of AND, OR and GROUPING should work. - returns a list of missing packages - in installation order - need a split out between the printer and the resolver - so one can list all dependencies as they are resolved and just the ones that need installing
[4:13PM] vasi: the idea is basically, you have an object to represent the state-of-the-system [4:13PM] vasi: (all the packages that are installed, essentially) [4:13PM] vasi: and then you say "i have this state, i want to do operation X on it, what's the best way to achieve that?" [4:14PM] vasi: so you look at the state and say "what's WRONG with this state, wrt op X?" [4:15PM] vasi: and resolve the first wrong thing in every reasonable way, and now you have a list of (state, operations-remaining) [4:15PM] vasi: and a slightly smaller list of things wrong [4:15PM] vasi: and you keep doing that until nothing is wrong anymore, and you have a final list of states that satisfy all the requirements [4:15PM] vasi: then you pick the preferred one of those states, according to some heuristic [4:16PM] vasi: The naive approach, "get a list of the packages we need", falls down badly in the face of OR-depends and virtual-packages and conflicts [4:16PM] kane: i understand what you just said. how does that make my life better over a simple fifo, shortcircuit approach? [4:19PM] vasi: ok, here's a test case that normally fails with the simple approach [4:19PM] vasi: i'm using 'Dep' as a binary operator here, so 'a Dep b' means a depends on b [4:19PM] vasi: if you have 'parent Dep (child1 AND child2)', 'child1 Dep (grandchild1 OR grandchild2)', 'child2 Conf grandchild1' and then you do 'install parent' [4:20PM] vasi: the recursive algorithm says 'ok, i need child1...now i need one of gc1 or gc2, let's just pick gc1...now i need child2, oh shite gc1 is bad CRASH" [4:20PM] vasi: at least that's what fink does :-) [4:20PM] vasi: cuz our dep engine is naive [4:20PM] kane: vasi: here's an idea -- as our goal is to be pluggable on all this, so it's possible to swap dep engines around.. wouldn't it be trivial to take the naive version, and up it to the smart one as we go? [4:24PM] vasi: you ought to at least architecture the engine so it takes a (state, set-of-operations) set [4:24PM] vasi: and then returns a list-of-things-to-do [4:24PM] vasi: so that then, it's easy to substitute any system [4:25PM] vasi: (and use callbacks for things like user interactions) [4:25PM] vasi: The reason we can't just swap in a new dep engine to fink is that the current one is sufficiently useful and has enough side effects, that it would just be too much pain [4:26PM] vasi: so don't get yourself stuck in the same situation as we're in
Vasi wrote a proof of concept for fink, that does this sort of detecting (no resolving yet):
Vasi points to a good dep engine written in python:
These are not implemented in the prototype, but should be well kept in mind for a serious release.
Rather than letting the build tool generate a magic list of files which we are to move to their final destination, building a binary package will be much easier. We can adopt the debian strategy to let the builder install into a fake root directory, provided to it. That way we can package up this directory and have a complete list of files and their destination on this machine.
Another benefit to building these packages:
[3:25PM] vasi: basically some users are likely to want to uninstall packages, and re-install without a whole compile [3:25PM] vasi: or create packages on a fast machine, and then install them on a slow machine [3:25PM] vasi: or create packages once, and then distribute them to their whole organization
Of course, they're not as portable as debian binary packages, as the location depends on perl version, architecture and install prefix. So this is something to come back to later, but keep in mind.
For perl6, there's no direct need to delete an older package when upgrading, but for quite a few architectures it is. Our current dependency engine doesn't keep this in mind yet, but it's something to add later on.
Most package managers assume control of /, which we don't. Following the perl installation style, we'll have several directories that can hold modules, that can be mixed and matched using dynamic assignments to @INC (by using say, $ENV{PERL5LIB}). To facilitate this, we should have a meta dir below every @INC root dir, which tells us what modules are available in this root. The order of @INC will tell us in what order they come, when resolving dependencies. It's unclear how we will proceed with our alternatives scheme in this setup.
With more tags describing dependencies than just
Depends: we should have a way to tell the package manager until what level you wish to follow these tags. For example '0' to not install dependencies ever, '1' to just do
Depends:, '2' to also do
Suggests:, etc.
Since we do not rule all of /, there are going to be dependencies we are unaware of. Therefor we need probing classes that can tell us (and possibly somewhere in the future resolve) whether a certain non-perl dependency has been met. For example, we might have a dependency on:
c_header-pgsql
And a probing class for the type
c_header would be able to tell us whether or not we have this dependency satisfied. The same probing class should be able to tell us something about this dependency, like location and so on, so the build modules may use it. This also means our dependency engine should use these probing classes.
My (rafl) ideas for the repository layout look like this. It's modeled after the Debian archive structure.
/ | |- pool/ The real modules are stored here. | | | | The index files in dist/ point here. | |- a/ Modules startihg with 'a'. The pool is | | | grouped alphabetically for performance | | | reasons. | | | | | |- acme-foo-0.1-cpan+RAFL.jib | | |- acme-foo-0.2-cpan+RAFL.jib | | `- acme-hello-1-cpan+AUTRIJUS.jib | | | |- b/ | |- c/ | |- ./ | |- ./ | |- ./ | |- y/ | `- z/ | `- dists/ This directory only contains so called index files | files. They know some meta-information about the | packages (description, ...) and a path to the real | package inside pool/. Using this index files | modules can be categorized very well. There are | more then the showed categories possible, of | course. It's only an example. | |- index.gz Main index file with all modules | |- author/ The whole archive sorted by authors | |- stevan.gz Stevan's modules | |- autrijus.gz All of autrijus modules | |- autrijus/ ... and so on | | |- language/ | | | |- python.gz | | | |- perl.gz | | | `- perl/ | | | `- module/ | | | |- Perl6-Pugs.gz | | | `- Acme-Hello.gz | | | | | `- module/ | | |- Perl6-Pugs.gz | | |- Acme-Hello.gz | | `- Acme-Hello/ | | `- language/ | | |- perl.gz | | `- js.gz | | | `- rafl.gz | |- language/ | |- perl.gz | |- perl/ | | |- auhor/ | | | |- kane.gz | | | |- rafl.gz | | | |- rafl/ | | | | `- module/ | | | | |- Audio-Moosic.gz | | | | `- Audio-File.gz | | | | | | | `- gbarr.gz | | | | | `- module/ | | |- Audio-Moosic.gz | | |- Audio-Moosic/ | | | `- author/ | | | |- rafl.gz | | | `- kane.gz | | | | | |- Audio-File.gz | | `- Audio-File/ | | | |- js.gz | |- js/ | |- ruby.gz | `- ruby/ | `- module/ |- DBI.gz |- DBI/ | |- author/ | | |- timb.gz | | |- timb/ | | | `- language/ | | | |- perl.gz | | | `- js.gz | | | | | `- rafl.gz | | | `- language/ | |- perl.gz | |- perl/ | | `- author/ | | |- timb.gz | | `- rafl.gz | | | `- ruby.gz | |- Net-SMTP/ `- Net-IMCP/
In this layout we have a pool directory, where all .jib's live, and a dists directory, which contains the needed meta informations for the .jib's in pool. The dists directory contains a index.gz file which is a gziped list of all modules plus their meta information. This file will get pretty as the number of modules on sixpan grows. Therefor the dists directory is split up.
This can be done by all meta tags a .jib file can have. I've choosen the author name, the module name and the language a module is implemented in as the default.
The dists directory contains a directory for each meta tag we're grouping after. This directory has the same name as the meta tag. This directory now contains gziped index files for all available values of the given meta tag. These index files are named after the value of the meta tag.
Beside that index files we also have directories in the meta tag subdirectories of dists. These are named after the meta value as well and contain a similar structure as the subdirectories of dists. But grouped after all remaining meta tags. This continues recursively until no meta tags are left.
So if we want to get a specifig index file which contains all modules with given meta tags we use a path like this:
dists/tag1/value1/tag2/value2/tag3/value3.gz # XXX - Alias suggests that we normalize our query syntax for selecting based # on languages, modules, tags etc, and take a digest hash of it as the # file name for the .gz file; that way a given repository can cache a # large amount of queries, and we can add more columns/axis after the # fact, without inventing whole directory structures to support them. # (it's essentially the git/monotone idea.)
As outlined in the
S11 synopsis on modules, it's quite possible to install multiple versions of a certain module. To facilitate this, the old directory structure, as used in
perl 5 must be abondoned, in favor of a more layered structure as outlined in the "Installing a
.jib" section above.
This of course has some implications for the compiler as it will no longer be able to use the old translation:
$mod =~ s|::|/|g; $mod .= '.pm'; for ( @INC ) { $file = "$_/$mod" if -e "$_/$mod" }
Instead, a module must be found within one of the package subdirectories. The
Policy will describe which package is favored over the other. However, it does not (currently) describe which package is preferred over the other; It is quite possible (under perl5, and presumably perl6) that the following scenario exists:
p5-Foo-1-cpan+KANEholds Foo.pm and Foo::Bar.pm =item A package
p5-Foo-Bar-1-cpan+KANEholds Foo::Bar.pm
As the
S11 draft only speaks of how to resolve the use of Foo::Bar.pm which is assumed to be in
p5-Foo-Bar, a possible ambiguity creeps in.
In order to resolve this ambiguity, 2 options present themselves currently:
The downsides to this approach are:
usesyntax to include an optional
fromtag, much along the way pythons imports work. Where python uses
fromto say:
from MODULE import FUNCTIONS
We propose to have perl6 use:
use MODULE from PACKAGE;
This means that the
use syntax can be 'dummed down' to the current perl5 sytnax, and all the magic of the new syntax goes in the
from section.
To keep the
from part optional, the
from defaults to:
MODULE =~ s/::/-/g;
This means one would write the following thigs:
to use Foo.pm from p6-Foo-(ANY)-(ANY)
to use Foo::Bar.pm from p6-Foo-Bar-(ANY)-(ANY)
to use Foo::Bar.pm from p6-Foo-(ANY)-(ANY)
The only noticable downsides to this approach are the extension of the language keywords, and the occasional requirement on the user to identify which package a certain module should come from. The latter may actually be argued a feature.
As the
META.info files describe the package in quite a bit of detail, it would be very nice if those could be (largely) generated from the information the compiler can give us about chunks of code (now to be named
compile units).
Many fields in the
META.info file are completely analogous to declarations in the files packaged. It would therefor be handy to, rather than scanning or parsing files under the package tree, have the compiler answer certain questions for us. These are along the lines of:
Even though perl is a dynamic language, it is possible to identify whether or not any 'dynamic' calls are unresolvable at compile time and could therefor change or add to what we have found already. So in any case, we can at least be certain whether or not we are certain about what the code does -- any ambiguities can be presented to the user and edited manually in the
META.info.
__END__
# This file needs reorganization - gnomes welcome!
'package management means several things': - metadata collection (1) perl6-thingy or maybe debtags? - package building (2) make dist - intermediate format for transport - the equiv of Makefile.PL in it - decomposed to hooks and probes - uploading package to central area (3) CPAN - indexing (4) apt-ftparchive - I don't think apt-ftparchive is enough here. I think we'll need to set up or even wright something like dak, the Debian archive maintaince scripts: packages.debian.org/dak - understanding/querying index (5) apt-cache, debtags - fetching package - building final package (6) dpkg-deb - with dependency, conflict, alternative, etc resolution (7) apt - installing package (8) dpkg -i
- Check out the "prototype" directory here for the meta.info for #1
- To use dpkg, let's not do manual patchfile - instead import dpkg src into a src control - then fink patches becomes a branch - and we branch again - and brings the diffs between them and figure out who can accept what - but it's all in version control, not .diff files
(au will bring this to jhi and aevil next Monday and see what they think about it, btw.)
- Binary and Source Package - Only Source Packages - source -> package compilation on the client machine we can not use standard dependency resolution engines, as the package that would satisfy the dependency doesn't exist - apt only groks binary pkgs - which is why we are doing something finkish - Assume user have a compiler and other dev tools - Because we are going to bundle them damnit - Fall back statically and gracefully due to static C-side dep declaration
Though this not necessarily represents the view of Runtimes:
when comping to pir we need to recognize "use" for pir lib bundles when comping to p5 we need to recognize PAR (not really) when targetting jvm we have .jar capability but that's the runtime - we only provide bridge to them on the syntax level instead of on the package management level - to users of perl 6 it's all just "perl 6" regardless of the runtime they are going to use on the system.
[foo.p6] given (use (perl5:DBI | java:JDBC)) { when /perl5/ { ... } when /java/ { ... } };
[foo.p6o] - symbol resolution links to java:JDBC - remembers the policy that shaped this decision - would not relink unless the environment changes - new available perl5:DBI - modified policy - et cetera - trigger a relink if the env changed under it - it's the same as Inline::* for the changed source files - except we also chase the dep pkgs and reqs
- When you install a package - you list the resolved pkgs as part of its install profile - because perl6 uses ahead-of-time compilation (most of the times) - this means the pkg is already statically linked to those resolved deps - to change that requires a rebuild from source anyway - the runtime is going to be exactly the same as install time - to change that requires essentially a relink therefore a reinstall - exactly like C#, Java, C, whatever (not like Ruby, Python, PHP)
separate compilation doctrine - each package will just remember specific versions it linked against - when you do upgrade, you have the chance of relinking past packages that depends on the older version (again, just like C)
ldd libfoo libz.3
upgrade to libz4 /usr/lib/libz.3.so
Compress::Zlib - need zlib.h and -lz on the system - since it's C, we can reasonably put it as part of metadata - the requires section is probed according to the prefix - new prefixes may be added later in an extensible fashion - 2 categories of prefixes: - those we are 'authoritive' for, i.e. can resolve - the others are delegated to powers-that-be in the local system
Requires: p5-Foo, p6-Bar, c_lib-zlib, c_inc-malloc, bin-postfix
mapping: prefix -> probing tool
c headers binaries libraries file
network?
kane thinks: - dpkg seems to be not the optimal choice - functionality good, custom patches bad - described well in policy & we have source code :) - rafl seems to be very passionate on the Right Thing - (has C-fu and Perl-fu and dpkg-fu, worked with Parrot+Pugs) - patch only works on osx - patched against an old version - patch fails against newer versions of dpkg - finkers claim updating patch is a PITA - this is bad - Use dpkg policy & source to write own tool? - be dpkg-inspired? - fink "fixed" dpkg by introducing their own branch - distributed as a "patchfile" -*checkout*/fink/fink/10.4-transitional/dpkg.patch*checkout*/fink/fink/10.4-transitional/dpkg.info
- main patch: adding @PREFIX@ to dpkg, so it no longer assumes it manages all of /, but in finks case, just /sw - that is a must-have patch for us, if using dpkg - also means a shared root between admin & install files - no hope of upstream merge? - (make them our upstream and see if they take patches better?) - dual-track system - "fink" is srcpkg # this is more like what we are after - "apt-get" is binpkg # don't have to realize that part right now? - use 'intermediate format' (a la tarballs from "make dist") - contains all files & metadata - usable for anyone to build packages - build .deb (or similar) on client machine - deb has name (full pkg name) and provides: - p5-Foo-Bar - p5-Foo-Bar-Origin - allows users to depend more specifically - requires a new EU::MM/M::B (no more make!)
(other alternatives) - yum (as in yummy) - vasi on irc.freenode.org:#fink knows a lot - xar () - XAR requires libcurl, libxml2, OpenSSL, and zlib. - all c code - underdevelopment by some #fink-ers, like bbraun
autrijus thinks: - ddundan is porting DBI::PurePerl to Perl6 - Going to call it "DBI-0.0.1-cpan:DDUNCAN" - 4 parts in the name - implicit: "perl6" -- "use perl6:DBI" is the same as "use DBI" - mapped to "p6-" in the ondisk pkg string - "DBI" is just "DBI" - "0.0.1" (it is decreed that thou shalt not upload malformed version strings) - scheme:location (with some validation somewhere.. or something) - on disk, we turn the initial colon into dash - URI-escape the location part - one-to-one, reversible mapping between long names and ondisk package dirs - adopting the "only.pm"-like scheme of installing modfiles into pkgdirs
- blib/scripts/ & blib/man/ - problem is because shell could care less about multiversioning - some sort of ln-s inevitable - adopt the debian "alternatives" notion and be done with it - DBI.3pm links to the "most desired" variant of DBI manpage - we do have a way to tell what is more desired - it's called the Policy File! - Policy file API? - whatever gets used via "use DBI" will win DBI.3pm as a bonus - install everything under the module/package dir vs install systemwide + links? - in the pugs buildsystem currently we're still using p5 MM - except it goes to perl6sitelibdir perl6scriptdir perl6man3dir - this can't go on forever - esp. we are having separate - Net::IRC - DBI - Date - Set - only thing pending multiversioning is the Policy File - without which we can't possibly roll this out
rafl thinks: - dpkg seems to be not the optimal choice - maybe only adopt the package and metadata format from the .deb format version 2 and write the tools to manipulate and install it ourself. Preferably in Perl 6. - I fear that tools like dpkg/apt/.. aren't portable as we need it because they were mainly written for use with a single Linux distribution. - The Debian tools can be useful as a provisional solutions until we wrote something own or as a reference implementation.
Policy.resolve_module(@modulespecs) (see S11 for some module specs) (allow junctions, yay)
- returns zero, one module object - or an exception with 2+ overlapping ones
Core < Vendor < Site < User policies
- Whenever there could be a "use" line that is ambiguous, the policy set is considered bogus and you have to edit it to continue.
- Tie breaker for multiple matches to a "use" line - Also a 'hintsfile' for package installer (& builder?) - Reasonable defaults
p6-M-*-* > p5-M-*-* L-M-1.0.0-O > L-M-2.0.0-O
language, module, version, origin
- The user just have to subscribe to a policy source - supplies the "user" part of the policy defaults - eg. the CPAN policy source will prioritize anything cpan: in (say) modlist
# Local variables: # c-indentation-style: bsd # c-basic-offset: 4 # indent-tabs-mode: nil # End: # vim: expandtab shiftwidth=4: | http://search.cpan.org/~lichtkind/Perl6-Doc-0.36/lib/Perl6/Doc/Design/S22.pod | CC-MAIN-2015-18 | refinedweb | 5,197 | 58.42 |
Download presentation
Presentation is loading. Please wait.
Published byAmarion Yerton Modified over 2 years ago
1
David Evans CS200: Computer Science University of Virginia Computer Science Class 28: Networks, The Internet, and the World Wide Web Memex Machine Vannevar Bush, As We May Think, LIFE 19:11 (1945)
2
29 March 2004CS 200 Spring 20042 This Week in CS200 Today: Networking and the Internet Wednesday: –How to make a dynamic web site using HTML, SQL, PHP Friday: Models of Computation
3
29 March 2004CS 200 Spring 20043 College CS Program Not a Major – must still have a CLAS Major Advantages: –Priority registration for CS classes –Certificate and metaphorical goldstar on your transcript (if you take enough courses) Disadvantages: –Applications due Tuesday, 6 April –Have to write a 1 page essay If you have received at least one gold star, I will write a letter of support for you
4
29 March 2004CS 200 Spring 20044 Who Invented the Internet?
5
29 March 2004CS 200 Spring 20045 Who Invented Networking?
6
29 March 2004CS 200 Spring 20046 What is a Network? A group of three or more connected communicating entities
7
29 March 2004CS 200 Spring 20047 Beacon Chain Networking neighboring islanders and bring them to the rescue in their ships. Iliad, Homer, 700 BC Chain of beacons signaled Agammemnons return (~1200BC), spread on Greek peaks over 600km.
8
29 March 2004CS 200 Spring 20048 Pony Express April 1860 – October 1861 Missouri to California –10 days –10-15 miles per horse, ~100 miles per rider 400 horses total (not per station like Kahns)
9
29 March 2004CS 200 Spring 20049 Chappes Semaphore Network Mobile Semaphore Telegraph Used in the Crimean War 1853-1856 First Line (Paris to Lille), 1794
10
29 March 2004CS 200 Spring 200410 Measuring Networks Latency Time from sending a bit until it arrives seconds (or seconds per geographic distance) Bandwidth How much information can you transmit per time unit bits per second
11
29 March 2004CS 200 Spring 200411 Latency and Bandwidth Napoleons Network: Paris to Toulon, 475 mi Latency: 13 minutes (1.6s per mile) –What is the delay at each signaling station, how many stations to reach destination –At this rate, it would take ~1 hour to get a bit from California Bandwidth: 2 symbols per minute (98 possible symbols, so that is ~13 bits per minute –How fast can signalers make symbols –At this rate, it would take you about 9 days to get ps7.zip
12
29 March 2004CS 200 Spring 200412 Improving Latency Less transfer points –Longer distances between transfer points –Semaphores: how far can you see clearly Telescopes can help, but curvature of Earth is hard to overcome –Use wires (electrical telegraphs, 1837) Faster travel –Hard to beat speed of light (semaphore network) –Electrons in copper travel about 1/3 rd speed of light Faster transfers –Replace humans with machines
13
29 March 2004CS 200 Spring 200413 How many transfer points between here and California?
14
29 March 2004CS 200 Spring 200414 ] tracert cs.berkeley.edu Tracing route to cs.berkeley.edu [169.229.60.28] over a maximum of 30 hops: 1 <10 ms <10 ms <10 ms router137.cs.Virginia.EDU [128.143.137.1] 2 <10 ms <10 ms <10 ms carruthers-6509a-x.misc.Virginia.EDU [128.143.222.46] 3 <10 ms <10 ms <10 ms uva-internet.acc.Virginia.EDU [128.143.222.93] 4 <10 ms <10 ms <10 ms 192.35.48.42 5 <10 ms <10 ms 10 ms 192.70.138.22 6 <10 ms 10 ms 10 ms nycm-wash.abilene.ucaid.edu [198.32.8.46] 7 20 ms 20 ms 20 ms clev-nycm.abilene.ucaid.edu [198.32.8.29] 8 21 ms 30 ms 30 ms ipls-clev.abilene.ucaid.edu [198.32.8.25] 9 30 ms 40 ms 30 ms kscy-ipls.abilene.ucaid.edu [198.32.8.5] 10 40 ms 50 ms 40 ms dnvr-kscy.abilene.ucaid.edu [198.32.8.13] 11 70 ms 70 ms * snva-dnvr.abilene.ucaid.edu [198.32.8.1] 12 70 ms 70 ms 70 ms 198.32.249.161 13 70 ms 70 ms 71 ms BERK--SUNV.POS.calren2.net [198.32.249.13] 14 70 ms 70 ms 70 ms pos1-0.inr-000-eva.Berkeley.EDU [128.32.0.89] 15 70 ms 70 ms 70 ms vlan199.inr-202-doecev.Berkeley.EDU [128.32.0.203] 16 * * * Request timed out. 17 70 ms 100 ms 70 ms relay2.EECS.Berkeley.EDU [169.229.60.28] Trace complete. > (define meters-to-berkeley (* 1600 3000)) ;; 3000 miles * 1600 meters/mi > (define seconds-to-berkeley 0.070) > (define speed-to-berkeley (/ meters-to-berkeley seconds-to-berkeley)) > speed-to-berkeley ;;; meters per second 68571428.57142857 > (define speed-of-light 300000000) ;;; 300 000 000 meters per second > (/ speed-of-light speed-to-berkeley) 4.375 The Internet latency today is about ¼ the best physically possible!
15
29 March 2004CS 200 Spring 200415 Improving Bandwidth Faster transmission –Train signalers to move semaphore flags faster –Use something less physically demanding to transmit Bigger pipes –Have multiple signalers transmit every other letter at the same time Better encoding –Figure out how to code more than 98 symbols with semaphore signal –Morse code (1840s)
16
29 March 2004CS 200 Spring 200416 Morse Code Represent letters with series of short and long electrical pulses
17
29 March 2004CS 200 Spring 200417 Circuit Switching Reserve a whole path through the network for the whole message transmission Paris Toulon Nantes Lyon Bourges Once you start a transmission, know you will have use of the network until it is finished. But, wastes network resources.
18
29 March 2004CS 200 Spring 200418 Packet Switching Use one link at a time Paris Toulon Nantes Lyon Bourges Interleave messages – send whenever the next link is free.
19
29 March 2004CS 200 Spring 200419 Circuit and Packet Switching (Land) Telephone Network –Circuit: when you dial a number, you have a reservation on a path through the network until you hang up The Internet –Packet: messages are broken into small packets, that find their way through the network link by link
20
29 March 2004CS 200 Spring 200420 internetwork A collection of multiple networks connected together, so messages can be transmitted between nodes on different networks.
21
29 March 2004CS 200 Spring 200421 Okay, so who invented the Internet?
22
29 March 2004CS 200 Spring 200422 The First internet 1800: Sweden and Denmark worried about Britain invading Edelcrantz proposes link across strait separating Sweden and Denmark to connect their (signaling) telegraph networks 1801: British attack Copenhagen, network transmit message to Sweden, but they dont help. Denmark signs treaty with Britain, and stops communications with Sweden
23
29 March 2004CS 200 Spring 200423 First Use of Internet October 1969: First packets on the ARPANet from UCLA to Stanford. Starts to send "LOGIN", but it crashes on the G. 20 July 1969: Live video (b/w) and audio transmitted from moon to Earth, and to several hundred televisions worldwide.
24
29 March 2004CS 200 Spring 200424 The Modern Internet Packet Switching: Leonard Kleinrock (UCLA) thinks he did, Donald Davies and Paul Baran, Edelcrantzs signalling network (1809) sort of did it Internet Protocol: Vint Cerf, Bob Kahn Vision, Funding: J.C.R. Licklider, Bob Taylor Government: Al Gore (first politician to promote Internet, 1986; act to connect government networks to form Interagency Network)
25
29 March 2004CS 200 Spring 200425 Government and Networking Chappe wanted a commercial network Anyone performing unauthorized transmissions of signals from one place to another, with the aid of telegraphic machines or by any other means, will be punished with an imprisonment of one month to one year, and a fine of 1,000 to 10,000 Francs.) French Law passed in 1837 made private networking illegal
26
29 March 2004CS 200 Spring 200426 The World Wide Web
27
29 March 2004CS 200 Spring 200427 The Desk Wide Web Memex Machine Vannevar Bush, As We May Think, LIFE, 1945
28
29 March 2004CS 200 Spring 200428 Licklider and Taylors Vision. J. C. R. Licklider and Robert W. Taylor, The Computer as a Communication Device, April 1968
29
29 March 2004CS 200 Spring 200429 The World Wide Web Tim Berners-Lee, CERN (Switzerland) First web server and client, 1990 Established a common language for sharing information on computers Lots of previous attempts (Gopher, WAIS, Archie, Xanadu, etc.)
30
29 March 2004CS 200 Spring 200430 World Wide Web Success World Wide Web succeeded because it was simple! –Didnt attempt to maintain links, just a common way to name things –Uniform Resource Locators (URL) Service Hostname File Path HyperText Transfer Protocol
31
29 March 2004CS 200 Spring 200431 HyperText Transfer Protocol Client (Browser) GET /cs200/community/ HTTP/1.0 … Contents of file Server HTML HyperText Markup Language
32
29 March 2004CS 200 Spring 200432 Growth of World Wide Web
33
29 March 2004CS 200 Spring 200433 PS7 Demo
34
29 March 2004CS 200 Spring 200434 Charge Try some tracert experiments next time you are on the Internet PS7 Due 7 April
Similar presentations
© 2017 SlidePlayer.com Inc. | http://slideplayer.com/slide/1451420/ | CC-MAIN-2017-13 | refinedweb | 1,530 | 60.28 |
Member Login Remember Me Forgot your password? All others have read/write/execute permissions on their local computer only. Comments: Anonymous According to TD315566, in order to fix this problem you need to obtain a version of the provider that does not run under the LocalSystem security context. x 44 EventID.Net As per Microsoft: "Health Monitor registers several Windows Management Instrumentation (WMI) providers to run under the local system account to access the information that the providers supply. Check This Out
I'm the only one on this computer and I don't use a > > Password. BTW, you posted to the ConfigMgr forum so I though you meant R2 not SP2. So much so, I wish I'd stayed with Office 2003. This will not cause issues and should be just ignored -- Peter Please Reply to Newsgroup for the benefit of others Requests for assistance by email can not and will not
I clicked Root and under Root I see MSAPP12. This account is privileged > and the provider may cause a security violation if it does not correctly > impersonate user requests. > > For more information, see Help and Support Mumbodog, Dec 28, 2008 #2 cronos1013 Thread Starter Joined: Dec 28, 2008 Messages: 11 I am using a regular user account when the error occurs. No, create an account now.
Sign Up Now! Loading... cronos1013, Dec 28, 2008 #3 Mumbodog Joined: Oct 3, 2007 Messages: 7,891 There will be a Microsoft Office startup entry on the "Startup Tab of msconfig, un-tick the box by it Outlook 2013 Event 63 Solved: Event 63, WMI Discussion in 'Windows Vista' started by cronos1013, Dec 28, 2008.
This security is layered on > top of the operating system security. Event Id 63 Outlook Edna Edna, Dec 15, 2008 #10 Advertisements Show Ignored Content Want to reply to this thread or ask your own question? Sonora Apr 10, 2015 Roy-helge Education, 1000+ Employees I got this issue on my Spiceworks Server aswell. I'm not on a Server but I > recall installing a large program in error, QML Server, something like > that, from MS Update site but it's long ago been uninstalled.
This account is privileged > and the provider may cause a security violation if it does not correctly > impersonate user requests. > > For more information, see Help and Support Dsccoreproviders I assume that the provider, OffProv11, is from Office 2003.MY QUESTIONS:What is this error?What is causing this error?What is the "WMI namespace"?How can I stop this error from happening again?Is this Register Privacy Policy Terms and Rules Help Popular Sections Tech Support Forums Articles Archives Connect With Us Twitter Log-in Register Contact Us Forum software by XenForo™ ©2010-2016 XenForo Ltd. This site is completely free -- paid for by advertisers and donations.
I just boot up and into Windows. > I read this carefully but it might as well been in a foreign language as, Peter Foldes, Dec 14, 2008 #8 Edna I concur to leave it as is but i know each time I see the Warning pop up I'm going to wish I had "Fixed" it. Event Id 63 Wmi Note this button doesn't read: Security ... Event Id 63 Wmi Policyagentinstanceprovider LOL.
This account is privileged > > and the provider may cause a security violation if it does not correctly > > impersonate user requests. > > > > For more information, his comment is here An example of English, please! About Us PC Review is a computing review website with helpful tech support forums staffed by PC experts. All others have read/write/execute > permissions on their local computer only. > > Permissions can be changed by adding a user to the Administrators group on > the managed computer or Wmi Event Id 63 Windows 7
Join over 733,556 other people just like you! This account is privileged and the provider may cause a security violation if it does not correctly impersonate user requests. I am in need of your invaluable help once again.My computer is running Windows XP Pro Edition. this contact form If ten years ago it was still common to see an entire company using just one server, these days that's no longer the case.
All rights reserved. The Exchange Web Service Request Getappmanifests Succeeded I haven't applied any Updates to Office 2007 but I have a dozen or more Event 63 Warnings since 25Nov08. For example: Vista Application Error 1001. home| search| account| evlog| eventreader| it admin tasks| tcp/ip ports| documents | contributors| about us Event ID/Source search Event ID: Event Blog: #4 csharma180 Total Posts : 419 Scores: -6 Reward points : 43320 Joined: 12/29/2008 Status: offline RE: Event ID 63 WINMGMT Thursday, May 14, 2009 12:56 PM This account is privileged and the provider may cause a security violation if it does not correctly impersonate user requests. Would u tell me what to expect or even tell me if I'm in the right spot. Event Id 63 Wmi Warning This board > usually has someone that can help. > > Peter Foldes, Dec 14, 2008 #2 Advertisements Edna Guest Peter, I need Help!!
Edna, Dec 14, 2008 #1 Advertisements Peter Foldes Guest -- Peter Please Reply to Newsgroup for the benefit of others Requests for assistance by email can not and will not I just boot up and into Windows. Edna Guest WXP Pro SP3, Office 2007, One User, DSL ISP Provider, P4 CPU 3.6, 2.00 GB Ram Desktop Wireless Network to a Laptop. Enter the product name, event source, and event ID.
Peter, I'm not retarded but ... Resart the PC, see if the error is gone. Windows XP provides greater flexibity for the security context providers can be made to run under. This security is layered on top of the operating system security.
It takes just 2 minutes to sign up (and it's free!). Even with 5 minutes per server (to check the logs and other parameters), it may take an hour to make sure that everything is ok and no "red lights" are blinking The only program in Office I've even OPENED is Word and I find the Toolbar excessive for my use having a Small Business. Thus, any changes made to a user's permissions while the user is > connected do not take effect until the next time the user starts a WMI > service.
To me that means there's no further Window with choices, to appear. This account is privileged and the provider may cause a security violation if it does not correctly impersonate user requests. TerryNet replied Jan 8, 2017 at 7:32 AM Problems dual booting Windows... Join our site today to ask your question.
This account is privileged and the provider may cause a security violation if it does not correctly impersonate user requests.Apr 14, 2010 A provider, PolicyAgentInstanceProvider, has been registered in the More About Us... Add link Text to display: Where should this link go? See ME820460 to find out for what providers this event is generated.
At least i do. "Edna" wrote: > > Peter, I need Help!! x 15 EventID.Net From a newsgroup post: "Typically occuring when a Service Pack is applied, these messages are completely normal. Access is based on WMI namespaces. Providers written for Windows 2000 do not take advantage of this flexibility and so they run in the most privileged account.
If I highlight MSAPPS12 and click on the Security button, what may I expect to see as to choices. | http://juicecoms.com/event-id/event-id-63-wmi.html | CC-MAIN-2018-05 | refinedweb | 1,246 | 62.98 |
Computes precision@k of the predictions with respect to sparse labels.
tf.compat.v1.metrics.precision_at_k( labels, predictions, k, class_id=None, weights=None, metrics_collections=None, updates_collections=None, name=None )>)..
Args:
labels:
int64
Tensoror
SparseTensorwith shape [D1, ... DN, num_labels] or [D1, ... DN], where the latter implies num_labels=1. N >= 1 and num_labels is the number of target classes for the associated prediction. Commonly, N=1 and
labelshas shape [batch_size, num_labels]. [D1, ... DN] must match
predictions. Values should be in range [0, num_classes), where num_classes is the last dimension of
predictions. Values outside this range are ignored.
predictions: Float
Tensorwith shape [D1, ... DN, num_classes] where N >= 1. Commonly, N=1 and predictions.
weights:
Tensorwhose rank is either 0, or n-1, where n is the rank of
labels. If the latter, it must be broadcastable to
labels(i.e., all dimensions must be either
1, or the same as the corresponding
labelsdimension).
metrics_collections: An optional list of collections that values should be added to.
updates_collections: An optional list of collections that updates should be added to.
name: Name of new update operation, and namespace for other dependent ops.
Returns:. | https://www.tensorflow.org/api_docs/python/tf/compat/v1/metrics/precision_at_k | CC-MAIN-2020-16 | refinedweb | 187 | 53.88 |
Posted 09 Feb 2016
Link to this post
Hi,
I want to achieve functionality of creating report definition file (trdx) programmatically and then display into HTML5 page.
For this, I was going through below links-
However, I couldn't achieve require functionality.
Could you please share step by step guide to achieve this functionality?
Posted 11 Feb 2016
Link to this post
If reports are created in Visual Studio or are available as TRDX files on the server, the viewer can request them directly by type's assembly qualified name or path to a TRDX file. If reports has to be customized at run-time (or created) you will need a custom report resolver for Reporting REST service.
For more details, please check the following help article: (HTML5 Viewer).
Posted 14 Feb 2016
Link to this post
Hi Stef,
Thanks for your reply.
As mentioned in link (), The reportSource.report part is a string that can be a path to a TRDX file, an assembly qualified name
of a report class.
When I use TRDX file, it works fine. However, when I use qualified name of a report class, it says - "Error creating report instance (Report = Telerik.Reporting.Report2).Report 'Telerik.Reporting.Report2' cannot be resolved."
Report2.cs is created using "Telerik Report Q1 2006 (Blank)" template.
Below is my Reports Controller code -
public class ReportsController : ReportsControllerBase
{
string selectCommand = @"SELECT * FROM AUDIT";
string connectionString = "<connstring deleted>";(),
};
public ReportsController()
{
this.ReportServiceConfiguration = configurationInstance;
Report2 report = new Report2();
Telerik.Reporting.SqlDataSource sqlDataSource = new Telerik.Reporting.SqlDataSource(connectionString, selectCommand);
report.DataSource = sqlDataSource;
}
}
Below is my HTML page code-
<div id="reportViewer1" class="k-widget">
</div>
<script type="text/javascript">
$("#reportViewer1")
.telerik_ReportViewer({
serviceUrl: "api/Reports",
reportSource: {
//report: "Report2.trdx",
report: "Telerik.Reporting.Report2",
parameters: {
CultureID: "en"
}
}
});
</script>
Please suggest, if I am missing anything here.
Posted 15 Feb 2016
Link to this post
Posted 16 Feb 2016
Link to this post
Hi Stef
Basically we want user to select report to view and section/fields it should contain.
Consider this scenario-
In a HTML5 page, you have a drop down which contains 4 reports.
user selects one of report and corresponding section /fields to be appear on report.
click on button to load that report.
On button click, we should hit WebApi Controller to process report trdx file and reload telerik_ReportViewer with latest trdx file.
Is this possible to achieve? If yes, please suggest some steps to begin with. | http://www.telerik.com/forums/creating-report-definition-file-programmatically-and-then-display-into-html5-page | CC-MAIN-2017-09 | refinedweb | 404 | 57.77 |
MP4AddTrackEdit - Add an edit segment to a track
#include <mp4.h>
MP4TrackId MP4AddTrackEdit(
MP4FileHandle hFile,
MP4TrackId trackId,
MP4EditId editId,
MP4Timestamp startTime = 0,
MP4Duration duration = 0,
bool dwell = false
)
Upon success, the edit id of the new edit segment. Upon an error, MP4_INVALID_EDIT_ID.
MP4AddTrackEdit adds an edit segment to the track edit list.
The track edit list is a feature that allows creation of an alternate timeline for the track, typically cutting out segments of the full track to form an shorten, cleaned up version. The edit segments that form the edit list are a sequence of track start times and durations, they do not alter the track media in any way. I.e. no data can be lost via edit list operations.
To read out the editted version of the track, use MP4ReadSampleFromEditTime() instead of MP4ReadSample().
To export the editted version of the track to a new track, potentially in a new mp4 file, see MP4CopyTrack().
Note with many media encodings such as MPEG-4, AAC, and MP3, care must be taken when choosing the edit segment start times. E.g. for video tracks a reference or key frame should be selected as the starting sample of any edit segment. For audio tracks, an audio sample start time should be used.
MP4(3) MP4DeleteTrackEdit(3) MP4ReadSampleFromEditTime(3) MP4CopyTrack(3) | http://www.makelinux.net/man/3/M/MP4AddTrackEdit | CC-MAIN-2015-40 | refinedweb | 219 | 63.49 |
Hello -
I am working on one of my labs, but I am having difficulty with the results being inconsistent.
The passing by reference is working. I tested random data and I don't understand why some works and others produces incorrect results.
Data tested:
5, 9, 7 = perimeter of 21 and area of 12.247 (correct)
5, 6, 9 = perimeter of 20 and area of 14.142 (correct)
9, 7, 3 = perimeter of 19 (this part is correct) and area of 0.000 (incorrect)
5, 8, 12 = perimeter of 25 (this part is correct) and area of 0.000 (incorrect)
Line 57 & 58: Compiler gives a warning of " converting to int from double. I don't understand this, since I'm sure I used the correct data types.
The output should be precision of 4 significant digits, but only the "area" is converting correctly, and not the perimeter.
I appreciate any input you guys may have. I checked my codes several times and I just can't seem to figure out the cause of the problems.
Thank you. :'(
#include <iostream> #include <iomanip> #include <cmath> using namespace std; bool isValid (int tri1, int tri2, int tri3); bool side; void calc(int a, int b, int c, double& s, double& area); int main () { int side_a, side_b, side_c; double s, area; // Function prompting user for 3 numbers to be used for triangle sides while (side != 1) //Establish loop here. If side not equal to 1, error encountered, try again. { cout << "Enter 3 lengths of the triangle sides: \n"; cout << " Side 1: "; cin >> side_a; cout << " Side 2: "; cin >> side_b; cout << " Side 3: "; cin >> side_c; cout << endl; /*Call isValid Function to determine if the user inputs are valid. isValid Function needs to loop until the correct values are entered */ bool side = isValid (side_a, side_b, side_c); { if (side = 0) { cout << "These edges do not form a triangle." << endl; side = 0; // Populate side with 0. Error encountered. Give it another try. } else // All ok? populate valid with 1, end the loop. { side = 1; // If sides = triangle, end loop and continue. } } } // end loop. /*Call calc Function - this function will return the value of perimeter and Area. (these values were stored in the reference parameters S and Area. Output should be perimeter only (side a, b, c) and area. Set precision to 4 */ calc (side_a, side_b, side_c, s, area); [B]return s * 2; // Line 57, warning converting to int from double return area; // Line 58, warning converting to int from double[/B] cout << fixed << setprecision (4); cout << "Your triangle has a perimeter of " << s << " and an area of " << area << endl; system ("pause"); return 0; }//end main // isValid Function bool isValid (int tri1, int tri2, int tri3) { if ((tri1 + tri2 > tri3) && (tri1 + tri3 > tri2) && (tri2 + tri3 > tri1)) side = 1; else side = 0; return side; } // end isValid /* Write a Function 'calc'. Return type = void, 5 parameters (a, b, c, &s, &area. Calculate s = semiperimeter and area. Results of s and area are to be stored in the reference parameters s and area */ void calc(int a, int b, int c, double& s, double& area) { s = ((a + b + c)/2); area =(s-a)*(s-b)*(s-c); area = area * s; area = sqrt (area); return; } // end calc function | https://www.daniweb.com/programming/software-development/threads/93562/pass-by-reference-in-function-call-results-not-correct | CC-MAIN-2018-47 | refinedweb | 535 | 70.33 |
Adding Unit Tests to a C Project - NetBeans IDE Tutorial
- Requirements
- Introduction
- Install the CUnit Testing Framework
- Create the Project for the Tutorial
- Add CUnit Tests to the NetBeans Managed Project
- Run the C Unit Test
- Add Another CUnit Test
- Debug My CUnit Test
- Add a Simple Test
- Edit the C Simple Test
- Run Tests From the Command Line
- Adding Support for Other Test Frameworks
Requirements
To follow this tutorial, you need the following software.
See the NetBeans IDE Installation Instructions and + Configuring the NetBeans IDE for C/C+/Fortran for information about downloading and installing the required NetBeans software.
Introduction:
C simple test
C++ simple test
CUnit test
CppUnit test
CppUnit test runner.
Install the CUnit Testing Framework:
How to Install CUnit on Linux or Mac OS $ sudo make install
When the 'make install' finishes, the CUnit test framework is ready to use in the IDE and you can continue on to Create the Project for the Tutorial.
How to Install CUnit on Oracle Solaris $ make install
When the 'make install' finishes, the CUnit test framework is ready to use in the IDE and you can continue on to Create the Project for the Tutorial.
How to Install CUnit on Windows and MinGW
These instructions assume you downloaded the file CUnit-2.1-2-src.tar.bz2 into the directory C:/distr. the C:/distr example.
Start the MinGW shell application in Windows by choosing Start > All Programs > MinGW > MinGW Shell.
In the MinGW Shell window, unpack the
CUnit-2.1-2-src.tar.bz2file as follows:
$ cd c:/distr $ bunzip2.exe CUnit-2.1-2-src.tar.bz2 $ tar xvf CUnit-2.1-2-src.tar $ cd /CUnit-2.1-2
Find the Unix path to MinGW using the mount command.
$ mount
You see output similar to the following:)*
The last line in bold above shows the Unix path is /mingw. Your system may report something different, so make a note of it because you need to specify the path in the next command.
Configure the Makefile with the following command. If your MinGW is not in /mingw, be sure to specify the appropriate Unix location of your MinGW with the --prefix= option.
$ libtoolize $ automake --add-missing $ autoreconf $ ./configure --prefix=/mingw _(lots of output about checking and configuring) ..._ config.status: executing depfiles commands config.status: executing libtool commands
Build the library for CUnit:
$ make make all-recursive make[1]: Entering directory 'c/distr/CUnit-2.1-2' Making all in CUnit ... _(lots of other output)_ make[1]: Leaving directory 'c/distr/CUnit-2.1-2' $
Install the CUnit library into C:/MinGW/include/CUnit, C:/MinGW/share/CUnit and C:/MinGW/doc/CUnit by running make install:
$' $
If you use Java 7 update 21, 25, or 40 you must perform the following workaround due to issue 236867 in order to get CUnit and this tutorial to work.
Go to Tools > Options > C/C++ > Build Tools and select the MinGW tool collection.
Change the Make Command entry to make.exe without a complete path.
Exit the IDE.
On Windows 7 and above, type var in the Start menu’s search box to quickly find a link to Edit the system environment variables.
Select the Advanced tab and click Environment Variables.
In the System Variables panel of the Environment Variables dialog, select click New.
Set the Variable Name to MAKE and the Variable Value to make.exe.
Click OK in each dialog to save the change.
Start the IDE and continue to the next section.
When the 'make install' finishes, your CUnit is ready to use in the IDE and you can continue on to Create the Project for the Tutorial.
How to Install CUnit on Windows and Cygwin.
Create the Project for the Tutorial
To explore the unit test features, you should first create a new C Application:
Choose File > New Project.
In the project wizard, click C/C and then select C/C Application.
In the New C/C++ Application dialog box, select Create Main file and select the C language. Accept the defaults for all other options.
Click Finish, and the Cpp_Application__x_ project is created.
In the Projects window, open the Source Files folder and double-click the
main.cfile to open it in the editor. The file’s content is similar to that shown here:
To give the program something to do, replace the code in the
main.cfile with the following code to create a simple factorial calculator:
:
Save the file by pressing Ctrl+S.
Build and run the project to make sure it works by clicking the Run button in the IDE toolbar. The output should look similar to the following if you enter 8 as the integer:
You might need to press Enter twice on some platforms.
Add CUnit Tests to the NetBeans Managed Project
When you are developing an application, it is a good idea to add unit tests as part of your development process.
Each test should contain one
main function and generate one executable.
In the Projects window, right-click the
main.csource file and select Create Test > New CUnit Test.
A wizard opens to help you create the test.
In the wizard’s Select Elements window, click the checkbox for the
mainfunction. This causes all the functions within
mainto also be selected. In this program, there is only one other function,
factorial().
Click Next.
Keep the default name New CUnit Test and click Finish.
The New CUnit Test node is displayed under the Test Files folder.
The New CUnit Test folder contains the template files for the test. You can add new files to the folder the same way you add source files to a project, by right-clicking the folder.
Expand the New CUnit Test folder, and see that it contains a file
newcunittest.cwhich should be open in the source editor.
In the
newcunittest.cfile, notice the
#include "CUnit/Basic.h"statement to access the CUnit library. The
newcunittest.cfile contains an automatically generated test function,
testFactorial, for the
factorial()function of
main.c.
>
The generated test is a stub that you must edit to make useful tests, but the generated test can be run successfully even without editing.
Run the C Unit Test
The IDE provides a few ways to run tests. You can right-click the project node, or the Test Files folder, or a test subfolder, and select Test. You can also use the menu bar and select Run > Test Project, or press Alt+F6.
Run the test by right-clicking the New CUnit Test folder and selecting Test.
The IDE opens a new Test Results window, and you should see output similar to the following, which shows that the test fails.
If you do not see the Test Results window, open it by choosing Window > IDE Tools > Test Results or by pressing Alt+Shift+R.
Notice that the Test Results window is split into two panels. The right panel displays the console output from the tests. The left panel displays a summary of the passed and failed tests and the description of failed tests.
In the Test Results window, double-click the node
testFactorial caused an ERRORto jump to the
testFactorialfunction in the source editor. If you look at the function you can see that it does not actually test anything, but merely asserts that the unit test failed by setting CU_ASSERT(0). The condition evaluates to 0, which is equivalent to FALSE, so the CUnit framework interprets this as a test failure.
Change the line CU_ASSERT(0) to CU_ASSERT(1) and save the file (Ctrl+S).
Run the test again by right-clicking the New CUnit Test folder and selecting Test. The Test Results window should indicate that the test passed.
Add Another CUnit Test
Create a generic CUnit test template by right-clicking the Test Files folder and selecting New CUnit Test.
Name the test My CUnit Test and the test file name
mycunittestand click Finish.
A new test folder called My CUnit Test is created and it contains a
mycunittest.cfile, which opens in the editor.
Examine the
mycunittest.ctest file and see that it contains two tests. test1 will pass because it evaluates to TRUE, and test2 will fail because it evaluates to FALSE since 2*2 does not equal 5.
void test1() { CU_ASSERT(2*2 == 4); } void test2() { CU_ASSERT(2*2 == 5); }
Run the test as before and you should see:
Run all the tests from the IDE main menu by selecting Run > Test Project (Cpp_Application__x_) and see that both test suites run and display their success and failure in the Test Results window.
Mouse over the failed test to see more information about the failure.
Click the buttons in the left margin of the Test Results window to show and hide tests that pass or fail.
Debug My CUnit Test
You can debug tests using the same techniques you use to debug your project source files, as described in the Debugging C/C+ Projects Tutorial+.
In the Projects window, right-click the My CUnit Test folder and select Step Into Test.
You can also run the debugger by right-clicking a test in the Test Results window and selecting Debug.
The debugger toolbar is displayed.
Click the Step Into button to execute the program one statement at a time with each click of the button.
Open the Call Stack window by selecting Window > Debugging > Call Stack so you can watch the function calls as you step through the test.
Add a Simple Test
The C simple test uses the IDE’s own simple test framework. You do not need to download any test framework to use simple tests.
In the Projects window, right-click the
main.csource file and select Create Test > New C Simple Test.
In the wizard’s Select Elements window, click the checkbox for the
mainfunction, then click Next.
In the Name and Location window, keep the default name New C Simple Test and click Finish.
The New C Simple Test node is displayed under the Test Files folder.
Expand the New C Simple Test folder, and see that it contains a file
newsimpletest.c. This file should be open in the source editor.
Notice the
newsimpletest.cfile contains an automatically generated test function,
testFactorial, for the
factorial()function of
main.c, just as with the CUnit test.
.
Run the test to see that it generates a failure shown in the Test Results window.
Next you edit the test file to see tests that pass.
Edit the C Simple Test
Copy and paste a new function below the
testFactorialfunction. The new function is:
void testNew() { int arg = 8; long result = factorial(arg); if(result != 40320) { printf("%%TEST_FAILED%% time=0 testname=testNew (newsimpletest) message=Error calculating %d factorial.\n", arg); } }
The
main function must also be modified to call the new test function.
In the
mainfunction, copy the lines:
printf("%%TEST_STARTED%% testFactorial (newsimpletest)\n"); testFactorial(); printf("%%TEST_FINISHED%% time=0 testFactorial (newsimpletest)\n");
Paste the lines immediately below the ones you copied, and change the name
testFactorialto
testNewin the pasted lines. There are three occurrences that need to be changed. The complete
newsimpletest.cfile should look as follows:
); }
In the Projects window, run the test by right-clicking New C Simple Test and choosing Test. The Test Results should look as follows:
.
Run Tests From the Command Line.
Open a terminal window in the IDE by selecting Window > Output and clicking the Terminal button in the left margin of the Output window. This opens a terminal window at the working directory of the current project.
In the terminal, type the commands shown in bold:
*make test*
The output of the test build and run should look similar to the following. Note that some
make output has been deleted.
'
Adding Support for Other Test Frameworks
You can add support for your favorite C/C test framework by creating a NetBeans module. See the NetBeans developer's link:[+C/C Unit Test Plugin Tutorial+] on the NetBeans wiki.
link:mailto:users@cnd.netbeans.org?subject=Feedback:%20Adding%20Unit%20Tests%20to%20a%20C/C+%20Project%20-%20NetBeans%20IDE%207.4%20Tutorial[+Send Feedback on This Tutorial] | https://netbeans.apache.org/kb/docs/cnd/c-unit-test.html | CC-MAIN-2022-33 | refinedweb | 2,031 | 65.22 |
The UNION virtual table (hereafter: "union-vtab") is a virtual table that makes multiple independent rowid tables tables look like a single large table.
The tables that participate in a union-vtab can be in the same database file, or they can be in separate databases files that are ATTACH-ed to the same database connection.
The union-vtab is not built into SQLite. Union-vtab is a loadable extension. The source code for union-vtab is contained in a single file located at ext/misc/unionvtab.c in the SQLite source tree.
A new union-vtab instance is created as follows:
CREATE VIRTUAL TABLE temp.tabname USING unionvtab(query);
Every union-vtab must be in the TEMP namespace. Hence, the "temp." prior to tabname is required. Only the union-vtab itself is required to be in the TEMP namespace - the individual tables that are being unioned can be any ATTACH-ed database.
The query in the CREATE VIRTUAL TABLE statement for a union-vtab must be a well-formed SQL query that returns four columns and an arbitrary number of rows. Each row in the result of the query represents a single table that is to participate in the union.
The query for the CREATE VIRTUAL TABLE statement of a union-vtab can be either a SELECT statement or a VALUES clause.
The query is run once when the CREATE VIRTUAL TABLE statement is first encountered and the results of that one run are used for all subsequent access to the union-vtab. If the results of query change, then the union-vtab should be DROP-ed and recreated in order to cause the query to be run again.
There must be no overlap in the bands of rowids for the various tables in a union-vtab.
All tables that participate in a union-vtab must have identical CREATE TABLE definitions, except that the names of the tables can be different.
All tables that participate in a union-vtab must be rowid tables.
The column names and definitions for tabname will be the same as the underlying tables. An application can access tabname just like it was one of the real underlying tables.
No table in a union-vtab may contain entries that are outside of the rowid bounds established by the query in the CREATE VIRTUAL TABLE statement.
The union-vtab shall optimize access to the underlying real tables when the constraints on the query are among forms shown below. Other kinds of constraints may be optimized in the future, but only these constraints are optimized in the initial implementation.
Other kinds of constraints may be used and will work, but other constraints will be checked individually for each row and will not be optimized (at least not initially). All constraint checking is completely automatic regardless of whether or not optimization occurs. The optimization referred to in this bullet point is a performance consideration only. The same result is obtained regardless of whether or not the query is optimized.
The union-vtab is read-only. Support for writing may be added at a later time, but writing is not a part of the initial implementation.
Nota bene: The sqlite3_blob_open() interface does not work for a union-vtab. BLOB content must be read from the union-vtab using ordinary SQL statements.
SQLite is in the Public Domain. | https://docs.w3cub.com/sqlite/unionvtab | CC-MAIN-2021-10 | refinedweb | 558 | 63.7 |
CodePlexProject Hosting for Open Source Software
I recently got to know about PTVS and used it for a small project. Auto-complete and the debugging capabilities are awesome!
I wrote some unit tests too (based on unittest module). But couldn't find unit tests related integration with VS. For example it would be nice to have:-
1. "Python unit tests" project template.
2. A unit test adapter for visual studio 2012 which will enable VS to discover the test cases and list them under test explorer (and execute them too, of course!)
Does something like this already exist or any work being done already?
If not, I would like to contribute.
Thanks!
We do have some work underway on the test adapter, so hopefully we'll have that available in our next release.
The project template is not something we've discussed yet, so if you'd like to contribute that we'd love to take a look. (Even better would be a project wizard that can use our analyzer module to generate basic tests, though I'll understand if you're not
offering that much free work :) )
This is what I had in mind for the template. Create a simple .pyproj and a <ProjectName>Test.py file. The .py file could be extremely simple
and static:
import unittest
class MyTestClass(unittest.TestCase):
def test_method(self):
pass
if __name__ == "__main__":
unittest.main()
Did you have something in mind, where we can look at the product code and then generate blank test methods for every method of every class? (I don't know anything about the analyzer module)
I have a lot of things in mind, which is a luxury that I get because I don't have to decide whether we can afford the time to implement it :)
We'll be meeting internally this week to plan our next major release, which will almost certainly feature unit testing. Depending on how we rank other features (to get an idea of what we'll be looking at, go to the Issue Tracker and sort by votes),
we may get to do something clever with generating tests. We'll certainly have at least a template like that one, but if we can be more helpful for developers then we will be.
I see "unit test integration" is running 3rd in the issue tracker, which is good :)
I would be happy to know what get's decided in the meeting.
We do have some work underway on the test adapter
Are you sure you want to delete this post? You will not be able to recover it later.
Are you sure you want to delete this thread? You will not be able to recover it later. | http://pytools.codeplex.com/discussions/406060 | CC-MAIN-2016-50 | refinedweb | 453 | 70.84 |
This is Lamar Football
The Southland Conference
Table of Contents/Fast Facts.............................2-3 Dauphin Athletic Complex.................................4-5 Provost Umphrey Stadium..................................6-7 Football Facilities ...............................................8-9 Sport Performance ...............................................10 Athletic Training...................................................11 Lamar University .............................................12-13 Campus Life ....................................................14-15 Sheila Umphrey Rec Sports Center .................16-17 Student-Athlete Experience .................................18 Lamar Athletic Excellence ...................................19 Beaumont & The Golden Triangle .................20-21
Southland Conference History ............................88 2012 SLC Standings & Individual Honors...........89 2012 SLC Statistics ..........................................90-92 2013 SLC Composite Schedule.............................93
Coaching & Support Staff Head Coach Ray Woodard..............................22-23 Assistant Head Coach Allen Johnson ..................24 Defensive Coordinator Bill Bradley .....................25 Offensive Coordinator Larry Kueck ....................26 Assistant Coach Craig McGallion........................27 Assistant Coach James Brown .............................28 Assistant Coach Carey Bailey ..............................29 Assistant Coach Kevin Barbay.............................30 Assistant Coach Chuck Langston ........................31 Dir. of Football Operations Brett Ramsey ..........32 Football Graduate Assistants ...............................33 Football Support Staff .....................................34-37 Lamar President Dr. James Simmons..................38 Athletics Director Jason Henderson ....................39
Meet the Cardinals 2012 Player Rosters ..........................................40-41 2012 Preseason Depth Chart ................................42 2012 Returning Player Profiles ........................43-69 2012 Newcomers .............................................70-76
2012 Season in Review 2011 Results and Statistics...............................78-79 2011 Superlatives ..............................................80-81 2011 Game Recaps...........................................82-87
Lamar Football History Miscellaneous Games ..........................................95 All-Time Series Records ......................................96 All-Time Series Results ...................................97-98 Lamar Football History.................................96-106 Lamar Coaching History....................................107 All-Conference Players .......................................108 Specialty Awards & NFL Players .......................109 Senior College Lettermen.............................110-115 Junior College Lettermen .............................116-117 Cardinal Hall of Honor ................................118-119
Records Offensive Team Records ....................................120 Defensive Team Records ....................................121 Individual Records .......................................122-123 Individual Rushing Records...............................124 100-yard Rushers.................................................125 Individual Passing Records .........................126-127 Individual Receiving Records......................128-129 Individual Total Offense.....................................130 All-Purpose Yards & Scoring Records................131 Punting Records .................................................132 Punt Return Records ..........................................133 Junior College Results..................................134-135 Senior College Results .................................136-138
Media Information Media Information .......................................140-141 Campus Map ......................................................142
General
History
School..........................................................Lamar University Location .......................................Beaumont, Texas (114,000) Founded ...........................................................................1923 Enrollment.....................................................................14,522 Nickname ................................................................Cardinals Colors ..............................................................Red and White Conference..............................................................Southland National Affiliation ...........................NCAA Division I - FCS President ..............................................Dr. Kenneth R. Evans Athletics Director ........................................Jason Henderson Faculty Representative .............................Dr. Hsing-wei Chu Senior Woman Administrator .............................Helene Thill Athletic Department.........................................(409) 880-2248 Ticket Office .....................................................(409) 880-1715
First Year of Football .......................................................1923 First Year as a Senior College...........................................1951 First Year of Southland Football......................................1964 All-Time Record (4-year) ......................184-246-9/41 seasons All-Time Southland Record .....................39-86-2/24 seasons Southland Conference Championships/Last...............4/1971
Coaching Staff Head Coach...........Ray Woodard (Sam Houston State, 1988) Record at Lamar/Seasons.............................13-21/3 Seasons Overall 4-Year Record/Seasons .....................................Same Office Phone.....................................................(409) 880-7157 Assistant Head Coach-Secondary:.............................Allen Johnson (Texas A&M-Commerce ’99) Offensive Coordinator-Quarterbacks: ..................Larry Kueck (Stephen F. Austin ’75) Defensive Coordinator: ..........................Bill Bradley (Texas) Recruiting Coordinator-Linebackers: .........Craig McGallion (Houston ’84) Running Backs: ..............................James Brown (Texas ’00) Offensive Line: ..................Chuck Langston (Oklahoma ’95) Defensive Line: ........................Carey Bailey (Tennessee ‘92) Wide Receivers: ............................Kevin Barbay (Lamar ’05) Director of Football Operations: ..Brett Ramsey (Lamar ’11) Graduate Assistant-Linebackers: .Eric Hicks (Maryland ‘12) Graduate Assistant-Offense: ..........Jason Smith (Liberty ‘11) Strength and Conditioning Coach: ......................Josh Miller (Southeastern La. ‘09) Head Athletic Trainer:...Josh Yonker (Northern Colorado ’03)
Team Information
2012 Overall Record............................................................4-8 2012 Home Record .............................................................4-2 2012 Away Record...............................................................0-6 2012 Southland Conference Record/Finish ................1-6/7th Offensive Formation............................................Multiple Set Defensive Formation..........................................................3-4 Starters Returning/Lost ..................................................19/7 Offensive Starters...........................................................8/3 Defensive Starters ..........................................................7/4 Special Team Starters ....................................................4/0 Letterwinners Returning/Lost ......................................48/27
Stadium Information Stadium ........................................Provost Umphrey Stadium Year Opened ...................................1964 as Cardinal Stadium Record at Stadium/Seasons.....................75-75-3/29 seasons Capacity .........................................................................16,000 Surface ..................................................................Matrix Turf Press Box Phone ..............................................(409) 880-7489
Lamar Media Relations Director/Football Contact .................................James Dixon Office Phone ....................................................(409) 880-8329 Cell Phone ............................................................................... E-Mail ..............................................james.dixon@lamar.edu Office Fax .........................................................(409) 880-2338 Athletics Web Site........................... Assistant Director..................................................Pat Murray Office Phone ....................................................(409) 880-2323 Cell Phone.........................................................(409) 651-0521 Assistant Director/Secondary Contact.............Clay Trainum Office Phone ....................................................(409) 880-7845 Cell Phone ........................................................(409) 651-5588 SID Mailing Address.......................................P.O. Box 10066 ...............................................................Beaumont, TX 77710 Overnight Address....................Montagne Center, Room 138 .....................................................................211 Redbird Lane ...............................................................Beaumont, TX 77710
The 2013 Lamar University Football Yearbook is a publication of the Lamar University Athletics Media Relation Office. The guide was edited and designed by Erik J. Cox with editorial assistance from Clay Trainum, Pat Murray and Trace Baker. Photography by Mike Tobias, Will France, Guiseppe Barranco, Matt Billiot, Tino Mauricio, Tammy McKinley and various other contributors. Covers designed by Clay Trainum.
Lamar University was able to return to the gridiron thanks in large part to the generosity of donors like Walter Umphrey and his partners at Provost Umphrey law firm. In recognition of a gift from the Beaumont-based law firm and an additional gift from Umphrey and his wife, Sheila, the name “Provost Umphrey Stadium� graces the renovated facility where fans cheer on the Cardinals. The renovated stadium features all new bench and chair-back seating, new restroom and concession facilities, a new concourse area, and increased handicap accessible seating areas. In addition, the installation of new lighting and a Matrix field turf playing surface provides a state-of-the art venue that will not only hold up to challenging weather conditions, but also allow the stadium to be a multiuse statistics, out of town game information, sponsors' messages, graphics and animation.
Opening and Dedication Today’s plush and newly-renovated Provost Umphrey Stadium was originally built for a cost of $1 million with the construction period lasting from May of 1963 through July of 1964. It was dedicated during ceremonies prior to Lamar’s 21-0 season opening victory over East Central Oklahoma on Sept. 19, 1964. Lamar fullback Darrell Johnson scored the first touchdown in stadium history on a 30-yard run during the second quarter of that game. The Cardinals have compiled a 67-69-3 record in the stadium with their longest winning streak being 12 games spanning the 1965-1967 seasons.
Attendance Records Att. 18,500 17,600 17,306 17,250 17,222 17,187
Date 9/13/80 9/22/79 10/9/10 10/6/79 9/17/77 10/2/10
Opponent Baylor Louisiana Tech Langston University West Tex. St. La.-Lafayette Sam Houston State
Team Records Most Points Scored by Lamar: 58 vs. Texas College (9/3/11) Most Points by Opponent: 69 by Stephen F. Austin (11/5/11) Most Combined Points: 80, Lamar 45, Incarnate Word 35 (9/17/11) Most Yds Total Offense: 675 by Louisiana Tech (11/16/68) Most Pass Attempts: 62 by McMurry University (10/13/12)
Individual Records
Points: 24 by Tim Flanders, Sam Houston State (10/27/12); by Kevin Johnson, Lamar (10/13/12); by DePauldrick Garrett, Lamar (9/3/11) Total Offense: 412 yards by Ron Rittiman, Texas State (9/10/88) Yards Rushing: 222 by Burton Murchison, Lamar (9/14/85) Rushing Attempts: 33 by Floyd Dorsey, Lamar (9/18/82) Longest Rushing Play: 85 yards by Eugene Washington, Lamar (11/6/65) Yards Passing: 412 by Shad Smith, Lamar (10/10/87) Passes Attempted: 45 by John Holman, Louisiana-Monroe (10/30/82) Passes Completed: 31 by John Evans, Lamar (11/5/88) Longest Pass Play: 93 yards, Johnny Holley to Carl Williams, Texas Southern (10/2/82) Passes Caught: 14 by J.J. Hayes, Lamar (11/19/11) Yards Receiving: 212 by J.J. Hayes, Lamar (10/8/11)
The J.B. Higgins Weight room is located on the bottom floor of the (athletic complex). Open since September 2010, the sport performance facility is the training home for all of the Lamar Athletic Teams. The facility has 8,000 square feet of functional work out space, three offices, one storage room for equipment and supplements, and a media room (total of 10,000 square feet). Director – Joshua Miller, SCCC, USAW
Equipment
16 Power Racks with Olympic Platforms 24 Benches 60 pair of Dumbbells – (5 – 140 lbs.) 4 Reverse Hyperextensions 4 Glute Ham Machines 2 Leg Press
Accessories
8 24” Plyo Boxes 8 18” Plyo Boxes 4 Bear Squat Machines 1 Hip Machine 2 Neck Machines 2 Lat-Pull Machines 2 Shoulder Press Machines 12 Adjustable Hurdles 3 3 3 3 3 1
Cardio Equipment
Treadmills Cross trainers Stationary Bikes Recumbent Bikes Ellipticals Arm Ergometer
La mar Foo tba l l Coaching Staff
Ray Woodard Head Coach - Fourth Season Ray Woodard begins his fourth season at the helm of the Lamar football program in 2013 with a promising future on the horizon. The 2012 season saw Lamar compete against a pair of Football Bowl Subdivision (FBS) teams for the first time since reinstating the program. The Cardinals, who finished 4-8 on the year, took on former conference rival Louisiana-Lafayette and also took a trip to face the University of Hawaii. Under Woodard in 2012, Lamar had the Southland Conference Newcomer of the Year in wide receiver Kevin Johnson and a pair of Cardinals earned allconference accolades. Johnson tied the school record with 13 touchdowns on the season, catching 10 scores, returning two kickoffs and adding a rushing touchdown. Senior offensive lineman Sean Robertson and junior defensive lineman Jesse Dickson were both named to the all-conference second-team as Lamar played its second full Southland Conference schedule since restarting the program in 2010.. Lamar had a pair of players earn second-team All-Southland Conference honors in wide receiver J.J. Hayes and offensive lineman Anthony Oden. Six other Cardinals earned honorable mention all-conference honors, including wide receiver Marcus Jackson who signed a free agent deal to play for the NFL's Atlanta Falcons following the 2012 draft. All this coming on the heels of an historic year in 2010. Not only did the Cardinals take the field for the first time since 1989, but they turned a lot of heads with their immediate success on the gridiron. In their very first game - at McNeese State on Sept. 4 - they set a school record with 429 passing yards, and two weeks later - at Southeastern Louisiana quarterback Andre Bevil led a fourth-quarter comeback that sparked a 29-28 victory over the stunned highly-favored Lions. Woodard guided the Cardinals to a 5-6 overall record, which included a 4-2 mark in newly refurbished Provost Umphrey Stadium while playing in front of capacity crowds in their first reflected in the fact Woodard was one of five finalists voted for the Southeast Texas Press Club's 2010 Newsmaker of the Year Award. McNeese State was ranked 11th in the nation when the Cardinals put a scare into the Cowboys before falling 30-27 in the season opener for both teams. A week later, playing its home opener in front of a red-clad crowd of 16,600, Lamar earned its first victory in over two decades by a 21-14 margin over Webber International. Lamar added four more victories, including the impressive 29-28 come-frombehind win at Southeastern Louisiana. A high-powered offense, which set 15
22
team or individual records during the season, became the signature for the 2010 Cardinals who closed the year with a dominating 44-6 dismantling of Oklahoma Panhandle State. Woodard was named the eighth football coach at Lamar University by university president James Simmons and then athletics director Billy Tubbs on May 19, 2008. He came to Lamar after serving three seasons at Navarro College - the first two as defensive coordinator and the final as head coach. His 2007 squad went 9-3 and advanced to the conference playoffs for the first time in six seasons. Navarro defeated defending national champion Blinn College.. Woodard spent three years as the defensive coordinator for the Scottish Claymores from 2000-03 during his second stint with an NFL Europe franchise. Woodard's other professional coaching experience came as the general manager/head coach for the Houston Outlaws (1999-2000) of the Regional Football
L a m a r Fo otbal l Coaching Staff League, defensive coordinator of the Frankfurt Galaxy (1996-97) of NFL Europe and the Texas Terror (1996) of Personal the Arena Football Birthdate .............................August 20, 1961 League. Hometown ..........................Corrigan, Texas Wo o d a r d ' s Wife .......................................................Penne first experience at the Children................................................Jessica NCAA level came in 1998 when he was the defensive line coach at Education Louisiana-Lafayette. 1981............................A.A., Kilgore College Lineman Danny Scott 1988 .......................B.S., Sam Houston State registered eight sacks, 1991.....................................M.Ed., UT-Tyler which ranks fourth in the ULL single-season list. Playing Career From 1988-95 1980-81 ................................Kilgore College Woodard was the defen1982-83 .........................University of Texas sive coordinator at Kil1984-85.........................San Diego Chargers gore College and 1986-87 ...............................Denver Broncos recruited more than 200 Texas high school stu........Member of 1986 Super Bowl Team dent-athletes. The 1987-88...........................Kansas City Chiefs Rangers appeared in back-to-back Shrine Bowls in 1989 and 1990. Coaching Career Kilgore had a 9-2 record 1988-95 ................................Kilgore College in 1990, won the confer..................................Defensive Coordinator ence championship and 1995 ...............................Texas Terror (Arena) was ranked as high as ..................................Defensive Coordinator No. 6 in the country. Woodard also 1996-97 ........Frankfurt Galaxy (NFL Europe) had a successful playing ..................................Defensive Coordinator career, from his days at 1998 ...............................Louisiana-Lafayette Corrigan-Camden HS ...................................Defensive Line Coach to Kilgore College and 1999-2000..Houston Outlaws (Regional FBL) the University of Texas ....................General Manager/Head Coach to five years in the NFL. 2000-03.....Scottish Claymores (NFL Europe) After earning 13 letters in four sports at Corri..................................Defensive Coordinator gan-Camden from 2005-06 ...............................Navarro College 1975-79, he walked on .............Defensive/Recruiting Coordinator at Kilgore College then 2007.....................................Navarro College went on to became a .....................................................Head Coach two-time All-America 2010- ..................................Lamar University selection as a defensive tackle from 1980-81. .....................................................Head Coach
The Woodard File
Woodard vs. All Opponents Opponent Central Arkansas Georgia State Hawai`i Incarnate Word Langston University Louisiana-Lafayette McMurry University McNeese State Nicholls North Dakota Northwestern State Oklahoma Panhandle State Prairie View A&M Sam Houston State South Alabama South Dakota Southeastern Louisiana Stephen F. Austin Texas College Texas State Webber International Totals
W-L 0-2 0-1 0-1 1-0 2-0 0-1 1-0 0-3 2-0 0-1 0-2 1-0 1-0 0-3 0-2 1-0 2-1 0-3 1-0 0-1 1-0 13-21
Home 0-1
Away 0-1 0-1 0-1
1-0 2-0 0-1 1-0 0-1 1-0 0-1 1-0 1-0 0-2 0-1 1-0 0-1 0-1 1-0
0-2 1-0 0-1 0-1 0-1 0-1 2-0 0-2 0-1
1-0 10-8
3-13
Houston State University in 1988 and his master's in education from the University of Texas at Tyler in 1991. Woodard and the former Penne Striedel.
Ray and Penne Woodard
23
La mar Foo tba l l Coaching Staff
Allen Johnson Assistant Head Coach - Secondary
Allen Johnson, who spent the 2011 season at Lamar as co-defensive coordinator, is entering his second year as assistant head coach in charge of the Cardinals’ secondary. Prior to coming to Lamar, Johnson coached the cornerbacks at the University of Texas-El Paso for three seasons. Johnson, who earned his bachelor’s degree in health and kinesiology at Texas A&M-Commerce in 1999 and his master’s degree in the same field a year later, played collegiately at Kilgore College, Central Oklahoma and A&M-Commerce. When he was at Kilgore, he played under Woodard who was then Kilgore’s defensive coordinator.. At UTEP, Johnson coached such star defensive backs as Cornelius Brown, Melvin Stephenson and
24
Clarence Ward, all of whom played briefly in the National Football League. Before going to UTEP, Johnson spent the 2007 season as the defensive backs coach and recruiting coordinator at Midwestern State University, which fielded the top defense in the Lone Star Conference that year. In going 8-3 that season, Midwestern State led the league in scoring defense (18.6 points-pergame average), total defense (294.2 yards-per-game average) and rushing defense (93.9 yards-per-game). In 2006, Johnson served as the quality control coach at Oklahoma State University, helping lead the Cowboys to seven wins and an Independence Bowl victory. Johnson started his coaching career at Texas A&M-Commerce in 1999, and after two years there, he spent the next four seasons in the high-school coaching ranks at Gaither HS in Tampa, Fla., at Plant HS in Tampa and at Newman Smith HS in Carrollton, Texas. Johnson doubled as the secondary coach and recruiting coordinator at Blinn College in 2005, helping the team qualify for the National Junior College Athletic Association playoffs. Johnson, who was an all-district defensive back at Desoto High School, and his wife, Jennifer, have three daughters – Jayla, Kyra and Olivia.
The Johnson File Personal Birthdate.......................September 11, 1972 Hometown .............................Desoto, Texas Wife ....................................................Jennifer Children .....................Jayla, Kyra and Olivia
Recruiting Area Dallas Metroplex, Houston
Education 1999...............B.S., Texas A&M-Commerce 2000..............M.S., Texas A&M-Commerce
Playing Career 1991-92 ................................Kilgore College 1993 .......................Central Oklahoma State 1998........................Texas A&M-Commerce
Coaching Career 1999........................Texas A&M-Commerce ...............................Student Assistant Coach 2000........................Texas A&M-Commerce ............................Graduate Assistant Coach 2001.......................Gaither HS, Tampa, Fla. ..................................Defensive Coordinator 2002 ............................Plant HS, Tampa, Fla ..............................................Assistant Coach 2003-04.....Newman HS, Carrollton, Texas ..............................................Assistant Coach 2005 ..........................................Blinn College Secondary Coach, Recruiting Coordinator 2006 ..................Oklahoma State University ..................................Quality Control Coach 2007 ................Midwestern State University Secondary Coach, Recruiting Coordinator 2008-10.................................................UTEP ........................................Cornerbacks Coach 2011.......................................................Lamar ...........................Co-Defensive Coordinator 2012- .....................................................Lamar ................Assistant Head Coach-Secondary
L a m a r Fo otbal l Coaching Staff
Bill Bradley Defensive Coordinator
Former National Football League pro bowler and longtime coach Bill Bradley begins his second season as the defensive coordinator at Lamar. 200406. singleseason.
The Bradley File Personal
Birthdate.............................January 24, 1947 Hometown...........................Palestine, Texas Wife........................................................Susan Children .........................Matthew & Carissa
Recruiting Area San Antonio Area
Education
1965-68 .........................University of Texas
Playing Career
1966-68 .........................University of Texas 1969-76..........................Philadelphia Eagles 1977.................................St. Louis Cardinals
Coaching Career
1983-84.San Antonio Gunslingers (USFL) ................Assistant Coach/Quality Control 1985 ..............Memphis Showboats (USFL) ..............................................Assistant Coach 1987 ...............................University of Texas ........................................Volunteer Assistant 1988-90 .............Calgary Stampeders (CFL) ..................................Defensive Coordinator 1991-92 .........San Antonio Riders (WLAF) ..................................Defensive Coordinator 1993-94...............San Antonio Texas (CFL) ..................................Defensive Coordinator 1994-95 .....Sacramento Goldminers (CFL) ..................................Defensive Coordinator 1996-97 ..............Toronto Argonauts (CFL) ..................................Defensive Coordinator 1998-2000 .....................Buffalo Bills (NFL) .................................Defensive Backs Coach 2001-03 ......................New York Jets (NFL) .................................Defensive Backs Coach 2004-06..............................Baylor University ..................................Defensive Coordinator 2007-08 ............San Diego Chargers (NFL) .................................Defensive Backs Coach 2009-10 ....................Florida Tuskers (UFL) .................................Defensive Backs Coach 2012- ..................................Lamar University ..................................Defensive Coordinator
25
La mar Foo tba l l Coaching Staff
Larry Kueck Offensive Coordinator - Quarterbacks
Larry Kueck, who served as coach Ray Alborn’s offensive coordinator and quarterbacks coach at Lamar from 1986-89, is in his second year with the program in the same capacity. Kueck brings 28 years of collegiate coaching experience to Lamar, including nearly 20 years as an offensive coordinator. He has spent the last four years coaching high school football in Texas, but is returning to the college level where he has enjoyed a great amount of success. During his first tenure in Beaumont, the Lamar passing game put up the most prolific numbers in school history. Kueck helped guide quarterback John Evans to school records for single-season and career passing yards. Evans also set the school record for career touchdown passes with Kueck directing Lamar’s offense. Prior to returning to the Texas high school ranks, Kueck spent six seasons as the offensive coordinator and quarterbacks coach at Marshall University. It was his second stint at the school as he spent the 1996 season with the Thundering Herd, helping Marshall to the Football Championship Subdivision (formerly IA, Byron Leftwich
26
threw for 4,268 yards and 30 touchdowns with Kueck guiding the offense. The following year, junior Stan Hill set a school record by completing 69.6 percent of his pass attempts. Prior to returning.
The Kueck File Personal
Birthdate ....................................June 1, 1951 Hometown.................................Freer, Texas Wife ....................................................Rhonda Children .................................Megan & Cara
Recruiting Area East Texas
Education
1975..........................B.S., Stephen F. Austin 1976 .....................M.Ed., Stephen F. Austin
Playing Career
1969-73.............................Stephen F. Austin
Coaching Career
1980 ..................Southwest Oklahoma State ..............................................Assistant Coach 1981 .......................................Rice University ..............................................Assistant Coach 1982-85 ..........................Sam Houston State ..............................................Assistant Coach 1986-89..............................Lamar University ..................................Offensive Coordinator 1990.........................................................SMU ..................................Offensive Coordinator 1991 ..............................................Texas Tech ..............................................Assistant Coach 1992-93 .................University of the Pacific ..............................................Assistant Coach 1994...............................................Mississippi ..................................Offensive Coordinator 1995.........................Navarro Junior College ..................................Offensive Coordinator 1996................................Marshall University ..................................Offensive Coordinator 1997-99 .......................Southern Mississippi ..................................Offensive Coordinator 2000-01 ...................................................SMU ..................................Offensive Coordinator 2002-07..........................Marshall University ..................................Offensive Coordinator 2008 .......................South Grand Prairie HS ..................................Offensive Coordinator 2009 ...................................Mineral Wells HS ..................................Offensive Coordinator 2010-11 ......................Woodrow Wilson HS ..................................Offensive Coordinator 2012- ..................................Lamar University ..................................Offensive Coordinator
L a m a r Fo otbal l Coaching Staff
Craig McGallion Assistant Coach - Linebackers Recruiting Coordinator From 1989-93, McGallion spent time in the Cy-Fair Independent School District at both Cy-Fair HS and Cy-Creek HS. He mentored future NFL Pro Bowl selection Sam Adams, who played at Texas A&M, Craig McGallion begins his fourth along with Shane Rink, who starred season as the linebackers coach and at Texas, while at Cy-Creek. recruiting coordinator at Lamar UniMcGallion was a three-year letterversity. man and two-year starter at noseA former University of Houston guard at the University of Houston. standout and long-time defensive co- He received his bachelor's degree in ordinator at Silsbee High School, Mc- Education from UH in 1984. Gallion joined Ray Woodard's initial McGallion graduated from Silsstaff at Lamar on June 16, 2008, as an bee HS in 1979 and was an all-state assistant coach. selection at linebacker who was also Over the past two seasons of a member of the 1977 Tiger team Southland Conference competition, that reached the state semifinals. He McGallion has seen three of his line- also played in the 1979 Texas High backers earn honorable mention all- School All-Star Game. league honors. Asim Hicks and Darby He has been married to his wife Jackson were honored in 2011, while Gayle since 1983 and the couple has Jermaine Longino was recognized last a son, Lance, and a daughter, Lacey. season after tying for the conference Lance is a Lamar University graduate lead with 107 tackles. and Lacey earned a degree from McGallion came to Lamar after Lamar Institute of Technology. serving on the Silsbee staff under his brother Bobby for 10 years, where the Tigers made the playoffs six times. McGallion spent three seasons as the head coach at Barbers Hill from 1995-98 following a two year stint at Woodville from 1993-94. The son of the late Silsbee coaching legend Stud McGallion led Woodville to the playoffs in his first season with a 6-4-1 mark.
The McGallion File Personal Birthdate .....................................July 1, 1960 Hometown ..............................Silsbee, Texas Wife........................................................Gayle Children.................................Lance & Lacey
Recruiting Area Golden Triangle, East Texas, Northwest Houston, Mississippi JUCO’s
Education 1984.................B.S., University of Houston
Playing Career 1979-82....................University of Houston
Coaching Career 1983-84....................University of Houston ................................................Student Coach 1984-85.....................................Clements HS ............................................Freshman Coach 1985-88 .........................................Silsbee HS ...................................Defensive Line Coach 1988-89.......................................Texas A&M ............................Graduate Assistant Coach 1989-92.....................................Cy-Creek HS ...................................Defensive Line Coach 1992-93 ........................................Cy-Fair HS ..................................Defensive Coordinator 1993-94....................................Woodville HS .....................................................Head Coach 1995-98 ................................Barbers Hill HS .....................................................Head Coach 1998-2008 .....................................Silsbee HS ..................................Defensive Coordinator 2010- ..................................Lamar University ..........Linebackers, Recruiting Coordinator
27
La mar Foo tba l l Coaching Staff
James Brown Assistant Coach - Running Backs
Beaumont native and former University of Texas quarterback James Brown is in his fourth season as the running backs coach at Lamar University. Brown spent the majority of the previous six years playing professionally in NFL Europe and the Arena Football League after his standout career at Texas. He played for the Scottish Claymores in 2002 - the same time Lamar head coach Ray Woodard was the defensive coordinator and led the Frankfurt Galaxy to the World Bowl title in 2003. He played four years of arena football with Nashville, leading the Kats to the Arena Bowl in 2000 and 2001, a year with San Jose and a year with Georgia. From 2003-05, Brown was the offen-
28
sive coordinator at Hyde Park Baptist in Austin where the team reached the TAPPS state semifinals all three years. Brown played for the CenTex Barracudas of the Intense Football League as a midseason replacement and led the team to six wins in eight games and a spot in the league semifinals. Brown was a four-year letterwinner at Texas and finished his career with 30 school records, including passing yards (7,638), total offense (8,049) and touchdown passes (53). In 1995,. As a senior in 1996, Brown led the Longhorns to their first Big 12 Conference title with a win over Nebraska in the inaugural Big 12 Championship Game. He became a UT legend in that contest on a play called "Roll Left" with a 61-yard pass to tight end Derek Lewis that led to a Priest Holmes touchdown to clinch the game. He earned his bachelor's degree in management from Texas in 2000 and is also a licensed real estate appraiser who has run an income tax business in the Austin area. Brown graduated from West Brook High School in Beaumont in 1993 and was a two-sport star in football and basketball. The football program went 20-0 during the regular seasons his two years as a starter, while on the basketball court he became just the second sophomore to play on the varsity team in school history.
The Brown File Personal Birthdate ..................................May 17, 1975 Hometown.......................Beaumont, Texas
Recruiting Area Golden Triangle, Houston ISD, Austin
Education 2000 ....................B.A., University of Texas
Playing Career 1993-96 .........................University of Texas 1997...............British Columbia Lions (CFL) 2000-01 ......................Nashville Kats (Arena) 2002-04................San Jose Sabercats (Arena) 2002-03 ........Frankfurt Galaxy (NFL Europe)
Coaching Career 2002-04 ................San Jose Sabercats (Arena) ...................................................Player Coach 2004-06 .....................Hyde Park Baptist HS ..................................Offensive Coordinator 2010- ..................................Lamar University ....................................Running Backs Coach
L a m a r Fo otbal l Coaching Staff
Carey Bailey Assistant Coach - Defensive Line
Former University of Tennessee standout Carey Bailey begins his second season as defensive line coach at Lamar University. The former head coach at Howard University (2007-10) brings nearly two decades of coaching experience on the college level to his new position at Lamar. Bailey has coached 14 players who went on to play professional football, and has coached 19 all-conference players and fouriley’s tenure, the Ragin’.
The Bailey File Personal Birthdate.............................January 16, 1969 Hometown .....Morgantown, West Virginia Wife......................................................Angela Children .........Evann Leigh & Leah Nicole
Recruiting Area West Louisiana, South Mississippi JUCOs
Education 1992 .............B.A., University of Tennessee
Playing Career 1988-91 .................University of Tennessee
Coaching Career 1993-94 .................West Virginia University ............................Graduate Assistant Coach 1995-98 ...............Virginia Military Institute ...................................Defensive Line Coach 1998-02..........................Louisiana-Lafayette ..Defensive Line and Special Teams Coach 2003 ........................Middle Tennessee State ...................................Defensive Line Coach 2004......................................Oklahoma State ...................................Defensive Line Coach 2005-06.................University of Minnesota ...................................Defensive Line Coach 2007-10...........................Howard University .....................................................Head Coach 2012- ..................................Lamar University ...................................Defensive Line Coach
29
La mar Foo tba l l Coaching Staff
Kevin Barbay Assistant Coach - Wide Receivers
Former Nederland High School quarterback Kevin Barbay is in his second season coaching wide receivers at Lamar University. Barbay comes to Lamar after spending the last two years as the athletics director and head coach at Warren (Texas) High School. Following his high school career, Barbay went to Grambling State to play for former Super Bowl MVP Doug Williams. Barbay then returned to Lamar to finish his education and was introduced to coaching early as he was able to serve as wide receivers coach at Monsignor Kelly High School from 2003-05 while still a student at Lamar. After earning his bachelor’s degree in Exercise Science and Fitness Management from Lamar in 2005, Barbay worked as a graduate assistant coach at Baylor University from 200507. Barbay's first full-time coaching job came at Texas A&M-Commerce. After finishing his master’s degree from Baylor in 2007, Barbay spent two seasons as the quarterbacks/wide receivers coach with the Lions before
30
moving on to North Texas as the tight ends coach for a season (2009). Barbay comes from an impressive coaching pedigree. His late uncle Curtis Barbay was a highly successful coach at Newton High School, while his cousin Bryan is the head coach at Coldspring High School and his cousin Darrell is the head coach at Jasper High School. Barbay and his wife Kaci have two children, daughter Kynslie and son Karson.
The Barbay File Personal Birthdate .......................December 28, 1982 Hometown .......................Nederland, Texas Wife..........................................................Kaci Children...............................Kynslie, Karson
Recruiting Area Southeast Texas, East Houston, Dallas Metroplex
Education 2005...........................B.S., Lamar University 2007 .........................M.S., Baylor University
Playing Career 2002..................Grambling State University
Coaching Career 2003-05............................Kelly High School ...................................Wide Receivers Coach 2005-06..............................Baylor University ............................Graduate Assistant Coach 2007-08..................Texas A&M-Commerce .........Quarterbacks/Wide Receivers Coach 2009............................................North Texas ..........................................Tight Ends Coach 2010-12 ........................Warren High School ..................Athletics Director/Head Coach 2012- ..................................Lamar University ...................................Wide Receivers Coach
L a m a r Fo otbal l Coaching Staff
Chuck Langston Assistant Coach - Offensive Line 22 win over Jones County Junior College in the Heart of Texas Bowl. Prior to being named head coach at Trinity Valley, Langston spent one season coaching the defensive line and special teams. After spending the 2012 season as Langston’s first collegiate coachdirector of football openerations, for- ing position came at his alma mater mer Central Oklahoma head coach where he served for three seasons Chuck Langston begins his first year (1997-99) as tight ends and defensive as an assistant coach. Langston will line coach after one year as a graduate coach the Cardinals’ offensive line. assistant coach. Langston brings more than a Following a standout prep career decade of college coaching experience at West Brook, Langston earned four to Lamar. Additionally, he knows letters at center for the Sooners. He Southeast Texas after starring at West served as a team captain during his Brook High School, and he played senior campaign and helped OU to collegiately at the highest level as a three bowl appearances during his three-year starter for the University of playing days. Oklahoma. Langston earned a bachelor’s deBefore joining Lamar, Langston gree in sociology from Oklahoma in spent three years as the head coach 1995 before getting his master’s deand Athletics Director at Trinity gree in human relations from OU in (Texas) High School after one season 1999. at Groveton (Texas) High School as Langston and his wife Amy have the special teams coordinator. three sons, Christian, Justice and ReaLangston spent five seasons as the gan Luke. head coach at NCAA Division II Central Oklahoma. Langston guided the Bronchos to a 29-24 record during his five seasons as head coach, including a 9-3 record in 2003 and a spot in the second round of the NCAA Division II Playoffs. Langston’s first head coaching job came at Trinity Valley Community College from 2000-02. During his last season with the Cardinals, Langston led the team to a 10-2 record and a 33-
The Langston File Personal Birthdate.............................January 30, 1973 Hometown........................Beaumont, Texas Wife..........................................................Amy Children.....Christian, Justice, Reagan Luke
Education 1995 .....................................B.A., Oklahoma 1999.................................M. Ed., Oklahoma
Playing Career 1991-95..........................................Oklahoma
Coaching Career 1996-97..........................................Oklahoma .........................................Graduate Assistant 1997-99..........................................Oklahoma ..............................................Assistant Coach 1999-00..............................Trinity Valley CC ..............................................Assistant Coach 2000-02..............................Trinity Valley CC .....................................................Head Coach 2002-07............................Central Oklahoma .....................................................Head Coach 2008-09 ......................Groveton (Texas) HS ..............................................Assistant Coach 2009-11............................Trinity (Texas) HS ..................Head Coach/Athletics Director 2012 ...................................Lamar University .................Director of Football Operations 2013- ..................................Lamar University ....................................Offensive Line Coach
31
La mar Foo tba l l Coaching Staff
Brett Ramsey Director of Football Operations led Slocum High School to the 2009 Texas Class A state title in basketball. A 2011 Lamar University graduate with a Bachelor of Science degree in kinesiology, Ramsey is currently working on his master’s degree in health promotions. A member of the Lamar football program since its rebirth in 2008, Brett Ramsey begins his first season as director of football operations. After spending three seasons as a sudent assistant while completing his bachelor’s degree from Lamar, Ramsey worked with the Cardinal tight ends as a graduate assistant over the last two years.
32
The Ramsey File Personal Birthdate.................................April 18, 1988 Hometown .....................Orangefield, Texas
Education 2011..............................................B.S., Lamar Coaching Career 2009-10...........................Warren (Texas) HS ..............................................Assistant Coach 2010-12..............................Lamar University .........................................Graduate Assistant 2013- ..................................Lamar University .................Director of Football Operations
L a m a r Fo otbal l Coaching Staff
Eric Hicks Graduate Assistant - Linebackers Erik Hicks, a 10year NFL veteran, begins his second season as a graduate assistant coach with the Cardinals. Hicks, who played most of his NFL career with the Kansas City Chiefs, works primarily with the Lamar linebackers. Hicks joined the Chiefs as an undrafted free agent in 1998 and started 104 of the 128 games he played. He still ranks sixth in team history with 44.5 career sacks. Hicks’ best season came in 2000 when he registered a career-high 14 sacks in just 13 games played. He would
also spend a season with the New York Jets and was signed by the Detroit Lions without ever appearing in a game for them. A native of Pennsylvania, Hicks played collegiately at Maryland from 1994-97. Hicks earned his bachelor’s degree from Maryland in 2012.
Jason Smith Graduate Assistant - Offense After spending the 2012 season as video coordinator for football, Jason Smith will begin his first year as a graduate assistant coach working with the offense. Prior to coming to Lamar, Smith coached at Monsignor Kelly High School in Beaumont. Smith served as offensive coordinator in his final year, helping the Bulldogs average 35 points per game on their way to an 11-4 record
and a spot in the state championship game. Following a standout playing career at Kelly which included being named the offensive MVP of the GHPSCA All-Star Game, Smith played collegiately at Wesleyan University in Middletown, Conn. Smith, who is currently pursuing a master’s degree in education from Lamar, earned his bachelor’s degree in education from Liberty University in 2011.
33
La mar Foo tba l l Support Staff
Parker James Student Assistant Coach
Johnathan Johnson Student Assistant Coach
April Coon
Andrew Caudill
Administrative Associate
Academic Specialist
Endzone Angels
34
L a m a r Fo otbal l Support Staff
Joshua Miller
(SCCC, USAW)
Strength & Conditioning Coach After.
Dave Overman Assistant Strength & Conditioning Coach
35
La mar Foo tba l l Support Staff
Josh Yonker Head Athletic Trainer Joshua Yonker is entering his ninth year as the head athletic trainer for the Lamar athletics department since joining the staff in August 2005. As the head athletic trainer, Yonker directs and supervises the athletic training staff, graduate assistant athletic trainers, and undergraduate internship students in providing athletic training services to the department's 17 intercollegiate sports. Yonker also directs the undergraduate internship program which prepares students to become Licensed Athletic Trainers in the State of Texas. The program has sent numerous athletic trainers into the high school, clinic, collegiate, and professional ranks. Beginning in August 2009, Yonker has been primarily re-
36
sponsible for the daily medical care of the football and men's & women's golf teams. A native of Denver, Yonker came to Lamar after receiving a Master of Science degree in exercise science from Utah State University in Logan, Utah. While at Utah State, he worked with the football, women's basketball, and women's soccer programs. He was also a lab instructor for the athletic injuries class. Prior to his tenure at Utah State, Yonker was an athletic training student at the University of Northern Colorado in Greeley, Colo. He received a bachelor of science degree in sport and exercise science with an emphasis in athletic training. Yonker is a Certified Athletic Trainer and is a State of Texas Licensed Athletic Trainer. Yonker married the former Kristina Maurich in June of 2011.
Ashley Cody
Ashley Doozan
Graduate Assistant Athletic Trainer
Graduate Assistant Athletic Trainer
L a m a r Fo otbal l Support Staff Dr. Curtis Thorpe
Dr. Shawn Figari
Dr. Joel Smith
Head Team Physician
Team Physician
Team Dentist
Dr. Curtis Thorpe is the team physician for the Lamar University Sports Medicine Team. He is an orthopedic surgeon in sports medicine practice at Beaumont Bone and Joint Institute. He attended medical school and completed his orthopedic residency training program at Baylor College of Medicine. Dr. Thorpe has practiced orthopedic surgery and sports medicine in Beaumont for 16 years. He is board certified in orthopedic surgery and a Fellow of the American Academy of Orthopedic Surgeons, member of the American Orthopedic Society for Sports Medicine, and the Texas Society for Sports Medicine.
Dr. Shawn Figari attended Stephen F. Austin and graduated with a bachelor of science degree with a minor in chemistry. He then went to the University of Texas Health Science Center in Houston where he earned a Doctor of Medicine. While in Houston, he did an internship and a residency in orthopedics. He became a Board Certified Orthopedic Surgeon in 1998. Dr. Figari is a member of the Texas Medical Association, American Academy of Orthopedic Surgeons, Texas Orthopedic Association and the American Medical Association. He has been at Beaumont Bone and Joint Institute since 1998 and a Lamar team physician since 1999.
Dr. Joel Smith, an avid Lamar University supporter and member of the Cardinal Club Board of Directors, also serves the university as the team dentist. Dr. Smith graduated from Lamar University in 1980 where he walked onto the football team after attending Forest Park HS. Currently on staff at Christus St. Elizabeth Hospital, Dr. Smith graduated from the UTHSC Dental School in San Antonio and opened his own practice in Beaumont in 1984. He currently serves as an associate professor at UTHSC Dental School and is part of the school’s mentor program. Dr. Smith is a member of the Sabine District Dental Society and the Texas Dental Society.
Dr. Gene Isabell, Jr.
Dr. Doug Wilcox
Matt Lewis
Team Physician
General Team Physician
Certified Athletic Trainer
Dr. Gene Isabell received his bachelor of science degree in biology (Summa Cum Laude) from Sam Houston State University in 1995. He attended medical school at the University of Texas Medical School at Houston. From there, he completed an Orthopedic Surgical Residency in 2006 from John Peter Smith and Fort Worth Affiliated Hospitals. From 2006-07, Dr. Isabell completed an orthopedic sports medicine fellowship from Baylor College of Medicine. During his time in Houston, Dr. Isabell volunteered with the University of Houston sports teams. He has been at Beaumont Bone and Joint since August of 2007 and is currently working with the Lamar University Sports Medicine Team.
Dr. Doug Wilcox serves as a general team physician for the Lamar Athletics Department. Dr. Wilcox has been a family practice physician at Preventative Medicine of Southeast Texas since 1999. Prior to that, Dr. Wilcox was a Lt. Colonel in the U.S. Air Force as a senior flight surgeon from 1986-97. He operated a family practice in Beaumont from 1997-99. A native of Beaumont and a 1973 graduate of Forest Park HS, Dr. Wilcox received an undergraduate degree from Hastings College (Neb.) in 1977 and his medical degree from Texas Medical School in Houston in 1982. He earned a masters in public health from UTSA in 1990.
Matt Lewis graduated from Texas State in 1992 with a bachelor’s degree in exercise and sports science with a concentration in Sports Medicine. He received his Texas state license in 1991 and his national license in 1993. From 1992 to 2000, Lewis worked as an athletic trainer for the Detroit Tigers. Following that, he worked as the head athletic trainer for Beaumont Central HS. In 2003, Lewis began working for Beaumont Bone and Joint Institute as the Director of Outreach for Sports Medicine. He has served on the executive board of the Athletic Trainers of the Golden Triangle and currently provides physician coordination services for Lamar University and local high schools.
37
La mar Foo tba l l President Kenneth Evans.
38 Senior Associate Provost and Interim Vice President for Student Engagement Dr. Cruse Melvin Interim Vice President for Finance and Operations Ms. Camille Mouton Vice President for University Advancement Ms. Priscilla Parsons Vice President for Information Technology Mr. Jason Henderson Director of Athletics Dr. Peter Kelleher Associate Provost for Research Dr. Oney Fitzpatrick Associate Provost for Student Retention Dr. Jack Hopper Assistant to the President for Economic Development and Industrial Relations Dr. James Simmons President Emeritus and Professor of Music
L a m a r Fo otbal l Athletics Director Jason Henderson J a s o n&MKings man-
Athletic Administration Jason Henderson Athletics Director Helene Thill Assistant AD - Academics Senior Woman Administrator Daucy Crizer Assistant AD - Business Erik J. Cox Assistant AD - Media Relations
agement from Texas A&M in May of 2003 and a Master of Business Administration from Texas A&MKings receives the 2012 Southland Conference Commissioner’s Cup Men’s All-Sport trophy from SLC commissioner Tom Burnett.
39
La mar Foo tba l l Numerical Roster No. 1 2 3 4 5 5 6 7 8 9 10 11 12 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 32 33 34 35 36 38 39 41 42 43 44 46 47 48 49 50 51 52 53 54 56 57 58 59 60
40
Name Nashon Davis Mike Hargis Barry Ford Tyrus McGlothen Montez Hunter Mark Roberts Gratian Gladney Courtlin Thompson Kade Harrington Reggie Begelton Jermaine Longino Kevin Johnson Caleb Berry Colby Campbell Robert Mitchell Rex Dausin Desmond Richards Judge Wolfe Dillon Barrett Ryan Mossakowski Keinon Peterson Michael Handy Branden Thomas Emmitt Raleigh Payton Ploch Richard Gipson Kollin Kahler Chad Allen Caleb Harmon Zach Johnson Xavier Bethany George Orebe Anthony Beard Romando Stewart Josh Wilson Joe Okafor Lloyd Julian Eddie McGill Justin Stout Jestin White Keith Curran Chris Maikranz Ronnie Jones Jr. Alex Ball P.J. Henderson Lawson Hartwick William Jones Cole Carleton James Bellard Tony Qualls David Hollyfield James Washington Chance McCormack Kevin Gunnells Bret Treadway Johnny Morris Richard Alfonso
Pos. DB LB WR DB DB WR WR DB RB WR LB WR QB DB QB QB RB QB QB QB DB WR DB RB RB LB P/K DB RB DB DB DB LB LB DB DL DB LB K LB LB DS LB K TE DS LB LB LB LB DL LB OL LB OL LB OL
Ht. 6-3 6-3 6-1 5-8 5-11 6-3 5-9 6-1 5-9 6-0 5-10 6-0 6-2 6-0 6-1 6-2 5-9 5-10 6-3 6-4 5-8 5-11 5-9 6-0 6-2 6-2 6-2 5-11 5-9 5-11 6-1 5-9 6-1 6-2 5-7 6-6 5-10 6-0 6-1 6-4 6-4 6-6 5-10 6-3 6-3 5-11 5-10 6-0 6-2 6-0 6-3 5-11 6-3 5-11 6-3 6-0 6-0
Wt. 205 225 175 175 180 190 165 210 185 190 220 210 195 185 200 203 170 170 220 215 190 185 170 210 215 215 200 190 200 180 180 165 225 210 185 295 165 225 170 190 240 255 240 240 220 255 225 215 225 215 225 225 295 210 250 185 260
Yr.-Exp. Hometown (High School/Last School) Sr.-1L Katy, Texas (Morton Ranch HS/Blinn JC) So.-1L Austin, Texas (Manor HS) RS Sr.-3L Houston, Texas (Spring Westfield HS) Sr.-1L Grand Prairie, Texas (South Grand Prairie HS/Cisco CC) Jr.-TR Lakewood, Calif. (Artesia HS/Long Beach CC) Jr.-TR Orange, Texas (West Orange-Stark HS/Houston) So.-1L Houston, Texas (Cypress Falls HS) Sr.-1L Lancaster, Calif. (Antelope Valley Christian HS/Saddleback CC) Fr.-HS Kingwood, Texas (Kingwood HS) RS So.-1L Beaumont, Texas (West Brook HS) Sr.-1L Houston, Texas (Hightower HS/Trinity Valley CC) RS Jr.-1L Houston, Texas (Cypress Ridge HS/Oklahoma State) RS Jr.-2L Needville, Texas (Needville HS) Fr.-HS Whitehouse, Texas (Whitehouse HS) Fr.-HS Beaumont, Texas (Central HS) RS Fr.-TR San Antonio, Texas (Warren HS/Houston) So.-1L Montgomery, Texas (Magnolia West HS) Fr.-HS Palmer, Texas (Palmer HS) RS So.-1L Dry Prong, La. (Grant HS/Fort Scott CC) Sr.-1L Frisco, Texas (Centennial HS/Northwest Mississippi CC) Sr.-3L Dickinson, Texas (Dickinson HS) Fr.-RS Conroe, Texas (Oak Ridge HS) Sr.-3L Beaumont, Texas (Central HS) Fr.-HS Houston, Texas (Spring Westfield HS) Sr.-3L Dayton, Texas (Dayton HS) Fr.-HS Tyler, Texas (John Tyler HS) Sr.-3L Waco, Texas (Waco HS) Sr.-3L Coldspring, Texas (Coldspring HS) Sr.-3L Port Neches, Texas (Port Neches-Groves HS) Fr.-RS Littlefield, Texas (Littlefield HS) Fr.-RS Burton, Texas (Burton HS) Jr.-1L Houston, Texas (Westside HS) Sr.-2L Lumberton, Texas (Lumberton HS/SMU) Fr.-HS Newton, Texas (Newton HS) Jr.-2L Beaumont, Texas (West Brook HS) RS Jr.-1L Bellaire, Texas (Bellaire HS/Oklahoma State) Fr.-HS Bellaire, Texas (Episcopal HS) Fr.-HS Stockbridge, Ga. (Woodland HS) Sr.-3L Mesquite, Texas (West Mesquite HS) RS Jr.-2L Houston, Texas (North Shore HS) Jr.-TR Garden City, Kan. (Garden City HS/Garden City CC) Sr.-3L Sugar Land, Texas (Lamar Consolidated HS) So.-1L Hempstead, Texas (Hempstead HS) Fr.-RS Westlake, Calif. (Westlake Village HS) Sr.-2L Austin, Texas (Anderson HS/Jackson State) RS Jr.-2L Forney, Texas (Forney HS) Sr.-3L Beaumont, Texas (Central HS) Fr.-HS Omaha, Neb. (Elkhorn South HS) So.-HS Baytown, Texas (Barbers Hill HS) Fr.-HS Houston, Texas (Spring Westfield HS) So.-1L Silsbee, Texas (Silsbee HS) Sr.-3L Houston, Texas (Madison HS) Jr.-TR Dayton, Texas (Dayton HS/Blinn JC) So.-RS Houston, Texas (George Bush HS) Fr.-RS Silsbee, Texas (Silsbee HS) So.-RS Humble, Texas (Atascocita HS) Fr.-RS Katy, Texas (Pope John XXIII HS)
Alphabetical Roster No. 60 26 70 46 17 32 85 9 51 12 29 76 97 12 50 99 95 75 92 78 42 14 96 1 93 89 86 66 3 64 24 6 63 74 57 20 2 27 8 48 82 47 53 5 11 28 44 49
Name Richard Alfonso Chad Allen Stephen Babin Alex Ball Dillon Barrett Anthony Beard Brannon Beaton Reggie Begelton James Bellard Caleb Berry Xavier Bethany Justin Brock Kade Burman Colby Campbell Cole Carleton Corbin Carr Juan Carranco Hunter Conn Koby Couron John Craven Keith Curran Rex Dausin Joshua Davis Nashon Davis Jesse Dickson Garrett Drake Jordan Edwards Marshall Fairchild Barry Ford Kyle Gillam Richard Gipson Gratian Gladney Jonathon Green Kevin Greif Kevin Gunnells Michael Handy Mike Hargis Caleb Harmon Kade Harrington Lawson Hartwick Victor Hawkins P.J. Henderson David Hollyfield Montez Hunter Kevin Johnson Zach Johnson Ronnie Jones Jr. William Jones
Pos. OL DB OL K QB LB TE WR LB QB DB OL LB DB LB DL K OL DL OL LB QB K DB DL WR WR OL WR OL LB WR DL OL LB WR LB RB RB DS WR TE DL DB WR DB LB LB
L a m a r Fo otbal l Alphabetical Roster No. 36 25 80 62 10 43 68 56 38 4 88 13 59 91 18 90 84 35 30 19 23 52 22 15 67 5 71 81 33 39 65 21 7 58 54 98 72 41 69 34 16
Name Lloyd Julian Kollin Kahler Sam Keeter Ian Kelso Jermaine Longino Chris Maikranz Chris Mayer Chance McCormack Eddie McGill Tyrus McGlothen Payden McVey Robert Mitchell Johnny Morris Logan Moss Ryan Mossakowski Mark Murrill Jayce Nelson Joe Okafor George Orebe Keinon Peterson Payton Ploch Tony Qualls Emmitt Raleigh Desmond Richards Blake Rising Mark Roberts Tramon Shead Jesse Sparks Romando Stewart Justin Stout Omar Tebo Branden Thomas Courtlin Thompson Bret Treadway James Washington Marcus Washington Brock Wempa Jestin White Jeff Whittaker Josh Wilson Judge Wolfe Ronald Barrett Tommie Barrett Brent Salenga Deven Scoby
Pos. DB P/K TE OL LB DS OL OL LB DB TE QB LB LB QB DL WR DL DB DB RB LB RB RB OL WR OL WR LB K DL DB DB OL LB DL OL LB OL DB QB DB DB WR DB
Numerical Roster No. 60 62 63 64 65 66 67 68 69 70 71 72 74 75 76 78 80 81 82 84 85 86 88 89 90 91 92 93 95 96 97 98 99
Name Richard Alfonso Ian Kelso Jonathon Green Kyle Gillam Omar Tebo Marshall Fairchild Blake Rising Chris Mayer Jeff Whittaker Stephen Babin Tramon Shead Brock Wempa Kevin Greif Hunter Conn Justin Brock John Craven Sam Keeter Jesse Sparks Victor Hawkins Jayce Nelson Brannon Beaton Jordan Edwards Payden McVey Garrett Drake Mark Murrill Logan Moss Koby Couron Jesse Dickson Juan Carranco Joshua Davis Kade Burman Marcus Washington Corbin Carr Ronald Barrett Tommie Barrett Brent Salenga Deven Scoby
Pos. OL OL DL OL DL OL OL OL OL OL OL OL OL OL OL OL TE WR WR WR TE WR TE WR DL LB DL DL K K LB DL DL DB DB WR DB
Ht. 6-0 6-0 6-0 6-1 6-0 6-4 6-1 6-7 6-1 6-4 6-6 6-2 6-3 6-5 6-5 6-3 6-4 5-10 6-2 6-2 6-3 5-11 6-1 6-2 6-2 6-4 6-3 6-3 6-0 6-1 6-3 6-3 6-3 5-11 5-10 5-8 5-11
Wt. 260 280 265 270 295 290 255 345 220 315 305 345 260 285 280 285 225 170 205 170 245 180 225 185 255 210 240 265 170 200 200 295 245 180 170 170 195
Yr.-Exp. Fr.-RS RS Jr.-2L Fr.-HS Sr.-3L Fr.-HS Sr.-3L Fr.-HS Jr.-TR So.-RS RS Sr.-3L Jr.-TR Sr.-1L Fr.-HS Fr.-HS RS So.-1L Fr.-HS Fr.-HS Jr.-2L Fr.-HS So.-1L Fr.-HS Sr.-3L Jr.-2L Fr.-RS Sr.-3L RS So.-1L Fr.-HS Sr.-3L Fr.-HS Fr.-HS Fr.-HS Jr.-1L Fr.-RS So.-HS So.-HS So.-HS Fr.-HS
Hometown (High School/Last School) Katy, Texas (Pope John XXIII HS) Austin, Texas (Lake Travis HS) Houston, Texas (North Shore HS) Lumberton, Texas (Lumberton HS) Liberty, Texas (Liberty HS) Gonzales, Texas (Gonzales HS) Winnie, Texas (East Chambers HS) Shawnee, Kan. (Mill Valley HS/Fort Scott CC) Humble, Texas (Humble HS) Bellville, Texas (Bellville HS) Cayuga, Texas (Cayuga HS/Kilgore JC) Royse City, Texas (Royse City HS/Tyler JC) Spring, Texas (Klein Oak HS) Whitehouse, Texas (Whitehouse HS) Beaumont, Texas (West Brook HS) Spring, Texas (Klein Collins HS) Dallas, Texas (Woodrow Wilson HS) Lumberton, Texas (Lumberton HS) Longview, Texas (Pine Tree HS) Port Neches, Texas (Port Neches-Groves HS) Whitehouse, Texas (Whitehouse HS) Houston, Texas (Madison HS) Deer Park, Texas (Deer Park HS) Silsbee, Texas (Silsbee HS) Lumberton, Texas (Lumberton HS) Orange, Texas (Orangefield HS) Nederland, Texas (Nederland HS) Houston, Texas (Alief Taylor HS) Dayton, Texas (Dayton HS) Marshall, Texas (Evangel (La.) HS) Livingston, Texas (Livingston HS) Houston, Texas (Stephen F. Austin HS/Ft. Scott CC) Nederland, Texas (Nederland HS) Silsbee, Texas (Silsbee HS) Silsbee, Texas (Silsbee HS) Nederland, Texas (Nederland HS) Houston, Texas (Travis HS)
Pronunciation Guide Stephen Babin (BAB-in) Reggie Begelton (Bagel-ton) Nashon Davis (NAY-shawn) Res Dausin (DOW-son) Gratian Gladney (GRAY-shun) Kevin Greif (Grife) Kollin Kahler (CAY-ler) Jermaine Longino (lawn-GEE-no) Chris Maikranz (MY-kranz) Ryan Mossakowski (moss-ah-COW-ski) George Orebe (Or-A-bay) Payton Ploch (rhymes with slow) Romando Stewart (row-MAN-dough) Larry Kueck (KECK)
41
La mar Foo tba l l Offense
Defense
Quarterback
Special Teams
Defensive End
Kicker
12
Caleb Berry
6-2
195
Jr.-2L
93
Jesse Dickson
6-2
245
Sr.-3L
39
Justin Stout
6-1
160
Sr.-3L
18
Ryan Mossakowski 6-4
225
Sr.-1L
92
Koby Couron
6-3
240
Fr.-HS
95
Juan Carranco
6-0
170
Fr.-HS
Running Back
Nose Guard
Kickoffs
23
Payton Ploch
6-2
215
Sr.-3L
35
Joe Okafor
6-6
295
Jr.-1L
95
Juan Carranco
6-0
170
Fr.-HS
15
Desmond Richards 5-9
170
So.-1L
65
Omar Tebo
6-0
295
Fr.-HS
46
Alex Ball
6-3
240
Fr.-RS
X
Defensive End
Holder
86
Jordan Edwards
5-11
175
Sr.-3L
90
Mark Murrill
6-2
250
Sr.-3L
25
Kollin Kahler
6-2
200
Sr.-3L
7
Mark Roberts
6-3
190
Jr.-TR
42
Keith Curran
6-4
240
Jr.-TR
12
Caleb Berry
6-1
190
Jr.-2L
A
Will
Deep Snapper
9
Reggie Begelton
6-0
190
So.-1L
10
Jermaine Longino
5-10 220
Sr.-1L
43
Chris Maikranz
6-6
255
Sr.-3L
6
Gratian Gladney
5-9
165
So.-1L
91
Logan Moss
6-4
So.-1L
48
Lawson Hartwick
5-11
240
Jr.-2L
Tight End
210
Mo
Punter
88
Payden McVey
6-1
220
Jr.-2L
49
Will Jones
5-10 225
Sr.-3L
25
Kollin Kahler
6-2
200
Sr.-3L
17
Dillon Barrett
6-3
220
So.-1L
32
Anthony Beard
6-1
Sr.-2L
95
Juan Carranco
6-0
170
Fr.-HS
Left Tackle
235
Mike
Kick Returner
76
Justin Brock
6-5
280
So.-1L
54
James Washington 5-11
71
Tramon Shead
6-6
305
Jr.-TR
44
Ronnie Jones Jr.
Left Guard
225
Sr.-3L
20
Michael Handy
5-11
185
Fr.-RS
5-10 240
So.-1L
11
Kevin Johnson
6-0
210
Jr.-1L
Sam
Punt Returner
62
Ian Kelso
6-0
280
Jr.-2L
41
Jestin White
6-4
190
Jr.-2L
20
Michael Handy
5-11
185
Fr.-RS
74
Kevin Greif
6-3
260
Fr.-HS
2
Mike Hargis
6-3
225
So.-1L
6
Gratian Gladney
5-9
165
So.-1L
Center
Left Cornerback
64
Kyle Gillam
6-1
270
Sr.-3L
21
Branden Thomas
5-9
165
Sr.-3L
78
John Craven
6-3
285
Fr.-HS
36
Lloyd Julian
5-10 165
Fr.-HS
Right Guard
Free Safety
58
Bret Treadway
6-3
250
Fr.-HS
26
Chad Allen
5-11
190
Sr.-3L
56
Chance McCormack 6-3
295
Jr.-TR
37
Courtlin Thompson 6-1
210
Sr.-1L
Right Tackle
Strong Safety
70
Stephen Babin
6-4
280
Sr.-3L
1
Nashon Davis
6-3
205
Sr.-1L
68
Chris Mayer
6-7
345
Jr.-TR
12
Colby Campbell
6-0
185
Fr.-HS
Z
Right Cornerback
20
Mike Handy
5-11
185
Fr.-RS
4
Tyrus McGlothen
5-8
175
Sr.-1L
11
Kevin Johnson
6-0
210
Jr.-1L
5
Montez Hunter
5-11
180
Jr.-TR
42
L a m a r Fo otbal l Richard Alfonso OL l 6-0, 260 l Fr.-RS Katy, Texas Pope John XXIII HS
#60
2012:.
Chad Allen DB l 5-11, 190 l Sr.-3L Coldspring, Texas Coldspring HS
#26
2010: Played in all 11 games as a true freshman, finishing 10th on the team with 30 total tackles ... Had a seasonhigh 10 tackles, including six solos, in LU’s 24-20 win over South Dakota (11/13) ... Finished the year with five tackles in 44-6 win over Oklahoma Panhandle State ... Forced and recovered a fumble at North Dakota (10/30). High School: Set Coldspring High School record for career passing yards with 2,495 while throwing 30 touchdown passes for coach Bryan Barbay ... As a senior, passed for 1,336 yards and 16 TDs, and rushed for 850 yards and 13 TDs ... Voted Offensive MVP in District 22-3A and was first-team all-district at quarterback in 2008 ... Honored as Coldspring’s Most Valuable Athlete for the 2008-09 school year ... Earned MVP honors on the Trojans’ basketball team ... Was a two-year regional qualifier in track and field in the long jump and the 400-meter and 800-meter relays. Personal: Chad Allen was born on July 20, 1991 ... Parents are Mervin Allen and Pamela Harrison ... Major is general studies.
Named Preseason Second-Team All Southland Conference 2012: Named honorable mention AllSouthland Conference … Played in all 12 games with 10 starts … Was second on the team with 79 total tackles and his 6.6 tackles per game ranked 18th among all defensive players in the Southland Conference … Registered 55 solo tackles and had 3.5 tackles for loss … Posted a career-high 17 tackles at Stephen F. Austin (11/3) for the second-best Tackles Sacks Pass Def. Fumb. Blkd single-game total by any Southland player in 2012 … Fin- Yr. GP UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH Rcv FF Kick 0-0 0 0 1 1 0 ished with 11 tackles, including two for loss, in 31-0 win 2010 11 18 12 30 2.0-14 0-0 2011 10 24 17 41 2.0-4 0-0 2-24 1 1 0 0 0 over Prairie View A&M (9/8) … Had nine tackles and a 2012 12 55 24 79 3.5-8 0-0 0-0 3 0 2 1 0 fumble recovery at Louisiana-Lafayette (9/1) and had nine Totals 33 97 53 150 7.5-26 0-0 2-24 4 1 3 2 0 tackles and a forced fumble at Northwestern State (10/6) … Was team’s leading tackler four times … Broke up three Stephen Babin passes on the year. OL l 6-4, 280 l Sr.-3L 2011: Started in seven of the 10 games he played in ... Was Bellville, Texas Bellville HS #70 fifth on the team with 41 total tackles, including 24 solo tackles ... Tied for second on the team with a pair of interceptions ... Recorded a season-high nine tackles at Texas State (10/15), including seven solos ... Finished with eight 2012: Started and played in all 12 tackles at South Alabama (9/10), adding a pass breakup ... games for the Cardinals, mostly at Returned an interception 20 yards against Stephen F. right tackle … Extra work in the Austin (11/5) ... Recorded his other pick against McNeese weight room paid off with a strong season … Graded out State (11/19) in the season finale ... Had six tackles in at over 80 percent on the season for the second time in Lamar’s 48-38 win at Southeastern Louisiana (10/1) and his career. at Sam Houston State (10/29).
43
La mar Foo tba l l 2011: Appeared in five games as a backup lineman ... Provided depth all the way across the offensive line other than center. 2010: Played in 10 games as a redshirt freshman, garnering eight starts ... Was the starting left tackle in 2010, but can play either tackle position ... Graded out at 80 percent or better in eight starts. High School: Three-year letterwinner for coach Huey Chancellor at Bellville High School … Was second-team all-state, first-team all-district and first-team all-state academic in 2008 … Did not allow a sack and recorded 142 pancake blocks while grading out at 98 percent during his senior season … Voted captain and Most Valuable Offensive Lineman by his teammates … Invited to play in Houston’s Lone Star Bowl … Helped lead Brahmas to 12-2 record, the District 25-3A championship and a state quarterfinals berth in 2008 … Posted a 4.159 grade point average and was an Academic Excellence Award winner and member of the National Honor Society for four-straight years … Played the trombone in his high school band. Personal: Stephen Dwayne Babin was born on Aug. 8, 1991 … Son of Valerie and David Babin.
Alex Ball K l 6-3, 240 l Fr.-RS Westlake, Calif. Westlake Village HS
#46
2012: Redshirted High School: Named the top high school kicker in the nation as the recipient of the Herbalife 24 Chris Sailer Award ... Was named to the ESPN High School All-America team and to the Maxpreps Division I All-State squad ... Was 19-of24 on field goal-attempts as a senior with three makes from 50 yards or more ... Was a perfect 73-of-73 on extrapoint attempts as a senior ... Helped Westlake to a 14-1 record as a senior and a 12-2 record as a junior ... The Warriors were ranked fourth in the state of California in 2011 and went a perfect 9-0 in league games ... Also named AllVentura County and All-Los Angeles Daily News ... Set California state records for most career kicking points with 329 and most career made PATs with 224. Personal: Alex Ball was born on Feb. 3, 1994 … Son of Anthony and Sally Ball … Majoring in general business.
44
Dillon Barrett QB l 6-3, 222 l RS So.-1L Dry Prong, La. Grant HS Fort Scott CC
#17
2012: Appeared in two games without attempting as a pass as a backup quarterback … Ran twice for four yards in 52-21 win over McMurry (10/13) and finished with one carry for three yards at Stephen F. Austin (11/3). Junior College: Redshirted one year at Fort Scott Community College. High School: Starting quarterback in the Louisiana-Mississippi High School All Star game following his prep career at Grant High school ... Registered more than 2,000 all-purpose yards as a senior. Personal: Dillon Barrett was born on Nov. 22, 1992 … Son of Byron Barrett and Brenda and John Dean … Exercise science major.
Anthony Beard LB l 6-1, 235 l RS Jr.-1L Lumberton, Texas Lumberton HS SMU
#3226
L a m a r Fo otbal l ... General studies major. Yr. 2011
Tackles Sacks Pass Def. Fumb. Blkd GP UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH Rcv FF Kick 11 32 26 58 7.5-48 0.5-4 0-0 0 3 0 0 0
Reggie Begelton WR l 6-0, 190 l RS So.-1L Beaumont, Texas West Brook HS
#82
2012: Appeared in all 12 games and picked up eight starts … Finished third on the team with 21 receptions which totaled 172 yards … Set season-highs with five catches for 50 yards at Central Arkansas (10/20) … Finished with four catches for 33 yards, including an 8-yard touchdown, in 34-24 win over Nicholls (11/10) … First collegiate catch was an 8-yarder at Louisiana-Lafayette (9/1) … Caught at least one pass in nine games. 2011: Redshirted
High School: First-Team All-District 21-5A as a senior after hauling in 52 catches for 866 yards and nine touchdowns ... Helped West Brook HS to an undefeated district title in 2009 and a 2-1 playoff record ... As a senior, Bruins finished with a 7-3 regular season record and advanced to the second round of the playoffs ... Served as team captain as a senior ... Selected to play in the Southeast Texas AllStar Classic. Personal: Reggie Begelton was born on Aug. 31, 1993 ... Son of Reginald and Miranda Begelton ... Majoring in chemical engineering. Yr. 2012
GP Rcpts. Yds Avg 12 21 172 8.2
TD 1
Lg 18
Avg/G 14.3
Caleb Berry QB l 6-2, 195 l RS Jr.-2L Needville, Texas Needville HS
yard
45
La mar Foo tba l lState Team … Was a three-year Academic All-District 263A selection. Personal: Caleb Logan Berry was born on Dec. 24, 1991, in Houston, Texas ... Son of Sterling and JoAnn Berry ... Father Sterling Berry played baseball at Lamar ... Major is kinesiology.
downs marketing.
Justin Brock OL l 6-5, 280 l RS So.-1L Beaumont, Texas West Brook HS
#76
2012: Yr. GP Comp-Att-Int Pct. Yds TD Lg Avg/G Effic Arthur News Super 2011 3 16-23-2 69.6 150 1 36 50.0 121.30 2012 8 76-146-5 52.1 663 5 27 82.9 94.65 Team and was a 2010 Totals 11 92-169-7 54.4 813 6 36 73.9 98.28 second-team selection on the BeauXavier Bethany mont Enterprise DB l 6-1, 180 l Fr.-RS Super Gold Team ... Burton, Texas Burton HS #29 Named to the Dave Campbell Preseason All-State Team prior to senior season ... 2012: Redshirted High School: Played four varsity sea- Blocked for quartersons at Burton High School, including back Bruce Reyes who was named Disthree as a two-way starter ... Named second-team Class A trict 21-5A MVP in all-state at safety and honorable mention at quarterback ... 2010. Played quarterback and defensive back as a senior when Personal: Justin Burton advanced to the Texas Class A state semifinals Brock was born on Jan. 22, 1993 ... Son of Donald Brock with a 12-3 record ... Rushed for 1,324 yards and 20 touchand Shekeitha Taylor ... Major is kinesiology.
46
L a m a r Fo otbal l Corbin Carr DL l 6-3, 245 l Fr.-RS Nederland, Texas Nederland HS
#99
2012: Redshirted High School: Earned AP Class 4A all-state honorable mention honors after helping Nederland High School to a perfect 7-0 District 20-4A finish ... Was also named First-Team All-District 20-4A for the 12-2 Bulldogs at defensive end ... Was a finalist for the Willie Ray Smith Award ... Finished his senior season with 35 solo tackles, 12 sacks and 10 tackles for loss. Personal: Corbin Carr was born on Apr. 10, 1994 … Son of Steven Carr and Tammy Trahan … Majoring in general studies.
Yr. 2012
Tackles Sacks Pass Def. Fumb. Blkd GP UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH Rcv FF Kick 12 20 6 26 0.5-2 0-0 2-21 2 0 0 0 0
Jesse Dickson
Nashon Davis DB l 6-3, 205 l Sr.-1L Katy, Texas Morton Ranch HS Blinn JC. Personal: Nashon Davis was born on Dec. 4, 1989 … Son of Ondorff Davis and Connie Bonney … Majoring in general studies.
#1
2012: Played in all 12 games as a junior transfer with three starts on the year … Registered 26 tackles on the season with 20 solo stops … Tied for second on the team with a pair of interceptions and also had two pass breakups on the year … Picked up his first interception as a Cardinal against Southeastern Louisiana (9/29) and added his other pick at Stephen F. Austin (11/3) … Had a season-high five tackles in 34-24 win over Nicholls (11/10) and matched that total in the season finale at McNeese State (11/17) one game later. Junior College: Helped Blinn College to a 9-2 record as
DE l 6-2, 245 l Sr.-3L Houston, Texas Alief Taylor HS
#93
Named Preseason Second-Team All Southland Conference 2012: Was a second-team All-Southland Conference selection … Played and started 10 games … Finished with 43 total tackles and led the team with nine tackles for loss and 4.0 sacks … Ranked among the top 15 in the Southland Conference in tackles for loss and sacks … Recorded a pair of sacks for 13 lost yards in 310 victory over Langston (9/22) … Also had a sack in 310 win over Prairie View A&M (9/8) and 34-24 win over Nicholls (11/10) … Finished with seven tackles, including two for loss, at Louisiana-Lafayette (9/1) and matched the tackle total with seven against Southeastern Louisiana (9/29) … Added two quarterback hurries and two pass breakups. 2011: Played in all 11 games as a sophomore with seven starts ... Was third on the team with 51 total tackles, including 36 solos ... Led the Cardinal defense with 10.5 tackles for loss for a total of 45 yards ... Had 4.5 sacks on the year to lead the team ... Recorded two of Lamar’s four blocked kicks on the year ... Recorded a season-high eight tackles, including a sack, at South Alabama (9/10) ... Finished with 2.5 tackles for loss in Lamar’s season-opening
47
La mar Foo tba l l 58-0 win over Texas College (9/3) ... Also had 2.5 tackles for loss against McNeese State (11/19) in the season finale ... Finished with a seasonhigh five solo tackles at Texas State (10/15). 2010: Played in eight games as a redshirt freshman ... Finished the season with 28 total tackles, including 21 solos ... Had 5.5 tackles for loss ... Had three solo tackles, including one for loss, in first college game at McNeese State (9/4) ... Finished with five tackles and a forced fumble against South Alabama (10/16) ... Had five tackles, including two tackles for loss, in LU’s 24-20 win over South Dakota (11/13). High School: Three-year letterman for coach Trevor White at Alief Taylor High School … Second team alldistrict selection as senior in 2008 after earning honorable mention recognition on defense in 2007 and on offense in 2006 … Also lettered in soccer, basketball, baseball and track and field … Member of the Taylor African American Student Association and the Peer Assistance Leadership Service … Active with the music group at Cathedral Assemblies of Prayers. Personal: Jesse O. Dickson was born on Jan. 31, 1990 in Kaduna, Nigeria. …Son of John and Esther Dickson. … Majoring in political science. Yr. 2010 2011 2012 Total
48
GP 8 11 10 29
Tackles Sacks Pass Def. UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH 21 7 28 5.5-6 0-0 0-0 0 2 36 15 51 10.5-45 4.5-31 0-0 1 0 30 13 43 9.0-37 4.0-22 0-0 2 2 87 35 122 25-88 8.5-53 0-0 3 4
Fumb. Blkd Rcv FF Kick 0 1 0 0 0 2 0 0 0 0 1 2
Garrett Drake WR l 6-2, 185 l Fr.-RS Silsbee, Texas Silsbee HS
#89
2012:.
Jordan Edwards WR l 5-11, 175 l Sr.-3L Houston, Texas Madison HS
#86
2012: Played in all 12 games with 10 starts … Finished second on the team in receptions (23), receiving yards (349) and touchdown catches (4) … Had one of the best receiving performances in school history with six catches for 208 yards and three touchdowns at Stephen F. Austin (11/3) … The 208 yards receiving are the second most in a single game in school history and the most by any Southland Conference player on the year, while the three receiving touchdowns matches a single-game Lamar record … Snared a 60-yard touchdown pass at SFA for the longest reception by a Cardinal on the year … Finished with three catches for 43 yards and a touchdown at Northwestern State (10/6) … Caught at least one pass in nine of 12 games played. 2011: Appeared in 10 games, mostly on special teams ... Finished the season with two catches for 26 yards as a reserve wide receiver ... First career catch was a 5-yarder at South Alabama (9/10) ... Added a 21-yard grab against Northwestern State (10/8). 2010: Played in two games as a redshirt freshman, includ-
L a m a r Fo otbal l ing the home opener against Webber International (9/11) ... Also played against Oklahoma Panhandle State in the season finale (11/20) ... Did not record a statistic in his two games played. High School: Was three-year varsity letterman for coach Ray Seals at Houston Madison HS … Helped lead Marlins to a 9-3 record and district championship as a senior in 2008 … Team went 8-4 his junior season and 6-4 his sophomore season … Earned second team all-district recognition as a junior and senior … Had 28 receptions for 483 yards as a senior and 12 catches for 106 yards as a junior … Best game was five catches for 84 yards and two touchdowns vs. Bellaire HS his senior season … Also three-year letterman for Marlins’ track team … Won district championship in 300-meter hurdles as senior … Graduated in top 10 percent of his senior class. Personal: Jordan Kristofer Eugene Edwards was born on Nov. 3, 1990 … Son of Clyde and Sheila Edwards … Has two older brothers, Tony Edwards and Clyde Edwards II, who played football at Grambling State University … Majoring in hotel management. Yr. 2011 2012 Total
GP Rcpts. Yds 10 2 26 12 23 349 22 25 375
Avg 13.0 15.2 15.0
TD 0 4 4
Lg 21 60 60
Avg/G 2.6 29.1 17.0
Marshall Fairchild OL l 6-4, 290 l Jr.-3L Gonzales, Texas Gonzales HS
#66
2012: Played in a pair of games as a backup offensive lineman … First action of the year came at Northwestern State (10/6) … Also saw time in 52-21 victory over McMurry (10/13).
2011: Backup offensive lineman appeared in the season opener, a 58-0 win over Texas College (9/3). 2010: Walk-on who played in the season finale against Oklahoma Panhandle State (11/20) ...Opened the season on the scout team, but worked his way onto the travel squad. High School: Four-year letterman for coaches Kris Micheaux, Ricky Lock and Bruce Salmon at Gonzales HS … Starred on the offensive line and also played at end and tackle on defense and served as the Apaches’ deep snapper … Helped lead the team to a 10-3 record and the Class 3A state quarterfinals as a junior in 2007 … Earned honorable mention all-state and Academic All-State recognition … Also three-year letterman in baseball. Personal: Marshall Fairchild was born on Feb. 5, 1991 … Son of Ace and Renee Fairchild … Has two older brothers, Randy and Ryan, who played football at Texas A&M ... Majoring in civil engineering.
Barry Ford WR l 6-0, 175 l Sr.-3L Houston, Texas Westfield HS
#3
Named
49
La mar Foo tba l l . Yr. 2010 2011 2012 Total
50
GP Rcpts. Yds Avg 11 14 148 10.6 9 10 77 7.7 12 49 470 9.6 32 73 695 9.5
TD 1 0 1 2
Lg 33 12 25 33
Avg/G 13.5 8.6 39.2 21.7
Kyle Gillam OL l 6-1, 270 l Sr.-3L Lumberton, Texas Lumberton HS
#64
2012: Continued to be the anchor and leader of the offensive line … Played and started in all 12 games … Started at left guard in the season opener at LouisianaLafayette (9/1) before returning to center for the remainder of the season … Graded out at over 90 percent for the second straight season … Helped the Cardinals rank in the top half of the Southland Conference in rushing offense. 2011: Started all 11 games for the second consecutive season … Graded out at over 90 percent on the year … Blocked for a Lamar offense that ranked among the top half of the Southland Conference in passing. 2010: Mainstay of the offensive line as a redshirt freshman ... Started all 11 games and played all but three plays for the Cardinals ... Graded out at 85 percent or better for the season ... Played primarily at center. High School: Was a Class 4A honorable mention allstate selection as a senior in 2008 ...Was a three-year starter for coach Alvin Credeur, helping the Raiders go a combined 19-4 and win a pair of District 20-4A co-championships ... Earned first-team all-district and all-Southeast Texas honors at center as a junior and senior ... As a junior, was the lead blocker for first-team all-state tailback Cody Hussey ... Two-year regional qualifier in power lifting. Personal: Kyle Gillam was born on Sept. 30, 1990, in Lumberton, Texas ... Son of Kevin Gillam and Nancy Borne ... Majoring in human resources management.
L a m a r Fo otbal l Gratian Gladney WR l 5-9, 165 l So.-1L Houston, Texas Cypress Falls HS
#6
2012: Appeared in eight games as a true freshman, finishing the year with three catches for 37 yards … First career catch was a 6-yard grab in 31-0 win over Prairie View A&M (9/8) … Added a one yard run against the Panthers for his lone carry of the season … Longest reception of the year was a 17-yarder against Sam Houston State (10/27) and also had a 14-yard catch at Central Arkansas (10/20). High School: Helped Cy-Falls to a 10-2 record as a senior, including an 8-1 District 17-5A record and a runner-up finish ... Named First-Team AllDistrict 17-5A as a junior and senior ... Posted 30 catches for 438 yards and eight touchdowns as a senior and 48 catches and 442 yards as a junior. Personal: Gratian Gladney was born on Oct. 21, 1992 … Son of Aretha Gladney … General studies major. Yr. 2012
GP Rcpts. Yds Avg 8 3 37 12.3
TD 0
Lg 17
Avg/G 4.6
Michael Handy WR l 5-11, 185 l Fr.-RS Conroe, Texas Oak Ridge HS
#20 310.
Mike Hargis LB l 6-3, 225 l So.-1L Austin, Texas Manor HS
#2
2012: Appeared in nine games as a true freshman and earned a start against Southeastern Louisiana (9/29) … Registered five tackles on the year, including one for a 4-yard loss … Finished with two tackles against the Lions and matched that total in the final game of the year at McNeese State (11/17) … Added a stop in 31-0 win over Prairie View A&M (9/8). High School: Three year varsity starter at Manor High School ... Named All-District 16-4A as a senior at defensive end ... Finished senior season with 97 tackles ... Earned second-team all-district honors as a junior after registering 132 tackles and two interceptions at safety ... Helped Mustangs to a 4-2 district mark as a senior and a spot in the playoffs ... Ranked among the top 20 linebackers in the state by Dave Campbell’s Texas Football ... Also earned four letters in basketball ... Ranked in the top 10 percent of his class academically. Personal: Mike Hargis was born on Nov. 30, 1993 … Son of Michael and Rosalind Hargis … Kinesiology major. Yr. 2012
Tackles Sacks Pass Def. Fumb. Blkd GP UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH Rcv FF Kick 9 1 4 5 1.0-2 0-0 0-0 0 0 0 0 0
51
La mar Foo tba l l Caleb Harmon RB l 5-9, 195 l Sr.-3L Port Neches, Texas Port Neches-Groves HS
#27
2012: Missed most of season with injury. 2011: Appeared in nine games with starts against Central Arkansas (10/22) and Stephen F. Austin (11/5) ... Finished the year with 48 carries for 169 rushing yards ... Best performance was a 15-carry, 78-yard day in Lamar’s 34-26 conference win at Nicholls (11/12) ... Added a personal best 35-yard run against the Colonels ... Scored one touchdown on the year, powering over from three yards out at Texas State (10/15) ... Added a 12-yard run against the Bobcats ... Finished with nine catches for 36 yards on the year, including four for 28 yards against UCA. 2010: Played in five games as a true freshman without recording a statistic. High School: Named third-team Class 4A All-State after stellar senior season at Port Neches-Groves HS ... Named Offensive Player of the Year on the 38th Annual Port Arthur News Super Team ... Led Indians to a perfect 11-0 regular season and the District 20-4A title ... Logged 298 carries for 1,832 yards, the second-best single season total in PN-G history ... Averaged 6.1 yards per carry and rushed for 20 touchdowns ... Rushed for personalbest 307 yards against Little Cypress-Mauriceville ... Was a firstteam selection on the Beaumont Enterprise Super Gold Team ... Also academic all-state and all-district. Personal: Caleb Dale Harmon was born on Dec. 9, 1991, in Port Neches, Texas ... Son of Dale and Susie Harmon ... Has an older brother Corey ... Majoring in business finance.
52
Yr. 2011 Yr. 2011
GP Att. Gain Loss Net Avg TD Lg 9 48 178 9 169 3.5 1 35 GP Rcpts. Yds Avg TD Lg Avg/G 9 9 36 4.0 0 13 4.0
Avg/G 18.8
Lawson Hartwick DS l 5-11, 240 l RS Jr.-2L Forney, Texas Forney HS
#48
2012:.
P.J. Henderson TE l 6-3, 220 l Sr.-2L Austin, Texas Anderson HS Jackson State
#47
2012: Played in five games, finishing with one catch for five yards at Stephen F. Austin (11/3) … Also saw playing time against Langston, Southeastern Louisiana, McMurry and Sam Houston State. 2011: Played in a pair of games after transferring from Jackson State, appearing against Texas College (9/3) and at Sam Houston State (10/29) ... Did not record a statistic on the year. At Jackson State: Redshirted in 2010 High School: Three-year football letterman for coach Mark Reiland at Anderson High School ... Named first-
L a m a r Fo otbal l team All-District 25-5A as a senior after rushing for 1,124 Kevin Johnson yards and 10 touchdowns on 160 carries ... Added 13 WR l 6-0, 210 l RS Jr.-1L catches for 160 yards and three touchdowns ... Was a reHouston, Texas gional finalist in the triple jump, and a four-year letterwinCypress Ridge HS #11 Oklahoma State ner in track and field ... Lettered twice in basketball, leading team in scoring and rebounding as a senior. Personal: Philbert J. Henderson was born on Sept. 30, Named to the 2013 The Sports 1990, in Dallas ... Son of Phil and Jill Henderson ... Older Network FCS Preseason Allbrother Darrion Branch played football at Iowa State, and America Third-Team at kick refather played basketball at Jackson State ... Majoring in turner psychology. Named to the 2013 CFPA Preseason Watch List 2012: Named the 2012 Southland Conference Newcomer David Hollyfield of the Year DL l 6-3, 225 l So.-1L and was an honorable mention all-conference selection at Silsbee, Texas both wide receiver and kick returner … Tied the school Silsbee HS #53 single-season touchdown record with 13 scores … Caught 10 touchdowns for the second most in Lamar history and tied for the most in the Southland Conference on the year 2012: Played in all 12 games as a true … Returned a pair of kickoffs for touchdowns and also freshman and finished the year with had a rushing score … Tied Lamar’s single-game record eight total tackles … Recorded a sea- with four touchdowns and 24 points in 52-21 victory over son-high three tackles in 52-21 victory over McMurry McMurry (10/13) … Caught season-high five passes for (10/13) … Finished with one tackle in first college game 77 yards and three touchdowns and added an 88-yard kickwhich accounted for a 4-yard loss at Louisiana-Lafayette off return for a score against the War Hawks … Finished (9/1) … Registered his lone sack of the year in 31-0 win the season with 19 catches for 309 yards and a team-best over Prairie View A&M (9/8), and also blocked a punt 16.3 yards per against the Panthers. catch … Finished High School: Helped Silsbee High School to an 8-3 with four catches record as a senior, earning District 21-3A first-team hon- for 84 yards and ors ... Also named to the Beaumont Enterprise Super three touchdowns Gold second team ... Finished year with 70 tackles, two in 31-0 win over sacks and an interception ... Advanced to regionals in Langston (9/22) … power lifting as a junior and senior. Became the fifth Personal: David Hollyfield was born on July 27, 1994 … player in school Son of Benny and Mary Hollyfield … Majoring in con- history to catch struction management. three touchdowns in a game and the Tackles Sacks Pass Def. Fumb. Blkd first to do so twice Yr. GP UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH Rcv FF Kick 2012 12 6 2 8 2.5-6 1.0-2 0-0 0 0 0 0 1 … Had a seasonlong 34-yard catch against Langston and added a 72yard
53
La mar Foo tba l l. Yr. 2012 Yr.
GP Rcpts. Yds Avg 11 19 309 16.3 GP K-Rets. Yds Avg 201211
TD 10 TD 22
Lg 34 Lg 623
Zach Johnson DB l 5-11, 180 l Fr.-RS Littlefield, Texas Littlefield HS on Nov. 3, 1993 ... Son of Justin and Michelle Johnson ... Majoring in kinesiology..
Ronnie Jones Jr.
Avg/G 28.1 28.3
#28
2
LB l 5-10, 240 l So.-1L Hempstead, Texas Hempstead HS
89
#44
Matt Johnson LB l 5-11, 180 l So.-1L Littlefield, Texas Littlefield HS
#55
2012: Played in a pair of games as a reserve running back ... Made collegiate debut at Northwestern State (10/6) ... Recorded a tackle in 52-21 win over McMurry (10/13). High School: Three-year starter for Coach Bryan Huseman at Littlefield High School ... Named First-Team AllDistrict. … Is a mechanical engineering major. Yr. 2012
54
Tackles Sacks Pass Def. Fumb. Blkd GP UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH Rcv FF Kick 12 14 9 23 3.0-15 1.0-12 0-0 0 0 0 0 0
L a m a r Fo otbal l William Jones LB l 5-10, 225 l Sr.-3L Beaumont, Texas Central HS
#49
2012: Saw playing time in six games and finished season with seven solo tackles … Matched a personal best with three tackles at Hawai`i (9/15) and equaled that total in 52-21 victory over McMurry (10/13) … Also registered first career sack against McMurry for a 2-yard loss … Other tackle came in 34-24 Southland Conference win over Nicholls (11/10). 2011: Played in eight games with a start at Nicholls (11/12) ... Finished the year with five tackles as a reserve linebacker ... Registered single tackle performances against Texas College (9/3), Incarnate Word (9/17), Southeastern Louisiana (10/1), Texas State (10/15) and Nicholls. 2010: Appeared in eight games as a freshman, finishing with eight total tackles ... Recorded a season-high three tackles at Stephen F. Austin (9/25) ... Had two tackles, including a sack that produced an 11-yard loss, in Lamar’s season-ending 44-6 win over Oklahoma Panhandle State (11/20). High School: Selected to first-team berth on The Port Arthur News’ 38th Annual Super Team after helping Central post a 9-4 record and second-place finish in District 20-4A … Was twice named first-team All-District 20-4A … Twice earned a second-team berth on the Beaumont Enterprise Super Gold Team ... Willie Ray Smith Award finalist after the 2009 season. Personal: William Jones was born on Sept. 18, 1991, in Port Arthur, Texas ... Son of Wilbert Jones and Patricia A. Williams ... Majoring in mathematics. Yr. 2010 2011 2012 Total
GP 8 8 6 22
Tackles Sacks Pass Def. UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH 7 1 8 1.0-11 1.0-11 0-0 1 0 3 2 5 0.0-0 0.0-0 0-0 0 0 7 0 7 1.0-2 1.0-2 0-0 0 0 17 3 20 2.0-13 2.0-13 0-0 1 0
Fumb. Blkd Rcv FF Kick 0 0 0 0 0 0 0 0 0 0 0 0
Kollin Kahler P/K l 6-2, 200 l Sr.-3L Waco, Texas Waco HS
#25
Named Preseason First-Team All Southland Conference Named to the 2013 CFPA Preseason Watch List 2012: Named to the CoSIDA Academic All-District 7 First-Team … Also named Academic All-Southland Conference and to the Football Championship Subdivision Athletics Directors Association Academic All-Star Team … Posted a 41.5 yards per punt average on 67 punts for the fifth best single-season average in school history … Average ranked fourth in the Southland Conference … Had a season-long punt of 63 yards against Sam Houston State (10/27) … Punted six times against Southeastern Louisiana (9/29) for an average of 47.2 yards per punt … Finished the season with 10 punts of 50 yards or longer and had 18 downed inside the 20 … Punted nine times for 373 yards at Hawai`i (9/15) for the fourth most single game punt yards in school history … Handled 11 kickoffs on the year with three going for touchbacks … Ran three times for 53 yards on the season with a long of 23 yards at Central Arkansas (10/20). 2011: Named honorable mention All-Southland Conference after finishing second in the league in average yards per punt at 42.3 ... Is the third best single-season punt average in Lamar history ... Boomed a 72-yard punt at Southeastern Louisiana (10/1) to tie for the third longest punt by a Lamar player ... Best day by average came against Northwestern State with four punts for 193 yards and a 48.2 per kick average ... Punted nine times for 397 yards (44.1 per punt) against Sam Houston State (10/29) for the third most single game punt yards in LU history ... Finished with 13 punts of 50 yards or longer and put 12 down in-
55
La mar Foo tba l l side the 20-yard line ... Had only one game where he averaged less than 39 yards per punt. 2010: Played in all 11 games as the Cards’ primary punter ... Finished the season with 55 punts for 2,089 yards and a 38.0 yards per punt average ... Had a season-long punt of 57 yards at Stephen F. Austin (9/25) ... Also had season-highs of 11 punts and 419 yards at SFA ... Both totals are single game records at Lamar ... Had six punts for 252 yards and an average of 42.0 per punt in college debut at McNeese State (9/4) ... Put 13 punts inside the 20 yard line ... Best game by average was 14-0 homecoming win over Langston (10/9) when he punted three times for a 42.7 yard average. High School: Was first-team academic all-state selection in 2009 and earned Academic all-district honors all four years at Waco High School … Was first-team punter on 2009 Waco Tribune Super Cen Tex Team and earned second-team laurels as a junior … Also started at quarterback and played some at wide receiver and running back … Was two-year all-district punter … Also starred in soccer, baseball and track. Personal: Kollin Kahler was born on Nov. 15, 1991 ... Son of Kent and Chrissane Kahler ... Majoring in exercise science. Yr. 2010 2011 2012 Total
GP Punts Yds Avg Lg TB 11 55 2089 38.0 57 4 11 64 2710 42.3 72 7 12 67 2782 41.5 63 3 34 186 7581 40.8 72 14
FC 13 2 8 23
I20 13 12 18 43
50+ Blk 7 1 13 1 10 1 30 3
Ian Kelso DL l 6-0, 280 l RS Jr.-2L Austin, Texas Lake Travis HS
#62
2012: Played in 10 games with five starts after moving from defensive line to offensive line … Played center in the season opener at Louisiana-Lafayette (9/1) before moving to right guard … Graded at nearly 85 percent for the season. 2011: Redshirted 2010: Played the last five games of the season, finishing with 16 total tackles ... Had six tackles in season debut against South Alabama (10/16) ... Matched that total with six tackles, including one for loss, at North Dakota (10/30) ... Had a pair of tackles, including a sack, in LU’s 44-6 sea-
56
son-ending win over Oklahoma Panhandle State ... Finished the year with 2.5 tackles for loss and one forced fumble. High School: Played sophomore season for coach Jeff Dicus and junior and senior seasons for coach Chad Morris at Lake Travis High School ... Helped the Cavaliers amass an incredible 47-1 record and three straight Class 4A state titles during his playing career ... Was named second-team all-state as a senior, as well as First-Team AllDistrict 27-4A honors ... Was also first-team all-area and all-region as a senior. Personal: Ian Joseph Kelso was born on June 21, 1991, in College Station, Texas ... Son of Kalin and Karen Kelso ... Has two brothers, Ovay and Romey ... Major is business. Yr. 2011
Tackles Sacks Pass Def. Fumb. Blkd GP UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH Rcv FF Kick 5 11 5 16 2.5-12 1.0-7 0-0 0 1 0 1 0
Jermaine Longino LB l 5-10, 220 l Sr.-1L Houston, Texas Hightower HS Trinity Valley CC
#10
Named Preseason Second-Team All Southland Conference 2012: Started all 12 games as a junior transfer and earned honorable mention All-Southland Conference honors … Tied for the conference lead with 107 total tackles and his 8.9 tackles per game ranked second among all conference defensive players … Forced three fumbles on the year which tied for second most in the Southland and also tied for second in the league with 63 solo tackles … Finished fourth on the team with 6.5 tackles for loss … Posted at least 10 tackles in five games with a season-high 16 stops at Stephen F. Austin (11/3) … Had 13 tackles, including a season-high 10 solos, against Southeastern Louisiana (9/29) and added 13 tackles and a forced fumble the following week at Northwestern State (10/6) … Finished with 11 tackles and a pair of pass breakups at Central Arkansas (10/20) … Finished with 10 tackles at Hawai`i (9/15) … Had two of his five quarterback hurries in 52-21 win over McMurry (10/13) … Leading tackler six times. Junior College: Was a first-team pick on the 2011 NJCAA All-America Team and was named the Southwest Junior College Football Conference Defensive Player of
L a m a r Fo otbal l the Year ... Helped Trinity Valley CC to an 8-3 record as a sophomore ... Played in 10 games as a sophomore and led Cardinals with 82 total tackles ... Registered 56 solo tackles, two sacks and two forced fumbles for a defense that allowed less than 300 total yards per game ... Had a season-high 12 solo tackles in a 38-20 win over Kilgore College ... Played in 10 games as a freshman, finishing with 47 tackles and a sack ... Had six total tackles in his first game at TVCC, a 63-0 win over Independence CC. High School: Named First-Team All-District 23-5A as a senior linebacker at Hightower ... Also earned first-team all-district honors as a junior at fullback as Hightower finished as the Texas Class 5A state runner-up. Personal: Jermaine Longino was born on Sept. 13, 1991 … Son of Philip Longino and Welthey Twitty … General studies major.
formation. High School: Was an offensive line starter and the deep snapper for Lamar Consolidated High School in 2009 … Also handled deep snapping chores as a junior in 2008 and was a late-season call-up to the varsity in 2007 when the Mustangs won the Class 4A Division II state championship … Ranked No. 9 in the nation as a deep snapper by Scout.com and No. 15 in the nation by Chris Sailer Kicking. Personal: Chris Maikranz was born on Sept. 27, 1991 ... Son of Glen Maikranz and Kandice Poorman ... Criminal justice major.
Tyrus McGlothen DB l 5-8, 175 l Sr.-1L Grand Prairie, Texas South Grand Prairie HS Cisco CC
#4
2012: Played in 11 games with seven starts, tying for fifth on the team with 43 tackles … Tied for second on the team with two interceptions and six pass breakups … Set a school record for longest interception return with a 96-yard return for a touchdown against Southeastern Louisiana (9/29) … Registered a season-high seven tackles against the Lions and added a tackle for loss and a forced fumble … Finished with five tackles and forced a fumble Tackles Sacks Pass Def. Fumb. Blkd that was scooped up and returned 62 yards for a score by Yr. GP UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH Rcv FF Kick James Washington at 2012 12 63 44 107 6.5-17 2.0-11 0-0 2 5 0 3 0 Northwestern State Chris Maikranz (10/6) … Had six DS l 6-6, 255 l Jr.-2L tackles and a pair of Sugar Land, Texas pass breakups in 31-0 Lamar Consolodated HS #43 victory over Langston (9/22) … Posted five tackles, an 2012: Played in 12 games … Had interception and a two tackles on the year, one at pass breakup at Hawai`i (9/15) and one at Central Stephen F. Austin Arkansas (10/20) … Did not commit a miscue as deep (11/3). snapper. Junior College: 2011: Appeared in 10 games at deep snapper ... Posted his Named First-Team second straight season without a miscue in the punting All-Southwest Junior game ... Registered a tackle at Texas State (10/15) for his College Football Conference as a first career statistic. 2010: Played in all 11 games for the Cardinals at deep freshman and sophomore ... Finished his sophomore seasnapper ... Finished the season without a miscue in punt son at Cisco CC with 53 tackles and a forced fumble in
57
La mar Foo tba l l eight games played ... Added two tackles for loss and a forced fumble ... Had a season-high 11 tackles in a tough 39-37 loss to Blinn College ... Played in eight games as a freshman, registering 32 tackles ... Recorded a sack, a forced fumble and an interception as a freshman ... Also had 10 pass breakups as a freshman. High School: Named First-Team All-District 7-5A at running back as a junior and was a second-team selection as a defensive back as a senior at South Grand Prairie High School. Personal: Tyrus McGlothen was born on Feb. 13, 1992 … Son of Angela Brooks … General studies major. Yr. 2012
Tackles Sacks Pass Def. Fumb. Blkd GP UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH Rcv FF Kick 11 31 12 43 3.0-6 0.0-0 2-118 6 2 0 2 0
Patrick McGriff TE l 6-1, 230 l RS Fr.-1L Crosby, Texas Crosby HS
#87
2012: Appeared in five games as a backup linebacker, mostly on special teams ... Made his collegiate debut in 52-21 victory over McMurry (10/13) ... Registered a solo tackle against the War Hawks for his lone statistic of the season. High School: Helped Crosby High School to a district title as a senior with an 8-3 record ... Named First-Team All-District 21-4A at offensive tackle as a senior and was a second-team selection as a junior. Personal: Patrick McGriff was born on Aug. 2, 1990 ... Son of Richard and Tina McGriff ... Majoring in exercise science.
Payden McVey TE l 6-1, 225 l Jr.-2L Deer Park, Texas Deer Park HS
#88
2012: Played in nine games with three starts … Recorded 10 catches for 60 yards on the season … Scored a pair of receiving touchdowns to rank third on the team … Finished with two catches for 18 yards against Southeastern Louisiana (9/29) with both receptions going for
58district mechanical engineering. Yr. 2011 2012 Total
GP Rcpts. Yds Avg 10 17 150 8.8 9 10 60 6.0 19 27 210 7.8
TD 2 2 4
Lg 23 13 23
Avg/G 15.8 6.7 11.1
L a m a r Fo otbal l Johnny Morris LB l 6-0, 185 l So.-RS Humble, Texas Atascocita HS
#59
Ryan Mossakowski QB l 6-4, 215 l RS Sr.-1L Frisco, Texas Centennial HS Northwest Mississippi CC
#18
2012: Redshirted 2012: Started the first five games of High School: Played for Coach Dean the year and finished the season with Colbert at Atascocita High School. eight appearances and six starts … Personal: Johnny Morris was born on June 17, 1993 ... Was 113-of-183 on the year for 1,194 yards and 13 touchSon of Betty Morris ... Majoring in mechanical engineering. downs … Completed 58.5 percent of his passes to establish the school’s single-season record for completion Logan Moss percentage … Was fourth in the Southland Conference LB l 6-2, 200 l RS So.-1L with a pass efficiency rating of 124.45 … Finished 22-ofOrange, Texas 36 for a season-high 239 yards and three touchdowns in Orangefield HS #91 31-0 victory over Langston (9/22) … Came off the bench to complete 11 passes for 231 yards and three touchdowns in the second half 2012: Named Academic All-South- at Stephen F. land Conference … Appeared in all Austin (11/3) … 12 games as a redshirt freshman and Hit Jordan Edrecorded 13 tackles on the season … Registered three wards for all three tackles in his first collegiate game at Louisiana-Lafayette scores at SFA, in(9/1), including his only tackle for loss on the season … cluding a 60-yard Also had a three-tackle game against Southeastern strike for longest Louisiana (9/29) with all three coming unassisted … Had completion of the a pair of solo tackles in 34-24 win over Nicholls (11/10) season … Fin… Finished with a tackle and a quarterback hurry in 31-0 ished 21-of-30 for 224 yards and a victory over Langston (9/22). pair of scores in 2011: Redshirted High School: Named first-team all-district as a tight end 31-0 win over following junior and senior seasons ... Also earned first- Prairie View A&M team district accolades at defensive line as a senior ... (9/8) and was 15Recorded 44 tackles as Orangefield finished with a 7-3 of-24 for 168 record during senior campaign ... Selected to the Southeast yards and three TDs in 34-24 victory over Nicholls (11/10) … Threw for Texas All-Star Classic. Personal: Logan Moss was born on Dec. 6, 1992, in a pair of touchdowns against Southeastern Louisiana Beaumont ... Son of Randall and Sheryl Moss ... Majoring (9/29) and ran for a season-high 24 yards against the Lions, including a 21-yard scamper … Finished the year in biology. with eight interceptions. Tackles Sacks Pass Def. Fumb. Blkd Junior College: Named Second-Team All-MACJC as a Yr. GP UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH Rcv FF Kick sophomore at Northwest Mississippi CC after helping 2012 12 9 4 13 1.0-1 0.0-0 0-0 0 1 0 0 0.
59
La mar Foo tba l lAmerica Junior Combine ... Led Centennial to the state playoffs for the first time in school history ... Starting punter for three seasons ... Also a two-time all-district baseball player. Personal: Ryan Mossakowski was born on Aug. 28, 1990 … Son of Dan and Sally Mossakowski … Majoring in educational technology. Yr. GP 2012 8
Comp-Att-Int Pct. Yds TD Lg 113-193-8 58.5 1194 13 60
Avg/G Effic 149.2 124.5
Mark Murrill DL l 6-2, 255 l Sr.-3L Lumberton, Texas Lumberton HS
#90
2012: Started all 12 games during junior campaign and finished eighth on the team with 37 total tackles … Was second among all Lamar defensive players with 8.5 tackles for loss accounting for 21 yards … Also tied for second on the team with five quarterback hurries … Posted two sacks on the year with one coming against Prairie View A&M (9/8) and one against Langston (9/22), both 31-0 Lamar victories … Recorded a personal-best seven tackles, including one for loss, at Northwestern State (10/6) … Finished with four tackles, a pass breakup and his first career interception at Stephen F. Austin (11/3) … Three of his six tackles against Langston were behind the line of scrimmage. 2011: Appeared in nine games with one start ... Posted nine tackles and two sacks ... Best game came at South Alabama (9/10) when he finished with four tackles, including two for loss, and a sack ... Had a sack and forced a fumble that directly led to a touchdown in Lamar’s 58-0 win over Texas College (9/3) ... Finished with three tackles in LU’s
60
48-38 win at Southeaste r n Louisiana (10/1). 2010: Played in all 11 games as a redshirt freshman ... Finished the season with 20 total tackles, including three for loss ... Recovered a fumble with 50 seconds to play to preserve Lamar’s 29-28 win at Southeastern Louisiana (9/18) ... Added two tackles, including one for loss, against the Lions ... Had a season-high five tackles in LU’s home opener against Webber International, including his only sack of the season ... Twice had four tackles in a game, LU’s 14-0 win over Langston (10/9) and in a 44-6 win over Oklahoma Panhandle State (11/20). High School: Three-year varsity starter for coach Alvin Credeur at Lumberton High School … Was first-team AllDistrict 20-4A as a senior and was an honorable mention selection on the 2008 Class 4A All-State team … Helped Raiders win their first-ever playoff appearance in 2008 when they posted a school-best 11-2 record … Logged 50 tackles, including three sacks and 13 others for losses as a senior in 2009 … Also forced four fumbles and recovered one … Had 41 tackles, including three sacks and three others for losses as a junior … Had 36 tackles, including two sacks and seven others for losses as a sophomore in 2006 … Also made second team all-district in soccer and was a two-year member of the National Honor Society. Personal: Mark Murrill was born on Oct. 19, 1990 … Son of Mark and Mary Murrill ... Has one sister, Kathleen ... Majoring in engineering. Yr. 2010 2011 2012 Total
GP 11 9 12 32
Tackles Sacks Pass Def. UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH 20 0 20 3.0-10 1.0-4 0-0 0 1 5 4 9 3.0-10 2.0-5 0-0 0 0 21 16 37 8.5-21 2.0-6 1-0 1 5 46 20 66 14.5-21 5.0-15 1-0 1 6
Fumb. Blkd Rcv FF Kick 1 0 0 0 1 0 0 0 0 1 1 0
L a m a r Fo otbal l Jayce Nelson WR l 6-2, 170 l So.-1L Port Neches, Texas Port Neches-Groves HS
#84
2012: Played in six games on the year without recording a statistic … First collegiate appearance came in 310.
Joe Okafor DL l 6-6, 295 l RS Jr.-1L Bellaire, Texas Bellaire HS Oklahoma State
#35
the state by Texas Football ... Named second-team AllDistrict 20-5A as a senior ... Played three years of varsity basketball. Personal: Joe Okafor was born on June 5, 1991 … Son of Priscilla Okafor … Majoring in general studies. Yr. 2012
Tackles Sacks Pass Def. Fumb. Blkd GP UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH Rcv FF Kick 11 12 6 18 4.5-11 1.0-5 0-0 1 2 0 0 1
George Orebe DB l 5-9, 165 l Jr.-1L Houston, Texas Westside HS
#30
2012:.
Keinon Peterson 2012: Played in 11 games with two starts after transferring from Oklahoma State … Finished the year with 18 tackles, including 4.5 for loss … Posted three tackles, including two for loss and his lone sack of the year at Northwestern State (10/6) … Added one of his two quarterback hurries on the season against the Demons … Finished with three tackles, a quarterback hurry and a pass breakup in 52-21 win over McMurry (10/13) … Recorded a season-high four tackles at Hawai`i (9/15) … Put up two tackles, including one for loss, and blocked a 36-yard field goal attempt in 31-0 shutout win over Langston (9/22). At Oklahoma State: Appeared in two games as a redshirt freshman at Oklahoma State in 2011, recording a tackle against Louisiana-Lafayette. High School: Prepped at Bellaire High School where he was ranked the No. 57 defensive end in the nation by Rivals ... Tabbed as one of the top 25 defensive linemen in
DB l 5-8, 190 l Sr.-3L Dickinson, Texas Dickinson HS
#19
2012: Played in nine games with a start in 31-0 win over Prairie View A&M (9/8) … Did not record a statistic on the year. 2011: Played in each of Lamar’s 11 games, with seven starts ... Finished the season with 23 total tackles ... Had season-high five tackles in LU’s 34-26 win at Nicholls (11/12), adding his first career interception against the Colonels ... Registered four solo tackles, a pass breakup and blocked an extra point attempt in LU’s 45-35 win over Incarnate Word (9/17) ... Also had four-tackle performances at Southeastern Louisiana (10/1) and against Northwestern State (10/8).
61
La mar Foo tba l l 2010: Played in all 11 games ... Finished with season-high three tackles at Stephen F. Austin (9/25) ... Matched that total in Lamar’s 14-0 win over Langston University (10/9) ... Had a pair of pass breakups in LU’s 24-20 victory over South Dakota. High School: Three-year varsity letterman for coach Warren Trahan at Dickinson High School … First-team all-district and All-Galveston County as a junior and senior … Gators went 9-3 during his senior season of 2008 and advanced to the regional round of the Class 5A Division II state playoffs … Served as a Junior Rotarian and volunteered with a monthly food drive benefitting the Veterans of Foreign Wars and senior citizens. Personal: Keinon Asrel Enrique Peterson was born on Sept. 5, 1990 … Son of Loretta Peterson ... Major is general studies. Yr. 2010 2011 2012 Total
GP 11 11 9 22
Tackles Sacks Pass Def. UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH 5 1 6 0.0-0 0.0-0 0-0 2 0 19 4 23 0.0-0 0.0-0 1-0 2 0 No Statistics 24 5 29 0.0-0 0.0-0 1-0 4 0
Fumb. Blkd Rcv FF Kick 0 0 0 0 0 1 0
0
1
Payton Ploch WR l 6-2, 215 l Sr.-3L Dayton, Texas Dayton HS
#23
2012: Played in all 12 games after moving from linebacker to H Back … Recorded 14 tackles on the year in special teams play … Finished with three solo stops in 310 win over Langston (9/22) … Put up a pair of tackles in 31-0 win over Prairie View A&M (9/8) and in loss to Southeastern Louisiana (9/29). 2011: Played in 10 games and got his first career start against Central Arkansas (10/22) as a backup linebacker... Compiled 22 total tackles on the year, including 21 solos ... Blocked a punt that was returned for a touchdown by
62
teammate Adrian Guillory in Lamar’s 34-26 win at Nicholls (11/12) ... Registered a season-high six tackles at Texas State (10/15), including one of his two tackles for loss on the season ... Had three tackles and a quarterback hurry in LU’s 48-38 win at Southeastern Louisiana (10/1) ... Also had three-tackle contests against Texas College, UCA and Nicholls. 2010: Played in all 11 games as a reserve linebacker ... Finished the season with 20 tackles, including three for loss and one sack ... Forced a fumble and returned it 29 yards for a touchdown, and returned a Branden Thomas blocked punt 15 yards for another touchdown, in Lamar’s season-ending 44-6 win over Oklahoma Panhandle State ... Had a season-high four tackles, including his sack, vs. OPSU as well ... Opened the season with a pair of tackles at McNeese State (9/4) in his college debut. High School: Played for coach Jerry Stewart at Dayton High School ... Moved to quarterback for senior season after earning All-District 19-4A laurels as a wide receiver during junior season … Completed 46 of 93 passes for 774 yards and 12 touchdowns … Carried the ball 180 times for 1,258 yards and 21 TDs … Added 452 receiving yards on 31 catches and scored four receiving TDs … Voted Most Valuable Player in District 19-4A and was the Texas Prepxtra Class 4A Offensive MVP for the Greater Houston/Southeast Texas area after helping to lead Broncos to an 11-3 record … Had 40 catches for 550 yards and 10 TDs as a junior. Personal: Payton Ploch was born on March 31, 1992, in Baytown, Texas ... Son of Jodi Ploch ... Major is general studies. Yr. 2010 2011 2012 Total
GP 11 10 12 33
Tackles Sacks Pass Def. UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH 17 3 20 3.0-9 1.0-7 0-0 1 0 21 1 22 2.0-6 0.0-0 0-0 0 1 12 2 14 0.0-0 0.0-0 0-0 0 0 50 6 56 5.0-15 1.0-7 0-0 1 1
Fumb. Blkd Rcv FF Kick 1 1 0 0 0 1 0 0 0 1 1 1
L a m a r Fo otbal l Desmond Richards RB l 5-9, 170 l So.-1L Montgomery, Texas Magnolia West HS
#15long.
2012: Yr. GP Rcpts. Yds Avg TD Lg Avg/G a senior after leading Magnolia West High School to a 9- 2011 8 7 89 12.7 1 17 11.1 No Catches 3 record ... Carried 256 times as a senior for 2,437 yards 2012 (9.5 per carry) and 31 touchdowns ... Also earned firstJustin Stout team all-district and All-Montgomery County honors and K l 6-1, 170 l Sr.-3L was a second-team Class 4A all-state selection ... Ran for Mesquite, Texas 1,878 yards and 25 touchdowns as a junior, earning honWest Mesquite HS #39 orable mention all-state honors ... Named First-Team AllDistrict 17-4A and All-Montgomery Country ... Finished high school career with 4,316 rushing yards and 57 touch2012: Played in all 12 games and findowns ... Earned all-district honors in baseball as a junior. ished 29-of-32 on extra point atPersonal: Desmond Richards was born on Sept. 29, 1993 tempts and was 6-of-10 on field goal … Son of Johnny Richards … Majoring in industrial techattempts … Scored 47 points on the year to finish second nology. on the team and is now fifth at Lamar in career points with Yr. GP Att. Gain Loss Net Avg TD Lg Avg/G 144 … Hit a season-long 41 yard field goal in 52-21 win 2012 8 32 140 10 130 4.1 0 20 16.2 over McMurry (10/13) and was 7-of-7 on PAT’s in the game … Made a pair of field goals at Stephen F. Austin Jesse Sparks (11/3), twice converting from 34 yards out … Hit a 37WR l 5-10, 170 l Jr.-2L yard field goal against Langston (9/22) and was 4-of-4 in Lumberton, Texas Lumberton HS #81 PAT’s in the 31-0 victory … Kicked off 37 times on the year with eight going for touchbacks. 2011: Appeared in 10 games for the Cardinals ... Set a school record by connecting on 35 (out of 37) extra-point 2012: Played in nine games mostly on attempts, breaking the previous mark of 32 set by two special teams … Recorded one players ... Tied the school record with eight makes against tackle on the year with it coming in Texas College in a 58-0 victory (9/3) ... Led the Cardinals 34-24 Southland Conference victory over Nicholls with 50 points on the year ... Was 5-of-8 on field-goal at(11/10). tempts with a long of 31 yards ... Was 6-for-6 on PATs 2011: Appeared in eight games for the Cardinals on special against Incarnate Word (9/17) ... Also had 21 kickoffs on teams and as a backup receiver ... Finished the year with the year.
63
La mar Foo tba l l 2010: Played in all 11 games as a true freshman, serving as Lamar’s kicker ... Made 20-of-22 extra-point attempts and was 9-of-13 on field-goal attempts ... Made both field goal attempts (21, 32) and all three PAT’s in season opener at McNeese State (9/4) ... Hit a season-long field goal of 47 yards at Stephen F. Austin (9/25) ... Hit all five extra-point attempts and was 3-of-3 on field goal attempts (25, 36, 40) in LU’s season-ending 44-6 win over Oklahoma Panhandle State ... The three field goals tied Lamar’s record for most in a game ... Handled kickoffs for the Cardinals with 43 on the season ... Had one punt on the year, a 27-yarder against Webber International (9/11) ... His 47 points scored ranked second on the team. High School: Earned three varsity letters for coach Mike Overton at West Mesquite High School ... Was successful on 79-of-80 extra-point attempts over his junior and senior seasons … Went 21-for-27 on field-goal attempts over the same span … Set the school field-goal record with a game-winning 50-yarder in 2008, then broke it with a 53yarder during the 2009 season … Set another school mark with five field goals in one game during junior season … Was a first-team Class 4A all-stater in 2008 and was the Special Teams MVP in the district in 2008 and 2009. Personal: Justin Kyle Stout was born on Nov. 8, 1991, in Mesquite, Texas ... Son of Robert and Janie Stout ... Has a younger brother, Austin ... General studies major. Yr. 2010 2011 2012 Total
64
GP FG-FGA Pct. 1-19 20-29 30-39 40-49 50+ 11 9-13 69.2 0-0 3-4 4-7 2-2 0-0 10 5-8 62.5 1-1 3-3 1-4 0-0 0-0 12 6-10 60.0 0-0 2-2 3-6 1-2 0-0 33 20-31 64.5 1-1 8-9 8-17 3-4 0-0
Lg XP-XPA 47 20-22 31 35-37 41 29-32 47 84-91
Branden Thomas DB l 5-9, 170 l Sr.-3L Beaumont, Texas Central HS
#21
Named to the 2013 CFPA Preseason Watch List 2012: Named honorable mention AllSouthland Conference ... Played in all 12 games with 11 starts … Led the team and tied for the Southland Conference lead with four interceptions on the year … Finished the season with 45 total tackles to rank fourth on the team … Added six pass breakups on the year and ranked sixth in the Southland Conference in passes defended … Finished with eight tackles at Northwestern State (10/6) and matched that total at Nicholls (11/10) … Added an interception in the 34-24 win over the Colonels … Finished with two interceptions in 52-21 win over McMurry (10/13) and returned the second back 53 yards for a touchdown … Recorded five tackles, one interception and a breakup in 31-0 win over Prairie View A&M (9/8) … Posted seven tackles, including one for loss, at Stephen F. Austin (11/3). 2011: Battled injuries but still appeared in seven games with four starts, including the final three games of the year ... Finished the year with 11 total tackles ... Registered three tackles against Stephen F. Austin (11/5) and McNeese State (11/19) ... Also had a forced fumble, a pass breakup and a quarterback hurry against the Lumberjacks ... Had his only interception of the year late in the game at Nicholls (11/12) as the Cardinals won 34-26 ... Had a pair of tackles and recovered a fumble against Northwestern State (10/8). 2010: Started all 11 games for the Cardinals ... Tied for fourth on the team with 44 tackles, including 34 solo tack-
L a m a r Fo otbal l les ... Led the team with nine pass breakups and tied for the team lead with three interceptions ... Had a seasonhigh eight tackles at Georgia State (11/6) ... Finished with seven tackles, three passes defensed and a blocked field goal attempt in 14-0 win over Langston University (10/9) ... Added two tackles, four pass breakups and a pair of blocked punts, one of which Payton Ploch returned for a touchdown, in 44-6 win over Oklahoma Panhandle State (11/20) ... Had two tackles and two interceptions in 2420 win over South Dakota (11/13) ... Other interception came in 29-28 win at Southeastern Louisiana (9/18) ... Forced a fumble at the goal line in the season opener at McNeese State (9/4) to keep the Cowboys out of the end zone. High School: Three-year letterman and two-year starter for coach Donald Stowers (former Lamar defensive back) at Beaumont Central … Was second-team All-District 204A selection as senior in 2008 after earning honorable mention in 2007. … Made 56 tackles, including 32 of the unassisted variety as a senior … Had five sacks, five pass breakups, two forced fumbles and one fumble recovery for a touchdown … Posted an 18.6-yard average on punt returns … Logged 29 tackles, two interceptions and 10 pass breakups as a junior … Jaguars went 9-4 and advanced to the Class 4A Division I quarterfinals in 2008 … Was also a state qualifier as a member of Jaguar track and field team … Member of the National Honor Society and the Junior NAACP. Personal: Branden Thomas was born on May 12, 1991 ... Son of Ernest and Keisha Thomas ... Majoring in kinesiology. Yr. 2010 2011 2012 Total
GP 11 7 12 30
Tackles Sacks Pass Def. UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH 34 10 44 0.0-0 0.0-0 3-10 9 0 10 1 11 0.0-0 0.0-0 1-16 1 1 33 12 45 1.0-1 0.0-0 4-68 6 0 77 23 100 1.0-1 0.0-0 8-94 16 1
Fumb. Blkd Rcv FF Kick 0 1 3 1 1 0 0 0 0 1 2 3
Courtlin Thompson DB l 6-1, 210 l Sr.-1L Lancaster, Calif. Antelope Valley Christian HS Saddleback CC
cluding one for a six-yard loss, in 31-0 win over Langston (9/22) … Had five tackle performances in 52-21 win over McMurry (10/13) and at Stephen F. Austin (11/3). Junior College: Played in seven games as a sophomore at Saddleback Community College after spending freshman season at San Jose State ... Helped the Gauchos to an 8-3 record and a spot in the Golden State Bowl ... Finished his season with 21 total tackles and one interception ... Appeared in seven games as a redshirt freshman at San Jose State in 2010. High School: Named Most Valuable Player of the Agape League his junior and senior seasons at Antelope Valley Christian HS ... Rushed for 2,600 yards and scored 25 touchdowns as senior ... Also lettered in basketball and baseball. Personal: Courtlin Thompson was born on May 26, 1991 … Son of Craig and Veyan Thompson … Communication major. Yr. 2012
Tackles Sacks Pass Def. Fumb. Blkd GP UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH Rcv FF Kick 8 20 12 32 1.0-6 0.0-0 0-0 0 0 0 0 0
Bret Treadway OL l 6-3, 250 l Fr.-RS Silsbee, Texas Silsbee HS
#58 kinesiology.
#7
2012: Played in eight games as a junior transfer with two starts … Finished the season with 32 total tackles, including 20 solo stops … Registered a season-high nine tackles at Central Arkansas (10/20) … Had six tackles, in-
65
La mar Foo tba l l James Washington LB l 5-11, 225 l Sr.-3L Houston, Texas Madison HS
#54
2012: Started all 12 games as a junior and finished third on the team with 68 total tackles … Added six tackles for loss on the year, including two sacks … Registered a personal-best 10 tackles at Stephen F. Austin (11/3) and picked off a pass to end a Lumberjack drive … Returned a fumble 62 yards for a touchdown at Northwestern State (10/6) … Added nine tackles, including one for loss, and a pass breakup against the Demons … Finished with four tackles and an 8-yard sack in 34-24 win over Nicholls (11/10) and also recorded a sack in 31-0 victory over Langston (9/22) … Recorded a season-high six solo tackles at Hawai`i (9/15) with one of his stops accounting for a 2-yard loss. 2011: Played in seven games with six starts before missing the remainder of the season due to injury ... Totaled 25 tackles, including 4.5 for loss ... Intercepted a pass and returned it 56 yards for a touchdown in Lamar’s 58-0 win over Texas College (9/3) ... Registered nine tackles with two going for loss in the Cards’ 45-35 win over Incarnate Word (9/17) ... Finished with seven tackles, including 2.5 for loss and a sack against Northwestern State (10/8) ... Also recovered a fumble against the Demons ... Had five stops and a fumble recovery in LU’s 48-38 win at Southeastern Louisiana (10/1).
66
2010: Played in 11 games ... Finished the year with 28 total tackles, including 22 solos ... Had a season-high eight tackles in Lamar’s 44-6 win over Oklahoma Panhandle State in the season finale (11/20) ... Had an interception, which he returned for 11 yards in 14-0 win over Langston University (10/9) ... Had four tackles, including one for loss, at North Dakota (10/30). High School: Played for coach Ray Seals at Madison HS … First-team all-district and All-Greater Houston … Voted Most Valuable Player for 8-3 Marlins team that reached the regional round of the Class 5A Division II playoffs … Also ran track and was a regional finalist in the 110-meter hurdles after winning the district championship. Personal: James Washington was born on June 12, 1991 … Son of Janice Washington and James Nelson … Majoring in kinesiology. Yr. 2010 2011 2012 Total
GP 11 7 12 30
Tackles UA A Tot 22 6 28 16 9 25 41 27 69 79 42 121
Sacks Pass Def. TFL-Yds. No.-Yds Int.-YdsBrUp QBH 1.5-3 0.0-0 1-11 0 0 4.5-10 1.0-5 1-56 2 0 6.0-18 2.0-13 1-0 3 0 12.0-31 3.0-18 3-67 5 0
Fumb. Blkd Rcv FF Kick 0 0 0 2 0 0 1 1 0 3 1 0
Marcus Washington DL l 6-3, 295 l Jr.-1L Houston, Texas Stephen F. Austin HS Ft. Scott CC
#98
2012:.
L a m a r Fo otbal l Brock Wempa OL l 6-2, 345 l Sr.-1L Royse City, Texas Royse City HS Tyler JC
#72
2012: Played in nine games with eight starts, including the final five games of the season … Used primarily at left guard … Experienced blocker who has tremendous size. Junior College: Helped Tyler Junior College to a No. 18 final national ranking as a sophomore with a 7-4 record ... Blocked for a rushing game that finished with 352 yards on 62 carries in the Apaches’ 37-34 upset of top ranked Blinn College ... TJC averaged nearly 400 yards of offense per game in 2011, including 230 yards per game on the ground. High School: A three time Associated Press all-state selection at Royse City High School ... Helped the Bulldogs to a 7-4 record and a trip to the Class 4A playoffs as a senior. Personal: Brock Wempa was born on Sept. 17, 1990 … Son of Brian and Carlota Wempa … Criminal justice major.
Jestin White LB l 6-4, 190 l RS So.-1L Houston, Texas North Shore HS
#41
2012:). 2011: Played in all 11 games as a redshirt freshman ... Finished the year with 12 tackles ... Best outing came at Sam Houston State (10/29) when he recorded five tackles, including three solos ... Had a pair of solo tackles against McNeese State (11/19). 2010: Redshirted High School: Played for coach David Aymond at tradi-
tion-rich Galena Park North Shore HS, which has produced many Division I signees and broke the national high school record of consecutive regular-season victories with 73 … Earned firstteam ... Major is general studies. Yr. 2011 2012 Total
GP 11 11 22
Tackles Sacks Pass Def. UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH 8 4 12 0.0-0 0.0-0 0-0 0 0 4 4 8 2.0-3 1.0-3 0-0 1 2 12 8 20 2.0-3 1.0-3 0-0 1 2
Fumb. Blkd Rcv FF Kick 0 0 0 0 0 0 0 0 0
Jeff Whittaker OL l 6-1, 220 l So.-RS Humble, Texas Humble HS
#69
2012: Redshirted High School: Played at Humble High School, helping the Wildcats to a 12-2 record and the 18-4A district title in 2010 with a 70 mark ... Helped offense average over 43 points per game in district play. Personal: Jeff Whittaker was born on Apr. 4, 1993 ... Son of Stacy Williams ... Majoring in communication.
67
La mar Foo tba l l Josh Wilson DB l 5-7, 185 l Jr.-2L Beaumont, Texas West Brook HS
#36
2012: Played in five games on the season, including the last three of the year ‌ Finished with one tackle on the year which came at Central Arkansas (10/20). 2011: Played in three games as a backup defensive back ... Recorded single tackles against Incarnate Word (9/17), Sam Houston State (10/29) and Stephen F. Austin (11/5). High School: Named first-team All-District 21-5A as a senior at West Brook High School ... Also a second-team All-Southeast Texas selection that same year ... Selected to play in the Southeast Texas Ford Dealers All-Star Classic ... Helped West Brook to a 9-4 overall mark and a perfect 5-0 district record as a senior. Personal: Joshua Wilson was born on Dec. 22, 1991 ... Son of William and Dephane Wilson ... Majoring in chemical engineering. Yr. 2011 2012 Total
68
GP 3 5 8
Tackles Sacks Pass Def. UA A Tot TFL-Yds. No.-Yds Int.-YdsBrUp QBH 2 1 3 0.0-0 0.0-0 0-0 0 0 0 1 1 0.0-0 0.0-0 0-0 0 0 2 2 4 0.0-0 0.0-0 0-0 0 0
Fumb. Blkd Rcv FF Kick 0 0 0 0 0 0 0 0 0
L a m a r Fo otbal l
2013 Newcomers Name Ronald Barrett Tommie Barrett Brannon Beaton James Bellard Kade Burman Colby Campbell Cole Carleton Juan Carranco Hunter Conn Koby Couron John Craven Keith Curran Rex Dausin Joshua Davis Joshua Frost Richard Gipson Jonathon Green Kevin Greif Kevin Gunnels Kade Harrington Victor Hawkins Montez Hunter Lloyd Julian Sam Keeter Chris Mayer Chance McCormack Eddie McGill Robert Mitchell Tony Qualls Emmitt Raleigh Blake Rising Mark Roberts Brent Salenga Deven Scoby Tramon Shead Romando Stewart Omar Tebo Judge Wolfe
Pos. DB DB TE LB LB DB LB K OL DL OL LB QB K DL LB DL OL LB RB WR DB DB TE OL OL LB QB LB RB OL WR WR DB OL LB DL QB
Ht. 5-11 5-10 6-3 6-2 6-3 6-0 6-0 6-0 6-5 6-3 6-3 6-4 6-2 6-1 6-1 6-2 6-0 6-3 5-11 5-9 6-2 5-11 5-10 6-4 6-7 6-3 6-0 6-1 6-0 6-0 6-1 6-3 5-8 5-11 6-6 6-2 6-0 5-10
Wt. Cl. 180 So.-HS 170 So.-HS 245 Fr.-HS 225 So.-HS 200 Fr.-HS 185 Fr.-HS 215 Fr.-HS 170 Fr.-HS 285 Fr.-HS 240 Fr.-HS 285 Fr.-HS 240 Jr.-TR 203 RS Fr.-TR 200 Fr.-HS 315 Jr.-TR 215 Fr.-HS 265 Fr.-HS 260 Fr.-HS 210 So.-RS 185 Fr.-HS 205 Fr.-HS 180 Jr.-TR 165 Fr.-HS 225 Fr.-HS 345 Jr.-TR 295 Jr.-TR 225 Fr.-HS 200 Fr.-HS 215 Fr.-HS 210 Fr.-HS 255 Fr.-HS 190 Jr.-TR 170 So.-HS 195 Fr.-HS 305 Jr.-TR 210 Fr.-HS 295 Fr.-HS 170 Fr.-HS
Hometown (High School/College) Silsbee, Texas (Silsbee HS) Silsbee, Texas (Silsbee HS) Whitehouse, Texas (Whitehouse HS) Baytown, Texas (Barbers Hill HS) Livingston, Texas (Livingston HS) Whitehouse, Texas (Whitehouse HS) Omaha, Neb. (Elkhorn South HS) Dayton, Texas (Dayton HS) Whitehouse, Texas (Whitehouse HS) Nederland, Texas (Nederland HS) Spring, Texas (Klein Collins HS) Garden City, Kan. (Garden City HS/Garden City CC) San Antonio, Texas (Warren HS/Houston) Marshall, Texas (Evangel (La.) HS) Cypress, Calif. (Edison HS/Golden West College) Tyler, Texas (John Tyler HS) Houston, Texas (North Shore HS) Spring, Texas (Klein Oak HS) Houston, Texas (George Bush HS) Kingwood, Texas (Kingwood HS) Longview, Texas (Pine Tree HS) Lakewood, Calif. (Artesia HS/Long Beach CC) Bellaire, Texas (Episcopal HS) Dallas, Texas (Woodrow Wilson HS) Shawnee, Kan. (Mill Valley HS/Fort Scott CC) Dayton, Texas (Dayton HS/Blinn JC) Stockbridge, Ga. (Woodland HS) Beaumont, Texas (Central HS) Houston, Texas (Spring Westfield HS) Houston, Texas (Spring Westfield HS) Winnie, Texas (East Chambers HS) Orange, Texas (West Orange-Stark HS/Houston) Nederland, Texas (Nederland HS) Houston, Texas (Travis HS) Cayuga, Texas (Cayuga HS/Kilgore JC) Newton, Texas (Newton HS) Liberty, Texas (Liberty HS) Palmer, Texas (Palmer HS)
69
La mar Foo tba l l Ronald Barrett DB l 5-11, 180 l So.-HS Silsbee, Texas Silsbee HS
LB l 6-2, 225 l So.-HS Baytown, Texas Barbers Hill HS
Two-year letterwinner for Bobby McGallion at Silsbee High School ... Named Second-Team All-District 213.
Tommie Barrett DB l 5-11, 170 l So.-HS Silsbee, Texas Silsbee HS
Named Second-Team All-District 213A as a senior after registering 51 tackles and a pair of interceptions ... Appeared in just four games for Silsbee High School as a junior after suffering a broken leg ... Helped the Tigers to the 2010 Class 3A state semifinals with a 30-5 overall record.
Brannon Beaton TE l 6-3, 245 l Fr.-HS Whitehouse, Texas Whitehouse HS
James Bellard
#85
#51.
Kade Burman LB l 6-3, 200 l Fr.-HS Livingston, Texas Livingston HS
#97
Earned Second-Team All-District 204A accolades at both defensive end and punter as a senior at Livingston High School … Registered 77 tackles, including 18 for loss, along with 13 sacks … Also forced five fumbles and recovered seven others … Finished with 58 tackles and 11 sacks as a junior … Helped the Lions to a 5-3 district mark as a senior and a 4-3 record as a junior … Also was a starter at tight end during junior and senior seasons … Academic all-district in football … Also an all-district soccer player.
Colby Campbell DB l 6-0, 185 l Fr.-HS Whitehouse, Texas Whitehouse HS
#12
Played both tight end and defensive end for Randy McFarlin at Whitehouse High School ... Named SecondNamed First-Team All-District 16-4A Team All-District 16-4A as a senior ... Helped the Wildcats as a junior and senior … Led Whiteto a 10-2 record on the year with 44 tackles and four sacks house High School with 77 tackles ... Named honorable mention all-district as a junior after and five pass breakups as a senior as the team finished 10posting 43 tackles and helping Whitehouse to a runner- 2 … Recorded nine tackles in his final high school game, a 63-56 loss to Wylie East … Averaged 7.0 tackles per up finish in district play. game as a junior with a high of 13 in a 70-48 win over Pine Tree.
70
L a m a r Fo otbal l Cole Carleton LB l 6-0, 215 l Fr.-HS Omaha, Neb. Elkhorn South HS
#50 … Earned three letters.
Juan Carranco K l 6-0, 170 l Fr.-HS Dayton, Texas Dayton HS
#95
Koby Couron DL l 6-3, 240 l Fr.-HS Nederland, Texas Nederland HS
#92
Named to the Associated Press Class 4A all-state second-team after registering 98 tackles, including 29 for loss, 14 sacks and three pass breakups as a senior at Nederland High School … Added 27 quarterback hurries and 16 quarterback knockdowns … Named First-Team All-District 20-4A and to the Port Arthur News Super Team as a junior and senior … Helped Nederland to back-to-back 7-0 District 20-4A titles as a junior and senior, including a combined 23-4 record over his final two seasons … Led Nederland to a 12-2 record as a senior and a spot in the 4A Region 3 finals … Member of the 2012 All-Southeast Texas Team and was selected on the Beaumont Enterprise Super Gold Team.
John CravenTeam All-Greater Houston.
Hunter Conn OL l 6-5, 285 l Fr.-HS Whitehouse, Texas Whitehouse HS
#75.
OL l 6-3, 285 l Fr.-HS Spring, Texas Klein Collins HS
#78
Played last season at the Naval Academy Prep School in Newport, Rhode Island … Helped Klein Collins High School to an 11-1 record and an undefeated District 135A title as a junior … Was named Second-Team All-District 13-5A as a senior as the Lions finished 8-3.
Keith Curran LB l 6-4, 240 l Jr.-TR Garden City, Kan. Garden City HS Garden City CC
#42
Helped Garden City Community College win the Mississippi Bowl with a 7-4 overall record as a sophomore … Finished with 50 tackles and 10 sacks for the Broncbusters … Played his high school football at Garden City High School where he recorded 77 tackles and five sacks as a senior on his way to all-state honors.
71
La mar Foo tba l l Rex Dausin QB l 6-2, 203 l RS Fr.-TR San Antonio, Texas Warren HS University of Houston
Richard Gipson
#14
Redshirted his freshman season at the University of Houston ... Played for his father Bryan Dausin at Warren High School ... Named the District 27-5A Offensive MVP as a senior ... Selected second-team all-state by the Padilla Poll after passing for 3,310 yards and 34 touchdowns as a senior ... Added 564 rushing yards and 15 touchdowns on the ground for 3,874 yards of total offense ... Helped the Warriors to an 11-2 record as a senior and a 19-6 mark over his final two seasons ... Finished 21-of-29 for 452 yards and six touchdowns in a win over Churchill ... AllArea selection by the San Antonio Express News after completing 65 percent of his trhows ... Also selected firstteam all-district as a junior after passing for 2,254 yards and 20 TDs ... Completed 57 percent of his passes as a junior ... Lettered as a sophomore as a starting wide receiver.
Joshua Davis K l 6-1, 200 l Fr.-HS Marshall, Texas Evangel (La.) HS
#96.
72
LB l 6-2, 215 l Fr.-HS Tyler, Texas John Tyler HS
#24
Led John Tyler High School to backto.
Jonathon Green DL l 6-0, 265 l Fr.-HS Houston, Texas North Shore HS
#63
Two-year starter for David Ayman at North Shore High School ... Helped the Mustangs advance to the regional finals with a 12-2 record ... Earned Second-Team All-District 21-5A honors at offensive lineman as a senior ... Helped North Shore to an 8-4 record as a junior.
L a m a r Fo otbal l Kevin Greif OL l 6-3, 260 l Fr.-HS Spring, Texas Klein Oak HS
Montez Hunter
#74
Two-year starter at tackle for Klein Oak High School … Helped the Panthers to the District 13-5A title and a 9-4 record as a junior … Named to the academic all-district team.
Kade Harrington RB l 5-9, 185 l Fr.-HS Kingwood, Texas Kingwood HS
#8.
Victor Hawkins WR l 6-2, 205 l Fr.-HS Longview, Texas Pine Tree HS
#82
DB l 5-11, 180 l Jr.-TR Lakewood, Calif. Artesia HS Long Beach CC
#5 ... Played multiple positions at Artesia High School.
Lloyd Julian DB l 5-10, 165 l Fr.-HS Bellaire, Texas Episcopal HS
#36
Helped Episcopal to a 9-2 record as a senior and a 5-1 district record … Led team with three interceptions and returned two for touchdowns during senior campaign … Named to the Southwest Preparatory Conference AllState team as a senior … Also played wide receiver … An all-state performer in track.
Sam Keeter Named Second-Team All-District 144A following senior season at Pine Tree High School ... Finished the year with 902 total yards from scrimmage and six touchdowns ... Caught 40 passes for 548 yards and four touchdowns while rushing 33 times for 354 yards and a pair of scores ... Played primarily at defensive back as a junior, recording 43 tackles and an interception ... Had 20 carries for 211 yards during junior season.
TE l 6-4, 225 l Fr.-HS Dallas, Texas Woodrow Wilson HS
#80
Played quarterback as a senior at Woodrow Wilson High School and led the Wildcats to the playoffs … Named Second-Team All-District 12-4A … Played tight end and defensive end as a sophomore and junior.
73
La mar Foo tba l l Chris Mayer OL l 6-7, 345 l Jr.-TR Shawnee, Kan. Mill Valley HS Fort Scott CC
Robert Mitchell
#68
Played two seasons at Fort Scott and earned honorable mention All-Kansas Jayhawk Community College Conference (KJCCC) honors as a sophomore … Blocked for a Greyhound offense which accounted for 340 yards and 26 points per game … Prepped at Mill Valley High School where he helped the team to four straight playoff appearances … Earned All-Kaw Valley Conference honors on both the offensive and defensive lines as a senior.
Chance McCormack OL l 6-3, 295 l Jr.-TR Dayton, Texas Dayton HS Blinn JC
Eddie McGill
#38
Played at Woodland (Ga.) High School for Scott Schmitt ... Set school records for tackles in a game with 18 and in a season with 151 ... Named to the All-Region 3AAAA Division A team following his senior season for the Wolfpack ... Selected to play in the Georgia High School Senior All-Star Bowl.
74
#13
Three-year starter for Beaumont Central High School completed 134-of236 passes as a senior for 1,794 yards and 13 touchdowns … Added 599 rushing yards and 12 touchdowns to earn co-Offensive Player of the Year honors in District 20-4A … Rushed for 435 yards and five scores as a junior.
Tony Qualls LB l 6-0, 215 l Fr.-HS Houston, Texas Spring Westfield HS
#52
#56
Earned honorable mention All-Southwest Junior College Football Conference accolades in 2012 at Blinn Junior College … Helped Blinn to a 9-2 record as a freshman, including a perfect 6-0 conference mark and a final national ranking of No. 10 … Earned First-Team All-District 19-4A honors as a senior at Dayton High School and second-team honors as a junior … Helped Dayton reach the state finals in 2009.
LB l 6-0, 225 l Fr.-HS Stockbridge, Ga. Woodland HS
QB l 6-1, 200 l Fr.-HS Beaumont, Texas Central HS
Earned Second-Team All-District 135A honors as a senior at Spring Westfield High School after helping the Mustangs to a 12-1 record ... Finished the season with 47 tackles, including four for loss, and two sacks ... Helped the team to a 10-4 record as a junior, including a trip to the regional finals.
L a m a r Fo otbal l Emmitt Raleigh RB l 6-0, 210 l Fr.-HS Houston, Texas Spring Westfield HS
#22Greater Houston second-team … Ran for 273 yards and seven touchdowns in Westfield’s 55-35 win over Spring … Finished season with over 2,200 all-purpose yards and 32 touchdowns.
Blake Rising OL l 6-1, 255 l Fr.-HS Winnie, Texas East Chambers HS
#67.
for 936 yards and 12 touchdowns ... Was tabbed a threestar recruit by Rivals.com and Scout.com ... Helped the Mustangs to the second round of the Class 3A playoffs as a senior ... Added 671 receiving yards with four touchdowns as a junior ... Named all-region by PrepStar ... Averaged over 21 yards per catch over his final two seasons ... Also ran track for WOS.
Brent Salenga WR l 5-8, 170 l So.-HS Nederland, Texas Nederland HS
Four-year letterwinner for Larry Neumann at Nederland High School ... Named First-Team All-District 20-4A as a senior ... Also named to the Port Arthur News Super Team that year ... Registered 28 catches for 444 yards and four touchdowns as a senior ... Also carried 20 times for 144 yards and a touchdown ... Helped Bulldogs to an 112 overall record and a perfect 7-0 mark in district ... Recorded 36 catches for 321 yards and five touchdowns as a junior ... Selected to play in the 2011 Southeast Texas All-Star Classic and scored on a 50-yard fake punt in the game.
Deven Scoby DB l 5-11, 195 l Fr.-HS Houston, Texas Travis HS
Mark Roberts WR l 6-3, 190 l Jr.-TR Orange, Texas West Orange-Stark HS University of Houston
#5
Played two seasons at the University of Houston, registering 15 catches in 19 games ... Finished with six catches for 136 yards as a freshman and had nine grabs for 114 yards and a touchdown as a sophomore ... Finished with five catches for 67 yards, including a 5-yard touchdown, against East Carolina ... Longest career catch was a 58yarder at UAB during freshman campaign ... Played for Dan Hooks at West Orange-Stark High School, earning district MVP honors as a senior after posting 43 catches
Named First-Team All-District 23-5A as a senior kick returner at Travis High School ... Played defensive back for Coach Randy Cunningham, and also had 10 carries and four catches on offense as a senior.
75
La mar Foo tba l l Tramon Shead OL l 6-6, 305 l Jr.-TR Cayuga, Texas Cayuga HS Kilgore JC
#71
Omar Tebo DL l 6-0, 295 l Fr.-HS Liberty, Texas Liberty HS
#65
Selected First-Team All-District 22Named honorable mention All-South3A as a junior and senior … Helped west Junior College Football ConferPanthers to an 8-2 record and the reence as a sophomore at Kilgore Junior College … Helped Cayuga High School to the Class A Di- gional playoffs as a junior … Also went to regionals during vision 2 state title as a senior … Was named First-Team freshman and sophomore seasons … Was a state qualifier All-District 20-A and was a second-team all-state selection in powerlifting. as a senior.
Romando Stewart LB l 6-2, 210 l Fr.-HS Newton, Texas Newton HS
#33
Named First-Team All-District 10-2A as a senior at Newton High School … Registered 94 tackles, five sacks, one forced fumble and one interception as Newton finished 13-1 and advanced to the 2012 Class 2A state semifinals … Helped the Eagles to a district title as a junior … Was a regional qualifier in track and field.
76
Judge Wolfe
QB l 5-10, 170 l Fr.-HS Palmer, Texas Palmer HS
#16district as a junior and senior, and was a second team selection as a sophomore … Finished three-year career with over 2,800 rushing yards.
2012 STATISTICS
La mar Foo tba l l 2012 Results and Statistics 2012 Record ALL GAMES CONFERENCE NON-CONFERENCE Date Sept. 1 Sept. 8 Sept. 15 Sept. 22 Sept. 29 Oct. 6 Oct. 13 Oct. 20 Oct. 27 Nov. 3 Nov. 10 Nov. 17
Overall
Away
Neutral
4-8-0 1-6-0 3-2-0
4-2-0 1-2-0 3-0-0
0-6-0 0-4-0 0-2-0
0-0-0 0-0-0 0-0-0
Opponent at Louisiana-Lafayette PRAIRIE VIEW A&M at Hawai`i LANGSTON SOUTHEASTERN LOUISIANA* at Northwestern State* MCMURRY UNIVERSITY at Central Arkansas* SAM HOUSTON STATE* at Stephen F. Austin* NICHOLLS* at McNeese State*
RUSHING GP Att Garrett, D. 10 138 Sims, H. 7 96 Harris, D. 10 68 Richards, D. 8 32 Kahler, K. 12 3 Berry, C. 8 53 Mossakowski, R.8 40 Johnson, K. 11 2 Handy, M. 3 2 Robertson, S. 12 0 Barrett, D. 2 3 Gladney, G. 8 1 Franks, V. 12 2 TEAM 10 11 Total 12 451 Opponents 12 443
Net 585 388 310 130 53 38 23 15 9 7 7 1 -7 -48 1511 1926
Avg 4.2 4.0 4.6 4.1 17.7 0.7 0.6 7.5 4.5 0.0 2.3 1.0 -3.5 -4.4 3.4 4.3
PASSING G Effic Cmp-Att-Int Pct Mossakowski, R.8 124.45 113-193-8 58.5 Berry, C. 8 94.65 76-146-5 52.1 TEAM 10 0.00 0-1-0 0.0 Total 12 111.29 189-340-13 55.6 Opponents 12 116.61 228-394-13 57.9
Yds 1194 663 0 1857 2397
RECEIVING Ford, B. Edwards, J. Begelton, R. Johnson, K. Franks, V. Sims, H. McVey, P. Harris, D. Soto, C. Garrett, D. Hanna, J. Gladney, G. Richards, D. Handy, M. Henderson, P.J. Total Opponents
G 12 12 12 11 12 7 9 10 12 10 9 8 8 3 5 12 12
Gain 608 422 329 140 53 197 145 15 11 7 8 1 1 0 1937 2180
No. 49 23 21 19 17 11 10 10 7 7 6 3 3 2 1 189 228
Loss 23 34 19 10 0 159 122 0 2 0 1 0 8 48 426 254
Result L, 0-40 W, 31-0 L, 2-54 W, 31-0 L, 21-31 L, 23-30 W, 52-21 L, 14-24 L, 7-56 L, 26-40 W, 34-24 L, 0-35
Yds 470 349 172 309 165 70 60 31 88 45 42 37 0 14 5 1857 2397
Avg 9.6 15.2 8.2 16.3 9.7 6.4 6.0 3.1 12.6 6.4 7.0 12.3 0.0 7.0 5.0 9.8 10.5
TD 1 4 1 10 0 0 2 0 0 0 0 0 0 0 0 18 17
Attendance 25,803 15,367 31,442 12,383 8,426 8,357 13,452 9,374 9,042 4,421 8,043 11,235 TD Long Avg/G 2 35 58.5 2 25 55.4 1 32 31.0 0 20 16.2 0 23 4.4 2 28 4.8 0 21 2.9 1 12 1.4 0 11 3.0 0 0 0.6 0 5 3.5 0 1 0.1 0 1 -0.6 0 0 -4.8 8 35 125.9 23 93 160.5 TD Lng 13 60 5 27 0 0 18 60 17 86
Avg/G 149.2 82.9 0.0 154.8 199.8
Long 25 60 18 34 34 25 13 8 22 14 12 17 3 8 5 60 86
Avg/G 39.2 29.1 14.3 28.1 13.8 10.0 6.7 3.1 7.3 4.5 4.7 4.6 0.0 4.7 1.0 154.8 199.8
TEAM STATISTICS SCORING Points Per Game FIRST DOWNS Rushing Passing Penalty RUSHING YARDAGE Rushing Attempts Average Per Rush Average Per Game TDs Rushing PASSING YARDAGE Comp-Att-Int Average Per Pass Average Per Catch Average Per Game TDs Passing TOTAL OFFENSE Average Per Play Average Per Game KICK RETURNS: #-Yards PUNT RETURNS: #-Yards INT RETURNS: #-Yards FUMBLES-LOST PENALTIES-Yards PUNTS-AVG TIME OF POSSESSION/Game 3RD-DOWN Conversions 4TH-DOWN Conversions
OPP 355 29.6 221 86 111 24 1926 443 4.3 160.5 23 2397 228-394-13 6.1 10.5 199.8 17 4323 5.2 360.2 29-541 30-381 13-110 11-3 79-633 55-39.5 28:44 58/178 12/26
INTERCEPTIONS Thomas, B. Davis, N. McGlothen, T. Guillory, A. Prescott, J. Murrill, M. Washington, J. Garrett, J. Total Opponents
No. 4 2 2 1 1 1 1 1 13 13
Yds 68 21 118 0 26 0 0 0 233 110
Avg 17.0 10.5 59.0 0.0 26.0 0.0 0.0 0.0 17.9 8.5
TD 1 0 1 0 1 0 0 0 3 0
Long 53 25 96 0 26 0 0 0 96 33
PUNT RETURNS Venson, M. Franks, V. Total Opponents
No. 14 3 17 30
Yds 97 14 111 381
Avg 6.9 4.7 6.5 12.7
TD 0 0 0 2
Long 20 14 20 75
KICK RETURNS Johnson, K. Franks, V. Venson, M. Davis, N. TEAM Hollyfield, D. Harris, D. Jones, R. Total Opponents
No. 22 17 5 3 2 1 1 1 52 29
Yds 623 410 73 43 0 11 23 1 1184 541
Avg 28.3 24.1 14.6 14.3 0.0 11.0 23.0 1.0 22.8 18.7
TD 2 0 0 0 0 0 0 0 2 1
Long 89 73 33 19 0 11 23 0 89 95
FIELD GOALS FGM-FGA Pct 1-19 20-29 30-39 40-49 50+ Lg Blk Stout, J. 6-10 60.0 0-0 2-2 3-6 1-2 0-0 41 1 PUNTING Kahler, K. TEAM Total Opponents
78
LU 241 20.1 206 93 93 20 1511 451 3.4 125.9 8 1857 189-340-13 5.5 9.8 154.8 18 3368 4.3 280.7 52-1184 17-111 13-233 37-19 83-760 68-40.9 31:16 63/173 13/22
No. 67 1 68 55
Yds 2782 0 2782 2174
Avg 41.5 0.0 40.9 39.5
Long 63 0 63 56
TB 3 0 3 4
FC 8 0 8 15
I20 18 0 18 13
Blkd 1 0 1 1
L a m a r Fo otbal l 2012 Statistics SCORING TD Johnson, K. 13 Stout, J. 0 Edwards, J. 4 Garrett, D. 2 Berry, C. 2 Sims, H. 2 McVey, P. 2 Thomas, B. 1 Harris, D. 1 Washington, J. 1 Prescott, J. 1 Begelton, R. 1 McGlothen, T. 1 Ford, B. 1 Guillory, A. 0 Total 32 Opponents 43
|------------- PATs -------------| FGs Kick Rush Rcv Pass DXP Saf Points 0-0 0-0 0-0 0 0-0 0 0 78 6-10 29-32 0-0 0 0-0 0 0 47 0-0 0-0 0-0 0 0-0 0 0 24 0-0 0-0 0-0 0 0-0 0 0 12 0-0 0-0 0-0 0 0-0 0 0 12 0-0 0-0 0-0 0 0-0 0 0 12 0-0 0-0 0-0 0 0-0 0 0 12 1 0 2 6-10 29-32 0-0 0 0-0 1 0 241 18-22 41-41 1-2 0 0-0 0 0 355
DEFENSIVE LEADERS Longino, J. Allen, C. Washington, J. Thomas, B. Dickson, J. Guillory, A. McGlothen, T. Murrill, M. Thompson, C. Prescott, J. Davis, N. Garrett, J. Malbrough, M. Jones, R. Dorsey, A. Okafor, J. Chavis, B. Murray-Sesay, S. Ploch, P. Moss, L. Hollyfield, D. White, J. Jones, W. Hargis, M. Viator, J. Orebe, G. Johnson, K. Kahler, K. Venson, M. Mossakowski, R. Hanna, J. Maikranz, C. Garrett, D. Sparks, J. Berry, C. Washington, M. Sims, H. Mercer, S. Johnson, M. Stout, J. Wilson, J. McGriff, P. Begelton, R. Robertson, S. Total Opponents
GP 12 12 12 12 10 12 11 12 8 12 12 10 10 12 10 11 8 11 12 12 12 11 6 9 12 3 11 12 9 8 9 9 10 9 8 6 7 6 2 12 5 5 12 12 12 12
|----------Tackles----------| Solo Ast Total 63 44 107 55 24 79 41 27 68 33 12 45 30 13 43 31 12 43 31 12 43 21 16 37 20 12 32 18 14 32 20 6 26 17 9 26 15 10 25 14 9 23 12 7 19 12 6 18 9 8 17 12 3 15 12 2 14 9 4 13 6 2 8 4 4 8 7 . 7 1 4 5 3 1 4 3 1 4 3 . 3 3 . 3 3 . 3 . 2 2 2 . 2 2 . 2 1 . 1 1 . 1 1 . 1 1 . 1 1 . 1 1 . 1 1 . 1 1 . 1 . 1 1 1 . 1 . 1 1 . 1 1 521 267 788 495 262 757
TFL/Yds 6.5-17 3.5-8 6.0-18 1.0-1 9.0-37 3.5-7 3.0-6 8.5-21 1.0-6 3.0-16 0.5-2 . 7.0-38 3.0-15 4.0-15 4.5-11 2.5-6 1.0-4 . 1.0-1 2.5-6 2.0-3 1.0-2 1.0-4 . . . . . . . . . . . . . . . . . . . . 75-244 97.0-373
SCORE BY QUARTERS Lamar University Opponents ALL PURPOSE Johnson, K. Garrett, D. Franks, V. Ford, B. Sims, H. Total Opponents
G Rush 11 15 10 585 12 -7 12 0 7 388 12 1511 12 1926
TOTAL OFFENSE G Mossakowski, R. 8 Berry, C. 8 Garrett, D. 10 Sims, H. 7 Harris, D. 10 Total 12 Opponents 12
|-Sacks-| No-Yards 2.0-11 . 2.0-13 . 4.0-22 . . 2.0-6 . 1.0-12 . . 3.5-32 1.0-12 1.0-8 1.0-5 0.5-2 . . . 1.0-2 1.0-3 1.0-2 . . . . . . . . . . . . . . . . . . . . . 21-130 33-240
1st 51 64 Rec 309 45 165 470 70 1857 2397 Plays 233 199 138 96 68 791 837
|----------Pass Def----------| Int-Yds BrUp QBH . 2 5 . 3 . 1-0 3 . 4-68 6 . . 2 2 1-0 10 . 2-118 6 2 1-0 1 5 . . . 1-26 4 . 2-21 2 . 1-0 . . . 1 7 . . . . 2 2 . 1 2 . . 1 . 4 . . . . . . 1 . . . . 1 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13-233 48 29 13-110 32 22
2nd 58 120 PR 0 0 14 0 0 111 381 Rush 23 38 585 388 310 1511 1926
3rd 69 88 KOR 623 0 410 0 0 1184 541
4th 63 83 IR 0 0 0 0 0 233 110
Pass 1194 663 0 0 0 1857 2397
|-----Fumbles-----| Rcv-Yds FF . 3 2-0 1 1-62 . . . . . . . . 2 . . . . . . . . . . . 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3-62 7 17-45 20
Tot 947 630 582 470 458 4896 5355 Total 1217 701 585 388 310 3368 4323 Blkd Kick . . . . . . . . . . . . . . . 1 . . . . 1 . . . . . . . . . . . . . . . . . . . . . . . 2 2
Total 241 355 Avg/G 86.1 63.0 48.5 39.2 65.4 408.0 446.2 Avg/G 152.1 87.6 58.5 55.4 31.0 280.7 360.2 Saf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
79
La mar Foo tba l l 2012 Lamar Superlatives Rushes Yards Rushing TD Rushes Long Rush Pass attempts
25 112 1 35 36
Pass completions Yards Passing TD Passes
23 239 3
Long Pass Receptions Yards Receiving TD Receptions
60 9 208 3
Long Reception Field Goals Long Field Goal Punts Punting Avg Long Punt Punts inside 20 Long Punt Return Long Kickoff Return Tackles Sacks Tackles For Loss Interceptions
60 2 41 9 47.2 63 3 20 89 17 2.0 3.0 2
Rushes Yards Rushing Yards Per Rush TD Rushes
54 275 6.9 2
Pass attempts Pass completions Yards Passing Yards Per Pass TD Passes
41 23 248 7.5 3
Total Plays Total Offense Yards Per Play Points Sacks By
80 432 6.6 52 5
First Downs Penalties Penalty Yards Turnovers
27 11 94 4
Interceptions By Punts Punting Avg Long Punt Punts inside 20
4 10 47.2 63 3
Long Punt Return
20
80
INDIVIDUAL GAME HIGHS
Garrett, DePauldrick at Central Arkansas (10/20) Garrett, DePauldrick at McNeese State (11/17) 8 times by 5 different players Garrett, DePaul vs McMurry University (10/13) Mossakowski, Ryan vs Langston (9/22) Berry, Caleb at Northwestern State (10/6) Mossakowski, Ryan vs Langston (9/22) Mossakowski, Ryan vs Langston (9/22) Mossakowski, Ryan vs Langston (9/22); Berry, Caleb vs McMurry University (10/13); Mossakowski, Ryan at Stephen F. Austin (11/3) Mossakowski, Ryan vs Nicholls (11/10) Mossakowski, Ryan at Stephen F. Austin (11/3) Ford, Barry vs Nicholls (11/10) Edwards, Jordan at Stephen F. Austin (11/3) Johnson, Kevin vs Langston (9/22); Johnson, Kevin vs McMurry University (10/13); Edwards, Jordan at Stephen F. Austin (11/3) Edwards, Jordan at Stephen F. Austin (11/3) Stout, Justin at Stephen F. Austin (11/3) Stout, Justin vs McMurry University (10/13) Kahler, Kollin at Hawai`i (9/15) Kahler, Kollin vs Southeastern La. (9/29) Kahler, Kollin vs Sam Houston State (10/27) Kahler, Kollin Three Times Venson, Mike vs Langston (9/22) Johnson, Kevin vs Sam Houston State (10/27) Allen, Chad at Stephen F. Austin (11/3) Dickson, Jesse vs Langston (9/22); Malbrough, Marcus vs Nicholls (11/10) Murrill, Mark vs Langston (9/22); Malbrough, Marcus vs Nicholls (11/10) Thomas, Branden vs McMurry University (10/13)
TEAM GAME HIGHS
at Central Arkansas (10/20) vs McMurry University (10/13) vs McMurry University (10/13) vs Prairie View A&M (9/8); vs McMurry University (10/13) at Central Arkansas (10/20) at Stephen F. Austin (11/3) vs Langston (9/22) at Stephen F. Austin (11/3) vs Prairie View A&M (9/8) vs Langston (9/22); vs McMurry University (10/13) at Stephen F. Austin (11/3); vs Nicholls (11/10) at Stephen F. Austin (11/3) vs Prairie View A&M (9/8) vs McMurry University (10/13) vs McMurry University (10/13) vs McMurry University (10/13) vs Nicholls (11/10) vs Prairie View A&M (9/8) at Stephen F. Austin (11/3) at Stephen F. Austin (11/3) at Louisiana (9/1); vs Southeastern La. (9/29) at Northwestern State (10/6); at Stephen F. Austin (11/3) at Stephen F. Austin (11/3) at Hawai`i (9/15) vs Southeastern La. (9/29) vs Sam Houston State (10/27) at Hawai`i (9/15); at Central Arkansas (10/20) at Stephen F. Austin (11/3) vs Langston (9/22)
L a m a r Fo otbal l 2012 Opponent Superlatives Rushes Yards Rushing TD Rushes Long Rush Pass attempts Pass completions
23 131 4 93 48 26
Yards Passing TD Passes Long Pass Receptions Yards Receiving TD Receptions Long Reception Field Goals Long Field Goal Punts Punting Avg Long Punt Punts inside 20 Long Punt Return Long Kickoff Return Tackles
271 3 86 11 127 1 86 4 52 11 47.6 56 3 75 95 11
Sacks
2.0
Tackles For Loss Interceptions
4.0 1
Rushes Yards Rushing Yards Per Rush TD Rushes Pass attempts Pass completions Yards Passing Yards Per Pass TD Passes
51 378 8.2 6 70 38 390 9.9 3
Total Plays Total Offense Yards Per Play Points Sacks By First Downs Penalties Penalty Yards Turnovers Interceptions By Punts Punting Avg Long Punt Punts inside 20 Long Punt Return
109 537 8.3 56 6 34 11 101 4 4 11 47.6 56 3 75
INDIVIDUAL GAME HIGHS
Walker,Robert, at Northwestern State (10/6) Flanders, Tim, vs Sam Houston State (10/27) Flanders, Tim, vs Sam Houston State (10/27) Bennett, Kelvin, at McNeese State (11/17) Attaway, Brady, at Stephen F. Austin (11/3) Attaway, Brady, at Stephen F. Austin (11/3) Klann, Landry, vs Nicholls (11/10) Smothers, Wynri, at Central Arkansas (10/20) Schroeder, Sean, at Hawai`i (9/15) Gautier, Blaine, at Louisiana (9/1) Ward, DJ, at Stephen F. Austin (11/3) Grandy,Jesse, at Central Arkansas (10/20) 17 times Robinson, Jamal, at Louisiana (9/1) Baer, Brett, at Louisiana (9/1); Wiggs, Jordan, at Stephen F. Austin (11/3) Baer, Brett, at Louisiana (9/1) DeHarde, David, vs Langston (9/22) Breaux, Jean, at McNeese State (11/17) Mothe, Beau, vs Southeastern La. (9/29) Breaux, Jean, at McNeese State (11/17) Alford, Robert, vs Southeastern La. (9/29) Edwards, Mike, at Hawai`i (9/15) Love,Jestin, at Central Arkansas (10/20) Epperson, Ryan, at Stephen F. Austin (11/3) Johnson,Keland, at Northwestern State (10/6) Robinson, Darre, at Stephen F. Austin (11/3) Narcisse, Joe, at McNeese State (11/17) Hamilton, Justi, at Louisiana (9/1) 13 times
TEAM GAME HIGHS
vs Southeastern La. (9/29) vs Sam Houston State (10/27) vs Sam Houston State (10/27) vs Sam Houston State (10/27) at Stephen F. Austin (11/3) at Stephen F. Austin (11/3) at Stephen F. Austin (11/3) at Central Arkansas (10/20) at Hawai`i (9/15) at Stephen F. Austin (11/3) at Stephen F. Austin (11/3) at Stephen F. Austin (11/3) vs Sam Houston State (10/27) vs Sam Houston State (10/27) at McNeese State (11/17) at Stephen F. Austin (11/3) vs Prairie View A&M (9/8) at Northwestern State (10/6) at Stephen F. Austin (11/3) vs Southeastern La. (9/29) vs Langston (9/22) at McNeese State (11/17) vs Southeastern La. (9/29) at McNeese State (11/17) vs Southeastern La. (9/29)
81
La mar Foo tba l l Game 1 - 9/1/12
Lamar Louisiana-Lafayette Score by Quarters Lamar Louisiana-Lafayette
1 0 13
2 0 27
3 0 0
4 0 0
Scoring Summary 1st 13:04 UL - Baer 52 yd FG 09:29 UL - Maxwell 2 yd pass from Gautier (Baer kick) 06:05 UL - Baer 40 yd FG 2nd 14:56 UL - Harris 1 yd run (Baer kick) 11:24 UL - Reed 2 yd run (Baer kick) 09:38 UL - Baer 39 yd FG 04:43 UL - Baer 32 yd FG 00:12 UL - Lawson 2 yd pass from Gautier (Baer 13 37-38 156 18-29-1 194 6-3 4-34 6-43.5 0-0 3-56 0-0 34:22 6 of 16 0 of 2 0-0
0 40
Game 2 - 9/8/12 Prairie View A&M Lamar
F 0 40
Score by Quarters Prairie View A&M Lamar
3-0 10-0 13-0 20-0 27-0 30-0 33-0 40-0
UL 15 34-143 203 13-27-0 346 1-1 7-50 3-41.7 4-47 1-41 1-16 25:38 7 of 14 0 of 0 3-20
Individual Stats Rushing LU - Sims 14-42; Garrett 7-35 UL - Reed 7-55 1 TD; Harris 16-46 1 TD Passing LU - Mossakowski 12-19-0 81 yards; Berry 6-10-1 75 yards UL - Gautier 7-18-0 142 yards 2 TDs; Broadway 6-9-0 61 yards Receiving LU - Ford 5-48; Franks 4-23; Edwards 2-27 UL - Lawson 3-33 1 TD; Maxwell 3-23 1 TD; Robinson 1-86 LAFAYETTE, La. -- Playing against a Football Bowl Subdivision (FBS) team for the first time since reinstating football in 2010, Lamar University couldn’t overcome four first half turnovers in falling 40-0 to former conference rival Louisiana-Lafayette in the season opener. The Ragin’ Cajuns converted Lamar’s turnovers directly into 16 points as they scored all 40 points in the first half. Lamar took better care of the ball in the second half but could not mount an offensive attack to cut into the UL lead. UL scored on its first possession as Brett Baer connected on a careerlong 52-yard field goal with 13:04 to play in the first quarter. The Cardinals held the Cajuns on three straight plays from the Lamar 32-yard line to force the field goal attempt. On Lamar’s first drive, junior transfer quarterback Ryan Mossakowski was hit by Justin Hamilton at the Cards’ 25-yard line for the first turnover of the game. UL recovered at Lamar’s 29-yard line to begin its second drive. Senior quarterback Blaine Gautier hit tight end Jacob Maxwell for a 2yard scoring strike to cap the 29-yard drive and put the Cajuns ahead 10-0. Gautier, who passed for 2,958 yards and 23 touchdowns in 2011, finished the game with 142 passing yards and two touchdowns. Baer would finish with four first half field goals, and in addition to a pair of scoring strikes from Gautier, Alonzo Harris and Effrem Reed each scored from a yard out. Mossakowski finished his first game for Lamar by completing 12-of-19 passes for 81 yards. Backup Caleb Berry was 6-of-10 for 75 yards and the one interception. Lamar’s Herschel Sims would finish with 42 net yards on 14 carries, while DePauldrick Garrett rushed for 35 yards on seven carries in his first game back after missing a season with a shoulder surgery. The Cardinals finished with 194 yards of total offense as compared to 346 for the Ragin’ Cajuns.
82
1 0 14
2 0 7
0 31 3 0 3
4 0 7
F 0 31
Scoring Summary 1st 07:22 LU - Johnson 11 yd pass from Mossakowski (Stout kick) 7-0 01:08 LU - Johnson 8 yd pass from Mossakowski (Stout kick) 14-0 2nd 12:37 LU - Johnson 12 yd run (Stout kick) 21-0 3rd 07:48 LU - Stout 29 yd FG 24-0 4th 05:29 LU - Sims 4 yd run (Stout kick) 31-0 Team Statistics First Downs Rushes-Yards (Net) Passing Yards (Net) Passing C-A-I Total Offense Fumbles-Lost Penalties-Yards Punts-Avg. Punt Returns-Yards Kickoff Returns-Yards Interceptions-Return Yards Possession Time 3rd Down Conversions 4th Down Conversions Sacks By: Number-Yards
PV 12 28-84 165 19-28-1 249 0-0 11-75 5-33.2 1-7 4-75 0-0 23:14 3 of 11 0 of 3 0-0
LU 27 42-208 224 21-30-0 432 2-0 9-90 4-37.5 0-0 0-0 1-15 36:46 7 of 13 0 of 0 4-10
Individual Stats Rushing PV - Smiley 7-30; Anderson 8-27; Brown 9-23 LU - Sims 13-83 1 TD; Garrett 16-79 Passing PV - Smiley 19-27-0 165 yards LU - Mossakowski 21-30-0 224 yards 2 TDs Receiving PV - Nelson 5-59; Cooper 4-43 LU - Franks 4-59; Ford 4-39; Soto 3-40; Johnson 3-39 2 TDs BEAUMONT -- Sophomore wide receiver Kevin Johnson scored three touchdowns, and Lamar’s defense shut down a potent Panthers’ offense, as the Cardinals won their 2012 home 31-0 over Prairie View A&M. Johnson scored on scoring passes of 11 and eight yards from Ryan Mossakowski and added a 12-yard rushing touchdown in the first half as Lamar built a 21-0 lead at intermission. Justin Stout kicked a 29-yard field goal in the third quarter, and sophomore running back Herschel Sims closed the scoring with a 4-yard TD run with less that six minutes to play in the game. Lamar quarterback Ryan Mossakowski finished 21-of-30 for 224 yards and the two touchdown passes. The Cardinals also picked up 208 rushing yards to finish with 432 total yards. As impressive as the LU offense was the Cardinals defense which registered four sacks, held the Panthers to 249 total yards and did not allow PV inside the red zone even once. The Panthers managed just 84 rushing yards with an average of 3.0 per carry and were just 3-of-11 on third down attempts and 0-of-3 on fourth down tries. Junior defensive back Chad Allen registered a career-high 11 tackles to lead all players. Branden Thomas added five stops and an interception, while Jestin White, Jesse Dickson, Blake Burman and David Hollyfield all recorded sacks. Sims led the Cardinals with 83 rushing yards on 13 carries for an average of 6.4 yards per carry. DePauldrick Garrett added 79 yards on 16 carries. PV quarterback Deauntre Smiley finished with 165 passing yards and led the Panthers with 30 rushing yards on seven attempts.
L a m a r Fo otbal l Lamar Hawai`i
Game 3 - 9/15/12
Score by Quarters Lamar Hawai`i
1 0 7
2 0 21
3 0 13
4 2 13
Scoring Summary 1st 09:25 UH - Davis 16 yd pass from Schroeder (Hadden kick) 2nd 08:10 UH - Lister 7 yd run (Hadden kick) 03:51 UH - Bright 8 yd pass from Schroeder (Hadden kick) 02:07 UH - Phillips 21 yd blocked punt return (Hadden kick) 3rd 14:43 UH - Edwards 95 yd kickoff return (Hadden kick) 09:07 UH - Hadden 32 yd FG 08:10 UH - Hadden 31 yd FG 4th 14:10 UH - Gant 9 yd pass from Schroeder (Hadden kick) 08:19 UH - Lister 3 yd run (kick failed) 08:19 LU - Guillory PAT return Team Statistics First Downs Rushes-Yards (Net) Passing Yards (Net) Passing C-A-I Total Offense Fumbles-Lost Penalties-Yards Punts-Avg. Punt Returns-Yards Kickoff Returns-Yards Interceptions-Return Yards Possession Time 3rd Down Conversions 4th Down Conversions Sacks By: Number-Yards
LU 6 28-44 83 11-20-0 127 5-3 8-81 10-37.3 1-0 7-84 0-0 25:56 1 of 12 0 of 1 0-0
2 54
Langston Lamar
F 2 54
Score by Quarters Langston Lamar
0-7 0-14 0-21 0-28 0-35 0-38 0-41 0-48 0-54 2-54
UH 20 48-219 150 15-23-0 369 1-0 5-30 3-26.3 5-45 1-95 0-0 34:04 3 of 11 0 of 1 3-18
Individual Stats Rushing LU - Harris 4-37; Sims 12-8 UH - Gregory 6-62; Lister 10-55 2 TDs; Iosefa 15-55 Passing LU - Mossakowski 11-20-0 83 yards UH - Schroeder 15-23-0 150 yards 3 TDs Receiving LU - Soto 2-22; Sims 2-18; Begelton 2-14; Edwards 2-13 UH - Davis 3-85 1 TD; Iosefa 3-11; Ostrowski 2-15 HONOLULU, Hawai`i -- Three turnovers and several miscues on special teams hurt the Cardinals in Lamar’s 54-2 loss at Hawai`i, its second lost to a Football Bowl Subdivision (FBS) member. Midway through the second quarter, it was just a 7-0 game as the Warriors took advantage of the Cardinals' first turnover. After stopping UH on third down, LU return man Mike Venson couldn't handle the punt and set the Warriors up from the Lamar 16-yard line. On first down, Sean Schroeder found Trevor Davis for a 16-yard scoring strike. UH would grab a 14-0 lead with 8:10 to play in the first half on an 80yard drive that culminated in a 7-yard touchdown run by John Lister. The big play was a 50-yard completion from Schroeder to Davis that put the Warriors inside the Lamar 10. UH would score twice more in the second quarter to build its lead to 28-0 at the half. Schroeder, who finished 15-of-23 for 150 yards and three touchdowns, hit Darius Bright for an 8-yard scoring strike with 3:51 to play in the half. Less than two minutes later, UH was on the board again as John Hardy-Tuliau blocked a Kollin Kahlerpunt and Ne'Quan Phillips scooped it up and returned it 21 yards for the final score of the first half. The Cardinals finally got on the board in the fourth quarter after the UH holder couldn't handle the snap on an extra point attempt. Defensive back Adrian Guillory would pick up the fumble and run it back the length of the field for the Cardinals' only points of the game. UH would score 13 points in the third quarter on a Mike Edwards 95yard kickoff return to open the second half and a pair of Tyler Hadden field goals. Hadden was good from 32 yards with 9:07 to play in the quarter and added a 31-yarder less than a minute later following a fumble by Nashon Davis. Schroeder's third touchdown toss opened the fourth quarter as the Duke transfer found Chris Gant from nine yards out. Lister, who carried 10 times for 55 yards, would add his second rushing touchdown of the game on a 3-yard carry with 8:19 to play.
Game 4 - 9/22/12
1 0 14
2 0 3
0 31 3 0 7
4 0 7
Scoring Summary 1st 14:24 LU - Sims 4 yd run (Stout kick) 05:06 LU - Johnson 34 yd pass from Mossakowski (Stout kick) 2nd 00:02 LU - Stout 37 yd FG 3rd 10:07 LU - Johnson 14 yd pass from Mossakowski (Stout kick) 4th 11:00 LU - Johnson 33 yd pass from Mossakowski (Stout kick) Team Statistics First Downs Rushes-Yards (Net) Passing Yards (Net) Passing C-A-I Total Offense Fumbles-Lost Penalties-Yards Punts-Avg. Punt Returns-Yards Kickoff Returns-Yards Interceptions-Return Yards Possession Time 3rd Down Conversions 4th Down Conversions Sacks By: Number-Yards
LANG 9 30-71 92 13-28-0 163 1-1 5-30 11-40.2 4-5 4-56 1-0 33:21 5 of 18 0 of 0 0-0
F 0 31 7-0 14-0 17-0 24-0 31-0
LU 14 21-88 239 23-36-1 327 2-0 8-82 7-43.9 5-60 1-72 0-0 26:39 6 of 13 0 of 0 4-20
Individual Stats Rushing LANG - Taylor 17-55; Crawford 8-16 LU - Sims 10-47 1 TD; Richards 3-28; Mossakowski 2-16 Passing LANG - Crawford 11-21-0 79 yards; Miles 2-7-0 13 yards LU - Mossakowski 23-36-1 239 yards 3 TDs Receiving LANG - King 6-48; Dean 2-15; Gaines 1-18 LU - Franks 6-73; Ford 5-49; Johnson 4-84 3 TDs BEAUMONT - For the second time in two home games, Lamar University wide receiver Kevin Johnson struck for three touchdowns as the Cardinals posted an impressive 31-0 shutout of Langston.yard return on the opening kickoff. The second Cardinal scoring drive was even quicker than the first as quarterback Ryan Mossakowski hit Johnson for a 34-yard touchdown to end the 1play drive in five seconds. The play, which came at the 5:06 mark of the first quarter, was set up by a 5-yard punt by Langston's David DeHarde. Lamar's defense was strong all night, limiting the Lions to just 163 total yards. The Cards got a blocked field goal from Joe Okafor in the second quarter, recovered a fumble, recorded 11 tackles for loss and picked up four sacks in the game. Junior defensive end Jesse Dickson finished with two of the sacks with Mark Murrill and James Washington registering one each. The Cardinals got a 37-yard field goal out of Justin Stout with two seconds to play in the first half to give Lamar a 17-0 lead at the break. John as Mossakowski found Johnson across the middle and the redshirt sophomore scampered 33 yards to score the final points and cap the 71-yard drive. Johnson would catch four Mossakowski passes on the evening for 84 yards. VanLawrance Franks finished with six grabs for 73 yards, while Barry Ford had five catches for 84 yards. Mossakowski threw his first interception of the year, but still finished 23of-36 for 239 yards and three touchdowns. Lamar would add 115 net rushing yards to finish with 327 total yards. Langston quarterback Brendan Crawford was 11-of-21 for 79 yards before being knocked out of the game in the fourth quarter. William Taylor led the Lions' ground game with 17 carries for 55 yards.
83
La mar Foo tba l l Game 5 - 9/29/12 Southeastern Louisiana Lamar Score by Quarters Southeastern Louisiana Lamar
1 7 0
2 7 7
3 10 7
4 7 7
31 21
Lamar Northwestern State
F 31 21
Score by Quarters Lamar Northwestern State
Scoring Summary 1st 08:54 SLU - Chaney 2 yd run (Sebastian kick) 0-7 2nd 13:44 SLU - Chaney 4 yd run (Sebastian kick) 0-14 10:01 LU - McVey 8 yd pass from Mossakowski (Stout kick) 7-14 3rd 10:28 SLU - Sebastian 26 yd FG 7-17 07:40 LU - McVey 10 yd pass from Mossakowski (Stout kick)14-17 05:27 SLU - Alford 75 yd punt return (Sebastian kick) 14-24 4th 14:55 SLU - LeBlanc 3 yd pass from Stanley (Sebastian kick) 14-31 06:58 LU - McGlothen 96 yd interception return (Stout kick) 21-31 Team Statistics First Downs Rushes-Yards (Net) Passing Yards (Net) Passing C-A-I Total Offense Fumbles-Lost Penalties-Yards Punts-Avg. Punt Returns-Yards Kickoff Returns-Yards Interceptions-Return Yards Possession Time 3rd Down Conversions 4th Down Conversions Sacks By: Number-Yards
SLU 22 51-165 203 16-29-2 368 1-0 9-74 4-45.5 4-105 4-96 4-19 32:28 6 of 17 2 of 5 3-25
LU 15 25-76 168 20-35-4 244 0-0 3-40 6-47.2 2-17 6-133 2-92 27:32 5 of 13 0 of 1 0-0
Individual Stats Rushing SLU - Roberson 15-75; Chaney 18-48 2 TDs; Young 5-18 LU - Sims 10-36; Mossakowski 9-24; Richards 5-13 Passing SLU - Stanley 15-28-2 187 yards 1 TD; Young 1-1-0 16 yards LU - Mossakowski 20-35-4 168 yards 2 TDs Receiving SLU - Smiley 5-33; LeBlanc 3-23 1 TD; McCrea 2-55 LU - Ford 3-29; Johnson 2-41; McVey 2-18 2 TDs BEAUMONT - Southeastern Louisiana used a balanced offensive attack, and took advantage of four Ryan Mossakowski interceptions, to hand Lamar University a 31-21 defeat in the Cardinals' Southland Conference football opener. The Lions finished with a season-high 165 rushing yards and passed for another 203. Lamar's offense would manage just 244 total yards in losing for the first time this season at Provost Umphrey Stadium. After trailing 17-7 early in the third quarter, Lamaryard line. Alford broke to his left and raced up the sideline for a 75-yard score to give the Lions a 24-14 lead with 5:27 to play in the third. first quarter for the first points Lamar's defense had allowed at home this season.. Lamar used an 8-play, 61-yard drive to cut the SLU lead in half. Mossakowski, who finished 20-of-35 for 168 yards, found McVey for his first score of the game from eight yards out to make it 14-7.
84
Game 6 - 10/6/12
1 0 10
2 7 7
3 10 3
23 30 4 6 10
F 23 30
Scoring Summary 1st 09:00 NSU - Shaughnessy 41 yd FG 0-3 04:01 NSU - Harvey 26 yd run (Shaughnessy kick) 0-10 2nd 04:45 LU - Washington 62 yd fumble return (Stout kick) 7-10 02:19 NSU - Nims 4 yd pass from Henderson (Shaughnessy kick) 7-17 3rd 07:34 LU - Johnson 27 yd pass from Berry (Stout kick) 14-17 04:45 NSU - Shaughnessy 42 yd FG 14-20 02:20 LU - Stout 28 yd FG 17-20 4th 06:46 NSU - Walker 3 yd run (Shaughnessy kick) 17-27 03:00 NSU - Shaughnessy 20 yd FG 17-30 00:36 LU - Edwards 8 yd pass from Berry (kick failed) 23-30 Team Statistics First Downs Rushes-Yards (Net) Passing Yards (Net) Passing C-A-I Total Offense Fumbles-Lost Penalties-Yards Punts-Avg. Punt Returns-Yards Kickoff Returns-Yards Interceptions-Return Yards Possession Time 3rd Down Conversions 4th Down Conversions Sacks By: Number-Yards
LU 18 39-105 180 18-36-1 285 3-3 9-77 6-36.7 1 (-3) 7-60 1-0 34:05 6 of 19 4 of 4 1-5
NSU 16 46-206 104 11-24-1 310 3-1 9-101 4-35.8 2-71 5-46 1-3 25:28 2 of 13 0 of 1 5-38
Individual Stats Rushing LU - Sims 19-73; Garrett 5-10; Berry 12-10 NSU - Walker 23-103 1 TD; Harvey 7-84 1TD Passing LU - Berry 18-36-1 180 yards 2 TDs NSU - Henderson 11-24-1 104 yards 1 TD Receiving LU - Ford 7-79; Edwards 3-43 1 TD; Johnson 2-34 1 TD NSU - Brown 3-47; Harvey 3-16 NATCHITOCHES, La. - Lamar University had several opportunities to come away with a road win, but four turnovers would cost the Cardinals in a 30-23 Southland Conference loss at Northwestern State. After trailing 17-7 at the half, the Cardinals twice pulled within three points in the third quarter. Lamar opened the second half with a 14-play, 80-yard drive to make it a 17-14 game with quarterback Caleb Berry hitting Kevin Johnson for a 27-yard scoring strike. NSU answered with a 42-yard field goal from John Shaughnessy to regain a six point lead. However, the Demons' momentum was short lived as Johnson would return the ensuing kickoff 60 yards to the NSU 40. A personal foul call on the Demons added 15 more yards and Lamar was in business from the NSU 25-yard line. After getting a pass interference call to set up first-and-goal from the 8-yard line, Lamar failed to gain a yard on the first two plays. Berry, who was making his first career start for the Cardinals, was sacked on third down back to the 11-yard line. Justin Stout would come on to boot a 28-yard field goal and Lamar was once again within three points at 20-17 with 2:20 to play in the third quarter. Lamar took over trailing 20-17 at its own 17-yard line midway through the fourth quarter. NSU defensive tackle Lesley Deamer sacked Berry for a loss of 15 yards and forced a fumble that he recovered to give the Demons the ball at the Lamar 5-yard line. Running back Robert Walker, who ran for 103 yards on 23 carries, would take it over from the 3-yard line on second down to give the Demons a 27-17 lead with 6:46 to play in the game. The Demons would increase their lead to 30-17 on a 20-yard field goal with three minutes to play in the game. Berry would lead one final scoring drive to pull the Cardinals to within seven, but the Demons would recover Lamar's onside kick attempt with 36 seconds to play to seal the victory. Lamar's final scoring drive covered 78 yards on 10 plays, but took just two minutes and 20 seconds as Berry found Jordan Edwards for an 8-yard touchdown. The duo would connect for three catches covering 43 yards on the drive. With the Demons leading 10-0 in the second quarter, LU defensive back Tyrus McGlothen would deliver a hit on NSU's Daniel Taylor which resulted in a fumble. LU linebacker James Washington scooped up the loose ball and returned it 62 yards for the Cards' first points. NSU answered right back, however, as quarterback Brad Henderson found tight end Tucker Nims for a 4-yard score to cap an 8-play, 68 yard drive and close the first half scoring. Berry would finish his first career start by hitting on 18 of his 36 pass attempts for 180 yards, two touchdowns and an interception. LU linebacker Jermaine Longino led all players with his second straight 13-tackle game. In addition to his fumble return for a touchdown, Washington matched Chad Allen with nine tackles for Lamar.
L a m a r Fo otbal l McMurry Lamar
Game 7 - 10/13/12
Score by Quarters McMurry Lamar
1 3 10
2 0 21
3 3 14
4 15 7
Scoring Summary 1st 11:30 McM - King 40 yd FG 11:16 LU - Johnson 88 yd kickoff return (Stout kick) 02:36 LU - Stout 41 yd FG 2nd 12:40 LU - Johnson 13 yd pass from Berry (Stout kick) 04:07 LU - Johnson 13 yd pass from Berry (Stout kick) 00:04 LU - Johnson 9 yd pass from Berry (Stout kick) 3rd 09:19 McM - King 35 yd FG 07:02 LU - Garrett 35 yd run (Stout kick) 01:02 LU - Harris 8 yd run (Stout kick) 4th 07:26 LU - Thomas 53 yd interception return (Stout kick) 03:19 McM - Simpson 8 yd run (Foust kick) 00:29 McM - Cain 18 yd pass from Lambert (Lambert run) Team Statistics First Downs Rushes-Yards (Net) Passing Yards (Net) Passing C-A-I Total Offense Fumbles-Lost Penalties-Yards Punts-Avg. Punt Returns-Yards Kickoff Returns-Yards Interceptions-Return Yards Possession Time 3rd Down Conversions 4th Down Conversions Sacks By: Number-Yards
McM 22 30-52 317 35-62-2 369 1-0 5-34 4-46.0 1-7 5-53 1-0 35:51 8 of 23 3 of 7 1-12
Game 8 - 10/20/12
21 52
Lamar No. 17 Central Arkansas
F 21 52
Score by Quarters Lamar Central Arkansas
0-3 7-3 10-3 17-3 24-3 31-3 31-6 38-6 45-6 52-6 52-13 52-21
LU 21 40-275 105 8-18-1 380 4-2 8-67 3-41.0 3-23 4-152 2-78 24:09 3 of 8 1 of 1 5-30
Individual Stats Rushing McM - Grayer 13-39; Simpson 6-34 1 TD; Cole 3-10 LU - Garrett 10-104 1 TD; Sims 18-99; Harris 4-48 1 TD; Richards 4-34 Passing McM - Mullin 21-41-1 187 yards; Lambert 14-21-1 130 yards 1 TD LU - Berry 8-18-1 105 yards 3 TDs Receiving McM - Livingston 8-97; Grayer 8-68; Chatman 4-37; Cain 3-36 1 TD LU - Johnson 5-77 3 TDs; Sims 1-14; McVey 1-8; Edwards 1-6 BEAUMONT - Sophomore wide receiver Kevin Johnson scored four touchdowns to tie a school record and lead Lamar University to a 52-21 victory over McMurry University. John increased its lead to 10-3 after one quarter as junior Justin Stout connected on a 41-yard field goal with 2:36 on the clock. Stout's longest field goal since his freshman season capped a 12-play, 44-yard drive. Junior defensive back Brandon Thomas put the Cardinals in business early in the second quarter as he intercepted a Jake Mullin pass and returned it to the War Hawks' 13-yard line. After missing Johnson on first down, LU quarterback Caleb Berry went right back to him on second for a 13-yard score.. Berry, who was getting his second career start, finished 8-of-18 for 105 yards and one interception. Johnson caught five of his passes for 77 yards, while three other players had one catch each. Running back Herschel Sims finished with 18 carries for 99 yards before going out with an injury during the first drive of the third quarter. DePauldrick Garrett proved to be an able backup as he came on to carry for 104 yards on just 10 carries. Included in his total was a 35-yard touchdowns with 7:02 to play in the third quarter that gave the Cardinals a 38-6 lead. Lamar would increase its lead to 45-6 on an 8-yard touchdown run by freshman Darrell Harris with 1:02 to play in the third quarter..
1 0 0
2 0 17
3 7 0
14 24 4 7 7
F 14 24
Scoring Summary 2nd 14:47 UCA - Walker 1 yd run (Camara kick) 0-7 02:14 UCA - Camara 33 yd FG 0-10 00:38 UCA - Croom 19 yd pass from Smothers (Camara kick) 0-17 3rd 01:51 LU - Berry 7 yd run (Stout kick) 7-17 4th 10:00 UCA - Grandy 75 yd pass from Smothers (Camara kick) 7-24 01:18 LU - Garrett 4 yd run (Stout kick) 14-24 Team Statistics First Downs Rushes-Yards (Net) Passing Yards (Net) Passing C-A-I Total Offense Fumbles-Lost Penalties-Yards Punts-Avg. Punt Returns-Yards Kickoff Returns-Yards Interceptions-Return Yards Possession Time 3rd Down Conversions 4th Down Conversions Sacks By: Number-Yards
LU 19 54-186 96 11-19-0 282 2-0 7-50 6-38.3 1-(-1) 3-60 0 37:28 8 of 17 3 of 3 0-0
UCA 14 25-61 276 21-28-0 337 0-0 5-30 4-47.5 2-26 0-0 0 22:32 6 of 13 1 of 1 2-18
Individual Stats Rushing LU - Garrett 25-91 1 TD; Harris 18-78 UCA - Hinton 8-36; Smothers 3-8; Walker 2-4 1 TD Passing LU - Berry 11-19-0 96 yards UCA - Smothers 20-27-0 271 yards 2 TDs Receiving LU - Begelton 5-50; Harris 3-14; Ford 2-18 UCA - Croom 5-47 1 TD; Grandy 4-127 1 TD; Lewis 3-45 CONWAY, Ark. - Lamar University got its running game going in the second half, but the Cardinals could not dig out of a first half hole in falling 24-14 to No. 17 Central Arkansas. With DePauldrick Garrett and Darrell Harris carrying the load, Lamar outscored the Bears by seven in the second half after trailing 17-0 at intermission. The Cardinals put together a pair of impressive second half drives after managing just 79 yards of total offense in the first half. Quarterback Caleb Berry, who was 11-of19 through the air for 96 yards, capped Lamar's first scoring drive with a 7-yard touchdown run with 1:51 to play in the third quarter. After forcing a UCA punt, Lamar seemed to seize the momentum heading into the fourth quarter. However, the Cardinals' drive stalled and Kollin Kahler was forced to punt, hitting a 45-yarder that went out of bounds at the UCA 24-yard line. Terence Bobo managed just a 1-yard run on first down, but UCA quarterback Wynrick Smothers hooked up with Jesse Grandy for a 75-yard touchdown that pushed the Bears lead back to 24-7 with 10:00 to play in the game. Lamar responded with another sustained scoring drive to make it 24-14 as Garrett put the finishing touches on it with a 4-yard scamper into the end zone. Garrett finished with 91 yards on 25 carries against the Bears. The Cards' second scoring drive covered 67 yards and took 16 plays and just over eight and a half minutes. Kahler kept the drive alive early as he ran for 23 yards and a first down on a 4th-and-7 fake punt play. The two teams played to a 0-0 tie through the first quarter, but UCA got on the board just three seconds into the second quarter as backup quarterback Jacoby Walker took it in from a yard out. Lamar's defense, which got a game-high 11 tackles from linebacker Jermaine Longino, allowed the Bears a 33-yard field goal with 2:14 to play in the half as it looked like the Cardinals would trail just 10-0 at the break. However, a three and out forced a Lamar punt and UCA was able to capitalize to close the half. Smothers, who finished 20-of-27 for 271 yards passing, hit Dominique Croom in the back of the end zone for a 19-yard score with just 38 seconds showing on the clock. Lamar would outgain UCA 203-110 in the second half as the Cardinals finished with 282 yards of total offense in the game, including 186 on the ground. Harris, who had a season-high 18 carries in the game, finished with 78 rushing yards to compliment Garrett’s strong effort. Reggie Begelton caught five balls for 50 yards.
85
La mar Foo tba l l Game 9 - 10/27/12 No. 5 Sam Houston State Lamar Score by Quarters Sam Houston State Lamar
1 7 0
2 14 0
3 21 7
4 14 0
Scoring Summary 1st 02:04 SHSU - Flanders 7 yd run (Antonio kick) 2nd 12:29 SHSU - Flanders 1 yd run (Antonio kick) 01:16 SHSU - Diller 48 yd pass from Bell (Antonio kick) 3rd 13:54 SHSU - Flanders 59 yd run (Antonio kick) 09:56 SHSU - Flanders 10 yd run (Antonio kick) 04:38 SHSU - Hill 6 yd run (Antonio kick) 04:26 LU - Johnson 89 yd kickoff return (Stout kick) 4th 13:06 SHSU - Wilkerson 42 yd pass from Sincere (Antonio kick) 04:41 SHSU - Morgan 3 yd run (Antonio kick) Team Statistics First Downs Rushes-Yards (Net) Passing Yards (Net) Passing C-A-I Total Offense Fumbles-Lost Penalties-Yards Punts-Avg. Punt Returns-Yards Kickoff Returns-Yards Interceptions-Return Yards Possession Time 3rd Down Conversions 4th Down Conversions Sacks By: Number-Yards
SHSU 20 46-378 130 11-15-0 508 0-0 10-79 5-41.4 1-2 1-23 1-0 28:53 4 of 10 1 of 1 4-29
Game 10 - 11/3/12
56 7
Lamar Stephen F. Austin
F 56 7
Score by Quarters Lamar Stephen F. Austin
0-7 0-14 0-21 0-28 0-35 0-42 7-42 7-49 7-56
LU 16 41-85 96 12-26-1 181 4-2 4-50 6-41.0 1-1 6-144 0-0 31:07 4 of 17 2 of 3 0-0
Individual Stats Rushing SHSU - Flanders 16-131 4 TDs; Hill 7-89 1 TD; Bell 4-44 LU - Richards 9-44; Harris 15-36; Garrett 10-21
1 6 7
2 0 20
3 14 10
26 40 4 6 3
Scoring Summary 1st 09:36 SFA - Gentry 13 yd run (Wiggs kick) 05:45 LU - Stout 34 yd FG 02:09 LU - Stout 34 yd FG 2nd 13:08 SFA - Wiggs 33 yd FG 06:50 SFA - Ward 11 yd pass from Attaway (Wiggs kick) 03:51 SFA - Wiggs 29 yd FG 00:24 SFA - Lott 12 yd pass from Attaway (Wiggs kick) 3rd 05:58 LU - Edwards 60 yd pass from Mossakowski (Stout kick) 04:03 SFA - Gambel 8 yd pass from Minden (Wiggs kick) 03:00 LU - Edwards 39 yd pass from Mossakowski (Stout kick) 00:18 SFA - Wiggs 27 yd FG 4th 09:56 SFA - Wiggs 21 yd FG 06:23 LU - Edwards 56 yd pass from Mossakowski (kick failed) Team Statistics First Downs Rushes-Yards (Net) Passing Yards (Net) Passing C-A-I Total Offense Fumbles-Lost Penalties-Yards Punts-Avg. Punt Returns-Yards Kickoff Returns-Yards Interceptions-Return Yards Possession Time 3rd Down Conversions 4th Down Conversions Sacks By: Number-Yards
LU 14 39-98 248 16-41-2 346 4-2 11-94 6-44.7 1-0 9-344 4-22 31:59 3 of 19 3 of 6 1-12
F 26 40 0-7 3-7 6-7 6-10 6-17 6-20 6-27 13-27 13-34 20-34 20-37 20-40 26-40
SFA 34 39-147 390 38-70-4 537 1-0 1-15 5-34.8 0-0 1-18 2-35 28:01 8 of 23 1 of 1 4-28
Passing SHSU - Bell 9-13-0 84 yards 1 TD; Sincere 2-2-0 46 yards 1 TD LU - Berry 12-24-1 96 yards; Mossakowski 0-2-0 0 yards
Individual Stats Rushing LU - Garrett 20-68; Harris 7-31 SFA - Gentry 19-93 1 TD; Barnes 9-52
Receiving SHSU - Diller 6-80 1 TD; Wilkerson 2-40 1 TD LU - Ford 6-32; Gladney 1-17; Garrett 1-14
Passing LU - Mossakowski 11-27-1 231 yards 3 TDs; Berry 5-14-1 17 yards SFA - Attaway 26-48-3 242 yards 2 TDs; Mindey 12-22-1 148 yards 1 TD
BEAUMONT - No. 5 Sam Houston State rode leading rusher Tim Flanders to a 56-7 Southland Conference victory over Lamar University. Flanders ran for 131 yards and scored four touchdowns to match the Provost Umphrey Stadium records for points and touchdowns., a 1-yard run, would come less than five minutes later as the Bearkats took advantage of a DePauldrick Garrett fumble.. On first down, quarterback Brian Bell hooked up with receiver Trey Diller for a 48-yard touchdown to give the Bearkats the 21-0 lead they would take into intermission. Bell finished 9-of-13 on the day for just 84 yards, but added 44 yards rushing. Flanders struck for a pair of scores right at the start of the second half to lead the Bearkats to a 21-point third quarter. The junior scored from 59 yards out with 13:54 to play and added a 10-yard score.
Receiving LU - Edwards 6-208 3 TDs; Ford 2-13; Garrett 2-13 SFA - Ward 11-105 1 TD; Thomas 6-46; Lacy 6-44; Lott 5-68 1 TD
86
NACOGDOCHES -- Quarterback Ryan Mossakowski came off the Cardinals' bench in the second half to throw three long touchdown passes to Jordan Edwards, but Lamar couldn't overcome a 21-point halftime deficit in falling 40-26 at Stephen F. Austin. The first came after a James Washington interception as Mossakowski hit Edwards for a 60-yard score to make it a 27-13 game with 5:58 to play in the third. SFA answered with a touchdown less than two minutes later as backup quarterback Joe Minden found Ryan Gambel from eight yards out to cap an eight-play, 65yard `Jacks to push the lead back to 37-20. Wiggs hit four field goals in the game for the Lumberjacks, including a 21-yarder with just under 10 minutes to play in the game. pick. Edwards, who was celebrating his 22nd birthday, became just the second Cardinals' receiver in school history to go over 200 yards in a game as he finished with 208 yards on six catches, all coming in the second half. The Lumberjacks struck first in the game with a touchdown following Collin Garrett's interception of a Caleb Berry pass.. Attaway finished 26-of-48 for 242 yards and two touchdowns before being pulled in the third quarter. Wiggs would add a 29-yard field goal three minutes later as SFA went ahead 20-6.
L a m a r Fo otbal l Nicholls Lamar
Game 11 - 11/10/12
Score by Quarters Nicholls Lamar
1 3 7
2 0 13
3 14 0
4 7 14
24 34
Lamar McNeese State
F 24 34
Score by Quarters Lamar McNeese State
Scoring Summary 1st 10:33 LU - Johnson 15 yd pass from Mossakowski (Stout kick) 7-0 04:58 NSU - Dolan 25 yd FG 7-3 2nd 02:31 LU - Ford 20 yd pass from Mossakowski (Stout kick) 14-3 00:24 LU - Begelton 8 yd pass from Mossakowski (kick failed)20-3 3rd 08:43 NSU - Washington 1 yd run (Dolan kick) 20-10 04:56 NSU - Caston 4 yd run (Dolan kick) 20-17 4th 11:19 LU - Berry 16 yd run (Stout kick) 34-17 05:42 LU - Prescot 26 yd int return (Stout kick) 34-17 01:50 NSU - Klann 9 yd run (Dolan kick) 34-24 Team Statistics First Downs Rushes-Yards (Net) Passing Yards (Net) Passing C-A-I Total Offense Fumbles-Lost Penalties-Yards Punts-Avg. Punt Returns-Yards Kickoff Returns-Yards Interceptions-Return Yards Possession Time 3rd Down Conversions 4th Down Conversions Sacks By: Number-Yards
NSU 22 32-136 209 26-42-3 345 2-0 6-45 2-22.0 2-17 2-33 2-37 29:38 4 of 15 2 of 3 2-14
LU 23 39-159 194 18-30-2 353 1-1 7-70 2-39.0 0-0 2-6 3-26 30:22 11 of 15 0 of 1 5-43
Individual Stats Rushing NSU - Washington 15-104 1 TD; Turner 3-31 LU - Berry 4-70 1 TD; Garrett 15-61; Harris 5-21 Passing NSU - Klann 26-42-3 209 yards LU - Mossakowski 15-24-2 168 yards 3 TDs; Berry 3-5-0 26 yards Receiving NSU - Turner 6-42; Scelfo 4-45; Washington 4-45 LU - Ford 9-111 1 TD; Begelton 4-33 1 TD; Johnson 2-24 1 TD BEAUMONT - Kevin Johnson tied the Lamar single-season school record for touchdowns, and fellow receiver Barry Ford finished with nine catches for 111 yards and a score, as Lamar University closed out its home football schedule with a 34-24 Southland Conference victory over Nicholls. Johnson gave Lamar a 7-0 lead less than five minutes into the game on a 15yard reception from Ryan Mossakowski to tie Sammy Carpenter's 1952 school record for touchdowns in a season with 13. After trailing 20-3 at the half, Nicholls scored a pair of third quarter touchdowns to pull within three points at 20-17 with less than five to play in the third. Marcus Washington, who finished with 104 yards on 15 carries for the Colonels, scored Nicholls' first touchdown. After Mossakowski was intercepted by Toren Joseph on the Cards ensuing driven, NSU was in business at the Lamar 26-yard line. The Colonels needed just five plays to cover the 26 yards with LaQuintin Caston taking it in from four yards to make it a 20-17 game with 4:56 to play in the third. Caleb Berry, who replaced Mossakowski, then went to work using his arm and legs to lead the Cardinals on a 90-yard touchdown drive to rebuild their advantage to 10 points. Berry capped the 15-play drive with three straight runs, including a 16-yard dash into the end zone with 11:19 to play in the game. Defensive tackle John Prescott would give Lamar even more breathing room with 5:42 to play in the contest as he intercepted Landry Klann and rumbled 26 yards for a touchdown that gave the Cardinals a 34-17 lead. Klann added a 9-yard scoring run with 1:50 to play in the game to provide the final scoring, but the LU defense had already left its mark on the game. The Cardinals finished with three interceptions and five sacks for 43 yards of losses. Marcus Malbrough registered two of the Cardinals’ sacks, adding another tackle for loss, a forced fumble and a pair of quarterback hurries. Linebacker Jermaine Longino led the Cards with nine tackles, including a sack, and also forced a fumble. Ford found the end zone for the first time all year with 2:31 to play in the first half. Mossakowski, who finished 15-of-24 for 168 yards before leaving the game, hit Ford for a 20-yard scoring strike to end a 14-play, 80-yard drive. Lamar would need just 1:11 to build the 20-3 lead with Mossakowski finding Reggie Begelton for an 8-yard score to finish the drive. Klann finished 26-of-42 on the day for 209 yards. Jesse Turner led Nicholls with six catches for 42 yards as 10 separate Colonels caught a pass in the game.
Game 12 - 11/17/12
1 0 7
2 0 7
3 0 14
0 35 4 0 7
Scoring Summary 1st 00:40 McN - Wiltz 1 yd run (Lewis kick) 2nd 00:21 McN - Spencer 46 yd pass from Stroud (Lewis kick) 3rd 09:25 McN - Thomas 2 yd pass from Stroud (Lewis kick) 06:17 McN - Bennett 93 yd run (Lewis kick) 4th 05:43 McN - Carey 20 yd run (Lewis 20 46-149 68 13-20-0 217 4-3 5-25 6-40.5 2-14 4-73 0-0 34:42 3 of 11 0 of 0 1-10
F 0 35 0-7 0-14 0-21 0-28 0-35
McN 15 34-264 158 10-18-0 422 0-0 6-70 5-47.6 4-49 1-5 0-0 25:18 2 of 10 2 of 3 6-38
Individual Stats Rushing LU - Garrett 23-112; Harris 8-41 McN - Bennett 4-112 1 TD; Wiltz 15-72 1 TD; Carey 4-63 1 TD Passing LU - Berry 13-20-0 68 yards McN - Stroud 1-18-0 158 yards 2 TDs Receiving LU - Ford 5-39; Edwards 4-19; McVey 3-15 McN - Spencer 3-64 1 TD; Jordan 2-39; Carey 2-17 LAKE CHARLES, La. - DePauldrick Garrett had a strong outing in his final game, but his career-best 112 yards on 23 carries went for naught as Lamar. Cody Stroud. Loveless finished with three fumble recoveries, all in the first half, tying the Southland conference record. It was the second lost fumble of the night for Berry, who ended the game 13-for20 passing for 68 yards. He was also sacked six times. Barry Ford led the team in receiving with five catches for 39 yards. Jordan Edwards had four for 19.. Darius Carey and the Cowboy offense answered on the next drive as the senior had a 33-yard carry early and finished with a 20-yard jaunt to put McNeese up 35-0.
87
La mar Foo tba l l The Southland Conference In an era of considerable change in intercollegiate athletics, the Southland Conference continues to be a model of innovation, stability and consistent achievement as it celebrates a halfcentury. Southland Conference football ranks among the best Football Championship Subdivision leagues in the nation, and enjoys an annual expectation of competing for the national championship with multiple teams advancing to the NCAA playoffs each year. In 2011 and 2012, Sam Houston State advanced to the NCAA national championship game. Also, in 2002 and 2003, McNeese State finished the regular season ranked No. 1 in the nation, and advanced to the 2002 national championship contest. The conference has been represented in eight national championship games since the league joined the FCS (formerly I-AA) in 1982. All told, Southland teams have played in 104 Division I playoff games in 31 years, winning 51 of the contests. Historically, the Southland’s successful football heritage has sustained itself through numerous membership and classification changes. The Southland joined the NCAA College Division in 1968, and was designated as NCAA Division II in 1973 before joining Division I in 1975. The Southland was an NCAA Division I-A league from 1978-81, before joining the ranks of FCS in 1982, its home ever since.
88
During its tenure as a Division I-A conference, the Southland Conference initiated the startup of the Shreveport, La.-based Independence Bowl in 1976. The Southland Division I-AA six trips to the postseason, including the semifinals in 2004. Nicholls State has participated three times in the playoffs, and Central Arkansas has made consecutive playoff appearances in 2011 and 2012. On four occasions, the Southland has placed three teams in the NCAA playoffs. The Southland has produced 168 (206) in the National Football League draft. There have been 26 Southland players taken in the draft since 2000, including Southeastern Louisiana defensive back Robert Alford, who was picked as the first FCS player in the second round of the 2013 draft. There are 20 former Southland players on NFL rosters heading into the 2013 season. Southland Conference alums in the NFL include Buffalo’s Terrence McGee (Northwestern State) and Chicago’s Josh McCown (Sam Houston State), who have each been in the league for the last 11 seasons. Other recent NFL additions from the Southland include Green Bay’s Kevin Hughes (Southeastern Louisiana), St. Louis’ Jabara Williams (Stephen F. Austin) Washington’s Devin Holland (McNeese State), Atlanta’s Marcus Jackson (Lamar) and Cleveland’s Dominique Croom (Central Arkansas). The Southland has seen former Nicholls State players win Super Bowl rings in two of the last three seasons, as former Colonel Antonio Robinson was a member of the Green Bay Packers' Super Bowl XLV champions. And, Nicholls-ex Lardarius Webb was a member of the Super Bowl XLVII champion Baltimore Ravens.-athletes with grade-point averages above 3.0 are honored on the Southland’s annual All-Academic teams and Commissioner’s Honor Roll. A record 979 student-athletes appeared on the honor roll following the 2012 spring semester, and total of 1,545 student-athletes earned a spot on the honor roll at the end of the fall and spring semesters during the 2012-13 academic year. While successful on the fields and courts, the Southland Conference has repeatedly demonstrated its commitment to the academic and athletic success of its student-athletes. The conference continues to make great strides in the classroom. During the last seven.
L a m a r Fo otbal l 2012 Southland Conference Standings Central Arkansas Sam Houston State Southeastern Louisiana McNeese State Stephen F. Austin Northwestern State Lamar Nicholls
W 6 6 5 4 4 2 1 0
L 1 1 2 3 3 5 6 7
SLC Games Pct. PF .857 215 .857 335 .714 174 .571 202 .571 254 .286 149 .143 125 .000 100
PA 144 101 214 153 218 227 240 257
W 9 11 5 7 5 4 4 1
L 3 4 6 4 6 7 8 10
All Games Pct. PF .750 418 .733 600 .455 207 .636 357 .455 375 .364 265 .333 241 .091 195
PA 270 322 382 233 368 354 355 426
Streak Lost 1 Lost 1 Won 2 Won 1 Won 1 Lost 3 Lost 1 Lost 8
2012 All-Southland Conference Teams First-Team Offense
Pos. QB RB RB TE/HB WR WR WR OL OL OL OL OL AP PK
Name Wynrick Smothers Timothy Flanders3 Gus Johnson T.J. Jones Cordell Roberson3 Jesse Grandy2 Dominque Croom Corey Howard Kaleb Hopson2 John Steel2 Arinze Agada Chris Rogers Richard Sincere2 Eddie Camara2
First-Team Defense Pos. DL DL DL DL LB LB LB DB DB DB DB DB P KR PR
Name Willie Jefferson2 J.T. Cleveland3 Jonathan Woodard Darren Robinson Darius Taylor Seth Allison2 Derek Rose3 Darnell Taylor2 Robert Alford2 Dax Swanson2 Josh Aubrey Jestin Love3 Matt Foster2 Jesse Grandy2 Jesse Grandy2
University Central Arkansas Sam Houston State Stephen F. Austin Sam Houston State Stephen F. Austin Central Arkansas Central Arkansas Central Arkansas Sam Houston State Stephen F. Austin McNeese State Sam Houston State Sam Houston State Central Arkansas
Ht. 6-1 5-9 5-10 6-3 6-3 5-11 6-1 6-1 6-6 6-5 6-1 5-11 5-10 5-9
Wt. Cl. Hometown 208 Jr. Destrehan, La. 210 Jr. Midwest City, Okla. 215 So. Gilmer, Texas 245 Sr. Tyler, Texas 215 Sr. Jefferson, Texas 165 Sr. Pine Bluff, Ark. 193 Sr. Cherokee, Ala. 290 Sr. Wichita Falls, Texas 300 Sr. Early, Texas 295 Sr. Boyd, Texas 286 Jr. Houston, Texas 270 Sr. Littleton, Colo. 180 Jr. Galveston, Texas 168 So. Cedar Hill, Texas
University Stephen F. Austin Sam Houston State Central Arkansas Stephen F. Austin Sam Houston State Central Arkansas Northwestern State Sam Houston State Southeastern La. Sam Houston State Stephen F. Austin Central Arkansas Sam Houston State Central Arkansas Central Arkansas
Ht. 6-6 6-0 6-5 5-11 6-0 5-11 5-11 6-0 6-0 5-11 5-11 6-0 6-6 5-11 5-11
Wt. Cl. Hometown 234 Sr. Beaumont, Texas 290 Sr. Baytown, Texas 251 Fr. Brentwood, Tenn. 247 So. Dallas, Texas 240 Sr. Mesquite, Texas 195 Sr. Stuttgart, Ark. 229 Sr. New Orleans, La. 195 Sr. Mesquite, Texas 185 Sr. Hammond, La. 185 Sr. Waco, Texas 202 Sr. Tyler, Texas 208 Jr. West Memphis, Ark. 195 Sr. Melbourne, Australia 165 Sr. Pine Bluff, Ark. 165 Sr. Pine Bluff, Ark.
Second-Team Offense Pos. QB RB RB TE/HB WR WR WR OL OL OL OL OL AP PK
Name University Brian Bell2 Sam Houston State Marcus Wiltz McNeese State Jackie Hinton2 Central Arkansas Nick Scelfo2 Nicholls State Trey Diller Sam Houston State Darius Carey McNeese State D.J. Ward Stephen F. Austin Alec Savoie2 McNeese State Gasten Gabriel Southeastern La. Taylor Johnson McNeese State Cole Caruthers Central Arkansas Sean Robertson Lamar Xavier Roberson Southeastern La. John Shaughnessy2 Northwestern State
Second-Team Defense Pos. DL DL DL DL LB LB LB DB DB DB DB DB P KR PR
Name Matt Hornbuckle Gary Lorance Jesse Dickson Everett Ellefsen Jordan Piper Devan Walker Joe Narcisse Terence Cahee Kenneth Jenkins3 Bookie Sneed2 Jamaal White3 Cortez Paige Beau Mothe Trey Diller Darius Carey
University Central Arkansas Sam Houston State Lamar McNeese State Nicholls State Southeastern La. McNeese State McNeese State Sam Houston State Sam Houston State Northwestern State Northwestern State Southeastern La. Sam Houston State McNeese State
Ht. 6-2 5-9 5-10 6-4 6-2 6-0 5-11 6-7 6-5 6-4 6-4 6-1 5-9 5-11
Wt. Cl. Hometown 175 Jr. China Spring, Texas 192 Jr. Cecilia, La. 210 Sr. Houston, Texas 235 So. Baton Rouge, La. 200 Sr. Spring, Texas 184 Sr. New Orleans, La. 180 Fr.The Woodlands, Texas 309 Sr. Lafayette, La. 310 Jr. Jackson, La. 290 Sr. League City, Texas 284 So. Sugarland, Texas 270 Sr. Copperas Cove, Texas 170 Fr. Atlanta, Ga. 181 Sr. Shreveport, La.
Ht. 6-2 6-0 6-3 6-3 5-10 6-3 5-11 5-9 5-10 6-0 6-0 6-1 6-3 6-2 6-0
Wt. Cl. 281 Jr. 290 Jr. 265 Jr. 230 So. 242 Sr. 240 Sr. 222 Sr. 190 Jr. 195 Sr. 180 Jr. 192 Sr. 181 Sr. 210 Sr. 200 Sr. 184 Sr.
Hometown Colleyville, Texas Baytown, Texas Houston, Texas Madisonville, La. New Orleans, La. Baton Rouge, La. Vacherie, La. Westlake, La. Galveston, Texas Conroe, Texas Garland, Texas Houston, Texas New Orleans, La. Spring, Texas New Orleans, La..
2012 Southland Individual Awards
89
La mar Foo tba l l 2012 Southland Conference Team Statistics SCORING OFFENSE 1. Sam Houston State 2. Central Arkansas 3. Stephen F. Austin 4. McNeese State 5. Northwestern State 6. Lamar 7. Southeastern La. 8. Nicholls State
G 15 12 11 11 11 12 11 11
TD 77 54 48 46 32 32 27 24
XP 2XP DXP FG 74 0 1 20 53 0 0 13 40 1 0 15 45 0 0 12 29 1 0 14 29 0 1 6 23 2 0 6 21 0 0 10
Saf 1 1 0 0 0 0 0 0
Pts 600 418 375 357 265 241 207 195
Avg 40.0 34.8 34.1 32.5 24.1 20.1 18.8 17.7
PASS DEFENSE 1. Lamar 2. Southeastern La. 3. Northwestern State 4. Central Arkansas 5. Stephen F. Austin 6. Sam Houston State 7. McNeese State 8. Nicholls State
G 12 11 11 12 11 15 11 11
Att 394 324 367 366 351 494 419 379
SCORING DEFENSE 1. McNeese State 2. Sam Houston State 3. Central Arkansas 4. Lamar 5. Northwestern State 6. Stephen F. Austin 7. Southeastern La. 8. Nicholls State
G 11 15 12 12 11 11 11 11
TD 29 42 36 43 44 48 51 56
XP 2XP DXP FG Saf 26 3 0 9 0 36 2 0 10 0 30 0 0 8 0 41 1 0 18 0 42 0 0 16 0 43 1 0 11 1 44 1 0 10 0 54 0 0 12 0
Pts 233 322 270 355 354 368 382 426
Avg 21.2 21.5 22.5 29.6 32.2 33.5 34.7 38.7
PASS EFFICIENCY 1. Sam Houston State 2. Central Arkansas 3. McNeese State 4. Stephen F. Austin 5. Nicholls State 6. Northwestern State 7. Lamar 8. Southeastern La.
G 15 12 11 11 11 11 12 11
Att 334 437 294 679 355 345 340 349
Cmp 205 285 180 395 205 189 189 189
Pct 61.4 65.2 61.2 58.2 57.7 54.8 55.6 54.2
Int 12 10 6 26 16 7 13 10
Yds 2853 3199 2239 4240 2443 1979 1857 2165
TD 26 32 21 31 10 14 18 11
Effic 151.6 146.3 144.7 118.0 115.8 112.3 111.3 110.9
TOTAL OFFENSE 1. Stephen F. Austin 2. Sam Houston State 3. McNeese State 4. Central Arkansas 5. Nicholls State 6. Southeastern La. 7. Northwestern State 8. Lamar
G 11 15 11 12 11 11 11 12
Rush 1309 4025 2304 1602 1279 1136 1286 1511
Pass Plays Yards Avg/P TD Yds/G 4240 1007 5549 5.5 47 504.5 2853 1076 6878 6.4 72 458.5 2239 735 4543 6.2 44 413.0 3199 865 4801 5.6 49 400.1 2443 703 3722 5.3 24 338.4 2165 749 3301 4.4 22 300.1 1979 734 3265 4.4 28 296.8 1857 791 3368 4.3 26 280.7
PASS EFFICIENCY DEF 1. Lamar 2. McNeese State 3. Sam Houston State 4. Central Arkansas 5. Northwestern State 6. Southeastern La. 7. Stephen F. Austin 8. Nicholls State
G 12 11 15 12 11 11 11 11
Att 394 419 494 366 367 324 351 379
Cmp 228 263 259 217 213 184 197 240
Int 13 15 18 15 10 12 9 11
Pct. 57.9 62.8 52.4 59.3 58.0 56.8 56.1 63.3
Yds 2397 2614 3524 2634 2365 2259 2437 2894
TD 17 16 27 15 22 20 23 25
Effic 116.6 120.6 123.1 125.1 126.5 128.3 130.9 143.4
TOTAL DEFENSE 1. Sam Houston State 2. Stephen F. Austin 3. McNeese State 4. Lamar 5. Central Arkansas 6. Southeastern La. 7. Northwestern State 8. Nicholls State
G 15 11 11 12 12 11 11 11
Rush 1478 1320 1269 1926 1920 2004 2130 2119
Pass Plys Yards 3524 947 5002 2437 782 3757 2614 784 3883 2397 837 4323 2634 853 4554 2259 774 4263 2365 840 4495 2894 825 5013
KICKOFF RETURNS 1. Lamar 2. Sam Houston State 3. Stephen F. Austin 4. Central Arkansas 5. Southeastern La. 6. Northwestern State 7. McNeese State 8. Nicholls State
G 12 15 11 12 11 11 11 11
Ret 52 44 39 33 60 53 39 52
Yds 1184 940 830 695 1255 1059 736 959
TD 2 0 0 0 2 2 0 0
Avg 22.8 21.4 21.3 21.1 20.9 20.0 18.9 18.4
G 11 11 11 12 15 11 12 11
Ret 10 19 21 20 36 15 17 30
Yds 193 346 299 273 477 111 111 187
TD 2 0 0 2 1 0 0 0
Avg 19.3 18.2 14.2 13.6 13.2 7.4 6.5 6.2
Avg 5.3 4.8 5.0 5.2 5.3 5.5 5.4 6.1
TD Yds/G 39 333.5 39 341.5 29 353.0 40 360.2 36 379.5 44 387.5 40 408.6 54 455.7
Cmp 228 184 213 217 197 259 263 240
RUSHING OFFENSE 1. Sam Houston State 2. McNeese State 3. Central Arkansas 4. Lamar 5. Stephen F. Austin 6. Northwestern State 7. Nicholls State 8. Southeastern La.
G 15 11 12 12 11 11 11 11
Att 742 441 428 451 328 389 348 400
Yds 4025 2304 1602 1511 1309 1286 1279 1136
Avg TD 5.4 46 5.2 23 3.7 17 3.4 8 4.0 16 3.3 14 3.7 14 2.8 11
Yds/G 268.3 209.5 133.5 125.9 119.0 116.9 116.3 103.3
PUNT RETURN AVG 1. Southeastern La. 2. Northwestern State 3. McNeese State 4. Central Arkansas 5. Sam Houston State 6. Nicholls State 7. Lamar 8. Stephen F. Austin
RUSHING DEFENSE 1. Sam Houston State 2. McNeese State 3. Stephen F. Austin 4. Central Arkansas 5. Lamar 6. Southeastern La. 7. Nicholls State 8. Northwestern State
G 15 11 11 12 12 11 11 11
Att 453 365 431 487 443 450 446 473
Yards Avg. TD 1478 3.3 12 1269 3.5 13 1320 3.1 16 1920 3.9 21 1926 4.3 23 2004 4.5 24 2119 4.8 29 2130 4.5 18
Yds/G 98.5 115.4 120.0 160.0 160.5 182.2 192.6 193.6
PUNTING 1. Sam Houston State 2. Nicholls State 3. Central Arkansas 4. McNeese State 5. Northwestern State 6. Lamar 7. Stephen F. Austin 8. Southeastern La.
G No. Yards 15 65 2767 11 52 2185 12 67 2681 11 49 2006 11 75 2830 12 68 2782 11 60 2218 11 62 2548
Avg 6.2 7.3 6.9 7.6 6.2 8.5 5.7 5.5
FIELD GOALS 1. Central Arkansas 2. Northwestern State 3. Sam Houston State 4. Stephen F. Austin 5. Nicholls State 6. McNeese State 7. Lamar 8. Southeastern La.
G 12 11 15 11 11 11 12 11
PASS OFFENSE 1. Stephen F. Austin 2. Central Arkansas 3. Nicholls State 4. McNeese State 5. Southeastern La. 6. Sam Houston State 7. Northwestern State 8. Lamar
90
G 11 12 11 11 11 15 11 12
Att 679 437 355 294 349 334 345 340
Cmp 395 285 205 180 189 205 189 189
Int 26 10 16 6 10 12 7 13
Pct. 58.2 65.2 57.7 61.2 54.2 61.4 54.8 55.6
Yds 4240 3199 2443 2239 2165 2853 1979 1857
TD Yds/G 31 385.5 32 266.6 10 222.1 21 203.5 11 196.8 26 190.2 14 179.9 18 154.8
Made 13 14 20 15 10 12 6 6
Att 15 17 25 20 14 18 10 14
Int 13 12 10 15 9 18 15 11
Pct. 57.9 56.8 58.0 59.3 56.1 52.4 62.8 63.3
Avg/P 42.6 42.0 40.0 40.9 37.7 40.9 37.0 41.1 Pct .867 .824 .800 .750 .714 .667 .600 .429
Yds 2397 2259 2365 2634 2437 3524 2614 2894
PR 106 141 111 176 208 381 217 470
Avg 6.1 7.0 6.4 7.2 6.9 7.1 6.2 7.6
Avg 1.6 2.7 1.7 3.6 2.8 5.6 3.6 7.6
TD Yds/G 17 199.8 20 205.4 22 215.0 15 219.5 23 221.5 27 234.9 16 237.6 25 263.1
TBg 6 4 7 3 2 3 2 3
Net/P 39.1 37.8 36.3 36.1 34.4 34.4 32.7 32.5
L a m a r Fo otbal l 2012 Southland Conference Team & Individual Statistics SACKS BY 1. Sam Houston State 2. Stephen F. Austin 3. Central Arkansas 4. Southeastern La. 5. Lamar 6. McNeese State 7. Northwestern State 8. Nicholls State
G Sacks Yards 15 38 11 31 12 30 11 25 12 21 11 20 11 15 11 11
SACKS AGAINST 1. Sam Houston State 2. Stephen F. Austin 3. Southeastern La. McNeese State 5. Central Arkansas 6. Lamar 7. Northwestern State 8. Nicholls State
G 15 11 11 11 12 12 11 11
INTERCEPTIONS 1. Sam Houston State 2. Central Arkansas 3. McNeese State 4. Lamar 5. Southeastern La. 6. Nicholls 7. Northwestern State 8. Stephen F. Austin FIRST DOWNS 1. Sam Houston State 2. Stephen F. Austin 3. Central Arkansas 4. McNeese State 5. Lamar 6. Nicholls State 7. Northwestern State 8. Southeastern La.
Sacks 6 10 18 18 22 33 34 43 G 15 12 11 12 11 11 11 11
Gained TURNOVER MARGIN G Fum Int Tot 1. McNeese State 11 13 15 28 2. Sam Houston State 15 12 18 30 3. Central Arkansas 12 12 15 27 4. Northwestern State 11 10 10 20 5. Southeastern La. 11 6 12 18 6. Nicholls State 11 11 11 22 7. Lamar 12 3 13 16 8. Stephen F. Austin 11 17 9 26
274 199 177 157 130 156 104 68
Yards 46 85 122 130 128 240 191 286 No. 18 15 15 13 12 11 10 9
G Rush Pass 15 183 116 11 80 200 12 91 145 11 109 110 12 93 93 11 69 99 11 66 82 11 54 105
Yards 234 131 52 233 82 185 172 41
TD 3 0 2 3 0 0 2 0
Avg. 13.0 8.7 3.5 17.9 6.8 16.8 17.2 4.6
Pen Total 26 325 37 317 18 254 27 246 20 206 28 196 33 181 19 178
G 15 11 12 11 12 11 11 11
Conv 98 56 76 80 63 55 53 43
Att 215 133 184 200 173 167 168 141
Pct 45.6 42.1 41.3 40.0 36.4 32.9 31.5 30.5
4TH-DN CONVERSIONS 1. Central Arkansas 2. McNeese State 3. Northwestern State 4. Lamar 5. Sam Houston State 6. Stephen F. Austin 7. Southeastern La. 8. Nicholls State
G 12 11 11 12 15 11 11 11
Conv 15 6 9 13 10 10 13 8
Att 19 9 15 22 18 24 34 23
Pct 78.9 66.7 60.0 59.1 55.6 41.7 38.2 34.8
G 15 12 11 12 11 11 11 11
Lost Int 6 12 10 7 10 16 13 26
Tot 12 20 21 20 21 29 32 41
Mar +16 +10 +6 +0 -3 -7 -16 -15
Per/G 1.45 0.67 0.50 0.00 -0.27 -0.64 -1.33 -1.36
Individual Statistics
3RD-DN CONVERSIONS 1. Sam Houston State 2. McNeese State 3. Central Arkansas 4. Stephen F. Austin 5. Lamar 6. Southeastern La. 7. Northwestern State 8. Nicholls State
TIME OF POSSESSION 1. Sam Houston State 2. Lamar 3. McNeese State 4. Central Arkansas 5. Southeastern La. 6. Nicholls State 7. Northwestern State 8. Stephen F. Austin
Fum 6 8 11 13 11 13 19 15
Total Time 505:51 375:07 343:28 362:34 326:32 324:51 303:25 282:22
Avg/G 33:43 31:15 31:13 30:12 29:41 29:31 27:35 25:40
RUSHING 1. Flanders, Tim-SHSU 2. Johnson, Gus-SFA 3. Wiltz, Marcus-MCN 4. Washington, Marcus-NICH 5. Garrett, DePauldrick-LU 6. Hinton, Jackie-UCA 7. Murray, Javaris-MCN 8. Roberson, Xavier-SLU 9. Gentry, Doug-SFA 10. Sincere, Richard-SHSU
Cl JR SO JR JR JR SR FR FR FR SO
G 15 10 10 10 10 12 10 11 10 15
Att 288 154 130 116 138 152 86 105 91 106
Yds 1642 969 651 598 585 619 504 488 418 607
Avg 5.7 6.3 5.0 5.2 4.2 4.1 5.9 4.6 4.6 5.7
TD 17 14 6 6 2 4 3 4 2 5
Long 71 66 35 54 35 21 76 36 17 65
Yds/G 109.5 96.9 65.1 59.8 58.5 51.6 50.4 44.4 41.8 40.5
PASSING AVG/GAME 1. Attaway, Brady-SFA 2. Smothers, Wynrick-UCA 3. Stroud, Cody-MCN 4. Klann, Landry-NICH 5. Bell, Brian-SHSU 6. Stanley, Nathan-SLU 7. Henderson, Brad-NWLA 8. Mossakowski, Ryan-LU 9. Mothe, Beau-SLU 10. Morris, Rumeall-NWLA
Cl JR JR JR JR JR SR SR JR SR JR
G 11 12 11 11 15 11 11 9 11 10
Att-Cmp-Int 570-334-21 427-277-9 278-170-5 310-176-14 322-197-10 327-177-9 330-181-4 193-113-8 4-3-0 1-1-0
Pct. 58.6 64.9 61.2 56.8 61.2 54.1 54.8 58.5 75.0 100.0
Yds 3671 3103 2102 2049 2715 1952 1874 1194 67 42
TD 29 31 19 8 25 9 14 13 1 0
Avg/G 333.7 258.6 191.1 186.3 181.0 177.5 170.4 132.7 6.1 4.2
PASS EFFICIENCY 1. Bell, Brian-SHSU 2. Smothers, Wynrick-UCA 3. Stroud, Cody-MCN 4. Mossakowski, Ryan-LU 5. Attaway, Brady-SFA 6. Henderson, Brad-NWLA 7. Klann, Landry-NICH 8. Stanley, Nathan-SLU
Cl JR JR JR JR JR SR JR SR
G 15 12 11 9 11 11 11 11
Att-Cmp-Int 322-197-10 427-277-9 278-170-5 193-113-8 570-334-21 330-181-4 310-176-14 327-177-9
Pct. 61.2 64.9 61.2 58.5 58.6 54.8 56.8 54.1
Yds 2715 3103 2102 1194 3671 1874 2049 1952
TD 25 31 19 13 29 14 8 9
Eff. 151.4 145.7 143.6 124.5 122.1 114.1 111.8 107.8
RECEPTIONS/GAME 1. Roberson, Cordell-SFA 2. Ward, D.J.-SFA 3. Brooks, Mike-SFA 4. Grandy, Jesse-UCA 5. Lewis, Dezmin-UCA 6. Croom, Dominique-UCA 7. Gambel, Ryan-SFA 8. Diller, Trey-SHSU 9. Turner, Jesse-NICH 10. Ford, Barry-LU
Cl SR FR JR SR SO SR SR SR SR JR
G 9 11 10 12 12 12 11 15 11 12
Rec 77 62 51 61 56 53 47 62 45 49
Yds 1006 762 492 797 616 711 530 927 448 470
TD 10 4 2 7 6 8 2 4 2 1
Long 75 77 58 75 42 74 30 56 69 25
Avg/C Rec/G 13.1 8.56 12.3 5.64 9.6 5.10 13.1 5.08 11.0 4.67 13.4 4.42 11.3 4.27 15.0 4.13 10.0 4.09 9.6 4.08
RECEIVING YDS/GAME 1. Roberson, Cordell-SFA 2. Ward, D.J.-SFA 3. Grandy, Jesse-UCA 4. Diller, Trey-SHSU 5. Croom, Dominique-UCA 6. Lewis, Dezmin-UCA 7. Brooks, Mike-SFA 8. Gambel, Ryan-SFA 9. Carey, Darius-MCN 10. Nelson, Chance-SHSU
Cl SR FR SR SR SR SO JR SR SR SO
G 9 11 12 15 12 12 10 11 10 15
Rec 77 62 61 62 53 56 51 47 28 35
Yds 1006 762 797 927 711 616 492 530 455 671
TD 10 4 7 4 8 6 2 2 3 9
Long 75 77 75 56 74 42 58 30 52 70
Avg/C Yds/G 13.1 111.8 12.3 69.3 13.1 66.4 15.0 61.8 13.4 59.2 11.0 51.3 9.6 49.2 11.3 48.2 16.2 45.5 19.2 44.7
91
La mar Foo tba l l 2012 Southland Conference Team & Individual Statistics TOTAL OFFENSE 1. Attaway, Brady-SFA 2. Smothers, Wynrick-UCA 3. Bell, Brian-SHSU 4. Henderson, Brad-NWLA 5. Stroud, Cody-MCN 6. Klann, Landry-NICH 7. Stanley, Nathan-SLU 8. Mossakowski, Ryan-LU 9. Flanders, Tim-SHSU 10. Johnson, Gus-SFA
Cl JR JR JR SR JR JR SR JR JR SO
SCORING 1. Johnson, Gus-SFA 2. Antonio, Miguel-SHSU 3. Camara, Eddie-UCA 4. Wiggs, Jordan-SFA 5. Flanders, Tim-SHSU 6. Johnson, Kevin-LU 7. Lewis, Josh-MCN 8. Roberson, Cordell-SFA 9. Shaughnessy, John-NWLA 10. Dolan, Andrew-NICH
Cl SO SR SO SO JR SO SR SR SR JR
SCORING (TDs) 1. Johnson, Gus-SFA 2. Flanders, Tim-SHSU 3. Johnson, Kevin-LU 4. Roberson, Cordell-SFA 5. Lewis, Dezmin-UCA Grandy, Jesse-UCA Croom, Dominique-UCA 8. Roberson, Xavier-SLU 9. Carey, Darius-MCN Washington, Marcus-NICH SCORING (KICK) 1. Antonio, Miguel-SHSU 2. Camara, Eddie-UCA 3. Wiggs, Jordan-SFA 4. Lewis, Josh-MCN 5. Shaughnessy, John-NWLA 6. Dolan, Andrew-NICH 7. Stout, Justin-LU 8. Sebastian, Seth-SLU KICK RETURN AVG 1. Roberson, Xavier-SLU 2. Lacy, De'Vante-SFA 3. Johnson, Kevin-LU 4. Grandy, Jesse-UCA 5. Franks, VanLawrance-LU 6. Eagan, Ed-NWLA 7. Diller, Trey-SHSU 8. Spencer, Diontae-MCN 9. Smiley, Jeff-SLU 10. Hanberry, Josh-NICH ALL PURPOSE YARDS 1. Grandy, Jesse-UCA 2. Diller, Trey-SHSU 3. Flanders, Tim-SHSU 4. Roberson, Cordell-SFA 5. Johnson, Gus-SFA 6. Hanberry, Josh-NICH 7. Carey, Darius-MCN 8. Johnson, Kevin-LU 9. Spencer, Diontae-MCN 10. Roberson, Xavier-SLU PUNTING 1. Mothe, Beau-SLU 2. Foster, Matt-SHSU 3. Kemps, Cory-NICH 4. Kahler, Kollin-LU 5. Breaux, Jean-MCN 6. Buford, Kevin-UCA 7. Russo, Nic-NWLA 8. Bruno, Nick-SFA
92
Cl SR SO SO SR SR JR JR JR Cl FR FR SO SR SR FR SR SR FR SO
G 11 15 11 12 11 12 11 11
Rush -153 449 377 253 -47 -109 -30 23 1642 969
Pass 3671 3103 2715 1874 2102 2049 1952 1194 0 0
Plays 590 536 419 465 315 383 391 233 288 154
TD 15 0 0 0 18 13 0 10 0 0
XPT 0 73 53 36 0 0 42 0 29 21
FG 0 20 13 15 0 0 11 0 14 10
G 10 15 12 11 15 11 11 9 11 11
Cl SO JR SO SR SO SR SR FR SR JR
Cl SR SR JR SR SO SO SR SO SR FR Cl SR SR SR JR FR SR SR FR
G 11 12 15 11 11 11 11 9 15 10
G 10 15 11 9 12 12 12 11 10 10
G 15 12 11 11 11 11 12 11
2XP 0 0 0 0 0 0 0 0 0 0
TD RushPass Ret 15 14 1 0 18 17 1 0 13 1 10 2 10 0 10 0 8 0 6 2 8 0 7 1 8 0 8 0 7 4 1 2 6 3 3 0 6 6 0 0
PATs 73-74 53-54 36-39 42-43 29-30 21-24 29-32 23-24 G 11 10 11 12 12 9 15 11 11 10
Total 3518 3552 3092 2127 2055 1940 1922 1217 1642 969
FGs 20-25 13-15 15-20 11-17 14-17 10-14 6-10 6-14
Yds/G 319.8 296.0 206.1 193.4 186.8 176.4 174.7 135.2 109.5 96.9
Pts 90 133 92 81 108 78 75 60 71 51
Pts/G 9.0 8.9 7.7 7.4 7.2 7.1 6.8 6.7 6.5 4.6
PAT PtsPts/G 0 90 9.0 0 108 7.2 0 78 7.1 0 60 6.7 0 48 4.0 0 48 4.0 0 48 4.0 0 42 3.8 0 36 3.6 0 36 3.6
Pts Pts/G 133 8.9 92 7.7 81 7.4 75 6.8 71 6.5 51 4.6 47 3.9 41 3.7
Ret 11 12 22 20 17 12 23 12 24 31
Yds 366 351 623 522 410 282 528 264 474 596
TD Long 2 96 0 74 2 89 0 48 0 73 1 82 0 59 0 33 0 47 0 53
Avg 33.3 29.2 28.3 26.1 24.1 23.5 23.0 22.0 19.8 19.2
G 12 15 15 9 10 10 10 11 11 11
Rush 28 62 1642 -3 969 -6 162 15 159 488
Rcv 797 927 128 1006 86 308 455 309 413 20
PR 238 354 0 0 0 0 213 0 46 0
Yds 1585 1871 1770 1003 1055 898 871 947 882 874
Punt 53 61 50 67 48 66 73 41
Yds 2305 2637 2112 2782 1981 2640 2830 1553
Long 60 61 64 63 67 69 64 76
Avg 43.5 43.2 42.2 41.5 41.3 40.0 38.8 37.9
KR 522 528 0 0 0 596 41 623 264 366
Avg/G 132.1 124.7 118.0 111.4 105.5 89.8 87.1 86.1 80.2 79.5
FIELD GOALS 1. Wiggs, Jordan-SFA 2. Antonio, Miguel-SHSU 3. Shaughnessy, John-NWLA 4. Camara, Eddie-UCA 5. Lewis, Josh-MCN 6. Dolan, Andrew-NICH 7. Sebastian, Seth-SLU 8. Stout, Justin-LU
Cl SO SR SR SO SR JR JR JR
G 11 15 11 12 11 11 11 12
FG 15 20 14 13 11 10 6 6
PAT KICKING PCT 1. Antonio, Miguel-SHSU 2. Camara, Eddie-UCA 3. Lewis, Josh-MCN 4. Shaughnessy, John-NWLA 5. Sebastian, Seth-SLU 6. Wiggs, Jordan-SFA 7. Stout, Justin-LU 8. Dolan, Andrew-NICH
Cl SR SO SR SR JR SO JR JR
TACKLES 1. Piper, Jordan-NICH 2. Longino, Jermaine-LU 3. Rose, Derek-NWLA 4. Garrett, Collin-SFA 5. Heard, Justin-UCA 6. Black, Patrick-NWLA 7. Epperson, Ryan-SFA 8. Barlow, Cedric-SFA 9. Love, Jestin-UCA 10. Cahee, Terence-MCN Muse, Kaleb-SLU 18. Allen, Chad-LU 27. Washington, James-LU 40. Dickson, Jesse-LU 47. McGlothen, Tyrus-LU 50. Thomas, Branden-LU
Cl SR JR SR SO JR JR SR JR JR JR SO JR JR JR JR JR
G 11 12 11 11 12 11 11 11 12 11 11 12 12 10 11 12
Pos. LB LB LB LB LB LB LB DB DB CB LB DB LB DL DB DB
Solo 56 63 49 48 63 39 31 38 49 45 45 55 41 30 31 33
Ast. 51 44 48 48 37 48 54 46 42 35 35 24 27 13 12 12
Total Avg/G 107 9.7 107 8.9 97 8.8 96 8.7 100 8.3 87 7.9 85 7.7 84 7.6 91 7.6 80 7.3 80 7.3 79 6.6 68 5.7 43 4.3 43 3.9 45 3.8
Sacks 1.5 2.0 0.0 0.5 0.0 0.0 1.0 1.5 0.0 0.0 1.5 0.0 2.0 4.0 0.0 0.0
SACKS 1. Jefferson, Willie-SFA 2. Robinson, Darren-SFA 3. Taylor, Darius-SHSU 4. Walker, Devan-SLU 5. Woodard, Jonathan-UCA 6. Weaver, Andrew-SHSU 7. Miles, Ishmiah-SFA 8. Williams, Justin-UCA 9. Broadway, Cornist-NWLA 10. Knight, Rashar-NICH
Cl SR SO SR SR FR JR SO SR JR SR
G 11 11 14 10 12 14 9 11 10 11
Pos DE DE LB LB DE DE DE DL DE LB
Solo 7 4 6 7 7 4 4 5 4 4
Ast 2 7 2 0 0 2 2 0 1 0
Yds 63 42 53 51 41 48 38 27 28 28
Avg/G 0.73 0.68 0.50 0.70 0.58 0.36 0.56 0.45 0.45 0.36
INTERCEPTIONS 1. Alford, Robert-SLU 2. Sneed, Bookie-SHSU Thomas, Branden-LU 4. Morgan, Guy-MCN 5. Paige, Cortez-NWLA White, Jamaal-NWLA Bronson, Ryan-MCN 8. Shaw, Robert-SHSU Swanson, Dax-SHSU 10. Brady, Karl-UCA
Cl SR JR JR JR SR SR JR SR SR JR
G 11 12 12 10 11 11 11 15 15 10
Int 4 4 4 3 3 3 3 4 4 2
Yds 5 103 68 5 112 13 5 51 29 36
TD 0 2 1 0 1 0 0 1 0 0
FUMBLES FORCED 1. Jefferson, Willie-SFA 2. Narcisse, Joe-MCN 3. Vergenal, Siegan-NICH Ellefsen, Everett-MCN 5. Allison, Seth-UCA Longino, Jermaine-LU 7. Mitchell, Dwayne-NICH Nelson, Caleb-SFA Morgan, Guy-MCN 10. Muse, Kaleb-SLU
Cl SR SR JR SO SR JR SO JR JR SO
G 11 9 11 11 12 12 10 10 10 11
No. Avg/G 5 0.45 3 0.33 3 0.27 3 0.27 3 0.25 3 0.25 2 0.20 2 0.20 2 0.20 2 0.18
PASSES DEFENDED 1. Swanson, Dax-SHSU Shaw, Robert-SHSU 3. Alford, Robert-SLU 4. Guillory, Adrian-LU 5. Washington, Todd-SLU 6. Thomas, Branden-LU 7. McGlothen, Tyrus-LU Cahee, Terence-MCN Bronson, Ryan-MCN Aubrey, Josh-SFA
Cl SR SR SR SR JR JR JR JR JR SR
G Brup 15 14 15 14 11 8 12 10 11 9 12 6 11 6 11 7 11 5 11 6
G Made 15 73 12 53 11 42 11 29 11 23 11 36 12 29 11 21
FGA 20 25 17 15 17 14 14 10
Pct. 75.0 80.0 82.4 86.7 64.7 71.4 42.9 60.0
Att 74 54 43 30 24 39 32 24
Int 4 4 4 1 1 4 2 1 3 2
FG/G 1.36 1.33 1.27 1.08 1.00 0.91 0.55 0.50
Pct. 98.6 98.1 97.7 96.7 95.8 92.3 90.6 87.5
Total 18 18 12 11 10 10 8 8 8 8
Avg/G 1.20 1.20 1.09 0.92 0.91 0.83 0.73 0.73 0.73 0.73
Total 8.0 7.5 7.0 7.0 7.0 5.0 5.0 5.0 4.5 4.0
L a m a r Fo otbal l 2013 Southland Conference Composite Schedule Aug. 29 Northwestern State at Missouri State (Mediacom) Incarnate Word at Central Arkansas Southeast Missouri at Southeastern Louisiana Aug. 31 Nicholls State at Oregon (FS1) McNeese State at South Florida Houston Baptist at Sam Houston State Oklahoma Panhandle State at Lamar Stephen F. Austin at Weber State Sept. 7 Southeastern Louisiana at TCU (FSN) Lamar at Louisiana Tech Nicholls State at Western Michigan (ESPN3) Southern at Northwestern State Stephen F. Austin at Texas Tech (FSN) Central Arkansas at Colorado (P12N) Arkansas-Pine Bluff at McNeese State (CSNH) Sam Houston State at Texas A&M Sept. 14 Texas Southern at Sam Houston State (CSNH) Northwestern State at Cincinnati (ESPN3) Nicholls State at Louisiana-Lafayette Southeastern Louisiana at South Dakota State McMurry at Stephen F. Austin Central Arkansas at Tennessee-Martin Lamar at Oklahoma State (FSN) West Alabama at McNeese State Sept. 21 Southeastern Louisiana at Samford Northwestern State at UAB Langston at Nicholls State Incarnate Word at Sam Houston State Montana State at Stephen F. Austin (Max) Central Arkansas at Missouri State Bacone College at Lamar Weber State at McNeese State Sept. 28 Eastern Washington at Sam Houston State (CSNH) McNeese State at Northern Iowa Lamar at Grambling Arkansas Tech at Nicholls State (HC) Langston at Northwestern State Prairie View at Stephen F. Austin Oct. 5 McNeese State at Central Arkansas* (SLCTV) Incarnate Word at Southeastern Louisiana Oct. 12 Lamar at Sam Houston State* (HC) Northwestern State at Nicholls State* (SLCTV) Nebraska-Kearney at Central Arkansas Stephen F. Austin at Southeastern Louisiana* (ESPN3) Oct. 19 Nicholls State at Stephen F. Austin* (SLCTV) Central Arkansas at Lamar* (HC; CSNH) Southeastern Louisiana at Northwestern State* (HC) Sam Houston State at McNeese State* (HC; ESPN3) Oct. 26 Northwestern State at Sam Houston State* Stephen F. Austin at Central Arkansas* (HC; SLCTV) McNeese State at Nicholls State* Lamar at Southeastern Louisiana* (HC; ESPN3) Nov. 2 Sam Houston State vs. Stephen F. Austin* (SLCTV) Nicholls State at Lamar* Southeastern Louisiana at McNeese State* Central Arkansas at Northwestern State* (ESPN3) Nov. 9 Nicholls State at Sam Houston State* Lamar at Northwestern State* (SLCTV) McNeese State at Stephen F. Austin* Southeastern Louisiana at Central Arkansas* (ESPN3) Nov. 16 Central Arkansas at Nicholls State* Sam Houston State at Southeastern Louisiana* (SLCTV) Stephen F. Austin at Lamar* Northwestern State at McNeese State* (ESPN3) Nov. 21 Nicholls State at Southeastern Louisiana* Nov. 23 Sam Houston State at Central Arkansas* Stephen F. Austin at Northwestern State* McNeese State at Lamar* * - indicates Southland Conference game
Springfield, Mo. 6 p.m. Conway, Ark. 7 p.m. Hammond, La. 7 p.m. Eugene, Ore. 3 p.m. Tampa, Fla. 6 p.m. Huntsville, Texas 6 p.m. Beaumont, Texas 7 p.m. Ogden, Utah 7 p.m. Fort Worth, Texas 11 a.m. Ruston, La. 6 p.m. Kalamazoo, Mich. 6 p.m. Natchitoches, La. 6 p.m. Lubbock, Texas 6 p.m. Boulder, Colo. 7 p.m. Lake Charles, La. 7:30 p.m. College Station, Texas TBA Huntsville, Texas 2 p.m. Cincinnati, Ohio 6 p.m. Lafayette, La. 6 p.m. Brookings, S.D. 6 p.m. Nacogdoches, Texas 6 p.m. Martin, Tenn. 6 p.m. Stillwater, Okla. 6:30 p.m. Lake Charles, La. 7 p.m. Birmingham, Ala. 2 p.m. Birmingham, Ala. 2 p.m. Thibodaux, La. 6 p.m. Huntsville, Texas 6 p.m. Nacogdoches, Texas 6 p.m. Springfield, Mo. 7 p.m. Beaumont, Texas 7 p.m. Lake Charles, La. 7 p.m. Huntsville, Texas 2 p.m. Cedar Falls, Iowa 4 p.m. Grambling, La. 6 p.m. Thibodaux, La. 6 p.m. Natchitoches, La. 6 p.m. Nacogdoches, Texas 6 p.m. Conway, Ark. 3 p.m. Hammond, La. 7 p.m. Huntsville, Texas 2 p.m. Thibodaux, La. 3 p.m. Conway, Ark. 4 p.m. Hammond, La. 7 p.m. Nacogdoches, Texas 3 p.m. Beaumont, Texas 6 p.m. Natchitoches, La. 6 p.m. Lake Charles, La. 7 p.m. Huntsville, Texas 2 p.m. Conway, Ark. 3 p.m. Thibodaux, La. 3 p.m. Hammond, La. 7 p.m. Houston, Texas 3 p.m. Beaumont, Texas 6 p.m. Lake Charles, La. 7 p.m. Natchitoches, La. 7 p.m. Huntsville, Texas 2 p.m. Natchitoches, La. 3 p.m. Nacogdoches, Texas 3 p.m. Conway, Ark. 7 p.m. Thibodaux, La. 3 p.m. Hammond, La. 3 p.m. Beaumont, Texas 6 p.m. Lake Charles, La. 7 p.m. Hammond, La. 6 p.m. Conway, Ark. 3 p.m. Natchitoches, La. 3 p.m. Beaumont, Texas 6 p.m.
93
L a m a r Fo otbal l Miscellaneous Games Season Openers Year 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 1985 1986 1987 1988 1989 2010 2011 2012
Opponent Site North Texas H Louisiana-Lafayette A Louisiana-Lafayette H Louisiana-Lafayette H Louisiana-Lafayette H Louisiana-Lafayette A Louisiana College A A&M-Corpus Christi H South Dakota A Mexico Poly H Louisiana-Monroe H Mexico Poly H Abilene Christian A East Central Okla. H East Central Okla. A Western Michigan A New Mexico State A West Texas A&M A McNeese State A West Texas A&M H Sam Houston State H Sam Houston State H New Mexico State A Drake H Houston A Northwestern State H Louisiana-Monroe H Northwestern State A Baylor A Texas Southern A Baylor A Texas State A Nicholls A Texas Southern H Texas Southern H Rice University A Rice University A West Texas A&M H Angelo State A McNeese State A Texas College H Louisiana-Lafayette A
W/L L L L W W W W W W W W W L W W L L L W W L W L W L W W L L W W L L L W L L W L L W L
Score 54-6 14-13 22-13 26-20 19-6 21-14 35-20 26-0 41-9 42-6 38-34 34-6 25-0 21-0 15-14 16-14 17-6 15-7 13-7 33-28 13-12 22-19 24-7 18-6 20-3 17-6 21-7 21-17 20-7 41-8 18-17 30-0 21-14 13-7 32-20 28-14 34-30 42-21 31-28 30-27 58-0 40-0
Record Breakdown Overall: 22-20 Home: 15-4 Road: 7-16 Longest Winning Streak: 9 games, 1954-62 Longest Losing Streak: 3 games, 3 times
Homecoming Games Year 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 1985 1986 1987 1988 1989 2010 2011 2012
Opponent W/L Score Stephen F. Austin W 26-14 Sam Houston State L 31-13 Sul Ross State W 21-0 Texas A&M-Kingsville L 18-14 Sul Ross State W 26-13 Texas A&M-Kingsville L 28-12 Sul Ross State W 67-19 Texas A&M-Kingsville W 14-0 Howard Payne L 14-12 Texas State W 7-0 Howard Payne W 33-13 Sam Houston State L 23-7 Texas A&M-Commerce L 10-0 UT Arlington W 17-7 Trinity University W 21-3 Louisiana Tech W 31-16 Trinity University W 6-0 Louisiana Tech L 34-7 Arkansas State L 20-0 UT Arlington W 24-0 Trinity University W 27-15 Nicholls W 22-15 Arkansas State W 10-7 McNeese State W 17-3 Southern Illinois W 30-10 McNeese State L 27-0 Louisiana Tech L 23-6 McNeese State L 24-23 West Texas A&M T 12-12 Arkansas State W 23-22 Stephen F. Austin L 13-10 Louisiana-Monroe L 14-0 Louisiana-Monroe L 17-0 Louisiana Tech L 22-7 Sam Houston State L 34-22 Texas A&M-Kingsville L 35-10 Louisiana-Monroe W 48-28 Mississippi College L 16-14 Arkansas State L 41-31 Langston University W 14-0 Central Arkansas L 38-24 McMurry W 52-21
Record Breakdown Overall: 21-20-1 Longest Winning Streak: 6 games, 1970-75 Longest Losing Streak: 6 games, 1981-86
Season Finales Year 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 1985 1986 1987 1988 1989 2010 2011 2012
Opponent Site Sul Ross State H Sul Ross State A Mexico Poly A Texas A&M-Kingsville H Sul Ross State H Sul Ross State A Sul Ross State H Sul Ross State A Sam Houston State A South Dakota H Middle Tenn. State* N Sam Houston State H Mexico Poly A Northern Iowa# N UT Arlington A Quantico Marines A UT Arlington A UT Arlington H UT Arlington A UT Arlington H Arkansas State H UT Arlington H UT Arlington A UT Arlington H McNeese State A UT Arlington H UT Arlington A Long Beach State H UNLV A UT Arlington H Southern Miss. A UT Arlington H McNeese State H McNeese State A McNeese State H McNeese State A McNeese State H McNeese State A McNeese State H Okla. Panhandle State H McNeese State H McNeese State W
W/L W L W L W W W W W W W L W L L L L L L W W L W W L L L W T L L L L L L L L L W W L L
Score 28-27 27-19 60-12 18-14 26-13 34-7 67-19 46-7 27-14 41-21 21-14 23-7 33-26 19-17 31-21 30-26 16-10 37-20 53-16 24-0 24-13 10-3 10-3 8-0 20-10 34-14 14-7 36-31 24-24 44-27 45-14 31-24 17-7 34-14 28-7 38-7 44-36 18-17 22-17 44-6 45-17 35-0
*-Tangerine Bowl #-Pecan Bowl Record Breakdown Overall: 17-24-1 Home: 10-11 Road: 6-12-1 Neutral: 1-1 Longest Winning Streak: 7 games, 1955-61 Longest Losing Streak: 9 games, 1980-88
95
La mar Foo tba l l All-Time Series Records Overall School W-L-T Abilene Christian 9-7-0 Alcorn State 1-1-0 Angelo State 0-1-0 Arizona State 0-1-0 Arkansas State 10-15-1 Baylor 1-2-0 Central Arkansas 0-2-0 Central Oklahoma 1-0-0 Central Missouri 1-0-0 Drake 1-3-0 East Central Oklahoma 2-0-0 Georgia State 0-1-0 Hawai`i 0-1-0 Houston 0-3-0 Howard Payne 6-2-0 Incarnate Word 1-0-0 Langston University 2-0-0 Long Beach State 1-2-0 Louisiana College 1-0-0 Louisiana-Lafayette 10-17-0 Louisiana-Monroe 6-9-1 Louisiana Tech 6-16-0 McMurry University 2-1-0 McNeese State 8-22-1 Mexico Poly 5-0-0 Middle Tennessee 1-0-0 Mississippi College 0-1-0 Mississippi State 0-2-0 Missouri State 2-0-0 UNLV 0-0-1 New Mexico State 4-6-0 Nicholls 4-1-0 North Dakota 0-1-0 North Texas 2-4-0 Northern Illinois 1-0-0 Northern Iowa 0-1-0 Northwestern State 7-7-1 Oklahoma Panhandle State 1-0-0 Pensacola Navy 1-0-0 Prairie View A&M 2-0-0 Quantico Marines 1-1-0 Rice University 0-4-0 Sam Houston State 8-16-1 San Diego Marines 0-1-0 South Alabama 0-2-0 South Dakota 3-0-0 Southeastern Louisiana 3-2-0 Southern Illinois 3-5-0 Southern Mississippi 1-3-0 Southwest Oklahoma State 1-0-0 Stephen F. Austin 14-11-0 Sul Ross State 11-1-0 Texas A&M-Commerce 5-8-0 Texas A&M-Corpus Christi 2-0-0 Texas A&M-Kingsville 3-10-1 UT Arlington 6-16-0 Texas College 1-0-0 UTEP 3-1-0 Texas Southern 2-3-0 Texas State 6-15-1 Texas Tech 0-2-0 Trinity University 5-6-0 Webber International 1-0-0 West Texas A&M 5-8-1 Western Kentucky 1-0-0 Western Michigan 0-1-0 2013 Opponents in Bold
96
Home W-L-T 4-5-0 1-0-0 ----5-7-0 0-1-0 0-1-0 1-0-0 1-0-0 1-1-0 1-0-0 ------4-1-0 1-0-0 2-0-0 1-1-0 --6-5-0 3-4-1 4-7-0 2-0-0 4-12-1 2-0-0 --0-1-0 0-1-0 1-0-0 --2-2-0 3-0-0 --1-2-0 ----3-2-1 1-0-0 1-0-0 2-0-0 1-0-0 --6-9-0 --0-1-0 2-0-0 1-1-0 3-1-0 1-0-0 1-0-0 8-5-0 6-0-0 3-5-0 2-0-0 1-7-0 4-7-0 1-0-0 --1-3-0 3-7-0 --4-2-0 1-0-0 3-3-1 -----
Road W-L-T 5-2-0 0-1-0 0-1-0 0-1-0 5-8-1 1-1-0 0-1-0 ----0-2-0 1-0-0 0-1-0 0-1-0 0-3-0 2-1-0 ----0-1-0 1-0-0 4-12-0 3-5-0 2-9-0 0-1-0 4-10-0 3-0-0 ----0-1-0 1-0-0 0-0-1 2-4-0 1-1-0 0-1-0 1-2-0 1-0-0 --4-5-0 ------0-1-0 0-4-0 1-7-1 0-1-0 0-1-0 1-0-0 2-1-0 0-4-0 0-3-0 --6-6-0 5-1-0 2-3-0 --2-3-1 2-9-0 --3-1-0 1-0-0 3-8-1 0-2-0 1-4-0 --2-5-0 1-0-0 0-1-0
n
1951-Present Neutral W-L-T --------------------------------------------------1-0-0 ------------------0-1-0 ------------1-0-0 -----------------------------------------------
First Game 1953 1988 1989 1988 1964 1979 2011 1986 1971 1973 1964 2010 2012 1975 1957 2011 2010 1976 1957 1952 1961 1959 1953 1951 1953 1961 1988 1971 1964 1979 1964 1972 2010 1951 1987 1964 1951 2010 1965 1985 1966 1984 1951 1964 2010 1959 1967 1968 1974 1951 1951 1951 1951 1955 1954 1964 2011 1972 1980 1951 1987 1951 2010 1965 1979 1966
Last Game 1972 1989 1989 1988 1989 1981 2012 1986 1971 1980 1965 2010 2012 1983 1973 2011 2012 1978 1957 2012 1988 1986 2012 2012 1963 1961 1988 1974 1966 1979 1976 2012 2010 1986 1987 1964 2012 2010 1965 2012 1967 1987 2012 1964 2011 2010 2012 1978 1981 1951 2012 1963 1963 1958 1987 1985 2011 1989 1985 2011 1988 1971 2010 1989 1979 1966
L a m a r Fo otbal l All-Time Series Results Abilene Christian 1953 H L 1954 A L 1959 A W 1960 H L 1961 A W 1962 H W 1963 A L 1964 H W 1965 A W 1966 H W 1967 A W 1968 H L 1969 H L 1970 H L 1971 A W 1972 H W
26-21 33-14 8-7 20-7 25-10 13-6 25-0 14-3 28-18 42-16 54-13 38-14 22-9 42-27 30-28 31-10
Alcorn State 1988 H 1989 A
35-6 32-16
Angelo State 1989 A
W L L
31-28
Arizona State 1988 A L
24-13
Arkansas State 1964 A T 1965 H W 1966 A W 1967 H W 1968 A L 1969 A L 1970 A L 1971 H W 1972 A W 1973 H W 1974 A W 1975 H L 1976 A L 1977 H L 1978 A L 1979 A W 1980 H W 1981 A L 1982 H L 1983 H L 1984 A L 1985 H L 1986 A L 1987 H L 1988 A W 1989 H L
7-7 20-7 17-0 28-23 48-17 20-0 69-7 24-13 26-24 10-7 10-6 17-0 31-0 10-6 6-3 20-10 23-22 16-9 20-19 24-14 37-13 21-0 56-7 34-20 21-17 41-31
Baylor 1979 A 1980 H 1981 A
L L W
20-7 42-7 18-17
Central Arkansas 2011 H L 2012 A L
38-24 24-14
Central Missouri 1971 H W
35-6
Central Okla. (Central State) 1986 H W 47-23
Drake 1973 1974 1977 1980
A H A H
L W L L
24-10 18-6 43-21 38-7
East Central Oklahoma 1964 H W 21-0 1965 A W 15-14 Georgia State 2010 A L
23-17
Hawai`i 2012 A
L
54-2
Houston 1975 A 1982 A 1983 A
L L L
20-3 48-3 42-35
Howard Payne 1957 H W 1958 A L 1959 H L 1960 A W 1961 H W 1962 A W 1963 H W 1973 H W
18-13 24-19 14-12 12-7 33-13 21-10 35-0 21-17
Incarnate Word 2011 H W
45-35
Langston University 2010 H W 2012 H W
14-0 31-0
Long Beach State 1976 H L 1977 A L 1978 H W
21-10 21-7 36-31
Louisiana College 1957 A W
35-20
Louisiana-Lafayette 1952 A L 1953 H L 1954 H W 1955 H W 1956 A W 1957 H W 1965 H L 1966 A L 1967 H W 1968 A L 1969 A L 1970 A L 1971 H L 1972 A W 1973 A W 1974 A W 1975 A L 1976 H L 1977 H L 1978 A L 1979 H W 1980 A L 1981 H W 1982 A L 1983 A L
14-13 22-13 26-20 19-6 21-14 36-20 20-6 16-14 14-13 20-14 24-16 15-6 21-20 3-0 31-0 38-13 21-12 34-9 10-6 23-16 21-17 28-10 14-12 24-0 31-6
1989 2012
n
1951-Present
A A
L L
42-33 40-0
Louisiana-Monroe 1961 H W 1962 A W 1975 A L 1976 A L 1977 H W 1978 H T 1979 A W 1980 H L 1981 A W 1982 H L 1983 H L 1984 A L 1985 H L 1986 A L 1987 H W 1988 A L
38-34 14-0 34-7 16-6 21-7 17-17 21-7 28-6 17-13 14-0 17-0 34-14 37-14 22-21 48-28 24-3
Louisiana Tech 1959 H W 1960 A L 1966 H W 1967 A L 1968 H L 1969 A L 1970 H W 1971 A L 1973 H L 1974 A L 1975 H L 1976 A L 1977 H L 1978 A L 1979 H W 1980 A L 1981 H L 1982 A W 1983 A W 1984 H L 1985 A L 1986 H L
13-6 20-0 31-16 41-31 34-7 77-40 6-0 26-7 17-3 28-0 24-10 37-7 7-6 40-3 19-17 28-6 16-7 40-13 18-12 22-7 23-22 39-20
McMurry University 1953 A L 32-27 1954 H W 19-13 2012 H W 52-21 McNeese State 1951 A 1952 H 1955 A 1956 H 1966 H 1967 A 1968 H 1969 A 1970 H 1971 A 1972 A 1973 A 1974 H 1975 A 1976 H 1977 A 1978 H 1979 H 1980 H 1981 H 1982 A
L L L W W W L W L L L L W L L W L L L T W
13-7 42-7 17-2 18-14 10-7 24-8 10-0 13-7 17-12 38-0 17-7 20-17 17-3 20-10 27-0 35-7 24-23 34-25 35-3 20-20 12-3
1983 1984 1985 1986 1987 1988 1989 2010 2011 2012
H A H A H A H A H A
Mexico Poly 1953 A 1960 H 1961 H 1962 H 1963 A
L L L L L L W L L L
17-7 34-14 28-7 38-7 44-36 18-17 22-17 30-27 45-17 35-0
W W W W W
60-12 42-6 62-22 34-6 33-26
Middle Tennessee 1961 N W N - Tangerine Bowl
21-14
Mississippi College 1988 H L
16-14
Mississippi State 1971 A L 1974 H L
24-7 37-21
Missouri State 1964 A W 1966 H W
14-7 55-12
UNLV 1979
T
24-24
New Mexico State 1964 H W 1965 A L 1967 A L 1968 H L 1969 H W 1970 A L 1972 A W 1973 A L 1975 H L 1976 A W
21-14 21-20 17-6 16-14 9-7 69-37 24-19 24-7 17-14 21-17
Nicholls 1972 1983 1984 2011 2012
W L W W W
22-10 21-14 20-16 34-26 34-24
North Dakota 2010 A L
31-6
A
H A H A H
North Texas 1951 H 1974 A 1983 A 1984 H 1985 A 1986 H
L W L W L L
54-6 27-7 10-0 10-6 20-0 33-13
Northern Illinois 1987 A W
39-35
Northern Iowa 1964 N L N - Pecan Bowl
19-17
97
La mar Foo tba l l All-Time Series Results Northwestern State 1951 A W 1952 H W 1953 A L 1954 H L 1955 A L 1956 H T 1957 A W 1959 A W 1960 A W 1976 H W 1977 A L 1978 A L 1979 H W 2011 H L 2012 A L
32-20 35-13 12-6 22-13 7-6 6-6 20-10 19-0 21-13 17-6 43-0 21-17 28-13 37-17 30-23
Oklahoma Panhandle State 2010 H W 44-6 Pensacola Navy 1965 H W
37-0
Prairie View A&M 1985 H W 2012 H W
30-7 31-0
Quantico Marines 1966 A L 1967 H W
30-26 41-6
Rice University 1984 A L 1985 A L 1986 A L 1987 A L
36-19 29-28 28-14 34-30
Sam Houston State 1951 A L 1952 H L 1953 A L 1954 H W 1955 A L 1956 H L 1957 A T 1958 H W 1959 A W 1960 H W 1961 A L 1962 H L 1971 H L 1972 H W 1981 N W 1982 H W 1984 A L 1985 H L 1986 A L 1987 H L 1988 H L 1989 H W 2010 H L 2011 A L 2012 H L N-Houston Astrodome
33-14 31-13 43-0 6-0 46-14 20-6 7-7 20-7 27-14 18-7 9-7 23-7 13-12 22-19 50-7 27-7 27-11 34-22 24-13 34-21 16-14 41-0 38-10 66-0 56-7
San Diego Marines 1964 A L
33-28
South Alabama 2010 H L 2011 A L
98
26-0 30-8
South Dakota 1959 A W 1960 H W 2010 H W
41-9 41-21 24-20
Southeastern Louisiana 1967 H W 34-21 1969 A L 21-19 2010 A W 29-28 2011 A W 48-38 2012 H L 31-21 Southern Illinois 1968 A L 1969 H W 1970 A L 1972 H W 1975 H W 1976 A L 1977 A L 1978 H L
24-7 20-16 32-16 7-0 30-10 19-7 9-5 22-20
Southern Mississippi 1974 H W 1975 A L 1980 A L 1981 A L
10-7 43-3 36-10 45-14
Southwest Oklahoma State 1951 H W 43-21 Stephen F. Austin 1951 H W 1952 A W 1953 H W 1954 A L 1955 H L 1956 A L 1957 H W 1958 A W 1959 H W 1960 A W 1961 H W 1962 A W 1963 H L 1978 H W 1980 A W 1981 H L 1982 A W 1983 H W 1986 A L 1987 H W 1988 A L 1989 H L 2010 A L 2011 H L 2012 A L
26-14 27-6 19-13 20-7 20-8 26-18 27-12 35-6 7-6 14-0 34-22 27-12 27-6 23-16 45-21 13-10 24-14 24-23 38-25 28-26 26-14 44-20 71-3 69-10 40-26
Sul Ross State 1951 H 1952 A 1953 H 1955 H 1956 A 1957 H 1958 A 1959 H 1960 A 1961 H 1962 A 1963 H
28-27 27-19 21-0 26-13 34-7 67-19 46-7 32-0 20-6 34-0 28-14 15-7
W L W W W W W W W W W W
n
1951-Present
Texas A&M-Commerce (East Texas State) 1951 A L 47-7 1952 H L 48-0 1953 A L 32-13 1954 H L 16-14 1955 A L 33-7 1956 H W 20-7 1957 A W 7-6 1958 H W 21-0 1959 H L 14-3 1960 H L 27-0 1961 H W 14-7 1962 A W 28-6 1963 H L 10-0 Texas A&M-Corpus Christi 1955 A W 29-2 1958 A W 26-0 Texas A&M-Kingsville (Texas A&I) 1954 H L 18-14 1955 A W 20-9 1956 H L 28-12 1957 A T 13-13 1958 H W 14-0 1959 A L 14-6 1960 H L 40-0 1961 A L 8-7 1962 H L 7-0 1963 A W 16-14 1964 H L 13-12 1965 H L 14-6 1986 H L 35-10 1987 A L 43-14 UT Arlington 1964 H 1965 A 1966 H 1967 A 1968 H 1969 A 1970 H 1971 A 1972 H 1973 A 1974 H 1975 A 1976 H 1977 A 1978 H 1979 A 1980 H 1981 A 1982 H 1983 A 1984 H 1985 A
W L W L L L W W L W W L L L L L L L L L L L
17-7 31-21 27-7 16-10 37-20 53-16 24-0 23-14 10-3 10-3 8-0 37-24 34-14 14-7 37-17 47-37 44-27 31-7 31-24 21-0 13-10 37-17
Texas College 2011 H W
58-0
UTEP 1972 1973 1987 1989
A A A A
W W L W
42-28 31-27 38-14 21-19
Texas Southern 1980 A W
41-8
1982 1983 1984 1985
H H H H
L L L W
28-17 15-14 13-7 32-20
Texas State (Southwest Texas) 1951 H L 1952 A L 1953 H L 1954 A L 1955 H L 1956 A L 1957 H W 1958 A L 1959 A W 1960 H W 1961 A T 1962 H L 1963 A L 1981 H L 1982 A L 1984 H L 1985 A W 1986 H W 1987 A L 1988 H L 1989 A W 2011 A L
14-13 33-26 14-6 13-12 14-7 13-6 33-20 8-7 28-6 7-0 7-7 20-13 13-7 24-7 30-0 23-0 24-21 17-3 27-19 27-26 20-19 46-21
Texas Tech 1987 A 1988 A
L L
43-14 59-28
Trinity University 1951 H L 1952 A L 1963 H W 1964 A W 1965 H W 1966 A L 1967 H W 1968 A L 1969 H L 1970 A L 1971 H W
41-20 66-7 20-18 14-7 21-3 23-14 6-0 24-20 22-0 37-31 27-15
Webber International 2010 H W 21-14 West Texas A&M (West Texas State) 1965 H W 1968 A L 1970 H W 1971 A L 1972 A L 1973 H L 1974 A W 1975 H L 1976 A L 1977 H L 1978 A L 1979 H T 1988 H W 1989 A W
21-14 45-7 33-28 14-6 35-12 13-0 9-7 10-6 21-6 27-9 55-16 12-12 42-21 49-17
Western Kentucky 1979 A W
58-27
Western Michigan 1966 A L
16-14
Football History
La mar Foo tba l l Lamar Football History From its birth as South Park Junior College in 1923, to its days as Lamar College, the ones as Lamar State College of Technology (Lamar Tech) and, finally, as Lamar University, the Cardinals have had an up-and-down – yet rich-andproud football tradition. Actually, when South Park JC’s football players took the field for the first time only 12 days after the opening of the institution on Sept. 17, 1923, the team didn’t have a nickname. The players, who defeated South Park High School 25-0 at Beaumont’s old Magnolia Park that afternoon were identified as “the collegians” by sports writer Spike Cooper in the next day’s Beaumont Enterprise. Playing center for South Park JC in that first game was John Gray, later to serve the school as football coach from 1932 to 1939 and during two tenures as university president. Star running back for “the collegians” that day was Paul (Hog) Kinnear, and the team captain was fullback Ernest (Gus) Laminack. During its seven-game inaugural season, South Park JC played two high schools, three senior colleges and two senior college freshman teams and compiled a 2-4-1 record. The other win was a 10-0 decision over Stephen F. Austin College and the tie was 0-0 against Port Arthur High School. After the team’s midseason loss of 19-16 to Southwestern Louisiana, The Enterprise’s Cooper wrote, “From end to end and fullback to center, the collegians are the fightingest little football team we’ve ever seen.” Dunlap (Bull) Johnson became South Park JC’s football coach in 1924, and the 25-player team responded with a splendid 7-3 season. The team rolled up a combined 122 points in throwing four-successive shutouts to open the E.A. “Beans” LaBauve was a season, and 1979 inductee to the Cardinal the student Hall of Honor. body selected Brahmas the nickname for the school’s athletic teams. In a 23-0 victory over Rusk Junior College to com-
100
plete the shutout streak, star quarterback F.S. (Spud) Braden completed 13 of 18 passes for 190 yards, statistics uncommon to football in those days of run, run and run some more. The University of Texas freshman team handed the Brahmas their first loss 9-7, and their other defeats came against Southwestern Louisiana 20-8 and the Rice University freshmen 7-6. The Brahmas wore red jerseys for the first time that season, shedding the green and white colors of South Park High School. The 1925 season saw the Brahmas under the tutelage of yet another coach – Lilburn Dimmitt, and they slumped to a 1-5-2 record with the lone win being 6-0 over Beaumont High. The ties were 2-2 with the Rice freshmen and 0-0 with Stephen F. Austin College. Gray completed his three-year South Park JC playing career that season and at the unbelievably young age of 19 became head coach at South Park High School in 1926. As in the previous three seasons, the 1926 Brahmas had a new head football coach as Joe J. Vincent took over and guided them to a 2-4 record. The wins were 25-0 over Victoria Junior College and 9-0 over Sam Houston State. The 1930s With the home crowds dwindling below the 300 level for most of the 1926 season, the football program was discontinued for five years, but it returned in 1932 when the school name was changed to Lamar College in honor of Mirabeau Lamar, known as the founder of Texas education. Former South Park JC basketball star Otho Plummer, later to serve the university for many years as a member of the board of regents, picked Cardinals as the new school mascot. After compiling a 35-20-5 record in six seasons at South Park High School, Gray became Lamar College’s first football coach and guided the Cardinals to a 40-30-4 record over eight seasons, beginning with a fine 8-1 mark in 1932. The wins included a 39-0 blitzing of Blinn College, and the lone loss was 6-0 to the SMU freshmen in the mud and rain in Greenie Stadium on Thanksgiving Day. A blocked punt at the 3-yard line led to the game’s only touchdown. Season tickets for seven home games in 1932 were $1.50 each, a far cry from the $60 to $400 price range for season tickets for this year’s second season of Lamar football after its return from a 21-year hiatus. Another indication of how much football has changed over the years is that the average weight for the 1932 Cardinals
was 158 pounds per man. Quarterback Jake Verde, who later played his senior college football at Texas, led the 1932 Cardinals by running for four touchdowns and passing for six John Gray became head more, and he coach in 1932 and compiled also served as a 40-30-4 record over eight seasons. the team’s kicker. The gem of the Cardinals’ 1932 season was their 6-0 victory over heavily-favored Southwestern Louisiana, sparked by a 35-yard Verde-to-Ernest Byerly touchdown pass and two fourth-quarter interceptions by Ovey Babin. By 1933, there were enough junior colleges playing football in Texas for the state to divide into sections and originate a plan to determine a state champion. Although the Cardinals weren’t as strong as they had been the previous year, they advanced to the state championship game but lost it to Amarillo Junior College 2714 in Beaumont’s Purple Stadium in mid-December. The Cardinals logged a 5-3-2 record during the regular season in 1933 and defeated Schreiner Institute 20-14 in the first round of the state playoffs. Defense was the trademark of that team as the Cardinals held nine opponents to seven or fewer points, although two of those games were scoreless ties. Actually, the tone for the season was set in the Cardinals’ opener when they piled up a whopping 24-4 advantage over East Texas Baptist in first downs and a 408-101 lead in total yards but lost on the scoreboard 7-6. Just past the mid-point of that season, nine different players scored 10 touchdowns as the Cardinals rang up a 71-0 blanking of Blinn College. Two weeks later, Verde exploded for touchdown runs of 83 and 67 yards, and he returned an interception 50 yards for another score in a 40-7 romp over Victoria Junior College. A near-perfect 7-0-1 regular season catapulted the 1934 Cardinals into the state playoffs again, and they edged Schreiner Institute 7-6 in their semifinal matchup. The Cards had to travel to the Panhandle, however, for their rematch
L a m a r Fo otbal l with Amarillo Junior College in the championship game which they lost 34-7 despite being in a 7-7 tie at halftime. Early that season, the Cardinals won backto-back games against the Texas Shorthorns (the University of Texas’ freshman team) by the scores of 7-0 and 16-0, and they also tossed shutouts of 32-0 and 19-0 over St. Mary’s University and Victoria Junior College. The 1935 Cardinals slumped to a 4-2-1 regular-season record and lost their state playoff opener 20-0 to Schreiner Institute. The season was highlighted by a six-day railroad trip to Mexico City to oppose Mexico Poly in the first of several games played between the institutions over the coming years. Although the Cardinals posted a so-so 2-3 regular-season record in 1936, they qualified for the playoffs and came within 15 yards of winning a state title. Kilgore College held off a late Lamar drive at the 15-yard line to preserve its 10-7 championship win on Dec. 5, in Greenie Stadium. The 1937 Cardinals went 5-3 during the regular season and lost their playoff opener 14-6 to Schreiner Institute. They then hosted Mexico Poly in an exhibition game that they won 27-13. The final two seasons of the 1930s decade saw the Cardinals dip to records of 2-6-1 and 2-7. They suffered four shutouts in 1939 when they scored more than seven points in only one game – an 18-0 win over Texas Lutheran College. The 1939 season marked the end of the John Gray Era as football coach. In an article in The Houston Post, sports writer L.R. Goldman wrote, “John Gray always performed miracles with the material he had. He had the ability to get 110 percent from his players.” The 1940s R.M. (Monk) Hodgkiss moved over from South Park High School to succeed the popular Gray as head coach for the 1940 season. The Cardinals failed to even register a first down in his debut – a 27-0 loss to Kilgore College, and the Cards suffered three more shutouts during a lackluster 2-4-1 season. With victories in the last two games, Hodgkiss coaxed a break-even 4-4 season out of the Cardinals in 1941. Among the Cardinal players that year were Oail (Bum) Phillips and Theo (Cotton) Miles, both of whom went on to establish great reputations as football coaches – Miles at the high school level and Phillips at the high school, college and professional levels. With World War II escalating overseas, Lamar played the 1942 season with only 23 players, and the team went 2-6-1 under new head
coach Ted Dawson. The school then discontinued football for the remaining war years of 1943, 1944 and 1945. In 1946, Lamar College joined Tarleton State, Kilgore College, North Texas Agricultural College (the forerunner Bob Frederick to UT Arlington), Paris starred in football, Junior College, San Anbasketball and gelo JC and Schreiner Inbaseball at Lamar. stitute in creating the Southwestern Junior College Conference. Each school was obligated to field teams in football, basketball, track, tennis and golf, so thusly, Lamar’s first all-round intercollegiate athletic program developed. The Cardinals returned to the football field with resounding success in 1946, carving an 82 record under new coach Ted Jefferies, who won a state championship at Wichita Falls High School in 1941. As did many other hard-nosed veterans, Bum Phillips returned from the war and captained the 1946 team that launched its season with an 83-0 dismantling of Decatur Baptist College. The Cardinals registered five other shutouts in 1946, and they outscored their opponents by a combined 241-37. Chick Forwald joined Lamar as head coach in 1947, and the Cardinals slipped to a 4-6 record. Stan Lambert became Lamar’s head football coach in 1948 and promptly guided the Cardinals to a 7-4 regular-season record and the school’s first berth in a bowl game. Playing before a home crowd in the season-ending Spindletop Bowl, the Cardinals easily disposed of Hinds (Miss.) Junior College 21-0. Cardinal stars that season included quarterback Joe Westerman, end Bob Frederick, running back Jimmy McNeil and offensive and defensive back Francis (Smitty) Hill. Lamar made its swan song as a junior college football program a huge success in 1949 by roaring to a Southwestern Junior College cochampionship, a 10-2 record and two post-season bowl games. Along the way, the Cardinals scored a school-record 346 points. At the conclusion of the season, the Cardinals lost a 21-20 heartbreaker to Pearl River (Miss.) in the Memorial Bowl in Jackson, Miss. Back home in the Spindletop Bowl, the Cards rolled to a 35-14 win over Georgia Military Institute behind the running and passing of McNeil and two touchdown catches by Frederick.
The 1950s Although it remained a junior college for one last year, Lamar began its transition to senior college status by lining up an all-senior-college schedule for the 1950 season. Despite being outmanned by some teams, Lambert’s Cardinals managed a 5-4-1 record highlighted by victories of 34-7 over Southwest Oklahoma State and 75-0 over Daniel Baker College. The Cardinals intercepted six passes in the win over Southwest Oklahoma, and eight different Cardinals scored at least one touchdown in the rout of Daniel Baker College. Lamar’s name changed to Lamar State College of Technology for its first official season as a four-year institution in 1951 – one that saw the Cardinals go 6-4 overall and 2-3 in the Lone Star Conference. That season saw the emergence of wiry running back Sammy Carpenter, a 144-pounder from Orange, as Lamar’s first real superstar. He rushed for 607 yards and scored 54 points as a freshman. In his sophomore season of 1952, Carpenter set long-lasting s c h o o l records of 210 rushing yards vs. Sul Ross State, 1,005 rushing yards for the season and 13 touchdowns for 78 points in the sea- J.B. Higgins coached Lamar’s son. The 210 only undefeated team to an 8-0-2 record in 1957. yards stood until Burton Murchison broke the mark with 222 yards vs. Prairie View A&M and then 259 yards vs. Rice later in the 1985 season; the 1,005 yards stood until Murchison ran for 1,547 in 1985, and the 78 points in a season remain a school record. After winning two of their first three games in 1952, the Cardinals stumbled to six-straight losses and a 2-7 record marred by losses of 480 to East Texas State and 66-7 to Trinity University. When Lambert moved up to director of athletics in 1953, his top assistant J.B. Higgins took over as head coach and began what would become the most successful era in Lamar’s football history. Known affectionately as “Hig” by his friends,
101
La mar Foo tba l l Higgins went 3-7 in each of his first two seasons, but improvement began to show in 1955 (4-6 record) and 1956 (4-4-1). The Cardinals then enjoyed the school’s only undefeated Sammy Carpenter had Lamar’s record with 8-0-2 first 1,000-yard rushing season an mark in with 1,005 yards in 1951. 1957. Carpenter ended his senior season in 1954 with 2,703 career rushing yards, a figure that now ranks second only to the 3,598 yards compiled by Murchison over the 1984-1987 seasons. Higgins, who compiled a 59-38-4 record in his 10-season tenure as head coach, pointed to the 4-4-1 1956 season as being the most pivotal for Lamar’s improving program. The Cardinals gave an indication of what was to come in the near future when they clobbered Sul Ross State 34-7 in their finale. Ties of 7-7 with Sam Houston State and 1313 with Texas A&I were the only glitches in the Cardinals’ superb 1957 season that saw 270pound offensive and defensive lineman Dudley Meredith become Lamar’s first bona-fide AllAmerica selection. The ties forced the Cardinals to share the Lone Star Conference championship with East Texas State, a team they edged 7-6. In their season finale, the Cards rolled up a then school-record 562 yards of total offense in a 67-19 trouncing of Sul Ross State. For an encore in 1958, the Cardinals got defensive-minded as they led the LSC in rushing defense, passing defense and total defense while carving a 6-2 record. Their losses – in back-toback games against Howard Payne and Southwest Texas State – were by a total of six points, and they outscored their opposition by 188-52 for the season. By winning their first seven games in 1959, the Cardinals climbed to No. 1 in the nation in all of the college division polls. They outscored their opponents by a 21.1-4.9 average margin during that streak that ended with a 14-12 loss to Howard Payne. They also lost their next two games to Texas A&I and East Texas State before closing their 8-3 season with a 27-14 victory over Sam Houston State. Guard John Donaho and fullback Shepard
102
Touchett were All-LSC performers for the Cardinals in 1959, and Ronnie Fontenot led the team in rushing with 551 yards. The 1960s For the seventh-straight year, Lamar won its season opener in 1960 as scatbacks Jimmy Davis and Ronnie Fontenot dazzled the Mexico Poly Burros with broken-field running in a 426 victory played before a crowd of 3,000 in Port Neches. Higgins’ Cardinals went on to post eight wins for the second-straight season and the third time in four years as they went 8-4, including a 5-2 mark in the LSC. Davis had 123 rushing yards and Fontenot 111 in the win over Mexico Poly, and that game marked the starting debut for Windell Hebert, who went on to become one of Lamar’s most durable and reliable quarterbacks. A 20-0 loss to Louisiana Tech in Week 2 was Lamar’s first by shutout in seven years, but the Cardinals were blanked twice more during the season – by Texas A&I and by East Texas State. They rebounded, however, to win their final two games 18-7 over Sam Houston State and 41-21 over South Dakota. With 457 yards, Fontenot led the team in rushing for a second-straight season, and he earned All-LSC recognition along with guard Nader Bood. That season also saw the emergence of Bobby Jancik, who later was American Football League Rookie of the Year as a defensive back for the 1962 Houston Oilers. Jancik reached stardom and Little All-America status the next season as he helped lead Higgins’ Cardinals to an 8-2-1 record and a berth in the 1961 Tangerine Bowl, the top postseason game for College Division schools. He scored 62 points, rushed for 302 yards and caught 16 passes for an additional 357 yards, including fourth-quarter touchdown snares of 64 and 55 yards in a 38-34 come-from-behind win over Northeast Louisiana in the Cardinals’ season opener.. The 1961 Cardinals scored 282 points to set a school record that stood until the 1987 team bettered it by a scant point. Joining Jancik as offensive mainstays that season were Hebert, Fontenot, Jimmy Davis, Armour McManus and Ralph Stone. Hebert, who passed for 1,214 yards and 11 touchdowns that year, was stunned by the death of his mother at mid-season but two days later threw for 109 yards in a 33-13 victory over Howard Payne before a crowd of 9,000 in Greenie Stadium. Defensive leaders in 1961 included linebacker Lindley King from Orange and safety David Webb, who intercepted a still-standing school-record seven passes.
The J.B. Higgins era as head coach ended after the 1962 season during which the Cardinals posted a 7-3 record to improve his 10-season record to 58-38-4. Two of the Cards’ losses that season were seven-point LSC decisions to Texas A&I and Southwest Texas State, both ranked in the NAIA’s Top 10. Hebert threw for a then school-record 231 yards in the loss to Southwest Texas, and he finished his senior season with 81 completions for 1,112 yards and seven TDs. King was both a first-team All-LSC and first-team Little AllAmerica selection. As Lamar moved from the NAIA and the Lone Star Conference to the NCAA and the Southland Conference in 1963, Vernon Glass succeeded Higgins as head football coach. The former Rice University quarterback and Baylor University assistant coach went on to win a school-record 63 games over an up-and-down 13-season career with the Cardinals. The popular Glass got off to a 5-4 start in 1963, and his up seasons included marks of 73 in 1967, 8-3 in 1972 and 8-2 in 1974. Glass’ down seasons saw the Cardinals go 0-10 in 1968 and 1-10 in 1975, his last year. At the mid-point of his first season as head coach, Glass made the bold move of turning over the quarterback reins to Phillip Primm, a red-headed freshman who eventually led the Cardinals to three-straight SLC championships. He led the Cardinals in passing and total offense in each of his four seasons and remains No. 2 career-wise in both categories with 4,036 passing yards and 4,379 total yards. Lamar football moved on campus for the first time in 1964 as the Cardinals christened 17,150-seat Cardinal Stadium with a 21-0 victory over East Central Oklahoma. Darrell Johnson scored the first touchdown in stadium history on a 30-yard run in the second quarter, and the Cardinals went on to post a 6-3-1 record, win the SLC championship and earn a berth in the 1964 Pecan Bowl. The Cardinals’ losses that season were by a Jake David was an All-Southc o m b i n e d land Conference player for the Cardinals in 1965 & 1966. eight points –
L a m a r Fo otbal l 33-28 to the San Diego Marines, 13-12 to Texas A&I and 19-17 to State College of Iowa in the Pecan Bowl. While Primm, Harold LaFitte and Dan Yezak led the offense that season, lineman Anthony Guillory and linebacker Vernon McManus sparked the defense. A gem to the 1964 season was a non-conference, 21-14 victory over major college foe New Mexico State. Primm helped spark that win by completing 12 of 18 passes for 130 yards. Although Primm was plagued by injuries, the Cardinals managed a 6-4 record and another SLC championship in 1965. Primm’s two-point conversion pass to Frazer Dealy in the last two minutes enabled the Cards to nip East Central Oklahoma 15-14 in their opener, and they won three of their next four games before suffering back-to-back losses to Texas A&I and Southwestern Louisiana. Included in the early-season burst was a 20-7 victory over Arkansas State witnessed by a then-record crowd of 16,000 in Cardinal Stadium. The Cardinals clinched the SLC championship with a 21-3 triumph over Trinity University in which fullback Eugene Washington reeled off a then school-record 85-yard TD run. Primm, McManus, LaFitte, Jake David, Dick Croxton, Ed Marcontell, Bill Kilgore and Mike Allman were All-SLC picks that season. With Primm passing for a then school-record 1,549 yards, the 1966 Cardinals shared the SLC championship with Texas-Arlington, a team they defeated 27-7. A 23-14 loss to Trinity University prevented the Cards from winning the title outright. Primm hit his high water mark of the season by completing 14 of 18 passes for 224 yards and four TDs in a 42-16 SLC romp over Abilene Christian, and linebacker Danny Jones led the Cards with 15 tackles in a 17-0 blanking of Arkansas State. Another big win that season was a 31-16 decision over Terry Bradshaw-led Louisiana Tech. Lamar’s bid for a fourth-successive SLC championship ended in the final game of the 1967 season when Skipper Butler kicked three field goals to help UTA defeat the Cards 16-10. Still, they won seven-straight games over one stretch and finished the season with a fine 7-3 record. Randy McCollum took over as starting quarterback that season and came within 16 yards of Primm’s then school record with 1,533 passing yards. Tommie Smiley, a 232-pound running back, was the team’s leading rusher with 890 yards. Croxton became the first Cardinal to earn a third-successive All-SLC award, and Kilgore, Johnny Fuller and offensive guard Spergon Wynn were all picked for a second time, while
Darrell Mingle, Richard Bjerke and Bill Groberg were firstyear picks. T h e Cardinals came close to winning three times during their 0-10 1968 season, but they never quite pulled off the Coach Vernon Glass guided the Cardinals to Southland needed big Conference Championships in play in losses of 16-14 to 1964, 1965, 1966 & 1971. New Mexico State, 20-14 to Southwestern Louisiana and 2420 to Trinity. Still, sophomore split end Ronnie Gebauer caught a then school-record 56 passes for 831 yards, and defensive tackle Richard Cummings and defensive back Benny Lansford were All-SLC performers. The Cardinals ended the 1960s decade with a 3-7 record in 1969 but went 0-4 in the SLC. Their wins came against McNeese State, New Mexico State and Southern Illinois in their first four games, and they ended the season with sixstraight losses. An example of the Cardinals’ futility that season came in their game against Louisiana Tech. Quarterback Tommy Tomlin threw for 308 yards and a school-record six touchdowns, but he didn’t come close to matching the numbers put up by Terry Bradshaw in a 77-40 Tech win. The 1970s The 1970 Cardinals started their season impressively, upsetting West Texas State 33-28 as Tomlin completed 12 of 14 passes and then holding off Louisiana Tech 6-0 in a rainstorm in Cardinal Stadium in Week 2. A 32-16 road loss to Southern Illinois sidetracked the Cards the next week, and Tomlin went down with a practice injury a few days later that kept him our of action for four games. The Cards went on to lose six more games in a row before blanking Texas-Arlington 24-0 in the finale of their 3-7 season. They surrendered 309 points in 10 games, a dubious record that stood until the 1986 and 1987 teams gave up 339 and 386 points in back-to-back seasons. Gebauer had 39 catches for 540 yards in 1970 to become the first and still only Cardinal
to amass more than 2,000 receiving yards. His 149 career catches and 2,098 career yards remain at the top of Lamar’s career lists. Also, Bennie Lansford finished his career that year with a still-standing 14 interceptions. With Lamar languishing with a 1-4 record at the midpoint of the 1971 season, Glass rolled the dice by switching from the I Formation on offense to the Wishbone T. With squatty quarterback Glen Hill at the controls of the Wishbone, it produced four-successive wins to close the season and a tie with Louisiana Tech and Trinity University for the SLC championship. The streak started with a 30-28 win over Abilene Christian in which Hill rushed for 100 yards and kicked the winning 30-yard field goal. Glass’ 1972 Cardinals pulled off a 42-28 road upset of Texas-El Paso in their second game and went on to post a fine 8-3 record. Doug Matthews, later to become Galveston’s city manager and a Lamar regent, rushed for 101 yards in the UTEP game and for a team-best 689 yards for the season. A first-quarter field goal of 41 yards by Mike Drake stood up as the Cardinals defeated Southwestern Louisiana 3-0 as cornerback Donald Hill sparked the defense with two interceptions. Another highlight to the season was Matthews’ 135-yard rushing performance in a 25-19 road victory over New Mexico State. Matthews, offensive tackle Charles Cantrell, split end Joe Bowser and safety Rondy Colbert were all first-team All-SLC selections. Lamar gained major college classification in football for the 1973 season, and the Cardinals compiled a 5-5 record against a beefed-up schedule that included road games at New Mexico State, Drake University and Texas-El Paso. They scored 17 fourth-quarter points to win the UTEP game 31-27 as Bobby Flores passed 8 yards to Steve DeRouen for the winning touchdown with a mere 12 seconds remaining. The Cardinals also scored late in their matching 10-7 SLC wins over Arkansas State and Texas-Arlington. Flores threw 11 yards to Larry Spears for the clinching score against Arkansas State, and Jabo Leonard booted a 27-yard field goal for the winning points against UTA. Joe Bowser, who led the Cardinals in receiving with 38 catches for 545 yards and three TDs, was their lone offensive representative on the 1973 All-SLC First Team, while end Leon Babineaux and safety Rondy Colbert, who later played in the NFL, were defensive first-teamers. Bolstered by nine returning offensive starters and 10 defensive regulars from the 1973 team, Glass’ 1974 Cardinals went on to post a fine 82 season. They won six of their first seven games, and their only losses were 37-21 to Mississippi State and 28-0 to perennially-tough
103
La mar Foo tba l l Louisiana Tech. Fullback Dale Spence ran for two TDs in the Cardinals’ 18-6 season-opening victory over Drake University, and a 64-yard scoring pass from Flores to Larry Spears helped spark their 27-7 triumph at North Texas State the next week. Flores ran for two TDs, and cornerback Audwin Samuel returned an interception 60 yards for another score as the Cardinals defeated Southwestern Louisiana 38-13 in Week 3. While subbing for the injured Flores in the Cardinals’ SLC opener at Arkansas State, Al Rabb connected with running back Anthony Pendland for a 65-yard TD pass with 2:11 left to give LU a 10-6 win. The Cardiac Cardinals did it again the next week as Donald Hill’s 29yard interception return set up Jabo Leonard’s 24-yard field goal with a mere four seconds remaining to give Lamar a 10-7 victory over Southern Mississippi. Leonard and the defense combined to give the Cards a 9-7 road victory over West Texas State the next week. Leonard booted three field goals, including ones of 24 and 45 yards in the fourth quarter with the winning one coming with 48 seconds left. After the loss to Louisiana Tech, the Cards closed their season with wins of 17-3 over McNeese State and 8-0 over Texas-Arlington. The Cardinals’ points in the UTA game came on two field goals and a safety. The Cardinals’ defense, which ranked 12th in the nation in Division I that season, held seven of their 10 opponents to seven or fewer points. Colbert, Hill, linebacker Ronald Black, tackle Donnie Davis and end Leon Babineaux were all honored on the 1974 All-SLC team, along with offensive guard Keith Elliott. From the astonishing high of the 1974 season, the Cardinals dropped to a disappointing low of a 1-10 campaign in 1975. Injuries to key personnel played a major role in the downward spiral, but it still cost Glass as he was replaced at the end of the season by Bob Frederick, a former LU standout in football, basketball and baseball who had been the Cardinals’ defensive coordinator for the previous 11 seasons. Playing their season opener against the University of Houston in the Astrodome, the Cardinals held their ground through the first half but wound up yielding a 20-3 decision to the Cougars. The Cards also hung tough in fourpoint and three-point losses to West Texas State and New Mexico State, respectively, in their next two games, but the season-opening losing streak went on to grow to nine games. Their most humiliating loss was 43-3 to Southern Mississippi in the New Orleans Superdome. It marked the fifth time in eight
104
games for the Cards to score seven or fewer representative on the 1978 All-SLC Team. Ofpoints. fensively, the pass-and-catch duo of Larry A 30-10 victory over Southern Illinois in Haynes and Howard (Boo) Robinson showed their 10th game signs of what was to come as Haynes comenabled the pleted 92 of 184 passes for 1,261 yards and luckless Cards eight TDs while Robinson snared 27 passes for to avert a win- 451 yards and four TDs. less season. The hiring of 35-year-old offensive guru They managed Larry Kennan to succeed Frederick as head an average of a coach brought optimism for a Cardinal program meager 10.8 starving for success after four successive losing points per game seasons. and yielded an Kennan’s resume included impressive stints average of 23.0 as offensive coordinator at SMU and Nevadaand had no Las Vegas, and he swiftly lived up to his hiringplayers voted to day boast that the 1979 Cardinals would play an the All-SLC exciting brand of football. Operating from the Team. Pro-I offense, the Cards razzled-dazzled their Freder- way to an incredible 38 team or individual ick’s first year at records en route to a 6-3-2 campaign in 1979. Doug Matthews was an the helm in The Cardinals fell 20-7 to Baylor in Kennan’s All-Southland Conference 1976 didn’t see head-coaching debut, but he responded by callrunning back in 1972, and the Cardinals ing the shots in a 58-27 dismantling of Western led the team in rushing make much im- Kentucky in their next game, causing Cardinal three times. provement as Stadium to swell with a standing-room-only they scored a total of 97 points in struggling to crowd of 17,600 for their home debut against a 2-9 season. Their wins were 17-6 over North- Louisiana Tech the next week. western State in their opener and 21-17 over Kennan’s troops did not disappoint the enNew Mexico State in Week 3. They closed the thusiastic crowd as they responded with a 19-7 season with an eight-game losing streak during victory, Lamar’s first since 1970 over Tech’s which they were shut out twice and scored a Bulldogs. total of 43 points. Linebacker Kurt Phoenix sparked the fireSenior defensive tackle Donald Davis was works against Western Kentucky by returning the only Cardinal to make the 1976 All-SLC the opening kickoff a school-record 98 yards Team. for a touchdown, and by the time that sunny Despite improving on both sides of the ball, Kentucky afternoon ended, Haynes and fellow the 1977 Cardinals failed to improve in the won- LU quarterback Mike Long had combined for loss column as they again went 2-9. After open- 323 passing yards, six shy of the then school ing with a 21-7 win over Northeast Louisiana, record. they lost eight-straight games before stunning Other highlights of that day included split highly-favored McNeese State 35-7 in Lake Charles. Burly noseguard Matt Burnett, who later had a successful run as Port Neches-Groves’ head coach, led the team in tackles that season and was a firstteam All-SLC selection. The 1978 Cardinals endured a 2-8-1 season that saw the end of the Bob Frederick Era as head coach after three years that produced a combined record of 6-26-1. The wins were 23-16 over Stephen F. Austin and 3631 over Long Beach State, and the tie was 17-17 against NorthLarry Haynes (R) and Howard “Boo” Robinson (L) made east Louisiana. Offensive guard Victor Enard up a dynamic pass-and-catch combination for the Cardinals in 1978 and 1979. of West Orange was Lamar’s lone
L a m a r Fo otbal l end Jesse Cavil streaking 72 yards down the sideline for a TD after catching a Haynes pass, Robinson popping open in the end zone twice for TD receptions, defensive end Terry Lee Williams returning an interception 26 yards for a TD and the defense coming up with six total turnovers. With Haynes at the offensive controls, the 1979 Cardinals averaged 248.5 passing yards and 24.7 points per game, and they notched three wins against SLC competition – two more than the previous four LU teams had managed. Haynes had a 276-yard passing performance against Western Kentucky, a 258-yarder against West Texas State, a 262-yarder against McNeese State and a 286-yarder vs. Northwestern State, but they were just routine outings compared to his record-smashing 403-yard output against UT Arlington. For the season, he had 233 completions on 402 attempts for 2,641 yards and 21 TDs. The 143-pound Robinson was Haynes’ favorite target as he logged three 100-yard-plus receiving games and finished the season with record totals of 59 catches, 840 receiving yards and 12 TDs. Despite his brilliance as a passer, Haynes was relegated to a second-team berth on the AllSLC Team, but Robinson, Enard, Phoenix and tight end Alfred Mask were all first-teamers. Joining Haynes on the second team were offensive tackle Kenny Birkes and cornerback/kick returner Johnny Ray Smith. The 1980s Depleted by the departures of Haynes, Robinson, Phoenix, Enard and several other key contributors, the 1980 Cardinals lacked experience and depth and, consequently, dipped to a 3-8 record. They opened with a 41-8 victory at Texas Southern, but eventual Southwest Conference champion Baylor pounded them 42-7 before a standing-room-only crowd of 18,500 in their home opener, and Drake was a 38-7 winner in Game 3. The Cardinals righted their ship with a 45-21 victory over Stephen F. Austin, but four-straight losses followed before they edged Arkansas State 23-22 for their final victory. One of the positives to the season was that freshman quarterback Ray Campbell from Livingston steadily progressed into a competent passer, completing 157 of 296 attempts for 1,491 yards and seven TDs. Flanker Sam Choice, who led the team with 34 catches for 579 yards and four TDs, was a first-team All-SLC selection along with Smith, the team leader in kickoff returns and punt returns.
The first two games of 1981 produced the biggest highlights of the season. First, Mike Marlow calmly kicked a 42-yard field goal with three seconds left to give the Cardinals an 1817 road upset of defending SWC champion Baylor, then the Cards traveled to the Houston Astrodome and destroyed Sam Houston State 50-7 as Cavil caught three TD passes and Herbert Harris two. The Cardinals’ other wins in their 4-6-1 season were decisions of 17-13 over Northeast Louisiana and 14-12 over Southwestern Louisiana, and the tie was 20-20 vs. McNeese State. Junior college transfer Fred Hessen beat out Campbell for the starting quarterback job that season, and he threw five TD passes in the Sam Houston State game. He finished the season with 182 completions on 365 attempts for 2,108 yards and 14 TDs. Harris, who had 13 catches for 192 yards in a 16-7 loss to Louisiana Tech, set school records with 61 catches for 911 yards and seven TDs, while Ben Booker led the team with 569 rushing yards. Linebacker Charles Broussard led the team in tackles with 96, and strong safety David Jones and linebacker Larry McCoy had 88 each. Late in the spring of 1982, Kennan departed Lamar to take an assistant’s job with the Oakland Raiders, and Ken Stephens, who had coached Central Arkansas to a 10-season record of 67-35-6, was hired on June 2 to succeed him. Stephens found coaching at the NCAA Division I-AA level to be a bit more difficult than it had been at the NAIA level. His best season was his first when the Cardinals went 4-7 in 1982, and he departed after producing an 11-33 record over four years. The 1982 Cardinals struggled offensively as they suffered three shutouts and also scored only three points in a 45-point loss to the University of Houston. Their wins were 24-14 over Stephen F. Austin, 27-7 over Sam Houston State, 28-17 over Texas Southern and 12-3 over McNeese State. Stephens did, however, coach two, first-team Division 1-AA All-Americas – both as sophomores in linebacker Eugene Seale in 1983 and running back Burton Murchison in 1985. A product of Jasper High School, Seale intercepted a pass on his first collegiate play and returned it 52 yards for a TD against Nicholls. He went on to win the SLC Defensive Player of the Week Award an unprecedented five times, to amass a school-record 170 tackles (85 solos and 85 assists) and was voted the SLC Defensive Player of the Year in addition to earning the All-America award. A 5-foot-11, 205-pounder from Woodville, Murchison made his first big splash in the sec-
ond game of his sophomore season when he rushed for 222 yards and two TDs in a 30-7 victory over Prairie View A&M. He surpassed the 200-yard barrier in two other games, including a school-record 259 in a 29-28 road loss to Rice University. With his Division I-AA-leading 1,547 rushing yards in 1985, Murchison shattered both the Lamar and SLC single-season records. In addition to his All-America award, he was the SLC Offensive Player of the Year. The 1986 season ushered in the Ray Alborn Era as head coach. He went 2-9 in his first season, 3-8 in each of the next two and 5-5 in 1989, Lamar’s last before the program was discontinued due to mounting deficits in its operation. Alborn’s 1986 Cardinals lost their first five games before managing a 17-3 victory over Southwest Texas State. Their other win was 4723 over Central State of Oklahoma before a crowd of 961 in Cardinal Stadium. Murchison rushed for a team-best 830 yards in 1986, and sophomore Shad Smith and freshman John Evans shared the quarterbacking duties. They combined to pass for 1,772 yards and 10 touchdowns, and Derek Anderson led the receiving corps with 34 catches for 575 yards and three TDs. Lamar withdrew from the Southland Conference after the 1986-1987 athletic year, opting to join the newly-created American South Conference, which did not sponsor football. That left the football program with the burden of having to play as a Division I-AA independent – a move that made scheduling extremely difficult, especially for home games. The Cardinals could attract only four home opponents in 1988, and three of those were West Texas State, Alcorn State and Mississippi College, schools that lacked drawing appeal in Southeast Texas. The 1989 schedule included road games against Angelo State and Alcorn State. Murchison ran for three touchdowns in the Cardinals’ first victory of the 1987 season – a comefrom-behind 39-35 decision at Northern Burton Murchison led DiviIllinois. Smith sion I-AA with 1,547 rushing yards in 1985. threw three TD
105
La mar Foo tba l l The 2010s It was stunning but seemed only appropriate, however, that quarterback Andre Bevil broke Evans’ record with 426 total yards of offense in Lamar’s return to football in a thrilling 30-27 2010 season-opening loss at none-other than McNeese State. The Cardinals finished 5-6 in their return to the gridiron in 2010 under new head coach Ray Woodard. Seven individual and eight Eugene Seale was a Division I-AA All-America linebacker team records fell during the year and the Southland Conference Defensive Player of the with Bevil setting two records and Year in 1984. tying another. In addition to the single-game total offense mark, Bevil passes with Anderson catching two of them as set school records for passing yards (429 yards) the Cards edged Stephen F. Austin 28-26 for and most completions in a game (34). their second win. The Cardinals would get into the win column The final victory was a 48-28 decision over Louisiana-Monroe in which Smith threw four in their home opener with a 21-14 victory over TD passes and Murchison had a 44-yard scoring Webber International in front of a sold out starun and a 24-yard TD reception. Smith passed dium of 16,600. Wide receiver J.J. Hayes scored for 1,806 yards and 11 TDs that season, while the first points in the newly named Provost Umphrey stadium as he hauled in a Bevil pass Evans’ respective totals were 965 and nine. for a 25-yard touchdown. For the fourth-straight season, Murchison Lamar would run its winning streak to two led the Cardinals in rushing with 813 yards on 130 carries, and he departed as Lamar’s all-time games with a thrilling comeback win at Southrushing champion with a career total of 3,598 eastern Louisiana by a 29-28 score. The Cardinals trailed 28-8 early in the second half before yards. Ironically, the 1989 Cardinals were Lamar’s scoring 20 straight points to stun the crowd at only team of the 1980s decade not to post a los- Strawberry Stadium. Hayes scored from 19 ing record, yet the coaches and players had to yards out on a Bevil completion with 1:52 to endure the pain and disappointment of seeing play to complete the comeback. Following a 38-10 loss to Sam Houston the program disbanded. A couple of weeks before the football pro- State, Lamar earned a 14-0 homecoming day gram was discontinued by a 5-4 vote of Lamar’s win over Langston. The game against Langston board of regents, the Cardinals closed their sea- drew 17,306 fans for the third best crowd in the son with a come-from-behind 22-17 victory history of the stadium as Lamar averaged over McNeese State before a crowd of 3,263 in 16,079 fans per game for the highest attendance Cardinal Stadium. The Cardinals rallied for 16 of any Southland Conference school. The Cards would drop three straight games, fourth-quarter points to seal their break-even 55 season, during which an amazing 24 individual falling 26-0 to South Alabama, 31-6 at North Dakota and 23-17 at Georgia State. However, or team records were either set or tied. Lamar rebounded to earn home wins over The winning rally was sparked by a 15-yard South Dakota (24-20) and Oklahoma Panhandle touchdown pass from John Evans to Chris Ford and a 31-yard field goal by Frank Van Renselaer, State (44-6) to close the year. After returning to the field in 2010, the Carthen capped by a 2-yard scoring run by fullback Kenny Franklin with a mere nine seconds re- dinals were official football playing members of the Southland Conference in 2011. Lamar manmaining. Evans completed 30 of 50 pass attempts that aged a 4-7 record on the year, including a 2-5 night, and his 396 yards of total offense (353 mark in Southland Conference competition. The records continued in the 2011 season as passing and 43 rushing) were the then thirdmost in school history behind only his 421 yards the Cardinals set or tied 13 school marks, invs. Texas-El Paso and 405 vs. Angelo State ear- cluding largest margin of victory with a seasonopening 58-0 win over Texas College. In that lier that season. same game, junior transfer running back DePauldrick Garrett established school records for touchdowns in a game (4) and points scored in
106
a game (24). After a 30-8 setback at South Alabama, the Cards posted back-to-back wins with a 45-35 home win over Incarnate Word and a 48-38 win at Southeastern Louisiana. Lamar would suffer a five-game losing streak following the wins before picking up a 34-26 Southland Conference win over Nicholls. LU closed the year with a 45-17 loss to rival McNeese State. Senior wide receiver J.J. Hayes, who earned second-team all-conference recognition, set three school records. Hayes had a single-game record 212 receiving yards against Northwestern State, single-game receptions (14) against McNeese State and 951 receiving yards on the year to establish a single-season standard. Kicker Justin Stout added to the individual records as he matched a school mark with eight extra point kicks in the Texas College win and a new single-season record for extra points converted with 35. The 2012 campaign saw the Cardinals play a pair of FBS opponents for the first time since the return of football. Lamar opened the season at former conference rival Louisiana-Lafayette and also took a trip to Hawai’i to face the Warriors. Lamar posted back-to-back home shutouts with identical 31-0 wins over Prairie View A&M and Langston. The Cardinals also enjoyed a 5221 homecoming win over McMurry as sophomore receiver Kevin Johnson tied Garrett’s single-game record with four touchdowns and 24 points scored. Johnson, who would go on to be named the Southland Conference Newcomer of the Year, returned a kickoff 88 yards for a score and scored three recieving touchdowns. After dropping three straight league games, the Cards righted the ship with a 34-24 home win over Nicholls as Johnson scored on a 15yard pass in the first quarter to tie the singleseason school record for touchdowns scored with 13. Fellow receiver Barry Ford added a big day with nine catches for 111 yards and a touchdown, and defensive lineman John Prescott closed the scoring with a 26-yard interception return. Offensive lineman Sean Robertson and defensive lineman Jesse Dickson were each named second-team all-conference following the season. Prescott, Johnson, Jermaine Longino, Marcus Malbrough, Branden Thomas and Chad Allen were named honorable mention. Junior punter Kollin Kahler was named to the CoSIDA Capital One Academic All-District-7 Team, as well as several other academic honor rolls.
L a m a r Fo otbal l Lamar Coaching History Stan Lambert (6-13-0) Year 1951 1952
Overall Conference Conference W-L-T W-L-T Finish -- Lone Star Conference -4-6-0 2-3-0 5th 2-7-0 1-4-0 5th
Larry Kennan (13-17-3) Year 1979 1980 1981
Overall Conference Conference W-L-T W-L-T Finish -- Southland Conference -6-3-2 3-2-0 3rd 3-8-0 1-4-0 5th 4-6-1 1-3-1 5th
J.B. Higgins (59-38-4) Year 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962
Overall Conference Conference W-L-T W-L-T Finish -- Lone Star Conference -3-7-0 2-3-0 4th 3-7-0 1-4-0 6th 4-6-0 2-4-0 4th 4-4-1 2-4-0 5th 8-0-2 5-0-2 T-1st 6-2-0 5-2-0 T-2nd 8-3-0 4-2-0 T-3rd 8-4-0 5-2-0 T-2nd 8-2-1 4-2-1 3rd 7-3-0 4-3-0 4th
Ken Stephens (11-33-0) Year 1982 1983 1984 1985
Overall Conference Conference W-L-T W-L-T Finish -- Southland Conference -4-7-0 1-4-0 T-5th 2-9-0 1-5-0 7th 2-9-0 1-5-0 T-6th 3-8-0 0-6-0 7th
Vernon Glass (63-68-1) Year 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975
Overall Conference Conference W-L-T W-L-T Finish -- Independent Status -5-4-0 ------ Southland Conference -6-3-1 3-0-1 1st 6-4-0 3-1-0 1st 6-4-0 3-1-0 T-1st 7-3-0 3-1-0 2nd 0-10-0 0-4-0 5th 3-7-0 0-4-0 5th 3-7-0 1-3-0 4th 5-6-0 4-1-0 T-1st 8-3-0 3-2-0 T-3rd 5-5-0 3-2-0 T-2nd 8-2-0 4-1-0 2nd 1-10-0 0-5-0 6th
Ray Alborn (13-30-0) Year 1986 1987 1988 1989
Ray Woodard (13-21-0) Year
Bob Frederick (6-26-1) Year 1976 1977 1978
Overall Conference Conference W-L-T W-L-T Finish -- Southland Conference -2-9-0 0-5-0 6th 2-9-0 1-4-0 6th 2-8-1 0-5-0 6th
Overall Conference Conference W-L-T W-L-T Finish -- Southland Conference -2-9-0 0-5-0 6th -- Independent Status -3-8-0 ----3-8-0 ----5-5-0 -----
2010 2011 2012
Overall Conference Conference W-L-T W-L-T Finish -- Independent Status -5-6-0 ------ Southland Conference -4-7 2-5 6th 4-8 1-6 7th
107
La mar Foo tba l l All Lone Star Conference 1951 1952 1955 1957
1958
1959 1960 1961 1962
Sammy Carpenter, TB Sammy Carpenter, TB Roy Mazzagatti, T Raymond Meyer, FB Glenn Green, SE Bob Frank, C Wendell Martin, G Dudley Meredith, T Bob Nance, FB Glenn Green, SE Gary McKee, C Norman Noble, G J.E. Whitmore, RB John Donaho, G Shephard Touchett, FB Nader Bood, G Ronnie Fontenot, RB Bobby Jancik, RB Lindley King, G Lindley King, G
All Southland Conference 1964 1965
1966
1967
108
Anthony Guillory, G Vernon McManus, LB Mike Allman, DB Dick Croxton, DE Jake David, DB Bill Kilgore, SE Harold Lafitte, RB Ed Marcontell, OT Vernon McManus, LB Phillip Primm, QB Dick Croxton, DE Jake David, DB Johnny Fuller, SE Danny Jones, LB Ed Marcontell, OT Phillip Primm, QB Tom Smiley, FB Spergon Wynn, OG Richard Bjerke, LB Dick Croxton, DE Johnny Fuller, SE Bill Groberg, DB Bill Kilgore, SE Darrell Mingle, C Tom Smiley, FB Spergon Wynn, OG
All-Conference Players 1968 1969
1970 1971 1972
1973 1974
1976 1977
1978 1979
1980 1981 1982 1983 1984 1985
Richard Cummings, DT Benny Lansford, DB Gary Crockett, DT Ronnie Gebauer, SE Jerry Harvey, DB Mordie Marcontell, OG Gary Crockett, DT Gary Crockett, DT Patrick Gibbs, DB Joe Bowser, SE Charles Cantrell, OT Rondy Colbert, DB Doug Matthews, RB Leon Babineaux, DE Joe Bowser, SE Rondy Colbert, DB Leon Babineaux, DE Ronald Black, LB Rondy Colbert, DB Donald Davis, DT Keith Elliot, OG Donald Hill, DB Donald Davis, DT Kevin Bell, RB Matt Burnett, NG Victor Enard, OG Clarence Wallace, RB Victor Enard, OG Victor Enard, OG Alfred Mask, TE Kurt Phoenix, LB Howard Robinson, FL Sam Choice, FL Johnny Ray Smith, DB Herbert Harris, SE Mike Marlow, PK David Jones, DB Terry Lee Williams, DE Eugene Seale, LB Rodney Clay, SE Eugene Seale, LB Ricky Fernandez, P Burton Murchison, RB Eugene Seale, LB
Ronnie Gebauer
Three-Time All-SLC Selections Rondy Colbert, 1972-74 Gary Crockett, 1969-71 Dick Croxton, 1965-67 Victor Enard, 1977-79 Eugene Seale, 1983-85
Burton Murchison * - Only First-Team Selections Listed
L a m a r Fo otbal l Specialty Awards & NFL PLayers NFL Draft Picks All-America and Free Agent Signings Dudley Meredith, T
1957 1961 Bobby Jancik, DB 1967 Spergon Wynn, OG (AP) 1983 Eugene Seale, LB (AP) 1985 Burton Murchison, RB (AP, FN) AP-Associated Press FN-Football News
Senior Bowl 1968
Tommy Smiley, RB
NCAA Postgraduate ScholarshipWinners 1973
Richard Kubiak
SLC Offensive Player of the Year 1985
Burton Murchison
SLC Defensive Player of the Year 1965 Vernon McManus 1983 Eugene Seale
Year 1957 1962 1965 1967
Rd Sel# 21
Player Dudley Meredith Bobby Jancik 7 Anthony Guillory 11 279 Ed Marcontell 15 393 Darrell Johnson 1968 2 55 Tom Smiley 4 98 Johnny Fuller 1972 9 222 Pat Gibbs 14 343 Gary Crockett 1973 5 117 Charles Cantrell 13 317 Ed Robinson 15 376 Thomas Gage 1975 17 418 Rondy Colbert 1978 12 316 Jeff Bergeron 12 321 Kevin Bell 1981 11 283 Johnny Ray Smith 1985 6 163 Danzell Lee 1990 6 142 Tyrone Shavers Free Agent Signings Out of College 1965 Mike Allman 1967 Bill Kilgore 1969 Wayne Moore 1970 Ronnie Gebauer 1973 Joe Bowser 1979 Matt Burnett 1987 Eugene Seale 2012 Marcus Jackson
Pos. DT DB LB G RB RB DB DB DT OT DB RB WR DB TE WR
Team Detroit Lions Houston Oilers Los Angeles Rams St. Louis Cardinals New Orleans Saints Cincinnati Bengals San Francisco 49ers Philadelphia Eagles Houston Oilers Washington Redskins St. Louis Cardinals Atlanta Falcons New York Giants Seattle Seahawks San Diego Chargers Tampa Bay Buccaneers Washington Redskins Phoenix Cardinals
DB OL OT SE SE DL LB WR
Los Angeles Rams Cleveland Browns San Francisco 49ers Philadelphia Eagles Dallas Cowboys Houston Oilers Houston Oilers Atlanta Falcons
SLC Newcomer of the Year 2012
Kevin Johnson
SLC Coach of the Year 1970 Vernon Glass 1974 Vernon Glass
Former Lamar AllAmerica Eugene Seale spent six seasons with the Houston Oilers
109
La mar Foo tba l l Senior College Lettermen Derek Anderson 1985-88
Richard Adams, 1977-78 Bruce Adair, 1984 Bobby Adamson, 1971-73 Naisaun Ahmadi, 1988-89 Burnie Alderman, 1964-65 Jeremiah Alexander, 2010-11 Bruce Allen, 1970 Chad Allen, 2010-11-12Jerry Allen, 1951-52-53 Michael Allen II, 2010-11 Red Allen, 1981-82 Robert Allen, 1988-89 Ronnie Allen, 1972 Burt Allman, 1963-64-65 Mike Allman, 1962-63-64-65 Hunk Altenbaumer, 1985 Byron Amerson, 1988-89 Derek Anderson, 1985-86-87-88 Ed (Thor) Anderson, 1978-79 Mike Anderson, 1971-72-73 Dan Andrews, 1956-57 Mike Andrie, 1984-85-86-87 Kevin Arey, 1986-88-89 Eric Arnold, 2011 Kwabena Asante, 2010 Tony Ashbacher, 1975 Farrell Attaway, 1951-52 Bernie Auld, 1979-80-81
John Behuler 1960-61
Stephen Babin, 2010-11-12 Leon Babineaux, 1971-72-73-74 Emone Bailey, 2010-11 Steve Bailey, 1964-65-66 Ronnie Baird, 1969-70 Bobby Baker, 1963 Whit Baker, 1963-64-65
110
Andrew Balke, 1956-57 Steele Baptiest, 1983-84-85 Victor Barlow, 1983-84-85 Dwayne Barnes, 1984-85-86 Craig Barrett, 1967-68 Dillon Barrett, 2012Troy Barrett, 1984-86-88 Gene Bates, 1951-52 Anthony Beard, 2011Steve Becker, 1983-84 Craig Bee, 1989 Reggie Begelton, 2012Charles Behn, 1976-78-80 Billy Bell, 1983-84-85 Kevin Bell, 1976-77 Tommy Bell, 1954-55 Olney Beltz, 1953 Mitchell Bennett, 1982-83 Jeff Bergeron, 1977 William Berlin, 1959-60-61 Bobby Berry, 1987 Caleb Berry, 2011-12Alfred Besch, 1958 John Beuhler, 1960-61 Andre Bevil, 2010-11 Robert Billings, 1985 Kenny Birkes, 1977-78-79 Richard Bjerke, 1964-65-66-67 Ronald Black, 1971-72-73 John Blackwell, 1966-67-68 Hoy Blanton, 1968 Marvin Boatman, 1980-81 Lynn Bock, 1971-72-73-74 James Bolton, 1951-52-53 Kyle Bolyard, 1983-84-85 Nader Bood, 1958-59-60 Ben Booker, 1978-79-80-81 David Booker, 1979 Daniel Boone, 1955 Jerry Boone, 1953-54-55-56 Billy Borten, 1988 Hayden Bourg, 1965-66 Daryl Bourgeois, 1983 Vernon Bowman, 1963-65 Joe Bowser, 1971-72-73 Gary Boyette, 1973 Hosea Bradley, 1979 Dale Brannan, 1982 Ben Breaux, 1985 Justin Brock, 2012Chris Brown, 1984-85-86 Wesley Bryant, 1981 Rusty Brittain, 1972-73-74 Charles Broussard, 1979-80-81-82 Darryl Broussard, 1982-83-84 Bo Brown, 1986-87-88-89 Percy Bruce, 1979-80 Ed Brune, 1953-54-55 Gordon Buffington, 1959-60 Ray Buffington, 1961-62-63
Jeffrey Burdick, 1989 Jimmy Burnett, 1951-52 Matt Burnett, 1975-76-77-78 Jimmy Burney, 1952 Bruce Bush, 1969 Randall Byrd, 1977-78-79-80
Mike Cebrun 1983-85
Steve Cahee, 1983 Bobby Caldwell, 1952 Greg Caldwell, 1982-83 Bryan Campbell, 1986-87-88-89 Daniel Campbell, 2011 Luke Campbell, 2012 Ray Campbell, 1957-58-59 Ray Campbell, 1980-81-82-83 Charles Cantrell, 1970-71-72 Rick Carber, 1978-79 Kevin Carey, 1985 Patrick Carlton, 2010-11-12 Sammy Carpenter, 1951-52-53-54 Paul Carswell, 1958-59 Doug Carter, 1968 Weldon Cartwright, 1976-77 Gary Casey, 1964-65 Rick Casey, 1978-79 Jesse Cavil, 1978-79-80-81 Rodney Cavness, 1987-88 Mike Cebrun, 1983-84-85 Greg Chambers, 1971-72-73-74 Ben Chandler, 1984-85 John Chapman, 1954-55-56 Joey Chavez, 2010-11 Billy Chavis, 2010-11 Blake Chavis, 2011-12 Billy Chester, 1970 Leonard Choate, 1951-52-53 Sam Choice, 1979-80 John Christian, 1977-78-79 Bruce Clapp, 1976-77-78 Champ Clark, 1965-66-67 David Clark, 1971-1972 Ryan Clark, 2010-11 Warren Clark, 1963-64 Rodney Clay, 1982-83-84-85 Matthew Clay, 1978 Tracey Clay, 1981-82-83 Douglas Clower, 1951 Ed Cockrell, 1986-87-88-89
L a m a r Fo otbal l Chris Coffey, 1988-89 Harry Cole, 1979-80 Lotice Cole, 1968-69 Mel Cole, 1974-75-76 Darrell Coleman, 1983-84-85-86 Jacody Coleman, 2010-11 Rondy Colbert, 1971-72-73-74 Colton Collins, 2011-12 Steve Collazo, 1973-74-75 Scott Coon, 1974-75 Daniel Conrad, 1965-66-67 Ronny Cowart, 1971-72-73 Bernie Cook, 1954-55 Johnny Cook, 1964-65-66 Billy Counts, 1954-55-56 Charles Crawford, 1968 Rodney Crawford, 1984 Brandon Crissmon-Stewart, 2010 Harvey Criswell, 1975 Gary Crockett, 1969-70-71 Vernon Crowder, 1960 Dick Croxton, 1965-66-67 Robert Cuddy, 1971-72-73-74 Charles Culler, 1955 Richard Cummings, 1966-67-68 Donald Cunningham, 1974-75-76-77 Tommy Currie, 1963-65
Pat Day 1959-61
Larry Daily, 1973 Mozell Darthard, 1983-84 Jake David, 1964-65-66 Doug Davidson, 1971-72 Bill Davis, 1952-53 Donald Davis, 1973-74-75-76 Jimmy Davis, 1960 Kevin Davis, 2010-11 Nashon Davis, 2012Ronald Davis, 1987-88-89 Taylor Davis, 2011-12 Billy Dawson, 2010-11 Michael Dawson, 1987-88 Pat Day, 1959-60-61 Frazier Dealy, 1964-65 Mark DeHoyos, 1975 Paul De LaRosa, 1989 Joe Deleon, 1954 Jerry Deller, 1980 Steve DeRouen, 1972-73 Brad Derrick, 1960 Robert Desha, 1960 Thomas Dickerson, 1977
Jesse Dickson, 2010-11-12Charles Dinhoble, 1958-59-60 Kevin Dischler, 1983-84 Dwayne Dodd, 1984-85-86 Glenn Dorris, 1972 Adren Dorsey, 2010-11-12 Floyd Dorsey, 1979-81-82 Ron Douglas, 1984 Alton Drake, 1981-82-83-84 Mike Drake, 1970-71-72 Danny Dubose, 1964-65-66-67 Roy Duke, 1951 Blair Duncan, 1955 Frederick Dunham, 1973-74
Justin Eicher 1978-80
Ben Eaglin, 1973-74 Howard Easley, 1982-83-84 Frank Ebersole, 1956 Glen Edgerly, 1967-68 Jordan Edwards, 2010-11-12 Kameron Edwards, 2010-12 Justin Eicher, 1978-79-80 Jonathan Ekpe, 2010 Dean Elliott, 1962-63 Keith Elliott, 1971-72-73-74 Arthur Ellis, 1989 Mike Ellis, 1977-78-79-80 Ronnie Ellis, 1983-84 Victor Enard, 1977-78-79 Cameron Epple, 2010-11 George Eskue, 1971-72-74 Roy Esquivel, 1968-69-70 Herbert Estes, 1951-52 John Evans, 1986-87-88-89 Robert Evans, 1986-87-88-89
Ricky Fernandez 1982-85
Marshall Fairchild, 2010-11-12Jim Fairman, 1954-55 Louis Falgout, 1974-75-76-77
Lanston Fall, 1975-76-77 Danny Faust, 1989 Ricky Fernandez, 1982-83-84-85 James Finch, 1962 Bobby Flores, 1973-74-75-76 Marc Flowers, 1979 Gerald Foltyn, 1957-58-59 Ronnie Fontenot, 1959-60 Robert Fontno, 1968-69 Ronnie Foreman, 1956 Barry Ford, 2010-11-12Billy Ford, 1959-60 Chris Ford, 1987-88-89 Dionte Forney, 2011 Bill Foster, 1955 Joe Foster, 1971-72-73-74 Mario Foster, 2010-11 Bob Frank, 1956-57 Van Lawrance Franks, 2010-11-12 Kenny Franklin, 1986-87-88-89 Chris Frederick, 1975-76-77 Bob Frederick, 1951-52 Johnny Fuller, 1965-66-67
Bill Godwin 1981-82
Thomas Gage, 1970-71-72 Ruben Galaviz, 1988 Rick Gann, 1979-80 Danny Gardner, 1960-61 DePauldrick Garrett, 2011-12 Jordan Garrett, 2010-11-12 Louis Garriga, 1980-81-82 Roy Gaspard, 1965-66-67 Ronnie Gebauer, 1967-68-69-70 Patrick Gibbs, 1968-69-71 Keith Gilchrist, 1978-79 Kyle Gillam, 2010-11-12Clay Givens, 1971-72-73 Gratian Gladney, 2012Bill Godwin, 1981-82 Alex Goff, 2010-11 Ricky Gohlke, 1973-74-75-76 Don Gordon, 1975-76-77-78 Brad Grant, 1987 Chris Gravitt, 1987-88-89 Glenn Green, 1955-56-57-58 Kenneth Green, 1981-82-83 Olen Green, 1984 Richard Griffin, 1957 Tommy Griffiths, 1976-77-78-79 Bill Groberg. 1966-67 John Gruter, 1962
111
La mar Foo tba l l Adrian Guillory, 2011-12 Anthony Guillory, 1962-64 James Guillory, 1980
Windell Hebert 1960-62
David Haladay, 1963-64 David Halbrook, 1972-73-74 Cedric Hall, 1976 Tony Hall, 1970-71 Jacob Hanna, 2011-12 Danny Hansen, 1977 Jesse Hardin, 1983 Percy Hardison, 1969-70-71 Mike Hargis, 2012Caleb Harmon, 2010-11-12Lloyd Harper, 1955 Darrell Harris, 2012 Glen Harrison, 1981-82 Lawson Hartwick, 2011-12Jaime Harvey, 1980-82 Harold Harris, 1973-74-75 Herbert Harris, 1980-81-82 Jackie Harris, 1980-81-82-83 Roger Harris, 1962-64 Jerry Harvey, 1968-69-70-71 Thomas Harvey, 1956 Dennis Haskin, 1983-84 George Hawkins, 1952 J.J. Hayes, 2010-11 Larry Haynes, 1978-79 Tim Hayter, 2010-11 Windell Hebert, 1960-61-62 Jerome Heim, 1983 P.J. Henderson, 2011-12Darryl Henicke, 1967 Patrick Henry, 1989 Torre Henry, 2010-11 John Hensley, 1972-73-74-75 Ronnie Henson, 1986-87-88-89 Paul Herring, 1959 Fred Hessen, 1981-82 Joe Hester, 1959 Danny Hetzel, 1967-69 Ed Hickey, 1988-89 Asim Hicks, 2010-11 Elton Hightower, 1951-52-53 Kye Hildreth, 2010-11 Aaron Hill, 1980 Clinton Hill, 1970-71 Darrell Hill, 1975-76 Donald Hill, 1972-73-74 Glen Hill, 1969-70-71-72
112
Larry Hill, 1980-81-82 Smitty Hill, 1951 Vernon Hill, 1960 Kirk Hobbs, 1983-84 Kevin Hoffman, 1984-85-86-87 Todd Hogue, 1982-83-84 Rodney Holcombe, 1983-84-85-86 Keith Holden, 1980-81-82 Kevin Holden, 1979-80-81-82 Nathan Hollins, 1988 David Hollyfield, 2012Eddie Horn, 1978-79 Roy Hudson, 1973-74 Jimmy Humlick, 1986 Dan Hunt, 1966 Ernie Husmann, 1966-67 Cody Hussey, 2010
Jim Jiral 1979-80
Joe Jack, 1977 Darby Jackson, 2010-11 Michael Jackson, 1985-86-87-88 Jim Jackson, 1968 Johnny Jackson, 1975 Marcus Jackson, 2010-11 Raymond Jackson, 1981-82-83 Tim Jackson, 1978 James Jacobs, 1983-84-85 Joshua James, 2010-12 Bobby Jancik, 1960-61 Andre Jenkins, 1985-86 Jim Jiral, 1979-80 Darrell Johnson, 1963-64-65-66 Duane Johnson, 1970-71-72-73 Edward Johnson, 1982 J.J. Johnson, 1977 Jeremy Johnson, 2011 Kenny Johnson, 1974 Kevin Johnson, 2012Leroy Johnson, 1977-78 Matt Johnson, 2012Mike Johnson, 1960-61 Paul Johnson, 1987-88-89 Sherwin Johnson, 1987-88-89 Tim Johnson, 1980-81 Alja Jones, 1983-84-85-86 Bobby Jones, 1989 Danny Jones, 1963-64-65-66 David Jones, 1975-76-79 David Jones, 1981-82 Ivan Jones, 1976-77 Ronnie Jones Jr., 2012-
Ryan Jones, 2010-11-12 Scott Jones, 1976 William Jones, 2010-11-12Ruben Jordan, 1979-81 Sam Jordan, 1975 Gary Joseph, 1971 Jacobson Joseph, 2010
Lindley King 1960-62
Kollin Kahler, 2010-11-12Mark Kebodeaux, 1974-75-76-77 Cliff Kellett, 1953 Donald Kelley, 1968 Mike Kelley, 1968-69 Ian Kelso, 2010-12Donald Kenebrew, 1985-86 John Kent, 1961 Barry Kerr, 1961-62 Jessie Kibbles, 1975-76-77-78 Mike Kiger, 1978-79 Bill Kilgore, 1965 Chris Killgore, 1979-80-81 Alden Kimmey, 1959 Lindley King, 1960-61-62 Jeremy Kirt, 2010-11-12 Tommy Kizer, 1971-72 Troy Knight, 1987-88-89 Jeff Knox, 1987-88-89 Bobby Koon, 1957-58 Gerard Krolczyk, 1969-70-71 Donald Krushall, 1970-71 Larry Krushall, 1971-72 Richard Kubiak, 1971-72 Joe Knight, 1961-62 Troy Knight, 1987-88-89
Chris Lafferty 1986-89
Chris Lafferty, 1986-87-88-89 Harold LaFitte, 1962-63-64-65 Bob Lakin, 1967-68-69 Bruce Land, 1961
L a m a r Fo otbal l George Landry, 1982-83-84-85 Louis Landry, 1982-83 Gene Langley, 1986 Bennie Lansford, 1968-69-70 James Laramore, 2010 Mike Laudig, 1975 Danny Lee, 1977-78 Danzell Lee, 1982-83-84 Paul Lee, 1981-82 Johnny Lee, 1966-67-69 Stephen Lee, 1985-86-87-88 Jabo Leonard, 1972-73-74-75 W.S. (Bud) Leonard, 1951-52 Mark Lerch, 1985-86 Jon Lesage, 1962 George Levias, 1984 Ranzy Levias, 1984-85-86-87 Russ Levine, 1971-72-74 Kacy Lewis, 1986-87-88-89 William Lewis, 1968-69 Bill Lierman, 1951-52 Roy Lierman, 1951-52 David Lightfoot, 1970-71-72 Ilester Little, 1983 Octavious Logan, 2010-11 Mike Long, 1979 Jermaine Longino, 2012Donte Lopez, 2010 Mike Lovett, 1974-75-76 Brad Lowe, 1973-74-75 Bill Lucas, 1967-68 R.T. Luce, 1957-58 Mark Ludwig, 1968-69 Rodney Lukaszewski, 1975-76-77-78 Barry Lussier, 1967-68-69 Parnell Lykes, 1980-82
Phillip Mack 1982-84
Phillip Mack, 1982-83-84 Troy Mack, 1985-86-87-88 Chris Maikranz, 2010-11-12Chris Mager, 1989 Anthony Majors, 1983 Marcus Malbrough, 2011-12 James Mallow, 1957 Dennis Malveaux, 1985-86 Ed Marcontell, 1963-64-65-66 Mordie Marcontell, 1967-68-69 Mike Marlow, 1978-79-80-81 John Henry Marshall, 1951-52-53 Wendell Martin, 1957 John Martinez, 1975
Guy Martona, 1953 Alfred Mask, 1977-78-79-80 Doug Matthews, 1969-70-71-72 Don Maxwell, 1957-58-59-60 Harold Mayo, 1962 Roy Mazzagatti, 1951-52 Robert McAnelly, 1968 Kevin McArthur, 1981-82-83 Billy McBay, 1962-63-64 Thomas McClendon, 1971-72-73-74 Randy McCollum, 1967 Larry McCoy, 1981-82 Darrell McDonald, 1975 Scott McDonald, 1988-89 Adrian McDowell, 1982-83-84 Bobby McDowell, 1968 Keith McFaddin, 1983-84-85-86 Danny McFarland, 1982-84-85 David McGaughy, 1960 Tyrus McGlothen, 2012Lonnie McGowen, 1973-75-76 Patrick McGriff, 2012Malcolm McKay, 1959-60-61 Gary McKee, 1958-59-60 Wayne McKeller, 1973 Ryan McLin, 2010 Armour McManus, 1959-60-61 Vernon McManus, 1964-65 Bill McNeill, 1958-59 Robert McNeill, 1965 Joe McReynolds, 1970-72 Kenny McRill, 1962-63 Payden McVey, 2011-12Ronnie Melancon, 1973-74 Bill Menard, 1969-70-71 Stephone Mercer, 2011-12 Dudley Meredith, 1957 Frank Messina, 1968 Raymond Meyer, 1954-55-56 Bruce Miller, 1983-84-85 David Miller, 1959 Hubert Miller, 1954 Robert Milner, 1978-79 Darrell Mingle, 1967-68 Daniel Mitchell, 1988-89 Mike Mitchell, 1973 Nalan Mitchell, 1977 Dave Money, 1985 Drew Montgomery, 1980 Kenny Montgomery, 1965-66-67-68 Arthur Moore, 1986-87-88-89 David Moore, 1975 Robbie Morehead, 1973 Earl Morgan, 1984-85-86 Shawn Morgan, 1985-86-87 Bob Moss, 1954-55 Logan Moss, 2012Ryan Mossakowski, 2012Jeff Muckleroy, 1984 Burton Murchison, 1984-85-86-87 Robert Murphy, 1974 Steven Murray-Sesay, 2010-12 Mark Murrill, 2010-11-12Larry Myers, 1984-85-86-87
Kim Ray Nealy 1985-86
Bob Nance, 1955-56-57 Kim Ray Nealy, 1985-86 Jayce Nelson, 2012John Nelson, 1969-70-71 Larry Neumann, 1972-73 Danny Neuse, 1970-71 Jerry Nichols, 1959-60 Jordan Nixon, 2010 Norman Noble, 1957-58 Larry Norman, 1970 Maurice Novak, 1987 Randy Nunez, 1966-67-68-69
Ricky Overton 1975-78
Andy Oaks, 1985-86-87-88 Anthony Oden, 2011 Brad Oden, 1986 Joe Okafor, 2012Philip O’Neal, 1968-69-70-71 Mike O’Quinn, 1974 Geoge Orebe, 2012Bernard Otto, 1957 Ricky Overton, 1975-77-78 B.J. Oyefeso, 2012
113
La mar Foo tba l l
Phillip Primm 1963-66
George Pachuca, 1969-70 Paul Palmer, 1970 George Parks, 1956-57 Robert Parma, 1957-58 Wesley Parma, 1951-52-53 Waylon Patterson, 1986-87-88-89 Taras Payne, 1984-85-86-87 Gehrig Payton, 1975-76-77 Jimmy Peacock, 1955-56-57 George Peddy, 1983 Anthony Pendland, 1973-74-75-76 David Perkins, 1966-67 Tracey Perkins, 1985-86-87-88 Robert Perkins, 1964 Sean Perry, 1989 Joe Persohn, 1983 Keinon Peterson, 2010-11-12Blake Peveto, 2010 Ed Peveto, 1957-58-59 Don Phillips, 1961-62-63 Kurt Phoenix, 1976-77-78-79 Stan Pierce, 1969 Connell Pitts, 1960-61 Payton Ploch, 2010-11-12Wayne Ponder, 1975 Dennis Porter, 1970 Woodrow Porterfield, 1968-69-70 Ronnie Potts, 1966-67-68 Josh Powdrill, 2010-11 Keith Powe, 1987-88-89 Eugene Powell, 1953 Kendrick Prejean, 2010-11 Richard Prejean, 1961-62-63 John Prescott, 2011-12 Doug Prewitt, 2010-11 James Price, 1980-81-82 Phillip Primm, 1963-64-65-66 Keith Pruitt, 1983-84-85-86 Don Ptacek, 1959-60-61 Raymond Purkerson, 1951-52-53 Doug Pursley, 1965-66-67
Donald Rawls 1981-83
Al Rabb, 1973-74-75 Richard Rafes, 1973 Carlos Ramsey, 1962-63 Jerome Raven, 1988-89 Donald Rawls, 1981-82-83 Mike Reeder, 1973-74-75-76 Howland Reich, 1951-52 Howard Reid, 1973 Dudley Rench, 1956-57-58 Eric Reynolds, 1984 Desmond Richards, 2012Lloyd Ricketson, 1968-70-71 Wayne Riley, 1962 Joe Rimes, 1956-59 Myron Riser, 1986-87-88-89 Calvin Roberson, 1978-79-80 Norris Roberts, 1981 Sean Robertson, 2011-12 Edward Robinson, 1971-72 Howard (Boo) Robinson, 1976-77-78-79 James Robinson, 1965-67-68 Von Robinson, 1976 Andrew Rodney, 1987-88 Danny Rogas, 1975-76-77 Jerry Rogers, 1958-59-60 James Rollins, 1975-76-77-78 Joe Rollins, 1984-85 Keffrin Rusk, 1984-85
Tyrone Shavers 1988-89
Audwin Samuel, 1973-74 Juventino Sanchez, 2011-12 Mike Sandera, 1979-80 Ed Sanders, 1968-69 Donnie Schattel, 1977 Pat Schilhab, 1969 Gary Schneeman, 1956 Roger Schott, 1962-63 Will Sciba, 1989
114
Anthony Scott, 1984 Eugene Seale, 1983-84-85 Ezell Seals, 1983-84-85-86 Elton Senegal, 1979-80-81 Gene Sharp, 1953 Tyrone Shavers, 1988-89 Derrek Shelton, 1980-81 Jamie Sherman, 1982-83-84 Aaron Shetley, 2010 Bill Silva, 1954-55-56 David Silva, 1972 David Silvas, 1974-75 Bart Simmons, 1974-75-76 Kevin Simon, 1986-87 Jerry Simons, 1970 James Simpson, 1986-87 Herschel Sims, 2012 Marc Singleton, 1985-86 Zach Skinner, 2010 Henry Sledge, 1958-59-60 Joe Sloan, 1974-75-76 Charles Smaistria, 1953-54 Tommie Smiley, 1965-66-67 Aaron Smith, 1972 Darren Smith, 1988-89 Darryl Smith, 1979-80-81 Don Smith, 1951 Johnny Ray Smith, 1977-78-79-80 Kenneth Smith, 1963-64-65 Kevin Smith, 2011 Mike Smith, 1966 Shad Smith, 1985-86-87-88 Willie Smith, 1984-85-86-87 Greg Somers, 1976 Cory Soto, 2012 Larry Spacek, 1974-75-76-77 Jesse Sparks, 2011-12Larry Spears, 1973-74-75 Lee Spears, 1965-66 Dale Spence, 1973-74-75 Corbin Spitzer, 1977 Cory Stagg, 1986-87 Charles Starcke, 1956-57-58-59 Edgar Stephens, 1963 Marshall Stewart, 1983-84-85-86 Ronnie Stiger, 1981-82 Mick Still, 1987-88 Paul Stockman, 1988 David Stone, 1976 Ralph Stone, 1961-62 Louis Story, 1977-78-79 Justin Stout, 2010-11-12James Street, 1963 Rick Stroman, 1981-82-83 Harvey Stuessel, 1964-65 Andrew Sundermann, 1981-82-83 Lew Surratt, 1976-77-78-79 Rip Sutton, 1970
L a m a r Fo otbal l
Donald Thomas 1981-84
Monte Tatford, 1979 Harrison Tatum, 2010 Bruce Taylor, 1970-71-72 Juan Taylor, 1979-80-81 Paul Taylor, 1973-74-75 Mark Teichman, 1974-75-76 Ken Thompson, 1966-67 Terry Thompson, 1968 Branden Thomas, 2010-11-12Buford Thomas, 1975-76-77-78 Charles Thomas, 1954-55 Donald Thomas, 1981-82-83-84 Henry Thomas, 1982 Tim Thomas, 1986-87-88-89 Chris Thompson, 1980 Courtlin Thompson, 2012Richard Thurman, 1953-54 Bobby Tibbetts, 1961-62-63 George Toal, 1971-72 Robert Tolar, 1960 Trey Tollett, 1974-75-76-77 Tommy Tomlin, 1969-70 Shephard Touchett, 1956-57-58-59 Bob Trahan, 1952 Richard Travis, 1972-73 Rodney Travis, 1967 John Traylor, 1956-57 Sammy Trevino, 1954-55 Charles Truitt, 1955 Kenneth Turk, 1973-74-75 Bruce Turner, 1977 Delmer Turner, 1951-53 Ronnie Turpin, 1979-80
Scott Utterback 2012
Scott Utterback, 2012
Frank Van Renselaer 1988-89
Frank Van Renselaer, 1988-89 Kenneth Vaughn, 1983 Mike Venson, 2011-12 Jay Verde, 1971 Joseph Viator, 2010-11-12 Bill Vincent, 1959-60-61
Willie Walker 1986-89
Arnold Wade, 1979-81 Darryl Waldrep, 1972-73-74-75 Jason Walker, 1989 Norman Walker, 1955-56-57 Ronnie Walker, 1956 Teddy Walker, 1952-53-54 Willie Walker, 1974 Willie Walker, 1986-87-88-89 Clarence Wallace, 1875-76-77 James Wallace, 1954 Tony Walter, 1969 Brent Walters, 2010 Jay Warrick, 1975-76-77-78 James Washington, 2010-11-12Keith Washington, 1985-86 Marcus Washington, 2012Kenny Wamble, 1968 Larry Ward, 1957-58-59 Andrew Washington, 1975-77-78 Darrell Washington, 1974 Eugene Washington, 1963-64-65 Brent Watson, 1983 Wayne Weaver, 1967 David Webb, 1961-62 Michael Wedgeworth, 1975 Mark Welch, 1977-78 Daryl Wells, 1970-71 Brock Wempa, 2012Patrick West, 1989 Bill Whaley, 1951 Jestin White, 2011-12-
Dwayne Whitehead, 1966-67 J.E. Whitmore, 1955-56-57-58 Troy Whitmore, 1989 John Wayne Wiersema, 1965-66 Randolph Wilburn, 1983 Sam Wilcox, 1954 Dan Wilder, 1974 Steve Wilke, 1971-72-73-74 J.D. Wilkins, 1976-77 Dennis Williams, 1980-81-82 Floyd Williams, 1971 George Williams, 1967-68-69 John Williams, 1971-73 Mike Williams, 1971-72-73-74 Ted Williams, 1975 Terry Lee Williams, 1979-80-81-82 Billy Wills, 1956 Herman Wilson, 1961-62 Hubert Wilson, 1960 Jake Wilson, 1988-89 Josh Wilson, 2011-12Tommy Winn, 1963 Bucky White, 1983-84 Tommy White, 1975-78 Davion Wolford, 2011-12 Jim Woodard, 1957-58-59 Jason Woods, 1989 John Woods, 2010-11 Bill Worsham, 1961-62-63-64 Gary Wright, 1973-74 Ronnie Wright, 1961-62 Glynn Wyble, 1954 Spergon Wynn, 1964-65-66-67
Mike Ybarra 1979
Tommy Yates, 1963-64 Mike Ybarra, 1979 Daniel Yezak, 1963-64 Jackie Young, 1968-69-70
115
La mar Foo tba l l Junior College Lettermen Gilbert Adams, 1924-25 Otto Adams, 1924 Ernest Albright, 1946 J.E. Aiken, 1925 Jack Allen, 1942, 46 Terrell Allen, 1948 Lemos Allman, 1935 Ernest Allred, 1923 Angelo Alvarez, 1946-47 Don Anderson, 1950 Roy Andrews, 1923-24 Leroy Arnett, 1933-34 Edgar Asbury, 1934-35 Doug Atwood, 1935 Ovey Babin, 1932, 34 O.D. Bailey, 1936 Buell Bankston, 1934-35 Tom Ball, 1936 Woodrow Bando, 1938 Ray Barfield, 1924-25 Harold Bartlett, 1940-41 Gene (Gabby) Bates, 1948-49-50 Bobbie Baublewsky, 1924 Billy Bayne, 1938 Paul Beard, 1937-38-39 Hubert Beck, 1932-33 George Bedre, 1940-41 Dudley Bell, 1939 Lee Bell, 1926 Bob Bellaire, 1942 Floyd Berg, 1940-41 Joe Bergin, 1926 Melvin Bergin, 1926 Ray Bergin, 1925 Granville Berry, 1940 Lamar Bevil, 1933 Vincent Bevilacqua, 1937-38 Don Black, 1946 Carl Blackmore, 1948 Hugh Blanchette, 1935 Raye Blanchette, 1925 Joe Bland, 1925-26 Thurman Bland, 1932 Billy Bolton, 1938 James Bolton, 1950 Emmett Bone, 1932 Forest Booth, 1926 Sidney Bourgeois, 1924 Joe Bourland, 1938 Bill Bowers, 1937 F.S. (Spud) Braden, 1924-25 Bill Braswell, 1932 Merlin Breaux, 1950 Burren Brown, 1934-35 Red Brown, 1946
116
Wallace Brown, 1941 J.P. Broussard, 1935 Herbert Brunson, 1938-39 Joe Burke, 1939 George Burlin, 1948 Walter Burton, 1946 Bert Buteaud, 1946-48 Ernest Byerly, 1932-33 Clarence Cain, 1933-34 Bill Canfield, 1937 Charles Capps, 1940 Earl Carl, 1939 Vane Cartee, 1932-33 Di Carver, 1932-33 John Certa, 1946-47 Preston Cessac, 1937 Ennis Chafin, 1932 E.J. Chamblee, 1934 Angelo Chimeno, 1940 Godfrey Choate, 1938-39 Allison Crane, 1948 Bo Christian, 1946-47 Fred Clark, 1933-34 Billy Clement, 1942 Harold Clinefelter, 1940 Lester Clodiaux, 1937 Curley Cohn, 1932 Henry Cole, 1936 Melvin Coleman, 1941 E.W. (Duck) Collins, 1940-41 Lamar Combs, 1932-33 M.F. (Red) Conner, 1937-38-39 Frank Cook, 1932 Jules Cook, 1938 Harry Cooke, 1923-24-26 Fred Costilla, 1938-39 D.T. Cotham, 1936 L.M. Coy, 1936-37 Cleo Creamer, 1934 Audie Creel, 1942 Clarence Crenshaw, 1926 James Crouch, 1936-37 H.M. Culpepper, 1940-41 John Curtis, 1948 Ashton Daigle, 1934 Joe Davidson, 1926 Roy Davidson, 1946-47 Averill Davis, 1946 Ludie Davis, 1947 Wade Davis, 1940 Wilbur Davis, 1947 Will Davis, 1948-49 C.C. Dawson, 1942 Elmer Deason, 1932 Johnny Deason, 1934-35
Ray Deaton, 1941 Lionel DeRouen, 1950 Bob Deslatte, 1942 Wilton Deslatte, 1950 Warren DeVillier, 1940 Alan Dickensen, 1938 Wayne Dillon, 1939 A.M Dodd, 1938 Elmo Dorsey, 1948-49-50 Leon Dorsey, 1935 Ted Dorsey, 1932-33 M. Dowell, 1926 Billy Downs, 1939 E.L. Duhon, 1950 Ed Dupree, 1923 Mickey Durk, 1949 Dalton Dyess, 1949 John East, 1937 Moise Eastham, 1932 Buck Elkins, 1932-33 Morris English, 1937-38-39 Frank Evans, 1942 L.E. Ezell, 1924 Johnny Farha, 1938 Johnny Farinella, 1939-40 A.D. Faulk, 1941 Herman Fehl, 1937 Louie (Dutch) Fehl, 1923 Aubrey Felder, 1947-48 Jerome Feldman, 1948 Herb Finger, 1942 Howard Fisher, 1934 Arthur Fore, 1936, 39 Billy Foster, 1926 Leslie Foster, 1926 Johnny Frank, 1937 Elvin Franklin, 1936-37 Melvin Franklin, 1936-37 Bob Frederick, 1948-49-50 Preston French, 1938-39-40 Frank Formuga, 1940 Fred Fulgham, 1949-50 Ken Fulgham, 1950 Sam Gallier, 1941-42 Clifton Garrett, 1946 Sherrill Garrett, 1941 Alton Geisendorff, 1947-48 Walter Gernand, 1936 Leroy Gibson, 1940-41 S.A. Giglio, 1925 Sam Giglio, 1936 Red Gill, 1925 Joe Glasson, 1935 Stanton Glazener, 1948-49 Art (Snow) Gordon, 1932-33
Harley Graff, 1949-50 Howard Graff, 1949-50 Claude Graves, 1938 George Gray, 1938 John Gray, 1923-24-25 John Green, 1932 Maurice Green, 1932-33 Sterling Griffin, 1947 Charles Griffith, 1949 Claude Gunn, 1938 Chris Hahn, 1924-25 Bob Hall, 1936 Earl Hall, 1949 Milton Hall, 1948 Pearman Hardy, 1947 Maxey Hargrove, 1923-24 Floyd Harper, 1950 Alfred Harrington, 1950 Bill Hart, 1939, 40, 42 Christy Hartman, 1936-37 Edgar Hass, 1938 Arthur Hawn, 1934-35 Hubert Hawthorne, 1923 Bob Hazlip, 1934 Stanley Head, 1934 Tom Head, 1936 J.W. Henderson, 1947 Henry Hensley, 1932 Victor Herm, 1936 Bobby Hickman, 1948 Elton Hightower, 1950 Arthur Hill, 1950 Gene Hill, 1946 Smitty Hill, 1948-49-50 Andy Hillhouse, 1946 R.A. Hillier, 1949-50 Bud Herring, 1941 Harry Hicks, 1949 J.W. Hise, 1937 Karl Hollier, 1949-50 Gordon Hope, 1936 Orrin Hopper, 1932-33 Charles Howell, 1924 Ezra Clinton Hughes, 1924 Horace Humphrey, 1938 Leo Hyse, 1942 Wilmoth Ingells, 1935 Wayne Ivers, 1938 Bob Jackson, 1939 Fred Jackson, 1946 James Jay, 1936-37 Clinton Johnson, 1933-34 Doyle Johnson, 1932 Jock Johnson, 1941 Ned Johnson, 1937
L a m a r Fo otbal l O.S. Johnson, 1937-38 Malcolm Johnstone, 1936 Curtis Jones, 1935-36 Harvey Jones, 1940 Carroll Kennedy, 1939 Charles Kennedy, 1940 Douglas Key, 1939 Ed Khoury, 1925 Paul (Hog) Kinnear, 1923-24 Curtis Kling, 1932 Herbert Knowles, 1933-34 Bob Kocter, 1942 E.A. LaBauve, 1933 Elmo LaBauve, 1924-25 Leon Lackey, 1938 Ernest Laminack, 1923 Charles Landry, 1939-40 J.C. Landry, 1937 Pat Landry, 1947 Glazer Lane, 1936 Jim Latta, 1949-50 George Laughman, 1934 Danny LeBlanc, 1935 Ira LeBlanc, 1948-49 Otis Lee, 1932-33 J.F. LeGros, 1941 W.S. (Bud) Leonard, 1948-49-50 Billy Lierman, 1948-49-50 Roy (Toby) Lierman, 1949-50 Jack Light, 1936 Walter Looney, 1939 A.J. Luquette, 1946-47 Richard Maddux, 1948 Charles Malitz, 1936-37 Waylon Manning, 1933-34 Roy Marsh, 1926 Bob Marshall, 1948-49 Ernest Marshall, 1936-37 John Marshall, 1950 Joe Martinez, 1950 Gilbert Massey, 1946-47 Clyde Martin, 1949 Clint Mayes, 1932-33 Roy Mazzagatti, 1948-49-50 Jack McCann, 1938-39 Bruce McClelland, 1936 Hugh McConaughey, 1950 J.B. McConnico, 1938 Ben McCowen, 1926 May McCreight, 1940 Graham McCullough, 1923-24 Charles McDonald, 1947 H.A. McDonald, 1925 John McGrew, 1940 Floyd McGuistion, 1935, 37 Jim McHenry, 1935-36 Maurice McInnis, 1939-40
Hal McKinley, 1939 John McLain, 1938 Reagan McLemore, 1924 Jimmy McNeill, 1948-49 Paul McNeill, 1923 Lee Mendenhall, 1936-37 Corwin Menthendall, 1933-34 Herman Meyers, 1937, 39 Leonard Migues, 1932 Theo (Cotton) Miles, 1941-42 Truman Milling, 1947 Bennie Mitchell, 1942 David Mitchell, 1948 Leroy Molbert, 1942 Joe Monford, 1940-41 Ewing Mosely, 1935 Pat Moulden, 1950 Rene Mouton, 1934-35 Red Myers, 1933 Edwin Nash, 1934-35 Goober Nelson, 1924-25 Jim Nelson, 1932 Rudolph Neumann, 1940-41 Garland Nunnelly, 1939 Wesley Nunez, 1942 Charles Oliver, 1946-47 James L. Oliver, 1947 Earl Ott, 1926 Emmett Owen, 1939-40 Stanley Owens, 1925 Jimmy Dan Pace, 1949-50 Harold Gene Palmer, 1948 Don Parker, 1950 Lawrence Parkhouse, 1940 Wesley Parma, 1950 Vernon Perdue, 1935-36 Lucas Petkovsek, 1942 Roy Philip, 1926 Bill Phillips, 1936 Glenn Phillips, 1939 Oail (Bum) Phillips, 1941, 46-47 Bill Plake, 1941 S.R. Plake, 1936 Jimmy Plyton, 1942 Preston Premeaux, 1948 Jeff Purdon, 1932-33 Ray Purkerson, 1950 Pat Rachal, 1948 Lehman Rahn, 1934 Leon Rahn, 1935-36 Vernon Ramke, 1946-47 Charles (Bubba) Ray, 1941-42 Stanley Ray, 1935 Arthur Reddell, 1925 Jimmy Reed, 1937 L.D. Reed, 1934-35 Bert Reeder, 1946
Aubrey Reeves, 1940 Howland Reich, 1949-50 Joe Renfrom, 1932 Jasper Rizzo, 1941 O.J. Rivere, 1940 D.L. Richards, 1934 Frankie Rinando, 1936 Robert Roberts, 1926 Walter Robin, 1950 Frank Roccaforte, 1940 Carlos Rojo, 1948 Carlos Romano, 1946-47 Tony Rossi, 1934 Bill Roy, 1937 Robert (Rob) Roy, 1926 Bobby Roop, 1950 Woodrow Roy, 1933-34 Clyde Rush, 1933-34 Lew Russell Jr., 1948-49 Sam Salim, 1947-48-49 Ralph Sanders, 1934 Sandy Sanderson, 1949 David Sapp, 1950 Tommie Saxe, 1925-26 Meryl Self, 1936 Charlie Schmucker, 1932 Jackie Scouten, 1948-49 Larry Shaw, 1940 Bill Sheffield, 1936-37 Dick Sheffield, 1942-46 Otho Shirley, 1924-25 W.W. Simmons, 1947 W.G. Shivers, 1940 Lawrence Smailhall, 1934-35 Eugene Smiley, 1947, 49 Bobby Lee Smith, 1946 Brandt Smith, 1947-48 James Smith, 1934-35 Richard Smith, 1938 Robbie Dee Smith, 1946-47 Wallace Smith, 1932 Gene Sory, 1948 Christy Sparks, 1941 I.D. Sparks, 1942 Melvyn Sparks, 1937, 39 Earl Spell, 1938 Asa Spencer, 1923 Odre Speyrer, 1947 Alvin Stahl, 1925 Durwood Steele, 1934-35 Ray Sterling, 1940 Kenneth Stowe, 1946 W.L. Straughn, 1941 Bill Steussey, 1938 Herman Strauss, 1950 Kelley Strayberry, 1937 Fred Stone, 1939
W.A. Strickland, 1937-38 Voy Strother, 1939 Sterling Swift, 1948 Earl Swinney, 1932 Rudolph Tatum, 1924 Mike Tawell, 1947 Joe Tilley, 1937-38-39 James Travis, 1935 Don Trawick, 1950 Sam Trevino, 1949-50 Tommy Trigge, 1946-47 Sidney Trimble, 1940-41 Richard Tucker, 1948 Don Tucket, 1948 Ed Vallee, 1932 Jake Verde, 1932-33 J.B. Vick, 1948 Vernon Vick, 1947 Jack Viterbo, 1938-39 Hugh Wagner, 1947 John Walker, 1926 Tillie Walker, 1923-24 William Walker, 1926 Robin Walter, 1950 L.R. Weldon, 1949-50 Bobby Wendrock, 1939 Joe Westerman, 1948 Billy Wherry, 1932-33 Bill White, 1939 Morris White, 1932-33 John Whitely, 1940-41 Felix Wiggins Jr., 1948 Perry Wiggins, 1932 Robert Williams, 1936 Charles Williamson, 1946-47 Billy Willingham, 1947 Hugh Wilson, 1932 John D. Wilson, 1939-40-41 L.C. Wilson, 1923-24 Tommy Wilson, 1949-50 Jack Winstel, 1950 Charles Woodridge, 1946 Nolan Woods, 1939 Carl Van Wormer, 1926 Orville Wright, 1942 Virgil Wright, 1941 Irving Wyble, 1934-35 Mortimer Wyble, 1935 Warren Wyble, 1932-33-34 Charles Young, 1940 Harold Young, 1924 Willard Young, 1938-39 Desmond Zoch, 1946-47 Shelton Zorn, 1938
117
La mar Foo tba l l Cardinal Hall of Honor Football
Baseball
Gene (Gabby) Bates (1998) ............................1948-52 Kevin Bell (2002) ...........................................1974-77 Richard Bjerke (2003) ....................................1964-67 Nader Bood (1987) .........................................1958-60 Matt Burnett (1999) ........................................1975-78 Sammy Carpenter (1973)................................1951-54 Rondy Colbert (2002) .....................................1971-74 Dickie Croxton (1991)....................................1964-67 Jake David (1987)...........................................1964-66 Victor Enard (1999) ........................................1975-79 John Evans (2001) ..........................................1986-89 Bob Frederick (1980)......................................1948-52 Johnny Fuller (1973).......................................1964-67 Patrick Gibbs (2004).......................................1968-71 Anthony Guillory (1985) ................................1962-64 Jackie Harris (1997)........................................1981-84 Larry Haynes (2003).......................................1978-79 Dan Hetzel (2002)...........................................1968-70 Smitty Hill (1995)...........................................1948-53 Bobby Jancik (1979).......................................1960-61 Jesse Kibbles (1998) .......................................1975-78 Bill Kilgore (2006) .........................................1964-67 Lindley King (1981) .......................................1960-62 E.A. "Beans" LaBauve (1979)........................1924-25 Otis Lee (1977) ...............................................1932-33 W.S. "Bud" Leonard (1974)............................1948-52 Ed Marcontell (2001)......................................1962-66 Doug Matthews (1985) ...................................1969-72 Roy Mazzagatti (1977) ...................................1948-52 Jimmy McNeil (1993).....................................1948-49 Dudley Meredith (1973).......................................1957 Burton Murchison (1995) ...............................1984-87 O.A. "Bum" Phillips (1977)..................1941, 1946-47 Phillip Primm (1979) ......................................1963-66 Dr. Ray Purkerson (2001) ...............................1950-53 Howard “Boo” Robinson (2003) ....................1976-79 Sam Salim (1977) ...........................................1948-49 Charles Schmucker (1995)...................................1932 Eugene Seale (1991) .......................................1983-85 Tom Smiley (1976) .........................................1965-67 Johnny Ray Smith (2006) ...............................1977-81 Jake Verde (1978) ...........................................1932-33 Spergon Wynn (1976) .....................................1964-67
Julio Alonso (1997).........................................1974-75 David Bernsen (1984).....................................1969-72 Kim Christensen (2004)..................................1979-82 Jerald Clark (1993) ........................................1982-85 Dan Hetzel (2002)...........................................1968-70 Tony Mack (2007) ..........................................1980-82 Alan Marr (1999)............................................1980-81 Joe McCann (1989).........................................1976-79 Kevin Millar (2004)........................................1992-93 Rick Nesloney (1998) .....................................1976-77 Wes Parma (1990)...........................................1951-54 Eddie Rundle (1996).......................................1968-69
Men’s Basketball Luke Adams (2000) ........................................1969-71 Jimmy Anders (1987) .....................................1946-48 James Barrum (1973)......................................1959-62 Elmo Beard (1982) .........................................1927-28 Don Bryson (1981) .........................................1962-65 B.B. Davis (1992) ...........................................1977-81 Earl Dow (1978) .............................................1967-69 Phil Endicott (1989)........................................1967-70 Kenny Haynes (2000) .....................................1966-70 Don Heller (2006)...........................................1962-64 Johnny Johnston (1983)..................................1958-61 Clarence Kea (1988) .......................................1976-80 Wayne Moore (1993) ......................................1966-69 Jim Nicholson (1996) .....................................1967-70 Mike Olliver (1992)........................................1977-81 Kenneth Perkins (2001) ..................................1980-84 Otho Plummer (1975) .....................................1925-26 Tom Sewell (1998)..........................................1981-84 Charles Shoptaw (1991) .................................1947-51 Richard Smith (2002) .....................................1961-64
Women’s Basketball Kara (Audrey) Broussard (2001) ....................1982-84 Carolyn Ford (1996) .......................................1979-82 Barbara Hickey (2006) ...................................1988-92 Regina Myers (2002) ......................................1970-74 Melonie (Floyd) Nelson (2001) ......................1978-81 Carol Sims (1999)...........................................1973-77 Susan Smith (2007).........................................1970-73
Men’s Golf Fred "Butch" Baird (1986)..............................1955-58 John K. Barlow (1990) ...................................1964-67 Ronnie Black (1993).......................................1978-81 Trevor Dodds (1997) ......................................1982-85 Kelly Gibson (2000) .......................................1983-86 Mike Nugent (1973) .......................................1965-68 John Riegger (2007) .......................................1982-85 Jimmy Singletary (2007) ................................1967-70
118
L a m a r Fo otbal l Cardinal Hall of Honor Women’s Golf
Volleyball
Louisa Bergsma (2006)...................................1989-93 Dawn Coe-Jones (1995) .................................1981-83 Clifford Ann Creed (1990)..............................1956-60 Gail (Anderson) Graham (1999).....................1983-86
Liz Blue (1997)...............................................1980-83 Laura Broughton (1998) .................................1975-77 Barbara Comeaux (2000)................................1964-68 Lucy (Wiggins) McCordic (2009) ..................1973-76 Ruby Randolph (2004) ...................................1981-85 Leanne Zeek (2000)........................................1986-89
Men’s Tennis Luis Baraldi (2007).........................................1970-73 Pedro Bueno (1999)........................................1955-59 Don Coleman (1973) ......................................1952-55 Carlos Lopez (2009) .......................................1974-77 James Schmidt (1975).....................................1955-58 Sherwood Stewart (1984) ...............................1966-68 Jaime Subirats (2000) .....................................1965-68
Women’s Tennis Cathy Beene (1993) ........................................1969-73 Linda Rupert (1993) .......................................1970-74
Men’s Track & Field Troy Amboree (1998) .....................................1981-84 Doug Boone (1975) ........................................1965-68 Kevin Bell (2002) ...........................................1974-77 Doug Boone (1975) ........................................1965-68 Randy Clewis (1981) ......................................1967-68 Jackie Colbert (1988)......................................1969-72 Barry Collins (2003).....................1967-71 & 1980-99 Don Delaune (1981) .......................................1967-68 Thomas Eriksson (1995).................................1982-85 Mike Favazza (1981) ......................................1967-68 Efren "Dede" Gipson (1983)...........................1972-74 Jackie Harris (1997)........................................1981-84 Douglas Hinds (1996).....................................1978-82 Junior Holmes (2003) .....................................1976-79 Jesse Kibbles (1998) .......................................1976-80 Jonas Lundrstrom (2009)................................1988-89 Frank Montebello (1996)................................1979-82 Wes Parma (1990)...........................................1951-54 John Richardson (1981)..................................1966-68 Colin Ridgway (1992) ....................................1961-64 Daniel Stagg (2002)........................................1977-78 Ian Stewart (1973) ..........................................1959-62 Waverly Thomas (1981) .................................1966-68
Coach, Administrator, etc. F.S. "Spud" Braden (1973) ................1924 & 1934-39 Barry Collins (2003) .......................................1980-99 Katrinka Crawford (2004) ..............................1981-95 John E. Gray (1973)........................................1923-84 Bobby Gunn (1982) ........................................1962-71 J.B. Higgins, Jr. (1973) ...................................1949-84 Lewis Hilley (1973)........................................1952-62 Dr. Belle Mead Holm (1996) ..........................1964-83 Sonny Jolly (1995)..........................................1972-91 Jack Martin (1974)..........................................1951-76 Pat Park (1997) ...............................................1968-94 John Payton (2003) .........................................1970-82 Dan Rogas (1986) ...........................................1955-91 Rob Roy (1988) ..............................................1926-29 Dr. James W. Shuffield (1983)........................1962-84 Joe Lee Smith (1989) ..........................1963-79, 91-96 Tyrus "Ty" Terrell (1973)................................1956-68 Billy Tubbs (1986) ...............1955-71, 76-80, & 02-11 Al Vincent (1980).........................1933-35 & 1973-84 G. A. Wimberly, Sr. (1978) .............................1926-73 Paul Zeek (1998).............................................1971-06
Big Red Award Al Caldwell (1997) Dave Hofferth (1997) Ed Dittert (1977) Dr. James M. Simmons (2004)
Women’s Track & Field Becky Brooke (2006)......................................1983-87 Midde Hamrin (1995) .....................................1980-83 Cathy Mendoza (2004) ...................................1973-77
Softball Regina Myers (2002) ......................................1970-74
119
La mar Foo tba l l Offensive Team Records Rushing Total Offense Most Yards (Game)........................454 vs. Mexico Poly, 9/10/60 Most Yards (Season) ...............................2,618, 1959 (11 games) Fewest Yards (Game) ................-24 vs. Arkansas State, 11/14/87 Fewest Yards (Season) ...............................663, 2010 (11 games) Most Attempts (Game) ......................75 at Texas State, 10/24/59 Most Attempts (Season).............................611, 1959 (11 games) Fewest Attempts (Game).........9 vs. Sam Houston State, 9/18/10 Fewest Attempts (Season) .........................293, 1989 (10 games)
Most Yards (Game) ............581 vs. Louisiana-Monroe, 10/10/87 Most Yards (Season) ...............................4,080, 1989 (10 games) Fewest Yards (Game).................29 vs. McNeese State, 11/13/76 Fewest Yards (Season)..............................2,202, 1956 (9 games) Most Plays (Game) ..............108 at New Mexico State, 11/14/70 Most Plays (Season) ..................................815, 1970 (10 games) Fewest Plays (Game) ..............44 vs. Lousiana-Monroe, 9/23/61 Fewest Plays (Season) .................................490, 1956 (9 games)
Passing Most Yards (Game) .......................429 at McNeese State, 9/4/10 Most Yards (Season) ...............................2,934, 1989 (10 games) Most Attempts (Game)...................63 at UT Arlington, 11/21/81 Most Attempts (Season).............................431, 1989 (10 games) Most Completions (Game) .........34 at Southeastern La., 9/18/10 Most Completions (Season).......................239, 1979 (11 games) Most TD Passes (Game)..........6 vs. Sam Houston State, 9/19/81 ..........................................................at Louisiana Tech, 11/15/69 Most TD Passes (Season) ............................24, 1979 (11 games) Most Interceptions (Game) ...7 at Louisiana-Lafayette, 10/25/80 Most Interceptions (Season) ........................26, 1984 (11 games) ...........................................................................1969 (10 games) Fewest Interceptions (Season) .......................5, 1988 (11 games) Fewest Yards (Game).................0 at New Mexico State, 11/4/72 ......................................................at Abilene Christian, 10/30/71 Fewest Yards (Season)...............................571, 1951 (10 games) Fewest Attempts (Game)...........3 at Abilene Christian, 10/30/71 Fewest Attempts (Season) .............................95, 1958 (8 games) Fewest Completions (Game).....0 at Abilene Christian, 10/30/71 Fewest Completions (Season) .....................33, 1951 (10 games)
Scoring Most Points (Game) ....................67 vs. Sul Ross State, 11/16/57 Most Points (Season) .................................283, 1987 (11 games) Best Scoring Average (Season).................28.1, 1989 (10 games) Consecutive Games Scored.......................................64, 1953-60 Fewest Points (Season) ................................97, 1976 (11 games)
Miscellaneous Most First Downs (Game) .....33 at New Mexico State, 11/14/70 Most Fumbles (Game) .............11 vs. Abilene Christian, 10/1/60 Most Fumbles Lost (Game).......6 vs. Abilene Christian, 10/1/60 ..................................................vs. Louisiana-Lafayette, 9/18/54 Most Turnovers (Game)...............10 at Rice, 9/22/84 (5 F & 5 I) Fewest Turnovers (Season) ..........................14, 1988 (9 F & 5 I) Fewest Fumbles Lost (Season) ......................8, 1986 (11 games) ...........................................................................1989 (10 games)
Largest Margin of Victory Margin 58 48 43 43 41 41
Score 58-0 60-12 50-7 55-12 54-13 41-0
Opponent Texas College at Mexico Poly vs. Sam Houston State Southwest Missouri at Abilene Christian Sam Houston State
Date 9/3/11 11/28/53 9/19/81 9/24/66 10/14/67 9/23/89
Chris Ford set school records with 73 catches for 918 yards in 1989 Andre Bevil helped the Cardinals establish a new single game passing record of 429 yards in the 2010 season opener at McNeese State
120
L a m a r Fo otbal l Defensive Team Records Rushing Scoring Most Yards Allowed (Game) ....512 by Arkansas State, 11/15/86 Most Yards Allowed (Season).................3,283, 1987 (11 games) Fewest Yards Allowed (Game) .......-25 by Texas College, 9/3/11 Fewest Yards Allowed (Season) ..................806, 1958 (8 games) Most Attempts Against (Game)...........80 by West Texas A&M, 10/14/78 Most Attempts Against (Season) ...............630, 1987 (11 games) Fewest Attempts Against (Game) ...21 by Stephen F. Austin, 11/5/11 Fewest Attempts Against (Season) ..............301, 1958 (8 games)
Passing Most Yards Allowed (Game)....456 by Louisiana Tech, 11/16/88 Most Yards Allowed (Season) ................2,397, 2012 (12 games) Most Attempts Allowed (Game).....70 by Stephen F. Austin, 11/3/12 Most Attempts Allowed (Season) ..............394, 2012 (12 games) Most Completions Allowed (Game).......43 by West Texas A&M, 9/3/88 Most Completions Allowed (Season) ........228, 2012 (12 games) Most TD Passes Allowed (Game)...5 by UT Arlington, 11/22/69 ......................................................vs. Stephen F. Austin, 11/5/11 Most TD Passes Allowed (Season) ..............22, 2011 (11 games) Fewest Yards Allowed (Game)................-7 by Trinity University, 11/4/67 Fewest Yards Allowed (Season) ..................542, 1958 (8 games) Fewest Attempts Allowed (Game)............2 by Abilene Christian, 10/3/59 Fewest Attempts Allowed (Season)...........108, 1955 (10 games) Fewest Completions Allowed (Game).................0, several times Fewest Completions Allowed (Season).......39, 1955 (10 games)
Most Points Allowed (Game).....77 by Louisiana Tech, 11/15/69 Most Points Allowed (Season)...................430, 2011 (11 games) Fewest Points Allowed (Season) ...................52, 1958 (8 games) Shutouts (Season) ............................................3, 1958 (8 games)
Miscellaneous Fewest First Downs Allowed (Game) ...................................0 by ...........................................Texas A&M-Corpus Christi, 9/27/58 Most Fumbles Caused (Game) .......13 at Texas Southern, 9/6/80 Most Fumbles Caused (Season)...................47, 1980 (11 games) ...........................................................................1971 (11 games) Fewest Fumbles Caused (Season) ...............11, 2012 (12 games) Most Fumbles Recovered (Game) ....8 at Texas Southern, 9/6/80 ..........................................................vs. McNeese State, 9/21/68 Fewest Fumbles Recovered (Season) ............3, 2012 (12 games)
Largest Margin of Defeat Margin 68 66 62 59 59
Score 71-3 66-0 69-7 69-10 66-7
Opponent at Stephen F. Austin at Sam Houston State at Arkansas State at Stephen F. Austin at Trinity University
Date 9/25/10 10/29/11 10/31/70 11/5/11 10/25/52
Interceptions Most Interceptions (Game) .............6 at Louisiana Tech, 9/24/83 ...........................................................vs. UT Arlington, 10/31/64 .........................................................vs. Sul Ross State, 11/16/57 Most Interceptions (Season) ........................29, 1971 (11 games) Fewest Interceptions (Season) .......................5, 1985 (11 games) Consecutive Games with Interception ......................15, 1963-65
Total Offense Most Yards Allowed (Game)....675 by Louisiana Tech, 11/16/68 Most Yards Allowed (Season).................5,042, 1987 (11 games) Fewest Yards Allowed (Game) .........-6 by Texas College, 9/3/11 Fewest Yards Allowed (Season) ...............1,348, 1958 (8 games) Most Plays Allowed (Game) ..109 by Stephen F. Austin, 11/3/12 Most Plays Allowed (Season) ....................888, 1987 (11 games) Fewest Plays Allowed (Game)........37 by Louisiana-Lafayette, 9/28/57 Fewest Plays Allowed (Season)...................427, 1958 (8 games)
Arthur Moore defending at Rice in 1987
121
La mar Foo tba l l Rushing Most Yards in a Game 259 by Burton Murchison at Rice, 9/28/85 Most Yards in a Season 1,547 by Burton Murchison, 1985 Most Yards in a Career 3,598 by Burton Murchison, 1984-87 Most Carries in a Game 33 by Floyd Dorsey vs. Sam Houston State, 9/18/82 Most Carries in a Season 265 by Burton Murchison, 1985 Most Carries in a Career 665 by Burton Murchison, 1984-87 Most Yards by a Freshman 607 by Sammy Carpenter, 1951 Most Yards by a Sophomore 1,547 by Burton Murchison, 1985 Most Yards by a Junior 830 by Burton Murchison, 1986 Most Yards by a Senior 890 by Tommie Smiley, 1967 Longest Run From Scrimmage 85 yards by Eugene Washington vs. Trinity, 11/6/65
Total Offense Most Yards in a Game 426 by Andre Bevil at McNeese State, 9/4/10 (-3 rushing, 429 passing) Most Yards in a Season 2,995 by John Evans, 1989 (94 rushing, 2,901 passing) Most Yards in a Career 6,379 by John Evans, 1986-89 (32 rushing, 6,347 passing) Most Plays in a Game 66 by Fred Hessen at UT Arlington, 11/21/81 (5 rushing, 61 passing) Most Plays in a Season 504 by John Evans, 1989 (90 rushing, 414 passing) Most Plays in a Career 1,263 by John Evans, 1986-89 (265 rushing, 998 passing) Most Yards by a Freshman 1,429 by Ray Campbell, 1980 (-62 rushing, 1,491 passing) Most Yards by a Sophomore 1,643 by Tommy Tomlin, 1969 (80 rushing, 1,563 passing) Most Yards by a Junior 2,120 by Fred Hessen, 1981 (12 rushing, 2,108 passing) Most Yards by a Senior 2,995 by John Evans, 1989 (94 rushing, 2,901 passing)
Individual Records Passing Most Yards in a Game 429 by Andre Bevil at McNeese State, 9/4/10 Most Yards in a Season 2,901 by John Evans, 1989 Most Yards in a Career 6,347 by John Evans, 1986-89 Most Attempts in a Game 61 by Fred Hessen at UT Arlington, 11/21/81 Most Attempts in a Season 414 by John Evans, 1989 Most Attempts in a Career 998 by John Evans, 1986-89 Most Completions in a Game 34 by Andre Bevil at Southeastern Louisiana, 9/18/10 Most Completions in a Season 233 by Larry Haynes, 1979 Most Completions in a Career 533 by John Evans, 1986-89 Best Completion Percentage in a Game .858 (12-of-14) by Tommy Tomlin vs. West Texas A&M, 9/19/70 Best Completion Percentage in a Season .585 (113-of-193) by Ryan Mossakowski, 2012 Best Completion Percentage in a Career .555 (325-of-586) by Larry Haynes, 1978-79 Most TD Passes in a Game 6 by Tommy Tomlin at Louisiana Tech, 11/15/69 Most TD Passes in a Season 21 by Larry Haynes, 1979 Most Touchdown Passes in a Career 40 by John Evans, 1986-89 Most Consecutive Passes Without an Interception 192 by John Evans, 1987 (22) and 1988 (170) Most Interceptions in a Game 6 by Brent Watson at McNeese State, 11/17/84 Most Interceptions in a Season 23 by Tommy Tomlin, 1969 Most Interceptions in a Career 37 by Ray Campbell, 1980-83 Most Yards by a Freshman 1,491 by Ray Campbell, 1980 Most Yards by a Sophomore 1,563 by Tommy Tomlin, 1969 Most Yards by a Junior 2,108 by Fred Hessen, 1981 Most Yards by a Senior 2,901 by John Evans, 1989 Longest Pass Play 87 yards from George Parks to Larry Ward vs. Howard Payne, 10/26/57
Floyd Dorsey
Sammy Carpenter
All-Purpose Yards Most Total Yards in a Game 290 by Sammy Carpenter at Sul Ross State, 11/15/52 (210 rushing, 80 kickoff returns) Most Total Yards in a Season 1,587 by Burton Murchison, 1985 (1,547 rushing, 40 receiving) Most Yards in a Career 4,203 by Burton Murchison, 1984-87 (3,598 rushing, 510 receiving, 95 kickoff returns)
122
Burton Murchison
Larry Haynes
L a m a r Fo otbal l Individual Records Receiving Field Goals Most Catches in a Game 14 by J.J. Hayes vs. McNeese State, 11/19/11 Most Catches in a Season 73 by Chris Ford, 1989 Most Catches in a Career 149 by Ronnie Gebauer, 1967-70 Most Yards in a Game 212 by J.J. Hayes vs. Northwestern State, 10/8/11 Most Yards in a Season 951 by J.J. Hayes, 2011 Most Yards in a Career 2,098 by Ronnie Gebauer, 1967-70 Most TD Passes Caught in a Game 3 by Jordan Edwards at Stephen F. Austin, 11/3/12; by Kevin Johnson vs. McMurry, 10/13/12; by Kevin Johnson vs. Langston, 9/22/12; by J.J. Hayes at Southeastern Louisiana, 9/18/10; by Jesse Cavil vs. Sam Houston State, 9/19/81; by Howard Robinson at UT Arlington, 11/17/79; by Pat Gibbs at Louisiana Tech, 11/15/69 Most TD Passes Caught in a Season 12 by Howard Robinson, 1979 Most TD Passes Caught in a Career 18 by Howard Robinson, 1976-79 Most Catches by a Freshman 39 by Pat Gibbs, 1968 Most Catches by a Sophomore 56 by Ronnie Gebauer, 1968 Most Catches by a Junior 61 by Herbert Harris, 1981 Most Catches by a Senior 73 by Chris Ford, 1989
Scoring Points in a Game 24 by Kevin Johnson vs. McMurry, 10/13/12; by DePauldrick Garrett vs. Texas College, 9/3/11 Points in a Season 78 by Kevin Johnson, 2012; by Sammy Carpenter, 1952 Points in a Career 198 by Sammy Carpenter, 1951-54 Touchdowns in a Game 4 by Kevin Johnson vs. McMurry, 10/13/12; by DePauldrick Garrett vs. Texas College, 9/3/11 Touchdowns in a Season 13 by Kevin Johnson, 2012; by Sammy Carpenter, 1952 Touchdowns in a Career 33 by Sammy Carpenter, 1951-54
Kickoff Returns Most Returns in a Game 7 by Herbert Harris at Louisiana Tech, 10/16/82 Most Returns in a Season 28 by Octavious Logan, 2010; Dwayne Barnes, 1986 Most Returns in a Career 66 by Ranzy Levias, 1984-87 Most Return Yards in a Game 179 by Kevin Johnson at Stephen F. Austin, 11/3/12 Most Return Yards in a Season 661 by Octavious Logan, 2010 Most Return Yards in a Career 1,354 by Ranzy Levias, 1984-87 Most TD Returns in a Career 2 by Kevin Johnson, 2012- ; by Harold LaFitte, 1962-65 Longest Kickoff Return 98 yards by Kurt Phoenix at Western Kentucky, 9/15/79
Most Made in a Game 3 by Justin Stout vs. Oklahoma Panhandle State, 11/20/10; by Frank Van Renselaer vs. McNeese State, 11/18/89; by Mike Marlow at Arkansas State, 11/7/81; by Jabo Leonard vs. Southern Illinois, 11/22/75 and at West Texas A&M, 11/2/74 Most Made in a Season 11 by Mike Marlow, 1981; by Jabo Leonard, 1974 Most Made in a Career 29 by Jabo Leonard, 1972-75 Longest Field Goal 57 yards by Mike Andrie vs. Arkansas State, 11/14/87
Extra Points Most Made in a Game 8 by Justin Stout vs. Texas College, 9/3/11; by Walter Smith at Mexico Poly, 12/2/61; Most Made in a Season 35 by Justin Stout, 2011 Most Made in a Career 84 by Justin Stout, 2010Best Percentage in a Season 1.000 by Paul Stockman (27-of-27), 1988; by Mike Andrie (31-of-31), 1987 and (21-of-21), 1986; by Mike Marlow (18-of-18), 1981; by Jabo Leonard (16-of16), 1973 and (16-of-16), 1974 and (11-of-11), 1975 Consecutive Makes 53 by Mike Andrie, 1985-87
Punt Returns Most Returns in a Game 8 by Johnny Ray Smith vs. Baylor, 9/13/80 Most Returns in a Season 31 by Rondy Colbert, 1973 Most Returns in a Career 71 by Rondy Colbert, 1971-74 Most Return Yards in a Game 118 by Rondy Colbert vs. Louisiana-Lafayette, 10/20/73 Most Return Yards in a Season 344 by Johnny Fuller, 1967 Most Return Yards in a Career 626 by Johnny Fuller, 1964-67 Highest Return Average in a Season 38.5 by J.E. Whitmore, 1956 (4 returns) Highest Return Average in a Career 15.7 by Johnny Fuller, 1964-67 Most TD Returns in a Season 2 by Rondy Colbert, 1973 Most TD Returns in a Career 2 by Johnny Ray Smith, 1977-80; by Don Gordon, 1975-78; by Rondy Colbert, 1971-74; by Johnny Fuller, 1964-67 Longest Punt Return 90 yards by Marcus Jackson vs. Oklahoma Panhandle State, 11/20/10; by Raymond Meyer vs. Texas A&I, 1954
Interceptions Most in a Game 3 by Donald Rawls at Louisiana Tech, 9/24/83; by Pat Gibbs vs. Arkansas State, 11/27/71 Most in a Season 7 by Jake David, 1965; by David Webb, 1961 Most in a Career 14 by Bennie Lansford, 1967-70 Longest Interception Return 96 yards by Tyrus McGlothen vs. Southeastern Louisiana, 9/29/12
123
La mar Foo tba l l Individual Rushing Records Top Single-Game Performances Raymond Meyer Bob Nance J.E. Whitmore Ronnie Fontenot Ronnie Fontenot John Kent Ralph Stone Eugene Washington Harold LaFitte Tommy Smiley Darrell Johnson Tommy Smiley Kenny Montgomery Glen Hill Doug Matthews Doug Matthews Doug Matthews Greg Chambers Ronnie Melancon Anthony Pendland Anthony Pendland Kevin Bell Mike Ellis Ben Booker Ben Booker Ben Booker Floyd Dorsey George Landry Burton Murchison Burton Murchison Burton Murchison Burton Murchison Troy Barrett Kenny Franklin Octavious Logan Mike Venson DePauldrick Garrett
Att. Yds. Avg. TD 96 607 6.3 9 172 1,005 5.8 13 101 671 6.6 8 75 420 5.6 3 77 534 6.9 4 92 475 5.2 2 118 638 5.4 6 68 402 5.9 3 104 551 5.3 6 73 457 6.3 78 425 5.4 101 380 3.8 95 411 4.3 94 407 4.3 3 126 542 4.3 5 95 456 4.8 5 174 890 5.1 6 107 291 2.7 0 126 500 4.0 2 136 581 4.3 5 194 689 3.6 11 182 881 4.8 8 78 278 3.6 1 113 486 4.3 1 94 334 3.6 0 125 393 3.1 5 121 515 4.3 3 100 374 3.7 1 113 396 3.4 0 87 377 4.3 5 130 569 4.4 1 138 433 3.1 4 156 554 3.6 7 91 408 4.5 2 265 1,547 5.8 8 129 830 4.6 9 130 813 6.3 6 120 598 5.0 2 107 522 4.9 8 52 229 4.4 0 104 332 3.2 2 138 585 4.2 2
Name Burton Murchison Burton Murchison Sammy Carpenter Burton Murchison Burton Murchison Tommy Smiley Burton Murchison George Landry Tommy Smiley Ben Booker Sammy Carpenter Kenny Montgomery Burton Murchison Richard Prejean Kenny Montgomery Doug Matthews
Opponent Att. Yds. Rice, 1985 31 259 Prairie View, 1985 22 222 Sul Ross State, 1952 28 210 UTA, 1985 27 202 La. Tech, 1985 31 199 McNeese St., 1967 25 187 La-Monroe, 1987 16 154 Nicholls, 1983 29 152 ACU, 1967 20 149 Arkansas St., 1980 16 143 Sul Ross State, 1953 23 143 Quantico Marines, 1967 16 142 McNeese St., 1985 31 140 Mexico Poly, 1963 17 137 La. Tech, 1967 18 136 NMSU, 1972 23 135
Career Leaders 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14.
Name Burton Murchison, 1984-87 Sammy Carpenter, 1951-54 Doug Matthews, 1969-72 Tommy Smiley, 1965-67 Ben Booker, 1978-81 Kenny Montgomery, 1965-68 J.E. Whitmore, 1955-58 George Landry, 1982-85 Charles Dinhoble, 1957-60 Raymond Meyer, 1954-56 Anthony Pendland, 1973-76 Glen Hill, 1969-72 Ronnie Fontenot, 1959-61 Harold LaFitte, 1962-65
Att. 665 444 569 369 391 366 281 369 234 240 372 426 189 264
Yards 3,598 2,703 2,323 1,781 1,599 1,468 1,386 1,351 1,328 1,314 1,275 1,174 1,061 1,057
Single-Season Leaders 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12.
Name Burton Murchison, 1985 Sammy Carpenter, 1952 Tommy Smiley, 1967 Doug Matthews, 1972 Burton Murchison, 1986 Burton Murchison, 1988 Kenny Montgomery, 1967 Doug Matthews, 1971 Sammy Carpenter, 1953 Bob Nance, 1957 J.E. Whitemore, 1957 Sammy Carpenter, 1951
Att. 265 172 174 182 129 130 168 194 101 118 127 96
Yards 1,547 1,005 890 881 830 813 766 689 671 638 633 607
Sammy Carpenter led the Cardinals in rushing for four straight seasons
Chronological List of 100-Yard Rushing Games Year Player 1952 Sammy Carpenter 1953 Sammy Carpenter Sammy Carpenter 1954 Sammy Carpenter 1957 J.E. Whitmore 1958 J.E. Whitmore 1960 Ronnie Fontenot Dudley Rench Jimmy Davis 1963 Richard Prejean Eugene Washington Dan Yezak 1965 Eugene Washington 1966 Darrell Johnson 1967 Tommy Smiley Tommy Smiley Kevin Montgomery Kevin Montgomery Tommy Smiley Tommy Smiley 1968 Doug Carter
124
Opponent Yards at Sul Ross State 210 Sul Ross State 143 at Sam Houston State 128 at Texas State 102 Texas A&M-Kingsville 115 at Northwestern State 101 South Dakota 132 at Northwestern State 109 Mexico Poly 107 at Mexico Poly 137 at Mexico Poly 112 at Mexico Poly 101 Trinity 109 UT Arlington 129 at McNeese State 187 at Abilene Christian 149 Quantico Marines 142 Louisiana Tech 136 Louisiana Tech 100 at New Mexico State 102 UT Arlington 107
1969 Glen Hill Johnny Lee Year Player 1970 Doug Matthews Doug Matthews 1971 Doug Matthews Doug Matthews Doug Matthews Glen Hill 1972 Doug Matthews Doug Matthews 1974 Ronnie Melancon 1977 Kevin Bell 1979 Floyd Dorsey 1980 Ben Booker Percy Bruce 1981 Ben Booker Ben Booker 1982 Floyd Dorsey George Landry Floyd Dorsey 1983 George Landry
Louisiana-Lafayette 119 at Abilene Christian 115 Opponent Yards at New Mexico State 129 at Louisiana-Lafayette 108 Central Missouri 107 Trinity 105 Louisiana-Lafayette 102 at Abilene Christian 100 at New Mexico State 135 at UTEP 101 McNeese State 110 at McNeese State 126 at Baylor 113 Arkansas State 143 Louisiana-Monroe 105 McNeese State 125 Stephen F. Austin 102 at Stephen F. Austin 126 Louisiana-Monroe 109 Sam Houston State 108 at Nicholls 152
1984 Year 1985
1986 1987 1989 2011 2012
Bruce Miller George Landry Burton Murchison Dennis Haskin Player Burton Murchison Burton Murchison Burton Murchison Burton Murchison Burton Murchison Burton Murchison Burton Murchison Burton Murchison Burton Murchison Troy Barrett Burton Murchison Burton Murchison Burton Murchison Danny Faust DePauldrick Garrett DePauldrick Garrett DePauldrick Garrett
at Louisiana-Lafayette 110 Texas Southern 102 UT Arlington 114 Texas Southern 112 Opponent Yards at Rice 259 Prairie View A&M 222 at UT Arlington 202 at Louisiana Tech 199 McNeese State 140 Texas State 118 Louisiana-Monroe 109 at North Texas 102 at Stephen F. Austin 130 Central State (Okla.) 119 Louisiana-Monroe 154 at UTEP 126 Stephen F. Austin 115 at West Texas A&M 130 Texas College 105 McMurry 104 at McNeese State 112
L a m a r Fo otbal l 100-Yard Rushing Games Burton Murchison (13)
Opponent Att. Yds. Avg. UT Arlington, 9/29/84 19 114 6.0 Prairie View, 9/14/85 22 222 10.1 Texas State, 9/21/85 22 118 5.4 Rice, 9/28/85 31 259 8.4 Louisiana-Monroe, 10/12/85 28 109 3.9 UT Arlington, 10/19/85 27 202 7.5 Louisiana Tech, 11/2/85 31 199 6.4 North Texas, 11/9/85 26 102 3.9 McNeese State, 11/23/85 31 140 4.5 Stephen F. Austin, 9/27/86 22 130 5.9 Stephen F. Austin, 9/26/87 16 115 7.2 Louisiana-Monroe, 10/10/87 16 154 9.6 UTEP, 10/17/87 22 126 5.7
Doug Matthews (7)
Opponent Louisiana-Lafayette, 10/24/70 New Mexico State, 11/14/70 Central Missouri, 10/2/71 Louisiana-Lafayette, 10/23/71 Trinity, 11/6/71 UTEP, 9/16/72 New Mexico State, 11/4/72
Att. 21 27 19 21 20 18 23
Sammy Carpenter (4) Opponent Sul Ross State, 11/15/52 Sam Houston State, ‘53 Sul Ross State, ‘53 Texas State, ‘54
Tommy Smiley (4) Opponent New Mexico State, 9/16/67 Abilene Christian, 10/14/67 McNeese State, 10/21/67 Louisiana Tech, 11/11/67
Ben Booker (3)
Opponent Arkansas State, 11/8/80 Stephen F. Austin, 10/3/81 McNeese State, 10/31/81
Floyd Dorsey (3)
Opponent Baylor, 9/8/79 Stephen F. Austin, 9/11/82 Sam Houston State, 9/18/82
Yds. Avg. 108 5.1 129 4.8 107 5.6 102 4.9 105 5.3 101 5.6 135 5.9
Att. 28 20 23 12
Yds. Avg. 210 7.5 128 6.4 143 6.2 102 8.5
Att. 20 20 25 18
Yds. Avg. 102 5.1 149 7.5 187 7.5 100 5.6
Opponent Att. Yds. Avg. Louisiana-Monroe, 10/30/82 28 109 3.9 Nicholls, 9/3/83 29 152 5.2 Texas Southern, 10/1/83 12 102 8.5
Att. 16 19 22
Yds. Avg. 143 8.9 102 5.4 125 5.7
Att. 11 29 33
Yds. Avg. 113 10.3 126 4.3 108 3.3
Opponent Att. Yds. Avg. Louisiana-Lafayette, 10/25/69 22 119 5.4 Abilene Christian, 10/30/71 27 100 3.7
Kenny Montgomery (2) Opponent Quantico Marines, 10/7/67 Louisiana Tech, 11/11/67
Att. Yds. Avg. 16 142 8.9 18 136 7.6
Eugene Washington (2) Opponent Mexico Poly, 12/7/63 Trinity, 11/5/65
Att. Yds. Avg. 9 112 12.4 9 109 12.1
J.E. Whitmore (2)
Opponent A&M-Kingsville, 11/19/57 Louisiana-Monroe, ‘58
Att. Yds. Avg. 13 115 8.8 17 101 5.9
Att. 20 10 23
Yds. Avg. 105 5.2 104 10.4 112 4.9
Opponent West Texas A&M, 9/16/89
Ronnie Fontenot (1) Dennis Haskin (1) Opponent Texas Southern, 9/1/84
Darrell Johnson (1) Opponent UT Arlington, 11/19/66
Johnny Lee (1)
Opponent Abilene Christian, 10/18/69
Att. Yds. Avg. 10 130 13.0 Att. Yds. Avg. 7 132 18.9 Att. Yds. Avg. 23 112 4.9 Att. Yds. Avg. 12 129 10.8 Att. Yds. Avg. 21 115 5.5
Ronnie Melancon (1) Opponent McNeese State, 11/16/74
Att. Yds. Avg. 23 110 4.8
Bruce Miller (1)
Opponent Att. Yds. Avg. Louisiana-Lafayette, 10/22/83 20 110 5.5
Troy Barrett (1) Opponent Central State, 11/8/86
Att. Yds. Avg. 11 119 10.8
Richard Prejean (1) Opponent Mexico Poly, 12/7/63
Kevin Bell (1)
Opponent McNeese State, 11/12/77
Att. Yds. Avg. 15 126 8.4
Dudley Rench (1)
Opponent Louisiana-Monroe, 9/24/60
Percy Bruce (1)
Opponent Att. Yds. Avg. Louisiana-Monroe, 10/18/80 25 105 4.2
Dan Yezak (1)
Opponent Mexico Poly, 12/7/63
Doug Carter (1)
Att. Yds. Avg. 17 137 8.1 Att. Yds. Avg. 21 109 5.2 Att. Yds. Avg. 6 101 16.8
Att. Yds. Avg. 12 107 8.9
Jimmy Davis (1) Opponent Mexico Poly, 9/10/60
Att. Yds. Avg. 8 107 13.4
Consecutive 100-Yard Games Burton Murchison Burton Murchison Burton Murchison Floyd Dorsey Tommy Smiley
Danny Faust (1)
Opponent South Dakota, 11/24/60
Glen Hill (2)
Opponent UT Arlington, 11/23/68
DePauldrick Garrett (3)
Opponent Texas College, 9/3/11 McMurry, 10/13/12 McNeese State, 11/17/12
George Landry (3)
5 2 2 2 2
1985 Season 1985 Season 1987 Season 1982 Season 1967 Season
Multiple 100-Yard Games Dec. 7, 1963 Mexico Poly Richard Prejean Eugene Washington Dan Yezak
17-137 9-112 6-101
Nov. 11, 1967 Louisiana Tech Kenny Montgomery 18-136 Tommy Smiley 18-100
125
La mar Foo tba l l Individual Passing Records Yards Passing Single Game
Yearly Leaders Year 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 1985 1986 1987 1988 1989 2010 2011 2012
Name Bill Lierman Bill Lierman Eugene Sharp Jerry Boone George Toal Bobby Flores Bobby Flores David Silvas Chris Frederick Chris Frederick Larry Haynes Larry Haynes Ray Campbell Fred Hessen Fred Hessen Ray Campbell Brent Watson Brent Watson John Evans Shad Smith John Evans John Evans Andre Bevil Andre Bevil Ryan Mossakowski
A 44 86 38 38 74 104 71 71 86 81 158 189 105 120 147 202 232 146 256 172 103 60 192 134 114 105 59 184 402 296 365 115 116 129 144 157 281 282 414 288 233 193
C 14 38 16 19 28 46 32 28 34 38 70 81 49 62 74 102 115 74 121 84 39 25 82 49 49 45 20 92 233 157 180 46 52 55 65 77 155 154 228 157 127 113
I 4 11 4 4 9 4 7 8 3 7 4 10 5 6 10 9 8 6 23 10 10 4 11 7 8 13 4 11 18 19 16 15 9 15 13 7 12 3 17 14 10 8
Pct. .318 .418 .421 .500 .378 .443 .450 .394 .395 .469 .443 .429 .466 .517 .503 .506 .498 .452 .473 .488 .379 .417 .427 .366 .430 .429 .339 .500 .580 .530 .498 .400 .448 .426 .451 .490 .552 .546 .551 .545 .545 .585
Yds. 278 703 350 365 445 642 701 407 569 613 1,214 1,112 592 893 1,002 1,549 1,533 850 1,563 1,072 475 370 890 574 615 464 238 1,261 2,641 1,491 2,108 736 710 733 967 956 1,806 1,525 2,901 2,013 1,719 1,194
TD 1 2 1 3 5 5 9 5 4 5 11 7 5 8 10 16 15 4 10 6 3 2 4 2 1 0 1 8 21 7 14 4 4 5 5 5 11 9 17 14 14 13
Name Andre Bevil Andre Bevil Shad Smith John Evans Larry Haynes John Evans Fred Hessen Andre Bevil John Evans John Evans Ray Campbell Tommy Tomlin Shad Smith Tommy Tomlin John Evans Larry Haynes Doug Prewitt John Evans John Evans John Evans Shad Smith
Completions Single Game
Opponent Yds. McNeese State, 2010 429 SE Louisiana, 2010 417 La.-Monroe, 1987 412 UTEP, 1989 407 UTA, 1979 403 Angelo State, 1989 393 UTA, 1981 367 NW State, 2011 360 McNeese State, 1989 353 McNeese State, 1987 341 Houston, 1983 326 La. Tech, 1969 308 Texas State, 1988 304 So. Illinois, 1970 296 La. Tech, 1986 289 NW State, 1979 296 South Dakota, 2010 286 Miss. Coll., 1988 285 West Texas A&M, 1989 283 La.-Lafayette, 1989 281 Northern Ill., 1987 281
Single-Season 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15.
Name John Evans, 1989 Larry Haynes, 1979 Fred Hessen, 1981 Andre Bevil, 2010 Shad Smith, 1987 Andre Bevil, 2011 Tommy Tomlin, 1969 Phillip Primm, 1966 Randy McCollum, 1967 John Evans, 1988 Ray Campbell, 1980 Larry Haynes, 1978 Windell Hebert, 1961 Ryan Mossakowski, 2012 Windell Hebert, 1962
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 12. 12. 13.
Name John Evans, 1986-89 Phillip Primm, 1963-66 Larry Haynes, 1978-79 Shad Smith, 1985-88 Andre Bevil, 2010-11 Windell Hebert, 1959-62 Fred Hessen, 1981-82 Ray Campbell, 1980-83 Tommy Tomlin, 1969-70 Bobby Flores, 1973-76 Brent Watson, 1984-85 Randy McCollum, 1966-67 Charles Starke, 1956-59
Yards 2,901 2,641 2,108 2,013 1,806 1,719 1,563 1,549 1,533 1,525 1,491 1,261 1,214 1,194 1,112
Career Yards 6,347 4,036 3,902 3,833 3,732 2,962 2,844 2,808 2,635 2,259 1,700 1,620 1,376
Name Andre Bevil John Evans John Evans Larry Haynes John Evans Shad Smith John Evans Shad Smith Shad Smith Fred Hessen John Evans
Opponent Comp. SE Louisiana, 2010 34 Angelo State, 1989 33 Miss. College, 1988 31 UT Arlington, 1979 31 McNeese State, 1989 30 Stephen F. Austin, 1987 29 Arkansas State, 1989 27 Louisiana-Monroe, 1987 27 Northern Illinois, 1987 27 UT Arlington, 1981 27 UTEP, 1989 26
Single Season Name 1. Larry Haynes, 1979 2. John Evans, 1989 3. Fred Hessen, 1981 4. Andre Bevil, 2010 Ray Campbell, 1980 6. Shad Smith, 1987 7. John Evans, 1988 8. Andre Bevil, 2011 9. Tommy Tomlin, 1969 10. Randy McCollum, 1967 11. Ryan Mossakowski, 2012 12. Phillip Primm, 1966 13. Larry Haynes, 1978 14. Tommy Tomlin, 1970 15. Bobby Flores, 1973
Career Name 1. John Evans, 1986-89 2. Larry Haynes, 1978-79 3. Shad Smith, 1985-88 4. Phillip Primm, 1963-66 5. Andre Bevil, 2010-11 6. Ray Campbell, 1980-83 7. Fred Hessen, 1981-82 8. Tommy Tomlin, 1969-70 9. Windell Hebert, 1959-62 10. Bobby Flores, 1973-76 11. Randy McCollum, 1966-67 12. Brent Watson, 1984-85 13. Ryan Mossakowski, 2012-
Andre Bevil Fred Hessen threw for 2,108 yards in 1981, the third best single season total in school history
126
Comp. 233 228 180 157 157 155 154 127 121 115 113 102 92 84 82
Comp. 533 325 308 287 284 248 226 205 192 189 126 120 113
L a m a r Fo otbal l Individual Passing Records Pass Attempts Single Game Name Fred Hessen John Evans Larry Haynes Andre Bevil John Evans Tommy Tomlin Shad Smith John Evans John Evans Tommy Tomlin John Evans Shad Smith
Opponent Attempts UT Arlington, 1981 61 Angelo State, 1989 59 UT Arlington, 1979 58 SE Louisiana, 2010 55 McNeese State, 1989 50 Southern Illinois, 1970 49 Stephen F. Austin, 1987 48 Alcorn State, 1989 47 UTEP, 1989 46 Louisiana Tech, 1969 46 Stephen F.  Austin, 1989 44 Texas State, 1988 44
Single-Season 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15.
Name John Evans, 1989 Larry Haynes, 1979 Fred Hessen, 1981 Andre Bevil, 2010 John Evans, 1988 Shad Smith, 1987 Tommy Tomlin, 1969 Andre Bevil, 2011 Randy McCollum, 1967 Phillip Primm, 1966 Ryan Mossakowski, 2012 Bobby Flores, 1973 Windell Hebert, 1962 Larry Haynes, 1978 Tommy Tomlin, 1970
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13.
Name John Evans, 1985-89 Shad Smith, 1985-88 Larry Haynes, 1978-79 Phillip Primm, 1963-66 Andre Bevil, 2010-11 Ray Campbell, 1980-83 Fred Hessen, 1981-82 Bobby Flores, 1973-76 Windell Hebert, 1959-62 Tommy Tomlin, 1969-70 Brent Watson, 1984-85 Randy McCollum, 1966-67 Charles Starke, 1956-59
Attempts 414 402 365 288 282 281 256 233 232 202 193 192 189 184 172
Career
Bobby Flores
Passing Touchdowns Single Game
Name Opponent TD Tommy Tomlin Louisiana Tech, 1969 6 Andre Bevil SE Louisiana, 2011 4 Andre Bevil SE Louisiana, 2010 4 John Evans Angelo State, 1989 4 Larry Haynes UT Arlington, 1979 4 Ryan Mossakowski Nicholls, 2012 3 Ryan Mossakowski Stephen F. Austin, 2012 3 Caleb Berry McMurry, 2012 3 Ryan Mossakowski Langston, 2012 3 Andre Bevil Nicholls, 2011 3 Andre Bevil McNeese State, 2010 3 Andre Bevil Webber International, 2010 3 Doug Prewitt South Dakota, 2010 3 John Evans UTEP, 1989 3 John Evans McNeese State, 1987 3 Shad Smith Stephen F. Austin, 1987 3 Ray Campbell Houston, 1983 3 Larry Haynes Western Kentucky, 1979 3 Larry Haynes Northwestern State, 1979 3 Tommy Tomlin Southeastern Louisiana, 1979 3
Single Season
1. 2. 3. 4. 5. 8. 9. 10. 12. 14.
Attempts 998 601 586 575 521 512 480 472 438 428 273 256 229
Name Larry Haynes, 1979 John Evans, 1989 Phillip Primm, 1966 Randy McCollum, 1967 Andre Bevil, 2011 Andre Bevil, 2010 Fred Hessen, 1981 Ryan Mossakowski, 2012 Shad Smith, 1987 Tommy Tomlin, 1969 Phillip Primm, 1965 John Evans, 1988 George Parks, 1957 Larry Haynes, 1978 Phillip Primm, 1964
Career
Name 1. John Evans, 1985-89 2. Phillip Primm, 1963-66 3. Andre Bevil, 2010-11 Shad Smith, 1985-88 5. Larry Haynes, 1978-79 6. Windell Hebert, 1959-62 7. Fred Hessen, 1981-82 8. Randy McCollum, 1966-67 9. Tommy Tomlin, 1969-70 10. Charles Starke, 1956-59 11. Ryan Mossakowski, 2012Ray Campbell, 1980-83 13. Bobby Flores, 1973-76
John Evans
TD 21 17 16 15 14 14 14 13 11 10 10 9 9 8 8 TD 40 39 28 28 26 23 18 17 16 15 13 13 11
Shad Smith
Phillip Primm finished his four-year Lamar career ranked second in yards passing (4,036) and touchdown passes (39)
Ray Campbell
Phillip Primm
127
La mar Foo tba l l Individual Receiving Records Yearly Leaders Receiving Yards Bob Nance 9 228 Bill Kilgore 44 687 Ronnie Gebauer 56 831 Ronnie Gebauer 48 652 Patrick Gibbs 34 637 Joe Bowser 23 354 Joe Bowser 32 593 Joe Bowser 38 545 Larry Spears 16 288 Larry Spears 25 380 Howard Robinson 19 315 Howard Robinson 9 205 Howard Robinson 27 451 Howard Robinson 59 840 Alfred Mask 34 579 25.3 13.6 14.5 11.4 15.8 12.5 14.3 14.1 13.1 16.1 15.6 14.8 13.6 18.7 15.4 18.5 14.3 18.0 15.2 16.6 22.8 16.7 14.2 17.0 14.9 15.4 18.0 23.7 17.9 16.9 15.2 10.5 12.6 14.3 17.9 470
Yards Receiving Single Game
Yearly Leaders Receptions TD 3 2 2 3 1 4 2 1 2 1 4 2 2 6 2 6 7 4 2 7 3 6 3 2 1 2 0 4 12 4 7 4 1 4 4 3 2 1 4 6 8 1 Glenn Green 12 196 Johnny Fuller 34 517 Bill Kilgore 44 687 Ronnie Gebauer 56 831 Ronnie Gebauer 48 652 Ronnie Gebauer 39 540 Joe Bowser 23 354 Joe Bowser 32 593 Joe Bowser 38 545 Larry Spears 16 288 Larry Spears 25 380 Larry Spacek 22 280 Howard Robinson 9 205 Howard Robinson 27 451 Howard Robinson 59 840 Alfred Mask 34 579 Sam Choice 34 368 16.3 13.6 14.5 11.4 15.8 12.5 14.3 14.1 13.1 16.1 15.2 15.6 14.8 13.6 13.8 15.4 18.5 14.3 18.0 15.2 12.7 22.8 16.7 14.2 17.0 10.8 14.9 15.4 18.0 23.7 17.9 16.9 15.2 10.5 12.6 14.3 17.9 470
TD 3 2 2 3 1 4 1 1 2 1 4 2 2 6 2 6 7 7 4 2 1 3 6 3 2 1 0 0 4 12 4 3 7 4 1 4 4 3 2 1 4 6 8 1
Name J.J. Hayes Jordan Edwards Herbert Harris J.J. Hayes Herbert Harris Howard Robinson Chris Ford J.J. Hayes Bill Kilgore J.J. Hayes Chris Ford Kevin Simon Ronnie Gebauer Ronnie Gebauer Marcus Jackson Marcus Jackson Josh Powdrill Marcus Jackson Ronnie Gebauer Chris Ford Marcus Jackson Ranzy Levias Chris Lafferty
Opponent Yds. Northwestern State, 2011 212 Stephen F. Austin, 2012 208 Louisiana Tech, 1981 192 McNeese State, 2011 189 Louisiana Tech, 1982 182 UT Arlington, 1979 170 McNeese State, 1989 158 Ok. Panhandle State, 2010 150 UT Arlington, 1965 150 Georgia State, 2010 138 Angelo State, 1989 133 Louisiana-Monroe, 1987 132 Arkansas State, 1969 132 UT Arlington, 1968 129 Sam Houston State, 2010 126 SE Louisiana, 2011 123 McNeese State, 2010 123 McNeese State, 2010 123 Southern Illinois, 1968 123 Louisiana-Lafayette, 1989 123 Texas State, 2011 119 Stephen F. Austin, 1987 118 Louisiana-Lafayette, 1989 115
Single Season 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15.
Name J.J. Hayes, 2011 Chris Ford, 1989 Herbert Harris, 1981 Howard Robinson, 1979 Ronnie Gebauer, 1968 J.J. Hayes, 2010 Rodney Clay, 1984 Marcus Jackson, 2010 Bill Kilgore, 1967 Ranzy Levias, 1987 Chris Lafferty, 1989 Ronnie Gebauer, 1969 Rodney Clay, 1985 Patrick Gibbs, 1970 Patrick Gibbs, 1969
Rec. Yards 53 951 73 918 61 911 59 840 56 831 52 745 31 736 41 727 44 687 45 682 55 671 48 652 36 644 34 637 42 622
Career Name Rec. Yards Avg. 1. Robbie Gebauer, 1967-70 149 2,098 14.1 2. Howard Robinson, 1976-79 114 1,811 15.9 3. Bill Kilgore, 1964-67 119 1,769 14.9 4. J.J. Hayes, 2010-11 105 1,696 16.2 5. Patrick Gibbs, 1967-70 115 1,667 14.5 6. Herbert Harris, 1979-82 112 1,624 14.5 7. Joe Bowser, 1971-73 93 1,492 16.0 8. Rodney Clay, 1982-85 69 1,395 20.2 9. Derek Anderson, 1985-88 96 1,361 14.2 10. Johnny Fuller, 1964-67 89 1,301 14.6 11. Ranzy Levias, 1984-87 89 1,280 14.4 12. Chris Ford, 1986-89 105 1,251 11.9 13. Chris Lafferty, 1986-89 98 1,242 12.7 14. Marcus Jackson, 2010-11 65 1,159 17.8 15. Alfred Mask, 1977-80 77 936 12.2
Herbert Harris has two of the top five single game receiving performances in LU history
128
L a m a r Fo otbal l Individual Receiving Records Receptions Single Game Name J.J. Hayes Herbert Harris Chris Ford Chris Ford Herbert Harris Howard Robinson Ronnie Gebauer J.J. Hayes Chris Ford Bill Kilgore Ranzy Levias Willie Walker Patrick Gibbs Barry Ford J.J. Hayes J.J. Hayes Kevin Simon Ronnie Gebauer Ronnie Gebauer
Opponent McNeese State, 2011 Louisiana Tech, 1981 McNeese State, 1989 Angelo State, 1989 Louisiana Tech, 1982 UT Arlington, 1979 Arkansas State, 1969 Northwestern State, 2011 Louisiana-Lafayette, 1989 UT Arlington, 1965 Stephen F. Austin, 1987 Texas Tech, 1988 Louisiana Tech, 1968 Nicholls, 2012 McNeese State, 2010 Sam Houston State, 2010 Louisiana-Monroe, 1987 UT Arlington, 1968 Southern Illinois, 1968
No. 14 13 12 11 11 11 11 10 10 10 10 10 10 9 9 9 9 9 9
Single Season 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15.
Name Chris Ford, 1989 Herbert Harris, 1981 Howard Robinson, 1979 Ronnie Gebauer, 1968 Chris Lafferty, 1989 J.J. Hayes, 2011 J.J. Hayes, 2010 Barry Ford, 2012 Ronnie Gebauer, 1969 Ranzy Levias, 1987 Bill Kilgore, 1967 Johnny Fuller, 1967 Patrick Gibbs, 1969 Marcus Jackson, 2010 Patrick Gibbs, 1968 Bill Kilgore, 1965 Ronnie Gebauer, 1970 Willie Walker, 1988
Rec. Yards 73 918 61 911 59 840 56 831 55 671 53 951 52 745 49 470 48 652 45 682 44 687 43 586 42 622 41 727 39 408 39 509 39 540 39 411
Name Robbie Gebauer, 1967-70 Bill Kilgore, 1964-67 Patrick Gibbs, 1967-70 Howard Robinson, 1976-79 Herbert Harris, 1979-82 Chris Ford, 1986-89 J.J. Hayes, 2010-11 Chris Lafferty, 1986-89 Derek Anderson, 1985-88 Joe Bowser, 1971-73 Ben Booker, 1978-81 Johnny Fuller, 1964-67 Ranzy Levias, 1984-87 14. Alfred Mask, 1977-80 15. Barry Ford, 2010-
Name Jordan Edwards Kevin Johnson Kevin Johnson J.J. Hayes Jesse Cavil Howard Robinson Patrick Gibbs Several tied with 2
Rec. Yards 149 2,098 119 1,769 115 1,667 114 1,811 112 1,624 106 1,251 105 1,696 98 1,242 96 1,361 93 1,492 91 565 89 1,301 89 1,280 77 936 73 695
Opponent TD Stephen F. Austin, 2012 3 McMurry, 2012 3 Langston, 2012 3 Southeastern Louisiana, 2010 3 Sam Houston State, 1981 3 UT Arlington, 1979 3 Louisiana Tech, 1969 3
Robbie Gebauer
Single Season 1. 2. 3. 5.
10.
Name Howard Robinson, 1979 Kevin Johnson, 2012 J.J. Hayes, 2011 Marcus Jackson, 2010 Herbert Harris, 1981 Patrick Gibbs, 1970 Patrick Gibbs, 1969 Bill Kilgore, 1967 Johnny Fuller, 1966 Marcus Jackson, 2011 J.J. Hayes, 2010 Tyrone Shavers, 1989 Joe Bowser, 1972 Bill Kilgore, 1966 Frazer Dealy, 1964
TD 12 10 8 8 7 7 7 7 7 6 6 6 6 6 6
Herbert Harris
Career 1. 2. 3. 4. 6. 7. 10. 12.
Career 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12.
TD Receptions Single Game
Name Howard Robinson, 1976-79 Patrick Gibbs, 1967-70 Bill Kilgore, 1964-67 J.J. Hayes, 2010-11 Marcus Jackson, 2010-11 Frazer Dealy, 1963-65 Derek Anderson, 1985-88 Joe Bowser, 1971-73 Johnny Fuller, 1964-67 Tyrone Shavers, 1988-89 Herbert Harris, 1980-82 Kevin Johnson, 2012-
TD 18 16 15 14 14 13 12 12 12 11 11 10
Howard Robinson
Chris Ford
J.J. Hayes set school records for receiving yards in a game (212) and receptions in a game (14).
129
La mar Foo tba l l Individual Total Offense Records Single Game Bill Lierman Sammy Carpenter Sammy Carpenter Doug Matthews Bobby Flores Bobby Flores Bobby Flores Charles Behn Kevin Bell Larry Haynes Larry Haynes Ray Campbell Fred Hessen Fred Hessen George Landry Dennis Haskin Burton Murchison Burton Murchison Shad Smith John Evans John Evans Andre Bevil Andre Bevil Ryan Mossakowski
Pass 70 703 40 125 445 642 701 407 569 613 1,214 1,112 722 893 1,002 1,549 1,533 850 1,563 1,072 475 0 890 574 579 358 0 1,261 2,641 1,491 2,108 736 554 429 44 59 1,806 1,525 2,901 2,013 1,719 1,194
Rush 607 475 671 420 149 -41 54 99 176 142 197 51 114 131 36 211 26 78 80 -116 269 881 -13 49 30 111 515 78 -213 -62 12 -7 0 243 1,547 830 -92 119 94 28 171 23
Total 667 1,178 711 545 594 601 755 506 745 755 1,411 1,163 836 1,024 1,038 1,760 1,559 928 1,643 956 744 881 877 623 609 469 515 1,339 2,428 1,429 2,120 729 554 672 1,591 889 1,714 1,644 2,995 2,041 1,890 1,217
Avg. 74.1 117.8 71.1 77.9 84.9 66.8 75.5 63.3 62.1 75.5 128.2 116.3 92.9 102.4 148.3 176.0 155.9 92.8 192.6 159.3 67.6 80.1 87.7 69.2 76.1 78.2 46.8 121.7 220.7 129.9 192.7 81.0 61.6 74.7 144.6 80.8 190.4 149.5 299.5 204.1 189.0 152.1
TD (P/R) 13 (4/9) 6 (2/4) 9 (1/8) 4 (1/3) 9 (5/4) 12 (5/7) 14 (9/5) 6 (5/1) 6 (4/2) na na na 6 (6/0) 8 (8/0) 11 (10/1) 17 (16/1) 17 (14/3) 6 (4/2) 12 (10/2) 8 (6/2) 6 (3/3) 8 (0/8) 8 (8/0) 5 (2/3) 6 (3/3) 2 (2/0) 3 (0/3) 13 (8/5) 25 (21/4) 8 (7/1) 17 (14/3) 5 (4/1) 7 (0/7) 4 (3/1) 9 (1/8) 9 (0/9) 12 (11/1) 14 (9/5) 22 (17/5) 14 (14/0) 14 (14/0) 13 (13/0)
Name Andre Bevil John Evans John Evans Andre Bevil John Evans Shad Smith Larry Haynes Andre Bevil John Evans Tommy Tomlin Fred Hessen Andre Bevil John Evans John Evans Dennis Haskin John Evans Andre Bevil Ray Campbell Charles Behn John Evans
Total 426 421 405 398 396 393 387 374 356 351 349 347 297 297 293 289 285 283 283 280
Single Season 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15.
Name John Evans, 1989 Larry Haynes, 1979 Fred Hessen, 1981 Andre Bevil, 2010 Andre Bevil, 2011 Phillip Primm, 1966 Shad Smith, 1987 John Evans, 1988 Tommy Tomlin, 1969 Burton Murchison, 1985 Randy McCollum, 1967 Ray Campbell, 1980 Windell Hebert, 1961 Larry Haynes, 1978 Ryan Mossakowski, 2012
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14.
Name John Evans, 1986-89 Phillip Primm, 1963-66 Andre Bevil, 2010-11 Larry Haynes, 1978-79 Burton Murchison, 1985-88 Shad Smith, 1985-88 Windell Hebert, 1959-62 Sammy Carpenter, 1951-54 Fred Hessen, 1981-82 Tommy Tomlin, 1969-70 Ray Campbell, 1980-83 Doug Matthews, 1969-72 Bobby Flores, 1973-76 Glen Hill, 1969-72
Rushing 94 -213 12 28 171 211 -92 119 80 1,547 26 -62 197 78 23
Passing 2,901 2,641 2,108 2,013 1,719 1,549 1,806 1,525 1,563 44 1,533 1,491 1,214 1,261 1,194
Total 2,995 2,428 2,120 2,041 1,890 1,760 1,714 1,644 1,643 1,591 1,559 1,429 1,411 1,339 1,217
Passing 6,347 4,036 3,732 3,902 145 3,833 2,962 401 2,844 2,635 2,808 24 2,259 832
Total 6,379 4,379 3,931 3,767 3,743 3,493 3,368 3,104 2,849 2,599 2,594 2,347 2,301 2,006
Career
Larry Haynes became the first Cardinal to amass over 2,000 yards of total offense in a single season with 2,428 in 1979
130
Opponent Pass/Rush McNeese State, 2010 429/-3 UTEP, 1989 407/14 Angelo State, 1989 393/12 Southeastern Louisiana, 2010 417/-19 McNeese State, 1989 353/43 Louisiana-Monroe, 1987 412/-19 UT Arlington, 1979 403/-16 Northwestern State, 2011 360/14 McNeese State, 1987 341/15 Louisiana Tech, 1969 308/43 UT Arlington, 1981 367/-18 Southeastern Louisiana, 2011 270/77 Louisiana-Lafayette, 1989 281/16 Texas Tech, 1988 243/54 Texas Southern, 1984 181/112 Texas State 286/3 Sam Houston State, 2010 310/-25 Houston, 1983 326/-43 UT Arlington, 1976 199/84 Mississippi College, 1988 285/-5
Rushing 32 343 199 -135 3,598 -394 406 2,703 5 -36 -214 2,323 42 1,174
L a m a r Fo otbal l Individual All-Purpose Yards Single Season Dudley Rench Bob Nance J.E. Whitmore Ronnie Fontenot Bobby Jancik Bobby Jancik Harold LaFitte Richard Prejean Harold LaFitte Harold LaFitte Johnny Fuller Tommy Smiley Ronnie Gebauer Robert Fontenot Patrick Gibbs Clinton Hill Doug Matthews Joe Bowser Ronnie Melancon Larry Spears Anthony Pendland Kevin Bell Howard Robinson Howard Robinson Sam Choice Herbert Harris Herbert Harris George Landry Rodney Clay Burton Murchison Burton Murchison Ranzy Levias Troy Barrett Chris Ford Octavious Logan J.J. Hayes Kevin Johnson
Rush 607 1,055 671 420 534 243 638 402 551 435 302 307 365 407 331 0 890 0 104 85 293 881 0 486 14 393 515 1 9 -15 0 4 554 2 1,547 830 0 598 0 229 0 15
Rec. 46 67 77 165 28 295 228 52 174 137 357 189 41 119 124 517 0 831 30 637 93 61 545 84 380 56 55 451 840 579 911 525 87 736 40 194 682 115 918 19 951 309
KR 165 289 267 67 176 81 12 13 238 202 187 178 239 149 161 0 97 0 559 0 387 109 0 0 0 0 362 0 217 6 265 566 0 0 0 31 364 0 0 661 0 623
PR 55 26 62 11 93 30 116 67 70 321 92 9 69 31 0 255 0 32 0 0 0 0 0 0 0 0 0 205 66 8 0 0 0 0 0 0 0 0 0 0 0 0
INT 0 0 5 48 5 0 0 23 0 63 31 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
Total 873 1,387 1,082 711 836 649 994 557 1,033 1,158 969 685 714 708 616 772 987 863 693 722 773 1,051 545 570 394 449 932 657 1,132 592 1,176 1,095 641 738 1,587 1,055 1,046 713 918 909 951 947
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15.
Name Burton Murchison, 1985 Sammy Carpenter, 1952 Howard Robinson, 1979 Herbert Harris, 1981 Herbert Harris, 1982 Sammy Carpenter, 1953 Bobby Jancik, 1960 Burton Murchison, 1986 Doug Matthews, 1972 Ranzy Levias, 1987 Burton Murchison, 1987 Ronnie Fontenot, 1959 Tommy Smiley, 1967 Bobby Jancik, 1961 J.J. Hayes, 2011
Rush 1,547 1,005 9 0 4 671 435 830 881 0 813 551 890 302 0
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12.
Name Burton Murchison, 1984-87 Sammy Carpenter, 1951-54 Ranzy Levias, 1984-87 Doug Matthews, 1969-72 Herbert Harris, 1979-82 Ben Booker, 1978-81 Ronnie Gebauer, 1967-70 Howard Robinson, 1976-79 J.E. Whitmore, 1955-58 Kenny Montgomery, 1965-68 Harold LaFitte, 1962-65 Bobby Jancik, 1960-61
Rec. 40 67 840 911 525 77 137 194 61 682 224 174 0 357 951
KR 0 289 217 265 566 267 202 31 109 364 0 238 97 187 0
PR 0 26 66 0 0 62 321 0 0 0 0 70 0 92 0
INT 0 0 0 0 0 5 63 0 0 0 0 0 0 31 0
Total 1,587 1,387 1,132 1,176 1,095 1,082 1,158 1,055 1,051 1,046 1,037 1,033 987 969 951
Rec. KR 510 95 355 788 1,280 1,354 137 221 1,624 831 565 144 2,098 0 1,811 217 253 310 177 544 473 582 494 389
PR 0 154 12 0 0 12 236 271 351 13 53 413
INT 0 53 0 0 0 0 0 0 23 0 2 94
Total 4,203 4,005 2,821 2,681 2,459 2,320 2,314 2,308 2,323 2,212 2,167 2,127
FG 0 0 0 29-44 20-31 24-42 28-51 0 0 0 0 0 0
Pts. 198 172 170 149 144 142 141 128 108 98 96 94 92
Career Rush 3,598 2,703 175 2,323 4 1,599 -20 9 1,386 1,468 1,057 737
Individual Scoring Records Single Season 1. 2. 3. 4. 5. 6. 7. 8. 11. 12. 13.
Name Kevin Johnson, 2012 Sammy Carpenter, 1952 Howard Robinson, 1979 Doug Matthews, 1971 Ronnie Fontenot, 1959 Burton Murchison, 1986 Toby Lierman, 1951 Mike Andrie, 1987 Marcus Jackson, 2010 Kenny Franklin, 1989 Sammy Carpenter, 1951 Frank Van Renselaer, 1989 Mike Marlow, 1981 Justin Stout, 2011 Burton Murchison, 1985 Doug Matthews, 1972
TD 13 13 12 11 8 11 10 0 9 9 9 0 0 0 8 8
2-Pt 0 0 0 1-3 1 0 0 0 0 0 0 0 0 0 1-1 1-1
PAT 0 0 0 0 17 0 0 31-31 0 0 0 32-33 18-18 35-37 0 0
Career FG 0 0 0 0 0 0 0 8-12 0 0 0 7-9 11-19 5-8 0 0
Pts. 78 78 72 68 67 66 60 55 54 54 54 53 51 50 50 50
1. 2. 3 4. 5. 6. 7. 8. 9. 10. 11. 12. 13.
Name Sammy Carpenter, 1951-54 Doug Matthews, 1969-72 Burton Murchison, 1984-87 Jabo Leonard, 1972-75 Justin Stout, 2010Mike Andrie, 1984-87 Mike Marlow, 1978-81 Harold LaFitte, 1962-65 Howard Robinson, 1976-79 John Evans, 1986-89 Patrick Gibbs, 1968-71 Ronnie Fontenot, 1959-61 Tommy Smiley, 1965-67
TD 33 28 28 0 0 0 0 21 18 16 15 11 15
2-Pt 0 2-4 1-1 0 0 0 0 0 0 1 0 0 0
PAT 0 0 0 62-64 84-91 70-72 57-64 2 0 0 6 28 2
131
La mar Foo tba l l Individual Punting Records Most Punts in a Game
Yearly Leaders Year 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 1985 1986 1987 1988 1989 2010 2011 2012
Name Bob Frederick Bob Frederick Bill Davis Raymond Meyer Raymond Meyer Raymond Meyer Glenn Green Larry Ward Richard Griffin Glenn Green Larry Ward Bill McNeill Pat Day Larry Ward Pat Day Pat Day John Wiersma Dan Yezak Dan Yezak Bill Kilgore John Wiersma David Perkins John Wiersma Bill Kilgore Danny Hetzel Danny Hetzel Ronnie Baird Bennie Lunsford Tommy Tomlin Ronnie Baird Lynn Bock Mike Drake Lynn Bock Lynn Bock Lynn Bock Ricky Gohlke Chris Frederick David Stone Chris Frederick Chris Frederick Richard Adams Mike Marlow Mike Marlow Mike Marlow Mike Marlow Ricky Fernandez Ricky Fernandez Ricky Fernandez Mike Andrie Ricky Fernandez Bryan Campbell Mike Andrie Bryan Campbell Bryan Campbell Bryan Campbell Kollin Kahler Kollin Kahler Kollin Kahler
132
No. 55 40 25 22 27 35 19 8 3 20 10 16 15 14 59 41 55 48 41 35 16 31 17 61 78 20 18 42 17 11 59 34 29 67 64 47 25 40 22 42 39 73 65 62 70 76 75 57 14 53 43 26 59 62 55 55 64 67
Yds. 2,113 1,363 979 831 1,101 1,353 670 286 110 689 365 567 453 577 2,143 1,438 1,892 1,979 1,585 1,421 665 1,063 635 2,362 2,766 670 764 1,524 556 400 2,241 1,253 1,142 2,672 2,447 1,612 934 1,602 716 1,294 1,447 2,832 2,329 2,535 2,854 3,022 3,004 2,171 495 2,182 1,504 971 2,218 2,474 2,126 2,089 2,710 2,782
Avg. 38.4 34.1 39.1 37.7 40.8 38.6 35.2 35.7 36.6 34.4 36.5 35.4 30.2 44.0 36.4 35.1 34.4 41.2 38.7 40.6 41.6 34.3 37.4 38.8 35.4 33.5 42.4 36.6 32.7 36.4 38.0 36.9 39.4 39.9 38.7 34.3 37.4 40.1 32.5 30.8 37.1 38.8 35.8 40.9 40.8 39.8 40.1 38.1 35.4 41.2 35.0 37.3 37.6 39.9 38.7 38.0 42.3 41.5
Name Kollin Kahler Bryan Campbell Danny Hetzel Dan Yezak Kollin Kahler Kollin Kahler Bryan Campbell Danny Hetzel Kollin Kahler Kollin Kahler Kollin Kahler Bryan Campbell Bryan Campbell Danny Hetzel Danny Hetzel
Opponent Stephen F. Austin, 2010 Sam Houston State, 1989 Louisiana Tech, 1968 Abilene Christian, 1963 Hawai`i, 2012 Sam Houston State, 2011 Louisiana-Monroe, 1988 UT Arlington, 1968 Stephen F. Austin, 2011 South Alabama, 2011 South Alabama, 2010 Alcorn State, 1989 Stephen F. Austin, 1988 McNeese State, 1969 Trinity, 1968
No. 11 10 10 10 9 9 9 9 8 8 8 8 8 8 8
Season 1. 2. 3. 4. 5. 6. 8. 9. 11.
Name Danny Hetzel, 1968 Ricky Fernandez, 1982 Ricky Fernandez, 1983 Mike Marlow, 1978 Mike Marlow, 1981 Kollin Kahler, 2012 Lynn Bock, 1973 Mike Marlow, 1979 Kollin Kahler, 2011 Lynn Bock, 1974 Bryan Campbell, 1989 Mike Marlow, 1980
No. 78 76 75 73 70 67 67 65 64 64 62 62
Career 1. 2. 3. 5. 6. 7. 8. 9. 10. 13. 14.
Name Mike Marlow, 1978-81 Ricky Fernandez, 1982-85 Bryan Campbell, 1986-89 Lynn Bock, 1971-74 Kollin Kahler, 2010Pat Day, 1959-61 Danny Hetzel, 1967-69 Bill Kilgore, 1964-67 Bob Frederick, 1951-52 Chris Frederick, 1975-77 Dan Yezak, 1963-64 John Wiersma, 1962, 65-66 Raymond Meyer, 1954-56
No. 270 261 219 219 186 115 99 96 95 89 89 88 84
Single Game Yardage Name Kollin Kahler Dan Yezak Kollin Kahler Kollin Kahler Bryan Campbell Bryan Campbell Kollin Kahler Danny Hetzel Bryan Campbell Danny Hetzel Kollin Kahler Bryan Campbell Danny Hetzel Kollin Kahler Bryan Campbell
Opponent Yds. Stephen F. Austin, 2010 419 (11) Abilene Christian, 1963 402 (10) Sam Houston State, 2011 397 (9) Hawai`i, 2012 373 (9) Stephen F. Austin, 1988 363 (8) Louisiana-Monroe, 1988 358 (9) Stephen F. Austin, 2011 352 (8) Louisiana Tech, 1968 345 (10) Stephen F. Austin, 1989 337 (8) UT Arlington, 1968 322 (9) South Alabama, 2010 317 (8) Sam Houston State, 1989 317 (10) New Mexico State, 1968 310 (6) Langston, 2012 307 (7) Alcorn State, 1989 304 (8)
Season Yardage 1. 2. 3. 4. 5. 6. 7. 8. 9. 10.
Name Ricky Fernandez, 1983 Ricky Fernandez, 1982 Mike Marlow, 1981 Mike Marlow, 1978 Kollin Kahler, 2012 Danny Hetzel, 1968 Kollin Kahler, 2011 Lynn Bock, 1973 Mike Marlow, 1980 Bryan Campbell, 1988
Yds. 3,022 (75) 3,004 (76) 2,854 (70) 2,832 (73) 2,782 (67) 2,766 (78) 2,710 (64) 2,672 (67) 2,535 (62) 2,474 (62)
Season Average
11.
Name Larry Ward, 1959 Ronnie Baird, 1969 Kollin Kahler, 2011 John Wiersma, 1965 Kollin Kahler, 2012 Dan Yezak, 1963 Ricky Fernandez, 1985 Mike Marlow, 1980 Raymond Meyer, 1955 Mike Marlow, 1981 Bill Kilgore, 1965
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15.
Name Kollin Kahler, 2010Dan Yezak, 1963-64 Ricky Fernandez, 1982-85 Bill Kilgore, 1964-67 Raymond Meyer, 1954-56 Mike Marlow, 1978-81 Lynn Bock, 1971-74 John Wiersma, 1964-66 Larry Ward, 1957-59 Bryan Campbell, 1986-89 Kollin Kahler, 2010Mike Andrie, 1984-87 Bob Frederick, 1951-52 Mike Drake, 1971-72 Danny Hetzel, 1967-69
1. 2. 3. 4. 5. 6. 8. 9.
Avg. 44.0 (14-577) 42.4 (19-764) 42.3 (64-2,710) 41.6 (16-665) 41.5 (67-2,782) 41.2 (48-1,979) 41.2 (53-2,182) 40.9 (62-2,535) 40.8 (27-1,101) 40.8 (70-2,854) 40.6 (35-1,421)
Career Average Avg. 40.76 (186-7,581) 40.04 (89-3,564) 39.76 (261-10,379) 39.41 (96-3,783) 39.11 (84-3,285) 38.89 (270-10,500) 38.82 (219-8,502) 38.75 (40-1,550) 38.13 (32-1,220) 38.00 (219-8,322) 37.98 (55-2,089) 36.65 (40-1,466) 36.59 (95-3,476) 35.95 (39-1,402) 34.95 (99-3,460)
Longest Punts Name Lynn Bock Lynn Bock Kollin Kahler Ricky Fernandez Dan Yezak Ricky Fernandez Raymond Meyer Lynn Bock Bennie Lansford Mike Marlow Dan Yezak Dan Yezak Kollin Kahler Pat Day
Opponent Yds. West Texas State, 1972 86 Louisiana-Lafayette, 1973 80 Southeastern Louisiana, 2011 72 UT Arlington, 1982 72 San Diego Marines, 1964 70 Louisiana Tech, 1984 68 Stephen F. Austin, 1955 68 West Texas A&M, 1974 67 Southern Illinois, 1970 67 Baylor, 1980 66 Trinity, 1963 66 Sul Ross State, 1963 66 Northwestern State, 2011 65 Mexico Poly, 1960 65
L a m a r Fo otbal l Individual Punt Return Records Yearly Leaders Year Name Ret. 1951 Toby Lierman 15 1952 L.C. Choate 5 Sammy Carpenter 3 1953 Sammy Carpenter 4 1954 Raymond Meyer 5 Jerry Boone 4 1955 Raymond Meyer 12 Jerry Boone 9 J.E. Whitmore 7 1956 J.E. Whitmore 4 Raymond Meyer 4 1957 J.E. Whitmore 7 Dudley Rench 5 1958 J.E. Whitmore 12 Dudley Rench 4 1959 Ronnie Fontenot 12 1960 Bobby Jancik 21 1961 Bobby Jancik 8 1962 Ronnie Wright 8 1963 Mike McManus 5 1964 Burnie Alderman 5 Harold LaFitte 3 1965 Burnie Alderman 18 1966 Johnny Fuller 19 1967 Johnny Fuller 20 Ronnie Gebauer 15 1968 Charles Crawford 7 Ronnie Gebauer 7 1969 Mark Ludwig 10 1970 Clinton Hill 3 1971 Rondy Colbert 14 1972 Rondy Colbert 14 Steve Wilke 10 1973 Rondy Colbert 31 1974 Rondy Colbert 12 1975 Don Cunningham 10 1976 Don Cunningham 9 Don Gordon 7 1977 Don Gordon 16 Johnny Ray Smith 6 1978 Johnny Ray Smith 19 Howard Robinson 16 Don Gordon 8 1979 Johnny Ray Smith 13 Howard Robinson 10 1980 Johnny Ray Smith 21 1981 Joe Cormier 22 1982 Mitchell Bennett 20 1983 Dennis Haskin 16 Mitchell Bennett 6 1984 Billy Bell 25 1985 Billy Bell 11 1986 Keith McFadden 6 1987 Chris Lafferty 25 1988 Chris Lafferty 18 1989 Ronald Davis 18 2010 Josh Powdrill 10 Marcus Jackson 5 2011 Kye Hildreth 2 2012 Mike Venson 14
Yds. 111 37 26 62 114 32 93 65 57 154 34 73 49 67 163 70 321 92 125 113 28 31 153 255 344 155 44 32 36 53 182 56 132 305 42 44 94 60 111 60 110 205 80 126 66 144 66 103 58 58 158 85 30 191 104 170 95 122 40 97
Avg. TD 7.4 0 7.4 0 8.7 0 15.5 0 22.8 1 8.0 0 7.8 0 7.2 0 8.1 0 38.5 1 8.5 0 10.4 0 9.8 0 5.6 0 40.8 1 5.8 0 15.3 0 11.5 0 15.6 0 22.6 1 5.6 0 10.3 0 8.3 0 13.4 1 17.2 1 10.3 0 6.3 0 4.6 0 3.6 0 17.7 0 13.0 0 4.0 0 13.2 0 9.8 2 3.5 0 4.4 0 10.4 0 8.6 0 6.9 1 10.0 1 5.8 0 12.8 0 10.0 1 9.7 1 6.6 0 6.9 0 3.0 0 5.2 0 3.6 0 9.7 1 6.3 0 7.7 0 5.0 0 7.6 0 5.8 0 9.4 0 9.5 0 24.4 1 20.0 0 6.9 0
Most Returns - Game Name Johnny Ray Smith Rondy Colbert
Opponent No. Baylor, 1980 8 Louisiana-Lafayette, 1973 7
Most Returns - Season Name 1. Rondy Colbert, 1973 2. Chris Lafferty, 1987 Billy Bell, 1984 4. Joe Cormier, 1981 5. Johnny Ray Smith, 1980 6. Mitchell Bennett, 1982 Johnny Fuller, 1967 8. Johnny Ray Smith, 1978 Johnny Fuller, 1966 10. Ronald Davis, 1989 Chris Lafferty, 1988 Burnie Alderman, 1965
No. 31 25 25 22 21 20 20 19 19 18 18 18
Most Returns - Career 1. 2. 3. 4. 5. 6. 7. 8. 9. 10.
Name Rondy Colbert, 1971-74 Johnny Ray Smith, 1977-80 Chris Lafferty, 1987-89 Johnny Fuller, 1964-67 Billy Bell, 1983-85 J.E. Whitmore, 1955-58 Bobby Jancik, 1960-61 Don Cunningham, 1974-77 Mitchell Bennett, 1982-83 Joe Cormier, 1981 Don Gordon, 1975-78
No. 71 59 44 40 36 30 29 28 26 22 22
Single Game Yardage Name Opponent Rondy Colbert Louisiana-Lafayette, 1973 Marcus Jackson Ok. Panhandle State, 2010
Yds. 118 (7) 111 (2)
Season Yardage 1. 2. 3. 4. 5. 6. 7. 8. 9. 10.
Name Johnny Fuller, 1967 Bobby Jancik, 1960 Rondy Colbert, 1973 Johnny Fuller, 1966 Howard Robinson, 1978 Chris Lafferty, 1987 Rondy Colbert, 1971 Ronald Davis, 1989 Dudley Rench, 1958 Ronnie Gebauer, 1967
Yds. 344 (20) 321 (21) 305 (31) 255 (19) 205 (16) 191 (25) 182 (14) 170 (18) 163 (4) 155 (15)
Career Yardage 1. 2. 3. 4. 5. 6. 7. 8. 9. 10.
Name Johnny Fuller, 1964-67 Rondy Colbert, 1971-74 Johnny Ray Smith, 1977-80 Bobby Jancik, 1960-61 J.E. Whitmore, 1955-58 Chris Lafferty, 1987-89 Don Gordon, 1975-78 Billy Bell, 1983-85 Raymond Meyer, 1954-56 Mitchell Bennett, 1982-83
Yds. 626 (40) 585 (71) 440 (59) 413 (29) 351 (30) 296 (44) 259 (22) 243 (36) 241 (21) 161 (26)
Season Average 1. 2. 3. 4. 5. 6. 7. 8. 9. 10.
Minimum 4 returns Name Dudley Rench, 1958 J.E. Whitmore, 1956 Marcus Jackson, 2010 Raymond Meyer, 1954 Mike McManus, 1963 Johnny Fuller, 1967 Sammy Carpenter, 1953 Bobby Jancik, 1960 Johnny Fuller, 1966 Steve Wilke, 1972
Avg. 40.8 (4-136) 38.5 (4-154) 24.4 (5-122) 22.8 (5-114) 22.6 (5-113) 17.2 (20-344) 15.5 (4-62) 15.3 (21-321) 13.4 (19-255) 13.2 (10-132)
1. 2. 3. 4. 5. 6. 7. 8. 9. 10.
Minimum 10 returns Name Johnny Fuller, 1967 Bobby Jancik, 1960 Johnny Fuller, 1966 Steve Wilke, 1972 Rondy Colbert, 1971 Howard Robinson, 1978 Ronnie Gebauer, 1967 Rondy Colbert, 1973 Johnny Ray Smith, 1979 Josh Powdrill, 2010
Avg. 17.2 (20-344) 15.3 (21-321) 13.4 (19-255) 13.2 (10-132) 13.0 (14-182) 12.8 (16-205) 10.3 (15-155) 9.8 (31-305) 9.7 (13-126) 9.5 (10-95)
Career Average 1. 2. 3. 4. 5. 6. 7. 8. 9. 10.
Minimum 20 returns Name Johnny Fuller, 1964-67 Bobby Jancik, 1960-61 Don Gordon, 1975-78 J.E. Whitmore, 1955-58 Raymond Meyer, 1954-56 Rondy Colbert, 1971-74 Johnny Ray Smith, 1977-80 Billy Bell, 1983-85 Chris Lafferty, 1987-89 Mitchell Bennett, 1982-83
Avg. 15.65 (40-626) 14.24 (29-413) 11.77 (22-259) 11.70 (30-351) 11.48 (21-241) 8.24 (71-585) 7.46 (59-440) 6.75 (36-243) 6.73 (44-296) 6.19 (26-161)
Season Touchdowns Name 1. Rondy Colbert, 1973 2. Eight players tied with
TD 2 1
Career Touchdowns Name 1. Johnny Fuller, 1964-67 Rondy Colbert, 1971-74 Johnny Ray Smith, 1977-80
TD 2 2 2
Longest Returns Name Marcus Jackson Raymond Meyer David McGaughty Kurt Phoenix Dudley Rench Johnny Ray Smith J.E. Whitmore Mike McManus Bobby Jancik Rondy Colbert
Opponent Yds. Ok. Panhandle State, 2010 90 Texas A&M-Kingsville, 1954 90 Mexico Poly, 1960 83 UT Arlington, 1978 82 Sam Houston State, 1958 82 Louisiana-Monroe, 1979 80 Texas A&M-Kingsville, 1956 80 Sul Ross State, 1963 76 Louisiana-Monroe, 1960 75 Louisiana-Lafayette, 1973 73
133
La mar Foo tba l l Junior College Results 1923 (2-4-1) Coach: Pat Quinn South Park High W Stephen F. Austin W Port Arthur High T Louisiana-Lafayette L Texas A&M Freshmen L LSU Freshmen L Louisiana College L 1924 (7-3-0) Coach: Dunlap Johnson Orange High W Sour Lake High W DeQuincy (La.) High W Rusk Jr. College W Stephen F. Austin W Texas Freshmen L Louisiana-Lafayette L Rice Freshmen L Louisiana College W Port Arthur Independent W 1925 (1-5-2) Coach: Lilburn Dimmitt Louisiana-Lafayette L Beaumont High W Northwestern State L Texas A&M Freshmen L Rice Freshmen T Texas Freshmen L Beaumont High L Stephen F. Austin T 1926 (2-4-0) Coach: Joe Vincent Victoria JC W Centenary Freshmen L Sam Houston State W Louisiana-Lafayette L Rice Freshmen L Schreiner Institute L
(Discontinued: 1927-31)
134
n
1923-1950
25-0 10-0 0-0 19-16 25-0 13-0 20-13
28-0 14-0 47-0 23-0 19-7 9-7 20-8 7-6 13-7 24-0
14-0 6-0 19-6 12-0 2-2 7-0 19-10 0-0
24-0 13-7 9-0 19-0 29-0 64-0
Coach John Gray’s 1932 team finished the season with an 8-1 record
1932 (8-1) Coach: John Gray Lon Morris JC W Blinn College W Sam Houston Freshmen W Centenary Freshmen W East Texas Baptist W Texas Freshmen W Louisiana-Lafayette W SMU Freshmen L Decatur Baptist JC W
20-6 39-0 38-13 12-0 14-12 25-7 6-0 6-0 23-6
1933 (6-4-2) Coach: John Gray East Texas Baptist L Lon Morris JC W Louisiana-Lafayette W Texas Freshmen T Rice Freshmen L Sam Houston Freshmen W Blinn College W Texas A&M Freshmen T Victoria JC W LSU Freshmen L Schreiner Institute W Amarillo JC L
7-6 13-0 8-7 0-0 7-0 41-0 71-0 0-0 40-7 20-0 20-14 27-14
1934 (8-1-1) Coach: John Gray Lon Morris JC W Texas Freshmen W Texas Freshmen W Loyola (La.) Freshmen T Texas A&M Freshmen W St. Mary’s University W Westmoreland JC W Victoria JC W Schreiner Institute W Amarillo JC L
26-6 7-0 16-0 19-19 13-6 32-0 54-7 19-0 7-6 27-14
1935 (4-3-1) Coach: John Gray Lon Morris JC T Rice Freshmen L Mexico Poly W Texas A&M-Kingsville L Sam Houston State W Victoria JC W Westmoreland JC W Schreiner Institute L
0-0 24-0 32-0 26-0 16-0 7-6 38-6 20-0
1936 (3-4-0) Coach: John Gray Stephen F. Austin L Centenary Freshmen L Loyola (La.) Freshmen W Texas A&M-Kingsville L Victoria JC W Schreiner Institute W Kilgore College L
13-6 6-0 6-0 26-0 7-0 7-6 10-7
L a m a r Fo otbal l 1937 (5-4) Coach: John Gray Texas Freshmen W Texas A&M-Kingsville L Southeastern La. L Stephen F. Austin W Sam Houston State L Centenary Freshmen W Louisiana-Lafayette W Schreiner Institute L Mexico Poly W
3-0 26-0 20-12 10-6 16-7 32-6 18-12 14-6 27-13
1938 (2-6-1) Coach: John Gray Arlington JC L Brownsville JC W Texas Lutheran W St. Edward’s University L Sam Houston State L Southeastern La. L Centenary Freshmen L Stephen F. Austin T Schreiner Institute L
33-7 40-6 33-6 14-0 18-0 20-7 12-7 13-13 9-0
1939 (2-7-0) Coach: John Gray Louisiana-Lafayette L Sam Houston State L Baylor Freshmen L Centenary Freshmen W Kilgore College L Texas Lutheran W Schreiner Institute L Arlington JC L Lon Morris JC L
6-0 20-6 34-0 7-0 20-0 18-0 7-0 7-6 28-6
1940 (2-4-1) Coach: R. M. Hodgkiss Kilgore JC L Decatur Baptist JC W Lon Morris JC T Rice Freshmen L Schreiner Institute L Tarleton State JC L McNeese State JC W
27-0 12-6 0-0 6-0 19-0 14-9 34-0
1941 (4-4-0) Coach: R. M. Hodgkiss Sam Houston State L Schreiner Institute W Kilgore College L Decatur Baptist JC W Rice Freshmen L Arlington JC L Clifton JC W Louisiana-Lafayette Freshmen W
51-6 6-0 34-6 12-0 20-0 21-13 59-6 27-0
1942 (2-6-1) Coach: Ted Dawson Sam Houston State L Arlington JC T Kilgore College L Schreiner Institute W Paris JC L Ellington AFB W NE Louisiana JC L Southwestern University L Southeastern La. L
20-0 0-0 28-6 14-0 20-0 25-0 19-13 13-0 34-7
(Discontinued 1943-45) 1946 (8-2-0) Coach: Ted Jefferies Decatur Baptist JC W Hardin College W San Angelo JC L Hill JC W Paris JC W Tarleton State JC W Arlington JC W Kilgore College L Schreiner Institute W McNeese State JC W
83-0 13-0 13-7 40-0 6-0 19-7 26-0 10-6 20-0 21-7
1947 (4-6-0) Coach: A. C. Forwald Little Rock JC W Del Mar JC W San Angelo JC L Arlington JC L Paris JC W Tarleton State JC W Tyler JC L Kilgore College L Schreiner Institute L McNeese State JC L
12-0 19-6 26-0 14-0 28-14 14-0 7-6 10-6 7-0 21-7
1948 (8-4-0) Coach: Stan Lambert Brownsville JC W Del Mar JC W San Angelo JC L Arlington JC L Paris JC L Tarleton State JC W Mexico Poly W Kilgore College L Schreiner Institute W McNeese State JC W Tyler JC W Hinds, Miss. JC W +- JC State Playoffs *-Spindletop Bowl
1949 (10-2) Coach: Stan Lambert Wharton JC W Schreiner Institute W San Angelo JC W Arlington JC W Paris JC W Tarleton State JC W Mexico Poly W Kilgore College W McNeese State JC W Tyler JC L Pearl River, Miss. JC L Georgia Military W +- Memorial Bowl *-Spindletop Bowl (SWJC Co-Champions)
9/16 9/23 9/30 10/6 10/14 10/21 10/28 11/3 11/11 11/18
1950 (5-4-1) Coach: Stan Lambert SE Oklahoma State T SW Oklahoma State W Corpus Christi Univ. L Northwestern State L Sam Houston State L Louisiana College W Mexico Poly W East Central Okla. W Daniel Baker W Middle Tennessee L
33-13 21-0 42-20 50-6 38-13 7-0 40-0 14-7 33-14 27-13 21-20* 35-14+
7-7 34-7 20-13 26-0 45-0 15-7 19-6 7-6 75-0 28-0
25-7 21-7 19-6 22-0 27-7 26-19 28-0 27-12 18-6 20-6 28-7+ 21-0*
135
La mar Foo tba l l Senior College Results 9/15 9/22 9/29 10/6 10/13 10/20 10/27 11/3 11/10 11/17
1951 (4-6-0) Coach: Stan Lambert North Texas L SW Oklahoma State W at Northwestern State W *Stephen F. Austin W *at Texas A&M-Commerce L *at Sam Houston State L Trinity University L *Texas State L at McNeese State L *Sul Ross State W
9/20 9/27 10/4 10/11 10/18 10/25 11/1 11/8 11/15
1952 (2-7) Coach: Stan Lambert at Louisiana-Lafayette L Northwestern State W *at Stephen F. Austin W *Texas A&M-Commerce L *Sam Houston State L at Trinity University L *at Texas State L McNeese State L *at Sul Ross State L 1953 (3-7) Coach: J.B. Higgins Louisiana-Lafayette L at Northwestern State L Stephen F. Austin W at Texas A&M-CommerceL at Sam Houston State L Abilene Christian L Texas State L at McMurry College L at Sul Ross State W at Mexico Poly W 1954 (3-7) Coach: J.B. Higgins Louisiana-Lafayette W at Northwestern State L McMurry College W *at Stephen F. Austin L *Texas A&M-Commerce L *Sam Houston State W at Abilene Christian L *at Texas State L *Texas A&M-Kingsville L *Sul Ross State L
9/17 9/24 10/1 10/8 10/15 10/22 10/29 11/5 11/12 11/19
136
1955 (4-6) Coach: J.B. Higgins Louisiana-Lafayette W at Northwestern State L A&M-Corpus Christi W *Stephen F. Austin L *at Texas A&M-Commerce L *at Sam Houston State L at McNeese State L *Texas State L *at Texas A&M-Kingsville W *Sul Ross State W
54-6 43-21 32-20 26-14 47-7 33-14 41-20 14-13 13-7 28-27
14-13 35-13 27-6 48-0 31-13 66-7 33-26 42-7 27-19
22-13 12-6 19-13 32-13 43-0 26-21 14-6 32-27 21-0 60-12
26-20 22-13 19-13 20-7 16-14 6-0 33-14 13-12 18-14 27-13
19-6 7-6 29-2 20-8 33-7 46-14 17-2 14-7 20-9 26-13
n
1951-Present
9/15 9/22 10/6 10/13 10/20 10/27 11/3 11/10 11/17
1956 (4-4-1) Coach: J.B. Higgins at Louisiana-Lafayette W Northwestern State T *at Stephen F. Austin L *Texas A&M-Commerce W *Sam Houston State L McNeese State W *at Texas State L *Texas A&M-Kingsville L *at Sul Ross State W
21-14 6-6 26-18 20-7 20-6 18-14 13-6 28-12 34-7
9/14 9/21 9/28 10/5 10/12 10/19 10/26 11/2 11/9 11/16
1957 (8-0-2) Coach: J.B. Higgins at Louisiana College W at Northwestern State W Louisiana-Lafayette W *Stephen F. Austin W *at Texas A&M-Commerce W *at Sam Houston State T *Howard Payne W *Texas State W *at Texas A&M-Kingsville T *Sul Ross State W
35-20 20-10 36-20 27-12 7-6 7-7 18-13 33-20 13-13 67-19
9/27 10/4 10/11 10/18 10/25 11/1 11/8 11/15
1958 (6-2) Coach: J.B. Higgins A&M-Corpus Christi W *at Stephen F. Austin W *Texas A&M-Commerce W *Sam Houston State W *at Howard Payne L *at Texas State L *Texas A&M-Kingsville W *at Sul Ross State W
26-0 35-6 21-0 20-7 24-19 8-7 14-0 46-7
9/12 9/19 9/26 10/3 10/10 10/17 10/24 10/31 11/7 11/14 11/21
1959 (8-3) Coach: J.B. Higgins at South Dakota W Louisiana Tech W at Northwestern State W at Abilene Christian W *Stephen F. Austin W *Sul Ross State W *at Texas State W Howard Payne L *at Texas A&M-Kingsville L *Texas A&M-Commerce L *at Sam Houston State W
41-9 13-6 19-0 8-7 7-6 32-0 28-6 14-12 14-6 14-3 27-14
9/10 9/17 9/24 10/1 10/8 10/15 10/22 10/29 11/5 11/12 11/19 11/24
1960 (8-4) Coach: J.B. Higgins Mexico Poly W at Louisiana Tech L at Northwestern State W Abilene Christian L *at Stephen F. Austin W *at Sul Ross State W *Texas State W *at Howard Payne W *Texas A&M-Kingsville L *Texas A&M-Commerce L *Sam Houston State W South Dakota W
42-6 20-0 21-13 20-7 14-0 20-6 7-0 12-7 40-0 27-0 18-7 41-21
1961 (8-2-1) Coach: J.B. Higgins 9/23 Louisiana-Monroe W 9/30 at Abilene Christian W 10/7 *Stephen F. Austin W 10/14 *Sul Ross State W 10/21 *at Texas State T 10/28 *Howard Payne W 11/4 *at Texas A&M-Kingsville L 11/11 *Texas A&M-Commerce W 11/18 *at Sam Houston State L 12/2 at Mexico Poly W 12/29 Middle Tennessee State W *- Tangerine Bowl
9/15 9/21 9/27 10/6 10/13 10/20 10/27 11/3 11/10 11/17
1962 (7-3) Coach: J.B. Higgins Mexico Poly W at Louisiana-Monroe W Abilene Christian W *at Stephen F. Austin W *at Sul Ross State W *Texas State L *at Howard Payne W *Texas A&M-Kingsville L *at Texas A&M-Commerce W Sam Houston State L
38-34 25-10 34-22 34-0 7-7 33-13 8-7 14-7 9-7 62-22 21-14*
34-6 14-0 13-6 27-12 28-14 20-13 21-10 7-0 28-6 23-7
1963 (5-4) Coach: Vernon Glass 9/28 at Abilene Christian L 25-0 10/5 Trinity University W 20-18 10/12 Stephen F. Austin L 27-6 10/19 Sul Ross State W 15-7 10/26 at Texas State L 13-7 11/2 Howard Payne W 35-0 11/9 at Texas A&M-Kingsville W 16-14 11/17 Texas A&M-Commerce L 10-0 12/7 at Mexico Poly W 33-26 (Lamar was an independent in 1963) 1964 (6-3-1) Coach: Vernon Glass 9/19 East Central Okla. W 9/26 *Abilene Christian W 10/3 *at Trinity University W 10/17 at San Diego Marines L 10/24 *Texas A&M-Kingsville L 10/31 *UT Arlington W 11/7 *New Mexico State W 11/14 *at Arkansas State T 11/21 *at SW Missouri W 12/12 Northern Iowa L *- Pecan Bowl
21-0 14-3 14-7 33-28 13-12 17-7 21-14 7-7 14-7 19-17*
L a m a r Fo otbal l 9/18 9/25 10/2 10/9 10/16 10/23 10/30 11/6 11/13 11/20
1965 (6-4) Coach: Vernon Glass at East Central Okla. W at New Mexico State L Pensacola Navy W *Arkansas State W *at Abilene Christian W at Texas A&M-Kingsville L Louisiana-Lafayette L *Trinity University W West Texas A&M W *at UT Arlington L
9/17 9/24 10/2 10/15 10/22 10/29 11/5 11/12 11/19 11/26
1966 (6-4) Coach: Vernon Glass at Western Michigan L Southwest Missouri W at Louisiana-Lafayette L *Abilene Christian W McNeese State W *at Arkansas State W *at Trinity University L Louisiana Tech W *UT Arlington W at Quantico Marines L
16-14 55-12 16-14 42-16 10-7 17-0 23-14 31-16 27-7 30-26
9/11 9/18 9/25 10/2 10/9 10/16 10/23 10/30 11/6 11/20 11/27
9/16 9/23 9/30 10/7 10/14 10/21 10/28 11/4 11/11 11/18
1967 (7-3) Coach: Vernon Glass at New Mexico State L Louisiana-Lafayette W Southeastern Louisiana W Quantico Marines W *at Abilene Christian W at McNeese State W *Arkansas State W *Trinity Universisty W at Louisiana Tech L *at UT Arlington L
17-6 14-13 34-21 41-6 54-13 24-8 28-23 6-0 41-31 16-10
9/14 9/21 10/5 10/12 10/19 10/26 11/2 11/9 11/16 11/23
1968 (0-10) Coach: Vernon Glass at West Texas A&M L McNeese State L New Mexico State L at Southern Illinois L *Abilene Christian L at Louisiana-Lafayette L *at Arkansas State L *at Trinity University L Louisiana Tech L *UT Arlington L
45-7 10-0 16-14 24-7 38-14 20-14 48-17 24-20 34-7 37-20
9/20 9/27 10/4 10/11 10/18 10/25 11/1 11/8 11/15 11/22
1969 (3-7) Coach: Vernon Glass at McNeese State W at Louisiana-Lafayette L New Mexico State W Southern Illinois W Abilene Christian L at Louisiana-Lafayette L *at Arkansas State L *Trinity University L at Louisiana Tech L *at UT Arlington L
13-7 21-19 9-7 20-16 22-9 24-16 20-0 22-0 77-40 53-16
15-14 21-20 37-0 20-7 28-18 14-6 20-6 21-3 21-14 31-21
9/19 9/26 10/3 10/10 10/17 10/24 10/31 11//7 11/14 11/21
1970 (3-7) Coach: Vernon Glass West Texas A&M W Louisiana Tech W at Southern Illinois L McNeese State L *Abilene Christian L at Louisiana-Lafayette L *at Arkansas State L *at Trinity University L at New Mexico State L *UT Arlington W
33-28 6-0 32-16 17-12 42-27 15-6 69-7 37-31 69-37 24-0
9/9 9/16 9/23 9/30 10/7 10/14 10/21 10/21 11/4 11/11 11/18
1971 (5-6) Coach: Vernon Glass Sam Houston State L at West Texas A&M L *at Louisiana Tech L Central Missouri W at McNeese State L at Mississippi State L Louisiana-Lafayette L *at Abilene Christian W *Trinity University W *at UT Arlington W *Arkansas State W 1972 (8-3) Coach: Vernon Glass Sam Houston State W at UTEP W Southern Illinois W at West Texas A&M L *at McNeese State L *Abilene Christian W *at Louisiana-Lafayette W *at Arkansas State W at New Mexico State W Nicholls W *UT Arlington L
22-19 42-28 7-0 35-12 17-7 31-10 3-0 26-24 24-19 22-10 10-3
9/8 9/15 9/22 9/29 10/6 10/13 10/20 10/27 11/10 11/24
1973 (5-5) Coach: Vernon Glass at New Mexico State L Howard Payne W *at McNeese State L at Drake L West Texas A&M L at UTEP W Louisiana-Lafayette W *Arkansas State W *Louisiana-Tech L *at UT Arlington W
24-7 21-17 20-17 24-10 13-0 31-27 31-0 10-7 17-3 10-3
9/21 9/28 10/5 10/12 10/19 10/26 11/2 11/9 11/16 11/23
1974 (8-2) Coach: Vernon Glass Drake W at North Texas W *at Louisiana-Lafayette W Mississippi State L *at Arkansas State W Southern Miss. W at West Texas A&M W *at Louisiana Tech L *McNeese State W *UT Arlington W
18-6 27-7 38-13 37-21 10-6 10-7 9-7 28-0 17-3 8-0
13-12 14-6 26-7 35-6 38-0 24-7 21-20 30-28 27-15 23-14 24-13
9/6 9/13 9/20 10/4 10/11 10/18 10/25 11/1 11/8 11/22 11/29
1975 (1-10) Coach: Vernon Glass at Houston L West Texas A&M L New Mexico State L *Louisiana Tech L at Louisiana-Monroe L *at Louisiana-Lafayette L *Arkansas State L at Southern Miss. L *at UT Arlington L Southern Illinois W *at McNeese State L
20-3 10-6 17-14 24-10 34-7 21-12 17-0 43-3 37-24 30-10 20-10
9/11 9/18 9/25 10/2 10/9 10/16 10/23 10/30 11/6 11/13 11/20
1976 (2-9) Coach: Bob Frederick Northwestern State W at Louisiana-Monroe L at New Mexico State W at Southern Illinois L *Louisiana-Lafayette L *at Louisiana Tech L Long Beach State L *at Arkansas State L at West Texas A&M L *McNeese State L *UT Arlington L
17-6 16-6 21-17 19-7 34-9 37-7 21-10 31-0 21-6 27-0 34-14
9/10 9/17 9/24 10/1 10/8 10/15 10/22 10/29 11/5 11/12 11/19
1977 (2-9) Coach: Bob Frederick Louisiana-Monroe W *Louisiana-Lafayette L at Long Beach State L at Southern Illinois L *Arkansas State L at Northwestern State L West Texas A&M L at Drake L *Louisiana Tech L *at McNeese State W *at UT Arlington L
21-7 10-6 21-7 9-5 10-6 43-0 27-9 43-21 7-6 35-7 14-7
9/11 9/16 9/23 9/30 10/7 10/14 10/21 11/4 11/11 11/18 11/25
1978 (2-8-1) Coach: Bob Frederick at Northwestern State L Southern Illinois L Stephen F. Austin W *at Louisiana-Lafayette L Louisiana-Monroe T at West Texas A&M L *UT Arlington L *at Louisiana Tech L *McNeese State L *at Arkansas State L Long Beach State W
21-17 22-20 23-16 23-16 17-17 55-16 37-17 40-3 24-23 6-3 36-31
9/8 9/15 9/22 10/6 10/13 10/20 10/27 11/3 11/10 11/17 11/23
1979 (6-3-2) Coach: Larry Kennan at Baylor L at Western Kentucky W *Louisiana Tech W West Texas A&M T *McNeese State L *Louisiana-Lafayette W *at Arkansas State W at Louisiana-Monroe W Northwestern State W *at UT Arlington L at UNLV T
20-7 58-27 19-17 12-12 34-25 21-17 20-10 21-7 28-13 47-37 24-24
137
La mar Foo tba l l 9/6 9/13 9/20 10/4 10/11 10/18 10/25 11/1 11/8 11/15 11/22
1980 (3-8) Coach: Larry Kennan at Texas Southern W Baylor L Drake L at Stephen F. Austin W *at Louisiana Tech L Louisiana-Monroe L *at Louisiana-Lafayette L at Southern Miss. L *Arkansas State W *McNeese State L *UT Arlington L
9/5 9/19 9/26 10/3 10/10 10/17 10/31 11/7 11/14 11/21 11/28
1981 (4-6-1) Coach: Larry Kennan at Baylor W Sam Houston State W Texas State L Stephen F. Austin L at Louisiana-Monroe W *Louisiana Tech L *McNeese State T *at Arkansas State L *Louisiana-Lafayette W *at UT Arlington L at Southern Miss. L
9/4 9/11 9/18 9/25 10/2 10/16 10/23 10/30 11/6 11/13 11/20
1982 (4-7) Coach: Ken Stephens at Texas State L at Stephen F. Austin W Sam Houston State W at Houston L Texas Southern L *at Louisiana Tech W at Louisiana-Lafayette L *Louisiana-Monroe L *Arkansas State L *at McNeese State W *UT Arlington L
9/3 9/10 9/17 9/24 10/1 10/8 10/15 10/22 11/5 11/12 11/19
1983 (2-9) Coach: Ken Stephens at Nicholls L Stephen F. Austin W at Houston L *at Louisiana Tech W Texas Southern L *Louisiana-Monroe L *at UT Arlington L at Louisiana-Lafayette L *at North Texas L *Arkansas State L *McNeese State L
9/1 9/15 9/22 9/29 10/6 10/13 10/20 10/27 11/3 11/10 11/17
1984 (2-9) Coach: Ken Stephens Texas Southern L *North Texas W at Rice L *UT Arlington L *at Louisiana-Monroe L Texas State L at Sam Houston State L *Louisiana Tech L Nicholls W *at Arkansas State L *at McNeese State L
138
41-8 42-7 38-7 45-21 16-7 28-6 38-10 36-10 23-22 35-3 44-27
18-17 50-7 24-7 13-10 17-13 16-7 20-20 16-9 14-12 31-7 45-14
30-0 24-14 27-7 48-3 28-17 40-13 24-0 14-0 20-19 12-3 31-24
21-14 24-23 42-35 18-12 15-14 17-0 21-0 31-6 10-0 24-14 17-7
13-7 10-6 36-19 13-10 34-14 23-0 27-11 22-7 20-16 37-13 34-14
9/7 9/14 9/21 9/28 10/12 10/19 10/26 11/2 11/9 11/16 11/23
1985 (3-8) Coach: Ken Stephens Texas Southern W Prairie View A&M W at Texas State W at Rice L *Louisiana-Monroe L *at UT Arlington L Sam Houston State L *at Louisiana Tech L *at North Texas L *Arkansas State L *McNeese State L
32-20 30-7 24-21 29-28 37-14 37-17 34-22 23-22 20-0 21-0 28-7
9/5 9/12 9/19 9/26 10/3 10/10 10/17 10/24 10/31 11/14 11/21
1986 (2-9) Coach: Ray Alborn at Rice L at Sam Houston State L at Stephen F. Austin L Texas A&M-Kingsville L *at Louisiana-Monroe L Texas State W *North Texas L *Louisiana Tech L Central State (OK) W *at Arkansas State L *at McNeese State L 1987 (3-8) Coach: Ray Alborn at Rice L at Northern Illinois W at Texas Tech L Stephen F. Austin W at Texas A&M-Kingsville L Louisiana-Monroe W at UTEP L Sam Houston State L at Texas State L Arkansas State L McNeese State L
34-30 39-35 43-14 28-26 43-14 48-28 38-14 34-21 27-19 34-20 44-36
9/3 9/10 9/17 10/1 10/8 10/15 10/22 10/29 11/5 11/12 11/19
1988 (3-8) Coach: Ray Alborn West Texas A&M W Texas State L at Stephen F. Austin L at Arizona State L at Sam Houston State L Alcorn State W at Arkansas State W at Louisiana-Monroe L Mississippi College L at Texas Tech L at McNeese State L
42-21 27-26 26-14 24-13 16-14 35-6 21-17 24-3 16-14 59-28 18-17
9/2 9/9 9/16 9/23 9/30 10/7 10/14 11/4 11/11 11/18
1989 (5-5) Coach: Ray Alborn at Angelo State L at UTEP W at West Texas A&M W Sam Houston State W Stephen F. Austin L Arkansas State L at Alcorn State L at Texas State W at Louisiana-Lafayette L McNeese State W
31-28 21-19 49-17 41-0 44-20 41-31 32-16 20-19 42-33 22-17
9/6 9/20 9/27 10/4 10/11 10/18 10/25 11/1 11/8 11/15 11/22
28-14 24-13 38-25 35-10 22-21 17-3 33-13 39-20 47-23 56-7 38-7
9/4 9/11 9/18 9/25 10/2 10/9 10/16 10/30 11/6 11/13 11/20
2010 (5-6) Coach: Ray Woodard at McNeese State L Webber International W at Southeastern Louisiana W at Stephen F. Austin L Sam Houston State L Langston W South Alabama L at North Dakota L at Georgia State L South Dakota W Okla. Panhandle State W
30-27 21-14 29-28 71-3 38-10 14-0 26-0 31-6 23-17 24-20 44-6
9/3 9/10 9/17 10/1 10/8 10/15 10/22 10/29 11/5 11/12 11/19
2011 (4-7) Coach: Ray Woodard Texas College W at South Alabama L Incarnate Word W *at Southestern LouisianaW *Northwestern State L at Texas State L *Central Arkansas L *at Sam Houston State L *Stephen F. Austin L *at Nicholls W *McNeese State L
58-0 30-8 45-35 48-38 37-17 46-21 38-24 66-0 69-10 34-26 45-17
9/1 9/8 9/15 9/22 9/29 10/6 10/13 10/20 10/27 11/3 11/10 11/17
2012 (4-8) Coach: Ray Woodard at Louisiana-Lafayette L Prairie View A&M W at Hawai`i L Langston W *Southeastern Louisiana L *at Northwestern State L McMurry W *at Central Arkansas L *Sam Houston State L *at Stephen F. Austin L *Nicholls W *at McNeese State L
40-0 31-0 54-2 31-0 31-21 30-23 52-21 24-14 56-7 40-26 34-24 35-0
Media Information
La mar Foo tba l l Media Information Lamar Athletics Media Relations Staff Staff (Area Code 409) 880-7489 Football Press Box 880-2248 Main Athletic Number Media Relations Fax 880-2338 JAMES DIXON Office: 880-8329 Cell: E-mail: james.dixon@lamar.edu PAT MURRAY Office: 880-2323 Cell: 651-0521 E-mail: pat.murray@lamar.edu
James Dixon Assistant AD/ Media Relations
Pat Murray Assistant Media Relations Director
MEDIA CREDENTIALS Press credentials will be granted to media covering Lamar football on a regular basis. Media covering single games should submit requests at least 24 hours in advance to Assistant AD/Media Relations James Dixon by calling (409) 880-8329, by emailing james.dixon@lamar.edu or by fax at (409) 8802338. Media credentials may be picked up in the Lamar Media Relations Office (Room 138 of the Montagne Center) one day before the game or at the Gate 2 ticket window of Provost Umphrey Stadium on the day of the game. Press box seating will be granted on a priority basis, with daily newspapers and originating radio and television networks receiving first consideration. We are unable to accommodate children, spouses or other non-working media. MEDIA PARKING There will be a limited number of media parking spaces available in Lot A-2 (see map on this page), with media members covering Lamar on a regular basis being issued assigned parking spots. Visiting media requiring a parking pass need to contact the Lamar Media Relations Office at (409) 880-8329, with passes being issued the week of the game. GAME DAY SERVICES Game programs, fact sheets, and updated statistics will be available in the press box prior to kickoff. Game statistics will be distributed at the end of every quarter. Final box scores and play-by-plays will be available in the press box following the game. Phone lines will be available for transmitting game stories on a first-come, first-served basis. A media meal and beverages will be provided for working media.
140
Clay Trainum Assistant Media Relations Director
CLAY TRAINUM Office: 880-7845 Cell: 651-5588 E-mail: clay.trainum@lamar.edu
POST-GAME PRESS CONFERENCES The post-game press conference will be held in the team meeting room of the Dauphin Athletic Complex. It will begin following the customary 10-minute cooling off period. The Cardinals’ locker room will be CLOSED to the media. Requested players and coach Ray Woodard will be brought to the media room. The visiting coach will be brought to the media room upon request. COVERING PRACTICE Head coach Ray Woodard will conduct a weekly press conference on Monday afternoons at 2 p.m. from the team meeting room in the Dauphin Athletic Complex. Players will also be brought to the Monday press conference and may be interviewed following Coach Woodard. Media are invited to watch Tuesday practice until 3:45 when it will then become a closed practice. Friday’s 3:30 practice is open, and players may be interviewed prior to or following the short walkthrough. Any other interviews may be scheduled through the Lamar Media Relations Office. Players will not be taken out of practice to interview under any circumstance. GAME-DAY INTERVIEWS Coach Ray Woodard, assisistant coaches and Lamar players will not be available for pre-game interviews. BROADCAST BOOTHS Provost Umphrey Stadium has three broadcast booths with one being designated for Lamar’s flagship station, KLVI 560 AM. Another booth is reserved for the station with broadcast rights of the visiting team and the third will be used for televised games. Any outof-town broadcast station should make arrangements through the Media Relations Department at (409) 880-8329.
MAILING/SHIPPING ADDRESSES Mailing: Lamar University Athletic Department Athletics Media Relations Office P.O. Box 10066 Beaumont, TX 77710 Shipping/Overnight: Lamar University Athletic Department Athletics Media Relations Office Montagne Center Room 138 211 Redbird Lane Beaumont, TX 77710
NEWSPAPERS Beaumont Enterprise: P.O. Box 3071, Beaumont, TX 77704; (409) 838-2806; Mike Tobias, Sports Editor; Avi Zaleon, Football Beat Writer. Port Arthur News: P.O. Box 789, Port Arthur, TX 77640; (409) 984-1218; Bob West, Sports Editor; Tom Halliburton, Football Beat Writer. The Examiner: 795 Willow, Beaumont, TX 77701; (409) 832-1400; Chad Cooper, Sports Editor. Houston Chronicle: 801 Texas Avenue, Houston, TX 77002; (713) 220-7891; Joseph Duarte, Colleges. Associated Press: 4851 LBJ Freeway, Suite 300, Dallas, TX 75244; (800) 442-7189; Jamie Aron, Sports Editor. University Press (campus): P.O. Box 10055, Beaumont, TX 77710; (409) 880-8101 TELEVISION KBTV-TV 4 (FOX): 300 Parkdale Mall, Beaumont, TX 77706; (409) 840-4444; James Ware, Sports Director. KFDM-TV 6 (CBS): 2955 IH-10 East, Beaumont, TX 77702; (409) 895-4673; Mike Friedman, Sports Director; Andrew Chernoff, Weekends. KBMT-TV 12 (ABC): 525 IH-10 South, mont, TX 77701; (409) 838-1212; Dave Sports Director; Ashly Elam, Weekends.
BeauHofferth,
RADIO KLVI (560 AM): P.O. Box 5488, Beaumont, TX 77702; (409) 896-5555; Jim Love, Program Director; Harold Mann, News/Sports Director.
L a m a r Fo otbal l Media Information Ray Woodard Coach’s Show
Mike Friedman
The “Ray Woodard Coach’s Show” will air 12 times begining in September and running through the end of the season on KFDM-TV 6 (CBS). KFDM sports anchor Mike Friedman will serve as host for the 11 p.m. Sunday shows. Coach Woodard will break down the previous week’s game and give a preview of the upcoming opponent. There will also be game highlights and an inside look into the Lamar football program.
KLVI-560 AM Lamar’s Flagship Station
Play-by-Play Announcer Harold Mann interviews Lamar head coach Ray Woodard at the 2010 Southland Conference football media day.
KLVI-560 AM will once again serve as the flagship station of Lamar football with Harold Mann providing the play-by-play and former Lamar linebacker Bo Brown serving as analyst and host of the halftime show. This will be the 18th season of Lamar football broadcasting by KLVI, with the station broadcasting the Cardinals from 1976Bo Brown 89. In addition to broadcasting Lamar football games, KLVI will broadcast a weekly coach’s show with Coach Ray Woodard from Cafe del Rio. The show is scheduled
to air on Mondays at 7 p.m. during the season.
Montagne Center
Gat e1
Provost Umphrey Stadium Press Box
Dauphin Athletic Complex
Media Parking Lot A-2
e2 Gat
MLK Parkway Media Will Call will be Gate 2
141
La mar Foo tba l l Lamar Campus Map
LAMAR UNIVERSITY Physical Plant N f te o stitu y ar In g Lam chnolo Te
2
ca ava E. L
3
.L
4
1
.K in 5
10
7
6
M
9
g
Pk w
14
y
11 12
8
13 15
24
16
17
23
21
19
18
26
25
22
20
27
28 29
35
30
31
32 33
36
39
40
41
34
42
38
37
Alab
46 47
ama 44
r ristophe Rolfe Ch
Univers
45
43
ity
E.
i ni a Virg
ia irgin E. V
rgia 48 Geo
Iowa
49
51 50
55
52
Jim
Way gan Gilli
54 53 56
142
1. Mamie McFaddin Ward 2. Dishman Art Museum 3. Art 4. University Theatre/KVLU 5. Music (Rothwell Recital Hall) 6. Health & Human Performance Complex A&B 7. Hayes Biology 8. Science Auditorium 9. Theater Arts 10. Social & Behavioral Sciences 11. Geology 12. Archer Building 13. Galloway Business 14. Montagne Center 15. Provost Umphrey Stadium and W.S. “Bud� Leonard Field Athletic Complex 16. Chemistry 17. Ty Terrell Track 18. Sheila Umphrey Recreational Sports Center and McDonald Gym 19. Setzer Student Center 20. Carl Parker 21. Setzer Center Bookstore 22. Lucas Engineering 23. Wimberly (Admissions) 24. Visitors Parking 25. Plummer (Administration) 26. Communication Building 27. Post Office/Police 28. Family & Consumer Sciences 29. Mary & John Gray Library 30. Engineering Research Center 31. Cherry Engineering 32. Newman Catholic Center 33. Church of Christ Student Center 34. Honors Program 35. Latter Day Saints Student Center 36. Health Center 37. Monroe Hall (Cardinal Village III) 38. Wesley Foundation Methodist Center 39. Baptist Student Center 40. Dining Hall 41. Texas Success Initiative/Developmental Studies (former ROTC Bldg.) 42. Maes 43. Gentry Hall (Cardinal Village I) 44. Morris Hall (Cardinal Village II) 45. Education 46. Hydraulics Lab 47. Speech and Hearing 48. Combs Hall (Cardinal Village V) 49. Campbell Hall (Cardinal Village IV) 50 . John Gray Center University Advancement 51. Brooks-Shivers Hall 52. Golf Driving Range 53. Vincent-Beck Stadium 54. Early Childhood Development Ctr. 55. Human Resources 56. Soccer Complex
2 0 1 3 S ch e d u l e Date Aug. 31 Sept. 7 Sept. 14 Sept. 21 Sept. 28 Oct. 12 Oct. 19 Oct. 26 Nov. 2 Nov. 9 Nov. 16 Nov. 23
Opponent Oklahoma Panhandle State at Louisiana Tech at Oklahoma State (FSN) Bacone College at Grambling State at Sam Houston State* Central Arkansas*$ (CSN Houston) at Southeastern La.* (ESPN3) Nicholls* at Northwestern State* (SLCTV) Stephen F. Austin* McNeese State*
* - Southland Conference Game $ - Homecoming All Times Central and Subject to Change
Location Beaumont, Texas Ruston, La. Stillwater, Okla. Beaumont, Texas Grambling, La. Huntsville, Texas Beaumont, Texas Hammond, La. Beaumont, Texas Natchitoches, La. Beaumont, Texas Beaumont, Texas
Time 7 p.m. 6 p.m. 6:30 p.m. 7 p.m. 6 p.m. 2 p.m. 6 p.m. 7 p.m. 6 p.m. 3 p.m. 6 p.m. 6 p.m. | https://issuu.com/lamarcards/docs/2013_football_media_guide_layout_1 | CC-MAIN-2016-36 | refinedweb | 80,192 | 78.89 |
20370/avoiding-multiple-nested-for-loops-in-python
How to avoid multiple nested for-loops when one nested for-loop has range up to the current iteration of the outer for-loop? For example, consider the following code: This program returns a triplet from a list arr such that arr[i] - arr[j] = arr[j] - arr[k] = d and i<j<k.
d =3
arr = [1, 2, 4, 5, 7, 8, 10]
list1 = []
for biggest in range(0, len(arr)):
for bigger in range(0, biggest):
for big in range(0, bigger):
if abs(arr[big] - arr[bigger]) == d and abs(arr[bigger] - arr[biggest]) == d:
list1.append([arr[big], arr[bigger], arr[biggest]])
print(list1))
Are there any other alternatives to using multiple nested loops?
You can replace the three loops with:
from itertools import combinations
for big, bigger, biggest in combinations(range(0, len(arr)), 3):
You can replace all the code with:
print([t for t in combinations(arr, 3)
if t[2] - t[1] == t[1] - t[0] == d])
Could use itertools:
>>> for comb in itertools.combinations_with_replacement(range(9, -1, ...READ MORE
Try virtualenv :
This helps you create isolated ...READ MORE
Firstly we will import pandas to read ..
You can replace the three loops with:
from ...READ MORE
OR
Already have an account? Sign in. | https://www.edureka.co/community/20370/avoiding-multiple-nested-for-loops-in-python | CC-MAIN-2019-47 | refinedweb | 219 | 51.78 |
Introduction
This is a pwn challenge on CodeBlue CTF. As a part of my tutorial plan, I take this one as an example on House of Force technique.
Vulnerability Analysis
The source code of this challenge was already given on [1] and I also list the vulnerable part below for analysis.
char *cgiDecodeString (char *text) { char *cp, *xp; for (cp=text,xp=text; *cp; cp++) { if (*cp == '%') { if (strchr("0123456789ABCDEFabcdef", *(cp+1)) && strchr("0123456789ABCDEFabcdef", *(cp+2))) { if (islower(*(cp+1))) *(cp+1) = toupper(*(cp+1)); if (islower(*(cp+2))) *(cp+2) = toupper(*(cp+2)); *(xp) = (*(cp+1) >= 'A' ? *(cp+1) - 'A' + 10 : *(cp+1) - '0' ) * 16 + (*(cp+2) >= 'A' ? *(cp+2) - 'A' + 10 : *(cp+2) - '0'); xp++;cp+=2; } } else { *(xp++) = *cp; } } memset(xp, 0, cp-xp); return text; }
The vulnerability lies in strchr function at line 11 and 12. To better understand why this is a vulnerability, we have to read the specification of strchr function at first.
Locate first occurrence of character in string
Returns a pointer to the first occurrence of character in the C string str.
The terminating null-character is considered part of the C string. Therefore, it can also be located in order to retrieve a pointer to the end of a string.
[2]
It means that the terminating character (“\x00”) will also be taken as one valid character in “0123456789ABCDEFabcdef”. To be more specific, if the terminating character is located after a ‘%’ in the string the vulnerable function will continue to parse the characters after the terminating character.
In the decoding function, we can find that this function will merge a 3-byte string starting with ‘%’ (e.g. “%A1”) into a single byte string (“\xA1”). It means that this function will move the characters in string forwards. If the function can parse the characters after the terminating character, the attacker can merge characters into current string buffer and do the decoding work at the same time.
Exploitation Plan
With this in mind, we are able to corrupt the size of top_chunk with 0xfffffff1 , apply House of Force to allocate one chunk at 0x804b038 and overwrite sscanf with system to get the shell.
The basic plan is to allocate multiple chunks at first assuring that the size of top_chunk is of size 0x25XX. Then we allocate one more chunk of size 0xa0 to put “0xfffffff1” in the url buffer string and free this chunk. After this, we can overwrite the size of top_chunk to 0xfffffff1. Another side effect of this operation is that the heap address will be “pulled” into the url string buffer of current head. We read this heap address and locate the address of current top_chunk.
Another problem I need to solve is to leak the base address of libc. At first, I try to utilise the freed unsorted chunk or freed large chunk to leak the base address. But I find that the “pulling” operation will always corrupt the bck and fwd pointer (libc base address is unknown) and result in glibc abort in next allocation. So my final plan is to leak the value of stdout (at 0x804b084). Another reason that I pick stdout is that the value at 0x804b080 is 0 (NULL as a next pointer) so that I do not need to bother crafting the next node. With the “pulling” operation of the vulnerability, I overwrite a next pointer of one node to 0x804b080 and leak the value of stdout afterwards.
Exploitation
from pwn import * DEBUG = int(sys.argv[1]); if(DEBUG == 0): r = remote("1.2.3.4", 23333); elif(DEBUG == 1): r = process("./nonamestill"); elif(DEBUG == 2): r = process("./nonamestill"); gdb.attach(r, '''source ./script'''); def create(size, url): r.recvuntil(">"); r.sendline("1"); r.recvuntil("size: "); r.sendline(str(size)); r.recvuntil("URL: "); r.sendline(url); def decode(index): r.recvuntil(">"); r.sendline("2"); r.recvuntil("index: "); r.sendline(str(index)); def list(): r.recvuntil(">"); r.sendline("3"); def delete(index): r.recvuntil(">"); r.sendline("4"); r.recvuntil("index"); r.sendline(str(index)); def exploit(): create(0x2528, "A"*0x251a + "%AA%AA" + "MAGIC" + "%A"); create(0x2528, "%31%25%00%00"+p32(0x0804b07c) + "AAAA"); create(0x2528, "11111"); libc = ELF("./libc.so.6"); decode(2); list(); r.recvuntil("2: "); leakedValue = u32(r.recv(4)); log.info("leaked value: 0x%x" % leakedValue); libcBase = leakedValue - 0x1b0d60; log.info("libc base address: 0x%x" % libcBase); systemRelAddr = libc.symbols['system']; systemAbsAddr = systemRelAddr + libcBase; log.info("system addr: 0x%x" % systemAbsAddr); for i in range(0, 0x16f): create(0x100, "padding"); create(0x20-8, "A"*0x4 + "MAGIC" +"%AA%AA%AA%AA%A"); create(0xa0-8, "%00"*4 + p32(0xfffffff1)+"AAAA"); delete(0); decode(0); list(); r.recvuntil("MAGIC"); r.recv(7); leakedValue = u32(r.recv(4)); log.info("leaked value: 0x%x" % leakedValue); topPtr = leakedValue + 0x18; log.info("top pointer address: 0x%x" % topPtr); evilSize = 0x804b03c - topPtr - 4*5; log.info("eval size: 0x%x" % evilSize); create(evilSize, "AAAA"); create(0x8, p32(systemAbsAddr)+"EFG"+"/bin/sh;"); r.interactive(); exploit();
Conclusion
This is a very interesting pwn challenge. As Koike (hugeh0ge) says on his write-up, it’s important to know the specifications of a function. I solve this challenge with about 10 hours after reading his write-up. The write-up indeed saves me a lot of time reversing the binary code of the target.
Reference
[1]
[2] | https://dangokyo.me/2017/11/29/codeblue-ctf-2017-pwn-nomamestill-write-up/ | CC-MAIN-2019-30 | refinedweb | 885 | 65.62 |
The BeOS is based on the ideas that "One processor per person is not enough," (Jean-Louis Gassee) and that it is foolish for a modern operating system to incorperate a lot of legacy code. The BeOS was written from the ground up by Be, Inc. It is much more efficient than most current OS's because it does not make any sacrifices to backwards compatibility. It also supports most major modern operating system concepts. There are currently releases available for PowerPC and Intel platforms.
Anyone who has any curiosity about Operating Systems at all should
really give BeOS a try. It has some wonderful features that really don't
exist in any other operating system, going to show that there is
plenty of room for improvement in the OS world today. Unfortunately,
however, you'll find that there isn't nearly enough mindshare, and
consequently not enough applications, drivers, or support to switch to
it full-time under most circumstances.
BeOS is based on a microkernel architecture, meaning that the kernel
only has the bare-bones services that must exist in kernel space. The
kernel provides a hardware abstraction layer and other basic services, but
most of the functionality is provides in the various servers which run in
user space. Sound, networking, and graphics services all are
implemented through the use of these servers, which allows them to be
stopped and restarted without rebooting! Also, if one of them crashes, it
doesn't take the system down with it: you just restart whatever server
crashed, and you're on your way.
Not that a reboot is so painful. BeOS boots extremely quickly, and
there's never time spent waiting for an fsck, thanks to the journaling
of BFS.
The next thing you notice as a user is how ridiculously responsive the
GUI is. X11 and Windows simply don't compare in this department. I run
it on a PII-300, 64 MB RAM, and GUI operations seem instantaneous.
Resizing windows, switching between virtual desktops, clicking on buttons,
it's all lightning fast, and doesn't slow down even if the computer's under
a heavy load. It's nice to be reminded that GUI's don't have to feel
clunky.
It looks good too. Really good. Fonts are anti-aliased, and look better
than any other GUI, easily. It supports alpha blending natively, so if you
drag an icon around, on top of other things, you see the background through
the icon. But like the rest of the GUI, it's all very fast.
While the GUI is wonderful, with BeOS you don't have to give up your
command line either! It ships with bash, gcc, grep, vi, perl and
friends, making old UNIX heads feel right at home. Though it doesn't come
with everything you'd expect from a UNIX commandline (awk, autoconf, and
others), you can download ports of most of the GNU tools to supplement the
ones that it comes with. And since BeOS includes a fairly complete layer of
POSIX compatibility, porting apps from UNIX is not too difficult.
Not only do you get a commandline, but also a very powerful scripting
engine for GUI applications called "hey." To demonstrate:
$ hey Tracker get Title of Window [0]
$ hey StyledEdit set Frame of Window to "BRect(107,76,607,476)"
Programming for BeOS is an unparalleled delight. The API is a clean set of
C++ classes that work the way you expect them to. After programming on BeOS,
going back to MFC is excruciatingly painful. Just to demonstrate, the
"Hello world" app in BeOS looks like this:
//
// Hello World 2000
//
//
// Written by: Eric Shepherd
//
#include <Application.h>
#include <Window.h>
#include <View.h>
//
// HelloView class
//
// This class defines the view in which the "Hello World"
// message will be drawn.
//
class HelloView : public BView {
public:
HelloView(BRect frame);
virtual void Draw(BRect updateRect);
};
//
// HelloView::HelloView
//
// Constructs the view we'll be drawing in.
// As you see, it doesn't do much.
//
HelloView::HelloView(BRect frame)
: BView(frame, "HelloView", B_FOLLOW_ALL_SIDES, B_WILL_DRAW) {
}
//
// HelloView::Draw
//
// This function is called whenever our view
// needs to be redrawn. This happens only because
// we specified B_WILL_DRAW for the flags when
// we created the view (see the constructor).
//
// The updateRect is the rectangle that needs to be
// redrawn. We're ignoring it, but you can use it to
// speed up your refreshes for more complex programs.
//
void HelloView::Draw(BRect updateRect) {
MovePenTo(BPoint(20,75)); // Move pen
DrawString("Hello, world!");
}
//
// HelloWindow class
//
// This class defines the hello world window.
//
class HelloWindow : public BWindow {
public:
HelloWindow(BRect frame);
virtual bool QuitRequested();
};
//
// HelloWindow::HelloWindow
//
// Constructs the window we'll be drawing into.
//
HelloWindow::HelloWindow(BRect frame)
: BWindow(frame, "Hello World", B_TITLED_WINDOW,
B_NOT_RESIZABLE|B_NOT_ZOOMABLE) {
AddChild(new HelloView(Bounds()));
Show();
}
//
// HelloWindow::QuitRequested
//
// When the window is closed (either by the user clicking
// the close box or by some other means),
// this function is called. You can add code to this
// to give the user the opportunity to save their document,
// or perform other such activities.
//
// Here we just give permission to close the window.
//
bool HelloWindow::QuitRequested() {
be_app->PostMessage(B_QUIT_REQUESTED);
return true;
}
//
// HelloApp class
//
// This class, derived from BApplication, defines the
// Hello World application itself.
//
class HelloApp : public BApplication {
public:
HelloApp();
private:
HelloWindow *theWindow;
};
//
// HelloApp::HelloApp
//
// The constructor for the HelloApp class. This
// will create our window.
//
HelloApp::HelloApp()
: BApplication("application/x-vnd.Be-HelloWorld") {
BRect windowRect;
windowRect.Set(50,50,200,200);
theWindow = new HelloWindow(windowRect);
}
//
// main
//
// The main() function's only real job in a basic BeOS
// application is to create the BApplication object,
// run it, and delete it when it terminates.
//
void main(void) {
HelloApp *theApp; // Pointer to our application object
theApp = new(HelloApp);
theApp->Run();
delete theApp;
}
As you can see, there are no silly AFX_MESSAGE_MAPs, nor funny
typedefs--this is C++ at it's best.
BeOS 5 for Intel, their latest release, is available for free, for
non-commercial use. You can
download it from entire OS, including many sample
applications and demos is 40 MB! All the development tools, available
for free as well, are another 20 MB. The OS download is actually an EXE that
installs a 500 MB file onto a Windows partition, which is nothing but an
image of a BFS file system. Then, in a procedure I don't really understand,
it somehow manages to boot BeOS completely natively (ie. not "under"
windows). However, once the OS is installed, you can use the included Disk
utility to create a real bona-fide BFS partition and install from the 500 MB
fake partition to the real partition. I know this can be done: I've done
it.
In my opinion, BeOS is the best desktop operating system out there.
While Linux and other Unices shine on the server side, BeOS excels on the
desktop in ways that UNIX can never really do if it is to maintain its
flexibility.
But I fear that without major vendor support, BeOS is doomed to parallel
the Amiga; superior as it is in some ways, it just doesn't have the
momentum to overcome the formidable barriers to entry in the OS
market.
Sources:
BeOS Bible: Scripting -
A.
What keeps me holding out is unconfirmed rumors that Be, Inc, is planning to open-source BeOS. This has raised speculation from many industry analysts that, should Be become a free OS, it will become the choice of less experienced users, instead of the ultra hands-on Linux.
BeOS will not and cannot be open-sourced. The rumors are unconfirmed because they are completely false. The reason BeOS is closed is because there is a lot of proprietary code in there, which is not owned by Be. Without this code, the OS would basically be useless. Look in the About BeOS window sometime. MP3 support by Fraunhofer, RSA encryption by RSA, USB support by Intel, and Indeo video by Intel. That's just the major stuff, there's a lot more "under the hood". While it might be nice for some people to think about, most Be zealots like myself can't bear the thought of BeOS becoming like Linux, with 12 billion different versions, or worse yet getting absorbed by it. Not that there's anything wrong with Linux, it's just that the two operating systems are geared for totally different things, Linux for running servers, BeOS for creating multimedia.
There are parts of the OS that are open-source right now, though. The source to all the GNU utilities that Be uses is on the Be CD, the Tracker and Deskbar are open-source (with, I think, a BSD-ish license), and the code to a few of their demos comes with the development tools.
As of today (April 2002), Be, Inc. is in a process of dissolution. All Intellectual Property, including BeOS source code, has been sold to Palm for a ridiculous $11M. They don't want to market it though, it seems they just wanted all the engineers to come over.
Sadly, Be Inc. is no longer in business. Going against Microsoft in the x86 desktop market proved to be too much, and after a short excursion into the Internet Appliances market with BeIA, Be was purchased by Palm, Inc. Even the domain is now up for sale, and what remains of the company web site is now located at. However, it seems that many of the fine engineers from Be are now working on PalmOS 6. Hopefully we'll see some of the revolutionary ideas from BeOS show up in newer handhelds and PDAs.
For those who wish to try out the BeOS, versions of Personal Edition are still available for download, although not from Be's site. The latest official release was 5.0.3, although there was an unofficial release called "Dano" with was supposedly based on leaked beta code and includes a number of additional utilities. A number of development efforts have started since the Be buyout to create an open-source BeOS clone. Some of these include Blue Eyed OS and OpenBeOS. Another OS similar in concept to BeOS is AtheOS. Recently Bill Hayden created a fork of AtheOS with APIs to match that of the BeOS. Whatever happens with these development efforts, it's always nice to boot up BeOS once in a while and see what OSes could, and should be like.
Log in or register
to write something here or to contact authors. | http://everything2.com/title/BEOS | CC-MAIN-2014-15 | refinedweb | 1,744 | 62.78 |
.
One of the essential pieces of NumPy is the ability to perform quick element-wise operations, both with basic arithmetic (addition, subtraction, multiplication, etc.) and with more sophisticated operations (trigonometric functions, exponential and logarithmic functions, etc.). Pandas inherits much of this functionality from NumPy, and the ufuncs that we introduced in Computation on NumPy Arrays: Universal Functions are key to this.
Pandas includes a couple useful twists, however: for unary operations like negation and trigonometric functions, these ufuncs will preserve index and column labels in the output, and for binary operations such as addition and multiplication, Pandas will automatically align indices when passing the objects to the ufunc.
This means that keeping the context of data and combining data from different sources–both potentially error-prone tasks with raw NumPy arrays–become essentially foolproof ones with Pandas.
We will additionally see that there are well-defined operations between one-dimensional
Series structures and two-dimensional
DataFrame structures.
import pandas as pd import numpy as np
rng = np.random.RandomState(42) ser = pd.Series(rng.randint(0, 10, 4)) ser
0 6 1 3 2 7 3 4 dtype: int64
df = pd.DataFrame(rng.randint(0, 10, (3, 4)), columns=['A', 'B', 'C', 'D']) df
If we apply a NumPy ufunc on either of these objects, the result will be another Pandas object with the indices preserved:
np.exp(ser)
0 403.428793 1 20.085537 2 1096.633158 3 54.598150 dtype: float64
Or, for a slightly more complex calculation:
np.sin(df * np.pi / 4)
Any of the ufuncs discussed in Computation on NumPy Arrays: Universal Functions can be used in a similar manner.
area = pd.Series({'Alaska': 1723337, 'Texas': 695662, 'California': 423967}, name='area') population = pd.Series({'California': 38332521, 'Texas': 26448193, 'New York': 19651127}, name='population')
Let's see what happens when we divide these to compute the population density:
population / area
Alaska NaN California 90.413926 New York NaN Texas 38.018740 dtype: float64
The resulting array contains the union of indices of the two input arrays, which could be determined using standard Python set arithmetic on these indices:
area.index | population.index
Index(['Alaska', 'California', 'New York', 'Texas'], dtype='object')
Any item for which one or the other does not have an entry is marked with
NaN, or "Not a Number," which is how Pandas marks missing data (see further discussion of missing data in Handling Missing Data).
This index matching is implemented this way for any of Python's built-in arithmetic expressions; any missing values are filled in with NaN by default:
A = pd.Series([2, 4, 6], index=[0, 1, 2]) B = pd.Series([1, 3, 5], index=[1, 2, 3]) A + B
0 NaN 1 5.0 2 9.0 3 NaN dtype: float64
If using NaN values is not the desired behavior, the fill value can be modified using appropriate object methods in place of the operators.
For example, calling
A.add(B) is equivalent to calling
A + B, but allows optional explicit specification of the fill value for any elements in
A or
B that might be missing:
A.add(B, fill_value=0)
0 2.0 1 5.0 2 9.0 3 5.0 dtype: float64
A = pd.DataFrame(rng.randint(0, 20, (2, 2)), columns=list('AB')) A
B = pd.DataFrame(rng.randint(0, 10, (3, 3)), columns=list('BAC')) B
A + B
Notice that indices are aligned correctly irrespective of their order in the two objects, and indices in the result are sorted.
As was the case with
Series, we can use the associated object's arithmetic method and pass any desired
fill_value to be used in place of missing entries.
Here we'll fill with the mean of all values in
A (computed by first stacking the rows of
A):
fill = A.stack().mean() A.add(B, fill_value=fill)
The following table lists Python operators and their equivalent Pandas object methods:
When performing operations between a
DataFrame and a
Series, the index and column alignment is similarly maintained.
Operations between a
DataFrame and a
Series are similar to operations between a two-dimensional and one-dimensional NumPy array.
Consider one common operation, where we find the difference of a two-dimensional array and one of its rows:
A = rng.randint(10, size=(3, 4)) A
array([[3, 8, 2, 4], [2, 6, 4, 8], [6, 1, 3, 8]])
A - A[0]
array([[ 0, 0, 0, 0], [-1, -2, 2, 4], [ 3, -7, 1, 4]])
According to NumPy's broadcasting rules (see Computation on Arrays: Broadcasting), subtraction between a two-dimensional array and one of its rows is applied row-wise.
In Pandas, the convention similarly operates row-wise by default:
df = pd.DataFrame(A, columns=list('QRST')) df - df.iloc[0]
If you would instead like to operate column-wise, you can use the object methods mentioned earlier, while specifying the
axis keyword:
df.subtract(df['R'], axis=0)
Note that these
DataFrame/
Series operations, like the operations discussed above, will automatically align indices between the two elements:
halfrow = df.iloc[0, ::2] halfrow
Q 3 S 2 Name: 0, dtype: int64
df - halfrow
This preservation and alignment of indices and columns means that operations on data in Pandas will always maintain the data context, which prevents the types of silly errors that might come up when working with heterogeneous and/or misaligned data in raw NumPy arrays. | https://nbviewer.jupyter.org/github/donnemartin/data-science-ipython-notebooks/blob/master/pandas/03.03-Operations-in-Pandas.ipynb | CC-MAIN-2019-13 | refinedweb | 902 | 53.92 |
While redesigning my portfolio site I thought it would be cool to integrate the classic programming simulation, Game of Life by John Conway. It turns out using
canvas with React is a bit of a challenge for beginners, and required putting together multiple online resources I found. Here's how to do it.
Conway's Game of Life
The first step is pretty straight forward in regards to programming a canvas to display the Game of Life. For this I followed Adrian Henry's tutorial. I won't rehash the walkthrough here, but I encourage you to watch him and clone the final code from here.
This is what we will convert into a header element.
Let's just drop it into the Component render method!
That isn't possible.
The VanillaJS code requires the canvas element to already be mounted on the DOM so it can be referenced in the first line of the code. Whenever we want something to occur after the element has been mounted, we have to use the
useEffect hook (when using functional components). So lets try placing the entire original script inside component's
useEffect hook...
Remove logic from the
useEffect
This turned out to be very challenging, because we will have to refactor our functions to take dependent variables. Lets start with moving the
buildGrid() function out of the component completely, and add the
COLS and
ROWS as dependent parameters. Move the now
buildGrid(COLS,ROWS) function above the
GameOfLife component.
The same can be done with the
nextGen(grid) function, but because it references elements on the DOM, it must remain in the component, so we can move it out of the
useEffect hook, and add the requisite
COLS and
ROWS parameters like so:
nextGen(grid, COLS, ROWS)
Noting has changed on the view yet but we have cleaned up out
useEffect hook to make room for the next step: making the canvas and pixel resolution responsive.
Make it fill the width of the screen, and make it responsive
For this section, my primary source was Pete Corey's tutorial.
First thing we need to introduce is the
useRef hook to allow us to interact with the canvas. And we will create the
getPixelRatio function above the component definition:
const getPixelRatio = context => { var backingStore = context.backingStorePixelRatio || context.webkitBackingStorePixelRatio || context.mozBackingStorePixelRatio || context.msBackingStorePixelRatio || context.oBackingStorePixelRatio || context.backingStorePixelRatio || 1; return (window.devicePixelRatio || 1) / backingStore; };
The
getPixelRatio function will return the aspect ratio of the viewport to avoid stretching the pixels and help us keep square colonies in our Game of Life simulation.
Now we can replace
canvas.width = 800; canvas.height = 800;
with
let ratio = getPixelRatio(ctx); let width = getComputedStyle(canvas) .getPropertyValue('width') .slice(0, -2); let height = getComputedStyle(canvas) .getPropertyValue('height') .slice(0, -2); canvas.width = width * ratio; canvas.height = height * ratio; canvas.style.width = `100%`; canvas.style.height = `100%`;
Because of the restricted size of the embedded codepen, I changed the value of resolution to 1 to give a larger field of colonies.
Slow it down!
If you are familiar with Conway's Game of Life, you're aware that a stable state is reach fairly quickly, so lets slow down the rate at which the animation refreshes so it lasts longer. An additional benefit, is it slows down the rate in which images are flashing on the screen for accessibility purposes. To accomplish this, we will need to wrap the
requestAnimationFrame(update) call inside the
update function in a
setTimeout function and give it a 2 second refresh rate, like so:
setTimeout(() => requestAnimationFram(update), 2000).
Give it a little style
Now lets add a little color. This must be done in the javascript where the canvas is being drawn. I will add variables to hold the hex values for the
fieldColor and
colonyColor and change the "black" and "white" options, which are contingent on the grid values, to reference these variables.
Now I want to add a slant to the bottom on the header. Typically, we would use CSS transform's skew function, but that would ruin the grid nature of the colonies. So I applied a simple clip-path to the CSS.
You can see the full application on my portfolio page or view the repo on github.
Discussion (0) | https://dev.to/vetswhocode/game-of-life-as-a-react-component-using-canvas-275g | CC-MAIN-2022-27 | refinedweb | 710 | 54.93 |
#include <disco.h>
#include <disco.h>
Inherits StanzaExtension.
Inheritance diagram for Disco::Items:
Definition at line 250 of file disco.h.
EmptyString
Creates an empty Items object, suitable for making disco#items requests.
Definition at line 236 of file disco.cpp.
[virtual]
Virtual destructor.
Definition at line 259 of file disco.cpp.
Returns an XPath expression that describes a path to child elements of a stanza that an extension handles.
Implements StanzaExtension.
Definition at line 274 of file disco.cpp.
[inline]
Returns the entity's/node's items.
Definition at line 286 292 of file disco.h.
Returns the queried node identifier, if any.
Definition at line 280 of file disco.h.
This function can be used to set the entity's/node's items.
Definition at line 274 of file disco.h.
Returns a Tag representation of the extension.
Definition at line 280 of file disco.cpp. | http://camaya.net/api/gloox-trunk/classgloox_1_1Disco_1_1Items.html | crawl-001 | refinedweb | 148 | 55.3 |
Wiki
JDD / FAQ
JDD Frequently Asked Questions
This is a list of the JDD library Frequently Asked Questions (FAQ). It contains answers to some frequently asked questions about the JDD library.
Introduction (what is this all about?)
What is this?
This is a package for working with Binary Decision Diagrams (BDDs) and Zero-suppressed BDDs.
What is it good for?
BDDs are used to efficiently represent and manipulate functions that map a binary vector to a boolean value (i.e. f: 2^V -> {0,1}). This representation can be used to efficiently store huge sets/functions/relations in relatively small chunks of memory. It can be used in to solve large combinatorial and graph problems. There are many application from CAD to compiler optimization to Internet firewall technology.
I really like your work, can I donate some money?
go away, you are not funny!
Sounds good, can I use it in my project?
Yes
Can I use JDD in my commercial application?
Yes. But make sure you read the zlib license first.
Are there any patented algorithms used in JDD?
To best of knowledge, no
Performance
How fast is JDD Compared to other packages?
It is written in Java, so it is not as quiet as fast as the state-of-the-art packages. For certain problems, it is ranked in the top five [according to our benchmarks].
See also performance .
Why is JDD so slow on some benchmark problems??
JDD lacks dynamic variable re-ordering. Therefore, some benchmark problems that use a very bad initial variable ordering cannot complete in reasonable time.
What is dynamic variable re-ordering anyway??
The size of a BDD representing a boolean functions may differ drastically depending on the order in which the boolean variables are introduced in the BDD. There exists several algorithms to re-arrange the variable order on the fly to make the BDDs smaller.
Why doesn't JDD support dynamic variable re-ordering??
For some problems, given a good initial variable ordering, very very few problems benefit from dynamic variable re-ordering. In fact, as Bwolen Yang's PhD thesis showed, re-ordering often costs more than it gives back in terms of time (and space?). This is specially true for sequential problems, which is the main target of JDD. Beside, not including variable re-ordering made the JDD code less complex...
Why does JDD fail to allocate more memory even when large chunks are available?
This has to do with the heap-compacting algorithm of the Java virtual machine. JDD will however try to remedy this by compressing the memory into LZW chunks and then re-building everything.
Why is my BDD application so slow? I thought BDDs were very efficient?
There may be several reasons: bad variable ordering is the most possible. Maybe you are solving your problem in a wrong way? Maybe what you really need is a SAT-solver? Maybe the problem is intractable anyway? Check out Alan Hu's PhD thesis (Stanford) and Bwolen Po-Jen Yang's PhD thesis (CMU) for some basic guidelines on the subject.
For better performance with JDD, should I get a faster CPU, more cache or more RAM??
For model checking, get more RAM. For circuit verification get the CPU with the largest cache you can find on this planet. If you are doing many "small" bdd computations, get a faster CPU.
(this advice is very JDD specific and does not apply to BuDDy et al.)
Is the server java virtual machine is recommended to use with JDD?
The server JVM is a high performance virtual machines provided by SUN. The server JVM includes sophisticated JIT optimization, which promise performance equal or better that native C executable. It is primary used in high-end servers. You may use it by adding the -server switch to the java command line. Beware however that the complex structure of JDD makes it hard for the server JVM to analyze and generate efficient code. In general, the server JVM is slower on smaller example due to an overhead of 2-20s for JIT optimization. Consider for example the following mini-benchmark on the N queen example:
N -client -server (time in ms) (time in ms) ------------------------------------------- 8 160 1540 9 770 6750 10 3840 7000 11 21500 23000 12 first at N=12 the server JVM becomes more efficient
Also, the server JVM is slow the first time the code is run. For best performance, try to run multiple JDD application without invoking the "java" command more than once (start all your applications from a short java program instead of, say, a shell script).
Why is JDD so fast on the C6288 multiplier benchmark?
This is an example of a type of model where you cannot "cheat" by pre-computing a very good initial variable order and use that instead of the given variable ordering :)
Technical details
How many bytes does each BDD node occupy in JDD?
16 bytes in the node-table, in addition, about 8 bytes are required for each node in the hash-table. So the actual size is 24.
What kind of garbage collection is used in JDD?
Top-level reference counting + mark and sweep.
Does JDD use depth or breadth-first node traversal ??
Depth first (breadth first may be included in later versions)
What is the maximal number of nodes than can exists in JDD?
Theoretically, 2^31. However, since currently Java applications can at most allocate 3G bytes, and each node is about 24 bytes large, the correct number is about 80 million nodes [2^26] :( We are not sure if this differs on 64-bit architectures. If it does, then the limit is 2^31 nodes. It should be noted that the largest practical problem we have seen so far required about 10 million nodes, at worst.
A general guideline is that if you are above 3 million nodes, then you should either re-think your algorithm or use another technique than BDDs...
What is the maximal number of variables that can be used in JDD?
Again, 2^31 in theory and about 40 million in practice, which should still be enough for most people ;)
Developer stuff
How can I contribute to the JDD project?
There are several ways:
- Join the development team and implement some fancy BDD algorithms.
- Submit bug reports!
- Write your own benchmark suite and send it to us
- Find a nice way to solve some well known problem with BDDs
- Donate us some books about algorithms and complexity ;)
- ...
The very least thing you could do is to run the following commands and email the results to us:
java -cp jdd.jar jdd.util.jre.JRETest java -cp jdd.jar jdd.examples.BDDQueens 8 java -cp jdd.jar jdd.examples.BDDQueens 10 java -cp jdd.jar jdd.examples.BDDQueens 12
What version of JDD am I running?
We use an increasing build number to indicate changing versions. see the jdd.Version.build field.
Features
The BDD library is extremely low-level, I need a more user-friendly API!
The core BDD library is low-level to give you complete control over each computation. We understand that programming at such a low level is error prone, you will simply have to write your own high-level wrappers.
NEW: The friendly people of the JavaBDD project have created a wrapper for JDD which allows you to use their high-level interface with JDD. Give it a try!
Complemented edges, please, please, please...
We are thinking about it... The performance results from CUDD are however not very encouraging, so we probably won't add CE BDDs to JDD.
I would like to see the algorithm "xyz" in the next version of JDD
Sure, but if it is too much work, we might send you the source code and ask you to implement it yourself :)
Common Problems (stuff that usually fill my mailbox)
How can I submit a bug?
Use the issue tracker...
I have an example of a problem on which JDD performs very poor, what should I do?
Send us the example and we will look at it. Either its a bug or a performance problem in JDD (or your problem is intractable by nature). Neither way, we will fix it till the next release.
My JDD application is very slow! In 99.99% of cases, it is your application that is trying to compute something that is really much harder than you think it is. It might also (but not very likely) be a JDK/JRE problem. Run the following commands and email us the output.
java -cp jdd.jar jdd.util.jre.JRETest java -cp jdd.jar jdd.examples.BDDQueens 8 java -cp jdd.jar jdd.examples.BDDQueens 10
I can't get the DOT output working!
Dot is a third-party utility provided by AT&T research. Make sure you first download it and install it from. If you still get errors like this:
java.io.IOException: CreateProcess: ...
Then probably dot is not in your path.
I want the source DOT file, but all I get is its picture...
By default, when you create a DOT file you will get a PNG-image. to get the source file instead, try this:
import jdd.util.*; [...] Dot.setRemoveDotFile(false); Dot.setExecuteDot(false); bddobject.printDot("filename.dot", somebdd);
Whats wrong with this code?
BDD bdd = new BDD(); [...] int bdd1 = bdd.and(somevariable, anothervaribale); in2 bdd2 = bdd.and(thirdvariable, andsoon); int bdd3 = bdd.or( bdd1, bdd2);
This code is dead wrong!. Since you are not adding a ref-count to "bdd1", it may get garbage collected (for example, during the second "and") and then when you try the "or", "bdd1" is not a valid bdd anymore and the result of this operation is garbage. Do this instead:
int bdd1 = bdd.ref( bdd.and(somevariable, anothervaribale) ); int bdd2 = bdd.ref( bdd.and(thirdvariable, andsoon) ); int bdd3 = bdd.ref( bdd.or( bdd1, bdd2) ); // yes, this one too. you will need it later on, wont you? bdd.deref(bdd2); bdd.deref(bdd1);
One way to catch such problems is to use a "DebugBDD" object instead of "BDD". Beware however that it is very slow and might not catch all problems.
Whats wrong with this other code?
BDD bdd = new BDD(); [...] int bdd1 = bdd.ref( bdd.and(somevariable, anothervaribale) ); in2 bdd2 = bdd.and(thirdvariable, andsoon); int bdd3 = bdd.ref( bdd.or( bdd1, bdd2) ); bdd.deref(bdd3);
Nothing really. "bdd2" is not ref-counted, but nothing happens between the creation of "bdd2" and the call to "or" so "bdd2" cannot not be garbage collected. During the "or" itself, "bdd2" is protected from garbage collection by JDD.
Note however that "DebugBDD" will catch this as a possible error!.
Misc.
Can several BDD managers simultaneously exist in JDD?
Yes. In fact, it is easy to implement routines to even move BDD trees between different packages. You must now mix them, thought.
Are Z-BDDs better than BDDs?
Z-BDDs represent sparse sets more efficiently. They are probably more useful for representing things such as Petri nets and graphs.
What is the relation between JDD and BuDDy?
JDD uses the same internal structure as BuDDy. In fact, few operations are copy-pasted from the BuDDy source :)
What is the relation between JDD and CUDD? JDD and CUDD use the same hash functions, that is the only relation I can think of...
Updated | https://bitbucket.org/vahidi/jdd/wiki/FAQ | CC-MAIN-2017-30 | refinedweb | 1,897 | 67.35 |
JSONiq
JSONiq is an actively used query language created in 2011. JSONiq is a query and functional programming language that is designed to declaratively query and transform collections of hierarchical and heterogeneous data in format of JSON, XML, as well as unstructured, textual data. JSONiq is an open specification published under the Creative Commons Attribution-ShareAlike 3.0 license. It is based on the XQuery language, with which it shares the same core expressions and operations on atomic types. Read more on Wikipedia...
- JSONiq ranks in the top 10% of languages
- the JSONiq website
- the JSONiq wikipedia page
- JSONiq first appeared in 2011
- file extensions for JSONiq include jq
- See also: xquery, sql, json, xml, isbn
- I have 36 facts about JSONiq. what would you like to know? email me and let me know how I can help.
Example code from Linguist:
(: Query for returning one database entry :) import module namespace req = ""; import module namespace catalog = ""; variable $id := (req:param-values("id"), "London")[1]; variable $part := (req:param-values("part"), "main")[1]; catalog:get-data-by-key($id, $part)
Example code from Wikipedia:
for $p in collection("persons") return <person> <firstName>{$p("firstName")}</firstName> <lastName>{$p("lastName")}</lastName> <age>{$p("age")}</age> </person>
Last updated July 22nd, 2019 | https://codelani.com/languages/jsoniq.html | CC-MAIN-2019-35 | refinedweb | 208 | 50.87 |
ffmpeg wrapper for RTSP client
Project description
RTSP Package
/((((((\\\\ =======((((((((((\\\\\ (( \\\\\\\ ( (* _/ \\\\\\\ \ / \ \\\\\\________________ | | | </ __ ((\\\\ o_| / ____/ / _______ \ \\\\ \\\\\\\ | ._ / __/ __(_-</ _ \ \ \\\\\\\\\\\\\\\\ | / /_/ \__/___/ .__/ / \\\\\\\ \\ .______/\/ / /_/ / \\\ / __.____/ _/ ________( /\ / / / ________/`---------' \ / \_ / / \ \ \ \ \_ \ ( < \ \ > / \ \ \/ \\_ / / > ) \_| / / / / _// _// /_| /_|
RTSP Client. Requires ffmpeg system call for RTSP support and Pillow for parsing and conversion.
Features
- fetch a single image as Pillow Image
- open RTSP stream in FFmpeg and poll for most recent frame
Examples
One-off Retrieval
import rtsp image = rtsp.fetch_image('rtsp://1.0.0.1/StreamId=1')
Continuous Retrieval
import rtsp collector = rtsp.FFmpegListener() image = collector.read()
Continuous Retrieval Context Manager
import rtsp with rtsp.FFmpegListener() as collector: _image = collector.read() while True: process_image(_image) _image = collector.read()
Project details
Release history Release notifications
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages. | https://pypi.org/project/rtsp/1.0.7/ | CC-MAIN-2019-43 | refinedweb | 147 | 53.07 |
On Mon, Apr 28, 2003 at 12:55:56AM -0400, Dan Langille wrote: > On 28 Apr 2003 at 0:40, Jon Carnes wrote: > > On Fri, 2003-04-25 at 06:19, Dan Langille wrote: > > > On 24 Apr 2003 at 21:42, admin2 wrote: > > > > Okay I am getting a little confused here. Is there a good > > > > link out there that steps an admin through setting up mailman > > > > for virtual hosting? > > > Not that I've found. I've been trying to write one, but I've > > > not been able to solve two basic problems. > > > > > > I've been attempting to migrate freebsddiary.org and > > > freshports.org mailing lists from majordomo to mailman. I've > > > found the administration interface and the the user interface to > > > be much better, but it seems much more difficult to do things > > > that are fairly well documented for majordomo. The two main > > > blocks I've encountered are: > > > > > > 1 - You cannot have two mailing lists with the same name in two > > > different domains and obtain satisfactory results: > > The way we currently get around this, is to make an install of > > Mailman for each domain. > Ahhh, thanks, I've been looking for someone who's already achieved > this. I hope we can develop a better solution. Multiple installs > are OK for small numbers of domains, but it is very impractical for > large installations. Agreed. We would be *very* interested in seeing better virtual domain support with one installation of Mailman. I originally thought that 2.1.x would have better virtual domain support, but its idea of "virtual domain" support mostly has to do with actual alias generation, etc., and not with having multiple list namespaces with the same mailman install. FWIW, the way we currently handle this is a bit ugly, but works... We create the lists with the domain name in them... for example: list-example.com at lists.example.com Then we alias list at example.com to list at lists.example.com. This basically works, but the email addresses in the rfc 2369 headers and list headers / footers still have the full listname. If there was an easy way to give mailman a fake listname (i.e., list at example.com), and have all of the headers match this pattern (list-bounces at example.com, list-request at example.com, etc.), that would probably be enough of a workaround -- the actual listname and HTTP links could still point to list-example.com at lists.example.com (hopefully, some similar hack could be worked out with the Apache stuff so that the links could be the simple name as well). I agree that doing independent installs of Mailman would be a huge PITA - even if the installation were automated, it would make things a huge hassle for a large installation. I believe Sympa may handle this a bit better - I've considered switching, but since we have a large number of existing Mailman lists, and since we're more familiar with Mailman, we are probably going to stick with our current system for a while. -- "Since when is skepticism un-American? Dissent's not treason but they talk like it's the same..." (Sleater-Kinney - "Combat Rock") | https://mail.python.org/pipermail/mailman-users/2003-April/028405.html | CC-MAIN-2016-40 | refinedweb | 529 | 65.83 |
This module provides classes that describe embroidery patterns and can display them and information associated with them. a number of standard Java classes to help with input/output from files and managing data structures. The Android classes we use are concerned with accessing resources, rendering graphics, performing background tasks and presenting a user interface.
from java.io import BufferedInputStream, File, FileInputStream, InputStream, \ IOException from java.lang import Byte, Math, Object, String from java.text import DateFormat from java.util import List, Map, Queue from android.content import Context from android.content.res import Resources from android.graphics import Bitmap, Canvas, Color, Paint, Rect from android.os import AsyncTask from android.view import View, ViewGroup from android.widget import Adapter, BaseAdapter, ImageView, TextView
The remaining imports are from two application modules.
The common module provides various classes to describe elements of embroidery patterns as well as implementations of streams used to read data from JEF files.
from common import LittleStream, Rectangle, Stitch, Threads
The jef_colours module provides a class that is used to obtain the colour definitions for threads used in a pattern.
from jef_colours import ColourInfo
We define a class to represent a pattern with a number of fields that will be accessed by other components.
class Pattern(Object): __fields__ = {"date": String, "hoop_code": int, "rectangles": List(Rectangle), "colours": List(int), "thread_types": List(int), "threads": List(List(Stitch))} def __init__(self): Object.__init__(self)
The following method fills in the fields using data supplied by an
InputStream. This allows us to separate the task of opening a JEF file
from the task of decoding its contents.
@args(void, [InputStream]) def read(self, input): stream = LittleStream(input) start = stream.readInt() has_date = (stream.readInt() & 1) != 0 if has_date: dateFormat = DateFormat.getDateTimeInstance() self.date = String(stream.readBytes(14), "ASCII") else: stream.skipBytes(14) self.date = "" stream.skipBytes(2) threads = stream.readInt() data_length = stream.readInt() * 2 self.hoop_code = stream.readInt() # Read bounding rectangles. self.rectangles = [] while stream.position < 0x74: x1 = stream.readInt() y1 = stream.readInt() x2 = stream.readInt() y2 = stream.readInt() if x1 != -1 and y1 != -1 and x2 != -1 and y2 != -1: self.rectangles.add(Rectangle(-x1, -y1, x2, y2)) self.colours = [] i = 0 while i < threads: self.colours.add(stream.readInt()) i += 1 self.thread_types = [] i = 0 while i < threads: self.thread_types.add(stream.readInt()) i += 1 #stream.skipBytes(start - stream.position) self.read_threads(stream)
Since the task of reading the thread data is a fair amount of code in itself, this is split into a separate method that continues to use the stream object created in the previous method.
@args(void, [LittleStream]) def read_threads(self, stream): self.threads = [] x = y = 0 stitches = [] first = True command = "" i = 0 while True: try: bx = Byte(stream.readByte()).intValue() by = Byte(stream.readByte()).intValue() except IOException: break if bx == -128 and by == 0x01: # Record the coordinates already read and skip the next two bytes. if len(stitches) > 0: self.threads.add(stitches) stitches = [] first = True stream.skipBytes(2) continue elif bx == -128 and by == 0x02: command = "move" first = True x += Byte(stream.readByte()).intValue() y += Byte(stream.readByte()).intValue() elif bx == -128 and by == 0x10: if len(stitches) > 0: self.threads.add(stitches) break else: command = "stitch" x += bx y += by if command == "move": stitches.add(Stitch(command, x, y)) elif first: stitches.add(Stitch("move", x, y)) first = False else: stitches.add(Stitch(command, x, y))
Rendering is performed by the following class which is used in conjunction
with an instance of the
PatternViewAdapter class. Since we want to perform
rendering of each pattern as a background task, the class is derived from the
standard
AsyncTask template class.
We need to specify which concrete types our class uses for the input
parameters, progress value and result value. We do this by defining the
__item_types__ attribute which indicates that an instances of the class will
process an array of integers, publish a
Bitmap to indicate progress, and
produce a
Bitmap as the result.
class PatternRenderer(AsyncTask): __item_types__ = [int, Bitmap, Bitmap]
The
__init__ method accepts the file containing the pattern to render,
the colour information object, the
ImageView used to
display the resulting bitmap, a
Map that contains cached bitmaps for
patterns already rendered, and a queue of keys for bitmaps in the cache.
@args(void, [File, ColourInfo, ImageView, Map(int, Bitmap), Queue(int)]) def __init__(self, file, colourInfo, imageView, cache, queue): AsyncTask.__init__(self) self.file = file self.colourInfo = colourInfo self.imageView = imageView self.cache = cache self.queue = queue self.background = Color.argb(255, 64, 64, 64)
We define a method to conveniently create new empty bitmaps since we need to create these in a couple of places in this module.
@args(Bitmap, [int, int]) def emptyBitmap(self, width, height): bitmap = Bitmap.createBitmap(width, height, Bitmap.Config.ARGB_8888) return bitmap
The following method performs work in a background thread. It accepts
an array of the
Params type, which we defined above as
int, so it will
receive an array of integers which describe the width and height of each
bitmap to create, as well as the position of the bitmap in the adapter that
uses the
PatternRenderer. The position is used as a key into the
Map we
use as a cache.
@args(Result, [[Params]]) def doInBackground(self, params): width, height, self.position = params stream = BufferedInputStream(FileInputStream(self.file)) pattern = Pattern() pattern.read(stream)
We read the file containing the pattern using a stream, passing it
to a newly-created
Pattern object. The bounding boxes of the threads
that make up the pattern are combined to produce an overall bounding
box for the pattern.
x1 = y1 = x2 = y2 = 0 for thread in pattern.threads: for stitch in thread: x1 = Math.min(x1, stitch.x) x2 = Math.max(x2, stitch.x) y1 = Math.min(y1, stitch.y) y2 = Math.max(y2, stitch.y) bbox_width = x2 - x1 bbox_height = y2 - y1
We create a
Bitmap of the desired size and fill it with a
predefined background colour before using a
Canvas to draw the
pattern in the bitmap. We use the bounding box size to scale the
drawing so that it fits inside the bitmap.
bitmap = self.emptyBitmap(width, height) bitmap.eraseColor(self.background) canvas = Canvas(bitmap) ox = float(width/2) oy = float(height/2) xscale = float(width)/bbox_width yscale = float(height)/bbox_height scale = Math.min(xscale, yscale)
We combine the colours and threads as we iterate over them, using
each colour to create a
Paint that we apply to a series of calls to
the
Canvas.drawLine method. Each "move" in the thread sets the
current position using the absolute coordinate values defined by the
stitch. Each "stitch" causes a line to be drawn from the current
position to the new position before updating the current position.
colour_it = pattern.colours.iterator() thread_it = pattern.threads.iterator() while colour_it.hasNext() and thread_it.hasNext(): colour_index = colour_it.next() thread = thread_it.next() paint = Paint() paint.setColor(self.colourInfo.getColour(colour_index)) x = ox y = oy for stitch in thread: sx = float(stitch.x) sy = float(stitch.y) if stitch.command == "move": x = sx y = sy elif stitch.command == "stitch": canvas.drawLine(ox + (x * scale), oy - (y * scale), ox + (sx * scale), oy - (sy * scale), paint) x = sx y = sy self.publishProgress(array([bitmap])) return bitmap
As each thread is drawn, the current bitmap is published to show the progress made. When all threads have been drawn, the final bitmap is returned.
The following method handles each publication of the progress made while
rendering, updating the
ImageView that displays the bitmap in the
application's main UI thread.
@args(void, [[Progress]]) def onProgressUpdate(self, progress): bitmap = progress[0] self.imageView.setImageBitmap(bitmap)
When all processing has finished, the following method is called by the
application framework to allow the final result to be handled in the main
UI thread. We update the bitmap cache with the new bitmap and add its
position to the queue of keys to the cache. Then we update the
ImageView
to show the finished bitmap.
@args(void, [Result]) def onPostExecute(self, result): self.cache[self.position] = result self.queue.add(self.position) self.imageView.setImageBitmap(result)
This class is currently unused. It provides a custom
TextView subclass that
displays basic information about a pattern.
class PatternInfo(TextView): @args(void, [Context, Pattern]) def __init__(self, context, pattern): TextView.__init__(self, context) text = "Date: " + str(pattern.date) + "\n" text += "Hoop: " + str(pattern.hoop_code) + "\n" text += "Rectangles:\n" for r in pattern.rectangles: text += "(" + str(r.x1) + "," + str(r.y1) + "), " text += "(" + str(r.x2) + "," + str(r.y2) + ")\n" text += "Colours: " for colour in pattern.colours: text += str(colour) + " " text += "\n" text += "Thread types: " for thread_type in pattern.thread_types: text += str(thread_type) + " " text += "\n" self.setText(text)
This adapter class exposes a list of JEF files to
ListView classes and other
View collections, providing information about the underlying data structure
and creating
View instances for display. In this case, the adapter creates
ImageView instances to show the bitmaps that represent the contents of
the JEF files.
The adapter obtains the bitmaps for each item in the list using instances of
the
PatternRenderer class which renders each bitmap in a background thread.
The adapter also maintains a cache of bitmaps that have already been created in
order to avoid redoing work, but limits the number of bitmaps in the cache to
avoid using too much memory.
class PatternViewAdapter(BaseAdapter): __fields__ = { "cache": Map(int, Bitmap), "positions": Queue(int), "size": int }
The
__init__ method accepts a
File that represents the directory
containing the JEF files and the application's
Resources object.
We obtain a
ColourInfo object using the application's resources and
define the default size of the bitmaps that will be produced. We obtain a
list of files to read before initialising the cache.
@args(void, [File, Resources]) def __init__(self, directory, resources): BaseAdapter.__init__(self) self.directory = directory self.colourInfo = ColourInfo(resources) self.size = 128 self.items = [] files = directory.listFiles() i = 0 while i < len(files): f = files[i] if f.isFile() and f.getName().endsWith(".jef"): self.items.add(f) i += 1 self.cache = {} self.positions = []
The following methods implement the standard adapter API. Only the
getCount method needs to return a valid value, returning the number of
items in the list.
@args(int, []) def getCount(self): return len(self.items) @args(Object, [int]) def getItem(self, position): return None @args(long, [int]) def getItemId(self, position): return long(0)
The final method returns a
View for display by any container that uses
this adapter, based on the position of the item in the list and the
parent
ViewGroup that represents the container. The
ImageView that is
returned is created using the application context provided by the parent.
@args(View, [int, View, ViewGroup]) def getView(self, position, convertView, parent): imageView = ImageView(parent.getContext())
If the position of the item is in the cache then we can reuse a
bitmap that has already been created. We set the bitmap in the
ImageView. If there are more than 20 items in the cache then we
discard the oldest one from the
positions queue.
if self.cache.containsKey(position): bitmap = self.cache[position] imageView.setImageBitmap(bitmap) if len(self.positions) > 20: self.cache.remove(self.positions.remove()) else: f = self.items[position] renderer = PatternRenderer(f, self.colourInfo, imageView, self.cache, self.positions) bitmap = renderer.emptyBitmap(self.size, self.size) bitmap.eraseColor(Color.argb(255, 32, 32, 32)) imageView.setImageBitmap(bitmap) # Create a list then convert it to an array. The initial list # creation causes the items to be wrapped in Integer objects. renderer.execute(array([self.size, self.size, position])) return imageView
If the position was not in the cache then we obtain the file to read
from the underlying list and pass it to a new
PatternRenderer instance
along with the other information it needs to perform its task.
We create an empty bitmap as a placeholder and set it in the
ImageView.
We start the renderer by calling its
execute method with the width and
height of the bitmap we want as well as the item position it will use to
update the cache. This call returns immediately because rendering occurs in
a background thread.
Since we either obtain an existing bitmap from the cache or a placeholder
that can be displayed while rendering occurs, we return an
ImageView
immediately. If the bitmap was a placeholder, the view will be updated as
the rendering is performed. | http://www.boddie.org.uk/david/Projects/Python/DUCK/Demos/Serpentine/JEFViewer/docs/pattern.html | CC-MAIN-2017-51 | refinedweb | 2,060 | 60.31 |
The System.Xml.XPath namespace contains the classes that define a cursor model for navigating and editing XML information items as instances of the XQuery 1.0 and XPath 2.0 Data Model.
Provides an accessor to the System.Xml.XPath.XPathNavigator class.
Specifies the sort order for uppercase and lowercase letters.
Specifies the data type used to determine sort order.
Specifies the sort order.
Provides a fast, read-only, in-memory representation of an XML document by using the XPath data model.
Provides the exception thrown when an error occurs while processing an XPath expression.
Provides a typed class that represents a compiled XPath expression.
Represents an item in the XQuery 1.0 and XPath 2.0 Data Model.
Defines the namespace scope.
Provides a cursor model for navigating and editing XML data.
Provides an iterator over a selected set of nodes.
Defines the XPath node types that can be returned from the System.Xml.XPath.XPathNavigator class.
Specifies the return type of the XPath expression. | http://docs.go-mono.com/monodoc.ashx?link=N%3ASystem.Xml.XPath | CC-MAIN-2018-05 | refinedweb | 167 | 54.39 |
19 January 2012 14:06 [Source: ICIS news]
HOUSTON (ICIS)--PPG Industries’ 2011 fourth-quarter net income rose 5.4% year on year to $216m (€168m) but volumes were flat because of global economic uncertainties, the US-based chemicals and coatings producer said on Thursday.
Customers curtailed inventory and remained cautious with their ordering, CEO Charles Bunch said.
This trend was most evident in ?xml:namespace>
PPG’s fourth-quarter sales rose 4% year on year to $3.5bn.
For the full 12 months of 2011, PPG’s net income was $1.1bn, compared with $769m in 2010, as sales rose 11% to $14.9m.
“During the year, we experienced uneven economic conditions, persistent raw material inflation, and continued anaemic construction activity in developed regions,” Bunch said.
“However, the geographic and end-use market diversity of our business portfolio continued to be an important benefit in 2011,” he added.
Looking ahead, Bunch expects 2012 first-quarter growth to remain uneven by region and varied by industry, similar to the fourth quarter of 2011, he said.
Regionally,
However, in the
($1 = €0.78) | http://www.icis.com/Articles/2012/01/19/9525400/us-ppgs-q4-net-income-rises-5.4-to-216m-amid-flat-volumes.html | CC-MAIN-2014-41 | refinedweb | 182 | 56.05 |
I'm writing a simulation in C++ and decided to delegate the initialization of some arrays to Python by embedding it into my application and use some Python functions for the generation of the initial data.
Since my 2D/3D arrays are allocated and managed by the C++ part, I need to pass them to Python. The best way is probably the buffer protocol. I could write a Python class in C++, which implements the buffer protocol and creates a buffer object to the storage I have in C++.
Now, I would like to avoid over-engineering this procedure. In facts, I just need to pass a pointer, a tuple of sizes and strides to a Python function.
The question is thus: What is the simplest way to pass this information to a Python routine which can then use it, possibly with Numpy, to initialize the pointed storage?
Just to give an example of what I need to do, the Python function I want to call from C++ is:
def init_field(field, X, Y):
field[:, :] = np.sqrt(X) + np.tanh(Y)
X
Y
field
field
Something not too hard is to use
PyArray_SimpleNewFromData. Using that might lead to code like:
void use_array(float* ptr, int width, int height) { PyObject *pFunc = pyFunction("python_function_name"); if (pFunc == 0) return; PyObject *pArgs = PyTuple_New(1); npy_intp dims[2]; dims[1] = width; dims[0] = height; PyTuple_SetItem(pArgs, 0, PyArray_SimpleNewFromData(2, dims, NPY_FLOAT, ptr)); PyObject *pValue = PyObject_CallObject(pFunc, pArgs); Py_DECREF(pArgs); if (pValue != NULL) { Py_DECREF(pValue); } else { PyErr_Print(); fprintf(stderr,"Call failed\n"); return; } Py_DECREF(pFunc); }
When setting up the embedded Python environment you should call
import_array() as described in | https://codedump.io/share/jtHpzqctGChr/1/simplest-way-to-share-an-array-when-embedding-python | CC-MAIN-2020-40 | refinedweb | 273 | 56.89 |
I'm considering JSF framework for my presentation layer and I have a serious doubt.
Remember how in struts we create our form with a property typed for example Person:
public class PersonForm extends ActionForm {
private Person thePerson;
//getter and setter....
}
And then in the JSP we write this kind of references:
<bean:write
How do we do this in JSF?
We wrote something similar in our backin bean but we didn't get any result.
Our team has been banging their head against the wall for a couple of days with no advance or any clue to continue.
Thank you all for your help.
JSF access to beans (1 messages)
- Posted by: Nicolas Dobler
- Posted on: August 20 2004 16:31 EDT
Threaded Messages (1)
JSF EL[ Go to top ]
You can use the JSF Expression Language Markup for this:
- Posted by: Tom Cole
- Posted on: August 26 2004 13:23 EDT
- in response to Nicolas Dobler
value="#{thePerson.name}"
What you're doing here is mapping the value of the component to the corresponding value in the backing bean. This example above will look for a managed-bean named "thePerson" and will call the getName() method of that bean and make it the value for this component.
HTH. | http://www.theserverside.com/discussions/thread.tss?thread_id=28223 | CC-MAIN-2016-30 | refinedweb | 210 | 65.76 |
You choose between a robot arm or a two-wheeled rover, then pair it up with a development board for a microcontroller that is new to you.
The challenge is to connect the bot to the board and then write the firmware to accomplish a simple task. For the robot arm you'll need to pick up a small object and place it in a box. The rover uses an ultrasonic distance senor as its only input. Will you be able to navigate the maze using this crude level of sensing?
Before you arrive:
Both of these robots use servo motors. To succeed at these workshops you will need to use properly timed PWM signals to drive them.
Make sure you hit the ground running on the day of the workshop. Before you arrive do as much research as you can about the boards listed below. Look for servo libraries or research implementing the servo timing yourself. At the very least, set up the toolchains on your computer so that you'll be ready to start coding as soon as you sit down.
If you do not have a workshop ticket:
It's okay, you can still come and have a fun time in several ways. First off, head over to the Hackaday Munich page and get an "All Day" ticket. Now here are your options:
- Bring your laptop computer with you
- We will have more development boards than there are robot bodies. Grab one and decide your own programming challenge. It would help to bring along your breadboard, jumper wires, and some LEDs (or other hardware to play around with). The GPIO levels for most of these boards is 3.3v
- If you already have a wheeled robot or robot arm bring it along! You can write new code for the controller you already have, or connect one of these devboards
For those that already have Robot Workshop tickets:
Get those embedded programming chops ready, this is going to be a ton of fun! Pull out the laptop you plan to bring with you to the workshop and load up the toolchain you would like to use. This will save you a ton of time the day-of the event. Here are details on the development boards we have lined up so far:
Texas Instruments Tiva C Launchpad
TI has committed 20 of their Tiva C Launchpad boards which features the TM4C123GH6PM which is a 32-bit ARM Cortex-M4 running up to 80MHz with 256 KB of flash and 32KB of SRAM. This chip includes hardware-PWM generators which will come in handy for these challenges.
Resources:
- Product page:
- Development tools:
- Code Composer Studio is available for free (code-limited):
- Development using a Linux machine is possible.
- You will need to install an arm-none-eabi-xxx toolschain.
- We asked on Twitter about this and the pre-compiled toolchain maintained by Pebble (the smartwatch company) was suggested:
- It has been suggested the the arm-none-eabi-gcc package in the Ubuntu 14.04 repos is not up to day. You may consider trying this PPA:
- Install OpenOCD (to flash the binary to the board)
- A template for compiling your code is found here:
- Don't forget the TivaWare Package which includes header files and peripheral libraries:
TI has also committed 20 SimpleLink WiFi Boosterpacks and 20 Sensor Hub BoosterPacks.
Atmel SAM D20 Xplained Pro Evaluation Kit
Atmel has committed 20 of their SAM D20 Xplained Pro evaluation kits. These feature a ATSAMD20J18 which is an ARM Cortex-M0+ running up to 48 Mhz with 256 KB of Flash and 32 KB of SRAM.
Resources:
- Product page:
- Development Tools:
- Atmel Studio:
- Development using a Linux machine is possible:
- Guide:
- I used this PPA for the toolchain:
- There are some typos (remove the '4' in the OpenOCD config file name, etc.)
- I had to explicitly enable cmsis-dap when configuring OpenOCD: ./configure --enable-maintainer-mode --enable-cmsis-dap --enable-hidapi-libusb
- If you get an error finding the libhidapi-redraw.so.0 see here:
Examples:
- Atmel's API for PWM:
Freescale FRDM-KL25Z Freedom Board
Freescale is sending their FRDM-KL25Z Freedom Board to the Hackaday Munch Embedded Hardware Workshop. This board features the MKL25Z128VLK4 which is an ARM Cortex-M0+ chip that runs at up to 48MHz with 128KB Flash and 16KB SRAM.
Resources:
- Product Page:
- Development Tools:
- Evaluation versions of IDE include CodeWarrior and Keil:
- You can use the mBed environment:
- Requires a simple firmware upgrade:
- Linux Bare Metal template:
- We haven't tested this yet
- It has been suggested the the arm-none-eabi-gcc package in the Ubuntu 14.04 repos is not up to day. You may consider trying this PPA:
- Mega-resource for GNU ARM tools for these Kinetis boards:
Examples:
- mbed PWM api:
Microchip TCHIP010 Fubarino SD Board
Microchip has offered up 20 of their Fubarino SD Boards. These Open Hardware boards host a PIC32MX795F512H chip which runs at up to 80 MHz, boasts 512KB of Flash and 128KB of RAM.
Resources:
- Product page:
- Fubarino website:
- Program using MPIDE (a fork of the Arduino IDE):
Hobby Servos and Ultrasonic Sensors
The Challenge in this workshop isn't merely to get a toolchain for an unfamiliar chip architecture working. We actually need to so something with the hardware. Blinking LEDs is always a good proof that everything is working, but we want to go further. Let's drive some robots using servo motors. If you're awesome at that you can also try your hand at reading from an ultrasonic distance sensor.
Controlling Servo Motors
Servo motors are a great step beyond driving an LED because they require precise timing. Here's the workflow I would recommend for developing a servo motor driver:
- Blink an LED
- This shows that you know how to control the GPIO pins. If you blink at 1 second intervals it is also a simple check to let you know that you are (probably) correctly calculating a delay based on the system clock
- Dim an LED using PWM
- Whether you're using hardware or software based PWM, dimming an LED gives you simple visual feedback that you've got it working
- Figure out your servo timings
- Now alter your LED dimming code to use a period of 20ms with a pulse width of 1ms and 2ms. I like to use a delay function to change the duty cycle between the two values. If you look closely you should still be able to see a change in the brightness of the LED
- Testing and troubleshooting
- Connect it to one of the servo motors
- Make sure you are using an in-line resistor to protect the logic circuitry inside the servo in case you've connected it incorrectly
- If the servo isn't moving, don't leave it plugged in. Instead, head on over to the oscilloscope and measure your signal to get feedback on the timing problem
Reading an Ultrasonic Distance Sensor
US-100 Datasheet (kind of)
There is a quick tutorial on reading this sensor using an Arduino and the NewPing library:
The New Ping library itself shows just how easy it is to read from this sensor. You can read the sensor using as UART if the jumper on the back side is in place. But it is very easy to read it without the jumper in place by measuring the pulse-width. You pull the trigger pin high-then-low to signal the start of a reading, then measure the echo pin. Start counting system cycles when that pin goes high, stop counting when it goes low, and use the difference to calculate distance.
Here is the code from the NewPing library that performs the measurement I just described:
// --------------------------------------------------------------------------- // Standard ping methods // --------------------------------------------------------------------------- unsigned int NewPing::ping() { // Trigger a ping, if it returns false, return NO_ECHO to the calling function. if (!ping_trigger()) return NO_ECHO; // Wait for the ping echo. while (*_echoInput & _echoBit) // Stop the loop and return NO_ECHO (false) if we're beyond the set maximum distance. if (micros() > _max_time) return NO_ECHO; // Calculate ping time, 5uS of overhead. return (micros() - (_max_time - _maxEchoTime) - 5); }
// --------------------------------------------------------------------------- // Standard ping method support functions (not called directly) // --------------------------------------------------------------------------- boolean NewPing::ping_trigger() { #if DISABLE_ONE_PIN != true // Set trigger pin to output. *_triggerMode |= _triggerBit; #endif // Set the trigger pin low, should already be low, but this will make sure it is. *_triggerOutput &= ~_triggerBit; // Wait for pin to go low, testing shows it needs 4uS to work every time. delayMicroseconds(4); // Set trigger pin high, this tells the sensor to send out a ping. *_triggerOutput |= _triggerBit; // Wait long enough for the sensor to realize the trigger pin is high. Sensor specs say to wait 10uS. delayMicroseconds(10); // Set trigger pin back to low. *_triggerOutput &= ~_triggerBit; #if DISABLE_ONE_PIN != true // Set trigger pin to input (when using one Arduino pin this is technically setting the echo pin to input as both are tied to the same Arduino pin). *_triggerMode &= ~_triggerBit; #endif // Set a timeout for the ping to trigger. _max_time = micros() + MAX_SENSOR_DELAY; // Wait for echo pin to clear. while (*_echoInput & _echoBit && micros() <= _max_time) {} // Wait for ping to start. while (!(*_echoInput & _echoBit)) // Something went wrong, abort. if (micros() > _max_time) return false; _max_time = micros() + _maxEchoTime; // Ping started, set the timeout. return true; // Ping started successfully. }
Discussions
Become a Hackaday.io Member
Create an account to leave a comment. Already have an account? Log In.
Are you sure? yes | no
1. Is it compatible?
2. IDE : Energia, embedXcode or other?
thanks!
Are you sure? yes | no
Are you sure? yes | no | https://hackaday.io/event/3178-hackaday-munich/log/10740-workshop-details-roboto | CC-MAIN-2021-10 | refinedweb | 1,586 | 69.72 |
Details
- Type:
Bug
- Status: Open
- Priority:
Major
- Resolution: Unresolved
- Affects Version/s: 2.0.2
-
- Component/s: Javascript
-
Description
The primary use case that this bug precludes is one in which the container.js script (and subsequently rpc.js) are loaded in a separate frame than the main content page, i.e., the page that contains the gadget iframes.
Imagine a main page consisting of a frameset with two frames: ContentFrame and ScriptFrame. ScriptFrame loads the container JavaScript. It includes the script tag whose src equals "http://<myserver>/gadgets/js/container:rpc.js". ContentFrame references the global namespaces in ScriptFrame (gadgets and osapi) to instantiate an osapi.container.Container object. The page then creates a GadgetSite giving it a div that exists within ContentFrame. Then navigateGadget is called on the container.
The use case above will break outright because rpc.js makes the assumption that the ScriptFrame and ContentFrame are one and the same. For instance, in rpc.js, setupChildIframe() uses document.getElementById() which fails because that script is being executed in a ScriptFrame instead of ContentFrame where the iframe resides.
One solution would be to enable the rpc.js to load in a separate frame by introducing a "context" object that can be set. This would be similar to what dojo.setContext accomplishes. However, this solution would still require some prototyping to see if it's feasible.
Activity
- All
- Work Log
- History
- Activity
- Transitions | https://issues.apache.org/jira/browse/SHINDIG-1553?page=com.atlassian.jira.plugin.system.issuetabpanels:changehistory-tabpanel | CC-MAIN-2015-22 | refinedweb | 235 | 52.66 |
test.
We've got a base project going for us, which is nice. But let's add some proper unit tests as well as some code formatters! Note; you can find the live repository for this project here.
Notes
There's an opportunity to add a method to our class that will make our testing code just a bit nicer to work with.
class Clumper(): def __init__(self, blob): self.blob = blob def __len__(self): return len(self.blob) ...
This will allow us to refactor this test:
def test_headtail_size(): data = [{'i': i} for i in range(10)] c = Clumper(data) assert len(c.head(10).collect()) == 10 assert len(c.tail(10).collect()) == 10 assert len(c.head(5).collect()) == 5 assert len(c.tail(5).collect()) == 5
Into this test:
def test_headtail_size(): data = [{'i': i} for i in range(10)] c = Clumper(data) assert len(c.head(10)) == 10 assert len(c.tail(10)) == 10 assert len(c.head(5)) == 5 assert len(c.tail(5)) == 5
This is a whole lot better. But we're not done yet!
Feedback? See an issue? Something unclear? Feel free to mention it here.
If you want to be kept up to date, consider getting the newsletter. | https://calmcode.io/test/refactor.html | CC-MAIN-2020-40 | refinedweb | 205 | 79.67 |
Supported Tags
4.5.0-43,
latest
5.0.0-17-preview
4.4.2-46
Note: version 5.0 preview is the next upcoming version that is under test.
Quick Reference
Supported Docker Versions:
Docker version 17 or greater
Getting Started and Documentation
- Working with Redis Enterprise Pack and Docker
- Getting Started with Redis Enterprise Pack and Docker on Windows,
- Getting Started with Redis Enterprise Pack and Docker on Mac OSx,
- Getting Started with Redis Enterprise Pack and Docker on Linux
- Setting up a Redis Enterprise Pack Cluster
- Documentation
- How To Guides
What is Redis Enterprise Pack (RP)?
Redis Enterprise Pack is enterprise grade, highly available, scalable, distributed, in-memory NoSQL database server, fully compatible with open source Redis by Redis Labs.
Note: Open source Redis applications transparently work against Redis Enterprise Pack. Simply change your connections to point at Redis Enterprise Pack database endpoint...
Redis Enterprise Pack extends open source Redis and delivers stable high performance, zero-downtime linear scaling and high availability, with significant operational savings.
Redis Enterprise Pack also augments Redis databases with the capability to use a combination of RAM and cost-effective Flash memory (a.k.a Redis Enterprise Flash), retaining the same sub-millisecond latencies of Redis while storing larger datasets at drastically lower costs.
Quick Start with Redis Enterprise Pack Container
Note: This is a preview image for Redis Enterprise Pack version 4.4. The image is not intended for production use and only suitable for development for test purposes
Note: With the preview image, It is important to note that RP Docker image works best when you provde a minimum of 2 cores and 6GB ram per container. You can find additional minimum hardware and software requirements for Redis Enterprise Pack in the product documentation
You can run the Redis Enterprise Pack container linux based container in MacOS, various Linux and Windows based machines with Docker. Each Redis Enterprise Pack container runs a cluster node. To get started, you can simply set up a one node cluster, create a database and connect your application to the database.
- Step-1: Start Redis Enterprise Pack container
docker run -d --cap-add sys_resource --name rp -p 8443:8443 -p 12000:12000 redislabs/redis
- Step-2: Setup Redis Enterprise Pack by visiting the host machine to see the RP Web Console.
Note: You may see a certificate error depending on your browser. Simply choose "continue to the website" to get to the setup screen.
- Step-3: Go with default settings and provide only a cluster FQDN: "cluster.local"
- Step-4: Click "Next" to skip the license key screen if you don't have a license key to try the free version of the product. On the next screen, set up a cluster admin email and password.
- Step-5: Choose the new redis db option. In the new redis db screen, click the "show advanced option" link and provide a database name "database1", endpoint port number of "12000" and click "Activate" to create your database.
You now have a Redis database!
Connecting to the Redis Database
With the Redis database created, you are ready to connect to your database to store data.
- Connect using redis-cli: Read and Write Data using
redis-cli
redis-cli is a simple commandline tool to interact with a Redis instance. Use the following script to connect to the Redis Enterprise Pack container, run redis-cli connecting to port 12000 and store and retrieve a key.
docker exec -it rp bash # sudo /opt/redislabs/bin/redis-cli -p 12000 # 127.0.0.1:16653> set key1 123 # OK # 127.0.0.1:16653> get key1 # "123"
- Connect using a Simple Python App: Read and Write Data using a few lines of Python code
A simple Python app running in the host machine can also connect to the database1 created Redis Enterprise Pack container. The following section assumes you already have Python and redis-py (Python library for connecting to Redis) configured on the host machine running the container. You can find the instructions to configure redis-py on the github page for redis-py
Paste the following into a file named
"redis_test.py"
import redis r = redis.StrictRedis(host='localhost', port=12000, db=0) print ("set key1 123") print (r.set('key1', '123')) print ("get key1") print(r.get('key1'))
Run
redis_test.py application to connect to the database and store and retrieve a key.
python.exe redis_test.py
The output should look like the following screen if the connection is successful.
# set key1 123 # True # get key1 # b'123'
Common Topologies with Redis Pack with Docker Containers
Redis Enterprise Pack (RP) can be deployed using this container on Windows, macOS and Linux based systems. RP container represents a node in an RP Cluster. When deploying RP using Docker, there are a couple of common topologies.
Topology#1: The simplest topology is to run single node RP Cluster with a single container in a single host machine. This is best for local development or functional testing. This topology is depicted under Topology#1 below. Simply follow the instruction in the getting started pages for Windows and macOS and Linux pages.
Topology#2: You may also run multi-node RP cluster with multiple rp containers all deployed to a single host machine. This topology is similar to the previous setup except you run a multi node cluster to developer and test against a system that scale-minimized but similar to your production RP deployment. It is important to note that the topology, under load causes the containers to interfere with each other, thus is not recommended if you are looking for predictable performance.
Topology#3: You may also run multi-node RP cluster with multiple RP containers each deployed to its own host machine. This topology minimizes interference between RP containers so performs more predictably compared to topology#2. This topology is depicted under Topology#3 below.
Known Issues
- Possible error when creating a database: "Cannot allocate nodes for shards" - With the preview image, if you don't configure the memory limit high enough, you may see an error when creating a database that reads : "Cannot allocate nodes for shards". It is important to note that RP Docker image works best when you provide a minimum of 2 cores and 6GB ram per container. You can work around the issue by increasing the RAM allocated to the container either through Docker preferences on your machine or by specifying the -m option with docker run command. You can find additional minimum hardware and software requirements for Redis Enterprise Pack in the product documentation
Azelada, you could try using kubernetes for creating a cluster. checkout this repo . However there is one issue with it, if the first pod get re-scheduled it will go ahead and create a new cluster rather than join the existing cluster.
Hi arunmat, I have the same issue, I was trying to solve this with attach container to swarm but I cant to join thw new node to the cluster.
Hi, I' trying to setup topology #3 using docker swarm. I have hit a blocker as 'cap_add sys_resource' is required while running the container which is not available in swarm service yet. any workaround for this? | https://hub.docker.com/r/redislabs/redis/ | CC-MAIN-2017-39 | refinedweb | 1,207 | 52.9 |
stat(2) stat(2)
stat, lstat, fstat - get file status
#include <sys/types.h>
#include <sys/stat.h>
int stat(const char *path<b>, struct stat *buf<b>);
int lstat(const char *path<b>, struct stat *buf<b>);
int fstat(int fildes<b>, struct stat *buf<b>);
The only difference between the *stat and the *stat64 calls is that the
*stat64 calls return a stat64 structure, with three fields increased in
size to allow for larger files and filesystems: st_ino, st_size, and
st_blocks are all 64-bit values.
NOTE: All programs compiled either -n32 or -64 get the stat64 versions
of the stat system call, even when calling stat. Only programs compiled
-o32 get the version with the smaller field sizes, for binary
compatibility.
path points to a path name naming a file. Read, write, or execute
permission of the named file is not required, but all directories listed
in the path name leading to the file must be searchable. stat obtains
information about the named file.
lstat obtains file attributes similar to stat, except when the named file
is a symbolic link; in that case lstat returns information about the
link, while stat returns information about the file the link references.
fstat obtains information about an open file known by the file descriptor
fildes, obtained from a successful creat, open, dup, fcntl, pipe, or
ioctl system call.
buf is a pointer to a stat structure into which information is placed
concerning the file.
The contents of the structure pointed to by buf include the following
mode_t st_mode; /* File mode */
ino_t st_ino; /* Inode number */
dev_t st_dev; /* ID of device containing */
/* a directory entry for this file */
dev_t st_rdev; /* ID of device */
/* This entry is defined only for */
/* char special, block special, */
/* and lofs files */
nlink_t st_nlink; /* Number of links */
Page 1
stat(2) stat(2)
uid_t st_uid; /* User ID of the file's owner */
gid_t st_gid; /* Group ID of the file's group */
off_t st_size; /* File size in bytes */
timespec_t st_atim; /* Time of last access */
timespec_t st_mtim; /* Time of last data modification */
timespec_t st_ctim; /* Time of last file status change */
/* Times measured in seconds and nanoseconds */
/* since 00:00:00 UTC, Jan. 1, 1970 */
long st_blksize; /* Preferred I/O block size */
blkcnt_t st_blocks; /* Number 512 byte blocks allocated */
The fields have the following meanings: may
only be returned by lstat.) The various macros in sys/stat.h
should be used to determine if there is a type match, since the
types are not a bit field. For example, you should use
S_ISDIR(st.st_mode) rather than (st.st_mode&S_IFDIR).
st_ino Except for lofs file systems this field uniquely identifies the
file in a given file system and the pair st_ino and st_dev
uniquely identify regular files and directories. For regular
files and directories accessed via an "lofs" file system, the
value of this field is obtained from the underlying file
system, and the st_rdev field must also be used to identify
uniqueness.
st_dev Except for lofs file systems this field uniquely identifies the
file system that contains the file. Beware that this is still
true for NFS file systems exported using the -nohide option,
which may not appear in /etc/mtab. [See exports(4).] Its value
may be used as input to the ustat system call to determine more
information about this file system. No other meaning is
associated with this value. For regular files and directories
accessed via an "lofs" file system, the value of this field is
obtained from the underlying file system, and the st_rdev field
must also be used to identify uniqueness.
st_rdev This field should be used only by administrative commands. It
is valid only for block special, character special, and files
and directories accessed via "lofs" file systems. It only has
meaning on the system where the file was configured.
st_nlink This field should be used only by administrative commands.
st_uid The user ID of the file's owner.
st_gid The group ID of the file's group.
Page 2
stat(2) stat(2)
st_size For regular files, this is the address of the end of the file.
If the file's size is larger than will fit in the st_size field
(2^31 - 1) then the value (2^31 - 1) is returned there instead.
See also stat64(2). For block special or character special,
this is not defined. See also pipe(2).
st_atim Time when file data was last accessed. Changed by the
following system calls: creat, mknod, pipe, utime, and read.
The seconds portion of st_atim is available as st_atime.
st_mtim Time when data was last modified. Changed by the following
system calls: creat, mknod, pipe, utime, and write. The
seconds portion of st_mtim is available as st_mtime.
st_ctim Time when file status was last changed. Changed by the
following system calls: chmod, chown, creat, link, mknod,
pipe, unlink, utime, and write. The seconds portion of st_ctim
is available as st_ctime.
st_blksize
A hint as to the ``best'' unit size for I/O operations. If the
underlying volume is a stripe volume, then st_blksize is set to
the stripe width. This field is not defined for block-special
or character-special files.
st_blocks The total number of physical blocks of size 512 bytes actually
allocated on disk. This field is not defined for block-special
or character-special files. Holes in files (blocks never
allocated) are not counted in this value; indirect blocks
(those used to store pointers to blocks in the file) are
counted.
stat and lstat fail if one or more of the following are true:
EACCES Search permission is denied for a component of the path prefix.
EFAULT buf or path points to an invalid address.
EINTR A signal was caught during the stat or lstat system call.
ETIMEDOUT The named file is located on a remote file system which is not
available [see intro(2)]. component exceeds {NAME_MAX} while
_POSIX_NO_TRUNC is in effect.
Page 3
stat(2) stat(2)
ENOENT The named file does not exist or is the null pathname.
ENOTDIR A component of the path prefix is not a directory.
ENOLINK path points to a remote machine and the link to that machine is
no longer active.
EOVERFLOW A component is too large to store in the structure pointed to
by buf.
fstat fails if one or more of the following are true:
EBADF fildes is not a valid open file descriptor.
EFAULT buf points to an invalid address.
EINTR A signal was caught during the fstat system call.
ETIMEDOUT fildes refers to a file on a remote file system which is not
available [see intro(2)].
ENOLINK fildes refers to a file on a remote machine and the link to
that machine is no longer active.
EOVERFLOW A component is too large to store in the structure pointed to
by buf.
chmod(2), chown(2), creat(2), exports(4), fattach(3C), link(2), mknod(2),
pipe(2), read(2), stat64(2), realpath(3C), stat(5), stat64(5), time(2),
unlink(2), utime(2), write(2)
Upon successful completion a value of 0 is returned. Otherwise, a value
of -1 is returned and errno is set to indicate the error.
PPPPaaaaggggeeee 4444 | https://nixdoc.net/man-pages/IRIX/man2/stat.2.html | CC-MAIN-2022-21 | refinedweb | 1,196 | 71.24 |
sem_getvalue — get the value of a semaphore
#include <semaphore.h>
sem_getvalue() places the
current value of the semaphore pointed to
sem into the integer pointed to
by
sval.
If one or more processes or threads are blocked waiting to
lock the semaphore with sem_wait(3), POSIX.1
permits two possibilities for the value returned in
sval: either 0 is
returned; or a negative number whose absolute value is the
count of the number of processes and threads currently
blocked in sem_wait(3). Linux adopts
the former behavior.
sem_getvalue() returns 0 on
success; on error, −1 is returned and
errno is set to indicate the error.
For an explanation of the terms used in this section, see attributes(7).
sem_post(3), sem_wait(3), sem_overview(7) | https://manpages.net/htmlman3/sem_getvalue.3.html | CC-MAIN-2022-21 | refinedweb | 124 | 65.22 |
hex 0.1.2
dart-hex #
Easy hexadecimal encoding and decoding using the dart:convert API.
Usage #
A simple usage example:
import "package:hex/hex.dart"; void main() { HEX.encode(const [1, 2, 3]); // "010203" HEX.decode("010203"); // [1, 2, 3] }
Changelog #
0.1.2 (2018-08-13) #
- use
constconstructor for decoder
- support Dart v2
- change license to MIT
0.1.1 (2017-01-27) #
- throws
FormatExceptionon invalid input
0.1.0 (2017-01-27) #
- initial version
Use this package as a library
1. Depend on it
Add this to your package's pubspec.yaml file:
dependencies: hex: :hex/hex.dart';
We analyzed this package on Jan 17, 2020, and provided a score, details, and suggestions below. Analysis was completed with status completed using:
- Dart: 2.7.0
- pana: 0.13.4
Health suggestions
Fix
lib/hex.dart. (-3.45 points)
Analysis of
lib/hex.dart reported 7 hints, including:
line 9 col 13: Avoid const keyword.
line 31 col 21: Don't type annotate initializing formals.
line 31 col 40: Use
= to separate a named parameter from its default value.
line 35 col 27: Unnecessary new keyword.
line 38 col 15: Unnecessary new keyword.
Maintenance suggestions
Package is getting outdated. (-42.74 points)
The package was last published 74 weeks ago.
Maintain an example. (-10 points)
Create a short demo in the
example/ directory to show how to use this package.
Common filename patterns include
main.dart,
example.dart, and
hex. | https://pub.dev/packages/hex | CC-MAIN-2020-05 | refinedweb | 242 | 63.56 |
Python module allowing to easily calculate and plot the learning curve of a machine learning model and find the maximum expected accuracy
Project description
learning-curves
Learning-curves is Python module that extends sklearn's learning curve feature. It will help you visualizing the learning curve of your models.
Learning curves give an opportunity to diagnose bias and variance in supervised learning models, but also to visualize how training set size influence the performance of the models (more informations here).
Such plots help you answer the following questions:
- Do I have enough data?
- What would be the best accuracy I would have if I had more data?
- Can I train my model with less data?
- Is my training set biased?
Learning-curves will also help you fitting the learning curve to extrapolate and find the saturation value of the curve.
Installation
$ pip install learning-curves
To create learning curve plots, first import the module with
import learning_curves.
Usage
It is as simple as:
lc = LearningCurve() lc.get_lc(estimator, X, Y)
Where
estimator implements
fit(X,Y) and
predict(X,Y).
Output:
On this example the green curve suggests that adding more data to the training set is likely to improve a bit the model accuracy. The green curve also shows a saturation near 0.96. We can easily fit a function to this curve:
lc.plot(predictor="best")
Output:
Here we used a predefined function,
pow, to fit the green curve. The R2 score is very close to 1, meaning that the fit is optimal. We can therefore use this curve to extrapolate the evolution of the accuracy with the training set size.
This also tells us how many data we should use to train our model to maximize performances and accuracy.
Add custom functions to fit the learning curve
Such function are called
Predictor. You can create a
Predictor like this:
predictor = Predictor("myPredictor", lambda x,a,b : a*x + b, [1,0])
Here we created a Predictor called "myPredictor" with the function
y(x) = a*x + b.
Because internally SciPy
optimize.curve_fit is called, a first guess of the parameters
a and
b are required. Here we gave them respective value 1 and 0.
You can then add the
Predictor to the
LearningCurve object in two different ways:
- Pass the
Predictorto the
LearningCurveconstructor:
lc = LearningCurve([predictor])
- Register the
Predictorinside the predictors of the
LearningCurveobject:
lc.predictors.append(predictor)
By default, 4
Predictors are instantiated:
self.predictors = [ Predictor("pow", lambda x, a, b, c, d : a - (b*x+d)**c, [1, 1.7, -.5, 1e-3]), Predictor("pow_log", lambda x, a, b, c, m, n : a - b*x**c + m*np.log(x**n), [1, 1.7, -.5, 1e-3, 1e-3], True), Predictor("pow_log_2", lambda x, a, b, c : a / (1 + (x/np.exp(b))**c), [1, 1.7, -.5]), Predictor("inv_log", lambda x, a, b : a - b/np.log(x), [1, 1.6]) ]
Some predictors perform better (R2 score is closer to 1) than others, depending on the dataset, the model and the value to be preditected.
Find the best Predictor
To find the Predictor that will fit best your learning curve, we can call
get_predictor function:
lc.get_predictor("best")
Output:
(pow [params:[ 0.9588563 11.74747659 -0.36232639 -236.46115903]][score:0.9997458683912492])
Plot the Predictors
You can plot any
Predictors fitted function with the
plot function:
lc.plot(predictor="all")
Output:
Save and load LearningCurve instances
Because
Predictor contains lambda functions, you can not simply save a
LearningCurve instance. One possibility is to only save the data points of the curve inside
lc.recorder["data"] and retrieve then later on. But then the custom predictors are not saved. Therefore it is recommended to use the
save and
load methods:
lc.save("path/to/save.pkl") lc = LearningCurve.load("path/to/save.pkl")
This internally uses the
dill library to save the
LearningCurve instance with all the
Predictors.
Find the best training set size
learning-curves will help you finding the best training set size by extrapolation of the best fitted curve:
lc.plot(predictor="all", saturation="best")
Output:
The horizontal red line shows the saturation of the curve. The intersection of the two blue lines shows the best accuracy we can get, given a certain
threshold (see below).
To retrieve the value of the best training set size:
lc.threshold(predictor="best", saturation="best")
Output:
(0.9589, 31668, 0.9493)
This tells us that the saturation value (the maximum accuracy we can get from this model without changing any other parameter) is
0.9589. This value corresponds to an infinite number of samples in our training set! But with a threshold of
0.99 (this parameter can be changed with
threshold=x), we can have an accuracy
0.9493 if our training set contains
31668 samples.
Note: The saturation value is always the second parameter of the function. Therefore, if you create your own
Predictor, place the saturation factor in second position (called a in the predefined
Predictors). If the function of your custom
Predictor is diverging, then no saturation value can be retrieven. In that case, pass
diverging=True to the constructor of the
Predictor. The saturation value will then be calculated considering the
max_scaling parameter of the
threshold_cust function (see documentation for details). You should set this parameter to the maximum number of sample you can add to your training set.
Documentation
Some functions have their
function_name_cust equivalent. Calling the function without the
_cust suffix will internally call the function with the
_cust suffix with default parameters (such as the data points of the learning curves). Thanks to
kwargs, you can pass exactly the same parameters to both functions.
Project details
Release history Release notifications
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages. | https://pypi.org/project/learning-curves/ | CC-MAIN-2020-16 | refinedweb | 973 | 57.77 |
Not exactly what you ask, but I have added some text/description in this way:
If your entire manual/description is too large, you could just add a link this way. It will be more visible than a menu item on the help menu...
I've actually considered this byself, my solution was to follow which allows you to add an extra edit view for documentation. Then when that view renders it shows the docuemntation for whatever block/page/media type you are on.
I ran into a simular issue since we have over 150 web authors, so we needed a centeralized place to put the help.
I don't know if this will help you, but what I did was create a help sub-section within Epi and set the permissions to where only web editors can access it, and only when they are logged into Episerver.
I then added a link to the top nav so it has the highest amout of visabilty.
This gives the admins the abilty to adjust the Episerver help page within Epi and things can be up to date. We also use the help section to make announcments of new features and host our user group videos.
Adding this link was really simple as well, though there are better ways to get the link than hard code it, but this is for internal use (you just need to make sure the permissions are set up correctly)
[MenuProvider] public class CmsMenuProvider : IMenuProvider { public IEnumerable<MenuItem> GetMenuItems() { var menuItems = new List<MenuItem>(); menuItems.Add(new UrlMenuItem("EPiServer Help", MenuPaths.Global + "/cms" + "/cmsMenuItem", UriSupport.ResolveUrlFromUIAsRelativeOrAbsolute("/help/")) { SortIndex = SortIndex.Last, IsAvailable = (request) => PrincipalInfo.HasEditorAccess }); return menuItems; }
After some searching i couldn't find the answer but what I would like to do is the following.
Some of our custom blocks/pages do have some need of explenation in a more general sense (not on field level but more on a integration total overview level). We've created manuals and this describes them in depth. I would like to add those guides to the help menu so my cms-users can look them up very easilly.
If there's no preset functionality I'm thinking of developing a custom menu item for it. But first I like to know your thoughts | https://world.episerver.com/forum/developer-forum/-Episerver-75-CMS/Thread-Container/2020/4/custom-help-pages-in-episerver/ | CC-MAIN-2021-17 | refinedweb | 383 | 61.67 |
I have written this code to variably test Prim's algorithm and I am timing it using clock(). For some reason it always returns 0 as its running time. I have other code that I have used this exact implementation in and they are returning the currect running times. The code is very short and if anyone has any idea of why this is happening please let me know. I only have 4 more hours left on this project. Thanks in advance!
#include <iostream> #include <stdio.h> #include <ctime> #include <cstdlib> using namespace std; int main(){ int a,b,u,v,n,i,j,ne; ne = 1; int visited[1000] = {0},min,mincost=0,cost[1000][1000]; cout << "Enter the number of nodes:" << endl; cin >> n; for(int i=1; i<n; i++) for(int j=1; j<=n; j++) { cost[i][j] = (rand()%1000)+1; } visited[1]=1; cout << endl; clock_t t; float running_time; while(ne<n) { for(i=1,min=1000;i<=n;i++) for(j=1;j<=n;j++) if(cost[i][j]<min) if(visited[i]!=0) { min=cost[i][j]; a=u=i; b=v=j; } if(visited[u]==0 || visited[v]==0) { cout << "Edge: " << ne++ << endl; cout << a << " " << b << endl; cout << "Cost: " << min << endl; mincost+=min; visited[b]=1; } cost[a][b]=cost[b][a]=1000; } cout << "Min cost: " << mincost << endl; t = clock(); t = clock() - t; running_time = ((float)t/CLOCKS_PER_SEC); cout << "The running time of this algorithm is: " << running_time << " seconds" << endl; return 0; } | https://www.daniweb.com/programming/software-development/threads/468321/clock-function-always-returns-0 | CC-MAIN-2017-09 | refinedweb | 249 | 68.4 |
It looks like you're new here. If you want to get involved, click one of these buttons!
For a web app I need a way to prevent that a browser falls back to another font if my web font doesn't include a character. It seems the only way to do this is to add another font to the fontstack which includes "all" possible characters .
There are already existing fallback fonts, but those are more debug helpers as they show the codepoint as number, therefore they are much to heavy (>2MB).
The fallback font for my use case should just show something like a box to signal a missing character.
My idea was to generate a simple font with only one glyph and apply a feature file which will substitute all glyphs with this one.
My script for fontforge:
import fontforge import fontTools.feaLib.builder as feaLibBuilder from fontTools.ttLib import TTFont font_name = 'maeh.ttf' font = fontforge.font() glyph = font.createChar(33, "theone") pen = glyph.glyphPen() pen.moveTo((100,100)) pen.lineTo((100,500)) pen.lineTo((500,500)) pen.lineTo((500,100)) pen.closePath() for i in range(34, 99): glyph = font.createChar(i) glyph.width=10 font.cidConvertTo('Adobe', 'Identity', 0) # doesn't make a difference font.generate(font_name) font = TTFont(font_name) feaLibBuilder.addOpenTypeFeatures(font, 'fallback.fea') font.save("fea_"+font_name)
My feature file:
languagesystem DFLT dflt; @all=[\00035-\00039]; #@all=[A-Z] this works feature liga { sub @all by theone; } liga;
For testing I target not 'all' glyphs, only the range from 33-99.
But the above results in a
KeyError: ('cid00037', 'SingleSubst[0]', 'Lookup[0]', 'LookupList')
with changing numbers for
cid00037.
If I use the out commented class definition A-Z from the Feature file it works, so this approach doesn't seem to be completely wrong. But how to create a class this way which includes 'all' possible 'glyphs'.
Why can't fonttools find the glyphs if I specify the range in CID notation? Is there another way to crate a class for the OpenType feature file which includes all glyphs?
I use 'liga' in the feature file as this seems to be the most supported tag. Is there a more appropriated one.
Wouldn’t it make more sense to build a CMAP table that maps all possible codepoints to a single glyph outline?
Since then, Ken Lunde created Adobe NotDef which does the same thing. Set it as the fallback font immediately after your font. Ken wrote an introduction post about it.
At Jeff Kellem, thank you for hint, because that is just what I was looking for and what I would have tried to accomplish with the Adobe Blank. But my result wouldn't have been as compact as this one and this way I will save time of course. And your link to the Blog helped to understand why the Blank font is structured as it is.
To create the woff file I used sfnt2woff from the woff-tools package. For the woff2 file I used.
As Georg says, these fonts have very unusual, carefully optimized (sometimes by hand) internal structures. | http://typedrawers.com/discussion/1888/trying-to-create-a-lightweight-fallback-font-with-a-substitute-all-glyphs-feature | CC-MAIN-2017-30 | refinedweb | 519 | 74.49 |
Mar 08, 2017 09:30 AM|aitorEG|LINK
Hello everyone,
I'm a NAV developer, and for one specific project, I had to start programming again since years. I am programming a WebApp that consumes a WebService published in NAV. And at this point, is where i found the problem, probably because of my inexperience.
The problem cames when I try to obtain the value of a textBox on the OnClick event of a button, and the shown error is the next:
"The name 'txtCodigo' does no exist in the actual context"
The page is like this:
And the code where I try to obtain the value, is this one:
I also add the error log, where I can find an issue with the heritance, that probably will affect to this issue, and I don't know how to manage.
Probably the error is some small issue, but I don't know how to handle it,.
Really appreciate your help!
Mar 08, 2017 10:03 AM|aitorEG|LINK
Problem solved with:
using System.Text
But I'm still having the problem of the heritance, that doesn't allow me to visualize the page on the Explorer.
Any hint??
edit: Thought it was solved, but the error appears again.. I'm quite lost...
All-Star
31332 Points
Mar 08, 2017 10:19 AM|kaushalparik27|LINK
Issue is in page directive, where inherits should also include name of the namespace you are using in code behind. Try:
<%@ Page Language="C#" AutoEventWireup="true" CodeBehind="Entrada.aspx.cs" Inherits="Picking.Entrada" %>
3 replies
Last post Mar 08, 2017 10:24 AM by aitorEG | https://forums.asp.net/t/2117065.aspx?Problem+obtaining+a+TextBox+value | CC-MAIN-2018-26 | refinedweb | 269 | 69.31 |
I just saw some people coming to my blog from an article published on The Register where the author referenced e(fx)clipse.
The author there talks about FXGraph and that it limits the appeal of e(fx)clipse which is think is not correct because nobody is forced to use the DSL I’ve been working on (use what ever you want – Java, GrooveFX, ScalaFX, …). It’s true that I currently don’t provide good tooling support for FXML but I plan to work on an FXML tooling so that people who want to directly edit them get decent support for it.
I think an important fact when it comes to FXGraph is that the DSL is not translated into Java or JavaByte code but into FXML so you can think of FXGraph-Files as a nicer textual representation of the FXML files content. The advantage of spitting out FXML are in my opinion:
- No lock in – you are not forced to work with FXGraph for ever because the generated FXML-File should be supported by e.g. Netbeans, IDEA, … you can switch to another IDE and continue with the work there
- Tool exchange – My opinion is that FXML is designed as an interchange format between different tools and not really designed to be authored directly so all upcoming tools (e.g. Scene Builder) will use it as interchange format
- No runtime layer – FXGraph-Files get translated automatically in FXML while coding and so you don’t need an extra library to make things work
Here’s a small diagram how I think FXML is designed to be used:
What’s missing at the moment is an FXML to FXGraph translator but this is something not really hard to implement so it’s already on my TODO-List for 0.0.10.
>> My opinion is that FXML is designed as an interchange format between different tools and not really designed to be authored directly …
With the exception of in-line text links, I find that I’m able to produce virtually anything my mind conceives with FXML and CSS – without tooling. Coming from OpenLaszlo, FXML is a godsend and I plan to continue editing FXML files – directly – even when the best tooling is available.
I plan to ship an initial support for FXML-Editing in 0.0.10, combined with a bidirectional FXGraph FXML conversion this allows you to switch from on to the other without any problem.
What about direct FXML support for your preview component? I’d like the idea that I could use the preview with FXML directly. This would probably require some kind of side car file to provide the extra information needed by the previewer.
I don’t think I need such an extra file – is that what namespaces are good for? I need test a bit. The first thing I need is a parser that makes up an in memory model of the file similar to what xtext does for the DSL (in fact my local git-repo already has a start of such a parser). Out of this memory model I can:
Hello Tom,
I’m using your release of e(fx)clipse version 0.0.8. Nice work you’ve done on this plugin. I’m going to use your plugin to make some javafx demo.
I check out your git source and trying with the examples in your testcases.
But I found that in MessageTest.fxgraph
component CssTest styledwith [“test.css”] resourcefile “/translations/messages.properties”
The Eclipse IDE show error icon at keyword “styledwith” with message: “Could not resolve reference to JvmType ‘stylewith'”. Also, the same error message for keyword “resourcefile” and “rstring”.
Could you show me how to fix these errors or any workaround might have. Thanks in advance.
Thanks for testing. The test cases in the example are already running on the new codebase (there are some incompatible changes and new features). I plan to do a release 0.0.9 today in the afternoon so if you wait for tomorrow you’ll see all those examples working. I hope this helps to clarify the situation. | https://tomsondev.bestsolution.at/2011/11/29/relation-between-fxgraph-and-fxml/?shared=email&msg=fail | CC-MAIN-2021-21 | refinedweb | 688 | 68.5 |
Advertising
--- Comment #1 from Chad H. <innocentkil...@gmail.com> --- (In reply to comment #0) > This may be actually impossible, but I'm filing a bug to discuss strategies > for > preventing mirrors of Wikipedia from including pages we NOINDEX. A good > example > of this is user pages or user talk pages, and the new Draft namespace on > English Wikipedia. > I can't think of any possible way to /enforce/ this, nor should we. We definitely shouldn't redact the info from the API or dumps (which I assume are the two most common ways of mirroring us). Now, we might be able to expose the NOINDEX to reusers and encourage people to respect it, but I can't see any way of preventing people from using the content if they really want it. -- You are receiving this mail because: You are the assignee for the bug. You are on the CC list for the bug. _______________________________________________ Wikibugs-l mailing list Wikibugs-l@lists.wikimedia.org | https://www.mail-archive.com/wikibugs-l@lists.wikimedia.org/msg318043.html | CC-MAIN-2018-34 | refinedweb | 164 | 71.14 |
In today's world of complex enterprise applications, objects alone are not able to deliver all the goods, multiparadigm design forces compel one to think in terms of artifacts which provide higher degrees of abstraction over the problem domain. As an example, consider the world of Web Services along with its rich XML manipulation requirements, which make us yarn for more powerful tree transformers, not offered by current OO languages. Think functional - this is what the document on Scala Rationale hints at! Enter Scala - the language designed with the mission of unifying object-oriented and functional elements. Martin Odersky sums it up beautifully in the document [Programming In Scala] :
Scala is both an object-oriented and functional language. It is a pure objectoriented
language in the sense that every value is an object. Types and behavior of objects are described by classes. Classes can be composed using mixin composition. Scala is designed to work seamlessly with mainstream object-oriented languages, in particular Java and C#.
Scala is also a functional language in the sense that every function is a value. Nesting of function definitions and higher-order functions are naturally supported. Scala also supports a general notion of pattern matching which can model the algebraic types used in many functional languages. Furthermore, this notion of pattern matching naturally extends to the processing of XML data.
I plan to blog a lot on Scala, focusing on all niceties, which have the potential to position it as the language of the future. Apart from the fact that Scala supports OO as well as functional paradigm, one other sublime aspect of Scala is its extensibility - Scala is a programmable programming language.
No introduction to a programming language is complete without the HelloWorld program. I would like to end today's post precisely with that. The following is the Scala way of saying Hello, World!
object HelloWorld {
def main(args: Array[String]): unit = {
System.out.println("Hello, world!");
}
}
Trivial as it may seem, the above snippet brings out some very interesting thoughts behind the design of Scala. Let us compare it with the corresponding version in Java.
class HelloWorld {
public static void main(String[] args) {
System.out.println("Hello, world!");
}
}
In the Java version we use the class based encapsulation, while Scala introduces the
objectdeclaration for the
mainmethod. This declaration introduces a Singleton object along with the class named
HelloWorld, which is created on demand, the first time it is used. The HelloWorld program makes the Singleton Design Pattern "invisible" in Scala - that's really hell of a HelloWorld!
When we can construct singletons invisibly, why should we require statics ? That's the second point of note
static members (methods or fields) do not exist in Scala. Rather than defining static members, the Scala programmer declares these members in singleton objects.
Coming Up! Everything is an Object in Scala!
3 comments:
Funny, I've been looking at Scala for the last week or so myself.. It's really pretty cool.
A little frustrating setting up a development environment, though. If you come up with a good solution, please blog that. Extra points given if it's not Eclipse based :-) Double extra points if it IS IDEA based...
Haven't used it, but there is an eclipse plugin available. Check out. The Scala Plugin requires version 2.0 or newer of the Scala distribution and has been tested with version 3.2 or newer of Eclipse. (from the plugin page)
I am yet to try it, but Workingmouse made a plugin for IDEA | https://debasishg.blogspot.com/2006/03/scale-up-with-scala.html | CC-MAIN-2017-39 | refinedweb | 588 | 56.76 |
Re: How to call a Sub function from .ASPX file ?
- From: "Kevin Spencer" <kevin@xxxxxxxxxxxxxxxxxxxxxxxxxx>
- Date: Wed, 10 Aug 2005 17:44:15 -0400
Sorry dude, it may be all YOU need, but my requirements go a good bit
farther.
--
HTH,
Kevin Spencer
Microsoft MVP
..Net Developer
Everybody picks their nose,
But some people are better at hiding it.
"tom pester" <Tom.PesterDELETETHISSS@xxxxxxxxxx> wrote in message
news:a1a977a2e3efa8c76c0ed0ef52f2@xxxxxxxxxxxxxxxxxxxxx
> Hi Kevin,
>
> This article is what you need when using asp.net 1.1
>
>
>
> It gest even simpler if you use asp.net v2. In this cas just drop the
> class file in the App_Code directory and you can call them everywhere.
>
> Let me know if you have any more questions...
>
> Cheers,
> Tom Pester
>
>> You're not thinking fourth-dimensionally! (- Back to the Future)
>>
>> Actually, you're not thinking Object-Orientationally.
>>
>> ASP.Net is object-oriented, and you'd better get acquainted with it,
>> or you'll be visiting here almost daily, and writing crappy code until
>> you do. Let me elaborate, if you will:
>>
>> Files are source code. Your application doesn't have files. It has
>> classes. A file defines a class, but IS not a class. A class is a data
>> type, and exists in the context of a running application. So, when
>> you're talking about how your application works, the first thing you
>> need to do is think about classes, not files. A file can contain one
>> or MORE class definitions, and you need to get acquainted with classes
>> to be successful with .Net.
>>
>> Classes are very important in .Net programming; Objects are made from
>> classes, and classes provide encapsulation. Object-oriented
>> programming can get pretty darned complex, and encapsulation can save
>> you a lot of grief, by hiding those things which need hiding from
>> those things that don't need them.
>>
>> If you have a file with a bunch of Subs and Functions in it, you need
>> to create a class with Subs and Functions in it. These Subs and
>> Functions can be Shared (meaning that they are singleton objects that
>> don't require a class instance to operate), or they can be Instance
>> (meaning that an instance of the class containing them must be created
>> in order to use them). The advantage to Shared data and process is
>> that it doesn't require a class instance, and is, in essence "global,"
>> available to the entire application. This is also the disadvantage of
>> Shared data and process. Anything can get to it, and change it, and in
>> a multi-threaded app (unlike VB 6, .net is multi-threaded), this can
>> cause all sorts of problems. Unless you're familiar with the issues, I
>> would stick with classes that require instantiation. Instantiation is
>> the process of creating a copy (instance) of a class that is limited
>> in its scope (availability), and is thread-safe.
>>
>> Once you create an instance of a class, you can access any Public or
>> Friend (Friend is more protected than Public, but you shouldn't run
>> into issues right away) members from any other class that references
>> the instance.
>>
>> From your question, and the code you posted, I can see that you
>> require a good bit more education and practice. I would recommend the
>> .Net SDK, a free download from:
>>
>>
>> -4070-9F41-A333C6B9181D&displaylang=en
>>
>> It is extremely important to know the difference between ASP and
>> ASP.Net, between VBScript or VB 6, and VB.Net. The first are
>> procedural, single-threaded, and easy to use for small applications.
>> .Net is object-oriented, multi-threaded, and easy to use once you
>> spend a great deal of time studying it, but incredibly hard to use if
>> you don't.
>>
>> Kevin Spencer
>> Microsoft MVP
>> .Net Developer
>> Everybody picks their nose,
>> But some people are better at hiding it.
>> "bienwell" <bienwell@xxxxxxxxxxx> wrote in message
>> news:O7QlcGdnFHA.1480@xxxxxxxxxxxxxxxxxxxxxxx
>>
>>> Hi,
>>>
>>> I have a question about file included in ASP.NET. I have a file
>>> that includes all the Sub functions (e.g FileFunct.vb). One of the
>>> functions in this file is :
>>>
>>> Sub TestFunct(ByVal strInput As String)
>>> return (strInput & " test")
>>> End Sub
>>> I'd like to call this function in FileFunct.vb from another .ASPX
>>> file like this :
>>>
>>> <%@ import Namespace="System" %>
>>> <%@ import Namespace="System.Data" %>
>>> <html>
>>> <head>
>>> <title>Test page</title>
>>> </head>
>>> <body>
>>> <script runat="server" language="VB" scr="FileFunct.vb" >
>>> Sub Page_Load(s As Object, e As EventArgs)
>>> Dim result=TestFunct("This is a string")
>>> response.write("<BR>result ==> " & result)
>>> End Sub
>>> </script>
>>> </body>
>>> </html>
>>> I've got this error:
>>>
>>> Server Error in '/' Application.
>>> ---------------------------------------------------------------------
>>> ------- ----
>>>
>>> Compilation Error
>>> Description: An error occurred during the compilation of a resource
>>> required
>>> to service this request. Please review the following specific error
>>> details
>>> and modify your source code appropriately.
>>> Compiler Error Message: BC30451: Name 'TestFunct' is not declared.
>>>
>>> Source Error:
>>>
>>> Line 18: Sub Page_Load(s As Object, e As EventArgs)
>>> Line 19:
>>> Line 20: Dim result=TestFunct("This is a string")
>>> Line 21: response.write("<BR>Result ==> " & Result)
>>> Line 22:
>>> I have a single .ASPX file and I don't use Visual studio. NET in this
>>> case.
>>> Can I do that ?
>>> Thanks in advance.
>>>
>
>
.
- References:
- Re: How to call a Sub function from .ASPX file ?
- From: Kevin Spencer
- Re: How to call a Sub function from .ASPX file ?
- From: tom pester
- Prev by Date: MSDN Subscriber Downloads: which version of VS2005 do I download?
- Next by Date: Re: How do I read back autonumber after do an insert in asp.net
- Previous by thread: Re: How to call a Sub function from .ASPX file ?
- Next by thread: Re: How to call a Sub function from .ASPX file ?
- Index(es): | http://www.tech-archive.net/Archive/DotNet/microsoft.public.dotnet.framework.aspnet/2005-08/msg01844.html | crawl-002 | refinedweb | 941 | 65.93 |
Python comes standard with a number of modules that perform specialized parsing tasks. A variety of custom formats are in sufficiently widespread use that it is convenient to have standard library support for them. Aside from those listed in this chapter, Chapter 5 discusses the email and xml packages, and the modules mailbox, HTMLParser, and urlparse, each of which performs parsing of sorts. A number of additional modules listed in Chapter 1, which handle and process audio and image formats, in a broad sense could be considered parsing tools. However, these media formats are better considered as byte streams and structures than as token streams of the sort parsers handle (the distinction is fine, though).
The specialized tools discussed under this section are presented only in summary. Consult the Python Library Reference for detailed documentation of their various APIs and features. It is worth knowing what is available, but for space reasons, this book does not document usage specifics of these few modules.
Parse and modify Windows-style configuration files.
>>> import ConfigParser >>> config = ConfigParser.ConfigParser() >>> config.read(['test.ini','nonesuch.ini']) >>> config.sections() ['userlevel', 'colorscheme'] >>> config.get('userlevel','login') '2' >>> config.set('userlevel','login',5) >>> config.write(sys.stdout) [userlevel] login = 5 title = 1 [colorscheme] background = red foreground = blue
The module difflib, introduced in Python 2.1, contains a variety of functions and classes to help you determine the difference and similarity of pairs of sequences. The API of difflib is flexible enough to work with sequences of all kinds, but the typical usage is in comparing sequences of lines or sequences of characters.
Word similarity is useful for determining likely misspellings and typos and/or edit changes required between strings. The function difflib.get_close_matches() is a useful way to perform "fuzzy matching" of a string against patterns. The required similarity is configurable.
>>> users = ['j.smith', 't.smith', 'p.smyth', 'a.simpson'] >>> maxhits = 10 >>>>> difflib.get_close_matches(login, users, maxhits) ['t.smith', 'j.smith', 'p.smyth'] >>> difflib.get_close_matches(login, users, maxhits, cutoff=.75) ['t.smith', 'j.smith'] >>> difflib.get_close_matches(login, users, maxhits, cutoff=.4) ['t.smith', 'j.smith', 'p.smyth', 'a.simpson']
Line matching is similar to the behavior of the Unix diff (or ndiff) and patch utilities. The latter utility is able to take a source and a difference, and produce the second compared line-list (file). The functions difflib.ndiff() and difflib.restore() implement these capabilities. Much of the time, however, the bundled ndiff.py tool performs the comparisons you are interested in (and the "patches" with an -r# option).
%. ./ndiff.py chap4.txt chap4.txt~ | grep '^[+-]' -: chap4.txt +: chap4.txt~ + against patterns. - against patterns. The required similarity is configurable. - - >>> users = ['j.smith', 't.smith', 'p.smyth', 'a.simpson'] - >>> maxhits = 10 - >>> login = 'a.smith'
There are a few more capabilities in the difflib module, and considerable customization is possible.
Transform an abstract sequence of formatting events into a sequence of callbacks to "writer" objects. Writer objects, in turn, produce concrete outputs based on these callbacks. Several parent formatter and writer classes are contained in the module.
In a way, formatter is an "anti-parser"?that is, while a parser transforms a series of tokens into program events, formatter transforms a series of program events into output tokens.
The purpose of the formatter module is to structure creation of streams such as word processor file formats. The module htmllib utilizes the formatter module. The particular API details provide calls related to features like fonts, margins, and so on.
For highly structured output of prose-oriented documents, the formatter module is useful, albeit requiring learning a fairly complicated API. At the minimal level, you may use the classes included to create simple tools. For example, the following utility is approximately equivalent to lynx -dump:
#!/usr/bin/env python import sys from urllib import urlopen from htmllib import HTMLParser from formatter import AbstractFormatter, DumbWriter if len(sys.argv) > 1: fpin = urlopen(sys.argv[1]) parser = HTMLParser(AbstractFormatter(DumbWriter())) parser.feed(fpin.read()) print '-----------------------------------------------' print fpin.geturl() print fpin.info() else: print "No specified URL"
SEE ALSO: htmllib 285; urllib 388;
Parse and process HTML files, using the services of sgmllib. In contrast to the HTMLParser module, htmllib relies on the user constructing a suitable "formatter" object to accept callbacks from HTML events, usually utilizing the formatter module. A formatter, in turn, uses a "writer" (also usually based on the formatter module). In my opinion, there are enough layers of indirection in the htmllib API to make HTMLParser preferable for almost all tasks.
SEE ALSO: HTMLParser 384; formatter 284; sgmllib 285;
The class multifile.MultiFile allows you to treat a text file composed of multiple delimited parts as if it were several files, each with their own FILE methods: .read(), .readline(), .readlines(), .seek(), and .tell() methods. In iterator fashion, advancing to the next virtual file is performed with the method multifile.MultiFile.next().
SEE ALSO: fileinput 61; mailbox 372; email.Parser 363; string.split() 142; file 15;
Interface to Python's internal parser and tokenizer. Although parsing Python source code is arguably a text processing task, the complexities of parsing Python are too specialized for this book.
Examine a robots.txt access control file. This file is used by Web servers to indicate the desired behavior of automatic indexers and Web crawlers?all the popular search engines honor these requests.
A partial parser for SGML. Standard Generalized Markup Language (SGML) is an enormously complex document standard; in its full generality, SGML cannot be considered a format, but rather a grammar for describing concrete formats. HTML is one particular SGML dialect, and XML is (almost) a simplified subset of SGML.
Although it might be nice to have a Python library that handled generic SGML, sgmllib is not such a thing. Instead, sgmllib implements just enough SGML parsing to support HTML parsing with htmllib. You might be able to coax parsing an XML library out of sgmllib, with some work, but Python's standard XML tools are far more refined for this purpose.
SEE ALSO: htmllib 285; xml.sax 405;
A lexical analyzer class for simple Unix shell-like syntaxes. This capability is primarily useful to implement small command language within Python applications.
This module is generally used as a command-line script rather than imported into other applications. The module/script tabnanny checks Python source code files for mixed use of tabs and spaces within the same block. Behind the scenes, the Python source is fully tokenized, but normal usage consists of something like:
% /sw/lib/python2.2/tabnanny.py SCRIPTS/ SCRIPTS/cmdline.py 165 '\treturn 1\r\n' 'SCRIPTS/HTMLParser_stack.py': Token Error: ('EOF in multi-line string', (3, 7)) SCRIPTS/outputters.py 18 '\tself.writer=writer\r\n' SCRIPTS/txt2bookU.py 148 '\ttry:\n'
The tool is single purpose, but that purpose addresses a common pitfall in Python programming.
SEE ALSO: tokenize 285;
Marc-Andre Lemburg's mx.TextTools is a remarkable tool that is a bit difficult to grasp the gestalt of. mx.TextTools can be blazingly fast and extremely powerful. But at the same time, as difficult as it might be to "get" the mindset of mx.TextTools, it is still more difficult to get an application written with it working just right. Once it is working, an application that utilizes mx.TextTools can process a larger class of text structures than can regular expressions, while simultaneously operating much faster. But debugging an mx.TextTools "tag table" can make you wish you were merely debugging a cryptic regular expression!
In recent versions, mx.TextTools has come in a larger package with eGenix.com's several other "mx Extensions for Python." Most of the other subpackages add highly efficient C implementations of datatypes not found in a base Python system.
mx.TextTools stands somewhere between a state machine and a full-fledged parser. In fact, the module SimpleParse, discussed below, is an EBNF parser library that is built on top of mx.TextTools. As a state machine, mx.TextTools feels like a lower-level tool than the statemachine module presented in the prior section. And yet, mx.TextTools is simultaneously very close to a high-level parser. This is how Lemburg characterizes it in the documentation accompanying mx.TextTools:.
The Python standard library has a good set of text processing tools. The basic tools are powerful, flexible, and easy to work with. But Python's basic text processing is not particularly fast. Mind you, for most problems, Python by itself is as fast as you need. But for a certain class of problems, being able to choose mx.TextTools is invaluable.
The unusual structure of mx.TextTools applications warrants some discussion of concrete usage. After a few sample applications are presented, a listing of mx.TextTools constants, commands, modifiers, and functions is given.
A familiar computer-industry paraphrase of Mark Twain (who repeats Benjamin Disraeli) dictates that there are "Lies, Damn Lies, and Benchmarks." I will not argue with that and certainly do not want readers to put too great an import on the timings suggested. Nonetheless, in exploring mx.TextTools, I wanted to get some sense of just how fast it is. So here is a rough idea.
The second example below presents part of a reworked version of the state machine-based Txt2Html application reproduced in Appendix D. The most time-consuming aspect of Txt2Html is the regular expression replacements performed in the function Typography() for smart ASCII inline markup of words and phrases.
In order to get a timeable test case, I concatenated 110 copies of an article I wrote to get a file a bit over 2MB, and about 41k lines and 300k words. My test processes an entire input as one text block, first using an mx.TextTools version of Typography(), then using the re version.
Processing time of the same test file went from about 34 seconds to about 12 seconds on one slowish Linux test machine (running Python 1.5.2). In other words, mx.TextTools gave me about a 3x speedup over what I get with the re module. This speedup is probably typical, but particular applications might gain significantly more or less from use of mx.TextTools. Moreover, 34 seconds is a long time in an interactive application, but is not very long at all for a batch process done once a day, or once a week.
Recall (or refer to) the sample report presented in the previous section "An Introduction to State Machines." A report contained a mixture of header material, buyer orders, and comments. The state machine we used looked at each successive line of the file and decided based on context whether the new line indicated a new state should start. It would be possible to write almost the same algorithm utilizing mx.TextTools only to speed up the decisions, but that is not what we will do.
A more representative use of mx.TextTools is to produce a concrete parse tree of the interesting components of the report document. In principle, you should be able to create a "grammar" that describes every valid "buyer report" document, but in practice using a mixed procedural/grammar approach is much easier, and more maintainable?at least for the test report.
An mx.TextTools tag table is a miniature state machine that either matches or fails to match a portion of a string. Matching, in this context, means that a "success" end state is reached, while nonmatching means that a "failure" end state is reached. Falling off the end of the tag table is a success state. Each individual state in a tag table tries to match some smaller construct by reading from the "read-head" and moving the read-head correspondingly. On either success or failure, program flow jumps to an indicated target state (which might be a success or failure state for the tag table as a whole). Of course, the jump target for success is often different from the jump target for failure?but there are only these two possible choices for jump targets, unlike the statemachine module's indefinite number.
Notably, one of the types of states you can include in a tag table is another tag table. That one state can "externally" look like a simple match attempt, but internally it might involve complex subpatterns and machine flow in order to determine if the state is a match or nonmatch. Much as in an EBNF grammar, you can build nested constructs for recognition of complex patterns. States can also have special behavior, such as function callbacks?but in general, an mx.TextTools tag table state is simply a binary match/nonmatch switch.
Let us look at an mx.TextTools parsing application for "buyer reports" and then examine how it works:
from mx.TextTools import * word_set = set(alphanumeric+white+'-') quant_set = set(number+'kKmM') item = ( (None, AllInSet, newline_set, +1), # 1 (None, AllInSet, white_set, +1), # 2 ('Prod', AllInSet, a2z_set, Fail), # 3 (None, AllInSet, white_set, Fail), # 4 ('Quant', AllInSet, quant_set, Fail), # 5 (None, WordEnd, '\n', -5) ) # 6 buyers = ( ('Order', Table, # 1 ( (None, WordEnd, '\n>> ', Fail), # 1.1 ('Buyer', AllInSet, word_set, Fail), # 1.2 ('Item', Table, item, MatchOk, +0) ), # 1.3 Fail, +0), ) comments = ( ('Comment', Table, # 1 ( (None, Word, '\n*', Fail), # 1.1 (None, WordEnd, '*\n', Fail), # 1.2 (None, Skip, -1) ), # 1.3 +1, +2), (None, Skip, +1), # 2 (None, EOF, Here, -2) ) # 3 def unclaimed_ranges(tagtuple): starts = [0] + [tup[2] for tup in tagtuple [1] ] stops = [tup[1] for tup in tagtuple[1]] + [tagtuple[2]] return zip(starts, stops) def report2data(s): comtuple = tag(s, comments) taglist = comtuple[1] for beg,end in unclaimed_ranges(comtuple): taglist.extend(tag(s, buyers, beg, end)[1]) taglist.sort(cmp) return taglist if __name__=='__main__': import sys, pprint pprint.pprint(report2data(sys.stdin.read()))
Several tag tables are defined in buyer_report: item, buyers, and comments. State machines such as those in each tag table are general matching engines that can be used to identify patterns; after working with mx.TextTools for a while, you might accumulate a library of useful tag tables. As mentioned above, states in tag tables can reference other tag tables, either by name or inline. For example, buyers contains an inline tag table, while this inline tag table utilizes the tag table named item.
Let us take a look, step by step, at what the buyers tag table does. In order to do anything, a tag table needs to be passed as an argument to the mx.TextTools.tag() function, along with a string to match against. That is done in the report2data() function in the example. But in general, buyers?or any tag table?contains a list of states, each containing branch offsets. In the example, all such states are numbered in comments. buyers in particular contains just one state, which contains a subtable with three states.
Try to match the subtable. If the match succeeds, add the name Order to the taglist of matches. If the match fails, do not add anything. If the match succeeds, jump back into the one state (i.e., +0). In effect, buyers loops as long as it succeeds, advancing the read-head on each such match.
Try to find the end of the "word" \n>> in the string. That is, look for two greater-than symbols at the beginning of a line. If successful, move the read-head just past the point that first matched. If this state match fails, jump to Fail?that is, the (sub)table as a whole fails to match. No jump target is given for a successful match, so the default jump of +1 is taken. Since None is the tag object, do not add anything to the taglist upon a state match.
Try to find some word_set characters. This set of characters is defined in buyer_report; various other sets are defined in mx.TextTools itself. If the match succeeds, add the name Buyer to the taglist of matches. As many contiguous characters in the set as possible are matched. The match is considered a failure if there is not at least one such character. If this state match fails, jump to Fail, as in state (1).
Try to match the item tag table. If the match succeeds, add the name Item to the taglist of matches. What gets added, moreover, includes anything added within the item tag table. If the match fails, jump to MatchOk?that is, the (sub)table as a whole matches. If the match succeeds, jump +0?that is, keep looking for another Item to add to the taglist.
What buyer_report actually does is to first identify any comments, then to scan what is left in between comments for buyer orders. This approach proved easier to understand. Moreover, the design of mx.TextTools allows us to do this with no real inefficiency. Tagging a string does not involve actually pulling out the slices that match patterns, but simply identifying numerically the offset ranges where they occur. This approach is much "cheaper" than performing repeated slices, or otherwise creating new strings.
The following is important to notice: As of version 2.1.0, the documentation of the mx.TextTools.tag() function that accompanies mx.TextTools does not match its behavior! If the optional third and fourth arguments are passed to tag() they must indicate the start and end offsets within a larger string to scan, not the starting offset and length. Hopefully, later versions will fix the discrepancy (either approach would be fine, but could cause some breakage in existing code).
What buyer_report produces is a data structure, not final output. This data structure looks something like:
$ python ex_mx.py < recs.tmp [('Order', 0, 638, [('Buyer', 547, 562, None), ('Item', 562, 583, [('Prod', 566, 573, None), ('Quant', 579, 582, None)]), ('Item', 583, 602, [('Prod', 585, 593, None), ('Quant', 597, 601, None)]), ('Item', 602, 621, [('Prod', 604, 611, None), ('Quant', 616, 620, None)]), ('Item', 621, 638, [('Prod', 623, 632, None), ('Quant', 635, 637, None)])]), ('Comment', 638, 763, []), ('Order', 763, 805, [('Buyer', 768, 776, None), ('Item', 776, 792, [('Prod', 778, 785, None), ('Quant', 788, 791, None)]), ('Item', 792, 805, [('Prod', 792, 800, None), ('Quant', 802, 804, None)])]), ('Order', 805, 893, [('Buyer', 809, 829, None), ('Item', 829, 852, [('Prod', 833, 840, None), ('Quant', 848, 851, None)]), ('Item', 852, 871, [('Prod', 855, 863, None), ('Quant', 869, 870, None)]), ('Item', 871, 893, [('Prod', 874, 879, None), ('Quant', 888, 892, None)])]), ('Comment', 893, 952, []), ('Comment', 952, 1025, []), ('Comment', 1026, 1049, []), ('Order', 1049, 1109, [('Buyer', 1054, 1069, None), ('Item',1069, 1109, [('Prod', 1070, 1077, None), ('Quant', 1083, 1086, None)])])]
While this is "just" a new data structure, it is quite easy to deal with compared to raw textual reports. For example, here is a brief function that will create well-formed XML out of any taglist. You could even arrange for it to be valid XML by designing tag tables to match DTDs (see Chapter 5 for details about XML, DTDs, etc.):
def taglist2xml(s, taglist, root): print '<%s>' % root for tt in taglist: if tt[3] : taglist2xml(s, tt[3], tt[0]) else: print '<%s>%s</%s>' % (tt[0], s[tt[1]:tt[2]], tt[0]) print '</%s>' % root
The "smart ASCII" format uses email-like conventions to lightly mark features like word emphasis, source code, and URL links. This format?with as an intermediate format?was used to produce the book you hold (which was written using a variety of plaintext editors). By obeying just a few conventions (that are almost the same as you would use on Usenet or in email), a writer can write without much clutter, but still convert to production-ready markup.
The Txt2Html utility uses a block-level state machine, combined with a collection of inline-level regular expressions, to identify and modify markup patterns in smart ASCII texts. Even though Python's regular expression engine is moderately slow, converting a five-page article takes only a couple seconds. In practice, Txt2Html is more than adequate for my own 20 kilobyte documents. However, it is easy to imagine a not-so-different situation where you were converting multimegabyte documents and/or delivering such dynamically converted content on a high-volume Web site. In such a case, Python's string operations, and especially regular expressions, would simply be too slow.
mx.TextTools can do everything regular expressions can, plus some things regular expressions cannot. In particular, a taglist can contain recursive references to matched patterns, which regular expressions cannot. The utility mxTypography.py utilizes several mx.TextTools capabilities the prior example did not use. Rather than create a nested data structure, mxTypography.py utilizes a number of callback functions, each responding to a particular match event. As well, mxTypography.py adds some important debugging techniques. Something similar to these techniques is almost required for tag tables that are likely to be updated over time (or simply to aid the initial development). Overall, this looks like a robust application should.
from mx.TextTools import * import string, sys #-- List of all words with markup, head position, loop count ws, head_pos, loops = [], None, 0 #-- Define "emitter" callbacks for each output format def emit_misc(tl,txt,l,r,s): ws.append(txt[l:r]) def emit_func(tl,txt,l,r,s): ws.append('<code>'+txt[l+1:r-1]+'</code>') def emit_modl(tl,txt,l,r,s): ws.append('<em><code>'+txt[l+1:r-1]+'</code></em>') def emit_emph(tl,txt,l,r,s): ws.append('<em>'+txt[l+1:r-1]+'</em>') def emit_strg(tl,txt,l,r,s): ws.append('<strong>'+txt[l+1:r-1]+'</strong>') def emit_titl(tl,txt,l,r,s): ws.append('<cite>'+txt[l+1:r-1]+'</cite>') def jump_count(tl,txt,l,r,s): global head_pos, loops loops = loops+1 if head_pos is None: head_pos = r elif head_pos == r: raise "InfiniteLoopError", \ txt[l-20:l]+'{'+txt[l]+'}'+txt[l+1:r+15] else: head_pos = r #-- What can appear inside, and what can be, markups? punct_set = set("'!@#$%^&*()_-+=|\{}[]:;'<>,.?/"+'"') markable = alphanumeric+whitespace+"'!@#$%^&()+= |\{}:;<>,.?/"+'"' markable_func = set(markable+"*-_[]") markable_modl = set(markable+"*-_'") markable_emph = set(markable+"*_'[]") markable_strg = set(markable+"-_'[]") markable_titl = set(markable+"*-'[]") markup_set = set("-*'[]_") #-- What can precede and follow markup phrases? darkins = '(/"' leadins = whitespace+darkins # might add from "-*'[]_" darkouts = '/.),:;?!"' darkout_set = set(darkouts) leadouts = whitespace+darkouts # for non-conflicting markup leadout_set = set(leadouts) #-- What can appear inside plain words? word_set = set(alphanumeric+'{}/@#$%^&-_+= |\><'+darkouts) wordinit_set = set(alphanumeric+"$#+\<.&{"+darkins) #-- Define the word patterns (global so as to do it only at import) # Special markup def markup_struct(lmark, rmark, callback, markables, x_post="-"): struct = \ ( callback, Table+CallTag, ( (None, Is, lmark), # Starts with left marker (None, AllInSet, markables), # Stuff marked (None, Is, rmark), # Ends with right marker (None, IsInSet, leadout_set,+2,+1),# EITHR: postfix w/ leadout (None, Skip, -1,+1, MatchOk), # ..give back trailng ldout (None, IsIn, x_post, MatchFail), # OR: special case postfix (None, Skip, -1,+1, MatchOk) # ..give back trailing char ) ) return struct funcs = markup_struct("'", "'", emit_func, markable_func) modules = markup_struct("[", "]", emit_modl, markable_modl) emphs = markup_struct("-", "-", emit_emph, markable_emph, x_post="") strongs = markup_struct("*", "*", emit_strg, markable_strg) titles = markup_struct("_", "_", emit_titl, markable_titl) # All the stuff not specially marked plain_words = \ ( ws, Table+AppendMatch, # AppendMatch only -slightly ( (None, IsInSet, # faster than emit_misc callback wordinit_set, MatchFail), # Must start with word-initial (None, Is, "'",+1), # May have apostrophe next (None, AllInSet, word_set,+1), # May have more word-internal (None, Is, "'", +2), # May have trailing apostrophe (None, IsIn, "st",+1), # May have [ts] after apostrophe (None, IsInSet, darkout_set,+1, MatchOk), # Postfixed with dark lead-out (None, IsInSet, whitespace_set, MatchFail), # Give back trailing whitespace (None, Skip, -1) ) ) # Catch some special cases bullet_point = \ ( ws, Table+AppendMatch, ( (None, Word+CallTag, "* "), # Asterisk bullet is a word ) ) horiz_rule = \ ( None, Table, ( (None, Word, "-"*50), # 50 dashes in a row (None, AllIn, "-"), # More dashes ) ) into_mark = \ ( ws, Table+AppendMatch, # Special case where dark leadin ( (None, IsInSet, set(darkins)), # is followed by markup char (None, IsInSet, markup_set), (None, Skip, -1) # Give back the markup char ) ) stray_punct = \ ( ws, Table+AppendMatch, # Pickup any cases where multiple ( (None, IsInSet, punct_set), # punctuation character occur (None, AllInSet, punct_set), # alone (followed by whitespace) (None, IsInSet, whitespace_set), (None, Skip, -1) # Give back the whitespace ) ) leadout_eater = (ws, AllInSet+AppendMatch, leadout_set) #-- Tag all the (possibly marked-up) words tag_words = \ ( bullet_point+(+1,), horiz_rule + (+1,), into_mark + (+1,), stray_punct+ (+1,), emphs + (+1,), funcs + (+1,), strongs + (+1,), modules + (+1,), titles + (+1,), into_mark+(+1,), plain_words +(+1,), # Since file is mstly plain wrds, can leadout_eater+(+1,-1), # shortcut by tight looping (w/ esc) (jump_count, Skip+CallTag, 0), # Check for infinite loop (None, EOF, Here, -13) # Check for EOF ) def Typography(txt): global ws ws = [] # clear the list before we proceed tag(txt, tag_words, 0, len(txt), ws) return string.join(ws, '') if __name__ == '__main__': print Typography(open(sys.argv[1]).read())
mxTypographify.py reads through a string and determines if the next bit of text matches one of the markup patterns in tag_words. Or rather, it better match some pattern or the application just will not know what action to take for the next bit of text. Whenever a named subtable matches, a callback function is called, which leads to a properly annotated string being appended to the global list ws. In the end, all such appended strings are concatenated.
Several of the patterns given are mostly fallback conditions. For example, the stray_punct tag table detects the condition where the next bit of text is some punctuation symbols standing alone without abutting any words. In most cases, you don't want smart ASCII to contain such a pattern, but mxTypographify has to do something with them if they are encountered.
Making sure that every subsequence is matched by some subtable or another is tricky. Here are a few examples of matches and failures for the stray_punct subtable. Everything that does not match this subtable needs to match some other subtable instead:
-- spam # matches "--" & spam # fails at "AllInSet" since '&' advanced head #@$ %% spam # matches "#@$" **spam # fails (whitespace isn't encountered before 's')
After each success, the read-head is at the space right before the next word "spam" or "%%". After a failure, the read-head remains where it started out (at the beginning of the line).
Like stray_punct, emphs, funcs, strongs, plain_words, et cetera contain tag tables. Each entry in tag_words has its appropriate callback functions (all "emitters" of various names, because they "emit" the match, along with surrounding markup if needed). Most lines each have a "+1" appended to their tuple; what this does is specify where to jump in case of a match failure. That is, even if these patterns fail to match, we continue on?with the read-head in the same position?to try matching against the other patterns.
After the basic word patterns each attempt a match, we get to the "leadout eater" line. For mxTypography.py, a "leadout" is the opposite of a "leadin." That is, the latter are things that might precede a word pattern, and the former are things that might follow a word pattern. The leadout_set includes whitespace characters, but it also includes things like a comma, period, and question mark, which might end a word. The "leadout eater" uses a callback function, too. As designed, it preserves exactly the whitespace the input has. However, it would be easy to normalize whitespace here by emitting something other than the actual match (e.g., a single space always).
The jump_count is extremely important; we will come back to it momentarily. For now, it is enough to say that we hope the line never does anything.
The EOF line is our flow control, in a way. The call made by this line is to None, which is to say that nothing is actually done with any match. The command EOF is the important thing (Here is just a filler value that occupies the tuple position). It succeeds if the read-head is past the end of the read buffer. On success, the whole tag table tag_words succeeds, and having succeeded, processing stops. EOF failure is more interesting. Assuming we haven't reached the end of our string, we jump -13 states (to bullet_point). From there, the whole process starts over, hopefully with the read-head advanced to the next word. By looping back to the start of the list of tuples, we continue eating successive word patterns until the read buffer is exhausted (calling callbacks along the way).
The tag() call simply launches processing of the tag table we pass to it (against the read buffer contained in txt). In our case, we do not care about the return value of tag() since everything is handled in callbacks. However, in cases where the tag table does not loop itself, the returned tuple can be used to determine if there is reason to call tag() again with a tail of the read buffer.
Describing it is easy, but I spent a large number of hours finding the exact collection of tag tables that would match every pattern I was interested in without mismatching any pattern as something it wasn't. While smart ASCII markup seems pretty simple, there are actually quite a few complications (e.g., markup characters being used in nonmarkup contexts, or markup characters and other punctuation appearing in various sequences). Any structured document format that is complicated enough to warrant using mx.TextTools instead of string is likely to have similar complications.
Without question, the worst thing that can go wrong in a looping state pattern like the one above is that none of the listed states match from the current read-head position. If that happens, your program winds up in a tight infinite loop (entirely inside the extension module, so you cannot get at it with Python code directly). I wound up forcing a manual kill of the process countless times during my first brush at mx.TextTools development.
Fortunately, there is a solution to the infinite loop problem. This is to use a callback like jump_count.
def jump_count(taglist,txt,l,r,subtag): global head_pos if head_pos is None: head_pos = r elif head_pos == r: raise "InfiniteLoopError", \ txt[1-20:1]+'{'+txt[1]+'}'+txt[l+1:r+15] else: head_pos = r
The basic purpose of jump_count is simple: We want to catch the situation where our tag table has been run through multiple times without matching anything. The simplest way to do this is to check whether the last read-head position is the same as the current. If it is, more loops cannot get anywhere, since we have reached the exact same state twice, and the same thing is fated to happen forever. mxTypography.py simply raises an error to stop the program (and reports a little bit of buffer context to see what is going on).
It is also possible to move the read-head manually and try again from a different starting position. To manipulate the read head in this fashion, you could use the Call command in tag table items. But a better approach is to create a nonlooping tag table that is called repeatedly from a Python loop. This Python loop can look at a returned tuple and use adjusted offsets in the next call if no match occurred. Either way, since much more time is spent in Python this way than with the loop tag table approach, less speed would be gained from mx.TextTools.
Not as bad as an infinite loop, but still undesirable, is having patterns within a tag table match when they are not supposed to or not match when they are suppose to (but something else has to match, or we would have an infinite loop issue). Using callbacks everywhere makes examining this situation much easier. During development, I frequently create temporary changes to my emit_* callbacks to print or log when certain emitters get called. By looking at output from these temporary print statements, most times you can tell where the problem lies.
The mx.TextTools module contains constants for a number of frequently used collections of characters. Many of these character classes are the same as ones in the string module. Each of these constants also has a set version predefined; a set is an efficient representation of a character class that may be used in tag tables and other mx.TextTools functions. You may also obtain a character set from a (custom) character class using the mx.TextTools.set() function:
>>> from mx.TextTools import a2z, set >>> varname_chars = a2z + '_' >>> varname_set = set(varname_chars)
English lowercase letters ("abcdefghijklmnopqrstuvwxyz").
English uppercase letters ("ABCDEFGHIJKLMNOPQRSTUVWXYZ").
Extra German lowercase hi-bit characters.
Extra German uppercase hi-bit characters.
English letters (A2Z + a2z).
German letters (A2Z + a2z + umlaute + Umlaute).
The decimal numerals ("0123456789").
English numbers and letters (alpha + number).
Spaces and tabs (" \t\v"). This is more restricted than string.whitespace.
Line break characters for various platforms ("\n\r").
Formfeed character ("\f").
Same as string.whitespace (white+newline+formfeed).
All characters (0x00-0xFF).
SEE ALSO: string.digits 130; string.hexdigits 130; string.octdigits 130; string.lowercase 131; string.uppercase 131; string.letters 131; string.punctuation 131; string.whitespace 131; string.printable 132;
Programming in mx.TextTools amounts mostly to correctly configuring tag tables. Utilizing a tag table requires just one call to the mx.TextTools.tag(), but inside a tag table is a kind of mini-language?something close to a specialized Assembly language, in many ways.
Each tuple within a tag table contains several elements, of the form:
(tagobj, command[+modifiers], argument [,jump_no_match=MatchFail [,jump_match=+l]])
The "tag object" may be None, a callable object, or a string. If tagobj is None, the indicated pattern may match, but nothing is added to a taglist data structure if so, nor is a callback invoked. If a callable object (usually a function) is given, it acts as a callback for a match. If a string is used, it is used to name a part of the taglist data structure returned by a call to mx.TextTools.tag().
A command indicates a type of pattern to match, and a modifier can change the behavior that occurs in case of such a match. Some commands succeed or fail unconditionally, but allow you to specify behaviors to take if they are reached. An argument is required, but the specific values that are allowed and how they are interpreted depends on the command used.
Two jump conditions may optionally be specified. If no values are given, jump_no_match defaults to MatchFail?that is, unless otherwise specified, failing to match a tuple in a tag table causes the tag table as a whole to fail. If a value is given, jump_no_match branches to a tuple the specified number of states forward or backward. For clarity, an explicit leading "+" is used in forward branches. Branches backward will begin with a minus sign. For example:
# Branch forward one state if next character -is not- an X # ... branch backward three states if it is an X tupX = (None, Is, 'X', +1, -3) # assume all the tups are defined somewhere... tagtable = (tupA, tupB, tupV, tupW, tupX, tupY, tupZ)
If no value is given for jump_match, branching is one state forward in the case of a match.
Version 2.1.0 of mx.TextTools adds named jump targets, which are often easier to read (and maintain) than numeric offsets. An example is given in the mx.TextTools documentation:
tag_table = ('start', ('lowercase',AllIn,a2z,+1,'skip'), ('upper',AllIn,A2Z,'skip'), 'skip', (None,AllIn,white+newline,+1), (None,AllNotIn,alpha+white+newline,+1), (None,EOF,Here,'start') )
It is easy to see that if you were to add or remove a tuple, it is less error prone to retain a jump to, for example, skip than to change every necessary +2 to a +3 or the like.
Nonmatch at this tuple. Used mostly for documentary purposes in a tag table, usually with the Here or To placeholder. The tag tables below are equivalent:
table1 = ( ('foo', Is, 'X', MatchFail, MatchOk), ) table2 = ( ('foo', Is, 'X', +1, +2), ('Not_X', Fail, Here) )
The Fail command may be preferred if several other states branch to the same failure, or if the condition needs to be documented explicitly.
Jump is equivalent to Fail, but it is often better self-documenting to use one rather than the other; for example:
tup1 = (None, Fail, Here, +3) tup2 = (None, Jump, To, +3)
Match at this tuple, and change the read-head position. Skip moves the read-head by a relative amount, Move to an absolute offset (within the slice the tag table is operating on). For example:
# read-head forward 20 chars, jump to next state tup1 = (None, Skip, 20) # read-head to position 10, and jump back 4 states tup2 = (None, Move, 10, 0, -4)
Negative offsets are allowed, as in Python list indexing.
Match all characters up to the first that is not included in argument. AllIn uses a character string while AllInSet uses a set as argument. For version 2.1.0, you may also use AllInCharSet to match CharSet objects. In general, the set or CharSet form will be faster and is preferable. The following are functionally the same:
tup1 = ('xyz', AllIn, 'XYZxyz') tup2 = ('xyz', AllInSet, set('XYZxyz') tup3 = ('xyz', AllInSet, CharSet('XYZxyz'))
At least one character must match for the tuple to match.
Match all characters up to the first that is included in argument. As of version 2.1.0, mx.TextTools does not include an AllNotInSet command. However, the following tuples are functionally the same (the second usually faster):
from mx.TextTools import AllNotIn, AllInSet, invset tup1 = ('xyz', AllNotIn, 'XYZxyz') tup2 = ('xyz', AllInSet, invset('xyzXYZ'))
At least one character must match for the tuple to match.
Match specified character. For example:
tup = ('X', Is, 'X')
Match any one character except the specified character.
tup = ('X', IsNot, 'X')
Match exactly one character if it is in argument. IsIn uses a character string while IsInSet use a set as argument. For version 2.1.0, you may also use IsInCharSet to match CharSet objects. In general, the set or CharSet form will be faster and is preferable. The following are functionally the same:
tup1 = ('xyz', IsIn, 'XYZxyz') tup2 = ('xyz', IsInSet, set('XYZxyz') tup3 = ('xyz', IsInSet, CharSet('XYZxyz')
Match exactly one character if it is not in argument. As of version 2.1.0, mx.TextTools does not include an 'AllNotInSet command. However, the following tuples are functionally the same (the second usually faster):
from mx.TextTools import IsNotIn, IsInSet, invset tup1 = ('xyz', IsNotIn, 'XYZxyz') tup2 = ('xyz', IsInSet, invset('xyzXYZ'))
Match a word at the current read-head position. For example:
tup = ('spam', Word, 'spam')
Search for a word, and match up to the point of the match. Searches performed in this manner are extremely fast, and this is one of the most powerful elements of tag tables. The commands sWordStart and sWordEnd use "search objects" rather than plaintexts (and are significantly faster).
WordStart and sWordStart leave the read-head immediately prior to the matched word, if a match succeeds. WordEnd and sWordEnd leave the read-head immediately after the matched word. On failure, the read-head is not moved for any of these commands.
>>> from mx.TextTools import * >>>>> tab1 = ( ('toeggs', WordStart, 'eggs'), ) >>> tag(s, tab1) (1, [('toeggs', 0, 9, None)], 9) >>> s[0:9] 'spam and ' >>> tab2 = ( ('pasteggs', sWordEnd, BMS('eggs')), ) >>> tag(s, tab2) (1, [('pasteggs', 0, 13, None)], 13) >>> s[0:13] 'spam and eggs'
SEE ALSO: mx.TextTools.BMS() 307; mx.TextTools.sFindWord 303;
Search for a word, and match only that word. Any characters leading up to the match are ignored. This command accepts a search object as an argument. In case of a match, the read-head is positioned immediately after the matched word.
>>> from mx.TextTools import * >>>>> tab3 = ( ('justeggs', sFindWord, BMS('eggs')), ) >>> tag(s, tab3) (1, [('justeggs', 9, 13, None)], 13) >>> s[9:13] 'eggs'
SEE ALSO: mx.TextTools.sWordEnd 302;
Match if the read-head is past the end of the string slice. Normally used with placeholder argument Here, for example:
tup = (None, EOF, Here)
Match if the table given as argument matches at the current read-head position. The difference between the Table and the SubTable commands is in where matches get inserted. When the Table command is used, any matches in the indicated table are nested in the data structure associated with the tuple. When SubTable is used, matches are written into the current level taglist. For example:
>>> from mx.TextTools import * >>> from pprint import pprint >>> caps = ('Caps', AllIn, A2Z) >>> lower = ('Lower', AllIn, a2z) >>> words = ( ('Word', Table, (caps, lower)), ... (None, AllIn, whitespace, MatchFail, -1) ) >>> from pprint import pprint >>> pprint(tag(s, words)) (0, [('Word', 0, 4, [('Caps', 0, 1, None), ('Lower', 1, 4, None)]), ('Word', 5, 19, [('Caps', 5, 6, None), ('Lower', 6, 19, None)]), ('Word', 20, 29, [('Caps', 20, 24, None), ('Lower', 24, 29, None)]), ('Word', 30, 35, [('Caps', 30, 32, None), ('Lower', 32, 35, None)]) ], 35) >>> flatwords = ( (None, SubTable, (caps, lower)), ... (None, AllIn, whitespace, MatchFail, -1) ) >>> pprint (tag(s, flatwords)) (0, [('Caps', 0, 1, None), ('Lower', 1, 4, None), ('Caps', 5, 6, None), ('Lower', 6, 19, None), ('Caps', 20, 24, None), ('Lower', 24, 29, None), ('Caps', 30, 32, None), ('Lower', 32, 35, None)], 35)
For either command, if a match occurs, the read-head is moved to immediately after the match.
The special constant ThisTable can be used instead of a tag table to call the current table recursively.
Similar to Table and SubTable except that the argument is a tuple of the form (list_of_tables, index). The advantage (and the danger) of this is that a list is mutable and may have tables added after the tuple defined?in particular, the containing tag table may be added to list_of_tables to allow recursion. Note, however, that the special value ThisTable can be used with the Table or SubTable commands and is usually more clear.
SEE ALSO: mx.TextTools.Table 304; mx.TextTools.SubTable 304;
Match on any computable basis. Essentially, when the Call command is used, control over parsing/matching is turned over to Python rather than staying in the mx.TextTools engine. The function that is called must accept arguments s, pos, and end?where s is the underlying string, pos is the current read-head position, and end is ending of the slice being processed. The called function must return an integer for the new read-head position; if the return is different from pos, the match is a success.
As an example, suppose you want to match at a certain point only if the next N characters make up a dictionary word. Perhaps an efficient stemmed data structure is used to represent the dictionary word list. You might check dictionary membership with a tuple like:
tup = ('DictWord', Call, inDict)
Since the function inDict is written in Python, it will generally not operate as quickly as does an mx.TextTools pattern tuple.
Same as Call, except CallArg allows passing additional arguments. For example, suppose the dictionary example given in the discussion of Call also allows you to specify language and maximum word length for a match:
tup = ('DictWord', Call, (inDict,['English',10]))
SEE ALSO: mx.TextTools.Call 305;
Instead of appending (tagobj, l, r, subtags) to the taglist upon a successful match, call the function indicated as the tag object (which must be a function rather than None or a string). The function called must accept the arguments taglist, s, start, end, and subtags?where taglist is the present taglist, s is the underlying string, start and end are the slice indices of the match, and subtags is the nested taglist. The function called may, but need not, append to or modify taglist or subtags as part of its action. For example, a code parsing application might include:
>>> def todo_flag(taglist, s, start, end, subtags): ... sys.stderr.write("Fix issue at offset %d\n" % start) ... >>> tup = (todo_flag, Word+CallTag, 'XXX') >>> tag('XXX more stuff', (tup,)) Fix issue at offset 0 (1, [], 3)
Instead of appending (tagobj,start,end,subtags) to the taglist upon successful matching, append the match found as string. The produced taglist is "flattened" and cannot be used in the same manner as "normal" taglist data structures. The flat data structure is often useful for joining or for list processing styles.
>>> from mx.TextTools import * >>> words = (('Word', AllIn+AppendMatch, alpha), ... (None, AllIn, whitespace, MatchFail, -1)) >>> tag('this and that', words) (0, ['this', 'and', 'that'], 13) >>> join(tag('this and that', words)[1], '-') 'this-and-that'
SEE ALSO: string.split() 142;
Instead of appending (tagobj,start,end,subtags) to the taglist upon successful matching, call the .append() method of the tag object. The tag object must be a list | https://etutorials.org/Programming/Python.+Text+processing/Chapter+4.+Parsers+and+State+Machines/4.3+Parser+Libraries+for+Python/ | CC-MAIN-2022-21 | refinedweb | 7,408 | 64.51 |
i placed that do because ..there's another error if i wont have it...something likE.... "num wont be able to initiallize"
i placed that do because ..there's another error if i wont have it...something likE.... "num wont be able to initiallize"
';' expected comes out when i compile, what's the problem with my while loop?
btw..i know this is not the best solution for making a program find out if it is a prime or not..
public class...
uhm...where do i put that code?
o tried " public static double calculatearea(double radius){ "
doesnt work...
it says cannot be applied to
public class solvearea{
public static double calculatearea(){
double methodArea = (radius*2)*3.1416;
return methodArea;
}
public static void main...
how do you remove letters in a string?
public class countletters {
public static boolean letter(char L) {
String letters = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
return...
ahh...ok tnx...
btw..i forgot.
what does frame and null do?
hey freaky chris....
you're not a freak at all....
if anyone calls you freak..tell me..ill kick their buts for you...
tnx alot
forum admin:
close thread ?
hello guys im a random college guy who goes to school for granted,,..
pls help me here
here's my code...
public class asdasdasd {
public static void main (String[] args){
... | http://www.javaprogrammingforums.com/search.php?s=f9caf85280b4c70793aa73fc6f9ef140&searchid=1273734 | CC-MAIN-2014-52 | refinedweb | 216 | 78.85 |
On Thu, 7 Aug 2008, david@lang.hm wrote:
> I am taking the time to create a minimal config for some new hardware with
> 2.6.25.15 and noticed that CONFIG_NAMESPACES is forced to Yes unless embeded
> is selected (at which time it becomes configurable)
>
> why are namespaces required?
as a follow up, when enabling embedded mode, it defaults to everything
enabled, including the option to 'disable heap randomization'
this should be changed to 'enable heap randomization' so that it can
default to on line everything else (with the assumption being that mearly
checking the option to be able to select the embeded menu doesn't change
the kernel behavior, you would have to disable something in that menu)
David Lang
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at
Please read the FAQ at | http://fixunix.com/kernel/519043-why-namespaces-required.html | CC-MAIN-2014-10 | refinedweb | 153 | 50.91 |
Handy Gradle startup script
Posted on 25 November, 2011 (8 years ago)
Dierk published a gist on GitHub with a handy Gradle build script to help you bootstrap a Gradle-built project from scratch, without having to create the directory layout manually, or install the Gradle wrapper.
This is pretty neat and should be integrated in Gradle to ease the creation of projects!
I've updated the gist with a more recent version of Groovy and Gradle.
And so that I never forget about this handy Gradle build script, I'm blogging about it and reproducing it here, to save me precious minutes finding it again the next time I need it! So without further ado, here's the script in question:
apply plugin : 'groovy'
apply plugin : 'idea'
repositories { mavenCentral() }
dependencies {
groovy 'org.codehaus.groovy:groovy-all:1.8.4'
}
task makeDirs(description : 'make all dirs for project setup') << {
def sources = [sourceSets.main, sourceSets.test]
sources*.allSource*.srcDirs.flatten().each { File srcDir ->
println "making $srcDir"
srcDir.mkdirs()
}
}
task wrap(type : Wrapper, description : "create a gradlew") {
gradleVersion = '1.0-milestone-6'
} | https://glaforge.appspot.com/article/handy-gradle-startup-script | CC-MAIN-2019-51 | refinedweb | 180 | 51.58 |
the ISE_DS/planAhead/scripts directory, there is a file named obsoleted.tcl and another named deprecated.tcl. What do these files do?
Can I use the commands listed in the files?
When a Tcl command is deprecated in the PlanAhead tool, it is still internally supported for two releases before being completely removed from the system. During this "deprecated" time, the command is placed in the deprecated.Tcl file. When a user runs a command found in the deprecated.tcl script, there is a deprecation message issued and the command is converted into the correct command available in the current version of thePlanAhead tool. This allows existing scripts to continue to run successfully while giving users the information needed to upgrade the scripts.
In ISE Design Suite 14.1, all of the Tcl commands from the hdi namespace were removed from the deprecated.tcl file and placed in a new file calledobsoleted.tcl.
Commands in the obsoleted.tcl file are not sourced automatically in the PlanAhead tool.With this change, scripts still using these older hdi:: commands will stop working.However, if you still want to use these commands rather than change their older script (or use the obsoleted.tcl script to get the recommended syntax for new commands), you can source the obsoleted.tcl script in the Tcl console; see (Xilinx Answer 47475)for more information. | http://www.xilinx.com/support/answers/47302.html | CC-MAIN-2017-43 | refinedweb | 227 | 59.5 |
hi
all i am new to programming i was going to pick python as a first language but a lot of people have been trying to talk me out of it. I was also thinking c# and php but cant make my mind up any advise would be greatful thank you
ngj35uk wrote:saying its out of date
saying its out of date
python tends to be slow. in most cases it fast enough but i perfer more speed.
I use it as a playground. nothing more.
int main();
{
printf(@"Hello World!");
}
print('Hello World!")
Hello World!
public class Hello {
public static void main(String []args) {
System.out.println("Hello World");
}
}
Return to General Discussions
Users browsing this forum: Google [Bot] and 3 guests | http://python-forum.org/viewtopic.php?f=9&t=11010 | CC-MAIN-2016-26 | refinedweb | 124 | 79.9 |
Let.
By Christian Cantrell
Created
September 24, 2003
I’d like the ability to spawn multiple threads in some way directly in CFML. A <cffork> tag or something like that. Yeah… that would be crazy awesome.
I second the cffork idea. ASP.Net has it, and I could REALLY use it!Other than that, here are some ideas from my list that I’ve been submitting for a few versions now:1. As mentioned by others, onSessionStart(), onSessionEnd(), onApplicationStart(), onApplicationEnd()2. Enhance the CF Scheduler so that it can better operate in a cluster. I’d like to see you be able to synchronize events between servers in a cluster so that you can setup a scheduled task on any server, and it would replicate out to all the other servers (similar to the budy server concept), but the event would only fire on a single server, not on all of them at once.3. Add support for interfaces to CFCs4. Add overloading for functions and CFCs5. Add a mechanism for dealing with name conflicts with built in CF functions/tags in order to future proof. So, if I already have a UDF called wrap(), upgrading my version of CF won’t break my app when CF get’s its own wrap() function.6. Add functions to programatically list all current sessions/applications on a server (without the workarounds we’re currently using)7. Work to build stronger partnerships with companies like IBM, Actuate, etc to get support for CF into their products8. Make ColdFusion’s security framework even more granular. Roles are nice, but I always need an additional level of security beyond that. How about groups, roles, and permissions. While you are at it, give us a way to programatically get a list of users currently logged in, their roles/permissions, etc.9. Add a function to show how much time is left before a session/application times out10. Add an IMAP tag!!!11. Add an NNTP tag12. Add native functions/tags for image manipulation13. Add native tags/functions for manipulating PDF14. Add the Lotus Notes JDBC driver, available free from IBM to the list of native drivers15. Add native tags/functions for dealing with Zip files16. Fix reFind() and reFindNoCase() functions to return the positions for all matched subexpressions17. Add a spell check tag
Actual OO support from the engineering team not your marketing dept. Do what the flash team did to ActionScript. Make CFSCRIPT an ECMA-262 strict language and marshal the built in classes into appropriate namespaces. This would be a HUGE step in the right direction.
Christian,How about a DataBinding tag which I can map my for form fields to a db for insert/update/delete/select. This mapping should allow the the data to be passed viajavascript thru a div/layer tag. This will allow my users to get data from a server-side process without a refresh. Hope this make sense….:)
- pump javacast full of steriods- resourceBundle functionality (bundle, list, etc.)- access protected java methods- better overall access to java methods (ie not have to write wrapper classes to dumb down existing java classes, i guess a beefier javacast might fix that)
- Better client side validation using javascript (not Java)- Easier coding/debugging of javascript validation on the client side (not an actual debugger, but a way of modifying the javascript being built by CF- A way to send out a .swf file from CF, not just for images created with the cfchart tag, but a way to say, create simple forms in flash that submit like an html form. May not be practical- public key encryption so we can 1) hide/disquise our code 2) possibly sell it either encrypted (and have it run encrypted, no source code visible, etC) or have the encrypted have a 1 time only installer key. If a good public key method is used, hopefully it will be hard for someone to crack it and steal/view source code.
+1 to events. People have been asking for _years_ to know when sessions start, end, when applications start, end, clients, and the server. The CF server knows this. Why can’t we?Also, getSessions(), getClients(), getApplications(). Again, the CF server has all this info – we need it as well.
- More robust scheduling engine with its own thread count setting.- Ability to invoke local objects as well as HTTP requests- Max thread count for scheduler- Config all cfmx instances in a cluster from one interface; ability to clone configs- Make scheduler “cluster aware”- spawn additional threads including a “max child process” parameter i.e. run multiple queries to diff datasources in parallel.
this was for the scheduler:- Ability to invoke local objects as well as HTTP requests- “cluster aware” means replicating scheduled items across instances, round robin in executing items, failover as well.
Method overloading- Unless my OO terminology is off, I believe this is possible currently. i.e. child object has same method as parent?
- Differentiate between Remoting and Web Service for “access”. i.e. webservice,remoting, or both
Add another vote to the following…Events, multi-threading, ECMA cfscript, more granular security, PDF tags, and Zip tags.Also, here’s a couple of my own…1. Ability to generate FlashPaper docs natively (preferably using very similar parameters/methods to the proposed CF PDF tags… see above)2. This is very vague… In all of your products, Please keep trying out new, experimental extra features (examples: CFCHART, FlashPaper) these are not make or break additions to the products, but they are a nice suprise when they suddenly appear in new product releases… plus, they really help us see MM is still going the extra mile.
I too would like to see Session, Application start/end events.It would also be nice to better utilize the underlying Java programming language within CF. How about a tag that would allow one to put Java directly into the page (i.e. <cfjava> ).Also, make all of the CF tags accessable from within CFScript (like CFQuery, CFLoginUser, etc.).
Array slicing, just like list slicing in Python (). For example <cfset foo = bar[1:3]> would set foo to array with the same elements as three first elements in bar array.Built in Array() and Struct() functions to quickly build arrays and structures. Like my UDFs:
How about:1) .NET request — compile code to run on CLI VM.2) Embeddable CF server for use on CD-ROMs / other software products.
Well, I second the requests for JavaCast to begin steroid cycles, Java-like Interfaces in CFCs, method overloading in CFCs, a better scheduler, and damn near everything Rob requested in general.I’d also like to second the ability to differentiate between Web Services and remoting, and also be able to control the style of web service that is generated (RPC/Document, Literal/Encoded), whether through some sort of tag/function or a setting in the Administrator, whatever – any way would be ducky. But you said to THINK BIG…Let’s see – thinking big here… I’d _really_ like it if ColdFusion could get me to work on Mondays! That’d be pretty freakin’ innovative for an app server, no? No? Aw, never mind…Oh yeah Stacy -What was meant by method overloading is the ability to have multiple methods in the _same_ CFC with the same names, but different signatures (useful for having multiple constructors for your object and things of that nature). Your scenario might be more succinctly described as “override” via inheritance.
- Like many, also a vote here for ECMA Syntax in CFScript- Also, dump those old form applets in favor of flash components (slider, grid, tree, etc.)
How about *one* kick-ass IDE to go with it? One that supports debugging (with step-through, watches, etc) such as with CF5 but is more stable. [See thread (of rants) on Camden's blog for more examples of what CF developers are asking for in an IDE; ie the best of HS+ and DW in one package].But back to the server side:1. CFC method overloading, for sure2. Enhancements to CFSCRIPT as mentioned above3. Clearer error messages4. Ability to disable java .class caching (see Forta’s Aug 3rd blog). Talk about annoying…Cheers,
make cfscript like actionscript 1.0 or 2.0;a real message services(like flash com but only text);Make a cf date object like jdo.better cfform;
I would beg for some sort of sharedObject between CF and FlashComm server. That way I can schedual a task in CF to check some data, and update the sharedObject on some condition. FlashComm can just sit there responding to onSynch and not have to keep polling the cf server.Plus all the other stuff on scheduling above…
Have a tag that will do the same thing as the 2SelectsRelated and 3SelectsRelated tags.
Hybrid Flash/HTML forms to allow the blending of Flash and CF elements in order to leverage the power of both simultaneously without having to move to pure Flash based forms or get stuck with JS based form elements. As above Flash could handle the 2 – 3 – n – selects related and the CF/HTML part of the form could handle enctype=”multipart/form-data” for uploads.
well if you’re going to improve cfform might as well ask mm to buy qForms. that does a better job with js only & it does it now. if you’re going to swap to flash widgets, make darned sure first that flash improves its unicode, especially bidi handling, before you do the swap.
i have a dream…All macromedia application for webserver:-Application server-Mail server-Ftp server-DNS server-Cluseterwith one administrator web-basedand……FlashPlayer (standalone) becomes a great BROWSERi’m waiting with hope…
- Image Manipulation Tag (for ALL regular imagetypes)- Socket Tag () to connect to other Systems easily- Replace Java Applets of CFForm with Flash- make sourcepath of accept variables, not only static paths
Other peoples ideas:- ECMA-262 strict for CFSCRIPT (bite the bullet) +2- Support for full CFML syntax inside CFSCRIPT +2- Events +1- Method Overloading +1My own:- Outer joins and other SQL syntax support in QoQ- JUnit equiv for CFCs- Auto generating UML models for CFCs (you managed JavaDoc)- An Ecplise plugin (I know DW people will complain but….)- CVS support in DW- A lighter, faster CFDUMP- Keep moving forward with CFLOGIN
Sorry one more…..- More wrappers for stuff out of the Apache project.
I would like to see cfquery recordsets return the column types and column sizes along with the column names (other languages have been providing this for years).Also, make CFCs more OO-like, private/public/protected data members, as well as what others mentioned previously.Ditto on a more granular Security Module, role based security is not helpful, we need the granularity and flexibility that a Privilege based model provides.And, Thanks! for continuing to enhance the great product that CF is!
A comprehensive, high-quality tag.
Sorry, that’s a big vague
Forgot HTML gets stripped… that was meant to be “A comprehensive, high-quality CFIMAGE tag”.
Tons of good suggestions here…events, sockets and listeners would be great, maybe the ability to use any flash component like a java applet is used, is that even possible?
- more meta data in query result variables- keep increasing QofQ abilities- increased session control, info- better debugging tools- please don’t waste your time making anything with javascript better; convert to Flash
Hybrid Flash/HTML forms, yeah! The ability to mix HTML form and Flash form elements would be awesome.Also, have a CF tag that lets you create a Flash form element and also control its behavior all from CF. Have some pre-defined types that map to HTML form elements. Be able to create it and set its initial value(s). Maybe have an attribute to assign a CFC to handle its behavior. In the CFC you could create event handlers as methods that match Flash’s methods (e.g. mouseDown).So, for example, you could create a Flash button on the fly with other HTML Form elements. Then create a custom CFC which handles the onClick event (I don’t know Flash, so forgive me if that isn’t the event name).
* Make client-side validation more robust in Javascript *and* in Flash…some of us don’t want to make our users install Flash (and in my case, I *can’t* have them installing it…I need the JavaScript code to be very reliable).* I’d like “private” variables in CFCs (not “protected”, but true “private”, the same as it is in C++)* I’d love a way to bundle my code into a compiled “thing” like an EXE or something that’s not easy to reverse engineer, but that doesn’t take a lot of extra time on my end to create. I want to protect my code easily and efficiently.* Currently with CFMX, we have to stop and restart the service if we make a change to the XML config files. I can’t always stop my web server like that, even for a second. I have some very high traffic, important servers and if they go down even for 2 minutes, it causes a lot of trouble. I’d love a “refresh Admin settings” button in CF Admin so if I edit the XML files, it reloads them and makes the changes WITHOUT stopping the CF Application service entirely.* Make the integrated debugging in the IDE *easy* to configure in real world situations. I’ve yet to meet a CF developer that uses the watch/step/breakpoint features in CFS because nobody can seem to configure it to work on real-world servers. Virtual mappings, security, session variables in the browser, needing quick access to my “bookmarks/favorites”, etc, all add a level of difficulty.* Some sort of auto-update feature for new versions of the help files in CFS (and CF server for that matter). When Adobe Acrobat has a new version, I get a popup telling me it’s there, and with ONE click, I get the new version installed. I want a “yes, install the latest help files and technotes” button that requires nothing else on my end. Just suck it off a web service from macromedia.com and have CFStudio know where to install it.* Integrated “tidy” support. Is it possible to do something ala Codesweeper, but all I want it to do is tell me if my file is XHTML compliant or not. Maybe 2 versions of this, 1 for the CFM source and 1 for the HTML output (built into the IDEs step-through debugger perhaps?)* There’s currently a “feature” where if a period exists on a line by itself inside the body of a CFMail tag, it will throw an error. Does it really HAVE to be that way?
(It’s tested for on forta.com’s CF test, and possibly in the CFMX cert test too.)* If I want to make a log file of the java thread info/errors, I have to start CFserver from a command line like so: cfstart > mylogfile.txt — can we make that a default log file so no extra work is required? It should be available just like the others.* One thing I have to do a lot is, write a popup window that runs a query, then sends the results back to a form field on the parent window. Example: I have a dropdown called “managers” and a 2nd called “employees”. If I click “Manager A”, I need the “employees” dropdown to populate with just his employees. Currently I have to write a new popup CFM file for every page, which hits the server again. Or I have to use a client side java applet (3rd party tool) to run the query from the client and send me back the data. These work except a) I don’t like reinventing the wheel (a new CFM page) every time. and b) the 3rd party applet I found to do the job, isn’t very intuitive. Is there any way CF can include a Javascript (or some other client side functionality) tool that let’s me run queries from the client, without refreshing the page, that’s easy to understand and use?* In Visual C++ I can do the following:asm{mov ax, 4push ax}…and break into assembly on the fly right in my cpp files. What about a similar tag for Coldfusion so I can jump directly into either JSP or Java, like so:[cf_java_inline]// do Java code here. call the awt classes directly, whatever.[/cf_java_inline][cf_jsp_inline]// do jsp code here.[/cf_jsp_inline]All the other suggestions above sound good to me too.Nolan
Stacy, re: overloading. You’re thinking of overriding (when a derived class has the same method name as the parent). Overloading is when you have multiple methods with the same name in the same class and the compiler has to choose between them. This is hard to do in general at runtime (and fairly hard to do at compile-time – C++ has hella complex rules for overloading and that all happens at compile-time).
This encapsulates some of the things people have been saying..1. Deprecate CFScript and Replace with ActionScript.2. More and better Flash integration/generation.3. Allow threading so we can do real asynchronous processing.4. Make more Java/J2EE compliant and friendly.5. Embrace code-behind and MVC.6. Allow more true OOP with ActionScript. (It won’t hurt the structural programmers.)
Client side CF…..Like JS, but in cfscript for client side interaction. Allow for form validation without a round-trip to the server. But, more like a Flash app with remoting/web service access to server files.
Official support on OSX regarding CFMX 6.1. Would like to see how well it performs on a G5.
Many of these have been mentioned, some have not:CFIMAPCFIMAGE – image info, and resizeMore Query of Query featuresCFZIP – create and browse zip, tar.gz filesCFTREE in flashCFGRID in flashResource Bundle functionCFSFTP tagWebDAV stuffFlashPaper/PDF tagsJavaCastCFNNTPMore OO Features in CFC’sMore deployable Applications (improved car files, more like war files) with a application.xml that has settings for CustomTag mappings, directory mappings, datasource settings, class path settings, cfx tag registration, and anything else I’m missing that would be nice to be application specific. If these were hot depoyable that would be cool too.Auto Update Feature for patches would be cool, and allow MM to push bug fixes faster and easier.
My wishes:Many have been already mentioned, but I guess voting for them doesn’t hurt.-Ability to push from CF to Flash Comm-Nested exception throwing between cfc ( now always throws exception that says previous method didn’t return its expected type. As it is today, I consider it a bug.)-Better error descriptions for exceptions thrown by CF to the Flash Gateway-cfmail support for mixed-part emails-ability to log not only in the log dir that is not accessible in shared environments-better web service support for complex types-Better cfscript (full tag support, mix java, “new” object instantiation, ECMA, operators)-Method overloading in CFCs-A LOT more OO-listeners-sockets-better CFFORM (at least xhtml compliant)-actually make all tags that output html xhtml compliant-wrappers for Apache projects-ability to set up class path and mappings without access to CF admin (again for shared environments)-scheduler not only making http requests, but instantiating objects or CFCs. No timeout for long tasks.-column type info for returned queries
I like the comments… lots of good ideas!My wishes:- Smart udf declaration… if exists, ignore rather than crash… or give override capability.- XML enhancements* XPath type navigation in addetion to structured navigation for data interaction. (Note: structure variable to XML [toString]… works fine… would be great to have XML to structure variable!!!)* Get CFDump so it shows arrays for XPaths correctly at ALL times… the issue is already logged.* Have xmlSearch so it works without declaring empty namespaces in things like RSS documents.- REPEAT: Session End/Application End ability- REPEAT: Alternate to Java Components in Flash (Grid, etc.)*** if we do threads… that will be great, just make sure the threads can terminate on session end rather than eating CPU if they wait on external information.
- Add more integration with RSS, that could make easier the integration.- Make a tag to access newsgroup- to get more info about a file.- Add more integration between PDF and Word documents, without have to work directly with COM Objects.- Give more suport to work with XML RPC.
Have a compiler so that a ColdFusion application can be compiled into an single ISAPI DLL. Lasso currently does this. It would be great to be able to give a client a binary then CFM templates. Even encrypted ones can be decrypted. Also an ISAPI DLL would run infinatly faster then CF interrpeter.
Have a compiler so that a ColdFusion application could be compiled into a single ISAPI DLL. Lasso currently does this. It would be great to give a client a binary, rather than giving them source code.
There are a lot of good suggestions here.Since you asked for innovation, I am going to be grandiose.I would like to see the ability for ColdFusion not just to call Flash, but to GENERATE Flash. In other words, make ColdFusion and Flash integration seamless. A CFFLASH tag. Make them two sides of the same coin. Note: With the Active Content changes, a CFFLASH tag would become incredibly beneficial, especially if the tag could access existing files and generate dynamic ones.I agree with the statements about deprecating CFSCRIPT for ActionScript 2.0.I want a CFIMAGE tag.I want a CFSTYLE tag.I want a CFJAVA tag.I want a CFJAVASCRIPT tag. The ability to use canned JavaScripts without coding them.I also agree with Stacy Young’s comments about the scheduler. I would like the scheduler to run my web log analyzer from the Command Prompt.I have had some issues with my hosting provider turning off CFFILE and CFDIRECTORY, which can cripple the functionality of an application. I would like to see a way to read a file into a variable or access it like a CFINCLUDE, for a file that is NOT in the web directory, which would have helped me immensely with a site where I couldn’t use CFFILE and CFDIRECTORY. I did a workaround using some custom tags, but it was very cumbersome.Also, and this is not a language issue, but a marketing one. ColdFusion gets a bad rep in some development circles (most of the people giving it that bad rep have no experience with CF, so they don’t know what they’re talking about). If you look at sites like hotscripts.com, you will notice that PHP scripts outnumber CF scripts by over 37 times (6283 vs. 168). ASP scripts outnumber CF scripts by almost 13 times (2145 vs. 168). I want to see MM start target web hosting providers and get CF supported on more hosts!!! If more websites CAN use CF, more developers will learn about CF and use CF instead of ASP and PHP, which will expand the number of CF developers. We would start seeing more and more sites developed in CF. CF is the best web language in the world. It is way easier to work with than PHP or ASP, and there is no good reason for there to be this kind of discrepancy between PHP and CF. I want to see CF become more of a mainstream language. Get more CF developers out there, and you will sell more copies of CF Server sold… plain and simple. After all, more often than not, developers drive purchases.Also, this is not a language issue, but a tool issue. I want DW and HS+ to be ONE tool!!! I have been using DW MX 2004, and although I HATED it when I started using it, I now use it a lot more than HomeSite+. However, there are still ways that HomeSite+ is VASTLY superior to DW. The help, the Query Builder (which is great if you don’t have any other way of connecting to the DB but through RDS), the ability to create new toolbars, VTML.Also, I want in on Betas. I run my own MMUG, and I can’t seem to get in on the betas. Sorry, that’s not really a language, marketing or a tool thing…
Instead of using the cumbersome CFIMPORT for custom tags, how about adding a “TAGPATH” attribute to the CFAPPLICATION tag so custom tags could be initialized in a single call throughout an entire site.
Native suppport of .NET classes/DLLs. While it is possible to use them through a COM bridge, this is extermely kludgy and has a huge performance impact. Montara seems to be on the right track with BlackKnight, but they don’t let you use .NET objects as true objects., the enumeration of sessions and applications would be extremely handy, as long as access can be controlled via the administrator. In other words, if I don’t want another application poking around other applicaitons on the server, I should be able to prevent this behavior. It could be a huge security hole if it were allowed.
Support for C# code for writing CF Tags.
Support for writing CF Tags with C# code.
cfdav: Customtag-Collection to work as WebDAV Client or as WebDAV-Server.
I would LOVE to see CF have the ability to access DB2/390 and DB2/400 via APPC (NOT through TCP/IP). I believe BEA WebLogic has a module that enables this, and think it would be a fantastic addition to CF. It would make MY life a lot simpler.. of course, if anyone has an idea how to do this now, please let me know
-Ryan
FLEX is FLASH APPLET written in XML perfect for CFMX but its going into another server
(crasy fools) Java Server faces is another applet replacement technology it maybe good for CF too. All the other stuff mentioned above is hidden under the skin of CFMX stuck inside java. I even used a Jabber client SMACK to IM in CF with only 3 lines of code. The problem now is hunting around in java to see what they got and then looking around to see what CF has. For example if java has it then CF has it too. CF has to come out with a client in SWF in the next version and that SWFwill look like java. I love to see the spawning happening from CFM into SWF clients using XML.
I agree with most of Rob’s list, except that I’d rather not see overloading for functions and CFC methods — I think they’re complex enough with optional arguments. Also, providing a good structure for managing functions and/or CFC’s can alleviate a lot of this and of the need for future-proofing, two things the onTap framework provides.A lot of other things have been suggested that I can’t really stand behind, some of them more than others, like deprecating cfscript in favor of ActionScript. I understand _why_ people would want this, but I’d rather just see improvements to CFScript that make it more like ActionScript or ECMA… There’s (imho) no point in changing the tag name and forcing everyone to replace all their existing cfscript tags with something else when you could just improve the engine for its contents. Some of the flash-related features being requested are liable to be covered by Flex once it’s available, so it’s tough to say how that will all work out in the end.More and or improved javascript features is a mixed bag – previous attempts at creating javascript features from the Allaire days proved in the long-run to be rather problematic, and I’d be moderately concerned that MM’s attempts at the same would be similar. Whereas there are a number of reasonably easy ways to create your own JS features and distribute them with CF’s existing API’s (custom tags, udf’s, cfc’s, etc.) which likely means better JS features _and_ it helps MM focus more energy on the server features that we don’t have the power to easily supplement. So I’d rather continue to use the custom JS features in something like the onTap framework and have MM focus the extra attention on things like cfimage, cfpdf, etc.Though lately one of my biggest frustrations is the lack of nulls in CF, so if nothing else I think I’d like to see nulls, although I realize that’s probably not an easy feature to add at this point.
You want a cool tag? Here is one. How about the ability to save the image, swf, etc that the cfchart tag generates to a predefined location.The biggest problem I have is, we generate a lot of reports for clients. reports are HTML based that get automatically emailed. We just save the source code for the consumer.Please, let me know what you think.
I’m a fan of ColdFusion, but I don’t consider it a “language.” If cfscript were ECMA-262, then I wouldn’t have to sneak over to Python to seel like a software engineer.I believe this change would also do much to insure the longevity of the product.
an external fast CF server installer for use on CD-ROMs and other software development .It would be great to be able to give a clienta standalone ColdFusion application .No more CFScript and Replace with ActionScript and ability to use CFQUERY and other Cf tag …OS level commands like Python
Hey, These are some great ideas. I would love a WEBDAV client in CF. Anybody actually working on any of these? | http://blogs.adobe.com/cantrell/archives/2003/09/whats_your_drea.html | CC-MAIN-2013-20 | refinedweb | 5,008 | 62.98 |
Steps: Overview
A web component that can be used to break a single goal down into dependable sub-tasks.
Features
- navigate between different steps with 'previous' and 'next' functions.
- keeps status of each step
- untouched
- entered
- left
- skipped
- options
- initial-step: Set to the first step of the flow, blocks calling
previousfunction.
- condition: Dynamic condition, when true the step is added to the flow.
- invert-condition: Inverts the condition set.
In many application you build multi-step workflows like multi-step forms where you want to split a long process into smaller steps making the user's perception of it and filling in data easier. The idea of this component is to provide a simple way to define such steps and transition from one step to another while saving data between them and to conditionally skip some steps based on the data.
Installation
npm i --save @lion/steps
import { LionSteps, LionStep } from '@lion/steps'; // or import '@lion/steps/define'; | https://lion-web.netlify.app/components/navigation/steps/overview/ | CC-MAIN-2021-17 | refinedweb | 159 | 52.6 |
This post will look at how to take an expression for a Boolean function and look for a simpler expression that corresponds to the same function. We’ll show how to use a Python implementation of the Quine-McCluskey algorithm.
Notation
We will write AND like multiplication, OR like addition, and use primes for negation. For example,
wx + z‘
denotes
(w AND x) OR (NOT z).
Minimizing expressions
You may notice that the expression
wx‘z + wxz
can be simplified to wz, for example, but it’s not feasible to simplify complicated expressions without a systematic approach.
One such approach is the Quine-McCluskey algorithm. Its run time increases exponentially with the problem size, but for a small number of terms it’s quick enough [1]. We’ll show how to use the Python module qm which implements the algorithm.
Specifying functions
How are you going to pass a Boolean expression to a Python function? You could pass it an expression as a string and expect the function to parse the string, but then you’d have to specify the grammar of the little language you’ve created. Or you could pass in an actual Python function, which is more work than necessary, especially if you’re going to be passing in a lot of expressions.
A simpler way is pass in the set of places where the function evaluates to 1, encoded as numbers.
For example, suppose your function is
wxy‘z + w‘xyz‘
This function evaluates to 1 when either the first term evaluates to 1 or the second term evaluates to 1. That is, when either
(w, x, y, z) = (1, 1, 0, 1)
or
(w, x, y, z) = (0, 1, 1, 0).
Interpreting the left sides as binary numbers, you could specify the expression with the set {13, 6} which describes where the function is 1.
If you prefer, you could express your numbers in binary to make the correspondence to terms more explicit, i.e.
{0b1101,
0b110}.
Using qm
One more thing before we use
qm: your Boolean expression might not be fully specified. Maybe you want it to be 1 on some values, 0 on others, and you don’t care what it equals on the rest.
The
qm module lets you specify these with arguments
ones,
zeroes, and
dc. If you specify two out of these three sets,
qm will infer the third one.
For example, in the code below
from qm import qm print(qm(ones={0b111, 0b110, 0b1101}, dc={}))
we’re asking
qm to minimize the expression
xyz + xyz‘ + wxy‘z.
Since the don’t-care set is empty, we’re saying our function equals 0 everywhere we haven’t said that it equals 1. The function prints
['1101', '011X']
which corresponds to
wxy‘z + w‘xy,
the X meaning that the fourth variable, z, is not part of the second term.
Note that the minimized expression is not unique: we could tell by inspection that
xyz + xyz‘ + wxy‘z.
could be reduced to
xy + wxy‘z.
Also, our code defines a minimum expression to be one with the fewest sums. Both simplifications in this example have two sums. But xy + wxy‘z is simpler than wxy‘z + w‘xy in the sense of having one less term, so there’s room for improvement, or at least discussion, as to how to quantify the complexity of an expression.
In the next post I use
qm to explore how much minimization reduces the size of Boolean expressions.
***
[1] The Boolean expression minimization problem is in NP, and so no known algorithm that always produces an exact answer will scale well. But there are heuristic algorithms like Espresso and its variations that usually provide optimal or near-optimal results.
3 thoughts on “Minimizing boolean expressions”
Karnaugh maps is how we did it by hand. Though also hard to do more than 4 variables. And they employ Gray codes :-)
You should have a look at the Boolean functionality built-in to the Wolfram Language:
Thanks for introducing the Python qm module.
In the Using qm section, you observe that the computed output is different from a visible simplification. Is the reason qm produces a different result than your observation because you implicitly tell qm that w is zero in the cases you pass to the ones argument?
Perhaps adding 0b1111 and 0b1110 to the ones input would produce the expected result.
>>> print(qm.qm(ones={0b111, 0b110, 0b1101}, dc={}))
[‘011X’, ‘1101’]
>>> print(qm.qm(ones={0b111, 0b110, 0b1101, 0b1111, 0b1110}, dc={}))
[’11X1′, ‘X11X’] | https://www.johndcook.com/blog/2020/11/19/minimizing-boolean-expressions/ | CC-MAIN-2021-21 | refinedweb | 759 | 69.72 |
Getting this error:
Makefile:835: recipe for target 'libccm_timeline_la_vala.stamp' failed
Disappeared after vala was installed.
Search Criteria
Package Details: cairo-compmgr-git 1:0.3.1.57.g416ae1a-3
Dependencies (8)
- libsm
- gtk2>=2.16.0 (gtk2-patched-filechooser-icon-view, gtk2-patched-gdkwin-nullcheck, gtk2-ubuntu)
- gconf (gconf-gtk2) (make)
- gettext (gettext-git) (make)
- git (git-git) (make)
- gtk-doc (make)
- vala (vala-git, vala0.26) (make)
- intltool>=0.41 (make)
Required by (0)
Sources (1)
Latest Comments
flashywaffles commented on 2015-06-05 11:49
Getting this error:
loserMcloser commented on 2015-05-28 22:35
Sure seems to need vala.
/bin/sh: valac: command not found
cgirard commented on 2015-05-20 12:27
No this use the newer branch without vala.
Osleg commented on 2015-05-20 10:40
The package requires vala as build dependency
ThePierrezou commented on 2015-04-28 18:29
Thank you verry much uchenic, this pkgbuild seem to work :)
uchenic commented on 2015-04-18 19:12
Proposed by delusionallogic PKGBUILD file
delusional commented on 2015-03-24 17:03
The error seems to be caused by the "clone" plugin. Disable that and it will run fine.
acgtyrant commented on 2015-02-11 04:42
I meet the error as Corax too~
Corax commented on 2014-12-21 14:26
I retried today (with a clean build directory), still the same, I get this when I try to launch cairo-compmgr:
0,000002:
0,000040: cannot add class private field to invalid type 'CCMClone'
0,002096: ??:0 ccm_log_print_backtrace()
0,002106: ??:0 g_logv()
0,002120: ??:0 g_log()
0,002124: ??:0 ccm_clone_register_type()
0,002127: ??:0 ccm_clone_get_plugin_type()
0,002131: ??:0 ccm_extension_loader_get_preferences_plugins()
0,002135: ??:0 ccm_preferences_page_new()
0,002138: ??:0 ccm_preferences_new()
0,002142: ??:0 ccm_tray_menu_new()
0,002145: ??:0 ccm_tray_icon_new()
0,002148: ??:0 main()
0,002151: ??:0 __libc_start_main()
0,002155: ??:0 _start()
0,516211:
0,516227: g_type_instance_get_class_private() requires a prior call to g_type_add_class_private()
0,518637: ??:0 ccm_log_print_backtrace()
0,518648: ??:0 g_logv()
0,518652: ??:0 g_log()
0,518656: ??:0 g_type_class_get_private()
0,518659: ??:0 ccm_output_new()
0,518662: ??:0 ccm_screen_plugin_load_options()
0,518666: [0x24ff] ??() ??:0
0,518669: ??:0 ccm_screen_plugin_load_options()
0,518673: ??:0 ccm_screen_plugin_load_options()
0,518676: ??:0 ccm_window_paint()
0,518679: ??:0 ccm_screen_new()
0,518682: ??:0 ccm_display_new()
0,518686: ??:0 ccm_tray_menu_new()
0,518689: ??:0 ccm_tray_icon_new()
0,518692: ??:0 main()
0,518696: ??:0 __libc_start_main()
0,518699: ??:0 _start()
0,520852: ??:0 ccm_log_print_backtrace()
0,520861: ??:0 ccm_preferences_page_plugin_init_utilities_section()
0,520866: sigaction.c:0 __restore_rt()
0,520869: ??:0 ccm_output_new()
0,520872: ??:0 ccm_screen_plugin_load_options()
0,520876: [0x24ff] ??() ??:0
0,520879: ??:0 ccm_screen_plugin_load_options()
0,520883: ??:0 ccm_screen_plugin_load_options()
0,520886: ??:0 ccm_window_paint()
0,520889: ??:0 ccm_screen_new()
0,520893: ??:0 ccm_display_new()
0,520896: ??:0 ccm_tray_menu_new()
0,520899: ??:0 ccm_tray_icon_new()
0,520902: ??:0 main()
0,520905: ??:0 __libc_start_main()
0,520909: ??:0 _start()
cgirard commented on 2014-11-17 16:55
It works from me. Try starting from a clean build directory.
Corax commented on 2014-11-09 18:30
Has anyone tried it with vala 0.26? Even before the PKGBUILD was updated I tried recompiling with vala 0.26 (modifying the PKGBUILD accordingly), but I had a runtime error when running cairo-compmgr, so I downgraded to 0.24 and recompiled again.
Xiaoming94 commented on 2014-10-28 14:35
configure: error: Package requirements (xcomposite,
xdamage,
xext,
xi,
x11,
ice,
sm,
xrandr,
gl,
cairo >= 1.8.0,
pixman-1 >= 0.16.0,
gtk+-2.0 >= 2.16.0
libvala-0.24 >= 0.18.0) were not met:
No package 'libvala-0.24' found
Got these errors while compiling
cgirard commented on 2014-05-30 12:21
Thanks filand and sorry for the delay
Xiaoming94 commented on 2014-05-26 10:23
@flland
Your patch your rejected for me for some reason
Got:
Hunk #1 FAILED at 55.
1 out of 1 hunk FAILED -- saving rejects to file src/ccm-debug.c.rej
:(
filand commented on 2014-05-26 08:12
Following patch helps. Please add folowing to 4.diff or create a separate patch (IMHO prefered):
diff --git a/src/ccm-debug.c b/src/ccm-debug.c
index 1b4d3d7..3fab8f5 100644
--- a/src/ccm-debug.c
+++ b/src/ccm-debug.c
@@ -55,8 +55,9 @@
#include <stdio.h>
#include <stdlib.h>
#include <execinfo.h>
+#include <libiberty/ansidecl.h>
+#include <libiberty/libiberty.h>
#include <bfd.h>
-#include <libiberty.h>
#include <dlfcn.h>
#include <link.h>
#endif /* HAVE_EDEBUG */
Xiaoming94 commented on 2014-05-19 21:17
Same build error as the two below.
Corax commented on 2014-05-18 13:11
Same here, a static assertion fails in multiple files:
G_STATIC_ASSERT (sizeof *(location) == sizeof (gpointer));
bsidb commented on 2014-05-09 00:26
Do you meet compile error? It fails to compile due to an error in
'Makefile:640: recipe for target 'ccm-debug.o' failed'
leong commented on 2014-04-15 14:35
vala0.22 to vala0.24 (2014-04-14) upgrade creates a broken dependency
A quick & dirty workaround (waiting for something better): change these 2 lines in PKGBUILD
sed -i 's!libvala-0.18!libvala-0.22!' configure.ac
sed -i 's!libvala-0.18!libvala-0.22!' vapi/cairo-compmgr.deps
to
sed -i 's!libvala-0.18!libvala-0.24!' configure.ac
sed -i 's!libvala-0.18!libvala-0.24!' vapi/cairo-compmgr.deps
Seems to work fine
cgirard commented on 2014-03-31 20:18
For reference:
cgirard commented on 2014-03-31 19:57
Nice! I'll update ASAP. Did you report upstream?
socke commented on 2014-03-31 19:50
I've fixed the build errors and posted the two patches with a new PKGBUILD in the german thread on:
cgirard commented on 2014-02-23 14:30
Xiaoming94: sorry but I still haven't find how to solve the error reported by Next7. The libiberty error is easy to fix (just replace libiberty.h by libiberty/libiberty.h in the include) but I cannot release a new version which still does not compile.
Xiaoming94 commented on 2014-02-22 21:49
I Get the same Compilation error as dnf
cgirard commented on 2014-01-07 14:02
I have tried a fix which works on cairo-compmgr PKGBUILD but not on the git version (I am hitting the compilation error given by Next7 below).
cgirard commented on 2014-01-07 14:00
Fixed (thanks to xartii)
dnf commented on 2014-01-05 17:54
build() ends up with error:
ccm-debug.c:59:23: fatal error: libiberty.h: No such file or directory
#include <libiberty.h>
I have found the file in:
/usr/include/libiberty.h
Apparently, other users had the same problem, as described here (in German language):
Any sugestions how to build it?
Next7 commented on 2013-12-02 04:01
The package fails to build with vala-0.22.1-1. Any suggestions?
===
cairo-compmgr.vapi:484.9-484.33: error: overriding method `CCM.Window.query_opacity' is incompatible with base method `CCM.WindowPlugin.query_opacity': incompatible type of parameter 1.
public void query_opacity (bool deleted);
^^^^^^^^^^^^^^^^^^^^^^^^^
cairo-compmgr.vapi:494.9-494.37: error: overriding method `CCM.Window.set_opaque_region' is incompatible with base method `CCM.WindowPlugin.set_opaque_region': incompatible type of parameter 1.
public void set_opaque_region (CCM.Region region);
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
cairo-compmgr.vapi:273.9-273.30: error: overriding method `CCM.Screen.add_window' is incompatible with base method `CCM.ScreenPlugin.add_window': incompatible type of parameter 1.
public bool add_window (CCM.Window window);
^^^^^^^^^^^^^^^^^^^^^^
cairo-compmgr.vapi:274.9-274.33: error: overriding method `CCM.Screen.remove_window' is incompatible with base method `CCM.ScreenPlugin.remove_window': incompatible type of parameter 1.
public void remove_window (CCM.Window window);
^^^^^^^^^^^^^^^^^^^^^^^^^
ccm-window-animation.vala:322.27-322.29: warning: Gtk is deprecated. Use gtk+-3.0
Compilation failed: 4 error(s), 2 warning(s)
Makefile:569: recipe for target 'libccm_window_animation_la_vala.stamp' failed
make[2]: *** [libccm_window_animation_la_vala.stamp] Error 1
make[2]: Leaving directory 'aur/cairo-compmgr-git/src/cairocompmgr/plugins/window-animation'
Makefile:429: recipe for target 'all-recursive' failed
make[1]: *** [all-recursive] Error 1
make[1]: Leaving directory 'aur/cairo-compmgr-git/src/cairocompmgr/plugins'
Makefile:499: recipe for target 'all-recursive' failed
make: *** [all-recursive] Error 1
==> ERROR: A failure occurred in build().
Aborting...
cgirard commented on 2013-11-12 11:41
@ckozler: there is not much I can do. Please report this directly to upstream.
ckozler commented on 2013-11-09 23:56
Hi -
First off thank you for providing this package- it really is lightweight and great!
However, after I moved from xf86-video-ati to catalyst-hook/catalyst driver on xorg 1.3 I can no longer seem to run this. Stack trace is below - please let me know what else you need from me to help solve this
┌─[18:54:01]─[ckozler@localhost]
└──> cairo-compmgr-git $ >> cairo-compmgr
Xlib: extension "RANDR" missing on display ":0.0".
0.000002:
0.000516: IA__gtk_widget_set_colormap: assertion 'GDK_IS_COLORMAP (colormap)' failed
0.004024: ??:0 ccm_log_print_backtrace()
0.004067: ??:0 g_logv()
0.004091: ??:0 g_log()
0.004137: ??:0 ccm_preferences_new()
0.004155: ??:0 ccm_tray_menu_new()
0.004174: ??:0 ccm_tray_icon_new()
0.004193: ??:0 main()
0.004211: ??:0 __libc_start_main()
0.004229: ??:0 _start()
0.006077:
0.006111: g_object_unref: assertion 'G_IS_OBJECT (object)' failed
0.009137: ??:0 ccm_log_print_backtrace()
0.009173: ??:0 g_logv()
0.009196: ??:0 g_log()
0.009239: ??:0 ccm_window_new()
0.009259: ??:0 g_object_unref()
0.009276: ??:0 ccm_display_new()
0.009295: ??:0 ccm_tray_menu_new()
0.009312: ??:0 ccm_tray_icon_new()
0.009329: ??:0 main()
0.009348: ??:0 __libc_start_main()
0.009364: ??:0 _start()
0.009383:
0.009394: g_object_unref: assertion 'G_IS_OBJECT (object)' failed
0.012055: ??:0 ccm_log_print_backtrace()
0.012079: ??:0 g_logv()
0.012094: ??:0 g_log()
0.012109: ??:0 ccm_window_new()
0.012124: ??:0 g_object_unref()
0.012138: ??:0 ccm_display_new()
0.012152: ??:0 ccm_tray_menu_new()
0.012166: ??:0 ccm_tray_icon_new()
0.012181: ??:0 main()
0.012195: ??:0 __libc_start_main()
0.012209: ??:0 _start()
0.012236:
0.012251: Composite init failed for (null)
0.014746: ??:0 ccm_log_print_backtrace()
0.014780: ??:0 g_logv()
0.014801: ??:0 g_log()
0.014844: ??:0 ccm_display_new()
0.014862: ??:0 ccm_tray_menu_new()
0.014882: ??:0 ccm_tray_icon_new()
0.014901: ??:0 main()
0.014918: ??:0 __libc_start_main()
0.014936: ??:0 _start()
cgirard commented on 2013-10-09 09:49
Only corrected the vala dep. mesa-libgl provides libgl but other packages provide it as well.
torors commented on 2013-10-08 15:48
After upgrade (okt. 2013) I think those lines must bee changed:
depends=("gtk2>=2.16.0" "vala>=0.20" libsm libgl)
to
depends=("gtk2>=2.16.0" "vala>=0.20" libsm mesa-libgl)
and:
sed -i 's!libvala-0.18!libvala-0.20!' configure.ac
sed -i 's!libvala-0.18!libvala-0.20!' vapi/cairo-compmgr.deps
to
sed -i 's!libvala-0.18!libvala-0.22!' configure.ac
sed -i 's!libvala-0.18!libvala-0.22!' vapi/cairo-compmgr.deps
cgirard commented on 2013-08-04 08:56
Or not... crayZsaaron, please read the wiki about AUR guideline. base-devel are implicit dependencies.
crayZsaaron commented on 2013-08-03 21:37
autoconf, automake, and libtool should be added to the dependencies - The build script relies on autoreconf and aclocal, and libtool is required in configure.ac.
Thanks for contributing, though!
benjiprod commented on 2013-04-22 21:15
vala-0.20 is out
Need to fix sed replacement to libvala-0.20 as cairo-compmgr
cgirard commented on 2013-01-20 18:23
Fixed.
@sporkasaurus: it should fix your issue as well.
cgirard commented on 2013-01-20 18:23
Fixed.
@sporkasaurus: it should fixed your issue as well.
Anonymous comment on 2013-01-18 14:32
/usr/lib/gcc/x86_64-unknown-linux-gnu/4.7.2/../../../../lib/libbfd.a(compress.o):function bfd_compress_section_contents: error: undefined reference to 'compressBound'
/usr/lib/gcc/x86_64-unknown-linux-gnu/4.7.2/../../../../lib/libbfd.a(compress.o):function bfd_compress_section_contents: error: undefined reference to 'compress'
/usr/lib/gcc/x86_64-unknown-linux-gnu/4.7.2/../../../../lib/libbfd.a(compress.o):function bfd_get_full_section_contents: error: undefined reference to 'inflateEnd'
/usr/lib/gcc/x86_64-unknown-linux-gnu/4.7.2/../../../../lib/libbfd.a(compress.o):function bfd_get_full_section_contents: error: undefined reference to 'inflateInit_'
/usr/lib/gcc/x86_64-unknown-linux-gnu/4.7.2/../../../../lib/libbfd.a(compress.o):function bfd_get_full_section_contents: error: undefined reference to 'inflate'
/usr/lib/gcc/x86_64-unknown-linux-gnu/4.7.2/../../../../lib/libbfd.a(compress.o):function bfd_get_full_section_contents: error: undefined reference to 'inflateReset'
collect2: error: ld returned 1 exit status
make[2]: *** [cairo-compmgr] Error 1
make[2]: Leaving directory `/home/koss/Downloads/cairo-compmgr-git/src/cairocompmgr-build/src'
make[1]: *** [all] Error 2
make[1]: Leaving directory `/home/koss/Downloads/cairo-compmgr-git/src/cairocompmgr-build/src'
make: *** [all-recursive] Error 1
==> ERROR: A failure occurred in build().
Aborting...
Anonymous comment on 2013-01-16 00:56
Hey guys, am having alot of trouble compiling this. Please see whats in the pastebin. Seems to be different than the issue everyone else is reporting. Any help would be most appreciated.
FoolEcho commented on 2013-01-12 12:10
To compile and link correctly, you need to add -lz to the LIBS (like for the no-git package).
cgirard commented on 2012-11-14 09:37
Well, thanks!
I'm afraid it will. If anyone know how to properly handle this I'm all ear.
DaveCode commented on 2012-11-13 23:27
OK thank you for clarifying what happened to me. It was a freak glitch. Will it happen whenever vala version number bumps?
I would still like the PKGBUILD to check deps before download/build steps. I'm not sure it's possible but it would help.
Thank you so much, you make Arch a happy place for us.
cgirard commented on 2012-11-13 09:24
The PKGBUILD does work out of the box. When you tested vala had just been updated in Arch repos but the dependency check not changed in upstream source files. That is why it failed.
What I meant by more strict was putting something like "vala=0.18" but it would mean that whenever vala is updated in the repo you would not be able to install the update without uninstalling cairo-compmgr-git.
People using vala-git have to edit the PKGBUILD and only them.
DaveCode commented on 2012-11-13 06:19
@cgirard: I meant to communicate something else and think you even got strictness backwards, let me explain.
The PKGBUILD doesn't work out of the box, period, regardless of vala version, stock or -git. It should work with one or the other (or both). Any PKGBUILD should work without edits. This one needs edits no matter which vala is installed. So it fails to track the Arch ecosystem in any way at all.
Pick stock or -git vala and run with it, or allow any version of vala. If anything, I propose less strictness, not more. Thanks again!
cgirard commented on 2012-11-04 20:31
@DaveCode: I could make the vala dependency more strict but it would annoy the user at each vala update. Not sure it is really better...
DaveCode commented on 2012-11-02 12:12
Thank you for maintaining the package. Here is my report. It fails with stock Arch vala 0.18.0-1, for maybe the same reasons as vala-git, I don't know. It builds against stock Arch vala 0.18.0-1 by changing the 0.20's to 0.18's in the commented-out sed commands, and uncommenting same. So whether one uses stock vala or vala-git one needs to edit this PKGBUILD.
Can the PKGBUILD check all deps first, avoiding so many download/build steps before bailing on a missing dep?
Thank you for your efforts in the AUR.
hplgonzo commented on 2012-10-30 13:20
@cgirard: building with vala-git. thx for adding the commented section.
cgirard commented on 2012-10-29 10:53
Switched to a different git repo (more up-to-date). Please remove your src dir before rebuilding (or it won't switch remote git).
@hplgonzo: I've added a commented section that should do what you have asked (not tested).
hplgonzo commented on 2012-10-28 10:13
not building with vala-git (libvala-0.20.so) anymore since last update.
missing possibility to change version in the PKGCONFIG's sed commands from 16 to 20.
hplgonzo commented on 2012-10-28 10:05
not building with vala-git (libvala-0.20.so) anymore since last update.
missing possibility to change version in the PKGCONFIG's sed commands from 16 to 20.
hplgonzo commented on 2012-10-28 10:04
not working with vala-git (libvala-0.20.so) anymore since last update.
missing possibility to change version in the PKGCONFIG's sed commands from 16 to 20.
cgirard commented on 2012-10-15 21:52
@benjiprod: the git url is already set to: git://git.tuxfamily.org/gitroot/ccm/cairocompmgr.git
benjiprod commented on 2012-10-15 21:46
Doesn't work because the good git name is :
name_git : cairo-compmgr
git://git.tuxfamily.org/gitroot/ccm/cairocompmgr.git
cgirard commented on 2012-05-01 17:14
@buergi: yes right.
@sleepforlife: Could you please run: "LANG=C makepkg -s" and post the output?
@donniezazen: Just remove cairo-compmgr-git before building it.
buergi commented on 2012-05-01 16:46
Note to compile it with vala-git(which provides libvala-0.18.so) just change the version in the PKGCONFIG's sed commands from 16 to 18 and fix the depends-line.
donniezazen commented on 2012-05-01 16:09
Install or build missing dependencies for cairo-compmgr-git:
resolving dependencies...
looking for inter-conflicts...
:: vala and vala-git are in conflict. Remove vala-git? [y/N] y
error: failed to prepare transaction (could not satisfy dependencies)
:: cairo-compmgr-git: requires vala-git
sleepforlife commented on 2012-05-01 15:58
cm-timeline.c:1105:8: error: stray '\260' in program
ccm-timeline.c:1105:15: error: expected ';' before 'MEL'
ccm-timeline.c:1105:15: error: stray '\304' in program
ccm-timeline.c:1105:15: error: stray '\260' in program
make[1]: *** [ccm-timeline.lo] Hata 1
make[1]: `/tmp/yaourt-tmp-sleepforlife/aur-cairo-compmgr-git/src/cairocompmgr-build/lib' dizininden çıkılıyor
make: *** [all-recursive] Hata 1
==> HATA: build() içinde bir hata oluştu.
Çıkılıyor...
==> ERROR: Makepkg was unable to build cairo-compmgr-git.
==> Restart building cairo-compmgr-git ? [y/N]
==> ------------------------------------------
cgirard commented on 2012-04-25 15:08
I've read your comments and will update the PKGBUILD ASAP. Switching back to extra/vala seems a good idea.
ewaller commented on 2012-04-25 15:03
I can confirm that on my system, a 64 bit system with testing repositories enabled, that cairo-compmgr does not pkgbuild "Out of the box"
On my system, I used aur/vala-git rather than extra/vala. To link, I required Kulpae's 19 April 12 patch to the PKGBUILD.
Works dandy.
Anonymous comment on 2012-04-24 10:33
Seems to build okay with vala 0.16.0-1 that is in extra now. I changed the sed lines in the PKGBUILD to 0.16 instead of 0.18 and the depends line to vala>=0.16 instead of vala-git.
Also had to make the change to LIBS as suggested by kulpae below, in the PKGBUILD file.
kulpae commented on 2012-04-19 11:43
I had to link to libgmodule-2.0 to make it build:
(because of "ccm-extension.o: undefinied reference to symbol 'g_module_symbol'")
./autogen.sh --prefix=/usr LIBS="-ldl -lgmodule-2.0"
cgirard commented on 2012-04-03 15:54
"==> ERROR: Makepkg was unable to build vala-git." : this is an error with vala-git build not cairo-compmgr-git
donniezazen commented on 2012-04-03 15:18
./autogen.sh: line 10: valac: command not found
**Error**: You must have valac >= 0.12.0 installed
to build vala. Download the appropriate package
from your distribution or get the source tarball at
==> ERROR: A failure occurred in build().
Aborting...
==> ERROR: Makepkg was unable to build vala-git.
Anonymous comment on 2012-04-03 14:45
@zertyz
I met the same problem and now it's fixed. I compiled vala-git 20120216-1 and libvala was updated to 0.18 version. Change the version number in following lines would help.
sed -i 's+vala-0.10+libvala-0.12+' configure.ac
sed -i 's+vala-0.10+libvala-0.12+' vapi/cairo-compmgr.deps
zertyz commented on 2012-03-31 17:57
build is failing with "No package 'libvala-0.16' found"
cgirard commented on 2012-03-07 11:32
"valac" is provided by vala-git. I don't understand how you can be in a state where makepkg try to build without installed dependencies.
I'll have a look to see if there is something else wrong.
segrived commented on 2012-03-06 18:34
can't install. now this package requires "valac"
cgirard commented on 2012-02-16 13:43
OK. Corrected.
buergi commented on 2012-02-15 22:27
+1 for bch24's solution, i had the same problem
bch24 commented on 2011-12-22 11:38
Was unable to build using yaourt.
Had to modify PKGBUILD and edit:
./autogen.sh --prefix=/usr
to
LDFLAGS+="/usr/lib/libdl.so" ./autogen.sh --prefix=/usr
to compile and install without errors.
cgirard commented on 2011-09-22 22:22
Switched to vala-git waiting vala to be updated.
Anonymous comment on 2011-09-21 10:46
vala is out of date
change it into vala-git
libvala could not found
cgirard commented on 2011-03-17 10:02
Corrected. Thanks for the head up.
haawda commented on 2011-03-16 21:18
I had to put
sed -i 's+vala-0.10+libvala-0.12+' configure.ac
sed -i 's+vala-0.10+libvala-0.12+' vapi/cairo-compmgr.deps
before the autogen.sh call to make this build. Otherwise there are complaints about missing vala-0.10. We have 0.12 in the repos. If you change that, also the depends array should reflect this.
We usually prefer install -d over mkdir -p.
cgirard commented on 2010-11-04 14:02
Thanks.
Done.
bcat commented on 2010-11-04 04:39
The Vala patch has been integrated upstream, so now the package won't build until it's removed.
cgirard commented on 2010-10-13 16:42
I've improved the package following cairo-compmgr in community as a guideline.
Det commented on 2010-09-29 14:41
Lol, I now got my name on an official package.
cgirard commented on 2010-09-29 09:35
Because it has been promoted to the community repo:
Det commented on 2010-09-29 08:24
Huh, why was cairo-compmgr removed? Didn't find anything on the mailing list.
cgirard commented on 2010-09-28 09:23
Right. Thank you for the remember.
Det commented on 2010-09-28 09:20
Should probably be mentioned in the bug report you filed?:
cgirard commented on 2010-09-27 20:55
OK. I'll add the relevant option to the PKGBUILD then.
Anonymous comment on 2010-09-27 19:30
"Try removing your '-j3' option in your "MAKEFLAGS""
==============================
Yes, successfully build git-version!
cgirard commented on 2010-09-27 18:45
Yes but the bug could have been introduced upstream between both versions.
Try removing your '-j3' option in your "MAKEFLAGS".
I don't know why but I got a similar .h file not found when using '-j5'.
Anonymous comment on 2010-09-27 18:21
hmm, but cairo-compmgr 0.3.0 () I have now successfully build...
my makepkg.conf
cgirard commented on 2010-09-27 18:05
Ok. I was thinking of a bug with a previous version of automake...
The new error makes me think of some strange behaviour I had when changing some options in my /etc/makepkg.conf. Could you post yours ?
Is anybody able to compile cairo-compmgr on a 32 bits system ?
Anonymous comment on 2010-09-27 17:59
o_O new error)))
Anonymous comment on 2010-09-27 17:56
automake (GNU automake) 1.11.1
cgirard commented on 2010-09-27 17:50
Sorry I was meaning 'automake --version'
Anonymous comment on 2010-09-27 17:13
[catalyst@catalyst ~]$ automake -v
automake: `configure.ac' or `configure.in' is required
cgirard commented on 2010-09-27 15:42
@catalyst: what is your automake version (automake -v) ?
Anonymous comment on 2010-09-26 17:11
yes, 32-bit vala
Det commented on 2010-09-26 09:54
With cairo-compmgr there was also a compilation issue complaining about a non-existing library: "configure.ac:130: warning: macro `AM_GCONF_SOURCE_2' not found in library".
Clearly that message was about gconf and this one about vala ("AM_PROG_VALAC"). So 32-bit vala issue perhaps?
Det commented on 2010-09-24 20:25
Wait... so the configure.ac patch actually fixes that? How is that possible? They share the same source.
Det commented on 2010-09-24 18:17
Maybe the configure.ac patch should be applied for 32-bit users until fixed upstream?:
[ "$CARCH" = "i686" ] && [patch-configure.ac]
cgirard commented on 2010-09-24 14:21
OK. As I don't think this bug is related to the package itself, I've opened a bug upstream:
Anonymous comment on 2010-09-23 18:41
Det commented on 2010-09-23 17:58
Catalyst, please use pastebin with build logs too. Your post is _really_ long.
Det commented on 2010-09-23 17:58
Catalyst, please use pastebin with build logs too. The "Please..." comment should also mention build logs instead of just PKGBUILDs, patches and scripts.
Det commented on 2010-09-23 13:26
People shouldn't use Yaourt either way. It's kinda buggy.
cgirard commented on 2010-09-23 08:50
OK. Waiting for it.
Anonymous comment on 2010-09-23 08:35
I have cleared all, but it is impossible in any way. I use yaourt. A full system update has made yesterday
The full log of error I will lay out later
cgirard commented on 2010-09-23 07:48
Could you please post a log of the error? What AUR helper are you using if you're using one ? Have you tried to delete the folder where files are pulled from git to be sure you have not fiddled with them.
cgirard commented on 2010-09-23 05:51
Seems strange. The bug is corrected upstream. I've changed the branch it pulls when a first checkout has already been done.
Anonymous comment on 2010-09-23 03:56
For me doesn't work. It is necessary to make a patch configure.ac
cgirard commented on 2010-09-22 19:02
Well I'm adopting it then. Let me now if this new version is not working.
Det commented on 2010-09-22 16:46
No, I'm... not going to do that... o_O
Anonymous comment on 2010-09-22 16:12
Det take away
Det commented on 2010-09-22 16:01
Hardly anybody _needs_ to maintain a package. Bumped for starters.
Anonymous comment on 2010-09-22 15:51
))) guys so сan pick up this package, I do not need
Det commented on 2010-09-22 15:11
K, good to know.
cgirard commented on 2010-09-22 15:00
The link I provided is a version between "origin" and "master" in the upstream tree. The pkgbuild sync on the "origin".
Det commented on 2010-09-22 14:48
I was just thinking about the same thing :l...
E: the vala-required thingy has already been fixed upstream. Actually doesn't the link you provided show the "upstream tree" (is that even a nearly correct term?) anyways?
E2: Here's the new package tarball with the correct patching scheme and proper dependencies:
Det commented on 2010-09-22 14:45
I was just thinking about the same thing :l...
E: the vala-required thingy has already been fixed upstream.
E2: Here's the new package tarball with the correct patching scheme and proper dependencies:
Det commented on 2010-09-22 14:37
I was just thinking about the same thing :l...
E: the vala-required thingy has already been fixed upstream.
Det commented on 2010-09-22 14:36
I was just thinking about the same thing :l...
cgirard commented on 2010-09-22 14:27
I will.
But I don't understand the purpose of maintaining AUR packages if you cannot do it by yourself.
Anonymous comment on 2010-09-22 13:56
please will make patch configure.ac and give me PKGBUILD
cgirard commented on 2010-09-22 09:14
Some corrections:
* You should apply the patch after copying the git folder because it complies with the guidelines and because as it is today it avoids rebuilding twice the package (the patch cannot be applied twice)
* configure.ac need to be patched, as done here (vala version):;a=commitdiff;h=06d2dea6cf28c27c11a268f6631ddfb84dd5229d
Det commented on 2010-09-21 18 there very weird..
Anonymous comment on 2010-09-21 18:08
((((((
Det commented on 2010-09-21 17:32
:DD
Anonymous comment on 2010-09-21 17:18
I don't know a fucking english))
Det commented on 2010-09-21 15:59
Still compiles fine here. Have you 'pacman -Syu'd lately? Cleaned your build environment?
Also this probably sounds so pedantic that you "facepalm" your ass of but "not compiled" isn't really proper English grammar - it sounds like you hadn't done it yet. It should be something like "the build fails", "compilation fails", "unable to compile", "can't compile", "doesn't compile" and so on <:).
Anonymous comment on 2010-09-21 13:41
updated. Not compiled...
==> ERROR: Makepkg was unable to build cairo-compmgr-git.
Anonymous comment on 2010-09-21 12:09
thanks, all ok. This evening I will update
Det commented on 2010-09-21 11:45
Really? Well, here you go:
E: Just tried the former link with two different proxies and sure enough, I couldn't download it with either on of them. Perhaps I'm doing something wrong with MediaFire...
Det commented on 2010-09-21 11:41
Really? Well, here you go:
Anonymous comment on 2010-09-21 11:34
Det I can not download this... please upload this file to another host
Det commented on 2010-09-21 11:07
Here's the full thing (tarball): - flagging until fixed.
Anonymous comment on 2010-09-20 16:21
As Det said, the fix is straightforward (one line). Within the build directory there is a file vapi/cairo-compmgr.deps - just change the line 'vala-1.0' to 'vala-0.10'. Make a diff file using diff -u. Then within the PKGBUILD add lines to patch said file with your saved diff.
Det commented on 2010-09-17 14:58
Sure, just rename or symlink all the "0.10" stuff to "1.0" (rather ugly to do that manually, though, since you'd also need to manually remove all that stuff when removing vala(-devel) with pacman). OR apply a patch to this thing to look for the "1.0" stuff from the "0.10" dirs.
Det commented on 2010-09-17 14:57
Sure, just rename or symlink.
Det commented on 2010-09-17 14:56
Sure, just rename.
Anonymous comment on 2010-09-17 06:00
So it is possible to make?
Det commented on 2010-09-17 05:54
The stuff with even vala 0.9.8 (the latest one) is installed using the "vala-0.10" name. That is way even vala 0.9.8 won't work.
Anonymous comment on 2010-08-29 16:53
not compiled...(( where to find vala 0.10???
Anonymous comment on 2010-08-27 08:10
I don't know if it's some sort of dual versioning on vala's part, because I tried installing an older version of cairo-compmgr aswell, and then it complained over not finding vala-0.1.
I removed the 'vala-devel' package I had installed from AUR, and installed version 0.8.1 from the official repositories instead, and the older cairo-compmgr installed fine.
Anonymous comment on 2010-08-26 18:22
hmm...
Anonymous comment on 2010-08-26 10:42
Got this when I tried to compile it:
configure: error: Package requirements (xcomposite,
xdamage,
xext,
xi,
sm,
cairo >= 1.8.0,
pixman-1 >= 0.16.0,
gtk+-2.0 >= 2.16.0
vala-0.12 >= 0.9.7) were not met:
No package 'vala-0.12' found
The latest version of vala isn't new enough?
Anonymous comment on 2010-08-11 18:06
updated
Det commented on 2010-08-10 21:52
Please update the PKGBUILD:
Det commented on 2010-08-10 21:51
Please update the PKGBUILD:
Runiq commented on 2010-06-04 12:17
I have the following depends & makedepends:
depends=('cairo' 'libxcomposite')
makedepends=('gtk-doc' 'intltool' 'cvs')
And it compiled and worked fine.
Anonymous comment on 2010-04-20 12:49
Maybe move some of the deps to optdeps, since it can compile just fine without libgnomeui, etc.
maxi_jac commented on 2010-03-28 15:49
You should add 'cvs' to the makedepends, it is necessary for ./autogen.sh
orivej commented on 2010-03-25 01:01
arch=('any') is a nice idea, but since it is meant to be used for architecture independent packages (see ‘man PKGBUILD’), you should better use arch=('i686' 'x86_64') by default. | https://aur.archlinux.org/packages/cairo-compmgr-git/?ID=30042&comments=all | CC-MAIN-2017-47 | refinedweb | 5,561 | 61.73 |
A Microsoft Program Manager on Visual Studio Platform (and an underground coder, lifehacker, hockey player)
The
You can also search from the Team menu..
When a search is performed, the active Team Foundation Server is used. Using @Project in the template will cause the search to be run against the active project (even though it may not in the WIQ template)..
Wish TFS didn't lock up the VS UI when running a work item query....
References
Here are the references I found helpful in creating this tool.
Conclusion
Hope you find it useful. If so, post a little comment... :)
Note: This is not an official Microsoft product or Power Toy. Search capabilities may be in the next version of the product, I don't know yet.
If you would like to receive an email when updates are made to this post, please register here
RSS :-)
Just one possible extra feature: being able to search with more restrictions, for instance searching only "open" work items and ignore closed etc.
Ignore my previous comment :-) 'run' button for the mouse?
2. Doing a text search runs on ALL projects even when a specific project is selected.
Thanks
Great little tool. Just works. Should be part of the product :-) 'Search\MSEnvShared\Addins and it works now fine!
%VSMYDOCUMENTS% is on a network drive and I suspect that the customer I am currently working for has added some restrictions on this folder...\Visual Studio 2005\Add\Visual Studio Codename Orcas\Addins" and puts the necessary files there. However the release version of Orcas creates: "..\My Documents\Visual Studio 2008" folder. The installer for the tool was created during the beta releases of Orcas, so that makes sense.
The Solution:
Just move the Addins folder under "..\My Documents\Visual Studio Codename Orcas" ---> "..\My Documents\Visual. :-)
Minor change request: Is there a general way to lookup for missing namespaces? It would help if the installation process and the startup process would find and report missing namespaces. | http://blogs.msdn.com/noahc/archive/2007/03/08/search-work-items-team-system-addin.aspx | crawl-002 | refinedweb | 330 | 65.83 |
The K means clustering algorithm is typically the first unsupervised machine learning model that students will learn.
It allows machine learning practitioners to create groups of data points within a data set with similar quantitative characteristics. It is useful for solving problems like creating customer segments or identifying localities in a city with high crime rates.
In this tutorial, you will learn how to build your first K means clustering algorithm in Python.
Table of Contents
You can skip to a specific section of this Python K means clustering algorithm using the table of contents below:
- The Data Set We Will Use In This Tutorial
- The Imports We Will Use In This Tutorial
- Visualizing Our Data Set
- Building and Training Our K Means Clustering Model
- Making Predictions With Our K Means Clustering Model
- Visualizing the Accuracy of Our Model
- The Full Code For This Tutorial
- Final Thoughts
The Data Set We Will Use In This Tutorial
In this tutorial, we will be using a data set of data generated using
scikit-learn.
Let’s import
scikit-learn’s
make_blobs function to create this artificial data. Open up a Jupyter Notebook and start your Python script with the following statement:
from sklearn.datasets import make_blobs
Now let’s use the
make_blobs function to create some artificial data!
More specifically, here is how you could create a data set with
200 samples that has
2 features and
4 cluster centers. The standard deviation within each cluster will be set to
1.8.
raw_data = make_blobs(n_samples = 200, n_features = 2, centers = 4, cluster_std = 1.8)
If you print this
raw_data object, you’ll notice that it is actually a Python tuple. The first element of this tuple is a NumPy array with 200 observations. Each observation contains 2 features (just like we specified with our
make_blobs function!).
Now that our data has been created, we can move on to importing other important open-source libraries into our Python script.
The Imports We Will Use In This Tutorial
This tutorial will make use of a number of popular open-source Python libraries, including pandas, NumPy, and matplotlib. Let’s continue our Python script by adding the following imports:
import pandas as pd import numpy as np import seaborn import matplotlib.pyplot as plt %matplotlib inline
The first group of imports in this code block is for manipulating large data sets. The second group of imports is for creating data visualizations.
Let’s move on to visualizing our data set next.
Visualizing Our Data Set
In our
make_blobs function, we specified for our data set to have 4 cluster centers. The best way to verify that this has been handled correctly is by creating some quick data visualizations.
To start, let’s use the following command to plot all of the rows in the first column of our data set against all of the rows in the second column of our data set:
Note: your data set will appear differently than mine since this is randomly-generated data.
This image seems to indicate that our data set has only three clusters. This is because two of the clusters are very close to each other.
To fix this, we need to reference the second element of our
raw_data tuple, which is a NumPy array that contains the cluster to which each observation belongs.
If we color our data set using each observation’s cluster, the unique clusters will quickly become clear. Here is the code to do this:
plt.scatter(raw_data[0][:,0], raw_data[0][:,1], c=raw_data[1])
We can now see that our data set has four unique clusters. Let’s move on to building our K means cluster model in Python!
Building and Training Our K Means Clustering Model
The first step to building our K means clustering algorithm is importing it from
scikit-learn. To do this, add the following command to your Python script:
from sklearn.cluster import KMeans
Next, lets create an instance of this
KMeans class with a parameter of
n_clusters=4 and assign it to the variable
model:
model = KMeans(n_clusters=4)
Now let’s train our model by invoking the
fit method on it and passing in the first element of our
raw_data tuple:
model.fit(raw_data[0])
In the next section, we’ll explore how to make predictions with this K means clustering model.
Before moving on, I wanted to point out one difference that you may have noticed between the process for building this K means clustering algorithm (which is an unsupervised machine learning algorithm) and the supervised machine learning algorithms we’ve worked with so far in this course.
Namely, we did not have to split the data set into training data and test data. This is an important difference - and in fact, you never need to make the train/test split on a data set when building unsupervised machine learning models!
Making Predictions With Our K Means Clustering Model
Machine learning practitioners generally use K means clustering algorithms to make two types of predictions:
- Which cluster each data point belongs to
- Where the center of each cluster is
It is easy to generate these predictions now that our model has been trained.
First, let’s predict which cluster each data point belongs to. To do this, access the
labels_ attribute from our
model object using the dot operator, like this:
model.labels_
This generates a NumPy array with predictions for each data point that looks like this:
array([3, 2, 7, 0, 5, 1, 7, 7, 6, 1, 2, 4, 6, 7, 6, 4, 4, 3, 3, 6, 0, 0, 6, 4, 5, 6, 0, 2, 6, 5, 4, 3, 4, 2, 6, 6, 6, 5, 6, 2, 1, 1, 3, 4, 3, 5, 7, 1, 7, 5, 3, 6, 0, 3, 5, 5, 7, 1, 3, 1, 5, 7, 7, 0, 5, 7, 3, 4, 0, 5, 6, 5, 1, 4, 6, 4, 5, 6, 7, 2, 2, 0, 4, 1, 1, 1, 6, 3, 3, 7, 3, 6, 7, 7, 0, 3, 4, 3, 4, 0, 3, 5, 0, 3, 6, 4, 3, 3, 4, 6, 1, 3, 0, 5, 4, 2, 7, 0, 2, 6, 4, 2, 1, 4, 7, 0, 3, 2, 6, 7, 5, 7, 5, 4, 1, 7, 2, 4, 7, 7, 4, 6, 6, 3, 7, 6, 4, 5, 5, 5, 7, 0, 1, 1, 0, 0, 2, 5, 0, 3, 2, 5, 1, 5, 6, 5, 1, 3, 5, 1, 2, 0, 4, 5, 6, 3, 4, 4, 5, 6, 4, 4, 2, 1, 7, 4, 6, 6, 0, 6, 3, 5, 0, 5, 2, 4, 6, 0, 1, 0], dtype=int32)
To see where the center of each cluster lies, access the
cluster_centers_ attribute using the dot operator like this:
model.cluster_centers_
This generates a two-dimensional NumPy array that contains the coordinates of each clusters center. It will look like this:
array([[ -8.06473328, -0.42044783], [ 0.15944397, -9.4873621 ], [ 1.49194628, 0.21216413], [-10.97238157, -2.49017206], [ 3.54673215, -9.7433692 ], [ -3.41262049, 7.80784834], [ 2.53980034, -2.96376999], [ -0.4195847 , 6.92561289]])
We’ll assess the accuracy of these predictions in the next section.
Visualizing the Accuracy of Our Model
The last thing we’ll do in this tutorial is visualize the accuracy of our model. You can use the following code to do this:])
This generates two different plots side-by-side where one plot shows the clusters according to the real data set and the other plot shows the clusters according to our model. Here is what the output looks like:
Although the coloring between the two plots is different, you can see that our model did a fairly good job of predicting the clusters within our data set. You can also see that the model was not perfect - if you look at the data points along a cluster’s edge, you can see that it occasionally misclassified an observation from our data set.
There’s one last thing that needs to be mentioned about measuring our model’s prediction. In this example ,we knew which cluster each observation belonged to because we actually generated this data set ourselves.
This is highly unusual. K means clustering is more often applied when the clusters aren’t known in advance. Instead, machine learning practitioners use K means clustering to find patterns that they don’t already know within a data set.
The Full Code For This Tutorial
You can view the full code for this tutorial in this GitHub repository. It is also pasted below for your reference:
#Create artificial data set from sklearn.datasets import make_blobs raw_data = make_blobs(n_samples = 200, n_features = 2, centers = 4, cluster_std = 1.8) #Data imports import pandas as pd import numpy as np #Visualization imports import seaborn import matplotlib.pyplot as plt %matplotlib inline #Visualize the data plt.scatter(raw_data[0][:,0], raw_data[0][:,1]) plt.scatter(raw_data[0][:,0], raw_data[0][:,1], c=raw_data[1]) #Build and train the model from sklearn.cluster import KMeans model = KMeans(n_clusters=4) model.fit(raw_data[0]) #See the predictions model.labels_ model.cluster_centers_ #PLot the predictions against the original data set])
Final Thoughts
In this tutorial, you built your first K means clustering algorithm in Python.
Here is a brief summary of what you learned:
- How to create artificial data in
scikit-learnusing the
make_blobsfunction
- How to build and train a K means clustering model
- That unsupervised machine learning techniques do not require you to split your data into training data and test data
- How to build and train a K means clustering model using
scikit-learn
- How to visualizes the performance of a K means clustering algorithm when you know the clusters in advance | https://nickmccullum.com/python-machine-learning/k-means-clustering-python/ | CC-MAIN-2020-29 | refinedweb | 1,626 | 55.68 |
Background tasks¶
CKAN allows you to create tasks that run in the ‘background’, that is asynchronously and without blocking the main application (these tasks can also be automatically retried in the case of transient failures). Such tasks can be created in Extensions or in core CKAN.
Background tasks can be essential to providing certain kinds of functionality, for example:
- Creating webhooks that notify other services when certain changes occur (for example a dataset is updated)
- Performing processing or validation or on data (as done by the Archiver and DataStorer Extensions)
Enabling background tasks¶
To manage and run background tasks requires a job queue and CKAN uses celery (plus the CKAN database) for this purpose. Thus, to use background tasks you need to install and run celery.
Installation of celery will normally be taken care of by whichever component or extension utilizes it so we skip that here.
To run the celery daemon you have two options:
In development setup you can just use paster. This can be done as simply as:
paster celeryd
This only works if you have a development.ini file in ckan root.
In production, the daemon should be run with a different ini file and be run as an init script. The simplest way to do this is to install supervisor:
apt-get install supervisor
Using this file as a template and copy to /etc/supservisor/conf.d:
Alternatively, you can run:
paster celeryd --config=/path/to/file.ini
Writing background tasks¶
These instructions should show you how to write an background task and how to call it from inside CKAN or another extension using celery.
Examples¶
Here are some existing real examples of writing CKAN tasks:
Setup¶
An entry point is required inside the setup.py for your extension, and so you should add something resembling the following that points to a function in a module. In this case the function is called task_imports in the ckanext.NAME.celery_import module:
entry_points = """ [ckan.celery_task] tasks = ckanext.NAME.celery_import:task_imports """
The function, in this case task_imports should be a function that returns fully qualified module paths to modules that contain the defined task (see the next section). In this case we will put all of our tasks in a file called tasks.py and so task_imports should be in a file called ckanext/NAME/celery_import.py:
def task_imports(): return ['ckanext.NAME.tasks']
This returns an iterable of all of the places to look to find tasks, in this example we are only putting them in one place.
Implementing the tasks¶
The most straightforward way of defining tasks in our tasks.py module, is to use the decorators provided by celery. These decorators make it easy to just define a function and then give it a name and make it accessible to celery. Make sure you import celery from ckan.lib.celery_app:
from ckan.lib.celery_app import celery
Implement your function, specifying the arguments you wish it to take. For our sample we will use a simple echo task that will print out its argument to the console:
def echo( message ): print message
Next it is important to decorate your function with the celery task decorator. You should give the task a name, which is used later on when calling the task:
@celery.task(name = "NAME.echofunction") def echo( message ): print message
That’s it, your function is ready to be run asynchronously outside of the main execution of the CKAN app. Next you should make sure you run python setup.py develop in your extensions folder and then go to your CKAN installation folder (normally pyenv/src/ckan/) to run the following command:
paster celeryd
Once you have done this your task name NAME.echofunction should appear in the list of tasks loaded. If it is there then you are all set and ready to go. If not then you should try the following to try and resolve the problem:
- Make sure the entry point is defined correctly in your setup.py and that you have executed python setup.py develop
- Check that your task_imports function returns an iterable with valid module names in
- Ensure that the decorator marks the functions (if there is more than one decorator, make sure the celery.task is the first one - which means it will execute last).
- If none of the above helps, go into #ckan on irc.freenode.net where there should be people who can help you resolve your issue.
Calling the task¶
Now that the task is defined, and has been loaded by celery it is ready to be called. To call a background task you need to know only the name of the task, and the arguments that it expects as well as providing it a task id.:
import uuid from ckan.lib.celery_app import celery celery.send_task("NAME.echofunction", args=["Hello World"], task_id=str(uuid.uuid4()))
After executing this code you should see the message printed in the console where you ran paster celeryd.
Retrying on errors¶
Should your task fail to complete because of a transient error, it is possible to ask celery to retry the task, after some period of time. The default wait before retrying is three minutes, but you can optionally specify this in the call to retry via the countdown parameter, and you can also specify the exception that triggered the failure. For our example the call to retry would look like the following - note that it calls the function name, not the task name given in the decorator:
try: ... some work that may fail, http request? except Exception, e: # Retry again in 2 minutes echo.retry(args=(message), exc=e, countdown=120, max_retries=10)
If you don’t want to wait a period of time you can use the eta datetime parameter to specify an explicit time to run the task (i.e. 9AM tomorrow) | http://docs.ckan.org/en/ckan-2.6.3/maintaining/background-tasks.html | CC-MAIN-2017-51 | refinedweb | 975 | 62.38 |
A library of useful functions to get value from nested JSON
Project Description
jQuery selector liked JSON query tool
Example Usage
import jjson # Get string from nested JSON j = { "foo": { "bar": { "test": "hello world" } } } p = "foo.bar.test" print jjson.extract(j, p) # hello world
Install
The latest stable version can always be installed or updated via pip:
$ pip install git+ # Alternative $ pip install jjson
TODO
- CLI
- Test case
- Change value from certain node
Contributions
Issues and Pull Requests are always welcome.
Release history Release notifications
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages. | https://pypi.org/project/jjson/ | CC-MAIN-2018-17 | refinedweb | 107 | 50.77 |
Infinite Loop........see Loop, Infiniteand then a few pages later:
Loop, Infinite.......see Infinite LoopEditorial humor, can't live with it, can't live without it. -- RonReuter
CRect rectUm; // darn near killed'em
// Abandon all hope, ye who enter here.
// here be dragonsIdeally I'll get back to that section and clean it up, but meanwhile...
index->yellow pig:page->whole hog, index->Derek, Bo:page->1,10,100,1000-- ThaddeusOlczyk Michael Spivak is known for his obsessions with yellow pigs and the number 17; his 5-volume opus, A Comprehensive Introduction to Differential Geometry is full of them. Yellow pigs appear on the covers; sometimes they are yellow policemen instead. Then again, he also wrote The Joy of TeX--A Gourmet Guide to Typesetting with the AmS-TeX Macro Package. -- EricJablow And SpivakPronouns, too.
// Since this file is loaded on every page, and since // I want the following function on every page, I'm going to // cheat and include it here even though it has nothing to // do with the other things in this file. // If you don't like it, bite me!That coder was particularly deserving of a solid punch in the mouth. Eh?
somethingHappened := <some message expression>. somethingHappened ifTrue: [...](I would hope that something happened, even if it wasn't what was being tested for :-) But I think my favorite of all time is this little passage from the GemStone/S 4.1 Programming Guide, in reference to the fact that class Metaclass is an instance of an instance of itself: "Think of the circularity in the metaclass hierarchy as posing a sort of object-oriented koan, whose contemplation may ultimately yield a higher spiritual awareness." I was blown away that someone had the chutzpah to actually put this in commercial product documentation :-) -- RandyStafford I heard that three customers achieved enlightenment as a result of this.
for (i in array) statementdoes statement with i set in turn to each element of array. The elements are accessed in an apparently random order. Chaos will ensue if i is altered, or if any new elements are accessed during the loop. I remember reading this and envisioning flashing lights and whooping sirens ... -- GlennVanderburg
* Single bit errors are detected and corrected * Double bit errors are detected * Undetected errors are ignored
. . . my $search_key = $something_else; foreach (keys %some_hash) { if ($_ eq $search_key) { do_something($_); } } . . .For non-Perlites, this code can be written as
do_something($something_else) if exists $some_hash{$something_else};which makes it one line instead of lots, and takes O(logn) instead of O(n). -- JeffBay His search key is something else, all right! Now where did I put that Stick-Up?
Impossible HappenedAdding a blank card could fix the problem. -- DickBotting Reminiscent the Amiga, with its system errors called Guru Meditations: you could look the number up for an "explanation", but should be prepared to encounter the occasional description like, "Weird echo causing incomprehension." Sometimes I wished for a peek at the source code to learn just how this "echo" was actually being detected. My favorite error of all time simply said, "Impossible." -MrPhil
JButton foo = new JButton("Slowly I turned, step by step...") ;
Message msg = ...; uint16 elvis; msg >> elvis; if( elvis != 0xDEAD ) { ... must byteswap data in the message ... }Groan! -- NatPryce
J EDGAR HOOVERin charge of security. One of the neatest tricks in Algol68R system was that any ref variable (like think pointer) was by default initialized to point at a four character constant that read:
F001in the dump that occurred when following an uninitialized pointer. -- DickBotting It's surprising how many puns you can make with the letters A..F, and whatever letters you can represent with the digits 0..9. E.g. The Java virtual machine expects the first 32 bits at the front of a class file to be 0xCAFEBABE. I have also seen code that uses 0xDEADBEEF to represent uninitialized data. See the JargonFile entry at <> for details. Yes, I once created a magic number 0xBEEFCACA just for kicks. I BS you not.
// Hocus Pocus, grab the focus winSetFocus(...)
x = 0; while x < 5 x = x + 1; end %do something with x ...
if (x == 1) x = 1; // $$$$$$$$$[This is so you can put a breakpoint on that line, of course.]
-- Whip me. Beat me. Make me install Oracle. --
try { //... } catch (SecurityException sex) {
//these are declared as globals, included with some debugging module dim breakpoint as boolean, here as variant ...code code breakpoint=here code code...The compiler halts and complains with an "Unhandled typemisMatch exception" error, but immediately scrolls the window to bring your attention to the exact spot in the code you were last working on. I suppose any other non-boolean vartype would have worked for "here" as well, but "variant" almost implies the location of the breakpoint could change. -- CarstenKlapp
"if nothing else can be found to run, will go feed the ducks."-- JoelNeely. -- PedroChan?
/** * FOR CLASS INTERNAL USE ONLY */ public void someMethod() { ... some code... }-- DarrenHobbs You know, that can actually be hard to avoid, thanks to the way Java implements callbacks. For example, if I want to make my class implement the Runnable interface, I have to expose a public run() method, even if I don't really want just any passer-by to call it. Of course, the right thing to do is to use inner classes. Unfortunately, the way these are handled in Java is IMHO bloody inconvenient, particularly if one is writing something simple like an Applet. -- IlmariKaronen You can abuse doubly curly braces a bit for stuff like that.
theFinalInstance := nil. "I love code with power: rmc"I have always relished that comment. -- TomStambaugh
# Flower : Meaning # $NetBSD: flowers,v 1.2 1997/03/26 06:30:56 mikel Exp $ # @(#. Crocus:Abuse not. Daffodil:Innocence. Forget-me-not:True love. Fuchsia:Fast. Gardenia:Secret, untold love. Honeysuckle:Bonds of love. Ivy:Friendship, fidelity, marriage. Jasmine:Amiability, transports of joy, sensuality. Leaves (dead):Melancholy. Lilac:Youthful innocence. Lilly of the valley:Return of happiness. Lilly:Purity, sweetness. Magnolia:Dignity, perseverance. Marigold:Jealousy. Mint:Virtue..
float sinful = sinf(angle); float costly = cosf(angle);
What the F**K are you looking at?One of my favorites came up during a customer demo. In the middle of something innocuous, an angry message box appeared:
Dammit, Darin! I told you not to call me!
if p=="''": p='' # Dumb ass.-- jps
[some long and messy code] # too drubnk to make this workkkkj. debugg latter.
PERFORM SEX WHILE MAN EQUAL TO TASK
REPEAT ... UNTIL THE-COWS-COME-HOME(or HELL-FREEZES-OVER, or YOU-GET-BORED, or any of a number of other things)
# All your space are belong to perl $customer =~ s/ //g;
ASSUME NOTHINGIt had meaning much beyond the original intention. Also, I once had to look through an assembler program which had about 15000 lines of uncommented code. Right in the middle was one solitary comment:
ld a, 1 ; load 1 into the accumulatorWhy the contractor thought that one statement needed commenting I don't know! The contract probably stated, "must document code". So, he did.
p += 5;He wrote:
for (int i = 0; i < 5; i++) p++;
#ifndef STACK_DIRECTION you loser #else-- SavasAlparslan
HLT ; If you get here you are in trouble-- MarkSwanson
// below here be scary parsing related things
forget everything from school -- you are programmer, and here 2.1*3.6=7.559995 but sometimes (2.1*3.6==7.559995)!=true this is the world with no rules after point -- this is computer.
// Shouldn't ever happen... so close display if it does ecr_close_display(); break;
virtual SHORT DoUnknownCommand( Command *cmd ); // In case we get totally confusedand
// Return a status block suitable for inclusion in the reply // buffer to Control. Note: this code sucks.and my favorite:
/*.
(defun emacs-18-byte-compiler-sucks-wet-farts-from-dead-pigeons () (nuke-em-till-they-glow))I guess they were trying to avoid name conflicts...
bless has no bugs-- RobRix
if ((eIOObjectType == Prototype_ && HR_FAILED(SchemaProcessor.ValidateAndOrCreate())) || (eIOObjectType == Production_ && HR_FAILED(SchemaProcessor.ValidateOnly())) ) { ASSERT(FALSE); // Don't put an assertion here; there are enough assertions in the // schema processor to kill a horse already. return HR_Failure; }The poor horse...
return this; // todo
public class A { protected<type> foo; public void setFoo(<type> fooVal); public <type> getFoo(); public void doSomething() { . . . foo = x.munge(); . . . } }; public class B extends A { /* redeclared here for clarity */ protected foo; public void doSomething() { . . . foo = x.munge(); . . . }-- DavidMcReynolds PairProgramming could have prevented this. Only if one of the halves of the pair knew what he/she was doing. You're right. If all the programmers are dumb, pair programming doesn't help. But then, nothing helps...
ABORT Routine . . First things first, get rid of all trap conditions. trapclr all . . Now, KILL FOR KALI!!!!! chain "zyxvutsrqonm" returnThe funny thing is that chain "zyxvutsrqonm" is guaranteed to fail (unless there is another program named zyxvutsrqonm). Why there needs to be a return after that, I am not sure....
stream list))Where all those funky escapes are specifying indentation and line-breaking rules. -- LukeGorrie Some of that almost looks like a bunch of Asian-style emoticons. I think ~_~}~:> is the emoticon for one's brain flying out one's ears. :-p --CodyBoisclair @_~@ I'm listening to music on my headphones. alternately, my left eyeball has popped out and is dangling by my optic nerve
/* DO NOT UNCOMMENT THIS WITHOUT TALKING TO <name of programmer> */Found a year after the product was sold to our company; programmer was nowhere to be found, so I uncommented it with no ill effect.
void BeginHackyEndScreen(); void EndHackyEndScreen();
TRACE ("Life sucks\n"); return NULL;
// Ad Index scheming and plotting - Those with // heart conditions are advised to not continue
// Bits 6, 5, and 4 must be 0, 1, and 0 respectively. // Otherwise, the oscillator burns crazy evil crack.
"I was in the Eagles? Cool!" -- Joe Walsh
// We don't really need to do this, as the environment will keep track // of it and clean up for us. But we're tidy Kiwis round here, aren't we?Aah, a fellow New Zealander. Tidy Kiwi is a reference to an ad campaign in the late 80s to encourage New Zealanders to not litter. Just in case anyone is thinking of the green furry fruit called kiwis in America. The Kiwi is the official bird of New Zealand, and used as a nickname for an NZer, kiwifruit were branded such for marketing reasons. They were originally called Chinese gooseberries. -- Liam Clarke
# -- #perl was here! -- # <Skrewtape> Larry Wall is a lot sexier than Richard Stallman # <Skrewtape> But I've heard Stallman is better in bed. # <Schwern> Does he leave the halo on? # * aether cocks her head at skrew...uh...whatever? # <fimmtiu> Stallman's beard is a sex magnet. # <Skrewtape> Larry's moustache is moreso, Fimm. # <aether> oh yeah...women all over the world are hot for stallman.... # <Skrewtape> Moustaches make my heart melt. # <Schwern> I dunno, there's something about a man in hawaiian shirts...
#.
I'm sorry. I was young and foolish. :-( -- dptFrom one of the same modules:
# Ye Olde Contructor Methode. You know the drill. # Takes absolutely no args whatsoever.
/* XXX Grand unified hard-coded badness; this should go into libpq */ #define pg_encoding_to_char(x) "SQL_ASCII"
// Everything is shamelessly stolen and rewritten. // Feel the consequences of GPL ;-)
NAME update_shebangs.pl SYNOPSIS INCREDIBLY DANGEROUS TOOL to rewrite all the shebang paths of perl scripts under the current directory to use the perl you run the tool with. Frankly, I suggest you never use this tool ever.
ProcessCommandLine( argc, argv ); if ( bUseCheese ) dbgDisp.Initialize();
The following code was written by <developer name>. Unless it doesn't work, then I have no idea who wrote it.
: /* : * build notes : * The reference CD to listen to while editing this file is : * Underworld Everything, Everything : * variable naming policy from Fowler's refactoring book. : */
Eh?
#ifdef I_HAD_MY_DRUTHERS
% tar cvf foo.tar tar: Cowardly refusing to create an empty archive
PathYetAnotherMakeUniqueName
/* ** .
gnu Search out and replace without asking all small antelope-like creatures.MTO
/* And now, ladies and gentlemen, the chord from HELL! */
/* There are dumber f**ks than me out there, but not many */
/* These clothes are a little tight, but the price was right */
"Nostradamus told me this would happen. Smug bastard."Sometimes I worry about myself. -- DaveFayram "These clothes are a little tight, but the price was right" is a reference to Final Fantasy VI.
.
public const string HTTP_USER_AGENT = "Dancing squirrels with teletype machines."; LPWSTR Name2 = Name; //shoot me now - seriously
//The following was stolen in large part from MSDN by (name) & I. //I tried to give it back, but they wouldn't take it. //I don't blame them...
% ... 1,000,000 ............ 10,000,000 years later % % >> 42 << (last release gives the question)Fans of the HitchhikersGuideToTheGalaxy will, of course, realize the significance of this. :) -- CodyBoisclair
/* declaration, line 101 */ void die_you_gravy_sucking_pig_dog __P((void)); /* Called in 256-267 */ for (;; ++tp) { timewarn(tp->timeleft); if (!logged && tp->timeleft <= NOLOG_TIME) { logged = 1; nolog(); } (void)sleep((u_int)tp-\007\007\r\n"); if (killflg) { (void)printf("\rbut you'll have to do it yourself\r\n"); exit(0); }You can learn quite a bit about BSD philosophy from that last printf....
/* fit round peg into square hole, if necessary... */ /* well, actually any damn peg into whatever hole we have to work with... */ /* use (the) force, if necessary */
public string m_sSourceGroup; public int m_iHops; // Where you get pancakes public int m_iDepth;
Ode to ARM040 Yesterday I had a scare, I ran some code that wasn't there, It wasn't there again today; Oh, how I wish that it would stay.
* (I never trust internal program documentation)And in another one.
* I do not think this should happen - * (Looks like a desperation sledge-hammer catch-all redundant * un-refactored solution implemented rabidly during testing)The documentation was right this time. -- PeterLynch
// Either the app is exiting or the world is coming to an end. // Take your pick.
// I'd trade my office mate for a layout manager.
Some colored objects from some applications may not print as expected.
; /* If you think this is a mistake, think again. */
/* PB, is this right? -- AW */I just left it -- neither PB nor AW were around to ask anymore.
while (<PFUNC>) { # "The Mothership Connection is here!"
// User has no right toeUsually it's the programmers who shoot themselves in the foot.
/*
/* ** Lies will not be tolerated. ** If any pair of links claim to be connected to the same ** place, then ignore this packet completely. */Which is followed shortly thereafter by:
if (Lies) { rio_dprintk(RIO_DEBUG_ROUTE, "LIES! DAMN LIES! %d LIES!\n", Lies);(linux-source-2.6.22/drivers/char/rio/rioroute.c)
template <typename T> class test_p: public std::unary_function<T, bool> { //;
class CRepositoryMoronicExportInsteadOfImportItemDlg : public CRepositoryNewItemDlg
;?; }
TokenIterator? tit;
# should never ever ever ever happen DEBUG and print "AYYAYAAAAA at line ", __LINE__, "\n"; die "SPORK 512512!";
#define cerr if(false)cerrThat, although a hack, certainly seems a clever one for disabling the error message output stream in a manner such that the compiler can cut it out as dead-code.
public boolean isDirty() { // why do you always go out and return dirty; }reminds me of this from something I'm working on at the moment:
class Action { // lawsuit
SqlConnection? ConnectThisShit? = new SqlConnection?(); SqlCommand? Kyon = new SqlCommand?(); // Kyon, the one who commands Haruhi SqlDataReader? YukiNagato? = new SqlDataReader?(); // Nagato, who spends all her time readingEh... I don't think you should be the one to judge that which you yourself wrote. [The above has inspired me to give, from now on, an unconditional 'F' to any student assignment that uses unclever anime and/or Japanese novel references in comments, or worse, in variable names.] Your reluctance to accept other people's notions disqualifies you for the role of giving grades. To the author of the code: I was smirking while reading the code.
class goesNowhere(object): def doesNothing(self): passAs you might expect, the purpose was to reference a do-nothing method of a class, aptly named goesNowhere().doesNothing. --Samuel A. Falvo II
typedef int16 TYPE; /* Type of something */
public void ReadySetGo?()
function comment(s) { if (i_know_what_to_do_shut_up_i_dont_need_your_help_mode) { return } else { return s } }
Horrible horrible leprous kludge! High criticality, very high priority bug that would need major restructuring to fix properly. PLEASE PLEASE PLEASE don't let this become permanent! PLEASE let us do a proper job of it soon!I should mention that this was checked in over two and a half years ago, and the author is no longer around. I guess if it works, don't fix it.
/*
// so called accessors: misbegotten mutant stepchildren of getters/setters
private enum Tristate { No, Yes, Ummm }
#if !_PACKAGE_astsa && !_YOU_FIGURED_OUT_HOW_TO_GET_ALL_DLLS_TO_DO_THIS_ /* * these are not initialized by all dlls! */ extern Error_info_t _error_info_; extern Opt_t _opt_info_;
if(k==1) { .... } else if (k==2){....} else if (k==3) {....}... } -- it is very rude how you've approached this case.. and I don't see where is the problem. He should use switch instead of if(){} else if(){} but the logic is correct in my opinion. and I don't have a Master's degree in a Venezuelan university The logic is correct; it's also pointless, unless there's something like a break statement somewhere in the ...'s. I don't know about the logic, but I see often enough similar code written (or copy-pasted) by colleagues from India:
for(coln = FIRSTCOLUMN; coln <= LASTCOLUMN; coln++) { switch(coln) { case FIRSTCOLUMN: <some stuff...> break; case SECONDCOLUMN: <some stuff...> break; <....> case LASTCOLUMN: <some stuff...> break; default: <error handling code> break; } }Using the defined names you can reorder columns just by changing defines, but I still don't see the point. Naturally, I remove all this alien code and write a strafe forward <stuff> (without for and switch), which is more readable, easier to debug and maintain.... and - not surprisingly enough - works just fine. And believe it or not, I have seen a lot of similar examples on MSDN.
String[] annoying_string_array = config.Configs["DataSnapshot?"].GetString?("disable_modules", "").Split(".".ToCharArray?()); foreach (String bloody_wanker in annoying_string_array) { m_disabledModules.Add(bloody_wanker); }Also found:
m_gridinfo.Add("Name", config.Configs["DataSnapshot?"].GetString?("gridname", "harbl"));(harbl means "cat balls") These were removed as of the 0.6.5 release.
// Steve did not send attribute so happy creativity // lets recreate it using available information // this logic should nod be here and I am waiting impatiently to throw it away
/* The Knuth books are not in the office only for show; they help make loops 30% faster and 20% as readable. */
on (release) { gotoAndPlay(84112); //W/ Yours, asshole. Stay away from mine! }
return false;}
if (i == 1) continue; else { i--; continue; //i know this use of continue looks bizarre //if you can think of a better way then write it yourself...
//The truth is not out there. It is here #define TRUE (1==1) #define FALSE (!TRUE)By same programmer:
//Array where widgets live. Should have been called WidgetLand? tWidget Widgets[MAX_WIDGETS];A standard include containing boolean value definitions doesn't exist for your platform and you can't rely on the numeric values of TRUE and FALSE being the common 1 and 0. Can you think of a better way to define reliable true and false values? I think your attention was supposed to be drawn to the comments.if its a standard compliant C compiler then 1==1 must be 1 and !(1==1) must be 0
mov $di, 0 ;; never trust a micro
// Had to do this because DB is in Abbie Normal Form
// Times New Roman? What was wrong with the old Romans?
Congratulations! You are reading the README file for a software package you downloaded! You are now officially an *advanced* software installer.
BOOL fMicrosoftMakesBuggyCompilers = FALSE; // actually I would like this to be true if( <condition 1> ) { fMicrosoftMakesBuggyCompilers = <expression 1>; } else if( <condition 2> ) { fMicrosoftMakesBuggyCompilers = <expression 2>; } if( fMicrosoftMakesBuggyCompilers ) { <lots of statements> }And there is no else branch for the last if-statement...
On Error GoTo Hell ' Logic Hell: ' Code for handling the error is entered here. End If | http://c2.com/cgi-bin/wiki?FunnyThingsSeenInSourceCodeAndDocumentation | CC-MAIN-2014-52 | refinedweb | 3,323 | 65.93 |
User talk:Roma
From Stellarium Wiki
Translations
Hello and welcome to the Stellarium Wiki!
When translating pages, please don't overwrite the original English text, as you did with Help:Contents. I reverted it, but your text is still available in the history of the article here (don't click "Save page"!), so you can copy it to a more suitable location.
The problem with that particular page is that "Help" is a MediaWiki namespace, so "Помощь:Содержание" is not a direct equivalent (there's no namespace "Помощь"). Possible alternatives are Help:Содержание or Help:Contents/ru, with Помощь:Содержание redirecting to that page. Please choose one of the two variants and copy your text there. I can create the redirect, if necessary.--Daggerstab 06:21, 10 March 2011 (UTC) | http://stellarium.org/wiki/index.php/User_talk:Roma | CC-MAIN-2015-18 | refinedweb | 130 | 66.64 |
Fantasy Football Data Sets
If you are looking to run the scripts we’ve provided for locally updating data, clone this repo and install dependencies.
pip install -r requirements.txt
Strength of Schedule data
Strength of Schedule data is available in the sos directory. Data is available going back to 1999. To load this data in pandas using the following the following url format:
For example, in pandas do the following:
import pandas as pd df = pd.read_csv(' index_col=0) df.index = df.index.rename('Team')
Weekly Fantasy Stats
Weekly stats going back to 1999 are available are exposed through the following url format
To grab weekly data for year 2019, week 1 in pandas, you would do:
import pandas as pd df = pd.read_csv('
Yearly Fantasy stats
Yearly fantasy stats are available going back to 1970.
The url format:
To grab yearly data for 2019 in pandas, do the following:
import pandas as pd df = pd.read_csv(' | https://excelexamples.com/post/fantasy-football-data-in-the-form-of-csv-files-available-for-use-in-pandas-r-excel-etc/ | CC-MAIN-2022-21 | refinedweb | 158 | 54.83 |
Microsoft released the updated Entity Framework 6 (EF6) framework in early 2013 to eager developers who wanted to use the newly open sourced data access library. This was a huge step for Microsoft, they were now developing and delivering their core data access technology from an open source repository for all to see. Julie Lerman called this the Ninja Edition of the library, indicating that it performed very well and scaled well. However, the one thing that developers saw that they didn’t like was a lack of support for the Entity Framework Data Source in ASP.NET.
With a fresh install of Visual Studio 2013, it was impossible to use Entity Framework 6 with ASP.NET web forms to easily build data enabled web pages. This sent developers running to their previous version of Entity Framework so that they could have support for this model of rapid application development.
In late February 2014, Microsoft heard the community and released a preview release of an Entity Framework data source control for ASP.NET. With this control, you could once again drag a grid onto a design surface and easily connect it to your database for all CRUD database interactions.
With this publication from Microsoft, we at Telerik responded. We announced compatibility with this new Entity Framework data source starting with our Q1 2014 release of the UI for ASP.NET AJAX. Let me show you how to get started with using these two resources together.
Entity Framework is now completely isolated into a collection of Nuget packages that you can add to your project. For the ASP.NET data source, you should install the Microsoft Asp.NET EntityDataSource from Nuget with a command in the Package Manager console like:
Install-Package Microsoft.AspNet.EntityDataSource -pre
This package will not just add the control to your project references, but will also add a special line to your web.config file that will allow you to switch and use the new EntityFrameworkDataSource with an ef namespace:
<system.web> <pages> <controls> <add tagPrefix="ef" assembly="Microsoft.AspNet.EntityDataSource" namespace="Microsoft.AspNet.EntityDataSource" /> </controls> </pages></system.web>
Listing 1- Changes to web.config
With that small change and an existing EF6 entity data model in your project, you can easily use the data source just as you used the previous version. Consider the following code to connect my Products table from a data context called GameShopEntities:
<ef:EntityDataSource </ef:EntityDataSource>
I can connect this just as I had before to any Telerik control for ASP.NET, using the DataSourceID attribute to instantly wire up data retrieval and update interactions. In the following snippet, I wrote a few lines of markup and pointed the DataSourceID attribute appropriately to the data source object.
<telerik:RadGrid </telerik:RadGrid>
Listing 3 - Simple Reference with DataSourceID
Our grid looks great, and contains data without having to write any SQL statements, databind commands or other C# code. I can complete a simple page like this without leaving my markup editor.
Figure 1- Simple Grid Fetching Data from Entity Framework
Again and again, Telerik is there for our customers. We listen to your feedback, and we build what you need to be successful. As soon as Microsoft made this capability of Entity Framework available to us, we turned it around for you as well. Once we have a confirmed final version of this version of the Entity Framework library from Microsoft, look for us to show more samples using EF with Telerik ASP.NET AJAX controls. | http://www.telerik.com/blogs/asp-net-ajax-controls-entity-framework-6 | CC-MAIN-2016-44 | refinedweb | 585 | 53.81 |
> 1) How to model node vector processing and node state? Node receives input > and produces output and can change its state by adding new category to Node > CM. Will State monad help to 'thread' node state between inputs? I don't see > how. > State monad encapsulates state transition function: > > State s a = State (\s -> a, s) This is typically done by step :: NewInput -> State StateOfNodes () step input = do old <- ask let newState = doSomithingWithStateAndInput input old put newState return () Of course there are shortcuts such as modify etc () because the only thing you want to return here is the new state I guess. So maybe its not worth even using State. You must think of it as kind of closure. >. I'm haven't read all of your text.. You should think about how to represent your tree in haskell. Maybe you want to have a look at hgl (haskell graph library) beeing distributed with ghc-*-extra sources. There is a nice introduction. At least it gives you one solution on how it could be done.. But which way is the best / fastest one? Don't know.. Maybe even reuse a already existing library :) >)? Arrows? Haven't used them myself yet.. But you are right.. XML transformation libs (one is using arrows) may be a good source of knowldge es well (maybe kind of overkill as well) I guess asking here is the best thing you could have done. I hope you'll get some replies with more relevant information. Searching haskell.org only gives one match: (I haven't read it) is the other most commonly used source of finding aready existing code (There is package about nn) Should your nn also support kind of learning by giving feedback? Marc Weber | http://www.haskell.org/pipermail/haskell-cafe/2008-May/043466.html | CC-MAIN-2014-41 | refinedweb | 291 | 81.83 |
Parse an object read from PPS
#include <sys/pps.h> extern pps_status_t ppsparse(char **ppsdata, const char * const *objnames, const char * const *attrnames, pps_attrib_t *info, int parse_flags);
libpps
The function ppsparse() provides a lower-level alternative to the pps_decoder_*() functions (which themselves use pps_parse()). Except in special circumstances, it's better to use the pps_decoder_*() functions than to use ppsparse().
The function ppsparse() parses the next line of a buffer of PPS data. This buffer must be terminated by a null ("\0") in C or hexadecimal 0x00).
The first time you call this function after reading PPS data, you should set ppsdata to reference the start of the buffer with the data. As it parses each line of data, ppsparse():
When it successfully completes parsing a line, ppsparse() returns the type of line parsed or end of data in the pps_status_t data structure.
QNX Neutrino
During parsing, separators (":" and "\n") in the input string may be changed to null characters. | https://www.qnx.com/developers/docs/7.1/com.qnx.doc.pps.developer/topic/api/ppsparse.html | CC-MAIN-2022-40 | refinedweb | 160 | 51.78 |
- NAME
- SYNOPSIS
- DESCRIPTION
- SEE ALSO
NAME
UR::Role - Roles in UR, an alternative to inheritance
SYNOPSIS
package My::Role; role My::Role { id_by => [ role_id_property => { is => 'String' }, ], has => [ role_property => { is => 'String' }, another_prop => { is => 'Integer' }, }, requires => ['class_method'], excludes => ['Bad::Role'], }; sub role_method { ... } package My::Class; class My::Class { has => [ class_property => { is => 'Integer ' }, ], roles => ['My::Role'], }; sub class_method { ... } my $obj = My::Class->new(); $obj->does('My::Role'); # true
DESCRIPTION
Roles are used to encapsulate a piece of behavior to be used in other classes. They have properties and methods that get melded into any class that composes them. A Role can require any composing class to implement a list of methods or properties.
Roles are not classes. They can not be instantiated or inherited from. They are composed into a class by listing their names in the
roles attribute of a class definition.
Defining a Role
Roles are defined with the
role keyword. Their definition looks very similar to a class definition as described in UR::Object::Type::Initializer. In particular, Roles have a
has section to define properties, and accept many class-meta attributes such as 'id_generator', 'valid_signals', and 'doc'.
Roles may implement operator overloading via the 'use overload' mechanism.
Roles also have unique attributes to declare restrictions on their use.
- requires
A listref of property and method names that must appear in any class composing the Role. Properties and methods defined in other roles or parent classes can satisfy a requirement.
- excludes
A listref of Role names that may not be composed together with this Role. This is useful to declare incompatibilities between roles.
Composing a Role
Compose one or more Roles into a class using the 'roles' attribute in a class definition.
class My::Class { roles => ['My::Role', 'Other::Role'], is => ['Parent::Class'], has => ['prop_a','prop_b'], };
Properties and meta-attributes from the Roles get copied into the composing class. Subroutines defined in the Roles' namespaces are imported into the class's namespace. Operator overloads defined in the Roles are applied to the class.
Property and meta-attribute conflicts
An exception is thrown if multiple Roles are composed together that define the same property, even if the composing class defines the same property in an attempt to override them.
A class may declare a property with the same name that a role also declares. The definition in the class overrides whatever appears in the role. An exception is thrown if a role declares an ID property in the 'id_by' section and the consuming class redeclares it in the 'has' section as a normal property.
Method conflicts
An exception is thrown if multiple Roles are composed together that define the same subroutine, or if the composing class (or any of its parent classes) defines the same subroutine as any of the roles.
If the class wants to override a subroutine defined in one of its roles, the override must be declared with the "Overrides" attribute.
sub overridden_method : Overrides(My::Role, Other::Role) { ... }
All the conflicting role names must be listed in the override, separated by commas. The class will probably implement whatever behavior is required, maybe by calling one role's method or the other, both methods, neither, or anything else.
To call a function in a role, the function's fully qualified name, including the role's package, must be used.
Overload conflicts
Like with method conflicts, an exception is thrown if multiple Roles are composed together that overload the same operator unless the composing class also overloads that same operator.
An exception is also thrown if composed roles define incompatible 'fallback' behavior. If a role does not specify 'fallback', or explicitly sets it to
undef, it is compatible with other values. A Role that sets its 'fallback' value to true or false is only compatible with other roles' values of undef or the same true or false value.
__import__
Each time a Role is composed into a class, its
__import__() method is called.
__import__() is passed two arguments:
The name of the role
The class metadata object composing the role.
This happens after the class is completely constructed.
Parameterized Roles
Scalar variables with the
RoleParam attribute are designated as role params. Values can be supplied when a role composes the role as a means to provide more flexibility and genericity for a role.
package ObjectDisplayer; use ProjectNamespace; our $target_type : RoleParam(target_type); role ObjectDisplayer { has => [ target_object => { is => $target_type }, ], }; package ShowCars; class ShowCars { roles => [ ObjectDisplayer->create(target_type => 'Car' ], };
When the role is composed, the call to
create() in the class definition creates a UR::Role::Instance to represent the ObjectDisplayer role being composed into the ShowCars class with the params
{ target_type = 'car' }>. Values for the role param values in the role definition are swapped out with the provided values as the role's properties are composed into the class.
At run-time, these role param variables are tied with the UR::Role::Param class. Its
FETCH method searches the call stack for the first function whose invocant composes the role where the variable's value is being fetched from. The proper param value is returned.
An exception is thrown if a class composes a role and either provides unknown role params or omits values for existing params.
Method Modifiers
Roles can hook into methods defined in consuming classes by using the "before", "after" and "around" method modifiers.
use UR; package RoleWithModifiers; use UR::Role qw(before after around); role RoleWithModifiers { }; before 'do_something' => sub { my($self, @params) = @_; print "Calling do_something with params ",join(',',@params),"\n"; }; after 'do_something' => sub { my($rv, $self, @params) = @_; print "Result from do_something: $rv\n"; }; around 'do_something' => sub { my($orig, $self, @params) = @_; print "Wrapped call to do_something params ",join(',',@params),"\n"; my $rv = $self->$orig(@params); print "The wrapped call to do_something returned $rv\n"; return 123; }; package ClassUsingRole; class ClassUsingRole { roles => 'RoleWithModifiers' }; sub do_something { print "In original do_something\n"; return 'abc'; } my $rv = ClassUsingRole->create()->do_something(); print "The call to do_something returned $rv\n";
Running this code will generate the following output:
Wrapped call to do_something params Calling do_something with params In original do_something Result from do_something: abc The wrapped call to do_something returned abc The call to do_something returned 123
Method modifiers are applied in the order they appear in the role's implementation.
- before(@params)
A
beforemodifier runs before the named method. It receives all the arguments and
wantarraycontext as the original method call. It cannot affect the parameters to the original method call, and its return value is ignored.
- after($rv, @params)
The first argument to an
aftermodifier is the return value of the original method call, the remaining arguments and
wantarraycontext are the same as the original method call. If the original method was called in list context, then
$rvwill be an arrayref containing the list of return values. This modifier's return value is ignored.
- around($orig, @params)
An
aroundmodifier is run in place of the original method, and receives a coderef of the original method as its first argument. Around modifiers can munge arguments and return values, and control when and whether the original method is called.
SEE ALSO
UR, UR::Object::Type::Initializer, UR::Role::Instance, UR::Role::Param | http://web-stage.metacpan.org/pod/release/BRUMMETT/UR-0.47/lib/UR/Role.pm | CC-MAIN-2019-39 | refinedweb | 1,190 | 51.48 |
Hi there! Couple of days ago I was solving problem 796C-Bank Hacking. I came up with O(nlog(n)) order solution, but it failed with Time Limit Exceeded status. The max input size was 3*10^5, which implies that order O(n*log(n)) algorithm must fit into time limit. The tutorial for the contest also mentioned the same order solution. After a few hours of debugging, I have realized that the problem is in input reading part. Well, my code used built in BufferedReader in java:
BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); Bank banks[] = new Bank[n]; String tokens[] = br.readLine().split(" "); List<Integer> g[] = new List[n]; int max = Integer.MIN_VALUE; for(int i =0 ;i<n;i++) { g[i] = new ArrayList<>(); int val = Integer.parseInt(tokens[i]); max = Math.max(max, val); banks[i] = new Bank(i, val); } for(int i = 0;i<n-1;i++){ tokens = br.readLine().split(" "); int a = Integer.parseInt(tokens[0])-1; int b = Integer.parseInt(tokens[1])-1; g[a].add(b); g[b].add(a); }
The code slice already consumed about 800 ms for the maximum size input. After I have submitted a linear time alternative solution, but I still decided to find more faster way of reading. I have found williamfiset 's InputReader which claimed to be much faster than the BufferedReader. Finally I decided to write my own FastScanner inspired with his idea. Well here it is (Currently I have just implemented it for Integers):
import java.io.*; import java.util.*; public class FastScanner { static final int DEFAULT_BUFF = 1024, EOF = -1, INT_MIN = 48, INT_MAX = 57; static final byte NEG = 45; static final int[] ints = new int[58]; static { int value = 0; for (int i = 48; i < 58; i++) { ints[i] = value++; } } InputStream stream; byte[] buff; int buffPtr; public FastScanner(InputStream stream) { this.stream = stream; this.buff = new byte[DEFAULT_BUFF]; this.buffPtr = -1; } public int nextInt() throws IOException { int val = 0; int sign = readNonDigits(); while (isDigit(buff[buffPtr]) && buff[buffPtr] != EOF) { val = (val << 3) + (val << 1) + ints[buff[buffPtr]]; buffPtr++; if (buffPtr == buff.length) { updateBuff(); } } return val*sign; } private int readNonDigits() throws IOException { if (buffPtr == -1 || buffPtr == buff.length) { updateBuff(); } if (buff[buffPtr] == EOF) { throw new IOException("End of stream reached"); } int signByte = -1; while (!isDigit(buff[buffPtr])) { signByte = buff[buffPtr]; buffPtr++; if (buffPtr >= buff.length) { updateBuff(); } if (buff[buffPtr] == EOF) { throw new IOException("End of stream reached"); } } if(signByte == NEG) return -1; return 1; } public void close() throws IOException { stream.close(); } private boolean isDigit(int b) { return b >= INT_MIN && b <= INT_MAX; } private void updateBuff() throws IOException { buffPtr = 0; stream.read(buff); } }
The FastScanner class in my code worked very fast and the maximum size input reading time has reduced up to 47 ms. As a result I have got accepted even with O(nlog(n)) order solution, just by replacing the reading part by the following code slice:
FastScanner in = new FastScanner(System.in); int n = in.nextInt(); Bank banks[] = new Bank[n]; List<Integer> g[] = new List[n]; for(int i =0 ;i<n;i++) { g[i] = new ArrayList<>(); int val = in.nextInt();; banks[i] = new Bank(i, val+2); } for(int i = 0;i<n-1;i++){ int a = in.nextInt()-1; int b = in.nextInt()-1; g[a].add(b); g[b].add(a); }
You may find my last submission here if you want.
Further I plan to upgrade and test my FastScanner, and never use BufferedReader when fast reading is important.
Thank you for attention. | http://codeforces.com/blog/entry/52645 | CC-MAIN-2018-13 | refinedweb | 591 | 50.23 |
LoadPlugin python
# ...
<Plugin python>
ModulePath "/path/to/your/python/modules"
LogTraces true
Interactive false
Import "spam"
<Module spam>
spam "wonderful" "lovely"
</Module>
</Plugin>
The minimum required Python version is 2.6.:
To quit collectd send EOF (press Ctrl+D at the beginning of a new line)..
The name identifies the callback..
When.
Python thread support has not been initialized at this point so do not use any
threading functions here!
Any function (except log functions) may throw an exception in case of.
class Signed(long)
This is a long by another name. Use it in meta data dicts
to choose the way it is stored in the meta data.
class Unsigned:
Every item in this tuple will be either a string, a float or a boolean,
depending on the contents of the configuration file.
class PluginData(object)
This is an internal class that is the base for Values and Notification. It is
pretty useless by itself and was therefore not exported to the collectd module.
class Values(PluginData)
A Values object used for dispatching values to collectd and receiving values
from write callbacks.
Method resolution order:
Methods defined here:
If you do not submit a parameter the value saved in its member will be
submitted. If you do provide a parameter it will be used instead, without
altering the member.
If you submit values more often than the specified interval, the average will
be used. If you submit less values, your graphs will have gaps.
If the sequence does not have the correct size upon dispatch a RuntimeError
exception will be raised. If the content of the sequence is not a number, a
TypeError exception will be raised..
These functions are called in the various stages of the daemon (see the section
``WRITING YOUR OWN PLUGINS'' above) and are passed the following arguments:
The callback will be called without arguments.
The arguments passed are timeout and identifier. timeout indicates
that only data older than timeout seconds is to be flushed. identifier
specifies which values are to be flushed.
If this callback throws an exception it will not be logged. It will just be
printed to sys.stderr which usually means silently ignored.
import collectd
A very simple read function might look like:
import random.
Hence, any plugin has to be thread-safe if it provides several entry points
from collectd (i. e. if it registers more than one callback or if a
registered callback may be called more than once in parallel).
This manpage has been written by Sven Trenkel
<collectd at semidefinite.de>.
It is based on the collectd-perl(5) manual page by
Florian Forster <octo at collectd.org> and
Sebastian Harl <sh at tokkee.org>. | http://linuxhowtos.org/manpages/5/collectd-python.htm | CC-MAIN-2018-09 | refinedweb | 448 | 65.32 |
XQilla :
DevDocs
::
PageIndex
::
RecentChanges
::
RecentlyCommented
::
Login/Register
XQilla Developer Documentation
This page is very much a work in progress. It contains some notes as I learn about the XQilla implementation. This page is largely unorganized and will be mostly incomplete.
Doxygen Documentation
Doxygen documentation can be built with:
make docs
The above command only builds API documentation. Additional developer documentation can be built with the following command:
make devdocs
The generated documentation is placed into the docs directory and into subdirectories corresponding to the documentation type.
Architecture/Flow Control/etc
This would be a good place for a flow chart. For now, a list will get me started. This list is in regards to handeling an XQuery through the command line
The lexer reads in the query file and recognizes tokens. When a token is recognized, it is passed to the parser.
The parser takes the token and depending on other tokens, constructs that represent the xquery
The the query placed into an
Abstract Syntax Tree
∞
. This is the end of the compilation stage.
Once the abstract syntax tree (AST) is created, static resolution is done. The staticResolution function is called once for each node in the AST. This will perform namespace prefix resolution, and adding atomization and type checking objects.
Static Typing is done next. The staticTyping functions are called for each node any number of times. XQilla does not implement formal static typing, so type is
more loosely defined. The properties include what parts of the dynamic context are used by the expression, what order we expect results in etc.
This stage is also where constant folding and other AST rewrites happen.
Finally, createResult is called to execute the expression, and returns an iterator object which should be a subclass of ResultImpl. The FLWOR one is already written and comes in two flavours: SortingFLWORResult and FLWORResult. The former handles any FLWOR with an "order by" clause, where as the latter allows lazy evaluation but can't handle "order by".
Testing
Make sure that the tests continue to work! You'll need to download the XQTS (XQuery test suite) test data from here:
∞
Then run the tests using a command like this:
./xqtsRunner -e ../tests/xqts/xqts_testsuite/errors.xml -E
xqts-latest-errors.xml /home/jpcs/drop/XQTS_current/XQTSCatalog.xml 2>xqts-latest-errors
The "errors.xml" file contains a list of tests that are known to fail,
since at the moment we don't pass 100% of the XQTS tests. Specifying
this file to the xqtsRunner allows it to report to you a list of
"unexpected failures" (which are bad) and "unexpected passes" (which are
good).
What's missing?
CategoryDocumentation
There are no comments on this page. [
Add comment
]
Page History
::
2014-03-11 09:49:20
:: Owner:
DanielBaranowski
:: Search:
Wikka Wakka Wiki 1.1.6.0
∞
Page was generated in 0.0359 seconds
There are no comments on this page. [Add comment] | http://xqilla.sourceforge.net/DevDocs | CC-MAIN-2017-47 | refinedweb | 485 | 57.06 |
Get the origin of dispatched Eventdrillnaut Apr 30, 2009 1:19 AM
Hello Everyone,
I am using a custom event for a class that I have made. In the main class , I add a listener to the aforementioned objects of the class. When the event is fired and caught, I need to know exactly which one of my objects has dispatched the event. I have tried casting the event to the class
list:Mylist = event.currentTarget as Mylist.
However , flex builder won't let that slide. Any help is greatly appreciated.
Sincerely,
JD
1. Re: Get the origin of dispatched EventMichael Borbor Apr 30, 2009 4:33 AM (in response to drillnaut)
Hi. What's the compiler error?
2. Re: Get the origin of dispatched EventGregory Lafrance Apr 30, 2009 5:24 AM (in response to drillnaut)1 person found this helpful
Yeah, I'm wondering what error you're getting as well.
list:Mylist = event.currentTarget as Mylist
So how about the following:
list:Mylist = Mylist(event.currentTarget)
list:Mylist = event.target as Mylist
list:Mylist = Mylist(event.target)
Just trying to come up with possibilities, but can't really say without the error.
If you just wanted to know which object dispatched the event, if you gave the object a "name" and checked that property, that might do the trick.
3. Re: Get the origin of dispatched EventBarna Biro Apr 30, 2009 5:28 AM (in response to Gregory Lafrance)1 person found this helpful
Hi there,
I think that the only way you can know which project / component triggered the event is to pass along this information when you dispatch the event. I don't think there's a built in something that can help you out with this ( it's really hard to keep track of events, know where they are heading, how's listening for them and where they are comming from ).
With best regards,
Barna Biro
4. Re: Get the origin of dispatched EventGregory Lafrance Apr 30, 2009 6:18 AM (in response to Barna Biro)
Yeah, because you are already using a custom event, you could have a string static variable to identify the class, or else a non-static string variable referencing another variable, this time an int, that is static you increment in the constructor and concatenate with the non-static variable to idenitfy the instance, then in the event handler, access that custom event property, and you know the class and the instance.
5. Re: Get the origin of dispatched Eventdrillnaut Apr 30, 2009 5:01 PM (in response to drillnaut)
Ok folks, after some research , I believe that I have found the solution. Before I was using simple custom events i.e , dispatchEvent(new Event("dispatchMe")). However, I think that the better solution is to implement a custom event class which can store the dispatching object as a member variable. Something like this which I found on the web.
package.events
{
public class CustomEvent extends Event
{
public static const CUSTOM_TYPE:String = "customType";
public var customProp:String;
public function CustomEvent( type:String, cp:String, bubbles:Boolean, cancelable:Boolean )
{
super( type, bubbles, cancelable )
customProp = cp;
}
}
}
Thank you very much for your help and assistance !
6. Re: Get the origin of dispatched Eventdrillnaut Apr 30, 2009 6:06 PM (in response to drillnaut)
That did the trick, thanks
7. Re: Get the origin of dispatched Eventntsiii Apr 30, 2009 8:15 PM (in response to drillnaut)
FYI, event.currentTarget.className will return the class of the dispatching object. If the instance has an id, you can also access that.
Tracy
8. Re: Get the origin of dispatched EventFlex harUI
Apr 30, 2009 9:32 PM (in response to ntsiii)
A nit: event.currentTarget is probably the dispatching object in this case, but won't always be for bubbling and capture phase handlers.
Alex Harui
Flex SDK Developer
Adobe Systems Inc. | https://forums.adobe.com/message/1931713?tstart=0 | CC-MAIN-2018-13 | refinedweb | 648 | 61.46 |
.
My solution is simple:
If you need something more serious then you should keep locks information in database or better than that – use some lock server. Also you may consider developing WCF service.
As a first thing let’s create class that keeps lock information. I call this class as LockItem. This class doesn’t hold references to locked objects – only type and ID as there are many business layers that doesn’t use globally unique identifiers for objects.
public class LockItem
{
public Type ObjectType { get; set; }
public int ObjectId { get; set; }
public string SessionId { get; set; }
public DateTime LockedAt { get; set; }
}
LockItem class also contains property for session because otherwise it is not possible to know what objects session should release. LockedAt property is used to release expired locks.
LockManager is the most complex part of this example. It handles all the locking actions and keeps internal locks registry that contains information about locks. Here is the source for LockManager.
public static class LockManager
private static List<LockItem> _lockedItems;
static LockManager()
{
_lockedItems = new List<LockItem>();
}
public static bool IsLocked(BusinessBase obj)
var locksQuery = from l in _lockedItems
where l.ObjectType == obj.GetType()
&& l.ObjectId == obj.Id
select l;
return (locksQuery.Count() > 0);
public static bool Lock(BusinessBase obj, string sessionId)
if (IsLocked(obj))
return false;
lock (_lockedItems)
{
var lockItem = new LockItem
{
ObjectType = obj.GetType(),
ObjectId = obj.Id,
LockedAt = DateTime.Now,
SessionId = sessionId
};
_lockedItems.Add(lockItem);
return true;
}
public static void ReleaseLock(BusinessBase obj, string sessionId)
lock (_lockedItems)
var locksQuery = from l in _lockedItems
where obj.GetType() == obj.GetType()
&& obj.Id == l.ObjectId
&& sessionId == l.SessionId
select l;
ReleaseLocks(_lockedItems);
public static void ReleaseSessionLocks(string sessionId)
where sessionId == l.SessionId
ReleaseLocks(locksQuery);
public static void ReleaseExpiredLocks()
where (DateTime.Now - l.LockedAt) .TotalMinutes > 20
public static void ReleaseAllLocks()
_lockedItems.Clear();
private static void ReleaseLocks(IEnumerable<LockItem> lockItems)
if (lockItems.Count() == 0)
return;
foreach (var lockItem in lockItems.ToList())
_lockedItems.Remove(lockItem);
You can write special page to administrator interface that has button for calling ReleaseAllLocks(). It is good idea because at least during development I am sure you are creating many situations where locks are not released due to exceptions.
When session ends you have to release all locks that this session has. Otherwise those objects will be locked until you restart your web application or call ReleaseLocks method. Although ASP.NET Session_End event is called god knows when and you should not use this method due to this uncertainty I base my example exactly on that event. Copy this method to your Global.asax.ascx file.
protected void Session_End()
LockManager.ReleaseSessionLocks(Session.SessionID);
Now we have almost everything in place to start using locks.
I created simple view to test locks. You need two browsers to test if locks work okay. One browser locks the object for 20 seconds and the other gives you messages that object is locked. You have to make this second request with another browser during this 20 seconds when object is locked. Here is the ASP.NET MVC controller action for that purpose.
public ActionResult Index()
Response.Clear();
Response.ContentType = "text/plain";
var product = new Product { Id = 1, Name = "Heineken", Price = 1.2M };
if(!LockManager.Lock(product, Session.SessionID))
Response.Write("Object has already lock on it!\r\n");
Response.End();
return null;
Response.Write("Object successfully locked\r\n");
Response.Flush();
Thread.Sleep(20000);
Response.Write("Releasing lock\r\n");
LockManager.ReleaseLock(product, Session.SessionID);
Response.Write("Lock released\r\n");
Response.End();
return null;
If you are using old ASP.NET application then paste this code to Page_Load event of your application.
… you can go on and make your own modifications and customizations to this code. Before going to live with your own locking strategy test it hundred times at least. To make administration easier you can also create page that shows active locks and lets them release one lock at time or by session ID.
I would move the lock( _lockItems) into ReleaseLocks and remove the locks from the methods calling ReleaseLocks.
It is not need to lock the query, since it will be executed in the lock anyway.
And maybe you could use .Any() instead of .Count() since you are not really interested in how many locks there are, just "any" will do ;)
Another thing is that I would let LockManager return a disposable lock object so the dev can use the using keyword to release the lock when done with it.
Something like
using (LockManager.Lock(product, Session.SessionID)){
...
or
using (LockManager.TryLock(product, Session.SessionID, out locked))
{
if (locked)
{
...
}
// Ryan | http://weblogs.asp.net/gunnarpeipman/archive/2010/08/28/managing-business-object-locks-on-application-level.aspx | CC-MAIN-2014-15 | refinedweb | 761 | 50.94 |
graceful-fs functions as a drop-in replacement for the fs module, making various improvements.The improvements are meant to normalize behavior across different platforms and environments, and to make filesystem access more resilient to errors.fs module reading retry retries queue error errors handling emfile eagain einval eperm eaccess. See INSTALL.cybersecurity threat ioc malware phishing cert csirt intelligence incident-response alerts feeds incident handling automation ihap
Sedge is a highly customizable tool designed to help your customers create error reports. The reports can include log files, data files, system information, screenshots or any user's files.error-reporting data-collection error exception exceptions handling
jQuery plugin for practical HTML table handlingjquery-plugin table handling
windows in your browserjquery-plugin window windows table dialog popup handling
Simple error handling helper.error handling
Async form handling the angular way.Angular provides a great set of directives if your only concern is immediate validation in the UI; however, they fall short for anything else.angular async form handling angularjs angular-component
A handy little decorator for adding domain functionality to your HTTP server's request and response objects.Also, if the response has an error member which is a function, then it'll call that when there's an error.domains request response middleware express error handling
This project is an attempt to create a unified API for node.js SQL DB driver errors. Each driver throws their own kind of errors and libraries like knex, Bookshelf and objection.js simply pass these errors through. It's usually very difficult to reason with these errors. This library wraps those errors to error classes that are the same for all drivers. The wrapped error classes also expose useful information about the errors.NOTE: Only MySQL, Sqlite3 and PostgreSQL are officially supported (tested).mysql postgres postgresql sqlite3 error errors handling handler
A graceful error handler for Express applications. This also patches a DOS exploit where users can manually trigger bad request errors that shut down your app.@param {object} [options.handlers] Custom handlers for specific status codes.error errors handling handler express connect.crash crashes debug debugger debugging development dump err error errors exception exceptional handling fault heap heapdump log logger production panic uncaught uncaughtexception
Lightweight and isomorphic Web Socket lib with socket.io-like event handling, Promise-based requests, and channels. Much like Socket.io, this library provides a protocol and API that sits on top of native WebSockets. Rather than passing raw messages through the WebSocket via WebSocket.send(), this library provides an RPC-like API that allows you to pass JSON data over WebSockets and trigger event handlers on the remote end. There is also a Promise-based request/response API, as well.websocket event-handlers promise nodejs browser wrapper namespace ws event handling channels request
In most of the cases we rely on DOM events. They are tightly bound to our workflow. We normally add elements to the DOM tree dynamically. Whenever we want to get info from them we have to add event listeners. And guess what? Most of us are doing this every time when the UI is changed. That's because we remove or replace node's content. In such cases the attached listeners are gone. Bubble.js aims to help here. It adds listeners to the root of our logical blocks. It uses the bubbling model and nicely catches elements' events. Include Bubble.js in your page.dom events handling
This is a library for handling errors more efficiently in node.js, especially made for people like me who use function hoisting most of the time to avoid some of the so-called "callback hell". Notice that errors.notUnique takes the two parameters propertyName and propertyValue as defined in the args property above.error handling
We have large collection of open source products. Follow the tags from
Tag Cloud >>
Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
Add Projects. | https://www.findbestopensource.com/tagged/handling | CC-MAIN-2020-24 | refinedweb | 666 | 50.23 |
pooled actorsblalls asdsd Oct 31, 2007 11:23 PM
Hi all,
I am trying the Jbpm and facing some problem here.
How can I set up the pooled actors. Where they are supposed to be created? I could not find any thing in the documentation in this regard. Could somebody give me a hint please?
Thanks in advance
1. Re: pooled actorsPeter Aloysius Nov 2, 2007 6:50 AM (in response to blalls asdsd)
you may assign pooled actors with an AssignmentHandler
for example with processdefinition.xml like this:
<task name="test"> <assignment class="RoleAssignmentHandler"> </assignment> </task>
then create class RoleAssignmentHandler :
public class RoleAssignmentHandler implements AssignmentHandler { public void assign(Assignable assignable, ExecutionContext executionContext) throws Exception { String[] actors = {"Bill","John"}; assignable.setPooledActors(actors); } }
2. Re: pooled actorsRonald van Kuijk Nov 2, 2007 8:03 AM (in response to blalls asdsd)
you can also put a groupname in the pooled actors attribute
3. Re: pooled actorsblalls asdsd Nov 2, 2007 10:32 AM (in response to blalls asdsd)
I also find out that you can set somethng like actor-id="actorId" in the assignment when defining it as a pooled actor. But Jbpm gives an error informing that it could not find the pooled actor.
My question is how can I set up the pooled actors so that Jbpm could find them.
4. Re: pooled actorsRonald van Kuijk Nov 3, 2007 8:38 AM (in response to blalls asdsd)
actor-id != pooled actor.
actor-id is an individual actor (ie a 'user' in the jbpm identity table) and what this is is up to you.
pooled actors contains a list of individual actors and/or groups (in the jbpm identity table)
So setting up 'pooled' actors is greating a group and making users member of that group | https://developer.jboss.org/thread/116576 | CC-MAIN-2017-39 | refinedweb | 295 | 61.16 |
Hi, I am trying to create a tool that can run through all the field names in a parameter and assign field aliases for certain fields. I basically have many feature classes with pretty much the same fields that I would like to run this tool on to assign more readable aliases for others who see it. All I have really been able to come up with is a tool that is composed of a centipede of alter field tools, the only problem is, there are about 100 fields in the feature classes and I would want a more elegant tool. Is there any direction I should take? I am grasping model builder well but am very new to python.
Add some print statements to see if you can pinpoint where this is failing. Ex:
import arcpy
from arcpy import env
env.workspace = r"W:\IndividualFolders\DuBois\AreaBasedReporting\Reporting_Layers.gdb"
for fc in arcpy.ListFeatureClasses("*"):
try:
print fc
arcpy.AlterField_Management(fc, "STATE_NAME", "", "State Name")
print "Successfully updated field alias for STATE_NAME"
..... | https://community.esri.com/thread/104033-alter-multiple-fields-in-model-builderscript | CC-MAIN-2020-40 | refinedweb | 171 | 63.59 |
Let's Refactor My Personal Website and Portfolio using Gatsby, Part Four: CSS in JS Using Emotion
Michael Caveney
Updated on
・4 min read
Part One
Part Two
Part Three
Welcome to the latest entry in my portfolio refactor blog series! Today I'm going to discuss how you can make CSS architecture in your applications easier by using the popular CSS-in-JS library Emotion.
What Is CSS-in-JS?
CSS-in-JS is exactly what it sounds like: using some combination of architectural style or third-party library to place most, if not all of a project's CSS in the JS files. It's somewhat controversial amongst developers, but I have found it to simplify the CSS code I need to write in applications, making maintenance, debugging, and overall drafting of code quicker.
What is Emotion and How Does It Work?
There are several strong choices for CSS-in-JS libraries out there, but I'm going with Emotion on this project because I haven't used it before, and it has been one of the favorites for a long time. It's worth noting at this point that the major CSS-In-JS libraries more or less have feature parity, so use the one that works best for you or your team.
To use Emotion in a Gatsby project, we need to include the package(s) and the corresponding plugin:
npm i --save @emotion/core @emotion/styled gatsby-plugin-emotion
And add that plugin to
gatsby-config.js:
`gatsby-plugin-emotion`
There are a couple of different ways that I could go about styling with Emotion in Gatsby. The first, and my least preferred, is using the
css prop, which is literally sets the style(s) as a prop that gets passed into components, ala the following example:
import React from "react" import styled from "@emotion/styled" import { css } from "@emotion/core" const redBackground = css` background-color: red; ` <h1 css={redBackground}>I am a demo headline</h1>
While this can work for smaller insertions of code, I feel that it adds noise to the JS code and makes it less readable.
Edit: Something I've learned the hard way when using Emotion with Gatsby, or perhaps any instance in which you're trying to use it on non-native HTML elements: styled-components may not work as expected on certain elements (like Gatsby/Reach Router's
<Link />, and the css prop as absolutely necessary in instances like this.
My preferred architectural style for Emotion is using styled components, something cribbed from the previously mentioned styled-components library. This works by creating a new named component as a tagged template literal, and adding the styles inside, like the Headline component in the following example:
import React from "react" import styled from '@emotion/styled'; import Layout from "../components/layout" import Image from "../components/image" import SEO from "../components/seo" const IndexPage = () => ( <Layout> <SEO title="Home" /> <Headline>Hi people</Headline> <p>Welcome to your new Gatsby site.</p> <p>Now go build something great.</p> <div style={{ maxWidth: `300px`, marginBottom: `1.45rem` }}> <Image /> </div> </Layout> ); export default IndexPage; const Headline = styled.h1` color: white; background-color: purple `;
I like this style because:
It makes is easy to separate the CSS logic from the React logic on the page. You don't have to put the styled components underneath the export statement, but I do so for readability.
You have the opportunity to again, improve code readability, with semantically named components.
Having all component-specific logic, including styling, in one place can really aid with site building and maintenance speed.
Another advantage I almost forgot to mention is this technique disrupts the normal CSS cascade, resulting is less monkey-patching and hacks like
!importantto get desired results, which can reduce a lot of mental overhead.
You don't HAVE to put everything in components: My usual approach, especially for smaller site like this one is going to be, is to maintain a traditional CSS file for any and all global styling for the site, and put everything else in individual components. When I refactored the last iteration of my portfolio from standard CSS to styled-components, this reduced the size of my global CSS file by about 400 lines.
Wrap Up
At the end of the day, you have to decide if a CSS-In-JS library is a CSS tool that works for you, but I hope that a lot of others can get the vastly improved experience that tools like Emotion and styled-components have given me.
I've written very little application-specific code in these first four part of this walkthrough of my new site, but that changes next week as we take a deep dive into working with images in Gatsby, and a landing page starts to emerge!
What's in your podcast rotation right now?
Curious what everyone is listening to for podcasts these days, whether it be te...
| https://dev.to/dylanesque/let-s-refactor-my-personal-website-and-portfolio-using-gatsby-part-four-css-in-js-using-emotion-fc4 | CC-MAIN-2019-47 | refinedweb | 825 | 55.88 |
URL: <> Summary: Windown building Fails Project: AVR Downloader/UploaDEr Submitted by: c_oflynn Submitted on: Thu 11/24/05 at 14:10 Category: None Severity: 3 - Normal Priority: 5 - Normal Item Group: None Status: None Privacy: Public Assigned to: c_oflynn Originator Name: Colin O'Flynn Originator Email: address@hidden Open/Closed: Open _______________________________________________________ Details: Building on Windows fails with errors about ppi.c and par.c: Need to add to ppi.c: #if !defined(WIN32NATIVE) /* Rest of ppi.c */ #endif Need to add to par.c: INSIDE the Win32 native area: #if !defined(ppi_claim) # define ppi_claim(pgm) #endif #if !defined(ppi_release) # define ppi_release(pgm) #endif However those last two defs were removed, are they obsolete on everything? As Windows seems to need the dummy ones to compile. If that is an OK fix I'll commit to CVS. -Colin _______________________________________________________ Reply to this item at: <> _______________________________________________ Message sent via/by Savannah | http://lists.gnu.org/archive/html/avrdude-dev/2005-11/msg00021.html | CC-MAIN-2016-40 | refinedweb | 150 | 59.4 |
Anybody want to save me a half an hour of maintenance, and a few hours of sanity? Look this up. (alternately, if you already know apache, just answer the question) On Mon, Nov 09, 2009 at 12:31:31PM -0200, Han-Wen Nienhuys wrote: > On Mon, Nov 9, 2009 at 9:54 AM, Jan Nieuwenhuizen <address@hidden> wrote: > > > The technical reasons for using web/ and doc/v2.xx are: > > - easier rsyncing, moving, verifying > > - clean namespace -- currently we have quite some other > > things at the root. it's easy to get collisions, we > > need to really think this through very well before > > going forward with this > > Can't we have the directory structure internally with /web/ , > /download/ what have you, and use some serverside URL rewriting to > make translate > > /foo/ > > into > > /web/foo/ > > ? Does apache have mechanisms for rewriting the serving path without > rewriting the URL that appears in browser window? I would like this. I'd like that a lot. We could keep the simpler build structure, but still have simpler urls. Cheers, - Graham | http://lists.gnu.org/archive/html/lilypond-devel/2009-11/msg00286.html | CC-MAIN-2015-22 | refinedweb | 174 | 70.02 |
Hello again, I'm slowly getting better, I would never have been able to get this far before, but I'm stuck. Here's what my program is supposed to do:
1. Develop a C++ program that uses a while structure to input the miles driven and gallons used for each tankful. The program should calculate and display the miles per gallon obtained for each tankful. After processing all input information, the program should calculate and print the combined miles per gallon obtained for all tankfuls. Your output screen should somewhat look like the following:.0000
Enter the gallons used (-1 to end): -1
The overall average miles/gallon was 21.601423
Ok here's what I have so far:
#include <iostream> using namespace std; int main() { int g=0,m=0,a=0; while(g>-1) { cout<<"Enter the gallons used (-1 to end): "<<endl; cin>>g; cout<<"Enter the miles driven: "<<endl; cin>>m; a=(m/g); cout<<"The miles per gallon for this tank of gas was: "<<a<<endl; } return 0;
What i'm a bit stuck on:
1.) If a put a decimal in for my gallons used such as: 13.1 the program just starts spitting out information.
2.)If I put in 13 for my gallons used and 200 for my miles driven, my answer should be 15.38461538, but I get just 15. How do I get it to show rounding?
As always, thank you again for all the help. | https://www.daniweb.com/programming/software-development/threads/69126/what-am-i-doing-wrong | CC-MAIN-2018-13 | refinedweb | 247 | 80.82 |
A lot of programming languages these days feature lambda functions, or what I would be just as happy to call anonymous functions. Some people make a big deal out of these but the core idea is very simple. Sometimes you need a little snippet of code that you only need in one place — most commonly, as a callback function to pass another function — so why bother giving it a name? Depending on the language, there can be more to it that, especially if you get into closures and currying.
For example, in Python, the map function takes a function as an argument. Suppose you have a list and you want to capitalize each word in the list. A Python string has a capitalize method and you could write a loop to apply it to each element in the list. However,
map and a lambda can do it more concisely:
map(lambda x: x.capitalize(), ['madam','im','adam'])
The anonymous function here takes an argument x and calls the capitalize method on it. The map call ensures that the anonymous function is called once for each item.
Modern C++ has lambda expressions. However, in C you have to define a function by name and pass a pointer — not a huge problem, but it can get messy if you have a lot of callback functions that you use only one time. It’s just hard to think up that many disposable function names. However, if you use gcc, there are some nonstandard C features you can use to get most of what you want out of lambda expressions.
Why GCC?
You have to use gcc, because this trick uses two nonstandard language features. First, gcc allows nested functions. In addition, you can use statement expressions. That is an expression that can do everything a function can.
These two things, combined with some abuse of the preprocessor, will let you stuff your function code right where you need it and relieve you of having to name each and every little function you write just to pass to another subroutine.
If you use another compiler, it might not — in fact, probably doesn’t — have these features. In the end, though, you could always just use a proper function with a pointer. This is a bit nicer.
Let’s Start
I created a simple example of a case where you might want to use a lambda in C. You can find it on GitHub. There’s an array of floating point numbers,
thelist, and two functions that process the list. One averages the list after multiplying each value by 2. The other does the same task but divides each entry by 3 first.
A contrived example, to be sure, but easy enough to understand. If you study the code, the two averaging functions,
average2x and
averagethird, are almost the same. The only difference is the one point where the math is different.
Now look at this version. Here, the
average_apply function does all the averaging work, but it requires a function pointer,
fn, to do the math operation you want. There are two functions to work out the math:
float twox(float x) { return 2*x; } float xdiv3(float x) { return x/3; }
Then making the call is easy:
printf("%f\n", average_apply(twox)); printf("%f\n", average_apply(xdiv3));
Of Course…
Those little snippets of code now need names and we won’t really use them anywhere else. That’s the perfect spot for a lambda. You can put this in a header file (although I just left it at the top of the file for this example):
#define lambda(lambda$_ret, lambda$_args, lambda$_body)\ ({\ lambda$_ret lambda$__anon$ lambda$_args\ lambda$_body\ &lambda$__anon$;\ })
This takes advantage of the gcc features I mentioned and the fact that gcc will let you use dollar signs in identifiers. That means that you might need to pass
-std=gnu99 on the gcc command line to make this work properly. This should do it:
gcc -o clambda2 --std=gnu99 clambda2.c
Now the calls just put the functions right in line:
printf("%f\n", average_apply(lambda(float,(float x),{ return 2*x; }))); printf("%f\n", average_apply(lambda(float,(float x),{ return x/3.0; })));
By the way, I realize you could just pass a factor of 2 or 0.3333 to one function, but that’s not the point. The functions could be as complex as you like. Like most programming problems, there are many ways to solve this.
Caveats
There are caveats. You can’t depend on the lambda having a scope beyond the enclosing function so an asynchronous callback would not work. Accessing local variables in the enclosing scope is iffy. Consider this code:
int factor=10; printf("%f\n",average_apply(lambda(float,(float x),{ return x/factor; })));
This compiles and ought to work. It does work for this online compiler. However, using the Linux system for Windows 10, the same code would seg fault. In fact, if you didn’t set the gcc -O2 option, the other examples would seg fault, too. On my Linux boxes, it works fine. I can’t tell if this is a bug in Windows or if Linux is just covering up something wrong. However, it seems like if it compiles it ought to work and — mostly — it does.
In Practice
Granted, you don’t have to have lambdas with C. Even if you want them, they aren’t very portable. But it is still interesting to see how some gcc-specific compiler features work and it is also an interesting intellectual exercise to try to match it.
The technique is not new. If you search, you can find quite a few postings in various places with the same idea, although each one has small variations. Of course, in C++ of recent vintage you can use lambdas with no problem. By the way, lambdas are all the rage for cloud computing, too, and it is a similar idea. A little function that just runs without having to wait on a server for a request.
46 thoughts on “Lambdas For C — Sort Of”
Friends don’t let friends use compiler specific language extensions… (except when developing for bare metal!)
gcc should be the new C standard
No, it shouldn’t be. Some things are better kept implementation specific.
Oh geez. C was not intended to have this level of abstraction. C++, Python, etc have good reasons to have lambda functions (namespace pollution, closures, etc). Note that there are anonymous methods in C#.
You kids can get off of my lawn. And you can pry my cold dead hands from my copy of ANSI/ISO C (IEC9899).
Right on!!
Sandard C? Luxury!
When I was young, our dad used to read from the K&R book to us every night. And that, let me tell you, did not have the red smear on the cover proclaiming “ANSI C” on it! That was good enough for us. Kids these days are spoiled, getting a new C++ standard every 2 or 3 years.
You were lucky. We lived for three months in a core rope memory. We used to have to get up at six o’clock in the morning, flush the rom, eat a crust of stale bread, go to work down bus for fourteen hours a day week in-week out. When we got home, our Dad would thrash us to sleep with his belt! But you try and tell the young people today that… and they won’t believe ya’.
You were lucky! It was up-bus both ways in my time.
C is great because you can do whatever you like from one extreme to the other… I use OO concepts in C, I use encapsulation for instance (through function pointers) even for embedded applications. Everyone is crazy about python, it was Rust, Java and many others before, but you know what ? C runs the world!
typedef struct DNNA_SourceTypeDef
{
char path[DNNA_MAX_PATH_LENGHT];
int fileDescriptor;
short onError;
DNNA_IO_Type ioType;
DNNA_IO_Buffer buffer;
DNNA_IO_BaudRate baudRate;
/* — Methods — */
int (*openMethod) (DNNA_SourceType *p_src, DNNA_IO_Type io, int buffer_size);
int (*readMethod) (DNNA_SourceType *p_src);
int (*writeMethod) (DNNA_SourceType *p_src);
int (*closeMethod) (DNNA_SourceType *p_src);
} DNNA_SourceType;
ANSI C would imply C89, but IEC9899 you could mean almost anything, even C18.
I prefer IEC9899:1999 unless I actually need 9899:2011.
As stated in the article, lambdafication is a feature that garners seems more attention than it might deserve.A I have seem seen folks essentially.claim that a.function like map demands a lambda .. obviously, it doesn’t.
The preceding comment makes a great point that lambdas ido have their place .. a disposable function’s one-and-done nature can make things cleaner,. Also, a lambda has scoping rules that match the scope where it was it was defined. For example, a lambda that is declared within a non-static class method has access to het “self” values for objects of that class.
So they are definitely nice.
But they seem to be largely syntactic sugar that is layered on the ability to pass functions as arguments .. and nearly all modern languages seem to have first class functions.
I’ll concede that I may be missing some essential capability of a lambda that can’t be supported by a “non-anon” function, and I would genuinely welcome being set straight if that’s the case.
Damn, I am nearly certain that the text in the entry screen was not as garbled as the post was. I have seen weird stuff happen in editing boxes with the Android Chrome browser .. could it be that the text displayed in the box occasionally differs from the actual text posted?
This kind of ‘lambda’ is just a simplification of the normal C notion of named procedure, separating out the naming and the procedure-creation. But in general ‘lambdas’ imply closures, which is a much more powerful concept: a closure also has access to its defining scope, which means that it lets you abstract over the data required to make a particular implementation of a function work.
This is kind-of equivalent to passing a ‘data’ argument along with the function pointer, as is common in C, but has an important distinction: the *type* of the function is also abstracted over, and doesn’t need to leak into the interface of whatever calls the function. This can be done in C only with an indirection, e.g. a void*, which necessarily throws away some safety guarantees and performance.
Of course, if you have existential types, they offer a more general mechanism for this kind of hiding. A lambda can be written as a pair of a value of existential type and a (non-capturing) function from that type.
“The anonymous function here takes an argument x and calls the capitalize method on it. The map call ensures that the anonymous function is called once for each item.”
Something, something, on a calculator.
Please don’t do this to C. If lambda was a useful feature K&R would have included it. There are reasons C is feature limited, and it becomes quite apparent when you look at the wretched code written by modern programmers in less performant languages.
Or should I say less performant programmers in modern languages?
Fundamentalism is never good. I think this is a nice hack and example what kind of specifics gcc has. However you have a point that modern “programmers” can write code that make you want to rip your eyes out, dont give them this kind of ideas please!
In computer tech, fundamentalism is core. It’s literally what makes computers tick.
“If lambda was a useful feature K&R would have included it.”
If that were true, all development on all languages would have ended with the all-powerful work of Kernighan and Ritchie. Your inability to find usefulness in a thing does not make it useless. Many including myself have found great utility from languages and language features that have been added since 1978.
Honest question – do you find difficulty finding employment when you restrict yourself to a 42 year old feature set?
Sure, I find it difficult to cooperate and communicate with people who can’t program. Think I will now roll over and become a lamer? I have a pretty awesome track record and operate with confidence.
All C code is wretched, filled with potential buffer overflows and incorrect arithmetic expectations. You’re a fool to expect anything else.
You don’t make any sense at all. K&R were working on a PDP-11 with crippling memory and architecture constraints. Their version of “C” does not include “const” or function protoypes, shall we rip those out too? Oh and what about the “safe” version of sprint, snprintf? Shall we get rid of that? I have my beat old copy of K&R right here, next to the 68000 assembler manual, both old and dead.
K&R imagined that all programmers were perfect and look where that got us! MITRE has an entire department of people whose job is to keep track of crappy C code and warn the rest of us about it.
Oh yeah, and this is best fixed using fringe concepts in slow interpreters. ‘Sir, we have eliminated the threat by dealing substandard coders dummy tools.’
If K&R didn’t want people to invent ways to make their code more concise they would have left out the preprocessor.
.” — GCC docs
In other words, it’s a whole new way to write code that appears to work but actually doesn’t, so it really is a worthy addition to the C language.
What exactly is lambda$__anon$ in the #define?
“lambda$__anon$” becomes the function name. The final statement in the macro body, “&lambda$__anon$” effectively returns the address of the function.
I’ve tinkered with this on godbolt.org, does anyone know if you actually need the dollars in the lambda? (It seems to compile without them on all the platforms that it compiles on with them, ie removing them doesn’t make a difference.)
I put the dollar signs in because that’s a gcc extension and makes it unlikely to collide with other code. They have no special meaning.
Hahaha thank you. This is hilarious. but you can get even more pythonic:
auto_ fn = lambda(float,(float x),2*x);
printf(“%f\n”,apply(fn, l, len(l)));
printf(“%f\n”,apply(lambda(float,(float x),2*x), l, len(l)));
Come to that, I think I’d rather use a list comprehension to handle that python example:
[x.capitalize() for x in [‘madam’,’im’,’adam’]]
But could perfectly well be a generator if you don’t mind not being able to access the result without iterating it.
bt I guessit’s all beside the point. Personally I just use lambdas where I need a quick one-off function, for example as an argument to sort()
You can have lambdas in C with GCC and Clang:
I love using blocks and gcd. Code blocks can be used in C code.
After reading this article, I am sure that if i had to debug or refactor code written like this, it would give me life threatening diarrhea.
This made my day.
I’ve been programming since there was only assembly. And I’ve programmed in languages most have never heard of as well as all the ones mentioned here. Lambda have a legitimate use case I suppose, but, IMHO they just serve to obfuscate and make code hard to read…and give bragging rights to those who need them. 😎
sorry, but anonymous functions are part-and-parcel of good program design. Lexical scoping means you don’t have to add hacks to get at your variables when you need them. Inlining the function means that information is local, you don’t need to repeat over and over again what a variable means in different places. Keeping excess stuff out of the namespace means LESS complexity, not more. Having to sequester a minor subroutine far from the action makes code harder to read, not easier.
Oh and by the way, you are the one doing the bragging about your supposed skills, do you even know what the H in IMHO means?
>>anonymous functions are part-and-parcel of good program design
Respectfully, I disagree.
Isn’t code more than just some text translated to instructions run by computer? Like a good book, code is also a means to convey my thought process to the reader, isn’t it? In such case, shouldn’t the reader be given first priority? Since not all readers are alike, shouldn’t it be in the language and structure that is understood with minimal cognitive efforts from the least skilled readers’ perspective?
I’d rather have lengthy, well laid out code structure that even a first year intern could understand than having code that appears beautiful.
I could have a thousand examples from highly successful enterprise products running code written in C, C++, Java, Python, JS even Forth. Made plenty of mistakes in the past twenty years and learned from them. The fundamental principle I learned my mistakes and others’ is simple. The current layer of code should present what it is doing. If the reader needs to know how it is done, he/she/they shall dig into further layers and/or modules. This worked out pretty well so far.
Pretty humble, IMO, considering the mayhem caused by unnecessary constructs used by inexperienced coders.
I think I’ll just wait for whatever C version gets native lambdas. Especially since callback functions are about 99.999% of what I’d want to use them for.
Great idea: let’s abuse some compler-specific features to add unnecessary complexity to a language that already has plenty of bug-generating “features”.
Why any insane person would do such a thing (sane people don’t use C)? Just add second argument to function, for example a char, that will be tested to see if the function should do one thing, or another.
I believe that’s what “Switch… Case” statements are for. I could be wrong though.
You did: map(lambda x: x.capitalize(), [‘madam’,’im’,’adam’]) which is 53 characters. Without the lamba, you get: map( str.capitalize, [‘madam’,’im’,’adam’] ) which is 45 characters. How does adding 8 character make it more concise?
You poor little C programmers working for all those huge companies with huge programs to write and maintain, something that wouldn’t be possible in C++ if Lambda’s didn’t exist.
In Assembly language all I have to do is cut and paste a function wherever I want it to be — no prototyping or labeling or overly-verboose syntax needed! It is the same thing done by your compiler whenever it encounters a Lambda in your code, except I think my code is more readable than yours is because nothing is hidden and everything is all in one place. And it would much simpler and readable to boot. So why is it you can’t do that? Afterall, you are just going to use that function just one, so why scatter bits and pieces of it everywhere throughout the rest of your code, when you could just put everything all in one place and accomplish the same thing?
And don’t tell me that C wasn’t meant to as abstract as C++ is, because C++ was originally written in C by K&R (source code still available on the Internet). They wrote abstract concepts in C to use as concrete classes in C++. I’m pretty sure it would have looked every bit as much of a kludge as this ad hoc implementation of the Lambda in C code was. Lambda’s aren’t designed to make code more readable or maintainable for any of us, it was meant to provide job security for all the people who aren’t very logical or good programmers, yet they are still highly paid programmers anyway.
So if some big business wants to pay some compiler manufacturer off to add yet another useless feature to a standard for something that no body else in the world asked them for, to solve a simple problem they had no idea how to solve, it can be done the same way it has been done in the past: by starting out writing it in Assembly or C first, and then translating it to C++/C#. The question is, why would anyone in their right mind want to do that, when a more simpler and easier way to do it existed, if only you actually knew what you were doing?
This comment is about as clear and concise as the lambda-infested code written by ‘modern’ programmers. But thank you, I think you’re right.
In C we’re supposed to let the compiler worry about cutting and pasting the code. We don’t need to optimize that, we just need to lay it out in as simple, direct, and clear a way as possible so that the compiler can optimize it. Oh yeah, and so people can read it.
If you have a big project, it is only a few hundred or thousand lines of code to build out a quality object system, and then the compiler throws it out as pastes it all together for you later. Lambdas are no advantage, merely a stylistic choice, if you assume a large project. Certainly for a Perl one-liner you might need them or you’ll get stuck with three lines.
It’s not wizardy, it’s judicious use of GCC “statement expressions” (see here for more details:). The “lambda” function is defined and stored with the program code (check Compiler Explorer to verify for yourself) and the address of the function is what gets passed to “average_apply” (or whatever the receiving function is). You also don’t need the macro, though it helps readability. The following compiles cleanly under the handful of GCC versions I tried (and also doesn’t require any optimizations):
#include
#include
int g(int (*x)(int m), int y)
{
return x(y);
}
int main( int argc, char * argv[] )
{
int res = g(({int x(int m){return m*3;}; &x;}),atoi(argv[1]));
printf(“Result is: %d\n”, res);
}
This example returns 3 times the value of whatever command-line value is given after the executable name (i.e. Compile with “gcc main.c”. Run with “./a.out 3” and the console should display “Result is: 9”).
Statement expressions are also used here () to create a header-only linked-list implementation that works for any data type, even user-defined data types.
Whether or not you think using GCC extensions is good practice or not, it’s not undefined behavior or trickery. It’s a valid and stable part of GCC.
Please be kind and respectful to help make the comments section excellent. (Comment Policy) | https://hackaday.com/2019/09/11/lambdas-for-c-sort-of/ | CC-MAIN-2022-40 | refinedweb | 3,839 | 71.85 |
Name | Synopsis | Interface Level | Description | Structure Members | See Also
#include <sys/types.h> #include <sys/kstat.h> #include <sys/ddi.h> #include <sys/sunddi.h>
Solaris DDI specific (Solaris DDI)
Each kernel statistic (kstat) exported by device drivers consists of a header section and a data section. The kstat structure is the header portion of the statistic.
A driver receives a pointer to a kstat structure from a successful call to kstat_create(9F). Drivers should never allocate a kstat structure in any other manner.
After allocation, the driver should perform any further initialization needed before calling kstat_install(9F) to actually export the kstat.
void *ks_data; /* kstat type-specif. data */ ulong_t ks_ndata; /* # of type-specif. data records */ ulong_t ks_data_size; /* total size of kstat data section */ int (*ks_update)(struct kstat *, int); void *ks_private; /* arbitrary provider-private data */ void *ks_lock; /* protects kstat's data */
The members of the kstat structure available to examine or set by a driver are as follows:
Points to the data portion of the kstat. Either allocated by kstat_create(9F) for the drivers use, or by the driver if it is using virtual kstats.
The number of data records in this kstat. Set by the ks_update(9E) routine.
The amount of data pointed to by ks_data. Set by the ks_update(9E) routine.
Pointer to a routine that dynamically updates kstat. This is useful for drivers where the underlying device keeps cheap hardware statistics, but where extraction is expensive. Instead of constantly keeping the kstat data section up to date, the driver can supply a ks_update(9E) function that updates the kstat data section on demand. To take advantage of this feature, set the ks_update field before calling kstat_install(9F).
Is a private field for the driver's use. Often used in ks_update(9E).
Is a pointer to a mutex that protects this kstat. kstat data sections are optionally protected by the per-kstat ks_lock. If ks_lock is non-NULL, kstat clients (such as /dev/kstat) will acquire this lock for all of their operations on that kstat. It is up to the kstat provider to decide whether guaranteeing consistent data to kstat clients is sufficiently important to justify the locking cost. Note, however, that most statistic updates already occur under one of the provider's mutexes. If the provider sets ks_lock to point to that mutex, then kstat data locking is free. ks_lock is really of type (kmutex_t*) and is declared as (void*) in the kstat header. That way, users do not have to be exposed to all of the kernel's lock-related data structures.
Name | Synopsis | Interface Level | Description | Structure Members | See Also | http://docs.oracle.com/cd/E19253-01/816-5181/kstat-9s/index.html | CC-MAIN-2015-40 | refinedweb | 436 | 58.48 |
Creating Functions in Objective-C
So far, the code in the programs we’ve discussed has executed automatically when the programs start. But functions are different; you have to explicitly call a function by name in your code before its code will run. That means that using functions, you can divide your code into smaller parts: the divide and conquer technique.
In Objective-C, functions are a crucial stop on the way to building your own objects. Objects let you package both data and functions—called methods when they’re built into objects—together, as you’ll soon see.
Here is an example of how you might create a function named greeter():
#include <stdio.h> void greeter(void) { printf("Hello there."); } . . .
Note the function’s structure: In front of its name (here, greeter), you specify a return type, which indicates the type of the data item that the function can return. Since greeter() doesn’t return any data, the return type is void.
Then, in parentheses following the name comes a list of arguments; these are the data items you pass to the function to let it do its work. Since the greeter() function takes no arguments, it uses void for the argument list as well. Then comes the body of the function—the actual code that runs when you call the function—enclosed in curly braces: { and }. In this case, the greeter() function simply displays a message: “Hello there.”
The whole thing—the line that gives the function’s return type, name, and argument list, as well as the body of the function—is called the function’s definition.
You can call the greeter() function by name to run it from the code in main()—which itself is a function:
#include <stdio.h> void greeter() { printf("Hello there."); } int main() { greeter(); return 0; }
Now when your program runs, it will start automatically by calling the main() function. The code in the main() function includes a call to the greeter() function, which then will display its message. Nice.
You’ll get the full story on functions here: how to pass data to them, how to return data from them, how to pass pointers to them to access the data in the calling code directly, how to make them call themselves (a process called recursion), and how to set up pointers to them and then call them using those pointers.
Listing 4.1. Starting function.m.
#include <stdio.h> void greeter() { printf("Hello there."); } . . .
Listing 4.2. The function.m program.
#include <stdio.h> void greeter() { printf("Hello there."); } int main() { greeter(); return 0; }
Defining a Function
In this first task, we’ll put to work the example introduced in the chapter opener: the greeter() function.
To create a function:
- Create a new program named function.m.
- In function.m, enter the code shown in Listing 4.1.
This code creates the greeter() function.
- Add the code shown in Listing 4.2.
This code adds the main() function and the call to the greeter() function.
- Save function.m.
- Run the function.m program.
You should see the following:
Hello there. | https://www.peachpit.com/articles/article.aspx?p=1567320&seqNum=8 | CC-MAIN-2020-24 | refinedweb | 519 | 71.55 |
For each loop in Java
In this tutorial, we are going to learn about one of the most famous looping techniques, For each loop in Java that is also known as enhanced for loop. This loop is a control flow statement used for traversal of an array or a collection. In Java it was firstly introduced in JDK 1.5.
It’s common syntax is: –
for(return datatype : the collection or the array name){ //Code You Want To Write; }
For each loop Java Implementation
Now we are gonna create a String Array containing some random String values. So, we will be using for each loop to traverse through that array and print its value.
CODE: –
public class Main { public static void main(String[] args) { String array[]={"ASD","ZXC","QWE","RTY","GHJ"}; for(String i:array){ System.out.println(i); } } }
Code Output: –
ASD ZXC QWE RTY GHJ
We saw that in this loop we did not even mention the length of the array and we traversed all the elements. The syntax is also quite simple just the return type and the name of the array that is being traversed.
Now we are creating a list(collection) of integers and we are going to add the integers in the list and will print it’s sum.
CODE: –
import java.util.*; public class Main { public static void main(String[] args) { List<Integer> lst=new ArrayList<Integer>(); lst.add(10); lst.add(20); lst.add(30); lst.add(40); int sum=0; for(int i:lst){ sum+=i; } System.out.println("The sum of the List is: "+sum); } }
Code Output: –
The sum of the List is: 100
Some bulletin points for using for each loop: –
- We Can’t use this loop for backward propagation i.e we cannot go from back to front in this. For this first reverse the array then we can propagate backward.
- It is less prone to error due to its easy syntax.
- No use of indexing is there.
Also read: –
Exit from a loop in Java with | https://www.codespeedy.com/for-each-loop-in-java/ | CC-MAIN-2020-29 | refinedweb | 338 | 71.44 |
Documenting a Module
The multi-line comment to generate that information in the document is:
{- | Module : OpenSSL.Digest.ByteString Copyright : (c) 2010 by Peter Simons License : BSD3 Maintainer : simons@cryp.to Stability : provisional Portability : portable Wrappers for "OpenSSL.Digest" that supports 'ByteString'. -}
The fields are on the left side, separated by a colon and the r-value for the field. Stability and Portability are subjective. If your API for the module is subject to change frequently, or you know that it will change in the foreseeable future, mark this field as 'Unstable'. If your module depends on other Haskell code not included in a default ghc installation, a Foreign Function Interface, or a feature only found in a very recent or very old version of ghc, mark your module as Non-portable, and possibly give a reason why. For instance, in one of my modules, I have the line "Portability : Portable (standalone - ghc)", meaning that it does not rely on any other modules within its own namespace, nor any module not included in a default ghc installation.
Documenting your Function, Typeclass, Method, Instance, etc.
This is the last type of documentation you need to add to your Haskell module to bring its documentation up to speed. Single-line comments above functions, usually separated by a newline from the function's type signature (if included), and preceded immediately after the comment (--) by a pipe (|), are Haddock comments.
Take this trivial function:
rev :: [a] -> [a]
rev [] = []
rev (x:xs) = rev xs ++ [x]
ghc already knows the type signature is [a] -> [a], because you told it. For good measure, it'd know even if you didn't; type inference. Because of this, there's no need to talk about the types of data a function can receive. You need only discuss the purpose of the function. The function rewritten with a haddock comment:
-- | Reverses a finite list.
rev :: [a] -> [a]rev [] = []rev (x:xs) = rev xs ++ [x]
Conclusion
Now you see that it's really super easy (and, dare I say, fun?) to document your Haskell code. However, some people believe that "Good code speaks for itself", and that that idiom holds especially true for ML derivatives with type signatures. In fact, superfluous comments will actually clutter your code more than anything. What's the etiquette for commenting?
I will leave that "as an exercise for the reader", as many Haskell bloggers often do for various topics. My personal preference is to always include Haddock comments in code that will be parsed and documented for me anyway. If you maintain a package on Hackage, the popular repository for Haskell, put a bit of Haddock in your code, even for self-explanatory functions. If you're just going to upload it to github and forget about it? There's no point in using Haddock, unless you're anal about good documentation. Use good judgement on when and when not to use this powerful tool. | http://profectium.blogspot.com/2014_01_01_archive.html | CC-MAIN-2017-47 | refinedweb | 490 | 62.98 |
Details
- Type:
Bug
- Status: Resolved
- Priority:
Major
- Resolution: Fixed
- Affects Version/s: 5.5.0
-
- Component/s: JMS client
-
- Environment:
jdk 1.6.0_23 for Linux 64 bit, Ubuntu 11.04
Tomcat 6.0.32
Spring 3.0.5
Description ?
Issue Links
- is related to
-
-
- relates to
-
-
-
Activity
- All
- Work Log
- History
- Activity
- Transitions
Duplicate of
Duplicate
Linked a similar issue, not sure if this is a duplicate.
does calling: org.apache.activemq.thread.DefaultThreadPools#shutdown work for you? I guess it would need to be part of a javax.servlet.ServletContextListener or called as part of the shutdown of your message listener container.
I guess we would need to include a little helper class to make it easier to configure.
I am having similar issue where tomcat does not shut down properly because of activemq threads.
I tried above solution org.apache.activemq.thread.DefaultThreadPools#shutdown, it does not help. I called this inside my contextDestroyed in tomcat, and it makes no difference to the situation.
and BTW i have tested this on tomcat 5, 6 and 7 with activemq 5.5.0
The situation happens only when there were messages on the queue and messages where being processed inside onMessage of a listener. If there are no messages on the queue, it shuts down properly if we call connection close etc in cotextDestroyed.
In my case the message appears regardless of the queue(s) being empty.
Using activemq 5.5 with camel 2.8 and spring 3.0.5 deployed to tomcat 6.0.32
Broker is set up locally using activemq camel component.
I have the same issue in Activemq 5.5.
I tried :
broker.getTaskRunnerFactory().shutdown();
broker.getPersistenceTaskRunnerFactory().shutdown();
broker.stop();
broker.waitUntilStopped();
Scheduler.shutdown();
but it doesn't change anything
For me the following seems to work:
Interrupt the TCP transport socket handler daemon thread:
Index: activemq-core/src/main/java/org/apache/activemq/transport/tcp/TcpTransportServer.java
===================================================================
— activemq-core/src/main/java/org/apache/activemq/transport/tcp/TcpTransportServer.java (revision 1214868)
+++ activemq-core/src/main/java/org/apache/activemq/transport/tcp/TcpTransportServer.java (working copy)
@@ -380,6 +380,8 @@
if (serverSocket != null)
+ this.socketHandlerThread.interrupt();
+ this.socketHandlerThread = null;
}
Shutdown the task runner factory in a servlet context listener:
public class CleanupAmqThreads implements ServletContextListener {
@Override
public void contextInitialized(ServletContextEvent sce) {
}
@Override
public void contextDestroyed(ServletContextEvent sce)
}
Looked at some similar issue, and it seems to me it's just Tomcat doesn't like threads created for async closing of activemq connections. Try using URLs like
failover:(tcp://localhost:61616?closeAsync=false)
and see if it helps.
Same problem, using Active MQ 5.5.1. Tried with "closeAsync=false" which didn't seem to make any difference.
Hello,
Have you got a workaround to solve this issue ?
Sincerely
I have same issue after stop my application by Tomcat.
I don't know why ActiveMQ team doesn't fix it for a long time.
I crated a war to reproduce this issue. Please refer to. Hope this is helpful.
@liny, thanks for that test case war. Peeking at the code, I think the problem is related to the code in com.foo.MainApplication#stop
That closes the connection, (returns them to the pool), but does not stop the connection pool. It does however stop the executors, and this prevents the real close of the connections when the spring context calls the custom stop destroy method. This is evident from the ERROR o.a.a.transport.tcp.TcpTransport - Could not stop service: tcp://foo.com/15.87.14.93:61616. Reason: java.util.concurrent.RejectedExecutionException exception.
So you can explicitly call close on the connection pool, like:
conn.close(); ((PooledConnectionFactory) springHelper.getBean("pooledJmsFactory")).stop(); DefaultThreadPools.getDefaultTaskRunnerFactory().shutdown(); DefaultThreadPools.shutdown();
or somehow arrange it such that the calls to shutdown() are done when the spring context is destroyed. So after the connection pool is successfully destroyed.
@Gary
Thanks for reply. Directly call below method in my stop() still can't work.
((PooledConnectionFactory) springHelper.getBean("pooledJmsFactory")).stop();
Please refer to for details.
The problem is that when you put ActiveMQ libraries into Tomcat shared "lib" folder, then ActiveMQ thread pool becomes shared between all web applications. When a web application sends a message, then a transport thread is created by a web application, then the thread is returned to the pool. Then the web application is undeployed, the thread remains alive in the pool and can be re-used by another applicaiton. In results into a memory leak, because the thread is still alive after undeployment of web application and references the web application context classloader.
Attached a screenshot with profiler which clearly shows a memory leak.
However, when I removed ActiveMQ libraries from tomcat shared libraries and packaged them into WAR, the problem has gone because each web application now has its own ActiveMQ thread pool.
You can't call org.apache.activemq.thread.DefaultThreadPools#shutdown when ActiveMQ libraries are in Tomcat shared libs, because calling that method will shutdown the shared thread pool, and all other web application deployed to the same Tomcat will be unable to send any JMS messages. You can do that when ActiveMQ libraries are packaged into web application only.
Whether you have a memory leak or not depends on how fast you re-load or re-deploy applications and how intense ActiveMQ is used by other web applications on the same tomcat. Sometimes "ActiveMQ Transport" or "ActiveMQ Task" thread is terminated by inactivity, and in that case you don't have a memory leak. Most of the time you have a memory leak when deploying ActiveMQ to Tomcat shared libs.
The problem is in org.apache.activemq.thread.TaskRunnerFactory#executor. The thread pool's keepAliveTime is 30 seconds. If you have a single web application in Tomcat which uses JMS, and
you re-start (or re-deploy) your web application in an interval less that 30 seconds, then the thread is not terminated and re-used, the thread references the undeployed web applicaiton classloader and JVM cannot collect undeployed application and free PermGen memory area.
@Sergey this is great information
So the crux seems to be the classloader reference, if the pool is to be shared then it must not refer to an app specific loader. Do you understand the nature of that reference?
The alternative approach is to remove the use of the statically defined default task runner factory from client side code and use one per connection factory.
@Gary
Yes, I understand the nature of the reference. When ActiveMQ thread pool creates a new thread, then the thread inherits the current thread context classloder. When the client web application is creating a JMS connection, then the context classloder is Tomcat WebAppClassLoader. As long as the thread is alive, it references web application classloader. The thread can be re-used by another web application while still holding a reference to the undeployed web application which created the thread.
hmm, ok. so it sounds like a sensible fix is to clear and reset the tccl in the thread factory such that it is not inherited by the activemq task runner threads.
I just wonder if that behavior will break any clients, am thinking cxf and jaxb or in servicemix etc. It may need to be configurable via a system property just incase.
fancy taking a stab at a patch?
@Gary
Ok, I will try to set tccl to null and then will run the memory profiler again.
I have tried the patch below
-------------------------
Index: activemq-core/src/main/java/org/apache/activemq/thread/TaskRunnerFactory.java
===================================================================
— activemq-core/src/main/java/org/apache/activemq/thread/TaskRunnerFactory.java (revision 1366667)
+++ activemq-core/src/main/java/org/apache/activemq/thread/TaskRunnerFactory.java (working copy)
@@ -108,6 +108,8 @@
Thread thread = new Thread(runnable, name + "-" + id.incrementAndGet());
thread.setDaemon(daemon);
thread.setPriority(priority);
+ thread.setContextClassLoader(null);
return thread;
}
});
-------------------------
Still have memory leak, now because of inherited access control context, see the screenshot.
Attached a patch which cleans the thread's context classloader and inherited security context.
Hi,
Is the solution is one of bellows?
1. Killed all sessions, wait more than 30 secs, then thread pool will kill himself.
2. Use patch.txt
@Sergey
No, I didn't put ActiveMQ Lib in tomcat share lib directory. So your solutions work, right? If yes, really appreciated. I'll try soon!
@liny
I you didn't put ActiveMQ lib in tomcat shared lib, then I don't understand why you have a memory leak, because when I package ActiveMQ libs to WEB-INF/lib, then I don't have any memory leaks except
AMQ-3959.
You need to deploy your web application, then stop it in Tomcat Manager, then use Eclipse Memory Analysis tool, take a heap dump, open histogram, group by clasloader, then find paths to GC root for WebAppClassLoader. When done, you will know for sure the cause of the memory leak.
@Sergey
My situation is described at with a simple web app. Would you like to try to see if you can see the same problem like me? Eclipse Memory Analysis looks a good tool, will try it.
@liny
I have downloaded the application from, and analyzed the heap dump.
I don't see any memory leaks related to threads, the only memory leak with your web application is
AMQ-3959
@Sergey
The issue is more fundamental than your patch. Those threads are created by the default task runner factory and this factory is created once and then never shutdown throwout the life time of the process.
Adding a shutdown of the default task runner will remove this issue but will raise another issue when using the shared classloader of the application server with multiple containers.
The default task runner should be associated with the broker server and not a self contained static class. This should resolve the case of its use within the broker side code but will not resolve this issue within the client side issue. That needs a little more work on getting this to work properly.
I have tried to shutdown the default task runner factory fix but when I hot deploy the container again. It raises a rejected exception when trying to add a task to the runner since this executor has been shutdown already.
I tried a fix to associates a default task runner factory to the broker and that resolved the issue I was initially seeing.
I still have an issue with the client code that uses the default task runner factory. This still needs work on my end and will probably require a different fix that would provide a similar solution. I was thinking about using WeakReferences associated with a ReferenceQueue. Whenever the remove method is called the task runner factory can be shutdown. This might work. I just need to implement this.
--Claudio
When can we expect a solution to this issue ? We are facing the same issue on Tomcat7 as well.
If people only run 1 broker in the JVM, we could as a temporary fix, add some flag/option/whatever to tell the broker, to shutdown these thread pools when the BrokerService is shutdown.
Its of course a bit tricker when its a JMS client, as that would be some stop logic in a ConnectionFactory or the likes, to get a callback when to shutdown.
The org.apache.activemq.thread.DefaultThreadPools seems to be used in 2 areas
- by the broker a bit
- transports
The code for the broker, can be refactored to use a broker specific executor, so when the broker shutdown, those threads will be shutdown as well. That should be doable
The transports can be used by JMS clients as well, so I wonder as Gary says, can we use a dedicated thread pool (executor service) per transport?
If that would be doable, then we have start|stop callbacks on the transports, where we can ensure the thread pool is setup / shutdown properly.
I have attached a patch to fix the part that is used by the broker, to use the executor the broker itself provides.
Anyone see a problem with that? The unit tests passes, and a brief spin of running a standalone broker seems fine.
Hello Claus,
Would it be possible to attach the updated ActiveMQ jar please.Also let me know which version of ActiveMQ are you using.
I am trying the 5.7.snapshot since it has the new DefaultThreadPools.getDefaultTaskRunnerFactory().shutdown(); method but still Tomcat7 fails to shutdown cleanly.
The ASF CI server will once in a while deploy a new SNAPSHOT you can download. Keep an eye on
The attached patch only fixes on the broker side, there is still all the transports. I am continuing on the patch, taking one step at a time. Currently testing with 2 more fixes for discover agent and another place. Then next is the remainder 7 transports using it.
Patch with more fixes. Only the transports to go now.
Thank you very much for working on this issue.I'll check the builds page.
Okay got as far with a JMS client in Tomcat now not reporting any leaks from its console, when I stop the app or redeploy it.
>
No web applications appear to have triggered a memory leak on stop, reload or undeploy.
With an embedded AMQ broker I still get this
> The following web applications were stopped (reloaded, undeployed), but their
classes from previous runs are still loaded in memory, thus causing a memory
leak (use a profiler to confirm):
/camel-example-activemq-tomcat
Patch with transport connections fixes. I also attached the core JAR for people to give a try. The other SNAPSHOT jars are in maven snapshot repo, where you can download them. As no fixes has yet been committed to the codebase.
I discovered a leak in Camel, when JMX is enabled.
First part of patch is committed to the code base. The connector/transport code need a bit more love, as they tend to either create the pools in ctr / start or stop lifecycle methods. The code could possible be more consistent among them.
Okay
AMQ-4026 is now committed, so we have a better API for shutting down thread pools. Will work on getting the patches in the codebase, so the JMS Client work well in Tomcat when re-deploying apps.
A fully embedded ActiveMQ broker in Tomcat has a number of more pools and other parts in the works, eg such as JMX and whatnot that can cause a bit pain, eg to ensure all JMX stuff is properly unregistered and whatnot.
First priority is the JMS client though.
Okay got the JMS client leak fixed and committed to trunk. No leaks reported by Tomcat, and the WebappClassLoader did not have any strong references to any classes anymore. So seems we can fully undeploy/redeploy without leaks now.
Okay got further on the embedded broker side. Got a classloader leak fixed due a spring introspection cache, needed to be explicit cleared.
The tomcat manager console now says there is no leaks. And all activemq and camel classes is fully unloaded when stopping the app.
One last thing would be a JMX thread not being shutdown on the broker side.
My connection factory is declared in web.xml
<!-- Standalone ActiveMQ -->
<Resource name="jms/connectionFactory" auth="Container" type="org.apache.activemq.ActiveMQConnectionFactory"
description="Repository JMS Connection Factory" factory="org.apache.activemq.jndi.JNDIReferenceFactory"
brokerURL="failover:(tcp://localhost:61616)?timeout=3000&jms.redeliveryPolicy.maximumRedeliveries=2&jms.redeliveryPolicy.initialRedeliveryDelay=3000L&jms.redeliveryPolicy.useExponentialBackOff=false"
brokerName="LocalActiveMQBroker"/> | https://issues.apache.org/jira/browse/AMQ-3451?focusedCommentId=13104532&page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel | CC-MAIN-2015-22 | refinedweb | 2,592 | 56.86 |
pretty-print with color
Project description
clog
This project is now simply a shortcut for using rich.
If you want to save yourself a dependency, just use
rich.
Usage
Pass any data into clog and it'll get pretty-printed.
>>> from clog import clog >>> data = {'here': 'is some data'} >>> clog(data)
You can also give it a title:
>>> clog(data, title="My Data")
Or change the color:
>>> clog(data, title="My Data", color="red")
Colors
This library uses
rich under the hood, so it theoretically supports
any color that
rich supports.
Disclaimer
The
clog function is now simply a wrapper around:
from rich.panel import Panel from rich.pretty import Pretty from rich import print print(Panel(Pretty(msg), title=title, subtitle=subtitle, border_style=color))
So, seriously... just use
rich.
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
clog-0.3.1.tar.gz (2.8 kB view hashes) | https://pypi.org/project/clog/ | CC-MAIN-2022-27 | refinedweb | 166 | 59.5 |
Ubuntu.Components.ComboButton
Ubuntu button providing a drop-down panel visualizing custom options. More...
- Obsolete members
Properties
- collapsedHeight : real
- comboList : list<Item>
- comboListHeight : real
- expanded : bool
- expandedHeight : real
- font : font
- iconPosition : string
Detailed Description
The component is composed of three main blocks: main button, dropdown and combo list.
The main button holds the main functionailty of the component, and it is located at the left-top side of the expanded button. The clicked() signal is triggered only when this button is pressed.
The dropdown is a button located on the right of the main button. Its functionality is to drive the component's expanded state.
The combo list is a panel showing the content specified in comboList property when expanded. The content is stretched horizontally to the component's width, and its height is controlled by the expandedHeight property as follows:
- If the content height is smaller than the value of expandedHeight, the combo list will be expanded only to the height of the content.
import QtQuick 2.4 import Ubuntu.Components 1.3 ComboButton { text: "smaller content" Rectangle { height: units.gu(5) // smaller than the default expandedHeight color: "blue" } }
- If the content height is greater than expandedHeight, the combo list will expand till the height specified by the property and the content will be scrolled; in case the combo list content is one single Flickable, ListView, GridView or PathView, the content scrolling will be provided by the content itself.
import QtQuick 2.4 import Ubuntu.Components 1.3 ComboButton { text: "long scrolled content" Column { Repeater { model: 5 spacing: units.gu(1) Rectangle { height: units.gu(5) color: "blue" } } } }
- In case the content is a single Flickable, ListView, GridView or PathView, the content will be filling the entire combo list area defined.
import QtQuick 2.4 import Ubuntu.Components 1.3 import Ubuntu.Components.ListItems 1.3 ComboButton { text: "listview" ListView { model: 10 delegate: Standard { text: "Item #" + modelData } } }
- Vertical anchoring of combo list content to its parent is not possible as the expansion calculation is done based on the combo list content height. If the content wants to take the size of the entire combo list, it should bind its height to the comboListHeight property.
import QtQuick 2.4 import Ubuntu.Components 1.3 ComboButton { id: combo text: "smaller content" Rectangle { height: combo.comboListHeight color: "blue" } }
- In case the expansion needs to be the size of the combo list content, the expandedHeight should be set to -1.
import QtQuick 2.4 import Ubuntu.Components 1.3 ComboButton { text: "auto-sized content" expandedHeight: -1 Column { Repeater { model: 5 spacing: units.gu(1) Button { text: "Button #" + modelData } } } }
The combo list can be expanded/collapsed either through the expanded property or by clicking on the dropdown button. It is not collapsed when pressing the main button or clicking on the combo list. In order to do an auto-collapsing button you must reset the expanded property (set it to false) when the main button is clicked or when a selection is taken from the combo list content. The following example illustrates a possible implementation.
import QtQuick 2.4 import Ubuntu.Components 1.3 ComboButton { id: combo text: "Auto closing" expanded: true expandedHeight: units.gu(30) onClicked: expanded = false UbuntuListView { width: parent.width height: combo.comboListHeight model: 20 delegate: Standard { text: "Action #" + modelData onClicked: { combo.text = text; combo.expanded = false; } } } }
Styling
The style of the component is defined in ComboButtonStyle.
Property Documentation
The property holds the height of the component when collapsed. By default the value is the implicit height of the component.
Property holding the list of items to be shown in the combo list. Being a default property children items declared will land in the combo list.
Note: The component is not responsible for layouting the content. It only provides scrolling abilities for the case the content exceeds the defined expanded height.
The property holds the maximum combo list height allowed based on the expandedHeight and collapsedHeight values. It is a convenience property that can be used to size the combo list content.
import QtQuick 2.4 import Ubuntu.Components 1.3 import Ubuntu.Components.ListItems 1.3 ComboButton { id: combo text: "Full comboList size" ListView { anchors { left: parent.left right: parent.right } height: combo.comboListHeight model: 20 delegate: Standard { text: "Action #" + modelData } } }
See also collapsedHeight and expandedHeight.
Specifies whether the combo list is expanded or not. The default falue is false.
The property holds the maximum height value the component should expand. When setting the property, remember to take into account the collapsedHeight value. The best practice is to use bind it with collapsedHeight.
ComboButton { text: "altered expandedHeight" expandedHeight: collapsedHeight + units.gu(25) }
A value of -1 will instruct the component to expand the combo list as much as its content height is.
The default value is collapsedHeight + 19.5 GU, so at least 3 ListItems can fit in the combo list.
See also collapsedHeight.
The font used for the button's text.
The position of the icon relative to the text. Options are "left" and "right". The default value is "left".
If only text or only an icon is defined, this property is ignored and the text or icon is centered horizontally and vertically in the button.
Currently this is a string value. We are waiting for support for enums: | https://phone.docs.ubuntu.com/en/apps/api-qml-development/Ubuntu.Components.ComboButton | CC-MAIN-2021-04 | refinedweb | 880 | 51.65 |
How to Set Up Embarcadero's Free C++ Compiler for Windows
The Embarcadero isn't a good compiler like gcc, so use it. The Gcc C and C++ compiler is a free command line compiler which allows conversion of C or C++ applications into runnable computer programs (*.exe). This compiler is extremely well used and versatile. It is also a great value for its price of zero dollars.
Steps
- 1Go to Embarcadero download page.
- 2Select C++ Compiler 5.5 link or click Download Button.
- 3Read and accept the Export agreement.
- 4Sign-in or register for an Embarcadero web account (free).
- 5The download starts automatically. If not, click on the here link.
- 6Run the executable you’ve just downloaded. Specify a directory in which to store the files that the installer will install. Keep a note of this directory.
- 7Wait for everything to install. Once this is done, you will need to make some changes of your system environment to make the compiler work.
- 8
- 9Click on "Environment variables" (you will need administrator privileges).
- 10In the system variables box, find the PATH variable, select it, then click on the Edit button.
- 11Type a semi-colon, then add the path to the compiler's BIN directory. If you did not change the default install directory, then you will just need to copy and paste this on the end of the path environment variable (without quotes): "
;C:\Borland\BCC55\Bin".
- 12
- 13Go to file and click "Save As". Navigate to your /bin directory and save the file as a plain text document with the name "
bcc32.cfg".
- 14Open a new blank document/file in notepad or wordpad again.
- 15Paste the following lines inside of it (remember to change the path names if you installed in a different path):
-L"C:\Borland\BCC55\Lib"
- 16Save this file as as plain-text file in the same directory as the previous file. Name it "
ilink32.cfg"
- 17Test your compiler. Open a new document/file in your favorite text editor and paste the following code in it:
#include <stdio.h> int main(void) { printf("Hello world!\n"); return 0; }</stdio.h>
- 18Save the new file as a plain-text file in My Documents. Name it "
helloworld.c".
- 19
- 20Change directories to your My Documents folder. This will vary with your operating system (replace
Usernamewith your computer username):
- Windows XP:
cd "C:\Documents and Settings\Username\My Documents"
- Windows Vista and 7:
cd "C:\Users\Username\Documents"
- 21Type in the command prompt:
bcc32 helloworld.c. Press enter.
- 22Type in the command prompt:
helloworld.exe. Press enter. The text "Hello world!" should appear in the command compiler complains about not being able to find the include files, try enabling file extensions. Make sure the files are named
bcc32.cfgand
ilink32.cfg, not
bcc32.cfg.txtand
ilink32.cfg.txt!
Warnings
- Do not attempt these steps if you are not competent with computers. You can easily mess up something!
Article Info
Categories: C Programming Languages
Thanks to all authors for creating a page that has been read 46,779 times. | https://www.wikihow.com/Set-Up-Embarcadero%27s-Free-C%2B%2B-Compiler-for-Windows | CC-MAIN-2018-05 | refinedweb | 509 | 68.36 |
Alan Cox wrote:> I'd rather keep the existing initialisation behaviour of using the eeprom> for 2.2. There are also some power management cases where I am not sure> the values are restored on the pcnet/pci.> > For 2.2 conservatism is the key. For 2.4 by all means default to CSR12-14 and> print a warning if they dont match the eeprom value and we'll see what it> shows> > > Alan, do you want me to put your inline version in <linux/etherdevice.h>> > while I'm at it, or what?> > SureHere is the 2.2.18 patch... I'll send the 2.4.1 patch shortly.This one still uses the PROM since we are going for least change ininitialization.is_valid_ether_addr() is static inline in <linux/etherdevice.h>Is this one satisfactory?Eli--------------------. Rule of Accuracy: When working towardEli Carter | the solution of a problem, it always eli.carter@inet.com `--------------------- helps if you know the answer.--- linux/drivers/net/pcnet32.c 2001/01/20 11:10:30 1.1.1.6+++ linux/drivers/net/pcnet32.c 2001/02/15 19:08:55@@ -648,10 +648,33 @@+ */+ {+ /* There is a 16 byte station address PROM at the base address.+ The first six bytes are the station address. */+ for (i = 0; i < 6; i++) {+ dev->dev_addr[i] = inb(ioaddr + i);+ }+ if( !is_valid_ether_addr(dev->dev_addr) ) {+ /* also double check this station address */+ for (i = 0; i < 3; i++) {+ unsigned int val;+ val = a->read_csr(ioaddr, i+12) & 0x0ffff;+ /* There may be endianness issues here. */+ dev->dev_addr[2*i] = val & 0x0ff;+ dev->dev_addr[2*i+1] = (val >> 8) & 0x0ff;+ }+ /* if this is not valid either, force to 00:00:00:00:00:00 */+ if( !is_valid_ether_addr(dev->dev_addr) )+ for (i = 0; i < 6; i++)+ dev->dev_addr[i]=0;+ }+ */@@ -796,6 +819,10 @@ lp->shared_irq ? SA_SHIRQ : 0, lp->name, (void *)dev)) { return -EAGAIN; }++ /* Check for a valid station address */+ if( !is_valid_ether_addr(dev->dev_addr) )+ return -EINVAL; /* Reset the PCNET32 */ lp->a.reset (ioaddr);--- linux/include/linux/etherdevice.h 2001/01/19 19:25:31 1.1.1.1+++ linux/include/linux/etherdevice.h 2001/02/15 19:08:55@@ -51,6 +51,14 @@ unsigned char *src, int length, int base); #endif +/* Check that the ethernet address (MAC) is not 00:00:00:00:00:00 and is not+ * a multicast address. Return true if the address is valid.+ */+static __inline__ int is_valid_ether_addr( u8 *addr )+{+ return !(addr[0]&1) && memcmp( addr, "\0\0\0\0\0\0", 6);+}+ #endif #endif /* _LINUX_ETHERDEVICE_H */ | http://lkml.org/lkml/2001/2/15/85 | CC-MAIN-2017-09 | refinedweb | 417 | 60.41 |
(new in Tk 8.4) The LabelFrame widget is a variant of the Tkinter Frame widget. By default, it draws a border around its child widgets, and it can also display a title.
When to use the LabelFrame Widget
The LabelFrame can be used when you want to group a number of related widgets, such as a number of radiobuttons.
Patterns #
To display a group, create a LabelFrame, and add child widgets to the frame as usual. The widget draws a border around the children, and a text label above them.
from Tkinter import * master = Tk() group = LabelFrame(master, text="Group", padx=5, pady=5) group.pack(padx=10, pady=10) w = Entry(group) w.pack() mainloop()
You can use options to control where and how to draw the label, and how to draw the border. See below for details.
Reference #
- LabelFrame(master=None, **options) (class) [#]
A frame widget with an internal group border and an opertional label.
- frame. This defaults to the application background color. To prevent updates, set the color to an empty string. (the option database name is background, the class is Background)
- bd=
- Same as borderwidth.
- bg=
- Same as background.
- borderwidth=
- Border width. Defaults to 2 pixels. (borderWidth/BorderWidth)
- class=
- Default is Labelframe. (class/Class)
- colormap=
- Some displays support only 256 colors (some use even less). Such displays usually provide a color map to specify which 256 colors to use. This option allows you to specify which color map to use for this frame, and its child widgets.
By default, a new frame uses the same color map as its parent. Using this option, you can reuse the color map of another window instead (this window must be on the same screen and have the same visual characteristics). You can also use the value “new” to allocate a new color map for this frame.
You cannot change this option once you’ve created the frame. (colormap/Colormap)
- container=
-) | http://effbot.org/tkinterbook/labelframe.htm | crawl-001 | refinedweb | 322 | 67.55 |
.
As elaborated in the Status section, this specification is subject to change. Items presently under consideration by the WG are either noted in the main text or listed in F Format Features Under. Deriving Character Sets from XML Schema Regular Expressions
F Format Features Under Consideration (Non-Normative)
F.1 Strict Schemas
F.2 IEEE Floats
F.3 Bounded Tables
F.4 Grammar Coalescence
F.5 Indexed Elements
F.6 Further Features Under Consideration
G Example Encoding (Non-Normative)
H Changes from First Public Working Draft (Non-Normative)
Icard. either compression or alignment. absent..:
<header xmlns=""> < pre-compression alignment. When set to true, the event codes and associated content are compressed according to 9. EXI Compression regardless of the alignment option value.
[Definition:]XML in XML in that they consist of a sequence of elements, processing instructions and comments in containers of their own that are physically separate from the documents in which they are to be used. An EXI fragment is formally defined in terms of its grammar in Section.
[Definition:] The preserve option is a set of Booleans that can be set independently to control whether certain information items are preserved in the EXI stream. 6.3 Fidelity Options describes the set of information items effected by the preserve option.
[Definition:].
. EXI compression and alignment or alignment, the ith part of an event code is encoded using the minimum number of bytes instead of bits required to distinguish it from the ith part of the other sibling event codes in the current grammar. Each part for the n-bit unsigned integer representation in this case is equal to ⌈ n / 8 ⌉.
Regardless of the EXI compression and alignment options, EXI compression and alignment or alignment).. F.2 encoded. Otherwise, URI and local-name components are encoded as Strings (see 7.1.10 String) per the rules defined for uri content item and a local-name content item, respectively. UCS.., where 0 ≤ i < n and n is the number of type declarations in the schema.Name = {name} and qname uri = {target namespace} .-1 , create a grammar ParticleTerm i as follows:
Generate a set of grammars S 0 = { Particle 0 , Particle 1 , ..., Particle n-1 } corresponding to the list of particles P 0 , P 1 , ..., P n-1 according to section 8.5.3.1 ,-1:
Given the sorted list of productions P 0 , P 1 , … P n with the non-terminal G i, j on the left hand side, assign event codes to each of the productions as follows:
The normalized element and type grammars derived.6 Particles for the rules used to derive grammars from particles.
Grammars for attribute uses of attributes "sku" and "color" are as follows. See section 8.5.3.1.4. no more.
XML Schema datatypes specification [XML Schema Datatypes] defines its regular expression", respectively..
WildcardEsc(i.e. meta-character
'.'). See [XSD:37a].
MultiCharEscthat is one of
'\S',
'\I',
'\C',
'\D'and
'\w'. See [XSD:37].
complEsc(examples of which are
'\P{ L }'and
'\P{ N }'). See [XSD:26].
negCharGroup..) | https://www.w3.org/TR/2007/WD-exi-20071219/ | CC-MAIN-2016-07 | refinedweb | 505 | 57.57 |
We're told we're supposed to save independently for retirement to avoid struggling during our golden years, but data from the U.S. Government Accountability Office tells us that nearly half of workers 55 and older are creeping toward that milestone without any personal savings to show for. And while part of that could boil down to poor money management, an overreliance on Social Security might also share the blame.
Many workers mistakenly believe that Social Security will suffice in covering their bills in retirement. But that's a misconception that could cause millions of Americans to wind up cash-strapped during their golden years.
IMAGE SOURCE: GETTY IMAGES.
You can't live on Social Security alone
Social Security isn't meant to sustain seniors by itself. Those benefits will replace about 40% of an average earner's pre-retirement income. For higher earners, it'll replace an even smaller percentage. Meanwhile, most seniors need roughly 80% of their previous income to live comfortably. Those with lofty goals that involve extensive travel and nightlife might need considerably more. Either way, relying on Social Security alone is a truly bad idea, and one that could cause you to come up short once you stop collecting a paycheck.
If you're still not convinced, consider this: The average Social Security recipient today collects $17,532 a year in benefits. That's barely above the poverty line, and certainly not enough to support a comfortable retirement. Therefore, if you want to enjoy your golden years, get the following through your head: Social Security, in a best-case scenario, will only pay for half of your retirement. The rest of your income will need to come from you.
Ramping up your savings game
If you've been neglecting your savings thus far, consider this your wakeup call that Social Security alone won't cut it in retirement. Rather, it's on you to save enough to be able to enjoy your golden years. The good news is that you do have an opportunity to catch up on savings, even if you're on the older side and retirement isn't so far off.
Workers who are 50 or older can currently contribute up to $7,000 a year to an IRA, and $25,000 a year to a 401(k). Now if you're not in the habit of saving anything, you probably can't snap your fingers and start maxing out a 401(k) overnight. What you can do, however, is start saving something immediately, and then increase your savings rate as you make lifestyle changes that allow you to do so.
That's right: You'll need to seriously consider cutting back on expenses and saving the difference if you want a shot at a secure retirement. But think about it this way: If you don't make an effort to save today, you'll likely be forced to cut back on a lot of expenses in retirement -- things like cable TV and other luxuries you currently enjoy.
What will curbing your spending and banking the difference do for your nest egg? Imagine you're able to set aside $500 a month for the next 12 years. If you invest that money at an average annual 7% return (which is more than doable when you load up on stocks), you'll wind up with $107,000. Now frankly, that's not a ton of money to retire with. But it is a start. Furthermore, if you're able to set aside $1,000 a month over the next 12 years, you'll accumulate $215,000, assuming that same 7% return.
At the same time, if you're an older worker without much savings, you may have to get on board with the idea of working in some capacity during retirement. A part-time job that supplements your income by $300 or so a week can compensate for a minimal or nonexistent retirement plan balance. And you don't necessarily have to do something you hate -- you can take a hobby you enjoy and turn it into a income-generating opportunity.
While Social Security serves as a crucial income source for many seniors today, it can't pay for your retirement on its own. If you're an average earner, you can probably count on it to provide around half of your retirement income, but not more. The balance, therefore, will need to come from you in some shape or. | https://www.nasdaq.com/articles/how-much-your-retirement-will-social-security-pay-2019-04-14 | CC-MAIN-2021-43 | refinedweb | 748 | 60.04 |
This is the CodeEval problem #181, and here is my Python 3 solution.
ALPHA is the vocabulary we have to use.
ALPHA = ' !"#$%&\'()*+,-./0123456789:<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'I have converted the sample provided to a Python test case, adding an extra test that shows how the decoding works at an extreme of the alphabet:
def test_provided_1(self): self.assertEqual('EXALTATION', solution('31415;HYEMYDUMPS')) def test_provided_2(self): self.assertEqual('I love challenges!', solution('45162;M%muxi%dncpqftiix"')) def test_provided_3(self): self.assertEqual('Test input.', solution('14586214;Uix!&kotvx3')) def test_extra(self): self.assertEqual('xyz', solution('3; !"'))Gronsfeld is a simple extension of the Caesar ciphering method. Instead of using a single number that shifts the plain text to its encrypted version, more numbers could be used. Since the message could be longer than the key, we repeat the key to get the shift we have to apply to a given character in the message.
As you can see, my extra test does not use the Gronsfeld extension capability, falling back to the Caesar schema. It's point is just to show what happens when I encrypt letters that are on the extreme right of the vocabulary.
The core of my solution is a loop that executes a single line converting each character back to its plain counterpart and appending it to the result.
result.append(ALPHA[ALPHA.index(data[1][i]) - data[0][i % len(data[0])]])data[0] is a list of integers, representing the key.
data[1] is a string, the encrypted message.
The index in ALPHA for the plain character is given by the index in ALPHA of the encrypted one minus the key for that position. In this way it could happen that we get a negative index, but this is OK, since python manages them right how we need.
I pushed test case and solution python script to GitHub. | http://thisthread.blogspot.com/2017/02/codeeval-gronsfeld-cipher.html | CC-MAIN-2018-43 | refinedweb | 310 | 56.15 |
On Fri, 26 Aug 2005, Jose Alberto Fernandez
<jalberto@cellectivity.com> wrote:
> Now, for backward compatibility and for convinience in general, one
> would like to be able to put in the -lib directories a bunch of
> antlib jars and that all their tasks get declared automatically as
> part of the default name space.
Steve's approach would allow you to load them into different
namespaces. I don't see that much benefit over <typedef
resource="..."/> in his case, though.
> So, any ideas how this could be acomplished?
Load all resources from META-INF/antlib.xml at startup and process
them, I'd say.
Stefan
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@ant.apache.org
For additional commands, e-mail: dev-help@ant.apache.org | http://mail-archives.apache.org/mod_mbox/ant-dev/200509.mbox/%3C87r7byggfo.fsf@www.samaflost.de%3E | CC-MAIN-2021-04 | refinedweb | 123 | 60.82 |
{- libmpd for Haskell, an MPD client library. Copyright (C) 2005-2007 Ben Sinclair <bsinclai@turing.une.edu : Network.MPD.Commands -- Copyright : (c) Ben Sinclair 2005-2007 -- License : LGPL -- Maintainer : bsinclai@turing.une.edu.au -- Stability : alpha -- Portability : Haskell 98 -- -- Interface to the user commands supported by MPD. module Network.MPD.Commands ( -- * Command related data types State(..), Status(..), Stats(..), Device(..), Query(..), Meta(..), Artist, Album, Title, Seconds, PLIndex(..), Song(..), Count(..), -- * Admin commands disableoutput, enableoutput,, tagtypes, urlhandlers, password, ping, reconnect, stats, status, -- * Extensions\/shortcuts addMany, deleteMany, crop, prune, lsdirs, lsfiles, lsplaylists, findArtist, findAlbum, findTitle, listArtists, listAlbums, listAlbum, searchArtist, searchAlbum, searchTitle, getPlaylist, toggle, updateid ) where import Network.MPD.Prim import Control.Monad (liftM, unless) import Prelude hiding (repeat) import Data.List (findIndex, intersperse) import Data.Maybe -- -- Data types -- type Artist = String type Album = String type Title = String type Seconds = Integer -- | Available metadata types\/scope modifiers, used for searching the -- database for entries with certain metadata values. data Meta = Artist | Album | Title | Track | Name | Genre | Date | Composer | Performer | Disc | Any | Filename instance Show Meta where show Artist = "Artist" show Album = "Album" show Title = "Title" show Track = "Track" show Name = "Name" show Genre = "Genre" show Date = "Date" show Composer = "Composer" show Performer = "Performer" show Disc = "Disc" show Any = "Any" show Filename = "Filename" -- | A query is composed of a scope modifier and a query string. data Query = Query Meta String -- ^ Simple query. | MultiQuery [Query] -- ^ Query with multiple conditions. instance Show Query where show (Query meta query) = show meta ++ " " ++ show query show (MultiQuery xs) = show xs showList xs _ = unwords $ map show xs -- | Represents a song's playlist index. data PLIndex = Pos Integer -- ^ A playlist position index (starting from 0) | ID Integer -- ^ A playlist ID number that more robustly -- identifies a song. deriving Show -- | Represents the different playback states. data State = Playing | Stopped | Paused deriving (Show, Eq) -- | Container for MPD status. data Status = Status { stState :: State -- | A percentage (0-100) , stVolume :: Int , stRepeat :: Bool , stRandom :: Bool -- | A value that is incremented by the server every time the -- playlist changes. , stPlaylistVersion :: Integer , stPlaylistLength :: Integer -- | Current song's position in the playlist. , stSongPos :: Maybe PLIndex -- | Current song's playlist ID. , stSongID :: Maybe PLIndex -- | Time elapsed\/total time. , stTime :: (Seconds, Seconds) -- | Bitrate (in kilobytes per second) of playing song (if any). , stBitrate :: Int -- | Crossfade time. , stXFadeWidth :: Seconds -- | Samplerate\/bits\/channels for the chosen output device -- (see mpd.conf). , stAudio :: (Int, Int, Int) -- | Job ID of currently running update (if any). , stUpdatingDb :: Integer -- | Last error message (if any). , stError :: String } deriving Show -- | Container for database statistics. data Stats = Stats { stsArtists :: Integer -- ^ Number of artists. , stsAlbums :: Integer -- ^ Number of albums. , stsSongs :: Integer -- ^ Number of songs. , stsUptime :: Seconds -- ^ Daemon uptime in seconds. , stsPlaytime :: Seconds -- ^ Total playing time. , stsDbPlaytime :: Seconds -- ^ Total play time of all the songs in -- the database. , stsDbUpdate :: Integer -- ^ Last database update in UNIX time. } deriving Show -- | Represents a single song item. data Song = Song { sgArtist, sgAlbum, sgTitle, sgFilePath, sgGenre, sgName, sgComposer , sgPerformer :: String , sgLength :: Seconds -- ^ Length in seconds , sgDate :: Int -- ^ Year , sgTrack :: (Int, Int) -- ^ Track number\/total tracks , sgDisc :: (Int, Int) -- ^ Position in set\/total in set , sgIndex :: Maybe PLIndex } deriving Show -- Avoid the need for writing a proper 'elem' for use in 'prune'. instance Eq Song where (==) x y = sgFilePath x == sgFilePath y -- | Represents the result of running 'count'. data Count = Count { cSongs :: Integer -- ^ Number of songs matching the query , cPlaytime :: Seconds -- ^ Total play time of matching songs } deriving Show -- | Represents an output device. data Device = Device { dOutputID :: Int -- ^ Output's ID number , dOutputName :: String -- ^ Output's name as defined in the MPD -- configuration file , dOutputEnabled :: Bool } deriving Show -- -- Admin commands -- -- | Turn off an output device. disableoutput :: Int -> MPD () disableoutput = getResponse_ . ("disableoutput " ++) . show -- | Turn on an output device. enableoutput :: Int -> MPD () enableoutput = getResponse_ . ("enableoutput " ++) . show -- | Retrieve information for all output devices. outputs :: MPD [Device] outputs = liftM (map takeDevInfo . splitGroups . toAssoc) (getResponse "outputs") where takeDevInfo xs = Device { dOutputID = takeNum "outputid" xs, dOutputName = takeString "outputname" xs, dOutputEnabled = takeBool "outputenabled" xs } -- | Update the server's database. update :: [String] -- ^ Optionally specify a list of paths -> cmd = "list " ++ show mtype ++ maybe "" ((" "++) . show) query -- | Non-recursively list the contents of a database directory. lsinfo :: Maybe String -- ^ Optionally specify a path. -> MPD [Either String Song] lsinfo path = do (dirs,_,songs) <- liftM takeEntries (getResponse ("lsinfo " ++ maybe "" show path)) return (map Left dirs ++ map Right songs) -- | List the songs (without metadata) in a database directory recursively. listAll :: Maybe String -> MPD [String] listAll path = liftM (map snd . filter ((== "file") . fst) . toAssoc) (getResponse ("listall " ++ maybe "" show path)) -- | Recursive 'lsinfo'. listAllinfo :: Maybe String -- ^ Optionally specify a path -> MPD [Either String Song] listAllinfo path = do (dirs,_,songs) <- liftM takeEntries (getResponse ("listallinfo " ++ maybe "" show path)) return (map Left dirs ++ map Right songs) -- | Search the database for entries exactly matching a query. find :: Query -> MPD [Song] find query = liftM takeSongs (getResponse ("find " ++ show query)) -- | Search the database using case insensitive matching. search :: Query -> MPD [Song] search query = liftM takeSongs (getResponse ("search " ++ show query)) -- | Count the number of entries matching a query. count :: Query -> MPD Count count query = liftM (takeCountInfo . toAssoc) (getResponse ("count " ++ show query)) where takeCountInfo xs = Count { cSongs = takeNum "songs" xs, cPlaytime = takeNum "playtime" xs } -- -- Playlist commands -- -- $playlist -- Unless otherwise noted all playlist commands operate on the current -- playlist. -- | Like 'add', but returns a playlist id. addid :: String -> MPD Integer addid x = liftM (read . snd . head . toAssoc) (getResponse ("addid " ++ show x)) -- | Like 'add_' but returns a list of the files added. add :: Maybe String -> String -> MPD [String] add plname x = add_ plname x >> listAll (Just x) -- | Add a song (or a whole directory) to a playlist. -- Adds to current if no playlist is specified. -- Will create a new playlist if the one specified does not already exist. add_ :: Maybe String -- ^ Optionally specify a playlist to operate on -> String -> MPD () add_ Nothing = getResponse_ . ("add " ++) . show add_ (Just plname) = getResponse_ . (("playlistadd " ++ show plname ++ " ") ++) . show -- | Clear a playlist. Clears current playlist if no playlist is specified. -- If the specified playlist does not exist, it will be created. clear :: Maybe String -- ^ Optional name of a playlist to clear. -> MPD () clear = getResponse_ . maybe "clear" (("playlistclear " ++) . show) -- | Remove a song from a playlist. -- If no playlist is specified, current playlist is used. -- Note that a playlist position ('Pos') is required when operating on -- playlists other than the current. delete :: Maybe String -- ^ Optionally specify a playlist to operate on -> PLIndex -> MPD () delete Nothing (Pos x) = getResponse_ ("delete " ++ show x) delete Nothing (ID x) = getResponse_ ("deleteid " ++ show x) delete (Just plname) (Pos x) = getResponse_ ("playlistdelete " ++ show plname ++ " " ++ show x) delete _ _ = fail "'delete' within a playlist doesn't accept a playlist ID" -- | Load an existing playlist. load :: String -> MPD () load = getResponse_ . ("load " ++) . show -- | Move a song to a given position. -- Note that a playlist position ('Pos') is required when operating on -- playlists other than the current. move :: Maybe String -- ^ Optionally specify a playlist to operate on -> PLIndex -> Integer -> MPD () move Nothing (Pos from) to = getResponse_ ("move " ++ show from ++ " " ++ show to) move Nothing (ID from) to = getResponse_ ("moveid " ++ show from ++ " " ++ show to) move (Just plname) (Pos from) to = getResponse_ ("playlistmove " ++ show plname ++ " " ++ show from ++ " " ++ show to) move _ _ _ = fail "'move' within a playlist doesn't accept a playlist ID" -- | Delete existing playlist. rm :: String -> MPD () rm = getResponse_ . ("rm " ++) . show -- | Rename an existing playlist. rename :: String -- ^ Name of playlist to be renamed -> String -- ^ New playlist name -> MPD () rename plname new = getResponse_ ("rename " ++ show plname ++ " " ++ show new) -- | Save the current playlist. save :: String -> MPD () save = getResponse_ . ("save " ++) . show -- | Swap the positions of two songs. -- Note that the positions must be of the same type, i.e. mixing 'Pos' and 'ID' -- will result in a no-op. swap :: PLIndex -> PLIndex -> MPD () swap (Pos x) (Pos y) = getResponse_ ("swap " ++ show x ++ " " ++ show y) swap (ID x) (ID y) = getResponse_ ("swapid " ++ show x ++ " " ++ show y) swap _ _ = fail "'swap' cannot mix position and ID arguments" -- | Shuffle the playlist. shuffle :: MPD () shuffle = getResponse_ "shuffle" -- | Retrieve metadata for songs in the current playlist. playlistinfo :: Maybe PLIndex -- ^ Optional playlist index. -> MPD [Song] playlistinfo x = liftM takeSongs (getResponse cmd) where cmd = case x of Just (Pos x') -> "playlistinfo " ++ show x' Just (ID x') -> "playlistid " ++ show x' Nothing -> "playlistinfo" -- | Retrieve metadata for files in a given playlist. listplaylistinfo :: String -> MPD [Song] listplaylistinfo = liftM takeSongs . getResponse . ("listplaylistinfo " ++) . show -- | Retrieve a list of files in a given playlist. listplaylist :: String -> MPD [String] listplaylist = liftM takeValues . getResponse . ("listplaylist " ++) . show -- | Retrieve file paths and positions of songs in the current playlist. -- Note that this command is only included for completeness sake; it's -- deprecated and likely to disappear at any time. playlist :: MPD [(PLIndex, String)] playlist = liftM (map f) (getResponse "playlist") where f s = let (pos, name) = break (== ':') s in (Pos $ read pos, drop 1 name) -- | Retrieve a list of changed songs currently in the playlist since -- a given playlist version. plchanges :: Integer -> MPD [Song] plchanges = liftM takeSongs . getResponse . ("plchanges " ++) . show -- | Like 'plchanges' but only returns positions and ids. plchangesposid :: Integer -> MPD [(PLIndex, PLIndex)] plchangesposid plver = liftM (map takePosid . splitGroups . toAssoc) (getResponse cmd) where cmd = "plchangesposid " ++ show plver takePosid xs = (Pos $ takeNum "cpos" xs, ID $ takeNum "Id" xs) -- | Search for songs in the current playlist with strict matching. playlistfind :: Query -> MPD [Song] playlistfind = liftM takeSongs . getResponse . ("playlistfind " ++) . show -- | Search case-insensitively with partial matches for songs in the -- current playlist. playlistsearch :: Query -> MPD [Song] playlistsearch = liftM takeSongs . getResponse . ("playlistsearch " ++) . show -- | Get the currently playing song. currentSong :: MPD (Maybe Song) currentSong = do currStatus <- status if stState currStatus == Stopped then return Nothing else do ls <- liftM toAssoc (getResponse "currentsong") return $ if null ls then Nothing else Just (takeSongInfo ls) -- -- = liftM (parseStats . toAssoc) (getResponse "stats") where parseStats xs = Stats { stsArtists = takeNum "artists" xs, stsAlbums = takeNum "albums" xs, stsSongs = takeNum "songs" xs, stsUptime = takeNum "uptime" xs, stsPlaytime = takeNum "playtime" xs, stsDbPlaytime = takeNum "db_playtime" xs, stsDbUpdate = takeNum "db_update" xs } -- | Get the server's status. status :: MPD Status status = liftM (parseStatus . toAssoc) (getResponse "status") where parseStatus xs = Status { stState = maybe Stopped parseState $ lookup "state" xs, stVolume = takeNum "volume" xs, stRepeat = takeBool "repeat" xs, stRandom = takeBool "random" xs, stPlaylistVersion = takeNum "playlist" xs, stPlaylistLength = takeNum "playlistlength" xs, stXFadeWidth = takeNum "xfade" xs, stSongPos = takeIndex Pos "song" xs, stSongID = takeIndex ID "songid" xs, stTime = maybe (0,0) parseTime $ lookup "time" xs, stBitrate = takeNum "bitrate" xs, stAudio = maybe (0,0,0) parseAudio $ lookup "audio" xs, stUpdatingDb = takeNum "updating_db" xs, stError = takeString "error" xs } parseState x = case x of "play" -> Playing "pause" -> Paused _ -> Stopped parseTime x = let (y,_:z) = break (== ':') x in (read y, read z) parseAudio x = let (u,_:u') = break (== ':') x; (v,_:w) = break (== ':') u' in (read u, read v, read w) -- -- Extensions\/shortcuts. -- -- | Like 'update', but returns the update job id. updateid :: [String] -> MPD Integer updateid paths = liftM (read . head . takeValues) cmd where cmd = case :: Maybe String -> [String] -> MPD () addMany _ [] = return () addMany plname [x] = add_ plname x addMany plname xs = getResponses (map (cmd ++) xs) >> return () where cmd = maybe ("add ") (\pl -> "playlistadd " ++ show pl ++ " ") plname -- | Delete a list of songs from a playlist. -- If there is a duplicate then no further songs will be deleted, so -- take care to avoid them (see 'prune' for this). deleteMany :: Maybe String -> [PLIndex] -> MPD () deleteMany _ [] = return () deleteMany plname [x] = delete plname x deleteMany (Just plname) xs = getResponses (map cmd xs) >> return () where cmd (Pos x) = "playlistdelete " ++ show plname ++ " " ++ show x cmd _ = "" deleteMany Nothing xs = getResponses (map cmd xs) >> return () where cmd (Pos x) = "delete " ++ show x cmd (ID x) = "deleteid " ++ show x -- | Crop playlist. -- The bounds are inclusive. -- If 'Nothing' or 'ID' is passed the cropping will leave your playlist alone -- on that side. crop :: Maybe PLIndex -> Maybe PLIndex -> MPD () crop x y = do pl <- playlistinfo Nothing let x' = case x of Just (Pos p) -> fromInteger p Just (ID i) -> maybe 0 id Nothing . mapMaybe sgIndex $ take x' pl ++ ys where findByID i = findIndex ((==) i . (\(ID j) -> j) . fromJust . sgIndex) -- | Remove duplicate playlist entries. prune :: MPD () prune = findDuplicates >>= deleteMany Nothing -- :: Maybe String -- ^ optional path. -> MPD [String] lsdirs path = liftM ((\(x,_,_) -> x) . takeEntries) (getResponse ("lsinfo " ++ maybe "" show path)) -- | List files non-recursively. lsfiles :: Maybe String -- ^ optional path. -> MPD [String] lsfiles path = liftM (map sgFilePath . (\(_,_,x) -> x) . takeEntries) (getResponse ("lsinfo " ++ maybe "" show path)) -- | List all playlists. lsplaylists :: MPD [String] lsplaylists = liftM ((\(_,x,_) ->"] -- Break up a list of strings into an assoc. list, separating at -- the first ':'. toAssoc :: [String] -> [(String, String)] toAssoc = map f where f x = let (k,v) = break (== ':') x in (k,dropWhile (== ' ') $ drop 1 v) -- Takes an assoc. list with recurring keys, and groups each cycle of -- keys with their values together. The first key of each cycle needs -- to be present in every cycle for it to work, but the rest don't -- affect anything. -- -- > splitGroups [(1,'a'),(2,'b'),(1,'c'),(2,'d')] == -- > [[(1,'a'),(2,'b')],[(1,'c'),(2,'d')]] splitGroups :: Eq a => [(a, b)] -> [[(a, b)]] splitGroups [] = [] splitGroups (x:xs) = ((x:us):splitGroups vs) where (us,vs) = break (\y -> fst x == fst y) xs -- Run 'toAssoc' and return only the values. takeValues :: [String] -> [String] takeValues = snd . unzip . toAssoc -- Separate the result of an lsinfo\/listallinfo call into directories, -- playlists, and songs. takeEntries :: [String] -> ([String], [String], [Song]) takeEntries s = (dirs, playlists, map takeSongInfo . splitGroups $ reverse filedata) where (dirs, playlists, filedata) = foldl split ([], [], []) $ toAssoc s split (ds, pls, ss) x@(k, v) | k == "directory" = (v:ds, pls, ss) | k == "playlist" = (ds, v:pls, ss) | otherwise = (ds, pls, x:ss) -- Build a list of song instances from a response. takeSongs :: [String] -> [Song] takeSongs = map takeSongInfo . splitGroups . toAssoc -- Builds a song instance from an assoc. list. takeSongInfo :: [(String,String)] -> Song takeSongInfo xs = Song { sgArtist = takeString "Artist" xs, sgAlbum = takeString "Album" xs, sgTitle = takeString "Title" xs, sgGenre = takeString "Genre" xs, sgName = takeString "Name" xs, sgComposer = takeString "Composer" xs, sgPerformer = takeString "Performer" xs, sgDate = takeNum "Date" xs, sgTrack = maybe (0, 0) parseTrack $ lookup "Track" xs, sgDisc = maybe (0, 0) parseTrack $ lookup "Disc" xs, sgFilePath = takeString "file" xs, sgLength = takeNum "Time" xs, sgIndex = takeIndex ID "Id" xs } where parseTrack x = let (trck, tot) = break (== '/') x in (read trck, parseNum (drop 1 tot)) -- Helpers for retrieving values from an assoc. list. takeString :: String -> [(String, String)] -> String takeString v = fromMaybe "" . lookup v takeIndex :: (Integer -> PLIndex) -> String -> [(String, String)] -> Maybe PLIndex takeIndex c v = maybe Nothing (Just . c . parseNum) . lookup v takeNum :: (Read a, Num a) => String -> [(String, String)] -> a takeNum v = maybe 0 parseNum . lookup v takeBool :: String -> [(String, String)] -> Bool takeBool v = maybe False parseBool . lookup v -- Parse a numeric value, returning 0 on failure. parseNum :: (Read a, Num a) => String -> a parseNum = fromMaybe 0 . maybeReads where maybeReads s = do ; [(x, "")] <- return (reads s) ; return x -- Inverts 'parseBool'. showBool :: Bool -> String showBool x = if x then "1" else "0" -- Parse a boolean response value. parseBool :: String -> Bool parseBool = (== "1") . take 1 | http://hackage.haskell.org/package/libmpd-0.1.3/docs/src/Network-MPD-Commands.html | CC-MAIN-2015-22 | refinedweb | 2,435 | 63.8 |
Read me's
edited September 2012 in Product Suggestions
I have bought a few products in the last few days and I have noticed the read me files are gone from the installers and are now only available for online view. which is rather inconvenient if you are working off line and you need a read file.
can we please have the read me files included in the installers instead of being online
Post edited by Ivy on
I agree. I tried a few that were supposed to have on-line readme's a couple of weeks ago, but the page was unavailable. Readme's are usually quite small, and I don;t know why they don't still include them, it can't be to save space or bandwith surely? it would be easier all aound I think.
yeah, I'd like a manual readme. I've taken to saving the html at the end in the same folder I save the installer, so I can locate the file after install. I have the worst time locating installed content, and until I started to do this, i could waste a lot of tim.
I've been clicking on the (Export as:) PDF button on the upper right. It will generate a PDF and initiate a download to you.
Note, however, that the filelist won't be included - you'll need to grab that separately.
One of the reasons the read me files are all online is that products change and get updated. The online read me files are there to have one location where you can go to see the latest updates and info on that product. This decision has come with a lot of controversy but it should help customers know exactly what the status of their products are at any given time.
The Create PDF is available when you install your products, and if you need the read me, save a pdf during the installation process.
I have no problem with the readme being on-line. It would be significantly better if the readme were directly linked to the product page.
However - I'm on dialup and my 3D system does NOT have internet access. I see absolutely NO reason the readme cannot be included in the download package.
As it is, I use my laptop to mirror the complete readme section of the wiki when I'm at a wifi hotspot. Unfortunately, the config at the DAZ end is not co-operating and it is impossible at this time to just get the new and/or updated pages - the process pulls down the complete subsection of the readmes each time. This is a waste of bandwidth, but it is the best option available to me in my situation, so I continue to do it.
That is part of the problem. I want to know what I have, not what is now available.
I thank you for the responce to my request.. But I want to file a compliant for 2 simple reason. I don't need or want a bunch of saved read me's web pages in my favorite folder on my browser and 2) I sometimes will bridge work over to my laptop and will work off line and read me files are not avail if I'm not on line.
It is after all rather inconvenient to have to save the read me's in a PDF file plus the file list. because it was not part of the product in the installer. That is like buying a stereo that didn't come with instructions on how to use it.
As Simon stated .. I want to know what I have bought when i bought it and not a upgraded read me that will not apply to my product i had originally purchased down the road..
So I would like to make this request again. Please ad the read me's to the installers or zip files which ever the case maybe. If you update the product then you can update the read me that is included in the installer.
other wise my favorite folder has a ton of web site pages all named read me.. that is just silly.
What Maybe convenient for you all, is not at all convenient to your customers. just some food for?
Please give the readme's back in the products when we buy them? It's a good thing they are online also so if there are changes or updates we can find them there but for the product as it is when I bought it, I really would like to have the readme included.
I'm not always online and besides, the readme web page isn't always reachable.
Thanks in advance. :)
For people that want the readme's back there is a request filed here:, add a note please?
Love, Jeanne
It would be good if it was made available as one of the resource files on the product page.
A date printed on it with a note that newer versions may be available is all that's necessary to keep people informed about how up to date it is.
Why not include a hyperlink in the readme the client downloads? This solves both issues.
This way the client has their readme, and the link goes to the updated online readme. What would be even more awesome if the online readme file has the version number of the prodcut so the client can know if he/she needs to update this file.
I like this idea A LOT!!!
I too am looking for a readme that isn't in the on line documentation.
I have been going back to the doc page and saving as PDF, but since I didn't know the file list wasn't included, I'll have to go back and save those too... this is suppose to help me how????
I also agree about wanting a read me that matches the product I originally purchased.
Oh well...sounds pretty clear, this is a done deal and there isn't going to be a compromise ... it's the document page or nothing. What else is new. 8-/
As a PA, I'm also requesting the reinstatement of the readme in the download. I have certain complex products (Room Creator, for example), in which user instructions are absolutely essential, and IMO, an online readme just isn't good enough!. That much is obvious from the comments above.
I've included a readme in many products, and I dutifully made wiki pages for every product I had. Not that it did much good. They've all vanished now. The whole online system has too many user exceptions to the rule to force it upon us as the only system available.
mac
Yet another reason why on-line only readmes are a bad idea -- the number of times the documentation wiki has been redesigned/reworked and entries just plain dropped.
I submitted bug report 47340 about the readmes back in July - feel free to pile on with comments. Bug report here.
And I think I'll wait out the PA sale, no point in adding to the PA problems - and then I'm going nuclear. I'll be requesting a refund on every purchased item that does not include a readme in the download. I've hit my point of no return.
Yep. I already added my comment to that report a while back. The more, the merrier.
mac
Not if you export the page as PDF. I wrote a plugin, several months back, for Dokuwiki (the "engine" behind the documentation center) specifically for this purpose. If the page is being rendered as xhtml (normal display within the browser), the file_list page is linked from the start page - because file lists can get rather long, and unless you want to see them... in the way. When the page is rendered to pdf (or odt, but there are bugs in the odt plugin itself), the link to the file_list page is omitted from the top of the product notes section and instead included as its own section immediately below the product notes.
-Rob
Incorrect. All of the ReadMe's that where on the ArtZone site prior to it being taken down reside in a dedicated ArtZone namespace, or more specifically the Products A-Z index, on the Documentation Center - I personally moved all of them over. The index page for that section is linked within the text on the new ReadMe index page.
Home One Apartment
Home One Bedroom
Home One Bathroom
Home One House
-Rob
Not to bust your bubble -- but I just pulled the PDF for the A3 and H3 shapes for genesis. I got a 79.0 KB PDF with a link back to the wiki for the file list; it is NOT included in the PDF.
First I've been made aware that it wasn't working. I'm looking into why, right now.
-Rob
Probably because all the rest of us thought it was supposed to be a two-step process. :)
I bought Sandy hair for Genesis the other day, installed it yesterday and there was no readme. Not included and not online although the link pointed to the doc centre there was nothing there, no Sandy Hair for Genesis either. :ohh:
And no filelist included in the Sandy hair for V4 pdf also: Sandy hair read me
I didn't even know there was supposed to be one in the pdf. Anyhow, this one went back online and I don't like it. :(
So please put them back in the products I buy so I have them on my computer? When that thing crashes I won't blame DAZ for it, maybe... :P
Love, Jeanne
Sorry about that, Rob. I thought they had all gone. Thanks for the correction.
mac
THIS. I've just started the process of redownloading all updated products, and by far the easiest way I've found to find out what version of a product I have (and from there, whether I need to reset and download) is using the readme.
Using the "Export As: PDF" action link on ReadMe pages should again include the contents of the "File List" page, as I previously described it.
-Rob
Thanks Rob, that's going to make life easier.
Asking the question again because there doesn't seem to have been an answer?
Great work, Rob! This helps quite a bit. I know you do a lot of this on what are supposed to be your off-hours, and I really do appreciate it!
I still stand on my argument for having the readme in the download as well as on the wiki, as stated in the mantis bug tracker.
And, as a dial-up user, I need to ask (since one of the claimed benefits of the wiki is the ability to tell when a product has been updated) - HOW do I determine from the index page if a product has been updated? I don't have enough hours in a week to look at all the detail pages to get the information.
For all the reasons so far mentioned I can only add my wishes for a return to included readme files. Saving them as a pdf or any format presumably requires one to be online to access the readme in the first place, and since none of my workstations have ever had modems, and hopefully never will, it has become an almighty headache.
So please DAZ reinstate the read me files to the product installers. Pretty please!
How many times do I have to ask this question until I get an answer? "A lot of controversy" is beginning to sound like the understatement of the year.? | http://www.daz3d.com/forums/viewreply/99649/ | CC-MAIN-2015-48 | refinedweb | 1,971 | 79.4 |
Odoo Help
This community is for beginners and experts willing to share their Odoo knowledge. It's not a forum to discuss ideas, but a knowledge base of questions and their answers.
How to determine field definition through a function?
I want to let the definition of a field be dependant upon the value of another field. Concretely, I want the definition of the field product.standard_price to be dependant upon the value of the boolean field product.puchase_ok in such a way that standard_price is either equal to the value of another field or is defined in the standard way (as in the product-module). I am thinking that the definition of the standard_price field should be determined as a function operating like this (in pseudo-code):
"If (purchase_ok): standard_price = standard defintion of the field
Else: standard_price = foo"
where "foo" is another field in the model.
Is my thinking correct and if so, how can such a function be implemented? (I know how to let a field be defined as a function -- I am more in doubt about the actual implementation of the function).
EDIT: The server is running v7.
in v8 maybe you'll find useful to override the "_set_standard_price" function of "product.template" model?
for v7 you can try to turn the "standard_price" field into the computed field but make sure you implement both fnct and fnct_inv (also store=True is recommended, it'll preserve old values if any)...
class product_template(osv.osv):
_name = "product.template"
_inherit = "product.template"
def _set_standard_price(self, cr, uid, ids, field_name, field_value, arg, context):
# set value of standard_price field
def _get_standard_price(self, cr, uid, ids, field_name, arg, context):
# get value of standard_price field
_columns = {
'standard_price': fields.function(
_get_standard_price,
fnct_inv = _set_standard_price,
method = True,
store = True, type = 'float',
digits_compute = dp.get_precision('Product Price'),
help = "same....", string = 'Cost',
groups = "base.group_user"),
}
Thank you for your reply, but I am in doubt as to how to implement the function more concretely.
also don't forget to add "product" module to dependency list in __openerp__.py manifest server is v7 or v8 | https://www.odoo.com/forum/help-1/question/how-to-determine-field-definition-through-a-function-83644 | CC-MAIN-2016-44 | refinedweb | 345 | 56.55 |
The static analysis tool FXCop, and its later relation Visual Studio Code Analysis, have been well known as static analysis tools which help improve the quality and resilience of your code. I'm a big fan of this tool's ability to catch bugs and potential performance or security issues sooner in the development process.
A lesser known tool named StyleCop, which was only available internally at Microsoft up until now, analyses the source code and checks that it conforms to suggested styling guidelines. People often have their own preferred way of styling code, which is fine for a single-man project but can make it harder to work collaboratively.
The first time I was encouraged to use StyleCop I initally found it irritating, but you soon learn to appreciate the benefit of consistent styling across a large body of code. Certainly the goal here isn't to preach a religious viewpoint on the One True Way of utilising curly braces, but rather ensuring that you can quickly and easily read any part of the codebase; it's surprising how much difference consistency can make to this. It also provides further checks on code documentation such as suitable headers, which isn't covered by the other tools.
Read more about it on the Source Analysis blog.
Okay, I'll admit it...my definition of shortly sucks. Ten months between blog posts was very much not what I intended. All I can say is I got pulled into a couple of CAB projects for another bank which have sucked up all my time, but things have calmed down a bit and I hope to post a little more regularly now (yeah yeah, I know).
So what momentous event caused me to start blogging again? The announcement by Tim Sneath that .NET 3.5 Service Pack 1 is on the horizon, including the third major release of WPF. What's more the long missed DataGrid control is making a WPF comeback in an out-of-band release. This should make WPF a much more attractive proposition to those creating business applications; should certainly make the reams of data-binding code I've written to cope with WinForms limitations redundant.
An interesting point a customer made to me the other day was that there's no clear guidance on where we've been, are or where we're going with smart client technologies. A lot of phrases, acronyms and codenames get bandied about without a coherent view of how they all fit together, which can be confusing for someone who's coming to it all new, especially when explaining the benefits this technology can bring to non-technical people. I'm going to have a shot at bringing it together in some sort of simple top-level diagram, so watch this space.
So I've been on a CAB project based in Johannesburg for the last few months, which is my excuse for the woeful inattention I've paid to this blog in that time. I hope to publish some of my learnings from the experience here shortly, but in the meantime I've been brushing up on some other interesting technologies around right now. I've found Riemers XNA tutorials to be an excellent resource - in case you've been living under a rock for the past year, XNA is Microsoft's new game development platform targeting the Xbox 360 as well as the PC.
The tutorials cover basics from creating your first triangle, to 3D terrain, lighting, bump mapping and many more cool things - one series of tutorials has you generating an entire combat flight sim. Don't forget XNA is free to develop games for the PC and allows you to program games with minimum fuss using either C# or Visual Basic .NET.
Apologies for those to whom the Smart Client Software Factory means nothing, but I thought I'd share a recent experience with regard to the TabWorkspace workspace control. I do plan to come back and explain SCSF at a more fundamental level in later posts, but hopefully this will prove useful to anyone who has had similar issues.
My problem related to automatically activating SmartParts and their associated WorkItems hosted in a TabWorkspace. Controls tagged with the [SmartPart] attribute automatically activate their associated WorkItem when activated, but unfortunately switching to a tab hosting the control is not enough to fire this event. In my particular situation I had a status bar which I wanted updated with information from the active WorkItem, so I needed a way to capure that TabWorkspace control's SelectedIndexChanged event and activate the correct WorkItem.
Whilst the TabWorkspace control does have an ActiveSmartPart property, SmartParts don't contain any special properties for getting at their associated WorkItem. Given I knew the exact type of SmartPart I was going to be opening in the tab pages I could have simple casted to the appropriate type and got at the WorkItem that way, but this would have introduced tighter coupling and lack of reusability. Instead I decided to keep a register of tab pages and associated WorkItems, so I created a Dictionary<TabPage, WorkItem> collection in my ShellLayoutView class. I then used the Event Publication/Subscription model to fire an event when a WorkItem was created, and then used that event to register the WorkItem against the TabPage it appeared in.
[EventSubscription(EventTopicNames.RegisterWorkItem)]
public void RegisterWorkItem(object sender, EventArgs workItem)
{
_registeredWorkItems[_rightWorkspace.SelectedTab] = workItem.Data;
}
Finally within the WorkItemController itself I added handlers for the WorkItem.Activated and WorkItem.Terminating events, to update the status bar of the shell application when the active WorkItem changed. I'm still figuring all the intricasies of CAB/SCSF out and this may not have been the optimal solution, but it worked for me. I'd love to hear from anyone who found better or alternative ways of achieving the same.
One of the most basic uses of Object Builder is when we want to specify that certain objects should always be created as singletons. For example, we may require that only one instance of a DataAccess object should ever exist. This can be specified by setting a policy, in this case a SingletonPolicy, that applies to all objects of type DataAccess.
The following example demonstrates how this code might look, and uses the Object Builder to create a DataAccess object four times - twice with the singleton policy enabled and twice without.
Builder builder = new Builder();
Locator locator = new Locator();
// We need a lifetime container to keep references to the objects
// SingletonStrategy depends on this!
locator.Add(typeof(ILifetimeContainer), new LifetimeContainer());
// Enable singleton policy for DataAccess objects
builder.Policies.Set<ISingletonPolicy>(new SingletonPolicy(true), typeof(DataAccess), null);
SingletonPolicyDemo object1 = builder.BuildUp<DataAccess>(locator, null, null);
SingletonPolicyDemo object2 = builder.BuildUp<DataAccess>(locator, null, null);
Trace.WriteLine("Objects equal: " + (object1 == object2));
// Clear locator
locator = new Locator();
locator.Add(typeof(ILifetimeContainer), new LifetimeContainer());
// Disable singleton policy for DataAccess objects
builder.Policies.Set<ISingletonPolicy>(new SingletonPolicy(false), typeof(DataAccess), null);
object1 = builder.BuildUp<DataAccess>(locator, null, null);
object2 = builder.BuildUp<DataAccess>(locator, null, null);
Trace.WriteLine("Objects equal: " + (object1 == object2));
Running this code will show that the singleton pattern is used for the first pair of references, and individual objects are generated for the second pair. The locator object contains weak references to the objects that are created, and when the singleton policy is in effect this is searched to see if this object has already been created. However since only weak references are used, we need to create a LifetimeContainer to maintain strong references to the created objects and prevent them from being garbage collected.
The other day I was working on a demonstrator application for the Object Builder framework, and adding a lot of new classes to my project. Having to manually add using directives for OB in every class didn't seem terribly efficient, so I set about finding how you can change the default C# class template. I discovered this nugget in Anson Horton's blog - if you open %Program Files%\Microsoft Visual Studio 8\Common7\IDE\ItemTemplates\CSharp\1033\Class.zip, you can modify the class.cs file within that's used to generate all new C# source files - it looks like this:
using System;
using System.Collections.Generic;
using System.Text;
namespace $rootnamespace$
{
class $safeitemrootname$
{
}
}
You can then add or remove the using directives you want at the top of this file, and save it back to the archive. Finally run %Program Files%\Microsoft Visual Studio 8\Common7\IDE\devenv.exe /setup to refresh Visual Studio's template cache. Now all new C# files you create should match your modified template.
The Patterns and Practices team here provide a host of industry tested guidance on software development for the Microsoft platform, as well as software factories, application blocks and reference implementaions. The current project I'm involved with is examing the Composite UI Application Block for creating rich smart client applications.
This block allows the developer to easily create complex user interfaces from simpler reusable parts, and provides an MVP pattern implementation from which to develop. Additional features include dynamic loading of independent but cooperating modules, event brokering and thread marshalling for loosely coupled communications, and a framework for pluggable infrastructure services.
The Composite UI Application Block makes use of Object Builder, a Dependency Injection (DI) framework also originally written by the P&P group. Object Builder can be used to manage complex dependencies between objects and decouple objects in complex systems. There is a detailed webcast on Object Builder which is a good place to start understanding what it does for us and how it works.
Welcome to my shiny new blog! I've recently moved to MCS (Microsoft Consulting Services) UK from DPE (Developer and Platform Evangelism), so having talked about how great all these products are I now have to drink my own medicine and use them to solve real-world problems. My old blog is now retired, but shall remain preserved for the forseeable future.
I'm currently working on a project for a large organisation in South Africa, and looking at a whole bunch of new technology that will enable their business to run even better. Stuff we're looking at include the whole .NET 3.0 stack (Windows Presentation Foundation, Windows Communication Foundation, Workflow Foundation), as well as the Composite UI Application Block, the Offline Application Block and the Smart Client Software Factory. Far too much to look at in one blog entry, but I hope to spend time on each of them in the coming posts. | http://blogs.msdn.com/steve/ | crawl-002 | refinedweb | 1,767 | 50.67 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.