Setup of BeoLiving Intelligence
Network
The network settings determine how BeoLiving Intelligence connects into the local network, and how it accesses the Internet.
The settings available are:
- Hostname is the name by which BeoLiving Intelligence will be found in the
local network. This must be a single word containing letters
A
toZ
,a
toz
or digits0
to9
. - DHCP enabled may be selected if the local network has a DHCP server, that automatically assigns the rest of the parameters (IP address, mask, name server and gateway).
- IP address, IP mask, DNS address and gateway are the standard IP settings that must be provided in case of a manual connection (no DHCP).
Apply button
Note that network settings do not apply immediately as you type.
You can safely edit all the fields, check for consistency, and then press the Apply button for the changes to take effect.
The Apply button will change colour as a reminder whenever modifications are made.
Finding out manual settings
Sometimes it is useful to have a fixed IP address (rather than an address dynamically assigned by a DHCP server). For example, if some home automation equipment needs to connect to BeoLiving Intelligence, normally a fixed IP address is required.
If you don’t have all the manual settings available, you can try choosing a DHCP configuration, and apply settings, so that the DHCP server in the local network fills in an IP address, IP mask, gateway and DNS server addressses. You can now uncheck the DHCP option, and edit the last part of the IP address to your value of choice outside of the DHCP range, which normally starts at around 100.
For example, if DHCP assigns <IP_ADDRESS>
, then a value around
<IP_ADDRESS>
should be OK (first, try pinging that address from
your computer to make sure no other device is already configured at
that address). Don’t choose addresses with very low values (below 10)
since these are normally assigned to the network routers and servers.
Date & time
BeoLiving Intelligence needs to keep the date and time for many functions, including timestamping of logs and monitoring, clock events, and astronomical clock events.
If BeoLiving Intelligence has access to the Internet, then date and time can be synchronized to Internet time servers. Select this option and choose your timezone.
Otherwise, you can manually set the date and time.
For calculating sunrise and sunset times for your location, not only the current date must be set, but also the geographic location of the installation.
Set the latitude and longitude accordingly; the format is in decimal degrees. Positive values for North and East, negative for West and South.
For example, the coordinates for New York City (40.6700° N, 73.9400° W) would be entered this way:
- Latitude:
40.67
- Longitude:
-73.94
Home Integration Protocol
Home Integration Protocol allow other devices to interact with BeoLiving Intelligence. This protocol is used by mobile applications, or by other home automation controllers and provides two way control of all resource types.
This protocol can be enabled on the local network, with mandatory authentication. You should provide a TCP port, which defaults to
- Port numbers below 1024 are reserved for standard TCP services, so use values above this range.
System modes
BeoLiving Intelligence can have any number of System modes, which can be used to enable or disable the execution of macros, as follows:
- System modes can be activated by the BeoLiving Intelligence command SET MODE.
- Any number of modes can exist, but at most one can be active any given time.
- A macro can have any number of modes, and a mode can be set to any number of macros.
- A macro with no mode set will behave normally.
- If a macro has one or more modes set, then it will be triggered by events only if one of those modes is active.
Typical example of system modes: Vacation
and Normal
. You can set
up a button to toggle between normal and vacation modes. Macros for
setting thermostats, or forcontrolling lighting and shades may be
assigned individually to each mode.
Units
The system temperature units can be configured to be Fahrenheit or Celsius, affecting all the clients connected to the BeoLiving Intelligence. For example, if the current temperature unit is Fahrenheit, then all the thermostats will report the temperature in these units to all connected clients.
This setting only affects what is displayed on BeoLiving Intelligence user interfaces. It does not affect the units displayed on the actual thermostats.


Grid based structures in coding is basically using a grid layout to structure your website. This keeps the structure simple and readible and also user friendly/easy to the navigate.
What is all the hype about responsive webpages? Well basically responsive websites mean that if the dimensions of the browser are changed or people are viewing your site from various different devices the site responds to these dimension changes by adjusting for the site's content to fit and refit.
Semantic structure is basically how most of western society intuitively read text and images. This is usually reading or viewing from left to right. It help to orgnanise websites this way to.


The mesos/docker provider uses docker-compose to launch Kubernetes as a Mesos framework, running in docker with its dependencies (etcd & mesos).
Non-Goals:
The cluster consists of several docker containers linked together by docker-managed hostnames:
| Component | Hostname | Description |
|---|---|---|
| docker-grand-ambassador | Proxy to allow circular hostname linking in docker | |
| etcd | etcd | Key/Value store used by Mesos |
| Mesos Master | mesosmaster1 | REST endpoint for interacting with Mesos |
| Mesos Slave (x2) | mesosslave1, mesosslave2 | Mesos agents that offer resources and run framework executors (e.g. Kubernetes Kublets) |
| Kubernetes API Server | apiserver | REST endpoint for interacting with Kubernetes |
| Kubernetes Controller Manager | controller | |
| Kubernetes Scheduler | scheduler | Schedules container deployment by accepting Mesos offers |
Required:
Optional:
It’s possible to install all of the above via Homebrew on a Mac.
Some steps print instructions for configuring or launching. Make sure each is properly set up before continuing to the next step.
brew install git
brew install caskroom/cask/brew-cask
brew cask install virtualbox
brew install docker
brew install boot2docker
boot2docker init
boot2docker up
brew install docker-compose
Most of the above are available via apt and yum, but depending on your distribution, you may have to install via other means to get the latest versions.
It is recommended to use Ubuntu, simply because it best supports AUFS, used by docker to mount volumes. Alternate file systems may not fully support docker-in-docker.
In order to build Kubernetes, the current user must be in a docker group with sudo privileges. See the docker docs for instructions.
If on a mac using boot2docker, the following steps will make the docker IPs (in the virtualbox VM) reachable from the host machine (mac).
Set the VM’s host-only network to “promiscuous mode”:
boot2docker stop VBoxManage modifyvm boot2docker-vm –nicpromisc2 allow-all boot2docker start
This allows the VM to accept packets that were sent to a different IP.
Since the host-only network routes traffic between VMs and the host, other VMs will also be able to access the docker IPs, if they have the following route.
Route traffic to docker through the boot2docker IP:
sudo route -n add -net <IP_ADDRESS> $(boot2docker ip)
Since the boot2docker IP can change when the VM is restarted, this route may need to be updated over time.
To delete the route later: sudo route delete <IP_ADDRESS>
Checkout source
git clone https://github.com/kubernetes/kubernetes cd kubernetes
By default, that will get you the bleeding edge of master branch. You may want a release branch instead, if you have trouble with master.
Build binaries
You’ll need to build kubectl (CLI) for your local architecture and operating system and the rest of the server binaries for linux/amd64.
Building a new release covers both cases:
KUBERNETES_CONTRIB=mesos build/release.sh
For developers, it may be faster to build locally.
[Optional] Build docker images
The following docker images are built as part of ./cluster/kube-up.sh
, but it may make sense to build them manually the first time because it may take a while.
Test image includes all the dependencies required for running e2e tests.
./cluster/mesos/docker/test/build.sh
In the future, this image may be available to download. It doesn’t contain anything specific to the current release, except its build dependencies.
Kubernetes-Mesos image includes the compiled linux binaries.
./cluster/mesos/docker/km/build.sh
This image needs to be built every time you recompile the server binaries.
[Optional] Configure Mesos resources
By default, the mesos-slaves are configured to offer a fixed amount of resources (cpus, memory, disk, ports).
If you want to customize these values, update the MESOS_RESOURCES
environment variables in ./cluster/mesos/docker/docker-compose.yml
.
If you delete the MESOS_RESOURCES
environment variables, the resource amounts will be auto-detected based on the host resources, which will over-provision by > 2x.
If the configured resources are not available on the host, you may want to increase the resources available to Docker Engine. You may have to increase you VM disk, memory, or cpu allocation in VirtualBox, Docker Machine, or Boot2Docker.
Configure provider
export KUBERNETES_PROVIDER=mesos/docker
This tells cluster scripts to use the code within cluster/mesos/docker
.
Create cluster
./cluster/kube-up.sh
If you manually built all the above docker images, you can skip that step during kube-up:
MESOS_DOCKER_SKIP_BUILD=true ./cluster/kube-up.sh
After deploying the cluster, ~/.kube/config
will be created or updated to configure kubectl to target the new cluster.
Explore examples
To learn more about Pods, Volumes, Labels, Services, and Replication Controllers, start with the Kubernetes Walkthrough.
To skip to a more advanced example, see the Guestbook Example
Destroy cluster
./cluster/kube-down.sh
The kube-up
for the mesos/docker provider will automatically deploy KubeDNS and KubeUI addons as pods/services.
Check their status with:
./cluster/kubectl.sh get pods --namespace=kube-system
The web-based Kubernetes UI is accessible in a browser through the API Server proxy: https://<apiserver>:6443/ui/
.
By default, basic-auth is configured with user admin
and password admin
.
The IP of the API Server can be found using ./cluster/kubectl.sh cluster-info
.
Warning: e2e tests can take a long time to run. You may not want to run them immediately if you’re just getting started.
While your cluster is up, you can run the end-to-end tests:
./cluster/test-e2e.sh
Notable parameters:
- Increase the logging verbosity: -v=2
- Run only a subset of the tests (regex matching): -ginkgo.focus=<pattern>
To build, deploy, test, and destroy, all in one command (plus unit & integration tests):
make test_e2e
When compiling from source, it’s simplest to use the ./cluster/kubectl.sh
script, which detects your platform &
architecture and proxies commands to the appropriate kubectl
binary.
`./cluster/kubectl.sh get pods`
Kill all docker containers
docker ps -q -a | xargs docker rm -f
Clean up unused docker volumes
docker run -v /var/run/docker.sock:/var/run/docker.sock -v /var/lib/docker:/var/lib/docker --rm martin/docker-cleanup-volumes
The steps above tell you how to build in a container, for minimal local dependencies. But if you have Go and Make installed you can build locally much faster:
KUBERNETES_CONTRIB=mesos make
However, if you’re not on linux, you’ll still need to compile the linux/amd64 server binaries:
KUBERNETES_CONTRIB=mesos build/run.sh hack/build-go.sh
The above two steps should be significantly faster than cross-compiling a whole new release for every supported platform (which is what ./build/release.sh
does).
Breakdown:
KUBERNETES_CONTRIB=mesos
- enables building of the contrib/mesos binarieshack/build-go.sh
- builds the Go binaries for the current architecture (linux/amd64 when in a docker container)make
- delegates to hack/build-go.sh
build/run.sh
- executes a command in the build containerbuild/release.sh
- cross compiles Kubernetes for all supported architectures and operating systems (slow)


Retro Regen Receiver
Introduction:
The project is found in the May 2015 "Nuts & Volts" magazine, page 26, and was designed by Dick Wipple.
Materials:
add something here
- P.C. board artwork
Build Notes:
add something here
Operation Notes:
add something here
Vendors:
- Antique Electronics Supply -- Notes:
- Digi-Key -- Notes:
- Home Depot -- Notes:
- Jameco Electronics -- Notes:
- New Sensor -- Notes:
- Radio Shack -- parts


Snack Slider V Test
left
right
top
bottom
fade
speed 0.5s
speed 1s
speed 2s
cover
contain
fill
w320
h240
w640
h480
mute
set poster
unset poster
remove 2nd video
insert 2nd video
Play
Start
Stop
slider1
slider2


USA Football Connect - Wesite UI Engineering & Development
Bowlopolis - Imaginary play haven for kids
GoBowling.com
...
Previous
Next


Preparation time
less than 30 mins
Cooking time
10 to 30 mins
Serves
Serves 2
For the lamb, rub the lamb with the cinnamon and oregano and season with salt and freshly ground black pepper. Heat a griddle pan until smoking, rub the lamb with the olive oil and fry for 3-4 minutes on each side (for rare), or until golden-brown all over and cooked to your liking. Remove from the pan and leave to rest for five minutes, then cut into thick slices.
For the feta and Baby Gem salad, toss the Baby Gem lettuce leaves with the olive oil. Heat a griddle pan until smoking, then add the lettuce and fry for 15-20 seconds on each side, or until tender. Mix the chargrilled lettuce together with the feta, lemon zest and juice and olives. Drizzle over some olive oil, season with salt and freshly ground black pepper and stir well.
For the lemon pilaf, heat the olive oil in a saucepan, add the onion and garlic and fry for 4-5 five minutes, or until softened but not coloured. Add the lemon zest and the rice, stirring to coat in the oil. Gradually add the hot chicken stock and cook for 8-10 minutes, stirring frequently, or until all of the stock has been absorbed and the rice is tender. Season with salt and freshly ground black pepper and stir in the chopped mint.
To serve, place the salad onto two serving plates, top each with the sliced lamb and serve the lemon pilaf on the side.


FREQUENTLY ASKED QUESTIONS
Installation
I would like a step-by-step guide, do you have one?
Yes, it can be found here.
How do I install Median XL: Ultimative?
Simply make sure your Diablo 2 Lord of Destruction installation is up to date, then find the file named
patch_d2.mpq in your install directory and replace it with the one in the mod download. Detailed
instructions and information about Macs are inside the download.
Can I still go back to classic LoD?
To install the mod, you need to swap out one file. To go back to classic LoD, swap it back! It is
that simple!
Will my classic Lord of Destruction characters work?
No; Median XL: Ultimative has separate characters.
I don't have the Lord of Destruction expansion!
 No Median XL: Ultimative for you!
Compatibility
Which Diablo 2 version do I need?
You need Diablo 2 Lord of Destruction 1.10, 1.11, 1.12 or 1.13. If Blizzard releases 1.14, it will most likely
remain compatible, but check the latest news just to be sure. 1.13c is recommended.
What are the system requirements for Median XL: Ultimative?
Any system that runs Diablo 2 reasonably well is compatible with Median XL. Note that
the Diablo 2 engine is outdated and will occasionally slow down on even a modern
system when too much awesome stuff happens, regardless of system specifications. This is
perfectly normal and unavoidable other than by making the mod less awesome.
Does this mod work on a Mac?
Yes.
Does this mod support PlugY?
Yes, however the skill reallocation feature in PlugY is disabled due to a major bug in PlugY that
may cause you to end up with a large number of skill points. Also, PlugY itself has a few
glitches that may lead to item loss.
Does this mod support Multires?
Yes.
Does this mod support my illegal/pirated/torrented Diablo II?
I don't know because I didn't steal the game.
Does this mod support maphack/pickit/bots?
Stop cheating and learn to play.
Crashes and errors
Median XL: Ultimative crashes while loading
- You installed a LoD patch while Median XL: Ultimative was already installed.
- You are using -direct -txt or a loader.
- You are using PlugY and it is not installed correctly.

Median XL: Ultimative crashes during gameplay
- Your Diablo 2 files were damaged. Yes, this does happen.
- Different mod versions in a multiplayer game.
- You are using PlugY and it has a bug. Contact the creator of PlugY for a solution.
- Your character reached the file size limit for Diablo 2 save files and now it
crashes every time it attempts to save the game. This can occasionally happen if you have a lot
of socketed items with a large number of modifiers. To fix it, throw out some items or alternatively
install PlugY and use its shared stash feature.
Median XL: Ultimative does not save characters properly
- You are using PlugY and it has a bug. Contact the creator of PlugY for a solution.
- Your save folder is read only. This may be due to a permissions problem with recent
Windows versions (Vista and up) which zealously protect the Program Files folder. Try
running Diablo 2 as administrator.
My characters have disappeared
- A computer or game crash may have corrupted your save file. I hope you have a
backup.
- Your file paths may have been redirected by another mod (active or uninstalled). Reinstall
Diablo 2.
- Your file paths may have been redirected by Windows. Try running Diablo 2 as
administrator. If you already did, try not running it as administrator.
Median XL: Ultimative crashes while travelling between Acts
- Your sound is missing, defective or disabled, causing the Diablo II video player to crash. This
is not a Median XL bug.
Median XL: Ultimative gives a 'Bad Inventory Data' or similar error while loading a character
- You are attempting to use a character that is not from Median XL.
- Your character save file has become damaged.
- You are using PlugY and there are invalid items in the shared stash.
- You tried to hack your character and failed epically.
- This may happen after a Median XL: Ultimative version upgrade. Although characters should be compatible
between various Median XL: Ultimative releases, new items introduced in later patches are not backwards
compatible and the Omega patch is a little more sensitive. Try going back to your earlier version and
throwing out some items until your character loads.
The mod does nothing, my game did not change
- Another mod changed your file locations.
- You copied the game to another folder.
- You renamed the Median XL: Ultimative patch_d2.mpq file.
- You have a Mac and did not follow the instructions.
- You have an unpatched (1.07) version of LoD.
None of the runewords work
- Check the requirements on the runeword page.
- Fill all sockets with jewels except the last one, where you put the rune.
- Make sure the item is nonmagical (grey).
- If you were using the third party 'Runeword mod', remove it.
Gameplay
Why can I only put two points into a skill?
Skills start out with a maximum level of 2 that goes up by 1 after each six character levels. In other
words, the maximum skill level slowly increases as your character levels up.
Does [this skill] carry [crushing blow/leech/etc.]?
Any skill that deals weapon damage will carry all weapon modifiers. The exceptions are
x% Chance to cast level y [Skill] on Attack (as opposed to "Striking"),
+x to [Life/Mana] on Striking in Melee and Stun
Attack, which only affect melee attacks.
Where do I get teleport?
Some characters have a teleportation skill (amazon: Pounce - assassin: Blink - barbarian: Spirit
Walk - necromancer: Bend the Shadows - paladin: Colosseum, Divine Apparition). If you use a different
character or you do not have this skill, you can use an item with charges of these skills. The most popular
is the runeword staff Pax Mystica, which has charges of Blink. At the end game, the Moon of the Spider reward charm for the Lord Aldric Jitan uberquest grants you
the Jitan's Gate skill.
Will the classic LoD runewords work?
The classic LoD runewords have been removed because they would not fit into the new item
paradigm.
How do I get those pretty colours like on the screenshots?
Go to your Diablo II folder, find the program 'D2VidTst', run it, let it
do its thing for a while and then choose Direct3D mode. This enables
coloured lighting in Diablo II. This does not work if you run Diablo II in a
window.
Features
What are Hatred, Terror, Destruction difficulty?
These are the new names for Normal, Nightmare and Hell respectively.
What are Crafting Points?
You need Crafting Points to use some cube recipes. The amount of Crafting Points required
is listed below the recipe. Find items with +xyz Crafting Points on them
and wear those items while performing the recipe.
What are Uberquests?
Uberquests are the ultimate challenge of Median XL: Ultimative. They involve special difficult monsters and
bosses to kill. Most have a special unique reward for beating them on Destruction difficulty. For more information see:
What are Challenges?
Challenges reward you for completing difficult tasks under special limited rules. See:
Strategy and tactics
What is the best class?
The best class is the class you like the most.
Physical damage kills me easily!
Defence rating and defensive skills (like the amazon's Defensive Harmony and the sorceress' Warp
Armor) are much more important in Median XL: Ultimative than in classic LoD. By contrast, life and blocking are less
important. Note that in Diablo II your defence is ignored when you run, so hit 'R' to enter walk mode. In
Median XL: Ultimative, walk mode is much faster and more comfortable.
Elemental damage kills me easily!
Improve your resistances. It is important to have 75% resistance to every element before Act 3 Hatred.
As for poison damage, the Poison Length Reduced by xx% modifier is very
useful. In the end game, you should be able to find items with a bonus to maximum resistances, allowing
you to increase your resistances to 90% or 95%.
My weapon attacks don't do enough damage!
Aside from the obvious solution of getting a better weapon, you can also invest into skills that increase
your damage or put points into strength or dexterity. Unlike in classic LoD, the strength and dexterity
bonuses make a noticable difference at high levels, especially if you have no skills that add +% damage
(bowazon). The description of the weapon tells you how much damage you gain at your current strength
or dexterity value.
My spells don't do enough damage!
The +x% to [Element] Spell Damage modifiers are plentiful and powerful.
Get some of these bonuses and you will notice a significant difference. Aim for +200% in your chosen
elements by the end game. Also make sure to put some points into energy to benefit from the spell
damage synergy. The spell description of affected spells tells you how much of a damage bonus you gain
at your current energy value.
How many elements do I need?
Regular enemies can only have one natural immunity, so two elements is fine.  Physical immunity does not appear on any enemy by default
but has a small chance to spawn on any random enemy in Destruction difficulty. Also, the Fauztinville
uberquest contains monsters that are immune to multiple elements, and heroic bosses are
very hard to kill without a large number of elements at your disposal.
Can I remove immunities from enemies?
You can use various skills and items to remove an immunity off an enemy: the amazon's Spellbind,
assassin's Phase Bomb, druid's Mythal, necromancer's Bane or the paladin's Colosseum ability or
certain class-specific items with the Mega Impact modifier. These attacks only work at 1/5
effectiveness if the target is immune. Items with -x% to Enemy [Element]
Resistance do not break immunities by themselves, but can be used to further reduce an enemy's
resistance after the immunity has been removed with Phase Bomb. Note that if an enemy is completely
immune to all elements, this is usually an uberquest enemy and there is a trick to killing it. Consult the
description of the uberquest.
My minions die all the time!
Many items carry the +x% Bonus to Summoned Minion Life modifier.
Focus on these items and your minions will get much stronger.

Focus on items with +x% Bonus to Summoned Minion Resistances. At skill
level 5 and up, minions have 75% base resistance in Hatred difficulty, 25% in Terror and -25% in
Destruction. The maximum amount of minion resistances on items you can have is +75%, meaning your
minions can be elemental immune in Hatred and Terror but not Destruction.
[This enemy] is invulnerable!
Uberquest enemies usually have a special trick to them. Some bosses are protected by a shield when
their minions are nearby.  Some enemies are simply
unkillable and should be avoided. Consult the documentation for the uberquest for more information.
Issues
My gems are not upgraded by a Gem Shrine!
Due to a Diablo II engine limitation, the new gems are not considered gems in some parts of the
game.
Is it normal that an uberboss or heroic boss spawns as a champion pack?
Diablo II likes to force spawn champions even when explicitly asked not to, or when a given monster
is excluded from the champion pool. Restart the game and try again.
Multiplayer
Can I play Median XL: Ultimative with other people?
Median XL: Ultimative officially supports TCP/IP multiplayer and open battle.net. It also works on closed
battle.net ('realms'), see the following question about realms.
Does Median XL: Ultimative have a realm?
Yes, check out The Sin War web site for more information.
How do I find other Median players?
The Sin War section on the official FORUM
allows players to find each other and play on the realm together. For TCP/IP and other, check The Madhouse section.
TCP/IP or open battle.net doesn't work!
Make sure that all players in the game have the same version of Diablo II LoD, the same version of the
mod and that either noone or everyone is using PlugY (if you don't know what PlugY is, you're not using
it).
I checked all that and it still doesn't work!
Median XL: Ultimative does not interfere with your ability to play multiplayer. This is not a Median XL: Ultimative problem.
If a router or LAN is involved, Diablo II may display an incorrect IP address; consult a site like
www.whatismyip.com to obtain your public IP. If you still don't have luck, ask for help on the FORUM.


You are viewing an historical archive of past issues. Please report new issues to the appropriate project issue tracker on GitHub.
Requested issue not found
Issues
| # | Summary | Product | Status | Kind | When |
|---|---|---|---|---|---|
| 2220 |
TagMapping.canonicalize! silently fails |
wincent.com | open | bug | |
| 2219 |
skip EXPLICT songs |
Synergy | open | feature request | |
| 2218 |
Revamp product pages, probably using React |
wincent.com | open | feature request | |
| 2217 |
Speed up load time by moving away from custom fonts |
wincent.com | closed | feature request | |
| 2216 |
Setting attributes & floating images |
wikitext | open | support ticket | Created , updated |
| 2215 |
Wikitext doesn't build on Ruby 2.2.x |
wikitext | closed | bug | Created , updated |
| 2214 |
Screencasts that use QuickTime plug-in no longer work in recent Chrome |
wincent.com | open | bug | Created , updated |
| 2213 |
"dir" setting for g:CommandTTraverseSCM doesn't work inside /tmp directory |
Command-T | closed | bug | |
| 2212 |
Command-T choking no files with spaces in the paths |
Command-T | closed | bug | |
| 2211 |
Add support for directory-specific wildignore config |
Command-T | closed | feature request | Created , updated |


PIPE
Section: Linux Programmer's Manual (7)
Updated: 2014-07-08
Index
Return to Main Contents
NAME
pipe - overview of pipes and FIFOs
DESCRIPTION
Pipes and FIFOs (also known as named pipes)
provide a unidirectional interprocess communication channel.
A pipe has a
read end
and a
write end.
Data written to the write end of a pipe can be read
from the read end of the pipe.
A pipe is created using
pipe(2),
which creates a new pipe and returns two file descriptors,
one referring to the read end of the pipe,
the other referring to the write end.
Pipes can be used to create a communication channel between related
processes; see
pipe(2)
for an example.
A FIFO (short for First In First Out) has a name within the filesystem
(created using
mkfifo(3)),
and is opened using
open(2).
Any process may open a FIFO, assuming the file permissions allow it.
The read end is opened using the
O_RDONLY
flag; the write end is opened using the
O_WRONLY
flag.
See
fifo(7)
for further details.
Note:
although FIFOs have a pathname in the filesystem,
I/O on FIFOs does not involve operations on the underlying device
(if there is one).
I/O on pipes and FIFOs
The only difference between pipes and FIFOs is the manner in which
they are created and opened.
Once these tasks have been accomplished,
I/O on pipes and FIFOs has exactly the same semantics.
If a process attempts to read from an empty pipe, then
read(2)
will block until data is available.
If a process attempts to write to a full pipe (see below), then
write(2)
blocks until sufficient data has been read from the pipe
to allow the write to complete.
Nonblocking I/O is possible by using the
fcntl(2)
F_SETFL
operation to enable the
O_NONBLOCK
open file status flag.
The communication channel provided by a pipe is a
byte stream:
there is no concept of message boundaries.
If all file descriptors referring to the write end of a pipe
have been closed, then an attempt to
read(2)
from the pipe will see end-of-file
(read(2)
will return 0).
If all file descriptors referring to the read end of a pipe
have been closed, then a
write(2)
will cause a
SIGPIPE
signal to be generated for the calling process.
If the calling process is ignoring this signal, then
write(2)
fails with the error
EPIPE.
An application that uses
pipe(2)
and
fork(2)
should use suitable
close(2)
calls to close unnecessary duplicate file descriptors;
this ensures that end-of-file and
SIGPIPE/EPIPE
are delivered when appropriate.
It is not possible to apply
lseek(2)
to a pipe.
Pipe capacity
A pipe has a limited capacity.
If the pipe is full, then a
write(2)
will block or fail, depending on whether the
O_NONBLOCK
flag is set (see below).
Different implementations have different limits for the pipe capacity.
Applications should not rely on a particular capacity:
an application should be designed so that a reading process consumes data
as soon as it is available,
so that a writing process does not remain blocked.
In Linux versions before 2.6.11, the capacity of a pipe was the same as
the system page size (e.g., 4096 bytes on i386).
Since Linux 2.6.11, the pipe capacity is 65536 bytes.
Since Linux 2.6.35, the default pipe capacity is 65536 bytes,
but the capacity can be queried and set using the
fcntl(2)
F_GETPIPE_SZ
and
F_SETPIPE_SZ
operations.
See
fcntl(2)
for more information.
PIPE_BUF
POSIX.1-2001 says that
write(2)s
of less than
PIPE_BUF
bytes must be atomic: the output data is written to the pipe as a
contiguous sequence.
Writes of more than
PIPE_BUF
bytes may be nonatomic: the kernel may interleave the data
with data written by other processes.
POSIX.1-2001 requires
PIPE_BUF
to be at least 512 bytes.
(On Linux,
PIPE_BUF
is 4096 bytes.)
The precise semantics depend on whether the file descriptor is nonblocking
(O_NONBLOCK),
whether there are multiple writers to the pipe, and on
n,
the number of bytes to be written:
- O_NONBLOCK disabled, n <= PIPE_BUF
-
All
n
bytes are written atomically;
write(2)
may block if there is not room for
n
bytes to be written immediately
- O_NONBLOCK enabled, n <= PIPE_BUF
-
If there is room to write
n
bytes to the pipe, then
write(2)
succeeds immediately, writing all
n
bytes; otherwise
write(2)
fails, with
errno
set to
EAGAIN.
- O_NONBLOCK disabled, n > PIPE_BUF
-
The write is nonatomic: the data given to
write(2)
may be interleaved with
write(2)s
by other process;
the
write(2)
blocks until
n
bytes have been written.
- O_NONBLOCK enabled, n > PIPE_BUF
-
If the pipe is full, then
write(2)
fails, with
errno
set to
EAGAIN.
Otherwise, from 1 to
n
bytes may be written (i.e., a "partial write" may occur;
the caller should check the return value from
write(2)
to see how many bytes were actually written),
and these bytes may be interleaved with writes by other processes.
Open file status flags
The only open file status flags that can be meaningfully applied to
a pipe or FIFO are
O_NONBLOCK
and
O_ASYNC.
Setting the
O_ASYNC
flag for the read end of a pipe causes a signal
(SIGIO
by default) to be generated when new input becomes available on the pipe
(see
fcntl(2)
for details).
On Linux,
O_ASYNC
is supported for pipes and FIFOs only since kernel 2.6.
Portability notes
On some systems (but not Linux), pipes are bidirectional:
data can be transmitted in both directions between the pipe ends.
According to POSIX.1-2001, pipes only need to be unidirectional.
Portable applications should avoid reliance on
bidirectional pipe semantics.
SEE ALSO
dup(2),
fcntl(2),
open(2),
pipe(2),
poll(2),
select(2),
socketpair(2),
stat(2),
mkfifo(3),
epoll(7),
fifo(7)
Index
- NAME
-
- DESCRIPTION
-
- I/O on pipes and FIFOs
-
- Pipe capacity
-
- PIPE_BUF
-
- Open file status flags
-
- Portability notes
-
- SEE ALSO
-
This document was created by
man2html,
using the manual pages.
Time: 02:55:22 GMT, September 18, 2014


Go Home
Mathematics Department
This is is the list of all of the Mathematics department faculty.
Professor
Image
Jeff Heath
Lucas Hoots
Joel Kilty
Michael Lamar
Alex McAllister
Sarah Murray
Prayat Poudel
Ellen Swanson
Lesley Wiglesworth
John Wilson
Go Home


GOOD WILL HUNTING (R)
Directed by Gus Van Sant Jr. Running Time: 126 minutes Originally Released: December 5, 1997
Reviewed by E. Benjamin Kelsey
* * * * (out of four)
Given the opportunity, I would much rather be a musical genius than a math prodigy. Luckily, I stand a much better chance of that than the other. But as Matt Damon's character Will Hunting explains, it's something that some people might "just get". Beethoven looked at a piano and just understood it, Will explains, and while he can't play a tune to save himself, when it comes to complex mathematical equations, he just gets it.
Will grew up an orphan on the poorer side of Boston, living a life of abusive foster parents and insecurity. On the verge of his 21st birthday, the closest he's come to prestige is working as a janitor for the world-renowned MIT. He's hot-tempered, he's cocky, he's sarcastic, and he's fearful of even the slightest depths of intimacy, but behind all the obvious signs of a troubled kid, Will has abilities very few of us possess. Example? How about solving math problems that even learned scholars took two years to figure out, and doing it in just one night?
MIT Professor Lambeau (Stellan Skarsgård, most notably from BREAKING THE WAVES) has been leaving these challenges on a chalkboard outside his classroom so pupils can test themselves. Everyday, it appears that a mystery person has solved the seemingly mind-boggling equation, but nobody is admitting to it, and everybody, especially Lambeau, wonders who it could be. But one night after hours, Lambeau discovers a foul-mouthed janitor writing on the board, and is astonished when he realizes this is the genius he's been looking for.
Will isn't too interested in talking to the professor, but when he gets arrested for assaulting an officer, it is the professor who bails him out. The judge agrees to release Will into Lambeau's custody on one condition - Will must develop his abilities with the professor and regularly meet with a psychologist. Particulary reluctant to cooperate with the latter request, Will taunts each and every psychologist Lambeau finds for him, and before we know it, it is the psychologists who refuse to work with the smart-mouthed virtuoso.
As a last resort, Lambeau approaches an old friend named Sean McGuire (Robin Williams), a psychologist whose lesser accomplishments in life has led to an awkward relationship with the highly-lauded professor. After losing his wife to a long-illness, Sean seems to need some therapy of his own, which, along with a similar childhood, helps him connect deeper with Will than anyone has yet. After an abrasive beginning, the two develop a strong, silent fondness for each other, and it is the exchanges between them that make this film such a masterpiece. Williams, who has spent the last five years or so giving impassioned performances in such mediocre films as JACK and FATHERS' DAY, returns to acting brilliance with a performance that screams Oscar nomination. The man who has played Mork the alien, Popeye the sailor-man, Genie the genie, and even Peter Pan has reconfirmed something he demonstrated in DEAD POETS SOCIETY and AWAKENINGS . . . he's an even better dramatic actor than comedic, and we can only pray he dominates more roles like this in the future.
Other key characters include Will's best friend Chuckie, played by CHASING AMY's Ben Affleck. Affleck and Damon are life-long buddies in real life, and the two also wrote this Oscar-potential script. Affleck's role is actually quite small, but his performance is commendable and shows why he'll be a rising star in the next few years. Minnie Driver plays Will's Harvard student love-interest, Skylar, a British babe who falls almost immediately in love with the cocky but brilliant beau. The romance is by far the biggest flaw of the film. It's quite underdeveloped, needing either more focus or a complete deletion from the story. There is one scene where Will's fear of intimacy results in a bitter argument between the two young lovers. It's a wonderfully acted scene, but as great as it was, it could've packed ten times the emotional impact had the relationship been more fully developed. The romance is also important because it provides for some of the year's best dialogue as Will and Sean discuss love. Sadly, the movie would have suffered without the love-story, but it also would've been too long had they used it like it needed to be used.
Damon proves very impressive here, not only as an actor but as a writer. In truly one of the best performances of the year, Damon is less likely to be noticed here than in the more publicized JOHN GRISHAM'S THE RAINMAKER, but this is still the role to see him in. Like Affleck, Damon is on his way to well-deserved stardom, and if he continues as a writer, over the next few years, he could prove to be one of the better talents Hollywood has to offer.
Director Gus Van Sant Jr. does a fine job handling this project, but with a wonderful script and a near-perfect cast, it seems unlikely that a lesser movie could've been made, even by a more gauche director. Jean-Yves Escoffier's understated cinematography is sophisticated and artistic, and Danny Elfman provides some nice musical pieces to accompany it. Skarsgård's performance as Professor Lambeau also deserves applause.
Coming in at the end of the year, GOOD WILL HUNTING is likely to make quite an appearance at the Oscars and, hopefully, on critics' top ten lists for the year. It jumped way up to number three on mine, only being surpassed by the obvious TITANIC and the aforementioned Affleck film, CHASING AMY. While this film deserves four-stars, it is not without a few mild imperfections, but, not to repeat myself, the chemistry between Damon and Williams is enough to give this the highest grade it can get. I would highly recommend this film to everyone, but beware - this film is quite liberal in its use of the most notorious four-letter word known to Hollywood. If you still don't know what I mean, think of Joe Pesci.  For those of you who do understand, if this is something you can handle, or at least get past, it will be well worth your effort.
December 30, 1997
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


DL
This is to be used in the BODY
Tag. This tag is used to create Definition
Lists . Actually the list is embedded in this tag. This is a Container
Tag and thus has to be closed.
Syntax
<DL>
<DT> ...
<DD> ....
<DT> ...
<DD> ....
</DL>
Example
<DL>
<DT> Term1
<DD> Definition1
<DT> Term2
<DD> Definition2
</DL>
Effect
Term1
Definition1
Term2
Definition2
Home
About


| 002:164 Khan | : |
Verily! In the creation of the heavens and the earth, and in the alternation of night and day, and the ships which sail through the sea with that which is of use to mankind, and the water (rain) which Allah sends down from the sky and makes the earth alive therewith after its death, and the moving (living) creatures of all kinds that He has scattered therein, and in the veering of winds and clouds which are held between the sky and the earth, are indeed Ayat (proofs, evidences, signs, etc.) for people of understanding. |
| 002:164 Maulana | : |
In the creation of the heavens and the earth, and the alternation of night and day, and the ships that run in the sea with that which profits men, and the water that Allah sends down from the sky, then gives life therewith to the earth after its death and spreads in it all (kinds of) animals, and the changing of the winds and the clouds made subservient between heaven and earth, there are surely signs for a people who understand. |
| 002:164 Pickthal | : |
Lo! In the creation of the heavens and the earth, and the difference of night and day, and the ships which run upon the sea with that which is of use to men, and the water which Allah sendeth down from the sky, thereby reviving the earth after its death, and dispersing all kinds of beasts therein, and (in) the ordinance of the winds, and the clouds obedient between heaven and earth: are signs (of Allah's Sovereignty) for people who have sense. |
| 002:164 Rashad | : |
In the creation of the heavens and the earth, the alternation of night and day, the ships that roam the ocean for the benefit of the people, the water that GOD sends down from the sky to revive dead land and to spread in it all kinds of creatures, the manipulation of the winds, and the clouds that are placed between the sky and the earth, there are sufficient proofs for people who understand. |
| 002:164 Sarwar | : |
The creation of the heavens and the earth, the alternation of nights and days, the ships that sail in the sea for the benefit of the people, the water that God sends from the sky to revive the dead earth where He has scattered all kinds of animals, the winds of all directions, and the clouds rendered for service between the sky and the earth are all evidence (of His existence) for those who use their reason. |
| 002:164 Shakir | : |
Most surely in the creation of the heavens and the earth and the alternation of the night and the day, and the ships that run in the sea with that which profits men, and the water that Allah sends down from the cloud, then gives life with it to the earth after its death and spreads in it all (kinds of) animals, and the changing of the winds and the clouds made subservient between the heaven and the earth, there are signs for a people who understand. |
| 002:164 Sherali | : |
Verily, in the creation of the heavens and the earth and in the alternation of the night and the day, and in the ships that sail the sea with that which profits men, and in the water which ALLAH sends down from the sky and quickens therewith the earth after its death and scatters therein all kinds of beasts, and in the change of the winds and the clouds pressed into service between the heaven and the earth - are indeed Signs for the people who use their understanding. |
| 002:164 Yusufali | : |
Behold! in the creation of the heavens and the earth; in the alternation of the night and the day; in the sailing of the ships through the ocean for the profit of mankind; in the rain which Allah Sends down from the skies, and the life which He gives therewith to an earth that is dead; in the beasts of all kinds that He scatters through the earth; in the change of the winds, and the clouds which they Trail like their slaves between the sky and the earth;- (Here) indeed are Signs for a people that are wise. |
Concepts/Themes Covered: أركان الإسلام > التوحيد > توحيد الله تعالي > وجوده Pillars of Islam> Islamic> Oneness of Allah> His Existence العلوم والفنون > الحقائق العلمية و الإشاة إلى وقائع أيدتهاالإكتشافات العلمية > البحر Science and Art> The Scientific Facts and the Indication to Facts which have been supported by the Scientific Discoveries>The Sea العلوم والفنون > الحقائق العلمية و الإشاة إلى وقائع أيدتهاالإكتشافات العلمية > الريح Science and Art> The Scientific Facts and the Indication to Facts which have been supported by the Scientific Discoveries>The Wind العلوم والفنون > الحقائق العلمية و الإشاة إلى وقائع أيدتهاالإكتشافات العلمية > السحاب Science and Art> The Scientific Facts and the Indication to Facts which have been supported by the Scientific Discoveries>The Clouds
This tool uses eight English parallel translations for the Holy Quran imported from Mr. Clay Smith. You can also visit Qurany Concepts for browsing the Quran themes or topics. If you want to search the Holy Quran for keywords, please visit Qurany Keywords.


package mem_mapped
The mem_mapped
package contains classes, traits and objects for out-of-core
linear algebra, including vectors and matrices for real and complex numbers.
- Alphabetic
- By Inheritance
- mem_mapped
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
trait
MatriC
extends Error
The
MatriC
trait specifies the operations to be defined by the concrete classes implementingComplex
matrices, i.e., MatrixC - dense matrix BidMatrixC - bidiagonal matrix - useful for computing Singular Values SparseMatrixC - sparse matrix - majority of elements should be zero SymTriMatrixC - symmetric triangular matrix - useful for computing Eigenvalues par.MatrixC - parallel dense matrix par.SparseMatrixC - parallel sparse matrix Some of the classes provide a few custom methods, e.g., methods beginning with "times" or ending with "npp".The
MatriC
trait specifies the operations to be defined by the concrete classes implementingComplex
matrices, i.e., MatrixC - dense matrix BidMatrixC - bidiagonal matrix - useful for computing Singular Values SparseMatrixC - sparse matrix - majority of elements should be zero SymTriMatrixC - symmetric triangular matrix - useful for computing Eigenvalues par.MatrixC - parallel dense matrix par.SparseMatrixC - parallel sparse matrix Some of the classes provide a few custom methods, e.g., methods beginning with "times" or ending with "npp". ------------------------------------------------------------------------------ row-wise column-wise Append: matrix +: vector matrix +: vector Concatenate: matrix ++ matrix matrix ++ matrix -
trait
MatriD
extends Error
The
MatriD
trait specifies the operations to be defined by the concrete classes implementingDouble
matrices, i.e., MatrixD - dense matrix BidMatrixD - bidiagonal matrix - useful for computing Singular Values SparseMatrixD - sparse matrix - majority of elements should be zero SymTriMatrixD - symmetric triangular matrix - useful for computing Eigenvalues par.MatrixD - parallel dense matrix par.SparseMatrixD - parallel sparse matrix Some of the classes provide a few custom methods, e.g., methods beginning with "times" or ending with "npp".The
MatriD
trait specifies the operations to be defined by the concrete classes implementingDouble
matrices, i.e., MatrixD - dense matrix BidMatrixD - bidiagonal matrix - useful for computing Singular Values SparseMatrixD - sparse matrix - majority of elements should be zero SymTriMatrixD - symmetric triangular matrix - useful for computing Eigenvalues par.MatrixD - parallel dense matrix par.SparseMatrixD - parallel sparse matrix Some of the classes provide a few custom methods, e.g., methods beginning with "times" or ending with "npp". ------------------------------------------------------------------------------ row-wise column-wise Append: matrix +: vector matrix +: vector Concatenate: matrix ++ matrix matrix ++ matrix -
trait
MatriI
extends Error
The
MatriI
trait specifies the operations to be defined by the concrete classes implementingInt
matrices, i.e., MatrixI - dense matrix BidMatrixI - bidiagonal matrix - useful for computing Singular Values SparseMatrixI - sparse matrix - majority of elements should be zero SymTriMatrixI - symmetric triangular matrix - useful for computing Eigenvalues par.MatrixI - parallel dense matrix par.SparseMatrixI - parallel sparse matrix Some of the classes provide a few custom methods, e.g., methods beginning with "times" or ending with "npp".The
MatriI
trait specifies the operations to be defined by the concrete classes implementingInt
matrices, i.e., MatrixI - dense matrix BidMatrixI - bidiagonal matrix - useful for computing Singular Values SparseMatrixI - sparse matrix - majority of elements should be zero SymTriMatrixI - symmetric triangular matrix - useful for computing Eigenvalues par.MatrixI - parallel dense matrix par.SparseMatrixI - parallel sparse matrix Some of the classes provide a few custom methods, e.g., methods beginning with "times" or ending with "npp". ------------------------------------------------------------------------------ row-wise column-wise Append: matrix +: vector matrix +: vector Concatenate: matrix ++ matrix matrix ++ matrix -
trait
MatriL
extends Error
The
MatriL
trait specifies the operations to be defined by the concrete classes implementingLong
matrices, i.e., MatrixL - dense matrix BidMatrixL - bidiagonal matrix - useful for computing Singular Values SparseMatrixL - sparse matrix - majority of elements should be zero SymTriMatrixL - symmetric triangular matrix - useful for computing Eigenvalues par.MatrixL - parallel dense matrix par.SparseMatrixL - parallel sparse matrix Some of the classes provide a few custom methods, e.g., methods beginning with "times" or ending with "npp".The
MatriL
trait specifies the operations to be defined by the concrete classes implementingLong
matrices, i.e., MatrixL - dense matrix BidMatrixL - bidiagonal matrix - useful for computing Singular Values SparseMatrixL - sparse matrix - majority of elements should be zero SymTriMatrixL - symmetric triangular matrix - useful for computing Eigenvalues par.MatrixL - parallel dense matrix par.SparseMatrixL - parallel sparse matrix Some of the classes provide a few custom methods, e.g., methods beginning with "times" or ending with "npp". ------------------------------------------------------------------------------ row-wise column-wise Append: matrix +: vector matrix +: vector Concatenate: matrix ++ matrix matrix ++ matrix -
trait
MatriQ
extends Error
The
MatriQ
trait specifies the operations to be defined by the concrete classes implementingRational
matrices, i.e., MatrixQ - dense matrix BidMatrixQ - bidiagonal matrix - useful for computing Singular Values SparseMatrixQ - sparse matrix - majority of elements should be zero SymTriMatrixQ - symmetric triangular matrix - useful for computing Eigenvalues par.MatrixQ - parallel dense matrix par.SparseMatrixQ - parallel sparse matrix Some of the classes provide a few custom methods, e.g., methods beginning with "times" or ending with "npp".The
MatriQ
trait specifies the operations to be defined by the concrete classes implementingRational
matrices, i.e., MatrixQ - dense matrix BidMatrixQ - bidiagonal matrix - useful for computing Singular Values SparseMatrixQ - sparse matrix - majority of elements should be zero SymTriMatrixQ - symmetric triangular matrix - useful for computing Eigenvalues par.MatrixQ - parallel dense matrix par.SparseMatrixQ - parallel sparse matrix Some of the classes provide a few custom methods, e.g., methods beginning with "times" or ending with "npp". ------------------------------------------------------------------------------ row-wise column-wise Append: matrix +: vector matrix +: vector Concatenate: matrix ++ matrix matrix ++ matrix -
trait
MatriR
extends Error
The
MatriR
trait specifies the operations to be defined by the concrete classes implementingReal
matrices, i.e., MatrixR - dense matrix BidMatrixR - bidiagonal matrix - useful for computing Singular Values SparseMatrixR - sparse matrix - majority of elements should be zero SymTriMatrixR - symmetric triangular matrix - useful for computing Eigenvalues par.MatrixR - parallel dense matrix par.SparseMatrixR - parallel sparse matrix Some of the classes provide a few custom methods, e.g., methods beginning with "times" or ending with "npp".The
MatriR
trait specifies the operations to be defined by the concrete classes implementingReal
matrices, i.e., MatrixR - dense matrix BidMatrixR - bidiagonal matrix - useful for computing Singular Values SparseMatrixR - sparse matrix - majority of elements should be zero SymTriMatrixR - symmetric triangular matrix - useful for computing Eigenvalues par.MatrixR - parallel dense matrix par.SparseMatrixR - parallel sparse matrix Some of the classes provide a few custom methods, e.g., methods beginning with "times" or ending with "npp". ------------------------------------------------------------------------------ row-wise column-wise Append: matrix +: vector matrix +: vector Concatenate: matrix ++ matrix matrix ++ matrix -
trait
MatriS
extends Error
The
MatriS
trait specifies the operations to be defined by the concrete classes implementingStrNum
matrices, i.e., MatrixS - dense matrix BidMatrixS - bidiagonal matrix - useful for computing Singular Values SparseMatrixS - sparse matrix - majority of elements should be zero SymTriMatrixS - symmetric triangular matrix - useful for computing Eigenvalues par.MatrixS - parallel dense matrix par.SparseMatrixS - parallel sparse matrix Some of the classes provide a few custom methods, e.g., methods beginning with "times" or ending with "npp".The
MatriS
trait specifies the operations to be defined by the concrete classes implementingStrNum
matrices, i.e., MatrixS - dense matrix BidMatrixS - bidiagonal matrix - useful for computing Singular Values SparseMatrixS - sparse matrix - majority of elements should be zero SymTriMatrixS - symmetric triangular matrix - useful for computing Eigenvalues par.MatrixS - parallel dense matrix par.SparseMatrixS - parallel sparse matrix Some of the classes provide a few custom methods, e.g., methods beginning with "times" or ending with "npp". ------------------------------------------------------------------------------ row-wise column-wise Append: matrix +: vector matrix +: vector Concatenate: matrix ++ matrix matrix ++ matrix -
class
MatrixC
extends MatriC with Error with Serializable
The
MatrixC
class stores and operates on Numeric Matrices of typeComplex
.The
MatrixC
class stores and operates on Numeric Matrices of typeComplex
. This class follows thegen.MatrixN
framework and is provided for efficiency. -
class
MatrixD
extends MatriD with Error with Serializable
The
MatrixD
class stores and operates on Numeric Matrices of typeDouble
.The
MatrixD
class stores and operates on Numeric Matrices of typeDouble
. This class follows thegen.MatrixN
framework and is provided for efficiency. -
class
MatrixI
extends MatriI with Error with Serializable
The
MatrixI
class stores and operates on Numeric Matrices of typeInt
.The
MatrixI
class stores and operates on Numeric Matrices of typeInt
. This class follows thegen.MatrixN
framework and is provided for efficiency. -
class
MatrixL
extends MatriL with Error with Serializable
The
MatrixL
class stores and operates on Numeric Matrices of typeLong
.The
MatrixL
class stores and operates on Numeric Matrices of typeLong
. This class follows thegen.MatrixN
framework and is provided for efficiency. -
class
MatrixQ
extends MatriQ with Error with Serializable
The
MatrixQ
class stores and operates on Numeric Matrices of typeRational
.The
MatrixQ
class stores and operates on Numeric Matrices of typeRational
. This class follows thegen.MatrixN
framework and is provided for efficiency. -
class
MatrixR
extends MatriR with Error with Serializable
The
MatrixR
class stores and operates on Numeric Matrices of typeReal
.The
MatrixR
class stores and operates on Numeric Matrices of typeReal
. This class follows thegen.MatrixN
framework and is provided for efficiency. -
trait
Vec
extends AnyRef
The
Vec
trait establishes a common base type for all vectors (e.g., VectorD). -
class
VectorC
extends Traversable[Complex] with PartiallyOrdered[VectorC] with Vec with Error with Serializable
The
VectorC
class stores and operates on Numeric Vectors of base typeComplex
.The
VectorC
class stores and operates on Numeric Vectors of base typeComplex
. It follows the framework ofgen.VectorN [T]
and is provided for performance. -
class
VectorD
extends Traversable[Double] with PartiallyOrdered[VectorD] with Vec with Error with Serializable
The
VectorD
class stores and operates on Numeric Vectors of base typeDouble
.The
VectorD
class stores and operates on Numeric Vectors of base typeDouble
. It follows the framework ofgen.VectorN [T]
and is provided for performance. -
class
VectorI
extends Traversable[Int] with PartiallyOrdered[VectorI] with Vec with Error with Serializable
The
VectorI
class stores and operates on Numeric Vectors of base typeInt
.The
VectorI
class stores and operates on Numeric Vectors of base typeInt
. It follows the framework ofgen.VectorN [T]
and is provided for performance. -
class
VectorL
extends Traversable[Long] with PartiallyOrdered[VectorL] with Vec with Error with Serializable
The
VectorL
class stores and operates on Numeric Vectors of base typeLong
.The
VectorL
class stores and operates on Numeric Vectors of base typeLong
. It follows the framework ofgen.VectorN [T]
and is provided for performance. -
class
VectorQ
extends Traversable[Rational] with PartiallyOrdered[VectorQ] with Vec with Error with Serializable
The
VectorQ
class stores and operates on Numeric Vectors of base typeRational
.The
VectorQ
class stores and operates on Numeric Vectors of base typeRational
. It follows the framework ofgen.VectorN [T]
and is provided for performance. -
class
VectorR
extends Traversable[Real] with PartiallyOrdered[VectorR] with Vec with Error with Serializable
The
VectorR
class stores and operates on Numeric Vectors of base typeReal
.The
VectorR
class stores and operates on Numeric Vectors of base typeReal
. It follows the framework ofgen.VectorN [T]
and is provided for performance. -
class
VectorS
extends Traversable[StrNum] with PartiallyOrdered[VectorS] with Vec with Error with Serializable
The
VectorS
class stores and operates on Numeric Vectors of base typeStrNum
.The
VectorS
class stores and operates on Numeric Vectors of base typeStrNum
. It follows the framework ofgen.VectorN [T]
and is provided for performance.
Value Members
-
object
Converter
The
Converter
object converts string number vectors to integer vectors. -
object
MatrixC
extends Error with Serializable
The
MatrixC
companion object provides operations forMatrixC
that don't require 'this' (like static methods in Java).The
MatrixC
companion object provides operations forMatrixC
that don't require 'this' (like static methods in Java). It provides factory methods for building matrices from files or vectors. -
object
MatrixCTest
extends App with PackageInfo
The
MatrixCTest
object tests the operations provided byMatrixC
class.The
MatrixCTest
object tests the operations provided byMatrixC
class. > run-main scalation.linalgebra.MatrixCTest -
object
MatrixD
extends Error with Serializable
The
MatrixD
companion object provides operations forMatrixD
that don't require 'this' (like static methods in Java).The
MatrixD
companion object provides operations forMatrixD
that don't require 'this' (like static methods in Java). It provides factory methods for building matrices from files or vectors. -
object
MatrixDTest
extends App with PackageInfo
The
MatrixDTest
object tests the operations provided byMatrixD
class.The
MatrixDTest
object tests the operations provided byMatrixD
class. > run-main scalation.linalgebra.MatrixDTest -
object
MatrixI
extends Error with Serializable
The
MatrixI
companion object provides operations forMatrixI
that don't require 'this' (like static methods in Java).The
MatrixI
companion object provides operations forMatrixI
that don't require 'this' (like static methods in Java). It provides factory methods for building matrices from files or vectors. -
object
MatrixITest
extends App with PackageInfo
The
MatrixITest
object tests the operations provided byMatrixI
class.The
MatrixITest
object tests the operations provided byMatrixI
class. > run-main scalation.linalgebra.MatrixITest -
object
MatrixL
extends Error with Serializable
The
MatrixL
companion object provides operations forMatrixL
that don't require 'this' (like static methods in Java).The
MatrixL
companion object provides operations forMatrixL
that don't require 'this' (like static methods in Java). It provides factory methods for building matrices from files or vectors. -
object
MatrixLTest
extends App with PackageInfo
The
MatrixLTest
object tests the operations provided byMatrixL
class.The
MatrixLTest
object tests the operations provided byMatrixL
class. > run-main scalation.linalgebra.MatrixLTest -
object
MatrixQ
extends Error with Serializable
The
MatrixQ
companion object provides operations forMatrixQ
that don't require 'this' (like static methods in Java).The
MatrixQ
companion object provides operations forMatrixQ
that don't require 'this' (like static methods in Java). It provides factory methods for building matrices from files or vectors. -
object
MatrixQTest
extends App with PackageInfo
The
MatrixQTest
object tests the operations provided byMatrixQ
class.The
MatrixQTest
object tests the operations provided byMatrixQ
class. > run-main scalation.linalgebra.MatrixQTest -
object
MatrixR
extends Error with Serializable
The
MatrixR
companion object provides operations forMatrixR
that don't require 'this' (like static methods in Java).The
MatrixR
companion object provides operations forMatrixR
that don't require 'this' (like static methods in Java). It provides factory methods for building matrices from files or vectors. -
object
MatrixRTest
extends App with PackageInfo
The
MatrixRTest
object tests the operations provided byMatrixR
class.The
MatrixRTest
object tests the operations provided byMatrixR
class. > run-main scalation.linalgebra.MatrixRTest -
object
Vec
The
Vec
object provides a minimal set of functions that apply across all types of vectors.The
Vec
object provides a minimal set of functions that apply across all types of vectors.- See also
scalation.relalgebra.Relation
-
object
VectorC
extends Serializable
The
VectorC
object is the companion object for theVectorC
class. -
object
VectorCTest
extends App
The
VectorCTest
object tests the operations provided byVectorC
.The
VectorCTest
object tests the operations provided byVectorC
. > run-main scalation.linalgebra.mem_mapped.VectorCTest -
object
VectorD
extends Serializable
The
VectorD
object is the companion object for theVectorD
class. -
object
VectorDTest
extends App
The
VectorDTest
object tests the operations provided byVectorD
.The
VectorDTest
object tests the operations provided byVectorD
. > run-main scalation.linalgebra.mem_mapped.VectorDTest -
object
VectorI
extends Serializable
The
VectorI
object is the companion object for theVectorI
class. -
object
VectorITest
extends App
The
VectorITest
object tests the operations provided byVectorI
.The
VectorITest
object tests the operations provided byVectorI
. > run-main scalation.linalgebra.mem_mapped.VectorITest -
object
VectorL
extends Serializable
The
VectorL
object is the companion object for theVectorL
class. -
object
VectorLTest
extends App
The
VectorLTest
object tests the operations provided byVectorL
.The
VectorLTest
object tests the operations provided byVectorL
. > run-main scalation.linalgebra.mem_mapped.VectorLTest -
object
VectorQ
extends Serializable
The
VectorQ
object is the companion object for theVectorQ
class. -
object
VectorQTest
extends App
The
VectorQTest
object tests the operations provided byVectorQ
.The
VectorQTest
object tests the operations provided byVectorQ
. > run-main scalation.linalgebra.mem_mapped.VectorQTest -
object
VectorR
extends Serializable
The
VectorR
object is the companion object for theVectorR
class. -
object
VectorRTest
extends App
The
VectorRTest
object tests the operations provided byVectorR
.The
VectorRTest
object tests the operations provided byVectorR
. > run-main scalation.linalgebra.mem_mapped.VectorRTest -
object
VectorS
extends Serializable
The
VectorS
object is the companion object for theVectorS
class. -
object
VectorSTest
extends App
The
VectorSTest
object tests the operations provided byVectorS
.The
VectorSTest
object tests the operations provided byVectorS
. > run-main scalation.linalgebra.mem_mapped.VectorSTest


Blacksmith Duning:
Sorry about that. The sequence was silver - gold - silver. Don't be discouraged. You can't win them all!


{% extends "base.html" %} {% block css %} {% endblock %} {% block body %}
If you're reaching this page after trying to activate on Amazon, make sure to add a fresh copy of the bookmarklet on your bookmarks bar.
If that doesn't work out for you, shoot us an email!
{% endblock %} {% block scripts %} {% endblock %}


#include <lib/mdns/minimal/Server.h>
◆ ServerBase()
| mdns::Minimal::ServerBase::ServerBase |
( |
EndpointInfo * |
endpointStorage, |
|
|
size_t |
kStorageSize |
|
) |
| |
|
inline |
◆ ~ServerBase()
| mdns::Minimal::ServerBase::~ServerBase |
( |
| ) |
|
◆ BroadcastSend() [1/2]
Send a specific packet broadcast to all interfaces.
The same packet needs to be sent over potentially multiple interfaces. LWIP does not like having a pbuf sent over serparate interfaces, hence we create a copy TODO: this wastes one copy of the data and that could be optimized away
◆ BroadcastSend() [2/2]
Send a specific packet broadcast to a specific interface.
The same packet needs to be sent over potentially multiple interfaces. LWIP does not like having a pbuf sent over serparate interfaces, hence we create a copy TODO: this wastes one copy of the data and that could be optimized away
◆ DirectSend()
Send the specified packet to a destination IP address over the specified address.
◆ GetEndpointCount()
| size_t mdns::Minimal::ServerBase::GetEndpointCount |
( |
| ) |
const |
|
inline |
How many endpoints are availabe to be used by the server.
◆ GetEndpoints()
| const EndpointInfo* mdns::Minimal::ServerBase::GetEndpoints |
( |
| ) |
const |
|
inline |
Get the endpoints that are used by this server.
Entries with non-null UDP are considered usable.
◆ Listen()
Listen on the given interfaces/address types.
Since mDNS uses link-local addresses, one generally wants to listen on all non-loopback interfaces.
◆ SetDelegate()
◆ Shutdown()
| void mdns::Minimal::ServerBase::Shutdown |
( |
| ) |
|
Closes all currently open endpoints.
The documentation for this class was generated from the following files:


Grids / Dynamic Resize
This sample shows how columns in TreeGrid can occupy the whole space. Additionally, the TreeGrid will resize whenever a window size changes.
By default columns can have its width set in pixels, but in case of this example their width is set in percentage based on the TreeGrid width. So whenever TreeGrid is resized, the columns will also resize proportionally.
The following directive is used:
- IntegralUI Resize - allows resizing of ANY element based on its parent, page or window. The tag for this directive is iui-resize.
The resize directive accepts an object which holds specification on how the corresponding element will resize. Both element width and height values can be set, using as a reference their 'parent', the 'page' (inner window area), or the 'window' (outer window area including the window frame).
For more information check out the source code of this sample.


Akan names are derived from Ghanian culture. Frequently in Ghana, children are given their first name as a 'day name' which corresponds to the day in the week they were born. Akan names have further meanings concerning the soul and character of the person.Most Ghanaians have at least one name from this system, even if they also have an English or Christian name
Want to know your Akan Name?
Fill the form below.


Hello there.
My name is Sara and I'm looking for a job as a Junior Front-End
Developer. I know HTML, CSS, Vanilla JavaScript and React and I'm
willing to learn other languages.
This website is still in development, but you can check out my
GitHub and the
React Weather app
I've worked on while attending SheCodes.
I also enjoy Photography, Illustration and have experience in Graphic Design. You can navigate all categories in the bar above.


130 result for ...
Cleanser
Our creamy mask is formulated with a combination of clay, glycerin and cocoa extract to deliver all the benefits of a clay mask without drying out skin.
Our creamy mask is formulated with a combination of clay....
Location: Los AngelesSerum
Our creamy mask is formulated with a combination of clay, glycerin and cocoa extract to deliver all the benefits of a clay mask without drying out skin.
Our creamy mask is formulated with a combination of clay....
Location: Los AngelesToner
Our creamy mask is formulated with a combination of clay, glycerin and cocoa extract to deliver all the benefits of a clay mask without drying out skin.
Our creamy mask is formulated with a combination of clay....
Location: Los AngelesCleanser
Our creamy mask is formulated with a combination of clay, glycerin and cocoa extract to deliver all the benefits of a clay mask without drying out skin.
Our creamy mask is formulated with a combination of clay....
Location: Los AngelesSerum
Our creamy mask is formulated with a combination of clay, glycerin and cocoa extract to deliver all the benefits of a clay mask without drying out skin.
Our creamy mask is formulated with a combination of clay....
Location: Los Angeles


The Tortoise and the Hare
The race is won when one of the racers moves beyond 100 spaces.
The tortoise to the right will race your choice of rabbit, below. Just click to pick.
The racer will move the number of spaces shown in "speed" each turn the racer is focused.
The racer will start with the number of focus shown, and will lose 1 focus per turn.
When the racer's focus is < 1, the racer will stop racing until refocused.
Rabbits will refocus when the turtle catches up. Turtles refocus after just 1 turn.
More agility means less chance the racer will be caught and eaten.
Gurgle the Turtle
Speed:
Focus: 33
Agility:
Adolf
Speed:
Focus:
Agility:
Buckwheat
Speed:
Focus:
Agility:
Carrot
Speed:
Focus:
Agility:
Damien
Speed:
Focus:
Agility:
Eminem
Speed:
Focus:
Agility:


Site Information
This site was written in a variety of scripting and markup languages... primarily XHTML
and CSS. There are also a few Flash objects (the Tiltviewer and the JW player), a
few XML pages (the arguments page and the playlists for the two Flash objects), and a
good bit of PHP (used in the guestbook and survey to store information in the database).
This site also contains all original code. I did not cut or copy any of the content or scripts used on this site.
Since I hardcode this stuff, it's no meager task for me to do a big website. I've spent about 5 weeks of my life working on almost nothing but this site... I even spent Thanksgiving working on the site in order to get it done within a reasonable amount of time.
I'm also responsible for hosting this site, since it's going in my E-portfolio. So, once it's been graded for my Technical Writing Project, I will be moving it from the University of Central Florida's Eustis server to a private account I share with a friend on a Hostdime server. I'm giving this notice as a warning since the site will go down for a few hours as I move it over.
This site is an academic work. It is being created for my ENC3241 Technical Writing class as well as my CIS4004 Web Based Information Technologies class.
This site is a student work, and as such, I will not be able to spend every waking minute making sure people don't leave inappropriate messages in the guest book. I WILL update the site, but it will take a back seat to my studies, my job, and especially my girlfriend.
I've written the website with the intention of being cross-browser while retaining all of the pretty effects you'd have if you switched to Google Chrome. But since Internet Explorer and Firefox don't officially support CSS3, some of the site's effects might not function perfectly. So if you want to see this site in its full glory, get Chrome!
This site also contains all original code. I did not cut or copy any of the content or scripts used on this site.
Since I hardcode this stuff, it's no meager task for me to do a big website. I've spent about 5 weeks of my life working on almost nothing but this site... I even spent Thanksgiving working on the site in order to get it done within a reasonable amount of time.
I'm also responsible for hosting this site, since it's going in my E-portfolio. So, once it's been graded for my Technical Writing Project, I will be moving it from the University of Central Florida's Eustis server to a private account I share with a friend on a Hostdime server. I'm giving this notice as a warning since the site will go down for a few hours as I move it over.
This site is an academic work. It is being created for my ENC3241 Technical Writing class as well as my CIS4004 Web Based Information Technologies class.
This site is a student work, and as such, I will not be able to spend every waking minute making sure people don't leave inappropriate messages in the guest book. I WILL update the site, but it will take a back seat to my studies, my job, and especially my girlfriend.
I've written the website with the intention of being cross-browser while retaining all of the pretty effects you'd have if you switched to Google Chrome. But since Internet Explorer and Firefox don't officially support CSS3, some of the site's effects might not function perfectly. So if you want to see this site in its full glory, get Chrome!
About the Author
My name is Roscoe Pyell and. I am a student at the University of Central
Florida and, at the time of this website's publication, a senior in the Information
Technologies program.
This is the third website I've written for my Web Based IT class and I'm also expanding upon the original site and using if for my Technical Writing class. I've also put a lot of work into coding it. As such, there may be bugs. If there appears to be content missing or content is not displaying 'correctly' for you, send me a message and I'll try to take care of it the next time I update the site.
You may also be asking yourself why there's a picture of me snowboarding off to the left there... truth be told, I ran out of pictures of myself after putting that one up on my e-portfolio. I'm just not that big into getting my picture taken.
This is the third website I've written for my Web Based IT class and I'm also expanding upon the original site and using if for my Technical Writing class. I've also put a lot of work into coding it. As such, there may be bugs. If there appears to be content missing or content is not displaying 'correctly' for you, send me a message and I'll try to take care of it the next time I update the site.
You may also be asking yourself why there's a picture of me snowboarding off to the left there... truth be told, I ran out of pictures of myself after putting that one up on my e-portfolio. I'm just not that big into getting my picture taken.


Honzi
/
Guides
/
EVE Online
/Mastodon
Fittings:
CARGO
Fittings
Code
Notes
Cargo
[Mastodon, MASTODON-CARGO] Damage Control II Power Diagnostic System II Power Diagnostic System II Power Diagnostic System II Large Shield Extender II Medium Shield Extender II Medium Shield Extender II Multispectrum Shield Hardener II Multispectrum Shield Hardener II Civilian Gatling Pulse Laser Prototype Cloaking Device I Medium Core Defense Field Extender II Medium Core Defense Field Extender II
Upgrade your damage control and shield extenders to abyssal for additional tank and reduced zkill value.


Contains routines to obtain packed and unpacked indices into arrays
Compute the indices in each dimension from the global index
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| integer(kind=i32), | intent(in) | :: | iG | Index into a global vector |
||
| integer(kind=i32), | intent(in) | :: | nSub(:) | Size in each dimension |
Indices in each dimension to return
Given component indices, get the global vector location.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| integer(kind=i32), | intent(in) | :: | iSub(:) | Indices in each dimension. The first entry in iL is the left most index |
||
| integer(kind=i32), | intent(in) | :: | nSub(:) | Size in each dimension |
Index in the global vector
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| real(kind=r64) | :: | this | ||||
| integer(kind=i32) | :: | n | ||||
| logical | :: | bound |


A CIVIL ACTION
Reviewed by Harvey Karten, Ph.D. Touchstone Pictures Director: Steven Zaillian Writer: Steven Zaillian, book by Jonathan Harr Cast: John Travolta, Robert Duvall, William H. Macy, John Lithgow, Kathleen Quinlan, Dan Hedaya, James Gandolfini, Edward Hermann, Zeljko Ivanek, Tony Shalhoub, et al
Americans trust lawyers as much as they rely on politicians and used-car salesmen. We don't like 'em. How do we know? Because a lawyer himself tells us so. In a movie which dramatizes an actual case, Attorney Jan Schlichtmann tells his radio talk show listeners that lawyers have been abhorred not only in the U.S. but in other areas of the world throughout history. (He might have pointed out Shakespeare's own view, which the Bard enunciated in Henry VI, Part IV, "The first thing we do, let's kill all the lawyers"). It's a peculiar thing, though. If we dislike these professionals so much, why do we hire them so often, and why do we buy John Grisham's novels so regularly that anything he writes is guaranteed a number one position on the Best Seller lists? Most paradoxical of all, we cheer these fellows on mightily when they take on the giant corporations, as when a hero lawyer fights the entire tobacco industry and the insurance business in two of Grisham's books.
The answer is that we are selective in our affections. We like low-key, small-town Davids who take on big-city Goliaths. We dislike big-city counselors who bill $400 an hour to protect companies that commit atrocities. We also dislike small-town advocates who chase ambulances, who, we assume, have no feeling for their clients' suffering but who are interested only in winning huge sums that they share 40- 60 with their hapless clients.
All of this information is to explain the appeal of a book which has now become a high-profile movie, "A Civil Action." Written by a non-lawyer, Jonathan Harr, and published by Random House in December 1995, it swiftly became a best- seller and then a paperback, remaining on the most-read lists for quite a long time. Its appeal lay in its David-Goliath resonance, with the redemption of a personal injury lawyer, Jan Schlichtmann who hocked and lost everything--his home, his credit cards, his reputation, but not his integrity--in fighting two giant companies guilty of polluting Woburn, Massachusetts waters for well over a decade. As a result of the corporate evils, eight children had died of leukemia, while the two companies, Grace and Beatrice Foods, denied that they were in any way responsible. The case became an orphan for a while, i.e. no law firm was willing to go to the expense of handling it, because the odds of winning seemed remote. Even Jan Schlichtmann (John Travolta) had informed the mother of the dead child (Kathleen Quinlan) that he could not afford to take on the litigation. His mind was changed when he took a closer look at the chemically polluted waters that would find their way into the homes of the people of the small Massachusetts town.
What the movie version has in its favor is that Schlichtmann is not portrayed as a one-dimensional hero, an Atticus Finch fighting for all that is just and good. He is a flawed person, the sort that would be appreciated by the ancient Greek playwrights, a guy who is motivated less by the tragic circumstances of his clients than by a titanic ego and the quest for the ultimate contingency fee. He had been for years considered one of Boston's ten most eligible bachelors, an extravagant and superficial man who passed out his business card in a flash whenever he went by the scene of an accident. But when he saw the dirty waters and imagined the overwhelming sorrow that these families felt at the loss of the young ones, something snapped. He hires a team of geologists and engineers and pays their fee in the hundreds of thousands of dollars to collect evidence of the deadly nature of the soil around the waters. Specifically he is determined to prove that the chemicals used by a tannery had spilled over onto the soil and were not properly cleaned up. They were dumped carelessly into the ground and found their way into the drinking water of the residents.
Director Steven Zaillian, who adopted Mr. Harr's book to the screen, has fun taking down the big shots a notch or two. He is particularly scornful of the vice president of Grace and Company, who had invited Schlichtmann to New York to discuss a settlement and who humiliated the lawyer by patronizing the latter's education at Cornell University (he had himself gone to Harvard) and by instructing him that business is never transacted at the Harvard Club. Zaillian shows less contempt for the ordinary working-class people who refuse to testify that they had witnessed the company's dumping of toxic waste into the area around the water since, after all, their jobs depended on their remaining silent.
Unfortunately Zaillian does not exploit the major advantage of movies. Film is a visual medium, unlike books, and by conducting most of the action in the courtroom, in hearing chambers, and law offices, he is essentially giving us a filmed play. "A Civil Action" would do as well on the stage as the page, where dialogue is the most essential element, but is lost on the big screen which demands action and greater punch. Further, Zaillian does not take advantage of the skills of his actors with the one exception of Robert Duvall, who performs in the role of one of the two corporate lawyers, Jerome Facher. Facher is an eccentric chap, one who has earned his idiosyncrasies by being one of the city's top attorneys. He insists on a totally work-free lunch hour, where he listens to Boston Red Sox games on his little portable radio and scowls at the messenger lad who brings him envelopes during his quiet time. When he discusses cases by phone with big clients, he is not averse to throwing a ball against the wall and catching it, and when he sees a pen that he admires, he asks whether he can take it with him. Duvall's winning performance is not matched by Travolta, who dramatizes his part in a solid by stolid manner, and what's more his partners--played by William H. Macy and Tony Shalhoub--are caricatures. Kathleen Quinlan is insufferable as a woman who has lost her child, who wants only an apology from the corporations and not the money, and who turns her back on the now bankrupt Schlichtmann because he has not succeeded in getting that repentance.
Because "A Civil Action" is based on a real case, it does not have the feel-good ending that you might expect from a more melodramatic movie or from a comedy like "The Waterboy" (in which the good-guys' football team wins the game in the final second). That is all to the good. But the movie simply does not have the spark to kindle much excitement, given the capacities of the film medium. To see how a similar situation is handled in a more stirring manner, take in last year's "The Sweet Hereafter," which abounds in tingling imagery and features a monumental performance by Ian Holm as the troubled lawyer.
Rated PG-13. Running Time: 113 minutes. (C) 1998 Harvey Karten
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


library(terms)
This library module provides miscellaneous operations on terms. Exported predicates:
subsumeschk(
+General,
+Specific)
subsumes(
+General,
+Specific)
variant(
+Term,
+Variant)
term_subsumer(
+Term1,
+Term2,
-Term)
term_hash(
+Term,
-Hash)
term_hash(
+Term,
+Depth,
+Range,
-Hash)
term_variables(
+Term,
-Variables)
term_variables_bag(
+Term,
-Variables)
acyclic_term(
+X)
cyclic_term(
+X)
term_order(
+X,
+Y,
-R)
<
, =
, or >
according
as X @< Y, X == Y, or X @> Y. This is the same as compare/3
, except
for the argument order.
contains_term(
+Kernel,
+Expression)
sub_term/2
.
free_of_term(
+Kernel,
+Expression)
occurrences_of_term(
+Kernel,
+Expression,
-Tally)
sub_term/2
and then
test them with this routine. If you just want to find out
whether Kernel occurs in Expression or not, use contains_term/2
or free_of_term/2
.
contains_var(
+Variable,
+Term)
==
to check for
the variable (contains_term/2
uses =
) so it can be used to check
for arbitrary terms, not just variables.
free_of_var(
+Variable,
+Term)
occurrences_of_var(
+Term,
+Variable,
-Tally)
sub_term/2
and then
test them with this routine. If you just want to find out
whether Variable occurs in Term or not, use contains_var/2
or free_of_var/2
.
sub_term(
?Kernel,
+Term)
depth_bound(
+Term,
+Bound)
term_depth/2
.
length_bound(
?List,
+Bound)
size_bound(
+Term,
+Bound)
term_size/2
.
term_depth(
+Term,
-Depth)
calculates the Depth of a Term, using the definition term_depth(Var) = 0 term_depth(Const) = 0 term_depth(F(T1,...,Tn)) = 1+max(term_depth(T1),...,term_depth(Tn))
term_size(
+Term,
-Size)
same_functor(
?T1,
?T2)
same_functor(
?T1,
?T2,
?N)
same_functor/3
, at least one of T1 and T2
must be bound, or an error will be reported.
same_functor(
?T1,
?T2,
?F,
?N)