Example:
class ListWrapper { java.util.List<Integer> l; }
After the quick-fix is applied the result looks like:
import java.util.List; class ListWrapper { List<Integer> l; }
In Settings | Editor | Code Style | Java | Imports two settings can be found which influence this inspection. Use the settings there to specify if references to inner classes should be qualified with the outer class and if fully qualified names are allowed in javadoc.
Use the checkbox below to ignore fully qualified names inside the Java 9 provides and uses module statements.


Bootstrap 3 v.s. Foundation 5
[Updated on 2016-07-28]
Time flies and more than 1 year has been passed, however, still haven't create a theme for the blog (good job myself…)…
Now the Foundation 6 has been released for a while (with "for sites", "for emails", and "for apps", oh my!), while Bootstrap 4 is on its alpha3, hence, it may be a proper time to skip the Bootstrap 3 and Foundation 5, and do another comparison of the next version of them :P
Now I'm looking for a HTML/CSS/JS framework for build a theme for this blog, there are two of the frameworks on the top of the list - Bootstrap and Foundation.
Based on the articles I found, it seems that Foundation wins. Following are the pros of Foundation:
- Foundation 5 provides a better grid system than Bootstrap 3 - The Block Grid
- Foundation 5 is using
rem
as sizing unit while Bootstrap 3 is usingpx
, namely Foundation 5 is closer to the conceptresponsive
ormobile-first
- Foundation 5 provides some useful features, such as form validation (Abide), Interchange, right-to-left support, pricing tables, tours, and off-canvas navigation [1]
However, Bootstrap 3, or generally Bootstrap, is occupying a larger market, which means that there are much more themes in the wild than Foundation.
Other than the comparison above, people are also discussing about that for using Foundation, one need more customisation than using Bootstrap. It takes longer than using Bootstrap for initialising a project. It sounds like that if we don't use third party themes, using Foundation could reduce the similarity of the web application comparing using Bootstrap.
There are other thoughts learned from the articles, that I found when people evaluating this kind of frameworks, they consider more about the grid system, sizing unit and how good the framework fits the requirement of mobile-first/responsive design.
All in all, Foundation 5 is decided to be used for the theme of this blog, if nothing special happens.
Bibliography


Class: Aws::Firehose::Types::VpcConfigurationDescription
| Relationships & Source Files | |
| Super Chains via Extension / Inclusion / Inheritance | |
|
Class Chain:
self,
Struct
|
|
|
Instance Chain:
self,
::Aws::Structure ,
Struct
|
|
| Inherits: |
Struct
|
| Defined in: | gems/aws-sdk-firehose/lib/aws-sdk-firehose/types.rb |
Overview
The details of the VPC of the Amazon ES destination.
Constant Summary
Instance Attribute Summary
-
#role_arn ⇒ String
rw
The ARN of the
::Aws::IAM
role that the delivery stream uses to create endpoints in the destination VPC. -
#security_group_ids ⇒ Array<String>
rw
The IDs of the security groups that
::Aws::Kinesis
Data::Aws::Firehose
uses when it creates ENIs in the VPC of the Amazon ES destination. -
#subnet_ids ⇒ Array<String>
rw
The IDs of the subnets that
::Aws::Kinesis
Data::Aws::Firehose
uses to create ENIs in the VPC of the Amazon ES destination. -
#vpc_id ⇒ String
rw
The ID of the Amazon ES destination's VPC.
Instance Method Summary
::Aws::Structure
- Included
| #to_hash | Alias for Structure#to_h. |
Instance Attribute Details
#role_arn ⇒ String
(rw)
The ARN of the ::Aws::IAM
role that the delivery stream uses to create
endpoints in the destination VPC. You can use your existing ::Aws::Kinesis
Data Firehose delivery role or you can specify a new role. In either
case, make sure that the role trusts the ::Aws::Kinesis
Data ::Aws::Firehose
service principal and that it grants the following permissions:
ec2:DescribeVpcs
ec2:DescribeVpcAttribute
ec2:DescribeSubnets
ec2:DescribeSecurityGroups
ec2:DescribeNetworkInterfaces
ec2:CreateNetworkInterface
ec2:CreateNetworkInterfacePermission
ec2:DeleteNetworkInterface
If you revoke these permissions after you create the delivery
stream, ::Aws::Kinesis
Data ::Aws::Firehose
can't scale out by creating more ENIs
when necessary. You might therefore see a degradation in
performance.
# File 'gems/aws-sdk-firehose/lib/aws-sdk-firehose/types.rb', line 4238
class VpcConfigurationDescription < Struct.new( :subnet_ids, :role_arn, :security_group_ids, :vpc_id) SENSITIVE = [] include Aws::Structure end
#security_group_ids ⇒ Array
<String
> (rw)
The IDs of the security groups that ::Aws::Kinesis
Data ::Aws::Firehose
uses when
it creates ENIs in the VPC of the Amazon ES destination. You can use
the same security group that the Amazon ES domain uses or different
ones. If you specify different security groups, ensure that they
allow outbound HTTPS traffic to the Amazon ES domain's security
group. Also ensure that the Amazon ES domain's security group
allows HTTPS traffic from the security groups specified here. If you
use the same security group for both your delivery stream and the
Amazon ES domain, make sure the security group inbound rule allows
HTTPS traffic. For more information about security group rules, see
Security group rules in the Amazon VPC documentation.
# File 'gems/aws-sdk-firehose/lib/aws-sdk-firehose/types.rb', line 4238
class VpcConfigurationDescription < Struct.new( :subnet_ids, :role_arn, :security_group_ids, :vpc_id) SENSITIVE = [] include Aws::Structure end
#subnet_ids ⇒ Array
<String
> (rw)
The IDs of the subnets that ::Aws::Kinesis
Data ::Aws::Firehose
uses to create
ENIs in the VPC of the Amazon ES destination. Make sure that the
routing tables and inbound and outbound rules allow traffic to flow
from the subnets whose IDs are specified here to the subnets that
have the destination Amazon ES endpoints. ::Aws::Kinesis
Data ::Aws::Firehose
creates at least one ENI in each of the subnets that are specified
here. Do not delete or modify these ENIs.
The number of ENIs that ::Aws::Kinesis
Data ::Aws::Firehose
creates in the subnets
specified here scales up and down automatically based on throughput.
To enable ::Aws::Kinesis
Data ::Aws::Firehose
to scale up the number of ENIs to
match throughput, ensure that you have sufficient quota. To help you
calculate the quota you need, assume that ::Aws::Kinesis
Data ::Aws::Firehose
can
create up to three ENIs for this delivery stream for each of the
subnets specified here. For more information about ENI quota, see
Network Interfaces in the Amazon VPC Quotas topic.
# File 'gems/aws-sdk-firehose/lib/aws-sdk-firehose/types.rb', line 4238
class VpcConfigurationDescription < Struct.new( :subnet_ids, :role_arn, :security_group_ids, :vpc_id) SENSITIVE = [] include Aws::Structure end
#vpc_id ⇒ String
(rw)
The ID of the Amazon ES destination's VPC.
# File 'gems/aws-sdk-firehose/lib/aws-sdk-firehose/types.rb', line 4238
class VpcConfigurationDescription < Struct.new( :subnet_ids, :role_arn, :security_group_ids, :vpc_id) SENSITIVE = [] include Aws::Structure end


IOGroup that provides signals and controls for DCGM GPUs.
More...
#include <DCGMIOGroup.hpp>
|
| | DCGMIOGroup () |
| |
| | DCGMIOGroup (const PlatformTopo &platform_topo, DCGMDevicePool &device_pool) |
| |
| | ~DCGMIOGroup () |
| |
| std::set< std::string > | signal_names (void) const override |
| |
| std::set< std::string > | control_names (void) const override |
| |
| bool | is_valid_signal (const std::string &signal_name) const override |
| |
| bool | is_valid_control (const std::string &control_name) const override |
| |
| int | signal_domain_type (const std::string &signal_name) const override |
| |
| int | control_domain_type (const std::string &control_name) const override |
| |
| int | push_signal (const std::string &signal_name, int domain_type, int domain_idx) override |
| |
| int | push_control (const std::string &control_name, int domain_type, int domain_idx) override |
| |
| void | read_batch (void) override |
| |
| void | write_batch (void) override |
| |
| double | sample (int batch_idx) override |
| |
| void | adjust (int batch_idx, double setting) override |
| |
| double | read_signal (const std::string &signal_name, int domain_type, int domain_idx) override |
| |
| void | write_control (const std::string &control_name, int domain_type, int domain_idx, double setting) override |
| |
| void | save_control (void) override |
| |
| void | restore_control (void) override |
| |
| std::function< double(const std::vector< double > &)> | agg_function (const std::string &signal_name) const override |
| |
| std::function< std::string(double)> | format_function (const std::string &signal_name) const override |
| |
| std::string | signal_description (const std::string &signal_name) const override |
| |
| std::string | control_description (const std::string &control_name) const override |
| |
| int | signal_behavior (const std::string &signal_name) const override |
| |
| void | save_control (const std::string &save_path) override |
| |
| void | restore_control (const std::string &save_path) override |
| |
| std::string | name (void) const override |
| |
IOGroup that provides signals and controls for DCGM GPUs.
◆ DCGMIOGroup() [1/2]
| geopm::DCGMIOGroup::DCGMIOGroup |
( |
| ) |
|
◆ DCGMIOGroup() [2/2]
| geopm::DCGMIOGroup::DCGMIOGroup |
( |
const PlatformTopo & |
platform_topo, |
|
|
DCGMDevicePool & |
device_pool |
|
) |
| |
◆ ~DCGMIOGroup()
| geopm::DCGMIOGroup::~DCGMIOGroup |
( |
void |
| ) |
|
◆ adjust()
| void geopm::DCGMIOGroup::adjust |
( |
int |
batch_idx, |
|
|
double |
setting |
|
) |
| |
|
override |
◆ agg_function()
| std::function< double(const std::vector< double > &)> geopm::DCGMIOGroup::agg_function |
( |
const std::string & |
signal_name | ) |
const |
|
override |
◆ control_description()
| std::string geopm::DCGMIOGroup::control_description |
( |
const std::string & |
control_name | ) |
const |
|
override |
◆ control_domain_type()
| int geopm::DCGMIOGroup::control_domain_type |
( |
const std::string & |
control_name | ) |
const |
|
override |
◆ control_names()
| std::set< std::string > geopm::DCGMIOGroup::control_names |
( |
void |
| ) |
const |
|
override |
◆ format_function()
| std::function< std::string(double)> geopm::DCGMIOGroup::format_function |
( |
const std::string & |
signal_name | ) |
const |
|
override |
◆ is_valid_control()
| bool geopm::DCGMIOGroup::is_valid_control |
( |
const std::string & |
control_name | ) |
const |
|
override |
◆ is_valid_signal()
| bool geopm::DCGMIOGroup::is_valid_signal |
( |
const std::string & |
signal_name | ) |
const |
|
override |
◆ make_plugin()
| std::unique_ptr< IOGroup > geopm::DCGMIOGroup::make_plugin |
( |
void |
| ) |
|
|
static |
◆ name()
| std::string geopm::DCGMIOGroup::name |
( |
void |
| ) |
const |
|
override |
◆ plugin_name()
| std::string geopm::DCGMIOGroup::plugin_name |
( |
void |
| ) |
|
|
static |
◆ push_control()
| int geopm::DCGMIOGroup::push_control |
( |
const std::string & |
control_name, |
|
|
int |
domain_type, |
|
|
int |
domain_idx |
|
) |
| |
|
override |
◆ push_signal()
| int geopm::DCGMIOGroup::push_signal |
( |
const std::string & |
signal_name, |
|
|
int |
domain_type, |
|
|
int |
domain_idx |
|
) |
| |
|
override |
◆ read_batch()
| void geopm::DCGMIOGroup::read_batch |
( |
void |
| ) |
|
|
override |
◆ read_signal()
| double geopm::DCGMIOGroup::read_signal |
( |
const std::string & |
signal_name, |
|
|
int |
domain_type, |
|
|
int |
domain_idx |
|
) |
| |
|
override |
◆ restore_control() [1/2]
| void geopm::DCGMIOGroup::restore_control |
( |
const std::string & |
save_path | ) |
|
|
override |
◆ restore_control() [2/2]
| void geopm::DCGMIOGroup::restore_control |
( |
void |
| ) |
|
|
override |
◆ sample()
| double geopm::DCGMIOGroup::sample |
( |
int |
batch_idx | ) |
|
|
override |
◆ save_control() [1/2]
| void geopm::DCGMIOGroup::save_control |
( |
const std::string & |
save_path | ) |
|
|
override |
◆ save_control() [2/2]
| void geopm::DCGMIOGroup::save_control |
( |
void |
| ) |
|
|
override |
◆ signal_behavior()
| int geopm::DCGMIOGroup::signal_behavior |
( |
const std::string & |
signal_name | ) |
const |
|
override |
◆ signal_description()
| std::string geopm::DCGMIOGroup::signal_description |
( |
const std::string & |
signal_name | ) |
const |
|
override |
◆ signal_domain_type()
| int geopm::DCGMIOGroup::signal_domain_type |
( |
const std::string & |
signal_name | ) |
const |
|
override |
◆ signal_names()
| std::set< std::string > geopm::DCGMIOGroup::signal_names |
( |
void |
| ) |
const |
|
override |
◆ write_batch()
| void geopm::DCGMIOGroup::write_batch |
( |
void |
| ) |
|
|
override |
◆ write_control()
| void geopm::DCGMIOGroup::write_control |
( |
const std::string & |
control_name, |
|
|
int |
domain_type, |
|
|
int |
domain_idx, |
|
|
double |
setting |
|
) |
| |
|
override |
The documentation for this class was generated from the following files:


How to make this website. first install gothub on your computer. then download sublime text 3. later i will tell you more. back


Stations
Station Name
Station Type
Station Government
Allegiance
Economy
State
Unable to find any stations!
{{station.name}}
{{station.type}}
{{station.government}}
{{station.allegiance}}
{{station.economy}}
{{station.state}}
{{pagination.firstItem + 1}} - {{pagination.lastItem + 1}} of {{totalRecords}} stations


OSSSpeech
public class OSSSpeech : NSObject
extension OSSSpeech: SFSpeechRecognitionTaskDelegate, SFSpeechRecognizerDelegate
Speech is the primary interface. To use, set the voice and then call .speak(string: "your string")
-
Delegate allows for the recieving of spoken events.
Declaration
Swift
public weak var delegate: OSSSpeechDelegate?
-
An object that allows overriding the default AVVoice options.
Declaration
Swift
public var voice: OSSVoice?
-
Speech recognition variable to determine if recognition should use on device capabilities if available
Not all devices support on device speech recognition and only devices operating with iOS 13 or higher support it.
On device recognition offers many benefits such as working without network connectivity, no data costs and longer recording-to-transcription.
On device recognition comes at a cost of accurate transcription though; speech recognition is less accurate with on device recognition.
Declaration
Swift
public var shouldUseOnDeviceRecognition: Bool
-
The task type by default is undefined. Changing the task type will change how speech recognition performs.
Declaration
Swift
public var recognitionTaskType: OSSSpeechRecognitionTaskType
-
The object used to enable translation of strings to synthsized voice.
Declaration
Swift
public var utterance: OSSUtterance?
-
Audio Session can be overriden should you choose to.
Declaration
Swift
public var audioSession: AVAudioSession { get set }
-
This property handles permission authorization. This property is intentionally named vaguely to prevent accidental overriding.
Declaration
Swift
public var srp: SFSpeechRecognizer.Type
-
A singleton object to ensure conformity accross the application it is used in.
Declaration
Swift
public class var shared: OSSSpeech { get }
-
Pass in a string to speak. This will set the speechString on the utterance.
Declaration
Swift
public func speakText(_ text: String? = nil)
Parameters
text
An String object.
-
Pass in an attributed string to speak. This will set the attributed string on the utterance.
Declaration
Swift
public func speakAttributedText(attributedText: NSAttributedString)
Parameters
attributedText
An NSAttributedString object.
-
Record and recognise speech
This method will check to see if user is authorised to record. If they are, the recording will proceed.
Upon checking the authorisation and being registered successful, a check to determine if a recording session is active will be made and any active session will be cancelled.
Declaration
Swift
public func recordVoice(requestMicPermission requested: Bool = true)
-
End recording of speech session if one exists.
Declaration
Swift
public func endVoiceRecording()
-
Undocumented
Declaration
Swift
func engineSetup(_ engine: AVAudioEngine) -> Bool
-
Docs available by Google searching for SFSpeechRecognitionTaskDelegate
Declaration
Swift
public func speechRecognitionTask(_ task: SFSpeechRecognitionTask, didFinishSuccessfully successfully: Bool)
-
Docs available by Google searching for SFSpeechRecognitionTaskDelegate
Declaration
Swift
public func speechRecognitionTask(_ task: SFSpeechRecognitionTask, didHypothesizeTranscription transcription: SFTranscription)
-
Docs available by Google searching for SFSpeechRecognitionTaskDelegate
Declaration
Swift
public func speechRecognitionTask(_ task: SFSpeechRecognitionTask, didFinishRecognition recognitionResult: SFSpeechRecognitionResult)
-
Undocumented
Declaration
Swift
public func speechRecognitionDidDetectSpeech(_ task: SFSpeechRecognitionTask)
-
Undocumented
Declaration
Swift
public func speechRecognitionTaskFinishedReadingAudio(_ task: SFSpeechRecognitionTask)
-
Docs available by Google searching for SFSpeechRecognizerDelegate
Declaration
Swift
public func speechRecognizer(_ speechRecognizer: SFSpeechRecognizer, availabilityDidChange available: Bool)


A SIMPLE TWIST OF FATE A film review by Ben Hoffman Copyright 1994 Ben Hoffman
If you read George Eliot's SILAS MARNER when you were in school, you will recognize the story has been used as the basis for this film written by Steve Martin and updated to 1984.
Michael McCann (Martin) is a cabinet maker who leads a quiet life as a recluse. When one day a woman with a small child is near his secluded home, the woman falls and freezes to death. When the cabinet maker goes out to investigate a noise he heard, the young girl toddles into his home through the open door ... and McCann's life changes forever.
McCann is everything a father should be to the baby, who he names "Mathilda," unaware that John Newland (Gabriel Byrne), a local politician, is the biological father. However, Newland, who is wealthy, intends one day to get her back. When that happens, the court must decide if the biological father, who can afford to bring up his daughter in style and send her to an Ivy League school when she grows up, should get custody or should the poor man who raised her.
The cast includes Stephen Baldwin as Newland's thieving brother, Laura Linney as John Newland's wife and five young girls who are Mathilda at various ages. Alana Austin is Mathilda at age 10 and a great little actress she is!
Directed by Gillies MacKinnon.
2.5 bytes 4 Bytes = Absolutely must see. 3 Bytes = Too good to be missed. 2 Bytes = So so. 1 Byte = Save your money.
Ben Hoffman
.
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


---
layout: post
title: Move Completed
post_id: 297
categories:
- metablog
date: 2004-03-02 14:55:00.000000000 -07:00
author: Jamis
permalink: 2004/3/2/move-completed.html
---
I just finished moving all of my old blog articles (heh, all 12 or so of them) from my old blog to this one. I guess that makes it official. There’s still quite a bit about this new arrangement that I’d like to tweak when I get the time… Who knows? Perhaps I’ll be really motivated and get it all done by my next blog entry. :)
The things I’d still like to do with this blog are:
- Find a better template/style. I’ve tried three so far, and the one I’ve got right now is okay, but there are still several things about it that bug me. Some of the colors, for instance, are too washed out.
- I don’t like how it shows entries based on their age. I’d rather it show just the last n_ entries, instead of all entries at most _n days old. I need to see if that’s fixable.
- I don’t like how a blog’s list of “related links” must be hardcoded into the template. If I ever change templates, I have to make sure to copy my favorite links to the new template. Yuck!
- I would prefer that each article showed which category (or categories) it belonged to.
On the other hand, there are several things about it I like:
- Multiple categories per article. I’m not sure if I’ll use that feature or not, but it’s kind of nice.
-
CSS-based themes. I need to learn more about CSS to really take advantage of this, and it only works with “modern” (read “no more than 2 years old”) browsers, but it is quite powerful.
- The calendar “component” is nice.
- Plugins! It really like that I can choose almost any text format system that I like (although it would be nice if there were an RDoc formatting option… guess I’ll add that to my “to do” list).
Other things I’m still not sure I like or not:
- Blogs are published as static pages, instead of dynamically generated on the fly. There are pros and cons to both approaches, so I guess I’m riding the fence right now.
- Written in Perl… yah, that means it’ll work just about anywhere, but I’m so partial to Ruby right now…


TRACEROUTE
Section: Traceroute For Linux (8)Updated: 11 October 2006
Index Return to Main Contents
NAME
traceroute - print the route packets trace to network hostSYNOPSIS
traceroute [-46dFITUnreAV] [-f first_ttl] [-g gate,...][-i device] [-m max_ttl] [-p port] [-s src_addr]
[-q nqueries] [-N squeries] [-t tos]
[-l flow_label] [-w waittime] [-z sendwait]
[-UL] [-P proto] [--sport=port] [-M method] [-O mod_options]
[--mtu] [--back]
host [packet_len]
traceroute6 [options]
DESCRIPTION
traceroute tracks the route packets taken from an IP network on their way to a given host. It utilizes the IP protocol's time to live (TTL) field and attempts to elicit an ICMP TIME_EXCEEDED response from each gateway along the path to the host. traceroute6 is equivalent to traceroute -6The only required parameter is the name or IP address of the destination host . The optional packet_len`gth is the total size of the probing packet (default 60 bytes for IPv4 and 80 for IPv6). The specified size can be ignored in some situations or increased up to a minimal value.
This program attempts to trace the route an IP packet would follow to some internet host by launching probe packets with a small ttl (time to live) then listening for an ICMP "time exceeded" reply from a gateway. We start our probes with a ttl of one and increase by one until we get an ICMP "port unreachable" (or TCP reset), which means we got to the "host", or hit a max (which defaults to 30 hops). Three probes (by default) are sent at each ttl setting and a line is printed showing the ttl, address of the gateway and round trip time of each probe. The address can be followed by additional information when requested. If the probe answers come from different gateways, the address of each responding system will be printed. If there is no response within a 5.0 seconds (default), an "*" (asterisk) is printed for that probe.
After the trip time, some additional annotation can be printed: !H, !N, or !P (host, network or protocol unreachable), !S (source route failed), !F (fragmentation needed), !X (communication administratively prohibited), !V (host precedence violation), !C (precedence cutoff in effect), or !<num> (ICMP unreachable code <num>). If almost all the probes result in some kind of unreachable, traceroute will give up and exit.
We don't want the destination host to process the UDP probe packets, so the destination port is set to an unlikely value (you can change it with the -p flag). There is no such a problem for ICMP or TCP tracerouting (for TCP we use half-open technique, which prevents our probes to be seen by applications on the destination host).
In the modern network environment the traditional traceroute methods can not be always applicable, because of widespread use of firewalls. Such firewalls filter the "unlikely" UDP ports, or even ICMP echoes. To solve this, some additional tracerouting methods are implemented (including tcp), see LIST OF AVAILABLE METHODS below. Such methods try to use particular protocol and source/destination port, in order to bypass firewalls (to be seen by firewalls just as a start of allowed type of a network session).
OPTIONS
- --help
- Print help info and exit.
- -4, -6
- Explicitly force IPv4 or IPv6 traceouting. By default, the program will try to resolve the name given, and choose the appropriate protocol automatically. If resolving a host name returns both IPv4 and IPv6 addresses, traceroute will use IPv4.
- -I
- Use ICMP ECHO for probes
- -T
- Use TCP SYN for probes
- -d
- Enable socket level debugging (when the Linux kernel supports it)
- -F
-
Do not fragment probe packets. (For IPv4 it also sets DF bit, which tells
intermediate routers not to fragment remotely as well).
Varying the size of the probing packet by the packet_len command line parameter, you can manually obtain information about the MTU of individual network hops. The --mtu option (see below) tries to do this automatically.
Note, that non-fragmented features (like -F or --mtu) work properly since the Linux kernel 2.6.22 only. Before that version, IPv6 was always fragmented, IPv4 could use the once the discovered final mtu only (from the route cache), which can be less than the actual mtu of a device. - -f first_ttl
- Specifies with what TTL to start. Defaults to 1.
- -g gateway
- Tells traceroute to add an IP source routing option to the outgoing packet that tells the network to route the packet through the specified gateway (most routers have disabled source routing for security reasons). In general, several gateway's is allowed (comma separated). For IPv6, the form of num,addr,addr... is allowed, where num is a route header type (default is type 2). Note the type 0 route header is now deprecated (rfc5095).
- -i interface
- Specifies the interface through which traceroute should send packets. By default, the interface is selected according to the routing table.
- -m max_ttl
- Specifies the maximum number of hops (max time-to-live value) traceroute will probe. The default is 30.
- -N squeries
-
Specifies the number of probe packets sent out simultaneously.
Sending several probes concurrently can speed up
traceroute
considerably. The default value is 16.
Note that some routers and hosts can use ICMP rate throttling. In such a situation specifying too large number can lead to loss of some responses. - -n
- Do not try to map IP addresses to host names when displaying them.
- -p port
-
For UDP tracing, specifies the destination port base
traceroute
will use (the destination port number will be incremented by each probe).
For ICMP tracing, specifies the initial icmp sequence value (incremented by each probe too).
For TCP specifies just the (constant) destination port to connect. - -t tos
-
For IPv4, set the Type of Service (TOS) and Precedence value. Useful values
are 16 (low delay) and 8 (high throughput). Note that in order to use
some TOS precendence values, you have to be super user.
For IPv6, set the Traffic Control value. - -w waittime
- Set the time (in seconds) to wait for a response to a probe (default 5.0 sec).
- -q nqueries
- Sets the number of probe packets per hop. The default is 3.
- -r
- Bypass the normal routing tables and send directly to a host on an attached network. If the host is not on a directly-attached network, an error is returned. This option can be used to ping a local host through an interface that has no route through it.
- -s source_addr
- Chooses an alternative source address. Note that you must select the address of one of the interfaces. By default, the address of the outgoing interface is used.
- -z sendwait
- Minimal time interval between probes (default 0). If the value is more than 10, then it specifies a number in milliseconds, else it is a number of seconds (float point values allowed too). Useful when some routers use rate-limit for icmp messages.
- -e
- Show ICMP extensions (rfc4884). The general form is CLASS/TYPE: followed by a hexadecimal dump. The MPLS (rfc4950) is shown parsed, in a form: MPLS:L=label,E=exp_use,S=stack_bottom,T=TTL (more objects separated by / ).
- -A
- Perform AS path lookups in routing registries and print results directly after the corresponding addresses.
- -V
-
Print the version and exit.
There is a couple of additional options, intended for an advanced usage (another trace methods etc.): - --sport=port
- Chooses the source port to use. Implies -N 1. Normally source ports (if applicable) are chosen by the system.
- -M method
-
Use specified method for traceroute operations. Default traditional udp method
has name
default,
icmp
(-I)
and tcp
(-T)
have names
icmp
and
tcp
respectively.
Method-specific options can be passed by -O . Most methods have their simple shortcuts, (-I means -M icmp, etc). - -O option
- Specifies some method-specific option. Several options are separated by comma (or use several -O on cmdline). Each method may have its own specific options, or many not have them at all. To print information about available options, use -O help.
- -U
- Use UDP to particular destination port for tracerouting (instead of increasing the port per each probe). Default port is 53 (dns).
- -UL
- Use UDPLITE for tracerouting (default port is 53).
- -P protocol
- Use raw packet of specified protocol for tracerouting. Default protocol is 253 (rfc3692).
- --mtu
-
Discover MTU along the path being traced. Implies
-F -N 1.
New
mtu
is printed once in a form of
F=NUM
at the first probe of a hop which requires such
mtu
to be reached. (Actually, the correspond "frag needed" icmp message
normally is sent by the previous hop).
Note, that some routers might cache once the seen information on a fragmentation. Thus you can receive the final mtu from a closer hop. Try to specify an unusual tos by -t , this can help for one attempt (then it can be cached there as well).
See -F option for more info. - --back
- Print the number of backward hops when it seems different with the forward direction. This number is guessed in assumption that remote hops send reply packets with initial ttl set to either 64, or 128 or 255 (which seems a common practice). It is printed as a negate value in a form of '-NUM' .
LIST OF AVAILABLE METHODS
In general, a particular traceroute method may have to be chosen by -M name, but most of the methods have their simple cmdline switches (you can see them after the method name, if present).default
The traditional, ancient method of tracerouting. Used by default. Probe packets are udp datagrams with so-called "unlikely" destination ports. The "unlikely" port of the first probe is 33434, then for each next probe it is incremented by one. Since the ports are expected to be unused, the destination host normally returns "icmp unreach port" as a final response. (Nobody knows what happens when some application listens for such ports, though). This method is allowed for unprivileged users.icmp -I
Most usual method for now, which uses icmp echo packets for probes.If you can ping(8) the destination host, icmp tracerouting is applicable as well.
tcp -T
Well-known modern method, intended to bypass firewalls.Uses the constant destination port (default is 80, http). If some filters are present in the network path, then most probably any "unlikely" udp ports (as for default method) or even icmp echoes (as for icmp) are filtered, and whole tracerouting will just stop at such a firewall. To bypass a network filter, we have to use only allowed protocol/port combinations. If we trace for some, say, mailserver, then more likely -T -p 25 can reach it, even when -I can not. This method uses well-known "half-open technique", which prevents applications on the destination host from seeing our probes at all. Normally, a tcp syn is sent. For non-listened ports we receive tcp reset, and all is done. For active listening ports we receive tcp syn+ack, but answer by tcp reset (instead of expected tcp ack), this way the remote tcp session is dropped even without the application ever taking notice. There is a couple of options for tcp method:
- syn,ack,fin,rst,psh,urg,ece,cwr
- Sets specified tcp flags for probe packet, in any combination.
- flags=num
- Sets the flags field in the tcp header exactly to num.
- ecn
- Send syn packet with tcp flags ECE and CWR (for Explicit Congestion Notification, rfc3168)
- sack,timestamps,window_scaling
- Use the corresponding tcp header option in the outgoing probe packet.
- sysctl
- Use current sysctl (/proc/sys/net/*) setting for the tcp header options above and ecn. Always set by default, if nothing else specified.
- mss=num
- Use value of num for maxseg tcp header option (when syn). Default options is syn,sysctl.
tcpconn
An initial implementation of tcp method, simple using connect(2) call, which does full tcp session opening. Not recommended for normal use, because a destination application is always affected (and can be confused).udp -U
Use udp datagram with constant destination port (default 53, dns).Intended to bypass firewall as well. Note, that unlike in tcp method, the correspond application on the destination host always receive our probes (with random data), and most can easily be confused by them. Most cases it will not respond to our packets though, so we will never see the final hop in the trace. (Fortunately, it seems that at least dns servers replies with something angry). This method is allowed for unprivileged users.
udplite -UL
Use udplite datagram for probes (with constant destination port, default 53). This method is allowed for unprivileged users.Options:
- coverage=num
- Set udplite send coverage to num.
raw -P proto
Send raw packet of protocol proto.No protocol-specific headers are used, just IP header only.
Implies -N 1.
Options:
- protocol=proto
- Use IP protocol proto (default 253).
NOTES
To speed up work, normally several probes are sent simultaneously. On the other hand, it creates a "storm of packages", especially in the reply direction. Routers can throttle the rate of icmp responses, and some of replies can be lost. To avoid this, decrease the number of simultaneous probes, or even set it to 1 (like in initial traceroute implementation), i.e. -N 1
The final (target) host can drop some of the simultaneous probes, and might even answer only the latest ones. It can lead to extra "looks like expired" hops near the final hop. We use a smart algorithm to auto-detect such a situation, but if it cannot help in your case, just use -N 1 too.
For even greater stability you can slow down the program's work by -z option, for example use -z 0.5 for half-second pause between probes.
If some hops report nothing for every method, the last chance to obtain something is to use ping -R command (IPv4, and for nearest 8 hops only).
SEE ALSO
ping(8), ping6(8), tcpdump(8), netstat(8)
Index
This document was created by man2html, using the manual pages.
Time: 05:34:30 GMT, December 24, 2015


Epicodus offers full-time courses in languages such as C#, PHP, Javascript, .NET, Ruby, Rails, React, and more. Every track starts with Introduction to Programming, and includes an advanced JavaScript course, as well as two language-specific courses — four five-week sessions in total. In addition, students complete two weeks of job and internship prep and finish their studies with a five-week internship.
To help you better determine which full-time course, or "track," might be best for you, Epicodus would like to ask you the following questions:
Suggested track: . However, learning any language is beneficial, and a doorway to other languages.


A name for the topic is required.
Number of Partitions are invalid.
Replication Factor is invalid.
ZooKeeper Cluster in invalid
Add Topic


Previous: The Line Tag
Smudge: The BiLine Tag
The BiLine tag is the third way to set up child control variables (the remaining one is
< CheckBox>).
In this case, the only additional
tag available,which applies only to the BiLine is < Origin> Xorigin Yorigin < /Origin>, which defines the BiLine origin relative to its container. There is no id for a BiLine.
A BiLine provides two text boxes, the first labelled "Variable" and the second "Value". The overall size
is 150 wide and 80 deep. When entries are made into both boxes, then saving from chintz writes
Variable text:
Value text
to the child control file, where "Variable text" represents what was typed into the Variable text box, and
"Value text" that typed in the value box. This provides the user of chintz with a way of defining new
variables
that are not otherwise catered for in the chintz UI.
Example:-
< Page>
< Title> Setup < /Title>
    < Frame,id=Firstframe>
      < Style> NoFrame < /Style>
      < Geometry> 10 10 100 200 < /Geometry>
      < Enabled> false < /Enabled>
      < Title> Mesh < /Title>
      < BiLine>
        < Origin> 80 10 < /Origin>
      < /BiLine>
    < /Frame>
< /Page>
a page, labelled "Setup", containing a frame labelled "Mesh", which in turn contains a BiLine,
starting 80 pixels in X and 10 in Y into the Frame.
Next: The CheckBox Tag
Back to Smudge Contents
Last modified: Fri Jan 25 12:56:53 GMT 2002


Tic Tac Toe
Player 1 name:
Player 2 name:
Ok
Your name:
Ok
Play Tic Tac Toe
Play against AI
Click above to start


Become a Web Developer for Free?
I have been slacking a bit for the last couple of days. Watching World Cup apparently is not good for my free time! I wasn’t feeling too good physically-wise and it wasn’t helping either. As with everything in life though, a coin have two sides. For this past month I tried to do everything I could to learn and be that several steps closer to hopefully getting my first web developer job and finally I had a while to gain different perspective.
I’ve been thinking lot and figured out that I shouldn’t really be speeding through Tealeaf courses as fast as possible. I should rather focus on making more effort to really grasp the material I’m learning and allow it to really sink in. And the best way to do it is again, through practice. I could probably just make some exercises on my own, but I figured I may as well check what the internet has to offer first. Needless to say, I was hoping there were some free (or really cheap) options available. That’s how I found out (or rather re-discovered, because I heard about it before) The Odin Project.
The Odin Project
So what is it? Well, in essence The Odin Project (or TOP) is not that much different to Tealeaf Academy. They provide you with a curriculum, which includes a broad range of subjects, form learning the basics about web development, through Ruby and Rails, HTML and CSS and Javascript and it’s jQuery library. There is also one more section related to getting your first job as a web developer. Sounds awesome, right? Yeah, I think so too. Especially because TOP is open-source, with constantly evolving curricullum and a nice, helpful community (at least from what I’ve heard). Just yesterday I decided that I should see what are they about.
I didn’t have a chance to look closer at it since, but I will have the next few days for doing so.  I should give my first impression about it around the next weekend I guess. I’m really excited for it!
Make it With Code
During my internet research for alternative learning sources, I also came across Make it With Code. Their credo is something I especially came to like: “Learn to Code by Making Things”, which sounds like exactly what I was looking for. The idea is, you get a lesson a week, for 10 weeks (lessons are text-format, combining a balance of challenges with instruction). With each lesson you build one working thing. Sounds good to me!
There is one caveat: it’s not free. The course costs $99, which isn’t all that much considering what I’m paying for Tealeaf courses. I will likely be trying it out in the future. I couldn’t find too many reviews on Make it With Code, so if you decide to try it before I do, please let me know if it’s worth it.
And Just a Quick Tealeaf Progress Check
I am currently about to wrap up the 2nd week of the Rails course. It’s not going too smoothy so far. I understand most of the concepts (mostly thanks too the understanding of Ruby, which I gained through the 1st course) but I don’t really feel too comfortable in Rails just yet. I think after finishing this course I will try to go through the materials once more and see how much of it I was able to truly absorb.
I have to say though, that I really like what we’re building. It’s a Reddit-alike app which has quite a few cool features about it. And we’re learning some front-end along, with the use of Bootstrap too. I could really see how useful this all could be in the future. I guess I should write a longer post (with code examples) of what I’ve learned sometime soon.
Meanwhile, I also noticed some traffic here, on Web Developer from Scratch, which is likely caused by a cool domain name I was able to pick for it (score!) and google already indexing my little blog. Thus I encourage everyone who visits to leave comments if you have questions or words of encouragement (this really helps!). Or if you are in a similar situation to mine and want to become a web developer starting from nothing. Get in touch!


These investment firms have been using Vision to keep their portfolio management systems on the cutting-edge -- a significant accomplishment given the unprecedented market activity and rapid technological change of recent years.
Technological advances have been dramatic over the past decade. Operating systems have been revamped, and new ones introduced, to take advantage of ever- more-powerful hardware. The internet, merely a curiosity a few years ago, has become central to global -- and corporate -- connectivity. Easy-to-use web browsers have made the internet and corporate intranets accessible to everyone.
Vision has advanced, too, staying ahead of and exploiting all of these technological innovations. Now Vision offers an extensive set of intranet- based portfolio applications and easy startup procedures. As a result, more investment firms can use Vision to improve their portfolio management and analysis systems, and more investment professionals within these firms can use Vision to make better business decisions.
Vision's power lies in its ability to bring together internal and external information, analyze it, present the results in clear, easy-to-understand applications, and deliver those applications directly to the investment professionals who need them.
Vision seamlessly integrates any number of internal and external data sources (domestic or international), including:
Vision comes with an extensive set of sophisticated, yet easy-to-use, investment management and analysis applications designed to meet the needs of such functional areas as:
Vision's applications are delivered directly to your users' desktops through their familiar intranet browser. What's more, you can tailor the applications, and add new ones, as your firm's business requirements dictate.
Vision provides an infinitely flexible, extendible environment. As a result, your Vision portfolio management and analysis system can be customized easily to meet the needs of your firm and your investment professionals.
At the beginning, you may decide to implement Vision quickly and use the standard set of applications that come with the product. Over time, you may decide to modify the applications, add new applications, or add new data sources. Eventually, you may decide to exploit Vision's full range of capabilities as both a powerful database management engine and an object- oriented programming language.
Vision allows you to design a system that can meet your needs today and adapt to your changing needs tomorrow.
Weeks 1 through 4. The goal in the first four weeks is to define and load your internal data so that portfolio managers can view their own portfolios via their desktop browsers.
Weeks 5 through 9. The goal during the second four weeks is to link your system to external data feeds, modify Vision's standard applications to meet your needs, and develop custom reports. At the end of this period, you will have a complete, functional system with all the data feeds and applications you require for rollout.
Weeks 10 through 14. The goal during this period is to put the data upload process and other necessary operational procedures into routine production, enabling you to smoothly manage the day-to-day administration of your Vision portfolio management and analysis system.
To learn more about Vision and Insyte, feel free to browse through our web site here at www.insytenet.com.
To arrange for an over-the-internet demonstration of Vision, or to obtain additional information, e-mail us at<EMAIL_ADDRESS>| Copyright © 1999 Innovative Systems Techniques, Inc. | Updated May 19, 1999 |


Exits:
Exits will need to be added to both rooms to be two way,
and share the same key for any doors, all properties must match too.
Coordinates shown are (area id, x, y, z)
Allow invalid exits;
use this when you want to exit to a different area or location.


When trying to use Voice input, you may get the following error message: "You must have Google Voice Typing enabled on your device". Following the steps below may solve this problem.
1) In your device's Settings app, locate the "Manage on-screen keyboards" section. Ensure that "Google voice typing" is enabled:
2) In your device's Settings app, locate the "Default digital assistant app" section. Ensure that "Google" is selected:
3) If your device has Bixby, Alexa, or any other third-party digital assistant installed, locate the app's "Set as default" or "Open by default" screen. Once you've located it, tap the "Clear defaults" button:
4) Locate the "App info" screen for the Google app. Ensure that the Google app is enabled:


|
lem-in
|
Go to the source code of this file.
Data Structures | |
| struct | s_link |
| A link in in a doubly linked list of integers. More... | |
| struct | s_list |
| A doubly linked list of integers. More... | |
Typedefs | |
| typedef struct s_link | t_link |
| typedef struct s_list | t_list |
Functions | |
| t_list * | list_new (void) |
| Creates a new empty list. More... | |
| void | list_add_first (t_list *alst, int val) |
| Adds an entry at the front of the list. More... | |
| void | list_add_last (t_list *alst, int val) |
| Adds an entry at the back of the list. More... | |
| int | list_pop_first (t_list *alst) |
| Returns the first value in the list and removes it from the list. More... | |
| int | list_pop_last (t_list *alst) |
| Returns the last value in the list and removes it from the list. More... | |
| size_t | list_size (const t_list *alst) |
| Returns the current number of entries in the list. More... | |
| void | list_delete (t_list *list) |
| Frees all memory taken up by the list. More... | |
| int | list_peek_first (const t_list *list) |
| Returns the first value in the list without removing it. More... | |
| int | list_peek_last (const t_list *list) |
| Returns the last value in the list without removing it. More... | |
| void | list_remove (t_list *list, int val) |
| Removes the first occurence of value from the list. More... | |
| void | list_print (const t_list *list) |
| Prints values contained in the list. More... | |
| void list_add_first | ( | t_list * | alst, |
| int | val | ||
| ) |
Adds an entry at the front of the list.
| val | The value to add |
Definition at line 16 of file list_add_first.c.
| void list_add_last | ( | t_list * | alst, |
| int | val | ||
| ) |
Adds an entry at the back of the list.
| val | The value to add |
Definition at line 16 of file list_add_last.c.
| void list_delete | ( | t_list * | list | ) |
Frees all memory taken up by the list.
Definition at line 16 of file list_delete.c.
| t_list* list_new | ( | void | ) |
Creates a new empty list.
Definition at line 16 of file list_new.c.
| int list_peek_first | ( | const t_list * | list | ) |
Returns the first value in the list without removing it.
Definition at line 16 of file list_peek_first.c.
| int list_peek_last | ( | const t_list * | list | ) |
Returns the last value in the list without removing it.
Definition at line 16 of file list_peek_last.c.
| int list_pop_first | ( | t_list * | alst | ) |
Returns the first value in the list and removes it from the list.
Definition at line 16 of file list_pop_first.c.
| int list_pop_last | ( | t_list * | alst | ) |
Returns the last value in the list and removes it from the list.
Definition at line 16 of file list_pop_last.c.
| void list_print | ( | const t_list * | list | ) |
Prints values contained in the list.
Definition at line 16 of file list_print.c.
| void list_remove | ( | t_list * | list, |
| int | val | ||
| ) |
Removes the first occurence of value from the list.
| val | The value to remove |
Definition at line 29 of file list_remove.c.
| size_t list_size | ( | const t_list * | alst | ) |
Returns the current number of entries in the list.
Definition at line 16 of file list_size.c.


Random: Pokémon Sword And Shield's Ending Has A Pretty Embarrassing Mistake
How soon before Nintendo fixes it?
by Damien McFerranWe're firmly of the opinion that Pokémon Sword And Shield – while not perfect – is a fine video game that has clearly had a lot of blood, sweat and tears invested in it. However, it would seem that in the effort to get the title to market, developer Game Freak slipped up a little when it came to creating the ending.
During the end credits for the game, a mouse cursor is clearly seen floating around the screen. The video is shown below, and it goes without saying, if you'd rather not have a portion of the ending ruined for you before you see it yourself, then navigate away from this page as quick as you can – this is spoiler territory.
Still here? Good, then watch the video here to see what we mean.
Now, on first inspection, you may be tempted to assume this is some kind of elaborate joke, but other videos have cropped up online which show the same mistake.
We'd imagine this problem will be patched out of the game pretty quickly, but it made us chuckle, at least.
[via gonintendo.com]


Vikramashila (Devanagari:विक्रमशिला, IAST: Vikramaśilā) was one of the two most important centres of learning in India during the Pala Empire, along with Nalanda. Its location is now the site of Antichak village, Bhagalpur district in Bihar.Vikramashila was established by the Pala emperor Dharmapala (783 to 820) in response to a supposed decline in the quality of scholarship at Nalanda. Atiśa, the renowned pandita, is sometimes listed as a notable abbot. It was allegedly destroyed by the forces of Muhammad bin Bakhtiyar Khalji around 1193.
History
A number of monasteries grew up during the Pāla period in ancient Bengal and Magadha. According to Tibetan sources, five great Mahaviharas stood out: Vikramashila, the premier university of the era; Nalanda, past its prime but still illustrious, Somapura, Odantapura, and Jagaddala.[2] The five monasteries formed a network; "all of them were under state supervision" and there existed "a system of co-ordination among them. It seems from the evidence that the different seats of Buddhist learning that functioned in eastern India under the Pāla were regarded together as forming a network, an interlinked group of institutions," and it was common for great scholars to move easily from position to position among them.
Vikramashila was founded by Pāla king Dharmapala in the late 8th or early 9th century. It prospered for about four centuries before it was destroyed by Bakhtiyar Khilji along with the other major centres of Buddhism in India around 1193.
Vikramashila is known to us mainly through Tibetan sources, especially the writings of Tāranātha, the Tibetan monk historian of the 16th–17th centuries.
Vikramashila was one of the largest Buddhist universities, with more than one hundred teachers and about one thousand students. It produced eminent scholars who were often invited by foreign countries to spread Buddhist learning, culture and religion. The most distinguished and eminent among all was Atisha Dipankara, a founder of the Sarma traditions of Tibetan Buddhism. Subjects like philosophy, grammar, metaphysics, Indian logic etc. were taught here, but the most important branch of learning was Buddhist tantra.
Layout and Ecavation
The remains of the ancient university have been partially excavated in Bhagalpur district, Bihar state, India, and the process is still underway. Meticulous excavation at the site was conducted initially by B. P. Sinha of Patna University (1960–69) and subsequently by Archaeological Survey of India (1972–82). It has revealed a huge square monastery with a cruciform stupa in its centre, a library building and cluster of votive stupas.[12] To the north of monastery a number of scattered structures including a Tibetan and a Hindu temple have been found. The entire spread is over an area of more than one hundred acres.
The monastery, or residence for the Buddhist monks, is a huge square structure, each side measuring 330 metres having a series of 208 cells, 52 on each of the four sides opening into a common verandah. A few brick arched underground chambers beneath some of the cells have also been noticed which were probably meant for confined meditation by the monks.
The main stupa built for the purpose of worship is a brick structure laid in mud mortar which stands in the centre of the square monastery. This two-terraced stupa is cruciform on plan and about 15 metres high from the ground level accessible through a flight of steps on the north side. On each of the four cardinal directions there is a protruding chamber with a pillared antechamber and a separate pillared mandapa in front. In the four chambers of the stupa were placed colossal stucco images of seated Buddha of which three were found in situ but the remaining one on north side was possibly replaced by a stone image after the clay image was somehow damaged.
About 32 metres south of the monastery on its south west corner and attached with the main monastery through a narrow corridor is a rectangular structure identified as a library building. It was air-conditioned by cooled water of the adjoining reservoir through a range of vents in the back wall. The system was perhaps meant for preserving delicate manuscripts.
A large number of antiquities of different materials, unearthed from this place in the course of excavation, are displayed in the site museum maintained by the Archaeological Survey of India.
The Stupa
The Stupa is a sacred solid structure raised over the body remains or belongings of Buddha or a distinguished monk; or to commemorate any event associated with them. But some stupas are merely symbolic made for worship by the monks. A votive stupa is a miniature stupa erected by a devotee in gratitude of fulfilment of his desire.
The Vikramashila stupa built for the purpose of worship is a brick structure laid in mud mortar and stands in the centre of the square monastery. This two terraced stupa is cruciform on plan and about 15 metres high from the ground level. The lower terrace is about 2.25 metres high from the ground level and the upper terrace is at a similar height from the lower side. At both terraces there is a circumambulatory path, the lower about 4.5 metres wide and the upper about 3 metres wide.
The main stupa placed over the upper terrace is accessible through a flight of steps on the north side on each of the four cardinal directions. There is a protruding chamber with a pillared antechamber and a separate pillared mandapa in front, placed beyond the circumambulatory passage. In the four chambers of stupa were placed colossal stucco images of seated Buddha of which three were found in situ, but the remaining of the north side was possibly replaced by a stone image after the clay image was somehow damaged. All the stucco images are unfortunately broken above the waist. The images are placed over a brick pedestal having traces of painting in red and black pigments. The walls and floors of the chamber and antechamber were plastered with lime.
The walls of both the terraces are decorated with mouldings and terracotta plaques which testify the high excellence of terracotta art flourishing in the region during Pal period (8th to 12th centuries). The plaques depict many Buddhist deities like Buddha, Avalokiteshvara, Manjusri, Maitreya, Jambala, Marichi, and Tara, scenes related to Buddhism, some social and hunting scenes, and a few Hindu deities like Vishnu, Parvati, Ardhanarisvara and Hanuman. Many human figures, like those of ascetics, yogis, preachers, drummers, warriors, archers, snake charmers, etc., and animal figures like monkeys, elephants, horses, deer, boar, panthers, lions, wolves, and birds, are also depicted.[citation needed]
The architecture of the stupa and the terracotta plaques bear great resemblance to the Somapura Mahavihara, Paharpur (Bangladesh) which, too, was founded by the same king Dharmapala. In plan both are very much alike with the significant difference that Somapura is centred on a central temple rather than a stupa. Vikramashila monastery is also larger and has fort-like projections on its outer wall.
Restoration Work
Vikramashila was neglected for years which contributed to the extensive damage to the monument. The Archeological Survey of India is now planning to develop the excavated site of Vikramashila.
Since 2009, there has been considerable work in maintaining and beautifying the place to attract tourism. There has been inflow of western tourist as well, during their river cruises on the Ganga River.
It has been a long-time demand of local people for revival of this university like Nalanda university. In 2015, prime minister Narendra Modi announced a Rs 500 crore package for it, while state Government had to provide around 500 acres land which was yet to be done. President Pranab Mukherjee visited the excavated ruins of Vikramshila university in 2017. He addressed a public gathering at the university, saying that he would talk to the Prime minister for its revival
Cultural activities
The Vikramashila site is the place for Vikramashila Mahotsav, which is held annually during the month of February.
How to reach there
The nearest big town is Kahalgaon about 13 km, It is approachable through 11 km long motorable road diverting from NH-80 at Anadipur, about 2 km from Kahalgaon.
Lately river cruises from Kolkata to Varanasi have started, which also stop by the Vikramashila ruins
In popular culture
An Indian Railways train recognises this place by running a Train No. 12367/12368 Vikramshila Express that runs from Anand Vihar, Delhi to Bhagalpur, Bihar.(Source)


{{- $photo := relURL (path.Join "images" "team" .key) }} {{ partial "picture" (dict "img" $photo "class" "photo" ) }}


Atlas
{{ self.title() }}
{% block content -%} {%- endblock content %}
{% block navigation %}
Instances
Available Instances
Instance summary
Lookup instances
Instances by bundle
User lists
All users
Site Owners
Content Editors
By Path
CSE
Site Statistics NEW
{% endblock %}


{ Welcome to my portfolio! I'm a full stack web developer with a goal to one day create games with sophistacated A.I. "Artificial Intelligence" }
Tribute
Project 2
Project 3
Project 4
Contact:
Message


Show/Hide Debug Widgets
Clear events
Crop events
Load events via API
Generate 20 new events
(Limited to view)
Width of a millisecond
Height of an event
Load events from API on scroll
Show debug markers on scroll
Filter events by user ID
Refresh debug info
Debug info


gdaltransform
Transforms coordinates.
Synopsis
gdaltransform [--help-general]
[-i] [-s_srs srs_def] [-t_srs srs_def] [-to "NAME=VALUE"]
[-ct proj_string] [-order n] [-tps] [-rpc] [-geoloc]
[-gcp pixel line easting northing [elevation]]* [-output_xy]
[srcfile [dstfile]]
Description
The gdaltransform utility reprojects a list of coordinates into any supported projection,including GCP-based transformations.
- -s_srs <srs_def>
Set source spatial reference. The coordinate systems that can be passed are anything supported by the OGRSpatialReference.SetFromUserInput() call, which includes EPSG PCS and GCSes (i.e. EPSG:4296), PROJ.4 declarations (as above), or the name of a .prj file containing well known text.
- -t_srs <srs_def>
set target spatial reference. The coordinate systems that can be passed are anything supported by the OGRSpatialReference.SetFromUserInput() call, which includes EPSG PCS and GCSes (i.e. EPSG:4296), PROJ.4 declarations (as above), or the name of a .prj file containing well known text.
- -ct <string>
A PROJ string (single step operation or multiple step string starting with +proj=pipeline), a WKT2 string describing a CoordinateOperation, or a urn:ogc:def:coordinateOperation:EPSG::XXXX URN overriding the default transformation from the source to the target CRS. It must take into account the axis order of the source and target CRS.
New in version 3.0.
- -to NAME=VALUE
set a transformer option suitable to pass to
GDALCreateGenImgProjTransformer2()
.
- -order <n>
order of polynomial used for warping (1 to 3). The default is to select a polynomial order based on the number of GCPs.
- -tps
Force use of thin plate spline transformer based on available GCPs.
- -rpc
Force use of RPCs.
- -geoloc
Force use of Geolocation Arrays.
- -i
Inverse transformation: from destination to source.
- -gcp <pixel> <line> <easting> <northing> [<elevation>]
Provide a GCP to be used for transformation (generally three or more are required)
- -output_xy
Restrict output to "x y" instead of "x y z"
- <srcfile>
File with source projection definition or GCP's. If not given, source projection is read from the command-line
-s_srs
or-gcp
parameters
- <dstfile>
File with destination projection definition.
Coordinates are read as pairs, triples (for 3D,) or (since GDAL 3.0.0,) quadruplets (for X,Y,Z,time) of numbers per line from standard input, transformed, and written out to standard output in the same way. All transformations offered by gdalwarp are handled, including gcp-based ones.
Note that input and output must always be in decimal form. There is currently no support for DMS input or output.
If an input image file is provided, input is in pixel/line coordinates on that image. If an output file is provided, output is in pixel/line coordinates on that image.
Examples
Reprojection Example
Simple reprojection from one projected coordinate system to another:
gdaltransform -s_srs EPSG:28992 -t_srs EPSG:31370
177502 311865
Produces the following output in meters in the "Belge 1972 / Belgian Lambert 72" projection:
244510.77404604<PHONE_NUMBER>71342 -1046.79270555763
Image RPC Example
The following command requests an RPC based transformation using the RPC model associated with the named file. Because the -i (inverse) flag is used, the transformation is from output georeferenced (WGS84) coordinates back to image coordinates.
gdaltransform -i -rpc 06OCT20025052-P2AS-005553965230_01_P001.TIF
125.67206 39.85307 50
Produces this output measured in pixels and lines on the image:
3499.49282422381 2910.83892848414 50
X,Y,Z,time transform
15-term time-dependent Helmert coordinate transformation from ITRF2000 to ITRF93 for a coordinate at epoch 2000.0
gdaltransform -ct "+proj=pipeline +step +proj=unitconvert +xy_in=deg \
+xy_out=rad +step +proj=cart +step +proj=helmert +convention=position_vector \
+x=0.0127 +dx=-0.0029 +rx=-0.00039 +drx=-0.00011 +y=0.0065 +dy=-0.0002 \
+ry=0.00080 +dry=-0.00019 +z=-0.0209 +dz=-0.0006 +rz=-0.00114 +drz=0.00007 \
+s=0.00195 +ds=0.00001 +t_epoch=1988.0 +step +proj=cart +inv +step \
+proj=unitconvert +xy_in=rad +xy_out=deg"
2 49 0 2000
Produces this output measured in longitude degrees, latitude degrees and ellipsoid height in metre:
2.0000005420366 49.0000003766711 -0.0222802283242345


Structure and Field Descriptions¶
SeisChannel Fields¶
| Name | Type | Meaning |
|---|---|---|
| id | String | unique channel ID formatted net.sta.loc.cha |
| name | String | freeform channel name string |
| src | String | description of data source |
| units | String | units of dependent variable [1] |
| fs | Float64 | sampling frequency in Hz |
| gain | Float64 | scalar to convert x to SI units in flat part of power spectrum [2] |
| loc | Array{Float64,1} | sensor location: [lat, lon, ele, az, inc] [3] |
| resp | Array{Complex {Float64},2} | complex instrument response [4] |
| misc | Dict{String,Any} | miscellaneous information [5] |
| notes | Array{String,1} | timestamped notes |
| t | Array{Int64,2} | time gaps (see below) |
| x | Array{Float64,1} | univariate data |
Table Footnotes
| [1] | Use UCUM-compliant abbreviations wherever possible. |
| [2] | Gain has an identical meaning to the “Stage 0 gain” of FDSN XML. |
| [3] | Azimuth is measured clockwise from North; incidence of 0° = vertical; both use degrees. |
| [4] | Zeros in :resp[i][:,1] , poles in :resp[i][:,2] . |
| [5] | Arrays in :misc should each contain a single Type (e.g. Array{Float64,1}, never Array{Any,1}). See the SeisIO file format description for a full list of allowed value types in :misc. |
SeisData Fields¶
As SeisChannel, plus
| Name | Type | Meaning |
|---|---|---|
| n | Int64 | number of channels |
| c | Array{TCPSocket,1} | array of TCP connections |
Time Convention¶
The units of t
are integer microseconds, measured from Unix epoch time
(1970-01-01T00:00:00.000).
For regularly sampled data (fs > 0.0
), each t
is a sparse
delta-compressed representation of time gaps in the corresponding x
.
The first column stores indices of gaps; the second, gap lengths.
Within each time field, t[1,2]
stores the time of the first sample of the
corresponding x
. The last row of each t
should always take the form `
[length(x) 0]`. Other rows take the form [(starting index of gap) (length of gap)]
.
For irregularly sampled data (fs = 0
), t[:,2]
is a dense
representation of time stamps for each sample.
SeisHdr Fields¶
| Name | Type | Meaning |
|---|---|---|
| id | Int64 | numeric event ID |
| ot | DateTime | origin time |
| loc | Array{Float64, 1} | hypocenter |
| mag | Tuple{Float32, String} | magnitude, scale |
| int | Tuple{UInt8, String} | intensity, scale |
| mt | Array{Float64, 1} | moment tensor: (1-6) tensor, (7) scalar moment, (8) %dc |
| np | Array{Tuple{Float64, Float64, Float64},1} | nodal planes |
| pax | Array{Tuple{Float64, Float64, Float64},1} | principal axes, ordered P, T, N |
| src | String | data source (e.g. url/filename) |
SeisEvent Fields¶
| Name | Type | Meaning |
|---|---|---|
| hdr | SeisHdr | event header |
| data | SeisData | event data |


including car accidents, dog
bites, nursing home neglect
and slips and falls
including charges of driving
under the influence (DUI), theft,
drug possession, conspiracy
and more
including speeding tickets,
driving with a suspended
license, operating an uninsured
or unregistered vehicle and
other moving violations
At Canas & Flores, we provide honest answers, aggressive representation and sound legal strategies to clients in and around Fort Worth, Texas. With 50 years of combined experience in helping people with their legal matters, we treat your case with the individual attention that it deserves, taking the time to answer all your questions and address all your concerns. And whether you’ve been injured in a car accident, need help enforcing child support or have been charged with a DUI, we are your advocates — committed to protecting your rights, your interests and your freedom.
Read MoreHelping you find the help you need
Like you and so many of our clients, we come from a background where family means everything and where neighbors help neighbors. We also know what it is to work hard for a living. That’s why when you come to us for help with a family law, personal injury, criminal defense or traffic violation legal issue, we represent you with integrity, compassion, professionalism and determination. You are the client. And our lawyers work for you.
Attorney Eduardo Cañas is the founding partner of the law firm of Canas & Flores. He received his J.D.
from Texas Tech University School of Law and was admitted to the Texas Bar in 1985.
1441 North main street fort worth, Texas 76164
817-332-6060
817-332-7636
Website by: Precision Legal Marketing


CS Mini-Games
Something idk
Another thing
I really dk
Max 6
AboutUs (+discord)
The CSWeek Webpage!
© South Windsor High School CS Club
Download license
Currently under construction - please check back soon!


Rumored Electric Hummer Would Pit A Familiar Brand Against Tesla, Rivian Pickup Truck
by Brooke CrothersAn electric Hummer pickup and SUV could arrive by 2021. GM will build a Hummer pickup truck and SUV in late 2021, a report from Detroit News said this past week, citing Jeff Schuster, an industry analyst with LMC Automotive.
This follows an October report from Reuters about the “BT1 electric truck/SUV” program, part of a planned $3 billion investment in the Detroit-Hamtramck plant to make electric trucks and vans. The Reuters report also said GM could tap the Hummer brand.
This is not a Chevy Bolt or Cadillac or GMC pickup
Unlike Chevrolet’s plug-in hybrid Volt (now discontinued) and Bolt EV, Hummer is virtually a household for many Americans. And it carries more off-road cred and badassness than a brand like Cadillac or even GMC – both also likely EV candidates.
In short, the Hummer brand could be a leg up* for GM, which has yet to see the massive market share gains made by the Tesla Model 3 or the darling of green car buyers a decade ago, the Toyota Prius.
“Putting a Hummer badge on anything is a great idea for General Motors because half the marketing is already paid for,” Auto Forecast Solutions vice president of global vehicle forecasting Sam Fiorani told Reuters.
Rivian and imminent Tesla pickups
GM will need all of the brand recognition it can get against the highly-anticipated Tesla pickup, set for announcement on November 21, and the Rivian R1T pickup and R1S SUV.
The Rivian vehicles are already getting attention for their ambitious designs. Both will get a motor for each wheel to boost handling and off road excursions.
Rivian is also claiming that the the 135-kWh model will get over 300 miles of range and the 180-kWh version over 400 miles. The R1S will have similar, though slightly better, range.
Production is slated to begin in the U.S. next year for both vehicles.
And Tesla? Needless to say, whatever Tesla announces on the 21st will get gobs of attention and likely land plenty of preorders.
But a bold Hummer EV design could put a good fight out the gate, giving it a better chance than the Bolt ever had.
––
NOTES:
*GM’s marketing of the Volt (on the market from 2010 through early 2019) and Bolt EV has been pretty sad – one reason for limited recognition and middling sales. For example, the Bolt rarely appears in national TV campaigns, which almost often feature GM’s latest gas vehicles only.


Methods of Class OUStringBuffer
- OUStringBuffer
- OUStringBuffer();
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Constructs a string buffer with no characters in it and an
initial capacity of 16 characters.
- OUStringBuffer
- OUStringBuffer(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Allocates a new string buffer that contains the same sequence of
characters as the string buffer argument.
- Parameters
-
- OUStringBuffer
- OUStringBuffer(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Constructs a string buffer with no characters in it and an
initial capacity specified by the
length
argument.
- Parameters
| length |
the initial capacity.
|
- OUStringBuffer
- OUStringBuffer(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Constructs a string buffer so that it represents the same
sequence of characters as the string argument.
- Description
- The initial
capacity of the string buffer is
16
plus the length
of the string argument.
- Parameters
| str |
the initial contents of the buffer.
|
- operator=
- OUStringBuffer & operator=(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Assign to this a copy of value.
- ~OUStringBuffer
- ~OUStringBuffer();
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Release the string data.
- makeStringAndClear
- OUString makeStringAndClear();
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Fill the string data in the new string and clear the buffer.
- Description
- This method is more efficient than the contructor of the string. It does
not copy the buffer.
- Return
- the string previously contained in the buffer.
- getLength
- sal_Int32 getLength();
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Returns the length (character count) of this string buffer.
- Return
- the number of characters in this string buffer.
- getCapacity
- sal_Int32 getCapacity();
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Returns the current capacity of the String buffer.
- Description
- The capacity
is the amount of storage available for newly inserted
characters. The real buffer size is 2 bytes longer, because
all strings are 0 terminated.
- Return
- the current capacity of this string buffer.
- ensureCapacity
- void ensureCapacity(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Ensures that the capacity of the buffer is at least equal to the
specified minimum.
- Description
- The new capacity will be at least as large as the maximum of the current
length (so that no contents of the buffer is destroyed) and the given
minimumCapacity. If the given minimumCapacity is negative, nothing is
changed.
- Parameters
| minimumCapacity |
the minimum desired capacity.
|
- setLength
- void setLength(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Sets the length of this String buffer.
- Description
- If the
newLength
argument is less than the current
length of the string buffer, the string buffer is truncated to
contain exactly the number of characters given by the
newLength
argument.
If the newLength
argument is greater than or equal
to the current length, sufficient null characters
('\u0000'
) are appended to the string buffer so that
length becomes the newLength
argument.
The newLength
argument must be greater than or equal
to 0
.
- Parameters
| newLength |
the new length of the buffer.
|
- charAt
- sal_Unicode charAt(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
YES |
NO |
NO |
NO |
YES |
NO |
- Summary
- Returns the character at a specific index in this string buffer.
- Description
- The first character of a string buffer is at index
0
, the next at index 1
, and so on, for
array indexing.
The index argument must be greater than or equal to
0
, and less than the length of this string buffer.
- Parameters
| index |
the index of the desired character.
|
- Return
- the character at the specified index of this string buffer.
- operator const sal_Unicode *
- operator const sal_Unicode *();
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Return a null terminated unicode character array.
- getStr
- const sal_Unicode * getStr();
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Return a null terminated unicode character array.
- setCharAt
- OUStringBuffer & setCharAt(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- The character at the specified index of this string buffer is set
to
ch
.
- Description
- The index argument must be greater than or equal to
0
, and less than the length of this string buffer.
- Parameters
| index |
the index of the character to modify.
|
| ch |
the new character.
|
- append
- OUStringBuffer & append(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Appends the string to this string buffer.
- Description
- The characters of the
String
argument are appended, in
order, to the contents of this string buffer, increasing the
length of this string buffer by the length of the argument.
- Parameters
-
- Return
- this string buffer.
- append
- OUStringBuffer & append(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Appends the string representation of the
char
array
argument to this string buffer.
- Description
- The characters of the array argument are appended, in order, to
the contents of this string buffer. The length of this string
buffer increases by the length of the argument.
- Parameters
| str |
the characters to be appended.
|
- Return
- this string buffer.
- append
- OUStringBuffer & append(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Appends the string representation of the
char
array
argument to this string buffer.
- Description
- Characters of the character array
str
are appended,
in order, to the contents of this string buffer. The length of this
string buffer increases by the value of len
.
- Parameters
| str |
the characters to be appended; must be non-null, and must
point to at least len characters
|
| len |
the number of characters to append; must be non-negative
|
- Return
- this string buffer.
- appendAscii
- OUStringBuffer & appendAscii(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Appends a 8-Bit ASCII character string to this string buffer.
- Description
- Since this method is optimized for performance. the ASCII
character values are not converted in any way. The caller
has to make sure that all ASCII characters are in the
allowed range between 0 and 127. The ASCII string must be
NULL-terminated.
The characters of the array argument are appended, in order, to
the contents of this string buffer. The length of this string
buffer increases by the length of the argument.
- Parameters
| str |
the 8-Bit ASCII characters to be appended.
|
- Return
- this string buffer.
- appendAscii
- OUStringBuffer & appendAscii(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Appends a 8-Bit ASCII character string to this string buffer.
- Description
- Since this method is optimized for performance. the ASCII
character values are not converted in any way. The caller
has to make sure that all ASCII characters are in the
allowed range between 0 and 127. The ASCII string must be
NULL-terminated.
Characters of the character array str
are appended,
in order, to the contents of this string buffer. The length of this
string buffer increases by the value of len
.
- Parameters
| str |
the 8-Bit ASCII characters to be appended; must be non-null,
and must point to at least len characters
|
| len |
the number of characters to append; must be non-negative
|
- Return
- this string buffer.
- append
- OUStringBuffer & append(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Appends the string representation of the
sal_Bool
argument to the string buffer.
- Description
- The argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then appended to this string buffer.
- Parameters
-
- Return
- this string buffer.
- append
- OUStringBuffer & append(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Appends the string representation of the
char
argument to this string buffer.
- Description
- The argument is appended to the contents of this string buffer.
The length of this string buffer increases by
1
.
- Parameters
-
- Return
- this string buffer.
- append
- OUStringBuffer & append(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Appends the string representation of the
sal_Int32
argument to this string buffer.
- Description
- The argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then appended to this string buffer.
- Parameters
-
- Return
- this string buffer.
- append
- OUStringBuffer & append(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Appends the string representation of the
long
argument to this string buffer.
- Description
- The argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then appended to this string buffer.
- Parameters
-
- Return
- this string buffer.
- append
- OUStringBuffer & append(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Appends the string representation of the
float
argument to this string buffer.
- Description
- The argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then appended to this string buffer.
- Parameters
-
- Return
- this string buffer.
- append
- OUStringBuffer & append(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Appends the string representation of the
double
argument to this string buffer.
- Description
- The argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then appended to this string buffer.
- Parameters
-
- Return
- this string buffer.
- appendUtf32
- OUStringBuffer & appendUtf32(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Appends a single UTF-32 character to this string buffer.
- Description
-
The single UTF-32 character will be represented within the string
buffer as either one or two UTF-16 code units.
- Parameters
| c |
a well-formed UTF-32 code unit (that is, a value in the range
0 –0x10FFFF , but excluding
0xD800 –0xDFFF )
|
- Return
-
this string buffer
- insert
- OUStringBuffer & insert(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Inserts the string into this string buffer.
- Description
- The characters of the
String
argument are inserted, in
order, into this string buffer at the indicated offset. The length
of this string buffer is increased by the length of the argument.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
string buffer.
- Parameters
| offset |
the offset.
|
| str |
a string.
|
- Return
- this string buffer.
- insert
- OUStringBuffer & insert(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Inserts the string representation of the
char
array
argument into this string buffer.
- Description
- The characters of the array argument are inserted into the
contents of this string buffer at the position indicated by
offset
. The length of this string buffer increases by
the length of the argument.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
string buffer.
- Parameters
| offset |
the offset.
|
| ch |
a character array.
|
- Return
- this string buffer.
- insert
- OUStringBuffer & insert(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Inserts the string representation of the
char
array
argument into this string buffer.
- Description
- The characters of the array argument are inserted into the
contents of this string buffer at the position indicated by
offset
. The length of this string buffer increases by
the length of the argument.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
string buffer.
- Parameters
| offset |
the offset.
|
| ch |
a character array.
|
| len |
the number of characters to append.
|
- Return
- this string buffer.
- insert
- OUStringBuffer & insert(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Inserts the string representation of the
sal_Bool
argument into this string buffer.
- Description
- The second argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then inserted into this string buffer at the indicated
offset.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
string buffer.
- Parameters
| offset |
the offset.
|
| b |
a sal_Bool .
|
- Return
- this string buffer.
- insert
- OUStringBuffer & insert(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Inserts the string representation of the
char
argument into this string buffer.
- Description
- The second argument is inserted into the contents of this string
buffer at the position indicated by
offset
. The length
of this string buffer increases by one.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
string buffer.
- Parameters
| offset |
the offset.
|
| ch |
a char .
|
- Return
- this string buffer.
- insert
- OUStringBuffer & insert(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Inserts the string representation of the second
sal_Int32
argument into this string buffer.
- Description
- The second argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then inserted into this string buffer at the indicated
offset.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
string buffer.
- Parameters
| offset |
the offset.
|
| b |
an sal_Int32 .
|
- Return
- this string buffer.
- insert
- OUStringBuffer & insert(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Inserts the string representation of the
long
argument into this string buffer.
- Description
- The second argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then inserted into this string buffer at the indicated
offset.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
string buffer.
- Parameters
| offset |
the offset.
|
| b |
a long .
|
- Return
- this string buffer.
- insert
- OUStringBuffer insert(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Inserts the string representation of the
float
argument into this string buffer.
- Description
- The second argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then inserted into this string buffer at the indicated
offset.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
string buffer.
- Parameters
| offset |
the offset.
|
| b |
a float .
|
- Return
- this string buffer.
- insert
- OUStringBuffer & insert(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Inserts the string representation of the
double
argument into this string buffer.
- Description
- The second argument is converted to a string as if by the method
String.valueOf
, and the characters of that
string are then inserted into this string buffer at the indicated
offset.
The offset argument must be greater than or equal to
0
, and less than or equal to the length of this
string buffer.
- Parameters
| offset |
the offset.
|
| b |
a double .
|
- Return
- this string buffer.
- insertUtf32
- OUStringBuffer & insertUtf32(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Inserts a single UTF-32 character into this string buffer.
- Description
-
The single UTF-32 character will be represented within the string
buffer as either one or two UTF-16 code units.
- Parameters
| offset |
the offset into this string buffer (from zero to the length
of this string buffer, inclusive)
|
| c |
a well-formed UTF-32 code unit (that is, a value in the range
0 –0x10FFFF , but excluding
0xD800 –0xDFFF )
|
- Return
- this string buffer
- accessInternals
- void accessInternals(
-
| virtual |
abstract |
const |
volatile |
template |
static |
inline |
C-linkage |
| NO |
NO |
NO |
NO |
NO |
NO |
YES |
NO |
- Summary
- Allows access to the internal data of this OUStringBuffer, for effective
manipulation.
- Description
- This method should be used with care. After you have called this
method, you may use the returned pInternalData or pInternalCapacity only
as long as you make no other method call on this OUStringBuffer.
- Parameters
| pInternalData |
This output parameter receives a pointer to the internal data
(rtl_uString pointer). pInternalData itself must not be null.
|
| pInternalCapacity |
This output parameter receives a pointer to the internal capacity.
pInternalCapacity itself must not be null.
|
Top of Page
Copyright © 2012, The Apache Software Foundation, Licensed under the Apache License, Version 2.0. Apache, the Apache feather logo, Apache OpenOffice and OpenOffice.org are trademarks of The Apache Software Foundation. Other names may be trademarks of their respective owners.


Population calculator
Total fertility rate
Growth rate (yearly)
immigration/year
Starting population
First birth given (age)
Human age (average)
Timespan (years)
Age pyramid
Flat
Ages 10-40 emphasized


WELL WORSHIP.
"A well there is in the west country,
And a clearer one never was seen."
Robert Southey
"One meek cell,
Built by the fathers o'er a lonely well,
Still breathes the Baptist's sweet remembrance round
A spring of silent waters."
Echoes from Old Cornwall--R. S. HAWKES.
SPRING of water has always something about it which gives rise to holy feelings. From the dark earth there wells up a pellucid fluid, which in its apparent tranquil joyousness gives gladness to all around. The velvet mosses, the sword. like grasses, and the feathery ferns, grow with more of that light and vigorous nature which indicates a fulness of life, within the charmed influence of a spring of water, than they do elsewhere.
The purity of the fluid impresses itself; through the eye, upon the mind, and its power of removing all impurity is felt to the soul. "Wash and be clean," is the murmuring call of the waters, as they overflow their rocky basins, or grassy vases; and deeply sunk in depravity must that man be who could put to unholy uses one of nature's fountains. The inner life of a well of waters, bursting from its grave in the earth, may be religiously said to form a type of the soul purified by death, rising into a glorified existence and' the fulness of light. The tranquil beauty of the rising waters, whispering the softest music, like the healthful breathing of a sleeping infant, sends a feeling of happiness through the soul of the thoughtful observer, and the inner man is purified by its influence, as the outer man is cleansed by ablution.
Water cannot be regarded as having an inanimate existence. Its all-pervading character and its active nature, flowing on foi ever, resting never, removes it from the torpid elements, and places it, like the air, amongst those higher creations which belong to the vital powers of the earth. The spring of water rises from the cold dark earth, it runs, a silver cord glistening in the sunshine, down the mountain-side. The ril (prettily called by Drayton "a rillet ") gathers rejoicingly other waters unto itself; and it grows into a brooklet in its course. At length, flowing onward and increasing in size, the brook state of being is fairly won; and then, by the gathering together of some more dewdrops, the full dignity of a stream is acquired. Onwards the waters flow, still gleaming from every side, and wooing new runlets to its bosom, eager as it were to assume the state which, in America, would be called a "run" of water. Stream gathers on stream, and run on run; the union of waters becomes a river; rolling in its maturity, swelling in its pride, it seeks the ocean, and there is absorbed in the eternity of waters. Has ever poet yet penned a line which in any way conveys to the mind a sense of the grandeur, the immensity of the sea? I do not remember a verse which does not prove the incapacity of the human mind to embrace in its vastness the gathering together of the waters in the mighty sea. Man's mind is tempered, and his pride subdued, as he stands on the sea-side and looks on the undulating expanse to which, to him, there is no end. A material eternity of rain-drops gathered into a mass which is from Omnipotence and is omnipotent. The influences of heaven falling on the sheeted waters, they rise at their bidding and float in air, making the skies more beautiful or more sublime, according to the spirit of the hour. Whether the clouds float over the earth, illumined by sun-rays, like the cars of loving angels; or rush wildly onward, as if bearing demons of vengeance, they are subdued by the mountains, and fall reluctantly as mists around the rocks, condense solemnly as dews upon the sleeping flowers, sink to earth resignedly as tranquil rains, or splash in tempestuous anger on its surface. The draught, in whatever form it comes, is drunk with avidity, and, circulating through the subterranean recesses of the globe, it does its work of re-creation, and eventually reappears a bubbling' spring, again to run its round of wonder-working tasks.
Those minds which saw a God in light, and worshipped a Creator in the sun, felt the power of the universal solvent, and saw in the diffusive nature of that fluid which is everywhere something more than a type of the regenerating Spirit, which all, in their holier hours, feel necessary to clear off the earthiness of life. Man has ever sought to discover the spiritual in the material, and, from the imperfections of human reason, he has too frequently reposed on the material, and given to it the attributes which are purely spiritual. Through all ages the fountains of the hills and valleys have claimed the reverence of men; and waters presenting themselves, under aspects of beauty, or of terror, have been regarded with religious feelings of hope or of awe.
As it was of old, so is it to-day. It was but yesterday that I stood near the font of Royston Church, and heard the minister read with emphasis, "None can enter into the kingdom of God except he be regenerate and born anew of water." Surely the simple faith of the peasant mother who, on a spring morning, takes her weakly infant to some holy well, and three times dipping it in its clear waters, uttering an earnest prayer at each immersion, is but another form of the prescribed faith of the educated churchman.
Surely the practice of consulting the waters of a sacred spring, by young men and maidens, is but a traditional faith derived from the early creeds of Greece--a continuance of the Hydromancy which sought in the Castahian fountain the divination of the future.


Copyright (c) 1996 Kris Burm
GIPF is played on the following
initially empty hexagonal
board.
Each player starts with 18 stones in reserve.
|
Some remarks from the author: 1. Don't misinterpret the aim of the game; you can only win by capturing the opponent's pieces, not by returning your own pieces repeatedly from the board to the reserve! 2. A tie is not possible. The first player to run out of pieces loses the game, even if the other player, too, would run out of pieces in his next turn. 3. Players should always be able to see how many pieces the opponent has left in his reserve. Leave them clearly visible next to the board.
| An
example White started by placing a GIPF piece at a3, then Black insert at the same cell at east direction, pushing the white GIPF one cell. |
|
| Lines
of 4
Black inserted a piece at d1 (the red stone) at SE direction, pushing 4 stones on the same direction. There is now a line of 4 black pieces. The Black player must remove the 3 single stones and decide to remove or not the black GIPF, but it cannot capture the other two stones on the same line, since they are not adjacent to that line of 4 (there an empty cell in-between at b4). |
You can play GIPF at Rognlie's PbM server. There is also a program (for Linux and WIndows) called GF1 that plays the game. More information can be found at the GIPF project website - GIPF it's the 1st game of a series of 6.